CuO nanoparticles were synthesized in two different ways, firstly by precipitation method using copper acetate monohydrate Cu(CO2CH13)2·H2O, glacial acetic acid (CH3COOH) and sodium hydroxide(NaOH), and secondly by sol-gel method using copper chloride(CuCl2), sodium hydroxide (NaOH) and ethanol (C2H6O). Results of scanning electron microscopy (SEM) showed that different CuO nanostructures (spherical and Reef) can be formed using precipitation and sol- gel process, respectively, at which the particle size was found to be less than 2 µm. X-ray diffraction (XRD)manifested that the pure synthesized powder has no inclusions that may exist during preparations. XRD results showed the particles size of highest peak at 38.9°, was equal to (15.93nm). In addition, Fourier transform infrared spectroscopy (FT-IR) were used to describe the prepared CuO nanostructures absorption peak at 610 cm-1 which confirms that the synthesized product is a pure CuO and may be attributed to Cu2O infrared active mode.
Bacterial meningitis is a leading cause of illness and death worldwide. It is crucial for clinical and public health care, as well as disease control, to identify the meningitis-causing agent promptly. Between June 2021-February 2022, a total of 100 cerebrospinal fluid (CSF) and blood samples were collected from suspected cases of meningitis admitted to Raparin Paediatric Teaching Hospital, Erbil city-Iraq. Cytochemical, cultural, and biochemical tests were conducted, and confirmed by molecular techniques. Bacterial culture findings were positive in 7% of CSF samples and just one positive among blood samples. The most common pathogens found by cultural characteristics and VITEK 2 Compact System were Staphylococcus sciuri in two
... Show MoreTwo unsupervised classifiers for optimum multithreshold are presented; fast Otsu and k-means. The unparametric methods produce an efficient procedure to separate the regions (classes) by select optimum levels, either on the gray levels of image histogram (as Otsu classifier), or on the gray levels of image intensities(as k-mean classifier), which are represent threshold values of the classes. In order to compare between the experimental results of these classifiers, the computation time is recorded and the needed iterations for k-means classifier to converge with optimum classes centers. The variation in the recorded computation time for k-means classifier is discussed.
Segmentation is the process of partition digital images into different parts depending on texture, color, or intensity, and can be used in different fields in order to segment and isolate the area to be partitioned. In this work images of the Moon obtained through observations in Astronomy and space dep. College of science university of Baghdad by ( Toward space telescopes and widespread used of a CCD camera) . Different segmentation methods were used to segment lunar craters. Different celestial objects cause craters when they crash into the surface of the Moon like asteroids and meteorites. Thousands of craters appears on the Moon's surface with ranges in size from meter to many kilometers, it provide insights into the age and geology
... Show MoreSegmentation is the process of partition digital images into different parts depending on texture, color, or intensity, and can be used in different fields in order to segment and isolate the area to be partitioned. In this work images of the Moon obtained through observations in Astronomy and space dep. College of science university of Baghdad by ( Toward space telescopes and widespread used of a CCD camera) . Different segmentation methods were used to segment lunar craters. Different celestial objects cause craters when they crash into the surface of the Moon like asteroids and meteorites. Thousands of craters appears on the Moon's surface with ranges in size from meter to many kilometers, it provide insights into the age and ge
... Show MoreIn this paper, three approximate methods namely the Bernoulli, the Bernstein, and the shifted Legendre polynomials operational matrices are presented to solve two important nonlinear ordinary differential equations that appeared in engineering and applied science. The Riccati and the Darcy-Brinkman-Forchheimer moment equations are solved and the approximate solutions are obtained. The methods are summarized by converting the nonlinear differential equations into a nonlinear system of algebraic equations that is solved using Mathematica®12. The efficiency of these methods was investigated by calculating the root mean square error (RMS) and the maximum error remainder (𝑀𝐸𝑅n) and it was found that the accuracy increases with increasi
... Show MoreOptimizing system performance in dynamic and heterogeneous environments and the efficient management of computational tasks are crucial. This paper therefore looks at task scheduling and resource allocation algorithms in some depth. The work evaluates five algorithms: Genetic Algorithms (GA), Particle Swarm Optimization (PSO), Ant Colony Optimization (ACO), Firefly Algorithm (FA) and Simulated Annealing (SA) across various workloads achieved by varying the task-to-node ratio. The paper identifies Finish Time and Deadline as two key performance metrics for gauging the efficacy of an algorithm, and a comprehensive investigation of the behaviors of these algorithms across different workloads was carried out. Results from the experiment
... Show MoreThe aim of this study was to increasing natural carotenoides production by a locally isolate Rodotorula mucilagenosa M. by determination of the optimal conditions for growth and production of this agents, for encouragest to use it in food application permute artificial pigments which harmfull for consumer health and envieronmental. The optimal condition of carotenoides production from Rhodotorula mucilaginosa M were studied. The results shows the best carbon and nitrogen source were glucose and yeast extract. The carotenoids a mount production was 47430 microgram ̸ litter and 47460 microgram ̸ litter, respectively, and the optimum temperature was 30°C, PH 6, that the carotenoides a mount was 47470 microgram ̸ litter and 47670 microgr
... Show MoreThe study is done in the period between (February 20 and October 20) by using ten adult quail Coturnix coturnix (Linnaeus, 1758). The sections are preparing by paraffin method then stain in Harris haematoxylin-eosin. The histological aspects of spinal cord in quail (Coturnix coturnix) the white matter is in the outer part, while the gray matter is arranged in from of X represents its internal part, the dorsal region is called the dorsal horns while the ventral region is called the ventral horns and the central canal cavity, the spinal cord areas appeared as follows: The medial column, column of von Lenhossek, lateral column, dorsal magnocellular column and marginal paragriseal, columns are also called Hoffmann’s nuclei.
Theoretical trends have appeared Which posed the concept of biological structures in contemporary architecture concept, Spread through the emergence of architectural production that reflect and indicate the nature of the construction structures based on the ideas and principles of biological structures in biological science: Despite the emergence of many architectural proposals that tried to explain the concept in the field of architecture, but it is not dealt with in depth and not given a comprehensive definition: So there was need to search for the concept and its beginning in the biological field as a general framework down to the field of architecture for the purpose of reducing the limits of their search framework T
... Show MoreA skip list data structure is really just a simulation of a binary search tree. Skip lists algorithm are simpler, faster and use less space. this data structure conceptually uses parallel sorted linked lists. Searching in a skip list is more difficult than searching in a regular sorted linked list. Because a skip list is a two dimensional data structure, it is implemented using a two dimensional network of nodes with four pointers. the implementation of the search, insert and delete operation taking a time of upto . The skip list could be modified to implement the order statistic operations of RANKand SEARCH BY RANK while maintaining the same expected time. Keywords:skip list , parallel linked list , randomized algorithm , rank.