In this work we prepared some schiff bases by condensation urea and benzaldehyde or its derevative ( bromo benzaldehyde or hydroxy benzaldehyde ) as ( 1 : 1 ) mole ( urea : benzaldehyde or its substitution ) to prepare compounds ( A1 , B1 , C1 , D1 , E1 , F1 , G1 ) and ( 1 : 2 ) mole ( urea : benzaldehyde or its substitution ) to prepare compounds ( A2 , B2 , C2 , D2 , E1 , F2 , G2 ) . The prepared compounds identified spectroscopic by infrared spectroscopy FT-IR and Thin layer chromotography T.L.C . The force constant calculated from the wave number for the carbonyl stretching from FT-IR chart and by using the following equation K = 4?2C2?'2? The change in double bond order for carbonyl deteremined in according with some past re

The prediction process of time series for some time-related phenomena, in particular, the autoregressive integrated moving average(ARIMA) models is one of the important topics in the theory of time series analysis in the applied statistics. Perhaps its importance lies in the basic stages in analyzing of the structure or modeling and the conditions that must be provided in the stochastic process. This paper deals with two methods of predicting the first was a special case of autoregressive integrated moving average which is ARIMA (0,1,1) if the value of the parameter equal to zero, then it is called Random Walk model, the second was the exponential weighted moving average (EWMA). It was implemented in the data of the monthly traff

Let R be a ring with 1 and W is a left Module over R. A Submodule D of an R-Module W is small in W(D ≪ W) if whenever a Submodule V of W s.t W = D + V then V = W. A proper Submodule Y of an R-Module W is semismall in W(Y ≪_S W) if Y = 0 or Y/F ≪ W/F ∀ nonzero Submodules F of Y. A Submodule U of an R-Module E is essentially semismall(U ≪es E), if for every non zero semismall Submodule V of E, V∩U ≠ 0. An R-Module E is essentially semismall quasi-Dedekind(ESSQD) if Hom(E/W, E) = 0 ∀ W ≪es E. A ring R is ESSQD if R is an ESSQD R-Module. An R-Module E is a scalar R-Module if, ∀ , ∃ s.t V(e) = ze ∀ . In this paper, we study the relationship between ESSQD Modules with scalar and multiplication Modules. We show that

In all applications and specially in real time applications, image processing and compression plays in modern life a very important part in both storage and transmission over internet for example, but finding orthogonal matrices as a filter or transform in different sizes is very complex and importance to using in different applications like image processing and communications systems, at present, new method to find orthogonal matrices as transform filter then used for Mixed Transforms Generated by using a technique so-called Tensor Product based for Data Processing, these techniques are developed and utilized. Our aims at this paper are to evaluate and analyze this new mixed technique in Image Compression using the Discrete Wavelet Transfo

In this paper, a method is proposed to increase the compression ratio for the color images by
dividing the image into non-overlapping blocks and applying different compression ratio for these
blocks depending on the importance information of the block. In the region that contain important
information the compression ratio is reduced to prevent loss of the information, while in the
smoothness region which has not important information, high compression ratio is used .The
proposed method shows better results when compared with classical methods(wavelet and DCT).

Fractal image compression depends on representing an image using affine transformations. The main concern for researches in the discipline of fractal image compression (FIC) algorithm is to decrease encoding time needed to compress image data. The basic technique is that each portion of the image is similar to other portions of the same image. In this process, there are many models that were developed. The presence of fractals was initially noticed and handled using Iterated Function System (IFS); that is used for encoding images. In this paper, a review of fractal image compression is discussed with its variants along with other techniques. A summarized review of contributions is achieved to determine the fulfillment of fractal ima

Fractal image compression gives some desirable properties like fast decoding image, and very good rate-distortion curves, but suffers from a high encoding time. In fractal image compression a partitioning of the image into ranges is required. In this work, we introduced good partitioning process by means of merge approach, since some ranges are connected to the others. This paper presents a method to reduce the encoding time of this technique by reducing the number of range blocks based on the computing the statistical measures between them . Experimental results on standard images show that the proposed method yields minimize (decrease) the encoding time and remain the quality results passable visually.

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.