While the significance of networks in various human behavior and activities has a history as long as human's existence, network awareness is a recent scientific phenomenon. The neologism network science is just one or two decades old. Nevertheless, with this limited time, network thinking has substantially reshaped the recent development in economics, and almost all solutions to real-world problems involve the network element. This book integrates agent-based modeling and network science. It is divided into three parts, namely, foundations, primary dynamics on and of social networks, and applications. The authors begin with the network origin of agent-based models, known as cellular automata, and introduce a number of classic models, such as Schelling's segregation model and Axelrod's spatial game. The essence of the foundation part is the network-based agent-based models in which agents follow network-based decision rules. Under the influence of the substantial progress in network science in late 1990s, these models have been extended from using lattices into using small-world networks, scale-free networks, etc. The text also shows that the modern network science mainly driven by game-theorists and sociophysicists has inspired agent-based social scientists to develop alternative formation algorithms, known as agent-based social networks. It reviews a number of pioneering and representative models in this family. Upon the given foundation, the second part reviews three primary forms of network dynamics, such as diffusions, cascades, and influences. These primary dynamics are further extended and enriched by practical networks in goods-and-service markets, labor markets, and international trade. At the end, the book considers two challenging issues using agent-based models of networks: network risks and economic growth.

Electric power systems have become much more complex in the past years, due to the integration of distributed generation including renewable energy sources and the challenges caused by intermittency of renewables. This complexity makes power systems potentially more vulnerable. However, use of computer-based protection methods (i.e., digital protection relays) supported by communication technology have helped in protecting electrical networks from faults to which they are subjected to. This second edition of the book covers a comprehensive introduction to the protection of electrical power systems using digital protective relays. The new edition offers a thorough revision and update, and comprehensive additional material. Chapters treat the mathematical background of protection algorithms including, sinusoidal-wave-based algorithms, Walsh function and S-Transform-based techniques, least squares and differential equation-based techniques, travelling wave-based protection, protection of transformers, digital line differential protection, a comparison between digital protection algorithms, and importantly, protection of networks with distributed generation including renewable energy resources. The book is written for researchers in electrical engineering and power engineering, in industry, utilities and universities, and for advanced students. The treatment is logically structured, covering mathematics and principles for the development and implementation of the major algorithms underlying different protection techniques. These techniques can be applied to protection of generator transformers, lines, switchgear and cable circuits: the main components of transmission and distribution systems with and without integrated distributed energy sources including renewables.

Coinduction is a method for specifying and reasoning about infinite data types and automata with infinite behaviour. In recent years, it has come to play an ever more important role in the theory of computing. It is studied in many disciplines, including process theory and concurrency, modal logic and automata theory. Typically, coinductive proofs demonstrate the equivalence of two objects by constructing a suitable bisimulation relation between them. This collection of surveys is aimed at both researchers and Master's students in computer science and mathematics and deals with various aspects of bisimulation and coinduction, with an emphasis on process theory. Seven chapters cover the following topics: history, algebra and coalgebra, algorithmics, logic, higher-order languages, enhancements of the bisimulation proof method, and probabilities. Exercises are also included to help the reader master new material.

It is the first text that in addition to standard convergence theory treats other necessary ingredients for successful numerical simulations of physical systems encountered by every practitioner. The book is aimed at users with interests ranging from application modeling to numerical analysis and scientific software development. It is strongly influenced by the authors research in in space physics, electrical and optical engineering, applied mathematics, numerical analysis and professional software development. The material is based on a year-long graduate course taught at the University of Arizona since 1989. The book covers the first two-semesters of a three semester series. The second semester is based on a semester-long project, while the third semester requirement consists of a particular methods course in specific disciplines like computational fluid dynamics, finite element method in mechanical engineering, computational physics, biology, chemistry, photonics, etc.
The first three chapters focus on basic properties of partial differential equations, including analysis of the dispersion relation, symmetries, particular solutions and instabilities of the PDEs; methods of discretization and convergence theory for initial value problems. The goal is to progress from observations of simple numerical artifacts like diffusion, damping, dispersion, and anisotropies to their analysis and management technique, as it is not always possible to completely eliminate them.
In the second part of the book we cover topics for which there are only sporadic theoretical results, while they are an integral part and often the most important part for successful numerical simulation. We adopt a more heuristic and practical approach using numerical methods of investigation and validation. The aim is teach students subtle key issues in order to separate physics from numerics. The following topics are addressed: Implementation of transparent and absorbing boundary conditions; Practical stability analysis in the presence of the boundaries and interfaces; Treatment of problems with different temporal/spatial scales either explicit or implicit; preservation of symmetries and additional constraints; physical regularization of singularities; resolution enhancement using adaptive mesh refinement and moving meshes.
Self contained presentation of key issues in successful numerical simulationAccessible to scientists and engineers with diverse backgroundProvides analysis of the dispersion relation, symmetries, particular solutions and instabilities of the partial differential equations

