• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.5
• /
• pp.282-296
• /
• 2006

In a wireless client server environment, data broadcasting is an efficient data dissemination method; a server broadcasts data, and some of broadcasted data are cached in a mobile client's cache to save the narrow communication bandwidth, limited resources, and data access time. A server also broadcasts invalidation reports to maintain the consistency between server data and a client's cached data. Most of existing works on the cache consistency problems simply purge the entire cache when the disconnection time is long enough to miss the certain amount(window size) of IRs. This paper presents a cache invalidation method to increase mobile clients' cache reusability in case of a long disconnection. Instead of simply dropping the entire cache regardless of its consistency, a client estimates the cost of purging all the data with the cost of selective purge. If the cost of dropping entire cache is higher, a client maintains the cache and selectively purge inconsistent data using uplink bandwidth for validation request. The simulation results show that this scheme increases the cache reusability since it effectively considers the update rates and the broadcast frequencies of cached data in estimating the cost of cache maintenance.

• The KIPS Transactions:PartD
• /
• v.12D no.1 s.97
• /
• pp.21-30
• /
• 2005

In mobile computing environments, a mobile host caches the data to use the narrow bandwidth efficiently and improve the response time. A server periodically broadcasts the update data for maintaining the cache consistency of a mobile host. However, a method for maintaining cache consistency using periodic invalidation report has a problem that defers the commit decision of a mobile transaction to guarantee its serializable execution. In this paper, we propose CCM-AD method that guarantees the serializable execution of a mobile transaction even in the case that it is executed using cached data. As CCM-AD method guarantees the serializable execution of mobile transactions by using the intersection between the data broadcast to mobile host and the data updated at server. Then the CCM-AD method can reduce the delay of commitment decision of a mobile transaction. Also our method can reduce the size of invalidation report.

• Journal of the Korean Society of Clothing and Textiles
• /
• v.21 no.6
• /
• pp.959-969
• /
• 1997

This research is intended to help the development of new products and marketing strategies studying consumers' knowledge level and attitude towards original brand and the extension attitude related to the brand image. The detailed purposes of this study are as follow: First, it is to measure consumers' knowledge and attitude towards original brand. Second, it is to clarify the dimensions of the image about the original brand and extended brand product which is perceived by the consumer. Third, it is to meassure image consistency and product similarity between the original brand and extended product. The sample group consisted of female college students 393 in Seoul. Stratified sampling, based on major and grade of sturients and the structure of the college they were attending was used as sampling method. Questionnaires, which were selected from literature and proceeding researches published in Korea and abroad, were modified for this study, SAS Package was used for data analysis. The results observed in this study were as follow: 1. Consumers' knowledge level about original brand showed high among students majoring in clothing-related subjects and their general attitude proved to be positive. 2. Image factors of original brand were classified to dignity factor, personality/modernity factor, femininity factor, and ornamentation factor. Lipstick is considered to have high image consistency and product similarity. 3. Comparing the attitude before and after extension, extension to lipstick which showed high image consistency and product similarity received more positive reactions than one to bed cover sheet. 4. It was founded that although knowledge and attitude towards original brand with image consistency had no influence on the extension attitude, knowledge and attitude without image consistency influence the extension attitude.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.7
• /
• pp.1694-1705
• /
• 1997

In the future mobile computing environment, it will be generalized that a mobile host with portable Laptop of Palmtop accesses to database through wireless communication channel. For solving the problems which are caused from low bandwidth of wireless communication, mobile hosts cache the datum used frequently on them. Thus the mobile hosts must always retain the cache consistency for the correctness of the cached datum. the cache consistency is mainly affected from the unrestricted host mobility and the disconnection of the communication between mobile hosts and mobile support station. In this situation, the strategy to retain efficiently cache consistency is required. In this paper, we propose a strategy using updatable message for retaining the cache consistency, in the mobile computing environment, with replicated database supporting 2 phase commit protocol. This strategy makes use of a updatable message to resolve the cache consistency problem, since mobile host crosses the boundary of cell. In using of this updatable, it find out and cache only the update data of missing invalidation message. As a result, the proposed strategy utilizes network bandwidth efficiently because it is not need to delete all the cached datum with any datum change.

