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

이동 컴퓨팅(Mobile Computing)의 상업적인 응용분야로서, 지능형 교통정보시스템(ITS)에서의 첨단 여행자 정보시스템(ATIS)이 있다. ATIS에서 가장 중요한 이동 컴퓨팅 태스크는 현재 위치에서 목적지까지의 최단 경로를 계산하는 일이다. 본 논문에서는 최단 경로 재 계산 문제에 대해서 연구하였다. 이 문제는 전자 수치 지도(topological digital road map)상의 간선(edge) 비용이 동적인 교통 상태에 따라 빈번하게 갱신되고 있는 ATIS의 동적 경로 안내 시스템(URGS)에서 발생한다. 지금까지 제안된 방법들은 처음부터 최단 경로를 재계산하거나, 또는 단지 비용의 변화가 일어난 간건 상에 있는 양 끝 노드 사이에 대해서 최단 경로를 재계산할 뿐이다. 본 논문에서는 앞서 계산된 최단 경로에 대한 정보를 이용하는 효율적인 적응형 슬라이딩 윈도우 기반의 근접 최단 경로 재 계산 방법을 제안한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10a
• /
• pp.278-280
• /
• 1999

실시간 GIS 응용 프로그램에서는 기존의 GIS 시스템과는 달리 동적인 공간데이터가 신뢰성을 위해 일정한 시간 내에 갱신되어야 유효성을 유지하며, 사용자가 요청하는 질의는 일정 시간 내에 처리되어야 하는 시간제약조건을 갖는다. 이러한 GIS응용프로그램을 지원하기 위한 실시간 공간데이터베이스 시스템에서는 기존의 실시간 데이터베이스 시스템에서 고려되지 않은 동적 실시간 공간데이터와 실시간 공간질의에 대한 처리가 필요하며 질의 처리 시 실시간 데이터와 실시간트랜잭션의 시간제약조건의 만족을 초대화하기 위한 고려가 필요하다. 본 논문에서는 실시간 공간질의 처리 시 예측성을 최대화 하기 위해 질의에서 빈번히 사용되는 데이터를 주기억상주 데이터베이스에 저장하였고, 실시간 공간데이터의 관리를 위하여 공간질의어를 확장하였다. 또한 실시간 공간질의 처리 시에 실시간 데이터와 실시간트랜잭션의 시간제약조건을 최대한 만족시키기 위해 공간질의 분석과 연산 순서의 재배치 기법을 사용하였다.

• Journal of KIISE:Information Networking
• /
• v.35 no.4
• /
• pp.345-354
• /
• 2008

Recently, small-scale mobile network which is composed of many mobile devices in a man becomes popular. Also, Examples of large-scale mobile network can be thought access networks deployed on public transportation such as ships, trains and buses. To provide seamless mobility for mobile nodes in this mobile network, binding update messages must be exchanged frequently. However, it incurs network overhead increasingly and decreases energy efficiency of mobile router. If we try to reduce the number of the messages to cope with the problem, it may happen the security -related problems conversely Thus, mobile router needs a effective algorithm to update location information with low cost and to cover security problems. In this paper, mobility management scheme based on mobile router's mobility pattern is proposed. Whenever each mobile router leaves a visiting network, it records related information as moving log. And then it periodically computes mean resident time for all visited network, and saves them in the profile. If each mobile router moves into the visited network hereafter, the number of binding update messages can be reduced since current resident time may be expected based on the profile. At this time, of course, security problems can happen. The problems, however, are solved using key credit, which just sends some keys once. Through extensive experiments, bandwidth usages are measured to compare binding update messages in proposed scheme with that in existing scheme. From the results, we can reduce about 65% of mobility-management-related messages especially when mobile router stays more than 50 minutes in a network. Namely, the proposed scheme improves network usage and energy usage of mobile router by decreasing the number of messages and authorization procedure.

• Journal of KIISE
• /
• v.43 no.7
• /
• pp.801-811
• /
• 2016

Self-adaptive systems (SASs) can change their goals and behaviors to achieve its ultimate goal in a dynamic execution environment. Existing approaches have designed, at the design time, utility functions to evaluate and predict the goal satisfaction, and set policies that are crucial to achieve each goal. The systems can be adapted to various runtime environments by utilizing the pre-defined utility functions and policies. These approaches, however, may or may not guarantee the proper adaptability, because system designers cannot assume and predict all system environment perfectly at the design time. To cope with this problem, this paper proposes a new method of dynamic decision making, which takes the following steps: firstly we design a Dynamic Decision Network (DDN) with environmental data and goal model that reflect system contexts; secondly, the goal satisfaction is evaluated and predicted with the designed DDN and real-time environmental information. We furthermore propose a dynamic reflection method that changes the model by using newly generated data in real-time. The proposed method was actually applied to ROBOCODE, and verified its effectiveness by comparing to conventional static decision making.

• Journal of the Korea Society of Computer and Information
• /
• v.28 no.12
• /
• pp.89-96
• /
• 2023

