This book presents the best papers from the 1st International Conference on Mathematical Research for Blockchain Economy (MARBLE) 2019, held in Santorini, Greece. While most blockchain conferences and forums are dedicated to business applications, product development or Initial Coin Offering (ICO) launches, this conference focused on the mathematics behind blockchain to bridge the gap between practice and theory. Every year, thousands of blockchain projects are launched and circulated in the market, and there is a tremendous wealth of blockchain applications, from finance to healthcare, education, media, logistics and more. However, due to theoretical and technical barriers, most of these applications are impractical for use in a real-world business context. The papers in this book reveal the challenges and limitations, such as scalability, latency, privacy and security, and showcase solutions and developments to overcome them.

The five-volume set LNCS 11536, 11537, 11538, 11539, and 11540 constitutes the proceedings of the 19th International Conference on Computational Science, ICCS 2019, held in Faro, Portugal, in June 2019.The total of 65 full papers and 168 workshop papers presented in this book set were carefully reviewed and selected from 573 submissions (228 submissions to the main track and 345 submissions to the workshops). The papers were organized in topical sections named: Part I: ICCS Main Track Part II: ICCS Main Track; Track of Advances in High-Performance Computational Earth Sciences: Applications and Frameworks; Track of Agent-Based Simulations, Adaptive Algorithms and Solvers; Track of Applications of Matrix Methods in Artificial Intelligence and Machine Learning; Track of Architecture, Languages, Compilation and Hardware Support for Emerging and Heterogeneous Systems Part III: Track of Biomedical and Bioinformatics Challenges for Computer Science; Track of Classifier Learning from Difficult Data; Track of Computational Finance and Business Intelligence; Track of Computational Optimization, Modelling and Simulation; Track of Computational Science in IoT and Smart Systems Part IV: Track of Data-Driven Computational Sciences; Track of Machine Learning and Data Assimilation for Dynamical Systems; Track of Marine Computing in the Interconnected World for the Benefit of the Society; Track of Multiscale Modelling and Simulation; Track of Simulations of Flow and Transport: Modeling, Algorithms and Computation Part V: Track of Smart Systems: Computer Vision, Sensor Networks and Machine Learning; Track of Solving Problems with Uncertainties; Track of Teaching Computational Science; Poster Track ICCS 2019 Chapter "Comparing Domain-decomposition Methods for the Parallelization of Distributed Land Surface Models" is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.

The five-volume set LNCS 11536, 11537, 11538, 11539 and 11540 constitutes the proceedings of the 19th International Conference on Computational Science, ICCS 2019, held in Faro, Portugal, in June 2019.The total of 65 full papers and 168 workshop papers presented in this book set were carefully reviewed and selected from 573 submissions (228 submissions to the main track and 345 submissions to the workshops). The papers were organized in topical sections named: Part I: ICCS Main Track Part II: ICCS Main Track; Track of Advances in High-Performance Computational Earth Sciences: Applications and Frameworks; Track of Agent-Based Simulations, Adaptive Algorithms and Solvers; Track of Applications of Matrix Methods in Artificial Intelligence and Machine Learning; Track of Architecture, Languages, Compilation and Hardware Support for Emerging and Heterogeneous Systems Part III: Track of Biomedical and Bioinformatics Challenges for Computer Science; Track of Classifier Learning from Difficult Data; Track of Computational Finance and Business Intelligence; Track of Computational Optimization, Modelling and Simulation; Track of Computational Science in IoT and Smart Systems Part IV: Track of Data-Driven Computational Sciences; Track of Machine Learning and Data Assimilation for Dynamical Systems; Track of Marine Computing in the Interconnected World for the Benefit of the Society; Track of Multiscale Modelling and Simulation; Track of Simulations of Flow and Transport: Modeling, Algorithms and Computation Part V: Track of Smart Systems: Computer Vision, Sensor Networks and Machine Learning; Track of Solving Problems with Uncertainties; Track of Teaching Computational Science; Poster Track ICCS 2019 Chapter "Comparing Domain-decomposition Methods for the Parallelization of Distributed Land Surface Models" is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.

