[{"scopus_import":"1","article_processing_charge":"No","day":"23","citation":{"ama":"Aksenov V, Alistarh D-A, Kuznetsov P. Brief Announcement: Performance prediction for coarse-grained locking. In: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18. ACM Press; 2018:411-413. doi:10.1145/3212734.3212785","ista":"Aksenov V, Alistarh D-A, Kuznetsov P. 2018. Brief Announcement: Performance prediction for coarse-grained locking. Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18. PODC: Principles of Distributed Computing, 411–413.","apa":"Aksenov, V., Alistarh, D.-A., & Kuznetsov, P. (2018). Brief Announcement: Performance prediction for coarse-grained locking. In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18 (pp. 411–413). Egham, United Kingdom: ACM Press. https://doi.org/10.1145/3212734.3212785","ieee":"V. Aksenov, D.-A. Alistarh, and P. Kuznetsov, “Brief Announcement: Performance prediction for coarse-grained locking,” in Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, Egham, United Kingdom, 2018, pp. 411–413.","mla":"Aksenov, Vitaly, et al. “Brief Announcement: Performance Prediction for Coarse-Grained Locking.” Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, ACM Press, 2018, pp. 411–13, doi:10.1145/3212734.3212785.","short":"V. Aksenov, D.-A. Alistarh, P. Kuznetsov, in:, Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, ACM Press, 2018, pp. 411–413.","chicago":"Aksenov, Vitaly, Dan-Adrian Alistarh, and Petr Kuznetsov. “Brief Announcement: Performance Prediction for Coarse-Grained Locking.” In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, 411–13. ACM Press, 2018. https://doi.org/10.1145/3212734.3212785."},"publication":"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC '18","page":"411-413","date_published":"2018-07-23T00:00:00Z","type":"conference","abstract":[{"lang":"eng","text":"A standard design pattern found in many concurrent data structures, such as hash tables or ordered containers, is an alternation of parallelizable sections that incur no data conflicts and critical sections that must run sequentially and are protected with locks. A lock can be viewed as a queue that arbitrates the order in which the critical sections are executed, and a natural question is whether we can use stochastic analysis to predict the resulting throughput. As a preliminary evidence to the affirmative, we describe a simple model that can be used to predict the throughput of coarse-grained lock-based algorithms. We show that our model works well for CLH lock, and we expect it to work for other popular lock designs such as TTAS, MCS, etc."}],"_id":"5964","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","title":"Brief Announcement: Performance prediction for coarse-grained locking","status":"public","oa_version":"Submitted Version","publication_identifier":{"isbn":["9781450357951"]},"month":"07","oa":1,"main_file_link":[{"open_access":"1","url":"https://hal-univ-lyon3.archives-ouvertes.fr/INRIA/hal-01887733v1"}],"external_id":{"isi":["000458186900052"]},"quality_controlled":"1","isi":1,"doi":"10.1145/3212734.3212785","conference":{"end_date":"2018-07-27","start_date":"2018-07-23","location":"Egham, United Kingdom","name":"PODC: Principles of Distributed Computing"},"language":[{"iso":"eng"}],"year":"2018","department":[{"_id":"DaAl"}],"publisher":"ACM Press","publication_status":"published","author":[{"full_name":"Aksenov, Vitaly","last_name":"Aksenov","first_name":"Vitaly"},{"orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian"},{"first_name":"Petr","last_name":"Kuznetsov","full_name":"Kuznetsov, Petr"}],"date_created":"2019-02-13T10:08:19Z","date_updated":"2023-09-19T10:43:45Z"},{"publication_identifier":{"eissn":["2010-3271"],"issn":["2010-3263"]},"month":"09","doi":"10.1142/s2010326319500096","language":[{"iso":"eng"}],"oa":1,"external_id":{"arxiv":["1802.05175"],"isi":["000477677200002"]},"main_file_link":[{"url":"https://arxiv.org/abs/1802.05175","open_access":"1"}],"project":[{"grant_number":"338804","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","name":"Random matrices, universality and disordered quantum systems","call_identifier":"FP7"}],"isi":1,"quality_controlled":"1","ec_funded":1,"article_number":"1950009","author":[{"full_name":"Erdös, László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5366-9603","first_name":"László","last_name":"Erdös"},{"full_name":"Mühlbacher, Peter","first_name":"Peter","last_name":"Mühlbacher"}],"date_created":"2019-02-13T10:40:54Z","date_updated":"2023-09-19T14:24:05Z","year":"2018","publisher":"World Scientific Publishing","department":[{"_id":"LaEr"}],"publication_status":"published","article_processing_charge":"No","day":"26","scopus_import":"1","date_published":"2018-09-26T00:00:00Z","citation":{"chicago":"Erdös, László, and Peter Mühlbacher. “Bounds on the Norm of Wigner-Type Random Matrices.” Random Matrices: Theory and Applications. World Scientific Publishing, 2018. https://doi.org/10.1142/s2010326319500096.","mla":"Erdös, László, and Peter Mühlbacher. “Bounds on the Norm of Wigner-Type Random Matrices.” Random Matrices: Theory and Applications, 1950009, World Scientific Publishing, 2018, doi:10.1142/s2010326319500096.","short":"L. Erdös, P. Mühlbacher, Random Matrices: Theory and Applications (2018).","ista":"Erdös L, Mühlbacher P. 2018. Bounds on the norm of Wigner-type random matrices. Random matrices: Theory and applications., 1950009.","ieee":"L. Erdös and P. Mühlbacher, “Bounds on the norm of Wigner-type random matrices,” Random matrices: Theory and applications. World Scientific Publishing, 2018.","apa":"Erdös, L., & Mühlbacher, P. (2018). Bounds on the norm of Wigner-type random matrices. Random Matrices: Theory and Applications. World Scientific Publishing. https://doi.org/10.1142/s2010326319500096","ama":"Erdös L, Mühlbacher P. Bounds on the norm of Wigner-type random matrices. Random matrices: Theory and applications. 2018. doi:10.1142/s2010326319500096"},"publication":"Random matrices: Theory and applications","abstract":[{"lang":"eng","text":"We consider a Wigner-type ensemble, i.e. large hermitian N×N random matrices H=H∗ with centered independent entries and with a general matrix of variances Sxy=𝔼∣∣Hxy∣∣2. The norm of H is asymptotically given by the maximum of the support of the self-consistent density of states. We establish a bound on this maximum in terms of norms of powers of S that substantially improves the earlier bound 2∥S∥1/2∞ given in [O. Ajanki, L. Erdős and T. Krüger, Universality for general Wigner-type matrices, Prob. Theor. Rel. Fields169 (2017) 667–727]. The key element of the proof is an effective Markov chain approximation for the contributions of the weighted Dyck paths appearing in the iterative solution of the corresponding Dyson equation."}],"type":"journal_article","oa_version":"Preprint","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"5971","status":"public","title":"Bounds on the norm of Wigner-type random matrices"},{"scopus_import":"1","day":"01","article_processing_charge":"No","has_accepted_license":"1","publication":"Nature Communications","citation":{"chicago":"Morri, Maurizio, Inmaculada Sanchez-Romero, Alexandra-Madelaine Tichy, Stephanie Kainrath, Elliot J. Gerrard, Priscila Hirschfeld, Jan Schwarz, and Harald L Janovjak. “Optical Functionalization of Human Class A Orphan G-Protein-Coupled Receptors.” Nature Communications. Springer Nature, 2018. https://doi.org/10.1038/s41467-018-04342-1.","mla":"Morri, Maurizio, et al. “Optical Functionalization of Human Class A Orphan G-Protein-Coupled Receptors.” Nature Communications, vol. 9, no. 1, 1950, Springer Nature, 2018, doi:10.1038/s41467-018-04342-1.","short":"M. Morri, I. Sanchez-Romero, A.-M. Tichy, S. Kainrath, E.J. Gerrard, P. Hirschfeld, J. Schwarz, H.L. Janovjak, Nature Communications 9 (2018).","ista":"Morri M, Sanchez-Romero I, Tichy A-M, Kainrath S, Gerrard EJ, Hirschfeld P, Schwarz J, Janovjak HL. 2018. Optical functionalization of human class A orphan G-protein-coupled receptors. Nature Communications. 9(1), 1950.","apa":"Morri, M., Sanchez-Romero, I., Tichy, A.-M., Kainrath, S., Gerrard, E. J., Hirschfeld, P., … Janovjak, H. L. (2018). Optical functionalization of human class A orphan G-protein-coupled receptors. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-018-04342-1","ieee":"M. Morri et al., “Optical functionalization of human class A orphan G-protein-coupled receptors,” Nature Communications, vol. 9, no. 1. Springer Nature, 2018.","ama":"Morri M, Sanchez-Romero I, Tichy A-M, et al. Optical functionalization of human class A orphan G-protein-coupled receptors. Nature Communications. 2018;9(1). doi:10.1038/s41467-018-04342-1"},"date_published":"2018-12-01T00:00:00Z","type":"journal_article","abstract":[{"text":"G-protein-coupled receptors (GPCRs) form the largest receptor family, relay environmental stimuli to changes in cell behavior and represent prime drug targets. Many GPCRs are classified as orphan receptors because of the limited knowledge on their ligands and coupling to cellular signaling machineries. Here, we engineer a library of 63 chimeric receptors that contain the signaling domains of human orphan and understudied GPCRs functionally linked to the light-sensing domain of rhodopsin. Upon stimulation with visible light, we identify activation of canonical cell signaling pathways, including cAMP-, Ca2+-, MAPK/ERK-, and Rho-dependent pathways, downstream of the engineered receptors. For the human pseudogene GPR33, we resurrect a signaling function that supports its hypothesized role as a pathogen entry site. These results demonstrate that substituting unknown chemical activators with a light switch can reveal information about protein function and provide an optically controlled protein library for exploring the physiology and therapeutic potential of understudied GPCRs.","lang":"eng"}],"issue":"1","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"5984","title":"Optical functionalization of human class A orphan G-protein-coupled receptors","ddc":["570"],"status":"public","intvolume":" 9","oa_version":"Published Version","file":[{"file_id":"5985","relation":"main_file","checksum":"8325fcc194264af4749e662a73bf66b5","date_created":"2019-02-14T10:58:29Z","date_updated":"2020-07-14T12:47:14Z","access_level":"open_access","file_name":"2018_Springer_Morri.pdf","creator":"kschuh","file_size":1349914,"content_type":"application/pdf"}],"month":"12","publication_identifier":{"issn":["2041-1723"]},"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"isi":["000432280000006"]},"isi":1,"quality_controlled":"1","project":[{"name":"Microbial Ion Channels for Synthetic Neurobiology","call_identifier":"FP7","_id":"25548C20-B435-11E9-9278-68D0E5697425","grant_number":"303564"},{"name":"Molecular Drug Targets","call_identifier":"FWF","grant_number":"W1232-B24","_id":"255A6082-B435-11E9-9278-68D0E5697425"}],"doi":"10.1038/s41467-018-04342-1","language":[{"iso":"eng"}],"article_number":"1950","file_date_updated":"2020-07-14T12:47:14Z","ec_funded":1,"year":"2018","publication_status":"published","publisher":"Springer Nature","department":[{"_id":"HaJa"},{"_id":"CaGu"},{"_id":"MiSi"}],"author":[{"full_name":"Morri, Maurizio","last_name":"Morri","first_name":"Maurizio","id":"4863116E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Sanchez-Romero","first_name":"Inmaculada","id":"3D9C5D30-F248-11E8-B48F-1D18A9856A87","full_name":"Sanchez-Romero, Inmaculada"},{"full_name":"Tichy, Alexandra-Madelaine","id":"29D8BB2C-F248-11E8-B48F-1D18A9856A87","first_name":"Alexandra-Madelaine","last_name":"Tichy"},{"full_name":"Kainrath, Stephanie","first_name":"Stephanie","last_name":"Kainrath","id":"32CFBA64-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Elliot J.","last_name":"Gerrard","full_name":"Gerrard, Elliot J."},{"full_name":"Hirschfeld, Priscila","first_name":"Priscila","last_name":"Hirschfeld","id":"435ACB3A-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Schwarz, Jan","last_name":"Schwarz","first_name":"Jan","id":"346C1EC6-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Janovjak","first_name":"Harald L","orcid":"0000-0002-8023-9315","id":"33BA6C30-F248-11E8-B48F-1D18A9856A87","full_name":"Janovjak, Harald L"}],"date_updated":"2023-09-19T14:29:32Z","date_created":"2019-02-14T10:50:24Z","volume":9},{"month":"11","publication_identifier":{"issn":["0730-0301"]},"doi":"10.1145/3272127.3275076","language":[{"iso":"eng"}],"oa":1,"external_id":{"isi":["000455953100064"]},"isi":1,"quality_controlled":"1","project":[{"_id":"24F9549A-B435-11E9-9278-68D0E5697425","grant_number":"715767","call_identifier":"H2020","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling"},{"_id":"25082902-B435-11E9-9278-68D0E5697425","grant_number":"645599","call_identifier":"H2020","name":"Soft-bodied intelligence for Manipulation"},{"call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"file_date_updated":"2020-07-14T12:47:14Z","ec_funded":1,"article_number":"241","author":[{"last_name":"Malomo","first_name":"Luigi","full_name":"Malomo, Luigi"},{"first_name":"Jesus","last_name":"Perez Rodriguez","id":"2DC83906-F248-11E8-B48F-1D18A9856A87","full_name":"Perez Rodriguez, Jesus"},{"full_name":"Iarussi, Emmanuel","first_name":"Emmanuel","last_name":"Iarussi","id":"33F19F16-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Pietroni, Nico","first_name":"Nico","last_name":"Pietroni"},{"first_name":"Eder","last_name":"Miguel","full_name":"Miguel, Eder"},{"first_name":"Paolo","last_name":"Cignoni","full_name":"Cignoni, Paolo"},{"first_name":"Bernd","last_name":"Bickel","id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385","full_name":"Bickel, Bernd"}],"date_created":"2019-02-13T13:12:53Z","date_updated":"2023-09-19T14:25:30Z","volume":37,"year":"2018","publication_status":"published","publisher":"Association for Computing Machinery (ACM)","department":[{"_id":"BeBi"}],"day":"01","has_accepted_license":"1","article_processing_charge":"No","scopus_import":"1","date_published":"2018-11-01T00:00:00Z","publication":"ACM Transactions on Graphics","citation":{"chicago":"Malomo, Luigi, Jesus Perez Rodriguez, Emmanuel Iarussi, Nico Pietroni, Eder Miguel, Paolo Cignoni, and Bernd Bickel. “FlexMaps: Computational Design of Flat Flexible Shells for Shaping 3D Objects.” ACM Transactions on Graphics. Association for Computing Machinery (ACM), 2018. https://doi.org/10.1145/3272127.3275076.","short":"L. Malomo, J. Perez Rodriguez, E. Iarussi, N. Pietroni, E. Miguel, P. Cignoni, B. Bickel, ACM Transactions on Graphics 37 (2018).","mla":"Malomo, Luigi, et al. “FlexMaps: Computational Design of Flat Flexible Shells for Shaping 3D Objects.” ACM Transactions on Graphics, vol. 37, no. 6, 241, Association for Computing Machinery (ACM), 2018, doi:10.1145/3272127.3275076.","ieee":"L. Malomo et al., “FlexMaps: Computational design of flat flexible shells for shaping 3D objects,” ACM Transactions on Graphics, vol. 37, no. 6. Association for Computing Machinery (ACM), 2018.","apa":"Malomo, L., Perez Rodriguez, J., Iarussi, E., Pietroni, N., Miguel, E., Cignoni, P., & Bickel, B. (2018). FlexMaps: Computational design of flat flexible shells for shaping 3D objects. ACM Transactions on Graphics. Association for Computing Machinery (ACM). https://doi.org/10.1145/3272127.3275076","ista":"Malomo L, Perez Rodriguez J, Iarussi E, Pietroni N, Miguel E, Cignoni P, Bickel B. 2018. FlexMaps: Computational design of flat flexible shells for shaping 3D objects. ACM Transactions on Graphics. 37(6), 241.","ama":"Malomo L, Perez Rodriguez J, Iarussi E, et al. FlexMaps: Computational design of flat flexible shells for shaping 3D objects. ACM Transactions on Graphics. 2018;37(6). doi:10.1145/3272127.3275076"},"article_type":"original","abstract":[{"lang":"eng","text":"We propose FlexMaps, a novel framework for fabricating smooth shapes out of flat, flexible panels with tailored mechanical properties. We start by mapping the 3D surface onto a 2D domain as in traditional UV mapping to design a set of deformable flat panels called FlexMaps. For these panels, we design and obtain specific mechanical properties such that, once they are assembled, the static equilibrium configuration matches the desired 3D shape. FlexMaps can be fabricated from an almost rigid material, such as wood or plastic, and are made flexible in a controlled way by using computationally designed spiraling microstructures."}],"issue":"6","type":"journal_article","pubrep_id":"1068","oa_version":"Published Version","file":[{"access_level":"open_access","file_name":"flexmaps_author_version.pdf","creator":"bbickel","content_type":"application/pdf","file_size":100109811,"file_id":"6901","relation":"main_file","checksum":"d0529a41c78b37ab8840685579fb33b4","date_created":"2019-09-23T12:48:52Z","date_updated":"2020-07-14T12:47:14Z"}],"_id":"5976","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","status":"public","title":"FlexMaps: Computational design of flat flexible shells for shaping 3D objects","ddc":["000"],"intvolume":" 37"},{"publication_identifier":{"eissn":["2469-9969"],"issn":["2469-9950"]},"month":"12","oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1809.01204"}],"external_id":{"isi":["000452992700008"],"arxiv":["1809.01204"]},"project":[{"name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734"},{"grant_number":"694227","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","name":"Analysis of quantum many-body systems","call_identifier":"H2020"}],"quality_controlled":"1","isi":1,"doi":"10.1103/physrevb.98.224506","language":[{"iso":"eng"}],"article_number":"224506","ec_funded":1,"year":"2018","publisher":"American Physical Society","department":[{"_id":"MiLe"},{"_id":"RoSe"}],"publication_status":"published","author":[{"full_name":"Yakaboylu, Enderalp","id":"38CB71F6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5973-0874","first_name":"Enderalp","last_name":"Yakaboylu"},{"full_name":"Midya, Bikashkali","last_name":"Midya","first_name":"Bikashkali","id":"456187FC-F248-11E8-B48F-1D18A9856A87"},{"id":"4DA65CD0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3146-6746","first_name":"Andreas","last_name":"Deuchert","full_name":"Deuchert, Andreas"},{"last_name":"Leopold","first_name":"Nikolai K","orcid":"0000-0002-0495-6822","id":"4BC40BEC-F248-11E8-B48F-1D18A9856A87","full_name":"Leopold, Nikolai K"},{"full_name":"Lemeshko, Mikhail","orcid":"0000-0002-6990-7802","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","last_name":"Lemeshko","first_name":"Mikhail"}],"volume":98,"date_updated":"2023-09-19T14:29:03Z","date_created":"2019-02-14T10:37:09Z","scopus_import":"1","article_processing_charge":"No","day":"12","citation":{"ama":"Yakaboylu E, Midya B, Deuchert A, Leopold NK, Lemeshko M. Theory of the rotating polaron: Spectrum and self-localization. Physical Review B. 2018;98(22). doi:10.1103/physrevb.98.224506","apa":"Yakaboylu, E., Midya, B., Deuchert, A., Leopold, N. K., & Lemeshko, M. (2018). Theory of the rotating polaron: Spectrum and self-localization. Physical Review B. American Physical Society. https://doi.org/10.1103/physrevb.98.224506","ieee":"E. Yakaboylu, B. Midya, A. Deuchert, N. K. Leopold, and M. Lemeshko, “Theory of the rotating polaron: Spectrum and self-localization,” Physical Review B, vol. 98, no. 22. American Physical Society, 2018.","ista":"Yakaboylu E, Midya B, Deuchert A, Leopold NK, Lemeshko M. 2018. Theory of the rotating polaron: Spectrum and self-localization. Physical Review B. 98(22), 224506.","short":"E. Yakaboylu, B. Midya, A. Deuchert, N.K. Leopold, M. Lemeshko, Physical Review B 98 (2018).","mla":"Yakaboylu, Enderalp, et al. “Theory of the Rotating Polaron: Spectrum and Self-Localization.” Physical Review B, vol. 98, no. 22, 224506, American Physical Society, 2018, doi:10.1103/physrevb.98.224506.","chicago":"Yakaboylu, Enderalp, Bikashkali Midya, Andreas Deuchert, Nikolai K Leopold, and Mikhail Lemeshko. “Theory of the Rotating Polaron: Spectrum and Self-Localization.” Physical Review B. American Physical Society, 2018. https://doi.org/10.1103/physrevb.98.224506."},"publication":"Physical Review B","date_published":"2018-12-12T00:00:00Z","type":"journal_article","issue":"22","abstract":[{"text":"We study a quantum impurity possessing both translational and internal rotational degrees of freedom interacting with a bosonic bath. Such a system corresponds to a “rotating polaron,” which can be used to model, e.g., a rotating molecule immersed in an ultracold Bose gas or superfluid helium. We derive the Hamiltonian of the rotating polaron and study its spectrum in the weak- and strong-coupling regimes using a combination of variational, diagrammatic, and mean-field approaches. We reveal how the coupling between linear and angular momenta affects stable quasiparticle states, and demonstrate that internal rotation leads to an enhanced self-localization in the translational degrees of freedom.","lang":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"5983","intvolume":" 98","status":"public","title":"Theory of the rotating polaron: Spectrum and self-localization","oa_version":"Preprint"},{"author":[{"full_name":"Zhang, Yu","first_name":"Yu","last_name":"Zhang"},{"full_name":"Liu, Yu","first_name":"Yu","last_name":"Liu"},{"full_name":"Lim, Khak Ho","last_name":"Lim","first_name":"Khak Ho"},{"full_name":"Xing, Congcong","last_name":"Xing","first_name":"Congcong"},{"first_name":"Mengyao","last_name":"Li","full_name":"Li, Mengyao"},{"full_name":"Zhang, Ting","first_name":"Ting","last_name":"Zhang"},{"last_name":"Tang","first_name":"Pengyi","full_name":"Tang, Pengyi"},{"full_name":"Arbiol, Jordi","first_name":"Jordi","last_name":"Arbiol"},{"full_name":"Llorca, Jordi","first_name":"Jordi","last_name":"Llorca"},{"full_name":"Ng, Ka Ming","last_name":"Ng","first_name":"Ka Ming"},{"orcid":"0000-0001-5013-2843","id":"43C61214-F248-11E8-B48F-1D18A9856A87","last_name":"Ibáñez","first_name":"Maria","full_name":"Ibáñez, Maria"},{"first_name":"Pablo","last_name":"Guardia","full_name":"Guardia, Pablo"},{"full_name":"Prato, Mirko","last_name":"Prato","first_name":"Mirko"},{"full_name":"Cadavid, Doris","first_name":"Doris","last_name":"Cadavid"},{"full_name":"Cabot, Andreu","first_name":"Andreu","last_name":"Cabot"}],"volume":57,"date_created":"2019-02-14T10:23:27Z","date_updated":"2023-09-19T14:28:31Z","year":"2018","publisher":"Wiley","department":[{"_id":"MaIb"}],"publication_status":"published","publication_identifier":{"issn":["1433-7851"]},"month":"12","doi":"10.1002/anie.201809847","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://upcommons.upc.edu/bitstream/2117/130444/1/Zhang%20preprint.pdf"}],"oa":1,"external_id":{"isi":["000454575500020"]},"quality_controlled":"1","isi":1,"issue":"52","abstract":[{"text":"In the present work, we detail a fast and simple solution-based method to synthesize hexagonal SnSe2 nanoplates (NPLs) and their use to produce crystallographically textured SnSe2 nanomaterials. We also demonstrate that the same strategy can be used to produce orthorhombic SnSe nanostructures and nanomaterials. NPLs are grown through a screw dislocation-driven mechanism. This mechanism typically results in pyramidal structures, but we demonstrate here that the growth from multiple dislocations results in flower-like structures. Crystallographically textured SnSe2 bulk nanomaterials obtained from the hot pressing of these SnSe2 structures display highly anisotropic charge and heat transport properties and thermoelectric (TE) figures of merit limited by relatively low electrical conductivities. To improve this parameter, SnSe2 NPLs are blended here with metal nanoparticles. The electrical conductivities of the blends are significantly improved with respect to bare SnSe2 NPLs, what translates into a three-fold increase of the TE Figure of merit, reaching unprecedented ZT values up to 0.65.","lang":"eng"}],"type":"journal_article","oa_version":"Submitted Version","_id":"5982","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","intvolume":" 57","status":"public","title":"Tin diselenide molecular precursor for solution-processable thermoelectric materials","article_processing_charge":"No","day":"21","scopus_import":"1","date_published":"2018-12-21T00:00:00Z","citation":{"ista":"Zhang Y, Liu Y, Lim KH, Xing C, Li M, Zhang T, Tang P, Arbiol J, Llorca J, Ng KM, Ibáñez M, Guardia P, Prato M, Cadavid D, Cabot A. 2018. Tin diselenide molecular precursor for solution-processable thermoelectric materials. Angewandte Chemie International Edition. 57(52), 17063–17068.","apa":"Zhang, Y., Liu, Y., Lim, K. H., Xing, C., Li, M., Zhang, T., … Cabot, A. (2018). Tin diselenide molecular precursor for solution-processable thermoelectric materials. Angewandte Chemie International Edition. Wiley. https://doi.org/10.1002/anie.201809847","ieee":"Y. Zhang et al., “Tin diselenide molecular precursor for solution-processable thermoelectric materials,” Angewandte Chemie International Edition, vol. 57, no. 52. Wiley, pp. 17063–17068, 2018.","ama":"Zhang Y, Liu Y, Lim KH, et al. Tin diselenide molecular precursor for solution-processable thermoelectric materials. Angewandte Chemie International Edition. 2018;57(52):17063-17068. doi:10.1002/anie.201809847","chicago":"Zhang, Yu, Yu Liu, Khak Ho Lim, Congcong Xing, Mengyao Li, Ting Zhang, Pengyi Tang, et al. “Tin Diselenide Molecular Precursor for Solution-Processable Thermoelectric Materials.” Angewandte Chemie International Edition. Wiley, 2018. https://doi.org/10.1002/anie.201809847.","mla":"Zhang, Yu, et al. “Tin Diselenide Molecular Precursor for Solution-Processable Thermoelectric Materials.” Angewandte Chemie International Edition, vol. 57, no. 52, Wiley, 2018, pp. 17063–68, doi:10.1002/anie.201809847.","short":"Y. Zhang, Y. Liu, K.H. Lim, C. Xing, M. Li, T. Zhang, P. Tang, J. Arbiol, J. Llorca, K.M. Ng, M. Ibáñez, P. Guardia, M. Prato, D. Cadavid, A. Cabot, Angewandte Chemie International Edition 57 (2018) 17063–17068."},"publication":"Angewandte Chemie International Edition","page":"17063-17068","article_type":"original"},{"publisher":"AAAI Press","department":[{"_id":"VlKo"}],"title":"Exact MAP-inference by confining combinatorial search with LP relaxation","status":"public","publication_status":"published","_id":"5978","year":"2018","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa_version":"Preprint","date_created":"2019-02-13T13:32:48Z","date_updated":"2023-09-19T14:26:52Z","author":[{"first_name":"Stefan","last_name":"Haller","full_name":"Haller, Stefan"},{"first_name":"Paul","last_name":"Swoboda","id":"446560C6-F248-11E8-B48F-1D18A9856A87","full_name":"Swoboda, Paul"},{"full_name":"Savchynskyy, Bogdan","first_name":"Bogdan","last_name":"Savchynskyy"}],"type":"conference","abstract":[{"lang":"eng","text":"We consider the MAP-inference problem for graphical models,which is a valued constraint satisfaction problem defined onreal numbers with a natural summation operation. We proposea family of relaxations (different from the famous Sherali-Adams hierarchy), which naturally define lower bounds for itsoptimum. This family always contains a tight relaxation andwe give an algorithm able to find it and therefore, solve theinitial non-relaxed NP-hard problem.The relaxations we consider decompose the original probleminto two non-overlapping parts: an easy LP-tight part and adifficult one. For the latter part a combinatorial solver must beused. As we show in our experiments, in a number of applica-tions the second, difficult part constitutes only a small fractionof the whole problem. This property allows to significantlyreduce the computational time of the combinatorial solver andtherefore solve problems which were out of reach before."}],"page":"6581-6588","isi":1,"quality_controlled":"1","main_file_link":[{"url":"https://arxiv.org/abs/2004.06370","open_access":"1"}],"external_id":{"arxiv":["2004.06370"],"isi":["000485488906082"]},"oa":1,"citation":{"mla":"Haller, Stefan, et al. “Exact MAP-Inference by Confining Combinatorial Search with LP Relaxation.” Proceedings of the 32st AAAI Conference on Artificial Intelligence, AAAI Press, 2018, pp. 6581–88.","short":"S. Haller, P. Swoboda, B. Savchynskyy, in:, Proceedings of the 32st AAAI Conference on Artificial Intelligence, AAAI Press, 2018, pp. 6581–6588.","chicago":"Haller, Stefan, Paul Swoboda, and Bogdan Savchynskyy. “Exact MAP-Inference by Confining Combinatorial Search with LP Relaxation.” In Proceedings of the 32st AAAI Conference on Artificial Intelligence, 6581–88. AAAI Press, 2018.","ama":"Haller S, Swoboda P, Savchynskyy B. Exact MAP-inference by confining combinatorial search with LP relaxation. In: Proceedings of the 32st AAAI Conference on Artificial Intelligence. AAAI Press; 2018:6581-6588.","ista":"Haller S, Swoboda P, Savchynskyy B. 2018. Exact MAP-inference by confining combinatorial search with LP relaxation. Proceedings of the 32st AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence, 6581–6588.","ieee":"S. Haller, P. Swoboda, and B. Savchynskyy, “Exact MAP-inference by confining combinatorial search with LP relaxation,” in Proceedings of the 32st AAAI Conference on Artificial Intelligence, New Orleans, LU, United States, 2018, pp. 6581–6588.","apa":"Haller, S., Swoboda, P., & Savchynskyy, B. (2018). Exact MAP-inference by confining combinatorial search with LP relaxation. In Proceedings of the 32st AAAI Conference on Artificial Intelligence (pp. 6581–6588). New Orleans, LU, United States: AAAI Press."},"publication":"Proceedings of the 32st AAAI Conference on Artificial Intelligence","language":[{"iso":"eng"}],"date_published":"2018-02-01T00:00:00Z","conference":{"name":"AAAI: Conference on Artificial Intelligence","location":"New Orleans, LU, United States","start_date":"2018-02-02","end_date":"2018-02-07"},"scopus_import":"1","article_processing_charge":"No","month":"02","day":"01"},{"date_published":"2018-11-02T00:00:00Z","publication":"Advanced Materials","citation":{"short":"J. Ridderbos, M. Brauns, J. Shen, F.K. de Vries, A. Li, E.P.A.M. Bakkers, A. Brinkman, F.A. Zwanenburg, Advanced Materials 30 (2018).","mla":"Ridderbos, Joost, et al. “Josephson Effect in a Few-Hole Quantum Dot.” Advanced Materials, vol. 30, no. 44, 1802257, Wiley, 2018, doi:10.1002/adma.201802257.","chicago":"Ridderbos, Joost, Matthias Brauns, Jie Shen, Folkert K. de Vries, Ang Li, Erik P. A. M. Bakkers, Alexander Brinkman, and Floris A. Zwanenburg. “Josephson Effect in a Few-Hole Quantum Dot.” Advanced Materials. Wiley, 2018. https://doi.org/10.1002/adma.201802257.","ama":"Ridderbos J, Brauns M, Shen J, et al. Josephson effect in a few-hole quantum dot. Advanced Materials. 2018;30(44). doi:10.1002/adma.201802257","apa":"Ridderbos, J., Brauns, M., Shen, J., de Vries, F. K., Li, A., Bakkers, E. P. A. M., … Zwanenburg, F. A. (2018). Josephson effect in a few-hole quantum dot. Advanced Materials. Wiley. https://doi.org/10.1002/adma.201802257","ieee":"J. Ridderbos et al., “Josephson effect in a few-hole quantum dot,” Advanced Materials, vol. 30, no. 44. Wiley, 2018.","ista":"Ridderbos J, Brauns M, Shen J, de Vries FK, Li A, Bakkers EPAM, Brinkman A, Zwanenburg FA. 2018. Josephson effect in a few-hole quantum dot. Advanced Materials. 30(44), 1802257."},"day":"02","article_processing_charge":"No","scopus_import":"1","oa_version":"Preprint","_id":"5990","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","status":"public","title":"Josephson effect in a few-hole quantum dot","intvolume":" 30","abstract":[{"text":"A Ge–Si core–shell nanowire is used to realize a Josephson field‐effect transistor with highly transparent contacts to superconducting leads. By changing the electric field, access to two distinct regimes, not combined before in a single device, is gained: in the accumulation mode the device is highly transparent and the supercurrent is carried by multiple subbands, while near depletion, the supercurrent is carried by single‐particle levels of a strongly coupled quantum dot operating in the few‐hole regime. These results establish Ge–Si nanowires as an important platform for hybrid superconductor–semiconductor physics and Majorana fermions.","lang":"eng"}],"issue":"44","type":"journal_article","doi":"10.1002/adma.201802257","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1809.08487"}],"oa":1,"external_id":{"isi":["000450232800015"],"arxiv":["1809.08487"]},"isi":1,"quality_controlled":"1","month":"11","publication_identifier":{"issn":["0935-9648"]},"author":[{"full_name":"Ridderbos, Joost","first_name":"Joost","last_name":"Ridderbos"},{"id":"33F94E3C-F248-11E8-B48F-1D18A9856A87","first_name":"Matthias","last_name":"Brauns","full_name":"Brauns, Matthias"},{"first_name":"Jie","last_name":"Shen","full_name":"Shen, Jie"},{"last_name":"de Vries","first_name":"Folkert K.","full_name":"de Vries, Folkert K."},{"first_name":"Ang","last_name":"Li","full_name":"Li, Ang"},{"last_name":"Bakkers","first_name":"Erik P. A. M.","full_name":"Bakkers, Erik P. A. M."},{"last_name":"Brinkman","first_name":"Alexander","full_name":"Brinkman, Alexander"},{"full_name":"Zwanenburg, Floris A.","last_name":"Zwanenburg","first_name":"Floris A."}],"date_created":"2019-02-14T12:14:26Z","date_updated":"2023-09-19T14:29:58Z","volume":30,"year":"2018","publication_status":"published","publisher":"Wiley","department":[{"_id":"GeKa"}],"article_number":"1802257"},{"page":"17-47","quality_controlled":"1","isi":1,"external_id":{"isi":["000430950400002"]},"citation":{"ista":"Chatterjee S, Kamath Hosdurg C, Kumar V. 2018. Private set-intersection with common set-up. American Institute of Mathematical Sciences. 12(1), 17–47.","ieee":"S. Chatterjee, C. Kamath Hosdurg, and V. Kumar, “Private set-intersection with common set-up,” American Institute of Mathematical Sciences, vol. 12, no. 1. AIMS, pp. 17–47, 2018.","apa":"Chatterjee, S., Kamath Hosdurg, C., & Kumar, V. (2018). Private set-intersection with common set-up. American Institute of Mathematical Sciences. AIMS. https://doi.org/10.3934/amc.2018002","ama":"Chatterjee S, Kamath Hosdurg C, Kumar V. Private set-intersection with common set-up. American Institute of Mathematical Sciences. 2018;12(1):17-47. doi:10.3934/amc.2018002","chicago":"Chatterjee, Sanjit, Chethan Kamath Hosdurg, and Vikas Kumar. “Private Set-Intersection with Common Set-Up.” American Institute of Mathematical Sciences. AIMS, 2018. https://doi.org/10.3934/amc.2018002.","mla":"Chatterjee, Sanjit, et al. “Private Set-Intersection with Common Set-Up.” American Institute of Mathematical Sciences, vol. 12, no. 1, AIMS, 2018, pp. 17–47, doi:10.3934/amc.2018002.","short":"S. Chatterjee, C. Kamath Hosdurg, V. Kumar, American Institute of Mathematical Sciences 12 (2018) 17–47."},"publication":"American Institute of Mathematical Sciences","language":[{"iso":"eng"}],"date_published":"2018-02-01T00:00:00Z","doi":"10.3934/amc.2018002","scopus_import":"1","article_processing_charge":"No","month":"02","day":"01","publisher":"AIMS","intvolume":" 12","department":[{"_id":"KrPi"}],"publication_status":"published","status":"public","title":"Private set-intersection with common set-up","_id":"5980","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","year":"2018","oa_version":"None","volume":12,"date_updated":"2023-09-19T14:27:59Z","date_created":"2019-02-13T13:49:41Z","author":[{"last_name":"Chatterjee","first_name":"Sanjit","full_name":"Chatterjee, Sanjit"},{"id":"4BD3F30E-F248-11E8-B48F-1D18A9856A87","first_name":"Chethan","last_name":"Kamath Hosdurg","full_name":"Kamath Hosdurg, Chethan"},{"first_name":"Vikas","last_name":"Kumar","full_name":"Kumar, Vikas"}],"type":"journal_article","issue":"1","abstract":[{"lang":"eng","text":"The problem of private set-intersection (PSI) has been traditionally treated as an instance of the more general problem of multi-party computation (MPC). Consequently, in order to argue security, or compose these protocols one has to rely on the general theory that was developed for the purpose of MPC. The pursuit of efficient protocols, however, has resulted in designs that exploit properties pertaining to PSI. In almost all practical applications where a PSI protocol is deployed, it is expected to be executed multiple times, possibly on related inputs. In this work we initiate a dedicated study of PSI in the multi-interaction (MI) setting. In this model a server sets up the common system parameters and executes set-intersection multiple times with potentially different clients. We discuss a few attacks that arise when protocols are naïvely composed in this manner and, accordingly, craft security definitions for the MI setting and study their inter-relation. Finally, we suggest a set of protocols that are MI-secure, at the same time almost as efficient as their parent, stand-alone, protocols."}]},{"file_date_updated":"2020-07-14T12:47:15Z","article_number":"e1007698","author":[{"full_name":"Velicky, Philipp","last_name":"Velicky","first_name":"Philipp","orcid":"0000-0002-2340-7431","id":"39BDC62C-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Meinhardt, Gudrun","first_name":"Gudrun","last_name":"Meinhardt"},{"full_name":"Plessl, Kerstin","last_name":"Plessl","first_name":"Kerstin"},{"full_name":"Vondra, Sigrid","first_name":"Sigrid","last_name":"Vondra"},{"first_name":"Tamara","last_name":"Weiss","full_name":"Weiss, Tamara"},{"first_name":"Peter","last_name":"Haslinger","full_name":"Haslinger, Peter"},{"first_name":"Thomas","last_name":"Lendl","full_name":"Lendl, Thomas"},{"last_name":"Aumayr","first_name":"Karin","full_name":"Aumayr, Karin"},{"full_name":"Mairhofer, Mario","first_name":"Mario","last_name":"Mairhofer"},{"full_name":"Zhu, Xiaowei","last_name":"Zhu","first_name":"Xiaowei"},{"last_name":"Schütz","first_name":"Birgit","full_name":"Schütz, Birgit"},{"full_name":"Hannibal, Roberta L.","first_name":"Roberta L.","last_name":"Hannibal"},{"full_name":"Lindau, Robert","first_name":"Robert","last_name":"Lindau"},{"first_name":"Beatrix","last_name":"Weil","full_name":"Weil, Beatrix"},{"last_name":"Ernerudh","first_name":"Jan","full_name":"Ernerudh, Jan"},{"last_name":"Neesen","first_name":"Jürgen","full_name":"Neesen, Jürgen"},{"last_name":"Egger","first_name":"Gerda","full_name":"Egger, Gerda"},{"first_name":"Mario","last_name":"Mikula","full_name":"Mikula, Mario"},{"first_name":"Clemens","last_name":"Röhrl","full_name":"Röhrl, Clemens"},{"last_name":"Urban","first_name":"Alexander E.","full_name":"Urban, Alexander E."},{"first_name":"Julie","last_name":"Baker","full_name":"Baker, Julie"},{"last_name":"Knöfler","first_name":"Martin","full_name":"Knöfler, Martin"},{"full_name":"Pollheimer, Jürgen","last_name":"Pollheimer","first_name":"Jürgen"}],"date_updated":"2023-09-19T14:31:43Z","date_created":"2019-02-14T13:07:45Z","volume":14,"year":"2018","publication_status":"published","publisher":"Public Library of Science","department":[{"_id":"JoDa"}],"month":"10","publication_identifier":{"issn":["1553-7404"]},"doi":"10.1371/journal.pgen.1007698","language":[{"iso":"eng"}],"external_id":{"isi":["000449328500025"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"isi":1,"quality_controlled":"1","abstract":[{"lang":"eng","text":"Genome amplification and cellular senescence are commonly associated with pathological processes. While physiological roles for polyploidization and senescence have been described in mouse development, controversy exists over their significance in humans. Here, we describe tetraploidization and senescence as phenomena of normal human placenta development. During pregnancy, placental extravillous trophoblasts (EVTs) invade the pregnant endometrium, termed decidua, to establish an adapted microenvironment required for the developing embryo. This process is critically dependent on continuous cell proliferation and differentiation, which is thought to follow the classical model of cell cycle arrest prior to terminal differentiation. Strikingly, flow cytometry and DNAseq revealed that EVT formation is accompanied with a genome-wide polyploidization, independent of mitotic cycles. DNA replication in these cells was analysed by a fluorescent cell-cycle indicator reporter system, cell cycle marker expression and EdU incorporation. Upon invasion into the decidua, EVTs widely lose their replicative potential and enter a senescent state characterized by high senescence-associated (SA) β-galactosidase activity, induction of a SA secretory phenotype as well as typical metabolic alterations. Furthermore, we show that the shift from endocycle-dependent genome amplification to growth arrest is disturbed in androgenic complete hydatidiform moles (CHM), a hyperplastic pregnancy disorder associated with increased risk of developing choriocarinoma. Senescence is decreased in CHM-EVTs, accompanied by exacerbated endoreduplication and hyperploidy. We propose induction of cellular senescence as a ploidy-limiting mechanism during normal human placentation and unravel a link between excessive polyploidization and reduced senescence in CHM."}],"issue":"10","type":"journal_article","oa_version":"Published Version","file":[{"file_id":"6000","relation":"main_file","checksum":"34aa9a5972f61889c19f18be8ee787a0","date_updated":"2020-07-14T12:47:15Z","date_created":"2019-02-14T13:14:35Z","access_level":"open_access","file_name":"2018_PLOS_Velicky.pdf","creator":"kschuh","file_size":4592947,"content_type":"application/pdf"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"5998","title":"Genome amplification and cellular senescence are hallmarks of human placenta development","ddc":["570"],"status":"public","intvolume":" 14","day":"12","has_accepted_license":"1","article_processing_charge":"No","scopus_import":"1","date_published":"2018-10-12T00:00:00Z","publication":"PLOS Genetics","citation":{"chicago":"Velicky, Philipp, Gudrun Meinhardt, Kerstin Plessl, Sigrid Vondra, Tamara Weiss, Peter Haslinger, Thomas Lendl, et al. “Genome Amplification and Cellular Senescence Are Hallmarks of Human Placenta Development.” PLOS Genetics. Public Library of Science, 2018. https://doi.org/10.1371/journal.pgen.1007698.","mla":"Velicky, Philipp, et al. “Genome Amplification and Cellular Senescence Are Hallmarks of Human Placenta Development.” PLOS Genetics, vol. 14, no. 10, e1007698, Public Library of Science, 2018, doi:10.1371/journal.pgen.1007698.","short":"P. Velicky, G. Meinhardt, K. Plessl, S. Vondra, T. Weiss, P. Haslinger, T. Lendl, K. Aumayr, M. Mairhofer, X. Zhu, B. Schütz, R.L. Hannibal, R. Lindau, B. Weil, J. Ernerudh, J. Neesen, G. Egger, M. Mikula, C. Röhrl, A.E. Urban, J. Baker, M. Knöfler, J. Pollheimer, PLOS Genetics 14 (2018).","ista":"Velicky P, Meinhardt G, Plessl K, Vondra S, Weiss T, Haslinger P, Lendl T, Aumayr K, Mairhofer M, Zhu X, Schütz B, Hannibal RL, Lindau R, Weil B, Ernerudh J, Neesen J, Egger G, Mikula M, Röhrl C, Urban AE, Baker J, Knöfler M, Pollheimer J. 2018. Genome amplification and cellular senescence are hallmarks of human placenta development. PLOS Genetics. 14(10), e1007698.","apa":"Velicky, P., Meinhardt, G., Plessl, K., Vondra, S., Weiss, T., Haslinger, P., … Pollheimer, J. (2018). Genome amplification and cellular senescence are hallmarks of human placenta development. PLOS Genetics. Public Library of Science. https://doi.org/10.1371/journal.pgen.1007698","ieee":"P. Velicky et al., “Genome amplification and cellular senescence are hallmarks of human placenta development,” PLOS Genetics, vol. 14, no. 10. Public Library of Science, 2018.","ama":"Velicky P, Meinhardt G, Plessl K, et al. Genome amplification and cellular senescence are hallmarks of human placenta development. PLOS Genetics. 2018;14(10). doi:10.1371/journal.pgen.1007698"}},{"issue":"21","abstract":[{"lang":"eng","text":"Motivation\r\nComputational prediction of the effect of mutations on protein stability is used by researchers in many fields. The utility of the prediction methods is affected by their accuracy and bias. Bias, a systematic shift of the predicted change of stability, has been noted as an issue for several methods, but has not been investigated systematically. Presence of the bias may lead to misleading results especially when exploring the effects of combination of different mutations.\r\n\r\nResults\r\nHere we use a protocol to measure the bias as a function of the number of introduced mutations. It is based on a self-consistency test of the reciprocity the effect of a mutation. An advantage of the used approach is that it relies solely on crystal structures without experimentally measured stability values. We applied the protocol to four popular algorithms predicting change of protein stability upon mutation, FoldX, Eris, Rosetta and I-Mutant, and found an inherent bias. For one program, FoldX, we manage to substantially reduce the bias using additional relaxation by Modeller. Authors using algorithms for predicting effects of mutations should be aware of the bias described here."}],"type":"journal_article","file":[{"date_updated":"2020-07-14T12:47:15Z","date_created":"2019-02-14T13:00:55Z","checksum":"7e0495153f44211479674601d7f6ee03","file_id":"5997","relation":"main_file","creator":"kschuh","file_size":291969,"content_type":"application/pdf","file_name":"2018_Oxford_Usmanova.pdf","access_level":"open_access"}],"oa_version":"Published Version","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"5995","intvolume":" 34","title":"Self-consistency test reveals systematic bias in programs for prediction change of stability upon mutation","ddc":["570"],"status":"public","article_processing_charge":"No","has_accepted_license":"1","day":"01","scopus_import":"1","date_published":"2018-11-01T00:00:00Z","citation":{"ista":"Usmanova DR, Bogatyreva NS, Ariño Bernad J, Eremina AA, Gorshkova AA, Kanevskiy GM, Lonishin LR, Meister AV, Yakupova AG, Kondrashov F, Ivankov D. 2018. Self-consistency test reveals systematic bias in programs for prediction change of stability upon mutation. Bioinformatics. 34(21), 3653–3658.","apa":"Usmanova, D. R., Bogatyreva, N. S., Ariño Bernad, J., Eremina, A. A., Gorshkova, A. A., Kanevskiy, G. M., … Ivankov, D. (2018). Self-consistency test reveals systematic bias in programs for prediction change of stability upon mutation. Bioinformatics. Oxford University Press . https://doi.org/10.1093/bioinformatics/bty340","ieee":"D. R. Usmanova et al., “Self-consistency test reveals systematic bias in programs for prediction change of stability upon mutation,” Bioinformatics, vol. 34, no. 21. Oxford University Press , pp. 3653–3658, 2018.","ama":"Usmanova DR, Bogatyreva NS, Ariño Bernad J, et al. Self-consistency test reveals systematic bias in programs for prediction change of stability upon mutation. Bioinformatics. 2018;34(21):3653-3658. doi:10.1093/bioinformatics/bty340","chicago":"Usmanova, Dinara R, Natalya S Bogatyreva, Joan Ariño Bernad, Aleksandra A Eremina, Anastasiya A Gorshkova, German M Kanevskiy, Lyubov R Lonishin, et al. “Self-Consistency Test Reveals Systematic Bias in Programs for Prediction Change of Stability upon Mutation.” Bioinformatics. Oxford University Press , 2018. https://doi.org/10.1093/bioinformatics/bty340.","mla":"Usmanova, Dinara R., et al. “Self-Consistency Test Reveals Systematic Bias in Programs for Prediction Change of Stability upon Mutation.” Bioinformatics, vol. 34, no. 21, Oxford University Press , 2018, pp. 3653–58, doi:10.1093/bioinformatics/bty340.","short":"D.R. Usmanova, N.S. Bogatyreva, J. Ariño Bernad, A.A. Eremina, A.A. Gorshkova, G.M. Kanevskiy, L.R. Lonishin, A.V. Meister, A.G. Yakupova, F. Kondrashov, D. Ivankov, Bioinformatics 34 (2018) 3653–3658."},"publication":"Bioinformatics","page":"3653-3658","ec_funded":1,"file_date_updated":"2020-07-14T12:47:15Z","license":"https://creativecommons.org/licenses/by-nc/4.0/","author":[{"first_name":"Dinara R","last_name":"Usmanova","full_name":"Usmanova, Dinara R"},{"first_name":"Natalya S","last_name":"Bogatyreva","full_name":"Bogatyreva, Natalya S"},{"last_name":"Ariño Bernad","first_name":"Joan","full_name":"Ariño Bernad, Joan"},{"first_name":"Aleksandra A","last_name":"Eremina","full_name":"Eremina, Aleksandra A"},{"full_name":"Gorshkova, Anastasiya A","last_name":"Gorshkova","first_name":"Anastasiya A"},{"last_name":"Kanevskiy","first_name":"German M","full_name":"Kanevskiy, German M"},{"full_name":"Lonishin, Lyubov R","first_name":"Lyubov R","last_name":"Lonishin"},{"full_name":"Meister, Alexander V","first_name":"Alexander V","last_name":"Meister"},{"full_name":"Yakupova, Alisa G","first_name":"Alisa G","last_name":"Yakupova"},{"id":"44FDEF62-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8243-4694","first_name":"Fyodor","last_name":"Kondrashov","full_name":"Kondrashov, Fyodor"},{"id":"49FF1036-F248-11E8-B48F-1D18A9856A87","last_name":"Ivankov","first_name":"Dmitry","full_name":"Ivankov, Dmitry"}],"volume":34,"date_created":"2019-02-14T12:48:00Z","date_updated":"2023-09-19T14:31:13Z","pmid":1,"year":"2018","department":[{"_id":"FyKo"}],"publisher":"Oxford University Press ","publication_status":"published","publication_identifier":{"issn":["1367-4803","1460-2059"]},"month":"11","doi":"10.1093/bioinformatics/bty340","language":[{"iso":"eng"}],"oa":1,"tmp":{"name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png","short":"CC BY-NC (4.0)"},"external_id":{"isi":["000450038900008"],"pmid":["29722803"]},"project":[{"name":"Systematic investigation of epistasis in molecular evolution","call_identifier":"FP7","_id":"26120F5C-B435-11E9-9278-68D0E5697425","grant_number":"335980"}],"quality_controlled":"1","isi":1},{"month":"11","publication_identifier":{"eissn":["1939-4586"]},"doi":"10.1091/mbc.e18-02-0082","language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","image":"/images/cc_by_nc_sa.png","short":"CC BY-NC-SA (4.0)"},"oa":1,"external_id":{"isi":["000455641000011"],"pmid":["30156465"]},"quality_controlled":"1","isi":1,"file_date_updated":"2020-07-14T12:47:15Z","license":"https://creativecommons.org/licenses/by-nc-sa/4.0/","author":[{"full_name":"Dolati, Setareh","first_name":"Setareh","last_name":"Dolati"},{"last_name":"Kage","first_name":"Frieda","full_name":"Kage, Frieda"},{"first_name":"Jan","last_name":"Mueller","full_name":"Mueller, Jan"},{"first_name":"Mathias","last_name":"Müsken","full_name":"Müsken, Mathias"},{"first_name":"Marieluise","last_name":"Kirchner","full_name":"Kirchner, Marieluise"},{"last_name":"Dittmar","first_name":"Gunnar","full_name":"Dittmar, Gunnar"},{"orcid":"0000-0002-6620-9179","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","last_name":"Sixt","first_name":"Michael K","full_name":"Sixt, Michael K"},{"full_name":"Rottner, Klemens","last_name":"Rottner","first_name":"Klemens"},{"last_name":"Falcke","first_name":"Martin","full_name":"Falcke, Martin"}],"date_updated":"2023-09-19T14:30:23Z","date_created":"2019-02-14T12:25:47Z","volume":29,"year":"2018","pmid":1,"publication_status":"published","publisher":"American Society for Cell Biology ","department":[{"_id":"MiSi"}],"day":"01","has_accepted_license":"1","article_processing_charge":"No","scopus_import":"1","date_published":"2018-11-01T00:00:00Z","publication":"Molecular Biology of the Cell","citation":{"apa":"Dolati, S., Kage, F., Mueller, J., Müsken, M., Kirchner, M., Dittmar, G., … Falcke, M. (2018). On the relation between filament density, force generation, and protrusion rate in mesenchymal cell motility. Molecular Biology of the Cell. American Society for Cell Biology . https://doi.org/10.1091/mbc.e18-02-0082","ieee":"S. Dolati et al., “On the relation between filament density, force generation, and protrusion rate in mesenchymal cell motility,” Molecular Biology of the Cell, vol. 29, no. 22. American Society for Cell Biology , pp. 2674–2686, 2018.","ista":"Dolati S, Kage F, Mueller J, Müsken M, Kirchner M, Dittmar G, Sixt MK, Rottner K, Falcke M. 2018. On the relation between filament density, force generation, and protrusion rate in mesenchymal cell motility. Molecular Biology of the Cell. 29(22), 2674–2686.","ama":"Dolati S, Kage F, Mueller J, et al. On the relation between filament density, force generation, and protrusion rate in mesenchymal cell motility. Molecular Biology of the Cell. 2018;29(22):2674-2686. doi:10.1091/mbc.e18-02-0082","chicago":"Dolati, Setareh, Frieda Kage, Jan Mueller, Mathias Müsken, Marieluise Kirchner, Gunnar Dittmar, Michael K Sixt, Klemens Rottner, and Martin Falcke. “On the Relation between Filament Density, Force Generation, and Protrusion Rate in Mesenchymal Cell Motility.” Molecular Biology of the Cell. American Society for Cell Biology , 2018. https://doi.org/10.1091/mbc.e18-02-0082.","short":"S. Dolati, F. Kage, J. Mueller, M. Müsken, M. Kirchner, G. Dittmar, M.K. Sixt, K. Rottner, M. Falcke, Molecular Biology of the Cell 29 (2018) 2674–2686.","mla":"Dolati, Setareh, et al. “On the Relation between Filament Density, Force Generation, and Protrusion Rate in Mesenchymal Cell Motility.” Molecular Biology of the Cell, vol. 29, no. 22, American Society for Cell Biology , 2018, pp. 2674–86, doi:10.1091/mbc.e18-02-0082."},"page":"2674-2686","abstract":[{"text":"Lamellipodia are flat membrane protrusions formed during mesenchymal motion. Polymerization at the leading edge assembles the actin filament network and generates protrusion force. How this force is supported by the network and how the assembly rate is shared between protrusion and network retrograde flow determines the protrusion rate. We use mathematical modeling to understand experiments changing the F-actin density in lamellipodia of B16-F1 melanoma cells by modulation of Arp2/3 complex activity or knockout of the formins FMNL2 and FMNL3. Cells respond to a reduction of density with a decrease of protrusion velocity, an increase in the ratio of force to filament number, but constant network assembly rate. The relation between protrusion force and tension gradient in the F-actin network and the density dependency of friction, elasticity, and viscosity of the network explain the experimental observations. The formins act as filament nucleators and elongators with differential rates. Modulation of their activity suggests an effect on network assembly rate. Contrary to these expectations, the effect of changes in elongator composition is much weaker than the consequences of the density change. We conclude that the force acting on the leading edge membrane is the force required to drive F-actin network retrograde flow.","lang":"eng"}],"issue":"22","type":"journal_article","oa_version":"Published Version","file":[{"creator":"kschuh","file_size":6668971,"content_type":"application/pdf","file_name":"2018_ASCB_Dolati.pdf","access_level":"open_access","date_updated":"2020-07-14T12:47:15Z","date_created":"2019-02-14T12:34:29Z","checksum":"e98465b4416b3e804c47f40086932af2","file_id":"5994","relation":"main_file"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"5992","ddc":["570"],"title":"On the relation between filament density, force generation, and protrusion rate in mesenchymal cell motility","status":"public","intvolume":" 29"},{"page":"E7615-E7623","citation":{"short":"F. Garrido-Charad, T.A. Vega Zuniga, C. Gutiérrez-Ibáñez, P. Fernandez, L. López-Jury, C. González-Cabrera, H.J. Karten, H. Luksch, G.J. Marín, Proceedings of the National Academy of Sciences 115 (2018) E7615–E7623.","mla":"Garrido-Charad, Florencia, et al. ““Shepherd’s Crook” Neurons Drive and Synchronize the Enhancing and Suppressive Mechanisms of the Midbrain Stimulus Selection Network.” Proceedings of the National Academy of Sciences, vol. 115, no. 32, National Academy of Sciences, 2018, pp. E7615–23, doi:10.1073/pnas.1804517115.","chicago":"Garrido-Charad, Florencia, Tomas A Vega Zuniga, Cristián Gutiérrez-Ibáñez, Pedro Fernandez, Luciana López-Jury, Cristian González-Cabrera, Harvey J. Karten, Harald Luksch, and Gonzalo J. Marín. ““Shepherd’s Crook” Neurons Drive and Synchronize the Enhancing and Suppressive Mechanisms of the Midbrain Stimulus Selection Network.” Proceedings of the National Academy of Sciences. National Academy of Sciences, 2018. https://doi.org/10.1073/pnas.1804517115.","ama":"Garrido-Charad F, Vega Zuniga TA, Gutiérrez-Ibáñez C, et al. “Shepherd’s crook” neurons drive and synchronize the enhancing and suppressive mechanisms of the midbrain stimulus selection network. Proceedings of the National Academy of Sciences. 2018;115(32):E7615-E7623. doi:10.1073/pnas.1804517115","apa":"Garrido-Charad, F., Vega Zuniga, T. A., Gutiérrez-Ibáñez, C., Fernandez, P., López-Jury, L., González-Cabrera, C., … Marín, G. J. (2018). “Shepherd’s crook” neurons drive and synchronize the enhancing and suppressive mechanisms of the midbrain stimulus selection network. Proceedings of the National Academy of Sciences. National Academy of Sciences. https://doi.org/10.1073/pnas.1804517115","ieee":"F. Garrido-Charad et al., ““Shepherd’s crook” neurons drive and synchronize the enhancing and suppressive mechanisms of the midbrain stimulus selection network,” Proceedings of the National Academy of Sciences, vol. 115, no. 32. National Academy of Sciences, pp. E7615–E7623, 2018.","ista":"Garrido-Charad F, Vega Zuniga TA, Gutiérrez-Ibáñez C, Fernandez P, López-Jury L, González-Cabrera C, Karten HJ, Luksch H, Marín GJ. 2018. “Shepherd’s crook” neurons drive and synchronize the enhancing and suppressive mechanisms of the midbrain stimulus selection network. Proceedings of the National Academy of Sciences. 115(32), E7615–E7623."},"publication":"Proceedings of the National Academy of Sciences","date_published":"2018-08-07T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"07","intvolume":" 115","title":"“Shepherd’s crook” neurons drive and synchronize the enhancing and suppressive mechanisms of the midbrain stimulus selection network","status":"public","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"6010","oa_version":"Submitted Version","type":"journal_article","issue":"32","abstract":[{"text":"The optic tectum (TeO), or superior colliculus, is a multisensory midbrain center that organizes spatially orienting responses to relevant stimuli. To define the stimulus with the highest priority at each moment, a network of reciprocal connections between the TeO and the isthmi promotes competition between concurrent tectal inputs. In the avian midbrain, the neurons mediating enhancement and suppression of tectal inputs are located in separate isthmic nuclei, facilitating the analysis of the neural processes that mediate competition. A specific subset of radial neurons in the intermediate tectal layers relay retinal inputs to the isthmi, but at present it is unclear whether separate neurons innervate individual nuclei or a single neural type sends a common input to several of them. In this study, we used in vitro neural tracing and cell-filling experiments in chickens to show that single neurons innervate, via axon collaterals, the three nuclei that comprise the isthmotectal network. This demonstrates that the input signals representing the strength of the incoming stimuli are simultaneously relayed to the mechanisms promoting both enhancement and suppression of the input signals. By performing in vivo recordings in anesthetized chicks, we also show that this common input generates synchrony between both antagonistic mechanisms, demonstrating that activity enhancement and suppression are closely coordinated. From a computational point of view, these results suggest that these tectal neurons constitute integrative nodes that combine inputs from different sources to drive in parallel several concurrent neural processes, each performing complementary functions within the network through different firing patterns and connectivity.","lang":"eng"}],"isi":1,"quality_controlled":"1","oa":1,"external_id":{"isi":["000440982000020"],"pmid":["30026198"]},"main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pubmed/30026198"}],"language":[{"iso":"eng"}],"doi":"10.1073/pnas.1804517115","publication_identifier":{"issn":["0027-8424"],"eissn":["1091-6490"]},"month":"08","publisher":"National Academy of Sciences","department":[{"_id":"MaJö"}],"publication_status":"published","pmid":1,"year":"2018","volume":115,"date_updated":"2023-09-19T14:35:36Z","date_created":"2019-02-14T14:33:34Z","author":[{"first_name":"Florencia","last_name":"Garrido-Charad","full_name":"Garrido-Charad, Florencia"},{"last_name":"Vega Zuniga","first_name":"Tomas A","id":"2E7C4E78-F248-11E8-B48F-1D18A9856A87","full_name":"Vega Zuniga, Tomas A"},{"full_name":"Gutiérrez-Ibáñez, Cristián","first_name":"Cristián","last_name":"Gutiérrez-Ibáñez"},{"full_name":"Fernandez, Pedro","first_name":"Pedro","last_name":"Fernandez"},{"last_name":"López-Jury","first_name":"Luciana","full_name":"López-Jury, Luciana"},{"first_name":"Cristian","last_name":"González-Cabrera","full_name":"González-Cabrera, Cristian"},{"first_name":"Harvey J.","last_name":"Karten","full_name":"Karten, Harvey J."},{"full_name":"Luksch, Harald","first_name":"Harald","last_name":"Luksch"},{"last_name":"Marín","first_name":"Gonzalo J.","full_name":"Marín, Gonzalo J."}]},{"year":"2018","publication_status":"published","publisher":"Wiley","department":[{"_id":"BeBi"}],"author":[{"id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385","first_name":"Bernd","last_name":"Bickel","full_name":"Bickel, Bernd"},{"full_name":"Cignoni, Paolo","last_name":"Cignoni","first_name":"Paolo"},{"full_name":"Malomo, Luigi","first_name":"Luigi","last_name":"Malomo"},{"last_name":"Pietroni","first_name":"Nico","full_name":"Pietroni, Nico"}],"date_updated":"2023-09-19T14:33:40Z","date_created":"2019-02-14T13:52:25Z","volume":37,"file_date_updated":"2020-07-14T12:47:15Z","ec_funded":1,"oa":1,"external_id":{"isi":["000437272800019"]},"quality_controlled":"1","isi":1,"project":[{"grant_number":"715767","_id":"24F9549A-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling"}],"doi":"10.1111/cgf.13327","language":[{"iso":"eng"}],"month":"09","publication_identifier":{"issn":["0167-7055"]},"_id":"6003","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","ddc":["004"],"title":"State of the art on stylized fabrication","status":"public","intvolume":" 37","pubrep_id":"1051","oa_version":"Submitted Version","file":[{"date_created":"2019-02-14T14:09:28Z","date_updated":"2020-07-14T12:47:15Z","checksum":"d2bbe5c658d8159fbe9016a4f5e82b19","file_id":"6004","relation":"main_file","creator":"kschuh","content_type":"application/pdf","file_size":6209349,"file_name":"StylizedFabricationSTAR-Personal.pdf","access_level":"open_access"}],"type":"journal_article","abstract":[{"text":"Digital fabrication devices are powerful tools for creating tangible reproductions of 3D digital models. Most available printing technologies aim at producing an accurate copy of a tridimensional shape. However, fabrication technologies can also be used to create a stylistic representation of a digital shape. We refer to this class of methods as ‘stylized fabrication methods’. These methods abstract geometric and physical features of a given shape to create an unconventional representation, to produce an optical illusion or to devise a particular interaction with the fabricated model. In this state‐of‐the‐art report, we classify and overview this broad and emerging class of approaches and also propose possible directions for future research.","lang":"eng"}],"issue":"6","publication":"Computer Graphics Forum","citation":{"chicago":"Bickel, Bernd, Paolo Cignoni, Luigi Malomo, and Nico Pietroni. “State of the Art on Stylized Fabrication.” Computer Graphics Forum. Wiley, 2018. https://doi.org/10.1111/cgf.13327.","short":"B. Bickel, P. Cignoni, L. Malomo, N. Pietroni, Computer Graphics Forum 37 (2018) 325–342.","mla":"Bickel, Bernd, et al. “State of the Art on Stylized Fabrication.” Computer Graphics Forum, vol. 37, no. 6, Wiley, 2018, pp. 325–42, doi:10.1111/cgf.13327.","ieee":"B. Bickel, P. Cignoni, L. Malomo, and N. Pietroni, “State of the art on stylized fabrication,” Computer Graphics Forum, vol. 37, no. 6. Wiley, pp. 325–342, 2018.","apa":"Bickel, B., Cignoni, P., Malomo, L., & Pietroni, N. (2018). State of the art on stylized fabrication. Computer Graphics Forum. Wiley. https://doi.org/10.1111/cgf.13327","ista":"Bickel B, Cignoni P, Malomo L, Pietroni N. 2018. State of the art on stylized fabrication. Computer Graphics Forum. 37(6), 325–342.","ama":"Bickel B, Cignoni P, Malomo L, Pietroni N. State of the art on stylized fabrication. Computer Graphics Forum. 2018;37(6):325-342. doi:10.1111/cgf.13327"},"page":"325-342","date_published":"2018-09-01T00:00:00Z","scopus_import":"1","day":"01","article_processing_charge":"No","has_accepted_license":"1"},{"author":[{"first_name":"Marcin M","last_name":"Napiórkowski","id":"4197AD04-F248-11E8-B48F-1D18A9856A87","full_name":"Napiórkowski, Marcin M"},{"full_name":"Reuvers, Robin","first_name":"Robin","last_name":"Reuvers"},{"full_name":"Solovej, Jan Philip","first_name":"Jan Philip","last_name":"Solovej"}],"volume":229,"date_created":"2019-02-14T13:40:53Z","date_updated":"2023-09-19T14:33:12Z","year":"2018","department":[{"_id":"RoSe"}],"publisher":"Springer Nature","publication_status":"published","doi":"10.1007/s00205-018-1232-6","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://arxiv.org/abs/1511.05935","open_access":"1"}],"oa":1,"external_id":{"arxiv":["1511.05935"],"isi":["000435367300003"]},"project":[{"_id":"25C878CE-B435-11E9-9278-68D0E5697425","grant_number":"P27533_N27","name":"Structure of the Excitation Spectrum for Many-Body Quantum Systems","call_identifier":"FWF"}],"quality_controlled":"1","isi":1,"publication_identifier":{"issn":["0003-9527"],"eissn":["1432-0673"]},"month":"09","oa_version":"Preprint","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"6002","intvolume":" 229","status":"public","title":"The Bogoliubov free energy functional I: Existence of minimizers and phase diagram","issue":"3","abstract":[{"lang":"eng","text":"The Bogoliubov free energy functional is analysed. The functional serves as a model of a translation-invariant Bose gas at positive temperature. We prove the existence of minimizers in the case of repulsive interactions given by a sufficiently regular two-body potential. Furthermore, we prove the existence of a phase transition in this model and provide its phase diagram."}],"type":"journal_article","date_published":"2018-09-01T00:00:00Z","citation":{"chicago":"Napiórkowski, Marcin M, Robin Reuvers, and Jan Philip Solovej. “The Bogoliubov Free Energy Functional I: Existence of Minimizers and Phase Diagram.” Archive for Rational Mechanics and Analysis. Springer Nature, 2018. https://doi.org/10.1007/s00205-018-1232-6.","mla":"Napiórkowski, Marcin M., et al. “The Bogoliubov Free Energy Functional I: Existence of Minimizers and Phase Diagram.” Archive for Rational Mechanics and Analysis, vol. 229, no. 3, Springer Nature, 2018, pp. 1037–90, doi:10.1007/s00205-018-1232-6.","short":"M.M. Napiórkowski, R. Reuvers, J.P. Solovej, Archive for Rational Mechanics and Analysis 229 (2018) 1037–1090.","ista":"Napiórkowski MM, Reuvers R, Solovej JP. 2018. The Bogoliubov free energy functional I: Existence of minimizers and phase diagram. Archive for Rational Mechanics and Analysis. 229(3), 1037–1090.","apa":"Napiórkowski, M. M., Reuvers, R., & Solovej, J. P. (2018). The Bogoliubov free energy functional I: Existence of minimizers and phase diagram. Archive for Rational Mechanics and Analysis. Springer Nature. https://doi.org/10.1007/s00205-018-1232-6","ieee":"M. M. Napiórkowski, R. Reuvers, and J. P. Solovej, “The Bogoliubov free energy functional I: Existence of minimizers and phase diagram,” Archive for Rational Mechanics and Analysis, vol. 229, no. 3. Springer Nature, pp. 1037–1090, 2018.","ama":"Napiórkowski MM, Reuvers R, Solovej JP. The Bogoliubov free energy functional I: Existence of minimizers and phase diagram. Archive for Rational Mechanics and Analysis. 2018;229(3):1037-1090. doi:10.1007/s00205-018-1232-6"},"publication":"Archive for Rational Mechanics and Analysis","page":"1037-1090","article_processing_charge":"No","day":"01","scopus_import":"1"},{"abstract":[{"text":"In pipes, turbulence sets in despite the linear stability of the laminar Hagen–Poiseuille flow. The Reynolds number ( ) for which turbulence first appears in a given experiment – the ‘natural transition point’ – depends on imperfections of the set-up, or, more precisely, on the magnitude of finite amplitude perturbations. At onset, turbulence typically only occupies a certain fraction of the flow, and this fraction equally is found to differ from experiment to experiment. Despite these findings, Reynolds proposed that after sufficiently long times, flows may settle to steady conditions: below a critical velocity, flows should (regardless of initial conditions) always return to laminar, while above this velocity, eddying motion should persist. As will be shown, even in pipes several thousand diameters long, the spatio-temporal intermittent flow patterns observed at the end of the pipe strongly depend on the initial conditions, and there is no indication that different flow patterns would eventually settle to a (statistical) steady state. Exploiting the fact that turbulent puffs do not age (i.e. they are memoryless), we continuously recreate the puff sequence exiting the pipe at the pipe entrance, and in doing so introduce periodic boundary conditions for the puff pattern. This procedure allows us to study the evolution of the flow patterns for arbitrary long times, and we find that after times in excess of advective time units, indeed a statistical steady state is reached. Although the resulting flows remain spatio-temporally intermittent, puff splitting and decay rates eventually reach a balance, so that the turbulent fraction fluctuates around a well-defined level which only depends on . In accordance with Reynolds’ proposition, we find that at lower (here 2020), flows eventually always resume to laminar, while for higher ( ), turbulence persists. The critical point for pipe flow hence falls in the interval of $2020 , which is in very good agreement with the recently proposed value of . The latter estimate was based on single-puff statistics and entirely neglected puff interactions. Unlike in typical contact processes where such interactions strongly affect the percolation threshold, in pipe flow, the critical point is only marginally influenced. Interactions, on the other hand, are responsible for the approach to the statistical steady state. As shown, they strongly affect the resulting flow patterns, where they cause ‘puff clustering’, and these regions of large puff densities are observed to travel across the puff pattern in a wave-like fashion.","lang":"eng"}],"type":"journal_article","oa_version":"Preprint","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"5996","title":"The critical point of the transition to turbulence in pipe flow","status":"public","intvolume":" 839","day":"25","article_processing_charge":"No","scopus_import":"1","date_published":"2018-03-25T00:00:00Z","publication":"Journal of Fluid Mechanics","citation":{"mla":"Vasudevan, Mukund, and Björn Hof. “The Critical Point of the Transition to Turbulence in Pipe Flow.” Journal of Fluid Mechanics, vol. 839, Cambridge University Press, 2018, pp. 76–94, doi:10.1017/jfm.2017.923.","short":"M. Vasudevan, B. Hof, Journal of Fluid Mechanics 839 (2018) 76–94.","chicago":"Vasudevan, Mukund, and Björn Hof. “The Critical Point of the Transition to Turbulence in Pipe Flow.” Journal of Fluid Mechanics. Cambridge University Press, 2018. https://doi.org/10.1017/jfm.2017.923.","ama":"Vasudevan M, Hof B. The critical point of the transition to turbulence in pipe flow. Journal of Fluid Mechanics. 2018;839:76-94. doi:10.1017/jfm.2017.923","ista":"Vasudevan M, Hof B. 2018. The critical point of the transition to turbulence in pipe flow. Journal of Fluid Mechanics. 839, 76–94.","ieee":"M. Vasudevan and B. Hof, “The critical point of the transition to turbulence in pipe flow,” Journal of Fluid Mechanics, vol. 839. Cambridge University Press, pp. 76–94, 2018.","apa":"Vasudevan, M., & Hof, B. (2018). The critical point of the transition to turbulence in pipe flow. Journal of Fluid Mechanics. Cambridge University Press. https://doi.org/10.1017/jfm.2017.923"},"article_type":"original","page":"76-94","ec_funded":1,"author":[{"full_name":"Vasudevan, Mukund","id":"3C5A959A-F248-11E8-B48F-1D18A9856A87","last_name":"Vasudevan","first_name":"Mukund"},{"first_name":"Björn","last_name":"Hof","id":"3A374330-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2057-2754","full_name":"Hof, Björn"}],"date_created":"2019-02-14T12:50:50Z","date_updated":"2023-09-19T14:37:49Z","volume":839,"year":"2018","acknowledgement":" We also thank Philipp Maier and the IST Austria workshop for theirdedicated technical support","publication_status":"published","publisher":"Cambridge University Press","department":[{"_id":"BjHo"}],"month":"03","publication_identifier":{"issn":["0022-1120"],"eissn":["1469-7645"]},"doi":"10.1017/jfm.2017.923","language":[{"iso":"eng"}],"oa":1,"external_id":{"isi":["000437858300003"],"arxiv":["1709.06372"]},"main_file_link":[{"url":"https://arxiv.org/abs/1709.06372","open_access":"1"}],"quality_controlled":"1","isi":1,"project":[{"grant_number":"306589","_id":"25152F3A-B435-11E9-9278-68D0E5697425","name":"Decoding the complexity of turbulence at its origin","call_identifier":"FP7"}]},{"language":[{"iso":"eng"}],"doi":"10.1145/3174800","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7"}],"isi":1,"quality_controlled":"1","main_file_link":[{"url":"https://arxiv.org/abs/1510.08517","open_access":"1"}],"external_id":{"arxiv":["1510.08517"],"isi":["000434634500003"]},"oa":1,"publication_identifier":{"issn":["0164-0925"]},"month":"06","volume":40,"date_updated":"2023-09-19T14:38:42Z","date_created":"2019-02-14T12:29:10Z","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"1438"}]},"author":[{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"id":"3AAD03D6-F248-11E8-B48F-1D18A9856A87","first_name":"Hongfei","last_name":"Fu","full_name":"Fu, Hongfei"},{"first_name":"Petr","last_name":"Novotný","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","full_name":"Novotný, Petr"},{"full_name":"Hasheminezhad, Rouzbeh","first_name":"Rouzbeh","last_name":"Hasheminezhad"}],"publisher":"Association for Computing Machinery (ACM)","department":[{"_id":"KrCh"}],"publication_status":"published","year":"2018","ec_funded":1,"article_number":"7","date_published":"2018-06-01T00:00:00Z","citation":{"ista":"Chatterjee K, Fu H, Novotný P, Hasheminezhad R. 2018. Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs. ACM Transactions on Programming Languages and Systems. 40(2), 7.","ieee":"K. Chatterjee, H. Fu, P. Novotný, and R. Hasheminezhad, “Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs,” ACM Transactions on Programming Languages and Systems, vol. 40, no. 2. Association for Computing Machinery (ACM), 2018.","apa":"Chatterjee, K., Fu, H., Novotný, P., & Hasheminezhad, R. (2018). Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs. ACM Transactions on Programming Languages and Systems. Association for Computing Machinery (ACM). https://doi.org/10.1145/3174800","ama":"Chatterjee K, Fu H, Novotný P, Hasheminezhad R. Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs. ACM Transactions on Programming Languages and Systems. 2018;40(2). doi:10.1145/3174800","chicago":"Chatterjee, Krishnendu, Hongfei Fu, Petr Novotný, and Rouzbeh Hasheminezhad. “Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs.” ACM Transactions on Programming Languages and Systems. Association for Computing Machinery (ACM), 2018. https://doi.org/10.1145/3174800.","mla":"Chatterjee, Krishnendu, et al. “Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs.” ACM Transactions on Programming Languages and Systems, vol. 40, no. 2, 7, Association for Computing Machinery (ACM), 2018, doi:10.1145/3174800.","short":"K. Chatterjee, H. Fu, P. Novotný, R. Hasheminezhad, ACM Transactions on Programming Languages and Systems 40 (2018)."},"publication":"ACM Transactions on Programming Languages and Systems","article_processing_charge":"No","day":"01","scopus_import":"1","oa_version":"Submitted Version","intvolume":" 40","title":"Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs","status":"public","_id":"5993","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","issue":"2","abstract":[{"text":"In this article, we consider the termination problem of probabilistic programs with real-valued variables. Thequestions concerned are: qualitative ones that ask (i) whether the program terminates with probability 1(almost-sure termination) and (ii) whether the expected termination time is finite (finite termination); andquantitative ones that ask (i) to approximate the expected termination time (expectation problem) and (ii) tocompute a boundBsuch that the probability not to terminate afterBsteps decreases exponentially (con-centration problem). To solve these questions, we utilize the notion of ranking supermartingales, which isa powerful approach for proving termination of probabilistic programs. In detail, we focus on algorithmicsynthesis of linear ranking-supermartingales over affine probabilistic programs (Apps) with both angelic anddemonic non-determinism. An important subclass of Apps is LRApp which is defined as the class of all Appsover which a linear ranking-supermartingale exists.Our main contributions are as follows. Firstly, we show that the membership problem of LRApp (i) canbe decided in polynomial time for Apps with at most demonic non-determinism, and (ii) isNP-hard and inPSPACEfor Apps with angelic non-determinism. Moreover, theNP-hardness result holds already for Appswithout probability and demonic non-determinism. Secondly, we show that the concentration problem overLRApp can be solved in the same complexity as for the membership problem of LRApp. Finally, we show thatthe expectation problem over LRApp can be solved in2EXPTIMEand isPSPACE-hard even for Apps withoutprobability and non-determinism (i.e., deterministic programs). Our experimental results demonstrate theeffectiveness of our approach to answer the qualitative and quantitative questions over Apps with at mostdemonic non-determinism.","lang":"eng"}],"type":"journal_article"},{"scopus_import":"1","day":"01","article_processing_charge":"No","page":"1029-1074","publication":"Proceedings of the London Mathematical Society","citation":{"mla":"Yang, Yaping, and Gufang Zhao. “The Cohomological Hall Algebra of a Preprojective Algebra.” Proceedings of the London Mathematical Society, vol. 116, no. 5, Oxford University Press, 2018, pp. 1029–74, doi:10.1112/plms.12111.","short":"Y. Yang, G. Zhao, Proceedings of the London Mathematical Society 116 (2018) 1029–1074.","chicago":"Yang, Yaping, and Gufang Zhao. “The Cohomological Hall Algebra of a Preprojective Algebra.” Proceedings of the London Mathematical Society. Oxford University Press, 2018. https://doi.org/10.1112/plms.12111.","ama":"Yang Y, Zhao G. The cohomological Hall algebra of a preprojective algebra. Proceedings of the London Mathematical Society. 2018;116(5):1029-1074. doi:10.1112/plms.12111","ista":"Yang Y, Zhao G. 2018. The cohomological Hall algebra of a preprojective algebra. Proceedings of the London Mathematical Society. 116(5), 1029–1074.","apa":"Yang, Y., & Zhao, G. (2018). The cohomological Hall algebra of a preprojective algebra. Proceedings of the London Mathematical Society. Oxford University Press. https://doi.org/10.1112/plms.12111","ieee":"Y. Yang and G. Zhao, “The cohomological Hall algebra of a preprojective algebra,” Proceedings of the London Mathematical Society, vol. 116, no. 5. Oxford University Press, pp. 1029–1074, 2018."},"date_published":"2018-05-01T00:00:00Z","type":"journal_article","abstract":[{"lang":"eng","text":"We introduce for each quiver Q and each algebraic oriented cohomology theory A, the cohomological Hall algebra (CoHA) of Q, as the A-homology of the moduli of representations of the preprojective algebra of Q. This generalizes the K-theoretic Hall algebra of commuting varieties defined by Schiffmann-Vasserot. When A is the Morava K-theory, we show evidence that this algebra is a candidate for Lusztig's reformulated conjecture on modular representations of algebraic groups.\r\nWe construct an action of the preprojective CoHA on the A-homology of Nakajima quiver varieties. We compare this with the action of the Borel subalgebra of Yangian when A is the intersection theory. We also give a shuffle algebra description of this CoHA in terms of the underlying formal group law of A. As applications, we obtain a shuffle description of the Yangian. "}],"issue":"5","status":"public","title":"The cohomological Hall algebra of a preprojective algebra","intvolume":" 116","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"5999","oa_version":"Preprint","month":"05","publication_identifier":{"issn":["0024-6115"]},"quality_controlled":"1","isi":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1407.7994"}],"oa":1,"external_id":{"arxiv":["1407.7994"],"isi":["000431506400001"]},"language":[{"iso":"eng"}],"doi":"10.1112/plms.12111","publication_status":"published","department":[{"_id":"TaHa"}],"publisher":"Oxford University Press","year":"2018","date_created":"2019-02-14T13:14:22Z","date_updated":"2023-09-19T14:37:19Z","volume":116,"author":[{"full_name":"Yang, Yaping","first_name":"Yaping","last_name":"Yang"},{"full_name":"Zhao, Gufang","first_name":"Gufang","last_name":"Zhao","id":"2BC2AC5E-F248-11E8-B48F-1D18A9856A87"}]},{"article_processing_charge":"No","has_accepted_license":"1","day":"01","scopus_import":"1","date_published":"2018-03-01T00:00:00Z","page":"840-856","citation":{"ama":"Kincaid-Smith J, Picard MAL, Cosseau C, et al. Parent-of-Origin-Dependent Gene Expression in Male and Female Schistosome Parasites. Genome Biology and Evolution. 2018;10(3):840-856. doi:10.1093/gbe/evy037","ista":"Kincaid-Smith J, Picard MAL, Cosseau C, Boissier J, Severac D, Grunau C, Toulza E. 2018. Parent-of-Origin-Dependent Gene Expression in Male and Female Schistosome Parasites. Genome Biology and Evolution. 10(3), 840–856.","ieee":"J. Kincaid-Smith et al., “Parent-of-Origin-Dependent Gene Expression in Male and Female Schistosome Parasites,” Genome Biology and Evolution, vol. 10, no. 3. Oxford University Press, pp. 840–856, 2018.","apa":"Kincaid-Smith, J., Picard, M. A. L., Cosseau, C., Boissier, J., Severac, D., Grunau, C., & Toulza, E. (2018). Parent-of-Origin-Dependent Gene Expression in Male and Female Schistosome Parasites. Genome Biology and Evolution. Oxford University Press. https://doi.org/10.1093/gbe/evy037","mla":"Kincaid-Smith, Julien, et al. “Parent-of-Origin-Dependent Gene Expression in Male and Female Schistosome Parasites.” Genome Biology and Evolution, vol. 10, no. 3, Oxford University Press, 2018, pp. 840–56, doi:10.1093/gbe/evy037.","short":"J. Kincaid-Smith, M.A.L. Picard, C. Cosseau, J. Boissier, D. Severac, C. Grunau, E. Toulza, Genome Biology and Evolution 10 (2018) 840–856.","chicago":"Kincaid-Smith, Julien, Marion A L Picard, Céline Cosseau, Jérôme Boissier, Dany Severac, Christoph Grunau, and Eve Toulza. “Parent-of-Origin-Dependent Gene Expression in Male and Female Schistosome Parasites.” Genome Biology and Evolution. Oxford University Press, 2018. https://doi.org/10.1093/gbe/evy037."},"publication":"Genome Biology and Evolution","issue":"3","abstract":[{"text":"Schistosomes are the causative agents of schistosomiasis, a neglected tropical disease affecting over 230 million people worldwide.Additionally to their major impact on human health, they are also models of choice in evolutionary biology. These parasitic flatwormsare unique among the common hermaphroditic trematodes as they have separate sexes. This so-called “evolutionary scandal”displays a female heterogametic genetic sex-determination system (ZZ males and ZW females), as well as a pronounced adult sexualdimorphism. These phenotypic differences are determined by a shared set of genes in both sexes, potentially leading to intralocussexual conflicts. To resolve these conflicts in sexually selected traits, molecular mechanisms such as sex-biased gene expression couldoccur, but parent-of-origin gene expression also provides an alternative. In this work we investigated the latter mechanism, that is,genes expressed preferentially from either the maternal or the paternal allele, inSchistosoma mansonispecies. To this end, tran-scriptomes from male and female hybrid adults obtained by strain crosses were sequenced. Strain-specific single nucleotide poly-morphism (SNP) markers allowed us to discriminate the parental origin, while reciprocal crosses helped to differentiate parentalexpression from strain-specific expression. We identified genes containing SNPs expressed in a parent-of-origin manner consistentwith paternal and maternal imprints. Although the majority of the SNPs was identified in mitochondrial and Z-specific loci, theremaining SNPs found in male and female transcriptomes were situated in genes that have the potential to explain sexual differencesin schistosome parasites. Furthermore, we identified and validated four new Z-specific scaffolds.","lang":"eng"}],"type":"journal_article","file":[{"file_name":"2018_GBE_Kincaid_Smith.pdf","access_level":"open_access","content_type":"application/pdf","file_size":529755,"creator":"dernst","relation":"main_file","file_id":"5991","date_updated":"2020-07-14T12:47:15Z","date_created":"2019-02-14T12:20:01Z","checksum":"736a459cb77de5824354466bb0331caf"}],"oa_version":"Published Version","intvolume":" 10","status":"public","ddc":["570"],"title":"Parent-of-Origin-Dependent Gene Expression in Male and Female Schistosome Parasites","_id":"5989","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publication_identifier":{"issn":["1759-6653"]},"month":"03","language":[{"iso":"eng"}],"doi":"10.1093/gbe/evy037","quality_controlled":"1","isi":1,"oa":1,"tmp":{"name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png","short":"CC BY-NC (4.0)"},"external_id":{"isi":["000429483700013"]},"file_date_updated":"2020-07-14T12:47:15Z","volume":10,"date_updated":"2023-09-19T14:39:08Z","date_created":"2019-02-14T12:13:52Z","author":[{"first_name":"Julien","last_name":"Kincaid-Smith","full_name":"Kincaid-Smith, Julien"},{"last_name":"Picard","first_name":"Marion A L","orcid":"0000-0002-8101-2518","id":"2C921A7A-F248-11E8-B48F-1D18A9856A87","full_name":"Picard, Marion A L"},{"full_name":"Cosseau, Céline","first_name":"Céline","last_name":"Cosseau"},{"first_name":"Jérôme","last_name":"Boissier","full_name":"Boissier, Jérôme"},{"full_name":"Severac, Dany","last_name":"Severac","first_name":"Dany"},{"first_name":"Christoph","last_name":"Grunau","full_name":"Grunau, Christoph"},{"last_name":"Toulza","first_name":"Eve","full_name":"Toulza, Eve"}],"department":[{"_id":"BeVi"}],"publisher":"Oxford University Press","publication_status":"published","year":"2018"},{"year":"2018","_id":"6031","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","status":"public","title":"Fast quantized arithmetic on x86: Trading compute for data movement","publication_status":"published","department":[{"_id":"DaAl"}],"publisher":"IEEE","author":[{"first_name":"Alen","last_name":"Stojanov","full_name":"Stojanov, Alen"},{"last_name":"Smith","first_name":"Tyler Michael","full_name":"Smith, Tyler Michael"},{"full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","last_name":"Alistarh"},{"full_name":"Puschel, Markus","last_name":"Puschel","first_name":"Markus"}],"date_created":"2019-02-17T22:59:25Z","date_updated":"2023-09-19T14:41:51Z","volume":"2018-October","oa_version":"None","article_number":"8598402","type":"conference","abstract":[{"text":"We introduce Clover, a new library for efficient computation using low-precision data, providing mathematical routines required by fundamental methods in optimization and sparse recovery. Our library faithfully implements variants of stochastic quantization that guarantee convergence at low precision, and supports data formats from 4-bit quantized to 32-bit IEEE-754 on current Intel processors. In particular, we show that 4-bit can be implemented efficiently using Intel AVX despite the lack of native support for this data format. Experimental results with dot product, matrix-vector multiplication (MVM), gradient descent (GD), and iterative hard thresholding (IHT) demonstrate that the attainable speedups are in many cases close to linear with respect to the reduction of precision due to reduced data movement. Finally, for GD and IHT, we show examples of absolute speedup achieved by 4-bit versus 32-bit, by iterating until a given target error is achieved.","lang":"eng"}],"publication":"2018 IEEE International Workshop on Signal Processing Systems","citation":{"ieee":"A. Stojanov, T. M. Smith, D.-A. Alistarh, and M. Puschel, “Fast quantized arithmetic on x86: Trading compute for data movement,” in 2018 IEEE International Workshop on Signal Processing Systems, Cape Town, South Africa, 2018, vol. 2018–October.","apa":"Stojanov, A., Smith, T. M., Alistarh, D.-A., & Puschel, M. (2018). Fast quantized arithmetic on x86: Trading compute for data movement. In 2018 IEEE International Workshop on Signal Processing Systems (Vol. 2018–October). Cape Town, South Africa: IEEE. https://doi.org/10.1109/SiPS.2018.8598402","ista":"Stojanov A, Smith TM, Alistarh D-A, Puschel M. 2018. Fast quantized arithmetic on x86: Trading compute for data movement. 2018 IEEE International Workshop on Signal Processing Systems. SiPS: Workshop on Signal Processing Systems vol. 2018–October, 8598402.","ama":"Stojanov A, Smith TM, Alistarh D-A, Puschel M. Fast quantized arithmetic on x86: Trading compute for data movement. In: 2018 IEEE International Workshop on Signal Processing Systems. Vol 2018-October. IEEE; 2018. doi:10.1109/SiPS.2018.8598402","chicago":"Stojanov, Alen, Tyler Michael Smith, Dan-Adrian Alistarh, and Markus Puschel. “Fast Quantized Arithmetic on X86: Trading Compute for Data Movement.” In 2018 IEEE International Workshop on Signal Processing Systems, Vol. 2018–October. IEEE, 2018. https://doi.org/10.1109/SiPS.2018.8598402.","short":"A. Stojanov, T.M. Smith, D.-A. Alistarh, M. Puschel, in:, 2018 IEEE International Workshop on Signal Processing Systems, IEEE, 2018.","mla":"Stojanov, Alen, et al. “Fast Quantized Arithmetic on X86: Trading Compute for Data Movement.” 2018 IEEE International Workshop on Signal Processing Systems, vol. 2018–October, 8598402, IEEE, 2018, doi:10.1109/SiPS.2018.8598402."},"external_id":{"isi":["000465106800060"]},"isi":1,"quality_controlled":"1","conference":{"name":"SiPS: Workshop on Signal Processing Systems","end_date":"2018-10-24","start_date":"2018-10-21","location":"Cape Town, South Africa"},"doi":"10.1109/SiPS.2018.8598402","date_published":"2018-12-31T00:00:00Z","language":[{"iso":"eng"}],"scopus_import":"1","month":"12","day":"31","article_processing_charge":"No"},{"date_updated":"2023-09-19T14:44:59Z","date_created":"2018-12-11T11:44:13Z","volume":"2018-July","author":[{"first_name":"Karel","last_name":"Horák","full_name":"Horák, Karel"},{"last_name":"Bošanský","first_name":"Branislav","full_name":"Bošanský, Branislav"},{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"}],"publication_status":"published","publisher":"IJCAI","department":[{"_id":"KrCh"}],"acknowledgement":"∗This work has been supported by Vienna Science and Technology Fund (WWTF) Project ICT15-003, Austrian Science Fund (FWF) NFN Grant No S11407-N23 (RiSE/SHiNE), and ERC Starting grant (279307: Graph Games). This research was sponsored by the Army Research Laboratory and was accomplished under Cooperative Agreement Number W911NF-13-2-0045 (ARL Cyber Security CRA). ","year":"2018","publist_id":"8030","ec_funded":1,"language":[{"iso":"eng"}],"conference":{"name":"IJCAI: International Joint Conference on Artificial Intelligence","start_date":"2018-07-13","location":"Stockholm, Sweden","end_date":"2018-07-19"},"doi":"10.24963/ijcai.2018/662","quality_controlled":"1","isi":1,"project":[{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.24963/ijcai.2018/662"}],"oa":1,"external_id":{"isi":["000764175404127"]},"month":"07","oa_version":"Published Version","status":"public","title":"Goal-HSVI: Heuristic search value iteration for goal-POMDPs","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"25","abstract":[{"lang":"eng","text":"Partially observable Markov decision processes (POMDPs) are the standard models for planning under uncertainty with both finite and infinite horizon. Besides the well-known discounted-sum objective, indefinite-horizon objective (aka Goal-POMDPs) is another classical objective for POMDPs. In this case, given a set of target states and a positive cost for each transition, the optimization objective is to minimize the expected total cost until a target state is reached. In the literature, RTDP-Bel or heuristic search value iteration (HSVI) have been used for solving Goal-POMDPs. Neither of these algorithms has theoretical convergence guarantees, and HSVI may even fail to terminate its trials. We give the following contributions: (1) We discuss the challenges introduced in Goal-POMDPs and illustrate how they prevent the original HSVI from converging. (2) We present a novel algorithm inspired by HSVI, termed Goal-HSVI, and show that our algorithm has convergence guarantees. (3) We show that Goal-HSVI outperforms RTDP-Bel on a set of well-known examples."}],"type":"conference","date_published":"2018-07-01T00:00:00Z","page":"4764 - 4770","publication":"Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence","citation":{"ista":"Horák K, Bošanský B, Chatterjee K. 2018. Goal-HSVI: Heuristic search value iteration for goal-POMDPs. Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence. IJCAI: International Joint Conference on Artificial Intelligence vol. 2018–July, 4764–4770.","ieee":"K. Horák, B. Bošanský, and K. Chatterjee, “Goal-HSVI: Heuristic search value iteration for goal-POMDPs,” in Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, Stockholm, Sweden, 2018, vol. 2018–July, pp. 4764–4770.","apa":"Horák, K., Bošanský, B., & Chatterjee, K. (2018). Goal-HSVI: Heuristic search value iteration for goal-POMDPs. In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence (Vol. 2018–July, pp. 4764–4770). Stockholm, Sweden: IJCAI. https://doi.org/10.24963/ijcai.2018/662","ama":"Horák K, Bošanský B, Chatterjee K. Goal-HSVI: Heuristic search value iteration for goal-POMDPs. In: Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence. Vol 2018-July. IJCAI; 2018:4764-4770. doi:10.24963/ijcai.2018/662","chicago":"Horák, Karel, Branislav Bošanský, and Krishnendu Chatterjee. “Goal-HSVI: Heuristic Search Value Iteration for Goal-POMDPs.” In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018–July:4764–70. IJCAI, 2018. https://doi.org/10.24963/ijcai.2018/662.","mla":"Horák, Karel, et al. “Goal-HSVI: Heuristic Search Value Iteration for Goal-POMDPs.” Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, vol. 2018–July, IJCAI, 2018, pp. 4764–70, doi:10.24963/ijcai.2018/662.","short":"K. Horák, B. Bošanský, K. Chatterjee, in:, Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI, 2018, pp. 4764–4770."},"day":"01","article_processing_charge":"No","scopus_import":"1"},{"date_published":"2018-07-01T00:00:00Z","page":"4692 - 4699","citation":{"chicago":"Chatterjee, Krishnendu, Adrian Elgyütt, Petr Novotný, and Owen Rouillé. “Expectation Optimization with Probabilistic Guarantees in POMDPs with Discounted-Sum Objectives,” 2018:4692–99. IJCAI, 2018. https://doi.org/10.24963/ijcai.2018/652.","short":"K. Chatterjee, A. Elgyütt, P. Novotný, O. Rouillé, in:, IJCAI, 2018, pp. 4692–4699.","mla":"Chatterjee, Krishnendu, et al. Expectation Optimization with Probabilistic Guarantees in POMDPs with Discounted-Sum Objectives. Vol. 2018, IJCAI, 2018, pp. 4692–99, doi:10.24963/ijcai.2018/652.","ieee":"K. Chatterjee, A. Elgyütt, P. Novotný, and O. Rouillé, “Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives,” presented at the IJCAI: International Joint Conference on Artificial Intelligence, Stockholm, Sweden, 2018, vol. 2018, pp. 4692–4699.","apa":"Chatterjee, K., Elgyütt, A., Novotný, P., & Rouillé, O. (2018). Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives (Vol. 2018, pp. 4692–4699). Presented at the IJCAI: International Joint Conference on Artificial Intelligence, Stockholm, Sweden: IJCAI. https://doi.org/10.24963/ijcai.2018/652","ista":"Chatterjee K, Elgyütt A, Novotný P, Rouillé O. 2018. Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives. IJCAI: International Joint Conference on Artificial Intelligence vol. 2018, 4692–4699.","ama":"Chatterjee K, Elgyütt A, Novotný P, Rouillé O. Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives. In: Vol 2018. IJCAI; 2018:4692-4699. doi:10.24963/ijcai.2018/652"},"article_processing_charge":"No","day":"01","scopus_import":"1","oa_version":"Preprint","intvolume":" 2018","title":"Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives","status":"public","_id":"24","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","abstract":[{"text":"Partially-observable Markov decision processes (POMDPs) with discounted-sum payoff are a standard framework to model a wide range of problems related to decision making under uncertainty. Traditionally, the goal has been to obtain policies that optimize the expectation of the discounted-sum payoff. A key drawback of the expectation measure is that even low probability events with extreme payoff can significantly affect the expectation, and thus the obtained policies are not necessarily risk-averse. An alternate approach is to optimize the probability that the payoff is above a certain threshold, which allows obtaining risk-averse policies, but ignores optimization of the expectation. We consider the expectation optimization with probabilistic guarantee (EOPG) problem, where the goal is to optimize the expectation ensuring that the payoff is above a given threshold with at least a specified probability. We present several results on the EOPG problem, including the first algorithm to solve it.","lang":"eng"}],"type":"conference","language":[{"iso":"eng"}],"doi":"10.24963/ijcai.2018/652","conference":{"name":"IJCAI: International Joint Conference on Artificial Intelligence","start_date":"2018-07-13","location":"Stockholm, Sweden","end_date":"2018-07-19"},"project":[{"grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification"},{"name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"}],"isi":1,"quality_controlled":"1","external_id":{"isi":["000764175404117"],"arxiv":["1804.10601"]},"oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1804.10601"}],"month":"07","volume":2018,"date_updated":"2023-09-19T14:45:48Z","date_created":"2018-12-11T11:44:13Z","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"id":"4A2E9DBA-F248-11E8-B48F-1D18A9856A87","first_name":"Adrian","last_name":"Elgyütt","full_name":"Elgyütt, Adrian"},{"id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","last_name":"Novotny","first_name":"Petr","full_name":"Novotny, Petr"},{"full_name":"Rouillé, Owen","last_name":"Rouillé","first_name":"Owen"}],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publisher":"IJCAI","publication_status":"published","acknowledgement":"This research was supported by the Vienna Science and Technology Fund (WWTF) grant ICT15-003; Austrian Science Fund (FWF): S11407-N23(RiSE/SHiNE);and an ERC Start Grant (279307:Graph Games).\r\n","year":"2018","publist_id":"8031","ec_funded":1},{"abstract":[{"lang":"eng","text":"Partially observable Markov decision processes (POMDPs) are widely used in probabilistic planning problems in which an agent interacts with an environment using noisy and imprecise sensors. We study a setting in which the sensors are only partially defined and the goal is to synthesize “weakest” additional sensors, such that in the resulting POMDP, there is a small-memory policy for the agent that almost-surely (with probability 1) satisfies a reachability objective. We show that the problem is NP-complete, and present a symbolic algorithm by encoding the problem into SAT instances. We illustrate trade-offs between the amount of memory of the policy and the number of additional sensors on a simple example. We have implemented our approach and consider three classical POMDP examples from the literature, and show that in all the examples the number of sensors can be significantly decreased (as compared to the existing solutions in the literature) without increasing the complexity of the policies."}],"alternative_title":["ICAPS"],"type":"conference","oa_version":"Preprint","title":"Sensor synthesis for POMDPs with reachability objectives","status":"public","intvolume":" 2018","_id":"34","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","day":"01","article_processing_charge":"No","scopus_import":"1","date_published":"2018-06-01T00:00:00Z","page":"47 - 55","citation":{"chicago":"Chatterjee, Krishnendu, Martin Chemlík, and Ufuk Topcu. “Sensor Synthesis for POMDPs with Reachability Objectives,” 2018:47–55. AAAI Press, 2018.","mla":"Chatterjee, Krishnendu, et al. Sensor Synthesis for POMDPs with Reachability Objectives. Vol. 2018, AAAI Press, 2018, pp. 47–55.","short":"K. Chatterjee, M. Chemlík, U. Topcu, in:, AAAI Press, 2018, pp. 47–55.","ista":"Chatterjee K, Chemlík M, Topcu U. 2018. Sensor synthesis for POMDPs with reachability objectives. ICAPS: International Conference on Automated Planning and Scheduling, ICAPS, vol. 2018, 47–55.","ieee":"K. Chatterjee, M. Chemlík, and U. Topcu, “Sensor synthesis for POMDPs with reachability objectives,” presented at the ICAPS: International Conference on Automated Planning and Scheduling, Delft, Netherlands, 2018, vol. 2018, pp. 47–55.","apa":"Chatterjee, K., Chemlík, M., & Topcu, U. (2018). Sensor synthesis for POMDPs with reachability objectives (Vol. 2018, pp. 47–55). Presented at the ICAPS: International Conference on Automated Planning and Scheduling, Delft, Netherlands: AAAI Press.","ama":"Chatterjee K, Chemlík M, Topcu U. Sensor synthesis for POMDPs with reachability objectives. In: Vol 2018. AAAI Press; 2018:47-55."},"ec_funded":1,"publist_id":"8021","date_created":"2018-12-11T11:44:16Z","date_updated":"2023-09-19T14:44:14Z","volume":2018,"author":[{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"first_name":"Martin","last_name":"Chemlík","full_name":"Chemlík, Martin"},{"last_name":"Topcu","first_name":"Ufuk","full_name":"Topcu, Ufuk"}],"publication_status":"published","department":[{"_id":"KrCh"}],"publisher":"AAAI Press","year":"2018","month":"06","language":[{"iso":"eng"}],"conference":{"end_date":"2018-06-29","location":"Delft, Netherlands","start_date":"2018-06-24","name":"ICAPS: International Conference on Automated Planning and Scheduling"},"isi":1,"quality_controlled":"1","project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"main_file_link":[{"url":"https://arxiv.org/abs/1710.00675","open_access":"1"}],"external_id":{"isi":["000492986200006"],"arxiv":["1710.00675"]},"oa":1},{"oa_version":"Preprint","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"18","status":"public","title":"Superconcentrators of density 25.3","intvolume":" 141","abstract":[{"text":"An N-superconcentrator is a directed, acyclic graph with N input nodes and N output nodes such that every subset of the inputs and every subset of the outputs of same cardinality can be connected by node-disjoint paths. It is known that linear-size and bounded-degree superconcentrators exist. We prove the existence of such superconcentrators with asymptotic density 25.3 (where the density is the number of edges divided by N). The previously best known densities were 28 [12] and 27.4136 [17].","lang":"eng"}],"issue":"10","type":"journal_article","date_published":"2018-10-01T00:00:00Z","publication":"Ars Combinatoria","citation":{"chicago":"Kolmogorov, Vladimir, and Michal Rolinek. “Superconcentrators of Density 25.3.” Ars Combinatoria. Charles Babbage Research Centre, 2018.","short":"V. Kolmogorov, M. Rolinek, Ars Combinatoria 141 (2018) 269–304.","mla":"Kolmogorov, Vladimir, and Michal Rolinek. “Superconcentrators of Density 25.3.” Ars Combinatoria, vol. 141, no. 10, Charles Babbage Research Centre, 2018, pp. 269–304.","apa":"Kolmogorov, V., & Rolinek, M. (2018). Superconcentrators of density 25.3. Ars Combinatoria. Charles Babbage Research Centre.","ieee":"V. Kolmogorov and M. Rolinek, “Superconcentrators of density 25.3,” Ars Combinatoria, vol. 141, no. 10. Charles Babbage Research Centre, pp. 269–304, 2018.","ista":"Kolmogorov V, Rolinek M. 2018. Superconcentrators of density 25.3. Ars Combinatoria. 141(10), 269–304.","ama":"Kolmogorov V, Rolinek M. Superconcentrators of density 25.3. Ars Combinatoria. 2018;141(10):269-304."},"page":"269 - 304","day":"01","article_processing_charge":"No","scopus_import":"1","author":[{"last_name":"Kolmogorov","first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Kolmogorov, Vladimir"},{"first_name":"Michal","last_name":"Rolinek","id":"3CB3BC06-F248-11E8-B48F-1D18A9856A87","full_name":"Rolinek, Michal"}],"date_updated":"2023-09-19T14:46:18Z","date_created":"2018-12-11T11:44:11Z","volume":141,"year":"2018","publication_status":"published","publisher":"Charles Babbage Research Centre","department":[{"_id":"VlKo"}],"publist_id":"8037","language":[{"iso":"eng"}],"oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1405.7828"}],"external_id":{"arxiv":["1405.7828"],"isi":["000446809500022"]},"isi":1,"quality_controlled":"1","month":"10","publication_identifier":{"issn":["0381-7032"]}},{"_id":"6355","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","status":"public","ddc":["510"],"title":"Any cyclic quadrilateral can be inscribed in any closed convex smooth curve","intvolume":" 6","oa_version":"Published Version","file":[{"access_level":"open_access","file_name":"2018_ForumMahtematics_Akopyan.pdf","creator":"dernst","content_type":"application/pdf","file_size":249246,"file_id":"6356","relation":"main_file","checksum":"5a71b24ba712a3eb2e46165a38fbc30a","date_created":"2019-04-30T06:14:58Z","date_updated":"2020-07-14T12:47:28Z"}],"type":"journal_article","abstract":[{"text":"We prove that any cyclic quadrilateral can be inscribed in any closed convex C1-curve. The smoothness condition is not required if the quadrilateral is a rectangle.","lang":"eng"}],"publication":"Forum of Mathematics, Sigma","citation":{"short":"A. Akopyan, S. Avvakumov, Forum of Mathematics, Sigma 6 (2018).","mla":"Akopyan, Arseniy, and Sergey Avvakumov. “Any Cyclic Quadrilateral Can Be Inscribed in Any Closed Convex Smooth Curve.” Forum of Mathematics, Sigma, vol. 6, e7, Cambridge University Press, 2018, doi:10.1017/fms.2018.7.","chicago":"Akopyan, Arseniy, and Sergey Avvakumov. “Any Cyclic Quadrilateral Can Be Inscribed in Any Closed Convex Smooth Curve.” Forum of Mathematics, Sigma. Cambridge University Press, 2018. https://doi.org/10.1017/fms.2018.7.","ama":"Akopyan A, Avvakumov S. Any cyclic quadrilateral can be inscribed in any closed convex smooth curve. Forum of Mathematics, Sigma. 2018;6. doi:10.1017/fms.2018.7","apa":"Akopyan, A., & Avvakumov, S. (2018). Any cyclic quadrilateral can be inscribed in any closed convex smooth curve. Forum of Mathematics, Sigma. Cambridge University Press. https://doi.org/10.1017/fms.2018.7","ieee":"A. Akopyan and S. Avvakumov, “Any cyclic quadrilateral can be inscribed in any closed convex smooth curve,” Forum of Mathematics, Sigma, vol. 6. Cambridge University Press, 2018.","ista":"Akopyan A, Avvakumov S. 2018. Any cyclic quadrilateral can be inscribed in any closed convex smooth curve. Forum of Mathematics, Sigma. 6, e7."},"date_published":"2018-05-31T00:00:00Z","day":"31","article_processing_charge":"No","has_accepted_license":"1","year":"2018","publication_status":"published","publisher":"Cambridge University Press","department":[{"_id":"UlWa"},{"_id":"HeEd"},{"_id":"JaMa"}],"author":[{"first_name":"Arseniy","last_name":"Akopyan","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2548-617X","full_name":"Akopyan, Arseniy"},{"full_name":"Avvakumov, Sergey","id":"3827DAC8-F248-11E8-B48F-1D18A9856A87","last_name":"Avvakumov","first_name":"Sergey"}],"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"8156"}]},"date_updated":"2023-09-19T14:50:12Z","date_created":"2019-04-30T06:09:57Z","volume":6,"article_number":"e7","file_date_updated":"2020-07-14T12:47:28Z","ec_funded":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"arxiv":["1712.10205"],"isi":["000433915500001"]},"oa":1,"isi":1,"quality_controlled":"1","project":[{"_id":"256E75B8-B435-11E9-9278-68D0E5697425","grant_number":"716117","call_identifier":"H2020","name":"Optimal Transport and Stochastic Dynamics"}],"doi":"10.1017/fms.2018.7","language":[{"iso":"eng"}],"month":"05","publication_identifier":{"issn":["2050-5094"]}},{"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"6195","year":"2018","department":[{"_id":"BeBi"}],"publisher":"IEEE","title":"Efficient FEM-based simulation of soft robots modeled as kinematic chains","status":"public","publication_status":"published","author":[{"first_name":"Maria","last_name":"Pozzi","full_name":"Pozzi, Maria"},{"first_name":"Eder","last_name":"Miguel Villalba","id":"3FB91342-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5665-0430","full_name":"Miguel Villalba, Eder"},{"full_name":"Deimel, Raphael","first_name":"Raphael","last_name":"Deimel"},{"last_name":"Malvezzi","first_name":"Monica","full_name":"Malvezzi, Monica"},{"full_name":"Bickel, Bernd","last_name":"Bickel","first_name":"Bernd","orcid":"0000-0001-6511-9385","id":"49876194-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Brock, Oliver","last_name":"Brock","first_name":"Oliver"},{"last_name":"Prattichizzo","first_name":"Domenico","full_name":"Prattichizzo, Domenico"}],"oa_version":"None","date_updated":"2023-09-19T14:49:03Z","date_created":"2019-04-04T09:50:38Z","type":"conference","article_number":"8461106","abstract":[{"text":"In the context of robotic manipulation and grasping, the shift from a view that is static (force closure of a single posture) and contact-deprived (only contact for force closure is allowed, everything else is obstacle) towards a view that is dynamic and contact-rich (soft manipulation) has led to an increased interest in soft hands. These hands can easily exploit environmental constraints and object surfaces without risk, and safely interact with humans, but present also some challenges. Designing them is difficult, as well as predicting, modelling, and “programming” their interactions with the objects and the environment. This paper tackles the problem of simulating them in a fast and effective way, leveraging on novel and existing simulation technologies. We present a triple-layered simulation framework where dynamic properties such as stiffness are determined from slow but accurate FEM simulation data once, and then condensed into a lumped parameter model that can be used to fast simulate soft fingers and soft hands. We apply our approach to the simulation of soft pneumatic fingers.","lang":"eng"}],"citation":{"chicago":"Pozzi, Maria, Eder Miguel Villalba, Raphael Deimel, Monica Malvezzi, Bernd Bickel, Oliver Brock, and Domenico Prattichizzo. “Efficient FEM-Based Simulation of Soft Robots Modeled as Kinematic Chains.” IEEE, 2018. https://doi.org/10.1109/icra.2018.8461106.","short":"M. Pozzi, E. Miguel Villalba, R. Deimel, M. Malvezzi, B. Bickel, O. Brock, D. Prattichizzo, in:, IEEE, 2018.","mla":"Pozzi, Maria, et al. Efficient FEM-Based Simulation of Soft Robots Modeled as Kinematic Chains. 8461106, IEEE, 2018, doi:10.1109/icra.2018.8461106.","ieee":"M. Pozzi et al., “Efficient FEM-based simulation of soft robots modeled as kinematic chains,” presented at the ICRA: International Conference on Robotics and Automation, Brisbane, Australia, 2018.","apa":"Pozzi, M., Miguel Villalba, E., Deimel, R., Malvezzi, M., Bickel, B., Brock, O., & Prattichizzo, D. (2018). Efficient FEM-based simulation of soft robots modeled as kinematic chains. Presented at the ICRA: International Conference on Robotics and Automation, Brisbane, Australia: IEEE. https://doi.org/10.1109/icra.2018.8461106","ista":"Pozzi M, Miguel Villalba E, Deimel R, Malvezzi M, Bickel B, Brock O, Prattichizzo D. 2018. Efficient FEM-based simulation of soft robots modeled as kinematic chains. ICRA: International Conference on Robotics and Automation, 8461106.","ama":"Pozzi M, Miguel Villalba E, Deimel R, et al. Efficient FEM-based simulation of soft robots modeled as kinematic chains. In: IEEE; 2018. doi:10.1109/icra.2018.8461106"},"external_id":{"isi":["000446394503031"]},"isi":1,"quality_controlled":"1","doi":"10.1109/icra.2018.8461106","date_published":"2018-09-10T00:00:00Z","conference":{"end_date":"2018-05-25","location":"Brisbane, Australia","start_date":"2018-05-21","name":"ICRA: International Conference on Robotics and Automation"},"language":[{"iso":"eng"}],"scopus_import":"1","article_processing_charge":"No","publication_identifier":{"isbn":["9781538630815"]},"day":"10","month":"09"},{"conference":{"name":"FC: Financial Cryptography and Data Security","end_date":"2018-03-02","location":"Nieuwpoort, Curacao","start_date":"2018-02-26"},"doi":"10.1007/978-3-662-58387-6_26","language":[{"iso":"eng"}],"oa":1,"external_id":{"isi":["000540656400026"]},"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2015/528"}],"quality_controlled":"1","isi":1,"project":[{"name":"Teaching Old Crypto New Tricks","call_identifier":"H2020","grant_number":"682815","_id":"258AA5B2-B435-11E9-9278-68D0E5697425"}],"month":"12","publication_identifier":{"eissn":["1611-3349"],"isbn":["9783662583869","9783662583876"],"issn":["0302-9743"]},"author":[{"last_name":"Park","first_name":"Sunoo","full_name":"Park, Sunoo"},{"first_name":"Albert","last_name":"Kwon","full_name":"Kwon, Albert"},{"full_name":"Fuchsbauer, Georg","id":"46B4C3EE-F248-11E8-B48F-1D18A9856A87","first_name":"Georg","last_name":"Fuchsbauer"},{"id":"3E0BFE38-F248-11E8-B48F-1D18A9856A87","first_name":"Peter","last_name":"Gazi","full_name":"Gazi, Peter"},{"last_name":"Alwen","first_name":"Joel F","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","full_name":"Alwen, Joel F"},{"full_name":"Pietrzak, Krzysztof Z","last_name":"Pietrzak","first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"}],"date_created":"2019-10-14T06:35:38Z","date_updated":"2023-09-19T15:02:13Z","volume":10957,"year":"2018","publication_status":"published","department":[{"_id":"KrPi"}],"publisher":"Springer Nature","ec_funded":1,"date_published":"2018-12-07T00:00:00Z","publication":"22nd International Conference on Financial Cryptography and Data Security","citation":{"chicago":"Park, Sunoo, Albert Kwon, Georg Fuchsbauer, Peter Gazi, Joel F Alwen, and Krzysztof Z Pietrzak. “SpaceMint: A Cryptocurrency Based on Proofs of Space.” In 22nd International Conference on Financial Cryptography and Data Security, 10957:480–99. Springer Nature, 2018. https://doi.org/10.1007/978-3-662-58387-6_26.","mla":"Park, Sunoo, et al. “SpaceMint: A Cryptocurrency Based on Proofs of Space.” 22nd International Conference on Financial Cryptography and Data Security, vol. 10957, Springer Nature, 2018, pp. 480–99, doi:10.1007/978-3-662-58387-6_26.","short":"S. Park, A. Kwon, G. Fuchsbauer, P. Gazi, J.F. Alwen, K.Z. Pietrzak, in:, 22nd International Conference on Financial Cryptography and Data Security, Springer Nature, 2018, pp. 480–499.","ista":"Park S, Kwon A, Fuchsbauer G, Gazi P, Alwen JF, Pietrzak KZ. 2018. SpaceMint: A cryptocurrency based on proofs of space. 22nd International Conference on Financial Cryptography and Data Security. FC: Financial Cryptography and Data Security, LNCS, vol. 10957, 480–499.","ieee":"S. Park, A. Kwon, G. Fuchsbauer, P. Gazi, J. F. Alwen, and K. Z. Pietrzak, “SpaceMint: A cryptocurrency based on proofs of space,” in 22nd International Conference on Financial Cryptography and Data Security, Nieuwpoort, Curacao, 2018, vol. 10957, pp. 480–499.","apa":"Park, S., Kwon, A., Fuchsbauer, G., Gazi, P., Alwen, J. F., & Pietrzak, K. Z. (2018). SpaceMint: A cryptocurrency based on proofs of space. In 22nd International Conference on Financial Cryptography and Data Security (Vol. 10957, pp. 480–499). Nieuwpoort, Curacao: Springer Nature. https://doi.org/10.1007/978-3-662-58387-6_26","ama":"Park S, Kwon A, Fuchsbauer G, Gazi P, Alwen JF, Pietrzak KZ. SpaceMint: A cryptocurrency based on proofs of space. In: 22nd International Conference on Financial Cryptography and Data Security. Vol 10957. Springer Nature; 2018:480-499. doi:10.1007/978-3-662-58387-6_26"},"page":"480-499","day":"07","article_processing_charge":"No","scopus_import":"1","oa_version":"Submitted Version","_id":"6941","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","title":"SpaceMint: A cryptocurrency based on proofs of space","status":"public","intvolume":" 10957","abstract":[{"text":"Bitcoin has become the most successful cryptocurrency ever deployed, and its most distinctive feature is that it is decentralized. Its underlying protocol (Nakamoto consensus) achieves this by using proof of work, which has the drawback that it causes the consumption of vast amounts of energy to maintain the ledger. Moreover, Bitcoin mining dynamics have become less distributed over time.\r\n\r\nTowards addressing these issues, we propose SpaceMint, a cryptocurrency based on proofs of space instead of proofs of work. Miners in SpaceMint dedicate disk space rather than computation. We argue that SpaceMint’s design solves or alleviates several of Bitcoin’s issues: most notably, its large energy consumption. SpaceMint also rewards smaller miners fairly according to their contribution to the network, thus incentivizing more distributed participation.\r\n\r\nThis paper adapts proof of space to enable its use in cryptocurrency, studies the attacks that can arise against a Bitcoin-like blockchain that uses proof of space, and proposes a new blockchain format and transaction types to address these attacks. Our prototype shows that initializing 1 TB for mining takes about a day (a one-off setup cost), and miners spend on average just a fraction of a second per block mined. Finally, we provide a game-theoretic analysis modeling SpaceMint as an extensive game (the canonical game-theoretic notion for games that take place over time) and show that this stylized game satisfies a strong equilibrium notion, thereby arguing for SpaceMint ’s stability and consensus.","lang":"eng"}],"type":"conference","alternative_title":["LNCS"]},{"month":"06","publication_identifier":{"issn":["0022-1007"],"eissn":["1540-9538"]},"tmp":{"name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","image":"/images/cc_by_nc_sa.png","short":"CC BY-NC-SA (4.0)"},"external_id":{"isi":["000440822900011"]},"oa":1,"quality_controlled":"1","isi":1,"doi":"10.1084/jem.20170896","language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:47:32Z","year":"2018","publication_status":"published","publisher":"Rockefeller University Press","department":[{"_id":"MiSi"}],"author":[{"last_name":"Moalli","first_name":"Federica","full_name":"Moalli, Federica"},{"full_name":"Ficht, Xenia","first_name":"Xenia","last_name":"Ficht"},{"first_name":"Philipp","last_name":"Germann","full_name":"Germann, Philipp"},{"full_name":"Vladymyrov, Mykhailo","last_name":"Vladymyrov","first_name":"Mykhailo"},{"full_name":"Stolp, Bettina","first_name":"Bettina","last_name":"Stolp"},{"id":"4C7D837E-F248-11E8-B48F-1D18A9856A87","last_name":"de Vries","first_name":"Ingrid","full_name":"de Vries, Ingrid"},{"full_name":"Lyck, Ruth","last_name":"Lyck","first_name":"Ruth"},{"last_name":"Balmer","first_name":"Jasmin","full_name":"Balmer, Jasmin"},{"full_name":"Fiocchi, Amleto","last_name":"Fiocchi","first_name":"Amleto"},{"full_name":"Kreutzfeldt, Mario","last_name":"Kreutzfeldt","first_name":"Mario"},{"full_name":"Merkler, Doron","first_name":"Doron","last_name":"Merkler"},{"full_name":"Iannacone, Matteo","first_name":"Matteo","last_name":"Iannacone"},{"first_name":"Akitaka","last_name":"Ariga","full_name":"Ariga, Akitaka"},{"last_name":"Stoffel","first_name":"Michael H.","full_name":"Stoffel, Michael H."},{"last_name":"Sharpe","first_name":"James","full_name":"Sharpe, James"},{"full_name":"Bähler, Martin","first_name":"Martin","last_name":"Bähler"},{"last_name":"Sixt","first_name":"Michael K","orcid":"0000-0002-6620-9179","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","full_name":"Sixt, Michael K"},{"full_name":"Diz-Muñoz, Alba","first_name":"Alba","last_name":"Diz-Muñoz"},{"first_name":"Jens V.","last_name":"Stein","full_name":"Stein, Jens V."}],"date_updated":"2023-09-19T14:52:08Z","date_created":"2019-05-28T12:36:47Z","volume":2015,"scopus_import":"1","day":"06","has_accepted_license":"1","article_processing_charge":"No","publication":"The Journal of Experimental Medicine","citation":{"ama":"Moalli F, Ficht X, Germann P, et al. The Rho regulator Myosin IXb enables nonlymphoid tissue seeding of protective CD8+T cells. The Journal of Experimental Medicine. 2018;2015(7):1869–1890. doi:10.1084/jem.20170896","apa":"Moalli, F., Ficht, X., Germann, P., Vladymyrov, M., Stolp, B., de Vries, I., … Stein, J. V. (2018). The Rho regulator Myosin IXb enables nonlymphoid tissue seeding of protective CD8+T cells. The Journal of Experimental Medicine. Rockefeller University Press. https://doi.org/10.1084/jem.20170896","ieee":"F. Moalli et al., “The Rho regulator Myosin IXb enables nonlymphoid tissue seeding of protective CD8+T cells,” The Journal of Experimental Medicine, vol. 2015, no. 7. Rockefeller University Press, pp. 1869–1890, 2018.","ista":"Moalli F, Ficht X, Germann P, Vladymyrov M, Stolp B, de Vries I, Lyck R, Balmer J, Fiocchi A, Kreutzfeldt M, Merkler D, Iannacone M, Ariga A, Stoffel MH, Sharpe J, Bähler M, Sixt MK, Diz-Muñoz A, Stein JV. 2018. The Rho regulator Myosin IXb enables nonlymphoid tissue seeding of protective CD8+T cells. The Journal of Experimental Medicine. 2015(7), 1869–1890.","short":"F. Moalli, X. Ficht, P. Germann, M. Vladymyrov, B. Stolp, I. de Vries, R. Lyck, J. Balmer, A. Fiocchi, M. Kreutzfeldt, D. Merkler, M. Iannacone, A. Ariga, M.H. Stoffel, J. Sharpe, M. Bähler, M.K. Sixt, A. Diz-Muñoz, J.V. Stein, The Journal of Experimental Medicine 2015 (2018) 1869–1890.","mla":"Moalli, Federica, et al. “The Rho Regulator Myosin IXb Enables Nonlymphoid Tissue Seeding of Protective CD8+T Cells.” The Journal of Experimental Medicine, vol. 2015, no. 7, Rockefeller University Press, 2018, pp. 1869–1890, doi:10.1084/jem.20170896.","chicago":"Moalli, Federica, Xenia Ficht, Philipp Germann, Mykhailo Vladymyrov, Bettina Stolp, Ingrid de Vries, Ruth Lyck, et al. “The Rho Regulator Myosin IXb Enables Nonlymphoid Tissue Seeding of Protective CD8+T Cells.” The Journal of Experimental Medicine. Rockefeller University Press, 2018. https://doi.org/10.1084/jem.20170896."},"page":"1869–1890","date_published":"2018-06-06T00:00:00Z","type":"journal_article","abstract":[{"lang":"eng","text":"T cells are actively scanning pMHC-presenting cells in lymphoid organs and nonlymphoid tissues (NLTs) with divergent topologies and confinement. How the T cell actomyosin cytoskeleton facilitates this task in distinct environments is incompletely understood. Here, we show that lack of Myosin IXb (Myo9b), a negative regulator of the small GTPase Rho, led to increased Rho-GTP levels and cell surface stiffness in primary T cells. Nonetheless, intravital imaging revealed robust motility of Myo9b−/− CD8+ T cells in lymphoid tissue and similar expansion and differentiation during immune responses. In contrast, accumulation of Myo9b−/− CD8+ T cells in NLTs was strongly impaired. Specifically, Myo9b was required for T cell crossing of basement membranes, such as those which are present between dermis and epidermis. As consequence, Myo9b−/− CD8+ T cells showed impaired control of skin infections. In sum, we show that Myo9b is critical for the CD8+ T cell adaptation from lymphoid to NLT surveillance and the establishment of protective tissue–resident T cell populations."}],"issue":"7","_id":"6497","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","status":"public","ddc":["570"],"title":"The Rho regulator Myosin IXb enables nonlymphoid tissue seeding of protective CD8+T cells","intvolume":" 2015","oa_version":"Published Version","file":[{"access_level":"open_access","file_name":"2018_rupress_Moalli.pdf","creator":"kschuh","content_type":"application/pdf","file_size":3841660,"file_id":"6498","relation":"main_file","checksum":"86ae5331f9bfced9a6358a790a04bef4","date_created":"2019-05-28T12:40:05Z","date_updated":"2020-07-14T12:47:32Z"}]},{"publication_status":"published","department":[{"_id":"JoDa"}],"publisher":"EMBO","year":"2018","date_created":"2019-05-28T13:16:08Z","date_updated":"2023-09-19T14:52:32Z","volume":19,"author":[{"first_name":"Sven M","last_name":"Truckenbrodt","id":"45812BD4-F248-11E8-B48F-1D18A9856A87","full_name":"Truckenbrodt, Sven M"},{"full_name":"Maidorn, Manuel","first_name":"Manuel","last_name":"Maidorn"},{"last_name":"Crzan","first_name":"Dagmar","full_name":"Crzan, Dagmar"},{"first_name":"Hanna","last_name":"Wildhagen","full_name":"Wildhagen, Hanna"},{"first_name":"Selda","last_name":"Kabatas","full_name":"Kabatas, Selda"},{"full_name":"Rizzoli, Silvio O","last_name":"Rizzoli","first_name":"Silvio O"}],"article_number":"e45836","file_date_updated":"2020-07-14T12:47:32Z","quality_controlled":"1","isi":1,"external_id":{"isi":["000443682200009"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"language":[{"iso":"eng"}],"doi":"10.15252/embr.201845836","month":"09","publication_identifier":{"issn":["1469-221X"],"eissn":["1469-3178"]},"status":"public","ddc":["580"],"title":"X10 expansion microscopy enables 25‐nm resolution on conventional microscopes","intvolume":" 19","_id":"6499","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa_version":"Published Version","file":[{"relation":"main_file","file_id":"6500","checksum":"6ec90abc637f09cca3a7b6424d7e7a26","date_updated":"2020-07-14T12:47:32Z","date_created":"2019-05-28T13:17:19Z","access_level":"open_access","file_name":"2018_embo_Truckenbrodt.pdf","content_type":"application/pdf","file_size":2005572,"creator":"kschuh"}],"type":"journal_article","abstract":[{"text":"Expansion microscopy is a recently introduced imaging technique that achieves super‐resolution through physically expanding the specimen by ~4×, after embedding into a swellable gel. The resolution attained is, correspondingly, approximately fourfold better than the diffraction limit, or ~70 nm. This is a major improvement over conventional microscopy, but still lags behind modern STED or STORM setups, whose resolution can reach 20–30 nm. We addressed this issue here by introducing an improved gel recipe that enables an expansion factor of ~10× in each dimension, which corresponds to an expansion of the sample volume by more than 1,000‐fold. Our protocol, which we termed X10 microscopy, achieves a resolution of 25–30 nm on conventional epifluorescence microscopes. X10 provides multi‐color images similar or even superior to those produced with more challenging methods, such as STED, STORM, and iterative expansion microscopy (iExM). X10 is therefore the cheapest and easiest option for high‐quality super‐resolution imaging currently available. X10 should be usable in any laboratory, irrespective of the machinery owned or of the technical knowledge.","lang":"eng"}],"issue":"9","publication":"EMBO reports","citation":{"chicago":"Truckenbrodt, Sven M, Manuel Maidorn, Dagmar Crzan, Hanna Wildhagen, Selda Kabatas, and Silvio O Rizzoli. “X10 Expansion Microscopy Enables 25‐nm Resolution on Conventional Microscopes.” EMBO Reports. EMBO, 2018. https://doi.org/10.15252/embr.201845836.","short":"S.M. Truckenbrodt, M. Maidorn, D. Crzan, H. Wildhagen, S. Kabatas, S.O. Rizzoli, EMBO Reports 19 (2018).","mla":"Truckenbrodt, Sven M., et al. “X10 Expansion Microscopy Enables 25‐nm Resolution on Conventional Microscopes.” EMBO Reports, vol. 19, no. 9, e45836, EMBO, 2018, doi:10.15252/embr.201845836.","apa":"Truckenbrodt, S. M., Maidorn, M., Crzan, D., Wildhagen, H., Kabatas, S., & Rizzoli, S. O. (2018). X10 expansion microscopy enables 25‐nm resolution on conventional microscopes. EMBO Reports. EMBO. https://doi.org/10.15252/embr.201845836","ieee":"S. M. Truckenbrodt, M. Maidorn, D. Crzan, H. Wildhagen, S. Kabatas, and S. O. Rizzoli, “X10 expansion microscopy enables 25‐nm resolution on conventional microscopes,” EMBO reports, vol. 19, no. 9. EMBO, 2018.","ista":"Truckenbrodt SM, Maidorn M, Crzan D, Wildhagen H, Kabatas S, Rizzoli SO. 2018. X10 expansion microscopy enables 25‐nm resolution on conventional microscopes. EMBO reports. 19(9), e45836.","ama":"Truckenbrodt SM, Maidorn M, Crzan D, Wildhagen H, Kabatas S, Rizzoli SO. X10 expansion microscopy enables 25‐nm resolution on conventional microscopes. EMBO reports. 2018;19(9). doi:10.15252/embr.201845836"},"date_published":"2018-09-01T00:00:00Z","scopus_import":"1","day":"01","article_processing_charge":"No","has_accepted_license":"1"},{"abstract":[{"lang":"eng","text":"Population protocols are a popular model of distributed computing, in which n agents with limited local state interact randomly, and cooperate to collectively compute global predicates. Inspired by recent developments in DNA programming, an extensive series of papers, across different communities, has examined the computability and complexity characteristics of this model. Majority, or consensus, is a central task in this model, in which agents need to collectively reach a decision as to which one of two states A or B had a higher initial count. Two metrics are important: the time that a protocol requires to stabilize to an output decision, and the state space size that each agent requires to do so. It is known that majority requires Ω(log log n) states per agent to allow for fast (poly-logarithmic time) stabilization, and that O(log2 n) states are sufficient. Thus, there is an exponential gap between the space upper and lower bounds for this problem. This paper addresses this question.\r\n\r\nOn the negative side, we provide a new lower bound of Ω(log n) states for any protocol which stabilizes in O(n1–c) expected time, for any constant c > 0. This result is conditional on monotonicity and output assumptions, satisfied by all known protocols. Technically, it represents a departure from previous lower bounds, in that it does not rely on the existence of dense configurations. Instead, we introduce a new generalized surgery technique to prove the existence of incorrect executions for any algorithm which would contradict the lower bound. Subsequently, our lower bound also applies to general initial configurations, including ones with a leader. On the positive side, we give a new algorithm for majority which uses O(log n) states, and stabilizes in O(log2 n) expected time. Central to the algorithm is a new leaderless phase clock technique, which allows agents to synchronize in phases of Θ(n log n) consecutive interactions using O(log n) states per agent, exploiting a new connection between population protocols and power-of-two-choices load balancing mechanisms. We also employ our phase clock to build a leader election algorithm with a state space of size O(log n), which stabilizes in O(log2 n) expected time."}],"type":"conference","oa_version":"Preprint","date_updated":"2023-09-19T15:03:16Z","date_created":"2019-11-26T15:10:55Z","author":[{"full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X"},{"full_name":"Aspnes, James","first_name":"James","last_name":"Aspnes"},{"last_name":"Gelashvili","first_name":"Rati","full_name":"Gelashvili, Rati"}],"department":[{"_id":"DaAl"}],"publisher":"ACM","publication_status":"published","status":"public","title":"Space-optimal majority in population protocols","_id":"7123","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","year":"2018","article_processing_charge":"No","publication_identifier":{"isbn":["9781611975031"]},"day":"30","month":"01","language":[{"iso":"eng"}],"doi":"10.1137/1.9781611975031.144","date_published":"2018-01-30T00:00:00Z","conference":{"start_date":"2018-01-07","location":"New Orleans, LA, United States","end_date":"2018-01-10","name":"SODA: Symposium on Discrete Algorithms"},"page":"2221-2239","isi":1,"quality_controlled":"1","citation":{"mla":"Alistarh, Dan-Adrian, et al. “Space-Optimal Majority in Population Protocols.” Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM, 2018, pp. 2221–39, doi:10.1137/1.9781611975031.144.","short":"D.-A. Alistarh, J. Aspnes, R. Gelashvili, in:, Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM, 2018, pp. 2221–2239.","chicago":"Alistarh, Dan-Adrian, James Aspnes, and Rati Gelashvili. “Space-Optimal Majority in Population Protocols.” In Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms, 2221–39. ACM, 2018. https://doi.org/10.1137/1.9781611975031.144.","ama":"Alistarh D-A, Aspnes J, Gelashvili R. Space-optimal majority in population protocols. In: Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM; 2018:2221-2239. doi:10.1137/1.9781611975031.144","ista":"Alistarh D-A, Aspnes J, Gelashvili R. 2018. Space-optimal majority in population protocols. Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 2221–2239.","ieee":"D.-A. Alistarh, J. Aspnes, and R. Gelashvili, “Space-optimal majority in population protocols,” in Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, LA, United States, 2018, pp. 2221–2239.","apa":"Alistarh, D.-A., Aspnes, J., & Gelashvili, R. (2018). Space-optimal majority in population protocols. In Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 2221–2239). New Orleans, LA, United States: ACM. https://doi.org/10.1137/1.9781611975031.144"},"external_id":{"isi":["000483921200145"],"arxiv":["1704.04947"]},"oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1704.04947"}],"publication":"Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms"},{"issue":"4","abstract":[{"text":"Adaptive divergence and speciation may happen despite opposition by gene flow. Identifying the genomic basis underlying divergence with gene flow is a major task in evolutionary genomics. Most approaches (e.g., outlier scans) focus on genomic regions of high differentiation. However, not all genomic architectures potentially underlying divergence are expected to show extreme differentiation. Here, we develop an approach that combines hybrid zone analysis (i.e., focuses on spatial patterns of allele frequency change) with system-specific simulations to identify loci inconsistent with neutral evolution. We apply this to a genome-wide SNP set from an ideally suited study organism, the intertidal snail Littorina saxatilis, which shows primary divergence between ecotypes associated with different shore habitats. We detect many SNPs with clinal patterns, most of which are consistent with neutrality. Among non-neutral SNPs, most are located within three large putative inversions differentiating ecotypes. Many non-neutral SNPs show relatively low levels of differentiation. We discuss potential reasons for this pattern, including loose linkage to selected variants, polygenic adaptation and a component of balancing selection within populations (which may be expected for inversions). Our work is in line with theory predicting a role for inversions in divergence, and emphasizes that genomic regions contributing to divergence may not always be accessible with methods purely based on allele frequency differences. These conclusions call for approaches that take spatial patterns of allele frequency change into account in other systems.","lang":"eng"}],"type":"journal_article","file":[{"file_size":764299,"content_type":"application/pdf","creator":"asandaue","access_level":"open_access","file_name":"2018_EvolutionLetters_Westram.pdf","checksum":"8524e72507d521416be3f8ccfcd5e3f5","success":1,"date_created":"2021-08-16T07:48:03Z","date_updated":"2021-08-16T07:48:03Z","relation":"main_file","file_id":"9918"}],"oa_version":"Published Version","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"9917","intvolume":" 2","status":"public","ddc":["570"],"title":"Clines on the seashore: The genomic architecture underlying rapid divergence in the face of gene flow","article_processing_charge":"Yes","has_accepted_license":"1","day":"20","date_published":"2018-08-20T00:00:00Z","citation":{"ama":"Westram AM, Rafajlović M, Chaube P, et al. Clines on the seashore: The genomic architecture underlying rapid divergence in the face of gene flow. Evolution Letters. 2018;2(4):297-309. doi:10.1002/evl3.74","ieee":"A. M. Westram et al., “Clines on the seashore: The genomic architecture underlying rapid divergence in the face of gene flow,” Evolution Letters, vol. 2, no. 4. Wiley, pp. 297–309, 2018.","apa":"Westram, A. M., Rafajlović, M., Chaube, P., Faria, R., Larsson, T., Panova, M., … Butlin, R. (2018). Clines on the seashore: The genomic architecture underlying rapid divergence in the face of gene flow. Evolution Letters. Wiley. https://doi.org/10.1002/evl3.74","ista":"Westram AM, Rafajlović M, Chaube P, Faria R, Larsson T, Panova M, Ravinet M, Blomberg A, Mehlig B, Johannesson K, Butlin R. 2018. Clines on the seashore: The genomic architecture underlying rapid divergence in the face of gene flow. Evolution Letters. 2(4), 297–309.","short":"A.M. Westram, M. Rafajlović, P. Chaube, R. Faria, T. Larsson, M. Panova, M. Ravinet, A. Blomberg, B. Mehlig, K. Johannesson, R. Butlin, Evolution Letters 2 (2018) 297–309.","mla":"Westram, Anja M., et al. “Clines on the Seashore: The Genomic Architecture Underlying Rapid Divergence in the Face of Gene Flow.” Evolution Letters, vol. 2, no. 4, Wiley, 2018, pp. 297–309, doi:10.1002/evl3.74.","chicago":"Westram, Anja M, Marina Rafajlović, Pragya Chaube, Rui Faria, Tomas Larsson, Marina Panova, Mark Ravinet, et al. “Clines on the Seashore: The Genomic Architecture Underlying Rapid Divergence in the Face of Gene Flow.” Evolution Letters. Wiley, 2018. https://doi.org/10.1002/evl3.74."},"publication":"Evolution Letters","page":"297-309","article_type":"letter_note","file_date_updated":"2021-08-16T07:48:03Z","related_material":{"record":[{"id":"9930","relation":"research_data","status":"public"}]},"author":[{"full_name":"Westram, Anja M","id":"3C147470-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1050-4969","first_name":"Anja M","last_name":"Westram"},{"first_name":"Marina","last_name":"Rafajlović","full_name":"Rafajlović, Marina"},{"first_name":"Pragya","last_name":"Chaube","full_name":"Chaube, Pragya"},{"full_name":"Faria, Rui","last_name":"Faria","first_name":"Rui"},{"full_name":"Larsson, Tomas","first_name":"Tomas","last_name":"Larsson"},{"first_name":"Marina","last_name":"Panova","full_name":"Panova, Marina"},{"full_name":"Ravinet, Mark","first_name":"Mark","last_name":"Ravinet"},{"full_name":"Blomberg, Anders","last_name":"Blomberg","first_name":"Anders"},{"full_name":"Mehlig, Bernhard","last_name":"Mehlig","first_name":"Bernhard"},{"full_name":"Johannesson, Kerstin","first_name":"Kerstin","last_name":"Johannesson"},{"last_name":"Butlin","first_name":"Roger","full_name":"Butlin, Roger"}],"volume":2,"date_created":"2021-08-16T07:45:38Z","date_updated":"2023-09-19T15:08:25Z","pmid":1,"acknowledgement":"We are very grateful to people who helped with fieldwork, snail processing, and DNA extractions, particularly Laura Brettell, Mårten Duvetorp, Juan Galindo, Anne-Lise Liabot and Irena Senčić. We would also like to thank Magnus Alm Rosenblad and Mats Töpel for their contribution to assembling the Littorina saxatilis genome, Carl André, Pasi Rastas, and Romain Villoutreix for discussion, and two anonymous reviewers for their helpful comments on the manuscript. We are grateful to RapidGenomics for library preparation and sequencing. We thank the Natural Environment Research Council, the European Research Council and the Swedish Research Councils VR and Formas (Linnaeus grant to the Centre for Marine Evolutionary Biology and Tage Erlander Guest Professorship) for funding. P.C. was funded by the University of Sheffield Vice-chancellor's India scholarship. R.F. is funded by the European Union's Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie grant agreement no. 706376. M. Raf. was supported by the Adlerbert Research Foundation.","year":"2018","publisher":"Wiley","department":[{"_id":"BeVi"}],"publication_status":"published","publication_identifier":{"issn":["2056-3744"],"eissn":["2056-3744"]},"month":"08","doi":"10.1002/evl3.74","language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"external_id":{"isi":["000446774400004"],"pmid":["30283683"]},"quality_controlled":"1","isi":1},{"external_id":{"isi":["000452990000002"],"pmid":["30564439"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"quality_controlled":"1","isi":1,"doi":"10.1002/evl3.85","language":[{"iso":"eng"}],"publication_identifier":{"eissn":["2056-3744"],"issn":[" 2056-3744"]},"month":"12","pmid":1,"acknowledgement":"The authors express a special thanks to Dr Richard Willan at the Museum and Art Gallery of the Northern Territory for guidance and support in the field, and to Carole Smadja for reading and commenting on the manuscript. The authors thank the Government of Western Australia Department of Parks and Wildlife (license no. 009254) and Fishery Research Division (exemption no. 2262) for assistance with permits. Khalid Belkhir modified the coalescent sampler msnsam for the specific needs of this project and Martin Hirsch helped to set up the ABC pipeline and to modify the summary statistic calculator mscalc. The authors are grateful to the Crafoord Foundation for supporting this project. R.K.B., A.M.W., and L.D. were supported by grants from the Natural Environment Research Council, R.K.B. and A.M.W. were also supported by the European Research Council and R.K.B. and L.D. by the Leverhulme Trust. M.M.R. was supported by Consejo Nacional de Ciencia y Tecnología and Secretaría de Educación Pública, Mexico. G.B. was supported by the Centre for Animal Movement Research (CAnMove) financed by a Linnaeus grant (No. 349-2007-8690) from the Swedish Research Council and Lund University.","year":"2018","department":[{"_id":"BeVi"}],"publisher":"Wiley","publication_status":"published","related_material":{"record":[{"id":"9929","relation":"research_data","status":"public"}]},"author":[{"first_name":"Johan","last_name":"Hollander","full_name":"Hollander, Johan"},{"first_name":"Mauricio","last_name":"Montaño-Rendón","full_name":"Montaño-Rendón, Mauricio"},{"full_name":"Bianco, Giuseppe","first_name":"Giuseppe","last_name":"Bianco"},{"full_name":"Yang, Xi","first_name":"Xi","last_name":"Yang"},{"id":"3C147470-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1050-4969","first_name":"Anja M","last_name":"Westram","full_name":"Westram, Anja M"},{"full_name":"Duvaux, Ludovic","last_name":"Duvaux","first_name":"Ludovic"},{"last_name":"Reid","first_name":"David G.","full_name":"Reid, David G."},{"full_name":"Butlin, Roger K.","first_name":"Roger K.","last_name":"Butlin"}],"volume":2,"date_updated":"2023-09-19T15:08:53Z","date_created":"2021-08-16T07:30:00Z","file_date_updated":"2021-08-16T07:37:28Z","citation":{"ista":"Hollander J, Montaño-Rendón M, Bianco G, Yang X, Westram AM, Duvaux L, Reid DG, Butlin RK. 2018. Are assortative mating and genital divergence driven by reinforcement? Evolution Letters. 2(6), 557–566.","apa":"Hollander, J., Montaño-Rendón, M., Bianco, G., Yang, X., Westram, A. M., Duvaux, L., … Butlin, R. K. (2018). Are assortative mating and genital divergence driven by reinforcement? Evolution Letters. Wiley. https://doi.org/10.1002/evl3.85","ieee":"J. Hollander et al., “Are assortative mating and genital divergence driven by reinforcement?,” Evolution Letters, vol. 2, no. 6. Wiley, pp. 557–566, 2018.","ama":"Hollander J, Montaño-Rendón M, Bianco G, et al. Are assortative mating and genital divergence driven by reinforcement? Evolution Letters. 2018;2(6):557-566. doi:10.1002/evl3.85","chicago":"Hollander, Johan, Mauricio Montaño-Rendón, Giuseppe Bianco, Xi Yang, Anja M Westram, Ludovic Duvaux, David G. Reid, and Roger K. Butlin. “Are Assortative Mating and Genital Divergence Driven by Reinforcement?” Evolution Letters. Wiley, 2018. https://doi.org/10.1002/evl3.85.","mla":"Hollander, Johan, et al. “Are Assortative Mating and Genital Divergence Driven by Reinforcement?” Evolution Letters, vol. 2, no. 6, Wiley, 2018, pp. 557–66, doi:10.1002/evl3.85.","short":"J. Hollander, M. Montaño-Rendón, G. Bianco, X. Yang, A.M. Westram, L. Duvaux, D.G. Reid, R.K. Butlin, Evolution Letters 2 (2018) 557–566."},"publication":"Evolution Letters","page":"557-566","article_type":"letter_note","date_published":"2018-12-13T00:00:00Z","has_accepted_license":"1","article_processing_charge":"Yes","day":"13","_id":"9915","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","intvolume":" 2","ddc":["570"],"title":"Are assortative mating and genital divergence driven by reinforcement?","status":"public","oa_version":"Published Version","file":[{"file_id":"9916","relation":"main_file","date_created":"2021-08-16T07:37:28Z","date_updated":"2021-08-16T07:37:28Z","success":1,"checksum":"997a78ac41c809975ca69cbdea441f88","file_name":"2018_EvolutionLetters_Hollander.pdf","access_level":"open_access","creator":"asandaue","file_size":584606,"content_type":"application/pdf"}],"type":"journal_article","issue":"6","abstract":[{"text":"The evolution of assortative mating is a key part of the speciation process. Stronger assortment, or greater divergence in mating traits, between species pairs with overlapping ranges is commonly observed, but possible causes of this pattern of reproductive character displacement are difficult to distinguish. We use a multidisciplinary approach to provide a rare example where it is possible to distinguish among hypotheses concerning the evolution of reproductive character displacement. We build on an earlier comparative analysis that illustrated a strong pattern of greater divergence in penis form between pairs of sister species with overlapping ranges than between allopatric sister-species pairs, in a large clade of marine gastropods (Littorinidae). We investigate both assortative mating and divergence in male genitalia in one of the sister-species pairs, discriminating among three contrasting processes each of which can generate a pattern of reproductive character displacement: reinforcement, reproductive interference and the Templeton effect. We demonstrate reproductive character displacement in assortative mating, but not in genital form between this pair of sister species and use demographic models to distinguish among the different processes. Our results support a model with no gene flow since secondary contact and thus favor reproductive interference as the cause of reproductive character displacement for mate choice, rather than reinforcement. High gene flow within species argues against the Templeton effect. Secondary contact appears to have had little impact on genital divergence.","lang":"eng"}]},{"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"isi":["000424630400037"],"pmid":["29426833"]},"quality_controlled":"1","isi":1,"doi":"10.1038/s41598-018-19947-1","language":[{"iso":"eng"}],"month":"02","publication_identifier":{"issn":["2045-2322"]},"year":"2018","pmid":1,"publication_status":"published","publisher":"Springer Nature","department":[{"_id":"JoDa"}],"author":[{"full_name":"Gregor, Carola","last_name":"Gregor","first_name":"Carola"},{"full_name":"Sidenstein, Sven C.","last_name":"Sidenstein","first_name":"Sven C."},{"full_name":"Andresen, Martin","first_name":"Martin","last_name":"Andresen"},{"last_name":"Sahl","first_name":"Steffen J.","full_name":"Sahl, Steffen J."},{"full_name":"Danzl, Johann G","first_name":"Johann G","last_name":"Danzl","id":"42EFD3B6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8559-3973"},{"full_name":"Hell, Stefan W.","first_name":"Stefan W.","last_name":"Hell"}],"date_updated":"2023-09-19T15:04:49Z","date_created":"2020-10-06T16:33:37Z","volume":8,"article_number":"2724","file_date_updated":"2020-10-06T16:35:16Z","publication":"Scientific Reports","citation":{"chicago":"Gregor, Carola, Sven C. Sidenstein, Martin Andresen, Steffen J. Sahl, Johann G Danzl, and Stefan W. Hell. “Novel Reversibly Switchable Fluorescent Proteins for RESOLFT and STED Nanoscopy Engineered from the Bacterial Photoreceptor YtvA.” Scientific Reports. Springer Nature, 2018. https://doi.org/10.1038/s41598-018-19947-1.","short":"C. Gregor, S.C. Sidenstein, M. Andresen, S.J. Sahl, J.G. Danzl, S.W. Hell, Scientific Reports 8 (2018).","mla":"Gregor, Carola, et al. “Novel Reversibly Switchable Fluorescent Proteins for RESOLFT and STED Nanoscopy Engineered from the Bacterial Photoreceptor YtvA.” Scientific Reports, vol. 8, 2724, Springer Nature, 2018, doi:10.1038/s41598-018-19947-1.","apa":"Gregor, C., Sidenstein, S. C., Andresen, M., Sahl, S. J., Danzl, J. G., & Hell, S. W. (2018). Novel reversibly switchable fluorescent proteins for RESOLFT and STED nanoscopy engineered from the bacterial photoreceptor YtvA. Scientific Reports. Springer Nature. https://doi.org/10.1038/s41598-018-19947-1","ieee":"C. Gregor, S. C. Sidenstein, M. Andresen, S. J. Sahl, J. G. Danzl, and S. W. Hell, “Novel reversibly switchable fluorescent proteins for RESOLFT and STED nanoscopy engineered from the bacterial photoreceptor YtvA,” Scientific Reports, vol. 8. Springer Nature, 2018.","ista":"Gregor C, Sidenstein SC, Andresen M, Sahl SJ, Danzl JG, Hell SW. 2018. Novel reversibly switchable fluorescent proteins for RESOLFT and STED nanoscopy engineered from the bacterial photoreceptor YtvA. Scientific Reports. 8, 2724.","ama":"Gregor C, Sidenstein SC, Andresen M, Sahl SJ, Danzl JG, Hell SW. Novel reversibly switchable fluorescent proteins for RESOLFT and STED nanoscopy engineered from the bacterial photoreceptor YtvA. Scientific Reports. 2018;8. doi:10.1038/s41598-018-19947-1"},"article_type":"original","date_published":"2018-02-09T00:00:00Z","keyword":["Multidisciplinary"],"day":"09","has_accepted_license":"1","article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"8618","ddc":["570"],"status":"public","title":"Novel reversibly switchable fluorescent proteins for RESOLFT and STED nanoscopy engineered from the bacterial photoreceptor YtvA","intvolume":" 8","oa_version":"Published Version","file":[{"date_updated":"2020-10-06T16:35:16Z","date_created":"2020-10-06T16:35:16Z","success":1,"checksum":"e642080fcbde9584c63544f587c74f03","file_id":"8619","relation":"main_file","creator":"dernst","content_type":"application/pdf","file_size":2818077,"file_name":"2018_ScientificReports_Gregor.pdf","access_level":"open_access"}],"type":"journal_article","abstract":[{"text":"The reversibly switchable fluorescent proteins (RSFPs) commonly used for RESOLFT nanoscopy have been developed from fluorescent proteins of the GFP superfamily. These proteins are bright, but exhibit several drawbacks such as relatively large size, oxygen-dependence, sensitivity to low pH, and limited switching speed. Therefore, RSFPs from other origins with improved properties need to be explored. Here, we report the development of two RSFPs based on the LOV domain of the photoreceptor protein YtvA from Bacillus subtilis. LOV domains obtain their fluorescence by association with the abundant cellular cofactor flavin mononucleotide (FMN). Under illumination with blue and ultraviolet light, they undergo a photocycle, making these proteins inherently photoswitchable. Our first improved variant, rsLOV1, can be used for RESOLFT imaging, whereas rsLOV2 proved useful for STED nanoscopy of living cells with a resolution of down to 50 nm. In addition to their smaller size compared to GFP-related proteins (17 kDa instead of 27 kDa) and their usability at low pH, rsLOV1 and rsLOV2 exhibit faster switching kinetics, switching on and off 3 times faster than rsEGFP2, the fastest-switching RSFP reported to date. Therefore, LOV-domain-based RSFPs have potential for applications where the switching speed of GFP-based proteins is limiting.","lang":"eng"}]},{"publication_status":"published","publisher":"Oxford University Press","department":[{"_id":"JiFr"}],"year":"2018","acknowledgement":"This project received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Actions and it is co-financed by the South Moravian Region under grant agreement No. 665860 (SS). Access to computing and storage facilities owned by parties and projects contributing to the national grid infrastructure, MetaCentrum, provided under the program ‘Projects of Large Infrastructure for Research, Development, and Innovations’ (LM2010005) was greatly appreciated (RSV). The project was funded by The Ministry of Education, Youth and Sports/MES of the Czech Republic under the project CEITEC 2020 (LQ1601) (TN, TRM). JF was supported by the European Research Council (project ERC-2011-StG 20101109-PSDP) and the Czech Science Foundation GAČR (GA13-40637S). We thank Dr Kamel Chibani for active discussions on the evolutionary analysis and Nandan Mysore Vardarajan for his critical comments on the manuscript. This article reflects\r\nonly the authors’ views, and the EU is not responsible for any use that may be made of the information it contains. ","pmid":1,"date_updated":"2023-09-19T15:10:43Z","date_created":"2022-03-18T12:43:22Z","volume":69,"author":[{"full_name":"Moturu, Taraka Ramji","last_name":"Moturu","first_name":"Taraka Ramji"},{"last_name":"Thula","first_name":"Sravankumar","full_name":"Thula, Sravankumar"},{"first_name":"Ravi Kumar","last_name":"Singh","full_name":"Singh, Ravi Kumar"},{"full_name":"Nodzyński, Tomasz","first_name":"Tomasz","last_name":"Nodzyński"},{"full_name":"Vařeková, Radka Svobodová","last_name":"Vařeková","first_name":"Radka Svobodová"},{"id":"4159519E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8302-7596","first_name":"Jiří","last_name":"Friml","full_name":"Friml, Jiří"},{"last_name":"Simon","first_name":"Sibu","full_name":"Simon, Sibu"}],"ec_funded":1,"isi":1,"quality_controlled":"1","project":[{"grant_number":"282300","_id":"25716A02-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Polarity and subcellular dynamics in plants"}],"external_id":{"pmid":["29538714"],"isi":["000430727000016"]},"language":[{"iso":"eng"}],"doi":"10.1093/jxb/ery097","month":"04","publication_identifier":{"eissn":["1460-2431"],"issn":["0022-0957"]},"title":"Molecular evolution and diversification of the SMXL gene family","status":"public","intvolume":" 69","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"10881","oa_version":"None","type":"journal_article","abstract":[{"lang":"eng","text":"Strigolactones (SLs) are a relatively recent addition to the list of plant hormones that control different aspects of plant development. SL signalling is perceived by an α/β hydrolase, DWARF 14 (D14). A close homolog of D14, KARRIKIN INSENSTIVE2 (KAI2), is involved in perception of an uncharacterized molecule called karrikin (KAR). Recent studies in Arabidopsis identified the SUPPRESSOR OF MAX2 1 (SMAX1) and SMAX1-LIKE 7 (SMXL7) to be potential SCF–MAX2 complex-mediated proteasome targets of KAI2 and D14, respectively. Genetic studies on SMXL7 and SMAX1 demonstrated distinct developmental roles for each, but very little is known about these repressors in terms of their sequence features. In this study, we performed an extensive comparative analysis of SMXLs and determined their phylogenetic and evolutionary history in the plant lineage. Our results show that SMXL family members can be sub-divided into four distinct phylogenetic clades/classes, with an ancient SMAX1. Further, we identified the clade-specific motifs that have evolved and that might act as determinants of SL-KAR signalling specificity. These specificities resulted from functional diversities among the clades. Our results suggest that a gradual co-evolution of SMXL members with their upstream receptors D14/KAI2 provided an increased specificity to both the SL perception and response in land plants."}],"issue":"9","article_type":"original","page":"2367-2378","publication":"Journal of Experimental Botany","citation":{"chicago":"Moturu, Taraka Ramji, Sravankumar Thula, Ravi Kumar Singh, Tomasz Nodzyński, Radka Svobodová Vařeková, Jiří Friml, and Sibu Simon. “Molecular Evolution and Diversification of the SMXL Gene Family.” Journal of Experimental Botany. Oxford University Press, 2018. https://doi.org/10.1093/jxb/ery097.","short":"T.R. Moturu, S. Thula, R.K. Singh, T. Nodzyński, R.S. Vařeková, J. Friml, S. Simon, Journal of Experimental Botany 69 (2018) 2367–2378.","mla":"Moturu, Taraka Ramji, et al. “Molecular Evolution and Diversification of the SMXL Gene Family.” Journal of Experimental Botany, vol. 69, no. 9, Oxford University Press, 2018, pp. 2367–78, doi:10.1093/jxb/ery097.","apa":"Moturu, T. R., Thula, S., Singh, R. K., Nodzyński, T., Vařeková, R. S., Friml, J., & Simon, S. (2018). Molecular evolution and diversification of the SMXL gene family. Journal of Experimental Botany. Oxford University Press. https://doi.org/10.1093/jxb/ery097","ieee":"T. R. Moturu et al., “Molecular evolution and diversification of the SMXL gene family,” Journal of Experimental Botany, vol. 69, no. 9. Oxford University Press, pp. 2367–2378, 2018.","ista":"Moturu TR, Thula S, Singh RK, Nodzyński T, Vařeková RS, Friml J, Simon S. 2018. Molecular evolution and diversification of the SMXL gene family. Journal of Experimental Botany. 69(9), 2367–2378.","ama":"Moturu TR, Thula S, Singh RK, et al. Molecular evolution and diversification of the SMXL gene family. Journal of Experimental Botany. 2018;69(9):2367-2378. doi:10.1093/jxb/ery097"},"date_published":"2018-04-13T00:00:00Z","keyword":["Plant Science","Physiology"],"scopus_import":"1","day":"13","article_processing_charge":"No"},{"doi":"10.1093/bfgp/ely007","language":[{"iso":"eng"}],"external_id":{"isi":["000456054400004"],"pmid":["29579140"]},"main_file_link":[{"url":"https://doi.org/10.1093/bfgp/ely007","open_access":"1"}],"oa":1,"isi":1,"quality_controlled":"1","publication_identifier":{"eissn":["2041-2657"],"issn":["2041-2649"]},"month":"09","author":[{"full_name":"Yuuta, Moriyama","last_name":"Yuuta","first_name":"Moriyama","orcid":"0000-0002-2853-8051","id":"4968E7C8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Koshiba-Takeuchi","first_name":"Kazuko","full_name":"Koshiba-Takeuchi, Kazuko"}],"volume":17,"date_created":"2022-03-18T12:40:35Z","date_updated":"2023-09-19T15:11:22Z","pmid":1,"acknowledgement":"This work was supported by JSPS overseas research fellowships (Y.M.) and SENSHIN Medical Research Foundation (K.K.T.).","year":"2018","publisher":"Oxford University Press","department":[{"_id":"CaHe"}],"publication_status":"published","date_published":"2018-09-01T00:00:00Z","citation":{"ama":"Yuuta M, Koshiba-Takeuchi K. Significance of whole-genome duplications on the emergence of evolutionary novelties. Briefings in Functional Genomics. 2018;17(5):329-338. doi:10.1093/bfgp/ely007","ieee":"M. Yuuta and K. Koshiba-Takeuchi, “Significance of whole-genome duplications on the emergence of evolutionary novelties,” Briefings in Functional Genomics, vol. 17, no. 5. Oxford University Press, pp. 329–338, 2018.","apa":"Yuuta, M., & Koshiba-Takeuchi, K. (2018). Significance of whole-genome duplications on the emergence of evolutionary novelties. Briefings in Functional Genomics. Oxford University Press. https://doi.org/10.1093/bfgp/ely007","ista":"Yuuta M, Koshiba-Takeuchi K. 2018. Significance of whole-genome duplications on the emergence of evolutionary novelties. Briefings in Functional Genomics. 17(5), 329–338.","short":"M. Yuuta, K. Koshiba-Takeuchi, Briefings in Functional Genomics 17 (2018) 329–338.","mla":"Yuuta, Moriyama, and Kazuko Koshiba-Takeuchi. “Significance of Whole-Genome Duplications on the Emergence of Evolutionary Novelties.” Briefings in Functional Genomics, vol. 17, no. 5, Oxford University Press, 2018, pp. 329–38, doi:10.1093/bfgp/ely007.","chicago":"Yuuta, Moriyama, and Kazuko Koshiba-Takeuchi. “Significance of Whole-Genome Duplications on the Emergence of Evolutionary Novelties.” Briefings in Functional Genomics. Oxford University Press, 2018. https://doi.org/10.1093/bfgp/ely007."},"publication":"Briefings in Functional Genomics","page":"329-338","article_type":"original","article_processing_charge":"No","day":"01","scopus_import":"1","keyword":["Genetics","Molecular Biology","Biochemistry","General Medicine"],"oa_version":"Published Version","_id":"10880","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","intvolume":" 17","status":"public","title":"Significance of whole-genome duplications on the emergence of evolutionary novelties","issue":"5","abstract":[{"text":"Acquisition of evolutionary novelties is a fundamental process for adapting to the external environment and invading new niches and results in the diversification of life, which we can see in the world today. How such novel phenotypic traits are acquired in the course of evolution and are built up in developing embryos has been a central question in biology. Whole-genome duplication (WGD) is a process of genome doubling that supplies raw genetic materials and increases genome complexity. Recently, it has been gradually revealed that WGD and subsequent fate changes of duplicated genes can facilitate phenotypic evolution. Here, we review the current understanding of the relationship between WGD and the acquisition of evolutionary novelties. We show some examples of this link and discuss how WGD and subsequent duplicated genes can facilitate phenotypic evolution as well as when such genomic doubling can be advantageous for adaptation.","lang":"eng"}],"type":"journal_article"},{"doi":"10.5061/dryad.bp25b65","date_published":"2018-07-23T00:00:00Z","oa":1,"main_file_link":[{"url":"https://doi.org/10.5061/dryad.bp25b65","open_access":"1"}],"citation":{"chicago":"Westram, Anja M, Marina Rafajlović, Pragya Chaube, Rui Faria, Tomas Larsson, Marina Panova, Mark Ravinet, et al. “Data from: Clines on the Seashore: The Genomic Architecture Underlying Rapid Divergence in the Face of Gene Flow.” Dryad, 2018. https://doi.org/10.5061/dryad.bp25b65.","short":"A.M. Westram, M. Rafajlović, P. Chaube, R. Faria, T. Larsson, M. Panova, M. Ravinet, A. Blomberg, B. Mehlig, K. Johannesson, R. Butlin, (2018).","mla":"Westram, Anja M., et al. Data from: Clines on the Seashore: The Genomic Architecture Underlying Rapid Divergence in the Face of Gene Flow. Dryad, 2018, doi:10.5061/dryad.bp25b65.","ieee":"A. M. Westram et al., “Data from: Clines on the seashore: the genomic architecture underlying rapid divergence in the face of gene flow.” Dryad, 2018.","apa":"Westram, A. M., Rafajlović, M., Chaube, P., Faria, R., Larsson, T., Panova, M., … Butlin, R. (2018). Data from: Clines on the seashore: the genomic architecture underlying rapid divergence in the face of gene flow. Dryad. https://doi.org/10.5061/dryad.bp25b65","ista":"Westram AM, Rafajlović M, Chaube P, Faria R, Larsson T, Panova M, Ravinet M, Blomberg A, Mehlig B, Johannesson K, Butlin R. 2018. Data from: Clines on the seashore: the genomic architecture underlying rapid divergence in the face of gene flow, Dryad, 10.5061/dryad.bp25b65.","ama":"Westram AM, Rafajlović M, Chaube P, et al. Data from: Clines on the seashore: the genomic architecture underlying rapid divergence in the face of gene flow. 2018. doi:10.5061/dryad.bp25b65"},"day":"23","month":"07","article_processing_charge":"No","author":[{"full_name":"Westram, Anja M","id":"3C147470-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1050-4969","first_name":"Anja M","last_name":"Westram"},{"full_name":"Rafajlović, Marina","last_name":"Rafajlović","first_name":"Marina"},{"first_name":"Pragya","last_name":"Chaube","full_name":"Chaube, Pragya"},{"full_name":"Faria, Rui","last_name":"Faria","first_name":"Rui"},{"last_name":"Larsson","first_name":"Tomas","full_name":"Larsson, Tomas"},{"full_name":"Panova, Marina","first_name":"Marina","last_name":"Panova"},{"last_name":"Ravinet","first_name":"Mark","full_name":"Ravinet, Mark"},{"first_name":"Anders","last_name":"Blomberg","full_name":"Blomberg, Anders"},{"last_name":"Mehlig","first_name":"Bernhard","full_name":"Mehlig, Bernhard"},{"full_name":"Johannesson, Kerstin","first_name":"Kerstin","last_name":"Johannesson"},{"last_name":"Butlin","first_name":"Roger","full_name":"Butlin, Roger"}],"related_material":{"record":[{"id":"9917","relation":"used_in_publication","status":"public"}]},"date_created":"2021-08-17T08:58:47Z","date_updated":"2023-09-19T15:08:24Z","oa_version":"Published Version","_id":"9930","year":"2018","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","title":"Data from: Clines on the seashore: the genomic architecture underlying rapid divergence in the face of gene flow","status":"public","publisher":"Dryad","department":[{"_id":"BeVi"}],"abstract":[{"text":"Adaptive divergence and speciation may happen despite opposition by gene flow. Identifying the genomic basis underlying divergence with gene flow is a major task in evolutionary genomics. Most approaches (e.g. outlier scans) focus on genomic regions of high differentiation. However, not all genomic architectures potentially underlying divergence are expected to show extreme differentiation. Here, we develop an approach that combines hybrid zone analysis (i.e. focuses on spatial patterns of allele frequency change) with system-specific simulations to identify loci inconsistent with neutral evolution. We apply this to a genome-wide SNP set from an ideally-suited study organism, the intertidal snail Littorina saxatilis, which shows primary divergence between ecotypes associated with different shore habitats. We detect many SNPs with clinal patterns, most of which are consistent with neutrality. Among non-neutral SNPs, most are located within three large putative inversions differentiating ecotypes. Many non-neutral SNPs show relatively low levels of differentiation. We discuss potential reasons for this pattern, including loose linkage to selected variants, polygenic adaptation and a component of balancing selection within populations (which may be expected for inversions). Our work is in line with theory predicting a role for inversions in divergence, and emphasises that genomic regions contributing to divergence may not always be accessible with methods purely based on allele frequency differences. These conclusions call for approaches that take spatial patterns of allele frequency change into account in other systems.","lang":"eng"}],"type":"research_data_reference"},{"day":"17","month":"10","article_processing_charge":"No","main_file_link":[{"url":"https://doi.org/10.5061/dryad.51sd2p5","open_access":"1"}],"oa":1,"citation":{"chicago":"Hollander, Johan, Mauricio Montaño-Rendón, Giuseppe Bianco, Xi Yang, Anja M Westram, Ludovic Duvaux, David G. Reid, and Roger K. Butlin. “Data from: Are Assortative Mating and Genital Divergence Driven by Reinforcement?” Dryad, 2018. https://doi.org/10.5061/dryad.51sd2p5.","short":"J. Hollander, M. Montaño-Rendón, G. Bianco, X. Yang, A.M. Westram, L. Duvaux, D.G. Reid, R.K. Butlin, (2018).","mla":"Hollander, Johan, et al. Data from: Are Assortative Mating and Genital Divergence Driven by Reinforcement? Dryad, 2018, doi:10.5061/dryad.51sd2p5.","ieee":"J. Hollander et al., “Data from: Are assortative mating and genital divergence driven by reinforcement?” Dryad, 2018.","apa":"Hollander, J., Montaño-Rendón, M., Bianco, G., Yang, X., Westram, A. M., Duvaux, L., … Butlin, R. K. (2018). Data from: Are assortative mating and genital divergence driven by reinforcement? Dryad. https://doi.org/10.5061/dryad.51sd2p5","ista":"Hollander J, Montaño-Rendón M, Bianco G, Yang X, Westram AM, Duvaux L, Reid DG, Butlin RK. 2018. Data from: Are assortative mating and genital divergence driven by reinforcement?, Dryad, 10.5061/dryad.51sd2p5.","ama":"Hollander J, Montaño-Rendón M, Bianco G, et al. Data from: Are assortative mating and genital divergence driven by reinforcement? 2018. doi:10.5061/dryad.51sd2p5"},"date_published":"2018-10-17T00:00:00Z","doi":"10.5061/dryad.51sd2p5","type":"research_data_reference","abstract":[{"text":"The evolution of assortative mating is a key part of the speciation process. Stronger assortment, or greater divergence in mating traits, between species pairs with overlapping ranges is commonly observed, but possible causes of this pattern of reproductive character displacement are difficult to distinguish. We use a multidisciplinary approach to provide a rare example where it is possible to distinguish among hypotheses concerning the evolution of reproductive character displacement. We build on an earlier comparative analysis that illustrated a strong pattern of greater divergence in penis form between pairs of sister species with overlapping ranges than between allopatric sister-species pairs, in a large clade of marine gastropods (Littorinidae). We investigate both assortative mating and divergence in male genitalia in one of the sister-species pairs, discriminating among three contrasting processes each of which can generate a pattern of reproductive character displacement: reinforcement, reproductive interference and the Templeton effect. We demonstrate reproductive character displacement in assortative mating, but not in genital form between this pair of sister species and use demographic models to distinguish among the different processes. Our results support a model with no gene flow since secondary contact and thus favour reproductive interference as the cause of reproductive character displacement for mate choice, rather than reinforcement. High gene flow within species argues against the Templeton effect. Secondary contact appears to have had little impact on genital divergence.","lang":"eng"}],"title":"Data from: Are assortative mating and genital divergence driven by reinforcement?","status":"public","publisher":"Dryad","department":[{"_id":"BeVi"}],"_id":"9929","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","year":"2018","date_created":"2021-08-17T08:51:06Z","date_updated":"2023-09-19T15:08:53Z","oa_version":"Published Version","author":[{"last_name":"Hollander","first_name":"Johan","full_name":"Hollander, Johan"},{"first_name":"Mauricio","last_name":"Montaño-Rendón","full_name":"Montaño-Rendón, Mauricio"},{"last_name":"Bianco","first_name":"Giuseppe","full_name":"Bianco, Giuseppe"},{"last_name":"Yang","first_name":"Xi","full_name":"Yang, Xi"},{"id":"3C147470-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1050-4969","first_name":"Anja M","last_name":"Westram","full_name":"Westram, Anja M"},{"full_name":"Duvaux, Ludovic","last_name":"Duvaux","first_name":"Ludovic"},{"full_name":"Reid, David G.","last_name":"Reid","first_name":"David G."},{"first_name":"Roger K.","last_name":"Butlin","full_name":"Butlin, Roger K."}],"related_material":{"record":[{"status":"public","relation":"used_in_publication","id":"9915"}]}},{"date_published":"2018-12-17T00:00:00Z","publication":"2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition","citation":{"ama":"Uijlings J, Konyushkova K, Lampert C, Ferrari V. Learning intelligent dialogs for bounding box annotation. In: 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition. IEEE; 2018:9175-9184. doi:10.1109/cvpr.2018.00956","ieee":"J. Uijlings, K. Konyushkova, C. Lampert, and V. Ferrari, “Learning intelligent dialogs for bounding box annotation,” in 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, Salt Lake City, UT, United States, 2018, pp. 9175–9184.","apa":"Uijlings, J., Konyushkova, K., Lampert, C., & Ferrari, V. (2018). Learning intelligent dialogs for bounding box annotation. In 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition (pp. 9175–9184). Salt Lake City, UT, United States: IEEE. https://doi.org/10.1109/cvpr.2018.00956","ista":"Uijlings J, Konyushkova K, Lampert C, Ferrari V. 2018. Learning intelligent dialogs for bounding box annotation. 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition. CVF: Conference on Computer Vision and Pattern Recognition, 9175–9184.","short":"J. Uijlings, K. Konyushkova, C. Lampert, V. Ferrari, in:, 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, IEEE, 2018, pp. 9175–9184.","mla":"Uijlings, Jasper, et al. “Learning Intelligent Dialogs for Bounding Box Annotation.” 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, IEEE, 2018, pp. 9175–84, doi:10.1109/cvpr.2018.00956.","chicago":"Uijlings, Jasper, Ksenia Konyushkova, Christoph Lampert, and Vittorio Ferrari. “Learning Intelligent Dialogs for Bounding Box Annotation.” In 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, 9175–84. IEEE, 2018. https://doi.org/10.1109/cvpr.2018.00956."},"page":"9175-9184","day":"17","article_processing_charge":"No","scopus_import":"1","oa_version":"Preprint","_id":"10882","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","title":"Learning intelligent dialogs for bounding box annotation","status":"public","abstract":[{"lang":"eng","text":"We introduce Intelligent Annotation Dialogs for bounding box annotation. We train an agent to automatically choose a sequence of actions for a human annotator to produce a bounding box in a minimal amount of time. Specifically, we consider two actions: box verification [34], where the annotator verifies a box generated by an object detector, and manual box drawing. We explore two kinds of agents, one based on predicting the probability that a box will be positively verified, and the other based on reinforcement learning. We demonstrate that (1) our agents are able to learn efficient annotation strategies in several scenarios, automatically adapting to the image difficulty, the desired quality of the boxes, and the detector strength; (2) in all scenarios the resulting annotation dialogs speed up annotation compared to manual box drawing alone and box verification alone, while also outperforming any fixed combination of verification and drawing in most scenarios; (3) in a realistic scenario where the detector is iteratively re-trained, our agents evolve a series of strategies that reflect the shifting trade-off between verification and drawing as the detector grows stronger."}],"type":"conference","conference":{"name":"CVF: Conference on Computer Vision and Pattern Recognition","end_date":"2018-06-23","start_date":"2018-06-18","location":"Salt Lake City, UT, United States"},"doi":"10.1109/cvpr.2018.00956","language":[{"iso":"eng"}],"external_id":{"arxiv":["1712.08087"],"isi":["000457843609036"]},"oa":1,"main_file_link":[{"url":" https://doi.org/10.48550/arXiv.1712.08087","open_access":"1"}],"quality_controlled":"1","isi":1,"month":"12","publication_identifier":{"isbn":["9781538664209"],"eissn":["2575-7075"]},"author":[{"full_name":"Uijlings, Jasper","last_name":"Uijlings","first_name":"Jasper"},{"full_name":"Konyushkova, Ksenia","first_name":"Ksenia","last_name":"Konyushkova"},{"full_name":"Lampert, Christoph","orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","last_name":"Lampert","first_name":"Christoph"},{"first_name":"Vittorio","last_name":"Ferrari","full_name":"Ferrari, Vittorio"}],"date_updated":"2023-09-19T15:11:49Z","date_created":"2022-03-18T12:45:09Z","year":"2018","publication_status":"published","publisher":"IEEE","department":[{"_id":"ChLa"}]},{"scopus_import":"1","article_processing_charge":"No","day":"01","page":"4613-4623","citation":{"apa":"Alistarh, D.-A., Allen-Zhu, Z., & Li, J. (2018). Byzantine stochastic gradient descent. In Advances in Neural Information Processing Systems (Vol. 2018, pp. 4613–4623). Montreal, Canada: Neural Information Processing Systems Foundation.","ieee":"D.-A. Alistarh, Z. Allen-Zhu, and J. Li, “Byzantine stochastic gradient descent,” in Advances in Neural Information Processing Systems, Montreal, Canada, 2018, vol. 2018, pp. 4613–4623.","ista":"Alistarh D-A, Allen-Zhu Z, Li J. 2018. Byzantine stochastic gradient descent. Advances in Neural Information Processing Systems. NeurIPS: Conference on Neural Information Processing Systems vol. 2018, 4613–4623.","ama":"Alistarh D-A, Allen-Zhu Z, Li J. Byzantine stochastic gradient descent. In: Advances in Neural Information Processing Systems. Vol 2018. Neural Information Processing Systems Foundation; 2018:4613-4623.","chicago":"Alistarh, Dan-Adrian, Zeyuan Allen-Zhu, and Jerry Li. “Byzantine Stochastic Gradient Descent.” In Advances in Neural Information Processing Systems, 2018:4613–23. Neural Information Processing Systems Foundation, 2018.","short":"D.-A. Alistarh, Z. Allen-Zhu, J. Li, in:, Advances in Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2018, pp. 4613–4623.","mla":"Alistarh, Dan-Adrian, et al. “Byzantine Stochastic Gradient Descent.” Advances in Neural Information Processing Systems, vol. 2018, Neural Information Processing Systems Foundation, 2018, pp. 4613–23."},"publication":"Advances in Neural Information Processing Systems","date_published":"2018-12-01T00:00:00Z","type":"conference","abstract":[{"lang":"eng","text":"This paper studies the problem of distributed stochastic optimization in an adversarial setting where, out of m machines which allegedly compute stochastic gradients every iteration, an α-fraction are Byzantine, and may behave adversarially. Our main result is a variant of stochastic gradient descent (SGD) which finds ε-approximate minimizers of convex functions in T=O~(1/ε²m+α²/ε²) iterations. In contrast, traditional mini-batch SGD needs T=O(1/ε²m) iterations, but cannot tolerate Byzantine failures. Further, we provide a lower bound showing that, up to logarithmic factors, our algorithm is information-theoretically optimal both in terms of sample complexity and time complexity."}],"intvolume":" 2018","status":"public","title":"Byzantine stochastic gradient descent","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"6558","oa_version":"Published Version","month":"12","isi":1,"quality_controlled":"1","external_id":{"arxiv":["1803.08917"],"isi":["000461823304061"]},"main_file_link":[{"url":"https://arxiv.org/abs/1803.08917","open_access":"1"}],"oa":1,"language":[{"iso":"eng"}],"conference":{"location":"Montreal, Canada","start_date":"2018-12-02","end_date":"2018-12-08","name":"NeurIPS: Conference on Neural Information Processing Systems"},"publisher":"Neural Information Processing Systems Foundation","department":[{"_id":"DaAl"}],"publication_status":"published","year":"2018","volume":2018,"date_created":"2019-06-13T08:22:37Z","date_updated":"2023-09-19T15:12:45Z","author":[{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian"},{"full_name":"Allen-Zhu, Zeyuan","first_name":"Zeyuan","last_name":"Allen-Zhu"},{"last_name":"Li","first_name":"Jerry","full_name":"Li, Jerry"}]},{"day":"01","article_processing_charge":"No","scopus_import":"1","date_published":"2018-12-01T00:00:00Z","article_type":"original","publication":"ACM Transactions on Algorithms","citation":{"ieee":"A. Kazda, V. Kolmogorov, and M. Rolinek, “Even delta-matroids and the complexity of planar boolean CSPs,” ACM Transactions on Algorithms, vol. 15, no. 2. ACM, 2018.","apa":"Kazda, A., Kolmogorov, V., & Rolinek, M. (2018). Even delta-matroids and the complexity of planar boolean CSPs. ACM Transactions on Algorithms. ACM. https://doi.org/10.1145/3230649","ista":"Kazda A, Kolmogorov V, Rolinek M. 2018. Even delta-matroids and the complexity of planar boolean CSPs. ACM Transactions on Algorithms. 15(2), 22.","ama":"Kazda A, Kolmogorov V, Rolinek M. Even delta-matroids and the complexity of planar boolean CSPs. ACM Transactions on Algorithms. 2018;15(2). doi:10.1145/3230649","chicago":"Kazda, Alexandr, Vladimir Kolmogorov, and Michal Rolinek. “Even Delta-Matroids and the Complexity of Planar Boolean CSPs.” ACM Transactions on Algorithms. ACM, 2018. https://doi.org/10.1145/3230649.","short":"A. Kazda, V. Kolmogorov, M. Rolinek, ACM Transactions on Algorithms 15 (2018).","mla":"Kazda, Alexandr, et al. “Even Delta-Matroids and the Complexity of Planar Boolean CSPs.” ACM Transactions on Algorithms, vol. 15, no. 2, 22, ACM, 2018, doi:10.1145/3230649."},"abstract":[{"text":"The main result of this article is a generalization of the classical blossom algorithm for finding perfect matchings. Our algorithm can efficiently solve Boolean CSPs where each variable appears in exactly two constraints (we call it edge CSP) and all constraints are even Δ-matroid relations (represented by lists of tuples). As a consequence of this, we settle the complexity classification of planar Boolean CSPs started by Dvorak and Kupec. Using a reduction to even Δ-matroids, we then extend the tractability result to larger classes of Δ-matroids that we call efficiently coverable. It properly includes classes that were known to be tractable before, namely, co-independent, compact, local, linear, and binary, with the following caveat:We represent Δ-matroids by lists of tuples, while the last two use a representation by matrices. Since an n ×n matrix can represent exponentially many tuples, our tractability result is not strictly stronger than the known algorithm for linear and binary Δ-matroids.","lang":"eng"}],"issue":"2","type":"journal_article","oa_version":"Preprint","status":"public","title":"Even delta-matroids and the complexity of planar boolean CSPs","intvolume":" 15","_id":"6032","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","month":"12","language":[{"iso":"eng"}],"doi":"10.1145/3230649","isi":1,"quality_controlled":"1","project":[{"grant_number":"616160","_id":"25FBA906-B435-11E9-9278-68D0E5697425","name":"Discrete Optimization in Computer Vision: Theory and Practice","call_identifier":"FP7"}],"external_id":{"isi":["000468036500007"],"arxiv":["1602.03124"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1602.03124"}],"oa":1,"ec_funded":1,"article_number":"22","date_created":"2019-02-17T22:59:25Z","date_updated":"2023-09-20T11:20:26Z","volume":15,"author":[{"full_name":"Kazda, Alexandr","id":"3B32BAA8-F248-11E8-B48F-1D18A9856A87","first_name":"Alexandr","last_name":"Kazda"},{"last_name":"Kolmogorov","first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Kolmogorov, Vladimir"},{"full_name":"Rolinek, Michal","first_name":"Michal","last_name":"Rolinek","id":"3CB3BC06-F248-11E8-B48F-1D18A9856A87"}],"related_material":{"record":[{"id":"1192","relation":"earlier_version","status":"public"}]},"publication_status":"published","department":[{"_id":"VlKo"}],"publisher":"ACM","year":"2018"},{"publist_id":"7713","file_date_updated":"2020-07-14T12:45:23Z","department":[{"_id":"NiBa"}],"publisher":"Institute of Science and Technology Austria","publication_status":"published","year":"2018","date_updated":"2023-09-20T12:00:56Z","date_created":"2018-12-11T11:45:10Z","related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"563"},{"status":"public","relation":"part_of_dissertation","id":"1074"}]},"author":[{"full_name":"Ringbauer, Harald","last_name":"Ringbauer","first_name":"Harald","orcid":"0000-0002-4884-9682","id":"417FCFF4-F248-11E8-B48F-1D18A9856A87"}],"publication_identifier":{"issn":["2663-337X"]},"month":"02","oa":1,"tmp":{"name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png","short":"CC BY-NC (4.0)"},"language":[{"iso":"eng"}],"degree_awarded":"PhD","supervisor":[{"last_name":"Barton","first_name":"Nicholas H","orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Barton, Nicholas H"}],"doi":"10.15479/AT:ISTA:th_963","alternative_title":["ISTA Thesis"],"type":"dissertation","abstract":[{"text":"This thesis is concerned with the inference of current population structure based on geo-referenced genetic data. The underlying idea is that population structure affects its spatial genetic structure. Therefore, genotype information can be utilized to estimate important demographic parameters such as migration rates. These indirect estimates of population structure have become very attractive, as genotype data is now widely available. However, there also has been much concern about these approaches. Importantly, genetic structure can be influenced by many complex patterns, which often cannot be disentangled. Moreover, many methods merely fit heuristic patterns of genetic structure, and do not build upon population genetics theory. Here, I describe two novel inference methods that address these shortcomings. In Chapter 2, I introduce an inference scheme based on a new type of signal, identity by descent (IBD) blocks. Recently, it has become feasible to detect such long blocks of genome shared between pairs of samples. These blocks are direct traces of recent coalescence events. As such, they contain ample signal for inferring recent demography. I examine sharing of IBD blocks in two-dimensional populations with local migration. Using a diffusion approximation, I derive formulas for an isolation by distance pattern of long IBD blocks and show that sharing of long IBD blocks approaches rapid exponential decay for growing sample distance. I describe an inference scheme based on these results. It can robustly estimate the dispersal rate and population density, which is demonstrated on simulated data. I also show an application to estimate mean migration and the rate of recent population growth within Eastern Europe. Chapter 3 is about a novel method to estimate barriers to gene flow in a two dimensional population. This inference scheme utilizes geographically localized allele frequency fluctuations - a classical isolation by distance signal. The strength of these local fluctuations increases on average next to a barrier, and there is less correlation across it. I again use a framework of diffusion of ancestral lineages to model this effect, and provide an efficient numerical implementation to fit the results to geo-referenced biallelic SNP data. This inference scheme is able to robustly estimate strong barriers to gene flow, as tests on simulated data confirm.","lang":"eng"}],"status":"public","ddc":["576"],"title":"Inferring recent demography from spatial genetic structure","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"200","file":[{"file_name":"IST-2018-963-v1+1_thesis.pdf","access_level":"open_access","file_size":5792935,"content_type":"application/pdf","creator":"system","relation":"main_file","file_id":"5111","date_updated":"2020-07-14T12:45:23Z","date_created":"2018-12-12T10:14:55Z","checksum":"8cc534d2b528ae017acf80874cce48c9"},{"checksum":"6af18d7e5a7e2728ceda2f41ee24f628","date_updated":"2020-07-14T12:45:23Z","date_created":"2019-04-05T09:30:12Z","relation":"source_file","file_id":"6224","file_size":113365,"content_type":"application/zip","creator":"dernst","access_level":"closed","file_name":"2018_thesis_ringbauer_source.zip"}],"oa_version":"Published Version","pubrep_id":"963","has_accepted_license":"1","article_processing_charge":"No","day":"21","page":"146","citation":{"short":"H. Ringbauer, Inferring Recent Demography from Spatial Genetic Structure, Institute of Science and Technology Austria, 2018.","mla":"Ringbauer, Harald. Inferring Recent Demography from Spatial Genetic Structure. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:th_963.","chicago":"Ringbauer, Harald. “Inferring Recent Demography from Spatial Genetic Structure.” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:th_963.","ama":"Ringbauer H. Inferring recent demography from spatial genetic structure. 2018. doi:10.15479/AT:ISTA:th_963","apa":"Ringbauer, H. (2018). Inferring recent demography from spatial genetic structure. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_963","ieee":"H. Ringbauer, “Inferring recent demography from spatial genetic structure,” Institute of Science and Technology Austria, 2018.","ista":"Ringbauer H. 2018. Inferring recent demography from spatial genetic structure. Institute of Science and Technology Austria."},"date_published":"2018-02-21T00:00:00Z"},{"project":[{"call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","isi":1,"external_id":{"isi":["000432205500011"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"language":[{"iso":"eng"}],"doi":"10.1007/s00454-017-9883-x","publication_identifier":{"eissn":["14320444"],"issn":["01795376"]},"month":"06","department":[{"_id":"HeEd"}],"publisher":"Springer","publication_status":"published","year":"2018","volume":59,"date_updated":"2023-09-20T12:08:51Z","date_created":"2018-12-11T11:49:57Z","author":[{"full_name":"Akopyan, Arseniy","first_name":"Arseniy","last_name":"Akopyan","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2548-617X"},{"last_name":"Balitskiy","first_name":"Alexey","full_name":"Balitskiy, Alexey"},{"full_name":"Grigorev, Mikhail","last_name":"Grigorev","first_name":"Mikhail"}],"publist_id":"6324","ec_funded":1,"file_date_updated":"2019-01-18T09:27:36Z","page":"1001-1009","article_type":"original","citation":{"apa":"Akopyan, A., Balitskiy, A., & Grigorev, M. (2018). On the circle covering theorem by A.W. Goodman and R.E. Goodman. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/s00454-017-9883-x","ieee":"A. Akopyan, A. Balitskiy, and M. Grigorev, “On the circle covering theorem by A.W. Goodman and R.E. Goodman,” Discrete & Computational Geometry, vol. 59, no. 4. Springer, pp. 1001–1009, 2018.","ista":"Akopyan A, Balitskiy A, Grigorev M. 2018. On the circle covering theorem by A.W. Goodman and R.E. Goodman. Discrete & Computational Geometry. 59(4), 1001–1009.","ama":"Akopyan A, Balitskiy A, Grigorev M. On the circle covering theorem by A.W. Goodman and R.E. Goodman. Discrete & Computational Geometry. 2018;59(4):1001-1009. doi:10.1007/s00454-017-9883-x","chicago":"Akopyan, Arseniy, Alexey Balitskiy, and Mikhail Grigorev. “On the Circle Covering Theorem by A.W. Goodman and R.E. Goodman.” Discrete & Computational Geometry. Springer, 2018. https://doi.org/10.1007/s00454-017-9883-x.","short":"A. Akopyan, A. Balitskiy, M. Grigorev, Discrete & Computational Geometry 59 (2018) 1001–1009.","mla":"Akopyan, Arseniy, et al. “On the Circle Covering Theorem by A.W. Goodman and R.E. Goodman.” Discrete & Computational Geometry, vol. 59, no. 4, Springer, 2018, pp. 1001–09, doi:10.1007/s00454-017-9883-x."},"publication":"Discrete & Computational Geometry","date_published":"2018-06-01T00:00:00Z","scopus_import":"1","has_accepted_license":"1","article_processing_charge":"Yes (via OA deal)","day":"01","intvolume":" 59","title":"On the circle covering theorem by A.W. Goodman and R.E. Goodman","ddc":["516","000"],"status":"public","_id":"1064","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa_version":"Published Version","file":[{"content_type":"application/pdf","file_size":482518,"creator":"dernst","file_name":"2018_DiscreteComp_Akopyan.pdf","access_level":"open_access","date_updated":"2019-01-18T09:27:36Z","date_created":"2019-01-18T09:27:36Z","success":1,"relation":"main_file","file_id":"5844"}],"type":"journal_article","issue":"4","abstract":[{"lang":"eng","text":"In 1945, A.W. Goodman and R.E. Goodman proved the following conjecture by P. Erdős: Given a family of (round) disks of radii r1, … , rn in the plane, it is always possible to cover them by a disk of radius R= ∑ ri, provided they cannot be separated into two subfamilies by a straight line disjoint from the disks. In this note we show that essentially the same idea may work for different analogues and generalizations of their result. In particular, we prove the following: Given a family of positive homothetic copies of a fixed convex body K⊂ Rd with homothety coefficients τ1, … , τn> 0 , it is always possible to cover them by a translate of d+12(∑τi)K, provided they cannot be separated into two subfamilies by a hyperplane disjoint from the homothets."}]},{"publist_id":"7405","file_date_updated":"2020-07-14T12:46:24Z","year":"2018","publisher":"Institute of Science and Technology Austria","department":[{"_id":"HaJa"}],"publication_status":"published","related_material":{"record":[{"id":"1441","relation":"part_of_dissertation","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"1678"},{"status":"public","relation":"part_of_dissertation","id":"2084"},{"relation":"part_of_dissertation","status":"public","id":"1028"}]},"author":[{"orcid":"0000-0002-7218-7738","id":"3FEE232A-F248-11E8-B48F-1D18A9856A87","last_name":"Gschaider-Reichhart","first_name":"Eva","full_name":"Gschaider-Reichhart, Eva"}],"date_created":"2018-12-11T11:46:22Z","date_updated":"2023-09-22T09:20:10Z","publication_identifier":{"issn":["2663-337X"]},"month":"01","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"doi":"10.15479/AT:ISTA:th_913","language":[{"iso":"eng"}],"supervisor":[{"full_name":"Janovjak, Harald L","first_name":"Harald L","last_name":"Janovjak","id":"33BA6C30-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8023-9315"}],"degree_awarded":"PhD","type":"dissertation","alternative_title":["ISTA Thesis"],"abstract":[{"lang":"eng","text":"The aim of this thesis was the development of new strategies for optical and optogenetic control of proliferative and pro-survival signaling, and characterizing them from the molecular mechanism up to cellular effects. These new light-based methods have unique features, such as red light as an activator, or the avoidance of gene delivery, which enable to overcome current limitations, such as light delivery to target tissues and feasibility as therapeutic approach. A special focus was placed on implementing these new light-based approaches in pancreatic β-cells, as β-cells are the key players in diabetes and especially their loss in number negatively affects disease progression. Currently no treatment options are available to compensate the lack of functional β-cells in diabetic patients.\r\nIn a first approach, red-light-activated growth factor receptors, in particular receptor tyrosine kinases were engineered and characterized. Receptor activation with light allows spatio-temporal control compared to ligand-based activation, and especially red light exhibits deeper tissue penetration than other wavelengths of the visible spectrum. Red-light-activated receptor tyrosine kinases robustly activated major growth factor related signaling pathways with a high temporal resolution. Moreover, the remote activation of the proliferative MAPK/Erk pathway by red-light-activated receptor tyrosine kinases in a pancreatic β-cell line was also achieved, through one centimeter thick mouse tissue. Although red-light-activated receptor tyrosine kinases are particularly attractive for applications in animal models due to the deep tissue penetration of red light, a drawback, especially with regard to translation into humans, is the requirement of gene therapy.\r\nIn a second approach an endogenous light-sensitive mechanism was identified and its potential to promote proliferative and pro-survival signals was explored, towards light-based tissue regeneration without the need for gene transfer. Blue-green light illumination was found to be sufficient for the activation of proliferation and survival promoting signaling pathways in primary pancreatic murine and human islets. Blue-green light also led to an increase in proliferation of primary islet cells, an effect which was shown to be mostly β-cell specific in human islets. Moreover, it was demonstrated that this approach of pancreatic β-cell expansion did not have any negative effect on the β-cell function, in particular on their insulin secretion capacity. In contrast, a trend for enhanced insulin secretion under high glucose conditions after illumination was detected. In order to unravel the detailed characteristics of this endogenous light-sensitive mechanism, the precise light requirements were determined. In addition, the expression of light sensing proteins, OPN3 and rhodopsin, was detected. The observed effects were found to be independent of handling effects such as temperature differences and cytochrome c oxidase dependent ATP increase, but they were found to be enhanced through the knockout of OPN3. The exact mechanism of how islets cells sense light and the identity of the photoreceptor remains unknown.\r\nSummarized two new light-based systems with unique features were established that enable the activation of proliferative and pro-survival signaling pathways. While red-light-activated receptor tyrosine kinases open a new avenue for optogenetics research, by allowing non-invasive control of signaling in vivo, the identified endogenous light-sensitive mechanism has the potential to be the basis of a gene therapy-free therapeutical approach for light-based β-cell expansion."}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"418","ddc":["571","570"],"status":"public","title":"Optical and optogenetic control of proliferation and survival ","pubrep_id":"913","file":[{"file_id":"6222","relation":"source_file","checksum":"697fa72ca36fb1b8ceabc133d58a73e5","date_created":"2019-04-05T09:28:03Z","date_updated":"2020-07-14T12:46:24Z","access_level":"closed","file_name":"2018_THESIS_Gschaider-Reichhart_source.docx","creator":"dernst","file_size":7012495,"content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document"},{"file_id":"6223","relation":"main_file","checksum":"58d7d1e9e58aeb7f061ab686b1d8a48c","date_updated":"2020-07-14T12:46:24Z","date_created":"2019-04-05T09:28:03Z","access_level":"open_access","file_name":"2018_THESIS_Gschaider-Reichhart.pdf","creator":"dernst","content_type":"application/pdf","file_size":6355280}],"oa_version":"Published Version","has_accepted_license":"1","article_processing_charge":"No","day":"08","citation":{"ama":"Gschaider-Reichhart E. Optical and optogenetic control of proliferation and survival . 2018. doi:10.15479/AT:ISTA:th_913","apa":"Gschaider-Reichhart, E. (2018). Optical and optogenetic control of proliferation and survival . Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_913","ieee":"E. Gschaider-Reichhart, “Optical and optogenetic control of proliferation and survival ,” Institute of Science and Technology Austria, 2018.","ista":"Gschaider-Reichhart E. 2018. Optical and optogenetic control of proliferation and survival . Institute of Science and Technology Austria.","short":"E. Gschaider-Reichhart, Optical and Optogenetic Control of Proliferation and Survival , Institute of Science and Technology Austria, 2018.","mla":"Gschaider-Reichhart, Eva. Optical and Optogenetic Control of Proliferation and Survival . Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:th_913.","chicago":"Gschaider-Reichhart, Eva. “Optical and Optogenetic Control of Proliferation and Survival .” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:th_913."},"page":"107","date_published":"2018-01-08T00:00:00Z"},{"publication_identifier":{"issn":["10737928"]},"month":"05","oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1608.05163","open_access":"1"}],"external_id":{"isi":["000441668300009"],"arxiv":["1608.05163"]},"project":[{"name":"Random matrices, universality and disordered quantum systems","call_identifier":"FP7","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","grant_number":"338804"}],"isi":1,"quality_controlled":"1","doi":"10.1093/imrn/rnw330","language":[{"iso":"eng"}],"ec_funded":1,"publist_id":"6383","year":"2018","department":[{"_id":"LaEr"}],"publisher":"Oxford University Press","publication_status":"published","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"6179"}]},"author":[{"full_name":"Erdös, László","first_name":"László","last_name":"Erdös","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5366-9603"},{"id":"408ED176-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2904-1856","first_name":"Dominik J","last_name":"Schröder","full_name":"Schröder, Dominik J"}],"volume":2018,"date_created":"2018-12-11T11:49:41Z","date_updated":"2023-09-22T09:44:21Z","scopus_import":"1","article_processing_charge":"No","day":"18","citation":{"short":"L. Erdös, D.J. Schröder, International Mathematics Research Notices 2018 (2018) 3255–3298.","mla":"Erdös, László, and Dominik J. Schröder. “Fluctuations of Rectangular Young Diagrams of Interlacing Wigner Eigenvalues.” International Mathematics Research Notices, vol. 2018, no. 10, Oxford University Press, 2018, pp. 3255–98, doi:10.1093/imrn/rnw330.","chicago":"Erdös, László, and Dominik J Schröder. “Fluctuations of Rectangular Young Diagrams of Interlacing Wigner Eigenvalues.” International Mathematics Research Notices. Oxford University Press, 2018. https://doi.org/10.1093/imrn/rnw330.","ama":"Erdös L, Schröder DJ. Fluctuations of rectangular young diagrams of interlacing wigner eigenvalues. International Mathematics Research Notices. 2018;2018(10):3255-3298. doi:10.1093/imrn/rnw330","ieee":"L. Erdös and D. J. Schröder, “Fluctuations of rectangular young diagrams of interlacing wigner eigenvalues,” International Mathematics Research Notices, vol. 2018, no. 10. Oxford University Press, pp. 3255–3298, 2018.","apa":"Erdös, L., & Schröder, D. J. (2018). Fluctuations of rectangular young diagrams of interlacing wigner eigenvalues. International Mathematics Research Notices. Oxford University Press. https://doi.org/10.1093/imrn/rnw330","ista":"Erdös L, Schröder DJ. 2018. Fluctuations of rectangular young diagrams of interlacing wigner eigenvalues. International Mathematics Research Notices. 2018(10), 3255–3298."},"publication":"International Mathematics Research Notices","page":"3255-3298","date_published":"2018-05-18T00:00:00Z","type":"journal_article","issue":"10","abstract":[{"lang":"eng","text":"We prove a new central limit theorem (CLT) for the difference of linear eigenvalue statistics of a Wigner random matrix H and its minor H and find that the fluctuation is much smaller than the fluctuations of the individual linear statistics, as a consequence of the strong correlation between the eigenvalues of H and H. In particular, our theorem identifies the fluctuation of Kerov's rectangular Young diagrams, defined by the interlacing eigenvalues ofH and H, around their asymptotic shape, the Vershik'Kerov'Logan'Shepp curve. Young diagrams equipped with the Plancherel measure follow the same limiting shape. For this, algebraically motivated, ensemble a CLT has been obtained in Ivanov and Olshanski [20] which is structurally similar to our result but the variance is different, indicating that the analogy between the two models has its limitations. Moreover, our theorem shows that Borodin's result [7] on the convergence of the spectral distribution of Wigner matrices to a Gaussian free field also holds in derivative sense."}],"_id":"1012","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","intvolume":" 2018","title":"Fluctuations of rectangular young diagrams of interlacing wigner eigenvalues","status":"public","oa_version":"Preprint"},{"publication":"Games","citation":{"ama":"Avni G, Guha S, Kupferman O. An abstraction-refinement methodology for reasoning about network games. Games. 2018;9(3). doi:10.3390/g9030039","ista":"Avni G, Guha S, Kupferman O. 2018. An abstraction-refinement methodology for reasoning about network games. Games. 9(3), 39.","ieee":"G. Avni, S. Guha, and O. Kupferman, “An abstraction-refinement methodology for reasoning about network games,” Games, vol. 9, no. 3. MDPI AG, 2018.","apa":"Avni, G., Guha, S., & Kupferman, O. (2018). An abstraction-refinement methodology for reasoning about network games. Games. MDPI AG. https://doi.org/10.3390/g9030039","mla":"Avni, Guy, et al. “An Abstraction-Refinement Methodology for Reasoning about Network Games.” Games, vol. 9, no. 3, 39, MDPI AG, 2018, doi:10.3390/g9030039.","short":"G. Avni, S. Guha, O. Kupferman, Games 9 (2018).","chicago":"Avni, Guy, Shibashis Guha, and Orna Kupferman. “An Abstraction-Refinement Methodology for Reasoning about Network Games.” Games. MDPI AG, 2018. https://doi.org/10.3390/g9030039."},"date_published":"2018-09-01T00:00:00Z","scopus_import":1,"day":"01","has_accepted_license":"1","title":"An abstraction-refinement methodology for reasoning about network games","status":"public","ddc":["004"],"intvolume":" 9","_id":"6006","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","file":[{"checksum":"749d65ca4ce74256a029d9644a1b1cb0","date_updated":"2020-07-14T12:47:16Z","date_created":"2019-02-14T14:20:31Z","relation":"main_file","file_id":"6008","content_type":"application/pdf","file_size":505155,"creator":"kschuh","access_level":"open_access","file_name":"2018_MDPI_Avni.pdf"}],"type":"journal_article","abstract":[{"text":"Network games (NGs) are played on directed graphs and are extensively used in network design and analysis. Search problems for NGs include finding special strategy profiles such as a Nash equilibrium and a globally-optimal solution. The networks modeled by NGs may be huge. In formal verification, abstraction has proven to be an extremely effective technique for reasoning about systems with big and even infinite state spaces. We describe an abstraction-refinement methodology for reasoning about NGs. Our methodology is based on an abstraction function that maps the state space of an NG to a much smaller state space. We search for a global optimum and a Nash equilibrium by reasoning on an under- and an over-approximation defined on top of this smaller state space. When the approximations are too coarse to find such profiles, we refine the abstraction function. We extend the abstraction-refinement methodology to labeled networks, where the objectives of the players are regular languages. Our experimental results demonstrate the effectiveness of the methodology. ","lang":"eng"}],"issue":"3","quality_controlled":"1","project":[{"grant_number":"M02369","_id":"264B3912-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Formal Methods meets Algorithmic Game Theory"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"name":"The Wittgenstein Prize","call_identifier":"FWF","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"language":[{"iso":"eng"}],"doi":"10.3390/g9030039","month":"09","publication_identifier":{"issn":["2073-4336"]},"publication_status":"published","publisher":"MDPI AG","department":[{"_id":"ToHe"}],"year":"2018","date_created":"2019-02-14T14:17:54Z","date_updated":"2023-09-22T09:48:59Z","volume":9,"author":[{"full_name":"Avni, Guy","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5588-8287","first_name":"Guy","last_name":"Avni"},{"first_name":"Shibashis","last_name":"Guha","full_name":"Guha, Shibashis"},{"first_name":"Orna","last_name":"Kupferman","full_name":"Kupferman, Orna"}],"related_material":{"record":[{"id":"1003","status":"public","relation":"earlier_version"}]},"article_number":"39","file_date_updated":"2020-07-14T12:47:16Z"},{"year":"2018","publication_status":"published","department":[{"_id":"KrCh"}],"publisher":"AAAI Press","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"full_name":"Dvorák, Wolfgang","first_name":"Wolfgang","last_name":"Dvorák"},{"last_name":"Henzinger","first_name":"Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H"},{"full_name":"Svozil, Alexander","first_name":"Alexander","last_name":"Svozil"}],"related_material":{"record":[{"id":"9293","relation":"later_version","status":"public"}]},"date_updated":"2023-09-26T10:41:41Z","date_created":"2018-12-11T11:44:17Z","publist_id":"8020","ec_funded":1,"external_id":{"isi":["000492986200007"],"arxiv":["1804.07031"]},"oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1804.07031"}],"quality_controlled":"1","isi":1,"project":[{"name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"conference":{"name":"ICAPS: International Conference on Automated Planning and Scheduling","end_date":"2018-06-29","start_date":"2018-06-24","location":"Delft, Netherlands"},"language":[{"iso":"eng"}],"month":"06","_id":"35","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","status":"public","title":"Algorithms and conditional lower bounds for planning problems","oa_version":"None","type":"conference","abstract":[{"lang":"eng","text":"We consider planning problems for graphs, Markov decision processes (MDPs), and games on graphs. While graphs represent the most basic planning model, MDPs represent interaction with nature and games on graphs represent interaction with an adversarial environment. We consider two planning problems where there are k different target sets, and the problems are as follows: (a) the coverage problem asks whether there is a plan for each individual target set; and (b) the sequential target reachability problem asks whether the targets can be reached in sequence. For the coverage problem, we present a linear-time algorithm for graphs, and quadratic conditional lower bound for MDPs and games on graphs. For the sequential target problem, we present a linear-time algorithm for graphs, a sub-quadratic algorithm for MDPs, and a quadratic conditional lower bound for games on graphs. Our results with conditional lower bounds establish (i) model-separation results showing that for the coverage problem MDPs and games on graphs are harder than graphs and for the sequential reachability problem games on graphs are harder than MDPs and graphs; and (ii) objective-separation results showing that for MDPs the coverage problem is harder than the sequential target problem."}],"publication":"28th International Conference on Automated Planning and Scheduling ","citation":{"short":"K. Chatterjee, W. Dvorák, M.H. Henzinger, A. Svozil, in:, 28th International Conference on Automated Planning and Scheduling , AAAI Press, 2018.","mla":"Chatterjee, Krishnendu, et al. “Algorithms and Conditional Lower Bounds for Planning Problems.” 28th International Conference on Automated Planning and Scheduling , AAAI Press, 2018.","chicago":"Chatterjee, Krishnendu, Wolfgang Dvorák, Monika H Henzinger, and Alexander Svozil. “Algorithms and Conditional Lower Bounds for Planning Problems.” In 28th International Conference on Automated Planning and Scheduling . AAAI Press, 2018.","ama":"Chatterjee K, Dvorák W, Henzinger MH, Svozil A. Algorithms and conditional lower bounds for planning problems. In: 28th International Conference on Automated Planning and Scheduling . AAAI Press; 2018.","ieee":"K. Chatterjee, W. Dvorák, M. H. Henzinger, and A. Svozil, “Algorithms and conditional lower bounds for planning problems,” in 28th International Conference on Automated Planning and Scheduling , Delft, Netherlands, 2018.","apa":"Chatterjee, K., Dvorák, W., Henzinger, M. H., & Svozil, A. (2018). Algorithms and conditional lower bounds for planning problems. In 28th International Conference on Automated Planning and Scheduling . Delft, Netherlands: AAAI Press.","ista":"Chatterjee K, Dvorák W, Henzinger MH, Svozil A. 2018. Algorithms and conditional lower bounds for planning problems. 28th International Conference on Automated Planning and Scheduling . ICAPS: International Conference on Automated Planning and Scheduling."},"date_published":"2018-06-01T00:00:00Z","scopus_import":"1","day":"01","article_processing_charge":"No"},{"quality_controlled":"1","isi":1,"project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Game Theory"},{"name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"external_id":{"isi":["000419955500006"]},"language":[{"iso":"eng"}],"doi":"10.1007/s11241-017-9293-4","month":"01","publication_status":"published","publisher":"Springer","department":[{"_id":"KrCh"}],"year":"2018","date_updated":"2023-09-27T12:52:38Z","date_created":"2018-12-11T11:48:14Z","volume":54,"author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"last_name":"Pavlogiannis","first_name":"Andreas","orcid":"0000-0002-8943-0722","id":"49704004-F248-11E8-B48F-1D18A9856A87","full_name":"Pavlogiannis, Andreas"},{"first_name":"Alexander","last_name":"Kößler","full_name":"Kößler, Alexander"},{"full_name":"Schmid, Ulrich","last_name":"Schmid","first_name":"Ulrich"}],"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"2820"}]},"file_date_updated":"2020-07-14T12:47:56Z","ec_funded":1,"publist_id":"6929","page":"166 - 207","publication":"Real-Time Systems","citation":{"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.","short":"K. Chatterjee, A. Pavlogiannis, A. Kößler, U. Schmid, Real-Time Systems 54 (2018) 166–207.","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.","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","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.","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"},"date_published":"2018-01-01T00:00:00Z","scopus_import":"1","day":"01","has_accepted_license":"1","article_processing_charge":"No","status":"public","ddc":["000"],"title":"Automated competitive analysis of real time scheduling with graph games","intvolume":" 54","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"738","file":[{"creator":"system","file_size":1163507,"content_type":"application/pdf","access_level":"open_access","file_name":"IST-2018-960-v1+1_2017_Chatterjee_Automated_competetive.pdf","checksum":"c2590ef160709d8054cf29ee173f1454","date_created":"2018-12-12T10:17:14Z","date_updated":"2020-07-14T12:47:56Z","file_id":"5267","relation":"main_file"}],"oa_version":"Published Version","pubrep_id":"960","type":"journal_article","abstract":[{"lang":"eng","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. "}],"issue":"1"},{"file_date_updated":"2020-07-14T12:46:37Z","publist_id":"8002","author":[{"id":"2B5FC9A4-F248-11E8-B48F-1D18A9856A87","last_name":"Moser","first_name":"Thomas","full_name":"Moser, Thomas"}],"related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"5856"},{"status":"public","relation":"part_of_dissertation","id":"154"},{"id":"1198","status":"public","relation":"part_of_dissertation"},{"id":"741","status":"public","relation":"part_of_dissertation"}]},"date_updated":"2023-09-27T12:34:14Z","date_created":"2018-12-11T11:44:22Z","year":"2018","publication_status":"published","publisher":"Institute of Science and Technology Austria","department":[{"_id":"RoSe"}],"month":"09","publication_identifier":{"issn":["2663-337X"]},"doi":"10.15479/AT:ISTA:th_1043","degree_awarded":"PhD","supervisor":[{"id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6781-0521","first_name":"Robert","last_name":"Seiringer","full_name":"Seiringer, Robert"}],"language":[{"iso":"eng"}],"oa":1,"project":[{"call_identifier":"FWF","name":"Structure of the Excitation Spectrum for Many-Body Quantum Systems","_id":"25C878CE-B435-11E9-9278-68D0E5697425","grant_number":"P27533_N27"}],"abstract":[{"lang":"eng","text":"In this thesis we will discuss systems of point interacting fermions, their stability and other spectral properties. Whereas for bosons a point interacting system is always unstable this ques- tion is more subtle for a gas of two species of fermions. In particular the answer depends on the mass ratio between these two species. Most of this work will be focused on the N + M model which consists of two species of fermions with N, M particles respectively which interact via point interactions. We will introduce this model using a formal limit and discuss the N + 1 system in more detail. In particular, we will show that for mass ratios above a critical one, which does not depend on the particle number, the N + 1 system is stable. In the context of this model we will prove rigorous versions of Tan relations which relate various quantities of the point-interacting model. By restricting the N + 1 system to a box we define a finite density model with point in- teractions. In the context of this system we will discuss the energy change when introducing a point-interacting impurity into a system of non-interacting fermions. We will see that this change in energy is bounded independently of the particle number and in particular the bound only depends on the density and the scattering length. As another special case of the N + M model we will show stability of the 2 + 2 model for mass ratios in an interval around one. Further we will investigate a different model of point interactions which was discussed before in the literature and which is, contrary to the N + M model, not given by a limiting procedure but is based on a Dirichlet form. We will show that this system behaves trivially in the thermodynamic limit, i.e. the free energy per particle is the same as the one of the non-interacting system."}],"type":"dissertation","alternative_title":["ISTA Thesis"],"pubrep_id":"1043","oa_version":"Published Version","file":[{"creator":"dernst","file_size":851164,"content_type":"application/pdf","access_level":"open_access","file_name":"2018_Thesis_Moser.pdf","checksum":"fbd8c747d148b468a21213b7cf175225","date_created":"2019-04-09T07:45:38Z","date_updated":"2020-07-14T12:46:37Z","file_id":"6256","relation":"main_file"},{"checksum":"c28e16ecfc1126d3ce324ec96493c01e","date_updated":"2020-07-14T12:46:37Z","date_created":"2019-04-09T07:45:38Z","file_id":"6257","relation":"source_file","creator":"dernst","content_type":"application/zip","file_size":1531516,"access_level":"closed","file_name":"2018_Thesis_Moser_Source.zip"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"52","ddc":["515","530","519"],"status":"public","title":"Point interactions in systems of fermions","day":"04","article_processing_charge":"No","has_accepted_license":"1","date_published":"2018-09-04T00:00:00Z","citation":{"ama":"Moser T. Point interactions in systems of fermions. 2018. doi:10.15479/AT:ISTA:th_1043","ista":"Moser T. 2018. Point interactions in systems of fermions. Institute of Science and Technology Austria.","apa":"Moser, T. (2018). Point interactions in systems of fermions. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_1043","ieee":"T. Moser, “Point interactions in systems of fermions,” Institute of Science and Technology Austria, 2018.","mla":"Moser, Thomas. Point Interactions in Systems of Fermions. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:th_1043.","short":"T. Moser, Point Interactions in Systems of Fermions, Institute of Science and Technology Austria, 2018.","chicago":"Moser, Thomas. “Point Interactions in Systems of Fermions.” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:th_1043."},"page":"115"},{"ec_funded":1,"publist_id":"6530","file_date_updated":"2020-07-14T12:48:15Z","article_number":"jcs.204198","author":[{"last_name":"Tejos","first_name":"Ricardo","full_name":"Tejos, Ricardo"},{"full_name":"Rodríguez Furlán, Cecilia","last_name":"Rodríguez Furlán","first_name":"Cecilia"},{"full_name":"Adamowski, Maciek","first_name":"Maciek","last_name":"Adamowski","id":"45F536D2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6463-5257"},{"full_name":"Sauer, Michael","first_name":"Michael","last_name":"Sauer"},{"last_name":"Norambuena","first_name":"Lorena","full_name":"Norambuena, Lorena"},{"full_name":"Friml, Jirí","last_name":"Friml","first_name":"Jirí","orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87"}],"volume":131,"date_updated":"2023-09-26T15:47:50Z","date_created":"2018-12-11T11:49:10Z","year":"2018","publisher":"Company of Biologists","department":[{"_id":"JiFr"}],"publication_status":"published","publication_identifier":{"issn":["00219533"]},"month":"01","doi":"10.1242/jcs.204198","language":[{"iso":"eng"}],"oa":1,"external_id":{"isi":["000424842400019"]},"project":[{"grant_number":"282300","_id":"25716A02-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Polarity and subcellular dynamics in plants"}],"quality_controlled":"1","isi":1,"issue":"2","abstract":[{"text":"Coordinated cell polarization in developing tissues is a recurrent theme in multicellular organisms. In plants, a directional distribution of the plant hormone auxin is at the core of many developmental programs. A feedback regulation of auxin on the polarized localization of PIN auxin transporters in individual cells has been proposed as a self-organizing mechanism for coordinated tissue polarization, but the molecular mechanisms linking auxin signalling to PIN-dependent auxin transport remain unknown. We performed a microarray-based approach to find regulators of the auxin-induced PIN relocation in the Arabidopsis thaliana root. We identified a subset of a family of phosphatidylinositol transfer proteins (PITP), the PATELLINs (PATL). Here, we show that PATLs are expressed in partially overlapping cells types in different tissues going through mitosis or initiating differentiation programs. PATLs are plasma membrane-associated proteins accumulated in Arabidopsis embryos, primary roots, lateral root primordia, and developing stomata. Higher order patl mutants display reduced PIN1 repolarization in response to auxin, shorter root apical meristem, and drastic defects in embryo and seedling development. This suggests PATLs redundantly play a crucial role in polarity and patterning in Arabidopsis.","lang":"eng"}],"type":"journal_article","pubrep_id":"988","file":[{"relation":"main_file","file_id":"6299","date_updated":"2020-07-14T12:48:15Z","date_created":"2019-04-12T08:46:32Z","checksum":"bf156c20a4f117b4b932370d54cbac8c","file_name":"2017_adamowski_PATELLINS_are.pdf","access_level":"open_access","file_size":14925985,"content_type":"application/pdf","creator":"dernst"}],"oa_version":"Published Version","_id":"913","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","intvolume":" 131","title":"PATELLINS are regulators of auxin mediated PIN1 relocation and plant development in Arabidopsis thaliana","status":"public","ddc":["581"],"has_accepted_license":"1","article_processing_charge":"No","day":"29","scopus_import":"1","date_published":"2018-01-29T00:00:00Z","citation":{"ama":"Tejos R, Rodríguez Furlán C, Adamowski M, Sauer M, Norambuena L, Friml J. PATELLINS are regulators of auxin mediated PIN1 relocation and plant development in Arabidopsis thaliana. Journal of Cell Science. 2018;131(2). doi:10.1242/jcs.204198","ieee":"R. Tejos, C. Rodríguez Furlán, M. Adamowski, M. Sauer, L. Norambuena, and J. Friml, “PATELLINS are regulators of auxin mediated PIN1 relocation and plant development in Arabidopsis thaliana,” Journal of Cell Science, vol. 131, no. 2. Company of Biologists, 2018.","apa":"Tejos, R., Rodríguez Furlán, C., Adamowski, M., Sauer, M., Norambuena, L., & Friml, J. (2018). PATELLINS are regulators of auxin mediated PIN1 relocation and plant development in Arabidopsis thaliana. Journal of Cell Science. Company of Biologists. https://doi.org/10.1242/jcs.204198","ista":"Tejos R, Rodríguez Furlán C, Adamowski M, Sauer M, Norambuena L, Friml J. 2018. PATELLINS are regulators of auxin mediated PIN1 relocation and plant development in Arabidopsis thaliana. Journal of Cell Science. 131(2), jcs. 204198.","short":"R. Tejos, C. Rodríguez Furlán, M. Adamowski, M. Sauer, L. Norambuena, J. Friml, Journal of Cell Science 131 (2018).","mla":"Tejos, Ricardo, et al. “PATELLINS Are Regulators of Auxin Mediated PIN1 Relocation and Plant Development in Arabidopsis Thaliana.” Journal of Cell Science, vol. 131, no. 2, jcs. 204198, Company of Biologists, 2018, doi:10.1242/jcs.204198.","chicago":"Tejos, Ricardo, Cecilia Rodríguez Furlán, Maciek Adamowski, Michael Sauer, Lorena Norambuena, and Jiří Friml. “PATELLINS Are Regulators of Auxin Mediated PIN1 Relocation and Plant Development in Arabidopsis Thaliana.” Journal of Cell Science. Company of Biologists, 2018. https://doi.org/10.1242/jcs.204198."},"publication":"Journal of Cell Science"},{"publication_identifier":{"issn":["2663-337X"]},"month":"09","language":[{"iso":"eng"}],"supervisor":[{"full_name":"Katsaros, Georgios","id":"38DB5788-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8342-202X","first_name":"Georgios","last_name":"Katsaros"}],"degree_awarded":"PhD","doi":"10.15479/AT:ISTA:TH_1047","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"publist_id":"7985","file_date_updated":"2020-07-14T12:47:44Z","date_updated":"2023-09-26T15:50:22Z","date_created":"2018-12-11T11:44:28Z","related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"23"},{"id":"840","relation":"part_of_dissertation","status":"public"}]},"author":[{"full_name":"Vukušić, Lada","first_name":"Lada","last_name":"Vukušić","id":"31E9F056-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2424-8636"}],"department":[{"_id":"GeKa"},{"_id":"GradSch"}],"publisher":"Institute of Science and Technology Austria","publication_status":"published","year":"2018","has_accepted_license":"1","article_processing_charge":"No","day":"01","date_published":"2018-09-01T00:00:00Z","page":"103","citation":{"chicago":"Vukušić, Lada. “Charge Sensing and Spin Relaxation Times of Holes in Ge Hut Wires.” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:TH_1047.","short":"L. Vukušić, Charge Sensing and Spin Relaxation Times of Holes in Ge Hut Wires, Institute of Science and Technology Austria, 2018.","mla":"Vukušić, Lada. Charge Sensing and Spin Relaxation Times of Holes in Ge Hut Wires. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:TH_1047.","apa":"Vukušić, L. (2018). Charge sensing and spin relaxation times of holes in Ge hut wires. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:TH_1047","ieee":"L. Vukušić, “Charge sensing and spin relaxation times of holes in Ge hut wires,” Institute of Science and Technology Austria, 2018.","ista":"Vukušić L. 2018. Charge sensing and spin relaxation times of holes in Ge hut wires. Institute of Science and Technology Austria.","ama":"Vukušić L. Charge sensing and spin relaxation times of holes in Ge hut wires. 2018. doi:10.15479/AT:ISTA:TH_1047"},"abstract":[{"text":"A qubit, a unit of quantum information, is essentially any quantum mechanical two-level system which can be coherently controlled. Still, to be used for computation, it has to fulfill criteria. Qubits, regardless of the system in which they are realized, suffer from decoherence. This leads to loss of the information stored in the qubit. The upper bound of the time scale on which decoherence happens is set by the spin relaxation time. In this thesis I studied a two-level system consisting of a Zeeman-split hole spin confined in a quantum dot formed in a Ge hut wire. Such Ge hut wires have emerged as a promising material system for the realization of spin qubits, due to the combination of two significant properties: long spin coherence time as expected for group IV semiconductors due to the low hyperfine interaction and a strong valence band spin-orbit coupling. Here, I present how to fabricate quantum dot devices suitable for electrical transport measurements. Coupled quantum dot devices allowed the realization of a charge sensor, which is electrostatically and tunnel coupled to a quantum dot. By integrating the charge sensor into a radio-frequency reflectometry setup, I performed for the first time single-shot readout measurements of hole spins and extracted the hole spin relaxation times in Ge hut wires.","lang":"eng"}],"alternative_title":["ISTA Thesis"],"type":"dissertation","oa_version":"Published Version","file":[{"access_level":"open_access","file_name":"2018_Thesis_Vukusic.pdf","creator":"dernst","content_type":"application/pdf","file_size":28452385,"file_id":"6247","relation":"main_file","checksum":"c570b656e30749cd65b1c7e13a9ce0a8","date_created":"2019-04-09T07:00:40Z","date_updated":"2020-07-14T12:47:44Z"},{"date_created":"2019-04-09T07:00:40Z","date_updated":"2020-07-14T12:47:44Z","checksum":"7856771d9cd401fe0b311191076db6e1","relation":"source_file","file_id":"6248","content_type":"application/zip","file_size":53058704,"creator":"dernst","file_name":"2018_Thesis_Vukusic_source.zip","access_level":"closed"}],"pubrep_id":"1047","ddc":["530","600"],"status":"public","title":"Charge sensing and spin relaxation times of holes in Ge hut wires","_id":"69","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1"},{"alternative_title":["ISTA Thesis"],"type":"dissertation","abstract":[{"lang":"eng","text":"Neuronal networks in the brain consist of two main types of neuron, glutamatergic principal neurons and GABAergic interneurons. Although these interneurons only represent 10–20% of the whole population, they mediate feedback and feedforward inhibition and are involved in the generation of high-frequency network oscillations. A hallmark functional property of GABAergic interneurons, especially of the parvalbumin‑expressing (PV+) subtypes, is the speed of signaling at their output synapse across species and brain regions. Several molecular and subcellular factors may underlie the submillisecond signaling at GABAergic synapses. Such as the selective use of P/Q type Ca2+ channels and the tight coupling between Ca2+ channels and Ca2+ sensors of exocytosis. However, whether the molecular identity of the release sensor contributes to these signaling properties remains unclear. Besides, these interneurons are mainly show depression in response to train of stimuli. How could they keep sufficient release to control the activity of postsynaptic principal neurons during high network activity, is largely elusive. For my Ph.D. work, we firstly examined the Ca2+ sensor of exocytosis at the GABAergic basket cell (BC) to Purkinje cell (PC) synapse in the cerebellum. Immunolabeling suggested that BC terminals selectively expressed synaptotagmin 2 (Syt2), whereas synaptotagmin 1 (Syt1) was enriched in excitatory terminals. Genetic elimination of Syt2 reduced action potential-evoked release to ~10% compared to the wild-type control, identifying Syt2 as the major Ca2+ sensor at BC‑PC synapses. Differential adenovirus-mediated rescue revealed Syt2 triggered release with shorter latency and higher temporal precision, and mediated faster vesicle pool replenishment than Syt1. Furthermore, deletion of Syt2 severely reduced and delayed disynaptic inhibition following parallel fiber stimulation. Thus, the selective use of Syt2 as the release sensor at BC–PC synapse ensures fast feedforward inhibition in cerebellar microcircuits. Additionally, we tested the function of another synaptotagmin member, Syt7, for inhibitory synaptic transmission at the BC–PC synapse. Syt7 is thought to be a Ca2+ sensor that mediates asynchronous transmitter release and facilitation at synapses. However, it is strongly expressed in fast-spiking, PV+ GABAergic interneurons and the output synapses of these neurons produce only minimal asynchronous release and show depression rather than facilitation. How could Syt7, a facilitation sensor, contribute to the depressed inhibitory synaptic transmission needs to be further investigated and understood. Our results indicated that at the BC–PC synapse, Syt7 contributes to asynchronous release, pool replenishment and facilitation. In combination, these three effects ensure efficient transmitter release during high‑frequency activity and guarantee frequency independence of inhibition. Taken together, our results confirmed that Syt2, which has the fastest kinetic properties among all synaptotagmin members, is mainly used by the inhibitory BC‑PC synapse for synaptic transmission, contributing to the speed and temporal precision of transmitter release. Furthermore, we showed that Syt7, another highly expressed synaptotagmin member in the output synapses of cerebellar BCs, is used for ensuring efficient inhibitor synaptic transmission during high activity."}],"status":"public","title":"Synaptotagmins ensure speed and efficiency of inhibitory neurotransmitter release","ddc":["571"],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"324","file":[{"relation":"main_file","file_id":"5046","date_updated":"2020-07-14T12:46:04Z","date_created":"2018-12-12T10:13:58Z","checksum":"8e163ae9e927401b9fa7c1b3e6a3631a","file_name":"IST-2018-997-v1+1_Thesis_chong_a.pdf","access_level":"open_access","content_type":"application/pdf","file_size":8719458,"creator":"system"},{"checksum":"f7d7260029a5fbb5c982db61328ade52","date_created":"2019-04-05T09:25:26Z","date_updated":"2020-07-14T12:46:04Z","relation":"source_file","file_id":"6221","file_size":47841940,"content_type":"application/octet-stream","creator":"dernst","access_level":"closed","file_name":"2018_Thesis_chong_source.pages"}],"oa_version":"Published Version","pubrep_id":"997","day":"01","has_accepted_license":"1","article_processing_charge":"No","page":"110","citation":{"mla":"Chen, Chong. Synaptotagmins Ensure Speed and Efficiency of Inhibitory Neurotransmitter Release. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:th_997.","short":"C. Chen, Synaptotagmins Ensure Speed and Efficiency of Inhibitory Neurotransmitter Release, Institute of Science and Technology Austria, 2018.","chicago":"Chen, Chong. “Synaptotagmins Ensure Speed and Efficiency of Inhibitory Neurotransmitter Release.” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:th_997.","ama":"Chen C. Synaptotagmins ensure speed and efficiency of inhibitory neurotransmitter release. 2018. doi:10.15479/AT:ISTA:th_997","ista":"Chen C. 2018. Synaptotagmins ensure speed and efficiency of inhibitory neurotransmitter release. Institute of Science and Technology Austria.","apa":"Chen, C. (2018). Synaptotagmins ensure speed and efficiency of inhibitory neurotransmitter release. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_997","ieee":"C. Chen, “Synaptotagmins ensure speed and efficiency of inhibitory neurotransmitter release,” Institute of Science and Technology Austria, 2018."},"date_published":"2018-03-01T00:00:00Z","file_date_updated":"2020-07-14T12:46:04Z","publist_id":"7541","publication_status":"published","department":[{"_id":"PeJo"}],"publisher":"Institute of Science and Technology Austria","year":"2018","date_created":"2018-12-11T11:45:49Z","date_updated":"2023-09-27T12:26:03Z","author":[{"id":"3DFD581A-F248-11E8-B48F-1D18A9856A87","last_name":"Chen","first_name":"Chong","full_name":"Chen, Chong"}],"related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"1117"},{"status":"public","relation":"part_of_dissertation","id":"749"}]},"month":"03","publication_identifier":{"issn":["2663-337X"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"degree_awarded":"PhD","supervisor":[{"full_name":"Jonas, Peter M","last_name":"Jonas","first_name":"Peter M","orcid":"0000-0001-5001-4804","id":"353C1B58-F248-11E8-B48F-1D18A9856A87"}],"language":[{"iso":"eng"}],"doi":"10.15479/AT:ISTA:th_997"},{"month":"08","project":[{"name":"Embeddings in Higher Dimensions: Algorithms and Combinatorics","_id":"25FA3206-B435-11E9-9278-68D0E5697425","grant_number":"PP00P2_138948"}],"isi":1,"quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"isi":["000437122700017"]},"oa":1,"language":[{"iso":"eng"}],"doi":"10.1007/s10711-017-0291-4","publist_id":"6925","file_date_updated":"2020-07-14T12:47:58Z","department":[{"_id":"UlWa"}],"publisher":"Springer","publication_status":"published","year":"2018","volume":195,"date_created":"2018-12-11T11:48:16Z","date_updated":"2023-09-27T12:29:57Z","related_material":{"record":[{"id":"1378","status":"public","relation":"earlier_version"}]},"author":[{"full_name":"Dotterrer, Dominic","first_name":"Dominic","last_name":"Dotterrer"},{"first_name":"Tali","last_name":"Kaufman","full_name":"Kaufman, Tali"},{"first_name":"Uli","last_name":"Wagner","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1494-0568","full_name":"Wagner, Uli"}],"scopus_import":"1","article_processing_charge":"Yes (via OA deal)","has_accepted_license":"1","day":"01","page":"307–317","citation":{"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","ieee":"D. Dotterrer, T. Kaufman, and U. Wagner, “On expansion and topological overlap,” Geometriae Dedicata, vol. 195, no. 1. Springer, pp. 307–317, 2018.","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","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.","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."},"publication":"Geometriae Dedicata","date_published":"2018-08-01T00:00:00Z","type":"journal_article","issue":"1","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."}],"intvolume":" 195","title":"On expansion and topological overlap","ddc":["514","516"],"status":"public","_id":"742","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","file":[{"file_name":"s10711-017-0291-4.pdf","access_level":"open_access","file_size":412486,"content_type":"application/pdf","creator":"kschuh","relation":"main_file","file_id":"5835","date_updated":"2020-07-14T12:47:58Z","date_created":"2019-01-15T13:44:05Z","checksum":"d2f70fc132156504aa4c626aa378a7ab"}],"oa_version":"Published Version","pubrep_id":"912"},{"file_date_updated":"2020-07-14T12:47:46Z","ec_funded":1,"date_created":"2018-12-11T11:44:28Z","date_updated":"2023-10-10T13:11:29Z","volume":15,"author":[{"full_name":"Nejjar, Peter","last_name":"Nejjar","first_name":"Peter","id":"4BF426E2-F248-11E8-B48F-1D18A9856A87"}],"publication_status":"published","publisher":"Instituto Nacional de Matematica Pura e Aplicada","department":[{"_id":"LaEr"},{"_id":"JaMa"}],"year":"2018","month":"10","publication_identifier":{"issn":["1980-0436"]},"language":[{"iso":"eng"}],"doi":"10.30757/ALEA.v15-49","isi":1,"quality_controlled":"1","project":[{"_id":"258DCDE6-B435-11E9-9278-68D0E5697425","grant_number":"338804","name":"Random matrices, universality and disordered quantum systems","call_identifier":"FP7"},{"call_identifier":"H2020","name":"Optimal Transport and Stochastic Dynamics","grant_number":"716117","_id":"256E75B8-B435-11E9-9278-68D0E5697425"}],"external_id":{"arxiv":["1705.08836"],"isi":["000460475800022"]},"oa":1,"abstract":[{"text":"We consider the totally asymmetric simple exclusion process in a critical scaling parametrized by a≥0, which creates a shock in the particle density of order aT−1/3, T the observation time. When starting from step initial data, we provide bounds on the limiting law which in particular imply that in the double limit lima→∞limT→∞ one recovers the product limit law and the degeneration of the correlation length observed at shocks of order 1. This result is shown to apply to a general last-passage percolation model. We also obtain bounds on the two-point functions of several airy processes.","lang":"eng"}],"issue":"2","type":"journal_article","oa_version":"Published Version","file":[{"file_name":"2018_ALEA_Nejjar.pdf","access_level":"open_access","creator":"kschuh","file_size":394851,"content_type":"application/pdf","file_id":"5981","relation":"main_file","date_created":"2019-02-14T09:44:10Z","date_updated":"2020-07-14T12:47:46Z","checksum":"2ded46aa284a836a8cbb34133a64f1cb"}],"title":"Transition to shocks in TASEP and decoupling of last passage times","ddc":["510"],"status":"public","intvolume":" 15","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"70","day":"01","has_accepted_license":"1","article_processing_charge":"No","scopus_import":"1","date_published":"2018-10-01T00:00:00Z","article_type":"original","page":"1311-1334","publication":"Latin American Journal of Probability and Mathematical Statistics","citation":{"apa":"Nejjar, P. (2018). Transition to shocks in TASEP and decoupling of last passage times. Latin American Journal of Probability and Mathematical Statistics. Instituto Nacional de Matematica Pura e Aplicada. https://doi.org/10.30757/ALEA.v15-49","ieee":"P. Nejjar, “Transition to shocks in TASEP and decoupling of last passage times,” Latin American Journal of Probability and Mathematical Statistics, vol. 15, no. 2. Instituto Nacional de Matematica Pura e Aplicada, pp. 1311–1334, 2018.","ista":"Nejjar P. 2018. Transition to shocks in TASEP and decoupling of last passage times. Latin American Journal of Probability and Mathematical Statistics. 15(2), 1311–1334.","ama":"Nejjar P. Transition to shocks in TASEP and decoupling of last passage times. Latin American Journal of Probability and Mathematical Statistics. 2018;15(2):1311-1334. doi:10.30757/ALEA.v15-49","chicago":"Nejjar, Peter. “Transition to Shocks in TASEP and Decoupling of Last Passage Times.” Latin American Journal of Probability and Mathematical Statistics. Instituto Nacional de Matematica Pura e Aplicada, 2018. https://doi.org/10.30757/ALEA.v15-49.","short":"P. Nejjar, Latin American Journal of Probability and Mathematical Statistics 15 (2018) 1311–1334.","mla":"Nejjar, Peter. “Transition to Shocks in TASEP and Decoupling of Last Passage Times.” Latin American Journal of Probability and Mathematical Statistics, vol. 15, no. 2, Instituto Nacional de Matematica Pura e Aplicada, 2018, pp. 1311–34, doi:10.30757/ALEA.v15-49."}},{"author":[{"last_name":"Turner","first_name":"C J","full_name":"Turner, C J"},{"full_name":"Michailidis, Alexios","orcid":"0000-0002-8443-1064","id":"36EBAD38-F248-11E8-B48F-1D18A9856A87","last_name":"Michailidis","first_name":"Alexios"},{"full_name":"Abanin, D A","last_name":"Abanin","first_name":"D A"},{"full_name":"Serbyn, Maksym","last_name":"Serbyn","first_name":"Maksym","orcid":"0000-0002-2399-5827","id":"47809E7E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Papić, Z","first_name":"Z","last_name":"Papić"}],"volume":98,"date_updated":"2023-10-10T13:28:49Z","date_created":"2018-12-11T11:44:19Z","year":"2018","department":[{"_id":"MaSe"}],"publisher":"American Physical Society","publication_status":"published","publist_id":"8010","article_number":"155134","doi":"10.1103/PhysRevB.98.155134","language":[{"iso":"eng"}],"acknowledged_ssus":[{"_id":"ScienComp"}],"external_id":{"isi":["000447919100001"],"arxiv":["1806.10933"]},"main_file_link":[{"url":"https://arxiv.org/abs/1806.10933","open_access":"1"}],"oa":1,"isi":1,"quality_controlled":"1","month":"10","oa_version":"Preprint","_id":"44","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 98","title":"Quantum scarred eigenstates in a Rydberg atom chain: Entanglement, breakdown of thermalization, and stability to perturbations","status":"public","issue":"15","abstract":[{"text":"Recent realization of a kinetically constrained chain of Rydberg atoms by Bernien et al., [Nature (London) 551, 579 (2017)] resulted in the observation of unusual revivals in the many-body quantum dynamics. In our previous work [C. J. Turner et al., Nat. Phys. 14, 745 (2018)], such dynamics was attributed to the existence of “quantum scarred” eigenstates in the many-body spectrum of the experimentally realized model. Here, we present a detailed study of the eigenstate properties of the same model. We find that the majority of the eigenstates exhibit anomalous thermalization: the observable expectation values converge to their Gibbs ensemble values, but parametrically slower compared to the predictions of the eigenstate thermalization hypothesis (ETH). Amidst the thermalizing spectrum, we identify nonergodic eigenstates that strongly violate the ETH, whose number grows polynomially with system size. Previously, the same eigenstates were identified via large overlaps with certain product states, and were used to explain the revivals observed in experiment. Here, we find that these eigenstates, in addition to highly atypical expectation values of local observables, also exhibit subthermal entanglement entropy that scales logarithmically with the system size. Moreover, we identify an additional class of quantum scarred eigenstates, and discuss their manifestations in the dynamics starting from initial product states. We use forward scattering approximation to describe the structure and physical properties of quantum scarred eigenstates. Finally, we discuss the stability of quantum scars to various perturbations. We observe that quantum scars remain robust when the introduced perturbation is compatible with the forward scattering approximation. In contrast, the perturbations which most efficiently destroy quantum scars also lead to the restoration of “canonical” thermalization.","lang":"eng"}],"type":"journal_article","date_published":"2018-10-22T00:00:00Z","citation":{"chicago":"Turner, C J, Alexios Michailidis, D A Abanin, Maksym Serbyn, and Z Papić. “Quantum Scarred Eigenstates in a Rydberg Atom Chain: Entanglement, Breakdown of Thermalization, and Stability to Perturbations.” Physical Review B. American Physical Society, 2018. https://doi.org/10.1103/PhysRevB.98.155134.","mla":"Turner, C. J., et al. “Quantum Scarred Eigenstates in a Rydberg Atom Chain: Entanglement, Breakdown of Thermalization, and Stability to Perturbations.” Physical Review B, vol. 98, no. 15, 155134, American Physical Society, 2018, doi:10.1103/PhysRevB.98.155134.","short":"C.J. Turner, A. Michailidis, D.A. Abanin, M. Serbyn, Z. Papić, Physical Review B 98 (2018).","ista":"Turner CJ, Michailidis A, Abanin DA, Serbyn M, Papić Z. 2018. Quantum scarred eigenstates in a Rydberg atom chain: Entanglement, breakdown of thermalization, and stability to perturbations. Physical Review B. 98(15), 155134.","ieee":"C. J. Turner, A. Michailidis, D. A. Abanin, M. Serbyn, and Z. Papić, “Quantum scarred eigenstates in a Rydberg atom chain: Entanglement, breakdown of thermalization, and stability to perturbations,” Physical Review B, vol. 98, no. 15. American Physical Society, 2018.","apa":"Turner, C. J., Michailidis, A., Abanin, D. A., Serbyn, M., & Papić, Z. (2018). Quantum scarred eigenstates in a Rydberg atom chain: Entanglement, breakdown of thermalization, and stability to perturbations. Physical Review B. American Physical Society. https://doi.org/10.1103/PhysRevB.98.155134","ama":"Turner CJ, Michailidis A, Abanin DA, Serbyn M, Papić Z. Quantum scarred eigenstates in a Rydberg atom chain: Entanglement, breakdown of thermalization, and stability to perturbations. Physical Review B. 2018;98(15). doi:10.1103/PhysRevB.98.155134"},"publication":"Physical Review B","article_processing_charge":"No","day":"22","scopus_import":"1"},{"abstract":[{"lang":"eng","text":"The drag of turbulent flows can be drastically decreased by adding small amounts of high molecular weight polymers. While drag reduction initially increases with polymer concentration, it eventually saturates to what is known as the maximum drag reduction (MDR) asymptote; this asymptote is generally attributed to the dynamics being reduced to a marginal yet persistent state of subdued turbulent motion. Contrary to this accepted view, we show that, for an appropriate choice of parameters, polymers can reduce the drag beyond the suggested asymptotic limit, eliminating turbulence and giving way to laminar flow. At higher polymer concentrations, however, the laminar state becomes unstable, resulting in a fluctuating flow with the characteristic drag of the MDR asymptote. Our findings indicate that the asymptotic state is hence dynamically disconnected from ordinary turbulence. © 2018 American Physical Society."}],"issue":"12","type":"journal_article","oa_version":"Preprint","title":"Exceeding the asymptotic limit of polymer drag reduction","status":"public","intvolume":" 120","_id":"328","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"19","article_processing_charge":"No","scopus_import":"1","date_published":"2018-03-19T00:00:00Z","publication":"Physical Review Letters","citation":{"ama":"Choueiri GH, Lopez Alonso JM, Hof B. Exceeding the asymptotic limit of polymer drag reduction. Physical Review Letters. 2018;120(12). doi:10.1103/PhysRevLett.120.124501","ista":"Choueiri GH, Lopez Alonso JM, Hof B. 2018. Exceeding the asymptotic limit of polymer drag reduction. Physical Review Letters. 120(12), 124501.","apa":"Choueiri, G. H., Lopez Alonso, J. M., & Hof, B. (2018). Exceeding the asymptotic limit of polymer drag reduction. Physical Review Letters. American Physical Society. https://doi.org/10.1103/PhysRevLett.120.124501","ieee":"G. H. Choueiri, J. M. Lopez Alonso, and B. Hof, “Exceeding the asymptotic limit of polymer drag reduction,” Physical Review Letters, vol. 120, no. 12. American Physical Society, 2018.","mla":"Choueiri, George H., et al. “Exceeding the Asymptotic Limit of Polymer Drag Reduction.” Physical Review Letters, vol. 120, no. 12, 124501, American Physical Society, 2018, doi:10.1103/PhysRevLett.120.124501.","short":"G.H. Choueiri, J.M. Lopez Alonso, B. Hof, Physical Review Letters 120 (2018).","chicago":"Choueiri, George H, Jose M Lopez Alonso, and Björn Hof. “Exceeding the Asymptotic Limit of Polymer Drag Reduction.” Physical Review Letters. American Physical Society, 2018. https://doi.org/10.1103/PhysRevLett.120.124501."},"publist_id":"7537","ec_funded":1,"article_number":"124501","date_created":"2018-12-11T11:45:51Z","date_updated":"2023-10-10T13:27:44Z","volume":120,"author":[{"last_name":"Choueiri","first_name":"George H","id":"448BD5BC-F248-11E8-B48F-1D18A9856A87","full_name":"Choueiri, George H"},{"full_name":"Lopez Alonso, Jose M","orcid":"0000-0002-0384-2022","id":"40770848-F248-11E8-B48F-1D18A9856A87","last_name":"Lopez Alonso","first_name":"Jose M"},{"first_name":"Björn","last_name":"Hof","id":"3A374330-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2057-2754","full_name":"Hof, Björn"}],"publication_status":"published","department":[{"_id":"BjHo"}],"publisher":"American Physical Society","acknowledgement":"The authors thank Philipp Maier and the IST Austria workshop for their dedicated technical support.","year":"2018","month":"03","acknowledged_ssus":[{"_id":"SSU"}],"language":[{"iso":"eng"}],"doi":"10.1103/PhysRevLett.120.124501","isi":1,"quality_controlled":"1","project":[{"grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme"},{"grant_number":"306589","_id":"25152F3A-B435-11E9-9278-68D0E5697425","name":"Decoding the complexity of turbulence at its origin","call_identifier":"FP7"}],"main_file_link":[{"url":"https://arxiv.org/abs/1703.06271","open_access":"1"}],"oa":1,"external_id":{"isi":["000427804000005"]}},{"article_processing_charge":"No","day":"13","scopus_import":"1","date_published":"2018-08-13T00:00:00Z","citation":{"short":"B. Suri, J. Tithof, R. Grigoriev, M. Schatz, Physical Review E 98 (2018).","mla":"Suri, Balachandra, et al. “Unstable Equilibria and Invariant Manifolds in Quasi-Two-Dimensional Kolmogorov-like Flow.” Physical Review E, vol. 98, no. 2, American Physical Society, 2018, doi:10.1103/PhysRevE.98.023105.","chicago":"Suri, Balachandra, Jeffrey Tithof, Roman Grigoriev, and Michael Schatz. “Unstable Equilibria and Invariant Manifolds in Quasi-Two-Dimensional Kolmogorov-like Flow.” Physical Review E. American Physical Society, 2018. https://doi.org/10.1103/PhysRevE.98.023105.","ama":"Suri B, Tithof J, Grigoriev R, Schatz M. Unstable equilibria and invariant manifolds in quasi-two-dimensional Kolmogorov-like flow. Physical Review E. 2018;98(2). doi:10.1103/PhysRevE.98.023105","apa":"Suri, B., Tithof, J., Grigoriev, R., & Schatz, M. (2018). Unstable equilibria and invariant manifolds in quasi-two-dimensional Kolmogorov-like flow. Physical Review E. American Physical Society. https://doi.org/10.1103/PhysRevE.98.023105","ieee":"B. Suri, J. Tithof, R. Grigoriev, and M. Schatz, “Unstable equilibria and invariant manifolds in quasi-two-dimensional Kolmogorov-like flow,” Physical Review E, vol. 98, no. 2. American Physical Society, 2018.","ista":"Suri B, Tithof J, Grigoriev R, Schatz M. 2018. Unstable equilibria and invariant manifolds in quasi-two-dimensional Kolmogorov-like flow. Physical Review E. 98(2)."},"publication":"Physical Review E","issue":"2","abstract":[{"text":"Recent studies suggest that unstable, nonchaotic solutions of the Navier-Stokes equation may provide deep insights into fluid turbulence. In this article, we present a combined experimental and numerical study exploring the dynamical role of unstable equilibrium solutions and their invariant manifolds in a weakly turbulent, electromagnetically driven, shallow fluid layer. Identifying instants when turbulent evolution slows down, we compute 31 unstable equilibria of a realistic two-dimensional model of the flow. We establish the dynamical relevance of these unstable equilibria by showing that they are closely visited by the turbulent flow. We also establish the dynamical relevance of unstable manifolds by verifying that they are shadowed by turbulent trajectories departing from the neighborhoods of unstable equilibria over large distances in state space.","lang":"eng"}],"type":"journal_article","oa_version":"Submitted Version","_id":"136","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 98","title":"Unstable equilibria and invariant manifolds in quasi-two-dimensional Kolmogorov-like flow","status":"public","month":"08","doi":"10.1103/PhysRevE.98.023105","language":[{"iso":"eng"}],"oa":1,"external_id":{"arxiv":["1808.02088"],"isi":["000441466800010"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1808.02088"}],"quality_controlled":"1","isi":1,"author":[{"first_name":"Balachandra","last_name":"Suri","id":"47A5E706-F248-11E8-B48F-1D18A9856A87","full_name":"Suri, Balachandra"},{"last_name":"Tithof","first_name":"Jeffrey","full_name":"Tithof, Jeffrey"},{"full_name":"Grigoriev, Roman","last_name":"Grigoriev","first_name":"Roman"},{"last_name":"Schatz","first_name":"Michael","full_name":"Schatz, Michael"}],"volume":98,"date_updated":"2023-10-10T13:29:10Z","date_created":"2018-12-11T11:44:49Z","year":"2018","publisher":"American Physical Society","department":[{"_id":"BjHo"}],"publication_status":"published"},{"day":"01","article_processing_charge":"No","scopus_import":"1","date_published":"2018-01-01T00:00:00Z","publication":"Journal of Medical Genetics","citation":{"ista":"Marin Valencia I, Novarino G, Johansen A, Rosti B, Issa M, Musaev D, Bhat G, Scott E, Silhavy J, Stanley V, Rosti R, Gleeson J, Imam F, Zaki M, Gleeson J. 2018. A homozygous founder mutation in TRAPPC6B associates with a neurodevelopmental disorder characterised by microcephaly epilepsy and autistic features. Journal of Medical Genetics. 55(1), 48–54.","apa":"Marin Valencia, I., Novarino, G., Johansen, A., Rosti, B., Issa, M., Musaev, D., … Gleeson, J. (2018). A homozygous founder mutation in TRAPPC6B associates with a neurodevelopmental disorder characterised by microcephaly epilepsy and autistic features. Journal of Medical Genetics. BMJ Publishing Group. https://doi.org/10.1136/jmedgenet-2017-104627","ieee":"I. Marin Valencia et al., “A homozygous founder mutation in TRAPPC6B associates with a neurodevelopmental disorder characterised by microcephaly epilepsy and autistic features,” Journal of Medical Genetics, vol. 55, no. 1. BMJ Publishing Group, pp. 48–54, 2018.","ama":"Marin Valencia I, Novarino G, Johansen A, et al. A homozygous founder mutation in TRAPPC6B associates with a neurodevelopmental disorder characterised by microcephaly epilepsy and autistic features. Journal of Medical Genetics. 2018;55(1):48-54. doi:10.1136/jmedgenet-2017-104627","chicago":"Marin Valencia, Isaac, Gaia Novarino, Anide Johansen, Başak Rosti, Mahmoud Issa, Damir Musaev, Gifty Bhat, et al. “A Homozygous Founder Mutation in TRAPPC6B Associates with a Neurodevelopmental Disorder Characterised by Microcephaly Epilepsy and Autistic Features.” Journal of Medical Genetics. BMJ Publishing Group, 2018. https://doi.org/10.1136/jmedgenet-2017-104627.","mla":"Marin Valencia, Isaac, et al. “A Homozygous Founder Mutation in TRAPPC6B Associates with a Neurodevelopmental Disorder Characterised by Microcephaly Epilepsy and Autistic Features.” Journal of Medical Genetics, vol. 55, no. 1, BMJ Publishing Group, 2018, pp. 48–54, doi:10.1136/jmedgenet-2017-104627.","short":"I. Marin Valencia, G. Novarino, A. Johansen, B. Rosti, M. Issa, D. Musaev, G. Bhat, E. Scott, J. Silhavy, V. Stanley, R. Rosti, J. Gleeson, F. Imam, M. Zaki, J. Gleeson, Journal of Medical Genetics 55 (2018) 48–54."},"article_type":"original","page":"48 - 54","abstract":[{"text":"Background: Transport protein particle (TRAPP) is a multisubunit complex that regulates membrane trafficking through the Golgi apparatus. The clinical phenotype associated with mutations in various TRAPP subunits has allowed elucidation of their functions in specific tissues. The role of some subunits in human disease, however, has not been fully established, and their functions remain uncertain.\r\n\r\nObjective: We aimed to expand the range of neurodevelopmental disorders associated with mutations in TRAPP subunits by exome sequencing of consanguineous families.\r\n\r\nMethods: Linkage and homozygosity mapping and candidate gene analysis were used to identify homozygous mutations in families. Patient fibroblasts were used to study splicing defect and zebrafish to model the disease.\r\n\r\nResults: We identified six individuals from three unrelated families with a founder homozygous splice mutation in TRAPPC6B, encoding a core subunit of the complex TRAPP I. Patients manifested a neurodevelopmental disorder characterised by microcephaly, epilepsy and autistic features, and showed splicing defect. Zebrafish trappc6b morphants replicated the human phenotype, displaying decreased head size and neuronal hyperexcitability, leading to a lower seizure threshold.\r\n\r\nConclusion: This study provides clinical and functional evidence of the role of TRAPPC6B in brain development and function.","lang":"eng"}],"issue":"1","type":"journal_article","oa_version":"Submitted Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"691","status":"public","title":"A homozygous founder mutation in TRAPPC6B associates with a neurodevelopmental disorder characterised by microcephaly epilepsy and autistic features","intvolume":" 55","month":"01","publication_identifier":{"issn":["0022-2593"]},"doi":"10.1136/jmedgenet-2017-104627","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6056005/","open_access":"1"}],"oa":1,"external_id":{"pmid":["28626029"],"isi":["000418199800007"]},"isi":1,"quality_controlled":"1","project":[{"_id":"254BA948-B435-11E9-9278-68D0E5697425","grant_number":"401299","name":"Probing development and reversibility of autism spectrum disorders"}],"publist_id":"7016","author":[{"full_name":"Marin Valencia, Isaac","last_name":"Marin Valencia","first_name":"Isaac"},{"full_name":"Novarino, Gaia","id":"3E57A680-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7673-7178","first_name":"Gaia","last_name":"Novarino"},{"full_name":"Johansen, Anide","last_name":"Johansen","first_name":"Anide"},{"full_name":"Rosti, Başak","first_name":"Başak","last_name":"Rosti"},{"last_name":"Issa","first_name":"Mahmoud","full_name":"Issa, Mahmoud"},{"full_name":"Musaev, Damir","first_name":"Damir","last_name":"Musaev"},{"first_name":"Gifty","last_name":"Bhat","full_name":"Bhat, Gifty"},{"full_name":"Scott, Eric","first_name":"Eric","last_name":"Scott"},{"full_name":"Silhavy, Jennifer","first_name":"Jennifer","last_name":"Silhavy"},{"full_name":"Stanley, Valentina","first_name":"Valentina","last_name":"Stanley"},{"full_name":"Rosti, Rasim","last_name":"Rosti","first_name":"Rasim"},{"full_name":"Gleeson, Jeremy","first_name":"Jeremy","last_name":"Gleeson"},{"first_name":"Farhad","last_name":"Imam","full_name":"Imam, Farhad"},{"first_name":"Maha","last_name":"Zaki","full_name":"Zaki, Maha"},{"last_name":"Gleeson","first_name":"Joseph","full_name":"Gleeson, Joseph"}],"date_updated":"2023-10-16T09:55:43Z","date_created":"2018-12-11T11:47:57Z","volume":55,"year":"2018","pmid":1,"publication_status":"published","department":[{"_id":"GaNo"}],"publisher":"BMJ Publishing Group"},{"abstract":[{"text":"Borel probability measures living on metric spaces are fundamental\r\nmathematical objects. There are several meaningful distance functions that make the collection of the probability measures living on a certain space a metric space. We are interested in the description of the structure of the isometries of such metric spaces. We overview some of the recent results of the topic and we also provide some new ones concerning the Wasserstein distance. More specifically, we consider the space of all Borel probability measures on the unit sphere of a Euclidean space endowed with the Wasserstein metric W_p for arbitrary p >= 1, and we show that the action of a Wasserstein isometry on the set of Dirac measures is induced by an isometry of the underlying unit sphere.","lang":"eng"}],"issue":"1-2","type":"journal_article","oa_version":"Preprint","status":"public","title":"Maps on probability measures preserving certain distances - a survey and some new results","intvolume":" 84","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"284","day":"04","article_processing_charge":"No","scopus_import":"1","date_published":"2018-06-04T00:00:00Z","article_type":"original","page":"65 - 80","publication":"Acta Scientiarum Mathematicarum","citation":{"ama":"Virosztek D. Maps on probability measures preserving certain distances - a survey and some new results. Acta Scientiarum Mathematicarum. 2018;84(1-2):65-80. doi:10.14232/actasm-018-753-y","ista":"Virosztek D. 2018. Maps on probability measures preserving certain distances - a survey and some new results. Acta Scientiarum Mathematicarum. 84(1–2), 65–80.","ieee":"D. Virosztek, “Maps on probability measures preserving certain distances - a survey and some new results,” Acta Scientiarum Mathematicarum, vol. 84, no. 1–2. Springer Nature, pp. 65–80, 2018.","apa":"Virosztek, D. (2018). Maps on probability measures preserving certain distances - a survey and some new results. Acta Scientiarum Mathematicarum. Springer Nature. https://doi.org/10.14232/actasm-018-753-y","mla":"Virosztek, Daniel. “Maps on Probability Measures Preserving Certain Distances - a Survey and Some New Results.” Acta Scientiarum Mathematicarum, vol. 84, no. 1–2, Springer Nature, 2018, pp. 65–80, doi:10.14232/actasm-018-753-y.","short":"D. Virosztek, Acta Scientiarum Mathematicarum 84 (2018) 65–80.","chicago":"Virosztek, Daniel. “Maps on Probability Measures Preserving Certain Distances - a Survey and Some New Results.” Acta Scientiarum Mathematicarum. Springer Nature, 2018. https://doi.org/10.14232/actasm-018-753-y."},"ec_funded":1,"publist_id":"7615","date_updated":"2023-10-16T10:29:22Z","date_created":"2018-12-11T11:45:36Z","volume":84,"author":[{"full_name":"Virosztek, Daniel","orcid":"0000-0003-1109-5511","id":"48DB45DA-F248-11E8-B48F-1D18A9856A87","last_name":"Virosztek","first_name":"Daniel"}],"publication_status":"published","department":[{"_id":"LaEr"}],"publisher":"Springer Nature","year":"2018","acknowledgement":"The author was supported by the ISTFELLOW program of the Institute of Science and Technol- ogy Austria (project code IC1027FELL01) and partially supported by the Hungarian National Research, Development and Innovation Office, NKFIH (grant no. K124152).","month":"06","publication_identifier":{"eissn":["2064-8316"],"issn":["0001-6969"]},"language":[{"iso":"eng"}],"doi":"10.14232/actasm-018-753-y","quality_controlled":"1","project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme"}],"oa":1,"external_id":{"arxiv":["1802.03305"]},"main_file_link":[{"url":"https://arxiv.org/abs/1802.03305","open_access":"1"}]},{"language":[{"iso":"eng"}],"doi":"10.5802/jep.64","project":[{"call_identifier":"H2020","name":"Analysis of quantum many-body systems","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","grant_number":"694227"},{"call_identifier":"FWF","name":"Structure of the Excitation Spectrum for Many-Body Quantum Systems","grant_number":"P27533_N27","_id":"25C878CE-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","external_id":{"arxiv":["1705.10676"]},"tmp":{"short":"CC BY-ND (4.0)","image":"/image/cc_by_nd.png","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode"},"oa":1,"publication_identifier":{"issn":["2429-7100"],"eissn":["2270-518X"]},"month":"07","volume":5,"date_created":"2018-12-11T11:45:03Z","date_updated":"2023-10-17T08:05:28Z","author":[{"first_name":"Mathieu","last_name":"Lewi","full_name":"Lewi, Mathieu"},{"first_name":"Élliott","last_name":"Lieb","full_name":"Lieb, Élliott"},{"orcid":"0000-0002-6781-0521","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","last_name":"Seiringer","first_name":"Robert","full_name":"Seiringer, Robert"}],"department":[{"_id":"RoSe"}],"publisher":"Ecole Polytechnique","publication_status":"published","acknowledgement":"This project has received funding from the European Research Council (ERC) under the European\r\nUnion’s Horizon 2020 research and innovation programme (grant agreement 694227 for R.S. and MDFT 725528 for M.L.). Financial support by the Austrian Science Fund (FWF), project No P 27533-N27 (R.S.) and by the US National Science Foundation, grant No PHY12-1265118 (E.H.L.) are gratefully acknowledged.","year":"2018","license":"https://creativecommons.org/licenses/by-nd/4.0/","publist_id":"7741","ec_funded":1,"file_date_updated":"2020-07-14T12:45:16Z","date_published":"2018-07-01T00:00:00Z","page":"79 - 116","article_type":"original","citation":{"ama":"Lewi M, Lieb É, Seiringer R. Statistical mechanics of the uniform electron gas. Journal de l’Ecole Polytechnique - Mathematiques. 2018;5:79-116. doi:10.5802/jep.64","ista":"Lewi M, Lieb É, Seiringer R. 2018. Statistical mechanics of the uniform electron gas. Journal de l’Ecole Polytechnique - Mathematiques. 5, 79–116.","apa":"Lewi, M., Lieb, É., & Seiringer, R. (2018). Statistical mechanics of the uniform electron gas. Journal de l’Ecole Polytechnique - Mathematiques. Ecole Polytechnique. https://doi.org/10.5802/jep.64","ieee":"M. Lewi, É. Lieb, and R. Seiringer, “Statistical mechanics of the uniform electron gas,” Journal de l’Ecole Polytechnique - Mathematiques, vol. 5. Ecole Polytechnique, pp. 79–116, 2018.","mla":"Lewi, Mathieu, et al. “Statistical Mechanics of the Uniform Electron Gas.” Journal de l’Ecole Polytechnique - Mathematiques, vol. 5, Ecole Polytechnique, 2018, pp. 79–116, doi:10.5802/jep.64.","short":"M. Lewi, É. Lieb, R. Seiringer, Journal de l’Ecole Polytechnique - Mathematiques 5 (2018) 79–116.","chicago":"Lewi, Mathieu, Élliott Lieb, and Robert Seiringer. “Statistical Mechanics of the Uniform Electron Gas.” Journal de l’Ecole Polytechnique - Mathematiques. Ecole Polytechnique, 2018. https://doi.org/10.5802/jep.64."},"publication":"Journal de l'Ecole Polytechnique - Mathematiques","has_accepted_license":"1","article_processing_charge":"No","day":"01","scopus_import":"1","file":[{"access_level":"open_access","file_name":"2018_JournaldeLecoleMath_Lewi.pdf","creator":"dernst","file_size":843938,"content_type":"application/pdf","file_id":"5726","relation":"main_file","checksum":"1ba7cccdf3900f42c4f715ae75d6813c","date_updated":"2020-07-14T12:45:16Z","date_created":"2018-12-17T16:38:18Z"}],"oa_version":"Published Version","intvolume":" 5","title":"Statistical mechanics of the uniform electron gas","status":"public","ddc":["510"],"_id":"180","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"In this paper we define and study the classical Uniform Electron Gas (UEG), a system of infinitely many electrons whose density is constant everywhere in space. The UEG is defined differently from Jellium, which has a positive constant background but no constraint on the density. We prove that the UEG arises in Density Functional Theory in the limit of a slowly varying density, minimizing the indirect Coulomb energy. We also construct the quantum UEG and compare it to the classical UEG at low density."}],"type":"journal_article"},{"author":[{"first_name":"Siegfried","last_name":"Reipert","full_name":"Reipert, Siegfried"},{"full_name":"Goldammer, Helmuth","first_name":"Helmuth","last_name":"Goldammer"},{"full_name":"Richardson, Christine","last_name":"Richardson","first_name":"Christine"},{"first_name":"Martin","last_name":"Goldberg","full_name":"Goldberg, Martin"},{"last_name":"Hawkins","first_name":"Timothy","full_name":"Hawkins, Timothy"},{"id":"3C054040-F248-11E8-B48F-1D18A9856A87","first_name":"Elena","last_name":"Hollergschwandtner","full_name":"Hollergschwandtner, Elena"},{"first_name":"Walter","last_name":"Kaufmann","id":"3F99E422-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9735-5315","full_name":"Kaufmann, Walter"},{"full_name":"Antreich, Sebastian","last_name":"Antreich","first_name":"Sebastian"},{"full_name":"Stierhof, York","first_name":"York","last_name":"Stierhof"}],"date_updated":"2023-10-17T08:42:24Z","date_created":"2018-12-11T11:44:57Z","volume":66,"year":"2018","pmid":1,"publication_status":"published","publisher":"SAGE Publications","department":[{"_id":"RySh"},{"_id":"EM-Fac"}],"doi":"10.1369/0022155418786698","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://doi.org/10.1369/0022155418786698","open_access":"1"}],"oa":1,"external_id":{"pmid":["29969056"],"isi":["000452277700005"]},"quality_controlled":"1","isi":1,"month":"12","publication_identifier":{"issn":["0022-1554"]},"oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"163","title":"Agitation modules: Flexible means to accelerate automated freeze substitution","status":"public","intvolume":" 66","abstract":[{"lang":"eng","text":"For ultrafast fixation of biological samples to avoid artifacts, high-pressure freezing (HPF) followed by freeze substitution (FS) is preferred over chemical fixation at room temperature. After HPF, samples are maintained at low temperature during dehydration and fixation, while avoiding damaging recrystallization. This is a notoriously slow process. McDonald and Webb demonstrated, in 2011, that sample agitation during FS dramatically reduces the necessary time. Then, in 2015, we (H.G. and S.R.) introduced an agitation module into the cryochamber of an automated FS unit and demonstrated that the preparation of algae could be shortened from days to a couple of hours. We argued that variability in the processing, reproducibility, and safety issues are better addressed using automated FS units. For dissemination, we started low-cost manufacturing of agitation modules for two of the most widely used FS units, the Automatic Freeze Substitution Systems, AFS(1) and AFS2, from Leica Microsystems, using three dimensional (3D)-printing of the major components. To test them, several labs independently used the modules on a wide variety of specimens that had previously been processed by manual agitation, or without agitation. We demonstrate that automated processing with sample agitation saves time, increases flexibility with respect to sample requirements and protocols, and produces data of at least as good quality as other approaches."}],"issue":"12","type":"journal_article","date_published":"2018-12-01T00:00:00Z","publication":"Journal of Histochemistry and Cytochemistry","citation":{"apa":"Reipert, S., Goldammer, H., Richardson, C., Goldberg, M., Hawkins, T., Saeckl, E., … Stierhof, Y. (2018). Agitation modules: Flexible means to accelerate automated freeze substitution. Journal of Histochemistry and Cytochemistry. SAGE Publications. https://doi.org/10.1369/0022155418786698","ieee":"S. Reipert et al., “Agitation modules: Flexible means to accelerate automated freeze substitution,” Journal of Histochemistry and Cytochemistry, vol. 66, no. 12. SAGE Publications, pp. 903–921, 2018.","ista":"Reipert S, Goldammer H, Richardson C, Goldberg M, Hawkins T, Saeckl E, Kaufmann W, Antreich S, Stierhof Y. 2018. Agitation modules: Flexible means to accelerate automated freeze substitution. Journal of Histochemistry and Cytochemistry. 66(12), 903–921.","ama":"Reipert S, Goldammer H, Richardson C, et al. Agitation modules: Flexible means to accelerate automated freeze substitution. Journal of Histochemistry and Cytochemistry. 2018;66(12):903-921. doi:10.1369/0022155418786698","chicago":"Reipert, Siegfried, Helmuth Goldammer, Christine Richardson, Martin Goldberg, Timothy Hawkins, Elena Saeckl, Walter Kaufmann, Sebastian Antreich, and York Stierhof. “Agitation Modules: Flexible Means to Accelerate Automated Freeze Substitution.” Journal of Histochemistry and Cytochemistry. SAGE Publications, 2018. https://doi.org/10.1369/0022155418786698.","short":"S. Reipert, H. Goldammer, C. Richardson, M. Goldberg, T. Hawkins, E. Saeckl, W. Kaufmann, S. Antreich, Y. Stierhof, Journal of Histochemistry and Cytochemistry 66 (2018) 903–921.","mla":"Reipert, Siegfried, et al. “Agitation Modules: Flexible Means to Accelerate Automated Freeze Substitution.” Journal of Histochemistry and Cytochemistry, vol. 66, no. 12, SAGE Publications, 2018, pp. 903–21, doi:10.1369/0022155418786698."},"article_type":"original","page":"903-921","day":"01","article_processing_charge":"No","scopus_import":"1"},{"page":"4442-4450","citation":{"ama":"Sahoo S, Lampert C, Martius GS. Learning equations for extrapolation and control. In: Proceedings of the 35th International Conference on Machine Learning. Vol 80. ML Research Press; 2018:4442-4450.","ieee":"S. Sahoo, C. Lampert, and G. S. Martius, “Learning equations for extrapolation and control,” in Proceedings of the 35th International Conference on Machine Learning, Stockholm, Sweden, 2018, vol. 80, pp. 4442–4450.","apa":"Sahoo, S., Lampert, C., & Martius, G. S. (2018). Learning equations for extrapolation and control. In Proceedings of the 35th International Conference on Machine Learning (Vol. 80, pp. 4442–4450). Stockholm, Sweden: ML Research Press.","ista":"Sahoo S, Lampert C, Martius GS. 2018. Learning equations for extrapolation and control. Proceedings of the 35th International Conference on Machine Learning. ICML: International Conference on Machine Learning vol. 80, 4442–4450.","short":"S. Sahoo, C. Lampert, G.S. Martius, in:, Proceedings of the 35th International Conference on Machine Learning, ML Research Press, 2018, pp. 4442–4450.","mla":"Sahoo, Subham, et al. “Learning Equations for Extrapolation and Control.” Proceedings of the 35th International Conference on Machine Learning, vol. 80, ML Research Press, 2018, pp. 4442–50.","chicago":"Sahoo, Subham, Christoph Lampert, and Georg S Martius. “Learning Equations for Extrapolation and Control.” In Proceedings of the 35th International Conference on Machine Learning, 80:4442–50. ML Research Press, 2018."},"publication":"Proceedings of the 35th International Conference on Machine Learning","date_published":"2018-02-01T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"01","intvolume":" 80","status":"public","title":"Learning equations for extrapolation and control","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"6012","oa_version":"Preprint","type":"conference","abstract":[{"lang":"eng","text":"We present an approach to identify concise equations from data using a shallow neural network approach. In contrast to ordinary black-box regression, this approach allows understanding functional relations and generalizing them from observed data to unseen parts of the parameter space. We show how to extend the class of learnable equations for a recently proposed equation learning network to include divisions, and we improve the learning and model selection strategy to be useful for challenging real-world data. For systems governed by analytical expressions, our method can in many cases identify the true underlying equation and extrapolate to unseen domains. We demonstrate its effectiveness by experiments on a cart-pendulum system, where only 2 random rollouts are required to learn the forward dynamics and successfully achieve the swing-up task."}],"project":[{"grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme"}],"isi":1,"quality_controlled":"1","oa":1,"external_id":{"isi":["000683379204058"],"arxiv":["1806.07259"]},"main_file_link":[{"url":"https://arxiv.org/abs/1806.07259","open_access":"1"}],"language":[{"iso":"eng"}],"conference":{"name":"ICML: International Conference on Machine Learning","end_date":"2018-07-15","location":"Stockholm, Sweden","start_date":"2018-07-10"},"month":"02","publisher":"ML Research Press","department":[{"_id":"ChLa"}],"publication_status":"published","year":"2018","volume":80,"date_updated":"2023-10-17T09:50:53Z","date_created":"2019-02-14T15:21:07Z","related_material":{"link":[{"url":"https://ist.ac.at/en/news/first-machine-learning-method-capable-of-accurate-extrapolation/","description":"News on IST Homepage","relation":"press_release"}]},"author":[{"full_name":"Sahoo, Subham","first_name":"Subham","last_name":"Sahoo"},{"full_name":"Lampert, Christoph","orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","last_name":"Lampert","first_name":"Christoph"},{"last_name":"Martius","first_name":"Georg S","id":"3A276B68-F248-11E8-B48F-1D18A9856A87","full_name":"Martius, Georg S"}],"ec_funded":1},{"month":"02","language":[{"iso":"eng"}],"conference":{"name":"ICML: International Conference on Machine Learning","end_date":"2018-07-15","location":"Stockholm, Sweden","start_date":"2018-07-10"},"isi":1,"quality_controlled":"1","project":[{"call_identifier":"FP7","name":"Lifelong Learning of Visual Scene Understanding","_id":"2532554C-B435-11E9-9278-68D0E5697425","grant_number":"308036"}],"external_id":{"isi":["000683379202095"],"arxiv":["1703.01678"]},"main_file_link":[{"url":"https://arxiv.org/abs/1703.01678","open_access":"1"}],"oa":1,"ec_funded":1,"date_updated":"2023-10-17T09:51:13Z","date_created":"2019-02-14T14:51:57Z","volume":80,"author":[{"first_name":"Ilja","last_name":"Kuzborskij","full_name":"Kuzborskij, Ilja"},{"full_name":"Lampert, Christoph","orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","last_name":"Lampert","first_name":"Christoph"}],"publication_status":"published","department":[{"_id":"ChLa"}],"publisher":"ML Research Press","year":"2018","day":"01","article_processing_charge":"No","scopus_import":"1","date_published":"2018-02-01T00:00:00Z","page":"2815-2824","publication":"Proceedings of the 35 th International Conference on Machine Learning","citation":{"ista":"Kuzborskij I, Lampert C. 2018. Data-dependent stability of stochastic gradient descent. Proceedings of the 35 th International Conference on Machine Learning. ICML: International Conference on Machine Learning vol. 80, 2815–2824.","apa":"Kuzborskij, I., & Lampert, C. (2018). Data-dependent stability of stochastic gradient descent. In Proceedings of the 35 th International Conference on Machine Learning (Vol. 80, pp. 2815–2824). Stockholm, Sweden: ML Research Press.","ieee":"I. Kuzborskij and C. Lampert, “Data-dependent stability of stochastic gradient descent,” in Proceedings of the 35 th International Conference on Machine Learning, Stockholm, Sweden, 2018, vol. 80, pp. 2815–2824.","ama":"Kuzborskij I, Lampert C. Data-dependent stability of stochastic gradient descent. In: Proceedings of the 35 Th International Conference on Machine Learning. Vol 80. ML Research Press; 2018:2815-2824.","chicago":"Kuzborskij, Ilja, and Christoph Lampert. “Data-Dependent Stability of Stochastic Gradient Descent.” In Proceedings of the 35 Th International Conference on Machine Learning, 80:2815–24. ML Research Press, 2018.","mla":"Kuzborskij, Ilja, and Christoph Lampert. “Data-Dependent Stability of Stochastic Gradient Descent.” Proceedings of the 35 Th International Conference on Machine Learning, vol. 80, ML Research Press, 2018, pp. 2815–24.","short":"I. Kuzborskij, C. Lampert, in:, Proceedings of the 35 Th International Conference on Machine Learning, ML Research Press, 2018, pp. 2815–2824."},"abstract":[{"lang":"eng","text":"We establish a data-dependent notion of algorithmic stability for Stochastic Gradient Descent (SGD), and employ it to develop novel generalization bounds. This is in contrast to previous distribution-free algorithmic stability results for SGD which depend on the worst-case constants. By virtue of the data-dependent argument, our bounds provide new insights into learning with SGD on convex and non-convex problems. In the convex case, we show that the bound on the generalization error depends on the risk at the initialization point. In the non-convex case, we prove that the expected curvature of the objective function around the initialization point has crucial influence on the generalization error. In both cases, our results suggest a simple data-driven strategy to stabilize SGD by pre-screening its initialization. As a corollary, our results allow us to show optimistic generalization bounds that exhibit fast convergence rates for SGD subject to a vanishing empirical risk and low noise of stochastic gradient. "}],"type":"conference","oa_version":"Preprint","title":"Data-dependent stability of stochastic gradient descent","status":"public","intvolume":" 80","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"6011"},{"_id":"6589","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","title":"The convergence of sparsified gradient methods","oa_version":"Preprint","type":"conference","abstract":[{"lang":"eng","text":"Distributed training of massive machine learning models, in particular deep neural networks, via Stochastic Gradient Descent (SGD) is becoming commonplace. Several families of communication-reduction methods, such as quantization, large-batch methods, and gradient sparsification, have been proposed. To date, gradient sparsification methods--where each node sorts gradients by magnitude, and only communicates a subset of the components, accumulating the rest locally--are known to yield some of the largest practical gains. Such methods can reduce the amount of communication per step by up to \\emph{three orders of magnitude}, while preserving model accuracy. Yet, this family of methods currently has no theoretical justification. This is the question we address in this paper. We prove that, under analytic assumptions, sparsifying gradients by magnitude with local error correction provides convergence guarantees, for both convex and non-convex smooth objectives, for data-parallel SGD. The main insight is that sparsification methods implicitly maintain bounds on the maximum impact of stale updates, thanks to selection by magnitude. Our analysis and empirical validation also reveal that these methods do require analytical conditions to converge well, justifying existing heuristics."}],"publication":"Advances in Neural Information Processing Systems 31","citation":{"chicago":"Alistarh, Dan-Adrian, Torsten Hoefler, Mikael Johansson, Nikola H Konstantinov, Sarit Khirirat, and Cedric Renggli. “The Convergence of Sparsified Gradient Methods.” In Advances in Neural Information Processing Systems 31, Volume 2018:5973–83. Neural Information Processing Systems Foundation, 2018.","short":"D.-A. Alistarh, T. Hoefler, M. Johansson, N.H. Konstantinov, S. Khirirat, C. Renggli, in:, Advances in Neural Information Processing Systems 31, Neural Information Processing Systems Foundation, 2018, pp. 5973–5983.","mla":"Alistarh, Dan-Adrian, et al. “The Convergence of Sparsified Gradient Methods.” Advances in Neural Information Processing Systems 31, vol. Volume 2018, Neural Information Processing Systems Foundation, 2018, pp. 5973–83.","ieee":"D.-A. Alistarh, T. Hoefler, M. Johansson, N. H. Konstantinov, S. Khirirat, and C. Renggli, “The convergence of sparsified gradient methods,” in Advances in Neural Information Processing Systems 31, Montreal, Canada, 2018, vol. Volume 2018, pp. 5973–5983.","apa":"Alistarh, D.-A., Hoefler, T., Johansson, M., Konstantinov, N. H., Khirirat, S., & Renggli, C. (2018). The convergence of sparsified gradient methods. In Advances in Neural Information Processing Systems 31 (Vol. Volume 2018, pp. 5973–5983). Montreal, Canada: Neural Information Processing Systems Foundation.","ista":"Alistarh D-A, Hoefler T, Johansson M, Konstantinov NH, Khirirat S, Renggli C. 2018. The convergence of sparsified gradient methods. Advances in Neural Information Processing Systems 31. NeurIPS: Conference on Neural Information Processing Systems vol. Volume 2018, 5973–5983.","ama":"Alistarh D-A, Hoefler T, Johansson M, Konstantinov NH, Khirirat S, Renggli C. The convergence of sparsified gradient methods. In: Advances in Neural Information Processing Systems 31. Vol Volume 2018. Neural Information Processing Systems Foundation; 2018:5973-5983."},"page":"5973-5983","date_published":"2018-12-01T00:00:00Z","scopus_import":"1","day":"01","article_processing_charge":"No","year":"2018","publication_status":"published","department":[{"_id":"DaAl"},{"_id":"ChLa"}],"publisher":"Neural Information Processing Systems Foundation","author":[{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian"},{"full_name":"Hoefler, Torsten","last_name":"Hoefler","first_name":"Torsten"},{"last_name":"Johansson","first_name":"Mikael","full_name":"Johansson, Mikael"},{"first_name":"Nikola H","last_name":"Konstantinov","id":"4B9D76E4-F248-11E8-B48F-1D18A9856A87","full_name":"Konstantinov, Nikola H"},{"last_name":"Khirirat","first_name":"Sarit","full_name":"Khirirat, Sarit"},{"first_name":"Cedric","last_name":"Renggli","full_name":"Renggli, Cedric"}],"date_created":"2019-06-27T09:32:55Z","date_updated":"2023-10-17T11:47:20Z","volume":"Volume 2018","ec_funded":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1809.10505"}],"oa":1,"external_id":{"arxiv":["1809.10505"],"isi":["000461852000047"]},"isi":1,"quality_controlled":"1","project":[{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","call_identifier":"H2020","name":"International IST Doctoral Program"}],"conference":{"end_date":"2018-12-08","start_date":"2018-12-02","location":"Montreal, Canada","name":"NeurIPS: Conference on Neural Information Processing Systems"},"language":[{"iso":"eng"}],"month":"12"},{"ec_funded":1,"publist_id":"8049","acknowledgement":"This project was funded by two European Research Council Advanced Grants (Social Life, 249375, and resiliANT, 741491) and two Swiss National Science Foundation grants (CR32I3_141063 and 310030_156732) to L.K. and a European Research Council Starting Grant (SocialVaccines, 243071) to S.C.","year":"2018","publisher":"AAAS","department":[{"_id":"SyCr"}],"publication_status":"published","related_material":{"link":[{"url":"https://ist.ac.at/en/news/for-ants-unity-is-strength-and-health/","description":"News on IST Homepage","relation":"press_release"}],"record":[{"relation":"research_data","status":"public","id":"13055"}]},"author":[{"last_name":"Stroeymeyt","first_name":"Nathalie","full_name":"Stroeymeyt, Nathalie"},{"full_name":"Grasse, Anna V","last_name":"Grasse","first_name":"Anna V","id":"406F989C-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Crespi, Alessandro","last_name":"Crespi","first_name":"Alessandro"},{"full_name":"Mersch, Danielle","first_name":"Danielle","last_name":"Mersch"},{"full_name":"Cremer, Sylvia","first_name":"Sylvia","last_name":"Cremer","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2193-3868"},{"last_name":"Keller","first_name":"Laurent","full_name":"Keller, Laurent"}],"volume":362,"date_created":"2018-12-11T11:44:07Z","date_updated":"2023-10-17T11:50:05Z","publication_identifier":{"issn":["1095-9203"]},"month":"11","oa":1,"external_id":{"isi":["000451124500041"]},"main_file_link":[{"open_access":"1","url":"https://serval.unil.ch/resource/serval:BIB_E9228C205467.P001/REF.pdf"}],"project":[{"grant_number":"243071","_id":"25DC711C-B435-11E9-9278-68D0E5697425","name":"Social Vaccination in Ant Colonies: from Individual Mechanisms to Society Effects","call_identifier":"FP7"}],"quality_controlled":"1","isi":1,"doi":"10.1126/science.aat4793","language":[{"iso":"eng"}],"type":"journal_article","issue":"6417","abstract":[{"text":"Animal social networks are shaped by multiple selection pressures, including the need to ensure efficient communication and functioning while simultaneously limiting disease transmission. Social animals could potentially further reduce epidemic risk by altering their social networks in the presence of pathogens, yet there is currently no evidence for such pathogen-triggered responses. We tested this hypothesis experimentally in the ant Lasius niger using a combination of automated tracking, controlled pathogen exposure, transmission quantification, and temporally explicit simulations. Pathogen exposure induced behavioral changes in both exposed ants and their nestmates, which helped contain the disease by reinforcing key transmission-inhibitory properties of the colony's contact network. This suggests that social network plasticity in response to pathogens is an effective strategy for mitigating the effects of disease in social groups.","lang":"eng"}],"_id":"7","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 362","title":"Social network plasticity decreases disease transmission in a eusocial insect","status":"public","oa_version":"Published Version","scopus_import":"1","article_processing_charge":"No","day":"23","citation":{"mla":"Stroeymeyt, Nathalie, et al. “Social Network Plasticity Decreases Disease Transmission in a Eusocial Insect.” Science, vol. 362, no. 6417, AAAS, 2018, pp. 941–45, doi:10.1126/science.aat4793.","short":"N. Stroeymeyt, A.V. Grasse, A. Crespi, D. Mersch, S. Cremer, L. Keller, Science 362 (2018) 941–945.","chicago":"Stroeymeyt, Nathalie, Anna V Grasse, Alessandro Crespi, Danielle Mersch, Sylvia Cremer, and Laurent Keller. “Social Network Plasticity Decreases Disease Transmission in a Eusocial Insect.” Science. AAAS, 2018. https://doi.org/10.1126/science.aat4793.","ama":"Stroeymeyt N, Grasse AV, Crespi A, Mersch D, Cremer S, Keller L. Social network plasticity decreases disease transmission in a eusocial insect. Science. 2018;362(6417):941-945. doi:10.1126/science.aat4793","ista":"Stroeymeyt N, Grasse AV, Crespi A, Mersch D, Cremer S, Keller L. 2018. Social network plasticity decreases disease transmission in a eusocial insect. Science. 362(6417), 941–945.","ieee":"N. Stroeymeyt, A. V. Grasse, A. Crespi, D. Mersch, S. Cremer, and L. Keller, “Social network plasticity decreases disease transmission in a eusocial insect,” Science, vol. 362, no. 6417. AAAS, pp. 941–945, 2018.","apa":"Stroeymeyt, N., Grasse, A. V., Crespi, A., Mersch, D., Cremer, S., & Keller, L. (2018). Social network plasticity decreases disease transmission in a eusocial insect. Science. AAAS. https://doi.org/10.1126/science.aat4793"},"publication":"Science","page":"941 - 945","article_type":"original","date_published":"2018-11-23T00:00:00Z"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"19","intvolume":" 35","status":"public","title":"Nonoptimal gene expression creates latent potential for antibiotic resistance","oa_version":"Submitted Version","type":"journal_article","issue":"11","abstract":[{"lang":"eng","text":"Bacteria regulate genes to survive antibiotic stress, but regulation can be far from perfect. When regulation is not optimal, mutations that change gene expression can contribute to antibiotic resistance. It is not systematically understood to what extent natural gene regulation is or is not optimal for distinct antibiotics, and how changes in expression of specific genes quantitatively affect antibiotic resistance. Here we discover a simple quantitative relation between fitness, gene expression, and antibiotic potency, which rationalizes our observation that a multitude of genes and even innate antibiotic defense mechanisms have expression that is critically nonoptimal under antibiotic treatment. First, we developed a pooled-strain drug-diffusion assay and screened Escherichia coli overexpression and knockout libraries, finding that resistance to a range of 31 antibiotics could result from changing expression of a large and functionally diverse set of genes, in a primarily but not exclusively drug-specific manner. Second, by synthetically controlling the expression of single-drug and multidrug resistance genes, we observed that their fitness-expression functions changed dramatically under antibiotic treatment in accordance with a log-sensitivity relation. Thus, because many genes are nonoptimally expressed under antibiotic treatment, many regulatory mutations can contribute to resistance by altering expression and by activating latent defenses."}],"citation":{"short":"A. Palmer, R.P. Chait, R. Kishony, Molecular Biology and Evolution 35 (2018) 2669–2684.","mla":"Palmer, Adam, et al. “Nonoptimal Gene Expression Creates Latent Potential for Antibiotic Resistance.” Molecular Biology and Evolution, vol. 35, no. 11, Oxford University Press, 2018, pp. 2669–84, doi:10.1093/molbev/msy163.","chicago":"Palmer, Adam, Remy P Chait, and Roy Kishony. “Nonoptimal Gene Expression Creates Latent Potential for Antibiotic Resistance.” Molecular Biology and Evolution. Oxford University Press, 2018. https://doi.org/10.1093/molbev/msy163.","ama":"Palmer A, Chait RP, Kishony R. Nonoptimal gene expression creates latent potential for antibiotic resistance. Molecular Biology and Evolution. 2018;35(11):2669-2684. doi:10.1093/molbev/msy163","apa":"Palmer, A., Chait, R. P., & Kishony, R. (2018). Nonoptimal gene expression creates latent potential for antibiotic resistance. Molecular Biology and Evolution. Oxford University Press. https://doi.org/10.1093/molbev/msy163","ieee":"A. Palmer, R. P. Chait, and R. Kishony, “Nonoptimal gene expression creates latent potential for antibiotic resistance,” Molecular Biology and Evolution, vol. 35, no. 11. Oxford University Press, pp. 2669–2684, 2018.","ista":"Palmer A, Chait RP, Kishony R. 2018. Nonoptimal gene expression creates latent potential for antibiotic resistance. Molecular Biology and Evolution. 35(11), 2669–2684."},"publication":"Molecular Biology and Evolution","page":"2669 - 2684","article_type":"original","date_published":"2018-08-28T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"28","pmid":1,"year":"2018","publisher":"Oxford University Press","department":[{"_id":"CaGu"},{"_id":"GaTk"}],"publication_status":"published","author":[{"last_name":"Palmer","first_name":"Adam","full_name":"Palmer, Adam"},{"full_name":"Chait, Remy P","id":"3464AE84-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0876-3187","first_name":"Remy P","last_name":"Chait"},{"first_name":"Roy","last_name":"Kishony","full_name":"Kishony, Roy"}],"volume":35,"date_updated":"2023-10-17T11:51:06Z","date_created":"2018-12-11T11:44:11Z","publist_id":"8036","external_id":{"pmid":["30169679"],"isi":["000452567200006"]},"oa":1,"main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pubmed/30169679"}],"isi":1,"quality_controlled":"1","doi":"10.1093/molbev/msy163","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0737-4038"]},"month":"08"},{"date_created":"2018-12-11T11:44:07Z","date_updated":"2023-10-17T11:49:25Z","oa_version":"None","volume":141,"author":[{"first_name":"Javier","last_name":"Masís","full_name":"Masís, Javier"},{"last_name":"Mankus","first_name":"David","full_name":"Mankus, David"},{"full_name":"Wolff, Steffen","last_name":"Wolff","first_name":"Steffen"},{"first_name":"Grigori","last_name":"Guitchounts","full_name":"Guitchounts, Grigori"},{"last_name":"Jösch","first_name":"Maximilian A","orcid":"0000-0002-3937-1330","id":"2BD278E6-F248-11E8-B48F-1D18A9856A87","full_name":"Jösch, Maximilian A"},{"first_name":"David","last_name":"Cox","full_name":"Cox, David"}],"status":"public","title":"A micro-CT-based method for characterising lesions and locating electrodes in small animal brains","publication_status":"published","department":[{"_id":"MaJö"}],"publisher":"MyJove Corporation","intvolume":" 141","_id":"6","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2018","abstract":[{"lang":"eng","text":"Lesion and electrode location verification are traditionally done via histological examination of stained brain slices, a time-consuming procedure that requires manual estimation. Here, we describe a simple, straightforward method for quantifying lesions and locating electrodes in the brain that is less laborious and yields more detailed results. Whole brains are stained with osmium tetroxide, embedded in resin, and imaged with a micro-CT scanner. The scans result in 3D digital volumes of the brains with resolutions and virtual section thicknesses dependent on the sample size (12-15 and 5-6 µm per voxel for rat and zebra finch brains, respectively). Surface and deep lesions can be characterized, and single tetrodes, tetrode arrays, electrolytic lesions, and silicon probes can also be localized. Free and proprietary software allows experimenters to examine the sample volume from any plane and segment the volume manually or automatically. Because this method generates whole brain volume, lesions and electrodes can be quantified to a much higher degree than in current methods, which will help standardize comparisons within and across studies."}],"publist_id":"8050","type":"journal_article","language":[{"iso":"eng"}],"date_published":"2018-11-08T00:00:00Z","doi":"10.3791/58585","isi":1,"quality_controlled":"1","publication":"Journal of visualized experiments","external_id":{"isi":["000456469400103"]},"citation":{"mla":"Masís, Javier, et al. “A Micro-CT-Based Method for Characterising Lesions and Locating Electrodes in Small Animal Brains.” Journal of Visualized Experiments, vol. 141, MyJove Corporation, 2018, doi:10.3791/58585.","short":"J. Masís, D. Mankus, S. Wolff, G. Guitchounts, M.A. Jösch, D. Cox, Journal of Visualized Experiments 141 (2018).","chicago":"Masís, Javier, David Mankus, Steffen Wolff, Grigori Guitchounts, Maximilian A Jösch, and David Cox. “A Micro-CT-Based Method for Characterising Lesions and Locating Electrodes in Small Animal Brains.” Journal of Visualized Experiments. MyJove Corporation, 2018. https://doi.org/10.3791/58585.","ama":"Masís J, Mankus D, Wolff S, Guitchounts G, Jösch MA, Cox D. A micro-CT-based method for characterising lesions and locating electrodes in small animal brains. Journal of visualized experiments. 2018;141. doi:10.3791/58585","ista":"Masís J, Mankus D, Wolff S, Guitchounts G, Jösch MA, Cox D. 2018. A micro-CT-based method for characterising lesions and locating electrodes in small animal brains. Journal of visualized experiments. 141.","apa":"Masís, J., Mankus, D., Wolff, S., Guitchounts, G., Jösch, M. A., & Cox, D. (2018). A micro-CT-based method for characterising lesions and locating electrodes in small animal brains. Journal of Visualized Experiments. MyJove Corporation. https://doi.org/10.3791/58585","ieee":"J. Masís, D. Mankus, S. Wolff, G. Guitchounts, M. A. Jösch, and D. Cox, “A micro-CT-based method for characterising lesions and locating electrodes in small animal brains,” Journal of visualized experiments, vol. 141. MyJove Corporation, 2018."},"month":"11","day":"08","article_processing_charge":"No","scopus_import":"1"},{"doi":"10.5281/ZENODO.1322669","date_published":"2018-10-23T00:00:00Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"main_file_link":[{"url":"https://doi.org/10.5281/zenodo.1480665","open_access":"1"}],"citation":{"mla":"Stroeymeyt, Nathalie, et al. Social Network Plasticity Decreases Disease Transmission in a Eusocial Insect. Zenodo, 2018, doi:10.5281/ZENODO.1322669.","short":"N. Stroeymeyt, A.V. Grasse, A. Crespi, D. Mersch, S. Cremer, L. Keller, (2018).","chicago":"Stroeymeyt, Nathalie, Anna V Grasse, Alessandro Crespi, Danielle Mersch, Sylvia Cremer, and Laurent Keller. “Social Network Plasticity Decreases Disease Transmission in a Eusocial Insect.” Zenodo, 2018. https://doi.org/10.5281/ZENODO.1322669.","ama":"Stroeymeyt N, Grasse AV, Crespi A, Mersch D, Cremer S, Keller L. Social network plasticity decreases disease transmission in a eusocial insect. 2018. doi:10.5281/ZENODO.1322669","ista":"Stroeymeyt N, Grasse AV, Crespi A, Mersch D, Cremer S, Keller L. 2018. Social network plasticity decreases disease transmission in a eusocial insect, Zenodo, 10.5281/ZENODO.1322669.","apa":"Stroeymeyt, N., Grasse, A. V., Crespi, A., Mersch, D., Cremer, S., & Keller, L. (2018). Social network plasticity decreases disease transmission in a eusocial insect. Zenodo. https://doi.org/10.5281/ZENODO.1322669","ieee":"N. Stroeymeyt, A. V. Grasse, A. Crespi, D. Mersch, S. Cremer, and L. Keller, “Social network plasticity decreases disease transmission in a eusocial insect.” Zenodo, 2018."},"day":"23","month":"10","article_processing_charge":"No","author":[{"full_name":"Stroeymeyt, Nathalie","last_name":"Stroeymeyt","first_name":"Nathalie"},{"full_name":"Grasse, Anna V","id":"406F989C-F248-11E8-B48F-1D18A9856A87","last_name":"Grasse","first_name":"Anna V"},{"full_name":"Crespi, Alessandro","first_name":"Alessandro","last_name":"Crespi"},{"first_name":"Danielle","last_name":"Mersch","full_name":"Mersch, Danielle"},{"full_name":"Cremer, Sylvia","first_name":"Sylvia","last_name":"Cremer","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2193-3868"},{"first_name":"Laurent","last_name":"Keller","full_name":"Keller, Laurent"}],"related_material":{"record":[{"id":"7","relation":"used_in_publication","status":"public"}]},"date_created":"2023-05-23T13:24:51Z","date_updated":"2023-10-17T11:50:04Z","oa_version":"Published Version","_id":"13055","year":"2018","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Social network plasticity decreases disease transmission in a eusocial insect","ddc":["570"],"status":"public","publisher":"Zenodo","department":[{"_id":"SyCr"}],"abstract":[{"lang":"eng","text":"Dataset for manuscript 'Social network plasticity decreases disease transmission in a eusocial insect'\r\nCompared to previous versions: - raw image files added\r\n - correction of URLs within README.txt file\r\n"}],"type":"research_data_reference"},{"main_file_link":[{"url":"www.doi.org/10.1364/OPTICA.5.001210 ","open_access":"1"}],"oa":1,"external_id":{"isi":["000447853100007"]},"isi":1,"quality_controlled":"1","doi":"10.1364/OPTICA.5.001210","language":[{"iso":"eng"}],"month":"10","publication_identifier":{"issn":["23342536"]},"year":"2018","publication_status":"published","department":[{"_id":"JoFi"}],"author":[{"full_name":"Botello, Gabriel","last_name":"Botello","first_name":"Gabriel"},{"first_name":"Florian","last_name":"Sedlmeir","full_name":"Sedlmeir, Florian"},{"full_name":"Rueda Sanchez, Alfredo R","id":"3B82B0F8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6249-5860","first_name":"Alfredo R","last_name":"Rueda Sanchez"},{"full_name":"Abdalmalak, Kerlos","first_name":"Kerlos","last_name":"Abdalmalak"},{"full_name":"Brown, Elliott","first_name":"Elliott","last_name":"Brown"},{"full_name":"Leuchs, Gerd","first_name":"Gerd","last_name":"Leuchs"},{"full_name":"Preu, Sascha","last_name":"Preu","first_name":"Sascha"},{"full_name":"Segovia Vargas, Daniel","last_name":"Segovia Vargas","first_name":"Daniel"},{"full_name":"Strekalov, Dmitry","last_name":"Strekalov","first_name":"Dmitry"},{"first_name":"Luis","last_name":"Munoz","full_name":"Munoz, Luis"},{"last_name":"Schwefel","first_name":"Harald","full_name":"Schwefel, Harald"}],"date_created":"2018-12-11T11:44:12Z","date_updated":"2023-10-17T12:12:40Z","volume":5,"publist_id":"8033","publication":"Optica","citation":{"mla":"Botello, Gabriel, et al. “Sensitivity Limits of Millimeter-Wave Photonic Radiometers Based on Efficient Electro-Optic Upconverters.” Optica, vol. 5, no. 10, 2018, pp. 1210–19, doi:10.1364/OPTICA.5.001210.","short":"G. Botello, F. Sedlmeir, A.R. Rueda Sanchez, K. Abdalmalak, E. Brown, G. Leuchs, S. Preu, D. Segovia Vargas, D. Strekalov, L. Munoz, H. Schwefel, Optica 5 (2018) 1210–1219.","chicago":"Botello, Gabriel, Florian Sedlmeir, Alfredo R Rueda Sanchez, Kerlos Abdalmalak, Elliott Brown, Gerd Leuchs, Sascha Preu, et al. “Sensitivity Limits of Millimeter-Wave Photonic Radiometers Based on Efficient Electro-Optic Upconverters.” Optica, 2018. https://doi.org/10.1364/OPTICA.5.001210.","ama":"Botello G, Sedlmeir F, Rueda Sanchez AR, et al. Sensitivity limits of millimeter-wave photonic radiometers based on efficient electro-optic upconverters. Optica. 2018;5(10):1210-1219. doi:10.1364/OPTICA.5.001210","ista":"Botello G, Sedlmeir F, Rueda Sanchez AR, Abdalmalak K, Brown E, Leuchs G, Preu S, Segovia Vargas D, Strekalov D, Munoz L, Schwefel H. 2018. Sensitivity limits of millimeter-wave photonic radiometers based on efficient electro-optic upconverters. Optica. 5(10), 1210–1219.","ieee":"G. Botello et al., “Sensitivity limits of millimeter-wave photonic radiometers based on efficient electro-optic upconverters,” Optica, vol. 5, no. 10. pp. 1210–1219, 2018.","apa":"Botello, G., Sedlmeir, F., Rueda Sanchez, A. R., Abdalmalak, K., Brown, E., Leuchs, G., … Schwefel, H. (2018). Sensitivity limits of millimeter-wave photonic radiometers based on efficient electro-optic upconverters. Optica. https://doi.org/10.1364/OPTICA.5.001210"},"article_type":"original","page":"1210 - 1219","date_published":"2018-10-20T00:00:00Z","scopus_import":"1","day":"20","article_processing_charge":"No","_id":"22","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Sensitivity limits of millimeter-wave photonic radiometers based on efficient electro-optic upconverters","status":"public","intvolume":" 5","oa_version":"Published Version","type":"journal_article","abstract":[{"lang":"eng","text":"Conventional ultra-high sensitivity detectors in the millimeter-wave range are usually cooled as their own thermal noise at room temperature would mask the weak received radiation. The need for cryogenic systems increases the cost and complexity of the instruments, hindering the development of, among others, airborne and space applications. In this work, the nonlinear parametric upconversion of millimeter-wave radiation to the optical domain inside high-quality (Q) lithium niobate whispering-gallery mode (WGM) resonators is proposed for ultra-low noise detection. We experimentally demonstrate coherent upconversion of millimeter-wave signals to a 1550 nm telecom carrier, with a photon conversion efficiency surpassing the state-of-the-art by 2 orders of magnitude. Moreover, a theoretical model shows that the thermal equilibrium of counterpropagating WGMs is broken by overcoupling the millimeter-wave WGM, effectively cooling the upconverted mode and allowing ultra-low noise detection. By theoretically estimating the sensitivity of a correlation radiometer based on the presented scheme, it is found that room-temperature radiometers with better sensitivity than state-of-the-art high-electron-mobility transistor (HEMT)-based radiometers can be designed. This detection paradigm can be used to develop room-temperature instrumentation for radio astronomy, earth observation, planetary missions, and imaging systems."}],"issue":"10"},{"year":"2018","publication_status":"published","department":[{"_id":"ToHe"}],"publisher":"Now Publishers","author":[{"full_name":"Benveniste, Albert","last_name":"Benveniste","first_name":"Albert"},{"full_name":"Nickovic, Dejan","last_name":"Nickovic","first_name":"Dejan"},{"last_name":"Caillaud","first_name":"Benoît","full_name":"Caillaud, Benoît"},{"first_name":"Roberto","last_name":"Passerone","full_name":"Passerone, Roberto"},{"full_name":"Raclet, Jean Baptiste","last_name":"Raclet","first_name":"Jean Baptiste"},{"last_name":"Reinkemeier","first_name":"Philipp","full_name":"Reinkemeier, Philipp"},{"full_name":"Sangiovanni-Vincentelli, Alberto","first_name":"Alberto","last_name":"Sangiovanni-Vincentelli"},{"full_name":"Damm, Werner","last_name":"Damm","first_name":"Werner"},{"first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"},{"first_name":"Kim G.","last_name":"Larsen","full_name":"Larsen, Kim G."}],"date_created":"2018-12-16T22:59:19Z","date_updated":"2023-10-17T11:53:09Z","volume":12,"main_file_link":[{"url":"https://hal.inria.fr/hal-00757488/","open_access":"1"}],"oa":1,"quality_controlled":"1","doi":"10.1561/1000000053","language":[{"iso":"eng"}],"month":"05","publication_identifier":{"issn":["1551-3939"]},"_id":"5677","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","title":"Contracts for system design","intvolume":" 12","oa_version":"Submitted Version","type":"journal_article","abstract":[{"lang":"eng","text":"Recently, contract-based design has been proposed as an “orthogonal” approach that complements system design methodologies proposed so far to cope with the complexity of system design. Contract-based design provides a rigorous scaffolding for verification, analysis, abstraction/refinement, and even synthesis. A number of results have been obtained in this domain but a unified treatment of the topic that can help put contract-based design in perspective was missing. This monograph intends to provide such a treatment where contracts are precisely defined and characterized so that they can be used in design methodologies with no ambiguity. In particular, this monograph identifies the essence of complex system design using contracts through a mathematical “meta-theory”, where all the properties of the methodology are derived from a very abstract and generic notion of contract. We show that the meta-theory provides deep and illuminating links with existing contract and interface theories, as well as guidelines for designing new theories. Our study encompasses contracts for both software and systems, with emphasis on the latter. We illustrate the use of contracts with two examples: requirement engineering for a parking garage management, and the development of contracts for timing and scheduling in the context of the Autosar methodology in use in the automotive sector."}],"issue":"2-3","publication":"Foundations and Trends in Electronic Design Automation","citation":{"chicago":"Benveniste, Albert, Dejan Nickovic, Benoît Caillaud, Roberto Passerone, Jean Baptiste Raclet, Philipp Reinkemeier, Alberto Sangiovanni-Vincentelli, Werner Damm, Thomas A Henzinger, and Kim G. Larsen. “Contracts for System Design.” Foundations and Trends in Electronic Design Automation. Now Publishers, 2018. https://doi.org/10.1561/1000000053.","short":"A. Benveniste, D. Nickovic, B. Caillaud, R. Passerone, J.B. Raclet, P. Reinkemeier, A. Sangiovanni-Vincentelli, W. Damm, T.A. Henzinger, K.G. Larsen, Foundations and Trends in Electronic Design Automation 12 (2018) 124–400.","mla":"Benveniste, Albert, et al. “Contracts for System Design.” Foundations and Trends in Electronic Design Automation, vol. 12, no. 2–3, Now Publishers, 2018, pp. 124–400, doi:10.1561/1000000053.","apa":"Benveniste, A., Nickovic, D., Caillaud, B., Passerone, R., Raclet, J. B., Reinkemeier, P., … Larsen, K. G. (2018). Contracts for system design. Foundations and Trends in Electronic Design Automation. Now Publishers. https://doi.org/10.1561/1000000053","ieee":"A. Benveniste et al., “Contracts for system design,” Foundations and Trends in Electronic Design Automation, vol. 12, no. 2–3. Now Publishers, pp. 124–400, 2018.","ista":"Benveniste A, Nickovic D, Caillaud B, Passerone R, Raclet JB, Reinkemeier P, Sangiovanni-Vincentelli A, Damm W, Henzinger TA, Larsen KG. 2018. Contracts for system design. Foundations and Trends in Electronic Design Automation. 12(2–3), 124–400.","ama":"Benveniste A, Nickovic D, Caillaud B, et al. Contracts for system design. Foundations and Trends in Electronic Design Automation. 2018;12(2-3):124-400. doi:10.1561/1000000053"},"article_type":"original","page":"124-400","date_published":"2018-05-01T00:00:00Z","scopus_import":"1","day":"01","article_processing_charge":"No"},{"year":"2018","acknowledgement":"Seventh Framework Programme (FP7) People: Marie-Curie Actions (PEOPLE) (291734). B. M. acknowledges the financial support by the People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme (FP7/ 2007-2013) under REA.","publication_status":"published","publisher":"Optica Publishing Group","department":[{"_id":"MiLe"}],"author":[{"full_name":"Midya, Bikashkali","id":"456187FC-F248-11E8-B48F-1D18A9856A87","first_name":"Bikashkali","last_name":"Midya"},{"full_name":"Konotop, Vladimir","first_name":"Vladimir","last_name":"Konotop"}],"date_updated":"2023-10-17T12:15:06Z","date_created":"2018-12-11T11:46:27Z","volume":43,"publist_id":"7388","ec_funded":1,"external_id":{"isi":["000423776600066"],"arxiv":["1711.01986"]},"main_file_link":[{"url":"https://arxiv.org/abs/1711.01986","open_access":"1"}],"oa":1,"isi":1,"quality_controlled":"1","project":[{"grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme"}],"doi":"10.1364/OL.43.000607","language":[{"iso":"eng"}],"month":"02","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"435","status":"public","title":"Coherent-perfect-absorber and laser for bound states in a continuum","intvolume":" 43","oa_version":"Preprint","type":"journal_article","abstract":[{"text":"It is shown that two fundamentally different phenomena, the bound states in continuum and the spectral singularity (or time-reversed spectral singularity), can occur simultaneously. This can be achieved in a rectangular core dielectric waveguide with an embedded active (or absorbing) layer. In such a system a two-dimensional bound state in a continuum is created in the plane of a waveguide cross section, and it is emitted or absorbed along the waveguide core. The idea can be used for experimental implementation of a laser or a coherent-perfect-absorber for a photonic bound state that resides in a continuous spectrum.","lang":"eng"}],"issue":"3","publication":"Optics Letters","citation":{"ista":"Midya B, Konotop V. 2018. Coherent-perfect-absorber and laser for bound states in a continuum. Optics Letters. 43(3), 607–610.","apa":"Midya, B., & Konotop, V. (2018). Coherent-perfect-absorber and laser for bound states in a continuum. Optics Letters. Optica Publishing Group. https://doi.org/10.1364/OL.43.000607","ieee":"B. Midya and V. Konotop, “Coherent-perfect-absorber and laser for bound states in a continuum,” Optics Letters, vol. 43, no. 3. Optica Publishing Group, pp. 607–610, 2018.","ama":"Midya B, Konotop V. Coherent-perfect-absorber and laser for bound states in a continuum. Optics Letters. 2018;43(3):607-610. doi:10.1364/OL.43.000607","chicago":"Midya, Bikashkali, and Vladimir Konotop. “Coherent-Perfect-Absorber and Laser for Bound States in a Continuum.” Optics Letters. Optica Publishing Group, 2018. https://doi.org/10.1364/OL.43.000607.","mla":"Midya, Bikashkali, and Vladimir Konotop. “Coherent-Perfect-Absorber and Laser for Bound States in a Continuum.” Optics Letters, vol. 43, no. 3, Optica Publishing Group, 2018, pp. 607–10, doi:10.1364/OL.43.000607.","short":"B. Midya, V. Konotop, Optics Letters 43 (2018) 607–610."},"page":"607 - 610","date_published":"2018-02-01T00:00:00Z","scopus_import":"1","day":"01","article_processing_charge":"No"},{"issue":"7","abstract":[{"text":"Genome-scale diversity data are increasingly available in a variety of biological systems, and can be used to reconstruct the past evolutionary history of species divergence. However, extracting the full demographic information from these data is not trivial, and requires inferential methods that account for the diversity of coalescent histories throughout the genome. Here, we evaluate the potential and limitations of one such approach. We reexamine a well-known system of mussel sister species, using the joint site frequency spectrum (jSFS) of synonymousmutations computed either fromexome capture or RNA-seq, in an Approximate Bayesian Computation (ABC) framework. We first assess the best sampling strategy (number of: individuals, loci, and bins in the jSFS), and show that model selection is robust to variation in the number of individuals and loci. In contrast, different binning choices when summarizing the jSFS, strongly affect the results: including classes of low and high frequency shared polymorphisms can more effectively reveal recent migration events. We then take advantage of the flexibility of ABC to compare more realistic models of speciation, including variation in migration rates through time (i.e., periodic connectivity) and across genes (i.e., genome-wide heterogeneity in migration rates). We show that these models were consistently selected as the most probable, suggesting that mussels have experienced a complex history of gene flow during divergence and that the species boundary is semi-permeable. Our work provides a comprehensive evaluation of ABC demographic inference in mussels based on the coding jSFS, and supplies guidelines for employing different sequencing techniques and sampling strategies. We emphasize, perhaps surprisingly, that inferences are less limited by the volume of data, than by the way in which they are analyzed.","lang":"eng"}],"type":"journal_article","oa_version":"Published Version","file":[{"date_updated":"2020-07-14T12:44:48Z","date_created":"2018-12-18T09:42:11Z","checksum":"7d55ae22598a1c70759cd671600cff53","relation":"main_file","file_id":"5739","content_type":"application/pdf","file_size":1480792,"creator":"dernst","file_name":"2018_PeerJ_Fraisse.pdf","access_level":"open_access"}],"_id":"139","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 2018","title":"The divergence history of European blue mussel species reconstructed from Approximate Bayesian Computation: The effects of sequencing techniques and sampling strategies","ddc":["576"],"status":"public","has_accepted_license":"1","article_processing_charge":"No","day":"30","scopus_import":"1","date_published":"2018-07-30T00:00:00Z","citation":{"chicago":"Fraisse, Christelle, Camille Roux, Pierre Gagnaire, Jonathan Romiguier, Nicolas Faivre, John Welch, and Nicolas Bierne. “The Divergence History of European Blue Mussel Species Reconstructed from Approximate Bayesian Computation: The Effects of Sequencing Techniques and Sampling Strategies.” PeerJ. PeerJ, 2018. https://doi.org/10.7717/peerj.5198.","mla":"Fraisse, Christelle, et al. “The Divergence History of European Blue Mussel Species Reconstructed from Approximate Bayesian Computation: The Effects of Sequencing Techniques and Sampling Strategies.” PeerJ, vol. 2018, no. 7, 30083438, PeerJ, 2018, doi:10.7717/peerj.5198.","short":"C. Fraisse, C. Roux, P. Gagnaire, J. Romiguier, N. Faivre, J. Welch, N. Bierne, PeerJ 2018 (2018).","ista":"Fraisse C, Roux C, Gagnaire P, Romiguier J, Faivre N, Welch J, Bierne N. 2018. The divergence history of European blue mussel species reconstructed from Approximate Bayesian Computation: The effects of sequencing techniques and sampling strategies. PeerJ. 2018(7), 30083438.","apa":"Fraisse, C., Roux, C., Gagnaire, P., Romiguier, J., Faivre, N., Welch, J., & Bierne, N. (2018). The divergence history of European blue mussel species reconstructed from Approximate Bayesian Computation: The effects of sequencing techniques and sampling strategies. PeerJ. PeerJ. https://doi.org/10.7717/peerj.5198","ieee":"C. Fraisse et al., “The divergence history of European blue mussel species reconstructed from Approximate Bayesian Computation: The effects of sequencing techniques and sampling strategies,” PeerJ, vol. 2018, no. 7. PeerJ, 2018.","ama":"Fraisse C, Roux C, Gagnaire P, et al. The divergence history of European blue mussel species reconstructed from Approximate Bayesian Computation: The effects of sequencing techniques and sampling strategies. PeerJ. 2018;2018(7). doi:10.7717/peerj.5198"},"publication":"PeerJ","publist_id":"7784","file_date_updated":"2020-07-14T12:44:48Z","article_number":"30083438","author":[{"first_name":"Christelle","last_name":"Fraisse","id":"32DF5794-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8441-5075","full_name":"Fraisse, Christelle"},{"last_name":"Roux","first_name":"Camille","full_name":"Roux, Camille"},{"last_name":"Gagnaire","first_name":"Pierre","full_name":"Gagnaire, Pierre"},{"full_name":"Romiguier, Jonathan","first_name":"Jonathan","last_name":"Romiguier"},{"first_name":"Nicolas","last_name":"Faivre","full_name":"Faivre, Nicolas"},{"last_name":"Welch","first_name":"John","full_name":"Welch, John"},{"full_name":"Bierne, Nicolas","first_name":"Nicolas","last_name":"Bierne"}],"volume":2018,"date_updated":"2023-10-17T12:25:28Z","date_created":"2018-12-11T11:44:50Z","year":"2018","department":[{"_id":"BeVi"},{"_id":"NiBa"}],"publisher":"PeerJ","publication_status":"published","month":"07","doi":"10.7717/peerj.5198","language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"isi":["000440484800002"]},"oa":1,"isi":1,"quality_controlled":"1"},{"ddc":["576"],"title":"Can secondary contact following range expansion be distinguished from barriers to gene flow?","status":"public","intvolume":" 2018","_id":"33","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","file":[{"date_created":"2018-12-17T10:46:06Z","date_updated":"2020-07-14T12:46:06Z","checksum":"3334886c4b39678db4c4b74299ca14ba","relation":"main_file","file_id":"5692","file_size":1328344,"content_type":"application/pdf","creator":"dernst","file_name":"2018_PeerJ_Bertl.pdf","access_level":"open_access"}],"type":"journal_article","abstract":[{"lang":"eng","text":"Secondary contact is the reestablishment of gene flow between sister populations that have diverged. For instance, at the end of the Quaternary glaciations in Europe, secondary contact occurred during the northward expansion of the populations which had found refugia in the southern peninsulas. With the advent of multi-locus markers, secondary contact can be investigated using various molecular signatures including gradients of allele frequency, admixture clines, and local increase of genetic differentiation. We use coalescent simulations to investigate if molecular data provide enough information to distinguish between secondary contact following range expansion and an alternative evolutionary scenario consisting of a barrier to gene flow in an isolation-by-distance model. We find that an excess of linkage disequilibrium and of genetic diversity at the suture zone is a unique signature of secondary contact. We also find that the directionality index ψ, which was proposed to study range expansion, is informative to distinguish between the two hypotheses. However, although evidence for secondary contact is usually conveyed by statistics related to admixture coefficients, we find that they can be confounded by isolation-by-distance. We recommend to account for the spatial repartition of individuals when investigating secondary contact in order to better reflect the complex spatio-temporal evolution of populations and species."}],"issue":"10","publication":"PeerJ","citation":{"chicago":"Bertl, Johanna, Harald Ringbauer, and Michaël Blum. “Can Secondary Contact Following Range Expansion Be Distinguished from Barriers to Gene Flow?” PeerJ. PeerJ, 2018. https://doi.org/10.7717/peerj.5325.","mla":"Bertl, Johanna, et al. “Can Secondary Contact Following Range Expansion Be Distinguished from Barriers to Gene Flow?” PeerJ, vol. 2018, no. 10, e5325, PeerJ, 2018, doi:10.7717/peerj.5325.","short":"J. Bertl, H. Ringbauer, M. Blum, PeerJ 2018 (2018).","ista":"Bertl J, Ringbauer H, Blum M. 2018. Can secondary contact following range expansion be distinguished from barriers to gene flow? PeerJ. 2018(10), e5325.","apa":"Bertl, J., Ringbauer, H., & Blum, M. (2018). Can secondary contact following range expansion be distinguished from barriers to gene flow? PeerJ. PeerJ. https://doi.org/10.7717/peerj.5325","ieee":"J. Bertl, H. Ringbauer, and M. Blum, “Can secondary contact following range expansion be distinguished from barriers to gene flow?,” PeerJ, vol. 2018, no. 10. PeerJ, 2018.","ama":"Bertl J, Ringbauer H, Blum M. Can secondary contact following range expansion be distinguished from barriers to gene flow? PeerJ. 2018;2018(10). doi:10.7717/peerj.5325"},"date_published":"2018-10-01T00:00:00Z","scopus_import":"1","day":"01","article_processing_charge":"No","has_accepted_license":"1","publication_status":"published","publisher":"PeerJ","department":[{"_id":"NiBa"}],"year":"2018","acknowledgement":"Johanna Bertl was supported by the Vienna Graduate School of Population Genetics (Austrian Science Fund (FWF): W1225-B20) and worked on this project while employed at the Department of Statistics and Operations Research, University of Vienna, Austria. This article was developed in the framework of the Grenoble Alpes Data Institute, which is supported by the French National Research Agency under the “Investissments d’avenir” program (ANR-15-IDEX-02).","pmid":1,"date_created":"2018-12-11T11:44:16Z","date_updated":"2023-10-17T12:24:43Z","volume":2018,"author":[{"first_name":"Johanna","last_name":"Bertl","full_name":"Bertl, Johanna"},{"id":"417FCFF4-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4884-9682","first_name":"Harald","last_name":"Ringbauer","full_name":"Ringbauer, Harald"},{"first_name":"Michaël","last_name":"Blum","full_name":"Blum, Michaël"}],"article_number":"e5325","file_date_updated":"2020-07-14T12:46:06Z","publist_id":"8022","quality_controlled":"1","isi":1,"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"pmid":["30294507"],"isi":["000447204400001"]},"language":[{"iso":"eng"}],"doi":"10.7717/peerj.5325","month":"10"},{"ec_funded":1,"volume":4,"date_updated":"2023-10-17T12:19:28Z","date_created":"2018-12-16T22:59:18Z","author":[{"full_name":"Glanc, Matous","last_name":"Glanc","first_name":"Matous","orcid":"0000-0003-0619-7783","id":"1AE1EA24-02D0-11E9-9BAA-DAF4881429F2"},{"orcid":"0000-0002-9767-8699","id":"43905548-F248-11E8-B48F-1D18A9856A87","last_name":"Fendrych","first_name":"Matyas","full_name":"Fendrych, Matyas"},{"first_name":"Jirí","last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8302-7596","full_name":"Friml, Jirí"}],"publisher":"Nature Research","department":[{"_id":"JiFr"}],"publication_status":"published","pmid":1,"year":"2018","publication_identifier":{"issn":["2055-0278"]},"month":"12","language":[{"iso":"eng"}],"doi":"10.1038/s41477-018-0318-3","project":[{"call_identifier":"H2020","name":"Tracing Evolution of Auxin Transport and Polarity in Plants","_id":"261099A6-B435-11E9-9278-68D0E5697425","grant_number":"742985"}],"isi":1,"quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pubmed/30518833"}],"external_id":{"pmid":["30518833"],"isi":["000454576600017"]},"oa":1,"issue":"12","abstract":[{"text":"Cell polarity, manifested by the localization of proteins to distinct polar plasma membrane domains, is a key prerequisite of multicellular life. In plants, PIN auxin transporters are prominent polarity markers crucial for a plethora of developmental processes. Cell polarity mechanisms in plants are distinct from other eukaryotes and still largely elusive. In particular, how the cell polarities are propagated and maintained following cell division remains unknown. Plant cytokinesis is orchestrated by the cell plate—a transient centrifugally growing endomembrane compartment ultimately forming the cross wall1. Trafficking of polar membrane proteins is typically redirected to the cell plate, and these will consequently have opposite polarity in at least one of the daughter cells2–5. Here, we provide mechanistic insights into post-cytokinetic re-establishment of cell polarity as manifested by the apical, polar localization of PIN2. We show that the apical domain is defined in a cell-intrinsic manner and that re-establishment of PIN2 localization to this domain requires de novo protein secretion and endocytosis, but not basal-to-apical transcytosis. Furthermore, we identify a PINOID-related kinase WAG1, which phosphorylates PIN2 in vitro6 and is transcriptionally upregulated specifically in dividing cells, as a crucial regulator of post-cytokinetic PIN2 polarity re-establishment.","lang":"eng"}],"type":"journal_article","oa_version":"Submitted Version","intvolume":" 4","status":"public","title":"Mechanistic framework for cell-intrinsic re-establishment of PIN2 polarity after cell division","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"5673","article_processing_charge":"No","day":"03","scopus_import":"1","date_published":"2018-12-03T00:00:00Z","page":"1082-1088","citation":{"short":"M. Glanc, M. Fendrych, J. Friml, Nature Plants 4 (2018) 1082–1088.","mla":"Glanc, Matous, et al. “Mechanistic Framework for Cell-Intrinsic Re-Establishment of PIN2 Polarity after Cell Division.” Nature Plants, vol. 4, no. 12, Nature Research, 2018, pp. 1082–88, doi:10.1038/s41477-018-0318-3.","chicago":"Glanc, Matous, Matyas Fendrych, and Jiří Friml. “Mechanistic Framework for Cell-Intrinsic Re-Establishment of PIN2 Polarity after Cell Division.” Nature Plants. Nature Research, 2018. https://doi.org/10.1038/s41477-018-0318-3.","ama":"Glanc M, Fendrych M, Friml J. Mechanistic framework for cell-intrinsic re-establishment of PIN2 polarity after cell division. Nature Plants. 2018;4(12):1082-1088. doi:10.1038/s41477-018-0318-3","ieee":"M. Glanc, M. Fendrych, and J. Friml, “Mechanistic framework for cell-intrinsic re-establishment of PIN2 polarity after cell division,” Nature Plants, vol. 4, no. 12. Nature Research, pp. 1082–1088, 2018.","apa":"Glanc, M., Fendrych, M., & Friml, J. (2018). Mechanistic framework for cell-intrinsic re-establishment of PIN2 polarity after cell division. Nature Plants. Nature Research. https://doi.org/10.1038/s41477-018-0318-3","ista":"Glanc M, Fendrych M, Friml J. 2018. Mechanistic framework for cell-intrinsic re-establishment of PIN2 polarity after cell division. Nature Plants. 4(12), 1082–1088."},"publication":"Nature Plants"},{"doi":"10.1098/rsif.2018.0073","language":[{"iso":"eng"}],"oa":1,"external_id":{"isi":["000428576200023"],"pmid":["29593089"]},"quality_controlled":"1","isi":1,"project":[{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"}],"month":"03","publication_identifier":{"eissn":["1742-5662"]},"author":[{"full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389","id":"3B699956-F248-11E8-B48F-1D18A9856A87","last_name":"Ibsen-Jensen","first_name":"Rasmus"},{"full_name":"Tkadlec, Josef","first_name":"Josef","last_name":"Tkadlec","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1097-9684"},{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"full_name":"Nowak, Martin","first_name":"Martin","last_name":"Nowak"}],"related_material":{"record":[{"id":"9814","status":"public","relation":"research_data"}],"link":[{"relation":"supplementary_material","url":"https://dx.doi.org/10.6084/m9.figshare.c.4028971"}]},"date_updated":"2023-10-18T06:36:00Z","date_created":"2018-12-11T11:45:09Z","volume":15,"year":"2018","pmid":1,"publication_status":"published","publisher":"The Royal Society","department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:45:22Z","ec_funded":1,"publist_id":"7715","article_number":"20180073","date_published":"2018-03-01T00:00:00Z","publication":"Journal of the Royal Society Interface","citation":{"ieee":"R. Ibsen-Jensen, J. Tkadlec, K. Chatterjee, and M. Nowak, “Language acquisition with communication between learners,” Journal of the Royal Society Interface, vol. 15, no. 140. The Royal Society, 2018.","apa":"Ibsen-Jensen, R., Tkadlec, J., Chatterjee, K., & Nowak, M. (2018). Language acquisition with communication between learners. Journal of the Royal Society Interface. The Royal Society. https://doi.org/10.1098/rsif.2018.0073","ista":"Ibsen-Jensen R, Tkadlec J, Chatterjee K, Nowak M. 2018. Language acquisition with communication between learners. Journal of the Royal Society Interface. 15(140), 20180073.","ama":"Ibsen-Jensen R, Tkadlec J, Chatterjee K, Nowak M. Language acquisition with communication between learners. Journal of the Royal Society Interface. 2018;15(140). doi:10.1098/rsif.2018.0073","chicago":"Ibsen-Jensen, Rasmus, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. “Language Acquisition with Communication between Learners.” Journal of the Royal Society Interface. The Royal Society, 2018. https://doi.org/10.1098/rsif.2018.0073.","short":"R. Ibsen-Jensen, J. Tkadlec, K. Chatterjee, M. Nowak, Journal of the Royal Society Interface 15 (2018).","mla":"Ibsen-Jensen, Rasmus, et al. “Language Acquisition with Communication between Learners.” Journal of the Royal Society Interface, vol. 15, no. 140, 20180073, The Royal Society, 2018, doi:10.1098/rsif.2018.0073."},"article_type":"original","day":"01","article_processing_charge":"No","has_accepted_license":"1","scopus_import":"1","oa_version":"Submitted Version","file":[{"checksum":"444e1a9d98eb0e780671be82b13025f3","date_created":"2019-02-12T07:54:37Z","date_updated":"2020-07-14T12:45:22Z","file_id":"5955","relation":"main_file","creator":"dernst","content_type":"application/pdf","file_size":219837,"access_level":"open_access","file_name":"2018_RS_IbsenJensen.pdf"}],"_id":"198","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Language acquisition with communication between learners","ddc":["000"],"status":"public","intvolume":" 15","abstract":[{"lang":"eng","text":"We consider a class of students learning a language from a teacher. The situation can be interpreted as a group of child learners receiving input from the linguistic environment. The teacher provides sample sentences. The students try to learn the grammar from the teacher. In addition to just listening to the teacher, the students can also communicate with each other. The students hold hypotheses about the grammar and change them if they receive counter evidence. The process stops when all students have converged to the correct grammar. We study how the time to convergence depends on the structure of the classroom by introducing and evaluating various complexity measures. We find that structured communication between students, although potentially introducing confusion, can greatly reduce some of the complexity measures. Our theory can also be interpreted as applying to the scientific process, where nature is the teacher and the scientists are the students."}],"issue":"140","type":"journal_article"},{"publication_identifier":{"issn":["2054-5703"]},"month":"12","doi":"10.1098/rsos.181286","language":[{"iso":"eng"}],"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"isi":["000456566500027"],"pmid":["30662738"]},"quality_controlled":"1","isi":1,"file_date_updated":"2020-07-14T12:47:13Z","article_number":"181286","author":[{"full_name":"Corominas-Murtra, Bernat","orcid":"0000-0001-9806-5643","id":"43BE2298-F248-11E8-B48F-1D18A9856A87","last_name":"Corominas-Murtra","first_name":"Bernat"},{"first_name":"Martí Sànchez","last_name":"Fibla","full_name":"Fibla, Martí Sànchez"},{"last_name":"Valverde","first_name":"Sergi","full_name":"Valverde, Sergi"},{"full_name":"Solé, Ricard","last_name":"Solé","first_name":"Ricard"}],"volume":5,"date_updated":"2023-10-18T06:41:12Z","date_created":"2019-01-20T22:59:18Z","pmid":1,"year":"2018","acknowledgement":"This work was supported by the James McDonnell Foundation (B.C-M., S.V. and R.S.)","department":[{"_id":"EdHa"}],"publisher":"The Royal Society","publication_status":"published","article_processing_charge":"No","has_accepted_license":"1","day":"12","scopus_import":"1","date_published":"2018-12-12T00:00:00Z","citation":{"ama":"Corominas-Murtra B, Fibla MS, Valverde S, Solé R. Chromatic transitions in the emergence of syntax networks. Royal Society Open Science. 2018;5(12). doi:10.1098/rsos.181286","apa":"Corominas-Murtra, B., Fibla, M. S., Valverde, S., & Solé, R. (2018). Chromatic transitions in the emergence of syntax networks. Royal Society Open Science. The Royal Society. https://doi.org/10.1098/rsos.181286","ieee":"B. Corominas-Murtra, M. S. Fibla, S. Valverde, and R. Solé, “Chromatic transitions in the emergence of syntax networks,” Royal Society Open Science, vol. 5, no. 12. The Royal Society, 2018.","ista":"Corominas-Murtra B, Fibla MS, Valverde S, Solé R. 2018. Chromatic transitions in the emergence of syntax networks. Royal Society Open Science. 5(12), 181286.","short":"B. Corominas-Murtra, M.S. Fibla, S. Valverde, R. Solé, Royal Society Open Science 5 (2018).","mla":"Corominas-Murtra, Bernat, et al. “Chromatic Transitions in the Emergence of Syntax Networks.” Royal Society Open Science, vol. 5, no. 12, 181286, The Royal Society, 2018, doi:10.1098/rsos.181286.","chicago":"Corominas-Murtra, Bernat, Martí Sànchez Fibla, Sergi Valverde, and Ricard Solé. “Chromatic Transitions in the Emergence of Syntax Networks.” Royal Society Open Science. The Royal Society, 2018. https://doi.org/10.1098/rsos.181286."},"publication":"Royal Society Open Science","article_type":"original","issue":"12","abstract":[{"lang":"eng","text":"The emergence of syntax during childhood is a remarkable example of how complex correlations unfold in nonlinear ways through development. In particular, rapid transitions seem to occur as children reach the age of two, which seems to separate a two-word, tree-like network of syntactic relations among words from the scale-free graphs associated with the adult, complex grammar. Here, we explore the evolution of syntax networks through language acquisition using the chromatic number, which captures the transition and provides a natural link to standard theories on syntactic structures. The data analysis is compared to a null model of network growth dynamics which is shown to display non-trivial and sensible differences. At a more general level, we observe that the chromatic classes define independent regions of the graph, and thus, can be interpreted as the footprints of incompatibility relations, somewhat as opposed to modularity considerations."}],"type":"journal_article","file":[{"file_name":"2018_RoyalSocOS_Corominas.pdf","access_level":"open_access","file_size":646732,"content_type":"application/pdf","creator":"dernst","relation":"main_file","file_id":"5924","date_updated":"2020-07-14T12:47:13Z","date_created":"2019-02-05T14:38:09Z","checksum":"9664d4417f6b792242e31eea77ce9501"}],"oa_version":"Published Version","_id":"5859","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 5","ddc":["570"],"status":"public","title":"Chromatic transitions in the emergence of syntax networks"},{"year":"2018","_id":"6183","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"LaEr"}],"publication_status":"submitted","status":"public","title":"The Dyson equation with linear self-energy: Spectral bands, edges and cusps","related_material":{"record":[{"id":"149","status":"public","relation":"dissertation_contains"},{"status":"public","relation":"later_version","id":"14694"}]},"author":[{"id":"36D3D8B6-F248-11E8-B48F-1D18A9856A87","last_name":"Alt","first_name":"Johannes","full_name":"Alt, Johannes"},{"last_name":"Erdös","first_name":"László","orcid":"0000-0001-5366-9603","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","full_name":"Erdös, László"},{"full_name":"Krüger, Torben H","id":"3020C786-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4821-3297","first_name":"Torben H","last_name":"Krüger"}],"oa_version":"Preprint","date_created":"2019-03-28T09:20:06Z","date_updated":"2023-12-18T10:46:08Z","type":"preprint","article_number":"1804.07752","abstract":[{"lang":"eng","text":"We study the unique solution $m$ of the Dyson equation \\[ -m(z)^{-1} = z - a\r\n+ S[m(z)] \\] on a von Neumann algebra $\\mathcal{A}$ with the constraint\r\n$\\mathrm{Im}\\,m\\geq 0$. Here, $z$ lies in the complex upper half-plane, $a$ is\r\na self-adjoint element of $\\mathcal{A}$ and $S$ is a positivity-preserving\r\nlinear operator on $\\mathcal{A}$. We show that $m$ is the Stieltjes transform\r\nof a compactly supported $\\mathcal{A}$-valued measure on $\\mathbb{R}$. Under\r\nsuitable assumptions, we establish that this measure has a uniformly\r\n$1/3$-H\\\"{o}lder continuous density with respect to the Lebesgue measure, which\r\nis supported on finitely many intervals, called bands. In fact, the density is\r\nanalytic inside the bands with a square-root growth at the edges and internal\r\ncubic root cusps whenever the gap between two bands vanishes. The shape of\r\nthese singularities is universal and no other singularity may occur. We give a\r\nprecise asymptotic description of $m$ near the singular points. These\r\nasymptotics generalize the analysis at the regular edges given in the companion\r\npaper on the Tracy-Widom universality for the edge eigenvalue statistics for\r\ncorrelated random matrices [arXiv:1804.07744] and they play a key role in the\r\nproof of the Pearcey universality at the cusp for Wigner-type matrices\r\n[arXiv:1809.03971,arXiv:1811.04055]. We also extend the finite dimensional band\r\nmass formula from [arXiv:1804.07744] to the von Neumann algebra setting by\r\nshowing that the spectral mass of the bands is topologically rigid under\r\ndeformations and we conclude that these masses are quantized in some important\r\ncases."}],"main_file_link":[{"url":"https://arxiv.org/abs/1804.07752","open_access":"1"}],"oa":1,"external_id":{"arxiv":["1804.07752"]},"citation":{"ama":"Alt J, Erdös L, Krüger TH. The Dyson equation with linear self-energy: Spectral bands, edges and cusps. arXiv.","apa":"Alt, J., Erdös, L., & Krüger, T. H. (n.d.). The Dyson equation with linear self-energy: Spectral bands, edges and cusps. arXiv.","ieee":"J. Alt, L. Erdös, and T. H. Krüger, “The Dyson equation with linear self-energy: Spectral bands, edges and cusps,” arXiv. .","ista":"Alt J, Erdös L, Krüger TH. The Dyson equation with linear self-energy: Spectral bands, edges and cusps. arXiv, 1804.07752.","short":"J. Alt, L. Erdös, T.H. Krüger, ArXiv (n.d.).","mla":"Alt, Johannes, et al. “The Dyson Equation with Linear Self-Energy: Spectral Bands, Edges and Cusps.” ArXiv, 1804.07752.","chicago":"Alt, Johannes, László Erdös, and Torben H Krüger. “The Dyson Equation with Linear Self-Energy: Spectral Bands, Edges and Cusps.” ArXiv, n.d."},"publication":"arXiv","date_published":"2018-04-20T00:00:00Z","language":[{"iso":"eng"}],"article_processing_charge":"No","month":"04","day":"20"},{"title":"Convex fair partitions into arbitrary number of pieces","status":"public","publication_status":"published","department":[{"_id":"HeEd"},{"_id":"JaMa"}],"publisher":"arXiv","year":"2018","_id":"75","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:44:30Z","date_updated":"2023-12-18T10:51:02Z","oa_version":"Preprint","author":[{"full_name":"Akopyan, Arseniy","last_name":"Akopyan","first_name":"Arseniy","orcid":"0000-0002-2548-617X","id":"430D2C90-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Avvakumov, Sergey","first_name":"Sergey","last_name":"Avvakumov","id":"3827DAC8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Karasev, Roman","last_name":"Karasev","first_name":"Roman"}],"related_material":{"record":[{"id":"8156","status":"public","relation":"dissertation_contains"}]},"article_number":"1804.03057","type":"preprint","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"}],"ec_funded":1,"project":[{"grant_number":"716117","_id":"256E75B8-B435-11E9-9278-68D0E5697425","name":"Optimal Transport and Stochastic Dynamics","call_identifier":"H2020"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1804.03057"}],"oa":1,"citation":{"ama":"Akopyan A, Avvakumov S, Karasev R. Convex fair partitions into arbitrary number of pieces. 2018. doi:10.48550/arXiv.1804.03057","ieee":"A. Akopyan, S. Avvakumov, and R. Karasev, “Convex fair partitions into arbitrary number of pieces.” arXiv, 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","ista":"Akopyan A, Avvakumov S, Karasev R. 2018. Convex fair partitions into arbitrary number of pieces. 1804.03057.","short":"A. Akopyan, S. Avvakumov, R. Karasev, (2018).","mla":"Akopyan, Arseniy, et al. Convex Fair Partitions into Arbitrary Number of Pieces. 1804.03057, arXiv, 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."},"external_id":{"arxiv":["1804.03057"]},"language":[{"iso":"eng"}],"date_published":"2018-09-13T00:00:00Z","doi":"10.48550/arXiv.1804.03057","month":"09","day":"13","article_processing_charge":"No"},{"date_published":"2018-11-13T00:00:00Z","citation":{"chicago":"Betea, Dan, Jeremie Bouttier, Peter Nejjar, and Mirjana Vuletic. “The Free Boundary Schur Process and Applications I.” Annales Henri Poincare. Springer Nature, 2018. https://doi.org/10.1007/s00023-018-0723-1.","short":"D. Betea, J. Bouttier, P. Nejjar, M. Vuletic, Annales Henri Poincare 19 (2018) 3663–3742.","mla":"Betea, Dan, et al. “The Free Boundary Schur Process and Applications I.” Annales Henri Poincare, vol. 19, no. 12, Springer Nature, 2018, pp. 3663–742, doi:10.1007/s00023-018-0723-1.","ieee":"D. Betea, J. Bouttier, P. Nejjar, and M. Vuletic, “The free boundary Schur process and applications I,” Annales Henri Poincare, vol. 19, no. 12. Springer Nature, pp. 3663–3742, 2018.","apa":"Betea, D., Bouttier, J., Nejjar, P., & Vuletic, M. (2018). The free boundary Schur process and applications I. Annales Henri Poincare. Springer Nature. https://doi.org/10.1007/s00023-018-0723-1","ista":"Betea D, Bouttier J, Nejjar P, Vuletic M. 2018. The free boundary Schur process and applications I. Annales Henri Poincare. 19(12), 3663–3742.","ama":"Betea D, Bouttier J, Nejjar P, Vuletic M. The free boundary Schur process and applications I. Annales Henri Poincare. 2018;19(12):3663-3742. doi:10.1007/s00023-018-0723-1"},"publication":"Annales Henri Poincare","page":"3663-3742","article_type":"original","has_accepted_license":"1","article_processing_charge":"Yes (via OA deal)","day":"13","scopus_import":"1","file":[{"access_level":"open_access","file_name":"2018_Annales_Betea.pdf","creator":"dernst","content_type":"application/pdf","file_size":3084674,"file_id":"5866","relation":"main_file","checksum":"0c38abe73569b7166b7487ad5d23cc68","date_updated":"2020-07-14T12:47:03Z","date_created":"2019-01-21T15:18:55Z"}],"oa_version":"Published Version","_id":"556","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 19","status":"public","ddc":["500"],"title":"The free boundary Schur process and applications I","issue":"12","abstract":[{"lang":"eng","text":"We investigate the free boundary Schur process, a variant of the Schur process introduced by Okounkov and Reshetikhin, where we allow the first and the last partitions to be arbitrary (instead of empty in the original setting). The pfaffian Schur process, previously studied by several authors, is recovered when just one of the boundary partitions is left free. We compute the correlation functions of the process in all generality via the free fermion formalism, which we extend with the thorough treatment of “free boundary states.” For the case of one free boundary, our approach yields a new proof that the process is pfaffian. For the case of two free boundaries, we find that the process is not pfaffian, but a closely related process is. We also study three different applications of the Schur process with one free boundary: fluctuations of symmetrized last passage percolation models, limit shapes and processes for symmetric plane partitions and for plane overpartitions."}],"type":"journal_article","doi":"10.1007/s00023-018-0723-1","language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"external_id":{"arxiv":["1704.05809"]},"project":[{"call_identifier":"FP7","name":"Random matrices, universality and disordered quantum systems","grant_number":"338804","_id":"258DCDE6-B435-11E9-9278-68D0E5697425"},{"_id":"256E75B8-B435-11E9-9278-68D0E5697425","grant_number":"716117","name":"Optimal Transport and Stochastic Dynamics","call_identifier":"H2020"}],"quality_controlled":"1","publication_identifier":{"issn":["1424-0637"]},"month":"11","author":[{"first_name":"Dan","last_name":"Betea","full_name":"Betea, Dan"},{"last_name":"Bouttier","first_name":"Jeremie","full_name":"Bouttier, Jeremie"},{"last_name":"Nejjar","first_name":"Peter","id":"4BF426E2-F248-11E8-B48F-1D18A9856A87","full_name":"Nejjar, Peter"},{"full_name":"Vuletic, Mirjana","last_name":"Vuletic","first_name":"Mirjana"}],"volume":19,"date_updated":"2024-02-20T10:48:17Z","date_created":"2018-12-11T11:47:09Z","year":"2018","publisher":"Springer Nature","department":[{"_id":"LaEr"},{"_id":"JaMa"}],"publication_status":"published","publist_id":"7258","ec_funded":1,"file_date_updated":"2020-07-14T12:47:03Z"},{"oa_version":"Published Version","file":[{"creator":"system","file_size":1737958,"content_type":"application/zip","file_name":"IST-2018-82-v1+1_GraphFlowMatchingProblems.zip","access_level":"open_access","date_updated":"2020-07-14T12:47:05Z","date_created":"2018-12-12T13:02:34Z","checksum":"53c17082848e12f3c2e1b4185b578208","file_id":"5600","relation":"main_file"}],"date_updated":"2024-02-21T13:41:17Z","date_created":"2018-12-12T12:31:36Z","contributor":[{"id":"446560C6-F248-11E8-B48F-1D18A9856A87","contributor_type":"researcher","last_name":"Swoboda","first_name":"Paul"}],"related_material":{"link":[{"relation":"research_paper","url":"https://doi.org/10.1007/978-3-319-24947-6_23"}]},"author":[{"first_name":"Hassan","last_name":"Alhaija","full_name":"Alhaija, Hassan"},{"full_name":"Sellent, Anita","first_name":"Anita","last_name":"Sellent"},{"first_name":"Daniel","last_name":"Kondermann","full_name":"Kondermann, Daniel"},{"full_name":"Rother, Carsten","first_name":"Carsten","last_name":"Rother"}],"publisher":"Institute of Science and Technology Austria","department":[{"_id":"VlKo"}],"status":"public","ddc":["001"],"title":"Graph matching problems for GraphFlow – 6D Large Displacement Scene Flow","year":"2018","_id":"5573","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"Graph matching problems for large displacement optical flow of RGB-D images."}],"file_date_updated":"2020-07-14T12:47:05Z","type":"research_data","datarep_id":"82","doi":"10.15479/AT:ISTA:82","date_published":"2018-01-04T00:00:00Z","citation":{"chicago":"Alhaija, Hassan, Anita Sellent, Daniel Kondermann, and Carsten Rother. “Graph Matching Problems for GraphFlow – 6D Large Displacement Scene Flow.” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:82.","short":"H. Alhaija, A. Sellent, D. Kondermann, C. Rother, (2018).","mla":"Alhaija, Hassan, et al. Graph Matching Problems for GraphFlow – 6D Large Displacement Scene Flow. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:82.","apa":"Alhaija, H., Sellent, A., Kondermann, D., & Rother, C. (2018). Graph matching problems for GraphFlow – 6D Large Displacement Scene Flow. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:82","ieee":"H. Alhaija, A. Sellent, D. Kondermann, and C. Rother, “Graph matching problems for GraphFlow – 6D Large Displacement Scene Flow.” Institute of Science and Technology Austria, 2018.","ista":"Alhaija H, Sellent A, Kondermann D, Rother C. 2018. Graph matching problems for GraphFlow – 6D Large Displacement Scene Flow, Institute of Science and Technology Austria, 10.15479/AT:ISTA:82.","ama":"Alhaija H, Sellent A, Kondermann D, Rother C. Graph matching problems for GraphFlow – 6D Large Displacement Scene Flow. 2018. doi:10.15479/AT:ISTA:82"},"tmp":{"short":"CC0 (1.0)","image":"/images/cc_0.png","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","name":"Creative Commons Public Domain Dedication (CC0 1.0)"},"oa":1,"article_processing_charge":"No","has_accepted_license":"1","day":"04","month":"01","keyword":["graph matching","quadratic assignment problem<"]},{"abstract":[{"text":"Retina is a paradigmatic system for studying sensory encoding: the transformation of light into spiking activity of ganglion cells. The inverse problem, where stimulus is reconstructed from spikes, has received less attention, especially for complex stimuli that should be reconstructed “pixel-by-pixel”. We recorded around a hundred neurons from a dense patch in a rat retina and decoded movies of multiple small randomly-moving discs. We constructed nonlinear (kernelized and neural network) decoders that improved significantly over linear results. An important contribution to this was the ability of nonlinear decoders to reliably separate between neural responses driven by locally fluctuating light signals, and responses at locally constant light driven by spontaneous-like activity. This improvement crucially depended on the precise, non-Poisson temporal structure of individual spike trains, which originated in the spike-history dependence of neural responses. We propose a general principle by which downstream circuitry could discriminate between spontaneous and stimulus-driven activity based solely on higher-order statistical structure in the incoming spike trains.","lang":"eng"}],"issue":"5","type":"journal_article","file":[{"file_name":"2018_Plos_Botella_Soler.pdf","access_level":"open_access","file_size":3460786,"content_type":"application/pdf","creator":"dernst","relation":"main_file","file_id":"5974","date_created":"2019-02-13T11:07:15Z","date_updated":"2020-07-14T12:45:53Z","checksum":"3026f94d235219e15514505fdbadf34e"}],"oa_version":"Published Version","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"292","ddc":["570"],"title":"Nonlinear decoding of a complex movie from the mammalian retina","status":"public","intvolume":" 14","day":"10","has_accepted_license":"1","article_processing_charge":"Yes","scopus_import":"1","date_published":"2018-05-10T00:00:00Z","publication":"PLoS Computational Biology","citation":{"ama":"Botella Soler V, Deny S, Martius GS, Marre O, Tkačik G. Nonlinear decoding of a complex movie from the mammalian retina. PLoS Computational Biology. 2018;14(5). doi:10.1371/journal.pcbi.1006057","ista":"Botella Soler V, Deny S, Martius GS, Marre O, Tkačik G. 2018. Nonlinear decoding of a complex movie from the mammalian retina. PLoS Computational Biology. 14(5), e1006057.","apa":"Botella Soler, V., Deny, S., Martius, G. S., Marre, O., & Tkačik, G. (2018). Nonlinear decoding of a complex movie from the mammalian retina. PLoS Computational Biology. Public Library of Science. https://doi.org/10.1371/journal.pcbi.1006057","ieee":"V. Botella Soler, S. Deny, G. S. Martius, O. Marre, and G. Tkačik, “Nonlinear decoding of a complex movie from the mammalian retina,” PLoS Computational Biology, vol. 14, no. 5. Public Library of Science, 2018.","mla":"Botella Soler, Vicente, et al. “Nonlinear Decoding of a Complex Movie from the Mammalian Retina.” PLoS Computational Biology, vol. 14, no. 5, e1006057, Public Library of Science, 2018, doi:10.1371/journal.pcbi.1006057.","short":"V. Botella Soler, S. Deny, G.S. Martius, O. Marre, G. Tkačik, PLoS Computational Biology 14 (2018).","chicago":"Botella Soler, Vicente, Stephane Deny, Georg S Martius, Olivier Marre, and Gašper Tkačik. “Nonlinear Decoding of a Complex Movie from the Mammalian Retina.” PLoS Computational Biology. Public Library of Science, 2018. https://doi.org/10.1371/journal.pcbi.1006057."},"article_type":"original","file_date_updated":"2020-07-14T12:45:53Z","ec_funded":1,"article_number":"e1006057","author":[{"full_name":"Botella Soler, Vicent","first_name":"Vicent","last_name":"Botella Soler","id":"421234E8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8790-1914"},{"first_name":"Stephane","last_name":"Deny","full_name":"Deny, Stephane"},{"full_name":"Martius, Georg S","first_name":"Georg S","last_name":"Martius"},{"full_name":"Marre, Olivier","first_name":"Olivier","last_name":"Marre"},{"orcid":"0000-0002-6699-1455","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","last_name":"Tkacik","first_name":"Gasper","full_name":"Tkacik, Gasper"}],"related_material":{"record":[{"status":"public","relation":"research_data","id":"5584"}],"link":[{"relation":"press_release","description":"News on IST Homepage","url":"https://ist.ac.at/en/news/video-of-moving-discs-reconstructed-from-rat-retinal-neuron-signals/"}]},"date_updated":"2024-02-21T13:45:25Z","date_created":"2018-12-11T11:45:39Z","volume":14,"year":"2018","publication_status":"published","department":[{"_id":"GaTk"}],"publisher":"Public Library of Science","month":"05","doi":"10.1371/journal.pcbi.1006057","language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"isi":["000434012100002"]},"oa":1,"isi":1,"quality_controlled":"1","project":[{"_id":"25CBA828-B435-11E9-9278-68D0E5697425","grant_number":"720270","call_identifier":"H2020","name":"Human Brain Project Specific Grant Agreement 1 (HBP SGA 1)"},{"_id":"254D1A94-B435-11E9-9278-68D0E5697425","grant_number":"P 25651-N26","call_identifier":"FWF","name":"Sensitivity to higher-order statistics in natural scenes"}]},{"quality_controlled":"1","isi":1,"project":[{"call_identifier":"FWF","name":"FWF Open Access Fund","_id":"3AC91DDA-15DF-11EA-824D-93A3E7B544D1"}],"external_id":{"isi":["000429009500021"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"language":[{"iso":"eng"}],"doi":"10.1093/nar/gky079","month":"04","publication_status":"published","publisher":"Oxford University Press","department":[{"_id":"CaGu"}],"year":"2018","date_updated":"2024-02-21T13:44:45Z","date_created":"2018-12-11T11:46:29Z","volume":46,"author":[{"first_name":"Nela","last_name":"Nikolic","id":"42D9CABC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9068-6090","full_name":"Nikolic, Nela"},{"full_name":"Bergmiller, Tobias","orcid":"0000-0001-5396-4346","id":"2C471CFA-F248-11E8-B48F-1D18A9856A87","last_name":"Bergmiller","first_name":"Tobias"},{"first_name":"Alexandra","last_name":"Vandervelde","full_name":"Vandervelde, Alexandra"},{"last_name":"Albanese","first_name":"Tanino","full_name":"Albanese, Tanino"},{"full_name":"Gelens, Lendert","last_name":"Gelens","first_name":"Lendert"},{"first_name":"Isabella","last_name":"Moll","full_name":"Moll, Isabella"}],"related_material":{"record":[{"id":"5569","relation":"popular_science","status":"public"}]},"file_date_updated":"2020-07-14T12:46:27Z","page":"2918-2931","publication":"Nucleic Acids Research","citation":{"chicago":"Nikolic, Nela, Tobias Bergmiller, Alexandra Vandervelde, Tanino Albanese, Lendert Gelens, and Isabella Moll. “Autoregulation of MazEF Expression Underlies Growth Heterogeneity in Bacterial Populations.” Nucleic Acids Research. Oxford University Press, 2018. https://doi.org/10.1093/nar/gky079.","mla":"Nikolic, Nela, et al. “Autoregulation of MazEF Expression Underlies Growth Heterogeneity in Bacterial Populations.” Nucleic Acids Research, vol. 46, no. 6, Oxford University Press, 2018, pp. 2918–31, doi:10.1093/nar/gky079.","short":"N. Nikolic, T. Bergmiller, A. Vandervelde, T. Albanese, L. Gelens, I. Moll, Nucleic Acids Research 46 (2018) 2918–2931.","ista":"Nikolic N, Bergmiller T, Vandervelde A, Albanese T, Gelens L, Moll I. 2018. Autoregulation of mazEF expression underlies growth heterogeneity in bacterial populations. Nucleic Acids Research. 46(6), 2918–2931.","ieee":"N. Nikolic, T. Bergmiller, A. Vandervelde, T. Albanese, L. Gelens, and I. Moll, “Autoregulation of mazEF expression underlies growth heterogeneity in bacterial populations,” Nucleic Acids Research, vol. 46, no. 6. Oxford University Press, pp. 2918–2931, 2018.","apa":"Nikolic, N., Bergmiller, T., Vandervelde, A., Albanese, T., Gelens, L., & Moll, I. (2018). Autoregulation of mazEF expression underlies growth heterogeneity in bacterial populations. Nucleic Acids Research. Oxford University Press. https://doi.org/10.1093/nar/gky079","ama":"Nikolic N, Bergmiller T, Vandervelde A, Albanese T, Gelens L, Moll I. Autoregulation of mazEF expression underlies growth heterogeneity in bacterial populations. Nucleic Acids Research. 2018;46(6):2918-2931. doi:10.1093/nar/gky079"},"date_published":"2018-04-06T00:00:00Z","scopus_import":"1","day":"06","has_accepted_license":"1","article_processing_charge":"Yes (in subscription journal)","title":"Autoregulation of mazEF expression underlies growth heterogeneity in bacterial populations","status":"public","ddc":["576"],"intvolume":" 46","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"438","oa_version":"Published Version","file":[{"checksum":"3ff4f545c27e11a4cd20ccb30778793e","date_updated":"2020-07-14T12:46:27Z","date_created":"2018-12-12T10:15:30Z","file_id":"5151","relation":"main_file","creator":"system","content_type":"application/pdf","file_size":5027978,"access_level":"open_access","file_name":"IST-2018-971-v1+1_2018_Nikoloc_Autoregulation_of.pdf"}],"pubrep_id":"971","type":"journal_article","abstract":[{"lang":"eng","text":"The MazF toxin sequence-specifically cleaves single-stranded RNA upon various stressful conditions, and it is activated as a part of the mazEF toxin–antitoxin module in Escherichia coli. Although autoregulation of mazEF expression through the MazE antitoxin-dependent transcriptional repression has been biochemically characterized, less is known about post-transcriptional autoregulation, as well as how both of these autoregulatory features affect growth of single cells during conditions that promote MazF production. Here, we demonstrate post-transcriptional autoregulation of mazF expression dynamics by MazF cleaving its own transcript. Single-cell analyses of bacterial populations during ectopic MazF production indicated that two-level autoregulation of mazEF expression influences cell-to-cell growth rate heterogeneity. The increase in growth rate heterogeneity is governed by the MazE antitoxin, and tuned by the MazF-dependent mazF mRNA cleavage. Also, both autoregulatory features grant rapid exit from the stress caused by mazF overexpression. Time-lapse microscopy revealed that MazF-mediated cleavage of mazF mRNA leads to increased temporal variability in length of individual cells during ectopic mazF overexpression, as explained by a stochastic model indicating that mazEF mRNA cleavage underlies temporal fluctuations in MazF levels during stress."}],"issue":"6"},{"publication":"eLife","citation":{"ista":"Picard MAL, Cosseau C, Ferré S, Quack T, Grevelding C, Couté Y, Vicoso B. 2018. Evolution of gene dosage on the Z-chromosome of schistosome parasites. eLife. 7, e35684.","ieee":"M. A. L. Picard et al., “Evolution of gene dosage on the Z-chromosome of schistosome parasites,” eLife, vol. 7. eLife Sciences Publications, 2018.","apa":"Picard, M. A. L., Cosseau, C., Ferré, S., Quack, T., Grevelding, C., Couté, Y., & Vicoso, B. (2018). Evolution of gene dosage on the Z-chromosome of schistosome parasites. ELife. eLife Sciences Publications. https://doi.org/10.7554/eLife.35684","ama":"Picard MAL, Cosseau C, Ferré S, et al. Evolution of gene dosage on the Z-chromosome of schistosome parasites. eLife. 2018;7. doi:10.7554/eLife.35684","chicago":"Picard, Marion A L, Celine Cosseau, Sabrina Ferré, Thomas Quack, Christoph Grevelding, Yohann Couté, and Beatriz Vicoso. “Evolution of Gene Dosage on the Z-Chromosome of Schistosome Parasites.” ELife. eLife Sciences Publications, 2018. https://doi.org/10.7554/eLife.35684.","mla":"Picard, Marion A. L., et al. “Evolution of Gene Dosage on the Z-Chromosome of Schistosome Parasites.” ELife, vol. 7, e35684, eLife Sciences Publications, 2018, doi:10.7554/eLife.35684.","short":"M.A.L. Picard, C. Cosseau, S. Ferré, T. Quack, C. Grevelding, Y. Couté, B. Vicoso, ELife 7 (2018)."},"article_type":"original","date_published":"2018-08-13T00:00:00Z","scopus_import":"1","day":"13","has_accepted_license":"1","article_processing_charge":"No","_id":"131","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","status":"public","title":"Evolution of gene dosage on the Z-chromosome of schistosome parasites","ddc":["570"],"intvolume":" 7","file":[{"creator":"dernst","file_size":3158125,"content_type":"application/pdf","access_level":"open_access","file_name":"2018_eLife_Picard.pdf","checksum":"d6331d4385b1fffd6b47b45d5949d841","date_created":"2018-12-17T11:55:05Z","date_updated":"2020-07-14T12:44:43Z","file_id":"5695","relation":"main_file"}],"oa_version":"Published Version","type":"journal_article","abstract":[{"text":"XY systems usually show chromosome-wide compensation of X-linked genes, while in many ZW systems, compensation is restricted to a minority of dosage-sensitive genes. Why such differences arose is still unclear. Here, we combine comparative genomics, transcriptomics and proteomics to obtain a complete overview of the evolution of gene dosage on the Z-chromosome of Schistosoma parasites. We compare the Z-chromosome gene content of African (Schistosoma mansoni and S. haematobium) and Asian (S. japonicum) schistosomes and describe lineage-specific evolutionary strata. We use these to assess gene expression evolution following sex-linkage. The resulting patterns suggest a reduction in expression of Z-linked genes in females, combined with upregulation of the Z in both sexes, in line with the first step of Ohno’s classic model of dosage compensation evolution. Quantitative proteomics suggest that post-transcriptional mechanisms do not play a major role in balancing the expression of Z-linked genes. ","lang":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"external_id":{"isi":["000441388200001"]},"isi":1,"quality_controlled":"1","project":[{"_id":"250ED89C-B435-11E9-9278-68D0E5697425","grant_number":"P28842-B22","call_identifier":"FWF","name":"Sex chromosome evolution under male- and female- heterogamety"}],"doi":"10.7554/eLife.35684","language":[{"iso":"eng"}],"month":"08","year":"2018","acknowledgement":"We are grateful to Lu Dabing (Soochow University, Suzhou, China) for providing Schistosoma japonicum samples, to Ariana Macon (IST Austria) and Georgette Stovall (JLU Giessen) for technical assistance, to IT support at IST Austria for providing optimal environment to bioinformatic analyses, and to the Vicoso lab for comments on the manuscript.","publication_status":"published","department":[{"_id":"BeVi"}],"publisher":"eLife Sciences Publications","author":[{"id":"2C921A7A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8101-2518","first_name":"Marion A","last_name":"Picard","full_name":"Picard, Marion A"},{"last_name":"Cosseau","first_name":"Celine","full_name":"Cosseau, Celine"},{"first_name":"Sabrina","last_name":"Ferré","full_name":"Ferré, Sabrina"},{"full_name":"Quack, Thomas","first_name":"Thomas","last_name":"Quack"},{"first_name":"Christoph","last_name":"Grevelding","full_name":"Grevelding, Christoph"},{"full_name":"Couté, Yohann","first_name":"Yohann","last_name":"Couté"},{"full_name":"Vicoso, Beatriz","orcid":"0000-0002-4579-8306","id":"49E1C5C6-F248-11E8-B48F-1D18A9856A87","last_name":"Vicoso","first_name":"Beatriz"}],"related_material":{"record":[{"relation":"popular_science","status":"public","id":"5586"}]},"date_updated":"2024-02-21T13:45:12Z","date_created":"2018-12-11T11:44:47Z","volume":7,"article_number":"e35684","file_date_updated":"2020-07-14T12:44:43Z","publist_id":"7792"},{"author":[{"last_name":"Deny","first_name":"Stephane","full_name":"Deny, Stephane"},{"full_name":"Marre, Olivier","first_name":"Olivier","last_name":"Marre"},{"full_name":"Botella-Soler, Vicente","last_name":"Botella-Soler","first_name":"Vicente"},{"id":"3A276B68-F248-11E8-B48F-1D18A9856A87","last_name":"Martius","first_name":"Georg S","full_name":"Martius, Georg S"},{"last_name":"Tkacik","first_name":"Gasper","orcid":"0000-0002-6699-1455","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","full_name":"Tkacik, Gasper"}],"related_material":{"record":[{"relation":"used_in_publication","status":"public","id":"292"}]},"date_created":"2018-12-12T12:31:39Z","date_updated":"2024-02-21T13:45:26Z","file":[{"checksum":"6808748837b9afbbbabc2a356ca2b88a","date_updated":"2020-07-14T12:47:07Z","date_created":"2018-12-12T13:02:24Z","file_id":"5590","relation":"main_file","creator":"system","file_size":1142543971,"content_type":"application/octet-stream","access_level":"open_access","file_name":"IST-2018-98-v1+1_BBalls_area2_tile2_20x20.mat"},{"creator":"system","file_size":702336,"content_type":"application/pdf","file_name":"IST-2018-98-v1+2_ExperimentStructure.pdf","access_level":"open_access","date_updated":"2020-07-14T12:47:07Z","date_created":"2018-12-12T13:02:25Z","checksum":"d6d6cd07743038fe3a12352983fcf9dd","file_id":"5591","relation":"main_file"},{"date_updated":"2020-07-14T12:47:07Z","date_created":"2018-12-12T13:02:26Z","checksum":"0c9cfb4dab35bb3dc25a04395600b1c8","file_id":"5592","relation":"main_file","creator":"system","file_size":432,"content_type":"application/octet-stream","file_name":"IST-2018-98-v1+3_GoodLocations_area2_20x20.mat","access_level":"open_access"},{"file_id":"5593","relation":"main_file","date_updated":"2020-07-14T12:47:07Z","date_created":"2018-12-12T13:02:26Z","checksum":"2a83b011012e21e934b4596285b1a183","file_name":"IST-2018-98-v1+4_README.txt","access_level":"open_access","creator":"system","file_size":986,"content_type":"text/plain"}],"oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"5584","year":"2018","ddc":["570"],"title":"Nonlinear decoding of a complex movie from the mammalian retina","status":"public","publisher":"Institute of Science and Technology Austria","department":[{"_id":"ChLa"},{"_id":"GaTk"}],"abstract":[{"text":"This package contains data for the publication \"Nonlinear decoding of a complex movie from the mammalian retina\" by Deny S. et al, PLOS Comput Biol (2018). \r\n\r\nThe data consists of\r\n(i) 91 spike sorted, isolated rat retinal ganglion cells that pass stability and quality criteria, recorded on the multi-electrode array, in response to the presentation of the complex movie with many randomly moving dark discs. The responses are represented as 648000 x 91 binary matrix, where the first index indicates the timebin of duration 12.5 ms, and the second index the neural identity. The matrix entry is 0/1 if the neuron didn't/did spike in the particular time bin.\r\n(ii) README file and a graphical illustration of the structure of the experiment, specifying how the 648000 timebins are split into epochs where 1, 2, 4, or 10 discs were displayed, and which stimulus segments are exact repeats or unique ball trajectories.\r\n(iii) a 648000 x 400 matrix of luminance traces for each of the 20 x 20 positions (\"sites\") in the movie frame, with time that is locked to the recorded raster. The luminance traces are produced as described in the manuscript by filtering the raw disc movie with a small gaussian spatial kernel. ","lang":"eng"}],"file_date_updated":"2020-07-14T12:47:07Z","datarep_id":"98","type":"research_data","date_published":"2018-03-29T00:00:00Z","doi":"10.15479/AT:ISTA:98","citation":{"ama":"Deny S, Marre O, Botella-Soler V, Martius GS, Tkačik G. Nonlinear decoding of a complex movie from the mammalian retina. 2018. doi:10.15479/AT:ISTA:98","apa":"Deny, S., Marre, O., Botella-Soler, V., Martius, G. S., & Tkačik, G. (2018). Nonlinear decoding of a complex movie from the mammalian retina. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:98","ieee":"S. Deny, O. Marre, V. Botella-Soler, G. S. Martius, and G. Tkačik, “Nonlinear decoding of a complex movie from the mammalian retina.” Institute of Science and Technology Austria, 2018.","ista":"Deny S, Marre O, Botella-Soler V, Martius GS, Tkačik G. 2018. Nonlinear decoding of a complex movie from the mammalian retina, Institute of Science and Technology Austria, 10.15479/AT:ISTA:98.","short":"S. Deny, O. Marre, V. Botella-Soler, G.S. Martius, G. Tkačik, (2018).","mla":"Deny, Stephane, et al. Nonlinear Decoding of a Complex Movie from the Mammalian Retina. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:98.","chicago":"Deny, Stephane, Olivier Marre, Vicente Botella-Soler, Georg S Martius, and Gašper Tkačik. “Nonlinear Decoding of a Complex Movie from the Mammalian Retina.” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:98."},"tmp":{"short":"CC0 (1.0)","image":"/images/cc_0.png","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","name":"Creative Commons Public Domain Dedication (CC0 1.0)"},"oa":1,"project":[{"name":"Sensitivity to higher-order statistics in natural scenes","call_identifier":"FWF","_id":"254D1A94-B435-11E9-9278-68D0E5697425","grant_number":"P 25651-N26"}],"month":"03","day":"29","article_processing_charge":"No","has_accepted_license":"1","keyword":["retina","decoding","regression","neural networks","complex stimulus"]},{"ec_funded":1,"publisher":"Wiley","department":[{"_id":"NiBa"}],"publication_status":"published","acknowledgement":"ERC, Grant/Award Number: 250152","year":"2018","volume":18,"date_created":"2018-12-11T11:45:37Z","date_updated":"2024-02-21T13:45:00Z","related_material":{"record":[{"relation":"popular_science","status":"public","id":"5583"}]},"author":[{"id":"3153D6D4-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8511-0254","first_name":"Thomas","last_name":"Ellis","full_name":"Ellis, Thomas"},{"orcid":"0000-0002-4014-8478","id":"419049E2-F248-11E8-B48F-1D18A9856A87","last_name":"Field","first_name":"David","full_name":"Field, David"},{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240","first_name":"Nicholas H","last_name":"Barton","full_name":"Barton, Nicholas H"}],"month":"09","project":[{"call_identifier":"FP7","name":"Limits to selection in biology and in evolutionary computation","grant_number":"250152","_id":"25B07788-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","isi":1,"external_id":{"isi":["000441753000007"]},"language":[{"iso":"eng"}],"doi":"10.1111/1755-0998.12782","type":"journal_article","issue":"5","abstract":[{"lang":"eng","text":"Pedigree and sibship reconstruction are important methods in quantifying relationships and fitness of individuals in natural populations. Current methods employ a Markov chain-based algorithm to explore plausible possible pedigrees iteratively. This provides accurate results, but is time-consuming. Here, we develop a method to infer sibship and paternity relationships from half-sibling arrays of known maternity using hierarchical clustering. Given 50 or more unlinked SNP markers and empirically derived error rates, the method performs as well as the widely used package Colony, but is faster by two orders of magnitude. Using simulations, we show that the method performs well across contrasting mating scenarios, even when samples are large. We then apply the method to open-pollinated arrays of the snapdragon Antirrhinum majus and find evidence for a high degree of multiple mating. Although we focus on diploid SNP data, the method does not depend on marker type and as such has broad applications in nonmodel systems. "}],"intvolume":" 18","title":"Efficient inference of paternity and sibship inference given known maternity via hierarchical clustering","status":"public","_id":"286","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa_version":"None","scopus_import":"1","article_processing_charge":"No","day":"01","page":"988 - 999","citation":{"chicago":"Ellis, Thomas, David Field, and Nicholas H Barton. “Efficient Inference of Paternity and Sibship Inference given Known Maternity via Hierarchical Clustering.” Molecular Ecology Resources. Wiley, 2018. https://doi.org/10.1111/1755-0998.12782.","mla":"Ellis, Thomas, et al. “Efficient Inference of Paternity and Sibship Inference given Known Maternity via Hierarchical Clustering.” Molecular Ecology Resources, vol. 18, no. 5, Wiley, 2018, pp. 988–99, doi:10.1111/1755-0998.12782.","short":"T. Ellis, D. Field, N.H. Barton, Molecular Ecology Resources 18 (2018) 988–999.","ista":"Ellis T, Field D, Barton NH. 2018. Efficient inference of paternity and sibship inference given known maternity via hierarchical clustering. Molecular Ecology Resources. 18(5), 988–999.","ieee":"T. Ellis, D. Field, and N. H. Barton, “Efficient inference of paternity and sibship inference given known maternity via hierarchical clustering,” Molecular Ecology Resources, vol. 18, no. 5. Wiley, pp. 988–999, 2018.","apa":"Ellis, T., Field, D., & Barton, N. H. (2018). Efficient inference of paternity and sibship inference given known maternity via hierarchical clustering. Molecular Ecology Resources. Wiley. https://doi.org/10.1111/1755-0998.12782","ama":"Ellis T, Field D, Barton NH. Efficient inference of paternity and sibship inference given known maternity via hierarchical clustering. Molecular Ecology Resources. 2018;18(5):988-999. doi:10.1111/1755-0998.12782"},"publication":"Molecular Ecology Resources","date_published":"2018-09-01T00:00:00Z"},{"keyword":["schistosoma","Z-chromosome","gene expression"],"month":"07","day":"24","has_accepted_license":"1","article_processing_charge":"No","project":[{"name":"Sex chromosome evolution under male- and female- heterogamety","call_identifier":"FWF","_id":"250ED89C-B435-11E9-9278-68D0E5697425","grant_number":"P28842-B22"}],"oa":1,"tmp":{"short":"CC0 (1.0)","image":"/images/cc_0.png","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","name":"Creative Commons Public Domain Dedication (CC0 1.0)"},"citation":{"ama":"Vicoso B. Input files and scripts from “Evolution of gene dosage on the Z-chromosome of schistosome parasites” by Picard M.A.L., et al (2018). 2018. doi:10.15479/AT:ISTA:109","apa":"Vicoso, B. (2018). Input files and scripts from “Evolution of gene dosage on the Z-chromosome of schistosome parasites” by Picard M.A.L., et al (2018). Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:109","ieee":"B. Vicoso, “Input files and scripts from ‘Evolution of gene dosage on the Z-chromosome of schistosome parasites’ by Picard M.A.L., et al (2018).” Institute of Science and Technology Austria, 2018.","ista":"Vicoso B. 2018. Input files and scripts from ‘Evolution of gene dosage on the Z-chromosome of schistosome parasites’ by Picard M.A.L., et al (2018), Institute of Science and Technology Austria, 10.15479/AT:ISTA:109.","short":"B. Vicoso, (2018).","mla":"Vicoso, Beatriz. Input Files and Scripts from “Evolution of Gene Dosage on the Z-Chromosome of Schistosome Parasites” by Picard M.A.L., et Al (2018). Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:109.","chicago":"Vicoso, Beatriz. “Input Files and Scripts from ‘Evolution of Gene Dosage on the Z-Chromosome of Schistosome Parasites’ by Picard M.A.L., et Al (2018).” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:109."},"doi":"10.15479/AT:ISTA:109","date_published":"2018-07-24T00:00:00Z","datarep_id":"109","type":"research_data","file_date_updated":"2020-07-14T12:47:08Z","abstract":[{"text":"Input files and scripts from \"Evolution of gene dosage on the Z-chromosome of schistosome parasites\" by Picard M.A.L., et al (2018).","lang":"eng"}],"ddc":["570"],"status":"public","title":"Input files and scripts from \"Evolution of gene dosage on the Z-chromosome of schistosome parasites\" by Picard M.A.L., et al (2018)","department":[{"_id":"BeVi"}],"publisher":"Institute of Science and Technology Austria","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"5586","year":"2018","date_created":"2018-12-12T12:31:40Z","date_updated":"2024-02-21T13:45:12Z","oa_version":"Published Version","file":[{"file_name":"IST-2018-109-v1+1_SupplementaryMethods.zip","access_level":"open_access","creator":"system","content_type":"application/zip","file_size":11918144,"file_id":"5601","relation":"main_file","date_updated":"2020-07-14T12:47:08Z","date_created":"2018-12-12T13:02:35Z","checksum":"e60b484bd6f55c08eb66a189cb72c923"}],"author":[{"orcid":"0000-0002-4579-8306","id":"49E1C5C6-F248-11E8-B48F-1D18A9856A87","last_name":"Vicoso","first_name":"Beatriz","full_name":"Vicoso, Beatriz"}],"contributor":[{"last_name":"Picard","first_name":"Marion A","orcid":"0000-0002-8101-2518","id":"2C921A7A-F248-11E8-B48F-1D18A9856A87"}],"related_material":{"record":[{"status":"public","relation":"research_paper","id":"131"}]}},{"day":"12","month":"02","article_processing_charge":"No","has_accepted_license":"1","oa":1,"tmp":{"short":"CC0 (1.0)","image":"/images/cc_0.png","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","name":"Creative Commons Public Domain Dedication (CC0 1.0)"},"citation":{"short":"T. Ellis, (2018).","mla":"Ellis, Thomas. Data and Python Scripts Supporting Python Package FAPS. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:95.","chicago":"Ellis, Thomas. “Data and Python Scripts Supporting Python Package FAPS.” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:95.","ama":"Ellis T. Data and Python scripts supporting Python package FAPS. 2018. doi:10.15479/AT:ISTA:95","ieee":"T. Ellis, “Data and Python scripts supporting Python package FAPS.” Institute of Science and Technology Austria, 2018.","apa":"Ellis, T. (2018). Data and Python scripts supporting Python package FAPS. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:95","ista":"Ellis T. 2018. Data and Python scripts supporting Python package FAPS, Institute of Science and Technology Austria, 10.15479/AT:ISTA:95."},"doi":"10.15479/AT:ISTA:95","date_published":"2018-02-12T00:00:00Z","datarep_id":"95","type":"research_data","abstract":[{"text":"Data and scripts are provided in support of the manuscript \"Efficient inference of paternity and sibship inference given known maternity via hierarchical clustering\", and the associated Python package FAPS, available from www.github.com/ellisztamas/faps.\r\n\r\nSimulation scripts cover:\r\n1. Performance under different mating scenarios.\r\n2. Comparison with Colony2.\r\n3. Effect of changing the number of Monte Carlo draws\r\n\r\nThe final script covers the analysis of half-sib arrays from wild-pollinated seed in an Antirrhinum majus hybrid zone.","lang":"eng"}],"file_date_updated":"2020-07-14T12:47:07Z","_id":"5583","year":"2018","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","title":"Data and Python scripts supporting Python package FAPS","department":[{"_id":"NiBa"}],"publisher":"Institute of Science and Technology Austria","author":[{"orcid":"0000-0002-8511-0254","id":"3153D6D4-F248-11E8-B48F-1D18A9856A87","last_name":"Ellis","first_name":"Thomas","full_name":"Ellis, Thomas"}],"contributor":[{"last_name":"Field","first_name":"David","id":"419049E2-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Nicholas H","last_name":"Barton","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"}],"related_material":{"record":[{"id":"286","relation":"research_paper","status":"public"}]},"date_updated":"2024-02-21T13:45:01Z","date_created":"2018-12-12T12:31:39Z","file":[{"date_created":"2018-12-12T13:02:41Z","date_updated":"2020-07-14T12:47:07Z","checksum":"fc6aab51439f2622ba6df8632e66fd4f","relation":"main_file","file_id":"5606","file_size":122048,"content_type":"text/csv","creator":"system","file_name":"IST-2018-95-v1+1_amajus_GPS_2012.csv","access_level":"open_access"},{"file_name":"IST-2018-95-v1+2_offspring_SNPs_2012.csv","access_level":"open_access","content_type":"text/csv","file_size":235980,"creator":"system","relation":"main_file","file_id":"5607","date_created":"2018-12-12T13:02:42Z","date_updated":"2020-07-14T12:47:07Z","checksum":"92347586ae4f8a6eb7c04354797bf314"},{"relation":"main_file","file_id":"5608","date_created":"2018-12-12T13:02:43Z","date_updated":"2020-07-14T12:47:07Z","checksum":"3300813645a54e6c5c39f41917228354","file_name":"IST-2018-95-v1+3_parents_SNPs_2012.csv","access_level":"open_access","content_type":"text/csv","file_size":311712,"creator":"system"},{"access_level":"open_access","file_name":"IST-2018-95-v1+4_faps_scripts.zip","file_size":342090,"content_type":"application/zip","creator":"system","relation":"main_file","file_id":"5609","checksum":"e739fc473567fd8f39438b445fc46147","date_created":"2018-12-12T13:02:44Z","date_updated":"2020-07-14T12:47:07Z"}],"oa_version":"Published Version"},{"date_published":"2018-02-07T00:00:00Z","doi":"10.15479/AT:ISTA:74","tmp":{"short":"CC0 (1.0)","image":"/images/cc_0.png","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","name":"Creative Commons Public Domain Dedication (CC0 1.0)"},"oa":1,"citation":{"chicago":"Bergmiller, Tobias, and Nela Nikolic. “Time-Lapse Microscopy Data.” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:74.","mla":"Bergmiller, Tobias, and Nela Nikolic. Time-Lapse Microscopy Data. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:74.","short":"T. Bergmiller, N. Nikolic, (2018).","ista":"Bergmiller T, Nikolic N. 2018. Time-lapse microscopy data, Institute of Science and Technology Austria, 10.15479/AT:ISTA:74.","apa":"Bergmiller, T., & Nikolic, N. (2018). Time-lapse microscopy data. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:74","ieee":"T. Bergmiller and N. Nikolic, “Time-lapse microscopy data.” Institute of Science and Technology Austria, 2018.","ama":"Bergmiller T, Nikolic N. Time-lapse microscopy data. 2018. doi:10.15479/AT:ISTA:74"},"has_accepted_license":"1","article_processing_charge":"No","day":"07","month":"02","keyword":["microscopy","microfluidics"],"oa_version":"Published Version","file":[{"file_name":"IST-2018-74-v1+2_15-11-05.zip","access_level":"open_access","file_size":3558703796,"content_type":"application/zip","creator":"system","relation":"main_file","file_id":"5637","date_created":"2018-12-12T13:04:39Z","date_updated":"2020-07-14T12:47:04Z","checksum":"61ebb92213cfffeba3ddbaff984b81af"},{"relation":"main_file","file_id":"5638","checksum":"bf26649af310ef6892d68576515cde6d","date_updated":"2020-07-14T12:47:04Z","date_created":"2018-12-12T13:04:55Z","access_level":"open_access","file_name":"IST-2018-74-v1+3_15-07-31.zip","content_type":"application/zip","file_size":1830422606,"creator":"system"},{"content_type":"application/zip","file_size":2140849248,"creator":"system","file_name":"IST-2018-74-v1+4_Images_for_analysis.zip","access_level":"open_access","date_updated":"2020-07-14T12:47:04Z","date_created":"2018-12-12T13:05:11Z","checksum":"8e46eedce06f22acb2be1a9b9d3f56bd","relation":"main_file","file_id":"5639"}],"date_updated":"2024-02-21T13:44:45Z","date_created":"2018-12-12T12:31:35Z","related_material":{"record":[{"status":"public","relation":"research_paper","id":"438"}]},"author":[{"first_name":"Tobias","last_name":"Bergmiller","id":"2C471CFA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5396-4346","full_name":"Bergmiller, Tobias"},{"first_name":"Nela","last_name":"Nikolic","id":"42D9CABC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9068-6090","full_name":"Nikolic, Nela"}],"department":[{"_id":"CaGu"}],"publisher":"Institute of Science and Technology Austria","title":"Time-lapse microscopy data","status":"public","ddc":["579"],"_id":"5569","year":"2018","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"7385","abstract":[{"text":"Nela Nikolic, Tobias Bergmiller, Alexandra Vandervelde, Tanino G. Albanese, Lendert Gelens, and Isabella Moll (2018)\r\n“Autoregulation of mazEF expression underlies growth heterogeneity in bacterial populations” Nucleic Acids Research, doi: 10.15479/AT:ISTA:74;\r\nmicroscopy experiments by Tobias Bergmiller; image and data analysis by Nela Nikolic.","lang":"eng"}],"file_date_updated":"2020-07-14T12:47:04Z","type":"research_data","datarep_id":"74"},{"scopus_import":"1","article_processing_charge":"No","has_accepted_license":"1","day":"30","citation":{"chicago":"De Martino, Daniele, Andersson Anna Mc, Tobias Bergmiller, Calin C Guet, and Gašper Tkačik. “Statistical Mechanics for Metabolic Networks during Steady State Growth.” Nature Communications. Springer Nature, 2018. https://doi.org/10.1038/s41467-018-05417-9.","mla":"De Martino, Daniele, et al. “Statistical Mechanics for Metabolic Networks during Steady State Growth.” Nature Communications, vol. 9, no. 1, 2988, Springer Nature, 2018, doi:10.1038/s41467-018-05417-9.","short":"D. De Martino, A.A. Mc, T. Bergmiller, C.C. Guet, G. Tkačik, Nature Communications 9 (2018).","ista":"De Martino D, Mc AA, Bergmiller T, Guet CC, Tkačik G. 2018. Statistical mechanics for metabolic networks during steady state growth. Nature Communications. 9(1), 2988.","ieee":"D. De Martino, A. A. Mc, T. Bergmiller, C. C. Guet, and G. Tkačik, “Statistical mechanics for metabolic networks during steady state growth,” Nature Communications, vol. 9, no. 1. Springer Nature, 2018.","apa":"De Martino, D., Mc, A. A., Bergmiller, T., Guet, C. C., & Tkačik, G. (2018). Statistical mechanics for metabolic networks during steady state growth. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-018-05417-9","ama":"De Martino D, Mc AA, Bergmiller T, Guet CC, Tkačik G. Statistical mechanics for metabolic networks during steady state growth. Nature Communications. 2018;9(1). doi:10.1038/s41467-018-05417-9"},"publication":"Nature Communications","date_published":"2018-07-30T00:00:00Z","type":"journal_article","issue":"1","abstract":[{"text":"Which properties of metabolic networks can be derived solely from stoichiometry? Predictive results have been obtained by flux balance analysis (FBA), by postulating that cells set metabolic fluxes to maximize growth rate. Here we consider a generalization of FBA to single-cell level using maximum entropy modeling, which we extend and test experimentally. Specifically, we define for Escherichia coli metabolism a flux distribution that yields the experimental growth rate: the model, containing FBA as a limit, provides a better match to measured fluxes and it makes a wide range of predictions: on flux variability, regulation, and correlations; on the relative importance of stoichiometry vs. optimization; on scaling relations for growth rate distributions. We validate the latter here with single-cell data at different sub-inhibitory antibiotic concentrations. The model quantifies growth optimization as emerging from the interplay of competitive dynamics in the population and regulation of metabolism at the level of single cells.","lang":"eng"}],"intvolume":" 9","status":"public","title":"Statistical mechanics for metabolic networks during steady state growth","ddc":["570"],"_id":"161","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","file":[{"checksum":"3ba7ab27b27723c7dcf633e8fc1f8f18","date_created":"2018-12-17T16:44:28Z","date_updated":"2020-07-14T12:45:06Z","relation":"main_file","file_id":"5728","content_type":"application/pdf","file_size":1043205,"creator":"dernst","access_level":"open_access","file_name":"2018_NatureComm_DeMartino.pdf"}],"oa_version":"Published Version","month":"07","project":[{"name":"Biophysics of information processing in gene regulation","call_identifier":"FWF","grant_number":"P28844-B27","_id":"254E9036-B435-11E9-9278-68D0E5697425"},{"name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","isi":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"external_id":{"isi":["000440149300021"]},"language":[{"iso":"eng"}],"doi":"10.1038/s41467-018-05417-9","article_number":"2988","ec_funded":1,"publist_id":"7760","file_date_updated":"2020-07-14T12:45:06Z","department":[{"_id":"GaTk"},{"_id":"CaGu"}],"publisher":"Springer Nature","publication_status":"published","year":"2018","volume":9,"date_updated":"2024-02-21T13:45:39Z","date_created":"2018-12-11T11:44:57Z","related_material":{"record":[{"status":"public","relation":"popular_science","id":"5587"}]},"author":[{"orcid":"0000-0002-5214-4706","id":"3FF5848A-F248-11E8-B48F-1D18A9856A87","last_name":"De Martino","first_name":"Daniele","full_name":"De Martino, Daniele"},{"full_name":"Mc, Andersson Anna","last_name":"Mc","first_name":"Andersson Anna"},{"full_name":"Bergmiller, Tobias","orcid":"0000-0001-5396-4346","id":"2C471CFA-F248-11E8-B48F-1D18A9856A87","last_name":"Bergmiller","first_name":"Tobias"},{"id":"47F8433E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6220-2052","first_name":"Calin C","last_name":"Guet","full_name":"Guet, Calin C"},{"full_name":"Tkacik, Gasper","last_name":"Tkacik","first_name":"Gasper","orcid":"0000-0002-6699-1455","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87"}]},{"keyword":["metabolic networks","e.coli core","maximum entropy","monte carlo markov chain sampling","ellipsoidal rounding"],"has_accepted_license":"1","article_processing_charge":"No","day":"21","month":"09","citation":{"ama":"De Martino D, Tkačik G. Supporting materials “STATISTICAL MECHANICS FOR METABOLIC NETWORKS IN STEADY-STATE GROWTH.” 2018. doi:10.15479/AT:ISTA:62","ista":"De Martino D, Tkačik G. 2018. Supporting materials ‘STATISTICAL MECHANICS FOR METABOLIC NETWORKS IN STEADY-STATE GROWTH’, Institute of Science and Technology Austria, 10.15479/AT:ISTA:62.","ieee":"D. De Martino and G. Tkačik, “Supporting materials ‘STATISTICAL MECHANICS FOR METABOLIC NETWORKS IN STEADY-STATE GROWTH.’” Institute of Science and Technology Austria, 2018.","apa":"De Martino, D., & Tkačik, G. (2018). Supporting materials “STATISTICAL MECHANICS FOR METABOLIC NETWORKS IN STEADY-STATE GROWTH.” Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:62","mla":"De Martino, Daniele, and Gašper Tkačik. Supporting Materials “STATISTICAL MECHANICS FOR METABOLIC NETWORKS IN STEADY-STATE GROWTH.” Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:62.","short":"D. De Martino, G. Tkačik, (2018).","chicago":"De Martino, Daniele, and Gašper Tkačik. “Supporting Materials ‘STATISTICAL MECHANICS FOR METABOLIC NETWORKS IN STEADY-STATE GROWTH.’” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:62."},"tmp":{"short":"CC0 (1.0)","image":"/images/cc_0.png","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","name":"Creative Commons Public Domain Dedication (CC0 1.0)"},"oa":1,"project":[{"grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7"},{"grant_number":"P28844-B27","_id":"254E9036-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Biophysics of information processing in gene regulation"}],"doi":"10.15479/AT:ISTA:62","date_published":"2018-09-21T00:00:00Z","type":"research_data","datarep_id":"111","ec_funded":1,"file_date_updated":"2020-07-14T12:47:08Z","abstract":[{"text":"Supporting material to the article \r\nSTATISTICAL MECHANICS FOR METABOLIC NETWORKS IN STEADY-STATE GROWTH\r\n\r\nboundscoli.dat\r\nFlux Bounds of the E. coli catabolic core model iAF1260 in a glucose limited minimal medium. \r\n\r\npolcoli.dat\r\nMatrix enconding the polytope of the E. coli catabolic core model iAF1260 in a glucose limited minimal medium, \r\nobtained from the soichiometric matrix by standard linear algebra (reduced row echelon form).\r\n\r\nellis.dat\r\nApproximate Lowner-John ellipsoid rounding the polytope of the E. coli catabolic core model iAF1260 in a glucose limited minimal medium\r\nobtained with the Lovasz method.\r\n\r\npoint0.dat\r\nCenter of the approximate Lowner-John ellipsoid rounding the polytope of the E. coli catabolic core model iAF1260 in a glucose limited minimal medium\r\nobtained with the Lovasz method.\r\n\r\nlovasz.cpp \r\nThis c++ code file receives in input the polytope of the feasible steady states of a metabolic network, \r\n(matrix and bounds), and it gives in output an approximate Lowner-John ellipsoid rounding the polytope\r\nwith the Lovasz method \r\nNB inputs are referred by defaults to the catabolic core of the E.Coli network iAF1260. \r\nFor further details we refer to PLoS ONE 10.4 e0122670 (2015).\r\n\r\nsampleHRnew.cpp \r\nThis c++ code file receives in input the polytope of the feasible steady states of a metabolic network, \r\n(matrix and bounds), the ellipsoid rounding the polytope, a point inside and \r\nit gives in output a max entropy sampling at fixed average growth rate \r\nof the steady states by performing an Hit-and-Run Monte Carlo Markov chain.\r\nNB inputs are referred by defaults to the catabolic core of the E.Coli network iAF1260. \r\nFor further details we refer to PLoS ONE 10.4 e0122670 (2015).","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"5587","year":"2018","department":[{"_id":"GaTk"}],"publisher":"Institute of Science and Technology Austria","ddc":["530"],"status":"public","title":"Supporting materials \"STATISTICAL MECHANICS FOR METABOLIC NETWORKS IN STEADY-STATE GROWTH\"","related_material":{"record":[{"status":"public","relation":"research_paper","id":"161"}]},"author":[{"full_name":"De Martino, Daniele","last_name":"De Martino","first_name":"Daniele","orcid":"0000-0002-5214-4706","id":"3FF5848A-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Tkacik, Gasper","orcid":"0000-0002-6699-1455","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","last_name":"Tkacik","first_name":"Gasper"}],"file":[{"checksum":"97992e3e8cf8544ec985a48971708726","date_created":"2018-12-12T13:05:13Z","date_updated":"2020-07-14T12:47:08Z","file_id":"5641","relation":"main_file","creator":"system","file_size":14376,"content_type":"application/zip","access_level":"open_access","file_name":"IST-2018-111-v1+1_CODES.zip"}],"oa_version":"Published Version","date_updated":"2024-02-21T13:45:39Z","date_created":"2018-12-12T12:31:41Z"},{"file_date_updated":"2020-07-14T12:46:50Z","publist_id":"7274","ec_funded":1,"author":[{"full_name":"Kelemen, Réka K","orcid":"0000-0002-8489-9281","id":"48D3F8DE-F248-11E8-B48F-1D18A9856A87","last_name":"Kelemen","first_name":"Réka K"},{"full_name":"Vicoso, Beatriz","id":"49E1C5C6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4579-8306","first_name":"Beatriz","last_name":"Vicoso"}],"related_material":{"record":[{"id":"5571","status":"public","relation":"popular_science"},{"relation":"popular_science","status":"public","id":"5572"}]},"date_updated":"2024-02-21T13:48:27Z","date_created":"2018-12-11T11:47:04Z","volume":208,"year":"2018","publication_status":"published","publisher":"Genetics Society of America","department":[{"_id":"BeVi"}],"month":"01","doi":"10.1534/genetics.117.300513","language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"isi":["000419356300024"]},"oa":1,"isi":1,"quality_controlled":"1","project":[{"call_identifier":"H2020","name":"Prevalence and Influence of Sexual Antagonism on Genome Evolution","_id":"250BDE62-B435-11E9-9278-68D0E5697425","grant_number":"715257"}],"abstract":[{"text":"The t-haplotype, a mouse meiotic driver found on chromosome 17, has been a model for autosomal segregation distortion for close to a century, but several questions remain regarding its biology and evolutionary history. A recently published set of population genomics resources for wild mice includes several individuals heterozygous for the t-haplotype, which we use to characterize this selfish element at the genomic and transcriptomic level. Our results show that large sections of the t-haplotype have been replaced by standard homologous sequences, possibly due to occasional events of recombination, and that this complicates the inference of its history. As expected for a long genomic segment of very low recombination, the t-haplotype carries an excess of fixed nonsynonymous mutations compared to the standard chromosome. This excess is stronger for regions that have not undergone recent recombination, suggesting that occasional gene flow between the t and the standard chromosome may provide a mechanism to regenerate coding sequences that have accumulated deleterious mutations. Finally, we find that t-complex genes with altered expression largely overlap with deleted or amplified regions, and that carrying a t-haplotype alters the testis expression of genes outside of the t-complex, providing new leads into the pathways involved in the biology of this segregation distorter.","lang":"eng"}],"issue":"1","type":"journal_article","pubrep_id":"1058","file":[{"file_id":"5132","relation":"main_file","checksum":"2123845e7031a0cf043905be160f9e69","date_updated":"2020-07-14T12:46:50Z","date_created":"2018-12-12T10:15:14Z","access_level":"open_access","file_name":"IST-2018-1058-v1+1_365.full__1_.pdf","creator":"system","file_size":1311661,"content_type":"application/pdf"}],"oa_version":"Published Version","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"542","title":"Complex history and differentiation patterns of the t-haplotype, a mouse meiotic driver","ddc":["576"],"status":"public","intvolume":" 208","day":"01","article_processing_charge":"No","has_accepted_license":"1","scopus_import":"1","date_published":"2018-01-01T00:00:00Z","publication":"Genetics","citation":{"chicago":"Kelemen, Réka K, and Beatriz Vicoso. “Complex History and Differentiation Patterns of the T-Haplotype, a Mouse Meiotic Driver.” Genetics. Genetics Society of America, 2018. https://doi.org/10.1534/genetics.117.300513.","short":"R.K. Kelemen, B. Vicoso, Genetics 208 (2018) 365–375.","mla":"Kelemen, Réka K., and Beatriz Vicoso. “Complex History and Differentiation Patterns of the T-Haplotype, a Mouse Meiotic Driver.” Genetics, vol. 208, no. 1, Genetics Society of America, 2018, pp. 365–75, doi:10.1534/genetics.117.300513.","apa":"Kelemen, R. K., & Vicoso, B. (2018). Complex history and differentiation patterns of the t-haplotype, a mouse meiotic driver. Genetics. Genetics Society of America. https://doi.org/10.1534/genetics.117.300513","ieee":"R. K. Kelemen and B. Vicoso, “Complex history and differentiation patterns of the t-haplotype, a mouse meiotic driver,” Genetics, vol. 208, no. 1. Genetics Society of America, pp. 365–375, 2018.","ista":"Kelemen RK, Vicoso B. 2018. Complex history and differentiation patterns of the t-haplotype, a mouse meiotic driver. Genetics. 208(1), 365–375.","ama":"Kelemen RK, Vicoso B. Complex history and differentiation patterns of the t-haplotype, a mouse meiotic driver. Genetics. 2018;208(1):365-375. doi:10.1534/genetics.117.300513"},"article_type":"original","page":"365 - 375"},{"external_id":{"isi":["000461126500071"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"project":[{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","isi":1,"doi":"10.1038/s42003-018-0078-7","language":[{"iso":"eng"}],"publication_identifier":{"issn":["2399-3642"]},"month":"06","year":"2018","department":[{"_id":"KrCh"}],"publisher":"Springer Nature","publication_status":"published","related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"7196"},{"id":"5559","status":"public","relation":"popular_science"}]},"author":[{"full_name":"Pavlogiannis, Andreas","last_name":"Pavlogiannis","first_name":"Andreas","orcid":"0000-0002-8943-0722","id":"49704004-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Tkadlec, Josef","last_name":"Tkadlec","first_name":"Josef","orcid":"0000-0002-1097-9684","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"last_name":"Nowak","first_name":"Martin A.","full_name":"Nowak, Martin A."}],"volume":1,"date_updated":"2024-02-21T13:48:42Z","date_created":"2018-12-18T13:22:58Z","article_number":"71","ec_funded":1,"file_date_updated":"2020-07-14T12:47:10Z","citation":{"ieee":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. A. Nowak, “Construction of arbitrarily strong amplifiers of natural selection using evolutionary graph theory,” Communications Biology, vol. 1, no. 1. Springer Nature, 2018.","apa":"Pavlogiannis, A., Tkadlec, J., Chatterjee, K., & Nowak, M. A. (2018). Construction of arbitrarily strong amplifiers of natural selection using evolutionary graph theory. Communications Biology. Springer Nature. https://doi.org/10.1038/s42003-018-0078-7","ista":"Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak MA. 2018. Construction of arbitrarily strong amplifiers of natural selection using evolutionary graph theory. Communications Biology. 1(1), 71.","ama":"Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak MA. Construction of arbitrarily strong amplifiers of natural selection using evolutionary graph theory. Communications Biology. 2018;1(1). doi:10.1038/s42003-018-0078-7","chicago":"Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin A. Nowak. “Construction of Arbitrarily Strong Amplifiers of Natural Selection Using Evolutionary Graph Theory.” Communications Biology. Springer Nature, 2018. https://doi.org/10.1038/s42003-018-0078-7.","short":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M.A. Nowak, Communications Biology 1 (2018).","mla":"Pavlogiannis, Andreas, et al. “Construction of Arbitrarily Strong Amplifiers of Natural Selection Using Evolutionary Graph Theory.” Communications Biology, vol. 1, no. 1, 71, Springer Nature, 2018, doi:10.1038/s42003-018-0078-7."},"publication":"Communications Biology","date_published":"2018-06-14T00:00:00Z","scopus_import":"1","has_accepted_license":"1","article_processing_charge":"No","day":"14","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"5751","intvolume":" 1","ddc":["004","519","576"],"title":"Construction of arbitrarily strong amplifiers of natural selection using evolutionary graph theory","status":"public","pubrep_id":"1045","file":[{"access_level":"open_access","file_name":"2018_CommBiology_Pavlogiannis.pdf","creator":"dernst","file_size":1804194,"content_type":"application/pdf","file_id":"5752","relation":"main_file","checksum":"a9db825fa3b64a51ff3de035ec973b3e","date_created":"2018-12-18T13:37:04Z","date_updated":"2020-07-14T12:47:10Z"}],"oa_version":"Published Version","type":"journal_article","issue":"1","abstract":[{"lang":"eng","text":"Because of the intrinsic randomness of the evolutionary process, a mutant with a fitness advantage has some chance to be selected but no certainty. Any experiment that searches for advantageous mutants will lose many of them due to random drift. It is therefore of great interest to find population structures that improve the odds of advantageous mutants. Such structures are called amplifiers of natural selection: they increase the probability that advantageous mutants are selected. Arbitrarily strong amplifiers guarantee the selection of advantageous mutants, even for very small fitness advantage. Despite intensive research over the past decade, arbitrarily strong amplifiers have remained rare. Here we show how to construct a large variety of them. Our amplifiers are so simple that they could be useful in biotechnology, when optimizing biological molecules, or as a diagnostic tool, when searching for faster dividing cells or viruses. They could also occur in natural population structures."}]},{"date_updated":"2024-02-21T13:59:18Z","date_created":"2018-12-19T14:22:35Z","oa_version":"Published Version","file":[{"date_updated":"2020-07-14T12:47:11Z","date_created":"2018-12-19T14:19:52Z","checksum":"aed7ee9ca3f4dc07d8a66945f68e13cd","file_id":"5758","relation":"main_file","creator":"cfraisse","content_type":"application/zip","file_size":369837892,"file_name":"FileS1.zip","access_level":"open_access"},{"file_size":84856909,"content_type":"application/zip","creator":"cfraisse","access_level":"open_access","file_name":"FileS2.zip","checksum":"3592e467b4d8206650860b612d6e12f3","date_created":"2018-12-19T14:19:49Z","date_updated":"2020-07-14T12:47:11Z","relation":"main_file","file_id":"5759"},{"checksum":"c37ac5d5437c457338afc128c1240655","date_updated":"2020-07-14T12:47:11Z","date_created":"2018-12-19T14:19:49Z","file_id":"5760","relation":"main_file","creator":"cfraisse","content_type":"text/plain","file_size":881133,"access_level":"open_access","file_name":"FileS3.txt"},{"date_updated":"2020-07-14T12:47:11Z","date_created":"2018-12-19T14:19:49Z","checksum":"943dfd14da61817441e33e3e3cb8cdb9","relation":"main_file","file_id":"5761","content_type":"text/plain","file_size":883742,"creator":"cfraisse","file_name":"FileS4.txt","access_level":"open_access"},{"checksum":"1c669b6c4690ec1bbca3e2da9f566d17","date_updated":"2020-07-14T12:47:11Z","date_created":"2018-12-19T14:19:49Z","file_id":"5762","relation":"main_file","creator":"cfraisse","content_type":"text/plain","file_size":2495437,"access_level":"open_access","file_name":"FileS5.txt"},{"file_id":"5763","relation":"main_file","checksum":"f40f661b987ca6fb6b47f650cbbb04e6","date_updated":"2020-07-14T12:47:11Z","date_created":"2018-12-19T14:19:50Z","access_level":"open_access","file_name":"FileS6.txt","creator":"cfraisse","file_size":15913457,"content_type":"text/plain"},{"access_level":"open_access","file_name":"FileS7.txt","file_size":2584120,"content_type":"text/plain","creator":"cfraisse","relation":"main_file","file_id":"5764","checksum":"25f41e5b8a075669c6c88d4c6713bf6f","date_created":"2018-12-19T14:19:50Z","date_updated":"2020-07-14T12:47:11Z"},{"file_id":"5765","relation":"main_file","checksum":"f6c0bd3e63e14ddf5445bd69b43a9152","date_updated":"2020-07-14T12:47:11Z","date_created":"2018-12-19T14:19:50Z","access_level":"open_access","file_name":"FileS8.txt","creator":"cfraisse","content_type":"text/plain","file_size":2446059},{"content_type":"text/plain","file_size":100737,"creator":"cfraisse","file_name":"FileS9.txt","access_level":"open_access","date_updated":"2020-07-14T12:47:11Z","date_created":"2018-12-19T14:19:50Z","checksum":"0fe7a58a030b11bf3b9c8ff7a7addcae","relation":"main_file","file_id":"5766"}],"author":[{"full_name":"Fraisse, Christelle","first_name":"Christelle","last_name":"Fraisse","id":"32DF5794-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8441-5075"}],"related_material":{"record":[{"relation":"research_paper","status":"public","id":"6089"}]},"contributor":[{"first_name":"Christelle","last_name":"Fraisse","id":"32DF5794-F248-11E8-B48F-1D18A9856A87"},{"id":"33AB266C-F248-11E8-B48F-1D18A9856A87","first_name":"Gemma","last_name":"Puixeu Sala"},{"orcid":"0000-0002-4579-8306","id":"49E1C5C6-F248-11E8-B48F-1D18A9856A87","last_name":"Vicoso","first_name":"Beatriz"}],"title":"Supplementary Files for \"Pleiotropy modulates the efficacy of selection in Drosophila melanogaster\"","status":"public","ddc":["576"],"department":[{"_id":"BeVi"},{"_id":"NiBa"}],"publisher":"Institute of Science and Technology Austria","_id":"5757","year":"2018","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2020-07-14T12:47:11Z","abstract":[{"text":"File S1. Variant Calling Format file of the ingroup: 197 haploid sequences of D. melanogaster from Zambia (Africa) aligned to the D. melanogaster 5.57 reference genome.\r\n\r\nFile S2. Variant Calling Format file of the outgroup: 1 haploid sequence of D. simulans aligned to the D. melanogaster 5.57 reference genome.\r\n\r\nFile S3. Annotations of each transcript in coding regions with SNPeff: Ps (# of synonymous polymorphic sites); Pn (# of non-synonymous polymorphic sites); Ds (# of synonymous divergent sites); Dn (# of non-synonymous divergent sites); DoS; ⍺ MK . All variants were included.\r\n\r\nFile S4. Annotations of each transcript in non-coding regions with SNPeff: Ps (# of synonymous polymorphic sites); Pu (# of UTR polymorphic sites); Ds (# of synonymous divergent sites); Du (# of UTR divergent sites); DoS; ⍺ MK . All variants were included.\r\n\r\nFile S5. Annotations of each transcript in coding regions with SNPGenie: Ps (# of synonymous polymorphic sites); πs (synonymous diversity); Ss_p (total # of synonymous sites in the polymorphism data); Pn (# of non-synonymous polymorphic sites); πn (non-synonymous diversity); Sn_p (total # of non-synonymous sites in the polymorphism data); Ds (# of synonymous divergent sites); ks (synonymous evolutionary rate); Ss_d (total # of synonymous sites in the divergence data); Dn (# of non-synonymous divergent sites); kn (non-synonymous evolutionary rate); Sn_d (total # of non-\r\nsynonymous sites in the divergence data); DoS; ⍺ MK . All variants were included.\r\n\r\nFile S6. Gene expression values (RPKM summed over all transcripts) for each sample. Values were quantile-normalized across all samples.\r\n\r\nFile S7. Final dataset with all covariates, ⍺ MK , ωA MK and DoS for coding sites, excluding variants below 5% frequency.\r\n\r\nFile S8. Final dataset with all covariates, ⍺ MK , ωA MK and DoS for non-coding sites, excluding variants below 5%\r\nfrequency.\r\n\r\nFile S9. Final dataset with all covariates, ⍺ EWK , ωA EWK and deleterious SFS for coding sites obtained with the Eyre-Walker and Keightley method on binned data and using all variants.","lang":"eng"}],"ec_funded":1,"type":"research_data","doi":"10.15479/at:ista:/5757","date_published":"2018-12-19T00:00:00Z","project":[{"call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734"}],"oa":1,"citation":{"ieee":"C. Fraisse, “Supplementary Files for ‘Pleiotropy modulates the efficacy of selection in Drosophila melanogaster.’” Institute of Science and Technology Austria, 2018.","apa":"Fraisse, C. (2018). Supplementary Files for “Pleiotropy modulates the efficacy of selection in Drosophila melanogaster.” Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:/5757","ista":"Fraisse C. 2018. Supplementary Files for ‘Pleiotropy modulates the efficacy of selection in Drosophila melanogaster’, Institute of Science and Technology Austria, 10.15479/at:ista:/5757.","ama":"Fraisse C. Supplementary Files for “Pleiotropy modulates the efficacy of selection in Drosophila melanogaster.” 2018. doi:10.15479/at:ista:/5757","chicago":"Fraisse, Christelle. “Supplementary Files for ‘Pleiotropy Modulates the Efficacy of Selection in Drosophila Melanogaster.’” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/at:ista:/5757.","short":"C. Fraisse, (2018).","mla":"Fraisse, Christelle. Supplementary Files for “Pleiotropy Modulates the Efficacy of Selection in Drosophila Melanogaster.” Institute of Science and Technology Austria, 2018, doi:10.15479/at:ista:/5757."},"day":"19","month":"12","has_accepted_license":"1","article_processing_charge":"No","keyword":["(mal)adaptation","pleiotropy","selective constraint","evo-devo","gene expression","Drosophila melanogaster"]},{"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"149","ddc":["515","519"],"title":"Dyson equation and eigenvalue statistics of random matrices","status":"public","pubrep_id":"1040","oa_version":"Published Version","file":[{"file_name":"2018_thesis_Alt.pdf","access_level":"open_access","content_type":"application/pdf","file_size":5801709,"creator":"dernst","relation":"main_file","file_id":"6241","date_created":"2019-04-08T13:55:20Z","date_updated":"2020-07-14T12:44:57Z","checksum":"d4dad55a7513f345706aaaba90cb1bb8"},{"creator":"dernst","file_size":3802059,"content_type":"application/zip","access_level":"closed","file_name":"2018_thesis_Alt_source.zip","checksum":"d73fcf46300dce74c403f2b491148ab4","date_updated":"2020-07-14T12:44:57Z","date_created":"2019-04-08T13:55:20Z","file_id":"6242","relation":"source_file"}],"type":"dissertation","alternative_title":["ISTA Thesis"],"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"}],"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.","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.","ieee":"J. Alt, “Dyson equation and eigenvalue statistics of random matrices,” Institute of Science and Technology Austria, 2018.","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","ista":"Alt J. 2018. Dyson equation and eigenvalue statistics of random matrices. Institute of Science and Technology Austria.","ama":"Alt J. Dyson equation and eigenvalue statistics of random matrices. 2018. doi:10.15479/AT:ISTA:TH_1040"},"page":"456","date_published":"2018-07-12T00:00:00Z","day":"12","has_accepted_license":"1","article_processing_charge":"No","year":"2018","publication_status":"published","department":[{"_id":"LaEr"}],"publisher":"Institute of Science and Technology Austria","author":[{"full_name":"Alt, Johannes","last_name":"Alt","first_name":"Johannes","id":"36D3D8B6-F248-11E8-B48F-1D18A9856A87"}],"related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"1677"},{"relation":"part_of_dissertation","status":"public","id":"550"},{"relation":"part_of_dissertation","status":"public","id":"6183"},{"relation":"part_of_dissertation","status":"public","id":"566"},{"status":"public","relation":"part_of_dissertation","id":"1010"},{"relation":"part_of_dissertation","status":"public","id":"6240"},{"id":"6184","relation":"part_of_dissertation","status":"public"}]},"date_updated":"2024-02-22T14:34:33Z","date_created":"2018-12-11T11:44:53Z","file_date_updated":"2020-07-14T12:44:57Z","publist_id":"7772","ec_funded":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"project":[{"name":"Random matrices, universality and disordered quantum systems","call_identifier":"FP7","grant_number":"338804","_id":"258DCDE6-B435-11E9-9278-68D0E5697425"}],"doi":"10.15479/AT:ISTA:TH_1040","degree_awarded":"PhD","supervisor":[{"full_name":"Erdös, László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5366-9603","first_name":"László","last_name":"Erdös"}],"language":[{"iso":"eng"}],"month":"07","publication_identifier":{"issn":["2663-337X"]}},{"status":"public","title":"Effect of a magnetic field on molecule–solvent angular momentum transfer","intvolume":" 148","_id":"415","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","type":"journal_article","abstract":[{"text":"Recently it was shown that a molecule rotating in a quantum solvent can be described in terms of the “angulon” quasiparticle [M. Lemeshko, Phys. Rev. Lett. 118, 095301 (2017)]. Here we extend the angulon theory to the case of molecules possessing an additional spin-1/2 degree of freedom and study the behavior of the system in the presence of a static magnetic field. We show that exchange of angular momentum between the molecule and the solvent can be altered by the field, even though the solvent itself is non-magnetic. In particular, we demonstrate a possibility to control resonant emission of phonons with a given angular momentum using a magnetic field.","lang":"eng"}],"issue":"10","article_type":"original","publication":"The Journal of Chemical Physics","citation":{"chicago":"Rzadkowski, Wojciech, and Mikhail Lemeshko. “Effect of a Magnetic Field on Molecule–Solvent Angular Momentum Transfer.” The Journal of Chemical Physics. AIP Publishing, 2018. https://doi.org/10.1063/1.5017591.","mla":"Rzadkowski, Wojciech, and Mikhail Lemeshko. “Effect of a Magnetic Field on Molecule–Solvent Angular Momentum Transfer.” The Journal of Chemical Physics, vol. 148, no. 10, 104307, AIP Publishing, 2018, doi:10.1063/1.5017591.","short":"W. Rzadkowski, M. Lemeshko, The Journal of Chemical Physics 148 (2018).","ista":"Rzadkowski W, Lemeshko M. 2018. Effect of a magnetic field on molecule–solvent angular momentum transfer. The Journal of Chemical Physics. 148(10), 104307.","apa":"Rzadkowski, W., & Lemeshko, M. (2018). Effect of a magnetic field on molecule–solvent angular momentum transfer. The Journal of Chemical Physics. AIP Publishing. https://doi.org/10.1063/1.5017591","ieee":"W. Rzadkowski and M. Lemeshko, “Effect of a magnetic field on molecule–solvent angular momentum transfer,” The Journal of Chemical Physics, vol. 148, no. 10. AIP Publishing, 2018.","ama":"Rzadkowski W, Lemeshko M. Effect of a magnetic field on molecule–solvent angular momentum transfer. The Journal of Chemical Physics. 2018;148(10). doi:10.1063/1.5017591"},"date_published":"2018-03-14T00:00:00Z","scopus_import":"1","day":"14","article_processing_charge":"No","publication_status":"published","department":[{"_id":"MiLe"}],"publisher":"AIP Publishing","acknowledgement":"We acknowledge insightful discussions with Giacomo Bighin, Igor Cherepanov, Johan Mentink, and Enderalp Yakaboylu. This work was supported by the Austrian Science Fund (FWF), Project No. P29902-N27. W.R. was supported by the Polish Ministry of Science and Higher Education Grant No. MNISW/2016/DIR/285/NN and by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385.\r\n","year":"2018","date_created":"2018-12-11T11:46:21Z","date_updated":"2024-02-28T13:01:59Z","volume":148,"author":[{"first_name":"Wojciech","last_name":"Rzadkowski","id":"48C55298-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1106-4419","full_name":"Rzadkowski, Wojciech"},{"full_name":"Lemeshko, Mikhail","first_name":"Mikhail","last_name":"Lemeshko","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6990-7802"}],"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"10759"}]},"article_number":"104307","publist_id":"7408","ec_funded":1,"quality_controlled":"1","isi":1,"project":[{"grant_number":"P29902","_id":"26031614-B435-11E9-9278-68D0E5697425","name":"Quantum rotations in the presence of a many-body environment","call_identifier":"FWF"},{"grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"International IST Doctoral Program"}],"external_id":{"isi":["000427517200065"],"arxiv":["1711.09904"]},"main_file_link":[{"url":"https://arxiv.org/abs/1711.09904","open_access":"1"}],"oa":1,"language":[{"iso":"eng"}],"doi":"10.1063/1.5017591","month":"03"},{"date_published":"2018-07-30T00:00:00Z","publication":"ACM Transactions on Graphics","citation":{"mla":"Jeschke, Stefan, et al. “Water Surface Wavelets.” ACM Transactions on Graphics, vol. 37, no. 4, 94, ACM, 2018, doi:10.1145/3197517.3201336.","short":"S. Jeschke, T. Skrivan, M. Mueller Fischer, N. Chentanez, M. Macklin, C. Wojtan, ACM Transactions on Graphics 37 (2018).","chicago":"Jeschke, Stefan, Tomas Skrivan, Matthias Mueller Fischer, Nuttapong Chentanez, Miles Macklin, and Chris Wojtan. “Water Surface Wavelets.” ACM Transactions on Graphics. ACM, 2018. https://doi.org/10.1145/3197517.3201336.","ama":"Jeschke S, Skrivan T, Mueller Fischer M, Chentanez N, Macklin M, Wojtan C. Water surface wavelets. ACM Transactions on Graphics. 2018;37(4). doi:10.1145/3197517.3201336","ista":"Jeschke S, Skrivan T, Mueller Fischer M, Chentanez N, Macklin M, Wojtan C. 2018. Water surface wavelets. ACM Transactions on Graphics. 37(4), 94.","ieee":"S. Jeschke, T. Skrivan, M. Mueller Fischer, N. Chentanez, M. Macklin, and C. Wojtan, “Water surface wavelets,” ACM Transactions on Graphics, vol. 37, no. 4. ACM, 2018.","apa":"Jeschke, S., Skrivan, T., Mueller Fischer, M., Chentanez, N., Macklin, M., & Wojtan, C. (2018). Water surface wavelets. ACM Transactions on Graphics. ACM. https://doi.org/10.1145/3197517.3201336"},"day":"30","article_processing_charge":"No","has_accepted_license":"1","scopus_import":"1","oa_version":"Published Version","file":[{"file_id":"5744","relation":"main_file","checksum":"db75ebabe2ec432bf41389e614d6ef62","date_created":"2018-12-18T09:59:23Z","date_updated":"2020-07-14T12:44:45Z","access_level":"open_access","file_name":"2018_ACM_Jeschke.pdf","creator":"dernst","content_type":"application/pdf","file_size":22185016}],"user_id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","_id":"134","status":"public","title":"Water surface wavelets","ddc":["000"],"intvolume":" 37","abstract":[{"text":"The current state of the art in real-time two-dimensional water wave simulation requires developers to choose between efficient Fourier-based methods, which lack interactions with moving obstacles, and finite-difference or finite element methods, which handle environmental interactions but are significantly more expensive. This paper attempts to bridge this long-standing gap between complexity and performance, by proposing a new wave simulation method that can faithfully simulate wave interactions with moving obstacles in real time while simultaneously preserving minute details and accommodating very large simulation domains.\r\n\r\nPrevious methods for simulating 2D water waves directly compute the change in height of the water surface, a strategy which imposes limitations based on the CFL condition (fast moving waves require small time steps) and Nyquist's limit (small wave details require closely-spaced simulation variables). This paper proposes a novel wavelet transformation that discretizes the liquid motion in terms of amplitude-like functions that vary over space, frequency, and direction, effectively generalizing Fourier-based methods to handle local interactions. Because these new variables change much more slowly over space than the original water height function, our change of variables drastically reduces the limitations of the CFL condition and Nyquist limit, allowing us to simulate highly detailed water waves at very large visual resolutions. Our discretization is amenable to fast summation and easy to parallelize. We also present basic extensions like pre-computed wave paths and two-way solid fluid coupling. Finally, we argue that our discretization provides a convenient set of variables for artistic manipulation, which we illustrate with a novel wave-painting interface.","lang":"eng"}],"issue":"4","type":"journal_article","alternative_title":["SIGGRAPH"],"doi":"10.1145/3197517.3201336","acknowledged_ssus":[{"_id":"ScienComp"}],"language":[{"iso":"eng"}],"oa":1,"tmp":{"name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","image":"/images/cc_by_nc_sa.png","short":"CC BY-NC-SA (4.0)"},"external_id":{"isi":["000448185000055"]},"quality_controlled":"1","isi":1,"project":[{"_id":"2533E772-B435-11E9-9278-68D0E5697425","grant_number":"638176","name":"Efficient Simulation of Natural Phenomena at Extremely Large Scales","call_identifier":"H2020"},{"grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"International IST Doctoral Program"}],"month":"07","author":[{"full_name":"Jeschke, Stefan","last_name":"Jeschke","first_name":"Stefan","id":"44D6411A-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Skrivan","first_name":"Tomas","id":"486A5A46-F248-11E8-B48F-1D18A9856A87","full_name":"Skrivan, Tomas"},{"full_name":"Mueller Fischer, Matthias","first_name":"Matthias","last_name":"Mueller Fischer"},{"full_name":"Chentanez, Nuttapong","last_name":"Chentanez","first_name":"Nuttapong"},{"full_name":"Macklin, Miles","last_name":"Macklin","first_name":"Miles"},{"first_name":"Christopher J","last_name":"Wojtan","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6646-5546","full_name":"Wojtan, Christopher J"}],"related_material":{"link":[{"description":"News on IST Homepage","relation":"press_release","url":"https://ist.ac.at/en/news/new-water-simulation-captures-small-details-even-in-large-scenes/"}]},"date_created":"2018-12-11T11:44:48Z","date_updated":"2024-02-28T13:58:51Z","volume":37,"year":"2018","publication_status":"published","department":[{"_id":"ChWo"}],"publisher":"ACM","file_date_updated":"2020-07-14T12:44:45Z","publist_id":"7789","ec_funded":1,"article_number":"94"},{"related_material":{"link":[{"description":"News on IST Homepage","relation":"press_release","url":"https://ist.ac.at/en/news/description-of-rotating-molecules-made-easy/"}]},"author":[{"orcid":"0000-0001-8823-9777","id":"4CA96FD4-F248-11E8-B48F-1D18A9856A87","last_name":"Bighin","first_name":"Giacomo","full_name":"Bighin, Giacomo"},{"full_name":"Tscherbul, Timur","last_name":"Tscherbul","first_name":"Timur"},{"full_name":"Lemeshko, Mikhail","orcid":"0000-0002-6990-7802","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","last_name":"Lemeshko","first_name":"Mikhail"}],"volume":121,"date_created":"2019-04-17T10:53:38Z","date_updated":"2024-02-28T13:15:09Z","year":"2018","department":[{"_id":"MiLe"}],"publisher":"American Physical Society","publication_status":"published","article_number":"165301","doi":"10.1103/physrevlett.121.165301","language":[{"iso":"eng"}],"oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1803.07990"}],"external_id":{"arxiv":["1803.07990"],"isi":["000447468400008"]},"project":[{"grant_number":"P29902","_id":"26031614-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Quantum rotations in the presence of a many-body environment"}],"quality_controlled":"1","isi":1,"month":"10","oa_version":"Preprint","_id":"6339","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 121","status":"public","title":"Diagrammatic Monte Carlo approach to angular momentum in quantum many-particle systems","issue":"16","abstract":[{"text":"We introduce a diagrammatic Monte Carlo approach to angular momentum properties of quantum many-particle systems possessing a macroscopic number of degrees of freedom. The treatment is based on a diagrammatic expansion that merges the usual Feynman diagrams with the angular momentum diagrams known from atomic and nuclear structure theory, thereby incorporating the non-Abelian algebra inherent to quantum rotations. Our approach is applicable at arbitrary coupling, is free of systematic errors and of finite-size effects, and naturally provides access to the impurity Green function. We exemplify the technique by obtaining an all-coupling solution of the angulon model; however, the method is quite general and can be applied to a broad variety of systems in which particles exchange quantum angular momentum with their many-body environment.","lang":"eng"}],"type":"journal_article","date_published":"2018-10-16T00:00:00Z","citation":{"short":"G. Bighin, T. Tscherbul, M. Lemeshko, Physical Review Letters 121 (2018).","mla":"Bighin, Giacomo, et al. “Diagrammatic Monte Carlo Approach to Angular Momentum in Quantum Many-Particle Systems.” Physical Review Letters, vol. 121, no. 16, 165301, American Physical Society, 2018, doi:10.1103/physrevlett.121.165301.","chicago":"Bighin, Giacomo, Timur Tscherbul, and Mikhail Lemeshko. “Diagrammatic Monte Carlo Approach to Angular Momentum in Quantum Many-Particle Systems.” Physical Review Letters. American Physical Society, 2018. https://doi.org/10.1103/physrevlett.121.165301.","ama":"Bighin G, Tscherbul T, Lemeshko M. Diagrammatic Monte Carlo approach to angular momentum in quantum many-particle systems. Physical Review Letters. 2018;121(16). doi:10.1103/physrevlett.121.165301","apa":"Bighin, G., Tscherbul, T., & Lemeshko, M. (2018). Diagrammatic Monte Carlo approach to angular momentum in quantum many-particle systems. Physical Review Letters. American Physical Society. https://doi.org/10.1103/physrevlett.121.165301","ieee":"G. Bighin, T. Tscherbul, and M. Lemeshko, “Diagrammatic Monte Carlo approach to angular momentum in quantum many-particle systems,” Physical Review Letters, vol. 121, no. 16. American Physical Society, 2018.","ista":"Bighin G, Tscherbul T, Lemeshko M. 2018. Diagrammatic Monte Carlo approach to angular momentum in quantum many-particle systems. Physical Review Letters. 121(16), 165301."},"publication":"Physical Review Letters","article_processing_charge":"No","day":"16","scopus_import":"1"},{"type":"journal_article","issue":"16","abstract":[{"lang":"eng","text":"We introduce a Diagrammatic Monte Carlo (DiagMC) approach to complex molecular impurities with rotational degrees of freedom interacting with a many-particle environment. The treatment is based on the diagrammatic expansion that merges the usual Feynman diagrams with the angular momentum diagrams known from atomic and nuclear structure theory, thereby incorporating the non-Abelian algebra inherent to quantum rotations. Our approach works at arbitrary coupling, is free of systematic errors and of finite size effects, and naturally provides access to the impurity Green function. We exemplify the technique by obtaining an all-coupling solution of the angulon model, however, the method is quite general and can be applied to a broad variety of quantum impurities possessing angular momentum degrees of freedom. "}],"_id":"417","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 121","status":"public","title":"Diagrammatic Monte Carlo approach to rotating molecular impurities","oa_version":"Preprint","scopus_import":"1","article_processing_charge":"No","day":"16","citation":{"apa":"Bighin, G., Tscherbul, T., & Lemeshko, M. (2018). Diagrammatic Monte Carlo approach to rotating molecular impurities. Physical Review Letters. American Physical Society. https://doi.org/10.1103/PhysRevLett.121.165301","ieee":"G. Bighin, T. Tscherbul, and M. Lemeshko, “Diagrammatic Monte Carlo approach to rotating molecular impurities,” Physical Review Letters, vol. 121, no. 16. American Physical Society, 2018.","ista":"Bighin G, Tscherbul T, Lemeshko M. 2018. Diagrammatic Monte Carlo approach to rotating molecular impurities. Physical Review Letters. 121(16), 165301.","ama":"Bighin G, Tscherbul T, Lemeshko M. Diagrammatic Monte Carlo approach to rotating molecular impurities. Physical Review Letters. 2018;121(16). doi:10.1103/PhysRevLett.121.165301","chicago":"Bighin, Giacomo, Timur Tscherbul, and Mikhail Lemeshko. “Diagrammatic Monte Carlo Approach to Rotating Molecular Impurities.” Physical Review Letters. American Physical Society, 2018. https://doi.org/10.1103/PhysRevLett.121.165301.","short":"G. Bighin, T. Tscherbul, M. Lemeshko, Physical Review Letters 121 (2018).","mla":"Bighin, Giacomo, et al. “Diagrammatic Monte Carlo Approach to Rotating Molecular Impurities.” Physical Review Letters, vol. 121, no. 16, 165301, American Physical Society, 2018, doi:10.1103/PhysRevLett.121.165301."},"publication":"Physical Review Letters","date_published":"2018-10-16T00:00:00Z","article_number":"165301","publist_id":"8025","year":"2018","department":[{"_id":"MiLe"}],"publisher":"American Physical Society","publication_status":"published","author":[{"last_name":"Bighin","first_name":"Giacomo","orcid":"0000-0001-8823-9777","id":"4CA96FD4-F248-11E8-B48F-1D18A9856A87","full_name":"Bighin, Giacomo"},{"full_name":"Tscherbul, Timur","first_name":"Timur","last_name":"Tscherbul"},{"full_name":"Lemeshko, Mikhail","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6990-7802","first_name":"Mikhail","last_name":"Lemeshko"}],"volume":121,"date_updated":"2024-02-28T13:14:53Z","date_created":"2018-12-11T11:46:22Z","month":"10","oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1803.07990","open_access":"1"}],"external_id":{"arxiv":["1803.07990"]},"project":[{"name":"Quantum rotations in the presence of a many-body environment","call_identifier":"FWF","_id":"26031614-B435-11E9-9278-68D0E5697425","grant_number":"P29902"}],"quality_controlled":"1","doi":"10.1103/PhysRevLett.121.165301","language":[{"iso":"eng"}]},{"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"pmid":["29511054"],"isi":["000429441400018"]},"oa":1,"project":[{"_id":"25716A02-B435-11E9-9278-68D0E5697425","grant_number":"282300","call_identifier":"FP7","name":"Polarity and subcellular dynamics in plants"}],"isi":1,"quality_controlled":"1","doi":"10.1105/tpc.17.00785","language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1532-298X"],"issn":["1040-4651"]},"month":"04","pmid":1,"year":"2018","acknowledgement":"We thank James Matthew Watson, Monika Borowska, and Peggy Stolt-Bergner at ProTech Facility of the Vienna Biocenter Core Facilities for the CRISPR/CAS9 construct; Anna Müller for assistance with molecular cloning; Sebastian Bednarek, Liwen Jiang, and Daniël Van Damme for sharing published material; Matyáš Fendrych, Daniël Van Damme, and Lindy Abas for valuable discussions; and Martine De Cock for help with correcting the manuscript. This work was supported by the European Research Council under the European Union Seventh Framework Programme (FP7/2007-2013)/ERC Grant 282300 and by the Ministry of Education of the Czech Republic/MŠMT project NPUI-LO1417.","department":[{"_id":"JiFr"}],"publisher":"American Society of Plant Biologists","publication_status":"published","related_material":{"record":[{"id":"6269","status":"public","relation":"dissertation_contains"}]},"author":[{"full_name":"Adamowski, Maciek","id":"45F536D2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6463-5257","first_name":"Maciek","last_name":"Adamowski"},{"first_name":"Madhumitha","last_name":"Narasimhan","id":"44BF24D0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8600-0671","full_name":"Narasimhan, Madhumitha"},{"id":"4AE5C486-F248-11E8-B48F-1D18A9856A87","last_name":"Kania","first_name":"Urszula","full_name":"Kania, Urszula"},{"last_name":"Glanc","first_name":"Matous","orcid":"0000-0003-0619-7783","id":"1AE1EA24-02D0-11E9-9BAA-DAF4881429F2","full_name":"Glanc, Matous"},{"last_name":"De Jaeger","first_name":"Geert","full_name":"De Jaeger, Geert"},{"full_name":"Friml, Jirí","orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87","last_name":"Friml","first_name":"Jirí"}],"volume":30,"date_created":"2018-12-11T11:46:20Z","date_updated":"2024-03-28T23:30:06Z","ec_funded":1,"publist_id":"7417","file_date_updated":"2022-05-23T09:12:38Z","citation":{"mla":"Adamowski, Maciek, et al. “A Functional Study of AUXILIN LIKE1 and 2 Two Putative Clathrin Uncoating Factors in Arabidopsis.” The Plant Cell, vol. 30, no. 3, American Society of Plant Biologists, 2018, pp. 700–16, doi:10.1105/tpc.17.00785.","short":"M. Adamowski, M. Narasimhan, U. Kania, M. Glanc, G. De Jaeger, J. Friml, The Plant Cell 30 (2018) 700–716.","chicago":"Adamowski, Maciek, Madhumitha Narasimhan, Urszula Kania, Matous Glanc, Geert De Jaeger, and Jiří Friml. “A Functional Study of AUXILIN LIKE1 and 2 Two Putative Clathrin Uncoating Factors in Arabidopsis.” The Plant Cell. American Society of Plant Biologists, 2018. https://doi.org/10.1105/tpc.17.00785.","ama":"Adamowski M, Narasimhan M, Kania U, Glanc M, De Jaeger G, Friml J. A functional study of AUXILIN LIKE1 and 2 two putative clathrin uncoating factors in Arabidopsis. The Plant Cell. 2018;30(3):700-716. doi:10.1105/tpc.17.00785","ista":"Adamowski M, Narasimhan M, Kania U, Glanc M, De Jaeger G, Friml J. 2018. A functional study of AUXILIN LIKE1 and 2 two putative clathrin uncoating factors in Arabidopsis. The Plant Cell. 30(3), 700–716.","ieee":"M. Adamowski, M. Narasimhan, U. Kania, M. Glanc, G. De Jaeger, and J. Friml, “A functional study of AUXILIN LIKE1 and 2 two putative clathrin uncoating factors in Arabidopsis,” The Plant Cell, vol. 30, no. 3. American Society of Plant Biologists, pp. 700–716, 2018.","apa":"Adamowski, M., Narasimhan, M., Kania, U., Glanc, M., De Jaeger, G., & Friml, J. (2018). A functional study of AUXILIN LIKE1 and 2 two putative clathrin uncoating factors in Arabidopsis. The Plant Cell. American Society of Plant Biologists. https://doi.org/10.1105/tpc.17.00785"},"publication":"The Plant Cell","page":"700 - 716","article_type":"original","date_published":"2018-04-09T00:00:00Z","scopus_import":"1","article_processing_charge":"No","has_accepted_license":"1","day":"09","_id":"412","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","intvolume":" 30","status":"public","title":"A functional study of AUXILIN LIKE1 and 2 two putative clathrin uncoating factors in Arabidopsis","ddc":["580"],"oa_version":"Published Version","file":[{"date_created":"2022-05-23T09:12:38Z","date_updated":"2022-05-23T09:12:38Z","success":1,"checksum":"4e165e653b67d3f0684697f21aace5a1","file_id":"11406","relation":"main_file","creator":"dernst","file_size":4407538,"content_type":"application/pdf","file_name":"2018_PlantCell_Adamowski.pdf","access_level":"open_access"}],"type":"journal_article","issue":"3","abstract":[{"text":"Clathrin-mediated endocytosis (CME) is a cellular trafficking process in which cargoes and lipids are internalized from the plasma membrane into vesicles coated with clathrin and adaptor proteins. CME is essential for many developmental and physiological processes in plants, but its underlying mechanism is not well characterised compared to that in yeast and animal systems. Here, we searched for new factors involved in CME in Arabidopsis thaliana by performing Tandem Affinity Purification of proteins that interact with clathrin light chain, a principal component of the clathrin coat. Among the confirmed interactors, we found two putative homologues of the clathrin-coat uncoating factor auxilin previously described in non-plant systems. Overexpression of AUXILIN-LIKE1 and AUXILIN-LIKE2 in A. thaliana caused an arrest of seedling growth and development. This was concomitant with inhibited endocytosis due to blocking of clathrin recruitment after the initial step of adaptor protein binding to the plasma membrane. By contrast, auxilin-like(1/2) loss-of-function lines did not present endocytosis-related developmental or cellular phenotypes under normal growth conditions. This work contributes to the on-going characterization of the endocytotic machinery in plants and provides a robust tool for conditionally and specifically interfering with CME in A. thaliana.","lang":"eng"}]},{"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"6849"}]},"author":[{"last_name":"Rangel Guerrero","first_name":"Dámaris K","orcid":"0000-0002-8602-4374","id":"4871BCE6-F248-11E8-B48F-1D18A9856A87","full_name":"Rangel Guerrero, Dámaris K"},{"first_name":"James G.","last_name":"Donnett","full_name":"Donnett, James G."},{"full_name":"Csicsvari, Jozsef L","first_name":"Jozsef L","last_name":"Csicsvari","id":"3FA14672-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5193-4036"},{"orcid":"0000-0001-6251-1007","id":"2AB5821E-F248-11E8-B48F-1D18A9856A87","last_name":"Kovács","first_name":"Krisztián","full_name":"Kovács, Krisztián"}],"volume":5,"date_created":"2019-02-03T22:59:16Z","date_updated":"2024-03-28T23:30:10Z","year":"2018","publisher":"Society of Neuroscience","department":[{"_id":"JoCs"}],"publication_status":"published","ec_funded":1,"file_date_updated":"2020-07-14T12:47:13Z","article_number":"e0087","doi":"10.1523/ENEURO.0087-18.2018","language":[{"iso":"eng"}],"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"isi":["000443994700007"]},"project":[{"name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"Interneuron plasticity during spatial learning","_id":"257D4372-B435-11E9-9278-68D0E5697425","grant_number":"I2072-B27"}],"isi":1,"quality_controlled":"1","month":"07","file":[{"creator":"dernst","file_size":3746884,"content_type":"application/pdf","access_level":"open_access","file_name":"2018_ENeuro_Guerrero.pdf","checksum":"f4915d45fc7ad4648b7b7a13fdecca01","date_created":"2019-02-05T12:48:36Z","date_updated":"2020-07-14T12:47:13Z","file_id":"5921","relation":"main_file"}],"oa_version":"Published Version","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"5914","intvolume":" 5","status":"public","ddc":["570"],"title":"Tetrode recording from the hippocampus of behaving mice coupled with four-point-irradiation closed-loop optogenetics: A technique to study the contribution of Hippocampal SWR events to learning","issue":"4","abstract":[{"text":"With the advent of optogenetics, it became possible to change the activity of a targeted population of neurons in a temporally controlled manner. To combine the advantages of 60-channel in vivo tetrode recording and laser-based optogenetics, we have developed a closed-loop recording system that allows for the actual electrophysiological signal to be used as a trigger for the laser light mediating the optogenetic intervention. We have optimized the weight, size, and shape of the corresponding implant to make it compatible with the size, force, and movements of a behaving mouse, and we have shown that the system can efficiently block sharp wave ripple (SWR) events using those events themselves as a trigger. To demonstrate the full potential of the optogenetic recording system we present a pilot study addressing the contribution of SWR events to learning in a complex behavioral task.","lang":"eng"}],"type":"journal_article","date_published":"2018-07-27T00:00:00Z","citation":{"apa":"Rangel Guerrero, D. K., Donnett, J. G., Csicsvari, J. L., & Kovács, K. (2018). Tetrode recording from the hippocampus of behaving mice coupled with four-point-irradiation closed-loop optogenetics: A technique to study the contribution of Hippocampal SWR events to learning. ENeuro. Society of Neuroscience. https://doi.org/10.1523/ENEURO.0087-18.2018","ieee":"D. K. Rangel Guerrero, J. G. Donnett, J. L. Csicsvari, and K. Kovács, “Tetrode recording from the hippocampus of behaving mice coupled with four-point-irradiation closed-loop optogenetics: A technique to study the contribution of Hippocampal SWR events to learning,” eNeuro, vol. 5, no. 4. Society of Neuroscience, 2018.","ista":"Rangel Guerrero DK, Donnett JG, Csicsvari JL, Kovács K. 2018. Tetrode recording from the hippocampus of behaving mice coupled with four-point-irradiation closed-loop optogenetics: A technique to study the contribution of Hippocampal SWR events to learning. eNeuro. 5(4), e0087.","ama":"Rangel Guerrero DK, Donnett JG, Csicsvari JL, Kovács K. Tetrode recording from the hippocampus of behaving mice coupled with four-point-irradiation closed-loop optogenetics: A technique to study the contribution of Hippocampal SWR events to learning. eNeuro. 2018;5(4). doi:10.1523/ENEURO.0087-18.2018","chicago":"Rangel Guerrero, Dámaris K, James G. Donnett, Jozsef L Csicsvari, and Krisztián Kovács. “Tetrode Recording from the Hippocampus of Behaving Mice Coupled with Four-Point-Irradiation Closed-Loop Optogenetics: A Technique to Study the Contribution of Hippocampal SWR Events to Learning.” ENeuro. Society of Neuroscience, 2018. https://doi.org/10.1523/ENEURO.0087-18.2018.","short":"D.K. Rangel Guerrero, J.G. Donnett, J.L. Csicsvari, K. Kovács, ENeuro 5 (2018).","mla":"Rangel Guerrero, Dámaris K., et al. “Tetrode Recording from the Hippocampus of Behaving Mice Coupled with Four-Point-Irradiation Closed-Loop Optogenetics: A Technique to Study the Contribution of Hippocampal SWR Events to Learning.” ENeuro, vol. 5, no. 4, e0087, Society of Neuroscience, 2018, doi:10.1523/ENEURO.0087-18.2018."},"publication":"eNeuro","article_processing_charge":"No","has_accepted_license":"1","day":"27","scopus_import":"1"},{"scopus_import":"1","article_processing_charge":"No","day":"23","page":"1408 - 1411","article_type":"original","citation":{"ista":"Brown M, Assen FP, Leithner AF, Abe J, Schachner H, Asfour G, Bagó Horváth Z, Stein J, Uhrin P, Sixt MK, Kerjaschki D. 2018. Lymph node blood vessels provide exit routes for metastatic tumor cell dissemination in mice. Science. 359(6382), 1408–1411.","apa":"Brown, M., Assen, F. P., Leithner, A. F., Abe, J., Schachner, H., Asfour, G., … Kerjaschki, D. (2018). Lymph node blood vessels provide exit routes for metastatic tumor cell dissemination in mice. Science. American Association for the Advancement of Science. https://doi.org/10.1126/science.aal3662","ieee":"M. Brown et al., “Lymph node blood vessels provide exit routes for metastatic tumor cell dissemination in mice,” Science, vol. 359, no. 6382. American Association for the Advancement of Science, pp. 1408–1411, 2018.","ama":"Brown M, Assen FP, Leithner AF, et al. Lymph node blood vessels provide exit routes for metastatic tumor cell dissemination in mice. Science. 2018;359(6382):1408-1411. doi:10.1126/science.aal3662","chicago":"Brown, Markus, Frank P Assen, Alexander F Leithner, Jun Abe, Helga Schachner, Gabriele Asfour, Zsuzsanna Bagó Horváth, et al. “Lymph Node Blood Vessels Provide Exit Routes for Metastatic Tumor Cell Dissemination in Mice.” Science. American Association for the Advancement of Science, 2018. https://doi.org/10.1126/science.aal3662.","mla":"Brown, Markus, et al. “Lymph Node Blood Vessels Provide Exit Routes for Metastatic Tumor Cell Dissemination in Mice.” Science, vol. 359, no. 6382, American Association for the Advancement of Science, 2018, pp. 1408–11, doi:10.1126/science.aal3662.","short":"M. Brown, F.P. Assen, A.F. Leithner, J. Abe, H. Schachner, G. Asfour, Z. Bagó Horváth, J. Stein, P. Uhrin, M.K. Sixt, D. Kerjaschki, Science 359 (2018) 1408–1411."},"publication":"Science","date_published":"2018-03-23T00:00:00Z","type":"journal_article","issue":"6382","abstract":[{"text":"During metastasis, malignant cells escape the primary tumor, intravasate lymphatic vessels, and reach draining sentinel lymph nodes before they colonize distant organs via the blood circulation. Although lymph node metastasis in cancer patients correlates with poor prognosis, evidence is lacking as to whether and how tumor cells enter the bloodstream via lymph nodes. To investigate this question, we delivered carcinoma cells into the lymph nodes of mice by microinfusing the cells into afferent lymphatic vessels. We found that tumor cells rapidly infiltrated the lymph node parenchyma, invaded blood vessels, and seeded lung metastases without involvement of the thoracic duct. These results suggest that the lymph node blood vessels can serve as an exit route for systemic dissemination of cancer cells in experimental mouse models. Whether this form of tumor cell spreading occurs in cancer patients remains to be determined.","lang":"eng"}],"intvolume":" 359","title":"Lymph node blood vessels provide exit routes for metastatic tumor cell dissemination in mice","status":"public","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"402","oa_version":"Published Version","month":"03","project":[{"grant_number":"Y 564-B12","_id":"25A8E5EA-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Cytoskeletal force generation and transduction of leukocytes (FWF)"},{"name":"Cytoskeletal force generation and force transduction of migrating leukocytes (EU)","call_identifier":"FP7","grant_number":"281556","_id":"25A603A2-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","isi":1,"oa":1,"external_id":{"isi":["000428043600047"],"pmid":["29567714"]},"main_file_link":[{"url":"https://doi.org/10.1126/science.aal3662","open_access":"1"}],"language":[{"iso":"eng"}],"acknowledged_ssus":[{"_id":"Bio"}],"doi":"10.1126/science.aal3662","ec_funded":1,"publist_id":"7428","department":[{"_id":"MiSi"}],"publisher":"American Association for the Advancement of Science","publication_status":"published","pmid":1,"year":"2018","acknowledgement":"M.B. was supported by the Cell Communication in Health and Disease graduate study program of the Austrian Science Fund (FWF) and the Medical University of Vienna. M.S. was supported by the European Research Council (grant ERC GA 281556) and an FWF START award.\r\nWe thank C. Moussion for establishing the intralymphatic injection at IST Austria and for providing anti-PNAd hybridoma supernatant, R. Förster and A. Braun for sharing the intralymphatic injection technology, K. Vaahtomeri for the lentiviral constructs, M. Hons for establishing in vivo multiphoton imaging, the Sixt lab for intellectual input, M. Schunn for help with the design of the in vivo experiments, F. Langer for technical assistance with the in vivo experiments, the bioimaging facility of IST Austria for support, and R. Efferl for providing the CT26 cell line.","volume":359,"date_updated":"2024-03-28T23:30:09Z","date_created":"2018-12-11T11:46:16Z","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"6947"}]},"author":[{"id":"3DAB9AFC-F248-11E8-B48F-1D18A9856A87","first_name":"Markus","last_name":"Brown","full_name":"Brown, Markus"},{"full_name":"Assen, Frank P","first_name":"Frank P","last_name":"Assen","id":"3A8E7F24-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3470-6119"},{"full_name":"Leithner, Alexander F","orcid":"0000-0002-1073-744X","id":"3B1B77E4-F248-11E8-B48F-1D18A9856A87","last_name":"Leithner","first_name":"Alexander F"},{"first_name":"Jun","last_name":"Abe","full_name":"Abe, Jun"},{"full_name":"Schachner, Helga","last_name":"Schachner","first_name":"Helga"},{"last_name":"Asfour","first_name":"Gabriele","full_name":"Asfour, Gabriele"},{"full_name":"Bagó Horváth, Zsuzsanna","first_name":"Zsuzsanna","last_name":"Bagó Horváth"},{"first_name":"Jens","last_name":"Stein","full_name":"Stein, Jens"},{"full_name":"Uhrin, Pavel","first_name":"Pavel","last_name":"Uhrin"},{"last_name":"Sixt","first_name":"Michael K","orcid":"0000-0002-6620-9179","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","full_name":"Sixt, Michael K"},{"first_name":"Dontscho","last_name":"Kerjaschki","full_name":"Kerjaschki, Dontscho"}]}]