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
Tue May 16 2023
Journal Name
Journal Of Engineering
System Identification Algorithm for Systems with Interval Coefficients
...Show More Authors

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.

View Publication Preview PDF
Crossref
Publication Date
Thu Sep 26 2019
Journal Name
Processes
Fine-Tuning Meta-Heuristic Algorithm for Global Optimization
...Show More Authors

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

... Show More
View Publication Preview PDF
Scopus (28)
Crossref (24)
Scopus Clarivate Crossref
Publication Date
Sun Jan 01 2017
Journal Name
Pertanika Journal Of Science & Technology
Modified Kohonen network algorithm for selection of the initial centres of Gustafson-Kessel algorithm in credit scoring
...Show More Authors

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

... Show More
Scopus (9)
Scopus
Publication Date
Fri Dec 01 2023
Journal Name
Bulletin Of Electrical Engineering And Informatics
A comparative study of Gaussian mixture algorithm and K-means algorithm for efficient energy clustering in MWSN
...Show More Authors

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

... Show More
View Publication
Scopus (5)
Crossref (4)
Scopus Crossref
Publication Date
Fri Aug 01 2008
Journal Name
2008 First International Conference On The Applications Of Digital Information And Web Technologies (icadiwt)
Hybrid canonical genetic algorithm and steepest descent algorithm for optimizing likelihood estimators of ARMA (1, 1) model
...Show More Authors

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

... Show More
View Publication
Scopus (1)
Scopus Crossref
Publication Date
Tue Dec 05 2023
Journal Name
Baghdad Science Journal
Ecofriendly Control for Stored-Product Pest, Oryzaephilus surinamensis (Order: Coleoptera, Family: Silvanidae)
...Show More Authors

Dates are considered one of the most important foods consumed in Arab countries. Dates are commonly infested with the sawtoothed grain beetle, Oryzaephilus surinamensis. Consequently, the date yield, quantity, and quality (economic value and seed viability) are negatively affected. This study was designed to investigate the effectiveness of air evacuation as eco-friendly and safe control method against adult O. surinamensis. Insects were obtained from the infested date purchased from a private store in sakaka city, Aljouf region, Saudi Arabia. Air evacuation (using a vacuum pump) and food deprivation were applied to O. surinamensis, and insect mortality was observed daily in comparison with the control group (a

... Show More
View Publication Preview PDF
Scopus (2)
Crossref (1)
Scopus Crossref
Publication Date
Mon Feb 05 2052
Journal Name
Partial Differential Equations In Applied Mathematics
A hybrid analytical method for fractional order Klein–Gordon and Burgers equations
...Show More Authors

Scopus (2)
Scopus
Publication Date
Sun Mar 06 2011
Journal Name
Baghdad Science Journal
The Approximated Solution for The Nonlinear Second Order Delay Multi-Value Problems
...Show More Authors

This paper is attempt to study the nonlinear second order delay multi-value problems. We want to say that the properties of such kind of problems are the same as the properties of those with out delay just more technically involved. Our results discuss several known properties, introduce some notations and definitions. We also give an approximate solution to the coined problems using the Galerkin's method.

View Publication Preview PDF
Crossref
Publication Date
Wed Jan 01 2020
Journal Name
Journal Of King Saud University - Science
Three iterative methods for solving second order nonlinear ODEs arising in physics
...Show More Authors

View Publication
Crossref (21)
Crossref
Publication Date
Tue Feb 24 2026
Journal Name
Baghdad Science Journal
Oscillation Conditions for Solutions of First Order Piecewise Constant Neutral Differential Equations
...Show More Authors

View Publication
Scopus Crossref