[{"date_created":"2019-08-04T21:59:20Z","ddc":["000"],"day":"06","status":"public","volume":807,"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"1341"}]},"isi":1,"oa_version":"Submitted Version","doi":"10.1016/j.tcs.2019.06.031","publication":"Theoretical Computer Science","date_updated":"2023-08-17T13:52:49Z","oa":1,"month":"02","intvolume":" 807","date_published":"2020-02-06T00:00:00Z","year":"2020","page":"42-55","external_id":{"isi":["000512219400004"]},"_id":"6761","quality_controlled":"1","citation":{"chicago":"Avni, Guy, Thomas A Henzinger, and Orna Kupferman. “Dynamic Resource Allocation Games.” Theoretical Computer Science. Elsevier, 2020. https://doi.org/10.1016/j.tcs.2019.06.031.","ama":"Avni G, Henzinger TA, Kupferman O. Dynamic resource allocation games. Theoretical Computer Science. 2020;807:42-55. doi:10.1016/j.tcs.2019.06.031","short":"G. Avni, T.A. Henzinger, O. Kupferman, Theoretical Computer Science 807 (2020) 42–55.","ista":"Avni G, Henzinger TA, Kupferman O. 2020. Dynamic resource allocation games. Theoretical Computer Science. 807, 42–55.","ieee":"G. Avni, T. A. Henzinger, and O. Kupferman, “Dynamic resource allocation games,” Theoretical Computer Science, vol. 807. Elsevier, pp. 42–55, 2020.","mla":"Avni, Guy, et al. “Dynamic Resource Allocation Games.” Theoretical Computer Science, vol. 807, Elsevier, 2020, pp. 42–55, doi:10.1016/j.tcs.2019.06.031.","apa":"Avni, G., Henzinger, T. A., & Kupferman, O. (2020). Dynamic resource allocation games. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2019.06.031"},"publication_identifier":{"issn":["03043975"]},"file_date_updated":"2020-10-09T06:31:22Z","type":"journal_article","abstract":[{"text":"In resource allocation games, selfish players share resources that are needed in order to fulfill their objectives. The cost of using a resource depends on the load on it. In the traditional setting, the players make their choices concurrently and in one-shot. That is, a strategy for a player is a subset of the resources. We introduce and study dynamic resource allocation games. In this setting, the game proceeds in phases. In each phase each player chooses one resource. A scheduler dictates the order in which the players proceed in a phase, possibly scheduling several players to proceed concurrently. The game ends when each player has collected a set of resources that fulfills his objective. The cost for each player then depends on this set as well as on the load on the resources in it – we consider both congestion and cost-sharing games. We argue that the dynamic setting is the suitable setting for many applications in practice. We study the stability of dynamic resource allocation games, where the appropriate notion of stability is that of subgame perfect equilibrium, study the inefficiency incurred due to selfish behavior, and also study problems that are particular to the dynamic setting, like constraints on the order in which resources can be chosen or the problem of finding a scheduler that achieves stability.","lang":"eng"}],"scopus_import":"1","project":[{"_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S11402-N23"},{"grant_number":"Z211","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize"},{"name":"Formal Methods meets Algorithmic Game Theory","_id":"264B3912-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"M02369"}],"publication_status":"published","file":[{"file_name":"2020_TheoreticalCS_Avni.pdf","success":1,"date_created":"2020-10-09T06:31:22Z","date_updated":"2020-10-09T06:31:22Z","creator":"dernst","file_size":1413001,"file_id":"8639","content_type":"application/pdf","access_level":"open_access","checksum":"e86635417f45eb2cd75778f91382f737","relation":"main_file"}],"author":[{"full_name":"Avni, Guy","first_name":"Guy","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","last_name":"Avni","orcid":"0000-0001-5588-8287"},{"orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"last_name":"Kupferman","first_name":"Orna","full_name":"Kupferman, Orna"}],"title":"Dynamic resource allocation games","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","has_accepted_license":"1","publisher":"Elsevier","language":[{"iso":"eng"}],"article_type":"original","article_processing_charge":"No","department":[{"_id":"ToHe"}]},{"pmid":1,"volume":30,"status":"public","day":"01","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"date_created":"2019-08-11T21:59:24Z","ddc":["570"],"doi":"10.1002/hipo.23144","publication":"Hippocampus","isi":1,"oa_version":"Published Version","month":"04","intvolume":" 30","date_published":"2020-04-01T00:00:00Z","issue":"4","oa":1,"date_updated":"2023-08-17T13:53:14Z","license":"https://creativecommons.org/licenses/by/4.0/","page":"302-313","external_id":{"pmid":["31339190"],"isi":["000477299600001"]},"year":"2020","file_date_updated":"2020-07-14T12:47:40Z","type":"journal_article","scopus_import":"1","abstract":[{"text":"Nearby grid cells have been observed to express a remarkable degree of long-rangeorder, which is often idealized as extending potentially to infinity. Yet their strict peri-odic firing and ensemble coherence are theoretically possible only in flat environments, much unlike the burrows which rodents usually live in. Are the symmetrical, coherent grid maps inferred in the lab relevant to chart their way in their natural habitat? We consider spheres as simple models of curved environments and waiting for the appropriate experiments to be performed, we use our adaptation model to predict what grid maps would emerge in a network with the same type of recurrent connections, which on the plane produce coherence among the units. We find that on the sphere such connections distort the maps that single grid units would express on their own, and aggregate them into clusters. When remapping to a different spherical environment, units in each cluster maintain only partial coherence, similar to what is observed in disordered materials, such as spin glasses.","lang":"eng"}],"citation":{"mla":"Stella, Federico, et al. “Partial Coherence and Frustration in Self-Organizing Spherical Grids.” Hippocampus, vol. 30, no. 4, Wiley, 2020, pp. 302–13, doi:10.1002/hipo.23144.","apa":"Stella, F., Urdapilleta, E., Luo, Y., & Treves, A. (2020). Partial coherence and frustration in self-organizing spherical grids. Hippocampus. Wiley. https://doi.org/10.1002/hipo.23144","chicago":"Stella, Federico, Eugenio Urdapilleta, Yifan Luo, and Alessandro Treves. “Partial Coherence and Frustration in Self-Organizing Spherical Grids.” Hippocampus. Wiley, 2020. https://doi.org/10.1002/hipo.23144.","short":"F. Stella, E. Urdapilleta, Y. Luo, A. Treves, Hippocampus 30 (2020) 302–313.","ista":"Stella F, Urdapilleta E, Luo Y, Treves A. 2020. Partial coherence and frustration in self-organizing spherical grids. Hippocampus. 30(4), 302–313.","ieee":"F. Stella, E. Urdapilleta, Y. Luo, and A. Treves, “Partial coherence and frustration in self-organizing spherical grids,” Hippocampus, vol. 30, no. 4. Wiley, pp. 302–313, 2020.","ama":"Stella F, Urdapilleta E, Luo Y, Treves A. Partial coherence and frustration in self-organizing spherical grids. Hippocampus. 2020;30(4):302-313. doi:10.1002/hipo.23144"},"publication_identifier":{"eissn":["10981063"],"issn":["10509631"]},"quality_controlled":"1","_id":"6796","publication_status":"published","publisher":"Wiley","has_accepted_license":"1","file":[{"file_name":"2019_Hippocampus_Stella.pdf","date_created":"2019-08-12T07:53:33Z","date_updated":"2020-07-14T12:47:40Z","file_id":"6800","content_type":"application/pdf","creator":"dernst","file_size":2370658,"access_level":"open_access","relation":"main_file","checksum":"7b54d22bfbfc0d1188a9ea24d985bfb2"}],"title":"Partial coherence and frustration in self-organizing spherical grids","author":[{"orcid":"0000-0001-9439-3148","last_name":"Stella","first_name":"Federico","id":"39AF1E74-F248-11E8-B48F-1D18A9856A87","full_name":"Stella, Federico"},{"full_name":"Urdapilleta, Eugenio","last_name":"Urdapilleta","first_name":"Eugenio"},{"full_name":"Luo, Yifan","last_name":"Luo","first_name":"Yifan"},{"full_name":"Treves, Alessandro","first_name":"Alessandro","last_name":"Treves"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","department":[{"_id":"JoCs"}],"article_processing_charge":"No","article_type":"original","language":[{"iso":"eng"}]},{"department":[{"_id":"JoDa"}],"article_processing_charge":"No","article_type":"original","language":[{"iso":"eng"}],"publisher":"Elsevier","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","author":[{"full_name":"Jahr, Wiebke","first_name":"Wiebke","id":"425C1CE8-F248-11E8-B48F-1D18A9856A87","last_name":"Jahr"},{"full_name":"Velicky, Philipp","last_name":"Velicky","orcid":"0000-0002-2340-7431","id":"39BDC62C-F248-11E8-B48F-1D18A9856A87","first_name":"Philipp"},{"last_name":"Danzl","orcid":"0000-0001-8559-3973","id":"42EFD3B6-F248-11E8-B48F-1D18A9856A87","first_name":"Johann G","full_name":"Danzl, Johann G"}],"title":"Strategies to maximize performance in STimulated Emission Depletion (STED) nanoscopy of biological specimens","publication_status":"published","project":[{"_id":"265CB4D0-B435-11E9-9278-68D0E5697425","name":"Optical control of synaptic function via adhesion molecules","grant_number":"I03600","call_identifier":"FWF"},{"grant_number":"LT00057","_id":"2668BFA0-B435-11E9-9278-68D0E5697425","name":"High-speed 3D-nanoscopy to study the role of adhesion during 3D cell migration"}],"type":"journal_article","scopus_import":"1","abstract":[{"lang":"eng","text":"Super-resolution fluorescence microscopy has become an important catalyst for discovery in the life sciences. In STimulated Emission Depletion (STED) microscopy, a pattern of light drives fluorophores from a signal-emitting on-state to a non-signalling off-state. Only emitters residing in a sub-diffraction volume around an intensity minimum are allowed to fluoresce, rendering them distinguishable from the nearby, but dark fluorophores. STED routinely achieves resolution in the few tens of nanometers range in biological samples and is suitable for live imaging. Here, we review the working principle of STED and provide general guidelines for successful STED imaging. The strive for ever higher resolution comes at the cost of increased light burden. We discuss techniques to reduce light exposure and mitigate its detrimental effects on the specimen. These include specialized illumination strategies as well as protecting fluorophores from photobleaching mediated by high-intensity STED light. This opens up the prospect of volumetric imaging in living cells and tissues with diffraction-unlimited resolution in all three spatial dimensions."}],"publication_identifier":{"issn":["1046-2023"]},"citation":{"ista":"Jahr W, Velicky P, Danzl JG. 2020. Strategies to maximize performance in STimulated Emission Depletion (STED) nanoscopy of biological specimens. Methods. 174(3), 27–41.","ieee":"W. Jahr, P. Velicky, and J. G. Danzl, “Strategies to maximize performance in STimulated Emission Depletion (STED) nanoscopy of biological specimens,” Methods, vol. 174, no. 3. Elsevier, pp. 27–41, 2020.","short":"W. Jahr, P. Velicky, J.G. Danzl, Methods 174 (2020) 27–41.","ama":"Jahr W, Velicky P, Danzl JG. Strategies to maximize performance in STimulated Emission Depletion (STED) nanoscopy of biological specimens. Methods. 2020;174(3):27-41. doi:10.1016/j.ymeth.2019.07.019","chicago":"Jahr, Wiebke, Philipp Velicky, and Johann G Danzl. “Strategies to Maximize Performance in STimulated Emission Depletion (STED) Nanoscopy of Biological Specimens.” Methods. Elsevier, 2020. https://doi.org/10.1016/j.ymeth.2019.07.019.","apa":"Jahr, W., Velicky, P., & Danzl, J. G. (2020). Strategies to maximize performance in STimulated Emission Depletion (STED) nanoscopy of biological specimens. Methods. Elsevier. https://doi.org/10.1016/j.ymeth.2019.07.019","mla":"Jahr, Wiebke, et al. “Strategies to Maximize Performance in STimulated Emission Depletion (STED) Nanoscopy of Biological Specimens.” Methods, vol. 174, no. 3, Elsevier, 2020, pp. 27–41, doi:10.1016/j.ymeth.2019.07.019."},"quality_controlled":"1","_id":"6808","external_id":{"isi":["000525860400005"],"pmid":["31344404"]},"page":"27-41","year":"2020","month":"03","intvolume":" 174","date_published":"2020-03-01T00:00:00Z","issue":"3","oa":1,"date_updated":"2023-08-17T13:59:57Z","main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7100895/","open_access":"1"}],"doi":"10.1016/j.ymeth.2019.07.019","publication":"Methods","isi":1,"oa_version":"Submitted Version","pmid":1,"volume":174,"status":"public","day":"01","date_created":"2019-08-12T16:36:32Z"},{"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Boccato, Chiara","last_name":"Boccato","id":"342E7E22-F248-11E8-B48F-1D18A9856A87","first_name":"Chiara"},{"full_name":"Brennecke, Christian","first_name":"Christian","last_name":"Brennecke"},{"first_name":"Serena","last_name":"Cenatiempo","full_name":"Cenatiempo, Serena"},{"last_name":"Schlein","first_name":"Benjamin","full_name":"Schlein, Benjamin"}],"title":"Optimal rate for Bose-Einstein condensation in the Gross-Pitaevskii regime","publisher":"Springer","article_type":"original","language":[{"iso":"eng"}],"department":[{"_id":"RoSe"}],"article_processing_charge":"No","quality_controlled":"1","_id":"6906","type":"journal_article","scopus_import":"1","arxiv":1,"abstract":[{"lang":"eng","text":"We consider systems of bosons trapped in a box, in the Gross–Pitaevskii regime. We show that low-energy states exhibit complete Bose–Einstein condensation with an optimal bound on the number of orthogonal excitations. This extends recent results obtained in Boccato et al. (Commun Math Phys 359(3):975–1026, 2018), removing the assumption of small interaction potential."}],"citation":{"chicago":"Boccato, Chiara, Christian Brennecke, Serena Cenatiempo, and Benjamin Schlein. “Optimal Rate for Bose-Einstein Condensation in the Gross-Pitaevskii Regime.” Communications in Mathematical Physics. Springer, 2020. https://doi.org/10.1007/s00220-019-03555-9.","short":"C. Boccato, C. Brennecke, S. Cenatiempo, B. Schlein, Communications in Mathematical Physics 376 (2020) 1311–1395.","ieee":"C. Boccato, C. Brennecke, S. Cenatiempo, and B. Schlein, “Optimal rate for Bose-Einstein condensation in the Gross-Pitaevskii regime,” Communications in Mathematical Physics, vol. 376. Springer, pp. 1311–1395, 2020.","ista":"Boccato C, Brennecke C, Cenatiempo S, Schlein B. 2020. Optimal rate for Bose-Einstein condensation in the Gross-Pitaevskii regime. Communications in Mathematical Physics. 376, 1311–1395.","ama":"Boccato C, Brennecke C, Cenatiempo S, Schlein B. Optimal rate for Bose-Einstein condensation in the Gross-Pitaevskii regime. Communications in Mathematical Physics. 2020;376:1311-1395. doi:10.1007/s00220-019-03555-9","mla":"Boccato, Chiara, et al. “Optimal Rate for Bose-Einstein Condensation in the Gross-Pitaevskii Regime.” Communications in Mathematical Physics, vol. 376, Springer, 2020, pp. 1311–95, doi:10.1007/s00220-019-03555-9.","apa":"Boccato, C., Brennecke, C., Cenatiempo, S., & Schlein, B. (2020). Optimal rate for Bose-Einstein condensation in the Gross-Pitaevskii regime. Communications in Mathematical Physics. Springer. https://doi.org/10.1007/s00220-019-03555-9"},"publication_identifier":{"eissn":["1432-0916"],"issn":["0010-3616"]},"publication_status":"published","project":[{"call_identifier":"H2020","grant_number":"694227","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","name":"Analysis of quantum many-body systems"}],"oa":1,"date_updated":"2024-02-22T13:33:02Z","acknowledgement":"We would like to thank P. T. Nam and R. Seiringer for several useful discussions and\r\nfor suggesting us to use the localization techniques from [9]. C. Boccato has received funding from the\r\nEuropean Research Council (ERC) under the programme Horizon 2020 (Grant Agreement 694227). B. Schlein gratefully acknowledges support from the NCCR SwissMAP and from the Swiss National Foundation of Science (Grant No. 200020_1726230) through the SNF Grant “Dynamical and energetic properties of Bose–Einstein condensates”.","month":"06","intvolume":" 376","date_published":"2020-06-01T00:00:00Z","year":"2020","external_id":{"isi":["000536053300012"],"arxiv":["1812.03086"]},"page":"1311-1395","status":"public","day":"01","date_created":"2019-09-24T17:30:59Z","volume":376,"isi":1,"ec_funded":1,"oa_version":"Preprint","doi":"10.1007/s00220-019-03555-9","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1812.03086"}],"publication":"Communications in Mathematical Physics"},{"type":"journal_article","abstract":[{"text":"We consider the classic problem of Network Reliability. A network is given together with a source vertex, one or more target vertices, and probabilities assigned to each of the edges. Each edge of the network is operable with its associated probability and the problem is to determine the probability of having at least one source-to-target path that is entirely composed of operable edges. This problem is known to be NP-hard.\r\n\r\nWe provide a novel scalable algorithm to solve the Network Reliability problem when the treewidth of the underlying network is small. We also show our algorithm’s applicability for real-world transit networks that have small treewidth, including the metro networks of major cities, such as London and Tokyo. Our algorithm leverages tree decompositions to shrink the original graph into much smaller graphs, for which reliability can be efficiently and exactly computed using a brute force method. To the best of our knowledge, this is the first exact algorithm for Network Reliability that can scale to handle real-world instances of the problem.","lang":"eng"}],"scopus_import":"1","arxiv":1,"publication_identifier":{"issn":["09518320"]},"citation":{"apa":"Goharshady, A. K., & Mohammadi, F. (2020). An efficient algorithm for computing network reliability in small treewidth. Reliability Engineering and System Safety. Elsevier. https://doi.org/10.1016/j.ress.2019.106665","mla":"Goharshady, Amir Kafshdar, and Fatemeh Mohammadi. “An Efficient Algorithm for Computing Network Reliability in Small Treewidth.” Reliability Engineering and System Safety, vol. 193, 106665, Elsevier, 2020, doi:10.1016/j.ress.2019.106665.","ama":"Goharshady AK, Mohammadi F. An efficient algorithm for computing network reliability in small treewidth. Reliability Engineering and System Safety. 2020;193. doi:10.1016/j.ress.2019.106665","short":"A.K. Goharshady, F. Mohammadi, Reliability Engineering and System Safety 193 (2020).","ista":"Goharshady AK, Mohammadi F. 2020. An efficient algorithm for computing network reliability in small treewidth. Reliability Engineering and System Safety. 193, 106665.","ieee":"A. K. Goharshady and F. Mohammadi, “An efficient algorithm for computing network reliability in small treewidth,” Reliability Engineering and System Safety, vol. 193. Elsevier, 2020.","chicago":"Goharshady, Amir Kafshdar, and Fatemeh Mohammadi. “An Efficient Algorithm for Computing Network Reliability in Small Treewidth.” Reliability Engineering and System Safety. Elsevier, 2020. https://doi.org/10.1016/j.ress.2019.106665."},"quality_controlled":"1","_id":"6918","publication_status":"published","project":[{"name":"Quantitative Game-theoretic Analysis of Blockchain Applications and Smart Contracts","_id":"266EEEC0-B435-11E9-9278-68D0E5697425"}],"publisher":"Elsevier","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","author":[{"id":"391365CE-F248-11E8-B48F-1D18A9856A87","first_name":"Amir Kafshdar","last_name":"Goharshady","orcid":"0000-0003-1702-6584","full_name":"Goharshady, Amir Kafshdar"},{"full_name":"Mohammadi, Fatemeh","first_name":"Fatemeh","last_name":"Mohammadi"}],"title":"An efficient algorithm for computing network reliability in small treewidth","department":[{"_id":"KrCh"}],"article_processing_charge":"No","article_type":"original","language":[{"iso":"eng"}],"volume":193,"day":"01","status":"public","date_created":"2019-09-29T22:00:44Z","doi":"10.1016/j.ress.2019.106665","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1712.09692"}],"publication":"Reliability Engineering and System Safety","isi":1,"oa_version":"Preprint","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"8934"}]},"acknowledgement":"We are grateful to the anonymous reviewers for their comments, which significantly improved the present work. The research was partially supported by the EPSRC Early Career Fellowship EP/R023379/1, grant no. SC7-1718-01 of the London Mathematical Society, an IBM PhD Fellowship, and a DOC Fellowship of the Austrian Academy of Sciences (ÖAW).","article_number":"106665","intvolume":" 193","month":"01","date_published":"2020-01-01T00:00:00Z","oa":1,"date_updated":"2024-03-25T23:30:18Z","external_id":{"isi":["000501641400050"],"arxiv":["1712.09692"]},"year":"2020"},{"year":"2020","page":"970-995","external_id":{"isi":["000494406800001"]},"date_updated":"2024-02-22T14:57:30Z","issue":"4","oa":1,"month":"04","intvolume":" 128","date_published":"2020-04-01T00:00:00Z","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"6482"}],"link":[{"relation":"erratum","url":"https://doi.org/10.1007/s11263-019-01262-5"}]},"isi":1,"ec_funded":1,"oa_version":"Published Version","doi":"10.1007/s11263-019-01232-x","publication":"International Journal of Computer Vision","ddc":["004"],"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"date_created":"2019-10-14T09:14:28Z","day":"01","status":"public","volume":128,"language":[{"iso":"eng"}],"article_type":"original","article_processing_charge":"Yes (via OA deal)","department":[{"_id":"ChLa"}],"file":[{"file_name":"2019_IJCV_Sun.pdf","date_created":"2019-11-26T10:30:02Z","date_updated":"2020-07-14T12:47:45Z","creator":"dernst","file_size":1715072,"content_type":"application/pdf","file_id":"7110","access_level":"open_access","relation":"main_file","checksum":"155e63edf664dcacb3bdc1c2223e606f"}],"author":[{"full_name":"Sun, Rémy","first_name":"Rémy","last_name":"Sun"},{"full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph","orcid":"0000-0001-8622-7887","last_name":"Lampert"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","title":"KS(conf): A light-weight test if a multiclass classifier operates outside of its specifications","has_accepted_license":"1","publisher":"Springer Nature","project":[{"grant_number":"308036","call_identifier":"FP7","_id":"2532554C-B435-11E9-9278-68D0E5697425","name":"Lifelong Learning of Visual Scene Understanding"},{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}],"publication_status":"published","_id":"6944","quality_controlled":"1","citation":{"chicago":"Sun, Rémy, and Christoph Lampert. “KS(Conf): A Light-Weight Test If a Multiclass Classifier Operates Outside of Its Specifications.” International Journal of Computer Vision. Springer Nature, 2020. https://doi.org/10.1007/s11263-019-01232-x.","ieee":"R. Sun and C. Lampert, “KS(conf): A light-weight test if a multiclass classifier operates outside of its specifications,” International Journal of Computer Vision, vol. 128, no. 4. Springer Nature, pp. 970–995, 2020.","short":"R. Sun, C. Lampert, International Journal of Computer Vision 128 (2020) 970–995.","ista":"Sun R, Lampert C. 2020. KS(conf): A light-weight test if a multiclass classifier operates outside of its specifications. International Journal of Computer Vision. 128(4), 970–995.","ama":"Sun R, Lampert C. KS(conf): A light-weight test if a multiclass classifier operates outside of its specifications. International Journal of Computer Vision. 2020;128(4):970-995. doi:10.1007/s11263-019-01232-x","mla":"Sun, Rémy, and Christoph Lampert. “KS(Conf): A Light-Weight Test If a Multiclass Classifier Operates Outside of Its Specifications.” International Journal of Computer Vision, vol. 128, no. 4, Springer Nature, 2020, pp. 970–95, doi:10.1007/s11263-019-01232-x.","apa":"Sun, R., & Lampert, C. (2020). KS(conf): A light-weight test if a multiclass classifier operates outside of its specifications. International Journal of Computer Vision. Springer Nature. https://doi.org/10.1007/s11263-019-01232-x"},"publication_identifier":{"issn":["0920-5691"],"eissn":["1573-1405"]},"type":"journal_article","file_date_updated":"2020-07-14T12:47:45Z","scopus_import":"1","abstract":[{"lang":"eng","text":"We study the problem of automatically detecting if a given multi-class classifier operates outside of its specifications (out-of-specs), i.e. on input data from a different distribution than what it was trained for. This is an important problem to solve on the road towards creating reliable computer vision systems for real-world applications, because the quality of a classifier’s predictions cannot be guaranteed if it operates out-of-specs. Previously proposed methods for out-of-specs detection make decisions on the level of single inputs. This, however, is insufficient to achieve low false positive rate and high false negative rates at the same time. In this work, we describe a new procedure named KS(conf), based on statistical reasoning. Its main component is a classical Kolmogorov–Smirnov test that is applied to the set of predicted confidence values for batches of samples. Working with batches instead of single samples allows increasing the true positive rate without negatively affecting the false positive rate, thereby overcoming a crucial limitation of single sample tests. We show by extensive experiments using a variety of convolutional network architectures and datasets that KS(conf) reliably detects out-of-specs situations even under conditions where other tests fail. It furthermore has a number of properties that make it an excellent candidate for practical deployment: it is easy to implement, adds almost no overhead to the system, works with any classifier that outputs confidence scores, and requires no a priori knowledge about how the data distribution could change."}]},{"oa_version":"Published Version","isi":1,"publication":"International Journal of Computer Vision","doi":"10.1007/s11263-019-01219-8","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ddc":["004"],"date_created":"2019-10-17T13:38:20Z","status":"public","day":"01","volume":128,"year":"2020","external_id":{"isi":["000491042100002"],"arxiv":["1901.06447"]},"page":"835-854","date_updated":"2023-08-17T14:01:16Z","oa":1,"date_published":"2020-04-01T00:00:00Z","intvolume":" 128","month":"04","acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria).","project":[{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}],"publication_status":"published","_id":"6952","quality_controlled":"1","citation":{"apa":"Henderson, P. M., & Ferrari, V. (2020). Learning single-image 3D reconstruction by generative modelling of shape, pose and shading. International Journal of Computer Vision. Springer Nature. https://doi.org/10.1007/s11263-019-01219-8","mla":"Henderson, Paul M., and Vittorio Ferrari. “Learning Single-Image 3D Reconstruction by Generative Modelling of Shape, Pose and Shading.” International Journal of Computer Vision, vol. 128, Springer Nature, 2020, pp. 835–54, doi:10.1007/s11263-019-01219-8.","short":"P.M. Henderson, V. Ferrari, International Journal of Computer Vision 128 (2020) 835–854.","ista":"Henderson PM, Ferrari V. 2020. Learning single-image 3D reconstruction by generative modelling of shape, pose and shading. International Journal of Computer Vision. 128, 835–854.","ieee":"P. M. Henderson and V. Ferrari, “Learning single-image 3D reconstruction by generative modelling of shape, pose and shading,” International Journal of Computer Vision, vol. 128. Springer Nature, pp. 835–854, 2020.","ama":"Henderson PM, Ferrari V. Learning single-image 3D reconstruction by generative modelling of shape, pose and shading. International Journal of Computer Vision. 2020;128:835-854. doi:10.1007/s11263-019-01219-8","chicago":"Henderson, Paul M, and Vittorio Ferrari. “Learning Single-Image 3D Reconstruction by Generative Modelling of Shape, Pose and Shading.” International Journal of Computer Vision. Springer Nature, 2020. https://doi.org/10.1007/s11263-019-01219-8."},"publication_identifier":{"issn":["0920-5691"],"eissn":["1573-1405"]},"abstract":[{"lang":"eng","text":"We present a unified framework tackling two problems: class-specific 3D reconstruction from a single image, and generation of new 3D shape samples. These tasks have received considerable attention recently; however, most existing approaches rely on 3D supervision, annotation of 2D images with keypoints or poses, and/or training with multiple views of each object instance. Our framework is very general: it can be trained in similar settings to existing approaches, while also supporting weaker supervision. Importantly, it can be trained purely from 2D images, without pose annotations, and with only a single view per instance. We employ meshes as an output representation, instead of voxels used in most prior work. This allows us to reason over lighting parameters and exploit shading information during training, which previous 2D-supervised methods cannot. Thus, our method can learn to generate and reconstruct concave object classes. We evaluate our approach in various settings, showing that: (i) it learns to disentangle shape from pose and lighting; (ii) using shading in the loss improves performance compared to just silhouettes; (iii) when using a standard single white light, our model outperforms state-of-the-art 2D-supervised methods, both with and without pose supervision, thanks to exploiting shading cues; (iv) performance improves further when using multiple coloured lights, even approaching that of state-of-the-art 3D-supervised methods; (v) shapes produced by our model capture smooth surfaces and fine details better than voxel-based approaches; and (vi) our approach supports concave classes such as bathtubs and sofas, which methods based on silhouettes cannot learn."}],"scopus_import":"1","arxiv":1,"file_date_updated":"2020-07-14T12:47:46Z","type":"journal_article","language":[{"iso":"eng"}],"article_type":"original","article_processing_charge":"Yes (via OA deal)","department":[{"_id":"ChLa"}],"title":"Learning single-image 3D reconstruction by generative modelling of shape, pose and shading","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","author":[{"full_name":"Henderson, Paul M","id":"13C09E74-18D9-11E9-8878-32CFE5697425","first_name":"Paul M","orcid":"0000-0002-5198-7445","last_name":"Henderson"},{"first_name":"Vittorio","last_name":"Ferrari","full_name":"Ferrari, Vittorio"}],"file":[{"relation":"main_file","checksum":"a0f05dd4f5f64e4f713d8d9d4b5b1e3f","access_level":"open_access","content_type":"application/pdf","file_id":"6973","creator":"dernst","file_size":2243134,"date_updated":"2020-07-14T12:47:46Z","date_created":"2019-10-25T10:28:29Z","file_name":"2019_CompVision_Henderson.pdf"}],"has_accepted_license":"1","publisher":"Springer Nature"},{"volume":225,"pmid":1,"day":"01","status":"public","date_created":"2019-11-12T11:41:32Z","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ddc":["580"],"publication":"New Phytologist","doi":"10.1111/nph.16203","oa_version":"Published Version","ec_funded":1,"isi":1,"date_published":"2020-02-01T00:00:00Z","month":"02","intvolume":" 225","oa":1,"issue":"3","date_updated":"2023-08-17T14:01:49Z","external_id":{"isi":["000489638800001"],"pmid":["31603260"]},"page":"1049-1052","year":"2020","scopus_import":"1","file_date_updated":"2020-11-18T16:42:48Z","type":"journal_article","publication_identifier":{"issn":["0028-646x"],"eissn":["1469-8137"]},"citation":{"ista":"Zhang Y, Friml J. 2020. Auxin guides roots to avoid obstacles during gravitropic growth. New Phytologist. 225(3), 1049–1052.","ieee":"Y. Zhang and J. Friml, “Auxin guides roots to avoid obstacles during gravitropic growth,” New Phytologist, vol. 225, no. 3. Wiley, pp. 1049–1052, 2020.","short":"Y. Zhang, J. Friml, New Phytologist 225 (2020) 1049–1052.","ama":"Zhang Y, Friml J. Auxin guides roots to avoid obstacles during gravitropic growth. New Phytologist. 2020;225(3):1049-1052. doi:10.1111/nph.16203","chicago":"Zhang, Yuzhou, and Jiří Friml. “Auxin Guides Roots to Avoid Obstacles during Gravitropic Growth.” New Phytologist. Wiley, 2020. https://doi.org/10.1111/nph.16203.","apa":"Zhang, Y., & Friml, J. (2020). Auxin guides roots to avoid obstacles during gravitropic growth. New Phytologist. Wiley. https://doi.org/10.1111/nph.16203","mla":"Zhang, Yuzhou, and Jiří Friml. “Auxin Guides Roots to Avoid Obstacles during Gravitropic Growth.” New Phytologist, vol. 225, no. 3, Wiley, 2020, pp. 1049–52, doi:10.1111/nph.16203."},"quality_controlled":"1","_id":"6997","publication_status":"published","project":[{"_id":"261099A6-B435-11E9-9278-68D0E5697425","name":"Tracing Evolution of Auxin Transport and Polarity in Plants","call_identifier":"H2020","grant_number":"742985"},{"name":"Molecular mechanisms of endocytic cargo recognition in plants","_id":"26538374-B435-11E9-9278-68D0E5697425","grant_number":"I03630","call_identifier":"FWF"},{"name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","call_identifier":"FP7"}],"publisher":"Wiley","has_accepted_license":"1","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","author":[{"full_name":"Zhang, Yuzhou","orcid":"0000-0003-2627-6956","last_name":"Zhang","id":"3B6137F2-F248-11E8-B48F-1D18A9856A87","first_name":"Yuzhou"},{"last_name":"Friml","orcid":"0000-0002-8302-7596","first_name":"Jiří","id":"4159519E-F248-11E8-B48F-1D18A9856A87","full_name":"Friml, Jiří"}],"title":"Auxin guides roots to avoid obstacles during gravitropic growth","file":[{"relation":"main_file","checksum":"cd42ffdb381fd52812b9583d4d407139","access_level":"open_access","creator":"dernst","file_size":717345,"content_type":"application/pdf","file_id":"8772","date_created":"2020-11-18T16:42:48Z","date_updated":"2020-11-18T16:42:48Z","file_name":"2020_NewPhytologist_Zhang.pdf","success":1}],"department":[{"_id":"JiFr"}],"article_processing_charge":"Yes (via OA deal)","article_type":"original","language":[{"iso":"eng"}]},{"type":"journal_article","scopus_import":"1","abstract":[{"text":"We define an action of the (double of) Cohomological Hall algebra of Kontsevich and Soibelman on the cohomology of the moduli space of spiked instantons of Nekrasov. We identify this action with the one of the affine Yangian of gl(1). Based on that we derive the vertex algebra at the corner Wr1,r2,r3 of Gaiotto and Rapčák. We conjecture that our approach works for a big class of Calabi–Yau categories, including those associated with toric Calabi–Yau 3-folds.","lang":"eng"}],"arxiv":1,"citation":{"ama":"Rapcak M, Soibelman Y, Yang Y, Zhao G. Cohomological Hall algebras, vertex algebras and instantons. Communications in Mathematical Physics. 2020;376:1803-1873. doi:10.1007/s00220-019-03575-5","short":"M. Rapcak, Y. Soibelman, Y. Yang, G. Zhao, Communications in Mathematical Physics 376 (2020) 1803–1873.","ieee":"M. Rapcak, Y. Soibelman, Y. Yang, and G. Zhao, “Cohomological Hall algebras, vertex algebras and instantons,” Communications in Mathematical Physics, vol. 376. Springer Nature, pp. 1803–1873, 2020.","ista":"Rapcak M, Soibelman Y, Yang Y, Zhao G. 2020. Cohomological Hall algebras, vertex algebras and instantons. Communications in Mathematical Physics. 376, 1803–1873.","chicago":"Rapcak, Miroslav, Yan Soibelman, Yaping Yang, and Gufang Zhao. “Cohomological Hall Algebras, Vertex Algebras and Instantons.” Communications in Mathematical Physics. Springer Nature, 2020. https://doi.org/10.1007/s00220-019-03575-5.","apa":"Rapcak, M., Soibelman, Y., Yang, Y., & Zhao, G. (2020). Cohomological Hall algebras, vertex algebras and instantons. Communications in Mathematical Physics. Springer Nature. https://doi.org/10.1007/s00220-019-03575-5","mla":"Rapcak, Miroslav, et al. “Cohomological Hall Algebras, Vertex Algebras and Instantons.” Communications in Mathematical Physics, vol. 376, Springer Nature, 2020, pp. 1803–73, doi:10.1007/s00220-019-03575-5."},"publication_identifier":{"eissn":["1432-0916"],"issn":["0010-3616"]},"quality_controlled":"1","_id":"7004","publication_status":"published","project":[{"call_identifier":"FP7","grant_number":"320593","_id":"25E549F4-B435-11E9-9278-68D0E5697425","name":"Arithmetic and physics of Higgs moduli spaces"}],"publisher":"Springer Nature","title":"Cohomological Hall algebras, vertex algebras and instantons","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","author":[{"full_name":"Rapcak, Miroslav","last_name":"Rapcak","first_name":"Miroslav"},{"full_name":"Soibelman, Yan","first_name":"Yan","last_name":"Soibelman"},{"full_name":"Yang, Yaping","last_name":"Yang","first_name":"Yaping"},{"last_name":"Zhao","id":"2BC2AC5E-F248-11E8-B48F-1D18A9856A87","first_name":"Gufang","full_name":"Zhao, Gufang"}],"department":[{"_id":"TaHa"}],"article_processing_charge":"No","article_type":"original","language":[{"iso":"eng"}],"volume":376,"status":"public","day":"01","date_created":"2019-11-12T14:01:27Z","doi":"10.1007/s00220-019-03575-5","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1810.10402"}],"publication":"Communications in Mathematical Physics","isi":1,"oa_version":"Preprint","ec_funded":1,"month":"06","intvolume":" 376","date_published":"2020-06-01T00:00:00Z","oa":1,"date_updated":"2023-08-17T14:02:59Z","page":"1803-1873","external_id":{"isi":["000536255500004"],"arxiv":["1810.10402"]},"year":"2020"},{"page":"1070–1084","external_id":{"isi":["000493754200001"],"pmid":["31673950"]},"year":"2020","date_published":"2020-02-01T00:00:00Z","intvolume":" 57","month":"02","acknowledgement":"This work was supported by National Eye Institute grants R01 EY012223 (RWN), R01 EY030123 (RWN), T32 EY027721 (Department of Ophthalmology and Visual Sciences, University of Wisconsin-Madison), and a Vision Science Core grant P30 EY016665 (Department of Ophthalmology and Visual Sciences, University of Wisconsin-Madison), an unrestricted funding grant from Research to Prevent Blindness (Department of Ophthalmology and Visual Sciences, University of Wisconsin-Madison), the Frederick A. Davis Endowment (RWN), and the Mr. and Mrs. George Taylor Foundation (RWN).","date_updated":"2023-08-17T14:05:48Z","oa":1,"issue":"2","publication":"Molecular Neurobiology","main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7035206/","open_access":"1"}],"doi":"10.1007/s12035-019-01783-7","oa_version":"Submitted Version","isi":1,"volume":57,"pmid":1,"date_created":"2019-11-18T14:18:39Z","day":"01","status":"public","article_processing_charge":"No","department":[{"_id":"SaSi"}],"language":[{"iso":"eng"}],"article_type":"original","publisher":"Springer Nature","title":"BAX-depleted retinal ganglion cells survive and become quiescent following optic nerve damage","author":[{"first_name":"RJ","last_name":"Donahue","full_name":"Donahue, RJ"},{"id":"3838F452-F248-11E8-B48F-1D18A9856A87","first_name":"Margaret E","orcid":"0000-0001-9642-1085","last_name":"Maes","full_name":"Maes, Margaret E"},{"full_name":"Grosser, JA","first_name":"JA","last_name":"Grosser"},{"first_name":"RW","last_name":"Nickells","full_name":"Nickells, RW"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","publication_status":"published","citation":{"short":"R. Donahue, M.E. Maes, J. Grosser, R. Nickells, Molecular Neurobiology 57 (2020) 1070–1084.","ista":"Donahue R, Maes ME, Grosser J, Nickells R. 2020. BAX-depleted retinal ganglion cells survive and become quiescent following optic nerve damage. Molecular Neurobiology. 57(2), 1070–1084.","ieee":"R. Donahue, M. E. Maes, J. Grosser, and R. Nickells, “BAX-depleted retinal ganglion cells survive and become quiescent following optic nerve damage,” Molecular Neurobiology, vol. 57, no. 2. Springer Nature, pp. 1070–1084, 2020.","ama":"Donahue R, Maes ME, Grosser J, Nickells R. BAX-depleted retinal ganglion cells survive and become quiescent following optic nerve damage. Molecular Neurobiology. 2020;57(2):1070–1084. doi:10.1007/s12035-019-01783-7","chicago":"Donahue, RJ, Margaret E Maes, JA Grosser, and RW Nickells. “BAX-Depleted Retinal Ganglion Cells Survive and Become Quiescent Following Optic Nerve Damage.” Molecular Neurobiology. Springer Nature, 2020. https://doi.org/10.1007/s12035-019-01783-7.","apa":"Donahue, R., Maes, M. E., Grosser, J., & Nickells, R. (2020). BAX-depleted retinal ganglion cells survive and become quiescent following optic nerve damage. Molecular Neurobiology. Springer Nature. https://doi.org/10.1007/s12035-019-01783-7","mla":"Donahue, RJ, et al. “BAX-Depleted Retinal Ganglion Cells Survive and Become Quiescent Following Optic Nerve Damage.” Molecular Neurobiology, vol. 57, no. 2, Springer Nature, 2020, pp. 1070–1084, doi:10.1007/s12035-019-01783-7."},"publication_identifier":{"issn":["0893-7648"],"eissn":["1559-1182"]},"abstract":[{"lang":"eng","text":"Removal of the Bax gene from mice completely protects the somas of retinal ganglion cells (RGCs) from apoptosis following optic nerve injury. This makes BAX a promising therapeutic target to prevent neurodegeneration. In this study, Bax+/− mice were used to test the hypothesis that lowering the quantity of BAX in RGCs would delay apoptosis following optic nerve injury. RGCs were damaged by performing optic nerve crush (ONC) and then immunostaining for phospho-cJUN, and quantitative PCR were used to monitor the status of the BAX activation mechanism in the months following injury. The apoptotic susceptibility of injured cells was directly tested by virally introducing GFP-BAX into Bax−/− RGCs after injury. The competency of quiescent RGCs to reactivate their BAX activation mechanism was tested by intravitreal injection of the JNK pathway agonist, anisomycin. Twenty-four weeks after ONC, Bax+/− mice had significantly less cell loss in their RGC layer than Bax+/+ mice 3 weeks after ONC. Bax+/− and Bax+/+ RGCs exhibited similar patterns of nuclear phospho-cJUN accumulation immediately after ONC, which persisted in Bax+/− RGCs for up to 7 weeks before abating. The transcriptional activation of BAX-activating genes was similar in Bax+/− and Bax+/+ RGCs following ONC. Intriguingly, cells deactivated their BAX activation mechanism between 7 and 12 weeks after crush. Introduction of GFP-BAX into Bax−/− cells at 4 weeks after ONC showed that these cells had a nearly normal capacity to activate this protein, but this capacity was lost 8 weeks after crush. Collectively, these data suggest that 8–12 weeks after crush, damaged cells no longer displayed increased susceptibility to BAX activation relative to their naïve counterparts. In this same timeframe, retinal glial activation and the signaling of the pro-apoptotic JNK pathway also abated. Quiescent RGCs did not show a timely reactivation of their JNK pathway following intravitreal injection with anisomycin. These findings demonstrate that lowering the quantity of BAX in RGCs is neuroprotective after acute injury. Damaged RGCs enter a quiescent state months after injury and are no longer responsive to an apoptotic stimulus. Quiescent RGCs will require rejuvenation to reacquire functionality."}],"scopus_import":"1","type":"journal_article","_id":"7033","quality_controlled":"1"},{"article_number":"eaaz4074","intvolume":" 6","month":"03","date_published":"2020-03-06T00:00:00Z","issue":"10","oa":1,"date_updated":"2022-08-25T15:08:41Z","external_id":{"pmid":["32181367"],"arxiv":["1903.00552"]},"year":"2020","pmid":1,"volume":6,"day":"06","status":"public","date_created":"2019-11-19T14:01:10Z","main_file_link":[{"url":"https://arxiv.org/abs/1903.00552","open_access":"1"}],"doi":"10.1126/sciadv.aaz4074","publication":"Science Advances","oa_version":"Preprint","publisher":"American Association for the Advancement of Science","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","title":"One-component order parameter in URu2Si2 uncovered by resonant ultrasound spectroscopy and machine learning","author":[{"full_name":"Ghosh, Sayak","first_name":"Sayak","last_name":"Ghosh"},{"last_name":"Matty","first_name":"Michael","full_name":"Matty, Michael"},{"first_name":"Ryan","last_name":"Baumbach","full_name":"Baumbach, Ryan"},{"full_name":"Bauer, Eric D.","last_name":"Bauer","first_name":"Eric D."},{"id":"13C26AC0-EB69-11E9-87C6-5F3BE6697425","first_name":"Kimberly A","orcid":"0000-0001-9760-3147","last_name":"Modic","full_name":"Modic, Kimberly A"},{"last_name":"Shekhter","first_name":"Arkady","full_name":"Shekhter, Arkady"},{"last_name":"Mydosh","first_name":"J. A.","full_name":"Mydosh, J. A."},{"last_name":"Kim","first_name":"Eun-Ah","full_name":"Kim, Eun-Ah"},{"full_name":"Ramshaw, B. J.","last_name":"Ramshaw","first_name":"B. J."}],"article_processing_charge":"No","article_type":"original","language":[{"iso":"eng"}],"type":"journal_article","abstract":[{"text":"The unusual correlated state that emerges in URu2Si2 below THO = 17.5 K is known as “hidden order” because even basic characteristics of the order parameter, such as its dimensionality (whether it has one component or two), are “hidden.” We use resonant ultrasound spectroscopy to measure the symmetry-resolved elastic anomalies across THO. We observe no anomalies in the shear elastic moduli, providing strong thermodynamic evidence for a one-component order parameter. We develop a machine learning framework that reaches this conclusion directly from the raw data, even in a crystal that is too small for traditional resonant ultrasound. Our result rules out a broad class of theories of hidden order based on two-component order parameters, and constrains the nature of the fluctuations from which unconventional superconductivity emerges at lower temperature. Our machine learning framework is a powerful new tool for classifying the ubiquitous competing orders in correlated electron systems.","lang":"eng"}],"arxiv":1,"citation":{"apa":"Ghosh, S., Matty, M., Baumbach, R., Bauer, E. D., Modic, K. A., Shekhter, A., … Ramshaw, B. J. (2020). One-component order parameter in URu2Si2 uncovered by resonant ultrasound spectroscopy and machine learning. Science Advances. American Association for the Advancement of Science. https://doi.org/10.1126/sciadv.aaz4074","mla":"Ghosh, Sayak, et al. “One-Component Order Parameter in URu2Si2 Uncovered by Resonant Ultrasound Spectroscopy and Machine Learning.” Science Advances, vol. 6, no. 10, eaaz4074, American Association for the Advancement of Science, 2020, doi:10.1126/sciadv.aaz4074.","ama":"Ghosh S, Matty M, Baumbach R, et al. One-component order parameter in URu2Si2 uncovered by resonant ultrasound spectroscopy and machine learning. Science Advances. 2020;6(10). doi:10.1126/sciadv.aaz4074","short":"S. Ghosh, M. Matty, R. Baumbach, E.D. Bauer, K.A. Modic, A. Shekhter, J.A. Mydosh, E.-A. Kim, B.J. Ramshaw, Science Advances 6 (2020).","ieee":"S. Ghosh et al., “One-component order parameter in URu2Si2 uncovered by resonant ultrasound spectroscopy and machine learning,” Science Advances, vol. 6, no. 10. American Association for the Advancement of Science, 2020.","ista":"Ghosh S, Matty M, Baumbach R, Bauer ED, Modic KA, Shekhter A, Mydosh JA, Kim E-A, Ramshaw BJ. 2020. One-component order parameter in URu2Si2 uncovered by resonant ultrasound spectroscopy and machine learning. Science Advances. 6(10), eaaz4074.","chicago":"Ghosh, Sayak, Michael Matty, Ryan Baumbach, Eric D. Bauer, Kimberly A Modic, Arkady Shekhter, J. A. Mydosh, Eun-Ah Kim, and B. J. Ramshaw. “One-Component Order Parameter in URu2Si2 Uncovered by Resonant Ultrasound Spectroscopy and Machine Learning.” Science Advances. American Association for the Advancement of Science, 2020. https://doi.org/10.1126/sciadv.aaz4074."},"extern":"1","quality_controlled":"1","_id":"7084","publication_status":"published"},{"year":"2020","external_id":{"isi":["000546975100017"],"arxiv":["1809.01092"]},"page":"2759-2802","oa":1,"issue":"3","date_updated":"2023-09-18T08:13:15Z","date_published":"2020-10-01T00:00:00Z","month":"10","intvolume":" 52","oa_version":"Preprint","isi":1,"publication":"SIAM Journal on Mathematical Analysis","doi":"10.1137/19M1243440","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1809.01092"}],"day":"01","status":"public","date_created":"2018-12-11T11:44:28Z","volume":52,"article_type":"original","language":[{"iso":"eng"}],"department":[{"_id":"JaMa"}],"publist_id":"7983","article_processing_charge":"No","title":"Scaling limits of discrete optimal transport","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"full_name":"Gladbach, Peter","first_name":"Peter","last_name":"Gladbach"},{"full_name":"Kopfer, Eva","last_name":"Kopfer","first_name":"Eva"},{"last_name":"Maas","orcid":"0000-0002-0845-1338","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","full_name":"Maas, Jan"}],"publisher":"Society for Industrial and Applied Mathematics","publication_status":"published","quality_controlled":"1","_id":"71","scopus_import":"1","abstract":[{"lang":"eng","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."}],"arxiv":1,"type":"journal_article","citation":{"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","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.","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","ista":"Gladbach P, Kopfer E, Maas J. 2020. Scaling limits of discrete optimal transport. SIAM Journal on Mathematical Analysis. 52(3), 2759–2802.","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.","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."},"publication_identifier":{"eissn":["10957154"],"issn":["00361410"]}},{"citation":{"apa":"Shehu, Y., Gibali, A., & Sagratella, S. (2020). Inertial projection-type methods for solving quasi-variational inequalities in real Hilbert spaces. Journal of Optimization Theory and Applications. Springer Nature. https://doi.org/10.1007/s10957-019-01616-6","mla":"Shehu, Yekini, et al. “Inertial Projection-Type Methods for Solving Quasi-Variational Inequalities in Real Hilbert Spaces.” Journal of Optimization Theory and Applications, vol. 184, Springer Nature, 2020, pp. 877–894, doi:10.1007/s10957-019-01616-6.","short":"Y. Shehu, A. Gibali, S. Sagratella, Journal of Optimization Theory and Applications 184 (2020) 877–894.","ieee":"Y. Shehu, A. Gibali, and S. Sagratella, “Inertial projection-type methods for solving quasi-variational inequalities in real Hilbert spaces,” Journal of Optimization Theory and Applications, vol. 184. Springer Nature, pp. 877–894, 2020.","ista":"Shehu Y, Gibali A, Sagratella S. 2020. Inertial projection-type methods for solving quasi-variational inequalities in real Hilbert spaces. Journal of Optimization Theory and Applications. 184, 877–894.","ama":"Shehu Y, Gibali A, Sagratella S. Inertial projection-type methods for solving quasi-variational inequalities in real Hilbert spaces. Journal of Optimization Theory and Applications. 2020;184:877–894. doi:10.1007/s10957-019-01616-6","chicago":"Shehu, Yekini, Aviv Gibali, and Simone Sagratella. “Inertial Projection-Type Methods for Solving Quasi-Variational Inequalities in Real Hilbert Spaces.” Journal of Optimization Theory and Applications. Springer Nature, 2020. https://doi.org/10.1007/s10957-019-01616-6."},"publication_identifier":{"issn":["0022-3239"],"eissn":["1573-2878"]},"scopus_import":"1","abstract":[{"lang":"eng","text":"In this paper, we introduce an inertial projection-type method with different updating strategies for solving quasi-variational inequalities with strongly monotone and Lipschitz continuous operators in real Hilbert spaces. Under standard assumptions, we establish different strong convergence results for the proposed algorithm. Primary numerical experiments demonstrate the potential applicability of our scheme compared with some related methods in the literature."}],"file_date_updated":"2021-03-16T23:30:04Z","type":"journal_article","_id":"7161","quality_controlled":"1","project":[{"grant_number":"616160","call_identifier":"FP7","name":"Discrete Optimization in Computer Vision: Theory and Practice","_id":"25FBA906-B435-11E9-9278-68D0E5697425"}],"publication_status":"published","has_accepted_license":"1","publisher":"Springer Nature","title":"Inertial projection-type methods for solving quasi-variational inequalities in real Hilbert spaces","author":[{"full_name":"Shehu, Yekini","id":"3FC7CB58-F248-11E8-B48F-1D18A9856A87","first_name":"Yekini","orcid":"0000-0001-9224-7139","last_name":"Shehu"},{"first_name":"Aviv","last_name":"Gibali","full_name":"Gibali, Aviv"},{"full_name":"Sagratella, Simone","last_name":"Sagratella","first_name":"Simone"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","file":[{"content_type":"application/pdf","file_id":"8647","creator":"dernst","file_size":332641,"embargo":"2021-03-15","checksum":"9f6dc6c6bf2b48cb3a2091a9ed5feaf2","relation":"main_file","access_level":"open_access","file_name":"2020_JourOptimizationTheoryApplic_Shehu.pdf","date_created":"2020-10-12T10:40:27Z","date_updated":"2021-03-16T23:30:04Z"}],"article_processing_charge":"No","department":[{"_id":"VlKo"}],"language":[{"iso":"eng"}],"article_type":"original","volume":184,"ddc":["518","510","515"],"date_created":"2019-12-09T21:33:44Z","day":"01","status":"public","publication":"Journal of Optimization Theory and Applications","doi":"10.1007/s10957-019-01616-6","ec_funded":1,"oa_version":"Submitted Version","isi":1,"date_published":"2020-03-01T00:00:00Z","month":"03","intvolume":" 184","acknowledgement":"We are grateful to the anonymous referees and editor whose insightful comments helped to considerably improve an earlier version of this paper. The research of the first author is supported by an ERC Grant from the Institute of Science and Technology (IST).","date_updated":"2023-09-06T11:27:15Z","oa":1,"external_id":{"isi":["000511805200009"]},"page":"877–894","year":"2020"},{"publisher":"American Chemical Society","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","author":[{"orcid":"0000-0003-0506-4217","last_name":"Ucar","first_name":"Mehmet C","id":"50B2A802-6007-11E9-A42B-EB23E6697425","full_name":"Ucar, Mehmet C"},{"last_name":"Lipowsky","first_name":"Reinhard","full_name":"Lipowsky, Reinhard"}],"title":"Collective force generation by molecular motors is determined by strain-induced unbinding","department":[{"_id":"EdHa"}],"article_processing_charge":"No","article_type":"letter_note","language":[{"iso":"eng"}],"type":"journal_article","scopus_import":"1","abstract":[{"lang":"eng","text":"In the living cell, we encounter a large variety of motile processes such as organelle transport and cytoskeleton remodeling. These processes are driven by motor proteins that generate force by transducing chemical free energy into mechanical work. In many cases, the molecular motors work in teams to collectively generate larger forces. Recent optical trapping experiments on small teams of cytoskeletal motors indicated that the collectively generated force increases with the size of the motor team but that this increase depends on the motor type and on whether the motors are studied in vitro or in vivo. Here, we use the theory of stochastic processes to describe the motion of N motors in a stationary optical trap and to compute the N-dependence of the collectively generated forces. We consider six distinct motor types, two kinesins, two dyneins, and two myosins. We show that the force increases always linearly with N but with a prefactor that depends on the performance of the single motor. Surprisingly, this prefactor increases for weaker motors with a lower stall force. This counter-intuitive behavior reflects the increased probability with which stronger motors detach from the filament during strain generation. Our theoretical results are in quantitative agreement with experimental data on small teams of kinesin-1 motors."}],"citation":{"mla":"Ucar, Mehmet C., and Reinhard Lipowsky. “Collective Force Generation by Molecular Motors Is Determined by Strain-Induced Unbinding.” Nano Letters, vol. 20, no. 1, American Chemical Society, 2020, pp. 669–76, doi:10.1021/acs.nanolett.9b04445.","apa":"Ucar, M. C., & Lipowsky, R. (2020). Collective force generation by molecular motors is determined by strain-induced unbinding. Nano Letters. American Chemical Society. https://doi.org/10.1021/acs.nanolett.9b04445","chicago":"Ucar, Mehmet C, and Reinhard Lipowsky. “Collective Force Generation by Molecular Motors Is Determined by Strain-Induced Unbinding.” Nano Letters. American Chemical Society, 2020. https://doi.org/10.1021/acs.nanolett.9b04445.","ama":"Ucar MC, Lipowsky R. Collective force generation by molecular motors is determined by strain-induced unbinding. Nano Letters. 2020;20(1):669-676. doi:10.1021/acs.nanolett.9b04445","ista":"Ucar MC, Lipowsky R. 2020. Collective force generation by molecular motors is determined by strain-induced unbinding. Nano Letters. 20(1), 669–676.","short":"M.C. Ucar, R. Lipowsky, Nano Letters 20 (2020) 669–676.","ieee":"M. C. Ucar and R. Lipowsky, “Collective force generation by molecular motors is determined by strain-induced unbinding,” Nano Letters, vol. 20, no. 1. American Chemical Society, pp. 669–676, 2020."},"publication_identifier":{"issn":["1530-6984"],"eissn":["1530-6992"]},"quality_controlled":"1","_id":"7166","publication_status":"published","intvolume":" 20","month":"01","date_published":"2020-01-08T00:00:00Z","issue":"1","oa":1,"date_updated":"2023-08-17T14:07:52Z","page":"669-676","external_id":{"isi":["000507151600087"],"pmid":["31797672"]},"year":"2020","pmid":1,"volume":20,"status":"public","day":"08","date_created":"2019-12-10T15:36:05Z","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1021/acs.nanolett.9b04445"}],"doi":"10.1021/acs.nanolett.9b04445","publication":"Nano Letters","isi":1,"oa_version":"Published Version","related_material":{"record":[{"id":"9726","status":"public","relation":"research_data"},{"id":"9885","relation":"research_data","status":"public"}]}},{"ddc":["519"],"date_created":"2019-12-20T12:26:36Z","day":"12","status":"public","supervisor":[{"orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"}],"degree_awarded":"PhD","doi":"10.15479/AT:ISTA:7196","related_material":{"record":[{"id":"7210","relation":"dissertation_contains","status":"public"},{"id":"5751","status":"public","relation":"dissertation_contains"},{"status":"public","relation":"dissertation_contains","id":"7212"}]},"oa_version":"Published Version","alternative_title":["ISTA Thesis"],"date_published":"2020-01-12T00:00:00Z","month":"01","date_updated":"2023-10-17T12:29:46Z","oa":1,"page":"144","year":"2020","publication_identifier":{"eissn":["2663-337X"]},"citation":{"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.","ama":"Tkadlec J. A role of graphs in evolutionary processes. 2020. doi:10.15479/AT:ISTA:7196","ieee":"J. Tkadlec, “A role of graphs in evolutionary processes,” Institute of Science and Technology Austria, 2020.","short":"J. Tkadlec, A Role of Graphs in Evolutionary Processes, Institute of Science and Technology Austria, 2020.","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."},"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."}],"file_date_updated":"2020-07-14T12:47:52Z","type":"dissertation","_id":"7196","publication_status":"published","has_accepted_license":"1","publisher":"Institute of Science and Technology Austria","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"first_name":"Josef","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1097-9684","last_name":"Tkadlec","full_name":"Tkadlec, Josef"}],"title":"A role of graphs in evolutionary processes","file":[{"relation":"source_file","access_level":"closed","checksum":"451f8e64b0eb26bf297644ac72bfcbe9","creator":"jtkadlec","file_size":21100497,"file_id":"7255","content_type":"application/zip","date_created":"2020-01-12T11:49:49Z","date_updated":"2020-07-14T12:47:52Z","file_name":"thesis.zip"},{"file_name":"2020_Tkadlec_Thesis.pdf","date_created":"2020-01-28T07:32:42Z","date_updated":"2020-07-14T12:47:52Z","content_type":"application/pdf","file_id":"7367","creator":"dernst","file_size":11670983,"relation":"main_file","access_level":"open_access","checksum":"d8c44cbc4f939c49a8efc9d4b8bb3985"}],"article_processing_charge":"No","department":[{"_id":"KrCh"},{"_id":"GradSch"}],"language":[{"iso":"eng"}]},{"publication_status":"published","publication_identifier":{"eissn":["2198-3844"]},"citation":{"chicago":"Li, Yang, Yaping Wang, Shutang Tan, Zhen Li, Zhi Yuan, Matous Glanc, David Domjan, et al. “Root Growth Adaptation Is Mediated by PYLs ABA Receptor-PP2A Protein Phosphatase Complex.” Advanced Science. Wiley, 2020. https://doi.org/10.1002/advs.201901455.","ista":"Li Y, Wang Y, Tan S, Li Z, Yuan Z, Glanc M, Domjan D, Wang K, Xuan W, Guo Y, Gong Z, Friml J, Zhang J. 2020. Root growth adaptation is mediated by PYLs ABA receptor-PP2A protein phosphatase complex. Advanced Science. 7(3), 1901455.","short":"Y. Li, Y. Wang, S. Tan, Z. Li, Z. Yuan, M. Glanc, D. Domjan, K. Wang, W. Xuan, Y. Guo, Z. Gong, J. Friml, J. Zhang, Advanced Science 7 (2020).","ieee":"Y. Li et al., “Root growth adaptation is mediated by PYLs ABA receptor-PP2A protein phosphatase complex,” Advanced Science, vol. 7, no. 3. Wiley, 2020.","ama":"Li Y, Wang Y, Tan S, et al. Root growth adaptation is mediated by PYLs ABA receptor-PP2A protein phosphatase complex. Advanced Science. 2020;7(3). doi:10.1002/advs.201901455","mla":"Li, Yang, et al. “Root Growth Adaptation Is Mediated by PYLs ABA Receptor-PP2A Protein Phosphatase Complex.” Advanced Science, vol. 7, no. 3, 1901455, Wiley, 2020, doi:10.1002/advs.201901455.","apa":"Li, Y., Wang, Y., Tan, S., Li, Z., Yuan, Z., Glanc, M., … Zhang, J. (2020). Root growth adaptation is mediated by PYLs ABA receptor-PP2A protein phosphatase complex. Advanced Science. Wiley. https://doi.org/10.1002/advs.201901455"},"file_date_updated":"2020-07-14T12:47:53Z","type":"journal_article","scopus_import":"1","abstract":[{"lang":"eng","text":"Plant root architecture dynamically adapts to various environmental conditions, such as salt‐containing soil. The phytohormone abscisic acid (ABA) is involved among others also in these developmental adaptations, but the underlying molecular mechanism remains elusive. Here, a novel branch of the ABA signaling pathway in Arabidopsis involving PYR/PYL/RCAR (abbreviated as PYLs) receptor‐protein phosphatase 2A (PP2A) complex that acts in parallel to the canonical PYLs‐protein phosphatase 2C (PP2C) mechanism is identified. The PYLs‐PP2A signaling modulates root gravitropism and lateral root formation through regulating phytohormone auxin transport. In optimal conditions, PYLs ABA receptor interacts with the catalytic subunits of PP2A, increasing their phosphatase activity and thus counteracting PINOID (PID) kinase‐mediated phosphorylation of PIN‐FORMED (PIN) auxin transporters. By contrast, in salt and osmotic stress conditions, ABA binds to PYLs, inhibiting the PP2A activity, which leads to increased PIN phosphorylation and consequently modulated directional auxin transport leading to adapted root architecture. This work reveals an adaptive mechanism that may flexibly adjust plant root growth to withstand saline and osmotic stresses. It occurs via the cross‐talk between the stress hormone ABA and the versatile developmental regulator auxin."}],"_id":"7204","quality_controlled":"1","article_processing_charge":"No","department":[{"_id":"JiFr"}],"language":[{"iso":"eng"}],"article_type":"original","has_accepted_license":"1","publisher":"Wiley","file":[{"date_created":"2020-02-24T14:29:54Z","date_updated":"2020-07-14T12:47:53Z","file_name":"2020_AdvScience_Li.pdf","relation":"main_file","checksum":"016eeab5860860af038e2da95ffe75c3","access_level":"open_access","content_type":"application/pdf","file_id":"7519","creator":"dernst","file_size":3586924}],"title":"Root growth adaptation is mediated by PYLs ABA receptor-PP2A protein phosphatase complex","author":[{"full_name":"Li, Yang","first_name":"Yang","last_name":"Li"},{"last_name":"Wang","first_name":"Yaping","full_name":"Wang, Yaping"},{"orcid":"0000-0002-0471-8285","last_name":"Tan","id":"2DE75584-F248-11E8-B48F-1D18A9856A87","first_name":"Shutang","full_name":"Tan, Shutang"},{"full_name":"Li, Zhen","first_name":"Zhen","last_name":"Li"},{"full_name":"Yuan, Zhi","last_name":"Yuan","first_name":"Zhi"},{"first_name":"Matous","id":"1AE1EA24-02D0-11E9-9BAA-DAF4881429F2","last_name":"Glanc","orcid":"0000-0003-0619-7783","full_name":"Glanc, Matous"},{"full_name":"Domjan, David","orcid":"0000-0003-2267-106X","last_name":"Domjan","first_name":"David","id":"C684CD7A-257E-11EA-9B6F-D8588B4F947F"},{"first_name":"Kai","last_name":"Wang","full_name":"Wang, Kai"},{"full_name":"Xuan, Wei","first_name":"Wei","last_name":"Xuan"},{"last_name":"Guo","first_name":"Yan","full_name":"Guo, Yan"},{"last_name":"Gong","first_name":"Zhizhong","full_name":"Gong, Zhizhong"},{"first_name":"Jiří","id":"4159519E-F248-11E8-B48F-1D18A9856A87","last_name":"Friml","orcid":"0000-0002-8302-7596","full_name":"Friml, Jiří"},{"full_name":"Zhang, Jing","first_name":"Jing","last_name":"Zhang"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","doi":"10.1002/advs.201901455","publication":"Advanced Science","isi":1,"oa_version":"Published Version","pmid":1,"volume":7,"ddc":["580"],"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"date_created":"2019-12-22T23:00:43Z","day":"05","status":"public","external_id":{"isi":["000501912800001"],"pmid":["32042554"]},"year":"2020","intvolume":" 7","month":"02","date_published":"2020-02-05T00:00:00Z","article_number":"1901455","date_updated":"2023-08-17T14:13:17Z","issue":"3","oa":1},{"page":"342-351","external_id":{"pmid":["31724256"],"isi":["000500954800001"]},"year":"2020","date_published":"2020-03-01T00:00:00Z","intvolume":" 33","month":"03","oa":1,"issue":"3","date_updated":"2023-09-06T14:48:57Z","publication":"Journal of Evolutionary Biology","doi":"10.1111/jeb.13570","oa_version":"Published Version","isi":1,"related_material":{"record":[{"id":"13067","relation":"research_data","status":"public"}]},"volume":33,"pmid":1,"status":"public","day":"01","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ddc":["570"],"date_created":"2019-12-22T23:00:43Z","department":[{"_id":"NiBa"}],"article_processing_charge":"No","article_type":"original","language":[{"iso":"eng"}],"publisher":"Wiley","has_accepted_license":"1","author":[{"last_name":"Johannesson","first_name":"Kerstin","full_name":"Johannesson, Kerstin"},{"full_name":"Zagrodzka, Zuzanna","first_name":"Zuzanna","last_name":"Zagrodzka"},{"last_name":"Faria","first_name":"Rui","full_name":"Faria, Rui"},{"first_name":"Anja M","id":"3C147470-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1050-4969","last_name":"Westram","full_name":"Westram, Anja M"},{"full_name":"Butlin, Roger K.","first_name":"Roger K.","last_name":"Butlin"}],"title":"Is embryo abortion a post-zygotic barrier to gene flow between Littorina ecotypes?","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","file":[{"date_created":"2020-09-22T09:42:18Z","date_updated":"2020-09-22T09:42:18Z","file_name":"2020_EvolBiology_Johannesson.pdf","success":1,"relation":"main_file","access_level":"open_access","checksum":"7534ff0839709c0c5265c12d29432f03","file_size":885611,"creator":"dernst","file_id":"8553","content_type":"application/pdf"}],"publication_status":"published","scopus_import":"1","abstract":[{"text":"Genetic incompatibilities contribute to reproductive isolation between many diverging populations, but it is still unclear to what extent they play a role if divergence happens with gene flow. In contact zones between the \"Crab\" and \"Wave\" ecotypes of the snail Littorina saxatilis, divergent selection forms strong barriers to gene flow, while the role of post‐zygotic barriers due to selection against hybrids remains unclear. High embryo abortion rates in this species could indicate the presence of such barriers. Post‐zygotic barriers might include genetic incompatibilities (e.g. Dobzhansky–Muller incompatibilities) but also maladaptation, both expected to be most pronounced in contact zones. In addition, embryo abortion might reflect physiological stress on females and embryos independent of any genetic stress. We examined all embryos of >500 females sampled outside and inside contact zones of three populations in Sweden. Females' clutch size ranged from 0 to 1,011 embryos (mean 130 ± 123), and abortion rates varied between 0% and 100% (mean 12%). We described female genotypes by using a hybrid index based on hundreds of SNPs differentiated between ecotypes with which we characterized female genotypes. We also calculated female SNP heterozygosity and inversion karyotype. Clutch size did not vary with female hybrid index, and abortion rates were only weakly related to hybrid index in two sites but not at all in a third site. No additional variation in abortion rate was explained by female SNP heterozygosity, but increased female inversion heterozygosity added slightly to increased abortion. Our results show only weak and probably biologically insignificant post‐zygotic barriers contributing to ecotype divergence, and the high and variable abortion rates were marginally, if at all, explained by hybrid index of females.","lang":"eng"}],"type":"journal_article","file_date_updated":"2020-09-22T09:42:18Z","citation":{"apa":"Johannesson, K., Zagrodzka, Z., Faria, R., Westram, A. M., & Butlin, R. K. (2020). Is embryo abortion a post-zygotic barrier to gene flow between Littorina ecotypes? Journal of Evolutionary Biology. Wiley. https://doi.org/10.1111/jeb.13570","mla":"Johannesson, Kerstin, et al. “Is Embryo Abortion a Post-Zygotic Barrier to Gene Flow between Littorina Ecotypes?” Journal of Evolutionary Biology, vol. 33, no. 3, Wiley, 2020, pp. 342–51, doi:10.1111/jeb.13570.","ama":"Johannesson K, Zagrodzka Z, Faria R, Westram AM, Butlin RK. Is embryo abortion a post-zygotic barrier to gene flow between Littorina ecotypes? Journal of Evolutionary Biology. 2020;33(3):342-351. doi:10.1111/jeb.13570","ista":"Johannesson K, Zagrodzka Z, Faria R, Westram AM, Butlin RK. 2020. Is embryo abortion a post-zygotic barrier to gene flow between Littorina ecotypes? Journal of Evolutionary Biology. 33(3), 342–351.","short":"K. Johannesson, Z. Zagrodzka, R. Faria, A.M. Westram, R.K. Butlin, Journal of Evolutionary Biology 33 (2020) 342–351.","ieee":"K. Johannesson, Z. Zagrodzka, R. Faria, A. M. Westram, and R. K. Butlin, “Is embryo abortion a post-zygotic barrier to gene flow between Littorina ecotypes?,” Journal of Evolutionary Biology, vol. 33, no. 3. Wiley, pp. 342–351, 2020.","chicago":"Johannesson, Kerstin, Zuzanna Zagrodzka, Rui Faria, Anja M Westram, and Roger K. Butlin. “Is Embryo Abortion a Post-Zygotic Barrier to Gene Flow between Littorina Ecotypes?” Journal of Evolutionary Biology. Wiley, 2020. https://doi.org/10.1111/jeb.13570."},"publication_identifier":{"issn":["1010061X"],"eissn":["14209101"]},"quality_controlled":"1","_id":"7205"},{"quality_controlled":"1","_id":"7207","type":"journal_article","file_date_updated":"2020-09-22T09:47:19Z","abstract":[{"lang":"eng","text":"The hippocampus plays key roles in learning and memory and is a main target of Alzheimer's disease (AD), which causes progressive memory impairments. Despite numerous investigations about the processes required for the normal hippocampal functions, the neurotransmitter receptors involved in the synaptic deficits by which AD disables the hippocampus are not yet characterized. By combining histoblots, western blots, immunohistochemistry and high‐resolution immunoelectron microscopic methods for GABAB receptors, this study provides a quantitative description of the expression and the subcellular localization of GABAB1 in the hippocampus in a mouse model of AD at 1, 6 and 12 months of age. Western blots and histoblots showed that the total amount of protein and the laminar expression pattern of GABAB1 were similar in APP/PS1 mice and in age‐matched wild‐type mice. In contrast, immunoelectron microscopic techniques showed that the subcellular localization of GABAB1 subunit did not change significantly in APP/PS1 mice at 1 month of age, was significantly reduced in the stratum lacunosum‐moleculare of CA1 pyramidal cells at 6 months of age and significantly reduced at the membrane surface of CA1 pyramidal cells at 12 months of age. This reduction of plasma membrane GABAB1 was paralleled by a significant increase of the subunit at the intracellular sites. We further observed a decrease of membrane‐targeted GABAB receptors in axon terminals contacting CA1 pyramidal cells. Our data demonstrate compartment‐ and age‐dependent reduction of plasma membrane‐targeted GABAB receptors in the CA1 region of the hippocampus, suggesting that this decrease might be enough to alter the GABAB‐mediated synaptic transmission taking place in AD."}],"scopus_import":"1","citation":{"short":"A. Martín-Belmonte, C. Aguado, R. Alfaro-Ruíz, A.E. Moreno-Martínez, L. De La Ossa, J. Martínez-Hernández, A. Buisson, S. Früh, B. Bettler, R. Shigemoto, Y. Fukazawa, R. Luján, Brain Pathology 30 (2020) 554–575.","ista":"Martín-Belmonte A, Aguado C, Alfaro-Ruíz R, Moreno-Martínez AE, De La Ossa L, Martínez-Hernández J, Buisson A, Früh S, Bettler B, Shigemoto R, Fukazawa Y, Luján R. 2020. Reduction in the neuronal surface of post and presynaptic GABA>B< receptors in the hippocampus in a mouse model of Alzheimer’s disease. Brain Pathology. 30(3), 554–575.","ieee":"A. Martín-Belmonte et al., “Reduction in the neuronal surface of post and presynaptic GABA>B< receptors in the hippocampus in a mouse model of Alzheimer’s disease,” Brain Pathology, vol. 30, no. 3. Wiley, pp. 554–575, 2020.","ama":"Martín-Belmonte A, Aguado C, Alfaro-Ruíz R, et al. Reduction in the neuronal surface of post and presynaptic GABA>B< receptors in the hippocampus in a mouse model of Alzheimer’s disease. Brain Pathology. 2020;30(3):554-575. doi:10.1111/bpa.12802","chicago":"Martín-Belmonte, Alejandro, Carolina Aguado, Rocío Alfaro-Ruíz, Ana Esther Moreno-Martínez, Luis De La Ossa, José Martínez-Hernández, Alain Buisson, et al. “Reduction in the Neuronal Surface of Post and Presynaptic GABA>B< Receptors in the Hippocampus in a Mouse Model of Alzheimer’s Disease.” Brain Pathology. Wiley, 2020. https://doi.org/10.1111/bpa.12802.","apa":"Martín-Belmonte, A., Aguado, C., Alfaro-Ruíz, R., Moreno-Martínez, A. E., De La Ossa, L., Martínez-Hernández, J., … Luján, R. (2020). Reduction in the neuronal surface of post and presynaptic GABA>B< receptors in the hippocampus in a mouse model of Alzheimer’s disease. Brain Pathology. Wiley. https://doi.org/10.1111/bpa.12802","mla":"Martín-Belmonte, Alejandro, et al. “Reduction in the Neuronal Surface of Post and Presynaptic GABA>B< Receptors in the Hippocampus in a Mouse Model of Alzheimer’s Disease.” Brain Pathology, vol. 30, no. 3, Wiley, 2020, pp. 554–75, doi:10.1111/bpa.12802."},"publication_identifier":{"issn":["10156305"],"eissn":["17503639"]},"publication_status":"published","project":[{"_id":"25CBA828-B435-11E9-9278-68D0E5697425","name":"Human Brain Project Specific Grant Agreement 1 (HBP SGA 1)","call_identifier":"H2020","grant_number":"720270"},{"call_identifier":"H2020","grant_number":"785907","_id":"26436750-B435-11E9-9278-68D0E5697425","name":"Human Brain Project Specific Grant Agreement 2 (HBP SGA 2)"}],"file":[{"success":1,"file_name":"2020_BrainPathology_MartinBelmonte.pdf","date_created":"2020-09-22T09:47:19Z","date_updated":"2020-09-22T09:47:19Z","content_type":"application/pdf","file_id":"8554","file_size":4220935,"creator":"dernst","access_level":"open_access","relation":"main_file","checksum":"549cc1b18f638a21d17a939ba5563fa9"}],"title":"Reduction in the neuronal surface of post and presynaptic GABA>B< receptors in the hippocampus in a mouse model of Alzheimer's disease","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"full_name":"Martín-Belmonte, Alejandro","last_name":"Martín-Belmonte","first_name":"Alejandro"},{"first_name":"Carolina","last_name":"Aguado","full_name":"Aguado, Carolina"},{"last_name":"Alfaro-Ruíz","first_name":"Rocío","full_name":"Alfaro-Ruíz, Rocío"},{"full_name":"Moreno-Martínez, Ana Esther","last_name":"Moreno-Martínez","first_name":"Ana Esther"},{"first_name":"Luis","last_name":"De La Ossa","full_name":"De La Ossa, Luis"},{"full_name":"Martínez-Hernández, José","first_name":"José","last_name":"Martínez-Hernández"},{"full_name":"Buisson, Alain","last_name":"Buisson","first_name":"Alain"},{"first_name":"Simon","last_name":"Früh","full_name":"Früh, Simon"},{"last_name":"Bettler","first_name":"Bernhard","full_name":"Bettler, Bernhard"},{"first_name":"Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","last_name":"Shigemoto","orcid":"0000-0001-8761-9444","full_name":"Shigemoto, Ryuichi"},{"full_name":"Fukazawa, Yugo","last_name":"Fukazawa","first_name":"Yugo"},{"full_name":"Luján, Rafael","last_name":"Luján","first_name":"Rafael"}],"publisher":"Wiley","has_accepted_license":"1","article_type":"original","language":[{"iso":"eng"}],"department":[{"_id":"RySh"}],"article_processing_charge":"No","status":"public","day":"01","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"date_created":"2019-12-22T23:00:43Z","ddc":["570"],"pmid":1,"volume":30,"isi":1,"oa_version":"Published Version","ec_funded":1,"doi":"10.1111/bpa.12802","publication":"Brain Pathology","issue":"3","oa":1,"date_updated":"2023-09-06T14:48:01Z","intvolume":" 30","month":"05","date_published":"2020-05-01T00:00:00Z","year":"2020","page":"554-575","external_id":{"pmid":["31729777"],"isi":["000502270900001"]}},{"has_accepted_license":"1","publisher":"Public Library of Science","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Limits on amplifiers of natural selection under death-Birth updating","author":[{"first_name":"Josef","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1097-9684","last_name":"Tkadlec","full_name":"Tkadlec, Josef"},{"full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722","last_name":"Pavlogiannis","first_name":"Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"first_name":"Martin A.","last_name":"Nowak","full_name":"Nowak, Martin A."}],"file":[{"file_size":1817531,"creator":"dernst","content_type":"application/pdf","file_id":"7441","relation":"main_file","checksum":"ce32ee2d2f53aed832f78bbd47e882df","access_level":"open_access","file_name":"2020_PlosCompBio_Tkadlec.pdf","date_created":"2020-02-03T07:32:42Z","date_updated":"2020-07-14T12:47:53Z"}],"article_processing_charge":"No","department":[{"_id":"KrCh"}],"language":[{"iso":"eng"}],"article_type":"original","publication_identifier":{"eissn":["15537358"]},"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.","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.","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.","short":"J. Tkadlec, A. Pavlogiannis, K. Chatterjee, M.A. Nowak, PLoS Computational Biology 16 (2020).","ama":"Tkadlec J, Pavlogiannis A, Chatterjee K, Nowak MA. Limits on amplifiers of natural selection under death-Birth updating. PLoS computational biology. 2020;16. doi:10.1371/journal.pcbi.1007494","mla":"Tkadlec, Josef, et al. “Limits on Amplifiers of Natural Selection under Death-Birth Updating.” PLoS Computational Biology, vol. 16, e1007494, Public Library of Science, 2020, doi:10.1371/journal.pcbi.1007494.","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"},"scopus_import":"1","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."}],"arxiv":1,"type":"journal_article","file_date_updated":"2020-07-14T12:47:53Z","_id":"7212","quality_controlled":"1","project":[{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7"},{"call_identifier":"FWF","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S11407"}],"publication_status":"published","date_published":"2020-01-17T00:00:00Z","month":"01","intvolume":" 16","article_number":"e1007494","date_updated":"2023-10-17T12:29:47Z","oa":1,"external_id":{"isi":["000510916500025"],"arxiv":["1906.02785"]},"year":"2020","volume":16,"ddc":["000"],"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"date_created":"2019-12-23T13:45:11Z","day":"17","status":"public","publication":"PLoS computational biology","doi":"10.1371/journal.pcbi.1007494","related_material":{"record":[{"id":"7196","status":"public","relation":"part_of_dissertation"}]},"ec_funded":1,"oa_version":"Published Version","isi":1},{"year":"2020","conference":{"end_date":"2019-12-12","start_date":"2019-12-10","name":"COMPLEX: International Conference on Complex Networks and their Applications","location":"Lisbon, Portugal"},"page":"27-39","external_id":{"isi":["000843927300003"]},"oa":1,"date_updated":"2024-02-22T13:16:06Z","alternative_title":["SCI"],"date_published":"2020-01-01T00:00:00Z","intvolume":" 881","month":"01","oa_version":"Submitted Version","ec_funded":1,"isi":1,"publication":"Complex Networks and their applications VIII","doi":"10.1007/978-3-030-36687-2_3","status":"public","day":"01","date_created":"2019-12-29T23:00:45Z","ddc":["004"],"volume":881,"language":[{"iso":"eng"}],"department":[{"_id":"DaAl"}],"article_processing_charge":"No","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","title":"A persistent homology perspective to the link prediction problem","author":[{"first_name":"Sumit","last_name":"Bhatia","full_name":"Bhatia, Sumit"},{"full_name":"Chatterjee, Bapi","orcid":"0000-0002-2742-4028","last_name":"Chatterjee","first_name":"Bapi","id":"3C41A08A-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Nathani, Deepak","first_name":"Deepak","last_name":"Nathani"},{"first_name":"Manohar","last_name":"Kaul","full_name":"Kaul, Manohar"}],"file":[{"success":1,"file_name":"main.pdf","date_created":"2020-10-08T08:16:48Z","date_updated":"2020-10-08T08:16:48Z","content_type":"application/pdf","file_id":"8625","creator":"bchatter","file_size":310598,"access_level":"open_access","checksum":"8951f094c8c7dae9ff8db885199bc296","relation":"main_file"}],"publisher":"Springer Nature","has_accepted_license":"1","publication_status":"published","project":[{"call_identifier":"H2020","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","_id":"7213","scopus_import":"1","abstract":[{"lang":"eng","text":"Persistent homology is a powerful tool in Topological Data Analysis (TDA) to capture the topological properties of data succinctly at different spatial resolutions. For graphical data, the shape, and structure of the neighborhood of individual data items (nodes) are an essential means of characterizing their properties. We propose the use of persistent homology methods to capture structural and topological properties of graphs and use it to address the problem of link prediction. We achieve encouraging results on nine different real-world datasets that attest to the potential of persistent homology-based methods for network analysis."}],"file_date_updated":"2020-10-08T08:16:48Z","type":"conference","publication_identifier":{"eissn":["18609503"],"isbn":["9783030366865"],"issn":["1860949X"]},"citation":{"mla":"Bhatia, Sumit, et al. “A Persistent Homology Perspective to the Link Prediction Problem.” Complex Networks and Their Applications VIII, vol. 881, Springer Nature, 2020, pp. 27–39, doi:10.1007/978-3-030-36687-2_3.","apa":"Bhatia, S., Chatterjee, B., Nathani, D., & Kaul, M. (2020). A persistent homology perspective to the link prediction problem. In Complex Networks and their applications VIII (Vol. 881, pp. 27–39). Lisbon, Portugal: Springer Nature. https://doi.org/10.1007/978-3-030-36687-2_3","chicago":"Bhatia, Sumit, Bapi Chatterjee, Deepak Nathani, and Manohar Kaul. “A Persistent Homology Perspective to the Link Prediction Problem.” In Complex Networks and Their Applications VIII, 881:27–39. Springer Nature, 2020. https://doi.org/10.1007/978-3-030-36687-2_3.","ieee":"S. Bhatia, B. Chatterjee, D. Nathani, and M. Kaul, “A persistent homology perspective to the link prediction problem,” in Complex Networks and their applications VIII, Lisbon, Portugal, 2020, vol. 881, pp. 27–39.","ista":"Bhatia S, Chatterjee B, Nathani D, Kaul M. 2020. A persistent homology perspective to the link prediction problem. Complex Networks and their applications VIII. COMPLEX: International Conference on Complex Networks and their Applications, SCI, vol. 881, 27–39.","short":"S. Bhatia, B. Chatterjee, D. Nathani, M. Kaul, in:, Complex Networks and Their Applications VIII, Springer Nature, 2020, pp. 27–39.","ama":"Bhatia S, Chatterjee B, Nathani D, Kaul M. A persistent homology perspective to the link prediction problem. In: Complex Networks and Their Applications VIII. Vol 881. Springer Nature; 2020:27-39. doi:10.1007/978-3-030-36687-2_3"}}]