Related papers: Operations on soft sets revisited

In scientific disciplines such as neuroimaging, climatology, and cosmology it is useful to study the uncertainty of excursion sets of imaging data. While the case of imaging data obtained from a single study condition has already been…

In this paper independent sets of closure operations are introduced. We characterize minimal keys and antikeys of closure operations in terms of independent sets. We establish an expression on the connection between minimal keys and…

The paper develops a novel analysis of mutual interactions between topology and soft topology. It is known that each soft topology produces a system of crisp (parameterized) topologies. The other way round is also possible. Namely, one can…

We review origins and main properties of the most important bracket operations appearing canonically in differential geometry and mathematical physics in the classical, as well as the supergeometric setting. The review is supplemented by a…

We show that in supersymmetric theories, knowing the soft theorem for a single particle in a supermultiplet allows one to immediately determine soft theorems for the remainder of the supermultiplet. While soft theorems in supersymmetric…

This paper further studies the fuzzy rough sets based on fuzzy coverings. We first present the notions of the lower and upper approximation operators based on fuzzy coverings and derive their basic properties. To facilitate the computation…

Mathematica offers, by way of the package Combinatorics, many useful functions to work on graphs and ordered structures, but none of these functions was specific enough to meet the needs of our research group. Moreover, the existing…

A wide variety of models for concurrent programs has been proposed during the past decades, each one focusing on various aspects of computations: trace equivalence, causality between events, conflicts and schedules due to resource accesses,…

The effort invested in a software project is probably one of the most important and most analyzed variables in recent years in the process of project management. The limitation of algorithmic effort prediction models is their inability to…

This letter introduces an abstract learning problem called the "set embedding": The objective is to map sets into probability distributions so as to lose less information. We relate set union and intersection operations with corresponding…

We consider the class of smooth convex functions defined over an open convex set. We show that this class is essentially different than the class of smooth convex functions defined over the entire linear space by exhibiting a function that…

Functions with uniform level sets can represent orders, preference relations or other binary relations and thus turn out to be a tool for scalarization that can be used, e.g., in multicriteria optimization, decision theory, mathematical…

The main aim of this paper is to introduced the operations "Union" and "Intersection," and four operators $O_1, O_2, O_3, O_4 $ on interval-valued hesitant fuzzy soft sets and discuss some of their properties.

Rough sets are approximations of concrete sets. The theory of rough sets has been used widely for data-mining. While it is well-known that adjunctions are underlying in rough approximations, such adjunctions are not enough for…

In this paper, generalised intuitionistic fuzzy soft sets and relations on generalised intuitionistic fuzzy soft sets are defined and a few of their properties are studied. An application of generalised intuitionistic fuzzy soft sets in…

Set functions are functions (or signals) indexed by the powerset (set of all subsets) of a finite set N. They are fundamental and ubiquitous in many application domains and have been used, for example, to formally describe or quantify loss…

Region extraction is a very common task in both Computer Science and Engineering with several applications in object recognition and motion analysis, among others. Most of the literature focuses on regions delimited by straight lines, often…

Set intersection is a fundamental operation in information retrieval and database systems. This paper introduces linear space data structures to represent sets such that their intersection can be computed in a worst-case efficient way. In…

In 1999, Molodtsov initiated the theory of soft sets as a new mathematical tool for dealing with uncertainties in many fields of applied sciences. In 2011, Shabir and Naz introduced and studied the notion of soft topological spaces, also…

We show how recent exact results in supersymmetric theories can be extended to models which include {\it explicit} soft supersymmetry breaking terms. We thus derive new exact results for non-supersymmetric models.