The convergence speed is the most important feature of Back-Propagation (BP) algorithm. A lot of improvements were proposed to this algorithm since its presentation, in order to speed up the convergence phase. In this paper, a new modified BP algorithm called Speeding up Back-Propagation Learning (SUBPL) algorithm is proposed and compared to the standard BP. Different data sets were implemented and experimented to verify the improvement in SUBPL.
Among many problems that reduced the performance of the network, especially Wide Area Network, congestion is one of these, which is caused when traffic request reaches or exceeds the available capacity of a route, resulting in blocking and less throughput per unit time. Congestion management attributes try to manage such cases. The work presented in this paper deals with an important issue that is the Quality of Service (QoS) techniques. QoS is the combination effect on service level, which locates the user's degree of contentment of the service. In this paper, packet schedulers (FIFO, WFQ, CQ and PQ) were implemented and evaluated under different applications with different priorities. The results show that WFQ scheduler gives acceptable r
... Show MoreThis paper presents a minimum delay congestion control in differentiated Service communication networks. The premium and ordinary passage services based fluid flow theory is used to build the suggested structure in high efficient manage. The established system is capable to adeptly manage both the physical network resource limitations and indefinite time delay related to networking system structure.
Internet paths sharing the same congested link can be identified using several shared congestion detection techniques. The new detection technique which is proposed in this paper depends on the previous novel technique (delay correlation with wavelet denoising (DCW) with new denoising method called Discrete Multiwavelet Transform (DMWT) as signal denoising to separate between queuing delay caused by network congestion and delay caused by various other delay variations. The new detection technique provides faster convergence (3 to 5 seconds less than previous novel technique) while using fewer probe packets approximately half numbers than the previous novel technique, so it will reduce the overload on the network caused by probe packets.
... Show MoreNumerous regions in the city of Baghdad experience the congestion and traffic problems. Due to the religious and economic significance, Al-Kadhimiya city (inside the metropolitan range of Baghdad) was chosen as study area. The data gathering stage was separated into two branches: the questionnaire method which is utilized to estimate the traffic volumes for the chosen roads and field data collection method which included video recording and manual counting for the volumes entering the selected signal intersections. The stage of analysis and evaluation for the seventeen urban roads, one highway, and three intersections was performed by HCS-2000 software.The presented work plots a system for assessing the level of service
... Show MoreThe OpenStreetMap (OSM) project aims to establish a free geospatial database for the entire world which is editable by international volunteers. The OSM database contains a wide range of different types of geographical data and characteristics, including highways, buildings, and land use regions. The varying scientific backgrounds of the volunteers can affect the quality of the spatial data that is produced and shared on the internet as an OSM dataset. This study aims to compare the completeness and attribute accuracy of the OSM road networks with the data supplied by a digitizing process for areas in the Baghdad and Thi-Qar governorates. The analyses are primarily based on calculating the portion of the commission (extr
... Show MoreThe aim of this paper is to approximate multidimensional functions f∈C(R^s) by developing a new type of Feedforward neural networks (FFNS) which we called it Greedy ridge function neural networks (GRGFNNS). Also, we introduce a modification to the greedy algorithm which is used to train the greedy ridge function neural networks. An error bound are introduced in Sobolov space. Finally, a comparison was made between the three algorithms (modified greedy algorithm, Backpropagation algorithm and the result in [1]).
المستخلص يهدف هذا البحث الى تجاوز مشكلة البعدية من خلال طرائق الانحدار اللامعلمي والتي تعمل على تقليل جذر متوسط الخطأ التربيعي (RMSE) , أذ تم استعمال طريقة انحدار الاسقاطات المتلاحقة (PPR) ,والتي تعتبر احدى طرائق اختزال الابعاد التي تعمل على تجاوز مشكلة البعدية (curse of dimensionality) , وان طريقة (PPR) من التقنيات الاحصائية التي تهتم بأيجاد الاسقاطات الاكثر أهمية في البيانات المتعددة الابعاد , ومع ايجاد كل اسقاط
... Show MoreThe aim of this paper is to design artificial neural network as an alternative accurate tool to estimate concentration of Cadmium in contaminated soils for any depth and time. First, fifty soil samples were harvested from a phytoremediated contaminated site located in Qanat Aljaeesh in Baghdad city in Iraq. Second, a series of measurements were performed on the soil samples. The inputs are the soil depth, the time, and the soil parameters but the output is the concentration of Cu in the soil for depth x and time t. Third, design an ANN and its performance was evaluated using a test data set and then applied to estimate the concentration of Cadmium. The performance of the ANN technique was compared with the traditional laboratory inspecting
... Show MoreThe efficiency evaluation of the railway lines performance is done through a set of indicators and criteria, the most important are transport density, the productivity of enrollee, passenger vehicle production, the productivity of freight wagon, and the productivity of locomotives. This study includes an attempt to calculate the most important of these indicators which transport density index from productivity during the four indicators, using artificial neural network technology. Two neural networks software are used in this study, (Simulnet) and (Neuframe), the results of second program has been adopted. Training results and test to the neural network data used in the study, which are obtained from the international in
... Show MoreAbstract
This research aim to overcome the problem of dimensionality by using the methods of non-linear regression, which reduces the root of the average square error (RMSE), and is called the method of projection pursuit regression (PPR), which is one of the methods for reducing dimensions that work to overcome the problem of dimensionality (curse of dimensionality), The (PPR) method is a statistical technique that deals with finding the most important projections in multi-dimensional data , and With each finding projection , the data is reduced by linear compounds overall the projection. The process repeated to produce good projections until the best projections are obtained. The main idea of the PPR is to model
... Show More