• 한국측량학회지
• /
• 제33권6호
• /
• pp.569-577
• /
• 2015

The navigation algorithm developed based on the extended Kalman filter (EKF) sometimes diverges when the linearity between the measurements and the states is not preserved. In this study, new update conditions together with two conditions from previous study for gravity gradient referenced navigation (GGRN) were deduced for the filter performance. Also, the effect of each update conditions was evaluated imposing the various magnitudes of the database (DB) and the sensor errors. In case the DB and the sensor errors were supposed to 0.1 Eo and 0.01 Eo, the navigation performance was improved in the eight trajectories by using part of gravity gradient components that independently estimate states located within trust boundary. When applying only the components showing larger variation, around 200% of improvement was found. Even the DB and sensor error were supposed to 3 Eo, six update conditions improved performance in at least seven trajectories. More than five trajectories generated better results with 5 Eo error of the DB and the sensor. Especially, two update conditions successfully control divergence, and bounded the navigation error to the 1/10 level. However, these update conditions could not be generalized for all trajectories so that it is recommended to apply update conditions at the stage of planning, or as an index of precision of GGRN when combine with various types of geophysical data and algorithm.

• Smart Structures and Systems
• /
• 제31권1호
• /
• pp.29-43
• /
• 2023

This study investigates the possibility of damage detection of a real bridge by means of a modal parameter-based finite element (FE) model update. Field moving vehicle experiments were conducted on an actual steel plate girder bridge. In the damage experiment, cracks were applied to the bridge to simulate damage states. A fast Bayesian FFT method was employed to identify and quantify uncertainties of the modal parameters then these modal parameters were used in the Bayesian model update. Material properties and boundary conditions are taken as uncertainties and updated in the model update process. Observations showed that although some differences existed in the results obtained from different model classes, the discrepancy between modal parameters of the FE model and those experimentally obtained was reduced after the model update process, and the updated parameters in the numerical model were indeed affected by the damage. The importance of boundary conditions in the model updating process is also observed. The capability of the MCMC model update method for application to the actual bridge structure is assessed, and the limitation of FE model update in damage detection of bridges using only modal parameters is observed.

• 전자공학회논문지B
• /
• 제31B권3호
• /
• pp.39-46
• /
• 1994

In this paper, three types of parameter update law which can be used in model reference adaptive control are suggested based on speed-gradient algorithm which was introduced by Fradkov. It is shown that the parameter update law which was proposed by Narendra is a special from of these laws and that proposed parameter update laws can insure the global stability under some conditions such as attainability and convexity. We also comment that the transfer function of reference model shoud be positive real for the realization of parameter update law.

• 대한임베디드공학회논문지
• /
• 제4권3호
• /
• pp.103-111
• /
• 2009

Software update has been regarded as one of fundamental functions in wireless sensor networks. It can disseminate a delta-image between a current software image operating on a sensor node and its new image in order to reduce an update image(transmission data) size, resultantly saving energy. In addition, code-banking capability of micro-controllers can decrease the update image size. In order to maximize the efficiency of the software update, the proposed scheme exploits both the delta-image and the code-banking at the same time. Besides, it additionally delivers a recovery delta-image to properly handle abnormal conditions, such as message corruptions and unexpected power-off during the update.

• 한국측량학회지
• /
• 제32권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.

• 산업경영시스템학회지
• /
• 제18권36호
• /
• pp.83-91
• /
• 1995

The objective of this paper is to develop ail algorithm to update probabilities in influence diagrams. Pearl has designed the method of conditioning. This paper applies his algorithm for probability updates by selecting a loop-outset for tile diagram and instantiating these loop-outset nodes. It is discussed the conditions that need to be satisfied by the selected nodes. And a heuristic algorithm is presented for finding a loop-outset that satisfies these conditions.

• 한국멀티미디어학회논문지
• /
• 제9권12호
• /
• pp.1542-1551
• /
• 2006

In the Grid Database, some replicas will have more requests from the clients than others. A fast consistency algorithm has been presented to satisfy the high demand nodes in a shorter period of time. But it has poor performance in multiple regions of high demand for forming the island of locally consistent replicas. Then, a leader election method is proposed, whereas it needs much additional cost for periodic leader election, information storage, and message passing, Also, false leader can be created. In this paper, we propose a tree-based algorithm for replica update propagation. Leader replicas with high demand are considered as the roots of trees which are interconnected. All the other replicas are sorted and considered as nodes of the trees. Once an update occurs at any replica, it need be transmitted to the leader replicas first. Every node that receives the update propagates it to its children in the tree. The update propagation is optimized by cost reduction for fixed propagation schedule. And it is also flexible for the dynamic model in which the demand conditions change with time.

