Search

Swarm Intelligence (SI) is one of the most important and challenging paradigms under the umbrella of computational intelligence. It focuses on the research of collective behaviours of a swarm in nature and/or social phenomenon to solve complicated and difficult problems which cannot be handled by traditional approaches. Thousands of papers are published each year presenting new algorithms, new improvements and numerous real world applications. This makes it hard for researchers and students to share their ideas with other colleagues; follow up the works from other researchers with common interests; and to follow new developments and innovative approaches. This complete and timely collection fills this gap by presenting the latest research systematically and thoroughly to provide readers with a full view of the field of swarm. Students will learn the principles and theories of typical swarm intelligence algorithms; scholars will be inspired with promising research directions; and practitioners will find suitable methods for their applications of interest along with useful instructions.

Mobile crowdsensing (MCS) is emerging as a novel sensing paradigm in the Internet of Things (IoTs) due to the proliferation of smart devices (e.g., smartphones, wearable devices) in people's daily lives. These ubiquitous devices provide an opportunity to harness the wisdom of crowds by recruiting mobile users to collectively perform sensing tasks, which largely collect data about a wide range of human activities and the surrounding environment. However, users suffer from resource consumption such as battery, processing power, and storage, which discourages users'participation. To ensure the participation rate, it is necessary to employ an incentive mechanism to compensate users'costs such that users are willing to take part in crowdsensing. This book sheds light on the design of incentive mechanisms for MCS in the context of game theory. Particularly, this book presents several game-theoretic models for MCS in different scenarios. In Chapter 1, the authors present an overview of MCS and state the significance of incentive mechanism for MCS. Then, in Chapter 2, 3, 4, and 5, the authors propose a long-term incentive mechanism, a fair incentive mechanism, a collaborative incentive mechanism, and a coopetition-aware incentive mechanism for MCS, respectively. Finally, Chapter 6 summarizes this book and point out the future directions. This book is of particular interest to the readers and researchers in the field of IoT research, especially in the interdisciplinary field of network economics and IoT.

This book covers the description of both conventional methods and advanced methods. In conventional methods, visual tracking techniques such as stochastic, deterministic, generative, and discriminative are discussed. The conventional techniques are further explored for multi-stage and collaborative frameworks. In advanced methods, various categories of deep learning-based trackers and correlation filter-based trackers are analyzed. The book also: Discusses potential performance metrics used for comparing the efficiency and effectiveness of various visual tracking methods Elaborates on the salient features of deep learning trackers along with traditional trackers, wherein the handcrafted features are fused to reduce computational complexity Illustrates various categories of correlation filter-based trackers suitable for superior and efficient performance under tedious tracking scenarios Explores the future research directions for visual tracking by analyzing the real-time applications The book comprehensively discusses various deep learning-based tracking architectures along with conventional tracking methods. It covers in-depth analysis of various feature extraction techniques, evaluation metrics and benchmark available for performance evaluation of tracking frameworks. The text is primarily written for senior undergraduates, graduate students, and academic researchers in the fields of electrical engineering, electronics and communication engineering, computer engineering, and information technology.

This book offers a comprehensive introduction to technological advances in Internet of Vehicles (IoV), including vehicular communications, vehicular system architectures, data dissemination algorithms, resource allocation schemes, and AI-enabled applications. It focuses on the state-of-the-art IoV with regard to three major directions, namely networking, cooperation, and intelligence, including advanced wireless communication technologies, algorithm theory, optimization mechanisms, and AI technologies. In addition, the book includes a number of case studies with system prototype implementation and hands-on experiments in IoV, making it suitable both as a technical reference work for professionals and as a textbook for graduate students.

