@article{6,
  abstract     = {Lesion and electrode location verification are traditionally done via histological examination of stained brain slices, a time-consuming procedure that requires manual estimation. Here, we describe a simple, straightforward method for quantifying lesions and locating electrodes in the brain that is less laborious and yields more detailed results. Whole brains are stained with osmium tetroxide, embedded in resin, and imaged with a micro-CT scanner. The scans result in 3D digital volumes of the brains with resolutions and virtual section thicknesses dependent on the sample size (12-15 and 5-6 µm per voxel for rat and zebra finch brains, respectively). Surface and deep lesions can be characterized, and single tetrodes, tetrode arrays, electrolytic lesions, and silicon probes can also be localized. Free and proprietary software allows experimenters to examine the sample volume from any plane and segment the volume manually or automatically. Because this method generates whole brain volume, lesions and electrodes can be quantified to a much higher degree than in current methods, which will help standardize comparisons within and across studies.},
  author       = {Masís, Javier and Mankus, David and Wolff, Steffen and Guitchounts, Grigori and Jösch, Maximilian A and Cox, David},
  journal      = {Journal of visualized experiments},
  publisher    = {MyJove Corporation},
  title        = {{A micro-CT-based method for characterising lesions and locating electrodes in small animal brains}},
  doi          = {10.3791/58585},
  volume       = {141},
  year         = {2018},
}

@inbook{60,
  abstract     = {Model checking is a computer-assisted method for the analysis of dynamical systems that can be modeled by state-transition systems. Drawing from research traditions in mathematical logic, programming languages, hardware design, and theoretical computer science, model checking is now widely used for the verification of hardware and software in industry. This chapter is an introduction and short survey of model checking. The chapter aims to motivate and link the individual chapters of the handbook, and to provide context for readers who are not familiar with model checking.},
  author       = {Clarke, Edmund and Henzinger, Thomas A and Veith, Helmut},
  booktitle    = {Handbook of Model Checking},
  editor       = {Henzinger, Thomas A},
  pages        = {1 -- 26},
  publisher    = {Springer},
  title        = {{Introduction to model checking}},
  doi          = {10.1007/978-3-319-10575-8_1},
  year         = {2018},
}

@article{6001,
  abstract     = {The concurrent memory reclamation problem is that of devising a way for a deallocating thread to verify that no other concurrent threads hold references to a memory block being deallocated. To date, in the absence of automatic garbage collection, there is no satisfactory solution to this problem; existing tracking methods like hazard pointers, reference counters, or epoch-based techniques like RCU are either prohibitively expensive or require significant programming expertise to the extent that implementing them efficiently can be worthy of a publication. None of the existing techniques are automatic or even semi-automated.
In this article, we take a new approach to concurrent memory reclamation. Instead of manually tracking access to memory locations as done in techniques like hazard pointers, or restricting shared accesses to specific epoch boundaries as in RCU, our algorithm, called ThreadScan, leverages operating system signaling to automatically detect which memory locations are being accessed by concurrent threads.
Initial empirical evidence shows that ThreadScan scales surprisingly well and requires negligible programming effort beyond the standard use of Malloc and Free.},
  author       = {Alistarh, Dan-Adrian and Leiserson, William and Matveev, Alexander and Shavit, Nir},
  issn         = {2329-4949},
  journal      = {ACM Transactions on Parallel Computing},
  number       = {4},
  publisher    = {Association for Computing Machinery},
  title        = {{ThreadScan: Automatic and scalable memory reclamation}},
  doi          = {10.1145/3201897},
  volume       = {4},
  year         = {2018},
}

