This study identified the genus Coelastrella Chodat, 1922 which was isolated from a sediment sample taken from the Tigris river in Baghdad Governorate, Iraq. The alga was isolated and cultured in modified Chu 10 media and the morphological features of the isolated algae were observed in light microscopy (LM); it showed some characteristic features of this genus, such as its ellipsoidal or lemon- shaped cells, a visible pyrenoid and the chloroplast parietal. To ensure correct identification of the isolated alga, a molecular analysis using 18S rRNA gene and DNA sequencing revealed a match with C. terrestris (Reisigl) Hedewald & N. Hanagata 2002. This species is a new record in Iraq

Porous silicon (PS) layers were formed on n-type silicon (Si) wafers using Photo- electrochemical Etching technique (PEC) was used to produce porous silicon for n-type with orientation of (111). The effects of current density were investigated at: (10, 20, 30, 40, and50) mA/cm2 with etching time: 10min. X-ray diffraction studies showed distinct variations between the fresh silicon surface and the synthesized porous silicon. The maximum crystal size of Porous Silicon is (33.9nm) and minimum is (2.6nm) The Atomic force microscopy (AFM) analysis and Field Emission Scanning Electron Microscope (FESEM) were used to study the morphology of porous silicon layer. AFM results showed that root mean square (RMS) of roughness and the grain size of p

Some transition metal ions (Cr +3, Co+2 , Ni+2,Cu+2, Zn+2,Ag + ,Cd+2 ) complexes of [(N, N- - Bis(2- hydroxy ethyl) Glycine] (Bicine) have been synthesized and characterized by FTIR ,UV-Visble spectroscopy, atomic absorption, magnetic susceptibility, conductivity measurements and study of the nature of the complexes formed in ethanolic solution following the moleratio method. From the results obtained the following general formola have been given for the prepared complexes [M m+ (Bicine)n]. XH2O

Listed

Multiplicative inverse in GF (2 m ) is a complex step in some important application such as Elliptic Curve Cryptography (ECC) and other applications. It operates by multiplying and squaring operation depending on the number of bits (m) in the field GF (2 m ). In this paper, a fast method is suggested to find inversion in GF (2 m ) using FPGA by reducing the number of multiplication operations in the Fermat's Theorem and transferring the squaring into a fast method to find exponentiation to (2 k ). In the proposed algorithm, the multiplicative inverse in GF(2 m ) is achieved by number of multiplications depending on log 2 (m) and each exponentiation is operates in a single clock cycle by generating a reduction matrix for high power of two ex