• Journal of the Korea Institute of Military Science and Technology
• /
• v.22 no.2
• /
• pp.266-277
• /
• 2019

In modern warfare, securing time for preemptive response is recognized as an important factor of victory. The naval combat system, the core of naval forces, also strives to increase the effectiveness of engagement by improving its real-time information processing capabilities. As part of that, it is considered to use the TPR-tree in the naval combat system's target indexing because spatio-temporal searches can be performed quickly even as the number of target information increases. However, because the TPR-tree is slow to process updates, there is a limitation to handling frequent updates. In this paper, we present a method for improving the update performance of TPR-tree by applying the bottom-up update scheme, previously proposed for R-tree, to the TPR-tree. In particular, we analyze the causes of overlaps occurring when applying the bottom-up updates and propose ways to limit the MBR expansion to solve it. Our experimental results show that the proposed technique improves the update performance of TPR-tree from 3.5 times to 12 times while maintaining search performance.

• The Transactions of the Korean Institute of Power Electronics
• /
• v.24 no.4
• /
• pp.286-293
• /
• 2019

This study compares and analyzes online update techniques, which estimate the parameters of battery equivalent circuit models in real time. Online update techniques, which are based on extended Kalman filter and recursive least square methods, are constructed by considering the dynamic characteristics of batteries. The performance of the online update techniques is verified by simulation and experiments. Each online update technique is compared and analyzed in terms of complexity and accuracy to propose a suitable guide for selecting algorithms on various types of battery applications.

• Journal of Life Science
• /
• v.18 no.3
• /
• pp.318-322
• /
• 2008

This paper deals with an efficient management and automatic update sub-system for WASPIFA (Web-based Assistant System for Protein-protein Interaction and Function Analysis) system that had been developed in the past and now provides the comprehensive information on protein-protein interaction and protein function. Protein interacting data has increased exponentially, so that it costs enormous time and effort. In other words, it is actually impossible to manually update and manage an analysis system based on protein interacting data. Even though there exists a good analysis system, it could be useless if it was able to be updated timely and managed properly. Unfortunately, in most cases, biologists without professional knowledge on their analysis systems have to cope with a great difficulty in running them. In this respect, the efficient management and automatic update subsystem of protein interacting and its related data has been developed to facilitate experimental biologists as well as bioinformaticians to update and manage the WASPIFA system.

• IE interfaces
• /
• v.19 no.2
• /
• pp.168-173
• /
• 2006

In the Reporting Cell Location Management (RCLM) system, a subset of cells in the network is designated as the reporting cells. Each mobile terminal performs location update only when it enters one of these reporting cells. When a call arrives, the paging is confined to the reporting cell the user last reported and the neighboring bounded non-reporting cells. Frequent location update may result in degradation of quality of service due to interference. Miss on the location of a mobile terminal will necessitate a search operation on the network when a call comes in. We must decide the number of reporting cells and which cell should be reporting cell to balance the registration (location update) and search (paging) operations to minimize the cost of RCLM system. This paper proposes a ranking ant colony system (RACS) for optimization of RCLM system.

• International Journal of Contents
• /
• v.1 no.1
• /
• pp.16-20
• /
• 2005

This paper proposes a frame work for embedded system management. The management system can automatically monitor and maintain the Internet connected embedded-systems such as sensor devices, set-top box, web-pad, information appliances, PDA, etc. Users can easily diagnose system state, resolve system problems, maintain and update applications, and back up user information using the management system. We implement prototype for the management system on embedded Linux system and High -available Linux system.

• Journal of Internet of Things and Convergence
• /
• v.8 no.5
• /
• pp.77-83
• /
• 2022

Nand flash memory requires an Erase-Before-Write operation structurally. In order to solve this problem, it can be solved by classifying a page (hot data page) where data update operation occurs frequently and storing it in a separate block. The MHF (Multi Hash Function Framework) technique records the frequency of data update requests in the system memory, and when the recorded value exceeds a certain standard, the data update request is judged as hot data. However, the method of simply counting only the frequency of the data update request has a limit in judging it as accurate hot data. In addition, in the case of a technique that determines the persistence of a data update request, the fact of the update request is recorded sequentially based on a time interval and then judged as hot data. In the case of such a persistence-based method, its implementation and operation are complicated, and there is a problem of inaccurate judgment if frequency is not considered in the update request. This paper proposes a lightweight hot data determination technique that considers both frequency and persistence in data update requests.

• Journal of Cadastre & Land InformatiX
• /
• v.44 no.1
• /
• pp.127-138
• /
• 2014

It can be effective to extract and apply the updated information from the newly updated map data for updating road data of topographic map. In this study, update target data and update reference data are overlaid and the update objects are explored using network matching technique. And the network objects are classified into five matching and update cases and the update processes for each case are applied to the test data. For this study, road centerline data of digital topographic map is used as an update target data and road data of Korean Address Information System is used as an update reference data. The buffer-based network matching method is applied to the two data and the matching and update cases are classified after calculating the overlaid ratio of length. The newly updated road centerline data of digital topographic map is generated from the application of update process for each case. As a result, the update information can be extracted from the different map dataset and applied to the road network data updating.

• Proceedings of the KIPE Conference
• /
• 2000.07a
• /
• pp.632-635
• /
• 2000

In this paper we propose a controllable interrupt timer for haptic control system. haptic control system whihc was divided ito two processes as virtual environment(VE) manager and haptic controller. The VE manager displays the 3D graphic scene at low update rates 25Hz and haptic controller controls the haptic display at high update rates 1000Hz. To archive the accurate update rate we have imple-mented a timer so called "AaccTimer" based on Windows multimedia functions, The proposed "Acc Timer" for haptic control system has been imple- mented in a personal computer with a 6-DOF haptic interface. Experimental results show that our system is robust with respect to tolerances in the control rates and also through the accurate control rate the operator can always feel a stable force.feel a stable force.

• Journal of Industrial Technology
• /
• v.28 no.B
• /
• pp.9-14
• /
• 2008

In the Reporting Cell Location Management (RCLM) system, a subset of cells in the network is designated as the reporting cells. Each mobile terminal performs location update only when it enters one of these reporting cells. When a call arrives, the paging is confined to the reporting cell the user last reported and the neighboring bounded non-reporting cells. Frequent location update may result in degradation of quality of service due to interference. Miss on the location of a mobile terminal will necessitate a search operation on the network when a call comes in. We must decide the number of reporting cells and which cell should be reporting cell to balance the registration (location update) and search (paging) operations to minimize the cost of RCLM system. This paper proposes a simulated annealing (SA) for optimization of RCLM system.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.8
• /
• pp.808-812
• /
• 2008

In recent years, the software vulnerability becomes an important problem to the safety in operating system kernel. Many organizations endeavor to publish patches soon after discovery of vulnerability. In spite of the effort, end-system administrators hesitate to apply the patches to their system. The reasons of hesitation are the reboot disruption and the distrust of patches. To solve this problem we propose a dynamic update system for non-updatable kernel, named DUNK. The DUNK provides: 1) a dynamic update mechanism at function-level granularity to overcome the reboot disruption and 2) a safety verification mechanism to overcome the distrust problem, named MAFIA. In this paper, we describe the design of DUNK and detailed algorithm of MAFIA.