منابع مشابه
Perfect Sampling of GI/GI/c Queues
We introduce the first class of perfect sampling algorithms for the steady-state distribution of multiserver queues with general interarrival time and service time distributions. Our algorithm is built on the classical dominated coupling from the past protocol. In particular, we use a coupled multi-server vacation system as the upper bound process and develop an algorithm to simulate the vacati...
متن کاملAnesthesia related Complications in Pediatric GI Endoscopy
Introduction: Elective upper and lower GI endoscopy is usually performed in children on an outpatient basis with the child under sedation or general anesthesia (GA). The objective of this study was to describe Anesthesia related complications in children undergoing elective GI endoscopy. Materials and Methods: The study design was descriptive on 1388 patients undergoing elective GI endoscop...
متن کاملVde Gi
The volumes of the left and right cardiac ventricles are important indexes for several cardiovascular diseases. In this paper, a semiautomatic algorithm based on 4D fuzzy connectedness is proposed for segmenting the cardiac ventricles in arbitrarily oriented cardiac cine MR images. The segmentation of the left ventricle was evaluated using 45 short axis images and a visual assessment of right v...
متن کاملGI Expertise
This article concerns the identification of the expertise that GI scientists have in common. Rather than attempt to be exhaustive, the approach is to identify a minimal set of expert topics shared across GI science. In this article, a set of five expert topics is proposed for this purpose: structure, uncertainty, dynamism, language and cognition, and design with geographic information. The arti...
متن کاملDynamic scheduling of a GI/GI/1+GI queue with multiple customer classes
We consider a dynamic control problem for a GI/GI/1 + GI queue with multiclass customers. The customer classes are distinguished by their interarrival time, service time, and abandonment time distributions. There is a cost ck > 0 for every class k ∈ {1,2, . . . ,N} customer that abandons the queue before receiving service. The objective is to minimize average cost by dynamically choosing which ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: rus & avhengighet
سال: 2005
ISSN: 0809-2834
DOI: 10.18261/issn0809-2834-2005-05-10