Background: The aim of this national oral health survey was to determine the prevalence of malocclusions due to some anomalies in the dentition among the 13 years old Kurdish students in sulaimani intermediate school. Materials and methods: The total sample was 950 (455 males and 495 females) which assessed by diagnostic set and special instrument. The clinical examination was mainly based on the definitions of Björk et al. Some variables were recorded as present or absent sometimes denoting the tooth or the teeth involved in malocclusion and their distribution according to the whole sample. Results: The results showed that 1)The most common extracted tooth was the mandibular first molar (2.9%). 2) At this age group the most common partial

     Fifty patients(24 female and 26 male)with pressure ulcersassociated with different diseasesand attending AL-yarmouk Teaching Hospital in Baghdad were selected in this study. The duration of sample collection was from March  to December 2018. All blood samples collected from patients were submitted to a blood culturing technique to examine bacteremia. The results showed that12 blood bacterial isolates were obtained. The isolated bacteria were subjected to Vitek-2, which is an accurate identification technique. The results of the blood culturing technique revealed that 33.3% were Gram negative bacteria, while 66.6% were Gram positive. Diagnosis by Vitek-2 showed that 33.3%  wereStaphylococcus spp. , 33.3% were Enterococcus

A survey of plant-parasitic nematode genera associated with roots of mature date palm trees was conducted in central Iraq to study their occurrence, population density, and geographical distribution. This study in Baghdad, Babil, Diyala, Karbela, Najaf, and Wasit governorates was conducted from 2019 to 2023, during the months from October to April. A total of 150 soil and root samples were gathered from 46 fields, and plant-parasitic nematodes were extracted and morphologically identified to genus level. Eleven genera of plant-parasitic nematodes were detected in the declining order of frequency: Tylenchorhynchus spp. (20%) in Baghdad, Babil, Diyala, Karbala, and Najaf; Meloidogyne spp. (17.3%) in Baghdad, Babil, Diyala, Najaf, and

In recent years, the number of applications utilizing mobile wireless sensor networks (WSNs) has increased, with the intent of localization for the purposes of monitoring and obtaining data from hazardous areas. Location of the event is very critical in WSN, as sensing data is almost meaningless without the location information. In this paper, two Monte Carlo based localization schemes termed MCL and MSL* are studied. MCL obtains its location through anchor nodes whereas MSL* uses both anchor nodes and normal nodes. The use of normal nodes would increase accuracy and reduce dependency on anchor nodes, but increases communication costs. For this reason, we introduce a new approach called low communication cost schemes to reduce communication

          There is an increase in the need for cost accounting in all organizations and from different sectors to provide detailed information to the totals of financial accounting, first and help solve problems associated with inventory and analysis, tabulation and allocation of cost elements II and do the planning process and provide the necessary oversight and help to take the right decisions such as pricing decisions that need to Information cost accounting.
And suffer most of the non-governmental organizations from the lack of a cost accounting system provides information on the cost of service in these organizations and the department research sample circle v

Traditionally, path selection within routing is formulated as a shortest path optimization problem. The objective function for optimization could be any one variety of parameters such as number of hops, delay, cost...etc. The problem of least cost delay constraint routing is studied in this paper since delay constraint is very common requirement of many multimedia applications and cost minimization captures the need to
distribute the network. So an iterative algorithm is proposed in this paper to solve this problem. It is appeared from the results of applying this algorithm that it gave the optimal path (optimal solution) from among multiple feasible paths (feasible solutions).