• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.29 no.11 s.242
• /
• pp.1463-1471
• /
• 2005

This paper proposes an agent-based scheduling method fur semiconductor wafer fabrication facilities with hard inter-operation temporal constraints. The scheduling problem is to find the feasible schedules that guarantee both logical and temporal correctness. A proposed multi-agent based architecture is composed of scheduling agents, workcell agents, and machine agents. A scheduling agent computes optimal schedules through bidding mechanisms with a subset or entire set of the workcell agents. A dynamic planning-based approach is adopted for the scheduling mechanism so that the dynamic behaviors such as aperiodic job arrivals and reconfiguration can be taken into consideration.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.5S
• /
• pp.1657-1665
• /
• 2000

Mobile agents based e-commerce system has many advantage than traditional e-commerce-information gathering on goods, price settlement and payment, delivery of the goods purchased, and so on. However, due to the security vulnerability that stems from mobile agent's mobility, mobile agents based e-commerce system has additional security problems. Therefore, in order to do e-commerce securely in th system, first of al the security issues on mobile agents must be addressed. It this paper, we propose a mobile agent transfer protocol that provides confidentiality and integrity of mobile agent in transit and mutual authentication for communicating hosts. We further show the security of the protocol against many possible attacks. Also, we suggest the location management mechanism of mobile agents based on the trust center. This mechanism is capable of finding their locations transparently and detecting mobile agent clones.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.28 no.3
• /
• pp.58-64
• /
• 2005

Customer sensibility based recommendation agent system was developed to tailor to the customer the suggestion of goods and the description of store catalog in on-line shopping mall. The recommendation agent system composed of five modules and seven services including specialized algorithm. This study was to investigate the effectiveness of the customer sensibility based recommendation agent system in on-line shopping mall. This study asked 30 male and female students to perform the task in on-line shopping mall and facilitated them questionnaires. The questionnaires were administered to subjects to measure quality precision, ease of use, support of buying, purchasing power, future intention of the system. The study revealed that good part of the subjects positively evaluated the customer sensibility based recommendation system except for ease of use. The study on usability of the recommendation agent system has need to be performed in next. This paper shows that the satisfaction and the buying power of customers may be improved by presenting customer sensibility based recommendation in on-line shopping mall.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.1
• /
• pp.123-144
• /
• 2014

Wireless sensor networks are generally deployed for specific applications to accomplish certain objectives over a period of time. To fulfill these objectives, it is crucial that the sensor network continues to function for a long time, even if some of its nodes become faulty. Energy efficiency and fault tolerance are undoubtedly the most crucial requirements for the design of an information extraction protocol for any sensor network application. However, most existing software agent based information extraction protocols are incapable of satisfying these requirements because of static agent itineraries and large agent sizes. This paper proposes an Information Extraction protocol based on Multiple software Agents with Dynamic Itineraries (IEMADI), where multiple software agents are dispatched in parallel to perform tasks based on the query assigned to them. IEMADI decides the itinerary for an agent dynamically at each hop using local information. Through mathematical analysis and simulation, we compare the performance of IEMADI with a well known static itinerary based protocol with respect to energy consumption and response time. The results show that IEMADI provides better performance than the static itinerary based protocols.

• KIPS Transactions on Computer and Communication Systems
• /
• v.3 no.1
• /
• pp.23-30
• /
• 2014

In this paper, we propose an efficient agent framework for host-based vulnerability assessment system by analyzing the operational concept of traditional vulnerability assessment framework and proposed vulnerability assessment agent framework in virtualization environment. A proposed agent framework have concept by using the features of virtualization technology, it copy and execute checking agent in targeted virtual machines. In order to embody a propose agent framework, we design function block of checking agent and describe a vulnerability checking scenario of proposed agent framework. Also we develop pilot system for vulnerability checking scenario. We improve the shortcomings of the traditional vulnerability assessment system, such as unnecessary system load of the agent, inefficiency due to duplication agent installation. Moreover, the proposed agent framework is maximizing the scalability of the system because there is no agent installation when adding a targeted system.

