• Journal of Korean Institute of Industrial Engineers
• /
• v.16 no.2
• /
• pp.1-9
• /
• 1990

The control of deterioration processes for which only incomplete state information is available is examined in this study. When the deterioration is governed by a Markov process, such processes are known as Partially Observable Markov Decision Processes (POMDP) which eliminate the assumption that the state or level of deterioration of the system is known exactly. This research investigates a two state partially observable Markov chain in which only deterioration can occur and for which the only actions possible are to replace or to leave alone. The goal of this research is to develop a new jump algorithm which has the potential for solving system problems dealing with continuous state space Markov chains.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.1
• /
• pp.40-48
• /
• 2007

This paper presents a novel texture segmentation method using multilayer perceptron (MLP) networks and Markov random fields in multiscale Bayesian framework. Multiscale wavelet coefficients are used as input for the neural networks. The output of the neural network is modeled as a posterior probability. Texture classification at each scale is performed by the posterior probabilities from MLP networks and MAP (maximum a posterior) classification. Then, in order to obtain the more improved segmentation result at the finest scale, our proposed method fuses the multiscale MAP classifications sequentially from coarse to fine scales. This process is done by computing the MAP classification given the classification at one scale and a priori knowledge regarding contextual information which is extracted from the adjacent coarser scale classification. In this fusion process, the MRF (Markov random field) prior distribution and Gibbs sampler are used, where the MRF model serves as the smoothness constraint and the Gibbs sampler acts as the MAP classifier. The proposed segmentation method shows better performance than texture segmentation using the HMT (Hidden Markov trees) model and HMTseg.

• Communications for Statistical Applications and Methods
• /
• v.7 no.3
• /
• pp.773-788
• /
• 2000

Statistical process control (SPC) and engineering process control (EPC) are based on different strategies for processes quality improvement. SPC reduces process variability by detecting and eliminating special causes of process variation. while EPC reduces process variability by adjusting compensatory variables to keep the quality variable close to target. Recently there has been needs for a process control proceduce which combines the tow strategies. This paper considers a combined scheme which simultaneously applies SPC and EPC techniques to reduce the variation of a process. The process model under consideration is an integrated moving average(IMA) process with a step shift. The EPC part of the scheme adjusts the process back to target at every fixed monitoring intervals, which is referred to a repeated adjustment scheme. The SPC part of the scheme uses an exponentially weighted moving average(EWMA) of observed deviation from target to detect special causes. A Markov chain model is developed to relate the scheme's expected cost per unit time to the design parameters of he combined control scheme. The expected cost per unit time is composed of off-target cost, adjustment cost, monitoring cost, and false alarm cost.

• ETRI Journal
• /
• v.5 no.2
• /
• pp.3-8
• /
• 1983

This paper derives the Markov model to calculate the reliability of the Digital Switching System being developed by KETRI. Using the failure states extracted from the system in the course of the modelling, we calculated the reliability of both the service grade and the function of the system. Especially, by including the repair rate into the model, we took optimum advantage of theMarkov process and solved the difficulties in the calculation by reducing the number of states of the system.

• Journal of the Korea Society for Simulation
• /
• v.13 no.3
• /
• pp.1-10
• /
• 2004

The cell loss probability required in the ATM network is in the range of 10$^{-9}$ ∼10$^{-12}$ . If Monte Carlo simulation is used to analyze the performance of the ATM node, an enormous amount of computer time is required. To obtain large speed-up factors, importance sampling may be used. Since the Markov-modulated processes have been used to model various high-speed network traffic sources, we consider discrete time single server queueing systems with Markov-modulated arrival processes which can be used to model an ATM node. We apply importance sampling based on the Large Deviation Theory for the performance evaluation of, MMBP/D/1/K, ∑MMBP/D/1/K, and two stage tandem queueing networks with Markov-modulated arrival processes and deterministic service times. The simulation results show that the buffer overflow probabilities obtained by the importance sampling are very close to those obtained by the Monte Carlo simulation and the computer time can be reduced drastically.

• Journal of Digital Convergence
• /
• v.10 no.7
• /
• pp.167-172
• /
• 2012

In vocabulary recognition using HMM(Hidden Markov Model) by model for the observation of a discrete probability distribution indicates the advantages of low computational complexity, but relatively low recognition rate has the disadvantage that require sophisticated smoothing process. Gaussian mixtures in order to improve them with a continuous probability density CHMM (Continuous Hidden Markov Model) model is proposed for the optimization of the library system. In this paper is system configuration thread control in recognition Gaussian mixtures model provides a model to optimize of the CHMM vocabulary recognition. The result of applying the proposed system, the recognition rate of 98.1% in vocabulary recognition, respectively.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.2A
• /
• pp.139-148
• /
• 2011

This paper presents the minimum-cost network selection scheme which determines the transmission instance in the multi-band maritime communication system, so that the shipment-related real-time information can be transmitted within the maximum allowed period. The transmission instances and the corresponding network selection process are modeled by a Markov Decision Process (MDP), for the channel model in the 2-state Markov chain, which can be solved by stochastic dynamic programming. It derives the minimum-cost network selection rule, which can reduce the network cost significantly as compared with the straight-forward scheme with a periodic transmission.

• Journal of the Chungcheong Mathematical Society
• /
• v.26 no.4
• /
• pp.787-791
• /
• 2013

In this paper we present one factor model of commodity prices with a single jump regime-switching process. And we derive an analytic formula for pricing futures contracts when the parameters of commoditiy process have governed by a Markov regime-switching process.

• Communications for Statistical Applications and Methods
• /
• v.13 no.3
• /
• pp.491-501
• /
• 2006

We consider a multiple change point model with autoregressive conditional heteroscedasticity (ARCH). The model assumes that all or the part of the parameters in the ARCH equation change over time. The occurrence of the change points is modelled as the discrete time Markov process with unknown transition probabilities. The model is estimated by Markov chain Monte Carlo methods based on the approach of Chib (1998). Simulation is performed using a variant of perfect sampling algorithm to achieve the accuracy and efficiency. We apply the proposed model to the simulated data for verifying the usefulness of the model.

• Transactions on Control, Automation and Systems Engineering
• /
• v.2 no.1
• /
• pp.40-46
• /
• 2000

In this paper, a transient identification based on a Hidden Markov Model (HMM) has been suggested and evaluated experimentally for the classification of transients in the dynamic process. The transient can be identified by its unique time dependent patterns related to the principal variables. The HMM, a double stochastic process, can be applied to transient identification which is a spatial and temporal classification problem under a statistical pattern recognition framework. The HMM is created for each transient from a set of training data by the maximum-likelihood estimation method. The transient identification is determined by calculating which model has the highest probability for the given test data. Several experimental tests have been performed with normalization methods, clustering algorithms, and a number of states in HMM. Several experimental tests have been performed including superimposing random noise, adding systematic error, and untrained transients. The proposed real-time transient identification system has many advantages, however, there are still a lot of problems that should be solved to apply to a real dynamic process. Further efforts are being made to improve the system performance and robustness to demonstrate reliability and accuracy to the required level.