This book addresses the urgent issue of massive and inefficient energy consumption by data centers, which have become the largest co-located computing systems in the world and process trillions of megabytes of data every second. Dynamic provisioning algorithms have the potential to be the most viable and convenient of approaches to reducing data center energy consumption by turning off unnecessary servers, but they incur additional costs from being unable to properly predict future workload demands that have only recently been mitigated by advances in machine-learned predictions.This book explores whether it is possible to design effective online dynamic provisioning algorithms that require zero future workload information while still achieving close-to-optimal performance. It also examines whether characterizing the benefits of utilizing the future workload information can then improve the design of online algorithms with predictions in dynamic provisioning. The book specifically develops online dynamic provisioning algorithms with and without the available future workload information. Readers will discover the elegant structure of the online dynamic provisioning problem in a way that reveals the optimal solution through divide-and-conquer tactics. The book teaches readers to exploit this insight by showing the design of two online competitive algorithms with competitive ratios characterized by the normalized size of a look-ahead window in which exact workload prediction is available.

Exploring the interrelations between generalized metric spaces, lattice-ordered groups, and order statistics, the book contains a new algebraic approach to Signal Processing Theory. It describes mathematical concepts and results important in the development, analysis, and optimization of signal processing algorithms intended for various applications. The book offers a solution of large-scale Signal Processing Theory problems of increasing both signal processing efficiency under prior uncertainty conditions and signal processing rate that is provided by multiplication-free signal processing algorithms based on lattice-ordered group operations.From simple basic relationships to computer simulation, the text covers a wide range of new mathematical techniques essential for understanding the proposed signal processing algorithms developed for solving the following problems: signal parameter and spectral estimation, signal filtering, detection, classification, and resolution; array signal processing; demultiplexing and demodulation in multi-channel communication systems and multi-station networks; wavelet analysis of 1D/ 2D signals. Along with discussing mathematical aspects, each chapter presents examples illustrating operation of signal processing algorithms developed for various applications.The book helps readers understand relations between known classic and obtained results as well as recent research trends in Signal Processing Theory and its applications, providing all necessary mathematical background concerning lattice-ordered groups to prepare readers for independent work in the marked directions including more advanced research and development.

This textbook introduces readers to the theoretical aspects of machine learning (ML) algorithms, starting from simple neuron basics, through complex neural networks, including generative adversarial neural networks and graph convolution networks. Most importantly, this book helps readers to understand the concepts of ML algorithms and enables them to develop the skills necessary to choose an apt ML algorithm for a problem they wish to solve. In addition, this book includes numerous case studies, ranging from simple time-series forecasting to object recognition and recommender systems using massive databases. Lastly, this book also provides practical implementation examples and assignments for the readers to practice and improve their programming capabilities for the ML applications.

The recent rapid growth in the variety and complexity of new machine learning architectures requires the development of improved methods for designing, analyzing, evaluating, and communicating machine learning technologies. Statistical Machine Learning: A Unified Framework provides students, engineers, and scientists with tools from mathematical statistics and nonlinear optimization theory to become experts in the field of machine learning. In particular, the material in this text directly supports the mathematical analysis and design of old, new, and not-yet-invented nonlinear high-dimensional machine learning algorithms.Features: Unified empirical risk minimization framework supports rigorous mathematical analyses of widely used supervised, unsupervised, and reinforcement machine learning algorithms Matrix calculus methods for supporting machine learning analysis and design applications Explicit conditions for ensuring convergence of adaptive, batch, minibatch, MCEM, and MCMC learning algorithms that minimize both unimodal and multimodal objective functions Explicit conditions for characterizing asymptotic properties of M-estimators and model selection criteria such as AIC and BIC in the presence of possible model misspecification This advanced text is suitable for graduate students or highly motivated undergraduate students in statistics, computer science, electrical engineering, and applied mathematics. The text is self-contained and only assumes knowledge of lower-division linear algebra and upper-division probability theory. Students, professional engineers, and multidisciplinary scientists possessing these minimal prerequisites will find this text challenging yet accessible.About the Author:Richard M. Golden (Ph.D., M.S.E.E., B.S.E.E.) is Professor of Cognitive Science and Participating Faculty Member in Electrical Engineering at the University of Texas at Dallas. Dr. Golden has published articles and given talks at scientific conferences on a wide range of topics in the fields of both statistics and machine learning over the past three decades. His long-term research interests include identifying conditions for the convergence of deterministic and stochastic machine learning algorithms and investigating estimation and inference in the presence of possibly misspecified probability models.

