This paper is concerned with introducing and studying the M-space by using the mixed degree systems which are the core concept in this paper. The necessary and sufficient condition for the equivalence of two reflexive M-spaces is super imposed. In addition, the m-derived graphs, m-open graphs, m-closed graphs, m-interior operators, m-closure operators and M-subspace are introduced. From an M-space, a unique supratopological space is introduced. Furthermore, the m-continuous (m-open and m-closed) functions are defined and the fundamental theorem of the m-continuity is provided. Finally, the m-homeomorphism is defined and some of its properties are investigated.
The research discusses the formal transformation in urban structure, all the cities around the world have undergone a series of formal transformations, resulting in radical transformations to their functions. And to calculate this transformation the descriptive analytical method was applied to this research. First, local urban management data and Landsat-9 visual data were used after processing by GIS. Then, the data were processed mathematically based on their engineering sequences. The aims of this research were as follows: to explore the formal transformations in cities, their dimensions and their consequences and impacts; to identify the underlying causes of their occurrence by deriving realistic results from trends in such degrees of t
... Show MoreThe purpose of this paper is to introduce and study the concepts of fuzzy generalized open sets, fuzzy generalized closed sets, generalized continuous fuzzy proper functions and prove results about these concepts.
Abstract. Fibrewise micro-topological spaces be a useful tool in various branches of mathematics. These mathematical objects are constructed by assigning a micro-topology to each fibre from a fibre bundle. The fibrewise micro-topological space is then formed by taking the direct limit of these individual micro-topological spaces. It can be adapted to analyze various mathematical structures, from algebraic geometry to differential equations. In this study, we delve into the generalizations of fibrewise micro-topological spaces and explore the applications of these abstract structures in different branches of mathematics. This study aims to define the fibrewise micro topological space through the generalizations that we use in this paper, whi
... Show MoreThe aim of this paper is to prove some results for equivalence of moduli of smoothnes in approximation theory , we used a"non uniform" modulus of smoothness and the weighted Ditzian –Totik moduli of smoothness in by spline functions ,several results are obtained .For example , it shown that ,for any the inequality , is satisfied ,finally, similar result for chebyshev partition and weighted Ditzian –Totik moduli of smoothness are also obtained.
The reality of the field of construction projects in Iraq refers to needing for the development of performance in order to improve quality and reduce defects and errors and to control the time and cost, so there is needing for the application of effective methods in this area, one of the methods that can be applied in this area is the manner of Six Sigma. This research aims to enhance the performance and quality improvement for the construction projects by improving performance in the work of the implementation of the concrete structure depending on the Six Sigma methodology, and for the purpose of achieving the aim of the research, the researcher firstly depends on the theoretical study that include the concepts of qual
... Show MoreUsing the Neural network as a type of associative memory will be introduced in this paper through the problem of mobile position estimation where mobile estimate its location depending on the signal strength reach to it from several around base stations where the neural network can be implemented inside the mobile. Traditional methods of time of arrival (TOA) and received signal strength (RSS) are used and compared with two analytical methods, optimal positioning method and average positioning method. The data that are used for training are ideal since they can be obtained based on geometry of CDMA cell topology. The test of the two methods TOA and RSS take many cases through a nonlinear path that MS can move through that region. The result
... Show MoreUsing the Neural network as a type of associative memory will be introduced in this paper through the problem of mobile position estimation where mobile estimate its location depending on the signal strength reach to it from several around base stations where the neural network can be implemented inside the mobile. Traditional methods of time of arrival (TOA) and received signal strength (RSS) are used and compared with two analytical methods, optimal positioning method and average positioning method. The data that are used for training are ideal since they can be obtained based on geometry of CDMA cell topology. The test of the two methods TOA and RSS take many cases through a nonlinear path that MS can move through that region. The result
... Show MoreUsing the Neural network as a type of associative memory will be introduced in this paper through the problem of mobile position estimation where mobile estimate its location depending on the signal strength reach to it from several around base stations where the neural network can be implemented inside the mobile. Traditional methods of time of arrival (TOA) and received signal strength (RSS) are used and compared with two analytical methods, optimal positioning method and average positioning method. The data that are used for training are ideal since they can be obtained based on geometry of CDMA cell topology. The test of the two methods TOA and RSS take many cases through a nonlinear path that MS can move through tha
... Show MoreLet be a non-trivial simple graph. A dominating set in a graph is a set of vertices such that every vertex not in the set is adjacent to at least one vertex in the set. A subset is a minimum neighborhood dominating set if is a dominating set and if for every holds. The minimum cardinality of the minimum neighborhood dominating set of a graph is called as minimum neighborhood dominating number and it is denoted by . A minimum neighborhood dominating set is a dominating set where the intersection of the neighborhoods of all vertices in the set is as small as possible, (i.e., ). The minimum neighborhood dominating number, denoted by , is the minimum cardinality of a minimum neighborhood dominating set. In other words, it is the
... Show More