The increasing availability of computing power in the past two decades has been use to develop new techniques for optimizing solution of estimation problem. Today's computational capacity and the widespread availability of computers have enabled development of new generation of intelligent computing techniques, such as our interest algorithm, this paper presents one of new class of stochastic search algorithm (known as Canonical Genetic' Algorithm ‘CGA’) for optimizing the maximum likelihood function strategy is composed of three main steps: recombination, mutation, and selection. The experimental design is based on simulating the CGA with different values of are compared with those of moment method. Based on MSE value obtained from bot

     The study aims to assess some physical, chemical, and bacterial characteristics of two drinking water treatment plants of Al- Dora and Al-Qadisiya in the area of ​​Karkh, Baghdad, Iraq. The areas covered by each plants and these sites of areas selected as the nearest and the farthest point from plants, for winter and summer season. Some physicochemical parameters of water quality were taken in this study and these parameters were temperature water, pH, electrical conductivity, total dissolved solids, free residual chlorine, calcium, magnesium, nitrate, nitrite, sulphate and heavy metals (lead). In addition to four bacterial indicators of drinking water pollution (APC, Total Coliform, Fecal Coliform

 Finding a path solution in a dynamic environment represents a challenge for the robotics researchers, furthermore, it is the main issue for autonomous robots and manipulators since nowadays the world is looking forward to this challenge. The collision free path for robot in an environment with moving obstacles such as different objects, humans, animals or other robots is considered as an actual problem that needs to be solved.  In addition, the local minima and sharp edges are the most common problems in all path planning algorithms. The main objective of this work is to overcome these problems by demonstrating the robot path planning and obstacle avoidance using D star (D*) algorithm based on Particle Swarm Optimization (PSO)

     Community detection is an important and interesting topic for better understanding and analyzing complex network structures. Detecting hidden partitions in complex networks is proven to be an NP-hard problem that may not be accurately resolved using traditional methods. So it is solved using evolutionary computation methods and modeled in the literature as an optimization problem.  In recent years, many researchers have directed their research efforts toward addressing the problem of community structure detection by developing different algorithms and making use of single-objective optimization methods. In this study, we have continued that research line by improving the Particle Swarm Optimization (PSO) algorithm using a

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.

The estimation of the parameters of linear regression is based on the usual Least Square method, as this method is based on the estimation of several basic assumptions. Therefore, the accuracy of estimating the parameters of the model depends on the validity of these hypotheses. The most successful technique was the robust estimation method which is minimizing maximum likelihood estimator (MM-estimator) that proved its efficiency in this purpose. However, the use of the model becomes unrealistic and one of these assumptions is the uniformity of the variance and the normal distribution of the error. These assumptions are not achievable in the case of studying a specific problem that may include complex data of more than one model. To

Conducted Althilelat chemical models of crude oil back to the reservoir Fertile from the fields of Baghdad and Kut and models of crude oil back to the reservoir ??????? of Haklbe Tikrit and Baghdad were calculated their properties Alvezaúah Kalkthaqh and weight, quality and degree of August j (API) and know the quality Nfothma that was light or heavy and make the comparison between Alinvtin also conducted chemical analyzes of the two models of Almia associated with each of the oil above Almkmnin and measured Ktvthma and Zojithma and concentrations of some dissolved salts in them and clarify the relationship between the oil reservoir and water associated with oil fields...

Twelve species from Brassicaceae family were studied using two different molecular techniques: RAPD and ISSR; both of these techniques were used to detect some molecular markers associated with the genotype identification. RAPD results, from using five random primers, revealed 241 amplified fragments, 62 of them were polymorphic (26%).

    ISSR results showed that out of seven primers, three (ISSR3, UBC807, UBC811) could not amplify the genomic DNA; other primers revealed 183 amplified fragments, 36 of them were polymorphic (20%). The similarity evidence and dendrogram for the genetic distances of the incorporation between the two techniques showed that the highest similarity was 0.897 between the va

One of the recent significant but challenging research studies in computational biology and bioinformatics is to unveil protein complexes from protein-protein interaction networks (PPINs). However, the development of a reliable algorithm to detect more complexes with high quality is still ongoing in many studies. The main contribution of this paper is to improve the effectiveness of the well-known modularity density ( ) model when used as a single objective optimization function in the framework of the canonical evolutionary algorithm (EA). To this end, the design of the EA is modified with a gene ontology-based mutation operator, where the aim is to make a positive collaboration between the modularity density model and the proposed