• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1996.10a
• /
• 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
• /
• v.7 no.3
• /
• pp.188-192
• /
• 2007

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

• ETRI Journal
• /
• v.28 no.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.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1995.10b
• /
• 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.

• The Journal of Korea Robotics Society
• /
• v.16 no.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
• /
• v.28 no.2
• /
• pp.309-316
• /
• 2017

In baseball, estimation of winning percentage is critical and many studies for this topic have been actively performed. Pairwise winning percentage estimation using Pythagorean winning percentages of individual teams against other individual teams has the property that the sum of estimated winning percentage totals must be a constant. In this paper, we consider two types of pairwise estimation including linear formula and Pythagorean formula to the Korean baseball data of seasons from 2013 to 2016 under the criterions of RMSE and MAD. In conclusion, pairwise Pythagorean methods have the smaller RMSE and MAD than traditional Pythagorean methods. We suggest the optimal pairwise Pythagorean formula with a fixed exponent. Also we show that there are very little differences of RMSE and MAD between variation in exponent values.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.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.

• The KIPS Transactions:PartC
• /
• v.17C no.2
• /
• pp.165-172
• /
• 2010

Sensor network can be applied in many areas in our life, and security is very important in applying sensor network. For secure sensor communication, pairwise key establishment between sensor nodes is essential. In this paper, we cluster the network field in hexagonal shapes and preassign three different kinds of key information for each sensor according to its expected location. We adopt overlapped key string pool concept for our clustered network architecture and every node uses the part of sub-strings for setting up pairwise keys with all neighboring nodes in its own cluster and from different clusters according to respective position with small amount of information. Our proposal decreases the memory requirement and increases security level efficiently.

• Bulletin of the Korean Mathematical Society
• /
• v.48 no.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.

• Communications of the Korean Mathematical Society
• /
• v.13 no.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.