In this paper, an algorithm for binary codebook design has been used in vector quantization technique, which is used to improve the acceptability of the absolute moment block truncation coding (AMBTC) method. Vector quantization (VQ) method is used to compress the bitmap (the output proposed from the first method (AMBTC)). In this paper, the binary codebook can be engender for many images depending on randomly chosen to the code vectors from a set of binary images vectors, and this codebook is then used to compress all bitmaps of these images. The chosen of the bitmap of image in order to compress it by using this codebook based on the criterion of the average bitmap replacement error (ABPRE). This paper is suitable to reduce bit rates

There are many methods of searching large amount of data to find one particular piece of information. Such as find name of person in record of mobile. Certain methods of organizing data make the search process more efficient the objective of these methods is to find the element with least cost (least time). Binary search algorithm is faster than sequential and other commonly used search algorithms. This research develops binary search algorithm by using new structure called Triple, structure in this structure data are represented as triple. It consists of three locations (1-Top, 2-Left, and 3-Right) Binary search algorithm divide the search interval in half, this process makes the maximum number of comparisons (Average case com

The objective of this work is to study the concept of a fuzzy -cone metric space And some related definitions in space. Also, we discuss some new results of fixed point theorems. Finally, we apply the theory of fixed point achieved in the research on an integral type.

We presented in this paper a new class containing analytic univalent functions defined on unit disk. We obtained many geometric properties , like , coefficient inequality , distortion and growth theorems, convolution property, convex set, arithmetic mean and radius of starlikness and convexity by using Gaussian hypergeometric function for the class

The study seeks to identify e-governance requirements in human resources management, which are (administrative requirements, technical, human, financial, and security) which is a new style differs from the traditional management pattern, where work depends on multiple forms and methods of Tools, (e. g. computers and various electronic software), by relying on powerful information systems that help to make management decisions as quickly and less effortless and less expensive to keep up with the tremendous technological advancements in the field of information and communication technology revolution.

 The sample included 132 Person who constitute a position (Director General, assistant Director General, section managers and d

     In this study, we propose a suitable solution for a non-linear system of ordinary differential equations (ODE) of the first order with the initial value problems (IVP) that contains multi variables and multi-parameters with missing real data. To solve the mentioned system, a new modified numerical simulation method is created for the first time which is called Mean Latin Hypercube Runge-Kutta (MLHRK). This method can be obtained by combining the Runge-Kutta (RK) method with the statistical simulation procedure which is the Latin Hypercube Sampling (LHS) method. The present work is applied to the influenza epidemic model in Australia in 1919  for a previous study. The comparison between the numerical and numerical simulation res

Background: As photochemical reaction that can stiffen the cornea, CXL is the only promising method of preventing progression of keratectasia such as KC and secondary ectasia following refractive surgery. The aim of CXL is to stabilize the underlying condition with a small chance of visual improvement. Objective: To show the sequences of changes in visual acuity and topographic outcomes during 1 year post CXL for patients with progressive Keratoconus.Type of the study: Cross sectional studyMethods: CXL procedure was done for 45 eyes with progressive KC. The following parameters had been monitored pre operatively, 1, 3, 6 and 12 months postoperatively: K apex, K2, corneal thickness at thinnest location, anterior and posterior elevation po

    We introduce in this paper the concept of approximaitly semi-prime submodules of unitary left -module  over a commutative ring  with identity as a generalization of a prime submodules and semi-prime submodules, also generalization of quasi-prime submodules and approximaitly prime submodules. Various basic properties of an approximaitly semi-prime submodules are discussed, where a proper submodule  of an -module  is called an approximaitly semi-prime submodule of  , if whenever , where ,  and , implies that . Furthermore the behaviors of approximaitly semi-prime submodule in some classes of modules are studied. On the other hand several characterizations of this concept are

      Let  be a commutative ring with identity. The aim of this paper is introduce the notion of a pseudo primary-2-absorbing submodule as generalization of 2-absorbing submodule and a pseudo-2-absorbing submodules. A proper submodule  of an -module  is called pseudo primary-2-absorbing if whenever , for , , implies that either                  or  or . Many basic properties, examples and characterizations of these concepts are given. Furthermore, characterizations of pseudo primary-2-absorbing submodules in some classes of modules are introduced. Moreover, the behavior of a pseudo primary-2-absorbing submodul

     Let R be a commutative ring with unity and an R-submodule N is called semimaximal if and only if

 the sufficient conditions of F-submodules to be semimaximal .Also the concepts of (simple , semisimple) F- submodules and quotient F- modules are  introduced and given some  properties .