• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04a
• /
• pp.802-804
• /
• 2004

현재 많은 부분에서 모바일을 이용한 다양한 서비스와 그러한 환경을 지원하기 위한 여러 가지 미들웨어를 최적화한 기술들이 선을 보이고 있다. 특히, 썬마이크로시스템즈사에서 제안한 차세대 접속 홈 네트워크 기술인 Jini 는 실세계의 네트워크에 연결된 주변 기기와 응용 프로그램을 사용하고자 하는 서비스에 등록과 동시에 활용 할 수 있는 기술로서 Desktop 환경에서 지원을 하고 있다. 이러한 지원의 조건에 반하여 본 논문에서는 모바일 환경에 적응할 수 있는 새로운 접근 방법을 모색함으로서 모바일 환경에서 동적으로 원격지의 노드를 찾아냄과 동시에 활성화 된 모바일 디바이스를 편리하게 사용 할 수 있게끔, 리스트 정보를 모바일 디바이스에서 보여주어 사용자로 하여금 언제 어디서나 필요한 문서를 찾아낼 수 있는 모바일 File Search 서비스를 설계 및 구현한다.

• Journal of the Korea Computer Industry Society
• /
• v.4 no.12
• /
• pp.1093-1102
• /
• 2003

The dynamic nature of the World Wide Web challenges Search engines to find relevant and recent pages. Obtaining important pages rapidly can be very useful when a crawler cannot visit the entire Web in a reasonable amount of time. In this paper we study way spiders that should visit the URLs in order to obtain more “important” pages first. We define and apply several metrics, ranking formula for improving crawling results. The comparison between our result and Breadth-first Search (BFS) method shows the efficiency of our experiment system.

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.407-410
• /
• 1999

WWW is an important method for retrieving or providing informations. Not only the amount of information but also it is widely located on the web, it is difficult for users to get or search information. Furthermore, to use search engine is also inconvenient, because it just uses a keyword without concerning a user's interest. At this point, we propose a design of web agent that uses the automatic document categorization system and user's profile concerning with a user's interest, so the agent can actively provide a information.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.6
• /
• pp.567-581
• /
• 2008

As the size of the web is growing explosively, search engines are becoming increasingly important as the primary means to retrieve information from the Internet. A search engine periodically downloads web pages and stores them in the database to provide readers with up-to-date search results. The web crawler is a program that downloads and stores web pages for this purpose. A large-scale search engines uses a parallel web crawler to retrieve the collection of web pages maximizing the download rate. However, the service architecture or experimental analysis of parallel web crawlers has not been fully discussed in the literature. In this paper, we propose an architecture of the parallel web crawler and discuss implementation issues in detail. The proposed parallel web crawler is based on the coordinator/agent model using multiple machines to download web pages in parallel. The coordinator/agent model consists of multiple agent machines to collect web pages and a single coordinator machine to manage them. The parallel web crawler consists of three components: a crawling module for collecting web pages, a converting module for transforming the web pages into a database-friendly format, a ranking module for rating web pages based on their relative importance. We explain each component of the parallel web crawler and implementation methods in detail. Finally, we conduct extensive experiments to analyze the effectiveness of the parallel web crawler. The experimental results clarify the merit of our architecture in that the proposed parallel web crawler is scalable to the number of web pages to crawl and the number of machines used.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.10a
• /
• pp.599-602
• /
• 2014

Proposal algorithm in this thesis introduced cells, units of router group, for distributed processing of previous genetic algorithm. This thesis presented ways to reduce search delay time of overall network through cell-based genetic algorithm. With regard to procedures of proposal algorithm, duplicated agents were transferred to the point, where the second, third, and fourth cells were created in order, after the first cell was made, and the agents were engineered to search the shortest path to each cell, and then find the most efficient element through competition.

• Journal of the Korea Society of Computer and Information
• /
• v.5 no.2
• /
• pp.50-59
• /
• 2000

This study aims to design the structure of User Interface Agent System through finding out the user's intention on internet search engine. When building an agent system by using the intelligent method. we can Introduce the RBR system that is generally accepted as an efficient means of solving the problems in Interface Agent System. The RBR system turned out to be a success due to the modularity, uniformity naturalness and the like, but it also has various problems such as bottle-neck in knowledge acquisition, memory absence and limited application. To get rid of such problems, the CBR cycle was introduced in this study.

• The Journal of Information Systems
• /
• v.8 no.2
• /
• pp.91-110
• /
• 1999

Recently, searching agent systems to help purchase of products between business and customer have been actively studied in Electronic Commerce(EC). However, the most of comparative searching agent systems are only provided customers with searching results by the keyword-based search, and is not support the efficient decision models to be selected products considering the customer's requirements. This paper proposes the decision agent system applied decision model as well as searching functions based on the keyword-input to be selected useful products in EC. The proposed decision agent system is consist of the user interface, provider interface, decision model. Especially, as the example of the decision model, this paper is designed and implemented the prototype of decision agent system which is normalized the searching data and value of customer's preference weight as to each attribute, and orderly provided customers with computed results. This agent system is also carried out sensitive analysis according to the reflection ratio of the each attribute.

• Information Systems Review
• /
• v.5 no.1
• /
• pp.97-111
• /
• 2003

With the spread of electronic commerce on the Internet, comparison shopping sites with agent technique are getting popular for the best shopping. However, most consumers are still spending much time to search for the best price through the sites because each of them may show a different price even for the same goods or a site does not show any information about specific goods. Additionally, the search for the best price of the goods like books and CDs may cause the system to be overloaded and the response time to be long due to an on-line real-time search. In this paper, we have designed and implemented a meta-search system for comparison shopping sites with a local database and memory cache to resolve the above problems. The proposed system collects and maintains the price information of popular goods among the comparison shopping sites using several software agents. The experimental results show that our system is an efficient meta-comparison shopping engine and reduces the latency of the response time with little overhead.

• 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.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.11S
• /
• pp.3732-3838
• /
• 2000

As the Internet sites and users have rapidly been increased, the development for search engines has also been accelerated to satisfy users' expectations. As the result, not only the action of collecting documents through many search engines gave hosts workload, but also regular updating all the information is needed since information is newly added. With the circumstances, the necessity of the technology to collect massive information in hosts has been increased for the speed which is a basic requisite of search systems, and for more accurate collection of documents. Also, the role of search engines grows bigger for Internet users' various demands and flexible process through World Wide Web. In this paper, we design and implement a robot agent and a remote control system which doesn't give an excessive workload on a target server and makes the collection of documents done in a short period by considering an average workload rate on the target server and the rate of the workload that a robot experience in collection time, after we compare and analyze the existing Robot Agent Systems and supplement their weak points.