The Ligand 6,6--(1,2-benzenediazo) bis (3-aminobenzoicacid) derived from o-phenylenediamine and 3-aminobenzoicacid was synthesized. The prepared ligand was identified by Microelemental Analysis, 1HNMR, FT-IR and UV-Vis spectroscopic techniques. Treatment of the ligand with the following metal ions (CoII, NiII, CuII and ZnII ) in aqueous ethanol with a 1:1 M:L ratio and at optimum pH. Characterization of these compounds has been done on the basis of elemental analysis, electronic data, FT-IR and UV-Vis, as well as magnetic susceptibility and conductivity measurements. The nature of the complexes formed were studied following the mole ratio and continuous variation methods, Beer's law obeyed over a concentration range (1×10-4 - 3×10-4 M). H

In this research, the performance of asphalt mixtures modified with polyethylene polymer (PE) by adding 2%, 4%, and 6% percentages was evaluated. Two kinds of PE are employed: Low-Density PE (LDPE) and High-Density PE (HDPE). The semi-wet mixing technique (SWM) was conducted to avoid stability issue for PE-modified binder during storage condition. Many experimental tests were conducted to evaluate the ability of these mixtures to withstand the effects of loads and moisture. The hardness index of these mixtures was also measured to determine their resistance to the effects of high temperatures without causing permanent deformations. The results showed that adding PE led to a remarkable enhancement in the performance of PE-modified mixtures.

This work aims to develop a secure lightweight cipher algorithm for constrained devices. A secure communication among constrained devices is a critical issue during the data transmission from the client to the server devices. Lightweight cipher algorithms are defined as a secure solution for constrained devices that require low computational functions and small memory. In contrast, most lightweight algorithms suffer from the trade-off between complexity and speed in order to produce robust cipher algorithm. The PRESENT cipher has been successfully experimented on as a lightweight cryptography algorithm, which transcends other ciphers in terms of its computational processing that required low complexity operations. The mathematical model of

This paper contains an equivalent statements of a pre-  space, where  are considered subsets of with the product topology. An equivalence relation between the preclosed set  and a pre-  space, and a relation between a pre-  space and the preclosed set  with some conditions on a function  are found. In addition, we have proved that the graph  of  is preclosed in if  is a pre-  space, where the equivalence relation  on  is open.

     On the other hand, we introduce the definition of a pre-stable ( pre-stable) set by depending on the concept of a pre-neighborhood, where we get that every stable set is pre-stable. Moreover, we obtain that