Results 21 to 30 of about 1,158,111 (278)
Another View on Picture Fuzzy Soft Sets and Their Product Operations with Soft Decision-Making
Cuong [Picture Fuzzy Sets, Journal of Computer Science and Cybernetics 30 (4) (2014) 409–420] has introduced the concept of picture fuzzy soft sets (pfs-sets) relying on his definition and operations of picture fuzzy sets (pf -sets), in which there exist
Samet Memiş
doaj +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Soft X-ray spectral variations of the narrow line Seyfert l galaxy Markarian 766 [PDF]
The X-ray variability of the narrow-line Seyfert 1 galaxy Markarian 766 is studied using nine ROSAT PSPC data sets. The spectrum is well described by a power law combined with a blackbody (kT ∼ 70 eV) soft excess.
Antonucci +68 more
core +2 more sources
Weighted Neutrosophic Soft Sets [PDF]
In this paper we study the concept of neutrosophic soft sets. Imposing some weights on the parameters considered we introduce here weighted neutrosophic soft sets. Some operations like union, intersection, complement, AND, OR etc.
Pabitra Kumar Maji
doaj
Some geometrical methods for constructing contradiction measures on Atanassov's intuitionistic fuzzy sets [PDF]
Trillas et al. (1999, Soft computing, 3 (4), 197–199) and Trillas and Cubillo (1999, On non-contradictory input/output couples in Zadeh's CRI proceeding, 28–32) introduced the study of contradiction in the framework of fuzzy logic because of the ...
Blyth T. +12 more
core +2 more sources
AbstractThis article defines ranked soft sets and establishes their fundamental theory. This new model of uncertain knowledge is a non‐numerical yet powerful improvement of soft sets. The model relies on a qualitative improvement of the basic parameterized description posed by soft sets.
Gustavo Santos‐García +1 more
openaire +1 more source
Algebraic structures and lattice properties of hypergraph Pre-Rough sets [PDF]
The study introduces and examines the concept of hypergraph pre-rough sets, which are developed by combining minimum soft descriptions with hypergraph structures.
Ganesan Gomathi +3 more
doaj +1 more source
Between the Classes of Soft Open Sets and Soft Omega Open Sets
In this paper, we define the class of soft ω0-open sets. We show that this class forms a soft topology that is strictly between the classes of soft open sets and soft ω-open sets, and we provide some sufficient conditions for the equality of the three ...
Samer Al Ghour
doaj +1 more source
The most persistent soft-clique in a set of sampled graphs [PDF]
When searching for characteristic subpatterns in potentially noisy graph data, it appears self-evident that having multiple observations would be better than having just one.
Quadrianto, Novi +2 more
core +3 more sources
AbstractMolodtsov (1999) introduced the concept of soft sets in [1]. Then, Maji et al. (2003) defined some operations on soft sets in [2]. Aktaş and Çaǧman (2007) defined the notion of soft groups in [3]. Finally, soft semirings are defined by Feng et al. (2008) in [5]. In this paper, we have introduced initial concepts of soft rings.
Tanay, Bekir +2 more
openaire +2 more sources

