In this paper we introduce the notion of semiprime fuzzy module as a generalization of semiprime module. We investigate several characterizations and properties of this concept.
Let R be a ring and let A be a unitary left R-module. A proper submodule H of an R-module A is called 2-absorbing , if rsa∈H, where r,s∈R,a∈A, implies that either ra∈H or sa∈H or rs∈[H:A], and a proper submodule H of an R-module A is called quasi-prime , if rsa∈H, where r,s∈R,a∈A, implies that either ra∈H or sa∈H. This led us to introduce the concept pseudo quasi-2-absorbing submodule, as a generalization of both concepts above, where a proper submodule H of an R-module A is called a pseudo quasi-2-absorbing submodule of A, if whenever rsta∈H,where r,s,t∈R,a∈A, implies that either rsa∈H+soc(A) or sta∈H+soc(A) or rta∈H+soc(A), where soc(A) is socal of an
... Show MoreThe concept of semi-essential semimodule has been studied by many researchers.
In this paper, we will develop these results by setting appropriate conditions, and defining new properties, relating to our concept, for example (fully prime semimodule, fully essential semimodule and semi-complement subsemimodule) such that: if for each subsemimodule of -semimodule is prime, then is fully prime. If every semi-essential subsemimodule of -semimodule is essential then is fully essential. Finally, a prime subsemimodule of is called semi-relative intersection complement (briefly, semi-complement) of subsemimodule in , if , and whenever with is a prime subsemimodule in , , then . Furthermore, some res
... Show MoreAs a new technology, blockchain provides the necessary capabilities to assure data integrity and data security through encryption. Mostly, all existing algorithms that provide security rely on the process of discovering a suitable key. Hence, key generation is considered the core of powerful encryption. This paper uses Zernike moment and Mersenne prime numbers to generate strong prime numbers by extracting the features from biometrics (speech). This proposed system sends these unique and strong prime numbers to the RSA algorithm to generate the keys. These keys represent a public address and a private key in a cryptocurrency wallet that is used to encrypt transactions. The benefit of this work is that it provides a high degree
... Show MoreOur active aim in this paper is to prove the following Let Ŕ be a ring having an
idempotent element e(e 0,e 1) . Suppose that R is a subring of Ŕ which
satisfies:
(i) eR R and Re R .
(ii) xR 0 implies x 0 .
(iii ) eRx 0 implies x 0( and hence Rx 0 implies x 0) .
(iv) exeR(1 e) 0 implies exe 0 .
If D is a derivable map of R satisfying D(R ) R ;i, j 1,2. ij ij Then D is
additive. This extend Daif's result to the case R need not contain any non-zero
idempotent element.
The main purpose of this work is to generalize Daif's result by introduceing the concept of Jordan (α β permuting 3-derivation on Lie ideal and generalize these result by introducing the concept of generalized Jordan (α β permuting 3-derivation
In the current paper, we study the structure of Jordan ideals of a 3-prime near-ring which satisfies some algebraic identities involving left generalized derivations and right centralizers. The limitations imposed in the hypothesis were justified by examples.
Let be a commutative ring with identity, and be a unitary left -module. In this paper we introduce the concept pseudo weakly closed submodule as a generalization of -closed submodules, where a submodule of an -module is called a pseudo weakly closed submodule, if for all , there exists a -closed submodule of with is a submodule of such that . Several basic properties, examples and results of pseudo weakly closed submodules are given. Furthermore the behavior of pseudo weakly closed submodules in class of multiplication modules are studied. On the other hand modules with chain conditions on pseudo weakly closed submodules are established. Also, the relationships of pseudo weakly closed
... Show MoreAbstract Throughout this paper R represents commutative ring with identity and M is a unitary left R-module, the purpose of this paper is to study a new concept, (up to our knowledge), named St-closed submodules. It is stronger than the concept of closed submodules, where a submodule N of an R-module M is called St-closed (briefly N ≤Stc M) in M, if it has no proper semi-essential extensions in M, i.e if there exists a submodule K of M such that N is a semi-essential submodule of K then N = K. An ideal I of R is called St-closed if I is an St-closed R-submodule. Various properties of St-closed submodules are considered.
Let be a commutative ring with identity and let be an R-module. We call an R-submodule of as P-essential if for each nonzero prime submodule of and 0 . Also, we call an R-module as P-uniform if every non-zero submodule of is P-essential. We give some properties of P-essential and introduce many properties to P-uniform R-module. Also, we give conditions under which a submodule of a multiplication R-module becomes P-essential. Moreover, various properties of P-essential submodules are considered.
This paper describes a number of new interleaving strategies based on the golden section. The new interleavers are called golden relative prime interleavers, golden interleavers, and dithered golden interleavers. The latter two approaches involve sorting a real-valued vector derived from the golden section. Random and so-called “spread” interleavers are also considered. Turbo-code performance results are presented and compared for the various interleaving strategies. Of the interleavers considered, the dithered golden interleaver typically provides the best performance, especially for low code rates and large block sizes. The golden relative prime interleaver is shown to work surprisingly well for high puncture rates. These interleav
... Show More