The aim of this paper is to present a method for solving high order ordinary differential equations with two point's boundary condition, we propose semi-analytic technique using two-point oscillatory interpolation to construct polynomial solution. The original problem is concerned using two-point oscillatory interpolation with the fit equal numbers of derivatives at the end points of an interval [0 , 1] . Also, many examples are presented to demonstrate the applicability, accuracy and efficiency of the method by comparing with conventional methods.

  The aim of this paper is to present a method for solving high order ordinary differential equations with two point's boundary condition, we propose semi-analytic technique using two-point oscillatory interpolation to construct polynomial solution. The original problem is concerned using two-point oscillatory interpolation with the fit equal numbers of derivatives at the end points of an interval [0 , 1] .  Also, many examples are presented to demonstrate the applicability, accuracy and efficiency of the method by comparing with conventional methods.

We study the physics of flow due to the interaction between a viscous dipole and boundaries that permit slip. This includes partial and free slip, and interactions near corners. The problem is investigated by using a two relaxation time lattice Boltzmann equation with moment-based boundary conditions. Navier-slip conditions, which involve gradients of the velocity, are formulated and applied locally. The implementation of free-slip conditions with the moment-based approach is discussed. Collision angles of 0°, 30°, and 45° are investigated. Stable simulations are shown for Reynolds numbers between 625 and 10 000 and various slip lengths. Vorticity generation on the wall is shown to be affected by slip length, angle of incidence,

The role of the ABC system in determining the costs of services in Iraqi banks

In this paper, we will present proposed enhance process of image compression by using RLE algorithm. This proposed yield to decrease the size of compressing image, but the original method used primarily for compressing a binary images [1].Which will yield increasing the size of an original image mostly when used for color images. The test of an enhanced algorithm is performed on sample consists of ten BMP 24-bit true color images, building an application by using visual basic 6.0 to show the size after and before compression process and computing the compression ratio for RLE and for the enhanced RLE algorithm

To maintain the security and integrity of data, with the growth of the Internet and the increasing prevalence of transmission channels, it is necessary to strengthen security and develop several algorithms. The substitution scheme is the Playfair cipher. The traditional Playfair scheme uses a small 5*5 matrix containing only uppercase letters, making it vulnerable to hackers and cryptanalysis. In this study, a new encryption and decryption approach is proposed to enhance the resistance of the Playfair cipher. For this purpose, the development of symmetric cryptography based on shared secrets is desired. The proposed Playfair method uses a 5*5 keyword matrix for English and a 6*6 keyword matrix for Arabic to encrypt the alphabets of

In this paper, a method for hiding cipher text in an image file is introduced . The
proposed method is to hide the cipher text message in the frequency domain of the image.
This method contained two phases: the first is embedding phase and the second is extraction
phase. In the embedding phase the image is transformed from time domain to frequency
domain using discrete wavelet decomposition technique (Haar). The text message encrypted
using RSA algorithm; then Least Significant Bit (LSB) algorithm used to hide secret message
in high frequency. The proposed method is tested in different images and showed success in
hiding information according to the Peak Signal to Noise Ratio (PSNR) measure of the the
original ima

In this study, a fast block matching search algorithm based on blocks' descriptors and multilevel blocks filtering is introduced. The used descriptors are the mean and a set of centralized low order moments. Hierarchal filtering and MAE similarity measure were adopted to nominate the best similar blocks lay within the pool of neighbor blocks. As next step to blocks nomination the similarity of the mean and moments is used to classify the nominated blocks and put them in one of three sub-pools, each one represents certain nomination priority level (i.e., most, less & least level). The main reason of the introducing nomination and classification steps is a significant reduction in the number of matching instances of the pixels belong to the c