• 제어로봇시스템학회:학술대회논문집
• /
• 1987.10b
• /
• pp.658-663
• /
• 1987

The new controller developed here, which is the facility with only one measurement, is a new concept for the level controller of the existing nuclear steam generator. A MACS (Microcomputer-based Adaptive Control System of a Steam Generator) is quite practical and efficient, and has also simple structure and higher flexibility in the installment for actual plant. A key ingredient of this system is adaptive regulator which can calculate adaptive, optimal valve position in response to changes in the dynamics of the process and the disturbances. In spite of many difficulties in the steam generator water level control at low power, it can be concluded from the experimental and simulation results, that the MACS can provide optimal, robust steam generator level control from zero to full power. The amount of the control input effort can be reduced by adjusting the weighting factor. However, the steady state water level errors are generated. To avoid the steady errors, the different adaptive algorithm should be investigated in the future. The 3 second sampling time is acceptable for this system. However, action should be taken to shorten the sampling time for better digital control.

• Korean Journal of Computational Design and Engineering
• /
• v.3 no.1
• /
• pp.15-21
• /
• 1998

Several adaptive and direct slicing methods have been developed to make the slice data for RP parts with better accuracy and speed. This research deals with a new adaptive slicing algorithm that shows drastic improvement in computing time for calculating the slices of a part. First, it uses less number of sampling points fur each slice in determining the thickness of the next slice. Secondly, the idea of contour map is utilized to determine the optimal sampling point on each slice. Thirdly, the calculation efficiency is further improved by introducing vertical character lines of the given part. The results in terms of accuracy and speed are compared with the existing methods.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 1999.10a
• /
• pp.351-358
• /
• 1999

The structural responses of underground structures are examined in probability by using the elasto-plastic stochastic finite element method in which the spatial distributions of material properties are assumed to be stochastic fields. In addition, the adaptive importance sampling method using the response surface technique is used to improve simulation efficiency. The method is found to provide appropriate information although the nonlinear Limit State involves a large number of basic random variables and the failure probability is small. The probability of plastic local failures around an excavated area is effectively evaluated and the reliability for the limit displacement of the ground is investigated. It is demonstrated that the adaptive importance sampling method can be very efficiently used to evaluate the reliability of a large scale stochastic finite element model, such as the underground structures located in the multi-layered ground.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.1A
• /
• pp.75-82
• /
• 2007

This paper proposes the way that reduces power consumption of the IEEE 802.15.4-based sensor network. To reduce power consumption, we consider following two schemes; first scheme is the Adaptive Beacon Interval Control. The next is the Adaptive Superframe Duration Control. Our results show that these guarantee reducing power consumption in ns-2 simulator.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.11B
• /
• pp.1038-1049
• /
• 2003

Exactly measuring traffic load is the basis for efficient traffic engineering. However, precise traffic measurement involves inspecting every packet traversing a lint resulting in significant overhead on routers with high-speed links. Sampling techniques are proposed as an alternative way to reduce the measurement overhead. But, since sampling inevitably accompany with error, there should be a way to control, or at least limit, the error for traffic engineering applications to work correctly. In this paper, we address the problem of bounding sampling error within a pre-specified tolerance level. We derive a relationship between the number of samples, the accuracy of estimation and the squared coefficient of variation of packet size distribution. Based on this relationship, we propose an adaptive random sampling technique that determines the minimum sampling probability adaptively according to traffic dynamics. Using real network traffic traces, we show that the proposed adaptive random sampling technique indeed produces the desired accuracy, while also yielding significant reduction in the amount of traffic samples.

• Journal of the Korean Data and Information Science Society
• /
• v.26 no.3
• /
• pp.593-610
• /
• 2015

Adaptive Rejection Sampling (ARS) method is a well-known random number generator to acquire a random sample from a probability distribution, and has the advantage of improving the proposal distribution during the sampling procedures, which update it closer to the target distribution. However, the use of ARS is limited since it can be used only for the target distribution in the form of the log-concave function, and thus various methods have been proposed to overcome such a limitation of ARS. In this paper, we attempt to compare five random number generators based on ARS in terms of adequacy and efficiency. Based on empirical analysis using simulations, we discuss their results and make a comparison of five ARS-based methods.

• Smart Structures and Systems
• /
• v.17 no.4
• /
• pp.611-629
• /
• 2016

This study presents a new approach of surrogate modeling for time-consuming finite element analysis. A surrogate model is widely used to reduce the computational cost under an iterative computational analysis. Although a variety of the methods have been widely investigated, there are still difficulties in surrogate modeling from a practical point of view: (1) How to derive optimal design of experiments (i.e., the number of training samples and their locations); and (2) diagnostics of the surrogate model. To overcome these difficulties, we propose a sequential surrogate modeling based on Gaussian process model (GPM) with self-adaptive sampling. The proposed approach not only enables further sampling to make GPM more accurate, but also evaluates the model adequacy within a sequential framework. The applicability of the proposed approach is first demonstrated by using mathematical test functions. Then, it is applied as a substitute of the iterative finite element analysis to Monte Carlo simulation for a response uncertainty analysis under correlated input uncertainties. In all numerical studies, it is successful to build GPM automatically with the minimal user intervention. The proposed approach can be customized for the various response surfaces and help a less experienced user save his/her efforts.

• International Journal of Contents
• /
• v.10 no.3
• /
• pp.17-25
• /
• 2014

In this paper, we describe an adaptive Markov chain Monte Carlo-based particle filter that effectively addresses real-time multi-face tracking on mobile platforms. Because traditional approaches based on a particle filter require an enormous number of particles, the processing time is high. This is a serious issue, especially on low performance devices such as mobile phones. To resolve this problem, we developed a tracker that includes a more sophisticated likelihood model to reduce the number of particles and maintain the identity of the tracked faces. In our proposed tracker, the number of particles is adjusted during the sampling process using an adaptive sampling scheme. The adaptive sampling scheme is designed based on the average acceptance ratio of sampled particles of each face. Moreover, a likelihood model based on color information is combined with corner features to improve the accuracy of the sample measurement. The proposed tracker applied on various videos confirmed a significant decrease in processing time compared to traditional approaches.

• Journal of the Korean Statistical Society
• /
• v.35 no.2
• /
• pp.157-166
• /
• 2006

This research proposes an efficient Monte Carlo algorithm for computing error probability in high performance digital communication st stems. It characterizes special features of the problem and suggests an importance sampling algorithm specially designed to handle the problem. It uses a shifted exponential density as the importance sampling density, and shows an adaptive way of choosing the rate and the origin of the shifted exponential density. Instead of equal allocation, an intelligent allocation of the samples is proposed so that more samples are allocated to more important part of the error probability. The algorithm uses the nested feature of the error space and avoids redundancy in estimating the probability. The algorithm is applied to an example data set and shows a great improvement in accuracy of the error probability estimation.

• Communications for Statistical Applications and Methods
• /
• v.14 no.2
• /
• pp.355-363
• /
• 2007

In this paper a Bayesian estimation of the two-parameter kappa distribution was discussed under the noninformative prior. The Bayesian estimators are obtained by the Gibbs sampling. The generation of the shape parameter and scale parameter in the Gibbs sampler is implemented using the adaptive rejection Metropolis sampling algorithm of Gilks et al. (1995). A Monte Carlo study showed that the Bayesian estimators proposed outperform other estimators in the sense of mean squared error.