Congruences are ubiquitous in computer science, engineering, mathematics, and related areas. Developing techniques for finding (the number of) solutions of congruences is an important problem. But there are many scenarios in which we are interested in only a subset of the solutions; in other words, there are some restrictions. What do we know about these restricted congruences, their solutions, and applications? This book introduces the tools that are needed when working on restricted congruences and then systematically studies a variety of restricted congruences. Restricted Congruences in Computing defines several types of restricted congruence, obtains explicit formulae for the number of their solutions using a wide range of tools and techniques, and discusses their applications in cryptography, information security, information theory, coding theory, string theory, quantum field theory, parallel computing, artificial intelligence, computational biology, discrete mathematics, number theory, and more. This is the first book devoted to restricted congruences and their applications. It will be of interest to graduate students and researchers across computer science, electrical engineering, and mathematics.

Numerical Linear Algebra with Julia provides in-depth coverage of fundamental topics in numerical linear algebra, including how to solve dense and sparse linear systems, compute QR factorizations, compute the eigendecomposition of a matrix, and solve linear systems using iterative methods such as conjugate gradient. The style is friendly and approachable and cartoon characters guide the way. Inside this book, readers will find detailed descriptions of algorithms, implementations in Julia that illustrate concepts and allow readers to explore methods on their own, and illustrations and graphics that emphasize core concepts and demonstrate algorithms. Numerical Linear Algebra with Julia is a textbook for undergraduate and graduate students. It is appropriate for the following courses: Advanced Numerical Analysis, Special Topics on Numerical Analysis, Topics on Data Science, Topics on Numerical Optimization, and Topics on Approximation Theory. The book may also serve as a reference for researchers in various fields such as computational engineering, statistics, data-science, and machine learning, who depend on numerical solvers in linear algebra.

This edited book focuses on concepts and their applications using the theory of conceptual spaces, one of today's most central tracks of cognitive science discourse. It features 15 papers based on topics presented at the Conceptual Spaces @ Work 2016 conference. The contributors interweave both theory and applications in their papers. Among the first mentioned are studies on metatheories, logical and systemic implications of the theory, as well as relations between concepts and language. Examples of the latter include explanatory models of paradigm shifts and evolution in science as well as dilemmas and issues of health, ethics, and education. The theory of conceptual spaces overcomes many translational issues between academic theoretization and practical applications. The paradigm is mainly associated with structural explanations, such as categorization and meronomy. However, the community has also been relating it to relations, functions, and systems. The book presents work that provides a geometric model for the representation of human conceptual knowledge that bridges the symbolic and the sub-conceptual levels of representation. The model has already proven to have a broad range of applicability beyond cognitive science and even across a number of disciplines related to concepts and representation.

As today's world continues to advance, Artificial Intelligence (AI) is a field that has become a staple of technological development and led to the advancement of numerous professional industries. An application within AI that has gained attention is machine learning. Machine learning uses statistical techniques and algorithms to give computer systems the ability to understand and its popularity has circulated through many trades. Understanding this technology and its countless implementations is pivotal for scientists and researchers across the world. The Handbook of Research on Emerging Trends and Applications of Machine Learning provides a high-level understanding of various machine learning algorithms along with modern tools and techniques using Artificial Intelligence. In addition, this book explores the critical role that machine learning plays in a variety of professional fields including healthcare, business, and computer science. While highlighting topics including image processing, predictive analytics, and smart grid management, this book is ideally designed for developers, data scientists, business analysts, information architects, finance agents, healthcare professionals, researchers, retail traders, professors, and graduate students seeking current research on the benefits, implementations, and trends of machine learning.

Numerical Methods for Linear Control Systems Design and Analysis is an interdisciplinary textbook aimed at systematic descriptions and implementations of numerically-viable algorithms based on well-established, efficient and stable modern numerical linear techniques for mathematical problems arising in the design and analysis of linear control systems both for the first- and second-order models. MATLAB-based software is included for implementing all of the major algorithms from the book.
* Unique coverage of modern mathematical concepts such as parallel computations, second-order systems, and large-scale solutions
* Background material in linear algebra, numerical linear algebra, and control theory included in text
* Step-by-step explanations of the algorithms and examples
* Includes MATLAB-based solution software