Optimization algorithms are the backbone of many modern technologies. In this thesis, we address the analysis and design of optimization algorithms from a systems theoretic viewpoint. By properly recasting the algorithm design as a controller synthesis problem, we derive methods that enable a systematic design of tailored optimization algorithms. We consider two specific classes of optimization algorithms: (i) distributed, and (ii) robust optimization algorithms. Concerning (i), we utilize ideas from geometric control in an innovative fashion to derive a novel methodology that enables the design of distributed optimization algorithms under minimal assumptions on the graph topology and the structure of the optimization problem. Concerning (ii), we employ robust control techniques to establish a framework for the analysis of existing algorithms as well as the design of novel robust optimization algorithms with specified guarantees.

Swarm intelligence algorithms are a form of nature-based optimization algorithms. Their main inspiration is the cooperative behavior of animals within specific communities. This can be described as simple behaviors of individuals along with the mechanisms for sharing knowledge between them, resulting in the complex behavior of the entire community. Examples of such behavior can be found in ant colonies, bee swarms, schools of fish or bird flocks.Swarm intelligence algorithms are used to solve difficult optimization problems for which there are no exact solving methods or the use of such methods is impossible, e.g. due to unacceptable computational time.This book thoroughly presents the basics of 24 algorithms selected from the entire family of swarm intelligence algorithms. Each chapter deals with a different algorithm describing it in detail and showing how it works in the form of a pseudo-code. In addition, the source code is provided for each algorithm in Matlab and in the C ++ programming language. In order to better understand how each swarm intelligence algorithm works, a simple numerical example is included in each chapter, which guides the reader step by step through the individual stages of the algorithm, showing all necessary calculations.This book can provide the basics for understanding how swarm intelligence algorithms work, and aid readers in programming these algorithms on their own to solve various computational problems.This book should also be useful for undergraduate and postgraduate students studying nature-based optimization algorithms, and can be a helpful tool for learning the basics of these algorithms efficiently and quickly. In addition, it can be a useful source of knowledge for scientists working in the field of artificial intelligence, as well as for engineers interested in using this type of algorithms in their work.If the reader already has basic knowledge of swarm intelligence algorithms, we recommend the book:'Swarm Intelligence Algorithms: Modifications and Applications'(Edited by A. Slowik, CRC Press, 2020), which describes selected modifications of these algorithms and presents their practical applications.

This book provides readers with a comprehensive, state-of-the-art overview of approximate computing, enabling the design trade-off of accuracy for achieving better power/performance efficiencies, through the simplification of underlying computing resources. The authors describe in detail various efforts to generate approximate hardware systems, while still providing an overview of support techniques at other computing layers. The book is organized by techniques for various hardware components, from basic building blocks to general circuits and systems.

This book includes introduction of several algorithms which are exclusively for graph based problems, namely combinatorial optimization problems, path formation problems, etc. Each chapter includes the introduction of the basic traditional nature inspired algorithm and discussion of the modified version for discrete algorithms including problems pertaining to discussed algorithms.

This book establishes the foundations needed to realize the ultimate goals for artificial intelligence, such as autonomy and trustworthiness. Aimed at scientists, researchers, technologists, practitioners, and students, it brings together contributions offering the basics, the challenges and the state-of-the-art on trusted autonomous systems in a single volume. The book is structured in three parts, with chapters written by eminent researchers and outstanding practitioners and users in the field. The first part covers foundational artificial intelligence technologies, while the second part covers philosophical, practical and technological perspectives on trust. Lastly, the third part presents advanced topics necessary to create future trusted autonomous systems. The book augments theory with real-world applications including cyber security, defence and space.

