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 be a commutative ring with 1 and be a left unitary . In this paper, the generalizations for the notions of compressible module and retractable module are given.
An is termed to be semi-essentially compressible if can be embedded in every of a non-zero semi-essential submodules. An is termed a semi-essentially retractable module, if for every non-zero semi-essentially submodule of an . Some of their advantages characterizations and examples are given. We also study the relation between these classes and some other classes of modules.
Let be a commutative ring with 1 and be left unitary . In this paper we introduced and studied concept of semi-small compressible module (a is said to be semi-small compressible module if can be embedded in every nonzero semi-small submodule of . Equivalently, is semi-small compressible module if there exists a monomorphism , , is said to be semi-small retractable module if , for every non-zero semi-small sub module in . Equivalently, is semi-small retractable if there exists a homomorphism whenever .
In this paper we introduce and study the concept of semi-small compressible and semi-small retractable s as a generalization of compressible and retractable respectively and give some of
... Show MoreLet be a commutative ring with 1 and be left unitary . In this papers we introduced and studied concept P-small compressible (An is said to be P-small compressible if can be embedded in every of it is nonzero P-small submodule of . Equivalently, is P-small compressible if there exists a monomorphism , , is said to be P-small retractable if , for every non-zero P-small submodule of . Equivalently, is P-small retractable if there exists a homomorphism whenever as a generalization of compressible and retractable respectively and give some of their advantages characterizations and examples.
Let be a commutative ring with 1 and be left unitary . In this paper we introduced and studied concept of semi-small compressible module (a is said to be semi-small compressible module if can be embedded in every nonzero semi-small submodule of . Equivalently, is semi-small compressible module if there exists a monomorphism , , is said to be semi-small retractable module if , for every non-zero semi-small sub module in . Equivalently, is semi-small retractable if there exists a homomorphism whenever . In this paper we introduce and study the concept of semi-small compressible and semi-small retractable s as a generalization of compressible and retractable respectively and give some of their adv
... Show MoreWidespread COVID-19 infections have sparked global attempts to contain the virus and eradicate it. Most researchers utilize machine learning (ML) algorithms to predict this virus. However, researchers face challenges, such as selecting the appropriate parameters and the best algorithm to achieve an accurate prediction. Therefore, an expert data scientist is needed. To overcome the need for data scientists and because some researchers have limited professionalism in data analysis, this study concerns developing a COVID-19 detection system using automated ML (AutoML) tools to detect infected patients. A blood test dataset that has 111 variables and 5644 cases was used. The model is built with three experiments using Python's Auto-
... Show MoreIn this paper, we investigate two stress-strength models (Bounded and Series) in systems reliability based on Generalized Inverse Rayleigh distribution. To obtain some estimates of shrinkage estimators, Bayesian methods under informative and non-informative assumptions are used. For comparison of the presented methods, Monte Carlo simulations based on the Mean squared Error criteria are applied.
The survival analysis is one of the modern methods of analysis that is based on the fact that the dependent variable represents time until the event concerned in the study. There are many survival models that deal with the impact of explanatory factors on the likelihood of survival, including the models proposed by the world, David Cox, one of the most important and common models of survival, where it consists of two functions, one of which is a parametric function that does not depend on the survival time and the other a nonparametric function that depends on times of survival, which the Cox model is defined as a semi parametric model, The set of parametric models that depend on the time-to-event distribution parameters such as
... Show MoreLet M be an R-module. In this paper we introduce the concept of quasi-fully cancellation modules as a generalization of fully cancellation modules. We give the basic properties, several characterizations about this concept. Also, the direct sum and the localization of quasi-fully cancellation modules are studied.
In modern years, internet and computers were used by many nations all overhead the world in different domains. So the number of Intruders is growing day-by-day posing a critical problem in recognizing among normal and abnormal manner of users in the network. Researchers have discussed the security concerns from different perspectives. Network Intrusion detection system which essentially analyzes, predicts the network traffic and the actions of users, then these behaviors will be examined either anomaly or normal manner. This paper suggested Deep analyzing system of NIDS to construct network intrusion detection system and detecting the type of intrusions in traditional network. The performance of the proposed system was evaluated by using
... Show MoreRecently, the internet has made the users able to transmit the digital media in the easiest manner. In spite of this facility of the internet, this may lead to several threats that are concerned with confidentiality of transferred media contents such as media authentication and integrity verification. For these reasons, data hiding methods and cryptography are used to protect the contents of digital media. In this paper, an enhanced method of image steganography combined with visual cryptography has been proposed. A secret logo (binary image) of size (128x128) is encrypted by applying (2 out 2 share) visual cryptography on it to generate two secret share. During the embedding process, a cover red, green, and blue (RGB) image of size (512
... Show More