A tale of two tables

PostprintPeer reviewe

Tropical plants do not have narrower temperature tolerances, but are more at risk from warming because they are close to their upper thermal limits

Aim: Tropical species are thought to be more susceptible to climate warming than are higher latitude species. This prediction is largely based on the assumption that tropical species can tolerate a narrower range of temperatures. While this prediction holds for some animal taxa, we do not yet know the latitudinal trends in temperature tolerance for plants. We aim to address this knowledge gap and establish if there is a global trend in plant warming risk. Location: Global. Time period: Present–2070. Major taxa studied: Plants. Methods: We used 9,737 records for 1,312 species from the Kew Gardens’ global germination database to quantify global patterns in germination temperature. Results: We found no evidence for a latitudinal gradient in the breadth of temperatures at which plant species can germinate. However, tropical plants are predicted to face the greatest risk from climate warming, because they experience temperatures closer to their upper germination limits. By 2070, over half (79/142) of tropical plant species are predicted to experience temperatures exceeding their optimum germination temperatures, with some even exceeding their maximum germination temperature (41/190). Conversely, 95% of species at latitudes above 45° are predicted to benefit from warming, with environmental temperatures shifting closer to the species’ optimal germination temperatures. Main conclusions: The prediction that tropical plant species would be most at risk under future climate warming was supported by our data, but through a different mechanism to that generally assumed

Planar Drawings of Fixed-Mobile Bigraphs

A fixed-mobile bigraph G is a bipartite graph such that the vertices of one partition set are given with fixed positions in the plane and the mobile vertices of the other part, together with the edges, must be added to the drawing. We assume that G is planar and study the problem of finding, for a given k >= 0, a planar poly-line drawing of G with at most k bends per edge. In the most general case, we show NP-hardness. For k=0 and under additional constraints on the positions of the fixed or mobile vertices, we either prove that the problem is polynomial-time solvable or prove that it belongs to NP. Finally, we present a polynomial-time testing algorithm for a certain type of "layered" 1-bend drawings

Discrete and fuzzy dynamical genetic programming in the XCSF learning classifier system

A number of representation schemes have been presented for use within learning classifier systems, ranging from binary encodings to neural networks. This paper presents results from an investigation into using discrete and fuzzy dynamical system representations within the XCSF learning classifier system. In particular, asynchronous random Boolean networks are used to represent the traditional condition-action production system rules in the discrete case and asynchronous fuzzy logic networks in the continuous-valued case. It is shown possible to use self-adaptive, open-ended evolution to design an ensemble of such dynamical systems within XCSF to solve a number of well-known test problems

Correction: A novel enantioselective synthesis of 6H-dibenzopyran derivatives by combined palladium/norbornene and cinchona alkaloid catalysis

Correction for 'A novel enantioselective synthesis of 6H-dibenzopyran derivatives by combined palladium/norbornene and cinchona alkaloid catalysis' by Di Xu et al., Org. Biomol. Chem., 2015, DOI: 10.1039/c4ob02551b

On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity and Kandinsky Drawings

We study two variants of the well-known orthogonal drawing model: (i) the smooth orthogonal, and (ii) the octilinear. Both models form an extension of the orthogonal, by supporting one additional type of edge segments (circular arcs and diagonal segments, respectively). For planar graphs of max-degree 4, we analyze relationships between the graph classes that can be drawn bendless in the two models and we also prove NP-hardness for a restricted version of the bendless drawing problem for both models. For planar graphs of higher degree, we present an algorithm that produces bi-monotone smooth orthogonal drawings with at most two segments per edge, which also guarantees a linear number of edges with exactly one segment.Comment: Appears in the Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD 2017

Computational modelling of emboli travel trajectories in cerebral arteries: Influence of microembolic particle size and density

This article has been made available through the Brunel Open Access Publishing Fund.Ischaemic stroke is responsible for up to 80 % of stroke cases. Prevention of the reoccurrence of ischaemic attack or stroke for patients who survived the first symptoms is the major treatment target. Accurate diagnosis of the emboli source for a specific infarction lesion is very important for a better treatment for the patient. However, due to the complex blood flow patterns in the cerebral arterial network, little is known so far of the embolic particle flow trajectory and its behaviour in such a complex flow field. The present study aims to study the trajectories of embolic particles released from carotid arteries and basilar artery in a cerebral arterial network and the influence of particle size, mass and release location to the particle distributions, by computational modelling. The cerebral arterial network model, which includes major arteries in the circle of Willis and several generations of branches from them, was generated from MRI images. Particles with diameters of 200, 500 and 800 μ m and densities of 800, 1,030 and 1,300 kg/m 3 were released in the vessel's central and near-wall regions. A fully coupled scheme of particle and blood flow in a computational fluid dynamics software ANASYS CFX 13 was used in the simulations. The results show that heavy particles (density large than blood or a diameter larger than 500 μ m) normally have small travel speeds in arteries; larger or lighter embolic particles are more likely to travel to large branches in cerebral arteries. In certain cases, all large particles go to the middle cerebral arteries; large particles with higher travel speeds in large arteries are likely to travel at more complex and tortuous trajectories; emboli raised from the basilar artery will only exit the model from branches of basilar artery and posterior cerebral arteries. A modified Circle of Willis configuration can have significant influence on particle distributions. The local branch patterns of internal carotid artery to middle cerebral artery and anterior communicating artery can have large impact on such distributions. © 2014 The Author(s)

Central Nervous System Parasitosis and Neuroinflammation Ameliorated by Systemic IL-10 Administration in Trypanosoma brucei-Infected Mice

Peer reviewedPublisher PD