The book covers various topics of computer algebra methods, algorithms and software applied to scientific computing. An important topic presented in the book, which may be of interest to researchers and engineers, is the application of computer algebra methods to the development of new efficient analytic and numerical solvers, both for ordinary and partial differential equations. A specific feature of the book is an intense use of advanced software systems such as Mathematica, Maple etc. for the solution of problems as outlined above and for the industrial application of computer algebra for simulation. The book will be useful for researchers and engineers who apply advanced computer algebra methods for the solution of their problems.

This book explores the two major elements of Hintikka's model of inquiry: underlying game theoretical motivations and the central role of questioning. The chapters build on the Hintikkan tradition extending Hintikka's model and present a wide variety of approaches to the philosophy of inquiry from different directions, ranging from erotetic logic to Lakatosian philosophy, from socio-epistemologic approaches to strategic reasoning and mathematical practice. Hintikka's theory of inquiry is a well-known example of a dynamic epistemic procedure. In an interrogative inquiry, the inquirer is given a theory and a question. He then tries to answer the question based on the theory by posing questions to nature or an oracle. The initial formulation of this procedure by Hintikka is rather broad and informal. This volume introduces a carefully selected responses to the issues discussed by Hintikka. The articles in the volume were contributed by various authors associated with a research project on Hintikka's interrogative theory of inquiry conducted in the Institut d'Histoire et de Philosophie des Sciences et des Techniques (IHPST) of Paris, including those who visited to share their insight.

Soft computing, as an engineering science, and statistics, as a classical branch of mathematics, emphasize different aspects of data analysis.
Soft computing focuses on obtaining working solutions quickly, accepting approximations and unconventional approaches. Its strength lies in its flexibility to create models that suit the needs arising in applications. In addition, it emphasizes the need for intuitive and interpretable models, which are tolerant to imprecision and uncertainty.
Statistics is more rigorous and focuses on establishing objective conclusions based on experimental data by analyzing the possible situations and their (relative) likelihood. It emphasizes the need for mathematical methods and tools to assess solutions and guarantee performance.
Combining the two fields enhances the robustness and generalizability of data analysis methods, while preserving the flexibility to solve real-world problems efficiently and intuitively.

The subject of Partial Differential Equations (PDEs) which first emerged in the 18th century holds an exciting and special position in the applications relating to the mathematical modelling of physical phenomena. The subject of PDEs has been developed by major names in Applied Mathematics such as Euler, Legendre, Laplace and Fourier and has applications to each and every physical phenomenon known to us e.g. fluid flow, elasticity, electricity and magnetism, weather forecasting and financial modelling. This book introduces the recent developments of PDEs in the field of Geometric Design particularly for computer based design and analysis involving the geometry of physical objects. Starting from the basic theory through to the discussion of practical applications the book describes how PDEs can be used in the area of Computer Aided Design and Simulation Based Design. Extensive examples with real life applications of PDEs in the area of Geometric Design are discussed in the book.

Weighted finite automata are classical nondeterministic finite automata in which the transitions carry weights. These weights may model, for example, the cost involved when executing a transition, the resources or time needed for this, or the probability or reliability of its successful execution. Weights can also be added to classical automata with infinite state sets like pushdown automata, and this extension constitutes the general concept of weighted automata. Since their introduction in the 1960s they have stimulated research in related areas of theoretical computer science, including formal language theory, algebra, logic, and discrete structures. Moreover, weighted automata and weighted context-free grammars have found application in natural-language processing, speech recognition, and digital image compression.

This book covers all the main aspects of weighted automata and formal power series methods, ranging from theory to applications. The contributors are the leading experts in their respective areas, and each chapter presents a detailed survey of the state of the art and pointers to future research. The chapters in Part I cover the foundations of the theory of weighted automata, specifically addressing semirings, power series, and fixed point theory. Part II investigates different concepts of weighted recognizability. Part III examines alternative types of weighted automata and various discrete structures other than words. Finally, Part IV deals with applications of weighted automata, including digital image compression, fuzzy languages, model checking, and natural-language processing.