Rooted in a pedagogically successful problem-solving approach to linear algebra, this work fills a gap in the literature that is sharply divided between, on the one end, elementary texts with only limited exercises and examples, and, at the other end, books too advanced in prerequisites and too specialized in focus to appeal to a wide audience. Instead, it clearly develops the theoretical foundations of vector spaces, linear equations, matrix algebra, eigenvectors, and orthogonality, while simultaneously emphasizing applications to fields such as biology, economics, computer graphics, electrical engineering, cryptography, and political science.Key features: * Intertwined discussion of linear algebra and geometry* Example-driven exposition; each section starts with a concise overview of important concepts, followed by a selection of fully-solved problems* Over 500 problems are carefully selected for instructive appeal, elegance, and theoretical importance; roughly half include complete solutions* Two or more solutions provided to many of the problems; paired solutions range from step-by-step, elementary methods whose purpose is to strengthen basic comprehension to more sophisticated, self-study manual for professional scientists and mathematicians. Complete with bibliography and index, this work is a natural bridge between pure/ applied mathematics and the natural/social sciences, appropriate for any student or researcher who needs a strong footing in the theory, problem-solving, and model-building that are the subject's hallmark. I

This second volume of Handbook of Automated Reasoning covers topics such as higher-order logic and logical frameworks, higher-order unification and matching, logical frameworks, proof-assistants using dependent type systems, and nonclassical logics.

This book discusses recent advances and research in applied mathematics, statistics and their applications in computing. It features papers presented at the fourth conference in the series organized at the Indian Institute of Technology (Banaras Hindu University), Varanasi, India, on 9 - 11 January 2018 on areas of current interest, including operations research, soft computing, applied mathematical modelling, cryptology, and security analysis. The conference has emerged as a powerful forum, bringing together leading academic scientists, experts from industry, and researchers and offering a venue to discuss, interact and collaborate to stimulate the advancement of mathematics and its applications in computer science. The education of future consumers, users, producers, developers and researchers of mathematics and its applications is an important challenge in modern society, and as such, mathematics and its application in computer science are of vital significance to all spectrums of the community, as well as to mathematicians and computing professionals across different educational levels and disciplines. With contributions by leading international experts, this book motivates and creates interest among young researchers.

This book provides a tutorial in the use of Altair Compose and Altair Activate, software packages that provide system modeling and simulation facilities. Advanced system modeling software provide multiple ways of creating models: models can be programmed in specialized languages, graphically constructed as block-diagrams and state machines, or expressed mathematically in equation-based languages. Compose and Activate are introduced in this text in two parts. The first part introduces the multi-language environment of Compose and its use for modeling, simulation and optimization. The second describes the graphical system modeling and optimization with Activate, an open-system environment providing signal-based modeling as well as physical system component-based modeling. Throughout both parts are applied examples from mechanical, biological, and electrical systems, as well as control and signal processing systems. This book will be an invaluable addition with many examples both for those just interested in OML and those doing industrial scale modeling, simulation, and design. All examples are worked using the free basic editions of Activate and Compose that are available.

The books in this trilogy capture the foundational core of advanced informatics. The authors make the foundations accessible, enabling students to become effective problem solvers. This first volume establishes the inductive approach as a fundamental principle for system and domain analysis. After a brief introduction to the elementary mathematical structures, such as sets, propositional logic, relations, and functions, the authors focus on the separation between syntax (representation) and semantics (meaning), and on the advantages of the consistent and persistent use of inductive definitions. They identify compositionality as a feature that not only acts as a foundation for algebraic proofs but also as a key for more general scalability of modeling and analysis. A core principle throughout is invariance, which the authors consider a key for the mastery of change, whether in the form of extensions, transformations, or abstractions. This textbook is suitable for undergraduate and graduate courses in computer science and for self-study. Most chapters contain exercises and the content has been class-tested over many years in various universities.

