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

In this research a new system identification algorithm is presented for obtaining an optimal set of mathematical models for system with perturbed coefficients, then this algorithm is applied practically by an “On Line System Identification Circuit”, based on real time speed response data of a permanent magnet DC motor. Such set of mathematical models represents the physical plant against all variation which may exist in its parameters, and forms a strong mathematical foundation for stability and performance analysis in control theory problems.

This paper proposes a novel meta-heuristic optimization algorithm called the fine-tuning meta-heuristic algorithm (FTMA) for solving global optimization problems. In this algorithm, the solutions are fine-tuned using the fundamental steps in meta-heuristic optimization, namely, exploration, exploitation, and randomization, in such a way that if one step improves the solution, then it is unnecessary to execute the remaining steps. The performance of the proposed FTMA has been compared with that of five other optimization algorithms over ten benchmark test functions. Nine of them are well-known and already exist in the literature, while the tenth one is proposed by the authors and introduced in this article. One test trial was shown t

A fixed firefighting system is a key component of fire safeguarding and reducing fire danger. It is installed as a permanent component in a structure to protect the entire or a portion of the building and its contents. The study aims to review the previous studies that deal with the evaluation of fire safety measures and their use in resolving problems associated with fire threats in buildings. For this reason, a number of previous studies in this field were reviewed compared with the NFPA code. The findings revealed that regulatory developments over the last several decades had created an atmosphere conducive to innovation. This has resulted in a growth in the number of fixed firefighting system types now obtainable. Th

In recent years, there has been a significant increase in research demonstrating the new and diverse uses of non-thermal food processing technologies, including more efficient mixing and blending processes, faster energy and mass transfer, lower temperature and selective extraction, reduced thermal and concentration gradients, reduced equipment size, faster response to extraction control, faster start-up, increased production, and a reduction in the number of steps in preparation and processing. Applications of ultrasound technology have indicated that this technology has a promising and significant future in the food industry and preservation, and there is a wide scope for its use due to the higher purity of final products and the

KE Sharquie, SA Al-Mashhadani, AA Noaimi, AA Hasan, Journal of Cutaneous and Aesthetic Surgery, 2012 - Cited by 19

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