The Research aims to investigate into reality in terms of planning and scheduling management process for sake the implementation and maintenance of irrigation and drainage projects in the Republic of Iraq, with an indication of the most important obstacles that impede the planning and scheduling management process for these projects and ways of addressing them and minimizing their effects.                                                  For the purpose of achieving the goal of the research, a sci

This paper is focused on orthogonal function approximation technique FAT-based adaptive backstepping control of a geared DC motor coupled with a rotational mechanical component. It is assumed that all parameters of the actuator are unknown including the torque-current constant (i.e., unknown input coefficient) and hence a control system with three motor control modes is proposed: 1) motor torque control mode, 2) motor current control mode, and 3) motor voltage control mode. The proposed control algorithm is a powerful tool to control a dynamic system with an unknown input coefficient. Each uncertain parameter/term is represented by a linear combination of weighting and orthogonal basis function vectors. Chebyshev polynomial is used

Background: Animal bite is one of the public health problems all over the world, especially in poor countries. Animal bites have an impact on human health due to rabies disease, which is a viral transmitted disease from animal to human with a high mortality rate.
Objective: To determine the epidemiological characteristics of animal bite cases by person, time, and place.
Method: Descriptive cross sectional study was done by reviewing cases caused by animal bites., Data including the demographic characteristics of age, gender, occupation, site of bite, and attending health institutions searching treatment were all included.
Results: There were 11600 animal bite cases. Most of bites caused by stray dogs 11577(99.8%), and the males

The university course timetable problem (UCTP) is typically a combinatorial optimization problem. Manually achieving a useful timetable requires many days of effort, and the results are still unsatisfactory. unsatisfactory. Various states of art methods (heuristic, meta-heuristic) are used to satisfactorily solve UCTP. However, these approaches typically represent the instance-specific solutions. The hyper-heuristic framework adequately addresses this complex problem. This research proposed Particle Swarm Optimizer-based Hyper Heuristic (HH PSO) to solve UCTP efficiently. PSO is used as a higher-level method that selects low-level heuristics (LLH) sequence which further generates an optimal solution. The proposed a