• Journal of KIISE:Databases
• /
• v.33 no.1
• /
• pp.69-85
• /
• 2006

Broadcast has been often used to disseminate the frequently requested data efficiently to a large volume of mobile clients over a single or multiple channels. Conventional concurrency control protocols for mobile transactions are not suitable for the wireless broadcast environments due to the limited bandwidth of the up-link communication channel. In wireless broadcast environments, the server often broadcast different data items with different frequency to incorporate the data access patterns of mobile transactions. The previously proposed concurrency control protocols for mobile transactions in wireless broadcast environments are focused on the mobile transactions with uniform data access patterns. However, these protocols perform poorly when the data access pattern of update mobile transaction are not uniform but skewed. The update mobile transactions with skewed data access patterns will be frequently aborted and restarted due 4o the update conflict of the same data items with a high access frequency. In this paper, we propose an energy-efficient concurrence control protocol for mobile transactions with skewed data access as well as uniform data access patterns. Our protocol use a random back-off technique to avoid the frequent abort and restart of update mobile transactions. We present in-depth experimental analysis of our method by comparing it with existing concurrency control protocols. Our performance analysis show that it significantly decrease the average response time, the amount of upstream and downstream bandwidth usage over existing protocols.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04a
• /
• pp.217-219
• /
• 2001

플래쉬 메모리는 데이터 저장 및 변경이 가능한 비휘발성 메모리로 가벼운 무게, 낮은 전력 소모, 충격에 대한 저항성과 빠른 데이터 처리 능력 때문에 이동형 컴퓨터 시스템에서 사용하기에 적당하다. 그러나 플래쉬 메모리는 덮어쓰기(update-in-place)가 불가능하고 각 메모리 셀에 대해 초기화 작업(erasing operation)의 수가 제한되어 있다. 이러한 단점들을 고려하여 세그먼트의 데이터 중 유효 데이터의 비율과 hot 데이터(가까운 시간 안에 update가 될 것이라는 예상되는 data)의 수, 세그멘트가 초기화되었던(easing) 횟수 등을 고려한 새로운 초기화 기법(cleaning policy)을 제안하고자 한다.

• Journal of Korean Society for Geospatial Information Science
• /
• v.15 no.3
• /
• pp.19-26
• /
• 2007

The renewal update of the digital map constructed through NGIS has been conducted for the enhancement of usage, maintenance so that the latest data is guaranteed. The total update has been done every five years for five regions of the country using aerial photographs and satellite images. By launching the third phase of NGIS, the updating plan was changed from total to total or partial update including the real time update scheme. Furthermore, the update period was improved from five to two years and four years for a large and a small city, respectively. Therefore, it is necessary to develope a matching technique which combines various geographic information (such as drawing map, surveying drawing and map) with exact position on the digital map. In this study, we developed a matching algorithm based on central point and suggested a method which uses general surveying drawing for revision/update of the digital map. The general survey is conducted when a civilian development on lands are approved. Thus, the outcome from the survey, which is the general survey drawing, contains the latest various contents such as road, building, water pipe and manhole. A consistent and efficient method using the general survey drawing for near real time update of the digital map by applying the developed matching algorithm is presented.

• 한국경영정보학회:학술대회논문집
• /
• 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.

• Proceedings of the IEEK Conference
• /
• 2009.05a
• /
• pp.267-269
• /
• 2009

Incomplete knowledge instances may be registered from misidentifications of sensors, such as vision sensor. In previous study, we proposed robust object instance registration method to robot centered knowledge framework to guarantee the consistency of the registered knowledge. In real environment, a persistent update is necessary due to the objects can be moved dynamically. In this paper, we propose the way to update robot knowledge continually using the registration method. Our experiment in this paper shows that sound and complete knowledge can be registered and updated by the proposed method, even under imperfect sensing data.

• Asia pacific journal of information systems
• /
• v.5 no.2
• /
• pp.131-142
• /
• 1995

