[{"acknowledgement":"J.M. gratefully acknowledges support by the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation programme (grant agreement No 716117). J.M. and L.P. also acknowledge support from the Austrian Science Fund (FWF), grants No F65 and W1245. E.K. gratefully acknowledges support by the German Research Foundation through the Hausdorff Center for Mathematics and the Collaborative Research Center 1060. P.G. is partially funded by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) – 350398276.","publisher":"Elsevier","quality_controlled":"1","oa":1,"day":"01","publication":"Journal de Mathematiques Pures et Appliquees","isi":1,"year":"2020","doi":"10.1016/j.matpur.2020.02.008","date_published":"2020-07-01T00:00:00Z","date_created":"2020-03-08T23:00:47Z","page":"204-234","project":[{"grant_number":"716117","name":"Optimal Transport and Stochastic Dynamics","_id":"256E75B8-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"grant_number":" F06504","name":"Taming Complexity in Partial Di erential Systems","call_identifier":"FWF","_id":"260482E2-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"260788DE-B435-11E9-9278-68D0E5697425","name":"Dissipation and Dispersion in Nonlinear Partial Differential Equations"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"ista":"Gladbach P, Kopfer E, Maas J, Portinale L. 2020. Homogenisation of one-dimensional discrete optimal transport. Journal de Mathematiques Pures et Appliquees. 139(7), 204–234.","chicago":"Gladbach, Peter, Eva Kopfer, Jan Maas, and Lorenzo Portinale. “Homogenisation of One-Dimensional Discrete Optimal Transport.” Journal de Mathematiques Pures et Appliquees. Elsevier, 2020. https://doi.org/10.1016/j.matpur.2020.02.008.","apa":"Gladbach, P., Kopfer, E., Maas, J., & Portinale, L. (2020). Homogenisation of one-dimensional discrete optimal transport. Journal de Mathematiques Pures et Appliquees. Elsevier. https://doi.org/10.1016/j.matpur.2020.02.008","ama":"Gladbach P, Kopfer E, Maas J, Portinale L. Homogenisation of one-dimensional discrete optimal transport. Journal de Mathematiques Pures et Appliquees. 2020;139(7):204-234. doi:10.1016/j.matpur.2020.02.008","short":"P. Gladbach, E. Kopfer, J. Maas, L. Portinale, Journal de Mathematiques Pures et Appliquees 139 (2020) 204–234.","ieee":"P. Gladbach, E. Kopfer, J. Maas, and L. Portinale, “Homogenisation of one-dimensional discrete optimal transport,” Journal de Mathematiques Pures et Appliquees, vol. 139, no. 7. Elsevier, pp. 204–234, 2020.","mla":"Gladbach, Peter, et al. “Homogenisation of One-Dimensional Discrete Optimal Transport.” Journal de Mathematiques Pures et Appliquees, vol. 139, no. 7, Elsevier, 2020, pp. 204–34, doi:10.1016/j.matpur.2020.02.008."},"title":"Homogenisation of one-dimensional discrete optimal transport","author":[{"last_name":"Gladbach","full_name":"Gladbach, Peter","first_name":"Peter"},{"full_name":"Kopfer, Eva","last_name":"Kopfer","first_name":"Eva"},{"last_name":"Maas","orcid":"0000-0002-0845-1338","full_name":"Maas, Jan","first_name":"Jan","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Portinale","full_name":"Portinale, Lorenzo","first_name":"Lorenzo","id":"30AD2CBC-F248-11E8-B48F-1D18A9856A87"}],"article_processing_charge":"No","external_id":{"arxiv":["1905.05757"],"isi":["000539439400008"]},"oa_version":"Preprint","abstract":[{"text":"This paper deals with dynamical optimal transport metrics defined by spatial discretisation of the Benamou–Benamou formula for the Kantorovich metric . Such metrics appear naturally in discretisations of -gradient flow formulations for dissipative PDE. However, it has recently been shown that these metrics do not in general converge to , unless strong geometric constraints are imposed on the discrete mesh. In this paper we prove that, in a 1-dimensional periodic setting, discrete transport metrics converge to a limiting transport metric with a non-trivial effective mobility. This mobility depends sensitively on the geometry of the mesh and on the non-local mobility at the discrete level. Our result quantifies to what extent discrete transport can make use of microstructure in the mesh to reduce the cost of transport.","lang":"eng"}],"month":"07","intvolume":" 139","scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/1905.05757","open_access":"1"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["00217824"]},"publication_status":"published","volume":139,"issue":"7","related_material":{"record":[{"status":"public","id":"10030","relation":"dissertation_contains"}]},"ec_funded":1,"_id":"7573","status":"public","article_type":"original","type":"journal_article","date_updated":"2023-09-07T13:31:05Z","department":[{"_id":"JaMa"}]},{"related_material":{"record":[{"status":"public","id":"11739","relation":"later_version"},{"id":"10030","status":"public","relation":"dissertation_contains"}]},"date_published":"2020-08-25T00:00:00Z","ec_funded":1,"date_created":"2021-09-17T10:57:27Z","page":"33","day":"25","publication":"arXiv","language":[{"iso":"eng"}],"publication_status":"submitted","year":"2020","month":"08","main_file_link":[{"url":"https://arxiv.org/abs/2008.10962","open_access":"1"}],"oa":1,"oa_version":"Preprint","acknowledgement":"This work is supported by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 716117) and by the Austrian Science Fund (FWF), grants No F65 and W1245.","abstract":[{"lang":"eng","text":"We consider finite-volume approximations of Fokker-Planck equations on bounded convex domains in R^d and study the corresponding gradient flow structures. We reprove the convergence of the discrete to continuous Fokker-Planck equation via the method of Evolutionary Γ-convergence, i.e., we pass to the limit at the level of the gradient flow structures, generalising the one-dimensional result obtained by Disser and Liero. The proof is of variational nature and relies on a Mosco convergence result for functionals in the discrete-to-continuum limit that is of independent interest. Our results apply to arbitrary regular meshes, even though the associated discrete transport distances may fail to converge to the Wasserstein distance in this generality."}],"department":[{"_id":"JaMa"}],"title":"Evolutionary Γ-convergence of entropic gradient flow structures for Fokker-Planck equations in multiple dimensions","author":[{"full_name":"Forkert, Dominik L","last_name":"Forkert","id":"35C79D68-F248-11E8-B48F-1D18A9856A87","first_name":"Dominik L"},{"last_name":"Maas","full_name":"Maas, Jan","orcid":"0000-0002-0845-1338","first_name":"Jan","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Lorenzo","id":"30AD2CBC-F248-11E8-B48F-1D18A9856A87","full_name":"Portinale, Lorenzo","last_name":"Portinale"}],"external_id":{"arxiv":["2008.10962"]},"article_processing_charge":"No","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","citation":{"apa":"Forkert, D. L., Maas, J., & Portinale, L. (n.d.). Evolutionary Γ-convergence of entropic gradient flow structures for Fokker-Planck equations in multiple dimensions. arXiv.","ama":"Forkert DL, Maas J, Portinale L. Evolutionary Γ-convergence of entropic gradient flow structures for Fokker-Planck equations in multiple dimensions. arXiv.","short":"D.L. Forkert, J. Maas, L. Portinale, ArXiv (n.d.).","ieee":"D. L. Forkert, J. Maas, and L. Portinale, “Evolutionary Γ-convergence of entropic gradient flow structures for Fokker-Planck equations in multiple dimensions,” arXiv. .","mla":"Forkert, Dominik L., et al. “Evolutionary Γ-Convergence of Entropic Gradient Flow Structures for Fokker-Planck Equations in Multiple Dimensions.” ArXiv, 2008.10962.","ista":"Forkert DL, Maas J, Portinale L. Evolutionary Γ-convergence of entropic gradient flow structures for Fokker-Planck equations in multiple dimensions. arXiv, 2008.10962.","chicago":"Forkert, Dominik L, Jan Maas, and Lorenzo Portinale. “Evolutionary Γ-Convergence of Entropic Gradient Flow Structures for Fokker-Planck Equations in Multiple Dimensions.” ArXiv, n.d."},"date_updated":"2023-09-07T13:31:05Z","status":"public","project":[{"call_identifier":"H2020","_id":"256E75B8-B435-11E9-9278-68D0E5697425","grant_number":"716117","name":"Optimal Transport and Stochastic Dynamics"},{"_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2","grant_number":"F6504","name":"Taming Complexity in Partial Differential Systems"}],"type":"preprint","article_number":"2008.10962","_id":"10022"},{"oa_version":"Published Version","acknowledged_ssus":[{"_id":"ScienComp"}],"abstract":[{"text":"We study the problem of learning from multiple untrusted data sources, a scenario of increasing practical relevance given the recent emergence of crowdsourcing and collaborative learning paradigms. Specifically, we analyze the situation in which a learning system obtains datasets from multiple sources, some of which might be biased or even adversarially perturbed. It is\r\nknown that in the single-source case, an adversary with the power to corrupt a fixed fraction of the training data can prevent PAC-learnability, that is, even in the limit of infinitely much training data, no learning system can approach the optimal test error. In this work we show that, surprisingly, the same is not true in the multi-source setting, where the adversary can arbitrarily\r\ncorrupt a fixed fraction of the data sources. Our main results are a generalization bound that provides finite-sample guarantees for this learning setting, as well as corresponding lower bounds. Besides establishing PAC-learnability our results also show that in a cooperative learning setting sharing data with other parties has provable benefits, even if some\r\nparticipants are malicious. ","lang":"eng"}],"month":"07","intvolume":" 119","scopus_import":"1","file":[{"creator":"dernst","date_updated":"2021-02-15T09:00:01Z","file_size":281286,"date_created":"2021-02-15T09:00:01Z","file_name":"2020_PMLR_Konstantinov.pdf","access_level":"open_access","relation":"main_file","content_type":"application/pdf","checksum":"cc755d0054bc4b2be778ea7aa7884d2f","file_id":"9120","success":1}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["2640-3498"]},"publication_status":"published","volume":119,"related_material":{"link":[{"relation":"supplementary_material","url":"http://proceedings.mlr.press/v119/konstantinov20a/konstantinov20a-supp.pdf"}],"record":[{"relation":"dissertation_contains","id":"10799","status":"public"}]},"ec_funded":1,"_id":"8724","status":"public","type":"conference","conference":{"name":"ICML: International Conference on Machine Learning","location":"Online","end_date":"2020-07-18","start_date":"2020-07-12"},"ddc":["000"],"date_updated":"2023-09-07T13:42:08Z","file_date_updated":"2021-02-15T09:00:01Z","department":[{"_id":"DaAl"},{"_id":"ChLa"}],"acknowledgement":"Dan Alistarh is supported in part by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 805223 ScaleML). This research was supported by the Scientific Service Units (SSU) of IST Austria through resources provided by Scientific Computing (SciComp).","publisher":"ML Research Press","quality_controlled":"1","oa":1,"day":"12","publication":"Proceedings of the 37th International Conference on Machine Learning","has_accepted_license":"1","year":"2020","date_published":"2020-07-12T00:00:00Z","date_created":"2020-11-05T15:25:58Z","page":"5416-5425","project":[{"call_identifier":"H2020","_id":"268A44D6-B435-11E9-9278-68D0E5697425","grant_number":"805223","name":"Elastic Coordination for Scalable Machine Learning"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Konstantinov NH, Frantar E, Alistarh D-A, Lampert C. On the sample complexity of adversarial multi-source PAC learning. In: Proceedings of the 37th International Conference on Machine Learning. Vol 119. ML Research Press; 2020:5416-5425.","apa":"Konstantinov, N. H., Frantar, E., Alistarh, D.-A., & Lampert, C. (2020). On the sample complexity of adversarial multi-source PAC learning. In Proceedings of the 37th International Conference on Machine Learning (Vol. 119, pp. 5416–5425). Online: ML Research Press.","short":"N.H. Konstantinov, E. Frantar, D.-A. Alistarh, C. Lampert, in:, Proceedings of the 37th International Conference on Machine Learning, ML Research Press, 2020, pp. 5416–5425.","ieee":"N. H. Konstantinov, E. Frantar, D.-A. Alistarh, and C. Lampert, “On the sample complexity of adversarial multi-source PAC learning,” in Proceedings of the 37th International Conference on Machine Learning, Online, 2020, vol. 119, pp. 5416–5425.","mla":"Konstantinov, Nikola H., et al. “On the Sample Complexity of Adversarial Multi-Source PAC Learning.” Proceedings of the 37th International Conference on Machine Learning, vol. 119, ML Research Press, 2020, pp. 5416–25.","ista":"Konstantinov NH, Frantar E, Alistarh D-A, Lampert C. 2020. On the sample complexity of adversarial multi-source PAC learning. Proceedings of the 37th International Conference on Machine Learning. ICML: International Conference on Machine Learning vol. 119, 5416–5425.","chicago":"Konstantinov, Nikola H, Elias Frantar, Dan-Adrian Alistarh, and Christoph Lampert. “On the Sample Complexity of Adversarial Multi-Source PAC Learning.” In Proceedings of the 37th International Conference on Machine Learning, 119:5416–25. ML Research Press, 2020."},"title":"On the sample complexity of adversarial multi-source PAC learning","author":[{"id":"4B9D76E4-F248-11E8-B48F-1D18A9856A87","first_name":"Nikola H","full_name":"Konstantinov, Nikola H","last_name":"Konstantinov"},{"full_name":"Frantar, Elias","last_name":"Frantar","id":"09a8f98d-ec99-11ea-ae11-c063a7b7fe5f","first_name":"Elias"},{"last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian"},{"full_name":"Lampert, Christoph","orcid":"0000-0001-8622-7887","last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph"}],"article_processing_charge":"No","external_id":{"arxiv":["2002.10384"]}},{"project":[{"grant_number":"665385","name":"International IST Doctoral Program","call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"},{"_id":"05A235A0-7A3F-11EA-A408-12923DDC885E","name":"Analytic and machine learning approaches to composite quantum impurities","grant_number":"25681"},{"call_identifier":"FWF","_id":"26986C82-B435-11E9-9278-68D0E5697425","name":"A path-integral approach to composite impurities","grant_number":"M02641"}],"article_number":"093026","author":[{"first_name":"Wojciech","id":"48C55298-F248-11E8-B48F-1D18A9856A87","last_name":"Rzadkowski","orcid":"0000-0002-1106-4419","full_name":"Rzadkowski, Wojciech"},{"last_name":"Defenu","full_name":"Defenu, N","first_name":"N"},{"last_name":"Chiacchiera","full_name":"Chiacchiera, S","first_name":"S"},{"first_name":"A","full_name":"Trombettoni, A","last_name":"Trombettoni"},{"first_name":"Giacomo","id":"4CA96FD4-F248-11E8-B48F-1D18A9856A87","last_name":"Bighin","full_name":"Bighin, Giacomo","orcid":"0000-0001-8823-9777"}],"external_id":{"isi":["000573298000001"]},"article_processing_charge":"No","title":"Detecting composite orders in layered models via machine learning","citation":{"chicago":"Rzadkowski, Wojciech, N Defenu, S Chiacchiera, A Trombettoni, and Giacomo Bighin. “Detecting Composite Orders in Layered Models via Machine Learning.” New Journal of Physics. IOP Publishing, 2020. https://doi.org/10.1088/1367-2630/abae44.","ista":"Rzadkowski W, Defenu N, Chiacchiera S, Trombettoni A, Bighin G. 2020. Detecting composite orders in layered models via machine learning. New Journal of Physics. 22(9), 093026.","mla":"Rzadkowski, Wojciech, et al. “Detecting Composite Orders in Layered Models via Machine Learning.” New Journal of Physics, vol. 22, no. 9, 093026, IOP Publishing, 2020, doi:10.1088/1367-2630/abae44.","ieee":"W. Rzadkowski, N. Defenu, S. Chiacchiera, A. Trombettoni, and G. Bighin, “Detecting composite orders in layered models via machine learning,” New Journal of Physics, vol. 22, no. 9. IOP Publishing, 2020.","short":"W. Rzadkowski, N. Defenu, S. Chiacchiera, A. Trombettoni, G. Bighin, New Journal of Physics 22 (2020).","ama":"Rzadkowski W, Defenu N, Chiacchiera S, Trombettoni A, Bighin G. Detecting composite orders in layered models via machine learning. New Journal of Physics. 2020;22(9). doi:10.1088/1367-2630/abae44","apa":"Rzadkowski, W., Defenu, N., Chiacchiera, S., Trombettoni, A., & Bighin, G. (2020). Detecting composite orders in layered models via machine learning. New Journal of Physics. IOP Publishing. https://doi.org/10.1088/1367-2630/abae44"},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","publisher":"IOP Publishing","quality_controlled":"1","oa":1,"acknowledgement":"We thank Gesualdo Delfino, Michele Fabrizio, Piero Ferrarese, Robert Konik, Christoph Lampert and Mikhail Lemeshko for stimulating discussions at various stages of this work. WR has received funding from the EU Horizon 2020 program under the Marie Skłodowska-Curie Grant Agreement No. 665385 and is a recipient of a DOC Fellowship of the Austrian Academy of Sciences. GB acknowledges support from the Austrian Science Fund (FWF), under project No. M2641-N27. ND acknowledges support by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) via Collaborative Research Center SFB 1225 (ISOQUANT)--project-id 273811115--and under Germany's Excellence Strategy 'EXC-2181/1-390900948' (the Heidelberg STRUCTURES Excellence Cluster).","date_published":"2020-09-01T00:00:00Z","doi":"10.1088/1367-2630/abae44","date_created":"2020-10-11T22:01:14Z","has_accepted_license":"1","isi":1,"year":"2020","day":"01","publication":"New Journal of Physics","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","_id":"8644","file_date_updated":"2020-10-12T12:18:47Z","department":[{"_id":"MiLe"}],"date_updated":"2023-09-07T13:44:16Z","ddc":["530"],"scopus_import":"1","month":"09","intvolume":" 22","abstract":[{"lang":"eng","text":"Determining the phase diagram of systems consisting of smaller subsystems 'connected' via a tunable coupling is a challenging task relevant for a variety of physical settings. A general question is whether new phases, not present in the uncoupled limit, may arise. We use machine learning and a suitable quasidistance between different points of the phase diagram to study layered spin models, in which the spin variables constituting each of the uncoupled systems (to which we refer as layers) are coupled to each other via an interlayer coupling. In such systems, in general, composite order parameters involving spins of different layers may emerge as a consequence of the interlayer coupling. We focus on the layered Ising and Ashkin–Teller models as a paradigmatic case study, determining their phase diagram via the application of a machine learning algorithm to the Monte Carlo data. Remarkably our technique is able to correctly characterize all the system phases also in the case of hidden order parameters, i.e. order parameters whose expression in terms of the microscopic configurations would require additional preprocessing of the data fed to the algorithm. We correctly retrieve the three known phases of the Ashkin–Teller model with ferromagnetic couplings, including the phase described by a composite order parameter. For the bilayer and trilayer Ising models the phases we find are only the ferromagnetic and the paramagnetic ones. Within the approach we introduce, owing to the construction of convolutional neural networks, naturally suitable for layered image-like data with arbitrary number of layers, no preprocessing of the Monte Carlo data is needed, also with regard to its spatial structure. The physical meaning of our results is discussed and compared with analytical data, where available. Yet, the method can be used without any a priori knowledge of the phases one seeks to find and can be applied to other models and structures."}],"oa_version":"Published Version","issue":"9","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"10759"}]},"volume":22,"ec_funded":1,"publication_identifier":{"issn":["13672630"]},"publication_status":"published","file":[{"file_size":2725143,"date_updated":"2020-10-12T12:18:47Z","creator":"dernst","file_name":"2020_NewJournalPhysics_Rzdkowski.pdf","date_created":"2020-10-12T12:18:47Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","success":1,"file_id":"8650","checksum":"c9238fff422e7a957c3a0d559f756b3a"}],"language":[{"iso":"eng"}]},{"project":[{"call_identifier":"H2020","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","grant_number":"694227","name":"Analysis of quantum many-body systems"},{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"},{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"665385","name":"International IST Doctoral Program"}],"citation":{"ista":"Mysliwy K, Seiringer R. 2020. Microscopic derivation of the Fröhlich Hamiltonian for the Bose polaron in the mean-field limit. Annales Henri Poincare. 21(12), 4003–4025.","chicago":"Mysliwy, Krzysztof, and Robert Seiringer. “Microscopic Derivation of the Fröhlich Hamiltonian for the Bose Polaron in the Mean-Field Limit.” Annales Henri Poincare. Springer Nature, 2020. https://doi.org/10.1007/s00023-020-00969-3.","ieee":"K. Mysliwy and R. Seiringer, “Microscopic derivation of the Fröhlich Hamiltonian for the Bose polaron in the mean-field limit,” Annales Henri Poincare, vol. 21, no. 12. Springer Nature, pp. 4003–4025, 2020.","short":"K. Mysliwy, R. Seiringer, Annales Henri Poincare 21 (2020) 4003–4025.","apa":"Mysliwy, K., & Seiringer, R. (2020). Microscopic derivation of the Fröhlich Hamiltonian for the Bose polaron in the mean-field limit. Annales Henri Poincare. Springer Nature. https://doi.org/10.1007/s00023-020-00969-3","ama":"Mysliwy K, Seiringer R. Microscopic derivation of the Fröhlich Hamiltonian for the Bose polaron in the mean-field limit. Annales Henri Poincare. 2020;21(12):4003-4025. doi:10.1007/s00023-020-00969-3","mla":"Mysliwy, Krzysztof, and Robert Seiringer. “Microscopic Derivation of the Fröhlich Hamiltonian for the Bose Polaron in the Mean-Field Limit.” Annales Henri Poincare, vol. 21, no. 12, Springer Nature, 2020, pp. 4003–25, doi:10.1007/s00023-020-00969-3."},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","external_id":{"arxiv":["2003.12371"],"isi":["000578111800002"]},"article_processing_charge":"Yes (via OA deal)","author":[{"first_name":"Krzysztof","id":"316457FC-F248-11E8-B48F-1D18A9856A87","full_name":"Mysliwy, Krzysztof","last_name":"Mysliwy"},{"id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","first_name":"Robert","last_name":"Seiringer","full_name":"Seiringer, Robert","orcid":"0000-0002-6781-0521"}],"title":"Microscopic derivation of the Fröhlich Hamiltonian for the Bose polaron in the mean-field limit","acknowledgement":"Financial support through the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme Grant agreement No. 694227 (R.S.) and the Maria Skłodowska-Curie Grant agreement No. 665386 (K.M.) is gratefully acknowledged. Funding Open access funding provided by Institute of Science and Technology (IST Austria)","oa":1,"quality_controlled":"1","publisher":"Springer Nature","year":"2020","isi":1,"has_accepted_license":"1","publication":"Annales Henri Poincare","day":"01","page":"4003-4025","date_created":"2020-10-25T23:01:19Z","doi":"10.1007/s00023-020-00969-3","date_published":"2020-12-01T00:00:00Z","_id":"8705","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","date_updated":"2023-09-07T13:43:51Z","ddc":["530"],"file_date_updated":"2020-10-27T12:49:04Z","department":[{"_id":"RoSe"}],"abstract":[{"text":"We consider the quantum mechanical many-body problem of a single impurity particle immersed in a weakly interacting Bose gas. The impurity interacts with the bosons via a two-body potential. We study the Hamiltonian of this system in the mean-field limit and rigorously show that, at low energies, the problem is well described by the Fröhlich polaron model.","lang":"eng"}],"oa_version":"Published Version","scopus_import":"1","intvolume":" 21","month":"12","publication_status":"published","publication_identifier":{"issn":["1424-0637"]},"language":[{"iso":"eng"}],"file":[{"date_updated":"2020-10-27T12:49:04Z","file_size":469831,"creator":"cziletti","date_created":"2020-10-27T12:49:04Z","file_name":"2020_Annales_Mysliwy.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"c12c9c1e6f08def245e42f3cb1d83827","file_id":"8711","success":1}],"ec_funded":1,"issue":"12","volume":21,"related_material":{"record":[{"relation":"dissertation_contains","id":"11473","status":"public"}]}},{"status":"public","keyword":["Computational Mathematics","Computational Theory and Mathematics","Computer Science Applications","Molecular Biology","Biochemistry","Statistics and Probability"],"type":"journal_article","article_type":"original","_id":"14125","department":[{"_id":"FrLo"}],"extern":"1","date_updated":"2023-09-11T10:21:00Z","month":"12","intvolume":" 36","scopus_import":"1","main_file_link":[{"url":"https://doi.org/10.1093/bioinformatics/btaa843","open_access":"1"}],"pmid":1,"oa_version":"Published Version","abstract":[{"text":"Motivation: Recent technological advances have led to an increase in the production and availability of single-cell data. The ability to integrate a set of multi-technology measurements would allow the identification of biologically or clinically meaningful observations through the unification of the perspectives afforded by each technology. In most cases, however, profiling technologies consume the used cells and thus pairwise correspondences between datasets are lost. Due to the sheer size single-cell datasets can acquire, scalable algorithms that are able to universally match single-cell measurements carried out in one cell to its corresponding sibling in another technology are needed.\r\nResults: We propose Single-Cell data Integration via Matching (SCIM), a scalable approach to recover such correspondences in two or more technologies. SCIM assumes that cells share a common (low-dimensional) underlying structure and that the underlying cell distribution is approximately constant across technologies. It constructs a technology-invariant latent space using an autoencoder framework with an adversarial objective. Multi-modal datasets are integrated by pairing cells across technologies using a bipartite matching scheme that operates on the low-dimensional latent representations. We evaluate SCIM on a simulated cellular branching process and show that the cell-to-cell matches derived by SCIM reflect the same pseudotime on the simulated dataset. Moreover, we apply our method to two real-world scenarios, a melanoma tumor sample and a human bone marrow sample, where we pair cells from a scRNA dataset to their sibling cells in a CyTOF dataset achieving 90% and 78% cell-matching accuracy for each one of the samples, respectively.","lang":"eng"}],"issue":"Supplement_2","related_material":{"link":[{"relation":"software","url":"https://github.com/ratschlab/scim"}]},"volume":36,"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1367-4811"]},"publication_status":"published","title":"SCIM: Universal single-cell matching with unpaired feature sets","author":[{"last_name":"Stark","full_name":"Stark, Stefan G","first_name":"Stefan G"},{"first_name":"Joanna","full_name":"Ficek, Joanna","last_name":"Ficek"},{"id":"26cfd52f-2483-11ee-8040-88983bcc06d4","first_name":"Francesco","full_name":"Locatello, Francesco","orcid":"0000-0002-4850-0683","last_name":"Locatello"},{"first_name":"Ximena","last_name":"Bonilla","full_name":"Bonilla, Ximena"},{"first_name":"Stéphane","last_name":"Chevrier","full_name":"Chevrier, Stéphane"},{"last_name":"Singer","full_name":"Singer, Franziska","first_name":"Franziska"},{"full_name":"Aebersold, Rudolf","last_name":"Aebersold","first_name":"Rudolf"},{"first_name":"Faisal S","last_name":"Al-Quaddoomi","full_name":"Al-Quaddoomi, Faisal S"},{"first_name":"Jonas","last_name":"Albinus","full_name":"Albinus, Jonas"},{"first_name":"Ilaria","last_name":"Alborelli","full_name":"Alborelli, Ilaria"},{"first_name":"Sonali","full_name":"Andani, Sonali","last_name":"Andani"},{"last_name":"Attinger","full_name":"Attinger, Per-Olof","first_name":"Per-Olof"},{"first_name":"Marina","full_name":"Bacac, Marina","last_name":"Bacac"},{"first_name":"Daniel","last_name":"Baumhoer","full_name":"Baumhoer, Daniel"},{"first_name":"Beatrice","full_name":"Beck-Schimmer, Beatrice","last_name":"Beck-Schimmer"},{"last_name":"Beerenwinkel","full_name":"Beerenwinkel, Niko","first_name":"Niko"},{"full_name":"Beisel, Christian","last_name":"Beisel","first_name":"Christian"},{"first_name":"Lara","last_name":"Bernasconi","full_name":"Bernasconi, Lara"},{"first_name":"Anne","last_name":"Bertolini","full_name":"Bertolini, Anne"},{"first_name":"Bernd","last_name":"Bodenmiller","full_name":"Bodenmiller, Bernd"},{"full_name":"Bonilla, Ximena","last_name":"Bonilla","first_name":"Ximena"},{"first_name":"Ruben","last_name":"Casanova","full_name":"Casanova, Ruben"},{"last_name":"Chevrier","full_name":"Chevrier, Stéphane","first_name":"Stéphane"},{"full_name":"Chicherova, Natalia","last_name":"Chicherova","first_name":"Natalia"},{"first_name":"Maya","last_name":"D'Costa","full_name":"D'Costa, Maya"},{"last_name":"Danenberg","full_name":"Danenberg, Esther","first_name":"Esther"},{"first_name":"Natalie","last_name":"Davidson","full_name":"Davidson, Natalie"},{"first_name":"Monica-Andreea Dră","last_name":"gan","full_name":"gan, Monica-Andreea Dră"},{"last_name":"Dummer","full_name":"Dummer, Reinhard","first_name":"Reinhard"},{"first_name":"Stefanie","full_name":"Engler, Stefanie","last_name":"Engler"},{"last_name":"Erkens","full_name":"Erkens, Martin","first_name":"Martin"},{"last_name":"Eschbach","full_name":"Eschbach, Katja","first_name":"Katja"},{"full_name":"Esposito, Cinzia","last_name":"Esposito","first_name":"Cinzia"},{"full_name":"Fedier, André","last_name":"Fedier","first_name":"André"},{"first_name":"Pedro","last_name":"Ferreira","full_name":"Ferreira, Pedro"},{"first_name":"Joanna","full_name":"Ficek, Joanna","last_name":"Ficek"},{"first_name":"Anja L","last_name":"Frei","full_name":"Frei, Anja L"},{"first_name":"Bruno","full_name":"Frey, Bruno","last_name":"Frey"},{"last_name":"Goetze","full_name":"Goetze, Sandra","first_name":"Sandra"},{"first_name":"Linda","full_name":"Grob, Linda","last_name":"Grob"},{"first_name":"Gabriele","last_name":"Gut","full_name":"Gut, Gabriele"},{"first_name":"Detlef","last_name":"Günther","full_name":"Günther, Detlef"},{"last_name":"Haberecker","full_name":"Haberecker, Martina","first_name":"Martina"},{"first_name":"Pirmin","last_name":"Haeuptle","full_name":"Haeuptle, Pirmin"},{"first_name":"Viola","full_name":"Heinzelmann-Schwarz, Viola","last_name":"Heinzelmann-Schwarz"},{"full_name":"Herter, Sylvia","last_name":"Herter","first_name":"Sylvia"},{"full_name":"Holtackers, Rene","last_name":"Holtackers","first_name":"Rene"},{"last_name":"Huesser","full_name":"Huesser, Tamara","first_name":"Tamara"},{"first_name":"Anja","last_name":"Irmisch","full_name":"Irmisch, Anja"},{"last_name":"Jacob","full_name":"Jacob, Francis","first_name":"Francis"},{"full_name":"Jacobs, Andrea","last_name":"Jacobs","first_name":"Andrea"},{"last_name":"Jaeger","full_name":"Jaeger, Tim M","first_name":"Tim M"},{"full_name":"Jahn, Katharina","last_name":"Jahn","first_name":"Katharina"},{"full_name":"James, Alva R","last_name":"James","first_name":"Alva R"},{"first_name":"Philip M","full_name":"Jermann, Philip M","last_name":"Jermann"},{"full_name":"Kahles, André","last_name":"Kahles","first_name":"André"},{"last_name":"Kahraman","full_name":"Kahraman, Abdullah","first_name":"Abdullah"},{"full_name":"Koelzer, Viktor H","last_name":"Koelzer","first_name":"Viktor H"},{"first_name":"Werner","last_name":"Kuebler","full_name":"Kuebler, Werner"},{"last_name":"Kuipers","full_name":"Kuipers, Jack","first_name":"Jack"},{"first_name":"Christian P","last_name":"Kunze","full_name":"Kunze, Christian P"},{"first_name":"Christian","full_name":"Kurzeder, Christian","last_name":"Kurzeder"},{"first_name":"Kjong-Van","last_name":"Lehmann","full_name":"Lehmann, Kjong-Van"},{"first_name":"Mitchell","full_name":"Levesque, Mitchell","last_name":"Levesque"},{"first_name":"Sebastian","full_name":"Lugert, Sebastian","last_name":"Lugert"},{"first_name":"Gerd","last_name":"Maass","full_name":"Maass, Gerd"},{"first_name":"Markus","last_name":"Manz","full_name":"Manz, Markus"},{"last_name":"Markolin","full_name":"Markolin, Philipp","first_name":"Philipp"},{"first_name":"Julien","full_name":"Mena, Julien","last_name":"Mena"},{"last_name":"Menzel","full_name":"Menzel, Ulrike","first_name":"Ulrike"},{"first_name":"Julian M","full_name":"Metzler, Julian M","last_name":"Metzler"},{"full_name":"Miglino, Nicola","last_name":"Miglino","first_name":"Nicola"},{"full_name":"Milani, Emanuela S","last_name":"Milani","first_name":"Emanuela S"},{"first_name":"Holger","last_name":"Moch","full_name":"Moch, Holger"},{"first_name":"Simone","full_name":"Muenst, Simone","last_name":"Muenst"},{"first_name":"Riccardo","full_name":"Murri, Riccardo","last_name":"Murri"},{"last_name":"Ng","full_name":"Ng, Charlotte KY","first_name":"Charlotte KY"},{"last_name":"Nicolet","full_name":"Nicolet, Stefan","first_name":"Stefan"},{"last_name":"Nowak","full_name":"Nowak, Marta","first_name":"Marta"},{"full_name":"Pedrioli, Patrick GA","last_name":"Pedrioli","first_name":"Patrick GA"},{"last_name":"Pelkmans","full_name":"Pelkmans, Lucas","first_name":"Lucas"},{"full_name":"Piscuoglio, Salvatore","last_name":"Piscuoglio","first_name":"Salvatore"},{"last_name":"Prummer","full_name":"Prummer, Michael","first_name":"Michael"},{"first_name":"Mathilde","last_name":"Ritter","full_name":"Ritter, Mathilde"},{"first_name":"Christian","full_name":"Rommel, Christian","last_name":"Rommel"},{"first_name":"María L","full_name":"Rosano-González, María L","last_name":"Rosano-González"},{"full_name":"Rätsch, Gunnar","last_name":"Rätsch","first_name":"Gunnar"},{"full_name":"Santacroce, Natascha","last_name":"Santacroce","first_name":"Natascha"},{"first_name":"Jacobo Sarabia del","last_name":"Castillo","full_name":"Castillo, Jacobo Sarabia del"},{"full_name":"Schlenker, Ramona","last_name":"Schlenker","first_name":"Ramona"},{"last_name":"Schwalie","full_name":"Schwalie, Petra C","first_name":"Petra C"},{"first_name":"Severin","last_name":"Schwan","full_name":"Schwan, Severin"},{"full_name":"Schär, Tobias","last_name":"Schär","first_name":"Tobias"},{"first_name":"Gabriela","full_name":"Senti, Gabriela","last_name":"Senti"},{"first_name":"Franziska","last_name":"Singer","full_name":"Singer, Franziska"},{"first_name":"Sujana","full_name":"Sivapatham, Sujana","last_name":"Sivapatham"},{"full_name":"Snijder, Berend","last_name":"Snijder","first_name":"Berend"},{"first_name":"Bettina","full_name":"Sobottka, Bettina","last_name":"Sobottka"},{"first_name":"Vipin T","last_name":"Sreedharan","full_name":"Sreedharan, Vipin T"},{"first_name":"Stefan","last_name":"Stark","full_name":"Stark, Stefan"},{"first_name":"Daniel J","last_name":"Stekhoven","full_name":"Stekhoven, Daniel J"},{"first_name":"Alexandre PA","full_name":"Theocharides, Alexandre PA","last_name":"Theocharides"},{"first_name":"Tinu M","last_name":"Thomas","full_name":"Thomas, Tinu M"},{"first_name":"Markus","last_name":"Tolnay","full_name":"Tolnay, Markus"},{"first_name":"Vinko","full_name":"Tosevski, Vinko","last_name":"Tosevski"},{"first_name":"Nora C","full_name":"Toussaint, Nora C","last_name":"Toussaint"},{"first_name":"Mustafa A","full_name":"Tuncel, Mustafa A","last_name":"Tuncel"},{"first_name":"Marina","full_name":"Tusup, Marina","last_name":"Tusup"},{"last_name":"Drogen","full_name":"Drogen, Audrey Van","first_name":"Audrey Van"},{"last_name":"Vetter","full_name":"Vetter, Marcus","first_name":"Marcus"},{"first_name":"Tatjana","full_name":"Vlajnic, Tatjana","last_name":"Vlajnic"},{"first_name":"Sandra","last_name":"Weber","full_name":"Weber, Sandra"},{"full_name":"Weber, Walter P","last_name":"Weber","first_name":"Walter P"},{"full_name":"Wegmann, Rebekka","last_name":"Wegmann","first_name":"Rebekka"},{"first_name":"Michael","full_name":"Weller, Michael","last_name":"Weller"},{"last_name":"Wendt","full_name":"Wendt, Fabian","first_name":"Fabian"},{"first_name":"Norbert","full_name":"Wey, Norbert","last_name":"Wey"},{"full_name":"Wicki, Andreas","last_name":"Wicki","first_name":"Andreas"},{"full_name":"Wollscheid, Bernd","last_name":"Wollscheid","first_name":"Bernd"},{"full_name":"Yu, Shuqing","last_name":"Yu","first_name":"Shuqing"},{"first_name":"Johanna","full_name":"Ziegler, Johanna","last_name":"Ziegler"},{"last_name":"Zimmermann","full_name":"Zimmermann, Marc","first_name":"Marc"},{"first_name":"Martin","full_name":"Zoche, Martin","last_name":"Zoche"},{"first_name":"Gregor","last_name":"Zuend","full_name":"Zuend, Gregor"},{"first_name":"Gunnar","last_name":"Rätsch","full_name":"Rätsch, Gunnar"},{"first_name":"Kjong-Van","full_name":"Lehmann, Kjong-Van","last_name":"Lehmann"}],"article_processing_charge":"No","external_id":{"pmid":["33381818"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Stark, S. G., Ficek, J., Locatello, F., Bonilla, X., Chevrier, S., Singer, F., … Lehmann, K.-V. (2020). SCIM: Universal single-cell matching with unpaired feature sets. Bioinformatics. Oxford University Press. https://doi.org/10.1093/bioinformatics/btaa843","ama":"Stark SG, Ficek J, Locatello F, et al. SCIM: Universal single-cell matching with unpaired feature sets. Bioinformatics. 2020;36(Supplement_2):i919-i927. doi:10.1093/bioinformatics/btaa843","short":"S.G. Stark, J. Ficek, F. Locatello, X. Bonilla, S. Chevrier, F. Singer, R. Aebersold, F.S. Al-Quaddoomi, J. Albinus, I. Alborelli, S. Andani, P.-O. Attinger, M. Bacac, D. Baumhoer, B. Beck-Schimmer, N. Beerenwinkel, C. Beisel, L. Bernasconi, A. Bertolini, B. Bodenmiller, X. Bonilla, R. Casanova, S. Chevrier, N. Chicherova, M. D’Costa, E. Danenberg, N. Davidson, M.-A.D. gan, R. Dummer, S. Engler, M. Erkens, K. Eschbach, C. Esposito, A. Fedier, P. Ferreira, J. Ficek, A.L. Frei, B. Frey, S. Goetze, L. Grob, G. Gut, D. Günther, M. Haberecker, P. Haeuptle, V. Heinzelmann-Schwarz, S. Herter, R. Holtackers, T. Huesser, A. Irmisch, F. Jacob, A. Jacobs, T.M. Jaeger, K. Jahn, A.R. James, P.M. Jermann, A. Kahles, A. Kahraman, V.H. Koelzer, W. Kuebler, J. Kuipers, C.P. Kunze, C. Kurzeder, K.-V. Lehmann, M. Levesque, S. Lugert, G. Maass, M. Manz, P. Markolin, J. Mena, U. Menzel, J.M. Metzler, N. Miglino, E.S. Milani, H. Moch, S. Muenst, R. Murri, C.K. Ng, S. Nicolet, M. Nowak, P.G. Pedrioli, L. Pelkmans, S. Piscuoglio, M. Prummer, M. Ritter, C. Rommel, M.L. Rosano-González, G. Rätsch, N. Santacroce, J.S. del Castillo, R. Schlenker, P.C. Schwalie, S. Schwan, T. Schär, G. Senti, F. Singer, S. Sivapatham, B. Snijder, B. Sobottka, V.T. Sreedharan, S. Stark, D.J. Stekhoven, A.P. Theocharides, T.M. Thomas, M. Tolnay, V. Tosevski, N.C. Toussaint, M.A. Tuncel, M. Tusup, A.V. Drogen, M. Vetter, T. Vlajnic, S. Weber, W.P. Weber, R. Wegmann, M. Weller, F. Wendt, N. Wey, A. Wicki, B. Wollscheid, S. Yu, J. Ziegler, M. Zimmermann, M. Zoche, G. Zuend, G. Rätsch, K.-V. Lehmann, Bioinformatics 36 (2020) i919–i927.","ieee":"S. G. Stark et al., “SCIM: Universal single-cell matching with unpaired feature sets,” Bioinformatics, vol. 36, no. Supplement_2. Oxford University Press, pp. i919–i927, 2020.","mla":"Stark, Stefan G., et al. “SCIM: Universal Single-Cell Matching with Unpaired Feature Sets.” Bioinformatics, vol. 36, no. Supplement_2, Oxford University Press, 2020, pp. i919–27, doi:10.1093/bioinformatics/btaa843.","ista":"Stark SG et al. 2020. SCIM: Universal single-cell matching with unpaired feature sets. Bioinformatics. 36(Supplement_2), i919–i927.","chicago":"Stark, Stefan G, Joanna Ficek, Francesco Locatello, Ximena Bonilla, Stéphane Chevrier, Franziska Singer, Rudolf Aebersold, et al. “SCIM: Universal Single-Cell Matching with Unpaired Feature Sets.” Bioinformatics. Oxford University Press, 2020. https://doi.org/10.1093/bioinformatics/btaa843."},"publisher":"Oxford University Press","quality_controlled":"1","oa":1,"doi":"10.1093/bioinformatics/btaa843","date_published":"2020-12-01T00:00:00Z","date_created":"2023-08-21T12:28:20Z","page":"i919-i927","day":"01","publication":"Bioinformatics","year":"2020"},{"quality_controlled":"1","publisher":"Association for the Advancement of Artificial Intelligence","oa":1,"page":"13681-13684","date_published":"2020-07-28T00:00:00Z","doi":"10.1609/aaai.v34i09.7120","date_created":"2023-08-22T14:07:26Z","year":"2020","day":"28","publication":"The 34th AAAI Conference on Artificial Intelligence","author":[{"full_name":"Locatello, Francesco","orcid":"0000-0002-4850-0683","last_name":"Locatello","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","first_name":"Francesco"},{"first_name":"Stefan","last_name":"Bauer","full_name":"Bauer, Stefan"},{"first_name":"Mario","last_name":"Lucic","full_name":"Lucic, Mario"},{"first_name":"Gunnar","full_name":"Rätsch, Gunnar","last_name":"Rätsch"},{"last_name":"Gelly","full_name":"Gelly, Sylvain","first_name":"Sylvain"},{"first_name":"Bernhard","full_name":"Schölkopf, Bernhard","last_name":"Schölkopf"},{"first_name":"Olivier","full_name":"Bachem, Olivier","last_name":"Bachem"}],"article_processing_charge":"No","external_id":{"arxiv":["2007.14184"]},"title":"A commentary on the unsupervised learning of disentangled representations","citation":{"chicago":"Locatello, Francesco, Stefan Bauer, Mario Lucic, Gunnar Rätsch, Sylvain Gelly, Bernhard Schölkopf, and Olivier Bachem. “A Commentary on the Unsupervised Learning of Disentangled Representations.” In The 34th AAAI Conference on Artificial Intelligence, 34:13681–84. Association for the Advancement of Artificial Intelligence, 2020. https://doi.org/10.1609/aaai.v34i09.7120.","ista":"Locatello F, Bauer S, Lucic M, Rätsch G, Gelly S, Schölkopf B, Bachem O. 2020. A commentary on the unsupervised learning of disentangled representations. The 34th AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 34, 13681–13684.","mla":"Locatello, Francesco, et al. “A Commentary on the Unsupervised Learning of Disentangled Representations.” The 34th AAAI Conference on Artificial Intelligence, vol. 34, no. 9, Association for the Advancement of Artificial Intelligence, 2020, pp. 13681–84, doi:10.1609/aaai.v34i09.7120.","apa":"Locatello, F., Bauer, S., Lucic, M., Rätsch, G., Gelly, S., Schölkopf, B., & Bachem, O. (2020). A commentary on the unsupervised learning of disentangled representations. In The 34th AAAI Conference on Artificial Intelligence (Vol. 34, pp. 13681–13684). New York, NY, United States: Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/aaai.v34i09.7120","ama":"Locatello F, Bauer S, Lucic M, et al. A commentary on the unsupervised learning of disentangled representations. In: The 34th AAAI Conference on Artificial Intelligence. Vol 34. Association for the Advancement of Artificial Intelligence; 2020:13681-13684. doi:10.1609/aaai.v34i09.7120","short":"F. Locatello, S. Bauer, M. Lucic, G. Rätsch, S. Gelly, B. Schölkopf, O. Bachem, in:, The 34th AAAI Conference on Artificial Intelligence, Association for the Advancement of Artificial Intelligence, 2020, pp. 13681–13684.","ieee":"F. Locatello et al., “A commentary on the unsupervised learning of disentangled representations,” in The 34th AAAI Conference on Artificial Intelligence, New York, NY, United States, 2020, vol. 34, no. 9, pp. 13681–13684."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/2007.14184","open_access":"1"}],"month":"07","intvolume":" 34","abstract":[{"lang":"eng","text":"The goal of the unsupervised learning of disentangled representations is to\r\nseparate the independent explanatory factors of variation in the data without\r\naccess to supervision. In this paper, we summarize the results of Locatello et\r\nal., 2019, and focus on their implications for practitioners. We discuss the\r\ntheoretical result showing that the unsupervised learning of disentangled\r\nrepresentations is fundamentally impossible without inductive biases and the\r\npractical challenges it entails. Finally, we comment on our experimental\r\nfindings, highlighting the limitations of state-of-the-art approaches and\r\ndirections for future research."}],"oa_version":"Preprint","volume":34,"issue":"9","publication_identifier":{"eissn":["2374-3468"],"isbn":["9781577358350"]},"publication_status":"published","language":[{"iso":"eng"}],"type":"conference","conference":{"end_date":"2020-02-12","location":"New York, NY, United States","start_date":"2020-02-07","name":"AAAI: Conference on Artificial Intelligence"},"status":"public","_id":"14186","department":[{"_id":"FrLo"}],"date_updated":"2023-09-12T07:44:48Z","extern":"1"},{"_id":"14188","type":"conference","conference":{"name":"International Conference on Machine Learning","location":"Virtual","end_date":"2020-07-18","start_date":"2020-07-13"},"status":"public","date_updated":"2023-09-12T07:59:29Z","extern":"1","department":[{"_id":"FrLo"}],"abstract":[{"lang":"eng","text":"Intelligent agents should be able to learn useful representations by\r\nobserving changes in their environment. We model such observations as pairs of\r\nnon-i.i.d. images sharing at least one of the underlying factors of variation.\r\nFirst, we theoretically show that only knowing how many factors have changed,\r\nbut not which ones, is sufficient to learn disentangled representations.\r\nSecond, we provide practical algorithms that learn disentangled representations\r\nfrom pairs of images without requiring annotation of groups, individual\r\nfactors, or the number of factors that have changed. Third, we perform a\r\nlarge-scale empirical study and show that such pairs of observations are\r\nsufficient to reliably learn disentangled representations on several benchmark\r\ndata sets. Finally, we evaluate our learned representations and find that they\r\nare simultaneously useful on a diverse suite of tasks, including generalization\r\nunder covariate shifts, fairness, and abstract reasoning. Overall, our results\r\ndemonstrate that weak supervision enables learning of useful disentangled\r\nrepresentations in realistic scenarios."}],"oa_version":"Preprint","alternative_title":["PMLR"],"scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2002.02886"}],"month":"07","intvolume":" 119","publication_status":"published","language":[{"iso":"eng"}],"volume":119,"citation":{"ama":"Locatello F, Poole B, Rätsch G, Schölkopf B, Bachem O, Tschannen M. Weakly-supervised disentanglement without compromises. In: Proceedings of the 37th International Conference on Machine Learning. Vol 119. ; 2020:6348–6359.","apa":"Locatello, F., Poole, B., Rätsch, G., Schölkopf, B., Bachem, O., & Tschannen, M. (2020). Weakly-supervised disentanglement without compromises. In Proceedings of the 37th International Conference on Machine Learning (Vol. 119, pp. 6348–6359). Virtual.","short":"F. Locatello, B. Poole, G. Rätsch, B. Schölkopf, O. Bachem, M. Tschannen, in:, Proceedings of the 37th International Conference on Machine Learning, 2020, pp. 6348–6359.","ieee":"F. Locatello, B. Poole, G. Rätsch, B. Schölkopf, O. Bachem, and M. Tschannen, “Weakly-supervised disentanglement without compromises,” in Proceedings of the 37th International Conference on Machine Learning, Virtual, 2020, vol. 119, pp. 6348–6359.","mla":"Locatello, Francesco, et al. “Weakly-Supervised Disentanglement without Compromises.” Proceedings of the 37th International Conference on Machine Learning, vol. 119, 2020, pp. 6348–6359.","ista":"Locatello F, Poole B, Rätsch G, Schölkopf B, Bachem O, Tschannen M. 2020. Weakly-supervised disentanglement without compromises. Proceedings of the 37th International Conference on Machine Learning. International Conference on Machine Learning, PMLR, vol. 119, 6348–6359.","chicago":"Locatello, Francesco, Ben Poole, Gunnar Rätsch, Bernhard Schölkopf, Olivier Bachem, and Michael Tschannen. “Weakly-Supervised Disentanglement without Compromises.” In Proceedings of the 37th International Conference on Machine Learning, 119:6348–6359, 2020."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Francesco","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","orcid":"0000-0002-4850-0683","full_name":"Locatello, Francesco","last_name":"Locatello"},{"first_name":"Ben","last_name":"Poole","full_name":"Poole, Ben"},{"last_name":"Rätsch","full_name":"Rätsch, Gunnar","first_name":"Gunnar"},{"full_name":"Schölkopf, Bernhard","last_name":"Schölkopf","first_name":"Bernhard"},{"first_name":"Olivier","last_name":"Bachem","full_name":"Bachem, Olivier"},{"first_name":"Michael","full_name":"Tschannen, Michael","last_name":"Tschannen"}],"article_processing_charge":"No","external_id":{"arxiv":["2002.02886"]},"title":"Weakly-supervised disentanglement without compromises","quality_controlled":"1","oa":1,"year":"2020","day":"07","publication":"Proceedings of the 37th International Conference on Machine Learning","page":"6348–6359","date_published":"2020-07-07T00:00:00Z","date_created":"2023-08-22T14:08:14Z"},{"intvolume":" 119","month":"07","oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/2002.11860","open_access":"1"}],"alternative_title":["PMLR"],"quality_controlled":"1","oa_version":"Preprint","abstract":[{"text":"We propose a novel Stochastic Frank-Wolfe (a.k.a. conditional gradient)\r\nalgorithm for constrained smooth finite-sum minimization with a generalized\r\nlinear prediction/structure. This class of problems includes empirical risk\r\nminimization with sparse, low-rank, or other structured constraints. The\r\nproposed method is simple to implement, does not require step-size tuning, and\r\nhas a constant per-iteration cost that is independent of the dataset size.\r\nFurthermore, as a byproduct of the method we obtain a stochastic estimator of\r\nthe Frank-Wolfe gap that can be used as a stopping criterion. Depending on the\r\nsetting, the proposed method matches or improves on the best computational\r\nguarantees for Stochastic Frank-Wolfe algorithms. Benchmarks on several\r\ndatasets highlight different regimes in which the proposed method exhibits a\r\nfaster empirical convergence than related methods. Finally, we provide an\r\nimplementation of all considered methods in an open-source package.","lang":"eng"}],"date_created":"2023-08-22T14:07:52Z","date_published":"2020-07-27T00:00:00Z","volume":119,"page":"7253-7262","publication":"Proceedings of the 37th International Conference on Machine Learning","language":[{"iso":"eng"}],"day":"27","year":"2020","publication_status":"published","status":"public","conference":{"name":"International Conference on Machine Learning","start_date":"2020-07-13","location":"Virtual","end_date":"2020-07-18"},"type":"conference","_id":"14187","title":"Stochastic Frank-Wolfe for constrained finite-sum minimization","department":[{"_id":"FrLo"}],"external_id":{"arxiv":["2002.11860"]},"article_processing_charge":"No","author":[{"first_name":"Geoffrey","full_name":"Négiar, Geoffrey","last_name":"Négiar"},{"full_name":"Dresdner, Gideon","last_name":"Dresdner","first_name":"Gideon"},{"first_name":"Alicia","full_name":"Tsai, Alicia","last_name":"Tsai"},{"first_name":"Laurent El","last_name":"Ghaoui","full_name":"Ghaoui, Laurent El"},{"first_name":"Francesco","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","orcid":"0000-0002-4850-0683","full_name":"Locatello, Francesco","last_name":"Locatello"},{"first_name":"Robert M.","last_name":"Freund","full_name":"Freund, Robert M."},{"full_name":"Pedregosa, Fabian","last_name":"Pedregosa","first_name":"Fabian"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","citation":{"chicago":"Négiar, Geoffrey, Gideon Dresdner, Alicia Tsai, Laurent El Ghaoui, Francesco Locatello, Robert M. Freund, and Fabian Pedregosa. “Stochastic Frank-Wolfe for Constrained Finite-Sum Minimization.” In Proceedings of the 37th International Conference on Machine Learning, 119:7253–62, 2020.","ista":"Négiar G, Dresdner G, Tsai A, Ghaoui LE, Locatello F, Freund RM, Pedregosa F. 2020. Stochastic Frank-Wolfe for constrained finite-sum minimization. Proceedings of the 37th International Conference on Machine Learning. International Conference on Machine Learning, PMLR, vol. 119, 7253–7262.","mla":"Négiar, Geoffrey, et al. “Stochastic Frank-Wolfe for Constrained Finite-Sum Minimization.” Proceedings of the 37th International Conference on Machine Learning, vol. 119, 2020, pp. 7253–62.","short":"G. Négiar, G. Dresdner, A. Tsai, L.E. Ghaoui, F. Locatello, R.M. Freund, F. Pedregosa, in:, Proceedings of the 37th International Conference on Machine Learning, 2020, pp. 7253–7262.","ieee":"G. Négiar et al., “Stochastic Frank-Wolfe for constrained finite-sum minimization,” in Proceedings of the 37th International Conference on Machine Learning, Virtual, 2020, vol. 119, pp. 7253–7262.","ama":"Négiar G, Dresdner G, Tsai A, et al. Stochastic Frank-Wolfe for constrained finite-sum minimization. In: Proceedings of the 37th International Conference on Machine Learning. Vol 119. ; 2020:7253-7262.","apa":"Négiar, G., Dresdner, G., Tsai, A., Ghaoui, L. E., Locatello, F., Freund, R. M., & Pedregosa, F. (2020). Stochastic Frank-Wolfe for constrained finite-sum minimization. In Proceedings of the 37th International Conference on Machine Learning (Vol. 119, pp. 7253–7262). Virtual."},"date_updated":"2023-09-12T08:03:40Z"},{"article_number":"209","title":"A sober look at the unsupervised learning of disentangled representations and their evaluation","external_id":{"arxiv":["2010.14766"]},"article_processing_charge":"No","author":[{"orcid":"0000-0002-4850-0683","full_name":"Locatello, Francesco","last_name":"Locatello","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","first_name":"Francesco"},{"first_name":"Stefan","full_name":"Bauer, Stefan","last_name":"Bauer"},{"last_name":"Lucic","full_name":"Lucic, Mario","first_name":"Mario"},{"first_name":"Gunnar","full_name":"Rätsch, Gunnar","last_name":"Rätsch"},{"first_name":"Sylvain","full_name":"Gelly, Sylvain","last_name":"Gelly"},{"last_name":"Schölkopf","full_name":"Schölkopf, Bernhard","first_name":"Bernhard"},{"full_name":"Bachem, Olivier","last_name":"Bachem","first_name":"Olivier"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Locatello F, Bauer S, Lucic M, Rätsch G, Gelly S, Schölkopf B, Bachem O. 2020. A sober look at the unsupervised learning of disentangled representations and their evaluation. Journal of Machine Learning Research. 21, 209.","chicago":"Locatello, Francesco, Stefan Bauer, Mario Lucic, Gunnar Rätsch, Sylvain Gelly, Bernhard Schölkopf, and Olivier Bachem. “A Sober Look at the Unsupervised Learning of Disentangled Representations and Their Evaluation.” Journal of Machine Learning Research. MIT Press, 2020.","ieee":"F. Locatello et al., “A sober look at the unsupervised learning of disentangled representations and their evaluation,” Journal of Machine Learning Research, vol. 21. MIT Press, 2020.","short":"F. Locatello, S. Bauer, M. Lucic, G. Rätsch, S. Gelly, B. Schölkopf, O. Bachem, Journal of Machine Learning Research 21 (2020).","apa":"Locatello, F., Bauer, S., Lucic, M., Rätsch, G., Gelly, S., Schölkopf, B., & Bachem, O. (2020). A sober look at the unsupervised learning of disentangled representations and their evaluation. Journal of Machine Learning Research. MIT Press.","ama":"Locatello F, Bauer S, Lucic M, et al. A sober look at the unsupervised learning of disentangled representations and their evaluation. Journal of Machine Learning Research. 2020;21.","mla":"Locatello, Francesco, et al. “A Sober Look at the Unsupervised Learning of Disentangled Representations and Their Evaluation.” Journal of Machine Learning Research, vol. 21, 209, MIT Press, 2020."},"oa":1,"quality_controlled":"1","publisher":"MIT Press","date_created":"2023-08-22T14:10:34Z","date_published":"2020-09-01T00:00:00Z","publication":"Journal of Machine Learning Research","day":"01","year":"2020","has_accepted_license":"1","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":"14195","department":[{"_id":"FrLo"}],"ddc":["000"],"extern":"1","date_updated":"2023-09-12T09:23:56Z","intvolume":" 21","month":"09","main_file_link":[{"open_access":"1","url":"https://jmlr.csail.mit.edu/papers/v21/19-976.html"}],"scopus_import":"1","oa_version":"Published Version","abstract":[{"lang":"eng","text":"The idea behind the unsupervised learning of disentangled representations is that real-world data is generated by a few explanatory factors of variation which can be recovered by unsupervised learning algorithms. In this paper, we provide a sober look at recent progress in the field and challenge some common assumptions. We first theoretically show that the unsupervised learning of disentangled representations is fundamentally impossible without inductive biases on both the models and the data. Then, we train over 14000\r\n models covering most prominent methods and evaluation metrics in a reproducible large-scale experimental study on eight data sets. We observe that while the different methods successfully enforce properties “encouraged” by the corresponding losses, well-disentangled models seemingly cannot be identified without supervision. Furthermore, different evaluation metrics do not always agree on what should be considered “disentangled” and exhibit systematic differences in the estimation. Finally, increased disentanglement does not seem to necessarily lead to a decreased sample complexity of learning for downstream tasks. Our results suggest that future work on disentanglement learning should be explicit about the role of inductive biases and (implicit) supervision, investigate concrete benefits of enforcing disentanglement of the learned representations, and consider a reproducible experimental setup covering several data sets."}],"volume":21,"language":[{"iso":"eng"}],"publication_status":"published"},{"ddc":["000","570"],"date_updated":"2023-09-12T11:02:24Z","department":[{"_id":"CaGu"},{"_id":"GaTk"}],"file_date_updated":"2020-07-14T12:48:00Z","_id":"7569","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)"},"type":"journal_article","article_type":"original","language":[{"iso":"eng"}],"file":[{"date_created":"2020-03-09T15:12:21Z","file_name":"2020_PlosCompBio_Grah.pdf","creator":"dernst","date_updated":"2020-07-14T12:48:00Z","file_size":2209325,"checksum":"5239dd134dc6e1c71fe7b3ce2953da37","file_id":"7579","access_level":"open_access","relation":"main_file","content_type":"application/pdf"}],"publication_status":"published","publication_identifier":{"issn":["1553-7358"]},"volume":16,"issue":"2","related_material":{"record":[{"id":"9716","status":"deleted","relation":"research_data"},{"status":"public","id":"9776","relation":"research_data"},{"status":"public","id":"9779","relation":"used_in_publication"},{"status":"public","id":"8155","relation":"dissertation_contains"},{"id":"9777","status":"public","relation":"research_data"}]},"oa_version":"Published Version","abstract":[{"text":"Genes differ in the frequency at which they are expressed and in the form of regulation used to control their activity. In particular, positive or negative regulation can lead to activation of a gene in response to an external signal. Previous works proposed that the form of regulation of a gene correlates with its frequency of usage: positive regulation when the gene is frequently expressed and negative regulation when infrequently expressed. Such network design means that, in the absence of their regulators, the genes are found in their least required activity state, hence regulatory intervention is often necessary. Due to the multitude of genes and regulators, spurious binding and unbinding events, called “crosstalk”, could occur. To determine how the form of regulation affects the global crosstalk in the network, we used a mathematical model that includes multiple regulators and multiple target genes. We found that crosstalk depends non-monotonically on the availability of regulators. Our analysis showed that excess use of regulation entailed by the formerly suggested network design caused high crosstalk levels in a large part of the parameter space. We therefore considered the opposite ‘idle’ design, where the default unregulated state of genes is their frequently required activity state. We found, that ‘idle’ design minimized the use of regulation and thus minimized crosstalk. In addition, we estimated global crosstalk of S. cerevisiae using transcription factors binding data. We demonstrated that even partial network data could suffice to estimate its global crosstalk, suggesting its applicability to additional organisms. We found that S. cerevisiae estimated crosstalk is lower than that of a random network, suggesting that natural selection reduces crosstalk. In summary, our study highlights a new type of protein production cost which is typically overlooked: that of regulatory interference caused by the presence of excess regulators in the cell. It demonstrates the importance of whole-network descriptions, which could show effects missed by single-gene models.","lang":"eng"}],"intvolume":" 16","month":"02","scopus_import":"1","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"mla":"Grah, Rok, and Tamar Friedlander. “The Relation between Crosstalk and Gene Regulation Form Revisited.” PLOS Computational Biology, vol. 16, no. 2, e1007642, Public Library of Science, 2020, doi:10.1371/journal.pcbi.1007642.","short":"R. Grah, T. Friedlander, PLOS Computational Biology 16 (2020).","ieee":"R. Grah and T. Friedlander, “The relation between crosstalk and gene regulation form revisited,” PLOS Computational Biology, vol. 16, no. 2. Public Library of Science, 2020.","apa":"Grah, R., & Friedlander, T. (2020). The relation between crosstalk and gene regulation form revisited. PLOS Computational Biology. Public Library of Science. https://doi.org/10.1371/journal.pcbi.1007642","ama":"Grah R, Friedlander T. The relation between crosstalk and gene regulation form revisited. PLOS Computational Biology. 2020;16(2). doi:10.1371/journal.pcbi.1007642","chicago":"Grah, Rok, and Tamar Friedlander. “The Relation between Crosstalk and Gene Regulation Form Revisited.” PLOS Computational Biology. Public Library of Science, 2020. https://doi.org/10.1371/journal.pcbi.1007642.","ista":"Grah R, Friedlander T. 2020. The relation between crosstalk and gene regulation form revisited. PLOS Computational Biology. 16(2), e1007642."},"title":"The relation between crosstalk and gene regulation form revisited","external_id":{"isi":["000526725200019"]},"article_processing_charge":"No","author":[{"id":"483E70DE-F248-11E8-B48F-1D18A9856A87","first_name":"Rok","orcid":"0000-0003-2539-3560","full_name":"Grah, Rok","last_name":"Grah"},{"first_name":"Tamar","last_name":"Friedlander","full_name":"Friedlander, Tamar"}],"article_number":"e1007642","publication":"PLOS Computational Biology","day":"25","year":"2020","has_accepted_license":"1","isi":1,"date_created":"2020-03-06T07:39:38Z","date_published":"2020-02-25T00:00:00Z","doi":"10.1371/journal.pcbi.1007642","oa":1,"quality_controlled":"1","publisher":"Public Library of Science"},{"date_created":"2020-11-26T07:17:19Z","doi":"10.1101/2020.11.03.366948","date_published":"2020-11-05T00:00:00Z","year":"2020","publication_status":"submitted","publication":"bioRxiv","language":[{"iso":"eng"}],"day":"05","oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1101/2020.11.03.366948"}],"publisher":"Cold Spring Harbor Laboratory","month":"11","abstract":[{"text":"In mammals, chromatin marks at imprinted genes are asymmetrically inherited to control parentally-biased gene expression. This control is thought predominantly to involve parent-specific differentially methylated regions (DMR) in genomic DNA. However, neither parent-of-origin-specific transcription nor DMRs have been comprehensively mapped. We here address this by integrating transcriptomic and epigenomic approaches in mouse preimplantation embryos (blastocysts). Transcriptome-analysis identified 71 genes expressed with previously unknown parent-of-origin-specific expression in blastocysts (nBiX: novel blastocyst-imprinted expression). Uniparental expression of nBiX genes disappeared soon after implantation. Micro-whole-genome bisulfite sequencing (μWGBS) of individual uniparental blastocysts detected 859 DMRs. Only 18% of nBiXs were associated with a DMR, whereas 60% were associated with parentally-biased H3K27me3. This suggests a major role for Polycomb-mediated imprinting in blastocysts. Five nBiX-clusters contained at least one known imprinted gene, and five novel clusters contained exclusively nBiX-genes. These data suggest a complex program of stage-specific imprinting involving different tiers of regulation.","lang":"eng"}],"pmid":1,"oa_version":"Preprint","external_id":{"pmid":["PPR234457 "]},"article_processing_charge":"No","author":[{"first_name":"Laura","full_name":"Santini, Laura","last_name":"Santini"},{"first_name":"Florian","full_name":"Halbritter, Florian","last_name":"Halbritter"},{"first_name":"Fabian","last_name":"Titz-Teixeira","full_name":"Titz-Teixeira, Fabian"},{"first_name":"Toru","last_name":"Suzuki","full_name":"Suzuki, Toru"},{"last_name":"Asami","full_name":"Asami, Maki","first_name":"Maki"},{"first_name":"Julia","full_name":"Ramesmayer, Julia","last_name":"Ramesmayer"},{"full_name":"Ma, Xiaoyan","last_name":"Ma","first_name":"Xiaoyan"},{"first_name":"Andreas","last_name":"Lackner","full_name":"Lackner, Andreas"},{"last_name":"Warr","full_name":"Warr, Nick","first_name":"Nick"},{"orcid":"0000-0002-7462-0048","full_name":"Pauler, Florian","last_name":"Pauler","id":"48EA0138-F248-11E8-B48F-1D18A9856A87","first_name":"Florian"},{"last_name":"Hippenmeyer","full_name":"Hippenmeyer, Simon","orcid":"0000-0003-2279-1061","id":"37B36620-F248-11E8-B48F-1D18A9856A87","first_name":"Simon"},{"first_name":"Ernest","last_name":"Laue","full_name":"Laue, Ernest"},{"first_name":"Matthias","full_name":"Farlik, Matthias","last_name":"Farlik"},{"first_name":"Christoph","last_name":"Bock","full_name":"Bock, Christoph"},{"first_name":"Andreas","last_name":"Beyer","full_name":"Beyer, Andreas"},{"full_name":"Perry, Anthony C. F.","last_name":"Perry","first_name":"Anthony C. F."},{"first_name":"Martin","last_name":"Leeb","full_name":"Leeb, Martin"}],"department":[{"_id":"SiHi"}],"title":"Novel imprints in mouse blastocysts are predominantly DNA methylation independent","date_updated":"2023-09-12T11:05:28Z","citation":{"chicago":"Santini, Laura, Florian Halbritter, Fabian Titz-Teixeira, Toru Suzuki, Maki Asami, Julia Ramesmayer, Xiaoyan Ma, et al. “Novel Imprints in Mouse Blastocysts Are Predominantly DNA Methylation Independent.” BioRxiv. Cold Spring Harbor Laboratory, n.d. https://doi.org/10.1101/2020.11.03.366948.","ista":"Santini L, Halbritter F, Titz-Teixeira F, Suzuki T, Asami M, Ramesmayer J, Ma X, Lackner A, Warr N, Pauler F, Hippenmeyer S, Laue E, Farlik M, Bock C, Beyer A, Perry ACF, Leeb M. Novel imprints in mouse blastocysts are predominantly DNA methylation independent. bioRxiv, 10.1101/2020.11.03.366948.","mla":"Santini, Laura, et al. “Novel Imprints in Mouse Blastocysts Are Predominantly DNA Methylation Independent.” BioRxiv, Cold Spring Harbor Laboratory, doi:10.1101/2020.11.03.366948.","apa":"Santini, L., Halbritter, F., Titz-Teixeira, F., Suzuki, T., Asami, M., Ramesmayer, J., … Leeb, M. (n.d.). Novel imprints in mouse blastocysts are predominantly DNA methylation independent. bioRxiv. Cold Spring Harbor Laboratory. https://doi.org/10.1101/2020.11.03.366948","ama":"Santini L, Halbritter F, Titz-Teixeira F, et al. Novel imprints in mouse blastocysts are predominantly DNA methylation independent. bioRxiv. doi:10.1101/2020.11.03.366948","short":"L. Santini, F. Halbritter, F. Titz-Teixeira, T. Suzuki, M. Asami, J. Ramesmayer, X. Ma, A. Lackner, N. Warr, F. Pauler, S. Hippenmeyer, E. Laue, M. Farlik, C. Bock, A. Beyer, A.C.F. Perry, M. Leeb, BioRxiv (n.d.).","ieee":"L. Santini et al., “Novel imprints in mouse blastocysts are predominantly DNA methylation independent,” bioRxiv. Cold Spring Harbor Laboratory."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"preprint","status":"public","_id":"8813"},{"date_created":"2021-08-06T07:21:51Z","doi":"10.1371/journal.pcbi.1007642.s002","date_published":"2020-02-25T00:00:00Z","related_material":{"record":[{"id":"7569","status":"public","relation":"used_in_publication"}]},"day":"25","year":"2020","month":"02","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1371/journal.pcbi.1007642.s002"}],"oa":1,"publisher":"Public Library of Science","oa_version":"None","title":"Maximizing crosstalk","department":[{"_id":"GaTk"}],"article_processing_charge":"No","author":[{"last_name":"Grah","orcid":"0000-0003-2539-3560","full_name":"Grah, Rok","id":"483E70DE-F248-11E8-B48F-1D18A9856A87","first_name":"Rok"},{"full_name":"Friedlander, Tamar","last_name":"Friedlander","first_name":"Tamar"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Grah, Rok, and Tamar Friedlander. “Maximizing Crosstalk.” Public Library of Science, 2020. https://doi.org/10.1371/journal.pcbi.1007642.s002.","ista":"Grah R, Friedlander T. 2020. Maximizing crosstalk, Public Library of Science, 10.1371/journal.pcbi.1007642.s002.","mla":"Grah, Rok, and Tamar Friedlander. Maximizing Crosstalk. Public Library of Science, 2020, doi:10.1371/journal.pcbi.1007642.s002.","ieee":"R. Grah and T. Friedlander, “Maximizing crosstalk.” Public Library of Science, 2020.","short":"R. Grah, T. Friedlander, (2020).","apa":"Grah, R., & Friedlander, T. (2020). Maximizing crosstalk. Public Library of Science. https://doi.org/10.1371/journal.pcbi.1007642.s002","ama":"Grah R, Friedlander T. Maximizing crosstalk. 2020. doi:10.1371/journal.pcbi.1007642.s002"},"date_updated":"2023-09-12T11:02:25Z","status":"public","type":"research_data_reference","_id":"9777"},{"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"apa":"Kragl, B. (2020). Verifying concurrent programs: Refinement, synchronization, sequentialization. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:8332","ama":"Kragl B. Verifying concurrent programs: Refinement, synchronization, sequentialization. 2020. doi:10.15479/AT:ISTA:8332","short":"B. Kragl, Verifying Concurrent Programs: Refinement, Synchronization, Sequentialization, Institute of Science and Technology Austria, 2020.","ieee":"B. Kragl, “Verifying concurrent programs: Refinement, synchronization, sequentialization,” Institute of Science and Technology Austria, 2020.","mla":"Kragl, Bernhard. Verifying Concurrent Programs: Refinement, Synchronization, Sequentialization. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:8332.","ista":"Kragl B. 2020. Verifying concurrent programs: Refinement, synchronization, sequentialization. Institute of Science and Technology Austria.","chicago":"Kragl, Bernhard. “Verifying Concurrent Programs: Refinement, Synchronization, Sequentialization.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:8332."},"title":"Verifying concurrent programs: Refinement, synchronization, sequentialization","author":[{"last_name":"Kragl","orcid":"0000-0001-7745-9117","full_name":"Kragl, Bernhard","first_name":"Bernhard","id":"320FC952-F248-11E8-B48F-1D18A9856A87"}],"article_processing_charge":"No","day":"03","has_accepted_license":"1","year":"2020","date_published":"2020-09-03T00:00:00Z","doi":"10.15479/AT:ISTA:8332","date_created":"2020-09-04T12:24:12Z","page":"120","publisher":"Institute of Science and Technology Austria","oa":1,"ddc":["000"],"supervisor":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724"}],"date_updated":"2023-09-13T08:45:08Z","department":[{"_id":"ToHe"}],"file_date_updated":"2020-09-04T13:00:17Z","_id":"8332","status":"public","type":"dissertation","file":[{"date_updated":"2020-09-04T12:17:47Z","file_size":1348815,"creator":"bkragl","date_created":"2020-09-04T12:17:47Z","file_name":"kragl-thesis.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"26fe261550f691280bda4c454bf015c7","file_id":"8333"},{"checksum":"b9694ce092b7c55557122adba8337ebc","file_id":"8335","content_type":"application/zip","access_level":"closed","relation":"source_file","date_created":"2020-09-04T13:00:17Z","file_name":"kragl-thesis.zip","date_updated":"2020-09-04T13:00:17Z","file_size":372312,"creator":"bkragl"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["2663-337X"]},"degree_awarded":"PhD","publication_status":"published","related_material":{"record":[{"id":"133","status":"public","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"8012"},{"id":"8195","status":"public","relation":"part_of_dissertation"},{"status":"public","id":"160","relation":"part_of_dissertation"}]},"oa_version":"Published Version","abstract":[{"lang":"eng","text":"Designing and verifying concurrent programs is a notoriously challenging, time consuming, and error prone task, even for experts. This is due to the sheer number of possible interleavings of a concurrent program, all of which have to be tracked and accounted for in a formal proof. Inventing an inductive invariant that captures all interleavings of a low-level implementation is theoretically possible, but practically intractable. We develop a refinement-based verification framework that provides mechanisms to simplify proof construction by decomposing the verification task into smaller subtasks.\r\n\r\nIn a first line of work, we present a foundation for refinement reasoning over structured concurrent programs. We introduce layered concurrent programs as a compact notation to represent multi-layer refinement proofs. A layered concurrent program specifies a sequence of connected concurrent programs, from most concrete to most abstract, such that common parts of different programs are written exactly once. Each program in this sequence is expressed as structured concurrent program, i.e., a program over (potentially recursive) procedures, imperative control flow, gated atomic actions, structured parallelism, and asynchronous concurrency. This is in contrast to existing refinement-based verifiers, which represent concurrent systems as flat transition relations. We present a powerful refinement proof rule that decomposes refinement checking over structured programs into modular verification conditions. Refinement checking is supported by a new form of modular, parameterized invariants, called yield invariants, and a linear permission system to enhance local reasoning.\r\n\r\nIn a second line of work, we present two new reduction-based program transformations that target asynchronous programs. These transformations reduce the number of interleavings that need to be considered, thus reducing the complexity of invariants. Synchronization simplifies the verification of asynchronous programs by introducing the fiction, for proof purposes, that asynchronous operations complete synchronously. Synchronization summarizes an asynchronous computation as immediate atomic effect. Inductive sequentialization establishes sequential reductions that captures every behavior of the original program up to reordering of coarse-grained commutative actions. A sequential reduction of a concurrent program is easy to reason about since it corresponds to a simple execution of the program in an idealized synchronous environment, where processes act in a fixed order and at the same speed.\r\n\r\nOur approach is implemented the CIVL verifier, which has been successfully used for the verification of several complex concurrent programs. In our methodology, the overall correctness of a program is established piecemeal by focusing on the invariant required for each refinement step separately. While the programmer does the creative work of specifying the chain of programs and the inductive invariant justifying each link in the chain, the tool automatically constructs the verification conditions underlying each refinement step."}],"month":"09","alternative_title":["ISTA Thesis"]},{"oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2006.15055"}],"quality_controlled":"1","publisher":"Curran Associates","intvolume":" 33","abstract":[{"lang":"eng","text":"Learning object-centric representations of complex scenes is a promising step towards enabling efficient abstract reasoning from low-level perceptual features. Yet, most deep learning approaches learn distributed representations that do not capture the compositional properties of natural scenes. In this paper, we present the Slot Attention module, an architectural component that interfaces with perceptual representations such as the output of a convolutional neural network and produces a set of task-dependent abstract representations which we call slots. These slots are exchangeable and can bind to any object in the input by specializing through a competitive procedure over multiple rounds of attention. We empirically demonstrate that Slot Attention can extract object-centric representations that enable generalization to unseen compositions when trained on unsupervised object discovery and supervised property prediction tasks.\r\n\r\n"}],"oa_version":"Preprint","page":"11525-11538","date_created":"2023-09-13T12:03:46Z","volume":33,"date_published":"2020-01-01T00:00:00Z","year":"2020","publication_status":"published","publication_identifier":{"isbn":["9781713829546"]},"publication":"Advances in Neural Information Processing Systems","language":[{"iso":"eng"}],"conference":{"name":"NeurIPS: Neural Information Processing Systems","start_date":"2020-12-06","end_date":"2020-12-12","location":"Virtual"},"type":"conference","status":"public","_id":"14326","external_id":{"arxiv":["2006.15055"]},"article_processing_charge":"No","author":[{"first_name":"Francesco","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","last_name":"Locatello","orcid":"0000-0002-4850-0683","full_name":"Locatello, Francesco"},{"last_name":"Weissenborn","full_name":"Weissenborn, Dirk","first_name":"Dirk"},{"last_name":"Unterthiner","full_name":"Unterthiner, Thomas","first_name":"Thomas"},{"first_name":"Aravindh","full_name":"Mahendran, Aravindh","last_name":"Mahendran"},{"full_name":"Heigold, Georg","last_name":"Heigold","first_name":"Georg"},{"last_name":"Uszkoreit","full_name":"Uszkoreit, Jakob","first_name":"Jakob"},{"last_name":"Dosovitskiy","full_name":"Dosovitskiy, Alexey","first_name":"Alexey"},{"first_name":"Thomas","last_name":"Kipf","full_name":"Kipf, Thomas"}],"department":[{"_id":"FrLo"}],"title":"Object-centric learning with slot attention","date_updated":"2023-09-13T12:19:19Z","citation":{"mla":"Locatello, Francesco, et al. “Object-Centric Learning with Slot Attention.” Advances in Neural Information Processing Systems, vol. 33, Curran Associates, 2020, pp. 11525–38.","ieee":"F. Locatello et al., “Object-centric learning with slot attention,” in Advances in Neural Information Processing Systems, Virtual, 2020, vol. 33, pp. 11525–11538.","short":"F. Locatello, D. Weissenborn, T. Unterthiner, A. Mahendran, G. Heigold, J. Uszkoreit, A. Dosovitskiy, T. Kipf, in:, Advances in Neural Information Processing Systems, Curran Associates, 2020, pp. 11525–11538.","ama":"Locatello F, Weissenborn D, Unterthiner T, et al. Object-centric learning with slot attention. In: Advances in Neural Information Processing Systems. Vol 33. Curran Associates; 2020:11525-11538.","apa":"Locatello, F., Weissenborn, D., Unterthiner, T., Mahendran, A., Heigold, G., Uszkoreit, J., … Kipf, T. (2020). Object-centric learning with slot attention. In Advances in Neural Information Processing Systems (Vol. 33, pp. 11525–11538). Virtual: Curran Associates.","chicago":"Locatello, Francesco, Dirk Weissenborn, Thomas Unterthiner, Aravindh Mahendran, Georg Heigold, Jakob Uszkoreit, Alexey Dosovitskiy, and Thomas Kipf. “Object-Centric Learning with Slot Attention.” In Advances in Neural Information Processing Systems, 33:11525–38. Curran Associates, 2020.","ista":"Locatello F, Weissenborn D, Unterthiner T, Mahendran A, Heigold G, Uszkoreit J, Dosovitskiy A, Kipf T. 2020. Object-centric learning with slot attention. Advances in Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems vol. 33, 11525–11538."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1"},{"citation":{"mla":"Gladbach, Peter, et al. “Scaling Limits of Discrete Optimal Transport.” SIAM Journal on Mathematical Analysis, vol. 52, no. 3, Society for Industrial and Applied Mathematics, 2020, pp. 2759–802, doi:10.1137/19M1243440.","short":"P. Gladbach, E. Kopfer, J. Maas, SIAM Journal on Mathematical Analysis 52 (2020) 2759–2802.","ieee":"P. Gladbach, E. Kopfer, and J. Maas, “Scaling limits of discrete optimal transport,” SIAM Journal on Mathematical Analysis, vol. 52, no. 3. Society for Industrial and Applied Mathematics, pp. 2759–2802, 2020.","ama":"Gladbach P, Kopfer E, Maas J. Scaling limits of discrete optimal transport. SIAM Journal on Mathematical Analysis. 2020;52(3):2759-2802. doi:10.1137/19M1243440","apa":"Gladbach, P., Kopfer, E., & Maas, J. (2020). Scaling limits of discrete optimal transport. SIAM Journal on Mathematical Analysis. Society for Industrial and Applied Mathematics. https://doi.org/10.1137/19M1243440","chicago":"Gladbach, Peter, Eva Kopfer, and Jan Maas. “Scaling Limits of Discrete Optimal Transport.” SIAM Journal on Mathematical Analysis. Society for Industrial and Applied Mathematics, 2020. https://doi.org/10.1137/19M1243440.","ista":"Gladbach P, Kopfer E, Maas J. 2020. Scaling limits of discrete optimal transport. SIAM Journal on Mathematical Analysis. 52(3), 2759–2802."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","external_id":{"arxiv":["1809.01092"],"isi":["000546975100017"]},"article_processing_charge":"No","publist_id":"7983","author":[{"first_name":"Peter","full_name":"Gladbach, Peter","last_name":"Gladbach"},{"full_name":"Kopfer, Eva","last_name":"Kopfer","first_name":"Eva"},{"orcid":"0000-0002-0845-1338","full_name":"Maas, Jan","last_name":"Maas","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","first_name":"Jan"}],"title":"Scaling limits of discrete optimal transport","year":"2020","isi":1,"publication":"SIAM Journal on Mathematical Analysis","day":"01","page":"2759-2802","date_created":"2018-12-11T11:44:28Z","doi":"10.1137/19M1243440","date_published":"2020-10-01T00:00:00Z","oa":1,"quality_controlled":"1","publisher":"Society for Industrial and Applied Mathematics","date_updated":"2023-09-18T08:13:15Z","department":[{"_id":"JaMa"}],"_id":"71","article_type":"original","type":"journal_article","status":"public","publication_status":"published","publication_identifier":{"issn":["00361410"],"eissn":["10957154"]},"language":[{"iso":"eng"}],"issue":"3","volume":52,"abstract":[{"text":"We consider dynamical transport metrics for probability measures on discretisations of a bounded convex domain in ℝd. These metrics are natural discrete counterparts to the Kantorovich metric 𝕎2, defined using a Benamou-Brenier type formula. Under mild assumptions we prove an asymptotic upper bound for the discrete transport metric Wt in terms of 𝕎2, as the size of the mesh T tends to 0. However, we show that the corresponding lower bound may fail in general, even on certain one-dimensional and symmetric two-dimensional meshes. In addition, we show that the asymptotic lower bound holds under an isotropy assumption on the mesh, which turns out to be essentially necessary. This assumption is satisfied, e.g., for tilings by convex regular polygons, and it implies Gromov-Hausdorff convergence of the transport metric.","lang":"eng"}],"oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1809.01092"}],"scopus_import":"1","intvolume":" 52","month":"10"},{"citation":{"ista":"Hikaru I, Wojtan C, Thuerey N, Igarashi T, Ando R. 2020. Simulating liquids on dynamically warping grids. IEEE Transactions on Visualization and Computer Graphics. 26(6), 2288–2302.","chicago":"Hikaru, Ibayashi, Chris Wojtan, Nils Thuerey, Takeo Igarashi, and Ryoichi Ando. “Simulating Liquids on Dynamically Warping Grids.” IEEE Transactions on Visualization and Computer Graphics. IEEE, 2020. https://doi.org/10.1109/TVCG.2018.2883628.","ieee":"I. Hikaru, C. Wojtan, N. Thuerey, T. Igarashi, and R. Ando, “Simulating liquids on dynamically warping grids,” IEEE Transactions on Visualization and Computer Graphics, vol. 26, no. 6. IEEE, pp. 2288–2302, 2020.","short":"I. Hikaru, C. Wojtan, N. Thuerey, T. Igarashi, R. Ando, IEEE Transactions on Visualization and Computer Graphics 26 (2020) 2288–2302.","apa":"Hikaru, I., Wojtan, C., Thuerey, N., Igarashi, T., & Ando, R. (2020). Simulating liquids on dynamically warping grids. IEEE Transactions on Visualization and Computer Graphics. IEEE. https://doi.org/10.1109/TVCG.2018.2883628","ama":"Hikaru I, Wojtan C, Thuerey N, Igarashi T, Ando R. Simulating liquids on dynamically warping grids. IEEE Transactions on Visualization and Computer Graphics. 2020;26(6):2288-2302. doi:10.1109/TVCG.2018.2883628","mla":"Hikaru, Ibayashi, et al. “Simulating Liquids on Dynamically Warping Grids.” IEEE Transactions on Visualization and Computer Graphics, vol. 26, no. 6, IEEE, 2020, pp. 2288–302, doi:10.1109/TVCG.2018.2883628."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"last_name":"Hikaru","full_name":"Hikaru, Ibayashi","first_name":"Ibayashi"},{"full_name":"Wojtan, Christopher J","orcid":"0000-0001-6646-5546","last_name":"Wojtan","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","first_name":"Christopher J"},{"first_name":"Nils","last_name":"Thuerey","full_name":"Thuerey, Nils"},{"first_name":"Takeo","last_name":"Igarashi","full_name":"Igarashi, Takeo"},{"full_name":"Ando, Ryoichi","last_name":"Ando","first_name":"Ryoichi"}],"article_processing_charge":"No","external_id":{"pmid":["30507534"],"isi":["000532295600014"]},"title":"Simulating liquids on dynamically warping grids","isi":1,"has_accepted_license":"1","year":"2020","day":"01","publication":"IEEE Transactions on Visualization and Computer Graphics","page":"2288-2302","date_published":"2020-06-01T00:00:00Z","doi":"10.1109/TVCG.2018.2883628","date_created":"2018-12-16T22:59:21Z","acknowledgement":"This work was partially supported by JSPS Grant-in-Aid forYoung Scientists (Start-up) 16H07410, the ERC StartingGrantsrealFlow(StG-2015-637014) andBigSplash(StG-2014-638176). This research was supported by the Scientific Ser-vice Units (SSU) of IST Austria through resources providedby Scientific Computing. We would like to express my grati-tude to Nobuyuki Umetani and Tomas Skrivan for insight-ful discussion.","publisher":"IEEE","quality_controlled":"1","oa":1,"date_updated":"2023-09-18T09:30:01Z","ddc":["006"],"file_date_updated":"2020-10-08T08:34:53Z","department":[{"_id":"ChWo"}],"_id":"5681","type":"journal_article","article_type":"original","status":"public","publication_identifier":{"eissn":["19410506"],"issn":["10772626"]},"publication_status":"published","file":[{"checksum":"8d4c55443a0ee335bb5bb652de503042","file_id":"8626","success":1,"content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2020-10-08T08:34:53Z","file_name":"preprint.pdf","date_updated":"2020-10-08T08:34:53Z","file_size":21910098,"creator":"wojtan"}],"language":[{"iso":"eng"}],"volume":26,"issue":"6","acknowledged_ssus":[{"_id":"ScienComp"}],"abstract":[{"text":"We introduce dynamically warping grids for adaptive liquid simulation. Our primary contributions are a strategy for dynamically deforming regular grids over the course of a simulation and a method for efficiently utilizing these deforming grids for liquid simulation. Prior work has shown that unstructured grids are very effective for adaptive fluid simulations. However, unstructured grids often lead to complicated implementations and a poor cache hit rate due to inconsistent memory access. Regular grids, on the other hand, provide a fast, fixed memory access pattern and straightforward implementation. Our method combines the advantages of both: we leverage the simplicity of regular grids while still achieving practical and controllable spatial adaptivity. We demonstrate that our method enables adaptive simulations that are fast, flexible, and robust to null-space issues. At the same time, our method is simple to implement and takes advantage of existing highly-tuned algorithms.","lang":"eng"}],"pmid":1,"oa_version":"Submitted Version","scopus_import":"1","month":"06","intvolume":" 26"},{"_id":"8958","type":"dissertation","status":"public","supervisor":[{"first_name":"Mikhail","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","full_name":"Lemeshko, Mikhail","orcid":"0000-0002-6990-7802","last_name":"Lemeshko"}],"date_updated":"2023-09-20T11:30:58Z","ddc":["539"],"department":[{"_id":"MiLe"}],"file_date_updated":"2020-12-30T07:18:03Z","abstract":[{"text":"The oft-quoted dictum by Arthur Schawlow: ``A diatomic molecule has one atom too many'' has been disavowed. Inspired by the possibility to experimentally manipulate and enhance chemical reactivity in helium nanodroplets, we investigate the rotation of coupled cold molecules in the presence of a many-body environment.\r\nIn this thesis, we introduce new variational approaches to quantum impurities and apply them to the Fröhlich polaron - a quasiparticle formed out of an electron (or other point-like impurity) in a polar medium, and to the angulon - a quasiparticle formed out of a rotating molecule in a bosonic bath.\r\nWith this theoretical toolbox, we reveal the self-localization transition for the angulon quasiparticle. We show that, unlike for polarons, self-localization of angulons occurs at finite impurity-bath coupling already at the mean-field level. The transition is accompanied by the spherical-symmetry breaking of the angulon ground state and a discontinuity in the first derivative of the ground-state energy. Moreover, the type of symmetry breaking is dictated by the symmetry of the microscopic impurity-bath interaction, which leads to a number of distinct self-localized states. \r\nFor the system containing multiple impurities, by analogy with the bipolaron, we introduce the biangulon quasiparticle describing two rotating molecules that align with respect to each other due to the effective attractive interaction mediated by the excitations of the bath. We study this system from the strong-coupling regime to the weak molecule-bath interaction regime. We show that the molecules tend to have a strong alignment in the ground state, the biangulon shows shifted angulon instabilities and an additional spectral instability, where resonant angular momentum transfer between the molecules and the bath takes place. Finally, we introduce a diagonalization scheme that allows us to describe the transition from two separated angulons to a biangulon as a function of the distance between the two molecules.","lang":"eng"}],"oa_version":"Published Version","alternative_title":["ISTA Thesis"],"month":"12","publication_identifier":{"issn":["2663-337X"]},"publication_status":"published","degree_awarded":"PhD","file":[{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","success":1,"checksum":"3994c54a1241451d561db1d4f43bad30","file_id":"8967","file_size":3622305,"date_updated":"2020-12-22T10:55:56Z","creator":"xli","file_name":"THESIS_Xiang_Li.pdf","date_created":"2020-12-22T10:55:56Z"},{"content_type":"application/x-zip-compressed","access_level":"closed","relation":"source_file","checksum":"0954ecfc5554c05615c14de803341f00","file_id":"8968","date_updated":"2020-12-30T07:18:03Z","file_size":4018859,"creator":"xli","date_created":"2020-12-22T10:56:03Z","file_name":"THESIS_Xiang_Li.zip"}],"language":[{"iso":"eng"}],"related_material":{"record":[{"relation":"part_of_dissertation","id":"5886","status":"public"},{"id":"8587","status":"public","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"1120","status":"public"}]},"ec_funded":1,"project":[{"_id":"26031614-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Quantum rotations in the presence of a many-body environment","grant_number":"P29902"},{"call_identifier":"H2020","_id":"2688CF98-B435-11E9-9278-68D0E5697425","name":"Angulon: physics and applications of a new quasiparticle","grant_number":"801770"}],"citation":{"mla":"Li, Xiang. Rotation of Coupled Cold Molecules in the Presence of a Many-Body Environment. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:8958.","apa":"Li, X. (2020). Rotation of coupled cold molecules in the presence of a many-body environment. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:8958","ama":"Li X. Rotation of coupled cold molecules in the presence of a many-body environment. 2020. doi:10.15479/AT:ISTA:8958","ieee":"X. Li, “Rotation of coupled cold molecules in the presence of a many-body environment,” Institute of Science and Technology Austria, 2020.","short":"X. Li, Rotation of Coupled Cold Molecules in the Presence of a Many-Body Environment, Institute of Science and Technology Austria, 2020.","chicago":"Li, Xiang. “Rotation of Coupled Cold Molecules in the Presence of a Many-Body Environment.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:8958.","ista":"Li X. 2020. Rotation of coupled cold molecules in the presence of a many-body environment. Institute of Science and Technology Austria."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"id":"4B7E523C-F248-11E8-B48F-1D18A9856A87","first_name":"Xiang","last_name":"Li","full_name":"Li, Xiang"}],"article_processing_charge":"No","title":"Rotation of coupled cold molecules in the presence of a many-body environment","publisher":"Institute of Science and Technology Austria","oa":1,"has_accepted_license":"1","year":"2020","day":"21","page":"125","date_published":"2020-12-21T00:00:00Z","doi":"10.15479/AT:ISTA:8958","date_created":"2020-12-21T09:44:30Z"},{"title":"Structure-aware computational design and its application to 3D printable volume scattering, mechanism, and multistability","article_processing_charge":"No","author":[{"last_name":"Zhang","orcid":"0000-0002-3808-281X","full_name":"Zhang, Ran","id":"4DDBCEB0-F248-11E8-B48F-1D18A9856A87","first_name":"Ran"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"mla":"Zhang, Ran. Structure-Aware Computational Design and Its Application to 3D Printable Volume Scattering, Mechanism, and Multistability. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:8386.","ieee":"R. Zhang, “Structure-aware computational design and its application to 3D printable volume scattering, mechanism, and multistability,” Institute of Science and Technology Austria, 2020.","short":"R. Zhang, Structure-Aware Computational Design and Its Application to 3D Printable Volume Scattering, Mechanism, and Multistability, Institute of Science and Technology Austria, 2020.","apa":"Zhang, R. (2020). Structure-aware computational design and its application to 3D printable volume scattering, mechanism, and multistability. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:8386","ama":"Zhang R. Structure-aware computational design and its application to 3D printable volume scattering, mechanism, and multistability. 2020. doi:10.15479/AT:ISTA:8386","chicago":"Zhang, Ran. “Structure-Aware Computational Design and Its Application to 3D Printable Volume Scattering, Mechanism, and Multistability.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:8386.","ista":"Zhang R. 2020. Structure-aware computational design and its application to 3D printable volume scattering, mechanism, and multistability. Institute of Science and Technology Austria."},"project":[{"name":"Distributed 3D Object Design","grant_number":"642841","_id":"2508E324-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"_id":"24F9549A-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","grant_number":"715767"}],"date_created":"2020-09-14T01:04:53Z","doi":"10.15479/AT:ISTA:8386","date_published":"2020-09-14T00:00:00Z","page":"148","day":"14","year":"2020","has_accepted_license":"1","oa":1,"publisher":"Institute of Science and Technology Austria","acknowledgement":"The research in this thesis has received funding from the European Union’s Horizon 2020 research and innovation programme, under the Marie Skłodowska-Curie grant agreement No 642841 (DISTRO) and the European Research Council grant agreement No 715767 (MATERIALIZABLE). All the research projects in this thesis were also supported by Scientific Service Units (SSUs) at IST Austria.","department":[{"_id":"BeBi"}],"file_date_updated":"2020-09-15T12:51:53Z","ddc":["003"],"date_updated":"2023-09-22T09:49:31Z","supervisor":[{"id":"49876194-F248-11E8-B48F-1D18A9856A87","first_name":"Bernd","full_name":"Bickel, Bernd","orcid":"0000-0001-6511-9385","last_name":"Bickel"}],"status":"public","type":"dissertation","_id":"8386","ec_funded":1,"related_material":{"record":[{"relation":"part_of_dissertation","id":"486","status":"public"},{"relation":"part_of_dissertation","id":"1002","status":"public"}]},"language":[{"iso":"eng"}],"file":[{"checksum":"edcf578b6e1c9b0dd81ff72d319b66ba","file_id":"8388","content_type":"application/x-zip-compressed","relation":"source_file","access_level":"closed","file_name":"Thesis_Ran.zip","date_created":"2020-09-14T01:02:59Z","file_size":1245800191,"date_updated":"2020-09-14T12:18:43Z","creator":"rzhang"},{"success":1,"checksum":"817e20c33be9247f906925517c56a40d","file_id":"8396","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"PhD_thesis_Ran Zhang_20200915.pdf","date_created":"2020-09-15T12:51:53Z","creator":"rzhang","file_size":161385316,"date_updated":"2020-09-15T12:51:53Z"}],"publication_status":"published","degree_awarded":"PhD","publication_identifier":{"issn":["2663-337X"]},"month":"09","alternative_title":["ISTA Thesis"],"oa_version":"Published Version","acknowledged_ssus":[{"_id":"SSU"}],"abstract":[{"lang":"eng","text":"Form versus function is a long-standing debate in various design-related fields, such as architecture as well as graphic and industrial design. A good design that balances form and function often requires considerable human effort and collaboration among experts from different professional fields. Computational design tools provide a new paradigm for designing functional objects. In computational design, form and function are represented as mathematical\r\nquantities, with the help of numerical and combinatorial algorithms, they can assist even novice users in designing versatile models that exhibit their desired functionality. This thesis presents three disparate research studies on the computational design of functional objects: The appearance of 3d print—we optimize the volumetric material distribution for faithfully replicating colored surface texture in 3d printing; the dynamic motion of mechanical structures—\r\nour design system helps the novice user to retarget various mechanical templates with different functionality to complex 3d shapes; and a more abstract functionality, multistability—our algorithm automatically generates models that exhibit multiple stable target poses. For each of these cases, our computational design tools not only ensure the functionality of the results but also permit the user aesthetic freedom over the form. Moreover, fabrication constraints\r\nwere taken into account, which allow for the immediate creation of physical realization via 3D printing or laser cutting."}]},{"author":[{"first_name":"Josip","id":"3F5D8856-F248-11E8-B48F-1D18A9856A87","last_name":"Kukucka","full_name":"Kukucka, Josip"}],"article_processing_charge":"No","title":"Implementation of a hole spin qubit in Ge hut wires and dispersive spin sensing","citation":{"chicago":"Kukucka, Josip. “Implementation of a Hole Spin Qubit in Ge Hut Wires and Dispersive Spin Sensing.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:7996.","ista":"Kukucka J. 2020. Implementation of a hole spin qubit in Ge hut wires and dispersive spin sensing. Institute of Science and Technology Austria.","mla":"Kukucka, Josip. Implementation of a Hole Spin Qubit in Ge Hut Wires and Dispersive Spin Sensing. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:7996.","short":"J. Kukucka, Implementation of a Hole Spin Qubit in Ge Hut Wires and Dispersive Spin Sensing, Institute of Science and Technology Austria, 2020.","ieee":"J. Kukucka, “Implementation of a hole spin qubit in Ge hut wires and dispersive spin sensing,” Institute of Science and Technology Austria, 2020.","apa":"Kukucka, J. (2020). Implementation of a hole spin qubit in Ge hut wires and dispersive spin sensing. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:7996","ama":"Kukucka J. Implementation of a hole spin qubit in Ge hut wires and dispersive spin sensing. 2020. doi:10.15479/AT:ISTA:7996"},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","page":"178","doi":"10.15479/AT:ISTA:7996","date_published":"2020-06-22T00:00:00Z","date_created":"2020-06-22T09:22:23Z","has_accepted_license":"1","year":"2020","day":"22","publisher":"Institute of Science and Technology Austria","oa":1,"department":[{"_id":"GeKa"}],"file_date_updated":"2020-07-14T12:48:07Z","supervisor":[{"first_name":"Georgios","id":"38DB5788-F248-11E8-B48F-1D18A9856A87","last_name":"Katsaros","full_name":"Katsaros, Georgios","orcid":"0000-0001-8342-202X"}],"date_updated":"2023-09-26T15:50:22Z","ddc":["530"],"type":"dissertation","status":"public","_id":"7996","related_material":{"record":[{"relation":"part_of_dissertation","id":"1328","status":"public"},{"relation":"part_of_dissertation","status":"public","id":"7541"},{"relation":"part_of_dissertation","status":"public","id":"77"},{"relation":"part_of_dissertation","id":"23","status":"public"},{"status":"public","id":"840","relation":"part_of_dissertation"}]},"publication_identifier":{"issn":["2663-337X"]},"publication_status":"published","degree_awarded":"PhD","file":[{"creator":"dernst","date_updated":"2020-07-14T12:48:07Z","file_size":392794743,"date_created":"2020-06-22T09:22:04Z","file_name":"JK_thesis_latex_source_files.zip","access_level":"closed","relation":"main_file","content_type":"application/x-zip-compressed","file_id":"7997","checksum":"467e52feb3e361ce8cf5fe8d5c254ece"},{"date_updated":"2020-07-14T12:48:07Z","file_size":28453247,"creator":"dernst","date_created":"2020-06-22T09:21:29Z","file_name":"PhD_thesis_JK_pdfa.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"7998","checksum":"1de716bf110dbd77d383e479232bf496"}],"language":[{"iso":"eng"}],"alternative_title":["ISTA Thesis"],"month":"06","abstract":[{"lang":"eng","text":"Quantum computation enables the execution of algorithms that have exponential complexity. This might open the path towards the synthesis of new materials or medical drugs, optimization of transport or financial strategies etc., intractable on even the fastest classical computers. A quantum computer consists of interconnected two level quantum systems, called qubits, that satisfy DiVincezo’s criteria. Worldwide, there are ongoing efforts to find the qubit architecture which will unite quantum error correction compatible single and two qubit fidelities, long distance qubit to qubit coupling and \r\n calability. Superconducting qubits have gone the furthest in this race, demonstrating an algorithm running on 53 coupled qubits, but still the fidelities are not even close to those required for realizing a single logical qubit. emiconductor qubits offer extremely good characteristics, but they are currently investigated across different platforms. Uniting those good characteristics into a single platform might be a big step towards the quantum computer realization.\r\nHere we describe the implementation of a hole spin qubit hosted in a Ge hut wire double quantum dot. The high and tunable spin-orbit coupling together with a heavy hole state character is expected to allow fast spin manipulation and long coherence times. Furthermore large lever arms, for hut wire devices, should allow good coupling to superconducting resonators enabling efficient long distance spin to spin coupling and a sensitive gate reflectometry spin readout. The developed cryogenic setup (printed circuit board sample holders, filtering, high-frequency wiring) enabled us to perform low temperature spin dynamics experiments. Indeed, we measured the fastest single spin qubit Rabi frequencies reported so far, reaching 140 MHz, while the dephasing times of 130 ns oppose the long decoherence predictions. In order to further investigate this, a double quantum dot gate was connected directly to a lumped element\r\nresonator which enabled gate reflectometry readout. The vanishing inter-dot transition signal, for increasing external magnetic field, revealed the spin nature of the measured quantity."}],"oa_version":"Published Version"},{"day":"14","publication":"International Conference on Computer Aided Verification","isi":1,"has_accepted_license":"1","year":"2020","doi":"10.1007/978-3-030-53291-8_21","date_published":"2020-07-14T00:00:00Z","date_created":"2020-08-16T22:00:58Z","page":"398-420","quality_controlled":"1","publisher":"Springer Nature","oa":1,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"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","short":"K. Chatterjee, J.P. Katoen, M. Weininger, T. Winkler, in:, International Conference on Computer Aided Verification, Springer Nature, 2020, pp. 398–420.","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.","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.","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.","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."},"title":"Stochastic games with lexicographic reachability-safety objectives","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Katoen","full_name":"Katoen, Joost P","id":"4524F760-F248-11E8-B48F-1D18A9856A87","first_name":"Joost P"},{"first_name":"Maximilian","last_name":"Weininger","full_name":"Weininger, Maximilian"},{"first_name":"Tobias","full_name":"Winkler, Tobias","last_name":"Winkler"}],"external_id":{"arxiv":["2005.04018"],"isi":["000695272500021"]},"article_processing_charge":"No","project":[{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications"},{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003"}],"file":[{"date_created":"2020-08-17T11:32:44Z","file_name":"2020_LNCS_CAV_Chatterjee.pdf","creator":"dernst","date_updated":"2020-08-17T11:32:44Z","file_size":625056,"file_id":"8276","checksum":"093d4788d7d5b2ce0ffe64fbe7820043","success":1,"access_level":"open_access","relation":"main_file","content_type":"application/pdf"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["03029743"],"isbn":["9783030532901"],"eissn":["16113349"]},"publication_status":"published","volume":12225,"related_material":{"record":[{"relation":"later_version","status":"public","id":"12738"}]},"ec_funded":1,"oa_version":"Published Version","abstract":[{"lang":"eng","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."}],"month":"07","intvolume":" 12225","alternative_title":["LNCS"],"scopus_import":"1","ddc":["000"],"date_updated":"2023-10-03T11:36:13Z","department":[{"_id":"KrCh"}],"file_date_updated":"2020-08-17T11:32:44Z","_id":"8272","status":"public","type":"conference","conference":{"name":"CAV: Computer Aided Verification"},"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)"}},{"project":[{"_id":"2595697A-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Self-Organization of the Bacterial Cell","grant_number":"679239"},{"name":"Reconstitution of Bacterial Cell Division Using Purified Components","_id":"260D98C8-B435-11E9-9278-68D0E5697425"}],"citation":{"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.","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.","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.","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.","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.","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","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"},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","external_id":{"isi":["000611826500008"]},"article_processing_charge":"No","author":[{"orcid":"0000-0001-6730-4461","full_name":"Dos Santos Caldas, Paulo R","last_name":"Dos Santos Caldas","first_name":"Paulo R","id":"38FCDB4C-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Radler","orcid":"0000-0001-9198-2182 ","full_name":"Radler, Philipp","id":"40136C2A-F248-11E8-B48F-1D18A9856A87","first_name":"Philipp"},{"first_name":"Christoph M","id":"4DF26D8C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1216-9105","full_name":"Sommer, Christoph M","last_name":"Sommer"},{"id":"462D4284-F248-11E8-B48F-1D18A9856A87","first_name":"Martin","full_name":"Loose, Martin","orcid":"0000-0001-7309-9724","last_name":"Loose"}],"editor":[{"first_name":"Phong ","full_name":"Tran, Phong ","last_name":"Tran"}],"title":"Computational analysis of filament polymerization dynamics in cytoskeletal networks","oa":1,"publisher":"Elsevier","quality_controlled":"1","year":"2020","isi":1,"publication":"Methods in Cell Biology","day":"27","page":"145-161","date_created":"2020-03-08T23:00:47Z","date_published":"2020-02-27T00:00:00Z","doi":"10.1016/bs.mcb.2020.01.006","_id":"7572","type":"book_chapter","status":"public","date_updated":"2023-10-04T09:50:24Z","department":[{"_id":"MaLo"}],"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","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","publication_status":"published","publication_identifier":{"issn":["0091679X"]},"language":[{"iso":"eng"}],"ec_funded":1,"volume":158,"related_material":{"record":[{"status":"public","id":"8358","relation":"part_of_dissertation"}]}},{"title":"Diffusion and capture permits dynamic coupling between treadmilling FtsZ filaments and cell division proteins","external_id":{"isi":["000508584700007"],"pmid":["31959972"]},"article_processing_charge":"No","author":[{"last_name":"Baranova","full_name":"Baranova, Natalia S.","orcid":"0000-0002-3086-9124","id":"38661662-F248-11E8-B48F-1D18A9856A87","first_name":"Natalia S."},{"id":"40136C2A-F248-11E8-B48F-1D18A9856A87","first_name":"Philipp","last_name":"Radler","orcid":"0000-0001-9198-2182 ","full_name":"Radler, Philipp"},{"last_name":"Hernández-Rocamora","full_name":"Hernández-Rocamora, Víctor M.","first_name":"Víctor M."},{"first_name":"Carlos","last_name":"Alfonso","full_name":"Alfonso, 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"},{"first_name":"Martin","id":"462D4284-F248-11E8-B48F-1D18A9856A87","last_name":"Loose","full_name":"Loose, Martin","orcid":"0000-0001-7309-9724"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"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.","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","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","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.","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.","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."},"project":[{"name":"Self-Organization of the Bacterial Cell","grant_number":"679239","call_identifier":"H2020","_id":"2595697A-B435-11E9-9278-68D0E5697425"},{"grant_number":"LT000824/2016","name":"Reconstitution of bacterial cell wall sythesis","_id":"259B655A-B435-11E9-9278-68D0E5697425"},{"_id":"2596EAB6-B435-11E9-9278-68D0E5697425","grant_number":"ALTF 2015-1163","name":"Synthesis of bacterial cell wall"}],"date_created":"2020-01-28T16:14:41Z","date_published":"2020-01-20T00:00:00Z","doi":"10.1038/s41564-019-0657-5","page":"407-417","publication":"Nature Microbiology","day":"20","year":"2020","isi":1,"oa":1,"publisher":"Springer Nature","quality_controlled":"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","status":"public","type":"journal_article","article_type":"letter_note","_id":"7387","ec_funded":1,"related_material":{"link":[{"relation":"press_release","url":"https://ist.ac.at/en/news/little-cell-big-cover-story/","description":"News on IST Homepage"}],"record":[{"status":"public","id":"14280","relation":"dissertation_contains"}]},"volume":5,"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["2058-5276"]},"intvolume":" 5","month":"01","main_file_link":[{"open_access":"1","url":"http://europepmc.org/article/PMC/7048620"}],"scopus_import":"1","oa_version":"Submitted Version","pmid":1,"abstract":[{"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.","lang":"eng"}]},{"oa":1,"publisher":"Akadémiai Kiadó","quality_controlled":"1","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.","date_created":"2020-07-24T07:09:18Z","doi":"10.1556/012.2020.57.2.1454","date_published":"2020-07-24T00:00:00Z","page":"193-199","publication":"Studia Scientiarum Mathematicarum Hungarica","day":"24","year":"2020","isi":1,"has_accepted_license":"1","project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships"},{"_id":"268116B8-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z00342","name":"The Wittgenstein Prize"}],"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":[{"last_name":"Vegter","full_name":"Vegter, Gert","first_name":"Gert"},{"id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","first_name":"Mathijs","orcid":"0000-0002-7472-2220","full_name":"Wintraecken, Mathijs","last_name":"Wintraecken"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"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.","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.","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.","short":"G. Vegter, M. Wintraecken, Studia Scientiarum Mathematicarum Hungarica 57 (2020) 193–199.","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","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","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."},"intvolume":" 57","month":"07","scopus_import":"1","oa_version":"Published Version","abstract":[{"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.","lang":"eng"}],"ec_funded":1,"volume":57,"issue":"2","language":[{"iso":"eng"}],"file":[{"file_id":"8164","access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2020-07-24T07:09:06Z","file_name":"57-2-05_4214-1454Vegter-Wintraecken_OpenAccess_CC-BY-NC.pdf","creator":"mwintrae","date_updated":"2020-07-24T07:09:06Z","file_size":1476072}],"publication_status":"published","publication_identifier":{"issn":["0081-6906"],"eissn":["1588-2896"]},"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)"},"type":"journal_article","article_type":"original","_id":"8163","file_date_updated":"2020-07-24T07:09:06Z","department":[{"_id":"HeEd"}],"ddc":["510"],"date_updated":"2023-10-10T13:05:27Z"},{"scopus_import":"1","month":"10","intvolume":" 15","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","issue":"2","volume":15,"publication_identifier":{"eissn":["2008-9473"],"issn":["1735-4463"]},"publication_status":"published","file":[{"success":1,"file_id":"8676","checksum":"f299661a6d51cda6d255a76be696f48d","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_name":"2020_ijmsi_Shakiba_accepted.pdf","date_created":"2020-10-19T11:14:20Z","file_size":261688,"date_updated":"2020-10-19T11:14:20Z","creator":"dernst"}],"language":[{"iso":"eng"}],"article_type":"original","type":"journal_article","status":"public","_id":"8671","file_date_updated":"2020-10-19T11:14:20Z","department":[{"_id":"KrCh"}],"date_updated":"2023-10-16T09:25:00Z","ddc":["000"],"quality_controlled":"1","publisher":"Iranian Academic Center for Education, Culture and Research","oa":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.","page":"117-128","date_published":"2020-10-01T00:00:00Z","doi":"10.29252/ijmsi.15.2.117","date_created":"2020-10-18T22:01:36Z","has_accepted_license":"1","year":"2020","day":"01","publication":"Iranian Journal of Mathematical Sciences and Informatics","project":[{"_id":"267066CE-B435-11E9-9278-68D0E5697425","name":"Quantitative Analysis of Probablistic Systems with a focus on Crypto-currencies"}],"author":[{"first_name":"A.","full_name":"Shakiba, A.","last_name":"Shakiba"},{"id":"391365CE-F248-11E8-B48F-1D18A9856A87","first_name":"Amir Kafshdar","last_name":"Goharshady","full_name":"Goharshady, Amir Kafshdar","orcid":"0000-0003-1702-6584"},{"first_name":"M.R.","full_name":"Hooshmandasl, M.R.","last_name":"Hooshmandasl"},{"full_name":"Alambardar Meybodi, M.","last_name":"Alambardar Meybodi","first_name":"M."}],"article_processing_charge":"No","external_id":{"arxiv":["1805.10672"]},"title":"A note on belief structures and s-approximation spaces","citation":{"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.","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.","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","short":"A. Shakiba, A.K. Goharshady, M.R. Hooshmandasl, M. Alambardar Meybodi, Iranian Journal of Mathematical Sciences and Informatics 15 (2020) 117–128.","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.","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."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"date_published":"2020-07-16T00:00:00Z","doi":"10.1214/20-EJP479","date_created":"2019-04-30T07:40:17Z","day":"16","publication":"Electronic Journal of Probability","has_accepted_license":"1","isi":1,"year":"2020","publisher":"Institute of Mathematical Statistics","quality_controlled":"1","oa":1,"title":"On the regularisation of the noise for the Euler-Maruyama scheme with irregular drift","author":[{"full_name":"Dareiotis, Konstantinos","last_name":"Dareiotis","first_name":"Konstantinos"},{"full_name":"Gerencser, Mate","last_name":"Gerencser","id":"44ECEDF2-F248-11E8-B48F-1D18A9856A87","first_name":"Mate"}],"external_id":{"arxiv":["1812.04583"],"isi":["000550150700001"]},"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"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).","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","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","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.","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."},"article_number":"82","volume":25,"file":[{"creator":"dernst","date_updated":"2020-09-21T13:15:02Z","file_size":273042,"date_created":"2020-09-21T13:15:02Z","file_name":"2020_EJournProbab_Dareiotis.pdf","access_level":"open_access","relation":"main_file","content_type":"application/pdf","checksum":"8e7c42e72596f6889d786e8e8b89994f","file_id":"8549","success":1}],"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1083-6489"]},"publication_status":"published","month":"07","intvolume":" 25","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"}],"department":[{"_id":"JaMa"}],"file_date_updated":"2020-09-21T13:15:02Z","ddc":["510"],"date_updated":"2023-10-16T09:22:50Z","status":"public","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)"},"_id":"6359"},{"month":"09","alternative_title":["ISTA Thesis"],"oa_version":"Published Version","acknowledged_ssus":[{"_id":"CampIT"},{"_id":"ScienComp"}],"abstract":[{"lang":"eng","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. "}],"license":"https://creativecommons.org/licenses/by-nc-sa/4.0/","related_material":{"record":[{"relation":"part_of_dissertation","id":"7936","status":"public"},{"relation":"part_of_dissertation","status":"public","id":"7937"},{"status":"public","id":"8193","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"8092","status":"public"},{"relation":"part_of_dissertation","id":"911","status":"public"}]},"language":[{"iso":"eng"}],"file":[{"file_name":"2020_Thesis_Royer.pdf","date_created":"2020-09-14T13:39:14Z","file_size":30224591,"date_updated":"2020-09-14T13:39:14Z","creator":"dernst","success":1,"checksum":"c914d2f88846032f3d8507734861b6ee","file_id":"8391","content_type":"application/pdf","relation":"main_file","access_level":"open_access"},{"file_id":"8392","checksum":"ae98fb35d912cff84a89035ae5794d3c","content_type":"application/x-zip-compressed","relation":"main_file","access_level":"closed","file_name":"thesis_sources.zip","date_created":"2020-09-14T13:39:17Z","file_size":74227627,"date_updated":"2020-09-14T13:39:17Z","creator":"dernst"}],"publication_status":"published","degree_awarded":"PhD","publication_identifier":{"isbn":["978-3-99078-007-7"],"issn":["2663-337X"]},"status":"public","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)"},"type":"dissertation","_id":"8390","department":[{"_id":"ChLa"}],"file_date_updated":"2020-09-14T13:39:17Z","ddc":["000"],"date_updated":"2023-10-16T10:04:02Z","supervisor":[{"last_name":"Lampert","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph","first_name":"Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87"}],"oa":1,"publisher":"Institute of Science and Technology Austria","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.","date_created":"2020-09-14T13:42:09Z","date_published":"2020-09-14T00:00:00Z","doi":"10.15479/AT:ISTA:8390","page":"197","day":"14","year":"2020","has_accepted_license":"1","title":"Leveraging structure in Computer Vision tasks for flexible Deep Learning models","article_processing_charge":"No","author":[{"first_name":"Amélie","id":"3811D890-F248-11E8-B48F-1D18A9856A87","full_name":"Royer, Amélie","orcid":"0000-0002-8407-0705","last_name":"Royer"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"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.","ista":"Royer A. 2020. Leveraging structure in Computer Vision tasks for flexible Deep Learning models. Institute of Science and Technology Austria.","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.","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","ama":"Royer A. Leveraging structure in Computer Vision tasks for flexible Deep Learning models. 2020. doi:10.15479/AT:ISTA:8390","short":"A. Royer, Leveraging Structure in Computer Vision Tasks for Flexible Deep Learning Models, Institute of Science and Technology Austria, 2020.","ieee":"A. Royer, “Leveraging structure in Computer Vision tasks for flexible Deep Learning models,” Institute of Science and Technology Austria, 2020."}},{"quality_controlled":"1","publisher":"IEEE","oa":1,"has_accepted_license":"1","year":"2020","day":"01","publication":"Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition","page":"7498-7507","doi":"10.1109/CVPR42600.2020.00752","date_published":"2020-07-01T00:00:00Z","date_created":"2020-07-31T16:53:49Z","citation":{"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","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","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.","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."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","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"},{"first_name":"Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","full_name":"Lampert, Christoph","orcid":"0000-0001-8622-7887","last_name":"Lampert"}],"external_id":{"arxiv":["2004.04180"]},"article_processing_charge":"No","title":"Leveraging 2D data to learn textured 3D mesh generation","abstract":[{"lang":"eng","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."}],"oa_version":"Submitted Version","scopus_import":"1","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"}],"month":"07","publication_identifier":{"eissn":["2575-7075"],"eisbn":["9781728171685"]},"publication_status":"published","file":[{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","success":1,"file_id":"8187","file_size":10262773,"date_updated":"2020-07-31T16:57:12Z","creator":"phenders","file_name":"paper.pdf","date_created":"2020-07-31T16:57:12Z"}],"language":[{"iso":"eng"}],"_id":"8186","type":"conference","conference":{"name":"CVPR: Conference on Computer Vision and Pattern Recognition","start_date":"2020-06-14","location":"Virtual","end_date":"2020-06-19"},"status":"public","date_updated":"2023-10-17T07:37:11Z","ddc":["004"],"department":[{"_id":"ChLa"}],"file_date_updated":"2020-07-31T16:57:12Z"},{"article_number":"1687175","article_processing_charge":"No","external_id":{"pmid":["31696764"],"isi":["000494909300001"]},"author":[{"first_name":"Scott A","id":"2D99FE6A-F248-11E8-B48F-1D18A9856A87","last_name":"Sinclair","orcid":"0000-0002-4566-0593","full_name":"Sinclair, Scott A"},{"first_name":"U.","full_name":"Krämer, U.","last_name":"Krämer"}],"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.","short":"S.A. Sinclair, U. Krämer, Plant Signaling & Behavior 15 (2020).","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.","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","oa":1,"publisher":"Taylor & Francis","quality_controlled":"1","date_created":"2020-01-30T10:12:04Z","doi":"10.1080/15592324.2019.1687175","date_published":"2020-01-01T00:00:00Z","year":"2020","isi":1,"publication":"Plant Signaling & Behavior","day":"01","type":"journal_article","article_type":"original","status":"public","_id":"7416","department":[{"_id":"JiFr"}],"date_updated":"2023-10-17T09:01:48Z","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."}],"oa_version":"Submitted Version","pmid":1,"issue":"1","volume":15,"publication_status":"published","publication_identifier":{"issn":["1559-2324"]},"language":[{"iso":"eng"}]},{"quality_controlled":"1","publisher":"Public Library of Science","oa":1,"isi":1,"has_accepted_license":"1","year":"2020","day":"27","publication":"PLOS Pathogens","doi":"10.1371/journal.ppat.1008277","date_published":"2020-01-27T00:00:00Z","date_created":"2020-02-06T18:47:17Z","article_number":"e1008277","project":[{"_id":"26736D6A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P31445","name":"Structural conservation and diversity in retroviral capsid"}],"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.","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","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).","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."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Dick","full_name":"Dick, Robert A.","first_name":"Robert A."},{"full_name":"Xu, Chaoyi","last_name":"Xu","first_name":"Chaoyi"},{"last_name":"Morado","full_name":"Morado, Dustin R.","first_name":"Dustin R."},{"full_name":"Kravchuk, Vladyslav","orcid":"0000-0001-9523-9089","last_name":"Kravchuk","first_name":"Vladyslav","id":"4D62F2A6-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Ricana, Clifton L.","last_name":"Ricana","first_name":"Clifton L."},{"first_name":"Terri D.","full_name":"Lyddon, Terri D.","last_name":"Lyddon"},{"first_name":"Arianna M.","last_name":"Broad","full_name":"Broad, Arianna M."},{"last_name":"Feathers","full_name":"Feathers, J. Ryan","first_name":"J. Ryan"},{"full_name":"Johnson, Marc C.","last_name":"Johnson","first_name":"Marc C."},{"first_name":"Volker M.","last_name":"Vogt","full_name":"Vogt, Volker M."},{"first_name":"Juan R.","last_name":"Perilla","full_name":"Perilla, Juan R."},{"last_name":"Briggs","full_name":"Briggs, John A. G.","first_name":"John A. G."},{"id":"48AD8942-F248-11E8-B48F-1D18A9856A87","first_name":"Florian KM","last_name":"Schur","full_name":"Schur, Florian KM","orcid":"0000-0003-4790-8078"}],"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","acknowledged_ssus":[{"_id":"ScienComp"}],"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"}],"oa_version":"Published Version","pmid":1,"scopus_import":"1","month":"01","intvolume":" 16","publication_identifier":{"issn":["1553-7374"]},"publication_status":"published","file":[{"checksum":"a297f54d1fef0efe4789ca00f37f241e","file_id":"7484","content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2020-02-11T10:07:28Z","file_name":"2020_PLOSPatho_Dick.pdf","date_updated":"2020-07-14T12:47:59Z","file_size":4551246,"creator":"dernst"}],"language":[{"iso":"eng"}],"volume":16,"issue":"1","related_material":{"record":[{"status":"deleted","id":"9723","relation":"research_data"}]},"_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","date_updated":"2023-10-17T12:29:34Z","ddc":["570"],"file_date_updated":"2020-07-14T12:47:59Z","department":[{"_id":"FlSc"}]},{"oa":1,"publisher":"Public Library of Science","quality_controlled":"1","year":"2020","isi":1,"has_accepted_license":"1","publication":"PLoS computational biology","day":"17","date_created":"2019-12-23T13:45:11Z","doi":"10.1371/journal.pcbi.1007494","date_published":"2020-01-17T00:00:00Z","article_number":"e1007494","project":[{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"},{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"grant_number":"S11407","name":"Game Theory","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425"}],"citation":{"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.","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.","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.","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","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."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","external_id":{"isi":["000510916500025"],"arxiv":["1906.02785"]},"author":[{"last_name":"Tkadlec","orcid":"0000-0002-1097-9684","full_name":"Tkadlec, Josef","first_name":"Josef","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Pavlogiannis","orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas","first_name":"Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"last_name":"Nowak","full_name":"Nowak, Martin A.","first_name":"Martin A."}],"title":"Limits on amplifiers of natural selection under death-Birth updating","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","scopus_import":"1","intvolume":" 16","month":"01","publication_status":"published","publication_identifier":{"eissn":["15537358"]},"language":[{"iso":"eng"}],"file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"7441","checksum":"ce32ee2d2f53aed832f78bbd47e882df","creator":"dernst","date_updated":"2020-07-14T12:47:53Z","file_size":1817531,"date_created":"2020-02-03T07:32:42Z","file_name":"2020_PlosCompBio_Tkadlec.pdf"}],"ec_funded":1,"related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"7196"}]},"volume":16,"_id":"7212","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","status":"public","date_updated":"2023-10-17T12:29:47Z","ddc":["000"],"department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:47:53Z"},{"related_material":{"record":[{"relation":"dissertation_contains","id":"7210","status":"public"},{"relation":"dissertation_contains","status":"public","id":"5751"},{"relation":"dissertation_contains","status":"public","id":"7212"}]},"publication_identifier":{"eissn":["2663-337X"]},"degree_awarded":"PhD","publication_status":"published","file":[{"relation":"source_file","access_level":"closed","content_type":"application/zip","file_id":"7255","checksum":"451f8e64b0eb26bf297644ac72bfcbe9","creator":"jtkadlec","file_size":21100497,"date_updated":"2020-07-14T12:47:52Z","file_name":"thesis.zip","date_created":"2020-01-12T11:49:49Z"},{"checksum":"d8c44cbc4f939c49a8efc9d4b8bb3985","file_id":"7367","access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2020-01-28T07:32:42Z","file_name":"2020_Tkadlec_Thesis.pdf","creator":"dernst","date_updated":"2020-07-14T12:47:52Z","file_size":11670983}],"language":[{"iso":"eng"}],"alternative_title":["ISTA Thesis"],"month":"01","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."}],"oa_version":"Published Version","file_date_updated":"2020-07-14T12:47:52Z","department":[{"_id":"KrCh"},{"_id":"GradSch"}],"supervisor":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"}],"date_updated":"2023-10-17T12:29:46Z","ddc":["519"],"type":"dissertation","status":"public","_id":"7196","page":"144","date_published":"2020-01-12T00:00:00Z","doi":"10.15479/AT:ISTA:7196","date_created":"2019-12-20T12:26:36Z","has_accepted_license":"1","year":"2020","day":"12","publisher":"Institute of Science and Technology Austria","oa":1,"author":[{"last_name":"Tkadlec","full_name":"Tkadlec, Josef","orcid":"0000-0002-1097-9684","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","first_name":"Josef"}],"article_processing_charge":"No","title":"A role of graphs in evolutionary processes","citation":{"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.","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."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1"},{"project":[{"_id":"059876FA-7A3F-11EA-A408-12923DDC885E","name":"Prix Lopez-Loretta 2019 - Marco Mondelli"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"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.","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."},"title":"Landscape connectivity and dropout stability of SGD solutions for over-parameterized neural networks","author":[{"last_name":"Shevchenko","full_name":"Shevchenko, Alexander","first_name":"Alexander"},{"id":"27EB676C-8706-11E9-9510-7717E6697425","first_name":"Marco","full_name":"Mondelli, Marco","orcid":"0000-0002-3242-7020","last_name":"Mondelli"}],"article_processing_charge":"No","external_id":{"arxiv":["1912.10095"]},"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.","quality_controlled":"1","publisher":"ML Research Press","oa":1,"day":"13","publication":"Proceedings of the 37th International Conference on Machine Learning","has_accepted_license":"1","year":"2020","date_published":"2020-07-13T00:00:00Z","date_created":"2021-02-25T09:36:22Z","page":"8773-8784","_id":"9198","status":"public","type":"conference","ddc":["000"],"date_updated":"2023-10-17T12:43:19Z","file_date_updated":"2021-03-02T15:38:14Z","department":[{"_id":"MaMo"}],"oa_version":"Published Version","abstract":[{"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.","lang":"eng"}],"month":"07","intvolume":" 119","file":[{"date_created":"2021-03-02T15:38:14Z","file_name":"2020_PMLR_Shevchenko.pdf","creator":"dernst","date_updated":"2021-03-02T15:38:14Z","file_size":5336380,"checksum":"f042c8d4316bd87c6361aa76f1fbdbbe","file_id":"9217","success":1,"access_level":"open_access","relation":"main_file","content_type":"application/pdf"}],"language":[{"iso":"eng"}],"publication_status":"published","volume":119},{"quality_controlled":"1","publisher":"De Gruyter","oa":1,"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).","page":"51-67","date_published":"2020-06-20T00:00:00Z","doi":"10.1515/cmb-2020-0100","date_created":"2021-02-17T15:13:01Z","has_accepted_license":"1","year":"2020","day":"20","publication":"Computational and Mathematical Biophysics","project":[{"name":"Alpha Shape Theory Extended","grant_number":"788183","call_identifier":"H2020","_id":"266A2E9E-B435-11E9-9278-68D0E5697425"},{"_id":"2561EBF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"I02979-N35","name":"Persistence and stability of geometric complexes"}],"author":[{"last_name":"Akopyan","full_name":"Akopyan, Arseniy","orcid":"0000-0002-2548-617X","first_name":"Arseniy","id":"430D2C90-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"}],"article_processing_charge":"No","title":"The weighted mean curvature derivative of a space-filling diagram","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.","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","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."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"06","intvolume":" 8","abstract":[{"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.","lang":"eng"}],"oa_version":"Published Version","issue":"1","volume":8,"ec_funded":1,"publication_identifier":{"issn":["2544-7297"]},"publication_status":"published","file":[{"content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"cea41de9937d07a3b927d71ee8b4e432","file_id":"9171","success":1,"date_updated":"2021-02-19T13:56:24Z","file_size":562359,"creator":"dernst","date_created":"2021-02-19T13:56:24Z","file_name":"2020_CompMathBiophysics_Akopyan2.pdf"}],"language":[{"iso":"eng"}],"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","_id":"9157","department":[{"_id":"HeEd"}],"file_date_updated":"2021-02-19T13:56:24Z","date_updated":"2023-10-17T12:34:51Z","ddc":["510"]},{"project":[{"_id":"266A2E9E-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Alpha Shape Theory Extended","grant_number":"788183"},{"name":"Persistence and stability of geometric complexes","grant_number":"I02979-N35","call_identifier":"FWF","_id":"2561EBF4-B435-11E9-9278-68D0E5697425"}],"author":[{"last_name":"Akopyan","orcid":"0000-0002-2548-617X","full_name":"Akopyan, Arseniy","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","first_name":"Arseniy"},{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","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","citation":{"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.","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","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.","ista":"Akopyan A, Edelsbrunner H. 2020. The weighted Gaussian curvature derivative of a space-filling diagram. Computational and Mathematical Biophysics. 8(1), 74–88."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"De Gruyter","quality_controlled":"1","oa":1,"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).","page":"74-88","date_published":"2020-07-21T00:00:00Z","doi":"10.1515/cmb-2020-0101","date_created":"2021-02-17T15:12:44Z","has_accepted_license":"1","year":"2020","day":"21","publication":"Computational and Mathematical Biophysics","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","_id":"9156","file_date_updated":"2021-02-19T13:33:19Z","department":[{"_id":"HeEd"}],"date_updated":"2023-10-17T12:35:10Z","ddc":["510"],"month":"07","intvolume":" 8","abstract":[{"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.","lang":"eng"}],"oa_version":"Published Version","issue":"1","volume":8,"ec_funded":1,"publication_identifier":{"issn":["2544-7297"]},"publication_status":"published","file":[{"file_size":707452,"date_updated":"2021-02-19T13:33:19Z","creator":"dernst","file_name":"2020_CompMathBiophysics_Akopyan.pdf","date_created":"2021-02-19T13:33:19Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","success":1,"checksum":"ca43a7440834eab6bbea29c59b56ef3a","file_id":"9170"}],"language":[{"iso":"eng"}]},{"article_type":"original","type":"journal_article","status":"public","_id":"8973","file_date_updated":"2020-12-28T08:24:08Z","department":[{"_id":"JaMa"}],"date_updated":"2023-10-17T12:51:56Z","ddc":["510"],"scopus_import":"1","intvolume":" 25","month":"10","abstract":[{"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.","lang":"eng"}],"oa_version":"Published Version","ec_funded":1,"volume":25,"publication_status":"published","publication_identifier":{"eissn":["1083-6489"]},"language":[{"iso":"eng"}],"file":[{"file_name":"2020_ElectronJProbab_Redig.pdf","date_created":"2020-12-28T08:24:08Z","creator":"dernst","file_size":696653,"date_updated":"2020-12-28T08:24:08Z","success":1,"checksum":"d75359b9814e78d57c0a481b7cde3751","file_id":"8976","relation":"main_file","access_level":"open_access","content_type":"application/pdf"}],"project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships"}],"article_number":"138","article_processing_charge":"No","external_id":{"isi":["000591737500001"],"arxiv":["1811.01366"]},"author":[{"last_name":"Redig","full_name":"Redig, Frank","first_name":"Frank"},{"first_name":"Ellen","full_name":"Saada, Ellen","last_name":"Saada"},{"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":{"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.","ista":"Redig F, Saada E, Sau F. 2020. Symmetric simple exclusion process in dynamic environment: Hydrodynamics. Electronic Journal of Probability. 25, 138.","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.","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).","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","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"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","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).","date_created":"2020-12-27T23:01:17Z","doi":"10.1214/20-EJP536","date_published":"2020-10-21T00:00:00Z","year":"2020","isi":1,"has_accepted_license":"1","publication":"Electronic Journal of Probability","day":"21"},{"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","publisher":"Duke University Press","quality_controlled":"1","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"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.","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.","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","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","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.","short":"T.D. Browning, R. Heath Brown, Duke Mathematical Journal 169 (2020) 3099–3165."},"title":"Density of rational points on a quadric bundle in ℙ3×ℙ3","author":[{"last_name":"Browning","full_name":"Browning, Timothy D","orcid":"0000-0002-8314-0177","first_name":"Timothy D","id":"35827D50-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Heath Brown","full_name":"Heath Brown, Roger","first_name":"Roger"}],"external_id":{"arxiv":["1805.10715"],"isi":["000582676300002"]},"article_processing_charge":"No","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0012-7094"]},"publication_status":"published","volume":169,"issue":"16","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":[{"url":"https://arxiv.org/abs/1805.10715","open_access":"1"}],"date_updated":"2023-10-17T12:51:10Z","department":[{"_id":"TiBr"}],"_id":"179","status":"public","article_type":"original","type":"journal_article"},{"day":"15","year":"2020","doi":"10.6084/m9.figshare.5973013.v1","date_published":"2020-10-15T00:00:00Z","related_material":{"record":[{"relation":"used_in_publication","status":"public","id":"198"}]},"date_created":"2021-08-06T13:09:57Z","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","main_file_link":[{"url":"https://doi.org/10.6084/m9.figshare.5973013.v1","open_access":"1"}],"oa":1,"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","date_updated":"2023-10-18T06:36:00Z","citation":{"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.","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.","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","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","short":"R. Ibsen-Jensen, J. Tkadlec, K. Chatterjee, M. Nowak, (2020).","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."},"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":[{"first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389","last_name":"Ibsen-Jensen"},{"last_name":"Tkadlec","orcid":"0000-0002-1097-9684","full_name":"Tkadlec, Josef","first_name":"Josef","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"first_name":"Martin","full_name":"Nowak, Martin","last_name":"Nowak"}],"article_processing_charge":"No","_id":"9814","status":"public","type":"research_data_reference"},{"article_number":"043202","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"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.","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.","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","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."},"title":"Free space Ramsey spectroscopy in rubidium with noise below the quantum projection limit","author":[{"last_name":"Malia","full_name":"Malia, Benjamin K.","first_name":"Benjamin K."},{"last_name":"Martínez-Rincón","full_name":"Martínez-Rincón, Julián","first_name":"Julián"},{"full_name":"Wu, Yunfan","last_name":"Wu","first_name":"Yunfan"},{"orcid":"0000-0002-2031-204X","full_name":"Hosten, Onur","last_name":"Hosten","first_name":"Onur","id":"4C02D85E-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Mark A.","last_name":"Kasevich","full_name":"Kasevich, Mark A."}],"external_id":{"arxiv":["1912.10218"],"isi":["000552227400008"],"pmid":["32794788"]},"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).","quality_controlled":"1","publisher":"American Physical Society","oa":1,"day":"24","publication":"Physical Review Letters","isi":1,"year":"2020","date_published":"2020-07-24T00:00:00Z","doi":"10.1103/PhysRevLett.125.043202","date_created":"2020-08-24T06:24:04Z","_id":"8285","status":"public","article_type":"original","type":"journal_article","date_updated":"2023-10-18T08:38:35Z","department":[{"_id":"OnHo"}],"oa_version":"Preprint","pmid":1,"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."}],"month":"07","intvolume":" 125","scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/1912.10218","open_access":"1"}],"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1079-7114"],"issn":["0031-9007"]},"publication_status":"published","issue":"4","volume":125},{"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","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"}],"type":"conference","conference":{"name":"NeurIPS: Conference on Neural Information Processing Systems","start_date":"2020-12-06","location":"Vancouver, Canada","end_date":"2020-12-12"},"status":"public","_id":"9633","department":[{"_id":"TiVo"}],"date_updated":"2023-10-18T09:20:55Z","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.","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","project":[{"grant_number":"214316/Z/18/Z","name":"What’s in a memory? Spatiotemporal dynamics in strongly coupled recurrent neuronal networks.","_id":"c084a126-5a5b-11eb-8a69-d75314a70a87"},{"grant_number":"819603","name":"Learning the shape of synaptic plasticity rules for neuronal architectures and function through machine learning.","call_identifier":"H2020","_id":"0aacfa84-070f-11eb-9043-d7eb2c709234"}],"author":[{"full_name":"Confavreux, Basile J","last_name":"Confavreux","id":"C7610134-B532-11EA-BD9F-F5753DDC885E","first_name":"Basile J"},{"first_name":"Friedemann","full_name":"Zenke, Friedemann","last_name":"Zenke"},{"full_name":"Agnes, Everton J.","last_name":"Agnes","first_name":"Everton J."},{"first_name":"Timothy","full_name":"Lillicrap, Timothy","last_name":"Lillicrap"},{"first_name":"Tim P","id":"CB6FF8D2-008F-11EA-8E08-2637E6697425","orcid":"0000-0003-3295-6181","full_name":"Vogels, Tim P","last_name":"Vogels"}],"article_processing_charge":"No","title":"A meta-learning approach to (re)discover plasticity rules that carve a desired function into a neural network","citation":{"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.","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.","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.","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.","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.","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."},"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf"},{"date_created":"2020-12-13T23:01:21Z","date_published":"2020-12-01T00:00:00Z","doi":"10.1016/j.celrep.2020.108463","publication":"Cell Reports","day":"01","year":"2020","isi":1,"has_accepted_license":"1","oa":1,"publisher":"Elsevier","quality_controlled":"1","acknowledgement":"We thank Drs. Sebastian Bednarek (University of Wisconsin-Madison), Niko Geldner (University of Lausanne), and Karin Schumacher (Heidelberg University) for kindly sharing published Arabidopsis lines; Dr. Satoshi Naramoto for the pPIN2::PIN2-GFP; pVHA-a1::VHA-a1-mRFP reporter; the staff at the Life Science Facility and Bioimaging Facility, Monika Hrtyan, and Dorota Jaworska at IST Austria for technical support; and Drs. Su Tang (Texas A&M University),\r\nMelinda Abas (BOKU), Eva Benkova´ (IST Austria), Christian Luschnig (BOKU), Bartel Vanholme (Gent University), and the Friml group for valuable discussions. The research leading to these findings was funded by the European Union’s Horizon 2020 program (ERC grant agreement no. 742985, to J.F.), the People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007-2013) under REA grant agreement no.\r\n291734, the Swiss National Funds (31003A_165877, to M.G.), the Ministry of Education, Youth, and Sports of the Czech Republic (project no. CZ.02.1.01/0.0/0.0/16_019/0000738, EU Operational Programme ‘‘Research, development and education and Centre for Plant Experimental Biology’’), and the EU Operational Programme Prague - Competitiveness (project no. CZ.2.16/3.1.00/21519). S.T. was funded by a European Molecular Biology Organization (EMBO) long-term postdoctoral fellowship (ALTF 723-2015). X.Z. was partly supported by a PhD scholarship from the China Scholarship Council.","title":"Non-steroidal anti-inflammatory drugs target TWISTED DWARF1-regulated actin dynamics and auxin transport-mediated plant development","external_id":{"pmid":["33264621"],"isi":["000595658100018"]},"article_processing_charge":"Yes","author":[{"full_name":"Tan, Shutang","orcid":"0000-0002-0471-8285","last_name":"Tan","id":"2DE75584-F248-11E8-B48F-1D18A9856A87","first_name":"Shutang"},{"full_name":"Di Donato, Martin","last_name":"Di Donato","first_name":"Martin"},{"orcid":"0000-0003-0619-7783","full_name":"Glanc, Matous","last_name":"Glanc","id":"1AE1EA24-02D0-11E9-9BAA-DAF4881429F2","first_name":"Matous"},{"last_name":"Zhang","full_name":"Zhang, Xixi","orcid":"0000-0001-7048-4627","first_name":"Xixi","id":"61A66458-47E9-11EA-85BA-8AEAAF14E49A"},{"last_name":"Klíma","full_name":"Klíma, Petr","first_name":"Petr"},{"first_name":"Jie","full_name":"Liu, Jie","last_name":"Liu"},{"first_name":"Aurélien","last_name":"Bailly","full_name":"Bailly, Aurélien"},{"last_name":"Ferro","full_name":"Ferro, Noel","first_name":"Noel"},{"last_name":"Petrášek","full_name":"Petrášek, Jan","first_name":"Jan"},{"first_name":"Markus","last_name":"Geisler","full_name":"Geisler, Markus"},{"id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jiří","full_name":"Friml, Jiří","orcid":"0000-0002-8302-7596","last_name":"Friml"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Tan, S., Di Donato, M., Glanc, M., Zhang, X., Klíma, P., Liu, J., … Friml, J. (2020). Non-steroidal anti-inflammatory drugs target TWISTED DWARF1-regulated actin dynamics and auxin transport-mediated plant development. Cell Reports. Elsevier. https://doi.org/10.1016/j.celrep.2020.108463","ama":"Tan S, Di Donato M, Glanc M, et al. Non-steroidal anti-inflammatory drugs target TWISTED DWARF1-regulated actin dynamics and auxin transport-mediated plant development. Cell Reports. 2020;33(9). doi:10.1016/j.celrep.2020.108463","ieee":"S. Tan et al., “Non-steroidal anti-inflammatory drugs target TWISTED DWARF1-regulated actin dynamics and auxin transport-mediated plant development,” Cell Reports, vol. 33, no. 9. Elsevier, 2020.","short":"S. Tan, M. Di Donato, M. Glanc, X. Zhang, P. Klíma, J. Liu, A. Bailly, N. Ferro, J. Petrášek, M. Geisler, J. Friml, Cell Reports 33 (2020).","mla":"Tan, Shutang, et al. “Non-Steroidal Anti-Inflammatory Drugs Target TWISTED DWARF1-Regulated Actin Dynamics and Auxin Transport-Mediated Plant Development.” Cell Reports, vol. 33, no. 9, 108463, Elsevier, 2020, doi:10.1016/j.celrep.2020.108463.","ista":"Tan S, Di Donato M, Glanc M, Zhang X, Klíma P, Liu J, Bailly A, Ferro N, Petrášek J, Geisler M, Friml J. 2020. Non-steroidal anti-inflammatory drugs target TWISTED DWARF1-regulated actin dynamics and auxin transport-mediated plant development. Cell Reports. 33(9), 108463.","chicago":"Tan, Shutang, Martin Di Donato, Matous Glanc, Xixi Zhang, Petr Klíma, Jie Liu, Aurélien Bailly, et al. “Non-Steroidal Anti-Inflammatory Drugs Target TWISTED DWARF1-Regulated Actin Dynamics and Auxin Transport-Mediated Plant Development.” Cell Reports. Elsevier, 2020. https://doi.org/10.1016/j.celrep.2020.108463."},"project":[{"name":"Tracing Evolution of Auxin Transport and Polarity in Plants","grant_number":"742985","call_identifier":"H2020","_id":"261099A6-B435-11E9-9278-68D0E5697425"},{"_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","grant_number":"291734"},{"grant_number":"723-2015","name":"Long Term Fellowship","_id":"256FEF10-B435-11E9-9278-68D0E5697425"}],"article_number":"108463","ec_funded":1,"related_material":{"link":[{"description":"News on IST Homepage","url":"https://ist.ac.at/en/news/plants-on-aspirin/","relation":"press_release"}]},"volume":33,"issue":"9","language":[{"iso":"eng"}],"file":[{"creator":"dernst","date_updated":"2020-12-14T07:33:39Z","file_size":8056434,"date_created":"2020-12-14T07:33:39Z","file_name":"2020_CellReports_Tan.pdf","access_level":"open_access","relation":"main_file","content_type":"application/pdf","checksum":"ed18cba0fb48ed2e789381a54cc21904","file_id":"8948","success":1}],"publication_status":"published","publication_identifier":{"eissn":["22111247"]},"intvolume":" 33","month":"12","scopus_import":"1","pmid":1,"oa_version":"Published Version","acknowledged_ssus":[{"_id":"LifeSc"},{"_id":"Bio"}],"abstract":[{"lang":"eng","text":"The widely used non-steroidal anti-inflammatory drugs (NSAIDs) are derivatives of the phytohormone salicylic acid (SA). SA is well known to regulate plant immunity and development, whereas there have been few reports focusing on the effects of NSAIDs in plants. Our studies here reveal that NSAIDs exhibit largely overlapping physiological activities to SA in the model plant Arabidopsis. NSAID treatments lead to shorter and agravitropic primary roots and inhibited lateral root organogenesis. Notably, in addition to the SA-like action, which in roots involves binding to the protein phosphatase 2A (PP2A), NSAIDs also exhibit PP2A-independent effects. Cell biological and biochemical analyses reveal that many NSAIDs bind directly to and inhibit the chaperone activity of TWISTED DWARF1, thereby regulating actin cytoskeleton dynamics and subsequent endosomal trafficking. Our findings uncover an unexpected bioactivity of human pharmaceuticals in plants and provide insights into the molecular mechanism underlying the cellular action of this class of anti-inflammatory compounds."}],"department":[{"_id":"JiFr"}],"file_date_updated":"2020-12-14T07:33:39Z","ddc":["580"],"date_updated":"2023-11-16T13:03:31Z","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)"},"type":"journal_article","article_type":"original","_id":"8943"},{"project":[{"grant_number":"I04188","name":"Instabilities in pulsating pipe flow of Newtonian and complex fluids","call_identifier":"FWF","_id":"238B8092-32DE-11EA-91FC-C7463DDC885E"},{"call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"mla":"Xu, Duo, et al. “Nonlinear Hydrodynamic Instability and Turbulence in Pulsatile Flow.” Proceedings of the National Academy of Sciences of the United States of America, vol. 117, no. 21, National Academy of Sciences, 2020, pp. 11233–39, doi:10.1073/pnas.1913716117.","apa":"Xu, D., Varshney, A., Ma, X., Song, B., Riedl, M., Avila, M., & Hof, B. (2020). Nonlinear hydrodynamic instability and turbulence in pulsatile flow. Proceedings of the National Academy of Sciences of the United States of America. National Academy of Sciences. https://doi.org/10.1073/pnas.1913716117","ama":"Xu D, Varshney A, Ma X, et al. Nonlinear hydrodynamic instability and turbulence in pulsatile flow. Proceedings of the National Academy of Sciences of the United States of America. 2020;117(21):11233-11239. doi:10.1073/pnas.1913716117","ieee":"D. Xu et al., “Nonlinear hydrodynamic instability and turbulence in pulsatile flow,” Proceedings of the National Academy of Sciences of the United States of America, vol. 117, no. 21. National Academy of Sciences, pp. 11233–11239, 2020.","short":"D. Xu, A. Varshney, X. Ma, B. Song, M. Riedl, M. Avila, B. Hof, Proceedings of the National Academy of Sciences of the United States of America 117 (2020) 11233–11239.","chicago":"Xu, Duo, Atul Varshney, Xingyu Ma, Baofang Song, Michael Riedl, Marc Avila, and Björn Hof. “Nonlinear Hydrodynamic Instability and Turbulence in Pulsatile Flow.” Proceedings of the National Academy of Sciences of the United States of America. National Academy of Sciences, 2020. https://doi.org/10.1073/pnas.1913716117.","ista":"Xu D, Varshney A, Ma X, Song B, Riedl M, Avila M, Hof B. 2020. Nonlinear hydrodynamic instability and turbulence in pulsatile flow. Proceedings of the National Academy of Sciences of the United States of America. 117(21), 11233–11239."},"title":"Nonlinear hydrodynamic instability and turbulence in pulsatile flow","author":[{"first_name":"Duo","id":"3454D55E-F248-11E8-B48F-1D18A9856A87","last_name":"Xu","full_name":"Xu, Duo"},{"full_name":"Varshney, Atul","orcid":"0000-0002-3072-5999","last_name":"Varshney","first_name":"Atul","id":"2A2006B2-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-0179-9737","full_name":"Ma, Xingyu","last_name":"Ma","first_name":"Xingyu","id":"34BADBA6-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Baofang","full_name":"Song, Baofang","last_name":"Song"},{"last_name":"Riedl","orcid":"0000-0003-4844-6311","full_name":"Riedl, Michael","id":"3BE60946-F248-11E8-B48F-1D18A9856A87","first_name":"Michael"},{"first_name":"Marc","full_name":"Avila, Marc","last_name":"Avila"},{"last_name":"Hof","orcid":"0000-0003-2057-2754","full_name":"Hof, Björn","id":"3A374330-F248-11E8-B48F-1D18A9856A87","first_name":"Björn"}],"external_id":{"isi":["000536797100014"],"arxiv":["2005.11190"]},"article_processing_charge":"No","publisher":"National Academy of Sciences","quality_controlled":"1","oa":1,"day":"26","publication":"Proceedings of the National Academy of Sciences of the United States of America","isi":1,"year":"2020","date_published":"2020-05-26T00:00:00Z","doi":"10.1073/pnas.1913716117","date_created":"2020-06-07T22:00:51Z","page":"11233-11239","_id":"7932","status":"public","type":"journal_article","article_type":"original","date_updated":"2023-11-30T10:55:13Z","department":[{"_id":"BjHo"}],"oa_version":"Preprint","abstract":[{"text":"Pulsating flows through tubular geometries are laminar provided that velocities are moderate. This in particular is also believed to apply to cardiovascular flows where inertial forces are typically too low to sustain turbulence. On the other hand, flow instabilities and fluctuating shear stresses are held responsible for a variety of cardiovascular diseases. Here we report a nonlinear instability mechanism for pulsating pipe flow that gives rise to bursts of turbulence at low flow rates. Geometrical distortions of small, yet finite, amplitude are found to excite a state consisting of helical vortices during flow deceleration. The resulting flow pattern grows rapidly in magnitude, breaks down into turbulence, and eventually returns to laminar when the flow accelerates. This scenario causes shear stress fluctuations and flow reversal during each pulsation cycle. Such unsteady conditions can adversely affect blood vessels and have been shown to promote inflammation and dysfunction of the shear stress-sensitive endothelial cell layer.","lang":"eng"}],"month":"05","intvolume":" 117","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2005.11190"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["00278424"],"eissn":["10916490"]},"publication_status":"published","issue":"21","related_material":{"record":[{"status":"public","id":"12726","relation":"dissertation_contains"},{"status":"public","id":"14530","relation":"dissertation_contains"}],"link":[{"relation":"press_release","url":"https://ist.ac.at/en/news/blood-flows-more-turbulent-than-previously-expected/","description":"News on IST Homepage"}]},"volume":117,"ec_funded":1},{"page":"1421-1539","date_created":"2023-12-18T10:37:43Z","date_published":"2020-09-01T00:00:00Z","doi":"10.4171/dm/780","year":"2020","has_accepted_license":"1","publication":"Documenta Mathematica","day":"01","oa":1,"quality_controlled":"1","publisher":"EMS Press","article_processing_charge":"Yes","external_id":{"arxiv":["1804.07752"]},"author":[{"first_name":"Johannes","id":"36D3D8B6-F248-11E8-B48F-1D18A9856A87","last_name":"Alt","full_name":"Alt, Johannes"},{"id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","first_name":"László","last_name":"Erdös","full_name":"Erdös, László","orcid":"0000-0001-5366-9603"},{"first_name":"Torben H","id":"3020C786-F248-11E8-B48F-1D18A9856A87","full_name":"Krüger, Torben H","orcid":"0000-0002-4821-3297","last_name":"Krüger"}],"title":"The Dyson equation with linear self-energy: Spectral bands, edges and cusps","citation":{"ista":"Alt J, Erdös L, Krüger TH. 2020. The Dyson equation with linear self-energy: Spectral bands, edges and cusps. Documenta Mathematica. 25, 1421–1539.","chicago":"Alt, Johannes, László Erdös, and Torben H Krüger. “The Dyson Equation with Linear Self-Energy: Spectral Bands, Edges and Cusps.” Documenta Mathematica. EMS Press, 2020. https://doi.org/10.4171/dm/780.","ieee":"J. Alt, L. Erdös, and T. H. Krüger, “The Dyson equation with linear self-energy: Spectral bands, edges and cusps,” Documenta Mathematica, vol. 25. EMS Press, pp. 1421–1539, 2020.","short":"J. Alt, L. Erdös, T.H. Krüger, Documenta Mathematica 25 (2020) 1421–1539.","ama":"Alt J, Erdös L, Krüger TH. The Dyson equation with linear self-energy: Spectral bands, edges and cusps. Documenta Mathematica. 2020;25:1421-1539. doi:10.4171/dm/780","apa":"Alt, J., Erdös, L., & Krüger, T. H. (2020). The Dyson equation with linear self-energy: Spectral bands, edges and cusps. Documenta Mathematica. EMS Press. https://doi.org/10.4171/dm/780","mla":"Alt, Johannes, et al. “The Dyson Equation with Linear Self-Energy: Spectral Bands, Edges and Cusps.” Documenta Mathematica, vol. 25, EMS Press, 2020, pp. 1421–539, doi:10.4171/dm/780."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":25,"related_material":{"record":[{"status":"public","id":"6183","relation":"earlier_version"}]},"publication_status":"published","publication_identifier":{"issn":["1431-0635"],"eissn":["1431-0643"]},"language":[{"iso":"eng"}],"file":[{"file_name":"2020_DocumentaMathematica_Alt.pdf","date_created":"2023-12-18T10:42:32Z","file_size":1374708,"date_updated":"2023-12-18T10:42:32Z","creator":"dernst","success":1,"checksum":"12aacc1d63b852ff9a51c1f6b218d4a6","file_id":"14695","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"intvolume":" 25","month":"09","abstract":[{"lang":"eng","text":"We study the unique solution m of the Dyson equation \\( -m(z)^{-1} = z\\1 - a + S[m(z)] \\) on a von Neumann algebra A with the constraint Imm≥0. Here, z lies in the complex upper half-plane, a is a self-adjoint element of A and S is a positivity-preserving linear operator on A. We show that m is the Stieltjes transform of a compactly supported A-valued measure on R. Under suitable assumptions, we establish that this measure has a uniformly 1/3-Hölder continuous density with respect to the Lebesgue measure, which is supported on finitely many intervals, called bands. In fact, the density is analytic inside the bands with a square-root growth at the edges and internal cubic root cusps whenever the gap between two bands vanishes. The shape of these singularities is universal and no other singularity may occur. We give a precise asymptotic description of m near the singular points. These asymptotics generalize the analysis at the regular edges given in the companion paper on the Tracy-Widom universality for the edge eigenvalue statistics for correlated random matrices [the first author et al., Ann. Probab. 48, No. 2, 963--1001 (2020; Zbl 1434.60017)] and they play a key role in the proof of the Pearcey universality at the cusp for Wigner-type matrices [G. Cipolloni et al., Pure Appl. Anal. 1, No. 4, 615--707 (2019; Zbl 07142203); the second author et al., Commun. Math. Phys. 378, No. 2, 1203--1278 (2020; Zbl 07236118)]. We also extend the finite dimensional band mass formula from [the first author et al., loc. cit.] to the von Neumann algebra setting by showing that the spectral mass of the bands is topologically rigid under deformations and we conclude that these masses are quantized in some important cases."}],"oa_version":"Published Version","department":[{"_id":"LaEr"}],"file_date_updated":"2023-12-18T10:42:32Z","date_updated":"2023-12-18T10:46:09Z","ddc":["510"],"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","keyword":["General Mathematics"],"status":"public","_id":"14694"},{"_id":"8156","type":"dissertation","status":"public","supervisor":[{"orcid":"0000-0002-1494-0568","full_name":"Wagner, Uli","last_name":"Wagner","first_name":"Uli","id":"36690CA2-F248-11E8-B48F-1D18A9856A87"}],"date_updated":"2023-12-18T10:51:01Z","ddc":["514"],"file_date_updated":"2020-07-27T12:46:53Z","department":[{"_id":"UlWa"}],"abstract":[{"lang":"eng","text":"We present solutions to several problems originating from geometry and discrete mathematics: existence of equipartitions, maps without Tverberg multiple points, and inscribing quadrilaterals. Equivariant obstruction theory is the natural topological approach to these type of questions. However, for the specific problems we consider it had yielded only partial or no results. We get our results by complementing equivariant obstruction theory with other techniques from topology and geometry."}],"oa_version":"Published Version","alternative_title":["ISTA Thesis"],"month":"07","publication_identifier":{"issn":["2663-337X"]},"publication_status":"published","degree_awarded":"PhD","file":[{"relation":"source_file","access_level":"closed","content_type":"application/zip","file_id":"8178","creator":"savvakum","file_size":1061740,"date_updated":"2020-07-27T12:44:51Z","file_name":"source.zip","date_created":"2020-07-27T12:44:51Z"},{"file_size":1336501,"date_updated":"2020-07-27T12:46:53Z","creator":"savvakum","file_name":"thesis_pdfa.pdf","date_created":"2020-07-27T12:46:53Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","success":1,"file_id":"8179"}],"language":[{"iso":"eng"}],"related_material":{"record":[{"relation":"part_of_dissertation","id":"8182","status":"public"},{"relation":"part_of_dissertation","status":"public","id":"8183"},{"status":"public","id":"8185","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"8184"},{"status":"public","id":"6355","relation":"part_of_dissertation"},{"id":"75","status":"public","relation":"part_of_dissertation"}]},"citation":{"mla":"Avvakumov, Sergey. Topological Methods in Geometry and Discrete Mathematics. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:8156.","ieee":"S. Avvakumov, “Topological methods in geometry and discrete mathematics,” Institute of Science and Technology Austria, 2020.","short":"S. Avvakumov, Topological Methods in Geometry and Discrete Mathematics, Institute of Science and Technology Austria, 2020.","apa":"Avvakumov, S. (2020). Topological methods in geometry and discrete mathematics. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:8156","ama":"Avvakumov S. Topological methods in geometry and discrete mathematics. 2020. doi:10.15479/AT:ISTA:8156","chicago":"Avvakumov, Sergey. “Topological Methods in Geometry and Discrete Mathematics.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:8156.","ista":"Avvakumov S. 2020. Topological methods in geometry and discrete mathematics. Institute of Science and Technology Austria."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"first_name":"Sergey","id":"3827DAC8-F248-11E8-B48F-1D18A9856A87","full_name":"Avvakumov, Sergey","last_name":"Avvakumov"}],"article_processing_charge":"No","title":"Topological methods in geometry and discrete mathematics","publisher":"Institute of Science and Technology Austria","oa":1,"has_accepted_license":"1","year":"2020","day":"24","page":"119","date_published":"2020-07-24T00:00:00Z","doi":"10.15479/AT:ISTA:8156","date_created":"2020-07-23T09:51:29Z"},{"citation":{"mla":"Lewin, Mathieu, et al. “ The Local Density Approximation in Density Functional Theory.” Pure and Applied Analysis, vol. 2, no. 1, Mathematical Sciences Publishers, 2020, pp. 35–73, doi:10.2140/paa.2020.2.35.","ieee":"M. Lewin, E. H. Lieb, and R. Seiringer, “ The local density approximation in density functional theory,” Pure and Applied Analysis, vol. 2, no. 1. Mathematical Sciences Publishers, pp. 35–73, 2020.","short":"M. Lewin, E.H. Lieb, R. Seiringer, Pure and Applied Analysis 2 (2020) 35–73.","ama":"Lewin M, Lieb EH, Seiringer R. The local density approximation in density functional theory. Pure and Applied Analysis. 2020;2(1):35-73. doi:10.2140/paa.2020.2.35","apa":"Lewin, M., Lieb, E. H., & Seiringer, R. (2020). The local density approximation in density functional theory. Pure and Applied Analysis. Mathematical Sciences Publishers. https://doi.org/10.2140/paa.2020.2.35","chicago":"Lewin, Mathieu, Elliott H. Lieb, and Robert Seiringer. “ The Local Density Approximation in Density Functional Theory.” Pure and Applied Analysis. Mathematical Sciences Publishers, 2020. https://doi.org/10.2140/paa.2020.2.35.","ista":"Lewin M, Lieb EH, Seiringer R. 2020. The local density approximation in density functional theory. Pure and Applied Analysis. 2(1), 35–73."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","external_id":{"arxiv":["1903.04046"]},"author":[{"first_name":"Mathieu","last_name":"Lewin","full_name":"Lewin, Mathieu"},{"first_name":"Elliott H.","full_name":"Lieb, Elliott H.","last_name":"Lieb"},{"first_name":"Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","last_name":"Seiringer","full_name":"Seiringer, Robert","orcid":"0000-0002-6781-0521"}],"title":" The local density approximation in density functional theory","year":"2020","publication":"Pure and Applied Analysis","day":"01","page":"35-73","date_created":"2024-01-28T23:01:44Z","date_published":"2020-01-01T00:00:00Z","doi":"10.2140/paa.2020.2.35","oa":1,"quality_controlled":"1","publisher":"Mathematical Sciences Publishers","date_updated":"2024-01-29T09:01:12Z","department":[{"_id":"RoSe"}],"_id":"14891","article_type":"original","type":"journal_article","status":"public","publication_status":"published","publication_identifier":{"eissn":["2578-5885"],"issn":["2578-5893"]},"language":[{"iso":"eng"}],"volume":2,"issue":"1","abstract":[{"lang":"eng","text":"We give the first mathematically rigorous justification of the local density approximation in density functional theory. We provide a quantitative estimate on the difference between the grand-canonical Levy–Lieb energy of a given density (the lowest possible energy of all quantum states having this density) and the integral over the uniform electron gas energy of this density. The error involves gradient terms and justifies the use of the local density approximation in the situation where the density is very flat on sufficiently large regions in space."}],"oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.1903.04046"}],"scopus_import":"1","intvolume":" 2","month":"01"},{"volume":450,"file":[{"creator":"dernst","date_updated":"2020-12-03T11:45:26Z","file_size":4071247,"date_created":"2020-12-03T11:45:26Z","file_name":"2020_Neuroscience_Salamatina.pdf","access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"8915","checksum":"da7413c819e079720669c82451b49294","success":1}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["0306-4522"]},"publication_status":"published","month":"12","intvolume":" 450","scopus_import":"1","oa_version":"Published Version","pmid":1,"abstract":[{"text":"Amyotrophic lateral sclerosis (ALS) leads to a loss of specific motor neuron populations in the spinal cord and cortex. Emerging evidence suggests that interneurons may also be affected, but a detailed characterization of interneuron loss and its potential impacts on motor neuron loss and disease progression is lacking. To examine this issue, the fate of V1 inhibitory neurons during ALS was assessed in the ventral spinal cord using the SODG93A mouse model. The V1 population makes up ∼30% of all ventral inhibitory neurons, ∼50% of direct inhibitory synaptic contacts onto motor neuron cell bodies, and is thought to play a key role in modulating motor output, in part through recurrent and reciprocal inhibitory circuits. We find that approximately half of V1 inhibitory neurons are lost in SODG93A mice at late disease stages, but that this loss is delayed relative to the loss of motor neurons and V2a excitatory neurons. We further identify V1 subpopulations based on transcription factor expression that are differentially susceptible to degeneration in SODG93A mice. At an early disease stage, we show that V1 synaptic contacts with motor neuron cell bodies increase, suggesting an upregulation of inhibition before V1 neurons are lost in substantial numbers. These data support a model in which progressive changes in V1 synaptic contacts early in disease, and in select V1 subpopulations at later stages, represent a compensatory upregulation and then deleterious breakdown of specific interneuron circuits within the spinal cord.","lang":"eng"}],"file_date_updated":"2020-12-03T11:45:26Z","department":[{"_id":"LoSw"}],"ddc":["570"],"date_updated":"2024-01-31T10:15:34Z","status":"public","type":"journal_article","article_type":"original","tmp":{"short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png"},"_id":"8914","date_published":"2020-12-01T00:00:00Z","doi":"10.1016/j.neuroscience.2020.08.011","date_created":"2020-12-03T11:47:31Z","page":"81-95","day":"01","publication":"Neuroscience","has_accepted_license":"1","isi":1,"year":"2020","quality_controlled":"1","publisher":"Elsevier","oa":1,"acknowledgement":"This work was made possible by the generous support of Project ALS. Imaging and related analyses were facilitated by The Waitt Advanced Biophotonics Center Core at the Salk Institute, supported by grants from NIH-NCI CCSG (P30 014195) and NINDS Neuroscience Center (NS072031). The authors would like to additionally thank Drs. Jane Dodd, Robert Brownstone, and Laskaro Zagoraiou for helpful comments on the manuscript. This manuscript is dedicated to Tom Jessell, an inspirational scientist, friend and mentor.","title":"Differential loss of spinal interneurons in a mouse model of ALS","author":[{"first_name":"Alina","full_name":"Salamatina, Alina","last_name":"Salamatina"},{"full_name":"Yang, Jerry H","last_name":"Yang","first_name":"Jerry H"},{"full_name":"Brenner-Morton, Susan","last_name":"Brenner-Morton","first_name":"Susan"},{"first_name":"Jay B ","full_name":"Bikoff, Jay B ","last_name":"Bikoff"},{"full_name":"Fang, Linjing","last_name":"Fang","first_name":"Linjing"},{"full_name":"Kintner, Christopher R","last_name":"Kintner","first_name":"Christopher R"},{"full_name":"Jessell, Thomas M","last_name":"Jessell","first_name":"Thomas M"},{"first_name":"Lora Beatrice Jaeger","id":"56BE8254-C4F0-11E9-8E45-0B23E6697425","last_name":"Sweeney","full_name":"Sweeney, Lora Beatrice Jaeger","orcid":"0000-0001-9242-5601"}],"external_id":{"isi":["000595588700008"],"pmid":["32858144"]},"article_processing_charge":"Yes (via OA deal)","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Salamatina A, Yang JH, Brenner-Morton S, Bikoff JB, Fang L, Kintner CR, Jessell TM, Sweeney LB. 2020. Differential loss of spinal interneurons in a mouse model of ALS. Neuroscience. 450, 81–95.","chicago":"Salamatina, Alina, Jerry H Yang, Susan Brenner-Morton, Jay B Bikoff, Linjing Fang, Christopher R Kintner, Thomas M Jessell, and Lora B. Sweeney. “Differential Loss of Spinal Interneurons in a Mouse Model of ALS.” Neuroscience. Elsevier, 2020. https://doi.org/10.1016/j.neuroscience.2020.08.011.","ieee":"A. Salamatina et al., “Differential loss of spinal interneurons in a mouse model of ALS,” Neuroscience, vol. 450. Elsevier, pp. 81–95, 2020.","short":"A. Salamatina, J.H. Yang, S. Brenner-Morton, J.B. Bikoff, L. Fang, C.R. Kintner, T.M. Jessell, L.B. Sweeney, Neuroscience 450 (2020) 81–95.","apa":"Salamatina, A., Yang, J. H., Brenner-Morton, S., Bikoff, J. B., Fang, L., Kintner, C. R., … Sweeney, L. B. (2020). Differential loss of spinal interneurons in a mouse model of ALS. Neuroscience. Elsevier. https://doi.org/10.1016/j.neuroscience.2020.08.011","ama":"Salamatina A, Yang JH, Brenner-Morton S, et al. Differential loss of spinal interneurons in a mouse model of ALS. Neuroscience. 2020;450:81-95. doi:10.1016/j.neuroscience.2020.08.011","mla":"Salamatina, Alina, et al. “Differential Loss of Spinal Interneurons in a Mouse Model of ALS.” Neuroscience, vol. 450, Elsevier, 2020, pp. 81–95, doi:10.1016/j.neuroscience.2020.08.011."}},{"date_created":"2020-12-02T10:49:30Z","license":"https://creativecommons.org/publicdomain/zero/1.0/","contributor":[{"last_name":"Aggarwal","contributor_type":"project_member","id":"b22ab905-3539-11eb-84c3-fc159dcd79cb","first_name":"Kushagra"},{"first_name":"Andrea C","contributor_type":"project_member","id":"340F461A-F248-11E8-B48F-1D18A9856A87","last_name":"Hofmann"},{"first_name":"Daniel","id":"4C473F58-F248-11E8-B48F-1D18A9856A87","contributor_type":"project_member","last_name":"Jirovec"},{"first_name":"Ivan","id":"2A307FE2-F248-11E8-B48F-1D18A9856A87","contributor_type":"project_member","last_name":"Prieto Gonzalez"},{"last_name":"Sammak","contributor_type":"project_member","first_name":"Amir"},{"last_name":"Botifoll","first_name":"Marc","contributor_type":"project_member"},{"contributor_type":"project_member","first_name":"Sara","last_name":"Marti-Sanchez"},{"first_name":"Menno","contributor_type":"project_member","last_name":"Veldhorst"},{"last_name":"Arbiol","first_name":"Jordi","contributor_type":"project_member"},{"first_name":"Giordano","contributor_type":"project_member","last_name":"Scappucci"},{"first_name":"Georgios","contributor_type":"project_leader","id":"38DB5788-F248-11E8-B48F-1D18A9856A87","last_name":"Katsaros"}],"date_published":"2020-12-02T00:00:00Z","related_material":{"record":[{"status":"public","id":"10559","relation":"used_in_publication"},{"status":"public","id":"8831","relation":"used_in_publication"}]},"doi":"10.15479/AT:ISTA:8834","year":"2020","has_accepted_license":"1","file":[{"access_level":"open_access","relation":"main_file","content_type":"application/octet-stream","checksum":"898607ac9d7cfbd5c7dd84bcb6d8a924","file_id":"8836","success":1,"creator":"gkatsaro","date_updated":"2020-12-02T10:46:21Z","file_size":898039,"date_created":"2020-12-02T10:46:21Z","file_name":"Figure1-ICvsVG.hdf5"},{"file_name":"Figure1-RNvsVG.hdf5","date_created":"2020-12-02T10:46:21Z","file_size":184971,"date_updated":"2020-12-02T10:46:21Z","creator":"gkatsaro","success":1,"checksum":"f6f5888f8425e82b4dcd5ec3db9162a6","file_id":"8837","content_type":"application/octet-stream","relation":"main_file","access_level":"open_access"},{"content_type":"application/octet-stream","relation":"main_file","access_level":"open_access","success":1,"checksum":"63a26c4b0299538610ec58c48c0ab1e3","file_id":"8838","file_size":2097740,"date_updated":"2020-12-02T10:46:22Z","creator":"gkatsaro","file_name":"Figure2-MAR.hdf5","date_created":"2020-12-02T10:46:22Z"},{"checksum":"4c6795b64b05088606ab7881f801acd7","file_id":"8839","success":1,"access_level":"open_access","relation":"main_file","content_type":"application/octet-stream","date_created":"2020-12-02T10:46:22Z","file_name":"Figure3-Fraunhofer.hdf5","creator":"gkatsaro","date_updated":"2020-12-02T10:46:22Z","file_size":911501},{"success":1,"file_id":"8840","checksum":"6b1b07e8ab0d6c1fead91032bf543818","relation":"main_file","access_level":"open_access","content_type":"application/octet-stream","file_name":"Figure3-ICvsBparallel.hdf5","date_created":"2020-12-02T10:46:22Z","creator":"gkatsaro","file_size":384239,"date_updated":"2020-12-02T10:46:22Z"},{"file_name":"Figure3-ICvsBperp.hdf5","date_created":"2020-12-02T10:46:22Z","creator":"gkatsaro","file_size":942878,"date_updated":"2020-12-02T10:46:22Z","success":1,"checksum":"d825f77f57cbf455a4ac48afeec27f5b","file_id":"8841","relation":"main_file","access_level":"open_access","content_type":"application/octet-stream"},{"date_updated":"2020-12-02T10:46:22Z","file_size":623246,"creator":"gkatsaro","date_created":"2020-12-02T10:46:22Z","file_name":"Figure4-CPR.hdf5","content_type":"application/octet-stream","access_level":"open_access","relation":"main_file","checksum":"ec81afc3697da097a224e9142322243c","file_id":"8842","success":1},{"content_type":"application/octet-stream","access_level":"open_access","relation":"main_file","checksum":"ca5860a8850a6874312c4ca1d7d41013","file_id":"8843","success":1,"date_updated":"2020-12-02T10:46:22Z","file_size":507164,"creator":"gkatsaro","date_created":"2020-12-02T10:46:22Z","file_name":"Figure4-SQUID.hdf5"},{"relation":"main_file","access_level":"open_access","content_type":"text/plain","success":1,"checksum":"770721205d081c847316d9122c94eb9b","file_id":"8844","creator":"gkatsaro","file_size":1573,"date_updated":"2020-12-02T10:46:22Z","file_name":"Readme.txt","date_created":"2020-12-02T10:46:22Z"},{"content_type":"application/octet-stream","relation":"main_file","access_level":"open_access","success":1,"file_id":"8845","checksum":"5e2e407ca631fb15b8c3cc51c5dd3bdb","file_size":842702,"date_updated":"2020-12-02T10:46:22Z","creator":"gkatsaro","file_name":"Figure S5-ICvsVG.hdf5","date_created":"2020-12-02T10:46:22Z"},{"relation":"main_file","access_level":"open_access","content_type":"application/octet-stream","success":1,"file_id":"8846","checksum":"2076e5f68264ed76c297811f449d768d","creator":"gkatsaro","file_size":208921,"date_updated":"2020-12-02T10:46:22Z","file_name":"Figure S5-RNvsVG.hdf5","date_created":"2020-12-02T10:46:22Z"},{"content_type":"application/octet-stream","relation":"main_file","access_level":"open_access","success":1,"checksum":"5dccb801d694749fe8cb496821f12f79","file_id":"8847","file_size":912249,"date_updated":"2020-12-02T10:46:22Z","creator":"gkatsaro","file_name":"Figure S8-ICvsVG.hdf5","date_created":"2020-12-02T10:46:22Z"},{"content_type":"application/octet-stream","relation":"main_file","access_level":"open_access","success":1,"checksum":"2b104aee4276e594c0d50557ead36441","file_id":"8848","file_size":230550,"date_updated":"2020-12-02T10:46:22Z","creator":"gkatsaro","file_name":"Figure S8-RNvsVG.hdf5","date_created":"2020-12-02T10:46:22Z"},{"date_updated":"2020-12-02T10:46:23Z","file_size":533581,"creator":"gkatsaro","date_created":"2020-12-02T10:46:23Z","file_name":"Figure S9-JoFET1-Fraunhofer.hdf5","content_type":"application/octet-stream","access_level":"open_access","relation":"main_file","checksum":"1645b03bdc6999d120c3fcc7012c6984","file_id":"8849","success":1},{"file_size":1394384,"date_updated":"2020-12-02T10:46:23Z","creator":"gkatsaro","file_name":"Figure S9-JoFET1-ICvsVG.hdf5","date_created":"2020-12-02T10:46:23Z","content_type":"application/octet-stream","relation":"main_file","access_level":"open_access","success":1,"file_id":"8850","checksum":"7ba623bbee93e8cb5645c4866f241d43"},{"access_level":"open_access","relation":"main_file","content_type":"application/octet-stream","file_id":"8851","checksum":"3b65ccb68cea8d3c30832fc77aa9eea3","success":1,"creator":"gkatsaro","date_updated":"2020-12-02T10:46:23Z","file_size":548051,"date_created":"2020-12-02T10:46:23Z","file_name":"Figure S9-JoFET2-Fraunhofer.hdf5"},{"content_type":"application/octet-stream","access_level":"open_access","relation":"main_file","file_id":"8852","checksum":"3d7394a7bc8ff08bcc7928262514d2b9","success":1,"date_updated":"2020-12-02T10:46:23Z","file_size":112602,"creator":"gkatsaro","date_created":"2020-12-02T10:46:23Z","file_name":"Figure S9-JoFET2-ICvsVG.hdf5"},{"relation":"main_file","access_level":"open_access","content_type":"text/plain","success":1,"checksum":"2ef8b3226a99fc65cad1162a52552848","file_id":"8853","creator":"gkatsaro","file_size":1449,"date_updated":"2020-12-02T10:46:23Z","file_name":"Readme.txt","date_created":"2020-12-02T10:46:23Z"},{"relation":"main_file","access_level":"open_access","content_type":"application/octet-stream","success":1,"checksum":"361ef6521f6b23223a34f8cf9645ee68","file_id":"8854","creator":"gkatsaro","file_size":149502,"date_updated":"2020-12-02T10:46:23Z","file_name":"dev2-jj2-ICvsVG-Tdependence_1000mK.hdf5","date_created":"2020-12-02T10:46:23Z"},{"success":1,"file_id":"8855","checksum":"f8ff5a6dd64d68d55daa79a4145bbd9c","content_type":"application/octet-stream","relation":"main_file","access_level":"open_access","file_name":"dev2-jj2-ICvsVG-Tdependence_100mK.hdf5","date_created":"2020-12-02T10:46:23Z","file_size":167055,"date_updated":"2020-12-02T10:46:23Z","creator":"gkatsaro"},{"creator":"gkatsaro","file_size":149648,"date_updated":"2020-12-02T10:46:23Z","file_name":"dev2-jj2-ICvsVG-Tdependence_1100mK.hdf5","date_created":"2020-12-02T10:46:23Z","relation":"main_file","access_level":"open_access","content_type":"application/octet-stream","success":1,"file_id":"8856","checksum":"f9309e1f1a5f727281960b01a3be64b4"},{"date_created":"2020-12-02T10:46:23Z","file_name":"dev2-jj2-ICvsVG-Tdependence_1200mK.hdf5","creator":"gkatsaro","date_updated":"2020-12-02T10:46:23Z","file_size":144688,"checksum":"e0589a34db4c5b7643c8179b0c156e48","file_id":"8857","success":1,"access_level":"open_access","relation":"main_file","content_type":"application/octet-stream"},{"checksum":"f9736851466851cca596124b1ccdbe01","file_id":"8858","success":1,"content_type":"application/octet-stream","access_level":"open_access","relation":"main_file","date_created":"2020-12-02T10:46:23Z","file_name":"dev2-jj2-ICvsVG-Tdependence_125mK.hdf5","date_updated":"2020-12-02T10:46:23Z","file_size":148611,"creator":"gkatsaro"},{"content_type":"application/octet-stream","relation":"main_file","access_level":"open_access","success":1,"checksum":"d517a4781bb242f7bfb75e7c054131e4","file_id":"8859","file_size":144702,"date_updated":"2020-12-02T10:46:23Z","creator":"gkatsaro","file_name":"dev2-jj2-ICvsVG-Tdependence_1300mK.hdf5","date_created":"2020-12-02T10:46:23Z"},{"file_id":"8860","checksum":"ce1dafef1008405b7d63b9d9018bba0d","success":1,"content_type":"application/octet-stream","access_level":"open_access","relation":"main_file","date_created":"2020-12-02T10:46:23Z","file_name":"dev2-jj2-ICvsVG-Tdependence_1400mK.hdf5","date_updated":"2020-12-02T10:46:23Z","file_size":150639,"creator":"gkatsaro"},{"file_name":"dev2-jj2-ICvsVG-Tdependence_1500mK.hdf5","date_created":"2020-12-02T10:46:23Z","creator":"gkatsaro","file_size":150819,"date_updated":"2020-12-02T10:46:23Z","success":1,"checksum":"0a13039fdb83caee41437685fe73d2b4","file_id":"8861","relation":"main_file","access_level":"open_access","content_type":"application/octet-stream"},{"success":1,"file_id":"8862","checksum":"6e543bc92d4dd4b9b2fcfd7992bfa101","content_type":"application/octet-stream","relation":"main_file","access_level":"open_access","file_name":"dev2-jj2-ICvsVG-Tdependence_150mK.hdf5","date_created":"2020-12-02T10:46:24Z","file_size":148362,"date_updated":"2020-12-02T10:46:24Z","creator":"gkatsaro"},{"creator":"gkatsaro","file_size":150766,"date_updated":"2020-12-02T10:46:24Z","file_name":"dev2-jj2-ICvsVG-Tdependence_1600mK.hdf5","date_created":"2020-12-02T10:46:24Z","relation":"main_file","access_level":"open_access","content_type":"application/octet-stream","success":1,"file_id":"8863","checksum":"91cfcef1edfbb5c7bed3dde4b2cee5b8"},{"relation":"main_file","access_level":"open_access","content_type":"application/octet-stream","success":1,"checksum":"528fa8c3128e0d79de599ba0bc715665","file_id":"8864","creator":"gkatsaro","file_size":169554,"date_updated":"2020-12-02T10:46:24Z","file_name":"dev2-jj2-ICvsVG-Tdependence_1700mK.hdf5","date_created":"2020-12-02T10:46:24Z"},{"creator":"gkatsaro","date_updated":"2020-12-02T10:46:24Z","file_size":148548,"date_created":"2020-12-02T10:46:24Z","file_name":"dev2-jj2-ICvsVG-Tdependence_175mK.hdf5","access_level":"open_access","relation":"main_file","content_type":"application/octet-stream","checksum":"9e35c7f20c0b162e205bfa520dc4535d","file_id":"8865","success":1},{"date_created":"2020-12-02T10:46:24Z","file_name":"dev2-jj2-ICvsVG-Tdependence_1800mK.hdf5","creator":"gkatsaro","date_updated":"2020-12-02T10:46:24Z","file_size":147386,"file_id":"8866","checksum":"1fb5a8b651447a7204ae31883a1da269","success":1,"access_level":"open_access","relation":"main_file","content_type":"application/octet-stream"},{"file_name":"dev2-jj2-ICvsVG-Tdependence_1900mK.hdf5","date_created":"2020-12-02T10:46:24Z","file_size":147265,"date_updated":"2020-12-02T10:46:24Z","creator":"gkatsaro","success":1,"checksum":"0d3ee65697bceaae15fbcd5d5a8480c1","file_id":"8867","content_type":"application/octet-stream","relation":"main_file","access_level":"open_access"},{"success":1,"file_id":"8868","checksum":"fc386694414fee55a21adbc21c5c9b35","content_type":"application/octet-stream","relation":"main_file","access_level":"open_access","file_name":"dev2-jj2-ICvsVG-Tdependence_2000mK.hdf5","date_created":"2020-12-02T10:46:24Z","file_size":147371,"date_updated":"2020-12-02T10:46:24Z","creator":"gkatsaro"},{"success":1,"file_id":"8869","checksum":"de7c4a302b9fbad6dbcd7dd76af9f585","relation":"main_file","access_level":"open_access","content_type":"application/octet-stream","file_name":"dev2-jj2-ICvsVG-Tdependence_200mK.hdf5","date_created":"2020-12-02T10:46:24Z","creator":"gkatsaro","file_size":148576,"date_updated":"2020-12-02T10:46:24Z"},{"file_size":183004,"date_updated":"2020-12-02T10:46:24Z","creator":"gkatsaro","file_name":"dev2-jj2-ICvsVG-Tdependence_20mK.hdf5","date_created":"2020-12-02T10:46:24Z","content_type":"application/octet-stream","relation":"main_file","access_level":"open_access","success":1,"file_id":"8870","checksum":"3f31eb2fb17cdaa70f4f3de2f1c6a563"},{"creator":"gkatsaro","file_size":131582,"date_updated":"2020-12-02T10:46:24Z","file_name":"dev2-jj2-ICvsVG-Tdependence_2100mK.hdf5","date_created":"2020-12-02T10:46:24Z","relation":"main_file","access_level":"open_access","content_type":"application/octet-stream","success":1,"checksum":"9044e65b660b5a90931ddcc0d4da7baa","file_id":"8871"},{"file_name":"dev2-jj2-ICvsVG-Tdependence_2200mK.hdf5","date_created":"2020-12-02T10:46:24Z","file_size":131645,"date_updated":"2020-12-02T10:46:24Z","creator":"gkatsaro","success":1,"file_id":"8872","checksum":"a4d0644bed0076a5c3a9b10dadac217a","content_type":"application/octet-stream","relation":"main_file","access_level":"open_access"},{"file_name":"dev2-jj2-ICvsVG-Tdependence_225mK.hdf5","date_created":"2020-12-02T10:46:24Z","file_size":144366,"date_updated":"2020-12-02T10:46:24Z","creator":"gkatsaro","success":1,"file_id":"8873","checksum":"7177bd4d5bd80655b513168ebdf4a0c6","content_type":"application/octet-stream","relation":"main_file","access_level":"open_access"},{"content_type":"application/octet-stream","relation":"main_file","access_level":"open_access","success":1,"file_id":"8874","checksum":"62e51c2cabcb586af21222e60eb8910e","file_size":148466,"date_updated":"2020-12-02T10:46:24Z","creator":"gkatsaro","file_name":"dev2-jj2-ICvsVG-Tdependence_2300mK.hdf5","date_created":"2020-12-02T10:46:24Z"},{"date_created":"2020-12-02T10:46:25Z","file_name":"dev2-jj2-ICvsVG-Tdependence_2400mK.hdf5","creator":"gkatsaro","date_updated":"2020-12-02T10:46:25Z","file_size":160774,"checksum":"67f943fbaae90d117f0f82c3a29e6ccc","file_id":"8875","success":1,"access_level":"open_access","relation":"main_file","content_type":"application/octet-stream"},{"file_size":150110,"date_updated":"2020-12-02T10:46:25Z","creator":"gkatsaro","file_name":"dev2-jj2-ICvsVG-Tdependence_2500mK.hdf5","date_created":"2020-12-02T10:46:25Z","content_type":"application/octet-stream","relation":"main_file","access_level":"open_access","success":1,"checksum":"c6b33f7c61ba57178fa613c58131fd3d","file_id":"8876"},{"success":1,"checksum":"be127426947b8778cfae29a7ad2013f1","file_id":"8877","content_type":"application/octet-stream","relation":"main_file","access_level":"open_access","file_name":"dev2-jj2-ICvsVG-Tdependence_250mK.hdf5","date_created":"2020-12-02T10:46:25Z","file_size":144419,"date_updated":"2020-12-02T10:46:25Z","creator":"gkatsaro"},{"success":1,"checksum":"81dfeb4d94c1efec10b623e94d13faa5","file_id":"8878","content_type":"application/octet-stream","relation":"main_file","access_level":"open_access","file_name":"dev2-jj2-ICvsVG-Tdependence_2600mK.hdf5","date_created":"2020-12-02T10:46:25Z","file_size":148905,"date_updated":"2020-12-02T10:46:25Z","creator":"gkatsaro"},{"success":1,"file_id":"8879","checksum":"5c0a37e0de317c7d8df62075ff35f1ec","content_type":"application/octet-stream","relation":"main_file","access_level":"open_access","file_name":"dev2-jj2-ICvsVG-Tdependence_2700mK.hdf5","date_created":"2020-12-02T10:46:25Z","file_size":131966,"date_updated":"2020-12-02T10:46:25Z","creator":"gkatsaro"},{"date_created":"2020-12-02T10:46:25Z","file_name":"dev2-jj2-ICvsVG-Tdependence_275mK.hdf5","creator":"gkatsaro","date_updated":"2020-12-02T10:46:25Z","file_size":144253,"checksum":"0f25d03f2551cbd903c7522883510492","file_id":"8880","success":1,"access_level":"open_access","relation":"main_file","content_type":"application/octet-stream"},{"file_name":"dev2-jj2-ICvsVG-Tdependence_2800mK.hdf5","date_created":"2020-12-02T10:46:25Z","file_size":131997,"date_updated":"2020-12-02T10:46:25Z","creator":"gkatsaro","success":1,"checksum":"93923640d8bb599f6a459d2fda915b8b","file_id":"8881","content_type":"application/octet-stream","relation":"main_file","access_level":"open_access"},{"creator":"gkatsaro","file_size":131950,"date_updated":"2020-12-02T10:46:25Z","file_name":"dev2-jj2-ICvsVG-Tdependence_2900mK.hdf5","date_created":"2020-12-02T10:46:25Z","relation":"main_file","access_level":"open_access","content_type":"application/octet-stream","success":1,"checksum":"c4fcf44e88ed344f4b747a67cae4e147","file_id":"8882"},{"date_updated":"2020-12-02T10:46:25Z","file_size":150616,"creator":"gkatsaro","date_created":"2020-12-02T10:46:25Z","file_name":"dev2-jj2-ICvsVG-Tdependence_3000mK.hdf5","content_type":"application/octet-stream","access_level":"open_access","relation":"main_file","file_id":"8883","checksum":"5c1b296c6e654b16f610516b4a2fae30","success":1},{"file_name":"dev2-jj2-ICvsVG-Tdependence_300mK.hdf5","date_created":"2020-12-02T10:46:25Z","file_size":144570,"date_updated":"2020-12-02T10:46:25Z","creator":"gkatsaro","success":1,"checksum":"5d1a2735216b1d6abf4c2645ebe0164e","file_id":"8884","content_type":"application/octet-stream","relation":"main_file","access_level":"open_access"},{"file_id":"8885","checksum":"50dd9572cee3262ab4d64573289f9832","success":1,"content_type":"application/octet-stream","access_level":"open_access","relation":"main_file","date_created":"2020-12-02T10:46:25Z","file_name":"dev2-jj2-ICvsVG-Tdependence_3100mK.hdf5","date_updated":"2020-12-02T10:46:25Z","file_size":150709,"creator":"gkatsaro"},{"creator":"gkatsaro","date_updated":"2020-12-02T10:46:25Z","file_size":131954,"date_created":"2020-12-02T10:46:25Z","file_name":"dev2-jj2-ICvsVG-Tdependence_3200mK.hdf5","access_level":"open_access","relation":"main_file","content_type":"application/octet-stream","checksum":"f528a1daeaddef5deef914798f5569ec","file_id":"8886","success":1},{"relation":"main_file","access_level":"open_access","content_type":"application/octet-stream","success":1,"file_id":"8887","checksum":"c2f53134c6877f200bdf4e5638e5c6d3","creator":"gkatsaro","file_size":144197,"date_updated":"2020-12-02T10:46:25Z","file_name":"dev2-jj2-ICvsVG-Tdependence_325mK.hdf5","date_created":"2020-12-02T10:46:25Z"},{"date_created":"2020-12-02T10:46:25Z","file_name":"dev2-jj2-ICvsVG-Tdependence_360mK.hdf5","date_updated":"2020-12-02T10:46:25Z","file_size":144729,"creator":"gkatsaro","file_id":"8888","checksum":"10dd70f340df3bbe0cfe8cc9e6427d50","success":1,"content_type":"application/octet-stream","access_level":"open_access","relation":"main_file"},{"date_updated":"2020-12-02T10:46:26Z","file_size":144502,"creator":"gkatsaro","date_created":"2020-12-02T10:46:26Z","file_name":"dev2-jj2-ICvsVG-Tdependence_400mK.hdf5","content_type":"application/octet-stream","access_level":"open_access","relation":"main_file","file_id":"8889","checksum":"6da19e1e3ff6f254ce859a2c6952fd3a","success":1},{"date_created":"2020-12-02T10:46:26Z","file_name":"dev2-jj2-ICvsVG-Tdependence_430mK.hdf5","date_updated":"2020-12-02T10:46:26Z","file_size":144280,"creator":"gkatsaro","checksum":"49b78d23ef1538e1ecfc51dcfcf423d4","file_id":"8890","success":1,"content_type":"application/octet-stream","access_level":"open_access","relation":"main_file"},{"content_type":"application/octet-stream","relation":"main_file","access_level":"open_access","success":1,"checksum":"065610415e2386a6e571fce3f14a2fc4","file_id":"8891","file_size":173158,"date_updated":"2020-12-02T10:46:26Z","creator":"gkatsaro","file_name":"dev2-jj2-ICvsVG-Tdependence_45mK.hdf5","date_created":"2020-12-02T10:46:26Z"},{"success":1,"checksum":"06a83873a1e72377728c080fb8db15fd","file_id":"8892","content_type":"application/octet-stream","relation":"main_file","access_level":"open_access","file_name":"dev2-jj2-ICvsVG-Tdependence_460mK.hdf5","date_created":"2020-12-02T10:46:26Z","file_size":144447,"date_updated":"2020-12-02T10:46:26Z","creator":"gkatsaro"},{"checksum":"c4391fda28b9a44e44f2d039ec8651b7","file_id":"8893","success":1,"access_level":"open_access","relation":"main_file","content_type":"application/octet-stream","date_created":"2020-12-02T10:46:26Z","file_name":"dev2-jj2-ICvsVG-Tdependence_500mK.hdf5","creator":"gkatsaro","date_updated":"2020-12-02T10:46:26Z","file_size":144800},{"creator":"gkatsaro","file_size":144594,"date_updated":"2020-12-02T10:46:26Z","file_name":"dev2-jj2-ICvsVG-Tdependence_530mK.hdf5","date_created":"2020-12-02T10:46:26Z","relation":"main_file","access_level":"open_access","content_type":"application/octet-stream","success":1,"file_id":"8894","checksum":"e9d2ffde84357e8e0be5581408da9b8a"},{"access_level":"open_access","relation":"main_file","content_type":"application/octet-stream","checksum":"d2966be14e8877ca27bf5daff23d76d6","file_id":"8895","success":1,"creator":"gkatsaro","date_updated":"2020-12-02T10:46:26Z","file_size":144681,"date_created":"2020-12-02T10:46:26Z","file_name":"dev2-jj2-ICvsVG-Tdependence_560mK.hdf5"},{"relation":"main_file","access_level":"open_access","content_type":"application/octet-stream","success":1,"file_id":"8896","checksum":"75cc9b9a2991b356471ca956076cc376","creator":"gkatsaro","file_size":144909,"date_updated":"2020-12-02T10:46:26Z","file_name":"dev2-jj2-ICvsVG-Tdependence_600mK.hdf5","date_created":"2020-12-02T10:46:26Z"},{"creator":"gkatsaro","file_size":144985,"date_updated":"2020-12-02T10:46:26Z","file_name":"dev2-jj2-ICvsVG-Tdependence_630mK.hdf5","date_created":"2020-12-02T10:46:26Z","relation":"main_file","access_level":"open_access","content_type":"application/octet-stream","success":1,"checksum":"9144cff758563b93f22c7946146fa5d5","file_id":"8897"},{"file_size":144782,"date_updated":"2020-12-02T10:46:26Z","creator":"gkatsaro","file_name":"dev2-jj2-ICvsVG-Tdependence_660mK.hdf5","date_created":"2020-12-02T10:46:26Z","content_type":"application/octet-stream","relation":"main_file","access_level":"open_access","success":1,"checksum":"14509a2dd1bf74d9c6fc05c046e5b6ff","file_id":"8898"},{"date_updated":"2020-12-02T10:46:26Z","file_size":145046,"creator":"gkatsaro","date_created":"2020-12-02T10:46:26Z","file_name":"dev2-jj2-ICvsVG-Tdependence_700mK.hdf5","content_type":"application/octet-stream","access_level":"open_access","relation":"main_file","file_id":"8899","checksum":"9c38e2178f0fda99a02e6d7b2c034082","success":1},{"file_name":"dev2-jj2-ICvsVG-Tdependence_730mK.hdf5","date_created":"2020-12-02T10:46:26Z","file_size":145107,"date_updated":"2020-12-02T10:46:26Z","creator":"gkatsaro","success":1,"checksum":"962a205f7ff515b9aad2df28cc5a95e7","file_id":"8900","content_type":"application/octet-stream","relation":"main_file","access_level":"open_access"},{"file_id":"8901","checksum":"5e24b1a7840e6a2b3b04bf922b521ec4","success":1,"content_type":"application/octet-stream","access_level":"open_access","relation":"main_file","date_created":"2020-12-02T10:46:26Z","file_name":"dev2-jj2-ICvsVG-Tdependence_760mK.hdf5","date_updated":"2020-12-02T10:46:26Z","file_size":145018,"creator":"gkatsaro"},{"file_id":"8902","checksum":"dfbefc2d53df7afd1e534ced7d669b30","success":1,"content_type":"application/octet-stream","access_level":"open_access","relation":"main_file","date_created":"2020-12-02T10:46:27Z","file_name":"dev2-jj2-ICvsVG-Tdependence_800mK.hdf5","date_updated":"2020-12-02T10:46:27Z","file_size":145318,"creator":"gkatsaro"},{"success":1,"checksum":"1629ae97d2748bbf02fdb2d165d236e5","file_id":"8903","relation":"main_file","access_level":"open_access","content_type":"application/octet-stream","file_name":"dev2-jj2-ICvsVG-Tdependence_830mK.hdf5","date_created":"2020-12-02T10:46:27Z","creator":"gkatsaro","file_size":145322,"date_updated":"2020-12-02T10:46:27Z"},{"content_type":"application/octet-stream","relation":"main_file","access_level":"open_access","success":1,"checksum":"618f507780343c6b9145c40d3d5b0ff0","file_id":"8904","file_size":145282,"date_updated":"2020-12-02T10:46:27Z","creator":"gkatsaro","file_name":"dev2-jj2-ICvsVG-Tdependence_850mK.hdf5","date_created":"2020-12-02T10:46:27Z"},{"checksum":"7547c3607280c7eedca3168854976cc9","file_id":"8905","success":1,"content_type":"application/octet-stream","access_level":"open_access","relation":"main_file","date_created":"2020-12-02T10:46:27Z","file_name":"dev2-jj2-ICvsVG-Tdependence_900mK.hdf5","date_updated":"2020-12-02T10:46:27Z","file_size":143681,"creator":"gkatsaro"},{"date_created":"2020-12-02T10:46:27Z","file_name":"dev2-jj2-ICvsVG-Tdependence_90mK.hdf5","creator":"gkatsaro","date_updated":"2020-12-02T10:46:27Z","file_size":167184,"checksum":"514d9a43ed3888ce7d8b26ca772cadc3","file_id":"8906","success":1,"access_level":"open_access","relation":"main_file","content_type":"application/octet-stream"},{"success":1,"checksum":"77285471178fa68c1eade48761b2aba5","file_id":"8907","content_type":"application/octet-stream","relation":"main_file","access_level":"open_access","file_name":"dev2-jj2-ICvsVG-Tdependence_930mK.hdf5","date_created":"2020-12-02T10:46:27Z","file_size":143491,"date_updated":"2020-12-02T10:46:27Z","creator":"gkatsaro"},{"file_name":"dev2-jj2-ICvsVG-Tdependence_965mK.hdf5","date_created":"2020-12-02T10:46:27Z","creator":"gkatsaro","file_size":144057,"date_updated":"2020-12-02T10:46:27Z","success":1,"checksum":"bf8da09fcfa20196fb7e65528a581297","file_id":"8908","relation":"main_file","access_level":"open_access","content_type":"application/octet-stream"}],"day":"02","oa":1,"publisher":"Institute of Science and Technology Austria","month":"12","abstract":[{"lang":"eng","text":"This data collection contains the transport data for figures presented in the supplementary material of \"Enhancement of Proximity Induced Superconductivity in Planar Germanium\" by K. Aggarwal, et. al. \r\nThe measurements were done using Labber Software and the data is stored in the hdf5 file format. The files can be opened using either the Labber Log Browser (https://labber.org/overview/) or Labber Python API (http://labber.org/online-doc/api/LogFile.html).\r\n"}],"oa_version":"Published Version","article_processing_charge":"No","author":[{"first_name":"Georgios","id":"38DB5788-F248-11E8-B48F-1D18A9856A87","last_name":"Katsaros","orcid":"0000-0001-8342-202X","full_name":"Katsaros, Georgios"}],"file_date_updated":"2020-12-02T10:46:27Z","title":"Enhancement of proximity induced superconductivity in planar Germanium","department":[{"_id":"GeKa"}],"citation":{"apa":"Katsaros, G. (2020). Enhancement of proximity induced superconductivity in planar Germanium. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:8834","ama":"Katsaros G. Enhancement of proximity induced superconductivity in planar Germanium. 2020. doi:10.15479/AT:ISTA:8834","short":"G. Katsaros, (2020).","ieee":"G. Katsaros, “Enhancement of proximity induced superconductivity in planar Germanium.” Institute of Science and Technology Austria, 2020.","mla":"Katsaros, Georgios. Enhancement of Proximity Induced Superconductivity in Planar Germanium. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:8834.","ista":"Katsaros G. 2020. Enhancement of proximity induced superconductivity in planar Germanium, Institute of Science and Technology Austria, 10.15479/AT:ISTA:8834.","chicago":"Katsaros, Georgios. “Enhancement of Proximity Induced Superconductivity in Planar Germanium.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:8834."},"date_updated":"2024-02-21T12:41:26Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["530"],"tmp":{"image":"/images/cc_0.png","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","name":"Creative Commons Public Domain Dedication (CC0 1.0)","short":"CC0 (1.0)"},"type":"research_data","status":"public","_id":"8834"},{"status":"public","keyword":["Escherichia coli","antibiotic combinations","translation","growth laws","drug interactions","bacterial physiology","translation inhibitors"],"type":"research_data","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)"},"_id":"8097","file_date_updated":"2020-07-14T12:48:09Z","title":"Analysis scripts and research data for the paper \"Mechanisms of drug interactions between translation-inhibiting antibiotics\"","department":[{"_id":"GaTk"}],"author":[{"first_name":"Bor","id":"350F91D2-F248-11E8-B48F-1D18A9856A87","last_name":"Kavcic","full_name":"Kavcic, Bor","orcid":"0000-0001-6041-254X"}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2024-02-21T12:40:51Z","citation":{"ista":"Kavcic B. 2020. Analysis scripts and research data for the paper ‘Mechanisms of drug interactions between translation-inhibiting antibiotics’, Institute of Science and Technology Austria, 10.15479/AT:ISTA:8097.","chicago":"Kavcic, Bor. “Analysis Scripts and Research Data for the Paper ‘Mechanisms of Drug Interactions between Translation-Inhibiting Antibiotics.’” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:8097.","short":"B. Kavcic, (2020).","ieee":"B. Kavcic, “Analysis scripts and research data for the paper ‘Mechanisms of drug interactions between translation-inhibiting antibiotics.’” Institute of Science and Technology Austria, 2020.","apa":"Kavcic, B. (2020). Analysis scripts and research data for the paper “Mechanisms of drug interactions between translation-inhibiting antibiotics.” Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:8097","ama":"Kavcic B. Analysis scripts and research data for the paper “Mechanisms of drug interactions between translation-inhibiting antibiotics.” 2020. doi:10.15479/AT:ISTA:8097","mla":"Kavcic, Bor. Analysis Scripts and Research Data for the Paper “Mechanisms of Drug Interactions between Translation-Inhibiting Antibiotics.” Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:8097."},"month":"07","publisher":"Institute of Science and Technology Austria","oa":1,"oa_version":"Published Version","abstract":[{"text":"Antibiotics that interfere with translation, when combined, interact in diverse and difficult-to-predict ways. Here, we explain these interactions by \"translation bottlenecks\": points in the translation cycle where antibiotics block ribosomal progression. To elucidate the underlying mechanisms of drug interactions between translation inhibitors, we generate translation bottlenecks genetically using inducible control of translation factors that regulate well-defined translation cycle steps. These perturbations accurately mimic antibiotic action and drug interactions, supporting that the interplay of different translation bottlenecks causes these interactions. We further show that growth laws, combined with drug uptake and binding kinetics, enable the direct prediction of a large fraction of observed interactions, yet fail to predict suppression. However, varying two translation bottlenecks simultaneously supports that dense traffic of ribosomes and competition for translation factors account for the previously unexplained suppression. These results highlight the importance of \"continuous epistasis\" in bacterial physiology.","lang":"eng"}],"acknowledged_ssus":[{"_id":"LifeSc"}],"date_published":"2020-07-15T00:00:00Z","doi":"10.15479/AT:ISTA:8097","contributor":[{"contributor_type":"research_group","first_name":"Gašper","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","last_name":"Tkačik","orcid":"0000-0002-6699-1455"},{"last_name":"Bollenbach","id":"3E6DB97A-F248-11E8-B48F-1D18A9856A87","contributor_type":"research_group","first_name":"Tobias"}],"date_created":"2020-07-06T20:40:19Z","file":[{"file_id":"8098","checksum":"5c321dbbb6d4b3c85da786fd3ebbdc98","relation":"main_file","access_level":"open_access","content_type":"application/zip","file_name":"natComm_2020_scripts.zip","date_created":"2020-07-06T20:38:27Z","creator":"bkavcic","file_size":255770756,"date_updated":"2020-07-14T12:48:09Z"}],"day":"15","has_accepted_license":"1","year":"2020"},{"citation":{"ista":"Arathoon LS. 2020. Estimating inbreeding and its effects in a long-term study of snapdragons (Antirrhinum majus), Institute of Science and Technology Austria, 10.15479/AT:ISTA:8254.","chicago":"Arathoon, Louise S. “Estimating Inbreeding and Its Effects in a Long-Term Study of Snapdragons (Antirrhinum Majus).” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:8254.","ama":"Arathoon LS. Estimating inbreeding and its effects in a long-term study of snapdragons (Antirrhinum majus). 2020. doi:10.15479/AT:ISTA:8254","apa":"Arathoon, L. S. (2020). Estimating inbreeding and its effects in a long-term study of snapdragons (Antirrhinum majus). Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:8254","short":"L.S. Arathoon, (2020).","ieee":"L. S. Arathoon, “Estimating inbreeding and its effects in a long-term study of snapdragons (Antirrhinum majus).” Institute of Science and Technology Austria, 2020.","mla":"Arathoon, Louise S. Estimating Inbreeding and Its Effects in a Long-Term Study of Snapdragons (Antirrhinum Majus). Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:8254."},"date_updated":"2024-02-21T12:41:09Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["576"],"article_processing_charge":"No","author":[{"full_name":"Arathoon, Louise S","orcid":"0000-0003-1771-714X","last_name":"Arathoon","id":"2CFCFF98-F248-11E8-B48F-1D18A9856A87","first_name":"Louise S"}],"title":"Estimating inbreeding and its effects in a long-term study of snapdragons (Antirrhinum majus)","department":[{"_id":"NiBa"}],"file_date_updated":"2020-08-18T08:03:23Z","_id":"8254","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":"research_data","status":"public","year":"2020","has_accepted_license":"1","day":"18","file":[{"creator":"dernst","file_size":5778420,"date_updated":"2020-08-18T08:03:23Z","file_name":"Data_Rcode_MathematicaNB.zip","date_created":"2020-08-18T08:03:23Z","relation":"main_file","access_level":"open_access","content_type":"application/x-zip-compressed","success":1,"checksum":"4f1382ed4384751b6013398c11557bf6","file_id":"8280"}],"date_created":"2020-08-12T12:49:23Z","contributor":[{"contributor_type":"data_collector","first_name":"Louise S","id":"2CFCFF98-F248-11E8-B48F-1D18A9856A87","last_name":"Arathoon"},{"id":"455235B8-F248-11E8-B48F-1D18A9856A87","contributor_type":"project_member","first_name":"Parvathy","last_name":"Surendranadh"},{"last_name":"Barton","orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","contributor_type":"project_member","first_name":"Nicholas H"},{"first_name":"David","contributor_type":"project_member","id":"419049E2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4014-8478","last_name":"Field"},{"contributor_type":"project_member","id":"2C78037E-F248-11E8-B48F-1D18A9856A87","first_name":"Melinda","last_name":"Pickup","orcid":"0000-0001-6118-0541"},{"contributor_type":"project_member","first_name":"Carina","id":"3B4A7CE2-F248-11E8-B48F-1D18A9856A87","last_name":"Baskett"}],"doi":"10.15479/AT:ISTA:8254","date_published":"2020-08-18T00:00:00Z","related_material":{"record":[{"status":"public","id":"11321","relation":"later_version"},{"id":"9192","status":"public","relation":"later_version"}]},"abstract":[{"text":"Here are the research data underlying the publication \"Estimating inbreeding and its effects in a long-term study of snapdragons (Antirrhinum majus)\". Further information are summed up in the README document.\r\nThe files for this record have been updated and are now found in the linked DOI https://doi.org/10.15479/AT:ISTA:9192.","lang":"eng"}],"oa_version":"Published Version","oa":1,"publisher":"Institute of Science and Technology Austria","month":"08"},{"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"ieee":"F. Gao et al., “Site-controlled uniform Ge/Si hut wires with electrically tunable spin-orbit coupling,” Advanced Materials, vol. 32, no. 16. Wiley, 2020.","short":"F. Gao, J.-H. Wang, H. Watzinger, H. Hu, M.J. Rančić, J.-Y. Zhang, T. Wang, Y. Yao, G.-L. Wang, J. Kukucka, L. Vukušić, C. Kloeffel, D. Loss, F. Liu, G. Katsaros, J.-J. Zhang, Advanced Materials 32 (2020).","apa":"Gao, F., Wang, J.-H., Watzinger, H., Hu, H., Rančić, M. J., Zhang, J.-Y., … Zhang, J.-J. (2020). Site-controlled uniform Ge/Si hut wires with electrically tunable spin-orbit coupling. Advanced Materials. Wiley. https://doi.org/10.1002/adma.201906523","ama":"Gao F, Wang J-H, Watzinger H, et al. Site-controlled uniform Ge/Si hut wires with electrically tunable spin-orbit coupling. Advanced Materials. 2020;32(16). doi:10.1002/adma.201906523","mla":"Gao, Fei, et al. “Site-Controlled Uniform Ge/Si Hut Wires with Electrically Tunable Spin-Orbit Coupling.” Advanced Materials, vol. 32, no. 16, 1906523, Wiley, 2020, doi:10.1002/adma.201906523.","ista":"Gao F, Wang J-H, Watzinger H, Hu H, Rančić MJ, Zhang J-Y, Wang T, Yao Y, Wang G-L, Kukucka J, Vukušić L, Kloeffel C, Loss D, Liu F, Katsaros G, Zhang J-J. 2020. Site-controlled uniform Ge/Si hut wires with electrically tunable spin-orbit coupling. Advanced Materials. 32(16), 1906523.","chicago":"Gao, Fei, Jian-Huan Wang, Hannes Watzinger, Hao Hu, Marko J. Rančić, Jie-Yin Zhang, Ting Wang, et al. “Site-Controlled Uniform Ge/Si Hut Wires with Electrically Tunable Spin-Orbit Coupling.” Advanced Materials. Wiley, 2020. https://doi.org/10.1002/adma.201906523."},"title":"Site-controlled uniform Ge/Si hut wires with electrically tunable spin-orbit coupling","author":[{"first_name":"Fei","last_name":"Gao","full_name":"Gao, Fei"},{"first_name":"Jian-Huan","full_name":"Wang, Jian-Huan","last_name":"Wang"},{"last_name":"Watzinger","full_name":"Watzinger, Hannes","id":"35DF8E50-F248-11E8-B48F-1D18A9856A87","first_name":"Hannes"},{"last_name":"Hu","full_name":"Hu, Hao","first_name":"Hao"},{"full_name":"Rančić, Marko J.","last_name":"Rančić","first_name":"Marko J."},{"full_name":"Zhang, Jie-Yin","last_name":"Zhang","first_name":"Jie-Yin"},{"first_name":"Ting","last_name":"Wang","full_name":"Wang, Ting"},{"full_name":"Yao, Yuan","last_name":"Yao","first_name":"Yuan"},{"last_name":"Wang","full_name":"Wang, Gui-Lei","first_name":"Gui-Lei"},{"first_name":"Josip","id":"3F5D8856-F248-11E8-B48F-1D18A9856A87","full_name":"Kukucka, Josip","last_name":"Kukucka"},{"id":"31E9F056-F248-11E8-B48F-1D18A9856A87","first_name":"Lada","last_name":"Vukušić","orcid":"0000-0003-2424-8636","full_name":"Vukušić, Lada"},{"full_name":"Kloeffel, Christoph","last_name":"Kloeffel","first_name":"Christoph"},{"first_name":"Daniel","last_name":"Loss","full_name":"Loss, Daniel"},{"first_name":"Feng","full_name":"Liu, Feng","last_name":"Liu"},{"last_name":"Katsaros","full_name":"Katsaros, Georgios","orcid":"0000-0001-8342-202X","first_name":"Georgios","id":"38DB5788-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Zhang","full_name":"Zhang, Jian-Jun","first_name":"Jian-Jun"}],"article_processing_charge":"Yes (via OA deal)","external_id":{"isi":["000516660900001"]},"article_number":"1906523","project":[{"name":"Towards Spin qubits and Majorana fermions in Germanium selfassembled hut-wires","grant_number":"335497","call_identifier":"FP7","_id":"25517E86-B435-11E9-9278-68D0E5697425"},{"grant_number":"P32235","name":"Towards scalable hut wire quantum devices","_id":"237B3DA4-32DE-11EA-91FC-C7463DDC885E","call_identifier":"FWF"},{"name":"TOPOLOGICALLY PROTECTED AND SCALABLE QUANTUM BITS","grant_number":"862046","_id":"237E5020-32DE-11EA-91FC-C7463DDC885E","call_identifier":"H2020"}],"day":"23","publication":"Advanced Materials","isi":1,"has_accepted_license":"1","year":"2020","doi":"10.1002/adma.201906523","date_published":"2020-04-23T00:00:00Z","date_created":"2020-02-28T09:47:00Z","acknowledgement":"This work was supported by the National Key R&D Program of China (Grant Nos. 2016YFA0301701 and 2016YFA0300600), the NSFC (Grant Nos. 11574356, 11434010, and 11404252), the Strategic Priority Research Program of CAS (Grant No. XDB30000000), the ERC Starting Grant No. 335497, the FWF P32235 project, and the European Union's Horizon 2020 research and innovation program under Grant Agreement #862046. This research was supported by the Scientific Service Units of IST Austria through resources provided by the MIBA Machine Shop and the nanofabrication facility. F.L. thanks support from DOE (Grant No. DE‐FG02‐04ER46148). H.H. thanks the Startup Funding from Xi'an Jiaotong University.","publisher":"Wiley","quality_controlled":"1","oa":1,"ddc":["530"],"date_updated":"2024-02-21T12:42:12Z","department":[{"_id":"GeKa"}],"file_date_updated":"2020-11-20T10:11:35Z","_id":"7541","status":"public","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)"},"file":[{"success":1,"checksum":"c622737dc295972065782558337124a2","file_id":"8782","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"2020_AdvancedMaterials_Gao.pdf","date_created":"2020-11-20T10:11:35Z","creator":"dernst","file_size":5242880,"date_updated":"2020-11-20T10:11:35Z"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["0935-9648"]},"publication_status":"published","volume":32,"issue":"16","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"7996"},{"relation":"research_data","status":"public","id":"9222"}]},"ec_funded":1,"oa_version":"Published Version","acknowledged_ssus":[{"_id":"NanoFab"},{"_id":"M-Shop"}],"abstract":[{"lang":"eng","text":"Semiconductor nanowires have been playing a crucial role in the development of nanoscale devices for the realization of spin qubits, Majorana fermions, single photon emitters, nanoprocessors, etc. The monolithic growth of site‐controlled nanowires is a prerequisite toward the next generation of devices that will require addressability and scalability. Here, combining top‐down nanofabrication and bottom‐up self‐assembly, the growth of Ge wires on prepatterned Si (001) substrates with controllable position, distance, length, and structure is reported. This is achieved by a novel growth process that uses a SiGe strain‐relaxation template and can be potentially generalized to other material combinations. Transport measurements show an electrically tunable spin–orbit coupling, with a spin–orbit length similar to that of III–V materials. Also, charge sensing between quantum dots in closely spaced wires is observed, which underlines their potential for the realization of advanced quantum devices. The reported results open a path toward scalable qubit devices using nanowires on silicon."}],"month":"04","intvolume":" 32","scopus_import":"1"}]