This book features more than 20 papers that celebrate the work of Hajnal Andreka and Istvan Nemeti. It illustrates an interaction between developing and applying mathematical logic. The papers offer new results as well as surveys in areas influenced by these two outstanding researchers. They also provide details on the after-life of some of their initiatives. Computer science connects the papers in the first part of the book. The second part concentrates on algebraic logic. It features a range of papers that hint at the intricate many-way connections between logic, algebra, and geometry. The third part explores novel applications of logic in relativity theory, philosophy of logic, philosophy of physics and spacetime, and methodology of science. They include such exciting subjects as time travelling in emergent spacetime. The short autobiographies of Hajnal Andreka and Istvan Nemeti at the end of the book describe an adventurous journey from electric engineering and Maxwell's equations to a complex system of computer programs for designing Hungary's electric power system, to exploring and contributing deep results to Tarskian algebraic logic as the deepest core theory of such questions, then on to applications of the results in such exciting new areas as relativity theory in order to rejuvenate logic itself.

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 fifth 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 uncertainty quantification, plasma physics simulations, and computational chemistry, to name but a few.

Master Bayesian Inference through Practical Examples and Computation-Without Advanced Mathematical Analysis Bayesian methods of inference are deeply natural and extremely powerful. However, most discussions of Bayesian inference rely on intensely complex mathematical analyses and artificial examples, making it inaccessible to anyone without a strong mathematical background. Now, though, Cameron Davidson-Pilon introduces Bayesian inference from a computational perspective, bridging theory to practice-freeing you to get results using computing power. Bayesian Methods for Hackers illuminates Bayesian inference through probabilistic programming with the powerful PyMC language and the closely related Python tools NumPy, SciPy, and Matplotlib. Using this approach, you can reach effective solutions in small increments, without extensive mathematical intervention. Davidson-Pilon begins by introducing the concepts underlying Bayesian inference, comparing it with other techniques and guiding you through building and training your first Bayesian model. Next, he introduces PyMC through a series of detailed examples and intuitive explanations that have been refined after extensive user feedback. You'll learn how to use the Markov Chain Monte Carlo algorithm, choose appropriate sample sizes and priors, work with loss functions, and apply Bayesian inference in domains ranging from finance to marketing. Once you've mastered these techniques, you'll constantly turn to this guide for the working PyMC code you need to jumpstart future projects. Coverage includes * Learning the Bayesian "state of mind" and its practical implications * Understanding how computers perform Bayesian inference * Using the PyMC Python library to program Bayesian analyses * Building and debugging models with PyMC * Testing your model's "goodness of fit" * Opening the "black box" of the Markov Chain Monte Carlo algorithm to see how and why it works * Leveraging the power of the "Law of Large Numbers" * Mastering key concepts, such as clustering, convergence, autocorrelation, and thinning * Using loss functions to measure an estimate's weaknesses based on your goals and desired outcomes * Selecting appropriate priors and understanding how their influence changes with dataset size * Overcoming the "exploration versus exploitation" dilemma: deciding when "pretty good" is good enough * Using Bayesian inference to improve A/B testing * Solving data science problems when only small amounts of data are available Cameron Davidson-Pilon has worked in many areas of applied mathematics, from the evolutionary dynamics of genes and diseases to stochastic modeling of financial prices. His contributions to the open source community include lifelines, an implementation of survival analysis in Python. Educated at the University of Waterloo and at the Independent University of Moscow, he currently works with the online commerce leader Shopify.

This new edition continues to serve as a comprehensive guide to modern and classical methods of statistical computing. The book is comprised of four main parts spanning the field: OptimizationIntegration and SimulationBootstrappingDensity Estimation and Smoothing

Within these sections, each chapter includes a comprehensive introduction and step-by-step implementation summaries to accompany the explanations of key methods. The new edition includes updated coverage and existing topics as well as new topics such as adaptive MCMC and bootstrapping for correlated data. The book website now includes comprehensive R code for the entire book. There are extensive exercises, real examples, and helpful insights about how to use the methods in practice.

