• Title/Summary/Keyword: Dynamic update

Search Result 271, Processing Time 0.031 seconds

An XML-based Content Management System supporting Dynamic Content Caching (동적 컨텐츠 캐싱을 지원하는 XML 기반의 컨텐츠 관리 시스템의 구현)

  • Koo Heung-Seo
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.15 no.7
    • /
    • pp.794-799
    • /
    • 2005
  • In this paper, We describe the XML-based Web content management system that supports the efficient dynamic content publishing environment. EasyCM is designed based on Cocoon2 that is the XML publishing framework. We propose the publishing mechanism to support the efficient dynamic content publishing environment to expand into the available dynamic content caching to Cocoon2. Publishing mechanism of EasyCM draws XML object from content repository, associates XML with XSLT, creates and caches content components preprocessing HTML transformation process, and publish web pages constructed into cached content component. For supporting more efficient caching, EasyCM supports also content component update, two update method that is immediately-update and delay-update for updated content component.

Robust Localization Algorithm for Mobile Robots in a Dynamic Environment with an Incomplete Map (동적 환경에서 불완전한 지도를 이용한 이동로봇의 강인한 위치인식 알고리즘의 개발)

  • Lee, Jung-Suk;Chung, Wan Kyun;Nam, Sang Yep
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.3 no.2
    • /
    • pp.109-118
    • /
    • 2008
  • We present a robust localization algorithm using particle filter for mobile robots in a dynamic environment. It is difficult to describe moving obstacles like people or other robots on the map and the environment is changed after mapping. A mobile robot cannot estimate its pose robustly with this incomplete map because sensor observations are corrupted by un-modeled obstacles. The proposed algorithms provide robustness in such a dynamic environment by suppressing the effect of corrupted sensor observations with a selective update or a sampling from non-corrupted window. A selective update method makes some particles keep track of the robot, not affected by the corrupted observation. In a sampling from non-corrupted window method, particles are always sampled from several particle sets which use only non-corrupted observation. The robustness of proposed algorithm is validated with experiments and simulations.

  • PDF

MMORPG의 Version Up 전략을 통한 이용자 유지 - System Dynamics 기법을 활용한 업데이트(Update)와 CRM전략 분석 -

  • No, Tae-Woo;Baek, Ok-Hui;Lee, Sang-Geun
    • 한국경영정보학회:학술대회논문집
    • /
    • 2008.06a
    • /
    • pp.383-393
    • /
    • 2008
  • Online games are the popular topic due to the increased total online game market volume nowadays. And many studies on online games are released. But most studies used the questionnaire method that reveals only section of the situation like a snapshot. For this reason, previous studies have a little limitation that does not show dynamical changing issues like a product life cycle and changes in customer's mind Because of this, we studied on online games with the system dynamic model which can show dynamic simulations to analysis time series data. We chose MMORPG (Massively Multi-play Online) RPG (Role Playing Game) in sort of online games because it has many absorbing factors and enthusiastic users. We designed the simulation model which analyzes the influences of update and CRM strategy on users. We put the game developer who is ready for updated version game and released that periodically and focused on dormant users who used to be enthusiastic about MMORPG. The simulation results showed that the update has positive influences on new users gathering and hold established users. And CRM strategies help to prevent dormant users from transferring to rivals by offering them re-absorbing factors. Through this study, we confirmed the importance of update on online games and the necessity of introducing CRM strategy in the online game market.

  • PDF