In this paper, we propose a GPU-based method for real-time processing of dynamic re-meshing required for tearing cloth. Thin shell materials are used in various fields such as physics-based simulation/animation, games, and virtual reality. Tearing the fabric requires dynamically updating the geometry and connectivity, making the process complex and computationally intensive. This process needs to be fast, especially when dealing with interactive content. Most methods perform re-meshing through low-resolution simulations to maintain real-time, or rely on an already segmented pattern, which is not considered dynamic re-meshing, and the quality of the torn pattern is low. In this paper, we propose a new GPU-optimized dynamic re-meshing algorithm that enables real-time processing of high-resolution fabric tears. The method proposed in this paper can be used for virtual surgical simulation and physics-based modeling in games and virtual environments that require real-time, as it allows dynamic re-meshing rather than pre-split meshes.

• Journal of Korea Multimedia Society
• /
• v.7 no.3
• /
• pp.388-398
• /
• 2004

This paper focuses on the reduction method of message traffic occurred when multiple participants collaborate in the distributed virtual environment. It is referred to as filtering method of update message to minimize data traffic exchanged in the virtual environment, and it is the essential process to improve the scalability of the virtual environment. Spatial partitioning method, a popular filtering technique, divides the whole environment into smaller sub-parts in order to make it small the regions to be maintained consistently. However, it is less flexible and adaptable because the information of area of interest must be configured before simulation. In this paper, the concept of dynamic area of interest is proposed, which is highly adaptable by applying dynamic environmental elements to AOI management. It uses multiple layering and multiple consistency algorithms for dynamic management, and makes it possible to consume system resource efficiently. For performance evaluation, experiments are performed with virtual avatars, measuring message traffic. Finally, the proposed model could be applied to the AOI management systems which accommodate massive users like MMORPG, or virtual communities.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2010.07a
• /
• pp.31-33
• /
• 2010

웹 사용 환경에서의 새로운 웹 환경의 적용은 이전의 정적인 웹 환경에서 동적인 웹 사용 환경으로 움직이고 있다는 것을 의미하며, 새로이 생성된 데이터에 의하여 모든 것이 움직이게 됨을 의미되며, 이에 따라 정적인 웹과 동적인 웹에서 사용되는 웹 페이지의 일반적인 성격을 분석하면 단순한 정적 및 동적 페이지의 성격만을 보여주지 않는다. 이러한 관점에서 새로운 웹 운영 환경은 읽기만 하는 웹부터 메타웹까지의 기본적인 개념을 모두 적용하며, 이 과정에서 가장 중요하게 여겨지는 것이 바로 웹뷰로 새로운 웹 사용 환경을 통하여 만들어진 데이터가 웹 인터페이스를 통하여 사용자에게 결과를 전송하게 되며, 새로운 웹 사용 환경에서는 주변에서의 끊임없는 데이터의 갱신을 통하여 다양한 사용자 요구에 따른 결과를 생성, 전송하게 된다. 그러나 웹은 데이터 모델의 사용과 질의어 정의 등에 대한 서비스를 제공하지 않으며, 데이터베이스의 운용에 대한 개념도 존재하지 않아 처리되는 데이터에 대한 소유권에 대한 주장 등이 명확하지 않다. 이러한 문제점을 해결하기 위하여 본 연구에서는 새로운 웹 사용 환경과 웹 서비스의 관련성을 확인하여 추후의 응용에 대비하고자 한다.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.3
• /
• pp.659-669
• /
• 1997

Security as weel as consistency of data is very important issue in databaed security.This the serializability of transactions must be maintained and particularly covert channel not caesed between a high-level transaction and a low- level one.In this paper, we propose a secure transaction management algorithm using synamic version control] method that can slove disk space overhead to maintain multiversion and the problem that reansactions read too old versions when two versions are maintained.Disk space overhead can be sloved by properly cerating versions and synamically maintaining the number of versions and the problem for reading too old version can be solved by having transactions read versions as recent as possible.

• KIISE Transactions on Computing Practices
• /
• v.23 no.6
• /
• pp.379-385
• /
• 2017

In enterprise environments, hybrid storage typically utilizes SSDs over disk-based RAID. Typically, SSDs over RAID are used as the data cache. Recently, the LeavO caching scheme was introduced to reduce the parity update overhead of the underlying RAID. In this paper, we combine the data caching and LeavO caching schemes and derive cost models of the combined cache to determine the optimal data and LeavO cache sizes. We also propose the Adaptive Combined Cache that dynamically adjusts the data cache and LeavO cache sizes for evolving workloads. Experimental results show that the performance of the Adaptive Combined Cache is significantly superior to that of the conventional data caching scheme and is comparable with that of the off-line optimal scheme.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.11 no.4
• /
• pp.77-89
• /
• 2001

Recently, with the explosive growth of communication technologies, group oriented services such as teleconference and multi-player game are increasing. Access control to information is handled by secret communications with group keys shared among members, and efficient updating of group keys is vital to such secret communications of large and dynamic groups. In this paper, we employ (2,4)-tree as a key tree, which is one of height balanced trees, to reduce the number of key updates caused by join or leave of members. Especially, we use CBT(Core Based Tree) to gather network configurations of group members and reflect this information to key tree structure to update group keys efficiently when splitting or merging of subgroups occurs by network failure or recovery.