This book presents a complete and accurate study of arithmetic and algebraic circuits. The first part offers a review of all important basic concepts: it describes simple circuits for the implementation of some basic arithmetic operations; it introduces theoretical basis for residue number systems; and describes some fundamental circuits for implementing the main modular operations that will be used in the text. Moreover, the book discusses floating-point representation of real numbers and the IEEE 754 standard. The second and core part of the book offers a deep study of arithmetic circuits and specific algorithms for their implementation. It covers the CORDIC algorithm, and optimized arithmetic circuits recently developed by the authors for adders and subtractors, as well as multipliers, dividers and special functions. It describes the implementation of basic algebraic circuits, such as LFSRs and cellular automata. Finally, it offers a complete study of Galois fields, showing some exemplary applications and discussing the advantages in comparison to other methods. This dense, self-contained text provides students, researchers and engineers, with extensive knowledge on and a deep understanding of arithmetic and algebraic circuits and their implementation.

Collecting data is relatively easy, but turning raw information into something useful requires that you know how to extract precisely what you need. With this insightful book, intermediate to experienced programmers interested in data analysis will learn techniques for working with data in a business environment. You'll learn how to look at data to discover what it contains, how to capture those ideas in conceptual models, and then feed your understanding back into the organization through business plans, metrics dashboards, and other applications.

Along the way, you'll experiment with concepts through hands-on workshops at the end of each chapter. Above all, you'll learn how to think about the results you want to achieve -- rather than rely on tools to think for you.Use graphics to describe data with one, two, or dozens of variablesDevelop conceptual models using back-of-the-envelope calculations, as well asscaling and probability argumentsMine data with computationally intensive methods such as simulation and clusteringMake your conclusions understandable through reports, dashboards, and other metrics programsUnderstand financial calculations, including the time-value of moneyUse dimensionality reduction techniques or predictive analytics to conquer challenging data analysis situationsBecome familiar with different open source programming environments for data analysis

"Finally, a concise reference for understanding how to conquer piles of data."--Austin King, Senior Web Developer, Mozilla

"An indispensable text for aspiring data scientists."--Michael E. Driscoll, CEO/Founder, Dataspora

Although numerical approximation and statistical inference are traditionally covered as entirely separate subjects, they are intimately connected through the common purpose of making estimations with partial information. This book explores these connections from a game and decision theoretic perspective, showing how they constitute a pathway to developing simple and general methods for solving fundamental problems in both areas. It illustrates these interplays by addressing problems related to numerical homogenization, operator adapted wavelets, fast solvers, and Gaussian processes. This perspective reveals much of their essential anatomy and greatly facilitates advances in these areas, thereby appearing to establish a general principle for guiding the process of scientific discovery. This book is designed for graduate students, researchers, and engineers in mathematics, applied mathematics, and computer science, and particularly researchers interested in drawing on and developing this interface between approximation, inference, and learning.

Visualize and build deep learning models with 3D data using PyTorch3D and other Python frameworks to conquer real-world application challenges with ease Key Features Understand 3D data processing with rendering, PyTorch optimization, and heterogeneous batching Implement differentiable rendering concepts with practical examples Discover how you can ease your work with the latest 3D deep learning techniques using PyTorch3D Book DescriptionWith this hands-on guide to 3D deep learning, developers working with 3D computer vision will be able to put their knowledge to work and get up and running in no time. Complete with step-by-step explanations of essential concepts and practical examples, this book lets you explore and gain a thorough understanding of state-of-the-art 3D deep learning. You'll see how to use PyTorch3D for basic 3D mesh and point cloud data processing, including loading and saving ply and obj files, projecting 3D points into camera coordination using perspective camera models or orthographic camera models, rendering point clouds and meshes to images, and much more. As you implement some of the latest 3D deep learning algorithms, such as differential rendering, Nerf, synsin, and mesh RCNN, you'll realize how coding for these deep learning models becomes easier using the PyTorch3D library. By the end of this deep learning book, you'll be ready to implement your own 3D deep learning models confidently. What you will learn Develop 3D computer vision models for interacting with the environment Get to grips with 3D data handling with point clouds, meshes, ply, and obj file format Work with 3D geometry, camera models, and coordination and convert between them Understand concepts of rendering, shading, and more with ease Implement differential rendering for many 3D deep learning models Advanced state-of-the-art 3D deep learning models like Nerf, synsin, mesh RCNN Who this book is forThis book is for beginner to intermediate-level machine learning practitioners, data scientists, ML engineers, and DL engineers who are looking to become well-versed with computer vision techniques using 3D data.

