A new ligand complexes have been synthesis from reaction of metal ions of Mn(II), Co(II), Ni(II), Cu(II), Zn(II), Cd(II), Hg(II), Pd(II) and Pt(II) with schiff base LH. 5-[(2-Hydroxy-naphthalen-1-ylmethylene)-amino]-2-phenyl-2,4-dihydro-pyrazol-3-one, this ligand was characterized by Fourier transform infrared (FTIR), UV-vis, 1H, 13CNMR, and mass spectra. All complexes were characterized by techniques micro analysis C.H.N, UV-vis and FTIR spectral studies, atomic absorption, chloride content, molar conductivity measurements and magnetic susceptibility. The ligand acts as bidentate, coordination through nitrogen atom from azomethin group and deprotonated phenolic oxygen atom. The spectroscopic and analytical measurements showed that

اثناء تفاعل الديزنة تكونت صبغة أزو جديدة عن طريق تفاعل 3-امينوفينول مع 2,4,6-ثلاثي هيدروكسي اسيتوفينون . ثم تم تفاعل هذا الليكاند مع بعض ايونات العناصر الكروم والحديد الروديوم والروثينيوم بتكفؤهم الثلاثي والكوبلت الثنائي والموليبدينوم سداسي التكافؤ مكونة معقدات فلزية مختلفة بأشكال هندسية متعددة. تم ملاحظة تناسق مجموعة الازو مع ايونات العناصر من خلال ملاحظة ظهور حزم امتصاص الفلز مع النتروجين والاوكسجين ب

In this study azo dye was prepared by the reaction of m-phenylendidiazonium chloride with methyl salicylate, the resultant compound was used as a ligand for complex formation with Fe+2, Cu+2, Zn+2, Ni+2 and Co+2 ions. The prepared ligand was characterized by H1NMR, UV-Vis., And FTIR spectroscopy, CHN analysis, in addition the complexes were characterized by TGA, UV-Vis., FTIR and conductivity methods. The results indicate that the ligand chelated through phenoxy and carboxyl groups as a O4 quadra dentate ligand, the Co complex complet its hexagon coordination by bonding with chlorine and the complex wouid be electrolytic in opposite with rest complexes.

Multipoint forming process is an engineering concept which means that the working surface of the punch and die is produced as hemispherical ends of individual active elements (called pins), where each pin can be independently, vertically displaced using a geometrically reconfigurable die. Several different products can be made without changing tools saved precious production time. Also, the manufacturing of very expensive rigid dies is reduced, and a lot of expenses are saved. But the most important aspects of using such types of equipment are the flexibility of the tooling. This paper presents an experimental investigation of the effect of three main parameters which are blank holder, rubber thickness and forming speed th

conventional FCM algorithm does not fully utilize the spatial information in the image. In this research, we use a FCM algorithm that incorporates spatial information into the membership function for clustering. The spatial function is the summation of the membership functions in the neighborhood of each pixel under consideration. The advantages of the method are that it is less
sensitive to noise than other techniques, and it yields regions more homogeneous than those of other methods. This technique is a powerful method for noisy image segmentation. 

Root-finding is an oldest classical problem, which is still an important research topic, due to its impact on computational algebra and geometry. In communications systems, when the impulse response of the channel is minimum phase the state of equalization algorithm is reduced and the spectral efficiency will improved. To make the channel impulse response minimum phase the prefilter which is called minimum phase filter is used, the adaptation of the minimum phase filter need root finding algorithm. In this paper, the VHDL implementation of the root finding algorithm introduced by Clark and Hau is introduced.
VHDL program is used in the work, to find the roots of two channels and make them minimum phase, the obtained output results are

This paper investigates the capacitated vehicle routing problem (CVRP) as it is one of the numerous issues that have no impeccable solutions yet. Numerous scientists in the recent couple of decades have set up various explores and utilized numerous strategies with various methods to deal with it. However, for all researches, finding the least cost is exceptionally complicated. In any case, they have figured out how to think of rough solutions that vary in efficiencies relying upon the search space. Furthermore, tabu search (TS) is utilized to resolve this issue as it is fit for solving numerous complicated issues. The algorithm has been adjusted to resolve the exploration issue, where its methodology is not quite the same as the normal a

In this paper, a modified derivation has been introduced to analyze the construction of C-space. The profit from using C-space is to make the process of path planning more safety and easer. After getting the C-space construction and map for two-link planar robot arm, which include all the possible situations of collision between robot parts and obstacle(s), the A* algorithm, which is usually used to find a heuristic path on Cartesian W-space, has been used to find a heuristic path on C-space map. Several modifications are needed to apply the methodology for a manipulator with degrees of freedom more than two. The results of C-space map, which are derived by the modified analysis, prove the accuracy of the overall C-space mapping and cons