• Journal of Internet Computing and Services
• /
• v.3 no.2
• /
• pp.97-108
• /
• 2002

A user with a specific information need will often need to query several search engines before finding relevant documents. To address the problem of navigating the search engines, agents are used. In general, an agent is a program that can perform a particular task automatically, when appropriate or upon request by another program. In this paper, we design and implement the education information search system for children: using Information gathering agent that is called Edulnfo4k. The information gathering agent periodically visits several portal web sites for children: Ggureogi of Yahoo Korea, Junior of Naver and Gaegujaengi of Hanmir, collects the education or learning information for children, stores the collected information into database. Then, causal users can search the education information for children from database through a uniform user interface, conveniently. As the result, we know that Edulnfo4k provides integrated search without query in several search engines.

• Journal of KIISE:Software and Applications
• /
• v.30 no.7_8
• /
• pp.703-712
• /
• 2003

With the explosive growth n the numbers and sizes of imaging technologies, Content-Based Image Retrieval (CBIR) has been attacked the interests of researchers in the fields of digital libraries, image processing, and database systems. In general, in the case of query-by-image, in user has to select an image from database to query, even though it is not his completely desired one. However, since query-by-sketch approach draws a query shape according to the user´s desire it can provide more high-level searching interface to the user compared to the query-b-image. As a result, query-by-sketch has been widely used. In this paper, we propose a Java-based image retrieval system that consists of sketch query and image classification. We use two features such as color histogram and Haar wavelets coefficients to search similar images. Then the Leave-One-Out method is used to classify database images. The categories of classification are photo & painting, city & nature, and sub-classification of nature image. By using the sketch query and image classification, w can offer convenient image retrieval interface to user and we can also reduce the searching time.

• Journal of the Korea Computer Industry Society
• /
• v.5 no.9
• /
• pp.1025-1030
• /
• 2004

In multimedia database systems, the k nearest neighbor query occurs frerluently and requires the processing cost higher than other spatial queries do. The numberof searched nodes and the computation time in an index can be minimized for optimizing the cost of processing the k nearest neighbor query. In this paper, we propose the search distance which can reduce the computation time of the optimal search distance.

• Journal of Korea Multimedia Society
• /
• v.4 no.4
• /
• pp.287-296
• /
• 2001

This paper proposes an efficient algorithm to select the proper retrieval results from various information sources in Meta search. The algorithm collects and evaluates the related documents to the given query Then, it determines the appropriate retrieval results based on the relevance between the query and the collected documents. This algorithm depends on the Meta information such as the size N of population, top-ranked information of related documents and the precision in order to choose the most appropriate retrieval result.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2002.05a
• /
• pp.230-238
• /
• 2002

기업간 전자거래의 급속한 발전은 선진 각국뿐만 아니라 국내에서도 국가적인 차원에서 전자거래 활성화 방안을 수립하여 진행하고 있다. 그러나, 기업-소비자간 거래(B2C)와는 다르게 기업간 전자거래(B2B)의 활성화를 위해서는 기업의 생산 능력 및 가격, 신뢰성에 근거한 고도의 구조화된 정보를 효율적으로 검색할 수 있는 방법이 요구된다. 이러한 고도의 구조화 된 정보에 기반 한 전자거래를 위해서 정부에서도 지난 2001년 8월 XML기반의 전자 거래를 위한 데이터 교환 모델인 ebXML을 권고안으로 선정한 바가 있다. XML을 활용하여 데이터의 구조에 의미를 부여하는 것은 기업에 달려 있지만, 결과적으로 구축한 데이터를 어떻게 효율적으로 검색하여, 자기 기업에 맞는 최적의 전자 거래 파트너를 찾을 것인가라는 문제는 기업간 전자거래(B2B)의 고도화, 활성화를 위한 필수적인 과제이다. 본 논문의 목표는 ebXML 프레임웍에서 효율적인 거래파트너 검색을 위한 XML 기반의 검색시스템을 개발하는 것이며, 이는 중소기업의 정보화 및 경쟁력 강화에 큰 역할을 할 수 있을 것이라 판단된다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10a
• /
• pp.100-102
• /
• 2003