• The Journal of Society for e-Business Studies
• /
• v.4 no.3
• /
• pp.63-76
• /
• 1999

Internet-based electronic trade has been growing fast. But most users are not yet familiar with the system and find it very difficult to purchase and sell the products in the cyber market place. To handle these problems, agent-based virtual market place system has been proposed where agents instead of individuals participate in trading of goods. Most of the proposed models have been in the two general categories. The first is the direct transaction among sellers and buyers, and the second is the agent-based transaction. However, the transaction is not fair and the best deal can't be guaranteed for both models. In this paper, we propose a new broker based synchronous transaction algorithm which is fair to both parties and guarantees the best deal. Our algorithm is implemented using Visual C++ and the experimental results show that our method is better than the two traditional transaction models in every performance metrics, Number of transactions are increased up to 21% and price adjustment is up to 280% better for some transactions.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.09a
• /
• pp.280-283
• /
• 2003

A purpose of our research is an acquisition of cooperative behaviors in inhomogeneous multi-agent system. In this research, we used the fire panic problem as an experiment environment. In Fire panic problem a fire exists in the environment, and follows in each steps of agent's behavior, and this fire spreads within the constant law. The purpose of the agent is to reach the goal established without touching the fire, which exists in the environment. The fire heat up by a few steps, which exists in the environment. The fire has unsureness to the agent. The agent has to avoid a fire, which is spreading in environment. The acquisition of the behavior to reach it to the goal is required. In this paper, we observe how agents escape from the fire cooperating with other agents. For this problem, we propose a unique CMAC based Q-learning system for inhomogeneous multi-agent system.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.12
• /
• pp.2072-2077
• /
• 2007

The primary objective of all power systems is to maintain the reliability and to minimize outage time for fault or the others. The frequency relaying algorithm perceives a variation of system frequency and thereafter detects the unbalance between generation and load. A multi-agent system is composed of multiple interacting computing elements that are known as agents. In this paper, frequency relaying algorithm is designed by multi-agent system and is implemented by EMTP-MODELS. To verify performance of the frequency relaying algorithm based on multi-agent system, simulations by EMTP have been carried out.

• The Journal of Korea Robotics Society
• /
• v.1 no.1
• /
• pp.46-57
• /
• 2006

It is well known that mathematical solutions for multi-agent planning problems are very difficult to obtain due to the complexity of mutual interactions among multi-agent. Most of the past research results thus are based on the probabilistic completeness. However, the practicality and effectiveness of the solution from the probabilistic completeness is significantly reduced by heavy computational burden. In this paper, we propose a practically applicable solution technique for multi-agent planning problems, which assures a reasonable computation time and a real world application for more than 3 multi-agents for the case of general shaped paths in agent movement. First, to reduce the computation time, a collision map is utilized for detecting potential collisions and obtaining collision-free solutions for multi-agents. Second, to minimize the maximum of multi-agent task execution time, a method is developed for selecting an optimal priority order. Simulations are finally provided for more than 20 agents to emphasize the effectiveness of the proposed interactive approach to multi-agent planning problems.

• Journal of Korea Multimedia Society
• /
• v.7 no.10
• /
• pp.1421-1435
• /
• 2004

When various work was given from user, the existing mobile agent model migrated from node to node and process the work at the point that much traffics according to passive routing schedule are happened, until it makes service the work result, time cost of round work process for the distributed nodes are increased. Therefore, the existing agent systems need migration method to solve the problems of agent size increment or a lack of interoperability among agent systems. To solve these problems in this thesis, we design and implement an CORBA-based Mobile Agent Model(CMAM) for the efficient work process into the distributed nodes, when the mobile agents are migrated among the nodes, using an optimal path search by sensing of network traffic.