[{"file_date_updated":"2020-07-14T12:47:55Z","title":"Inter-backbone charge transfer as prerequisite for long-range conductivity in perylene bisimide hydrogels","doi":"10.1021/acsnano.8b01689","page":"5800-5806","publisher":"ACS","publication_status":"published","has_accepted_license":"1","language":[{"iso":"eng"}],"publication":"ACS Nano","date_created":"2020-01-15T12:13:25Z","date_published":"2018-06-05T00:00:00Z","abstract":[{"text":"Hydrogelation, the self-assembly of molecules into soft, water-loaded networks, is one way to bridge the structural gap between single molecules and functional materials. The potential of hydrogels, such as those based on perylene bisimides, lies in their chemical, physical, optical, and electronic properties, which are governed by the supramolecular structure of the gel. However, the structural motifs and their precise role for long-range conductivity are yet to be explored. Here, we present a comprehensive structural picture of a perylene bisimide hydrogel, suggesting that its long-range conductivity is limited by charge transfer between electronic backbones. We reveal nanocrystalline ribbon-like structures as the electronic and structural backbone units between which charge transfer is mediated by polar solvent bridges. We exemplify this effect with sensing, where exposure to polar vapor enhances conductivity by 5 orders of magnitude, emphasizing the crucial role of the interplay between structural motif and surrounding medium for the rational design of devices based on nanocrystalline hydrogels.","lang":"eng"}],"file":[{"date_updated":"2020-07-14T12:47:55Z","creator":"sfreunbe","access_level":"open_access","checksum":"050f7f0ba5d845c5c71779ef14ad5ef3","relation":"main_file","file_id":"8052","file_size":1333353,"file_name":"Manuscript 20092017_subm.pdf","content_type":"application/pdf","date_created":"2020-06-29T14:56:40Z"}],"intvolume":" 12","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","type":"journal_article","status":"public","date_updated":"2021-01-12T08:12:46Z","extern":"1","issue":"6","author":[{"full_name":"Burian, Max","first_name":"Max","last_name":"Burian"},{"last_name":"Rigodanza","full_name":"Rigodanza, Francesco","first_name":"Francesco"},{"first_name":"Nicola","full_name":"Demitri, Nicola","last_name":"Demitri"},{"first_name":"Luka","full_name":"D̵ord̵ević, Luka","last_name":"D̵ord̵ević"},{"full_name":"Marchesan, Silvia","first_name":"Silvia","last_name":"Marchesan"},{"first_name":"Tereza","full_name":"Steinhartova, Tereza","last_name":"Steinhartova"},{"first_name":"Ilse","full_name":"Letofsky-Papst, Ilse","last_name":"Letofsky-Papst"},{"last_name":"Khalakhan","first_name":"Ivan","full_name":"Khalakhan, Ivan"},{"first_name":"Eléonore","full_name":"Mourad, Eléonore","last_name":"Mourad"},{"orcid":"0000-0003-2902-5319","first_name":"Stefan Alexander","full_name":"Freunberger, Stefan Alexander","last_name":"Freunberger","id":"A8CA28E6-CE23-11E9-AD2D-EC27E6697425"},{"full_name":"Amenitsch, Heinz","first_name":"Heinz","last_name":"Amenitsch"},{"full_name":"Prato, Maurizio","first_name":"Maurizio","last_name":"Prato"},{"first_name":"Zois","full_name":"Syrgiannis, Zois","last_name":"Syrgiannis"}],"ddc":["540","541"],"oa_version":"Submitted Version","oa":1,"month":"06","day":"05","article_processing_charge":"No","volume":12,"year":"2018","_id":"7285","article_type":"original","publication_identifier":{"issn":["1936-0851"]},"citation":{"apa":"Burian, M., Rigodanza, F., Demitri, N., D̵ord̵ević, L., Marchesan, S., Steinhartova, T., … Syrgiannis, Z. (2018). Inter-backbone charge transfer as prerequisite for long-range conductivity in perylene bisimide hydrogels. ACS Nano. ACS. https://doi.org/10.1021/acsnano.8b01689","chicago":"Burian, Max, Francesco Rigodanza, Nicola Demitri, Luka D̵ord̵ević, Silvia Marchesan, Tereza Steinhartova, Ilse Letofsky-Papst, et al. “Inter-Backbone Charge Transfer as Prerequisite for Long-Range Conductivity in Perylene Bisimide Hydrogels.” ACS Nano. ACS, 2018. https://doi.org/10.1021/acsnano.8b01689.","short":"M. Burian, F. Rigodanza, N. Demitri, L. D̵ord̵ević, S. Marchesan, T. Steinhartova, I. Letofsky-Papst, I. Khalakhan, E. Mourad, S.A. Freunberger, H. Amenitsch, M. Prato, Z. Syrgiannis, ACS Nano 12 (2018) 5800–5806.","ieee":"M. Burian et al., “Inter-backbone charge transfer as prerequisite for long-range conductivity in perylene bisimide hydrogels,” ACS Nano, vol. 12, no. 6. ACS, pp. 5800–5806, 2018.","ama":"Burian M, Rigodanza F, Demitri N, et al. Inter-backbone charge transfer as prerequisite for long-range conductivity in perylene bisimide hydrogels. ACS Nano. 2018;12(6):5800-5806. doi:10.1021/acsnano.8b01689","ista":"Burian M, Rigodanza F, Demitri N, D̵ord̵ević L, Marchesan S, Steinhartova T, Letofsky-Papst I, Khalakhan I, Mourad E, Freunberger SA, Amenitsch H, Prato M, Syrgiannis Z. 2018. Inter-backbone charge transfer as prerequisite for long-range conductivity in perylene bisimide hydrogels. ACS Nano. 12(6), 5800–5806.","mla":"Burian, Max, et al. “Inter-Backbone Charge Transfer as Prerequisite for Long-Range Conductivity in Perylene Bisimide Hydrogels.” ACS Nano, vol. 12, no. 6, ACS, 2018, pp. 5800–06, doi:10.1021/acsnano.8b01689."}},{"publication_status":"published","has_accepted_license":"1","language":[{"iso":"eng"}],"date_created":"2020-01-15T12:13:52Z","publication":"ACS Energy Letters","date_published":"2018-01-01T00:00:00Z","title":"Quantifying total superoxide, peroxide, and carbonaceous compounds in metal–O2 batteries and the solid electrolyte interphase","file_date_updated":"2020-07-14T12:47:55Z","doi":"10.1021/acsenergylett.7b01111","page":"170-176","publisher":"ACS","intvolume":" 3","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","abstract":[{"text":"Passivation layers on electrode materials are ubiquitous in nonaqueous battery chemistries and strongly govern performance and lifetime. They comprise breakdown products of the electrolyte including carbonate, alkyl carbonates, alkoxides, carboxylates, and polymers. Parasitic chemistry in metal–O2 batteries forms similar products and is tied to the deviation of the O2 balance from the ideal stoichiometry during formation/decomposition of alkaline peroxides or superoxides. Accurate and integral quantification of carbonaceous species and peroxides or superoxides in battery electrodes remains, however, elusive. We present a refined procedure to quantify them accurately and sensitively by pointing out and rectifying pitfalls of previous procedures. Carbonaceous compounds are differentiated into inorganic and organic ones. We combine mass and UV–vis spectrometry to quantify evolved O2 and complexed peroxide and CO2 evolved from carbonaceous compounds by acid treatment and Fenton’s reaction. The capabilities of the method are exemplified by means of Li–O2 and Na–O2 cathodes, graphite anodes, and LiNi0.8Co0.15Al0.05O2 cathodes.","lang":"eng"}],"file":[{"access_level":"open_access","checksum":"461ccf575ba077af90314fe72d20521e","file_size":1892355,"relation":"main_file","file_id":"8049","file_name":"O2 TIOC_fin_incl_SI.pdf","date_updated":"2020-07-14T12:47:55Z","creator":"sfreunbe","content_type":"application/pdf","date_created":"2020-06-29T14:19:36Z"}],"extern":"1","issue":"1","author":[{"last_name":"Schafzahl","first_name":"Bettina","full_name":"Schafzahl, Bettina"},{"first_name":"Eléonore","full_name":"Mourad, Eléonore","last_name":"Mourad"},{"last_name":"Schafzahl","full_name":"Schafzahl, Lukas","first_name":"Lukas"},{"last_name":"Petit","first_name":"Yann K.","full_name":"Petit, Yann K."},{"last_name":"Raju","first_name":"Anjana R.","full_name":"Raju, Anjana R."},{"last_name":"Thotiyl","first_name":"Musthafa Ottakam","full_name":"Thotiyl, Musthafa Ottakam"},{"first_name":"Martin","full_name":"Wilkening, Martin","last_name":"Wilkening"},{"last_name":"Slugovc","first_name":"Christian","full_name":"Slugovc, Christian"},{"first_name":"Stefan Alexander","orcid":"0000-0003-2902-5319","full_name":"Freunberger, Stefan Alexander","last_name":"Freunberger","id":"A8CA28E6-CE23-11E9-AD2D-EC27E6697425"}],"ddc":["540","543","546","547"],"oa_version":"Submitted Version","month":"01","oa":1,"type":"journal_article","status":"public","date_updated":"2021-01-12T08:12:46Z","_id":"7287","year":"2018","article_type":"letter_note","publication_identifier":{"issn":["2380-8195","2380-8195"]},"citation":{"ista":"Schafzahl B, Mourad E, Schafzahl L, Petit YK, Raju AR, Thotiyl MO, Wilkening M, Slugovc C, Freunberger SA. 2018. Quantifying total superoxide, peroxide, and carbonaceous compounds in metal–O2 batteries and the solid electrolyte interphase. ACS Energy Letters. 3(1), 170–176.","mla":"Schafzahl, Bettina, et al. “Quantifying Total Superoxide, Peroxide, and Carbonaceous Compounds in Metal–O2 Batteries and the Solid Electrolyte Interphase.” ACS Energy Letters, vol. 3, no. 1, ACS, 2018, pp. 170–76, doi:10.1021/acsenergylett.7b01111.","apa":"Schafzahl, B., Mourad, E., Schafzahl, L., Petit, Y. K., Raju, A. R., Thotiyl, M. O., … Freunberger, S. A. (2018). Quantifying total superoxide, peroxide, and carbonaceous compounds in metal–O2 batteries and the solid electrolyte interphase. ACS Energy Letters. ACS. https://doi.org/10.1021/acsenergylett.7b01111","chicago":"Schafzahl, Bettina, Eléonore Mourad, Lukas Schafzahl, Yann K. Petit, Anjana R. Raju, Musthafa Ottakam Thotiyl, Martin Wilkening, Christian Slugovc, and Stefan Alexander Freunberger. “Quantifying Total Superoxide, Peroxide, and Carbonaceous Compounds in Metal–O2 Batteries and the Solid Electrolyte Interphase.” ACS Energy Letters. ACS, 2018. https://doi.org/10.1021/acsenergylett.7b01111.","short":"B. Schafzahl, E. Mourad, L. Schafzahl, Y.K. Petit, A.R. Raju, M.O. Thotiyl, M. Wilkening, C. Slugovc, S.A. Freunberger, ACS Energy Letters 3 (2018) 170–176.","ama":"Schafzahl B, Mourad E, Schafzahl L, et al. Quantifying total superoxide, peroxide, and carbonaceous compounds in metal–O2 batteries and the solid electrolyte interphase. ACS Energy Letters. 2018;3(1):170-176. doi:10.1021/acsenergylett.7b01111","ieee":"B. Schafzahl et al., “Quantifying total superoxide, peroxide, and carbonaceous compounds in metal–O2 batteries and the solid electrolyte interphase,” ACS Energy Letters, vol. 3, no. 1. ACS, pp. 170–176, 2018."},"day":"01","article_processing_charge":"No","volume":3},{"language":[{"iso":"eng"}],"date_created":"2018-12-11T11:48:14Z","publication":"Real-Time Systems","date_published":"2018-01-01T00:00:00Z","scopus_import":"1","publication_status":"published","isi":1,"has_accepted_license":"1","publist_id":"6929","publisher":"Springer","file_date_updated":"2020-07-14T12:47:56Z","title":"Automated competitive analysis of real time scheduling with graph games","doi":"10.1007/s11241-017-9293-4","page":"166 - 207","pubrep_id":"960","quality_controlled":"1","intvolume":" 54","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","file":[{"content_type":"application/pdf","date_created":"2018-12-12T10:17:14Z","creator":"system","date_updated":"2020-07-14T12:47:56Z","file_name":"IST-2018-960-v1+1_2017_Chatterjee_Automated_competetive.pdf","relation":"main_file","file_size":1163507,"file_id":"5267","checksum":"c2590ef160709d8054cf29ee173f1454","access_level":"open_access"}],"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"}],"tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"month":"01","oa":1,"oa_version":"Published Version","issue":"1","ddc":["000"],"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu"},{"id":"49704004-F248-11E8-B48F-1D18A9856A87","last_name":"Pavlogiannis","full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722","first_name":"Andreas"},{"last_name":"Kößler","first_name":"Alexander","full_name":"Kößler, Alexander"},{"first_name":"Ulrich","full_name":"Schmid, Ulrich","last_name":"Schmid"}],"type":"journal_article","date_updated":"2023-09-27T12:52:38Z","status":"public","external_id":{"isi":["000419955500006"]},"related_material":{"record":[{"relation":"earlier_version","id":"2820","status":"public"}]},"department":[{"_id":"KrCh"}],"citation":{"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","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.","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.","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.","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."},"year":"2018","_id":"738","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","call_identifier":"FWF"},{"grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"volume":54,"day":"01","ec_funded":1,"article_processing_charge":"No"},{"tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"access_level":"open_access","checksum":"5cebb7f7849a3beda898f697d755dd96","file_name":"2018_LIPIcs_Pietrzak.pdf","file_id":"7443","relation":"main_file","file_size":822884,"date_updated":"2020-07-14T12:47:57Z","creator":"dernst","date_created":"2020-02-04T08:17:52Z","content_type":"application/pdf"}],"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. "}],"quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 124","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","doi":"10.4230/LIPICS.ITCS.2019.59","page":"59:1-59:25","file_date_updated":"2020-07-14T12:47:57Z","title":"Proofs of catalytic space","date_published":"2018-12-31T00:00:00Z","publication":"10th Innovations in Theoretical Computer Science Conference (ITCS 2019)","language":[{"iso":"eng"}],"date_created":"2020-01-30T09:16:05Z","has_accepted_license":"1","scopus_import":1,"publication_status":"published","alternative_title":["LIPIcs"],"volume":124,"project":[{"grant_number":"682815","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","name":"Teaching Old Crypto New Tricks","call_identifier":"H2020"}],"conference":{"end_date":"2019-01-12","location":"San Diego, CA, United States","start_date":"2019-01-10","name":"ITCS: Innovations in theoretical Computer Science Conference"},"article_processing_charge":"No","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2018/194"}],"ec_funded":1,"day":"31","citation":{"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.","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","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.","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","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."},"publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-95977-095-8"]},"_id":"7407","year":"2018","date_updated":"2021-01-12T08:13:26Z","status":"public","type":"conference","department":[{"_id":"KrPi"}],"oa":1,"month":"12","oa_version":"Published Version","ddc":["000"],"author":[{"full_name":"Pietrzak, Krzysztof Z","orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak"}]},{"year":"2018","_id":"742","citation":{"ista":"Dotterrer D, Kaufman T, Wagner U. 2018. On expansion and topological overlap. Geometriae Dedicata. 195(1), 307–317.","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.","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.","short":"D. Dotterrer, T. Kaufman, U. Wagner, Geometriae Dedicata 195 (2018) 307–317.","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","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","ieee":"D. Dotterrer, T. Kaufman, and U. Wagner, “On expansion and topological overlap,” Geometriae Dedicata, vol. 195, no. 1. Springer, pp. 307–317, 2018."},"article_processing_charge":"Yes (via OA deal)","day":"01","volume":195,"project":[{"_id":"25FA3206-B435-11E9-9278-68D0E5697425","grant_number":"PP00P2_138948","name":"Embeddings in Higher Dimensions: Algorithms and Combinatorics"}],"ddc":["514","516"],"author":[{"last_name":"Dotterrer","full_name":"Dotterrer, Dominic","first_name":"Dominic"},{"last_name":"Kaufman","full_name":"Kaufman, Tali","first_name":"Tali"},{"full_name":"Wagner, Uli","orcid":"0000-0002-1494-0568","first_name":"Uli","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","last_name":"Wagner"}],"issue":"1","month":"08","oa":1,"oa_version":"Published Version","related_material":{"record":[{"status":"public","id":"1378","relation":"earlier_version"}]},"department":[{"_id":"UlWa"}],"external_id":{"isi":["000437122700017"]},"date_updated":"2023-09-27T12:29:57Z","status":"public","type":"journal_article","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","intvolume":" 195","quality_controlled":"1","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"content_type":"application/pdf","date_created":"2019-01-15T13:44:05Z","file_id":"5835","file_size":412486,"relation":"main_file","file_name":"s10711-017-0291-4.pdf","checksum":"d2f70fc132156504aa4c626aa378a7ab","access_level":"open_access","creator":"kschuh","date_updated":"2020-07-14T12:47:58Z"}],"abstract":[{"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.","lang":"eng"}],"has_accepted_license":"1","scopus_import":"1","publication_status":"published","isi":1,"date_published":"2018-08-01T00:00:00Z","language":[{"iso":"eng"}],"publication":"Geometriae Dedicata","date_created":"2018-12-11T11:48:16Z","page":"307–317","doi":"10.1007/s10711-017-0291-4","pubrep_id":"912","file_date_updated":"2020-07-14T12:47:58Z","title":"On expansion and topological overlap","publisher":"Springer","publist_id":"6925"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2018","_id":"75","article_number":"1804.03057","citation":{"mla":"Akopyan, Arseniy, et al. Convex Fair Partitions into Arbitrary Number of Pieces. 1804.03057, arXiv, 2018, doi:10.48550/arXiv.1804.03057.","ista":"Akopyan A, Avvakumov S, Karasev R. 2018. Convex fair partitions into arbitrary number of pieces. 1804.03057.","ieee":"A. Akopyan, S. Avvakumov, and R. Karasev, “Convex fair partitions into arbitrary number of pieces.” arXiv, 2018.","ama":"Akopyan A, Avvakumov S, Karasev R. Convex fair partitions into arbitrary number of pieces. 2018. doi:10.48550/arXiv.1804.03057","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.","short":"A. Akopyan, S. Avvakumov, R. Karasev, (2018).","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"},"article_processing_charge":"No","main_file_link":[{"url":"https://arxiv.org/abs/1804.03057","open_access":"1"}],"day":"13","ec_funded":1,"abstract":[{"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.","lang":"eng"}],"project":[{"call_identifier":"H2020","name":"Optimal Transport and Stochastic Dynamics","grant_number":"716117","_id":"256E75B8-B435-11E9-9278-68D0E5697425"}],"author":[{"last_name":"Akopyan","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2548-617X","first_name":"Arseniy","full_name":"Akopyan, Arseniy"},{"full_name":"Avvakumov, Sergey","first_name":"Sergey","id":"3827DAC8-F248-11E8-B48F-1D18A9856A87","last_name":"Avvakumov"},{"last_name":"Karasev","first_name":"Roman","full_name":"Karasev, Roman"}],"publication_status":"published","date_published":"2018-09-13T00:00:00Z","language":[{"iso":"eng"}],"date_created":"2018-12-11T11:44:30Z","oa":1,"month":"09","oa_version":"Preprint","arxiv":1,"doi":"10.48550/arXiv.1804.03057","related_material":{"record":[{"status":"public","id":"8156","relation":"dissertation_contains"}]},"department":[{"_id":"HeEd"},{"_id":"JaMa"}],"external_id":{"arxiv":["1804.03057"]},"title":"Convex fair partitions into arbitrary number of pieces","date_updated":"2023-12-18T10:51:02Z","publisher":"arXiv","status":"public","type":"preprint"},{"doi":"10.1007/s00446-018-0342-6","title":"Near-optimal self-stabilising counting and firing squads","file_date_updated":"2020-07-14T12:48:01Z","publisher":"Springer","publist_id":"7978","has_accepted_license":"1","isi":1,"publication_status":"published","scopus_import":"1","date_published":"2018-09-12T00:00:00Z","language":[{"iso":"eng"}],"publication":"Distributed Computing","date_created":"2018-12-11T11:44:30Z","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"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."}],"file":[{"date_created":"2018-12-17T14:21:22Z","content_type":"application/pdf","relation":"main_file","file_size":799337,"file_id":"5711","file_name":"2018_DistributedComputing_Lenzen.pdf","checksum":"872db70bba9b401500abe3c6ae2f1a61","access_level":"open_access","creator":"dernst","date_updated":"2020-07-14T12:48:01Z"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","quality_controlled":"1","department":[{"_id":"DaAl"}],"external_id":{"isi":["000475627800005"]},"status":"public","date_updated":"2023-09-13T09:01:06Z","type":"journal_article","author":[{"last_name":"Lenzen","full_name":"Lenzen, Christoph","first_name":"Christoph"},{"id":"334EFD2E-F248-11E8-B48F-1D18A9856A87","last_name":"Rybicki","full_name":"Rybicki, Joel","first_name":"Joel","orcid":"0000-0002-6432-6646"}],"ddc":["000"],"oa_version":"Published Version","oa":1,"month":"09","article_processing_charge":"Yes (via OA deal)","day":"12","project":[{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}],"_id":"76","year":"2018","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","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.","short":"C. Lenzen, J. Rybicki, Distributed Computing (2018).","ama":"Lenzen C, Rybicki J. Near-optimal self-stabilising counting and firing squads. Distributed Computing. 2018. doi:10.1007/s00446-018-0342-6","ieee":"C. Lenzen and J. Rybicki, “Near-optimal self-stabilising counting and firing squads,” Distributed Computing. Springer, 2018.","ista":"Lenzen C, Rybicki J. 2018. Near-optimal self-stabilising counting and firing squads. Distributed Computing.","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."}},{"doi":"10.1038/s41467-018-06418-4","title":"A germanium hole spin qubit","file_date_updated":"2020-07-14T12:48:02Z","publisher":"Nature Publishing Group","has_accepted_license":"1","publication_status":"published","scopus_import":"1","isi":1,"date_published":"2018-09-25T00:00:00Z","language":[{"iso":"eng"}],"publication":"Nature Communications","date_created":"2018-12-11T11:44:30Z","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"creator":"dernst","date_updated":"2020-07-14T12:48:02Z","file_name":"2018_NatureComm_Watzinger.pdf","relation":"main_file","file_size":1063469,"file_id":"5687","access_level":"open_access","checksum":"e7148c10a64497e279c4de570b6cc544","date_created":"2018-12-17T10:28:30Z","content_type":"application/pdf"}],"abstract":[{"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.","lang":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","intvolume":" 9","quality_controlled":"1","related_material":{"record":[{"relation":"popular_science","id":"7977"},{"id":"7996","relation":"dissertation_contains","status":"public"}]},"department":[{"_id":"GeKa"}],"external_id":{"isi":["000445560800010"]},"date_updated":"2023-09-08T11:44:02Z","status":"public","type":"journal_article","ddc":["530"],"author":[{"first_name":"Hannes","full_name":"Watzinger, Hannes","last_name":"Watzinger","id":"35DF8E50-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Josip","full_name":"Kukucka, Josip","last_name":"Kukucka","id":"3F5D8856-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Lada","orcid":"0000-0003-2424-8636","full_name":"Vukusic, Lada","last_name":"Vukusic","id":"31E9F056-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Gao, Fei","first_name":"Fei","last_name":"Gao"},{"last_name":"Wang","first_name":"Ting","full_name":"Wang, Ting"},{"full_name":"Schäffler, Friedrich","first_name":"Friedrich","last_name":"Schäffler"},{"full_name":"Zhang, Jian","first_name":"Jian","last_name":"Zhang"},{"id":"38DB5788-F248-11E8-B48F-1D18A9856A87","last_name":"Katsaros","full_name":"Katsaros, Georgios","orcid":"0000-0001-8342-202X","first_name":"Georgios"}],"issue":"3902 ","oa":1,"month":"09","oa_version":"Published Version","article_processing_charge":"Yes","ec_funded":1,"day":"25","acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"NanoFab"}],"volume":9,"project":[{"call_identifier":"FP7","name":"Towards Spin qubits and Majorana fermions in Germanium selfassembled hut-wires","_id":"25517E86-B435-11E9-9278-68D0E5697425","grant_number":"335497"},{"call_identifier":"FWF","name":"Loch Spin-Qubits und Majorana-Fermionen in Germanium","_id":"2552F888-B435-11E9-9278-68D0E5697425","grant_number":"Y00715"}],"article_type":"original","year":"2018","_id":"77","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","ieee":"H. Watzinger et al., “A germanium hole spin qubit,” Nature Communications, vol. 9, no. 3902. Nature Publishing Group, 2018.","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","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.","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.","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)."}},{"extern":"1","publication_status":"published","author":[{"last_name":"Yap","first_name":"Chloe X.","full_name":"Yap, Chloe X."},{"first_name":"Julia","full_name":"Sidorenko, Julia","last_name":"Sidorenko"},{"first_name":"Yang","full_name":"Wu, Yang","last_name":"Wu"},{"first_name":"Kathryn E.","full_name":"Kemper, Kathryn E.","last_name":"Kemper"},{"first_name":"Jian","full_name":"Yang, Jian","last_name":"Yang"},{"first_name":"Naomi R.","full_name":"Wray, Naomi R.","last_name":"Wray"},{"last_name":"Robinson","id":"E5D42276-F5DA-11E9-8E24-6303E6697425","orcid":"0000-0001-8982-8813","first_name":"Matthew Richard","full_name":"Robinson, Matthew Richard"},{"last_name":"Visscher","first_name":"Peter M.","full_name":"Visscher, Peter M."}],"oa_version":"Published Version","publication":"Nature Communications","oa":1,"month":"12","date_created":"2020-04-30T10:41:19Z","language":[{"iso":"eng"}],"date_published":"2018-12-20T00:00:00Z","title":"Dissection of genetic variation and evidence for pleiotropy in male pattern baldness","doi":"10.1038/s41467-018-07862-y","type":"journal_article","status":"public","date_updated":"2021-01-12T08:15:02Z","publisher":"Springer Nature","year":"2018","_id":"7712","intvolume":" 9","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_type":"original","publication_identifier":{"issn":["2041-1723"]},"quality_controlled":"1","article_number":"5407","citation":{"mla":"Yap, Chloe X., et al. “Dissection of Genetic Variation and Evidence for Pleiotropy in Male Pattern Baldness.” Nature Communications, vol. 9, 5407, Springer Nature, 2018, doi:10.1038/s41467-018-07862-y.","ista":"Yap CX, Sidorenko J, Wu Y, Kemper KE, Yang J, Wray NR, Robinson MR, Visscher PM. 2018. Dissection of genetic variation and evidence for pleiotropy in male pattern baldness. Nature Communications. 9, 5407.","ieee":"C. X. Yap et al., “Dissection of genetic variation and evidence for pleiotropy in male pattern baldness,” Nature Communications, vol. 9. Springer Nature, 2018.","ama":"Yap CX, Sidorenko J, Wu Y, et al. Dissection of genetic variation and evidence for pleiotropy in male pattern baldness. Nature Communications. 2018;9. doi:10.1038/s41467-018-07862-y","chicago":"Yap, Chloe X., Julia Sidorenko, Yang Wu, Kathryn E. Kemper, Jian Yang, Naomi R. Wray, Matthew Richard Robinson, and Peter M. Visscher. “Dissection of Genetic Variation and Evidence for Pleiotropy in Male Pattern Baldness.” Nature Communications. Springer Nature, 2018. https://doi.org/10.1038/s41467-018-07862-y.","short":"C.X. Yap, J. Sidorenko, Y. Wu, K.E. Kemper, J. Yang, N.R. Wray, M.R. Robinson, P.M. Visscher, Nature Communications 9 (2018).","apa":"Yap, C. X., Sidorenko, J., Wu, Y., Kemper, K. E., Yang, J., Wray, N. R., … Visscher, P. M. (2018). Dissection of genetic variation and evidence for pleiotropy in male pattern baldness. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-018-07862-y"},"abstract":[{"text":"Male pattern baldness (MPB) is a sex-limited, age-related, complex trait. We study MPB genetics in 205,327 European males from the UK Biobank. Here we show that MPB is strongly heritable and polygenic, with pedigree-heritability of 0.62 (SE = 0.03) estimated from close relatives, and SNP-heritability of 0.39 (SE = 0.01) from conventionally-unrelated males. We detect 624 near-independent genome-wide loci, contributing SNP-heritability of 0.25 (SE = 0.01), of which 26 X-chromosome loci explain 11.6%. Autosomal genetic variance is enriched for common variants and regions of lower linkage disequilibrium. We identify plausible genetic correlations between MPB and multiple sex-limited markers of earlier puberty, increased bone mineral density (rg = 0.15) and pancreatic β-cell function (rg = 0.12). Correlations with reproductive traits imply an effect on fitness, consistent with an estimated linear selection gradient of -0.018 per MPB standard deviation. Overall, we provide genetic insights into MPB: a phenotype of interest in its own right, with value as a model sex-limited, complex trait.","lang":"eng"}],"day":"20","article_processing_charge":"No","main_file_link":[{"url":"https://doi.org/10.1038/s41467-018-07862-y","open_access":"1"}],"volume":9},{"article_type":"original","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2018","_id":"7713","intvolume":" 9","publication_identifier":{"issn":["2041-1723"]},"quality_controlled":"1","citation":{"mla":"Guo, Jing, et al. “Global Genetic Differentiation of Complex Traits Shaped by Natural Selection in Humans.” Nature Communications, vol. 9, 1865, Springer Nature, 2018, doi:10.1038/s41467-018-04191-y.","ista":"Guo J, Wu Y, Zhu Z, Zheng Z, Trzaskowski M, Zeng J, Robinson MR, Visscher PM, Yang J. 2018. Global genetic differentiation of complex traits shaped by natural selection in humans. Nature Communications. 9, 1865.","ieee":"J. Guo et al., “Global genetic differentiation of complex traits shaped by natural selection in humans,” Nature Communications, vol. 9. Springer Nature, 2018.","ama":"Guo J, Wu Y, Zhu Z, et al. Global genetic differentiation of complex traits shaped by natural selection in humans. Nature Communications. 2018;9. doi:10.1038/s41467-018-04191-y","apa":"Guo, J., Wu, Y., Zhu, Z., Zheng, Z., Trzaskowski, M., Zeng, J., … Yang, J. (2018). Global genetic differentiation of complex traits shaped by natural selection in humans. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-018-04191-y","short":"J. Guo, Y. Wu, Z. Zhu, Z. Zheng, M. Trzaskowski, J. Zeng, M.R. Robinson, P.M. Visscher, J. Yang, Nature Communications 9 (2018).","chicago":"Guo, Jing, Yang Wu, Zhihong Zhu, Zhili Zheng, Maciej Trzaskowski, Jian Zeng, Matthew Richard Robinson, Peter M. Visscher, and Jian Yang. “Global Genetic Differentiation of Complex Traits Shaped by Natural Selection in Humans.” Nature Communications. Springer Nature, 2018. https://doi.org/10.1038/s41467-018-04191-y."},"article_number":"1865","article_processing_charge":"No","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1038/s41467-018-04191-y"}],"abstract":[{"lang":"eng","text":"There are mean differences in complex traits among global human populations. We hypothesize that part of the phenotypic differentiation is due to natural selection. To address this hypothesis, we assess the differentiation in allele frequencies of trait-associated SNPs among African, Eastern Asian, and European populations for ten complex traits using data of large sample size (up to ~405,000). We show that SNPs associated with height (P=2.46×10−5), waist-to-hip ratio (P=2.77×10−4), and schizophrenia (P=3.96×10−5) are significantly more differentiated among populations than matched “control” SNPs, suggesting that these trait-associated SNPs have undergone natural selection. We further find that SNPs associated with height (P=2.01×10−6) and schizophrenia (P=5.16×10−18) show significantly higher variance in linkage disequilibrium (LD) scores across populations than control SNPs. Our results support the hypothesis that natural selection has shaped the genetic differentiation of complex traits, such as height and schizophrenia, among worldwide populations."}],"day":"14","volume":9,"author":[{"full_name":"Guo, Jing","first_name":"Jing","last_name":"Guo"},{"last_name":"Wu","full_name":"Wu, Yang","first_name":"Yang"},{"full_name":"Zhu, Zhihong","first_name":"Zhihong","last_name":"Zhu"},{"last_name":"Zheng","first_name":"Zhili","full_name":"Zheng, Zhili"},{"first_name":"Maciej","full_name":"Trzaskowski, Maciej","last_name":"Trzaskowski"},{"last_name":"Zeng","full_name":"Zeng, Jian","first_name":"Jian"},{"id":"E5D42276-F5DA-11E9-8E24-6303E6697425","last_name":"Robinson","full_name":"Robinson, Matthew Richard","first_name":"Matthew Richard","orcid":"0000-0001-8982-8813"},{"last_name":"Visscher","first_name":"Peter M.","full_name":"Visscher, Peter M."},{"full_name":"Yang, Jian","first_name":"Jian","last_name":"Yang"}],"extern":"1","publication_status":"published","date_published":"2018-05-14T00:00:00Z","oa_version":"Published Version","language":[{"iso":"eng"}],"oa":1,"publication":"Nature Communications","date_created":"2020-04-30T10:41:36Z","month":"05","doi":"10.1038/s41467-018-04191-y","title":"Global genetic differentiation of complex traits shaped by natural selection in humans","status":"public","date_updated":"2021-01-12T08:15:02Z","publisher":"Springer Nature","type":"journal_article"},{"title":"Causal associations between risk factors and common diseases inferred from GWAS summary data","doi":"10.1038/s41467-017-02317-2","type":"journal_article","date_updated":"2021-01-12T08:15:03Z","publisher":"Springer Nature","status":"public","publication_status":"published","extern":"1","author":[{"full_name":"Zhu, Zhihong","first_name":"Zhihong","last_name":"Zhu"},{"last_name":"Zheng","first_name":"Zhili","full_name":"Zheng, Zhili"},{"first_name":"Futao","full_name":"Zhang, Futao","last_name":"Zhang"},{"first_name":"Yang","full_name":"Wu, Yang","last_name":"Wu"},{"full_name":"Trzaskowski, Maciej","first_name":"Maciej","last_name":"Trzaskowski"},{"full_name":"Maier, Robert","first_name":"Robert","last_name":"Maier"},{"last_name":"Robinson","id":"E5D42276-F5DA-11E9-8E24-6303E6697425","orcid":"0000-0001-8982-8813","first_name":"Matthew Richard","full_name":"Robinson, Matthew Richard"},{"last_name":"McGrath","first_name":"John J.","full_name":"McGrath, John J."},{"last_name":"Visscher","full_name":"Visscher, Peter M.","first_name":"Peter M."},{"last_name":"Wray","full_name":"Wray, Naomi R.","first_name":"Naomi R."},{"last_name":"Yang","first_name":"Jian","full_name":"Yang, Jian"}],"publication":"Nature Communications","date_created":"2020-04-30T10:41:55Z","language":[{"iso":"eng"}],"oa":1,"month":"01","oa_version":"Published Version","date_published":"2018-01-15T00:00:00Z","day":"15","abstract":[{"lang":"eng","text":"Health risk factors such as body mass index (BMI) and serum cholesterol are associated with many common diseases. It often remains unclear whether the risk factors are cause or consequence of disease, or whether the associations are the result of confounding. We develop and apply a method (called GSMR) that performs a multi-SNP Mendelian randomization analysis using summary-level data from genome-wide association studies to test the causal associations of BMI, waist-to-hip ratio, serum cholesterols, blood pressures, height, and years of schooling (EduYears) with common diseases (sample sizes of up to 405,072). We identify a number of causal associations including a protective effect of LDL-cholesterol against type-2 diabetes (T2D) that might explain the side effects of statins on T2D, a protective effect of EduYears against Alzheimer’s disease, and bidirectional associations with opposite effects (e.g., higher BMI increases the risk of T2D but the effect of T2D on BMI is negative)."}],"article_processing_charge":"No","main_file_link":[{"url":"https://doi.org/10.1038/s41467-017-02317-2","open_access":"1"}],"volume":9,"intvolume":" 9","_id":"7714","year":"2018","article_type":"original","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Zhu Z, Zheng Z, Zhang F, Wu Y, Trzaskowski M, Maier R, Robinson MR, McGrath JJ, Visscher PM, Wray NR, Yang J. 2018. Causal associations between risk factors and common diseases inferred from GWAS summary data. Nature Communications. 9, 224.","mla":"Zhu, Zhihong, et al. “Causal Associations between Risk Factors and Common Diseases Inferred from GWAS Summary Data.” Nature Communications, vol. 9, 224, Springer Nature, 2018, doi:10.1038/s41467-017-02317-2.","short":"Z. Zhu, Z. Zheng, F. Zhang, Y. Wu, M. Trzaskowski, R. Maier, M.R. Robinson, J.J. McGrath, P.M. Visscher, N.R. Wray, J. Yang, Nature Communications 9 (2018).","chicago":"Zhu, Zhihong, Zhili Zheng, Futao Zhang, Yang Wu, Maciej Trzaskowski, Robert Maier, Matthew Richard Robinson, et al. “Causal Associations between Risk Factors and Common Diseases Inferred from GWAS Summary Data.” Nature Communications. Springer Nature, 2018. https://doi.org/10.1038/s41467-017-02317-2.","apa":"Zhu, Z., Zheng, Z., Zhang, F., Wu, Y., Trzaskowski, M., Maier, R., … Yang, J. (2018). Causal associations between risk factors and common diseases inferred from GWAS summary data. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-017-02317-2","ama":"Zhu Z, Zheng Z, Zhang F, et al. Causal associations between risk factors and common diseases inferred from GWAS summary data. Nature Communications. 2018;9. doi:10.1038/s41467-017-02317-2","ieee":"Z. Zhu et al., “Causal associations between risk factors and common diseases inferred from GWAS summary data,” Nature Communications, vol. 9. Springer Nature, 2018."},"article_number":"224","publication_identifier":{"issn":["2041-1723"]},"quality_controlled":"1"},{"oa_version":"Published Version","oa":1,"month":"03","language":[{"iso":"eng"}],"date_created":"2020-04-30T10:42:29Z","publication":"Nature Communications","date_published":"2018-03-07T00:00:00Z","extern":"1","publication_status":"published","author":[{"full_name":"Maier, Robert M.","first_name":"Robert M.","last_name":"Maier"},{"first_name":"Zhihong","full_name":"Zhu, Zhihong","last_name":"Zhu"},{"full_name":"Lee, Sang Hong","first_name":"Sang Hong","last_name":"Lee"},{"last_name":"Trzaskowski","full_name":"Trzaskowski, Maciej","first_name":"Maciej"},{"last_name":"Ruderfer","first_name":"Douglas M.","full_name":"Ruderfer, Douglas M."},{"full_name":"Stahl, Eli A.","first_name":"Eli A.","last_name":"Stahl"},{"full_name":"Ripke, Stephan","first_name":"Stephan","last_name":"Ripke"},{"last_name":"Wray","first_name":"Naomi R.","full_name":"Wray, Naomi R."},{"full_name":"Yang, Jian","first_name":"Jian","last_name":"Yang"},{"last_name":"Visscher","full_name":"Visscher, Peter M.","first_name":"Peter M."},{"last_name":"Robinson","id":"E5D42276-F5DA-11E9-8E24-6303E6697425","orcid":"0000-0001-8982-8813","first_name":"Matthew Richard","full_name":"Robinson, Matthew Richard"}],"type":"journal_article","status":"public","date_updated":"2021-01-12T08:15:03Z","publisher":"Springer Nature","title":"Improving genetic prediction by leveraging genetic correlations among human diseases and traits","doi":"10.1038/s41467-017-02769-6","publication_identifier":{"issn":["2041-1723"]},"quality_controlled":"1","article_number":"989","citation":{"mla":"Maier, Robert M., et al. “Improving Genetic Prediction by Leveraging Genetic Correlations among Human Diseases and Traits.” Nature Communications, vol. 9, 989, Springer Nature, 2018, doi:10.1038/s41467-017-02769-6.","ista":"Maier RM, Zhu Z, Lee SH, Trzaskowski M, Ruderfer DM, Stahl EA, Ripke S, Wray NR, Yang J, Visscher PM, Robinson MR. 2018. Improving genetic prediction by leveraging genetic correlations among human diseases and traits. Nature Communications. 9, 989.","ama":"Maier RM, Zhu Z, Lee SH, et al. Improving genetic prediction by leveraging genetic correlations among human diseases and traits. Nature Communications. 2018;9. doi:10.1038/s41467-017-02769-6","ieee":"R. M. Maier et al., “Improving genetic prediction by leveraging genetic correlations among human diseases and traits,” Nature Communications, vol. 9. Springer Nature, 2018.","apa":"Maier, R. M., Zhu, Z., Lee, S. H., Trzaskowski, M., Ruderfer, D. M., Stahl, E. A., … Robinson, M. R. (2018). Improving genetic prediction by leveraging genetic correlations among human diseases and traits. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-017-02769-6","chicago":"Maier, Robert M., Zhihong Zhu, Sang Hong Lee, Maciej Trzaskowski, Douglas M. Ruderfer, Eli A. Stahl, Stephan Ripke, et al. “Improving Genetic Prediction by Leveraging Genetic Correlations among Human Diseases and Traits.” Nature Communications. Springer Nature, 2018. https://doi.org/10.1038/s41467-017-02769-6.","short":"R.M. Maier, Z. Zhu, S.H. Lee, M. Trzaskowski, D.M. Ruderfer, E.A. Stahl, S. Ripke, N.R. Wray, J. Yang, P.M. Visscher, M.R. Robinson, Nature Communications 9 (2018)."},"year":"2018","_id":"7716","intvolume":" 9","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_type":"original","volume":9,"day":"07","abstract":[{"lang":"eng","text":"Genomic prediction has the potential to contribute to precision medicine. However, to date, the utility of such predictors is limited due to low accuracy for most traits. Here theory and simulation study are used to demonstrate that widespread pleiotropy among phenotypes can be utilised to improve genomic risk prediction. We show how a genetic predictor can be created as a weighted index that combines published genome-wide association study (GWAS) summary statistics across many different traits. We apply this framework to predict risk of schizophrenia and bipolar disorder in the Psychiatric Genomics consortium data, finding substantial heterogeneity in prediction accuracy increases across cohorts. For six additional phenotypes in the UK Biobank data, we find increases in prediction accuracy ranging from 0.7% for height to 47% for type 2 diabetes, when using a multi-trait predictor that combines published summary statistics from multiple traits, as compared to a predictor based only on one trait."}],"article_processing_charge":"No","main_file_link":[{"url":"https://doi.org/10.1038/s41467-017-02769-6","open_access":"1"}]},{"quality_controlled":"1","intvolume":" 10","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"Background: DNA methylation levels change along with age, but few studies have examined the variation in the rate of such changes between individuals.\r\nMethods: We performed a longitudinal analysis to quantify the variation in the rate of change of DNA methylation between individuals using whole blood DNA methylation array profiles collected at 2–4 time points (N = 2894) in 954 individuals (67–90 years).\r\nResults: After stringent quality control, we identified 1507 DNA methylation CpG sites (rsCpGs) with statistically significant variation in the rate of change (random slope) of DNA methylation among individuals in a mixed linear model analysis. Genes in the vicinity of these rsCpGs were found to be enriched in Homeobox transcription factors and the Wnt signalling pathway, both of which are related to ageing processes. Furthermore, we investigated the SNP effect on the random slope. We found that 4 out of 1507 rsCpGs had one significant (P < 5 × 10−8/1507) SNP effect and 343 rsCpGs had at least one SNP effect (436 SNP-probe pairs) reaching genome-wide significance (P < 5 × 10−8). Ninety-five percent of the significant (P < 5 × 10−8) SNPs are on different chromosomes from their corresponding probes.\r\nConclusions: We identified CpG sites that have variability in the rate of change of DNA methylation between individuals, and our results suggest a genetic basis of this variation. Genes around these CpG sites have been reported to be involved in the ageing process."}],"language":[{"iso":"eng"}],"publication":"Genome Medicine","date_created":"2020-04-30T10:42:50Z","date_published":"2018-10-22T00:00:00Z","publication_status":"published","publisher":"Springer Nature","title":"Genotype effects contribute to variation in longitudinal methylome patterns in older people","doi":"10.1186/s13073-018-0585-7","article_number":"75","citation":{"ama":"Zhang Q, Marioni RE, Robinson MR, et al. Genotype effects contribute to variation in longitudinal methylome patterns in older people. Genome Medicine. 2018;10(1). doi:10.1186/s13073-018-0585-7","ieee":"Q. Zhang et al., “Genotype effects contribute to variation in longitudinal methylome patterns in older people,” Genome Medicine, vol. 10, no. 1. Springer Nature, 2018.","short":"Q. Zhang, R.E. Marioni, M.R. Robinson, J. Higham, D. Sproul, N.R. Wray, I.J. Deary, A.F. McRae, P.M. Visscher, Genome Medicine 10 (2018).","chicago":"Zhang, Qian, Riccardo E Marioni, Matthew Richard Robinson, Jon Higham, Duncan Sproul, Naomi R Wray, Ian J Deary, Allan F McRae, and Peter M Visscher. “Genotype Effects Contribute to Variation in Longitudinal Methylome Patterns in Older People.” Genome Medicine. Springer Nature, 2018. https://doi.org/10.1186/s13073-018-0585-7.","apa":"Zhang, Q., Marioni, R. E., Robinson, M. R., Higham, J., Sproul, D., Wray, N. R., … Visscher, P. M. (2018). Genotype effects contribute to variation in longitudinal methylome patterns in older people. Genome Medicine. Springer Nature. https://doi.org/10.1186/s13073-018-0585-7","mla":"Zhang, Qian, et al. “Genotype Effects Contribute to Variation in Longitudinal Methylome Patterns in Older People.” Genome Medicine, vol. 10, no. 1, 75, Springer Nature, 2018, doi:10.1186/s13073-018-0585-7.","ista":"Zhang Q, Marioni RE, Robinson MR, Higham J, Sproul D, Wray NR, Deary IJ, McRae AF, Visscher PM. 2018. Genotype effects contribute to variation in longitudinal methylome patterns in older people. Genome Medicine. 10(1), 75."},"publication_identifier":{"issn":["1756-994X"]},"_id":"7717","year":"2018","article_type":"original","volume":10,"day":"22","article_processing_charge":"No","main_file_link":[{"url":"https://doi.org/10.1186/s13073-018-0585-7","open_access":"1"}],"oa":1,"month":"10","oa_version":"Published Version","issue":"1","extern":"1","author":[{"last_name":"Zhang","first_name":"Qian","full_name":"Zhang, Qian"},{"first_name":"Riccardo E","full_name":"Marioni, Riccardo E","last_name":"Marioni"},{"last_name":"Robinson","id":"E5D42276-F5DA-11E9-8E24-6303E6697425","orcid":"0000-0001-8982-8813","first_name":"Matthew Richard","full_name":"Robinson, Matthew Richard"},{"first_name":"Jon","full_name":"Higham, Jon","last_name":"Higham"},{"first_name":"Duncan","full_name":"Sproul, Duncan","last_name":"Sproul"},{"full_name":"Wray, Naomi R","first_name":"Naomi R","last_name":"Wray"},{"last_name":"Deary","first_name":"Ian J","full_name":"Deary, Ian J"},{"full_name":"McRae, Allan F","first_name":"Allan F","last_name":"McRae"},{"last_name":"Visscher","first_name":"Peter M","full_name":"Visscher, Peter M"}],"type":"journal_article","date_updated":"2021-01-12T08:15:04Z","status":"public"},{"title":"Embracing polygenicity: A review of methods and tools for psychiatric genetics research","page":"1055-1067","doi":"10.1017/s0033291717002318","publisher":"Cambridge University Press","publication_status":"published","date_created":"2020-04-30T10:44:35Z","language":[{"iso":"eng"}],"publication":"Psychological Medicine","date_published":"2018-05-01T00:00:00Z","abstract":[{"lang":"eng","text":"The availability of genome-wide genetic data on hundreds of thousands of people has led to an equally rapid growth in methodologies available to analyse these data. While the motivation for undertaking genome-wide association studies (GWAS) is identification of genetic markers associated with complex traits, once generated these data can be used for many other analyses. GWAS have demonstrated that complex traits exhibit a highly polygenic genetic architecture, often with shared genetic risk factors across traits. New methods to analyse data from GWAS are increasingly being used to address a diverse set of questions about the aetiology of complex traits and diseases, including psychiatric disorders. Here, we give an overview of some of these methods and present examples of how they have contributed to our understanding of psychiatric disorders. We consider: (i) estimation of the extent of genetic influence on traits, (ii) uncovering of shared genetic control between traits, (iii) predictions of genetic risk for individuals, (iv) uncovering of causal relationships between traits, (v) identifying causal single-nucleotide polymorphisms and genes or (vi) the detection of genetic heterogeneity. This classification helps organise the large number of recently developed methods, although some could be placed in more than one category. While some methods require GWAS data on individual people, others simply use GWAS summary statistics data, allowing novel well-powered analyses to be conducted at a low computational burden."}],"intvolume":" 48","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","type":"journal_article","date_updated":"2021-01-12T08:15:05Z","status":"public","issue":"7","extern":"1","author":[{"last_name":"Maier","full_name":"Maier, R. M.","first_name":"R. M."},{"last_name":"Visscher","full_name":"Visscher, P. M.","first_name":"P. M."},{"full_name":"Robinson, Matthew Richard","orcid":"0000-0001-8982-8813","first_name":"Matthew Richard","id":"E5D42276-F5DA-11E9-8E24-6303E6697425","last_name":"Robinson"},{"last_name":"Wray","first_name":"N. R.","full_name":"Wray, N. R."}],"oa":1,"month":"05","oa_version":"Published Version","day":"01","article_processing_charge":"No","main_file_link":[{"url":"https://doi.org/10.1017/s0033291717002318","open_access":"1"}],"volume":48,"year":"2018","_id":"7721","article_type":"original","citation":{"apa":"Maier, R. M., Visscher, P. M., Robinson, M. R., & Wray, N. R. (2018). Embracing polygenicity: A review of methods and tools for psychiatric genetics research. Psychological Medicine. Cambridge University Press. https://doi.org/10.1017/s0033291717002318","chicago":"Maier, R. M., P. M. Visscher, Matthew Richard Robinson, and N. R. Wray. “Embracing Polygenicity: A Review of Methods and Tools for Psychiatric Genetics Research.” Psychological Medicine. Cambridge University Press, 2018. https://doi.org/10.1017/s0033291717002318.","short":"R.M. Maier, P.M. Visscher, M.R. Robinson, N.R. Wray, Psychological Medicine 48 (2018) 1055–1067.","ama":"Maier RM, Visscher PM, Robinson MR, Wray NR. Embracing polygenicity: A review of methods and tools for psychiatric genetics research. Psychological Medicine. 2018;48(7):1055-1067. doi:10.1017/s0033291717002318","ieee":"R. M. Maier, P. M. Visscher, M. R. Robinson, and N. R. Wray, “Embracing polygenicity: A review of methods and tools for psychiatric genetics research,” Psychological Medicine, vol. 48, no. 7. Cambridge University Press, pp. 1055–1067, 2018.","ista":"Maier RM, Visscher PM, Robinson MR, Wray NR. 2018. Embracing polygenicity: A review of methods and tools for psychiatric genetics research. Psychological Medicine. 48(7), 1055–1067.","mla":"Maier, R. M., et al. “Embracing Polygenicity: A Review of Methods and Tools for Psychiatric Genetics Research.” Psychological Medicine, vol. 48, no. 7, Cambridge University Press, 2018, pp. 1055–67, doi:10.1017/s0033291717002318."},"publication_identifier":{"issn":["0033-2917","1469-8978"]}},{"author":[{"last_name":"Goodrich","id":"EB352CD2-F68A-11E9-89C5-A432E6697425","orcid":"0000-0002-1307-5074","first_name":"Carl Peter","full_name":"Goodrich, Carl Peter"},{"last_name":"Brenner","first_name":"Michael P.","full_name":"Brenner, Michael P."},{"first_name":"Katharina","full_name":"Ribbeck, Katharina","last_name":"Ribbeck"}],"publication_status":"published","extern":"1","date_published":"2018-10-19T00:00:00Z","oa":1,"language":[{"iso":"eng"}],"date_created":"2020-04-30T11:38:01Z","publication":"Nature Communications","month":"10","oa_version":"Published Version","doi":"10.1038/s41467-018-06851-5","title":"Enhanced diffusion by binding to the crosslinks of a polymer gel","publisher":"Springer Nature","date_updated":"2021-01-12T08:15:18Z","status":"public","type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_type":"original","intvolume":" 9","year":"2018","_id":"7754","article_number":"4348","citation":{"ama":"Goodrich CP, Brenner MP, Ribbeck K. Enhanced diffusion by binding to the crosslinks of a polymer gel. Nature Communications. 2018;9. doi:10.1038/s41467-018-06851-5","ieee":"C. P. Goodrich, M. P. Brenner, and K. Ribbeck, “Enhanced diffusion by binding to the crosslinks of a polymer gel,” Nature Communications, vol. 9. Springer Nature, 2018.","chicago":"Goodrich, Carl Peter, Michael P. Brenner, and Katharina Ribbeck. “Enhanced Diffusion by Binding to the Crosslinks of a Polymer Gel.” Nature Communications. Springer Nature, 2018. https://doi.org/10.1038/s41467-018-06851-5.","short":"C.P. Goodrich, M.P. Brenner, K. Ribbeck, Nature Communications 9 (2018).","apa":"Goodrich, C. P., Brenner, M. P., & Ribbeck, K. (2018). Enhanced diffusion by binding to the crosslinks of a polymer gel. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-018-06851-5","mla":"Goodrich, Carl Peter, et al. “Enhanced Diffusion by Binding to the Crosslinks of a Polymer Gel.” Nature Communications, vol. 9, 4348, Springer Nature, 2018, doi:10.1038/s41467-018-06851-5.","ista":"Goodrich CP, Brenner MP, Ribbeck K. 2018. Enhanced diffusion by binding to the crosslinks of a polymer gel. Nature Communications. 9, 4348."},"publication_identifier":{"issn":["2041-1723"]},"quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1038/s41467-018-06851-5"}],"article_processing_charge":"No","abstract":[{"lang":"eng","text":"Creating a selective gel that filters particles based on their interactions is a major goal of nanotechnology, with far-reaching implications from drug delivery to controlling assembly pathways. However, this is particularly difficult when the particles are larger than the gel’s characteristic mesh size because such particles cannot passively pass through the gel. Thus, filtering requires the interacting particles to transiently reorganize the gel’s internal structure. While significant advances, e.g., in DNA engineering, have enabled the design of nano-materials with programmable interactions, it is not clear what physical principles such a designer gel could exploit to achieve selective permeability. We present an equilibrium mechanism where crosslink binding dynamics are affected by interacting particles such that particle diffusion is enhanced. In addition to revealing specific design rules for manufacturing selective gels, our results have the potential to explain the origin of selective permeability in certain biological materials, including the nuclear pore complex."}],"day":"19","volume":9},{"page":"49","title":"Extensive mitochondrial population structure and haplotype-specific phenotypic variation in the Drosophila Genetic Reference Panel","status":"public","publisher":"Cold Spring Harbor Laboratory","date_updated":"2021-01-12T08:15:30Z","type":"preprint","author":[{"full_name":"Bevers, Roel P.J.","first_name":"Roel P.J.","last_name":"Bevers"},{"last_name":"Litovchenko","full_name":"Litovchenko, Maria","first_name":"Maria"},{"full_name":"Kapopoulou, Adamandia","first_name":"Adamandia","last_name":"Kapopoulou"},{"last_name":"Braman","full_name":"Braman, Virginie S.","first_name":"Virginie S."},{"id":"E5D42276-F5DA-11E9-8E24-6303E6697425","last_name":"Robinson","full_name":"Robinson, Matthew Richard","first_name":"Matthew Richard","orcid":"0000-0001-8982-8813"},{"last_name":"Auwerx","full_name":"Auwerx, Johan","first_name":"Johan"},{"last_name":"Hollis","first_name":"Brian","full_name":"Hollis, Brian"},{"first_name":"Bart","full_name":"Deplancke, Bart","last_name":"Deplancke"}],"extern":"1","publication_status":"published","date_published":"2018-11-09T00:00:00Z","oa_version":"Preprint","publication":"bioRxiv","language":[{"iso":"eng"}],"month":"11","oa":1,"date_created":"2020-04-30T13:09:37Z","article_processing_charge":"No","main_file_link":[{"url":"https://doi.org/10.1101/466771 ","open_access":"1"}],"day":"09","abstract":[{"lang":"eng","text":"The Drosophila Genetic Reference Panel (DGRP) serves as a valuable resource to better understand the genetic landscapes underlying quantitative traits. However, such DGRP studies have so far only focused on nuclear genetic variants. To address this, we sequenced the mitochondrial genomes of >170 DGRP lines, identifying 229 variants including 21 indels and 7 frameshifts. We used our mitochondrial variation data to identify 12 genetically distinct mitochondrial haplotypes, thus revealing important population structure at the mitochondrial level. We further examined whether this population structure was reflected on the nuclear genome by screening for the presence of potential mito-nuclear genetic incompatibilities in the form of significant genotype ratio distortions (GRDs) between mitochondrial and nuclear variants. In total, we detected a remarkable 1,845 mito-nuclear GRDs, with the highest enrichment observed in a 40 kb region around the gene Sex-lethal (Sxl). Intriguingly, downstream phenotypic analyses did not uncover major fitness effects associated with these GRDs, suggesting that a large number of mito-nuclear GRDs may reflect population structure at the mitochondrial level rather than actual genomic incompatibilities. This is further supported by the GRD landscape showing particular large genomic regions associated with a single mitochondrial haplotype. Next, we explored the functional relevance of the detected mitochondrial haplotypes through an association analysis on a set of 259 assembled, non-correlating DGRP phenotypes. We found multiple significant associations with stress- and metabolism-related phenotypes, including food intake in males. We validated the latter observation by reciprocal swapping of mitochondrial genomes from high food intake DGRP lines to low food intake ones. In conclusion, our study uncovered important mitochondrial population structure and haplotype-specific metabolic variation in the DGRP, thus demonstrating the significance of incorporating mitochondrial haplotypes in geno-phenotype relationship studies."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2018","_id":"7783","citation":{"ama":"Bevers RPJ, Litovchenko M, Kapopoulou A, et al. Extensive mitochondrial population structure and haplotype-specific phenotypic variation in the Drosophila Genetic Reference Panel. bioRxiv. 2018.","ieee":"R. P. J. Bevers et al., “Extensive mitochondrial population structure and haplotype-specific phenotypic variation in the Drosophila Genetic Reference Panel,” bioRxiv. Cold Spring Harbor Laboratory, 2018.","short":"R.P.J. Bevers, M. Litovchenko, A. Kapopoulou, V.S. Braman, M.R. Robinson, J. Auwerx, B. Hollis, B. Deplancke, BioRxiv (2018).","chicago":"Bevers, Roel P.J., Maria Litovchenko, Adamandia Kapopoulou, Virginie S. Braman, Matthew Richard Robinson, Johan Auwerx, Brian Hollis, and Bart Deplancke. “Extensive Mitochondrial Population Structure and Haplotype-Specific Phenotypic Variation in the Drosophila Genetic Reference Panel.” BioRxiv. Cold Spring Harbor Laboratory, 2018.","apa":"Bevers, R. P. J., Litovchenko, M., Kapopoulou, A., Braman, V. S., Robinson, M. R., Auwerx, J., … Deplancke, B. (2018). Extensive mitochondrial population structure and haplotype-specific phenotypic variation in the Drosophila Genetic Reference Panel. bioRxiv. Cold Spring Harbor Laboratory.","mla":"Bevers, Roel P. J., et al. “Extensive Mitochondrial Population Structure and Haplotype-Specific Phenotypic Variation in the Drosophila Genetic Reference Panel.” BioRxiv, Cold Spring Harbor Laboratory, 2018.","ista":"Bevers RPJ, Litovchenko M, Kapopoulou A, Braman VS, Robinson MR, Auwerx J, Hollis B, Deplancke B. 2018. Extensive mitochondrial population structure and haplotype-specific phenotypic variation in the Drosophila Genetic Reference Panel. bioRxiv, ."}},{"publisher":"Springer","publist_id":"7976","page":"215 - 232","doi":"10.1007/978-3-030-00151-3_13","title":"Online timed pattern matching using automata","file_date_updated":"2020-07-14T12:48:03Z","date_published":"2018-08-26T00:00:00Z","date_created":"2018-12-11T11:44:31Z","language":[{"iso":"eng"}],"has_accepted_license":"1","isi":1,"scopus_import":"1","publication_status":"published","abstract":[{"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.","lang":"eng"}],"file":[{"file_name":"2018_LNCS_Bakhirkin.pdf","relation":"main_file","file_size":374851,"file_id":"7831","access_level":"open_access","checksum":"436b7574934324cfa7d1d3986fddc65b","creator":"dernst","date_updated":"2020-07-14T12:48:03Z","date_created":"2020-05-14T11:34:34Z","content_type":"application/pdf"}],"quality_controlled":"1","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","intvolume":" 11022","status":"public","date_updated":"2023-09-13T09:35:46Z","type":"conference","department":[{"_id":"ToHe"}],"external_id":{"isi":["000884993200013"]},"oa_version":"Submitted Version","month":"08","oa":1,"author":[{"full_name":"Bakhirkin, Alexey","first_name":"Alexey","last_name":"Bakhirkin"},{"orcid":"0000-0001-5199-3143","first_name":"Thomas","full_name":"Ferrere, Thomas","last_name":"Ferrere","id":"40960E6E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Nickovic","first_name":"Dejan","full_name":"Nickovic, Dejan"},{"full_name":"Maler, Oded","first_name":"Oded","last_name":"Maler"},{"last_name":"Asarin","full_name":"Asarin, Eugene","first_name":"Eugene"}],"ddc":["000"],"conference":{"start_date":"2018-09-04","location":"Bejing, China","end_date":"2018-09-06","name":"FORMATS: Formal Modeling and Analysis of Timed Systems"},"project":[{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"call_identifier":"FWF","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211"}],"alternative_title":["LNCS"],"volume":11022,"article_processing_charge":"No","day":"26","publication_identifier":{"isbn":["978-3-030-00150-6"]},"citation":{"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.","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","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.","short":"A. Bakhirkin, T. Ferrere, D. Nickovic, O. Maler, E. Asarin, in:, Springer, 2018, pp. 215–232.","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.","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."},"year":"2018","_id":"78"},{"external_id":{"arxiv":["1802.05668"]},"file_date_updated":"2020-07-14T12:48:03Z","title":"Model compression via distillation and quantization","arxiv":1,"department":[{"_id":"DaAl"}],"type":"conference","date_updated":"2023-02-23T13:18:41Z","status":"public","scopus_import":1,"publication_status":"published","ddc":["000"],"has_accepted_license":"1","author":[{"last_name":"Polino","first_name":"Antonio","full_name":"Polino, Antonio"},{"last_name":"Pascanu","full_name":"Pascanu, Razvan","first_name":"Razvan"},{"last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian"}],"oa":1,"language":[{"iso":"eng"}],"publication":"6th International Conference on Learning Representations","date_created":"2020-05-10T22:00:51Z","month":"05","oa_version":"Published Version","date_published":"2018-05-01T00:00:00Z","file":[{"date_updated":"2020-07-14T12:48:03Z","creator":"dernst","checksum":"a4336c167978e81891970e4e4517a8c3","access_level":"open_access","relation":"main_file","file_id":"7894","file_size":308339,"file_name":"2018_ICLR_Polino.pdf","date_created":"2020-05-26T13:02:00Z","content_type":"application/pdf"}],"day":"01","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"}],"article_processing_charge":"No","conference":{"name":"ICLR: International Conference on Learning Representations","location":"Vancouver, Canada","end_date":"2018-05-03","start_date":"2018-04-30"},"_id":"7812","year":"2018","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Polino A, Pascanu R, Alistarh D-A. Model compression via distillation and quantization. In: 6th International Conference on Learning Representations. ; 2018.","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.","chicago":"Polino, Antonio, Razvan Pascanu, and Dan-Adrian Alistarh. “Model Compression via Distillation and Quantization.” In 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.","mla":"Polino, Antonio, et al. “Model Compression via Distillation and Quantization.” 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."},"quality_controlled":"1"},{"day":"15","main_file_link":[{"url":"https://arxiv.org/abs/1806.05126","open_access":"1"}],"article_processing_charge":"No","conference":{"start_date":"2018-09-04","location":"Beijing, China","end_date":"2018-09-07","name":"QEST: Quantitative Evaluation of Systems"},"volume":11024,"alternative_title":["LNCS"],"_id":"79","year":"2018","citation":{"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.","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.","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.","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","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","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.","short":"S. Arming, E. Bartocci, K. Chatterjee, J.P. Katoen, A. Sokolova, in:, Springer, 2018, pp. 53–70."},"external_id":{"arxiv":["1806.05126"],"isi":["000548912200004"]},"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"type":"conference","date_updated":"2023-09-13T09:38:28Z","status":"public","author":[{"last_name":"Arming","first_name":"Sebastian","full_name":"Arming, Sebastian"},{"first_name":"Ezio","full_name":"Bartocci, Ezio","last_name":"Bartocci"},{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"first_name":"Joost P","full_name":"Katoen, Joost P","last_name":"Katoen","id":"4524F760-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Sokolova","full_name":"Sokolova, Ana","first_name":"Ana"}],"month":"08","oa":1,"oa_version":"Preprint","abstract":[{"lang":"eng","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."}],"intvolume":" 11024","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","quality_controlled":"1","title":"Parameter-independent strategies for pMDPs via POMDPs","page":"53-70","doi":"10.1007/978-3-319-99154-2_4","arxiv":1,"publisher":"Springer","publist_id":"7975","publication_status":"published","scopus_import":"1","isi":1,"language":[{"iso":"eng"}],"date_created":"2018-12-11T11:44:31Z","date_published":"2018-08-15T00:00:00Z"},{"citation":{"mla":"Mahne, Nika, et al. “Elektrochemische Oxidation von Lithiumcarbonat Generiert Singulett-Sauerstoff.” Angewandte Chemie, vol. 130, no. 19, Wiley, 2018, pp. 5627–31, doi:10.1002/ange.201802277.","ista":"Mahne N, Renfrew SE, McCloskey BD, Freunberger SA. 2018. Elektrochemische Oxidation von Lithiumcarbonat generiert Singulett-Sauerstoff. Angewandte Chemie. 130(19), 5627–5631.","ieee":"N. Mahne, S. E. Renfrew, B. D. McCloskey, and S. A. Freunberger, “Elektrochemische Oxidation von Lithiumcarbonat generiert Singulett-Sauerstoff,” Angewandte Chemie, vol. 130, no. 19. Wiley, pp. 5627–5631, 2018.","ama":"Mahne N, Renfrew SE, McCloskey BD, Freunberger SA. Elektrochemische Oxidation von Lithiumcarbonat generiert Singulett-Sauerstoff. Angewandte Chemie. 2018;130(19):5627-5631. doi:10.1002/ange.201802277","chicago":"Mahne, Nika, Sara E. Renfrew, Bryan D. McCloskey, and Stefan Alexander Freunberger. “Elektrochemische Oxidation von Lithiumcarbonat Generiert Singulett-Sauerstoff.” Angewandte Chemie. Wiley, 2018. https://doi.org/10.1002/ange.201802277.","short":"N. Mahne, S.E. Renfrew, B.D. McCloskey, S.A. Freunberger, Angewandte Chemie 130 (2018) 5627–5631.","apa":"Mahne, N., Renfrew, S. E., McCloskey, B. D., & Freunberger, S. A. (2018). Elektrochemische Oxidation von Lithiumcarbonat generiert Singulett-Sauerstoff. Angewandte Chemie. Wiley. https://doi.org/10.1002/ange.201802277"},"publication_identifier":{"issn":["0044-8249"]},"article_type":"original","year":"2018","_id":"7983","volume":130,"article_processing_charge":"No","day":"04","oa":1,"month":"05","oa_version":"Published Version","ddc":["540"],"author":[{"last_name":"Mahne","first_name":"Nika","full_name":"Mahne, Nika"},{"first_name":"Sara E.","full_name":"Renfrew, Sara E.","last_name":"Renfrew"},{"last_name":"McCloskey","first_name":"Bryan D.","full_name":"McCloskey, Bryan D."},{"orcid":"0000-0003-2902-5319","first_name":"Stefan Alexander","full_name":"Freunberger, Stefan Alexander","last_name":"Freunberger","id":"A8CA28E6-CE23-11E9-AD2D-EC27E6697425"}],"issue":"19","extern":"1","date_updated":"2021-01-12T08:16:21Z","status":"public","type":"journal_article","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 130","tmp":{"short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode"},"file":[{"file_size":674789,"relation":"main_file","file_id":"7988","file_name":"2018_AngChemieDT_Mahne.pdf","access_level":"open_access","checksum":"81506e0f7079e1e3591f3cd9f626bf67","creator":"dernst","date_updated":"2020-07-14T12:48:06Z","content_type":"application/pdf","date_created":"2020-06-19T11:58:06Z"}],"abstract":[{"text":"Feste Alkalicarbonate sind universelle Bestandteile von Passivierungsschichten an Materialien für Interkalationsbatterien, übliche Nebenprodukte in Metall‐O2‐Batterien, und es wird angenommen, dass sie sich reversibel in Metall‐O2 /CO2‐Zellen bilden und zersetzen. In all diesen Kathoden zersetzt sich Li2CO3 zu CO2, sobald es Spannungen >3.8 V vs. Li/Li+ ausgesetzt wird. Beachtenswert ist, dass keine O2‐Entwicklung detektiert wird, wie gemäß der Zersetzungsreaktion 2 Li2CO3 → 4 Li+ + 4 e− + 2 CO2 + O2 zu erwarten wäre. Deswegen war der Verbleib eines der O‐Atome ungeklärt und wurde nicht identifizierten parasitären Reaktionen zugerechnet. Hier zeigen wir, dass hochreaktiver Singulett‐Sauerstoff (1O2) bei der Oxidation von Li2CO3 in einem aprotischen Elektrolyten gebildet und daher nicht als O2 freigesetzt wird. Diese Ergebnisse haben weitreichende Auswirkungen auf die langfristige Zyklisierbarkeit von Batterien: sie untermauern die Wichtigkeit, 1O2 in Metall‐O2‐Batterien zu verhindern, stellen die Möglichkeit einer reversiblen Metall‐O2 /CO2‐Batterie basierend auf einem Carbonat‐Entladeprodukt in Frage und helfen, Grenzflächenreaktivität von Übergangsmetallkathoden mit Li2CO3‐Resten zu erklären.","lang":"ger"}],"date_published":"2018-05-04T00:00:00Z","language":[{"iso":"eng"}],"publication":"Angewandte Chemie","date_created":"2020-06-19T08:33:24Z","has_accepted_license":"1","publication_status":"published","publisher":"Wiley","page":"5627-5631","doi":"10.1002/ange.201802277","title":"Elektrochemische Oxidation von Lithiumcarbonat generiert Singulett-Sauerstoff","file_date_updated":"2020-07-14T12:48:06Z"}]