• Journal of Wind Energy
• /
• v.14 no.1
• /
• pp.37-43
• /
• 2023

In this study, synthetic time series wind data was generated numerically using a second-order Markov chain. One year of wind data in 2020 measured by the AWS on Wido Island was used to investigate the statistics for measured wind data. Both the transition probability matrix and the cumulative transition probability matrix for annual hourly mean wind speed were obtained through statistical analysis. Probability density distribution along the wind speed and autocorrelation according to time were compared with the first- and the second-order Markov chains with various lengths of time series wind data. Probability density distributions for measured wind data and synthetic wind data using the first- and the second-order Markov chains were also compared to each other. For the case of the second-order Markov chain, some improvement of the autocorrelation was verified. It turns out that the autocorrelation converges to zero according to increasing the wind speed when the data size is sufficiently large. The generation of artificial wind data is expected to be useful as input data for virtual digital twin wind turbines.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.31 no.3B
• /
• pp.277-284
• /
• 2011

The limitations of existing Markov chain model for reproducing extreme rainfalls are a known problem, and the problems have increased the uncertainties in establishing water resources plans. Especially, it is very difficult to secure reliability of water resources structures because the design rainfall through the existing Markov chain model are significantly underestimated. In this regard, aims of this study were to develop a new daily rainfall simulation model which is able to reproduce both mean and high order moments such as variance and skewness using a piecewise Kernel-Pareto distribution. The proposed methods were applied to summer and fall season rainfall at three stations in Han river watershed in Korea. The proposed Kernel-Pareto distribution based Markov chain model has been shown to perform well at reproducing most of statistics such as mean, standard deviation and skewness while the existing Gamma distribution based Markov chain model generally fails to reproduce high order moments. It was also confirmed that the proposed model can more effectively reproduce low order moments such as mean and median as well as underlying distribution of daily rainfall series by modeling extreme rainfall separately.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2011.05a
• /
• pp.88-88
• /
• 2011

수자원에서 일강수량 모의기법은 다양한 목적으로 활용되고 있으며 기본적으로 수공구조물 설계 및 수자원계획을 수립하기 위한 입력 자료로서 이용된다. 수자원계획은 장기적인 목적을 가지고 수행되는 것이 일반적이며 우리가 목표로 하는 장기간의 일강수량자료의 획득이 어렵기 때문에 단기간의 일강수량자료를 장기 모의하여 이용하게 된다. 일강수량을 모의하는데 있어서 강수계열의 단기간의 기억(memory)을 활용한 Markov Chain 모형이 가장 일반적이며, 기존 Markov Chain 모형을 통한 일강수량 모의에서 발생하는 가장 큰 문제점은 극치강수량을 재현하기 어렵다는 점이다. 이러한 문제점으로 인해 수자원 계획을 수립하는데 있어서 불확실성을 가중시키고 있다. 특히 일강수량 모의기법을 통해서 추정되는 빈도강수량의 과소추정으로 인해 수공구조물 설계 시에 신뢰성을 확보하는 데 문제점이 있다. 이러한 점에서 본 연구에서는 기존 Markov Chain 모형에서 일강수량에 평균적인 특성과 극치특성을 동시에 재현할 수 있도록 불연속 Kernel-Pareto Distribution 기반에 일강수량모의기법을 개발하였다. 한강유역의 3개 강수지점에 대해서 기존 Markov Chain 모형과 본 연구에서 제안한 방법을 적용한 결과 여름의 일강수량 모의 시 1차모멘트인 평균과 2-3차 모멘트 모두 효과적으로 재현하지 못하는 문제점이 나타났다. 그러나 본 연구에서 제안한 불연속 Kernel-Pareto 분포형 기반 Markov Chain 모형은 여름의 일강수량 모의 시 강수계열의 평균적인 특성뿐만 아니라 표준편차 및 왜곡도의 경우에도 관측치의 통계특성을 매우 효과적으로 재현하는 것으로 나타났다. 본 연구에서 제시한 방법론은 전체적으로 기존 Markov Chain 모형에 비해 극치강수량을 재현하는데 유리한 기법으로 판단되며, 또한 극치강수량을 일반강수량으로부터 분리하여 모의함으로서 평균 및 중간값 등 낮은 차수에 모멘트 등 일강수량에 전체적인 분포특성을 더욱 효과적으로 모의할 수 장점을 확인하였다.

• Asian Journal of Atmospheric Environment
• /
• v.10 no.2
• /
• pp.67-79
• /
• 2016

The forecasting of air pollution is an important and popular topic in environmental engineering. Due to health impacts caused by unacceptable particulate matter (PM) levels, it has become one of the greatest concerns in metropolitan cities like Karaj City in Iran. In this study, the concentration of $PM_{2.5}$ was predicted by applying a multilayer percepteron (MLP) neural network, a radial basis function (RBF) neural network and a Markov chain model. Two months of hourly data including temperature, NO, $NO_2$, $NO_x$, CO, $SO_2$ and $PM_{10}$ were used as inputs to the artificial neural networks. From 1,488 data, 1,300 of data was used to train the models and the rest of the data were applied to test the models. The results of using artificial neural networks indicated that the models performed well in predicting $PM_{2.5}$ concentrations. The application of a Markov chain described the probable occurrences of unhealthy hours. The MLP neural network with two hidden layers including 19 neurons in the first layer and 16 neurons in the second layer provided the best results. The coefficient of determination ($R^2$), Index of Agreement (IA) and Efficiency (E) between the observed and the predicted data using an MLP neural network were 0.92, 0.93 and 0.981, respectively. In the MLP neural network, the MBE was 0.0546 which indicates the adequacy of the model. In the RBF neural network, increasing the number of neurons to 1,488 caused the RMSE to decline from 7.88 to 0.00 and caused $R^2$ to reach 0.93. In the Markov chain model the absolute error was 0.014 which indicated an acceptable accuracy and precision. We concluded the probability of occurrence state duration and transition of $PM_{2.5}$ pollution is predictable using a Markov chain method.