Mathematicians do not study objects, but relations among objectsj they are indifferent to the replacement of objects by others as long as relations do not change. Matter is not important, only form interests them. HENRI POINCARE (1854-1912) Computer scientists working on algorithms for factorization would be well advised to brush up on their number theory. IAN STEWART [219] The theory of numbers, in mathematics, is primarily the theory of the prop­ erties of integers (i.e., the whole numbers), particularly the positive integers. For example, Euclid proved 2000 years aga in his Elements that there exist infinitely many prime numbers. The subject has long been considered as the purest branch of mathematics, with very few applications to other areas. How­ ever, recent years have seen considerable increase in interest in several central topics of number theory, precisely because of their importance and applica­ tions in other areas, particularly in computing and information technology.

This advanced textbook presents a broad and up-to-date view of the computational complexity theory of Boolean circuits. It combines the algorithmic and the computability-based approach, and includes extensive discussion of the literature to facilitate further study.It begins with efficient Boolean circuits for problems with high practical relevance, e.g., arithmetic operations, sorting, and transitive closure, then compares the computational model of Boolean circuits with other models such as Turing machines and parallel machines. Examination of the complexity of specific problems leads to the definition of complexity classes. The theory of circuit complexity classes is then thoroughly developed, including the theory of lower bounds and advanced topics such as connections to algebraic structures and to finite model theory.

Cinderella.2, the new version of the well-known interactive geometry software, has become an even more versatile tool than its predecessor. It now consists of three connected parts: An enhanced geometry component with new features like transformations and dynamic fractals, a simulation laboratory to explore basic laws of Newton mechanics, and an easy to use scripting language that enables any user to quickly extend the software even further. The Cinderella.2 Manual is the first book to offer complete instruction and techniques for using Cinderella.2. It contains a wealth of examples, in particular for the CindyScript language which interacts smoothly with the geometry and simulation components, and a complete reference. Cinderella.2 is Math in Motion all the way, and this book provides comprehensive documentation from start to finish.

Adaptive Sampling with Mobile WSN develops algorithms for optimal estimation of environmental parametric fields. With a single mobile sensor, several approaches are presented to solve the problem of where to sample next to maximally and simultaneously reduce uncertainty in the field estimate and uncertainty in the localisation of the mobile sensor while respecting the dynamics of the time-varying field and the mobile sensor. A case study of mapping a forest fire is presented. Multiple static and mobile sensors are considered next, and distributed algorithms for adaptive sampling are developed resulting in the Distributed Federated Kalman Filter. However, with multiple resources a possibility of deadlock arises and a matrix-based discrete-event controller is used to implement a deadlock avoidance policy. Deadlock prevention in the presence of shared and routing resources is also considered. Finally, a simultaneous and adaptive localisation strategy is developed to simultaneously localise static and mobile sensors in the WSN in an adaptive manner. Experimental validation of several of these algorithms is discussed throughout the book.

This book provides a rigorous algebraic study of the most popular inference formalisms with a special focus on their wide application area, showing that all these tasks can be performed by a single generic inference algorithm. Written by the leading international authority on the topic, it includes an algebraic perspective (study of the valuation algebra framework), an algorithmic perspective (study of the generic inference schemes) and a'practical'perspective (formalisms and applications). Researchers in a number of fields including artificial intelligence, operational research, databases and other areas of computer science; graduate students; and professional programmers of inference methods will benefit from this work.

Data Mining and Applications in Genomics contains the data mining algorithms and their applications in genomics, with frontier case studies based on the recent and current works at the University of Hong Kong and the Oxford University Computing Laboratory, University of Oxford. It provides a systematic introduction to the use of data mining algorithms as an investigative tool for applications in genomics. Data Mining and Applications in Genomics offers state of the art of tremendous advances in data mining algorithms and applications in genomics and also serves as an excellent reference work for researchers and graduate students working on data mining algorithms and applications in genomics.