• Proceedings of the KIEE Conference
• /
• 2006.10c
• /
• pp.181-183
• /
• 2006

This paper proposes an intelligent decision framework for update of the environment model using GSPN(generalized stochastic petri nets). The GSPN has several advantages over direct use of the Markov Process. The modeling, analysis, and performance evaluation are conducted on the mathematical basis. By adopting the probabilistic approach, our decision framework helps the robot to decide the time to update the map. The robot navigates autonomously for a long time in dynamic environments. Experimental results show that the proposed scheme is useful for service robots which work semi-permanently and improves dependability of navigation in dynamic environments.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1997.10a
• /
• pp.301-308
• /
• 1997

The learning speed of the neural networks, the most important factor in applying to real problems, greatly depends on the learning rate of the networks, Three approaches-empirical, deterministic, and stochastic ones-have been proposed to date. We proposed a new learning-rate selection algorithm using an evolutionary programming search scheme. Even though the performance of our method showed better than those of the other methods, it was found that taking much time for selecting evolutionary learning rates made the performance of our method degrade. This was caused by using static intervals (called static windows) in order to update learning rates. Out algorithm with static windows updated the learning rates showed good performance or didn't update the learning rates even though previously updated learning rates shoved bad performance. This paper introduce a window control scheme to avoid such problems. With the window control scheme, our algorithm try to update the learning ra es only when the learning performance is continuously bad during a specified interval. If previously selected learning rates show good performance, new algorithm will not update the learning rates. This diminish the updating time of learning rates greatly. As a result, our algorithm with the window control scheme show better performance than that with static windows. In this paper, we will describe the previous and new algorithm and experimental results.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.34 no.1
• /
• pp.35-42
• /
• 2021

This paper presents an on-line finite element model updating method for in-service structures using measured data. Conventional updating methods, which are based on numerical optimization, are not efficient for on-line updating because they generally require repeated eigenvalue analyses until convergence criteria are met. The proposed method enables fully automated on-line finite element model updating, almost simultaneously with vibration measurement, without any user intervention or off-line procedures. The automated covariance-driven stochastic subspace identification (Cov-SSI) method is utilized to identify modal frequencies and vectors, and the identified modal data is fed to the neural network of the inverse eigenvalue function to produce the updated finite element model parameters. Numerical examples for a wind excited 20-story building structure shows that the proposed method can update the series of finite element model parameters automatically. It is also shown that sudden changes in the structural parameters can be detected and traced successfully.

• ETRI Journal
• /
• v.37 no.2
• /
• pp.395-405
• /
• 2015

We address the problem of uncooperative person recognition through continuous monitoring. Multiple modalities, such as face, height, clothes color, and voice, can be used when attempting to recognize a person. In general, not all modalities are available for a given frame; furthermore, only some modalities will be useful as some frames in a video sequence are of a quality that is too low to be able to recognize a person. We propose a method that makes use of stochastic information updates of temporal modalities and environment estimators to improve person recognition performance. The environment estimators provide information on whether a given modality is reliable enough to be used in a particular instance; such indicators mean that we can easily identify and eliminate meaningless data, thus increasing the overall efficiency of the method. Our proposed method was tested using movie clips acquired under an unconstrained environment that included a wide variation of scale and rotation; illumination changes; uncontrolled distances from a camera to users (varying from 0.5 m to 5 m); and natural views of the human body with various types of noise. In this real and challenging scenario, our proposed method resulted in an outstanding performance.

• Smart Structures and Systems
• /
• v.21 no.5
• /
• pp.601-609
• /
• 2018

