Fatimah et al. introduced the notion of N-soft set that is extension soft by Molodtsov. Shabir studied bipolarity data within defining bipolar set. During this paper, we have a tendency to encourage and introduce concept N-bipolar as an Some helpful algebraical definitions properties are presented. Our illustrated with real life examples, which uncertainties in knowledge may be properly capture...

Classical structure of rough set theory was first formulated by Z. Pawlak in [6]. The foundation of its object classification is an equivalence binary relation and equivalence classes. The upper and lower approximation operations are two core notions in rough set theory. They can also be seenas a closure operator and an interior operator of the topology induced by an equivalence relation on a u...

The submitted manuscript has been authored by a contractor of the U. S. Government under contract No. DE-AC05-96OR22464. Accordingly, the U.S. Government retains a nonexclusive, royalty-free license to publish or reproduce the published form of this contribution, or allow others to do so, for U.S. Government purposes Abstract-Multilevel power converters that provide more than two levels of volt...

We define the notions of weakly μ-countably compactness and nearly denoted by Wμ-CC Nμ-CC as generalizations μ-compact spaces in sense Csaśzaŕ generalized topological spaces. To obtain a more general setting, we via hereditary classes. Using μθ-open sets, μ-regular open spaces, many results characterizations have been presented. Moreover, use properties functions to investigate effects some typ...

Non-Hermitian skin effects and exceptional points are topological phenomena characterized by integer winding numbers. In this study, we give methods to theoretically detect generalizing inversion symmetry. The generalization of symmetry is unique non-Hermitian systems. We show that parities the numbers can be determined from energy eigenvalues on inversion-invariant momenta when generalized pre...

Many existing token-based, distributed mutual exclusion algorithms can be generalized by a single algorithm. The number of messages required to provide mutual exclusion is dependent upon the logical topology imposed on the nodes and the policy used to forward requests. This paper extends the generalized algorithm to support prioritized requests and presents models that can be used to analyze th...