• 한국HCI학회:학술대회논문집
• /
• 2006.02a
• /
• pp.772-779
• /
• 2006

The new model proposed in this paper is the hidden Markov mesh model or the 2D HMM with the causality of top-down and left-right direction. With the addition of the causality constraint, two algorithms for the evaluation of a model and the maximum likelihood estimation of model parameters have been developed theoretically which are based on the forward-backward algorithm. It is a more natural extension of the 1D HMM than other 2D models. The proposed method will provide a useful way of modeling highly variable image patterns such as offline cursive characters.

• Journal of Information Processing Systems
• /
• v.7 no.4
• /
• pp.653-678
• /
• 2011

WiMAX is intended for fourth generation wireless mobile communications where a group of users are provided with a connection and a fixed length queue. In present literature traffic of such network is analyzed based on the generator matrix of the Markov Arrival Process (MAP). In this paper a simple analytical technique of the two dimensional Markov chain is used to obtain the trajectory of the congestion of the network as a function of a traffic parameter. Finally, a two state phase dependent arrival process is considered to evaluate probability states. The entire analysis is kept independent of modulation and coding schemes.

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

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.2
• /
• pp.664-682
• /
• 2012

To improve the accuracy and enhance the applicability of existing models, this paper proposes a generalized Markov chain model for IEEE 802.11 Distributed Coordination Function (DCF) under the widely adopted assumption of ideal transmission channel. The IEEE 802.11 DCF is modeled by a two dimensional Markov chain, which takes into account unsaturated traffic, backoff freezing, retry limits, the difference between maximum retransmission count and maximum backoff exponent, and limited buffer size based on the M/G/1/K queuing model. We show that existing models can be treated as special cases of the proposed generalized model. Furthermore, simulation results validate the accuracy of the proposed model.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.6
• /
• pp.1852-1860
• /
• 2000

Distinct from the Markov random field or pseudo 2D HMM models for image analysis, this paper proposes a new model of 2D hidden Markov mesh chain(HMMM) model which subsumes the definitions of and the assumptions underlying the conventional HMM. The proposed model is a new theoretical realization of 2D HMM with the causality of top-down and left-right progression and the complete lattice constraint. These two conditions enable an efficient mesh decoding for model estimation and a recursive maximum likelihood estimation of model parameters. Those algorithms are developed in theoretical perspective and, in particular, the training algorithm, it is proved, attains the optimal set of parameters.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.9
• /
• pp.3110-3125
• /
• 2014

Network coding improves TCP's performance in lossy wireless networks. However, the complex congestion window evolution of network coded TCP (TCP-NC) makes the analysis of end-to-end throughput challenging. This paper analyzes the evolutionary process of TCP-NC against lossy links. An analytic model is established by applying a two-dimensional Markov chain. With maximum window size, end-to-end erasure rate and redundancy parameter as input parameters, the analytic model can reflect window evolution and calculate end-to-end throughput of TCP-NC precisely. The key point of our model is that by the novel definition of the states of Markov chain, both the number of related states and the computation complexity are substantially reduced. Our work helps to understand the factors that affect TCP-NC's performance and lay the foundation of its optimization. Extensive simulations on NS2 show that the analytic model features fairly high accuracy.

• IE interfaces
• /
• v.16 no.spc
• /
• pp.21-27
• /
• 2003

Objective of this paper is to develop the user mobility model(UMM) which is used for the performance analysis of location update and paging algorithm and at the same time, consider the user mobility pattern(UMP) in zone-based cellular networks. User mobility pattern shows correlation in space and time. UMM should consider these correlations of UMP. K-dimensional Markov chain is presented as a UMM considering them where the states of Markov chain are defined as the current location area(LA) and the consecutive LAs visited in the path. Also, a new two dimensional Markov chain composed of current LA and time interval is presented. Simulation results show that the appropriate size of K in the former UMM is two and the latter UMM reflects the characteristic of UMP well and so is a good model for the analytic method to solve the performance of location update and paging algorithm.

• Journal of Communications and Networks
• /
• v.16 no.2
• /
• pp.217-226
• /
• 2014

In this research, we study the problem of opportunistic spectrum access (OSA) in a time-varying environment with fading channels, where the channel state is characterized by both channel quality and the occupancy of primary users (PUs). First, a finite-state Markov channel model is introduced to represent a fading channel. Second, by probing channel quality and exploring the activities of PUs jointly, a two-dimensional partially observable Markov decision process framework is proposed for OSA. In addition, a greedy strategy is designed, where a secondary user selects a channel that has the best-expected data transmission rate to maximize the instantaneous reward in the current slot. Compared with the optimal strategy that considers future reward, the greedy strategy brings low complexity and relatively ideal performance. Meanwhile, the spectrum sensing error that causes the collision between a PU and a secondary user (SU) is also discussed. Furthermore, we analyze the multiuser situation in which the proposed single-user strategy is adopted by every SU compared with the previous one. By observing the simulation results, the proposed strategy attains a larger throughput than the previous works under various parameter configurations.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.13 no.3
• /
• pp.164-170
• /
• 2013

Recent years have been higher demands for automatic speech recognition (ASR) systems that are able to operate robustly in an acoustically noisy environment. This paper proposes an improved product hidden markov model (HMM) used for bimodal speech recognition. A two-dimensional training model is built based on dependently trained audio-HMM and visual-HMM, reflecting the asynchronous characteristics of the audio and video streams. A weight coefficient is introduced to adjust the weight of the video and audio streams automatically according to differences in the noise environment. Experimental results show that compared with other bimodal speech recognition approaches, this approach obtains better speech recognition performance.

• Journal of Korean Institute of Industrial Engineers
• /
• v.21 no.3
• /
• pp.345-356
• /
• 1995

The aim of this paper is to analyze the batch service queueing model M/M(a, b ; ${\mu}_k/1$) under general bulk service rule with mean service rate ${\mu}_k$ for a batch of k units, where $a{\leq}k{\leq}b$. This queueing model consists of the two-dimensional state space so that it is characterized by two-dimensional state Markov process. The steady-state solution and performane measure of this process are derived by using Matrix Geometric method. Meanwhile, a new approach is suggested to calculate the two-dimensional traffic density R which is used to obtain the steady-state solution. In addition, to determine the optimal service initiation threshold a, a decision model of this queueing system is developed evaluating cost of service per batch and cost of waiting per customer. In a job order production system, the decision-making procedure presented in this paper can be applicable to determining when production should be started.