• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.9
• /
• pp.4568-4584
• /
• 2016

Steganography based on text generation has become a hot research topic in recent years. However, current text-generation methods which generate texts of normal style have either semantic or syntactic flaws. Note that texts of special genre, such as poem, have much simpler language model, less grammar rules, and lower demand for naturalness. Motivated by this observation, in this paper, we propose a text steganography that utilizes Markov chain model to generate Ci-poetry, a classic Chinese poem style. Since all Ci poems have fixed tone patterns, the generation process is to select proper words based on a chosen tone pattern. Markov chain model can obtain a state transfer matrix which simulates the language model of Ci-poetry by learning from a given corpus. To begin with an initial word, we can hide secret message when we use the state transfer matrix to choose a next word, and iterating until the end of the whole Ci poem. Extensive experiments are conducted and both machine and human evaluation results show that our method can generate Ci-poetry with higher naturalness than former researches and achieve competitive embedding rate.

• International Journal of Quality Innovation
• /
• v.2 no.2
• /
• pp.136-144
• /
• 2001

The Markov Chain approach is used to develop an economic adjustment model of a process whose quality can be affected by a single special cause, resulting in changes of the process mean by incorrect adjustment of the process when it is operating according to its capability. The $\bar{X}$ control chart is thus used to signal the special cause. It is demonstrated that the expressions for the expected cycle time and the expected cycle cost are easier to obtain by the proposed approach than by adopting that in Collani, Saniga and Weigang (1994). Furthermore, this approach would be easily extended to derive the expected cycle cost and the expected cycle time for the case of multiple special causes or multiple control charts. A numerical example illustrates the proposed method and its application.

• The Korean Journal of Applied Statistics
• /
• v.25 no.5
• /
• pp.837-846
• /
• 2012

Monte Carlo methods have been used in exact inference for contingency tables for a long time; however, they suffer from ergodicity and the ability to achieve a desired proportion of valid tables. In this paper, we apply the stochastic approximation Monte Carlo(SAMC; Liang et al., 2007) algorithm, as an adaptive Markov chain Monte Carlo, to the exact test of mutual independence in a multiway contingency table. The performance of SAMC has been investigated on real datasets compared to with existing Markov chain Monte Carlo methods. The numerical results are in favor of the new method in terms of the quality of estimates.

• Communications for Statistical Applications and Methods
• /
• v.27 no.5
• /
• pp.569-578
• /
• 2020

Various graph clustering methods have been introduced to identify communities in social or biological networks. This paper studies the entropy-based and the Markov chain-based methods in clustering the undirected graph. We examine the performance of two clustering methods with conventional methods based on quality measures of clustering. For the real applications, we collect the mathematical subject classification (MSC) codes of research papers from published mathematical databases and construct the weighted code-to-document matrix for applying graph clustering methods. We pursue to group MSC codes into the same cluster if the corresponding MSC codes appear in many papers simultaneously. We compare the MSC clustering results based on the several assessment measures and conclude that the Markov chain-based method is suitable for clustering the MSC codes.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2015.05a
• /
• pp.488-488
• /
• 2015

Intermittent streamflow is common phenomenon in arid and semi-arid regions. To manage water resources of intermittent streamflows, stochactic simulation data is essential; however the seasonally stochastic modeling for intermittent streamflow is a difficult task. In this study, using the periodic Markov chain model, we simulate intermittent monthly streamflow for occurrence and the periodic gamma autoregressive and copula models for amount. The copula models were tested in a previous study for the simulation of yearly streamflow, resulting in successful replication of the key and operational statistics of historical data; however, the copula models have never been tested on a monthly time scale. The intermittent models were applied to the Colorado River system in the present study. A few drawbacks of the PGAR model were identified, such as significant underestimation of minimum values on an aggregated yearly time scale and restrictions of the parameter boundaries. Conversely, the copula models do not present such drawbacks but show feasible reproduction of key and operational statistics. We concluded that the periodic Markov chain based the copula models is a practicable method to simulate intermittent monthly streamflow time series.

