--- _id: '15077' abstract: - lang: eng text: "We consider the following dynamic load-balancing process: given an underlying graph G with n nodes, in each step t≥ 0, one unit of load is created, and placed at a randomly chosen graph node. In the same step, the chosen node picks a random neighbor, and the two nodes balance their loads by averaging them. We are interested in the expected gap between the minimum and maximum loads at nodes as the process progresses, and its dependence on n and on the graph structure. Variants of the above graphical balanced allocation process have been studied previously by Peres, Talwar, and Wieder [Peres et al., 2015], and by Sauerwald and Sun [Sauerwald and Sun, 2015]. These authors left as open the question of characterizing the gap in the case of cycle graphs in the dynamic case, where weights are created during the algorithm’s execution. For this case, the only known upper bound is of \U0001D4AA(n log n), following from a majorization argument due to [Peres et al., 2015], which analyzes a related graphical allocation process. In this paper, we provide an upper bound of \U0001D4AA (√n log n) on the expected gap of the above process for cycles of length n. We introduce a new potential analysis technique, which enables us to bound the difference in load between k-hop neighbors on the cycle, for any k ≤ n/2. We complement this with a \"gap covering\" argument, which bounds the maximum value of the gap by bounding its value across all possible subsets of a certain structure, and recursively bounding the gaps within each subset. We provide analytical and experimental evidence that our upper bound on the gap is tight up to a logarithmic factor." acknowledgement: "The authors sincerely thank Thomas Sauerwald and George Giakkoupis for insightful discussions, and Mohsen Ghaffari, Yuval Peres, and Udi Wieder for feedback on earlier\r\nversions of this draft. We also thank the ICALP anonymous reviewers for their very useful comments.\r\nFunding: European Research Council funding award PR1042ERC01" alternative_title: - LIPIcs article_number: '7' 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: Giorgi full_name: Nadiradze, Giorgi id: 3279A00C-F248-11E8-B48F-1D18A9856A87 last_name: Nadiradze orcid: 0000-0001-5634-0731 - first_name: Amirmojtaba full_name: Sabour, Amirmojtaba id: bcc145fd-e77f-11ea-ae8b-80d661dbff67 last_name: Sabour citation: ama: 'Alistarh D-A, Nadiradze G, Sabour A. Dynamic averaging load balancing on cycles. In: 47th International Colloquium on Automata, Languages, and Programming. Vol 168. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.ICALP.2020.7' apa: 'Alistarh, D.-A., Nadiradze, G., & Sabour, A. (2020). Dynamic averaging load balancing on cycles. In 47th International Colloquium on Automata, Languages, and Programming (Vol. 168). Saarbrücken, Germany, Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2020.7' chicago: Alistarh, Dan-Adrian, Giorgi Nadiradze, and Amirmojtaba Sabour. “Dynamic Averaging Load Balancing on Cycles.” In 47th International Colloquium on Automata, Languages, and Programming, Vol. 168. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.ICALP.2020.7. ieee: D.-A. Alistarh, G. Nadiradze, and A. Sabour, “Dynamic averaging load balancing on cycles,” in 47th International Colloquium on Automata, Languages, and Programming, Saarbrücken, Germany, Virtual, 2020, vol. 168. ista: 'Alistarh D-A, Nadiradze G, Sabour A. 2020. Dynamic averaging load balancing on cycles. 47th International Colloquium on Automata, Languages, and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LIPIcs, vol. 168, 7.' mla: Alistarh, Dan-Adrian, et al. “Dynamic Averaging Load Balancing on Cycles.” 47th International Colloquium on Automata, Languages, and Programming, vol. 168, 7, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.ICALP.2020.7. short: D.-A. Alistarh, G. Nadiradze, A. Sabour, in:, 47th International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. conference: end_date: 2020-07-11 location: Saarbrücken, Germany, Virtual name: 'ICALP: International Colloquium on Automata, Languages, and Programming' start_date: 2020-07-08 date_created: 2024-03-05T07:25:37Z date_published: 2020-06-29T00:00:00Z date_updated: 2024-03-05T07:35:53Z day: '29' ddc: - '000' department: - _id: DaAl doi: 10.4230/LIPIcs.ICALP.2020.7 ec_funded: 1 external_id: arxiv: - '2003.09297' file: - access_level: open_access checksum: e5eb16199f4ccfd77a321977eb3f026f content_type: application/pdf creator: dernst date_created: 2024-03-05T07:25:15Z date_updated: 2024-03-05T07:25:15Z file_id: '15078' file_name: 2020_LIPIcs_Alistarh.pdf file_size: 782987 relation: main_file success: 1 file_date_updated: 2024-03-05T07:25:15Z has_accepted_license: '1' intvolume: ' 168' language: - iso: eng month: '06' oa: 1 oa_version: Published Version project: - _id: 268A44D6-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '805223' name: Elastic Coordination for Scalable Machine Learning publication: 47th International Colloquium on Automata, Languages, and Programming publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' related_material: record: - id: '8286' relation: later_version status: public scopus_import: '1' status: public title: Dynamic averaging load balancing on cycles tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/3.0/legalcode name: Creative Commons Attribution 3.0 Unported (CC BY 3.0) short: CC BY (3.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 168 year: '2020' ... --- _id: '15082' abstract: - lang: eng text: "Two plane drawings of geometric graphs on the same set of points are called disjoint compatible if their union is plane and they do not have an edge in common. For a given set S of 2n points two plane drawings of perfect matchings M1 and M2 (which do not need to be disjoint nor compatible) are disjoint tree-compatible if there exists a plane drawing of a spanning tree T on S which is disjoint compatible to both M1 and M2.\r\nWe show that the graph of all disjoint tree-compatible perfect geometric matchings on 2n points in convex position is connected if and only if 2n ≥ 10. Moreover, in that case the diameter\r\nof this graph is either 4 or 5, independent of n." acknowledgement: Research on this work was initiated at the 6th Austrian-Japanese-Mexican-Spanish Workshop on Discrete Geometry and continued during the 16th European Geometric Graph-Week, both held near Strobl, Austria. We are grateful to the participants for the inspiring atmosphere. We especially thank Alexander Pilz for bringing this class of problems to our attention and Birgit Vogtenhuber for inspiring discussions. D.P. is partially supported by the FWF grant I 3340-N35 (Collaborative DACH project Arrangements and Drawings). The research stay of P.P. at IST Austria is funded by the project CZ.02.2.69/0.0/0.0/17_050/0008466 Improvement of internationalization in the field of research and development at Charles University, through the support of quality projects MSCA-IF. This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No 734922. article_number: '56' article_processing_charge: No author: - first_name: Oswin full_name: Aichholzer, Oswin last_name: Aichholzer - first_name: Julia full_name: Obmann, Julia last_name: Obmann - first_name: Pavel full_name: Patak, Pavel id: B593B804-1035-11EA-B4F1-947645A5BB83 last_name: Patak - first_name: Daniel full_name: Perz, Daniel last_name: Perz - first_name: Josef full_name: Tkadlec, Josef id: 3F24CCC8-F248-11E8-B48F-1D18A9856A87 last_name: Tkadlec orcid: 0000-0002-1097-9684 citation: ama: 'Aichholzer O, Obmann J, Patak P, Perz D, Tkadlec J. Disjoint tree-compatible plane perfect matchings. In: 36th European Workshop on Computational Geometry. ; 2020.' apa: Aichholzer, O., Obmann, J., Patak, P., Perz, D., & Tkadlec, J. (2020). Disjoint tree-compatible plane perfect matchings. In 36th European Workshop on Computational Geometry. Würzburg, Germany, Virtual. chicago: Aichholzer, Oswin, Julia Obmann, Pavel Patak, Daniel Perz, and Josef Tkadlec. “Disjoint Tree-Compatible Plane Perfect Matchings.” In 36th European Workshop on Computational Geometry, 2020. ieee: O. Aichholzer, J. Obmann, P. Patak, D. Perz, and J. Tkadlec, “Disjoint tree-compatible plane perfect matchings,” in 36th European Workshop on Computational Geometry, Würzburg, Germany, Virtual, 2020. ista: 'Aichholzer O, Obmann J, Patak P, Perz D, Tkadlec J. 2020. Disjoint tree-compatible plane perfect matchings. 36th European Workshop on Computational Geometry. EuroCG: European Workshop on Computational Geometry, 56.' mla: Aichholzer, Oswin, et al. “Disjoint Tree-Compatible Plane Perfect Matchings.” 36th European Workshop on Computational Geometry, 56, 2020. short: O. Aichholzer, J. Obmann, P. Patak, D. Perz, J. Tkadlec, in:, 36th European Workshop on Computational Geometry, 2020. conference: end_date: 2020-03-18 location: Würzburg, Germany, Virtual name: 'EuroCG: European Workshop on Computational Geometry' start_date: 2020-03-16 date_created: 2024-03-05T08:57:17Z date_published: 2020-04-01T00:00:00Z date_updated: 2024-03-05T09:00:07Z day: '01' department: - _id: KrCh - _id: UlWa language: - iso: eng main_file_link: - open_access: '1' url: https://www1.pub.informatik.uni-wuerzburg.de/eurocg2020/data/uploads/papers/eurocg20_paper_56.pdf month: '04' oa: 1 oa_version: Published Version publication: 36th European Workshop on Computational Geometry publication_status: published quality_controlled: '1' status: public title: Disjoint tree-compatible plane perfect matchings type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2020' ... --- _id: '13056' abstract: - lang: eng text: This datasets comprises all data shown in plots of the submitted article "Converting microwave and telecom photons with a silicon photonic nanomechanical interface". Additional raw data are available from the corresponding author on reasonable request. article_processing_charge: No author: - first_name: Georg M full_name: Arnold, Georg M id: 3770C838-F248-11E8-B48F-1D18A9856A87 last_name: Arnold orcid: 0000-0003-1397-7876 - first_name: Matthias full_name: Wulf, Matthias id: 45598606-F248-11E8-B48F-1D18A9856A87 last_name: Wulf orcid: 0000-0001-6613-1378 - first_name: Shabir full_name: Barzanjeh, Shabir id: 2D25E1F6-F248-11E8-B48F-1D18A9856A87 last_name: Barzanjeh orcid: 0000-0003-0415-1423 - first_name: Elena full_name: Redchenko, Elena id: 2C21D6E8-F248-11E8-B48F-1D18A9856A87 last_name: Redchenko - 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: William J full_name: Hease, William J id: 29705398-F248-11E8-B48F-1D18A9856A87 last_name: Hease orcid: 0000-0001-9868-2166 - first_name: Farid full_name: Hassani, Farid id: 2AED110C-F248-11E8-B48F-1D18A9856A87 last_name: Hassani orcid: 0000-0001-6937-5773 - first_name: Johannes M full_name: Fink, Johannes M id: 4B591CBA-F248-11E8-B48F-1D18A9856A87 last_name: Fink orcid: 0000-0001-8112-028X citation: ama: Arnold GM, Wulf M, Barzanjeh S, et al. Converting microwave and telecom photons with a silicon photonic nanomechanical interface. 2020. doi:10.5281/ZENODO.3961561 apa: Arnold, G. M., Wulf, M., Barzanjeh, S., Redchenko, E., Rueda Sanchez, A. R., Hease, W. J., … Fink, J. M. (2020). Converting microwave and telecom photons with a silicon photonic nanomechanical interface. Zenodo. https://doi.org/10.5281/ZENODO.3961561 chicago: Arnold, Georg M, Matthias Wulf, Shabir Barzanjeh, Elena Redchenko, Alfredo R Rueda Sanchez, William J Hease, Farid Hassani, and Johannes M Fink. “Converting Microwave and Telecom Photons with a Silicon Photonic Nanomechanical Interface.” Zenodo, 2020. https://doi.org/10.5281/ZENODO.3961561. ieee: G. M. Arnold et al., “Converting microwave and telecom photons with a silicon photonic nanomechanical interface.” Zenodo, 2020. ista: Arnold GM, Wulf M, Barzanjeh S, Redchenko E, Rueda Sanchez AR, Hease WJ, Hassani F, Fink JM. 2020. Converting microwave and telecom photons with a silicon photonic nanomechanical interface, Zenodo, 10.5281/ZENODO.3961561. mla: Arnold, Georg M., et al. Converting Microwave and Telecom Photons with a Silicon Photonic Nanomechanical Interface. Zenodo, 2020, doi:10.5281/ZENODO.3961561. short: G.M. Arnold, M. Wulf, S. Barzanjeh, E. Redchenko, A.R. Rueda Sanchez, W.J. Hease, F. Hassani, J.M. Fink, (2020). date_created: 2023-05-23T13:37:41Z date_published: 2020-07-27T00:00:00Z date_updated: 2024-09-10T12:23:51Z day: '27' ddc: - '530' department: - _id: JoFi doi: 10.5281/ZENODO.3961561 main_file_link: - open_access: '1' url: https://doi.org/10.5281/zenodo.3961562 month: '07' oa: 1 oa_version: Published Version publisher: Zenodo related_material: record: - id: '8529' relation: used_in_publication status: public status: public title: Converting microwave and telecom photons with a silicon photonic nanomechanical interface 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: research_data_reference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2020' ... --- _id: '13060' abstract: - lang: eng text: Coinfections with multiple pathogens can result in complex within-host dynamics affecting virulence and transmission. Whilst multiple infections are intensively studied in solitary hosts, it is so far unresolved how social host interactions interfere with pathogen competition, and if this depends on coinfection diversity. We studied how the collective disease defenses of ants – their social immunity ­– influence pathogen competition in coinfections of same or different fungal pathogen species. Social immunity reduced virulence for all pathogen combinations, but interfered with spore production only in different-species coinfections. Here, it decreased overall pathogen sporulation success, whilst simultaneously increasing co-sporulation on individual cadavers and maintaining a higher pathogen diversity at the community-level. Mathematical modeling revealed that host sanitary care alone can modulate competitive outcomes between pathogens, giving advantage to fast-germinating, thus less grooming-sensitive ones. Host social interactions can hence modulate infection dynamics in coinfected group members, thereby altering pathogen communities at the host- and population-level. article_processing_charge: No author: - first_name: Barbara full_name: Milutinovic, Barbara id: 2CDC32B8-F248-11E8-B48F-1D18A9856A87 last_name: Milutinovic orcid: 0000-0002-8214-4758 - first_name: Miriam full_name: Stock, Miriam id: 42462816-F248-11E8-B48F-1D18A9856A87 last_name: Stock - first_name: Anna V full_name: Grasse, Anna V id: 406F989C-F248-11E8-B48F-1D18A9856A87 last_name: Grasse - first_name: Elisabeth full_name: Naderlinger, Elisabeth id: 31757262-F248-11E8-B48F-1D18A9856A87 last_name: Naderlinger - first_name: Christian full_name: Hilbe, Christian id: 2FDF8F3C-F248-11E8-B48F-1D18A9856A87 last_name: Hilbe orcid: 0000-0001-5116-955X - first_name: Sylvia full_name: Cremer, Sylvia id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87 last_name: Cremer orcid: 0000-0002-2193-3868 citation: ama: Milutinovic B, Stock M, Grasse AV, Naderlinger E, Hilbe C, Cremer S. Social immunity modulates competition between coinfecting pathogens. 2020. doi:10.5061/DRYAD.CRJDFN318 apa: Milutinovic, B., Stock, M., Grasse, A. V., Naderlinger, E., Hilbe, C., & Cremer, S. (2020). Social immunity modulates competition between coinfecting pathogens. Dryad. https://doi.org/10.5061/DRYAD.CRJDFN318 chicago: Milutinovic, Barbara, Miriam Stock, Anna V Grasse, Elisabeth Naderlinger, Christian Hilbe, and Sylvia Cremer. “Social Immunity Modulates Competition between Coinfecting Pathogens.” Dryad, 2020. https://doi.org/10.5061/DRYAD.CRJDFN318. ieee: B. Milutinovic, M. Stock, A. V. Grasse, E. Naderlinger, C. Hilbe, and S. Cremer, “Social immunity modulates competition between coinfecting pathogens.” Dryad, 2020. ista: Milutinovic B, Stock M, Grasse AV, Naderlinger E, Hilbe C, Cremer S. 2020. Social immunity modulates competition between coinfecting pathogens, Dryad, 10.5061/DRYAD.CRJDFN318. mla: Milutinovic, Barbara, et al. Social Immunity Modulates Competition between Coinfecting Pathogens. Dryad, 2020, doi:10.5061/DRYAD.CRJDFN318. short: B. Milutinovic, M. Stock, A.V. Grasse, E. Naderlinger, C. Hilbe, S. Cremer, (2020). date_created: 2023-05-23T16:11:22Z date_published: 2020-12-19T00:00:00Z date_updated: 2023-09-05T16:04:48Z day: '19' ddc: - '570' department: - _id: SyCr - _id: KrCh doi: 10.5061/DRYAD.CRJDFN318 main_file_link: - open_access: '1' url: https://doi.org/10.5061/dryad.crjdfn318 month: '12' oa: 1 oa_version: Published Version publisher: Dryad related_material: record: - id: '7343' relation: used_in_publication status: public status: public title: Social immunity modulates competition between coinfecting pathogens 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_reference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2020' ... --- _id: '13065' abstract: - lang: eng text: Domestication is a human-induced selection process that imprints the genomes of domesticated populations over a short evolutionary time scale, and that occurs in a given demographic context. Reconstructing historical gene flow, effective population size changes and their timing is therefore of fundamental interest to understand how plant demography and human selection jointly shape genomic divergence during domestication. Yet, the comparison under a single statistical framework of independent domestication histories across different crop species has been little evaluated so far. Thus, it is unclear whether domestication leads to convergent demographic changes that similarly affect crop genomes. To address this question, we used existing and new transcriptome data on three crop species of Solanaceae (eggplant, pepper and tomato), together with their close wild relatives. We fitted twelve demographic models of increasing complexity on the unfolded joint allele frequency spectrum for each wild/crop pair, and we found evidence for both shared and species-specific demographic processes between species. A convergent history of domestication with gene-flow was inferred for all three species, along with evidence of strong reduction in the effective population size during the cultivation stage of tomato and pepper. The absence of any reduction in size of the crop in eggplant stands out from the classical view of the domestication process; as does the existence of a “protracted period” of management before cultivation. Our results also suggest divergent management strategies of modern cultivars among species as their current demography substantially differs. Finally, the timing of domestication is species-specific and supported by the few historical records available. article_processing_charge: No author: - first_name: Stephanie full_name: Arnoux, Stephanie last_name: Arnoux - first_name: Christelle full_name: Fraisse, Christelle id: 32DF5794-F248-11E8-B48F-1D18A9856A87 last_name: Fraisse orcid: 0000-0001-8441-5075 - first_name: Christopher full_name: Sauvage, Christopher last_name: Sauvage citation: ama: 'Arnoux S, Fraisse C, Sauvage C. VCF files of synonymous SNPs related to: Genomic inference of complex domestication histories in three Solanaceae species. 2020. doi:10.5061/DRYAD.Q2BVQ83HD' apa: 'Arnoux, S., Fraisse, C., & Sauvage, C. (2020). VCF files of synonymous SNPs related to: Genomic inference of complex domestication histories in three Solanaceae species. Dryad. https://doi.org/10.5061/DRYAD.Q2BVQ83HD' chicago: 'Arnoux, Stephanie, Christelle Fraisse, and Christopher Sauvage. “VCF Files of Synonymous SNPs Related to: Genomic Inference of Complex Domestication Histories in Three Solanaceae Species.” Dryad, 2020. https://doi.org/10.5061/DRYAD.Q2BVQ83HD.' ieee: 'S. Arnoux, C. Fraisse, and C. Sauvage, “VCF files of synonymous SNPs related to: Genomic inference of complex domestication histories in three Solanaceae species.” Dryad, 2020.' ista: 'Arnoux S, Fraisse C, Sauvage C. 2020. VCF files of synonymous SNPs related to: Genomic inference of complex domestication histories in three Solanaceae species, Dryad, 10.5061/DRYAD.Q2BVQ83HD.' mla: 'Arnoux, Stephanie, et al. VCF Files of Synonymous SNPs Related to: Genomic Inference of Complex Domestication Histories in Three Solanaceae Species. Dryad, 2020, doi:10.5061/DRYAD.Q2BVQ83HD.' short: S. Arnoux, C. Fraisse, C. Sauvage, (2020). date_created: 2023-05-23T16:30:20Z date_published: 2020-10-19T00:00:00Z date_updated: 2023-08-04T11:19:26Z day: '19' ddc: - '570' department: - _id: NiBa doi: 10.5061/DRYAD.Q2BVQ83HD main_file_link: - open_access: '1' url: https://doi.org/10.5061/dryad.q2bvq83hd month: '10' oa: 1 oa_version: Published Version publisher: Dryad related_material: link: - relation: software url: https://github.com/starnoux/arnoux_et_al_2019 record: - id: '8928' relation: used_in_publication status: public status: public title: 'VCF files of synonymous SNPs related to: Genomic inference of complex domestication histories in three Solanaceae species' 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_reference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2020' ... --- _id: '13070' abstract: - lang: eng text: This dataset comprises all data shown in the figures of the submitted article "Surpassing the resistance quantum with a geometric superinductor". Additional raw data are available from the corresponding author on reasonable request. article_processing_charge: No author: - first_name: Matilda full_name: Peruzzo, Matilda id: 3F920B30-F248-11E8-B48F-1D18A9856A87 last_name: Peruzzo orcid: 0000-0002-3415-4628 - first_name: Andrea full_name: Trioni, Andrea id: 42F71B44-F248-11E8-B48F-1D18A9856A87 last_name: Trioni - first_name: Farid full_name: Hassani, Farid id: 2AED110C-F248-11E8-B48F-1D18A9856A87 last_name: Hassani orcid: 0000-0001-6937-5773 - first_name: Martin full_name: Zemlicka, Martin id: 2DCF8DE6-F248-11E8-B48F-1D18A9856A87 last_name: Zemlicka - first_name: Johannes M full_name: Fink, Johannes M id: 4B591CBA-F248-11E8-B48F-1D18A9856A87 last_name: Fink orcid: 0000-0001-8112-028X citation: ama: Peruzzo M, Trioni A, Hassani F, Zemlicka M, Fink JM. Surpassing the resistance quantum with a geometric superinductor. 2020. doi:10.5281/ZENODO.4052882 apa: Peruzzo, M., Trioni, A., Hassani, F., Zemlicka, M., & Fink, J. M. (2020). Surpassing the resistance quantum with a geometric superinductor. Zenodo. https://doi.org/10.5281/ZENODO.4052882 chicago: Peruzzo, Matilda, Andrea Trioni, Farid Hassani, Martin Zemlicka, and Johannes M Fink. “Surpassing the Resistance Quantum with a Geometric Superinductor.” Zenodo, 2020. https://doi.org/10.5281/ZENODO.4052882. ieee: M. Peruzzo, A. Trioni, F. Hassani, M. Zemlicka, and J. M. Fink, “Surpassing the resistance quantum with a geometric superinductor.” Zenodo, 2020. ista: Peruzzo M, Trioni A, Hassani F, Zemlicka M, Fink JM. 2020. Surpassing the resistance quantum with a geometric superinductor, Zenodo, 10.5281/ZENODO.4052882. mla: Peruzzo, Matilda, et al. Surpassing the Resistance Quantum with a Geometric Superinductor. Zenodo, 2020, doi:10.5281/ZENODO.4052882. short: M. Peruzzo, A. Trioni, F. Hassani, M. Zemlicka, J.M. Fink, (2020). date_created: 2023-05-23T16:42:30Z date_published: 2020-09-27T00:00:00Z date_updated: 2024-09-10T12:23:56Z day: '27' ddc: - '530' department: - _id: JoFi doi: 10.5281/ZENODO.4052882 main_file_link: - open_access: '1' url: https://doi.org/10.5281/zenodo.4052883 month: '09' oa: 1 oa_version: Published Version publisher: Zenodo related_material: record: - id: '8755' relation: used_in_publication status: public status: public title: Surpassing the resistance quantum with a geometric superinductor 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: research_data_reference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2020' ... --- _id: '13071' abstract: - lang: eng text: This dataset comprises all data shown in the plots of the main part of the submitted article "Bidirectional Electro-Optic Wavelength Conversion in the Quantum Ground State". Additional raw data are available from the corresponding author on reasonable request. article_processing_charge: No author: - first_name: William J full_name: Hease, William J id: 29705398-F248-11E8-B48F-1D18A9856A87 last_name: Hease orcid: 0000-0001-9868-2166 - 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: Rishabh full_name: Sahu, Rishabh id: 47D26E34-F248-11E8-B48F-1D18A9856A87 last_name: Sahu orcid: 0000-0001-6264-2162 - first_name: Matthias full_name: Wulf, Matthias id: 45598606-F248-11E8-B48F-1D18A9856A87 last_name: Wulf orcid: 0000-0001-6613-1378 - first_name: Georg M full_name: Arnold, Georg M id: 3770C838-F248-11E8-B48F-1D18A9856A87 last_name: Arnold orcid: 0000-0003-1397-7876 - first_name: Harald full_name: Schwefel, Harald last_name: Schwefel - first_name: Johannes M full_name: Fink, Johannes M id: 4B591CBA-F248-11E8-B48F-1D18A9856A87 last_name: Fink orcid: 0000-0001-8112-028X citation: ama: Hease WJ, Rueda Sanchez AR, Sahu R, et al. Bidirectional electro-optic wavelength conversion in the quantum ground state. 2020. doi:10.5281/ZENODO.4266025 apa: Hease, W. J., Rueda Sanchez, A. R., Sahu, R., Wulf, M., Arnold, G. M., Schwefel, H., & Fink, J. M. (2020). Bidirectional electro-optic wavelength conversion in the quantum ground state. Zenodo. https://doi.org/10.5281/ZENODO.4266025 chicago: Hease, William J, Alfredo R Rueda Sanchez, Rishabh Sahu, Matthias Wulf, Georg M Arnold, Harald Schwefel, and Johannes M Fink. “Bidirectional Electro-Optic Wavelength Conversion in the Quantum Ground State.” Zenodo, 2020. https://doi.org/10.5281/ZENODO.4266025. ieee: W. J. Hease et al., “Bidirectional electro-optic wavelength conversion in the quantum ground state.” Zenodo, 2020. ista: Hease WJ, Rueda Sanchez AR, Sahu R, Wulf M, Arnold GM, Schwefel H, Fink JM. 2020. Bidirectional electro-optic wavelength conversion in the quantum ground state, Zenodo, 10.5281/ZENODO.4266025. mla: Hease, William J., et al. Bidirectional Electro-Optic Wavelength Conversion in the Quantum Ground State. Zenodo, 2020, doi:10.5281/ZENODO.4266025. short: W.J. Hease, A.R. Rueda Sanchez, R. Sahu, M. Wulf, G.M. Arnold, H. Schwefel, J.M. Fink, (2020). date_created: 2023-05-23T16:44:11Z date_published: 2020-11-10T00:00:00Z date_updated: 2024-09-10T12:23:54Z day: '10' ddc: - '530' department: - _id: JoFi doi: 10.5281/ZENODO.4266025 main_file_link: - open_access: '1' url: https://doi.org/10.5281/zenodo.4266026 month: '11' oa: 1 oa_version: Published Version publisher: Zenodo related_material: record: - id: '9114' relation: used_in_publication status: public status: public title: Bidirectional electro-optic wavelength conversion in the quantum ground state 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: research_data_reference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2020' ... --- _id: '13073' abstract: - lang: eng text: The Mytilus complex of marine mussel species forms a mosaic of hybrid zones, found across temperate regions of the globe. This allows us to study "replicated" instances of secondary contact between closely-related species. Previous work on this complex has shown that local introgression is both widespread and highly heterogeneous, and has identified SNPs that are outliers of differentiation between lineages. Here, we developed an ancestry-informative panel of such SNPs. We then compared their frequencies in newly-sampled populations, including samples from within the hybrid zones, and parental populations at different distances from the contact. Results show that close to the hybrid zones, some outlier loci are near to fixation for the heterospecific allele, suggesting enhanced local introgression, or the local sweep of a shared ancestral allele. Conversely, genomic cline analyses, treating local parental populations as the reference, reveal a globally high concordance among loci, albeit with a few signals of asymmetric introgression. Enhanced local introgression at specific loci is consistent with the early transfer of adaptive variants after contact, possibly including asymmetric bi-stable variants (Dobzhansky-Muller incompatibilities), or haplotypes loaded with fewer deleterious mutations. Having escaped one barrier, however, these variants can be trapped or delayed at the next barrier, confining the introgression locally. These results shed light on the decay of species barriers during phases of contact. article_processing_charge: No author: - first_name: Alexis full_name: Simon, Alexis last_name: Simon - first_name: Christelle full_name: Fraisse, Christelle id: 32DF5794-F248-11E8-B48F-1D18A9856A87 last_name: Fraisse orcid: 0000-0001-8441-5075 - first_name: Tahani full_name: El Ayari, Tahani last_name: El Ayari - first_name: Cathy full_name: Liautard-Haag, Cathy last_name: Liautard-Haag - first_name: Petr full_name: Strelkov, Petr last_name: Strelkov - first_name: John full_name: Welch, John last_name: Welch - first_name: Nicolas full_name: Bierne, Nicolas last_name: Bierne citation: ama: Simon A, Fraisse C, El Ayari T, et al. How do species barriers decay? concordance and local introgression in mosaic hybrid zones of mussels. 2020. doi:10.5061/DRYAD.R4XGXD29N apa: Simon, A., Fraisse, C., El Ayari, T., Liautard-Haag, C., Strelkov, P., Welch, J., & Bierne, N. (2020). How do species barriers decay? concordance and local introgression in mosaic hybrid zones of mussels. Dryad. https://doi.org/10.5061/DRYAD.R4XGXD29N chicago: Simon, Alexis, Christelle Fraisse, Tahani El Ayari, Cathy Liautard-Haag, Petr Strelkov, John Welch, and Nicolas Bierne. “How Do Species Barriers Decay? Concordance and Local Introgression in Mosaic Hybrid Zones of Mussels.” Dryad, 2020. https://doi.org/10.5061/DRYAD.R4XGXD29N. ieee: A. Simon et al., “How do species barriers decay? concordance and local introgression in mosaic hybrid zones of mussels.” Dryad, 2020. ista: Simon A, Fraisse C, El Ayari T, Liautard-Haag C, Strelkov P, Welch J, Bierne N. 2020. How do species barriers decay? concordance and local introgression in mosaic hybrid zones of mussels, Dryad, 10.5061/DRYAD.R4XGXD29N. mla: Simon, Alexis, et al. How Do Species Barriers Decay? Concordance and Local Introgression in Mosaic Hybrid Zones of Mussels. Dryad, 2020, doi:10.5061/DRYAD.R4XGXD29N. short: A. Simon, C. Fraisse, T. El Ayari, C. Liautard-Haag, P. Strelkov, J. Welch, N. Bierne, (2020). date_created: 2023-05-23T16:48:27Z date_published: 2020-09-22T00:00:00Z date_updated: 2023-08-04T11:04:11Z day: '22' ddc: - '570' department: - _id: NiBa doi: 10.5061/DRYAD.R4XGXD29N main_file_link: - open_access: '1' url: https://doi.org/10.5061/dryad.r4xgxd29n month: '09' oa: 1 oa_version: Published Version publisher: Dryad related_material: record: - id: '8708' relation: used_in_publication status: public status: public title: How do species barriers decay? concordance and local introgression in mosaic hybrid zones of mussels 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_reference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2020' ... --- _id: '14125' abstract: - lang: eng text: "Motivation: Recent technological advances have led to an increase in the production and availability of single-cell data. The ability to integrate a set of multi-technology measurements would allow the identification of biologically or clinically meaningful observations through the unification of the perspectives afforded by each technology. In most cases, however, profiling technologies consume the used cells and thus pairwise correspondences between datasets are lost. Due to the sheer size single-cell datasets can acquire, scalable algorithms that are able to universally match single-cell measurements carried out in one cell to its corresponding sibling in another technology are needed.\r\nResults: We propose Single-Cell data Integration via Matching (SCIM), a scalable approach to recover such correspondences in two or more technologies. SCIM assumes that cells share a common (low-dimensional) underlying structure and that the underlying cell distribution is approximately constant across technologies. It constructs a technology-invariant latent space using an autoencoder framework with an adversarial objective. Multi-modal datasets are integrated by pairing cells across technologies using a bipartite matching scheme that operates on the low-dimensional latent representations. We evaluate SCIM on a simulated cellular branching process and show that the cell-to-cell matches derived by SCIM reflect the same pseudotime on the simulated dataset. Moreover, we apply our method to two real-world scenarios, a melanoma tumor sample and a human bone marrow sample, where we pair cells from a scRNA dataset to their sibling cells in a CyTOF dataset achieving 90% and 78% cell-matching accuracy for each one of the samples, respectively." article_processing_charge: No article_type: original author: - first_name: Stefan G full_name: Stark, Stefan G last_name: Stark - first_name: Joanna full_name: Ficek, Joanna last_name: Ficek - first_name: Francesco full_name: Locatello, Francesco id: 26cfd52f-2483-11ee-8040-88983bcc06d4 last_name: Locatello orcid: 0000-0002-4850-0683 - first_name: Ximena full_name: Bonilla, Ximena last_name: Bonilla - first_name: Stéphane full_name: Chevrier, Stéphane last_name: Chevrier - first_name: Franziska full_name: Singer, Franziska last_name: Singer - first_name: Rudolf full_name: Aebersold, Rudolf last_name: Aebersold - first_name: Faisal S full_name: Al-Quaddoomi, Faisal S last_name: Al-Quaddoomi - first_name: Jonas full_name: Albinus, Jonas last_name: Albinus - first_name: Ilaria full_name: Alborelli, Ilaria last_name: Alborelli - first_name: Sonali full_name: Andani, Sonali last_name: Andani - first_name: Per-Olof full_name: Attinger, Per-Olof last_name: Attinger - first_name: Marina full_name: Bacac, Marina last_name: Bacac - first_name: Daniel full_name: Baumhoer, Daniel last_name: Baumhoer - first_name: Beatrice full_name: Beck-Schimmer, Beatrice last_name: Beck-Schimmer - first_name: Niko full_name: Beerenwinkel, Niko last_name: Beerenwinkel - first_name: Christian full_name: Beisel, Christian last_name: Beisel - first_name: Lara full_name: Bernasconi, Lara last_name: Bernasconi - first_name: Anne full_name: Bertolini, Anne last_name: Bertolini - first_name: Bernd full_name: Bodenmiller, Bernd last_name: Bodenmiller - first_name: Ximena full_name: Bonilla, Ximena last_name: Bonilla - first_name: Ruben full_name: Casanova, Ruben last_name: Casanova - first_name: Stéphane full_name: Chevrier, Stéphane last_name: Chevrier - first_name: Natalia full_name: Chicherova, Natalia last_name: Chicherova - first_name: Maya full_name: D'Costa, Maya last_name: D'Costa - first_name: Esther full_name: Danenberg, Esther last_name: Danenberg - first_name: Natalie full_name: Davidson, Natalie last_name: Davidson - first_name: Monica-Andreea Dră full_name: gan, Monica-Andreea Dră last_name: gan - first_name: Reinhard full_name: Dummer, Reinhard last_name: Dummer - first_name: Stefanie full_name: Engler, Stefanie last_name: Engler - first_name: Martin full_name: Erkens, Martin last_name: Erkens - first_name: Katja full_name: Eschbach, Katja last_name: Eschbach - first_name: Cinzia full_name: Esposito, Cinzia last_name: Esposito - first_name: André full_name: Fedier, André last_name: Fedier - first_name: Pedro full_name: Ferreira, Pedro last_name: Ferreira - first_name: Joanna full_name: Ficek, Joanna last_name: Ficek - first_name: Anja L full_name: Frei, Anja L last_name: Frei - first_name: Bruno full_name: Frey, Bruno last_name: Frey - first_name: Sandra full_name: Goetze, Sandra last_name: Goetze - first_name: Linda full_name: Grob, Linda last_name: Grob - first_name: Gabriele full_name: Gut, Gabriele last_name: Gut - first_name: Detlef full_name: Günther, Detlef last_name: Günther - first_name: Martina full_name: Haberecker, Martina last_name: Haberecker - first_name: Pirmin full_name: Haeuptle, Pirmin last_name: Haeuptle - first_name: Viola full_name: Heinzelmann-Schwarz, Viola last_name: Heinzelmann-Schwarz - first_name: Sylvia full_name: Herter, Sylvia last_name: Herter - first_name: Rene full_name: Holtackers, Rene last_name: Holtackers - first_name: Tamara full_name: Huesser, Tamara last_name: Huesser - first_name: Anja full_name: Irmisch, Anja last_name: Irmisch - first_name: Francis full_name: Jacob, Francis last_name: Jacob - first_name: Andrea full_name: Jacobs, Andrea last_name: Jacobs - first_name: Tim M full_name: Jaeger, Tim M last_name: Jaeger - first_name: Katharina full_name: Jahn, Katharina last_name: Jahn - first_name: Alva R full_name: James, Alva R last_name: James - first_name: Philip M full_name: Jermann, Philip M last_name: Jermann - first_name: André full_name: Kahles, André last_name: Kahles - first_name: Abdullah full_name: Kahraman, Abdullah last_name: Kahraman - first_name: Viktor H full_name: Koelzer, Viktor H last_name: Koelzer - first_name: Werner full_name: Kuebler, Werner last_name: Kuebler - first_name: Jack full_name: Kuipers, Jack last_name: Kuipers - first_name: Christian P full_name: Kunze, Christian P last_name: Kunze - first_name: Christian full_name: Kurzeder, Christian last_name: Kurzeder - first_name: Kjong-Van full_name: Lehmann, Kjong-Van last_name: Lehmann - first_name: Mitchell full_name: Levesque, Mitchell last_name: Levesque - first_name: Sebastian full_name: Lugert, Sebastian last_name: Lugert - first_name: Gerd full_name: Maass, Gerd last_name: Maass - first_name: Markus full_name: Manz, Markus last_name: Manz - first_name: Philipp full_name: Markolin, Philipp last_name: Markolin - first_name: Julien full_name: Mena, Julien last_name: Mena - first_name: Ulrike full_name: Menzel, Ulrike last_name: Menzel - first_name: Julian M full_name: Metzler, Julian M last_name: Metzler - first_name: Nicola full_name: Miglino, Nicola last_name: Miglino - first_name: Emanuela S full_name: Milani, Emanuela S last_name: Milani - first_name: Holger full_name: Moch, Holger last_name: Moch - first_name: Simone full_name: Muenst, Simone last_name: Muenst - first_name: Riccardo full_name: Murri, Riccardo last_name: Murri - first_name: Charlotte KY full_name: Ng, Charlotte KY last_name: Ng - first_name: Stefan full_name: Nicolet, Stefan last_name: Nicolet - first_name: Marta full_name: Nowak, Marta last_name: Nowak - first_name: Patrick GA full_name: Pedrioli, Patrick GA last_name: Pedrioli - first_name: Lucas full_name: Pelkmans, Lucas last_name: Pelkmans - first_name: Salvatore full_name: Piscuoglio, Salvatore last_name: Piscuoglio - first_name: Michael full_name: Prummer, Michael last_name: Prummer - first_name: Mathilde full_name: Ritter, Mathilde last_name: Ritter - first_name: Christian full_name: Rommel, Christian last_name: Rommel - first_name: María L full_name: Rosano-González, María L last_name: Rosano-González - first_name: Gunnar full_name: Rätsch, Gunnar last_name: Rätsch - first_name: Natascha full_name: Santacroce, Natascha last_name: Santacroce - first_name: Jacobo Sarabia del full_name: Castillo, Jacobo Sarabia del last_name: Castillo - first_name: Ramona full_name: Schlenker, Ramona last_name: Schlenker - first_name: Petra C full_name: Schwalie, Petra C last_name: Schwalie - first_name: Severin full_name: Schwan, Severin last_name: Schwan - first_name: Tobias full_name: Schär, Tobias last_name: Schär - first_name: Gabriela full_name: Senti, Gabriela last_name: Senti - first_name: Franziska full_name: Singer, Franziska last_name: Singer - first_name: Sujana full_name: Sivapatham, Sujana last_name: Sivapatham - first_name: Berend full_name: Snijder, Berend last_name: Snijder - first_name: Bettina full_name: Sobottka, Bettina last_name: Sobottka - first_name: Vipin T full_name: Sreedharan, Vipin T last_name: Sreedharan - first_name: Stefan full_name: Stark, Stefan last_name: Stark - first_name: Daniel J full_name: Stekhoven, Daniel J last_name: Stekhoven - first_name: Alexandre PA full_name: Theocharides, Alexandre PA last_name: Theocharides - first_name: Tinu M full_name: Thomas, Tinu M last_name: Thomas - first_name: Markus full_name: Tolnay, Markus last_name: Tolnay - first_name: Vinko full_name: Tosevski, Vinko last_name: Tosevski - first_name: Nora C full_name: Toussaint, Nora C last_name: Toussaint - first_name: Mustafa A full_name: Tuncel, Mustafa A last_name: Tuncel - first_name: Marina full_name: Tusup, Marina last_name: Tusup - first_name: Audrey Van full_name: Drogen, Audrey Van last_name: Drogen - first_name: Marcus full_name: Vetter, Marcus last_name: Vetter - first_name: Tatjana full_name: Vlajnic, Tatjana last_name: Vlajnic - first_name: Sandra full_name: Weber, Sandra last_name: Weber - first_name: Walter P full_name: Weber, Walter P last_name: Weber - first_name: Rebekka full_name: Wegmann, Rebekka last_name: Wegmann - first_name: Michael full_name: Weller, Michael last_name: Weller - first_name: Fabian full_name: Wendt, Fabian last_name: Wendt - first_name: Norbert full_name: Wey, Norbert last_name: Wey - first_name: Andreas full_name: Wicki, Andreas last_name: Wicki - first_name: Bernd full_name: Wollscheid, Bernd last_name: Wollscheid - first_name: Shuqing full_name: Yu, Shuqing last_name: Yu - first_name: Johanna full_name: Ziegler, Johanna last_name: Ziegler - first_name: Marc full_name: Zimmermann, Marc last_name: Zimmermann - first_name: Martin full_name: Zoche, Martin last_name: Zoche - first_name: Gregor full_name: Zuend, Gregor last_name: Zuend - first_name: Gunnar full_name: Rätsch, Gunnar last_name: Rätsch - first_name: Kjong-Van full_name: Lehmann, Kjong-Van last_name: Lehmann citation: ama: 'Stark SG, Ficek J, Locatello F, et al. SCIM: Universal single-cell matching with unpaired feature sets. Bioinformatics. 2020;36(Supplement_2):i919-i927. doi:10.1093/bioinformatics/btaa843' apa: 'Stark, S. G., Ficek, J., Locatello, F., Bonilla, X., Chevrier, S., Singer, F., … Lehmann, K.-V. (2020). SCIM: Universal single-cell matching with unpaired feature sets. Bioinformatics. Oxford University Press. https://doi.org/10.1093/bioinformatics/btaa843' chicago: 'Stark, Stefan G, Joanna Ficek, Francesco Locatello, Ximena Bonilla, Stéphane Chevrier, Franziska Singer, Rudolf Aebersold, et al. “SCIM: Universal Single-Cell Matching with Unpaired Feature Sets.” Bioinformatics. Oxford University Press, 2020. https://doi.org/10.1093/bioinformatics/btaa843.' ieee: 'S. G. Stark et al., “SCIM: Universal single-cell matching with unpaired feature sets,” Bioinformatics, vol. 36, no. Supplement_2. Oxford University Press, pp. i919–i927, 2020.' ista: 'Stark SG et al. 2020. SCIM: Universal single-cell matching with unpaired feature sets. Bioinformatics. 36(Supplement_2), i919–i927.' mla: 'Stark, Stefan G., et al. “SCIM: Universal Single-Cell Matching with Unpaired Feature Sets.” Bioinformatics, vol. 36, no. Supplement_2, Oxford University Press, 2020, pp. i919–27, doi:10.1093/bioinformatics/btaa843.' short: S.G. Stark, J. Ficek, F. Locatello, X. Bonilla, S. Chevrier, F. Singer, R. Aebersold, F.S. Al-Quaddoomi, J. Albinus, I. Alborelli, S. Andani, P.-O. Attinger, M. Bacac, D. Baumhoer, B. Beck-Schimmer, N. Beerenwinkel, C. Beisel, L. Bernasconi, A. Bertolini, B. Bodenmiller, X. Bonilla, R. Casanova, S. Chevrier, N. Chicherova, M. D’Costa, E. Danenberg, N. Davidson, M.-A.D. gan, R. Dummer, S. Engler, M. Erkens, K. Eschbach, C. Esposito, A. Fedier, P. Ferreira, J. Ficek, A.L. Frei, B. Frey, S. Goetze, L. Grob, G. Gut, D. Günther, M. Haberecker, P. Haeuptle, V. Heinzelmann-Schwarz, S. Herter, R. Holtackers, T. Huesser, A. Irmisch, F. Jacob, A. Jacobs, T.M. Jaeger, K. Jahn, A.R. James, P.M. Jermann, A. Kahles, A. Kahraman, V.H. Koelzer, W. Kuebler, J. Kuipers, C.P. Kunze, C. Kurzeder, K.-V. Lehmann, M. Levesque, S. Lugert, G. Maass, M. Manz, P. Markolin, J. Mena, U. Menzel, J.M. Metzler, N. Miglino, E.S. Milani, H. Moch, S. Muenst, R. Murri, C.K. Ng, S. Nicolet, M. Nowak, P.G. Pedrioli, L. Pelkmans, S. Piscuoglio, M. Prummer, M. Ritter, C. Rommel, M.L. Rosano-González, G. Rätsch, N. Santacroce, J.S. del Castillo, R. Schlenker, P.C. Schwalie, S. Schwan, T. Schär, G. Senti, F. Singer, S. Sivapatham, B. Snijder, B. Sobottka, V.T. Sreedharan, S. Stark, D.J. Stekhoven, A.P. Theocharides, T.M. Thomas, M. Tolnay, V. Tosevski, N.C. Toussaint, M.A. Tuncel, M. Tusup, A.V. Drogen, M. Vetter, T. Vlajnic, S. Weber, W.P. Weber, R. Wegmann, M. Weller, F. Wendt, N. Wey, A. Wicki, B. Wollscheid, S. Yu, J. Ziegler, M. Zimmermann, M. Zoche, G. Zuend, G. Rätsch, K.-V. Lehmann, Bioinformatics 36 (2020) i919–i927. date_created: 2023-08-21T12:28:20Z date_published: 2020-12-01T00:00:00Z date_updated: 2023-09-11T10:21:00Z day: '01' department: - _id: FrLo doi: 10.1093/bioinformatics/btaa843 extern: '1' external_id: pmid: - '33381818' intvolume: ' 36' issue: Supplement_2 keyword: - Computational Mathematics - Computational Theory and Mathematics - Computer Science Applications - Molecular Biology - Biochemistry - Statistics and Probability language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1093/bioinformatics/btaa843 month: '12' oa: 1 oa_version: Published Version page: i919-i927 pmid: 1 publication: Bioinformatics publication_identifier: eissn: - 1367-4811 publication_status: published publisher: Oxford University Press quality_controlled: '1' related_material: link: - relation: software url: https://github.com/ratschlab/scim scopus_import: '1' status: public title: 'SCIM: Universal single-cell matching with unpaired feature sets' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 36 year: '2020' ... --- _id: '14186' abstract: - lang: eng text: "The goal of the unsupervised learning of disentangled representations is to\r\nseparate the independent explanatory factors of variation in the data without\r\naccess to supervision. In this paper, we summarize the results of Locatello et\r\nal., 2019, and focus on their implications for practitioners. We discuss the\r\ntheoretical result showing that the unsupervised learning of disentangled\r\nrepresentations is fundamentally impossible without inductive biases and the\r\npractical challenges it entails. Finally, we comment on our experimental\r\nfindings, highlighting the limitations of state-of-the-art approaches and\r\ndirections for future research." article_processing_charge: No arxiv: 1 author: - first_name: Francesco full_name: Locatello, Francesco id: 26cfd52f-2483-11ee-8040-88983bcc06d4 last_name: Locatello orcid: 0000-0002-4850-0683 - first_name: Stefan full_name: Bauer, Stefan last_name: Bauer - first_name: Mario full_name: Lucic, Mario last_name: Lucic - first_name: Gunnar full_name: Rätsch, Gunnar last_name: Rätsch - first_name: Sylvain full_name: Gelly, Sylvain last_name: Gelly - first_name: Bernhard full_name: Schölkopf, Bernhard last_name: Schölkopf - first_name: Olivier full_name: Bachem, Olivier last_name: Bachem citation: ama: 'Locatello F, Bauer S, Lucic M, et al. A commentary on the unsupervised learning of disentangled representations. In: The 34th AAAI Conference on Artificial Intelligence. Vol 34. Association for the Advancement of Artificial Intelligence; 2020:13681-13684. doi:10.1609/aaai.v34i09.7120' apa: 'Locatello, F., Bauer, S., Lucic, M., Rätsch, G., Gelly, S., Schölkopf, B., & Bachem, O. (2020). A commentary on the unsupervised learning of disentangled representations. In The 34th AAAI Conference on Artificial Intelligence (Vol. 34, pp. 13681–13684). New York, NY, United States: Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/aaai.v34i09.7120' chicago: Locatello, Francesco, Stefan Bauer, Mario Lucic, Gunnar Rätsch, Sylvain Gelly, Bernhard Schölkopf, and Olivier Bachem. “A Commentary on the Unsupervised Learning of Disentangled Representations.” In The 34th AAAI Conference on Artificial Intelligence, 34:13681–84. Association for the Advancement of Artificial Intelligence, 2020. https://doi.org/10.1609/aaai.v34i09.7120. ieee: F. Locatello et al., “A commentary on the unsupervised learning of disentangled representations,” in The 34th AAAI Conference on Artificial Intelligence, New York, NY, United States, 2020, vol. 34, no. 9, pp. 13681–13684. ista: 'Locatello F, Bauer S, Lucic M, Rätsch G, Gelly S, Schölkopf B, Bachem O. 2020. A commentary on the unsupervised learning of disentangled representations. The 34th AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 34, 13681–13684.' mla: Locatello, Francesco, et al. “A Commentary on the Unsupervised Learning of Disentangled Representations.” The 34th AAAI Conference on Artificial Intelligence, vol. 34, no. 9, Association for the Advancement of Artificial Intelligence, 2020, pp. 13681–84, doi:10.1609/aaai.v34i09.7120. short: F. Locatello, S. Bauer, M. Lucic, G. Rätsch, S. Gelly, B. Schölkopf, O. Bachem, in:, The 34th AAAI Conference on Artificial Intelligence, Association for the Advancement of Artificial Intelligence, 2020, pp. 13681–13684. 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: 2023-08-22T14:07:26Z date_published: 2020-07-28T00:00:00Z date_updated: 2023-09-12T07:44:48Z day: '28' department: - _id: FrLo doi: 10.1609/aaai.v34i09.7120 extern: '1' external_id: arxiv: - '2007.14184' intvolume: ' 34' issue: '9' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/2007.14184 month: '07' oa: 1 oa_version: Preprint page: 13681-13684 publication: The 34th AAAI Conference on Artificial Intelligence publication_identifier: eissn: - 2374-3468 isbn: - '9781577358350' publication_status: published publisher: Association for the Advancement of Artificial Intelligence quality_controlled: '1' scopus_import: '1' status: public title: A commentary on the unsupervised learning of disentangled representations type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 34 year: '2020' ... --- _id: '14187' abstract: - lang: eng text: "We propose a novel Stochastic Frank-Wolfe (a.k.a. conditional gradient)\r\nalgorithm for constrained smooth finite-sum minimization with a generalized\r\nlinear prediction/structure. This class of problems includes empirical risk\r\nminimization with sparse, low-rank, or other structured constraints. The\r\nproposed method is simple to implement, does not require step-size tuning, and\r\nhas a constant per-iteration cost that is independent of the dataset size.\r\nFurthermore, as a byproduct of the method we obtain a stochastic estimator of\r\nthe Frank-Wolfe gap that can be used as a stopping criterion. Depending on the\r\nsetting, the proposed method matches or improves on the best computational\r\nguarantees for Stochastic Frank-Wolfe algorithms. Benchmarks on several\r\ndatasets highlight different regimes in which the proposed method exhibits a\r\nfaster empirical convergence than related methods. Finally, we provide an\r\nimplementation of all considered methods in an open-source package." alternative_title: - PMLR article_processing_charge: No arxiv: 1 author: - first_name: Geoffrey full_name: Négiar, Geoffrey last_name: Négiar - first_name: Gideon full_name: Dresdner, Gideon last_name: Dresdner - first_name: Alicia full_name: Tsai, Alicia last_name: Tsai - first_name: Laurent El full_name: Ghaoui, Laurent El last_name: Ghaoui - first_name: Francesco full_name: Locatello, Francesco id: 26cfd52f-2483-11ee-8040-88983bcc06d4 last_name: Locatello orcid: 0000-0002-4850-0683 - first_name: Robert M. full_name: Freund, Robert M. last_name: Freund - first_name: Fabian full_name: Pedregosa, Fabian last_name: Pedregosa citation: ama: 'Négiar G, Dresdner G, Tsai A, et al. Stochastic Frank-Wolfe for constrained finite-sum minimization. In: Proceedings of the 37th International Conference on Machine Learning. Vol 119. ; 2020:7253-7262.' apa: Négiar, G., Dresdner, G., Tsai, A., Ghaoui, L. E., Locatello, F., Freund, R. M., & Pedregosa, F. (2020). Stochastic Frank-Wolfe for constrained finite-sum minimization. In Proceedings of the 37th International Conference on Machine Learning (Vol. 119, pp. 7253–7262). Virtual. chicago: Négiar, Geoffrey, Gideon Dresdner, Alicia Tsai, Laurent El Ghaoui, Francesco Locatello, Robert M. Freund, and Fabian Pedregosa. “Stochastic Frank-Wolfe for Constrained Finite-Sum Minimization.” In Proceedings of the 37th International Conference on Machine Learning, 119:7253–62, 2020. ieee: G. Négiar et al., “Stochastic Frank-Wolfe for constrained finite-sum minimization,” in Proceedings of the 37th International Conference on Machine Learning, Virtual, 2020, vol. 119, pp. 7253–7262. ista: Négiar G, Dresdner G, Tsai A, Ghaoui LE, Locatello F, Freund RM, Pedregosa F. 2020. Stochastic Frank-Wolfe for constrained finite-sum minimization. Proceedings of the 37th International Conference on Machine Learning. International Conference on Machine Learning, PMLR, vol. 119, 7253–7262. mla: Négiar, Geoffrey, et al. “Stochastic Frank-Wolfe for Constrained Finite-Sum Minimization.” Proceedings of the 37th International Conference on Machine Learning, vol. 119, 2020, pp. 7253–62. short: G. Négiar, G. Dresdner, A. Tsai, L.E. Ghaoui, F. Locatello, R.M. Freund, F. Pedregosa, in:, Proceedings of the 37th International Conference on Machine Learning, 2020, pp. 7253–7262. conference: end_date: 2020-07-18 location: Virtual name: International Conference on Machine Learning start_date: 2020-07-13 date_created: 2023-08-22T14:07:52Z date_published: 2020-07-27T00:00:00Z date_updated: 2023-09-12T08:03:40Z day: '27' department: - _id: FrLo extern: '1' external_id: arxiv: - '2002.11860' intvolume: ' 119' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/2002.11860 month: '07' oa: 1 oa_version: Preprint page: 7253-7262 publication: Proceedings of the 37th International Conference on Machine Learning publication_status: published quality_controlled: '1' status: public title: Stochastic Frank-Wolfe for constrained finite-sum minimization type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 119 year: '2020' ... --- _id: '14188' abstract: - lang: eng text: "Intelligent agents should be able to learn useful representations by\r\nobserving changes in their environment. We model such observations as pairs of\r\nnon-i.i.d. images sharing at least one of the underlying factors of variation.\r\nFirst, we theoretically show that only knowing how many factors have changed,\r\nbut not which ones, is sufficient to learn disentangled representations.\r\nSecond, we provide practical algorithms that learn disentangled representations\r\nfrom pairs of images without requiring annotation of groups, individual\r\nfactors, or the number of factors that have changed. Third, we perform a\r\nlarge-scale empirical study and show that such pairs of observations are\r\nsufficient to reliably learn disentangled representations on several benchmark\r\ndata sets. Finally, we evaluate our learned representations and find that they\r\nare simultaneously useful on a diverse suite of tasks, including generalization\r\nunder covariate shifts, fairness, and abstract reasoning. Overall, our results\r\ndemonstrate that weak supervision enables learning of useful disentangled\r\nrepresentations in realistic scenarios." alternative_title: - PMLR article_processing_charge: No arxiv: 1 author: - first_name: Francesco full_name: Locatello, Francesco id: 26cfd52f-2483-11ee-8040-88983bcc06d4 last_name: Locatello orcid: 0000-0002-4850-0683 - first_name: Ben full_name: Poole, Ben last_name: Poole - first_name: Gunnar full_name: Rätsch, Gunnar last_name: Rätsch - first_name: Bernhard full_name: Schölkopf, Bernhard last_name: Schölkopf - first_name: Olivier full_name: Bachem, Olivier last_name: Bachem - first_name: Michael full_name: Tschannen, Michael last_name: Tschannen citation: ama: 'Locatello F, Poole B, Rätsch G, Schölkopf B, Bachem O, Tschannen M. Weakly-supervised disentanglement without compromises. In: Proceedings of the 37th International Conference on Machine Learning. Vol 119. ; 2020:6348–6359.' apa: Locatello, F., Poole, B., Rätsch, G., Schölkopf, B., Bachem, O., & Tschannen, M. (2020). Weakly-supervised disentanglement without compromises. In Proceedings of the 37th International Conference on Machine Learning (Vol. 119, pp. 6348–6359). Virtual. chicago: Locatello, Francesco, Ben Poole, Gunnar Rätsch, Bernhard Schölkopf, Olivier Bachem, and Michael Tschannen. “Weakly-Supervised Disentanglement without Compromises.” In Proceedings of the 37th International Conference on Machine Learning, 119:6348–6359, 2020. ieee: F. Locatello, B. Poole, G. Rätsch, B. Schölkopf, O. Bachem, and M. Tschannen, “Weakly-supervised disentanglement without compromises,” in Proceedings of the 37th International Conference on Machine Learning, Virtual, 2020, vol. 119, pp. 6348–6359. ista: Locatello F, Poole B, Rätsch G, Schölkopf B, Bachem O, Tschannen M. 2020. Weakly-supervised disentanglement without compromises. Proceedings of the 37th International Conference on Machine Learning. International Conference on Machine Learning, PMLR, vol. 119, 6348–6359. mla: Locatello, Francesco, et al. “Weakly-Supervised Disentanglement without Compromises.” Proceedings of the 37th International Conference on Machine Learning, vol. 119, 2020, pp. 6348–6359. short: F. Locatello, B. Poole, G. Rätsch, B. Schölkopf, O. Bachem, M. Tschannen, in:, Proceedings of the 37th International Conference on Machine Learning, 2020, pp. 6348–6359. conference: end_date: 2020-07-18 location: Virtual name: International Conference on Machine Learning start_date: 2020-07-13 date_created: 2023-08-22T14:08:14Z date_published: 2020-07-07T00:00:00Z date_updated: 2023-09-12T07:59:29Z day: '07' department: - _id: FrLo extern: '1' external_id: arxiv: - '2002.02886' intvolume: ' 119' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/2002.02886 month: '07' oa: 1 oa_version: Preprint page: 6348–6359 publication: Proceedings of the 37th International Conference on Machine Learning publication_status: published quality_controlled: '1' scopus_import: '1' status: public title: Weakly-supervised disentanglement without compromises type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 119 year: '2020' ... --- _id: '14195' abstract: - lang: eng text: "The idea behind the unsupervised learning of disentangled representations is that real-world data is generated by a few explanatory factors of variation which can be recovered by unsupervised learning algorithms. In this paper, we provide a sober look at recent progress in the field and challenge some common assumptions. We first theoretically show that the unsupervised learning of disentangled representations is fundamentally impossible without inductive biases on both the models and the data. Then, we train over 14000\r\n models covering most prominent methods and evaluation metrics in a reproducible large-scale experimental study on eight data sets. We observe that while the different methods successfully enforce properties “encouraged” by the corresponding losses, well-disentangled models seemingly cannot be identified without supervision. Furthermore, different evaluation metrics do not always agree on what should be considered “disentangled” and exhibit systematic differences in the estimation. Finally, increased disentanglement does not seem to necessarily lead to a decreased sample complexity of learning for downstream tasks. Our results suggest that future work on disentanglement learning should be explicit about the role of inductive biases and (implicit) supervision, investigate concrete benefits of enforcing disentanglement of the learned representations, and consider a reproducible experimental setup covering several data sets." article_number: '209' article_processing_charge: No article_type: original arxiv: 1 author: - first_name: Francesco full_name: Locatello, Francesco id: 26cfd52f-2483-11ee-8040-88983bcc06d4 last_name: Locatello orcid: 0000-0002-4850-0683 - first_name: Stefan full_name: Bauer, Stefan last_name: Bauer - first_name: Mario full_name: Lucic, Mario last_name: Lucic - first_name: Gunnar full_name: Rätsch, Gunnar last_name: Rätsch - first_name: Sylvain full_name: Gelly, Sylvain last_name: Gelly - first_name: Bernhard full_name: Schölkopf, Bernhard last_name: Schölkopf - first_name: Olivier full_name: Bachem, Olivier last_name: Bachem citation: ama: Locatello F, Bauer S, Lucic M, et al. A sober look at the unsupervised learning of disentangled representations and their evaluation. Journal of Machine Learning Research. 2020;21. apa: Locatello, F., Bauer, S., Lucic, M., Rätsch, G., Gelly, S., Schölkopf, B., & Bachem, O. (2020). A sober look at the unsupervised learning of disentangled representations and their evaluation. Journal of Machine Learning Research. MIT Press. chicago: Locatello, Francesco, Stefan Bauer, Mario Lucic, Gunnar Rätsch, Sylvain Gelly, Bernhard Schölkopf, and Olivier Bachem. “A Sober Look at the Unsupervised Learning of Disentangled Representations and Their Evaluation.” Journal of Machine Learning Research. MIT Press, 2020. ieee: F. Locatello et al., “A sober look at the unsupervised learning of disentangled representations and their evaluation,” Journal of Machine Learning Research, vol. 21. MIT Press, 2020. ista: Locatello F, Bauer S, Lucic M, Rätsch G, Gelly S, Schölkopf B, Bachem O. 2020. A sober look at the unsupervised learning of disentangled representations and their evaluation. Journal of Machine Learning Research. 21, 209. mla: Locatello, Francesco, et al. “A Sober Look at the Unsupervised Learning of Disentangled Representations and Their Evaluation.” Journal of Machine Learning Research, vol. 21, 209, MIT Press, 2020. short: F. Locatello, S. Bauer, M. Lucic, G. Rätsch, S. Gelly, B. Schölkopf, O. Bachem, Journal of Machine Learning Research 21 (2020). date_created: 2023-08-22T14:10:34Z date_published: 2020-09-01T00:00:00Z date_updated: 2023-09-12T09:23:56Z day: '01' ddc: - '000' department: - _id: FrLo extern: '1' external_id: arxiv: - '2010.14766' has_accepted_license: '1' intvolume: ' 21' language: - iso: eng main_file_link: - open_access: '1' url: https://jmlr.csail.mit.edu/papers/v21/19-976.html month: '09' oa: 1 oa_version: Published Version publication: Journal of Machine Learning Research publication_status: published publisher: MIT Press quality_controlled: '1' scopus_import: '1' status: public title: A sober look at the unsupervised learning of disentangled representations and their evaluation 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: 21 year: '2020' ... --- _id: '9001' abstract: - lang: eng text: Quantum illumination is a sensing technique that employs entangled signal-idler beams to improve the detection efficiency of low-reflectivity objects in environments with large thermal noise. The advantage over classical strategies is evident at low signal brightness, a feature which could make the protocol an ideal prototype for non-invasive scanning or low-power short-range radar. Here we experimentally investigate the concept of quantum illumination at microwave frequencies, by generating entangled fields using a Josephson parametric converter which are then amplified to illuminate a room-temperature object at a distance of 1 meter. Starting from experimental data, we simulate the case of perfect idler photon number detection, which results in a quantum advantage compared to the relative classical benchmark. Our results highlight the opportunities and challenges on the way towards a first room-temperature application of microwave quantum circuits. acknowledgement: "This work was supported by the Institute of Science and Technology Austria (IST Austria), the European Research Council under grant agreement number 758053 (ERC StG QUNNECT) and the EU’s Horizon 2020 research and innovation programme under grant agreement number 862644 (FET Open QUARTET). S.B. acknowledges support from the Marie Skłodowska Curie\r\nfellowship number 707438 (MSC-IF SUPEREOM), DV acknowledge support from EU’s Horizon 2020 research and innovation programme under grant agreement number 732894 (FET Proactive HOT) and the Project QuaSeRT funded by the QuantERA ERANET Cofund in Quantum Technologies, and J.M.F from the Austrian Science Fund (FWF) through BeyondC (F71), a NOMIS foundation research grant, and the EU’s Horizon 2020 research and\r\ninnovation programme under grant agreement number 732894 (FET Proactive\r\nHOT)." article_number: '9266397' article_processing_charge: No arxiv: 1 author: - first_name: Shabir full_name: Barzanjeh, Shabir id: 2D25E1F6-F248-11E8-B48F-1D18A9856A87 last_name: Barzanjeh orcid: 0000-0003-0415-1423 - first_name: Stefano full_name: Pirandola, Stefano last_name: Pirandola - first_name: David full_name: Vitali, David last_name: Vitali - first_name: Johannes M full_name: Fink, Johannes M id: 4B591CBA-F248-11E8-B48F-1D18A9856A87 last_name: Fink orcid: 0000-0001-8112-028X citation: ama: 'Barzanjeh S, Pirandola S, Vitali D, Fink JM. Microwave quantum illumination with a digital phase-conjugated receiver. In: IEEE National Radar Conference - Proceedings. Vol 2020. IEEE; 2020. doi:10.1109/RadarConf2043947.2020.9266397' apa: 'Barzanjeh, S., Pirandola, S., Vitali, D., & Fink, J. M. (2020). Microwave quantum illumination with a digital phase-conjugated receiver. In IEEE National Radar Conference - Proceedings (Vol. 2020). Florence, Italy: IEEE. https://doi.org/10.1109/RadarConf2043947.2020.9266397' chicago: Barzanjeh, Shabir, Stefano Pirandola, David Vitali, and Johannes M Fink. “Microwave Quantum Illumination with a Digital Phase-Conjugated Receiver.” In IEEE National Radar Conference - Proceedings, Vol. 2020. IEEE, 2020. https://doi.org/10.1109/RadarConf2043947.2020.9266397. ieee: S. Barzanjeh, S. Pirandola, D. Vitali, and J. M. Fink, “Microwave quantum illumination with a digital phase-conjugated receiver,” in IEEE National Radar Conference - Proceedings, Florence, Italy, 2020, vol. 2020, no. 9. ista: 'Barzanjeh S, Pirandola S, Vitali D, Fink JM. 2020. Microwave quantum illumination with a digital phase-conjugated receiver. IEEE National Radar Conference - Proceedings. RadarConf: National Conference on Radar vol. 2020, 9266397.' mla: Barzanjeh, Shabir, et al. “Microwave Quantum Illumination with a Digital Phase-Conjugated Receiver.” IEEE National Radar Conference - Proceedings, vol. 2020, no. 9, 9266397, IEEE, 2020, doi:10.1109/RadarConf2043947.2020.9266397. short: S. Barzanjeh, S. Pirandola, D. Vitali, J.M. Fink, in:, IEEE National Radar Conference - Proceedings, IEEE, 2020. conference: end_date: 2020-09-25 location: Florence, Italy name: 'RadarConf: National Conference on Radar' start_date: 2020-09-21 date_created: 2021-01-10T23:01:17Z date_published: 2020-09-21T00:00:00Z date_updated: 2024-09-10T12:23:52Z day: '21' department: - _id: JoFi doi: 10.1109/RadarConf2043947.2020.9266397 ec_funded: 1 external_id: arxiv: - '1908.03058' isi: - '000612224900089' intvolume: ' 2020' isi: 1 issue: '9' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1908.03058 month: '09' oa: 1 oa_version: Preprint project: - _id: 26336814-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '758053' name: A Fiber Optic Transceiver for Superconducting Qubits - _id: 237CBA6C-32DE-11EA-91FC-C7463DDC885E call_identifier: H2020 grant_number: '862644' name: Quantum readout techniques and technologies - _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 SUPEREOM' - _id: 257EB838-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '732894' name: Hybrid Optomechanical Technologies publication: IEEE National Radar Conference - Proceedings publication_identifier: isbn: - '9781728189420' issn: - 1097-5659 publication_status: published publisher: IEEE quality_controlled: '1' related_material: record: - id: '7910' relation: earlier_version status: public scopus_import: '1' status: public title: Microwave quantum illumination with a digital phase-conjugated receiver type: conference user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 2020 year: '2020' ... --- _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: 2023-08-24T11:11:36Z 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: - '14208946' issn: - '00102571' 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: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 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. date_created: 2021-01-17T23:01:13Z date_published: 2020-12-01T00:00:00Z date_updated: 2023-08-24T13:57:13Z 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. date_created: 2021-01-24T23:01:09Z date_published: 2020-12-15T00:00:00Z date_updated: 2023-08-24T11:15:16Z 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: - '10957154' issn: - '00361410' 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: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 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: 2021-02-09T09:39:59Z 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: The Wittgenstein Prize 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: '9103' abstract: - lang: eng text: 'We introduce LRT-NG, a set of techniques and an associated toolset that computes a reachtube (an over-approximation of the set of reachable states over a given time horizon) of a nonlinear dynamical system. LRT-NG significantly advances the state-of-the-art Langrangian Reachability and its associated tool LRT. From a theoretical perspective, LRT-NG is superior to LRT in three ways. First, it uses for the first time an analytically computed metric for the propagated ball which is proven to minimize the ball’s volume. We emphasize that the metric computation is the centerpiece of all bloating-based techniques. Secondly, it computes the next reachset as the intersection of two balls: one based on the Cartesian metric and the other on the new metric. While the two metrics were previously considered opposing approaches, their joint use considerably tightens the reachtubes. Thirdly, it avoids the "wrapping effect" associated with the validated integration of the center of the reachset, by optimally absorbing the interval approximation in the radius of the next ball. From a tool-development perspective, LRT-NG is superior to LRT in two ways. First, it is a standalone tool that no longer relies on CAPD. This required the implementation of the Lohner method and a Runge-Kutta time-propagation method. Secondly, it has an improved interface, allowing the input model and initial conditions to be provided as external input files. Our experiments on a comprehensive set of benchmarks, including two Neural ODEs, demonstrates LRT-NG’s superior performance compared to LRT, CAPD, and Flow*.' acknowledgement: "The authors would like to thank Ramin Hasani and Guillaume Berger for intellectual discussions about the research which lead to the generation of new ideas. ML was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). Smolka’s research was supported by NSF grants CPS-1446832 and CCF-1918225. Gruenbacher is funded by FWF project W1255-N23. JC was partially supported by NAWA Polish Returns grant\r\nPPN/PPO/2018/1/00029.\r\n" article_processing_charge: No arxiv: 1 author: - first_name: Sophie full_name: Gruenbacher, Sophie last_name: Gruenbacher - first_name: Jacek full_name: Cyranka, Jacek last_name: Cyranka - first_name: Mathias full_name: Lechner, Mathias id: 3DC22916-F248-11E8-B48F-1D18A9856A87 last_name: Lechner - first_name: Md Ariful full_name: Islam, Md Ariful last_name: Islam - first_name: Scott A. full_name: Smolka, Scott A. last_name: Smolka - first_name: Radu full_name: Grosu, Radu last_name: Grosu citation: ama: 'Gruenbacher S, Cyranka J, Lechner M, Islam MA, Smolka SA, Grosu R. Lagrangian reachtubes: The next generation. In: Proceedings of the 59th IEEE Conference on Decision and Control. Vol 2020. IEEE; 2020:1556-1563. doi:10.1109/CDC42340.2020.9304042' apa: 'Gruenbacher, S., Cyranka, J., Lechner, M., Islam, M. A., Smolka, S. A., & Grosu, R. (2020). Lagrangian reachtubes: The next generation. In Proceedings of the 59th IEEE Conference on Decision and Control (Vol. 2020, pp. 1556–1563). Jeju Islang, Korea (South): IEEE. https://doi.org/10.1109/CDC42340.2020.9304042' chicago: 'Gruenbacher, Sophie, Jacek Cyranka, Mathias Lechner, Md Ariful Islam, Scott A. Smolka, and Radu Grosu. “Lagrangian Reachtubes: The next Generation.” In Proceedings of the 59th IEEE Conference on Decision and Control, 2020:1556–63. IEEE, 2020. https://doi.org/10.1109/CDC42340.2020.9304042.' ieee: 'S. Gruenbacher, J. Cyranka, M. Lechner, M. A. Islam, S. A. Smolka, and R. Grosu, “Lagrangian reachtubes: The next generation,” in Proceedings of the 59th IEEE Conference on Decision and Control, Jeju Islang, Korea (South), 2020, vol. 2020, pp. 1556–1563.' ista: 'Gruenbacher S, Cyranka J, Lechner M, Islam MA, Smolka SA, Grosu R. 2020. Lagrangian reachtubes: The next generation. Proceedings of the 59th IEEE Conference on Decision and Control. CDC: Conference on Decision and Control vol. 2020, 1556–1563.' mla: 'Gruenbacher, Sophie, et al. “Lagrangian Reachtubes: The next Generation.” Proceedings of the 59th IEEE Conference on Decision and Control, vol. 2020, IEEE, 2020, pp. 1556–63, doi:10.1109/CDC42340.2020.9304042.' short: S. Gruenbacher, J. Cyranka, M. Lechner, M.A. Islam, S.A. Smolka, R. Grosu, in:, Proceedings of the 59th IEEE Conference on Decision and Control, IEEE, 2020, pp. 1556–1563. conference: end_date: 2020-12-18 location: Jeju Islang, Korea (South) name: 'CDC: Conference on Decision and Control' start_date: 2020-12-14 date_created: 2021-02-07T23:01:14Z date_published: 2020-12-14T00:00:00Z date_updated: 2021-02-09T09:20:58Z day: '14' department: - _id: ToHe doi: 10.1109/CDC42340.2020.9304042 external_id: arxiv: - '2012.07458' intvolume: ' 2020' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/2012.07458 month: '12' oa: 1 oa_version: Preprint page: 1556-1563 project: - _id: 25F42A32-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z211 name: The Wittgenstein Prize publication: Proceedings of the 59th IEEE Conference on Decision and Control publication_identifier: isbn: - '9781728174471' issn: - '07431546' publication_status: published publisher: IEEE quality_controlled: '1' scopus_import: '1' status: public title: 'Lagrangian reachtubes: The next generation' type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 2020 year: '2020' ...