Let be a ring. Given two positive integers and , an module is said to be -presented, if there is an exact sequence of -modules with is -generated. A submodule of a right -module is said to be -pure in , if for every -Presented left -module the canonical map is a monomorphism. An -module has the -pure intersection property if the intersection of any two -pure submodules is again -pure. In this paper we give some characterizations, theorems and properties of modules with the -pure intersection property.

A Multiple System Biometric System Based on ECG Data

Because of vulnerable threats and attacks against database during transmission from sender to receiver, which is one of the most global security concerns of network users, a lightweight cryptosystem using Rivest Cipher 4 (RC4) algorithm is proposed. This cryptosystem maintains data privacy by performing encryption of data in cipher form and transfers it over the network and again performing decryption to original data. Hens, ciphers represent encapsulating system for database tables

Implementation of TSFS (Transposition, Substitution, Folding, and Shifting) algorithm as an encryption algorithm in database security had limitations in character set and the number of keys used. The proposed cryptosystem is based on making some enhancements on the phases of TSFS encryption algorithm by computing the determinant of the keys matrices which affects the implementation of the algorithm phases. These changes showed high security to the database against different types of security attacks by achieving both goals of confusion and diffusion.

Let be a ring. Given two positive integers and , an module is said to be -presented, if there is an exact sequence of -modules with is -generated. A submodule of a right -module is said to be -pure in , if for every -Presented left -module the canonical map is a monomorphism. An -module has the -pure intersection property if the intersection of any two -pure submodules is again -pure. In this paper we give some characterizations, theorems and properties of modules with the -pure intersection property.

This work aims to develop a secure lightweight cipher algorithm for constrained devices. A secure communication among constrained devices is a critical issue during the data transmission from the client to the server devices. Lightweight cipher algorithms are defined as a secure solution for constrained devices that require low computational functions and small memory. In contrast, most lightweight algorithms suffer from the trade-off between complexity and speed in order to produce robust cipher algorithm. The PRESENT cipher has been successfully experimented on as a lightweight cryptography algorithm, which transcends other ciphers in terms of its computational processing that required low complexity operations. The mathematical model of

This paper contains an equivalent statements of a pre-  space, where  are considered subsets of with the product topology. An equivalence relation between the preclosed set  and a pre-  space, and a relation between a pre-  space and the preclosed set  with some conditions on a function  are found. In addition, we have proved that the graph  of  is preclosed in if  is a pre-  space, where the equivalence relation  on  is open.

     On the other hand, we introduce the definition of a pre-stable ( pre-stable) set by depending on the concept of a pre-neighborhood, where we get that every stable set is pre-stable. Moreover, we obtain that