• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1996년도 추계학술대회 학술발표 논문집
• /
• pp.186-193
• /
• 1996

This paper presents a fuzzy structural modeling using the concept of Saaty's pairwise comparison matrix. The merit of this approach can be reduced the number of pairwise comparison.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제7권3호
• /
• pp.188-192
• /
• 2007

We characterize a fuzzy pairwise ${\gamma}-irresolute$ continuous mapping on a fuzzy bitopological space.

• ETRI Journal
• /
• 제28권3호
• /
• pp.375-378
• /
• 2006

This letter presents a pairwise key establishment scheme that is robust against the compromise of nodes in mobile ad hoc networks. Each node establishes local keys with its neighbor nodes that are at most three hops away at network boot-up time. When any two nodes establish a pairwise key, they receive the secret information from the nodes on the route between them, and construct the pairwise key using the secret information. Here, the local keys are utilized by the nodes on the route to send the secret information securely. The simulation results have proven that the proposed scheme provides better security than the key pre-distribution-based scheme.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1995년도 추계학술대회 학술발표 논문집
• /
• pp.378-383
• /
• 1995

Kandil[5] introduced and studied the notion of fuzzy bitopological spaces as a natural generalization of fuzzy topological In [10], Sampath Kumar introduced and studied the concepts of ( i, j)-fuzzy semiopen sets, fuzzy pairwise semicontinuous mappings in the fuzzy bitopological spaces. Also, he defined the concepts of ( i, j)-fuzzy -open sets, ( i, j)-fuzzy preopen sets, fuzzy pairwise -continuous mappings and fuzzy pairwise precontinuous mappings in the fuzzy bitopological spaces and studied some of their basic properties. In this paper, we generalize the concepts of fuzzy -open sets, fuzzy -continous mappings ？ 새 Mashhour, Ghanim and Fata Alla[6] into fuzzy bitopological spaces, We first define the concepts of ( i, j)-fuzzy -open sets and then consider the generalizations of fuzzy pairwise -continuous mappings is obtained Besides many basic results, results related to products and graph of mapping are obtained in the fuzzy bitopological spaces.

• 로봇학회논문지
• /
• 제16권3호
• /
• pp.238-244
• /
• 2021

Image mosaicking is a common and useful technique to visualize a global map by stitching a large number of local images obtained from visual surveys in underwater environments. In particular, visual inspection of underwater structures using underwater robots can be a potential application for image mosaicking. Feature-based pairwise image registration is a commonly employed process in most image mosaicking algorithms to estimate visual odometry information between compared images. However, visual features are not always uniformly distributed on the surface of underwater structures, and thus the performance of image registration can vary significantly, which results in unnecessary computations in image matching for poor-conditioned image pairs. This study proposes a pairwise registrability measure to select informative image pairs and to improve the overall computational efficiency of underwater image mosaicking algorithms. The validity and effectiveness of the image mosaicking algorithm considering the pairwise registrability are demonstrated using an experimental dataset obtained with a full-scale ship in a real sea environment.

• Journal of the Korean Data and Information Science Society
• /
• 제28권2호
• /
• pp.309-316
• /
• 2017

야구에서 승률 추정은 매우 중요한 문제이며 현재 이 분야에 대한 연구가 활발하게 진행되고 있다. 쌍별 승률추정은 팀대 팀의 경기결과를 이용하여 전체 승률을 추정하는 방법으로써 각 팀들의 추정된 승률의 합이 상수가 된다는 타당성을 가진다. 본 연구에서는 한국프로야구에서 피타고라스 승률과 선형 승률에 쌍별 추정을 적용하고 효율성을 RMSE와 MAD를 이용하여 살펴보았다. 사용된 데이터는 2013년부터 2016년 사이의 모든 한국프로야구 팀대 팀 기록이며, 그 결과 쌍별 피타고라스 추정이 기존의 방법들보다 RMSE와 MAD 측면에서 바람직하다고 간주되었다. 또한 쌍별 피타고라스 추정에 사용되는 바람직한 지수 값의 결정에 대하여 설명하였으며 추정에 사용된 지수 값의 변화에 따른 RMSE와 MAD의 차이는 크지 않음을 알 수 있었다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권1호
• /
• pp.249-268
• /
• 2014

Relevance feedback is an effective tool to bridge the gap between superficial image contents and medically-relevant sense in content-based medical image retrieval. In this paper, we propose an interactive medical image search framework based on pairwise constraint propagation. The basic idea is to obtain pairwise constraints from user feedback and propagate them to the entire image set to reconstruct the similarity matrix, and then rank medical images on this new manifold. In contrast to most of the algorithms that only concern manifold structure, the proposed method integrates pairwise constraint information in a feedback procedure and resolves the small sample size and the asymmetrical training typically in relevance feedback. We also introduce a long-term feedback strategy for our retrieval tasks. Experiments on two medical image datasets indicate the proposed approach can significantly improve the performance of medical image retrieval. The experiments also indicate that the proposed approach outperforms previous relevance feedback models.

• 정보처리학회논문지C
• /
• 제17C권2호
• /
• pp.165-172
• /
• 2010

다양한 분야에서 응용될 수 있는 센서 네트워크 통신에 안전성을 제공하기 위해서는 센서 노드 간 pairwise 키설정이 기본이 되어야한다. 본 논문에서는 네트워크 필드를 육각형의 클러스터로 나누고 각 센서 노드마다 예상되는 위치에 따라 세 개의 서로 다른 키 정보를 사전에 나누어 주어 노드 배치 후 갖고 있는 정보를 이용하여 모든 이웃 노드와의 pairwise 키를 설정할 수 있도록 한다. 특히 키스트링 기법을 적용하여 이를 클러스터링 정보와 연계되도록 함으로써 적은 양의 정보를 가지고도 이웃한 모든 노드들 간에 pairwise 키를 설정할 수 있도록 하였다. 제안된 키설정 메커니즘을 통하여 필요한 메모리의 양을 줄이면서도 보안 강도를 높일 수 있음을 증명한다.

• 대한수학회보
• /
• 제48권2호
• /
• pp.343-351
• /
• 2011

In this paper, we establish a Marcinkiewicz-Zygmund type strong law for sequences of blockwise and pairwise m-dependent random variables. The sharpness of the results is illustrated by an example.

• 대한수학회논문집
• /
• 제13권2호
• /
• pp.377-384
• /
• 1998

Let ${X_n,n \geq 1}$ be a sequence of stochatically dominated pairwise independent random variables. Let ${a_n, n \geq 1}$ and ${b_n, n \geq 1}$ be seqence of constants such that $a_n \neq 0$ and $0 < b_n \uparrow \infty$. A strong law large numbers of the form $\sum^{n}_{j=1}{a_j X_i//b_n \to 0$ almost surely is obtained.