• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.18 no.5
• /
• pp.155-160
• /
• 2018

In this paper, we found that buffer cache in general systems does not perform well in rendering software, and presented a new buffer cache management scheme that resolves this problem. To do so, we collected various file I/O traces of rending software and analyzed their characteristics. From this analysis, we observed that file I/Os in rendering consist of long loops, short loops, random accesses, and write-once accesses. Based on this observation, we presented a buffer cache management scheme that allocates cache space to each access types and manages them appropriately, thereby improving the buffer cache performances by 19% on average and up to 55%.

• The KIPS Transactions:PartA
• /
• v.9A no.2
• /
• pp.163-170
• /
• 2002

Previous buffer cache schemes for continuous media file system only exploited the sequentiality of continuous media accesses and didn't consider looping references. However, in some video applications like foreign language learning, users mark the scene as loop area and then application automatically playbacks the scene several times. In this paper, we propose a novel buffer cache scheme for continuous media file system that sequential and looping references exist together. Proposed scheme increases the cache hit ratio by detecting reference pattern of files and appling an appropriate replacement policy to each file.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1998.06c
• /
• pp.79-82
• /
• 1998

본 연구에서는 연결단어 음성인식 상에서 올바른 참조 패턴을 생성하기 위해 Levelbuilding 알고리즘을 이용하여 인식대상 단어의 표본 집합(훈련패턴 집합)으로부터 참조 패턴을 자동적으로 생성하는 알고리즘을 개발하였다. 본 연구는 분한 K-Mans 훈련방법에 기초하고 있으며, Levelbuilding 알고리즘을 이용하여 훈련패턴으로부터 참조 패턴을 생성하는 것이다. 먼저 초기화 과정에서 훈련 패턴을 그에 포함된 단어 수만큼 등간격 분리하여 분리된 단어들을 소속 Cluster로 분류하고 각 Cluster의 Center들로 초기 참조패턴을 구성한다. 그리고 참조패턴, 제어정보 및 Levelbuilding 알고리즘을 이용하여 각 훈련패턴을 분리하고, 분리된 단어들을 소속 Cluster로 분류하여 단어 Cluster집합을 구성한 후 DTW 및 minimax알고리즘을 이용해 각 Cluster의 Center를 구하여 참조 패턴을 생성한다. 참조패턴 구성에 변화가 없을 때까지 전 단계의 참조패턴과 본 알고리즘을 반복 수행하여 최적의 참조패턴을 생성한다. 본 알고리즘을 이용하여 3개 숫자의 연결단어 집합으로부터 영('0')에서 구('9')까지 숫자음에 대한 참조패턴을 자동 생성하였다. 참조패턴 생성과정에서 가정 중요한 처리인 훈련패턴 분리과정을 분석하기 위하여 각 반복과정에서 분리된 정보를 그래프로 도시화하여 확인하였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.10
• /
• pp.2091-2101
• /
• 1997

Conventional method for fractal image decoding requires high-degree computational complexity in decoding propocess, because of iterated contractive transformations applied to whole range blocks. In this paper, we propose a fast decoding algorithm of fractal image using data depence in order to reduce computational complexity for iterated contractive transformations. Range of reconstruction image is divided into a region referenced with domain, called referenced range, and a region without reference to domain, called unreferenced range. The referenced range is converged with iterated contractive transformations, and the unreferenced range can be decoded by convergence of the referenced range. Thus the unreferenced range is called data dependence region. We show that the data dependence region can be deconded by one transformation when the referenced range is converged. Consequently, the proposed method reduces computational complexity in decoding process by executing iterated contractive transformations for the referenced range only.

• Journal of Korea Multimedia Society
• /
• v.5 no.1
• /
• pp.47-56
• /
• 2002

Previous buffer cache schemes for multimedia storage systems only exploited the sequential references of multimedia files and didn't consider looping references. However, in some video applications like foreign language learning, users mark the scene as loop area and then application automatically playbacks the scene several times. In this paper, we propose a new buffer replacement scheme, called HBM(Hybrid Buffer Management), for multimedia storage systems that have both sequential and looping references. Proposed scheme assumes that application layer informs reference pattern of files to file system. Then HBM applies an appropriate replacement policy to each file. Our simulation experiments show that HBM outperforms previous buffer cache schemes such as DISTANCE and LRU.

