A new heterocyclic Schiff bases ligand (HL) derived from condensation of 2-Amino-4-methylbenzothiazole with 4-Diethylaminosalicylaldehyde have been synthesized and characterized by (FTIR & UV.Vis) spectroscopies, (¹H & ¹³C)NMR spectra, mass spectrum, elemental microanalysis (C,H,N,S). Metal complexes with Co(II), Ni(II), Cu(II), Zn(II) and Cd(II) ions have been also synthesized and characterized by (FTIR & UV.Vis) spectroscopies, flame atomic absorption, molar conductivity measurements and magnetic susceptibility. These studies indicate that the mole ratio (L:M) is (2:1) for Co(II) complex and (1:1) for other complexes. The spectral results indicate that the ligand coordinates with met

  In this work, nanostructured TiO2 thin films were grown by pulsed laser deposition (PLD) technique on glass substrates. TiO2 thin films then were annealed at 400-600 °C in air for a period of 2 hours. Effect of annealing on the structural and morphological were studied. Many growth parameters have been considered to specify the optimum conditions, namely substrate temperature (300 °C), oxygen pressure (10-2 Torr), laser fluence energy density (0.4 J/cm2), using double frequency Q-switching Nd:YAG laser beam (wavelength 532nm), repetition rate  (1-6 Hz) and the pulse duration of 10 ns. The results of the X-ray test show that all nanostructures tetragonal are polycrystalline. These results show that grain size increase fr

Complexes of Au (III), Pd (II), Pt (IV ) and Rh(III) with S–propynyle-2- thiobenzimidazole (BENZA) have been prepared and characterized by IR and UV- Visible spectral methods in addition to magnetic and conductivity measurements and micro–elemental analysis (CHN).The probable structures of the new complexes have been suggested.

A coin has two sides. Steganography although conceals the existence of a message but is not completely secure. It is not meant to supersede cryptography but to supplement it. The main goal of this method is to minimize the number of LSBs that are changed when substituting them with the bits of characters in the secret message. This will lead to decrease the distortion (noise) that is occurred in the pixels of the stego-image and as a result increase the immunity of the stego-image against the visual attack. The experiment shows that the proposed method gives good enhancement to the steganoraphy technique and there is no difference between the cover-image and the stego-image that can be seen by the human vision system (HVS), so this method c

Interval methods for verified integration of initial value problems (IVPs) for ODEs have been used for more than 40 years. For many classes of IVPs, these methods have the ability to compute guaranteed error bounds for the flow of an ODE, where traditional methods provide only approximations to a solution. Overestimation, however, is a potential drawback of verified methods. For some problems, the computed error bounds become overly pessimistic, or integration even breaks down. The dependency problem and the wrapping effect are particular sources of overestimations in interval computations. Berz (see [1]) and his co-workers have developed Taylor model methods, which extend interval arithmetic with symbolic computations. The latter is an ef

A loS.sless (reversible) data hiding (embedding) method  inside  an image  (translating medium)  - presented   in  the  present  work  using  L_SB (least  significant  bit). technique  which  enables  us to translate   data  using an  image  (host  image),  using  a  secret  key, to  be  undetectable  without losing  any  data  or  without   changing   the  size  and  the  external   scene (visible  properties) of the image, the hid-ing data is then can  be extracted (without  losing)   by reversing &n

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 .