Newly series of 6,6’-((2-(Aryl)dihydropyrimidine-1,3(2H,4H)-diyl)bis(methylene))bis(2-methoxy phenol) (3a-i) were synthesized from cyclization of 6,6’-((propane-1,3-diylbis (azanediyl)) bis(methylene)) bis(2-methoxyphenol) with several aryl aldehyde in the presence of acetic acid. The newly compounds characterized from their IR, NMR and EIMs spectra. The antioxidant capacity of these compounds screened by utilizing DPPH and FRAP assays. Compounds 3g and 3i exhibited significant antioxidant capability in both assays. Docking study for these compounds as a potential inhibitors of gyrase enzyme were carried out. Compound 3g exhibited significant inhibition with binding free energies (DG) higher than novobiocin. compounds 2, 3a, 3b, 3

In this paper, we present new algorithm for the solution of the nonlinear high order multi-point boundary value problem with suitable multi boundary conditions. The algorithm is based on the semi-analytic technique and the solutions are calculated in the form of a rapid convergent series. It is observed that the method gives more realistic series solution that converges very rapidly in physical problems. Illustrative examples are provided to demonstrate the efficiency and simplicity of the proposed method in solving this type of multi- point boundary value problems.

In this research is estimated the function of reliability dynamic of multi state systems  and their compounds and for three types of systems (serial, parallel, 2-out-of-3) and about two states (Failure and repair) depending on calculating the structur function allow to describing the behavior of

The k-out-of-n:G (or k/n:G) system structure is a very popular of redundancy in
fault-tolerant systems, with wide applications in so many fields. This paper presents
two states of multi-state k/n:G systems. The first part, we present the definition that
introduced by Al-Neweihi et al [1], where the values are the same with respect
to all system states and we show that there exists an alternative equivalent definition
to Al-Neweihi's definition. In the second part of this paper we give more general
definition proposed by Huang et al [2], where it allows different values with
respect to different system states and we provide there exists an equivalent definition
to Huang's definition when the values are increasing.

The physicochemical properties of drinking water in six different and limited sites on  Euphrates River in Babylon governorate were studied during the year of2004.

Different parameters including (pH), alkalinity, turbidity, total hardness, magnesium, calcium, chloride and total dissolved solids in water were determined. It was found that the total hardness and the total dissolved solids were higher than those registered in the previous studies on Tigris

River sites.

Generally, the levels of these parameters were found to be within the

allowed ranges of human uses, except the total hard:1ess.

Digital image manipulation has become increasingly prevalent due to the widespread availability of sophisticated image editing tools. In copy-move forgery, a portion of an image is copied and pasted into another area within the same image. The proposed methodology begins with extracting the image's Local Binary Pattern (LBP) algorithm features. Two main statistical functions, Stander Deviation (STD) and Angler Second Moment (ASM), are computed for each LBP feature, capturing additional statistical information about the local textures. Next, a multi-level LBP feature selection is applied to select the most relevant features. This process involves performing LBP computation at multiple scales or levels, capturing textures at different

   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