􀀨􀀅􀀆􀀔􀀜􀀄􀀂􀀆􀀈􀀓􀀌􀀩􀀏􀀆􀀉􀀅􀀆􀀉􀀅􀀉􀀚􀀝􀀔􀀄􀀗􀀉􀀚􀀆􀀂􀀓􀀚􀀁􀀔􀀄􀀓􀀅􀀆􀀄􀀂􀀆􀀔􀀓􀀆􀀃􀀂􀀔􀀄􀀟􀀉􀀔􀀃􀀆􀀔􀀜􀀃􀀆􀀛􀀃􀀜􀀄􀀗􀀚􀀃􀀆􀀗􀀌􀀄􀀔􀀄􀀗􀀉􀀚􀀆􀀂􀀘􀀃􀀃􀀊􀀂􀀆􀀓􀀖􀀆􀀓􀀛􀀃􀀌􀀔􀀁􀀌􀀅􀀄􀀅􀀕􀀢􀀆􀀪􀀜􀀃􀀆􀀄􀀅􀀛􀀃􀀂􀀔􀀄􀀕􀀉􀀔􀀄􀀓􀀅􀀂􀀆 􀀉􀀌􀀃􀀆􀀙􀀉􀀂􀀃􀀊􀀆􀀓􀀅􀀆􀀉􀀁􀀔􀀓􀀟􀀓􀀙􀀄􀀚􀀃􀀆􀀚􀀉􀀔􀀃􀀌􀀉􀀚􀀆􀀂􀀘􀀉􀀗􀀃􀀆􀀟􀀄􀀊􀀂􀀔􀀆􀀔􀀜􀀃􀀆􀀗􀀃􀀅􀀔􀀃􀀌􀀚􀀄􀀅􀀃􀀂􀀆􀀓􀀖􀀆􀀔􀀜􀀃􀀆􀀙􀀉􀀂􀀃􀀆

This work bases on encouraging a generous and conceivable estimation for modified an algorithm for vehicle travel times on a highway from the eliminated traffic information using set aside camera image groupings. The strategy for the assessment of vehicle travel times relies upon the distinctive verification of traffic state. The particular vehicle velocities are gotten from acknowledged vehicle positions in two persistent images by working out the distance covered all through elapsed past time doing mollification between the removed traffic flow data and cultivating a plan to unequivocally predict vehicle travel times. Erbil road data base is used to recognize road locales around road segments which are projected into the commended camera

The parametric programming considered as type of sensitivity analysis. In this research concerning to study the effect of the variations on linear programming model (objective function coefficients and right hand side) on the optimal solution. To determine the parameter (θ) value (-5≤ θ ≤5).Whereas the result، the objective function equal  zero and the decision variables are non basic، when the parameter (θ = -5).The objective function value increases when the parameter (θ= 5) and the decision variables are basic، with the except of X_24, X₃₄.Whenever the parameter value increase, the objectiv

The study deals with the issue of multi-choice linear mathematical programming. The right side of the constraints will be multi-choice. However, the issue of multi-purpose mathematical programming can not be solved directly through linear or nonlinear techniques. The idea is to transform this matter into a normal linear problem and solve it In this research, a simple technique is introduced that enables us to deal with this issue as regular linear programming. The idea is to introduce a number of binary variables And its use to create a linear combination gives one parameter was used multiple. As well as the options of linear programming model to maximize profits to the General Company for Plastic Industries product irrigation sy

In this research, the one of the most important model and widely used in many and applications is linear mixed model, which widely used to analysis the longitudinal data that characterized by the repeated measures form .where estimating linear mixed model by using two methods (parametric and nonparametric) and used to estimate the conditional mean and marginal mean in linear mixed model ,A comparison between number of models is made to get the best model that will represent the mean wind speed in Iraq.The application is concerned with 8 meteorological stations in Iraq that we selected randomly and   then we take a monthly data about wind speed over ten years Then average it over each month in corresponding year, so we g

This paper describes DC motor speed control based on optimal Linear Quadratic Regulator (LQR) technique. Controller's objective is to maintain the speed of rotation of the motor shaft with a particular step response.The controller is modeled in MATLAB environment, the simulation results show that the proposed controller gives better performance and less settling time when compared with the traditional PID controller.

In the present work, a closed loop circulation system consist of three testing sections was designed and constructed. The testing sections made from (3m) of commercial carbon steel pipe of diameters(5.08, 2.54 and 1.91 cm) . Anionic surfactant  (SDBS )with  concentrations  of (50,  100,  150, 200 and 250 ppm)  was tested as a drag reducing  agent.  The additive(SDBS)studied using crude oil from south of Iraq. The flow rates of crude oil were used in 5.08 and 2.54 cm I.D. pipes are (1 - 12) m³/hr while (1-6) m3/hr were used in 1.91 cm J .D. pipe . Percentage drag reduction (%Dr) was found to increase by increasing solution velocity, pipe diameter and additives concentration (i.e. increasi

This work studied the facilitation of the transportation of Sharqi Baghdad heavy crude oil characterized with high viscosity 51.6 cSt at 40 °C, low API 18.8, and high asphaltenes content 7.1 wt.%, by reducing its viscosity from break down asphaltene agglomerates using different types of hydrocarbon and oxygenated polar solvents such as toluene, methanol, mix xylenes, and reformate. The best results are obtained by using methanol because it owns a high efficiency to reduce viscosity of crude oil to 21.1 cSt at 40 °C. Toluene, xylenes and reformate decreased viscosity to 25.3, 27.5 and 28,4 cSt at 40 °C, respectively. Asphaltenes content decreased to 4.2 wt. % by using toluene at 110 °C. And best improvement in API of the heavy crude o

Decolorization of red azo dye (Cibacron Red FN-R) from synthetic wastewater has been investigated as a function of solar advanced oxidation process. The photocatalytic activity using ZnO as a photocatalysis has been estimated. Different parameters affected the removal efficiency, including pH of the solution, initial dye concentration and H2O2 concentration were evaluated to find out the optimum value of these parameters. The results proved that the optimal pH value was 8 and the most efficient H2O2 concentration was 100mg/L. Toxicity reduction percent for effluent solution was also monitored to assess the degradation process. This treatment method was able to strongly reduce the color and toxicity of reactive red dye-238 to about (99 an

Finding the shortest route in wireless mesh networks is an important aspect. Many techniques are used to solve this problem like dynamic programming, evolutionary algorithms, weighted-sum techniques, and others. In this paper, we use dynamic programming techniques to find the shortest path in wireless mesh networks due to their generality, reduction of complexity and facilitation of numerical computation, simplicity in incorporating constraints, and their onformity to the stochastic nature of some problems. The routing problem is a multi-objective optimization problem with some constraints such as path capacity and end-to-end delay. Single-constraint routing problems and solutions using Dijkstra, Bellman-Ford, and Floyd-Warshall algorith