In this paper, certain types of regularity of topological spaces have been highlighted, which fall within the study of generalizations of separation axioms. One of the important axioms of separation is what is called regularity, and the spaces that have this property are not few, and the most important of these spaces are Euclidean spaces. Therefore, limiting this important concept to topology is within a narrow framework, which necessitates the use of generalized open sets to obtain more good characteristics and preserve the properties achieved in general topology. Perhaps the reader will realize through the research that our generalization preserved most of the characteristics, the most important of which is the hereditary property. Two types of regular spaces have been presented, namely the topological space Rp and the topological space S-Rp. The properties of these two spaces and their relationship with each other, as well as the effect of functions on them, have been studied. In addition several theorems have been proved regarding the sufficient and necessary conditions to make the topological spaces Rp-regular or S-Rp-regular. The above concepts have been linked with a new type of Hausdorff space and the concepts under study are reinforced with examples.
An R-module M is called a 2-regular module if every submodule N of M is 2-pure submodule, where a submodule N of M is 2-pure in M if for every ideal I of R, I2MN = I2N, [1]. This paper is a continuation of [1]. We give some conditions to characterize this class of modules, also many relationships with other related concepts are introduced.
This paper introduce two types of edge degrees (line degree and near line degree) and total edge degrees (total line degree and total near line degree) of an edge in a fuzzy semigraph, where a fuzzy semigraph is defined as (V, σ, μ, η) defined on a semigraph G* in which σ : V → [0, 1], μ : VxV → [0, 1] and η : X → [0, 1] satisfy the conditions that for all the vertices u, v in the vertex set, μ(u, v) ≤ σ(u) ᴧ σ(v) and η(e) = μ(u1, u2) ᴧ μ(u2, u3) ᴧ … ᴧ μ(un-1, un) ≤ σ(u1) ᴧ σ(un), if e = (u1, u2, …, un), n ≥ 2 is an edge in the semigraph G
... Show MoreIn this paper we introduce new class of open sets called weak N-open sets and we study the relation between N-open sets , weak N-open sets and some other open sets. We prove several results about them.
A new class of generalized open sets in a topological space, called G-open sets, is introduced and studied. This class contains all semi-open, preopen, b-open and semi-preopen sets. It is proved that the topology generated by G-open sets contains the topology generated by preopen,b-open and semi-preopen sets respectively.
This study intends to examine the efficiency of student-centered learning (SCL) through Google classroom in enhancing the readiness of fourth stage females’ pre-service teachers. The research employs a quasi-experimental design with a control and experimental group to compare the teaching readiness of participants before and after the intervention. The participants were 30 of fourth stage students at the University of Baghdad - College of Education for Women/the department of English and data were collected through observation checklist to assess their teaching experience and questionnaires to assess their perceptions towards using Google Classroom. Two sections were selected, C as a control group and D as the experimental one each with (
... Show MoreThis paper devoted to the analysis of regular singular initial value problems for ordinary differential equations with a singularity of the first kind , we propose semi - analytic technique using two point osculatory interpolation to construct polynomial solution, and discussion behavior of the solution in the neighborhood of the regular singular points and its numerical approximation, two examples are presented to demonstrate the applicability and efficiency of the methods. Finally , we discuss behavior of the solution in the neighborhood of the singularity point which appears to perform satisfactorily for singular problems.
The main purpose of this paper is to study feebly open and feebly closed mappings and we proved several results about that by using some concepts of topological feebly open and feebly closed sets , semi open (- closed ) set , gs-(sg-) closed set and composition of mappings.
The aim of this research is to study some types of fibrewise fuzzy topological spaces. The six major goals are explored in this thesis. The very first goal, introduce and study the notions types of fibrewise topological spaces, namely fibrewise fuzzy j-topological spaces, Also, we introduce the concepts of fibrewise j-closed fuzzy topological spaces, fibrewise j-open fuzzy topological spaces, fibrewise locally sliceable fuzzy j-topological spaces and fibrewise locally sectionable fuzzy j-topological spaces. Furthermore, we state and prove several Theorems concerning these concepts, where j={δ,θ,α,p,s,b,β} The second goal is to introduce weak and strong forms of fibrewise fuzzy ω-topological spaces, namely the fibrewise fuz
... Show MoreA submoduleA of amodule M is said to be strongly pure , if for each finite subset {ai} in A , (equivalently, for each a ?A) there exists ahomomorphism f : M ?A such that f(ai) = ai, ?i(f(a)=a).A module M is said to be strongly F–regular if each submodule of M is strongly pure .The main purpose of this paper is to develop the properties of strongly F–regular modules and study modules with the property that the intersection of any two strongly pure submodules is strongly pure .
Most companies use social media data for business. Sentiment analysis automatically gathers analyses and summarizes this type of data. Managing unstructured social media data is difficult. Noisy data is a challenge to sentiment analysis. Since over 50% of the sentiment analysis process is data pre-processing, processing big social media data is challenging too. If pre-processing is carried out correctly, data accuracy may improve. Also, sentiment analysis workflow is highly dependent. Because no pre-processing technique works well in all situations or with all data sources, choosing the most important ones is crucial. Prioritization is an excellent technique for choosing the most important ones. As one of many Multi-Criteria Decision Mak
... Show More