The syntheses, characterizations and structures of three novel dichloro(bis{2-[1-(4-methoxyphenyl)-1H-1,2,3-triazol-4-yl-κN3]pyridine-κN})metal(II), [M(L)2Cl2], complexes (metal = Mn, Co and Ni) are presented. In the solid state the molecules are arranged in infinite hydrogen-bonded 3D supramolecular structures, further stabilized by weak intermolecular π…π interactions. The DFT results for all the different spin states and isomers of dichloro(bis{2-[1-phenyl-1H-1,2,3-triazol-4-yl-κN3]pyridine-κN})metal(II) complexes, [M(L1)2Cl2], support experimental measurements, namely that (i) d5 [Mn(L1)2Cl2] is high spin with S = 5/2; (ii) d7 [Co(L1)2Cl2] has a spin state of S = 3/2, (iii) d8 [Ni(L1)2Cl2] has a spin state of S =

new six mixed ligand complexes of some transition metal ions Manganese (II), Cobalt(II), Iron (II), Nickel (II) , and non transition metal ion zinc (II) And Cadmium(II) with L-valine (Val H ) as a primary ligand and Saccharin (HSac) as a secondary ligands have been prepared. All the prepared complexes have been characterized by molar conductance, magnetic susceptibility infrared, electronic spectral, Elemental microanalysis (C.H.N) and AA . The complexes with the formulas [M(Val)2(HSac)2] M= Mn (II) , Fe (II) , Co(II) ,Ni(II), Cu (II),Zn(II) and Cd(II) L- Val H= (C5H11NO2) , C7H5NO3S The study shows that these complexes have octahedral geometry; The metal complexes have been screened for their in microbiological activities against bacteria.

يهدف البحث الحالي التعرف على اسناتيجية هرم الافضلية في تحصيل طلاب الصف الثاني المتةسط لمادة الكيمياء ولتحقيق هدف البحث تم اتباع الننهج شبه التجريبي ذو الضبط الجزئي وتم تحديد مجتمع البحث بطلاب الصف الثاني في جميع المدارس المتوسطة والثانوية التابعة لمديرية تربية بابل قسم تربية المسيب

توظيف القوة الناعمة في تنفيذ السياسة الخارجية الفرنسية اتجاه المنطقة العربية بعد 2017م

   The main focus of this research is to examine the Travelling Salesman Problem (TSP) and the methods used to solve this problem where this problem is considered as one of the combinatorial optimization problems which met wide publicity and attention from the researches for to it's simple formulation and important applications and engagement to the rest of combinatorial problems , which is based on finding the optimal path through known number of cities where the salesman visits each city only once before returning to the city of departure n this research , the benefits  of( FMOLP)   algorithm is employed as one of the best methods to solve the (TSP) problem and the application of the algorithm in conjun