--- _id: '70' abstract: - lang: eng text: We consider the totally asymmetric simple exclusion process in a critical scaling parametrized by a≥0, which creates a shock in the particle density of order aT−1/3, T the observation time. When starting from step initial data, we provide bounds on the limiting law which in particular imply that in the double limit lima→∞limT→∞ one recovers the product limit law and the degeneration of the correlation length observed at shocks of order 1. This result is shown to apply to a general last-passage percolation model. We also obtain bounds on the two-point functions of several airy processes. article_processing_charge: No article_type: original arxiv: 1 author: - first_name: Peter full_name: Nejjar, Peter id: 4BF426E2-F248-11E8-B48F-1D18A9856A87 last_name: Nejjar citation: ama: Nejjar P. Transition to shocks in TASEP and decoupling of last passage times. Latin American Journal of Probability and Mathematical Statistics. 2018;15(2):1311-1334. doi:10.30757/ALEA.v15-49 apa: Nejjar, P. (2018). Transition to shocks in TASEP and decoupling of last passage times. Latin American Journal of Probability and Mathematical Statistics. Instituto Nacional de Matematica Pura e Aplicada. https://doi.org/10.30757/ALEA.v15-49 chicago: Nejjar, Peter. “Transition to Shocks in TASEP and Decoupling of Last Passage Times.” Latin American Journal of Probability and Mathematical Statistics. Instituto Nacional de Matematica Pura e Aplicada, 2018. https://doi.org/10.30757/ALEA.v15-49. ieee: P. Nejjar, “Transition to shocks in TASEP and decoupling of last passage times,” Latin American Journal of Probability and Mathematical Statistics, vol. 15, no. 2. Instituto Nacional de Matematica Pura e Aplicada, pp. 1311–1334, 2018. ista: Nejjar P. 2018. Transition to shocks in TASEP and decoupling of last passage times. Latin American Journal of Probability and Mathematical Statistics. 15(2), 1311–1334. mla: Nejjar, Peter. “Transition to Shocks in TASEP and Decoupling of Last Passage Times.” Latin American Journal of Probability and Mathematical Statistics, vol. 15, no. 2, Instituto Nacional de Matematica Pura e Aplicada, 2018, pp. 1311–34, doi:10.30757/ALEA.v15-49. short: P. Nejjar, Latin American Journal of Probability and Mathematical Statistics 15 (2018) 1311–1334. date_created: 2018-12-11T11:44:28Z date_published: 2018-10-01T00:00:00Z date_updated: 2023-10-10T13:11:29Z day: '01' ddc: - '510' department: - _id: LaEr - _id: JaMa doi: 10.30757/ALEA.v15-49 ec_funded: 1 external_id: arxiv: - '1705.08836' isi: - '000460475800022' file: - access_level: open_access checksum: 2ded46aa284a836a8cbb34133a64f1cb content_type: application/pdf creator: kschuh date_created: 2019-02-14T09:44:10Z date_updated: 2020-07-14T12:47:46Z file_id: '5981' file_name: 2018_ALEA_Nejjar.pdf file_size: 394851 relation: main_file file_date_updated: 2020-07-14T12:47:46Z has_accepted_license: '1' intvolume: ' 15' isi: 1 issue: '2' language: - iso: eng month: '10' oa: 1 oa_version: Published Version page: 1311-1334 project: - _id: 258DCDE6-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '338804' name: Random matrices, universality and disordered quantum systems - _id: 256E75B8-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '716117' name: Optimal Transport and Stochastic Dynamics publication: Latin American Journal of Probability and Mathematical Statistics publication_identifier: issn: - 1980-0436 publication_status: published publisher: Instituto Nacional de Matematica Pura e Aplicada quality_controlled: '1' scopus_import: '1' status: public title: Transition to shocks in TASEP and decoupling of last passage times type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 15 year: '2018' ... --- _id: '703' abstract: - lang: eng text: We consider the NP-hard problem of MAP-inference for undirected discrete graphical models. We propose a polynomial time and practically efficient algorithm for finding a part of its optimal solution. Specifically, our algorithm marks some labels of the considered graphical model either as (i) optimal, meaning that they belong to all optimal solutions of the inference problem; (ii) non-optimal if they provably do not belong to any solution. With access to an exact solver of a linear programming relaxation to the MAP-inference problem, our algorithm marks the maximal possible (in a specified sense) number of labels. We also present a version of the algorithm, which has access to a suboptimal dual solver only and still can ensure the (non-)optimality for the marked labels, although the overall number of the marked labels may decrease. We propose an efficient implementation, which runs in time comparable to a single run of a suboptimal dual solver. Our method is well-scalable and shows state-of-the-art results on computational benchmarks from machine learning and computer vision. arxiv: 1 author: - first_name: Alexander full_name: Shekhovtsov, Alexander last_name: Shekhovtsov - first_name: Paul full_name: Swoboda, Paul id: 446560C6-F248-11E8-B48F-1D18A9856A87 last_name: Swoboda - first_name: Bogdan full_name: Savchynskyy, Bogdan last_name: Savchynskyy citation: ama: Shekhovtsov A, Swoboda P, Savchynskyy B. Maximum persistency via iterative relaxed inference with graphical models. IEEE Transactions on Pattern Analysis and Machine Intelligence. 2018;40(7):1668-1682. doi:10.1109/TPAMI.2017.2730884 apa: Shekhovtsov, A., Swoboda, P., & Savchynskyy, B. (2018). Maximum persistency via iterative relaxed inference with graphical models. IEEE Transactions on Pattern Analysis and Machine Intelligence. IEEE. https://doi.org/10.1109/TPAMI.2017.2730884 chicago: Shekhovtsov, Alexander, Paul Swoboda, and Bogdan Savchynskyy. “Maximum Persistency via Iterative Relaxed Inference with Graphical Models.” IEEE Transactions on Pattern Analysis and Machine Intelligence. IEEE, 2018. https://doi.org/10.1109/TPAMI.2017.2730884. ieee: A. Shekhovtsov, P. Swoboda, and B. Savchynskyy, “Maximum persistency via iterative relaxed inference with graphical models,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 40, no. 7. IEEE, pp. 1668–1682, 2018. ista: Shekhovtsov A, Swoboda P, Savchynskyy B. 2018. Maximum persistency via iterative relaxed inference with graphical models. IEEE Transactions on Pattern Analysis and Machine Intelligence. 40(7), 1668–1682. mla: Shekhovtsov, Alexander, et al. “Maximum Persistency via Iterative Relaxed Inference with Graphical Models.” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 40, no. 7, IEEE, 2018, pp. 1668–82, doi:10.1109/TPAMI.2017.2730884. short: A. Shekhovtsov, P. Swoboda, B. Savchynskyy, IEEE Transactions on Pattern Analysis and Machine Intelligence 40 (2018) 1668–1682. date_created: 2018-12-11T11:48:01Z date_published: 2018-07-01T00:00:00Z date_updated: 2021-01-12T08:11:32Z day: '01' department: - _id: VlKo doi: 10.1109/TPAMI.2017.2730884 external_id: arxiv: - '1508.07902' intvolume: ' 40' issue: '7' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1508.07902 month: '07' oa: 1 oa_version: Preprint page: 1668-1682 publication: IEEE Transactions on Pattern Analysis and Machine Intelligence publication_identifier: issn: - '01628828' publication_status: published publisher: IEEE publist_id: '6992' quality_controlled: '1' scopus_import: 1 status: public title: Maximum persistency via iterative relaxed inference with graphical models type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 40 year: '2018' ... --- _id: '7058' abstract: - lang: eng text: We examine recent magnetic torque measurements in two compounds, γ−Li2IrO3 and RuCl3, which have been discussed as possible realizations of the Kitaev model. The analysis of the reported discontinuity in torque, as an external magnetic field is rotated across the c axis in both crystals, suggests that they have a translationally invariant chiral spin order of the form ⟨Si⋅(Sj×Sk)⟩≠0 in the ground state and persisting over a very wide range of magnetic field and temperature. An extraordinary |B|B2 dependence of the torque for small fields, beside the usual B2 part, is predicted by the chiral spin order. Data for small fields are available for γ−Li2IrO3 and are found to be consistent with the prediction upon further analysis. Other experiments such as inelastic scattering and thermal Hall effect and several questions raised by the discovery of chiral spin order, including its topological consequences, are discussed. article_number: '205110 ' article_processing_charge: No article_type: original arxiv: 1 author: - first_name: Kimberly A full_name: Modic, Kimberly A id: 13C26AC0-EB69-11E9-87C6-5F3BE6697425 last_name: Modic orcid: 0000-0001-9760-3147 - first_name: B. J. full_name: Ramshaw, B. J. last_name: Ramshaw - first_name: A. full_name: Shekhter, A. last_name: Shekhter - first_name: C. M. full_name: Varma, C. M. last_name: Varma citation: ama: Modic KA, Ramshaw BJ, Shekhter A, Varma CM. Chiral spin order in some purported Kitaev spin-liquid compounds. Physical Review B. 2018;98(20). doi:10.1103/physrevb.98.205110 apa: Modic, K. A., Ramshaw, B. J., Shekhter, A., & Varma, C. M. (2018). Chiral spin order in some purported Kitaev spin-liquid compounds. Physical Review B. APS. https://doi.org/10.1103/physrevb.98.205110 chicago: Modic, Kimberly A, B. J. Ramshaw, A. Shekhter, and C. M. Varma. “Chiral Spin Order in Some Purported Kitaev Spin-Liquid Compounds.” Physical Review B. APS, 2018. https://doi.org/10.1103/physrevb.98.205110. ieee: K. A. Modic, B. J. Ramshaw, A. Shekhter, and C. M. Varma, “Chiral spin order in some purported Kitaev spin-liquid compounds,” Physical Review B, vol. 98, no. 20. APS, 2018. ista: Modic KA, Ramshaw BJ, Shekhter A, Varma CM. 2018. Chiral spin order in some purported Kitaev spin-liquid compounds. Physical Review B. 98(20), 205110. mla: Modic, Kimberly A., et al. “Chiral Spin Order in Some Purported Kitaev Spin-Liquid Compounds.” Physical Review B, vol. 98, no. 20, 205110, APS, 2018, doi:10.1103/physrevb.98.205110. short: K.A. Modic, B.J. Ramshaw, A. Shekhter, C.M. Varma, Physical Review B 98 (2018). date_created: 2019-11-19T13:01:31Z date_published: 2018-11-05T00:00:00Z date_updated: 2021-01-12T08:11:36Z day: '05' doi: 10.1103/physrevb.98.205110 extern: '1' external_id: arxiv: - '1807.06637' intvolume: ' 98' issue: '20' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1807.06637 month: '11' oa: 1 oa_version: Preprint publication: Physical Review B publication_identifier: eissn: - 2469-9969 issn: - 2469-9950 publication_status: published publisher: APS quality_controlled: '1' status: public title: Chiral spin order in some purported Kitaev spin-liquid compounds type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 98 year: '2018' ... --- _id: '7059' abstract: - lang: eng text: Unusual behavior in quantum materials commonly arises from their effective low-dimensional physics, reflecting the underlying anisotropy in the spin and charge degrees of freedom. Here we introduce the magnetotropic coefficient k = ∂2F/∂θ2, the second derivative of the free energy F with respect to the magnetic field orientation θ in the crystal. We show that the magnetotropic coefficient can be quantitatively determined from a shift in the resonant frequency of a commercially available atomic force microscopy cantilever under magnetic field. This detection method enables part per 100 million sensitivity and the ability to measure magnetic anisotropy in nanogram-scale samples, as demonstrated on the Weyl semimetal NbP. Measurement of the magnetotropic coefficient in the spin-liquid candidate RuCl3 highlights its sensitivity to anisotropic phase transitions and allows a quantitative comparison to other thermodynamic coefficients via the Ehrenfest relations. article_processing_charge: No article_type: original author: - first_name: Kimberly A full_name: Modic, Kimberly A id: 13C26AC0-EB69-11E9-87C6-5F3BE6697425 last_name: Modic orcid: 0000-0001-9760-3147 - first_name: Maja D. full_name: Bachmann, Maja D. last_name: Bachmann - first_name: B. J. full_name: Ramshaw, B. J. last_name: Ramshaw - first_name: F. full_name: Arnold, F. last_name: Arnold - first_name: K. R. full_name: Shirer, K. R. last_name: Shirer - first_name: Amelia full_name: Estry, Amelia last_name: Estry - first_name: J. B. full_name: Betts, J. B. last_name: Betts - first_name: Nirmal J. full_name: Ghimire, Nirmal J. last_name: Ghimire - first_name: E. D. full_name: Bauer, E. D. last_name: Bauer - first_name: Marcus full_name: Schmidt, Marcus last_name: Schmidt - first_name: Michael full_name: Baenitz, Michael last_name: Baenitz - first_name: E. full_name: Svanidze, E. last_name: Svanidze - first_name: Ross D. full_name: McDonald, Ross D. last_name: McDonald - first_name: Arkady full_name: Shekhter, Arkady last_name: Shekhter - first_name: Philip J. W. full_name: Moll, Philip J. W. last_name: Moll citation: ama: Modic KA, Bachmann MD, Ramshaw BJ, et al. Resonant torsion magnetometry in anisotropic quantum materials. Nature Communications. 2018;9(1):3975. doi:10.1038/s41467-018-06412-w apa: Modic, K. A., Bachmann, M. D., Ramshaw, B. J., Arnold, F., Shirer, K. R., Estry, A., … Moll, P. J. W. (2018). Resonant torsion magnetometry in anisotropic quantum materials. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-018-06412-w chicago: Modic, Kimberly A, Maja D. Bachmann, B. J. Ramshaw, F. Arnold, K. R. Shirer, Amelia Estry, J. B. Betts, et al. “Resonant Torsion Magnetometry in Anisotropic Quantum Materials.” Nature Communications. Springer Nature, 2018. https://doi.org/10.1038/s41467-018-06412-w. ieee: K. A. Modic et al., “Resonant torsion magnetometry in anisotropic quantum materials,” Nature Communications, vol. 9, no. 1. Springer Nature, p. 3975, 2018. ista: Modic KA, Bachmann MD, Ramshaw BJ, Arnold F, Shirer KR, Estry A, Betts JB, Ghimire NJ, Bauer ED, Schmidt M, Baenitz M, Svanidze E, McDonald RD, Shekhter A, Moll PJW. 2018. Resonant torsion magnetometry in anisotropic quantum materials. Nature Communications. 9(1), 3975. mla: Modic, Kimberly A., et al. “Resonant Torsion Magnetometry in Anisotropic Quantum Materials.” Nature Communications, vol. 9, no. 1, Springer Nature, 2018, p. 3975, doi:10.1038/s41467-018-06412-w. short: K.A. Modic, M.D. Bachmann, B.J. Ramshaw, F. Arnold, K.R. Shirer, A. Estry, J.B. Betts, N.J. Ghimire, E.D. Bauer, M. Schmidt, M. Baenitz, E. Svanidze, R.D. McDonald, A. Shekhter, P.J.W. Moll, Nature Communications 9 (2018) 3975. date_created: 2019-11-19T13:02:20Z date_published: 2018-09-28T00:00:00Z date_updated: 2021-01-12T08:11:37Z day: '28' ddc: - '530' doi: 10.1038/s41467-018-06412-w extern: '1' file: - access_level: open_access checksum: 46a313c816e66899d4dad2cf3583e5b0 content_type: application/pdf creator: dernst date_created: 2019-11-20T12:48:58Z date_updated: 2020-07-14T12:47:48Z file_id: '7088' file_name: 2018_NatureComm_Modic.pdf file_size: 1257681 relation: main_file file_date_updated: 2020-07-14T12:47:48Z has_accepted_license: '1' intvolume: ' 9' issue: '1' language: - iso: eng month: '09' oa: 1 oa_version: Published Version page: '3975' publication: Nature Communications publication_identifier: issn: - 2041-1723 publication_status: published publisher: Springer Nature quality_controlled: '1' status: public title: Resonant torsion magnetometry in anisotropic quantum materials 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: 9 year: '2018' ... --- _id: '7062' abstract: - lang: eng text: 'Weyl fermions are a recently discovered ingredient for correlated states of electronic matter. A key difficulty has been that real materials also contain non-Weyl quasiparticles, and disentangling the experimental signatures has proven challenging. Here we use magnetic fields up to 95 T to drive the Weyl semimetal TaAs far into its quantum limit, where only the purely chiral 0th Landau levels of the Weyl fermions are occupied. We find the electrical resistivity to be nearly independent of magnetic field up to 50 T: unusual for conventional metals but consistent with the chiral anomaly for Weyl fermions. Above 50 T we observe a two-order-of-magnitude increase in resistivity, indicating that a gap opens in the chiral Landau levels. Above 80 T we observe strong ultrasonic attenuation below 2 K, suggesting a mesoscopically textured state of matter. These results point the way to inducing new correlated states of matter in the quantum limit of Weyl semimetals.' article_number: '2217' article_processing_charge: No article_type: original author: - first_name: B. J. full_name: Ramshaw, B. J. last_name: Ramshaw - first_name: Kimberly A full_name: Modic, Kimberly A id: 13C26AC0-EB69-11E9-87C6-5F3BE6697425 last_name: Modic orcid: 0000-0001-9760-3147 - first_name: Arkady full_name: Shekhter, Arkady last_name: Shekhter - first_name: Yi full_name: Zhang, Yi last_name: Zhang - first_name: Eun-Ah full_name: Kim, Eun-Ah last_name: Kim - first_name: Philip J. W. full_name: Moll, Philip J. W. last_name: Moll - first_name: Maja D. full_name: Bachmann, Maja D. last_name: Bachmann - first_name: M. K. full_name: Chan, M. K. last_name: Chan - first_name: J. B. full_name: Betts, J. B. last_name: Betts - first_name: F. full_name: Balakirev, F. last_name: Balakirev - first_name: A. full_name: Migliori, A. last_name: Migliori - first_name: N. J. full_name: Ghimire, N. J. last_name: Ghimire - first_name: E. D. full_name: Bauer, E. D. last_name: Bauer - first_name: F. full_name: Ronning, F. last_name: Ronning - first_name: R. D. full_name: McDonald, R. D. last_name: McDonald citation: ama: Ramshaw BJ, Modic KA, Shekhter A, et al. Quantum limit transport and destruction of the Weyl nodes in TaAs. Nature Communications. 2018;9(1). doi:10.1038/s41467-018-04542-9 apa: Ramshaw, B. J., Modic, K. A., Shekhter, A., Zhang, Y., Kim, E.-A., Moll, P. J. W., … McDonald, R. D. (2018). Quantum limit transport and destruction of the Weyl nodes in TaAs. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-018-04542-9 chicago: Ramshaw, B. J., Kimberly A Modic, Arkady Shekhter, Yi Zhang, Eun-Ah Kim, Philip J. W. Moll, Maja D. Bachmann, et al. “Quantum Limit Transport and Destruction of the Weyl Nodes in TaAs.” Nature Communications. Springer Nature, 2018. https://doi.org/10.1038/s41467-018-04542-9. ieee: B. J. Ramshaw et al., “Quantum limit transport and destruction of the Weyl nodes in TaAs,” Nature Communications, vol. 9, no. 1. Springer Nature, 2018. ista: Ramshaw BJ, Modic KA, Shekhter A, Zhang Y, Kim E-A, Moll PJW, Bachmann MD, Chan MK, Betts JB, Balakirev F, Migliori A, Ghimire NJ, Bauer ED, Ronning F, McDonald RD. 2018. Quantum limit transport and destruction of the Weyl nodes in TaAs. Nature Communications. 9(1), 2217. mla: Ramshaw, B. J., et al. “Quantum Limit Transport and Destruction of the Weyl Nodes in TaAs.” Nature Communications, vol. 9, no. 1, 2217, Springer Nature, 2018, doi:10.1038/s41467-018-04542-9. short: B.J. Ramshaw, K.A. Modic, A. Shekhter, Y. Zhang, E.-A. Kim, P.J.W. Moll, M.D. Bachmann, M.K. Chan, J.B. Betts, F. Balakirev, A. Migliori, N.J. Ghimire, E.D. Bauer, F. Ronning, R.D. McDonald, Nature Communications 9 (2018). date_created: 2019-11-19T13:10:33Z date_published: 2018-06-07T00:00:00Z date_updated: 2021-01-12T08:11:38Z day: '07' ddc: - '530' doi: 10.1038/s41467-018-04542-9 extern: '1' file: - access_level: open_access checksum: 9c53f9a1f06a4d83d5fe879d2478b7d7 content_type: application/pdf creator: dernst date_created: 2019-11-20T13:55:44Z date_updated: 2020-07-14T12:47:48Z file_id: '7089' file_name: 2018_NatureComm_Ramshaw.pdf file_size: 1794797 relation: main_file file_date_updated: 2020-07-14T12:47:48Z has_accepted_license: '1' intvolume: ' 9' issue: '1' language: - iso: eng month: '06' oa: 1 oa_version: Published Version publication: Nature Communications publication_identifier: issn: - 2041-1723 publication_status: published publisher: Springer Nature quality_controlled: '1' status: public title: Quantum limit transport and destruction of the Weyl nodes in TaAs 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: 9 year: '2018' ... --- _id: '7063' abstract: - lang: eng text: The high-pressure synthesis and incommensurately modulated structure are reported for the new compound Sr2Pt8−xAs, with x = 0.715 (5). The structure consists of Sr2Pt3As layers alternating with Pt-only corrugated grids. Ab initio calculations predict a metallic character with a dominant role of the Pt d electrons. The electrical resistivity (ρ) and Seebeck coefficient confirm the metallic character, but surprisingly, ρ showed a near-flat temperature dependence. This observation fits the description of the Mooij correlation for electrical resistivity in disordered metals, originally developed for statistically distributed point defects. The discussed material has a long-range crystallographic order, but the high concentration of Pt vacancies, incommensurately ordered, strongly influences the electronic conduction properties. This result extends the range of validity of the Mooij correlation to long-range ordered incommensurately modulated vacancies. Motivated by the layered structure, the resistivity anisotropy was measured in a focused-ion-beam micro-fabricated well oriented single crystal. A low resistivity anisotropy indicates that the layers are electrically coupled and conduction channels along different directions are intermixed. article_processing_charge: No article_type: original author: - first_name: Edoardo full_name: Martino, Edoardo last_name: Martino - first_name: Alla full_name: Arakcheeva, Alla last_name: Arakcheeva - first_name: Gabriel full_name: Autès, Gabriel last_name: Autès - first_name: Andrea full_name: Pisoni, Andrea last_name: Pisoni - first_name: Maja D. full_name: Bachmann, Maja D. last_name: Bachmann - first_name: Kimberly A full_name: Modic, Kimberly A id: 13C26AC0-EB69-11E9-87C6-5F3BE6697425 last_name: Modic orcid: 0000-0001-9760-3147 - first_name: Toni full_name: Helm, Toni last_name: Helm - first_name: Oleg V. full_name: Yazyev, Oleg V. last_name: Yazyev - first_name: Philip J. W. full_name: Moll, Philip J. W. last_name: Moll - first_name: László full_name: Forró, László last_name: Forró - first_name: Sergiy full_name: Katrych, Sergiy last_name: Katrych citation: ama: 'Martino E, Arakcheeva A, Autès G, et al. Sr2Pt8−xAs: A layered incommensurately modulated metal with saturated resistivity. IUCrJ. 2018;5(4):470-477. doi:10.1107/s2052252518007303' apa: 'Martino, E., Arakcheeva, A., Autès, G., Pisoni, A., Bachmann, M. D., Modic, K. A., … Katrych, S. (2018). Sr2Pt8−xAs: A layered incommensurately modulated metal with saturated resistivity. IUCrJ. International Union of Crystallography (IUCr). https://doi.org/10.1107/s2052252518007303' chicago: 'Martino, Edoardo, Alla Arakcheeva, Gabriel Autès, Andrea Pisoni, Maja D. Bachmann, Kimberly A Modic, Toni Helm, et al. “Sr2Pt8−xAs: A Layered Incommensurately Modulated Metal with Saturated Resistivity.” IUCrJ. International Union of Crystallography (IUCr), 2018. https://doi.org/10.1107/s2052252518007303.' ieee: 'E. Martino et al., “Sr2Pt8−xAs: A layered incommensurately modulated metal with saturated resistivity,” IUCrJ, vol. 5, no. 4. International Union of Crystallography (IUCr), pp. 470–477, 2018.' ista: 'Martino E, Arakcheeva A, Autès G, Pisoni A, Bachmann MD, Modic KA, Helm T, Yazyev OV, Moll PJW, Forró L, Katrych S. 2018. Sr2Pt8−xAs: A layered incommensurately modulated metal with saturated resistivity. IUCrJ. 5(4), 470–477.' mla: 'Martino, Edoardo, et al. “Sr2Pt8−xAs: A Layered Incommensurately Modulated Metal with Saturated Resistivity.” IUCrJ, vol. 5, no. 4, International Union of Crystallography (IUCr), 2018, pp. 470–77, doi:10.1107/s2052252518007303.' short: E. Martino, A. Arakcheeva, G. Autès, A. Pisoni, M.D. Bachmann, K.A. Modic, T. Helm, O.V. Yazyev, P.J.W. Moll, L. Forró, S. Katrych, IUCrJ 5 (2018) 470–477. date_created: 2019-11-19T13:11:15Z date_published: 2018-07-01T00:00:00Z date_updated: 2021-01-12T08:11:38Z day: '01' ddc: - '530' doi: 10.1107/s2052252518007303 extern: '1' file: - access_level: open_access checksum: 5c6180c7d19da599dd50a067eb2efd50 content_type: application/pdf creator: dernst date_created: 2019-11-20T14:00:27Z date_updated: 2020-07-14T12:47:48Z file_id: '7090' file_name: 2018_IUCrJ_Martino.pdf file_size: 1563353 relation: main_file file_date_updated: 2020-07-14T12:47:48Z has_accepted_license: '1' intvolume: ' 5' issue: '4' language: - iso: eng month: '07' oa: 1 oa_version: Published Version page: 470-477 publication: IUCrJ publication_identifier: eissn: - 2052-2525 publication_status: published publisher: International Union of Crystallography (IUCr) quality_controlled: '1' status: public title: 'Sr2Pt8−xAs: A layered incommensurately modulated metal with saturated resistivity' 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: 5 year: '2018' ... --- _id: '7116' abstract: - lang: eng text: 'Training deep learning models has received tremendous research interest recently. In particular, there has been intensive research on reducing the communication cost of training when using multiple computational devices, through reducing the precision of the underlying data representation. Naturally, such methods induce system trade-offs—lowering communication precision could de-crease communication overheads and improve scalability; but, on the other hand, it can also reduce the accuracy of training. In this paper, we study this trade-off space, and ask:Can low-precision communication consistently improve the end-to-end performance of training modern neural networks, with no accuracy loss?From the performance point of view, the answer to this question may appear deceptively easy: compressing communication through low precision should help when the ratio between communication and computation is high. However, this answer is less straightforward when we try to generalize this principle across various neural network architectures (e.g., AlexNet vs. ResNet),number of GPUs (e.g., 2 vs. 8 GPUs), machine configurations(e.g., EC2 instances vs. NVIDIA DGX-1), communication primitives (e.g., MPI vs. NCCL), and even different GPU architectures(e.g., Kepler vs. Pascal). Currently, it is not clear how a realistic realization of all these factors maps to the speed up provided by low-precision communication. In this paper, we conduct an empirical study to answer this question and report the insights.' article_processing_charge: No author: - first_name: Demjan full_name: Grubic, Demjan last_name: Grubic - first_name: Leo full_name: Tam, Leo last_name: Tam - 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: Ce full_name: Zhang, Ce last_name: Zhang citation: ama: 'Grubic D, Tam L, Alistarh D-A, Zhang C. Synchronous multi-GPU training for deep learning with low-precision communications: An empirical study. In: Proceedings of the 21st International Conference on Extending Database Technology. OpenProceedings; 2018:145-156. doi:10.5441/002/EDBT.2018.14' apa: 'Grubic, D., Tam, L., Alistarh, D.-A., & Zhang, C. (2018). Synchronous multi-GPU training for deep learning with low-precision communications: An empirical study. In Proceedings of the 21st International Conference on Extending Database Technology (pp. 145–156). Vienna, Austria: OpenProceedings. https://doi.org/10.5441/002/EDBT.2018.14' chicago: 'Grubic, Demjan, Leo Tam, Dan-Adrian Alistarh, and Ce Zhang. “Synchronous Multi-GPU Training for Deep Learning with Low-Precision Communications: An Empirical Study.” In Proceedings of the 21st International Conference on Extending Database Technology, 145–56. OpenProceedings, 2018. https://doi.org/10.5441/002/EDBT.2018.14.' ieee: 'D. Grubic, L. Tam, D.-A. Alistarh, and C. Zhang, “Synchronous multi-GPU training for deep learning with low-precision communications: An empirical study,” in Proceedings of the 21st International Conference on Extending Database Technology, Vienna, Austria, 2018, pp. 145–156.' ista: 'Grubic D, Tam L, Alistarh D-A, Zhang C. 2018. Synchronous multi-GPU training for deep learning with low-precision communications: An empirical study. Proceedings of the 21st International Conference on Extending Database Technology. EDBT: Conference on Extending Database Technology, 145–156.' mla: 'Grubic, Demjan, et al. “Synchronous Multi-GPU Training for Deep Learning with Low-Precision Communications: An Empirical Study.” Proceedings of the 21st International Conference on Extending Database Technology, OpenProceedings, 2018, pp. 145–56, doi:10.5441/002/EDBT.2018.14.' short: D. Grubic, L. Tam, D.-A. Alistarh, C. Zhang, in:, Proceedings of the 21st International Conference on Extending Database Technology, OpenProceedings, 2018, pp. 145–156. conference: end_date: 2018-03-29 location: Vienna, Austria name: 'EDBT: Conference on Extending Database Technology' start_date: 2018-03-26 date_created: 2019-11-26T14:19:11Z date_published: 2018-03-26T00:00:00Z date_updated: 2023-02-23T12:59:17Z day: '26' ddc: - '000' department: - _id: DaAl doi: 10.5441/002/EDBT.2018.14 file: - access_level: open_access checksum: ec979b56abc71016d6e6adfdadbb4afe content_type: application/pdf creator: dernst date_created: 2019-11-26T14:23:04Z date_updated: 2020-07-14T12:47:49Z file_id: '7118' file_name: 2018_OpenProceedings_Grubic.pdf file_size: 1603204 relation: main_file file_date_updated: 2020-07-14T12:47:49Z has_accepted_license: '1' language: - iso: eng month: '03' oa: 1 oa_version: Published Version page: 145-156 publication: Proceedings of the 21st International Conference on Extending Database Technology publication_identifier: isbn: - '9783893180783' issn: - 2367-2005 publication_status: published publisher: OpenProceedings quality_controlled: '1' scopus_import: 1 status: public title: 'Synchronous multi-GPU training for deep learning with low-precision communications: An empirical study' tmp: image: /images/cc_by_nc_nd.png legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0) short: CC BY-NC-ND (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2018' ... --- _id: '7123' abstract: - lang: eng text: "Population protocols are a popular model of distributed computing, in which n agents with limited local state interact randomly, and cooperate to collectively compute global predicates. Inspired by recent developments in DNA programming, an extensive series of papers, across different communities, has examined the computability and complexity characteristics of this model. Majority, or consensus, is a central task in this model, in which agents need to collectively reach a decision as to which one of two states A or B had a higher initial count. Two metrics are important: the time that a protocol requires to stabilize to an output decision, and the state space size that each agent requires to do so. It is known that majority requires Ω(log log n) states per agent to allow for fast (poly-logarithmic time) stabilization, and that O(log2 n) states are sufficient. Thus, there is an exponential gap between the space upper and lower bounds for this problem. This paper addresses this question.\r\n\r\nOn the negative side, we provide a new lower bound of Ω(log n) states for any protocol which stabilizes in O(n1–c) expected time, for any constant c > 0. This result is conditional on monotonicity and output assumptions, satisfied by all known protocols. Technically, it represents a departure from previous lower bounds, in that it does not rely on the existence of dense configurations. Instead, we introduce a new generalized surgery technique to prove the existence of incorrect executions for any algorithm which would contradict the lower bound. Subsequently, our lower bound also applies to general initial configurations, including ones with a leader. On the positive side, we give a new algorithm for majority which uses O(log n) states, and stabilizes in O(log2 n) expected time. Central to the algorithm is a new leaderless phase clock technique, which allows agents to synchronize in phases of Θ(n log n) consecutive interactions using O(log n) states per agent, exploiting a new connection between population protocols and power-of-two-choices load balancing mechanisms. We also employ our phase clock to build a leader election algorithm with a state space of size O(log n), which stabilizes in O(log2 n) expected time." article_processing_charge: No arxiv: 1 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: Rati full_name: Gelashvili, Rati last_name: Gelashvili citation: ama: 'Alistarh D-A, Aspnes J, Gelashvili R. Space-optimal majority in population protocols. In: Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM; 2018:2221-2239. doi:10.1137/1.9781611975031.144' apa: 'Alistarh, D.-A., Aspnes, J., & Gelashvili, R. (2018). Space-optimal majority in population protocols. In Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 2221–2239). New Orleans, LA, United States: ACM. https://doi.org/10.1137/1.9781611975031.144' chicago: Alistarh, Dan-Adrian, James Aspnes, and Rati Gelashvili. “Space-Optimal Majority in Population Protocols.” In Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms, 2221–39. ACM, 2018. https://doi.org/10.1137/1.9781611975031.144. ieee: D.-A. Alistarh, J. Aspnes, and R. Gelashvili, “Space-optimal majority in population protocols,” in Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, LA, United States, 2018, pp. 2221–2239. ista: 'Alistarh D-A, Aspnes J, Gelashvili R. 2018. Space-optimal majority in population protocols. Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 2221–2239.' mla: Alistarh, Dan-Adrian, et al. “Space-Optimal Majority in Population Protocols.” Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM, 2018, pp. 2221–39, doi:10.1137/1.9781611975031.144. short: D.-A. Alistarh, J. Aspnes, R. Gelashvili, in:, Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM, 2018, pp. 2221–2239. conference: end_date: 2018-01-10 location: New Orleans, LA, United States name: 'SODA: Symposium on Discrete Algorithms' start_date: 2018-01-07 date_created: 2019-11-26T15:10:55Z date_published: 2018-01-30T00:00:00Z date_updated: 2023-09-19T15:03:16Z day: '30' department: - _id: DaAl doi: 10.1137/1.9781611975031.144 external_id: arxiv: - '1704.04947' isi: - '000483921200145' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1704.04947 month: '01' oa: 1 oa_version: Preprint page: 2221-2239 publication: Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms publication_identifier: isbn: - '9781611975031' publication_status: published publisher: ACM quality_controlled: '1' status: public title: Space-optimal majority in population protocols type: conference user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 year: '2018' ... --- _id: '7126' abstract: - lang: eng text: In the Minimum Description Length (MDL) principle, learning from the data is equivalent to an optimal coding problem. We show that the codes that achieve optimal compression in MDL are critical in a very precise sense. First, when they are taken as generative models of samples, they generate samples with broad empirical distributions and with a high value of the relevance, defined as the entropy of the empirical frequencies. These results are derived for different statistical models (Dirichlet model, independent and pairwise dependent spin models, and restricted Boltzmann machines). Second, MDL codes sit precisely at a second order phase transition point where the symmetry between the sampled outcomes is spontaneously broken. The order parameter controlling the phase transition is the coding cost of the samples. The phase transition is a manifestation of the optimality of MDL codes, and it arises because codes that achieve a higher compression do not exist. These results suggest a clear interpretation of the widespread occurrence of statistical criticality as a characterization of samples which are maximally informative on the underlying generative process. article_number: '755' article_processing_charge: No article_type: original author: - first_name: Ryan J full_name: Cubero, Ryan J id: 850B2E12-9CD4-11E9-837F-E719E6697425 last_name: Cubero orcid: 0000-0003-0002-1867 - first_name: Matteo full_name: Marsili, Matteo last_name: Marsili - first_name: Yasser full_name: Roudi, Yasser last_name: Roudi citation: ama: Cubero RJ, Marsili M, Roudi Y. Minimum description length codes are critical. Entropy. 2018;20(10). doi:10.3390/e20100755 apa: Cubero, R. J., Marsili, M., & Roudi, Y. (2018). Minimum description length codes are critical. Entropy. MDPI. https://doi.org/10.3390/e20100755 chicago: Cubero, Ryan J, Matteo Marsili, and Yasser Roudi. “Minimum Description Length Codes Are Critical.” Entropy. MDPI, 2018. https://doi.org/10.3390/e20100755. ieee: R. J. Cubero, M. Marsili, and Y. Roudi, “Minimum description length codes are critical,” Entropy, vol. 20, no. 10. MDPI, 2018. ista: Cubero RJ, Marsili M, Roudi Y. 2018. Minimum description length codes are critical. Entropy. 20(10), 755. mla: Cubero, Ryan J., et al. “Minimum Description Length Codes Are Critical.” Entropy, vol. 20, no. 10, 755, MDPI, 2018, doi:10.3390/e20100755. short: R.J. Cubero, M. Marsili, Y. Roudi, Entropy 20 (2018). date_created: 2019-11-26T22:18:05Z date_published: 2018-10-01T00:00:00Z date_updated: 2021-01-12T08:11:56Z day: '01' ddc: - '519' doi: 10.3390/e20100755 extern: '1' file: - access_level: open_access checksum: d642b7b661e1d5066b62e6ea9986b917 content_type: application/pdf creator: rcubero date_created: 2019-11-26T22:23:08Z date_updated: 2020-07-14T12:47:50Z file_id: '7127' file_name: entropy-20-00755-v2.pdf file_size: 1366813 relation: main_file file_date_updated: 2020-07-14T12:47:50Z has_accepted_license: '1' intvolume: ' 20' issue: '10' keyword: - Minimum Description Length - normalized maximum likelihood - statistical criticality - phase transitions - large deviations language: - iso: eng month: '10' oa: 1 oa_version: Published Version publication: Entropy publication_identifier: issn: - 1099-4300 publication_status: published publisher: MDPI quality_controlled: '1' status: public title: Minimum description length codes are critical 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: 20 year: '2018' ... --- _id: '723' abstract: - lang: eng text: Escaping local optima is one of the major obstacles to function optimisation. Using the metaphor of a fitness landscape, local optima correspond to hills separated by fitness valleys that have to be overcome. We define a class of fitness valleys of tunable difficulty by considering their length, representing the Hamming path between the two optima and their depth, the drop in fitness. For this function class we present a runtime comparison between stochastic search algorithms using different search strategies. The (1+1) EA is a simple and well-studied evolutionary algorithm that has to jump across the valley to a point of higher fitness because it does not accept worsening moves (elitism). In contrast, the Metropolis algorithm and the Strong Selection Weak Mutation (SSWM) algorithm, a famous process in population genetics, are both able to cross the fitness valley by accepting worsening moves. We show that the runtime of the (1+1) EA depends critically on the length of the valley while the runtimes of the non-elitist algorithms depend crucially on the depth of the valley. Moreover, we show that both SSWM and Metropolis can also efficiently optimise a rugged function consisting of consecutive valleys. article_processing_charge: No author: - first_name: Pietro full_name: Oliveto, Pietro last_name: Oliveto - first_name: Tiago full_name: Paixao, Tiago id: 2C5658E6-F248-11E8-B48F-1D18A9856A87 last_name: Paixao orcid: 0000-0003-2361-3953 - first_name: Jorge full_name: Pérez Heredia, Jorge last_name: Pérez Heredia - first_name: Dirk full_name: Sudholt, Dirk last_name: Sudholt - first_name: Barbora full_name: Trubenova, Barbora id: 42302D54-F248-11E8-B48F-1D18A9856A87 last_name: Trubenova orcid: 0000-0002-6873-2967 citation: ama: Oliveto P, Paixao T, Pérez Heredia J, Sudholt D, Trubenova B. How to escape local optima in black box optimisation when non elitism outperforms elitism. Algorithmica. 2018;80(5):1604-1633. doi:10.1007/s00453-017-0369-2 apa: Oliveto, P., Paixao, T., Pérez Heredia, J., Sudholt, D., & Trubenova, B. (2018). How to escape local optima in black box optimisation when non elitism outperforms elitism. Algorithmica. Springer. https://doi.org/10.1007/s00453-017-0369-2 chicago: Oliveto, Pietro, Tiago Paixao, Jorge Pérez Heredia, Dirk Sudholt, and Barbora Trubenova. “How to Escape Local Optima in Black Box Optimisation When Non Elitism Outperforms Elitism.” Algorithmica. Springer, 2018. https://doi.org/10.1007/s00453-017-0369-2. ieee: P. Oliveto, T. Paixao, J. Pérez Heredia, D. Sudholt, and B. Trubenova, “How to escape local optima in black box optimisation when non elitism outperforms elitism,” Algorithmica, vol. 80, no. 5. Springer, pp. 1604–1633, 2018. ista: Oliveto P, Paixao T, Pérez Heredia J, Sudholt D, Trubenova B. 2018. How to escape local optima in black box optimisation when non elitism outperforms elitism. Algorithmica. 80(5), 1604–1633. mla: Oliveto, Pietro, et al. “How to Escape Local Optima in Black Box Optimisation When Non Elitism Outperforms Elitism.” Algorithmica, vol. 80, no. 5, Springer, 2018, pp. 1604–33, doi:10.1007/s00453-017-0369-2. short: P. Oliveto, T. Paixao, J. Pérez Heredia, D. Sudholt, B. Trubenova, Algorithmica 80 (2018) 1604–1633. date_created: 2018-12-11T11:48:09Z date_published: 2018-05-01T00:00:00Z date_updated: 2023-09-11T14:11:35Z day: '01' ddc: - '576' department: - _id: NiBa - _id: CaGu doi: 10.1007/s00453-017-0369-2 ec_funded: 1 external_id: isi: - '000428239300010' file: - access_level: open_access checksum: 7d92f5d7be81e387edeec4f06442791c content_type: application/pdf creator: system date_created: 2018-12-12T10:08:14Z date_updated: 2020-07-14T12:47:54Z file_id: '4674' file_name: IST-2018-1014-v1+1_2018_Paixao_Escape.pdf file_size: 691245 relation: main_file file_date_updated: 2020-07-14T12:47:54Z has_accepted_license: '1' intvolume: ' 80' isi: 1 issue: '5' language: - iso: eng month: '05' oa: 1 oa_version: Published Version page: 1604 - 1633 project: - _id: 25B1EC9E-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '618091' name: Speed of Adaptation in Population Genetics and Evolutionary Computation publication: Algorithmica publication_status: published publisher: Springer publist_id: '6957' pubrep_id: '1014' quality_controlled: '1' scopus_import: '1' status: public title: How to escape local optima in black box optimisation when non elitism outperforms elitism 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: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 80 year: '2018' ... --- _id: '7277' abstract: - lang: eng text: 'Solid alkali metal carbonates are universal passivation layer components of intercalation battery materials and common side products in metal‐O2 batteries, and are believed to form and decompose reversibly in metal‐O2/CO2 cells. In these cathodes, Li2CO3 decomposes to CO2 when exposed to potentials above 3.8 V vs. Li/Li+. However, O2 evolution, as would be expected according to the decomposition reaction 2 Li2CO3→4 Li++4 e−+2 CO2+O2, is not detected. O atoms are thus unaccounted for, which was previously ascribed to unidentified parasitic reactions. Here, we show that highly reactive singlet oxygen (1O2) forms upon oxidizing Li2CO3 in an aprotic electrolyte and therefore does not evolve as O2. These results have substantial implications for the long‐term cyclability of batteries: they underpin the importance of avoiding 1O2 in metal‐O2 batteries, question the possibility of a reversible metal‐O2/CO2 battery based on a carbonate discharge product, and help explain the interfacial reactivity of transition‐metal cathodes with residual Li2CO3.' article_processing_charge: No article_type: original author: - first_name: Nika full_name: Mahne, Nika last_name: Mahne - first_name: Sara E. full_name: Renfrew, Sara E. last_name: Renfrew - first_name: Bryan D. full_name: McCloskey, Bryan D. last_name: McCloskey - 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: Mahne N, Renfrew SE, McCloskey BD, Freunberger SA. Electrochemical oxidation of Lithium Carbonate generates singlet oxygen. Angewandte Chemie International Edition. 2018;57(19):5529-5533. doi:10.1002/anie.201802277 apa: Mahne, N., Renfrew, S. E., McCloskey, B. D., & Freunberger, S. A. (2018). Electrochemical oxidation of Lithium Carbonate generates singlet oxygen. Angewandte Chemie International Edition. Wiley. https://doi.org/10.1002/anie.201802277 chicago: Mahne, Nika, Sara E. Renfrew, Bryan D. McCloskey, and Stefan Alexander Freunberger. “Electrochemical Oxidation of Lithium Carbonate Generates Singlet Oxygen.” Angewandte Chemie International Edition. Wiley, 2018. https://doi.org/10.1002/anie.201802277. ieee: N. Mahne, S. E. Renfrew, B. D. McCloskey, and S. A. Freunberger, “Electrochemical oxidation of Lithium Carbonate generates singlet oxygen,” Angewandte Chemie International Edition, vol. 57, no. 19. Wiley, pp. 5529–5533, 2018. ista: Mahne N, Renfrew SE, McCloskey BD, Freunberger SA. 2018. Electrochemical oxidation of Lithium Carbonate generates singlet oxygen. Angewandte Chemie International Edition. 57(19), 5529–5533. mla: Mahne, Nika, et al. “Electrochemical Oxidation of Lithium Carbonate Generates Singlet Oxygen.” Angewandte Chemie International Edition, vol. 57, no. 19, Wiley, 2018, pp. 5529–33, doi:10.1002/anie.201802277. short: N. Mahne, S.E. Renfrew, B.D. McCloskey, S.A. Freunberger, Angewandte Chemie International Edition 57 (2018) 5529–5533. date_created: 2020-01-15T07:20:09Z date_published: 2018-03-15T00:00:00Z date_updated: 2021-01-12T08:12:42Z day: '15' ddc: - '540' doi: 10.1002/anie.201802277 extern: '1' file: - access_level: open_access checksum: 45868d0adc2d13a506bb9a59eb4f409c content_type: application/pdf creator: dernst date_created: 2020-01-22T16:28:31Z date_updated: 2020-07-14T12:47:55Z file_id: '7357' file_name: 2018_AngewChemie_Mahne.pdf file_size: 657963 relation: main_file file_date_updated: 2020-07-14T12:47:55Z has_accepted_license: '1' intvolume: ' 57' issue: '19' language: - iso: eng month: '03' oa: 1 oa_version: Published Version page: 5529-5533 publication: Angewandte Chemie International Edition publication_identifier: issn: - 1433-7851 publication_status: published publisher: Wiley quality_controlled: '1' status: public title: Electrochemical oxidation of Lithium Carbonate generates singlet oxygen tmp: image: /images/cc_by_nc_nd.png legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0) short: CC BY-NC-ND (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 57 year: '2018' ... --- _id: '7285' abstract: - lang: eng text: Hydrogelation, the self-assembly of molecules into soft, water-loaded networks, is one way to bridge the structural gap between single molecules and functional materials. The potential of hydrogels, such as those based on perylene bisimides, lies in their chemical, physical, optical, and electronic properties, which are governed by the supramolecular structure of the gel. However, the structural motifs and their precise role for long-range conductivity are yet to be explored. Here, we present a comprehensive structural picture of a perylene bisimide hydrogel, suggesting that its long-range conductivity is limited by charge transfer between electronic backbones. We reveal nanocrystalline ribbon-like structures as the electronic and structural backbone units between which charge transfer is mediated by polar solvent bridges. We exemplify this effect with sensing, where exposure to polar vapor enhances conductivity by 5 orders of magnitude, emphasizing the crucial role of the interplay between structural motif and surrounding medium for the rational design of devices based on nanocrystalline hydrogels. article_processing_charge: No article_type: original author: - first_name: Max full_name: Burian, Max last_name: Burian - first_name: Francesco full_name: Rigodanza, Francesco last_name: Rigodanza - first_name: Nicola full_name: Demitri, Nicola last_name: Demitri - first_name: Luka full_name: D̵ord̵ević, Luka last_name: D̵ord̵ević - first_name: Silvia full_name: Marchesan, Silvia last_name: Marchesan - first_name: Tereza full_name: Steinhartova, Tereza last_name: Steinhartova - first_name: Ilse full_name: Letofsky-Papst, Ilse last_name: Letofsky-Papst - first_name: Ivan full_name: Khalakhan, Ivan last_name: Khalakhan - first_name: Eléonore full_name: Mourad, Eléonore last_name: Mourad - 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: Heinz full_name: Amenitsch, Heinz last_name: Amenitsch - first_name: Maurizio full_name: Prato, Maurizio last_name: Prato - first_name: Zois full_name: Syrgiannis, Zois last_name: Syrgiannis citation: ama: Burian M, Rigodanza F, Demitri N, et al. Inter-backbone charge transfer as prerequisite for long-range conductivity in perylene bisimide hydrogels. ACS Nano. 2018;12(6):5800-5806. doi:10.1021/acsnano.8b01689 apa: Burian, M., Rigodanza, F., Demitri, N., D̵ord̵ević, L., Marchesan, S., Steinhartova, T., … Syrgiannis, Z. (2018). Inter-backbone charge transfer as prerequisite for long-range conductivity in perylene bisimide hydrogels. ACS Nano. ACS. https://doi.org/10.1021/acsnano.8b01689 chicago: Burian, Max, Francesco Rigodanza, Nicola Demitri, Luka D̵ord̵ević, Silvia Marchesan, Tereza Steinhartova, Ilse Letofsky-Papst, et al. “Inter-Backbone Charge Transfer as Prerequisite for Long-Range Conductivity in Perylene Bisimide Hydrogels.” ACS Nano. ACS, 2018. https://doi.org/10.1021/acsnano.8b01689. ieee: M. Burian et al., “Inter-backbone charge transfer as prerequisite for long-range conductivity in perylene bisimide hydrogels,” ACS Nano, vol. 12, no. 6. ACS, pp. 5800–5806, 2018. ista: Burian M, Rigodanza F, Demitri N, D̵ord̵ević L, Marchesan S, Steinhartova T, Letofsky-Papst I, Khalakhan I, Mourad E, Freunberger SA, Amenitsch H, Prato M, Syrgiannis Z. 2018. Inter-backbone charge transfer as prerequisite for long-range conductivity in perylene bisimide hydrogels. ACS Nano. 12(6), 5800–5806. mla: Burian, Max, et al. “Inter-Backbone Charge Transfer as Prerequisite for Long-Range Conductivity in Perylene Bisimide Hydrogels.” ACS Nano, vol. 12, no. 6, ACS, 2018, pp. 5800–06, doi:10.1021/acsnano.8b01689. short: M. Burian, F. Rigodanza, N. Demitri, L. D̵ord̵ević, S. Marchesan, T. Steinhartova, I. Letofsky-Papst, I. Khalakhan, E. Mourad, S.A. Freunberger, H. Amenitsch, M. Prato, Z. Syrgiannis, ACS Nano 12 (2018) 5800–5806. date_created: 2020-01-15T12:13:25Z date_published: 2018-06-05T00:00:00Z date_updated: 2021-01-12T08:12:46Z day: '05' ddc: - '540' - '541' doi: 10.1021/acsnano.8b01689 extern: '1' file: - access_level: open_access checksum: 050f7f0ba5d845c5c71779ef14ad5ef3 content_type: application/pdf creator: sfreunbe date_created: 2020-06-29T14:56:40Z date_updated: 2020-07-14T12:47:55Z file_id: '8052' file_name: Manuscript 20092017_subm.pdf file_size: 1333353 relation: main_file file_date_updated: 2020-07-14T12:47:55Z has_accepted_license: '1' intvolume: ' 12' issue: '6' language: - iso: eng month: '06' oa: 1 oa_version: Submitted Version page: 5800-5806 publication: ACS Nano publication_identifier: issn: - 1936-0851 publication_status: published publisher: ACS quality_controlled: '1' status: public title: Inter-backbone charge transfer as prerequisite for long-range conductivity in perylene bisimide hydrogels type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 12 year: '2018' ... --- _id: '7287' abstract: - lang: eng text: Passivation layers on electrode materials are ubiquitous in nonaqueous battery chemistries and strongly govern performance and lifetime. They comprise breakdown products of the electrolyte including carbonate, alkyl carbonates, alkoxides, carboxylates, and polymers. Parasitic chemistry in metal–O2 batteries forms similar products and is tied to the deviation of the O2 balance from the ideal stoichiometry during formation/decomposition of alkaline peroxides or superoxides. Accurate and integral quantification of carbonaceous species and peroxides or superoxides in battery electrodes remains, however, elusive. We present a refined procedure to quantify them accurately and sensitively by pointing out and rectifying pitfalls of previous procedures. Carbonaceous compounds are differentiated into inorganic and organic ones. We combine mass and UV–vis spectrometry to quantify evolved O2 and complexed peroxide and CO2 evolved from carbonaceous compounds by acid treatment and Fenton’s reaction. The capabilities of the method are exemplified by means of Li–O2 and Na–O2 cathodes, graphite anodes, and LiNi0.8Co0.15Al0.05O2 cathodes. article_processing_charge: No article_type: letter_note author: - first_name: Bettina full_name: Schafzahl, Bettina last_name: Schafzahl - first_name: Eléonore full_name: Mourad, Eléonore last_name: Mourad - first_name: Lukas full_name: Schafzahl, Lukas last_name: Schafzahl - first_name: Yann K. full_name: Petit, Yann K. last_name: Petit - first_name: Anjana R. full_name: Raju, Anjana R. last_name: Raju - first_name: Musthafa Ottakam full_name: Thotiyl, Musthafa Ottakam last_name: Thotiyl - first_name: Martin full_name: Wilkening, Martin last_name: Wilkening - first_name: Christian full_name: Slugovc, Christian last_name: Slugovc - 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: Schafzahl B, Mourad E, Schafzahl L, et al. Quantifying total superoxide, peroxide, and carbonaceous compounds in metal–O2 batteries and the solid electrolyte interphase. ACS Energy Letters. 2018;3(1):170-176. doi:10.1021/acsenergylett.7b01111 apa: Schafzahl, B., Mourad, E., Schafzahl, L., Petit, Y. K., Raju, A. R., Thotiyl, M. O., … Freunberger, S. A. (2018). Quantifying total superoxide, peroxide, and carbonaceous compounds in metal–O2 batteries and the solid electrolyte interphase. ACS Energy Letters. ACS. https://doi.org/10.1021/acsenergylett.7b01111 chicago: Schafzahl, Bettina, Eléonore Mourad, Lukas Schafzahl, Yann K. Petit, Anjana R. Raju, Musthafa Ottakam Thotiyl, Martin Wilkening, Christian Slugovc, and Stefan Alexander Freunberger. “Quantifying Total Superoxide, Peroxide, and Carbonaceous Compounds in Metal–O2 Batteries and the Solid Electrolyte Interphase.” ACS Energy Letters. ACS, 2018. https://doi.org/10.1021/acsenergylett.7b01111. ieee: B. Schafzahl et al., “Quantifying total superoxide, peroxide, and carbonaceous compounds in metal–O2 batteries and the solid electrolyte interphase,” ACS Energy Letters, vol. 3, no. 1. ACS, pp. 170–176, 2018. ista: Schafzahl B, Mourad E, Schafzahl L, Petit YK, Raju AR, Thotiyl MO, Wilkening M, Slugovc C, Freunberger SA. 2018. Quantifying total superoxide, peroxide, and carbonaceous compounds in metal–O2 batteries and the solid electrolyte interphase. ACS Energy Letters. 3(1), 170–176. mla: Schafzahl, Bettina, et al. “Quantifying Total Superoxide, Peroxide, and Carbonaceous Compounds in Metal–O2 Batteries and the Solid Electrolyte Interphase.” ACS Energy Letters, vol. 3, no. 1, ACS, 2018, pp. 170–76, doi:10.1021/acsenergylett.7b01111. short: B. Schafzahl, E. Mourad, L. Schafzahl, Y.K. Petit, A.R. Raju, M.O. Thotiyl, M. Wilkening, C. Slugovc, S.A. Freunberger, ACS Energy Letters 3 (2018) 170–176. date_created: 2020-01-15T12:13:52Z date_published: 2018-01-01T00:00:00Z date_updated: 2021-01-12T08:12:46Z day: '01' ddc: - '540' - '543' - '546' - '547' doi: 10.1021/acsenergylett.7b01111 extern: '1' file: - access_level: open_access checksum: 461ccf575ba077af90314fe72d20521e content_type: application/pdf creator: sfreunbe date_created: 2020-06-29T14:19:36Z date_updated: 2020-07-14T12:47:55Z file_id: '8049' file_name: O2 TIOC_fin_incl_SI.pdf file_size: 1892355 relation: main_file file_date_updated: 2020-07-14T12:47:55Z has_accepted_license: '1' intvolume: ' 3' issue: '1' language: - iso: eng month: '01' oa: 1 oa_version: Submitted Version page: 170-176 publication: ACS Energy Letters publication_identifier: issn: - 2380-8195 - 2380-8195 publication_status: published publisher: ACS quality_controlled: '1' status: public title: Quantifying total superoxide, peroxide, and carbonaceous compounds in metal–O2 batteries and the solid electrolyte interphase type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 3 year: '2018' ... --- _id: '738' abstract: - lang: eng text: 'This paper is devoted to automatic competitive analysis of real-time scheduling algorithms for firm-deadline tasksets, where only completed tasks con- tribute some utility to the system. Given such a taskset T , the competitive ratio of an on-line scheduling algorithm A for T is the worst-case utility ratio of A over the utility achieved by a clairvoyant algorithm. We leverage the theory of quantitative graph games to address the competitive analysis and competitive synthesis problems. For the competitive analysis case, given any taskset T and any finite-memory on- line scheduling algorithm A , we show that the competitive ratio of A in T can be computed in polynomial time in the size of the state space of A . Our approach is flexible as it also provides ways to model meaningful constraints on the released task sequences that determine the competitive ratio. We provide an experimental study of many well-known on-line scheduling algorithms, which demonstrates the feasibility of our competitive analysis approach that effectively replaces human ingenuity (required Preliminary versions of this paper have appeared in Chatterjee et al. ( 2013 , 2014 ). B Andreas Pavlogiannis pavlogiannis@ist.ac.at Krishnendu Chatterjee krish.chat@ist.ac.at Alexander Kößler koe@ecs.tuwien.ac.at Ulrich Schmid s@ecs.tuwien.ac.at 1 IST Austria (Institute of Science and Technology Austria), Am Campus 1, 3400 Klosterneuburg, Austria 2 Embedded Computing Systems Group, Vienna University of Technology, Treitlstrasse 3, 1040 Vienna, Austria 123 Real-Time Syst for finding worst-case scenarios) by computing power. For the competitive synthesis case, we are just given a taskset T , and the goal is to automatically synthesize an opti- mal on-line scheduling algorithm A , i.e., one that guarantees the largest competitive ratio possible for T . We show how the competitive synthesis problem can be reduced to a two-player graph game with partial information, and establish that the compu- tational complexity of solving this game is Np -complete. The competitive synthesis problem is hence in Np in the size of the state space of the non-deterministic labeled transition system encoding the taskset. Overall, the proposed framework assists in the selection of suitable scheduling algorithms for a given taskset, which is in fact the most common situation in real-time systems design. ' article_processing_charge: No author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Andreas full_name: Pavlogiannis, Andreas id: 49704004-F248-11E8-B48F-1D18A9856A87 last_name: Pavlogiannis orcid: 0000-0002-8943-0722 - first_name: Alexander full_name: Kößler, Alexander last_name: Kößler - first_name: Ulrich full_name: Schmid, Ulrich last_name: Schmid citation: ama: Chatterjee K, Pavlogiannis A, Kößler A, Schmid U. Automated competitive analysis of real time scheduling with graph games. Real-Time Systems. 2018;54(1):166-207. doi:10.1007/s11241-017-9293-4 apa: Chatterjee, K., Pavlogiannis, A., Kößler, A., & Schmid, U. (2018). Automated competitive analysis of real time scheduling with graph games. Real-Time Systems. Springer. https://doi.org/10.1007/s11241-017-9293-4 chicago: Chatterjee, Krishnendu, Andreas Pavlogiannis, Alexander Kößler, and Ulrich Schmid. “Automated Competitive Analysis of Real Time Scheduling with Graph Games.” Real-Time Systems. Springer, 2018. https://doi.org/10.1007/s11241-017-9293-4. ieee: K. Chatterjee, A. Pavlogiannis, A. Kößler, and U. Schmid, “Automated competitive analysis of real time scheduling with graph games,” Real-Time Systems, vol. 54, no. 1. Springer, pp. 166–207, 2018. ista: Chatterjee K, Pavlogiannis A, Kößler A, Schmid U. 2018. Automated competitive analysis of real time scheduling with graph games. Real-Time Systems. 54(1), 166–207. mla: Chatterjee, Krishnendu, et al. “Automated Competitive Analysis of Real Time Scheduling with Graph Games.” Real-Time Systems, vol. 54, no. 1, Springer, 2018, pp. 166–207, doi:10.1007/s11241-017-9293-4. short: K. Chatterjee, A. Pavlogiannis, A. Kößler, U. Schmid, Real-Time Systems 54 (2018) 166–207. date_created: 2018-12-11T11:48:14Z date_published: 2018-01-01T00:00:00Z date_updated: 2023-09-27T12:52:38Z day: '01' ddc: - '000' department: - _id: KrCh doi: 10.1007/s11241-017-9293-4 ec_funded: 1 external_id: isi: - '000419955500006' file: - access_level: open_access checksum: c2590ef160709d8054cf29ee173f1454 content_type: application/pdf creator: system date_created: 2018-12-12T10:17:14Z date_updated: 2020-07-14T12:47:56Z file_id: '5267' file_name: IST-2018-960-v1+1_2017_Chatterjee_Automated_competetive.pdf file_size: 1163507 relation: main_file file_date_updated: 2020-07-14T12:47:56Z has_accepted_license: '1' intvolume: ' 54' isi: 1 issue: '1' language: - iso: eng month: '01' oa: 1 oa_version: Published Version page: 166 - 207 project: - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 25863FF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11407 name: Game Theory - _id: 2584A770-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P 23499-N23 name: Modern Graph Algorithmic Techniques in Formal Verification - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' - _id: 2587B514-B435-11E9-9278-68D0E5697425 name: Microsoft Research Faculty Fellowship publication: Real-Time Systems publication_status: published publisher: Springer publist_id: '6929' pubrep_id: '960' quality_controlled: '1' related_material: record: - id: '2820' relation: earlier_version status: public scopus_import: '1' status: public title: Automated competitive analysis of real time scheduling with graph games 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: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 54 year: '2018' ... --- _id: '7407' abstract: - lang: eng text: 'Proofs of space (PoS) [Dziembowski et al., CRYPTO''15] are proof systems where a prover can convince a verifier that he "wastes" disk space. PoS were introduced as a more ecological and economical replacement for proofs of work which are currently used to secure blockchains like Bitcoin. In this work we investigate extensions of PoS which allow the prover to embed useful data into the dedicated space, which later can be recovered. Our first contribution is a security proof for the original PoS from CRYPTO''15 in the random oracle model (the original proof only applied to a restricted class of adversaries which can store a subset of the data an honest prover would store). When this PoS is instantiated with recent constructions of maximally depth robust graphs, our proof implies basically optimal security. As a second contribution we show three different extensions of this PoS where useful data can be embedded into the space required by the prover. Our security proof for the PoS extends (non-trivially) to these constructions. We discuss how some of these variants can be used as proofs of catalytic space (PoCS), a notion we put forward in this work, and which basically is a PoS where most of the space required by the prover can be used to backup useful data. Finally we discuss how one of the extensions is a candidate construction for a proof of replication (PoR), a proof system recently suggested in the Filecoin whitepaper. ' alternative_title: - LIPIcs article_processing_charge: No author: - first_name: Krzysztof Z full_name: Pietrzak, Krzysztof Z id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87 last_name: Pietrzak orcid: 0000-0002-9139-1654 citation: ama: 'Pietrzak KZ. Proofs of catalytic space. In: 10th Innovations in Theoretical Computer Science  Conference (ITCS 2019). Vol 124. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018:59:1-59:25. doi:10.4230/LIPICS.ITCS.2019.59' apa: 'Pietrzak, K. Z. (2018). Proofs of catalytic space. In 10th Innovations in Theoretical Computer Science  Conference (ITCS 2019) (Vol. 124, p. 59:1-59:25). San Diego, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ITCS.2019.59' chicago: Pietrzak, Krzysztof Z. “Proofs of Catalytic Space.” In 10th Innovations in Theoretical Computer Science  Conference (ITCS 2019), 124:59:1-59:25. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPICS.ITCS.2019.59. ieee: K. Z. Pietrzak, “Proofs of catalytic space,” in 10th Innovations in Theoretical Computer Science  Conference (ITCS 2019), San Diego, CA, United States, 2018, vol. 124, p. 59:1-59:25. ista: 'Pietrzak KZ. 2018. Proofs of catalytic space. 10th Innovations in Theoretical Computer Science  Conference (ITCS 2019). ITCS: Innovations in theoretical Computer Science Conference, LIPIcs, vol. 124, 59:1-59:25.' mla: Pietrzak, Krzysztof Z. “Proofs of Catalytic Space.” 10th Innovations in Theoretical Computer Science  Conference (ITCS 2019), vol. 124, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 59:1-59:25, doi:10.4230/LIPICS.ITCS.2019.59. short: K.Z. Pietrzak, in:, 10th Innovations in Theoretical Computer Science  Conference (ITCS 2019), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 59:1-59:25. conference: end_date: 2019-01-12 location: San Diego, CA, United States name: 'ITCS: Innovations in theoretical Computer Science Conference' start_date: 2019-01-10 date_created: 2020-01-30T09:16:05Z date_published: 2018-12-31T00:00:00Z date_updated: 2021-01-12T08:13:26Z day: '31' ddc: - '000' department: - _id: KrPi doi: 10.4230/LIPICS.ITCS.2019.59 ec_funded: 1 file: - access_level: open_access checksum: 5cebb7f7849a3beda898f697d755dd96 content_type: application/pdf creator: dernst date_created: 2020-02-04T08:17:52Z date_updated: 2020-07-14T12:47:57Z file_id: '7443' file_name: 2018_LIPIcs_Pietrzak.pdf file_size: 822884 relation: main_file file_date_updated: 2020-07-14T12:47:57Z has_accepted_license: '1' intvolume: ' 124' language: - iso: eng main_file_link: - open_access: '1' url: https://eprint.iacr.org/2018/194 month: '12' oa: 1 oa_version: Published Version page: 59:1-59:25 project: - _id: 258AA5B2-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '682815' name: Teaching Old Crypto New Tricks publication: 10th Innovations in Theoretical Computer Science Conference (ITCS 2019) publication_identifier: isbn: - 978-3-95977-095-8 issn: - 1868-8969 publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: 1 status: public title: Proofs of catalytic space 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: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 124 year: '2018' ... --- _id: '742' abstract: - lang: eng text: 'We give a detailed and easily accessible proof of Gromov’s Topological Overlap Theorem. Let X be a finite simplicial complex or, more generally, a finite polyhedral cell complex of dimension d. Informally, the theorem states that if X has sufficiently strong higher-dimensional expansion properties (which generalize edge expansion of graphs and are defined in terms of cellular cochains of X) then X has the following topological overlap property: for every continuous map (Formula presented.) there exists a point (Formula presented.) that is contained in the images of a positive fraction (Formula presented.) of the d-cells of X. More generally, the conclusion holds if (Formula presented.) is replaced by any d-dimensional piecewise-linear manifold M, with a constant (Formula presented.) that depends only on d and on the expansion properties of X, but not on M.' article_processing_charge: Yes (via OA deal) author: - first_name: Dominic full_name: Dotterrer, Dominic last_name: Dotterrer - first_name: Tali full_name: Kaufman, Tali last_name: Kaufman - first_name: Uli full_name: Wagner, Uli id: 36690CA2-F248-11E8-B48F-1D18A9856A87 last_name: Wagner orcid: 0000-0002-1494-0568 citation: ama: Dotterrer D, Kaufman T, Wagner U. On expansion and topological overlap. Geometriae Dedicata. 2018;195(1):307–317. doi:10.1007/s10711-017-0291-4 apa: Dotterrer, D., Kaufman, T., & Wagner, U. (2018). On expansion and topological overlap. Geometriae Dedicata. Springer. https://doi.org/10.1007/s10711-017-0291-4 chicago: Dotterrer, Dominic, Tali Kaufman, and Uli Wagner. “On Expansion and Topological Overlap.” Geometriae Dedicata. Springer, 2018. https://doi.org/10.1007/s10711-017-0291-4. ieee: D. Dotterrer, T. Kaufman, and U. Wagner, “On expansion and topological overlap,” Geometriae Dedicata, vol. 195, no. 1. Springer, pp. 307–317, 2018. ista: Dotterrer D, Kaufman T, Wagner U. 2018. On expansion and topological overlap. Geometriae Dedicata. 195(1), 307–317. mla: Dotterrer, Dominic, et al. “On Expansion and Topological Overlap.” Geometriae Dedicata, vol. 195, no. 1, Springer, 2018, pp. 307–317, doi:10.1007/s10711-017-0291-4. short: D. Dotterrer, T. Kaufman, U. Wagner, Geometriae Dedicata 195 (2018) 307–317. date_created: 2018-12-11T11:48:16Z date_published: 2018-08-01T00:00:00Z date_updated: 2023-09-27T12:29:57Z day: '01' ddc: - '514' - '516' department: - _id: UlWa doi: 10.1007/s10711-017-0291-4 external_id: isi: - '000437122700017' file: - access_level: open_access checksum: d2f70fc132156504aa4c626aa378a7ab content_type: application/pdf creator: kschuh date_created: 2019-01-15T13:44:05Z date_updated: 2020-07-14T12:47:58Z file_id: '5835' file_name: s10711-017-0291-4.pdf file_size: 412486 relation: main_file file_date_updated: 2020-07-14T12:47:58Z has_accepted_license: '1' intvolume: ' 195' isi: 1 issue: '1' language: - iso: eng month: '08' oa: 1 oa_version: Published Version page: 307–317 project: - _id: 25FA3206-B435-11E9-9278-68D0E5697425 grant_number: PP00P2_138948 name: 'Embeddings in Higher Dimensions: Algorithms and Combinatorics' publication: Geometriae Dedicata publication_status: published publisher: Springer publist_id: '6925' pubrep_id: '912' quality_controlled: '1' related_material: record: - id: '1378' relation: earlier_version status: public scopus_import: '1' status: public title: On expansion and topological overlap 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: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 195 year: '2018' ... --- _id: '75' abstract: - lang: eng text: We prove that any convex body in the plane can be partitioned into m convex parts of equal areas and perimeters for any integer m≥2; this result was previously known for prime powers m=pk. We also give a higher-dimensional generalization. article_number: '1804.03057' article_processing_charge: No arxiv: 1 author: - first_name: Arseniy full_name: Akopyan, Arseniy id: 430D2C90-F248-11E8-B48F-1D18A9856A87 last_name: Akopyan orcid: 0000-0002-2548-617X - first_name: Sergey full_name: Avvakumov, Sergey id: 3827DAC8-F248-11E8-B48F-1D18A9856A87 last_name: Avvakumov - first_name: Roman full_name: Karasev, Roman last_name: Karasev citation: ama: Akopyan A, Avvakumov S, Karasev R. Convex fair partitions into arbitrary number of pieces. 2018. doi:10.48550/arXiv.1804.03057 apa: Akopyan, A., Avvakumov, S., & Karasev, R. (2018). Convex fair partitions into arbitrary number of pieces. arXiv. https://doi.org/10.48550/arXiv.1804.03057 chicago: Akopyan, Arseniy, Sergey Avvakumov, and Roman Karasev. “Convex Fair Partitions into Arbitrary Number of Pieces.” arXiv, 2018. https://doi.org/10.48550/arXiv.1804.03057. ieee: A. Akopyan, S. Avvakumov, and R. Karasev, “Convex fair partitions into arbitrary number of pieces.” arXiv, 2018. ista: Akopyan A, Avvakumov S, Karasev R. 2018. Convex fair partitions into arbitrary number of pieces. 1804.03057. mla: Akopyan, Arseniy, et al. Convex Fair Partitions into Arbitrary Number of Pieces. 1804.03057, arXiv, 2018, doi:10.48550/arXiv.1804.03057. short: A. Akopyan, S. Avvakumov, R. Karasev, (2018). date_created: 2018-12-11T11:44:30Z date_published: 2018-09-13T00:00:00Z date_updated: 2023-12-18T10:51:02Z day: '13' department: - _id: HeEd - _id: JaMa doi: 10.48550/arXiv.1804.03057 ec_funded: 1 external_id: arxiv: - '1804.03057' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1804.03057 month: '09' oa: 1 oa_version: Preprint project: - _id: 256E75B8-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '716117' name: Optimal Transport and Stochastic Dynamics publication_status: published publisher: arXiv related_material: record: - id: '8156' relation: dissertation_contains status: public status: public title: Convex fair partitions into arbitrary number of pieces type: preprint user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2018' ... --- _id: '76' abstract: - lang: eng text: 'Consider a fully-connected synchronous distributed system consisting of n nodes, where up to f nodes may be faulty and every node starts in an arbitrary initial state. In the synchronous C-counting problem, all nodes need to eventually agree on a counter that is increased by one modulo C in each round for given C>1. In the self-stabilising firing squad problem, the task is to eventually guarantee that all non-faulty nodes have simultaneous responses to external inputs: if a subset of the correct nodes receive an external “go” signal as input, then all correct nodes should agree on a round (in the not-too-distant future) in which to jointly output a “fire” signal. Moreover, no node should generate a “fire” signal without some correct node having previously received a “go” signal as input. We present a framework reducing both tasks to binary consensus at very small cost. For example, we obtain a deterministic algorithm for self-stabilising Byzantine firing squads with optimal resilience f<n/3, asymptotically optimal stabilisation and response time O(f), and message size O(log f). As our framework does not restrict the type of consensus routines used, we also obtain efficient randomised solutions.' article_processing_charge: Yes (via OA deal) author: - first_name: Christoph full_name: Lenzen, Christoph last_name: Lenzen - first_name: Joel full_name: Rybicki, Joel id: 334EFD2E-F248-11E8-B48F-1D18A9856A87 last_name: Rybicki orcid: 0000-0002-6432-6646 citation: ama: Lenzen C, Rybicki J. Near-optimal self-stabilising counting and firing squads. Distributed Computing. 2018. doi:10.1007/s00446-018-0342-6 apa: Lenzen, C., & Rybicki, J. (2018). Near-optimal self-stabilising counting and firing squads. Distributed Computing. Springer. https://doi.org/10.1007/s00446-018-0342-6 chicago: Lenzen, Christoph, and Joel Rybicki. “Near-Optimal Self-Stabilising Counting and Firing Squads.” Distributed Computing. Springer, 2018. https://doi.org/10.1007/s00446-018-0342-6. ieee: C. Lenzen and J. Rybicki, “Near-optimal self-stabilising counting and firing squads,” Distributed Computing. Springer, 2018. ista: Lenzen C, Rybicki J. 2018. Near-optimal self-stabilising counting and firing squads. Distributed Computing. mla: Lenzen, Christoph, and Joel Rybicki. “Near-Optimal Self-Stabilising Counting and Firing Squads.” Distributed Computing, Springer, 2018, doi:10.1007/s00446-018-0342-6. short: C. Lenzen, J. Rybicki, Distributed Computing (2018). date_created: 2018-12-11T11:44:30Z date_published: 2018-09-12T00:00:00Z date_updated: 2023-09-13T09:01:06Z day: '12' ddc: - '000' department: - _id: DaAl doi: 10.1007/s00446-018-0342-6 external_id: isi: - '000475627800005' file: - access_level: open_access checksum: 872db70bba9b401500abe3c6ae2f1a61 content_type: application/pdf creator: dernst date_created: 2018-12-17T14:21:22Z date_updated: 2020-07-14T12:48:01Z file_id: '5711' file_name: 2018_DistributedComputing_Lenzen.pdf file_size: 799337 relation: main_file file_date_updated: 2020-07-14T12:48:01Z has_accepted_license: '1' isi: 1 language: - iso: eng month: '09' oa: 1 oa_version: Published Version project: - _id: B67AFEDC-15C9-11EA-A837-991A96BB2854 name: IST Austria Open Access Fund publication: Distributed Computing publication_status: published publisher: Springer publist_id: '7978' quality_controlled: '1' scopus_import: '1' status: public title: Near-optimal self-stabilising counting and firing squads 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: c635000d-4b10-11ee-a964-aac5a93f6ac1 year: '2018' ... --- _id: '77' abstract: - lang: eng text: Holes confined in quantum dots have gained considerable interest in the past few years due to their potential as spin qubits. Here we demonstrate two-axis control of a spin 3/2 qubit in natural Ge. The qubit is formed in a hut wire double quantum dot device. The Pauli spin blockade principle allowed us to demonstrate electric dipole spin resonance by applying a radio frequency electric field to one of the electrodes defining the double quantum dot. Coherent hole spin oscillations with Rabi frequencies reaching 140 MHz are demonstrated and dephasing times of 130 ns are measured. The reported results emphasize the potential of Ge as a platform for fast and electrically tunable hole spin qubit devices. acknowledged_ssus: - _id: M-Shop - _id: NanoFab article_processing_charge: Yes article_type: original author: - first_name: Hannes full_name: Watzinger, Hannes id: 35DF8E50-F248-11E8-B48F-1D18A9856A87 last_name: Watzinger - first_name: Josip full_name: Kukucka, Josip id: 3F5D8856-F248-11E8-B48F-1D18A9856A87 last_name: Kukucka - first_name: Lada full_name: Vukusic, Lada id: 31E9F056-F248-11E8-B48F-1D18A9856A87 last_name: Vukusic orcid: 0000-0003-2424-8636 - first_name: Fei full_name: Gao, Fei last_name: Gao - first_name: Ting full_name: Wang, Ting last_name: Wang - first_name: Friedrich full_name: Schäffler, Friedrich last_name: Schäffler - first_name: Jian full_name: Zhang, Jian last_name: Zhang - first_name: Georgios full_name: Katsaros, Georgios id: 38DB5788-F248-11E8-B48F-1D18A9856A87 last_name: Katsaros orcid: 0000-0001-8342-202X citation: ama: Watzinger H, Kukucka J, Vukušić L, et al. A germanium hole spin qubit. Nature Communications. 2018;9(3902). doi:10.1038/s41467-018-06418-4 apa: Watzinger, H., Kukucka, J., Vukušić, L., Gao, F., Wang, T., Schäffler, F., … Katsaros, G. (2018). A germanium hole spin qubit. Nature Communications. Nature Publishing Group. https://doi.org/10.1038/s41467-018-06418-4 chicago: Watzinger, Hannes, Josip Kukucka, Lada Vukušić, Fei Gao, Ting Wang, Friedrich Schäffler, Jian Zhang, and Georgios Katsaros. “A Germanium Hole Spin Qubit.” Nature Communications. Nature Publishing Group, 2018. https://doi.org/10.1038/s41467-018-06418-4. ieee: H. Watzinger et al., “A germanium hole spin qubit,” Nature Communications, vol. 9, no. 3902. Nature Publishing Group, 2018. ista: Watzinger H, Kukucka J, Vukušić L, Gao F, Wang T, Schäffler F, Zhang J, Katsaros G. 2018. A germanium hole spin qubit. Nature Communications. 9(3902). mla: Watzinger, Hannes, et al. “A Germanium Hole Spin Qubit.” Nature Communications, vol. 9, no. 3902, Nature Publishing Group, 2018, doi:10.1038/s41467-018-06418-4. short: H. Watzinger, J. Kukucka, L. Vukušić, F. Gao, T. Wang, F. Schäffler, J. Zhang, G. Katsaros, Nature Communications 9 (2018). date_created: 2018-12-11T11:44:30Z date_published: 2018-09-25T00:00:00Z date_updated: 2023-09-08T11:44:02Z day: '25' ddc: - '530' department: - _id: GeKa doi: 10.1038/s41467-018-06418-4 ec_funded: 1 external_id: isi: - '000445560800010' file: - access_level: open_access checksum: e7148c10a64497e279c4de570b6cc544 content_type: application/pdf creator: dernst date_created: 2018-12-17T10:28:30Z date_updated: 2020-07-14T12:48:02Z file_id: '5687' file_name: 2018_NatureComm_Watzinger.pdf file_size: 1063469 relation: main_file file_date_updated: 2020-07-14T12:48:02Z has_accepted_license: '1' intvolume: ' 9' isi: 1 issue: '3902 ' language: - iso: eng month: '09' oa: 1 oa_version: Published Version project: - _id: 25517E86-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '335497' name: Towards Spin qubits and Majorana fermions in Germanium selfassembled hut-wires - _id: 2552F888-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Y00715 name: Loch Spin-Qubits und Majorana-Fermionen in Germanium publication: Nature Communications publication_status: published publisher: Nature Publishing Group quality_controlled: '1' related_material: record: - id: '7977' relation: popular_science - id: '7996' relation: dissertation_contains status: public scopus_import: '1' status: public title: A germanium hole spin qubit 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: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 9 year: '2018' ... --- _id: '7712' abstract: - lang: eng text: 'Male pattern baldness (MPB) is a sex-limited, age-related, complex trait. We study MPB genetics in 205,327 European males from the UK Biobank. Here we show that MPB is strongly heritable and polygenic, with pedigree-heritability of 0.62 (SE = 0.03) estimated from close relatives, and SNP-heritability of 0.39 (SE = 0.01) from conventionally-unrelated males. We detect 624 near-independent genome-wide loci, contributing SNP-heritability of 0.25 (SE = 0.01), of which 26 X-chromosome loci explain 11.6%. Autosomal genetic variance is enriched for common variants and regions of lower linkage disequilibrium. We identify plausible genetic correlations between MPB and multiple sex-limited markers of earlier puberty, increased bone mineral density (rg = 0.15) and pancreatic β-cell function (rg = 0.12). Correlations with reproductive traits imply an effect on fitness, consistent with an estimated linear selection gradient of -0.018 per MPB standard deviation. Overall, we provide genetic insights into MPB: a phenotype of interest in its own right, with value as a model sex-limited, complex trait.' article_number: '5407' article_processing_charge: No article_type: original author: - first_name: Chloe X. full_name: Yap, Chloe X. last_name: Yap - first_name: Julia full_name: Sidorenko, Julia last_name: Sidorenko - first_name: Yang full_name: Wu, Yang last_name: Wu - first_name: Kathryn E. full_name: Kemper, Kathryn E. last_name: Kemper - first_name: Jian full_name: Yang, Jian last_name: Yang - first_name: Naomi R. full_name: Wray, Naomi R. last_name: Wray - first_name: Matthew Richard full_name: Robinson, Matthew Richard id: E5D42276-F5DA-11E9-8E24-6303E6697425 last_name: Robinson orcid: 0000-0001-8982-8813 - first_name: Peter M. full_name: Visscher, Peter M. last_name: Visscher citation: ama: Yap CX, Sidorenko J, Wu Y, et al. Dissection of genetic variation and evidence for pleiotropy in male pattern baldness. Nature Communications. 2018;9. doi:10.1038/s41467-018-07862-y apa: Yap, C. X., Sidorenko, J., Wu, Y., Kemper, K. E., Yang, J., Wray, N. R., … Visscher, P. M. (2018). Dissection of genetic variation and evidence for pleiotropy in male pattern baldness. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-018-07862-y chicago: Yap, Chloe X., Julia Sidorenko, Yang Wu, Kathryn E. Kemper, Jian Yang, Naomi R. Wray, Matthew Richard Robinson, and Peter M. Visscher. “Dissection of Genetic Variation and Evidence for Pleiotropy in Male Pattern Baldness.” Nature Communications. Springer Nature, 2018. https://doi.org/10.1038/s41467-018-07862-y. ieee: C. X. Yap et al., “Dissection of genetic variation and evidence for pleiotropy in male pattern baldness,” Nature Communications, vol. 9. Springer Nature, 2018. ista: Yap CX, Sidorenko J, Wu Y, Kemper KE, Yang J, Wray NR, Robinson MR, Visscher PM. 2018. Dissection of genetic variation and evidence for pleiotropy in male pattern baldness. Nature Communications. 9, 5407. mla: Yap, Chloe X., et al. “Dissection of Genetic Variation and Evidence for Pleiotropy in Male Pattern Baldness.” Nature Communications, vol. 9, 5407, Springer Nature, 2018, doi:10.1038/s41467-018-07862-y. short: C.X. Yap, J. Sidorenko, Y. Wu, K.E. Kemper, J. Yang, N.R. Wray, M.R. Robinson, P.M. Visscher, Nature Communications 9 (2018). date_created: 2020-04-30T10:41:19Z date_published: 2018-12-20T00:00:00Z date_updated: 2021-01-12T08:15:02Z day: '20' doi: 10.1038/s41467-018-07862-y extern: '1' intvolume: ' 9' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1038/s41467-018-07862-y month: '12' oa: 1 oa_version: Published Version publication: Nature Communications publication_identifier: issn: - 2041-1723 publication_status: published publisher: Springer Nature quality_controlled: '1' status: public title: Dissection of genetic variation and evidence for pleiotropy in male pattern baldness type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 9 year: '2018' ...