• Communications for Statistical Applications and Methods
• /
• v.8 no.1
• /
• pp.109-115
• /
• 2001

Wavelet coefficients are known to have decorrelating properties, since wavelet is orthonormal transformation. but empirically, those wavelet coefficients of images, like edges, are not statistically independent. Jansen and Bultheel(1999) developed the empirical Bayes approach to improve the classical threshold algorithm using local characterization in Markov random field. They consider the clustering of significant wavelet coefficients with uniform distribution. In this paper, we developed wavelet thresholding algorithm using Laplacian distribution which is more realistic model.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.29 no.3
• /
• pp.111-127
• /
• 2004

We consider a supply chain model with a make-to-order production facility and a single supplier. The model we treat here is a special case of a two-echelon inventory model. Unlike classical two-echelon systems, the demand process at the supplier is affected by production process at the production facility as well as customer order arrival process. In this paper, we address that how the demand variability impacts on the optimal replenishment policy. To this end, we incorporate Erlang and phase-type demand distributions into the model. Formulating the model as a Markov decision problem, we investigate the structure of the optimal replenishment policy. We also implement a sensitivity analysis on the optimal policy and establish its monotonicity with respect to system cost parameters.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10c
• /
• pp.246-248
• /
• 1998

본 논문에서는 대화형 시스템을 시험하기 위한 시험 사례를 마코프 연쇄의 통계적 확률 과정으로 생성하는 방안을 제시한다. 객체지향 방법론의 통합안인 UML에서는 클래스도(Class Diagram)가 표현할 수 없었던 시스템의 동적인 관점을 상태 전이도(State Transition Diagram)는 구체적으로 표현할 수 있다. 시스템의 사용법을 상태 전이도로 표현하고, 상태간의 전이 확률(Transition Probability)을 계산하여 사용법 연쇄(Usage Chain)를 구성한다. 사용법 연쇄는 다음 상태가 과거의 상태에 영향을 받지 않고 현시점의 상태에만 의존하는 이산 시간형 확률과정인 마코프 연쇄(Markov Chain)가 된다. 본 논문에서는 사용법 연쇄를 분석하여 상태 전이도의 상태와 원호가 어떤 범위에서 시험될 것인지 결정되었을 때, 사용법 연쇄의 전이 확률이 높은 순서별로 연결하여 시험 사례를 생성하는 방안을 제시하고, 예제를 설명한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.11 no.3
• /
• pp.179-196
• /
• 1986

In this paper, the peformance of a statistical packet voice/data multiplexer is studied. In ths study we assume that in the packet voice/data multiplexer two separate finite queues are used for voice and data traffics, and that voice traffic gets priority over data. For the performance analysis we divide the output link of the multiplexer into a sequence of time slots. The voice signal is modeled as an (M+1) - state Markov process, M being the packet generation period in slots. As for the data traffic, it is modeled by a simple Poisson process. In our discrete time domain analysis, the queueing behavior of voice traffic is little affected by the data traffic since voice signal has priority over data. Therefore, we first analyze the queueing behavior of voice traffic, and then using the result, we study the queueing behavior of data traffic. For the packet voice multiplexer, both inpur state and voice buffer occupancy are formulated by a two-dimensional Markov chain. For the integrated voice/data multiplexer we use a three-dimensional Markov chain that represents the input voice state and the buffer occupancies of voice and data. With these models, the numerical results for the performance have been obtained by the Gauss-Seidel iteration method. The analytical results have been verified by computer simylation. From the results we have found that there exist tradeoffs among the number of voice users, output link capacity, voic queue size and overflow probability for the voice traffic, and also exist tradeoffs among traffic load, data queue size and oveflow probability for the data traffic. Also, there exists a tradeoff between the performance of voice and data traffics for given inpur traffics and link capacity. In addition, it has been found that the average queueing delay of data traffic is longer than the maximum buffer size, when the gain of time assignment speech interpolation(TASI) is more than two and the number of voice users is small.

