In this article, we introduce a class of modules that is analogous of generalized extending modules. First we define a module M to be a generalized ECS if and only if for each ec-closed submodule A of M, there exists a direct summand D of M such that is singular, and then we locate generalized ECS between the other extending generalizations. After that we present some of characterizations of generalized ECS condition. Finally, we show that the direct sum of a generalized ECS need not be generalized ECS and deal with decompositions for be generalized ECS concept.
Let R be a commutative ring with identity and M an unitary R-module. Let ï¤(M) be the set of all submodules of M, and ï¹: ï¤(M)  ï¤(M)  {ï¦} be a function. We say that a proper submodule P of M is end-ï¹-prime if for each ï¡ ïƒŽ EndR(M) and x  M, if ï¡(x)  P, then either x  P + ï¹(P) or ï¡(M) ïƒ P + ï¹(P). Some of the properties of this concept will be investigated. Some characterizations of end-ï¹-prime submodules will be given, and we show that under some assumtions prime submodules and end-ï¹-prime submodules are coincide.
The main goal of this paper is to introduce a new class in the category of modules. It is called quasi-invertibility monoform (briefly QI-monoform) modules. This class of modules is a generalization of monoform modules. Various properties and another characterization of QI-monoform modules are investigated. So, we prove that an R-module M is QI-monoform if and only if for each non-zero homomorphism f:M E(M), the kernel of this homomorphism is not quasi-invertible submodule of M. Moreover, the cases under which the QI-monoform module can be monoform are discussed. The relationships between QI-monoform and other related concepts such as semisimple, injective and multiplication modules are studied. We also show that they are proper subclass
... Show MoreIn this study, we present a new steganography method depend on quantizing the perceptual color spaces bands. Four perceptual color spaces are used to test the new method which is HSL, HSV, Lab and Luv, where different algorithms to calculate the last two-color spaces are used. The results reveal the validity of this method as a steganoic method and analysis for the effects of quantization and stegano process on the quality of the cover image and the quality of the perceptual color spaces bands are presented.
Given a binary matrix, finding the maximum set of columns such that the resulting submatrix has the Consecutive Ones Property (C1P) is called the Consecutive Ones Submatrix (C1S) problem. There are solution approaches for it, but there is also a room for improvement. Moreover, most of the studies of the problem use exact solution methods. We propose an evolutionary approach to solve the problem. We also suggest a related problem to C1S, which is the Consecutive Blocks Minimization (CBM). The algorithm is then performed on real-world and randomly generated matrices of the set covering type.
Let R be a commutative ring with identity. R is said to be P.P ring if every principle ideal of R is projective. Endo proved that R is P.P ring if and only if Rp is an integral domain for each prime ideal P of R and the total quotient ring Rs of R is regular. Also he proved that R is a semi-hereditary ring if and only if Rp is a valuation domain for each prime ideal P of R and the total quotient Rs of R is regular. , and we study some of properties of these modules. In this paper we study analogue of these results in C.F, C.P, F.G.F, F.G.P R-modules.
In this paper, a new method of selection variables is presented to select some essential variables from large datasets. The new model is a modified version of the Elastic Net model. The modified Elastic Net variable selection model has been summarized in an algorithm. It is applied for Leukemia dataset that has 3051 variables (genes) and 72 samples. In reality, working with this kind of dataset is not accessible due to its large size. The modified model is compared to some standard variable selection methods. Perfect classification is achieved by applying the modified Elastic Net model because it has the best performance. All the calculations that have been done for this paper are in
A theoretical study was done in this work for Fatigue. Fatigue Crack Growth (FCG) and stress factor intensity range for Ti2 SiC 3 . It also includes Generalized Paris Equation and the Fulfillment of his equation which promise that there is a relation between parameters C and n. Simple Paris Equation was used through which we concluded the practical values of C and n and compared them with the theoretical values which have been concluded by Generalized Paris Equation. The value of da/dN and ∆K for every material and sample were concluded and compared with the data which was used in the computer p
... Show MoreWe introduce in this paper the concept of an approximately pure submodule as a generalization of a pure submodule, that is defined by Anderson and Fuller. If every submodule of an R-module is approximately pure, then is called F-approximately regular. Further, many results about this concept are given.
Malware represents one of the dangerous threats to computer security. Dynamic analysis has difficulties in detecting unknown malware. This paper developed an integrated multi – layer detection approach to provide more accuracy in detecting malware. User interface integrated with Virus Total was designed as a first layer which represented a warning system for malware infection, Malware data base within malware samples as a second layer, Cuckoo as a third layer, Bull guard as a fourth layer and IDA pro as a fifth layer. The results showed that the use of fifth layers was better than the use of a single detector without merging. For example, the efficiency of the proposed approach is 100% compared with 18% and 63% of Virus Total and Bel
... Show MoreThe Internet of Things (IoT) is an information network that connects gadgets and sensors to allow new autonomous tasks. The Industrial Internet of Things (IIoT) refers to the integration of IoT with industrial applications. Some vital infrastructures, such as water delivery networks, use IIoT. The scattered topology of IIoT and resource limits of edge computing provide new difficulties to traditional data storage, transport, and security protection with the rapid expansion of the IIoT. In this paper, a recovery mechanism to recover the edge network failure is proposed by considering repair cost and computational demands. The NP-hard problem was divided into interdependent major and minor problems that could be solved in polynomial t
... Show More