Predicting the potential distribution of Amblyomma americanum (Acari: Ixodidae) infestation in New Zealand, using maximum entropy-based ecological niche modelling

Publishe

Bayesian Space-Time Patterns and Climatic Determinants of Bovine Anaplasmosis

Citation: Hanzlicek, G. A., Raghavan, R. K., Ganta, R. R., & Anderson, G. A. (2016). Bayesian Space-Time Patterns and Climatic Determinants of Bovine Anaplasmosis. Plos One, 11(3), 13. doi:10.1371/journal.pone.0151924The space-time pattern and environmental drivers (land cover, climate) of bovine anaplasmosis in the Midwestern state of Kansas was retrospectively evaluated using Bayesian hierarchical spatio-temporal models and publicly available, remotely-sensed environmental covariate information. Cases of bovine anaplasmosis positively diagnosed at Kansas State Veterinary Diagnostic Laboratory (n = 478) between years 2005-2013 were used to construct the models, which included random effects for space, time and space-time interaction effects with defined priors, and fixed-effect covariates selected a priori using an univariate screening procedure. The Bayesian posterior median and 95% credible intervals for the space-time interaction term in the best-fitting covariate model indicated a steady progression of bovine anaplasmosis over time and geographic area in the state. Posterior median estimates and 95% credible intervals derived for covariates in the final covariate model indicated land surface temperature (minimum), relative humidity and diurnal temperature range to be important risk factors for bovine anaplasmosis in the study. The model performance measured using the Area Under the Curve (AUC) value indicated a good performance for the covariate model (>0.7). The relevance of climatological factors for bovine anaplasmosis is discussed

Single source unsplittable flows with arc-wise lower and upper bounds

In a digraph with a source and several destination nodes with associated demands, an unsplittable flow routes each demand along a single path from the common source to its destination. Given some flow x that is not necessarily unsplittable but satisfies all demands, it is a natural question to ask for an unsplittable flow y that does not deviate from x by too much, i.e., ya≈xa for all arcs a. Twenty years ago, in a landmark paper, Dinitz et al. (Combinatorica 19:17–41, 1999) proved that there exists an unsplittable flow y such that ya≤xa+dmax for all arcs a, where dmax denotes the maximum demand value. Our first contribution is a considerably simpler one-page proof for this classical result, based upon an entirely new approach. Secondly, using a subtle variant of this approach, we obtain a new result: There is an unsplittable flow y such that ya≥xa−dmax for all arcs a. Finally, building upon an iterative rounding technique previously introduced by Kolliopoulos and Stein (SIAM J Comput 31:919–946, 2002) and Skutella (Math Program 91:493–514, 2002), we prove existence of an unsplittable flow that simultaneously satisfies the upper and lower bounds for the special case when demands are integer multiples of each other. For arbitrary demand values, we prove the weaker simultaneous bounds xa/2−dmax≤ya≤2xa+dmax for all arcs a.TU Berlin, Open-Access-Mittel – 202

Router-level community structure of the Internet Autonomous Systems

The Internet is composed of routing devices connected between them and organized into independent administrative entities: the Autonomous Systems. The existence of different types of Autonomous Systems (like large connectivity providers, Internet Service Providers or universities) together with geographical and economical constraints, turns the Internet into a complex modular and hierarchical network. This organization is reflected in many properties of the Internet topology, like its high degree of clustering and its robustness. In this work, we study the modular structure of the Internet router-level graph in order to assess to what extent the Autonomous Systems satisfy some of the known notions of community structure. We show that the modular structure of the Internet is much richer than what can be captured by the current community detection methods, which are severely affected by resolution limits and by the heterogeneity of the Autonomous Systems. Here we overcome this issue by using a multiresolution detection algorithm combined with a small sample of nodes. We also discuss recent work on community structure in the light of our results

Anatomy of Indian heatwaves

India suffers from major heatwaves during March-June. The rising trend of number of intense heatwaves in recent decades has been vaguely attributed to global warming. Since the heat waves have a serious effect on human mortality, root causes of these heatwaves need to be clarified. Based on the observed patterns and statistical analyses of the maximum temperature variability, we identified two types of heatwaves. The first-type of heatwave over the north-central India is found to be associated with blocking over the North Atlantic. The blocking over North Atlantic results in a cyclonic anomaly west of North Africa at upper levels. The stretching of vorticity generates a Rossby wave source of anomalous Rossby waves near the entrance of the African Jet. The resulting quasi-stationary Rossby wave-train along the Jet has a positive phase over Indian subcontinent causing anomalous sinking motion and thereby heatwave conditions over India. On the other hand, the second-type of heatwave over the coastal eastern India is found to be due to the anomalous Matsuno-Gill response to the anomalous cooling in the Pacific. The Matsuno-Gill response is such that it generates northwesterly anomalies over the landmass reducing the land-sea breeze, resulting in heatwaves

