A new derivatives of Schiff bases connected with 5H-thiazolo[3,4-b][1,3,4]thiadiazole ring 5a-c were prepared via many reactions starting by treating 1,4-phenylene diamine 1 with chloroacetylchloride to prepared compound 2, then reaction with p-hydroxybenzaldehyde to synthesize compound 3 then, this was reacted with thioglycolic acid and thiosemicarazide to giveN,N-(1.4-phenylene)bis(2-(4-(2-amino-5Hthiazolo[4,3-b][1,3,4]thiadiazol-5-yl)phenoxy)acetamide) 4. Compound 4 was treated with different aromatic aldehydes to give a new derivatives of Schiff bases containing 5H-thiazolo[3,4-b][1,3,4]thiadiazole ring 5a-c. The synthesized compounds were characterized using FTIR spectrophotometer and 1H NMR spectroscopy and the biological activity of

Acid treatment is a widely used stimulation technique in the petroleum industry. Matrix acidizing is regarded as an effective and efficient acidizing technique for carbonate formations that leads to increase the fracture propagation, repair formation damage, and increase the permeability of carbonate rocks. Generally, the injected acid dissolves into the rock minerals and generates wormholes that modify the rock structure and enhance hydrocarbon production. However, one of the key issues is the associated degradation in the mechanical properties of carbonate rocks caused by the generated wormholes, which may significantly reduce the elastic properties and hardness of rocks. There have been several experimental and simulation studies regardi

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