• Annual Conference on Human and Language Technology
• /
• 2009.10a
• /
• pp.197-201
• /
• 2009

이 논문은 영어 문장에서 대명사의 참조해소 시스템을 구현한다. 대명사는 문장에서 반복되는 말 대신에 사용하는 단어이다. 반복되는 말을 선행어라고 하며 대명사는 선행어보다 간결한 형식으로 사용된다. 정보검색이나 정보추출에서 대명사를 그대로 색인하여 검색하면 정확한 정보를 추출할 수 없다. 따라서 대용어가 가리키는 개체를 정확히 파악해서 이 정보를 색인하고 검색하면 정보검색, 정보추출, 질의응답의 성능을 크게 개선할 수 있다. 이 논문에서는 CRF모델을 이용해서 이용하여 영어 문서에서 대명사 참조해결 방법을 제안하고 이를 구현한다.

• Annual Conference on Human and Language Technology
• /
• 1990.11a
• /
• pp.104-111
• /
• 1990

대명사의 종류에 따른 대명사의 어휘적 특성이 대용어 참조해결에 미치는 효과를 살펴보기 위해서 두개의 실험을 수행하였다. 실험 1에서는 대명사 문장의 읽기시간과 선행어에 대한 어휘판단과제를 통해서 복수가 단수에 비해 읽기시간은 빠르지만, 어휘판단시간은 단수가 빠른 경향을 보였다. 그리고 단수는 애매성에 따라 반응시간의 차이를 보였다. 실험 2에서는 단수가 복수에 비해 어휘판단이 빠름을 반복하였다. 그리고 단수는 여전히 성별단서의 애매성에 대한 차이를 보였다. 이러한 결과는 대용어의 참조해결에 미치는 여러 요인 중에서 대명사의 어휘적 특성이 한 요인임을 증명하였다. 결론적으로 대명사의 종류에 따라 참조해결과정이 다르게 일어 날 가능성과 표상되는 글 모형도 달라질 수 있는 가능성을 제시하였다.

• Proceedings of the Korea Contents Association Conference
• /
• 2005.11a
• /
• pp.53-59
• /
• 2005

Reference Standard Data(RSD), which is a very high data of reliability, an authentic data of quality, can be used repetitively in industry, science and technology field. The more RSD is produced and used in various field, the more the level of detail of industry goods and reliability of material rise. It is also the nationally important information resource that improve the technology level of nation and international competitiveness. Before constructing RSD, this paper is used of the source data that recommend RSD's development direction and higher required RSD after we investigate what kind of RSD domestic users require in some field.

• Korean Journal of Cognitive Science
• /
• v.21 no.2
• /
• pp.253-282
• /
• 2010

Two experiments were conducted to explore the effects of anaphora and demonstrative ellipsis on reference resolution. This study assumed that two type of ellipsis could be sensitive to antecedents' saliency: the reverse typicality and mention order of antecedents. The muti-task approach measured the antecedent's activation level and processing load for the conflict resolution of theories of anaphoric resolution. In Experiment 1, using ellipsis for anaphora, participants read a series of sentence pairs by self-paced and performed a probe recognition test. The results showed the main effects of antecedent's typicality and mention order in both tasks. In Experiment 2, using noun phrase without demonstrative for anaphora, participants read a series of sentence pairs by self-paced and performed a probe recognition test. The results showed main effects of mention order of antecedents for probe recognition task only. The first antecedent was recognized faster than the second one. The results of two experiments suggested that anaphora type and antecedent's saliency were dynamically interact in reference resolution for Korean.

• Journal of the Korean Society for Library and Information Science
• /
• v.37 no.4
• /
• pp.131-149
• /
• 2003

Scientific/technical data whose reliability is authorized have to include physical/chemical constants, authorized property value or authorized scientific statistical values so that the scientists in the same field use them continuously and repeatedly for their research. The data also have to be managed as Standard Reference Data that will be used in other area nationwide by analyzing, evaluating and authorizing the accuracy and reliability of the information with scientific methods. This study suggests a plan for establishing the National Center for Standard Reference Data as well as a necessity for managing the data produced in research process as a national Standard Reference Data. Also, a prototype of research information system for measurement standards is developed and described in detail for research information for measurement standard to be used as a reference data, then a plan to managing national reference data is suggested, in addition.