Objective: To assess the role of tumour necrosis factor alpha level and genotyping in susceptibility to leishmaniasis.Method: The case-control study was conducted from March to July 2021 at Baqubah Teaching Hospital, Diyala, Iraq,and comprised patients of cutaneous leishmaniasis in group A and healthy controls in group B. The serum level andsingle nucleotide polymorphisms of tumour necrosis factor-alpha rs41297589 and rs1800629 were compared betweenthe groups. Data was analysed using SPSS 28.Results: Of the 150 subjects, there were 75(50%) in group A; 39(52%) males and 36(48%) females with mean age23.91±13.14 years. The remaining 75(50%) subjects were in group B; 38(50.7%) males and 37(49.3%) females withmean age 22.84±4.35 years.

Bigheaded carps (bighead carp, Hypophthalmichthys molitrix, and silver carp, Hypophthalmichthys nobilis) and their hybrids play an important ecological and economic role in their original habitat, while their introduced stocks may pose serious ecological risks. To address questions about the persistence and invasiveness of these fish, we need to better understand their population structures. The genetic structures of bigheaded carp populations inhabiting Lake Balaton and the Tisza River were examined with ten microsatellite markers and a mitochondrial DNA marker (COI). The Lake Balaton stock showed higher genetic diversity compared with the Tisza River stock. Based on hierarchical clustering, the Tisza population was characterized o

Afield experiment was conducted in the college of Agriculture labs Sulaimanya University in 2014 to estimate the genetic variance between 12 genotypes of maize. (SSR) technology was used depending on (PCR) technology. Twenty primers were used for the genetic variance analysis between the studied genotypes and 15 primers showed polymorphic results in repeated experiment caused to experinse 52 alleles which gave 307 bands of range 3.1 by different molecular sizes ranged between 80-1000 pair base the value of PIC reached to phi069 gave high value (0.8785), the range of genetic diversity for studied genotypes reached to (0.625) gave primers pairs phi069 hig value for genetic diversity (0.888). The value of total allele replication ranged at pri

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)

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 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

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