• Journal of Information Processing Systems
• /
• v.5 no.4
• /
• pp.221-228
• /
• 2009

Due to low cost, low-power, and scalability, ZigBee is considered an efficient wireless AMR infrastructure. However, these characteristics of ZigBee can make the devices more vulnerable to unexpected error environments. In this paper, a fault-tolerant wireless AMR network (FWAMR) is proposed, which is designed to improve the robustness of the conventional ZigBee-based AMR systems by coping well with dynamic error environments. The experimental results demonstrate that the FWAMR is considerably fault-tolerant compared with the conventional ZigBee-based AMR network.

• International Journal of Contents
• /
• v.3 no.1
• /
• pp.34-38
• /
• 2007

Load redistribution is a critical resource in computer system. In sender-initiated load redistribution algorithms, the sender continues to send unnecessary request messages for load transfer until a receiver is found while the system load is heavy. These unnecessary request messages result in inefficient communications, low CPU utilization, and low system throughput in distributed systems. To solve these problems, we propose a genetic algorithm based approach for improved sender-initiated load redistribution in distributed systems. Compared with the conventional sender-initiated algorithms, the proposed algorithm decreases the response time and task processing time.

• Journal of Korea Game Society
• /
• v.6 no.3
• /
• pp.13-22
• /
• 2006

Games such as sports, RTS, RPG, which teams of players play, require advanced artificial intelligence technology for team management. The existing artificial intelligence enables an intelligent agent to have the autonomy solving problem by itself, but to lack interaction and cooperation between agents. This paper presents "Level Unified Approach Method" with effective role allocation and autonomy in multiagent system. This method allots sub-goals to agents using role information to accomplish a global goal. Each agent makes a decision and takes actions by itself in dynamic environments. Global goal of Team coordinates to allocated role in tactics approach. Each agent leads interactive cooperation by sharing state information with another using Databoard, As each agent has planning capacity, an agent takes appropriate actions for playing allocated roles in dynamic environments. This cooperation and interactive operation between agents causes a collision problem, so it approaches at tactics side for controlling this problem. Our experimental result shows that "Level Unified Approach Method" has better performance than existing rental approach method or de-centralized approach method.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.43 no.6 s.312
• /
• pp.1-8
• /
• 2006

Many researches on path planning and obstacle avoidance for the fundamentals of mobile robot have been done recently. Informations from various sensors can be used to find obstacles and plan feasible path. In spite of many solutions of finding optimal path, each can be applied in only a constrained condition. This means that it is difficult to find university good algorithm. An optimal path with a complicated computation generates a time delay which cannot avoid moving obstacles. In this paper, we propose an algorithm of path planning and obstacle avoidance for mobile robot. We call the proposed method Random Access Sequence(RAS) method. In the proposed method, a small region is set first and numbers are assigned to its neighbors, then the path is selected using these numbers and cumulative numbers. It has an advantage of fast planning time and completeness of path if one exists. This means that new path selection may be possible within short time and that helps a robot to avoid obstacle in dynamic environments. Using the information of the start and destination position, the RAS can be performed for collision-free navigation by reforming feasible paths repeatedly in dynamic environments.

• Journal of Korea Multimedia Society
• /
• v.9 no.1
• /
• pp.59-72
• /
• 2006

The rapid growth of technology for network and terminal devices is able to service multimedia contents in mobile environments. But as the environment of networks and the performance of devices is varied, the same quality service is very difficult to be provided for user in internet and mobile environment. Therefore, multimedia streaming system must provide an adaptive service in considering network and device environment. Video transcoding techniques are the good solution that can provide video streaming service in various network environments adaptively. This paper proposes a dynamic frame-skipping transcoding scheme to provide adaptive streaming service in various network environments. This scheme uses the prediction period for transcoding. A proposed transcoding scheme can reduce time complexity through combination of prediction period and skipping period to control frame-skipping rate in encoder. In simulation results, the performance of proposed scheme is similar to the performance of a traditional dynamic frame-skipping scheme in PSNR value. But the performance of proposed scheme outperforms the performance of traditional scheme in time complexity.

