Conditional male dimorphism and alternative reproductive tactics in a Neotropical arachnid (Opiliones)

In arthropods, most cases of morphological dimorphism within males are the result of a conditional evolutionarily stable strategy (ESS) with status-dependent tactics. In conditionally male-dimorphic species, the status` distributions of male morphs often overlap, and the environmentally cued threshold model (ET) states that the degree of overlap depends on the genetic variation in the distribution of the switchpoints that determine which morph is expressed in each value of status. Here we describe male dimorphism and alternative mating behaviors in the harvestman Serracutisoma proximum. Majors express elongated second legs and use them in territorial fights; minors possess short second legs and do not fight, but rather sneak into majors` territories and copulate with egg-guarding females. The static allometry of second legs reveals that major phenotype expression depends on body size (status), and that the switchpoint underlying the dimorphism presents a large amount of genetic variation in the population, which probably results from weak selective pressure on this trait. With a mark-recapture study, we show that major phenotype expression does not result in survival costs, which is consistent with our hypothesis that there is weak selection on the switchpoint. Finally, we demonstrate that switchpoint is independent of status distribution. In conclusion, our data support the ET model prediction that the genetic correlation between status and switchpoint is low, allowing the status distribution to evolve or to fluctuate seasonally, without any effect on the position of the mean switchpoint.

An extension of the concept of gradient semigroups which is stable under perturbation

In this article we introduce the concept of a gradient-like nonlinear semigroup as an intermediate concept between a gradient nonlinear semigroup (those possessing a Lyapunov function, see [J.K. Hale, Asymptotic Behavior of Dissipative Systems, Math. Surveys Monogr., vol. 25, Amer. Math. Soc., 1989]) and a nonlinear semigroup possessing a gradient-like attractor. We prove that a perturbation of a gradient-like nonlinear semigroup remains a gradient-like nonlinear semigroup. Moreover, for non-autonomous dynamical systems we introduce the concept of a gradient-like evolution process and prove that a non-autonomous perturbation of a gradient-like nonlinear semigroup is a gradient-like evolution process. For gradient-like nonlinear semigroups and evolution processes, we prove continuity, characterization and (pullback and forwards) exponential attraction of their attractors under perturbation extending the results of [A.N. Carvalho, J.A. Langa, J.C. Robinson, A. Suarez, Characterization of non-autonomous attractors of a perturbed gradient system, J. Differential Equations 236 (2007) 570-603] on characterization and of [A.V. Babin, M.I. Vishik, Attractors in Evolutionary Equations, Stud. Math. Appl.. vol. 25, North-Holland, Amsterdam, 1992] on exponential attraction. (C) 2009 Elsevier Inc. All rights reserved.

Evolutionary model trees for handling continuous classes in machine learning

Model trees are a particular case of decision trees employed to solve regression problems. They have the advantage of presenting an interpretable output, helping the end-user to get more confidence in the prediction and providing the basis for the end-user to have new insight about the data, confirming or rejecting hypotheses previously formed. Moreover, model trees present an acceptable level of predictive performance in comparison to most techniques used for solving regression problems. Since generating the optimal model tree is an NP-Complete problem, traditional model tree induction algorithms make use of a greedy top-down divide-and-conquer strategy, which may not converge to the global optimal solution. In this paper, we propose a novel algorithm based on the use of the evolutionary algorithms paradigm as an alternate heuristic to generate model trees in order to improve the convergence to globally near-optimal solutions. We call our new approach evolutionary model tree induction (E-Motion). We test its predictive performance using public UCI data sets, and we compare the results to traditional greedy regression/model trees induction algorithms, as well as to other evolutionary approaches. Results show that our method presents a good trade-off between predictive performance and model comprehensibility, which may be crucial in many machine learning applications. (C) 2010 Elsevier Inc. All rights reserved.