• 제목/요약/키워드: m-sets

검색결과 941건 처리시간 0.027초

Extreme Preservers of Zero-term Rank Sum over Fuzzy Matrices

  • Song, Seok-Zun;Na, Yeon-Jung
    • Kyungpook Mathematical Journal
    • /
    • 제50권4호
    • /
    • pp.465-472
    • /
    • 2010
  • In this paper, we consider two extreme sets of zero-term rank sum of fuzzy matrix pairs: $$\cal{z}_1(\cal{F})=\{(X,Y){\in}\cal{M}_{m,n}(\cal{F})^2{\mid}z(X+Y)=min\{z(X),z(Y)\}\};$$ $$\cal{z}_2(\cal{F})=\{(X,Y){\in}\cal{M}_{m,n}(\cal{F})^2{\mid}z(X+Y)=0\}$$. We characterize the linear operators that preserve these two extreme sets of zero-term rank sum of fuzzy matrix pairs.

지형도와 연속지적도의 가구계 폴리곤 집합간의 N:M 대응쌍 탐색 (Determination of N:M Corresponding Pairs between Block Polygon Sets from a Topographical Map and a Cadastral Map)

  • 허용;김정옥;유기윤
    • 한국공간정보시스템학회 논문지
    • /
    • 제11권3호
    • /
    • pp.47-49
    • /
    • 2009
  • 본 논문은 상이한 추상화 및 일반화 기준에 의하여 지형도와 지적도 사이에서 발생하는 가구계 폴리곤 개체의 입도차로 인하여 발생하는 N:M 대응쌍을 탐색할 수 있는 기법을 제시한다. N:M 대응쌍을 도출하기 위하여 어떤 지도상의 가구계 폴리곤 집합에서 병합이 수행될 폴리곤들은 다른 지도상의 어떤 폴리곤과 유의미한 공간적 중복성을 가져야한다는 가정하에 반복적인 중첩 분석을 수행하였다. 반복 과정은 두 지도 사이에서 각각 병합이 수행된 폴리곤 사이의 공간적 중첩이 1:1 대응쌍의 조건을 만족시킬 경우 종료된다.

  • PDF

A New Class of Similarity Measures for Fuzzy Sets

  • Omran Saleh;Hassaballah M.
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • 제6권2호
    • /
    • pp.100-104
    • /
    • 2006
  • Fuzzy techniques can be applied in many domains of computer vision community. The definition of an adequate similarity measure for measuring the similarity between fuzzy sets is of great importance in the field of image processing, image retrieval and pattern recognition. This paper proposes a new class of the similarity measures. The properties, sensitivity and effectiveness of the proposed measures are investigated and tested on real data. Experimental results show that these similarity measures can provide a useful way for measuring the similarity between fuzzy sets.

γ-Connectedness in fuzzy topological spaces

  • Hanafy, I.M.
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • 제3권2호
    • /
    • pp.258-261
    • /
    • 2003
  • The aim of this paper is to introduce the concept $\gamma$-connectedness in fuzzy topological spaces. We also investigate some interre lations between this types of fuzzy connectedness together with the preservation properties under some types of fuzzy continuity. A comparison between some types of connectedness in fuzzy topological spaces is of interest.

Interval Type-2 Possibilistic Fuzzy C-means 클러스터링을 위한 퍼지화 상수 결정 방법 (Determining the Fuzzifier Values for Interval Type-2 Possibilistic Fuzzy C-means Clustering)

  • 주원희;이정훈
    • 한국지능시스템학회논문지
    • /
    • 제27권2호
    • /
    • pp.99-105
    • /
    • 2017
  • 일반적으로 type-1 fuzzy set 에 존재하는 불확실성을 보다 효율적으로 다루고 제어하기 위하여 Type-2 fuzzy set (T2 FS)이 널리 사용되고 있다. T2 FS에서 퍼지화 상수 (fuzzifier value) m은 이러한 불확실성을 처리하기 위한 가장 중요한 요소이다. 따라서 적절한 퍼지화 상수 값을 결정하는 연구는 여전히 지속되고 있고, 많은 방법들이 연구 되어 왔다. 본 논문에서는 주어진 패턴을 분류하기 위하여 Interval type-2 possibilistic fuzzy C-means (IT2PFCM) 클러스터링 방법을 사용한다. 클러스터링을 위해 사용된 IT2 PFCM 방법에서 각 데이터에 대하여 적응적으로 적절한 퍼지화 상수의 값을 계산하는 방법을 제안한다. 히스토그램 접근법을 통하여 각각의 데이터 포인트로부터 정보를 추출해 내고 추출된 정보를 이용하여 두 개의 퍼지화 상수인 $m_1$, $m_2$. 값을 결정한다. 이렇게 얻어진 값은 interval type-2 fuzzy의 최저 및 최고 멤버쉽 값을 결정하게 된다.

On a Class of γ*-pre-open Sets in Topological Spaces

  • Krishnan, G. Sai Sundara;Saravanakumar, D.;Ganster, M.;Ganster, M.
    • Kyungpook Mathematical Journal
    • /
    • 제54권2호
    • /
    • pp.173-188
    • /
    • 2014
  • In this paper, a new class of open sets, namely ${\gamma}^*$-pre-open sets was introduced and its basic properties were studied. Moreover a new type of topology ${\tau}_{{\gamma}p^*}$ was generated using ${\gamma}^*$-pre-open sets and characterized the resultant topological space (X, ${\tau}_{{\gamma}p^*}$) as ${\gamma}^*$-pre-$T_{\frac{1}{2}}$ space.

COMPUTING THE HAUSDORFF DISTANCE BETWEEN TWO SETS OF PARAMETRIC CURVES

  • Kim, Ik-Sung;McLean, William
    • 대한수학회논문집
    • /
    • 제28권4호
    • /
    • pp.833-850
    • /
    • 2013
  • We present an algorithm for computing the Hausdorff distance between two parametric curves in $\mathbb{R}^n$, or more generally between two sets of parametric curves in $\mathbb{R}^n$. During repeated subdivision of the parameter space, we prune subintervals that cannot contain an optimal point. Typically, our algorithm costs O(logM) operations, compared with O(M) operations for a direct, brute-force method, to achieve an accuracy of $O(M^{-1})$.

SOFT SOMEWHERE DENSE SETS ON SOFT TOPOLOGICAL SPACES

  • Al-shami, Tareq M.
    • 대한수학회논문집
    • /
    • 제33권4호
    • /
    • pp.1341-1356
    • /
    • 2018
  • The author devotes this paper to defining a new class of generalized soft open sets, namely soft somewhere dense sets and to investigating its main features. With the help of examples, we illustrate the relationships between soft somewhere dense sets and some celebrated generalizations of soft open sets, and point out that the soft somewhere dense subsets of a soft hyperconnected space coincide with the non-null soft ${\beta}$-open sets. Also, we give an equivalent condition for the soft csdense sets and verify that every soft set is soft somewhere dense or soft cs-dense. We show that a collection of all soft somewhere dense subsets of a strongly soft hyperconnected space forms a soft filter on the universe set, and this collection with a non-null soft set form a soft topology on the universe set as well. Moreover, we derive some important results such as the property of being a soft somewhere dense set is a soft topological property and the finite product of soft somewhere dense sets is soft somewhere dense. In the end, we point out that the number of soft somewhere dense subsets of infinite soft topological space is infinite, and we present some results which associate soft somewhere dense sets with some soft topological concepts such as soft compact spaces and soft subspaces.