Throughout this paper R represents commutative ring with identity and M is a unitary left R-module. The purpose of this paper is to investigate some new results (up to our knowledge) on the concept of weak essential submodules which introduced by Muna A. Ahmed, where a submodule N of an R-module M is called weak essential, if N ? P ? (0) for each nonzero semiprime submodule P of M. In this paper we rewrite this definition in another formula. Some new definitions are introduced and various properties of weak essential submodules are considered.

In this paper we define and study new concepts of functions on fibrewise  topological spaces  over  B namely,  fibrewise  weakly  (resp., closure, strongly) continuoac; funttions which are analogous of weakly

(resp., closure,   strongly)   continuous  functions   and  the  main  result is   : Let  <p       : XY  be a fibrewise  closure  (resp.,  weakly,  closure, strongly,  strongly) continuous function,  where  Y  is fibrewise topological  space  over  B and  X  is  a  fibrewise set  which  has  the

in

Throughout this paper R represents commutative ring with identity and M is a unitary left R-module. The purpose of this paper is to investigate some new results (up to our knowledge) on the concept of weak essential submodules which introduced by Muna A. Ahmed, where a submodule N of an R-module M is called weak essential, if N ? P ? (0) for each nonzero semiprime submodule P of M. In this paper we rewrite this definition in another formula. Some new definitions are introduced and various properties of weak essential submodules are considered.

    The definition of semi-preopen sets were first introduced by "Andrijevic" as were is defined by :Let (X ,  ) be a topological space, and let  A ⊆,    then Ais called semi-preopen set if ⊆∘ .        In this paper, we study the properties of semi-preopen sets but by another  definition which is equivalent to the first definition and we also study the relationships among it and (open, α-open, preopen and semi-p-open )sets.

A class of hyperrings known as divisible hyperrings will be studied in this paper. It will be presented as each element in this hyperring is a divisible element. Also shows the relationship between the Jacobsen Radical, and the set of invertible elements and gets some results, and linked these results with the divisible hyperring. After going through the concept of divisible hypermodule that presented 2017, later in 2022, the concept of the divisible hyperring will be related to the concept of division hyperring, where each division hyperring is divisible and the converse is achieved under conditions that will be explained in the theorem 3.14. At the end of this paper, it will be clear that the goal of this paper is to study the concept

Czerwi’nski et al. introduced Lucky labeling in 2009 and Akbari et al and A.Nellai Murugan et al studied it further. Czerwi’nski defined Lucky Number of graph as follows: A labeling of vertices of a graph G is called a Lucky labeling if  for every pair of adjacent vertices u and v in G where . A graph G may admit any number of lucky labelings. The least integer k for which a graph G has a lucky labeling from the set 1, 2, k is the lucky number of G denoted by η(G). This paper aims to determine the lucky number of Complete graph K_n, Complete bipartite graph K_m,n and Complete tripartite graph K_l,m,n. It has also been studied how the lucky number changes whi

      The definition of semi-preopen sets were first introduced by "Andrijevic" as were is defined by :Let (X ,  ) be a topological space, and let  A ⊆,    then A is called semi-preopen set if ⊆∘ .        In this paper, we study the properties of semi-preopen sets but by another  definition which is equivalent to the first definition and we also study the relationships among it and (open, α-open, preopen and semi-p-open )sets.

In recent years, the world witnessed a rapid growth in attacks on the internet which resulted in deficiencies in networks performances. The growth was in both quantity and versatility of the attacks. To cope with this, new detection techniques are required especially the ones that use Artificial Intelligence techniques such as machine learning based intrusion detection and prevention systems. Many machine learning models are used to deal with intrusion detection and each has its own pros and cons and this is where this paper falls in, performance analysis of different Machine Learning Models for Intrusion Detection Systems based on supervised machine learning algorithms. Using Python Scikit-Learn library KNN, Support Ve

Several  amine  liquid selective  electrodes  were prepared based on

two  active   materials,   phenol  sulfonic   acid  and   l ,2-dihydroxy-3,5- disulfonic  acid   disodium   salt   with  several   plasticizers,  di-n-butyl phthalate(ORPH),  tri-n-butyl   phosphate   (TBP)   and  a-nitro   phenyl octyl  ether   (NPOE).   Electrode   parameters   were  studied   including, concentration range,  detection  limit,  slope,  life  time,  response  time and