--- _id: '8268' abstract: - lang: eng text: '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.' acknowledgement: The authors would like to thank Dr. Michiel Brentjens at the Netherlands Institute for Radio Astronomy (ASTRON) for providing radio interferometer data and Dr. Josip Marjanovic and Dr. Franciszek Hennel at the Magnetic Resonance Technology of ETH Zurich for providing their insights on the experiments. CZ and the DS3Lab gratefully acknowledge the support from the Swiss Data Science Center, Alibaba, Google Focused Research Awards, Huawei, MeteoSwiss, Oracle Labs, Swisscom, Zurich Insurance, Chinese Scholarship Council, and the Department of Computer Science at ETH Zurich. article_processing_charge: No article_type: original arxiv: 1 author: - first_name: Nezihe Merve full_name: Gurel, Nezihe Merve last_name: Gurel - first_name: Kaan full_name: Kara, Kaan last_name: Kara - first_name: Alen full_name: Stojanov, Alen last_name: Stojanov - first_name: Tyler full_name: Smith, Tyler last_name: Smith - first_name: Thomas full_name: Lemmin, Thomas last_name: Lemmin - first_name: Dan-Adrian full_name: Alistarh, Dan-Adrian id: 4A899BFC-F248-11E8-B48F-1D18A9856A87 last_name: Alistarh orcid: 0000-0003-3650-940X - first_name: Markus full_name: Puschel, Markus last_name: Puschel - first_name: Ce full_name: Zhang, Ce last_name: Zhang citation: ama: 'Gurel NM, Kara K, Stojanov A, et al. Compressive sensing using iterative hard thresholding with low precision data representation: Theory and applications. IEEE Transactions on Signal Processing. 2020;68:4268-4282. doi:10.1109/TSP.2020.3010355' apa: 'Gurel, N. M., Kara, K., Stojanov, A., Smith, T., Lemmin, T., Alistarh, D.-A., … Zhang, C. (2020). Compressive sensing using iterative hard thresholding with low precision data representation: Theory and applications. IEEE Transactions on Signal Processing. IEEE. https://doi.org/10.1109/TSP.2020.3010355' chicago: 'Gurel, Nezihe Merve, Kaan Kara, Alen Stojanov, Tyler Smith, Thomas Lemmin, Dan-Adrian Alistarh, Markus Puschel, and Ce Zhang. “Compressive Sensing Using Iterative Hard Thresholding with Low Precision Data Representation: Theory and Applications.” IEEE Transactions on Signal Processing. IEEE, 2020. https://doi.org/10.1109/TSP.2020.3010355.' ieee: 'N. M. Gurel et al., “Compressive sensing using iterative hard thresholding with low precision data representation: Theory and applications,” IEEE Transactions on Signal Processing, vol. 68. IEEE, pp. 4268–4282, 2020.' ista: 'Gurel NM, Kara K, Stojanov A, Smith T, Lemmin T, Alistarh D-A, Puschel M, Zhang C. 2020. Compressive sensing using iterative hard thresholding with low precision data representation: Theory and applications. IEEE Transactions on Signal Processing. 68, 4268–4282.' mla: 'Gurel, Nezihe Merve, et al. “Compressive Sensing Using Iterative Hard Thresholding with Low Precision Data Representation: Theory and Applications.” IEEE Transactions on Signal Processing, vol. 68, IEEE, 2020, pp. 4268–82, doi:10.1109/TSP.2020.3010355.' short: N.M. Gurel, K. Kara, A. Stojanov, T. Smith, T. Lemmin, D.-A. Alistarh, M. Puschel, C. Zhang, IEEE Transactions on Signal Processing 68 (2020) 4268–4282. date_created: 2020-08-16T22:00:56Z date_published: 2020-07-20T00:00:00Z date_updated: 2025-07-10T11:55:10Z day: '20' department: - _id: DaAl doi: 10.1109/TSP.2020.3010355 external_id: arxiv: - '1802.04907' isi: - '000562044500001' intvolume: ' 68' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1802.04907 month: '07' oa: 1 oa_version: Preprint page: 4268-4282 publication: IEEE Transactions on Signal Processing publication_identifier: eissn: - 1941-0476 issn: - 1053-587X publication_status: published publisher: IEEE quality_controlled: '1' scopus_import: '1' status: public title: 'Compressive sensing using iterative hard thresholding with low precision data representation: Theory and applications' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 68 year: '2020' ... --- OA_place: publisher OA_type: free access _id: '8271' acknowledgement: We thank Dr. Gai Huang for his comments and help. We apologize to authors whose work could not be cited due to space limitation. No conflict of interest declared. article_processing_charge: No article_type: original author: - first_name: Peng full_name: He, Peng last_name: He - first_name: Yuzhou full_name: Zhang, Yuzhou id: 3B6137F2-F248-11E8-B48F-1D18A9856A87 last_name: Zhang orcid: 0000-0003-2627-6956 - first_name: Guanghui full_name: Xiao, Guanghui last_name: Xiao citation: ama: He P, Zhang Y, Xiao G. Origin of a subgenome and genome evolution of allotetraploid cotton species. Molecular Plant. 2020;13(9):1238-1240. doi:10.1016/j.molp.2020.07.006 apa: He, P., Zhang, Y., & Xiao, G. (2020). Origin of a subgenome and genome evolution of allotetraploid cotton species. Molecular Plant. Elsevier. https://doi.org/10.1016/j.molp.2020.07.006 chicago: He, Peng, Yuzhou Zhang, and Guanghui Xiao. “Origin of a Subgenome and Genome Evolution of Allotetraploid Cotton Species.” Molecular Plant. Elsevier, 2020. https://doi.org/10.1016/j.molp.2020.07.006. ieee: P. He, Y. Zhang, and G. Xiao, “Origin of a subgenome and genome evolution of allotetraploid cotton species,” Molecular Plant, vol. 13, no. 9. Elsevier, pp. 1238–1240, 2020. ista: He P, Zhang Y, Xiao G. 2020. Origin of a subgenome and genome evolution of allotetraploid cotton species. Molecular Plant. 13(9), 1238–1240. mla: He, Peng, et al. “Origin of a Subgenome and Genome Evolution of Allotetraploid Cotton Species.” Molecular Plant, vol. 13, no. 9, Elsevier, 2020, pp. 1238–40, doi:10.1016/j.molp.2020.07.006. short: P. He, Y. Zhang, G. Xiao, Molecular Plant 13 (2020) 1238–1240. date_created: 2020-08-16T22:00:57Z date_published: 2020-09-07T00:00:00Z date_updated: 2025-06-25T07:51:18Z day: '07' department: - _id: JiFr doi: 10.1016/j.molp.2020.07.006 external_id: isi: - '000566895400007' pmid: - '32688032' intvolume: ' 13' isi: 1 issue: '9' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1016/j.molp.2020.07.006 month: '09' oa: 1 oa_version: Published Version page: 1238-1240 pmid: 1 publication: Molecular Plant publication_identifier: eissn: - 1752-9867 issn: - 1674-2052 publication_status: published publisher: Elsevier quality_controlled: '1' scopus_import: '1' status: public title: Origin of a subgenome and genome evolution of allotetraploid cotton species type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 13 year: '2020' ... --- _id: '8285' abstract: - lang: eng text: 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. acknowledgement: This work is supported by the Office of Naval Research (N00014-16-1-2927- A00003), Vannevar Bush Faculty Fellowship (N00014-16-1-2812- P00005), Department of Energy (DE-SC0019174- 0001), and Defense Threat Reduction Agency (HDTRA1-15-1-0017- P00005). article_number: '043202' article_processing_charge: No article_type: original arxiv: 1 author: - first_name: Benjamin K. full_name: Malia, Benjamin K. last_name: Malia - first_name: Julián full_name: Martínez-Rincón, Julián last_name: Martínez-Rincón - first_name: Yunfan full_name: Wu, Yunfan last_name: Wu - first_name: Onur full_name: Hosten, Onur id: 4C02D85E-F248-11E8-B48F-1D18A9856A87 last_name: Hosten orcid: 0000-0002-2031-204X - first_name: Mark A. full_name: Kasevich, Mark A. last_name: Kasevich citation: ama: Malia BK, Martínez-Rincón J, Wu Y, Hosten O, Kasevich MA. Free space Ramsey spectroscopy in rubidium with noise below the quantum projection limit. Physical Review Letters. 2020;125(4). doi:10.1103/PhysRevLett.125.043202 apa: Malia, B. K., Martínez-Rincón, J., Wu, Y., Hosten, O., & Kasevich, M. A. (2020). Free space Ramsey spectroscopy in rubidium with noise below the quantum projection limit. Physical Review Letters. American Physical Society. https://doi.org/10.1103/PhysRevLett.125.043202 chicago: Malia, Benjamin K., Julián Martínez-Rincón, Yunfan Wu, Onur Hosten, and Mark A. Kasevich. “Free Space Ramsey Spectroscopy in Rubidium with Noise below the Quantum Projection Limit.” Physical Review Letters. American Physical Society, 2020. https://doi.org/10.1103/PhysRevLett.125.043202. ieee: B. K. Malia, J. Martínez-Rincón, Y. Wu, O. Hosten, and M. A. Kasevich, “Free space Ramsey spectroscopy in rubidium with noise below the quantum projection limit,” Physical Review Letters, vol. 125, no. 4. American Physical Society, 2020. ista: Malia BK, Martínez-Rincón J, Wu Y, Hosten O, Kasevich MA. 2020. Free space Ramsey spectroscopy in rubidium with noise below the quantum projection limit. Physical Review Letters. 125(4), 043202. mla: Malia, Benjamin K., et al. “Free Space Ramsey Spectroscopy in Rubidium with Noise below the Quantum Projection Limit.” Physical Review Letters, vol. 125, no. 4, 043202, American Physical Society, 2020, doi:10.1103/PhysRevLett.125.043202. short: B.K. Malia, J. Martínez-Rincón, Y. Wu, O. Hosten, M.A. Kasevich, Physical Review Letters 125 (2020). date_created: 2020-08-24T06:24:04Z date_published: 2020-07-24T00:00:00Z date_updated: 2023-10-18T08:38:35Z day: '24' department: - _id: OnHo doi: 10.1103/PhysRevLett.125.043202 external_id: arxiv: - '1912.10218' isi: - '000552227400008' pmid: - '32794788' intvolume: ' 125' isi: 1 issue: '4' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1912.10218 month: '07' oa: 1 oa_version: Preprint pmid: 1 publication: Physical Review Letters publication_identifier: eissn: - 1079-7114 issn: - 0031-9007 publication_status: published publisher: American Physical Society quality_controlled: '1' scopus_import: '1' status: public title: Free space Ramsey spectroscopy in rubidium with noise below the quantum projection limit type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 125 year: '2020' ... --- _id: '8319' abstract: - lang: eng text: 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. acknowledgement: We thank N. Engelsen for comments on the manuscript. This work was supported by the Office of Naval Research, Vannevar Bush Faculty Fellowship, Department of Energy, and Defense Threat Reduction Agency. R.K. was partly supported by the AQT/INQNET program at Caltech. article_number: '012224' article_processing_charge: No article_type: original arxiv: 1 author: - first_name: Yunfan full_name: Wu, Yunfan last_name: Wu - first_name: Rajiv full_name: Krishnakumar, Rajiv last_name: Krishnakumar - first_name: Julián full_name: Martínez-Rincón, Julián last_name: Martínez-Rincón - first_name: Benjamin K. full_name: Malia, Benjamin K. last_name: Malia - first_name: Onur full_name: Hosten, Onur id: 4C02D85E-F248-11E8-B48F-1D18A9856A87 last_name: Hosten orcid: 0000-0002-2031-204X - first_name: Mark A. full_name: Kasevich, Mark A. last_name: Kasevich citation: ama: Wu Y, Krishnakumar R, Martínez-Rincón J, Malia BK, Hosten O, Kasevich MA. Retrieval of cavity-generated atomic spin squeezing after free-space release. Physical Review A. 2020;102(1). doi:10.1103/PhysRevA.102.012224 apa: Wu, Y., Krishnakumar, R., Martínez-Rincón, J., Malia, B. K., Hosten, O., & Kasevich, M. A. (2020). Retrieval of cavity-generated atomic spin squeezing after free-space release. Physical Review A. American Physical Society. https://doi.org/10.1103/PhysRevA.102.012224 chicago: Wu, Yunfan, Rajiv Krishnakumar, Julián Martínez-Rincón, Benjamin K. Malia, Onur Hosten, and Mark A. Kasevich. “Retrieval of Cavity-Generated Atomic Spin Squeezing after Free-Space Release.” Physical Review A. American Physical Society, 2020. https://doi.org/10.1103/PhysRevA.102.012224. ieee: Y. Wu, R. Krishnakumar, J. Martínez-Rincón, B. K. Malia, O. Hosten, and M. A. Kasevich, “Retrieval of cavity-generated atomic spin squeezing after free-space release,” Physical Review A, vol. 102, no. 1. American Physical Society, 2020. ista: Wu Y, Krishnakumar R, Martínez-Rincón J, Malia BK, Hosten O, Kasevich MA. 2020. Retrieval of cavity-generated atomic spin squeezing after free-space release. Physical Review A. 102(1), 012224. mla: Wu, Yunfan, et al. “Retrieval of Cavity-Generated Atomic Spin Squeezing after Free-Space Release.” Physical Review A, vol. 102, no. 1, 012224, American Physical Society, 2020, doi:10.1103/PhysRevA.102.012224. short: Y. Wu, R. Krishnakumar, J. Martínez-Rincón, B.K. Malia, O. Hosten, M.A. Kasevich, Physical Review A 102 (2020). date_created: 2020-08-30T22:01:10Z date_published: 2020-07-30T00:00:00Z date_updated: 2025-07-10T11:55:14Z day: '30' department: - _id: OnHo doi: 10.1103/PhysRevA.102.012224 external_id: arxiv: - '1912.08334' isi: - '000555104200011' intvolume: ' 102' isi: 1 issue: '1' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1912.08334 month: '07' oa: 1 oa_version: Preprint publication: Physical Review A publication_identifier: eissn: - 2469-9934 issn: - 2469-9926 publication_status: published publisher: American Physical Society quality_controlled: '1' scopus_import: '1' status: public title: Retrieval of cavity-generated atomic spin squeezing after free-space release type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 102 year: '2020' ... --- _id: '8320' abstract: - lang: eng text: 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. acknowledgement: We would like to thank our co-workers and members of the Alkalaeva lab for participating in discussions about the topics covered in this essay. article_processing_charge: No article_type: original author: - first_name: S. A. full_name: Mukba, S. A. last_name: Mukba - first_name: Petr full_name: Vlasov, Petr id: 38BB9AC4-F248-11E8-B48F-1D18A9856A87 last_name: Vlasov - first_name: P. M. full_name: Kolosov, P. M. last_name: Kolosov - first_name: E. Y. full_name: Shuvalova, E. Y. last_name: Shuvalova - first_name: T. V. full_name: Egorova, T. V. last_name: Egorova - first_name: E. Z. full_name: Alkalaeva, E. Z. last_name: Alkalaeva citation: ama: 'Mukba SA, Vlasov P, Kolosov PM, Shuvalova EY, Egorova TV, Alkalaeva EZ. Expanding the genetic code: Unnatural base pairs in biological systems. Molecular Biology. 2020;54(4):475-484. doi:10.1134/S0026893320040111' apa: 'Mukba, S. A., Vlasov, P., Kolosov, P. M., Shuvalova, E. Y., Egorova, T. V., & Alkalaeva, E. Z. (2020). Expanding the genetic code: Unnatural base pairs in biological systems. Molecular Biology. Springer Nature. https://doi.org/10.1134/S0026893320040111' chicago: 'Mukba, S. A., Petr Vlasov, P. M. Kolosov, E. Y. Shuvalova, T. V. Egorova, and E. Z. Alkalaeva. “Expanding the Genetic Code: Unnatural Base Pairs in Biological Systems.” Molecular Biology. Springer Nature, 2020. https://doi.org/10.1134/S0026893320040111.' ieee: 'S. A. Mukba, P. Vlasov, P. M. Kolosov, E. Y. Shuvalova, T. V. Egorova, and E. Z. Alkalaeva, “Expanding the genetic code: Unnatural base pairs in biological systems,” Molecular Biology, vol. 54, no. 4. Springer Nature, pp. 475–484, 2020.' ista: 'Mukba SA, Vlasov P, Kolosov PM, Shuvalova EY, Egorova TV, Alkalaeva EZ. 2020. Expanding the genetic code: Unnatural base pairs in biological systems. Molecular Biology. 54(4), 475–484.' mla: 'Mukba, S. A., et al. “Expanding the Genetic Code: Unnatural Base Pairs in Biological Systems.” Molecular Biology, vol. 54, no. 4, Springer Nature, 2020, pp. 475–84, doi:10.1134/S0026893320040111.' short: S.A. Mukba, P. Vlasov, P.M. Kolosov, E.Y. Shuvalova, T.V. Egorova, E.Z. Alkalaeva, Molecular Biology 54 (2020) 475–484. date_created: 2020-08-30T22:01:11Z date_published: 2020-08-19T00:00:00Z date_updated: 2025-07-10T11:57:02Z day: '19' department: - _id: FyKo doi: 10.1134/S0026893320040111 external_id: isi: - '000562110300001' intvolume: ' 54' isi: 1 issue: '4' language: - iso: eng month: '08' oa_version: None page: 475-484 publication: Molecular Biology publication_identifier: eissn: - 1608-3245 issn: - 0026-8933 publication_status: published publisher: Springer Nature quality_controlled: '1' related_material: record: - id: '8321' relation: original status: public scopus_import: '1' status: public title: 'Expanding the genetic code: Unnatural base pairs in biological systems' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 54 year: '2020' ... --- _id: '8321' abstract: - lang: eng text: 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. article_processing_charge: No article_type: original author: - first_name: S. A. full_name: Mukba, S. A. last_name: Mukba - first_name: Petr full_name: Vlasov, Petr id: 38BB9AC4-F248-11E8-B48F-1D18A9856A87 last_name: Vlasov - first_name: P. M. full_name: Kolosov, P. M. last_name: Kolosov - first_name: E. Y. full_name: Shuvalova, E. Y. last_name: Shuvalova - first_name: T. V. full_name: Egorova, T. V. last_name: Egorova - first_name: E. Z. full_name: Alkalaeva, E. Z. last_name: Alkalaeva citation: ama: 'Mukba SA, Vlasov P, Kolosov PM, Shuvalova EY, Egorova TV, Alkalaeva EZ. Expanding the genetic code: Unnatural base pairs in biological systems. Molekuliarnaia biologiia. 2020;54(4):531-541. doi:10.31857/S0026898420040126' apa: 'Mukba, S. A., Vlasov, P., Kolosov, P. M., Shuvalova, E. Y., Egorova, T. V., & Alkalaeva, E. Z. (2020). Expanding the genetic code: Unnatural base pairs in biological systems. Molekuliarnaia biologiia. Russian Academy of Sciences. https://doi.org/10.31857/S0026898420040126' chicago: 'Mukba, S. A., Petr Vlasov, P. M. Kolosov, E. Y. Shuvalova, T. V. Egorova, and E. Z. Alkalaeva. “Expanding the genetic code: Unnatural base pairs in biological systems.” Molekuliarnaia biologiia. Russian Academy of Sciences, 2020. https://doi.org/10.31857/S0026898420040126.' ieee: 'S. A. Mukba, P. Vlasov, P. M. Kolosov, E. Y. Shuvalova, T. V. Egorova, and E. Z. Alkalaeva, “Expanding the genetic code: Unnatural base pairs in biological systems,” Molekuliarnaia biologiia, vol. 54, no. 4. Russian Academy of Sciences, pp. 531–541, 2020.' ista: 'Mukba SA, Vlasov P, Kolosov PM, Shuvalova EY, Egorova TV, Alkalaeva EZ. 2020. Expanding the genetic code: Unnatural base pairs in biological systems. Molekuliarnaia biologiia. 54(4), 531–541.' mla: 'Mukba, S. A., et al. “Expanding the genetic code: Unnatural base pairs in biological systems.” Molekuliarnaia biologiia, vol. 54, no. 4, Russian Academy of Sciences, 2020, pp. 531–41, doi:10.31857/S0026898420040126.' short: S.A. Mukba, P. Vlasov, P.M. Kolosov, E.Y. Shuvalova, T.V. Egorova, E.Z. Alkalaeva, Molekuliarnaia biologiia 54 (2020) 531–541. date_created: 2020-08-30T22:01:11Z date_published: 2020-07-01T00:00:00Z date_updated: 2025-07-10T11:57:03Z day: '01' department: - _id: FyKo doi: 10.31857/S0026898420040126 external_id: pmid: - '32799218' intvolume: ' 54' issue: '4' language: - iso: rus month: '07' oa_version: None page: 531-541 pmid: 1 publication: Molekuliarnaia biologiia publication_identifier: issn: - 0026-8984 publication_status: published publisher: Russian Academy of Sciences quality_controlled: '1' related_material: record: - id: '8320' relation: translation status: public scopus_import: '1' status: public title: 'Expanding the genetic code: Unnatural base pairs in biological systems' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 54 year: '2020' ... --- _id: '8323' article_processing_charge: No article_type: letter_note author: - first_name: János full_name: Pach, János id: E62E3130-B088-11EA-B919-BF823C25FEA4 last_name: Pach citation: ama: Pach J. A farewell to Ricky Pollack. Discrete and Computational Geometry. 2020;64:571-574. doi:10.1007/s00454-020-00237-5 apa: Pach, J. (2020). A farewell to Ricky Pollack. Discrete and Computational Geometry. Springer Nature. https://doi.org/10.1007/s00454-020-00237-5 chicago: Pach, János. “A Farewell to Ricky Pollack.” Discrete and Computational Geometry. Springer Nature, 2020. https://doi.org/10.1007/s00454-020-00237-5. ieee: J. Pach, “A farewell to Ricky Pollack,” Discrete and Computational Geometry, vol. 64. Springer Nature, pp. 571–574, 2020. ista: Pach J. 2020. A farewell to Ricky Pollack. Discrete and Computational Geometry. 64, 571–574. mla: Pach, János. “A Farewell to Ricky Pollack.” Discrete and Computational Geometry, vol. 64, Springer Nature, 2020, pp. 571–74, doi:10.1007/s00454-020-00237-5. short: J. Pach, Discrete and Computational Geometry 64 (2020) 571–574. corr_author: '1' date_created: 2020-08-30T22:01:12Z date_published: 2020-10-01T00:00:00Z date_updated: 2024-10-09T20:59:55Z day: '01' department: - _id: HeEd doi: 10.1007/s00454-020-00237-5 external_id: isi: - '000561483500001' intvolume: ' 64' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1007/s00454-020-00237-5 month: '10' oa: 1 oa_version: None page: 571-574 publication: Discrete and Computational Geometry publication_identifier: eissn: - '14320444' issn: - '01795376' publication_status: published publisher: Springer Nature scopus_import: '1' status: public title: A farewell to Ricky Pollack type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 64 year: '2020' ... --- _id: '8324' abstract: - lang: eng text: 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. acknowledgement: We thank anonymous reviewers for helpful comments, especially for pointing to us a scenario of piecewise-linear approximation (Remark5). The research was partially supported by the National Natural Science Foundation of China (NSFC) under Grant No. 61802254, 61672229, 61832015,61772336,11871221 and Austrian Science Fund (FWF) NFN under Grant No. S11407-N23 (RiSE/SHiNE). We thank Prof. Yuxi Fu, director of the BASICS Lab at Shanghai Jiao Tong University, for his support. article_number: '25' article_processing_charge: No arxiv: 1 author: - first_name: Peixin full_name: Wang, Peixin last_name: Wang - first_name: Hongfei full_name: Fu, Hongfei last_name: Fu - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Yuxin full_name: Deng, Yuxin last_name: Deng - first_name: Ming full_name: Xu, Ming last_name: Xu citation: ama: 'Wang P, Fu H, Chatterjee K, Deng Y, Xu M. Proving expected sensitivity of probabilistic programs with randomized variable-dependent termination time. In: Proceedings of the ACM on Programming Languages. Vol 4. ACM; 2020. doi:10.1145/3371093' apa: Wang, P., Fu, H., Chatterjee, K., Deng, Y., & Xu, M. (2020). Proving expected sensitivity of probabilistic programs with randomized variable-dependent termination time. In Proceedings of the ACM on Programming Languages (Vol. 4). ACM. https://doi.org/10.1145/3371093 chicago: Wang, Peixin, Hongfei Fu, Krishnendu Chatterjee, Yuxin Deng, and Ming Xu. “Proving Expected Sensitivity of Probabilistic Programs with Randomized Variable-Dependent Termination Time.” In Proceedings of the ACM on Programming Languages, Vol. 4. ACM, 2020. https://doi.org/10.1145/3371093. ieee: P. Wang, H. Fu, K. Chatterjee, Y. Deng, and M. Xu, “Proving expected sensitivity of probabilistic programs with randomized variable-dependent termination time,” in Proceedings of the ACM on Programming Languages, 2020, vol. 4, no. POPL. ista: Wang P, Fu H, Chatterjee K, Deng Y, Xu M. 2020. Proving expected sensitivity of probabilistic programs with randomized variable-dependent termination time. Proceedings of the ACM on Programming Languages. vol. 4, 25. mla: Wang, Peixin, et al. “Proving Expected Sensitivity of Probabilistic Programs with Randomized Variable-Dependent Termination Time.” Proceedings of the ACM on Programming Languages, vol. 4, no. POPL, 25, ACM, 2020, doi:10.1145/3371093. short: P. Wang, H. Fu, K. Chatterjee, Y. Deng, M. Xu, in:, Proceedings of the ACM on Programming Languages, ACM, 2020. date_created: 2020-08-30T22:01:12Z date_published: 2020-01-01T00:00:00Z date_updated: 2025-04-15T06:30:10Z day: '01' ddc: - '004' department: - _id: KrCh doi: 10.1145/3371093 external_id: arxiv: - '1902.04744' file: - access_level: open_access checksum: c6193d109ff4ecb17e7a6513d8eb34c0 content_type: application/pdf creator: cziletti date_created: 2020-09-01T11:12:58Z date_updated: 2020-09-01T11:12:58Z file_id: '8328' file_name: 2019_ACM_POPL_Wang.pdf file_size: 564151 relation: main_file success: 1 file_date_updated: 2020-09-01T11:12:58Z has_accepted_license: '1' intvolume: ' 4' issue: POPL language: - iso: eng month: '01' oa: 1 oa_version: Published Version project: - _id: 25863FF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11407 name: Game Theory publication: Proceedings of the ACM on Programming Languages publication_identifier: eissn: - 2475-1421 publication_status: published publisher: ACM quality_controlled: '1' related_material: link: - relation: software url: https://doi.org/10.5281/zenodo.3533633 scopus_import: '1' status: public title: Proving expected sensitivity of probabilistic programs with randomized variable-dependent termination time tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 4 year: '2020' ... --- _id: '8325' abstract: - lang: eng text: "Let \U0001D439:ℤ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. " acknowledgement: We thank Andrea Sportiello for sharing his insights on perturbative regimes of the Abelian sandpile model which was the starting point of our work. We also thank Grigory Mikhalkin, who encouraged us to approach this problem. We thank an anonymous referee. Also we thank Misha Khristoforov and Sergey Lanzat who participated on the initial state of this project, when we had nothing except the computer simulation and pictures. We thank Mikhail Raskin for providing us the code on Golly for faster simulations. Ilia Zharkov, Ilia Itenberg, Kristin Shaw, Max Karev, Lionel Levine, Ernesto Lupercio, Pavol Ševera, Yulieth Prieto, Michael Polyak, Danila Cherkashin asked us a lot of questions and listened to us; not all of their questions found answers here, but we are going to treat them in subsequent papers. article_processing_charge: No article_type: original arxiv: 1 author: - first_name: Nikita full_name: Kalinin, Nikita last_name: Kalinin - first_name: Mikhail full_name: Shkolnikov, Mikhail id: 35084A62-F248-11E8-B48F-1D18A9856A87 last_name: Shkolnikov orcid: 0000-0002-4310-178X citation: ama: Kalinin N, Shkolnikov M. Sandpile solitons via smoothing of superharmonic functions. Communications in Mathematical Physics. 2020;378(9):1649-1675. doi:10.1007/s00220-020-03828-8 apa: Kalinin, N., & Shkolnikov, M. (2020). Sandpile solitons via smoothing of superharmonic functions. Communications in Mathematical Physics. Springer Nature. https://doi.org/10.1007/s00220-020-03828-8 chicago: Kalinin, Nikita, and Mikhail Shkolnikov. “Sandpile Solitons via Smoothing of Superharmonic Functions.” Communications in Mathematical Physics. Springer Nature, 2020. https://doi.org/10.1007/s00220-020-03828-8. ieee: N. Kalinin and M. Shkolnikov, “Sandpile solitons via smoothing of superharmonic functions,” Communications in Mathematical Physics, vol. 378, no. 9. Springer Nature, pp. 1649–1675, 2020. ista: Kalinin N, Shkolnikov M. 2020. Sandpile solitons via smoothing of superharmonic functions. Communications in Mathematical Physics. 378(9), 1649–1675. mla: Kalinin, Nikita, and Mikhail Shkolnikov. “Sandpile Solitons via Smoothing of Superharmonic Functions.” Communications in Mathematical Physics, vol. 378, no. 9, Springer Nature, 2020, pp. 1649–75, doi:10.1007/s00220-020-03828-8. short: N. Kalinin, M. Shkolnikov, Communications in Mathematical Physics 378 (2020) 1649–1675. date_created: 2020-08-30T22:01:13Z date_published: 2020-09-01T00:00:00Z date_updated: 2025-07-10T11:57:03Z day: '01' department: - _id: TaHa doi: 10.1007/s00220-020-03828-8 ec_funded: 1 external_id: arxiv: - '1711.04285' isi: - '000560620600001' intvolume: ' 378' isi: 1 issue: '9' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1711.04285 month: '09' oa: 1 oa_version: Preprint page: 1649-1675 project: - _id: 25681D80-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '291734' name: International IST Postdoc Fellowship Programme publication: Communications in Mathematical Physics publication_identifier: eissn: - 1432-0916 issn: - 0010-3616 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: Sandpile solitons via smoothing of superharmonic functions type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 378 year: '2020' ... --- _id: '8329' abstract: - lang: eng text: 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. acknowledgement: The Austrian Research Promotion Agency (FFG) is gratefully acknowledged for financial support of the project LignoBatt (860429). article_processing_charge: No article_type: original author: - first_name: Werner full_name: Schlemmer, Werner last_name: Schlemmer - first_name: Philipp full_name: Nothdurft, Philipp last_name: Nothdurft - first_name: Alina full_name: Petzold, Alina last_name: Petzold - first_name: Philipp full_name: Frühwirt, Philipp last_name: Frühwirt - first_name: Max full_name: Schmallegger, Max last_name: Schmallegger - first_name: Georg full_name: Gescheidt-Demner, Georg last_name: Gescheidt-Demner - first_name: Roland full_name: Fischer, Roland last_name: Fischer - first_name: Stefan Alexander full_name: Freunberger, Stefan Alexander id: A8CA28E6-CE23-11E9-AD2D-EC27E6697425 last_name: Freunberger orcid: 0000-0003-2902-5319 - first_name: Wolfgang full_name: Kern, Wolfgang last_name: Kern - first_name: Stefan full_name: Spirk, Stefan last_name: Spirk citation: ama: Schlemmer W, Nothdurft P, Petzold A, et al. 2‐methoxyhydroquinone from vanillin for aqueous redox‐flow batteries. Angewandte Chemie International Edition. 2020;59(51):22943-22946. doi:10.1002/anie.202008253 apa: Schlemmer, W., Nothdurft, P., Petzold, A., Frühwirt, P., Schmallegger, M., Gescheidt-Demner, G., … Spirk, S. (2020). 2‐methoxyhydroquinone from vanillin for aqueous redox‐flow batteries. Angewandte Chemie International Edition. Wiley. https://doi.org/10.1002/anie.202008253 chicago: Schlemmer, Werner, Philipp Nothdurft, Alina Petzold, Philipp Frühwirt, Max Schmallegger, Georg Gescheidt-Demner, Roland Fischer, Stefan Alexander Freunberger, Wolfgang Kern, and Stefan Spirk. “2‐methoxyhydroquinone from Vanillin for Aqueous Redox‐flow Batteries.” Angewandte Chemie International Edition. Wiley, 2020. https://doi.org/10.1002/anie.202008253. ieee: W. Schlemmer et al., “2‐methoxyhydroquinone from vanillin for aqueous redox‐flow batteries,” Angewandte Chemie International Edition, vol. 59, no. 51. Wiley, pp. 22943–22946, 2020. ista: Schlemmer W, Nothdurft P, Petzold A, Frühwirt P, Schmallegger M, Gescheidt-Demner G, Fischer R, Freunberger SA, Kern W, Spirk S. 2020. 2‐methoxyhydroquinone from vanillin for aqueous redox‐flow batteries. Angewandte Chemie International Edition. 59(51), 22943–22946. mla: Schlemmer, Werner, et al. “2‐methoxyhydroquinone from Vanillin for Aqueous Redox‐flow Batteries.” Angewandte Chemie International Edition, vol. 59, no. 51, Wiley, 2020, pp. 22943–46, doi:10.1002/anie.202008253. short: W. Schlemmer, P. Nothdurft, A. Petzold, P. Frühwirt, M. Schmallegger, G. Gescheidt-Demner, R. Fischer, S.A. Freunberger, W. Kern, S. Spirk, Angewandte Chemie International Edition 59 (2020) 22943–22946. date_created: 2020-09-03T16:10:56Z date_published: 2020-12-14T00:00:00Z date_updated: 2023-09-05T16:03:47Z day: '14' department: - _id: StFr doi: 10.1002/anie.202008253 external_id: isi: - '000576148700001' intvolume: ' 59' isi: 1 issue: '51' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1002/anie.202008253 month: '12' oa: 1 oa_version: Published Version page: 22943-22946 publication: Angewandte Chemie International Edition publication_identifier: eissn: - 1521-3773 issn: - 1433-7851 publication_status: published publisher: Wiley quality_controlled: '1' related_material: record: - id: '9780' relation: research_data status: public scopus_import: '1' status: public title: 2‐methoxyhydroquinone from vanillin for aqueous redox‐flow batteries type: journal_article user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 59 year: '2020' ... --- _id: '8361' abstract: - lang: eng text: 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. acknowledgement: A.V. and K.T. acknowledge, respectively, the financial support of the Helmholtz Association and BMW AG. J.H. acknowledges the collabo-ration project “Accordo di Collaborazione Quadro 2015” between Uni-versity of Ferrara (Department of Chemical and Pharmaceutical Sciences) and Sapienza University of Rome (Department of Chemistry). S.D., H.A. and S.K. thank the Fraunhofer Gesellschaft, Technische Uni-versit ̈at Dresden and would like to acknowledge European Union’s Horizon 2020 research and innovation programme under grant agree-ment No 814471. S.A.F. and C.P. are indebted to the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation program (grant agreement no. 636069) and IST Austria. article_number: '228803' article_processing_charge: No article_type: original author: - first_name: Alberto full_name: Varzi, Alberto last_name: Varzi orcid: 0000-0001-5069-0589 - first_name: Katharina full_name: Thanner, Katharina last_name: Thanner orcid: 0000-0001-5394-2323 - first_name: Roberto full_name: Scipioni, Roberto last_name: Scipioni orcid: 0000-0003-1926-421X - first_name: Daniele full_name: Di Lecce, Daniele last_name: Di Lecce - first_name: Jusef full_name: Hassoun, Jusef last_name: Hassoun - first_name: Susanne full_name: Dörfler, Susanne last_name: Dörfler - first_name: Holger full_name: Altheus, Holger last_name: Altheus - first_name: Stefan full_name: Kaskel, Stefan last_name: Kaskel - first_name: Christian full_name: Prehal, Christian last_name: Prehal orcid: 0000-0003-0654-0940 - first_name: Stefan Alexander full_name: Freunberger, Stefan Alexander id: A8CA28E6-CE23-11E9-AD2D-EC27E6697425 last_name: Freunberger orcid: 0000-0003-2902-5319 citation: ama: Varzi A, Thanner K, Scipioni R, et al. Current status and future perspectives of lithium metal batteries. Journal of Power Sources. 2020;480(12). doi:10.1016/j.jpowsour.2020.228803 apa: Varzi, A., Thanner, K., Scipioni, R., Di Lecce, D., Hassoun, J., Dörfler, S., … Freunberger, S. A. (2020). Current status and future perspectives of lithium metal batteries. Journal of Power Sources. Elsevier. https://doi.org/10.1016/j.jpowsour.2020.228803 chicago: Varzi, Alberto, Katharina Thanner, Roberto Scipioni, Daniele Di Lecce, Jusef Hassoun, Susanne Dörfler, Holger Altheus, Stefan Kaskel, Christian Prehal, and Stefan Alexander Freunberger. “Current Status and Future Perspectives of Lithium Metal Batteries.” Journal of Power Sources. Elsevier, 2020. https://doi.org/10.1016/j.jpowsour.2020.228803. ieee: A. Varzi et al., “Current status and future perspectives of lithium metal batteries,” Journal of Power Sources, vol. 480, no. 12. Elsevier, 2020. ista: Varzi A, Thanner K, Scipioni R, Di Lecce D, Hassoun J, Dörfler S, Altheus H, Kaskel S, Prehal C, Freunberger SA. 2020. Current status and future perspectives of lithium metal batteries. Journal of Power Sources. 480(12), 228803. mla: Varzi, Alberto, et al. “Current Status and Future Perspectives of Lithium Metal Batteries.” Journal of Power Sources, vol. 480, no. 12, 228803, Elsevier, 2020, doi:10.1016/j.jpowsour.2020.228803. short: A. Varzi, K. Thanner, R. Scipioni, D. Di Lecce, J. Hassoun, S. Dörfler, H. Altheus, S. Kaskel, C. Prehal, S.A. Freunberger, Journal of Power Sources 480 (2020). date_created: 2020-09-10T10:48:40Z date_published: 2020-12-31T00:00:00Z date_updated: 2024-10-21T06:02:28Z day: '31' department: - _id: StFr doi: 10.1016/j.jpowsour.2020.228803 external_id: isi: - '000593857300001' intvolume: ' 480' isi: 1 issue: '12' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1016/j.jpowsour.2020.228803 month: '12' oa: 1 oa_version: Published Version publication: Journal of Power Sources publication_identifier: issn: - 0378-7753 publication_status: published publisher: Elsevier quality_controlled: '1' related_material: record: - id: '8067' relation: earlier_version status: public scopus_import: '1' status: public title: Current status and future perspectives of lithium metal batteries type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 480 year: '2020' ... --- _id: '8383' abstract: - lang: eng text: 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. article_processing_charge: No author: - first_name: Dan-Adrian full_name: Alistarh, Dan-Adrian id: 4A899BFC-F248-11E8-B48F-1D18A9856A87 last_name: Alistarh orcid: 0000-0003-3650-940X - first_name: James full_name: Aspnes, James last_name: Aspnes - first_name: Faith full_name: Ellen, Faith last_name: Ellen - first_name: Rati full_name: Gelashvili, Rati last_name: Gelashvili - first_name: Leqi full_name: Zhu, Leqi last_name: Zhu citation: ama: 'Alistarh D-A, Aspnes J, Ellen F, Gelashvili R, Zhu L. Brief Announcement: Why Extension-Based Proofs Fail. In: Proceedings of the 39th Symposium on Principles of Distributed Computing. Association for Computing Machinery; 2020:54-56. doi:10.1145/3382734.3405743' apa: 'Alistarh, D.-A., Aspnes, J., Ellen, F., Gelashvili, R., & Zhu, L. (2020). Brief Announcement: Why Extension-Based Proofs Fail. In Proceedings of the 39th Symposium on Principles of Distributed Computing (pp. 54–56). Virtual, Italy: Association for Computing Machinery. https://doi.org/10.1145/3382734.3405743' chicago: 'Alistarh, Dan-Adrian, James Aspnes, Faith Ellen, Rati Gelashvili, and Leqi Zhu. “Brief Announcement: Why Extension-Based Proofs Fail.” In Proceedings of the 39th Symposium on Principles of Distributed Computing, 54–56. Association for Computing Machinery, 2020. https://doi.org/10.1145/3382734.3405743.' ieee: 'D.-A. Alistarh, J. Aspnes, F. Ellen, R. Gelashvili, and L. Zhu, “Brief Announcement: Why Extension-Based Proofs Fail,” in Proceedings of the 39th Symposium on Principles of Distributed Computing, Virtual, Italy, 2020, pp. 54–56.' ista: 'Alistarh D-A, Aspnes J, Ellen F, Gelashvili R, Zhu L. 2020. Brief Announcement: Why Extension-Based Proofs Fail. Proceedings of the 39th Symposium on Principles of Distributed Computing. PODC: Principles of Distributed Computing, 54–56.' mla: 'Alistarh, Dan-Adrian, et al. “Brief Announcement: Why Extension-Based Proofs Fail.” Proceedings of the 39th Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2020, pp. 54–56, doi:10.1145/3382734.3405743.' short: D.-A. Alistarh, J. Aspnes, F. Ellen, R. Gelashvili, L. Zhu, in:, Proceedings of the 39th Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2020, pp. 54–56. conference: end_date: 2020-08-07 location: Virtual, Italy name: 'PODC: Principles of Distributed Computing' start_date: 2020-08-03 date_created: 2020-09-13T22:01:18Z date_published: 2020-07-31T00:00:00Z date_updated: 2025-09-10T10:26:32Z day: '31' department: - _id: DaAl doi: 10.1145/3382734.3405743 external_id: isi: - '001436693500007' isi: 1 language: - iso: eng month: '07' oa_version: None page: 54-56 publication: Proceedings of the 39th Symposium on Principles of Distributed Computing publication_identifier: isbn: - '9781450375825' publication_status: published publisher: Association for Computing Machinery quality_controlled: '1' scopus_import: '1' status: public title: 'Brief Announcement: Why Extension-Based Proofs Fail' type: conference user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345 year: '2020' ... --- _id: '8533' abstract: - lang: eng text: 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. acknowledgement: "Krishnendu Chatterjee: The research was partially supported by the Vienna Science and\r\nTechnology Fund (WWTF) Project ICT15-003.\r\nIsmaël Jecker: This project has received funding from the European Union’s Horizon 2020 research\r\nand innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 754411." alternative_title: - LIPIcs article_number: 22:1-22:13 article_processing_charge: No arxiv: 1 author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Rasmus full_name: Ibsen-Jensen, Rasmus id: 3B699956-F248-11E8-B48F-1D18A9856A87 last_name: Ibsen-Jensen orcid: 0000-0003-4783-0389 - first_name: Ismael R full_name: Jecker, Ismael R id: 85D7C63E-7D5D-11E9-9C0F-98C4E5697425 last_name: Jecker - first_name: Jakub full_name: Svoboda, Jakub id: 130759D2-D7DD-11E9-87D2-DE0DE6697425 last_name: Svoboda orcid: 0000-0002-1419-3267 citation: ama: 'Chatterjee K, Ibsen-Jensen R, Jecker IR, Svoboda J. Simplified game of life: Algorithms and complexity. In: 45th International Symposium on Mathematical Foundations of Computer Science. Vol 170. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.MFCS.2020.22' apa: 'Chatterjee, K., Ibsen-Jensen, R., Jecker, I. R., & Svoboda, J. (2020). Simplified game of life: Algorithms and complexity. In 45th International Symposium on Mathematical Foundations of Computer Science (Vol. 170). Prague, Czech Republic: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2020.22' chicago: 'Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Ismael R Jecker, and Jakub Svoboda. “Simplified Game of Life: Algorithms and Complexity.” In 45th International Symposium on Mathematical Foundations of Computer Science, Vol. 170. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.MFCS.2020.22.' ieee: 'K. Chatterjee, R. Ibsen-Jensen, I. R. Jecker, and J. Svoboda, “Simplified game of life: Algorithms and complexity,” in 45th International Symposium on Mathematical Foundations of Computer Science, Prague, Czech Republic, 2020, vol. 170.' ista: 'Chatterjee K, Ibsen-Jensen R, Jecker IR, Svoboda J. 2020. Simplified game of life: Algorithms and complexity. 45th International Symposium on Mathematical Foundations of Computer Science. MFCS: Mathematical Foundations of Computer Science, LIPIcs, vol. 170, 22:1-22:13.' mla: 'Chatterjee, Krishnendu, et al. “Simplified Game of Life: Algorithms and Complexity.” 45th International Symposium on Mathematical Foundations of Computer Science, vol. 170, 22:1-22:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.MFCS.2020.22.' short: K. Chatterjee, R. Ibsen-Jensen, I.R. Jecker, J. Svoboda, in:, 45th International Symposium on Mathematical Foundations of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. conference: end_date: 2020-08-28 location: Prague, Czech Republic name: 'MFCS: Mathematical Foundations of Computer Science' start_date: 2020-08-24 date_created: 2020-09-20T22:01:36Z date_published: 2020-08-18T00:00:00Z date_updated: 2025-07-10T11:57:06Z day: '18' ddc: - '000' department: - _id: KrCh doi: 10.4230/LIPIcs.MFCS.2020.22 ec_funded: 1 external_id: arxiv: - '2007.02894' file: - access_level: open_access checksum: bbd7c4f55d45f2ff2a0a4ef0e10a77b1 content_type: application/pdf creator: dernst date_created: 2020-09-21T13:57:34Z date_updated: 2020-09-21T13:57:34Z file_id: '8550' file_name: 2020_LIPIcs_Chatterjee.pdf file_size: 491374 relation: main_file success: 1 file_date_updated: 2020-09-21T13:57:34Z has_accepted_license: '1' intvolume: ' 170' language: - iso: eng license: https://creativecommons.org/licenses/by/3.0/ month: '08' oa: 1 oa_version: Published Version project: - _id: 25892FC0-B435-11E9-9278-68D0E5697425 grant_number: ICT15-003 name: Efficient Algorithms for Computer Aided Verification - _id: 260C2330-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '754411' name: ISTplus - Postdoctoral Fellowships publication: 45th International Symposium on Mathematical Foundations of Computer Science publication_identifier: isbn: - '9783959771597' issn: - 1868-8969 publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: '1' status: public title: 'Simplified game of life: Algorithms and complexity' tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/3.0/legalcode name: Creative Commons Attribution 3.0 Unported (CC BY 3.0) short: CC BY (3.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 170 year: '2020' ... --- _id: '8534' abstract: - lang: eng text: 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. acknowledgement: "Ismaël Jecker: This project has received funding from the European Union’s Horizon\r\n2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No.\r\n754411. Nicolas Mazzocchi: PhD fellowship FRIA from the F.R.S.-FNRS." alternative_title: - LIPIcs article_number: 51:1-51:12 article_processing_charge: No author: - first_name: Ismael R full_name: Jecker, Ismael R id: 85D7C63E-7D5D-11E9-9C0F-98C4E5697425 last_name: Jecker - first_name: Orna full_name: Kupferman, Orna last_name: Kupferman - first_name: Nicolas full_name: Mazzocchi, Nicolas last_name: Mazzocchi citation: ama: 'Jecker IR, Kupferman O, Mazzocchi N. Unary prime languages. In: 45th International Symposium on Mathematical Foundations of Computer Science. Vol 170. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.MFCS.2020.51' apa: 'Jecker, I. R., Kupferman, O., & Mazzocchi, N. (2020). Unary prime languages. In 45th International Symposium on Mathematical Foundations of Computer Science (Vol. 170). Prague, Czech Republic: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2020.51' chicago: Jecker, Ismael R, Orna Kupferman, and Nicolas Mazzocchi. “Unary Prime Languages.” In 45th International Symposium on Mathematical Foundations of Computer Science, Vol. 170. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.MFCS.2020.51. ieee: I. R. Jecker, O. Kupferman, and N. Mazzocchi, “Unary prime languages,” in 45th International Symposium on Mathematical Foundations of Computer Science, Prague, Czech Republic, 2020, vol. 170. ista: 'Jecker IR, Kupferman O, Mazzocchi N. 2020. Unary prime languages. 45th International Symposium on Mathematical Foundations of Computer Science. MFCS: Mathematical Foundations of Computer Science, LIPIcs, vol. 170, 51:1-51:12.' mla: Jecker, Ismael R., et al. “Unary Prime Languages.” 45th International Symposium on Mathematical Foundations of Computer Science, vol. 170, 51:1-51:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.MFCS.2020.51. short: I.R. Jecker, O. Kupferman, N. Mazzocchi, in:, 45th International Symposium on Mathematical Foundations of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. conference: end_date: 2020-08-28 location: Prague, Czech Republic name: 'MFCS: Mathematical Foundations of Computer Science' start_date: 2020-08-24 corr_author: '1' date_created: 2020-09-20T22:01:36Z date_published: 2020-08-18T00:00:00Z date_updated: 2025-07-10T11:57:07Z day: '18' ddc: - '000' department: - _id: KrCh doi: 10.4230/LIPIcs.MFCS.2020.51 ec_funded: 1 file: - access_level: open_access checksum: 2dc9e2fad6becd4563aef3e27a473f70 content_type: application/pdf creator: dernst date_created: 2020-09-21T14:17:08Z date_updated: 2020-09-21T14:17:08Z file_id: '8552' file_name: 2020_LIPIcsMFCS_Jecker.pdf file_size: 597977 relation: main_file success: 1 file_date_updated: 2020-09-21T14:17:08Z has_accepted_license: '1' intvolume: ' 170' language: - iso: eng month: '08' oa: 1 oa_version: Published Version project: - _id: 260C2330-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '754411' name: ISTplus - Postdoctoral Fellowships publication: 45th International Symposium on Mathematical Foundations of Computer Science publication_identifier: isbn: - '9783959771597' issn: - 1868-8969 publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: '1' status: public title: Unary prime languages tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/3.0/legalcode name: Creative Commons Attribution 3.0 Unported (CC BY 3.0) short: CC BY (3.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 170 year: '2020' ... --- _id: '8536' abstract: - lang: eng text: 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. acknowledgement: M. Mondelli was partially supported by grants NSF DMS-1613091, CCF-1714305, IIS-1741162 and ONR N00014-18-1-2729. S. A. Hashemi is supported by a Postdoctoral Fellowship from the Natural Sciences and Engineering Research Council of Canada (NSERC) and by Huawei. article_number: 401-406 article_processing_charge: No arxiv: 1 author: - first_name: Marco full_name: Mondelli, Marco id: 27EB676C-8706-11E9-9510-7717E6697425 last_name: Mondelli orcid: 0000-0002-3242-7020 - first_name: Seyyed Ali full_name: Hashemi, Seyyed Ali last_name: Hashemi - first_name: John full_name: Cioffi, John last_name: Cioffi - first_name: Andrea full_name: Goldsmith, Andrea last_name: Goldsmith citation: ama: 'Mondelli M, Hashemi SA, Cioffi J, Goldsmith A. Simplified successive cancellation decoding of polar codes has sublinear latency. In: IEEE International Symposium on Information Theory - Proceedings. Vol 2020-June. IEEE; 2020. doi:10.1109/ISIT44484.2020.9174141' apa: 'Mondelli, M., Hashemi, S. A., Cioffi, J., & Goldsmith, A. (2020). Simplified successive cancellation decoding of polar codes has sublinear latency. In IEEE International Symposium on Information Theory - Proceedings (Vol. 2020–June). Los Angeles, CA, United States: IEEE. https://doi.org/10.1109/ISIT44484.2020.9174141' chicago: Mondelli, Marco, Seyyed Ali Hashemi, John Cioffi, and Andrea Goldsmith. “Simplified Successive Cancellation Decoding of Polar Codes Has Sublinear Latency.” In IEEE International Symposium on Information Theory - Proceedings, Vol. 2020–June. IEEE, 2020. https://doi.org/10.1109/ISIT44484.2020.9174141. ieee: M. Mondelli, S. A. Hashemi, J. Cioffi, and A. Goldsmith, “Simplified successive cancellation decoding of polar codes has sublinear latency,” in IEEE International Symposium on Information Theory - Proceedings, Los Angeles, CA, United States, 2020, vol. 2020–June. ista: 'Mondelli M, Hashemi SA, Cioffi J, Goldsmith A. 2020. Simplified successive cancellation decoding of polar codes has sublinear latency. IEEE International Symposium on Information Theory - Proceedings. ISIT: International Symposium on Information Theory vol. 2020–June, 401–406.' mla: Mondelli, Marco, et al. “Simplified Successive Cancellation Decoding of Polar Codes Has Sublinear Latency.” IEEE International Symposium on Information Theory - Proceedings, vol. 2020–June, 401–406, IEEE, 2020, doi:10.1109/ISIT44484.2020.9174141. short: M. Mondelli, S.A. Hashemi, J. Cioffi, A. Goldsmith, in:, IEEE International Symposium on Information Theory - Proceedings, IEEE, 2020. conference: end_date: 2020-06-26 location: Los Angeles, CA, United States name: 'ISIT: International Symposium on Information Theory' start_date: 2020-06-21 date_created: 2020-09-20T22:01:37Z date_published: 2020-06-01T00:00:00Z date_updated: 2025-09-10T10:27:05Z day: '01' department: - _id: MaMo doi: 10.1109/ISIT44484.2020.9174141 external_id: arxiv: - '1909.04892' isi: - '000714963400069' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1909.04892 month: '06' oa: 1 oa_version: Preprint publication: IEEE International Symposium on Information Theory - Proceedings publication_identifier: isbn: - '9781728164328' issn: - 2157-8095 publication_status: published publisher: IEEE quality_controlled: '1' related_material: record: - id: '9047' relation: later_version status: public scopus_import: '1' status: public title: Simplified successive cancellation decoding of polar codes has sublinear latency type: conference user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345 volume: 2020-June year: '2020' ... --- _id: '8539' abstract: - lang: eng text: 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. - lang: fre text: "Les bases stables cohomologiques et K-théoriques proviennent de l’étude de la cohomologie quantique et de la K-théorie quantique. La formule de restriction pour les bases stables cohomologiques a joué un rôle important dans le calcul de la connexion quantique du fibré cotangent de variétés de drapeaux partielles. Dans cet article, nous étudions les bases stables K-théoriques de fibré cotangents des variétés de drapeaux. Nous décrivons ces bases en fonction de l’action de l’algèbre de Hecke affine et de l’algèbre de Kostant-Kumar. En utilisant cette description algébrique et la méthode des polynômes de racine, nous donnons une formule de restriction des bases stables. Nous l’appliquons\r\npour obtenir la formule de restriction pour les variétés de drapeaux partielles. Nous construisons également une relation entre la base stable et la base de Casselman dans les représentations de la série principale du groupe dual de Langlands p-adique. Comme une application, nous donnons une formule close pour la matrice de transition entre la base de Casselman et les fonctions caractéristiques. " article_processing_charge: No article_type: original arxiv: 1 author: - first_name: C. full_name: Su, C. last_name: Su - first_name: Gufang full_name: Zhao, Gufang id: 2BC2AC5E-F248-11E8-B48F-1D18A9856A87 last_name: Zhao - first_name: C. full_name: Zhong, C. last_name: Zhong citation: ama: Su C, Zhao G, Zhong C. On the K-theory stable bases of the springer resolution. Annales Scientifiques de l’Ecole Normale Superieure. 2020;53(3):663-671. doi:10.24033/asens.2431 apa: Su, C., Zhao, G., & Zhong, C. (2020). On the K-theory stable bases of the springer resolution. Annales Scientifiques de l’Ecole Normale Superieure. Société Mathématique de France. https://doi.org/10.24033/asens.2431 chicago: Su, C., Gufang Zhao, and C. Zhong. “On the K-Theory Stable Bases of the Springer Resolution.” Annales Scientifiques de l’Ecole Normale Superieure. Société Mathématique de France, 2020. https://doi.org/10.24033/asens.2431. ieee: C. Su, G. Zhao, and C. Zhong, “On the K-theory stable bases of the springer resolution,” Annales Scientifiques de l’Ecole Normale Superieure, vol. 53, no. 3. Société Mathématique de France, pp. 663–671, 2020. ista: Su C, Zhao G, Zhong C. 2020. On the K-theory stable bases of the springer resolution. Annales Scientifiques de l’Ecole Normale Superieure. 53(3), 663–671. mla: Su, C., et al. “On the K-Theory Stable Bases of the Springer Resolution.” Annales Scientifiques de l’Ecole Normale Superieure, vol. 53, no. 3, Société Mathématique de France, 2020, pp. 663–71, doi:10.24033/asens.2431. short: C. Su, G. Zhao, C. Zhong, Annales Scientifiques de l’Ecole Normale Superieure 53 (2020) 663–671. date_created: 2020-09-20T22:01:38Z date_published: 2020-06-01T00:00:00Z date_updated: 2023-08-22T09:27:57Z day: '01' department: - _id: TaHa doi: 10.24033/asens.2431 external_id: arxiv: - '1708.08013' isi: - '000592182600004' intvolume: ' 53' isi: 1 issue: '3' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1708.08013 month: '06' oa: 1 oa_version: Preprint page: 663-671 publication: Annales Scientifiques de l'Ecole Normale Superieure publication_identifier: issn: - 0012-9593 publication_status: published publisher: Société Mathématique de France quality_controlled: '1' scopus_import: '1' status: public title: On the K-theory stable bases of the springer resolution type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 53 year: '2020' ... --- _id: '8568' abstract: - lang: eng text: 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. article_number: '4838' article_processing_charge: No article_type: original author: - first_name: Christian full_name: Prehal, Christian last_name: Prehal - first_name: Harald full_name: Fitzek, Harald last_name: Fitzek - first_name: Gerald full_name: Kothleitner, Gerald last_name: Kothleitner - first_name: Volker full_name: Presser, Volker last_name: Presser - first_name: Bernhard full_name: Gollas, Bernhard last_name: Gollas - first_name: Stefan Alexander full_name: Freunberger, Stefan Alexander id: A8CA28E6-CE23-11E9-AD2D-EC27E6697425 last_name: Freunberger orcid: 0000-0003-2902-5319 - first_name: Qamar full_name: Abbas, Qamar last_name: Abbas citation: ama: Prehal C, Fitzek H, Kothleitner G, et al. Persistent and reversible solid iodine electrodeposition in nanoporous carbons. Nature Communications. 2020;11. doi:10.1038/s41467-020-18610-6 apa: Prehal, C., Fitzek, H., Kothleitner, G., Presser, V., Gollas, B., Freunberger, S. A., & Abbas, Q. (2020). Persistent and reversible solid iodine electrodeposition in nanoporous carbons. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-020-18610-6 chicago: Prehal, Christian, Harald Fitzek, Gerald Kothleitner, Volker Presser, Bernhard Gollas, Stefan Alexander Freunberger, and Qamar Abbas. “Persistent and Reversible Solid Iodine Electrodeposition in Nanoporous Carbons.” Nature Communications. Springer Nature, 2020. https://doi.org/10.1038/s41467-020-18610-6. ieee: C. Prehal et al., “Persistent and reversible solid iodine electrodeposition in nanoporous carbons,” Nature Communications, vol. 11. Springer Nature, 2020. ista: Prehal C, Fitzek H, Kothleitner G, Presser V, Gollas B, Freunberger SA, Abbas Q. 2020. Persistent and reversible solid iodine electrodeposition in nanoporous carbons. Nature Communications. 11, 4838. mla: Prehal, Christian, et al. “Persistent and Reversible Solid Iodine Electrodeposition in Nanoporous Carbons.” Nature Communications, vol. 11, 4838, Springer Nature, 2020, doi:10.1038/s41467-020-18610-6. short: C. Prehal, H. Fitzek, G. Kothleitner, V. Presser, B. Gollas, S.A. Freunberger, Q. Abbas, Nature Communications 11 (2020). corr_author: '1' date_created: 2020-09-25T07:23:13Z date_published: 2020-09-24T00:00:00Z date_updated: 2025-06-12T06:58:51Z day: '24' ddc: - '530' department: - _id: StFr doi: 10.1038/s41467-020-18610-6 external_id: isi: - '000573756600004' pmid: - '32973214' file: - access_level: open_access checksum: eada7bc8dd16a49390137cff882ef328 content_type: application/pdf creator: dernst date_created: 2020-09-28T13:16:15Z date_updated: 2020-09-28T13:16:15Z file_id: '8585' file_name: 2020_NatureComm_Prehal.pdf file_size: 1822469 relation: main_file success: 1 file_date_updated: 2020-09-28T13:16:15Z has_accepted_license: '1' intvolume: ' 11' isi: 1 keyword: - General Biochemistry - Genetics and Molecular Biology - General Physics and Astronomy - General Chemistry language: - iso: eng month: '09' oa: 1 oa_version: Published Version pmid: 1 publication: Nature Communications publication_identifier: issn: - 2041-1723 publication_status: published publisher: Springer Nature quality_controlled: '1' related_material: link: - relation: erratum url: https://doi.org/10.1038/s41467-020-19720-x scopus_import: '1' status: public title: Persistent and reversible solid iodine electrodeposition in nanoporous carbons tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 11 year: '2020' ... --- _id: '8571' abstract: - lang: eng text: 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. acknowledgement: Christian Schilling acknowledges support in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award) and the European Union’s Horizon 2020 research and innovation programme under the Marie Sk lodowska-Curie grant agreement No. 754411. article_processing_charge: No author: - first_name: Luca full_name: Geretti, Luca last_name: Geretti - first_name: Julien full_name: Alexandre Dit Sandretto, Julien last_name: Alexandre Dit Sandretto - first_name: Matthias full_name: Althoff, Matthias last_name: Althoff - first_name: Luis full_name: Benet, Luis last_name: Benet - first_name: Alexandre full_name: Chapoutot, Alexandre last_name: Chapoutot - first_name: Xin full_name: Chen, Xin last_name: Chen - first_name: Pieter full_name: Collins, Pieter last_name: Collins - first_name: Marcelo full_name: Forets, Marcelo last_name: Forets - first_name: Daniel full_name: Freire, Daniel last_name: Freire - first_name: Fabian full_name: Immler, Fabian last_name: Immler - first_name: Niklas full_name: Kochdumper, Niklas last_name: Kochdumper - first_name: David full_name: Sanders, David last_name: Sanders - first_name: Christian full_name: Schilling, Christian id: 3A2F4DCE-F248-11E8-B48F-1D18A9856A87 last_name: Schilling orcid: 0000-0003-3658-1065 citation: ama: 'Geretti L, Alexandre Dit Sandretto J, Althoff M, et al. ARCH-COMP20 Category Report: Continuous and hybrid systems with nonlinear dynamics. In: EPiC Series in Computing. Vol 74. EasyChair; 2020:49-75. doi:10.29007/zkf6' apa: 'Geretti, L., Alexandre Dit Sandretto, J., Althoff, M., Benet, L., Chapoutot, A., Chen, X., … Schilling, C. (2020). ARCH-COMP20 Category Report: Continuous and hybrid systems with nonlinear dynamics. In EPiC Series in Computing (Vol. 74, pp. 49–75). EasyChair. https://doi.org/10.29007/zkf6' chicago: 'Geretti, Luca, Julien Alexandre Dit Sandretto, Matthias Althoff, Luis Benet, Alexandre Chapoutot, Xin Chen, Pieter Collins, et al. “ARCH-COMP20 Category Report: Continuous and Hybrid Systems with Nonlinear Dynamics.” In EPiC Series in Computing, 74:49–75. EasyChair, 2020. https://doi.org/10.29007/zkf6.' ieee: 'L. Geretti et al., “ARCH-COMP20 Category Report: Continuous and hybrid systems with nonlinear dynamics,” in EPiC Series in Computing, 2020, vol. 74, pp. 49–75.' ista: 'Geretti L, Alexandre Dit Sandretto J, Althoff M, Benet L, Chapoutot A, Chen X, Collins P, Forets M, Freire D, Immler F, Kochdumper N, Sanders D, Schilling C. 2020. ARCH-COMP20 Category Report: Continuous and hybrid systems with nonlinear dynamics. EPiC Series in Computing. ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems vol. 74, 49–75.' mla: 'Geretti, Luca, et al. “ARCH-COMP20 Category Report: Continuous and Hybrid Systems with Nonlinear Dynamics.” EPiC Series in Computing, vol. 74, EasyChair, 2020, pp. 49–75, doi:10.29007/zkf6.' short: L. Geretti, J. Alexandre Dit Sandretto, M. Althoff, L. Benet, A. Chapoutot, X. Chen, P. Collins, M. Forets, D. Freire, F. Immler, N. Kochdumper, D. Sanders, C. Schilling, in:, EPiC Series in Computing, EasyChair, 2020, pp. 49–75. conference: end_date: 2020-07-12 name: 'ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems' start_date: 2020-07-12 corr_author: '1' date_created: 2020-09-26T14:41:29Z date_published: 2020-09-25T00:00:00Z date_updated: 2025-04-15T06:26:12Z day: '25' department: - _id: ToHe doi: 10.29007/zkf6 ec_funded: 1 intvolume: ' 74' language: - iso: eng main_file_link: - open_access: '1' url: https://easychair.org/publications/download/nrdD month: '09' oa: 1 oa_version: Published Version page: 49-75 project: - _id: 260C2330-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '754411' name: ISTplus - Postdoctoral Fellowships - _id: 25F42A32-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z211 name: Formal methods for the design and analysis of complex systems publication: EPiC Series in Computing publication_status: published publisher: EasyChair quality_controlled: '1' scopus_import: '1' status: public title: 'ARCH-COMP20 Category Report: Continuous and hybrid systems with nonlinear dynamics' type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 74 year: '2020' ... --- _id: '8572' abstract: - lang: eng text: '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.' acknowledgement: "The authors gratefully acknowledge financial support by the European Commission project\r\njustITSELF under grant number 817629, by the Austrian Science Fund (FWF) under grant\r\nZ211-N23 (Wittgenstein Award), by the European Union’s Horizon 2020 research and innovation programme under the Marie Sk lodowska-Curie grant agreement No. 754411, and by the\r\nScience and Engineering Research Board (SERB) project with file number IMP/2018/000523.\r\nThis material is based upon work supported by the Air Force Office of Scientific Research under\r\naward number FA9550-19-1-0288. Any opinions, finding, and conclusions or recommendations\r\nexpressed in this material are those of the author(s) and do not necessarily reflect the views of\r\nthe United States Air Force." article_processing_charge: No author: - first_name: Matthias full_name: Althoff, Matthias last_name: Althoff - first_name: Stanley full_name: Bak, Stanley last_name: Bak - first_name: Zongnan full_name: Bao, Zongnan last_name: Bao - first_name: Marcelo full_name: Forets, Marcelo last_name: Forets - first_name: Goran full_name: Frehse, Goran last_name: Frehse - first_name: Daniel full_name: Freire, Daniel last_name: Freire - first_name: Niklas full_name: Kochdumper, Niklas last_name: Kochdumper - first_name: Yangge full_name: Li, Yangge last_name: Li - first_name: Sayan full_name: Mitra, Sayan last_name: Mitra - first_name: Rajarshi full_name: Ray, Rajarshi last_name: Ray - first_name: Christian full_name: Schilling, Christian id: 3A2F4DCE-F248-11E8-B48F-1D18A9856A87 last_name: Schilling orcid: 0000-0003-3658-1065 - first_name: Stefan full_name: Schupp, Stefan last_name: Schupp - first_name: Mark full_name: Wetzlinger, Mark last_name: Wetzlinger citation: ama: 'Althoff M, Bak S, Bao Z, et al. ARCH-COMP20 Category Report: Continuous and hybrid systems with linear dynamics. In: EPiC Series in Computing. Vol 74. EasyChair; 2020:16-48. doi:10.29007/7dt2' apa: 'Althoff, M., Bak, S., Bao, Z., Forets, M., Frehse, G., Freire, D., … Wetzlinger, M. (2020). ARCH-COMP20 Category Report: Continuous and hybrid systems with linear dynamics. In EPiC Series in Computing (Vol. 74, pp. 16–48). EasyChair. https://doi.org/10.29007/7dt2' chicago: 'Althoff, Matthias, Stanley Bak, Zongnan Bao, Marcelo Forets, Goran Frehse, Daniel Freire, Niklas Kochdumper, et al. “ARCH-COMP20 Category Report: Continuous and Hybrid Systems with Linear Dynamics.” In EPiC Series in Computing, 74:16–48. EasyChair, 2020. https://doi.org/10.29007/7dt2.' ieee: 'M. Althoff et al., “ARCH-COMP20 Category Report: Continuous and hybrid systems with linear dynamics,” in EPiC Series in Computing, 2020, vol. 74, pp. 16–48.' ista: 'Althoff M, Bak S, Bao Z, Forets M, Frehse G, Freire D, Kochdumper N, Li Y, Mitra S, Ray R, Schilling C, Schupp S, Wetzlinger M. 2020. ARCH-COMP20 Category Report: Continuous and hybrid systems with linear dynamics. EPiC Series in Computing. ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems vol. 74, 16–48.' mla: 'Althoff, Matthias, et al. “ARCH-COMP20 Category Report: Continuous and Hybrid Systems with Linear Dynamics.” EPiC Series in Computing, vol. 74, EasyChair, 2020, pp. 16–48, doi:10.29007/7dt2.' short: M. Althoff, S. Bak, Z. Bao, M. Forets, G. Frehse, D. Freire, N. Kochdumper, Y. Li, S. Mitra, R. Ray, C. Schilling, S. Schupp, M. Wetzlinger, in:, EPiC Series in Computing, EasyChair, 2020, pp. 16–48. conference: end_date: 2020-07-12 name: 'ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems' start_date: 2020-07-12 corr_author: '1' date_created: 2020-09-26T14:49:43Z date_published: 2020-09-25T00:00:00Z date_updated: 2025-04-15T08:29:04Z day: '25' department: - _id: ToHe doi: 10.29007/7dt2 ec_funded: 1 intvolume: ' 74' language: - iso: eng main_file_link: - open_access: '1' url: https://easychair.org/publications/download/DRpS month: '09' oa: 1 oa_version: Published Version page: 16-48 project: - _id: 25C5A090-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z00312 name: Synaptic communication in neuronal microcircuits - _id: 260C2330-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '754411' name: ISTplus - Postdoctoral Fellowships publication: EPiC Series in Computing publication_status: published publisher: EasyChair quality_controlled: '1' scopus_import: '1' status: public title: 'ARCH-COMP20 Category Report: Continuous and hybrid systems with linear dynamics' type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 74 year: '2020' ... --- _id: '8580' abstract: - lang: eng text: 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. article_number: '9158054' article_processing_charge: No author: - first_name: Grzegorz full_name: Graff, Grzegorz last_name: Graff - first_name: Beata full_name: Graff, Beata last_name: Graff - first_name: Grzegorz full_name: Jablonski, Grzegorz id: 4483EF78-F248-11E8-B48F-1D18A9856A87 last_name: Jablonski orcid: 0000-0002-3536-9866 - first_name: Krzysztof full_name: Narkiewicz, Krzysztof last_name: Narkiewicz citation: ama: 'Graff G, Graff B, Jablonski G, Narkiewicz K. The application of persistent homology in the analysis of heart rate variability. In: 11th Conference of the European Study Group on Cardiovascular Oscillations: Computation and Modelling in Physiology: New Challenges and Opportunities, . IEEE; 2020. doi:10.1109/ESGCO49734.2020.9158054' apa: 'Graff, G., Graff, B., Jablonski, G., & Narkiewicz, K. (2020). The application of persistent homology in the analysis of heart rate variability. In 11th Conference of the European Study Group on Cardiovascular Oscillations: Computation and Modelling in Physiology: New Challenges and Opportunities, . Pisa, Italy: IEEE. https://doi.org/10.1109/ESGCO49734.2020.9158054' chicago: 'Graff, Grzegorz, Beata Graff, Grzegorz Jablonski, and Krzysztof Narkiewicz. “The Application of Persistent Homology in the Analysis of Heart Rate Variability.” In 11th Conference of the European Study Group on Cardiovascular Oscillations: Computation and Modelling in Physiology: New Challenges and Opportunities, . IEEE, 2020. https://doi.org/10.1109/ESGCO49734.2020.9158054.' ieee: 'G. Graff, B. Graff, G. Jablonski, and K. Narkiewicz, “The application of persistent homology in the analysis of heart rate variability,” in 11th Conference of the European Study Group on Cardiovascular Oscillations: Computation and Modelling in Physiology: New Challenges and Opportunities, , Pisa, Italy, 2020.' ista: 'Graff G, Graff B, Jablonski G, Narkiewicz K. 2020. The application of persistent homology in the analysis of heart rate variability. 11th Conference of the European Study Group on Cardiovascular Oscillations: Computation and Modelling in Physiology: New Challenges and Opportunities, . ESGCO: European Study Group on Cardiovascular Oscillations, 9158054.' mla: 'Graff, Grzegorz, et al. “The Application of Persistent Homology in the Analysis of Heart Rate Variability.” 11th Conference of the European Study Group on Cardiovascular Oscillations: Computation and Modelling in Physiology: New Challenges and Opportunities, , 9158054, IEEE, 2020, doi:10.1109/ESGCO49734.2020.9158054.' short: 'G. Graff, B. Graff, G. Jablonski, K. Narkiewicz, in:, 11th Conference of the European Study Group on Cardiovascular Oscillations: Computation and Modelling in Physiology: New Challenges and Opportunities, , IEEE, 2020.' conference: end_date: 2020-07-15 location: Pisa, Italy name: 'ESGCO: European Study Group on Cardiovascular Oscillations' start_date: 2020-07-15 date_created: 2020-09-28T08:59:27Z date_published: 2020-08-01T00:00:00Z date_updated: 2023-08-22T09:33:34Z day: '01' department: - _id: HeEd doi: 10.1109/ESGCO49734.2020.9158054 external_id: isi: - '000621172600045' isi: 1 language: - iso: eng month: '08' oa_version: None publication: '11th Conference of the European Study Group on Cardiovascular Oscillations: Computation and Modelling in Physiology: New Challenges and Opportunities, ' publication_identifier: isbn: - '9781728157511' publication_status: published publisher: IEEE quality_controlled: '1' scopus_import: '1' status: public title: The application of persistent homology in the analysis of heart rate variability type: conference user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 year: '2020' ...