The aim of this paper is to present method for solving ordinary differential equations of eighth order with two point boundary conditions. We propose two-point osculatory interpolation to construct polynomial solution.

In this paper we use Bernstein polynomials for deriving the modified Simpson's 3/8 , and the composite modified Simpson's 3/8 to solve one dimensional linear Volterra integral equations of the second kind , and we find that the solution computed by this procedure is very close to exact solution.

In this paper, a subspace identification method for bilinear systems is used . Wherein a " three-block " and " four-block " subspace algorithms are used. In this algorithms the input signal to the system does not have to be white . Simulation of these algorithms shows that the " four-block " gives fast convergence and the dimensions of the matrices involved are significantly smaller so that the computational complexity is lower as a comparison with " three-block " algorithm .

There is a great deal of systems dealing with image processing that are being used and developed on a daily basis. Those systems need the deployment of some basic operations such as detecting the Regions of Interest and matching those regions, in addition to the description of their properties. Those operations play a significant role in decision making which is necessary for the next operations depending on the assigned task. In order to accomplish those tasks, various algorithms have been introduced throughout years. One of the most popular algorithms is the Scale Invariant Feature Transform (SIFT). The efficiency of this algorithm is its performance in the process of detection and property description, and that is due to the fact that

   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

The support vector machine, also known as SVM, is a type of supervised learning model that can be used for classification or regression depending on the datasets. SVM is used to classify data points by determining the best hyperplane between two or more groups. Working with enormous datasets, on the other hand, might result in a variety of issues, including inefficient accuracy and time-consuming. SVM was updated in this research by applying some non-linear kernel transformations, which are: linear, polynomial, radial basis, and multi-layer kernels. The non-linear SVM classification model was illustrated and summarized in an algorithm using kernel tricks. The proposed method was examined using three simulation datasets with different sample

In this paper, we describe the cases of marriage and divorce in the city of Baghdad on both sides of Rusafa and Karkh, we collected the data in this research from the Supreme Judicial Council and used the cubic spline interpolation method to estimate the function that passing through given points as well as the extrapolation method which was applied for estimating the cases of marriage and divorce for the next year and comparison between Rusafa and Karkh by using the MATLAB program.

Three strain of Bacillus cereus were obtained from soil sours Laboratories of Biology Department/ College of Science/ University of Baghdad. The bacteria secreted extracellular xylanase in liquid cultur the test ability of xylanase production from these isolates was studied semi quantitative and quantitative screening appeared that Bacillus cereus X3 was the highest xylanase producer. The enzyme was partial purification 191 fold from cultur by reached step by 4 U/mg proteins by ammonium sulfat precipitation 80%, Ion exchang DEAE-cellulos chromatography Characterization study of the partial purifation enzyme revealed that the enzyme had a optimum activity pH8 and activity was stable in the pH rang (8-10) for 30min. maximal activity was attai