Despite the ample number of articles on parallel-vector computational algorithms published over the last 20 years, there is a lack of texts in the field customized for senior undergraduate and graduate engineering research. Parallel-Vector Equation Solvers for Finite Element Engineering Applications aims to fill this gap, detailing both the theoretical development and important implementations of equation-solution algorithms. The mathematical background necessary to understand their inception balances well with descriptions of their practical uses. Illustrated with a number of state-of-the-art FORTRAN codes developed as examples for the book, Dr. Nguyen's text is a perfect choice for instructors and researchers alike.

This book examines how fuzzy methods can be employed to manage service levels in business and IT alignment. It starts by mapping the dependencies of service level agreements, coming up with gradual and bi-polar concepts to eventually classify the level of coupling by intuitionistic fuzzy sets. The second part presents an approach to analyze the impact of service failures using intuitionistic fuzzy methods (IFSFIA). Lastly, the third part of the book extends the concept towards business and IT-aligned service-level engineering and provides two use cases.

This book reviews selected topics charterized by great progress and covers the field from theoretical areas to experimental ones. It contains fundamental areas, quantum query complexity, quantum statistical inference, quantum cloning, quantum entanglement, additivity. It treats three types of quantum security system, quantum public key cryptography, quantum key distribution, and quantum steganography. A photonic system is highlighted for the realization of quantum information processing.

The mathematical theory of wavelets is less than 15 years old, yet already wavelets have become a fundamental tool in many areas of applied mathematics and engineering. This introduction to wavelets assumes a basic background in linear algebra (reviewed in Chapter 1) and real analysis at the undergraduate level. Fourier and wavelet analyses are first presented in the finite-dimensional context, using only linear algebra. Then Fourier series are introduced in order to develop wavelets in the infinite-dimensional, but discrete context. Finally, the text discusses Fourier transform and wavelet theory on the real line. The computation of the wavelet transform via filter banks is emphasized, and applications to signal compression and numerical differential equations are given. This text is ideal for a topics course for mathematics majors, because it exhibits and emerging mathematical theory with many applications. It also allows engineering students without graduate mathematics prerequisites to gain a practical knowledge of wavelets.

This book presents the state-of-the-art in simulation on supercomputers. Leading researchers present results achieved on systems of the Gauss-Allianz, the association of High-Performance Computing centers in Germany. The reports cover all fields of computational science and engineering, ranging from CFD to Computational Physics and Biology to Computer Science, with a special emphasis on industrially relevant applications. Presenting results for large-scale parallel microprocessor-based systems and GPU and FPGA-supported systems, the book makes it possible to compare the performance levels and usability of various architectures. Its outstanding results in achieving the highest performance for production codes are of particular interest for both scientists and engineers. The book includes a wealth of color illustrations and tables.

This is a textbook for undergraduate students of chemical and biological engineering. It is also useful for graduate students and professional engineers and numerical analysts. All reactive chemical and biological processes are highly nonlinear allowing for multiple steady states. This book addresses the bifurcation characteristics of chemical and biological processes as the general case and treats systems with a unique steady state as special cases. It uses a system approach which is the most efficient for knowledge organization and transfer. The book develops mathematical models for many commercial processes utilizing the mass, momentum, and heat-balance equations coupled to the rates of the processes that take place within the boundaries of the system. design and optimization of the chemical and biological industrial equipment and plants, such as single and batteries of CSTRs, porous and nonporous catalyst pellets and their effectiveness factors, tubular catalytic and noncatalytic reactors, fluidized bed catalytic reactors, coupled fluidized beds such as reactor-regenerator systems (industrial fluid catalytic cracking units), fluidized bed reformers for producing hydrogen or syngas, fermenters for fuel ethanol, simulation of the brain acetylcholine neurocycle, anaerobic digesters, co and countercurrent absorption columns, and many more. The book also includes verification against industrial data. The book's CD contains nearly 100 MATLAB programs which are meant to teach the readers how to solve a variety of important chemical and biological engineering problems. The algorithms include solving transcendental and algebraic equations, with and without bifurcation; as well as initial and boundary value ordinary differential equations. Said Elnashaie is Professor of Chemical and Biological Engineering at the University of British Columbia. is a Ph.D. candidate in Applied Mathematics at Auburn with a B.S. in Chemical Engineering. The active interaction of these authors has brought about this new and modern interdisciplinary book

