This conclusion is based on a meta-analysis of the relationship between climate variables and natural selection measured in wild populations of invertebrates, plants, and vertebrates. Three aspects of this analysis cause concern: (i) lack of within-year climate variables, (ii) low and variable estimates of covariance relationships across taxa, and (iii) a lack of mechanistic explanations for the patterns observed; association is not causation.

The objective of this paper is to define an effective strategy for building an ensemble of Genetic Programming (GP) models. Ensemble methods are widely used in machine learning due to their features: they average out biases, they reduce the variance and they usually generalize better than single models. Despite these advantages, building ensemble of GP models is not a well-developed topic in the evolutionary computation community. To fill this gap, we propose a strategy that blends individuals produced by standard syntax-based GP and individuals produced by geometric semantic genetic programming, one of the newest semantics-based method developed in GP. In fact, recent literature showed that combining syntax and semantics could improve the generalization ability of a GP model. Additionally, to improve the diversity of the GP models used to build up the ensemble, we propose different pruning criteria that are based on correlation and entropy, a commonly used measure in information theory. Experimental results, obtained over different complex problems, suggest that the pruning criteria based on correlation and entropy could be effective in improving the generalization ability of the ensemble model and in reducing the computational burden required to build it.

AI has become "ALL IN" and pervading at a rapid speed. Technology moves at breakneck speed, and we now have more power in our pockets than we had in our homes in the 1990s. Artificial intelligence (AI) has been a fascinating concept of science fiction for decades, but many researchers think we're finally getting close to making AI a reality. NPR notes that in the last few years, scientists have made breakthroughs in "machine learning," using neural networks, which mimic the processes of real neurons. Artificial intelligence, defined as intelligence exhibited by machines, has many applications in today's society.

A Behavior Tree (BT) is a way to structure the switching between different tasks in an autonomous agent, such as a robot or a virtual entity in a computer game. BTs are a very efficient way of creating complex systems that are both modular and reactive. These properties are crucial in many applications, which has led to the spread of BT from computer game programming to many branches of AI and Robotics. In this book, we will first give an introduction to BTs, then we describe how BTs relate to, and in many cases generalize, earlier switching structures. These ideas are then used as a foundation for a set of efficient and easy to use design principles. Properties such as safety, robustness, and efficiency are important for an autonomous system, and we describe a set of tools for formally analyzing these using a state space description of BTs. With the new analysis tools, we can formalize the descriptions of how BTs generalize earlier approaches. We also show the use of BTs in automated planning and machine learning. Finally, we describe an extended set of tools to capture the behavior of Stochastic BTs, where the outcomes of actions are described by probabilities. These tools enable the computation of both success probabilities and time to completion.

Mutation is one of the most important stages of genetic algorithms because of its impact on the exploration of the search space, and in overcoming premature convergence. Since there are many types of mutations one common problem lies in selecting the appropriate type. The decision then becomes more difficult and needs more trial and error to find the best mutation to be used. This paper investigates the use of more than one mutation operator to enhance the performance of genetic algorithms. New mutation operators are proposed, in addition to two election strategies for the mutation operators. One is based on selecting the best mutation operator and the other randomly selects any operator. Several experiments were conducted on the Travelling Salesman Problem (TSP) to evaluate the proposed methods. These were compared to the well-known exchange mutation and rearrangement mutation. The results show the importance of some of the proposed methods, in addition to the significant enhancement of the genetic algorithms' performance, particularly when using more than one mutation operator.

Sand--bubblers are crabs of the genera Dotilla and Scopimera which are known to produce remarkable patterns and structures at tropical beaches. From these pattern-making abilities, we may draw inspiration for digital visual art. A simple mathematical model is proposed and an algorithm is designed that may create such sand-bubbler patterns artificially. In addition, design parameters to modify the patterns are identified and analyzed by computational aesthetic measures. Finally, an extension of the algorithm is discussed that may enable controlling and guiding generative evolution of the art-making process.

If you're placing any Golden Globes bets, then maybe you might want to consider what the latest A.I. predictions are saying. In both Golden Globes Best Picture categories -- comedy and drama -- Unanimous A.I. and applied their unique systems to forecast possible winners. And it looks like this year, you can place a lot of faith in a certain sea monster cleaning up. The Shape of Water is looking good in the categories of Best Actress, but also Best Picture, too. On Friday, in order to forecast possible outcomes in a variety of categories at the Golden Globes, Unanimous A.I. used what's known as "swarm intelligence."

It presents experimental studies of evolving low-level and high-level functions in real and simulated robots. The main thesis of the book is that evolutionary robotics provides a viable alternative to classical techniques of designing autonomous robots. An important point emphasized throughout the book is that "evolutionary robotics, … releases the designer from the burden of deciding how to break the desired behavior down into simple behaviors." The book is suited for both the educated reader with an interest in such matters and the professional reader, including researchers in artificial life, cognitive science, adaptive behavior and AI. Its style, scope, and depth make the reading worthwhile.

The field of adaptive robotics involves simulations and real-world implementations of robots that adapt to their environments. In this article, I introduce adaptive environmentics--the flip side of adaptive robotics--in which the environment adapts to the robot. The reasonable man adapts himself to the world; the unreasonable man persists to adapt the world to himself. Therefore, all progress depends on the unreasonable. The apparent complexity of its behavior over time is largely a reflection of the complexity of the environment in which it finds itself. Using both simulated and real robots, and applying techniques such as reinforcement learning, artificial neural networks, genetic algorithms, and fuzzy logic, researchers have obtained robots that display an amazing slew of behaviors and perform a multitude of tasks, including walking, pushing boxes, navigating, negotiating an obstacle course, playing ball, and foraging (Arkin 1998a). To cite one typical example of an ever-growing many, Yung and Ye (1999) recently wrote: We have presented a fuzzy navigator that performs well in complex and unknown environments, using a rule base that is learned from a simple corridor-like environment. The principle of the navigator is built on the fusion of the obstacle avoidance and goal seeking behaviors aided by an environment evaluator to tune the universe of discourse of the input sensor readings and enhance its adaptability. For this reason, the navigator has been able to learn extremely quickly in a simple environment, and then operate in an unknown environment, where exploration is not required at all. This quote typifies the underlying theme of adaptive robotics: Have a robot adapt to a given environment. Given signifies neither that the environment is known nor that it is static; it means that the robot must adapt to the quirks and idiosyncrasies imposed by the environment--which, for its part, does nothing at all to accommodate the puffing robot. This fundamental principle of adaptive robotics--the environment's unyielding nature--is repealed in this article. Dubbed adaptive environmentics, the basic idea is to create scenarios that are mirror images of those found in adaptive robotics: The environment adapts to a given robot. I hasten to say that in some cases, it is not possible to alter the environment, and in other cases, having the robot adapt is simply the underlying objective. Adaptive robotics has produced many interesting results based on these principles.

The Fifth International Conference on Genetic Algorithms was held at the University of Illinois at Urbana-Champaign from 17-21 July 1993. Approximately 350 participants attended the multitrack conference, which covered a wide range of topics, including genetic operators, mathematical analysis of genetic algorithms, parallel genetic algorithms, classifier systems, and genetic programming. This article highlights the major themes of the conference by discussing a few papers in detail. The conference was organized by Stephanie Forrest (University of New Mexico, conference cochair and editor of the proceedings), David Goldberg (University of Illinois at Urbana-Champaign, conference cochair and local arrangements chair), and J. David Schaffer (Philips Laboratories, New York, conference cochair). Of the 240 papers submitted to the conference, 82 were accepted for oral presentation, and 37 were accepted for poster presentation.