다중혈관 관상동맥 환자에서 y-문합을 이용하여 양쪽 내흉동맥만을 사용한 우회술의 조기 성적

The Theory of Matrices. By F R. Gantmacher. Two volumes, pp. 374 and 276. 1959. (Translated from the Russian by K. A. Hirsch; Chelsea Publishing Company, New York)

Praise for the Third Edition: "This is one of the best books available. Its excellent organizational structure allows quick reference to specific models and its clear presentation . . . solidifies the understanding of the concepts being presented."IIE Transactions on Operations EngineeringThoroughly revised and expanded to reflect the latest developments in the field, Fundamentals of Queueing Theory, Fourth Edition continues to present the basic statistical principles that are necessary to analyze the probabilistic nature of queues. Rather than presenting a narrow focus on the subject, this update illustrates the wide-reaching, fundamental concepts in queueing theory and its applications to diverse areas such as computer science, engineering, business, and operations research.This update takes a numerical approach to understanding and making probable estimations relating to queues, with a comprehensive outline of simple and more advanced queueing models. Newly featured topics of the Fourth Edition include:Retrial queuesApproximations for queueing networksNumerical inversion of transformsDetermining the appropriate number of servers to balance quality and cost of serviceEach chapter provides a self-contained presentation of key concepts and formulae, allowing readers to work with each section independently, while a summary table at the end of the book outlines the types of queues that have been discussed and their results. In addition, two new appendices have been added, discussing transforms and generating functions as well as the fundamentals of differential and difference equations. New examples are now included along with problems that incorporate QtsPlus software, which is freely available via the book's related Web site.With its accessible style and wealth of real-world examples, Fundamentals of Queueing Theory, Fourth Edition is an ideal book for courses on queueing theory at the upper-undergraduate and graduate levels. It is also a valuable resource for researchers and practitioners who analyze congestion in the fields of telecommunications, transportation, aviation, and management science.

Fundamentals of Queueing Theory

Zehavi (1992) showed that the performance of coded modulation over a Rayleigh fading channel can be improved by bit-wise interleaving the encoder output and by using an appropriate soft-decision metric as an input to a Viterbi decoder. The goal of this paper is to present in a comprehensive fashion the theory underlying bit-interleaved coded modulation, to provide tools for evaluating its performance, and to give guidelines for its design.

/pdf/bit-interleaved-coded-modulation-2ld6uk564f.pdf

Bit-Interleaved Coded Modulation

The principle of coding in the signal space follows directly from Shannon's analysis of waveform Gaussian channels subject to an input constraint. The early design of communication systems focused separately on modulation, namely signal design and detection, and error correcting codes, which deal with errors introduced at the demodulator of the underlying waveform channel. The correct perspective of signal-space coding, although never out of sight of information theorists, was brought back into the focus of coding theorists and system designers by Imai's and Ungerbock's pioneering works on coded modulation. More recently, powerful families of binary codes with a good tradeoff between performance and decoding complexity have been (re-)discovered. Bit-Interleaved Coded Modulation (BICM) is a pragmatic approach combining the best out of both worlds: it takes advantage of the signal-space coding perspective, whilst allowing for the use of powerful families of binary codes with virtually any modulation format. BICM avoids the need for the complicated and somewhat less flexible design typical of coded modulation. As a matter of fact, most of today's systems that achieve high spectral efficiency such as DSL, Wireless LANs, WiMax and evolutions thereof, as well as systems based on low spectral efficiency orthogonal modulation, feature BICM, making BICM the de-facto general coding technique for waveform channels.

The theoretical characterization of BICM is at the basis of efficient coding design techniques and also of improved BICM decoders, e.g., those based on the belief propagation iterative algorithm and approximations thereof. In this text, we review the theoretical foundations of BICM under the unified framework of error exponents for mismatched decoding. This framework allows an accurate analysis without any particular assumptions on the length of the interleaver or independence between the multiple bits in a symbol. We further consider the sensitivity of the BICM capacity with respect to the signal-to-noise ratio (SNR), and obtain a wideband regime (or low-SNR regime) characterization. We review efficient tools for the error probability analysis of BICM that go beyond the standard approach of considering infinite interleaving and take into consideration the dependency of the coded bit observations introduced by the modulation. We also present bounds that improve upon the union bound in the region beyond the cutoff rate, and are essential to characterize the performance of modern randomlike codes used in concatenation with BICM. Finally, we turn our attention to BICM with iterative decoding, we review extrinsic information transfer charts, the area theorem and code design via curve fitting. We conclude with an overview of some applications of BICM beyond the classical coherent Gaussian channel.

/pdf/bit-interleaved-coded-modulation-261whjb82t.pdf

Preface. 1: Independent Arrivals. 1.1 Discrete-Time Models and Applications. 1.2 Analysis of the GI-G-1 Model. 2: Scheduling Disciplines. 2.1 Single-Class Systems. 2.2 Multi-Class System. 2.3 Priority Disciplines. 2.4 Cyclic Services. 3: More Complicated Models. 3.1 Non-Independent Arrivals. 3.2 Server Interruptions. 4: Applications to ATM. 4.1 ATM Switching Elements and Networks. 4.2 ATM Multiplexer Models. Index.

Discrete-time models for communication systems including ATM

The paper considers a class of continuous ARQ strategies, whereby multiple copies of each data block are sent contiguously (instead of one single copy), and whereby the data blocks are delivered at the receiver side in their order of arrival at the transmitter. In order to achieve the best possible throughput efficiency-within this class-an optimum value for the number of copies to be sent is determined, in terms of the block error probability and the propagation delay. It turns out that, depending on these parameters, the optimum scheme is one of the two following alternatives: 1) sending each data block repeatedly until a positive acknowledgment is received for it; 2) sending each block a constant (optimum) number of times. A throughput comparison of the optimum scheme with other related ARQ strategies is given.

On the Throughput Performance of Some Continuous ARQ Strategies with Repeated Transmissions

Performance of discrete-time queueing systems

The author considers an asynchronous time-division-multiplexing system with a finite number of identical users generating data only during their so-called active periods, which alternate with so-called passive periods. Assuming geometric distributions for the active and passive periods of the users, the author derives a functional equation which describes the full steady-state buffer behavior of the multiplexer. The buffer occupancy at various moments can be derived from this equation and explicit functions of the parameters of the system. The results indicate a strong dependency of the mean buffer occupancy on the actual lengths of the active and passive periods of the users, even for a given mean user activity. >

Queueing behavior of statistical multiplexers with correlated inputs

https://biblio.ugent.be/publication/210378/file/548310.pdf

Herwig Bruneel

Papers

Discrete-time models for communication systems including ATM

On the Throughput Performance of Some Continuous ARQ Strategies with Repeated Transmissions

Performance of discrete-time queueing systems

Queueing behavior of statistical multiplexers with correlated inputs

Performance analysis of a single-server ATM queue with a priority scheduling