Regression testing being expensive, requires optimization notion. Typically, the optimization of test cases results in selecting a reduced set or subset of test cases or prioritizing the test cases to detect potential faults at an earlier phase. Many former studies revealed the heuristic-dependent mechanism to attain optimality while reducing or prioritizing test cases. Nevertheless, those studies were deprived of systematic procedures to manage tied test cases issue. Moreover, evolutionary algorithms such as the genetic process often help in depleting test cases, together with a concurrent decrease in computational runtime. However, when examining the fault detection capacity along with other parameters, is required, the method falls sh

An Optimal Algorithm for HTML Page Building Process

Krawtchouk polynomials (KPs) and their moments are promising techniques for applications of information theory, coding theory, and signal processing. This is due to the special capabilities of KPs in feature extraction and classification processes. The main challenge in existing KPs recurrence algorithms is that of numerical errors, which occur during the computation of the coefficients in large polynomial sizes, particularly when the KP parameter (p) values deviate away from 0.5 to 0 and 1. To this end, this paper proposes a new recurrence relation in order to compute the coefficients of KPs in high orders. In particular, this paper discusses the development of a new algorithm and presents a new mathematical model for computing the

A field experiment was carried out at University of Baghdad, College of Agricultural Engineering Sciences during fall season of 2020 and spring season of 2021. This study was aimed evaluate the effect of the organic fertilizer and boron foliar on the yield of potatoes for processing. The factorial experiment (5*4) within RCBD and three replicates. The organic fertilizer as palm peat at four levels (0, 12, 24 and 36 ton. ha-1) in addition to the chemical fertilizer recommendation treatment. Boron at four Concentrations 0, 100, 150 and 200 mg. L-1 . The results revealed significant different among application of organic fertilizer at the level of 24 ton. ha-1 and the foliar application of boron at a concentration of 100 mg. L-1 in the

A system was used to detect injuries in plant leaves by combining machine learning and the principles of image processing. A small agricultural robot was implemented for fine spraying by identifying infected leaves using image processing technology with four different forward speeds (35, 46, 63 and 80 cm/s). The results revealed that increasing the speed of the agricultural robot led to a decrease in the mount of supplements spraying and a detection percentage of infected plants. They also revealed a decrease in the percentage of supplements spraying by 46.89, 52.94, 63.07 and 76% with different forward speeds compared to the traditional method.

In the present work studies were carried out to extract a cationic dye (Methylene Blue MB) from an aqueous solution using emulsion liquid membrane process (ELM). The organic phase (membrane phase) consists of Span 80 as emulsifier, sulfuric acid solution as stripping agent and hexane as diluent. 

In this study, important factors influencing the extraction of methylene blue dye were studied. These factors include H₂SO₄ concentration in the stripping phase, agitation speed in the dye permeation stage, Initial dye concentration and diluent type.

   More than (98%) of Methylene blue dye was extracted at the following conditions: H₂SO₄ concentration (1.25) M, agitation

Credit risk assessment has become an important topic in financial risk administration. Fuzzy clustering analysis has been applied in credit scoring. Gustafson-Kessel (GK) algorithm has been utilised to cluster creditworthy customers as against non-creditworthy ones. A good clustering analysis implemented by good Initial Centres of clusters should be selected. To overcome this problem of Gustafson-Kessel (GK) algorithm, we proposed a modified version of Kohonen Network (KN) algorithm to select the initial centres. Utilising similar degree between points to get similarity density, and then by means of maximum density points selecting; the modified Kohonen Network method generate clustering initial centres to get more reasonable clustering res

This paper presents a hybrid genetic algorithm (hGA) for optimizing the maximum likelihood function ln(L(phi(1),theta(1)))of the mixed model ARMA(1,1). The presented hybrid genetic algorithm (hGA) couples two processes: the canonical genetic algorithm (cGA) composed of three main steps: selection, local recombination and mutation, with the local search algorithm represent by steepest descent algorithm (sDA) which is defined by three basic parameters: frequency, probability, and number of local search iterations. The experimental design is based on simulating the cGA, hGA, and sDA algorithms with different values of model parameters, and sample size(n). The study contains comparison among these algorithms depending on MSE value. One can conc