• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.7
• /
• pp.840-845
• /
• 2005

Intelligent agents to learn users' tendency have learn uscrs' tendency by sufficient users information and training time. When the intelligent agents is used in ubiquitous environment, users must wait for intelligent agents to learn, so user may be can't get proper services. In this paper we proposed an intelligent P2P mobile agent system that can learn users' tendency in real-time by sharing users' resource. The system shared users contexts on four places and made feel groups which was composed of similar users. When users' service which had the highest correlation coefficient in the peer groups was suggested, users were satisfied over $80\%$.

• Journal of Intelligence and Information Systems
• /
• v.11 no.3
• /
• pp.1-23
• /
• 2005

Personalized reminder systems have to identify the user's current needs dynamically and proactively based on the user's current context. However, need identification methodologies and their feasible architectures for personalized reminder systems have been so far rare. Hence, this paper aims to propose a proactive need awaring mechanism by applying agent, semantic web technologies and RFID-based context subsystem for a personalized reminder system which is one of the supporting systems for a robust ubiquitous service support environment. RescorlaWagner model is adopted as an underlying need awaring theory. We have created a prototype system called NAMA(Need Aware Multi-Agent)-RFID, to demonstrate the feasibility of the methodology and of the mobile settings framework that we propose in this paper. NAMA considers the context, user profile with preferences, and information about currently available services, to discover the user's current needs and then link the user to a set of services, which are implemented as web services. Moreover, to test if the proposed system works in terms of scalability, a simulation was performed and the results are described.

• Proceedings of the IEEK Conference
• /
• 2003.11b
• /
• pp.133-136
• /
• 2003

Due to recent explosion of information available online, question- answering (Q&A) systems are becoming a compelling framework for finding relevant information in a variety of domains. Question-answering system is one of the best ways to introduce a novice customer to a new domain without making him/her to obtain prior knowledge of its overall structure improving search request with specific answer. However, the current web poses serious problem for finding specific answer for many overlapped meanings for the same questions or duplicate questions also retrieved answer for many overlapped meanings fer the same questions or duplicate questions also retrieved answer is slow due to enhanced network traffic, which leads to wastage of resource. In order to avoid wrong answer which occur due to above-mentioned problem we propose the system using ontology by RDF, RDFS and mobile agent based on JAVA. We also choose wireless internet based embedded device as our test bed for the system and apply the system in E-commerce information domain. The mobile agent provides agent routing with reduced network traffic, consequently helps us to minimize the elapsed time for answers and structured ontology based on our proposed algorithms sorts out the similarity between current and past question by comparing properties of classes.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.6 no.4
• /
• pp.249-254
• /
• 2011

A user desktop service can be made available on internet or local area network with the help of virtualization and cloud technologies. The service is usually called a virtual desktop or a desktop cloud. However, a user interface is limited to I/O capabilities of a user's mobile terminal. In order to enhance a user interface on a remote virtual desktop, it is important to connect full-featured I/O devices which are founded locally. Our previous work called SoD (System-on- Demand) has proposed a technique to associate local full-featured I/O devices with a remote virtual desktop in Xen. On the technique, it is required to install a SoD client agent in a user's mobile terminal for connecting a remote virtual desktop. In this paper, we propose a new framework called Web-SoD that does not require any explicit installation to make SoD service available. The SoD client agent is provided by the web technology so that the agent can be installed transparently, and the platform independency is also achieved. Due to insufficient network socket performance of current web technologies, we extend Native Client (NaCl) proposed by Google to support a network functionality by modifying a NaCl library and a service runtime. With conducted experiment, we show that the network extension supports a full socket functionality over the compromised overhead on the web environment.

• Journal of Electrical Engineering and Technology
• /
• v.12 no.5
• /
• pp.2051-2066
• /
• 2017

This paper deals with reconfigurable secured mobile systems where the reconfigurability has the potential of providing a required adaptability to change the system requirements. The reconfiguration scenario is presented as a run-time automatic operation which allows security mechanisms and the addition-removal-update of software tasks. In particular, there is a definite requirement for filtering and intrusion detection mechanisms that will use fewer resources and also that will improve the security on the secured mobile devices. Filtering methods are used to control incoming traffic and messages, whereas, detection methods are used to detect malware events. Nevertheless, when different reconfiguration scenarios are applied at run-time, new security threats will be emerged against those systems which need to support multiple security objectives: Confidentiality, integrity and availability. We propose in this paper a new approach that efficiently detects threats after reconfigurable scenarios and which is based on filtering and intrusion detection methods. The paper's contribution is applied to Android where the evaluation results demonstrate the effectiveness of the proposed middleware in order to detect the malicious events on reconfigurable secured mobile systems and the feasibility of running and executing such a system with the proposed solutions.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.174-174
• /
• 2000

