Preferred Language
Articles
/
9xdI848BVTCNdQwCAICy
High-Performance Krawtchouk Polynomials of High Order Based on Multithreading
...Show More Authors

Orthogonal polynomials and their moments serve as pivotal elements across various fields. Discrete Krawtchouk polynomials (DKraPs) are considered a versatile family of orthogonal polynomials and are widely used in different fields such as probability theory, signal processing, digital communications, and image processing. Various recurrence algorithms have been proposed so far to address the challenge of numerical instability for large values of orders and signal sizes. The computation of DKraP coefficients was typically computed using sequential algorithms, which are computationally extensive for large order values and polynomial sizes. To this end, this paper introduces a computationally efficient solution that utilizes the parallel processing capabilities of modern central processing units (CPUs), namely the availability of multiple cores and multithreading. The proposed multi-threaded implementations for computing DKraP coefficients divide the computations into multiple independent tasks, which are executed concurrently by different threads distributed among the independent cores. This multi-threaded approach has been evaluated across a range of DKraP sizes and various values of polynomial parameters. The results show that the proposed method achieves a significant reduction in computation time. In addition, the proposed method has the added benefit of applying to larger polynomial sizes and a wider range of Krawtchouk polynomial parameters. Furthermore, an accurate and appropriate selection scheme of the recurrence algorithm is introduced. The proposed approach introduced in this paper makes the DKraP coefficient computation an attractive solution for a variety of applications.

Scopus Clarivate Crossref
View Publication
Publication Date
Sun Sep 07 2014
Journal Name
Baghdad Science Journal
Deriving the Composite Simpson Rule by Using Bernstein Polynomials for Solving Volterra Integral Equations
...Show More Authors

In this paper we use Bernstein polynomials for deriving the modified Simpson's 3/8 , and the composite modified Simpson's 3/8 to solve one dimensional linear Volterra integral equations of the second kind , and we find that the solution computed by this procedure is very close to exact solution.

View Publication Preview PDF
Crossref (1)
Crossref
Publication Date
Fri Mar 01 2024
Journal Name
Partial Differential Equations In Applied Mathematics
A hybrid technique for solving fractional delay variational problems by the shifted Legendre polynomials
...Show More Authors

This study presents a practical method for solving fractional order delay variational problems. The fractional derivative is given in the Caputo sense. The suggested approach is based on the Laplace transform and the shifted Legendre polynomials by approximating the candidate function by the shifted Legendre series with unknown coefficients yet to be determined. The proposed method converts the fractional order delay variational problem into a set of (n + 1) algebraic equations, where the solution to the resultant equation provides us the unknown coefficients of the terminated series that have been utilized to approximate the solution to the considered variational problem. Illustrative examples are given to show that the recommended appro

... Show More
View Publication Preview PDF
Scopus (3)
Crossref (1)
Scopus Crossref
Publication Date
Wed Jun 01 2022
Journal Name
Baghdad Science Journal
Schultz and Modified Schultz Polynomials for Edge – Identification Chain and Ring – for Square Graphs
...Show More Authors

In a connected graph , the distance function between each pair of two vertices from a set vertex  is the shortest distance between them and the vertex degree  denoted by  is the number of edges which are incident to the vertex  The Schultz and modified Schultz polynomials of  are have defined as:

 respectively, where the summations are taken over all unordered pairs of distinct vertices in  and  is the distance between  and  in  The general forms of Schultz and modified Schultz polynomials shall be found and indices of the edge – identification chain and ring – square graphs in the present work.

View Publication Preview PDF
Scopus (4)
Crossref (1)
Scopus Clarivate Crossref
Publication Date
Fri Jun 29 2018
Journal Name
Journal Of The College Of Education For Women
Audio Classification Based on Content Features
...Show More Authors

Audio classification is the process to classify different audio types according to contents. It is implemented in a large variety of real world problems, all classification applications allowed the target subjects to be viewed as a specific type of audio and hence, there is a variety in the audio types and every type has to be treatedcarefully according to its significant properties.Feature extraction is an important process for audio classification. This workintroduces several sets of features according to the type, two types of audio (datasets) were studied. Two different features sets are proposed: (i) firstorder gradient feature vector, and (ii) Local roughness feature vector, the experimentsshowed that the results are competitive to