• Communications for Statistical Applications and Methods
• /
• v.9 no.3
• /
• pp.825-834
• /
• 2002

Poisson processes are widely used in reliability and survival analysis. In particular, multiple event time data in survival analysis are routinely analyzed by use of Poisson processes. In this paper, we consider large sample properties of nonparametric Bayesian models for Poisson processes. We prove that the posterior distribution of the cumulative intensity function of Poisson processes is consistent under regularity conditions on priors which are Levy processes.

• Journal of Internet Computing and Services
• /
• v.17 no.4
• /
• pp.1-9
• /
• 2016

Algorithms implementing distributed shared memory (DSM) were developed for ensuring consistency. The performance of DSM algorithms is dependent on system and usage parameters. However, ensuring these algorithms to tolerate faults is a problem that needs to be researched. In this study, we proposed fault-tolerant scheme for DSM system and analyzed reliability and fault-tolerant overhead. Using our analysis, we can choose a proper algorithm for DSM on error prone environment.

• Journal of Communications and Networks
• /
• v.18 no.3
• /
• pp.493-501
• /
• 2016

In-network storage is an effective technique for avoiding network congestion and reducing power consumption in continuous data collection in wireless sensor networks. In recent years, network coding based storage design has been proposed as a means to achieving ubiquitous access that permits any query to be satisfied by a few random (nearby) storage nodes. To maintain data consistency in continuous data collection applications, the readings of a sensor over time must be sent to the same set of storage nodes. In this paper, we present an efficient approach to updating data at storage nodes to maintain data consistency at the storage nodes without decoding out the old data and re-encoding with new data. We studied a transmission strategy that identifies a set of storage nodes for each source sensor that minimizes the transmission cost and achieves ubiquitous access by transmitting sparsely using the sparse matrix theory. We demonstrate that the problem of minimizing the cost of transmission with coding is NP-hard. We present an approximation algorithm based on regarding every storage node with memory size B as B tiny nodes that can store only one packet. We analyzed the approximation ratio of the proposed approximation solution, and compared the performance of the proposed coding approach with other coding schemes presented in the literature. The simulation results confirm that significant performance improvement can be achieved with the proposed transmission strategy.

• Communications for Statistical Applications and Methods
• /
• v.12 no.3
• /
• pp.783-795
• /
• 2005

We consider to obtain an estimate of bivariate survival function for the right censored data with the assumption that the two components of censoring vector are independent. The estimate is derived from an ad hoc approach based on the representation of survival function. Then the resulting estimate can be considered as an extension of the Susarla- Van Ryzin estimate to the bivariate data. Also we show the consistency and weak convergence for the proposed estimate. Finally we compare our estimate with Dabrowska's estimate with an example and discuss some properties of our estimate with brief comment on the extension to the multivariate case.

• Proceedings of the KSRS Conference
• /
• 2005.10a
• /
• pp.770-773
• /
• 2005

In most biological laboratory, sequences from sequence machine are stored into file disks as simple files. It will be hard work to store and manage the sequence data with consistency and integrity such as storing redundant files. It is required needed to develop a system which integrated and managed genome data with consistency and integrity for accurate sequence analysis. There fore, in this paper, we not only store gene and protein sequence data through sequencing but also manage them. We also make a integrate schema for transforming the file formats and design database system using it. As integrated schema is designed as a BSML, it is possible to apply a style language of XSL. From this, we can transfer among heterogeneous sequence formats.

• Journal of Advanced Navigation Technology
• /
• v.10 no.2
• /
• pp.120-127
• /
• 2006

Data-caching of a client is an important technology for interaction with a server where data are cached and operated at the client node. Caching reduces network latency and increases resource utilization at the client. In a Client-server environment, the absence of cache consistency algorithm, we cannot guarantee the correctness of client applications. In this paper, we propose a new asynchronous avoidance-based cache consistency algorithm. We remove the additional callback due to the lock escalation in AACC. With a comprehensive performance analysis, we show that the proposed algorithm has less message exchange than the AACC. One-copy serializability is used for proving correctness of the proposed algorithm.