Fourier analysis is one of the most useful tools in many applied sciences. The recent developments of wavelet analysis indicate that in spite of its long history and well-established applications, the field is still one of active research. This text bridges the gap between engineering and mathematics, providing a rigorously mathematical introduction of Fourier analysis, wavelet analysis and related mathematical methods, while emphasizing their uses in signal processing and other applications in communications engineering. The interplay between Fourier series and Fourier transforms is at the heart of signal processing, which is couched most naturally in terms of the Dirac delta function and Lebesgue integrals. The exposition is organized into four parts. The first is a discussion of one-dimensional Fourier theory, including the classical results on convergence and the Poisson sum formula. The second part is devoted to the mathematical foundations of signal processing ¿ sampling, filtering, digital signal processing. Fourier analysis in Hilbert spaces is the focus of the third part, and the last part provides an introduction to wavelet analysis, time-frequency issues, and multiresolution analysis. An appendix provides the necessary background on Lebesgue integrals.

This focuses on the developing field of building probability models with the power of symbolic algebra systems. The book combines the uses of symbolic algebra with probabilistic/stochastic application and highlights the applications in a variety of contexts. The research explored in each chapter is unified by the use of A Probability Programming Language (APPL) to achieve the modeling objectives. APPL, as a research tool, enables a probabilist or statistician the ability to explore new ideas, methods, and models. Furthermore, as an open-source language, it sets the foundation for future algorithms to augment the original code. Computational Probability Applications is comprised of fifteen chapters, each presenting a specific application of computational probability using the APPL modeling and computer language. The chapter topics include using inverse gamma as a survival distribution, linear approximations of probability density functions, and also moment-ratio diagrams for univariate distributions. These works highlight interesting examples, often done by undergraduate students and graduate students that can serve as templates for future work. In addition, this book should appeal to researchers and practitioners in a range of fields including probability, statistics, engineering, finance, neuroscience, and economics.

The main idea of statistical convergence is to demand convergence only for a majority of elements of a sequence. This method of convergence has been investigated in many fundamental areas of mathematics such as: measure theory, approximation theory, fuzzy logic theory, summability theory, and so on. In this monograph we consider this concept in approximating a function by linear operators, especially when the classical limit fails. The results of this book not only cover the classical and statistical approximation theory, but also are applied in the fuzzy logic via the fuzzy-valued operators. The authors in particular treat the important Korovkin approximation theory of positive linear operators in statistical and fuzzy sense. They also present various statistical approximation theorems for some specific real and complex-valued linear operators that are not positive. This is the first monograph in Statistical Approximation Theory and Fuzziness. The chapters are self-contained and several advanced courses can be taught. The research findings will be useful in various applications including applied and computational mathematics, stochastics, engineering, artificial intelligence, vision and machine learning. This monograph is directed to graduate students, researchers, practitioners and professors of all disciplines.

A description of 148 algorithms fundamental to number-theoretic computations, in particular for computations related to algebraic number theory, elliptic curves, primality testing and factoring. The first seven chapters guide readers to the heart of current research in computational algebraic number theory, including recent algorithms for computing class groups and units, as well as elliptic curve computations, while the last three chapters survey factoring and primality testing methods, including a detailed description of the number field sieve algorithm. The whole is rounded off with a description of available computer packages and some useful tables, backed by numerous exercises. Written by an authority in the field, and one with great practical and teaching experience, this is certain to become the standard and indispensable reference on the subject.

