This paper presents a hybrid genetic algorithm (hGA) for optimizing the maximum likelihood function ln(L(phi(1),theta(1)))of the mixed model ARMA(1,1). The presented hybrid genetic algorithm (hGA) couples two processes: the canonical genetic algorithm (cGA) composed of three main steps: selection, local recombination and mutation, with the local search algorithm represent by steepest descent algorithm (sDA) which is defined by three basic parameters: frequency, probability, and number of local search iterations. The experimental design is based on simulating the cGA, hGA, and sDA algorithms with different values of model parameters, and sample size(n). The study contains comparison among these algorithms depending on MSE value. One can conclude that (hGA) can give good estimators (phi(1),theta(1)) of ARMA(1,1)parameters and more reliable than estimators obtained by cGA and SDA algorithm
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)
... Show MoreAbnormalities in the Lipid and lipoprotein levels are common in the general population and are considered as very important risk- factors for cardiovascular disease .In this context the effect of cholesterol, which is one of the most clinically relevant lipids is very important. Aim of the present study was to determine the levels of GLP-1 and GPCR in non- diabetic dyslipidaemic patients and compare the results with the control group, which may be used as a novel biomarker to predict heart disease in these patients. The study was also aimed to find the relationship between GLP-1 and GPCR with lipid profile and glucagon in the patient group. The study involved 90 non-diabetic dyslipidaemia patients, with 90 healthy controls. The subjects wer
... Show MoreDiabetes mellitus caused by insulin resistance is prompted by obesity. Neuropeptide Nesfatin-1 was identified in several organs, including the central nervous system and pancreatic islet cells. Nesfatin-1 peptide appears to be involved in hypothalamic circuits that energy homeostasis and control food intake. Adiponectin is a plasma collagen-like protein produced by adipocytes that have been linked to the development of insulin resistance (IR), diabetes mellitus type 2 (DMT2), and cardiovascular disease (CVD). Resistin was first identified as an adipose tissue–specific hormone that was linked to obesity and diabetes. The aim of this study was to estimate the relationship between human serum nesfatin-1, adiponect
... Show MoreBackground: Coronary artery disease (CAD) is one of the leading causes of death worldwide. Clopidogrel, antiplatelet drug, has been widely used for management of CAD. Arylesterase, the activity of Paraoxonase-1 (PON-1), is mainly contributed in the biotransformation of clopidogrel to its active thiol form. The purpose of this study was to investigate the effect of receiving clopidogrel drug on the arylesterase activities in CAD patients. The effect of receiving clopidogrel drug on the antioxidant activity of arylesterase was also monitored by determination of malondialdehyde (MDA) level. Methods: One hundred CAD patients, who were followed-up for 5 days after reciving clopidogrel, and 50 healthy volunteers were included in our study
... Show MoreThis 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
... Show MoreThis 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)
... Show More
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
... Show MoreThis 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.