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.

Systems on Chips (SoCs) architecture complexity is result of integrating a large numbers of cores in a single chip. The approaches should address the systems particular challenges such as reliability, performance, and power constraints. Monitoring became a necessary part for testing, debugging and performance evaluations of SoCs at run time, as On-chip monitoring is employed to provide environmental information, such as temperature, voltage, and error data. Real-time system validation is done by exploiting the monitoring to determine the proper operation of a system within the designed parameters. The paper explains the common monitoring operations in SoCs, showing the functionality of thermal, voltage and soft error monitors. The different

DBN Rashid, Journal of Education College Wasit University 1(1):412-423, 2007

Interval methods for verified integration of initial value problems (IVPs) for ODEs have been used for more than 40 years. For many classes of IVPs, these methods have the ability to compute guaranteed error bounds for the flow of an ODE, where traditional methods provide only approximations to a solution. Overestimation, however, is a potential drawback of verified methods. For some problems, the computed error bounds become overly pessimistic, or integration even breaks down. The dependency problem and the wrapping effect are particular sources of overestimations in interval computations. Berz (see [1]) and his co-workers have developed Taylor model methods, which extend interval arithmetic with symbolic computations. The latter is an ef

In this thesis, we study the topological structure in graph theory and various related results. Chapter one, contains fundamental concept of topology and basic definitions about near open sets and give an account of uncertainty rough sets theories also, we introduce the concepts of graph theory. Chapter two, deals with main concepts concerning topological structures using mixed degree systems in graph theory, which is M-space by using the mixed degree systems. In addition, the m-derived graphs, m-open graphs, m-closed graphs, m-interior operators, m-closure operators and M-subspace are defined and studied. In chapter three we study supra-approximation spaces using mixed degree systems and primary object in this chapter are two topological

    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