English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

The ‘Handbook of Bioinspired Algorithms and Applications’ is a unifying compilation of chapters that discuss bioinspired algorithms. These are algorithms that have been conceived using cues from nature, such as, evolution, insect swarming, food foraging and brain neurons. The book presents a broad range of solved problems and cases studied using bioinspired paradigms. The book is well organized, each chapter being condensed but detailed enough to understand the topics for those researchers who have little or no background in bioinspired algorithms. At the end of each chapter plenty of carefully selected references are provided for further information. The book also contains a global index for easy searching. This 618-page book is divided in two sections: Models and Paradigms and Application Domains with 38 contributions. The first section consists of 11 chapters and the second by 25 chapters. The first section of the book provides the background needed to understand bioinspired algorithms. It discusses the following: evolutionary algorithms (EA), genetic algorithms (GA), genetic programming (GP), particle swarm optimization (PSO) and ant colony optimization (ACO). There is a chapter dedicated to neural networks (NN), which are universal approximators, and another for cellular automata (CA). A chapter on DNA computing is also included; the algorithms are based on Darwin’s evolutionary theory where operators are selection, crossover, mutation or variants of these. For instance, the velocity update of the PSO algorithm is considered a weak mutation operator from an evolutionary algorithm’s perspective. Chapters describe theory and design decisions, pseudo-codes, parameter selection, parallelization and performance comparisons between different algorithms. The second section of the book is introduced with a few chapters discussing GA implementation for scheduling task problems, network traffic problems, network configuration and medical diagnosis using different imaging techniques e.g., fMRI and X-rays. There are chapters that discuss applications of cellular automata in scheduling problems and pattern formation. Later, solutions are presented for routing algorithms, partition problems and data clustering using swarming algorithms, i.e., PSO and ACO. After that, the next chapters discuss applications using NNs. An intrusion detection system for mobile phone users and synthesis of multiple-value circuit problems were approached using NNs. Additionally, an extensive chapter discusses the computational capacity of NNs using discrete multiple-valued multiple-threshold neurons. An interesting chapter presents advanced evolutionary algorithms to train NNs. Results show that the evolutionary strategy yields more satisfactory results than some problemspecific algorithms. Later, bioinspired algorithms for data mining (also known as knowledge discovery in databases, KDD) are introduced. Different EAand swarming-based algorithms are presented along with experiments and with a performance analysis. Another chapter presents a GA-based data mining routine applied to microarray analysis. A chapter, less related to the field of bioinformatics and computational biology, gives to the reader an insight into how problem solutions are encoded in EAs, and presents several applications of EAs to solve different electrical engineering problems such as integrate circuit design and universal motor design. The book continues with more applications of EAs to partitioning problems. A relatively extensive chapter in population-learning algorithms (PLA), a type of combinatorial optimization algorithm that emulates social processes and applications of these such as permutation scheduling are presented. After this, an exciting chapter studies a biological model that emulates the evolution of micro-electro mechanical system (MEMS) technology that can be used as a guiding framework for their study. The last three chapters discuss parallel and distributed BRIEFINGS IN BIOINFORMATICS. VOL 8. NO 4. 275^276 doi:10.1093/bib/bbm009 Advance Access publication March 29, 2007

Handbook of Bioinspired Algorithms and Applications * Edited by Stephan Olariu and Albert Y.