Computer scientists and mathematicians will find this book an excellent survey and reference volume, and it will also be a valuable resource for students exploring this exciting research area.

This unique text/reference presents a fresh look at nonlinear processing through nonlinear eigenvalue analysis, highlighting how one-homogeneous convex functionals can induce nonlinear operators that can be analyzed within an eigenvalue framework. The text opens with an introduction to the mathematical background, together with a summary of classical variational algorithms for vision. This is followed by a focus on the foundations and applications of the new multi-scale representation based on non-linear eigenproblems. The book then concludes with a discussion of new numerical techniques for finding nonlinear eigenfunctions, and promising research directions beyond the convex case. Topics and features: introduces the classical Fourier transform and its associated operator and energy, and asks how these concepts can be generalized in the nonlinear case; reviews the basic mathematical notion, briefly outlining the use of variational and flow-based methods to solve image-processing and computer vision algorithms; describes the properties of the total variation (TV) functional, and how the concept of nonlinear eigenfunctions relate to convex functionals; provides a spectral framework for one-homogeneous functionals, and applies this framework for denoising, texture processing and image fusion; proposes novel ways to solve the nonlinear eigenvalue problem using special flows that converge to eigenfunctions; examines graph-based and nonlocal methods, for which a TV eigenvalue analysis gives rise to strong segmentation, clustering and classification algorithms; presents an approach to generalizing the nonlinear spectral concept beyond the convex case, based on pixel decay analysis; discusses relations to other branches of image processing, such as wavelets and dictionary based methods. This original work offers fascinating new insights into established signal processing techniques, integrating deep mathematical concepts from a range of different fields, which will be of great interest to all researchers involved with image processing and computer vision applications, as well as computations for more general scientific problems.

Towards Solid-State Quantum Repeaters: Ultrafast, Coherent Optical Control and Spin-Photon Entanglement in Charged InAs Quantum Dots summarizes several state-of-the-art coherent spin manipulation experiments in III-V quantum dots. Both high-fidelity optical manipulation, decoherence due to nuclear spins and the spin coherence extraction are discussed, as is the generation of entanglement between a single spin qubit and a photonic qubit. The experimental results are analyzed and discussed in the context of future quantum technologies, such as quantum repeaters. Single spins in optically active semiconductor host materials have emerged as leading candidates for quantum information processing (QIP). The quantum nature of the spin allows for encoding of stationary, memory quantum bits (qubits), and the relatively weak interaction with the host material preserves the spin coherence. On the other hand, optically active host materials permit direct interfacing with light, which can be used for all-optical qubit manipulation, and for efficiently mapping matter qubits into photonic qubits that are suited for long-distance quantum communication.

Developing algorithms for multi-dimensional Fourier transforms, this book presents results that yield highly efficient code on a variety of vector and parallel computers. By emphasising the unified basis for the many approaches to both one-dimensional and multidimensional Fourier transforms, this book not only clarifies the fundamental similarities, but also shows how to exploit the differences in optimising implementations. It will thus be of great interest not only to applied mathematicians and computer scientists, but also to seismologists, high-energy physicists, crystallographers, and electrical engineers working on signal and image processing.

There have been substantial developments in meshfree methods, particle methods, and generalized finite element methods since the mid 1990s. The growing interest in these methods is in part due to the fact that they offer extremely flexible numerical tools and can be interpreted in a number of ways. For instance, meshfree methods can be viewed as a natural extension of classical finite element and finite difference methods to scattered node configurations with no fixed connectivity. Furthermore, meshfree methods have a number of advantageous features that are especially attractive when dealing with multiscale phenomena: A-priori knowledge about the solution's particular local behavior can easily be introduced into the meshfree approximation space, and coarse scale approximations can be seamlessly refined by adding fine scale information. However, the implementation of meshfree methods and their parallelization also requires special attention, for instance with respect to numerical integration.

