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

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.

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

AH Haider R, N Adil A, AW Makram M, AK Abdulkaleq S, 2010

This paper presents the application of a framework of fast and efficient compressive sampling based on the concept of random sampling of sparse Audio signal. It provides four important features. (i) It is universal with a variety of sparse signals. (ii) The number of measurements required for exact reconstruction is nearly optimal and much less then the sampling frequency and below the Nyquist frequency. (iii) It has very low complexity and fast computation. (iv) It is developed on the provable mathematical model from which we are able to quantify trade-offs among streaming capability, computation/memory requirement and quality of reconstruction of the audio signal. Compressed sensing CS is an attractive compression scheme due to its uni

Parasitic diseases including amoebiasis, blastocystosis, giardiasis, trichomoniasis, and schistosomiasis, are all globally wide spread with harmful consequences. The present study was carried out to provide information of the prevalence of these diseases in some regions of Baghdad. Objectives: to detect the prevalence of human pathogenic parasites in some regions of Baghdad in stool samples and urine samples, and to determine the most common age group affected. Methods: Data were collected from Al-Kindy Teaching Hospital and Medical City Teaching Hospital, in the lab of parasitology from November 2018 to May 2019. The present study included (400) sample, which were collected from patients at different ages of both genders, samples of the st

HR Al-Hamami, AA Noaimi, MM Al-Waiz, AS Al-Kabraty, Iraqi Postgraduate Medical Journal, 2010 - Cited by 4

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

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