@article{6002,
  abstract     = {The Bogoliubov free energy functional is analysed. The functional serves as a model of a translation-invariant Bose gas at positive temperature. We prove the existence of minimizers in the case of repulsive interactions given by a sufficiently regular two-body potential. Furthermore, we prove the existence of a phase transition in this model and provide its phase diagram.},
  author       = {Napiórkowski, Marcin M and Reuvers, Robin and Solovej, Jan Philip},
  issn         = {1432-0673},
  journal      = {Archive for Rational Mechanics and Analysis},
  number       = {3},
  pages        = {1037--1090},
  publisher    = {Springer Nature},
  title        = {{The Bogoliubov free energy functional I: Existence of minimizers and phase diagram}},
  doi          = {10.1007/s00205-018-1232-6},
  volume       = {229},
  year         = {2018},
}

@article{6003,
  abstract     = {Digital fabrication devices are powerful tools for creating tangible reproductions of 3D digital models. Most available printing technologies aim at producing an accurate copy of a tridimensional shape. However, fabrication technologies can also be used to create a stylistic representation of a digital shape. We refer to this class of methods as ‘stylized fabrication methods’. These methods abstract geometric and physical features of a given shape to create an unconventional representation, to produce an optical illusion or to devise a particular interaction with the fabricated model. In this state‐of‐the‐art report, we classify and overview this broad and emerging class of approaches and also propose possible directions for future research.},
  author       = {Bickel, Bernd and Cignoni, Paolo and Malomo, Luigi and Pietroni, Nico},
  issn         = {0167-7055},
  journal      = {Computer Graphics Forum},
  number       = {6},
  pages        = {325--342},
  publisher    = {Wiley},
  title        = {{State of the art on stylized fabrication}},
  doi          = {10.1111/cgf.13327},
  volume       = {37},
  year         = {2018},
}

@inproceedings{6005,
  abstract     = {Network games are widely used as a model for selfish resource-allocation problems. In the classicalmodel, each player selects a path connecting her source and target vertices. The cost of traversingan edge depends on theload; namely, number of players that traverse it. Thus, it abstracts the factthat different users may use a resource at different times and for different durations, which playsan important role in determining the costs of the users in reality. For example, when transmittingpackets in a communication network, routing traffic in a road network, or processing a task in aproduction system, actual sharing and congestion of resources crucially depends on time.In [13], we introducedtimed network games, which add a time component to network games.Each vertexvin the network is associated with a cost function, mapping the load onvto theprice that a player pays for staying invfor one time unit with this load.  Each edge in thenetwork is guarded by the time intervals in which it can be traversed, which forces the players tospend time in the vertices. In this work we significantly extend the way time can be referred toin timed network games. In the model we study, the network is equipped withclocks, and, as intimed automata, edges are guarded by constraints on the values of the clocks, and their traversalmay involve a reset of some clocks. We argue that the stronger model captures many realisticnetworks.  The addition of clocks breaks the techniques we developed in [13] and we developnew techniques in order to show that positive results on classic network games carry over to thestronger timed setting.},
  author       = {Avni, Guy and Guha, Shibashis and Kupferman, Orna},
  issn         = {1868-8969},
  location     = {Liverpool, United Kingdom},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  title        = {{Timed network games with clocks}},
  doi          = {10.4230/LIPICS.MFCS.2018.23},
  volume       = {117},
  year         = {2018},
}

@article{6006,
  abstract     = {Network games (NGs) are played on directed graphs and are extensively used in network design and analysis. Search problems for NGs include finding special strategy profiles such as a Nash equilibrium and a globally-optimal solution. The networks modeled by NGs may be huge. In formal verification, abstraction has proven to be an extremely effective technique for reasoning about systems with big and even infinite state spaces. We describe an abstraction-refinement methodology for reasoning about NGs. Our methodology is based on an abstraction function that maps the state space of an NG to a much smaller state space. We search for a global optimum and a Nash equilibrium by reasoning on an under- and an over-approximation defined on top of this smaller state space. When the approximations are too coarse to find such profiles, we refine the abstraction function. We extend the abstraction-refinement methodology to labeled networks, where the objectives of the players are regular languages. Our experimental results demonstrate the effectiveness of the methodology. },
  author       = {Avni, Guy and Guha, Shibashis and Kupferman, Orna},
  issn         = {2073-4336},
  journal      = {Games},
  number       = {3},
  publisher    = {MDPI AG},
  title        = {{An abstraction-refinement methodology for reasoning about network games}},
  doi          = {10.3390/g9030039},
  volume       = {9},
  year         = {2018},
}

