Throughout this paper R represents a commutative ring with identity and all R-modules M are unitary left R-modules. In this work we introduce the notion of S-maximal submodules as a generalization of the class of maximal submodules, where a proper submodule N of an R-module M is called S-maximal, if whenever W is a semi essential submodule of M with N ⊊ W ⊆ M, implies that W = M. Various properties of an S-maximal submodule are considered, and we investigate some relationships between S-maximal submodules and some others related concepts such as almost maximal submodules and semimaximal submodules. Also, we study the behavior of S-maximal submodules in the class of multiplication modules. Farther more we give S-Jacobson radical of rings

    Let R be a commutative ring with identity, and M be a left untial module. In this paper we introduce and study the concept w-closed submodules, that is stronger form of the concept of closed submodules, where asubmodule K of a module M is called w-closed in M, "if it has no proper weak essential extension in M", that is if there exists a submodule L of M with K is weak essential submodule of L then K=L. Some basic properties, examples of w-closed submodules are investigated, and some relationships between w-closed submodules and other related modules are studied. Furthermore, modules with chain condition on w-closed submodules are studied.   

Digital forensic is part of forensic science that implicitly covers crime related to computer and other digital devices. It‟s being for a while that academic studies are interested in digital forensics. The researchers aim to find out a discipline based on scientific structures that defines a model reflecting their observations. This paper suggests a model to improve the whole investigation process and obtaining an accurate and complete evidence and adopts securing the digital evidence by cryptography algorithms presenting a reliable evidence in a court of law. This paper presents the main and basic concepts of the frameworks and models used in digital forensics investigation.

       This paper uses Artificial Intelligence (AI) based algorithm analysis to classify breast cancer Deoxyribonucleic (DNA). Main idea is to focus on application of machine and deep learning techniques. Furthermore, a genetic algorithm is used to diagnose gene expression to reduce the number of misclassified cancers. After patients' genetic data are entered, processing operations that require filling the missing values using different techniques are used. The best data for the classification process are chosen by combining each technique using the genetic algorithm and comparing them  in terms of accuracy.

The concept of the Extend Nearly Pseudo Quasi-2-Absorbing submodules was recently introduced by Omar A. Abdullah and Haibat K. Mohammadali in 2022, where he studies this concept and it is relationship to previous generalizationsm especially  2-Absorbing submodule and Quasi-2-Absorbing submodule, in addition to studying the most important Propositions, charactarizations and Examples. Now in this research, which is considered a continuation of the definition that was presented earlier, which is the Extend Nearly Pseudo Quasi-2-Absorbing submodules, we have completed the study of this concept in multiplication modules. And the relationship between the Extend Nearly Pseudo Quasi-2-Absorbing submodule and Extend Nearly Pseudo Quasi-2-Abs

Abstract 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.

The strong cryptography employed by PGP (Pretty Good Privacy) is one of the best available today. The PGP protocol is a hybrid cryptosystem that combines some of the best features of both conventional and public-key cryptography. This paper aim to improve PGP protocol by combined between the Random Genetic algorithm, NTRU (N-th degree Truncated polynomial Ring Unit) algorithm with PGP protocol stages in order to increase PGP protocol speed, security, and make it more difficult in front of the counterfeiter. This can be achieved by use the Genetic algorithm that only generates the keys according to the Random Genetic equations. The final keys that obtained from Genetic algorithm were observed to be purely random (according to the randomne

A new human-based heuristic optimization method, named the Snooker-Based Optimization Algorithm (SBOA), is introduced in this study. The inspiration for this method is drawn from the traits of sales elites—those qualities every salesperson aspires to possess. Typically, salespersons strive to enhance their skills through autonomous learning or by seeking guidance from others. Furthermore, they engage in regular communication with customers to gain approval for their products or services. Building upon this concept, SBOA aims to find the optimal solution within a given search space, traversing all positions to obtain all possible values. To assesses the feasibility and effectiveness of SBOA in comparison to other algorithms, we conducte

In this paper two ranking functions are employed to treat the fuzzy multiple objective (FMO) programming model, then using two kinds of membership function, the first one is trapezoidal fuzzy (TF) ordinary membership function, the second one is trapezoidal fuzzy weighted membership function. When the objective function is fuzzy, then should transform and shrinkage the fuzzy model to traditional model, finally solving these models to know which one is better