This book delivers theoretical and practical knowledge of Genetic Algorithms (GA) for the purpose of practical applications. It provides a methodology for a GA-based search strategy with the integration of several Artificial Life and Artificial Intelligence techniques, such as memetic concepts, swarm intelligence, and foraging strategies. The development of such tools contributes to better optimizing methodologies when addressing tasks from areas such as robotics, financial forecasting, and data mining in bioinformatics.The emphasis of this book is on applicability to the real world. Tasks from application areas - optimization of the trading rule in foreign exchange (FX) and stock prices, economic load dispatch in power system, exit/door placement for evacuation planning, and gene regulatory network inference in bioinformatics - are studied, and the resultant empirical investigations demonstrate how successful the proposed approaches are when solving real-world tasks of great importance.

AI for Scientific Discovery provides an accessible introduction to the wide-ranging applications of artificial intelligence technologies in scientific research and discovery across the full breadth of scientific disciplines. Artificial intelligence technologies support discovery science in multiple different ways. They support literature management and synthesis, allowing the wealth of what has already been discovered and reported on to be integrated and easily accessed. They play a central role in data analysis and interpretation - in the context of what is called 'data science'. AI is also helping to combat the reproducibility crisis in scientific research, by underpinning the discovery process with AI-enabled standards and pipelines, support the management of large-scale data and knowledge resources so that they can be shared, integrated and serve as a background 'knowledge ecosystem' into which new discoveries can be embedded. However, there are limitations to what AI can achieve and its outputs can be biased and confounded thus should not be blindly trusted. The latest generation of hybrid and 'human-in-the-loop' AI technologies have as their objective a balance between human inputs and insights and the power of the number-crunching and statistical inference at massive scale that AI technologies are best at.

Sir William Rowan Hamilton was a genius, and will be remembered for his significant contributions to physics and mathematics. The Hamiltonian, which is used in quantum physics to describe the total energy of a system, would have been a major achievement for anyone, but Hamilton also invented quaternions, which paved the way for modern vector analysis.

Quaternions are one of the most documented inventions in the history of mathematics, and this book is about their invention, and how they are used to rotate vectors about an arbitrary axis. Apart from introducing the reader to the features of quaternions and their associated algebra, the book provides valuable historical facts that bring the subject alive.

Quaternions for Computer Graphics introduces the reader to quaternion algebra by describing concepts of sets, groups, fields and rings. It also includes chapters on imaginary quantities, complex numbers and the complex plane, which are essential to understanding quaternions. The book contains many illustrations and worked examples, which make it essential reading for students, academics, researchers and professional practitioners.

This book is an essential tool written to be used as the primary text for an undergraduate or early postgraduate course as well as a reference book for engineers and scientists who want to quickly develop finite-element programs. Regarding the formulation of the finite element method, the book emphasizes the essential unity of all processes of approximation used in the solution of differential equations such as finite differences, finite elements and boundary elements. Computational aspects are presented in Maple. Three Maple packages were specially developed for this book and are included in a companion CD-ROM.

Modelling Transitions shows what computational, formal and data-driven approaches can and could mean for sustainability transitions research, presenting the state-of-the-art and exploring what lies beyond. Featuring contributions from many well-known authors, this book presents the various benefits of modelling for transitions research. More than just taking stock, it also critically examines what modelling of transformative change means and could mean for transitions research and for other disciplines that study societal changes. This includes identifying a variety of approaches currently not part of the portfolios of transitions modellers. Far from only singing praise, critical methodological and philosophical introspection are key aspects of this important book. This book speaks to modellers and non-modellers alike who value the development of robust knowledge on transitions to sustainability, including colleagues in congenial fields. Be they students, researchers or practitioners, everyone interested in transitions should find this book relevant as reference, resource and guide.

Divided roughly into two sections, this book provides a brief history of the development of ECG along with heart rate variability (HRV) algorithms and the engineering innovations over the last decade in this area. It reviews clinical research, presents an overview of the clinical field, and the importance of heart rate variability in diagnosis. The book then discusses the use of particular ECG and HRV algorithms in the context of clinical applications.

