• 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.

• 제어로봇시스템학회:학술대회논문집
• /
• 1988.10a
• /
• pp.633-638
• /
• 1988

In this paper, a zero-velocity update technique to improve navigation accuracy of a SDINS(Strapdown Inertial Navigation System) has been studied. An indirect feedback Kalman filter which includes SDINS error equations based on a quaternion between body-fixed frame and local level navigation frame is employed for processing zero-velocity updates in an on-board navigation filter. Simulation results for land-mobile vehicle show that the zerovelocity update technique make a significant contribution to improving SDINS performance without any external aids.

• Journal of applied mathematics & informatics
• /
• v.30 no.1_2
• /
• pp.201-210
• /
• 2012

A modified multiplicative update algorithms is presented for computing the nearest correlation matrix. The convergence property is analyzed in details and a sufficient condition is given to guarantee that the proposed approach will not breakdown. A number of numerical experiments show that the modified multiplicative updating algorithm is efficient, and comparable with the existing algorithms.

• Proceedings of the IEEK Conference
• /
• 2003.07a
• /
• pp.53-56
• /
• 2003

In order to enhance the system capacity of multi rate IEEE 802.11 WLAN, we propose the transmission rate select method using the control frame in this paper. The transmission rate is selected dynamically based on the RSSI(Received Signal Strength Indicator) of received control frame. And we also propose the Enhanced NAV Update method for Fragmented MPDU burst transmission in multirate WLAN environment. This method can improve the system capacity by support the burst transmission of fragmented MPDU.

• Proceedings of the IEEK Conference
• /
• 2003.07a
• /
• pp.169-173
• /
• 2003

In this paper, we analyze a time-based update method in location management and calculate the optimal time-interval. We obtain the probability that an MT is j rings away from the center cell. And using these values, an exact analysis is made for the time-based location management cost. From the result, when the time-based method is applied to location update, we can get the optimal time-interval which minimizes the location management cost.

• Journal of the military operations research society of Korea
• /
• v.29 no.1
• /
• pp.28-42
• /
• 2003

The simplex method requires basis update in each iteration, which is the most time consuming process. Several methods have been developed for the update of basis which is represented in LU factorized form, such as Bartels-Golub's method, Forrest-Tomlin's method, Reid's method, Saunders's method, etc. In this research, we compare between the updating methods in terms of sparsity, data structure and computing time issues. The analysis is mainly based on the computational experience.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2009.04a
• /
• pp.425-428
• /
• 2009

This paper presents a sensitivity-based finite element (FE)-model update procedure for prestressed concrete (PSC) girder bridge model using vibration test results. Firstly, the stiffness parameters of the structure such as flexural rigidity of concrete and flexural rigidity of tendon are chosen as updating parameters. Next, the numerical frequencies of first two bending modes are calculated using a three-dimensional FE model which is established for the PSC girder. Then, the corresponding experimental frequencies which are obtained from forced vibration tests are selected. In order to perform the model update, the eigensensitivity-based method is employed. Finally, the effect of prestress-loss on the stiffness parameters is evaluated.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2000.04a
• /
• pp.449-452
• /
• 2000

This paper proposes a new, adaptive Dead Reckoning model, called Dynamic Dead Reckoning , for Distributed Interactive Simulation and humanoid avatar systems. The proposed model can overcome the weak points of traditional Dead Reckoning caused by a fixed threshold and strong dependency on rotation event. This paper introduces new criteria for update message filtering , named as Update lifetime. The Dynamic Dead Reckoning keeps the balance between extrapolation fidelity and filtering performance by two component models, Variable Threshold Mechanism and Rotation Event model. The experimental results show that the proposed model can lower the increment rate of update traffic to the increase of rotation frequency without any significant loss of accuracy.

• Bulletin of the Korean Mathematical Society
• /
• v.46 no.3
• /
• pp.521-534
• /
• 2009

In this paper we present new large-update primal-dual interior point algorithms for $P_*$ linear complementarity problems(LAPS) based on a class of kernel functions, ${\psi}(t)={\frac{t^{p+1}-1}{p+1}}+{\frac{1}{\sigma}}(e^{{\sigma}(1-t)}-1)$, p $\in$ [0, 1], ${\sigma}{\geq}1$. It is the first to use this class of kernel functions in the complexity analysis of interior point method(IPM) for $P_*$ LAPS. We showed that if a strictly feasible starting point is available, then new large-update primal-dual interior point algorithms for $P_*$ LAPS have $O((1+2+\kappa)n^{{\frac{1}{p+1}}}lognlog{\frac{n}{\varepsilon}})$ complexity bound. When p = 1, we have $O((1+2\kappa)\sqrt{n}lognlog\frac{n}{\varepsilon})$ complexity which is so far the best known complexity for large-update methods.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07a
• /
• pp.478-480
• /
• 2005

본 논문에서는 모바일 셀룰러 네트워크상에서 다양한 이동 단말 이동성을 이용한 동적인 Location Update 기법을 제안한다. 동적인 Location Update 기법에서는 다양한 이동 단말들의 이동 패턴을 고려하기 위해서 Differentiated-Walk Model을 이용하고 그 모델에서 제공하는 핸드오프 확률과 이동성 등급을 이용하여 LA(Location Area)를 형성한다. LA는 사용자의 이동 패턴을 고려하여 동적으로 형성되며 본 논문에서는 이러한 LA를 기반으로 제공되는 페이징 기법을 제안한다.