[{"volume":23,"day":"23","status":"public","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ddc":["530"],"date_created":"2022-01-16T23:01:28Z","publication":"New Journal of Physics","doi":"10.1088/1367-2630/ac4124","oa_version":"Published Version","ec_funded":1,"isi":1,"acknowledgement":"PG acknowledges support from National Science Foundation Awards No. DMR-1824265 for this work. AG acknowledges support from the European Union's Horizon 2020 research and innovation program under the Marie Skłodowska-Curie Grant Agreement No. 754411. EMN is supported by ASU startup grant. OE is in part supported by NSF-DMR-1904716.","article_number":"123042","date_published":"2021-12-23T00:00:00Z","intvolume":"        23","month":"12","oa":1,"issue":"12","date_updated":"2023-08-17T06:54:54Z","external_id":{"arxiv":["2012.11625"],"isi":["000734063700001"]},"year":"2021","abstract":[{"lang":"eng","text":"The surface states of 3D topological insulators in general have negligible quantum oscillations (QOs) when the chemical potential is tuned to the Dirac points. In contrast, we find that topological Kondo insulators (TKIs) can support surface states with an arbitrarily large Fermi surface (FS) when the chemical potential is pinned to the Dirac point. We illustrate that these FSs give rise to finite-frequency QOs, which can become comparable to the extremal area of the unhybridized bulk bands. We show that this occurs when the crystal symmetry is lowered from cubic to tetragonal in a minimal two-orbital model. We label such surface modes as 'shadow surface states'. Moreover, we show that the sufficient next-nearest neighbor out-of-plane hybridization leading to shadow surface states can be self-consistently stabilized for tetragonal TKIs. Consequently, shadow surface states provide an important example of high-frequency QOs beyond the context of cubic TKIs."}],"scopus_import":"1","arxiv":1,"file_date_updated":"2022-01-17T10:01:58Z","type":"journal_article","publication_identifier":{"issn":["1367-2630"]},"citation":{"short":"A. Ghazaryan, E.M. Nica, O. Erten, P. Ghaemi, New Journal of Physics 23 (2021).","ieee":"A. Ghazaryan, E. M. Nica, O. Erten, and P. Ghaemi, “Shadow surface states in topological Kondo insulators,” <i>New Journal of Physics</i>, vol. 23, no. 12. IOP Publishing, 2021.","ista":"Ghazaryan A, Nica EM, Erten O, Ghaemi P. 2021. Shadow surface states in topological Kondo insulators. New Journal of Physics. 23(12), 123042.","ama":"Ghazaryan A, Nica EM, Erten O, Ghaemi P. Shadow surface states in topological Kondo insulators. <i>New Journal of Physics</i>. 2021;23(12). doi:<a href=\"https://doi.org/10.1088/1367-2630/ac4124\">10.1088/1367-2630/ac4124</a>","chicago":"Ghazaryan, Areg, Emilian M. Nica, Onur Erten, and Pouyan Ghaemi. “Shadow Surface States in Topological Kondo Insulators.” <i>New Journal of Physics</i>. IOP Publishing, 2021. <a href=\"https://doi.org/10.1088/1367-2630/ac4124\">https://doi.org/10.1088/1367-2630/ac4124</a>.","apa":"Ghazaryan, A., Nica, E. M., Erten, O., &#38; Ghaemi, P. (2021). Shadow surface states in topological Kondo insulators. <i>New Journal of Physics</i>. IOP Publishing. <a href=\"https://doi.org/10.1088/1367-2630/ac4124\">https://doi.org/10.1088/1367-2630/ac4124</a>","mla":"Ghazaryan, Areg, et al. “Shadow Surface States in Topological Kondo Insulators.” <i>New Journal of Physics</i>, vol. 23, no. 12, 123042, IOP Publishing, 2021, doi:<a href=\"https://doi.org/10.1088/1367-2630/ac4124\">10.1088/1367-2630/ac4124</a>."},"quality_controlled":"1","_id":"10628","publication_status":"published","project":[{"grant_number":"754411","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"publisher":"IOP Publishing","has_accepted_license":"1","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","title":"Shadow surface states in topological Kondo insulators","author":[{"full_name":"Ghazaryan, Areg","first_name":"Areg","id":"4AF46FD6-F248-11E8-B48F-1D18A9856A87","last_name":"Ghazaryan","orcid":"0000-0001-9666-3543"},{"full_name":"Nica, Emilian M.","first_name":"Emilian M.","last_name":"Nica"},{"first_name":"Onur","last_name":"Erten","full_name":"Erten, Onur"},{"first_name":"Pouyan","last_name":"Ghaemi","full_name":"Ghaemi, Pouyan"}],"file":[{"checksum":"0c3cb6816242fa8afd1cc87a5fe77821","access_level":"open_access","relation":"main_file","file_size":2533102,"creator":"cchlebak","file_id":"10632","content_type":"application/pdf","date_created":"2022-01-17T10:01:58Z","date_updated":"2022-01-17T10:01:58Z","file_name":"2021_NewJourPhys_Ghazaryan.pdf","success":1}],"department":[{"_id":"MiLe"}],"article_processing_charge":"No","article_type":"original","language":[{"iso":"eng"}]},{"year":"2021","conference":{"name":"FSTTCS: Foundations of Software Technology and Theoretical Computer Science","end_date":"2021-12-17","start_date":"2021-12-15","location":"Virtual"},"oa":1,"date_updated":"2022-01-17T10:39:40Z","article_number":"42","intvolume":"       213","month":"11","date_published":"2021-11-29T00:00:00Z","alternative_title":["LIPIcs"],"oa_version":"Published Version","doi":"10.4230/LIPIcs.FSTTCS.2021.42","publication":"41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science","day":"29","status":"public","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ddc":["000"],"date_created":"2022-01-16T23:01:28Z","volume":213,"language":[{"iso":"eng"}],"department":[{"_id":"KrCh"}],"article_processing_charge":"No","file":[{"success":1,"file_name":"2021_LIPIcs_Chatterjee.pdf","date_created":"2022-01-17T10:36:08Z","date_updated":"2022-01-17T10:36:08Z","content_type":"application/pdf","file_id":"10633","file_size":891566,"creator":"cchlebak","checksum":"71141acdeffa9056f24d6dbef952d254","relation":"main_file","access_level":"open_access"}],"title":"Quantitative verification on product graphs of small treewidth","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","author":[{"orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"id":"3B699956-F248-11E8-B48F-1D18A9856A87","first_name":"Rasmus","last_name":"Ibsen-Jensen","orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus"},{"id":"49704004-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas","orcid":"0000-0002-8943-0722","last_name":"Pavlogiannis","full_name":"Pavlogiannis, Andreas"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","has_accepted_license":"1","publication_status":"published","quality_controlled":"1","_id":"10629","file_date_updated":"2022-01-17T10:36:08Z","type":"conference","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^{-λ})."}],"scopus_import":"1","citation":{"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>.","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>","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>.","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>","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.","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.","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."},"publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-9597-7215-0"]}},{"type":"conference","file_date_updated":"2022-01-17T10:49:03Z","scopus_import":"1","arxiv":1,"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_identifier":{"issn":["1868-8969"],"isbn":["978-3-9597-7215-0"]},"citation":{"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>.","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>","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>.","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>","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.","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.","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."},"quality_controlled":"1","_id":"10630","publication_status":"published","project":[{"grant_number":"754411","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"publisher":"Schloss Dagstuhl - Leibniz Zentrum für Informatik","has_accepted_license":"1","file":[{"creator":"cchlebak","file_size":844224,"content_type":"application/pdf","file_id":"10634","checksum":"d5a82ba893c3bc5da5914edbb3efb92b","relation":"main_file","access_level":"open_access","file_name":"2021_LIPIcs_Arrighi.pdf","success":1,"date_updated":"2022-01-17T10:49:03Z","date_created":"2022-01-17T10:49:03Z"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","title":"On the complexity of intersection non-emptiness for star-free language classes","author":[{"last_name":"Arrighi","first_name":"Emmanuel","full_name":"Arrighi, Emmanuel"},{"full_name":"Fernau, Henning","last_name":"Fernau","first_name":"Henning"},{"first_name":"Stefan","last_name":"Hoffmann","full_name":"Hoffmann, Stefan"},{"first_name":"Markus","last_name":"Holzer","full_name":"Holzer, Markus"},{"full_name":"Jecker, Ismael R","last_name":"Jecker","id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425","first_name":"Ismael R"},{"full_name":"De Oliveira Oliveira, Mateus","first_name":"Mateus","last_name":"De Oliveira Oliveira"},{"last_name":"Wolf","first_name":"Petra","full_name":"Wolf, Petra"}],"department":[{"_id":"KrCh"}],"article_processing_charge":"No","language":[{"iso":"eng"}],"volume":213,"status":"public","day":"29","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ddc":["000"],"date_created":"2022-01-16T23:01:29Z","doi":"10.4230/LIPIcs.FSTTCS.2021.34","publication":"41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science","oa_version":"Published Version","ec_funded":1,"article_number":"34","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","month":"11","intvolume":"       213","alternative_title":["LIPIcs"],"date_published":"2021-11-29T00:00:00Z","oa":1,"date_updated":"2022-01-17T10:56:19Z","conference":{"location":"Virtual","end_date":"2021-12-17","start_date":"2021-12-15","name":"FSTTCS: Foundations of Software Technology and Theoretical Computer Science"},"external_id":{"arxiv":["2110.01279"]},"year":"2021"},{"title":"Excited rotational states of molecules in a superfluid","author":[{"first_name":"Igor","id":"339C7E5A-F248-11E8-B48F-1D18A9856A87","last_name":"Cherepanov","full_name":"Cherepanov, Igor"},{"id":"4CA96FD4-F248-11E8-B48F-1D18A9856A87","first_name":"Giacomo","last_name":"Bighin","orcid":"0000-0001-8823-9777","full_name":"Bighin, Giacomo"},{"full_name":"Schouder, Constant A.","last_name":"Schouder","first_name":"Constant A."},{"last_name":"Chatterley","first_name":"Adam S.","full_name":"Chatterley, Adam S."},{"first_name":"Simon H.","last_name":"Albrechtsen","full_name":"Albrechtsen, Simon H."},{"full_name":"Muñoz, Alberto Viñas","last_name":"Muñoz","first_name":"Alberto Viñas"},{"full_name":"Christiansen, Lars","first_name":"Lars","last_name":"Christiansen"},{"full_name":"Stapelfeldt, Henrik","last_name":"Stapelfeldt","first_name":"Henrik"},{"first_name":"Mikhail","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6990-7802","last_name":"Lemeshko","full_name":"Lemeshko, Mikhail"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","publisher":"American Physical Society","article_type":"original","language":[{"iso":"eng"}],"department":[{"_id":"MiLe"}],"article_processing_charge":"No","quality_controlled":"1","_id":"10631","abstract":[{"text":"We combine experimental and theoretical approaches to explore excited rotational states of molecules embedded in helium nanodroplets using CS2 and I2 as examples. Laser-induced nonadiabatic molecular alignment is employed to measure spectral lines for rotational states extending beyond those initially populated at the 0.37 K droplet temperature. We construct a simple quantum-mechanical model, based on a linear rotor coupled to a single-mode bosonic bath, to determine the rotational energy structure in its entirety. The calculated and measured spectral lines are in good agreement. We show that the effect of the surrounding superfluid on molecular rotation can be rationalized by a single quantity, the angular momentum, transferred from the molecule to the droplet.","lang":"eng"}],"scopus_import":"1","arxiv":1,"type":"journal_article","publication_identifier":{"eissn":["2469-9934"],"issn":["2469-9926"]},"citation":{"mla":"Cherepanov, Igor, et al. “Excited Rotational States of Molecules in a Superfluid.” <i>Physical Review A</i>, vol. 104, no. 6, L061303, American Physical Society, 2021, doi:<a href=\"https://doi.org/10.1103/PhysRevA.104.L061303\">10.1103/PhysRevA.104.L061303</a>.","apa":"Cherepanov, I., Bighin, G., Schouder, C. A., Chatterley, A. S., Albrechtsen, S. H., Muñoz, A. V., … Lemeshko, M. (2021). Excited rotational states of molecules in a superfluid. <i>Physical Review A</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevA.104.L061303\">https://doi.org/10.1103/PhysRevA.104.L061303</a>","chicago":"Cherepanov, Igor, Giacomo Bighin, Constant A. Schouder, Adam S. Chatterley, Simon H. Albrechtsen, Alberto Viñas Muñoz, Lars Christiansen, Henrik Stapelfeldt, and Mikhail Lemeshko. “Excited Rotational States of Molecules in a Superfluid.” <i>Physical Review A</i>. American Physical Society, 2021. <a href=\"https://doi.org/10.1103/PhysRevA.104.L061303\">https://doi.org/10.1103/PhysRevA.104.L061303</a>.","ista":"Cherepanov I, Bighin G, Schouder CA, Chatterley AS, Albrechtsen SH, Muñoz AV, Christiansen L, Stapelfeldt H, Lemeshko M. 2021. Excited rotational states of molecules in a superfluid. Physical Review A. 104(6), L061303.","ieee":"I. Cherepanov <i>et al.</i>, “Excited rotational states of molecules in a superfluid,” <i>Physical Review A</i>, vol. 104, no. 6. American Physical Society, 2021.","short":"I. Cherepanov, G. Bighin, C.A. Schouder, A.S. Chatterley, S.H. Albrechtsen, A.V. Muñoz, L. Christiansen, H. Stapelfeldt, M. Lemeshko, Physical Review A 104 (2021).","ama":"Cherepanov I, Bighin G, Schouder CA, et al. Excited rotational states of molecules in a superfluid. <i>Physical Review A</i>. 2021;104(6). doi:<a href=\"https://doi.org/10.1103/PhysRevA.104.L061303\">10.1103/PhysRevA.104.L061303</a>"},"publication_status":"published","project":[{"name":"Quantum rotations in the presence of a many-body environment","_id":"26031614-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P29902"},{"name":"Angulon: physics and applications of a new quasiparticle","_id":"2688CF98-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"801770"},{"grant_number":"665385","call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program"},{"grant_number":"M02641","call_identifier":"FWF","_id":"26986C82-B435-11E9-9278-68D0E5697425","name":"A path-integral approach to composite impurities"}],"oa":1,"issue":"6","date_updated":"2024-08-07T07:16:52Z","acknowledgement":"I.C. acknowledges the support by the European Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie Grant Agreement No. 665385. G.B. acknowledges support from the Austrian Science Fund (FWF), under project No. M2461-N27. M.L. acknowledges support by the Austrian Science Fund (FWF), under project No. P29902-N27, and by the European Research Council (ERC) Starting Grant No. 801770 (ANGULON). H.S acknowledges support from the European Research Council-AdG (Project No. 320459, DropletControl) and from The Villum Foundation through a Villum Investigator grant no. 25886.","article_number":"L061303","date_published":"2021-12-30T00:00:00Z","month":"12","intvolume":"       104","year":"2021","external_id":{"arxiv":["2107.00468"],"isi":["000739618300001"]},"status":"public","day":"30","date_created":"2022-01-16T23:01:29Z","volume":104,"oa_version":"Preprint","ec_funded":1,"isi":1,"publication":"Physical Review A","main_file_link":[{"url":"http://128.84.4.18/abs/2107.00468","open_access":"1"}],"doi":"10.1103/PhysRevA.104.L061303"},{"external_id":{"arxiv":["2009.03857"]},"year":"2021","month":"12","intvolume":"         1","date_published":"2021-12-15T00:00:00Z","acknowledgement":"A preprint version of this article has been peer-reviewed and recommended by Peer Community In Neuroscience (DOI link to the recommendation: https://doi.org/10.24072/pci.cneuro.100003).\r\nWe thank Christian Machens and Nuno Calaim for useful discussions on the project. This report\r\ncame out of a collaboration started at the CAJAL Advanced Neuroscience Training Programme in\r\nComputational Neuroscience in Lisbon, Portugal, during the 2019 summer. The authors would\r\nlike to thank the participants, TAs, lecturers, and organizers of the summer school. SWK was\r\nsupported by the Simons Collaboration on the Global Brain (543009). WFP was supported by\r\nFCT (032077). MN was supported by European Union Horizon 2020 (665385).\r\n","article_number":"e68","date_updated":"2022-01-17T13:30:01Z","oa":1,"doi":"10.24072/pcjournal.69","publication":"Peer Community Journal","ec_funded":1,"oa_version":"Published Version","volume":1,"date_created":"2022-01-17T11:12:40Z","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ddc":["519"],"status":"public","day":"15","article_processing_charge":"No","department":[{"_id":"GradSch"},{"_id":"JoCs"}],"language":[{"iso":"eng"}],"article_type":"original","has_accepted_license":"1","publisher":"Centre Mersenne ; Peer Community In","file":[{"file_name":"10_24072_pcjournal_69.pdf","success":1,"date_created":"2022-01-17T11:15:26Z","date_updated":"2022-01-17T11:15:26Z","creator":"mnardin","file_size":3311494,"file_id":"10636","content_type":"application/pdf","checksum":"cd9af6b331918608f2e3d1c7940cbf4f","access_level":"open_access","relation":"main_file"}],"author":[{"last_name":"Nardin","orcid":"0000-0001-8849-6570","first_name":"Michele","id":"30BD0376-F248-11E8-B48F-1D18A9856A87","full_name":"Nardin, Michele"},{"full_name":"Phillips, James W.","first_name":"James W.","last_name":"Phillips"},{"first_name":"William F.","last_name":"Podlaski","full_name":"Podlaski, William F."},{"first_name":"Sander W.","last_name":"Keemink","full_name":"Keemink, Sander W."}],"title":"Nonlinear computations in spiking neural networks through multiplicative synapses","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","project":[{"name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"665385"}],"publication_status":"published","publication_identifier":{"eissn":["2804-3871"]},"citation":{"apa":"Nardin, M., Phillips, J. W., Podlaski, W. F., &#38; Keemink, S. W. (2021). Nonlinear computations in spiking neural networks through multiplicative synapses. <i>Peer Community Journal</i>. Centre Mersenne ; Peer Community In. <a href=\"https://doi.org/10.24072/pcjournal.69\">https://doi.org/10.24072/pcjournal.69</a>","mla":"Nardin, Michele, et al. “Nonlinear Computations in Spiking Neural Networks through Multiplicative Synapses.” <i>Peer Community Journal</i>, vol. 1, e68, Centre Mersenne ; Peer Community In, 2021, doi:<a href=\"https://doi.org/10.24072/pcjournal.69\">10.24072/pcjournal.69</a>.","ama":"Nardin M, Phillips JW, Podlaski WF, Keemink SW. Nonlinear computations in spiking neural networks through multiplicative synapses. <i>Peer Community Journal</i>. 2021;1. doi:<a href=\"https://doi.org/10.24072/pcjournal.69\">10.24072/pcjournal.69</a>","short":"M. Nardin, J.W. Phillips, W.F. Podlaski, S.W. Keemink, Peer Community Journal 1 (2021).","ista":"Nardin M, Phillips JW, Podlaski WF, Keemink SW. 2021. Nonlinear computations in spiking neural networks through multiplicative synapses. Peer Community Journal. 1, e68.","ieee":"M. Nardin, J. W. Phillips, W. F. Podlaski, and S. W. Keemink, “Nonlinear computations in spiking neural networks through multiplicative synapses,” <i>Peer Community Journal</i>, vol. 1. Centre Mersenne ; Peer Community In, 2021.","chicago":"Nardin, Michele, James W. Phillips, William F. Podlaski, and Sander W. Keemink. “Nonlinear Computations in Spiking Neural Networks through Multiplicative Synapses.” <i>Peer Community Journal</i>. Centre Mersenne ; Peer Community In, 2021. <a href=\"https://doi.org/10.24072/pcjournal.69\">https://doi.org/10.24072/pcjournal.69</a>."},"type":"journal_article","file_date_updated":"2022-01-17T11:15:26Z","abstract":[{"lang":"eng","text":"The brain efficiently performs nonlinear computations through its intricate networks of spiking neurons, but how this is done remains elusive. While nonlinear computations can be implemented successfully in spiking neural networks, this requires supervised training and the resulting connectivity can be hard to interpret. In contrast, the required connectivity for any computation in the form of a linear dynamical system can be directly derived and understood with the spike coding network (SCN) framework. These networks also have biologically realistic activity patterns and are highly robust to cell death. Here we extend the SCN framework to directly implement any polynomial dynamical system, without the need for training. This results in networks requiring a mix of synapse types (fast, slow, and multiplicative), which we term multiplicative spike coding networks (mSCNs). Using mSCNs, we demonstrate how to directly derive the required connectivity for several nonlinear dynamical systems. We also show how to carry out higher-order polynomials with coupled networks that use only pair-wise multiplicative synapses, and provide expected numbers of connections for each synapse type. Overall, our work demonstrates a novel method for implementing nonlinear computations in spiking neural networks, while keeping the attractive features of standard SCNs (robustness, realistic activity patterns, and interpretable connectivity). Finally, we discuss the biological plausibility of our approach, and how the high accuracy and robustness of the approach may be of interest for neuromorphic computing."}],"arxiv":1,"_id":"10635","quality_controlled":"1"},{"citation":{"chicago":"Lake, Russell, Slawomir Simbierowicz, Philip Krantz, Farid Hassani, and Johannes M Fink. <i>The Bluefors Dilution Refrigerator as an Integrated Quantum Measurement System</i>. Helsinki, Finland: Bluefors Oy, 2021.","ama":"Lake R, Simbierowicz S, Krantz P, Hassani F, Fink JM. <i>The Bluefors Dilution Refrigerator as an Integrated Quantum Measurement System</i>. Helsinki, Finland: Bluefors Oy; 2021.","short":"R. Lake, S. Simbierowicz, P. Krantz, F. Hassani, J.M. Fink, The Bluefors Dilution Refrigerator as an Integrated Quantum Measurement System, Bluefors Oy, Helsinki, Finland, 2021.","ieee":"R. Lake, S. Simbierowicz, P. Krantz, F. Hassani, and J. M. Fink, <i>The Bluefors dilution refrigerator as an integrated quantum measurement system</i>. Helsinki, Finland: Bluefors Oy, 2021.","ista":"Lake R, Simbierowicz S, Krantz P, Hassani F, Fink JM. 2021. The Bluefors dilution refrigerator as an integrated quantum measurement system, Helsinki, Finland: Bluefors Oy, 9p.","mla":"Lake, Russell, et al. <i>The Bluefors Dilution Refrigerator as an Integrated Quantum Measurement System</i>. Bluefors Oy, 2021.","apa":"Lake, R., Simbierowicz, S., Krantz, P., Hassani, F., &#38; Fink, J. M. (2021). <i>The Bluefors dilution refrigerator as an integrated quantum measurement system</i>. Helsinki, Finland: Bluefors Oy."},"type":"other_academic_publication","abstract":[{"text":"The purpose of this application note is to demonstrate a working example of a superconducting qubit measurement in a Bluefors cryostat using the Keysight quantum control hardware. Our motivation is twofold. First, we provide pre-qualification data that the Bluefors cryostat, including filtering and wiring, can support long-lived qubits. Second, we demonstrate that the Keysight system (controlled using Labber) provides a straightforward solution to perform these characterization measurements. This document is intended as a brief guide for starting an experimental platform for testing superconducting qubits. The setup described here is an immediate jumping off point for a suite of applications including testing quantum logical gates, quantum optics with microwaves, or even using the qubit itself as a sensitive probe of local electromagnetic fields. Qubit measurements rely on high performance of both the physical sample environment and the measurement electronics. An overview of the cryogenic system is shown in Figure 1, and an overview of the integration between the electronics and cryostat (including wiring details) is shown in Figure 2.","lang":"eng"}],"_id":"10644","date_created":"2022-01-19T08:29:57Z","quality_controlled":"1","day":"20","status":"public","publication_status":"published","place":"Helsinki, Finland","main_file_link":[{"open_access":"1","url":"https://bluefors.com/blog/integrated-quantum-measurement-system/"}],"oa_version":"Published Version","month":"04","alternative_title":["Bluefors Blog"],"date_published":"2021-04-20T00:00:00Z","publisher":"Bluefors Oy","date_updated":"2022-01-19T09:11:33Z","keyword":["Application note"],"author":[{"full_name":"Lake, Russell","last_name":"Lake","first_name":"Russell"},{"full_name":"Simbierowicz, Slawomir","first_name":"Slawomir","last_name":"Simbierowicz"},{"first_name":"Philip","last_name":"Krantz","full_name":"Krantz, Philip"},{"full_name":"Hassani, Farid","last_name":"Hassani","id":"2AED110C-F248-11E8-B48F-1D18A9856A87","first_name":"Farid"},{"full_name":"Fink, Johannes M","first_name":"Johannes M","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8112-028X","last_name":"Fink"}],"oa":1,"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","title":"The Bluefors dilution refrigerator as an integrated quantum measurement system","page":"9","article_processing_charge":"No","department":[{"_id":"JoFi"}],"language":[{"iso":"eng"}],"year":"2021"},{"citation":{"mla":"Simbierowicz, Slawomir, et al. <i>Qubit Energy-Relaxation Statistics in the Bluefors Quantum Measurement System</i>. Bluefors Oy, 2021.","apa":"Simbierowicz, S., Shi, C., Collodo, M., Kirste, M., Hassani, F., Fink, J. M., … Lake, R. (2021). <i>Qubit energy-relaxation statistics in the Bluefors quantum measurement system</i>. Helsinki, Finland: Bluefors Oy.","chicago":"Simbierowicz, Slawomir, Chunyan Shi, Michele Collodo, Moritz Kirste, Farid Hassani, Johannes M Fink, Jonas Bylander, Daniel Perez Lozano, and Russell Lake. <i>Qubit Energy-Relaxation Statistics in the Bluefors Quantum Measurement System</i>. Helsinki, Finland: Bluefors Oy, 2021.","ama":"Simbierowicz S, Shi C, Collodo M, et al. <i>Qubit Energy-Relaxation Statistics in the Bluefors Quantum Measurement System</i>. Helsinki, Finland: Bluefors Oy; 2021.","ista":"Simbierowicz S, Shi C, Collodo M, Kirste M, Hassani F, Fink JM, Bylander J, Perez Lozano D, Lake R. 2021. Qubit energy-relaxation statistics in the Bluefors quantum measurement system, Helsinki, Finland: Bluefors Oy, 8p.","short":"S. Simbierowicz, C. Shi, M. Collodo, M. Kirste, F. Hassani, J.M. Fink, J. Bylander, D. Perez Lozano, R. Lake, Qubit Energy-Relaxation Statistics in the Bluefors Quantum Measurement System, Bluefors Oy, Helsinki, Finland, 2021.","ieee":"S. Simbierowicz <i>et al.</i>, <i>Qubit energy-relaxation statistics in the Bluefors quantum measurement system</i>. Helsinki, Finland: Bluefors Oy, 2021."},"abstract":[{"text":"Superconducting qubits have emerged as a highly versatile and useful platform for quantum technological applications [1]. Bluefors and Zurich Instruments have supported the growth of this field from the 2010s onwards by providing well-engineered and reliable measurement infrastructure [2]– [6]. Having a long and stable qubit lifetime is a critical system property. Therefore, considerable effort has already gone into measuring qubit energy-relaxation timescales and their fluctuations, see Refs. [7]–[10] among others. Accurately extracting the statistics of a quantum device requires users to perform time consuming measurements. One measurement challenge is that the detection of the state-dependent\r\nresponse of a superconducting resonator due to a dispersively-coupled qubit requires an inherently low signal level. Consequently, measurements must be performed using a microwave probe that contains only a few microwave photons. Improving the signal-to-noise ratio (SNR) by using near-quantum limited parametric amplifiers as well as the use of optimized signal processing enabled by efficient room temperature instrumentation help to reduce measurement time. An empirical observation for fixed frequency transmons from recent literature is that as the energy-relaxation time 𝑇𝑇1 increases, so do its natural temporal fluctuations [7], [10]. This necessitates many repeated measurements to understand the statistics (see for example, Ref. [10]). In addition, as state-of-the-art qubits increase in lifetime, longer\r\nmeasurement times are expected to obtain accurate statistics. As described below, the scaling of the widths of the qubit energy-relaxation distributions also reveal clues about the origin of the energy-relaxation.","lang":"eng"}],"type":"other_academic_publication","_id":"10645","date_created":"2022-01-19T08:41:14Z","status":"public","quality_controlled":"1","day":"03","publication_status":"published","main_file_link":[{"open_access":"1","url":"https://bluefors.com/blog/application-note-qubit-energy-relaxation-statistics-bluefors-quantum-measurement-system/"}],"place":"Helsinki, Finland","oa_version":"Published Version","date_published":"2021-06-03T00:00:00Z","alternative_title":["Bluefors Blog"],"month":"06","publisher":"Bluefors Oy","keyword":["Application note"],"date_updated":"2022-01-19T09:11:39Z","title":"Qubit energy-relaxation statistics in the Bluefors quantum measurement system","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","author":[{"full_name":"Simbierowicz, Slawomir","last_name":"Simbierowicz","first_name":"Slawomir"},{"first_name":"Chunyan","last_name":"Shi","full_name":"Shi, Chunyan"},{"full_name":"Collodo, Michele","last_name":"Collodo","first_name":"Michele"},{"first_name":"Moritz","last_name":"Kirste","full_name":"Kirste, Moritz"},{"full_name":"Hassani, Farid","first_name":"Farid","id":"2AED110C-F248-11E8-B48F-1D18A9856A87","last_name":"Hassani"},{"orcid":"0000-0001-8112-028X","last_name":"Fink","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","first_name":"Johannes M","full_name":"Fink, Johannes M"},{"full_name":"Bylander, Jonas","first_name":"Jonas","last_name":"Bylander"},{"full_name":"Perez Lozano, Daniel","last_name":"Perez Lozano","first_name":"Daniel"},{"full_name":"Lake, Russell","first_name":"Russell","last_name":"Lake"}],"oa":1,"page":"8","article_processing_charge":"No","department":[{"_id":"JoFi"}],"language":[{"iso":"eng"}],"year":"2021"},{"publication_status":"published","project":[{"_id":"25D4A630-B435-11E9-9278-68D0E5697425","name":"Microglia action towards neuronal circuit formation and function in health and disease","grant_number":"715571","call_identifier":"H2020"}],"scopus_import":"1","abstract":[{"lang":"eng","text":"Adeno-associated viruses (AAVs) are widely used to deliver genetic material in vivo to distinct cell types such as neurons or glial cells, allowing for targeted manipulation. Transduction of microglia is mostly excluded from this strategy, likely due to the cells’ heterogeneous state upon environmental changes, which makes AAV design challenging. Here, we established the retina as a model system for microglial AAV validation and optimization. First, we show that AAV2/6 transduced microglia in both synaptic layers, where layer preference corresponds to the intravitreal or subretinal delivery method. Surprisingly, we observed significantly enhanced microglial transduction during photoreceptor degeneration. Thus, we modified the AAV6 capsid to reduce heparin binding by introducing four point mutations (K531E, R576Q, K493S, and K459S), resulting in increased microglial transduction in the outer plexiform layer. Finally, to improve microglial-specific transduction, we validated a Cre-dependent transgene delivery cassette for use in combination with the Cx3cr1CreERT2 mouse line. Together, our results provide a foundation for future studies optimizing AAV-mediated microglia transduction and highlight that environmental conditions influence microglial transduction efficiency.\r\n"}],"type":"journal_article","file_date_updated":"2022-01-24T07:43:09Z","publication_identifier":{"eissn":["2329-0501"]},"citation":{"apa":"Maes, M. E., Wögenstein, G. M., Colombo, G., Casado Polanco, R., &#38; Siegert, S. (2021). Optimizing AAV2/6 microglial targeting identified enhanced efficiency in the photoreceptor degenerative environment. <i>Molecular Therapy - Methods and Clinical Development</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.omtm.2021.09.006\">https://doi.org/10.1016/j.omtm.2021.09.006</a>","mla":"Maes, Margaret E., et al. “Optimizing AAV2/6 Microglial Targeting Identified Enhanced Efficiency in the Photoreceptor Degenerative Environment.” <i>Molecular Therapy - Methods and Clinical Development</i>, vol. 23, Elsevier, 2021, pp. 210–24, doi:<a href=\"https://doi.org/10.1016/j.omtm.2021.09.006\">10.1016/j.omtm.2021.09.006</a>.","ista":"Maes ME, Wögenstein GM, Colombo G, Casado Polanco R, Siegert S. 2021. Optimizing AAV2/6 microglial targeting identified enhanced efficiency in the photoreceptor degenerative environment. Molecular Therapy - Methods and Clinical Development. 23, 210–224.","short":"M.E. Maes, G.M. Wögenstein, G. Colombo, R. Casado Polanco, S. Siegert, Molecular Therapy - Methods and Clinical Development 23 (2021) 210–224.","ieee":"M. E. Maes, G. M. Wögenstein, G. Colombo, R. Casado Polanco, and S. Siegert, “Optimizing AAV2/6 microglial targeting identified enhanced efficiency in the photoreceptor degenerative environment,” <i>Molecular Therapy - Methods and Clinical Development</i>, vol. 23. Elsevier, pp. 210–224, 2021.","ama":"Maes ME, Wögenstein GM, Colombo G, Casado Polanco R, Siegert S. Optimizing AAV2/6 microglial targeting identified enhanced efficiency in the photoreceptor degenerative environment. <i>Molecular Therapy - Methods and Clinical Development</i>. 2021;23:210-224. doi:<a href=\"https://doi.org/10.1016/j.omtm.2021.09.006\">10.1016/j.omtm.2021.09.006</a>","chicago":"Maes, Margaret E, Gabriele M. Wögenstein, Gloria Colombo, Raquel Casado Polanco, and Sandra Siegert. “Optimizing AAV2/6 Microglial Targeting Identified Enhanced Efficiency in the Photoreceptor Degenerative Environment.” <i>Molecular Therapy - Methods and Clinical Development</i>. Elsevier, 2021. <a href=\"https://doi.org/10.1016/j.omtm.2021.09.006\">https://doi.org/10.1016/j.omtm.2021.09.006</a>."},"quality_controlled":"1","_id":"10655","department":[{"_id":"SaSi"},{"_id":"SiHi"}],"article_processing_charge":"Yes","article_type":"original","language":[{"iso":"eng"}],"publisher":"Elsevier","has_accepted_license":"1","author":[{"first_name":"Margaret E","id":"3838F452-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9642-1085","last_name":"Maes","full_name":"Maes, Margaret E"},{"full_name":"Wögenstein, Gabriele M.","last_name":"Wögenstein","first_name":"Gabriele M."},{"id":"3483CF6C-F248-11E8-B48F-1D18A9856A87","first_name":"Gloria","last_name":"Colombo","orcid":"0000-0001-9434-8902","full_name":"Colombo, Gloria"},{"orcid":"0000-0001-8293-4568","last_name":"Casado Polanco","id":"15240fc1-dbcd-11ea-9d1d-ac5a786425fd","first_name":"Raquel","full_name":"Casado Polanco, Raquel"},{"full_name":"Siegert, Sandra","first_name":"Sandra","id":"36ACD32E-F248-11E8-B48F-1D18A9856A87","last_name":"Siegert","orcid":"0000-0001-8635-0877"}],"title":"Optimizing AAV2/6 microglial targeting identified enhanced efficiency in the photoreceptor degenerative environment","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","file":[{"date_updated":"2022-01-24T07:43:09Z","date_created":"2022-01-24T07:43:09Z","success":1,"file_name":"2021_MolTherMethodsClinDev_Maes.pdf","checksum":"77dc540e8011c5475031bdf6ccef20a6","access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"10657","file_size":4794147,"creator":"cchlebak"}],"publication":"Molecular Therapy - Methods and Clinical Development","doi":"10.1016/j.omtm.2021.09.006","ec_funded":1,"oa_version":"Published Version","isi":1,"volume":23,"day":"10","status":"public","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"date_created":"2022-01-23T23:01:28Z","ddc":["570"],"page":"210-224","external_id":{"isi":["000748748500019"]},"year":"2021","acknowledgement":"This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement no. 715571). The research was supported by the Scientific Service Units (SSU) of IST Austria through resources provided by the Bioimaging Facility, the Life Science Facility, and the Pre-Clinical Facility, namely Sonja Haslinger and Michael Schunn for their animal colony management and support. We would also like to thank Chakrabarty Lab for sharing the plasmids for AAV2/6 production. Finally, we would like to thank the Siegert team members for discussion about the manuscript.","date_published":"2021-12-10T00:00:00Z","month":"12","intvolume":"        23","acknowledged_ssus":[{"_id":"Bio"},{"_id":"LifeSc"},{"_id":"PreCl"}],"oa":1,"date_updated":"2023-11-16T13:12:03Z"},{"publication":"arXiv","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2104.06966"}],"publication_status":"submitted","doi":"10.48550/arXiv.2104.06966","oa_version":"Preprint","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"12072"}]},"arxiv":1,"abstract":[{"lang":"eng","text":"We find an asymptotic formula for the number of primitive vectors $(z_1,\\ldots,z_4)\\in (\\mathbb{Z}_{\\neq 0})^4$ such that $z_1,\\ldots, z_4$ are all squareful and bounded by $B$, and $z_1+\\cdots + z_4 = 0$. Our result agrees in the power of $B$ and $\\log B$ with the Campana-Manin conjecture of Pieropan, Smeets, Tanimoto and V\\'{a}rilly-Alvarado."}],"type":"preprint","citation":{"ama":"Shute AL. Sums of four squareful numbers. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2104.06966\">10.48550/arXiv.2104.06966</a>","ista":"Shute AL. Sums of four squareful numbers. arXiv, 2104.06966.","ieee":"A. L. Shute, “Sums of four squareful numbers,” <i>arXiv</i>. .","short":"A.L. Shute, ArXiv (n.d.).","chicago":"Shute, Alec L. “Sums of Four Squareful Numbers.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2104.06966\">https://doi.org/10.48550/arXiv.2104.06966</a>.","apa":"Shute, A. L. (n.d.). Sums of four squareful numbers. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2104.06966\">https://doi.org/10.48550/arXiv.2104.06966</a>","mla":"Shute, Alec L. “Sums of Four Squareful Numbers.” <i>ArXiv</i>, 2104.06966, doi:<a href=\"https://doi.org/10.48550/arXiv.2104.06966\">10.48550/arXiv.2104.06966</a>."},"status":"public","day":"15","date_created":"2022-09-09T10:42:51Z","_id":"12076","department":[{"_id":"TiBr"}],"article_processing_charge":"No","external_id":{"arxiv":["2104.06966"]},"year":"2021","language":[{"iso":"eng"}],"article_number":"2104.06966","date_published":"2021-04-15T00:00:00Z","month":"04","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Shute, Alec L","id":"440EB050-F248-11E8-B48F-1D18A9856A87","first_name":"Alec L","last_name":"Shute","orcid":"0000-0002-1812-2810"}],"title":"Sums of four squareful numbers","oa":1,"date_updated":"2023-02-21T16:37:30Z"},{"abstract":[{"lang":"eng","text":"We compare the Manin-type conjecture for Campana points recently formulated\r\nby Pieropan, Smeets, Tanimoto and V\\'{a}rilly-Alvarado with an alternative\r\nprediction of Browning and Van Valckenborgh in the special case of the orbifold\r\n$(\\mathbb{P}^1,D)$, where $D =\\frac{1}{2}[0]+\\frac{1}{2}[1]+\\frac{1}{2}[\\infty]$. We find that the two predicted leading constants do not agree, and we discuss whether thin sets\r\ncould explain this discrepancy. Motivated by this, we provide a counterexample\r\nto the Manin-type conjecture for Campana points, by considering orbifolds\r\ncorresponding to squareful values of binary quadratic forms."}],"arxiv":1,"type":"preprint","citation":{"chicago":"Shute, Alec L. “On the Leading Constant in the Manin-Type Conjecture for Campana Points.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2104.14946\">https://doi.org/10.48550/arXiv.2104.14946</a>.","ieee":"A. L. Shute, “On the leading constant in the Manin-type conjecture for Campana points,” <i>arXiv</i>. .","short":"A.L. Shute, ArXiv (n.d.).","ista":"Shute AL. On the leading constant in the Manin-type conjecture for Campana points. arXiv, 2104.14946.","ama":"Shute AL. On the leading constant in the Manin-type conjecture for Campana points. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2104.14946\">10.48550/arXiv.2104.14946</a>","mla":"Shute, Alec L. “On the Leading Constant in the Manin-Type Conjecture for Campana Points.” <i>ArXiv</i>, 2104.14946, doi:<a href=\"https://doi.org/10.48550/arXiv.2104.14946\">10.48550/arXiv.2104.14946</a>.","apa":"Shute, A. L. (n.d.). On the leading constant in the Manin-type conjecture for Campana points. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2104.14946\">https://doi.org/10.48550/arXiv.2104.14946</a>"},"status":"public","day":"30","_id":"12077","date_created":"2022-09-09T10:43:17Z","publication":"arXiv","publication_status":"submitted","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2104.14946"}],"doi":"10.48550/arXiv.2104.14946","oa_version":"Preprint","related_material":{"record":[{"id":"12072","relation":"dissertation_contains","status":"public"}]},"acknowledgement":"The author would like to thank Damaris Schindler and Florian Wilsch for their helpful comments on the heights and Tamagawa measures used in Section 3, together with Marta Pieropan, Sho Tanimoto and Sam Streeter for providing valuable feedback on an earlier version of this paper, and Tim Browning for many useful comments and discussions during the development of this work. The author is also grateful to the anonymous referee for providing many valuable comments and suggestions that improved the quality of the paper.","article_number":"2104.14946","date_published":"2021-04-30T00:00:00Z","month":"04","title":"On the leading constant in the Manin-type conjecture for Campana points","author":[{"full_name":"Shute, Alec L","id":"440EB050-F248-11E8-B48F-1D18A9856A87","first_name":"Alec L","last_name":"Shute","orcid":"0000-0002-1812-2810"}],"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-02-21T16:37:30Z","department":[{"_id":"TiBr"}],"article_processing_charge":"No","external_id":{"arxiv":["2104.14946"]},"year":"2021","language":[{"iso":"eng"}]},{"acknowledgement":"We thank anonymous reviewers for valuable inputs. This work is supported in part by NSF grant 2030859 to the CRA for the CIFellows Project, NSF grants IIS-1527668, CCF-1704883, IIS-1830549, the ERC CoG 863818 (ForM-SMArt), and an award from the Maryland Procurement Office.","alternative_title":["LNCS"],"date_published":"2021-03-21T00:00:00Z","intvolume":"     12651","month":"03","oa":1,"date_updated":"2025-07-14T09:09:51Z","conference":{"location":"Luxembourg City, Luxembourg","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","start_date":"2021-03-27","end_date":"2021-04-01"},"external_id":{"arxiv":["2101.02594"]},"page":"20-37","year":"2021","volume":12651,"status":"public","day":"21","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ddc":["000"],"date_created":"2023-03-26T22:01:09Z","publication":"27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems","doi":"10.1007/978-3-030-72016-2","oa_version":"Published Version","ec_funded":1,"publisher":"Springer Nature","has_accepted_license":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Suguman","last_name":"Bansal","full_name":"Bansal, Suguman"},{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"full_name":"Vardi, Moshe Y.","last_name":"Vardi","first_name":"Moshe Y."}],"title":"On satisficing in quantitative games","file":[{"file_size":747418,"creator":"dernst","content_type":"application/pdf","file_id":"12777","checksum":"b020b78b23587ce7610b1aafb4e63438","access_level":"open_access","relation":"main_file","file_name":"2021_LNCS_Bansal.pdf","success":1,"date_updated":"2023-03-28T11:00:33Z","date_created":"2023-03-28T11:00:33Z"}],"department":[{"_id":"KrCh"}],"article_processing_charge":"No","language":[{"iso":"eng"}],"scopus_import":"1","abstract":[{"lang":"eng","text":"Several problems in planning and reactive synthesis can be reduced to the analysis of two-player quantitative graph games. Optimization is one form of analysis. We argue that in many cases it may be better to replace the optimization problem with the satisficing problem, where instead of searching for optimal solutions, the goal is to search for solutions that adhere to a given threshold bound.\r\nThis work defines and investigates the satisficing problem on a two-player graph game with the discounted-sum cost model. We show that while the satisficing problem can be solved using numerical methods just like the optimization problem, this approach does not render compelling benefits over optimization. When the discount factor is, however, an integer, we present another approach to satisficing, which is purely based on automata methods. We show that this approach is algorithmically more performant – both theoretically and empirically – and demonstrates the broader applicability of satisficing over optimization."}],"arxiv":1,"type":"conference","file_date_updated":"2023-03-28T11:00:33Z","citation":{"ama":"Bansal S, Chatterjee K, Vardi MY. On satisficing in quantitative games. In: <i>27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>. Vol 12651. Springer Nature; 2021:20-37. doi:<a href=\"https://doi.org/10.1007/978-3-030-72016-2\">10.1007/978-3-030-72016-2</a>","ista":"Bansal S, Chatterjee K, Vardi MY. 2021. On satisficing in quantitative games. 27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 12651, 20–37.","short":"S. Bansal, K. Chatterjee, M.Y. Vardi, in:, 27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Springer Nature, 2021, pp. 20–37.","ieee":"S. Bansal, K. Chatterjee, and M. Y. Vardi, “On satisficing in quantitative games,” in <i>27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, Luxembourg City, Luxembourg, 2021, vol. 12651, pp. 20–37.","chicago":"Bansal, Suguman, Krishnendu Chatterjee, and Moshe Y. Vardi. “On Satisficing in Quantitative Games.” In <i>27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, 12651:20–37. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/978-3-030-72016-2\">https://doi.org/10.1007/978-3-030-72016-2</a>.","apa":"Bansal, S., Chatterjee, K., &#38; Vardi, M. Y. (2021). On satisficing in quantitative games. In <i>27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i> (Vol. 12651, pp. 20–37). Luxembourg City, Luxembourg: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-72016-2\">https://doi.org/10.1007/978-3-030-72016-2</a>","mla":"Bansal, Suguman, et al. “On Satisficing in Quantitative Games.” <i>27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, vol. 12651, Springer Nature, 2021, pp. 20–37, doi:<a href=\"https://doi.org/10.1007/978-3-030-72016-2\">10.1007/978-3-030-72016-2</a>."},"publication_identifier":{"issn":["0302-9743"],"isbn":["9783030720155"],"eissn":["1611-3349"]},"quality_controlled":"1","_id":"12767","publication_status":"published","project":[{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","grant_number":"863818"}]},{"publication":"ASHPC21 – Austrian-Slovenian HPC Meeting 2021","main_file_link":[{"url":"https://vsc.ac.at/fileadmin/user_upload/vsc/conferences/ashpc21/BOOKLET_ASHPC21.pdf","open_access":"1"}],"publication_status":"published","doi":"10.3359/2021hpc","oa_version":"Published Version","publication_identifier":{"isbn":["978-961-6980-77-7","978-961-6133-48-7"]},"citation":{"apa":"Schlögl, A., Elefante, S., Hornoiu, A., &#38; Stadlbauer, S. (2021). Managing software on a heterogenous HPC cluster. In <i>ASHPC21 – Austrian-Slovenian HPC Meeting 2021</i> (p. 5). Virtual: University of Ljubljana. <a href=\"https://doi.org/10.3359/2021hpc\">https://doi.org/10.3359/2021hpc</a>","mla":"Schlögl, Alois, et al. “Managing Software on a Heterogenous HPC Cluster.” <i>ASHPC21 – Austrian-Slovenian HPC Meeting 2021</i>, University of Ljubljana, 2021, p. 5, doi:<a href=\"https://doi.org/10.3359/2021hpc\">10.3359/2021hpc</a>.","ama":"Schlögl A, Elefante S, Hornoiu A, Stadlbauer S. Managing software on a heterogenous HPC cluster. In: <i>ASHPC21 – Austrian-Slovenian HPC Meeting 2021</i>. University of Ljubljana; 2021:5. doi:<a href=\"https://doi.org/10.3359/2021hpc\">10.3359/2021hpc</a>","short":"A. Schlögl, S. Elefante, A. Hornoiu, S. Stadlbauer, in:, ASHPC21 – Austrian-Slovenian HPC Meeting 2021, University of Ljubljana, 2021, p. 5.","ieee":"A. Schlögl, S. Elefante, A. Hornoiu, and S. Stadlbauer, “Managing software on a heterogenous HPC cluster,” in <i>ASHPC21 – Austrian-Slovenian HPC Meeting 2021</i>, Virtual, 2021, p. 5.","ista":"Schlögl A, Elefante S, Hornoiu A, Stadlbauer S. 2021. Managing software on a heterogenous HPC cluster. ASHPC21 – Austrian-Slovenian HPC Meeting 2021. ASHPC - Austrian-Slovenian HPC Meeting, 5.","chicago":"Schlögl, Alois, Stefano Elefante, Andrei Hornoiu, and Stephan Stadlbauer. “Managing Software on a Heterogenous HPC Cluster.” In <i>ASHPC21 – Austrian-Slovenian HPC Meeting 2021</i>, 5. University of Ljubljana, 2021. <a href=\"https://doi.org/10.3359/2021hpc\">https://doi.org/10.3359/2021hpc</a>."},"type":"conference_abstract","file_date_updated":"2023-05-16T07:36:34Z","_id":"12909","date_created":"2023-05-05T13:17:36Z","ddc":["000"],"status":"public","day":"02","page":"5","article_processing_charge":"No","conference":{"location":"Virtual","name":"ASHPC - Austrian-Slovenian HPC Meeting","start_date":"2021-05-31","end_date":"2021-06-02"},"department":[{"_id":"ScienComp"}],"language":[{"iso":"eng"}],"year":"2021","date_published":"2021-06-02T00:00:00Z","month":"06","has_accepted_license":"1","publisher":"University of Ljubljana","date_updated":"2023-05-16T07:43:54Z","author":[{"full_name":"Schlögl, Alois","id":"45BF87EE-F248-11E8-B48F-1D18A9856A87","first_name":"Alois","orcid":"0000-0002-5621-8100","last_name":"Schlögl"},{"last_name":"Elefante","first_name":"Stefano","id":"490F40CE-F248-11E8-B48F-1D18A9856A87","full_name":"Elefante, Stefano"},{"full_name":"Hornoiu, Andrei","last_name":"Hornoiu","id":"77129392-B450-11EA-8745-D4653DDC885E","first_name":"Andrei"},{"id":"4D0BC184-F248-11E8-B48F-1D18A9856A87","first_name":"Stephan","last_name":"Stadlbauer","full_name":"Stadlbauer, Stephan"}],"oa":1,"title":"Managing software on a heterogenous HPC cluster","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"relation":"main_file","access_level":"open_access","checksum":"ba73f85858fb9d5737ebc7724646dd45","creator":"dernst","file_size":422761,"content_type":"application/pdf","file_id":"12971","date_updated":"2023-05-16T07:36:34Z","date_created":"2023-05-16T07:36:34Z","file_name":"2021_ASHPC_Schloegl.pdf","success":1}]},{"date_published":"2021-04-10T00:00:00Z","has_accepted_license":"1","month":"04","publisher":"Dryad","date_updated":"2023-08-08T13:34:07Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Data from: Genetic variation for adaptive traits is associated with polymorphic inversions in Littorina saxatilis","oa":1,"author":[{"full_name":"Koch, Eva","last_name":"Koch","first_name":"Eva"},{"last_name":"Morales","first_name":"Hernán E.","full_name":"Morales, Hernán E."},{"first_name":"Jenny","last_name":"Larsson","full_name":"Larsson, Jenny"},{"id":"3C147470-F248-11E8-B48F-1D18A9856A87","first_name":"Anja M","orcid":"0000-0003-1050-4969","last_name":"Westram","full_name":"Westram, Anja M"},{"last_name":"Faria","first_name":"Rui","full_name":"Faria, Rui"},{"last_name":"Lemmon","first_name":"Alan R.","full_name":"Lemmon, Alan R."},{"full_name":"Lemmon, E. Moriarty","last_name":"Lemmon","first_name":"E. Moriarty"},{"first_name":"Kerstin","last_name":"Johannesson","full_name":"Johannesson, Kerstin"},{"first_name":"Roger K.","last_name":"Butlin","full_name":"Butlin, Roger K."}],"article_processing_charge":"No","department":[{"_id":"NiBa"}],"year":"2021","citation":{"chicago":"Koch, Eva, Hernán E. Morales, Jenny Larsson, Anja M Westram, Rui Faria, Alan R. Lemmon, E. Moriarty Lemmon, Kerstin Johannesson, and Roger K. Butlin. “Data from: Genetic Variation for Adaptive Traits Is Associated with Polymorphic Inversions in Littorina Saxatilis.” Dryad, 2021. <a href=\"https://doi.org/10.5061/DRYAD.ZGMSBCCB4\">https://doi.org/10.5061/DRYAD.ZGMSBCCB4</a>.","ama":"Koch E, Morales HE, Larsson J, et al. Data from: Genetic variation for adaptive traits is associated with polymorphic inversions in Littorina saxatilis. 2021. doi:<a href=\"https://doi.org/10.5061/DRYAD.ZGMSBCCB4\">10.5061/DRYAD.ZGMSBCCB4</a>","ista":"Koch E, Morales HE, Larsson J, Westram AM, Faria R, Lemmon AR, Lemmon EM, Johannesson K, Butlin RK. 2021. Data from: Genetic variation for adaptive traits is associated with polymorphic inversions in Littorina saxatilis, Dryad, <a href=\"https://doi.org/10.5061/DRYAD.ZGMSBCCB4\">10.5061/DRYAD.ZGMSBCCB4</a>.","ieee":"E. Koch <i>et al.</i>, “Data from: Genetic variation for adaptive traits is associated with polymorphic inversions in Littorina saxatilis.” Dryad, 2021.","short":"E. Koch, H.E. Morales, J. Larsson, A.M. Westram, R. Faria, A.R. Lemmon, E.M. Lemmon, K. Johannesson, R.K. Butlin, (2021).","mla":"Koch, Eva, et al. <i>Data from: Genetic Variation for Adaptive Traits Is Associated with Polymorphic Inversions in Littorina Saxatilis</i>. Dryad, 2021, doi:<a href=\"https://doi.org/10.5061/DRYAD.ZGMSBCCB4\">10.5061/DRYAD.ZGMSBCCB4</a>.","apa":"Koch, E., Morales, H. E., Larsson, J., Westram, A. M., Faria, R., Lemmon, A. R., … Butlin, R. K. (2021). Data from: Genetic variation for adaptive traits is associated with polymorphic inversions in Littorina saxatilis. Dryad. <a href=\"https://doi.org/10.5061/DRYAD.ZGMSBCCB4\">https://doi.org/10.5061/DRYAD.ZGMSBCCB4</a>"},"abstract":[{"text":"Chromosomal inversion polymorphisms, segments of chromosomes that are flipped in orientation and occur in reversed order in some individuals, have long been recognized to play an important role in local adaptation. They can reduce recombination in heterozygous individuals and thus help to maintain sets of locally adapted alleles. In a wide range of organisms, populations adapted to different habitats differ in frequency of inversion arrangements. However, getting a full understanding of the importance of inversions for adaptation requires confirmation of their influence on traits under divergent selection. Here, we studied a marine snail, Littorina saxatilis, that has evolved ecotypes adapted to wave exposure or crab predation. These two types occur in close proximity on different parts of the shore. Gene flow between them exists in contact zones. However, they exhibit strong phenotypic divergence in several traits under habitat-specific selection, including size, shape and behaviour. We used crosses between these ecotypes to identify genomic regions that explain variation in these traits by using QTL analysis and variance partitioning across linkage groups. We could show that previously detected inversion regions contribute to adaptive divergence. Some inversions influenced multiple traits suggesting that they contain sets of locally adaptive alleles. Our study also identified regions without known inversions that are important for phenotypic divergence. Thus, we provide a more complete overview of the importance of inversions in relation to the remaining genome.","lang":"eng"}],"type":"research_data_reference","tmp":{"short":"CC0 (1.0)","image":"/images/cc_0.png","name":"Creative Commons Public Domain Dedication (CC0 1.0)","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode"},"ddc":["570"],"_id":"12987","date_created":"2023-05-16T12:34:09Z","status":"public","day":"10","doi":"10.5061/DRYAD.ZGMSBCCB4","main_file_link":[{"open_access":"1","url":"https://doi.org/10.5061/dryad.zgmsbccb4"}],"related_material":{"record":[{"status":"public","relation":"used_in_publication","id":"9394"}]},"oa_version":"Published Version"},{"publication_status":"published","_id":"9728","abstract":[{"text":"Most real-world flows are multiphase, yet we know little about them compared to their single-phase counterparts. Multiphase flows are more difficult to investigate as their dynamics occur in large parameter space and involve complex phenomena such as preferential concentration, turbulence modulation, non-Newtonian rheology, etc. Over the last few decades, experiments in particle-laden flows have taken a back seat in favour of ever-improving computational resources. However, computers are still not powerful enough to simulate a real-world fluid with millions of finite-size particles. Experiments are essential not only because they offer a reliable way to investigate real-world multiphase flows but also because they serve to validate numerical studies and steer the research in a relevant direction. In this work, we have experimentally investigated particle-laden flows in pipes, and in particular, examined the effect of particles on the laminar-turbulent transition and the drag scaling in turbulent flows.\r\n\r\nFor particle-laden pipe flows, an earlier study [Matas et al., 2003] reported how the sub-critical (i.e., hysteretic) transition that occurs via localised turbulent structures called puffs is affected by the addition of particles. In this study, in addition to this known transition, we found a super-critical transition to a globally fluctuating state with increasing particle concentration. At the same time, the Newtonian-type transition via puffs is delayed to larger Reynolds numbers. At an even higher concentration, only the globally fluctuating state is found. The dynamics of particle-laden flows are hence determined by two competing instabilities that give rise to three flow regimes: Newtonian-type turbulence at low, a particle-induced globally fluctuating state at high, and a coexistence state at intermediate concentrations.\r\n\r\nThe effect of particles on turbulent drag is ambiguous, with studies reporting drag reduction, no net change, and even drag increase. The ambiguity arises because, in addition to particle concentration, particle shape, size, and density also affect the net drag. Even similar particles might affect the flow dissimilarly in different Reynolds number and concentration ranges. In the present study, we explored a wide range of both Reynolds number and concentration, using spherical as well as cylindrical particles. We found that the spherical particles do not reduce drag while the cylindrical particles are drag-reducing within a specific Reynolds number interval. The interval strongly depends on the particle concentration and the relative size of the pipe and particles. Within this interval, the magnitude of drag reduction reaches a maximum. These drag reduction maxima appear to fall onto a distinct power-law curve irrespective of the pipe diameter and particle concentration, and this curve can be considered as the maximum drag reduction asymptote for a given fibre shape. Such an asymptote is well known for polymeric flows but had not been identified for particle-laden flows prior to this work.","lang":"eng"}],"file_date_updated":"2022-07-29T22:30:05Z","type":"dissertation","citation":{"mla":"Agrawal, Nishchal. <i>Transition to Turbulence and Drag Reduction in Particle-Laden Pipe Flows</i>. Institute of Science and Technology Austria, 2021, doi:<a href=\"https://doi.org/10.15479/at:ista:9728\">10.15479/at:ista:9728</a>.","apa":"Agrawal, N. (2021). <i>Transition to turbulence and drag reduction in particle-laden pipe flows</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:9728\">https://doi.org/10.15479/at:ista:9728</a>","chicago":"Agrawal, Nishchal. “Transition to Turbulence and Drag Reduction in Particle-Laden Pipe Flows.” Institute of Science and Technology Austria, 2021. <a href=\"https://doi.org/10.15479/at:ista:9728\">https://doi.org/10.15479/at:ista:9728</a>.","ama":"Agrawal N. Transition to turbulence and drag reduction in particle-laden pipe flows. 2021. doi:<a href=\"https://doi.org/10.15479/at:ista:9728\">10.15479/at:ista:9728</a>","short":"N. Agrawal, Transition to Turbulence and Drag Reduction in Particle-Laden Pipe Flows, Institute of Science and Technology Austria, 2021.","ieee":"N. Agrawal, “Transition to turbulence and drag reduction in particle-laden pipe flows,” Institute of Science and Technology Austria, 2021.","ista":"Agrawal N. 2021. Transition to turbulence and drag reduction in particle-laden pipe flows. Institute of Science and Technology Austria."},"publication_identifier":{"issn":["2663-337X"]},"language":[{"iso":"eng"}],"department":[{"_id":"GradSch"},{"_id":"BjHo"}],"article_processing_charge":"No","author":[{"id":"469E6004-F248-11E8-B48F-1D18A9856A87","first_name":"Nishchal","last_name":"Agrawal","full_name":"Agrawal, Nishchal"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","title":"Transition to turbulence and drag reduction in particle-laden pipe flows","file":[{"file_name":"Transition to Turbulence and Drag Reduction in Particle-Laden Pipe Flows.zip","date_updated":"2022-07-29T22:30:05Z","date_created":"2021-07-28T13:32:02Z","file_id":"9744","content_type":"application/x-zip-compressed","embargo_to":"open_access","creator":"nagrawal","file_size":22859658,"relation":"source_file","checksum":"77436be3563a90435024307b1b5ee7e8","access_level":"closed"},{"file_size":18658048,"creator":"nagrawal","file_id":"9745","content_type":"application/pdf","access_level":"open_access","embargo":"2022-07-28","relation":"main_file","checksum":"72a891d7daba85445c29b868c22575ed","file_name":"Transition to Turbulence and Drag Reduction in Particle-Laden Pipe Flows.pdf","date_created":"2021-07-28T13:32:05Z","date_updated":"2022-07-29T22:30:05Z"}],"publisher":"Institute of Science and Technology Austria","has_accepted_license":"1","oa_version":"Published Version","related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"6189"}]},"doi":"10.15479/at:ista:9728","degree_awarded":"PhD","day":"29","status":"public","supervisor":[{"last_name":"Hof","orcid":"0000-0003-2057-2754","id":"3A374330-F248-11E8-B48F-1D18A9856A87","first_name":"Björn","full_name":"Hof, Björn"}],"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"date_created":"2021-07-27T13:40:30Z","ddc":["532"],"year":"2021","page":"118","acknowledged_ssus":[{"_id":"M-Shop"}],"oa":1,"keyword":["Drag Reduction","Transition to Turbulence","Multiphase Flows","particle Laden Flows","Complex Flows","Experiments","Fluid Dynamics"],"date_updated":"2024-02-28T13:14:39Z","alternative_title":["ISTA Thesis"],"date_published":"2021-07-29T00:00:00Z","month":"07"},{"ec_funded":1,"oa_version":"Published Version","related_material":{"record":[{"id":"9787","status":"public","relation":"part_of_dissertation"},{"status":"public","relation":"part_of_dissertation","id":"9792"},{"status":"public","relation":"part_of_dissertation","id":"9225"},{"status":"public","relation":"part_of_dissertation","id":"9781"},{"status":"public","relation":"part_of_dissertation","id":"9791"}]},"doi":"10.15479/at:ista:9733","degree_awarded":"PhD","supervisor":[{"first_name":"Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","last_name":"Seiringer","orcid":"0000-0002-6781-0521","full_name":"Seiringer, Robert"},{"first_name":"Jan","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","last_name":"Maas","orcid":"0000-0002-0845-1338","full_name":"Maas, Jan"}],"status":"public","day":"20","date_created":"2021-07-27T15:48:30Z","tmp":{"short":"CC BY-ND (4.0)","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","image":"/image/cc_by_nd.png"},"ddc":["515","519","539"],"year":"2021","license":"https://creativecommons.org/licenses/by-nd/4.0/","page":"180","oa":1,"date_updated":"2024-03-06T12:30:44Z","month":"08","date_published":"2021-08-20T00:00:00Z","alternative_title":["ISTA Thesis"],"publication_status":"published","project":[{"grant_number":"716117","call_identifier":"H2020","_id":"256E75B8-B435-11E9-9278-68D0E5697425","name":"Optimal Transport and Stochastic Dynamics"},{"grant_number":"694227","call_identifier":"H2020","name":"Analysis of quantum many-body systems","_id":"25C6DC12-B435-11E9-9278-68D0E5697425"},{"grant_number":"F6504","name":"Taming Complexity in Partial Differential Systems","_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2"}],"_id":"9733","type":"dissertation","file_date_updated":"2022-03-10T12:13:57Z","abstract":[{"text":"This thesis is the result of the research carried out by the author during his PhD at IST Austria between 2017 and 2021. It mainly focuses on the Fröhlich polaron model, specifically to its regime of strong coupling. This model, which is rigorously introduced and discussed in the introduction, has been of great interest in condensed matter physics and field theory for more than eighty years. It is used to describe an electron interacting with the atoms of a solid material (the strength of this interaction is modeled by the presence of a coupling constant α in the Hamiltonian of the system). The particular regime examined here, which is mathematically described by considering the limit α →∞, displays many interesting features related to the emergence of classical behavior, which allows for a simplified effective description of the system under analysis. The properties, the range of validity and a quantitative analysis of the precision of such classical approximations are the main object of the present work. We specify our investigation to the study of the ground state energy of the system, its dynamics and its effective mass. For each of these problems, we provide in the introduction an overview of the previously known results and a detailed account of the original contributions by the author.","lang":"eng"}],"publication_identifier":{"issn":["2663-337X"]},"citation":{"apa":"Feliciangeli, D. (2021). <i>The polaron at strong coupling</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:9733\">https://doi.org/10.15479/at:ista:9733</a>","mla":"Feliciangeli, Dario. <i>The Polaron at Strong Coupling</i>. Institute of Science and Technology Austria, 2021, doi:<a href=\"https://doi.org/10.15479/at:ista:9733\">10.15479/at:ista:9733</a>.","ama":"Feliciangeli D. The polaron at strong coupling. 2021. doi:<a href=\"https://doi.org/10.15479/at:ista:9733\">10.15479/at:ista:9733</a>","ieee":"D. Feliciangeli, “The polaron at strong coupling,” Institute of Science and Technology Austria, 2021.","ista":"Feliciangeli D. 2021. The polaron at strong coupling. Institute of Science and Technology Austria.","short":"D. Feliciangeli, The Polaron at Strong Coupling, Institute of Science and Technology Austria, 2021.","chicago":"Feliciangeli, Dario. “The Polaron at Strong Coupling.” Institute of Science and Technology Austria, 2021. <a href=\"https://doi.org/10.15479/at:ista:9733\">https://doi.org/10.15479/at:ista:9733</a>."},"language":[{"iso":"eng"}],"department":[{"_id":"GradSch"},{"_id":"RoSe"},{"_id":"JaMa"}],"article_processing_charge":"No","file":[{"creator":"dfelicia","file_size":1958710,"file_id":"9944","content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"e88bb8ca43948abe060eb2d2fa719881","file_name":"Thesis_FeliciangeliA.pdf","date_updated":"2021-09-06T09:28:56Z","date_created":"2021-08-19T14:03:48Z"},{"file_name":"thesis.7z","date_updated":"2022-03-10T12:13:57Z","date_created":"2021-08-19T14:06:35Z","file_id":"9945","content_type":"application/octet-stream","file_size":3771669,"creator":"dfelicia","access_level":"closed","relation":"source_file","checksum":"72810843abee83705853505b3f8348aa"}],"title":"The polaron at strong coupling","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"full_name":"Feliciangeli, Dario","first_name":"Dario","id":"41A639AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0754-8530","last_name":"Feliciangeli"}],"publisher":"Institute of Science and Technology Austria","has_accepted_license":"1"},{"year":"2021","external_id":{"pmid":["34318749"],"isi":["000692027800001"]},"oa":1,"date_updated":"2023-08-11T10:26:29Z","article_number":"e68876","acknowledgement":"We would like to thank Leif Tueffers and João Botelho for discussions and suggestions as well as Kira Haas and Julia Bunk for technical support. We acknowledge financial support from the German Science Foundation (grant SCHU 1415/12-2 to HS, and funding under Germany’s Excellence Strategy EXC 2167–390884018 as well as the Research Training Group 2501 TransEvo to HS and SN), the Max Planck Society (IMPRS scholarship to AB; Max-Planck fellowship to HS), and the Leibniz Science Campus Evolutionary Medicine of the Lung (EvoLUNG, to HS and SN). This work was further supported by the German Science Foundation Research Infrastructure NGS_CC (project 407495230) as part of the Next Generation Sequencing Competence Network (project 423957469). NGS analyses were carried out at the Competence Centre for Genomic Analysis Kiel (CCGA Kiel).","date_published":"2021-07-28T00:00:00Z","intvolume":"        10","month":"07","oa_version":"Published Version","isi":1,"publication":"eLife","doi":"10.7554/elife.68876","main_file_link":[{"open_access":"1","url":"https://doi.org/10.7554/eLife.68876"}],"status":"public","day":"28","date_created":"2021-07-28T13:36:57Z","volume":10,"pmid":1,"article_type":"original","language":[{"iso":"eng"}],"department":[{"_id":"CaGu"}],"article_processing_charge":"No","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","author":[{"full_name":"Batra, Aditi","last_name":"Batra","first_name":"Aditi"},{"last_name":"Römhild","orcid":"0000-0001-9480-5261","first_name":"Roderich","id":"68E56E44-62B0-11EA-B963-444F3DDC885E","full_name":"Römhild, Roderich"},{"last_name":"Rousseau","first_name":"Emilie","full_name":"Rousseau, Emilie"},{"full_name":"Franzenburg, Sören","last_name":"Franzenburg","first_name":"Sören"},{"first_name":"Stefan","last_name":"Niemann","full_name":"Niemann, Stefan"},{"full_name":"Schulenburg, Hinrich","first_name":"Hinrich","last_name":"Schulenburg"}],"title":"High potency of sequential therapy with only beta-lactam antibiotics","publisher":"eLife Sciences Publications","publication_status":"published","quality_controlled":"1","_id":"9746","scopus_import":"1","abstract":[{"lang":"eng","text":"Evolutionary adaptation is a major source of antibiotic resistance in bacterial pathogens. Evolution-informed therapy aims to constrain resistance by accounting for bacterial evolvability. Sequential treatments with antibiotics that target different bacterial processes were previously shown to limit adaptation through genetic resistance trade-offs and negative hysteresis. Treatment with homogeneous sets of antibiotics is generally viewed to be disadvantageous, as it should rapidly lead to cross-resistance. We here challenged this assumption by determining the evolutionary response of Pseudomonas aeruginosa to experimental sequential treatments involving both heterogenous and homogeneous antibiotic sets. To our surprise, we found that fast switching between only β-lactam antibiotics resulted in increased extinction of bacterial populations. We demonstrate that extinction is favored by low rates of spontaneous resistance emergence and low levels of spontaneous cross-resistance among the antibiotics in sequence. The uncovered principles may help to guide the optimized use of available antibiotics in highly potent, evolution-informed treatment designs."}],"type":"journal_article","citation":{"chicago":"Batra, Aditi, Roderich Römhild, Emilie Rousseau, Sören Franzenburg, Stefan Niemann, and Hinrich Schulenburg. “High Potency of Sequential Therapy with Only Beta-Lactam Antibiotics.” <i>ELife</i>. eLife Sciences Publications, 2021. <a href=\"https://doi.org/10.7554/elife.68876\">https://doi.org/10.7554/elife.68876</a>.","short":"A. Batra, R. Römhild, E. Rousseau, S. Franzenburg, S. Niemann, H. Schulenburg, ELife 10 (2021).","ieee":"A. Batra, R. Römhild, E. Rousseau, S. Franzenburg, S. Niemann, and H. Schulenburg, “High potency of sequential therapy with only beta-lactam antibiotics,” <i>eLife</i>, vol. 10. eLife Sciences Publications, 2021.","ista":"Batra A, Römhild R, Rousseau E, Franzenburg S, Niemann S, Schulenburg H. 2021. High potency of sequential therapy with only beta-lactam antibiotics. eLife. 10, e68876.","ama":"Batra A, Römhild R, Rousseau E, Franzenburg S, Niemann S, Schulenburg H. High potency of sequential therapy with only beta-lactam antibiotics. <i>eLife</i>. 2021;10. doi:<a href=\"https://doi.org/10.7554/elife.68876\">10.7554/elife.68876</a>","mla":"Batra, Aditi, et al. “High Potency of Sequential Therapy with Only Beta-Lactam Antibiotics.” <i>ELife</i>, vol. 10, e68876, eLife Sciences Publications, 2021, doi:<a href=\"https://doi.org/10.7554/elife.68876\">10.7554/elife.68876</a>.","apa":"Batra, A., Römhild, R., Rousseau, E., Franzenburg, S., Niemann, S., &#38; Schulenburg, H. (2021). High potency of sequential therapy with only beta-lactam antibiotics. <i>ELife</i>. eLife Sciences Publications. <a href=\"https://doi.org/10.7554/elife.68876\">https://doi.org/10.7554/elife.68876</a>"},"publication_identifier":{"eissn":["2050-084X"]}},{"year":"2021","page":"267-283","series_title":"Neuromethods","keyword":["Freeze-fracture replica: Deep learning","Immunogold labeling","Integral membrane protein","Electron microscopy"],"date_updated":"2024-03-25T23:30:16Z","acknowledgement":"This work was supported by the European Union (European Research Council Advanced grant no. 694539 and Human Brain Project Ref. 720270 to R. S.) and the Austrian Academy of Sciences (DOC fellowship to D.K.).","date_published":"2021-07-27T00:00:00Z","alternative_title":["Neuromethods"],"month":"07","intvolume":"       169","oa_version":"None","ec_funded":1,"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"9562"}]},"publication":" Receptor and Ion Channel Detection in the Brain","doi":"10.1007/978-1-0716-1522-5_19","day":"27","status":"public","ddc":["573"],"date_created":"2021-07-30T09:34:56Z","volume":169,"language":[{"iso":"eng"}],"department":[{"_id":"RySh"},{"_id":"EM-Fac"}],"article_processing_charge":"No","user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425","author":[{"full_name":"Kaufmann, Walter","id":"3F99E422-F248-11E8-B48F-1D18A9856A87","first_name":"Walter","orcid":"0000-0001-9735-5315","last_name":"Kaufmann"},{"full_name":"Kleindienst, David","last_name":"Kleindienst","first_name":"David","id":"42E121A4-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Harada, Harumi","orcid":"0000-0001-7429-7896","last_name":"Harada","first_name":"Harumi","id":"2E55CDF2-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0001-8761-9444","last_name":"Shigemoto","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","first_name":"Ryuichi","full_name":"Shigemoto, Ryuichi"}],"title":"High-Resolution localization and quantitation of membrane proteins by SDS-digested freeze-fracture replica labeling (SDS-FRL)","publisher":"Humana","has_accepted_license":"1","place":"New York","publication_status":"published","project":[{"grant_number":"694539","call_identifier":"H2020","name":"In situ analysis of single channel subunit composition in neurons: physiological implication in synaptic plasticity and behaviour","_id":"25CA28EA-B435-11E9-9278-68D0E5697425"},{"call_identifier":"H2020","grant_number":"720270","name":"Human Brain Project Specific Grant Agreement 1 (HBP SGA 1)","_id":"25CBA828-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","_id":"9756","abstract":[{"lang":"eng","text":"High-resolution visualization and quantification of membrane proteins contribute to the understanding of their functions and the roles they play in physiological and pathological conditions. Sodium dodecyl sulfate-digested freeze-fracture replica labeling (SDS-FRL) is a powerful electron microscopy method to study quantitatively the two-dimensional distribution of transmembrane proteins and their tightly associated proteins. During treatment with SDS, intracellular organelles and proteins not anchored to the replica are dissolved, whereas integral membrane proteins captured and stabilized by carbon/platinum deposition remain on the replica. Their intra- and extracellular domains become exposed on the surface of the replica, facilitating the accessibility of antibodies and, therefore, providing higher labeling efficiency than those obtained with other immunoelectron microscopy techniques. In this chapter, we describe the protocols of SDS-FRL adapted for mammalian brain samples, and optimization of the SDS treatment to increase the labeling efficiency for quantification of Cav2.1, the alpha subunit of P/Q-type voltage-dependent calcium channels utilizing deep learning algorithms."}],"type":"book_chapter","citation":{"apa":"Kaufmann, W., Kleindienst, D., Harada, H., &#38; Shigemoto, R. (2021). High-Resolution localization and quantitation of membrane proteins by SDS-digested freeze-fracture replica labeling (SDS-FRL). In <i> Receptor and Ion Channel Detection in the Brain</i> (Vol. 169, pp. 267–283). New York: Humana. <a href=\"https://doi.org/10.1007/978-1-0716-1522-5_19\">https://doi.org/10.1007/978-1-0716-1522-5_19</a>","mla":"Kaufmann, Walter, et al. “High-Resolution Localization and Quantitation of Membrane Proteins by SDS-Digested Freeze-Fracture Replica Labeling (SDS-FRL).” <i> Receptor and Ion Channel Detection in the Brain</i>, vol. 169, Humana, 2021, pp. 267–83, doi:<a href=\"https://doi.org/10.1007/978-1-0716-1522-5_19\">10.1007/978-1-0716-1522-5_19</a>.","short":"W. Kaufmann, D. Kleindienst, H. Harada, R. Shigemoto, in:,  Receptor and Ion Channel Detection in the Brain, Humana, New York, 2021, pp. 267–283.","ieee":"W. Kaufmann, D. Kleindienst, H. Harada, and R. Shigemoto, “High-Resolution localization and quantitation of membrane proteins by SDS-digested freeze-fracture replica labeling (SDS-FRL),” in <i> Receptor and Ion Channel Detection in the Brain</i>, vol. 169, New York: Humana, 2021, pp. 267–283.","ista":"Kaufmann W, Kleindienst D, Harada H, Shigemoto R. 2021.High-Resolution localization and quantitation of membrane proteins by SDS-digested freeze-fracture replica labeling (SDS-FRL). In:  Receptor and Ion Channel Detection in the Brain. Neuromethods, vol. 169, 267–283.","ama":"Kaufmann W, Kleindienst D, Harada H, Shigemoto R. High-Resolution localization and quantitation of membrane proteins by SDS-digested freeze-fracture replica labeling (SDS-FRL). In: <i> Receptor and Ion Channel Detection in the Brain</i>. Vol 169. Neuromethods. New York: Humana; 2021:267-283. doi:<a href=\"https://doi.org/10.1007/978-1-0716-1522-5_19\">10.1007/978-1-0716-1522-5_19</a>","chicago":"Kaufmann, Walter, David Kleindienst, Harumi Harada, and Ryuichi Shigemoto. “High-Resolution Localization and Quantitation of Membrane Proteins by SDS-Digested Freeze-Fracture Replica Labeling (SDS-FRL).” In <i> Receptor and Ion Channel Detection in the Brain</i>, 169:267–83. Neuromethods. New York: Humana, 2021. <a href=\"https://doi.org/10.1007/978-1-0716-1522-5_19\">https://doi.org/10.1007/978-1-0716-1522-5_19</a>."},"publication_identifier":{"eisbn":["9781071615225"],"isbn":["9781071615218"]}},{"file":[{"file_name":"2021_PlosCompBio_Bartlett.pdf","date_updated":"2021-08-05T12:06:49Z","date_created":"2021-08-05T12:06:49Z","file_id":"9771","content_type":"application/pdf","file_size":693633,"creator":"cchlebak","checksum":"e56d91f0eeadb36f143a90e2c1b3ab63","relation":"main_file","access_level":"open_access"}],"author":[{"last_name":"Bartlett","first_name":"Michael John","full_name":"Bartlett, Michael John"},{"full_name":"Arslan, Feyza N","orcid":"0000-0001-5809-9566","last_name":"Arslan","first_name":"Feyza N","id":"49DA7910-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Bankston, Adriana","first_name":"Adriana","last_name":"Bankston"},{"first_name":"Sarvenaz","last_name":"Sarabipour","full_name":"Sarabipour, Sarvenaz"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","title":"Ten simple rules to improve academic work- life balance","publisher":"Public Library of Science","has_accepted_license":"1","article_type":"letter_note","language":[{"iso":"eng"}],"department":[{"_id":"CaHe"}],"article_processing_charge":"Yes","_id":"9759","type":"journal_article","file_date_updated":"2021-08-05T12:06:49Z","scopus_import":"1","publication_identifier":{"issn":["1553734X"],"eissn":["15537358"]},"citation":{"mla":"Bartlett, Michael John, et al. “Ten Simple Rules to Improve Academic Work- Life Balance.” <i>PLoS Computational Biology</i>, vol. 17, no. 7, e1009124, Public Library of Science, 2021, doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1009124\">10.1371/journal.pcbi.1009124</a>.","apa":"Bartlett, M. J., Arslan, F. N., Bankston, A., &#38; Sarabipour, S. (2021). Ten simple rules to improve academic work- life balance. <i>PLoS Computational Biology</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pcbi.1009124\">https://doi.org/10.1371/journal.pcbi.1009124</a>","chicago":"Bartlett, Michael John, Feyza N Arslan, Adriana Bankston, and Sarvenaz Sarabipour. “Ten Simple Rules to Improve Academic Work- Life Balance.” <i>PLoS Computational Biology</i>. Public Library of Science, 2021. <a href=\"https://doi.org/10.1371/journal.pcbi.1009124\">https://doi.org/10.1371/journal.pcbi.1009124</a>.","ama":"Bartlett MJ, Arslan FN, Bankston A, Sarabipour S. Ten simple rules to improve academic work- life balance. <i>PLoS Computational Biology</i>. 2021;17(7). doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1009124\">10.1371/journal.pcbi.1009124</a>","ieee":"M. J. Bartlett, F. N. Arslan, A. Bankston, and S. Sarabipour, “Ten simple rules to improve academic work- life balance,” <i>PLoS Computational Biology</i>, vol. 17, no. 7. Public Library of Science, 2021.","short":"M.J. Bartlett, F.N. Arslan, A. Bankston, S. Sarabipour, PLoS Computational Biology 17 (2021).","ista":"Bartlett MJ, Arslan FN, Bankston A, Sarabipour S. 2021. Ten simple rules to improve academic work- life balance. PLoS Computational Biology. 17(7), e1009124."},"publication_status":"published","issue":"7","oa":1,"date_updated":"2023-08-10T14:16:46Z","article_number":"e1009124","acknowledgement":"The authors thank Inez Lam of Johns Hopkins University for valuable comments on an earlier version of the manuscript. We also thank the facilitators of the 2019–2020 eLife Community Ambassador program.","month":"07","intvolume":"        17","date_published":"2021-07-15T00:00:00Z","year":"2021","external_id":{"pmid":["34264932"],"isi":["000677713500008"]},"status":"public","day":"15","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ddc":["613"],"date_created":"2021-08-01T22:01:21Z","pmid":1,"volume":17,"isi":1,"oa_version":"Published Version","doi":"10.1371/journal.pcbi.1009124","publication":"PLoS Computational Biology"},{"external_id":{"isi":["000669830600001"],"arxiv":["2101.05742"]},"year":"2021","acknowledgement":"We would like to thank D. Abanin and R. Medina for fruitful discussions and A. Smith and I. Kim for valuable feedback on the manuscript. We acknowledge support by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation program (Grant Agreement No. 850899).","article_number":"491","date_published":"2021-07-01T00:00:00Z","intvolume":"         5","month":"07","oa":1,"date_updated":"2023-12-13T14:47:25Z","publication":"Quantum","doi":"10.22331/Q-2021-07-01-491","ec_funded":1,"oa_version":"Published Version","isi":1,"related_material":{"record":[{"id":"14622","relation":"dissertation_contains","status":"public"}]},"volume":5,"status":"public","day":"01","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ddc":["530"],"date_created":"2021-08-01T22:01:21Z","department":[{"_id":"GradSch"},{"_id":"MaSe"}],"article_processing_charge":"Yes","article_type":"original","language":[{"iso":"eng"}],"publisher":"Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften","has_accepted_license":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Sack","orcid":"0000-0001-5400-8508","id":"dd622248-f6e0-11ea-865d-ce382a1c81a5","first_name":"Stefan","full_name":"Sack, Stefan"},{"id":"47809E7E-F248-11E8-B48F-1D18A9856A87","first_name":"Maksym","orcid":"0000-0002-2399-5827","last_name":"Serbyn","full_name":"Serbyn, Maksym"}],"title":"Quantum annealing initialization of the quantum approximate optimization algorithm","file":[{"file_size":2312482,"creator":"cchlebak","file_id":"9774","content_type":"application/pdf","checksum":"9706c2bb8e748e9b5b138381995a7f6f","relation":"main_file","access_level":"open_access","file_name":"2021_Quantum_Sack.pdf","date_created":"2021-08-06T06:44:31Z","date_updated":"2021-08-06T06:44:31Z"}],"publication_status":"published","project":[{"grant_number":"850899","call_identifier":"H2020","_id":"23841C26-32DE-11EA-91FC-C7463DDC885E","name":"Non-Ergodic Quantum Matter: Universality, Dynamics and Control"}],"scopus_import":"1","abstract":[{"lang":"eng","text":"The quantum approximate optimization algorithm (QAOA) is a prospective near-term quantum algorithm due to its modest circuit depth and promising benchmarks. However, an external parameter optimization required in the QAOA could become a performance bottleneck. This motivates studies of the optimization landscape and search for heuristic ways of parameter initialization. In this work we visualize the optimization landscape of the QAOA applied to the MaxCut problem on random graphs, demonstrating that random initialization of the QAOA is prone to converging to local minima with suboptimal performance. We introduce the initialization of QAOA parameters based on the Trotterized quantum annealing (TQA) protocol, parameterized by the Trotter time step. We find that the TQA initialization allows to circumvent\r\nthe issue of false minima for a broad range of time steps, yielding the same performance as the best result out of an exponentially scaling number of random initializations. Moreover, we demonstrate that the optimal value of the time step coincides with the point of proliferation of Trotter errors in quantum annealing. Our results suggest practical ways of initializing QAOA protocols on near-term quantum devices and reveal new connections between QAOA and quantum annealing."}],"arxiv":1,"file_date_updated":"2021-08-06T06:44:31Z","type":"journal_article","publication_identifier":{"eissn":["2521-327X"]},"citation":{"ista":"Sack S, Serbyn M. 2021. Quantum annealing initialization of the quantum approximate optimization algorithm. Quantum. 5, 491.","short":"S. Sack, M. Serbyn, Quantum 5 (2021).","ieee":"S. Sack and M. Serbyn, “Quantum annealing initialization of the quantum approximate optimization algorithm,” <i>Quantum</i>, vol. 5. Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften, 2021.","ama":"Sack S, Serbyn M. Quantum annealing initialization of the quantum approximate optimization algorithm. <i>Quantum</i>. 2021;5. doi:<a href=\"https://doi.org/10.22331/Q-2021-07-01-491\">10.22331/Q-2021-07-01-491</a>","chicago":"Sack, Stefan, and Maksym Serbyn. “Quantum Annealing Initialization of the Quantum Approximate Optimization Algorithm.” <i>Quantum</i>. Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften, 2021. <a href=\"https://doi.org/10.22331/Q-2021-07-01-491\">https://doi.org/10.22331/Q-2021-07-01-491</a>.","apa":"Sack, S., &#38; Serbyn, M. (2021). Quantum annealing initialization of the quantum approximate optimization algorithm. <i>Quantum</i>. Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften. <a href=\"https://doi.org/10.22331/Q-2021-07-01-491\">https://doi.org/10.22331/Q-2021-07-01-491</a>","mla":"Sack, Stefan, and Maksym Serbyn. “Quantum Annealing Initialization of the Quantum Approximate Optimization Algorithm.” <i>Quantum</i>, vol. 5, 491, Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften, 2021, doi:<a href=\"https://doi.org/10.22331/Q-2021-07-01-491\">10.22331/Q-2021-07-01-491</a>."},"quality_controlled":"1","_id":"9760"},{"year":"2021","external_id":{"isi":["000678193300001"],"pmid":["34201955"]},"oa":1,"issue":"7","date_updated":"2023-08-10T14:14:53Z","acknowledgement":"The authors are grateful to Kazuya Oikawa and Gillian McLellan for generously sharing some of their data for this review, and to Janis Eells for helpful comments on the manuscript.","article_number":"1593","date_published":"2021-06-25T00:00:00Z","intvolume":"        10","month":"06","oa_version":"Published Version","isi":1,"publication":"Cells","doi":"10.3390/cells10071593","status":"public","day":"25","date_created":"2021-08-01T22:01:22Z","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ddc":["570"],"volume":10,"pmid":1,"article_type":"original","language":[{"iso":"eng"}],"department":[{"_id":"SaSi"}],"article_processing_charge":"Yes","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","author":[{"last_name":"Muench","first_name":"Nicole A.","full_name":"Muench, Nicole A."},{"last_name":"Patel","first_name":"Sonia","full_name":"Patel, Sonia"},{"last_name":"Maes","orcid":"0000-0001-9642-1085","id":"3838F452-F248-11E8-B48F-1D18A9856A87","first_name":"Margaret E","full_name":"Maes, Margaret E"},{"last_name":"Donahue","first_name":"Ryan J.","full_name":"Donahue, Ryan J."},{"full_name":"Ikeda, Akihiro","first_name":"Akihiro","last_name":"Ikeda"},{"last_name":"Nickells","first_name":"Robert W.","full_name":"Nickells, Robert W."}],"title":"The influence of mitochondrial dynamics and function on retinal ganglion cell susceptibility in optic nerve disease","file":[{"content_type":"application/pdf","file_id":"9768","file_size":4555611,"creator":"cziletti","access_level":"open_access","relation":"main_file","checksum":"e0497ce5c77fa3b65a538c7d6e0f6c66","success":1,"file_name":"2021_Cells_Muench.pdf","date_created":"2021-08-04T14:01:30Z","date_updated":"2021-08-04T14:01:30Z"}],"publisher":"MDPI","has_accepted_license":"1","publication_status":"published","quality_controlled":"1","_id":"9761","abstract":[{"lang":"eng","text":"The important roles of mitochondrial function and dysfunction in the process of neurodegeneration are widely acknowledged. Retinal ganglion cells (RGCs) appear to be a highly vulnerable neuronal cell type in the central nervous system with respect to mitochondrial dysfunction but the actual reasons for this are still incompletely understood. These cells have a unique circumstance where unmyelinated axons must bend nearly 90° to exit the eye and then cross a translaminar pressure gradient before becoming myelinated in the optic nerve. This region, the optic nerve head, contains some of the highest density of mitochondria present in these cells. Glaucoma represents a perfect storm of events occurring at this location, with a combination of changes in the translaminar pressure gradient and reassignment of the metabolic support functions of supporting glia, which appears to apply increased metabolic stress to the RGC axons leading to a failure of axonal transport mechanisms. However, RGCs themselves are also extremely sensitive to genetic mutations, particularly in genes affecting mitochondrial dynamics and mitochondrial clearance. These mutations, which systemically affect the mitochondria in every cell, often lead to an optic neuropathy as the sole pathologic defect in affected patients. This review summarizes knowledge of mitochondrial structure and function, the known energy demands of neurons in general, and places these in the context of normal and pathological characteristics of mitochondria attributed to RGCs. "}],"scopus_import":"1","file_date_updated":"2021-08-04T14:01:30Z","type":"journal_article","publication_identifier":{"eissn":["20734409"]},"citation":{"short":"N.A. Muench, S. Patel, M.E. Maes, R.J. Donahue, A. Ikeda, R.W. Nickells, Cells 10 (2021).","ista":"Muench NA, Patel S, Maes ME, Donahue RJ, Ikeda A, Nickells RW. 2021. The influence of mitochondrial dynamics and function on retinal ganglion cell susceptibility in optic nerve disease. Cells. 10(7), 1593.","ieee":"N. A. Muench, S. Patel, M. E. Maes, R. J. Donahue, A. Ikeda, and R. W. Nickells, “The influence of mitochondrial dynamics and function on retinal ganglion cell susceptibility in optic nerve disease,” <i>Cells</i>, vol. 10, no. 7. MDPI, 2021.","ama":"Muench NA, Patel S, Maes ME, Donahue RJ, Ikeda A, Nickells RW. The influence of mitochondrial dynamics and function on retinal ganglion cell susceptibility in optic nerve disease. <i>Cells</i>. 2021;10(7). doi:<a href=\"https://doi.org/10.3390/cells10071593\">10.3390/cells10071593</a>","chicago":"Muench, Nicole A., Sonia Patel, Margaret E Maes, Ryan J. Donahue, Akihiro Ikeda, and Robert W. Nickells. “The Influence of Mitochondrial Dynamics and Function on Retinal Ganglion Cell Susceptibility in Optic Nerve Disease.” <i>Cells</i>. MDPI, 2021. <a href=\"https://doi.org/10.3390/cells10071593\">https://doi.org/10.3390/cells10071593</a>.","apa":"Muench, N. A., Patel, S., Maes, M. E., Donahue, R. J., Ikeda, A., &#38; Nickells, R. W. (2021). The influence of mitochondrial dynamics and function on retinal ganglion cell susceptibility in optic nerve disease. <i>Cells</i>. MDPI. <a href=\"https://doi.org/10.3390/cells10071593\">https://doi.org/10.3390/cells10071593</a>","mla":"Muench, Nicole A., et al. “The Influence of Mitochondrial Dynamics and Function on Retinal Ganglion Cell Susceptibility in Optic Nerve Disease.” <i>Cells</i>, vol. 10, no. 7, 1593, MDPI, 2021, doi:<a href=\"https://doi.org/10.3390/cells10071593\">10.3390/cells10071593</a>."}}]