• Journal of Korea Water Resources Association
• /
• v.46 no.10
• /
• pp.1029-1040
• /
• 2013

This study aims to develop a multivariate daily rainfall simulation model considering spatial coherence across watershed. The existing Hidden Markov Model (HMM) has been mainly applied to single site case so that the spatial coherences are not properly addressed. In this regard, HMM coupled with Chow-Liu Tree (CLT) that is designed to consider inter-dependences across rainfall networks was proposed. The proposed approach is applied to Han-River watershed where long-term and reliable hydrologic data is available, and a rigorous validation is finally conducted to verify the model's capability. It was found that the proposed model showed better performance in terms of reproducing daily rainfall statistics as well as seasonal rainfall statistics. Also, correlation matrix across stations for observation and simulation was compared and examined. It was confirmed that the spatial coherence was well reproduced via CLT-HMM model.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.28 no.3
• /
• pp.229-239
• /
• 2015

In light of the significant increase in the quantities of goods transported and the development of the shipping industry, the frequency of usage of port structures has increased; yet, the government's budget for the shipping & port of SOC has been reduced. Port structures require systematically effective maintenance and management trends that address their growing frequency of usage. In order to construct a productive maintenance system, it is essential to develop deterioration models of port structures that consider various characteristics, such as location, type, use, constructed level, and state of maintenance. Processes for developing such deterioration models include examining factors that cause the structures to deteriorate, collecting data on deteriorating structures, and deciding methods of estimation. The techniques used for developing the deterioration models are multiple regression analysis and Markov chain theory. Multiple regression analysis can reflect changes over time and Markov chain theory can apply status changes based on a probabilistic method. Along with these processes, the deterioration models of open-type and gravity-type wharfs were suggested.

• 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 applied mathematics & informatics
• /
• v.30 no.1_2
• /
• pp.83-92
• /
• 2012

In this paper, a generalized Shannon-McMillan theorem for the nonhomogeneous Markov chains indexed by an infinite tree which has a uniformly bounded degree is discussed by constructing a nonnegative martingale and analytical methods. As corollaries, some Shannon-Mcmillan theorems for the nonhomogeneous Markov chains indexed by a homogeneous tree and the nonhomogeneous Markov chain are obtained. Some results which have been obtained are extended.

• International conference on construction engineering and project management
• /
• 2022.06a
• /
• pp.1043-1050
• /
• 2022

Markov chains and Monte Carlo Simulation were applied to account for the probabilistic nature of pavement deterioration over time using data collected in the field. The primary purpose of this study was to evaluate pavement network performance of Western Australia (WA) by applying the existing pavement management tools relevant to WA road construction networks. Two approaches were used to analyze the pavement networks: evaluating current pavement performance data to assess WA State Road networks and predicting the future states using past and current pavement data. The Markov chains process and Monte Carlo Simulation methods were used to predicting future conditions. The results indicated that Markov chains and Monte Carlo Simulation prediction models perform well compared to pavement performance data from the last four decades. The results also revealed the impact of design, traffic demand, and climate and construction standards on urban pavement performance. This study recommends an appropriate and effective pavement engineering management system for proper pavement design and analysis, preliminary planning, future pavement maintenance and rehabilitation, service life, and sustainable pavement construction functionality.

• The Korean Journal of Applied Statistics
• /
• v.30 no.1
• /
• pp.1-12
• /
• 2017

Many stochastic processes satisfy the Markov property exactly or at least approximately. An interested property in the Markov process is the first passage time. Since the sequential analysis by Wald, the approximation of the first passage time has been studied extensively. The Statistical computing technique due to the development of high-speed computers made it possible to calculate the values of the properties close to the true ones. This article introduces an exponentially weighted moving average (EWMA) control chart as an example of the Markov process, and studied how to calculate the average run length with problematic issues that should be cautioned for correct calculation. The results derived for approximation of the first passage time in this research can be applied to any of the Markov processes. Especially the approximation of the continuous time Markov process to the discrete time Markov chain is useful for the studies of the properties of the stochastic process and makes computational approaches easy.