KE Sharquie, AF Hameed, AA Noaimi, Indian Journal of Pathology and Microbiology, 2016 - Cited by 12

In this article, performing and deriving te probability density function for Rayleigh distribution is done by using ordinary least squares estimator method and Rank set estimator method. Then creating interval for scale parameter of Rayleigh distribution. Anew method using   is used for fuzzy scale parameter. After that creating the survival and hazard functions for two ranking functions are conducted to show which one is beast.

Half of the oil production of the worldwide is a result  of the water flooding  project. But the main concern of this process is mobility control of the injected fluid, because the unfavorable mobility ratio leads to fingering effect. Adding polymer to the injection water increase the water viscosity, therefore, the displacement will be more stable and have a greater sweep efficiency.

   Using of polymer flooding has received more attention these days. Polymer has great potential in the Middle East region, especially in reservoir with high temperature and salinity.

   The main objective of this work is to show the effect of shear rate, salinity, temperature, polymer concentration on polymer v

Some maps of the chaotic firefly algorithm were selected to select variables for data on blood diseases and blood vessels obtained from Nasiriyah General Hospital where the data were tested and tracking the distribution of Gamma and it was concluded that a Chebyshevmap method is more efficient than a Sinusoidal map method through mean square error criterion.

Suggested in this study the introduction of monomers have the ability to interact with polyester Rzn way confused or Alchapak Vodev polycarbonate first Almiaal acrylate ????? grains and offered models for high temperature and for a period of time of 40 days and absorbance and penetration and after color changes resulting from the storage heat higher using shades where models were extractedthermal storage and take measurements and then returned periodically results were consistent with theoretical expectations and mixing

Let A ⊆ V(H) of any graph H, every node w of H be labeled using a set of numbers; , where d(w,v) denotes the distance between node w and the node v in H, known as its open A-distance pattern. A graph H is known as the open distance-pattern uniform (odpu)-graph, if there is a nonempty subset A ⊆V(H) together with  is the same for all . Here  is known as the open distance pattern uniform (odpu-) labeling of the graph H and A is known as an odpu-set of H. The minimum cardinality of vertices in any odpu-set of H, if it exists, will be known as the odpu-number of the graph H. This article gives a characterization of maximal outerplanar-odpu graphs. Also, it establishes that the possible odpu-number of an odpu-maximal outerplanar graph i