Dyadic (Walsh) analysis emerged as a new research area in applied mathematics and engineering in early seventies within attempts to provide answers to demands from practice related to application of spectral analysis of different classes of signals, including audio, video, sonar, and radar signals. In the meantime, it evolved in a mature mathematical discipline with fundamental results and important features providing basis for various applications. The book will provide fundamentals of the area through reprinting carefully selected earlier publications followed by overview of recent results concerning particular subjects in the area written by experts, most of them being founders of the field, and some of their followers. In this way, this first volume of the two volume book offers a rather complete coverage of the development of dyadic Walsh analysis, and provides a deep insight into its mathematical foundations necessary for consideration of generalizations and applications that are the subject of the second volume. The presented theory is quite sufficient to be a basis for further research in the subject area as well as to be applied in solving certain new problems or improving existing solutions for tasks in the areas which motivated development of the dyadic analysis.

Device-independent quantum cryptography is a method for exchanging secret messages over potentially insecure quantum communication channels, such as optical fibers. In contrast to conventional quantum cryptography, security is guaranteed even if the devices used by the communication partners, such as photon sources and detectors, deviate from their theoretical specifications. This is of high practical relevance, for attacks to current implementations of quantum cryptography exploit exactly such deviations. Device-independent cryptography is however technologically so demanding that it looked as if experimental realizations are out of reach. In her thesis, Rotem Arnon-Friedman presents powerful information-theoretic methods to prove the security of device-independent quantum cryptography. Based on them, she is able to establish security in a parameter regime that may be experimentally achievable in the near future. Rotem Arnon-Friedman's thesis thus provides the theoretical foundations for an experimental demonstration of device-independent quantum cryptography.

This book presents a comprehensive review of key distributed graph algorithms for computer network applications, with a particular emphasis on practical implementation. Topics and features: introduces a range of fundamental graph algorithms, covering spanning trees, graph traversal algorithms, routing algorithms, and self-stabilization; reviews graph-theoretical distributed approximation algorithms with applications in ad hoc wireless networks; describes in detail the implementation of each algorithm, with extensive use of supporting examples, and discusses their concrete network applications; examines key graph-theoretical algorithm concepts, such as dominating sets, and parameters for mobility and energy levels of nodes in wireless ad hoc networks, and provides a contemporary survey of each topic; presents a simple simulator, developed to run distributed algorithms; provides practical exercises at the end of each chapter.

This book is a comprehensive, unifying introduction to the field of mathematical analysis and the mathematics of computing. It develops the relevant theory at a modern level and it directly relates modern mathematical ideas to their diverse applications. The authors develop the whole theory. Starting with a simple axiom system for the real numbers, they then lay the foundations, developing the theory, exemplifying where it's applicable, in turn motivating further development of the theory. They progress from sets, structures, and numbers to metric spaces, continuous functions in metric spaces, linear normed spaces and linear mappings; and then differential calculus and its applications, the integral calculus, the gamma function, and linear integral operators. They then present important aspects of approximation theory, including numerical integration. The remaining parts of the book are devoted to ordinary differential equations, the discretization of operator equations, and numerical solutions of ordinary differential equations. This textbook contains many exercises of varying degrees of difficulty, suitable for self-study, and at the end of each chapter the authors present more advanced problems that shed light on interesting features, suitable for classroom seminars or study groups. It will be valuable for undergraduate and graduate students in mathematics, computer science, and related fields such as engineering. This is a rich field that has experienced enormous development in recent decades, and the book will also act as a reference for graduate students and practitioners who require a deeper understanding of the methodologies, techniques, and foundations.

This book provides readers with modern computational techniques for solving variety of problems from electrical, mechanical, civil and chemical engineering. Mathematical methods are presented in a unified manner, so they can be applied consistently to problems in applied electromagnetics, strength of materials, fluid mechanics, heat and mass transfer, environmental engineering, biomedical engineering, signal processing, automatic control and more.

