Preferred Language
Articles
/
1xYFBYcBVTCNdQwCMC3d
Reliable Recurrence Algorithm for High-Order Krawtchouk Polynomials
...Show More Authors

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.

Scopus Clarivate Crossref
View Publication
Publication Date
Mon Mar 08 2021
Journal Name
Baghdad Science Journal
EXTENSION OF HIGH REFLECTANCE BAND WIDTH FOR FAR INFRARED SPECTRAL REGION : (1)
...Show More Authors

Extension of bandwidth for high reflectance zone for the spectral region (8-14pm) was studied adapting the concept of contiguous and overlapping high reflectance stacks. Computations was carried out using the modified characteristic matrix theory restricted to near-normal incidence of light on dielectric , homogenous and isotropic symmetrical stack. Certain precautions must be taken in the choice of stacks to avoid deep —reflectance minima from developing within the extended high reflectance region. Results illustrate that the techniques of extending the high reflectance regions are applicable not only to mirrors , but also to short-and long-edge filter and to narrow band pass filters.

View Publication Preview PDF
Publication Date
Thu Jun 01 2023
Journal Name
Iraqi Journal Of Physics
Preparation of SiO2:TiO2 for High-Performance Double Layer Anti-Reflection Coating
...Show More Authors

        In this work, an anti-reflection coating was prepared in the region (400-1000) nm of wavelength, with a double layer of silicon dioxide (SiO2) as an inner layer and the second layer of the mixture (SiO2) and titanium dioxide (TiO2) with certain ratios, as an outer layer using the chemical spraying method with a number of 6 sprays of layer SiO2 and 12 sprays of layer SiO2 - TiO2. Using the method of chemical spraying deposited on the glass as a substrate with a different number of sprays of SiO2, and a fixed number of TiO2-SiO2. The optical and structural properties were determined using UV-Vis spectroscopy and atomic force mi

... Show More
View Publication Preview PDF
Crossref (5)
Crossref
Publication Date
Sat Sep 30 2017
Journal Name
Al-khwarizmi Engineering Journal
A Cognitive Hybrid Tuning Control Algorithm Design for Nonlinear Path-Tracking Controller for Wheeled Mobile Robot
...Show More Authors

Abstract

This research presents a on-line cognitive tuning control algorithm for the nonlinear controller of path-tracking for dynamic wheeled mobile robot to stabilize and follow a continuous reference path with minimum tracking pose error. The goal of the proposed structure of a hybrid (Bees-PSO) algorithm is to find and tune the values of the control gains of the nonlinear (neural and back-stepping method) controllers as a simple on-line with fast tuning techniques in order to obtain the best torques actions of the wheels for the cart mobile robot from the proposed two controllers. Simulation results (Matlab Package 2012a) show that the nonlinear neural controller with hybrid Bees-PSO cognitive algorithm is m

... Show More
View Publication Preview PDF
Publication Date
Sun Mar 01 2009
Journal Name
Al-khwarizmi Engineering Journal
A Proposed Artificial Intelligence Algorithm for Assessing of Risk Priority for Medical Equipment in Iraqi Hospital
...Show More Authors

This paper presents a robust algorithm for the assessment of risk priority for medical equipment based on the calculation of static and dynamic risk factors and Kohnen Self Organization Maps (SOM). Four risk parameters have been calculated for 345 medical devices in two general hospitals in Baghdad. Static risk factor components (equipment function and physical risk) and dynamics risk components (maintenance requirements and risk points) have been calculated. These risk components are used as an input to the unsupervised Kohonen self organization maps. The accuracy of the network was found to be equal to 98% for the proposed system. We conclude that the proposed model gives fast and accurate assessment for risk priority and it works as p

... Show More
View Publication Preview PDF
Publication Date
Tue Mar 01 2016
Journal Name
International Journal Of Engineering Research And Advanced Technology (ijerat)
Speeding Up Back-Propagation Learning (SUBPL) Algorithm: A New Modified Back_Propagation Algorithm
...Show More Authors

The convergence speed is the most important feature of Back-Propagation (BP) algorithm. A lot of improvements were proposed to this algorithm since its presentation, in order to speed up the convergence phase. In this paper, a new modified BP algorithm called Speeding up Back-Propagation Learning (SUBPL) algorithm is proposed and compared to the standard BP. Different data sets were implemented and experimented to verify the improvement in SUBPL.

View Publication
Publication Date
Sat May 28 2022
Journal Name
Abstract And Applied Analysis
Discretization Fractional-Order Biological Model with Optimal Harvesting
...Show More Authors

In this paper, a discretization of a three-dimensional fractional-order prey-predator model has been investigated with Holling type III functional response. All its fixed points are determined; also, their local stability is investigated. We extend the discretized system to an optimal control problem to get the optimal harvesting amount. For this, the discrete-time Pontryagin’s maximum principle is used. Finally, numerical simulation results are given to confirm the theoretical outputs as well as to solve the optimality problem.

View Publication
Scopus (2)
Scopus Crossref
Publication Date
Wed Mar 10 2021
Journal Name
Baghdad Science Journal
numerical solution of nth order linear dealy differential
...Show More Authors

in this paper fourth order kutta method has been used to find the numerical solution for different types of first liner

View Publication Preview PDF
Publication Date
Thu Jan 01 2015
Journal Name
Journal Of Engineering
GNSS Baseline Configuration Based on First Order Design
...Show More Authors

The quality of Global Navigation Satellite Systems (GNSS) networks are considerably influenced by the configuration of the observed baselines. Where, this study aims to find an optimal configuration for GNSS baselines in terms of the number and distribution  of baselines to improve the quality criteria of the GNSS networks. First order design problem (FOD) was applied in this research to optimize GNSS network baselines configuration, and based on sequential adjustment method to solve its objective functions.

FOD for optimum precision (FOD-p) was the proposed model which based on the design criteria of A-optimality and E-optimality. These design criteria were selected as objective functions of precision, whic

... Show More
View Publication
Publication Date
Wed Mar 10 2021
Journal Name
Baghdad Science Journal
Oscillation of Nonlinear First Order Neutral Differential Equations
...Show More Authors

In this paper, the author established some new integral conditions for the oscillation of all solutions of nonlinear first order neutral delay differential equations. Examples are inserted to illustrate the results.

View Publication Preview PDF
Crossref
Publication Date
Sun Sep 04 2011
Journal Name
Baghdad Science Journal
Approximate Solution of Delay Differential Equations Using the Collocation Method Based on Bernstien Polynomials???? ???????? ????????? ????????? ????????? ???????? ?????????? ???????? ??? ??????? ???? ?????????
...Show More Authors

In this paper a modified approach have been used to find the approximate solution of ordinary delay differential equations with constant delay using the collocation method based on Bernstien polynomials.

View Publication Preview PDF
Crossref (1)
Crossref