Four metal complexes of Schi base ligand were prepared. To characterize both the ligand and the metal complexes, various techniques were employed, including elemental analysis, FT-IR spectroscopy, UV-Vis spectroscopy, molar conductivity measurements, magnetic moment determination, melting point, mass spectroscopy, 1H-NMR and 13C-NMR spectroscopy. The results showed that the metal complexes formed have the formula [M(L)2Cl2]Cl(n).H2O, where LD Schi base ligand and MDCr(III), Rh(III), Pt(IV) and Au(III), n D 1, 2. Based on spectroscopic analysis, coordination with metal ions involves the ’N’ donor atom of N atoms of the imine and the N-H amid group, and four complexes are suggested to have a six-coordinated octahedral structure. Molar c

Encryption of data is translating data to another shape or symbol which enables people only with an access to the secret key or a password that can read it. The data which are encrypted are generally referred to as cipher text, while data which are unencrypted are known plain text. Entropy can be used as a measure which gives the number of bits that are needed for coding the data of an image. As the values of pixel within an image are dispensed through further gray-levels, the entropy increases. The aim of this research is to compare between CAST-128 with proposed adaptive key and RSA encryption methods for video frames to determine the more accurate method with highest entropy. The first method is achieved by applying the "CAST-128" and

This research includes the study of dual data models with mixed random parameters, which contain two types of parameters, the first is random and the other is fixed. For the random parameter, it is obtained as a result of differences in the marginal tendencies of the cross sections, and for the fixed parameter, it is obtained as a result of differences in fixed limits, and random errors for each section. Accidental bearing the characteristic of heterogeneity of variance in addition to the presence of serial correlation of the first degree, and the main objective in this research is the use of efficient methods commensurate with the paired data in the case of small samples, and to achieve this goal, the feasible general least squa

Shadow detection and removal is an important task when dealing with color outdoor images. Shadows are generated by a local and relative absence of light. Shadows are, first of all, a local decrease in the amount of light that reaches a surface. Secondly, they are a local change in the amount of light rejected by a surface toward the observer. Most shadow detection and segmentation methods are based on image analysis. However, some factors will affect the detection result due to the complexity of the circumstances. In this paper a method of segmentation test present to detect shadows from an image and a function concept is used to remove the shadow from an image.

ArcHydro is a model developed for building hydrologic information systems to synthesize geospatial and temporal water resources data that support hydrologic modeling and analysis. Raster-based digital elevation models (DEMs) play an important role in distributed hydrologic modeling supported by geographic information systems (GIS). Digital Elevation Model (DEM) data have been used to derive hydrological features, which serve as inputs to various models. Currently, elevation data are available from several major sources and at different spatial resolutions. Detailed delineation of drainage networks is the first step for many natural resource management studies. Compared with interpretation from aerial photographs or topographic maps, auto

Let G be a graph with p vertices and q edges and  be an injective function, where k is a positive integer. If the induced edge labeling   defined by for each is a bijection, then the labeling f is called an odd Fibonacci edge irregular labeling of G. A graph which admits an odd Fibonacci edge irregular labeling is called an odd Fibonacci edge irregular graph. The odd Fibonacci edge irregularity strength ofes(G) is the minimum k for which G admits an odd Fibonacci edge irregular labeling. In this paper, the odd Fibonacci edge irregularity strength for some subdivision graphs and graphs obtained from vertex identification is determined.