• 산업경영시스템학회지
• /
• 제37권4호
• /
• pp.1-11
• /
• 2014

This paper addresses the emotion computing model for software affective agents. In this paper, emotion is represented in valence-arousal-dominance dimensions instead of discrete categorical representation approach. Firstly, a novel emotion model architecture for affective agents is proposed based on Scherer's componential theories of human emotion, which is one of the well-known emotion models in psychological area. Then a fuzzy logic is applied to determine emotional statuses in the emotion model architecture, i.e., the first valence and arousal, the second valence and arousal, and dominance. The proposed methods are implemented and tested by applying them in a virtual training system for children's neurobehavioral disorders.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제4권3호
• /
• pp.288-291
• /
• 2004

This paper proposes an intelligent search modeling using avatar agent. This system consists of some modules such as agent interface, agent management, preprocessor, interface machine. Core-Symbol Database and Spell Checker are related to the preprocessor module and Interface Machine is connected with Best Aggregate Designer. Our avatar agent system does the indexing work that converts user's natural language type sentence to the proper words that is suitable for the specific branch information retrieval. Indexing is one of the preprocessing steps that make it possible to guarantee the specialty of user's input and increases the reliability of the result. It references a database that consists of synonym and specific branch dictionary. The resulting symbol after indexing is used for draft search by the internet search engine. The retrieval page position and link information are stored in the database. We experimented our system with the stock market keyword SAMSUNG_SDI, IBM, and SONY and compared the result with that of Altavista and Google search engine. It showed quite excellent results.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제3권2호
• /
• pp.239-243
• /
• 2003

Recently, there has been active research conducted on the intelligent agent in various fields. The results have been widely applied to intelligent user-friendly interfaces. In this system, we modeled, designed, and implemented an intelligent agent system that can be applied to stock and news. Some procedures such as login sequence to the web site, process to get stock information, setting stock in concern, intelligent news system module, news analysis module, and news learning module are modeled in detail and described in block diagram level. In our experiment on stock system, it showed quite a useful alarming screen avatar result and also on news system. it successfully rearranged the order of the news according to the user's preferences.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2001년도 봄 학술발표논문집 Vol.28 No.1 (A)
• /
• pp.544-546
• /
• 2001

인터넷의 확산과 All-IP망으로의 망의 진화에 대한 논의가 활발하게 이루어지고 있다. 더불어 IPv6[1]망에서의 이동성 지원을 위하여 IETF(Internet Engineering Task Force)에서 Mobile IPv6[5]를 제안했다. Mobile IPv6의 기본 발상은 Routing Table의 조작에 의해 다른 링크로 이동한 호스트에게 Packet를 전달 할 수 있게 하는 것이다.(Triangle Routing[4]. 본 논문에서는 Mobile IPv6을 구성하는 요소 중 Home Agent의 기본 구조를 제시했다. Home Agent는 크게 새로운 Message를 인식하고 만들어 보내는 Analyzer와 Sender 그리고 Logic이 들어 있는 Handler, 실제적인 Routing Table를 조작하는 System Manager로 구성된다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1999년도 추계종합학술대회 논문집
• /
• pp.412-415
• /
• 1999

In this paper, we describe an implementation of the B-Link bus interface logic for a directory controller and a remote access cash controller in the SCI-based CC-NUMA multimedia server developed by ETRI . The CC-NUMA multimedia server is composed of a number of Pentium III SHV nodes and a SCI interconnection network. To communicate with remote nodes, each node has a CC-Agent which consists of a processor bus interface(PIF). a directory controller(DC), a remote access cash controller(RC), and two SCI 1ink controllers(LCs). The B-Link bus interface logic is developed for a directory controller and a remote access cash controller in order to communicate with a SCI link controller on a B-Link bus. It consists of a sending master controller a receiving slave controller, and asynchronous data buffers. And It performs a self-arbitration, a data packet transmission, a queue allocation, an early terminal ion. and a cut-through data path.

• 정보처리학회논문지B
• /
• 제12B권4호
• /
• pp.413-420
• /
• 2005

본 논문에서는 상태변화에 대한 자율적 의사결정을 하는 퍼지논리를 이용한 에이전트의 구현을 택시에 적용 하는 것을 연구의 목적으로 한다. 이를 위하여 인공 지능 이론을 기반으로 한 실시간 반응형 에이전트를 통하여 인공 지능적으로 운행하는 자동차에 대해서 실험을 하였다. 실시간 반응형 에이전트를 구성하기 위한 추론방식으로는 max-product 기법과 n개 퍼지 규칙들 또는 연관들 ($A_l,\;B_l),\;{\ldots}(A_n,\;B_n$)을 가지는 상황을 고려하여 비퍼지화 작업을 수행하여 중심값을 추출하여 추론 작업을 실행하였다.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제1권1호
• /
• pp.81-86
• /
• 2001

In this paper, we investigated the modeling of Bank Asset Management System(BAME) based on intelligent agent. To achieve this goal, we introduced several kinds of agents that show intelligent features. BAMS is a user friendly system and adopts fuzzy converting system and fuzzy matching system that returns reasonable similarity matching results. Generation function of the proximity degree is suggested. Fuzzification of investment type categories and feature values are defined, and generation of proximity degree is also derived. An example of bank asset management system is introduced and simulated. Investment type matching utilizing fuzzy measure is tested and it showed quite reasonable similarity matching results.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제12권1호
• /
• pp.86-93
• /
• 2012

This paper presents a new approach to solve the pursuit problem based on a univector field method. In our proposed method, a set of eight agents works together instantaneously to find suitable moving directions and follow the univector field to pursue and capture a prey agent by surrounding it from eight directions in an infinite grid-world. In addition, a set of strategies is proposed to make the pursuit problem more realistic in the real world environment. This is a general approach, and it can be extended for an environment that contains static or moving obstacles. Experimental results show that our proposed algorithm is effective for the pursuit problem.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2002년도 봄 학술발표논문집 Vol.29 No.1 (B)
• /
• pp.250-252
• /
• 2002

In most Multi-Agent Systems (MAS), agents are required to achieve their own goals. An agent's goals, however, can conflict with others either when agents compete with earth other to achieve a common goal or when they have to use a set of limited resources to accomplish agents'divergent goals. In this paper, we consider that a BDI architecture, as a shorthand fur belief, desire, and intention in any agent-based systems, is a core component of agents' mental attitudes and represent resource-bounded BDI agents in logic programming framework. We propose an algorithm in which BDI agents with different goals solve their problems through negotiation resolving goal conflicts.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제4권3호
• /
• pp.311-315
• /
• 2004

Because of the characteristics of the cyber world, such as usefulness, anonymousness, patency, economic performance, rapidness, etc., cyber counseling has great possibility. Because he or she may not meet a consultant directly, a client can expose his/her inside problems or secret personal problems, keeping anonymousness. However, existing cyber counseling has the limit in durability of counseling because target counseling appropriate to a client is impossible and a counseling activity is done by one time counseling. In this paper, we attempt to develop a target cyber counseling system in which target cyber counseling is possible. The system will use a counseling assistance agent who can play the role of a counseling supporter as well as a counselor in the cyber space. If target counseling becomes possible, it can heighten efficiency of cyber counseling because a client is satisfied with the result of counseling and thus counseling activities can be continued.