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:      

This research include building mathematical models for aggregating planning and shorting planning by using integer programming technique for planning master production scheduling in order to control on the operating production for manufacturing companies to achieve their objectives of increasing the efficiency of utilizing resources and reduce storage and  improving customers service  through  deliver in the actual dates and reducing delays.

In this research the Empirical Bayes method is used to Estimate the affiliation parameter in the clinical trials and then we compare this with the Moment Estimates for this parameter using Monte Carlo stimulation , we assumed that the distribution of the observation is binomial distribution while the distribution with the unknown random parameters is beta distribution ,finally we conclude that the Empirical bayes method for the random affiliation parameter is efficient using Mean Squares Error (MSE) and for different Sample size .

The Aim of this paper is to investigate numerically the simulation of ice melting in one and two dimension using the cell-centered finite volume method. The mathematical model is based on the heat conduction equation associated with a fixed grid, latent heat source approach. The fully implicit time scheme is selected to represent the time discretization. The ice conductivity is chosen
to be the value of the approximated conductivity at the interface between adjacent ice and water control volumes. The predicted temperature distribution, percentage melt fraction, interface location and its velocity is compared with those obtained from the exact analytical solution. A good agreement is obtained when comparing the numerical results of one

In this study, the modified size-strain plot (SSP) method was used to analyze the x-ray diffraction lines pattern of diffraction lines (1 0 1), (1 2 1), (2 0 2), (0 4 2), (2 4 2) for the calcium titanate(CaTiO3) nanoparticles, and to calculate lattice strain, crystallite size, stress, and energy density, using three models: uniform (USDM). With a lattice strain of (2.147201889), a stress of (0.267452615X10), and an energy density of (2.900651X10-3 KJ/m3), the crystallite was 32.29477611 nm in size, and to calculate lattice strain of Scherrer (4.1644598X10−3), and (1.509066023X10−6 KJ/m3), a stress of(6.403949183X10−4MPa) and (26.019894 nm).

Background: study the effect of various risk factors on reperfusion success after thrombolysis by measuring ST resolution.
Objectives: Early patency of the infarct-related artery is associated with reduced mortality. Thrombolytic therapy is frequently followed by rapid recanalization lead to reduction of infarct size, improve left ventricular function and increase survival by reopening of coronary artery . The reduction in ST-segment elevation on the standard 12 lead electrocardiogram 1-4 h after initiation of thrombolysis may be the simplest and most useful clinical tool to test the effectiveness of thrombolytic therapy.
Methods: Seventy patients with acute ST elevation myocardial infarction admitted to alkindy teaching hospital C

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 .