This Volume discusses the underlying principles and analysis of the different concepts associated with an emerging socio-inspired optimization tool referred to as Cohort Intelligence (CI). CI algorithms have been coded in Matlab and are freely available from the link provided inside the book. The book demonstrates the ability of CI methodology for solving combinatorial problems such as Traveling Salesman Problem and Knapsack Problem in addition to real world applications from the healthcare, inventory, supply chain optimization and Cross-Border transportation. The inherent ability of handling constraints based on probability distribution is also revealed and proved using these problems.

The book comprises an assembly of benchmarks and examples for porous media mechanics collected over the last twenty years. Analysis of thermo-hydro-mechanical-chemical (THMC) processes is essential to many applications in environmental engineering, such as geological waste deposition, geothermal energy utilisation, carbon capture and storage, water resources management, hydrology, even climate chance. In order to assess the feasibility as well as the safety of geotechnical applications, process-based modelling is the only tool to put numbers, i.e. to quantify future scenarios. This charges a huge responsibility concerning the reliability of computational tools. Benchmarking is an appropriate methodology to verify the quality of modelling tools based on best practices. Moreover, benchmarking and code comparison foster community efforts. The benchmark book is part of the OpenGeoSys initiative - an open source project to share knowledge and experience in environmental analysis and scientific computation.

This book is an introduction into stochastic processes for physicists, biologists and financial analysts. Using an informal approach, all the necessary mathematical tools and techniques are covered, including the stochastic differential equations, mean values, probability distribution functions, stochastic integration and numerical modeling. Numerous examples of practical applications of the stochastic mathematics are considered in detail, ranging from physics to the financial theory. A reader with basic knowledge of the probability theory should have no difficulty in accessing the book content.

This textbook provides an accessible introduction to the most important features of Fortran 2008. Features: presents a complete discussion of all the basic features needed to write complete Fortran programs; makes extensive use of examples and case studies to illustrate the practical use of features of Fortran 08, and supplies simple problems for the reader; provides a detailed exploration of control constructs, modules, procedures, arrays, character strings, data structures and derived types, pointer variables, and object-oriented programming; includes coverage of such major new features in Fortran 08 as coarrays, submodules, parameterized derived types, and derived-type input and output; highlights the topic of modules as the framework for organizing data and procedures for a Fortran program; investigates the excellent input/output facilities available in Fortran; contains appendices listing the many intrinsic procedures and providing a brief informal syntax specification for the language.

This book is intended as an introduction to fuzzy algebraic hyperstructures. As the first in its genre, it includes a number of topics, most of which reflect the authors' past research and thus provides a starting point for future research directions. The book is organized in five chapters. The first chapter introduces readers to the basic notions of algebraic structures and hyperstructures. The second covers fuzzy sets, fuzzy groups and fuzzy polygroups. The following two chapters are concerned with the theory of fuzzy Hv-structures: while the third chapter presents the concept of fuzzy Hv-subgroup of Hv-groups, the fourth covers the theory of fuzzy Hv-ideals of Hv-rings. The final chapter discusses several connections between hypergroups and fuzzy sets, and includes a study on the association between hypergroupoids and fuzzy sets endowed with two membership functions. In addition to providing a reference guide to researchers, the book is also intended as textbook for undergraduate and graduate students.

The focus of these conference proceedings is on research, development, and applications in the fields of numerical geometry, scientific computing and numerical simulation, particularly in mesh generation and related problems. In addition, this year's special focus is on Voronoi diagrams and their applications, celebrating the 150th birthday of G.F. Voronoi. In terms of content, the book strikes a balance between engineering algorithms and mathematical foundations. It presents an overview of recent advances in numerical geometry, grid generation and adaptation in terms of mathematical foundations, algorithm and software development and applications. The specific topics covered include: quasi-conformal and quasi-isometric mappings, hyperelastic deformations, multidimensional generalisations of the equidistribution principle, discrete differential geometry, spatial and metric encodings, Voronoi-Delaunay theory for tilings and partitions, duality in mathematical programming and numerical geometry, mesh-based optimisation and optimal control methods. Further aspects examined include iterative solvers for variational problems and algorithm and software development. The applications of the methods discussed are multidisciplinary and include problems from mathematics, physics, biology, chemistry, material science, and engineering.

