Let R be a commutative ring with 1 and M be a (left) unitary R – module. This essay gives generalizations for the notions prime module and some concepts related to it. We termed an R – module M as semi-essentially prime if annR (M) = annR (N) for every non-zero semi-essential submodules N of M. Given some of their advantages characterizations and examples, and we study the relation between these and some classes of modules.

In this paper, the concept of semi-?-open set will be used to define a new kind of strongly connectedness on a topological subspace namely "semi-?-connectedness". Moreover, we prove that semi-?-connectedness property is a topological property and give an example to show that semi-?-connectedness property is not a hereditary property. Also, we prove thate semi-?-irresolute image of a semi-?-connected space is a semi-?-connected space.

Let R be a commutative ring with identity and let M be a unitary left R-module. The purpose of this paper is to investigate some new results (up to our knowledge) on the concept of semi-essential submodules which introduced by Ali S. Mijbass and Nada K. Abdullah, and we make simple changes to the definition relate with the zero submodule, so we say that a submodule N of an R-module M is called semi-essential, if whenever N ∩ P = (0), then P = (0) for each prime submodule P of M. Various properties of semi-essential submodules are considered.

Let  be a ring with identity and  be a submodule of a left - module . A submodule  of  is called - small in  denoted by , in case for any submodule  of ,  implies .  Submodule  of  is called semi -T- small in , denoted by , provided for submodule  of ,  implies that . We studied this concept which is a generalization of the small submodules and obtained some related results

Let  be a commutative ring with identity and  be an -module. In this work, we present the concept of semi--maximal sumodule as a generalization of -maximal submodule.

We present that a submodule  of an -module  is a semi--maximal (sortly --max) submodule if  is a semisimple -module (where  is a submodule of ). We  investegate some properties of these kinds of modules.

      Fuchs introduced purely extending modules as a generalization of extending modules. Ahmed and Abbas gave another generalization for extending modules named semi-extending modules. In this paper, two generalizations of the extending modules are combined to give another generalization. This generalization is said to be almost semi-extending. In fact, the purely extending modules lies between the extending and almost semi-extending modules. We also show that an almost semi-extending module is a proper generalization of purely extending. In addition, various examples and important properties of this class of modules are given and considered. Another characterization of almost semi-extending modules is established. Moreover, the re

In modern era, which requires the use of networks in the transmission of data across distances, the transport or storage of such data is required to be safe. The protection methods are developed to ensure data security. New schemes are proposed that merge crypto graphical principles with other systems to enhance information security. Chaos maps are one of interesting systems which are merged with cryptography for better encryption performance. Biometrics is considered an effective element in many access security systems. In this paper, two systems which are fingerprint biometrics and chaos logistic map are combined in the encryption of a text message to produce strong cipher that can withstand many types of attacks. The histogram analysis o

In this paper, the error distribution function is estimated for the single index model by the empirical distribution function and the kernel distribution function. Refined minimum average variance estimation (RMAVE) method is used for estimating single index model. We use simulation experiments to compare the two estimation methods for error distribution function with different sample sizes, the results show that the kernel distribution function is better than the empirical distribution function.

We have provided in this research model multi assignment  with  fuzzy function goal has been to build programming model is correct Integer Programming fogging  after removing the case from the objective function data and convert it to real data .Pascal triangular graded mean using Pascal way to the center of the triangular.

The data processing to get rid of the case fogging which is surrounded by using an Excel 2007 either model multi assignment  has been used program LNDO to reach the optimal solution, which represents less than what can be from time to accomplish a number of tasks by the number of employees on the specific amount of the Internet, also included a search on some of the