• Journal of Korea Spatial Information System Society
• /
• v.10 no.4
• /
• pp.11-19
• /
• 2008

Recently, advances in mobile devices and wireless communication technologies require research on various location-based services. As a result, many studies on processing k-nearest neighbor query, which is most im portant one in location-based services, have been done. Most of existing studies use pre-computation technique to improve retrieval performance by computing network distance between POIs and nodes beforehand in spatial networks. However, they have a drawback that they can not deal with effectively the update of POIs to be searched. In this paper, we propose a distributed grid scheme using S-GRID to overcome the disadvantage of the existing work as well as to manage the location information of a large number of moving objects in efficient way. In addition, we describe a k-nearest neighbor(k-NN) query processing algorithm for the proposed distributed grid scheme. Finally, we show the efficiency of our distributed grid scheme by making a performance comparison between the k-NN query processing algorithm of our scheme and that of S-GRID.

• Bulletin of the Korean Chemical Society
• /
• v.30 no.9
• /
• pp.2061-2065
• /
• 2009

Two simple algorithm modifications are made to the THRASH data retrieval program with the aim of improving analysis speed for complex Fourier transform ion cyclotron resonance (FTICR) mass spectra. Instead of calculating the least-squares fit for every charge state in the backup charge state determination algorithm, only some charge states are pre-selected based on the plausibility values obtained from the FT/Patterson analysis. Second, a modification is made to skip figure-of-merit (FOM) calculations in the central m/z region between two neighboring peaks in isotopic cluster distributions, in which signal intensities are negligible. These combined modifications result in a significant improvement in the analysis speed, which reduces analysis time as much as 50% for ubiquitin (8.6 kDa, 76 amino acids) FTICR MS and MS/MS spectra at the reliability (RL) value = 0.90 and five pre-selected charge states with minimal decreases in data analysis quality (Table 3).

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.2
• /
• pp.117-128
• /
• 2001

In order to achieve optimal retrieval, i.e., to find the best match to a query according to a certain similarity measure, the exhaustive search should be performed literally for all the images in a database. However, the straightforward exhaustive search algorithm is computationally expensive in large image databases. To reduce its heavy computational cost, this paper presents a fast exhaustive multi-resolution search algorithm based on image database clustering. Firstly, the proposed algorithm partitions the whole image data set into a pre-defined number of clusters having similar feature contents. Next, for a given query, it checks the lower bound of distances in each cluster, eliminating disqualified clusters. Then, it only examines the candidates in the remaining clusters. To alleviate unnecessary feature matching operations in the search procedure, the distance inequality property is employed based on a multi-resolution data structure. The proposed algorithm realizes a fast exhaustive multi-resolution search for either the best match or multiple best matches to the query. Using luminance histograms as a feature, we prove that the proposed algorithm guarantees optimal retrieval with high searching speed.

• Korean Business Review
• /
• v.20 no.2
• /
• pp.105-118
• /
• 2007

Recommender system is the tool for E-commerce company based on the internet for increasing their sales ratio in the market. Recommender system suggests the list of items which night be wanted by customers. This list generated by the result of customers' preference prediction through the prediction algorithm automatically. Recommender system will be able to offer not only the important information for marketing strategy but also reduce the cost of customers' information retrieval trough the analysis of customers' purchase patterns and features. But there are several problems like as the extension of the users and items scales and if the recommendation to customers generated by unreliable recommender system makes the customer royalty to the system to weaken. In this study, we propose the criterion for pre-evaluation on the prediction performance only using the preference ratings on the items which are rated by customers before prediction process and we study the features of customers who are classified through this classification criterion.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.2
• /
• pp.723-736
• /
• 2014

This paper proposes a matching engine for a query-by-singing/humming (QbSH) system with polyphonic music files like MP3 files. The pitch sequences extracted from polyphonic recordings may be distorted. So we use chroma-scale representation, pre-processing, compensation, and asymmetric dynamic time warping to reduce the influence of the distortions. From the experiment with 28 hour music DB, the performance of our QbSH system based on polyphonic database is very promising in comparison with the published QbSH system based on monophonic database. It shows 0.725 in MRR(Mean Reciprocal Rank). Our matching engine can be used for the QbSH system based on MIDI DB also and that performance was verified by MIREX 2011.

