• Journal of Multimedia Information System
• /
• v.7 no.4
• /
• pp.263-268
• /
• 2020

This paper introduces an event modeling and simulation system using behavior trees. The system aims to overcome the limitations of existing fixed, simple scenario-based training content, and to extend the behavior of objects to enable various experience deployments. To achieve this goal, we made specific tasks of behavior trees can change according to users' reaction and developed an adaptive simulation module that can analyze and execute behavior trees that changes at runtime. In order to validate our approach, we applied the adaptive behavior tree simulation to the scenarios in our virtual reality simulation-based fire training system we have been developing and demonstrated the implementation results.

• The Journal of Korea Robotics Society
• /
• v.18 no.1
• /
• pp.59-65
• /
• 2023

This paper proposes an Extended and Adaptive Inverse Perspective Mapping (EA-IPM) model that can obtain an accurate bird's-eye view (BEV) from the forward-looking monocular camera on the sidewalk with various curves. While Inverse Perspective Mapping (IPM) is a good way to obtain ground information, conventional methods assume a fixed relationship between the camera and the ground. Due to the nature of the driving environment of the mobile robot, there are more walking environments with frequent motion changes than flat roads, which have a fatal effect on IPM results. Therefore, we have developed an extended IPM process to be applicable in IPM on sidewalks by adding a formula for complementary Y-derive processes and roll motions to the existing adaptive IPM model that is robust to pitch motions. To convince the performance of the proposed method, we evaluated our results on both synthetic and real road and sidewalk datasets.

• The KIPS Transactions:PartD
• /
• v.15D no.3
• /
• pp.361-374
• /
• 2008

In the latest intelligent computing environments, the self-adaptive software, as new software paradigm, which modifies its own behavior in response to changes in its operating environment is needed. To develop the self-adaptive software, it is necessary to analyze and design the context of software as well as the structure and the behavior of software. We need more efforts for self-adaptive software development than for traditional software development because we need more activities and technologies like context modeling and adaptation to develop the self-adaptive software. In this paper, we present the product line architecture for self-adaptive software and templates of artifacts to improve the efficiency of development through a reuse methodology. The artifacts of the architecture support the systematic reuse activities of core assets by expressing the commonality and variability of product line.

• KIPS Transactions on Computer and Communication Systems
• /
• v.5 no.1
• /
• pp.17-26
• /
• 2016

IoT means things space networks that form the intelligent relationship such as sensing, networking, information processing about human being, things and service without explicit mutual cooperation of human being. Lately many IoT groups such as AllSeen Alliance, OIC launched a platform for IoT. Self-adaptive is aimed at implementation without the need for decisions of human being during the operation, so that the machine can respond to changes in its own determination. There is a need to apply the concept of self-adaptive to existing IoT and IoT platform. So In this paper, We look for trends of existing IoT, IoT platform and comparisons by applying a self-adaptive concept to IoT, IoT platform. In addition as an example of this paper, we suggest lacking self-adaptive elements to OIC.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.7
• /
• pp.752-765
• /
• 1999

대부분 병렬처리 시스템에서 성능 파라미터는 복잡하고 프로그램의 수행 시 예견할 수 없게 변하기 때문에 컴파일러가 프로그램 수행에 대한 최적의 성능 파라미터들을 컴파일 시에 결정하기가 힘들다. 본 논문은 병렬 처리 시스템의 프로그램 수행 시, 변화하는 시스템 성능 상태에 따라 전체 성능이 최적화로 적응하는 적응 수행 방식을 제안한다. 본 논문에서는 이 적응 수행 방식 중에 적응 프로그램 수행을 위한 이론적인 방법론 및 구현 방법에 대해 제안하고 적응 제어 수행을 위해 프로그램의 데이타 공유 단위에 대한 적응방식(적응 입도 방식)을 사용한다. 적응 프로그램 수행 방식은 프로그램 수행 시 하드웨어와 컴파일러의 도움으로 프로그램 자신이 최적의 성능을 얻을 수 있도록 적응하는 방식이다. 적응 제어 수행을 위해 수행 시에 병렬 분산 공유 메모리 시스템에서 프로세서 간 공유될 수 있은 데이타의 공유 상태에 따라 공유 데이타의 크기를 변화시키는 적응 입도 방식을 적용했다. 적응 입도 방식은 기존의 공유 메모리 시스템의 공유 데이타 단위의 통신 방식에 대단위 데이타의 전송 방식을 사용자의 입장에 투명하게 통합한 방식이다. 시뮬레이션 결과에 의하면 적응 입도 방식에 의해서 하드웨어 분산 공유 메모리 시스템보다 43%까지 성능이 개선되었다. Abstract On parallel machines, in which performance parameters change dynamically in complex and unpredictable ways, it is difficult for compilers to predict the optimal values of the parameters at compile time. Furthermore, these optimal values may change as the program executes. This paper addresses this problem by proposing adaptive execution that makes the program or control execution adapt in response to changes in machine conditions. Adaptive program execution makes it possible for programs to adapt themselves through the collaboration of the hardware and the compiler. For adaptive control execution, we applied the adaptive scheme to the granularity of sharing adaptive granularity. Adaptive granularity is a communication scheme that effectively and transparently integrates bulk transfer into the shared memory paradigm, with a varying granularity depending on the sharing behavior. Simulation results show that adaptive granularity improves performance up to 43% over the hardware implementation of distributed shared memory systems.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.37 no.4
• /
• pp.283-293
• /
• 2024

