This volume explores the connections between mathematical modeling, computational methods, and high performance computing, and how recent developments in these areas can help to solve complex problems in the natural sciences and engineering. The content of the book is based on talks and papers presented at the conference Modern Mathematical Methods and High Performance Computing in Science & Technology (M3HPCST), held at Inderprastha Engineering College in Ghaziabad, India in January 2020. A wide range of both theoretical and applied topics are covered in detail, including the conceptualization of infinity, efficient domain decomposition, high capacity wireless communication, infectious disease modeling, and more. These chapters are organized around the following areas: Partial and ordinary differential equations Optimization and optimal control High performance and scientific computing Stochastic models and statistics Recent Trends in Mathematical Modeling and High Performance Computing will be of interest to researchers in both mathematics and engineering, as well as to practitioners who face complex models and extensive computations.

Chinese Remainder Theorem, CRT, is one of the jewels of mathematics. It is a perfect combination of beauty and utility or, in the words of Horace, omne tulit punctum qui miscuit utile dulci. Known already for ages, CRT continues to present itself in new contexts and open vistas for new types of applications. So far, its usefulness has been obvious within the realm of "three C's". Computing was its original field of application, and continues to be important as regards various aspects of algorithmics and modular computations. Theory of codes and cryptography are two more recent fields of application.This book tells about CRT, its background and philosophy, history, generalizations and, most importantly, its applications. The book is self-contained. This means that no factual knowledge is assumed on the part of the reader. We even provide brief tutorials on relevant subjects, algebra and information theory. However, some mathematical maturity is surely a prerequisite, as our presentation is at an advanced undergraduate or beginning graduate level. We have tried to make the exposition innovative, many of the individual results being new. We will return to this matter, as well as to the interdependence of the various parts of the book, at the end of the Introduction.A special course about CRT can be based on the book. The individual chapters are largely independent and, consequently, the book can be used as supplementary material for courses in algorithmics, coding theory, cryptography or theory of computing. Of course, the book is also a reference for matters dealing with CRT.

This book introduces formal semantics techniques for a natural language processing audience. Methods discussed involve: (i) the denotational techniques used in model-theoretic semantics, which make it possible to determine whether a linguistic expression is true or false with respect to some model of the way things happen to be; and (ii) stages of interpretation, i.e., ways to arrive at meanings by evaluating and converting source linguistic expressions, possibly with respect to contexts, into output (logical) forms that could be used with (i). The book demonstrates that the methods allow wide coverage without compromising the quality of semantic analysis. Access to unrestricted, robust and accurate semantic analysis is widely regarded as an essential component for improving natural language processing tasks, such as: recognizing textual entailment, information extraction, summarization, automatic reply, and machine translation.

Arguably the strongest addition to numerical finance of the past decade, Algorithmic Adjoint Differentiation (AAD) is the technology implemented in modern financial software to produce thousands of accurate risk sensitivities, within seconds, on light hardware. AAD recently became a centerpiece of modern financial systems and a key skill for all quantitative analysts, developers, risk professionals or anyone involved with derivatives. It is increasingly taught in Masters and PhD programs in finance. Danske Bank's wide scale implementation of AAD in its production and regulatory systems won the In-House System of the Year 2015 Risk award. The Modern Computational Finance books, written by three of the very people who designed Danske Bank's systems, offer a unique insight into the modern implementation of financial models. The volumes combine financial modelling, mathematics and programming to resolve real life financial problems and produce effective derivatives software. This volume is a complete, self-contained learning reference for AAD, and its application in finance. AAD is explained in deep detail throughout chapters that gently lead readers from the theoretical foundations to the most delicate areas of an efficient implementation, such as memory management, parallel implementation and acceleration with expression templates. The book comes with professional source code in C++, including an efficient, up to date implementation of AAD and a generic parallel simulation library. Modern C++, high performance parallel programming and interfacing C++ with Excel are also covered. The book builds the code step-by-step, while the code illustrates the concepts and notions developed in the book.