@article{6009,
  abstract     = {We study algorithmic questions wrt algebraic path properties in concurrent systems, where the transitions of the system are labeled from a complete, closed semiring. The algebraic path properties can model dataflow analysis problems, the shortest path problem, and many other natural problems that arise in program analysis. We consider that each component of the concurrent system is a graph with constant treewidth, a property satisfied by the controlflow graphs of most programs. We allow for multiple possible queries, which arise naturally in demand driven dataflow analysis. The study of multiple queries allows us to consider the tradeoff between the resource usage of the one-time preprocessing and for each individual query. The traditional approach constructs the product graph of all components and applies the best-known graph algorithm on the product. In this approach, even the answer to a single query requires the transitive closure (i.e., the results of all possible queries), which provides no room for tradeoff between preprocessing and query time.
Our main contributions are algorithms that significantly improve the worst-case running time of the traditional approach, and provide various tradeoffs depending on the number of queries. For example, in a concurrent system of two components, the traditional approach requires hexic time in the worst case for answering one query as well as computing the transitive closure, whereas we show that with one-time preprocessing in almost cubic time, each subsequent query can be answered in at most linear time, and even the transitive closure can be computed in almost quartic time. Furthermore, we establish conditional optimality results showing that the worst-case running time of our algorithms cannot be improved without achieving major breakthroughs in graph algorithms (i.e., improving the worst-case bound for the shortest path problem in general graphs). Preliminary experimental results show that our algorithms perform favorably on several benchmarks.
},
  author       = {Chatterjee, Krishnendu and Ibsen-Jensen, Rasmus and Goharshady, Amir Kafshdar and Pavlogiannis, Andreas},
  issn         = {0164-0925},
  journal      = {ACM Transactions on Programming Languages and Systems},
  number       = {3},
  publisher    = {Association for Computing Machinery (ACM)},
  title        = {{Algorithms for algebraic path properties in concurrent systems of constant treewidth components}},
  doi          = {10.1145/3210257},
  volume       = {40},
  year         = {2018},
}

@article{6010,
  abstract     = {The optic tectum (TeO), or superior colliculus, is a multisensory midbrain center that organizes spatially orienting responses to relevant stimuli. To define the stimulus with the highest priority at each moment, a network of reciprocal connections between the TeO and the isthmi promotes competition between concurrent tectal inputs. In the avian midbrain, the neurons mediating enhancement and suppression of tectal inputs are located in separate isthmic nuclei, facilitating the analysis of the neural processes that mediate competition. A specific subset of radial neurons in the intermediate tectal layers relay retinal inputs to the isthmi, but at present it is unclear whether separate neurons innervate individual nuclei or a single neural type sends a common input to several of them. In this study, we used in vitro neural tracing and cell-filling experiments in chickens to show that single neurons innervate, via axon collaterals, the three nuclei that comprise the isthmotectal network. This demonstrates that the input signals representing the strength of the incoming stimuli are simultaneously relayed to the mechanisms promoting both enhancement and suppression of the input signals. By performing in vivo recordings in anesthetized chicks, we also show that this common input generates synchrony between both antagonistic mechanisms, demonstrating that activity enhancement and suppression are closely coordinated. From a computational point of view, these results suggest that these tectal neurons constitute integrative nodes that combine inputs from different sources to drive in parallel several concurrent neural processes, each performing complementary functions within the network through different firing patterns and connectivity.},
  author       = {Garrido-Charad, Florencia and Vega Zuniga, Tomas A and Gutiérrez-Ibáñez, Cristián and Fernandez, Pedro and López-Jury, Luciana and González-Cabrera, Cristian and Karten, Harvey J. and Luksch, Harald and Marín, Gonzalo J.},
  issn         = {1091-6490},
  journal      = {Proceedings of the National Academy of Sciences},
  number       = {32},
  pages        = {E7615--E7623},
  publisher    = {National Academy of Sciences},
  title        = {{“Shepherd’s crook” neurons drive and synchronize the enhancing and suppressive mechanisms of the midbrain stimulus selection network}},
  doi          = {10.1073/pnas.1804517115},
  volume       = {115},
  year         = {2018},
}