Performance Improvement of an INS by using a Magnetometer with Pedestrian Dynamic Constraints

  • Woyano, Feyissa;Park, Aangjoon;Lee, Soyeon
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.6 no.1
    • /
    • pp.1-9
    • /
    • 2017
  • This paper proposes to improve the performance of a strap down inertial navigation system using a foot-mounted low-cost inertial measurement unit/magnetometer by configuring an attitude and heading reference system. To track position accurately and for attitude estimations, considering different dynamic constraints, magnetic measurement and a zero velocity update technique is used. A conventional strap down method based on integrating angular rate to determine attitude will inevitably induce long-term drift, while magnetometers are subject to short-term orientation errors. To eliminate this accumulative error, and thus, use the navigation system for a long-duration mission, a hybrid configuration by integrating a miniature micro electromechanical system (MEMS)-based attitude and heading detector with the conventional navigation system is proposed in this paper. The attitude and heading detector is composed of three-axis MEMS accelerometers and three-axis MEMS magnetometers. With an absolute algorithm based on gravity and Earth's magnetic field, rather than an integral algorithm, the attitude detector can obtain an absolute attitude and heading estimation without drift errors, so it can be used to adjust the attitude and orientation of the strap down system. Finally, we verify (by both formula analysis and from test results) that the accumulative errors are effectively eliminated via this hybrid scheme.

DNS-based Dynamic Load Balancing Method on a Distributed Web-server System (분산 웹 서버 시스템에서의 DNS 기반 동적 부하분산 기법)

  • Moon, Jong-Bae;Kim, Myung-Ho
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.33 no.3
    • /
    • pp.193-204
    • /
    • 2006
  • In most existing distributed Web systems, incoming requests are distributed to servers via Domain Name System (DNS). Although such systems are simple to implement, the address caching mechanism easily results in load unbalancing among servers. Moreover, modification of the DNS is necessary to load considering the server's state. In this paper, we propose a new dynamic load balancing method using dynamic DNS update and round-robin mechanism. The proposed method performs effective load balancing without modification of the DNS. In this method, a server can dynamically be added to or removed from the DNS list according to the server's load. By removing the overloaded server from the DNS list, the response time becomes faster. For dynamic scheduling, we propose a scheduling algorithm that considers the CPU, memory, and network usage. We can select a scheduling policy based on resources usage. The proposed system can easily be managed by a GUI-based management tool. Experiments show that modules implemented in this paper have low impact on the proposed system. Furthermore, experiments show that both the response time and the file transfer rate of the proposed system are faster than those of a pure Round-Robin DNS.

An Implementation of Dynamic Software Update System for C Application Programs (C 응용 프로그램의 동적 소프트웨어 업데이트 시스템 개발)

  • Shin, Dongha;Kim, Ji-Hyeon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.18 no.4
    • /
    • pp.1-11
    • /
    • 2013
  • Dynamic Software Update(DSU) is a technique, which updates a new version of the software to a running process without stopping. Many DSU systems that update C application programs are introduced. However, these DSU systems differ in implementation method or in main features. In this paper, we propose a new DSU system that can solve some disadvantages of existing DSU systems. DSU system presented in this paper splits existing program to code, global data and local data and then updates each part of the program considering the characteristics of the respective parts. The proposed system in this paper is implemented and tested on Linux. Also, we compared our DSU system with other DSU systems and we could find some strength of our DSU system. First, the code memory usage of our DSU system can be efficient since our system does not need to maintain code of an old version. Second, the global data memory waste is small because our system does not need to allocate the global data again which is not modified in the new version. Finally, we restore local data of old version in stack area of the new version using stack reconstruction technique. This paper is meaningful since we proposed a new DSU method and we implemented a full DSU system using the method.

Metadata Management for E-Commerce Transactions in Digital Library (디지털 도서관에서 전자상거래 트랜잭션을 위한 메타데이타 관리 기법)

  • Choe, Il-Hwan;Park, Seog
    • Journal of KIISE:Databases
    • /
    • v.29 no.1
    • /
    • pp.34-43
    • /
    • 2002
  • Since traditional static metadata set like Dublin Core has static metadata attributes about bibliography information, integration of metadata for various metadata, problems about standard and extension of metadata must be considered for applying it to new environment. Specially, as event-driven metadata write method included the notion of e-commerce come out for interoperability in digital libraries, traditional metadata management which cannot distinguish between different kinds of update operations to new extension of metadata set occurs unsuitable waiting of update operation. So, improvement is needed about it. In this paper, we show whether alleviative transaction consistency can be applied to digital library or not. Also it would divide newer metadata into static metadata attribute connected in read operation within user read-only transaction and dynamic metadata attribute in update operation within dynamic(e-commerce) update transactions. We propose newer metadata management algorithm considered in classfication of metadata attributes and dynamic update transaction. Using two version for minimal maintenance cost and ARU(Appended Refresh Unit) for dynamic update transaction, to minimize conflict between read and write operations shows fast response time and high recency ratio. As a result of the performance evaluation, we show our algorithm is proved to be better than other algorithms in newer metadata environments.

