The article describes a certain computation method of -arcs to construct the number of distinct -arcs in  for . In this method, a new approach employed to compute the number of -arcs and the number of distinct arcs respectively. This approach is based on choosing the number of inequivalent classes } of -secant distributions that is the number of 4-secant, 3-secant, 2-secant, 1-secant and 0-secant in each process. The maximum size of -arc that has been constructed by this method is . The new method is a new tool to deal with the programming difficulties that sometimes may lead to programming problems represented by the increasing number of arcs. It is essential to reduce the established number of -arcs in each cons

     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

     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 90⁰ to 270⁰ step 90⁰ 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 pro

In this paper, we introduce a new concept named St-polyform modules, and show that the class of St-polyform modules is contained properly in the well-known classes; polyform, strongly essentially quasi-Dedekind and ?-nonsingular modules. Various properties of such modules are obtained. Another characterization of St-polyform module is given. An existence of St-polyform submodules in certain class of modules is considered. The relationships of St-polyform with some related concepts are investigated. Furthermore, we introduce other new classes which are; St-semisimple and ?-non St-singular modules, and we verify that the class of St-polyform modules lies between them.

   Let R be a ring with identity and Ą a left R-module. In this article, we introduce new generalizations of compressible and prime modules, namely s-compressible module and s-prime module. An R-module A is s-compressible if for any nonzero submodule B of A there exists a small f in Hom_R(A, B). An R-module A is s-prime if for any submodule B of A, ann_R (B) A is small in A. These concepts and related concepts are studied in as well as  many results consist properties and characterizations are obtained.  

In this paper the queuing system (M/Er/1/N) has been considered in equilibrium. The method of stages introduced by Erlang has been used. The system of equations which governs the equilibrium probabilities of various stages has been given. For general N the probability of j stages of service are left in the system, has been introduced. And the probability for the empty system has been calculated in the explicit form.

An R-module M is called rationally extending if each submodule of M is rational in a direct summand of M. In this paper we study this class of modules which is contained in the class of extending modules, Also we consider the class of strongly quasi-monoform modules, an R-module M is called strongly quasi-monoform if every nonzero proper submodule of M is quasi-invertible relative to some direct summand of M. Conditions are investigated to identify between these classes. Several properties are considered for such modules