Study the role of CoQ10 and IGFBP-1 in obese male patients with diabetic mellitus type 2. ELISA method was used to assay Serum CoQ10 and IGFBP-1. Blood was taken with drawn sample from 30 obese normal patients with age range (40-60) years, 30 diabetic patients with age range (40-60) years at duration of disease (1-5) years and 30 normal healthy patients. The mean difference between T2DM according to CoQ10 (12.5±1.1) was decreased than the mean of IFG (21.8±3.2) (P 0.002) and the mean difference between T2DM according to IGFBPs (0.65±0.06) was decreased than the mean of IFG (3.2±0.3) (P 0.000). While no significant difference between mean age of DM2 patients (55.5±1.06), and IFG (55.6±0.9) (p 0.90), no significant difference bet

Diabetic kidney disease (DKD) is caused by a variety of processes. As a result, one biomarker is insufficient to represent the complete process. This study Evaluate the diagnostic value of serum kidney injury molecule-1(KIM-1) and cystatin C (CysC) as early biochemical markers of DKD and predictive their sensitivities and specificities as biomarkers of nephropathy in Iraqi type 2 diabetic (T2DM) patients. This cross-sectional study include 161 T2DM patients from Diabetes and Endocrinology Center at Merjan medical city in Babylon. Patients divided according to urinary albumin creatinine ratio(ACR) (Group1:ACR≤30mg/g,Group2:ACR>30mg/g). Random spot urine and fasting blood samples were taken from each patient and urinary ACR, bloo

 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)

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

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