[{"license":"https://creativecommons.org/licenses/by/4.0/","quality_controlled":"1","month":"05","pubrep_id":"1014","oa_version":"Published Version","citation":{"short":"P. Oliveto, T. Paixao, J. Pérez Heredia, D. Sudholt, B. Trubenova, Algorithmica 80 (2018) 1604–1633.","ieee":"P. Oliveto, T. Paixao, J. Pérez Heredia, D. Sudholt, and B. Trubenova, “How to escape local optima in black box optimisation when non elitism outperforms elitism,” Algorithmica, vol. 80, no. 5. Springer, pp. 1604–1633, 2018.","ista":"Oliveto P, Paixao T, Pérez Heredia J, Sudholt D, Trubenova B. 2018. How to escape local optima in black box optimisation when non elitism outperforms elitism. Algorithmica. 80(5), 1604–1633.","chicago":"Oliveto, Pietro, Tiago Paixao, Jorge Pérez Heredia, Dirk Sudholt, and Barbora Trubenova. “How to Escape Local Optima in Black Box Optimisation When Non Elitism Outperforms Elitism.” Algorithmica. Springer, 2018. https://doi.org/10.1007/s00453-017-0369-2.","ama":"Oliveto P, Paixao T, Pérez Heredia J, Sudholt D, Trubenova B. How to escape local optima in black box optimisation when non elitism outperforms elitism. Algorithmica. 2018;80(5):1604-1633. doi:10.1007/s00453-017-0369-2","apa":"Oliveto, P., Paixao, T., Pérez Heredia, J., Sudholt, D., & Trubenova, B. (2018). How to escape local optima in black box optimisation when non elitism outperforms elitism. Algorithmica. Springer. https://doi.org/10.1007/s00453-017-0369-2","mla":"Oliveto, Pietro, et al. “How to Escape Local Optima in Black Box Optimisation When Non Elitism Outperforms Elitism.” Algorithmica, vol. 80, no. 5, Springer, 2018, pp. 1604–33, doi:10.1007/s00453-017-0369-2."},"date_created":"2018-12-11T11:48:09Z","publication":"Algorithmica","type":"journal_article","oa":1,"external_id":{"isi":["000428239300010"]},"day":"01","status":"public","isi":1,"doi":"10.1007/s00453-017-0369-2","date_published":"2018-05-01T00:00:00Z","intvolume":" 80","abstract":[{"text":"Escaping local optima is one of the major obstacles to function optimisation. Using the metaphor of a fitness landscape, local optima correspond to hills separated by fitness valleys that have to be overcome. We define a class of fitness valleys of tunable difficulty by considering their length, representing the Hamming path between the two optima and their depth, the drop in fitness. For this function class we present a runtime comparison between stochastic search algorithms using different search strategies. The (1+1) EA is a simple and well-studied evolutionary algorithm that has to jump across the valley to a point of higher fitness because it does not accept worsening moves (elitism). In contrast, the Metropolis algorithm and the Strong Selection Weak Mutation (SSWM) algorithm, a famous process in population genetics, are both able to cross the fitness valley by accepting worsening moves. We show that the runtime of the (1+1) EA depends critically on the length of the valley while the runtimes of the non-elitist algorithms depend crucially on the depth of the valley. Moreover, we show that both SSWM and Metropolis can also efficiently optimise a rugged function consisting of consecutive valleys.","lang":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","file":[{"date_updated":"2020-07-14T12:47:54Z","file_name":"IST-2018-1014-v1+1_2018_Paixao_Escape.pdf","checksum":"7d92f5d7be81e387edeec4f06442791c","creator":"system","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"4674","date_created":"2018-12-12T10:08:14Z","file_size":691245}],"date_updated":"2023-09-11T14:11:35Z","author":[{"full_name":"Oliveto, Pietro","last_name":"Oliveto","first_name":"Pietro"},{"first_name":"Tiago","id":"2C5658E6-F248-11E8-B48F-1D18A9856A87","full_name":"Paixao, Tiago","last_name":"Paixao","orcid":"0000-0003-2361-3953"},{"first_name":"Jorge","last_name":"Pérez Heredia","full_name":"Pérez Heredia, Jorge"},{"full_name":"Sudholt, Dirk","last_name":"Sudholt","first_name":"Dirk"},{"first_name":"Barbora","last_name":"Trubenova","id":"42302D54-F248-11E8-B48F-1D18A9856A87","full_name":"Trubenova, Barbora","orcid":"0000-0002-6873-2967"}],"language":[{"iso":"eng"}],"tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"issue":"5","scopus_import":"1","year":"2018","has_accepted_license":"1","volume":80,"department":[{"_id":"NiBa"},{"_id":"CaGu"}],"title":"How to escape local optima in black box optimisation when non elitism outperforms elitism","page":"1604 - 1633","project":[{"grant_number":"618091","_id":"25B1EC9E-B435-11E9-9278-68D0E5697425","name":"Speed of Adaptation in Population Genetics and Evolutionary Computation","call_identifier":"FP7"}],"ddc":["576"],"file_date_updated":"2020-07-14T12:47:54Z","publication_status":"published","ec_funded":1,"_id":"723","publisher":"Springer","publist_id":"6957"},{"page":"166 - 207","title":"Automated competitive analysis of real time scheduling with graph games","project":[{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"name":"Game Theory","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407"},{"name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"department":[{"_id":"KrCh"}],"ec_funded":1,"_id":"738","publisher":"Springer","publist_id":"6929","ddc":["000"],"file_date_updated":"2020-07-14T12:47:56Z","publication_status":"published","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"},{"orcid":"0000-0002-8943-0722","id":"49704004-F248-11E8-B48F-1D18A9856A87","last_name":"Pavlogiannis","full_name":"Pavlogiannis, Andreas","first_name":"Andreas"},{"first_name":"Alexander","full_name":"Kößler, Alexander","last_name":"Kößler"},{"last_name":"Schmid","full_name":"Schmid, Ulrich","first_name":"Ulrich"}],"language":[{"iso":"eng"}],"abstract":[{"text":"This paper is devoted to automatic competitive analysis of real-time scheduling algorithms for firm-deadline tasksets, where only completed tasks con- tribute some utility to the system. Given such a taskset T , the competitive ratio of an on-line scheduling algorithm A for T is the worst-case utility ratio of A over the utility achieved by a clairvoyant algorithm. We leverage the theory of quantitative graph games to address the competitive analysis and competitive synthesis problems. For the competitive analysis case, given any taskset T and any finite-memory on- line scheduling algorithm A , we show that the competitive ratio of A in T can be computed in polynomial time in the size of the state space of A . Our approach is flexible as it also provides ways to model meaningful constraints on the released task sequences that determine the competitive ratio. We provide an experimental study of many well-known on-line scheduling algorithms, which demonstrates the feasibility of our competitive analysis approach that effectively replaces human ingenuity (required Preliminary versions of this paper have appeared in Chatterjee et al. ( 2013 , 2014 ). B Andreas Pavlogiannis pavlogiannis@ist.ac.at Krishnendu Chatterjee krish.chat@ist.ac.at Alexander Kößler koe@ecs.tuwien.ac.at Ulrich Schmid s@ecs.tuwien.ac.at 1 IST Austria (Institute of Science and Technology Austria), Am Campus 1, 3400 Klosterneuburg, Austria 2 Embedded Computing Systems Group, Vienna University of Technology, Treitlstrasse 3, 1040 Vienna, Austria 123 Real-Time Syst for finding worst-case scenarios) by computing power. For the competitive synthesis case, we are just given a taskset T , and the goal is to automatically synthesize an opti- mal on-line scheduling algorithm A , i.e., one that guarantees the largest competitive ratio possible for T . We show how the competitive synthesis problem can be reduced to a two-player graph game with partial information, and establish that the compu- tational complexity of solving this game is Np -complete. The competitive synthesis problem is hence in Np in the size of the state space of the non-deterministic labeled transition system encoding the taskset. Overall, the proposed framework assists in the selection of suitable scheduling algorithms for a given taskset, which is in fact the most common situation in real-time systems design. ","lang":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","date_updated":"2023-09-27T12:52:38Z","file":[{"creator":"system","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"5267","date_created":"2018-12-12T10:17:14Z","file_size":1163507,"date_updated":"2020-07-14T12:47:56Z","file_name":"IST-2018-960-v1+1_2017_Chatterjee_Automated_competetive.pdf","checksum":"c2590ef160709d8054cf29ee173f1454"}],"has_accepted_license":"1","volume":54,"scopus_import":"1","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"issue":"1","year":"2018","oa":1,"external_id":{"isi":["000419955500006"]},"day":"01","isi":1,"date_published":"2018-01-01T00:00:00Z","doi":"10.1007/s11241-017-9293-4","intvolume":" 54","related_material":{"record":[{"id":"2820","relation":"earlier_version","status":"public"}]},"status":"public","pubrep_id":"960","month":"01","quality_controlled":"1","type":"journal_article","oa_version":"Published Version","citation":{"chicago":"Chatterjee, Krishnendu, Andreas Pavlogiannis, Alexander Kößler, and Ulrich Schmid. “Automated Competitive Analysis of Real Time Scheduling with Graph Games.” Real-Time Systems. Springer, 2018. https://doi.org/10.1007/s11241-017-9293-4.","ista":"Chatterjee K, Pavlogiannis A, Kößler A, Schmid U. 2018. Automated competitive analysis of real time scheduling with graph games. Real-Time Systems. 54(1), 166–207.","ieee":"K. Chatterjee, A. Pavlogiannis, A. Kößler, and U. Schmid, “Automated competitive analysis of real time scheduling with graph games,” Real-Time Systems, vol. 54, no. 1. Springer, pp. 166–207, 2018.","short":"K. Chatterjee, A. Pavlogiannis, A. Kößler, U. Schmid, Real-Time Systems 54 (2018) 166–207.","apa":"Chatterjee, K., Pavlogiannis, A., Kößler, A., & Schmid, U. (2018). Automated competitive analysis of real time scheduling with graph games. Real-Time Systems. Springer. https://doi.org/10.1007/s11241-017-9293-4","mla":"Chatterjee, Krishnendu, et al. “Automated Competitive Analysis of Real Time Scheduling with Graph Games.” Real-Time Systems, vol. 54, no. 1, Springer, 2018, pp. 166–207, doi:10.1007/s11241-017-9293-4.","ama":"Chatterjee K, Pavlogiannis A, Kößler A, Schmid U. Automated competitive analysis of real time scheduling with graph games. Real-Time Systems. 2018;54(1):166-207. doi:10.1007/s11241-017-9293-4"},"date_created":"2018-12-11T11:48:14Z","publication":"Real-Time Systems"},{"month":"12","quality_controlled":"1","type":"conference","date_created":"2020-01-30T09:16:05Z","citation":{"mla":"Pietrzak, Krzysztof Z. “Proofs of Catalytic Space.” 10th Innovations in Theoretical Computer Science Conference (ITCS 2019), vol. 124, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 59:1-59:25, doi:10.4230/LIPICS.ITCS.2019.59.","apa":"Pietrzak, K. Z. (2018). Proofs of catalytic space. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019) (Vol. 124, p. 59:1-59:25). San Diego, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ITCS.2019.59","ama":"Pietrzak KZ. Proofs of catalytic space. In: 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Vol 124. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018:59:1-59:25. doi:10.4230/LIPICS.ITCS.2019.59","ista":"Pietrzak KZ. 2018. Proofs of catalytic space. 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). ITCS: Innovations in theoretical Computer Science Conference, LIPIcs, vol. 124, 59:1-59:25.","chicago":"Pietrzak, Krzysztof Z. “Proofs of Catalytic Space.” In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019), 124:59:1-59:25. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPICS.ITCS.2019.59.","short":"K.Z. Pietrzak, in:, 10th Innovations in Theoretical Computer Science Conference (ITCS 2019), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 59:1-59:25.","ieee":"K. Z. Pietrzak, “Proofs of catalytic space,” in 10th Innovations in Theoretical Computer Science Conference (ITCS 2019), San Diego, CA, United States, 2018, vol. 124, p. 59:1-59:25."},"oa_version":"Published Version","publication":"10th Innovations in Theoretical Computer Science Conference (ITCS 2019)","oa":1,"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2018/194"}],"day":"31","intvolume":" 124","doi":"10.4230/LIPICS.ITCS.2019.59","date_published":"2018-12-31T00:00:00Z","status":"public","author":[{"full_name":"Pietrzak, Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak","first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654"}],"publication_identifier":{"isbn":["978-3-95977-095-8"],"issn":["1868-8969"]},"conference":{"end_date":"2019-01-12","name":"ITCS: Innovations in theoretical Computer Science Conference","start_date":"2019-01-10","location":"San Diego, CA, United States"},"language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"Proofs of space (PoS) [Dziembowski et al., CRYPTO'15] are proof systems where a prover can convince a verifier that he \"wastes\" disk space. PoS were introduced as a more ecological and economical replacement for proofs of work which are currently used to secure blockchains like Bitcoin. In this work we investigate extensions of PoS which allow the prover to embed useful data into the dedicated space, which later can be recovered. Our first contribution is a security proof for the original PoS from CRYPTO'15 in the random oracle model (the original proof only applied to a restricted class of adversaries which can store a subset of the data an honest prover would store). When this PoS is instantiated with recent constructions of maximally depth robust graphs, our proof implies basically optimal security. As a second contribution we show three different extensions of this PoS where useful data can be embedded into the space required by the prover. Our security proof for the PoS extends (non-trivially) to these constructions. We discuss how some of these variants can be used as proofs of catalytic space (PoCS), a notion we put forward in this work, and which basically is a PoS where most of the space required by the prover can be used to backup useful data. Finally we discuss how one of the extensions is a candidate construction for a proof of replication (PoR), a proof system recently suggested in the Filecoin whitepaper. "}],"file":[{"date_updated":"2020-07-14T12:47:57Z","file_name":"2018_LIPIcs_Pietrzak.pdf","checksum":"5cebb7f7849a3beda898f697d755dd96","creator":"dernst","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"7443","date_created":"2020-02-04T08:17:52Z","file_size":822884}],"date_updated":"2021-01-12T08:13:26Z","article_processing_charge":"No","has_accepted_license":"1","volume":124,"year":"2018","scopus_import":1,"tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"page":"59:1-59:25","title":"Proofs of catalytic space","project":[{"grant_number":"682815","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","name":"Teaching Old Crypto New Tricks","call_identifier":"H2020"}],"department":[{"_id":"KrPi"}],"alternative_title":["LIPIcs"],"_id":"7407","ec_funded":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","ddc":["000"],"file_date_updated":"2020-07-14T12:47:57Z","publication_status":"published"},{"day":"01","external_id":{"isi":["000437122700017"]},"oa":1,"status":"public","related_material":{"record":[{"status":"public","id":"1378","relation":"earlier_version"}]},"intvolume":" 195","date_published":"2018-08-01T00:00:00Z","doi":"10.1007/s10711-017-0291-4","isi":1,"quality_controlled":"1","pubrep_id":"912","month":"08","publication":"Geometriae Dedicata","date_created":"2018-12-11T11:48:16Z","citation":{"ieee":"D. Dotterrer, T. Kaufman, and U. Wagner, “On expansion and topological overlap,” Geometriae Dedicata, vol. 195, no. 1. Springer, pp. 307–317, 2018.","short":"D. Dotterrer, T. Kaufman, U. Wagner, Geometriae Dedicata 195 (2018) 307–317.","chicago":"Dotterrer, Dominic, Tali Kaufman, and Uli Wagner. “On Expansion and Topological Overlap.” Geometriae Dedicata. Springer, 2018. https://doi.org/10.1007/s10711-017-0291-4.","ista":"Dotterrer D, Kaufman T, Wagner U. 2018. On expansion and topological overlap. Geometriae Dedicata. 195(1), 307–317.","ama":"Dotterrer D, Kaufman T, Wagner U. On expansion and topological overlap. Geometriae Dedicata. 2018;195(1):307–317. doi:10.1007/s10711-017-0291-4","mla":"Dotterrer, Dominic, et al. “On Expansion and Topological Overlap.” Geometriae Dedicata, vol. 195, no. 1, Springer, 2018, pp. 307–317, doi:10.1007/s10711-017-0291-4.","apa":"Dotterrer, D., Kaufman, T., & Wagner, U. (2018). On expansion and topological overlap. Geometriae Dedicata. Springer. https://doi.org/10.1007/s10711-017-0291-4"},"oa_version":"Published Version","type":"journal_article","department":[{"_id":"UlWa"}],"project":[{"grant_number":"PP00P2_138948","name":"Embeddings in Higher Dimensions: Algorithms and Combinatorics","_id":"25FA3206-B435-11E9-9278-68D0E5697425"}],"title":"On expansion and topological overlap","page":"307–317","publication_status":"published","file_date_updated":"2020-07-14T12:47:58Z","ddc":["514","516"],"publist_id":"6925","publisher":"Springer","_id":"742","file":[{"checksum":"d2f70fc132156504aa4c626aa378a7ab","file_name":"s10711-017-0291-4.pdf","date_updated":"2020-07-14T12:47:58Z","file_id":"5835","relation":"main_file","content_type":"application/pdf","access_level":"open_access","creator":"kschuh","file_size":412486,"date_created":"2019-01-15T13:44:05Z"}],"date_updated":"2023-09-27T12:29:57Z","article_processing_charge":"Yes (via OA deal)","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","abstract":[{"lang":"eng","text":"We give a detailed and easily accessible proof of Gromov’s Topological Overlap Theorem. Let X be a finite simplicial complex or, more generally, a finite polyhedral cell complex of dimension d. Informally, the theorem states that if X has sufficiently strong higher-dimensional expansion properties (which generalize edge expansion of graphs and are defined in terms of cellular cochains of X) then X has the following topological overlap property: for every continuous map (Formula presented.) there exists a point (Formula presented.) that is contained in the images of a positive fraction (Formula presented.) of the d-cells of X. More generally, the conclusion holds if (Formula presented.) is replaced by any d-dimensional piecewise-linear manifold M, with a constant (Formula presented.) that depends only on d and on the expansion properties of X, but not on M."}],"language":[{"iso":"eng"}],"author":[{"full_name":"Dotterrer, Dominic","last_name":"Dotterrer","first_name":"Dominic"},{"first_name":"Tali","last_name":"Kaufman","full_name":"Kaufman, Tali"},{"first_name":"Uli","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","last_name":"Wagner","full_name":"Wagner, Uli","orcid":"0000-0002-1494-0568"}],"year":"2018","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"issue":"1","scopus_import":"1","volume":195,"has_accepted_license":"1"},{"date_created":"2018-12-11T11:44:30Z","oa_version":"Preprint","citation":{"short":"A. Akopyan, S. Avvakumov, R. Karasev, (2018).","ieee":"A. Akopyan, S. Avvakumov, and R. Karasev, “Convex fair partitions into arbitrary number of pieces.” arXiv, 2018.","chicago":"Akopyan, Arseniy, Sergey Avvakumov, and Roman Karasev. “Convex Fair Partitions into Arbitrary Number of Pieces.” arXiv, 2018. https://doi.org/10.48550/arXiv.1804.03057.","ista":"Akopyan A, Avvakumov S, Karasev R. 2018. Convex fair partitions into arbitrary number of pieces. 1804.03057.","ama":"Akopyan A, Avvakumov S, Karasev R. Convex fair partitions into arbitrary number of pieces. 2018. doi:10.48550/arXiv.1804.03057","mla":"Akopyan, Arseniy, et al. Convex Fair Partitions into Arbitrary Number of Pieces. 1804.03057, arXiv, 2018, doi:10.48550/arXiv.1804.03057.","apa":"Akopyan, A., Avvakumov, S., & Karasev, R. (2018). Convex fair partitions into arbitrary number of pieces. arXiv. https://doi.org/10.48550/arXiv.1804.03057"},"year":"2018","type":"preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"We prove that any convex body in the plane can be partitioned into m convex parts of equal areas and perimeters for any integer m≥2; this result was previously known for prime powers m=pk. We also give a higher-dimensional generalization."}],"date_updated":"2023-12-18T10:51:02Z","article_processing_charge":"No","author":[{"first_name":"Arseniy","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","last_name":"Akopyan","full_name":"Akopyan, Arseniy","orcid":"0000-0002-2548-617X"},{"first_name":"Sergey","last_name":"Avvakumov","id":"3827DAC8-F248-11E8-B48F-1D18A9856A87","full_name":"Avvakumov, Sergey"},{"first_name":"Roman","last_name":"Karasev","full_name":"Karasev, Roman"}],"month":"09","language":[{"iso":"eng"}],"arxiv":1,"publication_status":"published","related_material":{"record":[{"status":"public","id":"8156","relation":"dissertation_contains"}]},"status":"public","_id":"75","article_number":"1804.03057","ec_funded":1,"doi":"10.48550/arXiv.1804.03057","publisher":"arXiv","date_published":"2018-09-13T00:00:00Z","department":[{"_id":"HeEd"},{"_id":"JaMa"}],"title":"Convex fair partitions into arbitrary number of pieces","oa":1,"day":"13","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1804.03057"}],"project":[{"grant_number":"716117","_id":"256E75B8-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Optimal Transport and Stochastic Dynamics"}],"external_id":{"arxiv":["1804.03057"]}},{"doi":"10.1007/s00446-018-0342-6","date_published":"2018-09-12T00:00:00Z","isi":1,"status":"public","external_id":{"isi":["000475627800005"]},"day":"12","oa":1,"type":"journal_article","publication":"Distributed Computing","oa_version":"Published Version","citation":{"apa":"Lenzen, C., & Rybicki, J. (2018). Near-optimal self-stabilising counting and firing squads. Distributed Computing. Springer. https://doi.org/10.1007/s00446-018-0342-6","mla":"Lenzen, Christoph, and Joel Rybicki. “Near-Optimal Self-Stabilising Counting and Firing Squads.” Distributed Computing, Springer, 2018, doi:10.1007/s00446-018-0342-6.","ama":"Lenzen C, Rybicki J. Near-optimal self-stabilising counting and firing squads. Distributed Computing. 2018. doi:10.1007/s00446-018-0342-6","ista":"Lenzen C, Rybicki J. 2018. Near-optimal self-stabilising counting and firing squads. Distributed Computing.","chicago":"Lenzen, Christoph, and Joel Rybicki. “Near-Optimal Self-Stabilising Counting and Firing Squads.” Distributed Computing. Springer, 2018. https://doi.org/10.1007/s00446-018-0342-6.","ieee":"C. Lenzen and J. Rybicki, “Near-optimal self-stabilising counting and firing squads,” Distributed Computing. Springer, 2018.","short":"C. Lenzen, J. Rybicki, Distributed Computing (2018)."},"date_created":"2018-12-11T11:44:30Z","month":"09","quality_controlled":"1","publisher":"Springer","publist_id":"7978","_id":"76","publication_status":"published","ddc":["000"],"file_date_updated":"2020-07-14T12:48:01Z","project":[{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}],"title":"Near-optimal self-stabilising counting and firing squads","department":[{"_id":"DaAl"}],"has_accepted_license":"1","scopus_import":"1","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"year":"2018","language":[{"iso":"eng"}],"author":[{"full_name":"Lenzen, Christoph","last_name":"Lenzen","first_name":"Christoph"},{"full_name":"Rybicki, Joel","id":"334EFD2E-F248-11E8-B48F-1D18A9856A87","last_name":"Rybicki","first_name":"Joel","orcid":"0000-0002-6432-6646"}],"article_processing_charge":"Yes (via OA deal)","date_updated":"2023-09-13T09:01:06Z","file":[{"checksum":"872db70bba9b401500abe3c6ae2f1a61","date_updated":"2020-07-14T12:48:01Z","file_name":"2018_DistributedComputing_Lenzen.pdf","date_created":"2018-12-17T14:21:22Z","file_size":799337,"relation":"main_file","file_id":"5711","creator":"dernst","access_level":"open_access","content_type":"application/pdf"}],"abstract":[{"lang":"eng","text":"Consider a fully-connected synchronous distributed system consisting of n nodes, where up to f nodes may be faulty and every node starts in an arbitrary initial state. In the synchronous C-counting problem, all nodes need to eventually agree on a counter that is increased by one modulo C in each round for given C>1. In the self-stabilising firing squad problem, the task is to eventually guarantee that all non-faulty nodes have simultaneous responses to external inputs: if a subset of the correct nodes receive an external “go” signal as input, then all correct nodes should agree on a round (in the not-too-distant future) in which to jointly output a “fire” signal. Moreover, no node should generate a “fire” signal without some correct node having previously received a “go” signal as input. We present a framework reducing both tasks to binary consensus at very small cost. For example, we obtain a deterministic algorithm for self-stabilising Byzantine firing squads with optimal resilience f<n/3, asymptotically optimal stabilisation and response time O(f), and message size O(log f). As our framework does not restrict the type of consensus routines used, we also obtain efficient randomised solutions."}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1"},{"publication_status":"published","ddc":["530"],"file_date_updated":"2020-07-14T12:48:02Z","article_type":"original","publisher":"Nature Publishing Group","_id":"77","ec_funded":1,"department":[{"_id":"GeKa"}],"project":[{"grant_number":"335497","name":"Towards Spin qubits and Majorana fermions in Germanium selfassembled hut-wires","call_identifier":"FP7","_id":"25517E86-B435-11E9-9278-68D0E5697425"},{"grant_number":"Y00715","_id":"2552F888-B435-11E9-9278-68D0E5697425","name":"Loch Spin-Qubits und Majorana-Fermionen in Germanium","call_identifier":"FWF"}],"title":"A germanium hole spin qubit","year":"2018","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"issue":"3902 ","scopus_import":"1","acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"NanoFab"}],"volume":9,"has_accepted_license":"1","file":[{"content_type":"application/pdf","access_level":"open_access","creator":"dernst","file_id":"5687","relation":"main_file","file_size":1063469,"date_created":"2018-12-17T10:28:30Z","file_name":"2018_NatureComm_Watzinger.pdf","date_updated":"2020-07-14T12:48:02Z","checksum":"e7148c10a64497e279c4de570b6cc544"}],"date_updated":"2023-09-08T11:44:02Z","article_processing_charge":"Yes","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","abstract":[{"lang":"eng","text":"Holes confined in quantum dots have gained considerable interest in the past few years due to their potential as spin qubits. Here we demonstrate two-axis control of a spin 3/2 qubit in natural Ge. The qubit is formed in a hut wire double quantum dot device. The Pauli spin blockade principle allowed us to demonstrate electric dipole spin resonance by applying a radio frequency electric field to one of the electrodes defining the double quantum dot. Coherent hole spin oscillations with Rabi frequencies reaching 140 MHz are demonstrated and dephasing times of 130 ns are measured. The reported results emphasize the potential of Ge as a platform for fast and electrically tunable hole spin qubit devices."}],"language":[{"iso":"eng"}],"author":[{"first_name":"Hannes","full_name":"Watzinger, Hannes","last_name":"Watzinger","id":"35DF8E50-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Kukucka, Josip","last_name":"Kukucka","id":"3F5D8856-F248-11E8-B48F-1D18A9856A87","first_name":"Josip"},{"first_name":"Lada","full_name":"Vukusic, Lada","last_name":"Vukusic","id":"31E9F056-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2424-8636"},{"first_name":"Fei","full_name":"Gao, Fei","last_name":"Gao"},{"first_name":"Ting","last_name":"Wang","full_name":"Wang, Ting"},{"first_name":"Friedrich","last_name":"Schäffler","full_name":"Schäffler, Friedrich"},{"first_name":"Jian","full_name":"Zhang, Jian","last_name":"Zhang"},{"orcid":"0000-0001-8342-202X","id":"38DB5788-F248-11E8-B48F-1D18A9856A87","last_name":"Katsaros","full_name":"Katsaros, Georgios","first_name":"Georgios"}],"status":"public","related_material":{"record":[{"relation":"popular_science","id":"7977"},{"status":"public","id":"7996","relation":"dissertation_contains"}]},"intvolume":" 9","date_published":"2018-09-25T00:00:00Z","doi":"10.1038/s41467-018-06418-4","isi":1,"day":"25","external_id":{"isi":["000445560800010"]},"oa":1,"publication":"Nature Communications","date_created":"2018-12-11T11:44:30Z","oa_version":"Published Version","citation":{"ama":"Watzinger H, Kukucka J, Vukušić L, et al. A germanium hole spin qubit. Nature Communications. 2018;9(3902). doi:10.1038/s41467-018-06418-4","mla":"Watzinger, Hannes, et al. “A Germanium Hole Spin Qubit.” Nature Communications, vol. 9, no. 3902, Nature Publishing Group, 2018, doi:10.1038/s41467-018-06418-4.","apa":"Watzinger, H., Kukucka, J., Vukušić, L., Gao, F., Wang, T., Schäffler, F., … Katsaros, G. (2018). A germanium hole spin qubit. Nature Communications. Nature Publishing Group. https://doi.org/10.1038/s41467-018-06418-4","ieee":"H. Watzinger et al., “A germanium hole spin qubit,” Nature Communications, vol. 9, no. 3902. Nature Publishing Group, 2018.","short":"H. Watzinger, J. Kukucka, L. Vukušić, F. Gao, T. Wang, F. Schäffler, J. Zhang, G. Katsaros, Nature Communications 9 (2018).","chicago":"Watzinger, Hannes, Josip Kukucka, Lada Vukušić, Fei Gao, Ting Wang, Friedrich Schäffler, Jian Zhang, and Georgios Katsaros. “A Germanium Hole Spin Qubit.” Nature Communications. Nature Publishing Group, 2018. https://doi.org/10.1038/s41467-018-06418-4.","ista":"Watzinger H, Kukucka J, Vukušić L, Gao F, Wang T, Schäffler F, Zhang J, Katsaros G. 2018. A germanium hole spin qubit. Nature Communications. 9(3902)."},"type":"journal_article","quality_controlled":"1","month":"09"},{"page":"215 - 232","title":"Online timed pattern matching using automata","project":[{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"department":[{"_id":"ToHe"}],"alternative_title":["LNCS"],"_id":"78","publist_id":"7976","publisher":"Springer","publication_status":"published","ddc":["000"],"file_date_updated":"2020-07-14T12:48:03Z","publication_identifier":{"isbn":["978-3-030-00150-6"]},"author":[{"first_name":"Alexey","last_name":"Bakhirkin","full_name":"Bakhirkin, Alexey"},{"last_name":"Ferrere","id":"40960E6E-F248-11E8-B48F-1D18A9856A87","full_name":"Ferrere, Thomas","first_name":"Thomas","orcid":"0000-0001-5199-3143"},{"first_name":"Dejan","last_name":"Nickovic","full_name":"Nickovic, Dejan"},{"last_name":"Maler","full_name":"Maler, Oded","first_name":"Oded"},{"last_name":"Asarin","full_name":"Asarin, Eugene","first_name":"Eugene"}],"conference":{"end_date":"2018-09-06","name":"FORMATS: Formal Modeling and Analysis of Timed Systems","location":"Bejing, China","start_date":"2018-09-04"},"language":[{"iso":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","abstract":[{"lang":"eng","text":"We provide a procedure for detecting the sub-segments of an incrementally observed Boolean signal ω that match a given temporal pattern ϕ. As a pattern specification language, we use timed regular expressions, a formalism well-suited for expressing properties of concurrent asynchronous behaviors embedded in metric time. We construct a timed automaton accepting the timed language denoted by ϕ and modify it slightly for the purpose of matching. We then apply zone-based reachability computation to this automaton while it reads ω, and retrieve all the matching segments from the results. Since the procedure is automaton based, it can be applied to patterns specified by other formalisms such as timed temporal logics reducible to timed automata or directly encoded as timed automata. The procedure has been implemented and its performance on synthetic examples is demonstrated."}],"date_updated":"2023-09-13T09:35:46Z","file":[{"file_id":"7831","relation":"main_file","access_level":"open_access","content_type":"application/pdf","creator":"dernst","file_size":374851,"date_created":"2020-05-14T11:34:34Z","checksum":"436b7574934324cfa7d1d3986fddc65b","file_name":"2018_LNCS_Bakhirkin.pdf","date_updated":"2020-07-14T12:48:03Z"}],"article_processing_charge":"No","has_accepted_license":"1","volume":11022,"year":"2018","scopus_import":"1","oa":1,"day":"26","external_id":{"isi":["000884993200013"]},"isi":1,"intvolume":" 11022","date_published":"2018-08-26T00:00:00Z","doi":"10.1007/978-3-030-00151-3_13","status":"public","month":"08","quality_controlled":"1","type":"conference","date_created":"2018-12-11T11:44:31Z","oa_version":"Submitted Version","citation":{"ama":"Bakhirkin A, Ferrere T, Nickovic D, Maler O, Asarin E. Online timed pattern matching using automata. In: Vol 11022. Springer; 2018:215-232. doi:10.1007/978-3-030-00151-3_13","apa":"Bakhirkin, A., Ferrere, T., Nickovic, D., Maler, O., & Asarin, E. (2018). Online timed pattern matching using automata (Vol. 11022, pp. 215–232). Presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Bejing, China: Springer. https://doi.org/10.1007/978-3-030-00151-3_13","mla":"Bakhirkin, Alexey, et al. Online Timed Pattern Matching Using Automata. Vol. 11022, Springer, 2018, pp. 215–32, doi:10.1007/978-3-030-00151-3_13.","ieee":"A. Bakhirkin, T. Ferrere, D. Nickovic, O. Maler, and E. Asarin, “Online timed pattern matching using automata,” presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Bejing, China, 2018, vol. 11022, pp. 215–232.","short":"A. Bakhirkin, T. Ferrere, D. Nickovic, O. Maler, E. Asarin, in:, Springer, 2018, pp. 215–232.","ista":"Bakhirkin A, Ferrere T, Nickovic D, Maler O, Asarin E. 2018. Online timed pattern matching using automata. FORMATS: Formal Modeling and Analysis of Timed Systems, LNCS, vol. 11022, 215–232.","chicago":"Bakhirkin, Alexey, Thomas Ferrere, Dejan Nickovic, Oded Maler, and Eugene Asarin. “Online Timed Pattern Matching Using Automata,” 11022:215–32. Springer, 2018. https://doi.org/10.1007/978-3-030-00151-3_13."}},{"_id":"7812","date_published":"2018-05-01T00:00:00Z","publication_status":"published","ddc":["000"],"file_date_updated":"2020-07-14T12:48:03Z","status":"public","title":"Model compression via distillation and quantization","oa":1,"external_id":{"arxiv":["1802.05668"]},"day":"01","department":[{"_id":"DaAl"}],"has_accepted_license":"1","type":"conference","citation":{"mla":"Polino, Antonio, et al. “Model Compression via Distillation and Quantization.” 6th International Conference on Learning Representations, 2018.","apa":"Polino, A., Pascanu, R., & Alistarh, D.-A. (2018). Model compression via distillation and quantization. In 6th International Conference on Learning Representations. Vancouver, Canada.","ama":"Polino A, Pascanu R, Alistarh D-A. Model compression via distillation and quantization. In: 6th International Conference on Learning Representations. ; 2018.","chicago":"Polino, Antonio, Razvan Pascanu, and Dan-Adrian Alistarh. “Model Compression via Distillation and Quantization.” In 6th International Conference on Learning Representations, 2018.","ista":"Polino A, Pascanu R, Alistarh D-A. 2018. Model compression via distillation and quantization. 6th International Conference on Learning Representations. ICLR: International Conference on Learning Representations.","ieee":"A. Polino, R. Pascanu, and D.-A. Alistarh, “Model compression via distillation and quantization,” in 6th International Conference on Learning Representations, Vancouver, Canada, 2018.","short":"A. Polino, R. Pascanu, D.-A. Alistarh, in:, 6th International Conference on Learning Representations, 2018."},"oa_version":"Published Version","date_created":"2020-05-10T22:00:51Z","scopus_import":1,"publication":"6th International Conference on Learning Representations","year":"2018","author":[{"full_name":"Polino, Antonio","last_name":"Polino","first_name":"Antonio"},{"full_name":"Pascanu, Razvan","last_name":"Pascanu","first_name":"Razvan"},{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X"}],"month":"05","conference":{"end_date":"2018-05-03","name":"ICLR: International Conference on Learning Representations","start_date":"2018-04-30","location":"Vancouver, Canada"},"arxiv":1,"language":[{"iso":"eng"}],"abstract":[{"text":"Deep neural networks (DNNs) continue to make significant advances, solving tasks from image classification to translation or reinforcement learning. One aspect of the field receiving considerable attention is efficiently executing deep models in resource-constrained environments, such as mobile or embedded devices. This paper focuses on this problem, and proposes two new compression methods, which jointly leverage weight quantization and distillation of larger teacher networks into smaller student networks. The first method we propose is called quantized distillation and leverages distillation during the training process, by incorporating distillation loss, expressed with respect to the teacher, into the training of a student network whose weights are quantized to a limited set of levels. The second method, differentiable quantization, optimizes the location of quantization points through stochastic gradient descent, to better fit the behavior of the teacher model. We validate both methods through experiments on convolutional and recurrent architectures. We show that quantized shallow students can reach similar accuracy levels to full-precision teacher models, while providing order of magnitude compression, and inference speedup that is linear in the depth reduction. In sum, our results enable DNNs for resource-constrained environments to leverage architecture and accuracy advances developed on more powerful devices.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","quality_controlled":"1","date_updated":"2023-02-23T13:18:41Z","file":[{"creator":"dernst","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"7894","date_created":"2020-05-26T13:02:00Z","file_size":308339,"date_updated":"2020-07-14T12:48:03Z","file_name":"2018_ICLR_Polino.pdf","checksum":"a4336c167978e81891970e4e4517a8c3"}]},{"day":"15","main_file_link":[{"url":"https://arxiv.org/abs/1806.05126","open_access":"1"}],"external_id":{"isi":["000548912200004"],"arxiv":["1806.05126"]},"oa":1,"status":"public","intvolume":" 11024","doi":"10.1007/978-3-319-99154-2_4","date_published":"2018-08-15T00:00:00Z","isi":1,"quality_controlled":"1","arxiv":1,"month":"08","date_created":"2018-12-11T11:44:31Z","oa_version":"Preprint","citation":{"apa":"Arming, S., Bartocci, E., Chatterjee, K., Katoen, J. P., & Sokolova, A. (2018). Parameter-independent strategies for pMDPs via POMDPs (Vol. 11024, pp. 53–70). Presented at the QEST: Quantitative Evaluation of Systems, Beijing, China: Springer. https://doi.org/10.1007/978-3-319-99154-2_4","mla":"Arming, Sebastian, et al. Parameter-Independent Strategies for PMDPs via POMDPs. Vol. 11024, Springer, 2018, pp. 53–70, doi:10.1007/978-3-319-99154-2_4.","ama":"Arming S, Bartocci E, Chatterjee K, Katoen JP, Sokolova A. Parameter-independent strategies for pMDPs via POMDPs. In: Vol 11024. Springer; 2018:53-70. doi:10.1007/978-3-319-99154-2_4","ista":"Arming S, Bartocci E, Chatterjee K, Katoen JP, Sokolova A. 2018. Parameter-independent strategies for pMDPs via POMDPs. QEST: Quantitative Evaluation of Systems, LNCS, vol. 11024, 53–70.","chicago":"Arming, Sebastian, Ezio Bartocci, Krishnendu Chatterjee, Joost P Katoen, and Ana Sokolova. “Parameter-Independent Strategies for PMDPs via POMDPs,” 11024:53–70. Springer, 2018. https://doi.org/10.1007/978-3-319-99154-2_4.","ieee":"S. Arming, E. Bartocci, K. Chatterjee, J. P. Katoen, and A. Sokolova, “Parameter-independent strategies for pMDPs via POMDPs,” presented at the QEST: Quantitative Evaluation of Systems, Beijing, China, 2018, vol. 11024, pp. 53–70.","short":"S. Arming, E. Bartocci, K. Chatterjee, J.P. Katoen, A. Sokolova, in:, Springer, 2018, pp. 53–70."},"type":"conference","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"alternative_title":["LNCS"],"title":"Parameter-independent strategies for pMDPs via POMDPs","page":"53-70","publication_status":"published","publist_id":"7975","publisher":"Springer","_id":"79","date_updated":"2023-09-13T09:38:28Z","article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","abstract":[{"text":"Markov Decision Processes (MDPs) are a popular class of models suitable for solving control decision problems in probabilistic reactive systems. We consider parametric MDPs (pMDPs) that include parameters in some of the transition probabilities to account for stochastic uncertainties of the environment such as noise or input disturbances. We study pMDPs with reachability objectives where the parameter values are unknown and impossible to measure directly during execution, but there is a probability distribution known over the parameter values. We study for the first time computing parameter-independent strategies that are expectation optimal, i.e., optimize the expected reachability probability under the probability distribution over the parameters. We present an encoding of our problem to partially observable MDPs (POMDPs), i.e., a reduction of our problem to computing optimal strategies in POMDPs. We evaluate our method experimentally on several benchmarks: a motivating (repeated) learner model; a series of benchmarks of varying configurations of a robot moving on a grid; and a consensus protocol.","lang":"eng"}],"language":[{"iso":"eng"}],"conference":{"location":"Beijing, China","start_date":"2018-09-04","name":"QEST: Quantitative Evaluation of Systems","end_date":"2018-09-07"},"author":[{"first_name":"Sebastian","last_name":"Arming","full_name":"Arming, Sebastian"},{"full_name":"Bartocci, Ezio","last_name":"Bartocci","first_name":"Ezio"},{"orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"first_name":"Joost P","full_name":"Katoen, Joost P","last_name":"Katoen","id":"4524F760-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Sokolova, Ana","last_name":"Sokolova","first_name":"Ana"}],"year":"2018","scopus_import":"1","volume":11024},{"isi":1,"doi":"10.1146/annurev-ento-020117-043110","date_published":"2018-01-07T00:00:00Z","intvolume":" 63","related_material":{"record":[{"status":"public","id":"819","relation":"dissertation_contains"}]},"status":"public","external_id":{"isi":["000424633700008"]},"day":"07","type":"journal_article","oa_version":"None","citation":{"ama":"Cremer S, Pull C, Fürst M. Social immunity: Emergence and evolution of colony-level disease protection. Annual Review of Entomology. 2018;63:105-123. doi:10.1146/annurev-ento-020117-043110","apa":"Cremer, S., Pull, C., & Fürst, M. (2018). Social immunity: Emergence and evolution of colony-level disease protection. Annual Review of Entomology. Annual Reviews. https://doi.org/10.1146/annurev-ento-020117-043110","mla":"Cremer, Sylvia, et al. “Social Immunity: Emergence and Evolution of Colony-Level Disease Protection.” Annual Review of Entomology, vol. 63, Annual Reviews, 2018, pp. 105–23, doi:10.1146/annurev-ento-020117-043110.","ieee":"S. Cremer, C. Pull, and M. Fürst, “Social immunity: Emergence and evolution of colony-level disease protection,” Annual Review of Entomology, vol. 63. Annual Reviews, pp. 105–123, 2018.","short":"S. Cremer, C. Pull, M. Fürst, Annual Review of Entomology 63 (2018) 105–123.","ista":"Cremer S, Pull C, Fürst M. 2018. Social immunity: Emergence and evolution of colony-level disease protection. Annual Review of Entomology. 63, 105–123.","chicago":"Cremer, Sylvia, Christopher Pull, and Matthias Fürst. “Social Immunity: Emergence and Evolution of Colony-Level Disease Protection.” Annual Review of Entomology. Annual Reviews, 2018. https://doi.org/10.1146/annurev-ento-020117-043110."},"date_created":"2018-12-11T11:48:36Z","publication":"Annual Review of Entomology","month":"01","quality_controlled":"1","_id":"806","publisher":"Annual Reviews","publist_id":"6844","publication_status":"published","page":"105 - 123","title":"Social immunity: Emergence and evolution of colony-level disease protection","department":[{"_id":"SyCr"}],"volume":63,"scopus_import":"1","year":"2018","publication_identifier":{"issn":["1545-4487"]},"author":[{"orcid":"0000-0002-2193-3868","first_name":"Sylvia","full_name":"Cremer, Sylvia","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","last_name":"Cremer"},{"last_name":"Pull","full_name":"Pull, Christopher","id":"3C7F4840-F248-11E8-B48F-1D18A9856A87","first_name":"Christopher","orcid":"0000-0003-1122-3982"},{"orcid":"0000-0002-3712-925X","full_name":"Fürst, Matthias","last_name":"Fürst","id":"393B1196-F248-11E8-B48F-1D18A9856A87","first_name":"Matthias"}],"language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"Social insect colonies have evolved many collectively performed adaptations that reduce the impact of infectious disease and that are expected to maximize their fitness. This colony-level protection is termed social immunity, and it enhances the health and survival of the colony. In this review, we address how social immunity emerges from its mechanistic components to produce colony-level disease avoidance, resistance, and tolerance. To understand the evolutionary causes and consequences of social immunity, we highlight the need for studies that evaluate the effects of social immunity on colony fitness. We discuss the role that host life history and ecology have on predicted eco-evolutionary dynamics, which differ among the social insect lineages. Throughout the review, we highlight current gaps in our knowledge and promising avenues for future research, which we hope will bring us closer to an integrated understanding of socio-eco-evo-immunology."}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","date_updated":"2023-09-19T09:29:45Z"},{"department":[{"_id":"ToHe"}],"alternative_title":["LNCS"],"title":"Monitoring temporal logic with clock variables","page":"53 - 70","project":[{"call_identifier":"FWF","name":"Moderne Concurrency Paradigms","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23"},{"call_identifier":"FWF","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211"}],"publication_status":"published","file_date_updated":"2020-10-09T06:24:21Z","ddc":["000"],"_id":"81","publist_id":"7973","publisher":"Springer","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","abstract":[{"text":"We solve the offline monitoring problem for timed propositional temporal logic (TPTL), interpreted over dense-time Boolean signals. The variant of TPTL we consider extends linear temporal logic (LTL) with clock variables and reset quantifiers, providing a mechanism to specify real-time constraints. We first describe a general monitoring algorithm based on an exhaustive computation of the set of satisfying clock assignments as a finite union of zones. We then propose a specialized monitoring algorithm for the one-variable case using a partition of the time domain based on the notion of region equivalence, whose complexity is linear in the length of the signal, thereby generalizing a known result regarding the monitoring of metric temporal logic (MTL). The region and zone representations of time constraints are known from timed automata verification and can also be used in the discrete-time case. Our prototype implementation appears to outperform previous discrete-time implementations of TPTL monitoring,","lang":"eng"}],"date_updated":"2023-09-13T08:58:34Z","file":[{"success":1,"date_updated":"2020-10-09T06:24:21Z","file_name":"2018_LNCS_Elgyuett.pdf","checksum":"e5d81c9b50a6bd9d8a2c16953aad7e23","creator":"dernst","access_level":"open_access","content_type":"application/pdf","relation":"main_file","file_id":"8638","date_created":"2020-10-09T06:24:21Z","file_size":537219}],"article_processing_charge":"No","conference":{"start_date":"2018-09-04","location":"Beijing, China","name":"FORMATS: Formal Modeling and Analysis of Timed Systems","end_date":"2018-09-06"},"author":[{"id":"4A2E9DBA-F248-11E8-B48F-1D18A9856A87","last_name":"Elgyütt","full_name":"Elgyütt, Adrian","first_name":"Adrian"},{"full_name":"Ferrere, Thomas","last_name":"Ferrere","id":"40960E6E-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas","orcid":"0000-0001-5199-3143"},{"orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"}],"language":[{"iso":"eng"}],"year":"2018","scopus_import":"1","has_accepted_license":"1","volume":11022,"oa":1,"day":"26","external_id":{"isi":["000884993200004"]},"status":"public","isi":1,"intvolume":" 11022","doi":"10.1007/978-3-030-00151-3_4","date_published":"2018-08-26T00:00:00Z","quality_controlled":"1","month":"08","date_created":"2018-12-11T11:44:31Z","oa_version":"Submitted Version","citation":{"mla":"Elgyütt, Adrian, et al. Monitoring Temporal Logic with Clock Variables. Vol. 11022, Springer, 2018, pp. 53–70, doi:10.1007/978-3-030-00151-3_4.","apa":"Elgyütt, A., Ferrere, T., & Henzinger, T. A. (2018). Monitoring temporal logic with clock variables (Vol. 11022, pp. 53–70). Presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Beijing, China: Springer. https://doi.org/10.1007/978-3-030-00151-3_4","ama":"Elgyütt A, Ferrere T, Henzinger TA. Monitoring temporal logic with clock variables. In: Vol 11022. Springer; 2018:53-70. doi:10.1007/978-3-030-00151-3_4","chicago":"Elgyütt, Adrian, Thomas Ferrere, and Thomas A Henzinger. “Monitoring Temporal Logic with Clock Variables,” 11022:53–70. Springer, 2018. https://doi.org/10.1007/978-3-030-00151-3_4.","ista":"Elgyütt A, Ferrere T, Henzinger TA. 2018. Monitoring temporal logic with clock variables. FORMATS: Formal Modeling and Analysis of Timed Systems, LNCS, vol. 11022, 53–70.","ieee":"A. Elgyütt, T. Ferrere, and T. A. Henzinger, “Monitoring temporal logic with clock variables,” presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Beijing, China, 2018, vol. 11022, pp. 53–70.","short":"A. Elgyütt, T. Ferrere, T.A. Henzinger, in:, Springer, 2018, pp. 53–70."},"type":"conference"},{"department":[{"_id":"JiFr"}],"project":[{"name":"Tracing Evolution of Auxin Transport and Polarity in Plants","call_identifier":"H2020","_id":"261099A6-B435-11E9-9278-68D0E5697425","grant_number":"742985"}],"page":"448 - 464.e24","title":"The Chara genome: Secondary complexity and implications for plant terrestrialization","publication_status":"published","publisher":"Cell Press","publist_id":"7774","ec_funded":1,"_id":"148","article_processing_charge":"No","date_updated":"2023-09-19T10:02:47Z","abstract":[{"text":"Land plants evolved from charophytic algae, among which Charophyceae possess the most complex body plans. We present the genome of Chara braunii; comparison of the genome to those of land plants identified evolutionary novelties for plant terrestrialization and land plant heritage genes. C. braunii employs unique xylan synthases for cell wall biosynthesis, a phragmoplast (cell separation) mechanism similar to that of land plants, and many phytohormones. C. braunii plastids are controlled via land-plant-like retrograde signaling, and transcriptional regulation is more elaborate than in other algae. The morphological complexity of this organism may result from expanded gene families, with three cases of particular note: genes effecting tolerance to reactive oxygen species (ROS), LysM receptor-like kinases, and transcription factors (TFs). Transcriptomic analysis of sexual reproductive structures reveals intricate control by TFs, activity of the ROS gene network, and the ancestral use of plant-like storage and stress protection proteins in the zygote.","lang":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","pmid":1,"language":[{"iso":"eng"}],"author":[{"first_name":"Tomoaki","last_name":"Nishiyama","full_name":"Nishiyama, Tomoaki"},{"first_name":"Hidetoshi","last_name":"Sakayama","full_name":"Sakayama, Hidetoshi"},{"full_name":"De Vries, Jan","last_name":"De Vries","first_name":"Jan"},{"first_name":"Henrik","last_name":"Buschmann","full_name":"Buschmann, Henrik"},{"first_name":"Denis","full_name":"Saint Marcoux, Denis","last_name":"Saint Marcoux"},{"last_name":"Ullrich","full_name":"Ullrich, Kristian","first_name":"Kristian"},{"last_name":"Haas","full_name":"Haas, Fabian","first_name":"Fabian"},{"first_name":"Lisa","full_name":"Vanderstraeten, Lisa","last_name":"Vanderstraeten"},{"first_name":"Dirk","full_name":"Becker, Dirk","last_name":"Becker"},{"first_name":"Daniel","full_name":"Lang, Daniel","last_name":"Lang"},{"full_name":"Vosolsobě, Stanislav","last_name":"Vosolsobě","first_name":"Stanislav"},{"full_name":"Rombauts, Stephane","last_name":"Rombauts","first_name":"Stephane"},{"first_name":"Per","full_name":"Wilhelmsson, Per","last_name":"Wilhelmsson"},{"full_name":"Janitza, Philipp","last_name":"Janitza","first_name":"Philipp"},{"first_name":"Ramona","full_name":"Kern, Ramona","last_name":"Kern"},{"last_name":"Heyl","full_name":"Heyl, Alexander","first_name":"Alexander"},{"first_name":"Florian","last_name":"Rümpler","full_name":"Rümpler, Florian"},{"first_name":"Luz","last_name":"Calderón Villalobos","full_name":"Calderón Villalobos, Luz"},{"full_name":"Clay, John","last_name":"Clay","first_name":"John"},{"first_name":"Roman","full_name":"Skokan, Roman","last_name":"Skokan"},{"full_name":"Toyoda, Atsushi","last_name":"Toyoda","first_name":"Atsushi"},{"first_name":"Yutaka","last_name":"Suzuki","full_name":"Suzuki, Yutaka"},{"full_name":"Kagoshima, Hiroshi","last_name":"Kagoshima","first_name":"Hiroshi"},{"first_name":"Elio","full_name":"Schijlen, Elio","last_name":"Schijlen"},{"first_name":"Navindra","full_name":"Tajeshwar, Navindra","last_name":"Tajeshwar"},{"full_name":"Catarino, Bruno","last_name":"Catarino","first_name":"Bruno"},{"full_name":"Hetherington, Alexander","last_name":"Hetherington","first_name":"Alexander"},{"full_name":"Saltykova, Assia","last_name":"Saltykova","first_name":"Assia"},{"first_name":"Clemence","full_name":"Bonnot, Clemence","last_name":"Bonnot"},{"first_name":"Holger","full_name":"Breuninger, Holger","last_name":"Breuninger"},{"first_name":"Aikaterini","full_name":"Symeonidi, Aikaterini","last_name":"Symeonidi"},{"first_name":"Guru","last_name":"Radhakrishnan","full_name":"Radhakrishnan, Guru"},{"last_name":"Van Nieuwerburgh","full_name":"Van Nieuwerburgh, Filip","first_name":"Filip"},{"full_name":"Deforce, Dieter","last_name":"Deforce","first_name":"Dieter"},{"last_name":"Chang","full_name":"Chang, Caren","first_name":"Caren"},{"last_name":"Karol","full_name":"Karol, Kenneth","first_name":"Kenneth"},{"first_name":"Rainer","last_name":"Hedrich","full_name":"Hedrich, Rainer"},{"last_name":"Ulvskov","full_name":"Ulvskov, Peter","first_name":"Peter"},{"first_name":"Gernot","full_name":"Glöckner, Gernot","last_name":"Glöckner"},{"full_name":"Delwiche, Charles","last_name":"Delwiche","first_name":"Charles"},{"first_name":"Jan","last_name":"Petrášek","full_name":"Petrášek, Jan"},{"first_name":"Yves","full_name":"Van De Peer, Yves","last_name":"Van De Peer"},{"last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","full_name":"Friml, Jirí","first_name":"Jirí","orcid":"0000-0002-8302-7596"},{"first_name":"Mary","full_name":"Beilby, Mary","last_name":"Beilby"},{"full_name":"Dolan, Liam","last_name":"Dolan","first_name":"Liam"},{"last_name":"Kohara","full_name":"Kohara, Yuji","first_name":"Yuji"},{"full_name":"Sugano, Sumio","last_name":"Sugano","first_name":"Sumio"},{"full_name":"Fujiyama, Asao","last_name":"Fujiyama","first_name":"Asao"},{"first_name":"Pierre Marc","full_name":"Delaux, Pierre Marc","last_name":"Delaux"},{"full_name":"Quint, Marcel","last_name":"Quint","first_name":"Marcel"},{"last_name":"Theissen","full_name":"Theissen, Gunter","first_name":"Gunter"},{"first_name":"Martin","last_name":"Hagemann","full_name":"Hagemann, Martin"},{"full_name":"Harholt, Jesper","last_name":"Harholt","first_name":"Jesper"},{"full_name":"Dunand, Christophe","last_name":"Dunand","first_name":"Christophe"},{"last_name":"Zachgo","full_name":"Zachgo, Sabine","first_name":"Sabine"},{"full_name":"Langdale, Jane","last_name":"Langdale","first_name":"Jane"},{"first_name":"Florian","last_name":"Maumus","full_name":"Maumus, Florian"},{"full_name":"Van Der Straeten, Dominique","last_name":"Van Der Straeten","first_name":"Dominique"},{"first_name":"Sven B","last_name":"Gould","full_name":"Gould, Sven B"},{"first_name":"Stefan","full_name":"Rensing, Stefan","last_name":"Rensing"}],"issue":"2","scopus_import":"1","year":"2018","volume":174,"external_id":{"pmid":["30007417"],"isi":["000438482800019"]},"main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pubmed/30007417"}],"day":"12","oa":1,"status":"public","date_published":"2018-07-12T00:00:00Z","doi":"10.1016/j.cell.2018.06.033","intvolume":" 174","isi":1,"quality_controlled":"1","acknowledgement":"In-Data-Review","month":"07","publication":"Cell","oa_version":"Published Version","citation":{"short":"T. Nishiyama, H. Sakayama, J. De Vries, H. Buschmann, D. Saint Marcoux, K. Ullrich, F. Haas, L. Vanderstraeten, D. Becker, D. Lang, S. Vosolsobě, S. Rombauts, P. Wilhelmsson, P. Janitza, R. Kern, A. Heyl, F. Rümpler, L. Calderón Villalobos, J. Clay, R. Skokan, A. Toyoda, Y. Suzuki, H. Kagoshima, E. Schijlen, N. Tajeshwar, B. Catarino, A. Hetherington, A. Saltykova, C. Bonnot, H. Breuninger, A. Symeonidi, G. Radhakrishnan, F. Van Nieuwerburgh, D. Deforce, C. Chang, K. Karol, R. Hedrich, P. Ulvskov, G. Glöckner, C. Delwiche, J. Petrášek, Y. Van De Peer, J. Friml, M. Beilby, L. Dolan, Y. Kohara, S. Sugano, A. Fujiyama, P.M. Delaux, M. Quint, G. Theissen, M. Hagemann, J. Harholt, C. Dunand, S. Zachgo, J. Langdale, F. Maumus, D. Van Der Straeten, S.B. Gould, S. Rensing, Cell 174 (2018) 448–464.e24.","ieee":"T. Nishiyama et al., “The Chara genome: Secondary complexity and implications for plant terrestrialization,” Cell, vol. 174, no. 2. Cell Press, p. 448–464.e24, 2018.","ista":"Nishiyama T, Sakayama H, De Vries J, Buschmann H, Saint Marcoux D, Ullrich K, Haas F, Vanderstraeten L, Becker D, Lang D, Vosolsobě S, Rombauts S, Wilhelmsson P, Janitza P, Kern R, Heyl A, Rümpler F, Calderón Villalobos L, Clay J, Skokan R, Toyoda A, Suzuki Y, Kagoshima H, Schijlen E, Tajeshwar N, Catarino B, Hetherington A, Saltykova A, Bonnot C, Breuninger H, Symeonidi A, Radhakrishnan G, Van Nieuwerburgh F, Deforce D, Chang C, Karol K, Hedrich R, Ulvskov P, Glöckner G, Delwiche C, Petrášek J, Van De Peer Y, Friml J, Beilby M, Dolan L, Kohara Y, Sugano S, Fujiyama A, Delaux PM, Quint M, Theissen G, Hagemann M, Harholt J, Dunand C, Zachgo S, Langdale J, Maumus F, Van Der Straeten D, Gould SB, Rensing S. 2018. The Chara genome: Secondary complexity and implications for plant terrestrialization. Cell. 174(2), 448–464.e24.","chicago":"Nishiyama, Tomoaki, Hidetoshi Sakayama, Jan De Vries, Henrik Buschmann, Denis Saint Marcoux, Kristian Ullrich, Fabian Haas, et al. “The Chara Genome: Secondary Complexity and Implications for Plant Terrestrialization.” Cell. Cell Press, 2018. https://doi.org/10.1016/j.cell.2018.06.033.","ama":"Nishiyama T, Sakayama H, De Vries J, et al. The Chara genome: Secondary complexity and implications for plant terrestrialization. Cell. 2018;174(2):448-464.e24. doi:10.1016/j.cell.2018.06.033","apa":"Nishiyama, T., Sakayama, H., De Vries, J., Buschmann, H., Saint Marcoux, D., Ullrich, K., … Rensing, S. (2018). The Chara genome: Secondary complexity and implications for plant terrestrialization. Cell. Cell Press. https://doi.org/10.1016/j.cell.2018.06.033","mla":"Nishiyama, Tomoaki, et al. “The Chara Genome: Secondary Complexity and Implications for Plant Terrestrialization.” Cell, vol. 174, no. 2, Cell Press, 2018, p. 448–464.e24, doi:10.1016/j.cell.2018.06.033."},"date_created":"2018-12-11T11:44:53Z","type":"journal_article"},{"pubrep_id":"1040","month":"07","degree_awarded":"PhD","date_created":"2018-12-11T11:44:53Z","oa_version":"Published Version","citation":{"chicago":"Alt, Johannes. “Dyson Equation and Eigenvalue Statistics of Random Matrices.” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:TH_1040.","ista":"Alt J. 2018. Dyson equation and eigenvalue statistics of random matrices. Institute of Science and Technology Austria.","ieee":"J. Alt, “Dyson equation and eigenvalue statistics of random matrices,” Institute of Science and Technology Austria, 2018.","short":"J. Alt, Dyson Equation and Eigenvalue Statistics of Random Matrices, Institute of Science and Technology Austria, 2018.","mla":"Alt, Johannes. Dyson Equation and Eigenvalue Statistics of Random Matrices. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:TH_1040.","apa":"Alt, J. (2018). Dyson equation and eigenvalue statistics of random matrices. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:TH_1040","ama":"Alt J. Dyson equation and eigenvalue statistics of random matrices. 2018. doi:10.15479/AT:ISTA:TH_1040"},"type":"dissertation","day":"12","oa":1,"status":"public","related_material":{"record":[{"relation":"part_of_dissertation","id":"1677","status":"public"},{"id":"550","relation":"part_of_dissertation","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"6183"},{"id":"566","relation":"part_of_dissertation","status":"public"},{"id":"1010","relation":"part_of_dissertation","status":"public"},{"status":"public","id":"6240","relation":"part_of_dissertation"},{"status":"public","relation":"part_of_dissertation","id":"6184"}]},"doi":"10.15479/AT:ISTA:TH_1040","date_published":"2018-07-12T00:00:00Z","file":[{"creator":"dernst","access_level":"open_access","content_type":"application/pdf","relation":"main_file","file_id":"6241","date_created":"2019-04-08T13:55:20Z","file_size":5801709,"date_updated":"2020-07-14T12:44:57Z","file_name":"2018_thesis_Alt.pdf","checksum":"d4dad55a7513f345706aaaba90cb1bb8"},{"checksum":"d73fcf46300dce74c403f2b491148ab4","date_updated":"2020-07-14T12:44:57Z","file_name":"2018_thesis_Alt_source.zip","relation":"source_file","file_id":"6242","creator":"dernst","access_level":"closed","content_type":"application/zip","date_created":"2019-04-08T13:55:20Z","file_size":3802059}],"date_updated":"2024-02-22T14:34:33Z","article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","abstract":[{"text":"The eigenvalue density of many large random matrices is well approximated by a deterministic measure, the self-consistent density of states. In the present work, we show this behaviour for several classes of random matrices. In fact, we establish that, in each of these classes, the self-consistent density of states approximates the eigenvalue density of the random matrix on all scales slightly above the typical eigenvalue spacing. For large classes of random matrices, the self-consistent density of states exhibits several universal features. We prove that, under suitable assumptions, random Gram matrices and Hermitian random matrices with decaying correlations have a 1/3-Hölder continuous self-consistent density of states ρ on R, which is analytic, where it is positive, and has either a square root edge or a cubic root cusp, where it vanishes. We, thus, extend the validity of the corresponding result for Wigner-type matrices from [4, 5, 7]. We show that ρ is determined as the inverse Stieltjes transform of the normalized trace of the unique solution m(z) to the Dyson equation −m(z) −1 = z − a + S[m(z)] on C N×N with the constraint Im m(z) ≥ 0. Here, z lies in the complex upper half-plane, a is a self-adjoint element of C N×N and S is a positivity-preserving operator on C N×N encoding the first two moments of the random matrix. In order to analyze a possible limit of ρ for N → ∞ and address some applications in free probability theory, we also consider the Dyson equation on infinite dimensional von Neumann algebras. We present two applications to random matrices. We first establish that, under certain assumptions, large random matrices with independent entries have a rotationally symmetric self-consistent density of states which is supported on a centered disk in C. Moreover, it is infinitely often differentiable apart from a jump on the boundary of this disk. Second, we show edge universality at all regular (not necessarily extreme) spectral edges for Hermitian random matrices with decaying correlations.","lang":"eng"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["2663-337X"]},"author":[{"first_name":"Johannes","full_name":"Alt, Johannes","id":"36D3D8B6-F248-11E8-B48F-1D18A9856A87","last_name":"Alt"}],"year":"2018","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"has_accepted_license":"1","department":[{"_id":"LaEr"}],"alternative_title":["ISTA Thesis"],"project":[{"grant_number":"338804","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","name":"Random matrices, universality and disordered quantum systems","call_identifier":"FP7"}],"supervisor":[{"first_name":"László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","full_name":"Erdös, László","last_name":"Erdös","orcid":"0000-0001-5366-9603"}],"title":"Dyson equation and eigenvalue statistics of random matrices","page":"456","file_date_updated":"2020-07-14T12:44:57Z","publication_status":"published","ddc":["515","519"],"publist_id":"7772","publisher":"Institute of Science and Technology Austria","_id":"149","ec_funded":1},{"author":[{"first_name":"Miroslav","id":"4167FE56-F248-11E8-B48F-1D18A9856A87","last_name":"Hons","full_name":"Hons, Miroslav","orcid":"0000-0002-6625-3348"},{"orcid":"0000-0002-2187-6656","first_name":"Aglaja","last_name":"Kopf","id":"31DAC7B6-F248-11E8-B48F-1D18A9856A87","full_name":"Kopf, Aglaja"},{"first_name":"Robert","id":"4E01D6B4-F248-11E8-B48F-1D18A9856A87","last_name":"Hauschild","full_name":"Hauschild, Robert","orcid":"0000-0001-9843-3522"},{"first_name":"Alexander F","full_name":"Leithner, Alexander F","id":"3B1B77E4-F248-11E8-B48F-1D18A9856A87","last_name":"Leithner","orcid":"0000-0002-1073-744X"},{"orcid":"0000-0001-6120-3723","last_name":"Gärtner","id":"397A88EE-F248-11E8-B48F-1D18A9856A87","full_name":"Gärtner, Florian R","first_name":"Florian R"},{"first_name":"Jun","full_name":"Abe, Jun","last_name":"Abe"},{"full_name":"Renkawitz, Jörg","last_name":"Renkawitz","id":"3F0587C8-F248-11E8-B48F-1D18A9856A87","first_name":"Jörg","orcid":"0000-0003-2856-3369"},{"first_name":"Jens","full_name":"Stein, Jens","last_name":"Stein"},{"orcid":"0000-0002-6620-9179","first_name":"Michael K","full_name":"Sixt, Michael K","last_name":"Sixt","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87"}],"pmid":1,"language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"Although much is known about the physiological framework of T cell motility, and numerous rate-limiting molecules have been identified through loss-of-function approaches, an integrated functional concept of T cell motility is lacking. Here, we used in vivo precision morphometry together with analysis of cytoskeletal dynamics in vitro to deconstruct the basic mechanisms of T cell migration within lymphatic organs. We show that the contributions of the integrin LFA-1 and the chemokine receptor CCR7 are complementary rather than positioned in a linear pathway, as they are during leukocyte extravasation from the blood vasculature. Our data demonstrate that CCR7 controls cortical actin flows, whereas integrins mediate substrate friction that is sufficient to drive locomotion in the absence of considerable surface adhesions and plasma membrane flux."}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","date_updated":"2024-03-25T23:30:22Z","volume":19,"acknowledged_ssus":[{"_id":"SSU"}],"issue":"6","scopus_import":"1","year":"2018","page":"606 - 616","title":"Chemokines and integrins independently tune actin flow and substrate friction during intranodal migration of T cells","project":[{"_id":"25FE9508-B435-11E9-9278-68D0E5697425","name":"Cellular navigation along spatial gradients","call_identifier":"H2020","grant_number":"724373"},{"grant_number":"747687","_id":"260AA4E2-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Mechanical Adaptation of Lamellipodial Actin Networks in Migrating Cells"},{"grant_number":"ALTF 1396-2014","name":"Molecular and system level view of immune cell migration","_id":"25A48D24-B435-11E9-9278-68D0E5697425"},{"_id":"25A603A2-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Cytoskeletal force generation and force transduction of migrating leukocytes (EU)","grant_number":"281556"}],"department":[{"_id":"MiSi"},{"_id":"Bio"}],"ec_funded":1,"_id":"15","publisher":"Nature Publishing Group","publist_id":"8040","publication_status":"published","month":"05","acknowledgement":"This work was funded by grants from the European Research Council (ERC StG 281556 and CoG 724373) and the Austrian Science Foundation (FWF) to M.S. and by Swiss National Foundation (SNF) project grants 31003A_135649, 31003A_153457 and CR23I3_156234 to J.V.S. F.G. received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement no. 747687, and J.R. was funded by an EMBO long-term fellowship (ALTF 1396-2014).","quality_controlled":"1","type":"journal_article","citation":{"ieee":"M. Hons et al., “Chemokines and integrins independently tune actin flow and substrate friction during intranodal migration of T cells,” Nature Immunology, vol. 19, no. 6. Nature Publishing Group, pp. 606–616, 2018.","short":"M. Hons, A. Kopf, R. Hauschild, A.F. Leithner, F.R. Gärtner, J. Abe, J. Renkawitz, J. Stein, M.K. Sixt, Nature Immunology 19 (2018) 606–616.","chicago":"Hons, Miroslav, Aglaja Kopf, Robert Hauschild, Alexander F Leithner, Florian R Gärtner, Jun Abe, Jörg Renkawitz, Jens Stein, and Michael K Sixt. “Chemokines and Integrins Independently Tune Actin Flow and Substrate Friction during Intranodal Migration of T Cells.” Nature Immunology. Nature Publishing Group, 2018. https://doi.org/10.1038/s41590-018-0109-z.","ista":"Hons M, Kopf A, Hauschild R, Leithner AF, Gärtner FR, Abe J, Renkawitz J, Stein J, Sixt MK. 2018. Chemokines and integrins independently tune actin flow and substrate friction during intranodal migration of T cells. Nature Immunology. 19(6), 606–616.","ama":"Hons M, Kopf A, Hauschild R, et al. Chemokines and integrins independently tune actin flow and substrate friction during intranodal migration of T cells. Nature Immunology. 2018;19(6):606-616. doi:10.1038/s41590-018-0109-z","mla":"Hons, Miroslav, et al. “Chemokines and Integrins Independently Tune Actin Flow and Substrate Friction during Intranodal Migration of T Cells.” Nature Immunology, vol. 19, no. 6, Nature Publishing Group, 2018, pp. 606–16, doi:10.1038/s41590-018-0109-z.","apa":"Hons, M., Kopf, A., Hauschild, R., Leithner, A. F., Gärtner, F. R., Abe, J., … Sixt, M. K. (2018). Chemokines and integrins independently tune actin flow and substrate friction during intranodal migration of T cells. Nature Immunology. Nature Publishing Group. https://doi.org/10.1038/s41590-018-0109-z"},"oa_version":"Published Version","date_created":"2018-12-11T11:44:10Z","publication":"Nature Immunology","oa":1,"external_id":{"pmid":["29777221"],"isi":["000433041500026"]},"main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pubmed/29777221"}],"day":"18","isi":1,"date_published":"2018-05-18T00:00:00Z","doi":"10.1038/s41590-018-0109-z","intvolume":" 19","related_material":{"record":[{"id":"6891","relation":"dissertation_contains","status":"public"}]},"status":"public"},{"abstract":[{"text":"A short, 14-amino-acid segment called SP1, located in the Gag structural protein1, has a critical role during the formation of the HIV-1 virus particle. During virus assembly, the SP1 peptide and seven preceding residues fold into a six-helix bundle, which holds together the Gag hexamer and facilitates the formation of a curved immature hexagonal lattice underneath the viral membrane2,3. Upon completion of assembly and budding, proteolytic cleavage of Gag leads to virus maturation, in which the immature lattice is broken down; the liberated CA domain of Gag then re-assembles into the mature conical capsid that encloses the viral genome and associated enzymes. Folding and proteolysis of the six-helix bundle are crucial rate-limiting steps of both Gag assembly and disassembly, and the six-helix bundle is an established target of HIV-1 inhibitors4,5. Here, using a combination of structural and functional analyses, we show that inositol hexakisphosphate (InsP6, also known as IP6) facilitates the formation of the six-helix bundle and assembly of the immature HIV-1 Gag lattice. IP6 makes ionic contacts with two rings of lysine residues at the centre of the Gag hexamer. Proteolytic cleavage then unmasks an alternative binding site, where IP6 interaction promotes the assembly of the mature capsid lattice. These studies identify IP6 as a naturally occurring small molecule that promotes both assembly and maturation of HIV-1.","lang":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","date_updated":"2023-09-12T07:44:37Z","author":[{"first_name":"Robert","last_name":"Dick","full_name":"Dick, Robert"},{"last_name":"Zadrozny","full_name":"Zadrozny, Kaneil K","first_name":"Kaneil K"},{"last_name":"Xu","full_name":"Xu, Chaoyi","first_name":"Chaoyi"},{"orcid":"0000-0003-4790-8078","first_name":"Florian","id":"48AD8942-F248-11E8-B48F-1D18A9856A87","full_name":"Schur, Florian","last_name":"Schur"},{"last_name":"Lyddon","full_name":"Lyddon, Terri D","first_name":"Terri D"},{"first_name":"Clifton L","full_name":"Ricana, Clifton L","last_name":"Ricana"},{"first_name":"Jonathan M","full_name":"Wagner, Jonathan M","last_name":"Wagner"},{"last_name":"Perilla","full_name":"Perilla, Juan R","first_name":"Juan R"},{"full_name":"Ganser, Pornillos Barbie K","last_name":"Ganser","first_name":"Pornillos Barbie K"},{"full_name":"Johnson, Marc C","last_name":"Johnson","first_name":"Marc C"},{"full_name":"Pornillos, Owen","last_name":"Pornillos","first_name":"Owen"},{"first_name":"Volker","full_name":"Vogt, Volker","last_name":"Vogt"}],"publication_identifier":{"eissn":["1476-4687"]},"pmid":1,"language":[{"iso":"eng"}],"scopus_import":"1","issue":"7719","year":"2018","volume":560,"department":[{"_id":"FlSc"}],"page":"509–512","title":"Inositol phosphates are assembly co-factors for HIV-1","publication_status":"published","_id":"150","publisher":"Nature Publishing Group","article_type":"original","quality_controlled":"1","month":"08","oa_version":"Submitted Version","citation":{"ama":"Dick R, Zadrozny KK, Xu C, et al. Inositol phosphates are assembly co-factors for HIV-1. Nature. 2018;560(7719):509–512. doi:10.1038/s41586-018-0396-4","apa":"Dick, R., Zadrozny, K. K., Xu, C., Schur, F. K., Lyddon, T. D., Ricana, C. L., … Vogt, V. (2018). Inositol phosphates are assembly co-factors for HIV-1. Nature. Nature Publishing Group. https://doi.org/10.1038/s41586-018-0396-4","mla":"Dick, Robert, et al. “Inositol Phosphates Are Assembly Co-Factors for HIV-1.” Nature, vol. 560, no. 7719, Nature Publishing Group, 2018, pp. 509–512, doi:10.1038/s41586-018-0396-4.","ieee":"R. Dick et al., “Inositol phosphates are assembly co-factors for HIV-1,” Nature, vol. 560, no. 7719. Nature Publishing Group, pp. 509–512, 2018.","short":"R. Dick, K.K. Zadrozny, C. Xu, F.K. Schur, T.D. Lyddon, C.L. Ricana, J.M. Wagner, J.R. Perilla, P.B.K. Ganser, M.C. Johnson, O. Pornillos, V. Vogt, Nature 560 (2018) 509–512.","chicago":"Dick, Robert, Kaneil K Zadrozny, Chaoyi Xu, Florian KM Schur, Terri D Lyddon, Clifton L Ricana, Jonathan M Wagner, et al. “Inositol Phosphates Are Assembly Co-Factors for HIV-1.” Nature. Nature Publishing Group, 2018. https://doi.org/10.1038/s41586-018-0396-4.","ista":"Dick R, Zadrozny KK, Xu C, Schur FK, Lyddon TD, Ricana CL, Wagner JM, Perilla JR, Ganser PBK, Johnson MC, Pornillos O, Vogt V. 2018. Inositol phosphates are assembly co-factors for HIV-1. Nature. 560(7719), 509–512."},"date_created":"2018-12-11T11:44:53Z","publication":"Nature","type":"journal_article","oa":1,"external_id":{"pmid":["30158708"],"isi":["000442483400046"]},"day":"29","main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6242333/","open_access":"1"}],"related_material":{"link":[{"url":"https://doi.org/10.1038/s41586-018-0505-4","relation":"erratum"}]},"status":"public","isi":1,"date_published":"2018-08-29T00:00:00Z","doi":"10.1038/s41586-018-0396-4","intvolume":" 560"},{"day":"26","external_id":{"isi":["000445118200007"]},"oa":1,"status":"public","intvolume":" 28","date_published":"2018-07-26T00:00:00Z","doi":"10.1016/j.tcb.2018.06.006","isi":1,"quality_controlled":"1","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","month":"07","publication":"Trends in Cell Biology","date_created":"2018-12-11T11:44:54Z","oa_version":"Submitted Version","citation":{"short":"K. Fiedorczuk, L.A. Sazanov, Trends in Cell Biology 28 (2018) 835–867.","ieee":"K. Fiedorczuk and L. A. Sazanov, “Mammalian mitochondrial complex I structure and disease causing mutations,” Trends in Cell Biology, vol. 28, no. 10. Elsevier, pp. 835–867, 2018.","chicago":"Fiedorczuk, Karol, and Leonid A Sazanov. “Mammalian Mitochondrial Complex I Structure and Disease Causing Mutations.” Trends in Cell Biology. Elsevier, 2018. https://doi.org/10.1016/j.tcb.2018.06.006.","ista":"Fiedorczuk K, Sazanov LA. 2018. Mammalian mitochondrial complex I structure and disease causing mutations. Trends in Cell Biology. 28(10), 835–867.","ama":"Fiedorczuk K, Sazanov LA. Mammalian mitochondrial complex I structure and disease causing mutations. Trends in Cell Biology. 2018;28(10):835-867. doi:10.1016/j.tcb.2018.06.006","apa":"Fiedorczuk, K., & Sazanov, L. A. (2018). Mammalian mitochondrial complex I structure and disease causing mutations. Trends in Cell Biology. Elsevier. https://doi.org/10.1016/j.tcb.2018.06.006","mla":"Fiedorczuk, Karol, and Leonid A. Sazanov. “Mammalian Mitochondrial Complex I Structure and Disease Causing Mutations.” Trends in Cell Biology, vol. 28, no. 10, Elsevier, 2018, pp. 835–67, doi:10.1016/j.tcb.2018.06.006."},"type":"journal_article","department":[{"_id":"LeSa"}],"title":"Mammalian mitochondrial complex I structure and disease causing mutations","page":"835 - 867","file_date_updated":"2020-07-14T12:45:00Z","ddc":["572"],"publication_status":"published","article_type":"original","publist_id":"7769","publisher":"Elsevier","_id":"152","date_updated":"2023-09-13T08:51:56Z","file":[{"file_size":2185385,"date_created":"2019-11-07T12:55:20Z","content_type":"application/pdf","access_level":"open_access","creator":"lsazanov","file_id":"6994","relation":"main_file","file_name":"SasanovFinalMS+EdComments_LS_allacc_withFigs.pdf","date_updated":"2020-07-14T12:45:00Z","checksum":"ef6d2b4e1fd63948539639242610bfa6"}],"article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","abstract":[{"text":"Complex I has an essential role in ATP production by coupling electron transfer from NADH to quinone with translocation of protons across the inner mitochondrial membrane. Isolated complex I deficiency is a frequent cause of mitochondrial inherited diseases. Complex I has also been implicated in cancer, ageing, and neurodegenerative conditions. Until recently, the understanding of complex I deficiency on the molecular level was limited due to the lack of high-resolution structures of the enzyme. However, due to developments in single particle cryo-electron microscopy (cryo-EM), recent studies have reported nearly atomic resolution maps and models of mitochondrial complex I. These structures significantly add to our understanding of complex I mechanism and assembly. The disease-causing mutations are discussed here in their structural context.","lang":"eng"}],"language":[{"iso":"eng"}],"author":[{"last_name":"Fiedorczuk","id":"5BFF67CE-02D1-11E9-B11A-A5A4D7DFFFD0","full_name":"Fiedorczuk, Karol","first_name":"Karol"},{"full_name":"Sazanov, Leonid A","id":"338D39FE-F248-11E8-B48F-1D18A9856A87","last_name":"Sazanov","first_name":"Leonid A","orcid":"0000-0002-0977-7989"}],"year":"2018","scopus_import":"1","tmp":{"short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"issue":"10","volume":28,"has_accepted_license":"1"},{"publication_identifier":{"issn":["0091679X"]},"author":[{"orcid":"0000-0003-2856-3369","id":"3F0587C8-F248-11E8-B48F-1D18A9856A87","full_name":"Renkawitz, Jörg","last_name":"Renkawitz","first_name":"Jörg"},{"full_name":"Reversat, Anne","id":"35B76592-F248-11E8-B48F-1D18A9856A87","last_name":"Reversat","first_name":"Anne","orcid":"0000-0003-0666-8928"},{"full_name":"Leithner, Alexander F","id":"3B1B77E4-F248-11E8-B48F-1D18A9856A87","last_name":"Leithner","first_name":"Alexander F","orcid":"0000-0002-1073-744X"},{"last_name":"Merrin","id":"4515C308-F248-11E8-B48F-1D18A9856A87","full_name":"Merrin, Jack","first_name":"Jack","orcid":"0000-0001-5145-4609"},{"full_name":"Sixt, Michael K","last_name":"Sixt","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","first_name":"Michael K","orcid":"0000-0002-6620-9179"}],"language":[{"iso":"eng"}],"pmid":1,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","abstract":[{"lang":"eng","text":"Cells migrating in multicellular organisms steadily traverse complex three-dimensional (3D) environments. To decipher the underlying cell biology, current experimental setups either use simplified 2D, tissue-mimetic 3D (e.g., collagen matrices) or in vivo environments. While only in vivo experiments are truly physiological, they do not allow for precise manipulation of environmental parameters. 2D in vitro experiments do allow mechanical and chemical manipulations, but increasing evidence demonstrates substantial differences of migratory mechanisms in 2D and 3D. Here, we describe simple, robust, and versatile “pillar forests” to investigate cell migration in complex but fully controllable 3D environments. Pillar forests are polydimethylsiloxane-based setups, in which two closely adjacent surfaces are interconnected by arrays of micrometer-sized pillars. Changing the pillar shape, size, height and the inter-pillar distance precisely manipulates microenvironmental parameters (e.g., pore sizes, micro-geometry, micro-topology), while being easily combined with chemotactic cues, surface coatings, diverse cell types and advanced imaging techniques. Thus, pillar forests combine the advantages of 2D cell migration assays with the precise definition of 3D environmental parameters."}],"date_updated":"2023-09-13T08:56:35Z","article_processing_charge":"No","volume":147,"year":"2018","scopus_import":"1","page":"79 - 91","title":"Micro-engineered “pillar forests” to study cell migration in complex but controlled 3D environments","department":[{"_id":"MiSi"},{"_id":"NanoFab"}],"_id":"153","publist_id":"7768","publisher":"Academic Press","publication_status":"published","month":"07","quality_controlled":"1","type":"book_chapter","date_created":"2018-12-11T11:44:54Z","oa_version":"None","citation":{"ama":"Renkawitz J, Reversat A, Leithner AF, Merrin J, Sixt MK. Micro-engineered “pillar forests” to study cell migration in complex but controlled 3D environments. In: Methods in Cell Biology. Vol 147. Academic Press; 2018:79-91. doi:10.1016/bs.mcb.2018.07.004","mla":"Renkawitz, Jörg, et al. “Micro-Engineered ‘Pillar Forests’ to Study Cell Migration in Complex but Controlled 3D Environments.” Methods in Cell Biology, vol. 147, Academic Press, 2018, pp. 79–91, doi:10.1016/bs.mcb.2018.07.004.","apa":"Renkawitz, J., Reversat, A., Leithner, A. F., Merrin, J., & Sixt, M. K. (2018). Micro-engineered “pillar forests” to study cell migration in complex but controlled 3D environments. In Methods in Cell Biology (Vol. 147, pp. 79–91). Academic Press. https://doi.org/10.1016/bs.mcb.2018.07.004","short":"J. Renkawitz, A. Reversat, A.F. Leithner, J. Merrin, M.K. Sixt, in:, Methods in Cell Biology, Academic Press, 2018, pp. 79–91.","ieee":"J. Renkawitz, A. Reversat, A. F. Leithner, J. Merrin, and M. K. Sixt, “Micro-engineered ‘pillar forests’ to study cell migration in complex but controlled 3D environments,” in Methods in Cell Biology, vol. 147, Academic Press, 2018, pp. 79–91.","chicago":"Renkawitz, Jörg, Anne Reversat, Alexander F Leithner, Jack Merrin, and Michael K Sixt. “Micro-Engineered ‘Pillar Forests’ to Study Cell Migration in Complex but Controlled 3D Environments.” In Methods in Cell Biology, 147:79–91. Academic Press, 2018. https://doi.org/10.1016/bs.mcb.2018.07.004.","ista":"Renkawitz J, Reversat A, Leithner AF, Merrin J, Sixt MK. 2018.Micro-engineered “pillar forests” to study cell migration in complex but controlled 3D environments. In: Methods in Cell Biology. vol. 147, 79–91."},"publication":"Methods in Cell Biology","day":"27","external_id":{"isi":["000452412300006"],"pmid":["30165964"]},"isi":1,"intvolume":" 147","date_published":"2018-07-27T00:00:00Z","doi":"10.1016/bs.mcb.2018.07.004","status":"public"},{"day":"01","external_id":{"isi":["000439639700001"]},"oa":1,"status":"public","related_material":{"record":[{"relation":"dissertation_contains","id":"52","status":"public"}]},"intvolume":" 21","doi":"10.1007/s11040-018-9275-3","date_published":"2018-09-01T00:00:00Z","article_number":"19","isi":1,"quality_controlled":"1","acknowledgement":"Open access funding provided by Austrian Science Fund (FWF).","month":"09","publication":"Mathematical Physics Analysis and Geometry","date_created":"2018-12-11T11:44:55Z","oa_version":"Published Version","citation":{"ista":"Moser T, Seiringer R. 2018. Stability of the 2+2 fermionic system with point interactions. Mathematical Physics Analysis and Geometry. 21(3), 19.","chicago":"Moser, Thomas, and Robert Seiringer. “Stability of the 2+2 Fermionic System with Point Interactions.” Mathematical Physics Analysis and Geometry. Springer, 2018. https://doi.org/10.1007/s11040-018-9275-3.","short":"T. Moser, R. Seiringer, Mathematical Physics Analysis and Geometry 21 (2018).","ieee":"T. Moser and R. Seiringer, “Stability of the 2+2 fermionic system with point interactions,” Mathematical Physics Analysis and Geometry, vol. 21, no. 3. Springer, 2018.","apa":"Moser, T., & Seiringer, R. (2018). Stability of the 2+2 fermionic system with point interactions. Mathematical Physics Analysis and Geometry. Springer. https://doi.org/10.1007/s11040-018-9275-3","mla":"Moser, Thomas, and Robert Seiringer. “Stability of the 2+2 Fermionic System with Point Interactions.” Mathematical Physics Analysis and Geometry, vol. 21, no. 3, 19, Springer, 2018, doi:10.1007/s11040-018-9275-3.","ama":"Moser T, Seiringer R. Stability of the 2+2 fermionic system with point interactions. Mathematical Physics Analysis and Geometry. 2018;21(3). doi:10.1007/s11040-018-9275-3"},"type":"journal_article","department":[{"_id":"RoSe"}],"project":[{"name":"Analysis of quantum many-body systems","call_identifier":"H2020","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","grant_number":"694227"},{"call_identifier":"FWF","name":"Structure of the Excitation Spectrum for Many-Body Quantum Systems","_id":"25C878CE-B435-11E9-9278-68D0E5697425","grant_number":"P27533_N27"},{"call_identifier":"FWF","name":"FWF Open Access Fund","_id":"3AC91DDA-15DF-11EA-824D-93A3E7B544D1"}],"title":"Stability of the 2+2 fermionic system with point interactions","publication_status":"published","ddc":["530"],"file_date_updated":"2020-07-14T12:45:01Z","article_type":"original","publist_id":"7767","publisher":"Springer","_id":"154","ec_funded":1,"date_updated":"2023-09-19T09:31:15Z","file":[{"relation":"main_file","file_id":"5729","creator":"dernst","content_type":"application/pdf","access_level":"open_access","date_created":"2018-12-17T16:49:02Z","file_size":496973,"checksum":"411c4db5700d7297c9cd8ebc5dd29091","date_updated":"2020-07-14T12:45:01Z","file_name":"2018_MathPhysics_Moser.pdf"}],"article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","abstract":[{"text":"We give a lower bound on the ground state energy of a system of two fermions of one species interacting with two fermions of another species via point interactions. We show that there is a critical mass ratio m2 ≈ 0.58 such that the system is stable, i.e., the energy is bounded from below, for m∈[m2,m2−1]. So far it was not known whether this 2 + 2 system exhibits a stable region at all or whether the formation of four-body bound states causes an unbounded spectrum for all mass ratios, similar to the Thomas effect. Our result gives further evidence for the stability of the more general N + M system.","lang":"eng"}],"language":[{"iso":"eng"}],"author":[{"last_name":"Moser","full_name":"Moser, Thomas","id":"2B5FC9A4-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas"},{"orcid":"0000-0002-6781-0521","last_name":"Seiringer","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","full_name":"Seiringer, Robert","first_name":"Robert"}],"publication_identifier":{"issn":["13850172"],"eissn":["15729656"]},"year":"2018","issue":"3","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"scopus_import":"1","volume":21,"has_accepted_license":"1"},{"citation":{"chicago":"Xuereb, André, Matteo Aquilina, and Shabir Barzanjeh. “Routing Thermal Noise through Quantum Networks.” edited by D L Andrews, A Ostendorf, A J Bain, and J M Nunzi, Vol. 10672. SPIE, 2018. https://doi.org/10.1117/12.2309928.","ista":"Xuereb A, Aquilina M, Barzanjeh S. 2018. Routing thermal noise through quantum networks. SPIE: The international society for optical engineering, Proceedings of SPIE, vol. 10672, 106721N.","short":"A. Xuereb, M. Aquilina, S. Barzanjeh, in:, D.L. Andrews, A. Ostendorf, A.J. Bain, J.M. Nunzi (Eds.), SPIE, 2018.","ieee":"A. Xuereb, M. Aquilina, and S. Barzanjeh, “Routing thermal noise through quantum networks,” presented at the SPIE: The international society for optical engineering, Strasbourg, France, 2018, vol. 10672.","mla":"Xuereb, André, et al. Routing Thermal Noise through Quantum Networks. Edited by D L Andrews et al., vol. 10672, 106721N, SPIE, 2018, doi:10.1117/12.2309928.","apa":"Xuereb, A., Aquilina, M., & Barzanjeh, S. (2018). Routing thermal noise through quantum networks. In D. L. Andrews, A. Ostendorf, A. J. Bain, & J. M. Nunzi (Eds.) (Vol. 10672). Presented at the SPIE: The international society for optical engineering, Strasbourg, France: SPIE. https://doi.org/10.1117/12.2309928","ama":"Xuereb A, Aquilina M, Barzanjeh S. Routing thermal noise through quantum networks. In: Andrews DL, Ostendorf A, Bain AJ, Nunzi JM, eds. Vol 10672. SPIE; 2018. doi:10.1117/12.2309928"},"oa_version":"Preprint","date_created":"2018-12-11T11:44:55Z","type":"conference","quality_controlled":"1","month":"05","arxiv":1,"status":"public","isi":1,"article_number":"106721N","date_published":"2018-05-04T00:00:00Z","doi":"10.1117/12.2309928","intvolume":" 10672","editor":[{"last_name":"Andrews","full_name":"Andrews, D L","first_name":"D L"},{"first_name":"A","full_name":"Ostendorf, A","last_name":"Ostendorf"},{"full_name":"Bain, A J","last_name":"Bain","first_name":"A J"},{"first_name":"J M","last_name":"Nunzi","full_name":"Nunzi, J M"}],"oa":1,"external_id":{"isi":["000453298500019"],"arxiv":["1806.01000"]},"main_file_link":[{"url":"https://arxiv.org/abs/1806.01000","open_access":"1"}],"day":"04","scopus_import":"1","year":"2018","volume":10672,"abstract":[{"lang":"eng","text":"There is currently significant interest in operating devices in the quantum regime, where their behaviour cannot be explained through classical mechanics. Quantum states, including entangled states, are fragile and easily disturbed by excessive thermal noise. Here we address the question of whether it is possible to create non-reciprocal devices that encourage the flow of thermal noise towards or away from a particular quantum device in a network. Our work makes use of the cascaded systems formalism to answer this question in the affirmative, showing how a three-port device can be used as an effective thermal transistor, and illustrates how this formalism maps onto an experimentally-realisable optomechanical system. Our results pave the way to more resilient quantum devices and to the use of thermal noise as a resource."}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","date_updated":"2023-09-18T08:12:24Z","conference":{"name":"SPIE: The international society for optical engineering","start_date":"2018-04-22","location":"Strasbourg, France","end_date":"2018-04-26"},"author":[{"full_name":"Xuereb, André","last_name":"Xuereb","first_name":"André"},{"first_name":"Matteo","last_name":"Aquilina","full_name":"Aquilina, Matteo"},{"full_name":"Barzanjeh, Shabir","id":"2D25E1F6-F248-11E8-B48F-1D18A9856A87","last_name":"Barzanjeh","first_name":"Shabir","orcid":"0000-0003-0415-1423"}],"language":[{"iso":"eng"}],"publication_status":"published","_id":"155","publisher":"SPIE","publist_id":"7766","alternative_title":["Proceedings of SPIE"],"department":[{"_id":"JoFi"}],"title":"Routing thermal noise through quantum networks"}]