• Journal of KIISE:Databases
• /
• v.29 no.6
• /
• pp.477-491
• /
• 2002

The broadcast environment has asymmetric communication aspect that is typically much greater communication bandwidth available from server to clients than in the opposite direction. In addition, mobile computing systems generate mostly read-only transactions from mobile clients for retrieving different types of information such as stock data, traffic information and news updates. Since previous concurrency control protocols, however, do not consider such a particular characteristics, the performance degradation occurs when previous schemes are applied to the broadcast environment. In this paper, we propose optimistic concurrency control based on timestamp interval for broadcast environment. The following requirements are satisfied by adapting weak consistency that is the appropriate correctness criterion of read-only transactions: (1) the mutual consistency of data maintained by the server and read by clients (2) the currency of data read by clients. We also adopt the timestamp Interval protocol to check the weak consistency efficiently. As a result, we improved a performance by reducing unnecessary aborts and restarts of read-only transactions caused when global serializability was adopted.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.10C
• /
• pp.956-963
• /
• 2006

This research studies multi participant consistency and dynamic data shared through 3D scenes in virtual network environments. In a distributed virtual environment of client-server structure, consistency is maintained by the static information exchange; as jerks occur by packet delay when updating messages of dynamic data exchanges are broadcasted frequence, the network bottleneck is reduced by predicting the movement path by using the Dead-reckoning algorithm. In Dynamic data path prediction, the tests the location prediction error between Dead-reckoning convergence interval and error of prediction and actual condition one time above threshold it interpolates a previously location. The shared dynamic data of the 3D virtual environment is implementation using the VRML EAI.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.2
• /
• pp.668-685
• /
• 2019

Provision of higher throughput without sacrificing consistency guarantees in replication systems is a critical problem. In this paper, we propose a novel approach called Bidirectional Chain Replication (BCR) to improve throughput in traditional Chain Replication (CR) through better utilization of computing and communication resources of the chain. Unlike CR where the whole replicated data store is treated as a single unit, in BCR the replicated shared data at each server in the chain is split into two disjoint Logical Partitions ($LP_1$, $LP_2$). This forms two chains running concurrently on the same hardware in two opposite directions; the first chain ($CR_1$) exclusively manipulates data objects in $LP_1$, while the second chain ($CR_2$) exclusively manipulates data objects in $LP_2$, therefore, conflict is avoided and concurrency is guaranteed. The simultaneous employment of these two chains results in better utilization of hardware in the sense that the two chains can evenly share the workload, hence, throughput can be improved without sacrificing consistency. Experimental results showed an improvement of approximately 85% in throughput of BCR over CR.

• Journal of the Korean Data and Information Science Society
• /
• v.3 no.1
• /
• pp.25-31
• /
• 1992

Some results relating to $C_{0}(R)\;and\;L^{1}(R)$ spaces with application to kernel density estimators will be introduced. First, random elements in $C_{0}(R)\;and\;L^{1}(R)$ are discussed. Then, complete convergence limit theorems are given to show that these results can be used in establishing uniformly consistency and $L^{1}$ consistency.

• Journal of KIISE:Databases
• /
• v.34 no.3
• /
• pp.217-231
• /
• 2007

Frequent disconnection is connected directly to client's cache consistency problem in Mobile Computing environment. For solving cache consistency problem, research about Invalidation Report is studied. But, existent invalidation report structure comes with increase of size of invalidation report structure and decline of cache efficiency if quantity of data become much, or quantity of updated data increases. Also, while existent method confirms whole cache, invalidation report doesn't support selective listening. This paper proposes TTCI(Timestamp Tree-based Cache Invalidation scheme) as invalidation report structure that solve problem of these existing schemes and improve efficiency. We can make TTCI using timestamp of updated data, composing timestamp tree and list ID of data in updated order. If we utilize this, each client can confirm correct information in point that become own disconnecting and increase cache utilization ratio. Also, we can pare down client's resources consumption by selective listening using tree structure. We experimented in comparison with DRCI(Dual-Report Cache Invalidation) that is existent techniques to verify such efficiency of TTCI scheme.

