• 대한산업공학회지
• /
• 제33권4호
• /
• pp.457-468
• /
• 2007

This paper proposes an adaptive moving average (A-MA) control chart with variable sampling intervals (VSI) for detecting shifts in the process mean. The basic idea of the VSI A-MA chart is to adjust sampling intervals as well as to accumulate previous samples selectively in order to increase the sensitivity. The VSI A-MA chart employs a threshold limit to determine whether or not to increase sampling rate as well as to accumulate previous samples. If a standardized control statistic falls outside the threshold limit, the next sample is taken with higher sampling rate and is accumulated to calculate the next control statistic. If the control statistic falls within the threshold limit, the next sample is taken with lower sampling rate and only the sample is used to get the control statistic. The VSI A-MA chart produces an 'out-of-control' signal either when any control statistic falls outside the control limit or when L-consecutive control statistics fall outside the threshold limit. The control length L is introduced to prevent small mean shifts from being undetected for a long period. A Markov chain model is employed to investigate the VSI A-MA sampling process. Formulae related to the steady state average time-to signal (ATS) for an in-control state and out-of-control state are derived in closed forms. A statistical design procedure for the VSI A-MA chart is proposed. Comparative studies show that the proposed VSI A-MA chart is uniformly superior to the adaptive Cumulative sum (CUSUM) chart and to the Exponentially Weighted Moving Average (EWMA) chart, and is comparable to the variable sampling size (VSS) VSI EWMA chart with respect to the ATS performance.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2008년도 춘계학술대회 논문집 전기기기 및 에너지변환시스템부문
• /
• pp.65-67
• /
• 2008

An adaptive response surface method with Latin Hypercube sampling strategy is employed to optimize a magnet pole shape of large scale BLDC motor to minimize the cogging torque. The proposed algorithm consists of the multi-objective Pareto optimization and ($1+{\lambda}$) evolution strategy to find the global optimal points with relatively fewer sampling data. In the adaptive RSM, an adaptive sampling point insertion method is developed utilizing the design sensitivities computed by using finite element method to set a reasonable response surface with a relatively small number of sampling points. The developed algorithm is applied to the shape optimization of PM poles for 6MW BLDC motor.

• 품질경영학회지
• /
• 제32권4호
• /
• pp.169-183
• /
• 2004

The synthetic control chart (SCC) proposed by Wu and Spedding (2000) is to detect shifts in the process mean. The performance was re-evaluated by Davis and Woodall (2002), and the steady-state average run length (ARL) performance was shown to be inferior to cumulative sum (CUSUM) or exponentially weighted moving average (EWMA) chart This paper proposes a simple adaptive scheme to improve the performance of the synthetic control chart. That is, once a non-conforming (NC) sample occurs, we investigate the next L-consecutive samples with larger sample sizes and shorter sampling intervals. We employ a Markov chain model to derive the ARL and the average time to s19na1 (ATS). We also propose a statistical design procedure for determining decision variables. Comprehensive comparative study shows that the proposed control chart is uniformly superior to the original SCC or double sampling (DS) Χ chart and comparable to the EWMA chart in ATS performance.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2008년도 제39회 하계학술대회
• /
• pp.701-702
• /
• 2008

An adaptive response surface method with Latin Hypercube sampling strategy is employed to optimize a magnet pole shape of large scale BLDC motor to minimize the cogging torque. The proposed algorithm consists of the multi-objective Pareto optimization and (1+${\lambda}$) evolution strategy to find the global optimal points with relatively fewer sampling data. In the adaptive RSM, an adaptive sampling point insertion method is developed utilizing the design sensitivities computed by using finite element method to get a reasonable response surface with a relatively small number of sampling points. The developed algorithm is applied to the shape optimization of PM poles for 6 MW BLDC motor, and the cogging torque is reduced to 19% of the initial one.

• 정보처리학회논문지D
• /
• 제17D권3호
• /
• pp.185-192
• /
• 2010

센서 네트워크 환경에서는 각 센서는 정의된 샘플링 주기에 따라서 외부 환경을 측정하고 측정된 값을 기지국으로 전송한다. 따라서, 샘플링 주기는 대역폭, 전력량 등 센서들의 중요 자원의 소비에 지대한 영향을 끼친다. 본 논문에서는 측정값 특성에 따라서 센서의 샘플링 주기를 조절하는 새로운 적응적 샘플링 기법을 제안한다. 제안하는 기법은 KF (Kalman-Filter)에 기반하여 미래의 측정값을 예측한다. 그리고, 실측값과 예측값의 차이에 따라서 센서 측정값들의 중요도를 파악하고 이에 따라서 샘플링 주기를 변화시킨다. 실험에서 제안하는 기법의 효과성을 보였다.

• 대한의용생체공학회:학술대회논문집
• /
• 대한의용생체공학회 1992년도 춘계학술대회
• /
• pp.79-81
• /
• 1992

