The aim of this thesis is to introduce a new concept of fibrewise topological spaces which is said to be fibrewise slightly topological spaces. We generalize some of the main results that have been reached from fibrewise topology into fibrewise slightly topological space. We introduce the concepts of fibrewise slightly closed, fibrewise slightly open, fibrewise locally sliceable, and fibrewise locally sectionable slightly topological spaces. Also, state and prove several propositions related to these concepts. On the other hand, extend separation axioms of ordinary topology into fibrewise setting. The separation axioms are said to be fibrewise slightly T_0 spaces, fibrewise slightly T_1 spaces, fibrewise slightly R_0 spaces, fibrewise s

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. Furthermor

Our goal in this work is to describe the structure of a class of bimodal self maps on the compact real interval I with zero topological entropy and transitive.

We define and study new ideas of fibrewise topological space namely fibrewise multi-topological space . We also submit the relevance of fibrewise closed and open topological space . Also fibrewise multi-locally sliceable and fibrewise multi-locally section able multi-topological space . Furthermore, we propose and prove a number of statements about these ideas. On the other hand, extend separation axioms of ordinary topology into fibrewise setting. The separation axioms are said to be fibrewise multi-T0. spaces, fibrewise multi-T1spaces, fibrewise multi-R0 spaces, fibrewise multi-Hausdorff spaces, fibrewise multi-functionally Hausdorff spaces, fibrewise multi-regular spaces, fibrewise multi-completely regular spaces, fibrewise multi-normal

In this paper, a new idea to configure a special graph from the discrete topological space is given. Several properties and bounds of this topological graph are introduced. Such that if the order of the non-empty set equals two, then the topological graph is isomorphic to the complete graph. If the order equals three, then the topological graph is isomorphic to the complement of the cycle graph. Our topological graph has  complete induced subgraphs with order  or more. It also has a cycle subgraph. In addition, the clique number is obtained. The topological graph is proved simple, undirected, connected graph. It has no pendant vertex, no isolated vertex and no cut vertex. The minimum and maximum degrees are evaluated. So , the radius 

The main objective of this paper is to designed algorithms and implemented in the construction of the main program designated for the determination the tenser product of representation for the special linear group.

The functional properties of the defatted powder and protein isolate of germinated mung bean seeds were studied and the estimation of the amino acids was carried out. The results showed a significant increase in the values of the amino acids leucine, lysine, phenylalanine and valine. The results of studying the functional properties of the protein isolate and defatted powder showed that there were significant differences between the sample The defatted and protein isolate, if the water absorption capacity of the defatted mung powder was 2.5% water/gm protein and the water absorption capacity of the protein isolate was 3%ml water/g protein, the fat binding capacity of the defatted powder was 0.3 ml fat/g protein and the isolate The ratio was

Recent researches showed that DNA encoding and pattern matching can be used for the intrusion-detection system (IDS), with results of high rate of attack detection. The evaluation of these intrusion detection systems is based on datasets that are generated decades ago. However, numerous studies outlined that these datasets neither inclusively reflect the network traffic, nor the modern low footprint attacks, and do not cover the current network threat environment. In this paper, a new DNA encoding for misuse IDS based on UNSW-NB15 dataset is proposed. The proposed system is performed by building a DNA encoding for all values of 49 attributes. Then attack keys (based on attack signatures) are extracted and, finally, Raita algorithm is app