The five-volume set LNCS 11536, 11537, 11538, 11539 and 11540 constitutes the proceedings of the 19th International Conference on Computational Science, ICCS 2019, held in Faro, Portugal, in June 2019.The total of 65 full papers and 168 workshop papers presented in this book set were carefully reviewed and selected from 573 submissions (228 submissions to the main track and 345 submissions to the workshops). The papers were organized in topical sections named: Part I: ICCS Main Track Part II: ICCS Main Track; Track of Advances in High-Performance Computational Earth Sciences: Applications and Frameworks; Track of Agent-Based Simulations, Adaptive Algorithms and Solvers; Track of Applications of Matrix Methods in Artificial Intelligence and Machine Learning; Track of Architecture, Languages, Compilation and Hardware Support for Emerging and Heterogeneous Systems Part III: Track of Biomedical and Bioinformatics Challenges for Computer Science; Track of Classifier Learning from Difficult Data; Track of Computational Finance and Business Intelligence; Track of Computational Optimization, Modelling and Simulation; Track of Computational Science in IoT and Smart Systems Part IV: Track of Data-Driven Computational Sciences; Track of Machine Learning and Data Assimilation for Dynamical Systems; Track of Marine Computing in the Interconnected World for the Benefit of the Society; Track of Multiscale Modelling and Simulation; Track of Simulations of Flow and Transport: Modeling, Algorithms and Computation Part V: Track of Smart Systems: Computer Vision, Sensor Networks and Machine Learning; Track of Solving Problems with Uncertainties; Track of Teaching Computational Science; Poster Track ICCS 2019 Chapter "Comparing Domain-decomposition Methods for the Parallelization of Distributed Land Surface Models" is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.

The five-volume set LNCS 11536, 11537, 11538, 11539, and 11540 constitutes the proceedings of the 19th International Conference on Computational Science, ICCS 2019, held in Faro, Portugal, in June 2019. The total of 65 full papers and 168 workshop papers presented in this book set were carefully reviewed and selected from 573 submissions (228 submissions to the main track and 345 submissions to the workshops). The papers were organized in topical sections named: Part I: ICCS Main Track Part II: ICCS Main Track; Track of Advances in High-Performance Computational Earth Sciences: Applications and Frameworks; Track of Agent-Based Simulations, Adaptive Algorithms and Solvers; Track of Applications of Matrix Methods in Artificial Intelligence and Machine Learning; Track of Architecture, Languages, Compilation and Hardware Support for Emerging and Heterogeneous Systems Part III: Track of Biomedical and Bioinformatics Challenges for Computer Science; Track of Classifier Learning from Difficult Data; Track of Computational Finance and Business Intelligence; Track of Computational Optimization, Modelling and Simulation; Track of Computational Science in IoT and Smart Systems Part IV: Track of Data-Driven Computational Sciences; Track of Machine Learning and Data Assimilation for Dynamical Systems; Track of Marine Computing in the Interconnected World for the Benefit of the Society; Track of Multiscale Modelling and Simulation; Track of Simulations of Flow and Transport: Modeling, Algorithms and Computation Part V: Track of Smart Systems: Computer Vision, Sensor Networks and Machine Learning; Track of Solving Problems with Uncertainties; Track of Teaching Computational Science; Poster Track ICCS 2019 Chapter "Comparing Domain-decomposition Methods for the Parallelization of Distributed Land Surface Models" is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.

This book constitutes the proceedings of the 7th International Conference on Scale Space and Variational Methods in Computer Vision, SSVM 2019, held in Hofgeismar, Germany, in June/July 2019. The 44 papers included in this volume were carefully reviewed and selected for inclusion in this book. They were organized in topical sections named: 3D vision and feature analysis; inpainting, interpolation and compression; inverse problems in imaging; optimization methods in imaging; PDEs and level-set methods; registration and reconstruction; scale-space methods; segmentation and labeling; and variational methods.

This book explores internet applications in which a crucial role is played by classification, such as spam filtering, recommender systems, malware detection, intrusion detection and sentiment analysis. It explains how such classification problems can be solved using various statistical and machine learning methods, including K nearest neighbours, Bayesian classifiers, the logit method, discriminant analysis, several kinds of artificial neural networks, support vector machines, classification trees and other kinds of rule-based methods, as well as random forests and other kinds of classifier ensembles. The book covers a wide range of available classification methods and their variants, not only those that have already been used in the considered kinds of applications, but also those that have the potential to be used in them in the future. The book is a valuable resource for post-graduate students and professionals alike.

This book contains the refereed proceedings of the 14th International Symposium on Mathematical Morphology, ISMM 2019, held in Saarbrucken, Germany, in July 2019. The 40 revised full papers presented together with one invited talk were carefully reviewed and selected from 54 submissions. The papers are organized in topical sections on Theory, Discrete Topology and Tomography, Trees and Hierarchies, Multivariate Morphology, Computational Morphology, Machine Learning, Segmentation, Applications in Engineering, and Applications in (Bio)medical Imaging.

