[{"month":"08","year":"2021","status":"public","language":[{"iso":"eng"}],"article_processing_charge":"Yes","pmid":1,"day":"31","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","oa_version":"Published Version","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"10293"}]},"quality_controlled":"1","has_accepted_license":"1","external_id":{"isi":["000692406400018"],"pmid":["34465830"]},"volume":11,"oa":1,"keyword":["Multidisciplinary"],"project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818","call_identifier":"H2020"},{"name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","call_identifier":"FWF"}],"doi":"10.1038/s41598-021-96932-1","publication":"Scientific Reports","isi":1,"intvolume":"        11","type":"journal_article","ddc":["003"],"publication_identifier":{"eissn":["2045-2322"]},"author":[{"last_name":"Schmid","id":"38B437DE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6978-7329","first_name":"Laura","full_name":"Schmid, Laura"},{"last_name":"Shati","first_name":"Pouya","full_name":"Shati, Pouya"},{"last_name":"Hilbe","first_name":"Christian","full_name":"Hilbe, Christian"},{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"}],"acknowledgement":"This work was supported by the European Research Council CoG 863818 (ForM-SMArt) (to K.C.) and the European Research Council Starting Grant 850529: E-DIRECT (to C.H.). L.S. received additional partial support by the Austrian Science Fund (FWF) under Grant Z211-N23 (Wittgenstein Award).","file_date_updated":"2021-09-13T10:31:21Z","issue":"1","abstract":[{"lang":"eng","text":"Indirect reciprocity is a mechanism for the evolution of cooperation based on social norms. This mechanism requires that individuals in a population observe and judge each other’s behaviors. Individuals with a good reputation are more likely to receive help from others. Previous work suggests that indirect reciprocity is only effective when all relevant information is reliable and publicly available. Otherwise, individuals may disagree on how to assess others, even if they all apply the same social norm. Such disagreements can lead to a breakdown of cooperation. Here we explore whether the predominantly studied ‘leading eight’ social norms of indirect reciprocity can be made more robust by equipping them with an element of generosity. To this end, we distinguish between two kinds of generosity. According to assessment generosity, individuals occasionally assign a good reputation to group members who would usually be regarded as bad. According to action generosity, individuals occasionally cooperate with group members with whom they would usually defect. Using individual-based simulations, we show that the two kinds of generosity have a very different effect on the resulting reputation dynamics. Assessment generosity tends to add to the overall noise and allows defectors to invade. In contrast, a limited amount of action generosity can be beneficial in a few cases. However, even when action generosity is beneficial, the respective simulations do not result in full cooperation. Our results suggest that while generosity can favor cooperation when individuals use the most simple strategies of reciprocity, it is disadvantageous when individuals use more complex social norms."}],"article_number":"17443","article_type":"original","date_updated":"2025-07-14T09:10:09Z","ec_funded":1,"title":"The evolution of indirect reciprocity under action and assessment generosity","_id":"9997","date_published":"2021-08-31T00:00:00Z","date_created":"2021-09-11T16:22:02Z","publication_status":"published","citation":{"ista":"Schmid L, Shati P, Hilbe C, Chatterjee K. 2021. The evolution of indirect reciprocity under action and assessment generosity. Scientific Reports. 11(1), 17443.","mla":"Schmid, Laura, et al. “The Evolution of Indirect Reciprocity under Action and Assessment Generosity.” <i>Scientific Reports</i>, vol. 11, no. 1, 17443, Springer Nature, 2021, doi:<a href=\"https://doi.org/10.1038/s41598-021-96932-1\">10.1038/s41598-021-96932-1</a>.","chicago":"Schmid, Laura, Pouya Shati, Christian Hilbe, and Krishnendu Chatterjee. “The Evolution of Indirect Reciprocity under Action and Assessment Generosity.” <i>Scientific Reports</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1038/s41598-021-96932-1\">https://doi.org/10.1038/s41598-021-96932-1</a>.","short":"L. Schmid, P. Shati, C. Hilbe, K. Chatterjee, Scientific Reports 11 (2021).","ama":"Schmid L, Shati P, Hilbe C, Chatterjee K. The evolution of indirect reciprocity under action and assessment generosity. <i>Scientific Reports</i>. 2021;11(1). doi:<a href=\"https://doi.org/10.1038/s41598-021-96932-1\">10.1038/s41598-021-96932-1</a>","ieee":"L. Schmid, P. Shati, C. Hilbe, and K. Chatterjee, “The evolution of indirect reciprocity under action and assessment generosity,” <i>Scientific Reports</i>, vol. 11, no. 1. Springer Nature, 2021.","apa":"Schmid, L., Shati, P., Hilbe, C., &#38; Chatterjee, K. (2021). The evolution of indirect reciprocity under action and assessment generosity. <i>Scientific Reports</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41598-021-96932-1\">https://doi.org/10.1038/s41598-021-96932-1</a>"},"department":[{"_id":"GradSch"},{"_id":"KrCh"}],"publisher":"Springer Nature","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"content_type":"application/pdf","file_name":"2021_ScientificReports_Schmid.pdf","date_created":"2021-09-13T10:31:21Z","file_id":"10006","file_size":2424943,"success":1,"creator":"cchlebak","checksum":"19df8816cf958b272b85841565c73182","date_updated":"2021-09-13T10:31:21Z","access_level":"open_access","relation":"main_file"}]},{"ddc":["530"],"publication_identifier":{"eissn":["1420-9020"],"issn":["1022-1824"]},"type":"journal_article","intvolume":"        27","article_type":"original","abstract":[{"lang":"eng","text":"We define quantum equivariant K-theory of Nakajima quiver varieties. We discuss type A in detail as well as its connections with quantum XXZ spin chains and trigonometric Ruijsenaars-Schneider models. Finally we study a limit which produces a K-theoretic version of results of Givental and Kim, connecting quantum geometry of flag varieties and Toda lattice."}],"article_number":"87","date_updated":"2023-08-14T06:34:14Z","acknowledgement":"First of all we would like to thank Andrei Okounkov for invaluable discussions, advises and sharing with us his fantastic viewpoint on modern quantum geometry. We are also grateful to D. Korb and Z. Zhou for their interest and comments. The work of A. Smirnov was supported in part by RFBR Grants under Numbers 15-02-04175 and 15-01-04217 and in part by NSF Grant DMS–2054527. The work of P. Koroteev, A.M. Zeitlin and A. Smirnov is supported in part by AMS Simons travel Grant. A. M. Zeitlin is partially supported by Simons Collaboration Grant, Award ID: 578501. Open access funding provided by Institute of Science and Technology (IST Austria).","author":[{"last_name":"Koroteev","full_name":"Koroteev, Peter","first_name":"Peter"},{"first_name":"Petr","full_name":"Pushkar, Petr","id":"151DCEB6-9EC3-11E9-8480-ABECE5697425","last_name":"Pushkar"},{"last_name":"Smirnov","first_name":"Andrey V.","full_name":"Smirnov, Andrey V."},{"last_name":"Zeitlin","full_name":"Zeitlin, Anton M.","first_name":"Anton M."}],"issue":"5","file_date_updated":"2021-09-13T11:31:34Z","citation":{"ista":"Koroteev P, Pushkar P, Smirnov AV, Zeitlin AM. 2021. Quantum K-theory of quiver varieties and many-body systems. Selecta Mathematica. 27(5), 87.","short":"P. Koroteev, P. Pushkar, A.V. Smirnov, A.M. Zeitlin, Selecta Mathematica 27 (2021).","mla":"Koroteev, Peter, et al. “Quantum K-Theory of Quiver Varieties and Many-Body Systems.” <i>Selecta Mathematica</i>, vol. 27, no. 5, 87, Springer Nature, 2021, doi:<a href=\"https://doi.org/10.1007/s00029-021-00698-3\">10.1007/s00029-021-00698-3</a>.","chicago":"Koroteev, Peter, Petr Pushkar, Andrey V. Smirnov, and Anton M. Zeitlin. “Quantum K-Theory of Quiver Varieties and Many-Body Systems.” <i>Selecta Mathematica</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/s00029-021-00698-3\">https://doi.org/10.1007/s00029-021-00698-3</a>.","apa":"Koroteev, P., Pushkar, P., Smirnov, A. V., &#38; Zeitlin, A. M. (2021). Quantum K-theory of quiver varieties and many-body systems. <i>Selecta Mathematica</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00029-021-00698-3\">https://doi.org/10.1007/s00029-021-00698-3</a>","ama":"Koroteev P, Pushkar P, Smirnov AV, Zeitlin AM. Quantum K-theory of quiver varieties and many-body systems. <i>Selecta Mathematica</i>. 2021;27(5). doi:<a href=\"https://doi.org/10.1007/s00029-021-00698-3\">10.1007/s00029-021-00698-3</a>","ieee":"P. Koroteev, P. Pushkar, A. V. Smirnov, and A. M. Zeitlin, “Quantum K-theory of quiver varieties and many-body systems,” <i>Selecta Mathematica</i>, vol. 27, no. 5. Springer Nature, 2021."},"publication_status":"published","date_created":"2021-09-12T22:01:22Z","title":"Quantum K-theory of quiver varieties and many-body systems","_id":"9998","date_published":"2021-08-30T00:00:00Z","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"content_type":"application/pdf","file_name":"2021_SelectaMath_Koroteev.pdf","date_created":"2021-09-13T11:31:34Z","creator":"cchlebak","file_id":"10010","success":1,"file_size":584648,"date_updated":"2021-09-13T11:31:34Z","checksum":"beadc5a722ffb48190e1e63ee2dbfee5","relation":"main_file","access_level":"open_access"}],"publisher":"Springer Nature","department":[{"_id":"TaHa"}],"day":"30","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","month":"08","article_processing_charge":"Yes (via OA deal)","language":[{"iso":"eng"}],"status":"public","year":"2021","quality_controlled":"1","external_id":{"isi":["000692795200001"]},"has_accepted_license":"1","oa_version":"Published Version","scopus_import":"1","oa":1,"volume":27,"publication":"Selecta Mathematica","isi":1,"doi":"10.1007/s00029-021-00698-3","project":[{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}]},{"oa":1,"volume":10,"publication":"eLife","isi":1,"doi":"10.7554/eLife.66483","keyword":["cell delamination","apical constriction","dragging","mechanical forces","collective 18 locomotion","dorsal forerunner cells","zebrafish"],"project":[{"name":"Interaction and feedback between cell mechanics and fate specification in vertebrate gastrulation","_id":"260F1432-B435-11E9-9278-68D0E5697425","grant_number":"742573","call_identifier":"H2020"}],"day":"27","pmid":1,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","month":"08","article_processing_charge":"Yes","status":"public","language":[{"iso":"eng"}],"year":"2021","quality_controlled":"1","external_id":{"pmid":["34448451"],"isi":["000700428500001"]},"has_accepted_license":"1","oa_version":"Published Version","scopus_import":"1","citation":{"ista":"Pulgar E, Schwayer C, Guerrero N, López L, Márquez S, Härtel S, Soto R, Heisenberg CP, Concha ML. 2021. Apical contacts stemming from incomplete delamination guide progenitor cell allocation through a dragging mechanism. eLife. 10, e66483.","mla":"Pulgar, Eduardo, et al. “Apical Contacts Stemming from Incomplete Delamination Guide Progenitor Cell Allocation through a Dragging Mechanism.” <i>ELife</i>, vol. 10, e66483, eLife Sciences Publications, 2021, doi:<a href=\"https://doi.org/10.7554/eLife.66483\">10.7554/eLife.66483</a>.","chicago":"Pulgar, Eduardo, Cornelia Schwayer, Néstor Guerrero, Loreto López, Susana Márquez, Steffen Härtel, Rodrigo Soto, Carl Philipp Heisenberg, and Miguel L. Concha. “Apical Contacts Stemming from Incomplete Delamination Guide Progenitor Cell Allocation through a Dragging Mechanism.” <i>ELife</i>. eLife Sciences Publications, 2021. <a href=\"https://doi.org/10.7554/eLife.66483\">https://doi.org/10.7554/eLife.66483</a>.","short":"E. Pulgar, C. Schwayer, N. Guerrero, L. López, S. Márquez, S. Härtel, R. Soto, C.P. Heisenberg, M.L. Concha, ELife 10 (2021).","ama":"Pulgar E, Schwayer C, Guerrero N, et al. Apical contacts stemming from incomplete delamination guide progenitor cell allocation through a dragging mechanism. <i>eLife</i>. 2021;10. doi:<a href=\"https://doi.org/10.7554/eLife.66483\">10.7554/eLife.66483</a>","ieee":"E. Pulgar <i>et al.</i>, “Apical contacts stemming from incomplete delamination guide progenitor cell allocation through a dragging mechanism,” <i>eLife</i>, vol. 10. eLife Sciences Publications, 2021.","apa":"Pulgar, E., Schwayer, C., Guerrero, N., López, L., Márquez, S., Härtel, S., … Concha, M. L. (2021). Apical contacts stemming from incomplete delamination guide progenitor cell allocation through a dragging mechanism. <i>ELife</i>. eLife Sciences Publications. <a href=\"https://doi.org/10.7554/eLife.66483\">https://doi.org/10.7554/eLife.66483</a>"},"publication_status":"published","date_created":"2021-09-12T22:01:23Z","ec_funded":1,"title":"Apical contacts stemming from incomplete delamination guide progenitor cell allocation through a dragging mechanism","date_published":"2021-08-27T00:00:00Z","_id":"9999","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"content_type":"application/pdf","file_name":"2021_eLife_Pulgar.pdf","date_created":"2022-05-13T08:03:37Z","creator":"dernst","file_id":"11371","success":1,"file_size":9010446,"checksum":"a3f82b0499cc822ac1eab48a01f3f57e","date_updated":"2022-05-13T08:03:37Z","relation":"main_file","access_level":"open_access"}],"publisher":"eLife Sciences Publications","department":[{"_id":"CaHe"}],"ddc":["570"],"publication_identifier":{"eissn":["2050-084X"]},"type":"journal_article","intvolume":"        10","article_type":"original","abstract":[{"lang":"eng","text":"The developmental strategies used by progenitor cells to endure a safe journey from their induction place towards the site of terminal differentiation are still poorly understood. Here we uncovered a progenitor cell allocation mechanism that stems from an incomplete process of epithelial delamination that allows progenitors to coordinate their movement with adjacent extra-embryonic tissues. Progenitors of the zebrafish laterality organ originate from the surface epithelial enveloping layer by an apical constriction process of cell delamination. During this process, progenitors retain long-term apical contacts that enable the epithelial layer to pull a subset of progenitors along their way towards the vegetal pole. The remaining delaminated progenitors follow apically-attached progenitors’ movement by a co-attraction mechanism, avoiding sequestration by the adjacent endoderm, ensuring their fate and collective allocation at the differentiation site. Thus, we reveal that incomplete delamination serves as a cellular platform for coordinated tissue movements during development. Impact Statement: Incomplete delamination serves as a cellular platform for coordinated tissue movements during development, guiding newly formed progenitor cell groups to the differentiation site."}],"article_number":"e66483","date_updated":"2023-08-14T06:53:33Z","author":[{"last_name":"Pulgar","full_name":"Pulgar, Eduardo","first_name":"Eduardo"},{"orcid":"0000-0001-5130-2226","full_name":"Schwayer, Cornelia","first_name":"Cornelia","id":"3436488C-F248-11E8-B48F-1D18A9856A87","last_name":"Schwayer"},{"first_name":"Néstor","full_name":"Guerrero, Néstor","last_name":"Guerrero"},{"last_name":"López","full_name":"López, Loreto","first_name":"Loreto"},{"full_name":"Márquez, Susana","first_name":"Susana","last_name":"Márquez"},{"first_name":"Steffen","full_name":"Härtel, Steffen","last_name":"Härtel"},{"last_name":"Soto","first_name":"Rodrigo","full_name":"Soto, Rodrigo"},{"full_name":"Heisenberg, Carl Philipp","first_name":"Carl Philipp","last_name":"Heisenberg"},{"last_name":"Concha","first_name":"Miguel L.","full_name":"Concha, Miguel L."}],"file_date_updated":"2022-05-13T08:03:37Z"},{"department":[{"_id":"MiSi"}],"publisher":"Elsevier","date_created":"2022-03-08T07:51:04Z","publication_status":"published","citation":{"ieee":"S. Stahnke <i>et al.</i>, “Loss of Hem1 disrupts macrophage function and impacts migration, phagocytosis, and integrin-mediated adhesion,” <i>Current Biology</i>, vol. 31, no. 10. Elsevier, p. 2051–2064.e8, 2021.","ama":"Stahnke S, Döring H, Kusch C, et al. Loss of Hem1 disrupts macrophage function and impacts migration, phagocytosis, and integrin-mediated adhesion. <i>Current Biology</i>. 2021;31(10):2051-2064.e8. doi:<a href=\"https://doi.org/10.1016/j.cub.2021.02.043\">10.1016/j.cub.2021.02.043</a>","apa":"Stahnke, S., Döring, H., Kusch, C., de Gorter, D. J. J., Dütting, S., Guledani, A., … Stradal, T. E. B. (2021). Loss of Hem1 disrupts macrophage function and impacts migration, phagocytosis, and integrin-mediated adhesion. <i>Current Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.cub.2021.02.043\">https://doi.org/10.1016/j.cub.2021.02.043</a>","chicago":"Stahnke, Stephanie, Hermann Döring, Charly Kusch, David J.J. de Gorter, Sebastian Dütting, Aleks Guledani, Irina Pleines, et al. “Loss of Hem1 Disrupts Macrophage Function and Impacts Migration, Phagocytosis, and Integrin-Mediated Adhesion.” <i>Current Biology</i>. Elsevier, 2021. <a href=\"https://doi.org/10.1016/j.cub.2021.02.043\">https://doi.org/10.1016/j.cub.2021.02.043</a>.","mla":"Stahnke, Stephanie, et al. “Loss of Hem1 Disrupts Macrophage Function and Impacts Migration, Phagocytosis, and Integrin-Mediated Adhesion.” <i>Current Biology</i>, vol. 31, no. 10, Elsevier, 2021, p. 2051–2064.e8, doi:<a href=\"https://doi.org/10.1016/j.cub.2021.02.043\">10.1016/j.cub.2021.02.043</a>.","short":"S. Stahnke, H. Döring, C. Kusch, D.J.J. de Gorter, S. Dütting, A. Guledani, I. Pleines, M. Schnoor, M.K. Sixt, R. Geffers, M. Rohde, M. Müsken, F. Kage, A. Steffen, J. Faix, B. Nieswandt, K. Rottner, T.E.B. Stradal, Current Biology 31 (2021) 2051–2064.e8.","ista":"Stahnke S, Döring H, Kusch C, de Gorter DJJ, Dütting S, Guledani A, Pleines I, Schnoor M, Sixt MK, Geffers R, Rohde M, Müsken M, Kage F, Steffen A, Faix J, Nieswandt B, Rottner K, Stradal TEB. 2021. Loss of Hem1 disrupts macrophage function and impacts migration, phagocytosis, and integrin-mediated adhesion. Current Biology. 31(10), 2051–2064.e8."},"_id":"10834","date_published":"2021-05-24T00:00:00Z","title":"Loss of Hem1 disrupts macrophage function and impacts migration, phagocytosis, and integrin-mediated adhesion","date_updated":"2023-08-17T07:01:14Z","abstract":[{"text":"Hematopoietic-specific protein 1 (Hem1) is an essential subunit of the WAVE regulatory complex (WRC) in immune cells. WRC is crucial for Arp2/3 complex activation and the protrusion of branched actin filament networks. Moreover, Hem1 loss of function in immune cells causes autoimmune diseases in humans. Here, we show that genetic removal of Hem1 in macrophages diminishes frequency and efficacy of phagocytosis as well as phagocytic cup formation in addition to defects in lamellipodial protrusion and migration. Moreover, Hem1-null macrophages displayed strong defects in cell adhesion despite unaltered podosome formation and concomitant extracellular matrix degradation. Specifically, dynamics of both adhesion and de-adhesion as well as concomitant phosphorylation of paxillin and focal adhesion kinase (FAK) were significantly compromised. Accordingly, disruption of WRC function in non-hematopoietic cells coincided with both defects in adhesion turnover and altered FAK and paxillin phosphorylation. Consistently, platelets exhibited reduced adhesion and diminished integrin αIIbβ3 activation upon WRC removal. Interestingly, adhesion phenotypes, but not lamellipodia formation, were partially rescued by small molecule activation of FAK. A full rescue of the phenotype, including lamellipodia formation, required not only the presence of WRCs but also their binding to and activation by Rac. Collectively, our results uncover that WRC impacts on integrin-dependent processes in a FAK-dependent manner, controlling formation and dismantling of adhesions, relevant for properly grabbing onto extracellular surfaces and particles during cell edge expansion, like in migration or phagocytosis.","lang":"eng"}],"page":"2051-2064.e8","article_type":"original","issue":"10","main_file_link":[{"url":"https://doi.org/10.1101/2020.03.24.005835","open_access":"1"}],"acknowledgement":"We are grateful to Silvia Prettin, Ina Schleicher, and Petra Hagendorff for expert technical assistance; David Dettbarn for animal keeping and breeding; and Lothar Gröbe and Maria Höxter for cell sorting. We also thank Werner Tegge for peptides and Giorgio Scita for antibodies. This work was supported, in part, by the Deutsche Forschungsgemeinschaft (DFG), Priority Programm SPP1150 (to T.E.B.S., K.R., and M. Sixt), and by DFG grant GRK2223/1 (to K.R.). T.E.B.S. acknowledges support by the Helmholtz Society through HGF impulse fund W2/W3-066 and M. Schnoor by the Mexican Council for Science and Technology (CONACyT, 284292 ), Fund SEP-Cinvestav ( 108 ), and the Royal Society, UK (Newton Advanced Fellowship, NAF/R1/180017 ).","author":[{"last_name":"Stahnke","full_name":"Stahnke, Stephanie","first_name":"Stephanie"},{"first_name":"Hermann","full_name":"Döring, Hermann","last_name":"Döring"},{"last_name":"Kusch","full_name":"Kusch, Charly","first_name":"Charly"},{"last_name":"de Gorter","first_name":"David J.J.","full_name":"de Gorter, David J.J."},{"last_name":"Dütting","full_name":"Dütting, Sebastian","first_name":"Sebastian"},{"last_name":"Guledani","full_name":"Guledani, Aleks","first_name":"Aleks"},{"full_name":"Pleines, Irina","first_name":"Irina","last_name":"Pleines"},{"last_name":"Schnoor","full_name":"Schnoor, Michael","first_name":"Michael"},{"id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","last_name":"Sixt","full_name":"Sixt, Michael K","first_name":"Michael K","orcid":"0000-0002-6620-9179"},{"last_name":"Geffers","full_name":"Geffers, Robert","first_name":"Robert"},{"last_name":"Rohde","full_name":"Rohde, Manfred","first_name":"Manfred"},{"first_name":"Mathias","full_name":"Müsken, Mathias","last_name":"Müsken"},{"full_name":"Kage, Frieda","first_name":"Frieda","last_name":"Kage"},{"full_name":"Steffen, Anika","first_name":"Anika","last_name":"Steffen"},{"full_name":"Faix, Jan","first_name":"Jan","last_name":"Faix"},{"full_name":"Nieswandt, Bernhard","first_name":"Bernhard","last_name":"Nieswandt"},{"first_name":"Klemens","full_name":"Rottner, Klemens","last_name":"Rottner"},{"first_name":"Theresia E.B.","full_name":"Stradal, Theresia E.B.","last_name":"Stradal"}],"publication_identifier":{"issn":["0960-9822"]},"type":"journal_article","intvolume":"        31","isi":1,"publication":"Current Biology","keyword":["General Agricultural and Biological Sciences","General Biochemistry","Genetics and Molecular Biology"],"doi":"10.1016/j.cub.2021.02.043","volume":31,"oa":1,"external_id":{"isi":["000654652200002"],"pmid":["33711252"]},"quality_controlled":"1","scopus_import":"1","oa_version":"Preprint","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","pmid":1,"day":"24","language":[{"iso":"eng"}],"year":"2021","status":"public","article_processing_charge":"No","month":"05"},{"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","day":"01","pmid":1,"article_processing_charge":"No","language":[{"iso":"eng"}],"year":"2021","status":"public","month":"05","external_id":{"pmid":["32990982"],"isi":["000577708800001"]},"has_accepted_license":"1","quality_controlled":"1","scopus_import":"1","oa_version":"Published Version","oa":1,"volume":76,"isi":1,"publication":"Allergy","doi":"10.1111/all.14604","keyword":["Immunology","Immunology and Allergy"],"publication_identifier":{"issn":["0105-4538"],"eissn":["1398-9995"]},"ddc":["570"],"intvolume":"        76","type":"journal_article","date_updated":"2023-09-05T15:58:53Z","article_type":"letter_note","page":"1553-1556","issue":"5","file_date_updated":"2022-03-08T11:23:16Z","acknowledgement":"This  work  was  supported  by  the  Austrian  Science  Fund  (FWF)  grants  MCCA  W1248-B30  and  SFB  F4606-B28  to  EJJ.  CP  received  a  short-term research fellowship of the European Federation of Immunological Societies  (EFIS-IL)  for  a  research  visit  at  Biocruces  Bizkaia  Health  Research  Institute,  Barakaldo,  Spain.  VKK  received  an  EFIS-IL  short-term  research  fellowship  for  a  research  visit  at  King’s  College  London.  The research was funded by the National Institute for Health Research (NIHR) Biomedical Research Centre (BRC) based at Guy's and St Thomas' NHS Foundation Trust and King's College London (IS-BRC-1215-20006) (SNK).  The  authors  acknowledge  support  by  the  Medical  Research  Council (MR/L023091/1) (SNK); Breast Cancer Now (147; KCL-BCN-Q3)(SNK); Cancer Research UK (C30122/A11527; C30122/A15774) (SNK); Cancer  Research  UK  King's  Health  Partners  Centre  at  King's  College  London   (C604/A25135)   (SNK);   CRUK/NIHR   in   England/DoH   for   Scotland,  Wales  and  Northern  Ireland  Experimental  Cancer  Medicine  Centre  (C10355/A15587)  (SNK).  The  views  expressed  are  those  of  the  author(s)  and  not  necessarily  those  of  the  NHS,  the  NIHR  or  the  Department  of  Health.  Additionally,  this  work  was  funded  by  Instituto  de  Salud  Carlos  III  through  the  project  \"PI16/01223\"  (Co-funded  by  European Regional Development Fund; “A way to make Europe”) to FB and  by  the  Department  of  Health,  Basque  Government  through  the  project “2019111031” to OZ. OZ is recipient of a Sara Borrell 2017 post-doctoral contract “CD17/00128” funded by Instituto de Salud Carlos III (Co-funded by European Social Fund; “Investing in your future”).","author":[{"last_name":"Pranger","full_name":"Pranger, Christina L.","first_name":"Christina L."},{"id":"36432834-F248-11E8-B48F-1D18A9856A87","last_name":"Fazekas-Singer","first_name":"Judit","full_name":"Fazekas-Singer, Judit","orcid":"0000-0002-8777-3502"},{"last_name":"Köhler","first_name":"Verena K.","full_name":"Köhler, Verena K."},{"last_name":"Pali‐Schöll","first_name":"Isabella","full_name":"Pali‐Schöll, Isabella"},{"full_name":"Fiocchi, Alessandro","first_name":"Alessandro","last_name":"Fiocchi"},{"first_name":"Sophia N.","full_name":"Karagiannis, Sophia N.","last_name":"Karagiannis"},{"first_name":"Olatz","full_name":"Zenarruzabeitia, Olatz","last_name":"Zenarruzabeitia"},{"last_name":"Borrego","full_name":"Borrego, Francisco","first_name":"Francisco"},{"last_name":"Jensen‐Jarolim","first_name":"Erika","full_name":"Jensen‐Jarolim, Erika"}],"publication_status":"published","citation":{"ista":"Pranger CL, Singer J, Köhler VK, Pali‐Schöll I, Fiocchi A, Karagiannis SN, Zenarruzabeitia O, Borrego F, Jensen‐Jarolim E. 2021. PIPE‐cloned human IgE and IgG4 antibodies: New tools for investigating cow’s milk allergy and tolerance. Allergy. 76(5), 1553–1556.","apa":"Pranger, C. L., Singer, J., Köhler, V. K., Pali‐Schöll, I., Fiocchi, A., Karagiannis, S. N., … Jensen‐Jarolim, E. (2021). PIPE‐cloned human IgE and IgG4 antibodies: New tools for investigating cow’s milk allergy and tolerance. <i>Allergy</i>. Wiley. <a href=\"https://doi.org/10.1111/all.14604\">https://doi.org/10.1111/all.14604</a>","ieee":"C. L. Pranger <i>et al.</i>, “PIPE‐cloned human IgE and IgG4 antibodies: New tools for investigating cow’s milk allergy and tolerance,” <i>Allergy</i>, vol. 76, no. 5. Wiley, pp. 1553–1556, 2021.","ama":"Pranger CL, Singer J, Köhler VK, et al. PIPE‐cloned human IgE and IgG4 antibodies: New tools for investigating cow’s milk allergy and tolerance. <i>Allergy</i>. 2021;76(5):1553-1556. doi:<a href=\"https://doi.org/10.1111/all.14604\">10.1111/all.14604</a>","short":"C.L. Pranger, J. Singer, V.K. Köhler, I. Pali‐Schöll, A. Fiocchi, S.N. Karagiannis, O. Zenarruzabeitia, F. Borrego, E. Jensen‐Jarolim, Allergy 76 (2021) 1553–1556.","mla":"Pranger, Christina L., et al. “PIPE‐cloned Human IgE and IgG4 Antibodies: New Tools for Investigating Cow’s Milk Allergy and Tolerance.” <i>Allergy</i>, vol. 76, no. 5, Wiley, 2021, pp. 1553–56, doi:<a href=\"https://doi.org/10.1111/all.14604\">10.1111/all.14604</a>.","chicago":"Pranger, Christina L., Judit Singer, Verena K. Köhler, Isabella Pali‐Schöll, Alessandro Fiocchi, Sophia N. Karagiannis, Olatz Zenarruzabeitia, Francisco Borrego, and Erika Jensen‐Jarolim. “PIPE‐cloned Human IgE and IgG4 Antibodies: New Tools for Investigating Cow’s Milk Allergy and Tolerance.” <i>Allergy</i>. Wiley, 2021. <a href=\"https://doi.org/10.1111/all.14604\">https://doi.org/10.1111/all.14604</a>."},"date_created":"2022-03-08T11:19:05Z","date_published":"2021-05-01T00:00:00Z","_id":"10836","title":"PIPE‐cloned human IgE and IgG4 antibodies: New tools for investigating cow's milk allergy and tolerance","file":[{"file_name":"2021_Allergy_Pranger.pdf","date_created":"2022-03-08T11:23:16Z","content_type":"application/pdf","checksum":"9526f9554112fc027c9f7fa540c488cd","date_updated":"2022-03-08T11:23:16Z","relation":"main_file","access_level":"open_access","creator":"dernst","file_id":"10837","success":1,"file_size":626081}],"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publisher":"Wiley","department":[{"_id":"Bio"}]},{"title":"Using replicate hybrid zones to understand the genomic basis of adaptive divergence","date_published":"2021-08-01T00:00:00Z","_id":"10838","citation":{"ista":"Westram AM, Faria R, Johannesson K, Butlin R. 2021. Using replicate hybrid zones to understand the genomic basis of adaptive divergence. Molecular Ecology. 30(15), 3797–3814.","chicago":"Westram, Anja M, Rui Faria, Kerstin Johannesson, and Roger Butlin. “Using Replicate Hybrid Zones to Understand the Genomic Basis of Adaptive Divergence.” <i>Molecular Ecology</i>. Wiley, 2021. <a href=\"https://doi.org/10.1111/mec.15861\">https://doi.org/10.1111/mec.15861</a>.","mla":"Westram, Anja M., et al. “Using Replicate Hybrid Zones to Understand the Genomic Basis of Adaptive Divergence.” <i>Molecular Ecology</i>, vol. 30, no. 15, Wiley, 2021, pp. 3797–814, doi:<a href=\"https://doi.org/10.1111/mec.15861\">10.1111/mec.15861</a>.","short":"A.M. Westram, R. Faria, K. Johannesson, R. Butlin, Molecular Ecology 30 (2021) 3797–3814.","ieee":"A. M. Westram, R. Faria, K. Johannesson, and R. Butlin, “Using replicate hybrid zones to understand the genomic basis of adaptive divergence,” <i>Molecular Ecology</i>, vol. 30, no. 15. Wiley, pp. 3797–3814, 2021.","ama":"Westram AM, Faria R, Johannesson K, Butlin R. Using replicate hybrid zones to understand the genomic basis of adaptive divergence. <i>Molecular Ecology</i>. 2021;30(15):3797-3814. doi:<a href=\"https://doi.org/10.1111/mec.15861\">10.1111/mec.15861</a>","apa":"Westram, A. M., Faria, R., Johannesson, K., &#38; Butlin, R. (2021). Using replicate hybrid zones to understand the genomic basis of adaptive divergence. <i>Molecular Ecology</i>. Wiley. <a href=\"https://doi.org/10.1111/mec.15861\">https://doi.org/10.1111/mec.15861</a>"},"publication_status":"published","date_created":"2022-03-08T11:28:32Z","publisher":"Wiley","department":[{"_id":"BeVi"}],"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"access_level":"open_access","relation":"main_file","date_updated":"2022-03-08T11:31:30Z","checksum":"d5611f243ceb63a0e091d6662ebd9cda","file_id":"10839","success":1,"file_size":1726548,"creator":"dernst","date_created":"2022-03-08T11:31:30Z","file_name":"2021_MolecularEcology_Westram.pdf","content_type":"application/pdf"}],"intvolume":"        30","type":"journal_article","ddc":["570"],"publication_identifier":{"eissn":["1365-294X"],"issn":["0962-1083"]},"author":[{"first_name":"Anja M","full_name":"Westram, Anja M","orcid":"0000-0003-1050-4969","id":"3C147470-F248-11E8-B48F-1D18A9856A87","last_name":"Westram"},{"last_name":"Faria","first_name":"Rui","full_name":"Faria, Rui"},{"full_name":"Johannesson, Kerstin","first_name":"Kerstin","last_name":"Johannesson"},{"last_name":"Butlin","first_name":"Roger","full_name":"Butlin, Roger"}],"acknowledgement":"We thank everyone who helped with fieldwork, snail processing and DNA extractions, particularly Laura Brettell, Mårten Duvetorp, Juan Galindo, Anne-Lise Liabot, Mark Ravinet, Irena Senčić and Zuzanna Zagrodzka. We are also grateful to Edinburgh Genomics for library preparation and sequencing, to Stuart Baird and Mark Ravinet for helpful discussions, and to three anonymous reviewers for their constructive comments. This work was supported by the Natural Environment Research Council (NE/K014021/1), the European Research Council (AdG-693030-BARRIERS), Swedish Research Councils Formas and Vetenskapsrådet through a Linnaeus grant to the Centre for Marine Evolutionary Biology (217-2008-1719), the European Regional Development Fund (POCI-01-0145-FEDER-030628), and the Fundação para a iência e a Tecnologia,\r\nPortugal (PTDC/BIA-EVL/\r\n30628/2017). A.M.W. and R.F. were\r\nfunded by the European Union’s Horizon 2020 research and innovation\r\nprogramme under Marie Skłodowska-Curie\r\ngrant agreements\r\nno. 754411/797747 and no. 706376, respectively.","issue":"15","file_date_updated":"2022-03-08T11:31:30Z","page":"3797-3814","abstract":[{"lang":"eng","text":"Combining hybrid zone analysis with genomic data is a promising approach to understanding the genomic basis of adaptive divergence. It allows for the identification of genomic regions underlying barriers to gene flow. It also provides insights into spatial patterns of allele frequency change, informing about the interplay between environmental factors, dispersal and selection. However, when only a single hybrid zone is analysed, it is difficult to separate patterns generated by selection from those resulting from chance. Therefore, it is beneficial to look for repeatable patterns across replicate hybrid zones in the same system. We applied this approach to the marine snail Littorina saxatilis, which contains two ecotypes, adapted to wave-exposed rocks vs. high-predation boulder fields. The existence of numerous hybrid zones between ecotypes offered the opportunity to test for the repeatability of genomic architectures and spatial patterns of divergence. We sampled and phenotyped snails from seven replicate hybrid zones on the Swedish west coast and genotyped them for thousands of single nucleotide polymorphisms. Shell shape and size showed parallel clines across all zones. Many genomic regions showing steep clines and/or high differentiation were shared among hybrid zones, consistent with a common evolutionary history and extensive gene flow between zones, and supporting the importance of these regions for divergence. In particular, we found that several large putative inversions contribute to divergence in all locations. Additionally, we found evidence for consistent displacement of clines from the boulder–rock transition. Our results demonstrate patterns of spatial variation that would not be accessible without continuous spatial sampling, a large genomic data set and replicate hybrid zones."}],"article_type":"original","date_updated":"2023-09-05T16:02:19Z","oa":1,"volume":30,"doi":"10.1111/mec.15861","keyword":["Genetics","Ecology","Evolution","Behavior and Systematics"],"publication":"Molecular Ecology","isi":1,"month":"08","article_processing_charge":"No","status":"public","year":"2021","language":[{"iso":"eng"}],"day":"01","pmid":1,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa_version":"Published Version","scopus_import":"1","quality_controlled":"1","external_id":{"pmid":["33638231"],"isi":["000669439700001"]},"has_accepted_license":"1"},{"publication":"30th International Joint Conference on Artificial Intelligence","doi":"10.24963/ijcai.2021/575","project":[{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","grant_number":"863818"}],"oa":1,"quality_controlled":"1","oa_version":"Published Version","scopus_import":"1","day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"09","article_processing_charge":"No","status":"public","language":[{"iso":"eng"}],"year":"2021","publisher":"International Joint Conferences on Artificial Intelligence","department":[{"_id":"KrCh"}],"citation":{"ista":"Tomášek P, Horák K, Aradhye A, Bošanský B, Chatterjee K. 2021. Solving partially observable stochastic shortest-path games. 30th International Joint Conference on Artificial Intelligence. IJCAI: International Joint Conferences on Artificial Intelligence Organization, 4182–4189.","ama":"Tomášek P, Horák K, Aradhye A, Bošanský B, Chatterjee K. Solving partially observable stochastic shortest-path games. In: <i>30th International Joint Conference on Artificial Intelligence</i>. International Joint Conferences on Artificial Intelligence; 2021:4182-4189. doi:<a href=\"https://doi.org/10.24963/ijcai.2021/575\">10.24963/ijcai.2021/575</a>","ieee":"P. Tomášek, K. Horák, A. Aradhye, B. Bošanský, and K. Chatterjee, “Solving partially observable stochastic shortest-path games,” in <i>30th International Joint Conference on Artificial Intelligence</i>, Virtual, Online, 2021, pp. 4182–4189.","apa":"Tomášek, P., Horák, K., Aradhye, A., Bošanský, B., &#38; Chatterjee, K. (2021). Solving partially observable stochastic shortest-path games. In <i>30th International Joint Conference on Artificial Intelligence</i> (pp. 4182–4189). Virtual, Online: International Joint Conferences on Artificial Intelligence. <a href=\"https://doi.org/10.24963/ijcai.2021/575\">https://doi.org/10.24963/ijcai.2021/575</a>","chicago":"Tomášek, Petr, Karel Horák, Aditya Aradhye, Branislav Bošanský, and Krishnendu Chatterjee. “Solving Partially Observable Stochastic Shortest-Path Games.” In <i>30th International Joint Conference on Artificial Intelligence</i>, 4182–89. International Joint Conferences on Artificial Intelligence, 2021. <a href=\"https://doi.org/10.24963/ijcai.2021/575\">https://doi.org/10.24963/ijcai.2021/575</a>.","mla":"Tomášek, Petr, et al. “Solving Partially Observable Stochastic Shortest-Path Games.” <i>30th International Joint Conference on Artificial Intelligence</i>, International Joint Conferences on Artificial Intelligence, 2021, pp. 4182–89, doi:<a href=\"https://doi.org/10.24963/ijcai.2021/575\">10.24963/ijcai.2021/575</a>.","short":"P. Tomášek, K. Horák, A. Aradhye, B. Bošanský, K. Chatterjee, in:, 30th International Joint Conference on Artificial Intelligence, International Joint Conferences on Artificial Intelligence, 2021, pp. 4182–4189."},"publication_status":"published","date_created":"2022-03-13T23:01:47Z","ec_funded":1,"title":"Solving partially observable stochastic shortest-path games","date_published":"2021-09-01T00:00:00Z","_id":"10847","conference":{"end_date":"2021-08-27","start_date":"2021-08-19","name":"IJCAI: International Joint Conferences on Artificial Intelligence Organization","location":"Virtual, Online"},"abstract":[{"lang":"eng","text":"We study the two-player zero-sum extension of the partially observable stochastic shortest-path problem where one agent has only partial information about the environment. We formulate this problem as a partially observable stochastic game (POSG): given a set of target states and negative rewards for each transition, the player with imperfect information maximizes the expected undiscounted total reward until a target state is reached. The second player with the perfect information aims for the opposite. We base our formalism on POSGs with one-sided observability (OS-POSGs) and give the following contributions: (1) we introduce a novel heuristic search value iteration algorithm that iteratively solves depth-limited variants of the game, (2) we derive the bound on the depth guaranteeing an arbitrary precision, (3) we propose a novel upper-bound estimation that allows early terminations, and (4) we experimentally evaluate the algorithm on a pursuit-evasion game."}],"page":"4182-4189","date_updated":"2025-07-14T09:10:13Z","acknowledgement":"This research was supported by the Czech Science Foundation (no. 19-24384Y), by the OP VVV MEYS funded project CZ.02.1.01/0.0/0.0/16 019/0000765 “Research Center for Informatics”, by the ERC CoG 863818 (ForM-SMArt), and by the Combat Capabilities Development Command Army Research Laboratory and was accomplished under Cooperative\r\nAgreement Number W911NF-13-2-0045 (ARL Cyber Security CRA). The views and conclusions contained in this document are those of the authors and should not be interpreted as\r\nrepresenting the official policies, either expressed or implied, of the Combat Capabilities Development Command Army Research Laboratory or the U.S. Government. The U.S. Government is authorized to reproduce and distribute reprints for Government purposes not withstanding any copyright notation here on. ","author":[{"full_name":"Tomášek, Petr","first_name":"Petr","last_name":"Tomášek"},{"full_name":"Horák, Karel","first_name":"Karel","last_name":"Horák"},{"last_name":"Aradhye","full_name":"Aradhye, Aditya","first_name":"Aditya"},{"last_name":"Bošanský","first_name":"Branislav","full_name":"Bošanský, Branislav"},{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.24963/ijcai.2021/575"}],"publication_identifier":{"isbn":["9780999241196"],"issn":["1045-0823"]},"type":"conference"},{"publisher":"World Scientific Publishing","department":[{"_id":"RoSe"}],"date_published":"2021-02-01T00:00:00Z","_id":"10852","ec_funded":1,"title":"The polaron at strong coupling","publication_status":"published","citation":{"ista":"Seiringer R. 2021. The polaron at strong coupling. Reviews in Mathematical Physics. 33(01), 2060012.","ieee":"R. Seiringer, “The polaron at strong coupling,” <i>Reviews in Mathematical Physics</i>, vol. 33, no. 01. World Scientific Publishing, 2021.","ama":"Seiringer R. The polaron at strong coupling. <i>Reviews in Mathematical Physics</i>. 2021;33(01). doi:<a href=\"https://doi.org/10.1142/s0129055x20600120\">10.1142/s0129055x20600120</a>","apa":"Seiringer, R. (2021). The polaron at strong coupling. <i>Reviews in Mathematical Physics</i>. World Scientific Publishing. <a href=\"https://doi.org/10.1142/s0129055x20600120\">https://doi.org/10.1142/s0129055x20600120</a>","mla":"Seiringer, Robert. “The Polaron at Strong Coupling.” <i>Reviews in Mathematical Physics</i>, vol. 33, no. 01, 2060012, World Scientific Publishing, 2021, doi:<a href=\"https://doi.org/10.1142/s0129055x20600120\">10.1142/s0129055x20600120</a>.","chicago":"Seiringer, Robert. “The Polaron at Strong Coupling.” <i>Reviews in Mathematical Physics</i>. World Scientific Publishing, 2021. <a href=\"https://doi.org/10.1142/s0129055x20600120\">https://doi.org/10.1142/s0129055x20600120</a>.","short":"R. Seiringer, Reviews in Mathematical Physics 33 (2021)."},"date_created":"2022-03-18T08:11:34Z","issue":"01","main_file_link":[{"url":"https://arxiv.org/abs/1912.12509","open_access":"1"}],"author":[{"last_name":"Seiringer","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","first_name":"Robert","full_name":"Seiringer, Robert","orcid":"0000-0002-6781-0521"}],"acknowledgement":"This work was supported by the European Research Council (ERC) under the Euro-pean Union’s Horizon 2020 research and innovation programme (grant agreementNo. 694227).","date_updated":"2023-09-05T16:08:02Z","article_type":"original","abstract":[{"lang":"eng","text":" We review old and new results on the Fröhlich polaron model. The discussion includes the validity of the (classical) Pekar approximation in the strong coupling limit, quantum corrections to this limit, as well as the divergence of the effective polaron mass."}],"article_number":"2060012","type":"journal_article","intvolume":"        33","publication_identifier":{"eissn":["1793-6659"],"issn":["0129-055X"]},"doi":"10.1142/s0129055x20600120","project":[{"grant_number":"694227","call_identifier":"H2020","name":"Analysis of quantum many-body systems","_id":"25C6DC12-B435-11E9-9278-68D0E5697425"}],"keyword":["Mathematical Physics","Statistical and Nonlinear Physics"],"isi":1,"publication":"Reviews in Mathematical Physics","arxiv":1,"oa":1,"volume":33,"scopus_import":"1","oa_version":"Preprint","external_id":{"isi":["000613313200013"],"arxiv":["1912.12509"]},"quality_controlled":"1","article_processing_charge":"No","year":"2021","language":[{"iso":"eng"}],"status":"public","month":"02","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","day":"01"},{"oa_version":"Preprint","scopus_import":"1","quality_controlled":"1","external_id":{"arxiv":["2105.08098"]},"month":"07","article_processing_charge":"No","status":"public","year":"2021","language":[{"iso":"eng"}],"day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1145/3409964.3461810","publication":"Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures","arxiv":1,"oa":1,"author":[{"last_name":"Fedorov","first_name":"Alexander","full_name":"Fedorov, Alexander"},{"full_name":"Koval, Nikita","first_name":"Nikita","last_name":"Koval"},{"last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian"}],"main_file_link":[{"url":"https://arxiv.org/abs/2105.08098","open_access":"1"}],"conference":{"end_date":"2021-07-08","start_date":"2021-07-06","location":"Virtual, Online","name":"SPAA: Symposium on Parallelism in Algorithms and Architectures"},"page":"208-220","abstract":[{"lang":"eng","text":"Dynamic Connectivity is a fundamental algorithmic graph problem, motivated by a wide range of applications to social and communication networks and used as a building block in various other algorithms, such as the bi-connectivity and the dynamic minimal spanning tree problems. In brief, we wish to maintain the connected components of the graph under dynamic edge insertions and deletions. In the sequential case, the problem has been well-studied from both theoretical and practical perspectives. However, much less is known about efficient concurrent solutions to this problem. This is the gap we address in this paper. We start from one of the classic data structures used to solve this problem, the Euler Tour Tree. Our first contribution is a non-blocking single-writer implementation of it. We leverage this data structure to obtain the first truly concurrent generalization of dynamic connectivity, which preserves the time complexity of its sequential counterpart, but is also scalable in practice. To achieve this, we rely on three main techniques. The first is to ensure that connectivity queries, which usually dominate real-world workloads, are non-blocking. The second non-trivial technique expands the above idea by making all queries that do not change the connectivity structure non-blocking. The third ingredient is applying fine-grained locking for updating the connected components, which allows operations on disjoint components to occur in parallel. We evaluate the resulting algorithm on various workloads, executing on both real and synthetic graphs. The results show the efficiency of each of the proposed optimizations; the most efficient variant improves the performance of a coarse-grained based implementation on realistic scenarios up to 6x on average and up to 30x when connectivity queries dominate."}],"date_updated":"2022-03-18T08:45:46Z","type":"conference","publication_identifier":{"isbn":["9781450380706"]},"publisher":"Association for Computing Machinery","department":[{"_id":"DaAl"}],"title":"A scalable concurrent algorithm for dynamic connectivity","date_published":"2021-07-01T00:00:00Z","_id":"10853","publication_status":"published","citation":{"ista":"Fedorov A, Koval N, Alistarh D-A. 2021. A scalable concurrent algorithm for dynamic connectivity. Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures. SPAA: Symposium on Parallelism in Algorithms and Architectures, 208–220.","apa":"Fedorov, A., Koval, N., &#38; Alistarh, D.-A. (2021). A scalable concurrent algorithm for dynamic connectivity. In <i>Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures</i> (pp. 208–220). Virtual, Online: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3409964.3461810\">https://doi.org/10.1145/3409964.3461810</a>","ieee":"A. Fedorov, N. Koval, and D.-A. Alistarh, “A scalable concurrent algorithm for dynamic connectivity,” in <i>Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures</i>, Virtual, Online, 2021, pp. 208–220.","ama":"Fedorov A, Koval N, Alistarh D-A. A scalable concurrent algorithm for dynamic connectivity. In: <i>Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures</i>. Association for Computing Machinery; 2021:208-220. doi:<a href=\"https://doi.org/10.1145/3409964.3461810\">10.1145/3409964.3461810</a>","short":"A. Fedorov, N. Koval, D.-A. Alistarh, in:, Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures, Association for Computing Machinery, 2021, pp. 208–220.","chicago":"Fedorov, Alexander, Nikita Koval, and Dan-Adrian Alistarh. “A Scalable Concurrent Algorithm for Dynamic Connectivity.” In <i>Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures</i>, 208–20. Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3409964.3461810\">https://doi.org/10.1145/3409964.3461810</a>.","mla":"Fedorov, Alexander, et al. “A Scalable Concurrent Algorithm for Dynamic Connectivity.” <i>Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures</i>, Association for Computing Machinery, 2021, pp. 208–20, doi:<a href=\"https://doi.org/10.1145/3409964.3461810\">10.1145/3409964.3461810</a>."},"date_created":"2022-03-18T08:21:47Z"},{"oa":1,"project":[{"_id":"268A44D6-B435-11E9-9278-68D0E5697425","name":"Elastic Coordination for Scalable Machine Learning","call_identifier":"H2020","grant_number":"805223"},{"grant_number":"840605","call_identifier":"H2020","name":"Coordination in constrained and natural distributed systems","_id":"26A5D39A-B435-11E9-9278-68D0E5697425"}],"doi":"10.1145/3410220.3453923","arxiv":1,"publication":"Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems","month":"05","year":"2021","status":"public","language":[{"iso":"eng"}],"article_processing_charge":"No","day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","related_material":{"record":[{"relation":"extended_version","id":"10855","status":"public"}]},"scopus_import":"1","quality_controlled":"1","external_id":{"arxiv":["2005.07637"]},"title":"Input-dynamic distributed algorithms for communication networks","ec_funded":1,"date_published":"2021-05-01T00:00:00Z","_id":"10854","date_created":"2022-03-18T08:48:41Z","citation":{"ista":"Foerster K-T, Korhonen J, Paz A, Rybicki J, Schmid S. 2021. Input-dynamic distributed algorithms for communication networks. Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems. SIGMETRICS: International Conference on Measurement and Modeling of Computer Systems, 71–72.","apa":"Foerster, K.-T., Korhonen, J., Paz, A., Rybicki, J., &#38; Schmid, S. (2021). Input-dynamic distributed algorithms for communication networks. In <i>Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems</i> (pp. 71–72). Virtual, Online: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3410220.3453923\">https://doi.org/10.1145/3410220.3453923</a>","ama":"Foerster K-T, Korhonen J, Paz A, Rybicki J, Schmid S. Input-dynamic distributed algorithms for communication networks. In: <i>Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems</i>. Association for Computing Machinery; 2021:71-72. doi:<a href=\"https://doi.org/10.1145/3410220.3453923\">10.1145/3410220.3453923</a>","ieee":"K.-T. Foerster, J. Korhonen, A. Paz, J. Rybicki, and S. Schmid, “Input-dynamic distributed algorithms for communication networks,” in <i>Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems</i>, Virtual, Online, 2021, pp. 71–72.","short":"K.-T. Foerster, J. Korhonen, A. Paz, J. Rybicki, S. Schmid, in:, Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, Association for Computing Machinery, 2021, pp. 71–72.","mla":"Foerster, Klaus-Tycho, et al. “Input-Dynamic Distributed Algorithms for Communication Networks.” <i>Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems</i>, Association for Computing Machinery, 2021, pp. 71–72, doi:<a href=\"https://doi.org/10.1145/3410220.3453923\">10.1145/3410220.3453923</a>.","chicago":"Foerster, Klaus-Tycho, Janne Korhonen, Ami Paz, Joel Rybicki, and Stefan Schmid. “Input-Dynamic Distributed Algorithms for Communication Networks.” In <i>Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems</i>, 71–72. Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3410220.3453923\">https://doi.org/10.1145/3410220.3453923</a>."},"publication_status":"published","department":[{"_id":"DaAl"}],"publisher":"Association for Computing Machinery","type":"conference","publication_identifier":{"isbn":["9781450380720"]},"acknowledgement":"We thank Jukka Suomela for discussions. We also thank our shepherd Mohammad Hajiesmaili and the reviewers for their time and suggestions on how to improve the paper. This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 805223 ScaleML), from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska–Curie grant agreement No. 840605, from the Vienna Science and Technology Fund (WWTF) project WHATIF, ICT19-045, 2020-2024, and from the Austrian Science Fund (FWF) and netIDEE SCIENCE project P 33775-N.","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2005.07637"}],"author":[{"last_name":"Foerster","first_name":"Klaus-Tycho","full_name":"Foerster, Klaus-Tycho"},{"last_name":"Korhonen","id":"C5402D42-15BC-11E9-A202-CA2BE6697425","first_name":"Janne","full_name":"Korhonen, Janne"},{"last_name":"Paz","first_name":"Ami","full_name":"Paz, Ami"},{"orcid":"0000-0002-6432-6646","full_name":"Rybicki, Joel","first_name":"Joel","last_name":"Rybicki","id":"334EFD2E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Schmid","full_name":"Schmid, Stefan","first_name":"Stefan"}],"page":"71-72","abstract":[{"lang":"eng","text":"Consider a distributed task where the communication network is fixed but the local inputs given to the nodes of the distributed system may change over time. In this work, we explore the following question: if some of the local inputs change, can an existing solution be updated efficiently, in a dynamic and distributed manner?\r\nTo address this question, we define the batch dynamic CONGEST model in which we are given a bandwidth-limited communication network and a dynamic edge labelling defines the problem input. The task is to maintain a solution to a graph problem on the labelled graph under batch changes. We investigate, when a batch of alpha edge label changes arrive, - how much time as a function of alpha we need to update an existing solution, and - how much information the nodes have to keep in local memory between batches in order to update the solution quickly.\r\nOur work lays the foundations for the theory of input-dynamic distributed network algorithms. We give a general picture of the complexity landscape in this model, design both universal algorithms and algorithms for concrete problems, and present a general framework for lower bounds. The diverse time complexity of our model spans from constant time, through time polynomial in alpha, and to alpha time, which we show to be enough for any task."}],"conference":{"start_date":"2021-06-14","end_date":"2021-06-18","location":"Virtual, Online","name":"SIGMETRICS: International Conference on Measurement and Modeling of Computer Systems"},"date_updated":"2023-09-26T10:40:55Z"},{"quality_controlled":"1","external_id":{"arxiv":["2005.07637"]},"oa_version":"Preprint","related_material":{"record":[{"id":"10854","status":"public","relation":"shorter_version"}]},"scopus_import":"1","day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"03","status":"public","language":[{"iso":"eng"}],"year":"2021","article_processing_charge":"No","arxiv":1,"publication":"Proceedings of the ACM on Measurement and Analysis of Computing Systems","project":[{"grant_number":"840605","call_identifier":"H2020","name":"Coordination in constrained and natural distributed systems","_id":"26A5D39A-B435-11E9-9278-68D0E5697425"},{"_id":"268A44D6-B435-11E9-9278-68D0E5697425","name":"Elastic Coordination for Scalable Machine Learning","call_identifier":"H2020","grant_number":"805223"}],"keyword":["Computer Networks and Communications","Hardware and Architecture","Safety","Risk","Reliability and Quality","Computer Science (miscellaneous)"],"doi":"10.1145/3447384","volume":5,"oa":1,"article_type":"original","page":"1-33","abstract":[{"lang":"eng","text":"Consider a distributed task where the communication network is fixed but the local inputs given to the nodes of the distributed system may change over time. In this work, we explore the following question: if some of the local inputs change, can an existing solution be updated efficiently, in a dynamic and distributed manner? To address this question, we define the batch dynamic \\congest model in which we are given a bandwidth-limited communication network and a dynamic edge labelling defines the problem input. The task is to maintain a solution to a graph problem on the labeled graph under batch changes. We investigate, when a batch of α edge label changes arrive, \\beginitemize \\item how much time as a function of α we need to update an existing solution, and \\item how much information the nodes have to keep in local memory between batches in order to update the solution quickly. \\enditemize Our work lays the foundations for the theory of input-dynamic distributed network algorithms. We give a general picture of the complexity landscape in this model, design both universal algorithms and algorithms for concrete problems, and present a general framework for lower bounds. In particular, we derive non-trivial upper bounds for two selected, contrasting problems: maintaining a minimum spanning tree and detecting cliques."}],"date_updated":"2023-09-26T10:40:55Z","main_file_link":[{"url":"https://arxiv.org/abs/2005.07637","open_access":"1"}],"author":[{"last_name":"Foerster","first_name":"Klaus-Tycho","full_name":"Foerster, Klaus-Tycho"},{"first_name":"Janne","full_name":"Korhonen, Janne","last_name":"Korhonen","id":"C5402D42-15BC-11E9-A202-CA2BE6697425"},{"last_name":"Paz","full_name":"Paz, Ami","first_name":"Ami"},{"id":"334EFD2E-F248-11E8-B48F-1D18A9856A87","last_name":"Rybicki","full_name":"Rybicki, Joel","first_name":"Joel","orcid":"0000-0002-6432-6646"},{"last_name":"Schmid","full_name":"Schmid, Stefan","first_name":"Stefan"}],"acknowledgement":"We thank Jukka Suomela for discussions. We also thank our shepherd Mohammad Hajiesmaili\r\nand the reviewers for their time and suggestions on how to improve the paper. This project\r\nhas received funding from the European Research Council (ERC) under the European Union’s\r\nHorizon 2020 research and innovation programme (grant agreement No 805223 ScaleML), from the European Union’s Horizon 2020 research and innovation programme under the Marie\r\nSk lodowska–Curie grant agreement No. 840605, from the Vienna Science and Technology Fund (WWTF) project WHATIF, ICT19-045, 2020-2024, and from the Austrian Science Fund (FWF) and netIDEE SCIENCE project P 33775-N.","issue":"1","publication_identifier":{"issn":["2476-1249"]},"type":"journal_article","intvolume":"         5","department":[{"_id":"DaAl"}],"publisher":"Association for Computing Machinery","date_created":"2022-03-18T09:10:27Z","citation":{"ista":"Foerster K-T, Korhonen J, Paz A, Rybicki J, Schmid S. 2021. Input-dynamic distributed algorithms for communication networks. Proceedings of the ACM on Measurement and Analysis of Computing Systems. 5(1), 1–33.","apa":"Foerster, K.-T., Korhonen, J., Paz, A., Rybicki, J., &#38; Schmid, S. (2021). Input-dynamic distributed algorithms for communication networks. <i>Proceedings of the ACM on Measurement and Analysis of Computing Systems</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3447384\">https://doi.org/10.1145/3447384</a>","ama":"Foerster K-T, Korhonen J, Paz A, Rybicki J, Schmid S. Input-dynamic distributed algorithms for communication networks. <i>Proceedings of the ACM on Measurement and Analysis of Computing Systems</i>. 2021;5(1):1-33. doi:<a href=\"https://doi.org/10.1145/3447384\">10.1145/3447384</a>","ieee":"K.-T. Foerster, J. Korhonen, A. Paz, J. Rybicki, and S. Schmid, “Input-dynamic distributed algorithms for communication networks,” <i>Proceedings of the ACM on Measurement and Analysis of Computing Systems</i>, vol. 5, no. 1. Association for Computing Machinery, pp. 1–33, 2021.","short":"K.-T. Foerster, J. Korhonen, A. Paz, J. Rybicki, S. Schmid, Proceedings of the ACM on Measurement and Analysis of Computing Systems 5 (2021) 1–33.","mla":"Foerster, Klaus-Tycho, et al. “Input-Dynamic Distributed Algorithms for Communication Networks.” <i>Proceedings of the ACM on Measurement and Analysis of Computing Systems</i>, vol. 5, no. 1, Association for Computing Machinery, 2021, pp. 1–33, doi:<a href=\"https://doi.org/10.1145/3447384\">10.1145/3447384</a>.","chicago":"Foerster, Klaus-Tycho, Janne Korhonen, Ami Paz, Joel Rybicki, and Stefan Schmid. “Input-Dynamic Distributed Algorithms for Communication Networks.” <i>Proceedings of the ACM on Measurement and Analysis of Computing Systems</i>. Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3447384\">https://doi.org/10.1145/3447384</a>."},"publication_status":"published","ec_funded":1,"title":"Input-dynamic distributed algorithms for communication networks","_id":"10855","date_published":"2021-03-01T00:00:00Z"},{"day":"29","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","month":"01","year":"2021","language":[{"iso":"eng"}],"status":"public","article_processing_charge":"No","quality_controlled":"1","has_accepted_license":"1","external_id":{"isi":["000734286800001"],"arxiv":["2004.02674"]},"oa_version":"Published Version","scopus_import":"1","volume":9,"oa":1,"arxiv":1,"publication":"Analysis and Geometry in Metric Spaces","isi":1,"keyword":["Applied Mathematics","Geometry and Topology","Analysis"],"doi":"10.1515/agms-2020-0103","ddc":["510"],"publication_identifier":{"issn":["2299-3274"]},"type":"journal_article","intvolume":"         9","page":"1-18","article_type":"original","abstract":[{"lang":"eng","text":"We study the properties of the maximal volume k-dimensional sections of the n-dimensional cube [−1, 1]n. We obtain a first order necessary condition for a k-dimensional subspace to be a local maximizer of the volume of such sections, which we formulate in a geometric way. We estimate the length of the projection of a vector of the standard basis of Rn onto a k-dimensional subspace that maximizes the volume of the intersection. We \u001cnd the optimal upper bound on the volume of a planar section of the cube [−1, 1]n , n ≥ 2."}],"date_updated":"2023-08-17T07:07:58Z","acknowledgement":"The authors acknowledge the support of the grant of the Russian Government N 075-15-\r\n2019-1926. G.I.was supported also by the SwissNational Science Foundation grant 200021-179133. The authors are very grateful to the anonymous reviewer for valuable remarks.","author":[{"id":"87744F66-5C6F-11EA-AFE0-D16B3DDC885E","last_name":"Ivanov","first_name":"Grigory","full_name":"Ivanov, Grigory"},{"last_name":"Tsiutsiurupa","full_name":"Tsiutsiurupa, Igor","first_name":"Igor"}],"file_date_updated":"2022-03-18T09:31:59Z","issue":"1","date_created":"2022-03-18T09:25:14Z","publication_status":"published","citation":{"ama":"Ivanov G, Tsiutsiurupa I. On the volume of sections of the cube. <i>Analysis and Geometry in Metric Spaces</i>. 2021;9(1):1-18. doi:<a href=\"https://doi.org/10.1515/agms-2020-0103\">10.1515/agms-2020-0103</a>","ieee":"G. Ivanov and I. Tsiutsiurupa, “On the volume of sections of the cube,” <i>Analysis and Geometry in Metric Spaces</i>, vol. 9, no. 1. De Gruyter, pp. 1–18, 2021.","apa":"Ivanov, G., &#38; Tsiutsiurupa, I. (2021). On the volume of sections of the cube. <i>Analysis and Geometry in Metric Spaces</i>. De Gruyter. <a href=\"https://doi.org/10.1515/agms-2020-0103\">https://doi.org/10.1515/agms-2020-0103</a>","chicago":"Ivanov, Grigory, and Igor Tsiutsiurupa. “On the Volume of Sections of the Cube.” <i>Analysis and Geometry in Metric Spaces</i>. De Gruyter, 2021. <a href=\"https://doi.org/10.1515/agms-2020-0103\">https://doi.org/10.1515/agms-2020-0103</a>.","mla":"Ivanov, Grigory, and Igor Tsiutsiurupa. “On the Volume of Sections of the Cube.” <i>Analysis and Geometry in Metric Spaces</i>, vol. 9, no. 1, De Gruyter, 2021, pp. 1–18, doi:<a href=\"https://doi.org/10.1515/agms-2020-0103\">10.1515/agms-2020-0103</a>.","short":"G. Ivanov, I. Tsiutsiurupa, Analysis and Geometry in Metric Spaces 9 (2021) 1–18.","ista":"Ivanov G, Tsiutsiurupa I. 2021. On the volume of sections of the cube. Analysis and Geometry in Metric Spaces. 9(1), 1–18."},"title":"On the volume of sections of the cube","_id":"10856","date_published":"2021-01-29T00:00:00Z","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"access_level":"open_access","relation":"main_file","checksum":"7e615ac8489f5eae580b6517debfdc53","date_updated":"2022-03-18T09:31:59Z","file_size":789801,"file_id":"10857","success":1,"creator":"dernst","date_created":"2022-03-18T09:31:59Z","file_name":"2021_AnalysisMetricSpaces_Ivanov.pdf","content_type":"application/pdf"}],"department":[{"_id":"UlWa"}],"publisher":"De Gruyter"},{"date_created":"2022-03-18T09:45:02Z","publication_status":"published","citation":{"ama":"Li M, Zhang Y, Zhang T, et al. Enhanced thermoelectric performance of n-type Bi2Se3 nanosheets through Sn doping. <i>Nanomaterials</i>. 2021;11(7). doi:<a href=\"https://doi.org/10.3390/nano11071827\">10.3390/nano11071827</a>","ieee":"M. Li <i>et al.</i>, “Enhanced thermoelectric performance of n-type Bi2Se3 nanosheets through Sn doping,” <i>Nanomaterials</i>, vol. 11, no. 7. MDPI, 2021.","apa":"Li, M., Zhang, Y., Zhang, T., Zuo, Y., Xiao, K., Arbiol, J., … Cabot, A. (2021). Enhanced thermoelectric performance of n-type Bi2Se3 nanosheets through Sn doping. <i>Nanomaterials</i>. MDPI. <a href=\"https://doi.org/10.3390/nano11071827\">https://doi.org/10.3390/nano11071827</a>","chicago":"Li, Mengyao, Yu Zhang, Ting Zhang, Yong Zuo, Ke Xiao, Jordi Arbiol, Jordi Llorca, Yu Liu, and Andreu Cabot. “Enhanced Thermoelectric Performance of N-Type Bi2Se3 Nanosheets through Sn Doping.” <i>Nanomaterials</i>. MDPI, 2021. <a href=\"https://doi.org/10.3390/nano11071827\">https://doi.org/10.3390/nano11071827</a>.","mla":"Li, Mengyao, et al. “Enhanced Thermoelectric Performance of N-Type Bi2Se3 Nanosheets through Sn Doping.” <i>Nanomaterials</i>, vol. 11, no. 7, 1827, MDPI, 2021, doi:<a href=\"https://doi.org/10.3390/nano11071827\">10.3390/nano11071827</a>.","short":"M. Li, Y. Zhang, T. Zhang, Y. Zuo, K. Xiao, J. Arbiol, J. Llorca, Y. Liu, A. Cabot, Nanomaterials 11 (2021).","ista":"Li M, Zhang Y, Zhang T, Zuo Y, Xiao K, Arbiol J, Llorca J, Liu Y, Cabot A. 2021. Enhanced thermoelectric performance of n-type Bi2Se3 nanosheets through Sn doping. Nanomaterials. 11(7), 1827."},"date_published":"2021-07-14T00:00:00Z","_id":"10858","ec_funded":1,"title":"Enhanced thermoelectric performance of n-type Bi2Se3 nanosheets through Sn doping","file":[{"success":1,"file_size":4867547,"file_id":"10859","creator":"dernst","access_level":"open_access","relation":"main_file","checksum":"f28a8b5cf80f5605828359bb398463b0","date_updated":"2022-03-18T09:53:15Z","content_type":"application/pdf","date_created":"2022-03-18T09:53:15Z","file_name":"2021_Nanomaterials_Li.pdf"}],"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"department":[{"_id":"MaIb"}],"publisher":"MDPI","publication_identifier":{"issn":["2079-4991"]},"ddc":["540"],"intvolume":"        11","type":"journal_article","date_updated":"2023-08-17T07:08:30Z","abstract":[{"text":"The cost-effective conversion of low-grade heat into electricity using thermoelectric devices requires developing alternative materials and material processing technologies able to reduce the currently high device manufacturing costs. In this direction, thermoelectric materials that do not rely on rare or toxic elements such as tellurium or lead need to be produced using high-throughput technologies not involving high temperatures and long processes. Bi2Se3 is an obvious possible Te-free alternative to Bi2Te3 for ambient temperature thermoelectric applications, but its performance is still low for practical applications, and additional efforts toward finding proper dopants are required. Here, we report a scalable method to produce Bi2Se3 nanosheets at low synthesis temperatures. We studied the influence of different dopants on the thermoelectric properties of this material. Among the elements tested, we demonstrated that Sn doping resulted in the best performance. Sn incorporation resulted in a significant improvement to the Bi2Se3 Seebeck coefficient and a reduction in the thermal conductivity in the direction of the hot-press axis, resulting in an overall 60% improvement in the thermoelectric figure of merit of Bi2Se3.","lang":"eng"}],"article_number":"1827","article_type":"original","file_date_updated":"2022-03-18T09:53:15Z","issue":"7","acknowledgement":"M.L., Y.Z., T.Z. and K.X. thank the China Scholarship Council for their scholarship\r\nsupport. Y.L. acknowledges funding from the European Union’s Horizon 2020 research and\r\ninnovation program under the Marie Sklodowska-Curie grant agreement No. 754411. J.L. thanks the ICREA Academia program and projects MICINN/FEDER RTI2018-093996-B-C31 and G.C. 2017 SGR 128. ICN2 acknowledges funding from the Generalitat de Catalunya 2017 SGR 327 and the Spanish MINECO ENE2017-85087-C3.","author":[{"first_name":"Mengyao","full_name":"Li, Mengyao","last_name":"Li"},{"first_name":"Yu","full_name":"Zhang, Yu","last_name":"Zhang"},{"last_name":"Zhang","full_name":"Zhang, Ting","first_name":"Ting"},{"first_name":"Yong","full_name":"Zuo, Yong","last_name":"Zuo"},{"last_name":"Xiao","first_name":"Ke","full_name":"Xiao, Ke"},{"last_name":"Arbiol","full_name":"Arbiol, Jordi","first_name":"Jordi"},{"first_name":"Jordi","full_name":"Llorca, Jordi","last_name":"Llorca"},{"orcid":"0000-0001-7313-6740","full_name":"Liu, Yu","first_name":"Yu","id":"2A70014E-F248-11E8-B48F-1D18A9856A87","last_name":"Liu"},{"last_name":"Cabot","full_name":"Cabot, Andreu","first_name":"Andreu"}],"volume":11,"oa":1,"isi":1,"publication":"Nanomaterials","project":[{"name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","call_identifier":"H2020"}],"keyword":["General Materials Science","General Chemical Engineering"],"doi":"10.3390/nano11071827","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","day":"14","status":"public","year":"2021","language":[{"iso":"eng"}],"article_processing_charge":"No","month":"07","has_accepted_license":"1","external_id":{"isi":["000676570000001"]},"quality_controlled":"1","scopus_import":"1","oa_version":"Published Version"},{"date_updated":"2023-09-05T12:43:09Z","page":"942-963","article_type":"original","abstract":[{"lang":"eng","text":"A tight frame is the orthogonal projection of some orthonormal basis of Rn onto Rk. We show that a set of vectors is a tight frame if and only if the set of all cross products of these vectors is a tight frame. We reformulate a range of problems on the volume of projections (or sections) of regular polytopes in terms of tight frames and write a first-order necessary condition for local extrema of these problems. As applications, we prove new results for the problem of maximization of the volume of zonotopes."}],"issue":"4","main_file_link":[{"url":"https://arxiv.org/abs/1804.10055","open_access":"1"}],"author":[{"full_name":"Ivanov, Grigory","first_name":"Grigory","id":"87744F66-5C6F-11EA-AFE0-D16B3DDC885E","last_name":"Ivanov"}],"acknowledgement":"The author was supported by the Swiss National Science Foundation grant 200021_179133. The author acknowledges the financial support from the Ministry of Education and Science of the Russian Federation in the framework of MegaGrant no. 075-15-2019-1926.","publication_identifier":{"eissn":["1496-4287"],"issn":["0008-4395"]},"type":"journal_article","intvolume":"        64","publisher":"Canadian Mathematical Society","department":[{"_id":"UlWa"}],"citation":{"ista":"Ivanov G. 2021. Tight frames and related geometric problems. Canadian Mathematical Bulletin. 64(4), 942–963.","short":"G. Ivanov, Canadian Mathematical Bulletin 64 (2021) 942–963.","mla":"Ivanov, Grigory. “Tight Frames and Related Geometric Problems.” <i>Canadian Mathematical Bulletin</i>, vol. 64, no. 4, Canadian Mathematical Society, 2021, pp. 942–63, doi:<a href=\"https://doi.org/10.4153/s000843952000096x\">10.4153/s000843952000096x</a>.","chicago":"Ivanov, Grigory. “Tight Frames and Related Geometric Problems.” <i>Canadian Mathematical Bulletin</i>. Canadian Mathematical Society, 2021. <a href=\"https://doi.org/10.4153/s000843952000096x\">https://doi.org/10.4153/s000843952000096x</a>.","apa":"Ivanov, G. (2021). Tight frames and related geometric problems. <i>Canadian Mathematical Bulletin</i>. Canadian Mathematical Society. <a href=\"https://doi.org/10.4153/s000843952000096x\">https://doi.org/10.4153/s000843952000096x</a>","ieee":"G. Ivanov, “Tight frames and related geometric problems,” <i>Canadian Mathematical Bulletin</i>, vol. 64, no. 4. Canadian Mathematical Society, pp. 942–963, 2021.","ama":"Ivanov G. Tight frames and related geometric problems. <i>Canadian Mathematical Bulletin</i>. 2021;64(4):942-963. doi:<a href=\"https://doi.org/10.4153/s000843952000096x\">10.4153/s000843952000096x</a>"},"publication_status":"published","date_created":"2022-03-18T09:55:59Z","date_published":"2021-12-18T00:00:00Z","_id":"10860","title":"Tight frames and related geometric problems","external_id":{"isi":["000730165300021"],"arxiv":["1804.10055"]},"quality_controlled":"1","scopus_import":"1","oa_version":"Preprint","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","day":"18","article_processing_charge":"No","language":[{"iso":"eng"}],"year":"2021","status":"public","month":"12","isi":1,"publication":"Canadian Mathematical Bulletin","arxiv":1,"doi":"10.4153/s000843952000096x","keyword":["General Mathematics","Tight frame","Grassmannian","zonotope"],"oa":1,"volume":64},{"abstract":[{"lang":"eng","text":"Brain dynamics display collective phenomena as diverse as neuronal oscillations and avalanches. Oscillations are rhythmic, with fluctuations occurring at a characteristic scale, whereas avalanches are scale-free cascades of neural activity. Here we show that such antithetic features can coexist in a very generic class of adaptive neural networks. In the most simple yet fully microscopic model from this class we make direct contact with human brain resting-state activity recordings via tractable inference of the model's two essential parameters. The inferred model quantitatively captures the dynamics over a broad range of scales, from single sensor fluctuations, collective behaviors of nearly-synchronous extreme events on multiple sensors, to neuronal avalanches unfolding over multiple sensors across multiple time-bins. Importantly, the inferred parameters correlate with model-independent signatures of \"closeness to criticality\", suggesting that the coexistence of scale-specific (neural oscillations) and scale-free (neuronal avalanches) dynamics in brain activity occurs close to a non-equilibrium critical point at the onset of self-sustained oscillations."}],"page":"37","date_updated":"2022-03-22T07:53:18Z","external_id":{"arxiv":["2108.06686"]},"author":[{"orcid":"0000-0003-2623-5249","full_name":"Lombardi, Fabrizio","first_name":"Fabrizio","last_name":"Lombardi","id":"A057D288-3E88-11E9-986D-0CF4E5697425"},{"id":"F93245C4-C3CA-11E9-B4F0-C6F4E5697425","last_name":"Pepic","full_name":"Pepic, Selver","first_name":"Selver"},{"last_name":"Shriki","first_name":"Oren","full_name":"Shriki, Oren"},{"last_name":"Tkačik","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","first_name":"Gašper","full_name":"Tkačik, Gašper","orcid":"0000-0002-6699-1455"},{"full_name":"De Martino, Daniele","first_name":"Daniele","last_name":"De Martino"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2108.06686"}],"acknowledgement":"FL acknowledges support from the European Union’s Horizon 2020 research and innovation program under the Marie Sklodowska-Curie Grant Agreement No. 754411. GT\r\nacknowledges the support of the Austrian Science Fund (FWF) under Stand-Alone Grant\r\nNo. P34015.","oa_version":"Preprint","day":"17","ddc":["570"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"08","year":"2021","type":"preprint","status":"public","language":[{"iso":"eng"}],"article_processing_charge":"No","arxiv":1,"department":[{"_id":"GaTk"}],"project":[{"grant_number":"754411","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425"},{"_id":"626c45b5-2b32-11ec-9570-e509828c1ba6","name":"Efficient coding with biophysical realism","grant_number":"P34015"}],"publisher":"arXiv","doi":"10.48550/ARXIV.2108.06686","date_created":"2022-03-21T11:41:28Z","publication_status":"submitted","citation":{"mla":"Lombardi, Fabrizio, et al. <i>Quantifying the Coexistence of Neuronal Oscillations and Avalanches</i>. arXiv, doi:<a href=\"https://doi.org/10.48550/ARXIV.2108.06686\">10.48550/ARXIV.2108.06686</a>.","chicago":"Lombardi, Fabrizio, Selver Pepic, Oren Shriki, Gašper Tkačik, and Daniele De Martino. “Quantifying the Coexistence of Neuronal Oscillations and Avalanches.” arXiv, n.d. <a href=\"https://doi.org/10.48550/ARXIV.2108.06686\">https://doi.org/10.48550/ARXIV.2108.06686</a>.","short":"F. Lombardi, S. Pepic, O. Shriki, G. Tkačik, D. De Martino, (n.d.).","ama":"Lombardi F, Pepic S, Shriki O, Tkačik G, De Martino D. Quantifying the coexistence of neuronal oscillations and avalanches. doi:<a href=\"https://doi.org/10.48550/ARXIV.2108.06686\">10.48550/ARXIV.2108.06686</a>","ieee":"F. Lombardi, S. Pepic, O. Shriki, G. Tkačik, and D. De Martino, “Quantifying the coexistence of neuronal oscillations and avalanches.” arXiv.","apa":"Lombardi, F., Pepic, S., Shriki, O., Tkačik, G., &#38; De Martino, D. (n.d.). Quantifying the coexistence of neuronal oscillations and avalanches. arXiv. <a href=\"https://doi.org/10.48550/ARXIV.2108.06686\">https://doi.org/10.48550/ARXIV.2108.06686</a>","ista":"Lombardi F, Pepic S, Shriki O, Tkačik G, De Martino D. Quantifying the coexistence of neuronal oscillations and avalanches. <a href=\"https://doi.org/10.48550/ARXIV.2108.06686\">10.48550/ARXIV.2108.06686</a>."},"title":"Quantifying the coexistence of neuronal oscillations and avalanches","ec_funded":1,"oa":1,"date_published":"2021-08-17T00:00:00Z","_id":"10912"},{"publication":"GeroScience","keyword":["Geriatrics and Gerontology","Aging"],"doi":"10.1007/s11357-021-00426-x","volume":43,"oa":1,"external_id":{"pmid":["34370163"]},"quality_controlled":"1","scopus_import":"1","oa_version":"Published Version","user_id":"72615eeb-f1f3-11ec-aa25-d4573ddc34fd","pmid":1,"day":"01","year":"2021","status":"public","language":[{"iso":"eng"}],"article_processing_charge":"No","month":"10","publisher":"Springer Nature","date_created":"2022-04-07T07:43:25Z","citation":{"ista":"Shadel GS, Adams PD, Berggren WT, Diedrich JK, Diffenderfer KE, Gage FH, Hah N, Hansen M, Hetzer M, Molina AJA, Manor U, Marek K, O’Keefe DD, Pinto AFM, Sacco A, Sharpee TO, Shokriev MN, Zambetti S. 2021. The San Diego Nathan Shock Center: Tackling the heterogeneity of aging. GeroScience. 43(5), 2139–2148.","short":"G.S. Shadel, P.D. Adams, W.T. Berggren, J.K. Diedrich, K.E. Diffenderfer, F.H. Gage, N. Hah, M. Hansen, M. Hetzer, A.J.A. Molina, U. Manor, K. Marek, D.D. O’Keefe, A.F.M. Pinto, A. Sacco, T.O. Sharpee, M.N. Shokriev, S. Zambetti, GeroScience 43 (2021) 2139–2148.","chicago":"Shadel, Gerald S., Peter D. Adams, W. Travis Berggren, Jolene K. Diedrich, Kenneth E. Diffenderfer, Fred H. Gage, Nasun Hah, et al. “The San Diego Nathan Shock Center: Tackling the Heterogeneity of Aging.” <i>GeroScience</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/s11357-021-00426-x\">https://doi.org/10.1007/s11357-021-00426-x</a>.","mla":"Shadel, Gerald S., et al. “The San Diego Nathan Shock Center: Tackling the Heterogeneity of Aging.” <i>GeroScience</i>, vol. 43, no. 5, Springer Nature, 2021, pp. 2139–48, doi:<a href=\"https://doi.org/10.1007/s11357-021-00426-x\">10.1007/s11357-021-00426-x</a>.","apa":"Shadel, G. S., Adams, P. D., Berggren, W. T., Diedrich, J. K., Diffenderfer, K. E., Gage, F. H., … Zambetti, S. (2021). The San Diego Nathan Shock Center: Tackling the heterogeneity of aging. <i>GeroScience</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s11357-021-00426-x\">https://doi.org/10.1007/s11357-021-00426-x</a>","ama":"Shadel GS, Adams PD, Berggren WT, et al. The San Diego Nathan Shock Center: Tackling the heterogeneity of aging. <i>GeroScience</i>. 2021;43(5):2139-2148. doi:<a href=\"https://doi.org/10.1007/s11357-021-00426-x\">10.1007/s11357-021-00426-x</a>","ieee":"G. S. Shadel <i>et al.</i>, “The San Diego Nathan Shock Center: Tackling the heterogeneity of aging,” <i>GeroScience</i>, vol. 43, no. 5. Springer Nature, pp. 2139–2148, 2021."},"publication_status":"published","_id":"11053","extern":"1","date_published":"2021-10-01T00:00:00Z","title":"The San Diego Nathan Shock Center: Tackling the heterogeneity of aging","date_updated":"2022-07-18T08:27:24Z","article_type":"original","page":"2139-2148","abstract":[{"text":"Understanding basic mechanisms of aging holds great promise for developing interventions that prevent or delay many age-related declines and diseases simultaneously to increase human healthspan. However, a major confounding factor in aging research is the heterogeneity of the aging process itself. At the organismal level, it is clear that chronological age does not always predict biological age or susceptibility to frailty or pathology. While genetics and environment are major factors driving variable rates of aging, additional complexity arises because different organs, tissues, and cell types are intrinsically heterogeneous and exhibit different aging trajectories normally or in response to the stresses of the aging process (e.g., damage accumulation). Tackling the heterogeneity of aging requires new and specialized tools (e.g., single-cell analyses, mass spectrometry-based approaches, and advanced imaging) to identify novel signatures of aging across scales. Cutting-edge computational approaches are then needed to integrate these disparate datasets and elucidate network interactions between known aging hallmarks. There is also a need for improved, human cell-based models of aging to ensure that basic research findings are relevant to human aging and healthspan interventions. The San Diego Nathan Shock Center (SD-NSC) provides access to cutting-edge scientific resources to facilitate the study of the heterogeneity of aging in general and to promote the use of novel human cell models of aging. The center also has a robust Research Development Core that funds pilot projects on the heterogeneity of aging and organizes innovative training activities, including workshops and a personalized mentoring program, to help investigators new to the aging field succeed. Finally, the SD-NSC participates in outreach activities to educate the general community about the importance of aging research and promote the need for basic biology of aging research in particular.","lang":"eng"}],"issue":"5","author":[{"first_name":"Gerald S.","full_name":"Shadel, Gerald S.","last_name":"Shadel"},{"last_name":"Adams","full_name":"Adams, Peter D.","first_name":"Peter D."},{"full_name":"Berggren, W. Travis","first_name":"W. Travis","last_name":"Berggren"},{"last_name":"Diedrich","full_name":"Diedrich, Jolene K.","first_name":"Jolene K."},{"full_name":"Diffenderfer, Kenneth E.","first_name":"Kenneth E.","last_name":"Diffenderfer"},{"last_name":"Gage","first_name":"Fred H.","full_name":"Gage, Fred H."},{"last_name":"Hah","full_name":"Hah, Nasun","first_name":"Nasun"},{"first_name":"Malene","full_name":"Hansen, Malene","last_name":"Hansen"},{"first_name":"Martin W","full_name":"HETZER, Martin W","orcid":"0000-0002-2111-992X","last_name":"HETZER","id":"86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed"},{"last_name":"Molina","full_name":"Molina, Anthony J. A.","first_name":"Anthony J. A."},{"last_name":"Manor","full_name":"Manor, Uri","first_name":"Uri"},{"first_name":"Kurt","full_name":"Marek, Kurt","last_name":"Marek"},{"last_name":"O’Keefe","full_name":"O’Keefe, David D.","first_name":"David D."},{"first_name":"Antonio F. M.","full_name":"Pinto, Antonio F. M.","last_name":"Pinto"},{"first_name":"Alessandra","full_name":"Sacco, Alessandra","last_name":"Sacco"},{"first_name":"Tatyana O.","full_name":"Sharpee, Tatyana O.","last_name":"Sharpee"},{"first_name":"Maxim N.","full_name":"Shokriev, Maxim N.","last_name":"Shokriev"},{"first_name":"Stefania","full_name":"Zambetti, Stefania","last_name":"Zambetti"}],"main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8599742/","open_access":"1"}],"publication_identifier":{"issn":["2509-2715","2509-2723"]},"intvolume":"        43","type":"journal_article"},{"publication_identifier":{"isbn":["9781713835974"],"issn":["2159-5399"],"eissn":["2374-3468"]},"intvolume":"        35","type":"conference","date_updated":"2022-06-07T06:53:36Z","conference":{"end_date":"2021-02-09","start_date":"2021-02-02","name":"AAAI: Conference on Artificial Intelligence","location":"Virtual, Online"},"abstract":[{"lang":"eng","text":"Asynchronous distributed algorithms are a popular way to reduce synchronization costs in large-scale optimization, and in particular for neural network training. However, for nonsmooth and nonconvex objectives, few convergence guarantees exist beyond cases where closed-form proximal operator solutions are available. As training most popular deep neural networks corresponds to optimizing nonsmooth and nonconvex objectives, there is a pressing need for such convergence guarantees. In this paper, we analyze for the first time the convergence of stochastic asynchronous optimization for this general class of objectives. In particular, we focus on stochastic subgradient methods allowing for block variable partitioning, where the shared model is asynchronously updated by concurrent processes. To this end, we use a probabilistic model which captures key features of real asynchronous scheduling between concurrent processes. Under this model, we establish convergence with probability one to an invariant set for stochastic subgradient methods with momentum. From a practical perspective, one issue with the family of algorithms that we consider is that they are not efficiently supported by machine learning frameworks, which mostly focus on distributed data-parallel strategies. To address this, we propose a new implementation strategy for shared-memory based training of deep neural networks for a partitioned but shared model in single- and multi-GPU settings. Based on this implementation, we achieve on average1.2x speed-up in comparison to state-of-the-art training methods for popular image classification tasks, without compromising accuracy."}],"page":"8209-8216","issue":"9B","main_file_link":[{"open_access":"1","url":" https://doi.org/10.48550/arXiv.1905.11845"}],"acknowledgement":"Vyacheslav Kungurtsev was supported by the OP VVV project CZ.02.1.01/0.0/0.0/16 019/0000765 “Research Center for Informatics. Bapi Chatterjee was supported by the European Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie grant agreement No. 754411 (ISTPlus). Dan Alistarh has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 805223 ScaleML).","author":[{"last_name":"Kungurtsev","first_name":"Vyacheslav","full_name":"Kungurtsev, Vyacheslav"},{"last_name":"Egan","full_name":"Egan, Malcolm","first_name":"Malcolm"},{"id":"3C41A08A-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Bapi","first_name":"Bapi"},{"last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X"}],"citation":{"ista":"Kungurtsev V, Egan M, Chatterjee B, Alistarh D-A. 2021. Asynchronous optimization methods for efficient training of deep neural networks with guarantees. 35th AAAI Conference on Artificial Intelligence, AAAI 2021. AAAI: Conference on Artificial Intelligence vol. 35, 8209–8216.","short":"V. Kungurtsev, M. Egan, B. Chatterjee, D.-A. Alistarh, in:, 35th AAAI Conference on Artificial Intelligence, AAAI 2021, AAAI Press, 2021, pp. 8209–8216.","mla":"Kungurtsev, Vyacheslav, et al. “Asynchronous Optimization Methods for Efficient Training of Deep Neural Networks with Guarantees.” <i>35th AAAI Conference on Artificial Intelligence, AAAI 2021</i>, vol. 35, no. 9B, AAAI Press, 2021, pp. 8209–16.","chicago":"Kungurtsev, Vyacheslav, Malcolm Egan, Bapi Chatterjee, and Dan-Adrian Alistarh. “Asynchronous Optimization Methods for Efficient Training of Deep Neural Networks with Guarantees.” In <i>35th AAAI Conference on Artificial Intelligence, AAAI 2021</i>, 35:8209–16. AAAI Press, 2021.","apa":"Kungurtsev, V., Egan, M., Chatterjee, B., &#38; Alistarh, D.-A. (2021). Asynchronous optimization methods for efficient training of deep neural networks with guarantees. In <i>35th AAAI Conference on Artificial Intelligence, AAAI 2021</i> (Vol. 35, pp. 8209–8216). Virtual, Online: AAAI Press.","ama":"Kungurtsev V, Egan M, Chatterjee B, Alistarh D-A. Asynchronous optimization methods for efficient training of deep neural networks with guarantees. In: <i>35th AAAI Conference on Artificial Intelligence, AAAI 2021</i>. Vol 35. AAAI Press; 2021:8209-8216.","ieee":"V. Kungurtsev, M. Egan, B. Chatterjee, and D.-A. Alistarh, “Asynchronous optimization methods for efficient training of deep neural networks with guarantees,” in <i>35th AAAI Conference on Artificial Intelligence, AAAI 2021</i>, Virtual, Online, 2021, vol. 35, no. 9B, pp. 8209–8216."},"publication_status":"published","date_created":"2022-06-05T22:01:52Z","date_published":"2021-05-18T00:00:00Z","_id":"11436","title":"Asynchronous optimization methods for efficient training of deep neural networks with guarantees","ec_funded":1,"publisher":"AAAI Press","department":[{"_id":"DaAl"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"18","article_processing_charge":"No","status":"public","language":[{"iso":"eng"}],"year":"2021","month":"05","external_id":{"arxiv":["1905.11845"]},"quality_controlled":"1","scopus_import":"1","oa_version":"Preprint","oa":1,"volume":35,"publication":"35th AAAI Conference on Artificial Intelligence, AAAI 2021","arxiv":1,"project":[{"grant_number":"754411","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425"},{"_id":"268A44D6-B435-11E9-9278-68D0E5697425","name":"Elastic Coordination for Scalable Machine Learning","call_identifier":"H2020","grant_number":"805223"}]},{"publication_identifier":{"issn":["1049-5258"],"isbn":["9781713845393"]},"type":"conference","intvolume":"         4","conference":{"name":"NeurIPS: Neural Information Processing Systems","location":"Virtual, Online","start_date":"2021-12-06","end_date":"2021-12-14"},"abstract":[{"text":"We study efficient distributed algorithms for the fundamental problem of principal component analysis and leading eigenvector computation on the sphere, when the data are randomly distributed among a set of computational nodes. We propose a new quantized variant of Riemannian gradient descent to solve this problem, and prove that the algorithm converges with high probability under a set of necessary spherical-convexity properties. We give bounds on the number of bits transmitted by the algorithm under common initialization schemes, and investigate the dependency on the problem dimension in each case.","lang":"eng"}],"page":"2823-2834","date_updated":"2022-06-20T08:31:52Z","acknowledgement":"We would like to thank the anonymous reviewers for helpful comments and suggestions. We also thank Aurelien Lucchi and Antonio Orvieto for fruitful discussions at an early stage of this work. FA is partially supported by the SNSF under research project No. 192363 and conducted part of this work while at IST Austria under the European Union’s Horizon 2020 research and innovation programme (grant agreement No. 805223 ScaleML). PD partly conducted this work while at IST Austria and was supported by the European Union’s Horizon 2020 programme under the Marie Skłodowska-Curie grant agreement No. 754411.","author":[{"last_name":"Alimisis","first_name":"Foivos","full_name":"Alimisis, Foivos"},{"last_name":"Davies","id":"11396234-BB50-11E9-B24C-90FCE5697425","orcid":"0000-0002-5646-9524","full_name":"Davies, Peter","first_name":"Peter"},{"first_name":"Bart","full_name":"Vandereycken, Bart","last_name":"Vandereycken"},{"first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh"}],"main_file_link":[{"open_access":"1","url":"https://proceedings.neurips.cc/paper/2021/file/1680e9fa7b4dd5d62ece800239bb53bd-Paper.pdf"}],"citation":{"mla":"Alimisis, Foivos, et al. “Distributed Principal Component Analysis with Limited Communication.” <i>Advances in Neural Information Processing Systems - 35th Conference on Neural Information Processing Systems</i>, vol. 4, Neural Information Processing Systems Foundation, 2021, pp. 2823–34.","chicago":"Alimisis, Foivos, Peter Davies, Bart Vandereycken, and Dan-Adrian Alistarh. “Distributed Principal Component Analysis with Limited Communication.” In <i>Advances in Neural Information Processing Systems - 35th Conference on Neural Information Processing Systems</i>, 4:2823–34. Neural Information Processing Systems Foundation, 2021.","short":"F. Alimisis, P. Davies, B. Vandereycken, D.-A. Alistarh, in:, Advances in Neural Information Processing Systems - 35th Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2021, pp. 2823–2834.","ama":"Alimisis F, Davies P, Vandereycken B, Alistarh D-A. Distributed principal component analysis with limited communication. In: <i>Advances in Neural Information Processing Systems - 35th Conference on Neural Information Processing Systems</i>. Vol 4. Neural Information Processing Systems Foundation; 2021:2823-2834.","ieee":"F. Alimisis, P. Davies, B. Vandereycken, and D.-A. Alistarh, “Distributed principal component analysis with limited communication,” in <i>Advances in Neural Information Processing Systems - 35th Conference on Neural Information Processing Systems</i>, Virtual, Online, 2021, vol. 4, pp. 2823–2834.","apa":"Alimisis, F., Davies, P., Vandereycken, B., &#38; Alistarh, D.-A. (2021). Distributed principal component analysis with limited communication. In <i>Advances in Neural Information Processing Systems - 35th Conference on Neural Information Processing Systems</i> (Vol. 4, pp. 2823–2834). Virtual, Online: Neural Information Processing Systems Foundation.","ista":"Alimisis F, Davies P, Vandereycken B, Alistarh D-A. 2021. Distributed principal component analysis with limited communication. Advances in Neural Information Processing Systems - 35th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems vol. 4, 2823–2834."},"publication_status":"published","date_created":"2022-06-19T22:01:58Z","ec_funded":1,"title":"Distributed principal component analysis with limited communication","_id":"11452","date_published":"2021-12-01T00:00:00Z","publisher":"Neural Information Processing Systems Foundation","department":[{"_id":"DaAl"}],"day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"12","article_processing_charge":"No","language":[{"iso":"eng"}],"year":"2021","status":"public","quality_controlled":"1","external_id":{"arxiv":["2110.14391"]},"oa_version":"Published Version","scopus_import":"1","oa":1,"volume":4,"publication":"Advances in Neural Information Processing Systems - 35th Conference on Neural Information Processing Systems","arxiv":1,"project":[{"grant_number":"805223","call_identifier":"H2020","name":"Elastic Coordination for Scalable Machine Learning","_id":"268A44D6-B435-11E9-9278-68D0E5697425"},{"name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","call_identifier":"H2020"}]},{"date_published":"2021-12-01T00:00:00Z","_id":"11453","title":"Online learning of neural computations from sparse temporal feedback","date_created":"2022-06-19T22:01:59Z","citation":{"ista":"Braun L, Vogels TP. 2021. Online learning of neural computations from sparse temporal feedback. Advances in Neural Information Processing Systems - 35th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems vol. 20, 16437–16450.","ama":"Braun L, Vogels TP. Online learning of neural computations from sparse temporal feedback. In: <i>Advances in Neural Information Processing Systems - 35th Conference on Neural Information Processing Systems</i>. Vol 20. Neural Information Processing Systems Foundation; 2021:16437-16450.","ieee":"L. Braun and T. P. Vogels, “Online learning of neural computations from sparse temporal feedback,” in <i>Advances in Neural Information Processing Systems - 35th Conference on Neural Information Processing Systems</i>, Virtual, Online, 2021, vol. 20, pp. 16437–16450.","apa":"Braun, L., &#38; Vogels, T. P. (2021). Online learning of neural computations from sparse temporal feedback. In <i>Advances in Neural Information Processing Systems - 35th Conference on Neural Information Processing Systems</i> (Vol. 20, pp. 16437–16450). Virtual, Online: Neural Information Processing Systems Foundation.","chicago":"Braun, Lukas, and Tim P Vogels. “Online Learning of Neural Computations from Sparse Temporal Feedback.” In <i>Advances in Neural Information Processing Systems - 35th Conference on Neural Information Processing Systems</i>, 20:16437–50. Neural Information Processing Systems Foundation, 2021.","mla":"Braun, Lukas, and Tim P. Vogels. “Online Learning of Neural Computations from Sparse Temporal Feedback.” <i>Advances in Neural Information Processing Systems - 35th Conference on Neural Information Processing Systems</i>, vol. 20, Neural Information Processing Systems Foundation, 2021, pp. 16437–50.","short":"L. Braun, T.P. Vogels, in:, Advances in Neural Information Processing Systems - 35th Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2021, pp. 16437–16450."},"publication_status":"published","department":[{"_id":"TiVo"}],"publisher":"Neural Information Processing Systems Foundation","type":"conference","intvolume":"        20","publication_identifier":{"issn":["1049-5258"],"isbn":["9781713845393"]},"main_file_link":[{"url":"https://proceedings.neurips.cc/paper/2021/file/88e1ce84f9feef5a08d0df0334c53468-Paper.pdf","open_access":"1"}],"acknowledgement":"We would like to thank Professor Dr. Henning Sprekeler for his valuable suggestions and Dr. Andrew Saxe, Milan Klöwer and Anna Wallis for their constructive feedback on the manuscript. Lukas Braun was supported by the Network of European Neuroscience Schools through their NENS Exchange Grant program, by the European Union through their European Community Action Scheme for the Mobility of University Students, the Woodward Scholarship awarded by Wadham College, Oxford and the Medical Research Council [MR/N013468/1]. Tim P. Vogels was supported by a Wellcome Trust Senior Research Fellowship [214316/Z/18/Z].","author":[{"full_name":"Braun, Lukas","first_name":"Lukas","last_name":"Braun"},{"orcid":"0000-0003-3295-6181","full_name":"Vogels, Tim P","first_name":"Tim P","last_name":"Vogels","id":"CB6FF8D2-008F-11EA-8E08-2637E6697425"}],"date_updated":"2022-06-20T07:12:58Z","abstract":[{"text":"Neuronal computations depend on synaptic connectivity and intrinsic electrophysiological properties. Synaptic connectivity determines which inputs from presynaptic neurons are integrated, while cellular properties determine how inputs are filtered over time. Unlike their biological counterparts, most computational approaches to learning in simulated neural networks are limited to changes in synaptic connectivity. However, if intrinsic parameters change, neural computations are altered drastically. Here, we include the parameters that determine the intrinsic properties,\r\ne.g., time constants and reset potential, into the learning paradigm. Using sparse feedback signals that indicate target spike times, and gradient-based parameter updates, we show that the intrinsic parameters can be learned along with the synaptic weights to produce specific input-output functions. Specifically, we use a teacher-student paradigm in which a randomly initialised leaky integrate-and-fire or resonate-and-fire neuron must recover the parameters of a teacher neuron. We show that complex temporal functions can be learned online and without backpropagation through time, relying on event-based updates only. Our results are a step towards online learning of neural computations from ungraded and unsigned sparse feedback signals with a biologically inspired learning mechanism.","lang":"eng"}],"page":"16437-16450","conference":{"start_date":"2021-12-06","end_date":"2021-12-14","location":"Virtual, Online","name":"NeurIPS: Neural Information Processing Systems"},"volume":20,"oa":1,"project":[{"_id":"c084a126-5a5b-11eb-8a69-d75314a70a87","name":"What’s in a memory? Spatiotemporal dynamics in strongly coupled recurrent neuronal networks.","grant_number":"214316/Z/18/Z"}],"publication":"Advances in Neural Information Processing Systems - 35th Conference on Neural Information Processing Systems","year":"2021","language":[{"iso":"eng"}],"status":"public","article_processing_charge":"No","month":"12","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","scopus_import":"1","oa_version":"Published Version","quality_controlled":"1"},{"publisher":"Curran Associates","department":[{"_id":"GradSch"},{"_id":"DaAl"}],"publication_status":"published","citation":{"short":"E.-A. Peste, E.B. Iofinova, A. Vladu, D.-A. Alistarh, in:, 35th Conference on Neural Information Processing Systems, Curran Associates, 2021, pp. 8557–8570.","mla":"Peste, Elena-Alexandra, et al. “AC/DC: Alternating Compressed/DeCompressed Training of Deep Neural Networks.” <i>35th Conference on Neural Information Processing Systems</i>, vol. 34, Curran Associates, 2021, pp. 8557–70.","chicago":"Peste, Elena-Alexandra, Eugenia B Iofinova, Adrian Vladu, and Dan-Adrian Alistarh. “AC/DC: Alternating Compressed/DeCompressed Training of Deep Neural Networks.” In <i>35th Conference on Neural Information Processing Systems</i>, 34:8557–70. Curran Associates, 2021.","apa":"Peste, E.-A., Iofinova, E. B., Vladu, A., &#38; Alistarh, D.-A. (2021). AC/DC: Alternating Compressed/DeCompressed training of deep neural networks. In <i>35th Conference on Neural Information Processing Systems</i> (Vol. 34, pp. 8557–8570). Virtual, Online: Curran Associates.","ieee":"E.-A. Peste, E. B. Iofinova, A. Vladu, and D.-A. Alistarh, “AC/DC: Alternating Compressed/DeCompressed training of deep neural networks,” in <i>35th Conference on Neural Information Processing Systems</i>, Virtual, Online, 2021, vol. 34, pp. 8557–8570.","ama":"Peste E-A, Iofinova EB, Vladu A, Alistarh D-A. AC/DC: Alternating Compressed/DeCompressed training of deep neural networks. In: <i>35th Conference on Neural Information Processing Systems</i>. Vol 34. Curran Associates; 2021:8557-8570.","ista":"Peste E-A, Iofinova EB, Vladu A, Alistarh D-A. 2021. AC/DC: Alternating Compressed/DeCompressed training of deep neural networks. 35th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems vol. 34, 8557–8570."},"date_created":"2022-06-20T12:11:53Z","title":"AC/DC: Alternating Compressed/DeCompressed training of deep neural networks","ec_funded":1,"date_published":"2021-12-06T00:00:00Z","_id":"11458","conference":{"start_date":"2021-12-06","end_date":"2021-12-14","location":"Virtual, Online","name":"NeurIPS: Neural Information Processing Systems"},"abstract":[{"text":"The increasing computational requirements of deep neural networks (DNNs) have led to significant interest in obtaining DNN models that are sparse, yet accurate. Recent work has investigated the even harder case of sparse training, where the DNN weights are, for as much as possible, already sparse to reduce computational costs during training. Existing sparse training methods are often empirical and can have lower accuracy relative to the dense baseline. In this paper, we present a general approach called Alternating Compressed/DeCompressed (AC/DC) training of DNNs, demonstrate convergence for a variant of the algorithm, and show that AC/DC outperforms existing sparse training methods in accuracy at similar computational budgets; at high sparsity levels, AC/DC even outperforms existing methods that rely on accurate pre-trained dense models. An important property of AC/DC is that it allows co-training of dense and sparse models, yielding accurate sparse–dense model pairs at the end of the training process. This is useful in practice, where compressed variants may be desirable for deployment in resource-constrained settings without re-doing the entire training flow, and also provides us with insights into the accuracy gap between dense and compressed models. The code is available at: https://github.com/IST-DASLab/ACDC.","lang":"eng"}],"page":"8557-8570","date_updated":"2023-06-01T12:54:45Z","main_file_link":[{"url":"https://proceedings.neurips.cc/paper/2021/file/48000647b315f6f00f913caa757a70b3-Paper.pdf","open_access":"1"}],"acknowledgement":"This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 805223 ScaleML), and a CNRS PEPS grant. This research was supported by the Scientific Service Units (SSU) of IST Austria through resources provided by Scientific Computing (SciComp). We would also like to thank Christoph Lampert for his feedback on an earlier version of this work, as well as for providing hardware for the Transformer-XL experiments.","author":[{"full_name":"Peste, Elena-Alexandra","first_name":"Elena-Alexandra","last_name":"Peste","id":"32D78294-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-7778-3221","full_name":"Iofinova, Eugenia B","first_name":"Eugenia B","last_name":"Iofinova","id":"f9a17499-f6e0-11ea-865d-fdf9a3f77117"},{"full_name":"Vladu, Adrian","first_name":"Adrian","last_name":"Vladu"},{"last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian"}],"publication_identifier":{"isbn":["9781713845393"],"issn":["1049-5258"]},"type":"conference","intvolume":"        34","publication":"35th Conference on Neural Information Processing Systems","arxiv":1,"project":[{"call_identifier":"H2020","grant_number":"805223","_id":"268A44D6-B435-11E9-9278-68D0E5697425","name":"Elastic Coordination for Scalable Machine Learning"}],"acknowledged_ssus":[{"_id":"ScienComp"}],"oa":1,"volume":34,"quality_controlled":"1","external_id":{"arxiv":["2106.12379"]},"oa_version":"Published Version","related_material":{"record":[{"relation":"dissertation_contains","id":"13074","status":"public"}]},"scopus_import":"1","day":"6","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"12","article_processing_charge":"No","status":"public","language":[{"iso":"eng"}],"year":"2021"}]