• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.11 no.3
• /
• pp.179-196
• /
• 1986

In this paper, the peformance of a statistical packet voice/data multiplexer is studied. In ths study we assume that in the packet voice/data multiplexer two separate finite queues are used for voice and data traffics, and that voice traffic gets priority over data. For the performance analysis we divide the output link of the multiplexer into a sequence of time slots. The voice signal is modeled as an (M+1) - state Markov process, M being the packet generation period in slots. As for the data traffic, it is modeled by a simple Poisson process. In our discrete time domain analysis, the queueing behavior of voice traffic is little affected by the data traffic since voice signal has priority over data. Therefore, we first analyze the queueing behavior of voice traffic, and then using the result, we study the queueing behavior of data traffic. For the packet voice multiplexer, both inpur state and voice buffer occupancy are formulated by a two-dimensional Markov chain. For the integrated voice/data multiplexer we use a three-dimensional Markov chain that represents the input voice state and the buffer occupancies of voice and data. With these models, the numerical results for the performance have been obtained by the Gauss-Seidel iteration method. The analytical results have been verified by computer simylation. From the results we have found that there exist tradeoffs among the number of voice users, output link capacity, voic queue size and overflow probability for the voice traffic, and also exist tradeoffs among traffic load, data queue size and oveflow probability for the data traffic. Also, there exists a tradeoff between the performance of voice and data traffics for given inpur traffics and link capacity. In addition, it has been found that the average queueing delay of data traffic is longer than the maximum buffer size, when the gain of time assignment speech interpolation(TASI) is more than two and the number of voice users is small.

• East Asian mathematical journal
• /
• v.36 no.3
• /
• pp.337-347
• /
• 2020

Let R be a ring with unity, and let I be an ideal of R. Then R is called I-semiregular if for every a ∈ R there exists b ∈ R such that ab is an idempotent of R and a - aba ∈ I. In this paper, basic properties of I-semiregularity are investigated, and some equivalent conditions to the primitivity of e are observed for an idempotent e of an I-semiregular ring R such that I∩eR = (0). For an abelian regular ring R with the ascending chain condition on annihilators of idempotents of R, it is shown that R is isomorphic to a direct product of a finite number of division rings, as a consequence of the observations.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2016.07a
• /
• pp.319-320
• /
• 2016

본 논문에서는 게임 개발에 있어서 빈번하게 적용되고 있는 식물 생태계와 이와 연동하는 동물 생태계를 자동화 하는 기법을 연구하고, 이를 실제로 구현하는 것을 목적으로 한다. 정해진 몇 가지 변수에 의해 자동 생성된 식물 생태계와 추가적인 FSM을 기반으로 생성되는 동물 생태계의 자동 생성 로직을 설계하고 이를 구현함으로써 기존의 게임 개발 과정에 효율성을 증대시키고, 최근 들어 터레인의 동적인 구성이나 유저와의 다양한 상호작용으로 인하여 빈번하게 요구되고 있는 자동화된 생태계 생성 기능을 구현하여 게임의 다양성이 기여하고자 한다. 본 논문에서 연구된 연구 결과는 추후에 일반적인 온라인 게임의 배경 자동 생성 시스템으로 확장되어 보다 다양한 적용이 가능할 것이다.

• Journal of Korean Institute of Industrial Engineers
• /
• v.42 no.1
• /
• pp.30-37
• /
• 2016

A multi-server queueing system with an infinite buffer and impatient customers is analyzed. The system operates in the finite state Markovian random environment. The number of available servers, the parameters of the batch Markovian arrival process, the rate of customers' service, and the impatience intensity depend on the current state of the random environment and immediately change their values at the moments of jumps of the random environment. Dynamics of the system is described by the multi-dimensional asymptotically quasi-Toeplitz Markov chain. The ergodicity condition is derived. The main performance measures of the system are calculated. Numerical results are presented.

• Journal of Biomedical Engineering Research
• /
• v.2 no.2
• /
• pp.145-150
• /
• 1981

