• 한국시뮬레이션학회논문지
• /
• 제19권3호
• /
• pp.109-117
• /
• 2010

본 연구에서는 3개의 단일서버 노드(기계 1, 기계 2, 조립기계)로 구성된 단순 조립형 대기행렬 망의 안정대기시간에 대해 분석한다. 하나의 재생도착과정을 가정하며, 각 기계의 서비스시간은 서로 독립이며 상수 또는 겹침이 없는 시간으로 가정한다. 기계 1과 기계 2는 무한크기의 버퍼를 가지며, 조립기계는 각 기계로부터의 이송되는 부품을 위해 2개의 유한버퍼를 가진다. 각 기계는 FIFO 규칙과 통신차단규칙에 따라 서비스를 제공한다. 단순 조립형 대기행렬 망의 안정대기시간에 대한 간결한 표현식을 (max,+)-대수를 활용하여 유한버퍼의 크기에 대한 함수의 형태로 도출하였다. 이러한 표현식으로부터 평균, 고차평균, 꼬리확률과 같은 다양한 성능 특성치들의 값을 구할 수 있다.

• 한국지능시스템학회논문지
• /
• 제2권3호
• /
• pp.17-21
• /
• 1992

In this paper we consider the notion of fuzzy relation as a generalization of that of fuzzy set. For a complete Heyting algebra L. the category set(L) of all L-fuzzy sets is shown to be a bireflective subcategory of the category Rel(L) of all L-fuzzy relations and L-fuzzy relation preserving maps. We investigate categorical structures of subcategories of Rel(L) in view of quasitopos. Among those categories, we include the category L-fuzzy similarity relations with respect to both max-min and max-product compositions, respectively, as a cartesian closed topological category. Moreover, we describe exponential objects explicitly in terms of function space.

• Kyungpook Mathematical Journal
• /
• 제56권4호
• /
• pp.1047-1067
• /
• 2016

In this paper, a new class of diagram algebras which are subalgebras of signed brauer algebras, called the Walled Signed Brauer algebras denoted by ${\overrightarrow{D}}_{r,s}(x)$, where $r,s{\in}{\mathbb{N}}$ and x is an indeterminate are introduced. A presentation of walled signed Brauer algebras in terms of generators and relations is given. The cellularity of a walled signed Brauer algebra is established. Finally, ${\overrightarrow{D}}_{r,s}(x)$, is quasi- hereditary if either the characteristic of a field, say p, p = 0 or p > max(r, s) and either $x {\neq}0$ or x = 0 and $r{\neq}s$.

• Management Science and Financial Engineering
• /
• 제14권1호
• /
• pp.23-34
• /
• 2008

In this study, we consider stationary waiting times in a Poisson driven single-server m-node queues in series. We assume that service times at nodes are independent, and are either deterministic or non-overlapped. Each node excluding the first node has a finite waiting line and every node is operated under a FIFO service discipline and a communication blocking policy (blocking before service). By applying (max, +)-algebra to a corresponding stochastic event graph, a special case of timed Petri nets, we derive the explicit expressions for stationary waiting times at all areas, which are functions of finite buffer capacities. These expressions allow us to compute the performance measures of interest such as mean, higher moments, or tail probability of waiting time. Moreover, as applications of these results, we introduce optimization problems which determine either the biggest arrival rate or the smallest buffer capacities satisfying probabilistic constraints on waiting times. These results can be also applied to bounds of waiting times in more general systems. Numerical examples are also provided.

• 한국경영과학회지
• /
• 제30권2호
• /
• pp.73-80
• /
• 2005

In this paper, we consider characteristics of waiting times in s1n91e-server 3-node tandem queues with finite buffers, a Poisson arrival process and deterministic service times at all nodes. There are three buffers : one at the first node is infinite and the others are finite. We obtain the fact that sojourn time or departure process is independent of the capacities of the finite buffers and does not depend on the order of service times, which are the same results in the literature. Moreover, the explicit expressions of stationary waiting times in all areas of the systems can be derived as functions of the finite buffer capacities. We also disclose a relationship of waiting times in subareas of the systems between two blocking policies communication and manufacturing. Some numerical examples are also provided.

