• Proceedings of the KAIS Fall Conference
• /
• 2003.11a
• /
• pp.197-206
• /
• 2003

With the growing usage of the networks, the world-wide Internet has become the main means to exchange data and carry out transactions. It has also become the main means to attack hosts. To solve the security problems which occur in the network such as Internet, we import software products of network security elements like an IDS (Intrusion Detection System) and a firewall. In this paper, we have designed and constructed the General Simulation Environment of Network Security model composed of multiple IDSes and a firewall which coordinate by CNP (Contract Net Protocol) for the effective detection of the intrusion. The CNP, the methodology for efficient integration of computer systems on heterogeneous environment such as distributed systems, is essentially a collection of agents, which cooperate to resolve a problem. Command console in the CNP is a manager who controls tie execution of agents or a contractee, who performs intrusion detection. In the Network Security model, each model of simulation environment is hierarchically designed by DEVS (Discrete EVent system Specification) formalism. The purpose of this simulation is to evaluate the characteristics and performance of CNP architecture with rete pattern matching algorithm and the application of rete pattern matching algorithm for the speeding up the inference cycle phases of the intrusion detection expert system.

• 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.26 no.3
• /
• pp.111-117
• /
• 2021

The delivery problem on a graph is that of minimizing the object delivery time from one vertex to another vertex on a graph with m vertices using n various speed robot agents. In this paper, we propose two optimal solution algorithms for the delivery problem on a graph with time complexity of O(㎥n) and O(㎥). After preprocessing to obtain the shortest path for all pairs of the graph, our algorithm processed by obtaining the shortest delivery path in the order of the vertices with the least delivery time. Assuming that the graph reflects the terrain on which to solve the problem, our O(㎥) algorithm actually has a time complexity of O(㎡n) as only one preprocessing is required for the various deployment of n robot agents.

• Journal of KIISE:Software and Applications
• /
• v.33 no.12
• /
• pp.1062-1072
• /
• 2006

Recently, new intelligent service frameworks, such as ubiquitous computing are proposed. So, the necessity of adaptive agent system has been increased. In this paper, we propose an intelligent service agent to help that ubiquitous computing system offer user suitable service in ubiquitous computing environment. In order to offer user suitable uT-service, an intelligent service agent mediates the gap between the context information in uT-service system, and user preference is reflected in it. Therefore, we focus on following three components; the first is suitable multi agent framework-agent communication analysis and applicable method of inference engine, the second is uT-ontologies to describe various context information-context information sharing between agents and context information understanding between agents, the third is learning method of user profile to apply in uT-service system. This approach enables us to build adaptive uT-service system to offer suitable service according to user preference.

• Journal of KIISE:Software and Applications
• /
• v.31 no.9
• /
• pp.1196-1203
• /
• 2004

Autonomous agents need considerable computational resources to perform rational decision-making. The complexity of decision-making becomes prohibitive when large number of agents are present and when decisions have to be made under time pressure. One of approaches in time-critical domains is to respond to an observed condition with a predefined action. Although such a system may be able to react very quickly to environmental conditions, predefined plans are of less value if a situation changes and re-planning is needed. In this paper we investigate strategies intended to tame the computational burden by using off-line computation in conjunction with on-line reasoning. We use performance profiles computed off-line and the notion of urgency (i.e., the value of time) computed on-line to choose the amount of information to be included during on-line deliberation. This method can adjust to various levels of real-time demands, but incurs some overhead associated with iterative deepening. We test our framework with experiments in a simulated anti-air defense domain. The experiments show that the off-line performance profiles and the on-line computation of urgency are effective in time-critical situations.

• Korean Journal of Cognitive Science
• /
• v.10 no.1
• /
• pp.1-11
• /
• 1999

