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.

The authors' treatment of data structures in Data Structures and Algorithms is unified by an informal notion of "abstract data types," allowing readers to compare different implementations of the same concept. Algorithm design techniques are also stressed and basic algorithm analysis is covered. Most of the programs are written in Pascal.

This is the proceedings of the Sixth Workshop on Computing: Theory and Practice, WCTP 2016 devoted to theoretical and practical approaches to computation. This workshop was organized by four top universities in Japan and the Philippines: Tokyo Institute of Technology, Osaka University, University of the Philippines - Diliman, and De La Salle University. The proceedings provides a view of the current movement in research in these two countries. The papers included in the proceedings focus on the two research areas: theoretical and practical aspects of computation.

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.

Inverse problems such as imaging or parameter identification deal with the recovery of unknown quantities from indirect observations, connected via a model describing the underlying context. While traditionally inverse problems are formulated and investigated in a static setting, we observe a significant increase of interest in time-dependence in a growing number of important applications over the last few years. Here, time-dependence affects a) the unknown function to be recovered and / or b) the observed data and / or c) the underlying process. Challenging applications in the field of imaging and parameter identification are techniques such as photoacoustic tomography, elastography, dynamic computerized or emission tomography, dynamic magnetic resonance imaging, super-resolution in image sequences and videos, health monitoring of elastic structures, optical flow problems or magnetic particle imaging to name only a few. Such problems demand for innovation concerning their mathematical description and analysis as well as computational approaches for their solution.

If you struggle with binary multiplication, or Big O Notation, this is the book for you. This textbook companion will help improve your essential maths skills for computer science, whichever awarding body specification you're following. You can use it throughout your course, whenever you feel you need some extra help. - Develop your understanding of both maths and computer science with all worked examples and questions within a computer science context - Improve your confidence with a step-by-step approach to every maths skill - Measure your progress with guided and non-guided questions to see how you're improving - Understand where you're going wrong with full worked solutions to every question - Feel confident in expert guidance from experienced teachers and examiners Victoria Ellis and Gavin Craddock, reviewed by Dr Kathleen Maitland, Senior Lecturer in Computing and Director of the SAS Student Academy at Birmingham City University

Advanced Problem Solving Using Maple (TM): Applied Mathematics, Operations Research, Business Analytics, and Decision Analysis applies the mathematical modeling process by formulating, building, solving, analyzing, and criticizing mathematical models. Scenarios are developed within the scope of the problem-solving process. The text focuses on discrete dynamical systems, optimization techniques, single-variable unconstrained optimization and applied problems, and numerical search methods. Additional coverage includes multivariable unconstrained and constrained techniques. Linear algebra techniques to model and solve problems such as the Leontief model, and advanced regression techniques including nonlinear, logistics, and Poisson are covered. Game theory, the Nash equilibrium, and Nash arbitration are also included. Features: The text's case studies and student projects involve students with real-world problem solving Focuses on numerical solution techniques in dynamical systems, optimization, and numerical analysis The numerical procedures discussed in the text are algorithmic and iterative Maple is utilized throughout the text as a tool for computation and analysis All algorithms are provided with step-by-step formats About the Authors: William P. Fox is an emeritus professor in the Department of Defense Analysis at the Naval Postgraduate School. Currently, he is an adjunct professor, Department of Mathematics, the College of William and Mary. He received his PhD at Clemson University and has many publications and scholarly activities including twenty books and over one hundred and fifty journal articles. William C. Bauldry, Prof. Emeritus and Adjunct Research Prof. of Mathematics at Appalachian State University, received his PhD in Approximation Theory from Ohio State. He has published many papers on pedagogy and technology, often using Maple, and has been the PI of several NSF-funded projects incorporating technology and modeling into math courses. He currently serves as Associate Director of COMAP's Math Contest in Modeling (MCM).

