The extrapolation problem and how population modeling can help

We argue that population modeling can add value to ecological risk assessment by reducing uncertainty when extrapolating from ecotoxicological observations to relevant ecological effects. We review other methods of extrapolation, ranging from application factors to species sensitivity distributions to suborganismal (biomarker and "-omics'') responses to quantitative structure activity relationships and model ecosystems, drawing attention to the limitations of each. We suggest a simple classification of population models and critically examine each model in an extrapolation context. We conclude that population models have the potential for adding value to ecological risk assessment by incorporating better understanding of the links between individual responses and population size and structure and by incorporating greater levels of ecological complexity. A number of issues, however, need to be addressed before such models are likely to become more widely used. In a science context, these involve challenges in parameterization, questions about appropriate levels of complexity, issues concerning how specific or general the models need to be, and the extent to which interactions through competition and trophic relationships can be easily incorporated.

The timing of eukaryotic evolution: Does a relaxed molecular clock reconcile proteins and fossils?

The use of nucleotide and amino acid sequences allows improved understanding of the timing of evolutionary events of life on earth. Molecular estimates of divergence times are, however, controversial and are generally much more ancient than suggested by the fossil record. The limited number of genes and species explored and pervasive variations in evolutionary rates are the most likely sources of such discrepancies. Here we compared concatenated amino acid sequences of 129 proteins from 36 eukaryotes to determine the divergence times of several major clades, including animals, fungi, plants, and various protists. Due to significant variations in their evolutionary rates, and to handle the uncertainty of the fossil record, we used a Bayesian relaxed molecular clock simultaneously calibrated by six paleontological constraints. We show that, according to 95% credibility intervals, the eukaryotic kingdoms diversified 950-1,259 million years ago (Mya), animals diverged from choanoflagellates 761-957 Mya, and the debated age of the split between protostomes and deuterostomes occurred 642-761 Mya. The divergence times appeared to be robust with respect to prior assumptions and paleontological calibrations. Interestingly, these relaxed clock time estimates are much more recent than those obtained under the assumption of a global molecular clock, yet bilaterian diversification appears to be approximate to100 million years more ancient than the Cambrian boundary.

The role of schizotypy and creativity in a group problem-solving task

The well-studied link between psychotic traits and creativity is a subject of much debate. The present study investigated the extent to which schizotypic personality traits - as measured by O-LIFE (Oxford-Liverpool Inventory of Feelings and Experiences) - equip healthy individuals to engage as groups in everyday tasks. From a sample of 69 students, eight groups of four participants - comprised of high, medium, or low-schizotypy individuals - were assembled to work as a team to complete a creative problem-solving task. Predictably, high scorers on the O-LIFE formulated a greater number of strategies to solve the task, indicative of creative divergent thinking. However, for task success (as measured by time taken to complete the problem) an inverted U shaped pattern emerged, whereby high and low-schizotypy groups were consistently faster than medium schizotypy groups. Intriguing data emerged concerning leadership within the groups, and other tangential findings relating to anxiety, competition and motivation were explored. These findings challenge the traditional cliche that psychotic personality traits are linearly related to creative performance, and suggest that the nature of the problem determines which thinking styles are optimally equipped to solve it. (C) 2009 Elsevier Ltd. All rights reserved.

Training conditional and cumulative risk judgements: the role of frequencies, problem-structure and Einstellung

Two experiments implement and evaluate a training scheme for learning to apply frequency formats to probability judgements couched in terms of percentages. Results indicate that both conditional and cumulative probability judgements can be improved in this manner, however the scheme is insufficient to promote any deeper understanding of the problem structure. In both experiments, training on one problem type only (either conditional or cumulative risk judgements) resulted in an inappropriate transfer of a learned method at test. The obstacles facing a frequency-based training programme for teaching appropriate use of probability data are discussed. Copyright (c) 2006 John Wiley & Sons, Ltd.

Instance generators and test suites for the multiobjective quadratic assignment problem

We describe, and make publicly available, two problem instance generators for a multiobjective version of the well-known quadratic assignment problem (QAP). The generators allow a number of instance parameters to be set, including those controlling epistasis and inter-objective correlations. Based on these generators, several initial test suites are provided and described. For each test instance we measure some global properties and, for the smallest ones, make some initial observations of the Pareto optimal sets/fronts. Our purpose in providing these tools is to facilitate the ongoing study of problem structure in multiobjective (combinatorial) optimization, and its effects on search landscape and algorithm performance.

A knowledge-based evolution strategy for the multi-objective minimum spanning tree problem

A fast Knowledge-based Evolution Strategy, KES, for the multi-objective minimum spanning tree, is presented. The proposed algorithm is validated, for the bi-objective case, with an exhaustive search for small problems (4-10 nodes), and compared with a deterministic algorithm, EPDA and NSGA-II for larger problems (up to 100 nodes) using benchmark hard instances. Experimental results show that KES finds the true Pareto fronts for small instances of the problem and calculates good approximation Pareto sets for larger instances tested. It is shown that the fronts calculated by YES are superior to NSGA-II fronts and almost as good as those established by EPDA. KES is designed to be scalable to multi-objective problems and fast due to its small complexity.