In this paper ,we introduce a concept of Max– module as follows: M is called a Max- module if ann N R is a maximal ideal of R, for each non– zero submodule N of M;       In other words, M is a Max– module iff (0) is a *- submodule, where  a proper submodule N of M is called a *- submodule if [ ] : N K R is a maximal ideal of R, for each submodule K contains N properly.       In this paper, some properties and characterizations of max– modules and  *- submodules are given. Also, various basic results a bout Max– modules are considered. Moreover, some relations between max- modules and other types of modules are considered.

    Let R be a commutative ring with unity and M be a non zero unitary left R-module. M is called a hollow module if every proper submodule N of M is small (N ≪ M), i.e. N + W ≠ M for every proper submodule W in M. A δ-hollow module is a generalization of hollow module, where an R-module M is called δ-hollow module if every proper submodule N of M is δ-small (N δ  M), i.e. N + W ≠ M for every proper submodule W in M with M W is singular. In this work we study this class of modules and give several fundamental properties related with this concept

Let R be a commutative ring with identity and M be unitary (left) R-module. The principal aim of this paper is to study the relationships between relatively cancellation module and multiplication modules, pure submodules and Noetherian (Artinian) modules.

With the development of high-speed network technologies, there has been a recent rise in the transfer of significant amounts of sensitive data across the Internet and other open channels. The data will be encrypted using the same key for both Triple Data Encryption Standard (TDES) and Advanced Encryption Standard (AES), with block cipher modes called cipher Block Chaining (CBC) and Electronic CodeBook (ECB). Block ciphers are often used for secure data storage in fixed hard drives, portable devices, and safe network data transport. Therefore, to assess the security of the encryption method, it is necessary to become familiar with and evaluate the algorithms of cryptographic systems. Block cipher users need to be sure that the ciphers the

This paper presents a fully computerized method to backup the router configuration file. The method consists of a friendly graphical interface programmed by Java programming language.

    The proposed method is compared with the two existing methods, namely: TFTP server method and Copy/Paste method. The comparison reveals that the proposed method has many advantages over the existing ones. The proposed method has been implemented on Cisco routers (series 2500, 2600 and 2800).

Let R be a ring with 1 and W is a left Module over R. A Submodule D of an R-Module W is small in W(D ≪ W) if whenever a Submodule V of W s.t W = D + V then V = W. A proper Submodule Y of an R-Module W is semismall in W(Y ≪_S W) if Y = 0 or Y/F ≪ W/F ∀ nonzero Submodules F of Y. A Submodule U of an R-Module E is essentially semismall(U ≪es E), if for every non zero semismall Submodule V of E, V∩U ≠ 0. An R-Module E is essentially semismall quasi-Dedekind(ESSQD) if Hom(E/W, E) = 0 ∀ W ≪es E. A ring R is ESSQD if R is an ESSQD R-Module. An R-Module E is a scalar R-Module if, ∀ , ∃ s.t V(e) = ze ∀ . In this paper, we study the relationship between ESSQD Modules with scalar and multiplication Modules. We show that

Six isolates of A. pullulans were collected from many sources including Hibiscus sabdariffa (Roselle), old Roofs of houses and bathroom surface that referred as Ap ros1, Ap or2, 3, 4 and Ap bs5, 6 respectively, all these isolates were identified based on morphological characteristics and nutritional physiology profiles, all were able to utilize various carbon and nitrogen sources such as glucose, xylose, sucrose, maltose, ammonium sulfate, ammonium nitrate and ammonium chloride, also they showed positive test for starch and amylase, while α-cellulose, ethanol, and methanol were could not be ass