In this study, advanced unscented Kalman filter (UKF) and particle filter (PF) implementations are introduced and applied to perform system identification (SI) for sudden structural damage induced by seismic loading. These two methods are then compared to validate their applicability to SI tasks. For this validation, the Bouc- Wen model is used to simulate the nonlinear shear-building response, and an adaptive rule (i.e., an adaptive tracking method) is applied to the two filter methods to improve their tracking performance during sudden changes in system properties. When the original UKF and PF are applied to an earthquake scenario, both methods fail to estimate the damage initiation time and post-damage parameter values. After applying the adaptive tracking method, it is found for both methods that although the occurrence time is identified, the estimation of the damage state is still not accurate. To improve the accuracy, an adjusted adaptive tracking method is applied, and the two methods then derive accurate estimates. Finally, when considering the computation time, UKF is promoted as a better choice for practical applications, provided that a proper adaptive tracking method is implemented.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2005.05a
• /
• pp.498-503
• /
• 2005

This paper is concerned with the implementation of adaptive positive position feedback controller using a digital signal processor and microcontroller The main advantage of the positive position feedback controller is that it can control a natural mode of interest by tuning the filter frequency of the positive position feedback controller to the natural frequency of the target mode. However, the positive position feedback controller loses its advantage when mistuned. In this paper, the fast fourier transform algorithm is implemented on the microcontroller whereas the positive position feedback controller is implemented on the digital signal processor. After calculating the frequency which affects the vibrations of structure most the result is transferred to the digital signal processor. The digital signal processor updates the information on the frequency to be controlled so that it can cope with both internal and external changes. The proposed scheme was installed and tested using a beam equipped with piezoceramic sensor and actuator. The experimental results show that the adaptive positive position feedback controller proposed in this paper can suppress vibrations even when the target structure undergoes structural change thus validating the approach.

• 한국HCI학회:학술대회논문집
• /
• 2009.02a
• /
• pp.193-196
• /
• 2009

Most of studies adopt a fixed skin color model to segment skin color region in a single image. The methods, however, result in low detection rates or high false positive error rates since the distribution of skin color is varies depending on the characteristics of input image. For the effective skin color segmentation, therefore, we need a adaptive skin color model which changes the model depending on the color distribution of input image. In this paper, we propose a novel adaptive skin color segmentation algorithm consisting of 2 stages which results in both high detection rate and low false positive error rate.

• Journal of Korea Multimedia Society
• /
• v.21 no.10
• /
• pp.1182-1194
• /
• 2018

The Dynamic Adaptive Streaming over HTTP(DASH) is envisioned to evolve to meet an increasing demand on providing seamless video streaming services in the near future. The DASH performance heavily depends on the client's adaptive quality selection algorithm that is not included in the standard. The existing conventional algorithms are basically based on a procedural algorithm that is not easy to capture and reflect all variations of dynamic network and traffic conditions in a variety of network environments. To solve this problem, this paper proposes a novel quality selection mechanism based on the Deep Q-Network(DQN) model, the DQN-based DASH Adaptive Bitrate(ABR) mechanism. The proposed mechanism adopts a new reward calculation method based on five major performance metrics to reflect the current conditions of networks and devices in real time. In addition, the size of the consecutive video segment to be downloaded is also considered as a major learning metric to reflect a variety of video encodings. Experimental results show that the proposed mechanism quickly selects a suitable video quality even in high error rate environments, significantly reducing frequency of quality changes compared to the existing algorithm and simultaneously improving average video quality during video playback.

• Journal of Communications and Networks
• /
• v.7 no.4
• /
• pp.489-498
• /
• 2005

For better performance over a noisy channel, mobile wireless networks transmit packets with forward error correction (FEC) code to recover corrupt bits without retransmission. The static determination of the FEC code size, however, degrades their performance since the evaluation of the underlying channel state is hardly accurate and even widely varied. Our measurements over a wireless sensor network, for example, show that the average bit error rate (BER) per second or per minute continuously changes from 0 up to $10^{-3}$. Under this environment, wireless networks waste their bandwidth since they can't deterministically select the appropriate size of FEC code matching to the fluctuating channel BER. This paper proposes an adaptive FEC technique called adaptive FEC code control (AFECCC), which dynamically tunes the amount of FEC code per packet based on the arrival of acknowl­edgement packets without any specific information such as signal to noise ratio (SNR) or BER from receivers. Our simulation experiments indicate that AFECCC performs better than any static FEC algorithm and some conventional dynamic hybrid FEC/ARQ algorithms when wireless channels are modeled with two-state Markov chain, chaotic map, and traces collected from real sensor networks. Finally, AFECCC implemented in sensor motes achieves better performance than any static FEC algorithm.