• Journal of the Korea Society of Computer and Information
• /
• v.20 no.5
• /
• pp.1-12
• /
• 2015

NAND flash memory has being used for storage systems widely, because it has good features which are low-price, low-power and fast access speed. However, NAND flash memory has an in-place update problem, and therefore it needs FTL(flash translation layer) to run for applications based on hard disk storage. The FTL includes complex functions, such as address mapping, garbage collection, wear leveling and so on. Futhermore, implementation of the FTL on low-power embedded systems is difficult due to its memory requirements and operation overhead. Accordingly, many index data structures for NAND flash memory have being studied for the embedded systems. Overall performances of the index data structures are enhanced by a decreasing of page write counts, whereas it has increased page read counts, as a side effect. Therefore, we propose an index management method using a page mapping log table in $B^+$-Tree based on NAND flash memory to decrease page write counts and not to increase page read counts. The page mapping log table registers page address information of changed index node and then it is exploited when retrieving records. In our experiment, the proposed method reduces the page read counts about 61% at maximum and the page write counts about 31% at maximum, compared to the related studies of index data structures.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04a
• /
• pp.779-781
• /
• 2003

최근에 제안된 VA-File［6］은 k-NN 질의 처리에서 아주 효율적이라고 알려져 있다. 제시된 방법은 분할된 데이터의 저장 효율성을 보장하지 못하기 때문에 각 차원에 할당된 비트의 수가 증가하면(비트수＝3~5) 할수륵 거의 모든 데이터에 대하여 MBH를 생성하는 단점이 있다. k-NN 질의는 거의 모든 데이터를 순차 검색을 통한 일차적 가지제거작업을 한 후. 질의를 수행하기 위한 디스크 접근을 한다. 따라서, 질의를 수행하기 위한 디스크 접근 횟수는 다른 방법들에 비하여 거의 최적에 가까운 접근 횟수를 가지나 주 기억 장치에서 최소-힘을 이용하여 수행하는 일차적 가지 제거 작업의 오버 로더는 간과되었다. 우리는 기존에 알려진 재귀적으로 공간을 두개의 부 공간으로 분할하는 방법을 사용하여 VA-File 과 같은 디렉토리 자료구조를 구축하여 k-NN 실험을 하였다. 이러한 분할된 MBH의 정방형성을 선호하는 방법은 저장 효율성을 보장한다. 실제 데이터에 대한 실험에서 우리가 실험한 간단한 방법은 디스크 접근 시간 및 CPU 시간을 합한 전체 수행시간에서 VA-File에 비하여 최대 93% 정도의 성능 향상이 있다.

• Korean Journal of Cognitive Science
• /
• v.8 no.4
• /
• pp.1-10
• /
• 1997

The number of basic color names and the corresponding hues used in Korea were investigated. First, we did a field study about the color terms in Korean. Our results identify the color term inventory in Korean and permit a further test of Berlin and Kay's(1969) theory of color universals. Second, 36 subjets performed a color matching task. The matching task allows the referents and the best examplars of each color names to be determined. The hue area and the central hue corresponding to the basic color names were represented in the two dimensional color space. This study provides not only basic materials of Korean color term to psychology and linguistics but also bases for further study to the internal structure of Korean color categories.

• Annual Conference on Human and Language Technology
• /
• 2003.10d
• /
• pp.113-118
• /
• 2003

기존 문서 검색 시스템의 경우 단순히 문서 내에서 텍스트를 추출한 후 그 텍스트를 색인, 검색하는 형태를 가지고 있었다. 본 논문에서는 MS Word, Excel, HWP 등 다양한 형태의 문서에서 텍스트, 표, 이미지, 차트, 동영상 등의 문서 개체를 분석, 색인하고 이를 검색하는 시스템의 개발 방법을 제외하였다. 제안된 시스템은 문서의 내부 자료 구조를 CDML(Composite Document Markup Language)로 변환하고, 이를 색인, 저장함으로 기존의 전문 검색 시스템의 한계를 효과적으로 극복했으며, 문서 내의 검색 대상 개체로 자동 이동하고 하일라이팅 시키는 기술을 구현함으로 사용자 편익성을 높였다. 개발된 시스템의 성능을 평가한 결과, 다양한 문서 형식에 대해 평균 97% 이상의 CDML변환 성공률과 개체 검색 성공률을 보였으며, 이진 파일에서 직접 개체를 추출함으로 매우 높은 분석 및 색인 속도가 달성되었음을 확인할 수 있었다. 본 논문에서 소개된 새로운 패러다임의 문서 검색 솔루션을 통해 다양한 기술적 상업적 파급 효과가 기대되고 있다.

• Journal of the Korean Society for information Management
• /
• v.21 no.1
• /
• pp.93-117
• /
• 2004

This study is to develop a hierarchic clustering model fur document classification and browsing in OPAC systems. Two automatic indexing techniques (with and without controlled terms), two term weighting methods (based on term frequency and binary weight), five similarity coefficients (Dice, Jaccard, Pearson, Cosine, and Squared Euclidean). and three hierarchic clustering algorithms (Between Average Linkage, Within Average Linkage, and Complete Linkage method) were tested on the document collection of 175 books and theses on library and information science. The best document clusters resulted from the Between Average Linkage or Complete Linkage method with Jaccard or Dice coefficient on the automatic indexing with controlled terms in binary vector. The clusters from Between Average Linkage with Jaccard has more likely decimal classification structure.

