• Lingua Humanitatis
• /
• v.5
• /
• pp.75-92
• /
• 2003

One of the distinctive features of Korean language is that it has a fine hierarchical regimentation of language uses, perhaps finer than English, Chinese or Japanese. If English language uses have a hierarchical structure they are to be thick. You may respond to any of your male colleagues often by saying either "Yes, Sir" or "Yes, John". But Korean speakers attend to the One grades of differences of social positions of a speaker and a hearer and they show the respect of the difference by adding or dropping relevant suffixes of verbs which Korean language has developed. For example, one yew difference would affect how you choose a suffix of verbs you use to speak to your hearer and two year difference often leads to the adoption of still another fitting suffix of the same verb. One year criterion works not only in 3my barracks, school dormitories but also in government offices. business sectors. Korean speaking people have been taught to use this finely regimented hierarchical language. I try, in this paper, to develop the idea that hierarchical regimentation of Korean language uses is not humane. 1 of for the main argument for the thesis as what follows: How could one justify the hierarchical regimentation of a language like Korean\ulcorner Only if there is an essential structure in which the fine grades of differences of social positions of all the people are distinct; The essentialism here involved is not plausible. And I may add that language is to be used fur the purposes of communication, rationalization and expression. If true, language use is a genuine art of liberation or humanization. Any overt hierarchical language tends to damage those purposes and more to enforce those oppressive elements already existing in the community. Then, a hierarchical language is to defeat its own purpose.

• KIPS Transactions on Computer and Communication Systems
• /
• v.1 no.3
• /
• pp.187-192
• /
• 2012

This paper describes efficient H.264/AVC video scrambling methods for digital rights management. The proposed scrambling methods are to scramble level and suffix in entropy encoding and MVD in motion estimation of the H.264 video compression process. Other scrambling methods have been proposed but they degrade the compression efficiency or make it difficult to achieve real-time processing due to the large amount of computational efforts. Since the proposed scrambling methods resolve the drawbacks of other approaches, they do not cause image distortion and the original compression efficiency is maintained. We verified our scrambling methods and evaluated the performance by conducting several experiments with H.264 reference program. Finally, we implemented video player system using USB dongle in order to apply the proposed scrambling/descrambling methods to H.264 video compression.

• Journal of KIISE:Databases
• /
• v.31 no.6
• /
• pp.650-663
• /
• 2004

In molecular biology, DNA sequence searching is one of the most crucial operations. Since DNA databases contain a huge volume of sequences, a fast indexing mechanism is essential for efficient processing of DNA sequence searches. In this paper, we first identify the problems of the suffix tree in aspects of the storage overhead, search performance, and integration with DBMSs. Then, we propose a new index structure that solves those problems. The proposed index consists of two parts: the primary part represents the trie as bit strings without any pointers, and the secondary part helps fast accesses of the leaf nodes of the trio that need to be accessed for post processing. We also suggest an efficient algorithm based on that index for DNA sequence searching. To verify the superiority of the proposed approach, we conducted a performance evaluation via a series of experiments. The results revealed that the proposed approach, which requires smaller storage space, achieves 13 to 29 times performance improvement over the suffix tree.

• Journal of the Mineralogical Society of Korea
• /
• v.32 no.2
• /
• pp.145-150
• /
• 2019

As the spirit of reconciliation between the two Koreas ripens, the integration of mineral names is required in preparing the reunification between the South and North Koreas. Currently, mineral names in Korean do not adopt the guideline for romanization of Korean that was proposed by the National Institute of the Korean Language (NIKL), and different names are often used for an identical mineral species. Here, for mineral names in Korean, we suggest using (1) the suffix, "$s{\breve{o}}k$", both for metallic and non-metallic minerals, (2) names in the NIKL example-list if available, (3) the suffix "$s{\breve{o}}k$" for minerals whose names are based on the names of persons or localities.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11a
• /
• pp.955-957
• /
• 2005

대용량의 텍스트에 대해 빠른 패턴 검색의 필요성이 증가함에 따라 써픽스 트리, 써픽스 배열 등의 인덱스 자료구조에 대해 다양한 연구들이 진행되었다. 또한 써픽스 배열을 대용량의 인덱스 자료구조로 사용하기 위해 저장 공간을 O(n log n) 비트 이하로 줄이는 문제에 대한 연구들도 많이 수행되었다. 이들 중 Grossi & Vitter 는 써픽스 배열을 압축하여, 기존의 써픽스 배열보다 작은 저장 공간을 사용할 수 있는 알고리즘을 제안하였다. Grossi & Vitter 알고리즘은 압축된 써픽스 배열에서 실제 써픽스 배열의 정보를 찾기 위하여, succinct 표현에서 기본적으로 사용되는 rank와 select 함수를 필요로 한다. 본 논문은 다양한 rank와 select 알고리즘을 각각 사용하는 압축된 써픽스 배열들의 성능 비교를 통해, succinct 표현의 효율적인 구현이 압축된 써픽스 배열의 성능에 미치는 영향을 실험적으로 보인다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06a
• /
• pp.403-405
• /
• 2012