The proceedings represent the state of knowledge in the area of algorithmic differentiation (AD). The 31 contributed papers presented at the AD2012 conference cover the application of AD to many areas in science and engineering as well as aspects of AD theory and its implementation in tools. For all papers the referees, selected from the program committee and the greater community, as well as the editors have emphasized accessibility of the presented ideas also to non-AD experts. In the AD tools arena new implementations are introduced covering, for example, Java and graphical modeling environments or join the set of existing tools for Fortran. New developments in AD algorithms target the efficiency of matrix-operation derivatives, detection and exploitation of sparsity, partial separability, the treatment of nonsmooth functions, and other high-level mathematical aspects of the numerical computations to be differentiated. Applications stem from the Earth sciences, nuclear engineering, fluid dynamics, and chemistry, to name just a few. In many cases the applications in a given area of science or engineering share characteristics that require specific approaches to enable AD capabilities or provide an opportunity for efficiency gains in the derivative computation. The description of these characteristics and of the techniques for successfully using AD should make the proceedings a valuable source of information for users of AD tools.

This textbook presents a survey of research on boolean functions, circuits, parallel computation models, function algebras, and proof systems. Its main aim is to elucidate the structure of "fast" parallel computation. The complexity of parallel computation is emphasized through a variety of techniques ranging from finite combinatorics, probability theory and finite group theory to finite model theory and proof theory. Nonuniform computation models are studied in the form of boolean circuits; uniform ones in a variety of forms. Steps in the investigation of non-deterministic polynomial time are surveyed as is the complexity of various proof systems. The book will benefit advanced undergraduates and graduate students as well as researchers in the field of complexity theory.

In 1965 Juris Hartmanis and Richard E. Stearns published a paper "On the Computational Complexity of Algorithms." The field of complexity theory takes its name from this seminal paper and many of the major concepts and issues of complexity theory were introduced by Hartmanis in subsequent work. In honor of the contribution of Juris Hartmanis to the field of complexity theory, a special session of invited talks by Richard E. Stearns, Allan Borodin and Paul Young was held at the third annual meeting of the Structure in Complexity conference, and the first three chapters of this book are the final versions of these talks. They recall intellectual and professional trends in Hartmanis' contributions. All but one of the remainder of the chapters in this volume originated as a presentation at one of the recent meetings of the Structure in Complexity Theory Conference and appeared in preliminary form in the conference proceedings. In all, these expositions form an excellent description of much of contemporary complexity theory.

The ADI Model Problem presents the theoretical foundations of Alternating Direction Implicit (ADI) iteration for systems with both real and complex spectra and extends early work for real spectra into the complex plane with methods for computing optimum iteration parameters for both one and two variable problems. This book provides application of theory to the solution of boundary value problems and description of stable similarity reduction of a full matrix to low-band upper Hessenberg form, with application to computation of eigenvalues and solution of Lyapunov and Sylvester equations. Also included are MATLAB programs and numerical verification of theory and applications.

The revised edition of this book offers an extended overview of quantum walks and explains their role in building quantum algorithms, in particular search algorithms. Updated throughout, the book focuses on core topics including Grover's algorithm and the most important quantum walk models, such as the coined, continuous-time, and Szedgedy's quantum walk models. There is a new chapter describing the staggered quantum walk model. The chapter on spatial search algorithms has been rewritten to offer a more comprehensive approach and a new chapter describing the element distinctness algorithm has been added. There is a new appendix on graph theory highlighting the importance of graph theory to quantum walks. As before, the reader will benefit from the pedagogical elements of the book, which include exercises and references to deepen the reader's understanding, and guidelines for the use of computer programs to simulate the evolution of quantum walks. Review of the first edition: "The book is nicely written, the concepts are introduced naturally, and many meaningful connections between them are highlighted. The author proposes a series of exercises that help the reader get some working experience with the presented concepts, facilitating a better understanding. Each chapter ends with a discussion of further references, pointing the reader to major results on the topics presented in the respective chapter." - Florin Manea, zbMATH.

