For many years, reading rate as word correct per minute (WCPM) has been investigated by many researchers as an indicator of learners’ level of oral reading speed, accuracy, and comprehension. The aim of the study is to predict the levels of WCPM using three machine learning algorithms which are Ensemble Classifier (EC), Decision Tree (DT), and K- Nearest Neighbor (KNN). The data of this study were collected from 100 Kurdish EFL students in the 2^nd-year, English language department, at the University of Duhok in 2021. The outcomes showed that the ensemble classifier (EC) obtained the highest accuracy of testing results with a value of 94%. Also, EC recorded the highest precision, recall, and F1 scores with values of 0.92 for

To determine the potential of gingival crevicular fluid (GCF) volume, E‐cadherin and total antioxidant capacity (TAC) levels to predict the outcomes of nonsurgical periodontal therapy (NSPT) for periodontitis patients.

Population density represents an important indicator for determining the growth of the size of urban areas. Population density has a direct impact on the quality of life, and its excessive rise may lead to the deterioration of basic service facilities. The problem of the research is that the increase in the total population densities of the residential neighborhood may reflect negatively on the nature of the services provided to the residents in these shops, and thus the failure to achieve sustainability in the residential locality. The research assumes that the increase in population densities negatively affects the achievement of sustainability in the residential neighborhood.

Abstract:

              The phenomenon of financial failure is one of the phenomena that requires special attention and in-depth study due to its significant impact on various parties, whether they are internal or external and those who benefit from financial performance reports. With the increase in cases of bankruptcy and default facing companies and banks, interest has increased in understanding the reasons that led to this financial failure. This growing interest should be a reason to develop models and analytical methods that help in the early detection of this increasing phenomenon in recent year   . The research examines the use of

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

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