@article{9687,
  abstract     = {The Gibbs free energy is the fundamental thermodynamic potential underlying the relative stability of different states of matter under constant-pressure conditions. However, computing this quantity from atomic-scale simulations is far from trivial, so the potential energy of a system is often used as a proxy. In this paper, we use a combination of thermodynamic integration methods to accurately evaluate the Gibbs free energies associated with defects in crystals, including the vacancy formation energy in bcc iron, and the stacking fault energy in fcc nickel, iron, and cobalt. We quantify the importance of entropic and anharmonic effects in determining the free energies of defects at high temperatures, and show that the potential energy approximation as well as the harmonic approximation may produce inaccurate or even qualitatively wrong results. Our calculations manifest the necessity to employ accurate free energy methods such as thermodynamic integration to estimate the stability of crystallographic defects at high temperatures.},
  author       = {Cheng, Bingqing and Ceriotti, Michele},
  issn         = {2469-9969},
  journal      = {Physical Review B},
  number       = {5},
  publisher    = {American Physical Society},
  title        = {{Computing the absolute Gibbs free energy in atomistic simulations: Applications to defects in solids}},
  doi          = {10.1103/physrevb.97.054102},
  volume       = {97},
  year         = {2018},
}

@phdthesis{10,
  abstract     = {Genomic imprinting is an epigenetic process that leads to parent of origin-specific gene expression in a subset of genes. Imprinted genes are essential for brain development, and deregulation of imprinting is associated with neurodevelopmental diseases and the pathogenesis of psychiatric disorders. However, the cell-type specificity of imprinting at single cell resolution, and how imprinting and thus gene dosage regulates neuronal circuit assembly is still largely unknown. Here, MADM (Mosaic Analysis with Double Markers) technology was employed to assess genomic imprinting at single cell level. By visualizing MADM-induced uniparental disomies (UPDs) in distinct colors at single cell level in genetic mosaic animals, this experimental paradigm provides a unique quantitative platform to systematically assay the UPD-mediated imbalances in imprinted gene expression at unprecedented resolution. An experimental pipeline based on FACS, RNA-seq and bioinformatics analysis was established and applied to systematically map cell-type-specific ‘imprintomes’ in the mouse brain. The results revealed that parental-specific expression of imprinted genes per se is rarely cell-type-specific even at the individual cell level. Conversely, when we extended the comparison to downstream responses resulting from imbalanced imprinted gene expression, we discovered an unexpectedly high degree of cell-type specificity. Furthermore, we determined a novel function of genomic imprinting in cortical astrocyte production and in olfactory bulb (OB) granule cell generation. These results suggest important functional implication of genomic imprinting for generating cell-type diversity in the brain. In addition, MADM provides a powerful tool to study candidate genes by concomitant genetic manipulation and fluorescent labelling of single cells. MADM-based candidate gene approach was utilized to identify potential imprinted genes involved in the generation of cortical astrocytes and OB granule cells. We investigated p57Kip2, a maternally expressed gene and known cell cycle regulator. Although we found that p57Kip2 does not play a role in these processes, we detected an unexpected function of the paternal allele previously thought to be silent. Finally, we took advantage of a key property of MADM which is to allow unambiguous investigation of environmental impact on single cells. The experimental pipeline based on FACS and RNA-seq analysis of MADM-labeled cells was established to probe the functional differences of single cell loss of gene function compared to global loss of function on a transcriptional level. With this method, both common and distinct responses were isolated due to cell-autonomous and non-autonomous effects acting on genotypically identical cells. As a result, transcriptional changes were identified which result solely from the surrounding environment. Using the MADM technology to study genomic imprinting at single cell resolution, we have identified cell-type-specific gene expression, novel gene function and the impact of environment on single cell transcriptomes. Together, these provide important insights to the understanding of mechanisms regulating cell-type specificity and thus diversity in the brain.},
  author       = {Laukoter, Susanne},
  issn         = {2663-337X},
  pages        = {1 -- 139},
  publisher    = {Institute of Science and Technology Austria},
  title        = {{Role of genomic imprinting in cerebral cortex development}},
  doi          = {10.15479/AT:ISTA:th1057},
  year         = {2018},
}