A Study on Secure Interaction of DHCP Server with DNS Server

  • Ham Young Hwan;Chung Byung Ho;Chung Kyo Il
    • Proceedings of the IEEK Conference
    • /
    • 2004.08c
    • /
    • pp.544-548
    • /
    • 2004
  • DHCP(Dynamic Host Configuration Protocol) is a protocol which dynamically allocates an IP address and/or host configuration parameters to a host. The DHCP client's address can be changed dynamically any time. For the possible communication with other system, the DHCP client has to inform its address to the DNS system with dynamic update facility. But the DNS dynamic update has a problem related to the security. So we proposed the efficient mechanism for the secure integration of DHCP and DNS by using DNS security extensions. The system also uses the DNS server as the certificate repository for the storing & retrieval of each other's certificate.

  • PDF

Update Method based on Dynamic Access-Frequency Tree in Grid Database System (그리드 데이터베이스 환경에서 동적 접근 빈도를 이용한 갱신 기법)

  • Shin, Soong-Sun;Back, Sung-Ha;Lee, Yeon;Lee, Dong-Wook;Kim, Gyoung-Bae;Chung, Worn-Il;Bae, Hae-Young
    • Journal of Korea Multimedia Society
    • /
    • v.12 no.9
    • /
    • pp.1191-1200
    • /
    • 2009
  • The replicas in the Grid database is utilized for a lot of application services. And for deferent services or for deferent information depends on location, the access frequency of each replica is dissimilar. When one replica is stored in many nodes, each replicas applies the week-consistency in the grid computing environment. Especially, when a node work load or operation capacity is varied from others, the replica management would cost expansive. Therefore, this paper proposed the Update Method based on Dynamic Access-Frequency Tree. The dynamic access-frequency tree is pre-constructed by grouping nodes based on each nodes access frequency to manage the replica efficiently and avoid unbalance replica tree. The performance evaluation shows the proposed methods support more quick update than current methods.

  • PDF

Interworking Architecture of ERICA Switch Mechanism for ABR Traffic Service in Public ATm Switch (ATM 공중망 스위치에서 ABR 트래픽을위한 ERICA 스위치 메커니즘과의 연동 구조)

  • Jeong, Il-Yeong;Gang, Seong-Yeol;Jeong, Taek-Won
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.1
    • /
    • pp.148-158
    • /
    • 1999
  • ABR traffic form ATM LAN is controlled through RM cell, and the interface function to public ATM network is necessary to provide ABR service efficiently. This paper presnets new interface architecture, which is based on "Projected Node" [6]. using AIPU(ABR Interface Proxy Unit) to support ABR traffic streams incoming from ATM LAN in the public ATM network. For the efficient interworking, the AIPU has designed for interworking functions with ERICA switch mechanism. Conventional ERICA switch mechanism specified in TM 4.0 is basically used for short distance comparative to public network, however AIPU adopts the novel control mechanism to cover logng roud trip time (RTT). To improve the problems and to provide a dynamic range of UCI(Update Count Interval), this paper proposes, a novel control scheme, DUCI ( Dynamic Update Count Interval. And the paper shows inefficiencies of ERICA mechanism with fixed UCI through the simulation results, and represents the performance enhancement of DUCI mechanism developed to adjust the update count interval dynamically.

  • PDF