Baghdad University Radio Telescope (BURT) is a 3 meter radio telescope that was installed in the main campus of the University of Baghdad in Jadiriyah. Radio telescopes, in general, offer a wide range of applications in radio astronomy, which are usually used to detect the neutral hydrogen emission line at a wavelength of 21 cm. One of the key applications of BURT is to observe the Milky Way galaxy and to determine its rotation curve. However, performing such observations requires accurate determination of the appropriate observing time as well as the coordinates. This paper focuses on how the observing time and coordinates are calculated correctly and accurately. The horizontal coordinate that corresponds to the galactic coor
... Show MoreThe Euphrates River Basin in Iraq suffers from climate changes represented by the scarcity of precipitation and the increase in temperatures, which is directly reflected in the discharge rates and the increase in total dissolved solids, and consequently, the increase in the dissolved loads in the river. Four measurement stations (Haditha, Ramadi, Fallujah, and Al-Hindiya) in the upper reach of the Euphrates River were investigated. Available data were analyzed from 1970 to 2020 related to precipitation (mm) and temperatures (°C). The results showed a clear decrease in precipitation rates over the years, while a clear increase in air temperature rates was observed. The discharge rates decreased temporally and spatially downs
... Show MoreReduce the required time for measuring the permeability of clayey soils by using new manufactured cell
In this paper we investigate the use of two types of local search methods (LSM), the Simulated Annealing (SA) and Particle Swarm Optimization (PSO), to solve the problems ( ) and . The results of the two LSMs are compared with the Branch and Bound method and good heuristic methods. This work shows the good performance of SA and PSO compared with the exact and heuristic methods in terms of best solutions and CPU time.
Machine scheduling problems (MSP) are considered as one of the most important classes of combinatorial optimization problems. In this paper, the problem of job scheduling on a single machine is studied to minimize the multiobjective and multiobjective objective function. This objective function is: total completion time, total lead time and maximum tardiness time, respectively, which are formulated as are formulated. In this study, a mathematical model is created to solve the research problem. This problem can be divided into several sub-problems and simple algorithms have been found to find the solutions to these sub-problems and compare them with efficient solutions. For this problem, some rules that provide efficient solutio
... Show More