Brainstorming for keywords is used in retrieving patent documents, but even experienced engineers are irresolute in dealing with this critical issue. The quality of a patent report is usually already determined by the keywords they used in the first step. In order to improve the stumbling stone, this paper demonstrates a newmethod of how to find the significant-rare in a patent database. The re...

The class of ω-closed subsets of a space (X ,τ) was defined to introduce ω-closed functions. The aim of this paper is to introduce and study the class of gω-closed sets. This class of sets is finer than g-closed sets and ω-closed sets. We study the fundamental properties of this class of sets. In the space (X ,τω), the concepts closed set, g-closed set, and gω-closed set coincide. Further, we i...

Recommended by Lokenath Debnath In 1982 and 1970, Hdeib and Levine introduced the notions of ω-closed set and generalized closed set, respectively. The aim of this paper is to provide a relatively new notion of generalized closed set, namely, regular generalized ω-closed, regular generalized ω-continuous, a-ω-continuous, and regular generalized ω-irresolute maps and to study its fundamental pro...

In this paper a new class of sets called αδ-closed set is introduced and its properties are studied. Further the notion of Tαδ –Space and αδ–continuity, Super-αδ-continuity, αδirresoluteness, Strongly-αδ-super-irresoluteness are introduced. Further, we obtain some characterizations and some properties.

Objectives: The goal of this paper is to introduce the ideas Contra soft generalized** (briefly g**). Continuous functions and almost g**) – in topological spaces. Additionally, we discussed some its characteristics. Methods: To obtain definition contra g**- continuous functions, used previously introduced definition(1) (i.e. inverse image every closed set FQ g**-closed FP). Also, regular open ...

We revisit the incompatibility of anonymity and neutrality in single-valued social choice. first analyze irresoluteness outlook these two axioms together with Pareto efficiency impose on choice rules deliver a method to refine irresolute without violating anonymity, neutrality, efficiency. Next, we propose weakening called consequential that requires resolute assign each alternative same number...