The limit frequencies of the positions in the game of Monopoly are calculated on the basis of Markov chains. In order to make the process Markovian some minor modifications in the rules are necessary. A parameter is introduced so that by varying this parameter we can determine how distorted our mode is compared with the actual game. The convergence properties of Markov chains are so nice that i...

In this paper, absorbing Markov chain models are developed to determine the optimum process mean levels for both a single-stage and a serial two-stage production system in which items are inspected for conformity with their specification limits. When the value of the quality characteristic of an item falls below a lower limit, the item is scrapped. If it falls above an upper limit, the item is ...

Class learning is a teaching and activity involving both teachers students. Students in the class have different levels of intelligence, divided into three categories: lowest, average, most intelligent. Teachers usually pay less attention to intelligent Consider student who not enough remain school. However, if smart required repeat content he already comprehends, will become bored. Therefore, ...

The Hierarchical Dirichlet Process Hidden Markov Model (HDP-HMM) has been used widely as a natural Bayesian nonparametric extension of the classical for learning from sequential and time-series data. A sticky HDP-HMM proposed to strengthen self-persistence probability in HDP-HMM. However, entangles strength prior transition together, limiting its expressiveness. Here, we propose more general mo...