This book constitutes the refereed proceedings of the 7th International Conference on Mathematical Aspects of Computer and Information Sciences, MACIS 2017, held in Vienna, Austria, in November 2017. The 28 revised papers and 8 short papers presented were carefully reviewed and selected from 67 submissions. The papers are organized in the following topical sections: foundation of algorithms in mathematics, engineering and scientific computation; combinatorics and codes in computer science; data modeling and analysis; and mathematical aspects of information security and cryptography.

With a focus on 1D and 2D problems, the first volume of Computing with hp-ADAPTIVE FINITE ELEMENTS prepared readers for the concepts and logic governing 3D code and implementation. Taking the next step in hp technology, Volume II Frontiers: Three-Dimensional Elliptic and Maxwell Problems with Applications presents the theoretical foundations of the 3D hp algorithm and provides numerical results using the 3Dhp code developed by the authors and their colleagues. The first part of the book focuses on fundamentals of the 3D theory of hp methods as well as issues that arise when the code is implemented. After a review of boundary-value problems, the book examines exact hp sequences, projection-based interpolation, and De Rham diagrams. It also presents the 3D version of the automatic hp-adaptivity package, a two-grid solver for highly anisotropic hp meshes and goal-oriented Krylov iterations, and a parallel implementation of the 3D code. The second part explores several recent projects in which the 3Dhp code was used and illustrates how these applications have greatly driven the development of 3D hp technology. It encompasses acoustic and electromagnetic (EM) scattering problems, an analysis of complex structures with thin-walled components, and challenging simulations of logging tools. The book concludes with a look at the future of hp methods. Spearheaded by a key developer of this technology with more than 20 years of research in the field, this self-contained, comprehensive resource will help readers overcome the difficulties in coding hp-adaptive elements.

In honor of professor and renowned statistician R. Dennis Cook, this festschrift explores his influential contributions to an array of statistical disciplines ranging from experimental design and population genetics, to statistical diagnostics and all areas of regression-related inference and analysis. Since the early 1990s, Prof. Cook has led the development of dimension reduction methodology in three distinct but related regression contexts: envelopes, sufficient dimension reduction (SDR), and regression graphics. In particular, he has made fundamental and pioneering contributions to SDR, inventing or co-inventing many popular dimension reduction methods, such as sliced average variance estimation, the minimum discrepancy approach, model-free variable selection, and sufficient dimension reduction subspaces. A prolific researcher and mentor, Prof. Cook is known for his ability to identify research problems in statistics that are both challenging and important, as well as his deep appreciation for the applied side of statistics. This collection of Prof. Cook's collaborators, colleagues, friends, and former students reflects the broad array of his contributions to the research and instructional arenas of statistics.

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.

This book is a collection of peer-reviewed best selected research papers presented at the First International Conference on Machine Intelligence and Smart Systems 2020 (MISS 2020), organized during September 24-25, 2020, in Gwalior, India. The book presents new advances and research results in the fields of machine intelligence, artificial intelligence and smart systems. It includes main paradigms of machine intelligence algorithms, namely (1) neural networks, (2) evolutionary computation, (3) swarm intelligence, (4) fuzzy systems and (5) immunological computation.

This book engages in an ongoing topic, such as the implementation of nature-inspired metaheuristic algorithms, with a main concentration on optimization problems in different fields of engineering optimization applications. The chapters of the book provide concise overviews of various nature-inspired metaheuristic algorithms, defining their profits in obtaining the optimal solutions of tiresome engineering design problems that cannot be efficiently resolved via conventional mathematical-based techniques. Thus, the chapters report on advanced studies on the applications of not only the traditional, but also the contemporary certain nature-inspired metaheuristic algorithms to specific engineering optimization problems with single and multi-objectives. Harmony search, artificial bee colony, teaching learning-based optimization, electrostatic discharge, grasshopper, backtracking search, and interactive search are just some of the methods exhibited and consulted step by step in application contexts. The book is a perfect guide for graduate students, researchers, academicians, and professionals willing to use metaheuristic algorithms in engineering optimization applications.

