• Title/Summary/Keyword: Data Update

Search Result 1,133, Processing Time 0.026 seconds

Simulation Analysis of Version Up Strategy for Holding Online Game Customers through Update and CRM (MMORPG의 버전업 전략을 통한 이용자 유지: 시뮬레이션 기법을 활용한 업데이트와 CRM전략 분석)

  • Roh, Tae-Woo;Park, Su-Jung;Lee, Sang-Gun
    • The Journal of Information Systems
    • /
    • v.17 no.4
    • /
    • pp.281-299
    • /
    • 2008
  • An online game is popular topic due to the increased total online game market volume nowadays. Even though many studies on an online game are released, most studies have used survey method that reveal only section of the situation like a snapshot. For this reason, previous studies have a little limitation that does not show dynamically changing issues like a product life cycle and change in customer's satisfaction. Because of this, we researched on an online game with the system dynamic model which can show dynamic simulation to analysis time series data. We chose MMORPG (Massively Multi-play Online Role Playing Game) in sort of an online game because it has many absorbing factors and enthusiastic users. We assumed that the game developer is ready for updated version game and release that periodically and focused on dormant users who used to be enthusiastic about MMORPG and designed simulation model which analyze how to influence of update and CRM strategy on users. The simulation results showed that the update has positive influences to gather new users and hold established users and CRM strategies help to prevent dormant users from transferring to rivals to offer them re-absorbing factors. Through this study, we confirmed importance of update on a online game and suggested the necessity to introduce CRM strategy in an online game market.

Performance Analysis of a Gravity Gradient Referenced Navigation System

  • Lee, Jisun;Kwon, Jay Hyoun
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.32 no.3
    • /
    • pp.271-279
    • /
    • 2014
  • As an alternative way to overcome the weakness of the global navigation satellite system (GNSS) in hostile situation, a gravity gradient referenced navigation (GGRN) has been developed. This paper analyzed the performance of GGRN with respect to the initial errors, DB resolution as well as update rates. On the basis of simulations, it was found that the performance of GGRN is getting worse when initial errors exist but the navigation results are rapidly converged. Also, GGRN generates better results when DB resolution is higher and update rates are shorter than 20 seconds. However, it is difficult to deduce the optimal parameters for the navigation because some trajectories show better performance in case low-resolution DB is applied or long update rate is supposed. Therefore, further analysis to derive specific update conditions to improve the performance has been performed. Those update conditions would not be generalized for all cases although maximum improvement rate is over 200% in certain case. In the future, some more developments and tests on the combination of various geophysical data and/or algorithms are necessary to construct more stable and reliable navigation system.

Update Protocol for Distributed Spatial Objects with Spatial Relationships based on OGIS OLE DB (OGIS OLE DB 기반의 공간관련성을 가진 분산 공간객체의 변경 프로토콜)

  • Kim, Dong-Hyun;Moon, Sang-Ho;Hong, Bong-Hee
    • The KIPS Transactions:PartD
    • /
    • v.11D no.2
    • /
    • pp.259-268
    • /
    • 2004
  • For supporting Interoperability among heterogeneous data sources in different geographic information systems, it is required to use open API like OGIS OLE DB Proposed in OGC. The OLE/COM Implementation Specification of OGIS only provides interfaces to discover and access spatial data, but does not support interfaces for updating distributed spatial data. To solve this problem, we propose and add interfaces for updating spatial objects distributed over heterogeneous data sources and examining the consistency of spatial relationships between updated objects. We also devise a 2-phase commit protocol based on spatial relationships in order to guarantee the consistency of updated objects. To justify the update scheme using the proposed Interfaces and 2-phase commit prototype we design and implement a prototype system for updating distributed spatial objects.

A Group Update Technique based on a Buffer Node to Store a Vehicle Location Information (차량 위치 정보 저장을 위한 버퍼 노드 기반 그룹 갱신 기법)

  • Jung, Young-Jin;Ryu, Keun-Ho
    • Journal of KIISE:Databases
    • /
    • v.33 no.1
    • /
    • pp.1-11
    • /
    • 2006
  • It is possible to track the moving vehicle as well as to develop the location based services actively according to the progress of wireless telecommunication and GPS, to the spread of network, and to the miniaturization of cellular phone. To provide these location based services, it is necessary for an index technique to store and search too much moving object data rapidly. However the existing indices require a lot of costs to insert the data because they store every position data into the index directly. To solve this problem in this paper, we propose a buffer node operation and design a GU-tree(Group Update tree). The proposed buffer node method reduces the input cost effectively since the operation stores the moving object location data in a group, the buffer node as the unit of a non-leaf node. hnd then we confirm the effect of the buffer node operation which reduces the insert cost and increase the search performance in a time slice query from the experiment to compare the operation with some existing indices. The proposed tufter node operation would be useful in the environment to update locations frequently such as a transportation vehicle management and a tour-guide system.

Data anomaly detection and Data fusion based on Incremental Principal Component Analysis in Fog Computing

  • Yu, Xue-Yong;Guo, Xin-Hui
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.10
    • /
    • pp.3989-4006
    • /
    • 2020
  • The intelligent agriculture monitoring is based on the perception and analysis of environmental data, which enables the monitoring of the production environment and the control of environmental regulation equipment. As the scale of the application continues to expand, a large amount of data will be generated from the perception layer and uploaded to the cloud service, which will bring challenges of insufficient bandwidth and processing capacity. A fog-based offline and real-time hybrid data analysis architecture was proposed in this paper, which combines offline and real-time analysis to enable real-time data processing on resource-constrained IoT devices. Furthermore, we propose a data process-ing algorithm based on the incremental principal component analysis, which can achieve data dimensionality reduction and update of principal components. We also introduce the concept of Squared Prediction Error (SPE) value and realize the abnormal detection of data through the combination of SPE value and data fusion algorithm. To ensure the accuracy and effectiveness of the algorithm, we design a regular-SPE hybrid model update strategy, which enables the principal component to be updated on demand when data anomalies are found. In addition, this strategy can significantly reduce resource consumption growth due to the data analysis architectures. Practical datasets-based simulations have confirmed that the proposed algorithm can perform data fusion and exception processing in real-time on resource-constrained devices; Our model update strategy can reduce the overall system resource consumption while ensuring the accuracy of the algorithm.