• Journal of Electrical Engineering and Technology
• /
• v.10 no.1
• /
• pp.372-378
• /
• 2015

Background subtraction is the first processing stage in video surveillance. It is a general term for a process which aims to separate foreground objects from a background. The goal is to construct and maintain a statistical representation of the scene that the camera sees. The output of background subtraction will be an input to a higher-level process. Background subtraction under dynamic environment in the video sequences is one such complex task. It is an important research topic in image analysis and computer vision domains. This work deals background modeling based on modified adaptive Gaussian mixture model (GMM) with three temporal differencing (TTD) method in dynamic environment. The results of background subtraction on several sequences in various testing environments show that the proposed method is efficient and robust for the dynamic environment and achieves good accuracy.

• Journal of information and communication convergence engineering
• /
• v.15 no.1
• /
• pp.28-36
• /
• 2017

The medium access control (MAC) protocol based on dynamic time division multiple access/time division duplex (TDMA/TDD) is responsible for random access control and radio resource allocation in dynamic traffic environments. These functions of random access and resource allocation are very important to prevent wastage of resources and improve MAC performance according to various network conditions. In this paper, we propose new random access and resource allocation schemes to guarantee quality of service (QoS) and provide priority services in a dynamic TDMA/TDD system. First, for the QoS guarantee, we propose an adaptive random access and resource allocation scheme by introducing an access probability. Second, for providing priority service, we propose a priority-based random access and resource allocation scheme by extending the first adaptive scheme in both a centralized and a distributed manner. The analysis and simulation results show that the proposed MAC protocol outperforms the legacy MAC protocol using a simple binary exponential backoff algorithm, and provides good differential performance according to priorities with respect to the throughput and delay.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.2 no.4
• /
• pp.233-241
• /
• 2007

In an ubiquitous environment, for controlling user access according to environment of users, a number of access control models enforcing dynamic environment of users have been proposed. However, they do not support personalized environments of each user and have a run-time overhead of searching active roles. In this paper, we propose a new model, PE-RBAC, that extends the RBAC architecture by addition of a personalized environment component as a constraint to accommodate dynamic and mobile users. In this model, a dynamic role activation is presented by using a new role-to-environment structure instead of the conventional role hierarchy, which makes it efficient to find the active roles according to a user's personalized environment.

• Journal of KSNVE
• /
• v.10 no.6
• /
• pp.1017-1021
• /
• 2000

This paper addresses experimental results carried out to investigate the characteristics of dynamic mass for Korean. Vertical seat vibration in the frequency range of 0.5-30 Hz was applied to a seated Korean male subject. To examine the intra-variable effects on dynamic mass, five different postures and three different vibration excitation levels were considered. The applied acceleration and transmitted force to the hip of the seated subject were measured simultaneously. Detailed experimental results of measured dynamic mass are illustrated for each posture and/or vibration excitation level. Maximum peaks of around 5 Hz were observed for most experimental cases. They are found to allow the identification of dynamic characteristics of Korean seated body for various real vibration environments. Furthermore, they are expected to be very useful in designing new seats for automotive and railway vehicles and in improving their vibration ride duality.

• Journal of the Korea Society for Simulation
• /
• v.12 no.4
• /
• pp.51-59
• /
• 2003

Real-Time applications on Grid environment have several problems in terms of resource management addressed as follows; (1) dynamic resource allocation to provide QoS objectives, (2) heterogeneous resources that is different scale, or capacity in same unit, and (3) resource availability, and resource needs. This paper describes the techniques of resource manager (RM) handling above problems to support QoS of dynamic real-time applications on Grid. The contributions of this paper to solve problems are as follows: unification of dynamic resource requirements among heterogeneous hosts, control of resources in heterogeneous environments, and dynamic load balancing/sharing. Our heuristic allocation scheme works not only 257% better than random, 142% better than round robin, and 36.4% better than least load in QoS sensitivity, but also 38.6% better than random, 28.5% better than round robin, and 31.6% better than least load in QoS.