• Journal of Institute of Control, Robotics and Systems
• /
• v.20 no.11
• /
• pp.1131-1135
• /
• 2014

This paper proposes the enhanced faulty node detection scheme with hybrid algorithm using Markov-chain model on BCH (Bose-Chaudhuri-Hocquenghem) code in naval distributed control networked systems. The probabilistic model-driven approach, on Markov-chain model, in this paper uses the faulty weighting interval factors, which are based on the BCH code. In this scheme, the master node examines each slave-nodes continuously using three defined states : Good, Warning, Bad-state. These states change using the probabilistic calculation method. This method can improve the performance of detecting the faulty state node more efficiently. Simulation results show that the proposed method can improve the accuracy in faulty node detection scheme for real-time naval distributed control networked systems.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.5
• /
• pp.1013-1019
• /
• 2016

This paper describes a novel Context-awareness Markov Chain Prediction (CMCP) algorithm based on movement prediction using Markov chain in Delay Tolerant Network (DTN). The existing prediction models require additional information such as a node's schedule and delivery predictability. However, network reliability is lowered when additional information is unknown. To solve this problem, we propose a CMCP model based on node behaviour movement that can predict the mobility without requiring additional information such as a node's schedule or connectivity between nodes in periodic interval node behavior. The main contribution of this paper is the definition of approximate speed and direction for prediction scheme. The prediction of node movement forwarding path is made by manipulating the transition probability matrix based on Markov chain models including buffer availability and given interval time. We present simulation results indicating that such a scheme can be beneficial effects that increased the delivery ratio and decreased the transmission delay time of predicting movement path of the node in DTN.

• Journal of Korean Institute of Industrial Engineers
• /
• v.33 no.4
• /
• pp.402-409
• /
• 2007

Markov Chains has proven to be effective in predicting human behaviors in the areas of web site assess, multimedia educational system, and driving environment. In order to extend an application area of predicting human behaviors using Markov Chains, this study was conducted to investigate whether Markov Chains could be used to predict human behavior in selecting mobile phone menu item. Compared to the aforementioned application areas, this study has different aspects in using Markov Chains : m-order 1-step Markov Model and the concept of Power Law of Learning. The results showed that human behaviors in predicting mobile phone menu selection were well fitted into with m-order 1-step Markov Model and Power Law of Learning in allocating history path vector weights. In other words, prediction of mobile phone menu selection with Markov Chains was capable of user's actual menu selection.

• Journal of the Korean Statistical Society
• /
• v.35 no.4
• /
• pp.355-376
• /
• 2006

To identify whether the sequence of observations follows a chain dependent process and whether the chain dependent or repeated observations follow stationary process or not, alternative procedures are suggested in this paper. These test procedures are formulated on the basis of logistic regression model under the likelihood ratio test criterion and applied to the daily rainfall occurrence data of Bangladesh for selected stations. These test procedures indicate that the daily rainfall occurrences follow a chain dependent process, and the different types of transition probabilities and overall transition probabilities of Markov chain for the occurrences of rainfall follow a stationary process in the Mymensingh and Rajshahi areas, and non-stationary process in the Chittagong, Faridpur and Satkhira areas.

• Proceedings of the IEEK Conference
• /
• summer
• /
• pp.259-262
• /
• 2004

In most of the character recognition systems, the method of template matching or statistical method using hidden Markov model is used to extract and recognize feature shapes. In this paper, we used modified chain-code which has 8-directions but 4-codes, and made the chain-code of hand-written character, after that, converted it into transition chain-code by applying to HMM(Hidden Markov Model). The transition chain code by HMM is analyzed as signal flow graph by Mason's theory which is generally used to calculate forward gain at automatic control system. If the specific forward gain and feedback gain is properly set, the forward gain of transition chain-code using Mason's theory can be distinguished depending on each object for recognition. This data of the gain is reorganized as tree structure, hence making it possible to distinguish different hand-written characters. With this method, $91\%$ recognition rate was acquired.

• Journal of Wetlands Research
• /
• v.5 no.2
• /
• pp.1-13
• /
• 2003

In Korea, most of the rainfalls have been concentrated in the flood season and the flood study has received more attention than low flow analysis. One of the reasons that the analysis of low flows has less attention is the lacks of the required data like daily rainfall and so we have used the stochastic processes such as pulse noise, exponential distribution, and state model of Markov chain for the rainfall simulation in short term such as daily. Especially this study will pay attention to the state model of Markov chain. The previous study had performed the simulation study by the state model without considerations of the flood and non-flood periods and without consideration of the frequency of rainfall for the period of a state. Therefore this study considers afore mentioned two cases and compares the results with the known state model. As the results, the RMSEs of the suggested and known models represent the similar results. However, the PRE(relative percentage error) shows the suggested model is better results.

• Industrial Engineering and Management Systems
• /
• v.15 no.2
• /
• pp.131-142
• /
• 2016

We consider a multi-server queueing system without buffer and with two types of customers as a model of operation of a mobile network cell. Customers arrive at the system in the marked Markovian arrival flow. The service times of customers are exponentially distributed with parameters depending on the type of customer. A part of the available servers is reserved exclusively for service of first type customers. Customers who do not receive service upon arrival, can make repeated attempts. The system operation is influenced by random factors, leading to a change of the system parameters, including the total number of servers and the number of reserved servers. The behavior of the system is described by the multi-dimensional Markov chain. The generator of this Markov chain is constructed and the ergodicity condition is derived. Formulas for computation of the main performance measures of the system based on the stationary distribution of the Markov chain are derived. Numerical examples are presented.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.32 no.3
• /
• pp.99-109
• /
• 2009

Negative binomial yield model for semiconductor manufacturing consists of two parameters which are the average number of defects per die and the clustering parameter. Estimating the clustering parameter is quite complex because the parameter has not clear closed form. In this paper, a Bayesian approach using Markov Chain Monte Carlo is proposed to estimate the clustering parameter. To find an appropriate estimation method for the clustering parameter, two typical estimators, the method of moments estimator and the maximum likelihood estimator, and the proposed Bayesian estimator are compared with respect to the mean absolute deviation between the real yield and the estimated yield. Experimental results show that both the proposed Bayesian estimator and the maximum likelihood estimator have excellent performance and the choice of method depends on the purpose of use.

• The Mathematical Education
• /
• v.25 no.1
• /
• pp.1-8
• /
• 1986

It is a common saying that markov-chain is a special case of probability course. That is to say, It means an unchangeable markov-chain process of the transition-probability of discontinuous time. There are two kinds of ways to show transition probability parade matrix theory. The first is the way by arrangement of a rightangled tetragon. The second part is a vertical measurement and direction sing by transition-circle. In this essay, I try to find out existence of procession for transition-probability applied markov-chain. And it is possible for me to know not only, what it is basic on a study of chain but also being applied to abnormal problems following a flow change and statistic facts expecting to use as a model of air expansion in physics.

• 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.