The main aim of this paper is to apply a new technique suggested by Temimi and Ansari namely (TAM) for solving higher order Integro-Differential Equations. These equations are commonly hard to handle analytically so it is request numerical methods to get an efficient approximate solution. Series solutions of the problem under consideration are presented by means of the Iterative Method (IM). The numerical results show that the method is effective, accurate and easy to implement rapidly convergent series to the exact solution with minimum amount of computation. The MATLAB is used as a software for the calculations.           

Graphite nanoparticles were successfully synthesized using mixture of H2O2/NH4OH with three steps of oxidation. The process of oxidations were analysis by XRD and optics microscopic images which shows clear change in particle size of graphite after every steps of oxidation. The method depend on treatments the graphite with H2O2 in two steps than complete the last steps by reacting with H2O2/NH4OH with equal quantities. The process did not reduces the several sheets for graphite but dispersion the aggregates of multi-sheets carbon when removed the Van Der Waals forces through the oxidation process.

An efficient combination of Adomian Decomposition iterative technique coupled Elzaki transformation (ETADM) for solving Telegraph equation and Riccati non-linear differential equation (RNDE) is introduced in a novel way to get an accurate analytical solution. An elegant combination of the Elzaki transform, the series expansion method, and the Adomian polynomial. The suggested method will convert differential equations into iterative algebraic equations, thus reducing processing and analytical work. The technique solves the problem of calculating the Adomian polynomials. The method’s efficiency was investigated using some numerical instances, and the findings demonstrate that it is easier to use than many other numerical procedures. It has

NiO nanoparticle synthesis by chemical method and characterized by XRD with crystal size 11.72
nm and grain size 13 nm from FESEM image also NiO micro used ,two NiO as an additive to evaluate the
possibility of producing photodegradable polymers, the practical application of solid-phase photocatalytic
degradation of polyvinyl chloride (PVC- NiO composite films) was investigated. PVC has a negative impact
on the environment since its polymer degrades slowly, yet it has a wide range of industrial applications and
the amount used shows no evidence of diminishing use. Thus, a synthesis of modified PVC- NiO micro and
nano has been studied with 0, 50, 100, 150, 200, 250, and 300 (hours) as irradiation time a

A vector in a separable infinite dimensional Hilbert space is called disk-cyclic for bounded operator if the orbit α : 0, α∈;|∝| 1is dense in. The useful tool used to discover codisk-cyclic operation is called the disk-cyclic Criterion. In this paper we will show that some equivalent conditions of the

      The detection of diseases affecting plant is very important as it relates to the issue of food security, which is a very serious threat to human life. The system of diagnosis of diseases involves a series of steps starting with the acquisition of images through the pre-processing, segmentation and then features extraction that is our subject finally the process of classification. Features extraction is a very important process in any diagnostic system where we can compare this stage to the spine in this type of system. It is known that the reason behind this great importance of this stage is that the process of extracting features greatly affects the work and accuracy of classification. Proper selection of

The traveling salesman problem (TSP) is a well-known and important combinatorial optimization problem. The goal is to find the shortest tour that visits each city in a given list exactly once and then returns to the starting city. In this paper we exploit the TSP to evaluate the minimum total cost (distance or time) for Iraqi cities. So two main methods are investigated to solve this problem; these methods are; Dynamic Programming (DP) and Branch and Bound Technique (BABT). For the BABT, more than one lower and upper bounds are be derived to gain the best one. The results of BABT are completely identical to DP, with less time for number of cities (n), 5 ≤ n ≤ 25. These results proof the efficiency of BABT compared with so