حضر الليكاند (L) 1-فنيل-3-بردين-2-يل مثيل-ثايويوريا من تفاعل 2-أمينو مثيل بردين مع فنيل ايزوثايوسيانيت وبنسبة 1: 1 وشخص الليكاند بواسطة التحليل الدقيق للعناصر (C, H, N), الأشعة تحت الحمراء، الأشعة فوق البنفسجية–المرئية وطيف الرنين النووي المغناطيسي كما حضرت وشخصت معقدات أملاح بعض ايونات العناصر الثنائية التكافؤ (Co, Ni, Cu, Cd and Hg). استخدمت تقنية الأشعة تحت الحمراء، الأشعه فوق البنفسجية-المرئية, التوصيلية الكهربائية و الامتصاصية الذرية وأستنتج من التحاليل ان المعقدات لها شكل ثماني السطوح. كما تمت دراسة الفعالية البايولوجية لليكاند ومعقداته وقد اظهرت النتائج امتلاكها فعالية متفاوته اتجاه انواع البكتريا E. coli, Staphylococcus aureus.
Abstract
These experiments seek to investigate the effects of the fixed variations to the basic box plot on subjects' judgments of the box lengths. The study consists of two experiments, were constructed as an extension to the experiments carried out previously by Hussin, M.M. (1989, 2006). Subjects were asked to judge what percentage the shorter represented of the longer length in pairs of box lengths and give an estimate of percentage, one being a standard plot and the other being of a different box length and also varying with respect to other elements such as, box width or whisker length. When he (1989) suggested in the future research points (1, 2), the changing length of the st
... Show MoreIn this work, we construct the projectively distinct (k, n)-arcs in PG (3, 4) over Galois field GF (4), where k 5, and we found that the complete (k, n)-arcs, where 3 n 21, moreover we prove geometrically that the maximum complete (k, n)-arc in PG (3, 4) is (85, 21)-arc. A (k, n)-arcs is a set of k points no n+ 1 of which are collinear. A (k, n)-arcs is complete if it is not contained in a (k+ 1, n)-arcs
Identification of complex communities in biological networks is a critical and ongoing challenge since lots of network-related problems correspond to the subgraph isomorphism problem known in the literature as NP-hard. Several optimization algorithms have been dedicated and applied to solve this problem. The main challenge regarding the application of optimization algorithms, specifically to handle large-scale complex networks, is their relatively long execution time. Thus, this paper proposes a parallel extension of the PSO algorithm to detect communities in complex biological networks. The main contribution of this study is summarized in three- fold; Firstly, a modified PSO algorithm with a local search operator is proposed
... Show MoreOur goal in this research, some new nucleoside analogues was synthesized. Starting from ?-D glucose which was converted to per acetylated ?-D gluco pyronoside then converted to active from(1-Bromo Sugar (2) as a sugar moiety.The base moiety 2-substituted benzimidazole was prepared from condensation of phenylene diamine with different aromatic aldehydes, which were subjected to amino alkylation via Mannich reaction forming new nucleobase derivatives. Condensation of nucleobase with bromo sugar through nucleophilic substitution of anomeric carbon with nitrogen forming new protected nucleoside analogues then hydrolyzed with sodium methoxide in methanol to obtain our target, the free nucleoside analogues. All prepared compound were identified b
... Show MoreFive N-substituted poly diimides were prepared by two steps. First step was included the preparation of five N-substituted diamides by reaction of adipoyl chloride with different amines .The second step was involved reaction of diamides with poly acryloyl chloride to obtain five new poly diimides having different physical properties which may used in different applications.