• Proceedings of the KIEE Conference
• /
• 2007.04a
• /
• pp.172-174
• /
• 2007

In this paper, we designed a embedded system that will perform a primary role of Tangible Space implementation. This hardware includes function of image capture through camera interface, image process and sending off image information by LAN(local area network) or WLAN(wireless local area network). We define this hardware as a network based Visual Agent Platform for Tangible Space, This Visual Agent Platform includes the software that is RTLinux and CORBA

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10a
• /
• pp.682-684
• /
• 2001

디지털 컨텐cm의 지적 재산권 보호를 위한 디지털 워터마킹 기술 및 핑거프린팅의 연구가 활발히 진행되고 있다. DRM(Digital Rights Management)는 디지털 컨텐츠 지적 재산권 보호뿐만 아니라 컨텐츠 에 대한 출판, 유통 및 사용에 필요한 관리와 보호체계이다. 본 논문에서는 컨텐츠 보호 기술 중에서 컨텐츠에 대한 유통/서비스에 해당하는 기술을 만족하는 프로토콜을 제시한 것이다. 이를 위해 컨텐츠 불법복제 빛 불법사용을 방지할 수 있도륵 Agent를 이용한다. Agent는 특별한 설치가 필요 없이 컨텐츠 내에 내포되어 있게 된다. 내포된 Agent는 불법복제 및 불법사용에 대해 체크함으로써 불법복제의 사용을 차단할 수 있도록 한다.

• The KIPS Transactions:PartB
• /
• v.11B no.6
• /
• pp.701-708
• /
• 2004

Existing contents-based video retrieval systems search by using a single method such as annotation-based or feature-based retrieval. Hence, it not only shows low search efficiency, but also requires many efforts to provide system administrator or annotator with a perfect automatic processing. Tn this paper, we propose an agent-based, and automatic and unified semantics-based video retrieval system, which support various semantics-retrieval of the massive video data by integrating the feature-based retrieval and the annotation-based retrieval. The indexing agent embodies the semantics about annotation of extracted key frames by analyzing a fundamental query of a user and by selecting a key-frame image that is ed by a query. Also, a key frame selected by user takes a query image of the feature-based retrieval and the indexing agent searches and displays the most similar key-frame images after comparing query images with key frames in the database by using the color-multiple-partition histogram techniques. Furthermore, it is shown that the performance of the proposed system can be significantly improved.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.11
• /
• pp.3490-3499
• /
• 2000

There are two approaches, HA(Home Agent)-based and FA(Froegn Agent)-based mulicasting in mobile computing environments based on mobile IP. If we consider efficiency of routing and bandwidth the FA-based model is better than the HA-based model. But in the case of a MH(Mobile Host) moves frequently it shows bad connection durability because of join and graph delays. To overcome this and to support effective mobile multicasting we propose an extended FA-based multicast routing. In our model previous FA for wards multicast packets to MH. while new FA processes a jion request from MH. That is in general case our model supports FA-based multicasting for efficiency but it provides unicast-based mulicasting for connection durability when MH moves to new FN(Roreign Network). To evaluate our model, we analyze connecction durability, bandwidth, overheads and routing sosts in many situations and compare with previous works.

• The KIPS Transactions:PartA
• /
• v.10A no.5
• /
• pp.439-452
• /
• 2003

Mobile agent is one of the good technologies for overcoming network load and latency in distributed applications, and it may be a promising way of base technology of distributed applications because of its high adaptability for various network environments. In this paper, a mobile agent programming system, called HUMAN, is designed and implemented efficient use in various distributed applications based on mobile agents. HUMAN supports such high level utilities as file searhing, addressing by groups of nodes, storing path information, storing search information, and thus it gives us high easiness in agent-based programming. And it provides various itinerary modes and flexible reply modes for easy adaptation to given network environment. It also provides a management server for registering and active agents. Thus it can be efficiently applied for such varous distributed applications as searching distributed information, remote control, and file sharing in networks. A simple electronic commerce system is designed is designed and implemented as a HUMAN based illustrative application.

• KIISE Transactions on Computing Practices
• /
• v.21 no.4
• /
• pp.290-298
• /
• 2015

