Preferred Language
Articles
/
VxfENY8BVTCNdQwCsmKB
Differential Evolution algorithm for linear frequency modulation radar signal denoising
...Show More Authors

Signal denoising is directly related to sample estimation of received signals, either by estimating the equation parameters for the target reflections or the surrounding noise and clutter accompanying the data of interest. Radar signals recorded using analogue or digital devices are not immune to noise. Random or white noise with no coherency is mainly produced in the form of random electrons, and caused by heat, environment, and stray circuitry loses. These factors influence the output signal voltage, thus creating detectable noise. Differential Evolution (DE) is an effectual, competent, and robust optimisation method used to solve different problems in the engineering and scientific domains, such as in signal processing. This paper looks at the feasibility of using the differential evolution algorithm to estimate the linear frequency modulation received signal parameters for radar signal denoising. The results gave high target recognition and showed feasibility to denoise received signals.

Scopus Crossref
View Publication
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
Publication Date
Thu Dec 01 2011
Journal Name
2011 Developments In E-systems Engineering
Enhanced Computation Time for Fast Block Matching Algorithm
...Show More Authors

View Publication
Scopus (1)
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
Fri Sep 03 2021
Journal Name
Entropy
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

... Show More
View Publication
Scopus (34)
Crossref (31)
Scopus Clarivate Crossref
Publication Date
Fri Apr 01 2022
Journal Name
Symmetry
Fast Overlapping Block Processing Algorithm for Feature Extraction
...Show More Authors

In many video and image processing applications, the frames are partitioned into blocks, which are extracted and processed sequentially. In this paper, we propose a fast algorithm for calculation of features of overlapping image blocks. We assume the features are projections of the block on separable 2D basis functions (usually orthogonal polynomials) where we benefit from the symmetry with respect to spatial variables. The main idea is based on a construction of auxiliary matrices that virtually extends the original image and makes it possible to avoid a time-consuming computation in loops. These matrices can be pre-calculated, stored and used repeatedly since they are independent of the image itself. We validated experimentally th

... Show More
View Publication
Scopus (25)
Crossref (26)
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
Sat Oct 01 2022
Journal Name
Journal Of Computational Science
Novel approximate solution for fractional differential equations by the optimal variational iteration method
...Show More Authors

Crossref (31)
Clarivate Crossref
Publication Date
Thu Jan 01 2015
Journal Name
Journal Of The College Of Basic Education
Efficient Modifications of the Adomian Decomposition Method for Thirteenth Order Ordinary Differential Equations
...Show More Authors

This paper deals with the thirteenth order differential equations linear and nonlinear in boundary value problems by using the Modified Adomian Decomposition Method (MADM), the analytical results of the equations have been obtained in terms of convergent series with easily computable components. Two numerical examples results show that this method is a promising and powerful tool for solving this problems.

View Publication
Publication Date
Wed Mar 10 2021
Journal Name
Baghdad Science Journal
Theoretical Studies of Sum Optical Properties for InAs (001) by Surface Differential Reflectivity
...Show More Authors

The real and imaginary part of complex dielectric constant for InAs(001) by adsorption of oxsagen atoms has been calculated, using numerical analysis method (non-linear least square fitting). As a result a mathematical model built-up and the final result show a fairly good agreement with other genuine published works.

View Publication Preview PDF
Crossref
Publication Date
Tue May 16 2023
Journal Name
Journal Of Engineering
Application of Wavelet Packet and S Transforms for Differential Protection of Power Transformer
...Show More Authors

The differential protection of power transformers appears to be more difficult than any type of protection for any other part or element in a power system. Such difficulties arise from the existence of the magnetizing inrush phenomenon. Therefore, it is necessary to recognize between inrush current and the current arise from internal faults. In this paper, two approaches based on wavelet packet transform (WPT) and S-transform (ST) are applied to recognize different types of currents following in the transformer. In WPT approach, the selection of optimal mother wavelet and the optimal number of resolution is carried out using minimum description length (MDL) criteria before taking the decision for the extraction features from the WPT tree

... Show More
View Publication Preview PDF
Crossref