In distributed database systems materialized views are useful to solve many problems caused by data replication. This paper deals with the problem of updating materialized views incluing join operations. We use a differential update which uses logs that record the change of base tables in certain periods. This method avoids locking of the base tables so that it makes the system more efficient. We update materialized views periodically to save the updating cost envolved. A screen test is applied to differential files to eliminate tuples that are irrelevant to any of the views being updated. Using these methods, a detailed procedure is addressed to refresh materialized views. Then we show that our update procedure performs better than a semijoin approach.

• Journal of Institute of Control, Robotics and Systems
• /
• v.16 no.5
• /
• pp.420-427
• /
• 2010

This paper describes a localization method based on Monte Carlo Localization approach for a mobile robot. The method uses range data which are measured from ultrasound transmitting beacons whose locations are given a priori. The ultrasound receiver on-board a robot detects the range from the beacons. The method requires several beacons, theoretically over three. The method proposes a sensor model for the range sensing based on statistical analysis of the sensor output. The experiment uses commercialized beacons and detector which are used for trilateration localization. The performance of the proposed method is verified through real implementation. Especially, it is shown that the performance of the localization degrades as the sensor update rate decreases compared with the MCL algorithm update rate. Though the method requires exact location of the beacons, it doesn't require geometrical map information of the environment. Also, it is applicable to estimation of the location of both the beacons and robot simultaneously.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.23 no.54
• /
• pp.1-11
• /
• 2000

This study suggests the partition algorithm for updating the discovered association rules in large database, because a database may allow frequent or occasional updates, and such update may not only invalidate some existing strong association rules, but also turn some weak rules into strong ones. the Partition algorithm updates strong association rules efficiently in the whole update database reuseing the information of the old large itemsets. Partition algorithms that is suggested in this study scans an incremental database in view of the fact that it is difficult to find the new set of large itemset in the whole updated database after an incremental database is added to the original database. This method of generating large itemsets is different from that of FUP(Fast Update) and KDP(Kim Dong Pil)

• Journal of Wellbeing Management and Applied Psychology
• /
• v.5 no.2
• /
• pp.11-14
• /
• 2022

Purpose: The purpose of this study is to investigate the structural causal relationship between the SNS marketing attributes of luxury brands on brand awareness, brand involvement, and brand attachment. Research design, data and methodology: To this end, a survey was conducted on 427 users of large Internet communities and SNS. The results of the empirical analysis are summarized as follows. Results: First, among SNS marketing attributes, information, reliability, and update had a significant positive (+) influence on purchase intention. Second, among SNS marketing attributes, informativity, interaction, playability, and update had a significant positive (+) influence on brand recognition. Reliability, interaction, and update had a significant positive (+) effect on brand involvement. In addition, in brand attachment, playability and up-to-dateness had a significant positive (+) influence. Conclusions: Looking at the causal relationship between brand attitudes, there was a significant positive influence on brand involvement, and a significant positive influence on brand involvement, but the effect of brand awareness on brand attachment was not significant.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.13 no.5
• /
• pp.269-277
• /
• 2018

NAND flash memory has widely been used because of non-volatility, low power consumption and fast access time. However, it suffers from inability to provide update-in-place and the erase cycle is limited. The unit of read/write operation is a page and the unit of erase operation is a block. Moreover erase operation is slower than other operations. We proposed the Adaptive Garbage Collection (called "AGC") policy which focuses on not only reducing garbage collection process time for real-time guarantee but also wear-leveling for a flash memory lifetime. The AGC performs better than Cost-benefit policy and Greedy policy. But the AGC does not consider the operation characteristics. So we proposed the Advanced Adaptive Garbage Collection (called "A-AGC") policy which considers the page write operation count and block erase operation count. The A-AGC reduces the write operations by considering the data update frequency and update data size. Also, it reduces the erase operations by considering the file fragmentation. We implemented the A-AGC policy and measured the performance compared with the AGC policy. Simulation results show that the A-AGC policy performs better than AGC, specially for append operation.