• Journal of the Korean Society for information Management
• /
• v.25 no.2
• /
• pp.199-221
• /
• 2008

The purpose of this study is to investigate the characteristics of indexes by human and machine, and differences between them in terms of term identification in a fulltext environment. A back-of-book index and two indexes produced by two term identifiers (LinkIt and Termer) as pseudo-indexing systems for a whole body of a monograph are examined. In the investigation, the traditional contrast between manual and automatic indexing is confirmed in fulltext environment, manual index is for browsing and human use, and automatic index is for searching and machine use. The border between them, however, becomes vague. Some considerations for the use of the term identifiers for browsing and for searching are discussed, and further research for the use of the term identifier is suggested.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.9 no.3
• /
• pp.145-153
• /
• 2013

Multimedia contents' searching methods in existing mobile computer environment tend to be brought with many over heads when attempting to search data in large bulks. The MINT system has been studied to resolve such problem. However, MINT system delivers many over heads by searching multimedia contents through applying B-Tree. The suggested method is said to be CST-MCR searching system based on CST-Tree. The specific characteristic of this method is improved MINT system by applying CST-Tree's index. The result of capacity evaluation came out with improved capacity of 4.27% from MINT system and CST-MCR methods in average. Conclusively, it has been proven that the suggested method is superior.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.20 no.11
• /
• pp.1209-1216
• /
• 2009

This paper presents an efficient Quantized Equal Gain Transmission(QEGT) codebook index searching technique for MISO beamforming system in a Rayleigh flat fading channel. The searching time for the optimum weight vector among the codebook vectors increases exponentially when the codebook size increases linearly, although the bit error rate decreases. So, newly defined simple metric is proposed for fast searching, which determines a few candidates. Then the conventional method combined with accurate search algorithm selects the optimal index. This strategy significantly reduces the overall search time, while maintaining almost the same bit error rate performance. Furthermore, as the codebook size increases, the search time is considerably decreased compared to that of the conventional approach.

• Asia-Pacific Journal of Business
• /
• v.8 no.1
• /
• pp.67-77
• /
• 2017

The purpose of this study was to analysis Korean market competitiveness of Chinese metal items. Methods of analysis were Market Share Index, Market Comparative Advantage. The data was collected through Korean Materials & Components Technology Network and period of analysis were 2009-2016. Chinese main 6 metal items which recorded high-ranked export sum and exported to Korea in 2009-2016. From this study, following results were found. i) In searching trade balance aspects through MSI, highly ranked Chinese metal items in Korea market were steel rolling, pressing&elongation products, steel tubes, steel casting industry. ii) In searching market advantage aspects through MCA, Chinese metal items have strong competitiveness in Korea market. especially, steel rolling, pressing & elongation products, steel tubes, steel casting industry had strong competitiveness in Korea Market. In conclusion, we found that most of Chines metal items have competitiveness in Korea market. Especially, steel rolling, pressing & elongation products had very strong competitiveness in Korea market.

• The KIPS Transactions:PartD
• /
• v.9D no.6
• /
• pp.1025-1042
• /
• 2002

The goal of this study is to generate a structured document which improves the performance of an information retrieval system by using thesaurus, information on relations between words (terms), and to study on the technique for searching this structured document. In order to accomplish this goal, we propose a DODI (Depth -Oriented Decomposition Index) technique for the structured document and an algorithm to search for related information efficient]y through this index technique that uses a thesaurus. We establish a storage system by which the structured document generated by this index technique is saved in a database through OpenXML and XML documents are generated through ForXML methods.

• ETRI Journal
• /
• v.27 no.6
• /
• pp.806-809
• /
• 2005

The main goal of this research is automatic video analysis using a face recognition technique. In this paper, an automatic video management system is introduced with a variety of functions enabled, such as index, edit, summarize, and retrieve multimedia data. The automatic management tool utilizes MPEG-7 visual descriptors to generate a video index for creating a summary. The resulting index generates a preview of a movie, and allows non-linear access with thumbnails. In addition, the index supports the searching of shots similar to a desired one within saved video sequences. Moreover, a face recognition technique is utilized to personalbased video summarization and indexing in stored video data.