Grammars of natural languages can be expressed as mathematical objects, similar to computer programs. Such a formal presentation of grammars facilitates mathematical reasoning with grammars (and the languages they denote), as well as computational implementation of grammar processors. This book presents one of the most commonly used grammatical formalisms, Unification Grammars, which underlies contemporary linguistic theories such as Lexical-Functional Grammar (LFG) and Head-driven Phrase Structure Grammar (HPSG). The book provides a robust and rigorous exposition of the formalism that is both mathematically well-founded and linguistically motivated. While the material is presented formally, and much of the text is mathematically oriented, a core chapter of the book addresses linguistic applications and the implementation of several linguistic insights in unification grammars. Dozens of examples and numerous exercises (many with solutions) illustrate key points. Graduate students and researchers in both computer science and linguistics will find this book a valuable resource.

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 essence, Computing with Words (CWW) is a system of computation in which the objects of computation are predominantly words, phrases and propositions drawn from a natural language. CWW is based on fuzzy logic. In science there is a deep-seated tradition of according muchmore respect to numbers than to words. In a fundamental way, CWW is a challenge to this tradition. What is not widely recognized is that, today, words are used in place of numbers in a wide variety of applications ranging from digital cameras and household appliancesto fraud detection systems, biomedicalinstrumentation and subway trains.

CWW offersa unique capability-the capability to precisiate natural language. Unprecisiated (raw) natural language cannot be computed with. A key concept which underlies precisiation of meaning is that of the meaning postulate: A proposition, p, is a restriction on the values which a variable, X-a variable which is implicit in p-is allowed to take.

CWW has an important ramification for mathematics. Addition of the formalism of CWW to mathematics empowers mathematics to construct mathematical solutions of computational problems which are stated in a natural language. Traditional mathematics does not have this capability."

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 is aimed at researchers, graduate students and engineers who would like to be initiated to Piecewise Deterministic Markov Processes (PDMPs). A PDMP models a deterministic mechanism modified by jumps that occur at random times. The fields of applications are numerous : insurance and risk, biology, communication networks, dependability, supply management, etc. Indeed, the PDMPs studied so far are in fact deterministic functions of CSMPs (Completed Semi-Markov Processes), i.e. semi-Markov processes completed to become Markov processes. This remark leads to considerably broaden the definition of PDMPs and allows their properties to be deduced from those of CSMPs, which are easier to grasp. Stability is studied within a very general framework. In the other chapters, the results become more accurate as the assumptions become more precise. Generalized Chapman-Kolmogorov equations lead to numerical schemes. The last chapter is an opening on processes for which the deterministic flow of the PDMP is replaced with a Markov process. Marked point processes play a key role throughout this book.

The aim of this textbook is to provide undergraduate students with an introduction to the basic theoretical models of computability, and to develop some of the model's rich and varied structure. Students who have already some experience with elementary discrete mathematics will find this a well-paced first course, and a number of supplementary chapters introduce more advanced concepts. The first part of the book is devoted to finite automata and their properties. Pushdown automata provide a broader class of models and enable the analysis of context-free languages. In the remaining chapters, Turing machines are introduced and the book culminates in discussions of effective computability, decidability, and Gödel's incompleteness theorems. Plenty of exercises are provided, ranging from the easy to the challenging. As a result, this text will make an ideal first course for students of computer science.

Decades of innovations in combinatorial problem solving have produced better and more complex algorithms. These new methods are better since they can solve larger problems and address new application domains. They are also more complex which means that they are hard to reproduce and often harder to fine-tune to the peculiarities of a given problem. This last point has created a paradox where efficient tools are out of reach of practitioners.

Autonomous search (AS) represents a new research field defined to precisely address the above challenge. Its major strength and originality consist in the fact that problem solvers can now perform self-improvement operations based on analysis of the performances of the solving process -- including short-term reactive reconfiguration and long-term improvement through self-analysis of the performance, offline tuning and online control, and adaptive control and supervised control. Autonomous search "crosses the chasm" and provides engineers and practitioners with systems that are able to autonomously self-tune their performance while effectively solving problems.