This book constitutes the thoroughly refereed proceedings of the 11th International Symposium on Intelligence Computation and Applications, ISICA 2019, held in Guangzhou, China, in November 2019. The 65 papers presented were carefully reviewed and selected from the total of 112 submissions. This volume features the most up-to-date research in evolutionary algorithms, parallel computing and quantum computing, evolutionary multi-objective and dynamic optimization, intelligent multimedia systems, virtualization and AI applications, smart scheduling, intelligent control, big data and cloud computing, deep learning, and hybrid machine learning systems.The papers are organized according to the following topical sections: new frontier in evolutionary algorithms; evolutionary multi-objective and dynamic optimization; intelligent multimedia systems; virtualization and AI applications; smart scheduling; intelligent control; big data and cloud computing; statistical learning.

This book teaches algebra and geometry. The authors dedicate chapters to the key issues of matrices, linear equations, matrix algorithms, vector spaces, lines, planes, second-order curves, and elliptic curves. The text is supported throughout with problems, and the authors have included source code in Python in the book. The book is suitable for advanced undergraduate and graduate students in computer science.

This book offers a self-contained guide to advanced algorithms and their applications in various fields of science. Gathering contributions by authoritative researchers in the field of mathematics, statistics and computer science, it aims at offering a comprehensive and up-to-date view of algorithms, including the theory behind them, as well as practical considerations, current limitations and solutions. It covers applications in energy management, decision making, computer networks, materials science, mechanics and process optimization. It offers an integrated and timely guide to important algorithms, and represents a valuable reference resource for graduate students and researchers in various fields of applied mathematics, statistics and engineering.

Rising concerns about the security of our data have made quantum cryptography a very active research field in recent years. Quantum cryptographic protocols promise everlasting security by exploiting distinctive quantum properties of nature. The most extensively implemented protocol is quantum key distribution (QKD), which enables secure communication between two users. The aim of this book is to introduce the reader to state-of-the-art QKD and illustrate its recent multi-user generalization: quantum conference key agreement. With its pedagogical approach that doesn't disdain going into details, the book enables the reader to join in cutting-edge research on quantum cryptography.

This book uses new mathematical tools to examine broad computability and complexity questions in enumerative combinatorics, with applications to other areas of mathematics, theoretical computer science, and physics. A focus on effective algorithms leads to the development of computer algebra software of use to researchers in these domains. After a survey of current results and open problems on decidability in enumerative combinatorics, the text shows how the cutting edge of this research is the new domain of Analytic Combinatorics in Several Variables (ACSV). The remaining chapters of the text alternate between a pedagogical development of the theory, applications (including the resolution by this author of conjectures in lattice path enumeration which resisted several other approaches), and the development of algorithms. The final chapters in the text show, through examples and general theory, how results from stratified Morse theory can help refine some of these computability questions. Complementing the written presentation are over 50 worksheets for the SageMath and Maple computer algebra systems working through examples in the text.

This textbook introduces major topics that include quantum bits, superposition, entanglement, logic gates, quantum search algorithm, quantum Fourier transform, inverse quantum Fourier transform, Shor's order-finding algorithm and phase estimation. Everyone can write algorithms and programs in the cloud making using IBM's quantum computers that support IBM Q Experience which contains the composer, open quantum assembly language, simulators and real quantum devices. Furthermore, this book teaches you how to use open quantum assembly language to write quantum programs for dealing with complex problems. Through numerous examples and exercises, readers will learn how to write a quantum program with open quantum assembly language for solving any problem from start to complete. This book includes six main chapters: *Quantum Bits and Quantum Gates-learn what quantum bits are, how to declare and measure them, what quantum gates are and how they work on a simulator or a real device in the cloud. *Boolean Algebra and its Applications-learn how to decompose CCNOT gate into six CNOT gates and nine gates of one bit and how to use NOT gates, CNOT gates and CCNOT gates to implement logic operations including NOT, OR, AND, NOR, NAND, Exclusive-OR (XOR) and Exclusive-NOR (XNOR). *Quantum Search Algorithm and its Applications-learn core concepts of quantum search algorithm and how to write quantum programs to implement core concepts of quantum search algorithm for solving two famous NP-complete problems that are the satisfiability problem in n Boolean variables and m clauses and the clique problem in a graph with n vertices and q edges. *Quantum Fourier Transform and its Applications-learn core concepts of quantum Fourier transform and inverse quantum Fourier transform and how to write quantum programs to implement them for solving two real applications that are to compute the period and the frequency of two given oracular functions. *Order-Finding and Factoring-learn core concepts of Shor's order-finding algorithm and how to write quantum programs to implement Shor's order-finding algorithm for completing the prime factorization to 15. Phase Estimation and its Applications-learn core concepts of phase estimation and quantum counting and how to write quantum programs to implement them to compute the number of solution(s) in the independent set problem in a graph with two vertices and one edge.