This volume of the CRM Conference Series is based on a carefully refereed selection of contributions presented at the "11th International Symposium on Quantum Theory and Symmetries", held in Montreal, Canada from July 1-5, 2019. The main objective of the meeting was to share and make accessible new research and recent results in several branches of Theoretical and Mathematical Physics, including Algebraic Methods, Condensed Matter Physics, Cosmology and Gravitation, Integrability, Non-perturbative Quantum Field Theory, Particle Physics, Quantum Computing and Quantum Information Theory, and String/ADS-CFT. There was also a special session in honour of Decio Levi. The volume is divided into sections corresponding to the sessions held during the symposium, allowing the reader to appreciate both the homogeneity and the diversity of mathematical tools that have been applied in these subject areas. Several of the plenary speakers, who are internationally recognized experts in their fields, have contributed reviews of the main topics to complement the original contributions.

With the diversification of Internet services and the increase in mobile users, efficient management of network resources has become an extremely important issue in the field of wireless communication networks (WCNs). Adaptive resource management is an effective tool for improving the economic efficiency of WCN systems as well as network design and construction, especially in view of the surge in mobile device demands. This book presents modelling methods based on queueing theory and Markov processes for a wide variety of WCN systems, as well as precise and approximate analytical solution methods for the numerical evaluation of the system performance. This is the first book to provide an overview of the numerical analyses that can be gleaned by applying queueing theory, traffic theory and other analytical methods to various WCN systems. It also discusses the recent advances in the resource management of WCNs, such as broadband wireless access networks, cognitive radio networks, and green cloud computing. It assumes a basic understanding of computer networks and queueing theory, and familiarity with stochastic processes is also recommended. The analysis methods presented in this book are useful for first-year-graduate or senior computer science and communication engineering students. Providing information on network design and management, performance evaluation, queueing theory, game theory, intelligent optimization, and operations research for researchers and engineers, the book is also a valuable reference resource for students, analysts, managers and anyone in the industry interested in WCN system modelling, performance analysis and numerical evaluation.

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.

Automatic sequences are sequences over a finite alphabet generated by a finite-state machine. This book presents a novel viewpoint on automatic sequences, and more generally on combinatorics on words, by introducing a decision method through which many new results in combinatorics and number theory can be automatically proved or disproved with little or no human intervention. This approach to proving theorems is extremely powerful, allowing long and error-prone case-based arguments to be replaced by simple computations. Readers will learn how to phrase their desired results in first-order logic, using free software to automate the computation process. Results that normally require multipage proofs can emerge in milliseconds, allowing users to engage with mathematical questions that would otherwise be difficult to solve. With more than 150 exercises included, this text is an ideal resource for researchers, graduate students, and advanced undergraduates studying combinatorics, sequences, and number theory.

This textbook is intended for practical, laboratory sessions associated with the course of quantum computing and quantum algorithms, as well as for self-study. It contains basic theoretical concepts and methods for solving basic types of problems and gives an overview of basic qubit operations, entangled states, quantum circuits, implementing functions, quantum Fourier transform, phase estimation, etc. The book serves as a basis for the application of new information technologies in education and corporate technical training: theoretical material and examples of practical problems, as well as exercises with, in most cases, detailed solutions, have relation to information technologies. A large number of detailed examples serve to better develop professional competencies in computer science.

Computer Arithmetic Volume III is a compilation of key papers in computer arithmetic on floating-point arithmetic and design. The intent is to show progress, evolution, and novelty in the area of floating-point arithmetic. This field has made extraordinary progress since the initial software routines on mainframe computers have evolved into hardware implementations in processors spanning a wide range of performance. Nevertheless, these papers pave the way to the understanding of modern day processors design where computer arithmetic are supported by floating-point units. The goal of Volume III is to collect the defining document for floating-point arithmetic and many of the key papers on the implementation of both binary and decimal floating-point arithmetic into a single volume. Although fewer than forty papers are included, their reference lists will direct the interested reader to other excellent work that could not be included here.Volume III is specifically oriented to the needs of designers and users of both general-purpose computers and special-purpose digital processors. The book should also be useful to systems engineers, computer architects, and logic designers. It is also intended to serve as a primary text for a course on floating-point arithmetic, as well as a supplementary text for courses in digital arithmetic and high-speed signal processing.This volume is part of a 3 volume set:Computer Arithmetic Volume I Computer Arithmetic Volume II Computer Arithmetic Volume IIIThe full set is available for sale in a print-only version.

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.

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.

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.

