This research aims at forecasting the public budget of Iraq (surplus or deficit) for 2017 & 2018 through using two methods to forecast. First: forecast budget surplus or deficit by using IMF estimations average oil price per barrel adopted in the public federal budget amounted to USD 44 in 2017 & USD 46 in 2018; Second: forecast budget surplus or deficit by using MOO actual average oil price in global markets amounted to USD 66 in 2018 through applying Dynamic Model & Static Model. Then analyze the models to reach the best one. The research concluded that those estimations of dynamic forecasting model of budget surplus or deficit for 2017 & 2018 gives good reliable results for future periods when using the a

An innovative desalination method called electrosorption or capacitive deionization (CDI) has significant benefits for wastewater treatment. This process is performed by using a carbon fiber electrode as a working electrode to remove hexavalent chromium ions from an aqueous solution. The pH, NaCl concentration, and cell voltage were optimized using the Box-Behnken experimental design (BDD) in response surface methodology (RSM) to study the effects and interactions of selected variables. To attain the relationship between the process variables and chromium removal, the experimental data were subjected to an analysis of variance and fitted with a quadratic model. The optimum conditions to remove Cr(VI) ions were: pH of 2, a cell voltage of 4.

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