This book presents selected peer-reviewed contributions from the International Conference on Time Series and Forecasting, ITISE 2018, held in Granada, Spain, on September 19-21, 2018. The first three parts of the book focus on the theory of time series analysis and forecasting, and discuss statistical methods, modern computational intelligence methodologies, econometric models, financial forecasting, and risk analysis. In turn, the last three parts are dedicated to applied topics and include papers on time series analysis in the earth sciences, energy time series forecasting, and time series analysis and prediction in other real-world problems. The book offers readers valuable insights into the different aspects of time series analysis and forecasting, allowing them to benefit both from its sophisticated and powerful theory, and from its practical applications, which address real-world problems in a range of disciplines. The ITISE conference series provides a valuable forum for scientists, engineers, educators and students to discuss the latest advances and implementations in the field of time series analysis and forecasting. It focuses on interdisciplinary and multidisciplinary research encompassing computer science, mathematics, statistics and econometrics.

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 two-volume set (CCIS 1159 and CCIS 1160) constitutes the proceedings of the 14th International Conference on Bio-inspired Computing: Theories and Applications, BIC-TA 2019, held in Zhengzhou, China, in November 2019.The 122 full papers presented in both volumes were selected from 197 submissions. The papers in the two volumes are organized according to the topical headings: evolutionary computation and swarm intelligence; bioinformatics and systems biology; complex networks; DNA and molecular computing; neural networks and articial intelligence.

This two-volume set (CCIS 1159 and CCIS 1160) constitutes the proceedings of the 14th International Conference on Bio-inspired Computing: Theories and Applications, BIC-TA 2019, held in Zhengzhou, China, in November 2019. The 121 full papers presented in both volumes were selected from 197 submissions. The papers are organized according to the topical headings: evolutionary computation and swarm intelligence; bioinformatics and systems biology; complex networks; DNA and molecular computing; neural networks and articial intelligence.

This book presents a selection of peer-reviewed contributions on the latest advances in time series analysis, presented at the International Conference on Time Series and Forecasting (ITISE 2019), held in Granada, Spain, on September 25-27, 2019. The first two parts of the book present theoretical contributions on statistical and advanced mathematical methods, and on econometric models, financial forecasting and risk analysis. The remaining four parts include practical contributions on time series analysis in energy; complex/big data time series and forecasting; time series analysis with computational intelligence; and time series analysis and prediction for other real-world problems. Given this mix of topics, readers will acquire a more comprehensive perspective on the field of time series analysis and forecasting. The ITISE conference series provides a forum for scientists, engineers, educators and students to discuss the latest advances and implementations in the foundations, theory, models and applications of time series analysis and forecasting. It focuses on interdisciplinary research encompassing computer science, mathematics, statistics and econometrics.

The book shows that the analytic combinatorics (AC) method encodes the combinatorial problems of multiple object tracking-without information loss-into the derivatives of a generating function (GF). The book lays out an easy-to-follow path from theory to practice and includes salient AC application examples. Since GFs are not widely utilized amongst the tracking community, the book takes the reader from the basics of the subject to applications of theory starting from the simplest problem of single object tracking, and advancing chapter by chapter to more challenging multi-object tracking problems. Many established tracking filters (e.g., Bayes-Markov, PDA, JPDA, IPDA, JIPDA, CPHD, PHD, multi-Bernoulli, MBM, LMBM, and MHT) are derived in this manner with simplicity, economy, and considerable clarity. The AC method gives significant and fresh insights into the modeling assumptions of these filters and, thereby, also shows the potential utility of various approximation methods that are well established techniques in applied mathematics and physics, but are new to tracking. These unexplored possibilities are reviewed in the final chapter of the book.

