The definition of semi-preopen sets were first introduced by "Andrijevic" as were is defined by :Let (X , ï´ ) be a topological space, and let A ⊆, then Ais called semi-preopen set if ⊆∘ . In this paper, we study the properties of semi-preopen sets but by another definition which is equivalent to the first definition and we also study the relationships among it and (open, α-open, preopen and semi-p-open )sets.
In this paper, we study a new concept of fuzzy sub-module, called fuzzy socle semi-prime sub-module that is a generalization the concept of semi-prime fuzzy sub-module and fuzzy of approximately semi-prime sub-module in the ordinary sense. This leads us to introduce level property which studies the relation between the ordinary and fuzzy sense of approximately semi-prime sub-module. Also, some of its characteristics and notions such as the intersection, image and external direct sum of fuzzy socle semi-prime sub-modules are introduced. Furthermore, the relation between the fuzzy socle semi-prime sub-module and other types of fuzzy sub-module presented.
Dans la langue française, une forme d'auxiliarité, composée de deux éléments cohérents l'auxiliant et l'auxilié, fournit, en effet, à la phrase une diversité significative et structurale. L'auxiliarité, renvoie à l'unification de deux éléments grammaticaux afin de localiser l'énoncé sur l'axe du temps, d'aspect ou de mode. É. Benveniste définit l'auxiliarité en : « Il s'agit d'une forme linguistique unitaire qui se réalise, à travers des paradigmes entiers, en deux éléments, dont chacun assume une partie des fonctions grammaticales, et qui sont à la fois liés et autonomes, distincts et complémentaires »[1]. Ces deux éléments d'auxiliarité possèden
... Show MoreIn this paper, we will focus to one of the recent applications of PU-algebras in the coding theory, namely the construction of codes by soft sets PU-valued functions. First, we shall introduce the notion of soft sets PU-valued functions on PU-algebra and investigate some of its related properties.Moreover, the codes generated by a soft sets PU-valued function are constructed and several examples are given. Furthermore, example with graphs of binary block code constructed from a soft sets PU-valued function is constructed.
In this paper, the concept of contraction mapping on a -metric space is extended with a consideration on local contraction. As a result, two fixed point theorems were proved for contraction on a closed ball in a complete -metric space.
Astronomy image is regarded main source of information to discover outer space, therefore to know the basic contain for galaxy (Milky way), it was classified using Variable Precision Rough Sets technique to determine the different region within galaxy according different color in the image. From classified image we can determined the percentage for each class and then what is the percentage mean. In this technique a good classified image result and faster time required to done the classification process.
In this work, new kinds of blocking sets in a projective plane over Galois field PG(2,q) can be obtained. These kinds are called the complete blocking set and maximum blocking set. Some results can be obtained about them.
Let h is Γ−(λ,δ) – derivation on prime Γ−near-ring G and K be a nonzero semi-group ideal of G and δ(K) = K, then the purpose of this paper is to prove the following :- (a) If λ is onto on G, λ(K) = K, λ(0) = 0 and h acts like Γ−hom. or acts like anti–Γ−hom. on K, then h(K) = {0}.(b) If h + h is an additive on K, then (G, +) is abelian.