• Bulletin of the Korean Mathematical Society
• /
• v.53 no.5
• /
• pp.1439-1446
• /
• 2016

The execution complexities of the major time memory data tradeoff methods are analyzed in this paper. The multi-target tradeoffs covered are the classical Hellman, distinguished point, and fuzzy rainbow methods, both in their non-perfect and perfect table versions for the latter two methods. We show that their computational complexities are identical to those of the corresponding single-target methods executed under certain matching parameters and conclude that the perfect table fuzzy rainbow tradeoff method is most preferable.

• The Transactions of the Korean Institute of Electrical Engineers C
• /
• v.54 no.5
• /
• pp.218-223
• /
• 2005

Impedance matching characteristics of planar type inductively coupled plasma sources are investigated utilizing the previously reported two-dimensional theory[1] of the anomalous skin effect. Two types of matching networks are considered, and the values of the circuit elements are expressed as functions of various reactor parameter. Also, two cases of perfect and imperfect matching conditions are considered and the functional dependence of the values of matching capacitance and reflection coefficient on the various reactor parameters are investigated using the present circuit model.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10a
• /
• pp.484-489
• /
• 2006

Private Matching은 각기 다른 두 참여자 (two-party)가 가진 데이터의 교집합 (intersection)을 구하는 문제이다. Private matching은 보험사기 방지시스템 (insurance fraud detection system), 의료정보 검색, 항공기 탐승 금지자 목록 (Do-not-fly list) 검색 등에 이용될 수 있으며 다자간의 계산 (multiparty computation)으로 확장하면 전자투표, 온라인 게임 등에도 이용될 수 있다. 2004년 Freedman 등은 이 문제를 확률적 (probabilistic)으로 해결하는 프로토콜 (protocol) [1]을 제안하고 악의적인 공격자 (malicious adversary) 모델과 다자간 계산으로 확장하였다. 이 논문에서는 기존의 프로토콜을 결정적 (deterministic) 방법으로 개선하여 Semi-Honest 모델에서 결과의 정확성을 보장하는 한편, 이를 악의적인 공격자 모델에 확장하여 신뢰도와 연산속도를 향상시키는 새로운 프로토콜을 제안한다.

• Journal of Distribution Science
• /
• v.15 no.7
• /
• pp.35-41
• /
• 2017

Purpose - A product bundling is a marketing approach where multiple products or components are packaged together into one bundle solution. This paper aims to introduce an optimal bundle search problem (hereinafter called "OBSP") which may be embedded with online recommendation system to provide an optimized service considering pairwise discount and delivery cost. Research design, data, and methodology - Online retailers have their own discount policy and it is time consuming for online shoppers to find an optimal bundle. Unlike an online system recommending one item for each search, the OBSP considers multiple items for each search. We propose a mathematical formulation with numerical example for the OBSP and analyzed the complexity of the problem. Results - We provide two results from the complexity analysis. In general case, the OBSP belongs to strongly NP-Hard which means the difficulty of the problem while the special case of OBSP can be solved within polynomial time by transforming the OBSP into the minimum weighted perfect matching problem. Conclusions - In this paper, we propose the OBSP to provide a customized service considering bundling price and delivery cost. The results of research will be embedded with an online recommendation system to help customers for easy and smart online shopping.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.27 no.7
• /
• pp.1110-1119
• /
• 2003

This paper deals with the synthesis of the 3-dimensional grasp planning for unknown objects. Previous studies have many problems, which the estimation time for finding the grasping points is much long and the analysis used the not-perfect 3-dimensional modeling. To overcome these limitations in this paper new algorithm is proposed, which algorithm is achieved by two steps. First step is to find the whole 3-dimensional geometrical modeling for unknown objects by using stereo matching. Second step is to find the optimal grasping points for unknown objects by using the neural network trained by the result of optimization using genetic algorithm. The algorithm is verified by computer simulation, comparing the result between neural network and optimization.

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.733-736
• /
• 1998

In this paper, we propose a new method for content-based retrieval system using wavelet transform and correlation, which has were used in signal processing and image compressing. The matching method is used not perfect matching but similar matching. Used feature vector is the lowest frequency(LL) itself, energy value, and edge information of 4-layer, after computng a 4-layer 2-D fast wavelet transform on image. By the proosed algorithm, we got the result that was faste rand more accurate than the traditional algorithm. Because used feature vector was compressed 256:1 over original image, retrieval speed was highly improved. By using correlation, moving object with size variation was reterieved without additional feature information.

• Journal of Institute of Control, Robotics and Systems
• /
• v.15 no.2
• /
• pp.203-210
• /
• 2009