The estimated probabilistic model of wind data based on the conventional approach may have high discrepancy compared with the true distribution because of the uncertainty caused by the instrument error and limited monitoring data. A sequential quadratic programming (SQP) algorithm-based finite mixture modeling method has been developed in the companion paper and is conducted to formulate the joint probability density function (PDF) of wind speed and direction using the wind monitoring data of the investigated bridge. The established bivariate model of wind speed and direction only represents the features of available wind monitoring data. To characterize the stochastic properties of the wind parameters with the subsequent wind monitoring data, in this study, Bayesian inference approach considering the uncertainty is proposed to update the wind parameters in the bivariate probabilistic model. The slice sampling algorithm of Markov chain Monte Carlo (MCMC) method is applied to establish the multi-dimensional and complex posterior distribution which is analytically intractable. The numerical simulation examples for univariate and bivariate models are carried out to verify the effectiveness of the proposed method. In addition, the proposed Bayesian inference approach is used to update and optimize the parameters in the bivariate model using the wind monitoring data from the investigated bridge. The results indicate that the proposed Bayesian inference approach is feasible and can be employed to predict the bivariate distribution of wind speed and direction with limited monitoring data.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.12C
• /
• pp.1280-1287
• /
• 2006

We propose a modified stochastic gradient-based (MSGB) filter showing that the filter is the solution to an optimization problem. This paper analyzes the properties of the MSGB filter that corresponds to the nonlinear adaptive filter with additional update terms, parameterized by the variable scaling factor. The variably parameterized MSGB filter plays a role iii connecting the fixed parameterized MSGB filter and the null parameterized MSGB filter through variably scaling parameter. The stability regions and misadjustments are shown. A system identification is utilized to perform the computer simulation and demonstrate the improved performance feature of the MSGB filter.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.37 no.11
• /
• pp.1315-1321
• /
• 2013

This study presents a prognostic technique for the damage state of a ball bearing. A stochastic bearing fatigue defect-propagation model is applied to estimate the damage progression rate. The damage state and the time to failure are computed by using RMS data from noisy acceleration signals. The parameters of the stochastic defect-propagation model are identified by conducting a series of run-to-failure tests for ball bearings. A regularized particle filter is applied to predict the damage progression rate and update the degradation state based on the acceleration RMS data. The future damage state is predicted based on the most recently measured data and the previously predicted damage state. The developed method was validated by comparing the prognostic results and the test data.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.7 no.4
• /
• pp.285-294
• /
• 2007

In this paper, we investigate a novel online estimation algorithm for dynamic Bayesian network(DBN) parameters, given as conditional probabilities. We sequentially update the parameter adjustment rule based on observation data. We apply our algorithm to two well known representations of DBNs: to a first-order Markov Chain(MC) model and to a Hidden Markov Model(HMM). A sliding window allows efficient adaptive computation in real time. We also examine the stochastic convergence and stability of the learning algorithm.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.8
• /
• pp.54-63
• /
• 1993

This paper proposes a method for improving the performances of the neural network for optimization by an optimal estimation of initial states. The optimal initial state that leads to the global minimum is estimated by using the stochastic approximation. And then the update rule of Hopfield model, which is the high speed deterministic algorithm using the steepest descent rule, is applied to speed up the optimization. The proposed method has been applied to the tavelling salesman problems and an optimal task partition problems to evaluate the performances. The simulation results show that the convergence speed of the proposed method is higher than conventinal Hopfield model. Abe's method and Boltzmann machine with random initial neuron output setting, and the convergence rate to the global minimum is guaranteed with probability of 1. The proposed method gives better result as the problem size increases where it is more difficult for the randomized initial setting to give a good convergence.

• The Journal of Information Technology and Database
• /
• v.4 no.2
• /
• pp.21-32
• /
• 1998

A primary concern of physical database design has been efficient retrieval and update of a record because predictable performance of a DBMS is indispensable to time-critical missions. To maintain such phenomenal performance, database manages often spends more than or as much as the goal of an organization can warrant. The motivation of this research stems from the fact that even predictable performance of a physical database can be hampered by stochastic query processing time, physical configurations of a database, and random arrival processes of queries. They all together affect the overall performance of a DBMS. In particular, if there are queuing delays due to limited capacity or during on-peak congestion, this paper suggest to prioritize database services. A surprising finding of this paper is that such a transition from a non-priority system to a corresponding priority-based system can be Pareto-improving in the sense that no users in the system will be worse off after the transition. Thus prioritizing database services can be a viable option for efficient database management.