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

Experimental and theoretical results on chemical functionalization of graphene are reviewed. Using hydrogenated graphene as a model system, general principles of the chemical functionalization are formulated and discussed. It is shown that, as a rule, 100% coverage of graphene by complex functional groups (in contrast with hydrogen and fluorine) is unreachable. A possible destruction of graphene nanoribbons by fluorine is considered. The functionalization of infinite graphene and graphene nanoribbons by oxygen and by hydrofluoric acid is simulated step by step.

http://iopscience.iop.org/article/10.1088/0953-8984/21/34/344205/pdf

Chemical functionalization of graphene

There is disclosed a method, an apparatus, a server, a client and a non-transitory computer readable medium comprising a computer program stored therein for video coding and decoding. Depth pictures from a plurality of viewing angles are projected into a single viewing angle, making it possible to have pixel-wise joint filtering to be applied to all projected depth values. This approach enables to suppress the noise in the depth map data and provides improved performance for a view synthesis.

Apparatus, a method and a computer program for video coding and decoding

The present disclosure pertains to an image-processing device and method that make it possible to suppress block noise. A βLUT_input calculator and a clip processor determine βLUT_input, which is a value inputted to an existing-β generator and an expanded-β generator. When the value of βLUT_input qp from the clip processor is 51 or less, the existing-β generator determines β using a LUT conforming to the HVEC standard, and supplies same to a filter process determination unit. When the value of βLUT_input qp from the clip processor is larger than 51, the expanded-β generator determines the expanded β and supplies same to the filter process determination part. This disclosure, for example, can be applied to an image processing device.

Image processing device and method

A method of image coding wherein an image is divided into blocks having a plurality of pixels. A transform coding operation is performed on a block of pixels to produce a corresponding block of transform coefficient values, which is scanned to produce a scanned array of coefficient values represented by a plurality of number pairs having a first and a second number. The first and second numbers are assigned to one of a plurality of contexts (14) representative of the number pairs. The first number of a number pair is assigned to a context based on a first number of another number pair. Alternatively, the second number of a number pair is assigned to a context based on the first number of the number pair (16). Furthermore, a number indicative of the number of non-zero coefficient values in the block of transform coefficient values is determined and assigned to a context.

Method and system for context-based adaptive binary arithmetic coding

A decoder and method for using a new picture or frame type is provided. This type is referred to a an SP-picture. The temporal redundancies are not exploited in I-frames, compression efficiency of I-frame coding is significantly lower than the predictive coding. A method allows use of motion compensated predictive coding to exploit temporal redundancy in the sequence while still allowing perfect reconstruction of the frame using different reference frames. Methods using this new picture type provide for error resilience/recovery, bandwidth scalability, bitstream switching, processing scalability, random access and other functions. The SP-type picture provides for, among other functions, switching between different bitstreams, random access, fast forward and fast error-recovery by replacing I-pictures to increase the coding efficiency. As will be demonstrated, SP-pictures have the property that identical SP-frames may be obtained even when they are predicted using different reference frames.

Video decoder architecture and method for using same

The invention relates to a method for transmitting video information, in which at least a first bit-stream (510) and a second bit-stream are formed. The first bit-stream (510) comprises at least one video frame, and the second bit-stream (520) comprises at least one predictive video frame (524). At least partly different encoding parameters are used with encoding of the frames of said first bit-stream (510) and said second bit-stream (520). At least one frame of said first bit-stream (510) is being transmitted, and the transmission is switched over from said first (510) to said second bit-stream (520). In switching the transmission over from said first (510) to said second bit-stream (520), a secondary switching frame (550) is transmitted, which have been encoded using the encoding parameters of the second bit-stream (520) and at least one reference frame from the first bit-stream (510). Said secondary switching frame (550) is used as a reference frame in the reconstruction of said at least one predictive video frame (524) of the second set of video frames. The invention also relates to an encoder for encoding video information, a decoder for decoding a video information, and a signal representing encoded video information.

Switching between bit-streams in video transmission

The present invention relates to a method for transmitting video information, in which a bitstream is formed comprising a set of frames comprising macroblocks. At least one switching frame is formed into the bitstream, macroblocks of the switching frame are arranged into a first and a second group of macroblocks, each macroblock of the first group of macroblocks are encoded by a first encoding method to provide a switching point for continuing the transmission of video information with another bitstream formed from the video information; and macroblocks of the second group of macroblocks are encoded by another encoding method. Errors in transmission of video information are reduced by forming at least one SP-encoded frame by predictively encoding the macroblocks; replacing part of the SP-encoded macroblocks with intra encoded blocks; and transmitting the encoded frame containing both predictively and intra encoded macroblocks instead of the SP-encoded frame.

Transmission of video information

We propose a model-based analytic approach for evaluating the overall efficacy of FEC coding combined with interleaving in combating packet losses in IP networks. In particular, by modeling the network path in terms of a single bottleneck node, described as a G/M/1/K queue, we develop a recursive procedure for the exact evaluation of the packet-loss statistics for general arrival processes, based on the framework originally introduced by Cidon et al., 1993. To include the effects of interleaving, we incorporate a discrete-time Markov chain (DTMC) into our analytic framework. We study both single-session and multiple-session scenarios, and provide a simple algorithm for the more complicated multiple-session scenario. We show that the unified approach provides an integrated framework for exploring the tradeoffs between the key coding parameters; specifically, interleaving depths, channel coding rates and block lengths. The approach facilitates the selection of optimal coding strategies for different multimedia applications with various user quality-of-service (QoS) requirements and system constraints. We also provide an information-theoretic bound on the performance achievable with FEC coding in IP networks.

Ragip Kurceren

Papers

Method and system for context-based adaptive binary arithmetic coding

Video decoder architecture and method for using same

Switching between bit-streams in video transmission

Transmission of video information

A model-based approach to evaluation of the efficacy of FEC coding in combating network packet losses