All traditional implementation techniques for functional languages fail to avoid useless repetition of work. They are not "optimal" in their implementation of sharing, often causing a catastrophic, exponential explosion in reduction time. Optimal reduction is an innovative graph reduction technique for functional expressions, introduced by Lamping in 1990, that solves the sharing problem. This work, the first on the subject, is a comprehensive account by two of its leading exponents. Practical implementation aspects are fully covered as are the mathematical underpinnings of the subject. The relationship to the pioneering work of Lévy and to Girard's more recent "Geometry of Interaction" are explored; optimal reduction is thereby revealed as a prime example of how a beautiful mathematical theory can lead to practical benefit. The book is essentially self-contained, requiring no more than basic familiarity with functional languages. It will be welcomed by graduate students and research workers in lambda calculus, functional programming or linear logic.

This book introduces the quantum mechanical framework to information retrieval scientists seeking a new perspective on foundational problems. As such, it concentrates on the main notions of the quantum mechanical framework and describes an innovative range of concepts and tools for modeling information representation and retrieval processes. The book is divided into four chapters. Chapter 1 illustrates the main modeling concepts for information retrieval (including Boolean logic, vector spaces, probabilistic models, and machine-learning based approaches), which will be examined further in subsequent chapters. Next, chapter 2 briefly explains the main concepts of the quantum mechanical framework, focusing on approaches linked to information retrieval such as interference, superposition and entanglement. Chapter 3 then reviews the research conducted at the intersection between information retrieval and the quantum mechanical framework. The chapter is subdivided into a number of topics, and each description ends with a section suggesting the most important reference resources. Lastly, chapter 4 offers suggestions for future research, briefly outlining the most essential and promising research directions to fully leverage the quantum mechanical framework for effective and efficient information retrieval systems. This book is especially intended for researchers working in information retrieval, database systems and machine learning who want to acquire a clear picture of the potential offered by the quantum mechanical framework in their own research area. Above all, the book offers clear guidance on whether, why and when to effectively use the mathematical formalism and the concepts of the quantum mechanical framework to address various foundational issues in information retrieval.

This book collects the revised selected proceedings of the First International Symposium in Molecular Logic and Computational Synthetic Biology ( MLCSB), held in Chile, Santiago, in December 2018. The volume contains 7 full revised papers along with 2 surveys from 19 submissions presented at the symposium. One of the goals of the MLCSB 2018 was to explore the potential of molecular logic frameworks to study the emerging behavioural patterns in biological networks, combining discrete, continuous and stochastic features, and resorting both to specific or general-purpose analysis and verification techniques.

Keeping students involved and actively learning is challenging. Instructors in computer science are aware of the cognitive value of modelling puzzles and often use logical puzzles as an efficient pedagogical instrument to engage students and develop problem-solving skills. This unique book is a comprehensive resource that offers teachers and students fun activities to teach and learn logic. It provides new, complete, and running formalisation in Propositional and First Order Logic for over 130 logical puzzles, including Sudoku-like puzzles, zebra-like puzzles, island of truth, lady and tigers, grid puzzles, strange numbers, or self-reference puzzles. Solving puzzles with theorem provers can be an effective cognitive incentive to motivate students to learn logic. They will find a ready-to-use format which illustrates how to model each puzzle, provides running implementations, and explains each solution. This concise and easy-to-follow textbook is a much-needed support tool for students willing to explore beyond the introductory level of learning logic and lecturers looking for examples to heighten student engagement in their computer science courses.

This unique text/reference provides an overview of crossbar-based interconnection networks, offering novel perspectives on these important components of high-performance, parallel-processor systems. A particular focus is placed on solutions to the blocking and scalability problems. Topics and features: introduces the fundamental concepts in interconnection networks in multi-processor systems, including issues of blocking, scalability, and crossbar networks; presents a classification of interconnection networks, and provides information on recognizing each of the networks; examines the challenges of blocking and scalability, and analyzes the different solutions that have been proposed; reviews a variety of different approaches to improve fault tolerance in multistage interconnection networks; discusses the scalable crossbar network, which is a non-blocking interconnection network that uses small-sized crossbar switches as switching elements. This invaluable work will be of great benefit to students, researchers and practitioners interested in computer networks, parallel processing and reliability engineering. The text is also essential reading for course modules on interconnection network design and reliability.

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.

This uniquely accessible book helps readers use CABology to solve real-world business problems and drive real competitive advantage. It provides reliable, concise information on the real benefits, usage and operationalization aspects of utilizing the "Trio Wave" of cloud, analytic and big data. Anyone who thinks that the game changing technology is slow paced needs to think again. This book opens readers' eyes to the fact that the dynamics of global technology and business are changing. Moreover, it argues that businesses must transform themselves in alignment with the Trio Wave if they want to survive and excel in the future. CABology focuses on the art and science of optimizing the business goals to deliver true value and benefits to the customer through cloud, analytic and big data. It offers business of all sizes a structured and comprehensive way of discovering the real benefits, usage and operationalization aspects of utilizing the Trio Wave.

