• Journal of KSNVE
• /
• v.7 no.1
• /
• pp.61-69
• /
• 1997

Despite of the development in the finite element method, it is difficult to get the finite element model describing the dynamic characteristics of the complex structure exactly. Therefore a number of different methods have been developed in order to update the finite element model of a structure using vibration test data. This paper outlines the basic formulation for the frequency response function based updating method. One important advantage of this method is that the intermediate step of performing an eigensolution extraction is unnecessary. Using simulated experimental data, studies are conducted in the case of 10 DOF discrete system. The solution of noisy and incomplete experimental data is discussed. True measured frequency response function data are used for updating the finite element model of a beam and a plate. Its applicability to the joint identification is also considered.

• Proceedings of the KSRS Conference
• /
• 2005.10a
• /
• pp.272-275
• /
• 2005

The digital map expresses natural topographies and artificial things with 3D position coordinates in the computer such as the road, railway, building, river, mountain, paddy and dryland. Therefore, the digital map is regarded as an important factor in the information-oriented society. However, it is difficult to maintain the most recent topographic information all the times because of restricted budget and time. For that, the efficient method corresponded with the digital map should be presented. This study aims to suggest the way to make an estimate of updating cost for 1:5,000 scale digital map by using remotely sensed data. To predict updating area of the digital map, the screen digitizing method was applied to the overlapped images and digital maps.

• Journal of applied mathematics & informatics
• /
• v.9 no.2
• /
• pp.607-620
• /
• 2002

In this paper, we consider the updating problems to reconstruct the biconnected-components and to reconstruct the weighted shortest path in response to the topology change of the network. We propose two distributed algorithms. The first algorithm solves the updating problem that reconstructs the biconnected-components after the several processors and links are added and deleted. Its bit complexity is O((n'+a+d)log n'), its message complexity is O(n'+a+d), the ideal time complexity is O(n'), and the space complexity is O(e long n+e' log n'). The second algorithm solves the updating problem that reconstructs the weighted shortest path. Its message complexity and ideal-time complexity are $O(u^2+a+n')$ respectively.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.19 no.9
• /
• pp.884-891
• /
• 2009

This study investigates some of swarm intelligence algorithms to tackle a traditional damage detection problem having stiffness degradation or damage in mechanical structures. Particle swarm(PSO) and ant colony optimization(ACO) methods have been exploited for localizing and estimating the location and extent damages in a structure. Both PSO and ACO are population-based, stochastic algorithms that have been developed from the underlying concept of swarm intelligence and search heuristic. A finite element (FE) model updating is implemented to minimize the difference in a set of natural frequencies between measured and baseline vibration data. Stiffness loss of certain elements is considered to simulate structural damages in the FE model. It is numerically shown that PSO and ACO algorithms successfully completed the optimization process of model updating in locating unknown damages in a truss structure.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.19 no.2
• /
• pp.171-188
• /
• 2015

In this paper, the efficient column-wise/row-wise lattice reduction (LR) updating and downdating methods are developed and their complexities are analyzed. The well-known LLL algorithm, developed by Lenstra, Lenstra, and Lov${\acute{a}}$sz, is considered as a LR method. When the column or the row is appended/deleted in the given lattice basis matrix H, the proposed updating and downdating methods modify the preconditioning matrix that is primarily computed for the LR with H and provide the initial parameters to reduce the updated lattice basis matrix efficiently. Since the modified preconditioning matrix keeps the information of the original reduced lattice bases, the redundant computational complexities can be eliminated when reducing the lattice by using the proposed methods. In addition, the rounding error analysis of the proposed methods is studied. The numerical results demonstrate that the proposed methods drastically reduce the computational load without any performance loss in terms of the condition number of the reduced lattice basis matrix.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2014.10a
• /
• pp.485-485
• /
• 2014

배관 가동시 여러 지점에서 가속도를 측정, 이를 이용하여 배관의 어느 부위에 stress가 많이 걸리는지 해석적으로 확인하기 위한 연구이다. 먼저, 배관 설계시 사용된 CEASER II의 정보를 기반으로 해석 모델을 만들었다. 해석 모델을 바탕으로 측정 포인트를 산정한 후, 가동 중인 배관의 가속도를 측정하였다. 측정된 가속도 data를 OMA(Operational Modal Analysis) method를 이용하여 Mode shape 및 Frequency를 추출한 후 이를 바탕으로 배관의 FE 모델을 Updating 하였다. Updating 된 배관 FE 모델에 측정된 가속도 data가 나오도록 Force를 가해 배관에 걸리는 stress를 계산하였다.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.10 no.2
• /
• pp.220-227
• /
• 2002

This paper describes an integrated approach process to carry out pre-test, model correlation and updating analysis on the sub-frame of a vehicle. In this study, it was found that the modal test could be more efficient when the exciting point was selected on the area with high driving point residue. Such area could be located with the aid of finite element modal analysis. The model correlation was appraised in conjunction with the modal parameters between modal test and finite elements analysis. Also, the finite element model updating was obtained the good resultant using the iteration method based on sensitivity analysis results that carried out the variation of natural frequencies and MAC for the material properties. Finally, optimization of vehicle subframe was carried out the analysis of core location and physical properties by tow steps.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2010.04a
• /
• pp.23-25
• /
• 2010

In this paper, we studied linking method for updating navigation map with new address map. This method is hierarchical as we chose candidate using attribute data for geometry matching. Limiting a matching range, we conducted a experiment ICP with geometry matching. As a result, for linking method it's quite satisfied but for updating method, we decided that we have to do more precise method for updating.

• Journal of Power System Engineering
• /
• v.11 no.1
• /
• pp.20-27
• /
• 2007

In this paper, finite element modeling was performed for vibration analysis of a rotor system installed in sunroof motor, and analysis process was developed for natural frequency and unbalance response analysis. At the same time, to reduce analysis modeling error caused by the difference between analysis and measured values, finite element model updating was conducted using an optimization algorithm, i.e. hybrid genetic algorithm and simulated annealing (HGASA) method. For this end experimental modal test was carried out and by using the measured frequency response function (FRF), model updating was performed considering both cases where core coil was removed and included. And acceptable result was obtained. Also, dynamic property coefficient of bush bearing which influences vibration response of the rotor system was estimated.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.43 no.5 s.311
• /
• pp.17-28
• /
• 2006

In this paper, we investigate a problem of updating sequential patterns when new transactions are added to a database. We present an efficient updating algorithm for sequential pattern mining that incrementally updates added transactions by reusing frequent patterns found previously. Our performance study shows that this method outperforms both AprioriAll and PrefixSpan algorithm which updates from scratch, since our method can efficiently utilize reduced candidate sets which result from the incremental updating technique.