This collection of essays explores the different ways the insights from complexity theory can be applied to law. Complexity theory - a variant of systems theory - views law as an emergent, complex, self-organising system comprised of an interactive network of actors and systems that operate with no overall guiding hand, giving rise to complex, collective behaviour in law communications and actions. Addressing such issues as the unpredictability of legal systems, the ability of legal systems to adapt to changes in society, the importance of context, and the nature of law, the essays look to the implications of a complexity theory analysis for the study of public policy and administrative law, international law and human rights, regulatory practices in business and finance, and the practice of law and legal ethics. These are areas where law, which craves certainty, encounters unending, irresolvable complexity. This collection shows the many ways complexity theory thinking can reshape and clarify our understanding of the various problems relating to the theory and practice of law.

Exact eigenvalues, eigenvectors, and principal vectors of operators with infinite dimensional ranges can rarely be found. Therefore, one must approximate such operators by finite rank operators, then solve the original eigenvalue problem approximately. Serving as both an outstanding text for graduate students and as a source of current results for research scientists, Spectral Computations for Bounded Operators addresses the issue of solving eigenvalue problems for operators on infinite dimensional spaces. From a review of classical spectral theory through concrete approximation techniques to finite dimensional situations that can be implemented on a computer, this volume illustrates the marriage of pure and applied mathematics. It contains a variety of recent developments, including a new type of approximation that encompasses a variety of approximation methods but is simple to verify in practice. It also suggests a new stopping criterion for the QR Method and outlines advances in both the iterative refinement and acceleration techniques for improving the accuracy of approximations. The authors illustrate all definitions and results with elementary examples and include numerous exercises. Spectral Computations for Bounded Operators thus serves as both an outstanding text for second-year graduate students and as a source of current results for research scientists.

Fuzzy social choice theory is useful for modeling the uncertainty and imprecision prevalent in social life yet it has been scarcely applied and studied in the social sciences. Filling this gap, Application of Fuzzy Logic to Social Choice Theory provides a comprehensive study of fuzzy social choice theory. The book explains the concept of a fuzzy maximal subset of a set of alternatives, fuzzy choice functions, the factorization of a fuzzy preference relation into the "union" (conorm) of a strict fuzzy relation and an indifference operator, fuzzy non-Arrowian results, fuzzy versions of Arrow's theorem, and Black's median voter theorem for fuzzy preferences. It examines how unambiguous and exact choices are generated by fuzzy preferences and whether exact choices induced by fuzzy preferences satisfy certain plausible rationality relations. The authors also extend known Arrowian results involving fuzzy set theory to results involving intuitionistic fuzzy sets as well as the Gibbard-Satterthwaite theorem to the case of fuzzy weak preference relations. The final chapter discusses Georgescu's degree of similarity of two fuzzy choice functions.

The essays in this book look at the question of whether physics can be based on information, or - as John Wheeler phrased it - whether we can get "It from Bit". They are based on the prize-winning essays submitted to the FQXi essay competition of the same name, which drew over 180 entries. The eighteen contributions address topics as diverse as quantum foundations, entropy conservation, nonlinear logic and countable spacetime. Together they provide stimulating reading for all physics aficionados interested in the possible role(s) of information in the laws of nature. The Foundational Questions Institute, FQXi, catalyzes, supports, and disseminates research on questions at the foundations of physics and cosmology, particularly new frontiers and innovative ideas integral to a deep understanding of reality, but unlikely to be supported by conventional funding sources.

This book offers a clear and comprehensive introduction to broad learning, one of the novel learning problems studied in data mining and machine learning. Broad learning aims at fusing multiple large-scale information sources of diverse varieties together, and carrying out synergistic data mining tasks across these fused sources in one unified analytic. This book takes online social networks as an application example to introduce the latest alignment and knowledge discovery algorithms. Besides the overview of broad learning, machine learning and social network basics, specific topics covered in this book include network alignment, link prediction, community detection, information diffusion, viral marketing, and network embedding.

