This volume represents the refereed proceedings of the Eighth International C- ference on Monte Carlo and Quasi-Monte Carlo Methods in Scienti c Computing, which was held at the University of Montreal, from 6-11 July, 2008. It contains a limited selection of articles based on presentations made at the conference. The program was arranged with the help of an international committee consisting of: Ronald Cools, Katholieke Universiteit Leuven Luc Devroye, McGill University Henri Faure, CNRS Marseille Paul Glasserman, Columbia University Peter W. Glynn, Stanford University Stefan Heinrich, University of Kaiserslautern Fred J. Hickernell, Illinois Institute of Technology Aneta Karaivanova, Bulgarian Academy of Science Alexander Keller, mental images GmbH, Berlin Adam Kolkiewicz, University of Waterloo Frances Y. Kuo, University of New South Wales Christian Lecot, Universite de Savoie, Chambery Pierre L'Ecuyer, Universite de Montreal (Chair and organizer) Jun Liu, Harvard University Peter Mathe, Weierstrass Institute Berlin Makoto Matsumoto, Hiroshima University Thomas Muller-Gronbach, Otto von Guericke Universitat Harald Niederreiter, National University of Singapore Art B. Owen, Stanford University Gilles Pages, Universite Pierre et Marie Curie (Paris 6) Klaus Ritter, TU Darmstadt Karl Sabelfeld, Weierstrass Institute Berlin Wolfgang Ch. Schmid, University of Salzburg Ian H. Sloan, University of New South Wales Jerome Spanier, University of California, Irvine Bruno Tuf n, IRISA-INRIA, Rennes Henryk Wozniak ' owski, Columbia University. v vi Preface The local arrangements (program production, publicity, web site, registration, social events, etc.

Starting with an introduction to the numerous features of Mathematica (R), this book continues with more complex material. It provides the reader with lots of examples and illustrations of how the benefits of Mathematica (R) can be used. Composed of eleven chapters, it includes the following: A chapter on several sorting algorithms Functions (planar and solid) with many interesting examples Ordinary differential equations Advantages of Mathematica (R) dealing with the Pi number The power of Mathematica (R) working with optimal control problems Introduction to Mathematica (R) with Applications will appeal to researchers, professors and students requiring a computational tool.

This book explores emerging topics in atomic- and nano-scale electronics after the era of Moore's Law, covering both the physical principles behind, and technological implementations for many devices that are now expected to become key elements of the future of nanoelectronics beyond traditional complementary metal-oxide semiconductors (CMOS). Moore's law is not a physical law itself, but rather a visionary prediction that has worked well for more than 50 years but is rapidly coming to its end as the gate length of CMOS transistors approaches the length-scale of only a few atoms. Thus, the key question here is: "What is the future for nanoelectronics beyond CMOS?" The possible answers are found in this book. Introducing novel quantum devices such as atomic-scale electronic devices, ballistic devices, memristors, superconducting devices, this book also presents the reader with the physical principles underlying new ways of computing, as well as their practical implementation. Topics such as quantum computing, neuromorphic computing are highlighted here as some of the most promising candidates for ushering in a new era of atomic-scale electronics beyond CMOS.

This book presents a collection of papers on recent advances in problems concerning dynamics, optimal control and optimization. In many chapters, computational techniques play a central role. Set-oriented techniques feature prominently throughout the book, yielding state-of-the-art algorithms for computing general invariant sets, constructing globally optimal controllers and solving multi-objective optimization problems.

With the diversification of Internet services and the increase in mobile users, efficient management of network resources has become an extremely important issue in the field of wireless communication networks (WCNs). Adaptive resource management is an effective tool for improving the economic efficiency of WCN systems as well as network design and construction, especially in view of the surge in mobile device demands. This book presents modelling methods based on queueing theory and Markov processes for a wide variety of WCN systems, as well as precise and approximate analytical solution methods for the numerical evaluation of the system performance. This is the first book to provide an overview of the numerical analyses that can be gleaned by applying queueing theory, traffic theory and other analytical methods to various WCN systems. It also discusses the recent advances in the resource management of WCNs, such as broadband wireless access networks, cognitive radio networks, and green cloud computing. It assumes a basic understanding of computer networks and queueing theory, and familiarity with stochastic processes is also recommended. The analysis methods presented in this book are useful for first-year-graduate or senior computer science and communication engineering students. Providing information on network design and management, performance evaluation, queueing theory, game theory, intelligent optimization, and operations research for researchers and engineers, the book is also a valuable reference resource for students, analysts, managers and anyone in the industry interested in WCN system modelling, performance analysis and numerical evaluation.

With the development of Big Data platforms for managing massive amount of data and wide availability of tools for processing these data, the biggest limitation is the lack of trained experts who are qualified to process and interpret the results. This textbook is intended for graduate students and experts using methods of cluster analysis and applications in various fields. Suitable for an introductory course on cluster analysis or data mining, with an in-depth mathematical treatment that includes discussions on different measures, primitives (points, lines, etc.) and optimization-based clustering methods, Cluster Analysis and Applications also includes coverage of deep learning based clustering methods. With clear explanations of ideas and precise definitions of concepts, accompanied by numerous examples and exercises together with Mathematica programs and modules, Cluster Analysis and Applications may be used by students and researchers in various disciplines, working in data analysis or data science.

This book presents the Statistical Learning Theory in a detailed and easy to understand way, by using practical examples, algorithms and source codes. It can be used as a textbook in graduation or undergraduation courses, for self-learners, or as reference with respect to the main theoretical concepts of Machine Learning. Fundamental concepts of Linear Algebra and Optimization applied to Machine Learning are provided, as well as source codes in R, making the book as self-contained as possible. It starts with an introduction to Machine Learning concepts and algorithms such as the Perceptron, Multilayer Perceptron and the Distance-Weighted Nearest Neighbors with examples, in order to provide the necessary foundation so the reader is able to understand the Bias-Variance Dilemma, which is the central point of the Statistical Learning Theory. Afterwards, we introduce all assumptions and formalize the Statistical Learning Theory, allowing the practical study of different classification algorithms. Then, we proceed with concentration inequalities until arriving to the Generalization and the Large-Margin bounds, providing the main motivations for the Support Vector Machines. From that, we introduce all necessary optimization concepts related to the implementation of Support Vector Machines. To provide a next stage of development, the book finishes with a discussion on SVM kernels as a way and motivation to study data spaces and improve classification results.

Computation is revolutionizing our world, even the inner world of the 'pure' mathematician. Mathematical methods - especially the notion of proof - that have their roots in classical antiquity have seen a radical transformation since the 1970s, as successive advances have challenged the priority of reason over computation. Like many revolutions, this one comes from within. Computation, calculation, algorithms - all have played an important role in mathematical progress from the beginning - but behind the scenes, their contribution was obscured in the enduring mathematical literature. To understand the future of mathematics, this fascinating book returns to its past, tracing the hidden history that follows the thread of computation. Along the way it invites us to reconsider the dialog between mathematics and the natural sciences, as well as the relationship between mathematics and computer science. It also sheds new light on philosophical concepts, such as the notions of analytic and synthetic judgment. Finally, it brings us to the brink of the new age, in which machine intelligence offers new ways of solving mathematical problems previously inaccessible. This book is the 2007 winner of the Grand Prix de Philosophie de l'Academie Francaise.

Rising concerns about the security of our data have made quantum cryptography a very active research field in recent years. Quantum cryptographic protocols promise everlasting security by exploiting distinctive quantum properties of nature. The most extensively implemented protocol is quantum key distribution (QKD), which enables secure communication between two users. The aim of this book is to introduce the reader to state-of-the-art QKD and illustrate its recent multi-user generalization: quantum conference key agreement. With its pedagogical approach that doesn't disdain going into details, the book enables the reader to join in cutting-edge research on quantum cryptography.

Optimization methods have been considered in many articles, monographs, and handbooks. However, experts continue to experience difficulties in correctly stating optimization problems in engineering. These troubles typically emerge when trying to define the set of feasible solutions, i.e. the constraints imposed on the design variables, functional relationships, and criteria. The Parameter Space Investigation (PSI) method was developed specifically for the correct statement and solution of engineering optimization problems. It is implemented in the MOVI 1.0 software package, a tutorial version of which is included in this book. The PSI method and MOVI 1.0 software package have a wide range of applications. The PSI method can be successfully used for the statement and solution of the following multicriteria problems: design, identification, design with control, the optional development of prototypes, finite element models, and the decomposition and aggregation of large-scale systems.

Audience: The PSI method will be of interest to researchers, graduate students, and engineers who work in engineering, mathematical modelling and industrial mathematics, and in computer and information science.

Cyber-physical systems (CPSs) combine cyber capabilities, such as computation or communication, with physical capabilities, such as motion or other physical processes. Cars, aircraft, and robots are prime examples, because they move physically in space in a way that is determined by discrete computerized control algorithms. Designing these algorithms is challenging due to their tight coupling with physical behavior, while it is vital that these algorithms be correct because we rely on them for safety-critical tasks. This textbook teaches undergraduate students the core principles behind CPSs. It shows them how to develop models and controls; identify safety specifications and critical properties; reason rigorously about CPS models; leverage multi-dynamical systems compositionality to tame CPS complexity; identify required control constraints; verify CPS models of appropriate scale in logic; and develop an intuition for operational effects. The book is supported with homework exercises, lecture videos, and slides.

This book provides detailed descriptions of big data solutions for activity detection and forecasting of very large numbers of moving entities spread across large geographical areas. It presents state-of-the-art methods for processing, managing, detecting and predicting trajectories and important events related to moving entities, together with advanced visual analytics methods, over multiple heterogeneous, voluminous, fluctuating and noisy data streams from moving entities, correlating them with data from archived data sources expressing e.g. entities' characteristics, geographical information, mobility patterns, mobility regulations and intentional data. The book is divided into six parts: Part I discusses the motivation and background of mobility forecasting supported by trajectory-oriented analytics, and includes specific problems and challenges in the aviation (air-traffic management) and the maritime domains. Part II focuses on big data quality assessment and processing, and presents novel technologies suitable for mobility analytics components. Next, Part III describes solutions toward processing and managing big spatio-temporal data, particularly enriching data streams and integrating streamed and archival data to provide coherent views of mobility, and storing of integrated mobility data in large distributed knowledge graphs for efficient query-answering. Part IV focuses on mobility analytics methods exploiting (online) processed, synopsized and enriched data streams as well as (offline) integrated, archived mobility data, and highlights future location and trajectory prediction methods, distinguishing between short-term and more challenging long-term predictions. Part V examines how methods addressing data management, data processing and mobility analytics are integrated in big data architectures with distinctive characteristics compared to other known big data paradigmatic architectures. Lastly, Part VI covers important ethical issues that research on mobility analytics should address. Providing novel approaches and methodologies related to mobility detection and forecasting needs based on big data exploration, processing, storage, and analysis, this book will appeal to computer scientists and stakeholders in various application domains.

This volume assesses approaches to the construction of computer vision systems. It shows that there is a spectrum of approaches with different degrees of maturity and robustness. The useful exploitation of computer vision in industry and elsewhere and the development of the discipline itself depend on understanding the way these approaches influence one another. The chief topic discussed is autonomy.True autonomy may not be achievable in machines in the near future, and the workshop concluded that it may be more desirable - and is certainly more pragmatic - to leave a person in the processing loop. The second conclusion of the workshop concerns the manner in which a system is designedfor an application. It was agreed that designers should first specify the required functionality, then identify the knowledge appropriate to that task, and finally choose the appropriate techniques and algorithms. The third conclusion concerns the methodologies employed in developing vision systems: craft, engineering, and science are mutually relevant and contribute to one another. The contributors place heavy emphasis on providing the reader with concrete examples of operational systems. The book is based on a workshop held as part of the activities of an ESPRIT Basic Research Action.

The book is centered around the research areas of combinatorics, special functions, and computer algebra. What these research fields share is that many of their outstanding results do not only have applications in Mathematics, but also other disciplines, such as computer science, physics, chemistry, etc. A particular charm of these areas is how they interact and influence one another. For instance, combinatorial or special functions' techniques have motivated the development of new symbolic algorithms. In particular, first proofs of challenging problems in combinatorics and special functions were derived by making essential use of computer algebra. This book addresses these interdisciplinary aspects. Algorithmic aspects are emphasized and the corresponding software packages for concrete problem solving are introduced. Readers will range from graduate students, researchers to practitioners who are interested in solving concrete problems within mathematics and other research disciplines.

This book discusses the elementary ideas and tools needed for open quantum systems in a comprehensive manner. The emphasis is given to both the traditional master equation as well as the functional (path) integral approaches. It discusses the basic paradigm of open systems, the harmonic oscillator and the two-level system in detail. The traditional topics of dissipation and tunneling, as well as the modern field of quantum information, find a prominent place in the book. Assuming a basic background of quantum and statistical mechanics, this book will help readers familiarize with the basic tools of open quantum systems. Open quantum systems is the study of quantum dynamics of the system of interest, taking into account the effects of the ambient environment. It is ubiquitous in the sense that any system could be envisaged to be surrounded by its environment which could naturally exert its influence on it. Open quantum systems allows for a systematic understanding of irreversible processes such as decoherence and dissipation, of the essence in order to have a correct understanding of realistic quantum dynamics and also for possible implementations. This would be essential for a possible development of quantum technologies.

This book presents a set theoretical development for the foundations of the theory of atomic and finitely supported structures. It analyzes whether a classical result can be adequately reformulated by replacing a 'non-atomic structure' with an 'atomic, finitely supported structure'. It also presents many specific properties, such as finiteness, cardinality, connectivity, fixed point, order and uniformity, of finitely supported atomic structures that do not have non-atomic correspondents. In the framework of finitely supported sets, the authors analyze the consistency of various forms of choice and related results. They introduce and study the notion of 'cardinality' by presenting various order and arithmetic properties. Finitely supported partially ordered sets, chain complete sets, lattices and Galois connections are studied, and new fixed point, calculability and approximation properties are presented. In this framework, the authors study the finitely supported L-fuzzy subsets of a finitely supported set and the finitely supported fuzzy subgroups of a finitely supported group. Several pairwise non-equivalent definitions for the notion of 'infinity' (Dedekind infinity, Mostowski infinity, Kuratowski infinity, Tarski infinity, ascending infinity) are introduced, compared and studied in the new framework. Relevant examples of sets that satisfy some forms of infinity while not satisfying others are provided. Uniformly supported sets are analyzed, and certain surprising properties are presented. Finally, some variations of the finite support requirement are discussed. The book will be of value to researchers in the foundations of set theory, algebra and logic.

This book comprises selected peer-reviewed papers presented at the 7th Topical Conference of the Indian Society of Atomic and Molecular Physics, jointly held at IISER Tirupati and IIT Tirupati, India. The contributions address current topics of interest in atomic and molecular physics, both from the theoretical and experimental perspective. The major focus areas include quantum collisions, spectroscopy of atomic and molecular clusters, photoionization, Wigner time delay in collisions, laser cooling, Bose-Einstein condensates, atomic clocks, quantum computing, and trapping and manipulation of quantum systems. The book also discusses emerging topics such as ultrafast quantum processes including those at the attosecond time-scale. This book will prove to be a valuable reference for students and researchers working in the field of atomic and molecular physics.

As the first book of a three-part series, this book is offered as a tribute to pioneers in vision, such as Bela Julesz, David Marr, King-Sun Fu, Ulf Grenander, and David Mumford. The authors hope to provide foundation and, perhaps more importantly, further inspiration for continued research in vision. This book covers David Marr's paradigm and various underlying statistical models for vision. The mathematical framework herein integrates three regimes of models (low-, mid-, and high-entropy regimes) and provides foundation for research in visual coding, recognition, and cognition. Concepts are first explained for understanding and then supported by findings in psychology and neuroscience, after which they are established by statistical models and associated learning and inference algorithms. A reader will gain a unified, cross-disciplinary view of research in vision and will accrue knowledge spanning from psychology to neuroscience to statistics.

This classroom-tested and clearly-written textbook presents a focused guide to the conceptual foundations of compilation, explaining the fundamental principles and algorithms used for defining the syntax of languages, and for implementing simple translators. This significantly updated and expanded third edition has been enhanced with additional coverage of regular expressions, visibly pushdown languages, bottom-up and top-down deterministic parsing algorithms, and new grammar models. Topics and features: describes the principles and methods used in designing syntax-directed applications such as parsing and regular expression matching; covers translations, semantic functions (attribute grammars), and static program analysis by data flow equations; introduces an efficient method for string matching and parsing suitable for ambiguous regular expressions (NEW); presents a focus on extended BNF grammars with their general parser and with LR(1) and LL(1) parsers (NEW); introduces a parallel parsing algorithm that exploits multiple processing threads to speed up syntax analysis of large files; discusses recent formal models of input-driven automata and languages (NEW); includes extensive use of theoretical models of automata, transducers and formal grammars, and describes all algorithms in pseudocode; contains numerous illustrative examples, and supplies a large set of exercises with solutions at an associated website. Advanced undergraduate and graduate students of computer science will find this reader-friendly textbook to be an invaluable guide to the essential concepts of syntax-directed compilation. The fundamental paradigms of language structures are elegantly explained in terms of the underlying theory, without requiring the use of software tools or knowledge of implementation, and through algorithms simple enough to be practiced by paper and pencil.

Optimization is a field important in its own right but is also integral to numerous applied sciences, including operations research, management science, economics, finance and all branches of mathematics-oriented engineering. Constrained optimization models are one of the most widely used mathematical models in operations research and management science.

This book gives a modern and well-balanced presentation of the subject, focusing on theory but also including algorithims and examples from various real-world applications. The text is easy to read and accessible to anyone with a knowledge of multi-dimensional calculus, linear algebra and basic numerical methods. Detailed examples and counter-examples are provided--as are exercises, solutions and helpful hints, and Matlab/Maple supplements.

The intended readership is advanced undergraduates, graduates, and professionals in any of the applied fields.

This textbook grew out of notes for the ECE143 Programming for Data Analysis class that the author has been teaching at University of California, San Diego, which is a requirement for both graduate and undergraduate degrees in Machine Learning and Data Science. This book is ideal for readers with some Python programming experience. The book covers key language concepts that must be understood to program effectively, especially for data analysis applications. Certain low-level language features are discussed in detail, especially Python memory management and data structures. Using Python effectively means taking advantage of its vast ecosystem. The book discusses Python package management and how to use third-party modules as well as how to structure your own Python modules. The section on object-oriented programming explains features of the language that facilitate common programming patterns. After developing the key Python language features, the book moves on to third-party modules that are foundational for effective data analysis, starting with Numpy. The book develops key Numpy concepts and discusses internal Numpy array data structures and memory usage. Then, the author moves onto Pandas and details its many features for data processing and alignment. Because strong visualizations are important for communicating data analysis, key modules such as Matplotlib are developed in detail, along with web-based options such as Bokeh, Holoviews, Altair, and Plotly. The text is sprinkled with many tricks-of-the-trade that help avoid common pitfalls. The author explains the internal logic embodied in the Python language so that readers can get into the Python mindset and make better design choices in their codes, which is especially helpful for newcomers to both Python and data analysis. To get the most out of this book, open a Python interpreter and type along with the many code samples.

Fibonacci Cubes have been an extremely popular area of research since the 1990s.This unique compendium features the state of research into Fibonacci Cubes. It expands the knowledge in graph theoretic and combinatorial properties of Fibonacci Cubes and their variants.By highlighting various approaches with numerous examples, it provides a fundamental source for further research in the field. This useful reference text surely benefits advanced students in computer science and mathematics and serves as an archival record of the current state of the field.

This Festschrift celebrates Teddy Seidenfeld and his seminal contributions to philosophy, statistics, probability, game theory and related areas. The 13 contributions in this volume, written by leading researchers in these fields, are supplemented by an interview with Teddy Seidenfeld that offers an abbreviated intellectual autobiography, touching on topics of timeless interest concerning truth and uncertainty. Indeed, as the eminent philosopher Isaac Levi writes in this volume: "In a world dominated by Alternative Facts and Fake News, it is hard to believe that many of us have spent our life's work, as has Teddy Seidenfeld, in discussing truth and uncertainty." The reader is invited to share this celebration of Teddy Seidenfeld's work uncovering truths about uncertainty and the penetrating insights they offer to our common pursuit of truth in the face of uncertainty.

This book provides readers with a guide to both ordinal analysis, and to proof theory. It mainly focuses on ordinal analysis, a research topic in proof theory that is concerned with the ordinal theoretic content of formal theories. However, the book also addresses ordinal analysis and basic materials in proof theory of first-order or omega logic, presenting some new results and new proofs of known ones.Primarily intended for graduate students and researchers in mathematics, especially in mathematical logic, the book also includes numerous exercises and answers for selected exercises, designed to help readers grasp and apply the main results and techniques discussed.

In many practical situations, we are interested in statistics characterizing a population of objects: e.g. in the mean height of people from a certain area. Most algorithms for estimating such statistics assume that the sample values are exact. In practice, sample values come from measurements, and measurements are never absolutely accurate. Sometimes, we know the exact probability distribution of the measurement inaccuracy, but often, we only know the upper bound on this inaccuracy. In this case, we have interval uncertainty: e.g. if the measured value is 1.0, and inaccuracy is bounded by 0.1, then the actual (unknown) value of the quantity can be anywhere between 1.0 - 0.1 = 0.9 and 1.0 + 0.1 = 1.1. In other cases, the values are expert estimates, and we only have fuzzy information about the estimation inaccuracy. This book shows how to compute statistics under such interval and fuzzy uncertainty. The resulting methods are applied to computer science (optimal scheduling of different processors), to information technology (maintaining privacy), to computer engineering (design of computer chips), and to data processing in geosciences, radar imaging, and structural mechanics.