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.

In 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

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

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

The effect of the magnetic abrasive finishing (MAF) method on the temperature rise (TR), and material removal rate (MRR) has been investigated in this paper. Sixteen runs were to determine the optimum temperature in the contact area (between the abrasive powder and surface of workpiece) and the MRR according to Taguchi orthogonal array (OA). Four variable technological parameters (cutting speed, finishing time, working gap, and the current in the inductor) with four levels for each parameter were used, the matrix is known as a L16 (4⁴) OA. The signal to noise ratio (S/N) ratio and analysis of the variance (ANOVA) were utilized to analyze the results using (MINITAB17) to find the optimum condition and identify the significant p

The goal beyond this Research is to review methods that used to estimate Logistic distribution parameters. An exact estimators method which is the Moment method, compared with other approximate estimators obtained essentially from White approach such as: OLS, Ridge, and Adjusted Ridge as a suggested one to be applied with this distribution. The Results of all those methods are based on Simulation experiment, with different models and variety of  sample sizes. The comparison had been made with respect to two criteria: Mean Square Error (MSE) and Mean Absolute Percentage Error (MAPE).  

Ketoprofen has recently been proven to offer therapeutic potential in preventing cancers such as colorectal and lung tumors, as well as in treating neurological illnesses. The goal of this review is to show the methods that have been used for determining ketoprofen in pharmaceutical formulations. Precision product quality control is crucial to confirm the composition of the drugs in pharmaceutical use. Several analytical techniques, including chromatographic and spectroscopic methods, have been used for determining ketoprofen in different sample forms such as a tablet, capsule, ampoule, gel, and human plasma. The limit of detection of ketoprofen was 0.1 ng/ ml using liquid chromatography with tandem mass spectrometry, while it was 0

This paper suggest two method of recognition, these methods depend on the extraction of the feature of the principle component analysis when applied on the wavelet domain(multi-wavelet). First method, an idea of increasing the space of recognition, through calculating the eigenstructure of the diagonal sub-image details at five depths of wavelet transform is introduced. The effective eigen range selected here represent the base for image recognition. In second method, an idea of obtaining invariant wavelet space at all projections is presented. A new recursive from that represents invariant space of representing any image resolutions obtained from wavelet transform is adopted. In this way, all the major problems that effect the image and