This unique book gives a comprehensive account of new mathematical tools used to solve polygon problems.

In the 20th and 21st centuries, many problems in mathematics, theoretical physics and theoretical chemistry - and more recently in molecular biology and bio-informatics - can be expressed as counting problems, in which specified graphs, or shapes, are counted.

One very special class of shapes is that of polygons. These are closed, connected paths in space. We usually sketch them in two-dimensions, but they can exist in any dimension. The typical questions asked include "how many are there of a given perimeter?," "how big is the average polygon of given perimeter?," and corresponding questions about the area or volume enclosed. That is to say "how many enclosing a given area?" and "how large is an average polygon of given area?" Simple though these questions are to pose, they are extraordinarily difficult to answer. They are important questions because of the application of polygon, and the related problems of polyomino and polycube counting, to phenomena occurring in the natural world, and also because the study of these problems has been responsible for the development of powerful new techniques in mathematics and mathematical physics, as well as in computer science. These new techniques then find application more broadly.

The book brings together chapters from many of the major contributors in the field. An introductory chapter giving the history of the problem is followed by fourteen further chapters describing particular aspects of the problem, and applications to biology, to surface phenomena and to computer enumeration methods.

In this thesis, the author develops for the first time an implementation methodology for arbitrary Gaussian operations using temporal-mode cluster states. The author also presents three experiments involving continuous-variable one-way quantum computations, where their non-classical nature is shown by observing entanglement at the outputs. The experimental basic structure of one-way quantum computation over two-mode input state is demonstrated by the controlled-Z gate and the optimum nonlocal gate experiments. Furthermore, the author proves that the operation can be controlled by the gain-tunable entangling gate experiment.

This work explores the scope and flexibility afforded by integrated quantum photonics, both in terms of practical problem-solving, and for the pursuit of fundamental science. The author demonstrates and fully characterizes a two-qubit quantum photonic chip, capable of arbitrary two-qubit state preparation. Making use of the unprecedented degree of reconfigurability afforded by this device, a novel variation on Wheeler's delayed choice experiment is implemented, and a new technique to obtain nonlocal statistics without a shared reference frame is tested. Also presented is a new algorithm for quantum chemistry, simulating the helium hydride ion. Finally, multiphoton quantum interference in a large Hilbert space is demonstrated, and its implications for computational complexity are examined.

The cryptosystems based on the Integer Factorization Problem (IFP), the Discrete Logarithm Problem (DLP) and the Elliptic Curve Discrete Logarithm Problem (ECDLP) are essentially the only three types of practical public-key cryptosystems in use. The security of these cryptosystems relies heavily on these three infeasible problems, as no polynomial-time algorithms exist for them so far. However, polynomial-time quantum algorithms for IFP, DLP and ECDLP do exist, provided that a practical quantum computer exists.

"Quantum Attacks on Public-Key Cryptosystems" presemts almost allknown quantum computing based attacks on public-key cryptosystems, with an emphasis on quantum algorithms for IFP, DLP, and ECDLP. It also discusses some quantum resistant cryptosystems to replace the IFP, DLP and ECDLP based cryptosystems.

This book is intended to be used either as a graduate text in computing, communications and mathematics, or as a basic reference in the field.

In this book the authors present new results on interpolation for nonmonotonic logics, abstract (function) independence, the Talmudic Kal Vachomer rule, and an equational solution of contrary-to-duty obligations. The chapter on formal construction is the conceptual core of the book, where the authors combine the ideas of several types of nonmonotonic logics and their analysis of 'natural' concepts into a formal logic, a special preferential construction that combines formal clarity with the intuitive advantages of Reiter defaults, defeasible inheritance, theory revision, and epistemic considerations. It is suitable for researchers in the area of computer science and mathematical logic.

