@article{8268,
  abstract     = {Modern scientific instruments produce vast amounts of data, which can overwhelm the processing ability of computer systems. Lossy compression of data is an intriguing solution, but comes with its own drawbacks, such as potential signal loss, and the need for careful optimization of the compression ratio. In this work, we focus on a setting where this problem is especially acute: compressive sensing frameworks for interferometry and medical imaging. We ask the following question: can the precision of the data representation be lowered for all inputs, with recovery guarantees and practical performance Our first contribution is a theoretical analysis of the normalized Iterative Hard Thresholding (IHT) algorithm when all input data, meaning both the measurement matrix and the observation vector are quantized aggressively. We present a variant of low precision normalized IHT that, under mild conditions, can still provide recovery guarantees. The second contribution is the application of our quantization framework to radio astronomy and magnetic resonance imaging. We show that lowering the precision of the data can significantly accelerate image recovery. We evaluate our approach on telescope data and samples of brain images using CPU and FPGA implementations achieving up to a 9x speedup with negligible loss of recovery quality.},
  author       = {Gurel, Nezihe Merve and Kara, Kaan and Stojanov, Alen and Smith, Tyler and Lemmin, Thomas and Alistarh, Dan-Adrian and Puschel, Markus and Zhang, Ce},
  issn         = {1941-0476},
  journal      = {IEEE Transactions on Signal Processing},
  pages        = {4268--4282},
  publisher    = {IEEE},
  title        = {{Compressive sensing using iterative hard thresholding with low precision data representation: Theory and applications}},
  doi          = {10.1109/TSP.2020.3010355},
  volume       = {68},
  year         = {2020},
}

@article{8271,
  author       = {He, Peng and Zhang, Yuzhou and Xiao, Guanghui},
  issn         = {1752-9867},
  journal      = {Molecular Plant},
  number       = {9},
  pages        = {1238--1240},
  publisher    = {Elsevier},
  title        = {{Origin of a subgenome and genome evolution of allotetraploid cotton species}},
  doi          = {10.1016/j.molp.2020.07.006},
  volume       = {13},
  year         = {2020},
}

@article{8285,
  abstract     = {We demonstrate the utility of optical cavity generated spin-squeezed states in free space atomic fountain clocks in ensembles of 390 000 87Rb atoms. Fluorescence imaging, correlated to an initial quantum nondemolition measurement, is used for population spectroscopy after the atoms are released from a confining lattice. For a free fall time of 4 milliseconds, we resolve a single-shot phase sensitivity of 814(61) microradians, which is 5.8(0.6) decibels (dB) below the quantum projection limit. We observe that this squeezing is preserved as the cloud expands to a roughly 200  μm radius and falls roughly 300  μm in free space. Ramsey spectroscopy with 240 000 atoms at a 3.6 ms Ramsey time results in a single-shot fractional frequency stability of 8.4(0.2)×10−12, 3.8(0.2) dB below the quantum projection limit. The sensitivity and stability are limited by the technical noise in the fluorescence detection protocol and the microwave system, respectively.},
  author       = {Malia, Benjamin K. and Martínez-Rincón, Julián and Wu, Yunfan and Hosten, Onur and Kasevich, Mark A.},
  issn         = {1079-7114},
  journal      = {Physical Review Letters},
  number       = {4},
  publisher    = {American Physical Society},
  title        = {{Free space Ramsey spectroscopy in rubidium with noise below the quantum projection limit}},
  doi          = {10.1103/PhysRevLett.125.043202},
  volume       = {125},
  year         = {2020},
}

