• The Journal of Society for e-Business Studies
• /
• v.6 no.2
• /
• pp.87-99
• /
• 2001

Along with the rapid emergence of the Internet and e-commerce, online auctions are hitting the spotlights. The inconveniences found in off-line auctions, such as time and place restriction and limited number of items, are solved in the online auction. However, not so many auction sites have integrated auction information systems, which monitor the present status of auctions, resulting in greater inconvenience for the online auction users. Moreover, there is no auction site that suggests the appropriate starting or closing price that is useful for users when they make, their bids, What the online auction users need is an auction system that can solve such problems. This study is purported for solving the problems by designing and implementing a real time auction system that applies the comparison search functions and the agent functions. In other words, an integrated database system using a bidder-oriented agent for providing information is built so that the users can search and compare the information on the item they are interested in and make a faster and more accurate purchase. Also the appropriate starting and closing prices are offered to the sellers and bidders through the integrated system for a closer and more accurate comparison and analysis of the prices. For future work, the product recommendation service, which accurately reflects the bidding patterns, and the methods for studying the multi bidding pattern will be applied to the suggested system to realize a real time auction information system that supports CRM(Customer Relationship Management) .

• Journal of Intelligence and Information Systems
• /
• v.11 no.1
• /
• pp.153-167
• /
• 2005

In this paper, we consider the problem of exploring unknown environments with a mobile robot or an autonomous character agent. Traditionally, research efforts to address the space exploration problem havefocused on the graph-based space representations and the graph search algorithms. Recently EXPLORE, one of the most efficient search algorithms, has been discovered. It traverses at most min$min(mn, d^2+m)$ edges where d is the deficiency of a edges and n is the number of edges and n is the number of vertices. In this paper, we propose DFS-RTA* and DFS-PHA*, two real-time graph search algorithms for directing an autonomous agent to explore in an unknown space. These algorithms are all built upon the simple depth-first search (DFS) like EXPLORE. However, they adopt different real-time shortest path-finding methods for fast backtracking to the latest node, RTA* and PHA*, respectively. Through some experiments using Unreal Tournament, a 3D online game environment, and KGBot, an intelligent character agent, we analyze completeness and efficiency of two algorithms.

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

• The Journal of Society for e-Business Studies
• /
• v.8 no.2
• /
• pp.23-31
• /
• 2003

Link-based search engines generate the rank using linked information of related web-documents . HITS(Hypertext Internet Topic Search), representative ranking evaluation algorithm using a special feature of web-documents based on such link, evaluates the importance degree of related pages from linked information and presents by ranking information. Problem of such HITS algorithm only is considered the link frequency within documents and depends on the set of web documents as input value. In this paper, we design the search agent based on better HITS algorithm according to advanced suitability between query and search-result in the set of given documents from link-based web search engine. It then complements locality of advanced search performance and result.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2001.01a
• /
• pp.169-175
• /
• 2001

It is not easy for business workers to find proper information for his job, because of the following problems:(1) information exist in various information system both internal and external with diverse formats(2) he cannot estimate relevance of all the information and (3) he cannot select proper information among large volume of information. The requirements for the systems are the following things:(1) search of relevant information from various internal and external information systems(2) proving an integrated view of information for workers, and (3) information processing and decision-making are seamlessly integrated fro business workers. We proposed an agent system to fulfill the requirements. We focus on the purchasing job, and developed a prototype system. PIPA(Purchasing Information Process Agent). The PIPA performs not only information processing jobs(information search gathering, display, business form -making)but also decision-making support job (evaluation of supplier candidates, and apply of sourcing policy) for sourcing manager. The framework of the PIPA can be appled to other information processing and desision-making jobs.

• The Journal of Society for e-Business Studies
• /
• v.5 no.2
• /
• pp.49-60
• /
• 2000

A major topic in the field of network and telecommunications is doing business on the Word Wide Web(WWW), which is called Electronic Commerce(EC). Another major topic is blending Artificial Intelligent techniques with the WWW. To provide customer with the information of goods in suit with a customer liking, we propose multi agent system which is consist of customer agent and search agent etc. Also we use case-based reasoning for customer liking searching the information of goods and training through the reuse. This reuse make efficient management of information and a process of operation. In the relation between customer and goods, if there are some goods which is not search from case-base reasoning, we calculate satisfaction function for customer purchase goods. And to provide customer with the information of goods in the first of satisfaction function, This EC system can always provide the information of goods which is satisfied to customer.

• Journal of Internet Computing and Services
• /
• v.10 no.1
• /
• pp.101-110
• /
• 2009

Multi-agent systems are mostly used to integrate the intelligent and distributed approaches to various systems for effective sharing of resources and dynamic system reconfigurations. Object replication is usually used to implement fault tolerance and solve the problem of unexpected failures to the system. This paper presents the intelligent multi-agent distributed platform based on the dynamic object group management and proposes an object search technique based on the proposed filtered k-means (Fk-means). We propose Fk-means for the search mechanism to find alternative objects in the event of object failures and transparently reconnect client to the object. The filtering range of Fk-means value is set only to include relevant objects within the group to perform the search method efficiently. The simulation result shows that the proposed mechanism provides fast and accurate search for the distributed object groups.

• Structural Engineering and Mechanics
• /
• v.65 no.6
• /
• pp.707-719
• /
• 2018

In this article, a new method is introduced to improve the local search capability of meta-heuristic algorithms using the projection of the path on the border of constraints. In a mathematical point of view, the Gradient Projection Method is applied through a new approach, while the imposed limitations are removed. Accordingly, the gradient vector is replaced with a new meta-heuristic based vector. Besides, the active constraint identification algorithm, and the projection method are changed into less complex approaches. As a result, if a constraint is violated by an agent, a new path will be suggested to correct the direction of the agent's movement. The presented procedure includes three main steps: (1) the identification of the active constraint, (2) the neighboring point determination, and (3) the new direction and step length. Moreover, this method can be applied to some meta-heuristic algorithms. It increases the chance of convergence in the final phase of the search process, especially when the number of the violations of the constraints increases. The method is applied jointly with the authors' newly developed meta-heuristic algorithm, entitled Star Graph. The capability of the resulted hybrid method is examined using the optimal design of truss and frame structures. Eventually, the comparison of the results with other meta-heuristics of the literature shows that the hybrid method is successful in the global as well as local search.

• Journal of the Korean Society of Fisheries and Ocean Technology
• /
• v.44 no.1
• /
• pp.57-67
• /
• 2008

Recently, Korean shipbuilding industry is keeping up the position of world wide No. 1 in world shipbuilding market share. It is caused by endless efforts to develope new technologies and methods and fast development of IT technologies in Korea, to raise up its productivities and efficiency in shipbuilding industry with many kinds of optimizing methods including genetic algorithm or artificial life algorithm... etc. In this paper, we have suggested the artificial life algorithm with relay search micro genetic algorithm. and we have improved a defect of simple genetic algorithm for its slow convergence speed and added a variety of solution candidates with applying relay search simple genetic algorithm. Finally, we have developed intelligent agent system for ship CAE modeling. We have tried to offer some conveniences a ship engineer for repeated ship CAE modeling by changing ship design repeatedly and to increase its accuracy of a ship model with it.

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