The theory of Topological Space Fiber is a new and essential branch of mathematics, less than three decades old, which is created in forced topologies. It was a very useful tool and played a central role in the theory of symmetry. Furthermore, interdependence is one of the main things considered in topology fiber theory. In this regard, we present the concept of topological spaces α associated with them and study the most important results.
In this paper, the Normality set will be investigated. Then, the study highlights some concepts properties and important results. In addition, it will prove that every operator with normality set has non trivial invariant subspace of .
Unlike fault diagnosis approaches based on the direct analysis of current and voltage signals, this paper proposes a diagnosis of induction motor faults through monitoring the variations in motor's parameters when it is subjected to an open circuit or short circuit faults. These parameters include stator and rotor resistances, self-inductances, and mutual inductance. The genetic algorithm and the trust-region method are used for the estimation process. Simulation results confirm the efficiency of both the genetic algorithm and the trust-region method in estimating the motor parameters; however, better performance in terms of estimation time is obtained when the trust-region method is adopted. The results also show the po
... Show MoreBriefly the term of cyber security is a bunch of operations and procedures working on insurance and protecting the network, computer devices, the programs and data from attack and from damaging penetration, also from breaking, abstraction and disturbing in spite of the fact that the concept of cyber conflict is got widening. So, the needs arise in the state to secure cyberspace and protect it by several methods to confront the electronic intrusions and threats which is known as cyber security. Countries seek to preserve its national security in particular the United States of America after the events of September 11 ,2001. In addition, the United States follow all ways to take over cyber threats.
The study of entry and reentry dynamics for space vehicles is very important, particularly for manned vehicles and vehicles which is carry important devices and which can be used again. There are three types for entry dynamic, ballistics entry, glide entry and skip entry. The skip entry is used in this work for describing entry dynamics and determining trajectory. The inertia coordinate system is used to derive equations of motion and determines initial condition for skip entry. The velocity and drag force for entry vehicle, where generate it during entry into earth’s atmosphere are calculated in this work. Also the deceleration during descending and determining entry angles, velocities ratio and altitude ratio have been studied. The c
... Show MoreThe purchase of a home and access to housing is one of the most important requirements for the life of the individual and the stability of living and the development of the prices of houses in general and in Baghdad in particular affected by several factors, including the basic area of the house, the age of the house, the neighborhood in which the housing is available and the basic services, Where the statistical model SSM model was used to model house prices over a period of time from 2000 to 2018 and forecast until 2025 The research is concerned with enhancing the importance of this model and describing it as a standard and important compared to the models used in the analysis of time series after obtaining the
... Show MoreOur goal in the present paper is to recall the concept of general fuzzy normed space and its basic properties in order to define the adjoint operator of a general fuzzy bounded operator from a general fuzzy normed space V into another general fuzzy normed space U. After that basic properties of the adjoint operator were proved then the definition of fuzzy reflexive general fuzzy normed space was introduced in order to prove that every finite dimensional general fuzzy normed space is fuzzy reflexive.
This paper presents a hybrid approach for solving null values problem; it hybridizes rough set theory with intelligent swarm algorithm. The proposed approach is a supervised learning model. A large set of complete data called learning data is used to find the decision rule sets that then have been used in solving the incomplete data problem. The intelligent swarm algorithm is used for feature selection which represents bees algorithm as heuristic search algorithm combined with rough set theory as evaluation function. Also another feature selection algorithm called ID3 is presented, it works as statistical algorithm instead of intelligent algorithm. A comparison between those two approaches is made in their performance for null values estima
... Show MoreA new type of the connected domination parameters called tadpole domination number of a graph is introduced. Tadpole domination number for some standard graphs is determined, and some bounds for this number are obtained. Additionally, a new graph, finite, simple, undirected and connected, is introduced named weaver graph. Tadpole domination is calculated for this graph with other families of graphs.
The aim of this article is to introduce a new definition of domination number in graphs called hn-domination number denoted by . This paper presents some properties which show the concepts of connected and independent hn-domination. Furthermore, some bounds of these parameters are determined, specifically, the impact on hn-domination parameter is studied thoroughly in this paper when a graph is modified by deleting or adding a vertex or deleting an edge.
Let A ⊆ V(H) of any graph H, every node w of H be labeled using a set of numbers; , where d(w,v) denotes the distance between node w and the node v in H, known as its open A-distance pattern. A graph H is known as the open distance-pattern uniform (odpu)-graph, if there is a nonempty subset A ⊆V(H) together with is the same for all . Here is known as the open distance pattern uniform (odpu-) labeling of the graph H and A is known as an odpu-set of H. The minimum cardinality of vertices in any odpu-set of H, if it exists, will be known as the odpu-number of the graph H. This article gives a characterization of maximal outerplanar-odpu graphs. Also, it establishes that the possible odpu-number of an odpu-maximal outerplanar graph i
... Show More