Background: Implant stability is considered one of the most important factors affecting healing and successful osseointegration of dental implants. The aims of the study were to measure the implant stability quotient (ISQ) values during the healing period and to determine the factors that affect implant stability. Materials and methods: Thirty patients enrolled in the study (17 female, 13 male). They received 44 Implantium® Dental Implants located as the following: 22 implants in maxillary jaw, 22 implants in mandibular jaw from them 17 implants in anterior segment and 27 in posterior segment. The bone density determined using interactive CT scan and classified according to the Misch bone density classification (29 implants in (D3), 15 i

The increasing efficiency of the telecommunications network in the city contributes to the increase in spatial interaction between activities (to influence and mutual influence) This study is based on the idea that the upgrading of telephone services provided to citizens are done exclusively through the growth and development of all levels of the service using advanced technologies to know the problems and appropriate solutions in short time and less cost. Thus, crystallized the objectives of the study which was built for the importance of GIS in the planning of services in general, and infrastructure services, in particular, including telephone services, which is represent a point of contact between individuals on the one hand a

Twelve pends were selected and distributed on three verticals transects paths on the Tigers river in Al Rasheed county.Passing through land covers, that classified and covers the whole region. Based on the 8 Landsat of the year 2015. It was oriental classified by using Erdas 10.2 . The pedons were distributed on the area of each varicty of these classes. the series of soil according of the transect series (DW74,MMg,DMu6 , Df96) respectively were represented P₁ , P₂ , P₃ , P₄  .

The second transits series(DM97,MM5,DM96,DF115) respectively were  represented P₅ , P₆ , P₇ , P₈  .The third  transits series(DM46,MMg,MF12,MM11) re

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)

Recently Genetic Algorithms (GAs) have frequently been used for optimizing the solution of estimation problems. One of the main advantages of using these techniques is that they require no knowledge or gradient information about the response surface. The poor behavior of genetic algorithms in some problems, sometimes attributed to design operators, has led to the development of other types of algorithms. One such class of these algorithms is compact Genetic Algorithm (cGA), it dramatically reduces the number of bits reqyuired to store the poulation and has a faster convergence speed. In this paper compact Genetic Algorithm is used to optimize the maximum likelihood estimator of the first order moving avergae model MA(1). Simulation results

This paper discusses an optimal path planning algorithm based on an Adaptive Multi-Objective Particle Swarm Optimization Algorithm (AMOPSO) for two case studies. First case, single robot wants to reach a goal in the static environment that contain two obstacles and two danger source. The second one, is improving the ability for five robots to reach the shortest way. The proposed algorithm solves the optimization problems for the first case by finding the minimum distance from initial to goal position and also ensuring that the generated path has a maximum distance from the danger zones. And for the second case, finding the shortest path for every robot and without any collision between them with the shortest time. In ord

     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

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