Synthetic Aperture Radar Automatic Detection Algorithms (SARADA) for Oil Spills conveys the pivotal tool required to fully comprehend the advanced algorithms in radar monitoring and detection of oil spills, particularly quantum computing and algorithms as a keystone to comprehending theories and algorithms behind radar imaging and detection of marine pollution. Bridging the gap between modern quantum mechanics and computing detection algorithms of oil spills, this book contains precise theories and techniques for automatic identification of oil spills from SAR measurements. Based on modern quantum physics, the book also includes the novel theory on radar imaging mechanism of oil spills. With the use of precise quantum simulation of trajectory movements of oil spills using a sequence of radar images, this book demonstrates the use of SARADA for contamination by oil spills as a promising novel technique. Key Features: Introduces basic concepts of a radar remote sensing. Fills a gap in the knowledge base of quantum theory and microwave remote sensing. Discusses the important aspects of oil spill imaging in radar data in relation to the quantum theory. Provides recent developments and progresses of automatic detection algorithms of oil spill from radar data. Presents 2-D oil spill radar data in 4-D images.

For computer scientists, especially those in the security field, the use of chaos has been limited to the computation of a small collection of famous but unsuitable maps that offer no explanation of why chaos is relevant in the considered contexts. Discrete Dynamical Systems and Chaotic Machines: Theory and Applications shows how to make finite machines, such as computers, neural networks, and wireless sensor networks, work chaotically as defined in a rigorous mathematical framework. Taking into account that these machines must interact in the real world, the authors share their research results on the behaviors of discrete dynamical systems and their use in computer science. Covering both theoretical and practical aspects, the book presents: Key mathematical and physical ideas in chaos theory Computer science fundamentals, clearly establishing that chaos properties can be satisfied by finite state machines Concrete applications of chaotic machines in computer security, including pseudorandom number generators, hash functions, digital watermarking, and steganography Concrete applications of chaotic machines in wireless sensor networks, including secure data aggregation and video surveillance Until the authors' recent research, the practical implementation of the mathematical theory of chaos on finite machines raised several issues. This self-contained book illustrates how chaos theory enables the study of computer security problems, such as steganalysis, that otherwise could not be tackled. It also explains how the theory reinforces existing cryptographically secure tools and schemes.

This book provides theoretical and practical knowledge on AI and swarm intelligence. It provides a methodology for EA (evolutionary algorithm)-based approach for complex adaptive systems with the integration of several meta-heuristics, e.g., ACO (Ant Colony Optimization), ABC (Artificial Bee Colony), and PSO (Particle Swarm Optimization), etc. These developments contribute towards better problem-solving methodologies in AI. The book also covers emerging uses of swarm intelligence in applications such as complex adaptive systems, reaction-diffusion computing, and diffusion-limited aggregation, etc. Another emphasis is its real-world applications. We give empirical examples from real-world problems and show that the proposed approaches are successful when addressing tasks from such areas as swarm robotics, silicon traffics, image understanding, Vornoi diagrams, queuing theory, and slime intelligence, etc. Each chapter begins with the background of the problem followed by the current state-of-the-art techniques of the field, and ends with a detailed discussion. In addition, the simulators, based on optimizers such as PSO and ABC complex adaptive system simulation, are described in detail. These simulators, as well as some source codes, are available online on the author's website for the benefit of readers interested in getting some hands-on experience of the subject. The concepts presented in this book aim to promote and facilitate the effective research in swarm intelligence approaches in both theory and practice. This book would also be of value to other readers because it covers interdisciplinary research topics that encompass problem-solving tasks in AI, complex adaptive systems, and meta-heuristics.

Pattern Recognition Algorithms for Data Mining addresses different pattern recognition (PR) tasks in a unified framework with both theoretical and experimental results. Tasks covered include data condensation, feature selection, case generation, clustering/classification, and rule generation and evaluation. This volume presents various theories, methodologies, and algorithms, using both classical approaches and hybrid paradigms. The authors emphasize large datasets with overlapping, intractable, or nonlinear boundary classes, and datasets that demonstrate granular computing in soft frameworks. Organized into eight chapters, the book begins with an introduction to PR, data mining, and knowledge discovery concepts. The authors analyze the tasks of multi-scale data condensation and dimensionality reduction, then explore the problem of learning with support vector machine (SVM). They conclude by highlighting the significance of granular computing for different mining tasks in a soft paradigm.

August 6, 2009 Author, Jon Kleinberg, was recently cited in the New York Times for his statistical analysis research in the Internet age. Algorithm Design introduces algorithms by looking at the real-world problems that motivate them. The book teaches students a range of design and analysis techniques for problems that arise in computing applications. The text encourages an understanding of the algorithm design process and an appreciation of the role of algorithms in the broader field of computer science.

