In this paper we investigate the use of two types of local search methods (LSM), the Simulated Annealing (SA) and Particle Swarm Optimization (PSO), to solve the problems ( ) and . The results of the two LSMs are compared with the Branch and Bound method and good heuristic methods. This work shows the good performance of SA and PSO compared with the exact and heuristic methods in terms of best solutions and CPU time.

A random laser has been produced using Fluorescein dye solution in water, with concentration of (8 10^-5 M); doped with (0.001g) TiO₂ Nanoparticles with the particle size of (15.7 nm). A blue diode laser of 450 nm wavelength has been used as an optical pumping source. The wavelength of the random laser was 523 nm and the intensity was 5.44 mW

In this paper, we suggest a descent modification of the conjugate gradient method which converges globally provided that the exact minimization condition is satisfied. Preliminary numerical experiments on some benchmark problems show that the method is efficient and promising.  

The huge amount of documents in the internet led to the rapid need of text classification (TC). TC is used to organize these text documents. In this research paper, a new model is based on Extreme Machine learning (EML) is used. The proposed model consists of many phases including: preprocessing, feature extraction, Multiple Linear Regression (MLR) and ELM. The basic idea of the proposed model is built upon the calculation of feature weights by using MLR. These feature weights with the extracted features introduced as an input to the ELM that produced weighted Extreme Learning Machine (WELM). The results showed   a great competence of the proposed WELM compared to the ELM. 

   Real life scheduling problems require the decision maker to consider a number of criteria before arriving at any decision. In this paper, we consider the multi-criteria scheduling problem of n jobs on single machine to minimize a function of five criteria denoted by total completion times (∑), total tardiness (∑), total earliness (∑), maximum tardiness () and maximum earliness (). The single machine total tardiness problem and total earliness problem are already NP-hard, so the considered problem is strongly NP-hard.

We apply two local search algorithms (LSAs) descent method (DM) and simulated annealing method (SM) for the 1// (∑∑∑

BN Rashid, Journal of Language Teaching and Research, 2017 - Cited by 1

      It is frequently asserted that an advantage of a binary search tree implementation of a set over linked list implementation is that for reasonably well balanced binary search trees the average search time (to discover whether or not a particular element is present in the set) is O(log N) to the base 2 where N is the number of element in the set (the size of the tree).  This paper presents an experiment for measuring and comparing the obtained binary search tree time with the expected time (theoretical), this experiment proved the correctness of the hypothesis, the experiment is carried out using a program in turbo Pascal with recursion technique implementation and a statistical method  to prove th

    This work aims to analyse the dynamic behaviours of the forest pest system. We confirm the forest pest system in plane for limit cycles bifurcating existence from a Hopf bifurcation under certain conditions by using the first Lyapunov coefficient and the second-order of averaging theory. It is shown that all stationary points in this system have Hopf bifurcation points and provide an estimation of the bifurcating limit cycles.

Karbala province was one of the most important areas in Iraq and considered an
economic resource of vegetation such as trees of fruits, sieve and other vegetation.
This research aimed to utilize change detection for investigating the current
vegetation cover at last three decay. The main objectives of this research are collect
a group of studied area (Karbala province) satellite images in sequence time for
the same area, these image captured by Landsat (TM 1995, ETM+ 2005 and
Landsat 8 OLI (Operational Land Imager) 2015. Preprocessing such as atmosphere
correction and rectification has been done. Mosaic model between the parts of
studied area was performing. Gap filling consider being very important step has
be

Most dinoflagellate had a resting cyst in their life cycle.  This cyst was developed in unfavorable environmental condition. The conventional method for identifying dinoflagellate cyst in natural sediment requires morphological observation, isolating, germinating and cultivating the cysts.  PCR is a highly sensitive method for detecting dinoflagellate cyst in the sediment.  The aim of this study is to examine whether CO1 primer could detect DNA of multispecies dinoflagellate cysts in the sediment from our sampling sites. Dinoflagellate cyst DNA was extracted from 16 sediment samples. PCR method using COI primer was running. The sequencing of dinoflagellate cyst DNA was using BLAST. Results showed that there were two clades of dinoflag