접미사 트리는 문자열 압축, 텍스트 처리, 생물정보학 등 다양한 응용 분야에서 사용되는 인덱스 자료구조이다. 최근 64bit 하드웨어와 멀티코어 CPU가 보급됨에 따라 메모리상에서 병렬로 접미사 트리를 생성하는 알고리즘이 활발히 연구되고 있다. 본 논문에서는 McCreight의 선형시간 알고리즘과 Chen의 병렬 알고리즘을 기반으로 메모리상에서 접미사 트리를 병렬로 생성하는 구현 방법을 보였으며, TBB, Cilk Plus와 같은 병렬 프로그래밍 라이브러리를 이용하여 병렬 알고리즘을 구현하였다. 알고리즘 실험 결과 병렬로 수행한 알고리즘이 직렬로 수행한 결과보다 최대 4배 가량 성능 향상을 얻을 수 있었으며, 병렬 라이브러리를 사용함으로써 가지는 오버헤드는 극히 적은 것으로 나타났다.

• Proceedings of the IEEK Conference
• /
• 2000.09a
• /
• pp.577-580
• /
• 2000

본 논문에서는 비동기식 Zipper 방식의 VDSL(Very High Blt-rate Digital Subscriber Line) 시스템에서 cyclic extension 을 최소화 하는 기법을 제안하고, 전형적인 전화채널 환경 하에서 제안된 방식의 성능을 분석한다. Zipper 방식에서는 각 DMT(discrete-multitone) 블록에cyclic prefix(CP) 와 cyclic suffix(CS)가 추가로 사용되는데, 여기서 CP 는 심볼간 간섭과 부채널간 간섭을 방지하기 위하여 삽입되며, CS는 upstream 과 downstream 부반송파간의 직교성을 유지하기 위하여 추가되어 near-end crosstalk (NEXT)을 방지한다. 이 방식이 동기식 Zipper 방식으로 CS에 의해 NEXT를 제거하기 위해서는 한 binder 내의 모든 송신단의 동기를 맞추어야 한다. 그러나 비동기식 Zipper 방식은 다른 송신단과의 동기가 맞지 않아 CS가 NEXT에 아무런 영향을 주지 못한다 본 논문에서는 CS를 사용하지 않는 비동기식 Zipper 방식의 VDSL 시스템을 제안한다. 컴퓨터 모의실험을 통하여 제안된 방식이 전형적인 채널환경 하에서 기존 Zipper 방식의 VDSL 시스템과 비교하여 비슷한 전송능력을 갖게 됨을 보인다.

• English Language & Literature Teaching
• /
• v.10 no.2
• /
• pp.67-87
• /
• 2004

The purpose of this paper is to show how the coda of a syllable and word-final clusters are represented in the English syllable structure. Previous theories on the syllable assume that there is only one segment in the coda position. And, as we know, the theories that license only one segment in the coda make it difficult to syllabicate the word-final cluster appropriately when more than two segments in the word-final cluster are encountered. I considered three approaches: the previous syllable structure (Selkirk, 1982; Borowsky 1989), sonority sequencing (Giegerich, 1992; Roca, 1999) and feature analysis (Goldsmith, 1990), But, all the considered methods don't give us a satisfactory explanation regarding word-final clusters. Finally, I will suggest a modified syllable representation as an alternative by placing two different appendixes under the Phonological Word which forms a constituent above the syllable node. From this it is possible to explain the former problematic word-final clusters including morphological information asan inflectional suffix in the structure.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2011.01a
• /
• pp.285-288
• /
• 2011

시맨틱 웹상에서 메타 데이터를 표현하는 RDF 데이터에 대한 질의 처리를 위해 여러 가지 RDF 질의어가 제안되었으나 리소스간의 복잡한 관계성들의 발견(discovery)을 위한 충분한 지원을 하지 못하고 있다. 본 논문에서는 시맨틱 연관성 검색 유형의 하나인 ${\rho}$-intersect 연산의 처리 방법을 소개한다. 이를 위해 접미사 배열을 이용한 인덱싱과 ${\rho}$-intersect 연산의 특징을 고려한 최적화 방법을 활용한다. 제안된 처리 기법을 통해 전형적인 RDF 질의 유형뿐만 아니라 시맨틱 연관성 질의 유형도 지원할 수 있도록 한다.

• Journal of Korean Medical classics
• /
• v.22 no.3
• /
• pp.203-209
• /
• 2009

Medicines Research Institute, Wonkwang University, Republic of Korea According to the book "Hwangjenaegyeong(黃帝內經)", Sodan(消癉) is strictly distinguished from 'diabetes' in the category. The former is a name of disease, but the latter means a symptom of 'Sodan.' At first the suffix 'dan' of 'Sodan' means disease, but over time, it had been used as the meaning of 'jaundice' and 'diabetes.' And as Jangjunggyeong(張仲景) applied the concept 'Sodan' to 'diabetes', now the word 'Sodan' has not been used as a name of disease anymore. It shows not only graphical change but also recognitive change regarding diseases. In this study, the applicability of 'diabetes' was expanded by reevaluating the concept 'Sodan', and resultantly, 'Sodan' has been represented in Korean medicine and Chinese medicine.