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
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
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
Sun Feb 25 2024
Journal Name
Baghdad Science Journal
Natural Language Processing For Requirement Elicitation In University Using Kmeans And Meanshift Algorithm
...Show More Authors

 Data Driven Requirement Engineering (DDRE) represents a vision for a shift from the static traditional methods of doing requirements engineering to dynamic data-driven user-centered methods. Data available and the increasingly complex requirements of system software whose functions can adapt to changing needs to gain the trust of its users, an approach is needed in a continuous software engineering process. This need drives the emergence of new challenges in the discipline of requirements engineering to meet the required changes. The problem in this study was the method in data discrepancies which resulted in the needs elicitation process being hampered and in the end software development found discrepancies and could not meet the need

... Show More
View Publication Preview PDF
Scopus (1)
Scopus Crossref
Publication Date
Thu Jun 01 2023
Journal Name
Bulletin Of Electrical Engineering And Informatics
A missing data imputation method based on salp swarm algorithm for diabetes disease
...Show More Authors

Most of the medical datasets suffer from missing data, due to the expense of some tests or human faults while recording these tests. This issue affects the performance of the machine learning models because the values of some features will be missing. Therefore, there is a need for a specific type of methods for imputing these missing data. In this research, the salp swarm algorithm (SSA) is used for generating and imputing the missing values in the pain in my ass (also known Pima) Indian diabetes disease (PIDD) dataset, the proposed algorithm is called (ISSA). The obtained results showed that the classification performance of three different classifiers which are support vector machine (SVM), K-nearest neighbour (KNN), and Naïve B

... Show More
View Publication
Scopus (5)
Crossref (1)
Scopus Crossref
Publication Date
Sun Apr 30 2023
Journal Name
Iraqi Journal Of Science
An Evolutionary Algorithm with Gene Ontology-Aware Crossover Operator for Protein Complex Detection
...Show More Authors

     Evolutionary algorithms (EAs), as global search methods, are proved to be more robust than their counterpart local heuristics for detecting protein complexes in protein-protein interaction (PPI) networks. Typically, the source of robustness of these EAs comes from their components and parameters. These components are solution representation, selection, crossover, and mutation. Unfortunately, almost all EA based complex detection methods suggested in the literature were designed with only canonical or traditional components. Further, topological structure of the protein network is the main information that is used in the design of almost all such components. The main contribution of this paper is to formulate a more robust E

... Show More
Scopus (3)
Scopus Crossref
Publication Date
Fri Nov 24 2023
Journal Name
International Journal Of Statistics In Medical Research
A Novel Algorithm for Predicting Antimicrobial Resistance in Unequal Groups of Bacterial Isolates
...Show More Authors

Choosing antimicrobials is a common dilemma when the expected rate of bacterial resistance is high. The observed resistance values in unequal groups of isolates tested for different antimicrobials can be misleading. This can affect the decision to recommend one antibiotic over the other. We analyzed recalled data with the statistical consideration of unequal sample groups. Data was collected concerning children suspected to have typhoid fever at Al Alwyia Pediatric Teaching Hospital in Baghdad, Iraq. The study period extended from September 2021 to September 2022. A novel algorithm was developed to compare the drug sensitivity among unequal numbers of Salmonella typhi (S. Typhi) isolates tested with different antibacterials.

... Show More
View Publication
Scopus Crossref
Publication Date
Mon Jan 01 2024
Journal Name
Aip Conference Proceedings
Modeling and analysis of thermal contrast based on LST algorithm for Baghdad city
...Show More Authors

View Publication
Scopus Crossref
Publication Date
Wed May 01 2019
Journal Name
Iop Conference Series: Materials Science And Engineering
Dynamic Preemption Algorithm to Assign Priority for Emergency Vehicle in Crossing Signalised Intersection
...Show More Authors
Abstract<p>Emergency vehicle (EV) services save lives around the world. The necessary fast response of EVs requires minimising travel time. Preempting traffic signals can enable EVs to reach the desired location quickly. Most of the current research tries to decrease EV delays but neglects the resulting negative impacts of the preemption on other vehicles in the side roads. This paper proposes a dynamic preemption algorithm to control the traffic signal by adjusting some cycles to balance between the two critical goals: minimal delay for EVs with no stop, and a small additional delay to the vehicles on the side roads. This method is applicable to preempt traffic lights for EVs through an Intelli</p> ... Show More
View Publication
Scopus (4)
Crossref (3)
Scopus Clarivate Crossref
Publication Date
Wed Jan 01 2020
Journal Name
Journal Of Building Engineering
Development of gravitational search algorithm model for predicting packing density of cementitious pastes
...Show More Authors

View Publication Preview PDF
Scopus (22)
Crossref (11)
Scopus Clarivate Crossref
Publication Date
Sun Nov 01 2020
Journal Name
2020 2nd Annual International Conference On Information And Sciences (aicis)
An Enhanced Multi-Objective Evolutionary Algorithm with Decomposition for Signed Community Detection Problem
...Show More Authors

View Publication
Scopus (4)
Crossref (1)
Scopus Crossref