First appearing in the late 1980s, wavelets have developed rapidly, and their applications now reach from signal processing to numerical analysis, operator theory, and beyond. Among the generalizations of wavelets that have emerged, multiwavelets stand out because of their potential for short support and for their capability of being both symmetric and orthogonal. Some existing wavelet books have a short section covering multiwavelets, but to date, none offer a comprehensive treatment.

Pulling together information scattered throughout the literature of mathematics and engineering, Wavelets and Multiwavelets offers a full exposition of wavelet and multiwavelet theory. Maintaining the delicate balance between mathematical rigor and readability, the author presents the theory of classical wavelets and general m-band multiwavelets in parallel. This provides a more coherent approach and yields alternative proofs and new insights even for standard wavelets. MATLAB routines that allow you to implement and experiment with multiwavelet algorithms are available from the CRC Press Web site.

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.

Integrating concepts from deep learning, machine learning, and artificial neural networks, this highly unique textbook presents content progressively from easy to more complex, orienting its content about knowledge transfer from the viewpoint of machine intelligence. It adopts the methodology from graphical theory, mathematical models, and algorithmic implementation, as well as covers datasets preparation, programming, results analysis and evaluations. Beginning with a grounding about artificial neural networks with neurons and the activation functions, the work then explains the mechanism of deep learning using advanced mathematics. In particular, it emphasizes how to use TensorFlow and the latest MATLAB deep-learning toolboxes for implementing deep learning algorithms. As a prerequisite, readers should have a solid understanding especially of mathematical analysis, linear algebra, numerical analysis, optimizations, differential geometry, manifold, and information theory, as well as basic algebra, functional analysis, and graphical models. This computational knowledge will assist in comprehending the subject matter not only of this text/reference, but also in relevant deep learning journal articles and conference papers. This textbook/guide is aimed at Computer Science research students and engineers, as well as scientists interested in deep learning for theoretic research and analysis. More generally, this book is also helpful for those researchers who are interested in machine intelligence, pattern analysis, natural language processing, and machine vision. Dr. Wei Qi Yan is an Associate Professor in the Department of Computer Science at Auckland University of Technology, New Zealand. His other publications include the Springer title, Visual Cryptography for Image Processing and Security.

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.

Mathematica, Maple, and similar software packages provide programs that carry out sophisticated mathematical operations. Applying the ideas introduced in Computer Algebra and Symbolic Computation: Elementary Algorithms, this book explores the application of algorithms to such methods as automatic simplification, polynomial decomposition, and polynomial factorization. This book includes complexity analysis of algorithms and other recent developments. It is well-suited for self-study and can be used as the basis for a graduate course. Maintaining the style set by Elementary Algorithms, the author explains mathematical methods as needed while introducing advanced methods to treat complex operations.

Since its introduction in 1984, MATLAB's ever-growing popularity and functionality have secured its position as an industry-standard software package. The user-friendly, interactive environment of MATLAB 6.x, which includes a high-level programming language, versatile graphics capabilities, and abundance of intrinsic functions, helps users focus on their applications rather than on programming errors. MATLAB has now leapt far ahead of FORTRAN as the software of choice for engineering applications.

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 book provides a systematic approach for the algorithmic formulation and implementation of mathematical operations in computer algebra programming languages. The viewpoint is that mathematical expressions, represented by expression trees, are the data objects of computer algebra programs, and by using a few primitive operations that analyze and construct expressions, we can implement many elementary operations from algebra, trigonometry, calculus, and differential equations. With a minimum of prerequisites this book is accessible to and useful for students of mathematics, computer science, and other technical fields. The book contains a CD with the full, searchable text and implementations of all algorithms in the Maple, Mathematica, and MuPad programming languages.

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.