A simple analytical method was used in the present work for the simultaneous quantification of Ciprofloxacin and Isoniazid in pharmaceutical preparations. UV-Visible spectrophotometry has been applied to quantify these compounds in pure and mixture solutions using the first-order derivative method. The method depends on the first derivative spectrophotometry using zero-cross, peak to baseline, peak to peak and peak area measurements. Good linearity was shown in the concentration range of 2 to 24 μg∙mL-1 for Ciprofloxacin and 2 to 22 μg∙mL-1 for Isoniazid in the mixture, and the correlation coefficients were 0.9990 and 0.9989 respectively using peak area mode. The limits of detection (LOD) and limits of quantification (LOQ) wer

The reaction of starting materials (L-asCl2):bis[O,O-2,3;O,O-5,6-(chloro(carboxylic) methylidene)]- -L-ascorbic acid] with glycine gives new product bis[O,O-2,3,O,O-5,6-(N,O-di carboxylic methylidene N-glycine)-L-ascorbic acid] (L-as-gly) which is isolated and characterized by, Mass spectrum UV-visible and Fourier transform infrared spectrophotometer (FT-IR) . The reaction of the (L-as-gly) with M+2; Co(II) Ni(II) Cu(II) and Zn(II) has been characterized by FT- IR , Uv-Visible , electrical conductivity, magnetic susceptibility methods and atomic absorption and molar ratio . The analysis showed that the ligand coordinate with metal ions through mono dentate carboxylic resulting in six-coordinated with Co(II) Ni(II) Cu(II) ions while with

The techniques of fractional calculus are applied successfully in many branches of science and engineering, one of the techniques is the Elzaki Adomian decomposition method (EADM), which researchers did not study with the fractional derivative of Caputo Fabrizio. This work aims to study the Elzaki Adomian decomposition method (EADM) to solve fractional differential equations with the Caputo-Fabrizio derivative. We presented the algorithm of this method with the CF operator and discussed its convergence by using the method of the Cauchy series then, the method has applied to solve Burger, heat-like, and, couped Burger equations with the Caputo -Fabrizio operator. To conclude the method was convergent and effective for solving this type of

We study in this paper the composition operator that is induced by ?(z) = sz + t. We give a characterization of the adjoint of composiotion operators generated by self-maps of the unit ball of form ?(z) = sz + t for which |s|?1, |t|<1 and |s|+|t|?1. In fact we prove that the adjoint is a product of toeplitz operators and composition operator. Also, we have studied the compactness of C? and give some other partial results.

Abstract
The research aims to build a training program to develop some executive functions for kindergarten children. To achieve this goal, the two researchers built the program according to the following steps:
1. Determining the general objective of the program.
2. Determining the behavioral objectives of the program.
3. Determining the included content in the program.
4. Implementing the content of the activities of the program.
5. Evaluating the Program.
The program included (12) training activities, the training activities included several items: the title of the activity, the time of implementation of the activity, the general objective of the activity, the procedural behavioral objective, the means and tools u

      Faintly continuous (FC) functions, entitled faintly S-continuous and faintly δS-continuous functions have been introduced and investigated via a -open and -open sets. Several characterizations and properties of faintly S-continuous and faintly -Continuous functions were obtained. In addition, relationships between faintly s- Continuous and faintly S-continuous function and other forms of FC function were investigated. Also, it is shown that every faintly  S-continuous is weakly S-continuous. The Convers is shown to be satisfied only if the co-domain of the function is almost regular.

The aim of this paper is to approximate multidimensional functions f∈C(R^s) by developing a new type of Feedforward neural networks (FFNS) which we called it Greedy ridge function neural networks (GRGFNNS). Also, we introduce a modification to the greedy algorithm which is used to train the greedy ridge function neural networks. An error bound are introduced in Sobolov space. Finally, a comparison was made between the three algorithms (modified greedy algorithm, Backpropagation algorithm and the result in [1]).