Related papers: Fuzzy Group Identification Problems
In this paper, we propose a variational multiphase image segmentation model based on fuzzy membership functions and L1-norm fidelity. Then we apply the alternating direction method of multipliers to solve an equivalent problem. All the…
We study certain types of Fuchsian groups of the first kind denoted by $R(N)$, which coincide with the Fricke groups or the arithmetic Hecke triangle groups of low levels. We find all elliptic points and cusps of $R(p)$ for a prime $p$, and…
The notion of intuitionistic fuzzy sets was introduced by Atanassov as a generalization of the notion of fuzzy sets. Y.B. Jun and S.Z. Song introduced the notion of intuitionistic fuzzy points. In this paper we find some relations between…
This paper develops a category-theoretic approach to uncertainty, informativeness and decision-making problems. It is based on appropriate first order fuzzy logic in which not only logical connectives but also quantifiers have fuzzy…
In several research areas, ratings data and response times have been successfully used to unfold the stage-wise process through which human raters provide their responses to questionnaires and social surveys. A limitation of the standard…
Let $N$ be a finitely generated nilpotent group. Algorithm is constructed such, that for every automorphism $\phi \in Aut(N)$ defines the Reidemeister number $R(\phi).$ It is proved that any free nilpotent group of rank $r = 2$ or $r = 3$…
We consider semigroup algorithmic problems in the Special Affine group $\mathsf{SA}(2, \mathbb{Z}) = \mathbb{Z}^2 \rtimes \mathsf{SL}(2, \mathbb{Z})$, which is the group of affine transformations of the lattice $\mathbb{Z}^2$ that preserve…
The quantum Fourier transform (QFT) is central to many quantum algorithms, yet its necessity is not always well understood. We re-examine its role in canonical query problems. The Deutsch-Jozsa algorithm requires neither a QFT nor a domain…
The analysis of remote discussions is not yet at the same level as the face-to-face ones. The present paper aspires twofold. On the one hand, it attempts to establish a suitable environment of interaction and collaboration among learners by…
Clustering is an extensive research area in data science. The aim of clustering is to discover groups and to identify interesting patterns in datasets. Crisp (hard) clustering considers that each data point belongs to one and only one…
Hesitant fuzzy sets find extensive application in specific scenarios involving uncertainty and hesitation. In the context of set theory, the concept of inclusion relationship holds significant importance as a fundamental definition.…
In this paper we address the problem of fuzzy measures index calculation. On the basis of fuzzy sets, Murofushi and Soneda proposed an interaction index to deal with the relations between two individuals. This index was later extended in a…
A cuspidal automorphic representation \pi of a group G is said to to be distinguished with respect to a subgroup H if the integral of f along H is nonzero for a cusp form f in the space of \pi. Such period integrals are related to…
With the membership function being strictly positive, the conventional fuzzy c-means clustering method sometimes causes imbalanced influence when clusters of vastly different sizes exist. That is, an outstandingly large cluster drags to its…
Person re-identification is best known as the problem of associating a single person that is observed from one or more disjoint cameras. The existing literature has mainly addressed such an issue, neglecting the fact that people usually…
In the paper, we show that quantum logic of linear subspaces can be used for recognition of random signals by a Bayesian energy discriminant classifier. The energy distribution on linear subspaces is described by the correlation matrix of…
A diverse collection of fusion categories may be realized by the representation theory of quantum groups. There is substantial literature where one will find detailed constructions of quantum groups, and proofs of the…
In clustering problems, a central decision-maker is given a complete metric graph over vertices and must provide a clustering of vertices that minimizes some objective function. In fair clustering problems, vertices are endowed with a color…
A collector wishes to collect $m$ complete sets of $N$ distinct coupons. The draws from the population are considered to be independent and identical distributed with replacement, and the probability that a type-$j$ coupon is drawn is noted…
Notwithstanding known obstructions to this idea, we formulate an attempt to turn quantization into a functorial procedure. We define a category PO of Poisson manifolds, whose objects are integrable Poisson manifolds and whose arrows are…