In this paper, we measured the tracking response time of horizontal eye movement to the target moving according to the square waveform to investigate the predictive characteristics of the human oculomotor system. And in the experiment we used the square waves with an amplitude of 5 degree and frequencies o.1, 0.2, 0.4, 0.6, 0.8, 1.0, and 1.2 Hz. Random occurrences of the human eye movement reponse time were analyzed using a finite Markov chain process and we found the results as follows. From both the experimental and theoretical results, we found the trend showing that Predictive characteristics moved from the transient state to the steady state.

• Bulletin of the Korean Mathematical Society
• /
• v.52 no.2
• /
• pp.549-556
• /
• 2015

In this paper, we characterize w-Noetherian modules in terms of polynomial modules and w-Nagata modules. Then it is shown that for a finite type w-module M, every w-epimorphism of M onto itself is an isomorphism. We also define and study the concepts of w-Artinian modules and w-simple modules. By using these concepts, it is shown that for a w-Artinian module M, every w-monomorphism of M onto itself is an isomorphism and that for a w-simple module M, $End_RM$ is a division ring.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1995.09a
• /
• pp.99-107
• /
• 1995

The Phase-type(PH) distribution, defined as a distribution of the time until the absorption in a finite continuous-time Markov chain state with one absorbing state, has been widely used for various stochastic modelling. But great computational burdens often make us hesitate to apply PH methods. In this paper, we propose a seemingly efficient approximation method for phase type distributions. We first describe methods to bound the first passage time distribution in continuous-time Markov chains. Next, we adapt these bounding methods to approximate phase-tupe distributions. Numerical computation results are given to verify their efficiency.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.39 no.3
• /
• pp.1-5
• /
• 2014

We study the paper Zhernovyi and Zhernovyi [Zhernovyi, K.Y. and Y.V. Zhernovyi, "An $M^{\Theta}/G/1/m$ system with two-threshold hysteresis strategy of service intensity switching," Journal of Communications and Electronics, Vol.12, No.2(2012), pp.127-140]. In the paper, authors used the Korolyuk potential method to obtain the stationary queue length distribution. Instead, our note makes an attempt to apply the most frequently used methods : the embedded Markov chain and the supplementary variable method. We derive the queue length distribution at a customer's departure epoch and then at an arbitrary epoch.

• Bulletin of the Korean Mathematical Society
• /
• v.55 no.1
• /
• pp.115-137
• /
• 2018

Let $R_{u{^2},v^2,w^2,p}$ be a finite non chain ring ${\mathbb{F}}_p[u,v,w]{\langle}u^2,\;v^2,\;w^2,\;uv-vu,\;vw-wv,\;uw-wu{\rangle}$, where p is a prime number. This ring is a part of family of Frobenius rings. In this paper, we explore the structures of cyclic codes over the ring $R_{u{^2},v^2,w^2,p}$ of arbitrary length. We obtain a unique set of generators for these codes and also characterize free cyclic codes. We show that Gray images of cyclic codes are 8-quasicyclic binary linear codes of length 8n over ${\mathbb{F}}_p$. We also determine the rank and the Hamming distance for these codes. At last, we have given some examples.

• Journal of Electrical Engineering and information Science
• /
• v.3 no.1
• /
• pp.21-27
• /
• 1998

In this paper we apply routing algorithms in circuit switched networks to B-ISDN networks and investigate the performance. B-ISDN supports a wide range of services with hetrogeneous bandwidth requirements. We assume that the network supports D classes of traffic. It is modeled as a finite D dimensional Markov chain. A call is blocked on arrival if the required bandwidth is not available on the route. The shortest path routing, alternate routing and trunk reservation are considered for performance comparison. We also consider trunk reservation with restricted access control where the network reserves certain amount of bandwidths for one class of traffic that assumes a higher transmission priority. Through the method of successive iterations, we obtain the steady state equilibrium probabilities and call blocking probabilities for dynamic routing. The results can be used to design a B-ISDN network that improves network connection availability and efficiency while simultaneously reducing the network costs.