In this work, the fractional damped Burger's equation (FDBE) formula    = 0,

 The aim of this paper is to present a semi - analytic technique for solving singular initial value problems of ordinary differential equations with a singularity of different kinds to construct polynomial solution using two point  osculatory  interpolation.           The efficiency and accuracy of suggested method is assessed by comparisons with exact and other approximate solutions for a wide classes of non–homogeneous, non–linear singular initial value problems.             A new, efficient estimate of the global error is used for adaptive mesh selection. Also, analyze some of the numerical aspects

The aim of this paper is to prove some results for equivalence of moduli of smoothnes in approximation theory , we used a"non uniform" modulus of smoothness and the weighted Ditzian –Totik moduli of smoothness in by spline functions ,several results are obtained .For example , it shown that ,for any the inequality , is satisfied ,finally, similar result for chebyshev partition and weighted Ditzian –Totik moduli of smoothness are also obtained.

The aim of this paper is to propose a reliable iterative method for resolving many types of Volterra - Fredholm Integro - Differential Equations of the second kind with initial conditions. The series solutions of the problems under consideration are obtained by means of the iterative method. Four various problems are resolved with high accuracy to make evident the enforcement of the iterative method on such type of integro differential equations. Results were compared with the exact solution which exhibits that this technique was compatible with the right solutions, simple, effective and easy for solving such problems. To evaluate the results in an iterative process the MATLAB is used as a math program for the calculations.

In this research two algorithms are applied, the first is Fuzzy C Means (FCM) algorithm and the second is hard K means (HKM) algorithm to know which of them is better than the others these two algorithms are applied on a set of data collected  from the Ministry of Planning on the water turbidity of five areas in Baghdad to know which of these areas are less turbid in clear water to see which months during the year are less turbid in clear water in the specified area.

In this paper, a fast lossless image compression method is introduced for compressing medical images, it is based on splitting the image blocks according to its nature along with using the polynomial approximation to decompose image signal followed by applying run length coding on the residue part of the image, which represents the error caused by applying polynomial approximation. Then, Huffman coding is applied as a last stage to encode the polynomial coefficients and run length coding. The test results indicate that the suggested method can lead to promising performance.

A watermark is a pattern or image defined in a paper that seems as different shades of light/darkness when viewed by the transmitted light which used for improving the robustness and security. There are many ways to work Watermark, including the addition of an image or text to the original image, but in this paper was proposed another type of watermark is add curves, line or forms have been drawn by interpolation, which produces watermark difficult to falsify and manipulate it. Our work suggests new techniques of watermark images which is embedding Cubic-spline interpolation inside the image using Bit Plane Slicing. The Peak to Signal Noise Ratio (PSNR) and Mean Square Error (MSE) value is calculated so that the quality of the original i

The aims of the paper are to present a modified symmetric fuzzy approach to find the best workable compromise solution for quadratic fractional programming problems (QFPP) with fuzzy crisp in both the objective functions and the constraints. We introduced a modified symmetric fuzzy by proposing a procedure, that starts first by converting the quadratic fractional programming problems that exist in the objective functions to crisp numbers and then converts the linear function that exists in the constraints to crisp numbers. After that, we applied the fuzzy approach to determine the optimal solution for our quadratic fractional programming problem which is supported theoretically and practically. The computer application for the algo