This paper suggests a multi-agent message transport architecture based on the message-oriented middleware ZeroMQ. Compared with the other middlewares such as CORBA, Ice, and Thrift, ZeroMQ receives a good score in the evaluation of performance, QoS (Quality of Service), patterns, user friendliness, and resources. The suggested message transfer architecture borrowed many basic concepts like agent platform, AMS (Agent Management System), and MTS (Message Transfer System) from FIPA (Foundation for Intelligent Physical Agents) standard multi-agent specifications, and the architecture inherited the strength of the architecture from the multi-agent framework SMAF (Smart Multi-Agent Framework). The architecture suggested in this paper is a novel peer-to-peer architecture which is not known to the ZeroMQ community. In the suggested architecture, every MTS agent uses only one ZeroMQ router socket to support peer-to-peer communication among MTS agents. The suggested architecture can support closely collaborating software areas such as intelligent robots as well as the traditional application areas of multi-agent architecture. The suggested architecture has interoperability and scalability with the ZeroMQ devices and patterns.

• Journal of the Korea Society for Simulation
• /
• v.28 no.3
• /
• pp.1-9
• /
• 2019

An agent-based simulation is a popular simulation tool to solve various problems, such as stock market, population prediction, disease prediction, and development of a traffic system. As the agents are developed and researched in different application fields, the agent has a rigid structure and may not acceptable in different domains. As a result, it is a challenging problem to define a structure for an agent structure to reflect the researcher's simulation objective. This research proposes an extendable form for an agent and its modeling environment. In order to propose a standard structure, this study adopts system entity structure and discrete event system specification formalism. Also, this research introduces the SESManager which supports the proposed specification method. The proposed environment can hierarchically define the agent structure and synthesize the agent so that it can perform the agent simulation according to the user's simulation purpose.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2002.11a
• /
• pp.550-554
• /
• 2002

In this paper, we design the CORBA-based Mobile-Agent Model (CMAM) which has the capability of the efficient work processing in distributed environment through sensing network traffic and searching the optimal path for migration nodes of mobile agent. In case existing mobile agent model is given various works from user, the network overhead and traffic are increased by increasing of execution module size. Also, if it happens a large quantity of traffics due to migration of nodes according to appointment of the passive host(node) muting schedule by user, it needs much cost for node search time by traffic. Therefore, in this paper, we design a new mobile agent model that assures the reliability of agent's migration through dynamic act on the specific situation according to appointment of the active routing schedule and can minimize agent's work processing time through optimal path search. The proposed model assigns routing schedule of the migration nodes actively using an extended MAFFinder. Also, for decreasing overhead of network by agent's size, it separated by mobile agent including oかy agent calling module and push agent with work executing module based on distributed object type of CORBA. Also, it can reduce the required time for round works of mobile agent through the optimal path search of migration nodes.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.1
• /
• pp.173-182
• /
• 2001

In this paper, we discuss how ontology Plays roles in building a distributed and heterogeneous knowledge-base system. First, we discuss relationship between ontology and agent in the Knowledgeable Community which is a framework of knowledge sharing and reuse based on a multi-agent architecture. Ontology is a minimum requirement for each agent to join the Knowledgeable Community. Second we explain mediation by ontology to show how ontology is used in the Knowledgeable Community. A special agent called mediation analyzes undirected messages and infer candidates of recipient agents by consulting ontology and relationship between ontology and agents. Third we model ontology as combination of aspects each of which can represent a way of conceptualization. Aspects are combined either as combination aspect which means integration of aspects or category aspect which means choice of aspects. Since ontology by aspect allows heterogeneous and multiple descriptions for phenomenon in the world, it is appropriate for heterogeneous knowledge-base systems. We also show translation of messages as a wave of interpreting multiple aspects. A translation agent can translate a message with some aspect to one with another aspect by analyzing dependency of aspects. Mediation and translation of messages are important to build agents easily and naturally because less knowledge on other agents is requested for each agent.

• Journal of the Korea Society for Simulation
• /
• v.24 no.4
• /
• pp.77-88
• /
• 2015

In this paper, we consider a two-agent single-machine scheduling problem with exponential job-dependent position-based learning effects. The objective is to minimize the total weighted completion time of one agent with the restriction that the makespan of the other agent cannot exceed an upper bound. First, we propose a branch-and-bound algorithm by developing some dominance /feasibility properties and a lower bound to find an optimal solution. Second, we design an efficient simulated annealing (SA) algorithm to search a near optimal solution by considering six different SAs to generate initial solutions. We show the performance superiority of the suggested SA using a numerical experiment. Specifically, we verify that there is no significant difference in the performance of %errors between different considered SAs using the paired t-test. Furthermore, we testify that random generation method is better than the others for agent A, whereas the initial solution method for agent B did not affect the performance of %errors.