• Journal of Communications and Networks
• /
• v.11 no.5
• /
• pp.480-488
• /
• 2009

Cooperative transmission is an effective solution to improve the performance of wireless communications over fading channels without the need for physical co-located antenna arrays. In this paper, selection combining is used at the destination instead of maximal ratio combing to optimize the structure of destination and to reduce power consumption in selective decode-and-forward relaying networks. For an arbitrary number of relays, an exact and closed-form expression of the bit error rate (BER) is derived for M-PAM, M-QAM, and M-PSK, respectively, in both independent identically distributed and independent but not identically distributed Rayleigh fading channels. A variety of simulations are performed and show that they match exactly with analytic ones. In addition, our results show that the optimum number of relays depend not only on channel conditions (operating SNRs) but also on modulation schemes which to be used.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10c
• /
• pp.574-576
• /
• 2004

현재 Peer-to-Peer (P2P) 파일 공유 시스템은 특정 데이터 항목을 저장한 노드의 위치를 어떻게 효율적으로 찾을 것인가에 대해 연구되고 있다. DHT 기반 구조는 확장 가능하며 정확한 매치(exact-match) 질의가 가능하지만, 정확한 매치가 아닌 질의에 대해서는 효율적이지 못하다. 본 논문은 DT 기반의 P2P 파일 공유 시스템에서 확장 가능한 키워드 기반 파일 검색을 제공하기 위한 메커니즘을 제안한다. 우리의 제안된 구조는 높은 능력을 가진 ' 슈퍼피어 ' 를 둠으로써 많은 파일을 가진 공통 키워드로 인친 발생하는 과도한 저장 공간 소비와 네트워크 트래픽을 감소시킨다.래픽을 감소시킨다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10c
• /
• pp.733-735
• /
• 2002

DNA fragment assembly 프로그램인 Phrap에서는 exact match를 찾기 위해 정렬된 k-글자 테이블 자료구조를 사용한다. 이것은 접미사 배열의 간단한 형태로서, DNA fragment assembly와 같은 응용에서는 접미사 배열보다 더 유용한 자료구조이다. 본 논문에서는 k-글자 테이블을 정렬하는 Manber-Myers, Quicksort, Radix sort 알고리즘을 살펴보고, 실험을 통해 그 중에서 가장 뛰어난 성능을 가지는 것이 Quicksort 알고리즘임을 보였다 또한 k-글자 테이블의 정렬 문제에 있어서는, 캐쉬-메모리 아키텍쳐에 최적화되어 계산복잡도 속에 숨어있는 상수를 최소화하는 것이 중요한 문제임을 밝힌다.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.35.4-35
• /
• 2001

Image detection system for road traffic data analysis is a real time detection system using image processing techniques to get the real-time traffic information which is used for traffic control and analysis. One of the most important functions in this system is to match the coordinates of real world and that of image on video camera. When there in no way to know the exact position of camera and it´s height from the object. If some points on the road of real world are known it is possible to calculate the coordinates of real world from image.

• School Mathematics
• /
• v.11 no.3
• /
• pp.513-526
• /
• 2009

The purpose of this paper intuitively shows the exact and logical explanation of Independent Event and Dependent Event. In actual classrooms, teachers have difficulty in describing the connection between those events and real life. Some teachers have wrong perceptions on the definition of those events. For example, they may not realize exactly what P(B A)=P(B) means and may not explain intuitively the original meaning of why it is independent event. Also they believe that Independent Event and Dependent Event do not always match with real life. This paper, therefore, tries to prove intuitively the exact meanings of those events in the Verbal Form with some examples and it proves that those events exactly match with real life. It is expected that this paper will greatly contribute to the improvement of probability education.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.4C
• /
• pp.321-328
• /
• 2010

A Rayleigh fading channel simulator that realizes given correlation properties between two channels such as downlink/uplink is described. We propose an improved channel simulator that provides more accurate match between reference correlation and simulated one. The proposed channel simulator is based on a sum-of-sinusoids (SOS) method that handles finite sums of weighted sinusoid functions. SOS method is widely accepted in generating fading signals and obtain the exact match with the reference model if infinite number of weighted sinusoids are used. The proposed channel simulator minimizes mean-square-error (MSE) to obtain a close matched correlation properties.

• Journal of Conservation Science
• /
• v.34 no.1
• /
• pp.31-37
• /
• 2018

It was estimated that wooden warehouses excavated from Bongseon-ri site in Seocheon were built around the 5th century according to the soil layers and construction methods of earthen structures. In order to identify the exact date, three wooden materials (BSMG 01, 06, and 12) from wooden warehouses were analyzed through radiocarbon dating using wiggle match. The outermost ring of BSMG 01 produced a radiocarbon date (95.4% confidence interval) of AD 431~551, BSMG 06 produced a date of AD 460~570, and BSMG 12 produced dates of either AD 240~430 or AD 490~510. The common age of the three wooden materials was identified as AD 490-510 and coincided with the original estimated archaeological age. Therefore, this study proved the accuracy of radiocarbon dating using wiggle match.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.3A
• /
• pp.235-239
• /
• 2008

In this paper, we study a simulation model for cooperative MIMO (multiple-input multiple-output) channels and present a cooperative one-ring channel model which is extended from the geometrical one-ring and two-ring scattering models. Assuming that the source, the destination and the relay are surrounded by an infinite number of scatters, we derive a reference model for the cooperative one-ring channel and propose a simulation model based on the reference model provided in the paper. Then we show how modeling parameters of the simulation model are determined to match the correlation functions for the respective models. With numerical investigation, we also show that the correlation functions for the reference and the simulation are well matched.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.10
• /
• pp.1015-1019
• /
• 2010

An extensive research on exact string matching has been done, but there have been few researches on the matching in multi-byte character set texts such as EUC~KR. This paper shows that false matches may occur in multi-byte character set texts such as EUC-KR when using KMP algorithm, and presents a refined KMP algorithm without false matches applying a character-based prefix function. And also, Experimental results show that our algorithm is faster than string matching algorithms of widely used editors, Vim and Emacs, and the existing automata-based algorithm.

• Korean Journal of Cognitive Science
• /
• v.4 no.1
• /
• pp.213-242
• /
• 1993

During the past decades,several automatic indexing systems have been developed such as single term indexing.phrase indexing and thesaurus basedidndexing systems.Among these systems,single term indexing has been known as superior to others despte its simpicity of extracting meaningful terms.On the other hand,thesaurus based one has been conceived as producing low retrival rate ,mainly because thesauri do not usually have enough index terms.so that much of text data fail to be indexed if they do not match with any of index terms in thesauri.This paper develops a thesaurus based indexing system THINS that yields higher retrieval rate than other systems.by doing syntactic analysis of text data and matching them with index terms in thesauri partially.First,the system analyzes the input text syntactically by using the machine translation suystem MATES/EK and extracts noun phrases.After deleting stop words from noun phrases and stemming the remaining ones.it tries to index these with similar index terms in the thesaurus as much as possible. We conduct an experiment with CACM data set that measures the retrieval effectiveness with CACM data set that measures the retrieval effectuvenss of THINS with single term based one under HYKIS-a thesaurus based information retrieval system.It turns out that THINS yields about 10 percent higher precision than single term based one.while shows 8to9 percent lower recall.This retrieval rate shows that THINS improves much better than privious ones that only yields 25 or 30 percent lower precision than single term based one.We also argue that the relatively lower recall is cause by that CRCS-the thesaurus included in CACM datea set is very incomplete one,having only more than one thousand terms,thus THINS is expected to produce much higher rate if it is associated with currently available large thesaurus.