The soil acari fauna of Citrus orchards of Baghdad in Jadiriya area was studied in a total
of forty-eight samples. Twenty-two species were recorded during the present study of which
eight species were first records to Iraq. The ordinal composition of the soil acari fauna was
predominantly Mesostigmata.
This fauna represents diverse trophic groups. The most abundant groups were the
predacious and the Microphytophagus, while the less abundant groups were the predacious/
Microphytophagus, Macrophytophagus, and Panaphytophagus. The most abundant and
frequent species were Rhizoglyphus sp. Tyrophagus putrescentiea (Scrank), Pachylaelaps
longisetis Halbt. and Stratiolaelaps miles Berl.

A total of 437 individuals of Turbellarin Platyhelminthes were sorted from benthic samples collected monthly for a period of seven months( April to November 2013 ) from AL-Dalmage lake, a part of middle section for main outfall drain south of Baghdad. They were identified as Gyratrix hermaphroditus, Stenostomum leucops ,Stenostomum unicolar and Stenostomum bryophilum ,The relative abundance of worms decreased during hot season which (May to September) ,where they start rising again. The species were studied alive , the identification criteria were illustrated by photos. G. hermaphroditus was the most abundant species among the four species.

    In this study, the dung beetles Aphodius (Bodilus) ictericus (Laicharting, 1781) and Aphodius (Planolinellus) vittatus Say, 1825 which belongs to the family of Aphodiidae (Order: Coleoptera) are redscribed here as to being found for the first time in Iraq.

    The specimens were collected from different regions in the middle of Iraq; the main diagnostic characters and some morphological features of males were drawn and pictured.

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

Abstract

Hexapod robot is a flexible mechanical robot with six legs. It has the ability to walk over terrain. The hexapod robot look likes the insect so it has the same gaits. These gaits are tripod, wave and ripple gaits. Hexapod robot needs to stay statically stable at all the times during each gait in order not to fall with three or more legs continuously contacts with the ground. The safety static stability walking is called (the stability margin). In this paper, the forward and inverse kinematics are derived for each hexapod’s leg in order to simulate the hexapod robot model walking using MATLAB R2010a for all gaits and the geometry in order to derive the equations of the sub-constraint workspaces for each

Reverse Osmosis (RO) has already proved its worth as an efficient treatment method in chemical and environmental engineering applications. Various successful RO attempts for the rejection of organic and highly toxic pollutants from wastewater can be found in the literature over the last decade. Dimethylphenol is classified as a high-toxic organic compound found ubiquitously in wastewater. It poses a real threat to humans and the environment even at low concentration. In this paper, a model based framework was developed for the simulation and optimisation of RO process for the removal of dimethylphenol from wastewater. We incorporated our earlier developed and validated process model into the Species Conserving Genetic Algorithm (SCG

Traffic management at road intersections is a complex requirement that has been an important topic of research and discussion. Solutions have been primarily focused on using vehicular ad hoc networks (VANETs). Key issues in VANETs are high mobility, restriction of road setup, frequent topology variations, failed network links, and timely communication of data, which make the routing of packets to a particular destination problematic. To address these issues, a new dependable routing algorithm is proposed, which utilizes a wireless communication system between vehicles in urban vehicular networks. This routing is position-based, known as the maximum distance on-demand routing algorithm (MDORA). It aims to find an optimal route on a hop-by-ho

Background and Aim: due to the rapid growth of data communication and multimedia system applications, security becomes a critical issue in the communication and storage of images. This study aims to improve encryption and decryption for various types of images by decreasing time consumption and strengthening security. Methodology: An algorithm is proposed for encrypting images based on the Carlisle Adams and Stafford Tavares CAST block cipher algorithm with 3D and 2D logistic maps. A chaotic function that increases the randomness in the encrypted data and images, thereby breaking the relation sequence through the encryption procedure, is introduced. The time is decreased by using three secure and private S-Boxes rather than using si

Abstract

Although the rapid development in reverse engineering techniques, 3D laser scanners can be considered the modern technology used to digitize the 3D objects, but some troubles may be associate this process due to the environmental noises and limitation of the used scanners. So, in the present paper a data pre-processing algorithm has been proposed to obtain the necessary geometric features and mathematical representation of scanned object from its point cloud which obtained using 3D laser scanner (Matter and Form) through isolating the noised points. The proposed algorithm based on continuous calculations of chord angle between each adjacent pair of points in point cloud. A MATLAB program has been built t