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).
In this research, the problem of ambiguity of the data for the project of establishing the typical reform complex in Basrah Governorate was eliminated. The blurry of the data represented by the time and cost of the activities was eliminated by using the Ranking function and converting them into normal numbers. Scheduling and managing the Project in the Critical Pathway (CPM) method to find the project completion time in normal conditions in the presence of non-traditional relationships between the activities and the existence of the lead and lag periods. The MS Project was used to find the critical path. The results showed that the project completion time (1309.5) dinars and the total cost has reached (33113017769) dinars and the
... Show MoreThe majority of real-world problems involve not only finding the optimal solution, but also this solution must satisfy one or more constraints. Differential evolution (DE) algorithm with constraints handling has been proposed to solve one of the most fundamental problems in cellular network design. This proposed method has been applied to solve the radio network planning (RNP) in the forthcoming 5G Long Term Evolution (5G LTE) wireless cellular network, that satisfies both deployment cost and energy savings by reducing the number of deployed micro base stations (BSs) in an area of interest. Practically, this has been implemented using constrained strategy that must guarantee good coverage for the users as well. Three differential evolution
... Show MoreThe rapid and enormous growth of the Internet of Things, as well as its widespread adoption, has resulted in the production of massive quantities of data that must be processed and sent to the cloud, but the delay in processing the data and the time it takes to send it to the cloud has resulted in the emergence of fog, a new generation of cloud in which the fog serves as an extension of cloud services at the edge of the network, reducing latency and traffic. The distribution of computational resources to minimize makespan and running costs is one of the disadvantages of fog computing. This paper provides a new approach for improving the task scheduling problem in a Cloud-Fog environme
In this paper Heun method has been used to find numerical solution for first order nonlinear functional differential equation. Moreover, this method has been modified in order to treat system of nonlinear functional differential equations .two numerical examples are given for conciliated the results of this method.
A biconical antenna has been developed for ultra-wideband sensing. A wide impedance bandwidth of around 115% at bandwidth 3.73-14 GHz is achieved which shows that the proposed antenna exhibits a fairly sensitive sensor for microwave medical imaging applications. The sensor and instrumentation is used together with an improved version of delay and sum image reconstruction algorithm on both fatty and glandular breast phantoms. The relatively new imaging set-up provides robust reconstruction of complex permittivity profiles especially in glandular phantoms, producing results that are well matched to the geometries and composition of the tissues. Respectively, the signal-to-clutter and the signal-to-mean ratios of the improved method are consis
... Show MoreThis paper describes the problem of online autonomous mobile robot path planning, which is consisted of finding optimal paths or trajectories for an autonomous mobile robot from a starting point to a destination across a flat map of a terrain, represented by a 2-D workspace. An enhanced algorithm for solving the problem of path planning using Bacterial Foraging Optimization algorithm is presented. This nature-inspired metaheuristic algorithm, which imitates the foraging behavior of E-coli bacteria, was used to find the optimal path from a starting point to a target point. The proposed algorithm was demonstrated by simulations in both static and dynamic different environments. A comparative study was evaluated between the developed algori
... Show MoreConcurrently with the technological development that the world is witnessing the crime of money laundering to evolve faster and with multiple methods and its economic, political and social impacts raised increasingly. And for phenomenon dangerous the international community in recent years is keen to be considered combating money laundering as a general indication whereby verification of the international response the stats and its banks and financial institutions with international requirements mandated in this aspect, so the increasing interest the governments of countries in the laws and procedures that contribute to the reduction of the phenomenon of money laundering and avoid legislation economy and the banking and financial sectors
... Show MoreAbstract:
The research aims to identify the concept of trading securities in Iraq and to propose a new mechanism for the taxation of trading profits and the extent of its impact on tax revenues, as it was observed that there are professional investors in the trading market and some of them achieve huge annual profits. and this profit should be like other taxable profits. The General Commission of Taxes and in cooperation with the Iraq Stock Exchange should identifying those profits, subjecting them to income tax, and adding them to the tax base. The researcher relied on the use of the descriptive and analytical approach bas
... Show More