Sparse grids are a popular tool for the numerical treatment of high-dimensional problems. Where classical numerical discretization schemes fail in more than three or four dimensions, sparse grids, in their different flavors, are frequently the method of choice. This volume of LNCSE presents selected papers from the proceedings of the fourth workshop on sparse grids and applications, and demonstrates once again the importance of this numerical discretization scheme. The articles present recent advances in the numerical analysis of sparse grids in connection with a range of applications including computational chemistry, computational fluid dynamics, and big data analytics, to name but a few.

This monograph proposes a new way of implementing interaction in logic. It also provides an elementary introduction to Constructive Type Theory (CTT). The authors equally emphasize basic ideas and finer technical details. In addition, many worked out exercises and examples will help readers to better understand the concepts under discussion. One of the chief ideas animating this study is that the dialogical understanding of definitional equality and its execution provide both a simple and a direct way of implementing the CTT approach within a game-theoretical conception of meaning. In addition, the importance of the play level over the strategy level is stressed, binding together the matter of execution with that of equality and the finitary perspective on games constituting meaning. According to this perspective the emergence of concepts are not only games of giving and asking for reasons (games involving Why-questions), they are also games that include moves establishing how it is that the reasons brought forward accomplish their explicative task. Thus, immanent reasoning games are dialogical games of Why and How.

This book constitutes the refereed proceedings of the 4th EAI International Conference on Industrial Networks and Intelligent Systems, INISCOM 2018, held in Da Nang, Vietnam, in August 2018. The 26 full papers were selected from 38 submissions and are organized thematically in tracks: Telecommunications Systems and Networks; Industrial Networks and Applications; Hardware and Software Design and Development; Information Processing and Data Analysis; Signal Processing; Security and Privacy.

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 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.

This book presents the refereed proceedings of the Twelfth International Conference on Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing that was held at Stanford University (California) in August 2016. These biennial conferences are major events for Monte Carlo and quasi-Monte Carlo researchers. The proceedings include articles based on invited lectures as well as carefully selected contributed papers on all theoretical aspects and applications of Monte Carlo and quasi-Monte Carlo methods. Offering information on the latest developments in these very active areas, this book is an excellent reference resource for theoreticians and practitioners interested in solving high-dimensional computational problems, arising in particular, in finance, statistics, computer graphics and the solution of PDEs.

This book presents two new decomposition methods to decompose a time series in intrinsic components of low and high frequencies. The methods are based on Singular Value Decomposition (SVD) of a Hankel matrix (HSVD). The proposed decomposition is used to improve the accuracy of linear and nonlinear auto-regressive models. Linear Auto-regressive models (AR, ARMA and ARIMA) and Auto-regressive Neural Networks (ANNs) have been found insufficient because of the highly complicated nature of some time series. Hybrid models are a recent solution to deal with non-stationary processes which combine pre-processing techniques with conventional forecasters, some pre-processing techniques broadly implemented are Singular Spectrum Analysis (SSA) and Stationary Wavelet Transform (SWT). Although the flexibility of SSA and SWT allows their usage in a wide range of forecast problems, there is a lack of standard methods to select their parameters. The proposed decomposition HSVD and Multilevel SVD are described in detail through time series coming from the transport and fishery sectors. Further, for comparison purposes, it is evaluated the forecast accuracy reached by SSA and SWT, both jointly with AR-based models and ANNs.

This book presents selected peer-reviewed contributions from the International Work-Conference on Time Series, ITISE 2017, held in Granada, Spain, September 18-20, 2017. It discusses topics in time series analysis and forecasting, including advanced mathematical methodology, computational intelligence methods for time series, dimensionality reduction and similarity measures, econometric models, energy time series forecasting, forecasting in real problems, online learning in time series as well as high-dimensional and complex/big data time series. The series of ITISE conferences provides a forum for scientists, engineers, educators and students to discuss the latest ideas and implementations in the foundations, theory, models and applications in the field of time series analysis and forecasting. It focuses on interdisciplinary and multidisciplinary research encompassing computer science, mathematics, statistics and econometrics.

This volume contains papers based on presentations at the "Nagoya Winter Workshop 2015: Reality and Measurement in Algebraic Quantum Theory (NWW 2015)", held in Nagoya, Japan, in March 2015. The foundations of quantum theory have been a source of mysteries, puzzles, and confusions, and have encouraged innovations in mathematical languages to describe, analyze, and delineate this wonderland. Both ontological and epistemological questions about quantum reality and measurement have been placed in the center of the mysteries explored originally by Bohr, Heisenberg, Einstein, and Schroedinger. This volume describes how those traditional problems are nowadays explored from the most advanced perspectives. It includes new research results in quantum information theory, quantum measurement theory, information thermodynamics, operator algebraic and category theoretical foundations of quantum theory, and the interplay between experimental and theoretical investigations on the uncertainty principle. This book is suitable for a broad audience of mathematicians, theoretical and experimental physicists, and philosophers of science.

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 brings together the latest findings on efficient solutions of multi/many-objective optimization problems from the leading researchers in the field. The focus is on solving real-world optimization problems using strategies ranging from evolutionary to hybrid frameworks, and involving various computation platforms. The topics covered include solution frameworks using evolutionary to hybrid models in application areas like Analytics, Cancer Research, Traffic Management, Networks and Communications, E-Governance, Quantum Technology, Image Processing, etc. As such, the book offers a valuable resource for all postgraduate students and researchers interested in exploring solution frameworks for multi/many-objective optimization problems.