The problem of outdoor localization can be practically solved by GPS. However, GPS is not perfect and some areas of outdoor navigation should consider other solutions. This research deals with outdoor localization using an elevation map without GPS. This paper proposes a novel feature, elevation moment of inertia (EMOI), which represents the distribution of elevation as a function of distance from a robot in the elevation map. Each cell of an elevation map has its own EMOI, and outdoor localization can be performed by matching EMOIs obtained from the robot and the pre-given elevation map. The experiments and simulations show that the proposed EMOI can be usefully exploited for outdoor localization with an elevation map and this feature can be easily applied to other probabilistic approaches such as Markov localization method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.4
• /
• pp.1594-1617
• /
• 2018

In this paper, we consider a spectrum access scenario which consists of two groups of users, namely Primary Users (PUs) and Secondary Users (SUs) in Cooperative Cognitive Radio Networks (CCRNs). SUs cooperatively relay PUs messages based on Amplify-and-Forward (AF) and Decode-and-Forward (DF) cooperative techniques, in exchange for accessing some of the spectrum for their secondary communications. From the literatures, we found that the Conventional Distributed Algorithm (CDA) and Pragmatic Distributed Algorithm (PDA) aim to maximize the PU sum-rate resulting in a lower sum-rate for the SU. In this contribution, we have investigated a suit of distributed matching algorithms. More specifically, we investigated SU-based CDA (CDA-SU) and SU-based PDA (PDA-SU) that maximize the SU sum-rate. We have also proposed the All User-based PDA (PDA-ALL), for maximizing the sum-rates of both PU and SU groups. A comparative study of CDA, PDA, CDA-SU, PDA-SU and PDA-ALL is conducted, and the strength of each scheme is highlighted. Different schemes may be suitable for different applications. All schemes are investigated under the idealistic scenario involving perfect coding and perfect modulation, as well as under practical scenario involving actual coding and actual modulation. Explicitly, our practical scenario considers the adaptive coded modulation based DF schemes for transmission flexibility and efficiency. More specifically, we have considered the Self-Concatenated Convolutional Code (SECCC), which exhibits low complexity, since it invokes only a single encoder and a single decoder. Furthermore, puncturing has been employed for enhancing the bandwidth efficiency of SECCC. As another enhancement, physical layer security has been applied to our system by introducing a unique Advanced Encryption Standard (AES) based puncturing to our SECCC scheme.

• Speech Sciences
• /
• v.9 no.2
• /
• pp.193-202
• /
• 2002

The purpose of this study is to examine the phonological awareness of hearing impaired children. A number of researches indicate that hearing impaired children have articulation disorders due to their impaired auditory feedback. However, in children who have the ability to distinguish certain phonemes, they sometimes show misarticulation of the phonemes. Phonological awareness refers to recognizing the speech-sound units and their forms in spoken language (Hong, 2001). The subjects who participated in the experiment are composed of four hearing impaired children (3 cochlear implanted children and 1 hearing aided child). Phonological Awareness was evaluated by the test battery developed by Paik et al. (2001). The subtests consisted of rhyme matching, onset matching I II, word initial segmentation and matching I II. If the children asked for retelling, it was retold to a maximum of 4 times. Each item score was 1 point. The results were compared to those of Paik et al. (2001). The results of study were that subject 1 showed superior rhyme matching ability, subjects 2 and 3 fair ability, and subject 4 inferior ability. In onset matching I, all subjects showed inferior ability except for subject 3. Interestingly, subjects 1 showed the lowest onset matching I score. In word initial segmentation and matching I, subjects 1 and 4 showed inferior ability and subjects 2 and 3 showed fair ability. In onset matching II, subject 2 showed the perfect score 10 even though she showed very low score. In word initial segmentation and matching II, only subjects 2 and 3 showed appropriate levels of the skill. The results show that the phonological awareness of hearing impaired children is different from that of normal children.

• Journal of Biomedical Engineering Research
• /
• v.11 no.2
• /
• pp.217-226
• /
• 1990

This paper presents a new algorithm that extracted lung region in X-ray and enhanced the region. With a lung region that was extracted by histogram threshold value, it was diffi cult to detect perfect lung boundary. Therefore we presented perfect lung boundary detection method using apex detection and apex region restoration. Also, by applying modified equalization algorithm and presented function to inside of lung region, we want to give help to automatic diagnosis In X-ray chest image. Presented main line trace algorithm gave good result in detection of lung boundary And, as apex detection method using lung row and column gray level average value found more correct place of lung than the rpethod of prior algorithm, we succeeded perfect lung region detection, Also, presented function that had lung region's gray level distribution characteristic was very effective to image enhancement.