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 isolated from noise distortion. The modified method showed significant improvements in performance over traditional de-noising techniques.
In this study, the quality assurance of the linear accelerator available at the Baghdad Center for Radiation Therapy and Nuclear Medicine was verified using Star Track and Perspex. The study was established from August to December 2018. This study showed that there was an acceptable variation in the dose output of the linear accelerator. This variation was ±2% and it was within the permissible range according to the recommendations of the manufacturer of the accelerator (Elkta).
The research dealt with a comparative study between some semi-parametric estimation methods to the Partial linear Single Index Model using simulation. There are two approaches to model estimation two-stage procedure and MADE to estimate this model. Simulations were used to study the finite sample performance of estimating methods based on different Single Index models, error variances, and different sample sizes , and the mean average squared errors were used as a comparison criterion between the methods were used. The results showed a preference for the two-stage procedure depending on all the cases that were used
The main focus of this research is to examine the Travelling Salesman Problem (TSP) and the methods used to solve this problem where this problem is considered as one of the combinatorial optimization problems which met wide publicity and attention from the researches for to it's simple formulation and important applications and engagement to the rest of combinatorial problems , which is based on finding the optimal path through known number of cities where the salesman visits each city only once before returning to the city of departure n this research , the benefits of( FMOLP) algorithm is employed as one of the best methods to solve the (TSP) problem and the application of the algorithm in conjun
... Show MoreThe paper establishes explicit representations of the errors and residuals of approximate
solutions of triangular linear systems by Jordan elimination and of general linear algebraic
systems by Gauss-Jordan elimination as functions of the data perturbations and the rounding
errors in arithmetic floating-point operations. From these representations strict optimal
componentwise error and residual bounds are derived. Further, stability estimates for the
solutions are discussed. The error bounds for the solutions of triangular linear systems are
compared to the optimal error bounds for the solutions by back substitution and by Gaussian
elimination with back substitution, respectively. The results confirm in a very
Linear Feedback Shift Register (LFSR) systems are used widely in stream cipher systems field. Any system of LFSR's which wauldn't be attacked must first construct the system of linear equations of the LFSR unit. In this paper methods are developed to construct a system of linear/nonlinear equations of key generator (a LFSR's system) where the effect of combining (Boolean) function of LFSR is obvious. Before solving the system of linear/nonlinear equations by using one of the known classical methods, we have to test the uniqueness of the solution. Finding the solution to these systems mean finding the initial values of the LFSR's of the generator. Two known generators are used to test and apply the ideas of the paper,
... Show MoreThis paper presents a newly developed method with new algorithms to find the numerical solution of nth-order state-space equations (SSE) of linear continuous-time control system by using block method. The algorithms have been written in Matlab language. The state-space equation is the modern representation to the analysis of continuous-time system. It was treated numerically to the single-input-single-output (SISO) systems as well as multiple-input-multiple-output (MIMO) systems by using fourth-order-six-steps block method. We show that it is possible to find the output values of the state-space method using block method. Comparison between the numerical and exact results has been given for some numerical examples for solving different type
... Show MoreIn this paper we shall generalize fifth explicit Runge-Kutta Feldberg(ERKF(5)) and Continuous explicit Runge-Kutta (CERK) method using shooting method to solve second order boundary value problem which can be reduced to order one.These methods we shall call them as shooting Continuous Explicit Runge-Kutta method, the results are computed using matlab program.
: In this study, a linear synchronous machine is compared with a linear transverse flux machine. Both machines have been designed and built with the intention of being used as the power take off in a free piston engine. As both topologies are cylindrical, it is not possible to construct either using just flat laminations and so alternative methods are described and demonstrated. Despite the difference in topology and specification, the machines are compared on a common base in terms of rated force and suitability for use as a generator. Experience gained during the manufacture of two prototypes is described.