In this paper we define and study new generalizations of continuous functions namely, -weakly (resp., w-closure, w-strongly) continuous and the main properties are studies: (a) If f : X®Y is w-weakly (resp., w-closure, w-strongly) continuous, then for any AÌX and any BÌY the restrictions fïA : A®Y and fB : f -1(B)®B are w-weakly (resp., w-closure, w-strongly) continuous. (b) Comparison between deferent forms of generalizations of continuous functions. (c) Relationship between compositions of deferent forms of generalizations of continuous functions. Moreover, we expanded the above generalizations and namely almost w-weakly (resp., w-closure, w-strongly) continuous functions and we state and prove several results concerning it.

The importance of topology as a tool in preference theory is what motivates this study in which we characterize topologies generating by digraphs. In this paper, we generalized the notions of rough set concepts using two topological structures generated by out (resp. in)-degree sets of vertices on general digraph. New types of topological rough sets are initiated and studied using new types of topological sets. Some properties of topological rough approximations are studied by many propositions.

In this thesis, we introduced the simply* compact spaces which are defined over simply* open set, and study relation between the simply* separation axioms and the compactness were studied and study a new types of functions known as αS^(M* )- irresolte , αS^(M* )- continuous and R S^(M* )- continuous, which are defined between two topological spaces. On the other hand we use the class of soft simply open set to define a new types of separation axioms in soft topological spaces and we introduce the concept of soft simply compactness and study it. We explain and discuss some new concepts in soft topological spaces such as soft simply separated, soft simply disjoint, soft simply division, soft simply limit point and we define soft simply c

In this paper, we define some generalizations of topological group namely -topological group, -topological group and -topological group with illustrative examples. Also, we define grill topological group with respect to a grill. Later, we deliberate the quotient on generalizations of topological group in particular -topological group. Moreover, we model a robotic system which relays on the quotient of -topological group.

This paper deals with constructing mixed probability distribution from mixing exponential

In this paper, we introduce the concepts of positive implicative [resp. implicative and commutative] Γ-KU-algebras, and obtain their some properties (including characterizations) respectively and some relationships among them. Next, we propose the notions of positive implicative [resp. implicative and commutative] Γ-ideals of a Γ-KU-algebra, and deal with their some properties (including characterizations) respectively and some relationships among them. Finally, we define a topological Γ-KU-algebra and discuss its various topological structures.

Inˑthis work, we introduce the algebraic structure of semigroup with KU-algebra is called KU-semigroup and then we investigate some basic properties of this structure. We define the KU-semigroup and several examples are presented. Also,we study some types of ideals in this concept such as S-ideal,k- ideal and P-ideal.The relations between these types of ideals are discussed and few results for product S-ideals of product KU-semigroups are given. Furthermore, few results of some ideals in KU-semigroup under homomorphism are discussed.

  The great scientific progress has led to widespread Information as information accumulates in large databases is important in trying to revise and compile this vast amount of data and, where its purpose to extract hidden information or classified data under their relations with each other in order to take advantage of them for technical purposes.

      And work with data mining (DM) is appropriate in this area because of the importance of research in the (K-Means) algorithm for clustering data in fact applied with effect can be observed in variables by changing the sample size (n) and the number of clusters (K)