The main goal of this paper is to dualize the two concepts St-closed submodule and semi-extending module which were given by Ahmed and Abbas in 2015. These dualizations are called CSt-closed submodule and cosemi-extending mod- ule. Many important properties of these dualizations are investigated, as well as some others useful results which mentioned by those authors are dualized. Furthermore, the relationships of cosemi-extending and other related modules are considered.

     Let R1be a commutative2ring with identity and M be a unitary R-module. In this6work we7present almost pure8ideal (submodule) concept as a9generalization of pure10ideal (submodule).  lso, we1generalize some9properties of8almost pure ideal (submodule). The 7study is almost regular6ring (R-module).

        Let R be a commutative ring with  identity . In this paper  we study  the concepts of  essentially quasi-invertible submodules and essentially  quasi-Dedekind modules  as  a generalization of  quasi-invertible submodules and quasi-Dedekind  modules  . Among the results that we obtain is the following : M  is an essentially  quasi-Dedekind  module if and only if M is aK-nonsingular module,where a module M is K-nonsingular if, for each  , Kerf ≤_e M   implies   f = 0 .

Our aim in this paper is to introduce the notation of nearly primary-2-absorbing submodule as generalization of 2-absorbing submodule where a proper submodule  of an -module  is called nearly primary-2-absorbing submodule if whenever , for , , ,  implies that either  or  or . We got many basic, properties, examples and characterizations of this concept. Furthermore, characterizations of nearly primary-2-absorbing submodules in some classes of modules were inserted. Moreover, the behavior of nearly primary-2-absorbing submodule under -epimorphism was studied.

      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

In this article, we introduce a class of modules that is analogous of generalized extending modules. First  we define a module M to be a generalized ECS if and only if for each ec-closed submodule A of M, there exists a direct summand D of M such that  is singular, and then we locate generalized ECS between the other extending generalizations. After that we present some of characterizations of generalized ECS condition. Finally, we show that the direct sum of a generalized ECS need not be generalized ECS and deal with decompositions for be generalized ECS concept.

In this paper, we introduce and study the essential and closed fuzzy submodules of a fuzzy module X as a generalization of the notions of essential and closed submodules. We prove many basic properties of both concepts.

      Let  R  be a commutative ring  with identity  and  E  be a unitary left  R – module .We introduce  and study the concept Weak Pseudo – 2 – Absorbing submodules as  generalization of weakle – 2 – Absorbing submodules , where a proper submodule  A of  an  R – module  E is  called  Weak Pseudo – 2 – Absorbing  if   0 ≠ rsx   A   for  r, s  R , x  E , implies that  rx   A + soc ( E ) or  sx  A + soc (E)  or   rs  [ A + soc ( E ) E ]. Many basic  properties, char

     The searching process using a binary codebook of combined Block Truncation Coding (BTC) method and Vector Quantization (VQ), i.e. a full codebook search for each input image vector to find the best matched code word in the codebook, requires a long time.   Therefore, in this paper, after designing a small binary codebook, we adopted a new method by rotating each binary code word in this codebook into 900 to 2700 step 900 directions. Then, we systematized each code word depending on its angle  to involve four types of binary code books (i.e. Pour when , Flat when  , Vertical when, or Zigzag). The proposed scheme was used for decreasing the time of the coding procedure, with very small distortion per block, by designing s