Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Powiadomienia systemowe

Sesja wygasła!

Znaleziono wyników: 3

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: distances

Sortuj według:

Ogranicz wyniki do:

Szmidt Eulalia, Kacprzyk Janusz, Bujnowski Paweł

Control and Cybernetics

2022

Vol. 51, No. 2

249--266

We discuss some aspects of similarity measures in the context of Atanassov’s intuitionistic fuzzy sets (IFSs, for short). IFSs, proposed in 1983, are a relatively new tool for the modeling and simulation and, because of their construction, present us with new challenges as far the similarity measures are concerned. Specifically, we claim that the distances alone are not a proper measure of similarity for the IFSs. We stress the role of a lack of knowledge concerning elements (options, decisions, etc.) and point out the role of the opposing (complementing) elements. We also pay attention to the fact that it is not justified to talk about similarity when one has not enough knowledge about the compared objects/elements. Some novel measures of similarity are presented.

Advanced Morphological Distances Based on Dilation and Erosion

Dražić Slobodan

Fundamenta Informaticae

2019

Vol. 164, nr 1

17--39

Distances based on morphological operations have shown good performance in a number of applications. Still, the existing erosion and dilation distance for gray scale images can not be computed in all situations. Furthermore, it is possible that dissimilarity between objects which are compared grows strongly, but the value of a mentioned distance does not change. We present a proposition with the necessary and sufficient conditions for computing these morphological distances and discuss drawbacks that they possess. In addition, we propose novel morphological distances, which can be computed in all situations and provide results with desirable properties. The applicability of novel morphological distances is presented in illustrative examples, including their applicability to real data.

On the existence of (k,k-1) - kernels in directed graphs

Bród D., Włoch A., Włoch I.

Journal of Mathematics and Applications

2006

Vol. 28

7-12

We calI a subset J of vertices of a digraph D as a (k, k-1) - kerneI of D, for a fixed k ≥ 2, if all distanees between vertices from J are at Ieast k and the distance from each vertex not belonging to J to the set J is at most k - 1. Some theorems concerning the existence of (k, k - 1) - kernels are proved. The resuIts generalize the well - known Riehardson theorem [9], which says: A digraph without odd circuits has a kernel.