A batch and flow injection (FI) spectrophotometric methods are described for the determination of barbituric acid in aqueous and urine samples. The method is based on the oxidative coupling reaction of barbituric acid with 4-aminoantipyrine and potassium iodate to form purple water soluble stable product at λ 510 nm. Good linearity for both methods was obtained ranging from 2 to 60 μg mL−1, 5–100 μg mL−1 for batch and FI techniques, respectively. The limit of detection (signal/noise = 3) of 0.45 μg mL−1 for batch method and 0.48 μg mL−1 for FI analysis was obtained. The proposed methods were applied successfully for the determination of barbituric acid in tap water, river water, and urine samples with good recoveries of 99.92

Some methods recommended abroad to control the oriental hornet, Vespa orientalis L., attacking the honey bee, Apis mellifera L., colonies were tested, with some modifications, for the first time under the Iraqi conditions. One of these methods was carried out by covering the hive entrance with a piece of queen excluder to prevent the hornet from entering the hive. Also, the position of hive stand was reversed to deprive the hornet from using the flight board as a stage for waiting and creeping toward the defending bees. The second method was carried out by fixing a cardboard cone as a bee passage at the hive entrance to hinder the entry of the hornet into the hive. Both of these methods were found to be unsuccessful to

The world faces, in the last years of the last century and the beginning
of the current century i.e. the 21st century, a great expansion and a large
openness on new worlds in studies differ in their development, detection of
thinking methods and practice of mental processes.
The recent studies have proved an increase in the scientific
achievement among students through the presence of new techniques one of
which is Landa Organizing and Exploring Model concerning Physiology that
deals with various body organs.
This research aims at identifying the effectiveness of Landa Model on
the achievement of the Technical Medicine Institute students in Physiology so
as to be sure of the following nil hypothesis: there i

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.

Classification of imbalanced data is an important issue. Many algorithms have been developed for classification, such as Back Propagation (BP) neural networks, decision tree, Bayesian networks etc., and have been used repeatedly in many fields. These algorithms speak of the problem of imbalanced data, where there are situations that belong to more classes than others. Imbalanced data result in poor performance and bias to a class without other classes. In this paper, we proposed three techniques based on the Over-Sampling (O.S.) technique for processing imbalanced dataset and redistributing it and converting it into balanced dataset. These techniques are (Improved Synthetic Minority Over-Sampling Technique (Improved SMOTE),  Border

The advancement of digital technology has increased the deployment of wireless sensor networks (WSNs) in our daily life. However, locating sensor nodes is a challenging task in WSNs. Sensing data without an accurate location is worthless, especially in critical applications. The pioneering technique in range-free localization schemes is a sequential Monte Carlo (SMC) method, which utilizes network connectivity to estimate sensor location without additional hardware. This study presents a comprehensive survey of state-of-the-art SMC localization schemes. We present the schemes as a thematic taxonomy of localization operation in SMC. Moreover, the critical characteristics of each existing scheme are analyzed to identify its advantages

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