• 한국통신학회논문지
• /
• 제11권3호
• /
• pp.179-196
• /
• 1986

본 논문에서는 통계적 패킷 음성/데이터 다중화기의 성능을 연구하였다. 성능해석은 음성과 데이터가 서로 분리된 한정된 queue를 사용하고, 전송에 있어서 음성이 데이터보다 우선권을 갖는 것을 가정하고, 다중화기의 출력 link를 시간 slot단위로 나누고 음성은 (M+1)-state의 Markov Process로, 데이터는 Poisson process로 modeling 하여 수행하였다. 전송시 음성신호가 데이터 신호보다 우선권을 가지므로 음성의 queueing behavior는 data에 거의 영향을 받지 않는다. 다라서 본 연구에서는 음성의 queueing behavior를 먼저 해석한 다음 data의 queueing behavior를 해석하였다. 패킷 음성 다중화기의 성능 해석은 입력상태와 buffer의 점유를 2차원의 Markov chain을 가지고 formulation하였고, 집적된 음성/data의 다중화기는 data를 추가한 3차원 Markov chain으로 하였다. 이러한 model을 사용하여 Gauss-Seidel방법으로 결과를 얻고 simulation으로 입증하였다. 이들 결과로 부터 음성 가입자의 수, 출력 link용량, 음성의 queue크기, 음성의 overflow확률에서는 서로 trade-off가 있고 data에서도 비슷한 tradeoff가 있음을 알았다. 또한 입력 traffic량과 link의 용량에 따라서 음성과 데이타간의 성능에서 서로 tradeoff가 있고, TASI의 이득이 2이상이고 음성가입자의 수가 적을 경우 데이타의 평균 지연시간은 buffer의 최대길이 보다 길음을 알아내었다.

• East Asian mathematical journal
• /
• 제36권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.

• 한국컴퓨터정보학회:학술대회논문집
• /
• 한국컴퓨터정보학회 2016년도 제54차 하계학술대회논문집 24권2호
• /
• pp.319-320
• /
• 2016

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

• 대한산업공학회지
• /
• 제42권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.

• 대한의용생체공학회:의공학회지
• /
• 제2권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.

• 대한수학회보
• /
• 제52권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.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 1995년도 추계학술대회발표논문집; 서울대학교, 서울; 30 Sep. 1995
• /
• 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.

• 한국경영과학회지
• /
• 제39권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.

• 대한수학회보
• /
• 제55권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
• /
• 제3권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.