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 initial value of the KP parameter. In addition, a new diagonal recurrence relation is introduced and used in the proposed algorithm. The diagonal recurrence algorithm was derived from the existing n direction and x direction recurrence algorithms. The diagonal and existing recurrence algorithms were subsequently exploited to compute the KP coefficients. First, the KP coefficients were computed for one partition after dividing the KP plane into four. To compute the KP coefficients in the other partitions, the symmetry relations were exploited. The performance evaluation of the proposed recurrence algorithm was determined through different comparisons which were carried out in state-of-the-art works in terms of reconstruction error, polynomial size, and computation cost. The obtained results indicate that the proposed algorithm is reliable and computes lesser coefficients when compared to the existing algorithms across wide ranges of parameter values of p and polynomial sizes N. The results also show that the improvement ratio of the computed coefficients ranges from 18.64% to 81.55% in comparison to the existing algorithms. Besides this, the proposed algorithm can generate polynomials of an order ∼8.5 times larger than those generated using state-of-the-art algorithms.
A taxonomic keys was established of book and bark lice Order Psocoptera to isolated insects in Iraq from different localities of Baghdad and Babylon provinces. Thirteen species belong to eight genera and five families have been studied and described in details, these species were recorded for the first time in Iraq. These species are: Belaphopsocus badonneli New, 1971; Belaphotroctes oculeris Bodonnel, 1973; Embodopsocosis newi Bodonnel, 1973; Epipsocus stigamaticus Mockeord, 1991; Lepinotus huoni Schmidt and New, 2008; Liposcelies decolor Peramane 1925 Liposcelies paeta Pearman 1942 Liposclies bostrychphila Badonnel 1931; Liposclies brunnea Mostchulsky 1852; Liposclies entoophila Enderlein 1907; Neopsocopsis minuscule Li 2002 ;
... Show MoreThe aim of this article is to solve the Volterra-Fredholm integro-differential equations of fractional order numerically by using the shifted Jacobi polynomial collocation method. The Jacobi polynomial and collocation method properties are presented. This technique is used to convert the problem into the solution of linear algebraic equations. The fractional derivatives are considered in the Caputo sense. Numerical examples are given to show the accuracy and reliability of the proposed technique.
A new human-based heuristic optimization method, named the Snooker-Based Optimization Algorithm (SBOA), is introduced in this study. The inspiration for this method is drawn from the traits of sales elites—those qualities every salesperson aspires to possess. Typically, salespersons strive to enhance their skills through autonomous learning or by seeking guidance from others. Furthermore, they engage in regular communication with customers to gain approval for their products or services. Building upon this concept, SBOA aims to find the optimal solution within a given search space, traversing all positions to obtain all possible values. To assesses the feasibility and effectiveness of SBOA in comparison to other algorithms, we conducte
... Show MoreThe first successful implementation of Artificial Neural Networks (ANNs) was published a little over a decade ago. It is time to review the progress that has been made in this research area. This paper provides taxonomy for classifying Field Programmable Gate Arrays (FPGAs) implementation of ANNs. Different implementation techniques and design issues are discussed, such as obtaining a suitable activation function and numerical truncation technique trade-off, the improvement of the learning algorithm to reduce the cost of neuron and in result the total cost and the total speed of the complete ANN. Finally, the implementation of a complete very fast circuit for the pattern of English Digit Numbers NN has four layers of 70 nodes (neurons) o
... Show MoreThe first successful implementation of Artificial Neural Networks (ANNs) was published a little over a decade ago. It is time to review the progress that has been made in this research area. This paper provides taxonomy for classifying Field Programmable Gate Arrays (FPGAs) implementation of ANNs. Different implementation techniques and design issues are discussed, such as obtaining a suitable activation function and numerical truncation technique trade-off, the improvement of the learning algorithm to reduce the cost of neuron and in result the total cost and the total speed of the complete ANN. Finally, the implementation of a complete very fast circuit for the pattern of English Digit Numbers NN has four layers of 70 nodes (neurons) o
... Show MoreThis research presents a new algorithm for classification the
shadow and water bodies for high-resolution satellite images (4-
meter) of Baghdad city, have been modulated the equations of the
color space components C1-C2-C3. Have been using the color space
component C3 (blue) for discriminating the shadow, and has been
used C1 (red) to detect the water bodies (river). The new technique
was successfully tested on many images of the Google earth and
Ikonos. Experimental results show that this algorithm effective to
detect all the types of the shadows with color, and also detects the
water bodies in another color. The benefit of this new technique to
discriminate between the shadows and water in fast Matlab pro
The objective of an Optimal Power Flow (OPF) algorithm is to find steady state operation point which minimizes generation cost, loss etc. while maintaining an acceptable system performance in terms of limits on generators real and reactive powers, line flow limits etc. The OPF solution includes an objective function. A common objective function concerns the active power generation cost. A Linear programming method is proposed to solve the OPF problem. The Linear Programming (LP) approach transforms the nonlinear optimization problem into an iterative algorithm that in each iteration solves a linear optimization problem resulting from linearization both the objective function and constrains. A computer program, written in MATLAB environme
... Show MoreThis paper proposes a new method to tune a fractional order PID controller. This method utilizes both the analytic and numeric approach to determine the controller parameters. The control design specifications that must be achieved by the control system are gain crossover frequency, phase margin, and peak magnitude at the resonant frequency, where the latter is a new design specification suggested by this paper. These specifications results in three equations in five unknown variables. Assuming that certain relations exist between two variables and discretizing one of them, a performance index can be evaluated and the optimal controller parameters that minimize this performance index are selected. As a case study, a thir
... Show MoreThe purpose of this paper is to study the instability of the zero solution of some type of nonlinear delay differential equations of fifth order with delay by using the Lyapunov-Krasovskii functional approach, we obtain some conditions of instability of solution of such equation.
The aim of this paper is to present method for solving ordinary differential equations of eighth order with two point boundary conditions. We propose two-point osculatory interpolation to construct polynomial solution.