This paper describes the design of an adaptive closed circuit anesthesia controller based on a multiplexed mass spectrometer system. The controller deals with measurement deterioration caused by measurement delay and rise time through a tong catheter as well as long sampling times due to the multiplexed measurements. Measurement data is extrapolated between sampling periods to increase the estimation convergence rate. A multiple-step-ahead predictive control algorithm is used to calculate intermediatc control inputs between sampling intervals. Simulations are used to validate the designed controller.

• 대한의용생체공학회:의공학회지
• /
• 제27권1호
• /
• pp.6-13
• /
• 2006

Ultrasound visualization is a typical diagnosis method to examine organs, soft tissues and fetus data. It is difficult to visualize ultrasound data because the quality of the data might be degraded by artifact and speckle noise, and gathered with non-linear sampling. Rendering speed is too slow since we can not use additional data structures or procedures in rendering stage. In this paper, we use several visualization methods for fast rendering of ultrasound data. First method, denoted as adaptive ray sampling, is to reduce the number of samples by adjusting sampling interval in empty space. Secondly, we use early ray termination scheme with sufficiently wide sampling interval and low threshold value of opacity during color compositing. Lastly, we use bilinear interpolation instead of trilinear interpolation for sampling in transparent region. We conclude that our method reduces the rendering time without loss of image quality in comparison to the conventional methods.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권7호
• /
• pp.3057-3075
• /
• 2020

End-to-end network delay plays an vital role in distributed services. This delay is used to measure QoS (Quality-of-Service). It would be beneficial to know all node-pair delay information, but unfortunately it is not feasible in practice because the use of active probing will cause a quadratic growth in overhead. Alternatively, using the measured network delay to estimate the unknown network delay is an economical method. In this paper, we adopt the state-of-the-art matrix completion technology to better estimate the network delay from limited measurements. Although the number of measurements required for an exact matrix completion is theoretically bounded, it is practically less helpful. Therefore, we propose an online adaptive sampling algorithm to measure network delay in which statistical leverage scores are used to select potential matrix elements. The basic principle behind is to sample the elements with larger leverage scores to keep the traits of important rows or columns in the matrix. The amount of samples is adaptively decided by a proposed stopping condition. Simulation results based on real delay matrix show that compared with the traditional sampling algorithm, our proposed sampling algorithm can provide better performance (smaller estimation error and less convergence pressure) at a lower cost (fewer samples and shorter processing time).

• Structural Engineering and Mechanics
• /
• 제75권6호
• /
• pp.771-784
• /
• 2020

Reliability analysis techniques combining with various surrogate models have attracted increasing attention because of their accuracy and great efficiency. However, they primarily focus on the structures with continuous response, while very rare researches on the reliability analysis for structures with discontinuous response are carried out. Furthermore, existing adaptive reliability analysis methods based on importance sampling (IS) still have some intractable defects when dealing with small failure probability, and there is no related research on reliability analysis for structures involving discontinuous response and small failure probability. Therefore, this paper proposes a novel reliability analysis method called AGPC-IS for such structures, which combines adaptive Gaussian process classification (GPC) and adaptive-kernel-density-estimation-based IS. In AGPC-IS, an efficient adaptive strategy for design of experiments (DoE), taking into consideration the classification uncertainty, the sampling uniformity and the regional classification accuracy improvement, is developed with the purpose of improving the accuracy of Gaussian process classifier. The adaptive kernel density estimation is introduced for constructing the quasi-optimal density function of IS. In addition, a novel and more precise stopping criterion is also developed from the perspective of the stability of failure probability estimation. The efficiency, superiority and practicability of AGPC-IS are verified by three examples.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권6호
• /
• pp.2070-2086
• /
• 2014

As a kind of personal lifelog data, activity data have been considered as one of the most compelling information to understand the user's habits and to calibrate diagnoses. In this paper, we proposed a robust algorithm to sampling rates for human activity recognition, which identifies a user's activity using accelerations from a triaxial accelerometer in a smartphone. Although a high sampling rate is required for high accuracy, it is not desirable for actual smartphone usage, battery consumption, or storage occupancy. Activity recognitions with well-known algorithms, including MLP, C4.5, or SVM, suffer from a loss of accuracy when a sampling rate of accelerometers decreases. Thus, we start from particle swarm optimization (PSO), which has relatively better tolerance to declines in sampling rates, and we propose PSO with an adaptive boundary correction (ABC) approach. PSO with ABC is tolerant of various sampling rate in that it identifies all data by adjusting the classification boundaries of each activity. The experimental results show that PSO with ABC has better tolerance to changes of sampling rates of an accelerometer than PSO without ABC and other methods. In particular, PSO with ABC is 6%, 25%, and 35% better than PSO without ABC for sitting, standing, and walking, respectively, at a sampling period of 32 seconds. PSO with ABC is the only algorithm that guarantees at least 80% accuracy for every activity at a sampling period of smaller than or equal to 8 seconds.