Traditionally, path selection within routing is formulated as a shortest path optimization problem. The objective function for optimization could be any one variety of parameters such as number of hops, delay, cost...etc. The problem of least cost delay constraint routing is studied in this paper since delay constraint is very common requirement of many multimedia applications and cost minimization captures the need to
distribute the network. So an iterative algorithm is proposed in this paper to solve this problem. It is appeared from the results of applying this algorithm that it gave the optimal path (optimal solution) from among multiple feasible paths (feasible solutions).
The researcher studied transportation problem because it's great importance in the country's economy. This paper which ware studied several ways to find a solution closely to the optimization, has applied these methods to the practical reality by taking one oil derivatives which is benzene product, where the first purpose of this study is, how we can reduce the total costs of transportation for product of petrol from warehouses in the province of Baghdad, to some stations in the Karsh district and Rusafa in the same province. Secondly, how can we address the Domandes of each station by required quantity which is depending on absorptive capacity of the warehouses (quantities supply), And through r
... Show Morethe bank sect for any country is very important because its represent a major nerve to feed a verity economic and finance activities .development any state measure by development banking sets and its represent important factor to investors attract . and because important of this subject ,teen accounting rule is a specialized for it .its related by Disclosures in the Financial Statements Of Banks and The Similar Institutions, its accredit by auditing and accounting standard consul in republic of Iraq.in date 10/28/1998. &
... Show MoreThe 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.
Construction projects have become a changing dramatically in recent decades and that the goal of the beneficiaries of the implementation of structural project is to complete the work with less time and within the cost of the specific and the best possible quality may sometimes happen that highlights the importance of time on the rest of the items at the implementation of projects for various reasons, including the need to use the project as soon as possible possible change rapidly to customer's requests, but the high cost of the project represents the biggest obstacle for entrepreneurs with its effects on the quality and the time workers, and is a measure of those elements in monetary terms is the key to integration between them, so the
... Show MoreThis investigation aimed to explain the mechanism of MFCA by applying this method on air-cooled engine factory which was suffering from high production cost. The results of this study revealed that MFCA is a useful tool to identify losses and inefficiencies of the production process. It is found that the factory is suffering from high losses due to material energy and system losses. In conclusion, it is calculated that system losses are the highest among all the losses due to inefficient use of available production capacity.
Abstract
In this research we been estimated the survival function for data suffer from the disturbances and confusion of Iraq Household Socio-Economic Survey: IHSES II 2012 , to data from a five-year age groups follow the distribution of the Generalized Gamma: GG. It had been used two methods for the purposes of estimating and fitting which is the way the Principle of Maximizing Entropy: POME, and method of booting to nonparametric smoothing function for Kernel, to overcome the mathematical problems plaguing integrals contained in this distribution in particular of the integration of the incomplete gamma function, along with the use of traditional way in which is the Maximum Likelihood: ML. Where the comparison on t
... Show MoreThis study focused on spectral clustering (SC) and three-constraint affinity matrix spectral clustering (3CAM-SC) to determine the number of clusters and the membership of the clusters of the COST 2100 channel model (C2CM) multipath dataset simultaneously. Various multipath clustering approaches solve only the number of clusters without taking into consideration the membership of clusters. The problem of giving only the number of clusters is that there is no assurance that the membership of the multipath clusters is accurate even though the number of clusters is correct. SC and 3CAM-SC aimed to solve this problem by determining the membership of the clusters. The cluster and the cluster count were then computed through the cluster-wise J
... Show More