인터넷의 등장 이후 폭발적으로 증대되는 웹 정보를 효율적으로 사용하기 위한 방안이 연구되고 있다. 현재, 웹 서비스에서 사용하고 있는 키워드 기반 검색은 syntactic 정보만을 제공하므로 원하는 서비스를 받고자하는 사용자의 의도와 상관없는 정보를 탐색하여 서비스한다. 그러나 시멘틱 웹을 기반으로 만들어진 시스템들은 서비스 정보의 질을 향상시키기 위하여 DQL(Daml Query Language)을 이용한 시멘틱 서치(Semantic search)기법을 이용하고 있다. 시멘틱 서치는 사용자가 입력한 질의들을 의미상으로 해석하고, 이를 통하여 사용자의 원하는 정보와 의미가 같은 해답을 얻어내는 것이다. 그러나 기존의 시멘틱 서치는 사용자가 복잡한 질의들을 수작업으로 처리하여 원하는 정보를 탐색해야하고 DQL(Daml Query Language)은 자체 추론 기능을 갖지 않기 때문에 DQL엔진에서 각각의 메타데이터들을 비교하여 사용자의 질의에 맞는 해답을 찾아내야 함으로 시스템 과부하 현상이 일어나게 된다. 본 논문은 이러한 기존의 시멘틱 서치 방식의 효율성과 속도를 놀이기 위하여, 사용자 중심의 키워드 형태 질의를 시스템 중심의 DQL로 변환하는 DQL 컨버터 시스템과 추론엔진을 불러내어 전방향 추론과 단일화를 실행하는 DQL 엔진을 제안한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.04b
• /
• pp.244-246
• /
• 2002

The rapid increase of E-commerce market requires a solution to assist the buyer to find his or her interested items. The intelligent agent model is one of the approaches to help the buyers in purchasing items in outline market. In this paper, the user query processing model in the item recommendation agent is proposed. In the proposed model, the retrieval result is affected by the automatically generated queries from user preference information as well as the queries explicitly given by user. Therefore, the proposed model can provide the customized search results to each user.

• Journal of KIISE:Databases
• /
• v.34 no.2
• /
• pp.166-178
• /
• 2007

The ALE specification of EPCglobal is leading the development of RFID standards, includes the Event Cycle Specification (ECSpec) describing how long a cycle is, how to filter RFID tag data and which reader is interested in. The ECSpec is a specification for filtering and collecting RFID tag data. It is registered to a middleware for long time and is evaluated to return results satisfying the requirements included in it. Thus, it is quite similar to the continuous query. It can be transformed into a continuous query as its predicate in WHERE clause is characterized by the long interval. Long intervals cause problems deteriorating insertion and search performance of existing query indices. In this paper, we propose a TLC-index as a new query index structure for long interval data. The TLC-index has hybrid structure that uses the cell construct of CQI-index with the virtual construct of VCR-index for partitioning long intervals. The TLC-index can reduce the storage cost and improve the insertion performance through decomposing long intervals into one or more cell constructs that have long size. It can also improve the search performance through decomposing short intervals into one or more virtual constructs that have short size enough to fit into those intervals.

• Journal of KIISE:Information Networking
• /
• v.35 no.4
• /
• pp.251-267
• /
• 2008

In this paper, we present a distributed topology control algorithm for constructing an optimized topology having a minimal search-time in unstructured peer-to-peer network. According to the proposed algorithm, each node selects the best nodes having higher hit-ratio than other nodes as many as the number being exponentially proportional to the hit-ratio of the node itself, and then it connects to them. The ensemble behavior of the proposed algorithm is very similar to the recrystrallizing phenomenon that is observed in nature. There is a partial order relationship among the hit-ratios of most nodes of constructed topology. Therefore once query message visits a node, it has a higher hit-ratio than the node that was visited last by the message. The query message even sent from freeloader can escape to the node having high hit-ratio by one hop forwarding, and it never revisits any freeloader again. Thus the search can be completed within a limited search time. We also propose the Chain-reactive search scheme using the constructed topology. Such a controlled multicasting reduces the query messages by 43 percent compared to that of the naive Gnutella using broadcasting, while it saves the search time by 94 percent. The search success rate of the proposed scheme is 99 percent.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.1
• /
• pp.11-20
• /
• 2008