• 정보처리학회논문지D
• /
• 제8D권1호
• /
• pp.32-43
• /
• 2001

데이터 모델링 능력이 한정되고 뷰 갱신 모호성 문제에 기인하여, 관계형 뷰는 공학 응용에 제한적으로 사용되어 왔다. 반면에 객체지향 데이터베이스의 뷰는 관계형 뷰의 이 두 가지 단점을 극복하기 때문에, 공학 응용을 위한 맞춤 인터페이스를 정의하는데 중요한 역할을 할 것이다. 특히 공학 응용을 위한 데이터베이스 인터페이스는 갱신을 충분히 지원하여 한다. 좀더 자세히 말하면, 인터페이스에 대한 갱신이 모호성이 없이 정의되어야 하며 이 정의는 베이스 스키마에 대한 갱신 행동과 일치하여야 한다. 이를 위하여 객체지향 뷰가 베이스 데이터 모델과 같은 갱신 행동을 보이기 위한 제반 조건 - 갱신 의미 보존(update semantic preserving)-을 정의하였다. 그리고 이 갱신 의미 보존 특성의 실현 가능성을 보이기 위하여 CAD에 특화된 객체지향 뷰 시스템, 멀티 뷰(MultiView), 을 선정하여 그 시스템의 뷰 모델에 대한 갱신 의미 보존 갱신 행동을 정의하고 구체적인 구현 알고리즘을 제시하였다. 이 연구는 객체지향 데이터베이스에서 가장 클래스를 모았을 때 단순한 클래스의 모임이 아니라 isa계층을 갖는 '스키마'가 될 수 있게하기 위해서는 가상 클래스에 대한 갱신 의미가 클래스간 isa 관계를 위반해서는 안된다는 것을 발견하였다. 그리고 이의 충분조건으로 '뷰 스키마가 베이스 스키마처럼 보이도록'하는 가상 클래스의 갱신 의미와 가상 클래스간 스키마 형성 가능 조건을 발견하였다. 이는 객체 지향 데이터베이스에서 뷰를 클래스 수준에서 스키마 수준으로 정의하는 충분조건을 발견하고 구현한 최초의 논문이다.

• 전자공학회논문지B
• /
• 제29B권7호
• /
• pp.11-22
• /
• 1992

In this paper, a new indexing technique is proposed for efficient evaluation of nested queries on aggregation hierarchy in object-oriented data model. As an index data structure, an extended $B^{+}$ tree is introduced in which instance identifier to be searched and path information used for update of index record are stored in leaf node and subleaf node, respectively. the retrieval and update algorithm on the introduced index data structure is provided. Comparisons under a variety of conditions are given with current indexing techniques, showing improved performance in cost, i.e., the total number of pages accessed for retrieval and update.

• 한국정보통신학회논문지
• /
• 제24권9호
• /
• pp.1117-1122
• /
• 2020

모바일 기기의 성능 향상과 활용 분야가 점점 커지고 넓어지고 있다. 이러한 추세에 따라 모바일 기기에서 데이터베이스 엔진을 사용하는 응용 분야도 보편화되고 있다. 모바일 데이터베이스를 필요로 하는 응용은 모바일 서버용 데이터베이스, 에지 컴퓨팅, 포그 컴퓨팅 등이 있다. 그런데, 가장 대표적이고 널리 사용되는 모바일 데이터베이스는 SQLite3이다. 이 논문에서는 이 SQLite3의 파일 시스템 별 갱신 성능을 테스트하고 비교 평가하고자 한다. 모바일 환경에서 파일 시스템에 따른 갱신 성능은 제한된 H/W 환경에서 중요한 성능 요인으로 작용한다. 비교 파일 시스템은 가장 보편적으로 사용되는 FAT, Ext2, 그리고 NTFS로 선정하였다. 동일한 조건에서 각 파일 시스템들의 갱신 성능 및 특성을 테스트하기 위한 실험을 진행하였다. 실험 결과로부터 각 데이터베이스 갱신 패턴에 따른 파일 시스템 별 장단점을 분석할 수 있었다.