This book provides a detailed exposition of one of the most practical and popular methods of proving theorems in logic, called Natural Deduction. It is presented both historically and systematically. Also some combinations with other known proof methods are explored. The initial part of the book deals with Classical Logic, whereas the rest is concerned with systems for several forms of Modal Logics, one of the most important branches of modern logic, which has wide applicability.

Locally computable (NC0) functions are "simple" functions for which every bit of the output can be computed by reading a small number of bits of their input. The study of locally computable cryptography attempts to construct cryptographic functions that achieve this strong notion of simplicity and simultaneously provide a high level of security. Such constructions are highly parallelizable and they can be realized by Boolean circuits of constant depth.

This book establishes, for the first time, the possibility of local implementations for many basic cryptographic primitives such as one-way functions, pseudorandom generators, encryption schemes and digital signatures. It also extends these results to other stronger notions of locality, and addresses a wide variety of fundamental questions about local cryptography. The author's related thesis was honorably mentioned (runner-up) for the ACM Dissertation Award in 2007, and this book includes some expanded sections and proofs, and notes on recent developments.

The book assumes only a minimal background in computational complexity and cryptography and is therefore suitable for graduate students or researchers in related areas who are interested in parallel cryptography. It also introduces general techniques and tools which are likely to interest experts in the area.

This book provides an overview of the confluence of ideas in Turing's era and work and examines the impact of his work on mathematical logic and theoretical computer science. It combines contributions by well-known scientists on the history and philosophy of computability theory as well as on generalised Turing computability. By looking at the roots and at the philosophical and technical influence of Turing's work, it is possible to gather new perspectives and new research topics which might be considered as a continuation of Turing's working ideas well into the 21st century. The Stored-Program Universal Computer: Did Zuse Anticipate Turing and von Neumann?" is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com

A formal method is not the main engine of a development process, its contribution is to improve system dependability by motivating formalisation where useful. This book summarizes the results of the DEPLOY research project on engineering methods for dependable systems through the industrial deployment of formal methods in software development. The applications considered were in automotive, aerospace, railway, and enterprise information systems, and microprocessor design. The project introduced a formal method, Event-B, into several industrial organisations and built on the lessons learned to provide an ecosystem of better tools, documentation and support to help others to select and introduce rigorous systems engineering methods. The contributing authors report on these projects and the lessons learned. For the academic and research partners and the tool vendors, the project identified improvements required in the methods and supporting tools, while the industrial partners learned about the value of formal methods in general. A particular feature of the book is the frank assessment of the managerial and organisational challenges, the weaknesses in some current methods and supporting tools, and the ways in which they can be successfully overcome. The book will be of value to academic researchers, systems and software engineers developing critical systems, industrial managers, policymakers, and regulators.

This book describes the benefits that emerge when the fields of constraint programming and concurrency meet. On the one hand, constraints can be used in concurrency theory to increase the conciseness and the expressive power of concurrent languages from a pragmatic point of view. On the other hand, problems modeled by using constraints can be solved faster and more efficiently using a concurrent system. Both directions are explored providing two separate lines of development. Firstly the expressive power of a concurrent language is studied, namely Constraint Handling Rules, that supports constraints as a primitive construct. The features of this language which make it Turing powerful are shown. Then a framework is proposed to solve constraint problems that is intended to be deployed on a concurrent system. For the development of this framework the concurrent language Jolie following the Service Oriented paradigm is used. Based on this experience, an extension to Service Oriented Languages is also proposed in order to overcome some of their limitations and to improve the development of concurrent applications.