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

     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 .

        The intensification of competition among all companies and at different levels has become necessary for every company need to continue to improve its performance in order to be able to face the competition and stay in the market. To achieve this, we must rely on the company's accounting information more accurate and appropriate and provided in a timely manner, for the purpose of use in planning and decision making.

So there must be information systems that help the administration to continuous development and improvement of the performance of companies in general, and this is what you need Jordanian companies, especially after the accession of Jordan to the field

Let R be a commutative ring with non-zero identity element. For two fixed positive integers m and n. A right R-module M is called fully (m,n) -stable relative to ideal A of , if for each n-generated submodule of Mm and R-homomorphism . In this paper we give some characterization theorems and properties of fully (m,n) -stable modules relative to an ideal A of . which generalize the results of fully stable modules relative to an ideal A of R.

    This research includes the use of an artificial intelligence algorithm, which is one of the algorithms of biological systems which is the algorithm of genetic regulatory networks (GRNs), which is a dynamic system for a group of variables representing space within time. To construct this biological system, we use (ODEs) and to analyze the stationarity of the model we use Euler's method. And through the factors that affect the process of gene expression in terms of inhibition and activation of the transcription process on DNA, we will use TF transcription factors. The current research aims to use the latest methods of the artificial intelligence algorithm. To apply Gene Regulation Networks (GRNs), we used a progr

تهدف هذه الدراسة للتعرف على السياسات اإلاسرائيلية المتبعة على الارض والمتمثلة في االاستيطان
الاستعماري والطرق التفافية، ومصادرة الاراضي وجدار الضم والتوسع العنصري، بالاضافة إلى التصنيف
الاداري للمناطق في الضفة الغربية حسب ما جاء في اتفاقية أوسلو، والتي من شأنها التأثير على تلك
المناطق، وال سيما قطاع اإلسكان الذي يعد من أهم القطاعات التي تتر كب وبالتحديد في منطقة الدراسة،
وسوف تحاول هذه الدراسة تس

Let G be a graph, each edge e of which is given a weight w(e). The shortest path problem is a path of minimum weight connecting two specified vertices a and b, and from it we have a pre-topology. Furthermore, we study the restriction and separators in pre-topology generated by the shortest path problems. Finally, we study the rate of liaison in pre-topology between two subgraphs. It is formally shown that the new distance measure is a metric

        The present article studies the specific cultural features contained in phraseological units. The problem is approached through three different levels:

1. The modern linguistic meaning.
2. Lexical components of phraseological units.
3. The first variables of linguistic units.

  The paper emphasizes the gradual process of the cultural charge in the semantic structure of phraseological units.      

       Наша Статья посвящена вопросам анализа национ-ально - культурной сп