@article{1012,
  abstract     = {We prove a new central limit theorem (CLT) for the difference of linear eigenvalue statistics of a Wigner random matrix H and its minor H and find that the fluctuation is much smaller than the fluctuations of the individual linear statistics, as a consequence of the strong correlation between the eigenvalues of H and H. In particular, our theorem identifies the fluctuation of Kerov's rectangular Young diagrams, defined by the interlacing eigenvalues ofH and H, around their asymptotic shape, the Vershik'Kerov'Logan'Shepp curve. Young diagrams equipped with the Plancherel measure follow the same limiting shape. For this, algebraically motivated, ensemble a CLT has been obtained in Ivanov and Olshanski [20] which is structurally similar to our result but the variance is different, indicating that the analogy between the two models has its limitations. Moreover, our theorem shows that Borodin's result [7] on the convergence of the spectral distribution of Wigner matrices to a Gaussian free field also holds in derivative sense.},
  author       = {Erdös, László and Schröder, Dominik J},
  issn         = {10737928},
  journal      = {International Mathematics Research Notices},
  number       = {10},
  pages        = {3255--3298},
  publisher    = {Oxford University Press},
  title        = {{Fluctuations of rectangular young diagrams of interlacing wigner eigenvalues}},
  doi          = {10.1093/imrn/rnw330},
  volume       = {2018},
  year         = {2018},
}

@article{10286,
  abstract     = {In this paper, we evaluate clock signals generated in ring oscillators and self-timed rings and the way their jitter can be transformed into random numbers. We show that counting the periods of the jittery clock signal produces random numbers of significantly better quality than the methods in which the jittery signal is simply sampled (the case in almost all current methods). Moreover, we use the counter values to characterize and continuously monitor the source of randomness. However, instead of using the widely used statistical variance, we propose to use Allan variance to do so. There are two main advantages: Allan variance is insensitive to low frequency noises such as flicker noise that are known to be autocorrelated and significantly less circuitry is required for its computation than that used to compute commonly used variance. We also show that it is essential to use a differential principle of randomness extraction from the jitter based on the use of two identical oscillators to avoid autocorrelations originating from external and internal global jitter sources and that this fact is valid for both kinds of rings. Last but not least, we propose a method of statistical testing based on high order Markov model to show the reduced dependencies when the proposed randomness extraction is applied.},
  author       = {Allini, Elie Noumon and Skórski, Maciej and Petura, Oto and Bernard, Florent and Laban, Marek and Fischer, Viktor},
  issn         = {2569-2925},
  journal      = {IACR Transactions on Cryptographic Hardware and Embedded Systems},
  number       = {3},
  pages        = {214--242},
  publisher    = {International Association for Cryptologic Research},
  title        = {{Evaluation and monitoring of free running oscillators serving as source of randomness}},
  doi          = {10.13154/tches.v2018.i3.214-242},
  volume       = {2018},
  year         = {2018},
}

@article{10358,
  abstract     = {Probing reaction mechanisms of supramolecular processes in soft and biological matter, such as protein aggregation, is inherently challenging. This is because these processes involve multiple molecular mechanisms that are associated with the rearrangement of large numbers of weak bonds, resulting in complex free energy landscapes with many kinetic barriers. Reaction rate measurements at different temperatures can offer unprecedented insights into the underlying molecular mechanisms. However, to be able to interpret such measurements, a key challenge is to establish which properties of the complex free energy landscapes are probed by the reaction rate. Here, we present a reaction rate theory for supramolecular kinetics based on Kramers theory of diffusive reactions over multiple kinetic barriers. We find that reaction rates for protein aggregation are of the Arrhenius–Eyring type and that the associated activation energies probe only one relevant barrier along the respective free energy landscapes. We apply this advancement to interpret, in experiments and in coarse-grained computer simulations, reaction rates of amyloid aggregation in terms of molecular mechanisms and associated thermodynamic signatures. These results suggest a practical extension of the concept of rate-determining steps for complex supramolecular processes and establish a general platform for probing the underlying energy landscape using kinetic measurements.},
  author       = {Michaels, Thomas C. T. and Liu, Lucie X. and Curk, Samo and Bolhuis, Peter G. and Šarić, Anđela and Knowles, Tuomas P. J.},
  issn         = {1362-3028},
  journal      = {Molecular Physics},
  keywords     = {physical chemistry},
  number       = {21-22},
  pages        = {3055--3065},
  publisher    = {Taylor & Francis},
  title        = {{Reaction rate theory for supramolecular kinetics: application to protein aggregation}},
  doi          = {10.1080/00268976.2018.1474280},
  volume       = {116},
  year         = {2018},
}

@article{10359,
  abstract     = {Biological membranes typically contain a large number of different components dispersed in small concentrations in the main membrane phase, including proteins, sugars, and lipids of varying geometrical properties. Most of these components do not bind the cargo. Here, we show that such “inert” components can be crucial for the precise control of cross-membrane trafficking. Using a statistical mechanics model and molecular dynamics simulations, we demonstrate that the presence of inert membrane components of small isotropic curvatures dramatically influences cargo endocytosis, even if the total spontaneous curvature of such a membrane remains unchanged. Curved lipids, such as cholesterol, as well as asymmetrically included proteins and tethered sugars can, therefore, actively participate in the control of the membrane trafficking of nanoscopic cargo. We find that even a low-level expression of curved inert membrane components can determine the membrane selectivity toward the cargo size and can be used to selectively target membranes of certain compositions. Our results suggest a robust and general method of controlling cargo trafficking by adjusting the membrane composition without needing to alter the concentration of receptors or the average membrane curvature. This study indicates that cells can prepare for any trafficking event by incorporating curved inert components in either of the membrane leaflets.},
  author       = {Curk, Tine and Wirnsberger, Peter and Dobnikar, Jure and Frenkel, Daan and Šarić, Anđela},
  issn         = {1530-6992},
  journal      = {Nano Letters},
  keywords     = {mechanical engineering, condensed matter physics},
  number       = {9},
  pages        = {5350--5356},
  publisher    = {American Chemical Society},
  title        = {{Controlling cargo trafficking in multicomponent membranes}},
  doi          = {10.1021/acs.nanolett.8b00786},
  volume       = {18},
  year         = {2018},
}

@article{104,
  abstract     = {The biotrophic pathogen Ustilago maydis, the causative agent of corn smut disease, infects one of the most important crops worldwide – Zea mays. To successfully colonize its host, U. maydis secretes proteins, known as effectors, that suppress plant defense responses and facilitate the establishment of biotrophy. In this work, we describe the U. maydis effector protein Cce1. Cce1 is essential for virulence and is upregulated during infection. Through microscopic analysis and in vitro assays, we show that Cce1 is secreted from hyphae during filamentous growth of the fungus. Strikingly, Δcce1 mutants are blocked at early stages of infection and induce callose deposition as a plant defense response. Cce1 is highly conserved among smut fungi and the Ustilago bromivora ortholog complemented the virulence defect of the SG200Δcce1 deletion strain. These data indicate that Cce1 is a core effector with apoplastic localization that is essential for U. maydis to infect its host.},
  author       = {Seitner, Denise and Uhse, Simon and Gallei, Michelle C and Djamei, Armin},
  journal      = {Molecular Plant Pathology},
  number       = {10},
  pages        = {2277 -- 2287},
  publisher    = {Wiley},
  title        = {{The core effector Cce1 is required for early infection of maize by Ustilago maydis}},
  doi          = {10.1111/mpp.12698},
  volume       = {19},
  year         = {2018},
}

@article{106,
  abstract     = {The goal of this article is to introduce the reader to the theory of intrinsic geometry of convex surfaces. We illustrate the power of the tools by proving a theorem on convex surfaces containing an arbitrarily long closed simple geodesic. Let us remind ourselves that a curve in a surface is called geodesic if every sufficiently short arc of the curve is length minimizing; if, in addition, it has no self-intersections, we call it simple geodesic. A tetrahedron with equal opposite edges is called isosceles. The axiomatic method of Alexandrov geometry allows us to work with the metrics of convex surfaces directly, without approximating it first by a smooth or polyhedral metric. Such approximations destroy the closed geodesics on the surface; therefore it is difficult (if at all possible) to apply approximations in the proof of our theorem. On the other hand, a proof in the smooth or polyhedral case usually admits a translation into Alexandrov’s language; such translation makes the result more general. In fact, our proof resembles a translation of the proof given by Protasov. Note that the main theorem implies in particular that a smooth convex surface does not have arbitrarily long simple closed geodesics. However we do not know a proof of this corollary that is essentially simpler than the one presented below.},
  author       = {Akopyan, Arseniy and Petrunin, Anton},
  journal      = {Mathematical Intelligencer},
  number       = {3},
  pages        = {26 -- 31},
  publisher    = {Springer},
  title        = {{Long geodesics on convex surfaces}},
  doi          = {10.1007/s00283-018-9795-5},
  volume       = {40},
  year         = {2018},
}

@article{10626,
  abstract     = {Owing to their wide tunability, multiple internal degrees of freedom, and low disorder, graphene heterostructures are emerging as a promising experimental platform for fractional quantum Hall (FQH) studies. Here, we report FQH thermal activation gap measurements in dual graphite-gated monolayer graphene devices fabricated in an edgeless Corbino geometry. In devices with substrate-induced sublattice splitting, we find a tunable crossover between single- and multicomponent FQH states in the zero energy Landau level. Activation gaps in the single-component regime show excellent agreement with numerical calculations using a single broadening parameter 
Γ≈7.2K. In the first excited Landau level, in contrast, FQH gaps are strongly influenced by Landau level mixing, and we observe an unexpected valley-ordered state at integer filling ν=−4.},
  author       = {Polshyn, Hryhoriy and Zhou, H. and Spanton, E. M. and Taniguchi, T. and Watanabe, K. and Young, A. F.},
  issn         = {1079-7114},
  journal      = {Physical Review Letters},
  keywords     = {general physics and astronomy},
  number       = {22},
  publisher    = {American Physical Society},
  title        = {{Quantitative transport measurements of fractional quantum Hall energy gaps in edgeless graphene devices}},
  doi          = {10.1103/physrevlett.121.226801},
  volume       = {121},
  year         = {2018},
}

@article{10627,
  abstract     = {We present a scanning probe technique for measuring the dynamics of individual fluxoid transitions in multiply connected superconducting structures. In these measurements, a small magnetic particle attached to the tip of a silicon cantilever is scanned over a micron-size superconducting ring fabricated from a thin aluminum film. We find that near the superconducting transition temperature of the aluminum, the dissipation and frequency of the cantilever changes significantly at particular locations where the tip-induced magnetic flux penetrating the ring causes the two lowest-energy fluxoid states to become nearly degenerate. In this regime, we show that changes in the cantilever frequency and dissipation are well-described by a stochastic resonance (SR) process, wherein small oscillations of the cantilever in the presence of thermally activated phase slips (TAPS) in the ring give rise to a dynamical force that modifies the mechanical properties of the cantilever. Using the SR model, we calculate the average fluctuation rate of the TAPS as a function of temperature over a 32-dB range in frequency, and we compare it to the Langer-Ambegaokar-McCumber-Halperin theory for TAPS in one-dimensional superconducting structures.},
  author       = {Polshyn, Hryhoriy and Naibert, Tyler R. and Budakian, Raffi},
  issn         = {2469-9969},
  journal      = {Physical Review B},
  number       = {18},
  publisher    = {American Physical Society},
  title        = {{Imaging phase slip dynamics in micron-size superconducting rings}},
  doi          = {10.1103/physrevb.97.184501},
  volume       = {97},
  year         = {2018},
}

@article{1064,
  abstract     = {In 1945, A.W. Goodman and R.E. Goodman proved the following conjecture by P. Erdős: Given a family of (round) disks of radii r1, … , rn in the plane, it is always possible to cover them by a disk of radius R= ∑ ri, provided they cannot be separated into two subfamilies by a straight line disjoint from the disks. In this note we show that essentially the same idea may work for different analogues and generalizations of their result. In particular, we prove the following: Given a family of positive homothetic copies of a fixed convex body K⊂ Rd with homothety coefficients τ1, … , τn> 0 , it is always possible to cover them by a translate of d+12(∑τi)K, provided they cannot be separated into two subfamilies by a hyperplane disjoint from the homothets.},
  author       = {Akopyan, Arseniy and Balitskiy, Alexey and Grigorev, Mikhail},
  issn         = {14320444},
  journal      = {Discrete & Computational Geometry},
  number       = {4},
  pages        = {1001--1009},
  publisher    = {Springer},
  title        = {{On the circle covering theorem by A.W. Goodman and R.E. Goodman}},
  doi          = {10.1007/s00454-017-9883-x},
  volume       = {59},
  year         = {2018},
}

@inproceedings{11827,
  abstract     = {We study the metric facility location problem with client insertions and deletions. This setting differs from the classic dynamic facility location problem, where the set of clients remains the same, but the metric space can change over time. We show a deterministic algorithm that maintains a constant factor approximation to the optimal solution in worst-case time O~(2^{O(kappa^2)}) per client insertion or deletion in metric spaces while answering queries about the cost in O(1) time, where kappa denotes the doubling dimension of the metric. For metric spaces with bounded doubling dimension, the update time is polylogarithmic in the parameters of the problem.},
  author       = {Goranci, Gramoz  and Henzinger, Monika H and Leniowski, Dariusz},
  booktitle    = {26th Annual European Symposium on Algorithms},
  isbn         = {9783959770811},
  issn         = {1868-8969},
  location     = {Helsinki, Finland},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  title        = {{A tree structure for dynamic facility location}},
  doi          = {10.4230/LIPICS.ESA.2018.39},
  volume       = {112},
  year         = {2018},
}

@inproceedings{11828,
  abstract     = {We consider the problem of dynamically maintaining (approximate) all-pairs effective resistances in separable graphs, which are those that admit an n^{c}-separator theorem for some c<1. We give a fully dynamic algorithm that maintains (1+epsilon)-approximations of the all-pairs effective resistances of an n-vertex graph G undergoing edge insertions and deletions with O~(sqrt{n}/epsilon^2) worst-case update time and O~(sqrt{n}/epsilon^2) worst-case query time, if G is guaranteed to be sqrt{n}-separable (i.e., it is taken from a class satisfying a sqrt{n}-separator theorem) and its separator can be computed in O~(n) time. Our algorithm is built upon a dynamic algorithm for maintaining approximate Schur complement that approximately preserves pairwise effective resistances among a set of terminals for separable graphs, which might be of independent interest.
We complement our result by proving that for any two fixed vertices s and t, no incremental or decremental algorithm can maintain the s-t effective resistance for sqrt{n}-separable graphs with worst-case update time O(n^{1/2-delta}) and query time O(n^{1-delta}) for any delta>0, unless the Online Matrix Vector Multiplication (OMv) conjecture is false.
We further show that for general graphs, no incremental or decremental algorithm can maintain the s-t effective resistance problem with worst-case update time O(n^{1-delta}) and query-time O(n^{2-delta}) for any delta >0, unless the OMv conjecture is false.},
  author       = {Goranci, Gramoz and Henzinger, Monika H and Peng, Pan},
  booktitle    = {26th Annual European Symposium on Algorithms},
  isbn         = {9783959770811},
  issn         = {1868-8969},
  location     = {Helsinki, Finland},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  title        = {{Dynamic effective resistances and approximate schur complement on separable graphs}},
  doi          = {10.4230/LIPICS.ESA.2018.40},
  volume       = {112},
  year         = {2018},
}

@inproceedings{11872,
  abstract     = {We design fast dynamic algorithms for proper vertex and edge colorings in a graph undergoing edge insertions and deletions. In the static setting, there are simple linear time algorithms for (Δ + 1)- vertex coloring and (2Δ – 1)-edge coloring in a graph with maximum degree Δ. It is natural to ask if we can efficiently maintain such colorings in the dynamic setting as well. We get the following three results. (1) We present a randomized algorithm which maintains a (Δ + 1)-vertex coloring with O(log Δ) expected amortized update time. (2) We present a deterministic algorithm which maintains a (1 + o(1)Δ-vertex coloring with O(polylog Δ) amortized update time. (3) We present a simple, deterministic algorithm which maintains a (2Δ – 1)-edge coloring with O(log Δ) worst-case update time. This improves the recent O(Δ)-edge coloring algorithm with  worst-case update time [4].},
  author       = {Bhattacharya, Sayan and Chakrabarty, Deeparnab and Henzinger, Monika H and Nanongkai, Danupon},
  booktitle    = {29th Annual ACM-SIAM Symposium on Discrete Algorithms},
  location     = {New Orleans, LA, United States},
  pages        = {1 -- 20},
  publisher    = {Society for Industrial and Applied Mathematics},
  title        = {{Dynamic algorithms for graph coloring}},
  doi          = {10.1137/1.9781611975031.1},
  year         = {2018},
}

@inproceedings{11882,
  abstract     = {The minimum cut problem for an undirected edge-weighted graph asks us to divide its set of nodes into two blocks while minimizing the weight sum of the cut edges. Here, we introduce a linear-time algorithm to compute near-minimum cuts. Our algorithm is based on cluster contraction using label propagation and Padberg and Rinaldi's contraction heuristics [SIAM Review, 1991]. We give both sequential and shared-memory parallel implementations of our algorithm. Extensive experiments on both real-world and generated instances show that our algorithm finds the optimal cut on nearly all instances significantly faster than other state-of-the-art exact algorithms, and our error rate is lower than that of other heuristic algorithms. In addition, our parallel algorithm shows good scalability.},
  author       = {Henzinger, Monika H and Noe, Alexander and Schulz, Christian and Strash, Darren},
  booktitle    = {20th Workshop on Algorithm Engineering and Experiments},
  location     = {New Orleans, LA, United States},
  pages        = {48--61},
  publisher    = {Society for Industrial and Applied Mathematics},
  title        = {{Practical minimum cut algorithms}},
  doi          = {10.1137/1.9781611975055.5},
  year         = {2018},
}

@article{11890,
  abstract     = {We present the first deterministic data structures for maintaining approximate minimum vertex cover and maximum matching in a fully dynamic graph 𝐺=(𝑉,𝐸), with |𝑉|=𝑛 and |𝐸|=𝑚, in 𝑜(𝑚‾‾√) time per update. In particular, for minimum vertex cover, we provide deterministic data structures for maintaining a (2+𝜖) approximation in 𝑂(log𝑛/𝜖2) amortized time per update. For maximum matching, we show how to maintain a (3+𝜖) approximation in 𝑂(min(𝑛√/𝜖,𝑚1/3/𝜖2) amortized time per update and a (4+𝜖) approximation in 𝑂(𝑚1/3/𝜖2) worst-case time per update. Our data structure for fully dynamic minimum vertex cover is essentially near-optimal and settles an open problem by Onak and Rubinfeld [in 42nd ACM Symposium on Theory of Computing, Cambridge, MA, ACM, 2010, pp. 457--464].},
  author       = {Bhattacharya, Sayan and Henzinger, Monika H and Italiano, Giuseppe F.},
  issn         = {1095-7111},
  journal      = {SIAM Journal on Computing},
  number       = {3},
  pages        = {859--887},
  publisher    = {Society for Industrial & Applied Mathematics},
  title        = {{Deterministic fully dynamic data structures for vertex cover and matching}},
  doi          = {10.1137/140998925},
  volume       = {47},
  year         = {2018},
}

@inproceedings{11911,
  abstract     = {It is common knowledge that there is no single best strategy for graph clustering, which justifies a plethora of existing approaches. In this paper, we present a general memetic algorithm, VieClus, to tackle the graph clustering problem. This algorithm can be adapted to optimize different objective functions. A key component of our contribution are natural recombine operators that employ ensemble clusterings as well as multi-level techniques. Lastly, we combine these techniques with a scalable communication protocol, producing a system that is able to compute high-quality solutions in a short amount of time. We instantiate our scheme with local search for modularity and show that our algorithm successfully improves or reproduces all entries of the 10th DIMACS implementation challenge under consideration using a small amount of time.},
  author       = {Biedermann, Sonja and Henzinger, Monika H and Schulz, Christian and Schuster, Bernhard},
  booktitle    = {17th International Symposium on Experimental Algorithms},
  isbn         = {9783959770705},
  issn         = {1868-8969},
  location     = {L'Aquila, Italy},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  title        = {{Memetic graph clustering}},
  doi          = {10.4230/LIPICS.SEA.2018.3},
  volume       = {103},
  year         = {2018},
}

@article{12,
  abstract     = {Molding is a popular mass production method, in which the initial expenses for the mold are offset by the low per-unit production cost. However, the physical fabrication constraints of the molding technique commonly restrict the shape of moldable objects. For a complex shape, a decomposition of the object into moldable parts is a common strategy to address these constraints, with plastic model kits being a popular and illustrative example. However, conducting such a decomposition requires considerable expertise, and it depends on the technical aspects of the fabrication technique, as well as aesthetic considerations. We present an interactive technique to create such decompositions for two-piece molding, in which each part of the object is cast between two rigid mold pieces. Given the surface description of an object, we decompose its thin-shell equivalent into moldable parts by first performing a coarse decomposition and then utilizing an active contour model for the boundaries between individual parts. Formulated as an optimization problem, the movement of the contours is guided by an energy reflecting fabrication constraints to ensure the moldability of each part. Simultaneously, the user is provided with editing capabilities to enforce aesthetic guidelines. Our interactive interface provides control of the contour positions by allowing, for example, the alignment of part boundaries with object features. Our technique enables a novel workflow, as it empowers novice users to explore the design space, and it generates fabrication-ready two-piece molds that can be used either for casting or industrial injection molding of free-form objects.},
  author       = {Nakashima, Kazutaka and Auzinger, Thomas and Iarussi, Emmanuel and Zhang, Ran and Igarashi, Takeo and Bickel, Bernd},
  journal      = {ACM Transaction on Graphics},
  number       = {4},
  publisher    = {ACM},
  title        = {{CoreCavity: Interactive shell decomposition for fabrication with two-piece rigid molds}},
  doi          = {10.1145/3197517.3201341},
  volume       = {37},
  year         = {2018},
}

@article{1215,
  abstract     = {Two generalizations of Itô formula to infinite-dimensional spaces are given.
The first one, in Hilbert spaces, extends the classical one by taking advantage of
cancellations when they occur in examples and it is applied to the case of a group
generator. The second one, based on the previous one and a limit procedure, is an Itô
formula in a special class of Banach spaces having a product structure with the noise
in a Hilbert component; again the key point is the extension due to a cancellation. This
extension to Banach spaces and in particular the specific cancellation are motivated
by path-dependent Itô calculus.},
  author       = {Flandoli, Franco and Russo, Francesco and Zanco, Giovanni A},
  journal      = {Journal of Theoretical Probability},
  number       = {2},
  pages        = {789--826},
  publisher    = {Springer},
  title        = {{Infinite-dimensional calculus under weak spatial regularity of the processes}},
  doi          = {10.1007/s10959-016-0724-2},
  volume       = {31},
  year         = {2018},
}

@article{12603,
  abstract     = {We present a field-data rich modelling analysis to reconstruct the climatic forcing, glacier response, and runoff generation from a high-elevation catchment in central Chile over the period 2000–2015 to provide insights into the differing contributions of debris-covered and debris-free glaciers under current and future changing climatic conditions. Model simulations with the physically based glacio-hydrological model TOPKAPI-ETH reveal a period of neutral or slightly positive mass balance between 2000 and 2010, followed by a transition to increasingly large annual mass losses, associated with a recent mega drought. Mass losses commence earlier, and are more severe, for a heavily debris-covered glacier, most likely due to its strong dependence on snow avalanche accumulation, which has declined in recent years. Catchment runoff shows a marked decreasing trend over the study period, but with high interannual variability directly linked to winter snow accumulation, and high contribution from ice melt in dry periods and drought conditions. The study demonstrates the importance of incorporating local-scale processes such as snow avalanche accumulation and spatially variable debris thickness, in understanding the responses of different glacier types to climate change. We highlight the increased dependency of runoff from high Andean catchments on the diminishing resource of glacier ice during dry years.},
  author       = {Burger, Flavia and Ayala, Alvaro and Farias, David and Shaw, Thomas E. and MacDonell, Shelley and Brock, Ben and McPhee, James and Pellicciotti, Francesca},
  issn         = {1099-1085},
  journal      = {Hydrological Processes},
  keywords     = {Water Science and Technology},
  number       = {2},
  pages        = {214--229},
  publisher    = {Wiley},
  title        = {{Interannual variability in glacier contribution to runoff from a high‐elevation Andean catchment: Understanding the role of debris cover in glacier hydrology}},
  doi          = {10.1002/hyp.13354},
  volume       = {33},
  year         = {2018},
}