• Journal of the Korean Society for Library and Information Science
• /
• v.46 no.2
• /
• pp.5-28
• /
• 2012

Great Books of the Western World(GBWW) is a series of books published in 1952 by Encyclopaedia Britannica to present the famous works in 54 volumes. The series is now in its second edition and contains 60 volumes. A syntopicon compiled by M. Adler is a two-volume index, published as volumes 2 and 3 of GBWW. The syntopicon was coined specifically for this undertaking, which means a collection of topics. Syntopicon lists, under each idea, is where every occurrence of the concept can be located in the collection's famous works. This study aims to analyze the structure and utility of topic index, syntopicon in GBWW. The syntopicon consists of 102 chapters on the 102 ideas. Each chapter is broken down into five distinct sections: the introduction, an outline of topics, references, cross-references, and additional readings. The syntopicon can serve as a reference book, as a selection tool of book to be read, instrument of liberal education, instrument of discovery and research, syntopical reading of other reading material, development tool of convergent education, and analysis tool of works.

• The KIPS Transactions:PartD
• /
• v.15D no.1
• /
• pp.23-30
• /
• 2008

The basic research of context aware in ubiquitous environment is an internet technique and XML. The XML data of continuous stream type are popular in network application through the internet. And also there are researches related to query processing for streaming XML data. As a basic research to efficiently query, we propose not only a labeled ordered tree model representing the XML but also a mining method to extract frequent structures from streaming XML data. That is, XML data to continuously be input are modeled by a stream tree which is called by XFP_tree and we exactly extract the frequent structures from the XFP_tree of current window to mine recent data. The proposed method can be applied to the basis of the query processing and index method for XML stream data.

• Proceedings of the Korean Society of Applied Pharmacology
• /
• 1994.04a
• /
• pp.268-268
• /
• 1994

포자의 전자현미경사진과 mycelium의 광학현미경사진을 찍어 strain V-8 균주의 형태학적인 특성을 조사하였을 때 방선균 계열인 streptomyces로 확인되었다. 이 균주의 배양액은 노란색을 띠고 있고 이 노란색은 430 nm에서 특징적인 흡광을 보였다. 이 물질은 유기 용매로 추출되었다. 이 물질의 자외선 흡광스펙트럼의 특징을 기존에 보고된 화합물과 비교하여 이 물질이 actinomycin계열에 속함을 발견하였다. 이 물질의 FAB mass spectrum에서 각 분획들의 주성분들의 분자의 질량 + H 이온이 1290과 1292에서 각각 관찰되었다. 이 화합물들은 분자량이 1258인 actinomycin D와는 상이한 구조를 소유하고 있는 것으로 확인되었다. 각 분획 성분들의 proton 및 carbon HIR spectra를 얻어 기존에 알려진 화합물의 자료와 비교하였을 때 actinomycin계열에 속하는 신물질로 생각되었다. 지금까지 actinomycin 계열의 항생물질이 adenosine deaminase의 효소 활성을 저해한다는 사실은 보고된바 없다. 본 연구자는 분리한 2개의 화합물에 대하여 구조 연구를 계속하고 있다.

• Journal of Korea Spatial Information System Society
• /
• v.7 no.3 s.15
• /
• pp.119-130
• /
• 2005

A spatial data warehouse is a system that stores geographical information as a subject oriented, integrated, time-variant, non-volatile collection for efficiently supporting decision. This system consists of a builder and a spatial data warehouse server. A spatial data warehouse server suspends user services, stores transferred data in the data repository and constructs index using stored data for short response time. Existing methods that construct index are bulk-insertion and index transfer methods. The Bulk-insertion method has high clustering cost for constructing index and searching cost. The Index transfer method has improper for the index reconstruction method of a spatial data warehouse where periodic source data are inserted. In this paper, the efficient index reconstruction method using a partial index in a spatial data warehouse is proposed. This method is an efficient reconstruction method that transfers a partial index and stores a partial index with expecting physical location. This method clusters a spatial data making it suitable to construct index and change treated clusters to a partial index and transfers pages that store a partial index. A spatial data warehouse server reserves sequent physical space of a disk and stores a partial index in the reserved space. Through inserting a partial index into constructed index in a spatial data warehouse server, searching, splitting, remodifing costs are reduced to the minimum.

• The Journal of the Korea Contents Association
• /
• v.20 no.8
• /
• pp.42-53
• /
• 2020

With the development of social network services, graph structures have been utilized to represent relationships among objects in various applications. Recently, a demand of subgraph matching in real-time graph streams has been increased. Therefore, an efficient approximate Top-k subgraph matching scheme for low latency in real-time graph streams is required. In this paper, we propose an approximate Top-k subgraph matching scheme considering data reuse in graph stream environments. The proposed scheme utilizes the distributed stream processing platform, called Storm to handle a large amount of stream data. We also utilize an existing data reuse scheme to decrease stream processing costs. We propose a distance based summary indexing technique to generate Top-k subgraph matching results. The proposed summary indexing technique costs very low since it only stores distances among vertices that are selected in advance. Finally, we provide k subgraph matching results to users by performing an approximate Top-k matching on the summary indexing. In order to show the superiority of the proposed scheme, we conduct various performance evaluations in diverse real world datasets.