• International Journal of Internet, Broadcasting and Communication
• /
• v.4 no.1
• /
• pp.13-17
• /
• 2012

Indexing allows converting raw document collection into easily searchable representation. Web searching by Google or Yahoo provides subsecond response time which is made possible by efficient indexing of web-pages over the entire Web. Indexing process gets challenging when the scale gets bigger. Parallel techniques, such as MapReduce framework can assist in efficient large-scale indexing process. In this paper we propose PDFindexer, system for indexing scientific papers in PDF using MapReduce programming model. Unlike Web search engines, our target domain is scientific papers, which has pre-defined structure, such as title, abstract, sections, references. Our proposed system enables parsing scientific papers in PDF recreating their structure and performing efficient distributed indexing with MapReduce framework in a cluster of nodes. We provide the overview of the system, their components and interactions among them. We discuss some issues related with the design of the system and usage of MapReduce in parsing and indexing of large document collection.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.11b
• /
• pp.817-820
• /
• 2003

현재 생물분자의 기능적 관점에서 단백질 구조에 관심이 많이 모아지고 있다. 단백질의 기능은 구조에서 기인하기 때문에 두 단백질의 구조간의 유사성을 측정할 수 있는 방법은 두 단백질의 기능의 유사성을 유추할 수 있다. 본 논문에서는 두 단백질의 원자간 결합선 분포의 유사성을 기반으로 한 웹 환경에서 동작하는 단백질 구조 검색 시스템을 설계 구현하였다. 두 단백질의 구조의 유사성을 측정하기 위한 단백질의 표현(representation)으로는 3 차원 에지 히스토그램을 사용하였다. 3차원 에지 히스토그램, 즉, 3차원 공간 상에서의 원자간 결합선 분포에 기반한 단백질 구조 검색 시스템은 많은 양의 단백질 구조 정보로부터 원하는 형태의 단백질 구조를 빠른 시간에 검색할 수 있는 장점을 가지므로 스크리닝의 전단계(pre-screening)에서 사용될 수 있다.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.24 no.69
• /
• pp.93-106
• /
• 2001

This research includes the prototype development of the master plan title. "National Research and Development Program Integrated Management System". The system collects the information of projects, supports the survey analysis evaluation, and pre budget coordination of national research and development programs, and provide the information service for people about the situation of the national research and development. The results of the research may be used as the base technologies in information service(information retrieval directory service) to manage all programs of national research and development in their life cycle and to allocate resources efficiently to the national research and development in the increasing tendency. tendency.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.4
• /
• pp.933-943
• /
• 1997

In this paper, a conernt-based image retrival system with color assigments has been stueide and implment-ed. The color of images has been extracted after changing RGB color space to HSV(hue, saturation, value)that is the most compatible color for peop]e's feeling. In the color extracting, an image is divided into 9 different areasand 3 major colors for each area are selected by using color histograms. It is possible to chose the class of umages by keywords. We are evaluate four different types of queries such as an image input, keywords with color assignments, combining an image input and keywords with color assinments, and selecting specific part of an umage. Experimental rusults show that four different query types privide precision/recall 0.55/0.37, 0.57/0.43, 0.59/0.45 and 0.63/0.61, respectively. With color assignments, the retrieval system has been able to obtain high performance and validity.

• The KIPS Transactions:PartD
• /
• v.10D no.4
• /
• pp.671-678
• /
• 2003

A digital video is usually very long temporally. requiring large storage capacity. Therefore, users want to watch pre-summarized video before they watch a large long video. Especially in the field of sports video, they want to watch a highlight video. Consequently, highlight video is used that the viewers decide whether it is valuable for them to watch the video or not. This paper proposes how to create soccer video highlight using the structural features of the caption such as temporal and spatial features. Caption frame intervals and caption key frames are extracted by using those structural features. And then, highlight video is created by using scene relocation, logical indexing and highlight creation rule. Finally. retrieval and browsing of highlight and video segment is performed by selection of item on browser.