In this paper three techniques for image compression are implemented. The proposed techniques consist of three dimension (3-D) two level discrete wavelet transform (DWT), 3-D two level discrete multi-wavelet transform (DMWT) and 3-D two level hybrid (wavelet-multiwavelet transform) technique. Daubechies and Haar are used in discrete wavelet transform and Critically Sampled preprocessing is used in discrete multi-wavelet transform. The aim is to maintain to increase the compression ratio (CR) with respect to increase the level of the transformation in case of 3-D transformation, so, the compression ratio is measured for each level. To get a good compression, the image data properties, were measured, such as, image entropy (He), percent root-

In this paper three techniques for image compression are implemented. The proposed techniques consist of three dimension (3-D) two level discrete wavelet transform (DWT), 3-D two level discrete multi-wavelet transform (DMWT) and 3-D two level hybrid (wavelet-multiwavelet transform) technique. Daubechies and Haar are used in discrete wavelet transform and Critically Sampled preprocessing is used in discrete multi-wavelet transform. The aim is to maintain to increase the compression ratio (CR) with respect to increase the level of the transformation in case of 3-D transformation, so, the compression ratio is measured for each level. To get a good compression, the image data properties, were measured, such as, image entropy (He), percent r

Assume that G is a finite group and X = tG where t is non-identity element with t3 = 1. The simple graph with node set being X such that a, b ∈ X, are adjacent if ab-1 is an involution element, is called the A4-graph, and designated by A4(G, X). In this article, the construction of A4(G, X) is analyzed for G is the twisted group of Lie type 3D4(3).

Recently Genetic Algorithms (GAs) have frequently been used for optimizing the solution of estimation problems. One of the main advantages of using these techniques is that they require no knowledge or gradient information about the response surface. The poor behavior of genetic algorithms in some problems, sometimes attributed to design operators, has led to the development of other types of algorithms. One such class of these algorithms is compact Genetic Algorithm (cGA), it dramatically reduces the number of bits reqyuired to store the poulation and has a faster convergence speed. In this paper compact Genetic Algorithm is used to optimize the maximum likelihood estimator of the first order moving avergae model MA(1). Simulation results

The present study aimed to identify teaching problems which facing the teachers for first three grades classes, and if these problems different according to some variables teacher qualification, experience period, class grade). The study sample consist of (137 )

 female teachers who teach the first three grades in Braimy city in Oman, teachers spread in five government schools. Both researchers developed questionnaire to measure problems faced by the mentioned teachers, consist of 50 questions distributed into 4 dimensions (teacher, students, the curriculum, the evaluations), Also researchers checked questionnaire validity and stability. The results indicate to: The most common probl

The study attempts to measure the level of shyness; the level of psychological isolation; to identify the relationship between shyness and psychological isolation; and to identify the differences between shyness and psychological isolation among first-intermediate students. To this end, a random sample comprised (187) male and female students was chosen for the academic year (2016-2017) from Baghdad \ Al-Rasafa. To measure the shyness and psychological isolation, the researcher designed two scales: one to measure the shyness composed of (37) items divided into four domains; and the other to measure the psychological isolation made of (56) items divided into three domains. The study concluded that the sample has a medium level of shyness;