• Journal of Biosystems Engineering
• /
• v.29 no.5 s.106
• /
• pp.441-450
• /
• 2004

This study was performed to estimate mid and long term demands of a tractor, a rice transplanter, a combine and a grain dryer by using logistic curve function and Markov chain model. Field survey was done to decide some parameters far logistic curve function and Markov chain model. Ceiling values of tractor and combine fer logistic curve function analysis were 209,280 and 85,607 respectively. Based on logistic curve function analysis, total number of tractors increased slightly during the period analysed. New demand for combine was found to be zero. Markov chain analysis was carried out with 2 scenarios. With the scenario 1(rice price $10\%$ down and current supporting policy by government), new demand for tractor was decreased gradually up to 700 unit in the year 2012. For combine, new demand was zero. Regardless of scenarios, the replacement demand was increased slightly after 2003. After then, the replacement demand is decreased after the certain time. Two analysis of logistic owe function and Markov chain model showed the similar trend in increase and decrease for total number of tractors and combines. However, the difference in numbers of tractors and combines between the results from 2 analysis got bigger as the time passed.

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

• Journal of applied mathematics & informatics
• /
• v.37 no.5_6
• /
• pp.469-480
• /
• 2019

A generalized tiling is defined as a generalization of the properties of tiling a region of ${\mathbb{Z}}^2$ with dominoes, and comprises tiling with rhombus and any other tilings that admits height functions which can be ordered into a distributive lattice. By using properties of the distributive lattice, we prove that the Markov chain consisting of moving from one height function to the next by a flip is fast mixing and the mixing time ${\tau}({\epsilon})$ is given by ${\tau}({\epsilon}){\leq}(kmn)^3(mn\;{\ln}\;k+{\ln}\;{\epsilon}^{-1})$, where mn is the area of the grid ${\Gamma}$ that is a k-regular polycell. This result generalizes the result of the authors (T-tetromino tiling Markov chain is fast mixing, Theor. Comp. Sci. (2018)) and improves on the mixing time obtained by using coupling arguments by N. Destainville and by M. Luby, D. Randall, A. Sinclair.

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

• Journal of the Korean Mathematical Society
• /
• v.60 no.3
• /
• pp.537-564
• /
• 2023

In this paper, we are mainly concerned with two-sided estimates for transition probabilities of symmetric Markov chains on ℤ^d, whose one-step transition probability is comparable to |x - y|^-dϕ_j (|x - y|)^-1 with ϕ_j being a positive regularly varying function on [1, ∞) with index α ∈ [2, ∞). For upper bounds, we directly apply the comparison idea and the Davies method, which considerably improves the existing arguments in the literature; while for lower bounds the relation with the corresponding continuous time symmetric Markov chains are fully used. In particular, our results answer one open question mentioned in the paper by Murugan and Saloff-Coste (2015).

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.6
• /
• pp.2450-2469
• /
• 2018

In this paper, we develop a spatiotemporal model to analysis of cellular user in underlay D2D communication by using stochastic geometry and queuing theory. Firstly, by exploring stochastic geometry to model the user locations, we derive the probability that the SINR of cellular user in a predefined interval, which constrains the corresponding transmission rate of cellular user. Secondly, in contrast to the previous studies with full traffic models, we employ queueing theory to evaluate the performance parameters of dynamic traffic model and formulate the cellular user transmission mechanism as a M/G/1 queuing model. In the derivation, Embedded Markov chain is introduced to depict the stationary distribution of cellular user queue status. Thirdly, the expressions of performance metrics in terms of mean queue length, mean throughput, mean delay and mean dropping probability are obtained, respectively. Simulation results show the validity and rationality of the theoretical analysis under different channel conditions.

• Journal of KIISE:Software and Applications
• /
• v.28 no.1
• /
• pp.46-51
• /
• 2001

2D로 확장한 HMM은 다수 제안되었지만 엄밀한 의미에 있어서 2D HMM이라고 하기에 부족한 점이 많다. 본 논문에서는 기존의 랜덤 필드 모형이 아닌 새로운 2D HMM을 제안한다. 상하 및 좌우 방향의 causal chain 관계를 가정하고 완전한 격자 형성 조건을 두어 2D HMM의 평가, 매개 변수를 추정하는 알고리즘을 제시하였다. 각각의 알고리즘은 동적 프로그래밍과 최우 추정법에 근거한 것이다. 변수 추정 알고리즘은 반복적으로 이루어지며 국소 최적치에 수렴함을 보였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.1
• /
• pp.186-205
• /
• 2019

Intercell interference coordination (ICIC) is considered as a promising technique to increase the spectral efficiency of OFDMA cellular systems. The soft frequency reuse (SFR) and fractional frequency reuse (FFR) are representative and efficient management techniques for ICIC. Herein, to enhance the performance of the SFR scheme, we propose a call admission (CAC) scheme. In this CAC scheme, called Spectrum handoff-SFR(S-SFR), the spectrum handoff technique is applied to the user equipment (UE) located near the cell center. We derive the traffic analysis model to describe the S-SFR. In addition, a two-dimensional (2-D) Markov chain and an outage analysis are used in our analytical model. From the traffic analysis, the significant performance measures are the outage probability, call blocking probability, system throughput and resource utilization. Based on those, the outage probability and system throughput are obtained using resource utilization as an interference pattern. The analytical results are verified with computer simulation results. Finally, we compare our proposed scheme with other ICI schemes.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.4
• /
• pp.35-42
• /
• 2008

Since Bianchi's 2-D Markov Chain Model considers collision problem only in ideal channel condition, it does not reflect real channel impaired by fading, interference, and noise. Distributed Coordination Function(DCF) doubles its contention window(CW) when transmission fails regardless of collision or transmission error. Increase of CW caused by transmission error degrade throughput and increase the delay. In this paper, we present quantitative analysis of the impact of the parameters such as contention window size(CW), transmission probability for a given time slot(${\Im}$), transmission failure probability($p_f$), on the system performance and provide a method how to decrease the initial CW to achieve equivalent performance.

• Journal of applied mathematics & informatics
• /
• v.31 no.1_2
• /
• pp.241-246
• /
• 2013

Choi [1] identified and characterized the limiting diffusion of this diploid model by defining discrete generator for the rescaled Markov chain. In this note, we define the operator of projection $S_t$ on limiting diffusion and new measure $dQ=S_tdP$. We show the martingale property on this operator and measure. Also we conclude that the martingale problem for diffusion operator of projection is well-posed.