Manufacturing systems of the future foresee the use of intelligent vehicles, optimizing and navigating. The navigational problem is an important and challenging problem in the field of robotics. The robots often find themselves in a situation where they must find a trajectory to another position in their environment, subject to constraints posed by obstacles and the capabilities of the robot itself. On-line navigation is a set of algorithms that plans and executes a trajectory at the same time. The system adopted in this research searches for a robot collision-free trajectory in a dynamic environment in which obstacles can move while the robot was moving toward the target. So, the robot must operate in real-time such that the system reacts to unexpected obstacles. Genetic algorithms that have been used successfully in many search problems are used to solve the on-line navigation problem with less computational cost. The system uses genetic algorithm as a search method for an optimal trajectory.
The aim of this research is to compare traditional and modern methods to obtain the optimal solution using dynamic programming and intelligent algorithms to solve the problems of project management.
It shows the possible ways in which these problems can be addressed, drawing on a schedule of interrelated and sequential activities And clarifies the relationships between the activities to determine the beginning and end of each activity and determine the duration and cost of the total project and estimate the times used by each activity and determine the objectives sought by the project through planning, implementation and monitoring to maintain the budget assessed
... Show MoreRoaming data is an important source of information about the political and social activities of a country. And this is true for Iraq situation after 2003 when the mobile companies started their business. In this paper, data of subscribers roamed onto foreign networks (inbound roamers) is collected; it consists of the name of the Radio Control Point, the counter dealing with this type of information, Mobile Network Code/Mobile Country Code tupel. This data is processed. Results obtained out of this process show the classification of the inbound roamers (according to their countries) during the occupation period (2008-2009). These results reflect the political situation of Iraq at that time. Information resulted from this proc
... Show More
Seeking pharmacist advice about minor ailments is a common practice among Iraqi patients because such advice is free and quick. Unfortunately, the assessment and management of minor ailments by Iraqi pharmacists were inappropriate. Therefore, this study aimed to develop a model for a mobile application that can assist community pharmacists in the diagnosis and management of minor ailments.
The scientific content of the application was based on the information in the symptoms in the pharmacy and British Nati
Root-finding is an oldest classical problem, which is still an important research topic, due to its impact on computational algebra and geometry. In communications systems, when the impulse response of the channel is minimum phase the state of equalization algorithm is reduced and the spectral efficiency will improved. To make the channel impulse response minimum phase the prefilter which is called minimum phase filter is used, the adaptation of the minimum phase filter need root finding algorithm. In this paper, the VHDL implementation of the root finding algorithm introduced by Clark and Hau is introduced.
VHDL program is used in the work, to find the roots of two channels and make them minimum phase, the obtained output results are