@article{8319,
  abstract     = {We demonstrate that releasing atoms into free space from an optical lattice does not deteriorate cavity-generated spin squeezing for metrological purposes. In this work, an ensemble of 500000 spin-squeezed atoms in a high-finesse optical cavity with near-uniform atom-cavity coupling is prepared, released into free space, recaptured in the cavity, and probed. Up to ∼10 dB of metrologically relevant squeezing is retrieved for 700μs free-fall times, and decaying levels of squeezing are realized for up to 3 ms free-fall times. The degradation of squeezing results from loss of atom-cavity coupling homogeneity between the initial squeezed state generation and final collective state readout. A theoretical model is developed to quantify this degradation and this model is experimentally validated.},
  author       = {Wu, Yunfan and Krishnakumar, Rajiv and Martínez-Rincón, Julián and Malia, Benjamin K. and Hosten, Onur and Kasevich, Mark A.},
  issn         = {2469-9934},
  journal      = {Physical Review A},
  number       = {1},
  publisher    = {American Physical Society},
  title        = {{Retrieval of cavity-generated atomic spin squeezing after free-space release}},
  doi          = {10.1103/PhysRevA.102.012224},
  volume       = {102},
  year         = {2020},
}

@article{8320,
  abstract     = {The genetic code is considered to use five nucleic bases (adenine, guanine, cytosine, thymine and uracil), which form two pairs for encoding information in DNA and two pairs for encoding information in RNA. Nevertheless, in recent years several artificial base pairs have been developed in attempts to expand the genetic code. Employment of these additional base pairs increases the information capacity and variety of DNA sequences, and provides a platform for the site-specific, enzymatic incorporation of extra functional components into DNA and RNA. As a result, of the development of such expanded systems, many artificial base pairs have been synthesized and tested under various conditions. Following many stages of enhancement, unnatural base pairs have been modified to eliminate their weak points, qualifying them for specific research needs. Moreover, the first attempts to create a semi-synthetic organism containing DNA with unnatural base pairs seem to have been successful. This further extends the possible applications of these kinds of pairs. Herein, we describe the most significant qualities of unnatural base pairs and their actual applications.},
  author       = {Mukba, S. A. and Vlasov, Petr and Kolosov, P. M. and Shuvalova, E. Y. and Egorova, T. V. and Alkalaeva, E. Z.},
  issn         = {1608-3245},
  journal      = {Molecular Biology},
  number       = {4},
  pages        = {475--484},
  publisher    = {Springer Nature},
  title        = {{Expanding the genetic code: Unnatural base pairs in biological systems}},
  doi          = {10.1134/S0026893320040111},
  volume       = {54},
  year         = {2020},
}

@article{8321,
  abstract     = {The genetic code is considered to use five nucleic bases (adenine, guanine, cytosine, thymine and uracil), which form two pairs for encoding information in DNA and two pairs for encoding information in RNA. Nevertheless, in recent years several artificial base pairs have been developed in attempts to expand the genetic code. Employment of these additional base pairs increases the information capacity and variety of DNA sequences, and provides a platform for the site-specific, enzymatic incorporation of extra functional components into DNA and RNA. As a result, of the development of such expanded systems, many artificial base pairs have been synthesized and tested under various conditions. Following many stages of enhancement, unnatural base pairs have been modified to eliminate their weak points, qualifying them for specific research needs. Moreover, the first attempts to create a semi-synthetic organism containing DNA with unnatural base pairs seem to have been successful. This further extends the possible applications of these kinds of pairs. Herein, we describe the most significant qualities of unnatural base pairs and their actual applications.},
  author       = {Mukba, S. A. and Vlasov, Petr and Kolosov, P. M. and Shuvalova, E. Y. and Egorova, T. V. and Alkalaeva, E. Z.},
  issn         = {0026-8984},
  journal      = {Molekuliarnaia biologiia},
  number       = {4},
  pages        = {531--541},
  publisher    = {Russian Academy of Sciences},
  title        = {{Expanding the genetic code: Unnatural base pairs in biological systems}},
  doi          = {10.31857/S0026898420040126},
  volume       = {54},
  year         = {2020},
}

@article{8323,
  author       = {Pach, János},
  issn         = {14320444},
  journal      = {Discrete and Computational Geometry},
  pages        = {571--574},
  publisher    = {Springer Nature},
  title        = {{A farewell to Ricky Pollack}},
  doi          = {10.1007/s00454-020-00237-5},
  volume       = {64},
  year         = {2020},
}

