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 Jan 02 2017
Journal Name
European Journal Of Scientific Research
Fast approach for arabic text encryption using genetic algorithm
...Show More Authors

As s widely use of exchanging private information in various communication applications, the issue to secure it became top urgent. In this research, a new approach to encrypt text message based on genetic algorithm operators has been proposed. The proposed approach follows a new algorithm of generating 8 bit chromosome to encrypt plain text after selecting randomly crossover point. The resulted child code is flipped by one bit using mutation operation. Two simulations are conducted to evaluate the performance of the proposed approach including execution time of encryption/decryption and throughput computations. Simulations results prove the robustness of the proposed approach to produce better performance for all evaluation metrics with res

... Show More
Publication Date
Sun Oct 01 2017
Journal Name
International Journal Of Scientific & Engineering Research
Horizontal Fragmentation for Most Frequency Frequent Pattern Growth Algorithm
...Show More Authors

Abstract: Data mining is become very important at the present time, especially with the increase in the area of information it's became huge, so it was necessary to use data mining to contain them and using them, one of the data mining techniques are association rules here using the Pattern Growth method kind enhancer for the apriori. The pattern growth method depends on fp-tree structure, this paper presents modify of fp-tree algorithm called HFMFFP-Growth by divided dataset and for each part take most frequent item in fp-tree so final nodes for conditional tree less than the original fp-tree. And less memory space and time.

View Publication Preview PDF
Publication Date
Sun Jan 01 2023
Journal Name
Computers, Materials & Continua
An Optimal Algorithm for Resource Allocation in D2D Communication
...Show More Authors

View Publication
Scopus (1)
Scopus Clarivate Crossref
Publication Date
Sun Dec 02 2012
Journal Name
Baghdad Science Journal
Stability of Back Propagation Training Algorithm for Neural Networks
...Show More Authors

In this paper, we derive and prove the stability bounds of the momentum coefficient µ and the learning rate ? of the back propagation updating rule in Artificial Neural Networks .The theoretical upper bound of learning rate ? is derived and its practical approximation is obtained

View Publication Preview PDF
Crossref
Publication Date
Mon May 11 2020
Journal Name
Baghdad Science Journal
A Cryptosystem for Database Security Based on TSFS Algorithm
...Show More Authors

Implementation of TSFS (Transposition, Substitution, Folding, and Shifting) algorithm as an encryption algorithm in database security had limitations in character set and the number of keys used. The proposed cryptosystem is based on making some enhancements on the phases of TSFS encryption algorithm by computing the determinant of the keys matrices which affects the implementation of the algorithm phases. These changes showed high security to the database against different types of security attacks by achieving both goals of confusion and diffusion.

View Publication Preview PDF
Scopus (7)
Crossref (2)
Scopus Clarivate Crossref
Publication Date
Thu Jun 01 2017
Journal Name
International Journal Of Engineering Research And Advanced Technology
The Use of First Order Polynomial with Double Scalar Quantization for Image Compression
...Show More Authors

Publication Date
Fri May 01 2020
Journal Name
Journal Of Physics: Conference Series
Recent modification of Homotopy perturbation method for solving system of third order PDEs
...Show More Authors

This paper presents new modification of HPM to solve system of 3 rd order PDEs with initial condition, for finding suitable accurate solutions in a wider domain.

Scopus (19)
Scopus
Publication Date
Sun Jan 01 2017
Journal Name
Proceeding Of The 1st International Conference On Recent Trends Of Engineering Sciences And Sustainability
Design of a Fractional Order Sliding Mode Controller for Twin Rotor Aerodynamic System
...Show More Authors

This paper proposes a new structure for a Fractional Order Sliding Mode Controller (FOSMC) to control a Twin Rotor Aerodynamic System (TRAS). The new structure is composed by defining two 3-dimensional sliding mode surfaces for the TRAS model and introducing fractional order derivative integral in the state variables as well as in the control action. The parameters of the controller are determined so as to minimize the Integral of Time multiplied by Absolute Error (ITAE) performance index. Through comparison, this controller outperforms its integer counterpart in many specifications, such as reducing the delay time, rise time, percentage overshoot, settling time, time to reach the sliding surface, and amplitude of chattering in control inpu

... Show More
Publication Date
Thu Jan 01 2015
Journal Name
Journal Of The College Of Basic Education
Efficient Modifications of the Adomian Decomposition Method for Thirteenth Order Ordinary Differential Equations
...Show More Authors

This paper deals with the thirteenth order differential equations linear and nonlinear in boundary value problems by using the Modified Adomian Decomposition Method (MADM), the analytical results of the equations have been obtained in terms of convergent series with easily computable components. Two numerical examples results show that this method is a promising and powerful tool for solving this problems.

View Publication
Publication Date
Mon Aug 01 2022
Journal Name
Baghdad Science Journal
Accurate Four-Step Hybrid Block Method for Solving Higher-Order Initial Value Problems
...Show More Authors

This paper focuses on developing a self-starting numerical approach that can be used for direct integration of higher-order initial value problems of Ordinary Differential Equations. The method is derived from power series approximation with the resulting equations discretized at the selected grid and off-grid points. The method is applied in a block-by-block approach as a numerical integrator of higher-order initial value problems. The basic properties of the block method are investigated to authenticate its performance and then implemented with some tested experiments to validate the accuracy and convergence of the method.

View Publication Preview PDF
Scopus (1)
Scopus Clarivate Crossref