• Journal of Korean Society for Quality Management
• /
• v.28 no.4
• /
• pp.99-105
• /
• 2000

This paper attempts to apply Markove chain theory to literary works. the objective of this paper is to show the trend of authors and his works by way of Markovian Models. In this introductory research, it is useful to make simple criteria as virtue and evil, good and bad, justice and injustice, positive and negative, man and woman, etc. Markovian transition matrixes which are derived by M.L.E. and A.U.E are almost same. In case of Hamlet, we are able to know the author of Hamlet or his works are inconsistent and fickle.

• Communications of the Korean Mathematical Society
• /
• v.7 no.2
• /
• pp.313-324
• /
• 1992

• The Korean Journal of Applied Statistics
• /
• v.21 no.6
• /
• pp.997-1006
• /
• 2008

This paper proposes a new model by combining an infinite-server queueing model for multi-task processing software system with a perfect debugging model based on Markov process with two types of faults suggested by Lee et al. (2001). We apply this model for module and integration testing in the testing process. Also, we compute several measure, such as the expected number of tasks whose processes can be completed and the task completion probability are investigated under the proposed model.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.42 no.1
• /
• pp.19-28
• /
• 2017

Moments of stationary intervals and those of the counting process can be used for moment fittings of the point processes. As for the Markovian arrival processes, the moments of stationary intervals are given as a polynomial function of parameters whereas the moments of the counting process involve exponential terms. Therefore, moment fittings are more complicated with the counting process than with stationary intervals. However, in queueing network analysis, cross-correlation between point processes can be modeled more conveniently with counting processes than with stationary intervals. A Laplace-Stieltjies transform of the stationary intervals of MAP (3)s is recently proposed in minimal number of parameters. We extend the results and present the Laplace transform of the counting process of MAP (3)s. We also show how moments of the counting process such as index of dispersions for counts, IDC, and limiting IDC can be used for moment fittings. Examples of exact MAP (3) moment fittings are also presented on the basis of moments of stationary intervals and those of the counting process.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.05a
• /
• pp.321-324
• /
• 2003

This paper discusses a robust stochastic stabilization of uncertain Takagi-Sugeno (T-S) fuzzy system with Markovian input delay. The finite Markovian process is adopted to model the input delay of the overall control system. It is assumed that the zero and hold devices are used for control input. The continuous-time T-S fuzzy system with the Markovian input delay is discretized for easy handling delay, accordingly, the discretixzd T-S fuzzy system is represented by a uncertain discrete-time T-S fuzy system with jumping parameters. The robust stochastic stabilizibility of the uncertain jump T-S fuzzy system is derived and formulated in terms of linear matrix inequalities (LMIs).

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.10
• /
• pp.16-23
• /
• 2003

In this paper, we propose a new optical hybrid switching system that takes advantage of both Optical Burst Switching (OBS) and Optical Circuit Switching (OCS) technologies. This system classifies incoming IP traffic flows into short-lived and long-lived flows for hybrid switching. For performance analysis, we model the system as a single server queue in a Markovian environment. The burst generation process is assumed to follow a two-state Markov Modulated Poisson Process (MMPP), and the service rate fluctuates based on the number of concurrent OCS sessions. Results of the mean delay and queue size for OBS bursts are derived.

• Proceedings of the Korean Statistical Society Conference
• /
• 2000.11a
• /
• pp.57-64
• /
• 2000

In this paper we consider a Markovian perfect debugging model for which the software failure is caused by two types of faults, one which is easily detected and the other which is difficult to detect. When a failure occurs, a perfect debugging is immediately performed and consequently one fault is reduced from fault contents. We also treat the debugging time as a variable to develop a new debugging model. Several measures, including the distribution of first passage time to the specified number of removed faults, are also obtained using the proposed debugging model, Numerical examples are provided for illustrative purposes.

• Proceedings of the Korean Society for Quality Management Conference
• /
• 2004.04a
• /
• pp.499-502
• /
• 2004

Multi-server Markovian retrial model with heterogeneous servers is analyzed. Arriving customers constitute the MMAP(Marked Markovian Arrival Process). Distribution of the primary customers among the servers is performed randomly depending on the type of a customer and the number of the server. Customers from the orbit have the exponential service time distribution with a parameter depending on the server only. The choice of the server for a retrial is made randomly as well. Multidimensional continuous time Markov chain describing operation of the model is investigated by means of reducing to asymptotically quasi-toeplitz Markov chaius.

• Proceedings of the Korean Statistical Society Conference
• /
• 2002.11a
• /
• pp.115-117
• /
• 2002

In this paper, we obtain an explicit formula of the Laplace transform of the forward recurrence time at finite time t > 0 in an alternating renewal process, by adopting a Markovian approach. As a consequence, we obtain the first two moments of the forward recurrence time.

• International Journal of Reliability and Applications
• /
• v.3 no.4
• /
• pp.199-202
• /
• 2002

In this paper, we obtain an explicit formula of the Laplace transform of the forward recurrence time at finite time t > 0 in an alternating renewal process, by adopting a Markovian approach. As a consequence, we obtain the first two moments of the forward recurrence time.