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

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

SummaryThe most important obstacles facing girls’ clubs in IraqLamia Hassan Al-Diwan - Fatima Abdel Maleh - Nahida Hamed Thank youResearch SummaryIn the introduction and the importance of the research: We talked about women entering endurance events and relying on the principle of more training will achieve better results in the future. Based on the concepts that call for the equality of men with women in all aspects of sporting and competitive activity and as a result of the decline in women’s participation in sports clubs that include men, we came to The idea of ​​establishing clubs for Iraqi girls in 1992, with a club in every governorate, and the Iraqi National Olympic Committee adopted this idea, the goal of which is to develop

Various theories have been proposed since in last century to predict the first sighting of a new crescent moon. None of them uses the concept of machine and deep learning to process, interpret and simulate patterns hidden in databases. Many of these theories use interpolation and extrapolation techniques to identify sighting regions through such data. In this study, a pattern recognizer artificial neural network was trained to distinguish between visibility regions. Essential parameters of crescent moon sighting were collected from moon sight datasets and used to build an intelligent system of pattern recognition to predict the crescent sight conditions. The proposed ANN learned the datasets with an accuracy of more than 72% in comp

The blade pitch angle (BPA) in wind turbine (WT) is controlled to maximize output power generation above the rated wind speed (WS). In this paper, four types of controllers are suggested and compared for BPA controller in WT: PID controller (PIDC), type-1 fuzzy logic controller (T1-FLC), type-2 fuzzy logic controller (T2-FLC), and hybrid fuzzy-PID controller (FPIDC). The Mamdani and Sugeno fuzzy inference systems (FIS) have been compared to find the best inference system used in FLC. Genetic algorithm (GA) and Particle swarm optimization algorithm (PSO) are used to find the optimal tuning of the PID parameter. The results of500-kw horizontal-axis wind turbine show that PIDC based on PSO can reduced 2.81% in summation error of power

Citrus fruits are one of the consumer agricultural products of the Iraqi citizen. It is rich in vitamins and usedin many food industries as well as medicines. Classifying the amount of production of citrus treesaccording to the producing governorates has been done to find a map that shows the production of citrustrees according to Iraqi governorates. A cluster analysis method was used according to the hierarchicalmethod. The results showed that Najaf and Qadisiyah are the most similar in citrus production, whileSaladin and Najaf were the two governorates with the furthest distance in proximity matrix. Diyalagovernorate was clustered in the first cluster within two, three, four or five of the clusters for classifyingIraqi governorates covere

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

Wireless sensor networks (WSNs) represent one of the key technologies in internet of things (IoTs) networks. Since WSNs have finite energy sources, there is ongoing research work to develop new strategies for minimizing power consumption or enhancing traditional techniques. In this paper, a novel Gaussian mixture models (GMMs) algorithm is proposed for mobile wireless sensor networks (MWSNs) for energy saving. Performance evaluation of the clustering process with the GMM algorithm shows a remarkable energy saving in the network of up to 92%. In addition, a comparison with another clustering strategy that uses the K-means algorithm has been made, and the developed method has outperformed K-means with superior performance, saving ener

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

Scheduling Timetables for courses in the big departments in the universities is a very hard problem and is often be solved by many previous works although results are partially optimal. This work implements the principle of an evolutionary algorithm by using genetic theories to solve the timetabling problem to get a random and full optimal timetable with the ability to generate a multi-solution timetable for each stage in the collage. The major idea is to generate course timetables automatically while discovering the area of constraints to get an optimal and flexible schedule with no redundancy through the change of a viable course timetable. The main contribution in this work is indicated by increasing the flexibility of generating opti