This book presents best selected research papers presented at the Thirteenth International Conference on Applied Mathematics and Mechanics in the Aerospace Industry (AMMAI 2020), held from September 6 to September 13, 2020, at the Alushta Health and Educational Center (The Republic of Crimea). The book is dedicated to solving actual problems of applied mechanics using modern computer technology including smart paradigms. Physical and mathematical models, numerical methods, computational algorithms, and software complexes are discussed, which allow to carry out high-precision mathematical modeling in fluid, gas, and plasma mechanics, in general mechanics, deformable solid mechanics, in strength, destruction and safety of structures, etc. Technologies and software systems that provide effective solutions to the problems at various multi-scale levels are considered. Special attention is paid to the training of highly qualified specialists for the aviation and space industry. The book is recommended for specialists in the field of applied mathematics and mechanics, mathematical modeling, information technologies, and developers of modern applied software systems.

This book presents essential concepts of traditional Flower Pollination Algorithm (FPA) and its recent variants and also its application to find optimal solution for a variety of real-world engineering and medical problems. Swarm intelligence-based meta-heuristic algorithms are extensively implemented to solve a variety of real-world optimization problems due to its adaptability and robustness. FPA is one of the most successful swarm intelligence procedures developed in 2012 and extensively used in various optimization tasks for more than a decade. The mathematical model of FPA is quite straightforward and easy to understand and enhance, compared to other swarm approaches. Hence, FPA has attracted attention of researchers, who are working to find the optimal solutions in variety of domains, such as N-dimensional numerical optimization, constrained/unconstrained optimization, and linear/nonlinear optimization problems. Along with the traditional bat algorithm, the enhanced versions of FPA are also considered to solve a variety of optimization problems in science, engineering, and medical applications.

This two-volume set LNCS 13398 and LNCS 13399 constitutes the refereed proceedings of the 17th International Conference on Parallel Problem Solving from Nature, PPSN 2022, held in Dortmund, Germany, in September 2022.The 87 revised full papers were carefully reviewed and selected from numerous submissions. The conference presents a study of computing methods derived from natural models. Amorphous Computing, Artificial Life, Artificial Ant Systems, Artificial Immune Systems, Artificial Neural Networks, Cellular Automata, Evolutionary Computation, Swarm Computing, Self-Organizing Systems, Chemical Computation, Molecular Computation, Quantum Computation, Machine Learning, and Artificial Intelligence approaches using Natural Computing methods are just some of the topics covered in this field.

This book is intended as a study aid for the finite element method. Based on the free computer algebra system Maxima, we offer routines to symbolically or numerically solve problems from the context of two-dimensional problems. For this rather advanced topic, classical 'hand calculations' are difficult to perform and the incorporation of a computer algebra system is a convenient approach to handle, for example, larger matrix operations. The mechanical theories focus on the classical two-dimensional structural elements, i.e., plane elements, thin or classical plates, and thick or shear deformable plate elements. The use of a computer algebra system and the incorporated functions, e.g., for matrix operations, allows to focus more on the methodology of the finite element method and not on standard procedures. Furthermore, we offer a graphical user interface (GUI) to facilitate the model definition. Thus, the user may enter the required definitions in a source code manner directly in wxMaxima or use the GUI which is able to execute wxMaxime to perform the calculations.

Machine Learning, a vital and core area of artificial intelligence (AI), is propelling the AI field ever further and making it one of the most compelling areas of computer science research. This textbook offers a comprehensive and unbiased introduction to almost all aspects of machine learning, from the fundamentals to advanced topics. It consists of 16 chapters divided into three parts: Part 1 (Chapters 1-3) introduces the fundamentals of machine learning, including terminology, basic principles, evaluation, and linear models; Part 2 (Chapters 4-10) presents classic and commonly used machine learning methods, such as decision trees, neural networks, support vector machines, Bayesian classifiers, ensemble methods, clustering, dimension reduction and metric learning; Part 3 (Chapters 11-16) introduces some advanced topics, covering feature selection and sparse learning, computational learning theory, semi-supervised learning, probabilistic graphical models, rule learning, and reinforcement learning. Each chapter includes exercises and further reading, so that readers can explore areas of interest. The book can be used as an undergraduate or postgraduate textbook for computer science, computer engineering, electrical engineering, data science, and related majors. It is also a useful reference resource for researchers and practitioners of machine learning.

