Series: Texts in Theoretical Computer Science. An EATCS Series
2007, VIII, 151 p. 64 illus., Hardcover
ISBN: 978-3-540-73937-1
Due: September 18, 2007
Text is supported throughout with examples and exercises
Full solutions are provided in an appendix, while exercise sheets, lab exercises, example specifications and lecturer slides are available on the author's website
A distributed system is driven by separate components that are executed in parallel and protocols for such systems form a major aspect of system design. Process algebras are languages for the description of elementary parallel systems and are used to study the behavioral properties of distributed systems, but they often lack the ability to handle data.
This textbook guides students through algebraic specification and verification of distributed systems, and some of the most prominent formal verification techniques. The author employs μCRL as the vehicle, a language developed to combine process algebra and abstract data types. The book evolved from introductory courses on protocol verification taught to undergraduate and graduate students of computer science, and the text is supported throughout with examples and exercises; full solutions are provided in an appendix, while exercise sheets, lab exercises, example specifications and lecturer slides will be available on the author's website. Researchers in the field can use the book as a broad overview of the state of the art in algebraic specification and verification of distributed systems on the basis of a modern verification tool.
Table of contents
Introduction.- Abstract Data Types.- Process Algebra.- Hiding Internal Transitions.- Protocol Specifications.- Linear Process Equations.- Verification Algorithms on State Spaces.- Symbolic Methods.- The μCRL Toolset in a Nutshell.- Solutions to Exercises.-References.- Index.
2008, Approx. 360 p., Hardcover
ISBN: 978-3-540-74077-3
Due: October 23, 2007
Details the experiences of a student and later a scientist caught up in the tumultuous events of his generation
Neal Koblitz is a co-inventor of one of the two most popular forms of encryption and digital signature, and his autobiographical memoirs are collected in this volume. Besides his own personal career in mathematics and cryptography, Koblitz details his travels to the Soviet Union, Latin America, Vietnam and elsewhere; political activism; and academic controversies relating to math education, the C. P. Snow "two-culture" problem, and mistreatment of women in academia. These engaging stories fully capture the experiences of a student and later a scientist caught up in the tumultuous events of his generation.
Table of contents
Early Years.- Harvard.- SDS.- The Army.- Spring of 1972.- Academics.- The Soviet Union.- Racism and Apartheid.- Vietnam. Part I.- Vietnam. Part II.- Nicaragua and Cuba.- El Salvador.- Two Cultures.- Cryptography.- Education.- Arizona.- Index.
*
Series: Springer Series in Statistics
2008, XIX, 570 p. 26 illus., Hardcover
ISBN: 978-3-540-74226-5
Due: October 16, 2007
Features extensive revisions and the latest results
Presents a unified theory of inference from linear models and its generalizations with minimal assumptions
Thoroughly revised and updated with the latest results, this Third Edition provides an up-to-date account of the theory and applications of linear models. The authors present a unified theory of inference from linear models and its generalizations with minimal assumptions. They not only use least squares theory, but also alternative methods of estimation and testing based on convex loss functions and general estimating equations.
Some of the highlights you’ll discover in this text include sensitivity analysis and model selection, an analysis of incomplete data, and an analysis of categorical data based on a unified presentation of generalized linear models. You’ll also find an extensive appendix on matrix theory that is particularly useful for researchers in econometrics, engineering, and optimization theory.
This text is recommended for courses in statistics at the graduate level. It also serves as a supplemental text for other courses in which linear models play a role.
Table of contents
1. Introduction.- 2. The Simple Linear Regression Model.- 3. The Multiple Linear Regression Model.- 4. The Generalized Linear Regression Model.- 5. Exact and Stochastic Linear Restrictions.- 6. Prediction Problems in the Generalized Regression Model.- 7. Sensitivity Analysis.- 8. Analysis of Incomplete Data Sets.- 9. Robust Regression.- 10. Models for Categorical Response Variables.- Fitting Smooth Functions.- Appendix A: Matrix Algebra.
Series: Stochastic Modelling and Applied Probability , Vol. 8
2008, XII, 220 p. 7 illus. Also available online., Softcover
ISBN: 978-3-540-74010-0
Due: October 23, 2007
The "ground floor" of Optimal Stopping Theory was constructed by A.Wald in his sequential analysis in connection with the testing of statistical hypotheses by non-traditional (sequential) methods.
It was later discovered that these methods have, in idea, a close connection to the general theory of stochastic optimization for random processes.
The area of application of the Optimal Stopping Theory is very broad. It is sufficient at this point to emphasise that its methods are well tailored to the study of American (-type) options (in mathematics of finance and financial engineering), where a buyer has the freedom to exercise an option at any stopping time.
In this book, the general theory of the construction of optimal stopping policies is developed for the case of Markov processes in discrete and continuous time.
One chapter is devoted specially to the applications that address problems of the testing of statistical hypotheses, and quickest detection of the time of change of the probability characteristics of the observable processes.
The author, A.N.Shiryaev, is one of the leading experts of the field and gives an authoritative treatment of a subject that, 30 years after original publication of this book, is proving increasingly important.
Table of contents
Series: Texts in Theoretical Computer Science. An EATCS Series
2008, Approx. 250 p., Hardcover
ISBN: 978-3-540-72874-0
Due: November 6, 2007
Wavelength-Division Multiplexing (WDM), the ability to support multiple communication pathways over the same fiber, enables efficient use of the enormous capability for data communication of optical networks. This book gives a broad overview of techniques used in the design of WDM networks for efficient dissemination of information in computer networks. Starting with an overview of the hardware components, then a thorough review of WDM, each topic is covered rigorously with emphasis on detailed explanations of the approaches used, starting from the fundamentals up to the state-of-the-art. The optimization techniques covered in the book include graph-theoretic algorithms, mixed-integer linear programming and heuristics.
The book is intended for beginners as well as for specialists, and the reader should be able to design WDM networks and follow developments in the field. Each chapter contains a detailed, annotated bibliography. There are numerous exercises for the reader to test understanding of the subject, while readers unfamiliar with mathematical programming techniques and network flow optimization are offered short, easy-to-understand appendices at the end of the book.
Table of contents
Introduction to Optical Networks.- Introduction to Optical Technology.- WDM Network Design.- Route and Wavelength Assignment (RWA) I.- Route and Wavelength Assignment (RWA) II.- Logical Topology Design I.- Logical Topology Design II.- Faults in Optical Networks.- Traffic Grooming.- List of Symbols.- App. 1: Linear Programming in a Nutshell.- App. 2: The De Bruijn Graph.- App. 3: Network Flow Programming.- References.- Index.