@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},
  title        = {{An abstraction-refinement methodology for reasoning about network games}},
  doi          = {10.3390/g9030039},
  volume       = {9},
  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{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},
}

@inproceedings{6195,
  abstract     = {In the context of robotic manipulation and grasping, the shift from a view that is static (force closure of a single posture) and contact-deprived (only contact for force closure is allowed, everything else is obstacle) towards a view that is dynamic and contact-rich (soft manipulation) has led to an increased interest in soft hands. These hands can easily exploit environmental constraints and object surfaces without risk, and safely interact with humans, but present also some challenges. Designing them is difficult, as well as predicting, modelling, and “programming” their interactions with the objects and the environment. This paper tackles the problem of simulating them in a fast and effective way, leveraging on novel and existing simulation technologies. We present a triple-layered simulation framework where dynamic properties such as stiffness are determined from slow but accurate FEM simulation data once, and then condensed into a lumped parameter model that can be used to fast simulate soft fingers and soft hands. We apply our approach to the simulation of soft pneumatic fingers.},
  author       = {Pozzi, Maria and Miguel Villalba, Eder and Deimel, Raphael and Malvezzi, Monica and Bickel, Bernd and Brock, Oliver and Prattichizzo, Domenico},
  isbn         = {9781538630815},
  location     = {Brisbane, Australia},
  publisher    = {IEEE},
  title        = {{Efficient FEM-based simulation of soft robots modeled as kinematic chains}},
  doi          = {10.1109/icra.2018.8461106},
  year         = {2018},
}

@article{62,
  abstract     = {Imaging is a dominant strategy for data collection in neuroscience, yielding stacks of images that often scale to gigabytes of data for a single experiment. Machine learning algorithms from computer vision can serve as a pair of virtual eyes that tirelessly processes these images, automatically detecting and identifying microstructures. Unlike learning methods, our Flexible Learning-free Reconstruction of Imaged Neural volumes (FLoRIN) pipeline exploits structure-specific contextual clues and requires no training. This approach generalizes across different modalities, including serially-sectioned scanning electron microscopy (sSEM) of genetically labeled and contrast enhanced processes, spectral confocal reflectance (SCoRe) microscopy, and high-energy synchrotron X-ray microtomography (μCT) of large tissue volumes. We deploy the FLoRIN pipeline on newly published and novel mouse datasets, demonstrating the high biological fidelity of the pipeline’s reconstructions. FLoRIN reconstructions are of sufficient quality for preliminary biological study, for example examining the distribution and morphology of cells or extracting single axons from functional data. Compared to existing supervised learning methods, FLoRIN is one to two orders of magnitude faster and produces high-quality reconstructions that are tolerant to noise and artifacts, as is shown qualitatively and quantitatively.},
  author       = {Shabazi, Ali and Kinnison, Jeffery and Vescovi, Rafael and Du, Ming and Hill, Robert and Jösch, Maximilian A and Takeno, Marc and Zeng, Hongkui and Da Costa, Nuno and Grutzendler, Jaime and Kasthuri, Narayanan and Scheirer, Walter},
  journal      = {Scientific Reports},
  number       = {1},
  publisher    = {Nature Publishing Group},
  title        = {{Flexible learning-free segmentation and reconstruction of neural volumes}},
  doi          = {10.1038/s41598-018-32628-3},
  volume       = {8},
  year         = {2018},
}