Planet formation in Binaries

Spurred by the discovery of numerous exoplanets in multiple systems, binaries have become in recent years one of the main topics in planet formation research. Numerous studies have investigated to what extent the presence of a stellar companion can affect the planet formation process. Such studies have implications that can reach beyond the sole context of binaries, as they allow to test certain aspects of the planet formation scenario by submitting them to extreme environments. We review here the current understanding on this complex problem. We show in particular how each of the different stages of the planet-formation process is affected differently by binary perturbations. We focus especially on the intermediate stage of kilometre-sized planetesimal accretion, which has proven to be the most sensitive to binarity and for which the presence of some exoplanets observed in tight binaries is difficult to explain by in-situ formation following the "standard" planet-formation scenario. Some tentative solutions to this apparent paradox are presented. The last part of our review presents a thorough description of the problem of planet habitability, for which the binary environment creates a complex situation because of the presence of two irradation sources of varying distance.Comment: Review chapter to appear in "Planetary Exploration and Science: Recent Advances and Applications", eds. S. Jin, N. Haghighipour, W.-H. Ip, Springer (v2, numerous typos corrected

Combined node and link partitions method for finding overlapping communities in complex networks

Community detection in complex networks is a fundamental data analysis task in various domains, and how to effectively find overlapping communities in real applications is still a challenge. In this work, we propose a new unified model and method for finding the best overlapping communities on the basis of the associated node and link partitions derived from the same framework. Specifically, we first describe a unified model that accommodates node and link communities (partitions) together, and then present a nonnegative matrix factorization method to learn the parameters of the model. Thereafter, we infer the overlapping communities based on the derived node and link communities, i.e., determine each overlapped community between the corresponding node and link community with a greedy optimization of a local community function conductance. Finally, we introduce a model selection method based on consensus clustering to determine the number of communities. We have evaluated our method on both synthetic and real-world networks with ground-truths, and compared it with seven state-of-the-art methods. The experimental results demonstrate the superior performance of our method over the competing ones in detecting overlapping communities for all analysed data sets. Improved performance is particularly pronounced in cases of more complicated networked community structures

Structural basis for CRISPR RNA-guided DNA recognition by Cascade

The CRISPR (clustered regularly interspaced short palindromic repeats) immune system in prokaryotes uses small guide RNAs to neutralize invading viruses and plasmids. In Escherichia coli, immunity depends on a ribonucleoprotein complex called Cascade. Here we present the composition and low-resolution structure of Cascade and show how it recognizes double-stranded DNA (dsDNA) targets in a sequence-specific manner. Cascade is a 405-kDa complex comprising five functionally essential CRISPR-associated (Cas) proteins (CasA1B2C6D1E1) and a 61-nucleotide CRISPR RNA (crRNA) with 5′-hydroxyl and 2′,3′-cyclic phosphate termini. The crRNA guides Cascade to dsDNA target sequences by forming base pairs with the complementary DNA strand while displacing the noncomplementary strand to form an R-loop. Cascade recognizes target DNA without consuming ATP, which suggests that continuous invader DNA surveillance takes place without energy investment. The structure of Cascade shows an unusual seahorse shape that undergoes conformational changes when it binds target DNA.

Genome Majority Vote Improves Gene Predictions

Recent studies have noted extensive inconsistencies in gene start sites among orthologous genes in related microbial genomes. Here we provide the first documented evidence that imposing gene start consistency improves the accuracy of gene start-site prediction. We applied an algorithm using a genome majority vote (GMV) scheme to increase the consistency of gene starts among orthologs. We used a set of validated Escherichia coli genes as a standard to quantify accuracy. Results showed that the GMV algorithm can correct hundreds of gene prediction errors in sets of five or ten genomes while introducing few errors. Using a conservative calculation, we project that GMV would resolve many inconsistencies and errors in publicly available microbial gene maps. Our simple and logical solution provides a notable advance toward accurate gene maps