A total of 589 fishes, belonging to 23 species were collected from eight different localities
in north and mid Iraq during 1993. The parasitological inspection of such fishes revealed the
presence of 59 parasite species and two fungi. Among such parasites, five monogenetic
trematodes were recorded on the gills of some fishes for the first time in Iraq. These
included:- Ancyrocephalus vanbenedenii on Liza abu from Tigris river at Al-Zaafaraniya,
south of Baghdad; Dactylogyrus anchoratus on Cyprinus carpio from Tigris river at Al –
Zaafaranya D. minutus on C. carpio from both Tigris river at Al-Zaafaraniya and Euphrates
river at Al-Qadisiya dam lake; Discocotyle sagittata on L. abu from both the drainage system
at

The middle Cenomanian – early Turonian Mishrif Formation, a major carbonate reservoir unit in southern Iraq, was studied using cuttings and core samples and wireline logs (gamma‐ray, density and sonic) from 66 wells at 15 oilfields. Depositional facies ranging from deep marine to tidal flat were recorded. Microfacies interpretations together with wireline log interpretations show that the formation is composed of transgressive and regressive hemicycles. The regressive hemicycles are interpreted to indicate the progradation of rudist lithosomes (highstand systems tract deposits) towards distal basinal locations such as the Kumait, Luhais and Abu Amood oilfield areas. Transgressive hemicycles (transgressive systems tract deposits)

In Automatic Speech Recognition (ASR) the non-linear data projection provided by a one hidden layer Multilayer Perceptron (MLP), trained to recognize phonemes, and has previous experiments to provide feature enhancement substantially increased ASR performance, especially in noise. Previous attempts to apply an analogous approach to speaker identification have not succeeded in improving performance, except by combining MLP processed features with other features. We present test results for the TIMIT database which show that the advantage of MLP preprocessing for open set speaker identification increases with the number of speakers used to train the MLP and that improved identification is obtained as this number increases beyond sixty.

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 .

Steganography is the art of secret communication. Its purpose is to hide the presence of information, using, for example, images as covers. The frequency domain is well suited for embedding in image, since hiding in this frequency domain coefficients is robust to many attacks. This paper proposed hiding a secret image of size equal to quarter of the cover one. Set Partitioning in Hierarchal Trees (SPIHT) codec is used to code the secret image to achieve security. The proposed method applies Discrete Multiwavelet Transform (DMWT) for cover image. The coded bit stream of the secret image is embedded in the high frequency subbands of the transformed cover one. A scaling factors ? and ? in frequency domain control the quality of the stego

The objective of this work is to design and implement a cryptography system that enables the sender to send message through any channel (even if this channel is insecure) and the receiver to decrypt the received message without allowing any intruder to break the system and extracting the secret information. In this work, we implement an interaction between the feedforward neural network and the stream cipher, so the secret message will be encrypted by unsupervised neural network method in addition to the first encryption process which is performed by the stream cipher method. The security of any cipher system depends on the security of the related keys (that are used by the encryption and the decryption processes) and their corresponding le

in this paper we adopted ways for detecting edges locally classical prewitt operators and modification it are adopted to perform the edge detection and comparing then with sobel opreators the study shows that using a prewitt opreators

     This paper introduces a relation between resultant and the Jacobian determinant
by generalizing Sakkalis theorem from two polynomials in two variables to the case of (n) polynomials in (n) variables. This leads us to study the results of the type:  ,            and use this relation to attack the Jacobian problem. The last section shows our contribution to proving the conjecture.