General Purpose Optimization Through Information Maximization

This book examines the mismatch between discrete programs, which lie at the center of modern applied mathematics, and the continuous space phenomena they simulate. The author considers whether we can imagine continuous spaces of programs, and asks what the structure of such spaces would be and how they would be constituted. He proposes a functional analysis of program spaces focused through the lens of iterative optimization. The author begins with the observation that optimization methods such as Genetic Algorithms, Evolution Strategies, and Particle Swarm Optimization can be analyzed as Estimation of Distributions Algorithms (EDAs) in that they can be formulated as conditional probability distributions. The probabilities themselves are mathematical objects that can be compared and operated on, and thus many methods in Evolutionary Computation can be placed in a shared vector space and analyzed using techniques of functional analysis. The core ideas of this book expand from that concept, eventually incorporating all iterative stochastic search methods, including gradient-based methods. Inspired by work on Randomized Search Heuristics, the author covers all iterative optimization methods and not just evolutionary methods. The No Free Lunch Theorem is viewed as a useful introduction to the broader field of analysis that comes from developing a shared mathematical space for optimization algorithms. The author brings in intuitions from several branches of mathematics such as topology, probability theory, and stochastic processes and provides substantial background material to make the work as self-contained as possible. The book will be valuable for researchers in the areas of global optimization, machine learning, evolutionary theory, and control theory.

This book constitutes the thoroughly refereed post-proceedings of the 5th International Workshop on Information Hiding, IH 2002, held in Noordwijkerhout, The Netherlands, in October 2002. The 27 revised full papers presented were carefully selected during two rounds of reviewing and revision from 78 submissions. The papers are organized in topical sections on information hiding and networking, anonymity, fundamentals of watermarking, watermarking algorithms, attacks on watermarking algorithms, steganography algorithms, steganalysis, and hiding information in unusual content.

This book describes how evolutionary algorithms (EA), including genetic algorithms (GA) and particle swarm optimization (PSO) can be utilized for solving multi-objective optimization problems in the area of embedded and VLSI system design. Many complex engineering optimization problems can be modelled as multi-objective formulations. This book provides an introduction to multi-objective optimization using meta-heuristic algorithms, GA and PSO and how they can be applied to problems like hardware/software partitioning in embedded systems, circuit partitioning in VLSI, design of operational amplifiers in analog VLSI, design space exploration in high-level synthesis, delay fault testing in VLSI testing and scheduling in heterogeneous distributed systems. It is shown how, in each case, the various aspects of the EA, namely its representation and operators like crossover, mutation, etc, can be separately formulated to solve these problems. This book is intended for design engineers and researchers in the field of VLSI and embedded system design. The book introduces the multi-objective GA and PSO in a simple and easily understandable way that will appeal to introductory readers.

This book will advance the understanding and application of self-adaptive intelligent systems; therefore it will potentially benefit the long-term goal of replicating certain levels of brain-like intelligence in complex and networked engineering systems. It will provide new approaches for adaptive systems within uncertain environments. This will provide an opportunity to evaluate the strengths and weaknesses of the current state-of-the-art of knowledge, give rise to new research directions, and educate future professionals in this domain. Self-adaptive intelligent systems have wide applications from military security systems to civilian daily life. In this book, different application problems, including pattern recognition, classification, image recovery, and sequence learning, will be presented to show the capability of the proposed systems in learning, memory, and prediction. Therefore, this book will also provide potential new solutions to many real-world applications.

This book constitutes the refereed proceedings of the 24th International Conference on Applications of Evolutionary Computation, EvoApplications 2021, held as part of Evo*2021, as Virtual Event, in April 2021, co-located with the Evo*2021 events EuroGP, EvoCOP, and EvoMUSART. The 51 revised full papers presented in this book were carefully reviewed and selected from 78 submissions. The papers cover a wide spectrum of topics, ranging from applications of evolutionary computation; applications of deep bioinspired algorithms; soft computing applied to games; machine learning and AI in digital healthcare and personalized medicine; evolutionary computation in image analysis, signal processing and pattern recognition; evolutionary machine learning; parallel and distributed systems; and applications of nature inspired computing for sustainability and development.​

Networks of today are going through a rapid evolution and there are many emerging areas of information networking and their applications. Heterogeneous networking supported by recent technological advances in low power wireless communications along with silicon integration of various functionalities such as sensing, communications, intelligence and actuations are emerging as a critically important disruptive computer class based on a new platform, networking structure and interface that enable novel, low cost and high volume applications. Several of such applications have been difficult to realize because of many interconnections problems. To fulfill their large range of applications different kinds of networks need to collaborate and wired and next generation wireless systems should be integrated in order to develop high performance computing solutions to problems arising from the complexities of these networks. This volume covers the theory, design and applications of computer networks, distributed computing and information systems. The aim of the volume “Advanced Information Networking and Applications” is to provide latest research findings, innovative research results, methods and development techniques from both theoretical and practical perspectives related to the emerging areas of information networking and applications.

In this book, the capability map, a novel general representation of the kinematic capabilities of a robot arm, is introduced. The capability map allows to determine how well regions of the workspace are reachable for the end effector in different orientations. It is a representation that can be machine processed as well as intuitively visualized for the human. The capability map and the derived algorithms are a valuable source of information for high- and low-level planning processes. The versatile applicability of the capability map is shown by examples from several distinct application domains. In human-robot interaction, a bi-manual interface for tele-operation is objectively evaluated. In low-level geometric planning, more human-like motion is planned for a humanoid robot while also reducing the computation time. And in high-level task reasoning, the suitability of a robot for a task is evaluated.

This book takes a fresh look at the popular and well-established method of maximum likelihood for statistical estimation and inference. It begins with an intuitive introduction to the concepts and background of likelihood, and moves through to the latest developments in maximum likelihood methodology, including general latent variable models and new material for the practical implementation of integrated likelihood using the free ADMB software. Fundamental issues of statistical inference are also examined, with a presentation of some of the philosophical debates underlying the choice of statistical paradigm. Key features: Provides an accessible introduction to pragmatic maximum likelihood modelling. Covers more advanced topics, including general forms of latent variable models (including non-linear and non-normal mixed-effects and state-space models) and the use of maximum likelihood variants, such as estimating equations, conditional likelihood, restricted likelihood and integrated likelihood. Adopts a practical approach, with a focus on providing the relevant tools required by researchers and practitioners who collect and analyze real data. Presents numerous examples and case studies across a wide range of applications including medicine, biology and ecology. Features applications from a range of disciplines, with implementation in R, SAS and/or ADMB. Provides all program code and software extensions on a supporting website. Confines supporting theory to the final chapters to maintain a readable and pragmatic focus of the preceding chapters. This book is not just an accessible and practical text about maximum likelihood, it is a comprehensive guide to modern maximum likelihood estimation and inference. It will be of interest to readers of all levels, from novice to expert. It will be of great benefit to researchers, and to students of statistics from senior undergraduate to graduate level. For use as a course text, exercises are provided at the end of each chapter.