A new modified differential evolution algorithm DE-BEA, is proposed to improve the reliability of the standard DE/current-to-rand/1/bin by implementing a new mutation scheme inspired by the bacterial evolutionary algorithm (BEA). The crossover and the selection schemes of the DE method are also modified to fit the new DE-BEA mechanism. The new scheme diversifies the population by applying to all the individuals a segment based scheme that generates multiple copies (clones) from each individual one-by-one and applies the BEA segment-wise mechanism. These new steps are embedded in the DE/current-to-rand/bin scheme. The performance of the new algorithm has been compared with several DE variants over eighteen benchmark functions including sever

     This paper describes the application of consensus optimization for Wireless Sensor Network (WSN) system. Consensus algorithm is usually conducted within a certain number of iterations for a given graph topology. Nevertheless, the best Number of Iterations (NOI) to reach consensus is varied in accordance with any change in number of nodes or other parameters of . graph topology. As a result, a time consuming trial and error procedure will necessary be applied
to obtain best NOI. The implementation of an intellig ent optimization can effectively help to get the optimal NOI. The performance of the consensus algorithm has considerably been improved by the inclusion of Particle Swarm Optimization (PSO). As a case s

planning is among the most significant in the field of robotics research.  As it is linked to finding a safe and efficient route in a cluttered environment for wheeled mobile robots and is considered a significant prerequisite for any such mobile robot project to be a success. This paper proposes the optimal path planning of the wheeled mobile robot with collision avoidance by using an algorithm called grey wolf optimization (GWO) as a method for finding the shortest and safe. The research goals in this study for identify the best path while taking into account the effect of the number of obstacles and design parameters on performance for the algorithm to find the best path. The simulations are run in the MATLAB environment to test the

This paper presents an improved technique on Ant Colony Optimization (ACO) algorithm. The procedure is applied on Single Machine with Infinite Bus (SMIB) system with power system stabilizer (PSS) at three different loading regimes. The simulations are made by using MATLAB software. The results show that by using Improved Ant Colony Optimization (IACO) the system will give better performance with less number of iterations as it compared with a previous modification on ACO. In addition, the probability of selecting the arc depends on the best ant performance and the evaporation rate.

This paper includes the application of Queuing theory with of Particle swarm algorithm or is called (Intelligence swarm) to solve the problem of The queues and developed for General commission for taxes /branch Karkh center in the service stage of the Department of calculators composed of six  employees , and it was chosen queuing model is a single-service channel  M / M / 1 according to the nature of the circuit work mentioned above and it will be divided according to the letters system for each employee, and  it was composed of data collection times (arrival time , service time, departure time)

This paper describes the problem of online autonomous mobile robot path planning, which is consisted of finding optimal paths or trajectories for an autonomous mobile robot from a starting point to a destination across a flat map of a terrain, represented by a 2-D workspace. An enhanced algorithm for solving the problem of path planning using Bacterial Foraging Optimization algorithm is presented. This nature-inspired metaheuristic algorithm, which imitates the foraging behavior of E-coli bacteria, was used to find the optimal path from a starting point to a target point. The proposed algorithm was demonstrated by simulations in both static and dynamic different environments. A comparative study was evaluated between the developed algori

Background: periodontitis is a chronic inflammatory disease causing destruction of the tooth supporting structures, initiated by dental plaque and modified by environmental and genetic risk factors. Cyclooxygenase-2 (COX-2) enzyme is responsible for the production of prostaglandin E2, an important mediator in the chronic periodontitis (CP) pathogenesis. Polymorphisms in COX-2 gene have linked to CP in different populations. Aim: To study the association between Cyclooxygenase-2 single nucleotide polymorphism rs689466 (-1195A/G SNP) and chronic periodontitis in a sample of Iraqi population. Methods: One hundred Iraqi subjects divided into two groups: case group consisted of 70 CP patient (35 males and 35 females) with age range 30-55 year

A  biological   experirne.rit   was  CQhducted ·ll1  the   (Ibn-  Al­

Haitham).  University        of   Baghdad  for   growing   seasens   on   of

2004/2005 (by using gypsum soil taken from Al- Doar area I Salah Al­ Dean provinc)  to stucl·- the effect three levels of phosphorus (0, 400,

SOO)rng ! pot and four  levels of zinc (0, 10,.. J 5, 2.0) tngf I pot on some

features of two  varieties -Qf    wheat, (triticum aestivurn var. rateh)and

(Triticum aestiv1lm Var. Ipa 99)..

R't

Background: Normal occlusal features of primary dentition are crucial for normal development of the permanent dentition. Breastfeeding is an important factor for both general and dental health of children. Aim: The aim of the present study is to assess the impact of the breastfeeding duration on the prevalence of normal occlusal features of the primary dentition among preschool children in Baghdad. Materials and Methods: The sample was 630 Iraqi children (270- boys, 360 girls), aged 3-5 years selected from four kindergartens in Baghdad city. The study was carried out through questionnaire and clinical examination. Normal occlusal features were examined as the presence or absence of interincisive spaces (IS) and primate spaces (PS), termi

conventional FCM algorithm does not fully utilize the spatial information in the image. In this research, we use a FCM algorithm that incorporates spatial information into the membership function for clustering. The spatial function is the summation of the membership functions in the neighborhood of each pixel under consideration. The advantages of the method are that it is less
sensitive to noise than other techniques, and it yields regions more homogeneous than those of other methods. This technique is a powerful method for noisy image segmentation.