RESUMEN

On the occasion of the 30-year anniversary of the Evolutionary Computation journal, I was invited by Professor Hart to offer some reflections on the article on evolving behaviors in the iterated prisoner's dilemma that I contributed to its first issue in 1993. It's an honor to do so. I would like to thank Professor Ken De Jong, the journal's first editor-in-chief, for his vision in creating the journal, and the editors who have followed and maintained that vision. This article contains some personal reflections on the topic and the field as a whole.

Asunto(s)

RESUMEN

Clinical trials are time consuming, expensive, and often burdensome on patients. Clinical trials can fail for many reasons. This survey reviews many of these reasons and offers insights on opportunities for improving the likelihood of creating and executing successful clinical trials. Literature from the past 30 years was reviewed for relevant data. Common patterns in reported successful trials are identified, including factors regarding the study site, study coordinator/investigator, and the effects on participating patients. Specific instances where artificial intelligence can help improve clinical trials are identified.

RESUMEN

The behaviors of individuals and species are often explained in terms of evolutionary stable strategies (ESSs). The analysis of ESSs determines which, if any, combinations of behaviors cannot be invaded by alternative strategies. Two assumptions required to generate an ESS (i.e., an infinite population and payoffs described only on the average) do not hold under natural conditions. Previous experiments indicated that under more realistic conditions of finite populations and stochastic payoffs, populations may evolve in trajectories that are unrelated to an ESS, even in very simple games. The simulations offered here extend earlier research by employing truncation selection with random parental selection in a hawk-dove game. Payoffs are determined in pairwise contests using either the expected outcome, or the result of a random variable. In each case, however, the mean fraction of hawks over many generations and across many independent trials does not conform to the expected ESS. Implications of these results and philosophical underpinnings of ESS theory are offered.

Asunto(s)

RESUMEN

Entertainment software developers face significant challenges in designing games with broad appeal. One of the challenges concerns creating nonplayer (computer-controlled) characters that can adapt their behavior in light of the current and prospective situation, possibly emulating human behaviors. This adaptation should be inherently novel, unrepeatable, yet within the bounds of realism. Evolutionary algorithms provide a suitable method for generating such behaviors. This paper provides background on the entertainment software industry, and details a prior and current effort to create a platform for evolving nonplayer characters with genetic and behavioral traits within a World War I combat flight simulator.

Asunto(s)

RESUMEN

RNA molecules fold into characteristic secondary and tertiary structures that account for their diverse functional activities. Many of these RNA structures, or certain structural motifs within them, are thought to recur in multiple genes within a single organism or across the same gene in several organisms and provide a common regulatory mechanism. Search algorithms, such as RNAMotif, can be used to mine nucleotide sequence databases for these repeating motifs. RNAMotif allows users to capture essential features of known structures in detailed descriptors and can be used to identify, with high specificity, other similar motifs within the nucleotide database. However, when the descriptor constraints are relaxed to provide more flexibility, or when there is very little a priori information about hypothesized RNA structures, the number of motif 'hits' may become very large. Exhaustive methods to search for similar RNA structures over these large search spaces are likely to be computationally intractable. Here we describe a powerful new algorithm based on evolutionary computation to solve this problem. A series of experiments using ferritin IRE and SRP RNA stem-loop motifs were used to verify the method. We demonstrate that even when searching extremely large search spaces, of the order of 10(23) potential solutions, we could find the correct solution in a fraction of the time it would have taken for exhaustive comparisons.

Asunto(s)

RESUMEN

Evolutionary computation provides a useful method for training neural networks in the face of multiple local optima. This paper begins with a description of methods for quantitative structure activity relationships (QSAR). An overview of artificial neural networks for pattern recognition problems such as QSAR is presented and extended with the description of how evolutionary computation can be used to evolve neural networks. Experiments are conducted to examine QSAR for the inhibition of dihydrofolate reductase by pyrimidines using evolved neural networks. Results indicate the utility of evolutionary algorithms and neural networks for the predictive task at hand. Furthermore, results that are comparable or perhaps better than those published previously were obtained using only a small fraction of the previously required degrees of freedom.

Asunto(s)