The fingerprinting DNA method which depends on the unique pattern in this study was employed to detect the hydatid cyst of Echinococcus granulosus and to determine the genetic variation among their strains in different intermediate hosts (cows and sheep).  The unique pattern represents the number of amplified bands and their molecular weights with specialized sequences to one sample which different from the other samples.   Five hydatitd cysts samples  from cows and sheep were  collected, genetic analysis for  isolated DNA was done using PCR technique and  Random Amplified Polymorphic DNA reaction(RAPD) depending on (4) random primers, and the results showed:      

Is in this research review of the way minimum absolute deviations values ​​based on linear programming method to estimate the parameters of simple linear regression model and give an overview of this model. We were modeling method deviations of the absolute values ​​proposed using a scale of dispersion and composition of a simple linear regression model based on the proposed measure. Object of the work is to find the capabilities of not affected by abnormal values by using numerical method and at the lowest possible recurrence.

The γ- mixing ratios of γ- transitions from levels of 56Fe populated in reaction are calculated using least square fitting program for the first time in the case of pure and mixed transitions the results obtained have been compound with γ Values determined by other methods .The comparison shows that the agreement is good this confirmed the valilety of this method in calculating of values for such γ- transitions key word: γ- transition ,Multipole mixing ratios ,Least square fitting method.

      In this paper, several types of space-time fractional partial differential equations has been solved by using most of special double linear integral transform ”double  Sumudu ”. Also, we are going to argue the truth of these solutions by another analytically method “invariant subspace method”. All results are illustrative numerically and graphically.

This study presents a practical method for solving fractional order delay variational problems. The fractional derivative is given in the Caputo sense. The suggested approach is based on the Laplace transform and the shifted Legendre polynomials by approximating the candidate function by the shifted Legendre series with unknown coefficients yet to be determined. The proposed method converts the fractional order delay variational problem into a set of (n ＋ 1) algebraic equations, where the solution to the resultant equation provides us the unknown coefficients of the terminated series that have been utilized to approximate the solution to the considered variational problem. Illustrative examples are given to show that the recommended appro

A loS.sless (reversible) data hiding (embedding) method  inside  an image  (translating medium)  - presented   in  the  present  work  using  L_SB (least  significant  bit). technique  which  enables  us to translate   data  using an  image  (host  image),  using  a  secret  key, to  be  undetectable  without losing  any  data  or  without   changing   the  size  and  the  external   scene (visible  properties) of the image, the hid-ing data is then can  be extracted (without  losing)   by reversing &n

The preparation of tin metal from stannous chloride solution by wet method in the presence of aluminum powder as a reducing agent is studied. The preparation is commenced through a reduction step in the presence of reducing agent followed by smelting step at elevated temperature in a programmable electrical furnace. In the reduction step, preliminary experiments are conducted to study the effect of initial acidity, time of addition of  the aluminum powder and excess amount of reducing agent on the conversion of stannous to tin metal. Three different parameters are studied through smelting step, these are : heating rate, temperature and residence time.

To characterize the product, different instrumental analyses are used:

In this paper, a subspace identification method for bilinear systems is used . Wherein a " three-block " and " four-block " subspace algorithms are used. In this algorithms the input signal to the system does not have to be white . Simulation of these algorithms shows that the " four-block " gives fast convergence and the dimensions of the matrices involved are significantly smaller so that the computational complexity is lower as a comparison with " three-block " algorithm .