• The Korean Journal of Applied Statistics
• /
• v.34 no.1
• /
• pp.9-23
• /
• 2021

In the following paper we introduce a variational Bayes method that approximates posterior distributions with mean-field method. In particular, we introduce automatic differentiation variation inference (ADVI), which approximates joint posterior distributions using the product of Gaussian distributions after transforming parameters into real coordinate space, and then apply it to pharmacokinetic models that are models for the study of the time course of drug absorption, distribution, metabolism and excretion. We analyze real data sets using ADVI and compare the results with those based on Markov chain Monte Carlo. We implement the algorithms using Stan.

• Journal of IKEEE
• /
• v.23 no.4
• /
• pp.1430-1439
• /
• 2019

In Functional Mockup Interface(FMI)-based co-simulation, a bisectional algorithm can be used to find the zerocrossing point as a way to improve the accuracy of the simulation results. In this paper, the proposed master algorithm(MA) analyzes the repeated interval graph and predicts the next interval by applying the Markov Chain to the step size. In the simulation, we propose an algorithm to minimize the rollback by storing the step size that changes according to the graph type as an array and applying it to the next prediction interval when the rollback occurs in the simulation. Simulation results show that the proposed algorithm reduces the simulation time by more than 20% compared to the existing algorithm.

• Journal of Korean Society on Water Environment
• /
• v.36 no.5
• /
• pp.353-363
• /
• 2020

Hydrologic models can be classified into two types: those for understanding physical processes and those for predicting hydrologic quantities. This study deals with how to use the model to predict today's stream flow based on the system's knowledge of yesterday's state and the model parameters. In this regard, for the model to generate accurate predictions, the uncertainty of the parameters and appropriate estimates of the state variables are required. In this study, a relatively simple hydrologic partitioning model is proposed that can explicitly implement the hydrologic partitioning process, and the posterior distribution of the parameters of the proposed model is estimated using the Markov chain Monte Carlo approach. Further, the application method of the ensemble Kalman filter is proposed for updating the normalized soil moisture, which is the state variable of the model, by linking the information on the posterior distribution of the parameters and by assimilating the observed steam flow data. The stochastically and recursively estimated stream flows using the data assimilation technique revealed better representation of the observed data than the stream flows predicted using the deterministic model. Therefore, the ensemble Kalman filter in conjunction with the Markov chain Monte Carlo approach could be a reliable and effective method for forecasting daily stream flow, and it could also be a suitable method for routinely updating and monitoring the watershed-averaged soil moisture.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.36 no.3
• /
• pp.203-211
• /
• 2023

A Markov chain Monte Carlo (MCMC) simulation is proposed for probabilistic full waveform inversion (FWI) in a layered half-space. Dynamic responses on the half-space surface are estimated using the thin-layer method when a harmonic vertical force is applied. Subsequently, a posterior probability distribution function and the corresponding objective function are formulated to minimize the difference between estimations and observed data as well as that of model parameters from prior information. Based on the gradient of the objective function, a proposal distribution and an acceptance probability for MCMC samples are proposed. The proposed MCMC simulation is applied to several layered half-space examples. It is demonstrated that the proposed MCMC simulation for probabilistic FWI can estimate probabilistic material properties such as the shear-wave velocities of a layered half-space.

• Proceedings of the Korean Statistical Society Conference
• /
• 2002.05a
• /
• pp.67-72
• /
• 2002

A Bayesian testing procedure is proposed for assessment of bioequivalence in both mean and variance which ensures population bioequivalence under normality assumption. We derive the joint posterior distribution of the means and variances in a standard 2 ${\times}$ 2 crossover experimental design and propose a Bayesian testing procedure for bioequivalence based on a Markov chain Monte Carlo methods. The proposed method is applied to a real data set.