A series of new Bis-1,4-Butane -1,3,4 – Oxadizole derivatives [III a-j] were synthesized from adipic acid dihydrazide and different aromatic acids in the presence of phosphours oxychloide. There compounds were characterized by their IR, microanalysis, and mass spectral data.    In vitro antimicrobial were synthesized. In vitro antimicrobial activity of these compounds against (Gram negative) and (Gram positive) were reported, some of these compounds prepared derivatives exhibited antimicrobial activity

    In this paper, the oscillatory and nonoscillatory qualities for every solution of fourth-order neutral delay equation are discussed. Some conditions are established to ensure that all solutions are either oscillatory or approach to zero as .  Two examples are provided to demonstrate the obtained findings.

In this paper the oscillation criterion was investigated for all solutions of the third-order half linear neutral differential equations. Some necessary and sufficient conditions are established for every solution of (a(t)[(x(t)±p(t)x(?(t) ) )^'' ]^? )^'+q(t) x^? (?(t) )=0, t?t_0, to be oscillatory. Examples are given to illustrate our main results.

The aim of this article is to solve the Volterra-Fredholm integro-differential equations of fractional order numerically by using the shifted Jacobi polynomial collocation method. The Jacobi polynomial and collocation method properties are presented. This technique is used to convert the problem into the solution of linear algebraic equations. The fractional derivatives are considered in the Caputo sense. Numerical examples are given to show the accuracy and reliability of the proposed technique.

The paper is devoted to solve nth order linear delay integro-differential equations of convolution type (DIDE's-CT) using collocation method with the aid of B-spline functions. A new algorithm with the aid of Matlab language is derived to treat numerically three types (retarded, neutral and mixed) of nth order linear DIDE's-CT using B-spline functions and Weddle rule for calculating the required integrals for these equations. Comparison between approximated and exact results has been given in test examples with suitable graphing for every example for solving three types of linear DIDE's-CT of different orders for conciliated the accuracy of the results of the proposed method.

This research interested to study the structural configuration in the square kufi script, as the kufi script is one of the oldest Arabic fonts, and this name was named according to the city of Kufa, so its types, forms, and designations were numerous, including the square kufic script, which was characterized by being a very straightforward engineering script based on the principle of squaring in building letters to form an engineering body that governs its construction of a set of organizational relationships and design bases according to an engineering structural system. The researchers identified the problem of his research with the following question: What is the Structural configuration in the square Kufic script?
Therefore, the

     The focus of this article is to add a new class of rank one of  modified Quasi-Newton techniques to solve the problem of unconstrained optimization by updating the inverse Hessian matrix with an update of rank 1, where a diagonal matrix is the first component of the next inverse Hessian approximation, The inverse Hessian matrix is  generated by the method proposed which is symmetric and it satisfies the condition of modified quasi-Newton, so the global convergence is retained. In addition, it is positive definite that  guarantees the existence of the minimizer at every iteration of the objective function. We use  the program MATLAB to solve an algorithm function to introduce the feasibility of

In this paper we investigate the use of two types of local search methods (LSM), the Simulated Annealing (SA) and Particle Swarm Optimization (PSO), to solve the problems ( ) and . The results of the two LSMs are compared with the Branch and Bound method and good heuristic methods. This work shows the good performance of SA and PSO compared with the exact and heuristic methods in terms of best solutions and CPU time.