Q-learning, based on discrete state and action space, is a most widely used reinforcement Learning. However, this requires a lot of memory and much time for learning all actions of each state when it is applied to a real mobile robot navigation using continuous state and action space Region-based Q-learning is a reinforcement learning method that estimates action values of real state by using triangular-type action distribution model and relationship with its neighboring state which was defined and learned before. This paper proposes a new Region-based Q-learning which uses a reward assigned only when the agent reached the target, and get out of the Local optimal path with adjustment of random action rate. If this is applied to mobile robot navigation, less memory can be used and robot can move smoothly, and optimal solution can be learned fast. To show the validity of our method, computer simulations are illusrated.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.11b
• /
• pp.883-886
• /
• 2003

호스트의 위치를 동적으로 관리해야 하는 이동 통신망 환경에서 멀티캐스트 서비스 지원을 위하여 기존 고정 통신망 환경에서 사용되는 멀티캐스트 프로토콜의 사용은 부적합하다. 이동 호스트의 이동성을 보장하기 위하여 IETF에서는 원격 가입(remote subscription)과 양방향 터널링(bidirectional tunneling)을 제안하였다. 하지만, 이 방법들 또한 경로 비최적화 문제, 멀티캐스트 트리의 빈번한 재구성 등의 문제점을 가지고 있다. 본 논문에서는 Mobile IPv4 지역 등록 기법을 이용함으로써 이동 호스트의 이동 후 등록 절차에서 나타나는 지연을 줄였다. 그리고, 멀티캐스트 트리의 빈번한 재구성을 줄이기 위해서 로컬 네트워크의 GFA(gateway foreign agent)가 실제 트리에 가입한다. 그러므로 로컬 네트워크 내의 움직임은 트리 재구성에 영향을 미치지 않도록 하였다. 또한 이동 호스트는 이전 DFA에게 멀티캐스트 데이터를 포워딩 받을 수도 있고, 현재의 GFA가 직접 멀티캐스트 트리에 가입하여 데이터를 받을 수 있다. 이러한 기법들을 사용하여 경로 비최적화 문제를 해결하고, 트리 재구성 빈도를 줄일 수 있는 방안을 제시하였다.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.18 no.1
• /
• pp.7-13
• /
• 2008

This paper suggests a Path-planning algorithm for mobile agents. While there are a lot of studies on the path-planning for mobile agents, mathematical modeling of complex environment which constrained by spatio-temporally is very difficult and it is impossible to obtain the optimal solutions. In this paper, an optimal path-planning algorithm based on the graphic technique is presented. The working environment is divided into two areas, the one is free movable area and the other is not permissible area in which there exist obstacles and spatio-temporally constrained, and an optimal solution is obtained by using a new algorithm which is based on the well known ACO algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.4A
• /
• pp.528-538
• /
• 2000

Mobile computing system requires both precise identification and secure authentication scheme on remote mobile entities, which is based on the distributed mobile node. In this paper, existing discrete logarithm based $Schnorr^{[7]}$ like entity authentication schemes are improved by the analysis of performance and security on the hi-directional interactive proofs. And $EIGamal^{[14]}$ like efficient authentication schemes are also proposed. Then, these are enhanced with oblivious transfer based mono directional authentication schemes based on trusted third party for applying to the mobile agent based computing systems. Therefore, proposed schemes provide compatible performance and safety on mobile entity authentication processes.

• Journal of Internet Computing and Services
• /
• v.10 no.4
• /
• pp.189-198
• /
• 2009

Unstructured peer-to-peer systems are most commonly used in today's internet. But file placement is random in these systems and no correlation exists between peers and their contents. There is no guarantee that flooding queries will find the desired data. In this paper, we propose to cluster nodes in unstructured P2P systems using the agglomerative hierarchical clustering algorithm to improve the search method. We compared the delay time of clustering the nodes between our proposed algorithm and the k-means clustering algorithm. We also simulated the delay time of locating data in a network topology and recorded the overhead of the system using our proposed algorithm, k-means clustering, and without clustering. Simulation results show that the delay time of our proposed algorithm is shorter compared to other methods and resource overhead is also reduced.