• 한국경영과학회지
• /
• 제30권1호
• /
• pp.149-159
• /
• 2005

In this study, we consider characteristics of stationary waiting times in single-server 2-node tandem queues with a finite buffer, a Poisson arrival process and deterministic service times. The system has two buffers: one at the first node is infinite and the other one at the second node is finite. We show that the sojourn time or departure process does not depend on the capacity of the finite buffer and on the order of nodes (service times), which are the same as the previous results. Furthermore, the explicit expressions of waiting times at the first node are given as a function of the capacity of the finite buffer and we are able to disclose a relationship of waiting times between under communication blocking and under manufacturing blocking. Some numerical examples are also given.

• 한국시뮬레이션학회논문지
• /
• 제21권4호
• /
• pp.11-24
• /
• 2012

이 연구는 상수 공정 시간을 갖는 라인생산시스템에서 CONWIP과 DBR이 각각 max-plus 선형시스템의 특수형태임을 밝히고 max-plus 대수에 기반한 안정대기시간 연구결과를 이용하여 CONWIP와 DBR의 성능을 비교 분석하였다. CONWIP의 경우, 생산시스템 내의 체류시간은 DBR의 경우보다 항상 짧다는 사실이 수학적으로 규명되었고 예제를 통해 계산, 비교되었다. 한편 두 경우에서 모두, 애로공정이후 노드에서의 대기시간은 유한버퍼의 크기와 공정의 순서에 무관함을 확인하였다. CONWIP에서는 시스템 내 평균 대기시간 또는 체류시간이 공정의 순서에 무관하지만, DBR에서는 애로공정이 뒤로 갈수록 감소함을 확인하였다.

• 융합신호처리학회논문지
• /
• 제14권1호
• /
• pp.57-61
• /
• 2013

본 논문에서는 하이브리드 유전 알고리즘을 이용한 morphological 뉴럴 네트워크 (MNN)의 최적화 방법을 제안하였다. MNN은 max-plus 연산을 기반으로 하고 있으므로 경사 학습법에 의한 파라미터 학습이 매우 어렵다. 이러한 문제를 해결하기 위해 하이브리드 유전 알고리즘을 이용하여 MNN의 파라미터들을 학습하였다. 제안된 방법의 유용성을 보이기 위해 SIDBA(standard image database) 표준영상에서 추출된 테스트 영상을 이용한 영상 압축/복원 실험을 수행하였고, 그 결과 제안된 방법에 의한 복원 영상이 합-곱 연산에 기반한 기존의 뉴럴 네트워크에 의한 복원영상보다 우수함을 알 수 있었다.

• ETRI Journal
• /
• 제31권1호
• /
• pp.86-88
• /
• 2009

In this letter, we consider an m-node tandem queue (queues in series) with a Poisson arrival process and either deterministic or non-overlapping service times. With the assumption that each node has a finite buffer except for the first node, we show the non-increasing convex property of stationary waiting time with respect to the finite buffer capacities. We apply it to an optimization problem which determines the smallest buffer capacities subject to probabilistic constraints on stationary waiting times.

• ETRI Journal
• /
• 제36권4호
• /
• pp.609-616
• /
• 2014

Even though many computational methods (recursive formulae) for blocking probabilities in finite-capacity M/D/1 queues have already been produced, these are forms of transforms or are limited to single-node queues. Using a distinctly different approach from the usual queueing theory, this study introduces explicit (transform-free) formulae for a blocking probability, a stationary probability, and mean sojourn time under either production or communication blocking policy. Additionally, the smallest buffer capacity subject to a given blocking probability can be determined numerically from these formulae. With proper selection of the overall offered load ${\rho}$, the approach described herein can be applicable to more general queues from a computational point of view if the explicit expressions of random vector $D_n$ are available.