@article{951,
  abstract     = {Dengue-suppressing Wolbachia strains are promising tools for arbovirus control, particularly as they have the potential to self-spread following local introductions. To test this, we followed the frequency of the transinfected Wolbachia strain wMel through Ae. aegypti in Cairns, Australia, following releases at 3 nonisolated locations within the city in early 2013. Spatial spread was analysed graphically using interpolation and by fitting a statistical model describing the position and width of the wave. For the larger 2 of the 3 releases (covering 0.97 km2 and 0.52 km2), we observed slow but steady spatial spread, at about 100–200 m per year, roughly consistent with theoretical predictions. In contrast, the smallest release (0.11 km2) produced erratic temporal and spatial dynamics, with little evidence of spread after 2 years. This is consistent with the prediction concerning fitness-decreasing Wolbachia transinfections that a minimum release area is needed to achieve stable local establishment and spread in continuous habitats. Our graphical and likelihood analyses produced broadly consistent estimates of wave speed and wave width. Spread at all sites was spatially heterogeneous, suggesting that environmental heterogeneity will affect large-scale Wolbachia transformations of urban mosquito populations. The persistence and spread of Wolbachia in release areas meeting minimum area requirements indicates the promise of successful large-scale population transfo},
  author       = {Schmidt, Tom and Barton, Nicholas H and Rasic, Gordana and Turley, Andrew and Montgomery, Brian and Iturbe Ormaetxe, Inaki and Cook, Peter and Ryan, Peter and Ritchie, Scott and Hoffmann, Ary and O’Neill, Scott and Turelli, Michael},
  issn         = {15449173},
  journal      = {PLoS Biology},
  number       = {5},
  publisher    = {Public Library of Science},
  title        = {{Local introduction and heterogeneous spatial spread of dengue-suppressing Wolbachia through an urban population of Aedes Aegypti}},
  doi          = {10.1371/journal.pbio.2001894},
  volume       = {15},
  year         = {2017},
}

@article{952,
  abstract     = {A novel strategy for controlling the spread of arboviral diseases such as dengue, Zika and chikungunya is to transform mosquito populations with virus-suppressing Wolbachia. In general, Wolbachia transinfected into mosquitoes induce fitness costs through lower viability or fecundity. These maternally inherited bacteria also produce a frequency-dependent advantage for infected females by inducing cytoplasmic incompatibility (CI), which kills the embryos produced by uninfected females mated to infected males. These competing effects, a frequency-dependent advantage and frequency-independent costs, produce bistable Wolbachia frequency dynamics. Above a threshold frequency, denoted pˆ, CI drives fitness-decreasing Wolbachia transinfections through local populations; but below pˆ, infection frequencies tend to decline to zero. If pˆ is not too high, CI also drives spatial spread once infections become established over sufficiently large areas. We illustrate how simple models provide testable predictions concerning the spatial and temporal dynamics of Wolbachia introductions, focusing on rate of spatial spread, the shape of spreading waves, and the conditions for initiating spread from local introductions. First, we consider the robustness of diffusion-based predictions to incorporating two important features of wMel-Aedes aegypti biology that may be inconsistent with the diffusion approximations, namely fast local dynamics induced by complete CI (i.e., all embryos produced from incompatible crosses die) and long-tailed, non-Gaussian dispersal. With complete CI, our numerical analyses show that long-tailed dispersal changes wave-width predictions only slightly; but it can significantly reduce wave speed relative to the diffusion prediction; it also allows smaller local introductions to initiate spatial spread. Second, we use approximations for pˆ and dispersal distances to predict the outcome of 2013 releases of wMel-infected Aedes aegypti in Cairns, Australia, Third, we describe new data from Ae. aegypti populations near Cairns, Australia that demonstrate long-distance dispersal and provide an approximate lower bound on pˆ for wMel in northeastern Australia. Finally, we apply our analyses to produce operational guidelines for efficient transformation of vector populations over large areas. We demonstrate that even very slow spatial spread, on the order of 10-20 m/month (as predicted), can produce area-wide population transformation within a few years following initial releases covering about 20-30% of the target area.},
  author       = {Turelli, Michael and Barton, Nicholas H},
  issn         = {00405809},
  journal      = {Theoretical Population Biology},
  pages        = {45 -- 60},
  publisher    = {Elsevier},
  title        = {{Deploying dengue-suppressing Wolbachia: Robust models predict slow but effective spatial spread in Aedes aegypti}},
  doi          = {10.1016/j.tpb.2017.03.003},
  volume       = {115},
  year         = {2017},
}

