Predicting community responses to perturbations in the face of imperfect knowledge and network complexity

How best to predict the effects of perturbations to ecological communities has been a long-standing goal for both applied and basic ecology. This quest has recently been revived by new empirical data, new analysis methods, and increased computing speed, with the promise that ecologically important insights may be obtainable from a limited knowledge of community interactions. We use empirically based and simulated networks of varying size and connectance to assess two limitations to predicting perturbation responses in multispecies communities: (1) the inaccuracy by which species interaction strengths are empirically quantified and (2) the indeterminacy of species responses due to indirect effects associated with network size and structure. We find that even modest levels of species richness and connectance (similar to 25 pairwise interactions) impose high requirements for interaction strength estimates because system indeterminacy rapidly overwhelms predictive insights. Nevertheless, even poorly estimated interaction strengths provide greater average predictive certainty than an approach that uses only the sign of each interaction. Our simulations provide guidance in dealing with the trade-offs involved in maximizing the utility of network approaches for predicting dynamics in multispecies communities.

Scaling of Food-Web Properties with Diversity and Complexity Across Ecosystems

Trophic scaling models describe how topological food-web properties such as the number of predator prey links scale with species richness of the community. Early models predicted that either the link density (i.e. the number of links per species) or the connectance (i.e. the linkage probability between any pair of species) is constant across communities. More recent analyses, however, suggest that both these scaling models have to be rejected, and we discuss several hypotheses that aim to explain the scale dependence of these complexity parameters. Based on a recent, highly resolved food-web compilation, we analysed the scaling behaviour of 16 topological parameters and found significant power law scaling relationships with diversity (i.e. species richness) and complexity (i.e. connectance) for most of them. These results illustrate the lack of universal constants in food-web ecology as a function of diversity or complexity. Nonetheless, our power law scaling relationships suggest that fundamental processes determine food-web topology, and subsequent analyses demonstrated that ecosystem-specific differences in these relationships were of minor importance. As such, these newly described scaling relationships provide robust and testable cornerstones for future structural food-web models.

ON THE MOLECULAR COMPLEXITY OF THE HOT CORES IN ORION-A - GRAIN SURFACE-CHEMISTRY AS THE LAST REFUGE OF THE SCOUNDREL

We have modeled the gas phase chemistry of warm molecular material around protostars that is seeded with evaporating grain mantles. We show that the release of simple molecules into the gas drives ion-molecule and neutral chemistries which can account for many of the complex 0-bearing and N-bearing molecules observed in hot cores. Initial grain mantle components and secondary product molecules are identified, and the observational consequences are discussed.

A Low Complexity Real-time MIMO-Preprocessing For Fixed Complexity Sphere Decoder

Modern Multiple-Input Multiple-Output (MIMO) communication systems place huge demands on embedded processing resources in terms of throughput, latency and resource utilization. State-of-the-art MIMO detector algorithms, such as Fixed-Complexity Sphere Decoding (FSD), rely on efficient channel preprocessing involving numerous calculations of the pseudo-inverse of the channel matrix by QR Decomposition (QRD) and ordering. These highly complicated operations can quickly become the critical prerequisite for real-time MIMO detection, exaggerated as the number of antennas in a MIMO detector increases. This paper describes a sorted QR decomposition (SQRD) algorithm extended for FSD, which significantly reduces the complexity and latency
of this preprocessing step and increases the throughput of MIMO detection. It merges the calculations of the QRD and ordering operations to avoid multiple iterations of QRD. Specifically, it shows that SQRD reduces the computational complexity by over 60-70% when compared to conventional
MIMO preprocessing algorithms. In 4x4 to 7x7 MIMO cases, the approach suffers merely 0.16-0.2 dB reduction in Bit Error Rate (BER) performance.

Classical novae from the POINT-AGAPE microlensing survey of M31 - II. Rate and statistical characteristics of the nova population

The POINT-AGAPE (Pixel-lensing Observations with the Isaac Newton Telescope-Andromeda Galaxy Amplified Pixels Experiment) survey is an optical search for gravitational microlensing events towards the Andromeda galaxy (M31). As well as microlensing, the survey is sensitive to many different classes of variable stars and transients. In our first paper of this series, we reported the detection of 20 classical novae (CNe) observed in Sloan r' and i' passbands.