• Journal of Industrial Technology
• /
• 제26권B호
• /
• pp.191-198
• /
• 2006

In this paper, we focus on a question. Which is better between time-based location update method and movement-based location update method? Or, does any other method combining the two methods show better performance? For the question, we propose a hybrid location update scheme, which integrates the time-based and the movement-based methods. In the proposed scheme, a mobile terminal updates its location after n cell boundary crossing and a time interval of T, or the inverse. We derive an analytical solution for the performance of the hybrid scheme with exponential cell resident time. From the numerical analysis, we conclude that the movement-based method seems to have better performance than the time-based and hybrid methods, that is the optimal costs occur at T=0.

• Journal of Mechanical Science and Technology
• /
• 제14권10호
• /
• pp.1122-1130
• /
• 2000

Based on the value of the Lagrange multiplier and the degree of constraint activeness, a new update rule is proposed for penalty parameters of the ALM method. The theoretical exposition of this suggested update rule is presented by using the algorithmic interpretation and the geometric interpretation of the augmented Lagrangian. This interpretation shows that the penalty parameters can effect the performance of the ALM method. Also, it offers a lower limit on the penalty parameters that makes the augmented Lagrangian to be bounded. This lower limit forms the backbone of the proposed update rule. To investigate the numerical performance of the update rule, it is embedded in our ALM based dynamic response optimizer, and the optimizer is applied to solve six typical dynamic response optimization problems. Our optimization results are compared with those obtained by employing three conventional update rules used in the literature, which shows that the suggested update rule is more efficient and more stable than the conventional ones.

• Journal of Korea Multimedia Society
• /
• 제9권11호
• /
• pp.1410-1420
• /
• 2006

In this paper, a replica update propagation method for cost optimization of request forwarding in the Grid database is proposed,. In the Grid database, the data is replicated for performance and availability. In the case of data update, update information is forwarded to the neighbor nodes to synchronize with the others replicated data. There are two kinds of update propagation method that are the query based scheme and the log based scheme. And, only one of them is commonly used. But, because of dynamically changing environment through property of update query and processing condition, strategies that using one propagation method increases transmission cost in dynamic environment. In the proposed method, the three classes are defined from two cost models of query and log based scheme. And, cost functions and update propagation method is designed to select optimized update propagation scheme from these three classes. This paper shows a proposed method has an optimized performance through minimum transmission cost in dynamic processing environment.

• Journal of Korea Multimedia Society
• /
• 제9권11호
• /
• pp.1395-1409
• /
• 2006

A spatial data warehouse has spatial data cube composed of multi-dimensional data for efficient OLAP(On-Line Analytical Processing) operations. A spatial data cube supporting concept hierarchies holds huge amount of data so that many researches have studied a incremental update method for minimum modification of a spatial data cube. The Cube, however, compressed by eliminating prefix and suffix redundancy has coalescing paths that cause update inconsistencies for some updates can affect the aggregate value of coalesced cell that has no relationship with the update. In this paper, we propose incremental batch update method of a spatial data cube. The proposed method uses duplicated nodes and extended node structure to avoid update inconsistencies. If any collision is detected during update procedure, the shared node is duplicated and the duplicate is updated. As a result, compressed spatial data cube that includes concept hierarchies can be updated incrementally with no inconsistency. In performance evaluation, we show the proposed method is more efficient than other naive update methods.

• Journal of KIISE:Databases
• /
• 제31권1호
• /
• pp.39-47
• /
• 2004

Spatio-temporal databases have been mostly studied in the area of access methods. However, without considering an extraordinary update maintenance overhead after building up a spatio-temporal index, most indexing techniques have focused on fast query processing only. In this paper, we propose an efficient update management method that reduces the number of disk accesses required in order to apply the updates of moving objects to a spatio-temporal index. We consider realistic update patterns that can represent the movements of objects properly. We present a memory based structure that can efficiently maintain a small number of very frequently updating objects. For an experimental environment with realistic update patterns, the number of disk accesses of our method is about 40% lower than that of a general update method of existing spatio-temporal indexes.

• Smart Structures and Systems
• /
• 제31권1호
• /
• pp.29-43
• /
• 2023

This study investigates the possibility of damage detection of a real bridge by means of a modal parameter-based finite element (FE) model update. Field moving vehicle experiments were conducted on an actual steel plate girder bridge. In the damage experiment, cracks were applied to the bridge to simulate damage states. A fast Bayesian FFT method was employed to identify and quantify uncertainties of the modal parameters then these modal parameters were used in the Bayesian model update. Material properties and boundary conditions are taken as uncertainties and updated in the model update process. Observations showed that although some differences existed in the results obtained from different model classes, the discrepancy between modal parameters of the FE model and those experimentally obtained was reduced after the model update process, and the updated parameters in the numerical model were indeed affected by the damage. The importance of boundary conditions in the model updating process is also observed. The capability of the MCMC model update method for application to the actual bridge structure is assessed, and the limitation of FE model update in damage detection of bridges using only modal parameters is observed.

• Journal of the military operations research society of Korea
• /
• 제29권1호
• /
• pp.28-42
• /
• 2003

The simplex method requires basis update in each iteration, which is the most time consuming process. Several methods have been developed for the update of basis which is represented in LU factorized form, such as Bartels-Golub's method, Forrest-Tomlin's method, Reid's method, Saunders's method, etc. In this research, we compare between the updating methods in terms of sparsity, data structure and computing time issues. The analysis is mainly based on the computational experience.

• International Journal of Contents
• /
• 제10권1호
• /
• pp.62-67
• /
• 2014

Usually, cloud storage systems are developed based on DFS (Distributed File System) for scalability and reliability reasons. DFSs are designed to improve throughput than IO response time, and therefore, they are appropriate for batch processing jobs. Recently, cloud storage systems have been used for update intensive applications such as OLTP and so on. However, in DFSs, in-place update operations are not carefully considered. Therefore, when updates are frequent, I/O performance of DFSs are degraded significantly. DFSs with RAID techniques have been proposed to improve their performance and reliability. Their performance degradation caused by frequent update operations can be more significant. In this paper, we propose an in-place update method for DFS RAID exploiting a differential logging technique. The proposed method reduces the I/O costs, network traffic and XOR operation costs for RAID. We demonstrate the efficiency of our proposed in-place update method through various experiments.

• Journal of the Korea Institute of Military Science and Technology
• /
• 제15권1호
• /
• pp.46-56
• /
• 2012

Traitor Tracing schemes are broadcast encryption systems where at least one of the traitors who were implicated in the construction of a pirate decoder can be traced. This traceability is required in various contents delivery system like satellite broadcast, DMB, pay-TV, DVD and so on. In this paper, we propose a public key traitor tracing scheme with key-update method. If the system manager can update a secret key which is stored in an authorized decode, it makes a pirate decoder useless by updating a secret key A pirate decoder which cannot update a secret key does not decrypt contents in next session or during tracing a traitor, this scheme has merits which will make a pirate decoder useless, therefore this scheme raises the security to a higher level.

• Journal of Industrial Technology
• /
• 제21권B호
• /
• pp.85-89
• /
• 2001

In this paper, we analyze a time-based update method in location management and calculate the optimal time-interval. The probability that an MT is j rings away from the center cell is obtained by computer programming. And using these values, an exact analysis is made for the time-based location management cost. From the result, when the time-based method is applied to location update, we can get the optimal time-interval which minimizes the location management cost.