The main intention of this study was to investigate the development of a new optimization technique based on the differential evolution (DE) algorithm, for the purpose of linear frequency modulation radar signal de-noising. As the standard DE algorithm is a fixed length optimizer, it is not suitable for solving signal de-noising problems that call for variability. A modified crossover scheme called rand-length crossover was designed to fit the proposed variable-length DE, and the new DE algorithm is referred to as the random variable-length crossover differential evolution (rvlx-DE) algorithm. The measurement results demonstrate a highly efficient capability for target detection in terms of frequency response and peak forming that was isola

The fractional order partial differential equations (FPDEs) are generalizations of classical partial differential equations (PDEs). In this paper we examine the stability of the explicit and implicit finite difference methods to solve the initial-boundary value problem of the hyperbolic for one-sided and two sided fractional order partial differential equations (FPDEs). The stability (and convergence) result of this problem is discussed by using the Fourier series method (Von Neumanns Method).

 ABSTRICT:

  This study is concerned with the estimation of constant  and time-varying parameters in non-linear ordinary differential equations, which do not have analytical solutions. The estimation is done in a multi-stage method where constant and time-varying parameters are estimated in a straight sequential way from several stages. In the first stage, the model of the differential equations is converted to a regression model that includes the state variables with their derivatives and then the estimation of the state variables and their derivatives in a penalized splines method and compensating the estimations in the regression model. In the second stage, the pseudo- least squares method was used to es

The objective of the research is to uncover the effect of the strategy of Quranic verses in the collection of science and systemic intelligence for second-grade students. The research sample consisted of (48) students of second grade students in the middle of Al Rasheed Boys School of the second Karkh Directorate, Distribution in the two divisions, Division of (b) and experimental group that studied strategy of Quranic verses, and the Division (a) control group which studied the regular way, and results indicated a statistically significant differences for the experimental group students studied using the strategy Verses in systemic intelligence collection.

Use Almtafr Alcderan orange, one of the factors Hashr Alttafaria to study Alatjabh isolates elected on the basis of specifications so that was a positive response with mutagen record and system consisting of three isolates used Alcderan orange graded concentrations and under specific Trov similar conditions Alttafar Pal NTG compared

Markov chains are an application of stochastic models in operation research, helping the analysis and optimization of processes with random events and transitions. The method that will be deployed to obtain the transient solution to a Markov chain problem is an important part of this process. The present paper introduces a novel Ordinary Differential Equation (ODE) approach to solve the Markov chain problem. The probability distribution of a continuous-time Markov chain with an infinitesimal generator at a given time is considered, which is a resulting solution of the Chapman-Kolmogorov differential equation. This study presents a one-step second-derivative method with better accuracy in solving the first-order Initial Value Problem

Sequence covering array (SCA) generation is an active research area in recent years. Unlike the sequence-less covering arrays (CA), the order of sequence varies in the test case generation process. This paper reviews the state-of-the-art of the SCA strategies, earlier works reported that finding a minimal size of a test suite is considered as an NP-Hard problem. In addition, most of the existing strategies for SCA generation have a high order of complexity due to the generation of all combinatorial interactions by adopting one-test-at-a-time fashion. Reducing the complexity by adopting one-parameter- at-a-time for SCA generation is a challenging process. In addition, this reduction facilitates the supporting for a higher strength of

            The article describes a certain computation method of -arcs to construct the number of distinct -arcs in  for . In this method, a new approach employed to compute the number of -arcs and the number of distinct arcs respectively. This approach is based on choosing the number of inequivalent classes } of -secant distributions that is the number of 4-secant, 3-secant, 2-secant, 1-secant and 0-secant in each process. The maximum size of -arc that has been constructed by this method is . The new method is a new tool to deal with the programming difficulties that sometimes may lead to programming problems represented by the increasing number of arcs. It is essential to reduce the established number of -arcs in each cons