@inproceedings{8324,
  abstract     = {The notion of program sensitivity (aka Lipschitz continuity) specifies that changes in the program input result in proportional changes to the program output. For probabilistic programs the notion is naturally extended to expected sensitivity. A previous approach develops a relational program logic framework for proving expected sensitivity of probabilistic while loops, where the number of iterations is fixed and bounded. In this work, we consider probabilistic while loops where the number of iterations is not fixed, but randomized and depends on the initial input values. We present a sound approach for proving expected sensitivity of such programs. Our sound approach is martingale-based and can be automated through existing martingale-synthesis algorithms. Furthermore, our approach is compositional for sequential composition of while loops under a mild side condition. We demonstrate the effectiveness of our approach on several classical examples from Gambler's Ruin, stochastic hybrid systems and stochastic gradient descent. We also present experimental results showing that our automated approach can handle various probabilistic programs in the literature.},
  author       = {Wang, Peixin and Fu, Hongfei and Chatterjee, Krishnendu and Deng, Yuxin and Xu, Ming},
  booktitle    = {Proceedings of the ACM on Programming Languages},
  issn         = {2475-1421},
  number       = {POPL},
  publisher    = {ACM},
  title        = {{Proving expected sensitivity of probabilistic programs with randomized variable-dependent termination time}},
  doi          = {10.1145/3371093},
  volume       = {4},
  year         = {2020},
}

@article{8325,
  abstract     = {Let 𝐹:ℤ2→ℤ be the pointwise minimum of several linear functions. The theory of smoothing allows us to prove that under certain conditions there exists the pointwise minimal function among all integer-valued superharmonic functions coinciding with F “at infinity”. We develop such a theory to prove existence of so-called solitons (or strings) in a sandpile model, studied by S. Caracciolo, G. Paoletti, and A. Sportiello. Thus we made a step towards understanding the phenomena of the identity in the sandpile group for planar domains where solitons appear according to experiments. We prove that sandpile states, defined using our smoothing procedure, move changeless when we apply the wave operator (that is why we call them solitons), and can interact, forming triads and nodes. },
  author       = {Kalinin, Nikita and Shkolnikov, Mikhail},
  issn         = {1432-0916},
  journal      = {Communications in Mathematical Physics},
  number       = {9},
  pages        = {1649--1675},
  publisher    = {Springer Nature},
  title        = {{Sandpile solitons via smoothing of superharmonic functions}},
  doi          = {10.1007/s00220-020-03828-8},
  volume       = {378},
  year         = {2020},
}

@article{8329,
  abstract     = {We show the synthesis of a redox‐active quinone, 2‐methoxy‐1,4‐hydroquinone (MHQ), from a bio‐based feedstock and its suitability as electrolyte in aqueous redox flow batteries. We identified semiquinone intermediates at insufficiently low pH and quinoid radicals as responsible for decomposition of MHQ under electrochemical conditions. Both can be avoided and/or stabilized, respectively, using H 3 PO 4 electrolyte, allowing for reversible cycling in a redox flow battery for hundreds of cycles.},
  author       = {Schlemmer, Werner and Nothdurft, Philipp and Petzold, Alina and Frühwirt, Philipp and Schmallegger, Max and Gescheidt-Demner, Georg and Fischer, Roland and Freunberger, Stefan Alexander and Kern, Wolfgang and Spirk, Stefan},
  issn         = {1521-3773},
  journal      = {Angewandte Chemie International Edition},
  number       = {51},
  pages        = {22943--22946},
  publisher    = {Wiley},
  title        = {{2‐methoxyhydroquinone from vanillin for aqueous redox‐flow batteries}},
  doi          = {10.1002/anie.202008253},
  volume       = {59},
  year         = {2020},
}

@article{8361,
  abstract     = {With the lithium-ion technology approaching its intrinsic limit with graphite-based anodes, Li metal is recently receiving renewed interest from the battery community as potential high capacity anode for next-generation rechargeable batteries. In this focus paper, we review the main advances in this field since the first attempts in the mid-1970s. Strategies for enabling reversible cycling and avoiding dendrite growth are thoroughly discussed, including specific applications in all-solid-state (inorganic and polymeric), Lithium–Sulfur (Li–S) and Lithium-O2 (air) batteries. A particular attention is paid to recent developments of these battery technologies and their current state with respect to the 2030 targets of the EU Integrated Strategic Energy Technology Plan (SET-Plan) Action 7.},
  author       = {Varzi, Alberto and Thanner, Katharina and Scipioni, Roberto and Di Lecce, Daniele and Hassoun, Jusef and Dörfler, Susanne and Altheus, Holger and Kaskel, Stefan and Prehal, Christian and Freunberger, Stefan Alexander},
  issn         = {0378-7753},
  journal      = {Journal of Power Sources},
  number       = {12},
  publisher    = {Elsevier},
  title        = {{Current status and future perspectives of lithium metal batteries}},
  doi          = {10.1016/j.jpowsour.2020.228803},
  volume       = {480},
  year         = {2020},
}

@inproceedings{8383,
  abstract     = {We introduce extension-based proofs, a class of impossibility proofs that includes valency arguments. They are modelled as an interaction between a prover and a protocol. Using proofs based on combinatorial topology, it has been shown that it is impossible to deterministically solve k-set agreement among n > k ≥ 2 processes in a wait-free manner. However, it was unknown whether proofs based on simpler techniques were possible. We explain why this impossibility result cannot be obtained by an extension-based proof and, hence, extension-based proofs are limited in power.},
  author       = {Alistarh, Dan-Adrian and Aspnes, James and Ellen, Faith and Gelashvili, Rati and Zhu, Leqi},
  booktitle    = {Proceedings of the 39th Symposium on Principles of Distributed Computing},
  isbn         = {9781450375825},
  location     = {Virtual, Italy},
  pages        = {54--56},
  publisher    = {Association for Computing Machinery},
  title        = {{Brief Announcement: Why Extension-Based Proofs Fail}},
  doi          = {10.1145/3382734.3405743},
  year         = {2020},
}

@inproceedings{8533,
  abstract     = {Game of Life is a simple and elegant model to study dynamical system over networks. The model consists of a graph where every vertex has one of two types, namely, dead or alive. A configuration is a mapping of the vertices to the types. An update rule describes how the type of a vertex is updated given the types of its neighbors. In every round, all vertices are updated synchronously, which leads to a configuration update. While in general, Game of Life allows a broad range of update rules, we focus on two simple families of update rules, namely, underpopulation and overpopulation, that model several interesting dynamics studied in the literature. In both settings, a dead vertex requires at least a desired number of live neighbors to become alive. For underpopulation (resp., overpopulation), a live vertex requires at least (resp. at most) a desired number of live neighbors to remain alive. We study the basic computation problems, e.g., configuration reachability, for these two families of rules. For underpopulation rules, we show that these problems can be solved in polynomial time, whereas for overpopulation rules they are PSPACE-complete.},
  author       = {Chatterjee, Krishnendu and Ibsen-Jensen, Rasmus and Jecker, Ismael R and Svoboda, Jakub},
  booktitle    = {45th International Symposium on Mathematical Foundations of Computer Science},
  isbn         = {9783959771597},
  issn         = {1868-8969},
  location     = {Prague, Czech Republic},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  title        = {{Simplified game of life: Algorithms and complexity}},
  doi          = {10.4230/LIPIcs.MFCS.2020.22},
  volume       = {170},
  year         = {2020},
}

@inproceedings{8534,
  abstract     = {A regular language L of finite words is composite if there are regular languages L₁,L₂,…,L_t such that L = ⋂_{i = 1}^t L_i and the index (number of states in a minimal DFA) of every language L_i is strictly smaller than the index of L. Otherwise, L is prime. Primality of regular languages was introduced and studied in [O. Kupferman and J. Mosheiff, 2015], where the complexity of deciding the primality of the language of a given DFA was left open, with a doubly-exponential gap between the upper and lower bounds. We study primality for unary regular languages, namely regular languages with a singleton alphabet. A unary language corresponds to a subset of ℕ, making the study of unary prime languages closer to that of primality in number theory. We show that the setting of languages is richer. In particular, while every composite number is the product of two smaller numbers, the number t of languages necessary to decompose a composite unary language induces a strict hierarchy. In addition, a primality witness for a unary language L, namely a word that is not in L but is in all products of languages that contain L and have an index smaller than L’s, may be of exponential length. Still, we are able to characterize compositionality by structural properties of a DFA for L, leading to a LogSpace algorithm for primality checking of unary DFAs.},
  author       = {Jecker, Ismael R and Kupferman, Orna and Mazzocchi, Nicolas},
  booktitle    = {45th International Symposium on Mathematical Foundations of Computer Science},
  isbn         = {9783959771597},
  issn         = {1868-8969},
  location     = {Prague, Czech Republic},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  title        = {{Unary prime languages}},
  doi          = {10.4230/LIPIcs.MFCS.2020.51},
  volume       = {170},
  year         = {2020},
}

@inproceedings{8536,
  abstract     = {This work analyzes the latency of the simplified successive cancellation (SSC) decoding scheme for polar codes proposed by Alamdar-Yazdi and Kschischang. It is shown that, unlike conventional successive cancellation decoding, where latency is linear in the block length, the latency of SSC decoding is sublinear. More specifically, the latency of SSC decoding is O(N 1−1/µ ), where N is the block length and µ is the scaling exponent of the channel, which captures the speed of convergence of the rate to capacity. Numerical results demonstrate the tightness of the bound and show that most of the latency reduction arises from the parallel decoding of subcodes of rate 0 and 1.},
  author       = {Mondelli, Marco and Hashemi, Seyyed Ali and Cioffi, John and Goldsmith, Andrea},
  booktitle    = {IEEE International Symposium on Information Theory - Proceedings},
  isbn         = {9781728164328},
  issn         = {2157-8095},
  location     = {Los Angeles, CA, United States},
  publisher    = {IEEE},
  title        = {{Simplified successive cancellation decoding of polar codes has sublinear latency}},
  doi          = {10.1109/ISIT44484.2020.9174141},
  volume       = {2020-June},
  year         = {2020},
}

@article{8539,
  abstract     = {Cohomological and K-theoretic stable bases originated from the study of quantum cohomology and quantum K-theory. Restriction formula for cohomological stable bases played an important role in computing the quantum connection of cotangent bundle of partial flag varieties. In this paper we study the K-theoretic stable bases of cotangent bundles of flag varieties. We describe these bases in terms of the action of the affine Hecke algebra and the twisted group algebra of KostantKumar. Using this algebraic description and the method of root polynomials, we give a restriction formula of the stable bases. We apply it to obtain the restriction formula for partial flag varieties. We also build a relation between the stable basis and the Casselman basis in the principal series representations of the Langlands dual group. As an application, we give a closed formula for the transition matrix between Casselman basis and the characteristic functions.},
  author       = {Su, C. and Zhao, Gufang and Zhong, C.},
  issn         = {0012-9593},
  journal      = {Annales Scientifiques de l'Ecole Normale Superieure},
  number       = {3},
  pages        = {663--671},
  publisher    = {Société Mathématique de France},
  title        = {{On the K-theory stable bases of the springer resolution}},
  doi          = {10.24033/asens.2431},
  volume       = {53},
  year         = {2020},
}

@article{8568,
  abstract     = {Aqueous iodine based electrochemical energy storage is considered a potential candidate to improve sustainability and performance of current battery and supercapacitor technology. It harnesses the redox activity of iodide, iodine, and polyiodide species in the confined geometry of nanoporous carbon electrodes. However, current descriptions of the electrochemical reaction mechanism to interconvert these species are elusive. Here we show that electrochemical oxidation of iodide in nanoporous carbons forms persistent solid iodine deposits. Confinement slows down dissolution into triiodide and pentaiodide, responsible for otherwise significant self-discharge via shuttling. The main tools for these insights are in situ Raman spectroscopy and in situ small and wide-angle X-ray scattering (in situ SAXS/WAXS). In situ Raman confirms the reversible formation of triiodide and pentaiodide. In situ SAXS/WAXS indicates remarkable amounts of solid iodine deposited in the carbon nanopores. Combined with stochastic modeling, in situ SAXS allows quantifying the solid iodine volume fraction and visualizing the iodine structure on 3D lattice models at the sub-nanometer scale. Based on the derived mechanism, we demonstrate strategies for improved iodine pore filling capacity and prevention of self-discharge, applicable to hybrid supercapacitors and batteries.},
  author       = {Prehal, Christian and Fitzek, Harald and Kothleitner, Gerald and Presser, Volker and Gollas, Bernhard and Freunberger, Stefan Alexander and Abbas, Qamar},
  issn         = {2041-1723},
  journal      = {Nature Communications},
  keywords     = {General Biochemistry, Genetics and Molecular Biology, General Physics and Astronomy, General Chemistry},
  publisher    = {Springer Nature},
  title        = {{Persistent and reversible solid iodine electrodeposition in nanoporous carbons}},
  doi          = {10.1038/s41467-020-18610-6},
  volume       = {11},
  year         = {2020},
}

@inproceedings{8571,
  abstract     = {We present the results of a friendly competition for formal verification of continuous and hybrid systems with nonlinear continuous dynamics. The friendly competition took place as part of the workshop Applied Verification for Continuous and Hybrid Systems (ARCH) in 2020. This year, 6 tools Ariadne, CORA, DynIbex, Flow*, Isabelle/HOL, and JuliaReach (in alphabetic order) participated. These tools are applied to solve reachability analysis problems on six benchmark problems, two of them featuring hybrid dynamics. We do not rank the tools based on the results, but show the current status and discover the potential advantages of different tools.},
  author       = {Geretti, Luca and Alexandre Dit Sandretto, Julien and Althoff, Matthias and Benet, Luis and Chapoutot, Alexandre and Chen, Xin and Collins, Pieter and Forets, Marcelo and Freire, Daniel and Immler, Fabian and Kochdumper, Niklas and Sanders, David and Schilling, Christian},
  booktitle    = {EPiC Series in Computing},
  pages        = {49--75},
  publisher    = {EasyChair},
  title        = {{ARCH-COMP20 Category Report: Continuous and hybrid systems with nonlinear dynamics}},
  doi          = {10.29007/zkf6},
  volume       = {74},
  year         = {2020},
}

@inproceedings{8572,
  abstract     = {We present the results of the ARCH 2020 friendly competition for formal verification of continuous and hybrid systems with linear continuous dynamics. In its fourth edition, eight tools have been applied to solve eight different benchmark problems in the category for linear continuous dynamics (in alphabetical order): CORA, C2E2, HyDRA, Hylaa, Hylaa-Continuous, JuliaReach, SpaceEx, and XSpeed. This report is a snapshot of the current landscape of tools and the types of benchmarks they are particularly suited for. Due to the diversity of problems, we are not ranking tools, yet the presented results provide one of the most complete assessments of tools for the safety verification of continuous and hybrid systems with linear continuous dynamics up to this date.},
  author       = {Althoff, Matthias and Bak, Stanley and Bao, Zongnan and Forets, Marcelo and Frehse, Goran and Freire, Daniel and Kochdumper, Niklas and Li, Yangge and Mitra, Sayan and Ray, Rajarshi and Schilling, Christian and Schupp, Stefan and Wetzlinger, Mark},
  booktitle    = {EPiC Series in Computing},
  pages        = {16--48},
  publisher    = {EasyChair},
  title        = {{ARCH-COMP20 Category Report: Continuous and hybrid systems with linear dynamics}},
  doi          = {10.29007/7dt2},
  volume       = {74},
  year         = {2020},
}

@inproceedings{8580,
  abstract     = {We evaluate the usefulness of persistent homology in the analysis of heart rate variability. In our approach we extract several topological descriptors characterising datasets of RR-intervals, which are later used in classical machine learning algorithms. By this method we are able to differentiate the group of patients with the history of transient ischemic attack and the group of hypertensive patients.},
  author       = {Graff, Grzegorz and Graff, Beata and Jablonski, Grzegorz and Narkiewicz, Krzysztof},
  booktitle    = {11th Conference of the European Study Group on Cardiovascular Oscillations: Computation and Modelling in Physiology: New Challenges and Opportunities, },
  isbn         = {9781728157511},
  location     = {Pisa, Italy},
  publisher    = {IEEE},
  title        = {{The application of persistent homology in the analysis of heart rate variability}},
  doi          = {10.1109/ESGCO49734.2020.9158054},
  year         = {2020},
}