Throughout this paper R represents a commutative ring with identity and all R-modules M are unitary left R-modules. In this work we introduce the notion of S-maximal submodules as a generalization of the class of maximal submodules, where a proper submodule N of an R-module M is called S-maximal, if whenever W is a semi essential submodule of M with N ⊊ W ⊆ M, implies that W = M. Various properties of an S-maximal submodule are considered, and we investigate some relationships between S-maximal submodules and some others related concepts such as almost maximal submodules and semimaximal submodules. Also, we study the behavior of S-maximal submodules in the class of multiplication modules. Farther more we give S-Jacobson radical of rings

Throughout this paper R represents a commutative ring with identity and all R-modules M are unitary left R-modules. In this work we introduce the notion of S-maximal submodules as a generalization of the class of maximal submodules, where a proper submodule N of an R-module M is called S-maximal, if whenever W is a semi essential submodule of M with N ? W ? M, implies that W = M. Various properties of an S-maximal submodule are considered, and we investigate some relationships between S-maximal submodules and some others related concepts such as almost maximal submodules and semimaximal submodules. Also, we study the behavior of S-maximal submodules in the class of multiplication modules. Farther more we give S-Jacobson radical of ri

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 .

An anal fissure which does not heal with conservative measures as sits baths and laxatives is a chronic anal fissure. Physiologically, it is the high resting tone of the internal anal sphincter that chiefly interferes with the healing process of these fissures. Until now, the gold standard treatment modality is surgery, either digital anal dilatation or lateral sphincterotomy. However, concerns have been raised about the incidence of faecal incontinence after surgery. Therefore, pharmacological means to treat chronic anal fissures have been explored.A Medline and pub med database search from 1986-2012 was conducted to perform a literature search for articles relating to the non-surgical treatment of chronic anal fissure.Pharmacological s

        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

An anal fissure which does not heal with conservative measures as sits baths and laxatives is a chronic anal fissure. Physiologically, it is the high resting tone of the internal anal sphincter that chiefly interferes with the healing process of these fissures. Until now, the gold standard treatment modality is surgery, either digital anal dilatation or lateral sphincterotomy. However, concerns have been raised about the incidence of faecal incontinence after surgery. Therefore, pharmacological means to treat chronic anal fissures have been explored. A Medline and pub med database search from 1986-2012 was conducted to perform a literature search for articles relating to the non-surgical treatment of chronic anal fissure. Pharmacological

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.