• Journal of Applied Reliability
• /
• v.16 no.4
• /
• pp.313-322
• /
• 2016

Purpose: We introduce ways to employ Markov chain model to evaluate the effect of preventive maintenance process. While the preventive maintenance process decreases the failure rate of each subsystems, it increases the downtime of the system because the system can not work during the maintenance process. The goal of this paper is to introduce ways to analyze this trade-off. Methods: Markov chain models are employed. We derive the availability of the system consisting of N repairable subsystems by the methods under various maintenance policies. Results: To validate our methods, we apply our models to the real maintenance data reports of military truck. The error between the model and the data was about 1%. Conclusion: The models developed in this paper fit real data well. These techniques can be applied to calculate the availability under various preventive maintenance policies.

• Journal of applied mathematics & informatics
• /
• v.37 no.5_6
• /
• pp.469-480
• /
• 2019

A generalized tiling is defined as a generalization of the properties of tiling a region of ${\mathbb{Z}}^2$ with dominoes, and comprises tiling with rhombus and any other tilings that admits height functions which can be ordered into a distributive lattice. By using properties of the distributive lattice, we prove that the Markov chain consisting of moving from one height function to the next by a flip is fast mixing and the mixing time ${\tau}({\epsilon})$ is given by ${\tau}({\epsilon}){\leq}(kmn)^3(mn\;{\ln}\;k+{\ln}\;{\epsilon}^{-1})$, where mn is the area of the grid ${\Gamma}$ that is a k-regular polycell. This result generalizes the result of the authors (T-tetromino tiling Markov chain is fast mixing, Theor. Comp. Sci. (2018)) and improves on the mixing time obtained by using coupling arguments by N. Destainville and by M. Luby, D. Randall, A. Sinclair.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.8 no.3
• /
• pp.1-10
• /
• 2009

Bus delay time is occurred as the result of traffic condition and important factor to predict bus arrival time. In this paper, transition probability matrixes between bus stops are made by using Markov Chain and it is predicted bus delay time with them. As the results of study, it is confirmed a possibility of adapting the assumption which it has same bus transition probability between stops through paired-samples T-test and overcame the limitation of exiting studies in case there is no scheduled bus arrival time for each stops with using bus interval time. Therefore it will be possible to predict bus arrival time with Markov Chain.

• Communications for Statistical Applications and Methods
• /
• v.7 no.1
• /
• pp.211-224
• /
• 2000

The Bayes estimation of the proportion in successive occasions sampling with randomized response model is discussed by means of Acceptance Rejection sampling. Bayesian estimation of transition probabilities in two successive occasions is suggested via Markov Chain Monte Carlo algorithm and its applicability is represented in a numerical example.

• Structural Engineering and Mechanics
• /
• v.81 no.1
• /
• pp.103-115
• /
• 2022

The prediction error variances for frequencies are usually considered as unknown in the Bayesian system identification process. However, the error variances for mode shapes are taken as known to reduce the dimension of an identification problem. The present study attempts to explore the effectiveness of Bayesian approach of model parameters updating using Markov Chain Monte Carlo (MCMC) technique considering the prediction error variances for both the frequencies and mode shapes. To remove the ergodicity of Markov Chain, the posterior distribution is obtained by Gaussian Random walk over the proposal distribution. The prior distributions of prediction error variances of modal evidences are implemented through inverse gamma distribution to assess the effectiveness of estimation of posterior values of model parameters. The issue of incomplete data that makes the problem ill-conditioned and the associated singularity problem is prudently dealt in by adopting a regularization technique. The proposed approach is demonstrated numerically by considering an eight-storey frame model with both complete and incomplete modal data sets. Further, to study the effectiveness of the proposed approach, a comparative study with regard to accuracy and computational efficacy of the proposed approach is made with the Sequential Monte Carlo approach of model parameter updating.

• Journal of the Korean Statistical Society
• /
• v.32 no.4
• /
• pp.401-409
• /
• 2003

We consider a particle walking on the nonnegative integers and each unit of time it makes, given it is at site k, either a jump of size m distance units to the right with probability $p_{k}$ or it goes back (falls down) to its starting point 0, a retaining barrier, with probability $v_{k}\;=\;1\;-\;p_{k}$. This is a Markov chain on the integers $mZ^{+}$. We show that if $v_{k}$ has a nonzero limit, then the Markov chain is positive recurrent. However, if $v_{k}$ speeds to 0, then we may get transient Markov chain. A critical speeding rate to zero is identified to get transience, null recurrence, and positive recurrence. Another type of random walk on $Z^{+}$ is considered in which a particle moves m distance units to the right or 1 distance unit to left with probabilities $p_{k}\;and\;q_{k}\;=\;1\;-\;p_{k}$, respectively. A necessary condition to having a stationary distribution and positive recurrence is obtained.