• Asian Pacific Journal of Cancer Prevention
• /
• v.14 no.12
• /
• pp.7757-7759
• /
• 2013

Physicians, in order to study the causes of cancer, detect cancer earlier, prevent or determine the effectiveness of treatment, and specify the reasons for the treatment ineffectiveness, need to access accurate, comprehensive, and timely cancer data. The cancer care environment has become more complex because of the need for coordination and communication among health care professionals with different skills in a variety of roles and the existence of large amounts of data with various formats. The goals of health care systems in such a complex environment are correct health data management, providing appropriate information needs of users to enhance the integrity and quality of health care, timely access to accurate information and reducing medical errors. These roles in new systems with use of agents efficiently perform well. Because of the potential capability of agent systems to solve complex and dynamic health problems, health care system, in order to gain full advantage of E- health, steps must be taken to make use of this technology. Multi-agent systems have effective roles in health service quality improvement especially in telemedicine, emergency situations and management of chronic diseases such as cancer. In the design and implementation of agent based systems, planning items such as information confidentiality and privacy, architecture, communication standards, ethical and legal aspects, identification opportunities and barriers should be considered. It should be noted that usage of agent systems only with a technical view is associated with many problems such as lack of user acceptance. The aim of this commentary is to survey applications, opportunities and barriers of this new artificial intelligence tool for cancer care information as an approach to improve cancer care management.

• ETRI Journal
• /
• v.24 no.1
• /
• pp.12-22
• /
• 2002

A Mobile IP allows IP hosts to move between different networks without changing their IP addresses. Mobile IP systems supporting local registration were introduced to reduce the number of times a home registration with the remotely located home agent was needed. The local registration Mobile IP scheme enhanced performance by processing registration requests of mobile nodes at a local agent. The local registration approach may affect other aspects of the Mobile IP systems such as fault tolerance. In this paper, we briefly review previous solutions for supporting fault tolerance in local registration Mobile IP systems and propose a fault tolerance protocol with a backup foreign agent in a hierarchical local registration mobile IP to enhance the efficiency of such systems against foreign agent failures. We also describe the specification of the proposed protocol using LOTOS and perform its validation using MiniLite. Finally, we analyze the performance of our proposed fault tolerance protocol through simulation.

• Journal of IKEEE
• /
• v.18 no.4
• /
• pp.517-522
• /
• 2014

This paper investigates the consensus problem for linear multi-agent systems with an arbitrary network delay. The sufficient conditions for a state consensus of linear multi-agent systems are provided by using linear matrix inequalities. Moreover, it is shown that under the proposed protocol, the consensus can be achieved even in the presence of an arbitrarily large network delay. Finally, an illustrative example is given in order to show the effectiveness of our design method.

• The Journal of Information Systems
• /
• v.19 no.1
• /
• pp.79-96
• /
• 2010

The organizations in the competitive business environment are under pressure of handling internal management processes as well as external supply chain issues. In addition, the paradigm of supply chain management (SCM) has been shifted from static to dynamic problems. For the efficient SCM, organizations should be a RTE (Real Time Enterprises) that views entire supply chains as a single entity. In this paper, the agent system that makes RTE and dynamic supply chains possible is developed. Then, the developed agent system is verified in the TAC SCM(Trading Agent Competition Supply Chain Management) experimental environment and a dashboard is also developed for monitoring management activities of supply chains. The contributions of this paper are as followings. First, unlike the previous agent systems, the suggested agent system in this paper provides autonomy and scalability using SOA. Second, this suggested model for dynamic environment can be applied for the development of software supporting a SCM.

• The KIPS Transactions:PartB
• /
• v.8B no.6
• /
• pp.601-608
• /
• 2001

The automated assignment of multiple tasks to executing agents is a key problem in the area of multi-agent systems. In many domains, significant savings can be achieved by reallocating tasks among agents with different costs for handling tasks. The automation of task reallocation among self-interested agents requires that the individual agents use a common negotiation protocol that prescribes how they have to interact in order to come to an agreement on "who does what". In this paper, we introduce the multi-agent Traveling Salesman Problem(TSP) as an example of task reallocation problem, and suggest the Vickery auction as an interagent negotiation protocol for solving this problem. In general, auction-based protocols show several advantageous features: they are easily implementable, they enforce an efficient assignment process, and they guarantce an agreement even in scenarios in which the agents possess only very little domain-specific Knowledge. Furthermore Vickrey auctions have the additional advantage that each interested agent bids only once and that the dominant strategy is to bid one′s true valuation. In order to apply this market-based protocol into task reallocation among self-interested agents, we define the profit of each agent, the goal of negotiation, tasks to be traded out through auctions, the bidding strategy, and the sequence of auctions. Through several experiments with sample multi-agent TSPs, we show that the task allocation can improve monotonically at each step and then finally an optimal task allocation can be found with this protocol.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.36 no.4
• /
• pp.130-137
• /
• 2013

In this paper, we consider a two-agent scheduling with sequence-dependent exponential learning effects consideration, where two agents A and B have to share a single machine for processing their jobs. The objective function for agent A is to minimize the total completion time of jobs for agent A subject to a given upper bound on the objective function of agent B, representing the makespan of jobs for agent B. By assuming that the learning ratios for all jobs are the same, we suggest an enumeration-based backward allocation scheduling for finding an optimal solution and exemplify it by using a small numerical example. This problem has various applications in production systems as well as in operations management.

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

In this paper, we implemented a FIPA-OS multi-agent framework bundle in OSGi Service Platform. FIPA-OS is an open agent platform for constructing FIPA compliant agent using mandatory components that required by all FIPA-OS agents to execution and optional components that FIPA-OS agent car optionally use. The platform supports communication between multiple agents and communication language which conforms to the FIPA standards. FIPA-OS framework bundle is composed of DE(Directory Facilitator), AMS(Agent Management System), ACC(Agent Communication Channel) and MTS(Message Transport System) bundle. These bundles installed in the OSGi service platform and their life cycle can be managed by the framework.

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

• Journal of Korea Society of Industrial Information Systems
• /
• v.7 no.2
• /
• pp.40-45
• /
• 2002

In this paper, we design and implement an agent-based mask dance guidance system which provides multimedia information on traditional masques through WWW. When the server receives a query from the client, it produces the multimedia data by connecting several real full-motion videos, and synthesizing adequate voice data for guiding announcement. To develop an agent-based guidance system, we designed and implemented four agents such as interface agent, user modeling agent coordinator agent and data management agent. The mask dance guidance system also provides the functions of searching using the keyword and learning.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.50 no.8
• /
• pp.365-372
• /
• 2001

This paper presents a new protection concept to achieve the adaptive optimal function by introducing the multi-agent system technology. Making each relay an agent which consists of relay agent module and coordinator module, each agent works autonomously to improve protection capability by cooperating with other agents. It is applied to the overcurrent protection system of the industrial power system in order to show the feasibility of the proposed methodology.