After a decade of development, genetic algorithms and genetic programming have become a widely accepted toolkit for computational finance. Genetic Algorithms and Genetic Programming in Computational Finance is a pioneering volume devoted entirely to a systematic and comprehensive review of this subject. Chapters cover various areas of computational finance, including financial forecasting, trading strategies development, cash flow management, option pricing, portfolio management, volatility modeling, arbitraging, and agent-based simulations of artificial stock markets. Two tutorial chapters are also included to help readers quickly grasp the essence of these tools. Finally, a menu-driven software program, Simple GP, accompanies the volume, which will enable readers without a strong programming background to gain hands-on experience in dealing with much of the technical material introduced in this work.

This practically-focused study guide introduces the fundamentals of discrete mathematics through an extensive set of classroom-tested problems. Each chapter presents a concise introduction to the relevant theory, followed by a detailed account of common challenges and methods for overcoming these. The reader is then encouraged to practice solving such problems for themselves, by tackling a varied selection of questions and assignments of different levels of complexity. This updated second edition now covers the design and analysis of algorithms using Python, and features more than 50 new problems, complete with solutions. Topics and features: provides a substantial collection of problems and examples of varying levels of difficulty, suitable for both laboratory practical training and self-study; offers detailed solutions to each problem, applying commonly-used methods and computational schemes; introduces the fundamentals of mathematical logic, the theory of algorithms, Boolean algebra, graph theory, sets, relations, functions, and combinatorics; presents more advanced material on the design and analysis of algorithms, including Turing machines, asymptotic analysis, and parallel algorithms; includes reference lists of trigonometric and finite summation formulae in an appendix, together with basic rules for differential and integral calculus. This hands-on workbook is an invaluable resource for undergraduate students of computer science, informatics, and electronic engineering. Suitable for use in a one- or two-semester course on discrete mathematics, the text emphasizes the skills required to develop and implement an algorithm in a specific programming language.

Computational Complexity of Counting and Sampling provides readers with comprehensive and detailed coverage of the subject of computational complexity. It is primarily geared toward researchers in enumerative combinatorics, discrete mathematics, and theoretical computer science. The book covers the following topics: Counting and sampling problems that are solvable in polynomial running time, including holographic algorithms; #P-complete counting problems; and approximation algorithms for counting and sampling. First, it opens with the basics, such as the theoretical computer science background and dynamic programming algorithms. Later, the book expands its scope to focus on advanced topics, like stochastic approximations of counting discrete mathematical objects and holographic algorithms. After finishing the book, readers will agree that the subject is well covered, as the book starts with the basics and gradually explores the more complex aspects of the topic. Features: Each chapter includes exercises and solutions Ideally written for researchers and scientists Covers all aspects of the topic, beginning with a solid introduction, before shifting to computational complexity's more advanced features, with a focus on counting and sampling

Anyone browsing at the stationery store will see an incredible array of pop-up cards available for any occasion. The workings of pop-up cards and pop-up books can be remarkably intricate. Behind such designs lies beautiful geometry involving the intersection of circles, cones, and spheres, the movements of linkages, and other constructions. The geometry can be modelled by algebraic equations, whose solutions explain the dynamics. For example, several pop-up motions rely on the intersection of three spheres, a computation made every second for GPS location. Connecting the motions of the card structures with the algebra and geometry reveals abstract mathematics performing tangible calculations. Beginning with the nephroid in the 19th-century, the mathematics of pop-up design is now at the frontiers of rigid origami and algorithmic computational complexity. All topics are accessible to those familiar with high-school mathematics; no calculus required. Explanations are supplemented by 140+ figures and 20 animations.

Originally published in 1995, Large Deviations for Performance Analysis consists of two synergistic parts. The first half develops the theory of large deviations from the beginning, through recent results on the theory for processes with boundaries, keeping to a very narrow path: continuous-time, discrete-state processes. By developing only what is needed for the applications, the theory is kept to a manageable level, both in terms of length and in terms of difficulty. Within its scope, the treatment is detailed, comprehensive and self-contained. As the book shows, there are sufficiently many interesting applications of jump Markov processes to warrant a special treatment. The second half is a collection of applications developed at Bell Laboratories. The applications cover large areas of the theory of communication networks: circuit switched transmission, packet transmission, multiple access channels, and the M/M/1 queue. Aspects of parallel computation are covered as well including, basics of job allocation, rollback-based parallel simulation, assorted priority queueing models that might be used in performance models of various computer architectures, and asymptotic coupling of processors. These applications are thoroughly analysed using the tools developed in the first half of the book.