• The Korean Journal of Applied Statistics
• /
• v.18 no.1
• /
• pp.129-135
• /
• 2005

Representative observations are useful to express explicitly the distributional variation of the data by a few selected observations corresponding to the quantiles in the univariate situation. Jones and Rice(1992) extended it to the multidimensional case by the principal component based method. This study introduces a modified version of Jones and Rice exploiting the self-consistency of principal components in expressing the chosen observation vectors. Compared to that of Jones and Rice, the suggested method tends to provide with less susceptible representative observations to the sampling variation of the data and the resulted vectors benefits from the self-consistency.

• Smart Structures and Systems
• /
• v.16 no.2
• /
• pp.347-366
• /
• 2015

GPS and strong-motion sensors are broadly used for the monitoring of structural health and Earth surface motions, focusing on response of structures, earthquake characterization and rupture modeling. Several studies have shown the consistency of the two data sets within at certain frequency (e.g., 0.03

• Atmosphere
• /
• v.22 no.3
• /
• pp.299-307
• /
• 2012

This study is aimed to validate errors for detected suspicious temperature data using various quality control procedures for 61 weather stations in the Republic of Korea. The quality control algorithms for temperature data consist of four main procedures (high-low extreme check, internal consistency check, temporal outlier check, and spatial outlier check). Errors of detected suspicious temperature data are judged by examining temperature data of nearby stations, surface weather charts, hourly temperature data, daily precipitation, and daily maximum wind direction. The number of detected errors in internal consistency check and spatial outlier check showed 4 days (3 stations) and 7 days (5 stations), respectively. Effective and objective methods for validation errors through this study will help to reduce manpower and time for conduct of quality management for temperature data.

• Journal of Information Technology Applications and Management
• /
• v.11 no.1
• /
• pp.53-67
• /
• 2004

We propose an advanced transaction scheduling protocol to improve the concurrency and to guarantee the mobility for the mobile database management systems. Mobility, portability, and wireless link In mobile computing environment can cause certain drawbacks, and thus it is more difficult to solve the concurrency control problems. However, a locking scheme should be used to guarantee the data consistency and to prevent the data conflicts. It is well known that data consistency is guaranteed by standard transaction scheduling schemes like two-phase locking (2PL). It has two of operation, lock and unlock. But 2PL does not give solution for mobile system. Altruistic Locking (AL) and classifying transactions, we adapt, can give solution for the previous problems. AL, as an advanced protocol, has attempted to reduce delay effects associated with lock release moment by the use of donation. In this paper, we extend those approaches and classify the transactions to reduce delay effects of short-lived transaction caused by long-lived transaction. In addition, we show efficient solution for the case of disconnection occurrence. Our protocol, namely, Mobile Altruistic Locking (MAL) is shown to be efficiently used in order to reduce delay effects and to guarantee database consistency in a state of the slippery connection in mobile database systems.

• Journal of Climate Change Research
• /
• v.7 no.4
• /
• pp.485-492
• /
• 2016

For reporting national greenhouse gas inventory in forest sector, the forest growing stock from the National Forest Inventory (NFI) system has used as activity data sources. The National Forest Inventory system was changed from rotation system by province to annual system by 5 years across the country. The forest growing stocks based on the new inventory system produced a different trend compared to the previous estimations. This study was implemented to recalculate previous forest growing stocks for time series consistency at a national level. The recalculation of forest growing stock was conducted in an overlap approach by the IPCC guideline. In order to support the more consistency data, we used calibration factors between applied stand volumes in 1985 and 2012, respectively. As a result, the time series of recalculated forest growing stock was to be consistency using the overlap approach and the calibration factor with the lower middle/middle site index. According to the applied overlap period, however, we will recalculate activity data using more complete data from national forest inventory system.