This is the first book dedicated to this topic, and it can be used as a reference for researchers, engineers, and postgraduates in the areas of constraint programming, machine learning, evolutionary computing, and feedback control theory. After the editors' introduction to autonomous search, the chapters are focused on tuning algorithm parameters, autonomous complete (tree-based) constraint solvers, autonomous control in metaheuristics and heuristics, and future autonomous solving paradigms.

Autonomous search (AS) represents a new research field defined to precisely address the above challenge. Its major strength and originality consist in the fact that problem solvers can now perform self-improvement operations based on analysis of the performances of the solving process -- including short-term reactive reconfiguration and long-term improvement through self-analysis of the performance, offline tuning and online control, and adaptive control and supervised control. Autonomous search "crosses the chasm" and provides engineers and practitioners with systems that are able to autonomously self-tune their performance while effectively solving problems.

This is the first book dedicated to this topic, and it can be used as a reference for researchers, engineers, and postgraduates in the areas of constraint programming, machine learning, evolutionary computing, and feedback control theory. After the editors' introduction to autonomous search, the chapters are focused on tuning algorithm parameters, autonomous complete (tree-based) constraint solvers, autonomous control in metaheuristics and heuristics, and future autonomous solving paradigms.

This is the first book dedicated to this topic, and it can be used as a reference for researchers, engineers, and postgraduates in the areas of constraint programming, machine learning, evolutionary computing, and feedback control theory. After the editors' introduction to autonomous search, the chapters are focused on tuning algorithm parameters, autonomous complete (tree-based) constraint solvers, autonomous control in metaheuristics and heuristics, and future autonomous solving paradigms.

This is the first book dedicated to this topic, and it can be used as a reference for researchers, engineers, and postgraduates in the areas of constraint programming, machine learning, evolutionary computing, and feedback control theory. After the editors' introduction to autonomous search, the chapters are focused on tuning algorithm parameters, autonomous complete (tree-based) constraint solvers, autonomous control in metaheuristics and heuristics, and future autonomous solving paradigms.

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.

This well-balanced text touches on theoretical and applied aspects of protecting digital data. The reader is provided with the basic theory and is then shown deeper fascinating detail, including the current state of the art. Readers will soon become familiar with methods of protecting digital data while it is transmitted, as well as while the data is being stored. Both basic and advanced error-correcting codes are introduced together with numerous results on their parameters and properties. The authors explain how to apply these codes to symmetric and public key cryptosystems and secret sharing. Interesting approaches based on polynomial systems solving are applied to cryptography and decoding codes. Computer algebra systems are also used to provide an understanding of how objects introduced in the book are constructed, and how their properties can be examined. This book is designed for Masters-level students studying mathematics, computer science, electrical engineering or physics.

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.

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.

The combinatorial theory of species, introduced by Joyal in 1980, provides a unified understanding of the use of generating functions for both labeled and unlabeled structures as well as a tool for the specification and analysis of these structures. This key reference presents the basic elements of the theory and gives a unified account of its developments and applications. The authors offer a modern introduction to the use of various generating functions, with applications to graphical enumeration, Polya Theory and analysis of data structures in computer science, and to other areas such as special functions, functional equations, asymptotic analysis, and differential equations.

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.

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.

The goal of visualization is the accurate, interactive, and intuitive presentation of data. Complex numerical simulations, high-resolution imaging devices and incre- ingly common environment-embedded sensors are the primary generators of m- sive data sets. Being able to derive scienti?c insight from data increasingly depends on having mathematical and perceptual models to provide the necessary foundation for effective data analysis and comprehension. The peer-reviewed state-of-the-art research papers included in this book focus on continuous data models, such as is common in medical imaging or computational modeling. From the viewpoint of a visualization scientist, we typically collaborate with an application scientist or engineer who needs to visually explore or study an object which is given by a set of sample points, which originally may or may not have been connected by a mesh. At some point, one generally employs low-order piecewise polynomial approximationsof an object, using one or several dependent functions. In order to have an understanding of a higher-dimensional geometrical "object" or function, ef?cient algorithms supporting real-time analysis and manipulation (- tation, zooming) are needed. Often, the data represents 3D or even time-varying 3D phenomena (such as medical data), and the access to different layers (slices) and structures (the underlying topology) comprising such data is needed.

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.