This textbook introduces enumerative combinatorics through the framework of formal languages and bijections. By starting with elementary operations on words and languages, the authors paint an insightful, unified picture for readers entering the field. Numerous concrete examples and illustrative metaphors motivate the theory throughout, while the overall approach illuminates the important connections between discrete mathematics and theoretical computer science. Beginning with the basics of formal languages, the first chapter quickly establishes a common setting for modeling and counting classical combinatorial objects and constructing bijective proofs. From here, topics are modular and offer substantial flexibility when designing a course. Chapters on generating functions and partitions build further fundamental tools for enumeration and include applications such as a combinatorial proof of the Lagrange inversion formula. Connections to linear algebra emerge in chapters studying Cayley trees, determinantal formulas, and the combinatorics that lie behind the classical Cayley-Hamilton theorem. The remaining chapters range across the Inclusion-Exclusion Principle, graph theory and coloring, exponential structures, matching and distinct representatives, with each topic opening many doors to further study. Generous exercise sets complement all chapters, and miscellaneous sections explore additional applications. Lessons in Enumerative Combinatorics captures the authors' distinctive style and flair for introducing newcomers to combinatorics. The conversational yet rigorous presentation suits students in mathematics and computer science at the graduate, or advanced undergraduate level. Knowledge of single-variable calculus and the basics of discrete mathematics is assumed; familiarity with linear algebra will enhance the study of certain chapters.

This book constitutes selected and revised papers presented at the First International Conference on Optimization, Learning Algorithms and Applications, OL2A 2021, held in Braganca, Portugal, in July 2021. Due to the COVID-19 pandemic the conference was held online. The 39 full papers and 13 short papers were thoroughly reviewed and selected from 134 submissions. They are organized in the topical sections on optimization theory; robotics; measurements with the internet of things; optimization in control systems design; deep learning; data visualization and virtual reality; health informatics; data analysis; trends in engineering education.

The present book provides an introduction to using space-filling curves (SFC) as tools in scientific computing. Special focus is laid on the representation of SFC and on resulting algorithms. For example, grammar-based techniques are introduced for traversals of Cartesian and octree-type meshes, and arithmetisation of SFC is explained to compute SFC mappings and indexings.

The locality properties of SFC are discussed in detail, together with their importance for algorithms. Templates for parallelisation and cache-efficient algorithms are presented to reflect the most important applications of SFC in scientific computing. Special attention is also given to the interplay of adaptive mesh refinement and SFC, including the structured refinement of triangular and tetrahedral grids. For each topic, a short overview is given on the most important publications and recent research activities."

This book provides a comprehensive examination of preconditioners for boundary element discretisations of first-kind integral equations. Focusing on domain-decomposition-type and multilevel methods, it allows readers to gain a good understanding of the mechanisms and necessary techniques in the analysis of the preconditioners. These techniques are unique for the discretisation of first-kind integral equations since the resulting systems of linear equations are not only large and ill-conditioned, but also dense. The book showcases state-of-the-art preconditioning techniques for boundary integral equations, presenting up-to-date research. It also includes a detailed discussion of Sobolev spaces of fractional orders to familiarise readers with important mathematical tools for the analysis. Furthermore, the concise overview of adaptive BEM, hp-version BEM, and coupling of FEM-BEM provides efficient computational tools for solving practical problems with applications in science and engineering.

This book presents a systematic exposition of the main ideas and methods in treating inverse problems for PDEs arising in basic mathematical models, though it makes no claim to being exhaustive. Mathematical models of most physical phenomena are governed by initial and boundary value problems for PDEs, and inverse problems governed by these equations arise naturally in nearly all branches of science and engineering. The book's content, especially in the Introduction and Part I, is self-contained and is intended to also be accessible for beginning graduate students, whose mathematical background includes only basic courses in advanced calculus, PDEs and functional analysis. Further, the book can be used as the backbone for a lecture course on inverse and ill-posed problems for partial differential equations. In turn, the second part of the book consists of six nearly-independent chapters. The choice of these chapters was motivated by the fact that the inverse coefficient and source problems considered here are based on the basic and commonly used mathematical models governed by PDEs. These chapters describe not only these inverse problems, but also main inversion methods and techniques. Since the most distinctive features of any inverse problems related to PDEs are hidden in the properties of the corresponding solutions to direct problems, special attention is paid to the investigation of these properties. For the second edition, the authors have added two new chapters focusing on real-world applications of inverse problems arising in wave and vibration phenomena. They have also revised the whole text of the first edition.

