Background: The discriminative power of the classical WHO parameters in relation to male fertility is quite low, because they only address few aspects of sperm quality and function. This has led investigators to focus their attention on the male gamete and in particular its genome.Objective: To explore which of the sperm DNA damage parameters measured by comet assay are more reliable, and their relations with the standard semen parameters.Methods: Study was done on 40 infertile men selected from couples attending the Institute of Embryo Reasearch and Infertility Treatment at Al-Kadhimiya City/ Baghdad in the period between February 2009 and May 2009, with a history of infertility of ≥1 years; and 15 healthy volunteers of proven fertili

As many expensive and invasive procedures are used for the diagnosis or follow-up of clinical conditions, the measurement of cell-free DNA is a promising, noninvasive method, which considers using blood, follicular fluid, or seminal fluid. This method is used to determine chromosomal abnormalities, genetic disorders, and indicators of some diseases such as polycystic ovary syndrome, pre-eclampsia, and some malignancies. Cell-free DNA, which are DNA fragments outside the nucleus, originates from an apoptotic process. However, to be used as a marker for the previously mentioned diseases is still under investigation. We discuss some aspects of using cell-free DNA measurements as an indicator or marker for pathological conditions.

This paper presents a new algorithm in an important research field which is the semantic word similarity estimation. A new feature-based algorithm is proposed for measuring the word semantic similarity for the Arabic language. It is a highly systematic language where its words exhibit elegant and rigorous logic. The score of sematic similarity between two Arabic words is calculated as a function of their common and total taxonomical features. An Arabic knowledge source is employed for extracting the taxonomical features as a set of all concepts that subsumed the concepts containing the compared words. The previously developed Arabic word benchmark datasets are used for optimizing and evaluating the proposed algorithm. In this paper,

this paper give a proof of known conditions for the existence of peridic conincidence points of continuius maps using lindemann theotem on transcendental numbers

The focus of this article, reviewed a generalized  of contraction mapping and nonexpansive maps and recall some theorems about the existence and uniqueness of common fixed point and coincidence fixed-point for such maps under some conditions. Moreover, some schemes of different types as one-step schemes ,two-step schemes and three step schemes (Mann scheme algorithm, Ishukawa scheme algorithm, noor scheme algorithm, .scheme algorithm,  scheme algorithm Modified  scheme algorithm arahan scheme algorithm and others. The convergence of these schemes has been studied .On the other hands, We also reviewed the convergence, valence and stability theories of different types of near-plots in convex metric space.

In the image processing’s field and computer vision it’s important to represent the image by its information. Image information comes from the image’s features that extracted from it using feature detection/extraction techniques and features description. Features in computer vision define informative data. For human eye its perfect to extract information from raw image, but computer cannot recognize image information. This is why various feature extraction techniques have been presented and progressed rapidly. This paper presents a general overview of the feature extraction categories for image.

Cryptographic applications demand much more of a pseudo-random-sequence
generator than do most other applications. Cryptographic randomness does not mean just
statistical randomness, although that is part of it. For a sequence to be cryptographically
secure pseudo-random, it must be unpredictable.
The random sequences should satisfy the basic randomness postulates; one of them is
the run postulate (sequences of the same bit). These sequences should have about the same
number of ones and zeros, about half the runs should be of length one, one quarter of length
two, one eighth of length three, and so on.The distribution of run lengths for zeros and ones
should be the same. These properties can be measured determinis