Four Co(II), (C1); Ni(II), (C2); Cu(II), (C3) and Zn(II), (C4) chelates have been synthesized with 1-(4-((2-amino- 5‑methoxy)diazenyl)phenyl)ethanone ligand (L). The produced compounds have been identified by using spectral studies, elemental analysis (C.H.N.O), conductivity and magnetic properties. The produced metal chelates were studied using molar ratio as well as sequences contrast types. Rate of concentration (1 ×10􀀀 4 - 3 ×10􀀀 4 Mol/L) sequence Beer’s law. Compound solutions have been noticed height molar absorptivity. The free of ligand and metal chelates had been applied as disperse dyes on cotton fabrics. Furthermore, the antibacterial activity of the produced compounds against various bacteria had been investigated. F

Four Co(II), (C1); Ni(II), (C2); Cu(II), (C3) and Zn(II), (C4) chelates have been synthesized with 1-(4-((2-amino- 5‑methoxy)diazenyl)phenyl)ethanone ligand (L). The produced compounds have been identified by using spectral studies, elemental analysis (C.H.N.O), conductivity and magnetic properties. The produced metal chelates were studied using molar ratio as well as sequences contrast types. Rate of concentration (1 ×10􀀀 4 - 3 ×10􀀀 4 Mol/L) sequence Beer’s law. Compound solutions have been noticed height molar absorptivity. The free of ligand and metal chelates had been applied as disperse dyes on cotton fabrics. Furthermore, the antibacterial activity of the produced compounds against various bacteria had been investigated. F

The researcher [1-10] proposed a method for computing the numerical solution to quasi-linear parabolic p.d.e.s using a Chebyshev method. The purpose of this paper is to extend the method to problems with mixed boundary conditions. An error analysis for the linear problem is given and a global element Chebyshev method is described. A comparison of various chebyshev methods is made by applying them to two-point eigenproblems. It is shown by analysis and numerical examples that the approach used to derive the generalized Chebyshev method is comparable, in terms of the accuracy obtained, with existing Chebyshev methods.

This paper presents a hybrid genetic algorithm (hGA) for optimizing the maximum likelihood function ln(L(phi(1),theta(1)))of the mixed model ARMA(1,1). The presented hybrid genetic algorithm (hGA) couples two processes: the canonical genetic algorithm (cGA) composed of three main steps: selection, local recombination and mutation, with the local search algorithm represent by steepest descent algorithm (sDA) which is defined by three basic parameters: frequency, probability, and number of local search iterations. The experimental design is based on simulating the cGA, hGA, and sDA algorithms with different values of model parameters, and sample size(n). The study contains comparison among these algorithms depending on MSE value. One can conc

One of the most Interesting natural phenomena is clouds that have a very strong effect on the climate, weather and the earth's energy balance. Also clouds consider the key regulator for the average temperature of the plant. In this research monitoring and studying the cloud cover to know the clouds types and whether they are rainy or not rainy using visible and infrared satellite images. In order to interpret and know the types of the clouds visually without using any techniques, by comparing between the brightness and the shape of clouds in the same area for both the visible and infrared satellite images, where the differences in the contrasts of visible image are the albedo differences, while in the infrared images is the temperature d

Discrete Krawtchouk polynomials are widely utilized in different fields for their remarkable characteristics, specifically, the localization property. Discrete orthogonal moments are utilized as a feature descriptor for images and video frames in computer vision applications. In this paper, we present a new method for computing discrete Krawtchouk polynomial coefficients swiftly and efficiently. The presented method proposes a new initial value that does not tend to be zero as the polynomial size increases. In addition, a combination of the existing recurrence relations is presented which are in the n- and x-directions. The utilized recurrence relations are developed to reduce the computational cost. The proposed method computes app