• Journal of information and communication convergence engineering
• /
• 제16권3호
• /
• pp.142-147
• /
• 2018

We present a practical design algorithm for quantizers at nodes in distributed systems in which each local measurement is quantized without communication between nodes and transmitted to a fusion node that conducts estimation of the parameter of interest. The benefits of vector quantization (VQ) motivate us to incorporate the VQ strategy into our design and we propose a low-complexity design technique that seeks to assign vector codewords into sets such that each codeword in the sets should be closest to its associated local codeword. In doing so, we introduce new distance metrics to measure the distance between vector codewords and local ones and construct the sets of vector codewords at each node to minimize the average distance, resulting in an efficient and independent encoding of the vector codewords. Through extensive experiments, we show that the proposed algorithm can maintain comparable performance with a substantially reduced design complexity.

• Journal of applied mathematics & informatics
• /
• 제34권3_4호
• /
• pp.341-354
• /
• 2016

In this paper, the exact formulae for the generalized product degree distance, reciprocal product degree distance and product degree distance of tensor product of a connected graph and the complete multipartite graph with partite sets of sizes m₀, m₁, ⋯ , m_r−1 are obtained.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2003년도 ISIS 2003
• /
• pp.543-546
• /
• 2003

Representation and quantification of fuzziness are required for the uncertain system modelling and controller design. Conventional results show that entropy of fuzzy sets represent the fuzziness of fuzzy sets. In this literature, the relations of fuzzy enropy, distance measure and similarity measure are discussed, and distance measure is proposed. With the help of relations of fuzzy entropy, distance measure and similarity measure, fuzzy entropy is proposed by the distance measure. Finally, proposed entropy is applied to measure the fault signal of induction machine.

• 한국정보과학회논문지:데이타베이스
• /
• 제27권2호
• /
• pp.238-246
• /
• 2000

R 트리와 같은 다차원 인덱스로 구성된 2개의 공간 데이타 집합들에 대하여 거리가 가까운 순서대로 점진적으로 객체 쌍을 찾는 거리조인(distance join) 알고리즘이 이전에 제안된 바 있다. 본 논문에서는 찾고자 하는 객체 쌍의 개수 K를 미리 정할 때 거리 우선순위 큐를 이용한 효율적인 K-거리조인 기법을 제안한다. 특히 양쪽 노드 확장 방식과 스위핑 축 및 방향의 선택 기법을 이용한 최적화된 평면 스위핑 가지치기 기법을 통한 거리조인 알고리즘을 개발한다. 실제 지리정보 데이타 집합을 가지고 실험을 수행하여 본 논문에서 제안한 알고리즘이 기존의 알고리즘들보다 좋은 성능을 나타냄을 확인한다.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2007년도 춘계학술대회 학술발표 논문집 제17권 제1호
• /
• pp.175-178
• /
• 2007

We give a geometrical interpretation of the interval-valued fuzzy set. So, based on the geometrical background, we propose new distance measures between interval-valued fuzzy sets and compare these measures with distance measures proposed by Burillo and Bustince and Grzegorzewski, respectively. Furthermore, we extend three methods for measuring distances between interval-valued fuzzy sets to interval-valued intuitionistic fuzzy sets.

• 한국지능시스템학회논문지
• /
• 제19권5호
• /
• pp.603-608
• /
• 2009

본 논문에서는 구간값 모호집합 사이의 유사척도를 제안한다. 구간값 모호집합에서는 모호집합의 상한과 하한을 각각 구간값 퍼지집합의 구간으로 표현한다. 제안한 유사척도는 구간값 모호집합 사이의 유사척도를 평가하기 위해 기하학적 거리와 구간값 모호집합 사이의 중심점 개념을 결합한다. 우리는 제안한 유사척도에 대한 세 가지 속성도 증명한다. 제안한 방법은 구간값 모호집합 사이의 유사정도를 측정하는 유용한 방법을 제공한다.

• East Asian mathematical journal
• /
• 제24권1호
• /
• pp.111-123
• /
• 2008

In this paper, we introduce a new system of first-order impulsive fuzzy differential equations. By using Banach fixed point theorem, we obtain some new existence and uniqueness theorems of solutions for this system of first-order impulsive fuzzy differential equations in the metric space of normal fuzzy convex sets with distance given by maximum of the Hausdorff distance between level sets.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2005년도 추계학술대회 학술발표 논문집 제15권 제2호
• /
• pp.121-124
• /
• 2005

퍼지측도와 관련된 폐집합치 쇼케이적분에 대해 장에 의해 연구되어 왔음을 알 수 있다. 본 논문에서는 컴팩트 집합치 함수의 쇼케이적분을 생각하고 이와 관련된 성질들을 조사한다. 특히, 구간치 함수 대신에 컴팩트 집합치 함수를 이용하여 컴팩트 집합치 쇼케이적분의 특성들을 조사한다.

• 전자공학회논문지C
• /
• 제34C권2호
• /
• pp.71-79
• /
• 1997

In this paper, we propose a new nearest-neighbor classifier with reduced computational complexity in search process. In the proposed classifier, the classes are divided into two sets: reference and non-reference sets. It reduces computational requriement by approximating the distance between the input and a class iwth the information of distances among the calsses. It calculates only the distance between the input and the reference classes. We convert a given classifier into RCC (reduced computational complexity but smal lincrease in misclassification probability of its corresponding RCC classifier. We designed RCC classifiers for the recognition of digits from the NIST database. We obtained an RCC classifier with 60% reduction in the computational complexity with the cost of 0.5% increase in misclassification probability.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제9권4호
• /
• pp.269-274
• /
• 2009

Measuring uncertainty for fuzzy sets has been carried out by calculating fuzzy entropy. Fuzzy entropy of fuzzy set is derived with the help of distance measure. The distance proportional value between the fuzzy set and the corresponding crisp set is designed as the fuzzy entropy. The usefulness is verified by proving the proposed entropy. Generally, fuzzy entropy contains the complementary characteristics that the fuzzy entropies of fuzzy set and complementary fuzzy set have the same entropies. Discrepancy that low fuzzy entropy did not guarantee the data certainty was overcome by modifying fuzzy entropy formulation. Obtained fuzzy entropy is analyzed and discussed through simple example.