This collection of peer-reviewed workshop papers provides comprehensive coverage of cutting-edge research into topological approaches to data analysis and visualization. It encompasses the full range of new algorithms and insights, including fast homology computation, comparative analysis of simplification techniques, and key applications in materials and medical science. The book also addresses core research challenges such as the representation of large and complex datasets, and integrating numerical methods with robust combinatorial algorithms. In keeping with the focus of the TopoInVis 2017 Workshop, the contributions reflect the latest advances in finding experimental solutions to open problems in the sector. They provide an essential snapshot of state-of-the-art research, helping researchers to keep abreast of the latest developments and providing a basis for future work. Gathering papers by some of the world's leading experts on topological techniques, the book represents a valuable contribution to a field of growing importance, with applications in disciplines ranging from engineering to medicine.

This book offers an overview on the main modern important topics in random variables, random processes, and decision theory for solving real-world problems. After an introduction to concepts of statistics and signals, the book introduces many essential applications to signal processing like denoising, texture classification, histogram equalization, deep learning, or feature extraction. The book uses MATLAB algorithms to demonstrate the implementation of the theory to real systems. This makes the contents of the book relevant to students and professionals who need a quick introduction but practical introduction how to deal with random signals and processes

This open access book presents selected papers from International Symposium on Mathematics, Quantum Theory, and Cryptography (MQC), which was held on September 25-27, 2019 in Fukuoka, Japan. The international symposium MQC addresses the mathematics and quantum theory underlying secure modeling of the post quantum cryptography including e.g. mathematical study of the light-matter interaction models as well as quantum computing. The security of the most widely used RSA cryptosystem is based on the difficulty of factoring large integers. However, in 1994 Shor proposed a quantum polynomial time algorithm for factoring integers, and the RSA cryptosystem is no longer secure in the quantum computing model. This vulnerability has prompted research into post-quantum cryptography using alternative mathematical problems that are secure in the era of quantum computers. In this regard, the National Institute of Standards and Technology (NIST) began to standardize post-quantum cryptography in 2016. This book is suitable for postgraduate students in mathematics and computer science, as well as for experts in industry working on post-quantum cryptography.

This introduction to first-order logic clearly works out the role of first-order logic in the foundations of mathematics, particularly the two basic questions of the range of the axiomatic method and of theorem-proving by machines. It covers several advanced topics not commonly treated in introductory texts, such as Fraisse's characterization of elementary equivalence, Lindstroem's theorem on the maximality of first-order logic, and the fundamentals of logic programming.

This eighteenth volume in the Poincare Seminar Series provides a thorough description of Information Theory and some of its most active areas, in particular, its relation to thermodynamics at the nanoscale and the Maxwell Demon, and the emergence of quantum computation and of its counterpart, quantum verification. It also includes two introductory tutorials, one on the fundamental relation between thermodynamics and information theory, and a primer on Shannon's entropy and information theory. The book offers a unique and manifold perspective on recent mathematical and physical developments in this field.

Traditional machining has many limitations in today's technology-driven world, which has caused industrial professionals to begin implementing various optimization techniques within their machining processes. The application of methods including machine learning and genetic algorithms has recently transformed the manufacturing industry and created countless opportunities in non-traditional machining methods. Significant research in this area, however, is still considerably lacking. Machine Learning Applications in Non-Conventional Machining Processes is a collection of innovative research on the advancement of intelligent technology in industrial environments and its applications within the manufacturing field. While highlighting topics including evolutionary algorithms, micro-machining, and artificial neural networks, this book is ideally designed for researchers, academicians, engineers, managers, developers, practitioners, industrialists, and students seeking current research on intelligence-based machining processes in today's technology-driven market.