The third edition of this handbook is designed to provide a broad coverage of the concepts, implementations, and applications in metaheuristics. The book's chapters serve as stand-alone presentations giving both the necessary underpinnings as well as practical guides for implementation. The nature of metaheuristics invites an analyst to modify basic methods in response to problem characteristics, past experiences, and personal preferences, and the chapters in this handbook are designed to facilitate this process as well. This new edition has been fully revised and features new chapters on swarm intelligence and automated design of metaheuristics from flexible algorithm frameworks. The authors who have contributed to this volume represent leading figures from the metaheuristic community and are responsible for pioneering contributions to the fields they write about. Their collective work has significantly enriched the field of optimization in general and combinatorial optimization in particular.Metaheuristics are solution methods that orchestrate an interaction between local improvement procedures and higher level strategies to create a process capable of escaping from local optima and performing a robust search of a solution space. In addition, many new and exciting developments and extensions have been observed in the last few years. Hybrids of metaheuristics with other optimization techniques, like branch-and-bound, mathematical programming or constraint programming are also increasingly popular. On the front of applications, metaheuristics are now used to find high-quality solutions to an ever-growing number of complex, ill-defined real-world problems, in particular combinatorial ones. This handbook should continue to be a great reference for researchers, graduate students, as well as practitioners interested in metaheuristics.

This book includes review articles in the field of elliptic integrals, elliptic functions and modular forms intending to foster the discussion between theoretical physicists working on higher loop calculations and mathematicians working in the field of modular forms and functions and analytic solutions of higher order differential and difference equations.

Wagman gives a broad, structured, and detailed account of advancing intellectual developments in both psychological and computational theories of the nature of problem- solving. Known for originating the PLATO computer-based Dilemma Counseling System, psychologist Wagman is the author of 17 books, including "Scientific Discovery Processes in Humans and Computers "(Praeger, 2000).

In this book, Professor Emeritus Morton Wagman gives a broad, structured, and detailed account of advancing intellectual developments in both psychological and computational theories of the nature of problem solving. Known for originating the PLATO computer-based Dilemma Counseling System, psychologist Wagman is the author of 17 books, including "Scientific Discovery Processes in Humans and Computers, "(Praeger, 2000)

Of special interest to readers will be Wagman's conclusion that artificial intelligence problem-solving systems are deepening and broadening theories of human problem solving from scientific to everyday approaches. Scholars and professionals in psychology, artificial intelligence, and cognitive science will consider this a volume a valuable addition to their collections.

This volume contains papers based on presentations at the "Nagoya Winter Workshop 2015: Reality and Measurement in Algebraic Quantum Theory (NWW 2015)", held in Nagoya, Japan, in March 2015. The foundations of quantum theory have been a source of mysteries, puzzles, and confusions, and have encouraged innovations in mathematical languages to describe, analyze, and delineate this wonderland. Both ontological and epistemological questions about quantum reality and measurement have been placed in the center of the mysteries explored originally by Bohr, Heisenberg, Einstein, and Schroedinger. This volume describes how those traditional problems are nowadays explored from the most advanced perspectives. It includes new research results in quantum information theory, quantum measurement theory, information thermodynamics, operator algebraic and category theoretical foundations of quantum theory, and the interplay between experimental and theoretical investigations on the uncertainty principle. This book is suitable for a broad audience of mathematicians, theoretical and experimental physicists, and philosophers of science.

This textbook provides an introduction to the growing interdisciplinary field of computational science. It combines a foundational development of numerical methods with a variety of illustrative applications spread across numerous areas of science and engineering. The intended audience is the undergraduate who has completed introductory coursework in mathematics and computer science. Students gain computational acuity by authoring their own numerical routines and by practicing with numerical methods as they solve computational models. This education encourages students to learn the importance of answering: How expensive is a calculation, how trustworthy is a calculation, and how might we model a problem to apply a desired numerical method? The text is written in two parts. Part I provides a succinct, one-term inauguration into the primary routines on which a further study of computational science rests. The material is organized so that the transition to computational science from coursework in calculus, differential equations, and linear algebra is natural. Beyond the mathematical and computational content of Part I, students gain proficiency with elemental programming constructs and visualization, which are presented in MATLAB syntax. The focus of Part II is modeling, wherein students build computational models, compute solutions, and report their findings. The models purposely intersect numerous areas of science and engineering to demonstrate the pervasive role played by computational science.