Marking a distinct departure from the perspectives of frame theory and discrete transforms, this book provides a comprehensive mathematical and algorithmic introduction to wavelet theory. As such, it can be used as either a textbook or reference guide. As a textbook for graduate mathematics students and beginning researchers, it offers detailed information on the basic theory of framelets and wavelets, complemented by self-contained elementary proofs, illustrative examples/figures, and supplementary exercises. Further, as an advanced reference guide for experienced researchers and practitioners in mathematics, physics, and engineering, the book addresses in detail a wide range of basic and advanced topics (such as multiwavelets/multiframelets in Sobolev spaces and directional framelets) in wavelet theory, together with systematic mathematical analysis, concrete algorithms, and recent developments in and applications of framelets and wavelets. Lastly, the book can also be used to teach on or study selected special topics in approximation theory, Fourier analysis, applied harmonic analysis, functional analysis, and wavelet-based signal/image processing.

In the new edition of Neural Assemblies, the author places his original ideas and motivations within the framework of modern and cognitive neuroscience and gives a short and focused overview of the development of computational neuroscience and artificial neural networks over the last 40 years. In this book the author develops a theory of how the human brain might function. Starting with a motivational introduction to the brain as an organ of information processing, he presents a computational perspective on the basic concepts and ideas of neuroscience research on the underlying principles of brain function. In addition, the reader is introduced to the most important methods from computer science and mathematical modeling that are required for a computational understanding of information processing in the brain. Written by an expert in the field of neural information processing, this book offers a personal historical view of the development of artificial intelligence, artificial neural networks, and computational cognitive neuroscience over the last 40 years, with a focus on the realization of higher cognitive functions rather than more peripheral sensory or motor organization. The book is therefore aimed at students and researchers who want to understand how the basic neuroscientific and computational concepts in the study of brain function have changed over the last decades.

In recent years game theory has had a substantial impact on computer science, especially on Internet- and e-commerce-related issues. Algorithmic Game Theory, first published in 2007, develops the central ideas and results of this exciting area in a clear and succinct manner. More than 40 of the top researchers in this field have written chapters that go from the foundations to the state of the art. Basic chapters on algorithmic methods for equilibria, mechanism design and combinatorial auctions are followed by chapters on important game theory applications such as incentives and pricing, cost sharing, information markets and cryptography and security. This definitive work will set the tone of research for the next few years and beyond. Students, researchers, and practitioners alike need to learn more about these fascinating theoretical developments and their widespread practical application.

A riveting account of espionage for the digital age, from one of America's leading intelligence experts Spying has never been more ubiquitous-or less understood. The world is drowning in spy movies, TV shows, and novels, but universities offer more courses on rock and roll than on the CIA and there are more congressional experts on powdered milk than espionage. This crisis in intelligence education is distorting public opinion, fueling conspiracy theories, and hurting intelligence policy. In Spies, Lies, and Algorithms, Amy Zegart separates fact from fiction as she offers an engaging and enlightening account of the past, present, and future of American espionage as it faces a revolution driven by digital technology. Drawing on decades of research and hundreds of interviews with intelligence officials, Zegart provides a history of U.S. espionage, from George Washington's Revolutionary War spies to today's spy satellites; examines how fictional spies are influencing real officials; gives an overview of intelligence basics and life inside America's intelligence agencies; explains the deadly cognitive biases that can mislead analysts; and explores the vexed issues of traitors, covert action, and congressional oversight. Most of all, Zegart describes how technology is empowering new enemies and opportunities, and creating powerful new players, such as private citizens who are successfully tracking nuclear threats using little more than Google Earth. And she shows why cyberspace is, in many ways, the ultimate cloak-and-dagger battleground, where nefarious actors employ deception, subterfuge, and advanced technology for theft, espionage, and information warfare. A fascinating and revealing account of espionage for the digital age, Spies, Lies, and Algorithms is essential reading for anyone who wants to understand the reality of spying today.