@inproceedings{6011,
  abstract     = {We establish a data-dependent notion of algorithmic stability for Stochastic Gradient Descent (SGD), and employ it to develop novel generalization bounds. This is in contrast to previous distribution-free algorithmic stability results for SGD which depend on the worst-case constants. By virtue of the data-dependent argument, our bounds provide new insights into learning with SGD on convex and non-convex problems. In the convex case, we show that the bound on the generalization error depends on the risk at the initialization point. In the non-convex case, we prove that the expected curvature of the objective function around the initialization point has crucial influence on the generalization error. In both cases, our results suggest a simple data-driven strategy to stabilize SGD by pre-screening its initialization. As a corollary, our results allow us to show optimistic generalization bounds that exhibit fast convergence rates for SGD subject to a vanishing empirical risk and low noise of stochastic gradient. },
  author       = {Kuzborskij, Ilja and Lampert, Christoph},
  booktitle    = {Proceedings of the 35 th International Conference on Machine Learning},
  location     = {Stockholm, Sweden},
  pages        = {2815--2824},
  publisher    = {ML Research Press},
  title        = {{Data-dependent stability of stochastic gradient descent}},
  volume       = {80},
  year         = {2018},
}

@inproceedings{6012,
  abstract     = {We present an approach to identify concise equations from data using a shallow neural network approach. In contrast to ordinary black-box regression, this approach allows understanding functional relations and generalizing them from observed data to unseen parts of the parameter space. We show how to extend the class of learnable equations for a recently proposed equation learning network to include divisions, and we improve the learning and model selection strategy to be useful for challenging real-world data. For systems governed by analytical expressions, our method can in many cases identify the true underlying equation and extrapolate to unseen domains. We demonstrate its effectiveness by experiments on a cart-pendulum system, where only 2 random rollouts are required to learn the forward dynamics and successfully achieve the swing-up task.},
  author       = {Sahoo, Subham and Lampert, Christoph and Martius, Georg S},
  booktitle    = {Proceedings of the 35th International Conference on Machine Learning},
  location     = {Stockholm, Sweden},
  pages        = {4442--4450},
  publisher    = {ML Research Press},
  title        = {{Learning equations for extrapolation and control}},
  volume       = {80},
  year         = {2018},
}

@inproceedings{6031,
  abstract     = {We introduce Clover, a new library for efficient computation using low-precision data, providing mathematical routines required by fundamental methods in optimization and sparse recovery. Our library faithfully implements variants of stochastic quantization that guarantee convergence at low precision, and supports data formats from 4-bit quantized to 32-bit IEEE-754 on current Intel processors. In particular, we show that 4-bit can be implemented efficiently using Intel AVX despite the lack of native support for this data format. Experimental results with dot product, matrix-vector multiplication (MVM), gradient descent (GD), and iterative hard thresholding (IHT) demonstrate that the attainable speedups are in many cases close to linear with respect to the reduction of precision due to reduced data movement. Finally, for GD and IHT, we show examples of absolute speedup achieved by 4-bit versus 32-bit, by iterating until a given target error is achieved.},
  author       = {Stojanov, Alen and Smith, Tyler Michael and Alistarh, Dan-Adrian and Puschel, Markus},
  booktitle    = {2018 IEEE International Workshop on Signal Processing Systems},
  location     = {Cape Town, South Africa},
  publisher    = {IEEE},
  title        = {{Fast quantized arithmetic on x86: Trading compute for data movement}},
  doi          = {10.1109/SiPS.2018.8598402},
  volume       = {2018-October},
  year         = {2018},
}