@article{620,
  abstract     = {Clathrin-mediated endocytosis requires the coordinated assembly of various endocytic proteins and lipids at the plasma membrane. Accumulating evidence demonstrates a crucial role for phosphatidylinositol-4,5-bisphosphate (PtdIns(4,5)P2) in endocytosis, but specific roles for PtdIns(4)P other than as the biosynthetic precursor of PtdIns(4,5)P2 have not been clarified. In this study we investigated the role of PtdIns(4)P or PtdIns(4,5)P2 in receptor-mediated endocytosis through the construction of temperature-sensitive (ts) mutants for the PI 4-kinases Stt4p and Pik1p and the PtdIns(4) 5-kinase Mss4p. Quantitative analyses of endocytosis revealed that both the stt4(ts)pik1(ts) and mss4(ts) mutants have a severe defect in endocytic internalization. Live-cell imaging of endocytic protein dynamics in stt4(ts)pik1(ts) and mss4(ts) mutants revealed that PtdIns(4)P is required for the recruitment of the alpha-factor receptor Ste2p to clathrin-coated pits whereas PtdIns(4,5)P2 is required for membrane internalization. We also found that the localization to endocytic sites of the ENTH/ANTH domain-bearing clathrin adaptors, Ent1p/Ent2p and Yap1801p/Yap1802p, is significantly impaired in the stt4(ts)pik1(ts) mutant, but not in the mss4(ts) mutant. These results suggest distinct roles in successive steps for PtdIns(4)P and PtdIns(4,5)P2 during receptor-mediated endocytosis.},
  author       = {Yamamoto, Wataru and Wada, Suguru and Nagano, Makoto and Aoshima, Kaito and Siekhaus, Daria E and Toshima, Junko and Toshima, Jiro},
  journal      = {Journal of Cell Science},
  number       = {1},
  publisher    = {Company of Biologists},
  title        = {{Distinct roles for plasma membrane PtdIns 4 P and PtdIns 4 5 P2 during yeast receptor mediated endocytosis}},
  doi          = {10.1242/jcs.207696},
  volume       = {131},
  year         = {2018},
}

@article{63,
  abstract     = {African cichlids display a remarkable assortment of jaw morphologies, pigmentation patterns, and mating behaviors. In addition to this previously documented diversity, recent studies have documented a rich diversity of sex chromosomes within these fishes. Here we review the known sex-determination network within vertebrates, and the extraordinary number of sex chromosomes systems segregating in African cichlids. We also propose a model for understanding the unusual number of sex chromosome systems within this clade.},
  author       = {Gammerdinger, William J and Kocher, Thomas},
  journal      = {Genes},
  number       = {10},
  publisher    = {MDPI},
  title        = {{Unusual diversity of sex chromosomes in African cichlid fishes}},
  doi          = {10.3390/genes9100480},
  volume       = {9},
  year         = {2018},
}

@article{6339,
  abstract     = {We introduce a diagrammatic Monte Carlo approach to angular momentum properties of quantum many-particle systems possessing a macroscopic number of degrees of freedom. The treatment is based on a diagrammatic expansion that merges the usual Feynman diagrams with the angular momentum diagrams known from atomic and nuclear structure theory, thereby incorporating the non-Abelian algebra inherent to quantum rotations. Our approach is applicable at arbitrary coupling, is free of systematic errors and of finite-size effects, and naturally provides access to the impurity Green function. We exemplify the technique by obtaining an all-coupling solution of the angulon model; however, the method is quite general and can be applied to a broad variety of systems in which particles exchange quantum angular momentum with their many-body environment.},
  author       = {Bighin, Giacomo and Tscherbul, Timur and Lemeshko, Mikhail},
  journal      = {Physical Review Letters},
  number       = {16},
  publisher    = {American Physical Society},
  title        = {{Diagrammatic Monte Carlo approach to angular momentum in quantum many-particle systems}},
  doi          = {10.1103/physrevlett.121.165301},
  volume       = {121},
  year         = {2018},
}

@article{6354,
  abstract     = {Blood platelets are critical for hemostasis and thrombosis, but also play diverse roles during immune responses. We have recently reported that platelets migrate at sites of infection in vitro and in vivo. Importantly, platelets use their ability to migrate to collect and bundle fibrin (ogen)-bound bacteria accomplishing efficient intravascular bacterial trapping. Here, we describe a method that allows analyzing platelet migration in vitro, focusing on their ability to collect bacteria and trap bacteria under flow.},
  author       = {Fan, Shuxia and Lorenz, Michael and Massberg, Steffen and Gärtner, Florian R},
  issn         = {2331-8325},
  journal      = {Bio-Protocol},
  keywords     = {Platelets, Cell migration, Bacteria, Shear flow, Fibrinogen, E. coli},
  number       = {18},
  publisher    = {Bio-Protocol},
  title        = {{Platelet migration and bacterial trapping assay under flow}},
  doi          = {10.21769/bioprotoc.3018},
  volume       = {8},
  year         = {2018},
}

