The goal of this research is to introduce the concepts of Large-coessential submodule and Large-coclosed submodule, for which some properties are also considered. Let M be an R-module and K, N are submodules of M such that , then K is said to be Large-coessential submodule, if . A submodule N of M is called Large-coclosed submodule, if K is Large-coessential submodule of N in M, for some submodule K of N, implies that .
The goal of this research is to introduce the concepts of Large-coessential submodule and Large-coclosed submodule, for which some properties are also considered. Let M be an R-module and K, N are submodules of M such that , then K is said to be Large-coessential submodule, if . A submodule N of M is called Large-coclosed submodule, if K is Large-coessential submodule of N in M, for some submodule K of N, implies that .
In this paper, we introduce the concepts of Large-lifting and Large-supplemented modules as a generalization of lifting and supplemented modules. We also give some results and properties of this new kind of modules.
In this paper, we introduce the concepts of Large-lifting and Large-supplemented modules as a generalization of lifting and supplemented modules. We also give some results and properties of this new kind of modules.
The goal of this research is to introduce the concepts of Large-small submodule and Large-hollow module and some properties of them are considered, such that a proper submodule N of an R-module M is said to be Large-small submodule, if N + K = M where K be a submodule of M, then K is essential submodule of M ( K ≤e M ). An R-module M is called Large-hollow module if every proper submodule of M is Large-small submodule in M.
A coin has two sides. Steganography although conceals the existence of a message but is not completely secure. It is not meant to supersede cryptography but to supplement it. The main goal of this method is to minimize the number of LSBs that are changed when substituting them with the bits of characters in the secret message. This will lead to decrease the distortion (noise) that is occurred in the pixels of the stego-image and as a result increase the immunity of the stego-image against the visual attack. The experiment shows that the proposed method gives good enhancement to the steganoraphy technique and there is no difference between the cover-image and the stego-image that can be seen by the human vision system (HVS), so this method c
... Show MoreIn thisipaper, we introduce the concepts of the modified tupledicoincidence points and the mixed finiteimonotone property. Also the existenceiand uniquenessiof modified tupled coincidenceipoint is discusses without continuous condition for mappings having imixed finite monotoneiproperty in generalizedimetric spaces.
User confidentiality protection is concerning a topic in control and monitoring spaces. In image, user's faces security in concerning with compound information, abused situations, participation on global transmission media and real-world experiences are extremely significant. For minifying the counting needs for vast size of image info and for minifying the size of time needful for the image to be address computationally. consequently, partial encryption user-face is picked. This study focuses on a large technique that is designed to encrypt the user's face slightly. Primarily, dlib is utilizing for user-face detection. Susan is one of the top edge detectors with valuable localization characteristics marked edges, is used to extract
... Show More