@unpublished{9435, abstract = {For any given positive integer l, we prove that every plane deformation of a circlewhich preserves the 1/2and 1/ (2l + 1) -rational caustics is trivial i.e. the deformationconsists only of similarities (rescalings and isometries).}, author = {Kaloshin, Vadim and Koudjinan, Edmond}, title = {{Non co-preservation of the 1/2 and 1/(2l+1)-rational caustics along deformations of circles}}, year = {2021}, } @inproceedings{9604, abstract = {Generalizing Lee’s inductive argument for counting the cells of higher order Voronoi tessellations in ℝ² to ℝ³, we get precise relations in terms of Morse theoretic quantities for piecewise constant functions on planar arrangements. Specifically, we prove that for a generic set of n ≥ 5 points in ℝ³, the number of regions in the order-k Voronoi tessellation is N_{k-1} - binom(k,2)n + n, for 1 ≤ k ≤ n-1, in which N_{k-1} is the sum of Euler characteristics of these function’s first k-1 sublevel sets. We get similar expressions for the vertices, edges, and polygons of the order-k Voronoi tessellation.}, author = {Biswas, Ranita and Cultrera di Montesano, Sebastiano and Edelsbrunner, Herbert and Saghafian, Morteza}, booktitle = {Leibniz International Proceedings in Informatics}, isbn = {9783959771849}, issn = {18688969}, location = {Online}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Counting cells of order-k voronoi tessellations in ℝ3 with morse theory}}, doi = {10.4230/LIPIcs.SoCG.2021.16}, volume = {189}, year = {2021}, } @inproceedings{9620, abstract = {In this note, we introduce a distributed twist on the classic coupon collector problem: a set of m collectors wish to each obtain a set of n coupons; for this, they can each sample coupons uniformly at random, but can also meet in pairwise interactions, during which they can exchange coupons. By doing so, they hope to reduce the number of coupons that must be sampled by each collector in order to obtain a full set. This extension is natural when considering real-world manifestations of the coupon collector phenomenon, and has been remarked upon and studied empirically (Hayes and Hannigan 2006, Ahmad et al. 2014, Delmarcelle 2019). We provide the first theoretical analysis for such a scenario. We find that “coupon collecting with friends” can indeed significantly reduce the number of coupons each collector must sample, and raises interesting connections to the more traditional variants of the problem. While our analysis is in most cases asymptotically tight, there are several open questions raised, regarding finer-grained analysis of both “coupon collecting with friends,” and of a long-studied variant of the original problem in which a collector requires multiple full sets of coupons.}, author = {Alistarh, Dan-Adrian and Davies, Peter}, booktitle = {Structural Information and Communication Complexity}, isbn = {9783030795269}, issn = {1611-3349}, location = {Wrocław, Poland}, pages = {3--12}, publisher = {Springer Nature}, title = {{Collecting coupons is faster with friends}}, doi = {10.1007/978-3-030-79527-6_1}, volume = {12810}, year = {2021}, } @inproceedings{9826, abstract = {Automated contract tracing aims at supporting manual contact tracing during pandemics by alerting users of encounters with infected people. There are currently many proposals for protocols (like the “decentralized” DP-3T and PACT or the “centralized” ROBERT and DESIRE) to be run on mobile phones, where the basic idea is to regularly broadcast (using low energy Bluetooth) some values, and at the same time store (a function of) incoming messages broadcasted by users in their proximity. In the existing proposals one can trigger false positives on a massive scale by an “inverse-Sybil” attack, where a large number of devices (malicious users or hacked phones) pretend to be the same user, such that later, just a single person needs to be diagnosed (and allowed to upload) to trigger an alert for all users who were in proximity to any of this large group of devices. We propose the first protocols that do not succumb to such attacks assuming the devices involved in the attack do not constantly communicate, which we observe is a necessary assumption. The high level idea of the protocols is to derive the values to be broadcasted by a hash chain, so that two (or more) devices who want to launch an inverse-Sybil attack will not be able to connect their respective chains and thus only one of them will be able to upload. Our protocols also achieve security against replay, belated replay, and one of them even against relay attacks.}, author = {Auerbach, Benedikt and Chakraborty, Suvradip and Klein, Karen and Pascual Perez, Guillermo and Pietrzak, Krzysztof Z and Walter, Michael and Yeo, Michelle X}, booktitle = {Topics in Cryptology – CT-RSA 2021}, isbn = {9783030755386}, issn = {16113349}, location = {Virtual Event}, pages = {399--421}, publisher = {Springer Nature}, title = {{Inverse-Sybil attacks in automated contact tracing}}, doi = {10.1007/978-3-030-75539-3_17}, volume = {12704}, year = {2021}, } @inproceedings{9825, abstract = {The dual attack has long been considered a relevant attack on lattice-based cryptographic schemes relying on the hardness of learning with errors (LWE) and its structured variants. As solving LWE corresponds to finding a nearest point on a lattice, one may naturally wonder how efficient this dual approach is for solving more general closest vector problems, such as the classical closest vector problem (CVP), the variants bounded distance decoding (BDD) and approximate CVP, and preprocessing versions of these problems. While primal, sieving-based solutions to these problems (with preprocessing) were recently studied in a series of works on approximate Voronoi cells [Laa16b, DLdW19, Laa20, DLvW20], for the dual attack no such overview exists, especially for problems with preprocessing. With one of the take-away messages of the approximate Voronoi cell line of work being that primal attacks work well for approximate CVP(P) but scale poorly for BDD(P), one may further wonder if the dual attack suffers the same drawbacks, or if it is perhaps a better solution when trying to solve BDD(P). In this work we provide an overview of cost estimates for dual algorithms for solving these “classical” closest lattice vector problems. Heuristically we expect to solve the search version of average-case CVPP in time and space 20.293𝑑+𝑜(𝑑) in the single-target model. The distinguishing version of average-case CVPP, where we wish to distinguish between random targets and targets planted at distance (say) 0.99⋅𝑔𝑑 from the lattice, has the same complexity in the single-target model, but can be solved in time and space 20.195𝑑+𝑜(𝑑) in the multi-target setting, when given a large number of targets from either target distribution. This suggests an inequivalence between distinguishing and searching, as we do not expect a similar improvement in the multi-target setting to hold for search-CVPP. We analyze three slightly different decoders, both for distinguishing and searching, and experimentally obtain concrete cost estimates for the dual attack in dimensions 50 to 80, which confirm our heuristic assumptions, and show that the hidden order terms in the asymptotic estimates are quite small. Our main take-away message is that the dual attack appears to mirror the approximate Voronoi cell line of work – whereas using approximate Voronoi cells works well for approximate CVP(P) but scales poorly for BDD(P), the dual approach scales well for BDD(P) instances but performs poorly on approximate CVP(P).}, author = {Laarhoven, Thijs and Walter, Michael}, booktitle = {Topics in Cryptology – CT-RSA 2021}, isbn = {9783030755386}, issn = {16113349}, location = {Virtual Event}, pages = {478--502}, publisher = {Springer Nature}, title = {{Dual lattice attacks for closest vector problems (with preprocessing)}}, doi = {10.1007/978-3-030-75539-3_20}, volume = {12704}, year = {2021}, } @inproceedings{9823, abstract = {Approximate agreement is one of the few variants of consensus that can be solved in a wait-free manner in asynchronous systems where processes communicate by reading and writing to shared memory. In this work, we consider a natural generalisation of approximate agreement on arbitrary undirected connected graphs. Each process is given a vertex of the graph as input and, if non-faulty, must output a vertex such that all the outputs are within distance 1 of one another, and each output value lies on a shortest path between two input values. From prior work, it is known that there is no wait-free algorithm among 𝑛≥3 processes for this problem on any cycle of length 𝑐≥4 , by reduction from 2-set agreement (Castañeda et al. 2018). In this work, we investigate the solvability and complexity of this task on general graphs. We give a new, direct proof of the impossibility of approximate agreement on cycles of length 𝑐≥4 , via a generalisation of Sperner’s Lemma to convex polygons. We also extend the reduction from 2-set agreement to a larger class of graphs, showing that approximate agreement on these graphs is unsolvable. On the positive side, we present a wait-free algorithm for a class of graphs that properly contains the class of chordal graphs.}, author = {Alistarh, Dan-Adrian and Ellen, Faith and Rybicki, Joel}, booktitle = {Structural Information and Communication Complexity}, isbn = {9783030795269}, issn = {16113349}, location = {Wrocław, Poland}, pages = {87--105}, publisher = {Springer Nature}, title = {{Wait-free approximate agreement on graphs}}, doi = {10.1007/978-3-030-79527-6_6}, volume = {12810}, year = {2021}, } @inproceedings{9824, abstract = {We define a new compact coordinate system in which each integer triplet addresses a voxel in the BCC grid, and we investigate some of its properties. We propose a characterization of 3D discrete analytical planes with their topological features (in the Cartesian and in the new coordinate system) such as the interrelation between the thickness of the plane and the separability constraint we aim to obtain.}, author = {Čomić, Lidija and Zrour, Rita and Largeteau-Skapin, Gaëlle and Biswas, Ranita and Andres, Eric}, booktitle = {Discrete Geometry and Mathematical Morphology}, isbn = {9783030766566}, issn = {16113349}, location = {Uppsala, Sweden}, pages = {152--163}, publisher = {Springer Nature}, title = {{Body centered cubic grid - coordinate system and discrete analytical plane definition}}, doi = {10.1007/978-3-030-76657-3_10}, volume = {12708}, year = {2021}, } @unpublished{9980, abstract = {Insufficient understanding of the mechanism that reversibly converts sulphur into lithium sulphide (Li2S) via soluble polysulphides (PS) hampers the realization of high performance lithium-sulphur cells. Typically Li2S formation is explained by direct electroreduction of a PS to Li2S; however, this is not consistent with the size of the insulating Li2S deposits. Here, we use in situ small and wide angle X-ray scattering (SAXS/WAXS) to track the growth and dissolution of crystalline and amorphous deposits from atomic to sub-micron scales during charge and discharge. Stochastic modelling based on the SAXS data allows quantification of the chemical phase evolution during discharge and charge. We show that Li2S deposits predominantly via disproportionation of transient, solid Li2S2 to form primary Li2S crystallites and solid Li2S4 particles. We further demonstrate that this process happens in reverse during charge. These findings show that the discharge capacity and rate capability in Li-S battery cathodes are therefore limited by mass transport through the increasingly tortuous network of Li2S / Li2S4 / carbon pores rather than electron transport through a passivating surface film.}, author = {Prehal, Christian and Talian, Sara Drvarič and Vizintin, Alen and Amenitsch, Heinz and Dominko, Robert and Freunberger, Stefan Alexander and Wood, Vanessa}, booktitle = {Research Square}, keywords = {Li2S, Lithium Sulphur Batteries, SAXS, WAXS}, pages = {21}, title = {{Mechanism of Li2S formation and dissolution in Lithium-Sulphur batteries}}, doi = {10.21203/rs.3.rs-818607/v1}, year = {2021}, } @article{12584, abstract = {This project explored the integrated use of satellite, ground observations and hydrological distributed models to support water resources assessment and monitoring in High Mountain Asia (HMA). Hydrological data products were generated taking advantage of the synergies of European and Chinese data assets and space-borne observation systems. Energy-budget-based glacier mass balance and hydrological models driven by satellite observations were developed. These models can be applied to describe glacier-melt contribution to river flow. Satellite hydrological data products were used for forcing, calibration, validation and data assimilation in distributed river basin models. A pilot study was carried out on the Red River basin. Multiple hydrological data products were generated using the data collected by Chinese satellites. A new Evapo-Transpiration (ET) dataset from 2000 to 2018 was generated, including plant transpiration, soil evaporation, rainfall interception loss, snow/ice sublimation and open water evaporation. Higher resolution data were used to characterize glaciers and their response to environmental forcing. These studies focused on the Parlung Zangbo Basin, where glacier facies were mapped with GaoFeng (GF), Sentinal-2/Multi-Spectral Imager (S2/MSI) and Landsat8/Operational Land Imager (L8/OLI) data. The geodetic mass balance was estimated between 2000 and 2017 with Zi-Yuan (ZY)-3 Stereo Images and the SRTM DEM. Surface velocity was studied with Landsat5/Thematic Mapper (L5/TM), L8/OLI and S2/MSI data over the period 2013–2019. An updated method was developed to improve the retrieval of glacier albedo by correcting glacier reflectance for anisotropy, and a new dataset on glacier albedo was generated for the period 2001–2020. A detailed glacier energy and mass balance model was developed with the support of field experiments at the Parlung No. 4 Glacier and the 24 K Glacier, both in the Tibetan Plateau. Besides meteorological measurements, the field experiments included glaciological and hydrological measurements. The energy balance model was formulated in terms of enthalpy for easier treatment of water phase transitions. The model was applied to assess the spatial variability in glacier melt. In the Parlung No. 4 Glacier, the accumulated glacier melt was between 1.5 and 2.5 m w.e. in the accumulation zone and between 4.5 and 6.0 m w.e. in the ablation zone, reaching 6.5 m w.e. at the terminus. The seasonality in the glacier mass balance was observed by combining intensive field campaigns with continuous automatic observations. The linkage of the glacier and snowpack mass balance with water resources in a river basin was analyzed in the Chiese (Italy) and Heihe (China) basins by developing and applying integrated hydrological models using satellite retrievals in multiple ways. The model FEST-WEB was calibrated using retrievals of Land Surface Temperature (LST) to map soil hydrological properties. A watershed model was developed by coupling ecohydrological and socioeconomic systems. Integrated modeling is supported by an updated and parallelized data assimilation system. The latter exploits retrievals of brightness temperature (Advanced Microwave Scanning Radiometer, AMSR), LST (Moderate Resolution Imaging Spectroradiometer, MODIS), precipitation (Tropical Rainfall Measuring Mission (TRMM) and FengYun (FY)-2D) and in-situ measurements. In the case study on the Red River Basin, a new algorithm has been applied to disaggregate the SMOS (Soil Moisture and Ocean Salinity) soil moisture retrievals by making use of the correlation between evaporative fraction and soil moisture.}, author = {Menenti, Massimo and Li, Xin and Jia, Li and Yang, Kun and Pellicciotti, Francesca and Mancini, Marco and Shi, Jiancheng and Escorihuela, Maria José and Zheng, Chaolei and Chen, Qiting and Lu, Jing and Zhou, Jie and Hu, Guangcheng and Ren, Shaoting and Zhang, Jing and Liu, Qinhuo and Qiu, Yubao and Huang, Chunlin and Zhou, Ji and Han, Xujun and Pan, Xiaoduo and Li, Hongyi and Wu, Yerong and Ding, Baohong and Yang, Wei and Buri, Pascal and McCarthy, Michael J. and Miles, Evan S. and Shaw, Thomas E. and Ma, Chunfeng and Zhou, Yanzhao and Corbari, Chiara and Li, Rui and Zhao, Tianjie and Stefan, Vivien and Gao, Qi and Zhang, Jingxiao and Xie, Qiuxia and Wang, Ning and Sun, Yibo and Mo, Xinyu and Jia, Junru and Jouberton, Achille Pierre and Kneib, Marin and Fugger, Stefan and Paciolla, Nicola and Paolini, Giovanni}, issn = {2072-4292}, journal = {Remote Sensing}, keywords = {General Earth and Planetary Sciences}, number = {24}, publisher = {MDPI}, title = {{Multi-source hydrological data products to monitor High Asian river basins and regional water security}}, doi = {10.3390/rs13245122}, volume = {13}, year = {2021}, } @article{12590, abstract = {Ice cliffs play a key role in the mass balance of debris-covered glaciers, but assessing their importance is limited by a lack of datasets on their distribution and evolution at scales larger than an individual glacier. These datasets are often derived using operator-biased and time-consuming manual delineation approaches, despite the recent emergence of semi-automatic mapping methods. These methods have used elevation or multispectral data, but the varying slope and mixed spectral signal of these dynamic features makes the transferability of these approaches particularly challenging. We develop three semi-automated and objective new approaches, based on the Spectral Curvature and Linear Spectral Unmixing of multispectral images, to map these features at a glacier to regional scale. The transferability of each method is assessed by applying it to three sites in the Himalaya, where debris-covered glaciers are widespread, with varying lithologic, glaciological and climatic settings, and encompassing different periods of the melt season. We develop the new methods keeping in mind the wide range of remote sensing platforms currently in use, and focus in particular on two products: we apply the three approaches at each site to near-contemporaneous atmospherically-corrected Pléiades (2 m resolution) and Sentinel-2 (10 m resolution) images and assess the effects of spatial and spectral resolution on the results. We find that the Spectral Curvature method works best for the high spatial resolution, four band Pléaides images, while a modification of the Linear Spectral Unmixing using the scaling factor of the unmixing is best for the coarser spatial resolution, but additional spectral information of Sentinel-2 products. In both cases ice cliffs are mapped with a Dice coefficient higher than 0.48. Comparison of the Pléiades results with other existing methods shows that the Spectral Curvature approach performs better and is more robust than any other existing automated or semi-automated approaches. Both methods outline a high number of small, sometimes shallow-sloping and thinly debris-covered ice patches that differ from our traditional understanding of cliffs but may have non-negligible impact on the mass balance of debris-covered glaciers. Overall these results pave the way for large scale efforts of ice cliff mapping that can enable inclusion of these features in debris-covered glacier melt models, as well as allow the generation of multiple datasets to study processes of cliff formation, evolution and decline.}, author = {Kneib, M. and Miles, E.S. and Jola, S. and Buri, P. and Herreid, S. and Bhattacharya, A. and Watson, C.S. and Bolch, T. and Quincey, D. and Pellicciotti, Francesca}, issn = {0034-4257}, journal = {Remote Sensing of Environment}, keywords = {Computers in Earth Sciences, Geology, Soil Science}, number = {2}, publisher = {Elsevier}, title = {{Mapping ice cliffs on debris-covered glaciers using multispectral satellite images}}, doi = {10.1016/j.rse.2020.112201}, volume = {253}, year = {2021}, } @article{12591, abstract = {Glacier albedo determines the net shortwave radiation absorbed at the glacier surface and plays a crucial role in glacier energy and mass balance. Remote sensing techniques are efficient means to retrieve glacier surface albedo over large and inaccessible areas and to study its variability. However, corrections of anisotropic reflectance of glacier surface have been established for specific shortwave bands only, such as Landsat 5 Thematic Mapper (L5/TM) band 2 and band 4, which is a major limitation of current retrievals of glacier broadband albedo. In this study, we calibrated and evaluated four anisotropy correction models for glacier snow and ice, applicable to visible, near-infrared and shortwave-infrared wavelengths using airborne datasets of Bidirectional Reflectance Distribution Function (BRDF). We then tested the ability of the best-performing anisotropy correction model, referred to from here on as the ‘updated model’, to retrieve albedo from L5/TM, Landsat 8 Operational Land Imager (L8/OLI) and Moderate Resolution Imaging Spectroradiometer (MODIS) imagery, and evaluated these results with field measurements collected on eight glaciers around the world. Our results show that the updated model: (1) can accurately estimate anisotropic factors of reflectance for snow and ice surfaces; (2) generally performs better than prior approaches for L8/OLI albedo retrieval but is not appropriate for L5/TM; (3) generally retrieves MODIS albedo better than the MODIS standard albedo product (MCD43A3) in both absolute values and glacier albedo temporal evolution, i.e., exhibiting both fewer gaps and better agreement with field observations. As the updated model enables anisotropy correction of a maximum of 10 multispectral bands and is implemented in Google Earth Engine (GEE), it is promising for observing and analyzing glacier albedo at large spatial scales.}, author = {Ren, Shaoting and Miles, Evan S. and Jia, Li and Menenti, Massimo and Kneib, Marin and Buri, Pascal and McCarthy, Michael J. and Shaw, Thomas E. and Yang, Wei and Pellicciotti, Francesca}, issn = {2072-4292}, journal = {Remote Sensing}, number = {9}, publisher = {MDPI}, title = {{Anisotropy parameterization development and evaluation for glacier surface albedo retrieval from satellite observations}}, doi = {10.3390/rs13091714}, volume = {13}, year = {2021}, } @article{12589, abstract = {Near-surface air temperature (Ta) is highly important for modelling glacier ablation, though its spatio-temporal variability over melting glaciers still remains largely unknown. We present a new dataset of distributed Ta for three glaciers of different size in the south-east Tibetan Plateau during two monsoon-dominated summer seasons. We compare on-glacier Ta to ambient Ta extrapolated from several local off-glacier stations. We parameterise the along-flowline sensitivity of Ta on these glaciers to changes in off-glacier temperatures (referred to as “temperature sensitivity”) and present the results in the context of available distributed on-glacier datasets around the world. Temperature sensitivity decreases rapidly up to 2000–3000 m along the down-glacier flowline distance. Beyond this distance, both the Ta on the Tibetan glaciers and global glacier datasets show little additional cooling relative to the off-glacier temperature. In general, Ta on small glaciers (with flowline distances <1000 m) is highly sensitive to temperature changes outside the glacier boundary layer. The climatology of a given region can influence the general magnitude of this temperature sensitivity, though no strong relationships are found between along-flowline temperature sensitivity and mean summer temperatures or precipitation. The terminus of some glaciers is affected by other warm-air processes that increase temperature sensitivity (such as divergent boundary layer flow, warm up-valley winds or debris/valley heating effects) which are evident only beyond ∼70 % of the total glacier flowline distance. Our results therefore suggest a strong role of local effects in modulating temperature sensitivity close to the glacier terminus, although further work is still required to explain the variability of these effects for different glaciers.}, author = {Shaw, Thomas E. and Yang, Wei and Ayala, Álvaro and Bravo, Claudio and Zhao, Chuanxi and Pellicciotti, Francesca}, issn = {1994-0424}, journal = {The Cryosphere}, keywords = {Earth-Surface Processes, Water Science and Technology}, number = {2}, pages = {595--614}, publisher = {Copernicus Publications}, title = {{Distributed summer air temperatures across mountain glaciers in the south-east Tibetan Plateau: Temperature sensitivity and comparison with existing glacier datasets}}, doi = {10.5194/tc-15-595-2021}, volume = {15}, year = {2021}, } @article{12586, abstract = {Ice cliffs are common on debris-covered glaciers and have relatively high melt rates due to their direct exposure to incoming radiation. Previous studies have shown that their number and relative area can change considerably from year to year, but this variability has not been explored, in part because available cliff observations are irregular. Here, we systematically mapped and tracked ice cliffs across four debris-covered glaciers in High Mountain Asia for every late ablation season from 2009 to 2019 using high-resolution multi-spectral satellite imagery. We then quantified the processes occurring at the feature scale to train a stochastic birth-death model to represent the cliff population dynamics. Our results show that while the cliff relative area can change by up to 20% from year to year, the natural long-term variability is constrained, thus defining a glacier-specific cliff carrying capacity. In a subsequent step, the inclusion of external drivers related to climate, glacier dynamics, and hydrology highlights the influence of these variables on the cliff population dynamics, which is usually not a direct one due to the complexity and interdependence of the processes taking place at the glacier surface. In some extreme cases (here, a glacier surge), these external drivers may lead to a reorganization of the cliffs at the glacier surface and a change in the natural variability. These results have implications for the melt of debris-covered glaciers, in addition to showing the high rate of changes at their surface and highlighting some of the links between cliff population and glacier state.}, author = {Kneib, M. and Miles, E. S. and Buri, P. and Molnar, P. and McCarthy, M. and Fugger, S. and Pellicciotti, Francesca}, issn = {2169-9003}, journal = {Journal of Geophysical Research: Earth Surface}, keywords = {Earth-Surface Processes, Geophysics}, number = {10}, publisher = {American Geophysical Union}, title = {{Interannual dynamics of ice cliff populations on debris‐covered glaciers from remote sensing observations and stochastic modeling}}, doi = {10.1029/2021jf006179}, volume = {126}, year = {2021}, } @article{12587, abstract = {Surface energy-balance models are commonly used in conjunction with satellite thermal imagery to estimate supraglacial debris thickness. Removing the need for local meteorological data in the debris thickness estimation workflow could improve the versatility and spatiotemporal application of debris thickness estimation. We evaluate the use of regional reanalysis data to derive debris thickness for two mountain glaciers using a surface energy-balance model. Results forced using ERA-5 agree with AWS-derived estimates to within 0.01 ± 0.05 m for Miage Glacier, Italy, and 0.01 ± 0.02 m for Khumbu Glacier, Nepal. ERA-5 data were then used to estimate spatiotemporal changes in debris thickness over a ~20-year period for Miage Glacier, Khumbu Glacier and Haut Glacier d'Arolla, Switzerland. We observe significant increases in debris thickness at the terminus for Haut Glacier d'Arolla and at the margins of the expanding debris cover at all glaciers. While simulated debris thickness was underestimated compared to point measurements in areas of thick debris, our approach can reconstruct glacier-scale debris thickness distribution and its temporal evolution over multiple decades. We find significant changes in debris thickness over areas of thin debris, areas susceptible to high ablation rates, where current knowledge of debris evolution is limited.}, author = {Stewart, Rebecca L. and Westoby, Matthew and Pellicciotti, Francesca and Rowan, Ann and Swift, Darrel and Brock, Benjamin and Woodward, John}, issn = {1727-5652}, journal = {Journal of Glaciology}, number = {262}, pages = {366--384}, publisher = {Cambridge University Press}, title = {{Using climate reanalysis data in conjunction with multi-temporal satellite thermal imagery to derive supraglacial debris thickness changes from energy-balance modelling}}, doi = {10.1017/jog.2020.111}, volume = {67}, year = {2021}, } @article{12585, abstract = {Glaciers in High Mountain Asia generate meltwater that supports the water needs of 250 million people, but current knowledge of annual accumulation and ablation is limited to sparse field measurements biased in location and glacier size. Here, we present altitudinally-resolved specific mass balances (surface, internal, and basal combined) for 5527 glaciers in High Mountain Asia for 2000–2016, derived by correcting observed glacier thinning patterns for mass redistribution due to ice flow. We find that 41% of glaciers accumulated mass over less than 20% of their area, and only 60% ± 10% of regional annual ablation was compensated by accumulation. Even without 21st century warming, 21% ± 1% of ice volume will be lost by 2100 due to current climatic-geometric imbalance, representing a reduction in glacier ablation into rivers of 28% ± 1%. The ablation of glaciers in the Himalayas and Tien Shan was mostly unsustainable and ice volume in these regions will reduce by at least 30% by 2100. The most important and vulnerable glacier-fed river basins (Amu Darya, Indus, Syr Darya, Tarim Interior) were supplied with >50% sustainable glacier ablation but will see long-term reductions in ice mass and glacier meltwater supply regardless of the Karakoram Anomaly.}, author = {Miles, Evan and McCarthy, Michael and Dehecq, Amaury and Kneib, Marin and Fugger, Stefan and Pellicciotti, Francesca}, issn = {2041-1723}, journal = {Nature Communications}, keywords = {General Physics and Astronomy, General Biochemistry, Genetics and Molecular Biology, General Chemistry, Multidisciplinary}, publisher = {Springer Nature}, title = {{Health and sustainability of glaciers in High Mountain Asia}}, doi = {10.1038/s41467-021-23073-4}, volume = {12}, year = {2021}, } @article{12588, abstract = {The thinning patterns of debris-covered glaciers in High Mountain Asia are not well understood. Here we calculate the effect of supraglacial ice cliffs on the mass balance of all glaciers in a Himalayan catchment, using a process-based ice cliff melt model. We show that ice cliffs are responsible for higher than expected thinning rates of debris-covered glacier tongues, leading to an underestimation of their ice mass loss of 17% ± 4% in the catchment if not considered. We also show that cliffs do enhance melt where other processes would suppress it, that is, at high elevations, or where debris is thick, and that they contribute relatively more to glacier mass loss if oriented north. Our approach provides a key contribution to our understanding of the mass losses of debris-covered glaciers, and a new quantification of their catchment wide melt and mass balance.}, author = {Buri, Pascal and Miles, Evan S. and Steiner, Jakob F. and Ragettli, Silvan and Pellicciotti, Francesca}, issn = {1944-8007}, journal = {Geophysical Research Letters}, keywords = {General Earth and Planetary Sciences, Geophysics}, number = {6}, publisher = {American Geophysical Union}, title = {{Supraglacial ice cliffs can substantially increase the mass loss of debris‐covered glaciers}}, doi = {10.1029/2020gl092150}, volume = {48}, year = {2021}, } @article{12583, abstract = {Peruvian glaciers are important contributors to dry season runoff for agriculture and hydropower, but they are at risk of disappearing due to climate change. We applied a physically based, energy balance melt model at five on-glacier sites within the Peruvian Cordilleras Blanca and Vilcanota. Net shortwave radiation dominates the energy balance, and despite this flux being higher in the dry season, melt rates are lower due to losses from net longwave radiation and the latent heat flux. The sensible heat flux is a relatively small contributor to melt energy. At three of the sites the wet season snowpack was discontinuous, forming and melting within a daily to weekly timescale, and resulting in highly variable melt rates closely related to precipitation dynamics. Cold air temperatures due to a strong La Niña year at Shallap Glacier (Cordillera Blanca) resulted in a continuous wet season snowpack, significantly reducing wet season ablation. Sublimation was most important at the highest site in the accumulation zone of the Quelccaya Ice Cap (Cordillera Vilcanota), accounting for 81% of ablation, compared to 2%–4% for the other sites. Air temperature and precipitation inputs were perturbed to investigate the climate sensitivity of the five glaciers. At the lower sites warmer air temperatures resulted in a switch from snowfall to rain, so that ablation was increased via the decrease in albedo and increase in net shortwave radiation. At the top of Quelccaya Ice Cap warming caused melting to replace sublimation so that ablation increased nonlinearly with air temperature.}, author = {Fyffe, Catriona L. and Potter, Emily and Fugger, Stefan and Orr, Andrew and Fatichi, Simone and Loarte, Edwin and Medina, Katy and Hellström, Robert Å. and Bernat, Maud and Aubry‐Wake, Caroline and Gurgiser, Wolfgang and Perry, L. Baker and Suarez, Wilson and Quincey, Duncan J. and Pellicciotti, Francesca}, issn = {2169-8996}, journal = {Journal of Geophysical Research: Atmospheres}, keywords = {Space and Planetary Science, Earth and Planetary Sciences (miscellaneous), Atmospheric Science, Geophysics}, number = {23}, publisher = {American Geophysical Union}, title = {{The energy and mass balance of Peruvian Glaciers}}, doi = {10.1029/2021jd034911}, volume = {126}, year = {2021}, } @inproceedings{12767, abstract = {Several problems in planning and reactive synthesis can be reduced to the analysis of two-player quantitative graph games. Optimization is one form of analysis. We argue that in many cases it may be better to replace the optimization problem with the satisficing problem, where instead of searching for optimal solutions, the goal is to search for solutions that adhere to a given threshold bound. This work defines and investigates the satisficing problem on a two-player graph game with the discounted-sum cost model. We show that while the satisficing problem can be solved using numerical methods just like the optimization problem, this approach does not render compelling benefits over optimization. When the discount factor is, however, an integer, we present another approach to satisficing, which is purely based on automata methods. We show that this approach is algorithmically more performant – both theoretically and empirically – and demonstrates the broader applicability of satisficing over optimization.}, author = {Bansal, Suguman and Chatterjee, Krishnendu and Vardi, Moshe Y.}, booktitle = {27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems}, isbn = {9783030720155}, issn = {1611-3349}, location = {Luxembourg City, Luxembourg}, pages = {20--37}, publisher = {Springer Nature}, title = {{On satisficing in quantitative games}}, doi = {10.1007/978-3-030-72016-2}, volume = {12651}, year = {2021}, } @unpublished{10011, abstract = {We propose a new weak solution concept for (two-phase) mean curvature flow which enjoys both (unconditional) existence and (weak-strong) uniqueness properties. These solutions are evolving varifolds, just as in Brakke's formulation, but are coupled to the phase volumes by a simple transport equation. First, we show that, in the exact same setup as in Ilmanen's proof [J. Differential Geom. 38, 417-461, (1993)], any limit point of solutions to the Allen-Cahn equation is a varifold solution in our sense. Second, we prove that any calibrated flow in the sense of Fischer et al. [arXiv:2003.05478] - and hence any classical solution to mean curvature flow - is unique in the class of our new varifold solutions. This is in sharp contrast to the case of Brakke flows, which a priori may disappear at any given time and are therefore fatally non-unique. Finally, we propose an extension of the solution concept to the multi-phase case which is at least guaranteed to satisfy a weak-strong uniqueness principle.}, author = {Hensel, Sebastian and Laux, Tim}, booktitle = {arXiv}, keywords = {Mean curvature flow, gradient flows, varifolds, weak solutions, weak-strong uniqueness, calibrated geometry, gradient-flow calibrations}, title = {{A new varifold solution concept for mean curvature flow: Convergence of the Allen-Cahn equation and weak-strong uniqueness}}, doi = {10.48550/arXiv.2109.04233}, year = {2021}, } @unpublished{9230, abstract = {We consider a model of the Riemann zeta function on the critical axis and study its maximum over intervals of length (log T)θ, where θ is either fixed or tends to zero at a suitable rate. It is shown that the deterministic level of the maximum interpolates smoothly between the ones of log-correlated variables and of i.i.d. random variables, exhibiting a smooth transition ‘from 3/4 to 1/4’ in the second order. This provides a natural context where extreme value statistics of log-correlated variables with time-dependent variance and rate occur. A key ingredient of the proof is a precise upper tail tightness estimate for the maximum of the model on intervals of size one, that includes a Gaussian correction. This correction is expected to be present for the Riemann zeta function and pertains to the question of the correct order of the maximum of the zeta function in large intervals.}, author = {Arguin, Louis-Pierre and Dubach, Guillaume and Hartung, Lisa}, booktitle = {arXiv}, title = {{Maxima of a random model of the Riemann zeta function over intervals of varying length}}, doi = {10.48550/arXiv.2103.04817}, year = {2021}, } @unpublished{9281, abstract = {We comment on two formal proofs of Fermat's sum of two squares theorem, written using the Mathematical Components libraries of the Coq proof assistant. The first one follows Zagier's celebrated one-sentence proof; the second follows David Christopher's recent new proof relying on partition-theoretic arguments. Both formal proofs rely on a general property of involutions of finite sets, of independent interest. The proof technique consists for the most part of automating recurrent tasks (such as case distinctions and computations on natural numbers) via ad hoc tactics.}, author = {Dubach, Guillaume and Mühlböck, Fabian}, booktitle = {arXiv}, title = {{Formal verification of Zagier's one-sentence proof}}, doi = {10.48550/arXiv.2103.11389}, year = {2021}, } @unpublished{10579, abstract = {We consider a totally asymmetric simple exclusion process (TASEP) consisting of particles on a lattice that require binding by a "token" to move. Using a combination of theory and simulations, we address the following questions: (i) How token binding kinetics affects the current-density relation; (ii) How the current-density relation depends on the scarcity of tokens; (iii) How tokens propagate the effects of the locally-imposed disorder (such a slow site) over the entire lattice; (iv) How a shared pool of tokens couples concurrent TASEPs running on multiple lattices; (v) How our results translate to TASEPs with open boundaries that exchange particles with the reservoir. Since real particle motion (including in systems that inspired the standard TASEP model, e.g., protein synthesis or movement of molecular motors) is often catalyzed, regulated, actuated, or otherwise mediated, the token-driven TASEP dynamics analyzed in this paper should allow for a better understanding of real systems and enable a closer match between TASEP theory and experimental observations.}, author = {Kavcic, Bor and Tkačik, Gašper}, booktitle = {arXiv}, title = {{Token-driven totally asymmetric simple exclusion process}}, doi = {10.48550/arXiv.2112.13558}, year = {2021}, } @article{10806, abstract = {Ligands are a fundamental part of nanocrystals. They control and direct nanocrystal syntheses and provide colloidal stability. Bound ligands also affect the nanocrystals’ chemical reactivity and electronic structure. Surface chemistry is thus crucial to understand nanocrystal properties and functionality. Here, we investigate the synthesis of metal oxide nanocrystals (CeO2-x, ZnO, and NiO) from metal nitrate precursors, in the presence of oleylamine ligands. Surprisingly, the nanocrystals are capped exclusively with a fatty acid instead of oleylamine. Analysis of the reaction mixtures with nuclear magnetic resonance spectroscopy revealed several reaction byproducts and intermediates that are common to the decomposition of Ce, Zn, Ni, and Zr nitrate precursors. Our evidence supports the oxidation of alkylamine and formation of a carboxylic acid, thus unraveling this counterintuitive surface chemistry.}, author = {Calcabrini, Mariano and Van den Eynden, Dietger and Sanchez Ribot, Sergi and Pokratath, Rohan and Llorca, Jordi and De Roo, Jonathan and Ibáñez, Maria}, issn = {2691-3704}, journal = {JACS Au}, keywords = {general medicine}, number = {11}, pages = {1898--1903}, publisher = {American Chemical Society}, title = {{Ligand conversion in nanocrystal synthesis: The oxidation of alkylamines to fatty acids by nitrate}}, doi = {10.1021/jacsau.1c00349}, volume = {1}, year = {2021}, } @article{12187, abstract = {Genomes of germ cells present an existential vulnerability to organisms because germ cell mutations will propagate to future generations. Transposable elements are one source of such mutations. In the small flowering plant Arabidopsis, Long et al. found that genome methylation in the male germline is directed by small interfering RNAs (siRNAs) imperfectly transcribed from transposons (see the Perspective by Mosher). These germline siRNAs silence germline transposons and establish inherited methylation patterns in sperm, thus maintaining the integrity of the plant genome across generations.}, author = {Long, Jincheng and Walker, James and She, Wenjing and Aldridge, Billy and Gao, Hongbo and Deans, Samuel and Vickers, Martin and Feng, Xiaoqi}, issn = {0036-8075}, journal = {Science}, keywords = {Multidisciplinary}, number = {6550}, publisher = {American Association for the Advancement of Science (AAAS)}, title = {{Nurse cell--derived small RNAs define paternal epigenetic inheritance in Arabidopsis}}, doi = {10.1126/science.abh0556}, volume = {373}, year = {2021}, } @article{12186, abstract = {Activation of cell-surface and intracellular receptor-mediated immunity results in rapid transcriptional reprogramming that underpins disease resistance. However, the mechanisms by which co-activation of both immune systems lead to transcriptional changes are not clear. Here, we combine RNA-seq and ATAC-seq to define changes in gene expression and chromatin accessibility. Activation of cell-surface or intracellular receptor-mediated immunity, or both, increases chromatin accessibility at induced defence genes. Analysis of ATAC-seq and RNA-seq data combined with publicly available information on transcription factor DNA-binding motifs enabled comparison of individual gene regulatory networks activated by cell-surface or intracellular receptor-mediated immunity, or by both. These results and analyses reveal overlapping and conserved transcriptional regulatory mechanisms between the two immune systems.}, author = {Ding, Pingtao and Sakai, Toshiyuki and Krishna Shrestha, Ram and Manosalva Perez, Nicolas and Guo, Wenbin and Ngou, Bruno Pok Man and He, Shengbo and Liu, Chang and Feng, Xiaoqi and Zhang, Runxuan and Vandepoele, Klaas and MacLean, Dan and Jones, Jonathan D G}, issn = {0022-0957}, journal = {Journal of Experimental Botany}, keywords = {Plant Science, Physiology}, number = {22}, pages = {7927--7941}, publisher = {Oxford University Press}, title = {{Chromatin accessibility landscapes activated by cell-surface and intracellular immune receptors}}, doi = {10.1093/jxb/erab373}, volume = {72}, year = {2021}, } @article{9698, abstract = {Machine learning models are poised to make a transformative impact on chemical sciences by dramatically accelerating computational algorithms and amplifying insights available from computational chemistry methods. However, achieving this requires a confluence and coaction of expertise in computer science and physical sciences. This review is written for new and experienced researchers working at the intersection of both fields. We first provide concise tutorials of computational chemistry and machine learning methods, showing how insights involving both can be achieved. We then follow with a critical review of noteworthy applications that demonstrate how computational chemistry and machine learning can be used together to provide insightful (and useful) predictions in molecular and materials modeling, retrosyntheses, catalysis, and drug design.}, author = {Keith, John A. and Valentin Vassilev-Galindo, Valentin and Cheng, Bingqing and Chmiela, Stefan and Gastegger, Michael and Müller, Klaus-Robert and Tkatchenko, Alexandre}, issn = {1520-6890}, journal = {Chemical Reviews}, number = {16}, pages = {9816--9872}, publisher = {American Chemical Society}, title = {{Combining machine learning and computational chemistry for predictive insights into chemical systems}}, doi = {10.1021/acs.chemrev.1c00107}, volume = {121}, year = {2021}, } @article{12309, abstract = {Take a rational elliptic curve defined by the equation y2=x3+ax in minimal form and consider the sequence Bn of the denominators of the abscissas of the iterate of a non-torsion point. We show that B5m has a primitive divisor for every m. Then, we show how to generalize this method to the terms of the form Bmp with p a prime congruent to 1 modulo 4.}, author = {Verzobio, Matteo}, issn = {0065-1036}, journal = {Acta Arithmetica}, keywords = {Algebra and Number Theory}, number = {2}, pages = {129--168}, publisher = {Institute of Mathematics, Polish Academy of Sciences}, title = {{Primitive divisors of elliptic divisibility sequences for elliptic curves with j=1728}}, doi = {10.4064/aa191016-30-7}, volume = {198}, year = {2021}, } @article{12308, abstract = {Let P and Q be two points on an elliptic curve defined over a number field K. For α∈End(E), define Bα to be the OK-integral ideal generated by the denominator of x(α(P)+Q). Let O be a subring of End(E), that is a Dedekind domain. We will study the sequence {Bα}α∈O. We will show that, for all but finitely many α∈O, the ideal Bα has a primitive divisor when P is a non-torsion point and there exist two endomorphisms g≠0 and f so that f(P)=g(Q). This is a generalization of previous results on elliptic divisibility sequences.}, author = {Verzobio, Matteo}, issn = {2522-0160}, journal = {Research in Number Theory}, keywords = {Algebra and Number Theory}, number = {2}, publisher = {Springer Nature}, title = {{Primitive divisors of sequences associated to elliptic curves with complex multiplication}}, doi = {10.1007/s40993-021-00267-9}, volume = {7}, year = {2021}, } @inproceedings{12909, author = {Schlögl, Alois and Elefante, Stefano and Hornoiu, Andrei and Stadlbauer, Stephan}, booktitle = {ASHPC21 – Austrian-Slovenian HPC Meeting 2021}, isbn = {978-961-6980-77-7}, location = {Virtual}, pages = {5}, publisher = {University of Ljubljana}, title = {{Managing software on a heterogenous HPC cluster}}, doi = {10.3359/2021hpc}, year = {2021}, } @inproceedings{11458, abstract = {The increasing computational requirements of deep neural networks (DNNs) have led to significant interest in obtaining DNN models that are sparse, yet accurate. Recent work has investigated the even harder case of sparse training, where the DNN weights are, for as much as possible, already sparse to reduce computational costs during training. Existing sparse training methods are often empirical and can have lower accuracy relative to the dense baseline. In this paper, we present a general approach called Alternating Compressed/DeCompressed (AC/DC) training of DNNs, demonstrate convergence for a variant of the algorithm, and show that AC/DC outperforms existing sparse training methods in accuracy at similar computational budgets; at high sparsity levels, AC/DC even outperforms existing methods that rely on accurate pre-trained dense models. An important property of AC/DC is that it allows co-training of dense and sparse models, yielding accurate sparse–dense model pairs at the end of the training process. This is useful in practice, where compressed variants may be desirable for deployment in resource-constrained settings without re-doing the entire training flow, and also provides us with insights into the accuracy gap between dense and compressed models. The code is available at: https://github.com/IST-DASLab/ACDC.}, author = {Peste, Elena-Alexandra and Iofinova, Eugenia B and Vladu, Adrian and Alistarh, Dan-Adrian}, booktitle = {35th Conference on Neural Information Processing Systems}, isbn = {9781713845393}, issn = {1049-5258}, location = {Virtual, Online}, pages = {8557--8570}, publisher = {Curran Associates}, title = {{AC/DC: Alternating Compressed/DeCompressed training of deep neural networks}}, volume = {34}, year = {2021}, } @article{10585, abstract = {Recently it was shown that anyons on the two-sphere naturally arise from a system of molecular impurities exchanging angular momentum with a many-particle bath (Phys. Rev. Lett. 126, 015301 (2021)). Here we further advance this approach and rigorously demonstrate that in the experimentally realized regime the lowest spectrum of two linear molecules immersed in superfluid helium corresponds to the spectrum of two anyons on the sphere. We develop the formalism within the framework of the recently experimentally observed angulon quasiparticle}, author = {Brooks, Morris and Lemeshko, Mikhail and Lundholm, Douglas and Yakaboylu, Enderalp}, issn = {2218-2004}, journal = {Atoms}, keywords = {anyons, quasiparticles, Quantum Hall Effect, topological states of matter}, number = {4}, publisher = {MDPI}, title = {{Emergence of anyons on the two-sphere in molecular impurities}}, doi = {10.3390/atoms9040106}, volume = {9}, year = {2021}, } @inproceedings{13147, abstract = {We investigate fast and communication-efficient algorithms for the classic problem of minimizing a sum of strongly convex and smooth functions that are distributed among n different nodes, which can communicate using a limited number of bits. Most previous communication-efficient approaches for this problem are limited to first-order optimization, and therefore have \emph{linear} dependence on the condition number in their communication complexity. We show that this dependence is not inherent: communication-efficient methods can in fact have sublinear dependence on the condition number. For this, we design and analyze the first communication-efficient distributed variants of preconditioned gradient descent for Generalized Linear Models, and for Newton’s method. Our results rely on a new technique for quantizing both the preconditioner and the descent direction at each step of the algorithms, while controlling their convergence rate. We also validate our findings experimentally, showing faster convergence and reduced communication relative to previous methods.}, author = {Alimisis, Foivos and Davies, Peter and Alistarh, Dan-Adrian}, booktitle = {Proceedings of the 38th International Conference on Machine Learning}, isbn = {9781713845065}, issn = {2640-3498}, location = {Virtual}, pages = {196--206}, publisher = {ML Research Press}, title = {{Communication-efficient distributed optimization with quantized preconditioners}}, volume = {139}, year = {2021}, } @inproceedings{13146, abstract = {A recent line of work has analyzed the theoretical properties of deep neural networks via the Neural Tangent Kernel (NTK). In particular, the smallest eigenvalue of the NTK has been related to the memorization capacity, the global convergence of gradient descent algorithms and the generalization of deep nets. However, existing results either provide bounds in the two-layer setting or assume that the spectrum of the NTK matrices is bounded away from 0 for multi-layer networks. In this paper, we provide tight bounds on the smallest eigenvalue of NTK matrices for deep ReLU nets, both in the limiting case of infinite widths and for finite widths. In the finite-width setting, the network architectures we consider are fairly general: we require the existence of a wide layer with roughly order of N neurons, N being the number of data samples; and the scaling of the remaining layer widths is arbitrary (up to logarithmic factors). To obtain our results, we analyze various quantities of independent interest: we give lower bounds on the smallest singular value of hidden feature matrices, and upper bounds on the Lipschitz constant of input-output feature maps.}, author = {Nguyen, Quynh and Mondelli, Marco and Montufar, Guido}, booktitle = {Proceedings of the 38th International Conference on Machine Learning}, isbn = {9781713845065}, issn = {2640-3498}, location = {Virtual}, pages = {8119--8129}, publisher = {ML Research Press}, title = {{Tight bounds on the smallest Eigenvalue of the neural tangent kernel for deep ReLU networks}}, volume = {139}, year = {2021}, } @inproceedings{10665, abstract = {Formal verification of neural networks is an active topic of research, and recent advances have significantly increased the size of the networks that verification tools can handle. However, most methods are designed for verification of an idealized model of the actual network which works over real arithmetic and ignores rounding imprecisions. This idealization is in stark contrast to network quantization, which is a technique that trades numerical precision for computational efficiency and is, therefore, often applied in practice. Neglecting rounding errors of such low-bit quantized neural networks has been shown to lead to wrong conclusions about the network’s correctness. Thus, the desired approach for verifying quantized neural networks would be one that takes these rounding errors into account. In this paper, we show that verifying the bitexact implementation of quantized neural networks with bitvector specifications is PSPACE-hard, even though verifying idealized real-valued networks and satisfiability of bit-vector specifications alone are each in NP. Furthermore, we explore several practical heuristics toward closing the complexity gap between idealized and bit-exact verification. In particular, we propose three techniques for making SMT-based verification of quantized neural networks more scalable. Our experiments demonstrate that our proposed methods allow a speedup of up to three orders of magnitude over existing approaches.}, author = {Henzinger, Thomas A and Lechner, Mathias and Zikelic, Dorde}, booktitle = {Proceedings of the AAAI Conference on Artificial Intelligence}, isbn = {978-1-57735-866-4}, issn = {2374-3468}, location = {Virtual}, number = {5A}, pages = {3787--3795}, publisher = {AAAI Press}, title = {{Scalable verification of quantized neural networks}}, volume = {35}, year = {2021}, } @inproceedings{10667, abstract = {Bayesian neural networks (BNNs) place distributions over the weights of a neural network to model uncertainty in the data and the network's prediction. We consider the problem of verifying safety when running a Bayesian neural network policy in a feedback loop with infinite time horizon systems. Compared to the existing sampling-based approaches, which are inapplicable to the infinite time horizon setting, we train a separate deterministic neural network that serves as an infinite time horizon safety certificate. In particular, we show that the certificate network guarantees the safety of the system over a subset of the BNN weight posterior's support. Our method first computes a safe weight set and then alters the BNN's weight posterior to reject samples outside this set. Moreover, we show how to extend our approach to a safe-exploration reinforcement learning setting, in order to avoid unsafe trajectories during the training of the policy. We evaluate our approach on a series of reinforcement learning benchmarks, including non-Lyapunovian safety specifications.}, author = {Lechner, Mathias and Žikelić, Ðorđe and Chatterjee, Krishnendu and Henzinger, Thomas A}, booktitle = {35th Conference on Neural Information Processing Systems}, location = {Virtual}, title = {{Infinite time horizon safety of Bayesian neural networks}}, doi = {10.48550/arXiv.2111.03165}, year = {2021}, } @article{13358, abstract = {DNA nanotechnology offers a versatile toolbox for precise spatial and temporal manipulation of matter on the nanoscale. However, rendering DNA-based systems responsive to light has remained challenging. Herein, we describe the remote manipulation of native (non-photoresponsive) chiral plasmonic molecules (CPMs) using light. Our strategy is based on the use of a photoresponsive medium comprising a merocyanine-based photoacid. Upon exposure to visible light, the medium decreases its pH, inducing the formation of DNA triplex links, leading to a spatial reconfiguration of the CPMs. The process can be reversed simply by turning the light off and it can be repeated for multiple cycles. The degree of the overall chirality change in an ensemble of CPMs depends on the CPM fraction undergoing reconfiguration, which, remarkably, depends on and can be tuned by the intensity of incident light. Such a dynamic, remotely controlled system could aid in further advancing DNA-based devices and nanomaterials.}, author = {Ryssy, Joonas and Natarajan, Ashwin K. and Wang, Jinhua and Lehtonen, Arttu J. and Nguyen, Minh‐Kha and Klajn, Rafal and Kuzyk, Anton}, issn = {1521-3773}, journal = {Angewandte Chemie International Edition}, keywords = {General Chemistry, Catalysis}, number = {11}, pages = {5859--5863}, publisher = {Wiley}, title = {{Light‐responsive dynamic DNA‐origami‐based plasmonic assemblies}}, doi = {10.1002/anie.202014963}, volume = {60}, year = {2021}, } @inbook{13360, abstract = {Inorganic nanoparticles (NPs) exhibit a wide range of fascinating physicochemical properties, many of which can be controlled by modulating the NP–NP coupling. Controlling the self-assembly of NPs using light has traditionally been achieved by functionalizing their surfaces with monolayers of photoswitchable molecules, which can be reversibly isomerized between two or more states upon exposure to different wavelengths of light. NPs whose assembly can be controlled by light in a reversible fashion can find interesting applications. The chapter deals with systems comprising mixtures of non-photoswitchable NPs and small-molecule photoacids and photobases. Examples of light-controlled self-assembly of NPs hitherto reported have been categorized into six distinct approaches. These are: functionalizing NPs with monolayers of photoswitchable molecules, light-controlled adsorption/desorption of photoswitchable molecules onto NPs, and light-induced electron transfer between the particle's inorganic core and the NP-bound ligands.}, author = {Bian, Tong and Chu, Zonglin and Klajn, Rafal}, booktitle = {Out‐of‐Equilibrium (Supra)molecular Systems and Materials}, editor = {Giuseppone, Nicolas and Walther, Andreas}, isbn = {9783527346158}, pages = {241--273}, publisher = {Wiley}, title = {{Controlling Self‐Assembly of Nanoparticles Using Light}}, doi = {10.1002/9783527821990.ch9}, year = {2021}, } @article{13357, abstract = {Coulombic interactions can be used to assemble charged nanoparticles into higher-order structures, but the process requires oppositely charged partners that are similarly sized. The ability to mediate the assembly of such charged nanoparticles using structurally simple small molecules would greatly facilitate the fabrication of nanostructured materials and harnessing their applications in catalysis, sensing and photonics. Here we show that small molecules with as few as three electric charges can effectively induce attractive interactions between oppositely charged nanoparticles in water. These interactions can guide the assembly of charged nanoparticles into colloidal crystals of a quality previously only thought to result from their co-crystallization with oppositely charged nanoparticles of a similar size. Transient nanoparticle assemblies can be generated using positively charged nanoparticles and multiply charged anions that are enzymatically hydrolysed into mono- and/or dianions. Our findings demonstrate an approach for the facile fabrication, manipulation and further investigation of static and dynamic nanostructured materials in aqueous environments.}, author = {Bian, Tong and Gardin, Andrea and Gemen, Julius and Houben, Lothar and Perego, Claudio and Lee, Byeongdu and Elad, Nadav and Chu, Zonglin and Pavan, Giovanni M. and Klajn, Rafal}, issn = {1755-4349}, journal = {Nature Chemistry}, keywords = {General Chemical Engineering, General Chemistry}, number = {10}, pages = {940--949}, publisher = {Springer Nature}, title = {{Electrostatic co-assembly of nanoparticles with oppositely charged small molecules into static and dynamic superstructures}}, doi = {10.1038/s41557-021-00752-9}, volume = {13}, year = {2021}, } @misc{13072, abstract = {CpGs and corresponding mean weights for DNAm-based prediction of cognitive abilities (6 traits)}, author = {McCartney, Daniel L and Hillary, Robert F and Conole, Eleanor LS and Trejo Banos, Daniel and Gadd, Danni A and Walker, Rosie M and Nangle, Cliff and Flaig, Robin and Campbell, Archie and Murray, Alison D and Munoz Maniega, Susana and del C Valdes-Hernandez, Maria and Harris, Mathew A and Bastin, Mark E and Wardlaw, Joanna M and Harris, Sarah E and Porteous, David J and Tucker-Drob, Elliot M and McIntosh, Andrew M and Evans, Kathryn L and Deary, Ian J and Cox, Simon R and Robinson, Matthew Richard and Marioni, Riccardo E}, publisher = {Zenodo}, title = {{Blood-based epigenome-wide analyses of cognitive abilities}}, doi = {10.5281/ZENODO.5794028}, year = {2021}, } @misc{13068, abstract = {Source data and source code for the graphs in "Spatiotemporal dynamics of self-organized branching pancreatic cancer-derived organoids".}, author = {Randriamanantsoa, Samuel and Papargyriou, Aristeidis and Maurer, Carlo and Peschke, Katja and Schuster, Maximilian and Zecchin, Giulia and Steiger, Katja and Öllinger, Rupert and Saur, Dieter and Scheel, Christina and Rad, Roland and Hannezo, Edouard B and Reichert, Maximilian and Bausch, Andreas R.}, publisher = {Zenodo}, title = {{Spatiotemporal dynamics of self-organized branching in pancreas-derived organoids}}, doi = {10.5281/ZENODO.5148117}, year = {2021}, } @article{7551, abstract = {Novelty facilitates formation of memories. The detection of novelty and storage of contextual memories are both mediated by the hippocampus, yet the mechanisms that link these two functions remain to be defined. Dentate granule cells (GCs) of the dorsal hippocampus fire upon novelty exposure forming engrams of contextual memory. However, their key excitatory inputs from the entorhinal cortex are not responsive to novelty and are insufficient to make dorsal GCs fire reliably. Here we uncover a powerful glutamatergic pathway to dorsal GCs from ventral hippocampal mossy cells (MCs) that relays novelty, and is necessary and sufficient for driving dorsal GCs activation. Furthermore, manipulation of ventral MCs activity bidirectionally regulates novelty-induced contextual memory acquisition. Our results show that ventral MCs activity controls memory formation through an intra-hippocampal interaction mechanism gated by novelty.}, author = {Fredes Tolorza, Felipe A and Silva Sifuentes, Maria A and Koppensteiner, Peter and Kobayashi, Kenta and Jösch, Maximilian A and Shigemoto, Ryuichi}, journal = {Current Biology}, number = {1}, pages = {P25--38.E5}, publisher = {Elsevier}, title = {{Ventro-dorsal hippocampal pathway gates novelty-induced contextual memory formation}}, doi = {10.1016/j.cub.2020.09.074}, volume = {31}, year = {2021}, } @article{7463, abstract = {Resting-state brain activity is characterized by the presence of neuronal avalanches showing absence of characteristic size. Such evidence has been interpreted in the context of criticality and associated with the normal functioning of the brain. A distinctive attribute of systems at criticality is the presence of long-range correlations. Thus, to verify the hypothesis that the brain operates close to a critical point and consequently assess deviations from criticality for diagnostic purposes, it is of primary importance to robustly and reliably characterize correlations in resting-state brain activity. Recent works focused on the analysis of narrow-band electroencephalography (EEG) and magnetoencephalography (MEG) signal amplitude envelope, showing evidence of long-range temporal correlations (LRTC) in neural oscillations. However, brain activity is a broadband phenomenon, and a significant piece of information useful to precisely discriminate between normal (critical) and pathological behavior (non-critical), may be encoded in the broadband spatio-temporal cortical dynamics. Here we propose to characterize the temporal correlations in the broadband brain activity through the lens of neuronal avalanches. To this end, we consider resting-state EEG and long-term MEG recordings, extract the corresponding neuronal avalanche sequences, and study their temporal correlations. We demonstrate that the broadband resting-state brain activity consistently exhibits long-range power-law correlations in both EEG and MEG recordings, with similar values of the scaling exponents. Importantly, although we observe that the avalanche size distribution depends on scale parameters, scaling exponents characterizing long-range correlations are quite robust. In particular, they are independent of the temporal binning (scale of analysis), indicating that our analysis captures intrinsic characteristics of the underlying dynamics. Because neuronal avalanches constitute a fundamental feature of neural systems with universal characteristics, the proposed approach may serve as a general, systems- and experiment-independent procedure to infer the existence of underlying long-range correlations in extended neural systems, and identify pathological behaviors in the complex spatio-temporal interplay of cortical rhythms.}, author = {Lombardi, Fabrizio and Shriki, Oren and Herrmann, Hans J and de Arcangelis, Lucilla}, issn = {1872-8286}, journal = {Neurocomputing}, pages = {657--666}, publisher = {Elsevier}, title = {{Long-range temporal correlations in the broadband resting state activity of the human brain revealed by neuronal avalanches}}, doi = {10.1016/j.neucom.2020.05.126}, volume = {461}, year = {2021}, } @misc{6995, abstract = {Human brain organoids represent a powerful tool for the study of human neurological diseases particularly those that impact brain growth and structure. However, many neurological diseases lack obvious anatomical abnormalities, yet significantly impact neural network functions, raising the question of whether organoids possess sufficient neural network architecture and complexity to model these conditions. Here, we explore the network level functions of brain organoids using calcium sensor imaging and extracellular recording approaches that together reveal the existence of complex oscillatory network behaviors reminiscent of intact brain preparations. We further demonstrate strikingly abnormal epileptiform network activity in organoids derived from a Rett Syndrome patient despite only modest anatomical differences from isogenically matched controls, and rescue with an unconventional neuromodulatory drug Pifithrin-α. Together, these findings provide an essential foundation for the utilization of human brain organoids to study intact and disordered human brain network formation and illustrate their utility in therapeutic discovery.}, author = {Samarasinghe, Ranmal A. and Miranda, Osvaldo and Buth, Jessie E. and Mitchell, Simon and Ferando, Isabella and Watanabe, Momoko and Kurdian, Arinnae and Golshani, Peyman and Plath, Kathrin and Lowry, William E. and Parent, Jack M. and Mody, Istvan and Novitch, Bennett G.}, issn = {1546-1726}, pages = {32}, publisher = {Springer Nature}, title = {{Identification of neural oscillations and epileptiform changes in human brain organoids}}, doi = {10.1038/s41593-021-00906-5}, volume = {24}, year = {2021}, } @article{6965, abstract = {The central object of investigation of this paper is the Hirzebruch class, a deformation of the Todd class, given by Hirzebruch (for smooth varieties). The generalization for singular varieties is due to Brasselet–Schürmann–Yokura. Following the work of Weber, we investigate its equivariant version for (possibly singular) toric varieties. The local decomposition of the Hirzebruch class to the fixed points of the torus action and a formula for the local class in terms of the defining fan are recalled. After this review part, we prove the positivity of local Hirzebruch classes for all toric varieties, thus proving false the alleged counterexample given by Weber.}, author = {Rychlewicz, Kamil P}, issn = {1469-2120}, journal = {Bulletin of the London Mathematical Society}, number = {2}, pages = {560--574}, publisher = {Wiley}, title = {{The positivity of local equivariant Hirzebruch class for toric varieties}}, doi = {10.1112/blms.12442}, volume = {53}, year = {2021}, } @article{8253, abstract = {Brains process information in spiking neural networks. Their intricate connections shape the diverse functions these networks perform. In comparison, the functional capabilities of models of spiking networks are still rudimentary. This shortcoming is mainly due to the lack of insight and practical algorithms to construct the necessary connectivity. Any such algorithm typically attempts to build networks by iteratively reducing the error compared to a desired output. But assigning credit to hidden units in multi-layered spiking networks has remained challenging due to the non-differentiable nonlinearity of spikes. To avoid this issue, one can employ surrogate gradients to discover the required connectivity in spiking network models. However, the choice of a surrogate is not unique, raising the question of how its implementation influences the effectiveness of the method. Here, we use numerical simulations to systematically study how essential design parameters of surrogate gradients impact learning performance on a range of classification problems. We show that surrogate gradient learning is robust to different shapes of underlying surrogate derivatives, but the choice of the derivative’s scale can substantially affect learning performance. When we combine surrogate gradients with a suitable activity regularization technique, robust information processing can be achieved in spiking networks even at the sparse activity limit. Our study provides a systematic account of the remarkable robustness of surrogate gradient learning and serves as a practical guide to model functional spiking neural networks.}, author = {Zenke, Friedemann and Vogels, Tim P}, issn = {1530-888X}, journal = {Neural Computation}, number = {4}, pages = {899--925}, publisher = {MIT Press}, title = {{The remarkable robustness of surrogate gradient learning for instilling complex function in spiking neural networks}}, doi = {10.1162/neco_a_01367}, volume = {33}, year = {2021}, } @article{8198, abstract = {We investigate how the critical driving amplitude at the Floquet many-body localized (MBL) to ergodic phase transition differs between smooth and nonsmooth drives. To this end, we numerically study a disordered spin-1/2 chain which is periodically driven by a sine or square-wave drive over a wide range of driving frequencies. In both cases the critical driving amplitude increases monotonically with the frequency, and at large frequencies it is identical for the two drives. However, at low and intermediate frequencies the critical amplitude of the square-wave drive depends strongly on the frequency, while that of the sinusoidal drive is almost constant over a wide frequency range. By analyzing the density of drive-induced resonances we conclude that this difference is due to resonances induced by the higher harmonics which are present (absent) in the Fourier spectrum of the square-wave (sine) drive. Furthermore, we suggest a numerically efficient method for estimating the frequency dependence of the critical driving amplitudes for different drives which is based on calculating the density of drive-induced resonances. We conclude that delocalization occurs once the density of drive-induced resonances reaches a critical value determined only by the static system.}, author = {Diringer, Asaf A. and Gulden, Tobias}, issn = {24699969}, journal = {Physical Review B}, number = {21}, publisher = {American Physical Society}, title = {{Impact of drive harmonics on the stability of Floquet many-body localization}}, doi = {10.1103/PhysRevB.103.214204}, volume = {103}, year = {2021}, } @article{8373, abstract = {It is well known that special Kubo-Ando operator means admit divergence center interpretations, moreover, they are also mean squared error estimators for certain metrics on positive definite operators. In this paper we give a divergence center interpretation for every symmetric Kubo-Ando mean. This characterization of the symmetric means naturally leads to a definition of weighted and multivariate versions of a large class of symmetric Kubo-Ando means. We study elementary properties of these weighted multivariate means, and note in particular that in the special case of the geometric mean we recover the weighted A#H-mean introduced by Kim, Lawson, and Lim.}, author = {Pitrik, József and Virosztek, Daniel}, issn = {0024-3795}, journal = {Linear Algebra and its Applications}, keywords = {Kubo-Ando mean, weighted multivariate mean, barycenter}, pages = {203--217}, publisher = {Elsevier}, title = {{A divergence center interpretation of general symmetric Kubo-Ando means, and related weighted multivariate operator means}}, doi = {10.1016/j.laa.2020.09.007}, volume = {609}, year = {2021}, } @article{8317, abstract = {When can a polyomino piece of paper be folded into a unit cube? Prior work studied tree-like polyominoes, but polyominoes with holes remain an intriguing open problem. We present sufficient conditions for a polyomino with one or several holes to fold into a cube, and conditions under which cube folding is impossible. In particular, we show that all but five special “basic” holes guarantee foldability.}, author = {Aichholzer, Oswin and Akitaya, Hugo A. and Cheung, Kenneth C. and Demaine, Erik D. and Demaine, Martin L. and Fekete, Sándor P. and Kleist, Linda and Kostitsyna, Irina and Löffler, Maarten and Masárová, Zuzana and Mundilova, Klara and Schmidt, Christiane}, issn = {09257721}, journal = {Computational Geometry: Theory and Applications}, publisher = {Elsevier}, title = {{Folding polyominoes with holes into a cube}}, doi = {10.1016/j.comgeo.2020.101700}, volume = {93}, year = {2021}, } @article{7685, abstract = {We consider a gas of interacting bosons trapped in a box of side length one in the Gross–Pitaevskii limit. We review the proof of the validity of Bogoliubov’s prediction for the ground state energy and the low-energy excitation spectrum. This note is based on joint work with C. Brennecke, S. Cenatiempo and B. Schlein.}, author = {Boccato, Chiara}, issn = {0129-055X}, journal = {Reviews in Mathematical Physics}, number = {1}, publisher = {World Scientific}, title = {{The excitation spectrum of the Bose gas in the Gross-Pitaevskii regime}}, doi = {10.1142/S0129055X20600065}, volume = {33}, year = {2021}, } @article{8582, abstract = {Cell and tissue polarization is fundamental for plant growth and morphogenesis. The polar, cellular localization of Arabidopsis PIN‐FORMED (PIN) proteins is crucial for their function in directional auxin transport. The clustering of PIN polar cargoes within the plasma membrane has been proposed to be important for the maintenance of their polar distribution. However, the more detailed features of PIN clusters and the cellular requirements of cargo clustering remain unclear. Here, we characterized PIN clusters in detail by means of multiple advanced microscopy and quantification methods, such as 3D quantitative imaging or freeze‐fracture replica labeling. The size and aggregation types of PIN clusters were determined by electron microscopy at the nanometer level at different polar domains and at different developmental stages, revealing a strong preference for clustering at the polar domains. Pharmacological and genetic studies revealed that PIN clusters depend on phosphoinositol pathways, cytoskeletal structures and specific cell‐wall components as well as connections between the cell wall and the plasma membrane. This study identifies the role of different cellular processes and structures in polar cargo clustering and provides initial mechanistic insight into the maintenance of polarity in plants and other systems.}, author = {Li, Hongjiang and von Wangenheim, Daniel and Zhang, Xixi and Tan, Shutang and Darwish-Miranda, Nasser and Naramoto, Satoshi and Wabnik, Krzysztof T and de Rycke, Riet and Kaufmann, Walter and Gütl, Daniel J and Tejos, Ricardo and Grones, Peter and Ke, Meiyu and Chen, Xu and Dettmer, Jan and Friml, Jiří}, issn = {14698137}, journal = {New Phytologist}, number = {1}, pages = {351--369}, publisher = {Wiley}, title = {{Cellular requirements for PIN polar cargo clustering in Arabidopsis thaliana}}, doi = {10.1111/nph.16887}, volume = {229}, year = {2021}, }