--- _id: '9007' abstract: - lang: eng text: Motivated by a recent question of Peyre, we apply the Hardy–Littlewood circle method to count “sufficiently free” rational points of bounded height on arbitrary smooth projective hypersurfaces of low degree that are defined over the rationals. article_processing_charge: No article_type: original arxiv: 1 author: - first_name: Timothy D full_name: Browning, Timothy D id: 35827D50-F248-11E8-B48F-1D18A9856A87 last_name: Browning orcid: 0000-0002-8314-0177 - first_name: Will full_name: Sawin, Will last_name: Sawin citation: ama: Browning TD, Sawin W. Free rational points on smooth hypersurfaces. Commentarii Mathematici Helvetici. 2020;95(4):635-659. doi:10.4171/CMH/499 apa: Browning, T. D., & Sawin, W. (2020). Free rational points on smooth hypersurfaces. Commentarii Mathematici Helvetici. European Mathematical Society. https://doi.org/10.4171/CMH/499 chicago: Browning, Timothy D, and Will Sawin. “Free Rational Points on Smooth Hypersurfaces.” Commentarii Mathematici Helvetici. European Mathematical Society, 2020. https://doi.org/10.4171/CMH/499. ieee: T. D. Browning and W. Sawin, “Free rational points on smooth hypersurfaces,” Commentarii Mathematici Helvetici, vol. 95, no. 4. European Mathematical Society, pp. 635–659, 2020. ista: Browning TD, Sawin W. 2020. Free rational points on smooth hypersurfaces. Commentarii Mathematici Helvetici. 95(4), 635–659. mla: Browning, Timothy D., and Will Sawin. “Free Rational Points on Smooth Hypersurfaces.” Commentarii Mathematici Helvetici, vol. 95, no. 4, European Mathematical Society, 2020, pp. 635–59, doi:10.4171/CMH/499. short: T.D. Browning, W. Sawin, Commentarii Mathematici Helvetici 95 (2020) 635–659. date_created: 2021-01-17T23:01:11Z date_published: 2020-12-07T00:00:00Z date_updated: 2025-07-10T12:01:31Z day: '07' department: - _id: TiBr doi: 10.4171/CMH/499 external_id: arxiv: - '1906.08463' isi: - '000596833300001' intvolume: ' 95' isi: 1 issue: '4' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1906.08463 month: '12' oa: 1 oa_version: Preprint page: 635-659 publication: Commentarii Mathematici Helvetici publication_identifier: eissn: - 1420-8946 issn: - 0010-2571 publication_status: published publisher: European Mathematical Society quality_controlled: '1' scopus_import: '1' status: public title: Free rational points on smooth hypersurfaces type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 95 year: '2020' ... --- _id: '9011' abstract: - lang: eng text: "Distributed ledgers provide high availability and integrity, making them a key enabler for practical and secure computation of distributed workloads among mutually distrustful parties. Many practical applications also require strong confidentiality, however. This work enhances permissioned and permissionless blockchains with the ability to manage confidential data without forfeiting availability or decentralization. The proposed Calypso architecture addresses two orthogonal challenges confronting modern distributed ledgers: (a) enabling the auditable management of secrets and (b) protecting distributed computations against arbitrage attacks when their results depend on the ordering and secrecy of inputs.\r\n\r\nCalypso introduces on-chain secrets, a novel abstraction that enforces atomic deposition of an auditable trace whenever users access confidential data. Calypso provides user-controlled consent management that ensures revocation atomicity and accountable anonymity. To enable permissionless deployment, we introduce an incentive scheme and provide users with the option to select their preferred trustees. We evaluated our Calypso prototype with a confidential document-sharing application and a decentralized lottery. Our benchmarks show that transaction-processing latency increases linearly in terms of security (number of trustees) and is in the range of 0.2 to 8 seconds for 16 to 128 trustees." acknowledgement: 'We thank Nicolas Gailly, Vincent Graf, Jean-Pierre Hubaux, Wouter Lueks, Massimo Marelli, Carmela Troncoso, Juan-Ramón Troncoso Pastoriza, Frédéric Pont, and Sandra Siby for their valuable feedback. This project was supported in part by the ETH domain under PHRT grant #2017−201, and by the AXA Research Fund, Byzgen, DFINITY, and the Swiss Data Science Center (SDSC).' article_processing_charge: No article_type: original author: - first_name: Eleftherios full_name: Kokoris Kogias, Eleftherios id: f5983044-d7ef-11ea-ac6d-fd1430a26d30 last_name: Kokoris Kogias - first_name: Enis Ceyhun full_name: Alp, Enis Ceyhun last_name: Alp - first_name: Linus full_name: Gasser, Linus last_name: Gasser - first_name: Philipp full_name: Jovanovic, Philipp last_name: Jovanovic - first_name: Ewa full_name: Syta, Ewa last_name: Syta - first_name: Bryan full_name: Ford, Bryan last_name: Ford citation: ama: 'Kokoris Kogias E, Alp EC, Gasser L, Jovanovic P, Syta E, Ford B. CALYPSO: Private data management for decentralized ledgers. Proceedings of the VLDB Endowment. 2020;14(4):586-599. doi:10.14778/3436905.3436917' apa: 'Kokoris Kogias, E., Alp, E. C., Gasser, L., Jovanovic, P., Syta, E., & Ford, B. (2020). CALYPSO: Private data management for decentralized ledgers. Proceedings of the VLDB Endowment. Association for Computing Machinery. https://doi.org/10.14778/3436905.3436917' chicago: 'Kokoris Kogias, Eleftherios, Enis Ceyhun Alp, Linus Gasser, Philipp Jovanovic, Ewa Syta, and Bryan Ford. “CALYPSO: Private Data Management for Decentralized Ledgers.” Proceedings of the VLDB Endowment. Association for Computing Machinery, 2020. https://doi.org/10.14778/3436905.3436917.' ieee: 'E. Kokoris Kogias, E. C. Alp, L. Gasser, P. Jovanovic, E. Syta, and B. Ford, “CALYPSO: Private data management for decentralized ledgers,” Proceedings of the VLDB Endowment, vol. 14, no. 4. Association for Computing Machinery, pp. 586–599, 2020.' ista: 'Kokoris Kogias E, Alp EC, Gasser L, Jovanovic P, Syta E, Ford B. 2020. CALYPSO: Private data management for decentralized ledgers. Proceedings of the VLDB Endowment. 14(4), 586–599.' mla: 'Kokoris Kogias, Eleftherios, et al. “CALYPSO: Private Data Management for Decentralized Ledgers.” Proceedings of the VLDB Endowment, vol. 14, no. 4, Association for Computing Machinery, 2020, pp. 586–99, doi:10.14778/3436905.3436917.' short: E. Kokoris Kogias, E.C. Alp, L. Gasser, P. Jovanovic, E. Syta, B. Ford, Proceedings of the VLDB Endowment 14 (2020) 586–599. corr_author: '1' date_created: 2021-01-17T23:01:13Z date_published: 2020-12-01T00:00:00Z date_updated: 2024-10-09T21:00:32Z day: '01' department: - _id: ElKo doi: 10.14778/3436905.3436917 external_id: isi: - '000658495400012' intvolume: ' 14' isi: 1 issue: '4' language: - iso: eng main_file_link: - open_access: '1' url: https://dl.acm.org/doi/10.14778/3436905.3436917 month: '12' oa: 1 oa_version: Published Version page: 586-599 publication: Proceedings of the VLDB Endowment publication_identifier: eissn: - 2150-8097 publication_status: published publisher: Association for Computing Machinery quality_controlled: '1' scopus_import: '1' status: public title: 'CALYPSO: Private data management for decentralized ledgers' 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: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 14 year: '2020' ... --- _id: '9039' abstract: - lang: eng text: We give a short and self-contained proof for rates of convergence of the Allen--Cahn equation towards mean curvature flow, assuming that a classical (smooth) solution to the latter exists and starting from well-prepared initial data. Our approach is based on a relative entropy technique. In particular, it does not require a stability analysis for the linearized Allen--Cahn operator. As our analysis also does not rely on the comparison principle, we expect it to be applicable to more complex equations and systems. acknowledgement: "This work was supported by the European Union's Horizon 2020 Research and Innovation\r\nProgramme under Marie Sklodowska-Curie grant agreement 665385 and by the Deutsche\r\nForschungsgemeinschaft (DFG, German Research Foundation) under Germany's Excellence Strategy, EXC-2047/1--390685813." article_processing_charge: No article_type: original author: - first_name: Julian L full_name: Fischer, Julian L id: 2C12A0B0-F248-11E8-B48F-1D18A9856A87 last_name: Fischer orcid: 0000-0002-0479-558X - first_name: Tim full_name: Laux, Tim last_name: Laux - first_name: Theresa M. full_name: Simon, Theresa M. last_name: Simon citation: ama: 'Fischer JL, Laux T, Simon TM. Convergence rates of the Allen-Cahn equation to mean curvature flow: A short proof based on relative entropies. SIAM Journal on Mathematical Analysis. 2020;52(6):6222-6233. doi:10.1137/20M1322182' apa: 'Fischer, J. L., Laux, T., & Simon, T. M. (2020). Convergence rates of the Allen-Cahn equation to mean curvature flow: A short proof based on relative entropies. SIAM Journal on Mathematical Analysis. Society for Industrial and Applied Mathematics. https://doi.org/10.1137/20M1322182' chicago: 'Fischer, Julian L, Tim Laux, and Theresa M. Simon. “Convergence Rates of the Allen-Cahn Equation to Mean Curvature Flow: A Short Proof Based on Relative Entropies.” SIAM Journal on Mathematical Analysis. Society for Industrial and Applied Mathematics, 2020. https://doi.org/10.1137/20M1322182.' ieee: 'J. L. Fischer, T. Laux, and T. M. Simon, “Convergence rates of the Allen-Cahn equation to mean curvature flow: A short proof based on relative entropies,” SIAM Journal on Mathematical Analysis, vol. 52, no. 6. Society for Industrial and Applied Mathematics, pp. 6222–6233, 2020.' ista: 'Fischer JL, Laux T, Simon TM. 2020. Convergence rates of the Allen-Cahn equation to mean curvature flow: A short proof based on relative entropies. SIAM Journal on Mathematical Analysis. 52(6), 6222–6233.' mla: 'Fischer, Julian L., et al. “Convergence Rates of the Allen-Cahn Equation to Mean Curvature Flow: A Short Proof Based on Relative Entropies.” SIAM Journal on Mathematical Analysis, vol. 52, no. 6, Society for Industrial and Applied Mathematics, 2020, pp. 6222–33, doi:10.1137/20M1322182.' short: J.L. Fischer, T. Laux, T.M. Simon, SIAM Journal on Mathematical Analysis 52 (2020) 6222–6233. corr_author: '1' date_created: 2021-01-24T23:01:09Z date_published: 2020-12-15T00:00:00Z date_updated: 2025-07-10T12:01:32Z day: '15' ddc: - '510' department: - _id: JuFi doi: 10.1137/20M1322182 ec_funded: 1 external_id: isi: - '000600695200027' file: - access_level: open_access checksum: 21aa1cf4c30a86a00cae15a984819b5d content_type: application/pdf creator: dernst date_created: 2021-01-25T07:48:39Z date_updated: 2021-01-25T07:48:39Z file_id: '9041' file_name: 2020_SIAM_Fischer.pdf file_size: 310655 relation: main_file success: 1 file_date_updated: 2021-01-25T07:48:39Z has_accepted_license: '1' intvolume: ' 52' isi: 1 issue: '6' language: - iso: eng month: '12' oa: 1 oa_version: Published Version page: 6222-6233 project: - _id: 2564DBCA-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '665385' name: International IST Doctoral Program publication: SIAM Journal on Mathematical Analysis publication_identifier: eissn: - 1095-7154 issn: - 0036-1410 publication_status: published publisher: Society for Industrial and Applied Mathematics quality_controlled: '1' scopus_import: '1' status: public title: 'Convergence rates of the Allen-Cahn equation to mean curvature flow: A short proof based on relative entropies' 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: 52 year: '2020' ... --- _id: '9040' abstract: - lang: eng text: Machine learning and formal methods have complimentary benefits and drawbacks. In this work, we address the controller-design problem with a combination of techniques from both fields. The use of black-box neural networks in deep reinforcement learning (deep RL) poses a challenge for such a combination. Instead of reasoning formally about the output of deep RL, which we call the wizard, we extract from it a decision-tree based model, which we refer to as the magic book. Using the extracted model as an intermediary, we are able to handle problems that are infeasible for either deep RL or formal methods by themselves. First, we suggest, for the first time, a synthesis procedure that is based on a magic book. We synthesize a stand-alone correct-by-design controller that enjoys the favorable performance of RL. Second, we incorporate a magic book in a bounded model checking (BMC) procedure. BMC allows us to find numerous traces of the plant under the control of the wizard, which a user can use to increase the trustworthiness of the wizard and direct further training. acknowledgement: This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). article_processing_charge: No author: - first_name: Par Alizadeh full_name: Alamdari, Par Alizadeh last_name: Alamdari - first_name: Guy full_name: Avni, Guy id: 463C8BC2-F248-11E8-B48F-1D18A9856A87 last_name: Avni orcid: 0000-0001-5588-8287 - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000-0002-2985-7724 - first_name: Anna full_name: Lukina, Anna id: CBA4D1A8-0FE8-11E9-BDE6-07BFE5697425 last_name: Lukina citation: ama: 'Alamdari PA, Avni G, Henzinger TA, Lukina A. Formal methods with a touch of magic. In: Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design. TU Wien Academic Press; 2020:138-147. doi:10.34727/2020/isbn.978-3-85448-042-6_21' apa: 'Alamdari, P. A., Avni, G., Henzinger, T. A., & Lukina, A. (2020). Formal methods with a touch of magic. In Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design (pp. 138–147). Online Conference: TU Wien Academic Press. https://doi.org/10.34727/2020/isbn.978-3-85448-042-6_21' chicago: Alamdari, Par Alizadeh, Guy Avni, Thomas A Henzinger, and Anna Lukina. “Formal Methods with a Touch of Magic.” In Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design, 138–47. TU Wien Academic Press, 2020. https://doi.org/10.34727/2020/isbn.978-3-85448-042-6_21. ieee: P. A. Alamdari, G. Avni, T. A. Henzinger, and A. Lukina, “Formal methods with a touch of magic,” in Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design, Online Conference, 2020, pp. 138–147. ista: 'Alamdari PA, Avni G, Henzinger TA, Lukina A. 2020. Formal methods with a touch of magic. Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design. FMCAD: Formal Methods in Computer-Aided Design, 138–147.' mla: Alamdari, Par Alizadeh, et al. “Formal Methods with a Touch of Magic.” Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design, TU Wien Academic Press, 2020, pp. 138–47, doi:10.34727/2020/isbn.978-3-85448-042-6_21. short: P.A. Alamdari, G. Avni, T.A. Henzinger, A. Lukina, in:, Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design, TU Wien Academic Press, 2020, pp. 138–147. conference: end_date: 2020-09-24 location: Online Conference name: 'FMCAD: Formal Methods in Computer-Aided Design' start_date: 2020-09-21 date_created: 2021-01-24T23:01:10Z date_published: 2020-09-21T00:00:00Z date_updated: 2025-07-10T12:01:32Z day: '21' ddc: - '000' department: - _id: ToHe doi: 10.34727/2020/isbn.978-3-85448-042-6_21 file: - access_level: open_access checksum: d616d549a0ade78606b16f8a9540820f content_type: application/pdf creator: dernst date_created: 2021-02-09T09:39:02Z date_updated: 2021-02-09T09:39:02Z file_id: '9109' file_name: 2020_FMCAD_Alamdari.pdf file_size: 990999 relation: main_file success: 1 file_date_updated: 2021-02-09T09:39:02Z has_accepted_license: '1' language: - iso: eng month: '09' oa: 1 oa_version: Published Version page: 138-147 project: - _id: 25F42A32-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z211 name: Formal methods for the design and analysis of complex systems publication: Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design publication_identifier: eissn: - 2708-7824 isbn: - '9783854480426' publication_status: published publisher: TU Wien Academic Press quality_controlled: '1' scopus_import: '1' status: public title: Formal methods with a touch of magic 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 year: '2020' ... --- _id: '9096' article_processing_charge: No author: - first_name: Paul full_name: Schmid-Hempel, Paul last_name: Schmid-Hempel - first_name: Sylvia M full_name: Cremer, Sylvia M id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87 last_name: Cremer orcid: 0000-0002-2193-3868 citation: ama: 'Schmid-Hempel P, Cremer S. Parasites and Pathogens. In: Starr C, ed. Encyclopedia of Social Insects. Cham: Springer Nature; 2020. doi:10.1007/978-3-319-90306-4_94-1' apa: 'Schmid-Hempel, P., & Cremer, S. (2020). Parasites and Pathogens. In C. Starr (Ed.), Encyclopedia of Social Insects. Cham: Springer Nature. https://doi.org/10.1007/978-3-319-90306-4_94-1' chicago: 'Schmid-Hempel, Paul, and Sylvia Cremer. “Parasites and Pathogens.” In Encyclopedia of Social Insects, edited by C Starr. Cham: Springer Nature, 2020. https://doi.org/10.1007/978-3-319-90306-4_94-1.' ieee: 'P. Schmid-Hempel and S. Cremer, “Parasites and Pathogens,” in Encyclopedia of Social Insects, C. Starr, Ed. Cham: Springer Nature, 2020.' ista: 'Schmid-Hempel P, Cremer S. 2020.Parasites and Pathogens. In: Encyclopedia of Social Insects. .' mla: Schmid-Hempel, Paul, and Sylvia Cremer. “Parasites and Pathogens.” Encyclopedia of Social Insects, edited by C Starr, Springer Nature, 2020, doi:10.1007/978-3-319-90306-4_94-1. short: P. Schmid-Hempel, S. Cremer, in:, C. Starr (Ed.), Encyclopedia of Social Insects, Springer Nature, Cham, 2020. date_created: 2021-02-05T12:15:18Z date_published: 2020-02-22T00:00:00Z date_updated: 2021-02-05T12:19:21Z day: '22' department: - _id: SyCr doi: 10.1007/978-3-319-90306-4_94-1 editor: - first_name: C full_name: Starr, C last_name: Starr language: - iso: eng month: '02' oa_version: None place: Cham publication: Encyclopedia of Social Insects publication_identifier: isbn: - '9783319903064' publication_status: published publisher: Springer Nature quality_controlled: '1' status: public title: Parasites and Pathogens type: book_chapter user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2020' ... --- _id: '9104' abstract: - lang: eng text: We consider the free additive convolution of two probability measures μ and ν on the real line and show that μ ⊞ v is supported on a single interval if μ and ν each has single interval support. Moreover, the density of μ ⊞ ν is proven to vanish as a square root near the edges of its support if both μ and ν have power law behavior with exponents between −1 and 1 near their edges. In particular, these results show the ubiquity of the conditions in our recent work on optimal local law at the spectral edges for addition of random matrices [5]. acknowledgement: "Supported in part by Hong Kong RGC Grant ECS 26301517.\r\nSupported in part by ERC Advanced Grant RANMAT No. 338804.\r\nSupported in part by the Knut and Alice Wallenberg Foundation and the Swedish Research Council Grant VR-2017-05195." article_processing_charge: No article_type: original arxiv: 1 author: - first_name: Zhigang full_name: Bao, Zhigang id: 442E6A6C-F248-11E8-B48F-1D18A9856A87 last_name: Bao orcid: 0000-0003-3036-1475 - first_name: László full_name: Erdös, László id: 4DBD5372-F248-11E8-B48F-1D18A9856A87 last_name: Erdös orcid: 0000-0001-5366-9603 - first_name: Kevin full_name: Schnelli, Kevin id: 434AD0AE-F248-11E8-B48F-1D18A9856A87 last_name: Schnelli orcid: 0000-0003-0954-3231 citation: ama: Bao Z, Erdös L, Schnelli K. On the support of the free additive convolution. Journal d’Analyse Mathematique. 2020;142:323-348. doi:10.1007/s11854-020-0135-2 apa: Bao, Z., Erdös, L., & Schnelli, K. (2020). On the support of the free additive convolution. Journal d’Analyse Mathematique. Springer Nature. https://doi.org/10.1007/s11854-020-0135-2 chicago: Bao, Zhigang, László Erdös, and Kevin Schnelli. “On the Support of the Free Additive Convolution.” Journal d’Analyse Mathematique. Springer Nature, 2020. https://doi.org/10.1007/s11854-020-0135-2. ieee: Z. Bao, L. Erdös, and K. Schnelli, “On the support of the free additive convolution,” Journal d’Analyse Mathematique, vol. 142. Springer Nature, pp. 323–348, 2020. ista: Bao Z, Erdös L, Schnelli K. 2020. On the support of the free additive convolution. Journal d’Analyse Mathematique. 142, 323–348. mla: Bao, Zhigang, et al. “On the Support of the Free Additive Convolution.” Journal d’Analyse Mathematique, vol. 142, Springer Nature, 2020, pp. 323–48, doi:10.1007/s11854-020-0135-2. short: Z. Bao, L. Erdös, K. Schnelli, Journal d’Analyse Mathematique 142 (2020) 323–348. date_created: 2021-02-07T23:01:15Z date_published: 2020-11-01T00:00:00Z date_updated: 2025-07-10T12:01:37Z day: '01' department: - _id: LaEr doi: 10.1007/s11854-020-0135-2 ec_funded: 1 external_id: arxiv: - '1804.11199' isi: - '000611879400008' intvolume: ' 142' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1804.11199 month: '11' oa: 1 oa_version: Preprint page: 323-348 project: - _id: 258DCDE6-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '338804' name: Random matrices, universality and disordered quantum systems publication: Journal d'Analyse Mathematique publication_identifier: eissn: - 1565-8538 issn: - 0021-7670 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: On the support of the free additive convolution type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 142 year: '2020' ... --- _id: '9156' abstract: - lang: eng text: The morphometric approach [11, 14] writes the solvation free energy as a linear combination of weighted versions of the volume, area, mean curvature, and Gaussian curvature of the space-filling diagram. We give a formula for the derivative of the weighted Gaussian curvature. Together with the derivatives of the weighted volume in [7], the weighted area in [4], and the weighted mean curvature in [1], this yields the derivative of the morphometric expression of solvation free energy. acknowledgement: "The authors of this paper thank Roland Roth for suggesting the analysis of theweighted\r\ncurvature derivatives for the purpose of improving molecular dynamics simulations. They also thank Patrice Koehl for the implementation of the formulas and for his encouragement and advise along the road. Finally, they thank two anonymous reviewers for their constructive criticism.\r\nThis project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 78818 Alpha). It is also partially supported by the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, through grant no. I02979-N35 of the Austrian Science Fund (FWF)." article_processing_charge: No article_type: original 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: Herbert full_name: Edelsbrunner, Herbert id: 3FB178DA-F248-11E8-B48F-1D18A9856A87 last_name: Edelsbrunner orcid: 0000-0002-9823-6833 citation: ama: Akopyan A, Edelsbrunner H. The weighted Gaussian curvature derivative of a space-filling diagram. Computational and Mathematical Biophysics. 2020;8(1):74-88. doi:10.1515/cmb-2020-0101 apa: Akopyan, A., & Edelsbrunner, H. (2020). The weighted Gaussian curvature derivative of a space-filling diagram. Computational and Mathematical Biophysics. De Gruyter. https://doi.org/10.1515/cmb-2020-0101 chicago: Akopyan, Arseniy, and Herbert Edelsbrunner. “The Weighted Gaussian Curvature Derivative of a Space-Filling Diagram.” Computational and Mathematical Biophysics. De Gruyter, 2020. https://doi.org/10.1515/cmb-2020-0101. ieee: A. Akopyan and H. Edelsbrunner, “The weighted Gaussian curvature derivative of a space-filling diagram,” Computational and Mathematical Biophysics, vol. 8, no. 1. De Gruyter, pp. 74–88, 2020. ista: Akopyan A, Edelsbrunner H. 2020. The weighted Gaussian curvature derivative of a space-filling diagram. Computational and Mathematical Biophysics. 8(1), 74–88. mla: Akopyan, Arseniy, and Herbert Edelsbrunner. “The Weighted Gaussian Curvature Derivative of a Space-Filling Diagram.” Computational and Mathematical Biophysics, vol. 8, no. 1, De Gruyter, 2020, pp. 74–88, doi:10.1515/cmb-2020-0101. short: A. Akopyan, H. Edelsbrunner, Computational and Mathematical Biophysics 8 (2020) 74–88. corr_author: '1' date_created: 2021-02-17T15:12:44Z date_published: 2020-07-21T00:00:00Z date_updated: 2025-04-14T07:48:34Z day: '21' ddc: - '510' department: - _id: HeEd doi: 10.1515/cmb-2020-0101 ec_funded: 1 external_id: arxiv: - '1908.06777' file: - access_level: open_access checksum: ca43a7440834eab6bbea29c59b56ef3a content_type: application/pdf creator: dernst date_created: 2021-02-19T13:33:19Z date_updated: 2021-02-19T13:33:19Z file_id: '9170' file_name: 2020_CompMathBiophysics_Akopyan.pdf file_size: 707452 relation: main_file success: 1 file_date_updated: 2021-02-19T13:33:19Z has_accepted_license: '1' intvolume: ' 8' issue: '1' language: - iso: eng month: '07' oa: 1 oa_version: Published Version page: 74-88 project: - _id: 266A2E9E-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '788183' name: Alpha Shape Theory Extended - _id: 2561EBF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: I02979-N35 name: Persistence and stability of geometric complexes publication: Computational and Mathematical Biophysics publication_identifier: issn: - 2544-7297 publication_status: published publisher: De Gruyter quality_controlled: '1' scopus_import: '1' status: public title: The weighted Gaussian curvature derivative of a space-filling diagram 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: 8 year: '2020' ... --- _id: '9157' abstract: - lang: eng text: Representing an atom by a solid sphere in 3-dimensional Euclidean space, we get the space-filling diagram of a molecule by taking the union. Molecular dynamics simulates its motion subject to bonds and other forces, including the solvation free energy. The morphometric approach [12, 17] writes the latter as a linear combination of weighted versions of the volume, area, mean curvature, and Gaussian curvature of the space-filling diagram. We give a formula for the derivative of the weighted mean curvature. Together with the derivatives of the weighted volume in [7], the weighted area in [3], and the weighted Gaussian curvature [1], this yields the derivative of the morphometric expression of the solvation free energy. acknowledgement: "The authors of this paper thank Roland Roth for suggesting the analysis of the weighted\r\ncurvature derivatives for the purpose of improving molecular dynamics simulations and for his continued encouragement. They also thank Patrice Koehl for the implementation of the formulas and for his encouragement and advise along the road. Finally, they thank two anonymous reviewers for their constructive criticism.\r\nThis project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 78818 Alpha). It is also partially supported by the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, through grant no. I02979-N35 of the Austrian Science Fund (FWF)." article_processing_charge: No article_type: original author: - first_name: Arseniy full_name: Akopyan, Arseniy id: 430D2C90-F248-11E8-B48F-1D18A9856A87 last_name: Akopyan orcid: 0000-0002-2548-617X - first_name: Herbert full_name: Edelsbrunner, Herbert id: 3FB178DA-F248-11E8-B48F-1D18A9856A87 last_name: Edelsbrunner orcid: 0000-0002-9823-6833 citation: ama: Akopyan A, Edelsbrunner H. The weighted mean curvature derivative of a space-filling diagram. Computational and Mathematical Biophysics. 2020;8(1):51-67. doi:10.1515/cmb-2020-0100 apa: Akopyan, A., & Edelsbrunner, H. (2020). The weighted mean curvature derivative of a space-filling diagram. Computational and Mathematical Biophysics. De Gruyter. https://doi.org/10.1515/cmb-2020-0100 chicago: Akopyan, Arseniy, and Herbert Edelsbrunner. “The Weighted Mean Curvature Derivative of a Space-Filling Diagram.” Computational and Mathematical Biophysics. De Gruyter, 2020. https://doi.org/10.1515/cmb-2020-0100. ieee: A. Akopyan and H. Edelsbrunner, “The weighted mean curvature derivative of a space-filling diagram,” Computational and Mathematical Biophysics, vol. 8, no. 1. De Gruyter, pp. 51–67, 2020. ista: Akopyan A, Edelsbrunner H. 2020. The weighted mean curvature derivative of a space-filling diagram. Computational and Mathematical Biophysics. 8(1), 51–67. mla: Akopyan, Arseniy, and Herbert Edelsbrunner. “The Weighted Mean Curvature Derivative of a Space-Filling Diagram.” Computational and Mathematical Biophysics, vol. 8, no. 1, De Gruyter, 2020, pp. 51–67, doi:10.1515/cmb-2020-0100. short: A. Akopyan, H. Edelsbrunner, Computational and Mathematical Biophysics 8 (2020) 51–67. corr_author: '1' date_created: 2021-02-17T15:13:01Z date_published: 2020-06-20T00:00:00Z date_updated: 2025-04-14T07:48:35Z day: '20' ddc: - '510' department: - _id: HeEd doi: 10.1515/cmb-2020-0100 ec_funded: 1 file: - access_level: open_access checksum: cea41de9937d07a3b927d71ee8b4e432 content_type: application/pdf creator: dernst date_created: 2021-02-19T13:56:24Z date_updated: 2021-02-19T13:56:24Z file_id: '9171' file_name: 2020_CompMathBiophysics_Akopyan2.pdf file_size: 562359 relation: main_file success: 1 file_date_updated: 2021-02-19T13:56:24Z has_accepted_license: '1' intvolume: ' 8' issue: '1' language: - iso: eng month: '06' oa: 1 oa_version: Published Version page: 51-67 project: - _id: 266A2E9E-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '788183' name: Alpha Shape Theory Extended - _id: 2561EBF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: I02979-N35 name: Persistence and stability of geometric complexes publication: Computational and Mathematical Biophysics publication_identifier: issn: - 2544-7297 publication_status: published publisher: De Gruyter quality_controlled: '1' status: public title: The weighted mean curvature derivative of a space-filling diagram 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: 8 year: '2020' ... --- _id: '9194' abstract: - lang: eng text: Quantum transduction, the process of converting quantum signals from one form of energy to another, is an important area of quantum science and technology. The present perspective article reviews quantum transduction between microwave and optical photons, an area that has recently seen a lot of activity and progress because of its relevance for connecting superconducting quantum processors over long distances, among other applications. Our review covers the leading approaches to achieving such transduction, with an emphasis on those based on atomic ensembles, opto-electro-mechanics, and electro-optics. We briefly discuss relevant metrics from the point of view of different applications, as well as challenges for the future. acknowledgement: "During the writing of this article we became aware of another review of quantum transduction with somewhat different emphasis [99].\r\nWe would like to thank the participants of the transduction workshop at Caltech in September 2018 for helpful and stimulating discussions. We particularly thank John Bartholomew, Andrei Faraon, Johannes Fink, Jeff Holzgrafe, Linbo Shao, Marko Lončar, Daniel Oblak, and Oskar Painter.\r\nN L and N S acknowledge support from the Alliance for Quantum Technologies' (AQT) Intelligent Quantum Networks and Technologies (INQNET) research program and by DOE/HEP QuantISED program grant, QCCFP (Quantum Communication Channels for Fundamental Physics), award number DE-SC0019219. NS further acknowledges support by the Natural Sciences and Engineering Research Council of Canada (NSERC). SB acknowledges support from the Marie Skłodowska Curie fellowship number 707 438 (MSC-IF SUPEREOM). JPC acknowledges support from the Caltech PMA prize postdoctoral fellowship. MS acknowledges support from the ARL-CDQI and the National Science Foundation. CS acknowledges NSERC, Quantum Alberta, and the Alberta Major Innovation Fund." article_number: '020501' article_processing_charge: No article_type: review author: - first_name: Nikolai full_name: Lauk, Nikolai last_name: Lauk - first_name: Neil full_name: Sinclair, Neil last_name: Sinclair - first_name: Shabir full_name: Barzanjeh, Shabir id: 2D25E1F6-F248-11E8-B48F-1D18A9856A87 last_name: Barzanjeh orcid: 0000-0003-0415-1423 - first_name: Jacob P full_name: Covey, Jacob P last_name: Covey - first_name: Mark full_name: Saffman, Mark last_name: Saffman - first_name: Maria full_name: Spiropulu, Maria last_name: Spiropulu - first_name: Christoph full_name: Simon, Christoph last_name: Simon citation: ama: Lauk N, Sinclair N, Barzanjeh S, et al. Perspectives on quantum transduction. Quantum Science and Technology. 2020;5(2). doi:10.1088/2058-9565/ab788a apa: Lauk, N., Sinclair, N., Barzanjeh, S., Covey, J. P., Saffman, M., Spiropulu, M., & Simon, C. (2020). Perspectives on quantum transduction. Quantum Science and Technology. IOP Publishing. https://doi.org/10.1088/2058-9565/ab788a chicago: Lauk, Nikolai, Neil Sinclair, Shabir Barzanjeh, Jacob P Covey, Mark Saffman, Maria Spiropulu, and Christoph Simon. “Perspectives on Quantum Transduction.” Quantum Science and Technology. IOP Publishing, 2020. https://doi.org/10.1088/2058-9565/ab788a. ieee: N. Lauk et al., “Perspectives on quantum transduction,” Quantum Science and Technology, vol. 5, no. 2. IOP Publishing, 2020. ista: Lauk N, Sinclair N, Barzanjeh S, Covey JP, Saffman M, Spiropulu M, Simon C. 2020. Perspectives on quantum transduction. Quantum Science and Technology. 5(2), 020501. mla: Lauk, Nikolai, et al. “Perspectives on Quantum Transduction.” Quantum Science and Technology, vol. 5, no. 2, 020501, IOP Publishing, 2020, doi:10.1088/2058-9565/ab788a. short: N. Lauk, N. Sinclair, S. Barzanjeh, J.P. Covey, M. Saffman, M. Spiropulu, C. Simon, Quantum Science and Technology 5 (2020). date_created: 2021-02-25T08:32:29Z date_published: 2020-03-01T00:00:00Z date_updated: 2024-10-22T09:36:25Z day: '01' ddc: - '530' department: - _id: JoFi doi: 10.1088/2058-9565/ab788a ec_funded: 1 external_id: isi: - '000521449500001' file: - access_level: open_access checksum: a8562c42124a66b86836fe2489eb5f4f content_type: application/pdf creator: dernst date_created: 2021-03-02T09:47:13Z date_updated: 2021-03-02T09:47:13Z file_id: '9215' file_name: 2020_QuantumScience_Lauk.pdf file_size: 974399 relation: main_file success: 1 file_date_updated: 2021-03-02T09:47:13Z has_accepted_license: '1' intvolume: ' 5' isi: 1 issue: '2' language: - iso: eng month: '03' oa: 1 oa_version: Published Version project: - _id: 258047B6-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '707438' name: 'Microwave-to-Optical Quantum Link: Quantum Teleportation and Quantum Illumination with cavity Optomechanics' publication: Quantum Science and Technology publication_identifier: issn: - 2058-9565 publication_status: published publisher: IOP Publishing quality_controlled: '1' scopus_import: '1' status: public title: Perspectives on quantum transduction 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: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 5 year: '2020' ... --- _id: '9195' abstract: - lang: eng text: Quantum information technology based on solid state qubits has created much interest in converting quantum states from the microwave to the optical domain. Optical photons, unlike microwave photons, can be transmitted by fiber, making them suitable for long distance quantum communication. Moreover, the optical domain offers access to a large set of very well‐developed quantum optical tools, such as highly efficient single‐photon detectors and long‐lived quantum memories. For a high fidelity microwave to optical transducer, efficient conversion at single photon level and low added noise is needed. Currently, the most promising approaches to build such systems are based on second‐order nonlinear phenomena such as optomechanical and electro‐optic interactions. Alternative approaches, although not yet as efficient, include magneto‐optical coupling and schemes based on isolated quantum systems like atoms, ions, or quantum dots. Herein, the necessary theoretical foundations for the most important microwave‐to‐optical conversion experiments are provided, their implementations are described, and the current limitations and future prospects are discussed. acknowledgement: The authors thank Amita Deb for useful comments on this manuscript. The authors acknowledge support from the MBIE of New Zealand Endeavour Smart Ideas fund. The reference numbers in Figure 8 were corrected in April 2020, after online publication. article_number: '1900077' article_processing_charge: No article_type: original author: - first_name: Nicholas J. full_name: Lambert, Nicholas J. last_name: Lambert - first_name: Alfredo R full_name: Rueda Sanchez, Alfredo R id: 3B82B0F8-F248-11E8-B48F-1D18A9856A87 last_name: Rueda Sanchez orcid: 0000-0001-6249-5860 - first_name: Florian full_name: Sedlmeir, Florian last_name: Sedlmeir - first_name: Harald G. L. full_name: Schwefel, Harald G. L. last_name: Schwefel citation: ama: Lambert NJ, Rueda Sanchez AR, Sedlmeir F, Schwefel HGL. Coherent conversion between microwave and optical photons - An overview of physical implementations. Advanced Quantum Technologies. 2020;3(1). doi:10.1002/qute.201900077 apa: Lambert, N. J., Rueda Sanchez, A. R., Sedlmeir, F., & Schwefel, H. G. L. (2020). Coherent conversion between microwave and optical photons - An overview of physical implementations. Advanced Quantum Technologies. Wiley. https://doi.org/10.1002/qute.201900077 chicago: Lambert, Nicholas J., Alfredo R Rueda Sanchez, Florian Sedlmeir, and Harald G. L. Schwefel. “Coherent Conversion between Microwave and Optical Photons - An Overview of Physical Implementations.” Advanced Quantum Technologies. Wiley, 2020. https://doi.org/10.1002/qute.201900077. ieee: N. J. Lambert, A. R. Rueda Sanchez, F. Sedlmeir, and H. G. L. Schwefel, “Coherent conversion between microwave and optical photons - An overview of physical implementations,” Advanced Quantum Technologies, vol. 3, no. 1. Wiley, 2020. ista: Lambert NJ, Rueda Sanchez AR, Sedlmeir F, Schwefel HGL. 2020. Coherent conversion between microwave and optical photons - An overview of physical implementations. Advanced Quantum Technologies. 3(1), 1900077. mla: Lambert, Nicholas J., et al. “Coherent Conversion between Microwave and Optical Photons - An Overview of Physical Implementations.” Advanced Quantum Technologies, vol. 3, no. 1, 1900077, Wiley, 2020, doi:10.1002/qute.201900077. short: N.J. Lambert, A.R. Rueda Sanchez, F. Sedlmeir, H.G.L. Schwefel, Advanced Quantum Technologies 3 (2020). date_created: 2021-02-25T08:52:36Z date_published: 2020-01-01T00:00:00Z date_updated: 2024-10-21T06:02:31Z day: '01' ddc: - '530' department: - _id: JoFi doi: 10.1002/qute.201900077 external_id: isi: - '000548088300001' file: - access_level: open_access checksum: 157e95abd6883c3b35b0fa78ae10775e content_type: application/pdf creator: dernst date_created: 2021-03-02T12:30:03Z date_updated: 2021-03-02T12:30:03Z file_id: '9216' file_name: 2020_AdvQuantumTech_Lambert.pdf file_size: 2410114 relation: main_file success: 1 file_date_updated: 2021-03-02T12:30:03Z has_accepted_license: '1' intvolume: ' 3' isi: 1 issue: '1' language: - iso: eng month: '01' oa: 1 oa_version: Published Version publication: Advanced Quantum Technologies publication_identifier: issn: - 2511-9044 publication_status: published publisher: Wiley quality_controlled: '1' related_material: link: - description: Cover Page relation: poster url: https://doi.org/10.1002/qute.202070011 scopus_import: '1' status: public title: Coherent conversion between microwave and optical photons - An overview of physical implementations tmp: image: /images/cc_by_nc.png legal_code_url: https://creativecommons.org/licenses/by-nc/4.0/legalcode name: Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0) short: CC BY-NC (4.0) type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 3 year: '2020' ... --- _id: '9196' abstract: - lang: eng text: In order to provide a local description of a regular function in a small neighbourhood of a point x, it is sufficient by Taylor’s theorem to know the value of the function as well as all of its derivatives up to the required order at the point x itself. In other words, one could say that a regular function is locally modelled by the set of polynomials. The theory of regularity structures due to Hairer generalizes this observation and provides an abstract setup, which in the application to singular SPDE extends the set of polynomials by functionals constructed from, e.g., white noise. In this context, the notion of Taylor polynomials is lifted to the notion of so-called modelled distributions. The celebrated reconstruction theorem, which in turn was inspired by Gubinelli’s \textit {sewing lemma}, is of paramount importance for the theory. It enables one to reconstruct a modelled distribution as a true distribution on Rd which is locally approximated by this extended set of models or “monomials”. In the original work of Hairer, the error is measured by means of Hölder norms. This was then generalized to the whole scale of Besov spaces by Hairer and Labbé. It is the aim of this work to adapt the analytic part of the theory of regularity structures to the scale of Triebel–Lizorkin spaces. article_processing_charge: No article_type: original arxiv: 1 author: - first_name: Sebastian full_name: Hensel, Sebastian id: 4D23B7DA-F248-11E8-B48F-1D18A9856A87 last_name: Hensel orcid: 0000-0001-7252-8072 - first_name: Tommaso full_name: Rosati, Tommaso last_name: Rosati citation: ama: Hensel S, Rosati T. Modelled distributions of Triebel–Lizorkin type. Studia Mathematica. 2020;252(3):251-297. doi:10.4064/sm180411-11-2 apa: Hensel, S., & Rosati, T. (2020). Modelled distributions of Triebel–Lizorkin type. Studia Mathematica. Instytut Matematyczny. https://doi.org/10.4064/sm180411-11-2 chicago: Hensel, Sebastian, and Tommaso Rosati. “Modelled Distributions of Triebel–Lizorkin Type.” Studia Mathematica. Instytut Matematyczny, 2020. https://doi.org/10.4064/sm180411-11-2. ieee: S. Hensel and T. Rosati, “Modelled distributions of Triebel–Lizorkin type,” Studia Mathematica, vol. 252, no. 3. Instytut Matematyczny, pp. 251–297, 2020. ista: Hensel S, Rosati T. 2020. Modelled distributions of Triebel–Lizorkin type. Studia Mathematica. 252(3), 251–297. mla: Hensel, Sebastian, and Tommaso Rosati. “Modelled Distributions of Triebel–Lizorkin Type.” Studia Mathematica, vol. 252, no. 3, Instytut Matematyczny, 2020, pp. 251–97, doi:10.4064/sm180411-11-2. short: S. Hensel, T. Rosati, Studia Mathematica 252 (2020) 251–297. date_created: 2021-02-25T08:55:03Z date_published: 2020-03-01T00:00:00Z date_updated: 2025-06-24T12:07:06Z day: '01' department: - _id: JuFi - _id: GradSch doi: 10.4064/sm180411-11-2 external_id: arxiv: - '1709.05202' isi: - '000558100500002' intvolume: ' 252' isi: 1 issue: '3' keyword: - General Mathematics language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.1709.05202 month: '03' oa: 1 oa_version: Preprint page: 251-297 publication: Studia Mathematica publication_identifier: eissn: - 1730-6337 issn: - 0039-3223 publication_status: published publisher: Instytut Matematyczny quality_controlled: '1' scopus_import: '1' status: public title: Modelled distributions of Triebel–Lizorkin type type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 252 year: '2020' ... --- OA_place: repository OA_type: green _id: '9197' abstract: - lang: eng text: In this paper we introduce and study all-pay bidding games, a class of two player, zero-sum games on graphs. The game proceeds as follows. We place a token on some vertex in the graph and assign budgets to the two players. Each turn, each player submits a sealed legal bid (non-negative and below their remaining budget), which is deducted from their budget and the highest bidder moves the token onto an adjacent vertex. The game ends once a sink is reached, and Player 1 pays Player 2 the outcome that is associated with the sink. The players attempt to maximize their expected outcome. Our games model settings where effort (of no inherent value) needs to be invested in an ongoing and stateful manner. On the negative side, we show that even in simple games on DAGs, optimal strategies may require a distribution over bids with infinite support. A central quantity in bidding games is the ratio of the players budgets. On the positive side, we show a simple FPTAS for DAGs, that, for each budget ratio, outputs an approximation for the optimal strategy for that ratio. We also implement it, show that it performs well, and suggests interesting properties of these games. Then, given an outcome c, we show an algorithm for finding the necessary and sufficient initial ratio for guaranteeing outcome c with probability 1 and a strategy ensuring such. Finally, while the general case has not previously been studied, solving the specific game in which Player 1 wins iff he wins the first two auctions, has been long stated as an open question, which we solve. acknowledgement: This research was supported by the Austrian Science Fund (FWF) under grants S11402-N23 (RiSE/SHiNE), Z211-N23 (Wittgenstein Award), and M 2369-N33 (Meitner fellowship). article_processing_charge: No article_type: original arxiv: 1 author: - first_name: Guy full_name: Avni, Guy id: 463C8BC2-F248-11E8-B48F-1D18A9856A87 last_name: Avni orcid: 0000-0001-5588-8287 - 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: Josef full_name: Tkadlec, Josef id: 3F24CCC8-F248-11E8-B48F-1D18A9856A87 last_name: Tkadlec orcid: 0000-0002-1097-9684 citation: ama: Avni G, Ibsen-Jensen R, Tkadlec J. All-pay bidding games on graphs. Proceedings of the AAAI Conference on Artificial Intelligence. 2020;34(02):1798-1805. doi:10.1609/aaai.v34i02.5546 apa: 'Avni, G., Ibsen-Jensen, R., & Tkadlec, J. (2020). All-pay bidding games on graphs. Proceedings of the AAAI Conference on Artificial Intelligence. New York, NY, United States: Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/aaai.v34i02.5546' chicago: Avni, Guy, Rasmus Ibsen-Jensen, and Josef Tkadlec. “All-Pay Bidding Games on Graphs.” Proceedings of the AAAI Conference on Artificial Intelligence. Association for the Advancement of Artificial Intelligence, 2020. https://doi.org/10.1609/aaai.v34i02.5546. ieee: G. Avni, R. Ibsen-Jensen, and J. Tkadlec, “All-pay bidding games on graphs,” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 34, no. 02. Association for the Advancement of Artificial Intelligence, pp. 1798–1805, 2020. ista: Avni G, Ibsen-Jensen R, Tkadlec J. 2020. All-pay bidding games on graphs. Proceedings of the AAAI Conference on Artificial Intelligence. 34(02), 1798–1805. mla: Avni, Guy, et al. “All-Pay Bidding Games on Graphs.” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 34, no. 02, Association for the Advancement of Artificial Intelligence, 2020, pp. 1798–805, doi:10.1609/aaai.v34i02.5546. short: G. Avni, R. Ibsen-Jensen, J. Tkadlec, Proceedings of the AAAI Conference on Artificial Intelligence 34 (2020) 1798–1805. conference: end_date: 2020-02-12 location: New York, NY, United States name: 'AAAI: Conference on Artificial Intelligence' start_date: 2020-02-07 date_created: 2021-02-25T09:05:18Z date_published: 2020-04-03T00:00:00Z date_updated: 2025-07-03T11:44:58Z day: '03' department: - _id: ToHe - _id: KrCh doi: 10.1609/aaai.v34i02.5546 external_id: arxiv: - '1911.08360' intvolume: ' 34' issue: '02' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1911.08360 month: '04' oa: 1 oa_version: Preprint page: 1798-1805 project: - _id: 25F2ACDE-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11402-N23 name: Rigorous Systems Engineering - _id: 25F42A32-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z211 name: Formal methods for the design and analysis of complex systems - _id: 264B3912-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: M02369 name: Formal Methods meets Algorithmic Game Theory publication: Proceedings of the AAAI Conference on Artificial Intelligence publication_identifier: eissn: - 2374-3468 isbn: - '9781577358350' issn: - 2159-5399 publication_status: published publisher: Association for the Advancement of Artificial Intelligence quality_controlled: '1' scopus_import: '1' status: public title: All-pay bidding games on graphs type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 34 year: '2020' ... --- _id: '9202' abstract: - lang: eng text: We propose a novel hybridization method for stability analysis that over-approximates nonlinear dynamical systems by switched systems with linear inclusion dynamics. We observe that existing hybridization techniques for safety analysis that over-approximate nonlinear dynamical systems by switched affine inclusion dynamics and provide fixed approximation error, do not suffice for stability analysis. Hence, we propose a hybridization method that provides a state-dependent error which converges to zero as the state tends to the equilibrium point. The crux of our hybridization computation is an elegant recursive algorithm that uses partial derivatives of a given function to obtain upper and lower bound matrices for the over-approximating linear inclusion. We illustrate our method on some examples to demonstrate the application of the theory for stability analysis. In particular, our method is able to establish stability of a nonlinear system which does not admit a polynomial Lyapunov function. acknowledgement: Miriam Garc´ıa Soto was partially supported by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). Pavithra Prabhakar was partially supported by NSF CAREER Award No. 1552668, NSF Award No. 2008957 and ONR YIP Award No. N000141712577. article_processing_charge: No author: - first_name: Miriam full_name: Garcia Soto, Miriam id: 4B3207F6-F248-11E8-B48F-1D18A9856A87 last_name: Garcia Soto orcid: 0000-0003-2936-5719 - first_name: Pavithra full_name: Prabhakar, Pavithra last_name: Prabhakar citation: ama: 'Garcia Soto M, Prabhakar P. Hybridization for stability verification of nonlinear switched systems. In: 2020 IEEE Real-Time Systems Symposium. IEEE; 2020:244-256. doi:10.1109/RTSS49844.2020.00031' apa: 'Garcia Soto, M., & Prabhakar, P. (2020). Hybridization for stability verification of nonlinear switched systems. In 2020 IEEE Real-Time Systems Symposium (pp. 244–256). Houston, TX, USA : IEEE. https://doi.org/10.1109/RTSS49844.2020.00031' chicago: Garcia Soto, Miriam, and Pavithra Prabhakar. “Hybridization for Stability Verification of Nonlinear Switched Systems.” In 2020 IEEE Real-Time Systems Symposium, 244–56. IEEE, 2020. https://doi.org/10.1109/RTSS49844.2020.00031. ieee: M. Garcia Soto and P. Prabhakar, “Hybridization for stability verification of nonlinear switched systems,” in 2020 IEEE Real-Time Systems Symposium, Houston, TX, USA , 2020, pp. 244–256. ista: 'Garcia Soto M, Prabhakar P. 2020. Hybridization for stability verification of nonlinear switched systems. 2020 IEEE Real-Time Systems Symposium. RTTS: Real-Time Systems Symposium, 244–256.' mla: Garcia Soto, Miriam, and Pavithra Prabhakar. “Hybridization for Stability Verification of Nonlinear Switched Systems.” 2020 IEEE Real-Time Systems Symposium, IEEE, 2020, pp. 244–56, doi:10.1109/RTSS49844.2020.00031. short: M. Garcia Soto, P. Prabhakar, in:, 2020 IEEE Real-Time Systems Symposium, IEEE, 2020, pp. 244–256. conference: end_date: 2020-12-04 location: 'Houston, TX, USA ' name: 'RTTS: Real-Time Systems Symposium' start_date: 2020-12-01 date_created: 2021-02-26T16:38:24Z date_published: 2020-12-01T00:00:00Z date_updated: 2025-04-15T06:25:57Z day: '01' ddc: - '000' department: - _id: ToHe doi: 10.1109/RTSS49844.2020.00031 external_id: isi: - '000680435100021' file: - access_level: open_access checksum: 8f97f229316c3b3a6f0cf99297aa0941 content_type: application/pdf creator: mgarcias date_created: 2021-02-26T16:38:14Z date_updated: 2021-02-26T16:38:14Z file_id: '9203' file_name: main.pdf file_size: 1125794 relation: main_file file_date_updated: 2021-02-26T16:38:14Z has_accepted_license: '1' isi: 1 language: - iso: eng month: '12' oa: 1 oa_version: Submitted Version page: 244-256 project: - _id: 25F42A32-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z211 name: Formal methods for the design and analysis of complex systems publication: 2020 IEEE Real-Time Systems Symposium publication_identifier: eisbn: - '9781728183244' eissn: - 2576-3172 publication_status: published publisher: IEEE quality_controlled: '1' scopus_import: '1' status: public title: Hybridization for stability verification of nonlinear switched systems type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 year: '2020' ... --- _id: '9221' abstract: - lang: eng text: "Recent works have shown that gradient descent can find a global minimum for over-parameterized neural networks where the widths of all the hidden layers scale polynomially with N (N being the number of training samples). In this paper, we prove that, for deep networks, a single layer of width N following the input layer suffices to ensure a similar guarantee. In particular, all the remaining layers are allowed to have constant widths, and form a pyramidal topology. We show an application of our result to the widely used LeCun’s initialization and obtain an over-parameterization requirement for the single wide layer of order N2.\r\n" acknowledgement: The authors would like to thank Jan Maas, Mahdi Soltanolkotabi, and Daniel Soudry for the helpful discussions, Marius Kloft, Matthias Hein and Quoc Dinh Tran for proofreading portions of a prior version of this paper, and James Martens for a clarification concerning LeCun’s initialization. M. Mondelli was partially supported by the 2019 Lopez-Loreta Prize. Q. Nguyen was partially supported by the German Research Foundation (DFG) award KL 2698/2-1. alternative_title: - Advances in Neural Information Processing Systems article_processing_charge: No arxiv: 1 author: - first_name: Quynh full_name: Nguyen, Quynh last_name: Nguyen - first_name: Marco full_name: Mondelli, Marco id: 27EB676C-8706-11E9-9510-7717E6697425 last_name: Mondelli orcid: 0000-0002-3242-7020 citation: ama: 'Nguyen Q, Mondelli M. Global convergence of deep networks with one wide layer followed by pyramidal topology. In: 34th Conference on Neural Information Processing Systems. Vol 33. Neural Information Processing Systems Foundation; 2020:11961–11972.' apa: 'Nguyen, Q., & Mondelli, M. (2020). Global convergence of deep networks with one wide layer followed by pyramidal topology. In 34th Conference on Neural Information Processing Systems (Vol. 33, pp. 11961–11972). Vancouver, Canada: Neural Information Processing Systems Foundation.' chicago: Nguyen, Quynh, and Marco Mondelli. “Global Convergence of Deep Networks with One Wide Layer Followed by Pyramidal Topology.” In 34th Conference on Neural Information Processing Systems, 33:11961–11972. Neural Information Processing Systems Foundation, 2020. ieee: Q. Nguyen and M. Mondelli, “Global convergence of deep networks with one wide layer followed by pyramidal topology,” in 34th Conference on Neural Information Processing Systems, Vancouver, Canada, 2020, vol. 33, pp. 11961–11972. ista: 'Nguyen Q, Mondelli M. 2020. Global convergence of deep networks with one wide layer followed by pyramidal topology. 34th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, vol. 33, 11961–11972.' mla: Nguyen, Quynh, and Marco Mondelli. “Global Convergence of Deep Networks with One Wide Layer Followed by Pyramidal Topology.” 34th Conference on Neural Information Processing Systems, vol. 33, Neural Information Processing Systems Foundation, 2020, pp. 11961–11972. short: Q. Nguyen, M. Mondelli, in:, 34th Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2020, pp. 11961–11972. conference: end_date: 2020-12-12 location: Vancouver, Canada name: 'NeurIPS: Neural Information Processing Systems' start_date: 2020-12-06 date_created: 2021-03-03T12:06:02Z date_published: 2020-07-07T00:00:00Z date_updated: 2025-05-14T11:27:13Z day: '07' department: - _id: MaMo external_id: arxiv: - '2002.07867' intvolume: ' 33' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/2002.07867 month: '07' oa: 1 oa_version: Preprint page: 11961–11972 project: - _id: 059876FA-7A3F-11EA-A408-12923DDC885E name: Prix Lopez-Loretta 2019 - Marco Mondelli publication: 34th Conference on Neural Information Processing Systems publication_status: published publisher: Neural Information Processing Systems Foundation quality_controlled: '1' status: public title: Global convergence of deep networks with one wide layer followed by pyramidal topology type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 33 year: '2020' ... --- _id: '9222' article_processing_charge: No author: - first_name: Georgios full_name: Katsaros, Georgios id: 38DB5788-F248-11E8-B48F-1D18A9856A87 last_name: Katsaros orcid: 0000-0001-8342-202X citation: ama: 'Katsaros G. Transport data for: Site‐controlled uniform Ge/Si Hut wires with electrically tunable spin–orbit coupling. 2020. doi:10.15479/AT:ISTA:9222' apa: 'Katsaros, G. (2020). Transport data for: Site‐controlled uniform Ge/Si Hut wires with electrically tunable spin–orbit coupling. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:9222' chicago: 'Katsaros, Georgios. “Transport Data for: Site‐controlled Uniform Ge/Si Hut Wires with Electrically Tunable Spin–Orbit Coupling.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:9222.' ieee: 'G. Katsaros, “Transport data for: Site‐controlled uniform Ge/Si Hut wires with electrically tunable spin–orbit coupling.” Institute of Science and Technology Austria, 2020.' ista: 'Katsaros G. 2020. Transport data for: Site‐controlled uniform Ge/Si Hut wires with electrically tunable spin–orbit coupling, Institute of Science and Technology Austria, 10.15479/AT:ISTA:9222.' mla: 'Katsaros, Georgios. Transport Data for: Site‐controlled Uniform Ge/Si Hut Wires with Electrically Tunable Spin–Orbit Coupling. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:9222.' short: G. Katsaros, (2020). contributor: - contributor_type: research_group first_name: Georgios id: 38DB5788-F248-11E8-B48F-1D18A9856A87 last_name: Katsaros corr_author: '1' date_created: 2021-03-05T18:00:47Z date_published: 2020-03-16T00:00:00Z date_updated: 2025-06-12T07:16:21Z day: '16' ddc: - '530' department: - _id: GeKa doi: 10.15479/AT:ISTA:9222 file: - access_level: open_access checksum: 41b66e195ed3dbd73077feee77b05652 content_type: application/x-zip-compressed creator: gkatsaro date_created: 2021-03-05T17:50:45Z date_updated: 2021-03-05T17:50:45Z file_id: '9223' file_name: DOI_SiteControlledHWs.zip file_size: 13317557 relation: main_file - access_level: open_access checksum: a1dc5f710ba4b3bb7f248195ba754ab2 content_type: text/plain creator: dernst date_created: 2021-03-10T07:31:50Z date_updated: 2021-03-10T07:31:50Z file_id: '9233' file_name: Readme.txt file_size: 3515 relation: main_file success: 1 file_date_updated: 2021-03-10T07:31:50Z has_accepted_license: '1' license: https://creativecommons.org/publicdomain/zero/1.0/ month: '03' oa: 1 oa_version: Published Version publisher: Institute of Science and Technology Austria related_material: record: - id: '7541' relation: used_in_publication status: public status: public title: 'Transport data for: Site‐controlled uniform Ge/Si Hut wires with electrically tunable spin–orbit coupling' tmp: image: /images/cc_0.png legal_code_url: https://creativecommons.org/publicdomain/zero/1.0/legalcode name: Creative Commons Public Domain Dedication (CC0 1.0) short: CC0 (1.0) type: research_data user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2020' ... --- _id: '9249' abstract: - lang: eng text: Rhombic dodecahedron is a space filling polyhedron which represents the close packing of spheres in 3D space and the Voronoi structures of the face centered cubic (FCC) lattice. In this paper, we describe a new coordinate system where every 3-integer coordinates grid point corresponds to a rhombic dodecahedron centroid. In order to illustrate the interest of the new coordinate system, we propose the characterization of 3D digital plane with its topological features, such as the interrelation between the thickness of the digital plane and the separability constraint we aim to obtain. We also present the characterization of 3D digital lines and study it as the intersection of multiple digital planes. Characterization of 3D digital sphere with relevant topological features is proposed as well along with the 48-symmetry appearing in the new coordinate system. acknowledgement: "This work has been partially supported by the European Research Council (ERC) under\r\nthe European Union’s Horizon 2020 research and innovation programme, grant no. 788183, and the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, Austrian Science Fund (FWF), grant no. I 02979-N35. " article_processing_charge: No article_type: original author: - first_name: Ranita full_name: Biswas, Ranita id: 3C2B033E-F248-11E8-B48F-1D18A9856A87 last_name: Biswas orcid: 0000-0002-5372-7890 - first_name: Gaëlle full_name: Largeteau-Skapin, Gaëlle last_name: Largeteau-Skapin - first_name: Rita full_name: Zrour, Rita last_name: Zrour - first_name: Eric full_name: Andres, Eric last_name: Andres citation: ama: Biswas R, Largeteau-Skapin G, Zrour R, Andres E. Digital objects in rhombic dodecahedron grid. Mathematical Morphology - Theory and Applications. 2020;4(1):143-158. doi:10.1515/mathm-2020-0106 apa: Biswas, R., Largeteau-Skapin, G., Zrour, R., & Andres, E. (2020). Digital objects in rhombic dodecahedron grid. Mathematical Morphology - Theory and Applications. De Gruyter. https://doi.org/10.1515/mathm-2020-0106 chicago: Biswas, Ranita, Gaëlle Largeteau-Skapin, Rita Zrour, and Eric Andres. “Digital Objects in Rhombic Dodecahedron Grid.” Mathematical Morphology - Theory and Applications. De Gruyter, 2020. https://doi.org/10.1515/mathm-2020-0106. ieee: R. Biswas, G. Largeteau-Skapin, R. Zrour, and E. Andres, “Digital objects in rhombic dodecahedron grid,” Mathematical Morphology - Theory and Applications, vol. 4, no. 1. De Gruyter, pp. 143–158, 2020. ista: Biswas R, Largeteau-Skapin G, Zrour R, Andres E. 2020. Digital objects in rhombic dodecahedron grid. Mathematical Morphology - Theory and Applications. 4(1), 143–158. mla: Biswas, Ranita, et al. “Digital Objects in Rhombic Dodecahedron Grid.” Mathematical Morphology - Theory and Applications, vol. 4, no. 1, De Gruyter, 2020, pp. 143–58, doi:10.1515/mathm-2020-0106. short: R. Biswas, G. Largeteau-Skapin, R. Zrour, E. Andres, Mathematical Morphology - Theory and Applications 4 (2020) 143–158. corr_author: '1' date_created: 2021-03-16T08:55:19Z date_published: 2020-11-17T00:00:00Z date_updated: 2025-04-14T07:48:35Z day: '17' ddc: - '510' department: - _id: HeEd doi: 10.1515/mathm-2020-0106 ec_funded: 1 file: - access_level: open_access checksum: 4a1043fa0548a725d464017fe2483ce0 content_type: application/pdf creator: dernst date_created: 2021-03-22T08:56:37Z date_updated: 2021-03-22T08:56:37Z file_id: '9272' file_name: 2020_MathMorpholTheoryAppl_Biswas.pdf file_size: 3668725 relation: main_file success: 1 file_date_updated: 2021-03-22T08:56:37Z has_accepted_license: '1' intvolume: ' 4' issue: '1' language: - iso: eng month: '11' oa: 1 oa_version: Published Version page: 143-158 project: - _id: 266A2E9E-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '788183' name: Alpha Shape Theory Extended - _id: 2561EBF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: I02979-N35 name: Persistence and stability of geometric complexes publication: Mathematical Morphology - Theory and Applications publication_identifier: issn: - 2353-3390 publication_status: published publisher: De Gruyter quality_controlled: '1' status: public title: Digital objects in rhombic dodecahedron grid 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: 4 year: '2020' ... --- _id: '9299' abstract: - lang: eng text: We call a multigraph non-homotopic if it can be drawn in the plane in such a way that no two edges connecting the same pair of vertices can be continuously transformed into each other without passing through a vertex, and no loop can be shrunk to its end-vertex in the same way. It is easy to see that a non-homotopic multigraph on n>1 vertices can have arbitrarily many edges. We prove that the number of crossings between the edges of a non-homotopic multigraph with n vertices and m>4n edges is larger than cm2n for some constant c>0 , and that this bound is tight up to a polylogarithmic factor. We also show that the lower bound is not asymptotically sharp as n is fixed and m⟶∞ . acknowledgement: Supported by the National Research, Development and Innovation Office, NKFIH, KKP-133864, K-131529, K-116769, K-132696, by the Higher Educational Institutional Excellence Program 2019 NKFIH-1158-6/2019, the Austrian Science Fund (FWF), grant Z 342-N31, by the Ministry of Education and Science of the Russian Federation MegaGrant No. 075-15-2019-1926, and by the ERC Synergy Grant “Dynasnet” No. 810115. A full version can be found at https://arxiv.org/abs/2006.14908. article_processing_charge: No arxiv: 1 author: - first_name: János full_name: Pach, János id: E62E3130-B088-11EA-B919-BF823C25FEA4 last_name: Pach - first_name: Gábor full_name: Tardos, Gábor last_name: Tardos - first_name: Géza full_name: Tóth, Géza last_name: Tóth citation: ama: 'Pach J, Tardos G, Tóth G. Crossings between non-homotopic edges. In: 28th International Symposium on Graph Drawing and Network Visualization. Vol 12590. LNCS. Springer Nature; 2020:359-371. doi:10.1007/978-3-030-68766-3_28' apa: 'Pach, J., Tardos, G., & Tóth, G. (2020). Crossings between non-homotopic edges. In 28th International Symposium on Graph Drawing and Network Visualization (Vol. 12590, pp. 359–371). Virtual, Online: Springer Nature. https://doi.org/10.1007/978-3-030-68766-3_28' chicago: Pach, János, Gábor Tardos, and Géza Tóth. “Crossings between Non-Homotopic Edges.” In 28th International Symposium on Graph Drawing and Network Visualization, 12590:359–71. LNCS. Springer Nature, 2020. https://doi.org/10.1007/978-3-030-68766-3_28. ieee: J. Pach, G. Tardos, and G. Tóth, “Crossings between non-homotopic edges,” in 28th International Symposium on Graph Drawing and Network Visualization, Virtual, Online, 2020, vol. 12590, pp. 359–371. ista: 'Pach J, Tardos G, Tóth G. 2020. Crossings between non-homotopic edges. 28th International Symposium on Graph Drawing and Network Visualization. GD: Graph Drawing and Network VisualizationLNCS vol. 12590, 359–371.' mla: Pach, János, et al. “Crossings between Non-Homotopic Edges.” 28th International Symposium on Graph Drawing and Network Visualization, vol. 12590, Springer Nature, 2020, pp. 359–71, doi:10.1007/978-3-030-68766-3_28. short: J. Pach, G. Tardos, G. Tóth, in:, 28th International Symposium on Graph Drawing and Network Visualization, Springer Nature, 2020, pp. 359–371. conference: end_date: 2020-09-18 location: Virtual, Online name: 'GD: Graph Drawing and Network Visualization' start_date: 2020-09-16 date_created: 2021-03-28T22:01:44Z date_published: 2020-09-20T00:00:00Z date_updated: 2025-04-15T07:16:52Z day: '20' department: - _id: HeEd doi: 10.1007/978-3-030-68766-3_28 external_id: arxiv: - '2006.14908' intvolume: ' 12590' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/2006.14908 month: '09' oa: 1 oa_version: Preprint page: 359-371 project: - _id: 268116B8-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z00342 name: Mathematics, Computer Science publication: 28th International Symposium on Graph Drawing and Network Visualization publication_identifier: eissn: - 1611-3349 isbn: - '9783030687656' issn: - 0302-9743 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' series_title: LNCS status: public title: Crossings between non-homotopic edges type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 12590 year: '2020' ... --- _id: '9308' acknowledgement: This research was carried out with the support of the Russian Foundation for Basic Research(grant no. 19-01-00169) article_processing_charge: No article_type: original arxiv: 1 author: - first_name: Sergey full_name: Avvakumov, Sergey id: 3827DAC8-F248-11E8-B48F-1D18A9856A87 last_name: Avvakumov orcid: 0000-0002-7840-5062 - first_name: Uli full_name: Wagner, Uli id: 36690CA2-F248-11E8-B48F-1D18A9856A87 last_name: Wagner orcid: 0000-0002-1494-0568 - first_name: Isaac full_name: Mabillard, Isaac id: 32BF9DAA-F248-11E8-B48F-1D18A9856A87 last_name: Mabillard - first_name: A. B. full_name: Skopenkov, A. B. last_name: Skopenkov citation: ama: Avvakumov S, Wagner U, Mabillard I, Skopenkov AB. Eliminating higher-multiplicity intersections, III. Codimension 2. Russian Mathematical Surveys. 2020;75(6):1156-1158. doi:10.1070/RM9943 apa: Avvakumov, S., Wagner, U., Mabillard, I., & Skopenkov, A. B. (2020). Eliminating higher-multiplicity intersections, III. Codimension 2. Russian Mathematical Surveys. IOP Publishing. https://doi.org/10.1070/RM9943 chicago: Avvakumov, Sergey, Uli Wagner, Isaac Mabillard, and A. B. Skopenkov. “Eliminating Higher-Multiplicity Intersections, III. Codimension 2.” Russian Mathematical Surveys. IOP Publishing, 2020. https://doi.org/10.1070/RM9943. ieee: S. Avvakumov, U. Wagner, I. Mabillard, and A. B. Skopenkov, “Eliminating higher-multiplicity intersections, III. Codimension 2,” Russian Mathematical Surveys, vol. 75, no. 6. IOP Publishing, pp. 1156–1158, 2020. ista: Avvakumov S, Wagner U, Mabillard I, Skopenkov AB. 2020. Eliminating higher-multiplicity intersections, III. Codimension 2. Russian Mathematical Surveys. 75(6), 1156–1158. mla: Avvakumov, Sergey, et al. “Eliminating Higher-Multiplicity Intersections, III. Codimension 2.” Russian Mathematical Surveys, vol. 75, no. 6, IOP Publishing, 2020, pp. 1156–58, doi:10.1070/RM9943. short: S. Avvakumov, U. Wagner, I. Mabillard, A.B. Skopenkov, Russian Mathematical Surveys 75 (2020) 1156–1158. date_created: 2021-04-04T22:01:22Z date_published: 2020-12-01T00:00:00Z date_updated: 2025-07-02T10:54:51Z day: '01' department: - _id: UlWa doi: 10.1070/RM9943 external_id: arxiv: - '1511.03501' isi: - '000625983100001' intvolume: ' 75' isi: 1 issue: '6' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1511.03501 month: '12' oa: 1 oa_version: Preprint page: 1156-1158 publication: Russian Mathematical Surveys publication_identifier: issn: - 0036-0279 publication_status: published publisher: IOP Publishing quality_controlled: '1' related_material: record: - id: '10220' relation: later_version status: public - id: '8183' relation: earlier_version status: public scopus_import: '1' status: public title: Eliminating higher-multiplicity intersections, III. Codimension 2 type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 75 year: '2020' ... --- _id: '9326' abstract: - lang: eng text: The mitochondrial respiratory chain, formed by five protein complexes, utilizes energy from catabolic processes to synthesize ATP. Complex I, the first and the largest protein complex of the chain, harvests electrons from NADH to reduce quinone, while pumping protons across the mitochondrial membrane. Detailed knowledge of the working principle of such coupled charge-transfer processes remains, however, fragmentary due to bottlenecks in understanding redox-driven conformational transitions and their interplay with the hydrated proton pathways. Complex I from Thermus thermophilus encases 16 subunits with nine iron–sulfur clusters, reduced by electrons from NADH. Here, employing the latest crystal structure of T. thermophilus complex I, we have used microsecond-scale molecular dynamics simulations to study the chemo-mechanical coupling between redox changes of the iron–sulfur clusters and conformational transitions across complex I. First, we identify the redox switches within complex I, which allosterically couple the dynamics of the quinone binding pocket to the site of NADH reduction. Second, our free-energy calculations reveal that the affinity of the quinone, specifically menaquinone, for the binding-site is higher than that of its reduced, menaquinol forma design essential for menaquinol release. Remarkably, the barriers to diffusive menaquinone dynamics are lesser than that of the more ubiquitous ubiquinone, and the naphthoquinone headgroup of the former furnishes stronger binding interactions with the pocket, favoring menaquinone for charge transport in T. thermophilus. Our computations are consistent with experimentally validated mutations and hierarchize the key residues into three functional classes, identifying new mutation targets. Third, long-range hydrogen-bond networks connecting the quinone-binding site to the transmembrane subunits are found to be responsible for proton pumping. Put together, the simulations reveal the molecular design principles linking redox reactions to quinone turnover to proton translocation in complex I. article_processing_charge: No author: - first_name: Chitrak full_name: Gupta, Chitrak last_name: Gupta - first_name: Umesh full_name: Khaniya, Umesh last_name: Khaniya - first_name: Chun full_name: Chan, Chun last_name: Chan - first_name: Francois full_name: Dehez, Francois last_name: Dehez - first_name: Mrinal full_name: Shekhar, Mrinal last_name: Shekhar - first_name: M. R. full_name: Gunner, M. R. last_name: Gunner - first_name: Leonid A full_name: Sazanov, Leonid A id: 338D39FE-F248-11E8-B48F-1D18A9856A87 last_name: Sazanov orcid: 0000-0002-0977-7989 - first_name: Christophe full_name: Chipot, Christophe last_name: Chipot - first_name: Abhishek full_name: Singharoy, Abhishek last_name: Singharoy citation: ama: Gupta C, Khaniya U, Chan C, et al. Charge transfer and chemo-mechanical coupling in respiratory complex I. 2020. doi:10.1021/jacs.9b13450.s002 apa: Gupta, C., Khaniya, U., Chan, C., Dehez, F., Shekhar, M., Gunner, M. R., … Singharoy, A. (2020). Charge transfer and chemo-mechanical coupling in respiratory complex I. American Chemical Society. https://doi.org/10.1021/jacs.9b13450.s002 chicago: Gupta, Chitrak, Umesh Khaniya, Chun Chan, Francois Dehez, Mrinal Shekhar, M. R. Gunner, Leonid A Sazanov, Christophe Chipot, and Abhishek Singharoy. “Charge Transfer and Chemo-Mechanical Coupling in Respiratory Complex I.” American Chemical Society, 2020. https://doi.org/10.1021/jacs.9b13450.s002. ieee: C. Gupta et al., “Charge transfer and chemo-mechanical coupling in respiratory complex I.” American Chemical Society, 2020. ista: Gupta C, Khaniya U, Chan C, Dehez F, Shekhar M, Gunner MR, Sazanov LA, Chipot C, Singharoy A. 2020. Charge transfer and chemo-mechanical coupling in respiratory complex I, American Chemical Society, 10.1021/jacs.9b13450.s002. mla: Gupta, Chitrak, et al. Charge Transfer and Chemo-Mechanical Coupling in Respiratory Complex I. American Chemical Society, 2020, doi:10.1021/jacs.9b13450.s002. short: C. Gupta, U. Khaniya, C. Chan, F. Dehez, M. Shekhar, M.R. Gunner, L.A. Sazanov, C. Chipot, A. Singharoy, (2020). date_created: 2021-04-14T12:05:20Z date_published: 2020-05-20T00:00:00Z date_updated: 2025-07-10T11:55:01Z day: '20' department: - _id: LeSa doi: 10.1021/jacs.9b13450.s002 month: '05' oa_version: Published Version publisher: American Chemical Society related_material: record: - id: '8040' relation: used_in_publication status: public status: public title: Charge transfer and chemo-mechanical coupling in respiratory complex I tmp: image: /images/cc_by_nc.png legal_code_url: https://creativecommons.org/licenses/by-nc/4.0/legalcode name: Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0) short: CC BY-NC (4.0) type: research_data_reference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2020' ... --- _id: '9415' abstract: - lang: eng text: 'Optimizing convolutional neural networks for fast inference has recently become an extremely active area of research. One of the go-to solutions in this context is weight pruning, which aims to reduce computational and memory footprint by removing large subsets of the connections in a neural network. Surprisingly, much less attention has been given to exploiting sparsity in the activation maps, which tend to be naturally sparse in many settings thanks to the structure of rectified linear (ReLU) activation functions. In this paper, we present an in-depth analysis of methods for maximizing the sparsity of the activations in a trained neural network, and show that, when coupled with an efficient sparse-input convolution algorithm, we can leverage this sparsity for significant performance gains. To induce highly sparse activation maps without accuracy loss, we introduce a new regularization technique, coupled with a new threshold-based sparsification method based on a parameterized activation function called Forced-Activation-Threshold Rectified Linear Unit (FATReLU). We examine the impact of our methods on popular image classification models, showing that most architectures can adapt to significantly sparser activation maps without any accuracy loss. Our second contribution is showing that these these compression gains can be translated into inference speedups: we provide a new algorithm to enable fast convolution operations over networks with sparse activations, and show that it can enable significant speedups for end-to-end inference on a range of popular models on the large-scale ImageNet image classification task on modern Intel CPUs, with little or no retraining cost. ' article_processing_charge: No author: - first_name: Mark full_name: Kurtz, Mark last_name: Kurtz - first_name: Justin full_name: Kopinsky, Justin last_name: Kopinsky - first_name: Rati full_name: Gelashvili, Rati last_name: Gelashvili - first_name: Alexander full_name: Matveev, Alexander last_name: Matveev - first_name: John full_name: Carr, John last_name: Carr - first_name: Michael full_name: Goin, Michael last_name: Goin - first_name: William full_name: Leiserson, William last_name: Leiserson - first_name: Sage full_name: Moore, Sage last_name: Moore - first_name: Bill full_name: Nell, Bill last_name: Nell - first_name: Nir full_name: Shavit, Nir last_name: Shavit - first_name: Dan-Adrian full_name: Alistarh, Dan-Adrian id: 4A899BFC-F248-11E8-B48F-1D18A9856A87 last_name: Alistarh orcid: 0000-0003-3650-940X citation: ama: 'Kurtz M, Kopinsky J, Gelashvili R, et al. Inducing and exploiting activation sparsity for fast neural network inference. In: 37th International Conference on Machine Learning, ICML 2020. Vol 119. ; 2020:5533-5543.' apa: Kurtz, M., Kopinsky, J., Gelashvili, R., Matveev, A., Carr, J., Goin, M., … Alistarh, D.-A. (2020). Inducing and exploiting activation sparsity for fast neural network inference. In 37th International Conference on Machine Learning, ICML 2020 (Vol. 119, pp. 5533–5543). Online. chicago: Kurtz, Mark, Justin Kopinsky, Rati Gelashvili, Alexander Matveev, John Carr, Michael Goin, William Leiserson, et al. “Inducing and Exploiting Activation Sparsity for Fast Neural Network Inference.” In 37th International Conference on Machine Learning, ICML 2020, 119:5533–43, 2020. ieee: M. Kurtz et al., “Inducing and exploiting activation sparsity for fast neural network inference,” in 37th International Conference on Machine Learning, ICML 2020, Online, 2020, vol. 119, pp. 5533–5543. ista: 'Kurtz M, Kopinsky J, Gelashvili R, Matveev A, Carr J, Goin M, Leiserson W, Moore S, Nell B, Shavit N, Alistarh D-A. 2020. Inducing and exploiting activation sparsity for fast neural network inference. 37th International Conference on Machine Learning, ICML 2020. ICML: International Conference on Machine Learning vol. 119, 5533–5543.' mla: Kurtz, Mark, et al. “Inducing and Exploiting Activation Sparsity for Fast Neural Network Inference.” 37th International Conference on Machine Learning, ICML 2020, vol. 119, 2020, pp. 5533–43. short: M. Kurtz, J. Kopinsky, R. Gelashvili, A. Matveev, J. Carr, M. Goin, W. Leiserson, S. Moore, B. Nell, N. Shavit, D.-A. Alistarh, in:, 37th International Conference on Machine Learning, ICML 2020, 2020, pp. 5533–5543. conference: end_date: 2020-07-18 location: Online name: 'ICML: International Conference on Machine Learning' start_date: 2020-07-12 date_created: 2021-05-23T22:01:45Z date_published: 2020-07-12T00:00:00Z date_updated: 2023-02-23T13:57:24Z day: '12' ddc: - '000' department: - _id: DaAl file: - access_level: open_access checksum: 2aaaa7d7226e49161311d91627cf783b content_type: application/pdf creator: kschuh date_created: 2021-05-25T09:51:36Z date_updated: 2021-05-25T09:51:36Z file_id: '9421' file_name: 2020_PMLR_Kurtz.pdf file_size: 741899 relation: main_file success: 1 file_date_updated: 2021-05-25T09:51:36Z has_accepted_license: '1' intvolume: ' 119' language: - iso: eng month: '07' oa: 1 oa_version: Published Version page: 5533-5543 publication: 37th International Conference on Machine Learning, ICML 2020 publication_identifier: issn: - 2640-3498 quality_controlled: '1' scopus_import: '1' status: public title: Inducing and exploiting activation sparsity for fast neural network inference type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 119 year: '2020' ...