Two field experiments were carried out for cultivating yellow maize crop Zea mays L. during the autumn planting season 2019 in two sites with soils of different textures. The first site is a loamy texture in one of the fields of the Medhatia Agriculture Division, Babylon Governorate. The second was silty loam by an alluvial mixture in one of the fields of Al-Nouriah Research Station, Ministry of Agriculture located in Al-Nouriah sub-district, Al-Qadisiyah governorate. It was found through the results that the uniformity, efficiency, and adequacy of the irrigation efficiency of the sprinkler irrigation method is better than that of the sprinkler irrigation method, and it ranged between (88.6-88.7) for uniformity and (84-86)% of the irrigatio

Epithelial ovarian cancer is the leading cause of cancer deaths in women. To date, an effective screening tool for ovarian cancer has not been identified Several clinical and biological factors including serum cancer antigen 125 (CA- 125) have been assessed for prognostic and predictive relevance CA-125 is an epithelial marker derived from coelomic epithelium. It is elevated in 90% of advanced ovarian cancers and in 50% of early ovarian cancers while 20% of ovarian cancers have low or no expression of CA- 125 CA-125 concentrations were measured by Mini Vidas test (VIDAS CA125 II / BIOMERIEUX / France). The median CA-125 levels were significantly higher in the sera of ovarian cancer patients than in those with benign tumors an

Two 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 ge

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

Optimizing 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