@article{953,
  abstract     = {The role of natural selection in the evolution of adaptive phenotypes has undergone constant probing by evolutionary biologists, employing both theoretical and empirical approaches. As Darwin noted, natural selection can act together with other processes, including random changes in the frequencies of phenotypic differences that are not under strong selection, and changes in the environment, which may reflect evolutionary changes in the organisms themselves. As understanding of genetics developed after 1900, the new genetic discoveries were incorporated into evolutionary biology. The resulting general principles were summarized by Julian Huxley in his 1942 book Evolution: the modern synthesis. Here, we examine how recent advances in genetics, developmental biology and molecular biology, including epigenetics, relate to today's understanding of the evolution of adaptations. We illustrate how careful genetic studies have repeatedly shown that apparently puzzling results in a wide diversity of organisms involve processes that are consistent with neo-Darwinism. They do not support important roles in adaptation for processes such as directed mutation or the inheritance of acquired characters, and therefore no radical revision of our understanding of the mechanism of adaptive evolution is needed.},
  author       = {Charlesworth, Deborah and Barton, Nicholas H and Charlesworth, Brian},
  journal      = {Proceedings of the Royal Society of London Series B Biological Sciences},
  number       = {1855},
  publisher    = {Royal Society, The},
  title        = {{The sources of adaptive evolution}},
  doi          = {10.1098/rspb.2016.2864},
  volume       = {284},
  year         = {2017},
}

@article{954,
  abstract     = {Understanding the relation between genotype and phenotype remains a major challenge. The difficulty of predicting individual mutation effects, and particularly the interactions between them, has prevented the development of a comprehensive theory that links genotypic changes to their phenotypic effects. We show that a general thermodynamic framework for gene regulation, based on a biophysical understanding of protein-DNA binding, accurately predicts the sign of epistasis in a canonical cis-regulatory element consisting of overlapping RNA polymerase and repressor binding sites. Sign and magnitude of individual mutation effects are sufficient to predict the sign of epistasis and its environmental dependence. Thus, the thermodynamic model offers the correct null prediction for epistasis between mutations across DNA-binding sites. Our results indicate that a predictive theory for the effects of cis-regulatory mutations is possible from first principles, as long as the essential molecular mechanisms and the constraints these impose on a biological system are accounted for.},
  author       = {Lagator, Mato and Paixao, Tiago and Barton, Nicholas H and Bollback, Jonathan P and Guet, Calin C},
  issn         = {2050084X},
  journal      = {eLife},
  publisher    = {eLife Sciences Publications},
  title        = {{On the mechanistic nature of epistasis in a canonical cis-regulatory element}},
  doi          = {10.7554/eLife.25192},
  volume       = {6},
  year         = {2017},
}

@article{955,
  abstract     = {Gene expression is controlled by networks of regulatory proteins that interact specifically with external signals and DNA regulatory sequences. These interactions force the network components to co-evolve so as to continually maintain function. Yet, existing models of evolution mostly focus on isolated genetic elements. In contrast, we study the essential process by which regulatory networks grow: the duplication and subsequent specialization of network components. We synthesize a biophysical model of molecular interactions with the evolutionary framework to find the conditions and pathways by which new regulatory functions emerge. We show that specialization of new network components is usually slow, but can be drastically accelerated in the presence of regulatory crosstalk and mutations that promote promiscuous interactions between network components.},
  author       = {Friedlander, Tamar and Prizak, Roshan and Barton, Nicholas H and Tkacik, Gasper},
  issn         = {20411723},
  journal      = {Nature Communications},
  number       = {1},
  publisher    = {Nature Publishing Group},
  title        = {{Evolution of new regulatory functions on biophysically realistic fitness landscapes}},
  doi          = {10.1038/s41467-017-00238-8},
  volume       = {8},
  year         = {2017},
}

@article{956,
  abstract     = {We study a class of ergodic quantum Markov semigroups on finite-dimensional unital C⁎-algebras. These semigroups have a unique stationary state σ, and we are concerned with those that satisfy a quantum detailed balance condition with respect to σ. We show that the evolution on the set of states that is given by such a quantum Markov semigroup is gradient flow for the relative entropy with respect to σ in a particular Riemannian metric on the set of states. This metric is a non-commutative analog of the 2-Wasserstein metric, and in several interesting cases we are able to show, in analogy with work of Otto on gradient flows with respect to the classical 2-Wasserstein metric, that the relative entropy is strictly and uniformly convex with respect to the Riemannian metric introduced here. As a consequence, we obtain a number of new inequalities for the decay of relative entropy for ergodic quantum Markov semigroups with detailed balance.},
  author       = {Carlen, Eric and Maas, Jan},
  issn         = {00221236},
  journal      = {Journal of Functional Analysis},
  number       = {5},
  pages        = {1810 -- 1869},
  publisher    = {Academic Press},
  title        = {{Gradient flow and entropy inequalities for quantum Markov semigroups with detailed balance}},
  doi          = {10.1016/j.jfa.2017.05.003},
  volume       = {273},
  year         = {2017},
}

@inbook{957,
  abstract     = {Small molecule biosensors based on Forster resonance energy transfer (FRET) enable small molecule signaling to be monitored with high spatial and temporal resolution in complex cellular environments. FRET sensors can be constructed by fusing a pair of fluorescent proteins to a suitable recognition domain, such as a member of the solute-binding protein (SBP) superfamily. However, naturally occurring SBPs may be unsuitable for incorporation into FRET sensors due to their low thermostability, which may preclude imaging under physiological conditions, or because the positions of their N- and C-termini may be suboptimal for fusion of fluorescent proteins, which may limit the dynamic range of the resulting sensors. Here, we show how these problems can be overcome using ancestral protein reconstruction and circular permutation. Ancestral protein reconstruction, used as a protein engineering strategy, leverages phylogenetic information to improve the thermostability of proteins, while circular permutation enables the termini of an SBP to be repositioned to maximize the dynamic range of the resulting FRET sensor. We also provide a protocol for cloning the engineered SBPs into FRET sensor constructs using Golden Gate assembly and discuss considerations for in situ characterization of the FRET sensors.},
  author       = {Clifton, Ben and Whitfield, Jason and Sanchez Romero, Inmaculada and Herde, Michel and Henneberger, Christian and Janovjak, Harald L and Jackson, Colin},
  booktitle    = {Synthetic Protein Switches},
  editor       = {Stein, Viktor},
  issn         = {10643745},
  pages        = {71 -- 87},
  publisher    = {Springer},
  title        = {{Ancestral protein reconstruction and circular permutation for improving the stability and dynamic range of FRET sensors}},
  doi          = {10.1007/978-1-4939-6940-1_5},
  volume       = {1596},
  year         = {2017},
}

@article{9574,
  abstract     = {Consider the sum X(ξ)=∑ni=1aiξi, where a=(ai)ni=1 is a sequence of non-zero reals and ξ=(ξi)ni=1 is a sequence of i.i.d. Rademacher random variables (that is, Pr[ξi=1]=Pr[ξi=−1]=1/2). The classical Littlewood-Offord problem asks for the best possible upper bound on the concentration probabilities Pr[X=x]. In this paper we study a resilience version of the Littlewood-Offord problem: how many of the ξi is an adversary typically allowed to change without being able to force concentration on a particular value? We solve this problem asymptotically, and present a few interesting open problems.},
  author       = {Bandeira, Afonso S. and Ferber, Asaf and Kwan, Matthew Alan},
  issn         = {1571-0653},
  journal      = {Electronic Notes in Discrete Mathematics},
  pages        = {93--99},
  publisher    = {Elsevier},
  title        = {{Resilience for the Littlewood-Offord problem}},
  doi          = {10.1016/j.endm.2017.06.025},
  volume       = {61},
  year         = {2017},
}

@inbook{958,
  abstract     = {Biosensors that exploit Forster resonance energy transfer (FRET) can be used to visualize biological and physiological processes and are capable of providing detailed information in both spatial and temporal dimensions. In a FRET-based biosensor, substrate binding is associated with a change in the relative positions of two fluorophores, leading to a change in FRET efficiency that may be observed in the fluorescence spectrum. As a result, their design requires a ligand-binding protein that exhibits a conformational change upon binding. However, not all ligand-binding proteins produce responsive sensors upon conjugation to fluorescent proteins or dyes, and identifying the optimum locations for the fluorophores often involves labor-intensive iterative design or high-throughput screening. Combining the genetic fusion of a fluorescent protein to the ligand-binding protein with site-specific covalent attachment of a fluorescent dye can allow fine control over the positions of the two fluorophores, allowing the construction of very sensitive sensors. This relies upon the accurate prediction of the locations of the two fluorophores in bound and unbound states. In this chapter, we describe a method for computational identification of dye-attachment sites that allows the use of cysteine modification to attach synthetic dyes that can be paired with a fluorescent protein for the purposes of creating FRET sensors.},
  author       = {Mitchell, Joshua and Zhang, William and Herde, Michel and Henneberger, Christian and Janovjak, Harald L and O'Mara, Megan and Jackson, Colin},
  booktitle    = {Synthetic Protein Switches},
  editor       = {Stein, Viktor},
  issn         = {10643745},
  pages        = {89 -- 99},
  publisher    = {Springer},
  title        = {{Method for developing optical sensors using a synthetic dye fluorescent protein FRET pair and computational modeling and assessment}},
  doi          = {10.1007/978-1-4939-6940-1_6},
  volume       = {1596},
  year         = {2017},
}

@article{9588,
  abstract     = {Consider the sum  X(ξ)=∑ni=1aiξi , where  a=(ai)ni=1  is a sequence of non-zero reals and  ξ=(ξi)ni=1  is a sequence of i.i.d. Rademacher random variables (that is,  Pr[ξi=1]=Pr[ξi=−1]=1/2 ). The classical Littlewood-Offord problem asks for the best possible upper bound on the concentration probabilities  Pr[X=x] . In this paper we study a resilience version of the Littlewood-Offord problem: how many of the  ξi  is an adversary typically allowed to change without being able to force concentration on a particular value? We solve this problem asymptotically, and present a few interesting open problems.},
  author       = {Bandeira, Afonso S. and Ferber, Asaf and Kwan, Matthew Alan},
  issn         = {0001-8708},
  journal      = {Advances in Mathematics},
  pages        = {292--312},
  publisher    = {Elsevier},
  title        = {{Resilience for the Littlewood–Offord problem}},
  doi          = {10.1016/j.aim.2017.08.031},
  volume       = {319},
  year         = {2017},
}

@article{9589,
  abstract     = {We give an asymptotic expression for the expected number of spanning trees in a random graph with a given degree sequence , provided that the number of edges is at least , where  is the maximum degree. A key part of our argument involves establishing a concentration result for a certain family of functions over random trees with given degrees, using Prüfer codes.},
  author       = {Greenhill, Catherine and Isaev, Mikhail and Kwan, Matthew Alan and McKay, Brendan D.},
  issn         = {0195-6698},
  journal      = {European Journal of Combinatorics},
  pages        = {6--25},
  publisher    = {Elsevier},
  title        = {{The average number of spanning trees in sparse graphs with given degrees}},
  doi          = {10.1016/j.ejc.2017.02.003},
  volume       = {63},
  year         = {2017},
}

@article{959,
  abstract     = {In this work it is shown that scale-free tails in metabolic flux distributions inferred in stationary models are an artifact due to reactions involved in thermodynamically unfeasible cycles, unbounded by physical constraints and in principle able to perform work without expenditure of free energy. After implementing thermodynamic constraints by removing such loops, metabolic flux distributions scale meaningfully with the physical limiting factors, acquiring in turn a richer multimodal structure potentially leading to symmetry breaking while optimizing for objective functions.},
  author       = {De Martino, Daniele},
  issn         = {24700045},
  journal      = { Physical Review E Statistical Nonlinear and Soft Matter Physics },
  number       = {6},
  pages        = {062419},
  publisher    = {American Institute of Physics},
  title        = {{Scales and multimodal flux distributions in stationary metabolic network models via thermodynamics}},
  doi          = {10.1103/PhysRevE.95.062419},
  volume       = {95},
  year         = {2017},
}

@article{9590,
  abstract     = {We show that for any fixed dense graph G and bounded-degree tree T on the same number of vertices, a modest random perturbation of G will typically contain a copy of T . This combines the viewpoints of the well-studied problems of embedding trees into fixed dense graphs and into random graphs, and extends a sizeable body of existing research on randomly perturbed graphs. Specifically, we show that there is c=c(α,Δ) such that if G is an n-vertex graph with minimum degree at least αn, and T is an n-vertex tree with maximum degree at most Δ , then if we add cn uniformly random edges to G, the resulting graph will contain T asymptotically almost surely (as n→∞ ). Our proof uses a lemma concerning the decomposition of a dense graph into super-regular pairs of comparable sizes, which may be of independent interest.},
  author       = {Krivelevich, Michael and Kwan, Matthew Alan and Sudakov, Benny},
  issn         = {1095-7146},
  journal      = {SIAM Journal on Discrete Mathematics},
  number       = {1},
  pages        = {155--171},
  publisher    = {Society for Industrial & Applied Mathematics},
  title        = {{Bounded-degree spanning trees in randomly perturbed graphs}},
  doi          = {10.1137/15m1032910},
  volume       = {31},
  year         = {2017},
}

@article{960,
  abstract     = {The human cerebral cortex is the seat of our cognitive abilities and composed of an extraordinary number of neurons, organized in six distinct layers. The establishment of specific morphological and physiological features in individual neurons needs to be regulated with high precision. Impairments in the sequential developmental programs instructing corticogenesis lead to alterations in the cortical cytoarchitecture which is thought to represent the major underlying cause for several neurological disorders including neurodevelopmental and psychiatric diseases. In this review we discuss the role of cell polarity at sequential stages during cortex development. We first provide an overview of morphological cell polarity features in cortical neural stem cells and newly-born postmitotic neurons. We then synthesize a conceptual molecular and biochemical framework how cell polarity is established at the cellular level through a break in symmetry in nascent cortical projection neurons. Lastly we provide a perspective how the molecular mechanisms applying to single cells could be probed and integrated in an in vivo and tissue-wide context.},
  author       = {Hansen, Andi H and Düllberg, Christian F and Mieck, Christine and Loose, Martin and Hippenmeyer, Simon},
  issn         = {16625102},
  journal      = {Frontiers in Cellular Neuroscience},
  publisher    = {Frontiers Research Foundation},
  title        = {{Cell polarity in cerebral cortex development - cellular architecture shaped by biochemical networks}},
  doi          = {10.3389/fncel.2017.00176},
  volume       = {11},
  year         = {2017},
}

@phdthesis{961,
  abstract     = {Cell-cell  contact  formation  constitutes  the  first  step  in  the  emergence  of  multicellularity  in evolution, thereby  allowing  the  differentiation  of  specialized  cell  types.  In  metazoan development, cell-cell contact formation is thought to influence cell fate specification, and cell   fate   specification   has   been   implicated   in   cell-cell  contact formation.   However, remarkably little is yet known about whether and how the interaction and feedback between cell-cell contact formation and cell fate specification affect development. Here we identify a positive  feedback  loop  between  cell-cell  contact  duration,  morphogen  signaling  and mesendoderm  cell  fate  specification  during  zebrafish  gastrulation.  We  show  that  long lasting cell-cell contacts enhance the competence of prechordal plate (ppl) progenitor cells to  respond  to  Nodal  signaling,  required  for  proper  ppl  cell  fate  specification.  We  further show  that  Nodal  signalling  romotes  ppl  cell-cell  contact  duration,  thereby  generating  an effective  positive  feedback  loop  between  ppl  cell-cell  contact  duration  and  cell  fate specification. Finally, by using a combination of theoretical modeling and experimentation, we  show  that  this  feedback  loop  determines  whether  anterior  axial  mesendoderm  cells become  ppl  progenitors  or,  instead,  turn  into  endoderm  progenitors.  Our  findings  reveal that  the  gene  regulatory  networks  leading  to  cell  fate  diversification  within  the  developing embryo  are  controlled  by  the  interdependent  activities  of  cell-cell  signaling  and  contact formation.},
  author       = {Barone, Vanessa},
  issn         = {2663-337X},
  pages        = {109},
  publisher    = {Institute of Science and Technology Austria},
  title        = {{Cell adhesion and cell fate: An effective feedback loop during zebrafish gastrulation}},
  doi          = {10.15479/AT:ISTA:th_825},
  year         = {2017},
}

@inproceedings{962,
  abstract     = {We present a new algorithm for model counting of a class of string constraints. In addition to the classic operation of concatenation, our class includes some recursively defined operations such as Kleene closure, and replacement of substrings. Additionally, our class also includes length constraints on the string expressions, which means, by requiring reasoning about numbers, that we face a multi-sorted logic. In the end, our string constraints are motivated by their use in programming for web applications. Our algorithm comprises two novel features: the ability to use a technique of (1) partial derivatives for constraints that are already in a solved form, i.e. a form where its (string) satisfiability is clearly displayed, and (2) non-progression, where cyclic reasoning in the reduction process may be terminated (thus allowing for the algorithm to look elsewhere). Finally, we experimentally compare our model counter with two recent works on model counting of similar constraints, SMC [18] and ABC [5], to demonstrate its superior performance.},
  author       = {Trinh, Minh and Chu, Duc Hiep and Jaffar, Joxan},
  editor       = {Majumdar, Rupak and Kunčak, Viktor},
  issn         = {03029743},
  location     = {Heidelberg, Germany},
  pages        = {399 -- 418},
  publisher    = {Springer},
  title        = {{Model counting for recursively-defined strings}},
  doi          = {10.1007/978-3-319-63390-9_21},
  volume       = {10427},
  year         = {2017},
}

@inproceedings{963,
  abstract     = {Network games are widely used as a model for selfish resource-allocation problems. In the classical model, each player selects a path connecting her source and target vertex. The cost of traversing an edge depends on the number of players that traverse it. Thus, it abstracts the fact that different users may use a resource at different times and for different durations, which plays an important role in defining the costs of the users in reality. For example, when transmitting packets in a communication network, routing traffic in a road network, or processing a task in a production system, the traversal of the network involves an inherent delay, and so sharing and congestion of resources crucially depends on time. We study timed network games , which add a time component to network games. Each vertex v in the network is associated with a cost function, mapping the load on v to the price that a player pays for staying in v for one time unit with this load. In addition, each edge has a guard, describing time intervals in which the edge can be traversed, forcing the players to spend time on vertices. Unlike earlier work that add a time component to network games, the time in our model is continuous and cannot be discretized. In particular, players have uncountably many strategies, and a game may have uncountably many pure Nash equilibria. We study properties of timed network games with cost-sharing or congestion cost functions: their stability, equilibrium inefficiency, and complexity. In particular, we show that the answer to the question whether we can restrict attention to boundary strategies, namely ones in which edges are traversed only at the boundaries of guards, is mixed. },
  author       = {Avni, Guy and Guha, Shibashis and Kupferman, Orna},
  issn         = {18688969},
  location     = {Aalborg, Denmark},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  title        = {{Timed network games with clocks}},
  doi          = {10.4230/LIPIcs.MFCS.2017.37},
  volume       = {83},
  year         = {2017},
}

@article{9660,
  abstract     = {In this paper we discuss how the information contained in atomistic simulations of homogeneous nucleation should be used when fitting the parameters in macroscopic nucleation models. We show how the number of solid and liquid atoms in such simulations can be determined unambiguously by using a Gibbs dividing surface and how the free energy as a function of the number of solid atoms in the nucleus can thus be extracted. We then show that the parameters (the chemical potential, the interfacial free energy, and a Tolman correction) of a model based on classical nucleation theory can be fitted using the information contained in these free-energy profiles but that the parameters in such models are highly correlated. This correlation is unfortunate as it ensures that small errors in the computed free energy surface can give rise to large errors in the extrapolated properties of the fitted model. To resolve this problem we thus propose a method for fitting macroscopic nucleation models that uses simulations of planar interfaces and simulations of three-dimensional nuclei in tandem. We show that when the chemical potentials and the interface energy are pinned to their planar-interface values, more precise estimates for the Tolman length are obtained. Extrapolating the free energy profile obtained from small simulation boxes to larger nuclei is thus more reliable.},
  author       = {Cheng, Bingqing and Tribello, Gareth A. and Ceriotti, Michele},
  issn         = {1089-7690},
  journal      = {The Journal of Chemical Physics},
  number       = {10},
  publisher    = {AIP Publishing},
  title        = {{The Gibbs free energy of homogeneous nucleation: From atomistic nuclei to the planar limit}},
  doi          = {10.1063/1.4997180},
  volume       = {147},
  year         = {2017},
}

@article{9661,
  abstract     = {Macroscopic theories of nucleation such as classical nucleation theory envision that clusters of the bulk stable phase form inside the bulk metastable phase. Molecular dynamics simulations are often used to elucidate nucleation mechanisms, by capturing the microscopic configurations of all the atoms. In this paper, we introduce a thermodynamic model that links macroscopic theories and atomic-scale simulations and thus provide a simple and elegant framework for testing the limits of classical nucleation theory.},
  author       = {Cheng, Bingqing and Ceriotti, Michele},
  issn         = {1089-7690},
  journal      = {The Journal of Chemical Physics},
  number       = {3},
  publisher    = {AIP Publishing},
  title        = {{Bridging the gap between atomistic and macroscopic models of homogeneous nucleation}},
  doi          = {10.1063/1.4973883},
  volume       = {146},
  year         = {2017},
}

@inproceedings{1000,
  abstract     = {We study probabilistic models of natural images and extend the autoregressive family of PixelCNN models by incorporating latent variables. Subsequently, we describe two new generative image models that exploit different image transformations as latent variables: a quantized grayscale view of the image or a multi-resolution image pyramid. The proposed models tackle two known shortcomings of existing PixelCNN models: 1) their tendency to focus on low-level image details, while largely ignoring high-level image information, such as object shapes, and 2) their computationally costly procedure for image sampling. We experimentally demonstrate benefits of our LatentPixelCNN models, in particular showing that they produce much more realistically looking image samples than previous state-of-the-art probabilistic models. },
  author       = {Kolesnikov, Alexander and Lampert, Christoph},
  booktitle    = {34th International Conference on Machine Learning},
  isbn         = {978-151085514-4},
  location     = {Sydney, Australia},
  pages        = {1905 -- 1914},
  publisher    = {JMLR},
  title        = {{PixelCNN models with auxiliary variables for natural image modeling}},
  volume       = {70},
  year         = {2017},
}