• Journal of KIISE:Databases
• /
• v.31 no.6
• /
• pp.641-649
• /
• 2004

The relationship between chemical structures and biological activities is researched briskly in the area of 'Medicinal Chemistry' At the base of these structure-based drug design tries, medicinal chemists search the existing drugs of similar chemical structure to target drug for the development of a new drug. Therefore, it is such necessary that an automatic system selects drug files that have a set of chemical moieties matching a user-defined query moiety. Substructure searching is the process of identifying a set of chemical moieties that match a specific query moiety. Testing for substructure searching was developed in the late 1950s. In graph theoretical terms, this problem corresponds to determining which graphs in a set are subgraph isomorphic to a specified query moiety. Testing for subgraph isomorphism has been proved, in the general case, to be an NP- complete problem. For the purpose of overcoming this difficulty, there were computational approaches. On the 1990s, a US patent has been granted on an atom-centered indexing scheme, used by the RS3 system; this has the virtue that the indexes generated can be searched by direct text comparison. This system is commercially used(http://www.acelrys.com/rs3). We define the RS3 system's drawback and present a new indexing scheme. The RS3 system treats substructure searching with substring matching by means of expressing chemical structure aspredefined strings. However, it has insufficient 'rerall' and 'precision‘ because it is impossible to index structures uniquely for same atom and same bond. To resolve this problem, we make the minimum-cost- spanning tree for one centered atom and describe a structure with paths per levels. Expressing 2D chemical structure into 1D a string has limit. Therefore, we break 2D chemical structure into 1D structure fragments. We present in this paper a new index technique to improve recall and precision surprisingly.

• The Journal of Society for e-Business Studies
• /
• v.1 no.1
• /
• pp.195-207
• /
• 1996

It is required the electronic commerce system for satisfying the various information needs of user groups on the high speed communication networking. However, its information amounts will be explosive, and make it difficult for users to locate information they are interested in. Therefore we have developed the architecture of information searching platform for electronic commerce which searches and gathers information about electronic commerce site on internet and builds the keywords index database for serving the client's requests in order to provide non-professionals and small companies etc., with access easily to retrieval information.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2004.05a
• /
• pp.640-643
• /
• 2004

기하급수적으로 증가하고 있는 방대한 양의 데이터를 효율적으로 저장하고, 검색하기 위한 방법으로 압축된 인덱스 자료구조(compressed index data structure)가 제안되었고 현재 활발히 연구되고 있다. 압축된 인덱스 자료구조란 데이터를 적절한 방법으로 색인화(indexing)하여 이를 압축(compression)된 자료구조로 저장하여, 데이터 검색의 성능저하 없이, 저장 공간을 줄일 수 있는 방법이다. 본 논문에서는 대표적인 방법으로 Ferragina와 Manzini가 제시한 FM-index를 다룬다. 이 방법을 구현하여 전체적인 성능에 영향을 미치는 요소들을 실험을 통해 분석하였다. 이를 통하여 각 파라미터들의 상관관계를 분석하고 이상적인 설정 값을 실험하였다.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.61 no.7
• /
• pp.944-949
• /
• 2012

As modern power systems become large and complicated, the automated voltage and reactive power control system is required in most developed countries due to the recent amazing progress of computer net works and information thechnology. So far the voltage control has been depend on human operator in korean power system. This paper presents an intelligent voltage control system based on sensitivity analysis and artificial intelligence technology. Detailed state space modeling technique is discussed and a new performance index is proposed to speed up the searching performance of the expert system. As the searching strategy is very important factor of the speed of expert system the least first search algorithm is applied using this performance index. The intelligent voltage control system is applied to the Jeju power system. As a result, case studies showed a promissing application of the intelligent voltage control system.