Nurse scheduling problem is one of combinatorial optimization problems and it is one of NP-Hard problems which is difficult to be solved as optimal solution. In this paper, we had created an proposed algorithm which it is hybrid simulated annealing algorithm to solve nurse scheduling problem, developed the simulated annealing algorithm and Genetic algorithm. We can note that the proposed algorithm (Hybrid simulated Annealing Algorithm(GS-h)) is the best method among other methods which it is used in this paper because it satisfied minimum average of the total cost and maximum number of Solved , Best and Optimal problems. So we can note that the ratios of the optimal solution are 77% for the proposed algorithm(GS-h), 28.75% for Si

BACKGROUND: CRC is one of the most common cancers in the world. K-ras is proto-oncogene with GTPase activity that is lost when the gene is mutated. Analysis of K-ras mutational status is very important for CRC treatment, being the most important predictors of resistance to targeted therapy. OBJECTIVE: This study aims to determine the frequency and spectrum of K-ras mutation among Iraqi patients with sporadic CRC. PATIENTS, MATERIALS AND METHODS: This study enrolled 35 cases with sporadic CRC; their clinicopathological parameters were analyzed. The FFPE blocks were used for DNA extraction; PCR amplification of K-ras gene and hybridization of allele-specific oligoprobes were performed. The assay covers 29 mutations in the K-ras gene (codons 1

KE Sharquie, AA Noaimi, SJ Murtada…, Journal of Cosmetics, Dermatological Sciences and Applications, 2016 - Cited by 4

The electro-optic coefficient r63 and r41 are determined in congruent KDP crystals, using an experimental method based upon the direct measurement of material. Sénarmont system for electro-optic coefficient measurement and characterization of crystals was modified. This modification allowed us to obtain on the frequency dispersion dependence of the electro-optic coefficients within a frequency range up to 20 MHz and on a new version of modulation depth method. To the best of our knowledge, by using this system, the electro-optic coefficients r63 and r41 in different configurations (transverse and longitudinal) have been measured for the first time within a frequency range up to 20 MHz. The measurements have been investigated as a functi

In this paper, a compact genetic algorithm (CGA) is enhanced by integrating its selection strategy with a steepest descent algorithm (SDA) as a local search method to give I-CGA-SDA. This system is an attempt to avoid the large CPU time and computational complexity of the standard genetic algorithm. Here, CGA dramatically reduces the number of bits required to store the population and has a faster convergence. Consequently, this integrated system is used to optimize the maximum likelihood function lnL(φ1, θ1) of the mixed model. Simulation results based on MSE were compared with those obtained from the SDA and showed that the hybrid genetic algorithm (HGA) and I-CGA-SDA can give a good estimator of (φ1, θ1) for the ARMA(1,1) model. Anot

 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)