This book explores emerging topics in atomic- and nano-scale electronics after the era of Moore's Law, covering both the physical principles behind, and technological implementations for many devices that are now expected to become key elements of the future of nanoelectronics beyond traditional complementary metal-oxide semiconductors (CMOS). Moore's law is not a physical law itself, but rather a visionary prediction that has worked well for more than 50 years but is rapidly coming to its end as the gate length of CMOS transistors approaches the length-scale of only a few atoms. Thus, the key question here is: "What is the future for nanoelectronics beyond CMOS?" The possible answers are found in this book. Introducing novel quantum devices such as atomic-scale electronic devices, ballistic devices, memristors, superconducting devices, this book also presents the reader with the physical principles underlying new ways of computing, as well as their practical implementation. Topics such as quantum computing, neuromorphic computing are highlighted here as some of the most promising candidates for ushering in a new era of atomic-scale electronics beyond CMOS.

This volume gathers papers presented at the Workshop on Computational Diffusion MRI (CDMRI 2019), held under the auspices of the International Conference on Medical Image Computing and Computer Assisted Intervention (MICCAI), which took place in Shenzhen, China on October 17, 2019. This book presents the latest advances in the rapidly expanding field of diffusion MRI. It shares new perspectives on the latest research challenges for those currently working in the field, but also offers a valuable starting point for anyone interested in learning about computational techniques in diffusion MRI. The book includes rigorous mathematical derivations, a wealth of rich, full-colour visualisations and extensive clinically relevant results. As such, it will be of interest to researchers and practitioners in the fields of computer science, MRI physics and applied mathematics. Readers will find contributions covering a broad range of topics, from the mathematical foundations of the diffusion process and signal generation, to new computational methods and estimation techniques for the in vivo recovery of microstructural and connectivity features, as well as diffusion-relaxometry and frontline applications in research and clinical practice. This edition includes invited works from high-profile researchers with a specific focus on three new and important topics that are gaining momentum within the diffusion MRI community, including diffusion MRI signal acquisition and processing strategies, machine learning for diffusion MRI, and diffusion MRI outside the brain and clinical applications.

Cryptography and encryption aren't just for geeks and spies-they're also part of our daily lives. This book enlightens you with the basics of digital cryptography and covers the must-do practices organizations need to implement when it comes to fending off data theft and eavesdroppers. You will uncover the concepts of digital encryption and examine key digital encryption algorithms and their various applications. Gauging cryptography from an enterprise perspective, you will get an in-depth look at common attacks that can occur in your systems and lean how to counter them Moving on to quantum computing, you will discover how it differs from the current computing paradigm and understand its potential for the future. After clearing the basics, you will take a close look at how quantum computers work in practice. Shifting focus to quantum cryptography, you will learn more about quantum key distribution (QKD) and how it differs from present-day encryption methodologies. You will also consider the current implementations of QKD, including distribution systems by SwissQuantum and QKD-distribution networks provided by the DARPA Quantum Network. Ultimately, you will learn the means of defending against cryptographic attacks in the up-and-coming quantum age, such as utilizing zero-knowledge proof (ZKP) systems. Deepen your knowledge of cryptographic concepts and be introduced to the new paradigm of quantum cryptography with this book. What You Will Learn Appreciate how digital encryption algorithms work Secure your infrastructure from cryptographic attacks Understand the basics of quantum information science Discover how cryptography relates to quantum computing Implement Quantum Key Distribution (QKD) Who This Book Is For This book is aimed at readers who have an interest in both well-established and up-and-coming types of cryptography, as well as members of organizations to whom privacy is a top priority.

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.

These are the proceedings of the 25th International Conference on Domain Decomposition Methods in Science and Engineering, which was held in St. John's, Newfoundland, Canada in July 2018. Domain decomposition methods are iterative methods for solving the often very large systems of equations that arise when engineering problems are discretized, frequently using finite elements or other modern techniques. These methods are specifically designed to make effective use of massively parallel, high-performance computing systems. The book presents both theoretical and computational advances in this domain, reflecting the state of art in 2018.