• International Journal of Reliability and Applications
• /
• v.11 no.2
• /
• pp.69-87
• /
• 2010

The optimal replacement problem was investigated for a multi-state deteriorated system for which the true internal state cannot be observed directly except when the system breaks down completely. The internal state was assumed to be monitored incompletely by a monitor that gives information related to the true state of the system. The problem was formulated as a partially observable Markov decision process. The optimal procedure was found to be a monotone procedure with respect to stochastic increasing ordering of the state probability vectors under some assumptions. Limiting the optimal procedure to a monotone procedure would greatly reduce the tremendous amount of calculation time required to find the optimal procedure.

• Journal of the Korean Data and Information Science Society
• /
• v.16 no.1
• /
• pp.95-106
• /
• 2005

Complete-case analysis is easy to carry out and it may be fine with small amount of missing data. However, this method is not recommended in general because the estimates are usually biased and not efficient. There are numerous alternatives to complete-case analysis. A natural alternative procedure is available-case analysis. Available-case analysis uses all cases that contain the variables required for a specific task. The EM algorithm is a general approach for computing maximum likelihood estimates of parameters from incomplete data. These methods and multiple imputation(MI) are reviewed and the performances are compared by simulation studies in monotone missing pattern.

• Journal of Korean Society for Quality Management
• /
• v.35 no.1
• /
• pp.24-34
• /
• 2007

This paper investigates the average run length (ARL) of a selectively moving average (S-MA) control chart. The S-U chart is designed to detect shifts in the process mean. The basic idea of the S-MA chart is to accumulate previous samples selectively in order to increase the sensitivity. The ARL of the S-MA chart was shown to be monotone decreasing with respect to the decision length in a previous research [3]. This paper derives the steady-state ARL in a closed-form and shows that the monotone property is resulted from head-start assumption. The steady-state ARL is shown to be a sum of head-start ARL and an additional term. The statistical design procedure for the S-MA chart is revised according to this result. Sensitivity study shorts that the steady-state ARL performance is still better than the CUSUM chart or the Exponentially Weighted Moving Average (EWMA) chart.

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.203-206
• /
• 1998

This paper describes the procedure of getting information about auto-tuning of PID regulator by the injection of high step input, called limited input, during a transient time of control. The key point is that system identification and control could be continuously executed. This means that the system information obtained by limited input despite of system uncertainty can be continuously applied to the PI regulator. Simulation and experiment result of brushless DC motor system having monotone increasing step response demonstrate the usefulness of proposed auto-tuning algorithm.

• IE interfaces
• /
• v.7 no.1
• /
• pp.75-80
• /
• 1994

In a recent article, Leon et al. lucidly explained the ideas of the Taguchi two-stage procedure for parameter design optimization, and proposed alternative performance measures called PerMIA to the signal-to-noise ratios. On the other hand, Box proposed an empirical approach to the problem based upon monotone transformations of the performance characteristic(y). This paper develops procedures for parameter design optimization under the assumptions that the expected loss(not necessarily a mean squared error loss) is increasing with respect to the variance of the error in y, and that the mean of y satisfies certain conditions of adjustability. It turns out that the variance of the error in y can play the role of PerMIA, and it is further shown that the derived PerMIA can be adapted to the Box empirical procedure for the minimization of the expected loss in the original metric.

• Bulletin of the Korean Mathematical Society
• /
• v.50 no.3
• /
• pp.823-832
• /
• 2013

We present a new algorithm for solving a system of nonlinear equations with convex constraints which combines proximal point and projection methodologies. Compared with the existing projection methods for solving the problem, we use a different system of linear equations to obtain the proximal point; and moreover, at the step of getting next iterate, our projection way and projection region are also different. Based on the Armijo-type line search procedure, a new hyperplane is introduced. Using the separate property of hyperplane, the new algorithm is proved to be globally convergent under much weaker assumptions than monotone or more generally pseudomonotone. We study the convergence rate of the iterative sequence under very mild error bound conditions.