This book contains more than 15 essays that explore issues in truth, existence, and explanation. It features cutting-edge research in the philosophy of mathematics and logic. Renowned philosophers, mathematicians, and younger scholars provide an insightful contribution to the lively debate in this interdisciplinary field of inquiry. The essays look at realism vs. anti-realism as well as inflationary vs. deflationary theories of truth. The contributors also consider mathematical fictionalism, structuralism, the nature and role of axioms, constructive existence, and generality. In addition, coverage also looks at the explanatory role of mathematics and the philosophical relevance of mathematical explanation. The book will appeal to a broad mathematical and philosophical audience. It contains work from FilMat, the Italian Network for the Philosophy of Mathematics. These papers collected here were also presented at their second international conference, held at the University of Chieti-Pescara, May 2016.

This book discusses recent advances and research in applied mathematics, statistics and their applications in computing. It features papers presented at the fourth conference in the series organized at the Indian Institute of Technology (Banaras Hindu University), Varanasi, India, on 9 - 11 January 2018 on areas of current interest, including operations research, soft computing, applied mathematical modelling, cryptology, and security analysis. The conference has emerged as a powerful forum, bringing together leading academic scientists, experts from industry, and researchers and offering a venue to discuss, interact and collaborate to stimulate the advancement of mathematics and its applications in computer science. The education of future consumers, users, producers, developers and researchers of mathematics and its applications is an important challenge in modern society, and as such, mathematics and its application in computer science are of vital significance to all spectrums of the community, as well as to mathematicians and computing professionals across different educational levels and disciplines. With contributions by leading international experts, this book motivates and creates interest among young researchers.

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.

This open access book covers all facets of entity-oriented search-where "search" can be interpreted in the broadest sense of information access-from a unified point of view, and provides a coherent and comprehensive overview of the state of the art. It represents the first synthesis of research in this broad and rapidly developing area. Selected topics are discussed in-depth, the goal being to establish fundamental techniques and methods as a basis for future research and development. Additional topics are treated at a survey level only, containing numerous pointers to the relevant literature. A roadmap for future research, based on open issues and challenges identified along the way, rounds out the book. The book is divided into three main parts, sandwiched between introductory and concluding chapters. The first two chapters introduce readers to the basic concepts, provide an overview of entity-oriented search tasks, and present the various types and sources of data that will be used throughout the book. Part I deals with the core task of entity ranking: given a textual query, possibly enriched with additional elements or structural hints, return a ranked list of entities. This core task is examined in a number of different variants, using both structured and unstructured data collections, and numerous query formulations. In turn, Part II is devoted to the role of entities in bridging unstructured and structured data. Part III explores how entities can enable search engines to understand the concepts, meaning, and intent behind the query that the user enters into the search box, and how they can provide rich and focused responses (as opposed to merely a list of documents)-a process known as semantic search. The final chapter concludes the book by discussing the limitations of current approaches, and suggesting directions for future research. Researchers and graduate students are the primary target audience of this book. A general background in information retrieval is sufficient to follow the material, including an understanding of basic probability and statistics concepts as well as a basic knowledge of machine learning concepts and supervised learning algorithms.

This book constitutes the refereed proceedings of the 11th International Workshop on Hybrid Metaheuristics, HM 2019, held in Concepcion, Chile, in January 2019. The 11 revised full papers and 5 short papers presented were carefully reviewed and selected from 23 submissions. The papers present hybridization strategies and explore the integration of new techniques coming from other areas of expertise. They cover a variety of topics such as low-level hybridization, high-level hybridization, portfolio techniques, cooperative search, and theoretical aspects of hybridization.

This monograph provides a modern introduction to the theory of quantales. First coined by C.J. Mulvey in 1986, quantales have since developed into a significant topic at the crossroads of algebra and logic, of notable interest to theoretical computer science. This book recasts the subject within the powerful framework of categorical algebra, showcasing its versatility through applications to C*- and MV-algebras, fuzzy sets and automata. With exercises and historical remarks at the end of each chapter, this self-contained book provides readers with a valuable source of references and hints for future research. This book will appeal to researchers across mathematics and computer science with an interest in category theory, lattice theory, and many-valued logic.

This book constitutes the thoroughly refereed workshop post-proceedings of the 16th International Workshop on Approximation and Online Algorithms, WAOA 2018, held in Helsinki, Finland, in August 2018 as part of ALGO 2018. The 19 revised full papers presented together with one invited paper in this book were carefully reviewed and selected from 44 submissions. Topics of interest for WAOA 2016 were: graph algorithms; inapproximability results; network design; packing and covering; paradigms for the design and analysis of approximation and online algorithms; parameterized complexity; scheduling problems; algorithmic game theory; algorithmic trading; coloring and partitioning; competitive analysis; computational advertising; computational finance; cuts and connectivity; geometric problems; mechanism design; resource augmentation; and real-world applications.