There is an evidence that channel estimation in communication systems plays a crucial issue in recovering the transmitted data. In recent years, there has been an increasing interest to solve problems due to channel estimation and equalization especially when the channel impulse response is fast time varying Rician fading distribution that means channel impulse response change rapidly. Therefore, there must be an optimal channel estimation and equalization to recover transmitted data. However. this paper attempt to compare epsilon normalized least mean square (ε-NLMS) and recursive least squares (RLS) algorithms by computing their performance ability to track multiple fast time varying Rician fading channel with different values of Doppler

Rice is a major staple food for more than two thirds of the world population. Pathogenesis-related proteins-10 (PR10) have a range of 154 to 163 amino acid with molecular weight ~ 17 kDa.  They are acidic and generally intracellular and cytosolic proteins accumulate in plants in response to biotic and abiotic stresses. In the present study, a PR10 gene and its corresponding protein were characterized in O. sativa, O.  barthii, O. glaberrima, O. glumipatula, O. meridionalis, O. nivara, O. rufipogon and  O. punctata. The results revealed a narrow range of variation at both DNA and protein levels in all examined species except O. glumipatula. The latter showed a relatively

The  purpose  of  the  paper  is  to  tind  the  degree  of  the approximation of a functions  f be bounded , measurable and defined

in  interval   [a,h]by  Bernstein  polynomial  in  LP    space  1 $ p < oo by

using Ditzian-Totik modulus  of smootlmess  and  k 1n  average modvlus of smoothness.

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

The 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