• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2003.04a
• /
• pp.443-450
• /
• 2003

Our country is constructed the digital map in the first NGIS plan. Through digital map construction, it was had the potentiality that can more easily activate GIS. But these data included numerous problems from user's view. In the second NGIS plan, our government try to construct the framework data for the maximization of GIS utilization. This paper is showed a step of update that considered relationship between the national framework data themes, suggested the structure of maintenance activity for national framework data.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.2 no.3
• /
• pp.145-154
• /
• 2007

Dynamic update of kernel can change kernel functionality and fix bugs in runtime. Dynamic update is important because it leverages availability, reliability and flexibility of kernel. An instruction-granularity update technique has been used for dynamic update. However, it is difficult to apply update technique for a commodity operating system kernel because development and maintenance of update code must be performed with assembly language. To overcome this difficulty, we design the function-granularity dynamic update system which uses high-level language such as C language. The proposed update system makes the development and execution of update convenient by providing the development environment for update code which is same for kernel development. We implement this system for Linux and demonstrate an example of update for do_coredump() function which is reported it has a vulnerable point for security. The update was successfully executed.

• Journal of Korea Multimedia Society
• /
• v.17 no.11
• /
• pp.1307-1312
• /
• 2014

Online games are virtual space where it connects individual users through network connection to offer enjoyment of play games and game developer who service online games have to develop new contents and provide them to users to extend life of their service. Typically, in order to update new contents, all service companies have maintenance schedule to stop the game service for a while to update both server and client applications. Usually this process takes quite amount of time and users do not have any other choice but disconnected from server and wait until it is over. The purpose of this thesis is to describe the advantages of new design system which will allows users to continue to play the game even during the update. The main focus of this design is to make users feel more convenience in online gaming experience by move client from previous server to new server while users are still playing. If they can to connect current client with new server without any certificate validation process while users information from the client can automatically pass through to the new server, users may not need to experience maintenance for new contents update.

• Asia pacific journal of information systems
• /
• v.13 no.4
• /
• pp.191-206
• /
• 2003

More views in data warehouse, can respond to the users more rapidly because the user's requests might be processed by accessing only the materialized views with higher probabilities rather than accessing base relations. But, the update duration for maintaining materialized views limits the number of materialized views in data warehouse. In this paper, we propose the algorithm for reducing update duration of materialized views, of which aggregation functions are maintained by self-maintenance. We also implement the proposed algorithm and evaluate the performance of the algorithm.

• Journal of Aerospace System Engineering
• /
• v.10 no.1
• /
• pp.15-20
• /
• 2016

The optimal estimation of a general continuous-discrete system can be achieved through the solution of the Fokker-Planck equation and the Bayesian update. Due the high nonlinearity of the equation of motion of the system and the measurement model, it is necessary to linearize the both equation. To avoid linearization, the filter based on Fokker-Planck equation is designed. with the unscented transformation update mechanism, in which the associated Fokker-Planck equation was solved efficiently and accurately via discrete quadrature and the measurement update was done through the unscented transformation update mechanism. This filter based on the Direct Quadrature Moment of Method(DQMOM) and the unscented transformation update is applied to the bearing only target tracking problem. The proposed filter can still provide more accurate estimation of the state than those of the extended Kalman filter especially when measurements are sparse. Simulation results indicate that the advantages of the proposed filter based on the DQMOM and the unscented transformation update make it a promising alternative to the extended Kalman filter.

• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.5
• /
• pp.223-230
• /
• 2008

Dynamic update of kernel can change kernel functionality and fix bugs in runtime. Dynamic update is important because it leverages availability, reliability and flexibility of kernel. An instruction-granularity update technique has been used for dynamic update. However, it is difficult to apply update technique for a commodity operating system kernel because development and maintenance of update code must be performed with assembly language. To overcome this difficulty, we design the function-granularity dynamic update system which uses high-level language such as C language. The proposed update system makes the development and execution of update convenient by providing the development environment for update code which is same for kernel development. We implement this system for Linux and demonstrate an example of update for EXT3 file system. The update was successfully executed.

• Journal of Institute of Control, Robotics and Systems
• /
• v.15 no.8
• /
• pp.867-875
• /
• 2009

A wireless sensor network inherently comprises a plurality of sensor nodes widely deployed for sensing environmental information. To add new functions or to correct some faulty functions of an existing wireless sensor network, the firmware for each sensor node needs to be updated. Firmware update would be quite troublesome if it requires the gathering, reprogramming, and redeploy of all of already deployed sensor nodes. Over-the-air programming (OTA) facilitates the firmware update process, thereby allowing convenient maintenance of an already-deployed sensor network. This paper proposes and implements a remote firmware update mechanism for a TDMA-based wireless sensor network, in which the firmware for sensor nodes constituting the TDMA-based sensor network can be easily updated and the update process can be conveniently monitored from a remote site. We verify the validity of the proposed firmware update method via experiments and introduce three wireless sensor networks installed in outdoor sites in which the proposed firmware update mechanism has been exploited.

• The KIPS Transactions:PartD
• /
• v.9D no.4
• /
• pp.561-570
• /
• 2002

In order to evaluate the performance of incremental update algorithms, we perform experimental tests on the time of updating view objects. In this paper, the incremental update algorithms are evaluated on two kinds of materialized methods : materialization by value-copy and materialization by preserving object identifiers (OIDs). The result of performance evaluation shows that there is little difference in the updating time of view objects between two materialization methods. The evaluation of query processing on spatial views shows that materialization by value-copy is much better than materialization by preserving OIDs. As the results of overall performance evaluation, it is more desirable to use the incremental update method based on materialization by value-copy than the incremental update method based on materialization by preserving OIDs.

• Tuberculosis and Respiratory Diseases
• /
• v.76 no.1
• /
• pp.1-7
• /
• 2014

Maintenance therapy has emerged as a novel therapeutic paradigm for advanced non-small-cell lung cancer (NSCLC). Maintenance therapy that aims to sustain a clinically favorable state after first-line chemotherapy has two strategies. Switch maintenance therapy entails switching to a new and non-cross-resistant agent in an alternating or sequential manner, on completion of first-line chemotherapy. Continuous maintenance therapy keeps ongoing administration of a component of the current regimen after four to six cycles of chemotherapy, if there is a stable disease, or better response. Both maintenance therapies can be continued, until disease progression. The potential evidence regarding maintenance therapy includes providing the opportunity to receive additional treatment, through sustaining tumor shrinkage, and delayed emergence of tumor-related symptom. Thus far, debates over the parameters used to predict the effectiveness of maintenance therapy, financial burden, and uncertainty of improving the quality of life exist. Despite many debates, maintenance therapy, which is currently recommended, has been disclosed to be beneficial.

• Journal of KIISE:Databases
• /
• v.31 no.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.