[{"article_type":"original","page":"75-111","publication":"Journal of Computer Security","citation":{"chicago":"Demay, Gregory, Peter Gazi, Ueli Maurer, and Bjorn Tackmann. “Per-Session Security: Password-Based Cryptography Revisited.” Journal of Computer Security. IOS Press, 2019. https://doi.org/10.3233/JCS-181131.","short":"G. Demay, P. Gazi, U. Maurer, B. Tackmann, Journal of Computer Security 27 (2019) 75–111.","mla":"Demay, Gregory, et al. “Per-Session Security: Password-Based Cryptography Revisited.” Journal of Computer Security, vol. 27, no. 1, IOS Press, 2019, pp. 75–111, doi:10.3233/JCS-181131.","ieee":"G. Demay, P. Gazi, U. Maurer, and B. Tackmann, “Per-session security: Password-based cryptography revisited,” Journal of Computer Security, vol. 27, no. 1. IOS Press, pp. 75–111, 2019.","apa":"Demay, G., Gazi, P., Maurer, U., & Tackmann, B. (2019). Per-session security: Password-based cryptography revisited. Journal of Computer Security. IOS Press. https://doi.org/10.3233/JCS-181131","ista":"Demay G, Gazi P, Maurer U, Tackmann B. 2019. Per-session security: Password-based cryptography revisited. Journal of Computer Security. 27(1), 75–111.","ama":"Demay G, Gazi P, Maurer U, Tackmann B. Per-session security: Password-based cryptography revisited. Journal of Computer Security. 2019;27(1):75-111. doi:10.3233/JCS-181131"},"date_published":"2019-01-01T00:00:00Z","scopus_import":"1","day":"1","article_processing_charge":"No","status":"public","title":"Per-session security: Password-based cryptography revisited","intvolume":" 27","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"5887","oa_version":"Preprint","type":"journal_article","abstract":[{"lang":"eng","text":"Cryptographic security is usually defined as a guarantee that holds except when a bad event with negligible probability occurs, and nothing is guaranteed in that bad case. However, in settings where such failure can happen with substantial probability, one needs to provide guarantees even for the bad case. A typical example is where a (possibly weak) password is used instead of a secure cryptographic key to protect a session, the bad event being that the adversary correctly guesses the password. In a situation with multiple such sessions, a per-session guarantee is desired: any session for which the password has not been guessed remains secure, independently of whether other sessions have been compromised. A new formalism for stating such gracefully degrading security guarantees is introduced and applied to analyze the examples of password-based message authentication and password-based encryption. While a natural per-message guarantee is achieved for authentication, the situation of password-based encryption is more delicate: a per-session confidentiality guarantee only holds against attackers for which the distribution of password-guessing effort over the sessions is known in advance. In contrast, for more general attackers without such a restriction, a strong, composable notion of security cannot be achieved."}],"issue":"1","quality_controlled":"1","project":[{"name":"Teaching Old Crypto New Tricks","call_identifier":"H2020","grant_number":"682815","_id":"258AA5B2-B435-11E9-9278-68D0E5697425"}],"main_file_link":[{"url":"https://eprint.iacr.org/2016/166","open_access":"1"}],"oa":1,"language":[{"iso":"eng"}],"doi":"10.3233/JCS-181131","month":"01","publication_identifier":{"issn":["0926227X"]},"publication_status":"published","publisher":"IOS Press","department":[{"_id":"KrPi"}],"year":"2019","date_created":"2019-01-27T22:59:10Z","date_updated":"2021-01-12T08:05:08Z","volume":27,"author":[{"full_name":"Demay, Gregory","last_name":"Demay","first_name":"Gregory"},{"first_name":"Peter","last_name":"Gazi","id":"3E0BFE38-F248-11E8-B48F-1D18A9856A87","full_name":"Gazi, Peter"},{"first_name":"Ueli","last_name":"Maurer","full_name":"Maurer, Ueli"},{"last_name":"Tackmann","first_name":"Bjorn","full_name":"Tackmann, Bjorn"}],"ec_funded":1},{"author":[{"orcid":"0000-0002-5372-7890","id":"3C2B033E-F248-11E8-B48F-1D18A9856A87","last_name":"Biswas","first_name":"Ranita","full_name":"Biswas, Ranita"},{"last_name":"Largeteau-Skapin","first_name":"Gaëlle","full_name":"Largeteau-Skapin, Gaëlle"},{"full_name":"Zrour, Rita","last_name":"Zrour","first_name":"Rita"},{"full_name":"Andres, Eric","last_name":"Andres","first_name":"Eric"}],"oa_version":"None","volume":11414,"date_created":"2019-03-21T12:12:19Z","date_updated":"2022-01-27T14:25:17Z","_id":"6163","year":"2019","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","publisher":"Springer Berlin Heidelberg","intvolume":" 11414","status":"public","publication_status":"published","title":"Rhombic dodecahedron grid—coordinate system and 3D digital object definitions","abstract":[{"text":"We propose a new non-orthogonal basis to express the 3D Euclidean space in terms of a regular grid. Every grid point, each represented by integer 3-coordinates, corresponds to rhombic dodecahedron centroid. Rhombic dodecahedron is a space filling polyhedron which represents the close packing of spheres in 3D space and the Voronoi structures of the face centered cubic (FCC) lattice. In order to illustrate the interest of the new coordinate system, we propose the characterization of 3D digital plane with its topological features, such as the interrelation between the thickness of the digital plane and the separability constraint we aim to obtain. A characterization of a 3D digital sphere with relevant topological features is proposed as well with the help of a 48 symmetry that comes with the new coordinate system.","lang":"eng"}],"extern":"1","type":"conference","place":"Berlin, Heidelberg","alternative_title":["LNCS"],"date_published":"2019-02-23T00:00:00Z","doi":"10.1007/978-3-030-14085-4_3","conference":{"name":"DGCI: International Conference on Discrete Geometry for Computer Imagery","end_date":"2019-03-28","start_date":"2019-03-26","location":"Marne-la-Vallée, France"},"language":[{"iso":"eng"}],"citation":{"chicago":"Biswas, Ranita, Gaëlle Largeteau-Skapin, Rita Zrour, and Eric Andres. “Rhombic Dodecahedron Grid—Coordinate System and 3D Digital Object Definitions.” In 21st IAPR International Conference on Discrete Geometry for Computer Imagery, 11414:27–37. Berlin, Heidelberg: Springer Berlin Heidelberg, 2019. https://doi.org/10.1007/978-3-030-14085-4_3.","short":"R. Biswas, G. Largeteau-Skapin, R. Zrour, E. Andres, in:, 21st IAPR International Conference on Discrete Geometry for Computer Imagery, Springer Berlin Heidelberg, Berlin, Heidelberg, 2019, pp. 27–37.","mla":"Biswas, Ranita, et al. “Rhombic Dodecahedron Grid—Coordinate System and 3D Digital Object Definitions.” 21st IAPR International Conference on Discrete Geometry for Computer Imagery, vol. 11414, Springer Berlin Heidelberg, 2019, pp. 27–37, doi:10.1007/978-3-030-14085-4_3.","apa":"Biswas, R., Largeteau-Skapin, G., Zrour, R., & Andres, E. (2019). Rhombic dodecahedron grid—coordinate system and 3D digital object definitions. In 21st IAPR International Conference on Discrete Geometry for Computer Imagery (Vol. 11414, pp. 27–37). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-030-14085-4_3","ieee":"R. Biswas, G. Largeteau-Skapin, R. Zrour, and E. Andres, “Rhombic dodecahedron grid—coordinate system and 3D digital object definitions,” in 21st IAPR International Conference on Discrete Geometry for Computer Imagery, Marne-la-Vallée, France, 2019, vol. 11414, pp. 27–37.","ista":"Biswas R, Largeteau-Skapin G, Zrour R, Andres E. 2019. Rhombic dodecahedron grid—coordinate system and 3D digital object definitions. 21st IAPR International Conference on Discrete Geometry for Computer Imagery. DGCI: International Conference on Discrete Geometry for Computer Imagery, LNCS, vol. 11414, 27–37.","ama":"Biswas R, Largeteau-Skapin G, Zrour R, Andres E. Rhombic dodecahedron grid—coordinate system and 3D digital object definitions. In: 21st IAPR International Conference on Discrete Geometry for Computer Imagery. Vol 11414. Berlin, Heidelberg: Springer Berlin Heidelberg; 2019:27-37. doi:10.1007/978-3-030-14085-4_3"},"publication":"21st IAPR International Conference on Discrete Geometry for Computer Imagery","page":"27-37","quality_controlled":"1","publication_identifier":{"isbn":["978-3-6624-6446-5","978-3-6624-6447-2"],"issn":["0302-9743","1611-3349"]},"article_processing_charge":"No","day":"23","month":"02"},{"page":"223–256","citation":{"chicago":"Dyer, Ramsay, Gert Vegter, and Mathijs Wintraecken. “Simplices Modelled on Spaces of Constant Curvature.” Journal of Computational Geometry . Carleton University, 2019. https://doi.org/10.20382/jocg.v10i1a9.","short":"R. Dyer, G. Vegter, M. Wintraecken, Journal of Computational Geometry 10 (2019) 223–256.","mla":"Dyer, Ramsay, et al. “Simplices Modelled on Spaces of Constant Curvature.” Journal of Computational Geometry , vol. 10, no. 1, Carleton University, 2019, pp. 223–256, doi:10.20382/jocg.v10i1a9.","ieee":"R. Dyer, G. Vegter, and M. Wintraecken, “Simplices modelled on spaces of constant curvature,” Journal of Computational Geometry , vol. 10, no. 1. Carleton University, pp. 223–256, 2019.","apa":"Dyer, R., Vegter, G., & Wintraecken, M. (2019). Simplices modelled on spaces of constant curvature. Journal of Computational Geometry . Carleton University. https://doi.org/10.20382/jocg.v10i1a9","ista":"Dyer R, Vegter G, Wintraecken M. 2019. Simplices modelled on spaces of constant curvature. Journal of Computational Geometry . 10(1), 223–256.","ama":"Dyer R, Vegter G, Wintraecken M. Simplices modelled on spaces of constant curvature. Journal of Computational Geometry . 2019;10(1):223–256. doi:10.20382/jocg.v10i1a9"},"publication":"Journal of Computational Geometry ","date_published":"2019-07-01T00:00:00Z","scopus_import":1,"has_accepted_license":"1","day":"01","intvolume":" 10","status":"public","ddc":["510"],"title":"Simplices modelled on spaces of constant curvature","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"6515","oa_version":"Published Version","file":[{"access_level":"open_access","file_name":"mainJournalFinal.pdf","file_size":2170882,"content_type":"application/pdf","creator":"mwintrae","relation":"main_file","file_id":"6516","checksum":"57b4df2f16a74eb499734ec8ee240178","date_created":"2019-06-03T09:30:01Z","date_updated":"2020-07-14T12:47:32Z"}],"type":"journal_article","issue":"1","abstract":[{"lang":"eng","text":"We give non-degeneracy criteria for Riemannian simplices based on simplices in spaces of constant sectional curvature. It extends previous work on Riemannian simplices, where we developed Riemannian simplices with respect to Euclidean reference simplices. The criteria we give in this article are in terms of quality measures for spaces of constant curvature that we develop here. We see that simplices in spaces that have nearly constant curvature, are already non-degenerate under very weak quality demands. This is of importance because it allows for sampling of Riemannian manifolds based on anisotropy of the manifold and not (absolute) curvature."}],"project":[{"call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411"}],"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"},"oa":1,"language":[{"iso":"eng"}],"doi":"10.20382/jocg.v10i1a9","publication_identifier":{"issn":["1920-180X"]},"month":"07","department":[{"_id":"HeEd"}],"publisher":"Carleton University","publication_status":"published","year":"2019","volume":10,"date_updated":"2021-01-12T08:07:50Z","date_created":"2019-06-03T09:35:33Z","author":[{"first_name":"Ramsay","last_name":"Dyer","full_name":"Dyer, Ramsay"},{"full_name":"Vegter, Gert","first_name":"Gert","last_name":"Vegter"},{"full_name":"Wintraecken, Mathijs","first_name":"Mathijs","last_name":"Wintraecken","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7472-2220"}],"ec_funded":1,"file_date_updated":"2020-07-14T12:47:32Z"},{"publication_status":"published","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"KrPi"}],"year":"2019","date_updated":"2021-01-12T08:07:53Z","date_created":"2019-06-06T14:12:36Z","volume":124,"author":[{"orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak","first_name":"Krzysztof Z","full_name":"Pietrzak, Krzysztof Z"}],"article_number":"60","file_date_updated":"2020-07-14T12:47:33Z","ec_funded":1,"quality_controlled":"1","project":[{"call_identifier":"H2020","name":"Teaching Old Crypto New Tricks","grant_number":"682815","_id":"258AA5B2-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"},"main_file_link":[{"url":"https://eprint.iacr.org/2018/627","open_access":"1"}],"language":[{"iso":"eng"}],"conference":{"name":"ITCS 2019: Innovations in Theoretical Computer Science","end_date":"2019-01-12","start_date":"2019-01-10","location":"San Diego, CA, United States"},"doi":"10.4230/LIPICS.ITCS.2019.60","month":"01","publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-95977-095-8"]},"title":"Simple verifiable delay functions","status":"public","ddc":["000"],"intvolume":" 124","_id":"6528","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"file_name":"2019_LIPIcs_Pietrzak.pdf","access_level":"open_access","content_type":"application/pdf","file_size":558770,"creator":"dernst","relation":"main_file","file_id":"6529","date_created":"2019-06-06T14:22:04Z","date_updated":"2020-07-14T12:47:33Z","checksum":"f0ae1bb161431d9db3dea5ace082bfb5"}],"oa_version":"Published Version","alternative_title":["LIPIcs"],"type":"conference","abstract":[{"lang":"eng","text":"We construct a verifiable delay function (VDF) by showing how the Rivest-Shamir-Wagner time-lock puzzle can be made publicly verifiable. Concretely, we give a statistically sound public-coin protocol to prove that a tuple (N,x,T,y) satisfies y=x2T (mod N) where the prover doesn’t know the factorization of N and its running time is dominated by solving the puzzle, that is, compute x2T, which is conjectured to require T sequential squarings. To get a VDF we make this protocol non-interactive using the Fiat-Shamir heuristic.The motivation for this work comes from the Chia blockchain design, which uses a VDF as akey ingredient. For typical parameters (T≤2 40, N= 2048), our proofs are of size around 10K B, verification cost around three RSA exponentiations and computing the proof is 8000 times faster than solving the puzzle even without any parallelism."}],"publication":"10th Innovations in Theoretical Computer Science Conference","citation":{"ama":"Pietrzak KZ. Simple verifiable delay functions. In: 10th Innovations in Theoretical Computer Science Conference. Vol 124. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.ITCS.2019.60","ista":"Pietrzak KZ. 2019. Simple verifiable delay functions. 10th Innovations in Theoretical Computer Science Conference. ITCS 2019: Innovations in Theoretical Computer Science, LIPIcs, vol. 124, 60.","apa":"Pietrzak, K. Z. (2019). Simple verifiable delay functions. In 10th Innovations in Theoretical Computer Science Conference (Vol. 124). San Diego, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ITCS.2019.60","ieee":"K. Z. Pietrzak, “Simple verifiable delay functions,” in 10th Innovations in Theoretical Computer Science Conference, San Diego, CA, United States, 2019, vol. 124.","mla":"Pietrzak, Krzysztof Z. “Simple Verifiable Delay Functions.” 10th Innovations in Theoretical Computer Science Conference, vol. 124, 60, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.ITCS.2019.60.","short":"K.Z. Pietrzak, in:, 10th Innovations in Theoretical Computer Science Conference, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.","chicago":"Pietrzak, Krzysztof Z. “Simple Verifiable Delay Functions.” In 10th Innovations in Theoretical Computer Science Conference, Vol. 124. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.ITCS.2019.60."},"date_published":"2019-01-10T00:00:00Z","scopus_import":1,"day":"10","article_processing_charge":"No","has_accepted_license":"1"},{"publication_identifier":{"isbn":["978-153866246-5"]},"month":"05","language":[{"iso":"eng"}],"doi":"10.1109/INDIANCC.2019.8715598","conference":{"name":"ICC 2019 - Indian Control Conference","end_date":"2019-01-11","start_date":"2019-01-09","location":"Delhi, India"},"project":[{"call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"name":"The Wittgenstein Prize","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211"}],"quality_controlled":"1","oa":1,"file_date_updated":"2020-10-21T13:13:49Z","article_number":"8715598","date_updated":"2021-01-12T08:08:01Z","date_created":"2019-06-17T06:57:33Z","author":[{"last_name":"Kundu","first_name":"Atreyee","full_name":"Kundu, Atreyee"},{"id":"4B3207F6-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0003−2936−5719","first_name":"Miriam","last_name":"Garcia Soto","full_name":"Garcia Soto, Miriam"},{"full_name":"Prabhakar, Pavithra","first_name":"Pavithra","last_name":"Prabhakar"}],"department":[{"_id":"ToHe"}],"publisher":"IEEE","publication_status":"published","year":"2019","article_processing_charge":"No","has_accepted_license":"1","day":"16","scopus_import":"1","date_published":"2019-05-16T00:00:00Z","citation":{"chicago":"Kundu, Atreyee, Miriam Garcia Soto, and Pavithra Prabhakar. “Formal Synthesis of Stabilizing Controllers for Periodically Controlled Linear Switched Systems.” In 5th Indian Control Conference Proceedings. IEEE, 2019. https://doi.org/10.1109/INDIANCC.2019.8715598.","short":"A. Kundu, M. Garcia Soto, P. Prabhakar, in:, 5th Indian Control Conference Proceedings, IEEE, 2019.","mla":"Kundu, Atreyee, et al. “Formal Synthesis of Stabilizing Controllers for Periodically Controlled Linear Switched Systems.” 5th Indian Control Conference Proceedings, 8715598, IEEE, 2019, doi:10.1109/INDIANCC.2019.8715598.","apa":"Kundu, A., Garcia Soto, M., & Prabhakar, P. (2019). Formal synthesis of stabilizing controllers for periodically controlled linear switched systems. In 5th Indian Control Conference Proceedings. Delhi, India: IEEE. https://doi.org/10.1109/INDIANCC.2019.8715598","ieee":"A. Kundu, M. Garcia Soto, and P. Prabhakar, “Formal synthesis of stabilizing controllers for periodically controlled linear switched systems,” in 5th Indian Control Conference Proceedings, Delhi, India, 2019.","ista":"Kundu A, Garcia Soto M, Prabhakar P. 2019. Formal synthesis of stabilizing controllers for periodically controlled linear switched systems. 5th Indian Control Conference Proceedings. ICC 2019 - Indian Control Conference, 8715598.","ama":"Kundu A, Garcia Soto M, Prabhakar P. Formal synthesis of stabilizing controllers for periodically controlled linear switched systems. In: 5th Indian Control Conference Proceedings. IEEE; 2019. doi:10.1109/INDIANCC.2019.8715598"},"publication":"5th Indian Control Conference Proceedings","abstract":[{"lang":"eng","text":"In this paper, we address the problem of synthesizing periodic switching controllers for stabilizing a family of linear systems. Our broad approach consists of constructing a finite game graph based on the family of linear systems such that every winning strategy on the game graph corresponds to a stabilizing switching controller for the family of linear systems. The construction of a (finite) game graph, the synthesis of a winning strategy and the extraction of a stabilizing controller are all computationally feasible. We illustrate our method on an example."}],"type":"conference","oa_version":"Submitted Version","file":[{"file_id":"8687","relation":"main_file","success":1,"checksum":"d622a91af1e427f6b1e0ba8e18a2b767","date_created":"2020-10-21T13:13:49Z","date_updated":"2020-10-21T13:13:49Z","access_level":"open_access","file_name":"2019_ICC_Kundu.pdf","creator":"dernst","file_size":396031,"content_type":"application/pdf"}],"title":"Formal synthesis of stabilizing controllers for periodically controlled linear switched systems","status":"public","ddc":["000"],"_id":"6565","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"scopus_import":1,"day":"01","month":"08","has_accepted_license":"1","publication":"The 31st Canadian Conference in Computational Geometry","oa":1,"citation":{"ama":"Vegter G, Wintraecken M. The extrinsic nature of the Hausdorff distance of optimal triangulations of manifolds. In: The 31st Canadian Conference in Computational Geometry. ; 2019:275-279.","ieee":"G. Vegter and M. Wintraecken, “The extrinsic nature of the Hausdorff distance of optimal triangulations of manifolds,” in The 31st Canadian Conference in Computational Geometry, Edmonton, Canada, 2019, pp. 275–279.","apa":"Vegter, G., & Wintraecken, M. (2019). The extrinsic nature of the Hausdorff distance of optimal triangulations of manifolds. In The 31st Canadian Conference in Computational Geometry (pp. 275–279). Edmonton, Canada.","ista":"Vegter G, Wintraecken M. 2019. The extrinsic nature of the Hausdorff distance of optimal triangulations of manifolds. The 31st Canadian Conference in Computational Geometry. CCCG: Canadian Conference in Computational Geometry, 275–279.","short":"G. Vegter, M. Wintraecken, in:, The 31st Canadian Conference in Computational Geometry, 2019, pp. 275–279.","mla":"Vegter, Gert, and Mathijs Wintraecken. “The Extrinsic Nature of the Hausdorff Distance of Optimal Triangulations of Manifolds.” The 31st Canadian Conference in Computational Geometry, 2019, pp. 275–79.","chicago":"Vegter, Gert, and Mathijs Wintraecken. “The Extrinsic Nature of the Hausdorff Distance of Optimal Triangulations of Manifolds.” In The 31st Canadian Conference in Computational Geometry, 275–79, 2019."},"quality_controlled":"1","project":[{"call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411"}],"page":"275-279","conference":{"name":"CCCG: Canadian Conference in Computational Geometry","end_date":"2019-08-10","location":"Edmonton, Canada","start_date":"2019-08-08"},"date_published":"2019-08-01T00:00:00Z","language":[{"iso":"eng"}],"type":"conference","abstract":[{"lang":"eng","text":"Fejes Tóth [5] and Schneider [9] studied approximations of smooth convex hypersurfaces in Euclidean space by piecewise flat triangular meshes with a given number of vertices on the hypersurface that are optimal with respect to Hausdorff distance. They proved that this Hausdorff distance decreases inversely proportional with m 2/(d−1), where m is the number of vertices and d is the dimension of Euclidean space. Moreover the pro-portionality constant can be expressed in terms of the Gaussian curvature, an intrinsic quantity. In this short note, we prove the extrinsic nature of this constant for manifolds of sufficiently high codimension. We do so by constructing an family of isometric embeddings of the flat torus in Euclidean space."}],"file_date_updated":"2020-07-14T12:47:34Z","ec_funded":1,"_id":"6628","year":"2019","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","title":"The extrinsic nature of the Hausdorff distance of optimal triangulations of manifolds","publication_status":"published","status":"public","ddc":["004"],"department":[{"_id":"HeEd"}],"author":[{"first_name":"Gert","last_name":"Vegter","full_name":"Vegter, Gert"},{"first_name":"Mathijs","last_name":"Wintraecken","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7472-2220","full_name":"Wintraecken, Mathijs"}],"date_updated":"2021-01-12T08:08:16Z","date_created":"2019-07-12T08:34:57Z","oa_version":"Submitted Version","file":[{"access_level":"open_access","file_name":"IntrinsicExtrinsicCCCG2019.pdf","creator":"mwintrae","file_size":321176,"content_type":"application/pdf","file_id":"6629","relation":"main_file","checksum":"ceabd152cfa55170d57763f9c6c60a53","date_created":"2019-07-12T08:32:46Z","date_updated":"2020-07-14T12:47:34Z"}]},{"project":[{"_id":"2561EBF4-B435-11E9-9278-68D0E5697425","grant_number":"I02979-N35","name":"Persistence and stability of geometric complexes","call_identifier":"FWF"}],"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"},"oa":1,"external_id":{"arxiv":["1903.08510"]},"language":[{"iso":"eng"}],"doi":"10.4230/LIPICS.SOCG.2019.31","conference":{"start_date":"2019-06-18","location":"Portland, OR, United States","end_date":"2019-06-21","name":"SoCG 2019: Symposium on Computational Geometry"},"publication_identifier":{"isbn":["9783959771047"]},"month":"06","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"HeEd"}],"publication_status":"published","year":"2019","volume":129,"date_updated":"2021-01-12T08:08:23Z","date_created":"2019-07-17T10:36:09Z","author":[{"full_name":"Edelsbrunner, Herbert","first_name":"Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833"},{"first_name":"Ziga","last_name":"Virk","full_name":"Virk, Ziga"},{"last_name":"Wagner","first_name":"Hubert","id":"379CA8B8-F248-11E8-B48F-1D18A9856A87","full_name":"Wagner, Hubert"}],"file_date_updated":"2020-07-14T12:47:35Z","page":"31:1-31:14","citation":{"mla":"Edelsbrunner, Herbert, et al. “Topological Data Analysis in Information Space.” 35th International Symposium on Computational Geometry, vol. 129, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 31:1-31:14, doi:10.4230/LIPICS.SOCG.2019.31.","short":"H. Edelsbrunner, Z. Virk, H. Wagner, in:, 35th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 31:1-31:14.","chicago":"Edelsbrunner, Herbert, Ziga Virk, and Hubert Wagner. “Topological Data Analysis in Information Space.” In 35th International Symposium on Computational Geometry, 129:31:1-31:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.SOCG.2019.31.","ama":"Edelsbrunner H, Virk Z, Wagner H. Topological data analysis in information space. In: 35th International Symposium on Computational Geometry. Vol 129. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019:31:1-31:14. doi:10.4230/LIPICS.SOCG.2019.31","ista":"Edelsbrunner H, Virk Z, Wagner H. 2019. Topological data analysis in information space. 35th International Symposium on Computational Geometry. SoCG 2019: Symposium on Computational Geometry, LIPIcs, vol. 129, 31:1-31:14.","apa":"Edelsbrunner, H., Virk, Z., & Wagner, H. (2019). Topological data analysis in information space. In 35th International Symposium on Computational Geometry (Vol. 129, p. 31:1-31:14). Portland, OR, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.SOCG.2019.31","ieee":"H. Edelsbrunner, Z. Virk, and H. Wagner, “Topological data analysis in information space,” in 35th International Symposium on Computational Geometry, Portland, OR, United States, 2019, vol. 129, p. 31:1-31:14."},"publication":"35th International Symposium on Computational Geometry","date_published":"2019-06-01T00:00:00Z","scopus_import":1,"has_accepted_license":"1","day":"01","intvolume":" 129","title":"Topological data analysis in information space","status":"public","ddc":["510"],"_id":"6648","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","file":[{"file_id":"6666","relation":"main_file","date_updated":"2020-07-14T12:47:35Z","date_created":"2019-07-24T06:40:01Z","checksum":"8ec8720730d4c789bf7b06540f1c29f4","file_name":"2019_LIPICS_Edelsbrunner.pdf","access_level":"open_access","creator":"dernst","file_size":1355179,"content_type":"application/pdf"}],"alternative_title":["LIPIcs"],"type":"conference","abstract":[{"lang":"eng","text":"Various kinds of data are routinely represented as discrete probability distributions. Examples include text documents summarized by histograms of word occurrences and images represented as histograms of oriented gradients. Viewing a discrete probability distribution as a point in the standard simplex of the appropriate dimension, we can understand collections of such objects in geometric and topological terms. Importantly, instead of using the standard Euclidean distance, we look into dissimilarity measures with information-theoretic justification, and we develop the theory\r\nneeded for applying topological data analysis in this setting. In doing so, we emphasize constructions that enable the usage of existing computational topology software in this context."}]},{"file_date_updated":"2020-10-02T08:49:58Z","ec_funded":1,"publication_status":"published","publisher":"Bulletin of the Chemical Society of Japan","department":[{"_id":"RySh"}],"acknowledgement":"his work was supported by the Grant-in-Aid for Scientific Research B (JSPS KAKENHI grant no. JP17H03090 to A. O.); the Scientific Research on Innovative Areas “Chemistry for Multimolecular Crowding Biosystems” (JSPS KAKENHI grant no. JP17H06349 to A. O.); and the European Union (European Research Council Advanced grant no. 694539 and Human Brain Project Ref. 720270 to R. S.). A. O. acknowledges the financial support of the Takeda Science Foundation.","year":"2019","date_updated":"2021-01-12T08:08:26Z","date_created":"2019-07-21T21:59:16Z","volume":92,"author":[{"full_name":"Zenmyo, Naoki","last_name":"Zenmyo","first_name":"Naoki"},{"full_name":"Tokumaru, Hiroki","first_name":"Hiroki","last_name":"Tokumaru"},{"full_name":"Uchinomiya, Shohei","first_name":"Shohei","last_name":"Uchinomiya"},{"last_name":"Fuchida","first_name":"Hirokazu","full_name":"Fuchida, Hirokazu"},{"id":"4427179E-F248-11E8-B48F-1D18A9856A87","last_name":"Tabata","first_name":"Shigekazu","full_name":"Tabata, Shigekazu"},{"first_name":"Itaru","last_name":"Hamachi","full_name":"Hamachi, Itaru"},{"full_name":"Shigemoto, Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8761-9444","first_name":"Ryuichi","last_name":"Shigemoto"},{"full_name":"Ojida, Akio","last_name":"Ojida","first_name":"Akio"}],"month":"05","publication_identifier":{"issn":["00092673"]},"quality_controlled":"1","project":[{"grant_number":"694539","_id":"25CA28EA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"In situ analysis of single channel subunit composition in neurons: physiological implication in synaptic plasticity and behaviour"}],"oa":1,"language":[{"iso":"eng"}],"doi":"10.1246/bcsj.20190034","type":"journal_article","abstract":[{"text":"Chemical labeling of proteins with synthetic molecular probes offers the possibility to probe the functions of proteins of interest in living cells. However, the methods for covalently labeling targeted proteins using complementary peptide tag-probe pairs are still limited, irrespective of the versatility of such pairs in biological research. Herein, we report the new CysHis tag-Ni(II) probe pair for the specific covalent labeling of proteins. A broad-range evaluation of the reactivity profiles of the probe and the CysHis peptide tag afforded a tag-probe pair with an optimized and high labeling selectivity and reactivity. In particular, the labeling specificity of this pair was notably improved compared to the previously reported one. This pair was successfully utilized for the fluorescence imaging of membrane proteins on the surfaces of living cells, demonstrating its potential utility in biological research.","lang":"eng"}],"issue":"5","title":"Optimized reaction pair of the CysHis tag and Ni(II)-NTA probe for highly selective chemical labeling of membrane proteins","status":"public","ddc":["570"],"intvolume":" 92","_id":"6659","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"content_type":"application/pdf","file_size":2464903,"creator":"dernst","file_name":"2019_BCSJ_Zenmyo.pdf","access_level":"open_access","date_created":"2020-10-02T08:49:58Z","date_updated":"2020-10-02T08:49:58Z","checksum":"186de511d6e0ca93f5d981e2443eb8cd","success":1,"relation":"main_file","file_id":"8594"}],"oa_version":"Published Version","scopus_import":"1","day":"15","has_accepted_license":"1","article_processing_charge":"No","article_type":"original","page":"995-1000","publication":"Bulletin of the Chemical Society of Japan","citation":{"chicago":"Zenmyo, Naoki, Hiroki Tokumaru, Shohei Uchinomiya, Hirokazu Fuchida, Shigekazu Tabata, Itaru Hamachi, Ryuichi Shigemoto, and Akio Ojida. “Optimized Reaction Pair of the CysHis Tag and Ni(II)-NTA Probe for Highly Selective Chemical Labeling of Membrane Proteins.” Bulletin of the Chemical Society of Japan. Bulletin of the Chemical Society of Japan, 2019. https://doi.org/10.1246/bcsj.20190034.","mla":"Zenmyo, Naoki, et al. “Optimized Reaction Pair of the CysHis Tag and Ni(II)-NTA Probe for Highly Selective Chemical Labeling of Membrane Proteins.” Bulletin of the Chemical Society of Japan, vol. 92, no. 5, Bulletin of the Chemical Society of Japan, 2019, pp. 995–1000, doi:10.1246/bcsj.20190034.","short":"N. Zenmyo, H. Tokumaru, S. Uchinomiya, H. Fuchida, S. Tabata, I. Hamachi, R. Shigemoto, A. Ojida, Bulletin of the Chemical Society of Japan 92 (2019) 995–1000.","ista":"Zenmyo N, Tokumaru H, Uchinomiya S, Fuchida H, Tabata S, Hamachi I, Shigemoto R, Ojida A. 2019. Optimized reaction pair of the CysHis tag and Ni(II)-NTA probe for highly selective chemical labeling of membrane proteins. Bulletin of the Chemical Society of Japan. 92(5), 995–1000.","ieee":"N. Zenmyo et al., “Optimized reaction pair of the CysHis tag and Ni(II)-NTA probe for highly selective chemical labeling of membrane proteins,” Bulletin of the Chemical Society of Japan, vol. 92, no. 5. Bulletin of the Chemical Society of Japan, pp. 995–1000, 2019.","apa":"Zenmyo, N., Tokumaru, H., Uchinomiya, S., Fuchida, H., Tabata, S., Hamachi, I., … Ojida, A. (2019). Optimized reaction pair of the CysHis tag and Ni(II)-NTA probe for highly selective chemical labeling of membrane proteins. Bulletin of the Chemical Society of Japan. Bulletin of the Chemical Society of Japan. https://doi.org/10.1246/bcsj.20190034","ama":"Zenmyo N, Tokumaru H, Uchinomiya S, et al. Optimized reaction pair of the CysHis tag and Ni(II)-NTA probe for highly selective chemical labeling of membrane proteins. Bulletin of the Chemical Society of Japan. 2019;92(5):995-1000. doi:10.1246/bcsj.20190034"},"date_published":"2019-05-15T00:00:00Z"},{"extern":"1","author":[{"last_name":"Mondelli","first_name":"Marco","orcid":"0000-0002-3242-7020","id":"27EB676C-8706-11E9-9510-7717E6697425","full_name":"Mondelli, Marco"},{"full_name":"Montanari, Andrea","last_name":"Montanari","first_name":"Andrea"}],"date_created":"2019-07-22T13:23:48Z","date_updated":"2021-01-12T08:08:28Z","volume":19,"year":"2019","publication_status":"published","publisher":"Springer","month":"06","publication_identifier":{"eissn":["1615-3383"]},"doi":"10.1007/s10208-018-9395-y","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1708.05932"}],"external_id":{"arxiv":["1708.05932"]},"oa":1,"quality_controlled":"1","abstract":[{"text":"In phase retrieval, we want to recover an unknown signal 𝑥∈ℂ𝑑 from n quadratic measurements of the form 𝑦𝑖=|⟨𝑎𝑖,𝑥⟩|2+𝑤𝑖, where 𝑎𝑖∈ℂ𝑑 are known sensing vectors and 𝑤𝑖 is measurement noise. We ask the following weak recovery question: What is the minimum number of measurements n needed to produce an estimator 𝑥^(𝑦) that is positively correlated with the signal 𝑥? We consider the case of Gaussian vectors 𝑎𝑎𝑖. We prove that—in the high-dimensional limit—a sharp phase transition takes place, and we locate the threshold in the regime of vanishingly small noise. For 𝑛≤𝑑−𝑜(𝑑), no estimator can do significantly better than random and achieve a strictly positive correlation. For 𝑛≥𝑑+𝑜(𝑑), a simple spectral estimator achieves a positive correlation. Surprisingly, numerical simulations with the same spectral estimator demonstrate promising performance with realistic sensing matrices. Spectral methods are used to initialize non-convex optimization algorithms in phase retrieval, and our approach can boost the performance in this setting as well. Our impossibility result is based on classical information-theoretic arguments. The spectral algorithm computes the leading eigenvector of a weighted empirical covariance matrix. We obtain a sharp characterization of the spectral properties of this random matrix using tools from free probability and generalizing a recent result by Lu and Li. Both the upper bound and lower bound generalize beyond phase retrieval to measurements 𝑦𝑖 produced according to a generalized linear model. As a by-product of our analysis, we compare the threshold of the proposed spectral method with that of a message passing algorithm.","lang":"eng"}],"issue":"3","type":"journal_article","oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"6662","status":"public","title":"Fundamental limits of weak recovery with applications to phase retrieval","intvolume":" 19","day":"01","date_published":"2019-06-01T00:00:00Z","publication":"Foundations of Computational Mathematics","citation":{"ista":"Mondelli M, Montanari A. 2019. Fundamental limits of weak recovery with applications to phase retrieval. Foundations of Computational Mathematics. 19(3), 703–773.","apa":"Mondelli, M., & Montanari, A. (2019). Fundamental limits of weak recovery with applications to phase retrieval. Foundations of Computational Mathematics. Springer. https://doi.org/10.1007/s10208-018-9395-y","ieee":"M. Mondelli and A. Montanari, “Fundamental limits of weak recovery with applications to phase retrieval,” Foundations of Computational Mathematics, vol. 19, no. 3. Springer, pp. 703–773, 2019.","ama":"Mondelli M, Montanari A. Fundamental limits of weak recovery with applications to phase retrieval. Foundations of Computational Mathematics. 2019;19(3):703-773. doi:10.1007/s10208-018-9395-y","chicago":"Mondelli, Marco, and Andrea Montanari. “Fundamental Limits of Weak Recovery with Applications to Phase Retrieval.” Foundations of Computational Mathematics. Springer, 2019. https://doi.org/10.1007/s10208-018-9395-y.","mla":"Mondelli, Marco, and Andrea Montanari. “Fundamental Limits of Weak Recovery with Applications to Phase Retrieval.” Foundations of Computational Mathematics, vol. 19, no. 3, Springer, 2019, pp. 703–73, doi:10.1007/s10208-018-9395-y.","short":"M. Mondelli, A. Montanari, Foundations of Computational Mathematics 19 (2019) 703–773."},"article_type":"original","page":"703-773"},{"publication_status":"published","status":"public","title":"Anisotropic triangulations via discrete Riemannian Voronoi diagrams","intvolume":" 48","publisher":"Society for Industrial & Applied Mathematics (SIAM)","_id":"6672","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2019","date_created":"2019-07-24T08:42:12Z","date_updated":"2021-01-12T08:08:30Z","volume":48,"oa_version":"Preprint","author":[{"full_name":"Boissonnat, Jean-Daniel","first_name":"Jean-Daniel","last_name":"Boissonnat"},{"last_name":"Rouxel-Labbé","first_name":"Mael","full_name":"Rouxel-Labbé, Mael"},{"orcid":"0000-0002-7472-2220","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","last_name":"Wintraecken","first_name":"Mathijs","full_name":"Wintraecken, Mathijs"}],"type":"journal_article","extern":"1","abstract":[{"lang":"eng","text":"The construction of anisotropic triangulations is desirable for various applications, such as the numerical solving of partial differential equations and the representation of surfaces in graphics. To solve this notoriously difficult problem in a practical way, we introduce the discrete Riemannian Voronoi diagram, a discrete structure that approximates the Riemannian Voronoi diagram. This structure has been implemented and was shown to lead to good triangulations in $\\mathbb{R}^2$ and on surfaces embedded in $\\mathbb{R}^3$ as detailed in our experimental companion paper. In this paper, we study theoretical aspects of our structure. Given a finite set of points $\\mathcal{P}$ in a domain $\\Omega$ equipped with a Riemannian metric, we compare the discrete Riemannian Voronoi diagram of $\\mathcal{P}$ to its Riemannian Voronoi diagram. Both diagrams have dual structures called the discrete Riemannian Delaunay and the Riemannian Delaunay complex. We provide conditions that guarantee that these dual structures are identical. It then follows from previous results that the discrete Riemannian Delaunay complex can be embedded in $\\Omega$ under sufficient conditions, leading to an anisotropic triangulation with curved simplices. Furthermore, we show that, under similar conditions, the simplices of this triangulation can be straightened."}],"issue":"3","quality_controlled":"1","page":"1046-1097","publication":"SIAM Journal on Computing","external_id":{"arxiv":["1703.06487"]},"main_file_link":[{"url":"https://arxiv.org/abs/1703.06487","open_access":"1"}],"citation":{"ista":"Boissonnat J-D, Rouxel-Labbé M, Wintraecken M. 2019. Anisotropic triangulations via discrete Riemannian Voronoi diagrams. SIAM Journal on Computing. 48(3), 1046–1097.","ieee":"J.-D. Boissonnat, M. Rouxel-Labbé, and M. Wintraecken, “Anisotropic triangulations via discrete Riemannian Voronoi diagrams,” SIAM Journal on Computing, vol. 48, no. 3. Society for Industrial & Applied Mathematics (SIAM), pp. 1046–1097, 2019.","apa":"Boissonnat, J.-D., Rouxel-Labbé, M., & Wintraecken, M. (2019). Anisotropic triangulations via discrete Riemannian Voronoi diagrams. SIAM Journal on Computing. Society for Industrial & Applied Mathematics (SIAM). https://doi.org/10.1137/17m1152292","ama":"Boissonnat J-D, Rouxel-Labbé M, Wintraecken M. Anisotropic triangulations via discrete Riemannian Voronoi diagrams. SIAM Journal on Computing. 2019;48(3):1046-1097. doi:10.1137/17m1152292","chicago":"Boissonnat, Jean-Daniel, Mael Rouxel-Labbé, and Mathijs Wintraecken. “Anisotropic Triangulations via Discrete Riemannian Voronoi Diagrams.” SIAM Journal on Computing. Society for Industrial & Applied Mathematics (SIAM), 2019. https://doi.org/10.1137/17m1152292.","mla":"Boissonnat, Jean-Daniel, et al. “Anisotropic Triangulations via Discrete Riemannian Voronoi Diagrams.” SIAM Journal on Computing, vol. 48, no. 3, Society for Industrial & Applied Mathematics (SIAM), 2019, pp. 1046–97, doi:10.1137/17m1152292.","short":"J.-D. Boissonnat, M. Rouxel-Labbé, M. Wintraecken, SIAM Journal on Computing 48 (2019) 1046–1097."},"oa":1,"language":[{"iso":"eng"}],"doi":"10.1137/17m1152292","date_published":"2019-05-21T00:00:00Z","day":"21","month":"05","publication_identifier":{"eissn":["1095-7111"],"issn":["0097-5397"]}},{"file_date_updated":"2020-07-14T12:47:38Z","ec_funded":1,"author":[{"full_name":"Kolmogorov, Vladimir","first_name":"Vladimir","last_name":"Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87"}],"date_updated":"2021-01-12T08:08:40Z","date_created":"2019-07-29T12:23:29Z","volume":132,"year":"2019","publication_status":"published","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"VlKo"}],"month":"07","publication_identifier":{"isbn":["978-3-95977-109-2"],"issn":["1868-8969"]},"conference":{"end_date":"2019-07-12","start_date":"2019-07-08","location":"Patras, Greece","name":"ICALP 2019: International Colloquim on Automata, Languages and Programming"},"doi":"10.4230/LIPICS.ICALP.2019.77","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":["1803.02289"]},"quality_controlled":"1","project":[{"call_identifier":"FP7","name":"Discrete Optimization in Computer Vision: Theory and Practice","grant_number":"616160","_id":"25FBA906-B435-11E9-9278-68D0E5697425"}],"abstract":[{"lang":"eng","text":"A Valued Constraint Satisfaction Problem (VCSP) provides a common framework that can express a wide range of discrete optimization problems. A VCSP instance is given by a finite set of variables, a finite domain of labels, and an objective function to be minimized. This function is represented as a sum of terms where each term depends on a subset of the variables. To obtain different classes of optimization problems, one can restrict all terms to come from a fixed set Γ of cost functions, called a language. \r\nRecent breakthrough results have established a complete complexity classification of such classes with respect to language Γ: if all cost functions in Γ satisfy a certain algebraic condition then all Γ-instances can be solved in polynomial time, otherwise the problem is NP-hard. Unfortunately, testing this condition for a given language Γ is known to be NP-hard. We thus study exponential algorithms for this meta-problem. We show that the tractability condition of a finite-valued language Γ can be tested in O(3‾√3|D|⋅poly(size(Γ))) time, where D is the domain of Γ and poly(⋅) is some fixed polynomial. We also obtain a matching lower bound under the Strong Exponential Time Hypothesis (SETH). More precisely, we prove that for any constant δ<1 there is no O(3‾√3δ|D|) algorithm, assuming that SETH holds."}],"type":"conference","alternative_title":["LIPIcs"],"oa_version":"Published Version","file":[{"checksum":"f5ebee8eec6ae09e30365578ee63a492","date_updated":"2020-07-14T12:47:38Z","date_created":"2019-07-31T07:01:45Z","relation":"main_file","file_id":"6738","file_size":575475,"content_type":"application/pdf","creator":"dernst","access_level":"open_access","file_name":"2019_LIPICS_Kolmogorov.pdf"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"6725","title":"Testing the complexity of a valued CSP language","status":"public","ddc":["000"],"intvolume":" 132","day":"01","has_accepted_license":"1","scopus_import":1,"date_published":"2019-07-01T00:00:00Z","publication":"46th International Colloquium on Automata, Languages and Programming","citation":{"chicago":"Kolmogorov, Vladimir. “Testing the Complexity of a Valued CSP Language.” In 46th International Colloquium on Automata, Languages and Programming, 132:77:1-77:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.ICALP.2019.77.","mla":"Kolmogorov, Vladimir. “Testing the Complexity of a Valued CSP Language.” 46th International Colloquium on Automata, Languages and Programming, vol. 132, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 77:1-77:12, doi:10.4230/LIPICS.ICALP.2019.77.","short":"V. Kolmogorov, in:, 46th International Colloquium on Automata, Languages and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 77:1-77:12.","ista":"Kolmogorov V. 2019. Testing the complexity of a valued CSP language. 46th International Colloquium on Automata, Languages and Programming. ICALP 2019: International Colloquim on Automata, Languages and Programming, LIPIcs, vol. 132, 77:1-77:12.","apa":"Kolmogorov, V. (2019). Testing the complexity of a valued CSP language. In 46th International Colloquium on Automata, Languages and Programming (Vol. 132, p. 77:1-77:12). Patras, Greece: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ICALP.2019.77","ieee":"V. Kolmogorov, “Testing the complexity of a valued CSP language,” in 46th International Colloquium on Automata, Languages and Programming, Patras, Greece, 2019, vol. 132, p. 77:1-77:12.","ama":"Kolmogorov V. Testing the complexity of a valued CSP language. In: 46th International Colloquium on Automata, Languages and Programming. Vol 132. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019:77:1-77:12. doi:10.4230/LIPICS.ICALP.2019.77"},"page":"77:1-77:12"},{"date_published":"2019-06-29T00:00:00Z","page":"157-180","citation":{"chicago":"Walter, Michael. “Sampling the Integers with Low Relative Error.” In Progress in Cryptology – AFRICACRYPT 2019, edited by J Buchmann, A Nitaj, and T Rachidi, 11627:157–80. LNCS. Cham: Springer Nature, 2019. https://doi.org/10.1007/978-3-030-23696-0_9.","mla":"Walter, Michael. “Sampling the Integers with Low Relative Error.” Progress in Cryptology – AFRICACRYPT 2019, edited by J Buchmann et al., vol. 11627, Springer Nature, 2019, pp. 157–80, doi:10.1007/978-3-030-23696-0_9.","short":"M. Walter, in:, J. Buchmann, A. Nitaj, T. Rachidi (Eds.), Progress in Cryptology – AFRICACRYPT 2019, Springer Nature, Cham, 2019, pp. 157–180.","ista":"Walter M. 2019.Sampling the integers with low relative error. In: Progress in Cryptology – AFRICACRYPT 2019. vol. 11627, 157–180.","apa":"Walter, M. (2019). Sampling the integers with low relative error. In J. Buchmann, A. Nitaj, & T. Rachidi (Eds.), Progress in Cryptology – AFRICACRYPT 2019 (Vol. 11627, pp. 157–180). Cham: Springer Nature. https://doi.org/10.1007/978-3-030-23696-0_9","ieee":"M. Walter, “Sampling the integers with low relative error,” in Progress in Cryptology – AFRICACRYPT 2019, vol. 11627, J. Buchmann, A. Nitaj, and T. Rachidi, Eds. Cham: Springer Nature, 2019, pp. 157–180.","ama":"Walter M. Sampling the integers with low relative error. In: Buchmann J, Nitaj A, Rachidi T, eds. Progress in Cryptology – AFRICACRYPT 2019. Vol 11627. LNCS. Cham: Springer Nature; 2019:157-180. doi:10.1007/978-3-030-23696-0_9"},"publication":"Progress in Cryptology – AFRICACRYPT 2019","article_processing_charge":"No","day":"29","series_title":"LNCS","scopus_import":"1","oa_version":"Preprint","intvolume":" 11627","status":"public","title":"Sampling the integers with low relative error","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","_id":"6726","abstract":[{"text":"Randomness is an essential part of any secure cryptosystem, but many constructions rely on distributions that are not uniform. This is particularly true for lattice based cryptosystems, which more often than not make use of discrete Gaussian distributions over the integers. For practical purposes it is crucial to evaluate the impact that approximation errors have on the security of a scheme to provide the best possible trade-off between security and performance. Recent years have seen surprising results allowing to use relatively low precision while maintaining high levels of security. A key insight in these results is that sampling a distribution with low relative error can provide very strong security guarantees. Since floating point numbers provide guarantees on the relative approximation error, they seem a suitable tool in this setting, but it is not obvious which sampling algorithms can actually profit from them. While previous works have shown that inversion sampling can be adapted to provide a low relative error (Pöppelmann et al., CHES 2014; Prest, ASIACRYPT 2017), other works have called into question if this is possible for other sampling techniques (Zheng et al., Eprint report 2018/309). In this work, we consider all sampling algorithms that are popular in the cryptographic setting and analyze the relationship of floating point precision and the resulting relative error. We show that all of the algorithms either natively achieve a low relative error or can be adapted to do so.","lang":"eng"}],"type":"book_chapter","language":[{"iso":"eng"}],"doi":"10.1007/978-3-030-23696-0_9","conference":{"name":"AFRICACRYPT: International Conference on Cryptology in Africa","location":"Rabat, Morocco","start_date":"2019-07-09","end_date":"2019-07-11"},"project":[{"call_identifier":"H2020","name":"Teaching Old Crypto New Tricks","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","grant_number":"682815"}],"quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2019/068"}],"oa":1,"publication_identifier":{"isbn":["978-3-0302-3695-3"],"issn":["0302-9743","1611-3349"],"eisbn":["978-3-0302-3696-0"]},"month":"06","volume":11627,"date_updated":"2023-02-23T12:50:15Z","date_created":"2019-07-29T12:25:31Z","author":[{"orcid":"0000-0003-3186-2482","id":"488F98B0-F248-11E8-B48F-1D18A9856A87","last_name":"Walter","first_name":"Michael","full_name":"Walter, Michael"}],"publisher":"Springer Nature","editor":[{"first_name":"J","last_name":"Buchmann","full_name":"Buchmann, J"},{"last_name":"Nitaj","first_name":"A","full_name":"Nitaj, A"},{"full_name":"Rachidi, T","first_name":"T","last_name":"Rachidi"}],"department":[{"_id":"KrPi"}],"publication_status":"published","year":"2019","ec_funded":1,"place":"Cham"},{"issue":"5","abstract":[{"text":"Consider the problem of constructing a polar code of block length N for a given transmission channel W. Previous approaches require one to compute the reliability of the N synthetic channels and then use only those that are sufficiently reliable. However, we know from two independent works by Schürch and by Bardet et al. that the synthetic channels are partially ordered with respect to degradation. Hence, it is natural to ask whether the partial order can be exploited to reduce the computational burden of the construction problem. We show that, if we take advantage of the partial order, we can construct a polar code by computing the reliability of roughly a fraction 1/ log 3/2 N of the synthetic channels. In particular, we prove that N/ log 3/2 N is a lower bound on the number of synthetic channels to be considered and such a bound is tight up to a multiplicative factor log log N. This set of roughly N/ log 3/2 N synthetic channels is universal, in the sense that it allows one to construct polar codes for any W, and it can be identified by solving a maximum matching problem on a bipartite graph. Our proof technique consists of reducing the construction problem to the problem of computing the maximum cardinality of an antichain for a suitable partially ordered set. As such, this method is general, and it can be used to further improve the complexity of the construction problem, in case a refined partial order on the synthetic channels of polar codes is discovered.","lang":"eng"}],"extern":"1","type":"journal_article","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"6729"}]},"author":[{"orcid":"0000-0002-3242-7020","id":"27EB676C-8706-11E9-9510-7717E6697425","last_name":"Mondelli","first_name":"Marco","full_name":"Mondelli, Marco"},{"full_name":"Hassani, Hamed","first_name":"Hamed","last_name":"Hassani"},{"full_name":"Urbanke, Rudiger","last_name":"Urbanke","first_name":"Rudiger"}],"volume":65,"oa_version":"Preprint","date_updated":"2023-02-23T12:50:20Z","date_created":"2019-07-23T07:32:57Z","year":"2019","_id":"6663","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"IEEE","intvolume":" 65","publication_status":"published","title":"Construction of polar codes with sublinear complexity","status":"public","day":"01","month":"05","date_published":"2019-05-01T00:00:00Z","doi":"10.1109/tit.2018.2889667","language":[{"iso":"eng"}],"external_id":{"arxiv":["1612.05295"]},"oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1612.05295","open_access":"1"}],"citation":{"ama":"Mondelli M, Hassani H, Urbanke R. Construction of polar codes with sublinear complexity. IEEE. 2019;65(5):2782-2791. doi:10.1109/tit.2018.2889667","ista":"Mondelli M, Hassani H, Urbanke R. 2019. Construction of polar codes with sublinear complexity. IEEE. 65(5), 2782–2791.","ieee":"M. Mondelli, H. Hassani, and R. Urbanke, “Construction of polar codes with sublinear complexity,” IEEE, vol. 65, no. 5. IEEE, pp. 2782–2791, 2019.","apa":"Mondelli, M., Hassani, H., & Urbanke, R. (2019). Construction of polar codes with sublinear complexity. IEEE. IEEE. https://doi.org/10.1109/tit.2018.2889667","mla":"Mondelli, Marco, et al. “Construction of Polar Codes with Sublinear Complexity.” IEEE, vol. 65, no. 5, IEEE, 2019, pp. 2782–91, doi:10.1109/tit.2018.2889667.","short":"M. Mondelli, H. Hassani, R. Urbanke, IEEE 65 (2019) 2782–2791.","chicago":"Mondelli, Marco, Hamed Hassani, and Rudiger Urbanke. “Construction of Polar Codes with Sublinear Complexity.” IEEE. IEEE, 2019. https://doi.org/10.1109/tit.2018.2889667."},"publication":"IEEE","page":"2782-2791","quality_controlled":"1"},{"abstract":[{"lang":"eng","text":"We establish connections between the problem of learning a two-layer neural network and tensor decomposition. We consider a model with feature vectors x∈ℝd, r hidden units with weights {wi}1≤i≤r and output y∈ℝ, i.e., y=∑ri=1σ(w𝖳ix), with activation functions given by low-degree polynomials. In particular, if σ(x)=a0+a1x+a3x3, we prove that no polynomial-time learning algorithm can outperform the trivial predictor that assigns to each example the response variable 𝔼(y), when d3/2≪r≪d2. Our conclusion holds for a `natural data distribution', namely standard Gaussian feature vectors x, and output distributed according to a two-layer neural network with random isotropic weights, and under a certain complexity-theoretic assumption on tensor decomposition. Roughly speaking, we assume that no polynomial-time algorithm can substantially outperform current methods for tensor decomposition based on the sum-of-squares hierarchy. We also prove generalizations of this statement for higher degree polynomial activations, and non-random weight vectors. Remarkably, several existing algorithms for learning two-layer networks with rigorous guarantees are based on tensor decomposition. Our results support the idea that this is indeed the core computational difficulty in learning such networks, under the stated generative model for the data. As a side result, we show that under this model learning the network requires accurate learning of its weights, a property that does not hold in a more general setting. "}],"extern":"1","type":"conference","author":[{"first_name":"Marco","last_name":"Mondelli","id":"27EB676C-8706-11E9-9510-7717E6697425","orcid":"0000-0002-3242-7020","full_name":"Mondelli, Marco"},{"last_name":"Montanari","first_name":"Andrea","full_name":"Montanari, Andrea"}],"oa_version":"Preprint","volume":89,"date_created":"2019-07-31T09:31:26Z","date_updated":"2021-01-12T08:08:49Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"6747","year":"2019","publisher":"Proceedings of Machine Learning Research","intvolume":" 89","status":"public","publication_status":"published","title":"On the connection between learning two-layers neural networks and tensor decomposition","article_processing_charge":"No","day":"01","month":"04","date_published":"2019-04-01T00:00:00Z","conference":{"end_date":"2019-04-18","start_date":"2019-04-16","location":"Naha, Okinawa, Japan","name":"AISTATS: Artificial Intelligence and Statistics"},"language":[{"iso":"eng"}],"citation":{"ista":"Mondelli M, Montanari A. 2019. On the connection between learning two-layers neural networks and tensor decomposition. Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics. AISTATS: Artificial Intelligence and Statistics vol. 89, 1051–1060.","ieee":"M. Mondelli and A. Montanari, “On the connection between learning two-layers neural networks and tensor decomposition,” in Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, Naha, Okinawa, Japan, 2019, vol. 89, pp. 1051–1060.","apa":"Mondelli, M., & Montanari, A. (2019). On the connection between learning two-layers neural networks and tensor decomposition. In Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics (Vol. 89, pp. 1051–1060). Naha, Okinawa, Japan: Proceedings of Machine Learning Research.","ama":"Mondelli M, Montanari A. On the connection between learning two-layers neural networks and tensor decomposition. In: Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics. Vol 89. Proceedings of Machine Learning Research; 2019:1051-1060.","chicago":"Mondelli, Marco, and Andrea Montanari. “On the Connection between Learning Two-Layers Neural Networks and Tensor Decomposition.” In Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, 89:1051–60. Proceedings of Machine Learning Research, 2019.","mla":"Mondelli, Marco, and Andrea Montanari. “On the Connection between Learning Two-Layers Neural Networks and Tensor Decomposition.” Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, vol. 89, Proceedings of Machine Learning Research, 2019, pp. 1051–60.","short":"M. Mondelli, A. Montanari, in:, Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, Proceedings of Machine Learning Research, 2019, pp. 1051–1060."},"main_file_link":[{"url":"https://arxiv.org/abs/1802.07301","open_access":"1"}],"external_id":{"arxiv":["1802.07301"]},"oa":1,"publication":"Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics","page":"1051-1060","quality_controlled":"1"},{"volume":67,"date_created":"2019-07-31T09:51:14Z","date_updated":"2021-01-12T08:08:51Z","author":[{"full_name":"Hashemi, Seyyed Ali","first_name":"Seyyed Ali","last_name":"Hashemi"},{"full_name":"Condo, Carlo","first_name":"Carlo","last_name":"Condo"},{"orcid":"0000-0002-3242-7020","id":"27EB676C-8706-11E9-9510-7717E6697425","last_name":"Mondelli","first_name":"Marco","full_name":"Mondelli, Marco"},{"first_name":"Warren J","last_name":"Gross","full_name":"Gross, Warren J"}],"department":[{"_id":"MaMo"}],"publisher":"IEEE","publication_status":"published","year":"2019","article_number":"8854897","language":[{"iso":"eng"}],"doi":"10.1109/TSP.2019.2944738","quality_controlled":"1","oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1903.09203"}],"external_id":{"arxiv":["1903.09203"]},"publication_identifier":{"issn":["1053587X"]},"month":"11","oa_version":"Preprint","intvolume":" 67","title":"Rate-flexible fast polar decoders","status":"public","user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425","_id":"6750","issue":"22","abstract":[{"text":"Polar codes have gained extensive attention during the past few years and recently they have been selected for the next generation of wireless communications standards (5G). Successive-cancellation-based (SC-based) decoders, such as SC list (SCL) and SC flip (SCF), provide a reasonable error performance for polar codes at the cost of low decoding speed. Fast SC-based decoders, such as Fast-SSC, Fast-SSCL, and Fast-SSCF, identify the special constituent codes in a polar code graph off-line, produce a list of operations, store the list in memory, and feed the list to the decoder to decode the constituent codes in order efficiently, thus increasing the decoding speed. However, the list of operations is dependent on the code rate and as the rate changes, a new list is produced, making fast SC-based decoders not rate-flexible. In this paper, we propose a completely rate-flexible fast SC-based decoder by creating the list of operations directly in hardware, with low implementation complexity. We further propose a hardware architecture implementing the proposed method and show that the area occupation of the rate-flexible fast SC-based decoder in this paper is only 38% of the total area of the memory-based base-line decoder when 5G code rates are supported. ","lang":"eng"}],"type":"journal_article","date_published":"2019-11-15T00:00:00Z","article_type":"original","citation":{"ama":"Hashemi SA, Condo C, Mondelli M, Gross WJ. Rate-flexible fast polar decoders. IEEE Transactions on Signal Processing. 2019;67(22). doi:10.1109/TSP.2019.2944738","ista":"Hashemi SA, Condo C, Mondelli M, Gross WJ. 2019. Rate-flexible fast polar decoders. IEEE Transactions on Signal Processing. 67(22), 8854897.","apa":"Hashemi, S. A., Condo, C., Mondelli, M., & Gross, W. J. (2019). Rate-flexible fast polar decoders. IEEE Transactions on Signal Processing. IEEE. https://doi.org/10.1109/TSP.2019.2944738","ieee":"S. A. Hashemi, C. Condo, M. Mondelli, and W. J. Gross, “Rate-flexible fast polar decoders,” IEEE Transactions on Signal Processing, vol. 67, no. 22. IEEE, 2019.","mla":"Hashemi, Seyyed Ali, et al. “Rate-Flexible Fast Polar Decoders.” IEEE Transactions on Signal Processing, vol. 67, no. 22, 8854897, IEEE, 2019, doi:10.1109/TSP.2019.2944738.","short":"S.A. Hashemi, C. Condo, M. Mondelli, W.J. Gross, IEEE Transactions on Signal Processing 67 (2019).","chicago":"Hashemi, Seyyed Ali, Carlo Condo, Marco Mondelli, and Warren J Gross. “Rate-Flexible Fast Polar Decoders.” IEEE Transactions on Signal Processing. IEEE, 2019. https://doi.org/10.1109/TSP.2019.2944738."},"publication":"IEEE Transactions on Signal Processing","article_processing_charge":"No","day":"15","scopus_import":1},{"article_type":"original","publication":"Electronic Journal of Combinatorics","citation":{"chicago":"Jelínek, Vít, and Martin Töpfer. “On Grounded L-Graphs and Their Relatives.” Electronic Journal of Combinatorics. Electronic Journal of Combinatorics, 2019. https://doi.org/10.37236/8096.","short":"V. Jelínek, M. Töpfer, Electronic Journal of Combinatorics 26 (2019).","mla":"Jelínek, Vít, and Martin Töpfer. “On Grounded L-Graphs and Their Relatives.” Electronic Journal of Combinatorics, vol. 26, no. 3, P3.17, Electronic Journal of Combinatorics, 2019, doi:10.37236/8096.","apa":"Jelínek, V., & Töpfer, M. (2019). On grounded L-graphs and their relatives. Electronic Journal of Combinatorics. Electronic Journal of Combinatorics. https://doi.org/10.37236/8096","ieee":"V. Jelínek and M. Töpfer, “On grounded L-graphs and their relatives,” Electronic Journal of Combinatorics, vol. 26, no. 3. Electronic Journal of Combinatorics, 2019.","ista":"Jelínek V, Töpfer M. 2019. On grounded L-graphs and their relatives. Electronic Journal of Combinatorics. 26(3), P3.17.","ama":"Jelínek V, Töpfer M. On grounded L-graphs and their relatives. Electronic Journal of Combinatorics. 2019;26(3). doi:10.37236/8096"},"date_published":"2019-07-19T00:00:00Z","scopus_import":"1","day":"19","has_accepted_license":"1","article_processing_charge":"No","ddc":["510"],"status":"public","title":"On grounded L-graphs and their relatives","intvolume":" 26","_id":"6759","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"relation":"main_file","file_id":"6764","date_created":"2019-08-05T06:46:55Z","date_updated":"2020-07-14T12:47:39Z","checksum":"20fc366fc6683ef0b074a019b73a663a","file_name":"2019_eJourCombinatorics_Jelinek.pdf","access_level":"open_access","file_size":533697,"content_type":"application/pdf","creator":"dernst"}],"oa_version":"Published Version","type":"journal_article","abstract":[{"lang":"eng","text":"We consider the graph class Grounded-L corresponding to graphs that admit an intersection representation by L-shaped curves, where additionally the topmost points of each curve are assumed to belong to a common horizontal line. We prove that Grounded-L graphs admit an equivalent characterisation in terms of vertex ordering with forbidden patterns. \r\nWe also compare this class to related intersection classes, such as the grounded segment graphs, the monotone L-graphs (a.k.a. max point-tolerance graphs), or the outer-1-string graphs. We give constructions showing that these classes are all distinct and satisfy only trivial or previously known inclusions."}],"issue":"3","quality_controlled":"1","project":[{"name":"International IST Doctoral Program","call_identifier":"H2020","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"}],"external_id":{"arxiv":["1808.04148"]},"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.37236/8096","month":"07","publication_identifier":{"eissn":["10778926"]},"publication_status":"published","department":[{"_id":"DaAl"}],"publisher":"Electronic Journal of Combinatorics","year":"2019","date_updated":"2022-03-18T12:32:02Z","date_created":"2019-08-04T21:59:20Z","volume":26,"author":[{"full_name":"Jelínek, Vít","first_name":"Vít","last_name":"Jelínek"},{"full_name":"Töpfer, Martin","first_name":"Martin","last_name":"Töpfer","id":"4B865388-F248-11E8-B48F-1D18A9856A87"}],"article_number":"P3.17","file_date_updated":"2020-07-14T12:47:39Z","ec_funded":1},{"publication":" Proceedings of the 13th International Conference of Reachability Problems","citation":{"ista":"Avni G, Henzinger TA, Ibsen-Jensen R, Novotny P. 2019. Bidding games on Markov decision processes. Proceedings of the 13th International Conference of Reachability Problems. RP: Reachability Problems, LNCS, vol. 11674, 1–12.","ieee":"G. Avni, T. A. Henzinger, R. Ibsen-Jensen, and P. Novotny, “Bidding games on Markov decision processes,” in Proceedings of the 13th International Conference of Reachability Problems, Brussels, Belgium, 2019, vol. 11674, pp. 1–12.","apa":"Avni, G., Henzinger, T. A., Ibsen-Jensen, R., & Novotny, P. (2019). Bidding games on Markov decision processes. In Proceedings of the 13th International Conference of Reachability Problems (Vol. 11674, pp. 1–12). Brussels, Belgium: Springer. https://doi.org/10.1007/978-3-030-30806-3_1","ama":"Avni G, Henzinger TA, Ibsen-Jensen R, Novotny P. Bidding games on Markov decision processes. In: Proceedings of the 13th International Conference of Reachability Problems. Vol 11674. Springer; 2019:1-12. doi:10.1007/978-3-030-30806-3_1","chicago":"Avni, Guy, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Petr Novotny. “Bidding Games on Markov Decision Processes.” In Proceedings of the 13th International Conference of Reachability Problems, 11674:1–12. Springer, 2019. https://doi.org/10.1007/978-3-030-30806-3_1.","mla":"Avni, Guy, et al. “Bidding Games on Markov Decision Processes.” Proceedings of the 13th International Conference of Reachability Problems, vol. 11674, Springer, 2019, pp. 1–12, doi:10.1007/978-3-030-30806-3_1.","short":"G. Avni, T.A. Henzinger, R. Ibsen-Jensen, P. Novotny, in:, Proceedings of the 13th International Conference of Reachability Problems, Springer, 2019, pp. 1–12."},"page":"1-12","date_published":"2019-09-06T00:00:00Z","scopus_import":1,"day":"06","has_accepted_license":"1","_id":"6822","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000"],"status":"public","title":"Bidding games on Markov decision processes","intvolume":" 11674","oa_version":"Submitted Version","file":[{"access_level":"open_access","file_name":"prob.pdf","file_size":436635,"content_type":"application/pdf","creator":"gavni","relation":"main_file","file_id":"6823","checksum":"45ebbc709af2b247d28c7c293c01504b","date_created":"2019-08-19T07:56:40Z","date_updated":"2020-07-14T12:47:41Z"}],"type":"conference","alternative_title":["LNCS"],"abstract":[{"text":"In two-player games on graphs, the players move a token through a graph to produce an infinite path, which determines the qualitative winner or quantitative payoff of the game. In bidding games, in each turn, we hold an auction between the two players to determine which player moves the token. Bidding games have largely been studied with concrete bidding mechanisms that are variants of a first-price auction: in each turn both players simultaneously submit bids, the higher\r\nbidder moves the token, and pays his bid to the lower bidder in Richman bidding, to the bank in poorman bidding, and in taxman bidding, the bid is split between the other player and the bank according to a predefined constant factor. Bidding games are deterministic games. They have an intriguing connection with a fragment of stochastic games called \r\n randomturn games. We study, for the first time, a combination of bidding games with probabilistic behavior; namely, we study bidding games that are played on Markov decision processes, where the players bid for the right to choose the next action, which determines the probability distribution according to which the next vertex is chosen. We study parity and meanpayoff bidding games on MDPs and extend results from the deterministic bidding setting to the probabilistic one.","lang":"eng"}],"oa":1,"quality_controlled":"1","project":[{"grant_number":"M02369","_id":"264B3912-B435-11E9-9278-68D0E5697425","name":"Formal Methods meets Algorithmic Game Theory","call_identifier":"FWF"},{"grant_number":"S11402-N23","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"name":"The Wittgenstein Prize","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211"}],"conference":{"start_date":"2019-09-11","location":"Brussels, Belgium","end_date":"2019-09-13","name":"RP: Reachability Problems"},"doi":"10.1007/978-3-030-30806-3_1","language":[{"iso":"eng"}],"month":"09","publication_identifier":{"issn":["0302-9743"],"isbn":["978-303030805-6"]},"year":"2019","publication_status":"published","publisher":"Springer","department":[{"_id":"ToHe"}],"author":[{"full_name":"Avni, Guy","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5588-8287","first_name":"Guy","last_name":"Avni"},{"last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"full_name":"Ibsen-Jensen, Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4783-0389","first_name":"Rasmus","last_name":"Ibsen-Jensen"},{"last_name":"Novotny","first_name":"Petr","full_name":"Novotny, Petr"}],"date_updated":"2021-01-12T08:09:12Z","date_created":"2019-08-19T07:58:10Z","volume":11674,"file_date_updated":"2020-07-14T12:47:41Z"},{"date_published":"2019-08-01T00:00:00Z","citation":{"mla":"Chatterjee, Krishnendu, et al. “Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs.” Leibniz International Proceedings in Informatics, vol. 140, 7, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.CONCUR.2019.7.","short":"K. Chatterjee, W. Dvorák, M.H. Henzinger, A. Svozil, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.","chicago":"Chatterjee, Krishnendu, Wolfgang Dvorák, Monika H Henzinger, and Alexander Svozil. “Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs.” In Leibniz International Proceedings in Informatics, Vol. 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.CONCUR.2019.7.","ama":"Chatterjee K, Dvorák W, Henzinger MH, Svozil A. Near-linear time algorithms for Streett objectives in graphs and MDPs. In: Leibniz International Proceedings in Informatics. Vol 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.CONCUR.2019.7","ista":"Chatterjee K, Dvorák W, Henzinger MH, Svozil A. 2019. Near-linear time algorithms for Streett objectives in graphs and MDPs. Leibniz International Proceedings in Informatics. CONCUR: International Conference on Concurrency Theory, LIPIcs, vol. 140, 7.","apa":"Chatterjee, K., Dvorák, W., Henzinger, M. H., & Svozil, A. (2019). Near-linear time algorithms for Streett objectives in graphs and MDPs. In Leibniz International Proceedings in Informatics (Vol. 140). Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.CONCUR.2019.7","ieee":"K. Chatterjee, W. Dvorák, M. H. Henzinger, and A. Svozil, “Near-linear time algorithms for Streett objectives in graphs and MDPs,” in Leibniz International Proceedings in Informatics, Amsterdam, Netherlands, 2019, vol. 140."},"publication":"Leibniz International Proceedings in Informatics","article_processing_charge":"No","has_accepted_license":"1","day":"01","scopus_import":"1","oa_version":"Published Version","file":[{"access_level":"open_access","file_name":"2019_LIPIcs_Chatterjee.pdf","creator":"kschuh","file_size":730112,"content_type":"application/pdf","file_id":"6922","relation":"main_file","checksum":"e1f0e4061212454574f34a1368d018ec","date_created":"2019-10-01T08:20:30Z","date_updated":"2020-07-14T12:47:43Z"}],"intvolume":" 140","title":"Near-linear time algorithms for Streett objectives in graphs and MDPs","ddc":["000"],"status":"public","_id":"6887","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","abstract":[{"lang":"eng","text":"The fundamental model-checking problem, given as input a model and a specification, asks for the algorithmic verification of whether the model satisfies the specification. Two classical models for reactive systems are graphs and Markov decision processes (MDPs). A basic specification formalism in the verification of reactive systems is the strong fairness (aka Streett) objective, where given different types of requests and corresponding grants, the requirement is that for each type, if the request event happens infinitely often, then the corresponding grant event must also happen infinitely often. All omega-regular objectives can be expressed as Streett objectives and hence they are canonical in verification. Consider graphs/MDPs with n vertices, m edges, and a Streett objectives with k pairs, and let b denote the size of the description of the Streett objective for the sets of requests and grants. The current best-known algorithm for the problem requires time O(min(n^2, m sqrt{m log n}) + b log n). In this work we present randomized near-linear time algorithms, with expected running time O~(m + b), where the O~ notation hides poly-log factors. Our randomized algorithms are near-linear in the size of the input, and hence optimal up to poly-log factors. "}],"alternative_title":["LIPIcs"],"type":"conference","language":[{"iso":"eng"}],"doi":"10.4230/LIPICS.CONCUR.2019.7","conference":{"location":"Amsterdam, Netherlands","start_date":"2019-08-27","end_date":"2019-08-30","name":"CONCUR: International Conference on Concurrency Theory"},"project":[{"name":"Game Theory","call_identifier":"FWF","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"}],"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"},"oa":1,"month":"08","volume":140,"date_updated":"2022-08-12T10:54:34Z","date_created":"2019-09-18T08:07:58Z","author":[{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"last_name":"Dvorák","first_name":"Wolfgang","full_name":"Dvorák, Wolfgang"},{"full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","first_name":"Monika H"},{"full_name":"Svozil, Alexander","first_name":"Alexander","last_name":"Svozil"}],"department":[{"_id":"KrCh"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","publication_status":"published","year":"2019","ec_funded":1,"file_date_updated":"2020-07-14T12:47:43Z","article_number":"7"},{"title":"Designing worm-inspired neural networks for interpretable robotic control","ddc":["000"],"status":"public","_id":"6888","user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425","file":[{"file_name":"2019_ICRA_Lechner.pdf","access_level":"open_access","creator":"dernst","file_size":3265107,"content_type":"application/pdf","file_id":"8636","relation":"main_file","date_created":"2020-10-08T17:30:38Z","date_updated":"2020-10-08T17:30:38Z","success":1,"checksum":"f5545a6b60c3ffd01feb3613f81d03b6"}],"oa_version":"Submitted Version","alternative_title":["ICRA"],"type":"conference","abstract":[{"text":"In this paper, we design novel liquid time-constant recurrent neural networks for robotic control, inspired by the brain of the nematode, C. elegans. In the worm's nervous system, neurons communicate through nonlinear time-varying synaptic links established amongst them by their particular wiring structure. This property enables neurons to express liquid time-constants dynamics and therefore allows the network to originate complex behaviors with a small number of neurons. We identify neuron-pair communication motifs as design operators and use them to configure compact neuronal network structures to govern sequential robotic tasks. The networks are systematically designed to map the environmental observations to motor actions, by their hierarchical topology from sensory neurons, through recurrently-wired interneurons, to motor neurons. The networks are then parametrized in a supervised-learning scheme by a search-based algorithm. We demonstrate that obtained networks realize interpretable dynamics. We evaluate their performance in controlling mobile and arm robots, and compare their attributes to other artificial neural network-based control agents. Finally, we experimentally show their superior resilience to environmental noise, compared to the existing machine learning-based methods.","lang":"eng"}],"citation":{"ama":"Lechner M, Hasani R, Zimmer M, Henzinger TA, Grosu R. Designing worm-inspired neural networks for interpretable robotic control. In: Proceedings - IEEE International Conference on Robotics and Automation. Vol 2019-May. IEEE; 2019. doi:10.1109/icra.2019.8793840","ista":"Lechner M, Hasani R, Zimmer M, Henzinger TA, Grosu R. 2019. Designing worm-inspired neural networks for interpretable robotic control. Proceedings - IEEE International Conference on Robotics and Automation. ICRA: International Conference on Robotics and Automation, ICRA, vol. 2019–May, 8793840.","apa":"Lechner, M., Hasani, R., Zimmer, M., Henzinger, T. A., & Grosu, R. (2019). Designing worm-inspired neural networks for interpretable robotic control. In Proceedings - IEEE International Conference on Robotics and Automation (Vol. 2019–May). Montreal, QC, Canada: IEEE. https://doi.org/10.1109/icra.2019.8793840","ieee":"M. Lechner, R. Hasani, M. Zimmer, T. A. Henzinger, and R. Grosu, “Designing worm-inspired neural networks for interpretable robotic control,” in Proceedings - IEEE International Conference on Robotics and Automation, Montreal, QC, Canada, 2019, vol. 2019–May.","mla":"Lechner, Mathias, et al. “Designing Worm-Inspired Neural Networks for Interpretable Robotic Control.” Proceedings - IEEE International Conference on Robotics and Automation, vol. 2019–May, 8793840, IEEE, 2019, doi:10.1109/icra.2019.8793840.","short":"M. Lechner, R. Hasani, M. Zimmer, T.A. Henzinger, R. Grosu, in:, Proceedings - IEEE International Conference on Robotics and Automation, IEEE, 2019.","chicago":"Lechner, Mathias, Ramin Hasani, Manuel Zimmer, Thomas A Henzinger, and Radu Grosu. “Designing Worm-Inspired Neural Networks for Interpretable Robotic Control.” In Proceedings - IEEE International Conference on Robotics and Automation, Vol. 2019–May. IEEE, 2019. https://doi.org/10.1109/icra.2019.8793840."},"publication":"Proceedings - IEEE International Conference on Robotics and Automation","date_published":"2019-05-01T00:00:00Z","scopus_import":"1","article_processing_charge":"No","has_accepted_license":"1","day":"01","department":[{"_id":"ToHe"}],"publisher":"IEEE","publication_status":"published","year":"2019","volume":"2019-May","date_created":"2019-09-18T08:09:51Z","date_updated":"2021-01-12T08:09:28Z","author":[{"last_name":"Lechner","first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias"},{"last_name":"Hasani","first_name":"Ramin","full_name":"Hasani, Ramin"},{"full_name":"Zimmer, Manuel","first_name":"Manuel","last_name":"Zimmer"},{"first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"},{"last_name":"Grosu","first_name":"Radu","full_name":"Grosu, Radu"}],"article_number":"8793840","file_date_updated":"2020-10-08T17:30:38Z","project":[{"name":"The Wittgenstein Prize","call_identifier":"FWF","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","oa":1,"language":[{"iso":"eng"}],"doi":"10.1109/icra.2019.8793840","conference":{"name":"ICRA: International Conference on Robotics and Automation","end_date":"2019-05-24","location":"Montreal, QC, Canada","start_date":"2019-05-20"},"publication_identifier":{"isbn":["9781538660270"]},"month":"05"},{"abstract":[{"lang":"eng","text":"In two-player games on graphs, the players move a token through a graph to produce an infinite path, which determines the winner of the game. Such games are central in formal methods since they model the interaction between a non-terminating system and its environment. In bidding games the players bid for the right to move the token: in each round, the players simultaneously submit bids, and the higher bidder moves the token and pays the other player. Bidding games are known to have a clean and elegant mathematical structure that relies on the ability of the players to submit arbitrarily small bids. Many applications, however, require a fixed granularity for the bids, which can represent, for example, the monetary value expressed in cents. We study, for the first time, the combination of discrete-bidding and infinite-duration games. Our most important result proves that these games form a large determined subclass of concurrent games, where determinacy is the strong property that there always exists exactly one player who can guarantee winning the game. In particular, we show that, in contrast to non-discrete bidding games, the mechanism with which tied bids are resolved plays an important role in discrete-bidding games. We study several natural tie-breaking mechanisms and show that, while some do not admit determinacy, most natural mechanisms imply determinacy for every pair of initial budgets. "}],"type":"conference","alternative_title":["LIPIcs"],"oa_version":"Published Version","file":[{"checksum":"4df6d3575c506edb17215adada03cc8e","date_created":"2019-09-27T12:21:38Z","date_updated":"2020-07-14T12:47:43Z","file_id":"6915","relation":"main_file","creator":"kschuh","file_size":741425,"content_type":"application/pdf","access_level":"open_access","file_name":"2019_LIPIcs_Aghajohari.pdf"}],"_id":"6886","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","title":"Determinacy in discrete-bidding infinite-duration games","ddc":["000"],"status":"public","intvolume":" 140","day":"01","has_accepted_license":"1","article_processing_charge":"No","scopus_import":"1","date_published":"2019-08-01T00:00:00Z","citation":{"apa":"Aghajohari, M., Avni, G., & Henzinger, T. A. (2019). Determinacy in discrete-bidding infinite-duration games (Vol. 140). Presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.CONCUR.2019.20","ieee":"M. Aghajohari, G. Avni, and T. A. Henzinger, “Determinacy in discrete-bidding infinite-duration games,” presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands, 2019, vol. 140.","ista":"Aghajohari M, Avni G, Henzinger TA. 2019. Determinacy in discrete-bidding infinite-duration games. CONCUR: International Conference on Concurrency Theory, LIPIcs, vol. 140, 20.","ama":"Aghajohari M, Avni G, Henzinger TA. Determinacy in discrete-bidding infinite-duration games. In: Vol 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.CONCUR.2019.20","chicago":"Aghajohari, Milad, Guy Avni, and Thomas A Henzinger. “Determinacy in Discrete-Bidding Infinite-Duration Games,” Vol. 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.CONCUR.2019.20.","short":"M. Aghajohari, G. Avni, T.A. Henzinger, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.","mla":"Aghajohari, Milad, et al. Determinacy in Discrete-Bidding Infinite-Duration Games. Vol. 140, 20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.CONCUR.2019.20."},"file_date_updated":"2020-07-14T12:47:43Z","license":"https://creativecommons.org/licenses/by/3.0/","article_number":"20","author":[{"last_name":"Aghajohari","first_name":"Milad","full_name":"Aghajohari, Milad"},{"full_name":"Avni, Guy","first_name":"Guy","last_name":"Avni","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5588-8287"},{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A"}],"date_created":"2019-09-18T08:06:58Z","date_updated":"2022-01-26T08:27:10Z","volume":140,"year":"2019","publication_status":"published","department":[{"_id":"ToHe"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","month":"08","conference":{"location":"Amsterdam, Netherlands","start_date":"2019-08-27","end_date":"2019-08-30","name":"CONCUR: International Conference on Concurrency Theory"},"doi":"10.4230/LIPICS.CONCUR.2019.20","language":[{"iso":"eng"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","short":"CC BY (3.0)","image":"/images/cc_by.png"},"oa":1,"external_id":{"arxiv":["1905.03588"]},"quality_controlled":"1","project":[{"grant_number":"S11402-N23","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"name":"Formal Methods meets Algorithmic Game Theory","call_identifier":"FWF","grant_number":"M02369","_id":"264B3912-B435-11E9-9278-68D0E5697425"}]},{"_id":"6885","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","intvolume":" 140","title":"Long-run average behavior of vector addition systems with states","ddc":["000"],"status":"public","file":[{"creator":"kschuh","content_type":"application/pdf","file_size":538120,"file_name":"2019_LIPIcs_Chatterjee.pdf","access_level":"open_access","date_created":"2019-09-27T12:09:35Z","date_updated":"2020-07-14T12:47:43Z","checksum":"4985e26e1572d1575d64d38acabd71d6","file_id":"6914","relation":"main_file"}],"oa_version":"Published Version","type":"conference","alternative_title":["LIPIcs"],"abstract":[{"text":"A vector addition system with states (VASS) consists of a finite set of states and counters. A configuration is a state and a value for each counter; a transition changes the state and each counter is incremented, decremented, or left unchanged. While qualitative properties such as state and configuration reachability have been studied for VASS, we consider the long-run average cost of infinite computations of VASS. The cost of a configuration is for each state, a linear combination of the counter values. In the special case of uniform cost functions, the linear combination is the same for all states. The (regular) long-run emptiness problem is, given a VASS, a cost function, and a threshold value, if there is a (lasso-shaped) computation such that the long-run average value of the cost function does not exceed the threshold. For uniform cost functions, we show that the regular long-run emptiness problem is (a) decidable in polynomial time for integer-valued VASS, and (b) decidable but nonelementarily hard for natural-valued VASS (i.e., nonnegative counters). For general cost functions, we show that the problem is (c) NP-complete for integer-valued VASS, and (d) undecidable for natural-valued VASS. Our most interesting result is for (c) integer-valued VASS with general cost functions, where we establish a connection between the regular long-run emptiness problem and quadratic Diophantine inequalities. The general (nonregular) long-run emptiness problem is equally hard as the regular problem in all cases except (c), where it remains open. ","lang":"eng"}],"citation":{"ama":"Chatterjee K, Henzinger TA, Otop J. Long-run average behavior of vector addition systems with states. In: Vol 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.CONCUR.2019.27","ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, “Long-run average behavior of vector addition systems with states,” presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands, 2019, vol. 140.","apa":"Chatterjee, K., Henzinger, T. A., & Otop, J. (2019). Long-run average behavior of vector addition systems with states (Vol. 140). Presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.CONCUR.2019.27","ista":"Chatterjee K, Henzinger TA, Otop J. 2019. Long-run average behavior of vector addition systems with states. CONCUR: International Conference on Concurrency Theory, LIPIcs, vol. 140, 27.","short":"K. Chatterjee, T.A. Henzinger, J. Otop, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.","mla":"Chatterjee, Krishnendu, et al. Long-Run Average Behavior of Vector Addition Systems with States. Vol. 140, 27, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.CONCUR.2019.27.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Long-Run Average Behavior of Vector Addition Systems with States,” Vol. 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.CONCUR.2019.27."},"date_published":"2019-08-01T00:00:00Z","scopus_import":1,"has_accepted_license":"1","day":"01","year":"2019","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"publication_status":"published","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"},{"first_name":"Jan","last_name":"Otop","full_name":"Otop, Jan"}],"volume":140,"date_created":"2019-09-18T08:06:14Z","date_updated":"2021-01-12T08:09:27Z","article_number":"27","file_date_updated":"2020-07-14T12:47:43Z","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"},"project":[{"grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Game Theory"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23"}],"quality_controlled":"1","doi":"10.4230/LIPICS.CONCUR.2019.27","conference":{"name":"CONCUR: International Conference on Concurrency Theory","start_date":"2019-08-27","location":"Amsterdam, Netherlands","end_date":"2019-08-30"},"language":[{"iso":"eng"}],"month":"08"},{"year":"2019","publication_status":"published","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"KrCh"}],"author":[{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"full_name":"Piterman, Nir","last_name":"Piterman","first_name":"Nir"}],"date_created":"2019-09-18T08:11:43Z","date_updated":"2021-01-12T08:09:28Z","volume":140,"article_number":"6","file_date_updated":"2020-07-14T12:47:43Z","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"},"quality_controlled":"1","project":[{"grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","call_identifier":"FWF"},{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification"}],"conference":{"end_date":"2019-08-30","location":"Amsterdam, Netherlands","start_date":"2019-08-27","name":"CONCUR: International Conference on Concurrency Theory"},"doi":"10.4230/LIPICS.CONCUR.2019.6","language":[{"iso":"eng"}],"month":"08","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"6889","ddc":["000"],"title":"Combinations of Qualitative Winning for Stochastic Parity Games","status":"public","intvolume":" 140","oa_version":"Published Version","file":[{"file_name":"2019_LIPIcs_Chatterjee.pdf","access_level":"open_access","file_size":509163,"content_type":"application/pdf","creator":"kschuh","relation":"main_file","file_id":"6923","date_created":"2019-10-01T08:49:45Z","date_updated":"2020-07-14T12:47:43Z","checksum":"7b2ecfd4d9d02360308c0ca986fc10a7"}],"type":"conference","alternative_title":["LIPIcs"],"abstract":[{"text":"We study Markov decision processes and turn-based stochastic games with parity conditions. There are three qualitative winning criteria, namely, sure winning, which requires all paths to satisfy the condition, almost-sure winning, which requires the condition to be satisfied with probability 1, and limit-sure winning, which requires the condition to be satisfied with probability arbitrarily close to 1. We study the combination of two of these criteria for parity conditions, e.g., there are two parity conditions one of which must be won surely, and the other almost-surely. The problem has been studied recently by Berthon et al. for MDPs with combination of sure and almost-sure winning, under infinite-memory strategies, and the problem has been established to be in NP cap co-NP. Even in MDPs there is a difference between finite-memory and infinite-memory strategies. Our main results for combination of sure and almost-sure winning are as follows: (a) we show that for MDPs with finite-memory strategies the problem is in NP cap co-NP; (b) we show that for turn-based stochastic games the problem is co-NP-complete, both for finite-memory and infinite-memory strategies; and (c) we present algorithmic results for the finite-memory case, both for MDPs and turn-based stochastic games, by reduction to non-stochastic parity games. In addition we show that all the above complexity results also carry over to combination of sure and limit-sure winning, and results for all other combinations can be derived from existing results in the literature. Thus we present a complete picture for the study of combinations of two qualitative winning criteria for parity conditions in MDPs and turn-based stochastic games. ","lang":"eng"}],"citation":{"apa":"Chatterjee, K., & Piterman, N. (2019). Combinations of Qualitative Winning for Stochastic Parity Games (Vol. 140). Presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.CONCUR.2019.6","ieee":"K. Chatterjee and N. Piterman, “Combinations of Qualitative Winning for Stochastic Parity Games,” presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands, 2019, vol. 140.","ista":"Chatterjee K, Piterman N. 2019. Combinations of Qualitative Winning for Stochastic Parity Games. CONCUR: International Conference on Concurrency Theory, LIPIcs, vol. 140, 6.","ama":"Chatterjee K, Piterman N. Combinations of Qualitative Winning for Stochastic Parity Games. In: Vol 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.CONCUR.2019.6","chicago":"Chatterjee, Krishnendu, and Nir Piterman. “Combinations of Qualitative Winning for Stochastic Parity Games,” Vol. 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.CONCUR.2019.6.","short":"K. Chatterjee, N. Piterman, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.","mla":"Chatterjee, Krishnendu, and Nir Piterman. Combinations of Qualitative Winning for Stochastic Parity Games. Vol. 140, 6, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.CONCUR.2019.6."},"date_published":"2019-08-01T00:00:00Z","scopus_import":1,"day":"01","has_accepted_license":"1"},{"publication_identifier":{"eisbn":["978-3-95977-126-9"]},"language":[{"iso":"eng"}],"conference":{"end_date":"2019-10-18","location":"Budapest, Hungary","start_date":"2019-10-14","name":"DISC: International Symposium on Distributed Computing"},"doi":"10.4230/LIPICS.DISC.2019.29","quality_controlled":"1","project":[{"name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","grant_number":"754411","_id":"260C2330-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":{"arxiv":["1908.02743"]},"file_date_updated":"2020-07-14T12:47:44Z","ec_funded":1,"date_updated":"2021-01-12T08:09:38Z","date_created":"2019-10-08T12:41:38Z","volume":146,"author":[{"last_name":"Nowak","first_name":"Thomas","full_name":"Nowak, Thomas"},{"first_name":"Joel","last_name":"Rybicki","id":"334EFD2E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6432-6646","full_name":"Rybicki, Joel"}],"publication_status":"published","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"DaAl"}],"year":"2019","article_processing_charge":"No","has_accepted_license":"1","keyword":["consensus","approximate agreement","Byzantine faults","chordal graphs","lattice agreement"],"scopus_import":1,"date_published":"2019-01-01T00:00:00Z","page":"29:1--29:17","publication":"33rd International Symposium on Distributed Computing","citation":{"ama":"Nowak T, Rybicki J. Byzantine approximate agreement on graphs. In: 33rd International Symposium on Distributed Computing. Vol 146. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019:29:1--29:17. doi:10.4230/LIPICS.DISC.2019.29","ieee":"T. Nowak and J. Rybicki, “Byzantine approximate agreement on graphs,” in 33rd International Symposium on Distributed Computing, Budapest, Hungary, 2019, vol. 146, p. 29:1--29:17.","apa":"Nowak, T., & Rybicki, J. (2019). Byzantine approximate agreement on graphs. In 33rd International Symposium on Distributed Computing (Vol. 146, p. 29:1--29:17). Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.DISC.2019.29","ista":"Nowak T, Rybicki J. 2019. Byzantine approximate agreement on graphs. 33rd International Symposium on Distributed Computing. DISC: International Symposium on Distributed Computing, LIPIcs, vol. 146, 29:1--29:17.","short":"T. Nowak, J. Rybicki, in:, 33rd International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 29:1--29:17.","mla":"Nowak, Thomas, and Joel Rybicki. “Byzantine Approximate Agreement on Graphs.” 33rd International Symposium on Distributed Computing, vol. 146, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 29:1--29:17, doi:10.4230/LIPICS.DISC.2019.29.","chicago":"Nowak, Thomas, and Joel Rybicki. “Byzantine Approximate Agreement on Graphs.” In 33rd International Symposium on Distributed Computing, 146:29:1--29:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.DISC.2019.29."},"abstract":[{"text":"Consider a distributed system with n processors out of which f can be Byzantine faulty. In the\r\napproximate agreement task, each processor i receives an input value xi and has to decide on an\r\noutput value yi such that\r\n1. the output values are in the convex hull of the non-faulty processors’ input values,\r\n2. the output values are within distance d of each other.\r\n\r\n\r\nClassically, the values are assumed to be from an m-dimensional Euclidean space, where m ≥ 1.\r\nIn this work, we study the task in a discrete setting, where input values with some structure\r\nexpressible as a graph. Namely, the input values are vertices of a finite graph G and the goal is to\r\noutput vertices that are within distance d of each other in G, but still remain in the graph-induced\r\nconvex hull of the input values. For d = 0, the task reduces to consensus and cannot be solved with\r\na deterministic algorithm in an asynchronous system even with a single crash fault. For any d ≥ 1,\r\nwe show that the task is solvable in asynchronous systems when G is chordal and n > (ω + 1)f,\r\nwhere ω is the clique number of G. In addition, we give the first Byzantine-tolerant algorithm for a\r\nvariant of lattice agreement. For synchronous systems, we show tight resilience bounds for the exact\r\nvariants of these and related tasks over a large class of combinatorial structures.","lang":"eng"}],"alternative_title":["LIPIcs"],"type":"conference","oa_version":"Published Version","file":[{"creator":"jrybicki","file_size":639378,"content_type":"application/pdf","file_name":"LIPIcs-DISC-2019-29.pdf","access_level":"open_access","date_created":"2019-10-08T12:47:19Z","date_updated":"2020-07-14T12:47:44Z","checksum":"2d2202f90c6ac991e50876451627c4b5","file_id":"6934","relation":"main_file"}],"title":"Byzantine approximate agreement on graphs","status":"public","ddc":["004"],"intvolume":" 146","_id":"6931","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87"},{"publication":"Proceedings of the International Joint Conference on Neural Networks","external_id":{"arxiv":["1809.03864"]},"oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1809.03864","open_access":"1"}],"citation":{"ama":"Hasani R, Amini A, Lechner M, Naser F, Grosu R, Rus D. Response characterization for auditing cell dynamics in long short-term memory networks. In: Proceedings of the International Joint Conference on Neural Networks. IEEE; 2019. doi:10.1109/ijcnn.2019.8851954","ista":"Hasani R, Amini A, Lechner M, Naser F, Grosu R, Rus D. 2019. Response characterization for auditing cell dynamics in long short-term memory networks. Proceedings of the International Joint Conference on Neural Networks. IJCNN: International Joint Conference on Neural Networks, 8851954.","ieee":"R. Hasani, A. Amini, M. Lechner, F. Naser, R. Grosu, and D. Rus, “Response characterization for auditing cell dynamics in long short-term memory networks,” in Proceedings of the International Joint Conference on Neural Networks, Budapest, Hungary, 2019.","apa":"Hasani, R., Amini, A., Lechner, M., Naser, F., Grosu, R., & Rus, D. (2019). Response characterization for auditing cell dynamics in long short-term memory networks. In Proceedings of the International Joint Conference on Neural Networks. Budapest, Hungary: IEEE. https://doi.org/10.1109/ijcnn.2019.8851954","mla":"Hasani, Ramin, et al. “Response Characterization for Auditing Cell Dynamics in Long Short-Term Memory Networks.” Proceedings of the International Joint Conference on Neural Networks, 8851954, IEEE, 2019, doi:10.1109/ijcnn.2019.8851954.","short":"R. Hasani, A. Amini, M. Lechner, F. Naser, R. Grosu, D. Rus, in:, Proceedings of the International Joint Conference on Neural Networks, IEEE, 2019.","chicago":"Hasani, Ramin, Alexander Amini, Mathias Lechner, Felix Naser, Radu Grosu, and Daniela Rus. “Response Characterization for Auditing Cell Dynamics in Long Short-Term Memory Networks.” In Proceedings of the International Joint Conference on Neural Networks. IEEE, 2019. https://doi.org/10.1109/ijcnn.2019.8851954."},"quality_controlled":"1","conference":{"end_date":"2019-07-19","location":"Budapest, Hungary","start_date":"2019-07-14","name":"IJCNN: International Joint Conference on Neural Networks"},"doi":"10.1109/ijcnn.2019.8851954","date_published":"2019-09-30T00:00:00Z","language":[{"iso":"eng"}],"scopus_import":1,"month":"09","day":"30","publication_identifier":{"isbn":["9781728119854"]},"year":"2019","_id":"6985","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Response characterization for auditing cell dynamics in long short-term memory networks","status":"public","publication_status":"published","publisher":"IEEE","department":[{"_id":"ToHe"}],"author":[{"full_name":"Hasani, Ramin","first_name":"Ramin","last_name":"Hasani"},{"first_name":"Alexander","last_name":"Amini","full_name":"Amini, Alexander"},{"full_name":"Lechner, Mathias","last_name":"Lechner","first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Naser, Felix","last_name":"Naser","first_name":"Felix"},{"last_name":"Grosu","first_name":"Radu","full_name":"Grosu, Radu"},{"last_name":"Rus","first_name":"Daniela","full_name":"Rus, Daniela"}],"date_created":"2019-11-04T15:59:58Z","date_updated":"2021-01-12T08:11:19Z","oa_version":"Preprint","article_number":"8851954","type":"conference","abstract":[{"lang":"eng","text":"In this paper, we introduce a novel method to interpret recurrent neural networks (RNNs), particularly long short-term memory networks (LSTMs) at the cellular level. We propose a systematic pipeline for interpreting individual hidden state dynamics within the network using response characterization methods. The ranked contribution of individual cells to the network's output is computed by analyzing a set of interpretable metrics of their decoupled step and sinusoidal responses. As a result, our method is able to uniquely identify neurons with insightful dynamics, quantify relationships between dynamical properties and test accuracy through ablation analysis, and interpret the impact of network capacity on a network's dynamical distribution. Finally, we demonstrate the generalizability and scalability of our method by evaluating a series of different benchmark sequential datasets."}]},{"related_material":{"record":[{"id":"6675","status":"public","relation":"earlier_version"}]},"author":[{"id":"27EB676C-8706-11E9-9510-7717E6697425","orcid":"0000-0002-3242-7020","first_name":"Marco","last_name":"Mondelli","full_name":"Mondelli, Marco"},{"full_name":"Hassani, S. Hamed","last_name":"Hassani","first_name":"S. Hamed"},{"full_name":"Urbanke, Rüdiger","last_name":"Urbanke","first_name":"Rüdiger"}],"volume":12,"date_created":"2019-11-12T14:46:19Z","date_updated":"2023-02-23T12:49:28Z","year":"2019","department":[{"_id":"MaMo"}],"publisher":"MDPI","publication_status":"published","file_date_updated":"2020-07-14T12:47:47Z","article_number":"218","doi":"10.3390/a12100218","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":["1801.03153"]},"quality_controlled":"1","publication_identifier":{"issn":["1999-4893"]},"month":"10","oa_version":"Published Version","file":[{"relation":"main_file","file_id":"7008","checksum":"267756d8f9db572f496cd1663c89d59a","date_created":"2019-11-12T14:48:45Z","date_updated":"2020-07-14T12:47:47Z","access_level":"open_access","file_name":"2019_Algorithms_Mondelli.pdf","file_size":696791,"content_type":"application/pdf","creator":"dernst"}],"_id":"7007","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 12","status":"public","title":"A new coding paradigm for the primitive relay channel","ddc":["510"],"issue":"10","abstract":[{"lang":"eng","text":"We consider the primitive relay channel, where the source sends a message to the relay and to the destination, and the relay helps the communication by transmitting an additional message to the destination via a separate channel. Two well-known coding techniques have been introduced for this setting: decode-and-forward and compress-and-forward. In decode-and-forward, the relay completely decodes the message and sends some information to the destination; in compress-and-forward, the relay does not decode, and it sends a compressed version of the received signal to the destination using Wyner–Ziv coding. In this paper, we present a novel coding paradigm that provides an improved achievable rate for the primitive relay channel. The idea is to combine compress-and-forward and decode-and-forward via a chaining construction. We transmit over pairs of blocks: in the first block, we use compress-and-forward; and, in the second block, we use decode-and-forward. More specifically, in the first block, the relay does not decode, it compresses the received signal via Wyner–Ziv, and it sends only part of the compression to the destination. In the second block, the relay completely decodes the message, it sends some information to the destination, and it also sends the remaining part of the compression coming from the first block. By doing so, we are able to strictly outperform both compress-and-forward and decode-and-forward. Note that the proposed coding scheme can be implemented with polar codes. As such, it has the typical attractive properties of polar coding schemes, namely, quasi-linear encoding and decoding complexity, and error probability that decays at super-polynomial speed. As a running example, we take into account the special case of the erasure relay channel, and we provide a comparison between the rates achievable by our proposed scheme and the existing upper and lower bounds."}],"type":"journal_article","date_published":"2019-10-18T00:00:00Z","citation":{"ista":"Mondelli M, Hassani SH, Urbanke R. 2019. A new coding paradigm for the primitive relay channel. Algorithms. 12(10), 218.","ieee":"M. Mondelli, S. H. Hassani, and R. Urbanke, “A new coding paradigm for the primitive relay channel,” Algorithms, vol. 12, no. 10. MDPI, 2019.","apa":"Mondelli, M., Hassani, S. H., & Urbanke, R. (2019). A new coding paradigm for the primitive relay channel. Algorithms. MDPI. https://doi.org/10.3390/a12100218","ama":"Mondelli M, Hassani SH, Urbanke R. A new coding paradigm for the primitive relay channel. Algorithms. 2019;12(10). doi:10.3390/a12100218","chicago":"Mondelli, Marco, S. Hamed Hassani, and Rüdiger Urbanke. “A New Coding Paradigm for the Primitive Relay Channel.” Algorithms. MDPI, 2019. https://doi.org/10.3390/a12100218.","mla":"Mondelli, Marco, et al. “A New Coding Paradigm for the Primitive Relay Channel.” Algorithms, vol. 12, no. 10, 218, MDPI, 2019, doi:10.3390/a12100218.","short":"M. Mondelli, S.H. Hassani, R. Urbanke, Algorithms 12 (2019)."},"publication":"Algorithms","article_type":"original","has_accepted_license":"1","day":"18","scopus_import":1},{"month":"01","day":"30","article_processing_charge":"No","publication":"Kyoto RIMS Kôkyûroku","main_file_link":[{"open_access":"1","url":"http://www.kurims.kyoto-u.ac.jp/~kyodo/kokyuroku/contents/2125.html"}],"oa":1,"citation":{"ista":"Geher GP, Titkos T, Virosztek D. 2019. Dirac masses and isometric rigidity. Kyoto RIMS Kôkyûroku. Research on isometries as preserver problems and related topics vol. 2125, 34–41.","ieee":"G. P. Geher, T. Titkos, and D. Virosztek, “Dirac masses and isometric rigidity,” in Kyoto RIMS Kôkyûroku, Kyoto, Japan, 2019, vol. 2125, pp. 34–41.","apa":"Geher, G. P., Titkos, T., & Virosztek, D. (2019). Dirac masses and isometric rigidity. In Kyoto RIMS Kôkyûroku (Vol. 2125, pp. 34–41). Kyoto, Japan: Research Institute for Mathematical Sciences, Kyoto University.","ama":"Geher GP, Titkos T, Virosztek D. Dirac masses and isometric rigidity. In: Kyoto RIMS Kôkyûroku. Vol 2125. Research Institute for Mathematical Sciences, Kyoto University; 2019:34-41.","chicago":"Geher, Gyorgy Pal, Tamas Titkos, and Daniel Virosztek. “Dirac Masses and Isometric Rigidity.” In Kyoto RIMS Kôkyûroku, 2125:34–41. Research Institute for Mathematical Sciences, Kyoto University, 2019.","mla":"Geher, Gyorgy Pal, et al. “Dirac Masses and Isometric Rigidity.” Kyoto RIMS Kôkyûroku, vol. 2125, Research Institute for Mathematical Sciences, Kyoto University, 2019, pp. 34–41.","short":"G.P. Geher, T. Titkos, D. Virosztek, in:, Kyoto RIMS Kôkyûroku, Research Institute for Mathematical Sciences, Kyoto University, 2019, pp. 34–41."},"quality_controlled":"1","page":"34-41","conference":{"end_date":"2019-01-30","start_date":"2019-01-28","location":"Kyoto, Japan","name":"Research on isometries as preserver problems and related topics"},"date_published":"2019-01-30T00:00:00Z","language":[{"iso":"eng"}],"type":"conference","abstract":[{"lang":"eng","text":"The aim of this short note is to expound one particular issue that was discussed during the talk [10] given at the symposium ”Researches on isometries as preserver problems and related topics” at Kyoto RIMS. That is, the role of Dirac masses by describing the isometry group of various metric spaces of probability measures. This article is of survey character, and it does not contain any essentially new results.From an isometric point of view, in some cases, metric spaces of measures are similar to C(K)-type function spaces. Similarity means here that their isometries are driven by some nice transformations of the underlying space. Of course, it depends on the particular choice of the metric how nice these transformations should be. Sometimes, as we will see, being a homeomorphism is enough to generate an isometry. But sometimes we need more: the transformation must preserve the underlying distance as well. Statements claiming that isometries in questions are necessarily induced by homeomorphisms are called Banach-Stone-type results, while results asserting that the underlying transformation is necessarily an isometry are termed as isometric rigidity results.As Dirac masses can be considered as building bricks of the set of all Borel measures, a natural question arises:Is it enough to understand how an isometry acts on the set of Dirac masses? Does this action extend uniquely to all measures?In what follows, we will thoroughly investigate this question."}],"_id":"7035","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2019","title":"Dirac masses and isometric rigidity","publication_status":"published","status":"public","publisher":"Research Institute for Mathematical Sciences, Kyoto University","intvolume":" 2125","department":[{"_id":"LaEr"}],"author":[{"full_name":"Geher, Gyorgy Pal","first_name":"Gyorgy Pal","last_name":"Geher"},{"full_name":"Titkos, Tamas","last_name":"Titkos","first_name":"Tamas"},{"full_name":"Virosztek, Daniel","first_name":"Daniel","last_name":"Virosztek","id":"48DB45DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1109-5511"}],"date_updated":"2021-01-12T08:11:33Z","date_created":"2019-11-18T15:39:53Z","volume":2125,"oa_version":"Submitted Version"},{"type":"journal_article","issue":"10","abstract":[{"lang":"eng","text":"A recent class of topological nodal-line semimetals with the general formula MSiX (M = Zr, Hf and X = S, Se, Te) has attracted much experimental and theoretical interest due to their properties, particularly their large magnetoresistances and high carrier mobilities. The plateletlike nature of the MSiX crystals and their extremely low residual resistivities make measurements of the resistivity along the [001] direction extremely challenging. To accomplish such measurements, microstructures of single crystals were prepared using focused ion beam techniques. Microstructures prepared in this manner have very well-defined geometries and maintain their high crystal quality, verified by the observations of quantum oscillations. We present magnetoresistance and quantum oscillation data for currents applied along both [001] and [100] in ZrSiS and ZrSiSe, which are consistent with the nontrivial topology of the Dirac line-node, as determined by a measured π Berry phase. Surprisingly, we find that, despite the three dimensional nature of both the Fermi surfaces of ZrSiS and ZrSiSe, both the resistivity anisotropy under applied magnetic fields and the in-plane angular dependent magnetoresistance differ considerably between the two compounds. Finally, we discuss the role microstructuring can play in the study of these materials and our ability to make these microstructures free-standing."}],"_id":"7055","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 7","status":"public","title":"Out-of-plane transport in ZrSiS and ZrSiSe microstructures","ddc":["530"],"oa_version":"Published Version","file":[{"relation":"main_file","file_id":"7087","checksum":"142fe7b3e37d8e916071743bb194360d","date_updated":"2020-07-14T12:47:48Z","date_created":"2019-11-20T12:27:01Z","access_level":"open_access","file_name":"2019_APL_Shirer.pdf","file_size":2453220,"content_type":"application/pdf","creator":"dernst"}],"has_accepted_license":"1","article_processing_charge":"No","day":"17","citation":{"chicago":"Shirer, Kent R., Kimberly A Modic, Tino Zimmerling, Maja D. Bachmann, Markus König, Philip J. W. Moll, Leslie Schoop, and Andrew P. Mackenzie. “Out-of-Plane Transport in ZrSiS and ZrSiSe Microstructures.” APL Materials. AIP, 2019. https://doi.org/10.1063/1.5124568.","short":"K.R. Shirer, K.A. Modic, T. Zimmerling, M.D. Bachmann, M. König, P.J.W. Moll, L. Schoop, A.P. Mackenzie, APL Materials 7 (2019).","mla":"Shirer, Kent R., et al. “Out-of-Plane Transport in ZrSiS and ZrSiSe Microstructures.” APL Materials, vol. 7, no. 10, 101116, AIP, 2019, doi:10.1063/1.5124568.","apa":"Shirer, K. R., Modic, K. A., Zimmerling, T., Bachmann, M. D., König, M., Moll, P. J. W., … Mackenzie, A. P. (2019). Out-of-plane transport in ZrSiS and ZrSiSe microstructures. APL Materials. AIP. https://doi.org/10.1063/1.5124568","ieee":"K. R. Shirer et al., “Out-of-plane transport in ZrSiS and ZrSiSe microstructures,” APL Materials, vol. 7, no. 10. AIP, 2019.","ista":"Shirer KR, Modic KA, Zimmerling T, Bachmann MD, König M, Moll PJW, Schoop L, Mackenzie AP. 2019. Out-of-plane transport in ZrSiS and ZrSiSe microstructures. APL Materials. 7(10), 101116.","ama":"Shirer KR, Modic KA, Zimmerling T, et al. Out-of-plane transport in ZrSiS and ZrSiSe microstructures. APL Materials. 2019;7(10). doi:10.1063/1.5124568"},"publication":"APL Materials","article_type":"original","date_published":"2019-10-17T00:00:00Z","article_number":"101116","file_date_updated":"2020-07-14T12:47:48Z","extern":"1","year":"2019","publisher":"AIP","publication_status":"published","author":[{"full_name":"Shirer, Kent R.","first_name":"Kent R.","last_name":"Shirer"},{"first_name":"Kimberly A","last_name":"Modic","id":"13C26AC0-EB69-11E9-87C6-5F3BE6697425","orcid":"0000-0001-9760-3147","full_name":"Modic, Kimberly A"},{"last_name":"Zimmerling","first_name":"Tino","full_name":"Zimmerling, Tino"},{"first_name":"Maja D.","last_name":"Bachmann","full_name":"Bachmann, Maja D."},{"last_name":"König","first_name":"Markus","full_name":"König, Markus"},{"full_name":"Moll, Philip J. W.","first_name":"Philip J. W.","last_name":"Moll"},{"last_name":"Schoop","first_name":"Leslie","full_name":"Schoop, Leslie"},{"first_name":"Andrew P.","last_name":"Mackenzie","full_name":"Mackenzie, Andrew P."}],"volume":7,"date_created":"2019-11-19T12:52:43Z","date_updated":"2021-01-12T08:11:35Z","publication_identifier":{"issn":["2166-532X"]},"month":"10","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","doi":"10.1063/1.5124568","language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"doi":"10.1038/s41598-018-38161-7","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"},"oa":1,"month":"02","publication_identifier":{"issn":["2045-2322"]},"date_created":"2019-11-19T13:00:35Z","date_updated":"2021-01-12T08:11:36Z","volume":9,"author":[{"full_name":"Modic, Kimberly A","orcid":"0000-0001-9760-3147","id":"13C26AC0-EB69-11E9-87C6-5F3BE6697425","last_name":"Modic","first_name":"Kimberly A"},{"full_name":"Meng, Tobias","first_name":"Tobias","last_name":"Meng"},{"full_name":"Ronning, Filip","first_name":"Filip","last_name":"Ronning"},{"full_name":"Bauer, Eric D.","first_name":"Eric D.","last_name":"Bauer"},{"first_name":"Philip J. W.","last_name":"Moll","full_name":"Moll, Philip J. W."},{"last_name":"Ramshaw","first_name":"B. J.","full_name":"Ramshaw, B. J."}],"publication_status":"published","publisher":"Springer Nature","year":"2019","extern":"1","file_date_updated":"2020-07-14T12:47:48Z","article_number":"2095","date_published":"2019-02-14T00:00:00Z","article_type":"original","publication":"Scientific Reports","citation":{"chicago":"Modic, Kimberly A, Tobias Meng, Filip Ronning, Eric D. Bauer, Philip J. W. Moll, and B. J. Ramshaw. “Thermodynamic Signatures of Weyl Fermions in NbP.” Scientific Reports. Springer Nature, 2019. https://doi.org/10.1038/s41598-018-38161-7.","short":"K.A. Modic, T. Meng, F. Ronning, E.D. Bauer, P.J.W. Moll, B.J. Ramshaw, Scientific Reports 9 (2019).","mla":"Modic, Kimberly A., et al. “Thermodynamic Signatures of Weyl Fermions in NbP.” Scientific Reports, vol. 9, no. 1, 2095, Springer Nature, 2019, doi:10.1038/s41598-018-38161-7.","apa":"Modic, K. A., Meng, T., Ronning, F., Bauer, E. D., Moll, P. J. W., & Ramshaw, B. J. (2019). Thermodynamic signatures of Weyl fermions in NbP. Scientific Reports. Springer Nature. https://doi.org/10.1038/s41598-018-38161-7","ieee":"K. A. Modic, T. Meng, F. Ronning, E. D. Bauer, P. J. W. Moll, and B. J. Ramshaw, “Thermodynamic signatures of Weyl fermions in NbP,” Scientific Reports, vol. 9, no. 1. Springer Nature, 2019.","ista":"Modic KA, Meng T, Ronning F, Bauer ED, Moll PJW, Ramshaw BJ. 2019. Thermodynamic signatures of Weyl fermions in NbP. Scientific Reports. 9(1), 2095.","ama":"Modic KA, Meng T, Ronning F, Bauer ED, Moll PJW, Ramshaw BJ. Thermodynamic signatures of Weyl fermions in NbP. Scientific Reports. 2019;9(1). doi:10.1038/s41598-018-38161-7"},"day":"14","has_accepted_license":"1","article_processing_charge":"No","file":[{"access_level":"open_access","file_name":"2019_ScientificReports_Modic.pdf","content_type":"application/pdf","file_size":3256400,"creator":"dernst","relation":"main_file","file_id":"7086","checksum":"3b5a7b316e1ff22aa0f89e8d1f1ace91","date_created":"2019-11-20T12:24:13Z","date_updated":"2020-07-14T12:47:48Z"}],"oa_version":"Published Version","status":"public","ddc":["530"],"title":"Thermodynamic signatures of Weyl fermions in NbP","intvolume":" 9","_id":"7057","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"We present a high magnetic field study of NbP—a member of the monopnictide Weyl semimetal (WSM) family. While the monoarsenides (NbAs and TaAs) have topologically distinct left and right-handed Weyl fermi surfaces, NbP is argued to be “topologically trivial” due to the fact that all pairs of Weyl nodes are encompassed by a single Fermi surface. We use torque magnetometry to measure the magnetic response of NbP up to 60 tesla and uncover a Berry paramagnetic response, characteristic of the topological Weyl nodes, across the entire field range. At the quantum limit B* (≈32 T), τ/B experiences a change in slope when the chemical potential enters the last Landau level. Our calculations confirm that this magnetic response arises from band topology of the Weyl pocket, even though the Fermi surface encompasses both Weyl nodes at zero magnetic field. We also find that the magnetic field pulls the chemical potential to the chiral n = 0 Landau level in the quantum limit, providing a disorder-free way of accessing chiral Weyl fermions in systems that are “not quite” WSMs in zero magnetic field.","lang":"eng"}],"issue":"1","type":"journal_article"},{"abstract":[{"text":"In the Ca1−x La x FeAs2 (1 1 2) family of pnictide superconductors, we have investigated a highly overdoped composition (x = 0.56), prepared by a high-pressure, high-temperature synthesis. Magnetic measurements show an antiferromagnetic transition at T N = 120 K, well above the one at lower doping (0.15 < x < 0.27).\r\n\r\nBelow the onset of long-range magnetic order at T N, the electrical resistivity is strongly reduced and is dominated by electron–electron interactions, as evident from its temperature dependence. The Seebeck coefficient shows a clear metallic behavior as in narrow band conductors. The temperature dependence of the Hall coefficient and the violation of Kohler's rule agree with the multiband character of the material. No superconductivity was observed down to 1.8 K. The success of the high-pressure synthesis encourages further investigations of the so far only partially explored phase diagram in this family of Iron-based high temperature superconductors.\r\n","lang":"eng"}],"issue":"48","type":"journal_article","oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"7056","title":"Persistent antiferromagnetic order in heavily overdoped Ca1−x La x FeAs2","status":"public","intvolume":" 31","day":"03","article_processing_charge":"No","date_published":"2019-09-03T00:00:00Z","publication":"Journal of Physics: Condensed Matter","citation":{"ieee":"E. Martino et al., “Persistent antiferromagnetic order in heavily overdoped Ca1−x La x FeAs2,” Journal of Physics: Condensed Matter, vol. 31, no. 48. IOP Publishing, 2019.","apa":"Martino, E., Bachmann, M. D., Rossi, L., Modic, K. A., Zivkovic, I., Rønnow, H. M., … Katrych, S. (2019). Persistent antiferromagnetic order in heavily overdoped Ca1−x La x FeAs2. Journal of Physics: Condensed Matter. IOP Publishing. https://doi.org/10.1088/1361-648x/ab3b43","ista":"Martino E, Bachmann MD, Rossi L, Modic KA, Zivkovic I, Rønnow HM, Moll PJW, Akrap A, Forró L, Katrych S. 2019. Persistent antiferromagnetic order in heavily overdoped Ca1−x La x FeAs2. Journal of Physics: Condensed Matter. 31(48), 485705.","ama":"Martino E, Bachmann MD, Rossi L, et al. Persistent antiferromagnetic order in heavily overdoped Ca1−x La x FeAs2. Journal of Physics: Condensed Matter. 2019;31(48). doi:10.1088/1361-648x/ab3b43","chicago":"Martino, Edoardo, Maja D Bachmann, Lidia Rossi, Kimberly A Modic, Ivica Zivkovic, Henrik M Rønnow, Philip J W Moll, Ana Akrap, László Forró, and Sergiy Katrych. “Persistent Antiferromagnetic Order in Heavily Overdoped Ca1−x La x FeAs2.” Journal of Physics: Condensed Matter. IOP Publishing, 2019. https://doi.org/10.1088/1361-648x/ab3b43.","short":"E. Martino, M.D. Bachmann, L. Rossi, K.A. Modic, I. Zivkovic, H.M. Rønnow, P.J.W. Moll, A. Akrap, L. Forró, S. Katrych, Journal of Physics: Condensed Matter 31 (2019).","mla":"Martino, Edoardo, et al. “Persistent Antiferromagnetic Order in Heavily Overdoped Ca1−x La x FeAs2.” Journal of Physics: Condensed Matter, vol. 31, no. 48, 485705, IOP Publishing, 2019, doi:10.1088/1361-648x/ab3b43."},"article_type":"original","extern":"1","article_number":"485705","author":[{"full_name":"Martino, Edoardo","first_name":"Edoardo","last_name":"Martino"},{"full_name":"Bachmann, Maja D","last_name":"Bachmann","first_name":"Maja D"},{"full_name":"Rossi, Lidia","last_name":"Rossi","first_name":"Lidia"},{"full_name":"Modic, Kimberly A","orcid":"0000-0001-9760-3147","id":"13C26AC0-EB69-11E9-87C6-5F3BE6697425","last_name":"Modic","first_name":"Kimberly A"},{"last_name":"Zivkovic","first_name":"Ivica","full_name":"Zivkovic, Ivica"},{"first_name":"Henrik M","last_name":"Rønnow","full_name":"Rønnow, Henrik M"},{"last_name":"Moll","first_name":"Philip J W","full_name":"Moll, Philip J W"},{"full_name":"Akrap, Ana","last_name":"Akrap","first_name":"Ana"},{"full_name":"Forró, László","last_name":"Forró","first_name":"László"},{"full_name":"Katrych, Sergiy","last_name":"Katrych","first_name":"Sergiy"}],"date_updated":"2021-01-12T08:11:35Z","date_created":"2019-11-19T12:56:17Z","volume":31,"year":"2019","publication_status":"published","publisher":"IOP Publishing","month":"09","publication_identifier":{"issn":["0953-8984"],"eissn":["1361-648X"]},"doi":"10.1088/1361-648x/ab3b43","language":[{"iso":"eng"}],"oa":1,"external_id":{"arxiv":["1905.08640"]},"main_file_link":[{"url":"https://arxiv.org/abs/1905.08640","open_access":"1"}],"quality_controlled":"1"},{"quality_controlled":"1","article_type":"original","page":"221-226","publication":"Science","citation":{"apa":"Bachmann, M. D., Ferguson, G. M., Theuss, F., Meng, T., Putzke, C., Helm, T., … Moll, P. J. W. (2019). Spatial control of heavy-fermion superconductivity in CeIrIn5. Science. AAAS. https://doi.org/10.1126/science.aao6640","ieee":"M. D. Bachmann et al., “Spatial control of heavy-fermion superconductivity in CeIrIn5,” Science, vol. 366, no. 6462. AAAS, pp. 221–226, 2019.","ista":"Bachmann MD, Ferguson GM, Theuss F, Meng T, Putzke C, Helm T, Shirer KR, Li Y-S, Modic KA, Nicklas M, König M, Low D, Ghosh S, Mackenzie AP, Arnold F, Hassinger E, McDonald RD, Winter LE, Bauer ED, Ronning F, Ramshaw BJ, Nowack KC, Moll PJW. 2019. Spatial control of heavy-fermion superconductivity in CeIrIn5. Science. 366(6462), 221–226.","ama":"Bachmann MD, Ferguson GM, Theuss F, et al. Spatial control of heavy-fermion superconductivity in CeIrIn5. Science. 2019;366(6462):221-226. doi:10.1126/science.aao6640","chicago":"Bachmann, Maja D., G. M. Ferguson, Florian Theuss, Tobias Meng, Carsten Putzke, Toni Helm, K. R. Shirer, et al. “Spatial Control of Heavy-Fermion Superconductivity in CeIrIn5.” Science. AAAS, 2019. https://doi.org/10.1126/science.aao6640.","short":"M.D. Bachmann, G.M. Ferguson, F. Theuss, T. Meng, C. Putzke, T. Helm, K.R. Shirer, Y.-S. Li, K.A. Modic, M. Nicklas, M. König, D. Low, S. Ghosh, A.P. Mackenzie, F. Arnold, E. Hassinger, R.D. McDonald, L.E. Winter, E.D. Bauer, F. Ronning, B.J. Ramshaw, K.C. Nowack, P.J.W. Moll, Science 366 (2019) 221–226.","mla":"Bachmann, Maja D., et al. “Spatial Control of Heavy-Fermion Superconductivity in CeIrIn5.” Science, vol. 366, no. 6462, AAAS, 2019, pp. 221–26, doi:10.1126/science.aao6640."},"language":[{"iso":"eng"}],"date_published":"2019-10-11T00:00:00Z","doi":"10.1126/science.aao6640","day":"11","month":"10","article_processing_charge":"No","publication_identifier":{"issn":["0036-8075"],"eissn":["1095-9203"]},"title":"Spatial control of heavy-fermion superconductivity in CeIrIn5","status":"public","publication_status":"published","intvolume":" 366","publisher":"AAAS","year":"2019","_id":"7082","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T08:11:46Z","date_created":"2019-11-19T13:55:58Z","oa_version":"None","volume":366,"author":[{"full_name":"Bachmann, Maja D.","last_name":"Bachmann","first_name":"Maja D."},{"first_name":"G. M.","last_name":"Ferguson","full_name":"Ferguson, G. M."},{"first_name":"Florian","last_name":"Theuss","full_name":"Theuss, Florian"},{"first_name":"Tobias","last_name":"Meng","full_name":"Meng, Tobias"},{"last_name":"Putzke","first_name":"Carsten","full_name":"Putzke, Carsten"},{"last_name":"Helm","first_name":"Toni","full_name":"Helm, Toni"},{"last_name":"Shirer","first_name":"K. R.","full_name":"Shirer, K. R."},{"first_name":"You-Sheng","last_name":"Li","full_name":"Li, You-Sheng"},{"orcid":"0000-0001-9760-3147","id":"13C26AC0-EB69-11E9-87C6-5F3BE6697425","last_name":"Modic","first_name":"Kimberly A","full_name":"Modic, Kimberly A"},{"full_name":"Nicklas, Michael","first_name":"Michael","last_name":"Nicklas"},{"full_name":"König, Markus","first_name":"Markus","last_name":"König"},{"full_name":"Low, D.","last_name":"Low","first_name":"D."},{"full_name":"Ghosh, Sayak","first_name":"Sayak","last_name":"Ghosh"},{"last_name":"Mackenzie","first_name":"Andrew P.","full_name":"Mackenzie, Andrew P."},{"last_name":"Arnold","first_name":"Frank","full_name":"Arnold, Frank"},{"full_name":"Hassinger, Elena","first_name":"Elena","last_name":"Hassinger"},{"first_name":"Ross D.","last_name":"McDonald","full_name":"McDonald, Ross D."},{"full_name":"Winter, Laurel E.","last_name":"Winter","first_name":"Laurel E."},{"first_name":"Eric D.","last_name":"Bauer","full_name":"Bauer, Eric D."},{"full_name":"Ronning, Filip","last_name":"Ronning","first_name":"Filip"},{"last_name":"Ramshaw","first_name":"B. J.","full_name":"Ramshaw, B. J."},{"full_name":"Nowack, Katja C.","last_name":"Nowack","first_name":"Katja C."},{"last_name":"Moll","first_name":"Philip J. W.","full_name":"Moll, Philip J. W."}],"type":"journal_article","extern":"1","abstract":[{"text":"Although crystals of strongly correlated metals exhibit a diverse set of electronic ground states, few approaches exist for spatially modulating their properties. In this study, we demonstrate disorder-free control, on the micrometer scale, over the superconducting state in samples of the heavy-fermion superconductor CeIrIn5. We pattern crystals by focused ion beam milling to tailor the boundary conditions for the elastic deformation upon thermal contraction during cooling. The resulting nonuniform strain fields induce complex patterns of superconductivity, owing to the strong dependence of the transition temperature on the strength and direction of strain. These results showcase a generic approach to manipulating electronic order on micrometer length scales in strongly correlated matter without compromising the cleanliness, stoichiometry, or mean free path.","lang":"eng"}],"issue":"6462"},{"intvolume":" 27","title":"Common regulatory pathways mediate activity of microRNAs inducing cardiomyocyte proliferation","ddc":["576"],"status":"public","_id":"7128","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"creator":"rcubero","file_size":4650750,"content_type":"application/pdf","file_name":"torrini_cellreports_2019.pdf","access_level":"open_access","date_created":"2019-11-26T22:30:43Z","date_updated":"2020-07-14T12:47:50Z","checksum":"c5d855d07263bfec718673385d0ea2d7","file_id":"7129","relation":"main_file"}],"oa_version":"Published Version","type":"journal_article","issue":"9","abstract":[{"lang":"eng","text":"Loss of functional cardiomyocytes is a major determinant of heart failure after myocardial infarction. Previous high throughput screening studies have identified a few microRNAs (miRNAs) that can induce cardiomyocyte proliferation and stimulate cardiac regeneration in mice. Here, we show that all of the most effective of these miRNAs activate nuclear localization of the master transcriptional cofactor Yes-associated protein (YAP) and induce expression of YAP-responsive genes. In particular, miR-199a-3p directly targets two mRNAs coding for proteins impinging on the Hippo pathway, the upstream YAP inhibitory kinase TAOK1, and the E3 ubiquitin ligase β-TrCP, which leads to YAP degradation. Several of the pro-proliferative miRNAs (including miR-199a-3p) also inhibit filamentous actin depolymerization by targeting Cofilin2, a process that by itself activates YAP nuclear translocation. Thus, activation of YAP and modulation of the actin cytoskeleton are major components of the pro-proliferative action of miR-199a-3p and other miRNAs that induce cardiomyocyte proliferation."}],"page":"2759-2771.e5","article_type":"original","citation":{"chicago":"Torrini, Consuelo, Ryan J Cubero, Ellen Dirkx, Luca Braga, Hashim Ali, Giulia Prosdocimo, Maria Ines Gutierrez, et al. “Common Regulatory Pathways Mediate Activity of MicroRNAs Inducing Cardiomyocyte Proliferation.” Cell Reports. Elsevier, 2019. https://doi.org/10.1016/j.celrep.2019.05.005.","short":"C. Torrini, R.J. Cubero, E. Dirkx, L. Braga, H. Ali, G. Prosdocimo, M.I. Gutierrez, C. Collesi, D. Licastro, L. Zentilin, M. Mano, S. Zacchigna, M. Vendruscolo, M. Marsili, A. Samal, M. Giacca, Cell Reports 27 (2019) 2759–2771.e5.","mla":"Torrini, Consuelo, et al. “Common Regulatory Pathways Mediate Activity of MicroRNAs Inducing Cardiomyocyte Proliferation.” Cell Reports, vol. 27, no. 9, Elsevier, 2019, p. 2759–2771.e5, doi:10.1016/j.celrep.2019.05.005.","ieee":"C. Torrini et al., “Common regulatory pathways mediate activity of microRNAs inducing cardiomyocyte proliferation,” Cell Reports, vol. 27, no. 9. Elsevier, p. 2759–2771.e5, 2019.","apa":"Torrini, C., Cubero, R. J., Dirkx, E., Braga, L., Ali, H., Prosdocimo, G., … Giacca, M. (2019). Common regulatory pathways mediate activity of microRNAs inducing cardiomyocyte proliferation. Cell Reports. Elsevier. https://doi.org/10.1016/j.celrep.2019.05.005","ista":"Torrini C, Cubero RJ, Dirkx E, Braga L, Ali H, Prosdocimo G, Gutierrez MI, Collesi C, Licastro D, Zentilin L, Mano M, Zacchigna S, Vendruscolo M, Marsili M, Samal A, Giacca M. 2019. Common regulatory pathways mediate activity of microRNAs inducing cardiomyocyte proliferation. Cell Reports. 27(9), 2759–2771.e5.","ama":"Torrini C, Cubero RJ, Dirkx E, et al. Common regulatory pathways mediate activity of microRNAs inducing cardiomyocyte proliferation. Cell Reports. 2019;27(9):2759-2771.e5. doi:10.1016/j.celrep.2019.05.005"},"publication":"Cell Reports","date_published":"2019-05-28T00:00:00Z","keyword":["cardiomyocyte","cell cycle","Cofilin2","cytoskeleton","Hippo","microRNA","regeneration","YAP"],"has_accepted_license":"1","article_processing_charge":"Yes","day":"28","publisher":"Elsevier","publication_status":"published","pmid":1,"year":"2019","volume":27,"date_created":"2019-11-26T22:30:07Z","date_updated":"2021-01-12T08:11:56Z","author":[{"first_name":"Consuelo","last_name":"Torrini","full_name":"Torrini, Consuelo"},{"id":"850B2E12-9CD4-11E9-837F-E719E6697425","orcid":"0000-0003-0002-1867","first_name":"Ryan J","last_name":"Cubero","full_name":"Cubero, Ryan J"},{"first_name":"Ellen","last_name":"Dirkx","full_name":"Dirkx, Ellen"},{"first_name":"Luca","last_name":"Braga","full_name":"Braga, Luca"},{"full_name":"Ali, Hashim","first_name":"Hashim","last_name":"Ali"},{"full_name":"Prosdocimo, Giulia","first_name":"Giulia","last_name":"Prosdocimo"},{"full_name":"Gutierrez, Maria Ines","first_name":"Maria Ines","last_name":"Gutierrez"},{"first_name":"Chiara","last_name":"Collesi","full_name":"Collesi, Chiara"},{"full_name":"Licastro, Danilo","last_name":"Licastro","first_name":"Danilo"},{"full_name":"Zentilin, Lorena","first_name":"Lorena","last_name":"Zentilin"},{"full_name":"Mano, Miguel","last_name":"Mano","first_name":"Miguel"},{"first_name":"Serena","last_name":"Zacchigna","full_name":"Zacchigna, Serena"},{"last_name":"Vendruscolo","first_name":"Michele","full_name":"Vendruscolo, Michele"},{"last_name":"Marsili","first_name":"Matteo","full_name":"Marsili, Matteo"},{"full_name":"Samal, Areejit","first_name":"Areejit","last_name":"Samal"},{"full_name":"Giacca, Mauro","first_name":"Mauro","last_name":"Giacca"}],"extern":"1","file_date_updated":"2020-07-14T12:47:50Z","quality_controlled":"1","oa":1,"tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png"},"external_id":{"pmid":["31141697"]},"language":[{"iso":"eng"}],"doi":"10.1016/j.celrep.2019.05.005","publication_identifier":{"issn":["2211-1247"]},"month":"05"},{"abstract":[{"lang":"eng","text":"We show that statistical criticality, i.e. the occurrence of power law frequency distributions, arises in samples that are maximally informative about the underlying generating process. In order to reach this conclusion, we first identify the frequency with which different outcomes occur in a sample, as the variable carrying useful information on the generative process. The entropy of the frequency, that we call relevance, provides an upper bound to the number of informative bits. This differs from the entropy of the data, that we take as a measure of resolution. Samples that maximise relevance at a given resolution—that we call maximally informative samples—exhibit statistical criticality. In particular, Zipf's law arises at the optimal trade-off between resolution (i.e. compression) and relevance. As a byproduct, we derive a bound of the maximal number of parameters that can be estimated from a dataset, in the absence of prior knowledge on the generative model.\r\n\r\nFurthermore, we relate criticality to the statistical properties of the representation of the data generating process. We show that, as a consequence of the concentration property of the asymptotic equipartition property, representations that are maximally informative about the data generating process are characterised by an exponential distribution of energy levels. This arises from a principle of minimal entropy, that is conjugate of the maximum entropy principle in statistical mechanics. This explains why statistical criticality requires no parameter fine tuning in maximally informative samples."}],"issue":"6","type":"journal_article","oa_version":"Preprint","title":"Statistical criticality arises in most informative representations","status":"public","intvolume":" 2019","_id":"7130","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"17","article_processing_charge":"No","keyword":["optimization under uncertainty","source coding","large deviation"],"date_published":"2019-06-17T00:00:00Z","article_type":"original","publication":"Journal of Statistical Mechanics: Theory and Experiment","citation":{"chicago":"Cubero, Ryan J, Junghyo Jo, Matteo Marsili, Yasser Roudi, and Juyong Song. “Statistical Criticality Arises in Most Informative Representations.” Journal of Statistical Mechanics: Theory and Experiment. IOP Publishing, 2019. https://doi.org/10.1088/1742-5468/ab16c8.","short":"R.J. Cubero, J. Jo, M. Marsili, Y. Roudi, J. Song, Journal of Statistical Mechanics: Theory and Experiment 2019 (2019).","mla":"Cubero, Ryan J., et al. “Statistical Criticality Arises in Most Informative Representations.” Journal of Statistical Mechanics: Theory and Experiment, vol. 2019, no. 6, 063402, IOP Publishing, 2019, doi:10.1088/1742-5468/ab16c8.","ieee":"R. J. Cubero, J. Jo, M. Marsili, Y. Roudi, and J. Song, “Statistical criticality arises in most informative representations,” Journal of Statistical Mechanics: Theory and Experiment, vol. 2019, no. 6. IOP Publishing, 2019.","apa":"Cubero, R. J., Jo, J., Marsili, M., Roudi, Y., & Song, J. (2019). Statistical criticality arises in most informative representations. Journal of Statistical Mechanics: Theory and Experiment. IOP Publishing. https://doi.org/10.1088/1742-5468/ab16c8","ista":"Cubero RJ, Jo J, Marsili M, Roudi Y, Song J. 2019. Statistical criticality arises in most informative representations. Journal of Statistical Mechanics: Theory and Experiment. 2019(6), 063402.","ama":"Cubero RJ, Jo J, Marsili M, Roudi Y, Song J. Statistical criticality arises in most informative representations. Journal of Statistical Mechanics: Theory and Experiment. 2019;2019(6). doi:10.1088/1742-5468/ab16c8"},"extern":"1","article_number":"063402","date_created":"2019-11-26T22:36:09Z","date_updated":"2021-01-12T08:11:57Z","volume":2019,"author":[{"orcid":"0000-0003-0002-1867","id":"850B2E12-9CD4-11E9-837F-E719E6697425","last_name":"Cubero","first_name":"Ryan J","full_name":"Cubero, Ryan J"},{"last_name":"Jo","first_name":"Junghyo","full_name":"Jo, Junghyo"},{"first_name":"Matteo","last_name":"Marsili","full_name":"Marsili, Matteo"},{"full_name":"Roudi, Yasser","last_name":"Roudi","first_name":"Yasser"},{"first_name":"Juyong","last_name":"Song","full_name":"Song, Juyong"}],"publication_status":"published","publisher":"IOP Publishing","year":"2019","acknowledgement":"We acknowledge interesting discussions with M Abbott, E Aurell, J Barbier, R Monasson, T Mora, I Nemenman, N Tishby and R Zecchina. This research was supported by the Kavli Foundation and the Centre of Excellence scheme of the Research Council of Norway (Centre for Neural Computation) (RJC and YR), by the Basic Science Research Program through the National Research Foundation of Korea (NRF), funded by the Ministry of Education (2016R1D1A1B03932264) (JJ), and, in part, by the ICTP through the OEA-AC-98 (JS).","month":"06","publication_identifier":{"issn":["1742-5468"]},"language":[{"iso":"eng"}],"doi":"10.1088/1742-5468/ab16c8","quality_controlled":"1","oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1808.00249","open_access":"1"}],"external_id":{"arxiv":["1808.00249"]}},{"date_published":"2019-12-01T00:00:00Z","article_type":"original","page":"461-478","publication":"Distributed Computing","citation":{"chicago":"Censor-Hillel, Keren, Petteri Kaski, Janne Korhonen, Christoph Lenzen, Ami Paz, and Jukka Suomela. “Algebraic Methods in the Congested Clique.” Distributed Computing. Springer Nature, 2019. https://doi.org/10.1007/s00446-016-0270-2.","mla":"Censor-Hillel, Keren, et al. “Algebraic Methods in the Congested Clique.” Distributed Computing, vol. 32, no. 6, Springer Nature, 2019, pp. 461–78, doi:10.1007/s00446-016-0270-2.","short":"K. Censor-Hillel, P. Kaski, J. Korhonen, C. Lenzen, A. Paz, J. Suomela, Distributed Computing 32 (2019) 461–478.","ista":"Censor-Hillel K, Kaski P, Korhonen J, Lenzen C, Paz A, Suomela J. 2019. Algebraic methods in the congested clique. Distributed Computing. 32(6), 461–478.","ieee":"K. Censor-Hillel, P. Kaski, J. Korhonen, C. Lenzen, A. Paz, and J. Suomela, “Algebraic methods in the congested clique,” Distributed Computing, vol. 32, no. 6. Springer Nature, pp. 461–478, 2019.","apa":"Censor-Hillel, K., Kaski, P., Korhonen, J., Lenzen, C., Paz, A., & Suomela, J. (2019). Algebraic methods in the congested clique. Distributed Computing. Springer Nature. https://doi.org/10.1007/s00446-016-0270-2","ama":"Censor-Hillel K, Kaski P, Korhonen J, Lenzen C, Paz A, Suomela J. Algebraic methods in the congested clique. Distributed Computing. 2019;32(6):461-478. doi:10.1007/s00446-016-0270-2"},"day":"01","article_processing_charge":"No","oa_version":"Preprint","status":"public","title":"Algebraic methods in the congested clique","intvolume":" 32","_id":"7150","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"In this work, we use algebraic methods for studying distance computation and subgraph detection tasks in the congested clique model. Specifically, we adapt parallel matrix multiplication implementations to the congested clique, obtaining an O(n1−2/ω) round matrix multiplication algorithm, where ω<2.3728639 is the exponent of matrix multiplication. In conjunction with known techniques from centralised algorithmics, this gives significant improvements over previous best upper bounds in the congested clique model. The highlight results include:\r\n\r\n1. triangle and 4-cycle counting in O(n0.158) rounds, improving upon the O(n1/3) algorithm of Dolev et al. [DISC 2012],\r\n2. a (1+o(1))-approximation of all-pairs shortest paths in O(n0.158) rounds, improving upon the O~(n1/2)-round (2+o(1))-approximation algorithm given by Nanongkai [STOC 2014], and\r\n 3. computing the girth in O(n0.158) rounds, which is the first non-trivial solution in this model.\r\n \r\nIn addition, we present a novel constant-round combinatorial algorithm for detecting 4-cycles."}],"issue":"6","type":"journal_article","language":[{"iso":"eng"}],"doi":"10.1007/s00446-016-0270-2","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1503.04963"}],"external_id":{"arxiv":["1503.04963"]},"oa":1,"month":"12","publication_identifier":{"issn":["0178-2770","1432-0452"]},"date_created":"2019-12-05T09:49:49Z","date_updated":"2021-01-12T08:12:05Z","volume":32,"author":[{"last_name":"Censor-Hillel","first_name":"Keren","full_name":"Censor-Hillel, Keren"},{"full_name":"Kaski, Petteri","first_name":"Petteri","last_name":"Kaski"},{"id":"C5402D42-15BC-11E9-A202-CA2BE6697425","last_name":"Korhonen","first_name":"Janne","full_name":"Korhonen, Janne"},{"last_name":"Lenzen","first_name":"Christoph","full_name":"Lenzen, Christoph"},{"full_name":"Paz, Ami","first_name":"Ami","last_name":"Paz"},{"first_name":"Jukka","last_name":"Suomela","full_name":"Suomela, Jukka"}],"publication_status":"published","publisher":"Springer Nature","year":"2019","extern":"1"},{"type":"book_editor","place":"Wiesbaden","abstract":[{"lang":"ger","text":"Wissen Sie, was sich hinter künstlicher Intelligenz und maschinellem Lernen verbirgt? \r\nDieses Sachbuch erklärt Ihnen leicht verständlich und ohne komplizierte Formeln die grundlegenden Methoden und Vorgehensweisen des maschinellen Lernens. Mathematisches Vorwissen ist dafür nicht nötig. Kurzweilig und informativ illustriert Lisa, die Protagonistin des Buches, diese anhand von Alltagssituationen. \r\nEin Buch für alle, die in Diskussionen über Chancen und Risiken der aktuellen Entwicklung der künstlichen Intelligenz und des maschinellen Lernens mit Faktenwissen punkten möchten. Auch für Schülerinnen und Schüler geeignet!"}],"_id":"7171","year":"2019","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","publication_status":"published","title":"Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt","status":"public","editor":[{"full_name":"Kersting, Kristian","last_name":"Kersting","first_name":"Kristian"},{"id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","first_name":"Christoph","last_name":"Lampert","full_name":"Lampert, Christoph"},{"last_name":"Rothkopf","first_name":"Constantin","full_name":"Rothkopf, Constantin"}],"department":[{"_id":"ChLa"}],"publisher":"Springer Nature","edition":"1","related_material":{"link":[{"url":"https://ist.ac.at/en/news/book-release-how-machines-learn/","relation":"press_release","description":"News on IST Website"}]},"date_created":"2019-12-11T14:15:56Z","date_updated":"2021-12-22T14:40:58Z","oa_version":"None","day":"30","month":"10","publication_identifier":{"eisbn":["978-3-658-26763-6"],"isbn":["978-3-658-26762-9"]},"article_processing_charge":"No","citation":{"ama":"Kersting K, Lampert C, Rothkopf C, eds. Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt. 1st ed. Wiesbaden: Springer Nature; 2019. doi:10.1007/978-3-658-26763-6","ista":"Kersting K, Lampert C, Rothkopf C eds. 2019. Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt 1st ed., Wiesbaden: Springer Nature, XIV, 245p.","ieee":"K. Kersting, C. Lampert, and C. Rothkopf, Eds., Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt, 1st ed. Wiesbaden: Springer Nature, 2019.","apa":"Kersting, K., Lampert, C., & Rothkopf, C. (Eds.). (2019). Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt (1st ed.). Wiesbaden: Springer Nature. https://doi.org/10.1007/978-3-658-26763-6","mla":"Kersting, Kristian, et al., editors. Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt. 1st ed., Springer Nature, 2019, doi:10.1007/978-3-658-26763-6.","short":"K. Kersting, C. Lampert, C. Rothkopf, eds., Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt, 1st ed., Springer Nature, Wiesbaden, 2019.","chicago":"Kersting, Kristian, Christoph Lampert, and Constantin Rothkopf, eds. Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt. 1st ed. Wiesbaden: Springer Nature, 2019. https://doi.org/10.1007/978-3-658-26763-6."},"quality_controlled":"1","page":"XIV, 245","date_published":"2019-10-30T00:00:00Z","doi":"10.1007/978-3-658-26763-6","language":[{"iso":"ger"}]},{"_id":"7275","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","title":"Singlet oxygen from cation driven superoxide disproportionation and consequences for aprotic metal–O2 batteries","ddc":["530","541","540"],"intvolume":" 12","file":[{"creator":"dernst","content_type":"application/pdf","file_size":2888027,"file_name":"2019_EnergyEnvironScienc_Mourad.pdf","access_level":"open_access","date_updated":"2020-07-14T12:47:55Z","date_created":"2020-01-30T16:11:05Z","checksum":"94d4cfb2ab0b4c90ef76a7f3cc811feb","file_id":"7424","relation":"main_file"}],"oa_version":"Published Version","type":"journal_article","abstract":[{"lang":"eng","text":"Aprotic alkali metal–oxygen batteries require reversible formation of metal superoxide or peroxide on cycling. Severe parasitic reactions cause poor rechargeability, efficiency, and cycle life and have been shown to be caused by singlet oxygen (1O2) that forms at all stages of cycling. However, its formation mechanism remains unclear. We show that disproportionation of superoxide, the product or intermediate on discharge and charge, to peroxide and oxygen is responsible for 1O2 formation. While the overall reaction is driven by the stability of peroxide and thus favored by stronger Lewis acidic cations such as Li+, the 1O2 fraction is enhanced by weak Lewis acids such as organic cations. Concurrently, the metal peroxide yield drops with increasing 1O2. The results explain a major parasitic pathway during cell cycling and the growing severity in K–, Na–, and Li–O2 cells based on the growing propensity for disproportionation. High capacities and rates with peroxides are now realized to require solution processes, which form peroxide or release O2via disproportionation. The results therefore establish the central dilemma that disproportionation is required for high capacity but also responsible for irreversible reactions. Highly reversible cell operation requires hence finding reaction routes that avoid disproportionation."}],"issue":"8","publication":"Energy & Environmental Science","citation":{"apa":"Mourad, E., Petit, Y. K., Spezia, R., Samojlov, A., Summa, F. F., Prehal, C., … Freunberger, S. A. (2019). Singlet oxygen from cation driven superoxide disproportionation and consequences for aprotic metal–O2 batteries. Energy & Environmental Science. RSC. https://doi.org/10.1039/c9ee01453e","ieee":"E. Mourad et al., “Singlet oxygen from cation driven superoxide disproportionation and consequences for aprotic metal–O2 batteries,” Energy & Environmental Science, vol. 12, no. 8. RSC, pp. 2559–2568, 2019.","ista":"Mourad E, Petit YK, Spezia R, Samojlov A, Summa FF, Prehal C, Leypold C, Mahne N, Slugovc C, Fontaine O, Brutti S, Freunberger SA. 2019. Singlet oxygen from cation driven superoxide disproportionation and consequences for aprotic metal–O2 batteries. Energy & Environmental Science. 12(8), 2559–2568.","ama":"Mourad E, Petit YK, Spezia R, et al. Singlet oxygen from cation driven superoxide disproportionation and consequences for aprotic metal–O2 batteries. Energy & Environmental Science. 2019;12(8):2559-2568. doi:10.1039/c9ee01453e","chicago":"Mourad, Eléonore, Yann K. Petit, Riccardo Spezia, Aleksej Samojlov, Francesco F. Summa, Christian Prehal, Christian Leypold, et al. “Singlet Oxygen from Cation Driven Superoxide Disproportionation and Consequences for Aprotic Metal–O2 Batteries.” Energy & Environmental Science. RSC, 2019. https://doi.org/10.1039/c9ee01453e.","short":"E. Mourad, Y.K. Petit, R. Spezia, A. Samojlov, F.F. Summa, C. Prehal, C. Leypold, N. Mahne, C. Slugovc, O. Fontaine, S. Brutti, S.A. Freunberger, Energy & Environmental Science 12 (2019) 2559–2568.","mla":"Mourad, Eléonore, et al. “Singlet Oxygen from Cation Driven Superoxide Disproportionation and Consequences for Aprotic Metal–O2 Batteries.” Energy & Environmental Science, vol. 12, no. 8, RSC, 2019, pp. 2559–68, doi:10.1039/c9ee01453e."},"article_type":"original","page":"2559-2568","date_published":"2019-08-01T00:00:00Z","day":"01","has_accepted_license":"1","article_processing_charge":"No","year":"2019","publication_status":"published","publisher":"RSC","author":[{"full_name":"Mourad, Eléonore","last_name":"Mourad","first_name":"Eléonore"},{"full_name":"Petit, Yann K.","first_name":"Yann K.","last_name":"Petit"},{"first_name":"Riccardo","last_name":"Spezia","full_name":"Spezia, Riccardo"},{"last_name":"Samojlov","first_name":"Aleksej","full_name":"Samojlov, Aleksej"},{"full_name":"Summa, Francesco F.","last_name":"Summa","first_name":"Francesco F."},{"first_name":"Christian","last_name":"Prehal","full_name":"Prehal, Christian"},{"full_name":"Leypold, Christian","first_name":"Christian","last_name":"Leypold"},{"last_name":"Mahne","first_name":"Nika","full_name":"Mahne, Nika"},{"full_name":"Slugovc, Christian","first_name":"Christian","last_name":"Slugovc"},{"last_name":"Fontaine","first_name":"Olivier","full_name":"Fontaine, Olivier"},{"last_name":"Brutti","first_name":"Sergio","full_name":"Brutti, Sergio"},{"last_name":"Freunberger","first_name":"Stefan Alexander","orcid":"0000-0003-2902-5319","id":"A8CA28E6-CE23-11E9-AD2D-EC27E6697425","full_name":"Freunberger, Stefan Alexander"}],"date_created":"2020-01-15T07:18:04Z","date_updated":"2021-01-12T08:12:41Z","volume":12,"file_date_updated":"2020-07-14T12:47:55Z","license":"https://creativecommons.org/licenses/by-nc/4.0/","extern":"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)"},"quality_controlled":"1","doi":"10.1039/c9ee01453e","language":[{"iso":"eng"}],"month":"08","publication_identifier":{"issn":["1754-5692","1754-5706"]}},{"file":[{"file_id":"7355","relation":"main_file","date_created":"2020-01-22T15:58:54Z","date_updated":"2020-07-14T12:47:55Z","checksum":"123dd33e7f26761c82c74e10811a1e4d","file_name":"2019_NatureComm_Kwak.pdf","access_level":"open_access","creator":"dernst","content_type":"application/pdf","file_size":1003676}],"oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"7280","intvolume":" 10","title":"Deactivation of redox mediators in lithium-oxygen batteries by singlet oxygen","status":"public","ddc":["540"],"abstract":[{"lang":"eng","text":"Non-aqueous lithium-oxygen batteries cycle by forming lithium peroxide during discharge and oxidizing it during recharge. The significant problem of oxidizing the solid insulating lithium peroxide can greatly be facilitated by incorporating redox mediators that shuttle electron-holes between the porous substrate and lithium peroxide. Redox mediator stability is thus key for energy efficiency, reversibility, and cycle life. However, the gradual deactivation of redox mediators during repeated cycling has not conclusively been explained. Here, we show that organic redox mediators are predominantly decomposed by singlet oxygen that forms during cycling. Their reaction with superoxide, previously assumed to mainly trigger their degradation, peroxide, and dioxygen, is orders of magnitude slower in comparison. The reduced form of the mediator is markedly more reactive towards singlet oxygen than the oxidized form, from which we derive reaction mechanisms supported by density functional theory calculations. Redox mediators must thus be designed for stability against singlet oxygen."}],"type":"journal_article","date_published":"2019-03-26T00:00:00Z","citation":{"chicago":"Kwak, Won-Jin, Hun Kim, Yann K. Petit, Christian Leypold, Trung Thien Nguyen, Nika Mahne, Paul Redfern, et al. “Deactivation of Redox Mediators in Lithium-Oxygen Batteries by Singlet Oxygen.” Nature Communications. Springer Nature, 2019. https://doi.org/10.1038/s41467-019-09399-0.","short":"W.-J. Kwak, H. Kim, Y.K. Petit, C. Leypold, T.T. Nguyen, N. Mahne, P. Redfern, L.A. Curtiss, H.-G. Jung, S.M. Borisov, S.A. Freunberger, Y.-K. Sun, Nature Communications 10 (2019).","mla":"Kwak, Won-Jin, et al. “Deactivation of Redox Mediators in Lithium-Oxygen Batteries by Singlet Oxygen.” Nature Communications, vol. 10, 1380, Springer Nature, 2019, doi:10.1038/s41467-019-09399-0.","ieee":"W.-J. Kwak et al., “Deactivation of redox mediators in lithium-oxygen batteries by singlet oxygen,” Nature Communications, vol. 10. Springer Nature, 2019.","apa":"Kwak, W.-J., Kim, H., Petit, Y. K., Leypold, C., Nguyen, T. T., Mahne, N., … Sun, Y.-K. (2019). Deactivation of redox mediators in lithium-oxygen batteries by singlet oxygen. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-019-09399-0","ista":"Kwak W-J, Kim H, Petit YK, Leypold C, Nguyen TT, Mahne N, Redfern P, Curtiss LA, Jung H-G, Borisov SM, Freunberger SA, Sun Y-K. 2019. Deactivation of redox mediators in lithium-oxygen batteries by singlet oxygen. Nature Communications. 10, 1380.","ama":"Kwak W-J, Kim H, Petit YK, et al. Deactivation of redox mediators in lithium-oxygen batteries by singlet oxygen. Nature Communications. 2019;10. doi:10.1038/s41467-019-09399-0"},"publication":"Nature Communications","article_type":"original","has_accepted_license":"1","article_processing_charge":"No","day":"26","author":[{"full_name":"Kwak, Won-Jin","last_name":"Kwak","first_name":"Won-Jin"},{"first_name":"Hun","last_name":"Kim","full_name":"Kim, Hun"},{"full_name":"Petit, Yann K.","first_name":"Yann K.","last_name":"Petit"},{"last_name":"Leypold","first_name":"Christian","full_name":"Leypold, Christian"},{"full_name":"Nguyen, Trung Thien","first_name":"Trung Thien","last_name":"Nguyen"},{"full_name":"Mahne, Nika","first_name":"Nika","last_name":"Mahne"},{"last_name":"Redfern","first_name":"Paul","full_name":"Redfern, Paul"},{"first_name":"Larry A.","last_name":"Curtiss","full_name":"Curtiss, Larry A."},{"last_name":"Jung","first_name":"Hun-Gi","full_name":"Jung, Hun-Gi"},{"full_name":"Borisov, Sergey M.","first_name":"Sergey M.","last_name":"Borisov"},{"full_name":"Freunberger, Stefan Alexander","last_name":"Freunberger","first_name":"Stefan Alexander","orcid":"0000-0003-2902-5319","id":"A8CA28E6-CE23-11E9-AD2D-EC27E6697425"},{"full_name":"Sun, Yang-Kook","first_name":"Yang-Kook","last_name":"Sun"}],"volume":10,"date_created":"2020-01-15T12:12:26Z","date_updated":"2021-01-12T08:12:44Z","year":"2019","publisher":"Springer Nature","publication_status":"published","file_date_updated":"2020-07-14T12:47:55Z","extern":"1","article_number":"1380","doi":"10.1038/s41467-019-09399-0","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,"quality_controlled":"1","publication_identifier":{"issn":["2041-1723"]},"month":"03"},{"article_type":"original","page":"6535-6539","publication":"Angewandte Chemie International Edition","citation":{"mla":"Petit, Yann K., et al. “DABCOnium: An Efficient and High-Voltage Stable Singlet Oxygen Quencher for Metal-O2 Cells.” Angewandte Chemie International Edition, vol. 58, no. 20, Wiley, 2019, pp. 6535–39, doi:10.1002/anie.201901869.","short":"Y.K. Petit, C. Leypold, N. Mahne, E. Mourad, L. Schafzahl, C. Slugovc, S.M. Borisov, S.A. Freunberger, Angewandte Chemie International Edition 58 (2019) 6535–6539.","chicago":"Petit, Yann K., Christian Leypold, Nika Mahne, Eléonore Mourad, Lukas Schafzahl, Christian Slugovc, Sergey M. Borisov, and Stefan Alexander Freunberger. “DABCOnium: An Efficient and High-Voltage Stable Singlet Oxygen Quencher for Metal-O2 Cells.” Angewandte Chemie International Edition. Wiley, 2019. https://doi.org/10.1002/anie.201901869.","ama":"Petit YK, Leypold C, Mahne N, et al. DABCOnium: An efficient and high-voltage stable singlet oxygen quencher for metal-O2 cells. Angewandte Chemie International Edition. 2019;58(20):6535-6539. doi:10.1002/anie.201901869","ista":"Petit YK, Leypold C, Mahne N, Mourad E, Schafzahl L, Slugovc C, Borisov SM, Freunberger SA. 2019. DABCOnium: An efficient and high-voltage stable singlet oxygen quencher for metal-O2 cells. Angewandte Chemie International Edition. 58(20), 6535–6539.","apa":"Petit, Y. K., Leypold, C., Mahne, N., Mourad, E., Schafzahl, L., Slugovc, C., … Freunberger, S. A. (2019). DABCOnium: An efficient and high-voltage stable singlet oxygen quencher for metal-O2 cells. Angewandte Chemie International Edition. Wiley. https://doi.org/10.1002/anie.201901869","ieee":"Y. K. Petit et al., “DABCOnium: An efficient and high-voltage stable singlet oxygen quencher for metal-O2 cells,” Angewandte Chemie International Edition, vol. 58, no. 20. Wiley, pp. 6535–6539, 2019."},"date_published":"2019-05-13T00:00:00Z","day":"13","article_processing_charge":"No","has_accepted_license":"1","ddc":["540"],"title":"DABCOnium: An efficient and high-voltage stable singlet oxygen quencher for metal-O2 cells","status":"public","intvolume":" 58","_id":"7276","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","file":[{"file_name":"2019_AngewChemie_Petit.pdf","access_level":"open_access","content_type":"application/pdf","file_size":952737,"creator":"dernst","relation":"main_file","file_id":"7356","date_updated":"2020-07-14T12:47:55Z","date_created":"2020-01-22T16:16:54Z","checksum":"9620b6a511a910d7abe1f26c42dc7f83"}],"type":"journal_article","abstract":[{"lang":"eng","text":"Singlet oxygen (1O2) causes a major fraction of the parasitic chemistry during the cycling of non‐aqueous alkali metal‐O2 batteries and also contributes to interfacial reactivity of transition‐metal oxide intercalation compounds. We introduce DABCOnium, the mono alkylated form of 1,4‐diazabicyclo[2.2.2]octane (DABCO), as an efficient 1O2 quencher with an unusually high oxidative stability of ca. 4.2 V vs. Li/Li+. Previous quenchers are strongly Lewis basic amines with too low oxidative stability. DABCOnium is an ionic liquid, non‐volatile, highly soluble in the electrolyte, stable against superoxide and peroxide, and compatible with lithium metal. The electrochemical stability covers the required range for metal–O2 batteries and greatly reduces 1O2 related parasitic chemistry as demonstrated for the Li–O2 cell."}],"issue":"20","quality_controlled":"1","oa":1,"tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png"},"language":[{"iso":"eng"}],"doi":"10.1002/anie.201901869","month":"05","publication_identifier":{"issn":["1433-7851"]},"publication_status":"published","publisher":"Wiley","year":"2019","date_created":"2020-01-15T07:19:27Z","date_updated":"2021-01-12T08:12:42Z","volume":58,"author":[{"first_name":"Yann K.","last_name":"Petit","full_name":"Petit, Yann K."},{"first_name":"Christian","last_name":"Leypold","full_name":"Leypold, Christian"},{"first_name":"Nika","last_name":"Mahne","full_name":"Mahne, Nika"},{"full_name":"Mourad, Eléonore","last_name":"Mourad","first_name":"Eléonore"},{"full_name":"Schafzahl, Lukas","last_name":"Schafzahl","first_name":"Lukas"},{"full_name":"Slugovc, Christian","first_name":"Christian","last_name":"Slugovc"},{"last_name":"Borisov","first_name":"Sergey M.","full_name":"Borisov, Sergey M."},{"last_name":"Freunberger","first_name":"Stefan Alexander","orcid":"0000-0003-2902-5319","id":"A8CA28E6-CE23-11E9-AD2D-EC27E6697425","full_name":"Freunberger, Stefan Alexander"}],"extern":"1","file_date_updated":"2020-07-14T12:47:55Z"},{"issue":"11","abstract":[{"lang":"eng","text":"Li–O2 batteries are plagued by side reactions that cause poor rechargeability and efficiency. These reactions were recently revealed to be predominantly caused by singlet oxygen, which can be neutralized by chemical traps or physical quenchers. However, traps are irreversibly consumed and thus only active for a limited time, and so far identified quenchers lack oxidative stability to be suitable for typically required recharge potentials. Thus, reducing the charge potential within the stability limit of the quencher and/or finding more stable quenchers is required. Here, we show that dimethylphenazine as a redox mediator decreases the charge potential well within the stability limit of the quencher 1,4-diazabicyclo[2.2.2]octane. The quencher can thus mitigate the parasitic reactions without being oxidatively decomposed. At the same time the quencher protects the redox mediator from singlet oxygen attack. The mutual conservation of the redox mediator and the quencher is rational for stable and effective Li–O2 batteries."}],"type":"journal_article","file":[{"file_id":"8053","relation":"main_file","date_created":"2020-06-29T15:19:30Z","date_updated":"2020-07-14T12:47:55Z","checksum":"bbaebfe5ff0bcab6235821ba3460b7de","file_name":"Revised Manuscript.pdf","access_level":"open_access","creator":"sfreunbe","file_size":1199086,"content_type":"application/pdf"}],"oa_version":"Submitted Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"7281","intvolume":" 9","ddc":["540"],"status":"public","title":"Mutual conservation of redox mediator and singlet oxygen quencher in Lithium–Oxygen batteries","has_accepted_license":"1","article_processing_charge":"No","day":"01","date_published":"2019-11-01T00:00:00Z","citation":{"ista":"Kwak W-J, Freunberger SA, Kim H, Park J, Nguyen TT, Jung H-G, Byon HR, Sun Y-K. 2019. Mutual conservation of redox mediator and singlet oxygen quencher in Lithium–Oxygen batteries. ACS Catalysis. 9(11), 9914–9922.","apa":"Kwak, W.-J., Freunberger, S. A., Kim, H., Park, J., Nguyen, T. T., Jung, H.-G., … Sun, Y.-K. (2019). Mutual conservation of redox mediator and singlet oxygen quencher in Lithium–Oxygen batteries. ACS Catalysis. ACS. https://doi.org/10.1021/acscatal.9b01337","ieee":"W.-J. Kwak et al., “Mutual conservation of redox mediator and singlet oxygen quencher in Lithium–Oxygen batteries,” ACS Catalysis, vol. 9, no. 11. ACS, pp. 9914–9922, 2019.","ama":"Kwak W-J, Freunberger SA, Kim H, et al. Mutual conservation of redox mediator and singlet oxygen quencher in Lithium–Oxygen batteries. ACS Catalysis. 2019;9(11):9914-9922. doi:10.1021/acscatal.9b01337","chicago":"Kwak, Won-Jin, Stefan Alexander Freunberger, Hun Kim, Jiwon Park, Trung Thien Nguyen, Hun-Gi Jung, Hye Ryung Byon, and Yang-Kook Sun. “Mutual Conservation of Redox Mediator and Singlet Oxygen Quencher in Lithium–Oxygen Batteries.” ACS Catalysis. ACS, 2019. https://doi.org/10.1021/acscatal.9b01337.","mla":"Kwak, Won-Jin, et al. “Mutual Conservation of Redox Mediator and Singlet Oxygen Quencher in Lithium–Oxygen Batteries.” ACS Catalysis, vol. 9, no. 11, ACS, 2019, pp. 9914–22, doi:10.1021/acscatal.9b01337.","short":"W.-J. Kwak, S.A. Freunberger, H. Kim, J. Park, T.T. Nguyen, H.-G. Jung, H.R. Byon, Y.-K. Sun, ACS Catalysis 9 (2019) 9914–9922."},"publication":"ACS Catalysis","page":"9914-9922","article_type":"original","file_date_updated":"2020-07-14T12:47:55Z","extern":"1","author":[{"full_name":"Kwak, Won-Jin","last_name":"Kwak","first_name":"Won-Jin"},{"full_name":"Freunberger, Stefan Alexander","last_name":"Freunberger","first_name":"Stefan Alexander","orcid":"0000-0003-2902-5319","id":"A8CA28E6-CE23-11E9-AD2D-EC27E6697425"},{"first_name":"Hun","last_name":"Kim","full_name":"Kim, Hun"},{"first_name":"Jiwon","last_name":"Park","full_name":"Park, Jiwon"},{"full_name":"Nguyen, Trung Thien","first_name":"Trung Thien","last_name":"Nguyen"},{"full_name":"Jung, Hun-Gi","last_name":"Jung","first_name":"Hun-Gi"},{"last_name":"Byon","first_name":"Hye Ryung","full_name":"Byon, Hye Ryung"},{"full_name":"Sun, Yang-Kook","last_name":"Sun","first_name":"Yang-Kook"}],"volume":9,"date_updated":"2021-01-12T08:12:44Z","date_created":"2020-01-15T12:12:40Z","year":"2019","publisher":"ACS","publication_status":"published","publication_identifier":{"issn":["2155-5435"]},"month":"11","doi":"10.1021/acscatal.9b01337","language":[{"iso":"eng"}],"oa":1,"quality_controlled":"1"},{"oa":1,"quality_controlled":"1","doi":"10.1038/s41557-019-0311-0","language":[{"iso":"eng"}],"publication_identifier":{"issn":["1755-4330","1755-4349"]},"month":"08","year":"2019","publisher":"Springer Nature","publication_status":"published","author":[{"last_name":"Freunberger","first_name":"Stefan Alexander","orcid":"0000-0003-2902-5319","id":"A8CA28E6-CE23-11E9-AD2D-EC27E6697425","full_name":"Freunberger, Stefan Alexander"}],"volume":11,"date_created":"2020-01-15T12:12:53Z","date_updated":"2021-01-12T08:12:44Z","file_date_updated":"2020-07-14T12:47:55Z","extern":"1","citation":{"chicago":"Freunberger, Stefan Alexander. “Interphase Identity Crisis.” Nature Chemistry. Springer Nature, 2019. https://doi.org/10.1038/s41557-019-0311-0.","mla":"Freunberger, Stefan Alexander. “Interphase Identity Crisis.” Nature Chemistry, vol. 11, no. 9, Springer Nature, 2019, pp. 761–63, doi:10.1038/s41557-019-0311-0.","short":"S.A. Freunberger, Nature Chemistry 11 (2019) 761–763.","ista":"Freunberger SA. 2019. Interphase identity crisis. Nature Chemistry. 11(9), 761–763.","apa":"Freunberger, S. A. (2019). Interphase identity crisis. Nature Chemistry. Springer Nature. https://doi.org/10.1038/s41557-019-0311-0","ieee":"S. A. Freunberger, “Interphase identity crisis,” Nature Chemistry, vol. 11, no. 9. Springer Nature, pp. 761–763, 2019.","ama":"Freunberger SA. Interphase identity crisis. Nature Chemistry. 2019;11(9):761-763. doi:10.1038/s41557-019-0311-0"},"publication":"Nature Chemistry","page":"761-763","article_type":"letter_note","date_published":"2019-08-19T00:00:00Z","article_processing_charge":"No","has_accepted_license":"1","day":"19","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"7282","intvolume":" 11","ddc":["540","547"],"status":"public","title":"Interphase identity crisis","oa_version":"Submitted Version","file":[{"access_level":"open_access","file_name":"Freunberger on Eichhorn.pdf","creator":"sfreunbe","content_type":"application/pdf","file_size":286805,"file_id":"8054","relation":"main_file","checksum":"76806cff3d5b62f846499a8617cee7ef","date_created":"2020-06-29T15:38:21Z","date_updated":"2020-07-14T12:47:55Z"}],"type":"journal_article","issue":"9","abstract":[{"lang":"eng","text":"Interphases that form on the anode surface of lithium-ion batteries are critical for performance and lifetime, but are poorly understood. Now, a decade-old misconception regarding a main component of the interphase has been revealed, which could potentially lead to improved devices."}]},{"publication_identifier":{"issn":["1476-1122","1476-4660"]},"month":"03","oa":1,"quality_controlled":"1","doi":"10.1038/s41563-019-0313-8","language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:47:55Z","extern":"1","year":"2019","publisher":"Springer Nature","publication_status":"published","author":[{"last_name":"Petit","first_name":"Yann K.","full_name":"Petit, Yann K."},{"full_name":"Freunberger, Stefan Alexander","first_name":"Stefan Alexander","last_name":"Freunberger","id":"A8CA28E6-CE23-11E9-AD2D-EC27E6697425","orcid":"0000-0003-2902-5319"}],"volume":18,"date_created":"2020-01-15T12:13:05Z","date_updated":"2021-01-12T08:12:45Z","has_accepted_license":"1","article_processing_charge":"No","day":"20","citation":{"ieee":"Y. K. Petit and S. A. Freunberger, “Thousands of cycles,” Nature Materials, vol. 18, no. 4. Springer Nature, pp. 301–302, 2019.","apa":"Petit, Y. K., & Freunberger, S. A. (2019). Thousands of cycles. Nature Materials. Springer Nature. https://doi.org/10.1038/s41563-019-0313-8","ista":"Petit YK, Freunberger SA. 2019. Thousands of cycles. Nature Materials. 18(4), 301–302.","ama":"Petit YK, Freunberger SA. Thousands of cycles. Nature Materials. 2019;18(4):301-302. doi:10.1038/s41563-019-0313-8","chicago":"Petit, Yann K., and Stefan Alexander Freunberger. “Thousands of Cycles.” Nature Materials. Springer Nature, 2019. https://doi.org/10.1038/s41563-019-0313-8.","short":"Y.K. Petit, S.A. Freunberger, Nature Materials 18 (2019) 301–302.","mla":"Petit, Yann K., and Stefan Alexander Freunberger. “Thousands of Cycles.” Nature Materials, vol. 18, no. 4, Springer Nature, 2019, pp. 301–02, doi:10.1038/s41563-019-0313-8."},"publication":"Nature Materials","page":"301-302","article_type":"letter_note","date_published":"2019-03-20T00:00:00Z","type":"journal_article","issue":"4","abstract":[{"text":"Potassium–air batteries, which suffer from oxygen cathode and potassium metal anode degradation, can be cycled thousands of times when an organic anode replaces the metal.","lang":"eng"}],"_id":"7283","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 18","status":"public","ddc":["540","541"],"title":"Thousands of cycles","file":[{"creator":"sfreunbe","content_type":"application/pdf","file_size":398123,"file_name":"NaV_final.pdf","access_level":"open_access","date_updated":"2020-07-14T12:47:55Z","date_created":"2020-06-29T16:26:54Z","checksum":"4c9a0314327028a22dd902bc109b8798","file_id":"8059","relation":"main_file"}],"oa_version":"Submitted Version"},{"publication":"Joule","citation":{"short":"C. Prehal, S.A. Freunberger, Joule 3 (2019) 321–323.","mla":"Prehal, Christian, and Stefan Alexander Freunberger. “Li-O2 Cell-Scale Energy Densities.” Joule, vol. 3, no. 2, Elsevier, 2019, pp. 321–23, doi:10.1016/j.joule.2019.01.020.","chicago":"Prehal, Christian, and Stefan Alexander Freunberger. “Li-O2 Cell-Scale Energy Densities.” Joule. Elsevier, 2019. https://doi.org/10.1016/j.joule.2019.01.020.","ama":"Prehal C, Freunberger SA. Li-O2 cell-scale energy densities. Joule. 2019;3(2):321-323. doi:10.1016/j.joule.2019.01.020","ieee":"C. Prehal and S. A. Freunberger, “Li-O2 cell-scale energy densities,” Joule, vol. 3, no. 2. Elsevier, pp. 321–323, 2019.","apa":"Prehal, C., & Freunberger, S. A. (2019). Li-O2 cell-scale energy densities. Joule. Elsevier. https://doi.org/10.1016/j.joule.2019.01.020","ista":"Prehal C, Freunberger SA. 2019. Li-O2 cell-scale energy densities. Joule. 3(2), 321–323."},"article_type":"review","page":"321-323","date_published":"2019-02-20T00:00:00Z","day":"20","article_processing_charge":"No","_id":"7284","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Li-O2 cell-scale energy densities","status":"public","intvolume":" 3","oa_version":"Published Version","type":"journal_article","abstract":[{"lang":"eng","text":"In this issue of Joule, Dongmin Im and coworkers from Samsung in South Korea describe a prototype lithium-O2 battery that reaches ∼700 Wh kg–1 and ∼600 Wh L–1 on the cell level. They cut all components to the minimum to reach this value. Difficulties filling the pores with discharge product and inhomogeneous cell utilization turn out to limit the achievable energy. Their work underlines the importance of reporting performance with respect to full cell weight and volume."}],"issue":"2","main_file_link":[{"open_access":"1","url":"https://www.doi.org/10.1016/j.joule.2019.01.020"}],"oa":1,"quality_controlled":"1","doi":"10.1016/j.joule.2019.01.020","language":[{"iso":"eng"}],"month":"02","publication_identifier":{"issn":["2542-4351"]},"year":"2019","publication_status":"published","publisher":"Elsevier","author":[{"last_name":"Prehal","first_name":"Christian","full_name":"Prehal, Christian"},{"orcid":"0000-0003-2902-5319","id":"A8CA28E6-CE23-11E9-AD2D-EC27E6697425","last_name":"Freunberger","first_name":"Stefan Alexander","full_name":"Freunberger, Stefan Alexander"}],"date_updated":"2021-01-12T08:12:45Z","date_created":"2020-01-15T12:13:15Z","volume":3,"extern":"1"},{"extern":"1","abstract":[{"lang":"eng","text":"Telencephalic organoids generated from human pluripotent stem cells (hPSCs) are emerging as an effective system to study the distinct features of the developing human brain and the underlying causes of many neurological disorders. While progress in organoid technology has been steadily advancing, many challenges remain including rampant batch-to-batch and cell line-to-cell line variability and irreproducibility. Here, we demonstrate that a major contributor to successful cortical organoid production is the manner in which hPSCs are maintained prior to differentiation. Optimal results were achieved using fibroblast-feeder-supported hPSCs compared to feeder-independent cells, related to differences in their transcriptomic states. Feeder-supported hPSCs display elevated activation of diverse TGFβ superfamily signaling pathways and increased expression of genes associated with naïve pluripotency. We further identify combinations of TGFβ-related growth factors that are necessary and together sufficient to impart broad telencephalic organoid competency to feeder-free hPSCs and enable reproducible formation of brain structures suitable for disease modeling."}],"type":"preprint","date_updated":"2022-06-17T08:03:32Z","date_created":"2020-01-23T09:53:40Z","oa_version":"Preprint","author":[{"first_name":"Momoko","last_name":"Watanabe","full_name":"Watanabe, Momoko"},{"full_name":"Haney, Jillian R.","first_name":"Jillian R.","last_name":"Haney"},{"full_name":"Vishlaghi, Neda","first_name":"Neda","last_name":"Vishlaghi"},{"last_name":"Turcios","first_name":"Felix","full_name":"Turcios, Felix"},{"first_name":"Jessie E.","last_name":"Buth","full_name":"Buth, Jessie E."},{"last_name":"Gu","first_name":"Wen","full_name":"Gu, Wen"},{"full_name":"Collier, Amanda J.","first_name":"Amanda J.","last_name":"Collier"},{"last_name":"Miranda","first_name":"Osvaldo","orcid":"0000-0001-6618-6889","id":"862A3C56-A8BF-11E9-B4FA-D9E3E5697425","full_name":"Miranda, Osvaldo"},{"last_name":"Chen","first_name":"Di","full_name":"Chen, Di"},{"full_name":"Sabri, Shan","first_name":"Shan","last_name":"Sabri"},{"first_name":"Amander T.","last_name":"Clark","full_name":"Clark, Amander T."},{"last_name":"Plath","first_name":"Kathrin","full_name":"Plath, Kathrin"},{"first_name":"Heather R.","last_name":"Christofk","full_name":"Christofk, Heather R."},{"full_name":"Gandal, Michael J.","first_name":"Michael J.","last_name":"Gandal"},{"full_name":"Novitch, Bennett G.","first_name":"Bennett G.","last_name":"Novitch"}],"title":"TGFβ superfamily signaling regulates the state of human stem cell pluripotency and competency to create telencephalic organoids","publication_status":"published","status":"public","publisher":"Cold Spring Harbor Laboratory","year":"2019","_id":"7358","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"12","day":"13","article_processing_charge":"No","language":[{"iso":"eng"}],"date_published":"2019-12-13T00:00:00Z","doi":"10.1101/2019.12.13.875773","page":"75","publication":"bioRxiv","oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1101/2019.12.13.875773"}],"citation":{"ista":"Watanabe M, Haney JR, Vishlaghi N, Turcios F, Buth JE, Gu W, Collier AJ, Miranda O, Chen D, Sabri S, Clark AT, Plath K, Christofk HR, Gandal MJ, Novitch BG. 2019. TGFβ superfamily signaling regulates the state of human stem cell pluripotency and competency to create telencephalic organoids. bioRxiv, 10.1101/2019.12.13.875773.","apa":"Watanabe, M., Haney, J. R., Vishlaghi, N., Turcios, F., Buth, J. E., Gu, W., … Novitch, B. G. (2019). TGFβ superfamily signaling regulates the state of human stem cell pluripotency and competency to create telencephalic organoids. bioRxiv. Cold Spring Harbor Laboratory. https://doi.org/10.1101/2019.12.13.875773","ieee":"M. Watanabe et al., “TGFβ superfamily signaling regulates the state of human stem cell pluripotency and competency to create telencephalic organoids,” bioRxiv. Cold Spring Harbor Laboratory, 2019.","ama":"Watanabe M, Haney JR, Vishlaghi N, et al. TGFβ superfamily signaling regulates the state of human stem cell pluripotency and competency to create telencephalic organoids. bioRxiv. 2019. doi:10.1101/2019.12.13.875773","chicago":"Watanabe, Momoko, Jillian R. Haney, Neda Vishlaghi, Felix Turcios, Jessie E. Buth, Wen Gu, Amanda J. Collier, et al. “TGFβ Superfamily Signaling Regulates the State of Human Stem Cell Pluripotency and Competency to Create Telencephalic Organoids.” BioRxiv. Cold Spring Harbor Laboratory, 2019. https://doi.org/10.1101/2019.12.13.875773.","mla":"Watanabe, Momoko, et al. “TGFβ Superfamily Signaling Regulates the State of Human Stem Cell Pluripotency and Competency to Create Telencephalic Organoids.” BioRxiv, Cold Spring Harbor Laboratory, 2019, doi:10.1101/2019.12.13.875773.","short":"M. Watanabe, J.R. Haney, N. Vishlaghi, F. Turcios, J.E. Buth, W. Gu, A.J. Collier, O. Miranda, D. Chen, S. Sabri, A.T. Clark, K. Plath, H.R. Christofk, M.J. Gandal, B.G. Novitch, BioRxiv (2019)."}},{"article_number":"39","file_date_updated":"2020-07-14T12:47:57Z","year":"2019","department":[{"_id":"UlWa"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","publication_status":"published","author":[{"id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8485-1774","first_name":"Radoslav","last_name":"Fulek","full_name":"Fulek, Radoslav"},{"full_name":"Kyncl, Jan","first_name":"Jan","last_name":"Kyncl"}],"volume":129,"date_created":"2020-01-29T16:17:05Z","date_updated":"2021-01-12T08:13:24Z","publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-95977-104-7"]},"month":"06","external_id":{"arxiv":["1903.08637"]},"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":[{"call_identifier":"FWF","name":"Eliminating intersections in drawings of graphs","_id":"261FA626-B435-11E9-9278-68D0E5697425","grant_number":"M02281"}],"quality_controlled":"1","doi":"10.4230/LIPICS.SOCG.2019.39","conference":{"location":"Portland, OR, United States","start_date":"2019-06-18","end_date":"2019-06-21","name":"SoCG: Symposium on Computational Geometry"},"language":[{"iso":"eng"}],"type":"conference","alternative_title":["LIPIcs"],"abstract":[{"text":"The genus g(G) of a graph G is the minimum g such that G has an embedding on the orientable surface M_g of genus g. A drawing of a graph on a surface is independently even if every pair of nonadjacent edges in the drawing crosses an even number of times. The Z_2-genus of a graph G, denoted by g_0(G), is the minimum g such that G has an independently even drawing on M_g. By a result of Battle, Harary, Kodama and Youngs from 1962, the graph genus is additive over 2-connected blocks. In 2013, Schaefer and Stefankovic proved that the Z_2-genus of a graph is additive over 2-connected blocks as well, and asked whether this result can be extended to so-called 2-amalgamations, as an analogue of results by Decker, Glover, Huneke, and Stahl for the genus. We give the following partial answer. If G=G_1 cup G_2, G_1 and G_2 intersect in two vertices u and v, and G-u-v has k connected components (among which we count the edge uv if present), then |g_0(G)-(g_0(G_1)+g_0(G_2))|<=k+1. For complete bipartite graphs K_{m,n}, with n >= m >= 3, we prove that g_0(K_{m,n})/g(K_{m,n})=1-O(1/n). Similar results are proved also for the Euler Z_2-genus. We express the Z_2-genus of a graph using the minimum rank of partial symmetric matrices over Z_2; a problem that might be of independent interest. ","lang":"eng"}],"_id":"7401","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 129","status":"public","ddc":["000"],"title":"Z_2-Genus of graphs and minimum rank of partial symmetric matrices","file":[{"creator":"dernst","content_type":"application/pdf","file_size":628347,"access_level":"open_access","file_name":"2019_LIPIcs_Fulek.pdf","checksum":"aac37b09118cc0ab58cf77129e691f8c","date_created":"2020-02-04T09:14:31Z","date_updated":"2020-07-14T12:47:57Z","file_id":"7445","relation":"main_file"}],"oa_version":"Published Version","scopus_import":1,"article_processing_charge":"No","has_accepted_license":"1","day":"01","citation":{"ista":"Fulek R, Kyncl J. 2019. Z_2-Genus of graphs and minimum rank of partial symmetric matrices. 35th International Symposium on Computational Geometry (SoCG 2019). SoCG: Symposium on Computational Geometry, LIPIcs, vol. 129, 39.","ieee":"R. Fulek and J. Kyncl, “Z_2-Genus of graphs and minimum rank of partial symmetric matrices,” in 35th International Symposium on Computational Geometry (SoCG 2019), Portland, OR, United States, 2019, vol. 129.","apa":"Fulek, R., & Kyncl, J. (2019). Z_2-Genus of graphs and minimum rank of partial symmetric matrices. In 35th International Symposium on Computational Geometry (SoCG 2019) (Vol. 129). Portland, OR, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.SOCG.2019.39","ama":"Fulek R, Kyncl J. Z_2-Genus of graphs and minimum rank of partial symmetric matrices. In: 35th International Symposium on Computational Geometry (SoCG 2019). Vol 129. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.SOCG.2019.39","chicago":"Fulek, Radoslav, and Jan Kyncl. “Z_2-Genus of Graphs and Minimum Rank of Partial Symmetric Matrices.” In 35th International Symposium on Computational Geometry (SoCG 2019), Vol. 129. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.SOCG.2019.39.","mla":"Fulek, Radoslav, and Jan Kyncl. “Z_2-Genus of Graphs and Minimum Rank of Partial Symmetric Matrices.” 35th International Symposium on Computational Geometry (SoCG 2019), vol. 129, 39, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.SOCG.2019.39.","short":"R. Fulek, J. Kyncl, in:, 35th International Symposium on Computational Geometry (SoCG 2019), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019."},"publication":"35th International Symposium on Computational Geometry (SoCG 2019)","date_published":"2019-06-01T00:00:00Z"},{"page":"452-477","publication":"Computing and Software Science","citation":{"short":"R. Alur, M. Giacobbe, T.A. Henzinger, K.G. Larsen, M. Mikučionis, in:, B. Steffen, G. Woeginger (Eds.), Computing and Software Science, Springer Nature, 2019, pp. 452–477.","mla":"Alur, Rajeev, et al. “Continuous-Time Models for System Design and Analysis.” Computing and Software Science, edited by Bernhard Steffen and Gerhard Woeginger, vol. 10000, Springer Nature, 2019, pp. 452–77, doi:10.1007/978-3-319-91908-9_22.","chicago":"Alur, Rajeev, Mirco Giacobbe, Thomas A Henzinger, Kim G. Larsen, and Marius Mikučionis. “Continuous-Time Models for System Design and Analysis.” In Computing and Software Science, edited by Bernhard Steffen and Gerhard Woeginger, 10000:452–77. LNCS. Springer Nature, 2019. https://doi.org/10.1007/978-3-319-91908-9_22.","ama":"Alur R, Giacobbe M, Henzinger TA, Larsen KG, Mikučionis M. Continuous-time models for system design and analysis. In: Steffen B, Woeginger G, eds. Computing and Software Science. Vol 10000. LNCS. Springer Nature; 2019:452-477. doi:10.1007/978-3-319-91908-9_22","ieee":"R. Alur, M. Giacobbe, T. A. Henzinger, K. G. Larsen, and M. Mikučionis, “Continuous-time models for system design and analysis,” in Computing and Software Science, vol. 10000, B. Steffen and G. Woeginger, Eds. Springer Nature, 2019, pp. 452–477.","apa":"Alur, R., Giacobbe, M., Henzinger, T. A., Larsen, K. G., & Mikučionis, M. (2019). Continuous-time models for system design and analysis. In B. Steffen & G. Woeginger (Eds.), Computing and Software Science (Vol. 10000, pp. 452–477). Springer Nature. https://doi.org/10.1007/978-3-319-91908-9_22","ista":"Alur R, Giacobbe M, Henzinger TA, Larsen KG, Mikučionis M. 2019.Continuous-time models for system design and analysis. In: Computing and Software Science. Lecture Notes in Computer Science, vol. 10000, 452–477."},"date_published":"2019-10-05T00:00:00Z","series_title":"LNCS","scopus_import":"1","day":"05","article_processing_charge":"No","status":"public","title":"Continuous-time models for system design and analysis","intvolume":" 10000","_id":"7453","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","alternative_title":["Lecture Notes in Computer Science"],"type":"book_chapter","abstract":[{"lang":"eng","text":"We illustrate the ingredients of the state-of-the-art of model-based approach for the formal design and verification of cyber-physical systems. To capture the interaction between a discrete controller and its continuously evolving environment, we use the formal models of timed and hybrid automata. We explain the steps of modeling and verification in the tools Uppaal and SpaceEx using a case study based on a dual-chamber implantable pacemaker monitoring a human heart. We show how to design a model as a composition of components, how to construct models at varying levels of detail, how to establish that one model is an abstraction of another, how to specify correctness requirements using temporal logic, and how to verify that a model satisfies a logical requirement."}],"quality_controlled":"1","project":[{"grant_number":"S11402-N23","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"call_identifier":"FWF","name":"The Wittgenstein Prize","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"oa":1,"main_file_link":[{"url":"https://doi.org/10.1007/978-3-319-91908-9_22","open_access":"1"}],"language":[{"iso":"eng"}],"doi":"10.1007/978-3-319-91908-9_22","month":"10","publication_identifier":{"eisbn":["9783319919089"],"issn":["1611-3349"],"eissn":["0302-9743"],"isbn":["9783319919072"]},"publication_status":"published","department":[{"_id":"ToHe"}],"publisher":"Springer Nature","editor":[{"full_name":"Steffen, Bernhard","last_name":"Steffen","first_name":"Bernhard"},{"full_name":"Woeginger, Gerhard","first_name":"Gerhard","last_name":"Woeginger"}],"year":"2019","acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grants S11402-N23(RiSE/SHiNE) and Z211-N23 (Wittgenstein Award). This research has received funding from the Sino-Danish Basic Research Centre, IDEA4CPS, funded by the Danish National Research Foundation and the National Science Foundation, China, the Innovation Fund Denmark centre DiCyPS, as well as the ERC Advanced Grant LASSO.","date_updated":"2022-09-06T08:25:52Z","date_created":"2020-02-05T10:51:44Z","volume":10000,"author":[{"first_name":"Rajeev","last_name":"Alur","full_name":"Alur, Rajeev"},{"last_name":"Giacobbe","first_name":"Mirco","orcid":"0000-0001-8180-0904","id":"3444EA5E-F248-11E8-B48F-1D18A9856A87","full_name":"Giacobbe, Mirco"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Kim G.","last_name":"Larsen","full_name":"Larsen, Kim G."},{"full_name":"Mikučionis, Marius","last_name":"Mikučionis","first_name":"Marius"}]},{"date_published":"2019-01-15T00:00:00Z","doi":"10.1016/j.scriptamat.2018.09.003","language":[{"iso":"eng"}],"citation":{"ama":"Vadla SS, Costanzo T, John S, Caruntu G, Roy SC. Local probing of magnetoelectric coupling in BaTiO3-Ni 1–3 composites. Scripta Materialia. 2019;159:33-36. doi:10.1016/j.scriptamat.2018.09.003","ieee":"S. S. Vadla, T. Costanzo, S. John, G. Caruntu, and S. C. Roy, “Local probing of magnetoelectric coupling in BaTiO3-Ni 1–3 composites,” Scripta Materialia, vol. 159. Elsevier, pp. 33–36, 2019.","apa":"Vadla, S. S., Costanzo, T., John, S., Caruntu, G., & Roy, S. C. (2019). Local probing of magnetoelectric coupling in BaTiO3-Ni 1–3 composites. Scripta Materialia. Elsevier. https://doi.org/10.1016/j.scriptamat.2018.09.003","ista":"Vadla SS, Costanzo T, John S, Caruntu G, Roy SC. 2019. Local probing of magnetoelectric coupling in BaTiO3-Ni 1–3 composites. Scripta Materialia. 159, 33–36.","short":"S.S. Vadla, T. Costanzo, S. John, G. Caruntu, S.C. Roy, Scripta Materialia 159 (2019) 33–36.","mla":"Vadla, Samba Siva, et al. “Local Probing of Magnetoelectric Coupling in BaTiO3-Ni 1–3 Composites.” Scripta Materialia, vol. 159, Elsevier, 2019, pp. 33–36, doi:10.1016/j.scriptamat.2018.09.003.","chicago":"Vadla, Samba Siva, Tommaso Costanzo, Subish John, Gabriel Caruntu, and Somnath C. Roy. “Local Probing of Magnetoelectric Coupling in BaTiO3-Ni 1–3 Composites.” Scripta Materialia. Elsevier, 2019. https://doi.org/10.1016/j.scriptamat.2018.09.003."},"publication":"Scripta Materialia","page":"33-36","quality_controlled":"1","article_type":"original","article_processing_charge":"No","publication_identifier":{"issn":["1359-6462"]},"day":"15","month":"01","author":[{"last_name":"Vadla","first_name":"Samba Siva","full_name":"Vadla, Samba Siva"},{"full_name":"Costanzo, Tommaso","orcid":"0000-0001-9732-3815","id":"D93824F4-D9BA-11E9-BB12-F207E6697425","last_name":"Costanzo","first_name":"Tommaso"},{"full_name":"John, Subish","last_name":"John","first_name":"Subish"},{"full_name":"Caruntu, Gabriel","first_name":"Gabriel","last_name":"Caruntu"},{"first_name":"Somnath C.","last_name":"Roy","full_name":"Roy, Somnath C."}],"volume":159,"oa_version":"None","date_updated":"2023-02-23T13:08:31Z","date_created":"2020-02-05T14:19:17Z","_id":"7459","year":"2019","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 159","publisher":"Elsevier","publication_status":"published","status":"public","title":"Local probing of magnetoelectric coupling in BaTiO3-Ni 1–3 composites","abstract":[{"text":"We report the fabrication of BaTiO3-Ni magnetoelectric nanocomposites comprising of BaTiO3 nanotubes surrounded by Ni matrix. BaTiO3 nanotubes obtained from the hydrothermal transformation of TiO2 have both inner and outer surfaces, which facilitates greater magnetoelectric coupling with the surrounding Ni matrix. The magnetoelectric coupling was studied by measuring the piezoelectric behavior in the presence of an in-plane direct magnetic field. A higher magnetoelectric voltage coefficient of 110 mV/cm·Oe was obtained, because of better coupling between Ni and BaTiO3 through the walls of the nanotubes. Such nanocomposite developed directly on Ti substrate may lead to efficient fabrication of magnetoelectric devices.","lang":"eng"}],"extern":"1","type":"journal_article"},{"day":"01","article_processing_charge":"No","date_published":"2019-08-01T00:00:00Z","publication":"Nature Cell Biology","citation":{"chicago":"Andersen, Marianne Stemann, Edouard B Hannezo, Svetlana Ulyanchenko, Soline Estrach, Yasuko Antoku, Sabrina Pisano, Kim E. Boonekamp, et al. “Tracing the Cellular Dynamics of Sebaceous Gland Development in Normal and Perturbed States.” Nature Cell Biology. Springer Nature, 2019. https://doi.org/10.1038/s41556-019-0362-x.","mla":"Andersen, Marianne Stemann, et al. “Tracing the Cellular Dynamics of Sebaceous Gland Development in Normal and Perturbed States.” Nature Cell Biology, vol. 21, no. 8, Springer Nature, 2019, pp. 924–32, doi:10.1038/s41556-019-0362-x.","short":"M.S. Andersen, E.B. Hannezo, S. Ulyanchenko, S. Estrach, Y. Antoku, S. Pisano, K.E. Boonekamp, S. Sendrup, M. Maimets, M.T. Pedersen, J.V. Johansen, D.L. Clement, C.C. Feral, B.D. Simons, K.B. Jensen, Nature Cell Biology 21 (2019) 924–932.","ista":"Andersen MS, Hannezo EB, Ulyanchenko S, Estrach S, Antoku Y, Pisano S, Boonekamp KE, Sendrup S, Maimets M, Pedersen MT, Johansen JV, Clement DL, Feral CC, Simons BD, Jensen KB. 2019. Tracing the cellular dynamics of sebaceous gland development in normal and perturbed states. Nature Cell Biology. 21(8), 924–932.","ieee":"M. S. Andersen et al., “Tracing the cellular dynamics of sebaceous gland development in normal and perturbed states,” Nature Cell Biology, vol. 21, no. 8. Springer Nature, pp. 924–932, 2019.","apa":"Andersen, M. S., Hannezo, E. B., Ulyanchenko, S., Estrach, S., Antoku, Y., Pisano, S., … Jensen, K. B. (2019). Tracing the cellular dynamics of sebaceous gland development in normal and perturbed states. Nature Cell Biology. Springer Nature. https://doi.org/10.1038/s41556-019-0362-x","ama":"Andersen MS, Hannezo EB, Ulyanchenko S, et al. Tracing the cellular dynamics of sebaceous gland development in normal and perturbed states. Nature Cell Biology. 2019;21(8):924-932. doi:10.1038/s41556-019-0362-x"},"article_type":"original","page":"924-932","abstract":[{"lang":"eng","text":"The sebaceous gland (SG) is an essential component of the skin, and SG dysfunction is debilitating1,2. Yet, the cellular bases for its origin, development and subsequent maintenance remain poorly understood. Here, we apply large-scale quantitative fate mapping to define the patterns of cell fate behaviour during SG development and maintenance. We show that the SG develops from a defined number of lineage-restricted progenitors that undergo a programme of independent and stochastic cell fate decisions. Following an expansion phase, equipotent progenitors transition into a phase of homeostatic turnover, which is correlated with changes in the mechanical properties of the stroma and spatial restrictions on gland size. Expression of the oncogene KrasG12D results in a release from these constraints and unbridled gland expansion. Quantitative clonal fate analysis reveals that, during this phase, the primary effect of the Kras oncogene is to drive a constant fate bias with little effect on cell division rates. These findings provide insight into the developmental programme of the SG, as well as the mechanisms that drive tumour progression and gland dysfunction."}],"issue":"8","type":"journal_article","oa_version":"Submitted Version","_id":"7476","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Tracing the cellular dynamics of sebaceous gland development in normal and perturbed states","status":"public","intvolume":" 21","month":"08","publication_identifier":{"issn":["1465-7392","1476-4679"]},"doi":"10.1038/s41556-019-0362-x","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6978139/","open_access":"1"}],"external_id":{"pmid":["31358966"]},"oa":1,"quality_controlled":"1","extern":"1","author":[{"last_name":"Andersen","first_name":"Marianne Stemann","full_name":"Andersen, Marianne Stemann"},{"full_name":"Hannezo, Edouard B","first_name":"Edouard B","last_name":"Hannezo","id":"3A9DB764-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6005-1561"},{"full_name":"Ulyanchenko, Svetlana","last_name":"Ulyanchenko","first_name":"Svetlana"},{"full_name":"Estrach, Soline","last_name":"Estrach","first_name":"Soline"},{"first_name":"Yasuko","last_name":"Antoku","full_name":"Antoku, Yasuko"},{"first_name":"Sabrina","last_name":"Pisano","full_name":"Pisano, Sabrina"},{"last_name":"Boonekamp","first_name":"Kim E.","full_name":"Boonekamp, Kim E."},{"last_name":"Sendrup","first_name":"Sarah","full_name":"Sendrup, Sarah"},{"first_name":"Martti","last_name":"Maimets","full_name":"Maimets, Martti"},{"last_name":"Pedersen","first_name":"Marianne Terndrup","full_name":"Pedersen, Marianne Terndrup"},{"last_name":"Johansen","first_name":"Jens V.","full_name":"Johansen, Jens V."},{"first_name":"Ditte L.","last_name":"Clement","full_name":"Clement, Ditte L."},{"full_name":"Feral, Chloe C.","first_name":"Chloe C.","last_name":"Feral"},{"full_name":"Simons, Benjamin D.","first_name":"Benjamin D.","last_name":"Simons"},{"full_name":"Jensen, Kim B.","last_name":"Jensen","first_name":"Kim B."}],"date_created":"2020-02-11T08:43:49Z","date_updated":"2021-01-12T08:13:47Z","volume":21,"year":"2019","pmid":1,"publication_status":"published","publisher":"Springer Nature"},{"author":[{"full_name":"Sinnige, Tessa","first_name":"Tessa","last_name":"Sinnige"},{"first_name":"Prashanth","last_name":"Ciryam","full_name":"Ciryam, Prashanth"},{"full_name":"Casford, Samuel","first_name":"Samuel","last_name":"Casford"},{"first_name":"Christopher M.","last_name":"Dobson","full_name":"Dobson, Christopher M."},{"last_name":"de Bono","first_name":"Mario","orcid":"0000-0001-8347-0443","id":"4E3FF80E-F248-11E8-B48F-1D18A9856A87","full_name":"de Bono, Mario"},{"full_name":"Vendruscolo, Michele","last_name":"Vendruscolo","first_name":"Michele"}],"date_created":"2020-02-28T10:45:13Z","date_updated":"2021-01-12T08:14:08Z","oa_version":"Published Version","volume":14,"_id":"7548","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2019","title":"Expression of the amyloid-β peptide in a single pair of C. elegans sensory neurons modulates the associated behavioural response","publication_status":"published","status":"public","publisher":"Public Library of Science","intvolume":" 14","abstract":[{"text":"Although the aggregation of the amyloid-β peptide (Aβ) into amyloid fibrils is a well-established hallmark of Alzheimer’s disease, the complex mechanisms linking this process to neurodegeneration are still incompletely understood. The nematode worm C. elegans is a valuable model organism through which to study these mechanisms because of its simple nervous system and its relatively short lifespan. Standard Aβ-based C. elegans models of Alzheimer’s disease are designed to study the toxic effects of the overexpression of Aβ in the muscle or nervous systems. However, the wide variety of effects associated with the tissue-level overexpression of Aβ makes it difficult to single out and study specific cellular mechanisms related to the onset of Alzheimer’s disease. Here, to better understand how to investigate the early events affecting neuronal signalling, we created a C. elegans model expressing Aβ42, the 42-residue form of Aβ, from a single-copy gene insertion in just one pair of glutamatergic sensory neurons, the BAG neurons. In behavioural assays, we found that the Aβ42-expressing animals displayed a subtle modulation of the response to CO2, compared to controls. Ca2+ imaging revealed that the BAG neurons in young Aβ42-expressing nematodes were activated more strongly than in control animals, and that neuronal activation remained intact until old age. Taken together, our results suggest that Aβ42-expression in this very subtle model of AD is sufficient to modulate the behavioural response but not strong enough to generate significant neurotoxicity, suggesting that slightly more aggressive perturbations will enable effectively studies of the links between the modulation of a physiological response and its associated neurotoxicity.","lang":"eng"}],"issue":"5","extern":"1","article_number":"e0217746","type":"journal_article","date_published":"2019-05-31T00:00:00Z","doi":"10.1371/journal.pone.0217746","language":[{"iso":"eng"}],"publication":"PLOS ONE","citation":{"ieee":"T. Sinnige, P. Ciryam, S. Casford, C. M. Dobson, M. de Bono, and M. Vendruscolo, “Expression of the amyloid-β peptide in a single pair of C. elegans sensory neurons modulates the associated behavioural response,” PLOS ONE, vol. 14, no. 5. Public Library of Science, 2019.","apa":"Sinnige, T., Ciryam, P., Casford, S., Dobson, C. M., de Bono, M., & Vendruscolo, M. (2019). Expression of the amyloid-β peptide in a single pair of C. elegans sensory neurons modulates the associated behavioural response. PLOS ONE. Public Library of Science. https://doi.org/10.1371/journal.pone.0217746","ista":"Sinnige T, Ciryam P, Casford S, Dobson CM, de Bono M, Vendruscolo M. 2019. Expression of the amyloid-β peptide in a single pair of C. elegans sensory neurons modulates the associated behavioural response. PLOS ONE. 14(5), e0217746.","ama":"Sinnige T, Ciryam P, Casford S, Dobson CM, de Bono M, Vendruscolo M. Expression of the amyloid-β peptide in a single pair of C. elegans sensory neurons modulates the associated behavioural response. PLOS ONE. 2019;14(5). doi:10.1371/journal.pone.0217746","chicago":"Sinnige, Tessa, Prashanth Ciryam, Samuel Casford, Christopher M. Dobson, Mario de Bono, and Michele Vendruscolo. “Expression of the Amyloid-β Peptide in a Single Pair of C. Elegans Sensory Neurons Modulates the Associated Behavioural Response.” PLOS ONE. Public Library of Science, 2019. https://doi.org/10.1371/journal.pone.0217746.","short":"T. Sinnige, P. Ciryam, S. Casford, C.M. Dobson, M. de Bono, M. Vendruscolo, PLOS ONE 14 (2019).","mla":"Sinnige, Tessa, et al. “Expression of the Amyloid-β Peptide in a Single Pair of C. Elegans Sensory Neurons Modulates the Associated Behavioural Response.” PLOS ONE, vol. 14, no. 5, e0217746, Public Library of Science, 2019, doi:10.1371/journal.pone.0217746."},"article_type":"original","quality_controlled":"1","month":"05","day":"31","publication_identifier":{"issn":["1932-6203"]},"article_processing_charge":"No"},{"publication_identifier":{"issn":["2160-1836"]},"month":"11","language":[{"iso":"eng"}],"doi":"10.1534/g3.119.400654","quality_controlled":"1","external_id":{"pmid":["31519744"]},"extern":"1","volume":9,"date_updated":"2021-01-12T08:14:07Z","date_created":"2020-02-28T10:44:27Z","author":[{"last_name":"Cohn","first_name":"Jesse","full_name":"Cohn, Jesse"},{"last_name":"Dwivedi","first_name":"Vivek","full_name":"Dwivedi, Vivek"},{"last_name":"Valperga","first_name":"Giulio","full_name":"Valperga, Giulio"},{"last_name":"Zarate","first_name":"Nicole","full_name":"Zarate, Nicole"},{"last_name":"de Bono","first_name":"Mario","orcid":"0000-0001-8347-0443","id":"4E3FF80E-F248-11E8-B48F-1D18A9856A87","full_name":"de Bono, Mario"},{"full_name":"Horvitz, H. Robert","first_name":"H. Robert","last_name":"Horvitz"},{"full_name":"Pierce, Jonathan T.","last_name":"Pierce","first_name":"Jonathan T."}],"publisher":"Genetics Society of America","publication_status":"published","pmid":1,"year":"2019","article_processing_charge":"No","day":"01","date_published":"2019-11-01T00:00:00Z","page":"3703-3714","article_type":"original","citation":{"chicago":"Cohn, Jesse, Vivek Dwivedi, Giulio Valperga, Nicole Zarate, Mario de Bono, H. Robert Horvitz, and Jonathan T. Pierce. “Activity-Dependent Regulation of the Proapoptotic BH3-Only Gene Egl-1 in a Living Neuron Pair in Caenorhabditis Elegans.” G3: Genes, Genomes, Genetics. Genetics Society of America, 2019. https://doi.org/10.1534/g3.119.400654.","short":"J. Cohn, V. Dwivedi, G. Valperga, N. Zarate, M. de Bono, H.R. Horvitz, J.T. Pierce, G3: Genes, Genomes, Genetics 9 (2019) 3703–3714.","mla":"Cohn, Jesse, et al. “Activity-Dependent Regulation of the Proapoptotic BH3-Only Gene Egl-1 in a Living Neuron Pair in Caenorhabditis Elegans.” G3: Genes, Genomes, Genetics, vol. 9, no. 11, Genetics Society of America, 2019, pp. 3703–14, doi:10.1534/g3.119.400654.","apa":"Cohn, J., Dwivedi, V., Valperga, G., Zarate, N., de Bono, M., Horvitz, H. R., & Pierce, J. T. (2019). Activity-dependent regulation of the proapoptotic BH3-only gene egl-1 in a living neuron pair in Caenorhabditis elegans. G3: Genes, Genomes, Genetics. Genetics Society of America. https://doi.org/10.1534/g3.119.400654","ieee":"J. Cohn et al., “Activity-dependent regulation of the proapoptotic BH3-only gene egl-1 in a living neuron pair in Caenorhabditis elegans,” G3: Genes, Genomes, Genetics, vol. 9, no. 11. Genetics Society of America, pp. 3703–3714, 2019.","ista":"Cohn J, Dwivedi V, Valperga G, Zarate N, de Bono M, Horvitz HR, Pierce JT. 2019. Activity-dependent regulation of the proapoptotic BH3-only gene egl-1 in a living neuron pair in Caenorhabditis elegans. G3: Genes, Genomes, Genetics. 9(11), 3703–3714.","ama":"Cohn J, Dwivedi V, Valperga G, et al. Activity-dependent regulation of the proapoptotic BH3-only gene egl-1 in a living neuron pair in Caenorhabditis elegans. G3: Genes, Genomes, Genetics. 2019;9(11):3703-3714. doi:10.1534/g3.119.400654"},"publication":"G3: Genes, Genomes, Genetics","issue":"11","abstract":[{"lang":"eng","text":"The BH3-only family of proteins is key for initiating apoptosis in a variety of contexts, and may also contribute to non-apoptotic cellular processes. Historically, the nematode Caenorhabditis elegans has provided a powerful system for studying and identifying conserved regulators of BH3-only proteins. In C. elegans, the BH3-only protein egl-1 is expressed during development to cell-autonomously trigger most developmental cell deaths. Here we provide evidence that egl-1 is also transcribed after development in the sensory neuron pair URX without inducing apoptosis. We used genetic screening and epistasis analysis to determine that its transcription is regulated in URX by neuronal activity and/or in parallel by orthologs of Protein Kinase G and the Salt-Inducible Kinase family. Because several BH3-only family proteins are also expressed in the adult nervous system of mammals, we suggest that studying egl-1 expression in URX may shed light on mechanisms that regulate conserved family members in higher organisms."}],"type":"journal_article","oa_version":"Published Version","intvolume":" 9","status":"public","title":"Activity-dependent regulation of the proapoptotic BH3-only gene egl-1 in a living neuron pair in Caenorhabditis elegans","_id":"7547","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"status":"public","title":"Penalization via global functionals of optimal-control problems for dissipative evolution","intvolume":" 28","_id":"7550","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","type":"journal_article","abstract":[{"text":"We consider an optimal control problem for an abstract nonlinear dissipative evolution equation. The differential constraint is penalized by augmenting the target functional by a nonnegative global-in-time functional which is null-minimized in the evolution equation is satisfied. Different variational settings are presented, leading to the convergence of the penalization method for gradient flows, noncyclic and semimonotone flows, doubly nonlinear evolutions, and GENERIC systems. ","lang":"eng"}],"issue":"2","article_type":"original","page":"425-447","publication":"Advances in Mathematical Sciences and Applications","citation":{"chicago":"Portinale, Lorenzo, and Ulisse Stefanelli. “Penalization via Global Functionals of Optimal-Control Problems for Dissipative Evolution.” Advances in Mathematical Sciences and Applications. Gakko Tosho, 2019.","short":"L. Portinale, U. Stefanelli, Advances in Mathematical Sciences and Applications 28 (2019) 425–447.","mla":"Portinale, Lorenzo, and Ulisse Stefanelli. “Penalization via Global Functionals of Optimal-Control Problems for Dissipative Evolution.” Advances in Mathematical Sciences and Applications, vol. 28, no. 2, Gakko Tosho, 2019, pp. 425–47.","apa":"Portinale, L., & Stefanelli, U. (2019). Penalization via global functionals of optimal-control problems for dissipative evolution. Advances in Mathematical Sciences and Applications. Gakko Tosho.","ieee":"L. Portinale and U. Stefanelli, “Penalization via global functionals of optimal-control problems for dissipative evolution,” Advances in Mathematical Sciences and Applications, vol. 28, no. 2. Gakko Tosho, pp. 425–447, 2019.","ista":"Portinale L, Stefanelli U. 2019. Penalization via global functionals of optimal-control problems for dissipative evolution. Advances in Mathematical Sciences and Applications. 28(2), 425–447.","ama":"Portinale L, Stefanelli U. Penalization via global functionals of optimal-control problems for dissipative evolution. Advances in Mathematical Sciences and Applications. 2019;28(2):425-447."},"date_published":"2019-10-22T00:00:00Z","day":"22","article_processing_charge":"No","publication_status":"published","department":[{"_id":"JaMa"}],"publisher":"Gakko Tosho","year":"2019","acknowledgement":"This work is supported by Vienna Science and Technology Fund (WWTF) through Project MA14-009 and by the Austrian Science Fund (FWF) projects F 65 and I 2375.","date_created":"2020-02-28T10:54:41Z","date_updated":"2022-06-17T07:52:41Z","volume":28,"author":[{"id":"30AD2CBC-F248-11E8-B48F-1D18A9856A87","first_name":"Lorenzo","last_name":"Portinale","full_name":"Portinale, Lorenzo"},{"full_name":"Stefanelli, Ulisse","last_name":"Stefanelli","first_name":"Ulisse"}],"quality_controlled":"1","project":[{"grant_number":"F6504","_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2","name":"Taming Complexity in Partial Differential Systems"}],"oa":1,"external_id":{"arxiv":["1910.10050"]},"main_file_link":[{"url":" https://doi.org/10.48550/arXiv.1910.10050","open_access":"1"}],"language":[{"iso":"eng"}],"month":"10","publication_identifier":{"issn":["1343-4373"]}},{"date_created":"2020-02-28T10:57:08Z","date_updated":"2021-01-12T08:14:09Z","oa_version":"Preprint","author":[{"first_name":"William","last_name":"Bialek","full_name":"Bialek, William"},{"full_name":"Gregor, Thomas","last_name":"Gregor","first_name":"Thomas"},{"full_name":"Tkačik, Gašper","last_name":"Tkačik","first_name":"Gašper","orcid":"0000-0002-6699-1455","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87"}],"publication_status":"submitted","status":"public","title":"Action at a distance in transcriptional regulation","publisher":"ArXiv","department":[{"_id":"GaTk"}],"_id":"7552","year":"2019","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"There is increasing evidence that protein binding to specific sites along DNA can activate the reading out of genetic information without coming into direct physical contact with the gene. There also is evidence that these distant but interacting sites are embedded in a liquid droplet of proteins which condenses out of the surrounding solution. We argue that droplet-mediated interactions can account for crucial features of gene regulation only if the droplet is poised at a non-generic point in its phase diagram. We explore a minimal model that embodies this idea, show that this model has a natural mechanism for self-tuning, and suggest direct experimental tests. "}],"type":"preprint","language":[{"iso":"eng"}],"date_published":"2019-12-18T00:00:00Z","project":[{"name":"Biophysics of information processing in gene regulation","call_identifier":"FWF","_id":"254E9036-B435-11E9-9278-68D0E5697425","grant_number":"P28844-B27"}],"page":"5","publication":"arXiv:1912.08579","main_file_link":[{"url":"https://arxiv.org/abs/1912.08579","open_access":"1"}],"external_id":{"arxiv":["1912.08579"]},"oa":1,"citation":{"ama":"Bialek W, Gregor T, Tkačik G. Action at a distance in transcriptional regulation. arXiv:191208579.","ista":"Bialek W, Gregor T, Tkačik G. Action at a distance in transcriptional regulation. arXiv:1912.08579, .","ieee":"W. Bialek, T. Gregor, and G. Tkačik, “Action at a distance in transcriptional regulation,” arXiv:1912.08579. ArXiv.","apa":"Bialek, W., Gregor, T., & Tkačik, G. (n.d.). Action at a distance in transcriptional regulation. arXiv:1912.08579. ArXiv.","mla":"Bialek, William, et al. “Action at a Distance in Transcriptional Regulation.” ArXiv:1912.08579, ArXiv.","short":"W. Bialek, T. Gregor, G. Tkačik, ArXiv:1912.08579 (n.d.).","chicago":"Bialek, William, Thomas Gregor, and Gašper Tkačik. “Action at a Distance in Transcriptional Regulation.” ArXiv:1912.08579. ArXiv, n.d."},"day":"18","month":"12","article_processing_charge":"No"},{"publication_identifier":{"eissn":["23987340"]},"month":"05","language":[{"iso":"eng"}],"doi":"10.29007/m75b","conference":{"name":"ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems","end_date":"2019-04-15","location":"Montreal, Canada","start_date":"2019-04-15"},"quality_controlled":"1","oa":1,"file_date_updated":"2020-07-14T12:48:00Z","volume":61,"date_updated":"2021-01-12T08:14:17Z","date_created":"2020-03-08T23:00:49Z","author":[{"full_name":"Immler, Fabian","first_name":"Fabian","last_name":"Immler"},{"full_name":"Althoff, Matthias","last_name":"Althoff","first_name":"Matthias"},{"full_name":"Benet, Luis","last_name":"Benet","first_name":"Luis"},{"last_name":"Chapoutot","first_name":"Alexandre","full_name":"Chapoutot, Alexandre"},{"last_name":"Chen","first_name":"Xin","full_name":"Chen, Xin"},{"first_name":"Marcelo","last_name":"Forets","full_name":"Forets, Marcelo"},{"first_name":"Luca","last_name":"Geretti","full_name":"Geretti, Luca"},{"last_name":"Kochdumper","first_name":"Niklas","full_name":"Kochdumper, Niklas"},{"last_name":"Sanders","first_name":"David P.","full_name":"Sanders, David P."},{"id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3658-1065","first_name":"Christian","last_name":"Schilling","full_name":"Schilling, Christian"}],"department":[{"_id":"ToHe"}],"publisher":"EasyChair Publications","publication_status":"published","year":"2019","article_processing_charge":"No","has_accepted_license":"1","day":"25","scopus_import":1,"date_published":"2019-05-25T00:00:00Z","page":"41-61","citation":{"ama":"Immler F, Althoff M, Benet L, et al. ARCH-COMP19 Category Report: Continuous and hybrid systems with nonlinear dynamics. In: EPiC Series in Computing. Vol 61. EasyChair Publications; 2019:41-61. doi:10.29007/m75b","ista":"Immler F, Althoff M, Benet L, Chapoutot A, Chen X, Forets M, Geretti L, Kochdumper N, Sanders DP, Schilling C. 2019. ARCH-COMP19 Category Report: Continuous and hybrid systems with nonlinear dynamics. EPiC Series in Computing. ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems vol. 61, 41–61.","apa":"Immler, F., Althoff, M., Benet, L., Chapoutot, A., Chen, X., Forets, M., … Schilling, C. (2019). ARCH-COMP19 Category Report: Continuous and hybrid systems with nonlinear dynamics. In EPiC Series in Computing (Vol. 61, pp. 41–61). Montreal, Canada: EasyChair Publications. https://doi.org/10.29007/m75b","ieee":"F. Immler et al., “ARCH-COMP19 Category Report: Continuous and hybrid systems with nonlinear dynamics,” in EPiC Series in Computing, Montreal, Canada, 2019, vol. 61, pp. 41–61.","mla":"Immler, Fabian, et al. “ARCH-COMP19 Category Report: Continuous and Hybrid Systems with Nonlinear Dynamics.” EPiC Series in Computing, vol. 61, EasyChair Publications, 2019, pp. 41–61, doi:10.29007/m75b.","short":"F. Immler, M. Althoff, L. Benet, A. Chapoutot, X. Chen, M. Forets, L. Geretti, N. Kochdumper, D.P. Sanders, C. Schilling, in:, EPiC Series in Computing, EasyChair Publications, 2019, pp. 41–61.","chicago":"Immler, Fabian, Matthias Althoff, Luis Benet, Alexandre Chapoutot, Xin Chen, Marcelo Forets, Luca Geretti, Niklas Kochdumper, David P. Sanders, and Christian Schilling. “ARCH-COMP19 Category Report: Continuous and Hybrid Systems with Nonlinear Dynamics.” In EPiC Series in Computing, 61:41–61. EasyChair Publications, 2019. https://doi.org/10.29007/m75b."},"publication":"EPiC Series in Computing","abstract":[{"lang":"eng","text":"We present the results of a friendly competition for formal verification of continuous and hybrid systems with nonlinear continuous dynamics. The friendly competition took place as part of the workshop Applied Verification for Continuous and Hybrid Systems (ARCH) in 2019. In this year, 6 tools Ariadne, CORA, DynIbex, Flow*, Isabelle/HOL, and JuliaReach (in alphabetic order) participated. They are applied to solve reachability analysis problems on four benchmark problems, one of them with hybrid dynamics. We do not rank the tools based on the results, but show the current status and discover the potential advantages of different tools."}],"type":"conference","oa_version":"Published Version","file":[{"file_name":"2019_ARCH19_Immler.pdf","access_level":"open_access","creator":"dernst","file_size":1934830,"content_type":"application/pdf","file_id":"7617","relation":"main_file","date_created":"2020-03-24T07:36:36Z","date_updated":"2020-07-14T12:48:00Z","checksum":"9138977a06fcd6a95976eb4bca875f0c"}],"intvolume":" 61","title":"ARCH-COMP19 Category Report: Continuous and hybrid systems with nonlinear dynamics","ddc":["000"],"status":"public","_id":"7576","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"type":"preprint","abstract":[{"lang":"eng","text":"Electrodepositing insulating and insoluble Li2O2 is the key process during discharge of aprotic Li-O2 batteries and determines rate, capacity, and reversibility. Current understanding states that the partition between surface adsorbed and solvated LiO2 governs whether Li2O2 grows as surface film, leading to low capacity even at low rates, or in solution, leading to particles and high capacities. Here we show that Li2O2 forms to the widest extent as particles via solution mediated LiO2 disproportionation. We describe a unified Li2O2 growth model that conclusively explains capacity limitations across the whole range of electrolytes. Deciding for particle morphology, achievable rate and capacities are species mobilities, electrode specific surface area (determining true areal rate) and the concentration distribution of associated LiO2 in solution. Provided that species mobilities and surface are high, high, capacities are possible even with low-donor-number electrolytes, previously considered prototypical for low capacity via surface growth. The tools for these insights are microscopy, hydrodynamic voltammetry, a numerical reaction model, and in situ small/wide angle X-ray scattering (SAXS/WAXS). Combined with sophisticated data analysis, SAXS allows retrieving rich quantitative information from complex multi-phase systems. On a wider perspective, this SAXS method is a powerful in situ metrology with atomic to sub-micron resolution to study mechanisms in complex electrochemical systems and beyond. "}],"extern":"1","_id":"7627","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2019","publisher":"ChemRxiv","title":"A revised O2 reduction model in Li-O2 batteries as revealed by in situ small angle X-ray scattering","publication_status":"submitted","status":"public","author":[{"full_name":"Prehal, Christian","first_name":"Christian","last_name":"Prehal"},{"full_name":"Samojlov, Aleksej","last_name":"Samojlov","first_name":"Aleksej"},{"last_name":"Nachtnebel","first_name":"Manfred","full_name":"Nachtnebel, Manfred"},{"full_name":"Kriechbaum, Manfred","first_name":"Manfred","last_name":"Kriechbaum"},{"first_name":"Heinz","last_name":"Amenitsch","full_name":"Amenitsch, Heinz"},{"full_name":"Freunberger, Stefan Alexander","id":"A8CA28E6-CE23-11E9-AD2D-EC27E6697425","orcid":"0000-0003-2902-5319","first_name":"Stefan Alexander","last_name":"Freunberger"}],"oa_version":"Preprint","date_updated":"2020-04-06T10:36:21Z","date_created":"2020-04-01T10:10:21Z","article_processing_charge":"No","day":"26","month":"12","main_file_link":[{"open_access":"1","url":"https://doi.org/10.26434/chemrxiv.11447775.v1"}],"oa":1,"citation":{"chicago":"Prehal, Christian, Aleksej Samojlov, Manfred Nachtnebel, Manfred Kriechbaum, Heinz Amenitsch, and Stefan Alexander Freunberger. “A Revised O2 Reduction Model in Li-O2 Batteries as Revealed by in Situ Small Angle X-Ray Scattering.” ChemRxiv, n.d.","mla":"Prehal, Christian, et al. A Revised O2 Reduction Model in Li-O2 Batteries as Revealed by in Situ Small Angle X-Ray Scattering. ChemRxiv.","short":"C. Prehal, A. Samojlov, M. Nachtnebel, M. Kriechbaum, H. Amenitsch, S.A. Freunberger, (n.d.).","ista":"Prehal C, Samojlov A, Nachtnebel M, Kriechbaum M, Amenitsch H, Freunberger SA. A revised O2 reduction model in Li-O2 batteries as revealed by in situ small angle X-ray scattering.","ieee":"C. Prehal, A. Samojlov, M. Nachtnebel, M. Kriechbaum, H. Amenitsch, and S. A. Freunberger, “A revised O2 reduction model in Li-O2 batteries as revealed by in situ small angle X-ray scattering.” ChemRxiv.","apa":"Prehal, C., Samojlov, A., Nachtnebel, M., Kriechbaum, M., Amenitsch, H., & Freunberger, S. A. (n.d.). A revised O2 reduction model in Li-O2 batteries as revealed by in situ small angle X-ray scattering. ChemRxiv.","ama":"Prehal C, Samojlov A, Nachtnebel M, Kriechbaum M, Amenitsch H, Freunberger SA. A revised O2 reduction model in Li-O2 batteries as revealed by in situ small angle X-ray scattering."},"page":"50","date_published":"2019-12-26T00:00:00Z","language":[{"iso":"eng"}]},{"_id":"7710","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2019","publication_status":"published","title":"Accurate, scalable and integrative haplotype estimation","status":"public","publisher":"Springer Nature","intvolume":" 10","author":[{"full_name":"Delaneau, Olivier","last_name":"Delaneau","first_name":"Olivier"},{"full_name":"Zagury, Jean-François","last_name":"Zagury","first_name":"Jean-François"},{"orcid":"0000-0001-8982-8813","id":"E5D42276-F5DA-11E9-8E24-6303E6697425","last_name":"Robinson","first_name":"Matthew Richard","full_name":"Robinson, Matthew Richard"},{"last_name":"Marchini","first_name":"Jonathan L.","full_name":"Marchini, Jonathan L."},{"first_name":"Emmanouil T.","last_name":"Dermitzakis","full_name":"Dermitzakis, Emmanouil T."}],"date_created":"2020-04-30T10:40:32Z","date_updated":"2021-01-12T08:15:01Z","volume":10,"oa_version":"Published Version","article_number":"5436","type":"journal_article","abstract":[{"lang":"eng","text":"The number of human genomes being genotyped or sequenced increases exponentially and efficient haplotype estimation methods able to handle this amount of data are now required. Here we present a method, SHAPEIT4, which substantially improves upon other methods to process large genotype and high coverage sequencing datasets. It notably exhibits sub-linear running times with sample size, provides highly accurate haplotypes and allows integrating external phasing information such as large reference panels of haplotypes, collections of pre-phased variants and long sequencing reads. We provide SHAPEIT4 in an open source format and demonstrate its performance in terms of accuracy and running times on two gold standard datasets: the UK Biobank data and the Genome In A Bottle."}],"extern":"1","publication":"Nature Communications","oa":1,"main_file_link":[{"url":"https://doi.org/10.1038/s41467-019-13225-y","open_access":"1"}],"citation":{"short":"O. Delaneau, J.-F. Zagury, M.R. Robinson, J.L. Marchini, E.T. Dermitzakis, Nature Communications 10 (2019).","mla":"Delaneau, Olivier, et al. “Accurate, Scalable and Integrative Haplotype Estimation.” Nature Communications, vol. 10, 5436, Springer Nature, 2019, doi:10.1038/s41467-019-13225-y.","chicago":"Delaneau, Olivier, Jean-François Zagury, Matthew Richard Robinson, Jonathan L. Marchini, and Emmanouil T. Dermitzakis. “Accurate, Scalable and Integrative Haplotype Estimation.” Nature Communications. Springer Nature, 2019. https://doi.org/10.1038/s41467-019-13225-y.","ama":"Delaneau O, Zagury J-F, Robinson MR, Marchini JL, Dermitzakis ET. Accurate, scalable and integrative haplotype estimation. Nature Communications. 2019;10. doi:10.1038/s41467-019-13225-y","apa":"Delaneau, O., Zagury, J.-F., Robinson, M. R., Marchini, J. L., & Dermitzakis, E. T. (2019). Accurate, scalable and integrative haplotype estimation. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-019-13225-y","ieee":"O. Delaneau, J.-F. Zagury, M. R. Robinson, J. L. Marchini, and E. T. Dermitzakis, “Accurate, scalable and integrative haplotype estimation,” Nature Communications, vol. 10. Springer Nature, 2019.","ista":"Delaneau O, Zagury J-F, Robinson MR, Marchini JL, Dermitzakis ET. 2019. Accurate, scalable and integrative haplotype estimation. Nature Communications. 10, 5436."},"article_type":"original","quality_controlled":"1","doi":"10.1038/s41467-019-13225-y","date_published":"2019-11-28T00:00:00Z","language":[{"iso":"eng"}],"day":"28","month":"11","publication_identifier":{"issn":["2041-1723"]},"article_processing_charge":"No"},{"page":"1226-1242","quality_controlled":"1","article_type":"original","citation":{"apa":"Bevers, R. P. J., Litovchenko, M., Kapopoulou, A., Braman, V. S., Robinson, M. R., Auwerx, J., … Deplancke, B. (2019). Mitochondrial haplotypes affect metabolic phenotypes in the Drosophila Genetic Reference Panel. Nature Metabolism. Springer Nature. https://doi.org/10.1038/s42255-019-0147-3","ieee":"R. P. J. Bevers et al., “Mitochondrial haplotypes affect metabolic phenotypes in the Drosophila Genetic Reference Panel,” Nature Metabolism, vol. 1, no. 12. Springer Nature, pp. 1226–1242, 2019.","ista":"Bevers RPJ, Litovchenko M, Kapopoulou A, Braman VS, Robinson MR, Auwerx J, Hollis B, Deplancke B. 2019. Mitochondrial haplotypes affect metabolic phenotypes in the Drosophila Genetic Reference Panel. Nature Metabolism. 1(12), 1226–1242.","ama":"Bevers RPJ, Litovchenko M, Kapopoulou A, et al. Mitochondrial haplotypes affect metabolic phenotypes in the Drosophila Genetic Reference Panel. Nature Metabolism. 2019;1(12):1226-1242. doi:10.1038/s42255-019-0147-3","chicago":"Bevers, Roel P. J., Maria Litovchenko, Adamandia Kapopoulou, Virginie S. Braman, Matthew Richard Robinson, Johan Auwerx, Brian Hollis, and Bart Deplancke. “Mitochondrial Haplotypes Affect Metabolic Phenotypes in the Drosophila Genetic Reference Panel.” Nature Metabolism. Springer Nature, 2019. https://doi.org/10.1038/s42255-019-0147-3.","short":"R.P.J. Bevers, M. Litovchenko, A. Kapopoulou, V.S. Braman, M.R. Robinson, J. Auwerx, B. Hollis, B. Deplancke, Nature Metabolism 1 (2019) 1226–1242.","mla":"Bevers, Roel P. J., et al. “Mitochondrial Haplotypes Affect Metabolic Phenotypes in the Drosophila Genetic Reference Panel.” Nature Metabolism, vol. 1, no. 12, Springer Nature, 2019, pp. 1226–42, doi:10.1038/s42255-019-0147-3."},"publication":"Nature Metabolism","language":[{"iso":"eng"}],"doi":"10.1038/s42255-019-0147-3","date_published":"2019-12-09T00:00:00Z","article_processing_charge":"No","publication_identifier":{"issn":["2522-5812"]},"day":"09","month":"12","publisher":"Springer Nature","intvolume":" 1","status":"public","title":"Mitochondrial haplotypes affect metabolic phenotypes in the Drosophila Genetic Reference Panel","publication_status":"published","_id":"7711","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2019","volume":1,"oa_version":"None","date_created":"2020-04-30T10:40:56Z","date_updated":"2021-01-12T08:15:01Z","related_material":{"link":[{"relation":"erratum","url":"https://doi.org/10.1038/s42255-020-0202-0"}]},"author":[{"first_name":"Roel P. J.","last_name":"Bevers","full_name":"Bevers, Roel P. J."},{"last_name":"Litovchenko","first_name":"Maria","full_name":"Litovchenko, Maria"},{"full_name":"Kapopoulou, Adamandia","last_name":"Kapopoulou","first_name":"Adamandia"},{"last_name":"Braman","first_name":"Virginie S.","full_name":"Braman, Virginie S."},{"first_name":"Matthew Richard","last_name":"Robinson","id":"E5D42276-F5DA-11E9-8E24-6303E6697425","orcid":"0000-0001-8982-8813","full_name":"Robinson, Matthew Richard"},{"full_name":"Auwerx, Johan","first_name":"Johan","last_name":"Auwerx"},{"last_name":"Hollis","first_name":"Brian","full_name":"Hollis, Brian"},{"full_name":"Deplancke, Bart","last_name":"Deplancke","first_name":"Bart"}],"type":"journal_article","extern":"1","issue":"12","abstract":[{"lang":"eng","text":"The nature and extent of mitochondrial DNA variation in a population and how it affects traits is poorly understood. Here we resequence the mitochondrial genomes of 169 Drosophila Genetic Reference Panel lines, identifying 231 variants that stratify along 12 mitochondrial haplotypes. We identify 1,845 cases of mitonuclear allelic imbalances, thus implying that mitochondrial haplotypes are reflected in the nuclear genome. However, no major fitness effects are associated with mitonuclear imbalance, suggesting that such imbalances reflect population structure at the mitochondrial level rather than genomic incompatibilities. Although mitochondrial haplotypes have no direct impact on mitochondrial respiration, some haplotypes are associated with stress- and metabolism-related phenotypes, including food intake in males. Finally, through reciprocal swapping of mitochondrial genomes, we demonstrate that a mitochondrial haplotype associated with high food intake can rescue a low food intake phenotype. Together, our findings provide new insight into population structure at the mitochondrial level and point to the importance of incorporating mitochondrial haplotypes in genotype–phenotype relationship studies."}]},{"date_published":"2019-06-14T00:00:00Z","language":[{"iso":"eng"}],"publication":"bioRxiv","main_file_link":[{"url":"https://doi.org/10.1101/632380 ","open_access":"1"}],"oa":1,"citation":{"chicago":"Sulc, Jonathan, Ninon Mounier, Felix Günther, Thomas Winkler, Andrew R. Wood, Timothy M. Frayling, Iris M. Heid, Matthew Richard Robinson, and Zoltán Kutalik. “Maximum Likelihood Method Quantifies the Overall Contribution of Gene-Environment Interaction to Continuous Traits: An Application to Complex Traits in the UK Biobank.” BioRxiv. Cold Spring Harbor Laboratory, 2019.","mla":"Sulc, Jonathan, et al. “Maximum Likelihood Method Quantifies the Overall Contribution of Gene-Environment Interaction to Continuous Traits: An Application to Complex Traits in the UK Biobank.” BioRxiv, Cold Spring Harbor Laboratory, 2019.","short":"J. Sulc, N. Mounier, F. Günther, T. Winkler, A.R. Wood, T.M. Frayling, I.M. Heid, M.R. Robinson, Z. Kutalik, BioRxiv (2019).","ista":"Sulc J, Mounier N, Günther F, Winkler T, Wood AR, Frayling TM, Heid IM, Robinson MR, Kutalik Z. 2019. Maximum likelihood method quantifies the overall contribution of gene-environment interaction to continuous traits: An application to complex traits in the UK Biobank. bioRxiv, .","ieee":"J. Sulc et al., “Maximum likelihood method quantifies the overall contribution of gene-environment interaction to continuous traits: An application to complex traits in the UK Biobank,” bioRxiv. Cold Spring Harbor Laboratory, 2019.","apa":"Sulc, J., Mounier, N., Günther, F., Winkler, T., Wood, A. R., Frayling, T. M., … Kutalik, Z. (2019). Maximum likelihood method quantifies the overall contribution of gene-environment interaction to continuous traits: An application to complex traits in the UK Biobank. bioRxiv. Cold Spring Harbor Laboratory.","ama":"Sulc J, Mounier N, Günther F, et al. Maximum likelihood method quantifies the overall contribution of gene-environment interaction to continuous traits: An application to complex traits in the UK Biobank. bioRxiv. 2019."},"page":"20","day":"14","month":"06","article_processing_charge":"No","author":[{"first_name":"Jonathan","last_name":"Sulc","full_name":"Sulc, Jonathan"},{"full_name":"Mounier, Ninon","last_name":"Mounier","first_name":"Ninon"},{"full_name":"Günther, Felix","first_name":"Felix","last_name":"Günther"},{"last_name":"Winkler","first_name":"Thomas","full_name":"Winkler, Thomas"},{"first_name":"Andrew R.","last_name":"Wood","full_name":"Wood, Andrew R."},{"full_name":"Frayling, Timothy M.","first_name":"Timothy M.","last_name":"Frayling"},{"last_name":"Heid","first_name":"Iris M.","full_name":"Heid, Iris M."},{"id":"E5D42276-F5DA-11E9-8E24-6303E6697425","orcid":"0000-0001-8982-8813","first_name":"Matthew Richard","last_name":"Robinson","full_name":"Robinson, Matthew Richard"},{"full_name":"Kutalik, Zoltán","first_name":"Zoltán","last_name":"Kutalik"}],"date_created":"2020-04-30T13:04:26Z","date_updated":"2021-01-12T08:15:30Z","oa_version":"Preprint","_id":"7782","year":"2019","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","title":"Maximum likelihood method quantifies the overall contribution of gene-environment interaction to continuous traits: An application to complex traits in the UK Biobank","status":"public","publisher":"Cold Spring Harbor Laboratory","abstract":[{"lang":"eng","text":"As genome-wide association studies (GWAS) increased in size, numerous gene-environment interactions (GxE) have been discovered, many of which however explore only one environment at a time and may suffer from statistical artefacts leading to biased interaction estimates. Here we propose a maximum likelihood method to estimate the contribution of GxE to complex traits taking into account all interacting environmental variables at the same time, without the need to measure any. This is possible because GxE induces fluctuations in the conditional trait variance, the extent of which depends on the strength of GxE. The approach can be applied to continuous outcomes and for single SNPs or genetic risk scores (GRS). Extensive simulations demonstrated that our method yields unbiased interaction estimates and excellent confidence interval coverage. We also offer a strategy to distinguish specific GxE from general heteroscedasticity (scale effects). Applying our method to 32 complex traits in the UK Biobank reveals that for body mass index (BMI) the GRSxE explains an additional 1.9% variance on top of the 5.2% GRS contribution. However, this interaction is not specific to the GRS and holds for any variable similarly correlated with BMI. On the contrary, the GRSxE interaction effect for leg impedance Embedded Image is significantly (P < 10−56) larger than it would be expected for a similarly correlated variable Embedded Image. We showed that our method could robustly detect the global contribution of GxE to complex traits, which turned out to be substantial for certain obesity measures."}],"extern":"1","type":"preprint"},{"publication_identifier":{"issn":["1553-7358"]},"month":"07","doi":"10.1371/journal.pcbi.1007049","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":{"pmid":["31295253"]},"quality_controlled":"1","file_date_updated":"2020-07-14T12:48:08Z","extern":"1","article_number":"e1007049","author":[{"full_name":"Currin, Christopher B.","first_name":"Christopher B.","last_name":"Currin"},{"last_name":"Khoza","first_name":"Phumlani N.","full_name":"Khoza, Phumlani N."},{"full_name":"Antrobus, Alexander D.","first_name":"Alexander D.","last_name":"Antrobus"},{"first_name":"Peter E.","last_name":"Latham","full_name":"Latham, Peter E."},{"id":"CB6FF8D2-008F-11EA-8E08-2637E6697425","orcid":"0000-0003-3295-6181","first_name":"Tim P","last_name":"Vogels","full_name":"Vogels, Tim P"},{"full_name":"Raimondo, Joseph V.","first_name":"Joseph V.","last_name":"Raimondo"}],"volume":15,"date_updated":"2021-01-12T08:16:31Z","date_created":"2020-06-25T12:50:39Z","pmid":1,"year":"2019","publisher":"Public Library of Science","publication_status":"published","article_processing_charge":"No","has_accepted_license":"1","day":"11","date_published":"2019-07-11T00:00:00Z","citation":{"mla":"Currin, Christopher B., et al. “Think: Theory for Africa.” PLOS Computational Biology, vol. 15, no. 7, e1007049, Public Library of Science, 2019, doi:10.1371/journal.pcbi.1007049.","short":"C.B. Currin, P.N. Khoza, A.D. Antrobus, P.E. Latham, T.P. Vogels, J.V. Raimondo, PLOS Computational Biology 15 (2019).","chicago":"Currin, Christopher B., Phumlani N. Khoza, Alexander D. Antrobus, Peter E. Latham, Tim P Vogels, and Joseph V. Raimondo. “Think: Theory for Africa.” PLOS Computational Biology. Public Library of Science, 2019. https://doi.org/10.1371/journal.pcbi.1007049.","ama":"Currin CB, Khoza PN, Antrobus AD, Latham PE, Vogels TP, Raimondo JV. Think: Theory for Africa. PLOS Computational Biology. 2019;15(7). doi:10.1371/journal.pcbi.1007049","ista":"Currin CB, Khoza PN, Antrobus AD, Latham PE, Vogels TP, Raimondo JV. 2019. Think: Theory for Africa. PLOS Computational Biology. 15(7), e1007049.","ieee":"C. B. Currin, P. N. Khoza, A. D. Antrobus, P. E. Latham, T. P. Vogels, and J. V. Raimondo, “Think: Theory for Africa,” PLOS Computational Biology, vol. 15, no. 7. Public Library of Science, 2019.","apa":"Currin, C. B., Khoza, P. N., Antrobus, A. D., Latham, P. E., Vogels, T. P., & Raimondo, J. V. (2019). Think: Theory for Africa. PLOS Computational Biology. Public Library of Science. https://doi.org/10.1371/journal.pcbi.1007049"},"publication":"PLOS Computational Biology","article_type":"original","issue":"7","type":"journal_article","file":[{"file_id":"8079","relation":"main_file","checksum":"723bdfb6ee5c747cbbb32baf01d17fad","date_updated":"2020-07-14T12:48:08Z","date_created":"2020-07-02T12:22:57Z","access_level":"open_access","file_name":"2019_PlosCompBio_Currin.pdf","creator":"cziletti","content_type":"application/pdf","file_size":773969}],"oa_version":"Published Version","_id":"8013","user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425","intvolume":" 15","title":"Think: Theory for Africa","ddc":["570"],"status":"public"},{"author":[{"first_name":"Sanjay G.","last_name":"Manohar","full_name":"Manohar, Sanjay G."},{"full_name":"Zokaei, Nahid","last_name":"Zokaei","first_name":"Nahid"},{"full_name":"Fallon, Sean J.","last_name":"Fallon","first_name":"Sean J."},{"orcid":"0000-0003-3295-6181","id":"CB6FF8D2-008F-11EA-8E08-2637E6697425","last_name":"Vogels","first_name":"Tim P","full_name":"Vogels, Tim P"},{"full_name":"Husain, Masud","first_name":"Masud","last_name":"Husain"}],"date_created":"2020-06-25T12:52:13Z","date_updated":"2021-01-12T08:16:31Z","volume":101,"year":"2019","pmid":1,"publication_status":"published","publisher":"Elsevier ","file_date_updated":"2020-07-14T12:48:08Z","extern":"1","doi":"10.1016/j.neubiorev.2019.03.017","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://doi.org/10.1101/233007 ","open_access":"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":["30922977"]},"oa":1,"quality_controlled":"1","month":"06","publication_identifier":{"issn":["0149-7634"]},"file":[{"checksum":"7b972e3d6f7bb3122c8c5648f44e60ca","date_updated":"2020-07-14T12:48:08Z","date_created":"2020-07-02T13:17:52Z","file_id":"8080","relation":"main_file","creator":"cziletti","content_type":"application/pdf","file_size":1754418,"access_level":"open_access","file_name":"2019_NeurosBiobehavRev_Manohar.pdf"}],"oa_version":"Published Version","user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425","_id":"8014","title":"Neural mechanisms of attending to items in working memory","status":"public","ddc":["570"],"intvolume":" 101","abstract":[{"lang":"eng","text":"Working memory, the ability to keep recently accessed information available for immediate manipulation, has been proposed to rely on two mechanisms that appear difficult to reconcile: self-sustained neural firing, or the opposite—activity-silent synaptic traces. Here we review and contrast models of these two mechanisms, and then show that both phenomena can co-exist within a unified system in which neurons hold information in both activity and synapses. Rapid plasticity in flexibly-coding neurons allows features to be bound together into objects, with an important emergent property being the focus of attention. One memory item is held by persistent activity in an attended or “focused” state, and is thus remembered better than other items. Other, previously attended items can remain in memory but in the background, encoded in activity-silent synaptic traces. This dual functional architecture provides a unified common mechanism accounting for a diversity of perplexing attention and memory effects that have been hitherto difficult to explain in a single theoretical framework."}],"type":"journal_article","date_published":"2019-06-01T00:00:00Z","publication":"Neuroscience and Biobehavioral Reviews","citation":{"chicago":"Manohar, Sanjay G., Nahid Zokaei, Sean J. Fallon, Tim P Vogels, and Masud Husain. “Neural Mechanisms of Attending to Items in Working Memory.” Neuroscience and Biobehavioral Reviews. Elsevier , 2019. https://doi.org/10.1016/j.neubiorev.2019.03.017.","short":"S.G. Manohar, N. Zokaei, S.J. Fallon, T.P. Vogels, M. Husain, Neuroscience and Biobehavioral Reviews 101 (2019) 1–12.","mla":"Manohar, Sanjay G., et al. “Neural Mechanisms of Attending to Items in Working Memory.” Neuroscience and Biobehavioral Reviews, vol. 101, Elsevier , 2019, pp. 1–12, doi:10.1016/j.neubiorev.2019.03.017.","ieee":"S. G. Manohar, N. Zokaei, S. J. Fallon, T. P. Vogels, and M. Husain, “Neural mechanisms of attending to items in working memory,” Neuroscience and Biobehavioral Reviews, vol. 101. Elsevier , pp. 1–12, 2019.","apa":"Manohar, S. G., Zokaei, N., Fallon, S. J., Vogels, T. P., & Husain, M. (2019). Neural mechanisms of attending to items in working memory. Neuroscience and Biobehavioral Reviews. Elsevier . https://doi.org/10.1016/j.neubiorev.2019.03.017","ista":"Manohar SG, Zokaei N, Fallon SJ, Vogels TP, Husain M. 2019. Neural mechanisms of attending to items in working memory. Neuroscience and Biobehavioral Reviews. 101, 1–12.","ama":"Manohar SG, Zokaei N, Fallon SJ, Vogels TP, Husain M. Neural mechanisms of attending to items in working memory. Neuroscience and Biobehavioral Reviews. 2019;101:1-12. doi:10.1016/j.neubiorev.2019.03.017"},"article_type":"original","page":"1-12","day":"01","article_processing_charge":"No","has_accepted_license":"1"},{"month":"07","project":[{"name":"Random matrices, universality and disordered quantum systems","call_identifier":"FP7","grant_number":"338804","_id":"258DCDE6-B435-11E9-9278-68D0E5697425"},{"grant_number":"716117","_id":"256E75B8-B435-11E9-9278-68D0E5697425","name":"Optimal Transport and Stochastic Dynamics","call_identifier":"H2020"}],"quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1902.08750"}],"oa":1,"external_id":{"arxiv":["1902.08750"]},"language":[{"iso":"eng"}],"conference":{"end_date":"2019-07-05","start_date":"2019-07-01","location":"Ljubljana, Slovenia","name":"FPSAC: International Conference on Formal Power Series and Algebraic Combinatorics"},"article_number":"34","ec_funded":1,"publisher":"Formal Power Series and Algebraic Combinatorics","department":[{"_id":"LaEr"}],"publication_status":"published","year":"2019","acknowledgement":"D.B. is especially grateful to Patrik Ferrari for suggesting simplifications in Section 3 and\r\nto Alessandra Occelli for suggesting the name for the models of Section 2.\r\n","date_updated":"2021-01-12T08:17:18Z","date_created":"2020-07-26T22:01:04Z","author":[{"full_name":"Betea, Dan","last_name":"Betea","first_name":"Dan"},{"full_name":"Bouttier, Jérémie","first_name":"Jérémie","last_name":"Bouttier"},{"last_name":"Nejjar","first_name":"Peter","id":"4BF426E2-F248-11E8-B48F-1D18A9856A87","full_name":"Nejjar, Peter"},{"last_name":"Vuletíc","first_name":"Mirjana","full_name":"Vuletíc, Mirjana"}],"scopus_import":"1","article_processing_charge":"No","day":"01","citation":{"short":"D. Betea, J. Bouttier, P. Nejjar, M. Vuletíc, in:, Proceedings on the 31st International Conference on Formal Power Series and Algebraic Combinatorics, Formal Power Series and Algebraic Combinatorics, 2019.","mla":"Betea, Dan, et al. “New Edge Asymptotics of Skew Young Diagrams via Free Boundaries.” Proceedings on the 31st International Conference on Formal Power Series and Algebraic Combinatorics, 34, Formal Power Series and Algebraic Combinatorics, 2019.","chicago":"Betea, Dan, Jérémie Bouttier, Peter Nejjar, and Mirjana Vuletíc. “New Edge Asymptotics of Skew Young Diagrams via Free Boundaries.” In Proceedings on the 31st International Conference on Formal Power Series and Algebraic Combinatorics. Formal Power Series and Algebraic Combinatorics, 2019.","ama":"Betea D, Bouttier J, Nejjar P, Vuletíc M. New edge asymptotics of skew Young diagrams via free boundaries. In: Proceedings on the 31st International Conference on Formal Power Series and Algebraic Combinatorics. Formal Power Series and Algebraic Combinatorics; 2019.","apa":"Betea, D., Bouttier, J., Nejjar, P., & Vuletíc, M. (2019). New edge asymptotics of skew Young diagrams via free boundaries. In Proceedings on the 31st International Conference on Formal Power Series and Algebraic Combinatorics. Ljubljana, Slovenia: Formal Power Series and Algebraic Combinatorics.","ieee":"D. Betea, J. Bouttier, P. Nejjar, and M. Vuletíc, “New edge asymptotics of skew Young diagrams via free boundaries,” in Proceedings on the 31st International Conference on Formal Power Series and Algebraic Combinatorics, Ljubljana, Slovenia, 2019.","ista":"Betea D, Bouttier J, Nejjar P, Vuletíc M. 2019. New edge asymptotics of skew Young diagrams via free boundaries. Proceedings on the 31st International Conference on Formal Power Series and Algebraic Combinatorics. FPSAC: International Conference on Formal Power Series and Algebraic Combinatorics, 34."},"publication":"Proceedings on the 31st International Conference on Formal Power Series and Algebraic Combinatorics","date_published":"2019-07-01T00:00:00Z","type":"conference","abstract":[{"lang":"eng","text":"We study edge asymptotics of poissonized Plancherel-type measures on skew Young diagrams (integer partitions). These measures can be seen as generalizations of those studied by Baik--Deift--Johansson and Baik--Rains in resolving Ulam's problem on longest increasing subsequences of random permutations and the last passage percolation (corner growth) discrete versions thereof. Moreover they interpolate between said measures and the uniform measure on partitions. In the new KPZ-like 1/3 exponent edge scaling limit with logarithmic corrections, we find new probability distributions generalizing the classical Tracy--Widom GUE, GOE and GSE distributions from the theory of random matrices."}],"status":"public","title":"New edge asymptotics of skew Young diagrams via free boundaries","_id":"8175","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint"},{"date_created":"2020-08-10T11:50:54Z","date_updated":"2021-01-12T08:17:36Z","volume":12,"author":[{"full_name":"Singer, Josef","orcid":"0000-0002-8701-2412","first_name":"Josef","last_name":"Singer"},{"first_name":"Gertrude","last_name":"Achatz-Straussberger","full_name":"Achatz-Straussberger, Gertrude"},{"first_name":"Anna","last_name":"Bentley-Lukschal","full_name":"Bentley-Lukschal, Anna"},{"id":"36432834-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8777-3502","first_name":"Judit","last_name":"Fazekas-Singer","full_name":"Fazekas-Singer, Judit"},{"full_name":"Achatz, Gernot","last_name":"Achatz","first_name":"Gernot"},{"full_name":"Karagiannis, Sophia N.","last_name":"Karagiannis","first_name":"Sophia N."},{"first_name":"Erika","last_name":"Jensen-Jarolim","full_name":"Jensen-Jarolim, Erika"}],"publication_status":"published","publisher":"Elsevier","year":"2019","extern":"1","article_number":"100044","language":[{"iso":"eng"}],"doi":"10.1016/j.waojou.2019.100044","quality_controlled":"1","oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1016/j.waojou.2019.100044"}],"month":"07","publication_identifier":{"issn":["1939-4551"]},"oa_version":"Published Version","status":"public","title":"AllergoOncology: High innate IgE levels are decisive for the survival of cancer-bearing mice","intvolume":" 12","_id":"8228","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"Background: Atopics have a lower risk for malignancies, and IgE targeted to tumors is superior to IgG in fighting cancer. Whether IgE-mediated innate or adaptive immune surveillance can confer protection against tumors remains unclear.\r\nObjective: We aimed to investigate the effects of active and passive immunotherapy to the tumor-associated antigen HER-2 in three murine models differing in Epsilon-B-cell-receptor expression affecting the levels of expressed IgE.\r\nMethods: We compared the levels of several serum specific anti-HER-2 antibodies (IgE, IgG1, IgG2a, IgG2b, IgA) and the survival rates in low-IgE ΔM1M2 mice lacking the transmembrane/cytoplasmic domain of Epsilon-B-cell-receptors expressing reduced IgE levels, high-IgE KN1 mice expressing chimeric Epsilon-Gamma1-B-cell receptors with 4-6-fold elevated serum IgE levels, and wild type (WT) BALB/c. Prior engrafting mice with D2F2/E2 mammary tumors overexpressing HER-2, mice were vaccinated with HER-2 or vehicle control PBS using the Th2-adjuvant Al(OH)3 (active immunotherapy), or treated with the murine anti-HER-2 IgG1 antibody 4D5 (passive immunotherapy).\r\nResults: Overall, among the three strains of mice, HER-2 vaccination induced significantly higher levels of HER-2 specific IgE and IgG1 in high-IgE KN1, while low-IgE ΔM1M2 mice had higher IgG2a levels. HER-2 vaccination and passive immunotherapy prolonged the survival in tumor-grafted WT and low-IgE ΔM1M2 strains compared with treatment controls; active vaccination provided the highest benefit. Notably, untreated high-IgE KN1 mice displayed the longest survival of all strains, which could not be further extended by active or passive immunotherapy.\r\nConclusion: Active and passive immunotherapies prolong survival in wild type and low-IgE ΔM1M2 mice engrafted with mammary tumors. High-IgE KN1 mice have an innate survival benefit following tumor challenge."}],"issue":"7","type":"journal_article","date_published":"2019-07-29T00:00:00Z","article_type":"original","publication":"World Allergy Organization Journal","citation":{"chicago":"Singer, Josef, Gertrude Achatz-Straussberger, Anna Bentley-Lukschal, Judit Singer, Gernot Achatz, Sophia N. Karagiannis, and Erika Jensen-Jarolim. “AllergoOncology: High Innate IgE Levels Are Decisive for the Survival of Cancer-Bearing Mice.” World Allergy Organization Journal. Elsevier, 2019. https://doi.org/10.1016/j.waojou.2019.100044.","mla":"Singer, Josef, et al. “AllergoOncology: High Innate IgE Levels Are Decisive for the Survival of Cancer-Bearing Mice.” World Allergy Organization Journal, vol. 12, no. 7, 100044, Elsevier, 2019, doi:10.1016/j.waojou.2019.100044.","short":"J. Singer, G. Achatz-Straussberger, A. Bentley-Lukschal, J. Singer, G. Achatz, S.N. Karagiannis, E. Jensen-Jarolim, World Allergy Organization Journal 12 (2019).","ista":"Singer J, Achatz-Straussberger G, Bentley-Lukschal A, Singer J, Achatz G, Karagiannis SN, Jensen-Jarolim E. 2019. AllergoOncology: High innate IgE levels are decisive for the survival of cancer-bearing mice. World Allergy Organization Journal. 12(7), 100044.","apa":"Singer, J., Achatz-Straussberger, G., Bentley-Lukschal, A., Singer, J., Achatz, G., Karagiannis, S. N., & Jensen-Jarolim, E. (2019). AllergoOncology: High innate IgE levels are decisive for the survival of cancer-bearing mice. World Allergy Organization Journal. Elsevier. https://doi.org/10.1016/j.waojou.2019.100044","ieee":"J. Singer et al., “AllergoOncology: High innate IgE levels are decisive for the survival of cancer-bearing mice,” World Allergy Organization Journal, vol. 12, no. 7. Elsevier, 2019.","ama":"Singer J, Achatz-Straussberger G, Bentley-Lukschal A, et al. AllergoOncology: High innate IgE levels are decisive for the survival of cancer-bearing mice. World Allergy Organization Journal. 2019;12(7). doi:10.1016/j.waojou.2019.100044"},"day":"29","article_processing_charge":"No"},{"year":"2019","publisher":"MDPI","publication_status":"published","author":[{"full_name":"Ondracek, Anna S.","orcid":"0000-0001-7625-3651","first_name":"Anna S.","last_name":"Ondracek"},{"last_name":"Heiden","first_name":"Denise","full_name":"Heiden, Denise"},{"first_name":"Gertie J.","last_name":"Oostingh","full_name":"Oostingh, Gertie J."},{"full_name":"Fuerst, Elisabeth","first_name":"Elisabeth","last_name":"Fuerst"},{"first_name":"Judit","last_name":"Fazekas-Singer","id":"36432834-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8777-3502","full_name":"Fazekas-Singer, Judit"},{"full_name":"Bergmayr, Cornelia","last_name":"Bergmayr","first_name":"Cornelia"},{"last_name":"Rohrhofer","first_name":"Johanna","orcid":"0000-0002-2783-2099","full_name":"Rohrhofer, Johanna"},{"last_name":"Jensen-Jarolim","first_name":"Erika","orcid":"0000-0003-4019-5765","full_name":"Jensen-Jarolim, Erika"},{"first_name":"Albert","last_name":"Duschl","orcid":"0000-0002-7034-9860","full_name":"Duschl, Albert"},{"full_name":"Untersmayr, Eva","first_name":"Eva","last_name":"Untersmayr","orcid":"0000-0002-1963-499X"}],"volume":11,"date_created":"2020-08-10T11:51:04Z","date_updated":"2021-01-12T08:17:36Z","article_number":"2463","extern":"1","main_file_link":[{"url":"https://doi.org/10.3390/nu11102463","open_access":"1"}],"oa":1,"quality_controlled":"1","doi":"10.3390/nu11102463","language":[{"iso":"eng"}],"publication_identifier":{"issn":["2072-6643"]},"month":"10","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"8229","intvolume":" 11","status":"public","title":"Immune effects of the nitrated food allergen beta-lactoglobulin in an experimental food allergy model","oa_version":"Published Version","type":"journal_article","issue":"10","abstract":[{"lang":"eng","text":"Food proteins may get nitrated by various exogenous or endogenous mechanisms. As individuals might get recurrently exposed to nitrated proteins via daily diet, we aimed to investigate the effect of repeatedly ingested nitrated food proteins on the subsequent immune response in non-allergic and allergic mice using the milk allergen beta-lactoglobulin (BLG) as model food protein in a mouse model. Evaluating the presence of nitrated proteins in food, we could detect 3-nitrotyrosine (3-NT) in extracts of different foods and in stomach content extracts of non-allergic mice under physiological conditions. Chemically nitrated BLG (BLGn) exhibited enhanced susceptibility to degradation in simulated gastric fluid experiments compared to untreated BLG (BLGu). Gavage of BLGn to non-allergic animals increased interferon-γ and interleukin-10 release of stimulated spleen cells and led to the formation of BLG-specific serum IgA. Allergic mice receiving three oral gavages of BLGn had higher levels of mouse mast cell protease-1 (mMCP-1) compared to allergic mice receiving BLGu. Regardless of the preceding immune status, non-allergic or allergic, repeatedly ingested nitrated food proteins seem to considerably influence the subsequent immune response."}],"citation":{"mla":"Ondracek, Anna S., et al. “Immune Effects of the Nitrated Food Allergen Beta-Lactoglobulin in an Experimental Food Allergy Model.” Nutrients, vol. 11, no. 10, 2463, MDPI, 2019, doi:10.3390/nu11102463.","short":"A.S. Ondracek, D. Heiden, G.J. Oostingh, E. Fuerst, J. Singer, C. Bergmayr, J. Rohrhofer, E. Jensen-Jarolim, A. Duschl, E. Untersmayr, Nutrients 11 (2019).","chicago":"Ondracek, Anna S., Denise Heiden, Gertie J. Oostingh, Elisabeth Fuerst, Judit Singer, Cornelia Bergmayr, Johanna Rohrhofer, Erika Jensen-Jarolim, Albert Duschl, and Eva Untersmayr. “Immune Effects of the Nitrated Food Allergen Beta-Lactoglobulin in an Experimental Food Allergy Model.” Nutrients. MDPI, 2019. https://doi.org/10.3390/nu11102463.","ama":"Ondracek AS, Heiden D, Oostingh GJ, et al. Immune effects of the nitrated food allergen beta-lactoglobulin in an experimental food allergy model. Nutrients. 2019;11(10). doi:10.3390/nu11102463","ista":"Ondracek AS, Heiden D, Oostingh GJ, Fuerst E, Singer J, Bergmayr C, Rohrhofer J, Jensen-Jarolim E, Duschl A, Untersmayr E. 2019. Immune effects of the nitrated food allergen beta-lactoglobulin in an experimental food allergy model. Nutrients. 11(10), 2463.","ieee":"A. S. Ondracek et al., “Immune effects of the nitrated food allergen beta-lactoglobulin in an experimental food allergy model,” Nutrients, vol. 11, no. 10. MDPI, 2019.","apa":"Ondracek, A. S., Heiden, D., Oostingh, G. J., Fuerst, E., Singer, J., Bergmayr, C., … Untersmayr, E. (2019). Immune effects of the nitrated food allergen beta-lactoglobulin in an experimental food allergy model. Nutrients. MDPI. https://doi.org/10.3390/nu11102463"},"publication":"Nutrients","article_type":"original","date_published":"2019-10-15T00:00:00Z","article_processing_charge":"No","day":"15"},{"publication_identifier":{"issn":["0105-4538","1398-9995"]},"article_processing_charge":"No","day":"01","month":"10","doi":"10.1111/all.13818","date_published":"2019-10-01T00:00:00Z","language":[{"iso":"eng"}],"citation":{"apa":"Ilieva, K. M., Singer, J., Bax, H. J., Crescioli, S., Montero‐Morales, L., Mele, S., … Karagiannis, S. N. (2019). AllergoOncology: Expression platform development and functional profiling of an anti‐HER2 IgE antibody. Allergy. Wiley. https://doi.org/10.1111/all.13818","ieee":"K. M. Ilieva et al., “AllergoOncology: Expression platform development and functional profiling of an anti‐HER2 IgE antibody,” Allergy, vol. 74, no. 10. Wiley, pp. 1985–1989, 2019.","ista":"Ilieva KM, Singer J, Bax HJ, Crescioli S, Montero‐Morales L, Mele S, Sow HS, Stavraka C, Josephs DH, Spicer JF, Steinkellner H, Jensen‐Jarolim E, Tutt ANJ, Karagiannis SN. 2019. AllergoOncology: Expression platform development and functional profiling of an anti‐HER2 IgE antibody. Allergy. 74(10), 1985–1989.","ama":"Ilieva KM, Singer J, Bax HJ, et al. AllergoOncology: Expression platform development and functional profiling of an anti‐HER2 IgE antibody. Allergy. 2019;74(10):1985-1989. doi:10.1111/all.13818","chicago":"Ilieva, Kristina M., Judit Singer, Heather J. Bax, Silvia Crescioli, Laura Montero‐Morales, Silvia Mele, Heng Sheng Sow, et al. “AllergoOncology: Expression Platform Development and Functional Profiling of an Anti‐HER2 IgE Antibody.” Allergy. Wiley, 2019. https://doi.org/10.1111/all.13818.","short":"K.M. Ilieva, J. Singer, H.J. Bax, S. Crescioli, L. Montero‐Morales, S. Mele, H.S. Sow, C. Stavraka, D.H. Josephs, J.F. Spicer, H. Steinkellner, E. Jensen‐Jarolim, A.N.J. Tutt, S.N. Karagiannis, Allergy 74 (2019) 1985–1989.","mla":"Ilieva, Kristina M., et al. “AllergoOncology: Expression Platform Development and Functional Profiling of an Anti‐HER2 IgE Antibody.” Allergy, vol. 74, no. 10, Wiley, 2019, pp. 1985–89, doi:10.1111/all.13818."},"oa":1,"main_file_link":[{"url":"https://doi.org/10.1111/all.13818","open_access":"1"}],"publication":"Allergy","page":"1985-1989","quality_controlled":"1","article_type":"letter_note","issue":"10","extern":"1","type":"journal_article","author":[{"full_name":"Ilieva, Kristina M.","first_name":"Kristina M.","last_name":"Ilieva"},{"last_name":"Fazekas-Singer","first_name":"Judit","orcid":"0000-0002-8777-3502","id":"36432834-F248-11E8-B48F-1D18A9856A87","full_name":"Fazekas-Singer, Judit"},{"last_name":"Bax","first_name":"Heather J.","full_name":"Bax, Heather J."},{"full_name":"Crescioli, Silvia","first_name":"Silvia","last_name":"Crescioli"},{"first_name":"Laura","last_name":"Montero‐Morales","full_name":"Montero‐Morales, Laura"},{"first_name":"Silvia","last_name":"Mele","full_name":"Mele, Silvia"},{"full_name":"Sow, Heng Sheng","first_name":"Heng Sheng","last_name":"Sow"},{"first_name":"Chara","last_name":"Stavraka","full_name":"Stavraka, Chara"},{"last_name":"Josephs","first_name":"Debra H.","full_name":"Josephs, Debra H."},{"full_name":"Spicer, James F.","first_name":"James F.","last_name":"Spicer"},{"full_name":"Steinkellner, Herta","first_name":"Herta","last_name":"Steinkellner","orcid":"0000-0003-4823-1505"},{"full_name":"Jensen‐Jarolim, Erika","orcid":"0000-0003-4019-5765","first_name":"Erika","last_name":"Jensen‐Jarolim"},{"first_name":"Andrew N. J.","last_name":"Tutt","orcid":"0000-0001-8715-2901","full_name":"Tutt, Andrew N. J."},{"first_name":"Sophia N.","last_name":"Karagiannis","orcid":"0000-0002-4100-7810","full_name":"Karagiannis, Sophia N."}],"oa_version":"Published Version","volume":74,"date_created":"2020-08-10T11:50:42Z","date_updated":"2021-01-12T08:17:35Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"8227","year":"2019","publisher":"Wiley","intvolume":" 74","publication_status":"published","title":"AllergoOncology: Expression platform development and functional profiling of an anti‐HER2 IgE antibody","status":"public"},{"doi":"10.1186/s12862-019-1403-6","date_published":"2019-03-27T00:00:00Z","language":[{"iso":"eng"}],"oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1186/s12862-019-1403-6"}],"citation":{"ama":"Shelyakin PV, Bochkareva O, Karan AA, Gelfand MS. Micro-evolution of three Streptococcus species: Selection, antigenic variation, and horizontal gene inflow. BMC Evolutionary Biology. 2019;19. doi:10.1186/s12862-019-1403-6","ista":"Shelyakin PV, Bochkareva O, Karan AA, Gelfand MS. 2019. Micro-evolution of three Streptococcus species: Selection, antigenic variation, and horizontal gene inflow. BMC Evolutionary Biology. 19, 83.","apa":"Shelyakin, P. V., Bochkareva, O., Karan, A. A., & Gelfand, M. S. (2019). Micro-evolution of three Streptococcus species: Selection, antigenic variation, and horizontal gene inflow. BMC Evolutionary Biology. Springer Nature. https://doi.org/10.1186/s12862-019-1403-6","ieee":"P. V. Shelyakin, O. Bochkareva, A. A. Karan, and M. S. Gelfand, “Micro-evolution of three Streptococcus species: Selection, antigenic variation, and horizontal gene inflow,” BMC Evolutionary Biology, vol. 19. Springer Nature, 2019.","mla":"Shelyakin, Pavel V., et al. “Micro-Evolution of Three Streptococcus Species: Selection, Antigenic Variation, and Horizontal Gene Inflow.” BMC Evolutionary Biology, vol. 19, 83, Springer Nature, 2019, doi:10.1186/s12862-019-1403-6.","short":"P.V. Shelyakin, O. Bochkareva, A.A. Karan, M.S. Gelfand, BMC Evolutionary Biology 19 (2019).","chicago":"Shelyakin, Pavel V., Olga Bochkareva, Anna A. Karan, and Mikhail S. Gelfand. “Micro-Evolution of Three Streptococcus Species: Selection, Antigenic Variation, and Horizontal Gene Inflow.” BMC Evolutionary Biology. Springer Nature, 2019. https://doi.org/10.1186/s12862-019-1403-6."},"publication":"BMC Evolutionary Biology","quality_controlled":"1","article_type":"original","article_processing_charge":"No","publication_identifier":{"issn":["1471-2148"]},"day":"27","month":"03","author":[{"orcid":"0000-0003-0120-9319","last_name":"Shelyakin","first_name":"Pavel V.","full_name":"Shelyakin, Pavel V."},{"first_name":"Olga","last_name":"Bochkareva","id":"C4558D3C-6102-11E9-A62E-F418E6697425","orcid":"0000-0003-1006-6639","full_name":"Bochkareva, Olga"},{"first_name":"Anna A.","last_name":"Karan","full_name":"Karan, Anna A."},{"last_name":"Gelfand","first_name":"Mikhail S.","full_name":"Gelfand, Mikhail S."}],"volume":19,"oa_version":"Published Version","date_created":"2020-08-15T11:04:07Z","date_updated":"2023-02-23T13:28:54Z","year":"2019","_id":"8263","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 19","publisher":"Springer Nature","publication_status":"published","title":"Micro-evolution of three Streptococcus species: Selection, antigenic variation, and horizontal gene inflow","status":"public","abstract":[{"lang":"eng","text":"Background: The genus Streptococcus comprises pathogens that strongly influence the health of humans and animals. Genome sequencing of multiple Streptococcus strains demonstrated high variability in gene content and order even in closely related strains of the same species and created a newly emerged object for genomic analysis, the pan-genome. Here we analysed the genome evolution of 25 strains of Streptococcus suis, 50 strains of Streptococcus pyogenes and 28 strains of Streptococcus pneumoniae.\r\n\r\nResults: Fractions of the pan-genome, unique, periphery, and universal genes differ in size, functional composition, the level of nucleotide substitutions, and predisposition to horizontal gene transfer and genomic rearrangements. The density of substitutions in intergenic regions appears to be correlated with selection acting on adjacent genes, implying that more conserved genes tend to have more conserved regulatory regions.\r\nThe total pan-genome of the genus is open, but only due to strain-specific genes, whereas other pan-genome fractions reach saturation. We have identified the set of genes with phylogenies inconsistent with species and non-conserved location in the chromosome; these genes are rare in at least one species and have likely experienced recent horizontal transfer between species. The strain-specific fraction is enriched with mobile elements and hypothetical proteins, but also contains a number of candidate virulence-related genes, so it may have a strong impact on adaptability and pathogenicity.\r\nMapping the rearrangements to the phylogenetic tree revealed large parallel inversions in all species. A parallel inversion of length 15 kB with breakpoints formed by genes encoding surface antigen proteins PhtD and PhtB in S. pneumoniae leads to replacement of gene fragments that likely indicates the action of an antigen variation mechanism.\r\n\r\nConclusions: Members of genus Streptococcus have a highly dynamic, open pan-genome, that potentially confers them with the ability to adapt to changing environmental conditions, i.e. antibiotic resistance or transmission between different hosts. Hence, integrated analysis of all aspects of genome evolution is important for the identification of potential pathogens and design of drugs and vaccines."}],"extern":"1","type":"journal_article","article_number":"83"},{"page":"105-112","quality_controlled":"1","citation":{"ama":"Alp EC, Kokoris Kogias E, Fragkouli G, Ford B. Rethinking general-purpose decentralized computing. In: Proceedings of the Workshop on Hot Topics in Operating Systems. ACM; 2019:105-112. doi:10.1145/3317550.3321448","ista":"Alp EC, Kokoris Kogias E, Fragkouli G, Ford B. 2019. Rethinking general-purpose decentralized computing. Proceedings of the Workshop on Hot Topics in Operating Systems. HotOS: Workshop on Hot Topics in Operating Systems, 105–112.","ieee":"E. C. Alp, E. Kokoris Kogias, G. Fragkouli, and B. Ford, “Rethinking general-purpose decentralized computing,” in Proceedings of the Workshop on Hot Topics in Operating Systems, Bertinoro, Italy, 2019, pp. 105–112.","apa":"Alp, E. C., Kokoris Kogias, E., Fragkouli, G., & Ford, B. (2019). Rethinking general-purpose decentralized computing. In Proceedings of the Workshop on Hot Topics in Operating Systems (pp. 105–112). Bertinoro, Italy: ACM. https://doi.org/10.1145/3317550.3321448","mla":"Alp, Enis Ceyhun, et al. “Rethinking General-Purpose Decentralized Computing.” Proceedings of the Workshop on Hot Topics in Operating Systems, ACM, 2019, pp. 105–12, doi:10.1145/3317550.3321448.","short":"E.C. Alp, E. Kokoris Kogias, G. Fragkouli, B. Ford, in:, Proceedings of the Workshop on Hot Topics in Operating Systems, ACM, 2019, pp. 105–112.","chicago":"Alp, Enis Ceyhun, Eleftherios Kokoris Kogias, Georgia Fragkouli, and Bryan Ford. “Rethinking General-Purpose Decentralized Computing.” In Proceedings of the Workshop on Hot Topics in Operating Systems, 105–12. ACM, 2019. https://doi.org/10.1145/3317550.3321448."},"publication":"Proceedings of the Workshop on Hot Topics in Operating Systems","language":[{"iso":"eng"}],"doi":"10.1145/3317550.3321448","date_published":"2019-05-01T00:00:00Z","conference":{"name":"HotOS: Workshop on Hot Topics in Operating Systems","start_date":"2019-05-13","location":"Bertinoro, Italy","end_date":"2019-05-15"},"scopus_import":"1","article_processing_charge":"No","publication_identifier":{"isbn":["9781450367271"]},"day":"01","month":"05","publisher":"ACM","title":"Rethinking general-purpose decentralized computing","publication_status":"published","status":"public","_id":"8296","year":"2019","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"None","date_created":"2020-08-26T11:45:45Z","date_updated":"2021-01-12T08:17:56Z","author":[{"full_name":"Alp, Enis Ceyhun","first_name":"Enis Ceyhun","last_name":"Alp"},{"id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30","last_name":"Kokoris Kogias","first_name":"Eleftherios","full_name":"Kokoris Kogias, Eleftherios"},{"last_name":"Fragkouli","first_name":"Georgia","full_name":"Fragkouli, Georgia"},{"full_name":"Ford, Bryan","first_name":"Bryan","last_name":"Ford"}],"type":"conference","extern":"1","abstract":[{"text":"While showing great promise, smart contracts are difficult to program correctly, as they need a deep understanding of cryptography and distributed algorithms, and offer limited functionality, as they have to be deterministic and cannot operate on secret data. In this paper we present Protean, a general-purpose decentralized computing platform that addresses these limitations by moving from a monolithic execution model, where all participating nodes store all the state and execute every computation, to a modular execution-model. Protean employs secure specialized modules, called functional units, for building decentralized applications that are currently insecure or impossible to implement with smart contracts. Each functional unit is a distributed system that provides a special-purpose functionality by exposing atomic transactions to the smart-contract developer. Combining these transactions into arbitrarily-defined workflows, developers can build a larger class of decentralized applications, such as provably-secure and fair lotteries or e-voting.","lang":"eng"}]},{"month":"10","day":"01","article_processing_charge":"No","publication":"Cryptology ePrint Archive","citation":{"short":"A. Zamyatin, M. Al-Bassam, D. Zindros, E. Kokoris Kogias, P. Moreno-Sanchez, A. Kiayias, W.J. Knottenbelt, Cryptology EPrint Archive (n.d.).","mla":"Zamyatin, Alexei, et al. “SoK: Communication across Distributed Ledgers.” Cryptology EPrint Archive, 2019/1128.","chicago":"Zamyatin, Alexei, Mustafa Al-Bassam, Dionysis Zindros, Eleftherios Kokoris Kogias, Pedro Moreno-Sanchez, Aggelos Kiayias, and William J. Knottenbelt. “SoK: Communication across Distributed Ledgers.” Cryptology EPrint Archive, n.d.","ama":"Zamyatin A, Al-Bassam M, Zindros D, et al. SoK: Communication across distributed ledgers. Cryptology ePrint Archive.","apa":"Zamyatin, A., Al-Bassam, M., Zindros, D., Kokoris Kogias, E., Moreno-Sanchez, P., Kiayias, A., & Knottenbelt, W. J. (n.d.). SoK: Communication across distributed ledgers. Cryptology ePrint Archive.","ieee":"A. Zamyatin et al., “SoK: Communication across distributed ledgers,” Cryptology ePrint Archive. .","ista":"Zamyatin A, Al-Bassam M, Zindros D, Kokoris Kogias E, Moreno-Sanchez P, Kiayias A, Knottenbelt WJ. SoK: Communication across distributed ledgers. Cryptology ePrint Archive, 2019/1128."},"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2019/1128 "}],"oa":1,"language":[{"iso":"eng"}],"date_published":"2019-10-01T00:00:00Z","article_number":"2019/1128","type":"preprint","extern":"1","abstract":[{"lang":"eng","text":"Enabling secure communication across distributed systems is usually studied under the assumption of trust between the different systems and an external adversary trying to compromise the messages. With the appearance of distributed ledgers or blockchains, numerous protocols have emerged, which attempt to achieve trustless communication between distrusting ledgers and participants. Cross-chain communication (CCC) thereby plays a fundamental role in cryptocurrency exchanges, sharding, bootstrapping of new and feature-extension of existing distributed ledgers. Unfortunately, existing proposals are designed ad-hoc for specific use-cases, making it hard to gain confidence on their correctness and composability.\r\nWe provide the first systematic exposition of protocols for CCC. First, we formalize the underlying research problem and show that CCC is impossible without a trusted third party, contrary to common beliefs in the blockchain community. We then develop a framework to evaluate existing and to design new cross-chain protocols. The framework is based on the use case, the trust model, and the security assumptions of interlinked blockchains. Finally, we identify security and privacy challenges faced by protocols in the cross-chain setting.\r\nThis Systematization of Knowledge (SoK) offers a comprehensive guide for designing protocols bridging the numerous distributed ledgers available today. It aims to facilitate clearer communication between academia and industry in the field."}],"publication_status":"submitted","title":"SoK: Communication across distributed ledgers","status":"public","_id":"8304","year":"2019","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","date_updated":"2021-09-24T12:08:14Z","date_created":"2020-08-26T12:16:38Z","oa_version":"Preprint","author":[{"last_name":"Zamyatin","first_name":"Alexei","full_name":"Zamyatin, Alexei"},{"last_name":"Al-Bassam","first_name":"Mustafa","full_name":"Al-Bassam, Mustafa"},{"full_name":"Zindros, Dionysis","first_name":"Dionysis","last_name":"Zindros"},{"full_name":"Kokoris Kogias, Eleftherios","id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30","last_name":"Kokoris Kogias","first_name":"Eleftherios"},{"first_name":"Pedro","last_name":"Moreno-Sanchez","full_name":"Moreno-Sanchez, Pedro"},{"first_name":"Aggelos","last_name":"Kiayias","full_name":"Kiayias, Aggelos"},{"last_name":"Knottenbelt","first_name":"William J.","full_name":"Knottenbelt, William J."}]},{"day":"06","month":"06","article_processing_charge":"No","publication":"Cryptology ePrint Archive","citation":{"mla":"Kokoris Kogias, Eleftherios. “Robust and Scalable Consensus for Sharded Distributed Ledgers.” Cryptology EPrint Archive, 2019/676.","short":"E. Kokoris Kogias, Cryptology EPrint Archive (n.d.).","chicago":"Kokoris Kogias, Eleftherios. “Robust and Scalable Consensus for Sharded Distributed Ledgers.” Cryptology EPrint Archive, n.d.","ama":"Kokoris Kogias E. Robust and scalable consensus for sharded distributed ledgers. Cryptology ePrint Archive.","ista":"Kokoris Kogias E. Robust and scalable consensus for sharded distributed ledgers. Cryptology ePrint Archive, 2019/676.","ieee":"E. Kokoris Kogias, “Robust and scalable consensus for sharded distributed ledgers,” Cryptology ePrint Archive. .","apa":"Kokoris Kogias, E. (n.d.). Robust and scalable consensus for sharded distributed ledgers. Cryptology ePrint Archive."},"main_file_link":[{"url":"https://eprint.iacr.org/2019/676","open_access":"1"}],"oa":1,"date_published":"2019-06-06T00:00:00Z","language":[{"iso":"eng"}],"article_number":"2019/676","type":"preprint","abstract":[{"lang":"eng","text":"ByzCoin, a promising alternative of Bitcoin, is a scalable consensus protocol used as a building block of many research and enterprise-level decentralized systems. In this paper, we show that ByzCoin is unsuitable for deployment in an anopen, adversarial network and instead introduceMOTOR. MOTORis designed as a secure, robust, and scalable consensus suitable for permissionless sharded blockchains. MOTORachieves these properties by making four key design choices: (a) it prioritizes robustness in adversarial environments while maintaining adequate scalability, (b) it employees provably correct cryptography that resists DoS attacks from individual nodes, (c) it deploys unpredictable rotating leaders to defend against mildly-adaptive adversaries and prevents censorship, and (d) it creates an incentive compatible reward mechanism. These choices are materialized as (a) a “rotating subleader” communication pattern that balances the scalability needs with the robustness requirements under failures, (b) deployment of provable secure BLS multi-signatures, (c) use of deterministic thresh-old signatures as a source of randomness and (d) careful design of the reward allocation mechanism. We have implemented MOTORand compare it withByzCoin. We show that MOTORcan scale similar to ByzCoin with an at most2xoverhead whereas it maintains good performance even under high-percentage of faults, unlike ByzCoin."}],"extern":"1","_id":"8303","year":"2019","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","publication_status":"submitted","status":"public","title":"Robust and scalable consensus for sharded distributed ledgers","author":[{"id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30","first_name":"Eleftherios","last_name":"Kokoris Kogias","full_name":"Kokoris Kogias, Eleftherios"}],"date_updated":"2021-09-24T12:07:11Z","date_created":"2020-08-26T12:13:56Z","oa_version":"Preprint"},{"day":"27","month":"09","article_processing_charge":"No","page":"244","citation":{"short":"E. Kokoris Kogias, Secure, Confidential Blockchains Providing High Throughput and Low Latency, École Polytechnique Fédérale de Lausanne, 2019.","mla":"Kokoris Kogias, Eleftherios. Secure, Confidential Blockchains Providing High Throughput and Low Latency. École Polytechnique Fédérale de Lausanne, 2019, doi:10.5075/epfl-thesis-7101.","chicago":"Kokoris Kogias, Eleftherios. “Secure, Confidential Blockchains Providing High Throughput and Low Latency.” École Polytechnique Fédérale de Lausanne, 2019. https://doi.org/10.5075/epfl-thesis-7101.","ama":"Kokoris Kogias E. Secure, confidential blockchains providing high throughput and low latency. 2019. doi:10.5075/epfl-thesis-7101","apa":"Kokoris Kogias, E. (2019). Secure, confidential blockchains providing high throughput and low latency. École Polytechnique Fédérale de Lausanne. https://doi.org/10.5075/epfl-thesis-7101","ieee":"E. Kokoris Kogias, “Secure, confidential blockchains providing high throughput and low latency,” École Polytechnique Fédérale de Lausanne, 2019.","ista":"Kokoris Kogias E. 2019. Secure, confidential blockchains providing high throughput and low latency. École Polytechnique Fédérale de Lausanne."},"main_file_link":[{"open_access":"1","url":"https://www.doi.org/10.5075/epfl-thesis-7101"}],"oa":1,"degree_awarded":"PhD","supervisor":[{"full_name":"Ford, Bryan Alexander","last_name":"Ford","first_name":"Bryan Alexander"}],"language":[{"iso":"eng"}],"date_published":"2019-09-27T00:00:00Z","doi":"10.5075/epfl-thesis-7101","type":"dissertation","extern":"1","abstract":[{"text":"One of the core promises of blockchain technology is that of enabling trustworthy data dissemination in a trustless environment. What current blockchain systems deliver, however, is slow dissemination of public data, rendering blockchain technology unusable in settings where latency, transaction capacity, or data confidentiality are important. In this thesis we focus on providing solutions on two of the most pressing problems blockchain technology currently faces: scalability and data confidentiality. To address the scalability issue, we present OMNILEDGER, a novel scale-out distributed ledger that preserves long-term security under permissionless operation. It ensures security and correctness by using a bias-resistant public-randomness protocol for choosing large, statistically representative shards that process transactions, and by introducing an efficient cross-shard commit protocol that atomically handles transactions affecting multiple shards. To enable secure sharing of confidential data we present CALYPSO, the first fully decentralized, auditable access-control framework for secure blockchain-based data sharing which builds upon two abstractions. First, on-chain secrets enable collective management of (verifiably shared) secrets under a Byzantine adversary where an access-control blockchain enforces user-specific access rules and a secret-management cothority administers encrypted data. Second, skipchain-based identity and access management enables efficient administration of dynamic, sovereign identities and access policies and, in particular, permits clients to maintain long-term relationships with respect to evolving user identities thanks to the trust-delegating forward links of skipchains. In order to build OMNILEDGER and CALYPSO, we first build a set of tools for efficient decentralization, which are presented in Part II of this dissertation. These tools can be used in decentralized and distributed systems to achieve (1) scalable consensus (BYZCOIN), (2) bias- resistant distributed randomness creations (RANDHOUND), and (3) relationship-keeping between independently updating communication endpoints (SKIPCHAINIAC). Although we use this tools in the scope off this thesis, they can be (and already have been) used in a far wider scope.","lang":"eng"}],"status":"public","title":"Secure, confidential blockchains providing high throughput and low latency","publication_status":"published","publisher":"École Polytechnique Fédérale de Lausanne","_id":"8311","year":"2019","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","date_created":"2020-08-27T11:22:24Z","date_updated":"2021-12-20T15:30:47Z","oa_version":"Published Version","author":[{"id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30","last_name":"Kokoris Kogias","first_name":"Eleftherios","full_name":"Kokoris Kogias, Eleftherios"}]},{"external_id":{"arxiv":["1905.11360"]},"oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1905.11360"}],"citation":{"ama":"Avarikioti G, Kokoris Kogias E, Wattenhofer R, Zindros D. Brick: Asynchronous payment channels. arXiv.","ieee":"G. Avarikioti, E. Kokoris Kogias, R. Wattenhofer, and D. Zindros, “Brick: Asynchronous payment channels,” arXiv. .","apa":"Avarikioti, G., Kokoris Kogias, E., Wattenhofer, R., & Zindros, D. (n.d.). Brick: Asynchronous payment channels. arXiv.","ista":"Avarikioti G, Kokoris Kogias E, Wattenhofer R, Zindros D. Brick: Asynchronous payment channels. arXiv, 1905.11360.","short":"G. Avarikioti, E. Kokoris Kogias, R. Wattenhofer, D. Zindros, ArXiv (n.d.).","mla":"Avarikioti, Georgia, et al. “Brick: Asynchronous Payment Channels.” ArXiv, 1905.11360.","chicago":"Avarikioti, Georgia, Eleftherios Kokoris Kogias, Roger Wattenhofer, and Dionysis Zindros. “Brick: Asynchronous Payment Channels.” ArXiv, n.d."},"publication":"arXiv","date_published":"2019-05-27T00:00:00Z","language":[{"iso":"eng"}],"article_processing_charge":"No","day":"27","month":"05","_id":"8314","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2019","publication_status":"submitted","title":"Brick: Asynchronous payment channels","status":"public","author":[{"last_name":"Avarikioti","first_name":"Georgia","full_name":"Avarikioti, Georgia"},{"id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30","last_name":"Kokoris Kogias","first_name":"Eleftherios","full_name":"Kokoris Kogias, Eleftherios"},{"full_name":"Wattenhofer, Roger","last_name":"Wattenhofer","first_name":"Roger"},{"full_name":"Zindros, Dionysis","last_name":"Zindros","first_name":"Dionysis"}],"oa_version":"Preprint","date_updated":"2021-01-12T08:18:04Z","date_created":"2020-08-27T11:36:54Z","type":"preprint","article_number":"1905.11360","abstract":[{"text":"Off-chain protocols (channels) are a promising solution to the scalability and privacy challenges of blockchain payments. Current proposals, however, require synchrony assumptions to preserve the safety of a channel, leaking to an adversary the exact amount of time needed to control the network for a successful attack. In this paper, we introduce Brick, the first payment channel that remains secure under network asynchrony and concurrently provides correct incentives. The core idea is to incorporate the conflict resolution process within the channel by introducing a rational committee of external parties, called Wardens. Hence, if a party wants to close a channel unilaterally, it can only get the committee's approval for the last valid state. Brick provides sub-second latency because it does not employ heavy-weight consensus. Instead,\r\nBrick uses consistent broadcast to announce updates and close the channel, a light-weight abstraction that is powerful enough to preserve safety and liveness to any rational parties. Furthermore, we consider permissioned blockchains, where the additional property of auditability might be desired for regulatory purposes. We introduce Brick+, an off-chain construction that provides auditability on top of Brick without conflicting with its privacy guarantees. We formally define the properties our payment channel construction should fulfill, and prove that both Brick and Brick+ satisfy them. We also design incentives for Brick such that honest and rational behavior aligns. Finally, we provide a reference implementation of the smart contracts in Solidity.","lang":"eng"}],"extern":"1"},{"language":[{"iso":"eng"}],"date_published":"2019-10-23T00:00:00Z","publication":"arXiv","oa":1,"external_id":{"arxiv":["1910.10434"]},"main_file_link":[{"url":"https://arxiv.org/abs/1910.10434","open_access":"1"}],"citation":{"short":"G. Avarikioti, E. Kokoris Kogias, R. Wattenhofer, ArXiv (n.d.).","mla":"Avarikioti, Georgia, et al. “Divide and Scale: Formalization of Distributed Ledger Sharding Protocols.” ArXiv, 1910.10434.","chicago":"Avarikioti, Georgia, Eleftherios Kokoris Kogias, and Roger Wattenhofer. “Divide and Scale: Formalization of Distributed Ledger Sharding Protocols.” ArXiv, n.d.","ama":"Avarikioti G, Kokoris Kogias E, Wattenhofer R. Divide and scale: Formalization of distributed ledger sharding protocols. arXiv.","apa":"Avarikioti, G., Kokoris Kogias, E., & Wattenhofer, R. (n.d.). Divide and scale: Formalization of distributed ledger sharding protocols. arXiv.","ieee":"G. Avarikioti, E. Kokoris Kogias, and R. Wattenhofer, “Divide and scale: Formalization of distributed ledger sharding protocols,” arXiv. .","ista":"Avarikioti G, Kokoris Kogias E, Wattenhofer R. Divide and scale: Formalization of distributed ledger sharding protocols. arXiv, 1910.10434."},"month":"10","day":"23","article_processing_charge":"No","date_updated":"2021-01-12T08:18:05Z","date_created":"2020-08-27T11:37:43Z","oa_version":"Preprint","author":[{"last_name":"Avarikioti","first_name":"Georgia","full_name":"Avarikioti, Georgia"},{"last_name":"Kokoris Kogias","first_name":"Eleftherios","id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30","full_name":"Kokoris Kogias, Eleftherios"},{"full_name":"Wattenhofer, Roger","last_name":"Wattenhofer","first_name":"Roger"}],"title":"Divide and scale: Formalization of distributed ledger sharding protocols","status":"public","publication_status":"submitted","year":"2019","_id":"8315","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","abstract":[{"text":"Sharding distributed ledgers is the most promising on-chain solution for scaling blockchain technology. In this work, we define and analyze the properties a sharded distributed ledger should fulfill. More specifically, we show that a sharded blockchain cannot be scalable under a fully adaptive adversary, but it can scale up to $O(n/\\log n)$ under an epoch-adaptive adversary. This is possible only if the distributed ledger creates succinct proofs of the valid state updates at the end of each epoch. Our model builds upon and extends the Bitcoin backbone protocol by defining consistency and\r\nscalability. Consistency encompasses the need for atomic execution of cross-shard transactions to preserve safety, whereas scalability encapsulates the speedup a sharded system can gain in comparison to a non-sharded system. In\r\norder to show the power of our framework, we analyze the most prominent sharded blockchains and either prove their correctness (OmniLedger, RapidChain) under our model or pinpoint where they fail to balance the consistency and\r\nscalability requirements (Elastico, Monoxide). ","lang":"eng"}],"article_number":"1910.10434","type":"preprint"},{"author":[{"first_name":"Bryan","last_name":"Ford","full_name":"Ford, Bryan"},{"last_name":"Gasser","first_name":"Linus","full_name":"Gasser, Linus"},{"first_name":"Eleftherios","last_name":"Kokoris Kogias","id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30","full_name":"Kokoris Kogias, Eleftherios"},{"full_name":"Janovic, Philipp","last_name":"Janovic","first_name":"Philipp"}],"date_updated":"2022-01-05T14:00:32Z","date_created":"2020-08-27T11:24:44Z","ipc":"G06F21/62 ; H04L9/08 ; H04L9/32","oa_version":"Published Version","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","_id":"8313","year":"2019","title":"Methods and systems for secure data exchange","status":"public","applicant":["École Polytechnique Fédérale De Lausanne "],"abstract":[{"lang":"eng","text":"The present invention concerns a computer-implemented method for secure data exchange between a sender (A) and a recipient (B), wherein the method is performed by the sender (A) and comprises encrypting data using a symmetric key k, creating a write transaction T W , wherein the write transaction T W comprises information usable to derive the symmetric key k and an access policy identifying the recipient (B) as being allowed to decrypt the encrypted data, providing the recipient (B) access to the encrypted data, and sending the write transaction T W to a first group of servers (AC) for being stored in a blockchain data structure maintained by the first group of servers (AC)."}],"extern":"1","type":"patent","date_published":"2019-08-22T00:00:00Z","ipn":"WO2019158209 (A1)","publication_date":"2019-08-22","oa":1,"citation":{"ama":"Ford B, Gasser L, Kokoris Kogias E, Janovic P. Methods and systems for secure data exchange. 2019.","ieee":"B. Ford, L. Gasser, E. Kokoris Kogias, and P. Janovic, “Methods and systems for secure data exchange.” 2019.","apa":"Ford, B., Gasser, L., Kokoris Kogias, E., & Janovic, P. (2019). Methods and systems for secure data exchange.","ista":"Ford B, Gasser L, Kokoris Kogias E, Janovic P. 2019. Methods and systems for secure data exchange.","short":"B. Ford, L. Gasser, E. Kokoris Kogias, P. Janovic, (2019).","mla":"Ford, Bryan, et al. Methods and Systems for Secure Data Exchange. 2019.","chicago":"Ford, Bryan, Linus Gasser, Eleftherios Kokoris Kogias, and Philipp Janovic. “Methods and Systems for Secure Data Exchange,” 2019."},"main_file_link":[{"open_access":"1","url":"https://patents.google.com/patent/WO2019158209A1"}],"month":"08","day":"22","article_processing_charge":"No"},{"article_type":"original","publication":"Nature Communications","citation":{"ieee":"D. F. Gauto et al., “Integrated NMR and cryo-EM atomic-resolution structure determination of a half-megadalton enzyme complex,” Nature Communications, vol. 10. Springer Nature, 2019.","apa":"Gauto, D. F., Estrozi, L. F., Schwieters, C. D., Effantin, G., Macek, P., Sounier, R., … Boisbouvier, J. (2019). Integrated NMR and cryo-EM atomic-resolution structure determination of a half-megadalton enzyme complex. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-019-10490-9","ista":"Gauto DF, Estrozi LF, Schwieters CD, Effantin G, Macek P, Sounier R, Sivertsen AC, Schmidt E, Kerfah R, Mas G, Colletier J-P, Güntert P, Favier A, Schoehn G, Schanda P, Boisbouvier J. 2019. Integrated NMR and cryo-EM atomic-resolution structure determination of a half-megadalton enzyme complex. Nature Communications. 10, 2697.","ama":"Gauto DF, Estrozi LF, Schwieters CD, et al. Integrated NMR and cryo-EM atomic-resolution structure determination of a half-megadalton enzyme complex. Nature Communications. 2019;10. doi:10.1038/s41467-019-10490-9","chicago":"Gauto, Diego F., Leandro F. Estrozi, Charles D. Schwieters, Gregory Effantin, Pavel Macek, Remy Sounier, Astrid C. Sivertsen, et al. “Integrated NMR and Cryo-EM Atomic-Resolution Structure Determination of a Half-Megadalton Enzyme Complex.” Nature Communications. Springer Nature, 2019. https://doi.org/10.1038/s41467-019-10490-9.","short":"D.F. Gauto, L.F. Estrozi, C.D. Schwieters, G. Effantin, P. Macek, R. Sounier, A.C. Sivertsen, E. Schmidt, R. Kerfah, G. Mas, J.-P. Colletier, P. Güntert, A. Favier, G. Schoehn, P. Schanda, J. Boisbouvier, Nature Communications 10 (2019).","mla":"Gauto, Diego F., et al. “Integrated NMR and Cryo-EM Atomic-Resolution Structure Determination of a Half-Megadalton Enzyme Complex.” Nature Communications, vol. 10, 2697, Springer Nature, 2019, doi:10.1038/s41467-019-10490-9."},"date_published":"2019-06-19T00:00:00Z","keyword":["General Biochemistry","Genetics and Molecular Biology","General Physics and Astronomy","General Chemistry"],"day":"19","article_processing_charge":"No","title":"Integrated NMR and cryo-EM atomic-resolution structure determination of a half-megadalton enzyme complex","status":"public","intvolume":" 10","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"8405","oa_version":"Published Version","type":"journal_article","abstract":[{"lang":"eng","text":"Atomic-resolution structure determination is crucial for understanding protein function. Cryo-EM and NMR spectroscopy both provide structural information, but currently cryo-EM does not routinely give access to atomic-level structural data, and, generally, NMR structure determination is restricted to small (<30 kDa) proteins. We introduce an integrated structure determination approach that simultaneously uses NMR and EM data to overcome the limits of each of these methods. The approach enables structure determination of the 468 kDa large dodecameric aminopeptidase TET2 to a precision and accuracy below 1 Å by combining secondary-structure information obtained from near-complete magic-angle-spinning NMR assignments of the 39 kDa-large subunits, distance restraints from backbone amides and ILV methyl groups, and a 4.1 Å resolution EM map. The resulting structure exceeds current standards of NMR and EM structure determination in terms of molecular weight and precision. Importantly, the approach is successful even in cases where only medium-resolution cryo-EM data are available."}],"quality_controlled":"1","oa":1,"external_id":{"pmid":["31217444"]},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1038/s41467-019-10490-9"}],"language":[{"iso":"eng"}],"doi":"10.1038/s41467-019-10490-9","month":"06","publication_identifier":{"issn":["2041-1723"]},"publication_status":"published","publisher":"Springer Nature","year":"2019","pmid":1,"date_created":"2020-09-17T10:28:25Z","date_updated":"2021-01-12T08:19:03Z","volume":10,"author":[{"first_name":"Diego F.","last_name":"Gauto","full_name":"Gauto, Diego F."},{"first_name":"Leandro F.","last_name":"Estrozi","full_name":"Estrozi, Leandro F."},{"last_name":"Schwieters","first_name":"Charles D.","full_name":"Schwieters, Charles D."},{"first_name":"Gregory","last_name":"Effantin","full_name":"Effantin, Gregory"},{"full_name":"Macek, Pavel","first_name":"Pavel","last_name":"Macek"},{"full_name":"Sounier, Remy","last_name":"Sounier","first_name":"Remy"},{"full_name":"Sivertsen, Astrid C.","first_name":"Astrid C.","last_name":"Sivertsen"},{"first_name":"Elena","last_name":"Schmidt","full_name":"Schmidt, Elena"},{"first_name":"Rime","last_name":"Kerfah","full_name":"Kerfah, Rime"},{"last_name":"Mas","first_name":"Guillaume","full_name":"Mas, Guillaume"},{"first_name":"Jacques-Philippe","last_name":"Colletier","full_name":"Colletier, Jacques-Philippe"},{"last_name":"Güntert","first_name":"Peter","full_name":"Güntert, Peter"},{"full_name":"Favier, Adrien","first_name":"Adrien","last_name":"Favier"},{"full_name":"Schoehn, Guy","last_name":"Schoehn","first_name":"Guy"},{"last_name":"Schanda","first_name":"Paul","orcid":"0000-0002-9350-7606","id":"7B541462-FAF6-11E9-A490-E8DFE5697425","full_name":"Schanda, Paul"},{"full_name":"Boisbouvier, Jerome","last_name":"Boisbouvier","first_name":"Jerome"}],"article_number":"2697","extern":"1"},{"oa_version":"Published Version","title":"Mechanism of the allosteric activation of the ClpP protease machinery by substrates and active-site inhibitors","status":"public","intvolume":" 5","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"8406","abstract":[{"text":"Coordinated conformational transitions in oligomeric enzymatic complexes modulate function in response to substrates and play a crucial role in enzyme inhibition and activation. Caseinolytic protease (ClpP) is a tetradecameric complex, which has emerged as a drug target against multiple pathogenic bacteria. Activation of different ClpPs by inhibitors has been independently reported from drug development efforts, but no rationale for inhibitor-induced activation has been hitherto proposed. Using an integrated approach that includes x-ray crystallography, solid- and solution-state nuclear magnetic resonance, molecular dynamics simulations, and isothermal titration calorimetry, we show that the proteasome inhibitor bortezomib binds to the ClpP active-site serine, mimicking a peptide substrate, and induces a concerted allosteric activation of the complex. The bortezomib-activated conformation also exhibits a higher affinity for its cognate unfoldase ClpX. We propose a universal allosteric mechanism, where substrate binding to a single subunit locks ClpP into an active conformation optimized for chaperone association and protein processive degradation.","lang":"eng"}],"issue":"9","type":"journal_article","date_published":"2019-09-04T00:00:00Z","article_type":"original","publication":"Science Advances","citation":{"ama":"Felix J, Weinhäupl K, Chipot C, et al. Mechanism of the allosteric activation of the ClpP protease machinery by substrates and active-site inhibitors. Science Advances. 2019;5(9). doi:10.1126/sciadv.aaw3818","ista":"Felix J, Weinhäupl K, Chipot C, Dehez F, Hessel A, Gauto DF, Morlot C, Abian O, Gutsche I, Velazquez-Campoy A, Schanda P, Fraga H. 2019. Mechanism of the allosteric activation of the ClpP protease machinery by substrates and active-site inhibitors. Science Advances. 5(9), eaaw3818.","apa":"Felix, J., Weinhäupl, K., Chipot, C., Dehez, F., Hessel, A., Gauto, D. F., … Fraga, H. (2019). Mechanism of the allosteric activation of the ClpP protease machinery by substrates and active-site inhibitors. Science Advances. American Association for the Advancement of Science. https://doi.org/10.1126/sciadv.aaw3818","ieee":"J. Felix et al., “Mechanism of the allosteric activation of the ClpP protease machinery by substrates and active-site inhibitors,” Science Advances, vol. 5, no. 9. American Association for the Advancement of Science, 2019.","mla":"Felix, Jan, et al. “Mechanism of the Allosteric Activation of the ClpP Protease Machinery by Substrates and Active-Site Inhibitors.” Science Advances, vol. 5, no. 9, eaaw3818, American Association for the Advancement of Science, 2019, doi:10.1126/sciadv.aaw3818.","short":"J. Felix, K. Weinhäupl, C. Chipot, F. Dehez, A. Hessel, D.F. Gauto, C. Morlot, O. Abian, I. Gutsche, A. Velazquez-Campoy, P. Schanda, H. Fraga, Science Advances 5 (2019).","chicago":"Felix, Jan, Katharina Weinhäupl, Christophe Chipot, François Dehez, Audrey Hessel, Diego F. Gauto, Cecile Morlot, et al. “Mechanism of the Allosteric Activation of the ClpP Protease Machinery by Substrates and Active-Site Inhibitors.” Science Advances. American Association for the Advancement of Science, 2019. https://doi.org/10.1126/sciadv.aaw3818."},"day":"04","article_processing_charge":"No","date_created":"2020-09-17T10:28:36Z","date_updated":"2021-01-12T08:19:03Z","volume":5,"author":[{"last_name":"Felix","first_name":"Jan","full_name":"Felix, Jan"},{"first_name":"Katharina","last_name":"Weinhäupl","full_name":"Weinhäupl, Katharina"},{"full_name":"Chipot, Christophe","last_name":"Chipot","first_name":"Christophe"},{"last_name":"Dehez","first_name":"François","full_name":"Dehez, François"},{"full_name":"Hessel, Audrey","first_name":"Audrey","last_name":"Hessel"},{"last_name":"Gauto","first_name":"Diego F.","full_name":"Gauto, Diego F."},{"full_name":"Morlot, Cecile","first_name":"Cecile","last_name":"Morlot"},{"full_name":"Abian, Olga","last_name":"Abian","first_name":"Olga"},{"full_name":"Gutsche, Irina","last_name":"Gutsche","first_name":"Irina"},{"full_name":"Velazquez-Campoy, Adrian","first_name":"Adrian","last_name":"Velazquez-Campoy"},{"full_name":"Schanda, Paul","first_name":"Paul","last_name":"Schanda","id":"7B541462-FAF6-11E9-A490-E8DFE5697425","orcid":"0000-0002-9350-7606"},{"first_name":"Hugo","last_name":"Fraga","full_name":"Fraga, Hugo"}],"publication_status":"published","publisher":"American Association for the Advancement of Science","year":"2019","extern":"1","article_number":"eaaw3818","language":[{"iso":"eng"}],"doi":"10.1126/sciadv.aaw3818","quality_controlled":"1","main_file_link":[{"open_access":"1","url":" https://doi.org/10.1126/sciadv.aaw3818"}],"oa":1,"month":"09","publication_identifier":{"issn":["2375-2548"]}},{"keyword":["Colloid and Surface Chemistry","Biochemistry","General Chemistry","Catalysis"],"article_processing_charge":"No","day":"08","citation":{"ama":"Rovó P, Smith CA, Gauto D, de Groot BL, Schanda P, Linser R. Mechanistic insights into microsecond time-scale motion of solid proteins using complementary 15N and 1H relaxation dispersion techniques. Journal of the American Chemical Society. 2019;141(2):858-869. doi:10.1021/jacs.8b09258","ista":"Rovó P, Smith CA, Gauto D, de Groot BL, Schanda P, Linser R. 2019. Mechanistic insights into microsecond time-scale motion of solid proteins using complementary 15N and 1H relaxation dispersion techniques. Journal of the American Chemical Society. 141(2), 858–869.","apa":"Rovó, P., Smith, C. A., Gauto, D., de Groot, B. L., Schanda, P., & Linser, R. (2019). Mechanistic insights into microsecond time-scale motion of solid proteins using complementary 15N and 1H relaxation dispersion techniques. Journal of the American Chemical Society. American Chemical Society. https://doi.org/10.1021/jacs.8b09258","ieee":"P. Rovó, C. A. Smith, D. Gauto, B. L. de Groot, P. Schanda, and R. Linser, “Mechanistic insights into microsecond time-scale motion of solid proteins using complementary 15N and 1H relaxation dispersion techniques,” Journal of the American Chemical Society, vol. 141, no. 2. American Chemical Society, pp. 858–869, 2019.","mla":"Rovó, Petra, et al. “Mechanistic Insights into Microsecond Time-Scale Motion of Solid Proteins Using Complementary 15N and 1H Relaxation Dispersion Techniques.” Journal of the American Chemical Society, vol. 141, no. 2, American Chemical Society, 2019, pp. 858–69, doi:10.1021/jacs.8b09258.","short":"P. Rovó, C.A. Smith, D. Gauto, B.L. de Groot, P. Schanda, R. Linser, Journal of the American Chemical Society 141 (2019) 858–869.","chicago":"Rovó, Petra, Colin A. Smith, Diego Gauto, Bert L. de Groot, Paul Schanda, and Rasmus Linser. “Mechanistic Insights into Microsecond Time-Scale Motion of Solid Proteins Using Complementary 15N and 1H Relaxation Dispersion Techniques.” Journal of the American Chemical Society. American Chemical Society, 2019. https://doi.org/10.1021/jacs.8b09258."},"publication":"Journal of the American Chemical Society","page":"858-869","article_type":"original","date_published":"2019-01-08T00:00:00Z","type":"journal_article","issue":"2","abstract":[{"lang":"eng","text":"NMR relaxation dispersion methods provide a holistic way to observe microsecond time-scale protein backbone motion both in solution and in the solid state. Different nuclei (1H and 15N) and different relaxation dispersion techniques (Bloch–McConnell and near-rotary-resonance) give complementary information about the amplitudes and time scales of the conformational dynamics and provide comprehensive insights into the mechanistic details of the structural rearrangements. In this paper, we exemplify the benefits of the combination of various solution- and solid-state relaxation dispersion methods on a microcrystalline protein (α-spectrin SH3 domain), for which we are able to identify and model the functionally relevant conformational rearrangements around the ligand recognition loop occurring on multiple microsecond time scales. The observed loop motions suggest that the SH3 domain exists in a binding-competent conformation in dynamic equilibrium with a sterically impaired ground-state conformation both in solution and in crystalline form. This inherent plasticity between the interconverting macrostates is compatible with a conformational-preselection model and provides new insights into the recognition mechanisms of SH3 domains."}],"_id":"8413","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 141","status":"public","title":"Mechanistic insights into microsecond time-scale motion of solid proteins using complementary 15N and 1H relaxation dispersion techniques","oa_version":"Submitted Version","publication_identifier":{"issn":["0002-7863","1520-5126"]},"month":"01","external_id":{"pmid":["30620186"]},"quality_controlled":"1","doi":"10.1021/jacs.8b09258","language":[{"iso":"eng"}],"extern":"1","pmid":1,"year":"2019","publisher":"American Chemical Society","publication_status":"published","author":[{"full_name":"Rovó, Petra","first_name":"Petra","last_name":"Rovó"},{"last_name":"Smith","first_name":"Colin A.","full_name":"Smith, Colin A."},{"first_name":"Diego","last_name":"Gauto","full_name":"Gauto, Diego"},{"last_name":"de Groot","first_name":"Bert L.","full_name":"de Groot, Bert L."},{"full_name":"Schanda, Paul","first_name":"Paul","last_name":"Schanda","id":"7B541462-FAF6-11E9-A490-E8DFE5697425","orcid":"0000-0002-9350-7606"},{"full_name":"Linser, Rasmus","last_name":"Linser","first_name":"Rasmus"}],"volume":141,"date_updated":"2021-01-12T08:19:07Z","date_created":"2020-09-17T10:29:50Z"},{"oa_version":"Submitted Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"8412","intvolume":" 20","title":"Conformational dynamics in the core of human Y145Stop prion protein amyloid probed by relaxation dispersion NMR","status":"public","issue":"2","abstract":[{"lang":"eng","text":"Microsecond to millisecond timescale backbone dynamics of the amyloid core residues in Y145Stop human prion protein (PrP) fibrils were investigated by using 15N rotating frame (R1ρ) relaxation dispersion solid‐state nuclear magnetic resonance spectroscopy over a wide range of spin‐lock fields. Numerical simulations enabled the experimental relaxation dispersion profiles for most of the fibril core residues to be modelled by using a two‐state exchange process with a common exchange rate of 1000 s−1, corresponding to protein backbone motion on the timescale of 1 ms, and an excited‐state population of 2 %. We also found that the relaxation dispersion profiles for several amino acids positioned near the edges of the most structured regions of the amyloid core were better modelled by assuming somewhat higher excited‐state populations (∼5–15 %) and faster exchange rate constants, corresponding to protein backbone motions on the timescale of ∼100–300 μs. The slow backbone dynamics of the core residues were evaluated in the context of the structural model of human Y145Stop PrP amyloid."}],"type":"journal_article","date_published":"2019-01-21T00:00:00Z","citation":{"ama":"Shannon MD, Theint T, Mukhopadhyay D, et al. Conformational dynamics in the core of human Y145Stop prion protein amyloid probed by relaxation dispersion NMR. ChemPhysChem. 2019;20(2):311-317. doi:10.1002/cphc.201800779","ista":"Shannon MD, Theint T, Mukhopadhyay D, Surewicz K, Surewicz WK, Marion D, Schanda P, Jaroniec CP. 2019. Conformational dynamics in the core of human Y145Stop prion protein amyloid probed by relaxation dispersion NMR. ChemPhysChem. 20(2), 311–317.","apa":"Shannon, M. D., Theint, T., Mukhopadhyay, D., Surewicz, K., Surewicz, W. K., Marion, D., … Jaroniec, C. P. (2019). Conformational dynamics in the core of human Y145Stop prion protein amyloid probed by relaxation dispersion NMR. ChemPhysChem. Wiley. https://doi.org/10.1002/cphc.201800779","ieee":"M. D. Shannon et al., “Conformational dynamics in the core of human Y145Stop prion protein amyloid probed by relaxation dispersion NMR,” ChemPhysChem, vol. 20, no. 2. Wiley, pp. 311–317, 2019.","mla":"Shannon, Matthew D., et al. “Conformational Dynamics in the Core of Human Y145Stop Prion Protein Amyloid Probed by Relaxation Dispersion NMR.” ChemPhysChem, vol. 20, no. 2, Wiley, 2019, pp. 311–17, doi:10.1002/cphc.201800779.","short":"M.D. Shannon, T. Theint, D. Mukhopadhyay, K. Surewicz, W.K. Surewicz, D. Marion, P. Schanda, C.P. Jaroniec, ChemPhysChem 20 (2019) 311–317.","chicago":"Shannon, Matthew D., Theint Theint, Dwaipayan Mukhopadhyay, Krystyna Surewicz, Witold K. Surewicz, Dominique Marion, Paul Schanda, and Christopher P. Jaroniec. “Conformational Dynamics in the Core of Human Y145Stop Prion Protein Amyloid Probed by Relaxation Dispersion NMR.” ChemPhysChem. Wiley, 2019. https://doi.org/10.1002/cphc.201800779."},"publication":"ChemPhysChem","page":"311-317","article_type":"original","article_processing_charge":"No","day":"21","keyword":["Physical and Theoretical Chemistry","Atomic and Molecular Physics","and Optics"],"author":[{"last_name":"Shannon","first_name":"Matthew D.","full_name":"Shannon, Matthew D."},{"full_name":"Theint, Theint","last_name":"Theint","first_name":"Theint"},{"full_name":"Mukhopadhyay, Dwaipayan","last_name":"Mukhopadhyay","first_name":"Dwaipayan"},{"full_name":"Surewicz, Krystyna","first_name":"Krystyna","last_name":"Surewicz"},{"last_name":"Surewicz","first_name":"Witold K.","full_name":"Surewicz, Witold K."},{"full_name":"Marion, Dominique","last_name":"Marion","first_name":"Dominique"},{"full_name":"Schanda, Paul","id":"7B541462-FAF6-11E9-A490-E8DFE5697425","orcid":"0000-0002-9350-7606","first_name":"Paul","last_name":"Schanda"},{"first_name":"Christopher P.","last_name":"Jaroniec","full_name":"Jaroniec, Christopher P."}],"volume":20,"date_created":"2020-09-17T10:29:43Z","date_updated":"2021-01-12T08:19:06Z","pmid":1,"year":"2019","publisher":"Wiley","publication_status":"published","extern":"1","doi":"10.1002/cphc.201800779","language":[{"iso":"eng"}],"external_id":{"pmid":["30276945"]},"quality_controlled":"1","publication_identifier":{"issn":["1439-4235"]},"month":"01"},{"type":"journal_article","issue":"2","abstract":[{"lang":"eng","text":"Studying protein dynamics on microsecond‐to‐millisecond (μs‐ms) time scales can provide important insight into protein function. In magic‐angle‐spinning (MAS) NMR, μs dynamics can be visualized by R1p rotating‐frame relaxation dispersion experiments in different regimes of radio‐frequency field strengths: at low RF field strength, isotropic‐chemical‐shift fluctuation leads to “Bloch‐McConnell‐type” relaxation dispersion, while when the RF field approaches rotary resonance conditions bond angle fluctuations manifest as increased R1p rate constants (“Near‐Rotary‐Resonance Relaxation Dispersion”, NERRD). Here we explore the joint analysis of both regimes to gain comprehensive insight into motion in terms of geometric amplitudes, chemical‐shift changes, populations and exchange kinetics. We use a numerical simulation procedure to illustrate these effects and the potential of extracting exchange parameters, and apply the methodology to the study of a previously described conformational exchange process in microcrystalline ubiquitin."}],"intvolume":" 20","title":"Microsecond protein dynamics from combined Bloch-McConnell and Near-Rotary-Resonance R1p relaxation-dispersion MAS NMR","status":"public","_id":"8411","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","keyword":["Physical and Theoretical Chemistry","Atomic and Molecular Physics","and Optics"],"article_processing_charge":"No","day":"21","page":"276-284","article_type":"original","citation":{"ama":"Marion D, Gauto DF, Ayala I, Giandoreggio-Barranco K, Schanda P. Microsecond protein dynamics from combined Bloch-McConnell and Near-Rotary-Resonance R1p relaxation-dispersion MAS NMR. ChemPhysChem. 2019;20(2):276-284. doi:10.1002/cphc.201800935","ista":"Marion D, Gauto DF, Ayala I, Giandoreggio-Barranco K, Schanda P. 2019. Microsecond protein dynamics from combined Bloch-McConnell and Near-Rotary-Resonance R1p relaxation-dispersion MAS NMR. ChemPhysChem. 20(2), 276–284.","ieee":"D. Marion, D. F. Gauto, I. Ayala, K. Giandoreggio-Barranco, and P. Schanda, “Microsecond protein dynamics from combined Bloch-McConnell and Near-Rotary-Resonance R1p relaxation-dispersion MAS NMR,” ChemPhysChem, vol. 20, no. 2. Wiley, pp. 276–284, 2019.","apa":"Marion, D., Gauto, D. F., Ayala, I., Giandoreggio-Barranco, K., & Schanda, P. (2019). Microsecond protein dynamics from combined Bloch-McConnell and Near-Rotary-Resonance R1p relaxation-dispersion MAS NMR. ChemPhysChem. Wiley. https://doi.org/10.1002/cphc.201800935","mla":"Marion, Dominique, et al. “Microsecond Protein Dynamics from Combined Bloch-McConnell and Near-Rotary-Resonance R1p Relaxation-Dispersion MAS NMR.” ChemPhysChem, vol. 20, no. 2, Wiley, 2019, pp. 276–84, doi:10.1002/cphc.201800935.","short":"D. Marion, D.F. Gauto, I. Ayala, K. Giandoreggio-Barranco, P. Schanda, ChemPhysChem 20 (2019) 276–284.","chicago":"Marion, Dominique, Diego F. Gauto, Isabel Ayala, Karine Giandoreggio-Barranco, and Paul Schanda. “Microsecond Protein Dynamics from Combined Bloch-McConnell and Near-Rotary-Resonance R1p Relaxation-Dispersion MAS NMR.” ChemPhysChem. Wiley, 2019. https://doi.org/10.1002/cphc.201800935."},"publication":"ChemPhysChem","date_published":"2019-01-21T00:00:00Z","extern":"1","publisher":"Wiley","publication_status":"published","pmid":1,"year":"2019","volume":20,"date_created":"2020-09-17T10:29:36Z","date_updated":"2021-01-12T08:19:06Z","author":[{"last_name":"Marion","first_name":"Dominique","full_name":"Marion, Dominique"},{"full_name":"Gauto, Diego F.","first_name":"Diego F.","last_name":"Gauto"},{"last_name":"Ayala","first_name":"Isabel","full_name":"Ayala, Isabel"},{"full_name":"Giandoreggio-Barranco, Karine","first_name":"Karine","last_name":"Giandoreggio-Barranco"},{"full_name":"Schanda, Paul","last_name":"Schanda","first_name":"Paul","orcid":"0000-0002-9350-7606","id":"7B541462-FAF6-11E9-A490-E8DFE5697425"}],"publication_identifier":{"issn":["1439-4235"]},"month":"01","quality_controlled":"1","external_id":{"pmid":["30444575"]},"language":[{"iso":"eng"}],"doi":"10.1002/cphc.201800935"},{"language":[{"iso":"eng"}],"doi":"10.1007/s00220-019-03448-x","quality_controlled":"1","oa":1,"external_id":{"arxiv":["1809.08947"]},"main_file_link":[{"url":"https://arxiv.org/abs/1809.08947","open_access":"1"}],"month":"05","publication_identifier":{"issn":["0010-3616","1432-0916"]},"date_created":"2020-09-17T10:41:27Z","date_updated":"2021-01-12T08:19:08Z","volume":374,"author":[{"full_name":"Bálint, Péter","first_name":"Péter","last_name":"Bálint"},{"full_name":"De Simoi, Jacopo","last_name":"De Simoi","first_name":"Jacopo"},{"last_name":"Kaloshin","first_name":"Vadim","orcid":"0000-0002-6051-2628","id":"FE553552-CDE8-11E9-B324-C0EBE5697425","full_name":"Kaloshin, Vadim"},{"last_name":"Leguil","first_name":"Martin","full_name":"Leguil, Martin"}],"publication_status":"published","publisher":"Springer Nature","year":"2019","extern":"1","date_published":"2019-05-09T00:00:00Z","article_type":"original","page":"1531-1575","publication":"Communications in Mathematical Physics","citation":{"ama":"Bálint P, De Simoi J, Kaloshin V, Leguil M. Marked length spectrum, homoclinic orbits and the geometry of open dispersing billiards. Communications in Mathematical Physics. 2019;374(3):1531-1575. doi:10.1007/s00220-019-03448-x","ieee":"P. Bálint, J. De Simoi, V. Kaloshin, and M. Leguil, “Marked length spectrum, homoclinic orbits and the geometry of open dispersing billiards,” Communications in Mathematical Physics, vol. 374, no. 3. Springer Nature, pp. 1531–1575, 2019.","apa":"Bálint, P., De Simoi, J., Kaloshin, V., & Leguil, M. (2019). Marked length spectrum, homoclinic orbits and the geometry of open dispersing billiards. Communications in Mathematical Physics. Springer Nature. https://doi.org/10.1007/s00220-019-03448-x","ista":"Bálint P, De Simoi J, Kaloshin V, Leguil M. 2019. Marked length spectrum, homoclinic orbits and the geometry of open dispersing billiards. Communications in Mathematical Physics. 374(3), 1531–1575.","short":"P. Bálint, J. De Simoi, V. Kaloshin, M. Leguil, Communications in Mathematical Physics 374 (2019) 1531–1575.","mla":"Bálint, Péter, et al. “Marked Length Spectrum, Homoclinic Orbits and the Geometry of Open Dispersing Billiards.” Communications in Mathematical Physics, vol. 374, no. 3, Springer Nature, 2019, pp. 1531–75, doi:10.1007/s00220-019-03448-x.","chicago":"Bálint, Péter, Jacopo De Simoi, Vadim Kaloshin, and Martin Leguil. “Marked Length Spectrum, Homoclinic Orbits and the Geometry of Open Dispersing Billiards.” Communications in Mathematical Physics. Springer Nature, 2019. https://doi.org/10.1007/s00220-019-03448-x."},"day":"09","article_processing_charge":"No","keyword":["Mathematical Physics","Statistical and Nonlinear Physics"],"oa_version":"Preprint","status":"public","title":"Marked length spectrum, homoclinic orbits and the geometry of open dispersing billiards","intvolume":" 374","_id":"8415","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"We consider billiards obtained by removing three strictly convex obstacles satisfying the non-eclipse condition on the plane. The restriction of the dynamics to the set of non-escaping orbits is conjugated to a subshift on three symbols that provides a natural labeling of all periodic orbits. We study the following inverse problem: does the Marked Length Spectrum (i.e., the set of lengths of periodic orbits together with their labeling), determine the geometry of the billiard table? We show that from the Marked Length Spectrum it is possible to recover the curvature at periodic points of period two, as well as the Lyapunov exponent of each periodic orbit.","lang":"eng"}],"issue":"3","type":"journal_article"},{"type":"journal_article","issue":"1","abstract":[{"text":"The bacterial cell wall is composed of the peptidoglycan (PG), a large polymer that maintains the integrity of the bacterial cell. Due to its multi-gigadalton size, heterogeneity, and dynamics, atomic-resolution studies are inherently complex. Solid-state NMR is an important technique to gain insight into its structure, dynamics and interactions. Here, we explore the possibilities to study the PG with ultra-fast (100 kHz) magic-angle spinning NMR. We demonstrate that highly resolved spectra can be obtained, and show strategies to obtain site-specific resonance assignments and distance information. We also explore the use of proton-proton correlation experiments, thus opening the way for NMR studies of intact cell walls without the need for isotope labeling.","lang":"eng"}],"intvolume":" 206","status":"public","title":"Studying intact bacterial peptidoglycan by proton-detected NMR spectroscopy at 100 kHz MAS frequency","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"8409","oa_version":"Submitted Version","keyword":["Structural Biology"],"article_processing_charge":"No","day":"01","page":"66-72","article_type":"original","citation":{"chicago":"Bougault, Catherine, Isabel Ayala, Waldemar Vollmer, Jean-Pierre Simorre, and Paul Schanda. “Studying Intact Bacterial Peptidoglycan by Proton-Detected NMR Spectroscopy at 100 kHz MAS Frequency.” Journal of Structural Biology. Elsevier, 2019. https://doi.org/10.1016/j.jsb.2018.07.009.","mla":"Bougault, Catherine, et al. “Studying Intact Bacterial Peptidoglycan by Proton-Detected NMR Spectroscopy at 100 kHz MAS Frequency.” Journal of Structural Biology, vol. 206, no. 1, Elsevier, 2019, pp. 66–72, doi:10.1016/j.jsb.2018.07.009.","short":"C. Bougault, I. Ayala, W. Vollmer, J.-P. Simorre, P. Schanda, Journal of Structural Biology 206 (2019) 66–72.","ista":"Bougault C, Ayala I, Vollmer W, Simorre J-P, Schanda P. 2019. Studying intact bacterial peptidoglycan by proton-detected NMR spectroscopy at 100 kHz MAS frequency. Journal of Structural Biology. 206(1), 66–72.","ieee":"C. Bougault, I. Ayala, W. Vollmer, J.-P. Simorre, and P. Schanda, “Studying intact bacterial peptidoglycan by proton-detected NMR spectroscopy at 100 kHz MAS frequency,” Journal of Structural Biology, vol. 206, no. 1. Elsevier, pp. 66–72, 2019.","apa":"Bougault, C., Ayala, I., Vollmer, W., Simorre, J.-P., & Schanda, P. (2019). Studying intact bacterial peptidoglycan by proton-detected NMR spectroscopy at 100 kHz MAS frequency. Journal of Structural Biology. Elsevier. https://doi.org/10.1016/j.jsb.2018.07.009","ama":"Bougault C, Ayala I, Vollmer W, Simorre J-P, Schanda P. Studying intact bacterial peptidoglycan by proton-detected NMR spectroscopy at 100 kHz MAS frequency. Journal of Structural Biology. 2019;206(1):66-72. doi:10.1016/j.jsb.2018.07.009"},"publication":"Journal of Structural Biology","date_published":"2019-04-01T00:00:00Z","extern":"1","publisher":"Elsevier","publication_status":"published","pmid":1,"year":"2019","volume":206,"date_updated":"2021-01-12T08:19:05Z","date_created":"2020-09-17T10:29:10Z","author":[{"first_name":"Catherine","last_name":"Bougault","full_name":"Bougault, Catherine"},{"full_name":"Ayala, Isabel","first_name":"Isabel","last_name":"Ayala"},{"first_name":"Waldemar","last_name":"Vollmer","full_name":"Vollmer, Waldemar"},{"full_name":"Simorre, Jean-Pierre","first_name":"Jean-Pierre","last_name":"Simorre"},{"last_name":"Schanda","first_name":"Paul","orcid":"0000-0002-9350-7606","id":"7B541462-FAF6-11E9-A490-E8DFE5697425","full_name":"Schanda, Paul"}],"publication_identifier":{"issn":["1047-8477"]},"month":"04","quality_controlled":"1","external_id":{"pmid":["30031884"]},"language":[{"iso":"eng"}],"doi":"10.1016/j.jsb.2018.07.009"},{"date_published":"2019-09-01T00:00:00Z","doi":"10.1016/j.jmr.2019.07.025","language":[{"iso":"eng"}],"publication":"Journal of Magnetic Resonance","citation":{"ieee":"P. Schanda, “Relaxing with liquids and solids – A perspective on biomolecular dynamics,” Journal of Magnetic Resonance, vol. 306. Elsevier, pp. 180–186, 2019.","apa":"Schanda, P. (2019). Relaxing with liquids and solids – A perspective on biomolecular dynamics. Journal of Magnetic Resonance. Elsevier. https://doi.org/10.1016/j.jmr.2019.07.025","ista":"Schanda P. 2019. Relaxing with liquids and solids – A perspective on biomolecular dynamics. Journal of Magnetic Resonance. 306, 180–186.","ama":"Schanda P. Relaxing with liquids and solids – A perspective on biomolecular dynamics. Journal of Magnetic Resonance. 2019;306:180-186. doi:10.1016/j.jmr.2019.07.025","chicago":"Schanda, Paul. “Relaxing with Liquids and Solids – A Perspective on Biomolecular Dynamics.” Journal of Magnetic Resonance. Elsevier, 2019. https://doi.org/10.1016/j.jmr.2019.07.025.","short":"P. Schanda, Journal of Magnetic Resonance 306 (2019) 180–186.","mla":"Schanda, Paul. “Relaxing with Liquids and Solids – A Perspective on Biomolecular Dynamics.” Journal of Magnetic Resonance, vol. 306, Elsevier, 2019, pp. 180–86, doi:10.1016/j.jmr.2019.07.025."},"external_id":{"pmid":["31350165"]},"article_type":"original","quality_controlled":"1","page":"180-186","month":"09","day":"01","publication_identifier":{"issn":["1090-7807"]},"article_processing_charge":"No","keyword":["Nuclear and High Energy Physics","Biophysics","Biochemistry","Condensed Matter Physics"],"author":[{"full_name":"Schanda, Paul","id":"7B541462-FAF6-11E9-A490-E8DFE5697425","orcid":"0000-0002-9350-7606","first_name":"Paul","last_name":"Schanda"}],"date_created":"2020-09-17T10:28:47Z","date_updated":"2021-01-12T08:19:04Z","volume":306,"oa_version":"Submitted Version","year":"2019","_id":"8407","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","pmid":1,"title":"Relaxing with liquids and solids – A perspective on biomolecular dynamics","status":"public","publication_status":"published","intvolume":" 306","publisher":"Elsevier","extern":"1","type":"journal_article"},{"date_updated":"2021-01-12T08:19:05Z","date_created":"2020-09-17T10:29:26Z","volume":20,"author":[{"full_name":"Schanda, Paul","first_name":"Paul","last_name":"Schanda","id":"7B541462-FAF6-11E9-A490-E8DFE5697425","orcid":"0000-0002-9350-7606"},{"full_name":"Chekmenev, Eduard Y.","first_name":"Eduard Y.","last_name":"Chekmenev"}],"publication_status":"published","publisher":"Wiley","year":"2019","pmid":1,"extern":"1","language":[{"iso":"eng"}],"doi":"10.1002/cphc.201801100","quality_controlled":"1","oa":1,"external_id":{"pmid":["30556633"]},"main_file_link":[{"url":"https://doi.org/10.1002/cphc.201801100","open_access":"1"}],"month":"01","publication_identifier":{"issn":["1439-4235"]},"oa_version":"Published Version","title":"NMR for Biological Systems","status":"public","intvolume":" 20","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"8410","issue":"2","type":"journal_article","date_published":"2019-01-21T00:00:00Z","article_type":"letter_note","page":"177-177","publication":"ChemPhysChem","citation":{"ista":"Schanda P, Chekmenev EY. 2019. NMR for Biological Systems. ChemPhysChem. 20(2), 177–177.","apa":"Schanda, P., & Chekmenev, E. Y. (2019). NMR for Biological Systems. ChemPhysChem. Wiley. https://doi.org/10.1002/cphc.201801100","ieee":"P. Schanda and E. Y. Chekmenev, “NMR for Biological Systems,” ChemPhysChem, vol. 20, no. 2. Wiley, pp. 177–177, 2019.","ama":"Schanda P, Chekmenev EY. NMR for Biological Systems. ChemPhysChem. 2019;20(2):177-177. doi:10.1002/cphc.201801100","chicago":"Schanda, Paul, and Eduard Y. Chekmenev. “NMR for Biological Systems.” ChemPhysChem. Wiley, 2019. https://doi.org/10.1002/cphc.201801100.","mla":"Schanda, Paul, and Eduard Y. Chekmenev. “NMR for Biological Systems.” ChemPhysChem, vol. 20, no. 2, Wiley, 2019, pp. 177–177, doi:10.1002/cphc.201801100.","short":"P. Schanda, E.Y. Chekmenev, ChemPhysChem 20 (2019) 177–177."},"day":"21","article_processing_charge":"No"},{"author":[{"last_name":"Althoff","first_name":"Matthias","full_name":"Althoff, Matthias"},{"full_name":"Bak, Stanley","first_name":"Stanley","last_name":"Bak"},{"full_name":"Forets, Marcelo","first_name":"Marcelo","last_name":"Forets"},{"full_name":"Frehse, Goran","last_name":"Frehse","first_name":"Goran"},{"full_name":"Kochdumper, Niklas","last_name":"Kochdumper","first_name":"Niklas"},{"full_name":"Ray, Rajarshi","last_name":"Ray","first_name":"Rajarshi"},{"full_name":"Schilling, Christian","first_name":"Christian","last_name":"Schilling","id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3658-1065"},{"last_name":"Schupp","first_name":"Stefan","full_name":"Schupp, Stefan"}],"oa_version":"Published Version","volume":61,"date_updated":"2021-01-12T08:20:05Z","date_created":"2020-09-26T14:23:54Z","_id":"8570","year":"2019","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 61","department":[{"_id":"ToHe"}],"publisher":"EasyChair","publication_status":"published","title":"ARCH-COMP19 Category Report: Continuous and hybrid systems with linear continuous dynamics","status":"public","abstract":[{"lang":"eng","text":"This report presents the results of a friendly competition for formal verification of continuous and hybrid systems with linear continuous dynamics. The friendly competition took place as part of the workshop Applied Verification for Continuous and Hybrid Systems (ARCH) in 2019. In its third edition, seven tools have been applied to solve six different benchmark problems in the category for linear continuous dynamics (in alphabetical order): CORA, CORA/SX, HyDRA, Hylaa, JuliaReach, SpaceEx, and XSpeed. This report is a snapshot of the current landscape of tools and the types of benchmarks they are particularly suited for. Due to the diversity of problems, we are not ranking tools, yet the presented results provide one of the most complete assessments of tools for the safety verification of continuous and hybrid systems with linear continuous dynamics up to this date."}],"type":"conference","doi":"10.29007/bj1w","date_published":"2019-05-25T00:00:00Z","conference":{"end_date":"2019-04-15","location":"Montreal, Canada","start_date":"2019-04-15","name":"ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems"},"language":[{"iso":"eng"}],"citation":{"chicago":"Althoff, Matthias, Stanley Bak, Marcelo Forets, Goran Frehse, Niklas Kochdumper, Rajarshi Ray, Christian Schilling, and Stefan Schupp. “ARCH-COMP19 Category Report: Continuous and Hybrid Systems with Linear Continuous Dynamics.” In EPiC Series in Computing, 61:14–40. EasyChair, 2019. https://doi.org/10.29007/bj1w.","mla":"Althoff, Matthias, et al. “ARCH-COMP19 Category Report: Continuous and Hybrid Systems with Linear Continuous Dynamics.” EPiC Series in Computing, vol. 61, EasyChair, 2019, pp. 14–40, doi:10.29007/bj1w.","short":"M. Althoff, S. Bak, M. Forets, G. Frehse, N. Kochdumper, R. Ray, C. Schilling, S. Schupp, in:, EPiC Series in Computing, EasyChair, 2019, pp. 14–40.","ista":"Althoff M, Bak S, Forets M, Frehse G, Kochdumper N, Ray R, Schilling C, Schupp S. 2019. ARCH-COMP19 Category Report: Continuous and hybrid systems with linear continuous dynamics. EPiC Series in Computing. ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems vol. 61, 14–40.","ieee":"M. Althoff et al., “ARCH-COMP19 Category Report: Continuous and hybrid systems with linear continuous dynamics,” in EPiC Series in Computing, Montreal, Canada, 2019, vol. 61, pp. 14–40.","apa":"Althoff, M., Bak, S., Forets, M., Frehse, G., Kochdumper, N., Ray, R., … Schupp, S. (2019). ARCH-COMP19 Category Report: Continuous and hybrid systems with linear continuous dynamics. In EPiC Series in Computing (Vol. 61, pp. 14–40). Montreal, Canada: EasyChair. https://doi.org/10.29007/bj1w","ama":"Althoff M, Bak S, Forets M, et al. ARCH-COMP19 Category Report: Continuous and hybrid systems with linear continuous dynamics. In: EPiC Series in Computing. Vol 61. EasyChair; 2019:14-40. doi:10.29007/bj1w"},"main_file_link":[{"url":"https://easychair.org/publications/open/1gbP","open_access":"1"}],"oa":1,"publication":"EPiC Series in Computing","page":"14-40","quality_controlled":"1","publication_identifier":{"eissn":["23987340"]},"article_processing_charge":"No","month":"05","day":"25"},{"type":"journal_article","issue":"7","abstract":[{"lang":"eng","text":"Inhibiting the histone H3–ASF1 (anti‐silencing function 1) protein–protein interaction (PPI) represents a potential approach for treating numerous cancers. As an α‐helix‐mediated PPI, constraining the key histone H3 helix (residues 118–135) is a strategy through which chemical probes might be elaborated to test this hypothesis. In this work, variant H3118–135 peptides bearing pentenylglycine residues at the i and i+4 positions were constrained by olefin metathesis. Biophysical analyses revealed that promotion of a bioactive helical conformation depends on the position at which the constraint is introduced, but that the potency of binding towards ASF1 is unaffected by the constraint and instead that enthalpy–entropy compensation occurs."}],"intvolume":" 20","title":"Recognition of ASF1 by using hydrocarbon‐constrained peptides","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"9016","oa_version":"Published Version","article_processing_charge":"No","day":"01","page":"891-895","article_type":"original","citation":{"ista":"Bakail MM, Rodriguez‐Marin S, Hegedüs Z, Perrin ME, Ochsenbein F, Wilson AJ. 2019. Recognition of ASF1 by using hydrocarbon‐constrained peptides. ChemBioChem. 20(7), 891–895.","apa":"Bakail, M. M., Rodriguez‐Marin, S., Hegedüs, Z., Perrin, M. E., Ochsenbein, F., & Wilson, A. J. (2019). Recognition of ASF1 by using hydrocarbon‐constrained peptides. ChemBioChem. Wiley. https://doi.org/10.1002/cbic.201800633","ieee":"M. M. Bakail, S. Rodriguez‐Marin, Z. Hegedüs, M. E. Perrin, F. Ochsenbein, and A. J. Wilson, “Recognition of ASF1 by using hydrocarbon‐constrained peptides,” ChemBioChem, vol. 20, no. 7. Wiley, pp. 891–895, 2019.","ama":"Bakail MM, Rodriguez‐Marin S, Hegedüs Z, Perrin ME, Ochsenbein F, Wilson AJ. Recognition of ASF1 by using hydrocarbon‐constrained peptides. ChemBioChem. 2019;20(7):891-895. doi:10.1002/cbic.201800633","chicago":"Bakail, May M, Silvia Rodriguez‐Marin, Zsófia Hegedüs, Marie E. Perrin, Françoise Ochsenbein, and Andrew J. Wilson. “Recognition of ASF1 by Using Hydrocarbon‐constrained Peptides.” ChemBioChem. Wiley, 2019. https://doi.org/10.1002/cbic.201800633.","mla":"Bakail, May M., et al. “Recognition of ASF1 by Using Hydrocarbon‐constrained Peptides.” ChemBioChem, vol. 20, no. 7, Wiley, 2019, pp. 891–95, doi:10.1002/cbic.201800633.","short":"M.M. Bakail, S. Rodriguez‐Marin, Z. Hegedüs, M.E. Perrin, F. Ochsenbein, A.J. Wilson, ChemBioChem 20 (2019) 891–895."},"publication":"ChemBioChem","date_published":"2019-04-01T00:00:00Z","extern":"1","publisher":"Wiley","publication_status":"published","year":"2019","volume":20,"date_updated":"2023-02-23T13:46:48Z","date_created":"2021-01-19T10:59:14Z","author":[{"first_name":"May M","last_name":"Bakail","id":"FB3C3F8E-522F-11EA-B186-22963DDC885E","orcid":"0000-0002-9592-1587","full_name":"Bakail, May M"},{"first_name":"Silvia","last_name":"Rodriguez‐Marin","full_name":"Rodriguez‐Marin, Silvia"},{"full_name":"Hegedüs, Zsófia","first_name":"Zsófia","last_name":"Hegedüs"},{"full_name":"Perrin, Marie E.","first_name":"Marie E.","last_name":"Perrin"},{"first_name":"Françoise","last_name":"Ochsenbein","full_name":"Ochsenbein, Françoise"},{"last_name":"Wilson","first_name":"Andrew J.","full_name":"Wilson, Andrew J."}],"publication_identifier":{"issn":["1439-4227","1439-7633"]},"month":"04","quality_controlled":"1","main_file_link":[{"open_access":"1","url":" https://doi.org/10.1002/cbic.201800633"}],"oa":1,"language":[{"iso":"eng"}],"doi":"10.1002/cbic.201800633"},{"month":"07","publication_identifier":{"issn":["2041-1723"]},"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":["1909.07382"],"pmid":["31358762"]},"oa":1,"quality_controlled":"1","doi":"10.1038/s41467-019-11362-y","language":[{"iso":"eng"}],"article_number":"3380","file_date_updated":"2021-02-02T13:47:21Z","extern":"1","year":"2019","pmid":1,"publication_status":"published","publisher":"Springer Nature","author":[{"first_name":"Sophie","last_name":"Ramananarivo","full_name":"Ramananarivo, Sophie"},{"full_name":"Ducrot, Etienne","last_name":"Ducrot","first_name":"Etienne"},{"full_name":"Palacci, Jérémie A","last_name":"Palacci","first_name":"Jérémie A","orcid":"0000-0002-7253-9465","id":"8fb92548-2b22-11eb-b7c1-a3f0d08d7c7d"}],"date_updated":"2023-02-23T13:47:59Z","date_created":"2021-02-02T13:43:36Z","volume":10,"scopus_import":"1","keyword":["General Biochemistry","Genetics and Molecular Biology","General Physics and Astronomy","General Chemistry"],"day":"29","article_processing_charge":"No","has_accepted_license":"1","publication":"Nature Communications","citation":{"chicago":"Ramananarivo, Sophie, Etienne Ducrot, and Jérémie A Palacci. “Activity-Controlled Annealing of Colloidal Monolayers.” Nature Communications. Springer Nature, 2019. https://doi.org/10.1038/s41467-019-11362-y.","short":"S. Ramananarivo, E. Ducrot, J.A. Palacci, Nature Communications 10 (2019).","mla":"Ramananarivo, Sophie, et al. “Activity-Controlled Annealing of Colloidal Monolayers.” Nature Communications, vol. 10, no. 1, 3380, Springer Nature, 2019, doi:10.1038/s41467-019-11362-y.","ieee":"S. Ramananarivo, E. Ducrot, and J. A. Palacci, “Activity-controlled annealing of colloidal monolayers,” Nature Communications, vol. 10, no. 1. Springer Nature, 2019.","apa":"Ramananarivo, S., Ducrot, E., & Palacci, J. A. (2019). Activity-controlled annealing of colloidal monolayers. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-019-11362-y","ista":"Ramananarivo S, Ducrot E, Palacci JA. 2019. Activity-controlled annealing of colloidal monolayers. Nature Communications. 10(1), 3380.","ama":"Ramananarivo S, Ducrot E, Palacci JA. Activity-controlled annealing of colloidal monolayers. Nature Communications. 2019;10(1). doi:10.1038/s41467-019-11362-y"},"article_type":"original","date_published":"2019-07-29T00:00:00Z","type":"journal_article","abstract":[{"lang":"eng","text":"Molecular motors are essential to the living, generating fluctuations that boost transport and assist assembly. Active colloids, that consume energy to move, hold similar potential for man-made materials controlled by forces generated from within. Yet, their use as a powerhouse in materials science lacks. Here we show a massive acceleration of the annealing of a monolayer of passive beads by moderate addition of self-propelled microparticles. We rationalize our observations with a model of collisions that drive active fluctuations and activate the annealing. The experiment is quantitatively compared with Brownian dynamic simulations that further unveil a dynamical transition in the mechanism of annealing. Active dopants travel uniformly in the system or co-localize at the grain boundaries as a result of the persistence of their motion. Our findings uncover the potential of internal activity to control materials and lay the groundwork for the rise of materials science beyond equilibrium."}],"issue":"1","user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425","_id":"9060","ddc":["530"],"status":"public","title":"Activity-controlled annealing of colloidal monolayers","intvolume":" 10","file":[{"creator":"cziletti","content_type":"application/pdf","file_size":2820337,"access_level":"open_access","file_name":"2019_NatureComm_Ramananarivo.pdf","success":1,"checksum":"70c6e5d6fbea0932b0669505ab6633ec","date_created":"2021-02-02T13:47:21Z","date_updated":"2021-02-02T13:47:21Z","file_id":"9061","relation":"main_file"}],"oa_version":"Published Version"},{"language":[{"iso":"eng"}],"doi":"10.1073/pnas.1821435116","quality_controlled":"1","tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png"},"oa":1,"external_id":{"pmid":["31000601"]},"month":"05","publication_identifier":{"eissn":["1091-6490"],"issn":["0027-8424"]},"date_updated":"2021-12-14T07:52:30Z","date_created":"2021-06-04T12:38:20Z","volume":116,"author":[{"full_name":"Kim, M. Yvonne","first_name":"M. Yvonne","last_name":"Kim"},{"first_name":"Akemi","last_name":"Ono","full_name":"Ono, Akemi"},{"last_name":"Scholten","first_name":"Stefan","full_name":"Scholten, Stefan"},{"first_name":"Tetsu","last_name":"Kinoshita","full_name":"Kinoshita, Tetsu"},{"full_name":"Zilberman, Daniel","id":"6973db13-dd5f-11ea-814e-b3e5455e9ed1","orcid":"0000-0002-0123-8649","first_name":"Daniel","last_name":"Zilberman"},{"first_name":"Takashi","last_name":"Okamoto","full_name":"Okamoto, Takashi"},{"full_name":"Fischer, Robert L.","last_name":"Fischer","first_name":"Robert L."}],"publication_status":"published","publisher":"National Academy of Sciences","department":[{"_id":"DaZi"}],"year":"2019","pmid":1,"extern":"1","file_date_updated":"2021-06-04T12:50:47Z","date_published":"2019-05-07T00:00:00Z","article_type":"original","page":"9652-9657","publication":"Proceedings of the National Academy of Sciences","citation":{"short":"M.Y. Kim, A. Ono, S. Scholten, T. Kinoshita, D. Zilberman, T. Okamoto, R.L. Fischer, Proceedings of the National Academy of Sciences 116 (2019) 9652–9657.","mla":"Kim, M. Yvonne, et al. “DNA Demethylation by ROS1a in Rice Vegetative Cells Promotes Methylation in Sperm.” Proceedings of the National Academy of Sciences, vol. 116, no. 19, National Academy of Sciences, 2019, pp. 9652–57, doi:10.1073/pnas.1821435116.","chicago":"Kim, M. Yvonne, Akemi Ono, Stefan Scholten, Tetsu Kinoshita, Daniel Zilberman, Takashi Okamoto, and Robert L. Fischer. “DNA Demethylation by ROS1a in Rice Vegetative Cells Promotes Methylation in Sperm.” Proceedings of the National Academy of Sciences. National Academy of Sciences, 2019. https://doi.org/10.1073/pnas.1821435116.","ama":"Kim MY, Ono A, Scholten S, et al. DNA demethylation by ROS1a in rice vegetative cells promotes methylation in sperm. Proceedings of the National Academy of Sciences. 2019;116(19):9652-9657. doi:10.1073/pnas.1821435116","apa":"Kim, M. Y., Ono, A., Scholten, S., Kinoshita, T., Zilberman, D., Okamoto, T., & Fischer, R. L. (2019). DNA demethylation by ROS1a in rice vegetative cells promotes methylation in sperm. Proceedings of the National Academy of Sciences. National Academy of Sciences. https://doi.org/10.1073/pnas.1821435116","ieee":"M. Y. Kim et al., “DNA demethylation by ROS1a in rice vegetative cells promotes methylation in sperm,” Proceedings of the National Academy of Sciences, vol. 116, no. 19. National Academy of Sciences, pp. 9652–9657, 2019.","ista":"Kim MY, Ono A, Scholten S, Kinoshita T, Zilberman D, Okamoto T, Fischer RL. 2019. DNA demethylation by ROS1a in rice vegetative cells promotes methylation in sperm. Proceedings of the National Academy of Sciences. 116(19), 9652–9657."},"day":"07","has_accepted_license":"1","article_processing_charge":"No","keyword":["Multidisciplinary"],"scopus_import":"1","oa_version":"Published Version","file":[{"file_id":"9461","relation":"main_file","date_updated":"2021-06-04T12:50:47Z","date_created":"2021-06-04T12:50:47Z","success":1,"checksum":"5b0ae3779b8b21b5223bd2d3cceede3a","file_name":"2019_PNAS_Kim.pdf","access_level":"open_access","creator":"asandaue","file_size":1142540,"content_type":"application/pdf"}],"ddc":["580"],"title":"DNA demethylation by ROS1a in rice vegetative cells promotes methylation in sperm","status":"public","intvolume":" 116","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","_id":"9460","abstract":[{"text":"Epigenetic reprogramming is required for proper regulation of gene expression in eukaryotic organisms. In Arabidopsis, active DNA demethylation is crucial for seed viability, pollen function, and successful reproduction. The DEMETER (DME) DNA glycosylase initiates localized DNA demethylation in vegetative and central cells, so-called companion cells that are adjacent to sperm and egg gametes, respectively. In rice, the central cell genome displays local DNA hypomethylation, suggesting that active DNA demethylation also occurs in rice; however, the enzyme responsible for this process is unknown. One candidate is the rice REPRESSOR OF SILENCING 1a (ROS1a) gene, which is related to DME and is essential for rice seed viability and pollen function. Here, we report genome-wide analyses of DNA methylation in wild-type and ros1a mutant sperm and vegetative cells. We find that the rice vegetative cell genome is locally hypomethylated compared with sperm by a process that requires ROS1a activity. We show that many ROS1a target sequences in the vegetative cell are hypomethylated in the rice central cell, suggesting that ROS1a also demethylates the central cell genome. Similar to Arabidopsis, we show that sperm non-CG methylation is indirectly promoted by DNA demethylation in the vegetative cell. These results reveal that DNA glycosylase-mediated DNA demethylation processes are conserved in Arabidopsis and rice, plant species that diverged 150 million years ago. Finally, although global non-CG methylation levels of sperm and egg differ, the maternal and paternal embryo genomes show similar non-CG methylation levels, suggesting that rice gamete genomes undergo dynamic DNA methylation reprogramming after cell fusion.","lang":"eng"}],"issue":"19","type":"journal_article"},{"oa_version":"Published Version","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","_id":"9689","status":"public","title":"Ab initio thermodynamics of liquid and solid water","intvolume":" 116","abstract":[{"text":"A central goal of computational physics and chemistry is to predict material properties by using first-principles methods based on the fundamental laws of quantum mechanics. However, the high computational costs of these methods typically prevent rigorous predictions of macroscopic quantities at finite temperatures, such as heat capacity, density, and chemical potential. Here, we enable such predictions by marrying advanced free-energy methods with data-driven machine-learning interatomic potentials. We show that, for the ubiquitous and technologically essential system of water, a first-principles thermodynamic description not only leads to excellent agreement with experiments, but also reveals the crucial role of nuclear quantum fluctuations in modulating the thermodynamic stabilities of different phases of water.","lang":"eng"}],"issue":"4","type":"journal_article","date_published":"2019-01-22T00:00:00Z","publication":"Proceedings of the National Academy of Sciences","citation":{"apa":"Cheng, B., Engel, E. A., Behler, J., Dellago, C., & Ceriotti, M. (2019). Ab initio thermodynamics of liquid and solid water. Proceedings of the National Academy of Sciences. National Academy of Sciences. https://doi.org/10.1073/pnas.1815117116","ieee":"B. Cheng, E. A. Engel, J. Behler, C. Dellago, and M. Ceriotti, “Ab initio thermodynamics of liquid and solid water,” Proceedings of the National Academy of Sciences, vol. 116, no. 4. National Academy of Sciences, pp. 1110–1115, 2019.","ista":"Cheng B, Engel EA, Behler J, Dellago C, Ceriotti M. 2019. Ab initio thermodynamics of liquid and solid water. Proceedings of the National Academy of Sciences. 116(4), 1110–1115.","ama":"Cheng B, Engel EA, Behler J, Dellago C, Ceriotti M. Ab initio thermodynamics of liquid and solid water. Proceedings of the National Academy of Sciences. 2019;116(4):1110-1115. doi:10.1073/pnas.1815117116","chicago":"Cheng, Bingqing, Edgar A. Engel, Jörg Behler, Christoph Dellago, and Michele Ceriotti. “Ab Initio Thermodynamics of Liquid and Solid Water.” Proceedings of the National Academy of Sciences. National Academy of Sciences, 2019. https://doi.org/10.1073/pnas.1815117116.","short":"B. Cheng, E.A. Engel, J. Behler, C. Dellago, M. Ceriotti, Proceedings of the National Academy of Sciences 116 (2019) 1110–1115.","mla":"Cheng, Bingqing, et al. “Ab Initio Thermodynamics of Liquid and Solid Water.” Proceedings of the National Academy of Sciences, vol. 116, no. 4, National Academy of Sciences, 2019, pp. 1110–15, doi:10.1073/pnas.1815117116."},"article_type":"original","page":"1110-1115","day":"22","article_processing_charge":"No","scopus_import":"1","author":[{"last_name":"Cheng","first_name":"Bingqing","orcid":"0000-0002-3584-9632","id":"cbe3cda4-d82c-11eb-8dc7-8ff94289fcc9","full_name":"Cheng, Bingqing"},{"first_name":"Edgar A.","last_name":"Engel","full_name":"Engel, Edgar A."},{"first_name":"Jörg","last_name":"Behler","full_name":"Behler, Jörg"},{"first_name":"Christoph","last_name":"Dellago","full_name":"Dellago, Christoph"},{"last_name":"Ceriotti","first_name":"Michele","full_name":"Ceriotti, Michele"}],"date_updated":"2023-02-23T14:05:08Z","date_created":"2021-07-19T10:17:09Z","volume":116,"year":"2019","pmid":1,"publication_status":"published","publisher":"National Academy of Sciences","extern":"1","doi":"10.1073/pnas.1815117116","language":[{"iso":"eng"}],"oa":1,"external_id":{"pmid":["30610171"],"arxiv":["1811.08630"]},"main_file_link":[{"url":"https://doi.org/10.1073/pnas.1815117116","open_access":"1"}],"quality_controlled":"1","month":"01","publication_identifier":{"issn":["0027-8424"],"eissn":["1091-6490"]}},{"scopus_import":1,"has_accepted_license":"1","article_processing_charge":"No","day":"08","citation":{"ama":"Antoniou MN, Nicolas A, Mesnage R, Biserni M, Rao FV, Martin CV. Glyphosate does not substitute for glycine in proteins of actively dividing mammalian cells. BMC Research Notes. 2019;12. doi:10.1186/s13104-019-4534-3","ista":"Antoniou MN, Nicolas A, Mesnage R, Biserni M, Rao FV, Martin CV. 2019. Glyphosate does not substitute for glycine in proteins of actively dividing mammalian cells. BMC Research Notes. 12, 494.","apa":"Antoniou, M. N., Nicolas, A., Mesnage, R., Biserni, M., Rao, F. V., & Martin, C. V. (2019). Glyphosate does not substitute for glycine in proteins of actively dividing mammalian cells. BMC Research Notes. BioMed Central. https://doi.org/10.1186/s13104-019-4534-3","ieee":"M. N. Antoniou, A. Nicolas, R. Mesnage, M. Biserni, F. V. Rao, and C. V. Martin, “Glyphosate does not substitute for glycine in proteins of actively dividing mammalian cells,” BMC Research Notes, vol. 12. BioMed Central, 2019.","mla":"Antoniou, Michael N., et al. “Glyphosate Does Not Substitute for Glycine in Proteins of Actively Dividing Mammalian Cells.” BMC Research Notes, vol. 12, 494, BioMed Central, 2019, doi:10.1186/s13104-019-4534-3.","short":"M.N. Antoniou, A. Nicolas, R. Mesnage, M. Biserni, F.V. Rao, C.V. Martin, BMC Research Notes 12 (2019).","chicago":"Antoniou, Michael N., Armel Nicolas, Robin Mesnage, Martina Biserni, Francesco V. Rao, and Cristina Vazquez Martin. “Glyphosate Does Not Substitute for Glycine in Proteins of Actively Dividing Mammalian Cells.” BMC Research Notes. BioMed Central, 2019. https://doi.org/10.1186/s13104-019-4534-3."},"publication":"BMC Research Notes","date_published":"2019-08-08T00:00:00Z","type":"journal_article","abstract":[{"text":"Glyphosate (N-phosphonomethyl glycine) and its commercial herbicide formulations have been shown to exert toxicity via various mechanisms. It has been asserted that glyphosate substitutes for glycine in polypeptide chains leading to protein misfolding and toxicity. However, as no direct evidence exists for glycine to glyphosate substitution in proteins, including in mammalian organisms, we tested this claim by conducting a proteomics analysis of MDA-MB-231 human breast cancer cells grown in the presence of 100 mg/L glyphosate for 6 days. Protein extracts from three treated and three untreated cell cultures were analysed as one TMT-6plex labelled sample, to highlight a specific pattern (+/+/+/−/−/−) of reporter intensities for peptides bearing true glyphosate treatment induced-post translational modifications as well as allowing an investigation of the total proteome.","lang":"eng"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"6819","intvolume":" 12","ddc":["570"],"title":"Glyphosate does not substitute for glycine in proteins of actively dividing mammalian cells","status":"public","oa_version":"Published Version","file":[{"file_id":"6829","relation":"main_file","date_created":"2019-08-23T11:10:35Z","date_updated":"2020-07-14T12:47:40Z","checksum":"4a2bb7994b7f2c432bf44f5127ea3102","file_name":"2019_BMC_Antoniou.pdf","access_level":"open_access","creator":"dernst","file_size":1177482,"content_type":"application/pdf"}],"publication_identifier":{"eissn":["1756-0500"]},"month":"08","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":{"pmid":["31395095"]},"quality_controlled":"1","doi":"10.1186/s13104-019-4534-3","language":[{"iso":"eng"}],"article_number":"494","file_date_updated":"2020-07-14T12:47:40Z","pmid":1,"year":"2019","department":[{"_id":"LifeSc"}],"publisher":"BioMed Central","publication_status":"published","related_material":{"record":[{"id":"9784","relation":"research_data","status":"public"}]},"author":[{"first_name":"Michael N.","last_name":"Antoniou","full_name":"Antoniou, Michael N."},{"full_name":"Nicolas, Armel","first_name":"Armel","last_name":"Nicolas","id":"2A103192-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Mesnage, Robin","first_name":"Robin","last_name":"Mesnage"},{"full_name":"Biserni, Martina","last_name":"Biserni","first_name":"Martina"},{"last_name":"Rao","first_name":"Francesco V.","full_name":"Rao, Francesco V."},{"last_name":"Martin","first_name":"Cristina Vazquez","full_name":"Martin, Cristina Vazquez"}],"volume":12,"date_updated":"2023-02-23T14:08:14Z","date_created":"2019-08-18T22:00:39Z"},{"article_processing_charge":"No","day":"09","month":"08","doi":"10.6084/m9.figshare.9411761.v1","date_published":"2019-08-09T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://doi.org/10.6084/m9.figshare.9411761.v1"}],"oa":1,"citation":{"mla":"Antoniou, Michael N., et al. MOESM1 of Glyphosate Does Not Substitute for Glycine in Proteins of Actively Dividing Mammalian Cells. Springer Nature, 2019, doi:10.6084/m9.figshare.9411761.v1.","short":"M.N. Antoniou, A. Nicolas, R. Mesnage, M. Biserni, F.V. Rao, C.V. Martin, (2019).","chicago":"Antoniou, Michael N., Armel Nicolas, Robin Mesnage, Martina Biserni, Francesco V. Rao, and Cristina Vazquez Martin. “MOESM1 of Glyphosate Does Not Substitute for Glycine in Proteins of Actively Dividing Mammalian Cells.” Springer Nature, 2019. https://doi.org/10.6084/m9.figshare.9411761.v1.","ama":"Antoniou MN, Nicolas A, Mesnage R, Biserni M, Rao FV, Martin CV. MOESM1 of Glyphosate does not substitute for glycine in proteins of actively dividing mammalian cells. 2019. doi:10.6084/m9.figshare.9411761.v1","ista":"Antoniou MN, Nicolas A, Mesnage R, Biserni M, Rao FV, Martin CV. 2019. MOESM1 of Glyphosate does not substitute for glycine in proteins of actively dividing mammalian cells, Springer Nature, 10.6084/m9.figshare.9411761.v1.","apa":"Antoniou, M. N., Nicolas, A., Mesnage, R., Biserni, M., Rao, F. V., & Martin, C. V. (2019). MOESM1 of Glyphosate does not substitute for glycine in proteins of actively dividing mammalian cells. Springer Nature. https://doi.org/10.6084/m9.figshare.9411761.v1","ieee":"M. N. Antoniou, A. Nicolas, R. Mesnage, M. Biserni, F. V. Rao, and C. V. Martin, “MOESM1 of Glyphosate does not substitute for glycine in proteins of actively dividing mammalian cells.” Springer Nature, 2019."},"abstract":[{"lang":"eng","text":"Additional file 1: Table S1. Kinetics of MDA-MB-231 cell growth in either the presence or absence of 100Â mg/L glyphosate. Cell counts are given at day-1 of seeding flasks and following 6-days of continuous culture. Note: no differences in cell numbers were observed between negative control and glyphosate treated cultures."}],"type":"research_data_reference","oa_version":"Published Version","date_created":"2021-08-06T08:14:05Z","date_updated":"2023-02-23T12:52:29Z","related_material":{"record":[{"id":"6819","relation":"used_in_publication","status":"public"}]},"author":[{"first_name":"Michael N.","last_name":"Antoniou","full_name":"Antoniou, Michael N."},{"first_name":"Armel","last_name":"Nicolas","id":"2A103192-F248-11E8-B48F-1D18A9856A87","full_name":"Nicolas, Armel"},{"full_name":"Mesnage, Robin","first_name":"Robin","last_name":"Mesnage"},{"last_name":"Biserni","first_name":"Martina","full_name":"Biserni, Martina"},{"last_name":"Rao","first_name":"Francesco V.","full_name":"Rao, Francesco V."},{"full_name":"Martin, Cristina Vazquez","last_name":"Martin","first_name":"Cristina Vazquez"}],"publisher":"Springer Nature","department":[{"_id":"LifeSc"}],"status":"public","title":"MOESM1 of Glyphosate does not substitute for glycine in proteins of actively dividing mammalian cells","_id":"9784","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","year":"2019"},{"department":[{"_id":"NiBa"}],"publisher":"Dryad","status":"public","title":"Data from: Is the sky the limit? On the expansion threshold of a species' range","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","_id":"9839","year":"2019","oa_version":"Published Version","date_updated":"2023-02-23T11:14:30Z","date_created":"2021-08-09T13:07:28Z","related_material":{"record":[{"id":"315","status":"public","relation":"used_in_publication"}]},"author":[{"full_name":"Polechova, Jitka","orcid":"0000-0003-0951-3112","id":"3BBFB084-F248-11E8-B48F-1D18A9856A87","last_name":"Polechova","first_name":"Jitka"}],"type":"research_data_reference","abstract":[{"lang":"eng","text":"More than 100 years after Grigg’s influential analysis of species’ borders, the causes of limits to species’ ranges still represent a puzzle that has never been understood with clarity. The topic has become especially important recently as many scientists have become interested in the potential for species’ ranges to shift in response to climate change—and yet nearly all of those studies fail to recognise or incorporate evolutionary genetics in a way that relates to theoretical developments. I show that range margins can be understood based on just two measurable parameters: (i) the fitness cost of dispersal—a measure of environmental heterogeneity—and (ii) the strength of genetic drift, which reduces genetic diversity. Together, these two parameters define an ‘expansion threshold’: adaptation fails when genetic drift reduces genetic diversity below that required for adaptation to a heterogeneous environment. When the key parameters drop below this expansion threshold locally, a sharp range margin forms. When they drop below this threshold throughout the species’ range, adaptation collapses everywhere, resulting in either extinction or formation of a fragmented metapopulation. Because the effects of dispersal differ fundamentally with dimension, the second parameter—the strength of genetic drift—is qualitatively different compared to a linear habitat. In two-dimensional habitats, genetic drift becomes effectively independent of selection. It decreases with ‘neighbourhood size’—the number of individuals accessible by dispersal within one generation. Moreover, in contrast to earlier predictions, which neglected evolution of genetic variance and/or stochasticity in two dimensions, dispersal into small marginal populations aids adaptation. This is because the reduction of both genetic and demographic stochasticity has a stronger effect than the cost of dispersal through increased maladaptation. The expansion threshold thus provides a novel, theoretically justified, and testable prediction for formation of the range margin and collapse of the species’ range."}],"oa":1,"citation":{"ista":"Polechova J. 2019. Data from: Is the sky the limit? On the expansion threshold of a species’ range, Dryad, 10.5061/dryad.5vv37.","ieee":"J. Polechova, “Data from: Is the sky the limit? On the expansion threshold of a species’ range.” Dryad, 2019.","apa":"Polechova, J. (2019). Data from: Is the sky the limit? On the expansion threshold of a species’ range. Dryad. https://doi.org/10.5061/dryad.5vv37","ama":"Polechova J. Data from: Is the sky the limit? On the expansion threshold of a species’ range. 2019. doi:10.5061/dryad.5vv37","chicago":"Polechova, Jitka. “Data from: Is the Sky the Limit? On the Expansion Threshold of a Species’ Range.” Dryad, 2019. https://doi.org/10.5061/dryad.5vv37.","mla":"Polechova, Jitka. Data from: Is the Sky the Limit? On the Expansion Threshold of a Species’ Range. Dryad, 2019, doi:10.5061/dryad.5vv37.","short":"J. Polechova, (2019)."},"main_file_link":[{"url":"https://doi.org/10.5061/dryad.5vv37","open_access":"1"}],"doi":"10.5061/dryad.5vv37","date_published":"2019-06-22T00:00:00Z","article_processing_charge":"No","month":"06","day":"22"},{"publication_status":"published","publisher":"American Chemical Society","year":"2019","pmid":1,"date_created":"2020-09-17T10:29:00Z","date_updated":"2021-01-12T08:19:04Z","volume":141,"author":[{"full_name":"Gauto, Diego F.","last_name":"Gauto","first_name":"Diego F."},{"last_name":"Macek","first_name":"Pavel","full_name":"Macek, Pavel"},{"full_name":"Barducci, Alessandro","last_name":"Barducci","first_name":"Alessandro"},{"last_name":"Fraga","first_name":"Hugo","full_name":"Fraga, Hugo"},{"full_name":"Hessel, Audrey","last_name":"Hessel","first_name":"Audrey"},{"last_name":"Terauchi","first_name":"Tsutomu","full_name":"Terauchi, Tsutomu"},{"first_name":"David","last_name":"Gajan","full_name":"Gajan, David"},{"full_name":"Miyanoiri, Yohei","first_name":"Yohei","last_name":"Miyanoiri"},{"first_name":"Jerome","last_name":"Boisbouvier","full_name":"Boisbouvier, Jerome"},{"first_name":"Roman","last_name":"Lichtenecker","full_name":"Lichtenecker, Roman"},{"full_name":"Kainosho, Masatsune","last_name":"Kainosho","first_name":"Masatsune"},{"full_name":"Schanda, Paul","first_name":"Paul","last_name":"Schanda","id":"7B541462-FAF6-11E9-A490-E8DFE5697425","orcid":"0000-0002-9350-7606"}],"extern":"1","quality_controlled":"1","external_id":{"pmid":["31199882"]},"language":[{"iso":"eng"}],"doi":"10.1021/jacs.9b04219","month":"06","publication_identifier":{"issn":["0002-7863","1520-5126"]},"title":"Aromatic ring dynamics, thermal activation, and transient conformations of a 468 kDa enzyme by specific 1H–13C labeling and fast magic-angle spinning NMR","status":"public","intvolume":" 141","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"8408","oa_version":"Submitted Version","type":"journal_article","abstract":[{"lang":"eng","text":"Aromatic residues are located at structurally important sites of many proteins. Probing their interactions and dynamics can provide important functional insight but is challenging in large proteins. Here, we introduce approaches to characterize dynamics of phenylalanine residues using 1H-detected fast magic-angle spinning (MAS) NMR combined with a tailored isotope-labeling scheme. Our approach yields isolated two-spin systems that are ideally suited for artefact-free dynamics measurements, and allows probing motions effectively without molecular-weight limitations. The application to the TET2 enzyme assembly of ~0.5 MDa size, the currently largest protein assigned by MAS NMR, provides insights into motions occurring on a wide range of time scales (ps-ms). We quantitatively probe ring flip motions, and show the temperature dependence by MAS NMR measurements down to 100 K. Interestingly, favorable line widths are observed down to 100 K, with potential implications for DNP NMR. Furthermore, we report the first 13C R1ρ MAS NMR relaxation-dispersion measurements and detect structural excursions occurring on a microsecond time scale in the entry pore to the catalytic chamber and at a trimer interface that was proposed as exit pore. We show that the labeling scheme with deuteration at ca. 50 kHz MAS provides superior resolution compared to 100 kHz MAS experiments with protonated, uniformly 13C-labeled samples."}],"issue":"28","article_type":"original","page":"11183-11195","publication":"Journal of the American Chemical Society","citation":{"mla":"Gauto, Diego F., et al. “Aromatic Ring Dynamics, Thermal Activation, and Transient Conformations of a 468 KDa Enzyme by Specific 1H–13C Labeling and Fast Magic-Angle Spinning NMR.” Journal of the American Chemical Society, vol. 141, no. 28, American Chemical Society, 2019, pp. 11183–95, doi:10.1021/jacs.9b04219.","short":"D.F. Gauto, P. Macek, A. Barducci, H. Fraga, A. Hessel, T. Terauchi, D. Gajan, Y. Miyanoiri, J. Boisbouvier, R. Lichtenecker, M. Kainosho, P. Schanda, Journal of the American Chemical Society 141 (2019) 11183–11195.","chicago":"Gauto, Diego F., Pavel Macek, Alessandro Barducci, Hugo Fraga, Audrey Hessel, Tsutomu Terauchi, David Gajan, et al. “Aromatic Ring Dynamics, Thermal Activation, and Transient Conformations of a 468 KDa Enzyme by Specific 1H–13C Labeling and Fast Magic-Angle Spinning NMR.” Journal of the American Chemical Society. American Chemical Society, 2019. https://doi.org/10.1021/jacs.9b04219.","ama":"Gauto DF, Macek P, Barducci A, et al. Aromatic ring dynamics, thermal activation, and transient conformations of a 468 kDa enzyme by specific 1H–13C labeling and fast magic-angle spinning NMR. Journal of the American Chemical Society. 2019;141(28):11183-11195. doi:10.1021/jacs.9b04219","ista":"Gauto DF, Macek P, Barducci A, Fraga H, Hessel A, Terauchi T, Gajan D, Miyanoiri Y, Boisbouvier J, Lichtenecker R, Kainosho M, Schanda P. 2019. Aromatic ring dynamics, thermal activation, and transient conformations of a 468 kDa enzyme by specific 1H–13C labeling and fast magic-angle spinning NMR. Journal of the American Chemical Society. 141(28), 11183–11195.","ieee":"D. F. Gauto et al., “Aromatic ring dynamics, thermal activation, and transient conformations of a 468 kDa enzyme by specific 1H–13C labeling and fast magic-angle spinning NMR,” Journal of the American Chemical Society, vol. 141, no. 28. American Chemical Society, pp. 11183–11195, 2019.","apa":"Gauto, D. F., Macek, P., Barducci, A., Fraga, H., Hessel, A., Terauchi, T., … Schanda, P. (2019). Aromatic ring dynamics, thermal activation, and transient conformations of a 468 kDa enzyme by specific 1H–13C labeling and fast magic-angle spinning NMR. Journal of the American Chemical Society. American Chemical Society. https://doi.org/10.1021/jacs.9b04219"},"date_published":"2019-06-14T00:00:00Z","keyword":["Colloid and Surface Chemistry","Biochemistry","General Chemistry","Catalysis"],"day":"14","article_processing_charge":"No"},{"extern":"1","publication_status":"published","publisher":"Springer Nature","year":"2019","date_created":"2020-09-17T10:41:51Z","date_updated":"2021-01-12T08:19:09Z","volume":233,"author":[{"last_name":"Guardia","first_name":"Marcel","full_name":"Guardia, Marcel"},{"full_name":"Kaloshin, Vadim","id":"FE553552-CDE8-11E9-B324-C0EBE5697425","orcid":"0000-0002-6051-2628","first_name":"Vadim","last_name":"Kaloshin"},{"first_name":"Jianlu","last_name":"Zhang","full_name":"Zhang, Jianlu"}],"month":"03","publication_identifier":{"issn":["0003-9527","1432-0673"]},"quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1007/s00205-019-01368-7"}],"oa":1,"language":[{"iso":"eng"}],"doi":"10.1007/s00205-019-01368-7","type":"journal_article","abstract":[{"text":"For the Restricted Circular Planar 3 Body Problem, we show that there exists an open set U in phase space of fixed measure, where the set of initial points which lead to collision is O(μ120) dense as μ→0.","lang":"eng"}],"issue":"2","status":"public","title":"Asymptotic density of collision orbits in the Restricted Circular Planar 3 Body Problem","intvolume":" 233","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"8418","oa_version":"Published Version","keyword":["Mechanical Engineering","Mathematics (miscellaneous)","Analysis"],"day":"12","article_processing_charge":"No","article_type":"original","page":"799-836","publication":"Archive for Rational Mechanics and Analysis","citation":{"mla":"Guardia, Marcel, et al. “Asymptotic Density of Collision Orbits in the Restricted Circular Planar 3 Body Problem.” Archive for Rational Mechanics and Analysis, vol. 233, no. 2, Springer Nature, 2019, pp. 799–836, doi:10.1007/s00205-019-01368-7.","short":"M. Guardia, V. Kaloshin, J. Zhang, Archive for Rational Mechanics and Analysis 233 (2019) 799–836.","chicago":"Guardia, Marcel, Vadim Kaloshin, and Jianlu Zhang. “Asymptotic Density of Collision Orbits in the Restricted Circular Planar 3 Body Problem.” Archive for Rational Mechanics and Analysis. Springer Nature, 2019. https://doi.org/10.1007/s00205-019-01368-7.","ama":"Guardia M, Kaloshin V, Zhang J. Asymptotic density of collision orbits in the Restricted Circular Planar 3 Body Problem. Archive for Rational Mechanics and Analysis. 2019;233(2):799-836. doi:10.1007/s00205-019-01368-7","ista":"Guardia M, Kaloshin V, Zhang J. 2019. Asymptotic density of collision orbits in the Restricted Circular Planar 3 Body Problem. Archive for Rational Mechanics and Analysis. 233(2), 799–836.","apa":"Guardia, M., Kaloshin, V., & Zhang, J. (2019). Asymptotic density of collision orbits in the Restricted Circular Planar 3 Body Problem. Archive for Rational Mechanics and Analysis. Springer Nature. https://doi.org/10.1007/s00205-019-01368-7","ieee":"M. Guardia, V. Kaloshin, and J. Zhang, “Asymptotic density of collision orbits in the Restricted Circular Planar 3 Body Problem,” Archive for Rational Mechanics and Analysis, vol. 233, no. 2. Springer Nature, pp. 799–836, 2019."},"date_published":"2019-03-12T00:00:00Z"},{"type":"journal_article","abstract":[{"text":"In this paper, we show that any smooth one-parameter deformations of a strictly convex integrable billiard table Ω0 preserving the integrability near the boundary have to be tangent to a finite dimensional space passing through Ω0.","lang":"eng"}],"issue":"2","_id":"8416","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"On the finite dimensionality of integrable deformations of strictly convex integrable billiard tables","status":"public","intvolume":" 19","oa_version":"Preprint","day":"01","article_processing_charge":"No","publication":"Moscow Mathematical Journal","citation":{"chicago":"Huang, Guan, and Vadim Kaloshin. “On the Finite Dimensionality of Integrable Deformations of Strictly Convex Integrable Billiard Tables.” Moscow Mathematical Journal. American Mathematical Society, 2019. https://doi.org/10.17323/1609-4514-2019-19-2-307-327.","short":"G. Huang, V. Kaloshin, Moscow Mathematical Journal 19 (2019) 307–327.","mla":"Huang, Guan, and Vadim Kaloshin. “On the Finite Dimensionality of Integrable Deformations of Strictly Convex Integrable Billiard Tables.” Moscow Mathematical Journal, vol. 19, no. 2, American Mathematical Society, 2019, pp. 307–27, doi:10.17323/1609-4514-2019-19-2-307-327.","apa":"Huang, G., & Kaloshin, V. (2019). On the finite dimensionality of integrable deformations of strictly convex integrable billiard tables. Moscow Mathematical Journal. American Mathematical Society. https://doi.org/10.17323/1609-4514-2019-19-2-307-327","ieee":"G. Huang and V. Kaloshin, “On the finite dimensionality of integrable deformations of strictly convex integrable billiard tables,” Moscow Mathematical Journal, vol. 19, no. 2. American Mathematical Society, pp. 307–327, 2019.","ista":"Huang G, Kaloshin V. 2019. On the finite dimensionality of integrable deformations of strictly convex integrable billiard tables. Moscow Mathematical Journal. 19(2), 307–327.","ama":"Huang G, Kaloshin V. On the finite dimensionality of integrable deformations of strictly convex integrable billiard tables. Moscow Mathematical Journal. 2019;19(2):307-327. doi:10.17323/1609-4514-2019-19-2-307-327"},"article_type":"original","page":"307-327","date_published":"2019-04-01T00:00:00Z","extern":"1","year":"2019","publication_status":"published","publisher":"American Mathematical Society","author":[{"full_name":"Huang, Guan","first_name":"Guan","last_name":"Huang"},{"full_name":"Kaloshin, Vadim","id":"FE553552-CDE8-11E9-B324-C0EBE5697425","orcid":"0000-0002-6051-2628","first_name":"Vadim","last_name":"Kaloshin"}],"date_updated":"2021-01-12T08:19:08Z","date_created":"2020-09-17T10:41:36Z","volume":19,"month":"04","publication_identifier":{"issn":["1609-4514"]},"oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1809.09341","open_access":"1"}],"external_id":{"arxiv":["1809.09341"]},"quality_controlled":"1","doi":"10.17323/1609-4514-2019-19-2-307-327","language":[{"iso":"eng"}]},{"article_processing_charge":"No","day":"10","month":"12","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1908.02523"}],"citation":{"short":"L. Chierchia, E. Koudjinan, Regular and Chaotic Dynamics 24 (2019) 583–606.","mla":"Chierchia, Luigi, and Edmond Koudjinan. “V. I. Arnold’s ‘Pointwise’ KAM Theorem.” Regular and Chaotic Dynamics, vol. 24, Springer, 2019, pp. 583–606, doi:10.1134/S1560354719060017.","chicago":"Chierchia, Luigi, and Edmond Koudjinan. “V. I. Arnold’s ‘Pointwise’ KAM Theorem.” Regular and Chaotic Dynamics. Springer, 2019. https://doi.org/10.1134/S1560354719060017.","ama":"Chierchia L, Koudjinan E. V. I. Arnold’s “pointwise” KAM theorem. Regular and Chaotic Dynamics. 2019;24:583–606. doi:10.1134/S1560354719060017","apa":"Chierchia, L., & Koudjinan, E. (2019). V. I. Arnold’s “pointwise” KAM theorem. Regular and Chaotic Dynamics. Springer. https://doi.org/10.1134/S1560354719060017","ieee":"L. Chierchia and E. Koudjinan, “V. I. Arnold’s ‘pointwise’ KAM theorem,” Regular and Chaotic Dynamics, vol. 24. Springer, pp. 583–606, 2019.","ista":"Chierchia L, Koudjinan E. 2019. V. I. Arnold’s “pointwise” KAM theorem. Regular and Chaotic Dynamics. 24, 583–606."},"external_id":{"arxiv":["1908.02523"]},"oa":1,"publication":"Regular and Chaotic Dynamics","page":"583–606","quality_controlled":"1","article_type":"original","doi":"10.1134/S1560354719060017","date_published":"2019-12-10T00:00:00Z","language":[{"iso":"eng"}],"type":"journal_article","abstract":[{"lang":"eng","text":"We review V. I. Arnold’s 1963 celebrated paper [1] Proof of A. N. Kolmogorov’s Theorem on the Conservation of Conditionally Periodic Motions with a Small Variation in the Hamiltonian, and prove that, optimising Arnold’s scheme, one can get “sharp” asymptotic quantitative conditions (as ε → 0, ε being the strength of the perturbation). All constants involved are explicitly computed."}],"extern":"1","_id":"8693","year":"2019","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Springer","intvolume":" 24","status":"public","title":"V. I. Arnold’s “pointwise” KAM theorem","publication_status":"published","author":[{"last_name":"Chierchia","first_name":"Luigi","full_name":"Chierchia, Luigi"},{"orcid":"0000-0003-2640-4049","id":"52DF3E68-AEFA-11EA-95A4-124A3DDC885E","last_name":"Koudjinan","first_name":"Edmond","full_name":"Koudjinan, Edmond"}],"volume":24,"oa_version":"Preprint","date_updated":"2021-01-12T08:20:34Z","date_created":"2020-10-21T15:25:45Z"},{"publication_identifier":{"issn":["2451-9456"]},"month":"11","language":[{"iso":"eng"}],"doi":"10.1016/j.chembiol.2019.09.002","quality_controlled":"1","external_id":{"pmid":["31543461"]},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1016/j.chembiol.2019.09.002"}],"oa":1,"extern":"1","volume":26,"date_updated":"2023-02-23T13:46:53Z","date_created":"2021-01-19T11:04:50Z","author":[{"full_name":"Bakail, May M","id":"FB3C3F8E-522F-11EA-B186-22963DDC885E","orcid":"0000-0002-9592-1587","first_name":"May M","last_name":"Bakail"},{"full_name":"Gaubert, Albane","last_name":"Gaubert","first_name":"Albane"},{"full_name":"Andreani, Jessica","last_name":"Andreani","first_name":"Jessica"},{"full_name":"Moal, Gwenaëlle","first_name":"Gwenaëlle","last_name":"Moal"},{"first_name":"Guillaume","last_name":"Pinna","full_name":"Pinna, Guillaume"},{"full_name":"Boyarchuk, Ekaterina","first_name":"Ekaterina","last_name":"Boyarchuk"},{"last_name":"Gaillard","first_name":"Marie-Cécile","full_name":"Gaillard, Marie-Cécile"},{"full_name":"Courbeyrette, Regis","first_name":"Regis","last_name":"Courbeyrette"},{"last_name":"Mann","first_name":"Carl","full_name":"Mann, Carl"},{"last_name":"Thuret","first_name":"Jean-Yves","full_name":"Thuret, Jean-Yves"},{"full_name":"Guichard, Bérengère","last_name":"Guichard","first_name":"Bérengère"},{"full_name":"Murciano, Brice","last_name":"Murciano","first_name":"Brice"},{"first_name":"Nicolas","last_name":"Richet","full_name":"Richet, Nicolas"},{"full_name":"Poitou, Adeline","first_name":"Adeline","last_name":"Poitou"},{"full_name":"Frederic, Claire","first_name":"Claire","last_name":"Frederic"},{"last_name":"Le Du","first_name":"Marie-Hélène","full_name":"Le Du, Marie-Hélène"},{"full_name":"Agez, Morgane","last_name":"Agez","first_name":"Morgane"},{"full_name":"Roelants, Caroline","first_name":"Caroline","last_name":"Roelants"},{"first_name":"Zachary A.","last_name":"Gurard-Levin","full_name":"Gurard-Levin, Zachary A."},{"last_name":"Almouzni","first_name":"Geneviève","full_name":"Almouzni, Geneviève"},{"last_name":"Cherradi","first_name":"Nadia","full_name":"Cherradi, Nadia"},{"last_name":"Guerois","first_name":"Raphael","full_name":"Guerois, Raphael"},{"last_name":"Ochsenbein","first_name":"Françoise","full_name":"Ochsenbein, Françoise"}],"publisher":"Elsevier","publication_status":"published","pmid":1,"year":"2019","article_processing_charge":"No","day":"21","keyword":["Clinical Biochemistry","Molecular Medicine","Biochemistry","Molecular Biology","Pharmacology","Drug Discovery"],"date_published":"2019-11-21T00:00:00Z","page":"1573-1585.e10","article_type":"original","citation":{"short":"M.M. Bakail, A. Gaubert, J. Andreani, G. Moal, G. Pinna, E. Boyarchuk, M.-C. Gaillard, R. Courbeyrette, C. Mann, J.-Y. Thuret, B. Guichard, B. Murciano, N. Richet, A. Poitou, C. Frederic, M.-H. Le Du, M. Agez, C. Roelants, Z.A. Gurard-Levin, G. Almouzni, N. Cherradi, R. Guerois, F. Ochsenbein, Cell Chemical Biology 26 (2019) 1573–1585.e10.","mla":"Bakail, May M., et al. “Design on a Rational Basis of High-Affinity Peptides Inhibiting the Histone Chaperone ASF1.” Cell Chemical Biology, vol. 26, no. 11, Elsevier, 2019, p. 1573–1585.e10, doi:10.1016/j.chembiol.2019.09.002.","chicago":"Bakail, May M, Albane Gaubert, Jessica Andreani, Gwenaëlle Moal, Guillaume Pinna, Ekaterina Boyarchuk, Marie-Cécile Gaillard, et al. “Design on a Rational Basis of High-Affinity Peptides Inhibiting the Histone Chaperone ASF1.” Cell Chemical Biology. Elsevier, 2019. https://doi.org/10.1016/j.chembiol.2019.09.002.","ama":"Bakail MM, Gaubert A, Andreani J, et al. Design on a rational basis of high-affinity peptides inhibiting the histone chaperone ASF1. Cell Chemical Biology. 2019;26(11):1573-1585.e10. doi:10.1016/j.chembiol.2019.09.002","ieee":"M. M. Bakail et al., “Design on a rational basis of high-affinity peptides inhibiting the histone chaperone ASF1,” Cell Chemical Biology, vol. 26, no. 11. Elsevier, p. 1573–1585.e10, 2019.","apa":"Bakail, M. M., Gaubert, A., Andreani, J., Moal, G., Pinna, G., Boyarchuk, E., … Ochsenbein, F. (2019). Design on a rational basis of high-affinity peptides inhibiting the histone chaperone ASF1. Cell Chemical Biology. Elsevier. https://doi.org/10.1016/j.chembiol.2019.09.002","ista":"Bakail MM, Gaubert A, Andreani J, Moal G, Pinna G, Boyarchuk E, Gaillard M-C, Courbeyrette R, Mann C, Thuret J-Y, Guichard B, Murciano B, Richet N, Poitou A, Frederic C, Le Du M-H, Agez M, Roelants C, Gurard-Levin ZA, Almouzni G, Cherradi N, Guerois R, Ochsenbein F. 2019. Design on a rational basis of high-affinity peptides inhibiting the histone chaperone ASF1. Cell Chemical Biology. 26(11), 1573–1585.e10."},"publication":"Cell Chemical Biology","issue":"11","abstract":[{"text":"Anti-silencing function 1 (ASF1) is a conserved H3-H4 histone chaperone involved in histone dynamics during replication, transcription, and DNA repair. Overexpressed in proliferating tissues including many tumors, ASF1 has emerged as a promising therapeutic target. Here, we combine structural, computational, and biochemical approaches to design peptides that inhibit the ASF1-histone interaction. Starting from the structure of the human ASF1-histone complex, we developed a rational design strategy combining epitope tethering and optimization of interface contacts to identify a potent peptide inhibitor with a dissociation constant of 3 nM. When introduced into cultured cells, the inhibitors impair cell proliferation, perturb cell-cycle progression, and reduce cell migration and invasion in a manner commensurate with their affinity for ASF1. Finally, we find that direct injection of the most potent ASF1 peptide inhibitor in mouse allografts reduces tumor growth. Our results open new avenues to use ASF1 inhibitors as promising leads for cancer therapy.","lang":"eng"}],"type":"journal_article","oa_version":"Published Version","intvolume":" 26","title":"Design on a rational basis of high-affinity peptides inhibiting the histone chaperone ASF1","status":"public","_id":"9018","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"day":"10","has_accepted_license":"1","article_processing_charge":"No","scopus_import":"1","date_published":"2019-10-10T00:00:00Z","publication":"Epigenetics and Chromatin","citation":{"ista":"Harris KD, Lloyd JPB, Domb K, Zilberman D, Zemach A. 2019. DNA methylation is maintained with high fidelity in the honey bee germline and exhibits global non-functional fluctuations during somatic development. Epigenetics and Chromatin. 12, 62.","ieee":"K. D. Harris, J. P. B. Lloyd, K. Domb, D. Zilberman, and A. Zemach, “DNA methylation is maintained with high fidelity in the honey bee germline and exhibits global non-functional fluctuations during somatic development,” Epigenetics and Chromatin, vol. 12. Springer Nature, 2019.","apa":"Harris, K. D., Lloyd, J. P. B., Domb, K., Zilberman, D., & Zemach, A. (2019). DNA methylation is maintained with high fidelity in the honey bee germline and exhibits global non-functional fluctuations during somatic development. Epigenetics and Chromatin. Springer Nature. https://doi.org/10.1186/s13072-019-0307-4","ama":"Harris KD, Lloyd JPB, Domb K, Zilberman D, Zemach A. DNA methylation is maintained with high fidelity in the honey bee germline and exhibits global non-functional fluctuations during somatic development. Epigenetics and Chromatin. 2019;12. doi:10.1186/s13072-019-0307-4","chicago":"Harris, Keith D., James P. B. Lloyd, Katherine Domb, Daniel Zilberman, and Assaf Zemach. “DNA Methylation Is Maintained with High Fidelity in the Honey Bee Germline and Exhibits Global Non-Functional Fluctuations during Somatic Development.” Epigenetics and Chromatin. Springer Nature, 2019. https://doi.org/10.1186/s13072-019-0307-4.","mla":"Harris, Keith D., et al. “DNA Methylation Is Maintained with High Fidelity in the Honey Bee Germline and Exhibits Global Non-Functional Fluctuations during Somatic Development.” Epigenetics and Chromatin, vol. 12, 62, Springer Nature, 2019, doi:10.1186/s13072-019-0307-4.","short":"K.D. Harris, J.P.B. Lloyd, K. Domb, D. Zilberman, A. Zemach, Epigenetics and Chromatin 12 (2019)."},"article_type":"original","abstract":[{"lang":"eng","text":"Background\r\nDNA methylation of active genes, also known as gene body methylation, is found in many animal and plant genomes. Despite this, the transcriptional and developmental role of such methylation remains poorly understood. Here, we explore the dynamic range of DNA methylation in honey bee, a model organism for gene body methylation.\r\n\r\nResults\r\nOur data show that CG methylation in gene bodies globally fluctuates during honey bee development. However, these changes cause no gene expression alterations. Intriguingly, despite the global alterations, tissue-specific CG methylation patterns of complete genes or exons are rare, implying robust maintenance of genic methylation during development. Additionally, we show that CG methylation maintenance fluctuates in somatic cells, while reaching maximum fidelity in sperm cells. Finally, unlike universally present CG methylation, we discovered non-CG methylation specifically in bee heads that resembles such methylation in mammalian brain tissue.\r\n\r\nConclusions\r\nBased on these results, we propose that gene body CG methylation can oscillate during development if it is kept to a level adequate to preserve function. Additionally, our data suggest that heightened non-CG methylation is a conserved regulator of animal nervous systems."}],"type":"journal_article","file":[{"content_type":"application/pdf","file_size":3221067,"creator":"asandaue","access_level":"open_access","file_name":"2019_EpigeneticsAndChromatin_Harris.pdf","checksum":"86ff50a7517891511af2733c76c81b67","success":1,"date_updated":"2021-06-08T09:29:19Z","date_created":"2021-06-08T09:29:19Z","relation":"main_file","file_id":"9531"}],"oa_version":"Published Version","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","_id":"9530","status":"public","ddc":["570"],"title":"DNA methylation is maintained with high fidelity in the honey bee germline and exhibits global non-functional fluctuations during somatic development","intvolume":" 12","month":"10","publication_identifier":{"eissn":["1756-8935"]},"doi":"10.1186/s13072-019-0307-4","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":{"pmid":["31601251"]},"quality_controlled":"1","file_date_updated":"2021-06-08T09:29:19Z","extern":"1","article_number":"62","author":[{"first_name":"Keith D.","last_name":"Harris","full_name":"Harris, Keith D."},{"last_name":"Lloyd","first_name":"James P. B.","full_name":"Lloyd, James P. B."},{"last_name":"Domb","first_name":"Katherine","full_name":"Domb, Katherine"},{"full_name":"Zilberman, Daniel","last_name":"Zilberman","first_name":"Daniel","orcid":"0000-0002-0123-8649","id":"6973db13-dd5f-11ea-814e-b3e5455e9ed1"},{"last_name":"Zemach","first_name":"Assaf","full_name":"Zemach, Assaf"}],"date_created":"2021-06-08T09:21:51Z","date_updated":"2021-12-14T07:53:00Z","volume":12,"year":"2019","pmid":1,"publication_status":"published","department":[{"_id":"DaZi"}],"publisher":"Springer Nature"},{"extern":"1","publication_status":"published","publisher":"Wiley","year":"2019","date_updated":"2023-02-23T14:01:53Z","date_created":"2021-06-22T09:46:03Z","volume":99,"author":[{"orcid":"0000-0002-4003-7567","id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3","last_name":"Kwan","first_name":"Matthew Alan","full_name":"Kwan, Matthew Alan"},{"full_name":"Sudakov, Benny","last_name":"Sudakov","first_name":"Benny"},{"full_name":"Tran, Tuan","first_name":"Tuan","last_name":"Tran"}],"month":"05","publication_identifier":{"issn":["0024-6107"],"eissn":["1469-7750"]},"quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1807.05202"}],"oa":1,"external_id":{"arxiv":["1807.05202"]},"language":[{"iso":"eng"}],"doi":"10.1112/jlms.12192","type":"journal_article","abstract":[{"lang":"eng","text":"Consider integers 𝑘,ℓ such that 0⩽ℓ⩽(𝑘2) . Given a large graph 𝐺 , what is the fraction of 𝑘 -vertex subsets of 𝐺 which span exactly ℓ edges? When 𝐺 is empty or complete, and ℓ is zero or (𝑘2) , this fraction can be exactly 1. On the other hand, if ℓ is far from these extreme values, one might expect that this fraction is substantially smaller than 1. This was recently proved by Alon, Hefetz, Krivelevich, and Tyomkyn who initiated the systematic study of this question and proposed several natural conjectures.\r\nLet ℓ∗=min{ℓ,(𝑘2)−ℓ} . Our main result is that for any 𝑘 and ℓ , the fraction of 𝑘 -vertex subsets that span ℓ edges is at most log𝑂(1)(ℓ∗/𝑘)√ 𝑘/ℓ∗, which is best-possible up to the logarithmic factor. This improves on multiple results of Alon, Hefetz, Krivelevich, and Tyomkyn, and resolves one of their conjectures. In addition, we also make some first steps towards some analogous questions for hypergraphs.\r\nOur proofs involve some Ramsey-type arguments, and a number of different probabilistic tools, such as polynomial anticoncentration inequalities, hypercontractivity, and a coupling trick for random variables defined on a ‘slice’ of the Boolean hypercube."}],"issue":"3","status":"public","title":"Anticoncentration for subgraph statistics","intvolume":" 99","_id":"9586","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","oa_version":"Preprint","scopus_import":"1","day":"03","article_processing_charge":"No","article_type":"original","page":"757-777","publication":"Journal of the London Mathematical Society","citation":{"short":"M.A. Kwan, B. Sudakov, T. Tran, Journal of the London Mathematical Society 99 (2019) 757–777.","mla":"Kwan, Matthew Alan, et al. “Anticoncentration for Subgraph Statistics.” Journal of the London Mathematical Society, vol. 99, no. 3, Wiley, 2019, pp. 757–77, doi:10.1112/jlms.12192.","chicago":"Kwan, Matthew Alan, Benny Sudakov, and Tuan Tran. “Anticoncentration for Subgraph Statistics.” Journal of the London Mathematical Society. Wiley, 2019. https://doi.org/10.1112/jlms.12192.","ama":"Kwan MA, Sudakov B, Tran T. Anticoncentration for subgraph statistics. Journal of the London Mathematical Society. 2019;99(3):757-777. doi:10.1112/jlms.12192","apa":"Kwan, M. A., Sudakov, B., & Tran, T. (2019). Anticoncentration for subgraph statistics. Journal of the London Mathematical Society. Wiley. https://doi.org/10.1112/jlms.12192","ieee":"M. A. Kwan, B. Sudakov, and T. Tran, “Anticoncentration for subgraph statistics,” Journal of the London Mathematical Society, vol. 99, no. 3. Wiley, pp. 757–777, 2019.","ista":"Kwan MA, Sudakov B, Tran T. 2019. Anticoncentration for subgraph statistics. Journal of the London Mathematical Society. 99(3), 757–777."},"date_published":"2019-05-03T00:00:00Z"},{"publication_identifier":{"issn":["0021-2172"],"eissn":["1565-8511"]},"month":"08","doi":"10.1007/s11856-019-1897-z","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1803.08462"}],"external_id":{"arxiv":["1803.08462"]},"oa":1,"quality_controlled":"1","extern":"1","author":[{"full_name":"Conlon, David","last_name":"Conlon","first_name":"David"},{"first_name":"Jacob","last_name":"Fox","full_name":"Fox, Jacob"},{"first_name":"Matthew Alan","last_name":"Kwan","id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3","orcid":"0000-0002-4003-7567","full_name":"Kwan, Matthew Alan"},{"first_name":"Benny","last_name":"Sudakov","full_name":"Sudakov, Benny"}],"volume":233,"date_created":"2021-06-21T13:36:02Z","date_updated":"2023-02-23T14:01:41Z","year":"2019","publisher":"Springer","publication_status":"published","article_processing_charge":"No","day":"01","scopus_import":"1","date_published":"2019-08-01T00:00:00Z","citation":{"chicago":"Conlon, David, Jacob Fox, Matthew Alan Kwan, and Benny Sudakov. “Hypergraph Cuts above the Average.” Israel Journal of Mathematics. Springer, 2019. https://doi.org/10.1007/s11856-019-1897-z.","short":"D. Conlon, J. Fox, M.A. Kwan, B. Sudakov, Israel Journal of Mathematics 233 (2019) 67–111.","mla":"Conlon, David, et al. “Hypergraph Cuts above the Average.” Israel Journal of Mathematics, vol. 233, no. 1, Springer, 2019, pp. 67–111, doi:10.1007/s11856-019-1897-z.","apa":"Conlon, D., Fox, J., Kwan, M. A., & Sudakov, B. (2019). Hypergraph cuts above the average. Israel Journal of Mathematics. Springer. https://doi.org/10.1007/s11856-019-1897-z","ieee":"D. Conlon, J. Fox, M. A. Kwan, and B. Sudakov, “Hypergraph cuts above the average,” Israel Journal of Mathematics, vol. 233, no. 1. Springer, pp. 67–111, 2019.","ista":"Conlon D, Fox J, Kwan MA, Sudakov B. 2019. Hypergraph cuts above the average. Israel Journal of Mathematics. 233(1), 67–111.","ama":"Conlon D, Fox J, Kwan MA, Sudakov B. Hypergraph cuts above the average. Israel Journal of Mathematics. 2019;233(1):67-111. doi:10.1007/s11856-019-1897-z"},"publication":"Israel Journal of Mathematics","page":"67-111","article_type":"original","issue":"1","abstract":[{"text":"An r-cut of a k-uniform hypergraph H is a partition of the vertex set of H into r parts and the size of the cut is the number of edges which have a vertex in each part. A classical result of Edwards says that every m-edge graph has a 2-cut of size m/2+Ω)(m−−√) and this is best possible. That is, there exist cuts which exceed the expected size of a random cut by some multiple of the standard deviation. We study analogues of this and related results in hypergraphs. First, we observe that similarly to graphs, every m-edge k-uniform hypergraph has an r-cut whose size is Ω(m−−√) larger than the expected size of a random r-cut. Moreover, in the case where k = 3 and r = 2 this bound is best possible and is attained by Steiner triple systems. Surprisingly, for all other cases (that is, if k ≥ 4 or r ≥ 3), we show that every m-edge k-uniform hypergraph has an r-cut whose size is Ω(m5/9) larger than the expected size of a random r-cut. This is a significant difference in behaviour, since the amount by which the size of the largest cut exceeds the expected size of a random cut is now considerably larger than the standard deviation.","lang":"eng"}],"type":"journal_article","oa_version":"Preprint","_id":"9580","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","intvolume":" 233","title":"Hypergraph cuts above the average","status":"public"},{"scopus_import":"1","article_processing_charge":"No","day":"15","citation":{"ieee":"M. A. Kwan and B. Sudakov, “Proof of a conjecture on induced subgraphs of Ramsey graphs,” Transactions of the American Mathematical Society, vol. 372, no. 8. American Mathematical Society, pp. 5571–5594, 2019.","apa":"Kwan, M. A., & Sudakov, B. (2019). Proof of a conjecture on induced subgraphs of Ramsey graphs. Transactions of the American Mathematical Society. American Mathematical Society. https://doi.org/10.1090/tran/7729","ista":"Kwan MA, Sudakov B. 2019. Proof of a conjecture on induced subgraphs of Ramsey graphs. Transactions of the American Mathematical Society. 372(8), 5571–5594.","ama":"Kwan MA, Sudakov B. Proof of a conjecture on induced subgraphs of Ramsey graphs. Transactions of the American Mathematical Society. 2019;372(8):5571-5594. doi:10.1090/tran/7729","chicago":"Kwan, Matthew Alan, and Benny Sudakov. “Proof of a Conjecture on Induced Subgraphs of Ramsey Graphs.” Transactions of the American Mathematical Society. American Mathematical Society, 2019. https://doi.org/10.1090/tran/7729.","short":"M.A. Kwan, B. Sudakov, Transactions of the American Mathematical Society 372 (2019) 5571–5594.","mla":"Kwan, Matthew Alan, and Benny Sudakov. “Proof of a Conjecture on Induced Subgraphs of Ramsey Graphs.” Transactions of the American Mathematical Society, vol. 372, no. 8, American Mathematical Society, 2019, pp. 5571–94, doi:10.1090/tran/7729."},"publication":"Transactions of the American Mathematical Society","page":"5571-5594","article_type":"original","date_published":"2019-10-15T00:00:00Z","type":"journal_article","issue":"8","abstract":[{"lang":"eng","text":"An n-vertex graph is called C-Ramsey if it has no clique or independent set of size C log n. All known constructions of Ramsey graphs involve randomness in an essential way, and there is an ongoing line of research towards showing that in fact all Ramsey graphs must obey certain “richness” properties characteristic of random graphs. More than 25 years ago, Erdős, Faudree and Sós conjectured that in any C-Ramsey graph there are Ω(n^5/2) induced subgraphs, no pair of which have the same numbers of vertices and edges. Improving on earlier results of Alon, Balogh, Kostochka and Samotij, in this paper we prove this conjecture."}],"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","_id":"9585","intvolume":" 372","status":"public","title":"Proof of a conjecture on induced subgraphs of Ramsey graphs","oa_version":"Submitted Version","publication_identifier":{"issn":["0002-9947"],"eissn":["1088-6850"]},"month":"10","external_id":{"arxiv":["1712.05656"]},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1090/tran/7729"}],"oa":1,"quality_controlled":"1","doi":"10.1090/tran/7729","language":[{"iso":"eng"}],"extern":"1","year":"2019","publisher":"American Mathematical Society","publication_status":"published","author":[{"id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3","orcid":"0000-0002-4003-7567","first_name":"Matthew Alan","last_name":"Kwan","full_name":"Kwan, Matthew Alan"},{"last_name":"Sudakov","first_name":"Benny","full_name":"Sudakov, Benny"}],"volume":372,"date_updated":"2023-02-23T14:01:50Z","date_created":"2021-06-22T09:31:45Z"},{"intvolume":" 236","title":"i-PI 2.0: A universal force engine for advanced molecular simulations","status":"public","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","_id":"9677","oa_version":"Preprint","type":"journal_article","abstract":[{"text":"Progress in the atomic-scale modeling of matter over the past decade has been tremendous. This progress has been brought about by improvements in methods for evaluating interatomic forces that work by either solving the electronic structure problem explicitly, or by computing accurate approximations of the solution and by the development of techniques that use the Born–Oppenheimer (BO) forces to move the atoms on the BO potential energy surface. As a consequence of these developments it is now possible to identify stable or metastable states, to sample configurations consistent with the appropriate thermodynamic ensemble, and to estimate the kinetics of reactions and phase transitions. All too often, however, progress is slowed down by the bottleneck associated with implementing new optimization algorithms and/or sampling techniques into the many existing electronic-structure and empirical-potential codes. To address this problem, we are thus releasing a new version of the i-PI software. This piece of software is an easily extensible framework for implementing advanced atomistic simulation techniques using interatomic potentials and forces calculated by an external driver code. While the original version of the code (Ceriotti et al., 2014) was developed with a focus on path integral molecular dynamics techniques, this second release of i-PI not only includes several new advanced path integral methods, but also offers other classes of algorithms. In other words, i-PI is moving towards becoming a universal force engine that is both modular and tightly coupled to the driver codes that evaluate the potential energy surface and its derivatives.","lang":"eng"}],"page":"214-223","article_type":"original","citation":{"short":"V. Kapil, M. Rossi, O. Marsalek, R. Petraglia, Y. Litman, T. Spura, B. Cheng, A. Cuzzocrea, R.H. Meißner, D.M. Wilkins, B.A. Helfrecht, P. Juda, S.P. Bienvenue, W. Fang, J. Kessler, I. Poltavsky, S. Vandenbrande, J. Wieme, C. Corminboeuf, T.D. Kühne, D.E. Manolopoulos, T.E. Markland, J.O. Richardson, A. Tkatchenko, G.A. Tribello, V. Van Speybroeck, M. Ceriotti, Computer Physics Communications 236 (2019) 214–223.","mla":"Kapil, Venkat, et al. “I-PI 2.0: A Universal Force Engine for Advanced Molecular Simulations.” Computer Physics Communications, vol. 236, Elsevier, 2019, pp. 214–23, doi:10.1016/j.cpc.2018.09.020.","chicago":"Kapil, Venkat, Mariana Rossi, Ondrej Marsalek, Riccardo Petraglia, Yair Litman, Thomas Spura, Bingqing Cheng, et al. “I-PI 2.0: A Universal Force Engine for Advanced Molecular Simulations.” Computer Physics Communications. Elsevier, 2019. https://doi.org/10.1016/j.cpc.2018.09.020.","ama":"Kapil V, Rossi M, Marsalek O, et al. i-PI 2.0: A universal force engine for advanced molecular simulations. Computer Physics Communications. 2019;236:214-223. doi:10.1016/j.cpc.2018.09.020","apa":"Kapil, V., Rossi, M., Marsalek, O., Petraglia, R., Litman, Y., Spura, T., … Ceriotti, M. (2019). i-PI 2.0: A universal force engine for advanced molecular simulations. Computer Physics Communications. Elsevier. https://doi.org/10.1016/j.cpc.2018.09.020","ieee":"V. Kapil et al., “i-PI 2.0: A universal force engine for advanced molecular simulations,” Computer Physics Communications, vol. 236. Elsevier, pp. 214–223, 2019.","ista":"Kapil V, Rossi M, Marsalek O, Petraglia R, Litman Y, Spura T, Cheng B, Cuzzocrea A, Meißner RH, Wilkins DM, Helfrecht BA, Juda P, Bienvenue SP, Fang W, Kessler J, Poltavsky I, Vandenbrande S, Wieme J, Corminboeuf C, Kühne TD, Manolopoulos DE, Markland TE, Richardson JO, Tkatchenko A, Tribello GA, Van Speybroeck V, Ceriotti M. 2019. i-PI 2.0: A universal force engine for advanced molecular simulations. Computer Physics Communications. 236, 214–223."},"publication":"Computer Physics Communications","date_published":"2019-03-01T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"01","publisher":"Elsevier","publication_status":"published","year":"2019","volume":236,"date_created":"2021-07-16T08:53:01Z","date_updated":"2021-08-09T12:37:16Z","author":[{"full_name":"Kapil, Venkat","last_name":"Kapil","first_name":"Venkat"},{"full_name":"Rossi, Mariana","first_name":"Mariana","last_name":"Rossi"},{"first_name":"Ondrej","last_name":"Marsalek","full_name":"Marsalek, Ondrej"},{"full_name":"Petraglia, Riccardo","first_name":"Riccardo","last_name":"Petraglia"},{"full_name":"Litman, Yair","last_name":"Litman","first_name":"Yair"},{"first_name":"Thomas","last_name":"Spura","full_name":"Spura, Thomas"},{"full_name":"Cheng, Bingqing","orcid":"0000-0002-3584-9632","id":"cbe3cda4-d82c-11eb-8dc7-8ff94289fcc9","last_name":"Cheng","first_name":"Bingqing"},{"last_name":"Cuzzocrea","first_name":"Alice","full_name":"Cuzzocrea, Alice"},{"first_name":"Robert H.","last_name":"Meißner","full_name":"Meißner, Robert H."},{"full_name":"Wilkins, David M.","first_name":"David M.","last_name":"Wilkins"},{"first_name":"Benjamin A.","last_name":"Helfrecht","full_name":"Helfrecht, Benjamin A."},{"full_name":"Juda, Przemysław","last_name":"Juda","first_name":"Przemysław"},{"full_name":"Bienvenue, Sébastien P.","last_name":"Bienvenue","first_name":"Sébastien P."},{"full_name":"Fang, Wei","last_name":"Fang","first_name":"Wei"},{"full_name":"Kessler, Jan","last_name":"Kessler","first_name":"Jan"},{"last_name":"Poltavsky","first_name":"Igor","full_name":"Poltavsky, Igor"},{"first_name":"Steven","last_name":"Vandenbrande","full_name":"Vandenbrande, Steven"},{"full_name":"Wieme, Jelle","last_name":"Wieme","first_name":"Jelle"},{"first_name":"Clemence","last_name":"Corminboeuf","full_name":"Corminboeuf, Clemence"},{"last_name":"Kühne","first_name":"Thomas D.","full_name":"Kühne, Thomas D."},{"full_name":"Manolopoulos, David E.","last_name":"Manolopoulos","first_name":"David E."},{"full_name":"Markland, Thomas E.","first_name":"Thomas E.","last_name":"Markland"},{"first_name":"Jeremy O.","last_name":"Richardson","full_name":"Richardson, Jeremy O."},{"first_name":"Alexandre","last_name":"Tkatchenko","full_name":"Tkatchenko, Alexandre"},{"full_name":"Tribello, Gareth A.","last_name":"Tribello","first_name":"Gareth A."},{"last_name":"Van Speybroeck","first_name":"Veronique","full_name":"Van Speybroeck, Veronique"},{"last_name":"Ceriotti","first_name":"Michele","full_name":"Ceriotti, Michele"}],"extern":"1","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1808.03824"}],"oa":1,"external_id":{"arxiv":["1808.03824"]},"language":[{"iso":"eng"}],"doi":"10.1016/j.cpc.2018.09.020","publication_identifier":{"issn":["0010-4655"]},"month":"03"},{"date_published":"2019-01-14T00:00:00Z","citation":{"mla":"Giberti, F., et al. “Iterative Unbiasing of Quasi-Equilibrium Sampling.” Journal of Chemical Theory and Computation, vol. 16, no. 1, American Chemical Society, 2019, pp. 100–07, doi:10.1021/acs.jctc.9b00907.","short":"F. Giberti, B. Cheng, G.A. Tribello, M. Ceriotti, Journal of Chemical Theory and Computation 16 (2019) 100–107.","chicago":"Giberti, F., Bingqing Cheng, G. A. Tribello, and M. Ceriotti. “Iterative Unbiasing of Quasi-Equilibrium Sampling.” Journal of Chemical Theory and Computation. American Chemical Society, 2019. https://doi.org/10.1021/acs.jctc.9b00907.","ama":"Giberti F, Cheng B, Tribello GA, Ceriotti M. Iterative unbiasing of quasi-equilibrium sampling. Journal of Chemical Theory and Computation. 2019;16(1):100-107. doi:10.1021/acs.jctc.9b00907","ista":"Giberti F, Cheng B, Tribello GA, Ceriotti M. 2019. Iterative unbiasing of quasi-equilibrium sampling. Journal of Chemical Theory and Computation. 16(1), 100–107.","ieee":"F. Giberti, B. Cheng, G. A. Tribello, and M. Ceriotti, “Iterative unbiasing of quasi-equilibrium sampling,” Journal of Chemical Theory and Computation, vol. 16, no. 1. American Chemical Society, pp. 100–107, 2019.","apa":"Giberti, F., Cheng, B., Tribello, G. A., & Ceriotti, M. (2019). Iterative unbiasing of quasi-equilibrium sampling. Journal of Chemical Theory and Computation. American Chemical Society. https://doi.org/10.1021/acs.jctc.9b00907"},"publication":"Journal of Chemical Theory and Computation","page":"100-107","article_type":"original","article_processing_charge":"No","day":"14","scopus_import":"1","oa_version":"Preprint","_id":"9680","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","intvolume":" 16","status":"public","title":"Iterative unbiasing of quasi-equilibrium sampling","issue":"1","abstract":[{"lang":"eng","text":"Atomistic modeling of phase transitions, chemical reactions, or other rare events that involve overcoming high free energy barriers usually entails prohibitively long simulation times. Introducing a bias potential as a function of an appropriately chosen set of collective variables can significantly accelerate the exploration of phase space, albeit at the price of distorting the distribution of microstates. Efficient reweighting to recover the unbiased distribution can be nontrivial when employing adaptive sampling techniques such as metadynamics, variationally enhanced sampling, or parallel bias metadynamics, in which the system evolves in a quasi-equilibrium manner under a time-dependent bias. We introduce an iterative unbiasing scheme that makes efficient use of all the trajectory data and that does not require the distribution to be evaluated on a grid. The method can thus be used even when the bias has a high dimensionality. We benchmark this approach against some of the existing schemes on model systems with different complexity and dimensionality."}],"type":"journal_article","doi":"10.1021/acs.jctc.9b00907","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://arxiv.org/abs/1911.01140","open_access":"1"}],"oa":1,"external_id":{"pmid":["31743021"],"arxiv":["1911.01140"]},"quality_controlled":"1","publication_identifier":{"issn":["1549-9618"],"eissn":["1549-9626"]},"month":"01","author":[{"first_name":"F.","last_name":"Giberti","full_name":"Giberti, F."},{"id":"cbe3cda4-d82c-11eb-8dc7-8ff94289fcc9","orcid":"0000-0002-3584-9632","first_name":"Bingqing","last_name":"Cheng","full_name":"Cheng, Bingqing"},{"full_name":"Tribello, G. A.","first_name":"G. A.","last_name":"Tribello"},{"full_name":"Ceriotti, M.","last_name":"Ceriotti","first_name":"M."}],"volume":16,"date_created":"2021-07-19T06:56:45Z","date_updated":"2021-08-09T12:37:37Z","pmid":1,"year":"2019","publisher":"American Chemical Society","publication_status":"published","extern":"1"},{"extern":"1","volume":55,"date_created":"2023-02-20T08:12:59Z","date_updated":"2023-02-28T12:14:18Z","author":[{"first_name":"Marc","last_name":"Girona‐Mata","full_name":"Girona‐Mata, Marc"},{"full_name":"Miles, Evan S.","first_name":"Evan S.","last_name":"Miles"},{"last_name":"Ragettli","first_name":"Silvan","full_name":"Ragettli, Silvan"},{"full_name":"Pellicciotti, Francesca","last_name":"Pellicciotti","first_name":"Francesca","id":"b28f055a-81ea-11ed-b70c-a9fe7f7b0e70"}],"publisher":"American Geophysical Union","publication_status":"published","year":"2019","publication_identifier":{"issn":["0043-1397"],"eissn":["1944-7973"]},"month":"08","language":[{"iso":"eng"}],"doi":"10.1029/2019wr024935","quality_controlled":"1","main_file_link":[{"url":"https://doi.org/10.1029/2019WR024935","open_access":"1"}],"oa":1,"issue":"8","abstract":[{"lang":"eng","text":"The snow cover dynamics of High Mountain Asia are usually assessed at spatial resolutions of 250 m or greater, but this scale is too coarse to clearly represent the rugged topography common to the region. Higher-resolution measurement of snow-covered area often results in biased sampling due to cloud cover and deep shadows. We therefore develop a Normalized Difference Snow Index-based workflow to delineate snow lines from Landsat Thematic Mapper/Enhanced Thematic Mapper+ imagery and apply it to the upper Langtang Valley in Nepal, processing 194 scenes spanning 1999 to 2013. For each scene, we determine the spatial distribution of snow line altitudes (SLAs) with respect to aspect and across six subcatchments. Our results show that the mean SLA exhibits distinct seasonal behavior based on aspect and subcatchment position. We find that SLA dynamics respond to spatial and seasonal trade-offs in precipitation, temperature, and solar radiation, which act as primary controls. We identify two SLA spatial gradients, which we attribute to the effect of spatially variable precipitation. Our results also reveal that aspect-related SLA differences vary seasonally and are influenced by solar radiation. In terms of seasonal dominant controls, we demonstrate that the snow line is controlled by snow precipitation in winter, melt in premonsoon, a combination of both in postmonsoon, and temperature in monsoon, explaining to a large extent the spatial and seasonal variability of the SLA in the upper Langtang Valley. We conclude that while SLA and snow-covered area are complementary metrics, the SLA has a strong potential for understanding local-scale snow cover dynamics and their controlling mechanisms."}],"type":"journal_article","oa_version":"Published Version","intvolume":" 55","status":"public","title":"High‐resolution snowline delineation from Landsat imagery to infer snow cover controls in a Himalayan catchment","_id":"12600","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","day":"01","keyword":["Water Science and Technology"],"scopus_import":"1","date_published":"2019-08-01T00:00:00Z","page":"6754-6772","article_type":"original","citation":{"chicago":"Girona‐Mata, Marc, Evan S. Miles, Silvan Ragettli, and Francesca Pellicciotti. “High‐resolution Snowline Delineation from Landsat Imagery to Infer Snow Cover Controls in a Himalayan Catchment.” Water Resources Research. American Geophysical Union, 2019. https://doi.org/10.1029/2019wr024935.","mla":"Girona‐Mata, Marc, et al. “High‐resolution Snowline Delineation from Landsat Imagery to Infer Snow Cover Controls in a Himalayan Catchment.” Water Resources Research, vol. 55, no. 8, American Geophysical Union, 2019, pp. 6754–72, doi:10.1029/2019wr024935.","short":"M. Girona‐Mata, E.S. Miles, S. Ragettli, F. Pellicciotti, Water Resources Research 55 (2019) 6754–6772.","ista":"Girona‐Mata M, Miles ES, Ragettli S, Pellicciotti F. 2019. High‐resolution snowline delineation from Landsat imagery to infer snow cover controls in a Himalayan catchment. Water Resources Research. 55(8), 6754–6772.","ieee":"M. Girona‐Mata, E. S. Miles, S. Ragettli, and F. Pellicciotti, “High‐resolution snowline delineation from Landsat imagery to infer snow cover controls in a Himalayan catchment,” Water Resources Research, vol. 55, no. 8. American Geophysical Union, pp. 6754–6772, 2019.","apa":"Girona‐Mata, M., Miles, E. S., Ragettli, S., & Pellicciotti, F. (2019). High‐resolution snowline delineation from Landsat imagery to infer snow cover controls in a Himalayan catchment. Water Resources Research. American Geophysical Union. https://doi.org/10.1029/2019wr024935","ama":"Girona‐Mata M, Miles ES, Ragettli S, Pellicciotti F. High‐resolution snowline delineation from Landsat imagery to infer snow cover controls in a Himalayan catchment. Water Resources Research. 2019;55(8):6754-6772. doi:10.1029/2019wr024935"},"publication":"Water Resources Research"},{"publication_status":"published","publisher":"Frontiers Media","year":"2019","date_created":"2023-02-20T08:13:08Z","date_updated":"2023-02-28T12:04:48Z","volume":7,"author":[{"full_name":"Wijngaard, René R.","first_name":"René R.","last_name":"Wijngaard"},{"full_name":"Steiner, Jakob F.","first_name":"Jakob F.","last_name":"Steiner"},{"full_name":"Kraaijenbrink, Philip D. A.","first_name":"Philip D. A.","last_name":"Kraaijenbrink"},{"first_name":"Christoph","last_name":"Klug","full_name":"Klug, Christoph"},{"first_name":"Surendra","last_name":"Adhikari","full_name":"Adhikari, Surendra"},{"full_name":"Banerjee, Argha","last_name":"Banerjee","first_name":"Argha"},{"id":"b28f055a-81ea-11ed-b70c-a9fe7f7b0e70","last_name":"Pellicciotti","first_name":"Francesca","full_name":"Pellicciotti, Francesca"},{"last_name":"van Beek","first_name":"Ludovicus P. H.","full_name":"van Beek, Ludovicus P. H."},{"full_name":"Bierkens, Marc F. P.","first_name":"Marc F. P.","last_name":"Bierkens"},{"first_name":"Arthur F.","last_name":"Lutz","full_name":"Lutz, Arthur F."},{"last_name":"Immerzeel","first_name":"Walter W.","full_name":"Immerzeel, Walter W."}],"article_number":"143","extern":"1","quality_controlled":"1","oa":1,"main_file_link":[{"url":"https://doi.org/10.3389/feart.2019.00143","open_access":"1"}],"language":[{"iso":"eng"}],"doi":"10.3389/feart.2019.00143","month":"06","publication_identifier":{"issn":["2296-6463"]},"title":"Modeling the response of the Langtang Glacier and the Hintereisferner to a changing climate since the Little Ice Age","status":"public","intvolume":" 7","_id":"12602","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","type":"journal_article","abstract":[{"text":"This study aims at developing and applying a spatially-distributed coupled glacier mass balance and ice-flow model to attribute the response of glaciers to natural and anthropogenic climate change. We focus on two glaciers with contrasting surface characteristics: a debris-covered glacier (Langtang Glacier in Nepal) and a clean-ice glacier (Hintereisferner in Austria). The model is applied from the end of the Little Ice Age (1850) to the present-day (2016) and is forced with four bias-corrected General Circulation Models (GCMs) from the historical experiment of the CMIP5 archive. The selected GCMs represent region-specific warm-dry, warm-wet, cold-dry, and cold-wet climate conditions. To isolate the effects of anthropogenic climate change on glacier mass balance and flow runs from these GCMs with and without further anthropogenic forcing after 1970 until 2016 are selected. The outcomes indicate that both glaciers experience the largest reduction in area and volume under warm climate conditions, whereas area and volume reductions are smaller under cold climate conditions. Simultaneously with changes in glacier area and volume, surface velocities generally decrease over time. Without further anthropogenic forcing the results reveal a 3% (9%) smaller decline in glacier area (volume) for the debris-covered glacier and a 18% (39%) smaller decline in glacier area (volume) for the clean-ice glacier. The difference in the magnitude between the two glaciers can mainly be attributed to differences in the response time of the glaciers, where the clean-ice glacier shows a much faster response to climate change. We conclude that the response of the two glaciers can mainly be attributed to anthropogenic climate change and that the impact is larger on the clean-ice glacier. The outcomes show that the model performs well under different climate conditions and that the developed approach can be used for regional-scale glacio-hydrological modeling.","lang":"eng"}],"article_type":"original","publication":"Frontiers in Earth Science","citation":{"chicago":"Wijngaard, René R., Jakob F. Steiner, Philip D. A. Kraaijenbrink, Christoph Klug, Surendra Adhikari, Argha Banerjee, Francesca Pellicciotti, et al. “Modeling the Response of the Langtang Glacier and the Hintereisferner to a Changing Climate since the Little Ice Age.” Frontiers in Earth Science. Frontiers Media, 2019. https://doi.org/10.3389/feart.2019.00143.","mla":"Wijngaard, René R., et al. “Modeling the Response of the Langtang Glacier and the Hintereisferner to a Changing Climate since the Little Ice Age.” Frontiers in Earth Science, vol. 7, 143, Frontiers Media, 2019, doi:10.3389/feart.2019.00143.","short":"R.R. Wijngaard, J.F. Steiner, P.D.A. Kraaijenbrink, C. Klug, S. Adhikari, A. Banerjee, F. Pellicciotti, L.P.H. van Beek, M.F.P. Bierkens, A.F. Lutz, W.W. Immerzeel, Frontiers in Earth Science 7 (2019).","ista":"Wijngaard RR, Steiner JF, Kraaijenbrink PDA, Klug C, Adhikari S, Banerjee A, Pellicciotti F, van Beek LPH, Bierkens MFP, Lutz AF, Immerzeel WW. 2019. Modeling the response of the Langtang Glacier and the Hintereisferner to a changing climate since the Little Ice Age. Frontiers in Earth Science. 7, 143.","ieee":"R. R. Wijngaard et al., “Modeling the response of the Langtang Glacier and the Hintereisferner to a changing climate since the Little Ice Age,” Frontiers in Earth Science, vol. 7. Frontiers Media, 2019.","apa":"Wijngaard, R. R., Steiner, J. F., Kraaijenbrink, P. D. A., Klug, C., Adhikari, S., Banerjee, A., … Immerzeel, W. W. (2019). Modeling the response of the Langtang Glacier and the Hintereisferner to a changing climate since the Little Ice Age. Frontiers in Earth Science. Frontiers Media. https://doi.org/10.3389/feart.2019.00143","ama":"Wijngaard RR, Steiner JF, Kraaijenbrink PDA, et al. Modeling the response of the Langtang Glacier and the Hintereisferner to a changing climate since the Little Ice Age. Frontiers in Earth Science. 2019;7. doi:10.3389/feart.2019.00143"},"date_published":"2019-06-04T00:00:00Z","scopus_import":"1","day":"04","article_processing_charge":"No"},{"extern":"1","year":"2019","publication_status":"published","publisher":"Cambridge University Press","author":[{"last_name":"STEINER","first_name":"JAKOB F.","full_name":"STEINER, JAKOB F."},{"full_name":"BURI, PASCAL","last_name":"BURI","first_name":"PASCAL"},{"first_name":"EVAN S.","last_name":"MILES","full_name":"MILES, EVAN S."},{"first_name":"SILVAN","last_name":"RAGETTLI","full_name":"RAGETTLI, SILVAN"},{"first_name":"Francesca","last_name":"Pellicciotti","id":"b28f055a-81ea-11ed-b70c-a9fe7f7b0e70","full_name":"Pellicciotti, Francesca"}],"date_created":"2023-02-20T08:13:03Z","date_updated":"2023-02-28T12:11:07Z","volume":65,"month":"08","publication_identifier":{"issn":["0022-1430"],"eissn":["1727-5652"]},"main_file_link":[{"url":"https://doi.org/10.1017/jog.2019.40","open_access":"1"}],"oa":1,"quality_controlled":"1","doi":"10.1017/jog.2019.40","language":[{"iso":"eng"}],"type":"journal_article","abstract":[{"lang":"eng","text":"Ice cliffs and ponds on debris-covered glaciers have received increased attention due to their role in amplifying local melt. However, very few studies have looked at these features on the catchment scale to determine their patterns and changes in space and time. We have compiled a detailed inventory of cliffs and ponds in the Langtang catchment, central Himalaya, from six high-resolution satellite orthoimages and DEMs between 2006 and 2015, and a historic orthophoto from 1974. Cliffs cover between 1.4% (± 0.4%) in the dry and 3.4% (± 0.9%) in the wet seasons and ponds between 0.6% (± 0.1%) and 1.6% (± 0.3%) of the total debris-covered tongues. We find large variations between seasons, as cliffs and ponds tend to grow in the wetter monsoon period, but there is no obvious trend in total area over the study period. The inventory further shows that cliffs are predominately north-facing irrespective of the glacier flow direction. Both cliffs and ponds appear in higher densities several hundred metres from the terminus in areas where tributaries reach the main glacier tongue. On the largest glacier in the catchment ~10% of all cliffs and ponds persisted over nearly a decade."}],"issue":"252","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"12601","status":"public","title":"Supraglacial ice cliffs and ponds on debris-covered glaciers: Spatio-temporal distribution and characteristics","intvolume":" 65","oa_version":"Published Version","scopus_import":"1","day":"01","article_processing_charge":"No","publication":"Journal of Glaciology","citation":{"short":"J.F. STEINER, P. BURI, E.S. MILES, S. RAGETTLI, F. Pellicciotti, Journal of Glaciology 65 (2019) 617–632.","mla":"STEINER, JAKOB F., et al. “Supraglacial Ice Cliffs and Ponds on Debris-Covered Glaciers: Spatio-Temporal Distribution and Characteristics.” Journal of Glaciology, vol. 65, no. 252, Cambridge University Press, 2019, pp. 617–32, doi:10.1017/jog.2019.40.","chicago":"STEINER, JAKOB F., PASCAL BURI, EVAN S. MILES, SILVAN RAGETTLI, and Francesca Pellicciotti. “Supraglacial Ice Cliffs and Ponds on Debris-Covered Glaciers: Spatio-Temporal Distribution and Characteristics.” Journal of Glaciology. Cambridge University Press, 2019. https://doi.org/10.1017/jog.2019.40.","ama":"STEINER JF, BURI P, MILES ES, RAGETTLI S, Pellicciotti F. Supraglacial ice cliffs and ponds on debris-covered glaciers: Spatio-temporal distribution and characteristics. Journal of Glaciology. 2019;65(252):617-632. doi:10.1017/jog.2019.40","apa":"STEINER, J. F., BURI, P., MILES, E. S., RAGETTLI, S., & Pellicciotti, F. (2019). Supraglacial ice cliffs and ponds on debris-covered glaciers: Spatio-temporal distribution and characteristics. Journal of Glaciology. Cambridge University Press. https://doi.org/10.1017/jog.2019.40","ieee":"J. F. STEINER, P. BURI, E. S. MILES, S. RAGETTLI, and F. Pellicciotti, “Supraglacial ice cliffs and ponds on debris-covered glaciers: Spatio-temporal distribution and characteristics,” Journal of Glaciology, vol. 65, no. 252. Cambridge University Press, pp. 617–632, 2019.","ista":"STEINER JF, BURI P, MILES ES, RAGETTLI S, Pellicciotti F. 2019. Supraglacial ice cliffs and ponds on debris-covered glaciers: Spatio-temporal distribution and characteristics. Journal of Glaciology. 65(252), 617–632."},"article_type":"original","page":"617-632","date_published":"2019-08-01T00:00:00Z"}]