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
Thu May 30 2024
Journal Name
Iraqi Journal Of Science
An Evolutionary Algorithm for Improving the Quantity and Quality of the Detected Complexes from Protein Interaction Networks
...Show More Authors

One of the recent significant but challenging research studies in computational biology and bioinformatics is to unveil protein complexes from protein-protein interaction networks (PPINs). However, the development of a reliable algorithm to detect more complexes with high quality is still ongoing in many studies. The main contribution of this paper is to improve the effectiveness of the well-known modularity density ( ) model when used as a single objective optimization function in the framework of the canonical evolutionary algorithm (EA). To this end, the design of the EA is modified with a gene ontology-based mutation operator, where the aim is to make a positive collaboration between the modularity density model and the proposed

... Show More
View Publication
Scopus Crossref
Publication Date
Wed May 01 2019
Journal Name
Iop Conference Series: Materials Science And Engineering
Application of Variable Pulsed Irrigation Algorithm (VPIA) for Runoff Losses Reduction: Case Study of Different Soil Types
...Show More Authors
Abstract<p>The low-pressure sprinklers have been widely used to replace the high-pressure impact sprinklers in the lateral move sprinkler irrigation system due to its low operating cost and high efficiency. However, runoff losses under the low-pressure sprinkler irrigation machine can be significant. This study aims to evaluate the performance of the variable pulsed irrigation algorithm (VPIA) in reducing the runoff losses under low-pressure lateral move sprinkler irrigation machine for three different soil types. The VPIA uses the ON-OFF pulsing technique to reduce the runoff losses by controlling the number and width of the pulses considering the soil and the irrigation machine properties. Als</p> ... Show More
View Publication
Scopus (1)
Crossref (1)
Scopus Clarivate Crossref
Publication Date
Fri Nov 01 2019
Journal Name
Civil Engineering Journal
Time-Cost-Quality Trade-off Model for Optimal Pile Type Selection Using Discrete Particle Swarm Optimization Algorithm
...Show More Authors

The cost of pile foundations is part of the super structure cost, and it became necessary to reduce this cost by studying the pile types then decision-making in the selection of the optimal pile type in terms of cost and time of production and quality .So The main objective of this study is to solve the time–cost–quality trade-off (TCQT) problem by finding an optimal pile type with the target of "minimizing" cost and time while "maximizing" quality. There are many types In the world of piles but  in this paper, the researcher proposed five pile types, one of them is not a traditional, and   developed a model for the problem and then employed particle swarm optimization (PSO) algorithm, as one of evolutionary algorithms with t

... Show More
Scopus (9)
Crossref (9)
Scopus Clarivate Crossref
Publication Date
Sat Jan 12 2013
Journal Name
Pierb
RADAR SENSING FEATURING BICONICAL ANTENNA AND ENHANCED DELAY AND SUM ALGORITHM FOR EARLY-STAGE BREAST CANCER DETECTION
...Show More Authors

A biconical antenna has been developed for ultra-wideband sensing. A wide impedance bandwidth of around 115% at bandwidth 3.73-14 GHz is achieved which shows that the proposed antenna exhibits a fairly sensitive sensor for microwave medical imaging applications. The sensor and instrumentation is used together with an improved version of delay and sum image reconstruction algorithm on both fatty and glandular breast phantoms. The relatively new imaging set-up provides robust reconstruction of complex permittivity profiles especially in glandular phantoms, producing results that are well matched to the geometries and composition of the tissues. Respectively, the signal-to-clutter and the signal-to-mean ratios of the improved method are consis

... Show More
Publication Date
Mon Jan 01 2024
Journal Name
Ieee Access
An Evolutionary Algorithm With Heuristic Operator for Detecting Protein Complexes in Protein Interaction Networks With Negative Controls
...Show More Authors

View Publication
Scopus (4)
Crossref (4)
Scopus Clarivate Crossref
Publication Date
Mon Apr 18 2022
The modeling techniques of the second‐order correlation function <i>g</i> <sup>(2)</sup> ( <i>τ</i> ) for a quantum emitter
...Show More Authors

View Publication
Crossref (1)
Scopus Clarivate Crossref
Publication Date
Tue Aug 23 2022
Journal Name
Int. J. Nonlinear Anal. Appl.
Face mask detection based on algorithm YOLOv5s
...Show More Authors

Determining the face of wearing a mask from not wearing a mask from visual data such as video and still, images have been a fascinating research topic in recent decades due to the spread of the Corona pandemic, which has changed the features of the entire world and forced people to wear a mask as a way to prevent the pandemic that has calmed the entire world, and it has played an important role. Intelligent development based on artificial intelligence and computers has a very important role in the issue of safety from the pandemic, as the Topic of face recognition and identifying people who wear the mask or not in the introduction and deep education was the most prominent in this topic. Using deep learning techniques and the YOLO (”You on

... Show More
Publication Date
Mon Jan 01 2018
Journal Name
International Journal Of Data Mining, Modelling And Management
Association rules mining using cuckoo search algorithm
...Show More Authors

Association rules mining (ARM) is a fundamental and widely used data mining technique to achieve useful information about data. The traditional ARM algorithms are degrading computation efficiency by mining too many association rules which are not appropriate for a given user. Recent research in (ARM) is investigating the use of metaheuristic algorithms which are looking for only a subset of high-quality rules. In this paper, a modified discrete cuckoo search algorithm for association rules mining DCS-ARM is proposed for this purpose. The effectiveness of our algorithm is tested against a set of well-known transactional databases. Results indicate that the proposed algorithm outperforms the existing metaheuristic methods.

View Publication Preview PDF
Scopus (8)
Crossref (3)
Scopus Crossref
Publication Date
Sun Mar 01 2015
Journal Name
Computer Systems Science & Engineering
Parameters' fine tuning of differential evolution algorithm
...Show More Authors

Most heuristic search method's performances are dependent on parameter choices. These parameter settings govern how new candidate solutions are generated and then applied by the algorithm. They essentially play a key role in determining the quality of the solution obtained and the efficiency of the search. Their fine-tuning techniques are still an on-going research area. Differential Evolution (DE) algorithm is a very powerful optimization method and has become popular in many fields. Based on the prolonged research work on DE, it is now arguably one of the most outstanding stochastic optimization algorithms for real-parameter optimization. One reason for its popularity is its widely appreciated property of having only a small number of par

... Show More
Scopus (7)
Scopus
Publication Date
Tue Mar 30 2021
Journal Name
Baghdad Science Journal
Delivery Route Management based on Dijkstra Algorithm
...Show More Authors

For businesses that provide delivery services, the efficiency of the delivery process in terms of punctuality is very important. In addition to increasing customer trust, efficient route management, and selection are required to reduce vehicle fuel costs and expedite delivery. Some small and medium businesses still use conventional methods to manage delivery routes. Decisions to manage delivery schedules and routes do not use any specific methods to expedite the delivery settlement process. This process is inefficient, takes a long time, increases costs and is prone to errors. Therefore, the Dijkstra algorithm has been used to improve the delivery management process. A delivery management system was developed to help managers and drivers

... Show More
View Publication Preview PDF
Scopus (2)
Scopus Clarivate Crossref