This book constitutes the refereed proceedings of the 8th International Conference on Algebraic Informatics, CAI 2019, held in Nis, Serbia, in June/July 2019. The 20 revised papers presented were carefully reviewed and selected from 35 submissions. The papers present research at the intersection of theoretical computer science, algebra, and related areas. They report original unpublished research and cover a broad range of topics from automata theory and logic, cryptography and coding theory, computer algebra, design theory, natural and quantum computation, and related areas.

This book presents an original combination of three well-known methodological approaches for nonlinear data analysis: recurrence, networks, and fuzzy logic. After basic concepts of these three approaches are introduced, this book presents recently developed methods known as fuzzy recurrence plots and fuzzy recurrence networks. Computer programs written in MATLAB, which implement the basic algorithms, are included to facilitate the understanding of the developed ideas. Several applications of these techniques to biomedical problems, ranging from cancer and neurodegenerative disease to depression, are illustrated to show the potential of fuzzy recurrence methods. This book opens a new door to theorists in complex systems science as well as specialists in medicine, biology, engineering, physics, computer science, geosciences, and social economics to address issues in experimental nonlinear signal and data processing.

This book presents the state of the art in the fields of formal logic pioneered by Graham Priest. It includes advanced technical work on the model and proof theories of paraconsistent logic, in contributions from top scholars in the field. Graham Priest's research has had a considerable influence on the field of philosophical logic, especially with respect to the themes of dialetheism-the thesis that there exist true but inconsistent sentences-and paraconsistency-an account of deduction in which contradictory premises do not entail the truth of arbitrary sentences. Priest's work has regularly challenged researchers to reappraise many assumptions about rationality, ontology, and truth. This book collects original research by some of the most esteemed scholars working in philosophical logic, whose contributions explore and appraise Priest's work on logical approaches to problems in philosophy, linguistics, computation, and mathematics. They provide fresh analyses, critiques, and applications of Priest's work and attest to its continued relevance and topicality. The book also includes Priest's responses to the contributors, providing a further layer to the development of these themes .

This book bridges the gaps between logic, mathematics and computer science by delving into the theory of well-quasi orders, also known as wqos. This highly active branch of combinatorics is deeply rooted in and between many fields of mathematics and logic, including proof theory, commutative algebra, braid groups, graph theory, analytic combinatorics, theory of relations, reverse mathematics and subrecursive hierarchies. As a unifying concept for slick finiteness or termination proofs, wqos have been rediscovered in diverse contexts, and proven to be extremely useful in computer science. The book introduces readers to the many facets of, and recent developments in, wqos through chapters contributed by scholars from various fields. As such, it offers a valuable asset for logicians, mathematicians and computer scientists, as well as scholars and students.

This book is dedicated to the systematization and development of models, methods, and algorithms for queuing systems with correlated arrivals. After first setting up the basic tools needed for the study of queuing theory, the authors concentrate on complicated systems: multi-server systems with phase type distribution of service time or single-server queues with arbitrary distribution of service time or semi-Markovian service. They pay special attention to practically important retrial queues, tandem queues, and queues with unreliable servers. Mathematical models of networks and queuing systems are widely used for the study and optimization of various technical, physical, economic, industrial, and administrative systems, and this book will be valuable for researchers, graduate students, and practitioners in these domains.

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.

