• IE interfaces
• /
• v.15 no.1
• /
• pp.1-9
• /
• 2002

Tandem AGV system is obtained by partitioning all workstations into multiple zones assigning a single vehicle to each zone. In this paper, we propose an analytical model to design a tandem AGV system with multi-load AGVs. Using simulation, the performance of the proposed model is shown by comparing a conventional multi-load AGV system.

• Bulletin of the Korean Mathematical Society
• /
• v.43 no.2
• /
• pp.277-292
• /
• 2006

We consider a single-server queue with service time distribution of phase type where positive customers, negative customers and disasters arrive according to a Markovian arrival process with marked transitions (MMAP). We derive simple formulae for the stationary queue length distributions. The Laplace-Stieltjes transforms (LST's) of the sojourn time distributions under the combinations of removal policies and service disciplines are also obtained by using the absorption time distribution of a Markov chain.

• Proceedings of the Korean Information Science Society Conference
• /
• 2010.06a
• /
• pp.152-153
• /
• 2010

• Journal of the Korean Mathematical Society
• /
• v.54 no.1
• /
• pp.87-99
• /
• 2017

To indicate the statistical complexity of dynamical systems, we introduce the notions of higher order irregular set and higher order maximal Birkhoff average oscillation in this paper. We prove that, in the setting of topologically mixing Markov chain, the set consisting of those points having maximal k-order Birkhoff average oscillation for all positive integers k is as large as the whole space from the topological point of view. As applications, we discuss the corresponding results on a repeller.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10c
• /
• pp.112-114
• /
• 2001

본 논문에서는 온라인 게임과 같은 대규모 네트워크가상환경에서의 서버와 클라이언트간에 교환되는 정보의 대부분을 차지하는 공유객체의 이동에 대한 데드레커닝 알고리즘을 마코프 체인 (Markov Chain)을 이용하여 모델링하고 그것의 성능을 해석한다. 그리고 사용자측면에서는 거의 성능지하가 없으면서 전체적으로 네트워크부하를 줄여서 서버가 보다 많은 클라이언트를 처리해 굴 수 있도록 하기 위한 데드레커닝 문턱값의 제어기법들을 소개한다.

• Journal of the Korean Statistical Society
• /
• v.18 no.2
• /
• pp.135-148
• /
• 1989

Cumulative sum schemes based on a weighted score are considered for controlling the mean of a continuous production process; in which both the one-sided and two-sided schemes are proposed. The average run lengths and the run length distributions for the proposed schemes are obtained by the Markov chain approach. Comparisons by the average run length show that the proposed schemes perform nearly as well as the standard cumulative sum schemes in detecting changes in the process mean. Comparisons of the one-sided schemes by the run length distribution are also presented.

• ETRI Journal
• /
• v.29 no.6
• /
• pp.829-831
• /
• 2007

This letter proposes an analytical model to characterize medium utilization in IEEE 802.11e operating in HCCA-EDCA mixed mode (HEMM). In contrast to existing works which model the backoff process in individual stations, we consider the channel occupancy pattern. Additionally, our work considers the operation of HEMM, which is not widely documented. We show that the proposed model accurately characterizes medium utilization with no more than 5% error.

• Journal of the Korean Data and Information Science Society
• /
• v.21 no.4
• /
• pp.819-829
• /
• 2010

Properties of multivariate variable sampling interval (VSI) Shewhart and CUSUM charts for monitoring mean vector of related quality variables are investigated. To evaluate average time to signal (ATS) and average number of switches (ANSW) of the proposed charts, Markov chain approaches and simulations are applied. Performances of the proposed charts are also investigated both when the process is in-control and when it is out-of-control.

• Journal of the Korean Data and Information Science Society
• /
• v.14 no.3
• /
• pp.441-450
• /
• 2003

Collaborative filtering is one of the most widely used methodologies for recommendation system. Collaborative filtering is based on a data matrix of each customer's preferences and frequently, there exits missing data problem. We introduced two imputation approach (multiple imputation via Markov Chain Monte Carlo method and multiple imputation via bootstrap method) to improve the prediction performance of collaborative filtering and evaluated the performance using EachMovie data.

• Journal of applied mathematics & informatics
• /
• v.5 no.2
• /
• pp.403-426
• /
• 1998

We present an algorithm to find an approximation for the stationary distribution for the general ergodic spatially-inhomogeneous block-partitioned upper Hessenberg form. Our approximation makes use of an associated upper block-Hessenberg matrix which is spa-tially homogeneous except for a finite number of blocks. We treat the MAP/G/1 retrial queue and the retrial queue with two types of customer as specific instances and give some numerical examples. The numerical results suggest that our method is superior to the ordinary finite-truncation method.