This dissertation depends on study of the topological structure in graph theory as well as introduce some concerning concepts, and generalization them into new topological spaces constructed using elements of graph. Thus, it is required presenting some theorems, propositions, and corollaries that are available in resources and proof which are not available. Moreover, studying some relationships between many concepts and examining their equivalence property like locally connectedness, convexity, intervals, and compactness. In addition, introducing the concepts of weaker separation axioms in α-topological spaces than the standard once like, α-feebly Hausdorff, α-feebly regular, and α-feebly normal and studying their properties. Furthermore, providing the necessary condition for α-feebly normality property to become hereditary. Also, using a new topological model for graphs are the edges represented as points which enables us to express in a topological language about combinatorial concepts. Moreover, showing that an α-connected orderable spaces are exactly α-topologized graphs. Finally, realizing the relationship between the α-topology on the vertex set and the once on the whole space by α-feebly regularity property.
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 More
(7)
(3)
(21)
(16)
(64)
(58)
(2)
Abstract. This study gives a comprehensive analysis of the properties and interactions of fibrewise maximal and minimal topological spaces. Fibrewise topology extends classical topological concepts to structured spaces, providing a thorough understanding of spaces that vary across different dimensions. We study the basic theories, crucial properties, and characterizations of maximal and minimal fibrewise topological spaces. We investigate their role in different mathematical contexts and draw connections with related topological concepts. By providing exact mathematical formulations and comprehensive examples, this abstract advances the fields of topology and mathematical analysis by elucidating the unique properties and implications of fib
... Show More
The Gaussian orthogonal ensemble (GOE) version of the random matrix theory (RMT) has been used to study the level density following up the proton interaction with 44Ca, 48Ti and 56Fe.
A promising analysis method has been implemented based on the available data of the resonance spacing, where widths are associated with Porter Thomas distribution. The calculated level density for the compound nuclei 45Sc,49Vand 57Co shows a parity and spin dependence, where for Sc a discrepancy in level density distinguished from this analysis probably due to the spin misassignment .The present results show an acceptable agreement with the combinatorial method of level density.
... Show More
Our country suffered from pollution translation as a result to the wars events, so, it is necessary to measure the amount of radiation in the fields that are of indirect contact with human life and health. The main aim of the present work is to measure the concentration of alpha emitters in tomato fruits collected from different farms in Al – Basra governorate in the south of Iraq. Nuclear track detectors of type CR – 39 are used as a detection device and Can technique as a detection technique. Results show that the maximum concentration recorded is sample no.7 of site Al – Rafidhya which was equal to (6.9621 ± 0.111) ppm and sample no.1 of site Lothan with concentration equals to (4.9236 ± 0.117) ppm. The minimum concentratio
... Show More
(8)
(7)
Recent years have seen an explosion in graph data from a variety of scientific, social and technological fields. From these fields, emotion recognition is an interesting research area because it finds many applications in real life such as in effective social robotics to increase the interactivity of the robot with human, driver safety during driving, pain monitoring during surgery etc. A novel facial emotion recognition based on graph mining has been proposed in this paper to make a paradigm shift in the way of representing the face region, where the face region is represented as a graph of nodes and edges and the gSpan frequent sub-graphs mining algorithm is used to find the frequent sub-structures in the graph database of each emotion. T
... Show More
(48)
(39)