Agent-based systems technology has generated lots of excitement in these years because of its promise as a new paradigm for conceptualizing. designing. and l implementing software systems Especially, there has been many researches for multi agent system because of the characteristics that it fits to the distributed and open Internet environments. In a multiagent system. agents must cooperate with each other through a Coordination procedure. when the conflicts between agents arise. where those are caused b by the point that each action acts for a purpose separately without coordination. But P previous researches for coordination methods in multi agent system have a deficiency that they can not solve correctly the cooperation problem between agents which have different goals in dynamic environment. In this paper. we solve the cooperation problem of multiagent that has multiple goals in a dynamic environment. with an automatic cooperative coordination model using I reinforcement learning. We will show the two pursuit problems that we extend a traditional problem in multi agent systems area for modeling the restriction in the multiple goals in a dynamic environment. and we have verified the validity of the proposed model with an experiment.

• Journal of KIISE:Software and Applications
• /
• v.35 no.3
• /
• pp.189-196
• /
• 2008

To build autonomous agents who can make a decision on behalf of humans in time-critical complex environments, the formulation of operational knowledge base could be essential. This paper proposes the methodology of how to formulate the knowledge base and evaluates it in a practical application domain. We analyze threat data received from the multiple sensors of Aircraft Survivability Equipment(ASE) for Korean helicopters, and integrate the threat data into the inductive model through compilation technique which extracts features of the threat data and relations among them. The compiled protocols of state-action rules can be implemented as the brain of the ASE. They can reduce the amounts of reasoning, and endow the autonomous agents with reactivity and flexibility. We report experimental results that demonstrate the distinctive and predictive patterns of threats in simulated battlefield settings, and show the potential of compilation methods for the successful detection of threat systems.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.13 no.1
• /
• pp.355-363
• /
• 2012

The Integration of multi-agent architecture and blackboard architecture may lead to a new architecture to cope with new application areas which need some good and strong points of both the architectures. This paper suggests an integrated architecture of blackboard architecture and multi-agent architecture by using event-based implicit invocation pattern and a blackboard event detection mechanism based on Rete network. From the viewpoints of weak couplings of system components and flexible control of knowledge source agents, it is desirable to use the event-based implicit invocation pattern in the integrated architecture. But the pattern itself does not concern the performance of the architecture, and it is very critical to the performance of the integrated architecture to detect efficiently the blackboard events which can activate knowledge source agents which can contribute to the problem-solving processes of the integrated architecture. The integrated architecture suggested in this paper uses a blackboard event detection mechanism based on Rete network to detect efficiently blackboard events which can activate knowledge source agents.

• KIPS Transactions on Software and Data Engineering
• /
• v.4 no.7
• /
• pp.297-300
• /
• 2015

In medical ultrasonography, transit time and contrast enhancement patterns are considered as important parameters to analyze liver diseases. In many recent researches, time-intensity curves(TIC) have been used for calculating the transit time of the contrast agents. However, the intensity curve may include the variations which are caused by the micro-bubble effect of contrast agents. In this paper, we propose a complementary approach to diagnostic parameter extraction which utilizes a density information as well as the intensity data. The proposed technique improves the accuracy in extraction of the transit time and velocity of contrast agents for detection and characterization of focal liver lesions. Through the experiments using a set of clinical data, we show that the proposed methods can improve the reliability of the parametric image data.

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

Due to rapid development of high speed wire/wireless internet technologies, at the current age, it cares into being one phenomenon that the internet business is able to work on anyplace and anytime. In this environment, a technology of mobile agent provides very useful mechanism for personal handheld devices because of supporting migration as autonomously executable software object Instead of users. Therefore, this paper focuses on Implementing a mobile agent platform for personal handheld devices, which supports mobile agents in wire/wireless internet environment. To do this, we construct the system with modified JAMAS, based on Java, in our previous research. Based on our proposed system, we implement the browsing application in personal handheld devices to access the MIB(Management Information Base) on SNMP(Simple Network Management Protocol), which supervises network environment on wire/wireless internet. This proposed application system is easily to access the MIB managed by SNMP agent. then provides network map viewer and updates the MIB through the browser to network administrator. As a result, we can support application area of mobile agents such as hare network management. M-Commerce, integration of remote database systems, active message and active network with personal handheld devices.