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 Apr 01 2023
Journal Name
Baghdad Science Journal
Detour Polynomials of Generalized Vertex Identified of Graphs
...Show More Authors

The Detour distance is one of the most common distance types used in chemistry and computer networks today. Therefore, in this paper, the detour polynomials and detour indices of vertices identified of n-graphs which are connected to themselves and separated from each other with respect to the vertices for n≥3 will be obtained. Also, polynomials detour and detour indices will be found for another graphs which have important applications in Chemistry.

 

View Publication Preview PDF
Scopus (4)
Crossref (2)
Scopus Crossref
Publication Date
Fri Mar 31 2017
Journal Name
Iraqi Journal Of Biotechnology
Reliable Reference Gene for Normalization of RT- qPCR Data in Human Cancer Cell Lines
Subjected to Gene Knockdown
...Show More Authors

Quantitative real-time Polymerase Chain Reaction (RT-qPCR) has become a valuable molecular technique in biomedical research. The selection of suitable endogenous reference genes is necessary for normalization of target gene expression in RT-qPCR experiments. The aim of this study was to determine the suitability of each 18S rRNA and ACTB as internal control genes for normalization of RT-qPCR data in some human cell lines transfected with small interfering RNA (siRNA). Four cancer cell lines including MCF-7, T47D, MDA-MB-231 and Hela cells along with HEK293 representing an embryonic cell line were depleted of E2F6 using siRNA specific for E2F6 compared to negative control cells, which were transfected with siRNA not specific for any gene. Us

... Show More
Preview PDF
Publication Date
Wed Jan 01 2025
Journal Name
Journal Of Interdisciplinary Mathematics
Double INEM-transform integral for solving second order partial differential equation
...Show More Authors

In this study, a brand-new double transform known as the double INEM transform is introduced. Combined with the definition and essential features of the proposed double transform, new findings on partial derivatives, Heaviside function, are also presented. Additionally, we solve several symmetric applications to show how effective the provided transform is at resolving partial differential equation.

View Publication
Scopus (1)
Scopus Clarivate Crossref
Publication Date
Sun Sep 01 2024
Journal Name
Partial Differential Equations In Applied Mathematics
Perturbation iteration transform method for solving fractional order integro-differential equation
...Show More Authors

View Publication
Scopus (4)
Crossref (3)
Scopus Crossref
Publication Date
Mon Mar 09 2015
Journal Name
Monthly Notices Of The Royal Astronomical Society
A reliable iterative method for solving Volterra integro-differential equations and some applications for the Lane–Emden equations of the first kind
...Show More Authors

View Publication
Crossref (8)
Crossref
Publication Date
Thu Oct 01 2020
Journal Name
Ieee Transactions On Very Large Scale Integration (vlsi) Systems
Low-Power, Highly Reliable Dynamic Thermal Management by Exploiting Approximate Computing
...Show More Authors

With the continuous downscaling of semiconductor processes, the growing power density and thermal issues in multicore processors become more and more challenging, thus reliable dynamic thermal management (DTM) is required to prevent severe challenges in system performance. The accuracy of the thermal profile, delivered to the DTM manager, plays a critical role in the efficiency and reliability of DTM, different sources of noise and variations in deep submicron (DSM) technologies severely affecting the thermal data that can lead to significant degradation of DTM performance. In this article, we propose a novel fault-tolerance scheme exploiting approximate computing to mitigate the DSM effects on DTM efficiency. Approximate computing in hardw

... Show More
View Publication
Scopus (5)
Crossref (5)
Scopus Clarivate Crossref
Publication Date
Mon Feb 01 2021
Journal Name
International Journal Of Electrical And Computer Engineering (ijece)
Features of genetic algorithm for plain text encryption
...Show More Authors

The data communication has been growing in present day. Therefore, the data encryption became very essential in secured data transmission and storage and protecting data contents from intruder and unauthorized persons. In this paper, a fast technique for text encryption depending on genetic algorithm is presented. The encryption approach is achieved by the genetic operators Crossover and mutation. The encryption proposal technique based on dividing the plain text characters into pairs, and applying the crossover operation between them, followed by the mutation operation to get the encrypted text. The experimental results show that the proposal provides an important improvement in encryption rate with comparatively high-speed Process

... Show More
View Publication
Scopus (15)
Crossref (4)
Scopus 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 (26)
Crossref (23)
Scopus Clarivate Crossref
Publication Date
Sun Jun 20 2021
Journal Name
Baghdad Science Journal
Multifactor Algorithm for Test Case Selection and Ordering
...Show More Authors

Regression testing being expensive, requires optimization notion. Typically, the optimization of test cases results in selecting a reduced set or subset of test cases or prioritizing the test cases to detect potential faults at an earlier phase. Many former studies revealed the heuristic-dependent mechanism to attain optimality while reducing or prioritizing test cases. Nevertheless, those studies were deprived of systematic procedures to manage tied test cases issue. Moreover, evolutionary algorithms such as the genetic process often help in depleting test cases, together with a concurrent decrease in computational runtime. However, when examining the fault detection capacity along with other parameters, is required, the method falls sh

... Show More
View Publication Preview PDF
Scopus (4)
Crossref (2)
Scopus Clarivate Crossref
Publication Date
Fri Apr 20 2012
Journal Name
International Journal Of Computer And Information Engineering
An Optimal Algorithm for HTML Page Building Process
...Show More Authors

An Optimal Algorithm for HTML Page Building Process

View Publication Preview PDF