[{"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"conference":{"name":"CAV: Computer Aided Verification"},"type":"conference","status":"public","_id":"8272","department":[{"_id":"KrCh"}],"file_date_updated":"2020-08-17T11:32:44Z","date_updated":"2023-10-03T11:36:13Z","ddc":["000"],"alternative_title":["LNCS"],"scopus_import":"1","intvolume":" 12225","month":"07","abstract":[{"text":"We study turn-based stochastic zero-sum games with lexicographic preferences over reachability and safety objectives. Stochastic games are standard models in control, verification, and synthesis of stochastic reactive systems that exhibit both randomness as well as angelic and demonic non-determinism. Lexicographic order allows to consider multiple objectives with a strict preference order over the satisfaction of the objectives. To the best of our knowledge, stochastic games with lexicographic objectives have not been studied before. We establish determinacy of such games and present strategy and computational complexity results. For strategy complexity, we show that lexicographically optimal strategies exist that are deterministic and memory is only required to remember the already satisfied and violated objectives. For a constant number of objectives, we show that the relevant decision problem is in NP∩coNP , matching the current known bound for single objectives; and in general the decision problem is PSPACE -hard and can be solved in NEXPTIME∩coNEXPTIME . We present an algorithm that computes the lexicographically optimal strategies via a reduction to computation of optimal strategies in a sequence of single-objectives games. We have implemented our algorithm and report experimental results on various case studies.","lang":"eng"}],"oa_version":"Published Version","ec_funded":1,"volume":12225,"related_material":{"record":[{"relation":"later_version","id":"12738","status":"public"}]},"publication_status":"published","publication_identifier":{"issn":["03029743"],"eissn":["16113349"],"isbn":["9783030532901"]},"language":[{"iso":"eng"}],"file":[{"file_name":"2020_LNCS_CAV_Chatterjee.pdf","date_created":"2020-08-17T11:32:44Z","file_size":625056,"date_updated":"2020-08-17T11:32:44Z","creator":"dernst","success":1,"checksum":"093d4788d7d5b2ce0ffe64fbe7820043","file_id":"8276","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020"},{"grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425"}],"external_id":{"isi":["000695272500021"],"arxiv":["2005.04018"]},"article_processing_charge":"No","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"last_name":"Katoen","full_name":"Katoen, Joost P","first_name":"Joost P","id":"4524F760-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Weininger, Maximilian","last_name":"Weininger","first_name":"Maximilian"},{"full_name":"Winkler, Tobias","last_name":"Winkler","first_name":"Tobias"}],"title":"Stochastic games with lexicographic reachability-safety objectives","citation":{"chicago":"Chatterjee, Krishnendu, Joost P Katoen, Maximilian Weininger, and Tobias Winkler. “Stochastic Games with Lexicographic Reachability-Safety Objectives.” In International Conference on Computer Aided Verification, 12225:398–420. Springer Nature, 2020. https://doi.org/10.1007/978-3-030-53291-8_21.","ista":"Chatterjee K, Katoen JP, Weininger M, Winkler T. 2020. Stochastic games with lexicographic reachability-safety objectives. International Conference on Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 12225, 398–420.","mla":"Chatterjee, Krishnendu, et al. “Stochastic Games with Lexicographic Reachability-Safety Objectives.” International Conference on Computer Aided Verification, vol. 12225, Springer Nature, 2020, pp. 398–420, doi:10.1007/978-3-030-53291-8_21.","ama":"Chatterjee K, Katoen JP, Weininger M, Winkler T. Stochastic games with lexicographic reachability-safety objectives. In: International Conference on Computer Aided Verification. Vol 12225. Springer Nature; 2020:398-420. doi:10.1007/978-3-030-53291-8_21","apa":"Chatterjee, K., Katoen, J. P., Weininger, M., & Winkler, T. (2020). Stochastic games with lexicographic reachability-safety objectives. In International Conference on Computer Aided Verification (Vol. 12225, pp. 398–420). Springer Nature. https://doi.org/10.1007/978-3-030-53291-8_21","ieee":"K. Chatterjee, J. P. Katoen, M. Weininger, and T. Winkler, “Stochastic games with lexicographic reachability-safety objectives,” in International Conference on Computer Aided Verification, 2020, vol. 12225, pp. 398–420.","short":"K. Chatterjee, J.P. Katoen, M. Weininger, T. Winkler, in:, International Conference on Computer Aided Verification, Springer Nature, 2020, pp. 398–420."},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","oa":1,"quality_controlled":"1","publisher":"Springer Nature","page":"398-420","date_created":"2020-08-16T22:00:58Z","doi":"10.1007/978-3-030-53291-8_21","date_published":"2020-07-14T00:00:00Z","year":"2020","has_accepted_license":"1","isi":1,"publication":"International Conference on Computer Aided Verification","day":"14"},{"ec_funded":1,"related_material":{"record":[{"id":"8358","status":"public","relation":"part_of_dissertation"}]},"volume":158,"publication_status":"published","publication_identifier":{"issn":["0091679X"]},"language":[{"iso":"eng"}],"main_file_link":[{"url":"https://doi.org/10.1101/839571","open_access":"1"}],"alternative_title":["Methods in Cell Biology"],"scopus_import":"1","intvolume":" 158","month":"02","abstract":[{"text":"The polymerization–depolymerization dynamics of cytoskeletal proteins play essential roles in the self-organization of cytoskeletal structures, in eukaryotic as well as prokaryotic cells. While advances in fluorescence microscopy and in vitro reconstitution experiments have helped to study the dynamic properties of these complex systems, methods that allow to collect and analyze large quantitative datasets of the underlying polymer dynamics are still missing. Here, we present a novel image analysis workflow to study polymerization dynamics of active filaments in a nonbiased, highly automated manner. Using treadmilling filaments of the bacterial tubulin FtsZ as an example, we demonstrate that our method is able to specifically detect, track and analyze growth and shrinkage of polymers, even in dense networks of filaments. We believe that this automated method can facilitate the analysis of a large variety of dynamic cytoskeletal systems, using standard time-lapse movies obtained from experiments in vitro as well as in the living cell. Moreover, we provide scripts implementing this method as supplementary material.","lang":"eng"}],"oa_version":"Preprint","department":[{"_id":"MaLo"}],"date_updated":"2023-10-04T09:50:24Z","type":"book_chapter","status":"public","_id":"7572","page":"145-161","date_created":"2020-03-08T23:00:47Z","doi":"10.1016/bs.mcb.2020.01.006","date_published":"2020-02-27T00:00:00Z","year":"2020","isi":1,"publication":"Methods in Cell Biology","day":"27","oa":1,"quality_controlled":"1","publisher":"Elsevier","article_processing_charge":"No","external_id":{"isi":["000611826500008"]},"author":[{"last_name":"Dos Santos Caldas","full_name":"Dos Santos Caldas, Paulo R","orcid":"0000-0001-6730-4461","id":"38FCDB4C-F248-11E8-B48F-1D18A9856A87","first_name":"Paulo R"},{"first_name":"Philipp","id":"40136C2A-F248-11E8-B48F-1D18A9856A87","full_name":"Radler, Philipp","orcid":"0000-0001-9198-2182 ","last_name":"Radler"},{"orcid":"0000-0003-1216-9105","full_name":"Sommer, Christoph M","last_name":"Sommer","id":"4DF26D8C-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph M"},{"first_name":"Martin","id":"462D4284-F248-11E8-B48F-1D18A9856A87","last_name":"Loose","orcid":"0000-0001-7309-9724","full_name":"Loose, Martin"}],"editor":[{"first_name":"Phong ","full_name":"Tran, Phong ","last_name":"Tran"}],"title":"Computational analysis of filament polymerization dynamics in cytoskeletal networks","citation":{"ama":"Dos Santos Caldas PR, Radler P, Sommer CM, Loose M. Computational analysis of filament polymerization dynamics in cytoskeletal networks. In: Tran P, ed. Methods in Cell Biology. Vol 158. Elsevier; 2020:145-161. doi:10.1016/bs.mcb.2020.01.006","apa":"Dos Santos Caldas, P. R., Radler, P., Sommer, C. M., & Loose, M. (2020). Computational analysis of filament polymerization dynamics in cytoskeletal networks. In P. Tran (Ed.), Methods in Cell Biology (Vol. 158, pp. 145–161). Elsevier. https://doi.org/10.1016/bs.mcb.2020.01.006","ieee":"P. R. Dos Santos Caldas, P. Radler, C. M. Sommer, and M. Loose, “Computational analysis of filament polymerization dynamics in cytoskeletal networks,” in Methods in Cell Biology, vol. 158, P. Tran, Ed. Elsevier, 2020, pp. 145–161.","short":"P.R. Dos Santos Caldas, P. Radler, C.M. Sommer, M. Loose, in:, P. Tran (Ed.), Methods in Cell Biology, Elsevier, 2020, pp. 145–161.","mla":"Dos Santos Caldas, Paulo R., et al. “Computational Analysis of Filament Polymerization Dynamics in Cytoskeletal Networks.” Methods in Cell Biology, edited by Phong Tran, vol. 158, Elsevier, 2020, pp. 145–61, doi:10.1016/bs.mcb.2020.01.006.","ista":"Dos Santos Caldas PR, Radler P, Sommer CM, Loose M. 2020.Computational analysis of filament polymerization dynamics in cytoskeletal networks. In: Methods in Cell Biology. Methods in Cell Biology, vol. 158, 145–161.","chicago":"Dos Santos Caldas, Paulo R, Philipp Radler, Christoph M Sommer, and Martin Loose. “Computational Analysis of Filament Polymerization Dynamics in Cytoskeletal Networks.” In Methods in Cell Biology, edited by Phong Tran, 158:145–61. Elsevier, 2020. https://doi.org/10.1016/bs.mcb.2020.01.006."},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","project":[{"name":"Self-Organization of the Bacterial Cell","grant_number":"679239","_id":"2595697A-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"name":"Reconstitution of Bacterial Cell Division Using Purified Components","_id":"260D98C8-B435-11E9-9278-68D0E5697425"}]},{"author":[{"orcid":"0000-0002-3086-9124","full_name":"Baranova, Natalia S.","last_name":"Baranova","first_name":"Natalia S.","id":"38661662-F248-11E8-B48F-1D18A9856A87"},{"id":"40136C2A-F248-11E8-B48F-1D18A9856A87","first_name":"Philipp","orcid":"0000-0001-9198-2182 ","full_name":"Radler, Philipp","last_name":"Radler"},{"full_name":"Hernández-Rocamora, Víctor M.","last_name":"Hernández-Rocamora","first_name":"Víctor M."},{"full_name":"Alfonso, Carlos","last_name":"Alfonso","first_name":"Carlos"},{"last_name":"Lopez Pelegrin","full_name":"Lopez Pelegrin, Maria D","id":"319AA9CE-F248-11E8-B48F-1D18A9856A87","first_name":"Maria D"},{"first_name":"Germán","full_name":"Rivas, Germán","last_name":"Rivas"},{"full_name":"Vollmer, Waldemar","last_name":"Vollmer","first_name":"Waldemar"},{"last_name":"Loose","orcid":"0000-0001-7309-9724","full_name":"Loose, Martin","first_name":"Martin","id":"462D4284-F248-11E8-B48F-1D18A9856A87"}],"article_processing_charge":"No","external_id":{"pmid":["31959972"],"isi":["000508584700007"]},"title":"Diffusion and capture permits dynamic coupling between treadmilling FtsZ filaments and cell division proteins","citation":{"ista":"Baranova NS, Radler P, Hernández-Rocamora VM, Alfonso C, Lopez Pelegrin MD, Rivas G, Vollmer W, Loose M. 2020. Diffusion and capture permits dynamic coupling between treadmilling FtsZ filaments and cell division proteins. Nature Microbiology. 5, 407–417.","chicago":"Baranova, Natalia S., Philipp Radler, Víctor M. Hernández-Rocamora, Carlos Alfonso, Maria D Lopez Pelegrin, Germán Rivas, Waldemar Vollmer, and Martin Loose. “Diffusion and Capture Permits Dynamic Coupling between Treadmilling FtsZ Filaments and Cell Division Proteins.” Nature Microbiology. Springer Nature, 2020. https://doi.org/10.1038/s41564-019-0657-5.","ama":"Baranova NS, Radler P, Hernández-Rocamora VM, et al. Diffusion and capture permits dynamic coupling between treadmilling FtsZ filaments and cell division proteins. Nature Microbiology. 2020;5:407-417. doi:10.1038/s41564-019-0657-5","apa":"Baranova, N. S., Radler, P., Hernández-Rocamora, V. M., Alfonso, C., Lopez Pelegrin, M. D., Rivas, G., … Loose, M. (2020). Diffusion and capture permits dynamic coupling between treadmilling FtsZ filaments and cell division proteins. Nature Microbiology. Springer Nature. https://doi.org/10.1038/s41564-019-0657-5","ieee":"N. S. Baranova et al., “Diffusion and capture permits dynamic coupling between treadmilling FtsZ filaments and cell division proteins,” Nature Microbiology, vol. 5. Springer Nature, pp. 407–417, 2020.","short":"N.S. Baranova, P. Radler, V.M. Hernández-Rocamora, C. Alfonso, M.D. Lopez Pelegrin, G. Rivas, W. Vollmer, M. Loose, Nature Microbiology 5 (2020) 407–417.","mla":"Baranova, Natalia S., et al. “Diffusion and Capture Permits Dynamic Coupling between Treadmilling FtsZ Filaments and Cell Division Proteins.” Nature Microbiology, vol. 5, Springer Nature, 2020, pp. 407–17, doi:10.1038/s41564-019-0657-5."},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","project":[{"_id":"2595697A-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"679239","name":"Self-Organization of the Bacterial Cell"},{"grant_number":"LT000824/2016","name":"Reconstitution of bacterial cell wall sythesis","_id":"259B655A-B435-11E9-9278-68D0E5697425"},{"name":"Synthesis of bacterial cell wall","grant_number":"ALTF 2015-1163","_id":"2596EAB6-B435-11E9-9278-68D0E5697425"}],"page":"407-417","date_published":"2020-01-20T00:00:00Z","doi":"10.1038/s41564-019-0657-5","date_created":"2020-01-28T16:14:41Z","isi":1,"year":"2020","day":"20","publication":"Nature Microbiology","quality_controlled":"1","publisher":"Springer Nature","oa":1,"acknowledgement":"We acknowledge members of the Loose laboratory at IST Austria for helpful discussions—in particular, P. Caldas for help with the treadmilling analysis, M. Jimenez, A. Raso and N. Ropero for providing Alexa Fluor 488- and Alexa Fluor 647-labelled FtsA for the MST and analytical ultracentrifugation experiments. We thank C. You for providing the DODA-tris-NTA phospholipids, as well as J. Piehler and C. Richter (Department of Biology, University of Osnabruck, Germany) for the SLIMfast single-molecule tracking software and help with the confinement analysis. We thank J. Errington and H. Murray (both at Newcastle University, UK) for critical reading of the manuscript, and J. Brugués (MPI-CBG and MPI-PKS, Dresden, Germany) for help with the MATLAB programming and reading of the manuscript. This work was supported by the European Research Council through grant ERC-2015-StG-679239 to M.L. and grants HFSP LT 000824/2016-L4 and EMBO ALTF 1163-2015 to N.B., a grant from the Ministry of Economy and Competitiveness of the Spanish Government (BFU2016-75471-C2-1-P) to C.A. and G.R., and a Wellcome Trust Senior Investigator award (101824/Z/13/Z) and a grant from the BBSRC (BB/R017409/1) to W.V.","department":[{"_id":"MaLo"}],"date_updated":"2023-10-06T12:22:38Z","article_type":"letter_note","type":"journal_article","status":"public","_id":"7387","volume":5,"related_material":{"record":[{"id":"14280","status":"public","relation":"dissertation_contains"}],"link":[{"description":"News on IST Homepage","relation":"press_release","url":"https://ist.ac.at/en/news/little-cell-big-cover-story/"}]},"ec_funded":1,"publication_identifier":{"issn":["2058-5276"]},"publication_status":"published","language":[{"iso":"eng"}],"scopus_import":"1","main_file_link":[{"url":"http://europepmc.org/article/PMC/7048620","open_access":"1"}],"month":"01","intvolume":" 5","abstract":[{"lang":"eng","text":"Most bacteria accomplish cell division with the help of a dynamic protein complex called the divisome, which spans the cell envelope in the plane of division. Assembly and activation of this machinery are coordinated by the tubulin-related GTPase FtsZ, which was found to form treadmilling filaments on supported bilayers in vitro1, as well as in live cells, in which filaments circle around the cell division site2,3. Treadmilling of FtsZ is thought to actively move proteins around the division septum, thereby distributing peptidoglycan synthesis and coordinating the inward growth of the septum to form the new poles of the daughter cells4. However, the molecular mechanisms underlying this function are largely unknown. Here, to study how FtsZ polymerization dynamics are coupled to downstream proteins, we reconstituted part of the bacterial cell division machinery using its purified components FtsZ, FtsA and truncated transmembrane proteins essential for cell division. We found that the membrane-bound cytosolic peptides of FtsN and FtsQ co-migrated with treadmilling FtsZ–FtsA filaments, but despite their directed collective behaviour, individual peptides showed random motion and transient confinement. Our work suggests that divisome proteins follow treadmilling FtsZ filaments by a diffusion-and-capture mechanism, which can give rise to a moving zone of signalling activity at the division site."}],"oa_version":"Submitted Version","pmid":1},{"file_date_updated":"2020-07-24T07:09:06Z","department":[{"_id":"HeEd"}],"ddc":["510"],"date_updated":"2023-10-10T13:05:27Z","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","short":"CC BY-NC (4.0)"},"article_type":"original","type":"journal_article","_id":"8163","ec_funded":1,"issue":"2","volume":57,"language":[{"iso":"eng"}],"file":[{"date_created":"2020-07-24T07:09:06Z","file_name":"57-2-05_4214-1454Vegter-Wintraecken_OpenAccess_CC-BY-NC.pdf","date_updated":"2020-07-24T07:09:06Z","file_size":1476072,"creator":"mwintrae","file_id":"8164","content_type":"application/pdf","access_level":"open_access","relation":"main_file"}],"publication_status":"published","publication_identifier":{"eissn":["1588-2896"],"issn":["0081-6906"]},"intvolume":" 57","month":"07","scopus_import":"1","oa_version":"Published Version","abstract":[{"lang":"eng","text":"Fejes Tóth [3] studied approximations of smooth surfaces in three-space by piecewise flat triangular meshes with a given number of vertices on the surface that are optimal with respect to Hausdorff distance. He proves that this Hausdorff distance decreases inversely proportional with the number of vertices of the approximating mesh if the surface is convex. He also claims that this Hausdorff distance is inversely proportional to the square of the number of vertices for a specific non-convex surface, namely a one-sheeted hyperboloid of revolution bounded by two congruent circles. We refute this claim, and show that the asymptotic behavior of the Hausdorff distance is linear, that is the same as for convex surfaces."}],"title":"Refutation of a claim made by Fejes Tóth on the accuracy of surface meshes","article_processing_charge":"No","external_id":{"isi":["000570978400005"]},"author":[{"full_name":"Vegter, Gert","last_name":"Vegter","first_name":"Gert"},{"first_name":"Mathijs","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","last_name":"Wintraecken","full_name":"Wintraecken, Mathijs","orcid":"0000-0002-7472-2220"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Vegter, Gert, and Mathijs Wintraecken. “Refutation of a Claim Made by Fejes Tóth on the Accuracy of Surface Meshes.” Studia Scientiarum Mathematicarum Hungarica, vol. 57, no. 2, Akadémiai Kiadó, 2020, pp. 193–99, doi:10.1556/012.2020.57.2.1454.","short":"G. Vegter, M. Wintraecken, Studia Scientiarum Mathematicarum Hungarica 57 (2020) 193–199.","ieee":"G. Vegter and M. Wintraecken, “Refutation of a claim made by Fejes Tóth on the accuracy of surface meshes,” Studia Scientiarum Mathematicarum Hungarica, vol. 57, no. 2. Akadémiai Kiadó, pp. 193–199, 2020.","ama":"Vegter G, Wintraecken M. Refutation of a claim made by Fejes Tóth on the accuracy of surface meshes. Studia Scientiarum Mathematicarum Hungarica. 2020;57(2):193-199. doi:10.1556/012.2020.57.2.1454","apa":"Vegter, G., & Wintraecken, M. (2020). Refutation of a claim made by Fejes Tóth on the accuracy of surface meshes. Studia Scientiarum Mathematicarum Hungarica. Akadémiai Kiadó. https://doi.org/10.1556/012.2020.57.2.1454","chicago":"Vegter, Gert, and Mathijs Wintraecken. “Refutation of a Claim Made by Fejes Tóth on the Accuracy of Surface Meshes.” Studia Scientiarum Mathematicarum Hungarica. Akadémiai Kiadó, 2020. https://doi.org/10.1556/012.2020.57.2.1454.","ista":"Vegter G, Wintraecken M. 2020. Refutation of a claim made by Fejes Tóth on the accuracy of surface meshes. Studia Scientiarum Mathematicarum Hungarica. 57(2), 193–199."},"project":[{"call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships"},{"name":"The Wittgenstein Prize","grant_number":"Z00342","call_identifier":"FWF","_id":"268116B8-B435-11E9-9278-68D0E5697425"}],"date_created":"2020-07-24T07:09:18Z","date_published":"2020-07-24T00:00:00Z","doi":"10.1556/012.2020.57.2.1454","page":"193-199","publication":"Studia Scientiarum Mathematicarum Hungarica","day":"24","year":"2020","has_accepted_license":"1","isi":1,"oa":1,"quality_controlled":"1","publisher":"Akadémiai Kiadó","acknowledgement":"The authors are greatly indebted to Dror Atariah, Günther Rote and John Sullivan for discussion and suggestions. The authors also thank Jean-Daniel Boissonnat, Ramsay Dyer, David de Laat and Rien van de Weijgaert for discussion. This work has been supported in part by the European Union’s Seventh Framework Programme for Research of the\r\nEuropean Commission, under FET-Open grant number 255827 (CGL Computational Geometry Learning) and ERC Grant Agreement number 339025 GUDHI (Algorithmic Foundations of Geometry Understanding in Higher Dimensions), the European Union’s Horizon 2020 research and innovation programme under the Marie Sk lodowska-Curie grant agreement number 754411,and the Austrian Science Fund (FWF): Z00342 N31."},{"external_id":{"arxiv":["1805.10672"]},"article_processing_charge":"No","author":[{"first_name":"A.","last_name":"Shakiba","full_name":"Shakiba, A."},{"orcid":"0000-0003-1702-6584","full_name":"Goharshady, Amir Kafshdar","last_name":"Goharshady","id":"391365CE-F248-11E8-B48F-1D18A9856A87","first_name":"Amir Kafshdar"},{"last_name":"Hooshmandasl","full_name":"Hooshmandasl, M.R.","first_name":"M.R."},{"first_name":"M.","full_name":"Alambardar Meybodi, M.","last_name":"Alambardar Meybodi"}],"title":"A note on belief structures and s-approximation spaces","citation":{"chicago":"Shakiba, A., Amir Kafshdar Goharshady, M.R. Hooshmandasl, and M. Alambardar Meybodi. “A Note on Belief Structures and S-Approximation Spaces.” Iranian Journal of Mathematical Sciences and Informatics. Iranian Academic Center for Education, Culture and Research, 2020. https://doi.org/10.29252/ijmsi.15.2.117.","ista":"Shakiba A, Goharshady AK, Hooshmandasl MR, Alambardar Meybodi M. 2020. A note on belief structures and s-approximation spaces. Iranian Journal of Mathematical Sciences and Informatics. 15(2), 117–128.","mla":"Shakiba, A., et al. “A Note on Belief Structures and S-Approximation Spaces.” Iranian Journal of Mathematical Sciences and Informatics, vol. 15, no. 2, Iranian Academic Center for Education, Culture and Research, 2020, pp. 117–28, doi:10.29252/ijmsi.15.2.117.","ama":"Shakiba A, Goharshady AK, Hooshmandasl MR, Alambardar Meybodi M. A note on belief structures and s-approximation spaces. Iranian Journal of Mathematical Sciences and Informatics. 2020;15(2):117-128. doi:10.29252/ijmsi.15.2.117","apa":"Shakiba, A., Goharshady, A. K., Hooshmandasl, M. R., & Alambardar Meybodi, M. (2020). A note on belief structures and s-approximation spaces. Iranian Journal of Mathematical Sciences and Informatics. Iranian Academic Center for Education, Culture and Research. https://doi.org/10.29252/ijmsi.15.2.117","ieee":"A. Shakiba, A. K. Goharshady, M. R. Hooshmandasl, and M. Alambardar Meybodi, “A note on belief structures and s-approximation spaces,” Iranian Journal of Mathematical Sciences and Informatics, vol. 15, no. 2. Iranian Academic Center for Education, Culture and Research, pp. 117–128, 2020.","short":"A. Shakiba, A.K. Goharshady, M.R. Hooshmandasl, M. Alambardar Meybodi, Iranian Journal of Mathematical Sciences and Informatics 15 (2020) 117–128."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"_id":"267066CE-B435-11E9-9278-68D0E5697425","name":"Quantitative Analysis of Probablistic Systems with a focus on Crypto-currencies"}],"page":"117-128","date_created":"2020-10-18T22:01:36Z","date_published":"2020-10-01T00:00:00Z","doi":"10.29252/ijmsi.15.2.117","year":"2020","has_accepted_license":"1","publication":"Iranian Journal of Mathematical Sciences and Informatics","day":"01","oa":1,"publisher":"Iranian Academic Center for Education, Culture and Research","quality_controlled":"1","acknowledgement":"We are very grateful to the anonymous reviewer for detailed comments and suggestions that significantly improved the presentation of this paper. The research was partially supported by a DOC fellowship of the Austrian Academy of Sciences.","file_date_updated":"2020-10-19T11:14:20Z","department":[{"_id":"KrCh"}],"date_updated":"2023-10-16T09:25:00Z","ddc":["000"],"type":"journal_article","article_type":"original","status":"public","_id":"8671","volume":15,"issue":"2","publication_status":"published","publication_identifier":{"eissn":["2008-9473"],"issn":["1735-4463"]},"language":[{"iso":"eng"}],"file":[{"date_created":"2020-10-19T11:14:20Z","file_name":"2020_ijmsi_Shakiba_accepted.pdf","creator":"dernst","date_updated":"2020-10-19T11:14:20Z","file_size":261688,"file_id":"8676","checksum":"f299661a6d51cda6d255a76be696f48d","success":1,"access_level":"open_access","relation":"main_file","content_type":"application/pdf"}],"scopus_import":"1","intvolume":" 15","month":"10","abstract":[{"text":"We study relations between evidence theory and S-approximation spaces. Both theories have their roots in the analysis of Dempsterchr('39')s multivalued mappings and lower and upper probabilities, and have close relations to rough sets. We show that an S-approximation space, satisfying a monotonicity condition, can induce a natural belief structure which is a fundamental block in evidence theory. We also demonstrate that one can induce a natural belief structure on one set, given a belief structure on another set, if the two sets are related by a partial monotone S-approximation space. ","lang":"eng"}],"oa_version":"Submitted Version"},{"intvolume":" 25","month":"07","scopus_import":"1","oa_version":"Published Version","abstract":[{"text":"The strong rate of convergence of the Euler-Maruyama scheme for nondegenerate SDEs with irregular drift coefficients is considered. In the case of α-Hölder drift in the recent literature the rate α/2 was proved in many related situations. By exploiting the regularising effect of the noise more efficiently, we show that the rate is in fact arbitrarily close to 1/2 for all α>0. The result extends to Dini continuous coefficients, while in d=1 also to all bounded measurable coefficients.","lang":"eng"}],"volume":25,"language":[{"iso":"eng"}],"file":[{"checksum":"8e7c42e72596f6889d786e8e8b89994f","file_id":"8549","success":1,"content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2020-09-21T13:15:02Z","file_name":"2020_EJournProbab_Dareiotis.pdf","date_updated":"2020-09-21T13:15:02Z","file_size":273042,"creator":"dernst"}],"publication_status":"published","publication_identifier":{"eissn":["1083-6489"]},"status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"article_type":"original","type":"journal_article","_id":"6359","file_date_updated":"2020-09-21T13:15:02Z","department":[{"_id":"JaMa"}],"ddc":["510"],"date_updated":"2023-10-16T09:22:50Z","oa":1,"quality_controlled":"1","publisher":"Institute of Mathematical Statistics","date_created":"2019-04-30T07:40:17Z","date_published":"2020-07-16T00:00:00Z","doi":"10.1214/20-EJP479","publication":"Electronic Journal of Probability","day":"16","year":"2020","has_accepted_license":"1","isi":1,"article_number":"82","title":"On the regularisation of the noise for the Euler-Maruyama scheme with irregular drift","article_processing_charge":"No","external_id":{"arxiv":["1812.04583"],"isi":["000550150700001"]},"author":[{"last_name":"Dareiotis","full_name":"Dareiotis, Konstantinos","first_name":"Konstantinos"},{"last_name":"Gerencser","full_name":"Gerencser, Mate","first_name":"Mate","id":"44ECEDF2-F248-11E8-B48F-1D18A9856A87"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Dareiotis K, Gerencser M. 2020. On the regularisation of the noise for the Euler-Maruyama scheme with irregular drift. Electronic Journal of Probability. 25, 82.","chicago":"Dareiotis, Konstantinos, and Mate Gerencser. “On the Regularisation of the Noise for the Euler-Maruyama Scheme with Irregular Drift.” Electronic Journal of Probability. Institute of Mathematical Statistics, 2020. https://doi.org/10.1214/20-EJP479.","ama":"Dareiotis K, Gerencser M. On the regularisation of the noise for the Euler-Maruyama scheme with irregular drift. Electronic Journal of Probability. 2020;25. doi:10.1214/20-EJP479","apa":"Dareiotis, K., & Gerencser, M. (2020). On the regularisation of the noise for the Euler-Maruyama scheme with irregular drift. Electronic Journal of Probability. Institute of Mathematical Statistics. https://doi.org/10.1214/20-EJP479","ieee":"K. Dareiotis and M. Gerencser, “On the regularisation of the noise for the Euler-Maruyama scheme with irregular drift,” Electronic Journal of Probability, vol. 25. Institute of Mathematical Statistics, 2020.","short":"K. Dareiotis, M. Gerencser, Electronic Journal of Probability 25 (2020).","mla":"Dareiotis, Konstantinos, and Mate Gerencser. “On the Regularisation of the Noise for the Euler-Maruyama Scheme with Irregular Drift.” Electronic Journal of Probability, vol. 25, 82, Institute of Mathematical Statistics, 2020, doi:10.1214/20-EJP479."}},{"publisher":"Institute of Science and Technology Austria","oa":1,"acknowledgement":"Last but not least, I would like to acknowledge the support of the IST IT and scientific computing team for helping provide a great work environment.","doi":"10.15479/AT:ISTA:8390","date_published":"2020-09-14T00:00:00Z","date_created":"2020-09-14T13:42:09Z","page":"197","day":"14","has_accepted_license":"1","year":"2020","title":"Leveraging structure in Computer Vision tasks for flexible Deep Learning models","author":[{"id":"3811D890-F248-11E8-B48F-1D18A9856A87","first_name":"Amélie","last_name":"Royer","orcid":"0000-0002-8407-0705","full_name":"Royer, Amélie"}],"article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ista":"Royer A. 2020. Leveraging structure in Computer Vision tasks for flexible Deep Learning models. Institute of Science and Technology Austria.","chicago":"Royer, Amélie. “Leveraging Structure in Computer Vision Tasks for Flexible Deep Learning Models.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:8390.","ieee":"A. Royer, “Leveraging structure in Computer Vision tasks for flexible Deep Learning models,” Institute of Science and Technology Austria, 2020.","short":"A. Royer, Leveraging Structure in Computer Vision Tasks for Flexible Deep Learning Models, Institute of Science and Technology Austria, 2020.","ama":"Royer A. Leveraging structure in Computer Vision tasks for flexible Deep Learning models. 2020. doi:10.15479/AT:ISTA:8390","apa":"Royer, A. (2020). Leveraging structure in Computer Vision tasks for flexible Deep Learning models. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:8390","mla":"Royer, Amélie. Leveraging Structure in Computer Vision Tasks for Flexible Deep Learning Models. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:8390."},"month":"09","alternative_title":["ISTA Thesis"],"oa_version":"Published Version","abstract":[{"text":"Deep neural networks have established a new standard for data-dependent feature extraction pipelines in the Computer Vision literature. Despite their remarkable performance in the standard supervised learning scenario, i.e. when models are trained with labeled data and tested on samples that follow a similar distribution, neural networks have been shown to struggle with more advanced generalization abilities, such as transferring knowledge across visually different domains, or generalizing to new unseen combinations of known concepts. In this thesis we argue that, in contrast to the usual black-box behavior of neural networks, leveraging more structured internal representations is a promising direction\r\nfor tackling such problems. In particular, we focus on two forms of structure. First, we tackle modularity: We show that (i) compositional architectures are a natural tool for modeling reasoning tasks, in that they efficiently capture their combinatorial nature, which is key for generalizing beyond the compositions seen during training. We investigate how to to learn such models, both formally and experimentally, for the task of abstract visual reasoning. Then, we show that (ii) in some settings, modularity allows us to efficiently break down complex tasks into smaller, easier, modules, thereby improving computational efficiency; We study this behavior in the context of generative models for colorization, as well as for small objects detection. Secondly, we investigate the inherently layered structure of representations learned by neural networks, and analyze its role in the context of transfer learning and domain adaptation across visually\r\ndissimilar domains. ","lang":"eng"}],"acknowledged_ssus":[{"_id":"CampIT"},{"_id":"ScienComp"}],"related_material":{"record":[{"id":"7936","status":"public","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"7937"},{"relation":"part_of_dissertation","status":"public","id":"8193"},{"relation":"part_of_dissertation","status":"public","id":"8092"},{"relation":"part_of_dissertation","id":"911","status":"public"}]},"file":[{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","success":1,"checksum":"c914d2f88846032f3d8507734861b6ee","file_id":"8391","creator":"dernst","file_size":30224591,"date_updated":"2020-09-14T13:39:14Z","file_name":"2020_Thesis_Royer.pdf","date_created":"2020-09-14T13:39:14Z"},{"creator":"dernst","date_updated":"2020-09-14T13:39:17Z","file_size":74227627,"date_created":"2020-09-14T13:39:17Z","file_name":"thesis_sources.zip","access_level":"closed","relation":"main_file","content_type":"application/x-zip-compressed","checksum":"ae98fb35d912cff84a89035ae5794d3c","file_id":"8392"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["2663-337X"],"isbn":["978-3-99078-007-7"]},"degree_awarded":"PhD","publication_status":"published","status":"public","type":"dissertation","tmp":{"name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","image":"/images/cc_by_nc_sa.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","short":"CC BY-NC-SA (4.0)"},"_id":"8390","file_date_updated":"2020-09-14T13:39:17Z","department":[{"_id":"ChLa"}],"ddc":["000"],"supervisor":[{"id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph","last_name":"Lampert","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph"}],"date_updated":"2023-10-16T10:04:02Z"},{"department":[{"_id":"ChLa"}],"file_date_updated":"2020-07-31T16:57:12Z","ddc":["004"],"date_updated":"2023-10-17T07:37:11Z","status":"public","conference":{"name":"CVPR: Conference on Computer Vision and Pattern Recognition","start_date":"2020-06-14","location":"Virtual","end_date":"2020-06-19"},"type":"conference","_id":"8186","language":[{"iso":"eng"}],"file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"8187","success":1,"creator":"phenders","date_updated":"2020-07-31T16:57:12Z","file_size":10262773,"date_created":"2020-07-31T16:57:12Z","file_name":"paper.pdf"}],"publication_status":"published","publication_identifier":{"eissn":["2575-7075"],"eisbn":["9781728171685"]},"month":"07","main_file_link":[{"open_access":"1","url":"https://openaccess.thecvf.com/content_CVPR_2020/papers/Henderson_Leveraging_2D_Data_to_Learn_Textured_3D_Mesh_Generation_CVPR_2020_paper.pdf"}],"scopus_import":"1","oa_version":"Submitted Version","abstract":[{"text":"Numerous methods have been proposed for probabilistic generative modelling of\r\n3D objects. However, none of these is able to produce textured objects, which\r\nrenders them of limited use for practical tasks. In this work, we present the\r\nfirst generative model of textured 3D meshes. Training such a model would\r\ntraditionally require a large dataset of textured meshes, but unfortunately,\r\nexisting datasets of meshes lack detailed textures. We instead propose a new\r\ntraining methodology that allows learning from collections of 2D images without\r\nany 3D information. To do so, we train our model to explain a distribution of\r\nimages by modelling each image as a 3D foreground object placed in front of a\r\n2D background. Thus, it learns to generate meshes that when rendered, produce\r\nimages similar to those in its training set.\r\n A well-known problem when generating meshes with deep networks is the\r\nemergence of self-intersections, which are problematic for many use-cases. As a\r\nsecond contribution we therefore introduce a new generation process for 3D\r\nmeshes that guarantees no self-intersections arise, based on the physical\r\nintuition that faces should push one another out of the way as they move.\r\n We conduct extensive experiments on our approach, reporting quantitative and\r\nqualitative results on both synthetic data and natural images. These show our\r\nmethod successfully learns to generate plausible and diverse textured 3D\r\nsamples for five challenging object classes.","lang":"eng"}],"title":"Leveraging 2D data to learn textured 3D mesh generation","article_processing_charge":"No","external_id":{"arxiv":["2004.04180"]},"author":[{"orcid":"0000-0002-5198-7445","full_name":"Henderson, Paul M","last_name":"Henderson","id":"13C09E74-18D9-11E9-8878-32CFE5697425","first_name":"Paul M"},{"full_name":"Tsiminaki, Vagia","last_name":"Tsiminaki","first_name":"Vagia"},{"id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph","full_name":"Lampert, Christoph","orcid":"0000-0001-8622-7887","last_name":"Lampert"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"P. M. Henderson, V. Tsiminaki, and C. Lampert, “Leveraging 2D data to learn textured 3D mesh generation,” in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, Virtual, 2020, pp. 7498–7507.","short":"P.M. Henderson, V. Tsiminaki, C. Lampert, in:, Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, IEEE, 2020, pp. 7498–7507.","apa":"Henderson, P. M., Tsiminaki, V., & Lampert, C. (2020). Leveraging 2D data to learn textured 3D mesh generation. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (pp. 7498–7507). Virtual: IEEE. https://doi.org/10.1109/CVPR42600.2020.00752","ama":"Henderson PM, Tsiminaki V, Lampert C. Leveraging 2D data to learn textured 3D mesh generation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. IEEE; 2020:7498-7507. doi:10.1109/CVPR42600.2020.00752","mla":"Henderson, Paul M., et al. “Leveraging 2D Data to Learn Textured 3D Mesh Generation.” Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, IEEE, 2020, pp. 7498–507, doi:10.1109/CVPR42600.2020.00752.","ista":"Henderson PM, Tsiminaki V, Lampert C. 2020. Leveraging 2D data to learn textured 3D mesh generation. Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. CVPR: Conference on Computer Vision and Pattern Recognition, 7498–7507.","chicago":"Henderson, Paul M, Vagia Tsiminaki, and Christoph Lampert. “Leveraging 2D Data to Learn Textured 3D Mesh Generation.” In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 7498–7507. IEEE, 2020. https://doi.org/10.1109/CVPR42600.2020.00752."},"date_created":"2020-07-31T16:53:49Z","doi":"10.1109/CVPR42600.2020.00752","date_published":"2020-07-01T00:00:00Z","page":"7498-7507","publication":"Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition","day":"01","year":"2020","has_accepted_license":"1","oa":1,"quality_controlled":"1","publisher":"IEEE"},{"date_created":"2020-01-30T10:12:04Z","date_published":"2020-01-01T00:00:00Z","doi":"10.1080/15592324.2019.1687175","year":"2020","isi":1,"publication":"Plant Signaling & Behavior","day":"01","oa":1,"publisher":"Taylor & Francis","quality_controlled":"1","external_id":{"isi":["000494909300001"],"pmid":["31696764"]},"article_processing_charge":"No","author":[{"id":"2D99FE6A-F248-11E8-B48F-1D18A9856A87","first_name":"Scott A","last_name":"Sinclair","orcid":"0000-0002-4566-0593","full_name":"Sinclair, Scott A"},{"full_name":"Krämer, U.","last_name":"Krämer","first_name":"U."}],"title":"Generation of effective zinc-deficient agar-solidified media allows identification of root morphology changes in response to zinc limitation","citation":{"chicago":"Sinclair, Scott A, and U. Krämer. “Generation of Effective Zinc-Deficient Agar-Solidified Media Allows Identification of Root Morphology Changes in Response to Zinc Limitation.” Plant Signaling & Behavior. Taylor & Francis, 2020. https://doi.org/10.1080/15592324.2019.1687175.","ista":"Sinclair SA, Krämer U. 2020. Generation of effective zinc-deficient agar-solidified media allows identification of root morphology changes in response to zinc limitation. Plant Signaling & Behavior. 15(1), 1687175.","mla":"Sinclair, Scott A., and U. Krämer. “Generation of Effective Zinc-Deficient Agar-Solidified Media Allows Identification of Root Morphology Changes in Response to Zinc Limitation.” Plant Signaling & Behavior, vol. 15, no. 1, 1687175, Taylor & Francis, 2020, doi:10.1080/15592324.2019.1687175.","ieee":"S. A. Sinclair and U. Krämer, “Generation of effective zinc-deficient agar-solidified media allows identification of root morphology changes in response to zinc limitation,” Plant Signaling & Behavior, vol. 15, no. 1. Taylor & Francis, 2020.","short":"S.A. Sinclair, U. Krämer, Plant Signaling & Behavior 15 (2020).","apa":"Sinclair, S. A., & Krämer, U. (2020). Generation of effective zinc-deficient agar-solidified media allows identification of root morphology changes in response to zinc limitation. Plant Signaling & Behavior. Taylor & Francis. https://doi.org/10.1080/15592324.2019.1687175","ama":"Sinclair SA, Krämer U. Generation of effective zinc-deficient agar-solidified media allows identification of root morphology changes in response to zinc limitation. Plant Signaling & Behavior. 2020;15(1). doi:10.1080/15592324.2019.1687175"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_number":"1687175","volume":15,"issue":"1","publication_status":"published","publication_identifier":{"issn":["1559-2324"]},"language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7012054"}],"scopus_import":"1","intvolume":" 15","month":"01","abstract":[{"lang":"eng","text":"Earlier, we demonstrated that transcript levels of METAL TOLERANCE PROTEIN2 (MTP2) and of HEAVY METAL ATPase2 (HMA2) increase strongly in roots of Arabidopsis upon prolonged zinc (Zn) deficiency and respond to shoot physiological Zn status, and not to the local Zn status in roots. This provided evidence for shoot-to-root communication in the acclimation of plants to Zn deficiency. Zn-deficient soils limit both the yield and quality of agricultural crops and can result in clinically relevant nutritional Zn deficiency in human populations. Implementing Zn deficiency during cultivation of the model plant Arabidopsis thaliana on agar-solidified media is difficult because trace element contaminations are present in almost all commercially available agars. Here, we demonstrate root morphological acclimations to Zn deficiency on agar-solidified medium following the effective removal of contaminants. These advancements allow reproducible phenotyping toward understanding fundamental plant responses to deficiencies of Zn and other essential trace elements."}],"pmid":1,"oa_version":"Submitted Version","department":[{"_id":"JiFr"}],"date_updated":"2023-10-17T09:01:48Z","article_type":"original","type":"journal_article","status":"public","_id":"7416"},{"date_updated":"2023-10-17T12:29:34Z","ddc":["570"],"department":[{"_id":"FlSc"}],"file_date_updated":"2020-07-14T12:47:59Z","_id":"7464","type":"journal_article","article_type":"original","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public","publication_identifier":{"issn":["1553-7374"]},"publication_status":"published","file":[{"checksum":"a297f54d1fef0efe4789ca00f37f241e","file_id":"7484","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"2020_PLOSPatho_Dick.pdf","date_created":"2020-02-11T10:07:28Z","creator":"dernst","file_size":4551246,"date_updated":"2020-07-14T12:47:59Z"}],"language":[{"iso":"eng"}],"volume":16,"issue":"1","related_material":{"record":[{"id":"9723","status":"deleted","relation":"research_data"}]},"abstract":[{"text":"Retrovirus assembly is driven by the multidomain structural protein Gag. Interactions between the capsid domains (CA) of Gag result in Gag multimerization, leading to an immature virus particle that is formed by a protein lattice based on dimeric, trimeric, and hexameric protein contacts. Among retroviruses the inter- and intra-hexamer contacts differ, especially in the N-terminal sub-domain of CA (CANTD). For HIV-1 the cellular molecule inositol hexakisphosphate (IP6) interacts with and stabilizes the immature hexamer, and is required for production of infectious virus particles. We have used in vitro assembly, cryo-electron tomography and subtomogram averaging, atomistic molecular dynamics simulations and mutational analyses to study the HIV-related lentivirus equine infectious anemia virus (EIAV). In particular, we sought to understand the structural conservation of the immature lentivirus lattice and the role of IP6 in EIAV assembly. Similar to HIV-1, IP6 strongly promoted in vitro assembly of EIAV Gag proteins into virus-like particles (VLPs), which took three morphologically highly distinct forms: narrow tubes, wide tubes, and spheres. Structural characterization of these VLPs to sub-4Å resolution unexpectedly showed that all three morphologies are based on an immature lattice with preserved key structural components, highlighting the structural versatility of CA to form immature assemblies. A direct comparison between EIAV and HIV revealed that both lentiviruses maintain similar immature interfaces, which are established by both conserved and non-conserved residues. In both EIAV and HIV-1, IP6 regulates immature assembly via conserved lysine residues within the CACTD and SP. Lastly, we demonstrate that IP6 stimulates in vitro assembly of immature particles of several other retroviruses in the lentivirus genus, suggesting a conserved role for IP6 in lentiviral assembly.","lang":"eng"}],"acknowledged_ssus":[{"_id":"ScienComp"}],"oa_version":"Published Version","pmid":1,"scopus_import":"1","month":"01","intvolume":" 16","citation":{"chicago":"Dick, Robert A., Chaoyi Xu, Dustin R. Morado, Vladyslav Kravchuk, Clifton L. Ricana, Terri D. Lyddon, Arianna M. Broad, et al. “Structures of Immature EIAV Gag Lattices Reveal a Conserved Role for IP6 in Lentivirus Assembly.” PLOS Pathogens. Public Library of Science, 2020. https://doi.org/10.1371/journal.ppat.1008277.","ista":"Dick RA, Xu C, Morado DR, Kravchuk V, Ricana CL, Lyddon TD, Broad AM, Feathers JR, Johnson MC, Vogt VM, Perilla JR, Briggs JAG, Schur FK. 2020. Structures of immature EIAV Gag lattices reveal a conserved role for IP6 in lentivirus assembly. PLOS Pathogens. 16(1), e1008277.","mla":"Dick, Robert A., et al. “Structures of Immature EIAV Gag Lattices Reveal a Conserved Role for IP6 in Lentivirus Assembly.” PLOS Pathogens, vol. 16, no. 1, e1008277, Public Library of Science, 2020, doi:10.1371/journal.ppat.1008277.","ieee":"R. A. Dick et al., “Structures of immature EIAV Gag lattices reveal a conserved role for IP6 in lentivirus assembly,” PLOS Pathogens, vol. 16, no. 1. Public Library of Science, 2020.","short":"R.A. Dick, C. Xu, D.R. Morado, V. Kravchuk, C.L. Ricana, T.D. Lyddon, A.M. Broad, J.R. Feathers, M.C. Johnson, V.M. Vogt, J.R. Perilla, J.A.G. Briggs, F.K. Schur, PLOS Pathogens 16 (2020).","ama":"Dick RA, Xu C, Morado DR, et al. Structures of immature EIAV Gag lattices reveal a conserved role for IP6 in lentivirus assembly. PLOS Pathogens. 2020;16(1). doi:10.1371/journal.ppat.1008277","apa":"Dick, R. A., Xu, C., Morado, D. R., Kravchuk, V., Ricana, C. L., Lyddon, T. D., … Schur, F. K. (2020). Structures of immature EIAV Gag lattices reveal a conserved role for IP6 in lentivirus assembly. PLOS Pathogens. Public Library of Science. https://doi.org/10.1371/journal.ppat.1008277"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Robert A.","last_name":"Dick","full_name":"Dick, Robert A."},{"first_name":"Chaoyi","full_name":"Xu, Chaoyi","last_name":"Xu"},{"full_name":"Morado, Dustin R.","last_name":"Morado","first_name":"Dustin R."},{"first_name":"Vladyslav","id":"4D62F2A6-F248-11E8-B48F-1D18A9856A87","last_name":"Kravchuk","orcid":"0000-0001-9523-9089","full_name":"Kravchuk, Vladyslav"},{"first_name":"Clifton L.","last_name":"Ricana","full_name":"Ricana, Clifton L."},{"last_name":"Lyddon","full_name":"Lyddon, Terri D.","first_name":"Terri D."},{"first_name":"Arianna M.","full_name":"Broad, Arianna M.","last_name":"Broad"},{"full_name":"Feathers, J. Ryan","last_name":"Feathers","first_name":"J. Ryan"},{"first_name":"Marc C.","last_name":"Johnson","full_name":"Johnson, Marc C."},{"full_name":"Vogt, Volker M.","last_name":"Vogt","first_name":"Volker M."},{"full_name":"Perilla, Juan R.","last_name":"Perilla","first_name":"Juan R."},{"first_name":"John A. G.","full_name":"Briggs, John A. G.","last_name":"Briggs"},{"full_name":"Schur, Florian KM","orcid":"0000-0003-4790-8078","last_name":"Schur","first_name":"Florian KM","id":"48AD8942-F248-11E8-B48F-1D18A9856A87"}],"external_id":{"isi":["000510746400010"],"pmid":["31986188"]},"article_processing_charge":"No","title":"Structures of immature EIAV Gag lattices reveal a conserved role for IP6 in lentivirus assembly","article_number":"e1008277","project":[{"call_identifier":"FWF","_id":"26736D6A-B435-11E9-9278-68D0E5697425","name":"Structural conservation and diversity in retroviral capsid","grant_number":"P31445"}],"isi":1,"has_accepted_license":"1","year":"2020","day":"27","publication":"PLOS Pathogens","date_published":"2020-01-27T00:00:00Z","doi":"10.1371/journal.ppat.1008277","date_created":"2020-02-06T18:47:17Z","quality_controlled":"1","publisher":"Public Library of Science","oa":1},{"scopus_import":"1","intvolume":" 16","month":"01","abstract":[{"lang":"eng","text":"The fixation probability of a single mutant invading a population of residents is among the most widely-studied quantities in evolutionary dynamics. Amplifiers of natural selection are population structures that increase the fixation probability of advantageous mutants, compared to well-mixed populations. Extensive studies have shown that many amplifiers exist for the Birth-death Moran process, some of them substantially increasing the fixation probability or even guaranteeing fixation in the limit of large population size. On the other hand, no amplifiers are known for the death-Birth Moran process, and computer-assisted exhaustive searches have failed to discover amplification. In this work we resolve this disparity, by showing that any amplification under death-Birth updating is necessarily bounded and transient. Our boundedness result states that even if a population structure does amplify selection, the resulting fixation probability is close to that of the well-mixed population. Our transience result states that for any population structure there exists a threshold r⋆ such that the population structure ceases to amplify selection if the mutant fitness advantage r is larger than r⋆. Finally, we also extend the above results to δ-death-Birth updating, which is a combination of Birth-death and death-Birth updating. On the positive side, we identify population structures that maintain amplification for a wide range of values r and δ. These results demonstrate that amplification of natural selection depends on the specific mechanisms of the evolutionary process."}],"oa_version":"Published Version","ec_funded":1,"volume":16,"related_material":{"record":[{"id":"7196","status":"public","relation":"part_of_dissertation"}]},"publication_status":"published","publication_identifier":{"eissn":["15537358"]},"language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_id":"7441","checksum":"ce32ee2d2f53aed832f78bbd47e882df","file_size":1817531,"date_updated":"2020-07-14T12:47:53Z","creator":"dernst","file_name":"2020_PlosCompBio_Tkadlec.pdf","date_created":"2020-02-03T07:32:42Z"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","article_type":"original","status":"public","_id":"7212","file_date_updated":"2020-07-14T12:47:53Z","department":[{"_id":"KrCh"}],"date_updated":"2023-10-17T12:29:47Z","ddc":["000"],"oa":1,"quality_controlled":"1","publisher":"Public Library of Science","date_created":"2019-12-23T13:45:11Z","date_published":"2020-01-17T00:00:00Z","doi":"10.1371/journal.pcbi.1007494","year":"2020","isi":1,"has_accepted_license":"1","publication":"PLoS computational biology","day":"17","project":[{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S11407","name":"Game Theory"}],"article_number":"e1007494","external_id":{"isi":["000510916500025"],"arxiv":["1906.02785"]},"article_processing_charge":"No","author":[{"id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","first_name":"Josef","last_name":"Tkadlec","full_name":"Tkadlec, Josef","orcid":"0000-0002-1097-9684"},{"last_name":"Pavlogiannis","full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722","first_name":"Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"last_name":"Nowak","full_name":"Nowak, Martin A.","first_name":"Martin A."}],"title":"Limits on amplifiers of natural selection under death-Birth updating","citation":{"ista":"Tkadlec J, Pavlogiannis A, Chatterjee K, Nowak MA. 2020. Limits on amplifiers of natural selection under death-Birth updating. PLoS computational biology. 16, e1007494.","chicago":"Tkadlec, Josef, Andreas Pavlogiannis, Krishnendu Chatterjee, and Martin A. Nowak. “Limits on Amplifiers of Natural Selection under Death-Birth Updating.” PLoS Computational Biology. Public Library of Science, 2020. https://doi.org/10.1371/journal.pcbi.1007494.","short":"J. Tkadlec, A. Pavlogiannis, K. Chatterjee, M.A. Nowak, PLoS Computational Biology 16 (2020).","ieee":"J. Tkadlec, A. Pavlogiannis, K. Chatterjee, and M. A. Nowak, “Limits on amplifiers of natural selection under death-Birth updating,” PLoS computational biology, vol. 16. Public Library of Science, 2020.","apa":"Tkadlec, J., Pavlogiannis, A., Chatterjee, K., & Nowak, M. A. (2020). Limits on amplifiers of natural selection under death-Birth updating. PLoS Computational Biology. Public Library of Science. https://doi.org/10.1371/journal.pcbi.1007494","ama":"Tkadlec J, Pavlogiannis A, Chatterjee K, Nowak MA. Limits on amplifiers of natural selection under death-Birth updating. PLoS computational biology. 2020;16. doi:10.1371/journal.pcbi.1007494","mla":"Tkadlec, Josef, et al. “Limits on Amplifiers of Natural Selection under Death-Birth Updating.” PLoS Computational Biology, vol. 16, e1007494, Public Library of Science, 2020, doi:10.1371/journal.pcbi.1007494."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"title":"A role of graphs in evolutionary processes","author":[{"id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","first_name":"Josef","last_name":"Tkadlec","full_name":"Tkadlec, Josef","orcid":"0000-0002-1097-9684"}],"article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"short":"J. Tkadlec, A Role of Graphs in Evolutionary Processes, Institute of Science and Technology Austria, 2020.","ieee":"J. Tkadlec, “A role of graphs in evolutionary processes,” Institute of Science and Technology Austria, 2020.","ama":"Tkadlec J. A role of graphs in evolutionary processes. 2020. doi:10.15479/AT:ISTA:7196","apa":"Tkadlec, J. (2020). A role of graphs in evolutionary processes. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:7196","mla":"Tkadlec, Josef. A Role of Graphs in Evolutionary Processes. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:7196.","ista":"Tkadlec J. 2020. A role of graphs in evolutionary processes. Institute of Science and Technology Austria.","chicago":"Tkadlec, Josef. “A Role of Graphs in Evolutionary Processes.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:7196."},"publisher":"Institute of Science and Technology Austria","oa":1,"date_published":"2020-01-12T00:00:00Z","doi":"10.15479/AT:ISTA:7196","date_created":"2019-12-20T12:26:36Z","page":"144","day":"12","has_accepted_license":"1","year":"2020","status":"public","type":"dissertation","_id":"7196","department":[{"_id":"KrCh"},{"_id":"GradSch"}],"file_date_updated":"2020-07-14T12:47:52Z","ddc":["519"],"supervisor":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"}],"date_updated":"2023-10-17T12:29:46Z","month":"01","alternative_title":["ISTA Thesis"],"oa_version":"Published Version","abstract":[{"lang":"eng","text":"In this thesis we study certain mathematical aspects of evolution. The two primary forces that drive an evolutionary process are mutation and selection. Mutation generates new variants in a population. Selection chooses among the variants depending on the reproductive rates of individuals. Evolutionary processes are intrinsically random – a new mutation that is initially present in the population at low frequency can go extinct, even if it confers a reproductive advantage. The overall rate of evolution is largely determined by two quantities: the probability that an invading advantageous mutation spreads through the population (called fixation probability) and the time until it does so (called fixation time). Both those quantities crucially depend not only on the strength of the invading mutation but also on the population structure. In this thesis, we aim to understand how the underlying population structure affects the overall rate of evolution. Specifically, we study population structures that increase the fixation probability of advantageous mutants (called amplifiers of selection). Broadly speaking, our results are of three different types: We present various strong amplifiers, we identify regimes under which only limited amplification is feasible, and we propose population structures that provide different tradeoffs between high fixation probability and short fixation time."}],"related_material":{"record":[{"relation":"dissertation_contains","id":"7210","status":"public"},{"id":"5751","status":"public","relation":"dissertation_contains"},{"relation":"dissertation_contains","status":"public","id":"7212"}]},"file":[{"file_name":"thesis.zip","date_created":"2020-01-12T11:49:49Z","creator":"jtkadlec","file_size":21100497,"date_updated":"2020-07-14T12:47:52Z","checksum":"451f8e64b0eb26bf297644ac72bfcbe9","file_id":"7255","relation":"source_file","access_level":"closed","content_type":"application/zip"},{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_id":"7367","checksum":"d8c44cbc4f939c49a8efc9d4b8bb3985","file_size":11670983,"date_updated":"2020-07-14T12:47:52Z","creator":"dernst","file_name":"2020_Tkadlec_Thesis.pdf","date_created":"2020-01-28T07:32:42Z"}],"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["2663-337X"]},"degree_awarded":"PhD","publication_status":"published"},{"page":"8773-8784","date_created":"2021-02-25T09:36:22Z","date_published":"2020-07-13T00:00:00Z","year":"2020","has_accepted_license":"1","publication":"Proceedings of the 37th International Conference on Machine Learning","day":"13","oa":1,"quality_controlled":"1","publisher":"ML Research Press","acknowledgement":"M. Mondelli was partially supported by the 2019 LopezLoreta Prize. The authors thank Phan-Minh Nguyen for helpful discussions and the IST Distributed Algorithms and Systems Lab for providing computational resources.","article_processing_charge":"No","external_id":{"arxiv":["1912.10095"]},"author":[{"first_name":"Alexander","full_name":"Shevchenko, Alexander","last_name":"Shevchenko"},{"first_name":"Marco","id":"27EB676C-8706-11E9-9510-7717E6697425","last_name":"Mondelli","full_name":"Mondelli, Marco","orcid":"0000-0002-3242-7020"}],"title":"Landscape connectivity and dropout stability of SGD solutions for over-parameterized neural networks","citation":{"ista":"Shevchenko A, Mondelli M. 2020. Landscape connectivity and dropout stability of SGD solutions for over-parameterized neural networks. Proceedings of the 37th International Conference on Machine Learning. vol. 119, 8773–8784.","chicago":"Shevchenko, Alexander, and Marco Mondelli. “Landscape Connectivity and Dropout Stability of SGD Solutions for Over-Parameterized Neural Networks.” In Proceedings of the 37th International Conference on Machine Learning, 119:8773–84. ML Research Press, 2020.","short":"A. Shevchenko, M. Mondelli, in:, Proceedings of the 37th International Conference on Machine Learning, ML Research Press, 2020, pp. 8773–8784.","ieee":"A. Shevchenko and M. Mondelli, “Landscape connectivity and dropout stability of SGD solutions for over-parameterized neural networks,” in Proceedings of the 37th International Conference on Machine Learning, 2020, vol. 119, pp. 8773–8784.","ama":"Shevchenko A, Mondelli M. Landscape connectivity and dropout stability of SGD solutions for over-parameterized neural networks. In: Proceedings of the 37th International Conference on Machine Learning. Vol 119. ML Research Press; 2020:8773-8784.","apa":"Shevchenko, A., & Mondelli, M. (2020). Landscape connectivity and dropout stability of SGD solutions for over-parameterized neural networks. In Proceedings of the 37th International Conference on Machine Learning (Vol. 119, pp. 8773–8784). ML Research Press.","mla":"Shevchenko, Alexander, and Marco Mondelli. “Landscape Connectivity and Dropout Stability of SGD Solutions for Over-Parameterized Neural Networks.” Proceedings of the 37th International Conference on Machine Learning, vol. 119, ML Research Press, 2020, pp. 8773–84."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"name":"Prix Lopez-Loretta 2019 - Marco Mondelli","_id":"059876FA-7A3F-11EA-A408-12923DDC885E"}],"volume":119,"publication_status":"published","language":[{"iso":"eng"}],"file":[{"date_updated":"2021-03-02T15:38:14Z","file_size":5336380,"creator":"dernst","date_created":"2021-03-02T15:38:14Z","file_name":"2020_PMLR_Shevchenko.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"9217","checksum":"f042c8d4316bd87c6361aa76f1fbdbbe","success":1}],"intvolume":" 119","month":"07","abstract":[{"lang":"eng","text":"The optimization of multilayer neural networks typically leads to a solution\r\nwith zero training error, yet the landscape can exhibit spurious local minima\r\nand the minima can be disconnected. In this paper, we shed light on this\r\nphenomenon: we show that the combination of stochastic gradient descent (SGD)\r\nand over-parameterization makes the landscape of multilayer neural networks\r\napproximately connected and thus more favorable to optimization. More\r\nspecifically, we prove that SGD solutions are connected via a piecewise linear\r\npath, and the increase in loss along this path vanishes as the number of\r\nneurons grows large. This result is a consequence of the fact that the\r\nparameters found by SGD are increasingly dropout stable as the network becomes\r\nwider. We show that, if we remove part of the neurons (and suitably rescale the\r\nremaining ones), the change in loss is independent of the total number of\r\nneurons, and it depends only on how many neurons are left. Our results exhibit\r\na mild dependence on the input dimension: they are dimension-free for two-layer\r\nnetworks and depend linearly on the dimension for multilayer networks. We\r\nvalidate our theoretical findings with numerical experiments for different\r\narchitectures and classification tasks."}],"oa_version":"Published Version","file_date_updated":"2021-03-02T15:38:14Z","department":[{"_id":"MaMo"}],"date_updated":"2023-10-17T12:43:19Z","ddc":["000"],"type":"conference","status":"public","_id":"9198"},{"oa_version":"Published Version","abstract":[{"lang":"eng","text":"Representing an atom by a solid sphere in 3-dimensional Euclidean space, we get the space-filling diagram of a molecule by taking the union. Molecular dynamics simulates its motion subject to bonds and other forces, including the solvation free energy. The morphometric approach [12, 17] writes the latter as a linear combination of weighted versions of the volume, area, mean curvature, and Gaussian curvature of the space-filling diagram. We give a formula for the derivative of the weighted mean curvature. Together with the derivatives of the weighted volume in [7], the weighted area in [3], and the weighted Gaussian curvature [1], this yields the derivative of the morphometric expression of the solvation free energy."}],"intvolume":" 8","month":"06","language":[{"iso":"eng"}],"file":[{"success":1,"file_id":"9171","checksum":"cea41de9937d07a3b927d71ee8b4e432","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_name":"2020_CompMathBiophysics_Akopyan2.pdf","date_created":"2021-02-19T13:56:24Z","file_size":562359,"date_updated":"2021-02-19T13:56:24Z","creator":"dernst"}],"publication_status":"published","publication_identifier":{"issn":["2544-7297"]},"ec_funded":1,"volume":8,"issue":"1","_id":"9157","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"article_type":"original","type":"journal_article","ddc":["510"],"date_updated":"2023-10-17T12:34:51Z","department":[{"_id":"HeEd"}],"file_date_updated":"2021-02-19T13:56:24Z","acknowledgement":"The authors of this paper thank Roland Roth for suggesting the analysis of the weighted\r\ncurvature derivatives for the purpose of improving molecular dynamics simulations and for his continued encouragement. They also thank Patrice Koehl for the implementation of the formulas and for his encouragement and advise along the road. Finally, they thank two anonymous reviewers for their constructive criticism.\r\nThis project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 78818 Alpha). It is also partially supported by the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, through grant no. I02979-N35 of the Austrian Science Fund (FWF).","oa":1,"publisher":"De Gruyter","quality_controlled":"1","publication":"Computational and Mathematical Biophysics","day":"20","year":"2020","has_accepted_license":"1","date_created":"2021-02-17T15:13:01Z","date_published":"2020-06-20T00:00:00Z","doi":"10.1515/cmb-2020-0100","page":"51-67","project":[{"name":"Alpha Shape Theory Extended","grant_number":"788183","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"_id":"2561EBF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"I02979-N35","name":"Persistence and stability of geometric complexes"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Akopyan, Arseniy, and Herbert Edelsbrunner. “The Weighted Mean Curvature Derivative of a Space-Filling Diagram.” Computational and Mathematical Biophysics. De Gruyter, 2020. https://doi.org/10.1515/cmb-2020-0100.","ista":"Akopyan A, Edelsbrunner H. 2020. The weighted mean curvature derivative of a space-filling diagram. Computational and Mathematical Biophysics. 8(1), 51–67.","mla":"Akopyan, Arseniy, and Herbert Edelsbrunner. “The Weighted Mean Curvature Derivative of a Space-Filling Diagram.” Computational and Mathematical Biophysics, vol. 8, no. 1, De Gruyter, 2020, pp. 51–67, doi:10.1515/cmb-2020-0100.","short":"A. Akopyan, H. Edelsbrunner, Computational and Mathematical Biophysics 8 (2020) 51–67.","ieee":"A. Akopyan and H. Edelsbrunner, “The weighted mean curvature derivative of a space-filling diagram,” Computational and Mathematical Biophysics, vol. 8, no. 1. De Gruyter, pp. 51–67, 2020.","apa":"Akopyan, A., & Edelsbrunner, H. (2020). The weighted mean curvature derivative of a space-filling diagram. Computational and Mathematical Biophysics. De Gruyter. https://doi.org/10.1515/cmb-2020-0100","ama":"Akopyan A, Edelsbrunner H. The weighted mean curvature derivative of a space-filling diagram. Computational and Mathematical Biophysics. 2020;8(1):51-67. doi:10.1515/cmb-2020-0100"},"title":"The weighted mean curvature derivative of a space-filling diagram","article_processing_charge":"No","author":[{"id":"430D2C90-F248-11E8-B48F-1D18A9856A87","first_name":"Arseniy","last_name":"Akopyan","full_name":"Akopyan, Arseniy","orcid":"0000-0002-2548-617X"},{"last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"}]},{"citation":{"ieee":"A. Akopyan and H. Edelsbrunner, “The weighted Gaussian curvature derivative of a space-filling diagram,” Computational and Mathematical Biophysics, vol. 8, no. 1. De Gruyter, pp. 74–88, 2020.","short":"A. Akopyan, H. Edelsbrunner, Computational and Mathematical Biophysics 8 (2020) 74–88.","ama":"Akopyan A, Edelsbrunner H. The weighted Gaussian curvature derivative of a space-filling diagram. Computational and Mathematical Biophysics. 2020;8(1):74-88. doi:10.1515/cmb-2020-0101","apa":"Akopyan, A., & Edelsbrunner, H. (2020). The weighted Gaussian curvature derivative of a space-filling diagram. Computational and Mathematical Biophysics. De Gruyter. https://doi.org/10.1515/cmb-2020-0101","mla":"Akopyan, Arseniy, and Herbert Edelsbrunner. “The Weighted Gaussian Curvature Derivative of a Space-Filling Diagram.” Computational and Mathematical Biophysics, vol. 8, no. 1, De Gruyter, 2020, pp. 74–88, doi:10.1515/cmb-2020-0101.","ista":"Akopyan A, Edelsbrunner H. 2020. The weighted Gaussian curvature derivative of a space-filling diagram. Computational and Mathematical Biophysics. 8(1), 74–88.","chicago":"Akopyan, Arseniy, and Herbert Edelsbrunner. “The Weighted Gaussian Curvature Derivative of a Space-Filling Diagram.” Computational and Mathematical Biophysics. De Gruyter, 2020. https://doi.org/10.1515/cmb-2020-0101."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"id":"430D2C90-F248-11E8-B48F-1D18A9856A87","first_name":"Arseniy","orcid":"0000-0002-2548-617X","full_name":"Akopyan, Arseniy","last_name":"Akopyan"},{"first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner"}],"external_id":{"arxiv":["1908.06777"]},"article_processing_charge":"No","title":"The weighted Gaussian curvature derivative of a space-filling diagram","project":[{"grant_number":"788183","name":"Alpha Shape Theory Extended","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"name":"Persistence and stability of geometric complexes","grant_number":"I02979-N35","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"has_accepted_license":"1","year":"2020","day":"21","publication":"Computational and Mathematical Biophysics","page":"74-88","date_published":"2020-07-21T00:00:00Z","doi":"10.1515/cmb-2020-0101","date_created":"2021-02-17T15:12:44Z","acknowledgement":"The authors of this paper thank Roland Roth for suggesting the analysis of theweighted\r\ncurvature derivatives for the purpose of improving molecular dynamics simulations. They also thank Patrice Koehl for the implementation of the formulas and for his encouragement and advise along the road. Finally, they thank two anonymous reviewers for their constructive criticism.\r\nThis project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 78818 Alpha). It is also partially supported by the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, through grant no. I02979-N35 of the Austrian Science Fund (FWF).","quality_controlled":"1","publisher":"De Gruyter","oa":1,"date_updated":"2023-10-17T12:35:10Z","ddc":["510"],"file_date_updated":"2021-02-19T13:33:19Z","department":[{"_id":"HeEd"}],"_id":"9156","type":"journal_article","article_type":"original","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public","publication_identifier":{"issn":["2544-7297"]},"publication_status":"published","file":[{"date_updated":"2021-02-19T13:33:19Z","file_size":707452,"creator":"dernst","date_created":"2021-02-19T13:33:19Z","file_name":"2020_CompMathBiophysics_Akopyan.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"ca43a7440834eab6bbea29c59b56ef3a","file_id":"9170","success":1}],"language":[{"iso":"eng"}],"issue":"1","volume":8,"ec_funded":1,"abstract":[{"lang":"eng","text":"The morphometric approach [11, 14] writes the solvation free energy as a linear combination of weighted versions of the volume, area, mean curvature, and Gaussian curvature of the space-filling diagram. We give a formula for the derivative of the weighted Gaussian curvature. Together with the derivatives of the weighted volume in [7], the weighted area in [4], and the weighted mean curvature in [1], this yields the derivative of the morphometric expression of solvation free energy."}],"oa_version":"Published Version","month":"07","intvolume":" 8"},{"file_date_updated":"2020-12-28T08:24:08Z","department":[{"_id":"JaMa"}],"date_updated":"2023-10-17T12:51:56Z","ddc":["510"],"type":"journal_article","article_type":"original","status":"public","_id":"8973","ec_funded":1,"volume":25,"publication_status":"published","publication_identifier":{"eissn":["1083-6489"]},"language":[{"iso":"eng"}],"file":[{"date_created":"2020-12-28T08:24:08Z","file_name":"2020_ElectronJProbab_Redig.pdf","date_updated":"2020-12-28T08:24:08Z","file_size":696653,"creator":"dernst","file_id":"8976","checksum":"d75359b9814e78d57c0a481b7cde3751","success":1,"content_type":"application/pdf","access_level":"open_access","relation":"main_file"}],"scopus_import":"1","intvolume":" 25","month":"10","abstract":[{"lang":"eng","text":"We consider the symmetric simple exclusion process in Zd with quenched bounded dynamic random conductances and prove its hydrodynamic limit in path space. The main tool is the connection, due to the self-duality of the process, between the invariance principle for single particles starting from all points and the macroscopic behavior of the density field. While the hydrodynamic limit at fixed macroscopic times is obtained via a generalization to the time-inhomogeneous context of the strategy introduced in [41], in order to prove tightness for the sequence of empirical density fields we develop a new criterion based on the notion of uniform conditional stochastic continuity, following [50]. In conclusion, we show that uniform elliptic dynamic conductances provide an example of environments in which the so-called arbitrary starting point invariance principle may be derived from the invariance principle of a single particle starting from the origin. Therefore, our hydrodynamics result applies to the examples of quenched environments considered in, e.g., [1], [3], [6] in combination with the hypothesis of uniform ellipticity."}],"oa_version":"Published Version","article_processing_charge":"No","external_id":{"arxiv":["1811.01366"],"isi":["000591737500001"]},"author":[{"last_name":"Redig","full_name":"Redig, Frank","first_name":"Frank"},{"full_name":"Saada, Ellen","last_name":"Saada","first_name":"Ellen"},{"first_name":"Federico","id":"E1836206-9F16-11E9-8814-AEFDE5697425","full_name":"Sau, Federico","last_name":"Sau"}],"title":"Symmetric simple exclusion process in dynamic environment: Hydrodynamics","citation":{"ista":"Redig F, Saada E, Sau F. 2020. Symmetric simple exclusion process in dynamic environment: Hydrodynamics. Electronic Journal of Probability. 25, 138.","chicago":"Redig, Frank, Ellen Saada, and Federico Sau. “Symmetric Simple Exclusion Process in Dynamic Environment: Hydrodynamics.” Electronic Journal of Probability. Institute of Mathematical Statistics, 2020. https://doi.org/10.1214/20-EJP536.","ama":"Redig F, Saada E, Sau F. Symmetric simple exclusion process in dynamic environment: Hydrodynamics. Electronic Journal of Probability. 2020;25. doi:10.1214/20-EJP536","apa":"Redig, F., Saada, E., & Sau, F. (2020). Symmetric simple exclusion process in dynamic environment: Hydrodynamics. Electronic Journal of Probability. Institute of Mathematical Statistics. https://doi.org/10.1214/20-EJP536","ieee":"F. Redig, E. Saada, and F. Sau, “Symmetric simple exclusion process in dynamic environment: Hydrodynamics,” Electronic Journal of Probability, vol. 25. Institute of Mathematical Statistics, 2020.","short":"F. Redig, E. Saada, F. Sau, Electronic Journal of Probability 25 (2020).","mla":"Redig, Frank, et al. “Symmetric Simple Exclusion Process in Dynamic Environment: Hydrodynamics.” Electronic Journal of Probability, vol. 25, 138, Institute of Mathematical Statistics, 2020, doi:10.1214/20-EJP536."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"article_number":"138","date_created":"2020-12-27T23:01:17Z","doi":"10.1214/20-EJP536","date_published":"2020-10-21T00:00:00Z","year":"2020","has_accepted_license":"1","isi":1,"publication":"Electronic Journal of Probability","day":"21","oa":1,"quality_controlled":"1","publisher":" Institute of Mathematical Statistics","acknowledgement":"We warmly thank S.R.S. Varadhan for many enlightening discussions at an early stage of this work. We are indebted to Francesca Collet for fruitful discussions and constant support all throughout this work. We thank Simone Floreani\r\nand Alberto Chiarini for helpful conversations on the final part of this paper as well as both referees for their careful reading and for raising relevant issues on some weak points contained in a previous version of this manuscript; we believe this helped us to improve it.\r\nPart of this work was done during the authors’ stay at the Institut Henri Poincaré (UMS 5208 CNRS-Sorbonne Université) – Centre Emile Borel during the trimester Stochastic Dynamics Out of Equilibrium. The authors thank this institution for hospitality and support (through LabEx CARMIN, ANR-10-LABX-59-01). F.S. thanks laboratoire\r\nMAP5 of Université de Paris, and E.S. thanks Delft University, for financial support and hospitality. F.S. acknowledges NWO for financial support via the TOP1 grant 613.001.552 as well as funding from the European Union’s Horizon 2020 research and innovation programme under the Marie-Skłodowska-Curie grant agreement No. 754411. This research has been conducted within the FP2M federation (CNRS FR 2036)."},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Browning, Timothy D., and Roger Heath Brown. “Density of Rational Points on a Quadric Bundle in ℙ3×ℙ3.” Duke Mathematical Journal, vol. 169, no. 16, Duke University Press, 2020, pp. 3099–165, doi:10.1215/00127094-2020-0031.","short":"T.D. Browning, R. Heath Brown, Duke Mathematical Journal 169 (2020) 3099–3165.","ieee":"T. D. Browning and R. Heath Brown, “Density of rational points on a quadric bundle in ℙ3×ℙ3,” Duke Mathematical Journal, vol. 169, no. 16. Duke University Press, pp. 3099–3165, 2020.","apa":"Browning, T. D., & Heath Brown, R. (2020). Density of rational points on a quadric bundle in ℙ3×ℙ3. Duke Mathematical Journal. Duke University Press. https://doi.org/10.1215/00127094-2020-0031","ama":"Browning TD, Heath Brown R. Density of rational points on a quadric bundle in ℙ3×ℙ3. Duke Mathematical Journal. 2020;169(16):3099-3165. doi:10.1215/00127094-2020-0031","chicago":"Browning, Timothy D, and Roger Heath Brown. “Density of Rational Points on a Quadric Bundle in ℙ3×ℙ3.” Duke Mathematical Journal. Duke University Press, 2020. https://doi.org/10.1215/00127094-2020-0031.","ista":"Browning TD, Heath Brown R. 2020. Density of rational points on a quadric bundle in ℙ3×ℙ3. Duke Mathematical Journal. 169(16), 3099–3165."},"title":"Density of rational points on a quadric bundle in ℙ3×ℙ3","author":[{"first_name":"Timothy D","id":"35827D50-F248-11E8-B48F-1D18A9856A87","last_name":"Browning","full_name":"Browning, Timothy D","orcid":"0000-0002-8314-0177"},{"first_name":"Roger","full_name":"Heath Brown, Roger","last_name":"Heath Brown"}],"external_id":{"arxiv":["1805.10715"],"isi":["000582676300002"]},"article_processing_charge":"No","publisher":"Duke University Press","quality_controlled":"1","oa":1,"day":"10","publication":"Duke Mathematical Journal","isi":1,"year":"2020","date_published":"2020-09-10T00:00:00Z","doi":"10.1215/00127094-2020-0031","date_created":"2018-12-11T11:45:02Z","page":"3099-3165","_id":"179","status":"public","article_type":"original","type":"journal_article","date_updated":"2023-10-17T12:51:10Z","department":[{"_id":"TiBr"}],"oa_version":"Preprint","abstract":[{"text":"An asymptotic formula is established for the number of rational points of bounded anticanonical height which lie on a certain Zariski dense subset of the biprojective hypersurface x1y21+⋯+x4y24=0 in ℙ3×ℙ3. This confirms the modified Manin conjecture for this variety, in which the removal of a thin set of rational points is allowed.","lang":"eng"}],"month":"09","intvolume":" 169","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1805.10715"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["0012-7094"]},"publication_status":"published","volume":169,"issue":"16"},{"oa_version":"Published Version","abstract":[{"lang":"eng","text":"Data and mathematica notebooks for plotting figures from Language learning with communication between learners"}],"month":"10","publisher":"Royal Society","oa":1,"main_file_link":[{"url":"https://doi.org/10.6084/m9.figshare.5973013.v1","open_access":"1"}],"day":"15","year":"2020","related_material":{"record":[{"status":"public","id":"198","relation":"used_in_publication"}]},"doi":"10.6084/m9.figshare.5973013.v1","date_published":"2020-10-15T00:00:00Z","date_created":"2021-08-06T13:09:57Z","_id":"9814","status":"public","type":"research_data_reference","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","date_updated":"2023-10-18T06:36:00Z","citation":{"mla":"Ibsen-Jensen, Rasmus, et al. Data and Mathematica Notebooks for Plotting Figures from Language Learning with Communication between Learners from Language Acquisition with Communication between Learners. Royal Society, 2020, doi:10.6084/m9.figshare.5973013.v1.","ama":"Ibsen-Jensen R, Tkadlec J, Chatterjee K, Nowak M. Data and mathematica notebooks for plotting figures from language learning with communication between learners from language acquisition with communication between learners. 2020. doi:10.6084/m9.figshare.5973013.v1","apa":"Ibsen-Jensen, R., Tkadlec, J., Chatterjee, K., & Nowak, M. (2020). Data and mathematica notebooks for plotting figures from language learning with communication between learners from language acquisition with communication between learners. Royal Society. https://doi.org/10.6084/m9.figshare.5973013.v1","ieee":"R. Ibsen-Jensen, J. Tkadlec, K. Chatterjee, and M. Nowak, “Data and mathematica notebooks for plotting figures from language learning with communication between learners from language acquisition with communication between learners.” Royal Society, 2020.","short":"R. Ibsen-Jensen, J. Tkadlec, K. Chatterjee, M. Nowak, (2020).","chicago":"Ibsen-Jensen, Rasmus, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. “Data and Mathematica Notebooks for Plotting Figures from Language Learning with Communication between Learners from Language Acquisition with Communication between Learners.” Royal Society, 2020. https://doi.org/10.6084/m9.figshare.5973013.v1.","ista":"Ibsen-Jensen R, Tkadlec J, Chatterjee K, Nowak M. 2020. Data and mathematica notebooks for plotting figures from language learning with communication between learners from language acquisition with communication between learners, Royal Society, 10.6084/m9.figshare.5973013.v1."},"department":[{"_id":"KrCh"}],"title":"Data and mathematica notebooks for plotting figures from language learning with communication between learners from language acquisition with communication between learners","author":[{"orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus","last_name":"Ibsen-Jensen","first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Tkadlec, Josef","orcid":"0000-0002-1097-9684","last_name":"Tkadlec","first_name":"Josef","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Nowak","full_name":"Nowak, Martin","first_name":"Martin"}],"article_processing_charge":"No"},{"acknowledgement":"This work is supported by the Office of Naval Research (N00014-16-1-2927- A00003), Vannevar Bush Faculty Fellowship (N00014-16-1-2812- P00005), Department of Energy (DE-SC0019174- 0001), and Defense Threat Reduction Agency (HDTRA1-15-1-0017- P00005).","oa":1,"publisher":"American Physical Society","quality_controlled":"1","year":"2020","isi":1,"publication":"Physical Review Letters","day":"24","date_created":"2020-08-24T06:24:04Z","date_published":"2020-07-24T00:00:00Z","doi":"10.1103/PhysRevLett.125.043202","article_number":"043202","citation":{"chicago":"Malia, Benjamin K., Julián Martínez-Rincón, Yunfan Wu, Onur Hosten, and Mark A. Kasevich. “Free Space Ramsey Spectroscopy in Rubidium with Noise below the Quantum Projection Limit.” Physical Review Letters. American Physical Society, 2020. https://doi.org/10.1103/PhysRevLett.125.043202.","ista":"Malia BK, Martínez-Rincón J, Wu Y, Hosten O, Kasevich MA. 2020. Free space Ramsey spectroscopy in rubidium with noise below the quantum projection limit. Physical Review Letters. 125(4), 043202.","mla":"Malia, Benjamin K., et al. “Free Space Ramsey Spectroscopy in Rubidium with Noise below the Quantum Projection Limit.” Physical Review Letters, vol. 125, no. 4, 043202, American Physical Society, 2020, doi:10.1103/PhysRevLett.125.043202.","short":"B.K. Malia, J. Martínez-Rincón, Y. Wu, O. Hosten, M.A. Kasevich, Physical Review Letters 125 (2020).","ieee":"B. K. Malia, J. Martínez-Rincón, Y. Wu, O. Hosten, and M. A. Kasevich, “Free space Ramsey spectroscopy in rubidium with noise below the quantum projection limit,” Physical Review Letters, vol. 125, no. 4. American Physical Society, 2020.","ama":"Malia BK, Martínez-Rincón J, Wu Y, Hosten O, Kasevich MA. Free space Ramsey spectroscopy in rubidium with noise below the quantum projection limit. Physical Review Letters. 2020;125(4). doi:10.1103/PhysRevLett.125.043202","apa":"Malia, B. K., Martínez-Rincón, J., Wu, Y., Hosten, O., & Kasevich, M. A. (2020). Free space Ramsey spectroscopy in rubidium with noise below the quantum projection limit. Physical Review Letters. American Physical Society. https://doi.org/10.1103/PhysRevLett.125.043202"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"pmid":["32794788"],"isi":["000552227400008"],"arxiv":["1912.10218"]},"article_processing_charge":"No","author":[{"last_name":"Malia","full_name":"Malia, Benjamin K.","first_name":"Benjamin K."},{"first_name":"Julián","last_name":"Martínez-Rincón","full_name":"Martínez-Rincón, Julián"},{"last_name":"Wu","full_name":"Wu, Yunfan","first_name":"Yunfan"},{"first_name":"Onur","id":"4C02D85E-F248-11E8-B48F-1D18A9856A87","last_name":"Hosten","full_name":"Hosten, Onur","orcid":"0000-0002-2031-204X"},{"first_name":"Mark A.","last_name":"Kasevich","full_name":"Kasevich, Mark A."}],"title":"Free space Ramsey spectroscopy in rubidium with noise below the quantum projection limit","abstract":[{"lang":"eng","text":"We demonstrate the utility of optical cavity generated spin-squeezed states in free space atomic fountain clocks in ensembles of 390 000 87Rb atoms. Fluorescence imaging, correlated to an initial quantum nondemolition measurement, is used for population spectroscopy after the atoms are released from a confining lattice. For a free fall time of 4 milliseconds, we resolve a single-shot phase sensitivity of 814(61) microradians, which is 5.8(0.6) decibels (dB) below the quantum projection limit. We observe that this squeezing is preserved as the cloud expands to a roughly 200 μm radius and falls roughly 300 μm in free space. Ramsey spectroscopy with 240 000 atoms at a 3.6 ms Ramsey time results in a single-shot fractional frequency stability of 8.4(0.2)×10−12, 3.8(0.2) dB below the quantum projection limit. The sensitivity and stability are limited by the technical noise in the fluorescence detection protocol and the microwave system, respectively."}],"oa_version":"Preprint","pmid":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1912.10218"}],"scopus_import":"1","intvolume":" 125","month":"07","publication_status":"published","publication_identifier":{"issn":["0031-9007"],"eissn":["1079-7114"]},"language":[{"iso":"eng"}],"volume":125,"issue":"4","_id":"8285","type":"journal_article","article_type":"original","status":"public","date_updated":"2023-10-18T08:38:35Z","department":[{"_id":"OnHo"}]},{"page":"16398-16408","date_published":"2020-12-06T00:00:00Z","date_created":"2021-07-04T22:01:27Z","year":"2020","day":"06","publication":"Advances in Neural Information Processing Systems","quality_controlled":"1","oa":1,"acknowledgement":"We would like to thank Chaitanya Chintaluri, Georgia Christodoulou, Bill Podlaski and Merima Šabanovic for useful discussions and comments. This work was supported by a Wellcome Trust ´ Senior Research Fellowship (214316/Z/18/Z), a BBSRC grant (BB/N019512/1), an ERC consolidator Grant (SYNAPSEEK), a Leverhulme Trust Project Grant (RPG-2016-446), and funding from École Polytechnique, Paris.","author":[{"full_name":"Confavreux, Basile J","last_name":"Confavreux","first_name":"Basile J","id":"C7610134-B532-11EA-BD9F-F5753DDC885E"},{"last_name":"Zenke","full_name":"Zenke, Friedemann","first_name":"Friedemann"},{"first_name":"Everton J.","last_name":"Agnes","full_name":"Agnes, Everton J."},{"first_name":"Timothy","last_name":"Lillicrap","full_name":"Lillicrap, Timothy"},{"last_name":"Vogels","full_name":"Vogels, Tim P","orcid":"0000-0003-3295-6181","id":"CB6FF8D2-008F-11EA-8E08-2637E6697425","first_name":"Tim P"}],"article_processing_charge":"No","title":"A meta-learning approach to (re)discover plasticity rules that carve a desired function into a neural network","citation":{"short":"B.J. Confavreux, F. Zenke, E.J. Agnes, T. Lillicrap, T.P. Vogels, in:, Advances in Neural Information Processing Systems, 2020, pp. 16398–16408.","ieee":"B. J. Confavreux, F. Zenke, E. J. Agnes, T. Lillicrap, and T. P. Vogels, “A meta-learning approach to (re)discover plasticity rules that carve a desired function into a neural network,” in Advances in Neural Information Processing Systems, Vancouver, Canada, 2020, vol. 33, pp. 16398–16408.","ama":"Confavreux BJ, Zenke F, Agnes EJ, Lillicrap T, Vogels TP. A meta-learning approach to (re)discover plasticity rules that carve a desired function into a neural network. In: Advances in Neural Information Processing Systems. Vol 33. ; 2020:16398-16408.","apa":"Confavreux, B. J., Zenke, F., Agnes, E. J., Lillicrap, T., & Vogels, T. P. (2020). A meta-learning approach to (re)discover plasticity rules that carve a desired function into a neural network. In Advances in Neural Information Processing Systems (Vol. 33, pp. 16398–16408). Vancouver, Canada.","mla":"Confavreux, Basile J., et al. “A Meta-Learning Approach to (Re)Discover Plasticity Rules That Carve a Desired Function into a Neural Network.” Advances in Neural Information Processing Systems, vol. 33, 2020, pp. 16398–408.","ista":"Confavreux BJ, Zenke F, Agnes EJ, Lillicrap T, Vogels TP. 2020. A meta-learning approach to (re)discover plasticity rules that carve a desired function into a neural network. Advances in Neural Information Processing Systems. NeurIPS: Conference on Neural Information Processing Systems vol. 33, 16398–16408.","chicago":"Confavreux, Basile J, Friedemann Zenke, Everton J. Agnes, Timothy Lillicrap, and Tim P Vogels. “A Meta-Learning Approach to (Re)Discover Plasticity Rules That Carve a Desired Function into a Neural Network.” In Advances in Neural Information Processing Systems, 33:16398–408, 2020."},"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","project":[{"_id":"c084a126-5a5b-11eb-8a69-d75314a70a87","name":"What’s in a memory? Spatiotemporal dynamics in strongly coupled recurrent neuronal networks.","grant_number":"214316/Z/18/Z"},{"name":"Learning the shape of synaptic plasticity rules for neuronal architectures and function through machine learning.","grant_number":"819603","_id":"0aacfa84-070f-11eb-9043-d7eb2c709234","call_identifier":"H2020"}],"related_material":{"record":[{"id":"14422","status":"public","relation":"dissertation_contains"}],"link":[{"url":"https://doi.org/10.1101/2020.10.24.353409","relation":"is_continued_by"}]},"volume":33,"ec_funded":1,"publication_identifier":{"issn":["1049-5258"]},"publication_status":"published","language":[{"iso":"eng"}],"scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://proceedings.neurips.cc/paper/2020/hash/bdbd5ebfde4934142c8a88e7a3796cd5-Abstract.html"}],"month":"12","intvolume":" 33","abstract":[{"lang":"eng","text":"The search for biologically faithful synaptic plasticity rules has resulted in a large body of models. They are usually inspired by – and fitted to – experimental data, but they rarely produce neural dynamics that serve complex functions. These failures suggest that current plasticity models are still under-constrained by existing data. Here, we present an alternative approach that uses meta-learning to discover plausible synaptic plasticity rules. Instead of experimental data, the rules are constrained by the functions they implement and the structure they are meant to produce. Briefly, we parameterize synaptic plasticity rules by a Volterra expansion and then use supervised learning methods (gradient descent or evolutionary strategies) to minimize a problem-dependent loss function that quantifies how effectively a candidate plasticity rule transforms an initially random network into one with the desired function. We first validate our approach by re-discovering previously described plasticity rules, starting at the single-neuron level and “Oja’s rule”, a simple Hebbian plasticity rule that captures the direction of most variability of inputs to a neuron (i.e., the first principal component). We expand the problem to the network level and ask the framework to find Oja’s rule together with an anti-Hebbian rule such that an initially random two-layer firing-rate network will recover several principal components of the input space after learning. Next, we move to networks of integrate-and-fire neurons with plastic inhibitory afferents. We train for rules that achieve a target firing rate by countering tuned excitation. Our algorithm discovers a specific subset of the manifold of rules that can solve this task. Our work is a proof of principle of an automated and unbiased approach to unveil synaptic plasticity rules that obey biological constraints and can solve complex functions."}],"oa_version":"Published Version","department":[{"_id":"TiVo"}],"date_updated":"2023-10-18T09:20:55Z","type":"conference","conference":{"start_date":"2020-12-06","end_date":"2020-12-12","location":"Vancouver, Canada","name":"NeurIPS: Conference on Neural Information Processing Systems"},"status":"public","_id":"9633"}]