The 2017 PIMS-CRM Summer School in Probability was held at the Pacific Institute for the Mathematical Sciences (PIMS) at the University of British Columbia in Vancouver, Canada, during June 5-30, 2017. It had 125 participants from 20 different countries, and featured two main courses, three mini-courses, and twenty-nine lectures. The lecture notes contained in this volume provide introductory accounts of three of the most active and fascinating areas of research in modern probability theory, especially designed for graduate students entering research: Scaling limits of random trees and random graphs (Christina Goldschmidt) Lectures on the Ising and Potts models on the hypercubic lattice (Hugo Duminil-Copin) Extrema of the two-dimensional discrete Gaussian free field (Marek Biskup) Each of these contributions provides a thorough introduction that will be of value to beginners and experts alike.

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 systematically addresses the design and analysis of efficient techniques for independent random sampling. Both general-purpose approaches, which can be used to generate samples from arbitrary probability distributions, and tailored techniques, designed to efficiently address common real-world practical problems, are introduced and discussed in detail. In turn, the monograph presents fundamental results and methodologies in the field, elaborating and developing them into the latest techniques. The theory and methods are illustrated with a varied collection of examples, which are discussed in detail in the text and supplemented with ready-to-run computer code. The main problem addressed in the book is how to generate independent random samples from an arbitrary probability distribution with the weakest possible constraints or assumptions in a form suitable for practical implementation. The authors review the fundamental results and methods in the field, address the latest methods, and emphasize the links and interplay between ostensibly diverse techniques.

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 book presents a systematic overview on partition function form games: a game form in cooperative game theory to integrate externalities for various applications. Cooperative game theory has been immensely useful to study a wide range of issues, but the standard approaches ignore the side effects of cooperation. Recently interest shifted to problems where externalities play the main roles such as models of cooperation in market competition or the shared use of public resources. Such problems require richer models that can explicitly evaluate the side-effects of cooperation. In partition function form games the value of cooperation depends on the outsiders' actions. A recent surge of interest driven by applications has made results very fragmented. This book offers an accessible, yet comprehensive and systematic study of properties, solutions and applications of partition function games surveying both theoretical results and their applications. It assembles a survey of existing research and smaller original results as well as original interpretations and comparisons. The book is self-contained and accessible for readers with little or no knowledge of cooperative game theory.

This book is published open access under a CC BY 4.0 license. This book presents computer programming as a key method for solving mathematical problems. This second edition of the well-received book has been extensively revised: All code is now written in Python version 3.6 (no longer version 2.7). In addition, the two first chapters of the previous edition have been extended and split up into five new chapters, thus expanding the introduction to programming from 50 to 150 pages. Throughout the book, the explanations provided are now more detailed, previous examples have been modified, and new sections, examples and exercises have been added. Also, a number of small errors have been corrected. The book was inspired by the Springer book TCSE 6: A Primer on Scientific Programming with Python (by Langtangen), but the style employed is more accessible and concise, in keeping with the needs of engineering students. The book outlines the shortest possible path from no previous experience with programming to a set of skills that allows students to write simple programs for solving common mathematical problems with numerical methods in the context of engineering and science courses. The emphasis is on generic algorithms, clean program design, the use of functions, and automatic tests for verification.

This book offers an introduction to applications prompted by tensor analysis, especially by the spectral tensor theory developed in recent years. It covers applications of tensor eigenvalues in multilinear systems, exponential data fitting, tensor complementarity problems, and tensor eigenvalue complementarity problems. It also addresses higher-order diffusion tensor imaging, third-order symmetric and traceless tensors in liquid crystals, piezoelectric tensors, strong ellipticity for elasticity tensors, and higher-order tensors in quantum physics. This book is a valuable reference resource for researchers and graduate students who are interested in applications of tensor eigenvalues.

In a fragment entitled Elementa Nova Matheseos Universalis (1683?) Leibniz writes "the mathesis [...] shall deliver the method through which things that are conceivable can be exactly determined"; in another fragment he takes the mathesis to be "the science of all things that are conceivable." Leibniz considers all mathematical disciplines as branches of the mathesis and conceives the mathesis as a general science of forms applicable not only to magnitudes but to every object that exists in our imagination, i.e. that is possible at least in principle. As a general science of forms the mathesis investigates possible relations between "arbitrary objects" ("objets quelconques"). It is an abstract theory of combinations and relations among objects whatsoever. In 1810 the mathematician and philosopher Bernard Bolzano published a booklet entitled Contributions to a Better-Grounded Presentation of Mathematics. There is, according to him, a certain objective connection among the truths that are germane to a certain homogeneous field of objects: some truths are the "reasons" ("Grunde") of others, and the latter are "consequences" ("Folgen") of the former. The reason-consequence relation seems to be the counterpart of causality at the level of a relation between true propositions. Arigorous proof is characterized in this context as a proof that shows the reason of the proposition that is to be proven. Requirements imposed on rigorous proofs seem to anticipate normalization results in current proof theory. The contributors of Mathesis Universalis, Computability and Proof, leading experts in the fields of computer science, mathematics, logic and philosophy, show the evolution of these and related ideas exploring topics in proof theory, computability theory, intuitionistic logic, constructivism and reverse mathematics, delving deeply into a contextual examination of the relationship between mathematical rigor and demands for simplification.