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 Feb 28 2022
Journal Name
Sains Malaysiana
Green Synthesis of Nickle Oxide Nanoparticles for Adsorption of Dyes
...Show More Authors

The green synthesis of nickel oxide nanoparticles (NiO-NP) was investigated using Ni(NO3)2 as a precursor, olive tree leaves as a reducing agent, and D-sorbitol as a capping agent. The structural, optical, and morphology of the synthesized NiO-NP have been characterized using ultraviolet–visible spectroscopy (UV-Vis), X-ray crystallography (XRD) pattern, Fourier transform infrared spectroscopy (FT-IR) and scanning electron microscope (SEM) analysis. The SEM analysis showed that the nanoparticles have a spherical shape and highly crystalline as well as highly agglomerated and appear as cluster of nanoparticles with a size range of (30 to 65 nm). The Scherrer relation has been used to estimate the crystallite size of NiO-NP which ha

... Show More
View Publication
Scopus (22)
Crossref (13)
Scopus Clarivate Crossref
Publication Date
Wed Sep 13 2023
Journal Name
Aip Conference Proceedings
Results for the (b,t)-blocking sets in PG(2,8)
...Show More Authors

View Publication
Scopus (2)
Scopus Crossref
Publication Date
Thu Sep 15 2022
Journal Name
Knowledge And Information Systems
Multiresolution hierarchical support vector machine for classification of large datasets
...Show More Authors

Support vector machine (SVM) is a popular supervised learning algorithm based on margin maximization. It has a high training cost and does not scale well to a large number of data points. We propose a multiresolution algorithm MRH-SVM that trains SVM on a hierarchical data aggregation structure, which also serves as a common data input to other learning algorithms. The proposed algorithm learns SVM models using high-level data aggregates and only visits data aggregates at more detailed levels where support vectors reside. In addition to performance improvements, the algorithm has advantages such as the ability to handle data streams and datasets with imbalanced classes. Experimental results show significant performance improvements in compa

... Show More
View Publication
Scopus (5)
Crossref (4)
Scopus Clarivate Crossref
Publication Date
Fri May 17 2019
Journal Name
Lecture Notes In Networks And Systems
Features Selection for Intrusion Detection System Based on DNA Encoding
...Show More Authors

Intrusion detection systems detect attacks inside computers and networks, where the detection of the attacks must be in fast time and high rate. Various methods proposed achieved high detection rate, this was done either by improving the algorithm or hybridizing with another algorithm. However, they are suffering from the time, especially after the improvement of the algorithm and dealing with large traffic data. On the other hand, past researches have been successfully applied to the DNA sequences detection approaches for intrusion detection system; the achieved detection rate results were very low, on other hand, the processing time was fast. Also, feature selection used to reduce the computation and complexity lead to speed up the system

... Show More
Scopus (5)
Scopus
Publication Date
Wed Feb 01 2023
Journal Name
Practice Periodical On Structural Design And Construction
Best Practice Strategies for Workforce Development and Sustainability in Construction
...Show More Authors

View Publication
Scopus (11)
Crossref (8)
Scopus Clarivate Crossref
Publication Date
Sat Aug 27 2022
Journal Name
Egyptian Journal Of Chemistry
Evaluation of Zinc Chelation Ability for Non-Hydroxamic Organic Moieties
...Show More Authors

View Publication
Scopus (8)
Scopus Clarivate Crossref
Publication Date
Tue May 01 2012
Journal Name
First Eage Workshop On Iraq - Hydrocarbon Exploration And Field Development
Microfacies and Petrographic study for Yamama formation in Ratawi field
...Show More Authors

View Publication
Crossref
Publication Date
Fri Mar 31 2023
Journal Name
Iraqi Geological Journal
Glass Wastes Sorption Efficiency for Removing Cadmium from Aqueous Solutions
...Show More Authors

This research aims to test the ability of glass waste powder to adsorb cadmium from aqueous solutions. The glass wastes were collected from the Glass Manufacturing Factory in Ramadi. The effect of concentration and reaction time on sorption was tested through a series of laboratory experiments. Four Cd concentrations (20, 40, 60, and 80) as each concentration was tested ten times for 5, 10, 15, 20, 25, 30, 35, 40, 45, and 50 min. Solid (glass wastes) to liquid was 2g to 30ml was fixed in each experiment where the total volume of the solution was 30ml. The pH, total dissolved salts and electrical conductivity were measured at 30ºC. The equilibrium concentration was determined at 25 minutes, thereafter it was noted that the sorption

... Show More
View Publication Preview PDF
Crossref
Publication Date
Fri Jul 04 2025
Journal Name
Journal Of Engineering
Construction of a General-Purpose Infrastructure for Rfid – Based Applications
...Show More Authors

View Publication
Publication Date
Sat Jan 03 2015
Journal Name
Journal Of Engineering And Development
3D Presentation for Baghdad University Buildings Using Total Station Device
...Show More Authors

capable of the measuring with a high degree of precision in a single instrument. Total stations device are used for station setting up, setting-outmany points from one station. Their major purpose of this work is to take advantage of total station for setting up building and to establish 3D representation using AutoCAD program. The area of the study was Civil Engineering Department at Baghdad University campus AL Jadiriyah. The completion of the work is done in two stages; 1. The field work: In this stage, the Total Station Nikon Nivo-5C was selected for the current study. This device was measured horizontal and vertical distance, elevations, and coordinates from a single set up. This data directly stored on memory. 2. The office work: In t

... Show More