... Show More
View Publication Preview PDF
Publication Date
Mon Apr 15 2019
Journal Name
Proceedings Of The International Conference On Information And Communication Technology
A steganography based on orthogonal moments
...Show More Authors

View Publication
Scopus (23)
Crossref (19)
Scopus Clarivate Crossref
Publication Date
Thu Apr 27 2017
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Signature Verification Based on Moments Technique
...Show More Authors

In this research we will present the signature as a key to the biometric authentication technique. I shall use moment invariants as a tool to make a decision about any signature which is belonging to the certain person or not. Eighteen voluntaries give 108 signatures as a sample to test the proposed system, six samples belong to each person were taken. Moment invariants are used to build a feature vector stored in this system. Euclidean distance measure used to compute the distance between the specific signatures of persons saved in this system and with new sample acquired to same persons for making decision about the new signature. Each signature is acquired by scanner in jpg format with 300DPI. Matlab used to implement this system.

... Show More
View Publication Preview PDF
Publication Date
Sun Oct 01 2023
Journal Name
Baghdad Science Journal
Watermark Based on Singular Value Decomposition
...Show More Authors

Watermarking operation can be defined as a process of embedding special wanted and reversible information in important secure files to protect the ownership or information of the wanted cover file based on the proposed singular value decomposition (SVD) watermark. The proposed method for digital watermark has very huge domain for constructing final number and this mean protecting watermark from conflict. The cover file is the important image need to be protected. A hidden watermark is a unique number extracted from the cover file by performing proposed related and successive operations, starting by dividing the original image into four various parts with unequal size. Each part of these four treated as a separate matrix and applying SVD

... Show More
View Publication Preview PDF
Scopus (2)
Crossref (1)
Scopus Crossref
Publication Date
Sun Jul 09 2023
Journal Name
Journal Of Engineering
Influence of Aging Time on Asphalt Pavement Performance
...Show More Authors

Aging of asphalt pavements typically occurs through oxidation of the asphalt and evaporation of the lighter maltenes from the binder. The main objective of this study is to evaluate influence of aging on performance of asphalt paving materials.nAsphalt concrete mixtures, were prepared, and subjected to short term aging (STA) procedure which involved heating the loose mixtures in an oven for two aging period of (4 and 8) hours at a temperature of 135 o C. Then it was subject to Long term aging (LTA) procedure using (2 and 5) days aging periods at 85 o C for Marshall compacted specimens. The effect of aging periods on properties of asphalt concrete at optimum asphalt content such as Marshall Properties, indirect tensile strength at 25 o C,

... Show More
View Publication Preview PDF
Crossref (3)
Crossref
Publication Date
Thu Dec 01 2022
Journal Name
Baghdad Science Journal
The Approximation of Weighted Hölder Functions by Fourier-Jacobi Polynomials to the Singular Sturm-Liouville Operator
...Show More Authors

      In this work, a weighted H lder function that approximates a Jacobi polynomial which solves the second order singular Sturm-Liouville equation is discussed. This is generally equivalent to the Jacobean translations and the moduli of smoothness. This paper aims to focus on improving methods of approximation and finding the upper and lower estimates for the degree of approximation in weighted H lder spaces by modifying the modulus of continuity and smoothness. Moreover, some properties for the moduli of smoothness with direct and inverse results are considered.

View Publication Preview PDF
Scopus (2)
Scopus Clarivate Crossref
Publication Date
Mon Nov 19 2018
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Cryptography by Using"Hosoya"Polynomials for"Graphs Groups of Integer Modulen and"Dihedral Groups with'Immersion"Property
...Show More Authors

      In this paper we used Hosoya polynomial ofgroupgraphs Z1,...,Z26 after representing each group as  graph and using Dihedral group to"encrypt the plain texts with the immersion property which provided Hosoya polynomial to immerse the cipher text in another"cipher text to become very"difficult to solve.

View Publication Preview PDF
Crossref