Author:
Publisher:
ISBN:
Category : Mathematics
Languages : en
Pages : 1608
Book Description
Mathematical Reviews
Author:
Publisher:
ISBN:
Category : Mathematics
Languages : en
Pages : 1608
Book Description
Publisher:
ISBN:
Category : Mathematics
Languages : en
Pages : 1608
Book Description
Index of Mathematical Papers
Author:
Publisher:
ISBN:
Category : Mathematical reviews
Languages : en
Pages : 628
Book Description
Publisher:
ISBN:
Category : Mathematical reviews
Languages : en
Pages : 628
Book Description
Queueing Theory for Telecommunications
Author: Attahiru Sule Alfa
Publisher: Springer Science & Business Media
ISBN: 1441973141
Category : Computers
Languages : en
Pages : 248
Book Description
Queueing theory applications can be discovered in many walks of life including; transportation, manufacturing, telecommunications, computer systems and more. However, the most prevalent applications of queueing theory are in the telecommunications field. Queueing Theory for Telecommunications: Discrete Time Modelling of a Single Node System focuses on discrete time modeling and illustrates that most queueing systems encountered in real life can be set up as a Markov chain. This feature is very unique because the models are set in such a way that matrix-analytic methods are used to analyze them. Queueing Theory for Telecommunications: Discrete Time Modelling of a Single Node System is the most relevant book available on queueing models designed for applications to telecommunications. This book presents clear concise theories behind how to model and analyze key single node queues in discrete time using special tools that were presented in the second chapter. The text also delves into the types of single node queues that are very frequently encountered in telecommunication systems modeling, and provides simple methods for analyzing them. Where appropriate, alternative analysis methods are also presented. This book is for advanced-level students and researchers concentrating on engineering, computer science and mathematics as a secondary text or reference book. Professionals who work in the related industries of telecommunications, industrial engineering and communications engineering will find this book useful as well.
Publisher: Springer Science & Business Media
ISBN: 1441973141
Category : Computers
Languages : en
Pages : 248
Book Description
Queueing theory applications can be discovered in many walks of life including; transportation, manufacturing, telecommunications, computer systems and more. However, the most prevalent applications of queueing theory are in the telecommunications field. Queueing Theory for Telecommunications: Discrete Time Modelling of a Single Node System focuses on discrete time modeling and illustrates that most queueing systems encountered in real life can be set up as a Markov chain. This feature is very unique because the models are set in such a way that matrix-analytic methods are used to analyze them. Queueing Theory for Telecommunications: Discrete Time Modelling of a Single Node System is the most relevant book available on queueing models designed for applications to telecommunications. This book presents clear concise theories behind how to model and analyze key single node queues in discrete time using special tools that were presented in the second chapter. The text also delves into the types of single node queues that are very frequently encountered in telecommunication systems modeling, and provides simple methods for analyzing them. Where appropriate, alternative analysis methods are also presented. This book is for advanced-level students and researchers concentrating on engineering, computer science and mathematics as a secondary text or reference book. Professionals who work in the related industries of telecommunications, industrial engineering and communications engineering will find this book useful as well.
Random Graph Dynamics
Author: Rick Durrett
Publisher: Cambridge University Press
ISBN: 1139460889
Category : Mathematics
Languages : en
Pages : 203
Book Description
The theory of random graphs began in the late 1950s in several papers by Erdos and Renyi. In the late twentieth century, the notion of six degrees of separation, meaning that any two people on the planet can be connected by a short chain of people who know each other, inspired Strogatz and Watts to define the small world random graph in which each site is connected to k close neighbors, but also has long-range connections. At a similar time, it was observed in human social and sexual networks and on the Internet that the number of neighbors of an individual or computer has a power law distribution. This inspired Barabasi and Albert to define the preferential attachment model, which has these properties. These two papers have led to an explosion of research. The purpose of this book is to use a wide variety of mathematical argument to obtain insights into the properties of these graphs. A unique feature is the interest in the dynamics of process taking place on the graph in addition to their geometric properties, such as connectedness and diameter.
Publisher: Cambridge University Press
ISBN: 1139460889
Category : Mathematics
Languages : en
Pages : 203
Book Description
The theory of random graphs began in the late 1950s in several papers by Erdos and Renyi. In the late twentieth century, the notion of six degrees of separation, meaning that any two people on the planet can be connected by a short chain of people who know each other, inspired Strogatz and Watts to define the small world random graph in which each site is connected to k close neighbors, but also has long-range connections. At a similar time, it was observed in human social and sexual networks and on the Internet that the number of neighbors of an individual or computer has a power law distribution. This inspired Barabasi and Albert to define the preferential attachment model, which has these properties. These two papers have led to an explosion of research. The purpose of this book is to use a wide variety of mathematical argument to obtain insights into the properties of these graphs. A unique feature is the interest in the dynamics of process taking place on the graph in addition to their geometric properties, such as connectedness and diameter.
Computer Networks and Systems
Author: Thomas G. Robertazzi
Publisher: Springer Science & Business Media
ISBN: 1461211646
Category : Mathematics
Languages : en
Pages : 418
Book Description
Intended for a first course in performance evaluation, this is a self-contained treatment covering all aspects of queuing theory. It starts by introducing readers to the terminology and usefulness of queueing theory and continues by considering Markovian queues in equilibrium, Littles law, reversibility, transient analysis, and computation, plus the M/G/1 queuing system. It then moves on to cover networks of queues, and concludes with techniques for numerical solutions, a discussion of the PANACEA technique, discrete time queueing systems and simulation, and stochastic Petri networks. The whole is backed by case studies of distributed queueing networks arising in industrial applications. This third edition includes a new chapter on self-similar traffic, many new problems, and solutions for many exercises.
Publisher: Springer Science & Business Media
ISBN: 1461211646
Category : Mathematics
Languages : en
Pages : 418
Book Description
Intended for a first course in performance evaluation, this is a self-contained treatment covering all aspects of queuing theory. It starts by introducing readers to the terminology and usefulness of queueing theory and continues by considering Markovian queues in equilibrium, Littles law, reversibility, transient analysis, and computation, plus the M/G/1 queuing system. It then moves on to cover networks of queues, and concludes with techniques for numerical solutions, a discussion of the PANACEA technique, discrete time queueing systems and simulation, and stochastic Petri networks. The whole is backed by case studies of distributed queueing networks arising in industrial applications. This third edition includes a new chapter on self-similar traffic, many new problems, and solutions for many exercises.
Iterative Methods for Sparse Linear Systems
Author: Yousef Saad
Publisher: SIAM
ISBN: 0898715342
Category : Mathematics
Languages : en
Pages : 537
Book Description
Mathematics of Computing -- General.
Publisher: SIAM
ISBN: 0898715342
Category : Mathematics
Languages : en
Pages : 537
Book Description
Mathematics of Computing -- General.
Numerical Methods for Large Eigenvalue Problems
Author: Yousef Saad
Publisher: SIAM
ISBN: 9781611970739
Category : Mathematics
Languages : en
Pages : 292
Book Description
This revised edition discusses numerical methods for computing eigenvalues and eigenvectors of large sparse matrices. It provides an in-depth view of the numerical methods that are applicable for solving matrix eigenvalue problems that arise in various engineering and scientific applications. Each chapter was updated by shortening or deleting outdated topics, adding topics of more recent interest, and adapting the Notes and References section. Significant changes have been made to Chapters 6 through 8, which describe algorithms and their implementations and now include topics such as the implicit restart techniques, the Jacobi-Davidson method, and automatic multilevel substructuring.
Publisher: SIAM
ISBN: 9781611970739
Category : Mathematics
Languages : en
Pages : 292
Book Description
This revised edition discusses numerical methods for computing eigenvalues and eigenvectors of large sparse matrices. It provides an in-depth view of the numerical methods that are applicable for solving matrix eigenvalue problems that arise in various engineering and scientific applications. Each chapter was updated by shortening or deleting outdated topics, adding topics of more recent interest, and adapting the Notes and References section. Significant changes have been made to Chapters 6 through 8, which describe algorithms and their implementations and now include topics such as the implicit restart techniques, the Jacobi-Davidson method, and automatic multilevel substructuring.
Limit Order Books
Author: Frédéric Abergel
Publisher: Cambridge University Press
ISBN: 1316870480
Category : Mathematics
Languages : en
Pages : 242
Book Description
A limit order book is essentially a file on a computer that contains all orders sent to the market, along with their characteristics such as the sign of the order, price, quantity and a timestamp. The majority of organized electronic markets rely on limit order books to store the list of interests of market participants on their central computer. A limit order book contains all the information available on a specific market and it reflects the way the market moves under the influence of its participants. This book discusses several models of limit order books. It begins by discussing the data to assess their empirical properties, and then moves on to mathematical models in order to reproduce the observed properties. Finally, the book presents a framework for numerical simulations. It also covers important modelling techniques including agent-based modelling, and advanced modelling of limit order books based on Hawkes processes. The book also provides in-depth coverage of simulation techniques and introduces general, flexible, open source library concepts useful to readers studying trading strategies in order-driven markets.
Publisher: Cambridge University Press
ISBN: 1316870480
Category : Mathematics
Languages : en
Pages : 242
Book Description
A limit order book is essentially a file on a computer that contains all orders sent to the market, along with their characteristics such as the sign of the order, price, quantity and a timestamp. The majority of organized electronic markets rely on limit order books to store the list of interests of market participants on their central computer. A limit order book contains all the information available on a specific market and it reflects the way the market moves under the influence of its participants. This book discusses several models of limit order books. It begins by discussing the data to assess their empirical properties, and then moves on to mathematical models in order to reproduce the observed properties. Finally, the book presents a framework for numerical simulations. It also covers important modelling techniques including agent-based modelling, and advanced modelling of limit order books based on Hawkes processes. The book also provides in-depth coverage of simulation techniques and introduces general, flexible, open source library concepts useful to readers studying trading strategies in order-driven markets.
An Introduction to Queueing Theory
Author: U. Narayan Bhat
Publisher: Birkhäuser
ISBN: 0817684212
Category : Mathematics
Languages : en
Pages : 343
Book Description
This introductory textbook is designed for a one-semester course on queueing theory that does not require a course on stochastic processes as a prerequisite. By integrating the necessary background on stochastic processes with the analysis of models, the work provides a sound foundational introduction to the modeling and analysis of queueing systems for a broad interdisciplinary audience of students in mathematics, statistics, and applied disciplines such as computer science, operations research, and engineering. This edition includes additional topics in methodology and applications. Key features: • An introductory chapter including a historical account of the growth of queueing theory in more than 100 years. • A modeling-based approach with emphasis on identification of models • Rigorous treatment of the foundations of basic models commonly used in applications with appropriate references for advanced topics. • A chapter on matrix-analytic method as an alternative to the traditional methods of analysis of queueing systems. • A comprehensive treatment of statistical inference for queueing systems. • Modeling exercises and review exercises when appropriate. The second edition of An Introduction of Queueing Theory may be used as a textbook by first-year graduate students in fields such as computer science, operations research, industrial and systems engineering, as well as related fields such as manufacturing and communications engineering. Upper-level undergraduate students in mathematics, statistics, and engineering may also use the book in an introductory course on queueing theory. With its rigorous coverage of basic material and extensive bibliography of the queueing literature, the work may also be useful to applied scientists and practitioners as a self-study reference for applications and further research. "...This book has brought a freshness and novelty as it deals mainly with modeling and analysis in applications as well as with statistical inference for queueing problems. With his 40 years of valuable experience in teaching and high level research in this subject area, Professor Bhat has been able to achieve what he aimed: to make [the work] somewhat different in content and approach from other books." - Assam Statistical Review of the first edition
Publisher: Birkhäuser
ISBN: 0817684212
Category : Mathematics
Languages : en
Pages : 343
Book Description
This introductory textbook is designed for a one-semester course on queueing theory that does not require a course on stochastic processes as a prerequisite. By integrating the necessary background on stochastic processes with the analysis of models, the work provides a sound foundational introduction to the modeling and analysis of queueing systems for a broad interdisciplinary audience of students in mathematics, statistics, and applied disciplines such as computer science, operations research, and engineering. This edition includes additional topics in methodology and applications. Key features: • An introductory chapter including a historical account of the growth of queueing theory in more than 100 years. • A modeling-based approach with emphasis on identification of models • Rigorous treatment of the foundations of basic models commonly used in applications with appropriate references for advanced topics. • A chapter on matrix-analytic method as an alternative to the traditional methods of analysis of queueing systems. • A comprehensive treatment of statistical inference for queueing systems. • Modeling exercises and review exercises when appropriate. The second edition of An Introduction of Queueing Theory may be used as a textbook by first-year graduate students in fields such as computer science, operations research, industrial and systems engineering, as well as related fields such as manufacturing and communications engineering. Upper-level undergraduate students in mathematics, statistics, and engineering may also use the book in an introductory course on queueing theory. With its rigorous coverage of basic material and extensive bibliography of the queueing literature, the work may also be useful to applied scientists and practitioners as a self-study reference for applications and further research. "...This book has brought a freshness and novelty as it deals mainly with modeling and analysis in applications as well as with statistical inference for queueing problems. With his 40 years of valuable experience in teaching and high level research in this subject area, Professor Bhat has been able to achieve what he aimed: to make [the work] somewhat different in content and approach from other books." - Assam Statistical Review of the first edition
Limits to Parallel Computation
Author: Raymond Greenlaw
Publisher: Oxford University Press, USA
ISBN: 0195085914
Category : Computational complexity
Languages : en
Pages : 328
Book Description
This book provides a comprehensive analysis of the most important topics in parallel computation. It is written so that it may be used as a self-study guide to the field, and researchers in parallel computing will find it a useful reference for many years to come. The first half of the book consists of an introduction to many fundamental issues in parallel computing. The second half provides lists of P-complete- and open problems. These lists will have lasting value to researchers in both industry and academia. The lists of problems, with their corresponding remarks, the thorough index, and the hundreds of references add to the exceptional value of this resource. While the exciting field of parallel computation continues to expand rapidly, this book serves as a guide to research done through 1994 and also describes the fundamental concepts that new workers will need to know in coming years. It is intended for anyone interested in parallel computing, including senior level undergraduate students, graduate students, faculty, and people in industry. As an essential reference, the book will be needed in all academic libraries.
Publisher: Oxford University Press, USA
ISBN: 0195085914
Category : Computational complexity
Languages : en
Pages : 328
Book Description
This book provides a comprehensive analysis of the most important topics in parallel computation. It is written so that it may be used as a self-study guide to the field, and researchers in parallel computing will find it a useful reference for many years to come. The first half of the book consists of an introduction to many fundamental issues in parallel computing. The second half provides lists of P-complete- and open problems. These lists will have lasting value to researchers in both industry and academia. The lists of problems, with their corresponding remarks, the thorough index, and the hundreds of references add to the exceptional value of this resource. While the exciting field of parallel computation continues to expand rapidly, this book serves as a guide to research done through 1994 and also describes the fundamental concepts that new workers will need to know in coming years. It is intended for anyone interested in parallel computing, including senior level undergraduate students, graduate students, faculty, and people in industry. As an essential reference, the book will be needed in all academic libraries.