Enabling Efficient Verification of Dynamic Data Possession and Batch Updating in Cloud Storage

  • Qi, Yining;Tang, Xin;Huang, Yongfeng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.6
    • /
    • pp.2429-2449
    • /
    • 2018
  • Dynamic data possession verification is a common requirement in cloud storage systems. After the client outsources its data to the cloud, it needs to not only check the integrity of its data but also verify whether the update is executed correctly. Previous researches have proposed various schemes based on Merkle Hash Tree (MHT) and implemented some initial improvements to prevent the tree imbalance. This paper tries to take one step further: Is there still any problems remained for optimization? In this paper, we study how to raise the efficiency of data dynamics by improving the parts of query and rebalancing, using a new data structure called Rank-Based Merkle AVL Tree (RB-MAT). Furthermore, we fill the gap of verifying multiple update operations at the same time, which is the novel batch updating scheme. The experimental results show that our efficient scheme has better efficiency than those of existing methods.

An Analysis of Location Management Cost by Predictive Location Update Policy in Mobile Cellular Networks (이동통신망에서 예측 위치 등록 정책을 통한 위치관리 비용 감소 효과 분석)

  • Go, Han-Seong;Jang, In-Gap;Hong, Jeong-Sik;Lee, Chang-Hun
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2007.11a
    • /
    • pp.388-394
    • /
    • 2007
  • In wireless network, we propose a predictive location update scheme which considers mobile user's(MU's) mobility patterns. MU's mobility patterns can be found from a movement history data. The prediction accuracy and model complexity depend on the degree of application of history data. The more data we use, the more accurate the prediction is. As a result, the location management cost is reduced, but complexity of the model increases. In this paper, we classify MU's mobility patterns into four types. For each type, we find the respective optimal number of application of history data, and predictive location area by using the simulation. The optimal numbers of four types are shown to be different. When we use more than three application of history data, the simulation time and data storage are shown to increase very steeply.

  • PDF

Probability-Based Context-Generation Model with Situation Propagation Network (상황 전파 네트워크를 이용한 확률기반 상황생성 모델)

  • Cheon, Seong-Pyo;Kim, Sung-Shin
    • The Journal of Korea Robotics Society
    • /
    • v.4 no.1
    • /
    • pp.56-61
    • /
    • 2009
  • A probability-based data generation is a typical context-generation method that is a not only simple and strong data generation method but also easy to update generation conditions. However, the probability-based context-generation method has been found its natural-born ambiguousness and confliction problems in generated context data. In order to compensate for the disadvantages of the probabilistic random data generation method, a situation propagation network is proposed in this paper. The situation propagating network is designed to update parameters of probability functions are included in probability-based data generation model. The proposed probability-based context-generation model generates two kinds of contexts: one is related to independent contexts, and the other is related to conditional contexts. The results of the proposed model are compared with the results of the probabilitybased model with respect to performance, reduction of ambiguity, and confliction.

  • PDF

A Software Update Technique for Aircraft Missiles based on MIL-STD-1760 (MIL-STD-1760 기반 항공기용 유도탄 소프트웨어 업데이트 기법)

  • Lee, Seungyoun;Kim, Sungkwon;Lee, Hyunah;Cho, Dongsik
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.21 no.5
    • /
    • pp.649-657
    • /
    • 2018
  • It is essential that weapons which are mounted on aircraft need to prove its reliability and safety during its developments. A guided missile should have high reliability and safety throughout various tests which are including ground tests, captive flight tests, detailed technical tests and operational tests. In these various tests, it is vital that software of each component in the guided missile should be easily updated in order to correct algorithms or errors. In this paper, we propose a software update technique based on MDTP(mass data transfer protocol) which are defined in MIL-STD-1760. The proposed techniques have the following advantages: First, software of each unit in a weapon can be updated through a test equipment without disassemble a guided missile. Second, development periods for a software update can be reduced by reusing MDTP. Third, we can easily maintenance of the software because it is based on standard. We proved its efficiency and validity through experiments. Therefore, the proposed technique should be effectively utilized for software update of a weapon mounted on an aircraft during development processes.

An Efficient Validation Method for XML Data Updates (XML 데이타 갱신에 대한 효율적인 유효 검증 기법)

  • Lee, Ji-Hyun;Park, Myung-Jae;Chung, Chin-Wan
    • Journal of KIISE:Databases
    • /
    • v.34 no.2
    • /
    • pp.153-165
    • /
    • 2007
  • XML is widely used in various applications as the standard for representing and exchanging data on the Web. XML Schema is the standard schema for XML and an XML document generated based on the XML Schema is called 'Valid XML document'. The XML Schema validity should be guaranteed after the XML document is updated. In this paper, we design an efficient method that verifies XML Schema validity before update, and so eliminates unnecessary validations. Also, we propose validation algorithms for each update. In addition, we propose the mapping between XML data and XML Schema and a storage method for XML Schema in order to efficiently extract the schema information for the validation. Finally, we compare the performance of the validation according to the storage methods.