In recent years the development of new classification and regression algorithms based on deep learning has led to a revolution in the fields of artificial intelligence, machine learning, and data analysis. The development of a theoretical foundation to guarantee the success of these algorithms constitutes one of the most active and exciting research topics in applied mathematics. This book presents the current mathematical understanding of deep learning methods from the point of view of the leading experts in the field. It serves both as a starting point for researchers and graduate students in computer science, mathematics, and statistics trying to get into the field and as an invaluable reference for future research.

The development of information processing systems requires models, calculi, and theories for the analysis of computations. Complex software systems are best constructed in a careful, systematic, and disciplined structuring of the development process. Starting from basic requirement specifications in which all the relevant details are formalized, the envisaged solution should be developed step by step by adding more and more details and giving evidence or formal proofs to show the correctness of the steps, until a description of a solution is obtained that has all the required properties. The Marktoberdorf Advanced Study Institute 1992 presented scientific highlights in approaches to the systematic study ofreliable software and hardware systems using functional, algebraic, and logical calculi. Leading scientists treated the specification, development, verification, and implementation of complex time-sensitive systems, such as signal processing systems, process control systems, and general software systems. The mathematical foundations of specification and refinement were carefully treated, and several formalisms for describing processes were introduced. Emphasis was put on application-oriented descriptions of signal processing systems with real-time dependencies. Formalisms for reasoning about distributed causality-based computations were presented and new styles of programming leading to shorter and more expressive notations were demonstrated. This book is based on the Institute, and gives an impressive demonstration of the state of the art and the essential progress in our formal abilities to specify, refine, verify, develop, and implement complex software systems including embeddedsystems and hard real-time dependent systems.

Domains are mathematical structures for information and approximation; they combine order-theoretic, logical, and topological ideas and provide a natural framework for modelling and reasoning about computation. The theory of domains has proved to be a useful tool for programming languages and other areas of computer science, and for applications in mathematics.
Included in this proceedings volume are selected papers of original research presented at the 2nd International Symposium on Domain Theory in Chengdu, China. With authors from France, Germany, Great Britain, Ireland, Mexico, and China, the papers cover the latest research in these sub-areas: domains and computation, topology and convergence, domains, lattices, and continuity, and representations of domains as event and logical structures.
Researchers and students in theoretical computer science should find this a valuable source of reference. The survey papers at the beginning should be of particular interest to those who wish to gain an understanding of some general ideas and techniques in this area.

This volume, the 7th volume in the DRUMS Handbook series, is part of the aftermath of the successful ESPRIT project DRUMS (Defeasible Reasoning and Uncertainty Management Systems) which took place in two stages from 1989- 1996. In the second stage (1993-1996) a work package was introduced devoted to the topics Reasoning and Dynamics, covering both the topics of "Dynamics of Reasoning," where reasoning is viewed as a process, and "Reasoning about Dynamics," which must be understood as pertaining to how both designers of and agents within dynamic systems may reason about these systems. The present volume presents work done in this context extended with some work done by outstanding researchers outside the project on related issues. While the previous volume in this series had its focus on the dynamics of reasoning pro cesses, the present volume is more focused on "reasoning about dynamics', viz. how (human and artificial) agents reason about (systems in) dynamic environments in order to control them. In particular we consider modelling frameworks and generic agent models for modelling these dynamic systems and formal approaches to these systems such as logics for agents and formal means to reason about agent based and compositional systems, and action & change more in general. We take this opportunity to mention that we have very pleasant recollections of the project, with its lively workshops and other meetings, with the many sites and researchers involved, both within and outside our own work package."

The book presents theory and algorithms for secure networked inference in the presence of Byzantines. It derives fundamental limits of networked inference in the presence of Byzantine data and designs robust strategies to ensure reliable performance for several practical network architectures. In particular, it addresses inference (or learning) processes such as detection, estimation or classification, and parallel, hierarchical, and fully decentralized (peer-to-peer) system architectures. Furthermore, it discusses a number of new directions and heuristics to tackle the problem of design complexity in these practical network architectures for inference.