@article{6032,
  abstract     = {The main result of this article is a generalization of the classical blossom algorithm for finding perfect matchings. Our algorithm can efficiently solve Boolean CSPs where each variable appears in exactly two constraints (we call it edge CSP) and all constraints are even Δ-matroid relations (represented by lists of tuples). As a consequence of this, we settle the complexity classification of planar Boolean CSPs started by Dvorak and Kupec. Using a reduction to even Δ-matroids, we then extend the tractability result to larger classes of Δ-matroids that we call efficiently coverable. It properly includes classes that were known to be tractable before, namely, co-independent, compact, local, linear, and binary, with the following caveat:We represent Δ-matroids by lists of tuples, while the last two use a representation by matrices. Since an n ×n matrix can represent exponentially many tuples, our tractability result is not strictly stronger than the known algorithm for linear and binary Δ-matroids.},
  author       = {Kazda, Alexandr and Kolmogorov, Vladimir and Rolinek, Michal},
  journal      = {ACM Transactions on Algorithms},
  number       = {2},
  publisher    = {ACM},
  title        = {{Even delta-matroids and the complexity of planar boolean CSPs}},
  doi          = {10.1145/3230649},
  volume       = {15},
  year         = {2018},
}

@article{606,
  abstract     = {We establish the existence of a global solution for a new family of fluid-like equations, which are obtained in certain regimes in as the mean-field evolution of the supercurrent density in a (2D section of a) type-II superconductor with pinning and with imposed electric current. We also consider general vortex-sheet initial data, and investigate the uniqueness and regularity properties of the solution. For some choice of parameters, the equation under investigation coincides with the so-called lake equation from 2D shallow water fluid dynamics, and our analysis then leads to a new existence result for rough initial data.},
  author       = {Duerinckx, Mitia and Fischer, Julian L},
  journal      = {Annales de l'Institut Henri Poincare (C) Non Linear Analysis},
  number       = {5},
  pages        = {1267--1319},
  publisher    = {Elsevier},
  title        = {{Well-posedness for mean-field evolutions arising in superconductivity}},
  doi          = {10.1016/j.anihpc.2017.11.004},
  volume       = {35},
  year         = {2018},
}

@article{607,
  abstract     = {We study the Fokker-Planck equation derived in the large system limit of the Markovian process describing the dynamics of quantitative traits. The Fokker-Planck equation is posed on a bounded domain and its transport and diffusion coefficients vanish on the domain's boundary. We first argue that, despite this degeneracy, the standard no-flux boundary condition is valid. We derive the weak formulation of the problem and prove the existence and uniqueness of its solutions by constructing the corresponding contraction semigroup on a suitable function space. Then, we prove that for the parameter regime with high enough mutation rate the problem exhibits a positive spectral gap, which implies exponential convergence to equilibrium.Next, we provide a simple derivation of the so-called Dynamic Maximum Entropy (DynMaxEnt) method for approximation of observables (moments) of the Fokker-Planck solution, which can be interpreted as a nonlinear Galerkin approximation. The limited applicability of the DynMaxEnt method inspires us to introduce its modified version that is valid for the whole range of admissible parameters. Finally, we present several numerical experiments to demonstrate the performance of both the original and modified DynMaxEnt methods. We observe that in the parameter regimes where both methods are valid, the modified one exhibits slightly better approximation properties compared to the original one.},
  author       = {Bodova, Katarina and Haskovec, Jan and Markowich, Peter},
  journal      = {Physica D: Nonlinear Phenomena},
  pages        = {108--120},
  publisher    = {Elsevier},
  title        = {{Well posedness and maximum entropy approximation for the dynamics of quantitative traits}},
  doi          = {10.1016/j.physd.2017.10.015},
  volume       = {376-377},
  year         = {2018},
}

@article{608,
  abstract     = {Synthesis is the automated construction of a system from its specification. In real life, hardware and software systems are rarely constructed from scratch. Rather, a system is typically constructed from a library of components. Lustig and Vardi formalized this intuition and studied LTL synthesis from component libraries. In real life, designers seek optimal systems. In this paper we add optimality considerations to the setting. We distinguish between quality considerations (for example, size - the smaller a system is, the better it is), and pricing (for example, the payment to the company who manufactured the component). We study the problem of designing systems with minimal quality-cost and price. A key point is that while the quality cost is individual - the choices of a designer are independent of choices made by other designers that use the same library, pricing gives rise to a resource-allocation game - designers that use the same component share its price, with the share being proportional to the number of uses (a component can be used several times in a design). We study both closed and open settings, and in both we solve the problem of finding an optimal design. In a setting with multiple designers, we also study the game-theoretic problems of the induced resource-allocation game.},
  author       = {Avni, Guy and Kupferman, Orna},
  journal      = {Theoretical Computer Science},
  pages        = {50 -- 72},
  publisher    = {Elsevier},
  title        = {{Synthesis from component libraries with costs}},
  doi          = {10.1016/j.tcs.2017.11.001},
  volume       = {712},
  year         = {2018},
}

@inbook{61,
  abstract     = {We prove that there is no strongly regular graph (SRG) with parameters (460; 153; 32; 60). The proof is based on a recent lower bound on the number of 4-cliques in a SRG and some applications of Euclidean representation of SRGs. },
  author       = {Bondarenko, Andriy and Mellit, Anton and Prymak, Andriy and Radchenko, Danylo and Viazovska, Maryna},
  booktitle    = {Contemporary Computational Mathematics},
  pages        = {131 -- 134},
  publisher    = {Springer},
  title        = {{There is no strongly regular graph with parameters (460; 153; 32; 60)}},
  doi          = {10.1007/978-3-319-72456-0_7},
  year         = {2018},
}

@article{612,
  abstract     = {Metabotropic GABAB receptors mediate slow inhibitory effects presynaptically and postsynaptically through the modulation of different effector signalling pathways. Here, we analysed the distribution of GABAB receptors using highly sensitive SDS-digested freeze-fracture replica labelling in mouse cerebellar Purkinje cells. Immunoreactivity for GABAB1 was observed on presynaptic and, more abundantly, on postsynaptic compartments, showing both scattered and clustered distribution patterns. Quantitative analysis of immunoparticles revealed a somato-dendritic gradient, with the density of immunoparticles increasing 26-fold from somata to dendritic spines. To understand the spatial relationship of GABAB receptors with two key effector ion channels, the G protein-gated inwardly rectifying K+ (GIRK/Kir3) channel and the voltage-dependent Ca2+ channel, biochemical and immunohistochemical approaches were performed. Co-immunoprecipitation analysis demonstrated that GABAB receptors co-assembled with GIRK and CaV2.1 channels in the cerebellum. Using double-labelling immunoelectron microscopic techniques, co-clustering between GABAB1 and GIRK2 was detected in dendritic spines, whereas they were mainly segregated in the dendritic shafts. In contrast, co-clustering of GABAB1 and CaV2.1 was detected in dendritic shafts but not spines. Presynaptically, although no significant co-clustering of GABAB1 and GIRK2 or CaV2.1 channels was detected, inter-cluster distance for GABAB1 and GIRK2 was significantly smaller in the active zone than in the dendritic shafts, and that for GABAB1 and CaV2.1 was significantly smaller in the active zone than in the dendritic shafts and spines. Thus, GABAB receptors are associated with GIRK and CaV2.1 channels in different subcellular compartments. These data provide a better framework for understanding the different roles played by GABAB receptors and their effector ion channels in the cerebellar network.},
  author       = {Luján, Rafael and Aguado, Carolina and Ciruela, Francisco and Cózar, Javier and Kleindienst, David and De La Ossa, Luis and Bettler, Bernhard and Wickman, Kevin and Watanabe, Masahiko and Shigemoto, Ryuichi and Fukazawa, Yugo},
  journal      = {Brain Structure and Function},
  number       = {3},
  pages        = {1565 -- 1587},
  publisher    = {Springer},
  title        = {{Differential association of GABAB receptors with their effector ion channels in Purkinje cells}},
  doi          = {10.1007/s00429-017-1568-y},
  volume       = {223},
  year         = {2018},
}

@article{616,
  abstract     = {Social insects protect their colonies from infectious disease through collective defences that result in social immunity. In ants, workers first try to prevent infection of colony members. Here, we show that if this fails and a pathogen establishes an infection, ants employ an efficient multicomponent behaviour − "destructive disinfection" − to prevent further spread of disease through the colony. Ants specifically target infected pupae during the pathogen's non-contagious incubation period, relying on chemical 'sickness cues' emitted by pupae. They then remove the pupal cocoon, perforate its cuticle and administer antimicrobial poison, which enters the body and prevents pathogen replication from the inside out. Like the immune system of a body that specifically targets and eliminates infected cells, this social immunity measure sacrifices infected brood to stop the pathogen completing its lifecycle, thus protecting the rest of the colony. Hence, the same principles of disease defence apply at different levels of biological organisation.},
  author       = {Pull, Christopher and Ugelvig, Line V and Wiesenhofer, Florian and Grasse, Anna V and Tragust, Simon and Schmitt, Thomas and Brown, Mark and Cremer, Sylvia},
  journal      = {eLife},
  publisher    = {eLife Sciences Publications},
  title        = {{Destructive disinfection of infected brood prevents systemic disease spread in ant colonies}},
  doi          = {10.7554/eLife.32073},
  volume       = {7},
  year         = {2018},
}

@article{617,
  abstract     = {Insects are exposed to a variety of potential pathogens in their environment, many of which can severely impact fitness and health. Consequently, hosts have evolved resistance and tolerance strategies to suppress or cope with infections. Hosts utilizing resistance improve fitness by clearing or reducing pathogen loads, and hosts utilizing tolerance reduce harmful fitness effects per pathogen load. To understand variation in, and selective pressures on, resistance and tolerance, we asked to what degree they are shaped by host genetic background, whether plasticity in these responses depends upon dietary environment, and whether there are interactions between these two factors. Females from ten wild-type Drosophila melanogaster genotypes were kept on high- or low-protein (yeast) diets and infected with one of two opportunistic bacterial pathogens, Lactococcus lactis or Pseudomonas entomophila. We measured host resistance as the inverse of bacterial load in the early infection phase. The relationship (slope) between fly fecundity and individual-level bacteria load provided our fecundity tolerance measure. Genotype and dietary yeast determined host fecundity and strongly affected survival after infection with pathogenic P. entomophila. There was considerable genetic variation in host resistance, a commonly found phenomenon resulting from for example varying resistance costs or frequency-dependent selection. Despite this variation and the reproductive cost of higher P. entomophila loads, fecundity tolerance did not vary across genotypes. The absence of genetic variation in tolerance may suggest that at this early infection stage, fecundity tolerance is fixed or that any evolved tolerance mechanisms are not expressed under these infection conditions.},
  author       = {Kutzer, Megan and Kurtz, Joachim and Armitage, Sophie},
  issn         = {1420-9101},
  journal      = {Journal of Evolutionary Biology},
  number       = {1},
  pages        = {159  -- 171},
  publisher    = {Wiley},
  title        = {{Genotype and diet affect resistance, survival, and fecundity but not fecundity tolerance}},
  doi          = {10.1111/jeb.13211},
  volume       = {31},
  year         = {2018},
}