@article{64,
  abstract     = {Tropical geometry, an established field in pure mathematics, is a place where string theory, mirror symmetry, computational algebra, auction theory, and so forth meet and influence one another. In this paper, we report on our discovery of a tropical model with self-organized criticality (SOC) behavior. Our model is continuous, in contrast to all known models of SOC, and is a certain scaling limit of the sandpile model, the first and archetypical model of SOC. We describe how our model is related to pattern formation and proportional growth phenomena and discuss the dichotomy between continuous and discrete models in several contexts. Our aim in this context is to present an idealized tropical toy model (cf. Turing reaction-diffusion model), requiring further investigation.},
  author       = {Kalinin, Nikita and Guzmán Sáenz, Aldo and Prieto, Y and Shkolnikov, Mikhail and Kalinina, V and Lupercio, Ernesto},
  issn         = {0027-8424},
  journal      = {Proceedings of the National Academy of Sciences of the United States of America},
  number       = {35},
  pages        = {E8135 -- E8142},
  publisher    = {National Academy of Sciences},
  title        = {{Self-organized criticality and pattern emergence through the lens of tropical geometry}},
  doi          = {10.1073/pnas.1805847115},
  volume       = {115},
  year         = {2018},
}

@article{6497,
  abstract     = {T cells are actively scanning pMHC-presenting cells in lymphoid organs and nonlymphoid tissues (NLTs) with divergent topologies and confinement. How the T cell actomyosin cytoskeleton facilitates this task in distinct environments is incompletely understood. Here, we show that lack of Myosin IXb (Myo9b), a negative regulator of the small GTPase Rho, led to increased Rho-GTP levels and cell surface stiffness in primary T cells. Nonetheless, intravital imaging revealed robust motility of Myo9b−/− CD8+ T cells in lymphoid tissue and similar expansion and differentiation during immune responses. In contrast, accumulation of Myo9b−/− CD8+ T cells in NLTs was strongly impaired. Specifically, Myo9b was required for T cell crossing of basement membranes, such as those which are present between dermis and epidermis. As consequence, Myo9b−/− CD8+ T cells showed impaired control of skin infections. In sum, we show that Myo9b is critical for the CD8+ T cell adaptation from lymphoid to NLT surveillance and the establishment of protective tissue–resident T cell populations.},
  author       = {Moalli, Federica and Ficht, Xenia and Germann, Philipp and Vladymyrov, Mykhailo and Stolp, Bettina and de Vries, Ingrid and Lyck, Ruth and Balmer, Jasmin and Fiocchi, Amleto and Kreutzfeldt, Mario and Merkler, Doron and Iannacone, Matteo and Ariga, Akitaka and Stoffel, Michael H. and Sharpe, James and Bähler, Martin and Sixt, Michael K and Diz-Muñoz, Alba and Stein, Jens V.},
  issn         = {1540-9538},
  journal      = {The Journal of Experimental Medicine},
  number       = {7},
  pages        = {1869–1890},
  publisher    = {Rockefeller University Press},
  title        = {{The Rho regulator Myosin IXb enables nonlymphoid tissue seeding of protective CD8+T cells}},
  doi          = {10.1084/jem.20170896},
  volume       = {2015},
  year         = {2018},
}

@article{6499,
  abstract     = {Expansion microscopy is a recently introduced imaging technique that achieves super‐resolution through physically expanding the specimen by ~4×, after embedding into a swellable gel. The resolution attained is, correspondingly, approximately fourfold better than the diffraction limit, or ~70 nm. This is a major improvement over conventional microscopy, but still lags behind modern STED or STORM setups, whose resolution can reach 20–30 nm. We addressed this issue here by introducing an improved gel recipe that enables an expansion factor of ~10× in each dimension, which corresponds to an expansion of the sample volume by more than 1,000‐fold. Our protocol, which we termed X10 microscopy, achieves a resolution of 25–30 nm on conventional epifluorescence microscopes. X10 provides multi‐color images similar or even superior to those produced with more challenging methods, such as STED, STORM, and iterative expansion microscopy (iExM). X10 is therefore the cheapest and easiest option for high‐quality super‐resolution imaging currently available. X10 should be usable in any laboratory, irrespective of the machinery owned or of the technical knowledge.},
  author       = {Truckenbrodt, Sven M and Maidorn, Manuel and Crzan, Dagmar and Wildhagen, Hanna and Kabatas, Selda and Rizzoli, Silvio O},
  issn         = {1469-3178},
  journal      = {EMBO reports},
  number       = {9},
  publisher    = {Embo Press},
  title        = {{X10 expansion microscopy enables 25‐nm resolution on conventional microscopes}},
  doi          = {10.15252/embr.201845836},
  volume       = {19},
  year         = {2018},
}