Author: A. F. HoradamPublisher: Springer
ISBN: 3540348573
Category : Mathematics
Languages : en
Pages : 219
Book Description
Introduction to Queueing Systems with Telecommunication Applications
Author: Laszlo LakatosPublisher: Springer Science & Business Media
ISBN: 1461453178
Category : Mathematics
Languages : en
Pages : 388
Book Description
The book is composed of two main parts: mathematical background and queueing systems with applications. The mathematical background is a self containing introduction to the stochastic processes of the later studies queueing systems. It starts with a quick introduction to probability theory and stochastic processes and continues with chapters on Markov chains and regenerative processes. More recent advances of queueing systems are based on phase type distributions, Markov arrival processes and quasy birth death processes, which are introduced in the last chapter of the first part. The second part is devoted to queueing models and their applications. After the introduction of the basic Markovian (from M/M/1 to M/M/1//N) and non-Markovian (M/G/1, G/M/1) queueing systems, a chapter presents the analysis of queues with phase type distributions, Markov arrival processes (from PH/M/1 to MAP/PH/1/K). The next chapter presents the classical queueing network results and the rest of this part is devoted to the application examples. There are queueing models for bandwidth charing with different traffic classes, slotted multiplexers, ATM switches, media access protocols like Aloha and IEEE 802.11b, priority systems and retrial systems. An appendix supplements the technical content with Laplace and z transformation rules, Bessel functions and a list of notations. The book contains examples and exercises throughout and could be used for graduate students in engineering, mathematics and sciences.
Author: Louis George AlexanderInformation Technologies and Mathematical Modelling. Queueing Theory and Applications
Author: Alexander DudinPublisher: Springer Nature
ISBN: 3030333884
Category : Computers
Languages : en
Pages : 338
Book Description
This book constitutes the proceedings of the 18th International Conference on Information Technologies and Mathematical Modelling, ITMM 2019, named after A.F. Terpugov, held in Saratov, Russia, in June 2019. The 25 full papers presented in this volume were carefully reviewed and selected from 72 submissions. The conference covers various aspects of information technologies, focusing on queueing theory, stochastic processes, Markov processes, renewal theory, network performance equation and network protocols.
Distributed Algorithms
Author: Nancy A. LynchPublisher: Elsevier
ISBN: 0080504701
Category : Computers
Languages : en
Pages : 899
Book Description
In Distributed Algorithms, Nancy Lynch provides a blueprint for designing, implementing, and analyzing distributed algorithms. She directs her book at a wide audience, including students, programmers, system designers, and researchers. Distributed Algorithms contains the most significant algorithms and impossibility results in the area, all in a simple automata-theoretic setting. The algorithms are proved correct, and their complexity is analyzed according to precisely defined complexity measures. The problems covered include resource allocation, communication, consensus among distributed processes, data consistency, deadlock detection, leader election, global snapshots, and many others. The material is organized according to the system model—first by the timing model and then by the interprocess communication mechanism. The material on system models is isolated in separate chapters for easy reference. The presentation is completely rigorous, yet is intuitive enough for immediate comprehension. This book familiarizes readers with important problems, algorithms, and impossibility results in the area: readers can then recognize the problems when they arise in practice, apply the algorithms to solve them, and use the impossibility results to determine whether problems are unsolvable. The book also provides readers with the basic mathematical tools for designing new algorithms and proving new impossibility results. In addition, it teaches readers how to reason carefully about distributed algorithms—to model them formally, devise precise specifications for their required behavior, prove their correctness, and evaluate their performance with realistic measures.
The Geometrization Conjecture
Author: John MorganPublisher: American Mathematical Soc.
ISBN: 0821852019
Category : Mathematics
Languages : en
Pages : 306
Book Description
This book gives a complete proof of the geometrization conjecture, which describes all compact 3-manifolds in terms of geometric pieces, i.e., 3-manifolds with locally homogeneous metrics of finite volume. The method is to understand the limits as time goes to infinity of Ricci flow with surgery. The first half of the book is devoted to showing that these limits divide naturally along incompressible tori into pieces on which the metric is converging smoothly to hyperbolic metrics and pieces that are locally more and more volume collapsed. The second half of the book is devoted to showing that the latter pieces are themselves geometric. This is established by showing that the Gromov-Hausdorff limits of sequences of more and more locally volume collapsed 3-manifolds are Alexandrov spaces of dimension at most 2 and then classifying these Alexandrov spaces. In the course of proving the geometrization conjecture, the authors provide an overview of the main results about Ricci flows with surgery on 3-dimensional manifolds, introducing the reader to this difficult material. The book also includes an elementary introduction to Gromov-Hausdorff limits and to the basics of the theory of Alexandrov spaces. In addition, a complete picture of the local structure of Alexandrov surfaces is developed. All of these important topics are of independent interest. Titles in this series are co-published with the Clay Mathematics Institute (Cambridge, MA).
Search Techniques in Intelligent Classification Systems
Author: Andrey V. SavchenkoPublisher: Springer
ISBN: 3319305158
Category : Mathematics
Languages : en
Pages : 92
Book Description
A unified methodology for categorizing various complex objects is presented in this book. Through probability theory, novel asymptotically minimax criteria suitable for practical applications in imaging and data analysis are examined including the special cases such as the Jensen-Shannon divergence and the probabilistic neural network. An optimal approximate nearest neighbor search algorithm, which allows faster classification of databases is featured. Rough set theory, sequential analysis and granular computing are used to improve performance of the hierarchical classifiers. Practical examples in face identification (including deep neural networks), isolated commands recognition in voice control system and classification of visemes captured by the Kinect depth camera are included. This approach creates fast and accurate search procedures by using exact probability densities of applied dissimilarity measures. This book can be used as a guide for independent study and as supplementary material for a technically oriented graduate course in intelligent systems and data mining. Students and researchers interested in the theoretical and practical aspects of intelligent classification systems will find answers to: - Why conventional implementation of the naive Bayesian approach does not work well in image classification? - How to deal with insufficient performance of hierarchical classification systems? - Is it possible to prevent an exhaustive search of the nearest neighbor in a database?
Fundamentals of Convolutional Coding
Author: Rolf JohannessonPublisher: John Wiley & Sons
ISBN: 1119098750
Category : Technology & Engineering
Languages : en
Pages : 550
Book Description
Fundamentals of Convolutional Coding, Second Edition, regarded as a bible of convolutional coding brings you a clear and comprehensive discussion of the basic principles of this field Two new chapters on low-density parity-check (LDPC) convolutional codes and iterative coding Viterbi, BCJR, BEAST, list, and sequential decoding of convolutional codes Distance properties of convolutional codes Includes a downloadable solutions manual
Probability Theory and Applications
Author: Janos GalambosPublisher: Springer Science & Business Media
ISBN: 9780792319221
Category : Mathematics
Languages : en
Pages : 382
Book Description
"Et moi, ..., si j'avait su comment en revenir, je One service mathematics bas rendered the human race. It bas put common sense back n'y serais point all .' where it belongs, on the topmost shelf next to lu1esVeme the dusty canister labelled 'discarded nonsense' Eric T. Bell 1be series is divergent; therefore we may be able to do something with it O. Heaviside Mathematics is a tool for thought. A highly necessary tool in a world where both feedback and nonlineari- ties abound. Similarly, all kinds of parts of mathematics serve as tools for other parts and for other sci- ences. Applying a simple rewriting rule to the quote on the right above one finds such statements as: 'One ser- vice topology has rendered mathematical physics ... '; 'One service logic has rendered computer science .. .'; 'One service category theory has rendered mathematics .. .'. All arguably true. And all statements obtainable this way form part of the raison d 'etre of this series.
Automated Technology for Verification and Analysis
Author: Dang Van HungPublisher: Springer
ISBN: 3319024442
Category : Computers
Languages : en
Pages : 540
Book Description
This book constitutes the refereed proceedings of the 11th International Symposium on Automated Technology for Verification and Analysis, ATVA 2013, held at Hanoi, Vietnam, in October 2013. The 27 regular papers, 3 short papers and 12 tool papers presented together with 3 invited talks were carefully selected from73 submissions. The papers are organized in topical, sections on analysis and verification of hardware circuits, systems-on-chip and embedded systems, analysis of real-time, hybrid, priced/weighted and probabilistic systems, deductive, algorithmic, compositional, and abstraction/refinement techniques for analysis and verification, analytical techniques for safety, security, and dependability, testing and runtime analysis based on verification technology, analysis and verification of parallel and concurrent hardware/software systems, verification in industrial practice, and applications and case studies.