There are many proposed aims for scientific inquiry - to explain or predict events, to confirm or falsify hypotheses, or to find hypotheses that cohere with our other beliefs in some logical or probabilistic sense. This book is devoted to a different proposal - that the logical structure of the scientist's method should guarantee eventual arrival at the truth, given the scientist's background assumptions. Interest in this methodological property, called "logical reliability", stems from formal learning theory, which draws its insights not from the theory of probability, but from the theory of computability. Kelly first offers an accessible explanation of formal learning theory, then goes on to develop and explore a systematic framework in which various standard learning-theoretic results can be seen as special cases of simpler and more general considerations. Finally, Kelly clarifies the relationship between the resulting framework and other standard issues in the philosophy of science, such as probability, causation, and relativism. Extensively illustrated with figures by the author, The Logic of Reliable Inquiry assumes only introductory knowledge of basic logic and computability theory. It is a major contribution to the literature and will be essential reading for scientists, statiticians, psychologists, linguists, logicians, and philosophers.

Now, for the first time, publication of the landmark work in backpropagation Scientists, engineers, statisticians, operations researchers, and other investigators involved in neural networks have long sought direct access to Paul Werbos's groundbreaking, much-cited 1974 Harvard doctoral thesis, The Roots of Backpropagation, which laid the foundation of backpropagation. Now, with the publication of its full text, these practitioners can go straight to the original material and gain a deeper, practical understanding of this unique mathematical approach to social studies and related fields. In addition, Werbos has provided three more recent research papers, which were inspired by his original work, and a new guide to the field. Originally written for readers who lacked any knowledge of neural nets, The Roots of Backpropagation firmly established both its historical and continuing significance as it:
* Demonstrates the ongoing value and new potential of backpropagation
* Creates a wealth of sound mathematical tools useful across disciplines
* Sets the stage for the emerging area of fast automatic differentiation
* Describes new designs for forecasting and control which exploit backpropagation
* Unifies concepts from Freud, Jung, biologists, and others into a new mathematical picture of the human mind and how it works
* Certifies the viability of Deutsch's model of nationalism as a predictive tool--as well as the utility of extensions of this central paradigm
"What a delight it was to see Paul Werbos rediscover Freud's version of 'back-propagation.' Freud was adamant (in The Project for a Scientific Psychology) that selective learning could only take place if the presynaptic neuron was as influenced as is the postsynaptic neuron during excitation. Such activation of both sides of the contact barrier (Freud's name for the synapse) was accomplished by reducing synaptic resistance by the absorption of 'energy' at the synaptic membranes. Not bad for 1895 But Werbos 1993 is even better." --Karl H. Pribram Professor Emeritus, Stanford University

An essential contribution to the study of the history of computers, this work identifies the computer's impact on the physical, biological, cognitive, and medical sciences. References fundamental to the understudied area of the history of scientific computing also document the significant role of the sciences in helping to shape the development of computer technology. More broadly, the many resources on scientific computing help demonstrate how the computer was the most significant scientific instrument of the 20th century.

The only guide of its kind covering the use and impact of computers on the the physical, biological, medical, and cognitive sciences, it contains more than 1,000 annotated citations to carefully selected secondary and primary resources. Historians of technology and science will find this a very useful resource. Computer scientists, physicians, biologists, chemists, and geologists will also benefit from this extensive bibliography on the history of computer applications and the sciences.

This book takes a foundational approach to the semantics of probabilistic programming. It elaborates a rigorous Markov chain semantics for the probabilistic typed lambda calculus, which is the typed lambda calculus with recursion plus probabilistic choice. The book starts with a recapitulation of the basic mathematical tools needed throughout the book, in particular Markov chains, graph theory and domain theory, and also explores the topic of inductive definitions. It then defines the syntax and establishes the Markov chain semantics of the probabilistic lambda calculus and, furthermore, both a graph and a tree semantics. Based on that, it investigates the termination behavior of probabilistic programs. It introduces the notions of termination degree, bounded termination and path stoppability and investigates their mutual relationships. Lastly, it defines a denotational semantics of the probabilistic lambda calculus, based on continuous functions over probability distributions as domains. The work mostly appeals to researchers in theoretical computer science focusing on probabilistic programming, randomized algorithms, or programming language theory.

This textbook provides concise coverage of the basics of linear and integer programming which, with megatrends toward optimization, machine learning, big data, etc., are becoming fundamental toolkits for data and information science and technology. The authors' approach is accessible to students from almost all fields of engineering, including operations research, statistics, machine learning, control system design, scheduling, formal verification and computer vision. The presentations enables the basis for numerous approaches to solving hard combinatorial optimization problems through randomization and approximation. Readers will learn to cast various problems that may arise in their research as optimization problems, understand the cases where the optimization problem will be linear, choose appropriate solution methods and interpret results appropriately.