[{"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","publisher":"Springer Nature","date_created":"2022-01-09T23:01:27Z","doi":"10.1007/978-3-030-92075-3_12","abstract":[{"lang":"eng","text":"We study Multi-party computation (MPC) in the setting of subversion, where the adversary tampers with the machines of honest parties. Our goal is to construct actively secure MPC protocols where parties are corrupted adaptively by an adversary (as in the standard adaptive security setting), and in addition, honest parties’ machines are compromised.\r\nThe idea of reverse firewalls (RF) was introduced at EUROCRYPT’15 by Mironov and Stephens-Davidowitz as an approach to protecting protocols against corruption of honest parties’ devices. Intuitively, an RF for a party   P  is an external entity that sits between   P  and the outside world and whose scope is to sanitize   P ’s incoming and outgoing messages in the face of subversion of their computer. Mironov and Stephens-Davidowitz constructed a protocol for passively-secure two-party computation. At CRYPTO’20, Chakraborty, Dziembowski and Nielsen constructed a protocol for secure computation with firewalls that improved on this result, both by extending it to multi-party computation protocol, and considering active security in the presence of static corruptions. In this paper, we initiate the study of RF for MPC in the adaptive setting. We put forward a definition for adaptively secure MPC in the reverse firewall setting, explore relationships among the security notions, and then construct reverse firewalls for MPC in this stronger setting of adaptive security. We also resolve the open question of Chakraborty, Dziembowski and Nielsen by removing the need for a trusted setup in constructing RF for MPC. Towards this end, we construct reverse firewalls for adaptively secure augmented coin tossing and adaptively secure zero-knowledge protocols and obtain a constant round adaptively secure MPC protocol in the reverse firewall setting without setup. Along the way, we propose a new multi-party adaptively secure coin tossing protocol in the plain model, that is of independent interest."}],"publication":"27th International Conference on the Theory and Application of Cryptology and Information Security","publication_status":"published","oa_version":"Preprint","publication_identifier":{"issn":["0302-9743"],"eisbn":["978-3-030-92075-3"],"eissn":["1611-3349"],"isbn":["978-3-030-92074-6"]},"project":[{"call_identifier":"H2020","name":"Teaching Old Crypto New Tricks","grant_number":"682815","_id":"258AA5B2-B435-11E9-9278-68D0E5697425"}],"department":[{"_id":"KrPi"}],"ec_funded":1,"scopus_import":"1","external_id":{"isi":["000927876200012"]},"isi":1,"author":[{"first_name":"Suvradip","id":"B9CD0494-D033-11E9-B219-A439E6697425","last_name":"Chakraborty","full_name":"Chakraborty, Suvradip"},{"first_name":"Chaya","full_name":"Ganesh, Chaya","last_name":"Ganesh"},{"full_name":"Pancholi, Mahak","last_name":"Pancholi","first_name":"Mahak"},{"first_name":"Pratik","last_name":"Sarkar","full_name":"Sarkar, Pratik"}],"day":"01","intvolume":"     13091","article_processing_charge":"No","type":"conference","oa":1,"citation":{"ista":"Chakraborty S, Ganesh C, Pancholi M, Sarkar P. 2021. Reverse firewalls for adaptively secure MPC without setup. 27th International Conference on the Theory and Application of Cryptology and Information Security. ASIACRYPT: International Conference on Cryptology in Asia, LNCS, vol. 13091, 335–364.","apa":"Chakraborty, S., Ganesh, C., Pancholi, M., &#38; Sarkar, P. (2021). Reverse firewalls for adaptively secure MPC without setup. In <i>27th International Conference on the Theory and Application of Cryptology and Information Security</i> (Vol. 13091, pp. 335–364). Virtual, Singapore: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-92075-3_12\">https://doi.org/10.1007/978-3-030-92075-3_12</a>","mla":"Chakraborty, Suvradip, et al. “Reverse Firewalls for Adaptively Secure MPC without Setup.” <i>27th International Conference on the Theory and Application of Cryptology and Information Security</i>, vol. 13091, Springer Nature, 2021, pp. 335–64, doi:<a href=\"https://doi.org/10.1007/978-3-030-92075-3_12\">10.1007/978-3-030-92075-3_12</a>.","ieee":"S. Chakraborty, C. Ganesh, M. Pancholi, and P. Sarkar, “Reverse firewalls for adaptively secure MPC without setup,” in <i>27th International Conference on the Theory and Application of Cryptology and Information Security</i>, Virtual, Singapore, 2021, vol. 13091, pp. 335–364.","ama":"Chakraborty S, Ganesh C, Pancholi M, Sarkar P. Reverse firewalls for adaptively secure MPC without setup. In: <i>27th International Conference on the Theory and Application of Cryptology and Information Security</i>. Vol 13091. Springer Nature; 2021:335-364. doi:<a href=\"https://doi.org/10.1007/978-3-030-92075-3_12\">10.1007/978-3-030-92075-3_12</a>","short":"S. Chakraborty, C. Ganesh, M. Pancholi, P. Sarkar, in:, 27th International Conference on the Theory and Application of Cryptology and Information Security, Springer Nature, 2021, pp. 335–364.","chicago":"Chakraborty, Suvradip, Chaya Ganesh, Mahak Pancholi, and Pratik Sarkar. “Reverse Firewalls for Adaptively Secure MPC without Setup.” In <i>27th International Conference on the Theory and Application of Cryptology and Information Security</i>, 13091:335–64. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/978-3-030-92075-3_12\">https://doi.org/10.1007/978-3-030-92075-3_12</a>."},"year":"2021","conference":{"start_date":"2021-12-06","name":"ASIACRYPT: International Conference on Cryptology in Asia","end_date":"2021-12-10","location":"Virtual, Singapore"},"month":"12","alternative_title":["LNCS"],"_id":"10609","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2021/1262"}],"date_published":"2021-12-01T00:00:00Z","date_updated":"2025-04-14T07:22:06Z","language":[{"iso":"eng"}],"quality_controlled":"1","title":"Reverse firewalls for adaptively secure MPC without setup","volume":13091,"status":"public","page":"335-364"},{"_id":"10629","date_published":"2021-11-29T00:00:00Z","alternative_title":["LIPIcs"],"quality_controlled":"1","language":[{"iso":"eng"}],"date_updated":"2024-10-09T21:01:23Z","year":"2021","ddc":["000"],"conference":{"location":"Virtual","start_date":"2021-12-15","name":"FSTTCS: Foundations of Software Technology and Theoretical Computer Science","end_date":"2021-12-17"},"month":"11","has_accepted_license":"1","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"status":"public","corr_author":"1","volume":213,"title":"Quantitative verification on product graphs of small treewidth","abstract":[{"lang":"eng","text":"Product graphs arise naturally in formal verification and program analysis. For example, the analysis of two concurrent threads requires the product of two component control-flow graphs, and for language inclusion of deterministic automata the product of two automata is constructed. In many cases, the component graphs have constant treewidth, e.g., when the input contains control-flow graphs of programs. We consider the algorithmic analysis of products of two constant-treewidth graphs with respect to three classic specification languages, namely, (a) algebraic properties, (b) mean-payoff properties, and (c) initial credit for energy properties.\r\nOur main contributions are as follows. Consider a graph G that is the product of two constant-treewidth graphs of size n each. First, given an idempotent semiring, we present an algorithm that computes the semiring transitive closure of G in time Õ(n⁴). Since the output has size Θ(n⁴), our algorithm is optimal (up to polylog factors). Second, given a mean-payoff objective, we present an O(n³)-time algorithm for deciding whether the value of a starting state is non-negative, improving the previously known O(n⁴) bound. Third, given an initial credit for energy objective, we present an O(n⁵)-time algorithm for computing the minimum initial credit for all nodes of G, improving the previously known O(n⁸) bound. At the heart of our approach lies an algorithm for the efficient construction of strongly-balanced tree decompositions of constant-treewidth graphs. Given a constant-treewidth graph G' of n nodes and a positive integer λ, our algorithm constructs a binary tree decomposition of G' of width O(λ) with the property that the size of each subtree decreases geometrically with rate (1/2 + 2^{-λ})."}],"file":[{"creator":"cchlebak","file_id":"10633","date_updated":"2022-01-17T10:36:08Z","checksum":"71141acdeffa9056f24d6dbef952d254","file_name":"2021_LIPIcs_Chatterjee.pdf","success":1,"file_size":891566,"date_created":"2022-01-17T10:36:08Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"publication":"41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science","publication_status":"published","doi":"10.4230/LIPIcs.FSTTCS.2021.42","oa_version":"Published Version","publication_identifier":{"isbn":["978-3-9597-7215-0"],"issn":["1868-8969"]},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","date_created":"2022-01-16T23:01:28Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","intvolume":"       213","day":"29","file_date_updated":"2022-01-17T10:36:08Z","citation":{"apa":"Chatterjee, K., Ibsen-Jensen, R., &#38; Pavlogiannis, A. (2021). Quantitative verification on product graphs of small treewidth. In <i>41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i> (Vol. 213). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2021.42\">https://doi.org/10.4230/LIPIcs.FSTTCS.2021.42</a>","ista":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2021. Quantitative verification on product graphs of small treewidth. 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 213, 42.","mla":"Chatterjee, Krishnendu, et al. “Quantitative Verification on Product Graphs of Small Treewidth.” <i>41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>, vol. 213, 42, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2021.42\">10.4230/LIPIcs.FSTTCS.2021.42</a>.","ieee":"K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, “Quantitative verification on product graphs of small treewidth,” in <i>41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>, Virtual, 2021, vol. 213.","short":"K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, in:, 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.","ama":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. Quantitative verification on product graphs of small treewidth. In: <i>41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>. Vol 213. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021. doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2021.42\">10.4230/LIPIcs.FSTTCS.2021.42</a>","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Quantitative Verification on Product Graphs of Small Treewidth.” In <i>41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>, Vol. 213. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. <a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2021.42\">https://doi.org/10.4230/LIPIcs.FSTTCS.2021.42</a>."},"article_processing_charge":"No","type":"conference","oa":1,"department":[{"_id":"KrCh"}],"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4783-0389","last_name":"Ibsen-Jensen","full_name":"Ibsen-Jensen, Rasmus"},{"first_name":"Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8943-0722","last_name":"Pavlogiannis","full_name":"Pavlogiannis, Andreas"}],"article_number":"42","scopus_import":"1"},{"title":"On the complexity of intersection non-emptiness for star-free language classes","volume":213,"arxiv":1,"corr_author":"1","status":"public","month":"11","has_accepted_license":"1","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"year":"2021","ddc":["000"],"conference":{"location":"Virtual","start_date":"2021-12-15","name":"FSTTCS: Foundations of Software Technology and Theoretical Computer Science","end_date":"2021-12-17"},"language":[{"iso":"eng"}],"date_updated":"2025-05-14T10:53:59Z","quality_controlled":"1","alternative_title":["LIPIcs"],"_id":"10630","date_published":"2021-11-29T00:00:00Z","article_number":"34","scopus_import":"1","external_id":{"arxiv":["2110.01279"]},"author":[{"last_name":"Arrighi","full_name":"Arrighi, Emmanuel","first_name":"Emmanuel"},{"first_name":"Henning","full_name":"Fernau, Henning","last_name":"Fernau"},{"last_name":"Hoffmann","full_name":"Hoffmann, Stefan","first_name":"Stefan"},{"first_name":"Markus","last_name":"Holzer","full_name":"Holzer, Markus"},{"id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425","first_name":"Ismael R","full_name":"Jecker, Ismael R","last_name":"Jecker"},{"full_name":"De Oliveira Oliveira, Mateus","last_name":"De Oliveira Oliveira","first_name":"Mateus"},{"first_name":"Petra","full_name":"Wolf, Petra","last_name":"Wolf"}],"project":[{"call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411"}],"acknowledgement":"We like to thank Lukas Fleischer and Michael Wehar for our discussions. This work started at the Schloss Dagstuhl Event 20483 Moderne Aspekte der Komplexitätstheorie in der Automatentheorie https://www.dagstuhl.de/20483.\r\n","department":[{"_id":"KrCh"}],"ec_funded":1,"type":"conference","article_processing_charge":"No","oa":1,"citation":{"apa":"Arrighi, E., Fernau, H., Hoffmann, S., Holzer, M., Jecker, I. R., De Oliveira Oliveira, M., &#38; Wolf, P. (2021). On the complexity of intersection non-emptiness for star-free language classes. In <i>41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i> (Vol. 213). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2021.34\">https://doi.org/10.4230/LIPIcs.FSTTCS.2021.34</a>","ista":"Arrighi E, Fernau H, Hoffmann S, Holzer M, Jecker IR, De Oliveira Oliveira M, Wolf P. 2021. On the complexity of intersection non-emptiness for star-free language classes. 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 213, 34.","mla":"Arrighi, Emmanuel, et al. “On the Complexity of Intersection Non-Emptiness for Star-Free Language Classes.” <i>41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>, vol. 213, 34, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2021.34\">10.4230/LIPIcs.FSTTCS.2021.34</a>.","ieee":"E. Arrighi <i>et al.</i>, “On the complexity of intersection non-emptiness for star-free language classes,” in <i>41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>, Virtual, 2021, vol. 213.","ama":"Arrighi E, Fernau H, Hoffmann S, et al. On the complexity of intersection non-emptiness for star-free language classes. In: <i>41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>. Vol 213. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021. doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2021.34\">10.4230/LIPIcs.FSTTCS.2021.34</a>","short":"E. Arrighi, H. Fernau, S. Hoffmann, M. Holzer, I.R. Jecker, M. De Oliveira Oliveira, P. Wolf, in:, 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.","chicago":"Arrighi, Emmanuel, Henning Fernau, Stefan Hoffmann, Markus Holzer, Ismael R Jecker, Mateus De Oliveira Oliveira, and Petra Wolf. “On the Complexity of Intersection Non-Emptiness for Star-Free Language Classes.” In <i>41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>, Vol. 213. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. <a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2021.34\">https://doi.org/10.4230/LIPIcs.FSTTCS.2021.34</a>."},"day":"29","file_date_updated":"2022-01-17T10:49:03Z","intvolume":"       213","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","date_created":"2022-01-16T23:01:29Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","publication_identifier":{"isbn":["978-3-9597-7215-0"],"issn":["1868-8969"]},"doi":"10.4230/LIPIcs.FSTTCS.2021.34","file":[{"success":1,"file_name":"2021_LIPIcs_Arrighi.pdf","checksum":"d5a82ba893c3bc5da5914edbb3efb92b","date_updated":"2022-01-17T10:49:03Z","file_id":"10634","creator":"cchlebak","access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2022-01-17T10:49:03Z","file_size":844224}],"abstract":[{"text":"In the Intersection Non-emptiness problem, we are given a list of finite automata A_1, A_2,… , A_m over a common alphabet Σ as input, and the goal is to determine whether some string w ∈ Σ^* lies in the intersection of the languages accepted by the automata in the list. We analyze the complexity of the Intersection Non-emptiness problem under the promise that all input automata accept a language in some level of the dot-depth hierarchy, or some level of the Straubing-Thérien hierarchy. Automata accepting languages from the lowest levels of these hierarchies arise naturally in the context of model checking. We identify a dichotomy in the dot-depth hierarchy by showing that the problem is already NP-complete when all input automata accept languages of the levels B_0 or B_{1/2} and already PSPACE-hard when all automata accept a language from the level B_1. Conversely, we identify a tetrachotomy in the Straubing-Thérien hierarchy. More precisely, we show that the problem is in AC^0 when restricted to level L_0; complete for L or NL, depending on the input representation, when restricted to languages in the level L_{1/2}; NP-complete when the input is given as DFAs accepting a language in L_1 or L_{3/2}; and finally, PSPACE-complete when the input automata accept languages in level L_2 or higher. Moreover, we show that the proof technique used to show containment in NP for DFAs accepting languages in L_1 or L_{3/2} does not generalize to the context of NFAs. To prove this, we identify a family of languages that provide an exponential separation between the state complexity of general NFAs and that of partially ordered NFAs. To the best of our knowledge, this is the first superpolynomial separation between these two models of computation.","lang":"eng"}],"publication":"41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science","publication_status":"published"},{"has_accepted_license":"1","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"month":"10","conference":{"location":"Virtual","name":"FMCAD: Formal Methods in Computer-Aided Design","start_date":"2021-10-20","end_date":"2021-10-22"},"ddc":["000"],"year":"2021","editor":[{"first_name":"Piskac","last_name":"Ruzica","full_name":"Ruzica, Piskac"},{"full_name":"Whalen, Michael W.","last_name":"Whalen","first_name":"Michael W."}],"language":[{"iso":"eng"}],"date_updated":"2025-04-15T06:25:56Z","quality_controlled":"1","alternative_title":["Conference Series"],"date_published":"2021-10-01T00:00:00Z","_id":"10688","title":"The Civl verifier","volume":2,"page":"143–152","corr_author":"1","status":"public","publisher":"TU Wien Academic Press","date_created":"2022-01-26T08:01:30Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","publication_identifier":{"isbn":["978-3-85448-046-4"]},"oa_version":"Published Version","doi":"10.34727/2021/isbn.978-3-85448-046-4_23","publication_status":"published","file":[{"checksum":"35438ac9f9750340b7f8ae4ae3220d9f","success":1,"file_name":"2021_FCAD2021_Kragl.pdf","creator":"cchlebak","file_id":"10689","date_updated":"2022-01-26T08:04:29Z","file_size":390555,"date_created":"2022-01-26T08:04:29Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"abstract":[{"text":"Civl is a static verifier for concurrent programs designed around the conceptual framework of layered refinement,\r\nwhich views the task of verifying a program as a sequence of program simplification steps each justified by its own invariant. Civl verifies a layered concurrent program that compactly expresses all the programs in this sequence and the supporting invariants. This paper presents the design and implementation of the Civl verifier.","lang":"eng"}],"publication":"Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design","scopus_import":"1","author":[{"id":"320FC952-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7745-9117","first_name":"Bernhard","full_name":"Kragl, Bernhard","last_name":"Kragl"},{"full_name":"Qadeer, Shaz","last_name":"Qadeer","first_name":"Shaz"}],"department":[{"_id":"ToHe"}],"acknowledgement":"This research was performed while Bernhard Kragl was at IST Austria, supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award).","project":[{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems"}],"oa":1,"article_processing_charge":"No","type":"conference","citation":{"ieee":"B. Kragl and S. Qadeer, “The Civl verifier,” in <i>Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design</i>, Virtual, 2021, vol. 2, pp. 143–152.","mla":"Kragl, Bernhard, and Shaz Qadeer. “The Civl Verifier.” <i>Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design</i>, edited by Piskac Ruzica and Michael W. Whalen, vol. 2, TU Wien Academic Press, 2021, pp. 143–152, doi:<a href=\"https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23\">10.34727/2021/isbn.978-3-85448-046-4_23</a>.","ista":"Kragl B, Qadeer S. 2021. The Civl verifier. Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design. FMCAD: Formal Methods in Computer-Aided Design, Conference Series, vol. 2, 143–152.","apa":"Kragl, B., &#38; Qadeer, S. (2021). The Civl verifier. In P. Ruzica &#38; M. W. Whalen (Eds.), <i>Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design</i> (Vol. 2, pp. 143–152). Virtual: TU Wien Academic Press. <a href=\"https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23\">https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23</a>","chicago":"Kragl, Bernhard, and Shaz Qadeer. “The Civl Verifier.” In <i>Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design</i>, edited by Piskac Ruzica and Michael W. Whalen, 2:143–152. TU Wien Academic Press, 2021. <a href=\"https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23\">https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23</a>.","ama":"Kragl B, Qadeer S. The Civl verifier. In: Ruzica P, Whalen MW, eds. <i>Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design</i>. Vol 2. TU Wien Academic Press; 2021:143–152. doi:<a href=\"https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_23\">10.34727/2021/isbn.978-3-85448-046-4_23</a>","short":"B. Kragl, S. Qadeer, in:, P. Ruzica, M.W. Whalen (Eds.), Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design, TU Wien Academic Press, 2021, pp. 143–152."},"file_date_updated":"2022-01-26T08:04:29Z","day":"01","intvolume":"         2"},{"citation":{"ieee":"H. Polshyn <i>et al.</i>, “Orbital Chern insulator states in twisted monolayer-bilayer graphene and electrical switching of topological and magnetic order,” in <i>APS March Meeting 2021</i>, Virtual, 2021, vol. 66, no. 1.","ista":"Polshyn H, Zhu J, Kumar M, Zhang Y, Yang F, Tschirhart C, Serlin M, Watanabe K, Tanaguchi T, MacDonald A, Young A. 2021. Orbital Chern insulator states in twisted monolayer-bilayer graphene and electrical switching of topological and magnetic order. APS March Meeting 2021. APS: American Physical Society, Bulletin of the American Physical Society, vol. 66, E42.00010.","apa":"Polshyn, H., Zhu, J., Kumar, M., Zhang, Y., Yang, F., Tschirhart, C., … Young, A. (2021). Orbital Chern insulator states in twisted monolayer-bilayer graphene and electrical switching of topological and magnetic order. In <i>APS March Meeting 2021</i> (Vol. 66). Virtual: American Physical Society.","mla":"Polshyn, Hryhoriy, et al. “Orbital Chern Insulator States in Twisted Monolayer-Bilayer Graphene and Electrical Switching of Topological and Magnetic Order.” <i>APS March Meeting 2021</i>, vol. 66, no. 1, E42.00010, American Physical Society, 2021.","chicago":"Polshyn, Hryhoriy, Jihang Zhu, Manish Kumar, Yuxuan Zhang, Fangyuan Yang, Charles Tschirhart, Marec Serlin, et al. “Orbital Chern Insulator States in Twisted Monolayer-Bilayer Graphene and Electrical Switching of Topological and Magnetic Order.” In <i>APS March Meeting 2021</i>, Vol. 66. American Physical Society, 2021.","ama":"Polshyn H, Zhu J, Kumar M, et al. Orbital Chern insulator states in twisted monolayer-bilayer graphene and electrical switching of topological and magnetic order. In: <i>APS March Meeting 2021</i>. Vol 66. American Physical Society; 2021.","short":"H. Polshyn, J. Zhu, M. Kumar, Y. Zhang, F. Yang, C. Tschirhart, M. Serlin, K. Watanabe, T. Tanaguchi, A. MacDonald, A. Young, in:, APS March Meeting 2021, American Physical Society, 2021."},"article_processing_charge":"No","type":"conference","oa":1,"status":"public","intvolume":"        66","day":"01","volume":66,"author":[{"last_name":"Polshyn","full_name":"Polshyn, Hryhoriy","orcid":"0000-0001-8223-8896","first_name":"Hryhoriy","id":"edfc7cb1-526e-11ec-b05a-e6ecc27e4e48"},{"last_name":"Zhu","full_name":"Zhu, Jihang","first_name":"Jihang"},{"last_name":"Kumar","full_name":"Kumar, Manish","first_name":"Manish"},{"first_name":"Yuxuan","last_name":"Zhang","full_name":"Zhang, Yuxuan"},{"last_name":"Yang","full_name":"Yang, Fangyuan","first_name":"Fangyuan"},{"first_name":"Charles","full_name":"Tschirhart, Charles","last_name":"Tschirhart"},{"full_name":"Serlin, Marec","last_name":"Serlin","first_name":"Marec"},{"full_name":"Watanabe, Kenji","last_name":"Watanabe","first_name":"Kenji"},{"first_name":"Takashi","last_name":"Tanaguchi","full_name":"Tanaguchi, Takashi"},{"first_name":"Allan","last_name":"MacDonald","full_name":"MacDonald, Allan"},{"first_name":"Andrea","last_name":"Young","full_name":"Young, Andrea"}],"article_number":"E42.00010","title":"Orbital Chern insulator states in twisted monolayer-bilayer graphene and electrical switching of topological and magnetic order","issue":"1","quality_controlled":"1","publication_identifier":{"issn":["0003-0503"]},"oa_version":"Published Version","language":[{"iso":"eng"}],"date_updated":"2022-01-27T10:46:23Z","_id":"10692","main_file_link":[{"open_access":"1","url":"https://meetings.aps.org/Meeting/MAR21/Session/E42.10"}],"abstract":[{"lang":"eng","text":"We experimentally investigate narrow and topologically nontrivial moiré minibands hosted by van der Waals heterostructures consisting of a graphene monolayer rotationally faulted with respect to a Bernal-stacked bilayer. At fillings ν= 1 and 3 electrons per moiré unit cell within these bands, we observe quantized anomalous Hall effects with Rxy≈h/2e2, indicative of spontaneous polarization of the system into a single valley-projected band with Chern number C= 2. Remarkably, we also observe the evidence of symmetry broken Chern insulator states at ν= 1.5 and 3.5. At ν= 3 we find that the sign of the quantum anomalous Hall effect can be reversed via field-effect control of the chemical potential. This curious effect arises from the magnetization contribution due to topological edge states, which drive a reversal of the total magnetization and thus a switch of the favored magnetic state. Remarkably, we find that this switch is hysteretic, which we use to demonstrate non-volatile electric-field-induced reversal of the magnetic state. Voltage control of magnetic states can be used to electrically pattern nonvolatile magnetic domain structures hosting chiral edge states, with applications ranging from reconfigurable microwave circuit elements to ultra-low-power magnetic memory."}],"publication":"APS March Meeting 2021","date_published":"2021-03-01T00:00:00Z","extern":"1","alternative_title":["Bulletin of the American Physical Society"],"month":"03","date_created":"2022-01-27T09:49:48Z","publisher":"American Physical Society","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","year":"2021","conference":{"start_date":"2021-03-15","name":"APS: American Physical Society","end_date":"2021-03-19","location":"Virtual"}},{"issue":"1","author":[{"full_name":"Perna, Rosalba","last_name":"Perna","first_name":"Rosalba"},{"last_name":"Tagawa","full_name":"Tagawa, Hiromichi","first_name":"Hiromichi"},{"first_name":"Zoltán","id":"7c006e8c-cc0d-11ee-8322-cb904ef76f36","last_name":"Haiman","full_name":"Haiman, Zoltán"},{"first_name":"Imre","last_name":"Bartos","full_name":"Bartos, Imre"}],"article_number":"10","scopus_import":"1","intvolume":"       915","day":"28","citation":{"chicago":"Perna, Rosalba, Hiromichi Tagawa, Zoltán Haiman, and Imre Bartos. “Accretion-Induced Collapse of Neutron Stars in the Disks of Active Galactic Nuclei.” <i>The Astrophysical Journal</i>. American Astronomical Society, 2021. <a href=\"https://doi.org/10.3847/1538-4357/abfdb4\">https://doi.org/10.3847/1538-4357/abfdb4</a>.","ama":"Perna R, Tagawa H, Haiman Z, Bartos I. Accretion-induced collapse of neutron stars in the disks of active galactic nuclei. <i>The Astrophysical Journal</i>. 2021;915(1). doi:<a href=\"https://doi.org/10.3847/1538-4357/abfdb4\">10.3847/1538-4357/abfdb4</a>","short":"R. Perna, H. Tagawa, Z. Haiman, I. Bartos, The Astrophysical Journal 915 (2021).","ieee":"R. Perna, H. Tagawa, Z. Haiman, and I. Bartos, “Accretion-induced collapse of neutron stars in the disks of active galactic nuclei,” <i>The Astrophysical Journal</i>, vol. 915, no. 1. American Astronomical Society, 2021.","mla":"Perna, Rosalba, et al. “Accretion-Induced Collapse of Neutron Stars in the Disks of Active Galactic Nuclei.” <i>The Astrophysical Journal</i>, vol. 915, no. 1, 10, American Astronomical Society, 2021, doi:<a href=\"https://doi.org/10.3847/1538-4357/abfdb4\">10.3847/1538-4357/abfdb4</a>.","ista":"Perna R, Tagawa H, Haiman Z, Bartos I. 2021. Accretion-induced collapse of neutron stars in the disks of active galactic nuclei. The Astrophysical Journal. 915(1), 10.","apa":"Perna, R., Tagawa, H., Haiman, Z., &#38; Bartos, I. (2021). Accretion-induced collapse of neutron stars in the disks of active galactic nuclei. <i>The Astrophysical Journal</i>. American Astronomical Society. <a href=\"https://doi.org/10.3847/1538-4357/abfdb4\">https://doi.org/10.3847/1538-4357/abfdb4</a>"},"type":"journal_article","article_processing_charge":"No","oa":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2024-09-05T08:55:06Z","publisher":"American Astronomical Society","article_type":"original","publication":"The Astrophysical Journal","abstract":[{"text":"The disks of active galactic nuclei (AGNs) have emerged as a rich environment for the evolution of stars and their compact remnants. The very dense medium favors rapid accretion, while torques and migration traps enhance binary formation and mergers. Both long and short gamma-ray bursts are hence expected. We show that AGN disks constitute an ideal environment for another interesting phenomenon: the accretion-induced collapse (AIC) of neutron stars (NSs) to black holes (BHs). Rapid accretion in the dense disks can cause NSs to grow to the point of exceeding the maximum mass allowed by their equation of state. General relativistic magnetohydrodynamical simulations have shown that electromagnetic signatures are expected if the NS is surrounded by a minidisk prior to collapse, which then rapidly accretes onto the BH, and/or if the NS is highly magnetized, from reconnection of the magnetosphere during collapse. Here we compute the rates of AICs and their locations within the disks for both isolated NSs and for (initially stable) NSs formed from NS-NS mergers. We find that the global AIC rates are ∼0.07–20 Gpc−3 yr−1, and we discuss their observable prospects and signatures as they emerge from the dense disk environments.","lang":"eng"}],"publication_status":"published","extern":"1","doi":"10.3847/1538-4357/abfdb4","oa_version":"Published Version","publication_identifier":{"issn":["0004-637X","1538-4357"]},"volume":915,"title":"Accretion-induced collapse of neutron stars in the disks of active galactic nuclei","status":"public","year":"2021","month":"06","main_file_link":[{"open_access":"1","url":"https://doi.org/10.3847/1538-4357/abfdb4"}],"_id":"17515","date_published":"2021-06-28T00:00:00Z","quality_controlled":"1","language":[{"iso":"eng"}],"date_updated":"2024-09-10T13:47:31Z"},{"oa":1,"article_processing_charge":"No","type":"journal_article","citation":{"ieee":"H. Tagawa, B. Kocsis, Z. Haiman, I. Bartos, K. Omukai, and J. Samsing, “Eccentric black hole mergers in active galactic nuclei,” <i>The Astrophysical Journal Letters</i>, vol. 907, no. 1. American Astronomical Society, 2021.","apa":"Tagawa, H., Kocsis, B., Haiman, Z., Bartos, I., Omukai, K., &#38; Samsing, J. (2021). Eccentric black hole mergers in active galactic nuclei. <i>The Astrophysical Journal Letters</i>. American Astronomical Society. <a href=\"https://doi.org/10.3847/2041-8213/abd4d3\">https://doi.org/10.3847/2041-8213/abd4d3</a>","ista":"Tagawa H, Kocsis B, Haiman Z, Bartos I, Omukai K, Samsing J. 2021. Eccentric black hole mergers in active galactic nuclei. The Astrophysical Journal Letters. 907(1), L20.","mla":"Tagawa, Hiromichi, et al. “Eccentric Black Hole Mergers in Active Galactic Nuclei.” <i>The Astrophysical Journal Letters</i>, vol. 907, no. 1, L20, American Astronomical Society, 2021, doi:<a href=\"https://doi.org/10.3847/2041-8213/abd4d3\">10.3847/2041-8213/abd4d3</a>.","chicago":"Tagawa, Hiromichi, Bence Kocsis, Zoltán Haiman, Imre Bartos, Kazuyuki Omukai, and Johan Samsing. “Eccentric Black Hole Mergers in Active Galactic Nuclei.” <i>The Astrophysical Journal Letters</i>. American Astronomical Society, 2021. <a href=\"https://doi.org/10.3847/2041-8213/abd4d3\">https://doi.org/10.3847/2041-8213/abd4d3</a>.","ama":"Tagawa H, Kocsis B, Haiman Z, Bartos I, Omukai K, Samsing J. Eccentric black hole mergers in active galactic nuclei. <i>The Astrophysical Journal Letters</i>. 2021;907(1). doi:<a href=\"https://doi.org/10.3847/2041-8213/abd4d3\">10.3847/2041-8213/abd4d3</a>","short":"H. Tagawa, B. Kocsis, Z. Haiman, I. Bartos, K. Omukai, J. Samsing, The Astrophysical Journal Letters 907 (2021)."},"day":"21","intvolume":"       907","article_number":"L20","scopus_import":"1","author":[{"first_name":"Hiromichi","full_name":"Tagawa, Hiromichi","last_name":"Tagawa"},{"full_name":"Kocsis, Bence","last_name":"Kocsis","first_name":"Bence"},{"full_name":"Haiman, Zoltán","last_name":"Haiman","first_name":"Zoltán","id":"7c006e8c-cc0d-11ee-8322-cb904ef76f36"},{"first_name":"Imre","full_name":"Bartos, Imre","last_name":"Bartos"},{"first_name":"Kazuyuki","full_name":"Omukai, Kazuyuki","last_name":"Omukai"},{"last_name":"Samsing","full_name":"Samsing, Johan","first_name":"Johan"}],"issue":"1","publication_identifier":{"issn":["2041-8205","2041-8213"]},"oa_version":"Published Version","extern":"1","doi":"10.3847/2041-8213/abd4d3","publication_status":"published","abstract":[{"text":"The astrophysical origin of gravitational wave transients is a timely open question in the wake of discoveries by the Laser Interferometer Gravitational-Wave Observatory (LIGO)/Virgo. In active galactic nuclei (AGNs), binaries form and evolve efficiently by interaction with a dense population of stars and the gaseous AGN disk. Previous studies have shown that stellar-mass black hole (BH) mergers in such environments can explain the merger rate and the number of suspected hierarchical mergers observed by LIGO/Virgo. The binary eccentricity distribution can provide further information to distinguish between astrophysical models. Here we derive the eccentricity distribution of BH mergers in AGN disks. We find that eccentricity is mainly due to binary–single (BS) interactions, which lead to most BH mergers in AGN disks having a significant eccentricity at 0.01 Hz, detectable by the Laser Interferometer Space Antenna. If BS interactions occur in isotropic-3D directions, then 8%–30% of the mergers in AGN disks will have eccentricities at 10 Hz above e10 Hz ≳ 0.03, detectable by LIGO/Virgo/Kamioka Gravitational Wave Detector, while 5%–17% of mergers have e10 Hz ≥ 0.3. On the other hand, if BS interactions are confined to the AGN–disk plane due to torques from the disk, with 1–20 intermediate binary states during each interaction, or if BHs can migrate to ≲ 10−3 pc from the central supermassive BH, then 10%–70% of the mergers will be highly eccentric (e10 Hz ≥ 0.3), consistent with the possible high eccentricity in GW190521.","lang":"eng"}],"publication":"The Astrophysical Journal Letters","article_type":"original","publisher":"American Astronomical Society","date_created":"2024-09-05T12:27:07Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","status":"public","title":"Eccentric black hole mergers in active galactic nuclei","volume":907,"language":[{"iso":"eng"}],"date_updated":"2024-09-19T11:41:11Z","quality_controlled":"1","date_published":"2021-01-21T00:00:00Z","main_file_link":[{"url":"https://doi.org/10.3847/2041-8213/abd4d3","open_access":"1"}],"_id":"17583","month":"01","year":"2021"},{"year":"2021","month":"03","date_published":"2021-03-03T00:00:00Z","_id":"17592","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2010.09707"}],"language":[{"iso":"eng"}],"date_updated":"2025-01-03T11:32:01Z","quality_controlled":"1","title":"Equilibrium eccentricity of accreting binaries","volume":909,"status":"public","arxiv":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_type":"original","publisher":"American Astronomical Society","date_created":"2024-09-05T12:39:13Z","doi":"10.3847/2041-8213/abdd1c","extern":"1","publication_status":"published","publication":"The Astrophysical Journal Letters","abstract":[{"text":"Using high-resolution hydrodynamics simulations, we show that equal-mass binaries accreting from a circumbinary disk evolve toward an orbital eccentricity of e ≃ 0.45, unless they are initialized on a nearly circular orbit with e ≲ 0.08, in which case they further circularize. The implied bi-modal eccentricity distribution resembles that seen in post-AGB stellar binaries. Large accretion spikes around periapse impart a tell-tale, quasiperiodic, bursty signature on the light curves of eccentric binaries. We predict that intermediate-mass and massive black hole binaries at z ≲ 10 entering the LISA band will have measurable eccentricities in the range of e ≃ 10−3 − 10−2, if they have experienced a gas-driven phase. On the other hand, GW190521 would have entered the LIGO/Virgo band with undetectable eccentricity ∼10−6 if it had been driven into the gravitational-wave regime by a gas disk.","lang":"eng"}],"oa_version":"Preprint","publication_identifier":{"issn":["2041-8205"],"eissn":["2041-8213"]},"issue":"1","external_id":{"arxiv":["2010.09707"]},"scopus_import":"1","article_number":"L13","author":[{"first_name":"Jonathan","full_name":"Zrake, Jonathan","last_name":"Zrake"},{"first_name":"Christopher","full_name":"Tiede, Christopher","last_name":"Tiede"},{"last_name":"MacFadyen","full_name":"MacFadyen, Andrew","first_name":"Andrew"},{"full_name":"Haiman, Zoltán","last_name":"Haiman","first_name":"Zoltán","id":"7c006e8c-cc0d-11ee-8322-cb904ef76f36","orcid":"0000-0003-3633-5403"}],"OA_type":"green","OA_place":"repository","day":"03","intvolume":"       909","oa":1,"article_processing_charge":"No","type":"journal_article","citation":{"ieee":"J. Zrake, C. Tiede, A. MacFadyen, and Z. Haiman, “Equilibrium eccentricity of accreting binaries,” <i>The Astrophysical Journal Letters</i>, vol. 909, no. 1. American Astronomical Society, 2021.","apa":"Zrake, J., Tiede, C., MacFadyen, A., &#38; Haiman, Z. (2021). Equilibrium eccentricity of accreting binaries. <i>The Astrophysical Journal Letters</i>. American Astronomical Society. <a href=\"https://doi.org/10.3847/2041-8213/abdd1c\">https://doi.org/10.3847/2041-8213/abdd1c</a>","ista":"Zrake J, Tiede C, MacFadyen A, Haiman Z. 2021. Equilibrium eccentricity of accreting binaries. The Astrophysical Journal Letters. 909(1), L13.","mla":"Zrake, Jonathan, et al. “Equilibrium Eccentricity of Accreting Binaries.” <i>The Astrophysical Journal Letters</i>, vol. 909, no. 1, L13, American Astronomical Society, 2021, doi:<a href=\"https://doi.org/10.3847/2041-8213/abdd1c\">10.3847/2041-8213/abdd1c</a>.","chicago":"Zrake, Jonathan, Christopher Tiede, Andrew MacFadyen, and Zoltán Haiman. “Equilibrium Eccentricity of Accreting Binaries.” <i>The Astrophysical Journal Letters</i>. American Astronomical Society, 2021. <a href=\"https://doi.org/10.3847/2041-8213/abdd1c\">https://doi.org/10.3847/2041-8213/abdd1c</a>.","short":"J. Zrake, C. Tiede, A. MacFadyen, Z. Haiman, The Astrophysical Journal Letters 909 (2021).","ama":"Zrake J, Tiede C, MacFadyen A, Haiman Z. Equilibrium eccentricity of accreting binaries. <i>The Astrophysical Journal Letters</i>. 2021;909(1). doi:<a href=\"https://doi.org/10.3847/2041-8213/abdd1c\">10.3847/2041-8213/abdd1c</a>"}},{"oa_version":"Published Version","publication_identifier":{"issn":["0001-7701","1572-9532"]},"doi":"10.1007/s10714-021-02889-x","extern":"1","publication_status":"published","publication":"General Relativity and Gravitation","abstract":[{"text":"The science objectives of the LISA mission have been defined under the implicit assumption of a 4-years continuous data stream. Based on the performance of LISA Pathfinder, it is now expected that LISA will have a duty cycle of ≈0.75 , which would reduce the effective span of usable data to 3 years. This paper reports the results of a study by the LISA Science Group, which was charged with assessing the additional science return of increasing the mission lifetime. We explore various observational scenarios to assess the impact of mission duration on the main science objectives of the mission. We find that the science investigations most affected by mission duration concern the search for seed black holes at cosmic dawn, as well as the study of stellar-origin black holes and of their formation channels via multi-band and multi-messenger observations. We conclude that an extension to 6 years of mission operations is recommended.","lang":"eng"}],"publisher":"Springer Science and Business Media LLC","article_type":"original","date_created":"2024-09-05T12:40:14Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","oa":1,"type":"journal_article","article_processing_charge":"No","citation":{"ieee":"P. Amaro Seoane <i>et al.</i>, “The effect of mission duration on LISA science objectives,” <i>General Relativity and Gravitation</i>, vol. 54, no. 1. Springer Science and Business Media LLC, 2021.","apa":"Amaro Seoane, P., Arca Sedda, M., Babak, S., Berry, C. P. L., Berti, E., Bertone, G., … Zimmerman, A. (2021). The effect of mission duration on LISA science objectives. <i>General Relativity and Gravitation</i>. Springer Science and Business Media LLC. <a href=\"https://doi.org/10.1007/s10714-021-02889-x\">https://doi.org/10.1007/s10714-021-02889-x</a>","ista":"Amaro Seoane P, Arca Sedda M, Babak S, Berry CPL, Berti E, Bertone G, Blas D, Bogdanović T, Bonetti M, Breivik K, Brito R, Caldwell R, Capelo PR, Caprini C, Cardoso V, Carson Z, Chen H-Y, Chua AJK, Dvorkin I, Haiman Z, Heisenberg L, Isi M, Karnesis N, Kavanagh BJ, Littenberg TB, Mangiagli A, Marcoccia P, Maselli A, Nardini G, Pani P, Peloso M, Pieroni M, Ricciardone A, Sesana A, Tamanini N, Toubiana A, Valiante R, Vretinaris S, Weir DJ, Yagi K, Zimmerman A. 2021. The effect of mission duration on LISA science objectives. General Relativity and Gravitation. 54(1), 3.","mla":"Amaro Seoane, Pau, et al. “The Effect of Mission Duration on LISA Science Objectives.” <i>General Relativity and Gravitation</i>, vol. 54, no. 1, 3, Springer Science and Business Media LLC, 2021, doi:<a href=\"https://doi.org/10.1007/s10714-021-02889-x\">10.1007/s10714-021-02889-x</a>.","chicago":"Amaro Seoane, Pau, Manuel Arca Sedda, Stanislav Babak, Christopher P. L. Berry, Emanuele Berti, Gianfranco Bertone, Diego Blas, et al. “The Effect of Mission Duration on LISA Science Objectives.” <i>General Relativity and Gravitation</i>. Springer Science and Business Media LLC, 2021. <a href=\"https://doi.org/10.1007/s10714-021-02889-x\">https://doi.org/10.1007/s10714-021-02889-x</a>.","ama":"Amaro Seoane P, Arca Sedda M, Babak S, et al. The effect of mission duration on LISA science objectives. <i>General Relativity and Gravitation</i>. 2021;54(1). doi:<a href=\"https://doi.org/10.1007/s10714-021-02889-x\">10.1007/s10714-021-02889-x</a>","short":"P. Amaro Seoane, M. Arca Sedda, S. Babak, C.P.L. Berry, E. Berti, G. Bertone, D. Blas, T. Bogdanović, M. Bonetti, K. Breivik, R. Brito, R. Caldwell, P.R. Capelo, C. Caprini, V. Cardoso, Z. Carson, H.-Y. Chen, A.J.K. Chua, I. Dvorkin, Z. Haiman, L. Heisenberg, M. Isi, N. Karnesis, B.J. Kavanagh, T.B. Littenberg, A. Mangiagli, P. Marcoccia, A. Maselli, G. Nardini, P. Pani, M. Peloso, M. Pieroni, A. Ricciardone, A. Sesana, N. Tamanini, A. Toubiana, R. Valiante, S. Vretinaris, D.J. Weir, K. Yagi, A. Zimmerman, General Relativity and Gravitation 54 (2021)."},"day":"27","intvolume":"        54","scopus_import":"1","article_number":"3","author":[{"first_name":"Pau","last_name":"Amaro Seoane","full_name":"Amaro Seoane, Pau"},{"full_name":"Arca Sedda, Manuel","last_name":"Arca Sedda","first_name":"Manuel"},{"last_name":"Babak","full_name":"Babak, Stanislav","first_name":"Stanislav"},{"first_name":"Christopher P. L.","full_name":"Berry, Christopher P. L.","last_name":"Berry"},{"first_name":"Emanuele","full_name":"Berti, Emanuele","last_name":"Berti"},{"full_name":"Bertone, Gianfranco","last_name":"Bertone","first_name":"Gianfranco"},{"last_name":"Blas","full_name":"Blas, Diego","first_name":"Diego"},{"first_name":"Tamara","last_name":"Bogdanović","full_name":"Bogdanović, Tamara"},{"last_name":"Bonetti","full_name":"Bonetti, Matteo","first_name":"Matteo"},{"last_name":"Breivik","full_name":"Breivik, Katelyn","first_name":"Katelyn"},{"first_name":"Richard","full_name":"Brito, Richard","last_name":"Brito"},{"full_name":"Caldwell, Robert","last_name":"Caldwell","first_name":"Robert"},{"last_name":"Capelo","full_name":"Capelo, Pedro R.","first_name":"Pedro R."},{"full_name":"Caprini, Chiara","last_name":"Caprini","first_name":"Chiara"},{"last_name":"Cardoso","full_name":"Cardoso, Vitor","first_name":"Vitor"},{"full_name":"Carson, Zack","last_name":"Carson","first_name":"Zack"},{"full_name":"Chen, Hsin-Yu","last_name":"Chen","first_name":"Hsin-Yu"},{"first_name":"Alvin J. K.","full_name":"Chua, Alvin J. K.","last_name":"Chua"},{"first_name":"Irina","full_name":"Dvorkin, Irina","last_name":"Dvorkin"},{"full_name":"Haiman, Zoltán","last_name":"Haiman","id":"7c006e8c-cc0d-11ee-8322-cb904ef76f36","first_name":"Zoltán"},{"first_name":"Lavinia","full_name":"Heisenberg, Lavinia","last_name":"Heisenberg"},{"full_name":"Isi, Maximiliano","last_name":"Isi","first_name":"Maximiliano"},{"first_name":"Nikolaos","last_name":"Karnesis","full_name":"Karnesis, Nikolaos"},{"last_name":"Kavanagh","full_name":"Kavanagh, Bradley J.","first_name":"Bradley J."},{"last_name":"Littenberg","full_name":"Littenberg, Tyson B.","first_name":"Tyson B."},{"first_name":"Alberto","full_name":"Mangiagli, Alberto","last_name":"Mangiagli"},{"last_name":"Marcoccia","full_name":"Marcoccia, Paolo","first_name":"Paolo"},{"first_name":"Andrea","last_name":"Maselli","full_name":"Maselli, Andrea"},{"full_name":"Nardini, Germano","last_name":"Nardini","first_name":"Germano"},{"first_name":"Paolo","last_name":"Pani","full_name":"Pani, Paolo"},{"last_name":"Peloso","full_name":"Peloso, Marco","first_name":"Marco"},{"last_name":"Pieroni","full_name":"Pieroni, Mauro","first_name":"Mauro"},{"first_name":"Angelo","full_name":"Ricciardone, Angelo","last_name":"Ricciardone"},{"first_name":"Alberto","full_name":"Sesana, Alberto","last_name":"Sesana"},{"last_name":"Tamanini","full_name":"Tamanini, Nicola","first_name":"Nicola"},{"full_name":"Toubiana, Alexandre","last_name":"Toubiana","first_name":"Alexandre"},{"last_name":"Valiante","full_name":"Valiante, Rosa","first_name":"Rosa"},{"full_name":"Vretinaris, Stamatis","last_name":"Vretinaris","first_name":"Stamatis"},{"first_name":"David J.","full_name":"Weir, David J.","last_name":"Weir"},{"full_name":"Yagi, Kent","last_name":"Yagi","first_name":"Kent"},{"full_name":"Zimmerman, Aaron","last_name":"Zimmerman","first_name":"Aaron"}],"issue":"1","language":[{"iso":"eng"}],"date_updated":"2024-09-23T12:32:50Z","quality_controlled":"1","date_published":"2021-12-27T00:00:00Z","_id":"17593","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1007/s10714-021-02889-x"}],"month":"12","year":"2021","status":"public","title":"The effect of mission duration on LISA science objectives","volume":54},{"publication":"The Astrophysical Journal","abstract":[{"text":"The successive discoveries of binary merger events by Advanced LIGO-Virgo have been revealing the statistical properties of binary black hole (BBH) populations. A stochastic gravitational wave background (GWB) is a useful tool to probe the cosmological evolution of those compact mergers. In this paper, we study the upper bound on a GWB produced by BBH mergers, whose stellar progenitors dominate the reionization process at the cosmic dawn. Since early reionization by those progenitors yields a high optical depth of the universe inconsistent with the {\\it Planck} measurements, the cumulative mass density is limited to ρ⋆≲107 M⊙ Mpc−3. Even with this upper bound, the amplitude of a GWB owing to the high-z BBH mergers is expected to be as high as Ωgw≃1.48+1.80−1.27×10−9 at f≃25 Hz, while their merger rate at the present-day is consistent or lower than the observed GW event rate. This level of GWB is detectable at the design sensitivity of Advanced LIGO-Virgo and would indicate a major contribution of the high-z BBH population to the local GW events. The spectral index is expected to be substantially flatter than the canonical value of ≃2/3 generically produced by lower-redshift and less massive BBHs. Moreover, if their mass function is more top-heavy than in the local universe, the GWB spectrum is even more skewed toward lower frequencies, which would allow us to extract information on the mass function of merging BBHs at high redshifts.","lang":"eng"}],"publication_status":"published","doi":"10.3847/1538-4357/ac106d","extern":"1","publication_identifier":{"issn":["0004-637X","1538-4357"]},"oa_version":"Preprint","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2024-09-05T12:46:25Z","publisher":"American Astronomical Society","article_type":"original","intvolume":"       919","day":"22","citation":{"ista":"Inayoshi K, Kashiyama K, Visbal E, Haiman Z. 2021. Gravitational wave backgrounds from coalescing black hole binaries at cosmic dawn: An upper bound. The Astrophysical Journal. 919(1), 41.","apa":"Inayoshi, K., Kashiyama, K., Visbal, E., &#38; Haiman, Z. (2021). Gravitational wave backgrounds from coalescing black hole binaries at cosmic dawn: An upper bound. <i>The Astrophysical Journal</i>. American Astronomical Society. <a href=\"https://doi.org/10.3847/1538-4357/ac106d\">https://doi.org/10.3847/1538-4357/ac106d</a>","mla":"Inayoshi, Kohei, et al. “Gravitational Wave Backgrounds from Coalescing Black Hole Binaries at Cosmic Dawn: An Upper Bound.” <i>The Astrophysical Journal</i>, vol. 919, no. 1, 41, American Astronomical Society, 2021, doi:<a href=\"https://doi.org/10.3847/1538-4357/ac106d\">10.3847/1538-4357/ac106d</a>.","ieee":"K. Inayoshi, K. Kashiyama, E. Visbal, and Z. Haiman, “Gravitational wave backgrounds from coalescing black hole binaries at cosmic dawn: An upper bound,” <i>The Astrophysical Journal</i>, vol. 919, no. 1. American Astronomical Society, 2021.","short":"K. Inayoshi, K. Kashiyama, E. Visbal, Z. Haiman, The Astrophysical Journal 919 (2021).","ama":"Inayoshi K, Kashiyama K, Visbal E, Haiman Z. Gravitational wave backgrounds from coalescing black hole binaries at cosmic dawn: An upper bound. <i>The Astrophysical Journal</i>. 2021;919(1). doi:<a href=\"https://doi.org/10.3847/1538-4357/ac106d\">10.3847/1538-4357/ac106d</a>","chicago":"Inayoshi, Kohei, Kazumi Kashiyama, Eli Visbal, and Zoltán Haiman. “Gravitational Wave Backgrounds from Coalescing Black Hole Binaries at Cosmic Dawn: An Upper Bound.” <i>The Astrophysical Journal</i>. American Astronomical Society, 2021. <a href=\"https://doi.org/10.3847/1538-4357/ac106d\">https://doi.org/10.3847/1538-4357/ac106d</a>."},"type":"journal_article","article_processing_charge":"No","oa":1,"issue":"1","author":[{"first_name":"Kohei","last_name":"Inayoshi","full_name":"Inayoshi, Kohei"},{"first_name":"Kazumi","full_name":"Kashiyama, Kazumi","last_name":"Kashiyama"},{"first_name":"Eli","last_name":"Visbal","full_name":"Visbal, Eli"},{"first_name":"Zoltán","id":"7c006e8c-cc0d-11ee-8322-cb904ef76f36","full_name":"Haiman, Zoltán","last_name":"Haiman"}],"article_number":"41","scopus_import":"1","external_id":{"arxiv":["2103.12755"]},"main_file_link":[{"open_access":"1","url":" https://doi.org/10.48550/arXiv.2103.12755"}],"_id":"17598","date_published":"2021-09-22T00:00:00Z","quality_controlled":"1","language":[{"iso":"eng"}],"date_updated":"2024-09-23T13:08:15Z","year":"2021","month":"09","status":"public","arxiv":1,"volume":919,"title":"Gravitational wave backgrounds from coalescing black hole binaries at cosmic dawn: An upper bound"},{"article_number":"2144","scopus_import":"1","external_id":{"arxiv":["1810.00162"]},"OA_type":"gold","author":[{"last_name":"Baskin","full_name":"Baskin, Chaim","first_name":"Chaim"},{"full_name":"Zheltonozhkii, Evgenii","last_name":"Zheltonozhkii","first_name":"Evgenii"},{"first_name":"Tal","last_name":"Rozen","full_name":"Rozen, Tal"},{"last_name":"Liss","full_name":"Liss, Natan","first_name":"Natan"},{"last_name":"Chai","full_name":"Chai, Yoav","first_name":"Yoav"},{"last_name":"Schwartz","full_name":"Schwartz, Eli","first_name":"Eli"},{"last_name":"Giryes","full_name":"Giryes, Raja","first_name":"Raja"},{"full_name":"Bronstein, Alexander","last_name":"Bronstein","first_name":"Alexander","orcid":"0000-0001-9699-8730","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6"},{"first_name":"Avi","full_name":"Mendelson, Avi","last_name":"Mendelson"}],"issue":"17","type":"journal_article","article_processing_charge":"No","citation":{"chicago":"Baskin, Chaim, Evgenii Zheltonozhkii, Tal Rozen, Natan Liss, Yoav Chai, Eli Schwartz, Raja Giryes, Alex M. Bronstein, and Avi Mendelson. “NICE: Noise Injection and Clamping Estimation for Neural Network Quantization.” <i>Mathematics</i>. MDPI, 2021. <a href=\"https://doi.org/10.3390/math9172144\">https://doi.org/10.3390/math9172144</a>.","ama":"Baskin C, Zheltonozhkii E, Rozen T, et al. NICE: Noise Injection and Clamping Estimation for neural network quantization. <i>Mathematics</i>. 2021;9(17). doi:<a href=\"https://doi.org/10.3390/math9172144\">10.3390/math9172144</a>","short":"C. Baskin, E. Zheltonozhkii, T. Rozen, N. Liss, Y. Chai, E. Schwartz, R. Giryes, A.M. Bronstein, A. Mendelson, Mathematics 9 (2021).","ieee":"C. Baskin <i>et al.</i>, “NICE: Noise Injection and Clamping Estimation for neural network quantization,” <i>Mathematics</i>, vol. 9, no. 17. MDPI, 2021.","apa":"Baskin, C., Zheltonozhkii, E., Rozen, T., Liss, N., Chai, Y., Schwartz, E., … Mendelson, A. (2021). NICE: Noise Injection and Clamping Estimation for neural network quantization. <i>Mathematics</i>. MDPI. <a href=\"https://doi.org/10.3390/math9172144\">https://doi.org/10.3390/math9172144</a>","ista":"Baskin C, Zheltonozhkii E, Rozen T, Liss N, Chai Y, Schwartz E, Giryes R, Bronstein AM, Mendelson A. 2021. NICE: Noise Injection and Clamping Estimation for neural network quantization. Mathematics. 9(17), 2144.","mla":"Baskin, Chaim, et al. “NICE: Noise Injection and Clamping Estimation for Neural Network Quantization.” <i>Mathematics</i>, vol. 9, no. 17, 2144, MDPI, 2021, doi:<a href=\"https://doi.org/10.3390/math9172144\">10.3390/math9172144</a>."},"day":"02","OA_place":"publisher","intvolume":"         9","publisher":"MDPI","article_type":"original","date_created":"2024-10-08T12:57:24Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","publication_identifier":{"issn":["2227-7390"]},"DOAJ_listed":"1","extern":"1","doi":"10.3390/math9172144","publication":"Mathematics","abstract":[{"lang":"eng","text":"Convolutional Neural Networks (CNNs) are very popular in many fields including computer vision, speech recognition, natural language processing, etc. Though deep learning leads to groundbreaking performance in those domains, the networks used are very computationally demanding and are far from being able to perform in real-time applications even on a GPU, which is not power efficient and therefore does not suit low power systems such as mobile devices. To overcome this challenge, some solutions have been proposed for quantizing the weights and activations of these networks, which accelerate the runtime significantly. Yet, this acceleration comes at the cost of a larger error unless spatial adjustments are carried out. The method proposed in this work trains quantized neural networks by noise injection and a learned clamping, which improve accuracy. This leads to state-of-the-art results on various regression and classification tasks, e.g., ImageNet classification with architectures such as ResNet-18/34/50 with as low as 3 bit weights and activations. We implement the proposed solution on an FPGA to demonstrate its applicability for low-power real-time applications. The quantization code will become publicly available upon acceptance."}],"publication_status":"published","title":"NICE: Noise Injection and Clamping Estimation for neural network quantization","volume":9,"arxiv":1,"status":"public","month":"09","year":"2021","language":[{"iso":"eng"}],"date_updated":"2024-10-15T07:37:39Z","quality_controlled":"1","_id":"18234","date_published":"2021-09-02T00:00:00Z"},{"status":"public","title":"Meeting the unmet needs of clinicians from AI systems showcased for cardiology with deep-learning–based ECG analysis","volume":118,"_id":"18236","date_published":"2021-06-07T00:00:00Z","date_updated":"2024-10-15T07:43:01Z","language":[{"iso":"eng"}],"quality_controlled":"1","year":"2021","month":"06","day":"07","OA_place":"publisher","intvolume":"       118","type":"journal_article","article_processing_charge":"No","citation":{"ieee":"Y. Elul, A. A. Rosenberg, A. Schuster, A. M. Bronstein, and Y. Yaniv, “Meeting the unmet needs of clinicians from AI systems showcased for cardiology with deep-learning–based ECG analysis,” <i>Proceedings of the National Academy of Sciences</i>, vol. 118, no. 24. National Academy of Sciences, 2021.","ista":"Elul Y, Rosenberg AA, Schuster A, Bronstein AM, Yaniv Y. 2021. Meeting the unmet needs of clinicians from AI systems showcased for cardiology with deep-learning–based ECG analysis. Proceedings of the National Academy of Sciences. 118(24), e2020620118.","apa":"Elul, Y., Rosenberg, A. A., Schuster, A., Bronstein, A. M., &#38; Yaniv, Y. (2021). Meeting the unmet needs of clinicians from AI systems showcased for cardiology with deep-learning–based ECG analysis. <i>Proceedings of the National Academy of Sciences</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.2020620118\">https://doi.org/10.1073/pnas.2020620118</a>","mla":"Elul, Yonatan, et al. “Meeting the Unmet Needs of Clinicians from AI Systems Showcased for Cardiology with Deep-Learning–Based ECG Analysis.” <i>Proceedings of the National Academy of Sciences</i>, vol. 118, no. 24, e2020620118, National Academy of Sciences, 2021, doi:<a href=\"https://doi.org/10.1073/pnas.2020620118\">10.1073/pnas.2020620118</a>.","chicago":"Elul, Yonatan, Aviv A. Rosenberg, Assaf Schuster, Alex M. Bronstein, and Yael Yaniv. “Meeting the Unmet Needs of Clinicians from AI Systems Showcased for Cardiology with Deep-Learning–Based ECG Analysis.” <i>Proceedings of the National Academy of Sciences</i>. National Academy of Sciences, 2021. <a href=\"https://doi.org/10.1073/pnas.2020620118\">https://doi.org/10.1073/pnas.2020620118</a>.","ama":"Elul Y, Rosenberg AA, Schuster A, Bronstein AM, Yaniv Y. Meeting the unmet needs of clinicians from AI systems showcased for cardiology with deep-learning–based ECG analysis. <i>Proceedings of the National Academy of Sciences</i>. 2021;118(24). doi:<a href=\"https://doi.org/10.1073/pnas.2020620118\">10.1073/pnas.2020620118</a>","short":"Y. Elul, A.A. Rosenberg, A. Schuster, A.M. Bronstein, Y. Yaniv, Proceedings of the National Academy of Sciences 118 (2021)."},"issue":"24","scopus_import":"1","article_number":"e2020620118","external_id":{"pmid":["34099565"]},"OA_type":"free access","author":[{"full_name":"Elul, Yonatan","last_name":"Elul","first_name":"Yonatan"},{"full_name":"Rosenberg, Aviv A.","last_name":"Rosenberg","first_name":"Aviv A."},{"first_name":"Assaf","full_name":"Schuster, Assaf","last_name":"Schuster"},{"last_name":"Bronstein","full_name":"Bronstein, Alexander","orcid":"0000-0001-9699-8730","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","first_name":"Alexander"},{"last_name":"Yaniv","full_name":"Yaniv, Yael","first_name":"Yael"}],"extern":"1","doi":"10.1073/pnas.2020620118","abstract":[{"text":"Despite their great promise, artificial intelligence (AI) systems have yet to become ubiquitous in the daily practice of medicine largely due to several crucial unmet needs of healthcare practitioners. These include lack of explanations in clinically meaningful terms, handling the presence of unknown medical conditions, and transparency regarding the system’s limitations, both in terms of statistical performance as well as recognizing situations for which the system’s predictions are irrelevant. We articulate these unmet clinical needs as machine-learning (ML) problems and systematically address them with cutting-edge ML techniques. We focus on electrocardiogram (ECG) analysis as an example domain in which AI has great potential and tackle two challenging tasks: the detection of a heterogeneous mix of known and unknown arrhythmias from ECG and the identification of underlying cardio-pathology from segments annotated as normal sinus rhythm recorded in patients with an intermittent arrhythmia. We validate our methods by simulating a screening for arrhythmias in a large-scale population while adhering to statistical significance requirements. Specifically, our system 1) visualizes the relative importance of each part of an ECG segment for the final model decision; 2) upholds specified statistical constraints on its out-of-sample performance and provides uncertainty estimation for its predictions; 3) handles inputs containing unknown rhythm types; and 4) handles data from unseen patients while also flagging cases in which the model’s outputs are not usable for a specific patient. This work represents a significant step toward overcoming the limitations currently impeding the integration of AI into clinical practice in cardiology and medicine in general.","lang":"eng"}],"publication":"Proceedings of the National Academy of Sciences","publication_status":"published","oa_version":"Published Version","pmid":1,"publication_identifier":{"eissn":["1091-6490"],"issn":["0027-8424"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"National Academy of Sciences","article_type":"original","date_created":"2024-10-08T12:58:09Z"},{"year":"2021","conference":{"location":"Lima, Peru/Virtual","end_date":"2020-10-08","name":"MICCAI: Conference on Medical Image Computing and Computer-Assisted Intervention","start_date":"2020-10-08"},"related_material":{"link":[{"url":"https://github.com/tomer196/Learned_dMRI","relation":"software"}]},"month":"09","alternative_title":["Mathematics and Visualization"],"_id":"18242","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2009.03008","open_access":"1"}],"date_published":"2021-09-30T00:00:00Z","date_updated":"2024-10-16T09:51:45Z","language":[{"iso":"eng"}],"editor":[{"first_name":"Noemi","last_name":"Gyori","full_name":"Gyori, Noemi"},{"last_name":"Hutter","full_name":"Hutter, Jana","first_name":"Jana"},{"first_name":"Vishwesh","full_name":"Nath, Vishwesh","last_name":"Nath"},{"full_name":"Palombo, Marco","last_name":"Palombo","first_name":"Marco"},{"full_name":"Pizzolato, Marco","last_name":"Pizzolato","first_name":"Marco"},{"last_name":"Zhang","full_name":"Zhang, Fan","first_name":"Fan"}],"quality_controlled":"1","title":"Towards learned optimal q-space sampling in diffusion MRI","status":"public","arxiv":1,"page":"13-28","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Springer Nature","date_created":"2024-10-08T13:03:26Z","place":"Cham","doi":"10.1007/978-3-030-73018-5_2","extern":"1","abstract":[{"text":"Fiber tractography is an important tool of computational neuroscience that enables reconstructing the spatial connectivity and organization of white matter of the brain. Fiber tractography takes advantage of diffusion Magnetic Resonance Imaging (dMRI) which allows measuring the apparent diffusivity of cerebral water along different spatial directions. Unfortunately, collecting such data comes at the price of reduced spatial resolution and substantially elevated acquisition times, which limits the clinical applicability of dMRI. This problem has been thus far addressed using two principal strategies. Most of the efforts have been extended towards improving the quality of signal estimation for any, yet fixed sampling scheme (defined through the choice of diffusion-encoding gradients). On the other hand, optimization over the sampling scheme has also proven to be effective. Inspired by the previous results, the present work consolidates the above strategies into a unified estimation framework, in which the optimization is carried out with respect to both estimation model and sampling design concurrently. The proposed solution offers substantial improvements in the quality of signal estimation as well as the accuracy of ensuing analysis by means of fiber tractography. While proving the optimality of the learned estimation models would probably need more extensive evaluation, we nevertheless claim that the learned sampling schemes can be of immediate use, offering a way to improve the dMRI analysis without the necessity of deploying the neural network used for their estimation. We present a comprehensive comparative analysis based on the Human Connectome Project data. Code and learned sampling designs available at https://github.com/tomer196/Learned_dMRI.","lang":"eng"}],"publication":"Computational Diffusion MRI","publication_status":"published","publication_identifier":{"isbn":["9783030730178"],"eisbn":["9783030730185"],"issn":["1612-3786"]},"oa_version":"Preprint","scopus_import":"1","external_id":{"arxiv":["2009.03008"]},"OA_type":"green","author":[{"last_name":"Weiss","full_name":"Weiss, Tomer","first_name":"Tomer"},{"first_name":"Sanketh","last_name":"Vedula","full_name":"Vedula, Sanketh"},{"last_name":"Senouf","full_name":"Senouf, Ortal","first_name":"Ortal"},{"first_name":"Oleg","full_name":"Michailovich, Oleg","last_name":"Michailovich"},{"orcid":"0000-0001-9699-8730","first_name":"Alexander","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","last_name":"Bronstein","full_name":"Bronstein, Alexander"}],"day":"30","OA_place":"repository","type":"book_chapter","article_processing_charge":"No","oa":1,"citation":{"short":"T. Weiss, S. Vedula, O. Senouf, O. Michailovich, A.M. Bronstein, in:, N. Gyori, J. Hutter, V. Nath, M. Palombo, M. Pizzolato, F. Zhang (Eds.), Computational Diffusion MRI, Springer Nature, Cham, 2021, pp. 13–28.","ama":"Weiss T, Vedula S, Senouf O, Michailovich O, Bronstein AM. Towards learned optimal q-space sampling in diffusion MRI. In: Gyori N, Hutter J, Nath V, Palombo M, Pizzolato M, Zhang F, eds. <i>Computational Diffusion MRI</i>. Cham: Springer Nature; 2021:13-28. doi:<a href=\"https://doi.org/10.1007/978-3-030-73018-5_2\">10.1007/978-3-030-73018-5_2</a>","chicago":"Weiss, Tomer, Sanketh Vedula, Ortal Senouf, Oleg Michailovich, and Alex M. Bronstein. “Towards Learned Optimal Q-Space Sampling in Diffusion MRI.” In <i>Computational Diffusion MRI</i>, edited by Noemi Gyori, Jana Hutter, Vishwesh Nath, Marco Palombo, Marco Pizzolato, and Fan Zhang, 13–28. Cham: Springer Nature, 2021. <a href=\"https://doi.org/10.1007/978-3-030-73018-5_2\">https://doi.org/10.1007/978-3-030-73018-5_2</a>.","apa":"Weiss, T., Vedula, S., Senouf, O., Michailovich, O., &#38; Bronstein, A. M. (2021). Towards learned optimal q-space sampling in diffusion MRI. In N. Gyori, J. Hutter, V. Nath, M. Palombo, M. Pizzolato, &#38; F. Zhang (Eds.), <i>Computational Diffusion MRI</i> (pp. 13–28). Cham: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-73018-5_2\">https://doi.org/10.1007/978-3-030-73018-5_2</a>","ista":"Weiss T, Vedula S, Senouf O, Michailovich O, Bronstein AM. 2021.Towards learned optimal q-space sampling in diffusion MRI. In: Computational Diffusion MRI. Mathematics and Visualization, , 13–28.","mla":"Weiss, Tomer, et al. “Towards Learned Optimal Q-Space Sampling in Diffusion MRI.” <i>Computational Diffusion MRI</i>, edited by Noemi Gyori et al., Springer Nature, 2021, pp. 13–28, doi:<a href=\"https://doi.org/10.1007/978-3-030-73018-5_2\">10.1007/978-3-030-73018-5_2</a>.","ieee":"T. Weiss, S. Vedula, O. Senouf, O. Michailovich, and A. M. Bronstein, “Towards learned optimal q-space sampling in diffusion MRI,” in <i>Computational Diffusion MRI</i>, N. Gyori, J. Hutter, V. Nath, M. Palombo, M. Pizzolato, and F. Zhang, Eds. Cham: Springer Nature, 2021, pp. 13–28."}},{"day":"19","intvolume":"     12858","type":"conference","article_processing_charge":"No","citation":{"chicago":"Hermanns, Judith, Anton Tsitsulin, Marina Munkhoeva, Alex M. Bronstein, Davide Mottin, and Panagiotis Karras. “GRASP: Graph Alignment through Spectral Signatures.” In <i>International Joint Conference on Asia-Pacific Web and Web-Age Information Management</i>, 12858:44–52. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/978-3-030-85896-4_4\">https://doi.org/10.1007/978-3-030-85896-4_4</a>.","ama":"Hermanns J, Tsitsulin A, Munkhoeva M, Bronstein AM, Mottin D, Karras P. GRASP: Graph alignment through spectral signatures. In: <i>International Joint Conference on Asia-Pacific Web and Web-Age Information Management</i>. Vol 12858. Springer Nature; 2021:44-52. doi:<a href=\"https://doi.org/10.1007/978-3-030-85896-4_4\">10.1007/978-3-030-85896-4_4</a>","short":"J. Hermanns, A. Tsitsulin, M. Munkhoeva, A.M. Bronstein, D. Mottin, P. Karras, in:, International Joint Conference on Asia-Pacific Web and Web-Age Information Management, Springer Nature, 2021, pp. 44–52.","ieee":"J. Hermanns, A. Tsitsulin, M. Munkhoeva, A. M. Bronstein, D. Mottin, and P. Karras, “GRASP: Graph alignment through spectral signatures,” in <i>International Joint Conference on Asia-Pacific Web and Web-Age Information Management</i>, Guangzhou, China, 2021, vol. 12858, no. Part I, pp. 44–52.","mla":"Hermanns, Judith, et al. “GRASP: Graph Alignment through Spectral Signatures.” <i>International Joint Conference on Asia-Pacific Web and Web-Age Information Management</i>, vol. 12858, no. Part I, Springer Nature, 2021, pp. 44–52, doi:<a href=\"https://doi.org/10.1007/978-3-030-85896-4_4\">10.1007/978-3-030-85896-4_4</a>.","apa":"Hermanns, J., Tsitsulin, A., Munkhoeva, M., Bronstein, A. M., Mottin, D., &#38; Karras, P. (2021). GRASP: Graph alignment through spectral signatures. In <i>International Joint Conference on Asia-Pacific Web and Web-Age Information Management</i> (Vol. 12858, pp. 44–52). Guangzhou, China: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-85896-4_4\">https://doi.org/10.1007/978-3-030-85896-4_4</a>","ista":"Hermanns J, Tsitsulin A, Munkhoeva M, Bronstein AM, Mottin D, Karras P. 2021. GRASP: Graph alignment through spectral signatures. International Joint Conference on Asia-Pacific Web and Web-Age Information Management. APWeb-WAIM: International Joint Conference on Asia-Pacific Web and Web-Age Information Management, LNCS, vol. 12858, 44–52."},"issue":"Part I","scopus_import":"1","author":[{"last_name":"Hermanns","full_name":"Hermanns, Judith","first_name":"Judith"},{"first_name":"Anton","last_name":"Tsitsulin","full_name":"Tsitsulin, Anton"},{"last_name":"Munkhoeva","full_name":"Munkhoeva, Marina","first_name":"Marina"},{"full_name":"Bronstein, Alexander","last_name":"Bronstein","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","orcid":"0000-0001-9699-8730","first_name":"Alexander"},{"first_name":"Davide","last_name":"Mottin","full_name":"Mottin, Davide"},{"last_name":"Karras","full_name":"Karras, Panagiotis","first_name":"Panagiotis"}],"doi":"10.1007/978-3-030-85896-4_4","extern":"1","publication":"International Joint Conference on Asia-Pacific Web and Web-Age Information Management","abstract":[{"text":"What is the best way to match the nodes of two graphs? This graph alignment problem generalizes graph isomorphism and arises in applications from social network analysis to bioinformatics. Existing solutions either require auxiliary information such as node attributes, or provide a single-scale view of the graph by translating the problem into aligning node embeddings.\r\n\r\nIn this paper, we transfer the shape-analysis concept of functional maps from the continuous to the discrete case, and treat the graph alignment problem as a special case of the problem of finding a mapping between functions on graphs. We present GRASP, a method that captures multiscale structural characteristics from the eigenvectors of the graph’s Laplacian and uses this information to align two graphs.Our experimental study, featuring noise levels higher than anything used in previous studies, shows that GRASP outperforms state-of-the-art methods for graph alignment across noise levels and graph types.","lang":"eng"}],"publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783030858957","9783030858964"]},"oa_version":"None","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publisher":"Springer Nature","date_created":"2024-10-08T13:03:44Z","status":"public","page":"44 - 52","title":"GRASP: Graph alignment through spectral signatures","volume":12858,"alternative_title":["LNCS"],"_id":"18243","date_published":"2021-08-19T00:00:00Z","date_updated":"2025-01-29T09:57:31Z","language":[{"iso":"eng"}],"quality_controlled":"1","year":"2021","conference":{"location":"Guangzhou, China","name":"APWeb-WAIM: International Joint Conference on Asia-Pacific Web and Web-Age Information Management","start_date":"2021-08-23","end_date":"2021-08-25"},"month":"08"},{"oa_version":"Published Version","publication_identifier":{"eissn":["1432-0444"],"issn":["0179-5376"]},"doi":"10.1007/s00454-020-00206-y","publication":"Discrete and Computational Geometry","file":[{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_size":1013730,"date_created":"2020-11-25T09:06:41Z","date_updated":"2020-11-25T09:06:41Z","creator":"dernst","file_id":"8803","checksum":"487a84ea5841b75f04f66d7ebd71b67e","success":1,"file_name":"2020_DiscreteCompGeometry_Brown.pdf"}],"abstract":[{"text":"We investigate a sheaf-theoretic interpretation of stratification learning from geometric and topological perspectives. Our main result is the construction of stratification learning algorithms framed in terms of a sheaf on a partially ordered set with the Alexandroff topology. We prove that the resulting decomposition is the unique minimal stratification for which the strata are homogeneous and the given sheaf is constructible. In particular, when we choose to work with the local homology sheaf, our algorithm gives an alternative to the local homology transfer algorithm given in Bendich et al. (Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1355–1370, ACM, New York, 2012), and the cohomology stratification algorithm given in Nanda (Found. Comput. Math. 20(2), 195–222, 2020). Additionally, we give examples of stratifications based on the geometric techniques of Breiding et al. (Rev. Mat. Complut. 31(3), 545–593, 2018), illustrating how the sheaf-theoretic approach can be used to study stratifications from both topological and geometric perspectives. This approach also points toward future applications of sheaf theory in the study of topological data analysis by illustrating the utility of the language of sheaf theory in generalizing existing algorithms.","lang":"eng"}],"publication_status":"published","publisher":"Springer Nature","article_type":"original","date_created":"2020-05-30T10:26:04Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","type":"journal_article","article_processing_charge":"Yes (via OA deal)","oa":1,"citation":{"ama":"Brown A, Wang B. Sheaf-theoretic stratification learning from geometric and topological perspectives. <i>Discrete and Computational Geometry</i>. 2021;65:1166-1198. doi:<a href=\"https://doi.org/10.1007/s00454-020-00206-y\">10.1007/s00454-020-00206-y</a>","short":"A. Brown, B. Wang, Discrete and Computational Geometry 65 (2021) 1166–1198.","chicago":"Brown, Adam, and Bei Wang. “Sheaf-Theoretic Stratification Learning from Geometric and Topological Perspectives.” <i>Discrete and Computational Geometry</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/s00454-020-00206-y\">https://doi.org/10.1007/s00454-020-00206-y</a>.","apa":"Brown, A., &#38; Wang, B. (2021). Sheaf-theoretic stratification learning from geometric and topological perspectives. <i>Discrete and Computational Geometry</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00454-020-00206-y\">https://doi.org/10.1007/s00454-020-00206-y</a>","ista":"Brown A, Wang B. 2021. Sheaf-theoretic stratification learning from geometric and topological perspectives. Discrete and Computational Geometry. 65, 1166–1198.","mla":"Brown, Adam, and Bei Wang. “Sheaf-Theoretic Stratification Learning from Geometric and Topological Perspectives.” <i>Discrete and Computational Geometry</i>, vol. 65, Springer Nature, 2021, pp. 1166–98, doi:<a href=\"https://doi.org/10.1007/s00454-020-00206-y\">10.1007/s00454-020-00206-y</a>.","ieee":"A. Brown and B. Wang, “Sheaf-theoretic stratification learning from geometric and topological perspectives,” <i>Discrete and Computational Geometry</i>, vol. 65. Springer Nature, pp. 1166–1198, 2021."},"day":"01","file_date_updated":"2020-11-25T09:06:41Z","intvolume":"        65","scopus_import":"1","external_id":{"arxiv":["1712.07734"],"isi":["000536324700001"]},"isi":1,"author":[{"id":"70B7FDF6-608D-11E9-9333-8535E6697425","first_name":"Adam","last_name":"Brown","full_name":"Brown, Adam"},{"last_name":"Wang","full_name":"Wang, Bei","first_name":"Bei"}],"project":[{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}],"acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria). This work was partially supported by NSF IIS-1513616 and NSF ABI-1661375. The authors would like to thank the anonymous referees for their insightful comments.","department":[{"_id":"HeEd"}],"date_updated":"2025-04-15T06:53:15Z","language":[{"iso":"eng"}],"quality_controlled":"1","_id":"7905","date_published":"2021-06-01T00:00:00Z","month":"06","has_accepted_license":"1","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"year":"2021","ddc":["510"],"arxiv":1,"corr_author":"1","page":"1166-1198","status":"public","title":"Sheaf-theoretic stratification learning from geometric and topological perspectives","volume":65},{"ec_funded":1,"department":[{"_id":"HeEd"}],"acknowledgement":"This research was supported by the DFG Collaborative Research Center TRR 109 “Discretization in Geometry and Dynamics”. W.K.S. was also supported by the Australian Research Council (DP1401000851). A.V.A. was also supported by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant Agreement No. 78818 Alpha).","project":[{"_id":"266A2E9E-B435-11E9-9278-68D0E5697425","grant_number":"788183","name":"Alpha Shape Theory Extended","call_identifier":"H2020"}],"author":[{"id":"430D2C90-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2548-617X","first_name":"Arseniy","last_name":"Akopyan","full_name":"Akopyan, Arseniy"},{"first_name":"Alexander I.","last_name":"Bobenko","full_name":"Bobenko, Alexander I."},{"full_name":"Schief, Wolfgang K.","last_name":"Schief","first_name":"Wolfgang K."},{"first_name":"Jan","full_name":"Techter, Jan","last_name":"Techter"}],"isi":1,"external_id":{"isi":["000564488500002"],"arxiv":["1908.00856"]},"scopus_import":"1","intvolume":"        66","day":"01","citation":{"ama":"Akopyan A, Bobenko AI, Schief WK, Techter J. On mutually diagonal nets on (confocal) quadrics and 3-dimensional webs. <i>Discrete and Computational Geometry</i>. 2021;66:938-976. doi:<a href=\"https://doi.org/10.1007/s00454-020-00240-w\">10.1007/s00454-020-00240-w</a>","short":"A. Akopyan, A.I. Bobenko, W.K. Schief, J. Techter, Discrete and Computational Geometry 66 (2021) 938–976.","chicago":"Akopyan, Arseniy, Alexander I. Bobenko, Wolfgang K. Schief, and Jan Techter. “On Mutually Diagonal Nets on (Confocal) Quadrics and 3-Dimensional Webs.” <i>Discrete and Computational Geometry</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/s00454-020-00240-w\">https://doi.org/10.1007/s00454-020-00240-w</a>.","mla":"Akopyan, Arseniy, et al. “On Mutually Diagonal Nets on (Confocal) Quadrics and 3-Dimensional Webs.” <i>Discrete and Computational Geometry</i>, vol. 66, Springer Nature, 2021, pp. 938–76, doi:<a href=\"https://doi.org/10.1007/s00454-020-00240-w\">10.1007/s00454-020-00240-w</a>.","ista":"Akopyan A, Bobenko AI, Schief WK, Techter J. 2021. On mutually diagonal nets on (confocal) quadrics and 3-dimensional webs. Discrete and Computational Geometry. 66, 938–976.","apa":"Akopyan, A., Bobenko, A. I., Schief, W. K., &#38; Techter, J. (2021). On mutually diagonal nets on (confocal) quadrics and 3-dimensional webs. <i>Discrete and Computational Geometry</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00454-020-00240-w\">https://doi.org/10.1007/s00454-020-00240-w</a>","ieee":"A. Akopyan, A. I. Bobenko, W. K. Schief, and J. Techter, “On mutually diagonal nets on (confocal) quadrics and 3-dimensional webs,” <i>Discrete and Computational Geometry</i>, vol. 66. Springer Nature, pp. 938–976, 2021."},"oa":1,"type":"journal_article","article_processing_charge":"No","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_created":"2020-09-06T22:01:13Z","publisher":"Springer Nature","article_type":"original","publication_status":"published","publication":"Discrete and Computational Geometry","abstract":[{"lang":"eng","text":"Canonical parametrisations of classical confocal coordinate systems are introduced and exploited to construct non-planar analogues of incircular (IC) nets on individual quadrics and systems of confocal quadrics. Intimate connections with classical deformations of quadrics that are isometric along asymptotic lines and circular cross-sections of quadrics are revealed. The existence of octahedral webs of surfaces of Blaschke type generated by asymptotic and characteristic lines that are diagonally related to lines of curvature is proved theoretically and established constructively. Appropriate samplings (grids) of these webs lead to three-dimensional extensions of non-planar IC nets. Three-dimensional octahedral grids composed of planes and spatially extending (checkerboard) IC-nets are shown to arise in connection with systems of confocal quadrics in Minkowski space. In this context, the Laguerre geometric notion of conical octahedral grids of planes is introduced. The latter generalise the octahedral grids derived from systems of confocal quadrics in Minkowski space. An explicit construction of conical octahedral grids is presented. The results are accompanied by various illustrations which are based on the explicit formulae provided by the theory."}],"doi":"10.1007/s00454-020-00240-w","oa_version":"Preprint","publication_identifier":{"eissn":["1432-0444"],"issn":["0179-5376"]},"volume":66,"title":"On mutually diagonal nets on (confocal) quadrics and 3-dimensional webs","status":"public","page":"938-976","arxiv":1,"year":"2021","month":"10","date_published":"2021-10-01T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1908.00856"}],"_id":"8338","quality_controlled":"1","language":[{"iso":"eng"}],"date_updated":"2025-04-14T07:48:36Z"},{"main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8221757/","open_access":"1"}],"_id":"8730","date_published":"2021-07-01T00:00:00Z","date_updated":"2026-06-18T19:36:17Z","language":[{"iso":"eng"}],"quality_controlled":"1","year":"2021","ddc":["570"],"month":"07","status":"public","page":"1634-1646","title":"Complete inhibition of ABCB1 and ABCG2 at the blood-brain barrier by co-infusion of erlotinib and tariquidar to improve brain delivery of the model ABCB1/ABCG2 substrate [11C]erlotinib","volume":41,"doi":"10.1177/0271678X20965500","abstract":[{"lang":"eng","text":"P-glycoprotein (ABCB1) and breast cancer resistance protein (ABCG2) restrict at the blood–brain barrier (BBB) the brain distribution of the majority of currently known molecularly targeted anticancer drugs. To improve brain delivery of dual ABCB1/ABCG2 substrates, both ABCB1 and ABCG2 need to be inhibited simultaneously at the BBB. We examined the feasibility of simultaneous ABCB1/ABCG2 inhibition with i.v. co-infusion of erlotinib and tariquidar by studying brain distribution of the model ABCB1/ABCG2 substrate [11C]erlotinib in mice and rhesus macaques with PET. Tolerability of the erlotinib/tariquidar combination was assessed in human embryonic stem cell-derived cerebral organoids. In mice and macaques, baseline brain distribution of [11C]erlotinib was low (brain distribution volume, VT,brain < 0.3 mL/cm3). Co-infusion of erlotinib and tariquidar increased VT,brain in mice by 3.0-fold and in macaques by 3.4- to 5.0-fold, while infusion of erlotinib alone or tariquidar alone led to less pronounced VT,brain increases in both species. Treatment of cerebral organoids with erlotinib/tariquidar led to an induction of Caspase-3-dependent apoptosis. Co-infusion of erlotinib/tariquidar may potentially allow for complete ABCB1/ABCG2 inhibition at the BBB, while simultaneously achieving brain-targeted EGFR inhibition. Our protocol may be applicable to enhance brain delivery of molecularly targeted anticancer drugs for a more effective treatment of brain tumors."}],"publication":"Journal of Cerebral Blood Flow and Metabolism","publication_status":"published","oa_version":"Published Version","publication_identifier":{"eissn":["1559-7016"],"issn":["0271-678x"]},"pmid":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_type":"original","publisher":"SAGE Publications","date_created":"2020-11-06T08:39:01Z","day":"01","intvolume":"        41","type":"journal_article","article_processing_charge":"No","oa":1,"citation":{"chicago":"Tournier, N, S Goutal, S Mairinger, IH Lozano, T Filip, M Sauberer, F Caillé, et al. “Complete Inhibition of ABCB1 and ABCG2 at the Blood-Brain Barrier by Co-Infusion of Erlotinib and Tariquidar to Improve Brain Delivery of the Model ABCB1/ABCG2 Substrate [11C]Erlotinib.” <i>Journal of Cerebral Blood Flow and Metabolism</i>. SAGE Publications, 2021. <a href=\"https://doi.org/10.1177/0271678X20965500\">https://doi.org/10.1177/0271678X20965500</a>.","ama":"Tournier N, Goutal S, Mairinger S, et al. Complete inhibition of ABCB1 and ABCG2 at the blood-brain barrier by co-infusion of erlotinib and tariquidar to improve brain delivery of the model ABCB1/ABCG2 substrate [11C]erlotinib. <i>Journal of Cerebral Blood Flow and Metabolism</i>. 2021;41(7):1634-1646. doi:<a href=\"https://doi.org/10.1177/0271678X20965500\">10.1177/0271678X20965500</a>","short":"N. Tournier, S. Goutal, S. Mairinger, I. Lozano, T. Filip, M. Sauberer, F. Caillé, L. Breuil, J. Stanek, A. Freeman, G. Novarino, C. Truillet, T. Wanek, O. Langer, Journal of Cerebral Blood Flow and Metabolism 41 (2021) 1634–1646.","ieee":"N. Tournier <i>et al.</i>, “Complete inhibition of ABCB1 and ABCG2 at the blood-brain barrier by co-infusion of erlotinib and tariquidar to improve brain delivery of the model ABCB1/ABCG2 substrate [11C]erlotinib,” <i>Journal of Cerebral Blood Flow and Metabolism</i>, vol. 41, no. 7. SAGE Publications, pp. 1634–1646, 2021.","mla":"Tournier, N., et al. “Complete Inhibition of ABCB1 and ABCG2 at the Blood-Brain Barrier by Co-Infusion of Erlotinib and Tariquidar to Improve Brain Delivery of the Model ABCB1/ABCG2 Substrate [11C]Erlotinib.” <i>Journal of Cerebral Blood Flow and Metabolism</i>, vol. 41, no. 7, SAGE Publications, 2021, pp. 1634–46, doi:<a href=\"https://doi.org/10.1177/0271678X20965500\">10.1177/0271678X20965500</a>.","apa":"Tournier, N., Goutal, S., Mairinger, S., Lozano, I., Filip, T., Sauberer, M., … Langer, O. (2021). Complete inhibition of ABCB1 and ABCG2 at the blood-brain barrier by co-infusion of erlotinib and tariquidar to improve brain delivery of the model ABCB1/ABCG2 substrate [11C]erlotinib. <i>Journal of Cerebral Blood Flow and Metabolism</i>. SAGE Publications. <a href=\"https://doi.org/10.1177/0271678X20965500\">https://doi.org/10.1177/0271678X20965500</a>","ista":"Tournier N, Goutal S, Mairinger S, Lozano I, Filip T, Sauberer M, Caillé F, Breuil L, Stanek J, Freeman A, Novarino G, Truillet C, Wanek T, Langer O. 2021. Complete inhibition of ABCB1 and ABCG2 at the blood-brain barrier by co-infusion of erlotinib and tariquidar to improve brain delivery of the model ABCB1/ABCG2 substrate [11C]erlotinib. Journal of Cerebral Blood Flow and Metabolism. 41(7), 1634–1646."},"issue":"7","department":[{"_id":"GaNo"}],"scopus_import":"1","isi":1,"external_id":{"pmid":["33081568"],"isi":["000664214100012"]},"author":[{"last_name":"Tournier","full_name":"Tournier, N","first_name":"N"},{"full_name":"Goutal, S","last_name":"Goutal","first_name":"S"},{"first_name":"S","last_name":"Mairinger","full_name":"Mairinger, S"},{"full_name":"Lozano, IH","last_name":"Lozano","first_name":"IH"},{"full_name":"Filip, T","last_name":"Filip","first_name":"T"},{"last_name":"Sauberer","full_name":"Sauberer, M","first_name":"M"},{"last_name":"Caillé","full_name":"Caillé, F","first_name":"F"},{"last_name":"Breuil","full_name":"Breuil, L","first_name":"L"},{"full_name":"Stanek, J","last_name":"Stanek","first_name":"J"},{"first_name":"AF","last_name":"Freeman","full_name":"Freeman, AF"},{"id":"3E57A680-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7673-7178","first_name":"Gaia","full_name":"Novarino, Gaia","last_name":"Novarino"},{"first_name":"C","full_name":"Truillet, C","last_name":"Truillet"},{"first_name":"T","full_name":"Wanek, T","last_name":"Wanek"},{"full_name":"Langer, O","last_name":"Langer","first_name":"O"}]},{"language":[{"iso":"eng"}],"date_updated":"2024-10-21T06:02:09Z","quality_controlled":"1","_id":"8824","date_published":"2021-01-11T00:00:00Z","month":"01","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"has_accepted_license":"1","ddc":["570"],"year":"2021","status":"public","title":"Auxin-regulated reversible inhibition of TMK1 signaling by MAKR2 modulates the dynamics of root gravitropism","volume":31,"pmid":1,"publication_identifier":{"issn":["0960-9822"],"eissn":["1879-0445"]},"oa_version":"Published Version","doi":"10.1016/j.cub.2020.10.011","file":[{"date_updated":"2021-02-04T11:37:50Z","creator":"dernst","file_id":"9090","checksum":"30b3393d841fb2b1e2b22fb42b5c8fff","success":1,"file_name":"2021_CurrentBiology_MarquesBueno.pdf","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_size":3458646,"date_created":"2021-02-04T11:37:50Z"}],"publication":"Current Biology","abstract":[{"text":"Plants are able to orient their growth according to gravity, which ultimately controls both shoot and root architecture.1 Gravitropism is a dynamic process whereby gravistimulation induces the asymmetric distribution of the plant hormone auxin, leading to asymmetric growth, organ bending, and subsequent reset of auxin distribution back to the original pre-gravistimulation situation.1,  2,  3 Differential auxin accumulation during the gravitropic response depends on the activity of polarly localized PIN-FORMED (PIN) auxin-efflux carriers.1,  2,  3,  4 In particular, the timing of this dynamic response is regulated by PIN2,5,6 but the underlying molecular mechanisms are poorly understood. Here, we show that MEMBRANE ASSOCIATED KINASE REGULATOR2 (MAKR2) controls the pace of the root gravitropic response. We found that MAKR2 is required for the PIN2 asymmetry during gravitropism by acting as a negative regulator of the cell-surface signaling mediated by the receptor-like kinase TRANSMEMBRANE KINASE1 (TMK1).2,7,  8,  9,  10 Furthermore, we show that the MAKR2 inhibitory effect on TMK1 signaling is antagonized by auxin itself, which triggers rapid MAKR2 membrane dissociation in a TMK1-dependent manner. Our findings suggest that the timing of the root gravitropic response is orchestrated by the reversible inhibition of the TMK1 signaling pathway at the cell surface.","lang":"eng"}],"publication_status":"published","article_type":"original","publisher":"Elsevier","date_created":"2020-12-01T13:39:46Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"Yes (via OA deal)","type":"journal_article","oa":1,"citation":{"ieee":"M. Marquès-Bueno <i>et al.</i>, “Auxin-regulated reversible inhibition of TMK1 signaling by MAKR2 modulates the dynamics of root gravitropism,” <i>Current Biology</i>, vol. 31, no. 1. Elsevier, 2021.","mla":"Marquès-Bueno, MM, et al. “Auxin-Regulated Reversible Inhibition of TMK1 Signaling by MAKR2 Modulates the Dynamics of Root Gravitropism.” <i>Current Biology</i>, vol. 31, no. 1, Elsevier, 2021, doi:<a href=\"https://doi.org/10.1016/j.cub.2020.10.011\">10.1016/j.cub.2020.10.011</a>.","ista":"Marquès-Bueno M, Armengot L, Noack L, Bareille J, Rodriguez Solovey L, Platre M, Bayle V, Liu M, Opdenacker D, Vanneste S, Möller B, Nimchuk Z, Beeckman T, Caño-Delgado A, Friml J, Jaillais Y. 2021. Auxin-regulated reversible inhibition of TMK1 signaling by MAKR2 modulates the dynamics of root gravitropism. Current Biology. 31(1).","apa":"Marquès-Bueno, M., Armengot, L., Noack, L., Bareille, J., Rodriguez Solovey, L., Platre, M., … Jaillais, Y. (2021). Auxin-regulated reversible inhibition of TMK1 signaling by MAKR2 modulates the dynamics of root gravitropism. <i>Current Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.cub.2020.10.011\">https://doi.org/10.1016/j.cub.2020.10.011</a>","chicago":"Marquès-Bueno, MM, L Armengot, LC Noack, J Bareille, Lesia Rodriguez Solovey, MP Platre, V Bayle, et al. “Auxin-Regulated Reversible Inhibition of TMK1 Signaling by MAKR2 Modulates the Dynamics of Root Gravitropism.” <i>Current Biology</i>. Elsevier, 2021. <a href=\"https://doi.org/10.1016/j.cub.2020.10.011\">https://doi.org/10.1016/j.cub.2020.10.011</a>.","ama":"Marquès-Bueno M, Armengot L, Noack L, et al. Auxin-regulated reversible inhibition of TMK1 signaling by MAKR2 modulates the dynamics of root gravitropism. <i>Current Biology</i>. 2021;31(1). doi:<a href=\"https://doi.org/10.1016/j.cub.2020.10.011\">10.1016/j.cub.2020.10.011</a>","short":"M. Marquès-Bueno, L. Armengot, L. Noack, J. Bareille, L. Rodriguez Solovey, M. Platre, V. Bayle, M. Liu, D. Opdenacker, S. Vanneste, B. Möller, Z. Nimchuk, T. Beeckman, A. Caño-Delgado, J. Friml, Y. Jaillais, Current Biology 31 (2021)."},"day":"11","file_date_updated":"2021-02-04T11:37:50Z","intvolume":"        31","scopus_import":"1","isi":1,"external_id":{"pmid":["33157019"],"isi":["000614361000039"]},"author":[{"last_name":"Marquès-Bueno","full_name":"Marquès-Bueno, MM","first_name":"MM"},{"first_name":"L","last_name":"Armengot","full_name":"Armengot, L"},{"full_name":"Noack, LC","last_name":"Noack","first_name":"LC"},{"last_name":"Bareille","full_name":"Bareille, J","first_name":"J"},{"id":"3922B506-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7244-7237","first_name":"Lesia","full_name":"Rodriguez Solovey, Lesia","last_name":"Rodriguez Solovey"},{"full_name":"Platre, MP","last_name":"Platre","first_name":"MP"},{"first_name":"V","last_name":"Bayle","full_name":"Bayle, V"},{"first_name":"M","full_name":"Liu, M","last_name":"Liu"},{"first_name":"D","last_name":"Opdenacker","full_name":"Opdenacker, D"},{"first_name":"S","last_name":"Vanneste","full_name":"Vanneste, S"},{"first_name":"BK","last_name":"Möller","full_name":"Möller, BK"},{"first_name":"ZL","full_name":"Nimchuk, ZL","last_name":"Nimchuk"},{"last_name":"Beeckman","full_name":"Beeckman, T","first_name":"T"},{"full_name":"Caño-Delgado, AI","last_name":"Caño-Delgado","first_name":"AI"},{"full_name":"Friml, Jiří","last_name":"Friml","first_name":"Jiří","orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Jaillais, Y","last_name":"Jaillais","first_name":"Y"}],"issue":"1","acknowledgement":"We thank the SiCE group for discussions and comments; S. Yalovsky, B. Scheres, and the NASC/ABRC collection for providing transgenic Arabidopsis lines and plasmids; L. Kalmbach and M. Barberon for the gift of pLOK180_pFR7m34GW; A. Lacroix, J. Berger, and P. Bolland for plant care; and M. Fendrych for help with microfluidics in the J.F. lab. We acknowledge\r\nthe contribution of the SFR Biosciences (UMS3444/CNRS, US8/Inser m, ENS de Lyon, UCBL) facilities: C. Lionet, E. Chatre, and J. Brocard at LBIPLATIM-MICROSCOPY for assistance with imaging, and V. GuegenChaignon and A. Page at the Protein Science Facility (PSF) for assistance with protein purification and mass spectrometry. Y.J. was funded by ERC\r\ngrant 3363360-APPL under FP/2007–2013. Y.J. and Z.L.N. were funded by an ANR- and NSF-supported ERA-CAPS project (SICOPID: ANR-17-CAPS0003-01/NSF PGRP IOS-1841917). A.I.C.-D. is funded by an ERC consolidator grant (ERC-2015-CoG–683163) and BIO2016-78955 grant from the Spanish Ministry of Economy and Competitiveness. Exchanges between the Y.J. and T.B. laboratories were funded by Tournesol grant 35656NB. B.K.M. was\r\nfunded by the Omics@vib Marie Curie COFUND and Research Foundation Flanders for a postdoctoral fellowship.","department":[{"_id":"JiFr"}]},{"title":"On the volume of projections of the cross-polytope","volume":344,"status":"public","arxiv":1,"year":"2021","month":"05","date_published":"2021-05-01T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1808.09165"}],"_id":"9098","language":[{"iso":"eng"}],"date_updated":"2025-07-10T12:01:36Z","quality_controlled":"1","issue":"5","acknowledgement":"Research was supported by the Russian Foundation for Basic Research, project 18-01-00036A (Theorems 1.5 and 5.3) and by the Ministry of Education and Science of the Russian Federation in the framework of MegaGrant no 075-15-2019-1926 (Theorems 1.2 and 7.3).","department":[{"_id":"UlWa"}],"external_id":{"arxiv":["1808.09165"],"isi":["000633365200001"]},"isi":1,"article_number":"112312","scopus_import":"1","author":[{"full_name":"Ivanov, Grigory","last_name":"Ivanov","first_name":"Grigory","id":"87744F66-5C6F-11EA-AFE0-D16B3DDC885E"}],"day":"01","intvolume":"       344","oa":1,"type":"journal_article","article_processing_charge":"No","citation":{"ama":"Ivanov G. On the volume of projections of the cross-polytope. <i>Discrete Mathematics</i>. 2021;344(5). doi:<a href=\"https://doi.org/10.1016/j.disc.2021.112312\">10.1016/j.disc.2021.112312</a>","short":"G. Ivanov, Discrete Mathematics 344 (2021).","chicago":"Ivanov, Grigory. “On the Volume of Projections of the Cross-Polytope.” <i>Discrete Mathematics</i>. Elsevier, 2021. <a href=\"https://doi.org/10.1016/j.disc.2021.112312\">https://doi.org/10.1016/j.disc.2021.112312</a>.","apa":"Ivanov, G. (2021). On the volume of projections of the cross-polytope. <i>Discrete Mathematics</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.disc.2021.112312\">https://doi.org/10.1016/j.disc.2021.112312</a>","ista":"Ivanov G. 2021. On the volume of projections of the cross-polytope. Discrete Mathematics. 344(5), 112312.","mla":"Ivanov, Grigory. “On the Volume of Projections of the Cross-Polytope.” <i>Discrete Mathematics</i>, vol. 344, no. 5, 112312, Elsevier, 2021, doi:<a href=\"https://doi.org/10.1016/j.disc.2021.112312\">10.1016/j.disc.2021.112312</a>.","ieee":"G. Ivanov, “On the volume of projections of the cross-polytope,” <i>Discrete Mathematics</i>, vol. 344, no. 5. Elsevier, 2021."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_type":"original","publisher":"Elsevier","date_created":"2021-02-07T23:01:12Z","doi":"10.1016/j.disc.2021.112312","publication_status":"published","publication":"Discrete Mathematics","abstract":[{"lang":"eng","text":"We study properties of the volume of projections of the n-dimensional\r\ncross-polytope $\\crosp^n = \\{ x \\in \\R^n \\mid |x_1| + \\dots + |x_n| \\leqslant 1\\}.$ We prove that the projection of $\\crosp^n$ onto a k-dimensional coordinate subspace has the maximum possible volume for k=2 and for k=3.\r\nWe obtain the exact lower bound on the volume of such a projection onto a two-dimensional plane. Also, we show that there exist local maxima which are not global ones for the volume of a projection of $\\crosp^n$ onto a k-dimensional subspace for any n>k⩾2."}],"publication_identifier":{"issn":["0012-365X"]},"oa_version":"Preprint"},{"file_date_updated":"2021-02-17T07:36:52Z","day":"20","intvolume":"         6","oa":1,"type":"journal_article","article_processing_charge":"Yes (via OA deal)","citation":{"short":"M. Calcabrini, A. Genc, Y. Liu, T. Kleinhanns, S. Lee, D.N. Dirin, Q.A. Akkerman, M.V. Kovalenko, J. Arbiol, M. Ibáñez, ACS Energy Letters 6 (2021) 581–587.","ama":"Calcabrini M, Genc A, Liu Y, et al. Exploiting the lability of metal halide perovskites for doping semiconductor nanocomposites. <i>ACS Energy Letters</i>. 2021;6(2):581-587. doi:<a href=\"https://doi.org/10.1021/acsenergylett.0c02448\">10.1021/acsenergylett.0c02448</a>","chicago":"Calcabrini, Mariano, Aziz Genc, Yu Liu, Tobias Kleinhanns, Seungho Lee, Dmitry N. Dirin, Quinten A. Akkerman, Maksym V. Kovalenko, Jordi Arbiol, and Maria Ibáñez. “Exploiting the Lability of Metal Halide Perovskites for Doping Semiconductor Nanocomposites.” <i>ACS Energy Letters</i>. American Chemical Society, 2021. <a href=\"https://doi.org/10.1021/acsenergylett.0c02448\">https://doi.org/10.1021/acsenergylett.0c02448</a>.","mla":"Calcabrini, Mariano, et al. “Exploiting the Lability of Metal Halide Perovskites for Doping Semiconductor Nanocomposites.” <i>ACS Energy Letters</i>, vol. 6, no. 2, American Chemical Society, 2021, pp. 581–87, doi:<a href=\"https://doi.org/10.1021/acsenergylett.0c02448\">10.1021/acsenergylett.0c02448</a>.","ista":"Calcabrini M, Genc A, Liu Y, Kleinhanns T, Lee S, Dirin DN, Akkerman QA, Kovalenko MV, Arbiol J, Ibáñez M. 2021. Exploiting the lability of metal halide perovskites for doping semiconductor nanocomposites. ACS Energy Letters. 6(2), 581–587.","apa":"Calcabrini, M., Genc, A., Liu, Y., Kleinhanns, T., Lee, S., Dirin, D. N., … Ibáñez, M. (2021). Exploiting the lability of metal halide perovskites for doping semiconductor nanocomposites. <i>ACS Energy Letters</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/acsenergylett.0c02448\">https://doi.org/10.1021/acsenergylett.0c02448</a>","ieee":"M. Calcabrini <i>et al.</i>, “Exploiting the lability of metal halide perovskites for doping semiconductor nanocomposites,” <i>ACS Energy Letters</i>, vol. 6, no. 2. American Chemical Society, pp. 581–587, 2021."},"issue":"2","department":[{"_id":"MaIb"}],"acknowledgement":"M.C. has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385. ICN2\r\nacknowledges funding from Generalitat de Catalunya 2017 SGR 327. ICN2 is supported by the Severo Ochoa program from Spanish MINECO (Grant No. SEV-2017-0706) and is funded by the CERCA Programme/Generalitat de Catalunya. This project has received funding from the European Union’s Horizon 2020 research and innovation programme under grant agreement No 823717 − ESTEEM3. M.V.K. acknowledges the support by the European Research Council under the Horizon 2020 Framework Program (ERC Consolidator Grant SCALEHALO\r\nGrant Agreement No. 819740) and by FET-OPEN project no. 862656 (DROP-IT).","project":[{"call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program","grant_number":"665385"}],"ec_funded":1,"external_id":{"pmid":["33614964"],"isi":["000619803400036"]},"isi":1,"scopus_import":"1","author":[{"orcid":"0000-0003-4566-5877","first_name":"Mariano","id":"45D7531A-F248-11E8-B48F-1D18A9856A87","last_name":"Calcabrini","full_name":"Calcabrini, Mariano"},{"first_name":"Aziz","full_name":"Genc, Aziz","last_name":"Genc"},{"full_name":"Liu, Yu","last_name":"Liu","orcid":"0000-0001-7313-6740","id":"2A70014E-F248-11E8-B48F-1D18A9856A87","first_name":"Yu"},{"first_name":"Tobias","id":"8BD9DE16-AB3C-11E9-9C8C-2A03E6697425","orcid":"0000-0003-1537-7436","full_name":"Kleinhanns, Tobias","last_name":"Kleinhanns"},{"last_name":"Lee","full_name":"Lee, Seungho","id":"BB243B88-D767-11E9-B658-BC13E6697425","orcid":"0000-0002-6962-8598","first_name":"Seungho"},{"first_name":"Dmitry N.","last_name":"Dirin","full_name":"Dirin, Dmitry N."},{"first_name":"Quinten A.","full_name":"Akkerman, Quinten A.","last_name":"Akkerman"},{"last_name":"Kovalenko","full_name":"Kovalenko, Maksym V.","first_name":"Maksym V."},{"last_name":"Arbiol","full_name":"Arbiol, Jordi","first_name":"Jordi"},{"first_name":"Maria","id":"43C61214-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5013-2843","full_name":"Ibáñez, Maria","last_name":"Ibáñez"}],"doi":"10.1021/acsenergylett.0c02448","publication_status":"published","publication":"ACS Energy Letters","abstract":[{"text":"Cesium lead halides have intrinsically unstable crystal lattices and easily transform within perovskite and nonperovskite structures. In this work, we explore the conversion of the perovskite CsPbBr3 into Cs4PbBr6 in the presence of PbS at 450 °C to produce doped nanocrystal-based composites with embedded Cs4PbBr6 nanoprecipitates. We show that PbBr2 is extracted from CsPbBr3 and diffuses into the PbS lattice with a consequent increase in the concentration of free charge carriers. This new doping strategy enables the adjustment of the density of charge carriers between 1019 and 1020 cm–3, and it may serve as a general strategy for doping other nanocrystal-based semiconductors.","lang":"eng"}],"file":[{"success":1,"file_name":"2021_ACSEnergyLetters_Calcabrini.pdf","checksum":"6fa7374bf8b95fdfe6e6c595322a6689","date_updated":"2021-02-17T07:36:52Z","file_id":"9155","creator":"dernst","access_level":"open_access","content_type":"application/pdf","relation":"main_file","date_created":"2021-02-17T07:36:52Z","file_size":5071201}],"oa_version":"Published Version","publication_identifier":{"eissn":["2380-8195"]},"pmid":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"American Chemical Society","article_type":"original","date_created":"2021-02-14T23:01:14Z","status":"public","page":"581-587","title":"Exploiting the lability of metal halide perovskites for doping semiconductor nanocomposites","volume":6,"date_published":"2021-01-20T00:00:00Z","_id":"9118","language":[{"iso":"eng"}],"date_updated":"2026-04-07T13:26:13Z","quality_controlled":"1","year":"2021","ddc":["540"],"related_material":{"record":[{"id":"12885","relation":"dissertation_contains","status":"public"}]},"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"has_accepted_license":"1","month":"01"}]