The current study is a taxonomic account of three gastrotrich species that belong to Chaetonotidae (Phylum Gastrotricha) namely Ichthydium auritum Brunson, 1950 Lepidodermella squamata (Dujardin, 1841) and Chaetonotus anomalus Brunson, 1950. These species are registered as a new record from Iraq and were collected from several locations along the main outfall drain (MOD) in south of Baghdad, from January to December 2020. The species described in this article were found to be related to Hydrilla and Ceratophyllum and prefer environments rich in detritus and decomposing organic matter. The worms preferred water that is salty, hard, alkaline, and had good oxygen content.

This research work aims to the determination of molybdenum (VI) ion via the formation of peroxy molybdenum compounds which has red-brown colour with absorbance wave length at 455nm for the system of ammonia solution-hydrogen peroxide-molybdenum (VI) using a completely newly developed microphotometer based on the ON-Line measurement. Variation of responses expressed in millivolt. A correlation coefficient of 0.9925 for the range of 2.5-150 ?g.ml-1 with percentage linearity of 98.50%. A detection limit of 0.25 ?g.ml-1 was obtained. All physical and chemical variable were optimized interferences of cation and anion were studied classical method of measurement were done and compared well with newly on-line measurements. Application for the use

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.