[{"_id":"9777","day":"25","publisher":"Public Library of Science","citation":{"mla":"Grah, Rok, and Tamar Friedlander. <i>Maximizing Crosstalk</i>. Public Library of Science, 2020, doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1007642.s002\">10.1371/journal.pcbi.1007642.s002</a>.","ista":"Grah R, Friedlander T. 2020. Maximizing crosstalk, Public Library of Science, <a href=\"https://doi.org/10.1371/journal.pcbi.1007642.s002\">10.1371/journal.pcbi.1007642.s002</a>.","ieee":"R. Grah and T. Friedlander, “Maximizing crosstalk.” Public Library of Science, 2020.","short":"R. Grah, T. Friedlander, (2020).","ama":"Grah R, Friedlander T. Maximizing crosstalk. 2020. doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1007642.s002\">10.1371/journal.pcbi.1007642.s002</a>","chicago":"Grah, Rok, and Tamar Friedlander. “Maximizing Crosstalk.” Public Library of Science, 2020. <a href=\"https://doi.org/10.1371/journal.pcbi.1007642.s002\">https://doi.org/10.1371/journal.pcbi.1007642.s002</a>.","apa":"Grah, R., &#38; Friedlander, T. (2020). Maximizing crosstalk. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pcbi.1007642.s002\">https://doi.org/10.1371/journal.pcbi.1007642.s002</a>"},"related_material":{"record":[{"id":"7569","status":"public","relation":"used_in_publication"}]},"month":"02","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Maximizing crosstalk","main_file_link":[{"url":"https://doi.org/10.1371/journal.pcbi.1007642.s002","open_access":"1"}],"doi":"10.1371/journal.pcbi.1007642.s002","date_created":"2021-08-06T07:21:51Z","oa_version":"None","type":"research_data_reference","status":"public","date_updated":"2025-06-12T06:58:06Z","date_published":"2020-02-25T00:00:00Z","department":[{"_id":"GaTk"}],"year":"2020","article_processing_charge":"No","author":[{"id":"483E70DE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2539-3560","first_name":"Rok","last_name":"Grah","full_name":"Grah, Rok"},{"first_name":"Tamar","full_name":"Friedlander, Tamar","last_name":"Friedlander"}],"oa":1},{"citation":{"short":"R. Grah, T. Friedlander, (2020).","ieee":"R. Grah and T. Friedlander, “Distribution of crosstalk values.” Public Library of Science, 2020.","ista":"Grah R, Friedlander T. 2020. Distribution of crosstalk values, Public Library of Science, <a href=\"https://doi.org/10.1371/journal.pcbi.1007642.s003\">10.1371/journal.pcbi.1007642.s003</a>.","mla":"Grah, Rok, and Tamar Friedlander. <i>Distribution of Crosstalk Values</i>. Public Library of Science, 2020, doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1007642.s003\">10.1371/journal.pcbi.1007642.s003</a>.","apa":"Grah, R., &#38; Friedlander, T. (2020). Distribution of crosstalk values. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pcbi.1007642.s003\">https://doi.org/10.1371/journal.pcbi.1007642.s003</a>","chicago":"Grah, Rok, and Tamar Friedlander. “Distribution of Crosstalk Values.” Public Library of Science, 2020. <a href=\"https://doi.org/10.1371/journal.pcbi.1007642.s003\">https://doi.org/10.1371/journal.pcbi.1007642.s003</a>.","ama":"Grah R, Friedlander T. Distribution of crosstalk values. 2020. doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1007642.s003\">10.1371/journal.pcbi.1007642.s003</a>"},"publisher":"Public Library of Science","day":"25","_id":"9779","title":"Distribution of crosstalk values","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","month":"02","related_material":{"record":[{"id":"7569","relation":"used_in_publication","status":"public"}]},"status":"public","type":"research_data_reference","oa_version":"Published Version","date_created":"2021-08-06T07:24:37Z","doi":"10.1371/journal.pcbi.1007642.s003","article_processing_charge":"No","author":[{"full_name":"Grah, Rok","last_name":"Grah","orcid":"0000-0003-2539-3560","id":"483E70DE-F248-11E8-B48F-1D18A9856A87","first_name":"Rok"},{"first_name":"Tamar","full_name":"Friedlander, Tamar","last_name":"Friedlander"}],"year":"2020","department":[{"_id":"GaTk"}],"date_published":"2020-02-25T00:00:00Z","date_updated":"2025-06-12T06:58:06Z"},{"day":"22","publisher":"CCDC","_id":"9780","citation":{"apa":"Schlemmer, W., Nothdurft, P., Petzold, A., Riess, G., Frühwirt, P., Schmallegger, M., … Spirk, S. (2020). CCDC 1991959: Experimental Crystal Structure Determination. CCDC. <a href=\"https://doi.org/10.5517/ccdc.csd.cc24vsrk\">https://doi.org/10.5517/ccdc.csd.cc24vsrk</a>","chicago":"Schlemmer, Werner, Philipp Nothdurft, Alina Petzold, Gisbert Riess, Philipp Frühwirt, Max Schmallegger, Georg Gescheidt-Demner, et al. “CCDC 1991959: Experimental Crystal Structure Determination.” CCDC, 2020. <a href=\"https://doi.org/10.5517/ccdc.csd.cc24vsrk\">https://doi.org/10.5517/ccdc.csd.cc24vsrk</a>.","ama":"Schlemmer W, Nothdurft P, Petzold A, et al. CCDC 1991959: Experimental Crystal Structure Determination. 2020. doi:<a href=\"https://doi.org/10.5517/ccdc.csd.cc24vsrk\">10.5517/ccdc.csd.cc24vsrk</a>","ieee":"W. Schlemmer <i>et al.</i>, “CCDC 1991959: Experimental Crystal Structure Determination.” CCDC, 2020.","short":"W. Schlemmer, P. Nothdurft, A. Petzold, G. Riess, P. Frühwirt, M. Schmallegger, G. Gescheidt-Demner, R. Fischer, S.A. Freunberger, W. Kern, S. Spirk, (2020).","ista":"Schlemmer W, Nothdurft P, Petzold A, Riess G, Frühwirt P, Schmallegger M, Gescheidt-Demner G, Fischer R, Freunberger SA, Kern W, Spirk S. 2020. CCDC 1991959: Experimental Crystal Structure Determination, CCDC, <a href=\"https://doi.org/10.5517/ccdc.csd.cc24vsrk\">10.5517/ccdc.csd.cc24vsrk</a>.","mla":"Schlemmer, Werner, et al. <i>CCDC 1991959: Experimental Crystal Structure Determination</i>. CCDC, 2020, doi:<a href=\"https://doi.org/10.5517/ccdc.csd.cc24vsrk\">10.5517/ccdc.csd.cc24vsrk</a>."},"related_material":{"record":[{"status":"public","relation":"used_in_publication","id":"8329"}]},"title":"CCDC 1991959: Experimental Crystal Structure Determination","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","month":"03","oa_version":"Published Version","type":"research_data_reference","doi":"10.5517/ccdc.csd.cc24vsrk","main_file_link":[{"url":"https://dx.doi.org/10.5517/ccdc.csd.cc24vsrk","open_access":"1"}],"abstract":[{"text":"PADREV : 4,4'-dimethoxy[1,1'-biphenyl]-2,2',5,5'-tetrol\r\nSpace Group: C 2 (5), Cell: a 24.488(16)Å b 5.981(4)Å c 3.911(3)Å, α 90° β 91.47(3)° γ 90°","lang":"eng"}],"date_created":"2021-08-06T07:41:07Z","status":"public","department":[{"_id":"StFr"}],"year":"2020","date_updated":"2023-09-05T16:03:47Z","date_published":"2020-03-22T00:00:00Z","oa":1,"author":[{"first_name":"Werner","last_name":"Schlemmer","full_name":"Schlemmer, Werner"},{"first_name":"Philipp","last_name":"Nothdurft","full_name":"Nothdurft, Philipp"},{"last_name":"Petzold","full_name":"Petzold, Alina","first_name":"Alina"},{"full_name":"Riess, Gisbert","last_name":"Riess","first_name":"Gisbert"},{"first_name":"Philipp","last_name":"Frühwirt","full_name":"Frühwirt, Philipp"},{"full_name":"Schmallegger, Max","last_name":"Schmallegger","first_name":"Max"},{"first_name":"Georg","full_name":"Gescheidt-Demner, Georg","last_name":"Gescheidt-Demner"},{"last_name":"Fischer","full_name":"Fischer, Roland","first_name":"Roland"},{"last_name":"Freunberger","full_name":"Freunberger, Stefan Alexander","orcid":"0000-0003-2902-5319","id":"A8CA28E6-CE23-11E9-AD2D-EC27E6697425","first_name":"Stefan Alexander"},{"first_name":"Wolfgang","last_name":"Kern","full_name":"Kern, Wolfgang"},{"first_name":"Stefan","full_name":"Spirk, Stefan","last_name":"Spirk"}],"article_processing_charge":"No"},{"abstract":[{"lang":"eng","text":"Fitness interactions between mutations can influence a population’s evolution in many different ways. While epistatic effects are difficult to measure precisely, important information is captured by the mean and variance of log fitnesses for individuals carrying different numbers of mutations. We derive predictions for these quantities from a class of simple fitness landscapes, based on models of optimizing selection on quantitative traits. We also explore extensions to the models, including modular pleiotropy, variable effect sizes, mutational bias and maladaptation of the wild type. We illustrate our approach by reanalysing a large dataset of mutant effects in a yeast snoRNA. Though characterized by some large epistatic effects, these data give a good overall fit to the non-epistatic null model, suggesting that epistasis might have limited influence on the evolutionary dynamics in this system. We also show how the amount of epistasis depends on both the underlying fitness landscape and the distribution of mutations, and so is expected to vary in consistent ways between new mutations, standing variation and fixed mutations."}],"date_created":"2021-08-06T11:18:15Z","main_file_link":[{"url":"https://doi.org/10.6084/m9.figshare.7957472.v1","open_access":"1"}],"doi":"10.6084/m9.figshare.7957472.v1","type":"research_data_reference","oa_version":"Published Version","status":"public","date_published":"2020-10-15T00:00:00Z","date_updated":"2025-07-10T11:53:24Z","year":"2020","department":[{"_id":"BeVi"},{"_id":"NiBa"}],"author":[{"full_name":"Fraisse, Christelle","last_name":"Fraisse","first_name":"Christelle","id":"32DF5794-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8441-5075"},{"first_name":"John J.","full_name":"Welch, John J.","last_name":"Welch"}],"article_processing_charge":"No","oa":1,"_id":"9798","publisher":"Royal Society of London","day":"15","citation":{"ieee":"C. Fraisse and J. J. Welch, “Simulation code for Fig S2 from the distribution of epistasis on simple fitness landscapes.” Royal Society of London, 2020.","ista":"Fraisse C, Welch JJ. 2020. Simulation code for Fig S2 from the distribution of epistasis on simple fitness landscapes, Royal Society of London, <a href=\"https://doi.org/10.6084/m9.figshare.7957472.v1\">10.6084/m9.figshare.7957472.v1</a>.","short":"C. Fraisse, J.J. Welch, (2020).","mla":"Fraisse, Christelle, and John J. Welch. <i>Simulation Code for Fig S2 from the Distribution of Epistasis on Simple Fitness Landscapes</i>. Royal Society of London, 2020, doi:<a href=\"https://doi.org/10.6084/m9.figshare.7957472.v1\">10.6084/m9.figshare.7957472.v1</a>.","apa":"Fraisse, C., &#38; Welch, J. J. (2020). Simulation code for Fig S2 from the distribution of epistasis on simple fitness landscapes. Royal Society of London. <a href=\"https://doi.org/10.6084/m9.figshare.7957472.v1\">https://doi.org/10.6084/m9.figshare.7957472.v1</a>","chicago":"Fraisse, Christelle, and John J. Welch. “Simulation Code for Fig S2 from the Distribution of Epistasis on Simple Fitness Landscapes.” Royal Society of London, 2020. <a href=\"https://doi.org/10.6084/m9.figshare.7957472.v1\">https://doi.org/10.6084/m9.figshare.7957472.v1</a>.","ama":"Fraisse C, Welch JJ. Simulation code for Fig S2 from the distribution of epistasis on simple fitness landscapes. 2020. doi:<a href=\"https://doi.org/10.6084/m9.figshare.7957472.v1\">10.6084/m9.figshare.7957472.v1</a>"},"related_material":{"record":[{"id":"6467","relation":"used_in_publication","status":"public"}]},"OA_type":"hybrid","user_id":"0043cee0-e5fc-11ee-9736-f83bc23afbf0","month":"10","OA_place":"publisher","title":"Simulation code for Fig S2 from the distribution of epistasis on simple fitness landscapes"},{"oa":1,"article_processing_charge":"No","author":[{"orcid":"0000-0001-8441-5075","id":"32DF5794-F248-11E8-B48F-1D18A9856A87","first_name":"Christelle","last_name":"Fraisse","full_name":"Fraisse, Christelle"},{"last_name":"Welch","full_name":"Welch, John J.","first_name":"John J."}],"department":[{"_id":"BeVi"},{"_id":"NiBa"}],"year":"2020","date_updated":"2025-07-10T11:53:23Z","date_published":"2020-10-15T00:00:00Z","status":"public","oa_version":"Published Version","type":"research_data_reference","doi":"10.6084/m9.figshare.7957469.v1","main_file_link":[{"url":"https://doi.org/10.6084/m9.figshare.7957469.v1","open_access":"1"}],"date_created":"2021-08-06T11:26:57Z","abstract":[{"lang":"eng","text":"Fitness interactions between mutations can influence a population’s evolution in many different ways. While epistatic effects are difficult to measure precisely, important information is captured by the mean and variance of log fitnesses for individuals carrying different numbers of mutations. We derive predictions for these quantities from a class of simple fitness landscapes, based on models of optimizing selection on quantitative traits. We also explore extensions to the models, including modular pleiotropy, variable effect sizes, mutational bias and maladaptation of the wild type. We illustrate our approach by reanalysing a large dataset of mutant effects in a yeast snoRNA. Though characterized by some large epistatic effects, these data give a good overall fit to the non-epistatic null model, suggesting that epistasis might have limited influence on the evolutionary dynamics in this system. We also show how the amount of epistasis depends on both the underlying fitness landscape and the distribution of mutations, and so is expected to vary in consistent ways between new mutations, standing variation and fixed mutations."}],"title":"Simulation code for Fig S1 from the distribution of epistasis on simple fitness landscapes","OA_place":"publisher","user_id":"0043cee0-e5fc-11ee-9736-f83bc23afbf0","month":"10","OA_type":"hybrid","related_material":{"record":[{"id":"6467","relation":"used_in_publication","status":"public"}]},"citation":{"chicago":"Fraisse, Christelle, and John J. Welch. “Simulation Code for Fig S1 from the Distribution of Epistasis on Simple Fitness Landscapes.” Royal Society of London, 2020. <a href=\"https://doi.org/10.6084/m9.figshare.7957469.v1\">https://doi.org/10.6084/m9.figshare.7957469.v1</a>.","apa":"Fraisse, C., &#38; Welch, J. J. (2020). Simulation code for Fig S1 from the distribution of epistasis on simple fitness landscapes. Royal Society of London. <a href=\"https://doi.org/10.6084/m9.figshare.7957469.v1\">https://doi.org/10.6084/m9.figshare.7957469.v1</a>","ama":"Fraisse C, Welch JJ. Simulation code for Fig S1 from the distribution of epistasis on simple fitness landscapes. 2020. doi:<a href=\"https://doi.org/10.6084/m9.figshare.7957469.v1\">10.6084/m9.figshare.7957469.v1</a>","mla":"Fraisse, Christelle, and John J. Welch. <i>Simulation Code for Fig S1 from the Distribution of Epistasis on Simple Fitness Landscapes</i>. Royal Society of London, 2020, doi:<a href=\"https://doi.org/10.6084/m9.figshare.7957469.v1\">10.6084/m9.figshare.7957469.v1</a>.","ista":"Fraisse C, Welch JJ. 2020. Simulation code for Fig S1 from the distribution of epistasis on simple fitness landscapes, Royal Society of London, <a href=\"https://doi.org/10.6084/m9.figshare.7957469.v1\">10.6084/m9.figshare.7957469.v1</a>.","ieee":"C. Fraisse and J. J. Welch, “Simulation code for Fig S1 from the distribution of epistasis on simple fitness landscapes.” Royal Society of London, 2020.","short":"C. Fraisse, J.J. Welch, (2020)."},"day":"15","publisher":"Royal Society of London","_id":"9799"},{"author":[{"id":"3B699956-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4783-0389","first_name":"Rasmus","full_name":"Ibsen-Jensen, Rasmus","last_name":"Ibsen-Jensen"},{"last_name":"Tkadlec","full_name":"Tkadlec, Josef","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1097-9684","first_name":"Josef"},{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu"},{"first_name":"Martin","full_name":"Nowak, Martin","last_name":"Nowak"}],"article_processing_charge":"No","oa":1,"date_updated":"2025-04-15T08:12:20Z","date_published":"2020-10-15T00:00:00Z","department":[{"_id":"KrCh"}],"year":"2020","status":"public","main_file_link":[{"url":"https://doi.org/10.6084/m9.figshare.5973013.v1","open_access":"1"}],"doi":"10.6084/m9.figshare.5973013.v1","abstract":[{"lang":"eng","text":"Data and mathematica notebooks for plotting figures from Language learning with communication between learners"}],"date_created":"2021-08-06T13:09:57Z","oa_version":"Published Version","type":"research_data_reference","OA_place":"publisher","month":"10","user_id":"0043cee0-e5fc-11ee-9736-f83bc23afbf0","title":"Data and mathematica notebooks for plotting figures from language learning with communication between learners from language acquisition with communication between learners","OA_type":"hybrid","related_material":{"record":[{"id":"198","relation":"used_in_publication","status":"public"}]},"citation":{"ieee":"R. Ibsen-Jensen, J. Tkadlec, K. Chatterjee, and M. Nowak, “Data and mathematica notebooks for plotting figures from language learning with communication between learners from language acquisition with communication between learners.” Royal Society, 2020.","ista":"Ibsen-Jensen R, Tkadlec J, Chatterjee K, Nowak M. 2020. Data and mathematica notebooks for plotting figures from language learning with communication between learners from language acquisition with communication between learners, Royal Society, <a href=\"https://doi.org/10.6084/m9.figshare.5973013.v1\">10.6084/m9.figshare.5973013.v1</a>.","short":"R. Ibsen-Jensen, J. Tkadlec, K. Chatterjee, M. Nowak, (2020).","mla":"Ibsen-Jensen, Rasmus, et al. <i>Data and Mathematica Notebooks for Plotting Figures from Language Learning with Communication between Learners from Language Acquisition with Communication between Learners</i>. Royal Society, 2020, doi:<a href=\"https://doi.org/10.6084/m9.figshare.5973013.v1\">10.6084/m9.figshare.5973013.v1</a>.","ama":"Ibsen-Jensen R, Tkadlec J, Chatterjee K, Nowak M. Data and mathematica notebooks for plotting figures from language learning with communication between learners from language acquisition with communication between learners. 2020. doi:<a href=\"https://doi.org/10.6084/m9.figshare.5973013.v1\">10.6084/m9.figshare.5973013.v1</a>","apa":"Ibsen-Jensen, R., Tkadlec, J., Chatterjee, K., &#38; Nowak, M. (2020). Data and mathematica notebooks for plotting figures from language learning with communication between learners from language acquisition with communication between learners. Royal Society. <a href=\"https://doi.org/10.6084/m9.figshare.5973013.v1\">https://doi.org/10.6084/m9.figshare.5973013.v1</a>","chicago":"Ibsen-Jensen, Rasmus, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. “Data and Mathematica Notebooks for Plotting Figures from Language Learning with Communication between Learners from Language Acquisition with Communication between Learners.” Royal Society, 2020. <a href=\"https://doi.org/10.6084/m9.figshare.5973013.v1\">https://doi.org/10.6084/m9.figshare.5973013.v1</a>."},"_id":"9814","day":"15","publisher":"Royal Society"},{"publication":"IEEE Transactions on Visualization and Computer Graphics","article_type":"original","title":"Simulating liquids on dynamically warping grids","volume":26,"publisher":"IEEE","day":"01","_id":"5681","pmid":1,"ddc":["006"],"year":"2020","issue":"6","date_published":"2020-06-01T00:00:00Z","oa":1,"quality_controlled":"1","abstract":[{"lang":"eng","text":"We introduce dynamically warping grids for adaptive liquid simulation. Our primary contributions are a strategy for dynamically deforming regular grids over the course of a simulation and a method for efficiently utilizing these deforming grids for liquid simulation. Prior work has shown that unstructured grids are very effective for adaptive fluid simulations. However, unstructured grids often lead to complicated implementations and a poor cache hit rate due to inconsistent memory access. Regular grids, on the other hand, provide a fast, fixed memory access pattern and straightforward implementation. Our method combines the advantages of both: we leverage the simplicity of regular grids while still achieving practical and controllable spatial adaptivity. We demonstrate that our method enables adaptive simulations that are fast, flexible, and robust to null-space issues. At the same time, our method is simple to implement and takes advantage of existing highly-tuned algorithms."}],"intvolume":"        26","date_created":"2018-12-16T22:59:21Z","publication_identifier":{"issn":["1077-2626"],"eissn":["1941-0506"]},"page":"2288-2302","acknowledgement":"This work was partially supported by JSPS Grant-in-Aid forYoung Scientists (Start-up) 16H07410, the ERC StartingGrantsrealFlow(StG-2015-637014) andBigSplash(StG-2014-638176). This research was supported by the Scientific Ser-vice Units (SSU) of IST Austria through resources providedby Scientific Computing. We would like to express my grati-tude to Nobuyuki Umetani and Tomas Skrivan for insight-ful discussion.","file":[{"file_size":21910098,"relation":"main_file","checksum":"8d4c55443a0ee335bb5bb652de503042","date_updated":"2020-10-08T08:34:53Z","file_name":"preprint.pdf","content_type":"application/pdf","creator":"wojtan","success":1,"access_level":"open_access","date_created":"2020-10-08T08:34:53Z","file_id":"8626"}],"acknowledged_ssus":[{"_id":"ScienComp"}],"external_id":{"pmid":["30507534"],"isi":["000532295600014"]},"month":"06","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2020-10-08T08:34:53Z","scopus_import":"1","language":[{"iso":"eng"}],"citation":{"apa":"Hikaru, I., Wojtan, C., Thuerey, N., Igarashi, T., &#38; Ando, R. (2020). Simulating liquids on dynamically warping grids. <i>IEEE Transactions on Visualization and Computer Graphics</i>. IEEE. <a href=\"https://doi.org/10.1109/TVCG.2018.2883628\">https://doi.org/10.1109/TVCG.2018.2883628</a>","chicago":"Hikaru, Ibayashi, Chris Wojtan, Nils Thuerey, Takeo Igarashi, and Ryoichi Ando. “Simulating Liquids on Dynamically Warping Grids.” <i>IEEE Transactions on Visualization and Computer Graphics</i>. IEEE, 2020. <a href=\"https://doi.org/10.1109/TVCG.2018.2883628\">https://doi.org/10.1109/TVCG.2018.2883628</a>.","ama":"Hikaru I, Wojtan C, Thuerey N, Igarashi T, Ando R. Simulating liquids on dynamically warping grids. <i>IEEE Transactions on Visualization and Computer Graphics</i>. 2020;26(6):2288-2302. doi:<a href=\"https://doi.org/10.1109/TVCG.2018.2883628\">10.1109/TVCG.2018.2883628</a>","short":"I. Hikaru, C. Wojtan, N. Thuerey, T. Igarashi, R. Ando, IEEE Transactions on Visualization and Computer Graphics 26 (2020) 2288–2302.","ista":"Hikaru I, Wojtan C, Thuerey N, Igarashi T, Ando R. 2020. Simulating liquids on dynamically warping grids. IEEE Transactions on Visualization and Computer Graphics. 26(6), 2288–2302.","ieee":"I. Hikaru, C. Wojtan, N. Thuerey, T. Igarashi, and R. Ando, “Simulating liquids on dynamically warping grids,” <i>IEEE Transactions on Visualization and Computer Graphics</i>, vol. 26, no. 6. IEEE, pp. 2288–2302, 2020.","mla":"Hikaru, Ibayashi, et al. “Simulating Liquids on Dynamically Warping Grids.” <i>IEEE Transactions on Visualization and Computer Graphics</i>, vol. 26, no. 6, IEEE, 2020, pp. 2288–302, doi:<a href=\"https://doi.org/10.1109/TVCG.2018.2883628\">10.1109/TVCG.2018.2883628</a>."},"has_accepted_license":"1","department":[{"_id":"ChWo"}],"date_updated":"2025-07-10T11:52:55Z","article_processing_charge":"No","author":[{"last_name":"Hikaru","full_name":"Hikaru, Ibayashi","first_name":"Ibayashi"},{"full_name":"Wojtan, Christopher J","last_name":"Wojtan","first_name":"Christopher J","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6646-5546"},{"first_name":"Nils","last_name":"Thuerey","full_name":"Thuerey, Nils"},{"full_name":"Igarashi, Takeo","last_name":"Igarashi","first_name":"Takeo"},{"first_name":"Ryoichi","full_name":"Ando, Ryoichi","last_name":"Ando"}],"type":"journal_article","oa_version":"Submitted Version","publication_status":"published","doi":"10.1109/TVCG.2018.2883628","status":"public","isi":1},{"author":[{"first_name":"Eric A.","last_name":"Carlen","full_name":"Carlen, Eric A."},{"id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0845-1338","first_name":"Jan","full_name":"Maas, Jan","last_name":"Maas"}],"article_processing_charge":"Yes (via OA deal)","department":[{"_id":"JaMa"}],"date_updated":"2025-06-12T07:27:20Z","status":"public","isi":1,"oa_version":"Published Version","type":"journal_article","doi":"10.1007/s10955-019-02434-w","publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"01","publication_identifier":{"issn":["0022-4715"],"eissn":["1572-9613"]},"external_id":{"arxiv":["1811.04572"],"isi":["000498933300001"],"pmid":["33223567"]},"file":[{"file_size":905538,"relation":"main_file","checksum":"7b04befbdc0d4982c0ee945d25d19872","date_updated":"2020-07-14T12:47:28Z","file_name":"2019_JourStatistPhysics_Carlen.pdf","creator":"dernst","content_type":"application/pdf","access_level":"open_access","date_created":"2019-12-23T12:03:09Z","file_id":"7209"}],"page":"319-378","related_material":{"link":[{"url":"https://doi.org/10.1007/s10955-020-02671-4","relation":"erratum"}]},"language":[{"iso":"eng"}],"has_accepted_license":"1","citation":{"short":"E.A. Carlen, J. Maas, Journal of Statistical Physics 178 (2020) 319–378.","ieee":"E. A. Carlen and J. Maas, “Non-commutative calculus, optimal transport and functional inequalities  in dissipative quantum systems,” <i>Journal of Statistical Physics</i>, vol. 178, no. 2. Springer Nature, pp. 319–378, 2020.","ista":"Carlen EA, Maas J. 2020. Non-commutative calculus, optimal transport and functional inequalities  in dissipative quantum systems. Journal of Statistical Physics. 178(2), 319–378.","mla":"Carlen, Eric A., and Jan Maas. “Non-Commutative Calculus, Optimal Transport and Functional Inequalities  in Dissipative Quantum Systems.” <i>Journal of Statistical Physics</i>, vol. 178, no. 2, Springer Nature, 2020, pp. 319–78, doi:<a href=\"https://doi.org/10.1007/s10955-019-02434-w\">10.1007/s10955-019-02434-w</a>.","apa":"Carlen, E. A., &#38; Maas, J. (2020). Non-commutative calculus, optimal transport and functional inequalities  in dissipative quantum systems. <i>Journal of Statistical Physics</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s10955-019-02434-w\">https://doi.org/10.1007/s10955-019-02434-w</a>","chicago":"Carlen, Eric A., and Jan Maas. “Non-Commutative Calculus, Optimal Transport and Functional Inequalities  in Dissipative Quantum Systems.” <i>Journal of Statistical Physics</i>. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/s10955-019-02434-w\">https://doi.org/10.1007/s10955-019-02434-w</a>.","ama":"Carlen EA, Maas J. Non-commutative calculus, optimal transport and functional inequalities  in dissipative quantum systems. <i>Journal of Statistical Physics</i>. 2020;178(2):319-378. doi:<a href=\"https://doi.org/10.1007/s10955-019-02434-w\">10.1007/s10955-019-02434-w</a>"},"project":[{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"},{"grant_number":"716117","call_identifier":"H2020","name":"Optimal Transport and Stochastic Dynamics","_id":"256E75B8-B435-11E9-9278-68D0E5697425"},{"grant_number":"F06504","name":"Taming Complexity in Partial Differential Systems","call_identifier":"FWF","_id":"260482E2-B435-11E9-9278-68D0E5697425"}],"file_date_updated":"2020-07-14T12:47:28Z","corr_author":"1","license":"https://creativecommons.org/licenses/by/4.0/","scopus_import":"1","oa":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"issue":"2","year":"2020","date_published":"2020-01-01T00:00:00Z","quality_controlled":"1","abstract":[{"text":"We study dynamical optimal transport metrics between density matricesassociated to symmetric Dirichlet forms on finite-dimensional C∗-algebras.  Our settingcovers  arbitrary  skew-derivations  and  it  provides  a  unified  framework  that  simultaneously  generalizes  recently  constructed  transport  metrics  for  Markov  chains,  Lindblad  equations,  and  the  Fermi  Ornstein–Uhlenbeck  semigroup.   We  develop  a  non-nommutative differential calculus that allows us to obtain non-commutative Ricci curvature  bounds,  logarithmic  Sobolev  inequalities,  transport-entropy  inequalities,  andspectral gap estimates.","lang":"eng"}],"date_created":"2019-04-30T07:34:18Z","intvolume":"       178","title":"Non-commutative calculus, optimal transport and functional inequalities  in dissipative quantum systems","article_type":"original","ec_funded":1,"volume":178,"publication":"Journal of Statistical Physics","pmid":1,"ddc":["500"],"day":"01","publisher":"Springer Nature","arxiv":1,"_id":"6358"},{"ddc":["510"],"_id":"6359","publisher":"Institute of Mathematical Statistics","arxiv":1,"day":"16","volume":25,"article_type":"original","title":"On the regularisation of the noise for the Euler-Maruyama scheme with irregular drift","publication":"Electronic Journal of Probability","date_created":"2019-04-30T07:40:17Z","intvolume":"        25","abstract":[{"lang":"eng","text":"The strong rate of convergence of the Euler-Maruyama scheme for nondegenerate SDEs with irregular drift coefficients is considered. In the case of α-Hölder drift in the recent literature the rate α/2 was proved in many related situations. By exploiting the regularising effect of the noise more efficiently, we show that the rate is in fact arbitrarily close to 1/2 for all α>0. The result extends to Dini continuous coefficients, while in d=1 also to all bounded measurable coefficients."}],"quality_controlled":"1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"oa":1,"date_published":"2020-07-16T00:00:00Z","year":"2020","citation":{"apa":"Dareiotis, K., &#38; Gerencser, M. (2020). On the regularisation of the noise for the Euler-Maruyama scheme with irregular drift. <i>Electronic Journal of Probability</i>. Institute of Mathematical Statistics. <a href=\"https://doi.org/10.1214/20-EJP479\">https://doi.org/10.1214/20-EJP479</a>","chicago":"Dareiotis, Konstantinos, and Mate Gerencser. “On the Regularisation of the Noise for the Euler-Maruyama Scheme with Irregular Drift.” <i>Electronic Journal of Probability</i>. Institute of Mathematical Statistics, 2020. <a href=\"https://doi.org/10.1214/20-EJP479\">https://doi.org/10.1214/20-EJP479</a>.","ama":"Dareiotis K, Gerencser M. On the regularisation of the noise for the Euler-Maruyama scheme with irregular drift. <i>Electronic Journal of Probability</i>. 2020;25. doi:<a href=\"https://doi.org/10.1214/20-EJP479\">10.1214/20-EJP479</a>","short":"K. Dareiotis, M. Gerencser, Electronic Journal of Probability 25 (2020).","ista":"Dareiotis K, Gerencser M. 2020. On the regularisation of the noise for the Euler-Maruyama scheme with irregular drift. Electronic Journal of Probability. 25, 82.","ieee":"K. Dareiotis and M. Gerencser, “On the regularisation of the noise for the Euler-Maruyama scheme with irregular drift,” <i>Electronic Journal of Probability</i>, vol. 25. Institute of Mathematical Statistics, 2020.","mla":"Dareiotis, Konstantinos, and Mate Gerencser. “On the Regularisation of the Noise for the Euler-Maruyama Scheme with Irregular Drift.” <i>Electronic Journal of Probability</i>, vol. 25, 82, Institute of Mathematical Statistics, 2020, doi:<a href=\"https://doi.org/10.1214/20-EJP479\">10.1214/20-EJP479</a>."},"has_accepted_license":"1","article_number":"82","language":[{"iso":"eng"}],"scopus_import":"1","file_date_updated":"2020-09-21T13:15:02Z","month":"07","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"date_updated":"2020-09-21T13:15:02Z","file_name":"2020_EJournProbab_Dareiotis.pdf","file_size":273042,"checksum":"8e7c42e72596f6889d786e8e8b89994f","relation":"main_file","date_created":"2020-09-21T13:15:02Z","access_level":"open_access","success":1,"file_id":"8549","content_type":"application/pdf","creator":"dernst"}],"external_id":{"isi":["000550150700001"],"arxiv":["1812.04583"]},"publication_identifier":{"eissn":["1083-6489"]},"isi":1,"status":"public","publication_status":"published","doi":"10.1214/20-EJP479","type":"journal_article","oa_version":"Published Version","article_processing_charge":"No","author":[{"last_name":"Dareiotis","full_name":"Dareiotis, Konstantinos","first_name":"Konstantinos"},{"id":"44ECEDF2-F248-11E8-B48F-1D18A9856A87","first_name":"Mate","last_name":"Gerencser","full_name":"Gerencser, Mate"}],"date_updated":"2023-10-16T09:22:50Z","department":[{"_id":"JaMa"}]},{"status":"public","isi":1,"oa_version":"Preprint","type":"journal_article","doi":"10.1142/S2010326320500069","publication_status":"published","article_processing_charge":"No","author":[{"full_name":"Cipolloni, Giorgio","last_name":"Cipolloni","first_name":"Giorgio","orcid":"0000-0002-4901-7992","id":"42198EFA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Erdös, László","last_name":"Erdös","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5366-9603","first_name":"László"}],"department":[{"_id":"LaEr"}],"date_updated":"2025-07-10T11:53:26Z","language":[{"iso":"eng"}],"article_number":"2050006","citation":{"mla":"Cipolloni, Giorgio, and László Erdös. “Fluctuations for Differences of Linear Eigenvalue Statistics for Sample Covariance Matrices.” <i>Random Matrices: Theory and Application</i>, vol. 9, no. 3, 2050006, World Scientific Publishing, 2020, doi:<a href=\"https://doi.org/10.1142/S2010326320500069\">10.1142/S2010326320500069</a>.","ieee":"G. Cipolloni and L. Erdös, “Fluctuations for differences of linear eigenvalue statistics for sample covariance matrices,” <i>Random Matrices: Theory and Application</i>, vol. 9, no. 3. World Scientific Publishing, 2020.","ista":"Cipolloni G, Erdös L. 2020. Fluctuations for differences of linear eigenvalue statistics for sample covariance matrices. Random Matrices: Theory and Application. 9(3), 2050006.","short":"G. Cipolloni, L. Erdös, Random Matrices: Theory and Application 9 (2020).","chicago":"Cipolloni, Giorgio, and László Erdös. “Fluctuations for Differences of Linear Eigenvalue Statistics for Sample Covariance Matrices.” <i>Random Matrices: Theory and Application</i>. World Scientific Publishing, 2020. <a href=\"https://doi.org/10.1142/S2010326320500069\">https://doi.org/10.1142/S2010326320500069</a>.","apa":"Cipolloni, G., &#38; Erdös, L. (2020). Fluctuations for differences of linear eigenvalue statistics for sample covariance matrices. <i>Random Matrices: Theory and Application</i>. World Scientific Publishing. <a href=\"https://doi.org/10.1142/S2010326320500069\">https://doi.org/10.1142/S2010326320500069</a>","ama":"Cipolloni G, Erdös L. Fluctuations for differences of linear eigenvalue statistics for sample covariance matrices. <i>Random Matrices: Theory and Application</i>. 2020;9(3). doi:<a href=\"https://doi.org/10.1142/S2010326320500069\">10.1142/S2010326320500069</a>"},"project":[{"grant_number":"338804","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Random matrices, universality and disordered quantum systems"},{"grant_number":"665385","call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program"}],"scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"07","publication_identifier":{"eissn":["2010-3271"],"issn":["2010-3263"]},"external_id":{"isi":["000547464400001"],"arxiv":["1806.08751"]},"quality_controlled":"1","main_file_link":[{"url":"https://arxiv.org/abs/1806.08751","open_access":"1"}],"intvolume":"         9","abstract":[{"lang":"eng","text":"We prove a central limit theorem for the difference of linear eigenvalue statistics of a sample covariance matrix W˜ and its minor W. We find that the fluctuation of this difference is much smaller than those of the individual linear statistics, as a consequence of the strong correlation between the eigenvalues of W˜ and W. Our result identifies the fluctuation of the spatial derivative of the approximate Gaussian field in the recent paper by Dumitru and Paquette. Unlike in a similar result for Wigner matrices, for sample covariance matrices, the fluctuation may entirely vanish."}],"date_created":"2019-05-26T21:59:14Z","oa":1,"issue":"3","year":"2020","date_published":"2020-07-01T00:00:00Z","day":"01","publisher":"World Scientific Publishing","arxiv":1,"_id":"6488","title":"Fluctuations for differences of linear eigenvalue statistics for sample covariance matrices","article_type":"original","ec_funded":1,"volume":9,"publication":"Random Matrices: Theory and Application"},{"publication_status":"published","doi":"10.1007/s10208-019-09419-x","type":"journal_article","oa_version":"Preprint","isi":1,"status":"public","date_updated":"2025-07-10T11:53:32Z","department":[{"_id":"UlWa"}],"article_processing_charge":"No","author":[{"last_name":"Filakovský","full_name":"Filakovský, Marek","first_name":"Marek","id":"3E8AF77E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Vokřínek","full_name":"Vokřínek, Lukas","first_name":"Lukas"}],"scopus_import":"1","project":[{"name":"Algorithms for Embeddings and Homotopy Theory","_id":"26611F5C-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P31312"}],"citation":{"ama":"Filakovský M, Vokřínek L. Are two given maps homotopic? An algorithmic viewpoint. <i>Foundations of Computational Mathematics</i>. 2020;20:311-330. doi:<a href=\"https://doi.org/10.1007/s10208-019-09419-x\">10.1007/s10208-019-09419-x</a>","chicago":"Filakovský, Marek, and Lukas Vokřínek. “Are Two given Maps Homotopic? An Algorithmic Viewpoint.” <i>Foundations of Computational Mathematics</i>. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/s10208-019-09419-x\">https://doi.org/10.1007/s10208-019-09419-x</a>.","apa":"Filakovský, M., &#38; Vokřínek, L. (2020). Are two given maps homotopic? An algorithmic viewpoint. <i>Foundations of Computational Mathematics</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s10208-019-09419-x\">https://doi.org/10.1007/s10208-019-09419-x</a>","mla":"Filakovský, Marek, and Lukas Vokřínek. “Are Two given Maps Homotopic? An Algorithmic Viewpoint.” <i>Foundations of Computational Mathematics</i>, vol. 20, Springer Nature, 2020, pp. 311–30, doi:<a href=\"https://doi.org/10.1007/s10208-019-09419-x\">10.1007/s10208-019-09419-x</a>.","ista":"Filakovský M, Vokřínek L. 2020. Are two given maps homotopic? An algorithmic viewpoint. Foundations of Computational Mathematics. 20, 311–330.","ieee":"M. Filakovský and L. Vokřínek, “Are two given maps homotopic? An algorithmic viewpoint,” <i>Foundations of Computational Mathematics</i>, vol. 20. Springer Nature, pp. 311–330, 2020.","short":"M. Filakovský, L. Vokřínek, Foundations of Computational Mathematics 20 (2020) 311–330."},"language":[{"iso":"eng"}],"page":"311-330","external_id":{"isi":["000522437400004"],"arxiv":["1312.2337"]},"publication_identifier":{"issn":["1615-3375"],"eissn":["1615-3383"]},"month":"04","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2019-06-16T21:59:14Z","abstract":[{"text":"This paper presents two algorithms. The first decides the existence of a pointed homotopy between given simplicial maps 𝑓,𝑔:𝑋→𝑌, and the second computes the group [𝛴𝑋,𝑌]∗ of pointed homotopy classes of maps from a suspension; in both cases, the target Y is assumed simply connected. More generally, these algorithms work relative to 𝐴⊆𝑋.","lang":"eng"}],"intvolume":"        20","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1312.2337"}],"quality_controlled":"1","date_published":"2020-04-01T00:00:00Z","year":"2020","oa":1,"_id":"6563","arxiv":1,"publisher":"Springer Nature","day":"01","publication":"Foundations of Computational Mathematics","volume":20,"article_type":"original","title":"Are two given maps homotopic? An algorithmic viewpoint"},{"department":[{"_id":"VlKo"}],"date_updated":"2024-11-04T13:52:40Z","article_processing_charge":"No","author":[{"full_name":"Shehu, Yekini","last_name":"Shehu","first_name":"Yekini","orcid":"0000-0001-9224-7139","id":"3FC7CB58-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Li, Xiao-Huan","last_name":"Li","first_name":"Xiao-Huan"},{"last_name":"Dong","full_name":"Dong, Qiao-Li","first_name":"Qiao-Li"}],"type":"journal_article","oa_version":"Submitted Version","publication_status":"published","doi":"10.1007/s11075-019-00758-y","status":"public","isi":1,"publication_identifier":{"issn":["1017-1398"],"eissn":["1572-9265"]},"acknowledgement":"The research of this author is supported by the ERC grant at the IST.","file":[{"file_id":"6927","access_level":"open_access","date_created":"2019-10-01T13:14:10Z","content_type":"application/pdf","creator":"kschuh","date_updated":"2020-07-14T12:47:34Z","file_name":"ExtragradientMethodPaper.pdf","relation":"main_file","checksum":"bb1a1eb3ebb2df380863d0db594673ba","file_size":359654}],"page":"365-388","external_id":{"isi":["000528979000015"]},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","month":"05","corr_author":"1","project":[{"grant_number":"616160","_id":"25FBA906-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Discrete Optimization in Computer Vision: Theory and Practice"}],"file_date_updated":"2020-07-14T12:47:34Z","scopus_import":"1","language":[{"iso":"eng"}],"citation":{"apa":"Shehu, Y., Li, X.-H., &#38; Dong, Q.-L. (2020). An efficient projection-type method for monotone variational inequalities in Hilbert spaces. <i>Numerical Algorithms</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s11075-019-00758-y\">https://doi.org/10.1007/s11075-019-00758-y</a>","chicago":"Shehu, Yekini, Xiao-Huan Li, and Qiao-Li Dong. “An Efficient Projection-Type Method for Monotone Variational Inequalities in Hilbert Spaces.” <i>Numerical Algorithms</i>. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/s11075-019-00758-y\">https://doi.org/10.1007/s11075-019-00758-y</a>.","ama":"Shehu Y, Li X-H, Dong Q-L. An efficient projection-type method for monotone variational inequalities in Hilbert spaces. <i>Numerical Algorithms</i>. 2020;84:365-388. doi:<a href=\"https://doi.org/10.1007/s11075-019-00758-y\">10.1007/s11075-019-00758-y</a>","ieee":"Y. Shehu, X.-H. Li, and Q.-L. Dong, “An efficient projection-type method for monotone variational inequalities in Hilbert spaces,” <i>Numerical Algorithms</i>, vol. 84. Springer Nature, pp. 365–388, 2020.","ista":"Shehu Y, Li X-H, Dong Q-L. 2020. An efficient projection-type method for monotone variational inequalities in Hilbert spaces. Numerical Algorithms. 84, 365–388.","short":"Y. Shehu, X.-H. Li, Q.-L. Dong, Numerical Algorithms 84 (2020) 365–388.","mla":"Shehu, Yekini, et al. “An Efficient Projection-Type Method for Monotone Variational Inequalities in Hilbert Spaces.” <i>Numerical Algorithms</i>, vol. 84, Springer Nature, 2020, pp. 365–88, doi:<a href=\"https://doi.org/10.1007/s11075-019-00758-y\">10.1007/s11075-019-00758-y</a>."},"has_accepted_license":"1","year":"2020","date_published":"2020-05-01T00:00:00Z","oa":1,"quality_controlled":"1","abstract":[{"lang":"eng","text":"We consider the monotone variational inequality problem in a Hilbert space and describe a projection-type method with inertial terms under the following properties: (a) The method generates a strongly convergent iteration sequence; (b) The method requires, at each iteration, only one projection onto the feasible set and two evaluations of the operator; (c) The method is designed for variational inequality for which the underline operator is monotone and uniformly continuous; (d) The method includes an inertial term. The latter is also shown to speed up the convergence in our numerical results. A comparison with some related methods is given and indicates that the new method is promising."}],"intvolume":"        84","date_created":"2019-06-27T20:09:33Z","publication":"Numerical Algorithms","ec_funded":1,"article_type":"original","title":"An efficient projection-type method for monotone variational inequalities in Hilbert spaces","volume":84,"publisher":"Springer Nature","day":"01","_id":"6593","ddc":["000"]},{"department":[{"_id":"MaMo"}],"date_updated":"2024-10-21T06:02:33Z","article_processing_charge":"No","author":[{"first_name":"Adel","full_name":"Javanmard, Adel","last_name":"Javanmard"},{"first_name":"Marco","orcid":"0000-0002-3242-7020","id":"27EB676C-8706-11E9-9510-7717E6697425","full_name":"Mondelli, Marco","last_name":"Mondelli"},{"last_name":"Montanari","full_name":"Montanari, Andrea","first_name":"Andrea"}],"oa_version":"Preprint","type":"journal_article","doi":"10.1214/20-AOS1945","publication_status":"published","status":"public","isi":1,"publication_identifier":{"eissn":["1941-7330"],"issn":["1932-6157"]},"external_id":{"arxiv":["1901.01375"],"isi":["000598369200021"]},"page":"3619-3642","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"12","scopus_import":"1","language":[{"iso":"eng"}],"citation":{"ama":"Javanmard A, Mondelli M, Montanari A. Analysis of a two-layer neural network via displacement convexity. <i>Annals of Statistics</i>. 2020;48(6):3619-3642. doi:<a href=\"https://doi.org/10.1214/20-AOS1945\">10.1214/20-AOS1945</a>","chicago":"Javanmard, Adel, Marco Mondelli, and Andrea Montanari. “Analysis of a Two-Layer Neural Network via Displacement Convexity.” <i>Annals of Statistics</i>. Institute of Mathematical Statistics, 2020. <a href=\"https://doi.org/10.1214/20-AOS1945\">https://doi.org/10.1214/20-AOS1945</a>.","apa":"Javanmard, A., Mondelli, M., &#38; Montanari, A. (2020). Analysis of a two-layer neural network via displacement convexity. <i>Annals of Statistics</i>. Institute of Mathematical Statistics. <a href=\"https://doi.org/10.1214/20-AOS1945\">https://doi.org/10.1214/20-AOS1945</a>","mla":"Javanmard, Adel, et al. “Analysis of a Two-Layer Neural Network via Displacement Convexity.” <i>Annals of Statistics</i>, vol. 48, no. 6, Institute of Mathematical Statistics, 2020, pp. 3619–42, doi:<a href=\"https://doi.org/10.1214/20-AOS1945\">10.1214/20-AOS1945</a>.","ieee":"A. Javanmard, M. Mondelli, and A. Montanari, “Analysis of a two-layer neural network via displacement convexity,” <i>Annals of Statistics</i>, vol. 48, no. 6. Institute of Mathematical Statistics, pp. 3619–3642, 2020.","ista":"Javanmard A, Mondelli M, Montanari A. 2020. Analysis of a two-layer neural network via displacement convexity. Annals of Statistics. 48(6), 3619–3642.","short":"A. Javanmard, M. Mondelli, A. Montanari, Annals of Statistics 48 (2020) 3619–3642."},"issue":"6","year":"2020","date_published":"2020-12-11T00:00:00Z","oa":1,"quality_controlled":"1","main_file_link":[{"url":"https://arxiv.org/abs/1901.01375","open_access":"1"}],"abstract":[{"lang":"eng","text":"Fitting a function by using linear combinations of a large number N of `simple' components is one of the most fruitful ideas in statistical learning. This idea lies at the core of a variety of methods, from two-layer neural networks to kernel regression, to boosting. In general, the resulting risk minimization problem is non-convex and is solved by gradient descent or its variants. Unfortunately, little is known about global convergence properties of these approaches.\r\nHere we consider the problem of learning a concave function f on a compact convex domain Ω⊆ℝd, using linear combinations of `bump-like' components (neurons). The parameters to be fitted are the centers of N bumps, and the resulting empirical risk minimization problem is highly non-convex. We prove that, in the limit in which the number of neurons diverges, the evolution of gradient descent converges to a Wasserstein gradient flow in the space of probability distributions over Ω. Further, when the bump width δ tends to 0, this gradient flow has a limit which is a viscous porous medium equation. Remarkably, the cost function optimized by this gradient flow exhibits a special property known as displacement convexity, which implies exponential convergence rates for N→∞, δ→0. Surprisingly, this asymptotic theory appears to capture well the behavior for moderate values of δ,N. Explaining this phenomenon, and understanding the dependence on δ,N in a quantitative manner remains an outstanding challenge."}],"date_created":"2019-07-31T09:39:42Z","intvolume":"        48","publication":"Annals of Statistics","article_type":"original","title":"Analysis of a two-layer neural network via displacement convexity","volume":48,"day":"11","arxiv":1,"publisher":"Institute of Mathematical Statistics","_id":"6748"},{"doi":"10.1002/hipo.23144","publication_status":"published","oa_version":"Published Version","type":"journal_article","isi":1,"status":"public","date_updated":"2025-05-22T11:13:25Z","department":[{"_id":"JoCs"}],"author":[{"last_name":"Stella","full_name":"Stella, Federico","first_name":"Federico","id":"39AF1E74-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9439-3148"},{"last_name":"Urdapilleta","full_name":"Urdapilleta, Eugenio","first_name":"Eugenio"},{"full_name":"Luo, Yifan","last_name":"Luo","first_name":"Yifan"},{"last_name":"Treves","full_name":"Treves, Alessandro","first_name":"Alessandro"}],"article_processing_charge":"No","scopus_import":"1","file_date_updated":"2020-07-14T12:47:40Z","has_accepted_license":"1","citation":{"mla":"Stella, Federico, et al. “Partial Coherence and Frustration in Self-Organizing Spherical Grids.” <i>Hippocampus</i>, vol. 30, no. 4, Wiley, 2020, pp. 302–13, doi:<a href=\"https://doi.org/10.1002/hipo.23144\">10.1002/hipo.23144</a>.","ista":"Stella F, Urdapilleta E, Luo Y, Treves A. 2020. Partial coherence and frustration in self-organizing spherical grids. Hippocampus. 30(4), 302–313.","ieee":"F. Stella, E. Urdapilleta, Y. Luo, and A. Treves, “Partial coherence and frustration in self-organizing spherical grids,” <i>Hippocampus</i>, vol. 30, no. 4. Wiley, pp. 302–313, 2020.","short":"F. Stella, E. Urdapilleta, Y. Luo, A. Treves, Hippocampus 30 (2020) 302–313.","ama":"Stella F, Urdapilleta E, Luo Y, Treves A. Partial coherence and frustration in self-organizing spherical grids. <i>Hippocampus</i>. 2020;30(4):302-313. doi:<a href=\"https://doi.org/10.1002/hipo.23144\">10.1002/hipo.23144</a>","chicago":"Stella, Federico, Eugenio Urdapilleta, Yifan Luo, and Alessandro Treves. “Partial Coherence and Frustration in Self-Organizing Spherical Grids.” <i>Hippocampus</i>. Wiley, 2020. <a href=\"https://doi.org/10.1002/hipo.23144\">https://doi.org/10.1002/hipo.23144</a>.","apa":"Stella, F., Urdapilleta, E., Luo, Y., &#38; Treves, A. (2020). Partial coherence and frustration in self-organizing spherical grids. <i>Hippocampus</i>. Wiley. <a href=\"https://doi.org/10.1002/hipo.23144\">https://doi.org/10.1002/hipo.23144</a>"},"language":[{"iso":"eng"}],"external_id":{"isi":["000477299600001"],"pmid":["31339190"]},"page":"302-313","file":[{"creator":"dernst","content_type":"application/pdf","file_id":"6800","date_created":"2019-08-12T07:53:33Z","access_level":"open_access","checksum":"7b54d22bfbfc0d1188a9ea24d985bfb2","relation":"main_file","file_size":2370658,"file_name":"2019_Hippocampus_Stella.pdf","date_updated":"2020-07-14T12:47:40Z"}],"publication_identifier":{"issn":["1050-9631"],"eissn":["1098-1063"]},"user_id":"9947682f-b9fa-11ee-9c4a-b3ffaafe6614","month":"04","date_created":"2019-08-11T21:59:24Z","intvolume":"        30","abstract":[{"lang":"eng","text":"Nearby grid cells have been observed to express a remarkable degree of long-rangeorder, which is often idealized as extending potentially to infinity. Yet their strict peri-odic firing and ensemble coherence are theoretically possible only in flat environments, much unlike the burrows which rodents usually live in. Are the symmetrical, coherent grid maps inferred in the lab relevant to chart their way in their natural habitat? We consider spheres as simple models of curved environments and waiting for the appropriate experiments to be performed, we use our adaptation model to predict what grid maps would emerge in a network with the same type of recurrent connections, which on the plane produce coherence among the units. We find that on the sphere such connections distort the maps that single grid units would express on their own, and aggregate them into clusters. When remapping to a different spherical environment, units in each cluster maintain only partial coherence, similar to what is observed in disordered materials, such as spin glasses."}],"quality_controlled":"1","date_published":"2020-04-01T00:00:00Z","issue":"4","year":"2020","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"oa":1,"_id":"6796","day":"01","publisher":"Wiley","ddc":["570"],"pmid":1,"publication":"Hippocampus","volume":30,"article_type":"original","title":"Partial coherence and frustration in self-organizing spherical grids"},{"citation":{"ista":"Jahr W, Velicky P, Danzl JG. 2020. Strategies to maximize performance in STimulated Emission Depletion (STED) nanoscopy of biological specimens. Methods. 174(3), 27–41.","short":"W. Jahr, P. Velicky, J.G. Danzl, Methods 174 (2020) 27–41.","ieee":"W. Jahr, P. Velicky, and J. G. Danzl, “Strategies to maximize performance in STimulated Emission Depletion (STED) nanoscopy of biological specimens,” <i>Methods</i>, vol. 174, no. 3. Elsevier, pp. 27–41, 2020.","mla":"Jahr, Wiebke, et al. “Strategies to Maximize Performance in STimulated Emission Depletion (STED) Nanoscopy of Biological Specimens.” <i>Methods</i>, vol. 174, no. 3, Elsevier, 2020, pp. 27–41, doi:<a href=\"https://doi.org/10.1016/j.ymeth.2019.07.019\">10.1016/j.ymeth.2019.07.019</a>.","ama":"Jahr W, Velicky P, Danzl JG. Strategies to maximize performance in STimulated Emission Depletion (STED) nanoscopy of biological specimens. <i>Methods</i>. 2020;174(3):27-41. doi:<a href=\"https://doi.org/10.1016/j.ymeth.2019.07.019\">10.1016/j.ymeth.2019.07.019</a>","apa":"Jahr, W., Velicky, P., &#38; Danzl, J. G. (2020). Strategies to maximize performance in STimulated Emission Depletion (STED) nanoscopy of biological specimens. <i>Methods</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ymeth.2019.07.019\">https://doi.org/10.1016/j.ymeth.2019.07.019</a>","chicago":"Jahr, Wiebke, Philipp Velicky, and Johann G Danzl. “Strategies to Maximize Performance in STimulated Emission Depletion (STED) Nanoscopy of Biological Specimens.” <i>Methods</i>. Elsevier, 2020. <a href=\"https://doi.org/10.1016/j.ymeth.2019.07.019\">https://doi.org/10.1016/j.ymeth.2019.07.019</a>."},"language":[{"iso":"eng"}],"scopus_import":"1","project":[{"grant_number":"I03600","name":"Optical control of synaptic function via adhesion molecules","_id":"265CB4D0-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"LT00057","name":"High-speed 3D-nanoscopy to study the role of adhesion during 3D cell migration","_id":"2668BFA0-B435-11E9-9278-68D0E5697425"}],"month":"03","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","external_id":{"pmid":["31344404"],"isi":["000525860400005"]},"page":"27-41","publication_identifier":{"issn":["1046-2023"]},"isi":1,"status":"public","doi":"10.1016/j.ymeth.2019.07.019","publication_status":"published","oa_version":"Submitted Version","type":"journal_article","author":[{"first_name":"Wiebke","id":"425C1CE8-F248-11E8-B48F-1D18A9856A87","full_name":"Jahr, Wiebke","last_name":"Jahr"},{"id":"39BDC62C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2340-7431","first_name":"Philipp","full_name":"Velicky, Philipp","last_name":"Velicky"},{"last_name":"Danzl","full_name":"Danzl, Johann G","first_name":"Johann G","orcid":"0000-0001-8559-3973","id":"42EFD3B6-F248-11E8-B48F-1D18A9856A87"}],"article_processing_charge":"No","date_updated":"2025-04-14T09:39:25Z","department":[{"_id":"JoDa"}],"pmid":1,"_id":"6808","day":"01","publisher":"Elsevier","volume":174,"title":"Strategies to maximize performance in STimulated Emission Depletion (STED) nanoscopy of biological specimens","article_type":"original","publication":"Methods","main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7100895/","open_access":"1"}],"date_created":"2019-08-12T16:36:32Z","abstract":[{"text":"Super-resolution fluorescence microscopy has become an important catalyst for discovery in the life sciences. In STimulated Emission Depletion (STED) microscopy, a pattern of light drives fluorophores from a signal-emitting on-state to a non-signalling off-state. Only emitters residing in a sub-diffraction volume around an intensity minimum are allowed to fluoresce, rendering them distinguishable from the nearby, but dark fluorophores. STED routinely achieves resolution in the few tens of nanometers range in biological samples and is suitable for live imaging. Here, we review the working principle of STED and provide general guidelines for successful STED imaging. The strive for ever higher resolution comes at the cost of increased light burden. We discuss techniques to reduce light exposure and mitigate its detrimental effects on the specimen. These include specialized illumination strategies as well as protecting fluorophores from photobleaching mediated by high-intensity STED light. This opens up the prospect of volumetric imaging in living cells and tissues with diffraction-unlimited resolution in all three spatial dimensions.","lang":"eng"}],"intvolume":"       174","quality_controlled":"1","oa":1,"date_published":"2020-03-01T00:00:00Z","issue":"3","year":"2020"},{"year":"2020","date_published":"2020-06-01T00:00:00Z","oa":1,"quality_controlled":"1","main_file_link":[{"url":"https://arxiv.org/abs/1812.03086","open_access":"1"}],"abstract":[{"lang":"eng","text":"We consider systems of bosons trapped in a box, in the Gross–Pitaevskii regime. We show that low-energy states exhibit complete Bose–Einstein condensation with an optimal bound on the number of orthogonal excitations. This extends recent results obtained in Boccato et al. (Commun Math Phys 359(3):975–1026, 2018), removing the assumption of small interaction potential."}],"date_created":"2019-09-24T17:30:59Z","intvolume":"       376","publication":"Communications in Mathematical Physics","title":"Optimal rate for Bose-Einstein condensation in the Gross-Pitaevskii regime","article_type":"original","ec_funded":1,"volume":376,"day":"01","publisher":"Springer","arxiv":1,"_id":"6906","department":[{"_id":"RoSe"}],"date_updated":"2025-04-14T07:27:00Z","article_processing_charge":"No","author":[{"last_name":"Boccato","full_name":"Boccato, Chiara","first_name":"Chiara","id":"342E7E22-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Brennecke, Christian","last_name":"Brennecke","first_name":"Christian"},{"last_name":"Cenatiempo","full_name":"Cenatiempo, Serena","first_name":"Serena"},{"last_name":"Schlein","full_name":"Schlein, Benjamin","first_name":"Benjamin"}],"oa_version":"Preprint","type":"journal_article","doi":"10.1007/s00220-019-03555-9","publication_status":"published","status":"public","isi":1,"publication_identifier":{"eissn":["1432-0916"],"issn":["0010-3616"]},"external_id":{"isi":["000536053300012"],"arxiv":["1812.03086"]},"acknowledgement":"We would like to thank P. T. Nam and R. Seiringer for several useful discussions and\r\nfor suggesting us to use the localization techniques from [9]. C. Boccato has received funding from the\r\nEuropean Research Council (ERC) under the programme Horizon 2020 (Grant Agreement 694227). B. Schlein gratefully acknowledges support from the NCCR SwissMAP and from the Swiss National Foundation of Science (Grant No. 200020_1726230) through the SNF Grant “Dynamical and energetic properties of Bose–Einstein condensates”.","page":"1311-1395","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","month":"06","project":[{"_id":"25C6DC12-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Analysis of quantum many-body systems","grant_number":"694227"}],"scopus_import":"1","language":[{"iso":"eng"}],"citation":{"short":"C. Boccato, C. Brennecke, S. Cenatiempo, B. Schlein, Communications in Mathematical Physics 376 (2020) 1311–1395.","ieee":"C. Boccato, C. Brennecke, S. Cenatiempo, and B. Schlein, “Optimal rate for Bose-Einstein condensation in the Gross-Pitaevskii regime,” <i>Communications in Mathematical Physics</i>, vol. 376. Springer, pp. 1311–1395, 2020.","ista":"Boccato C, Brennecke C, Cenatiempo S, Schlein B. 2020. Optimal rate for Bose-Einstein condensation in the Gross-Pitaevskii regime. Communications in Mathematical Physics. 376, 1311–1395.","mla":"Boccato, Chiara, et al. “Optimal Rate for Bose-Einstein Condensation in the Gross-Pitaevskii Regime.” <i>Communications in Mathematical Physics</i>, vol. 376, Springer, 2020, pp. 1311–95, doi:<a href=\"https://doi.org/10.1007/s00220-019-03555-9\">10.1007/s00220-019-03555-9</a>.","ama":"Boccato C, Brennecke C, Cenatiempo S, Schlein B. Optimal rate for Bose-Einstein condensation in the Gross-Pitaevskii regime. <i>Communications in Mathematical Physics</i>. 2020;376:1311-1395. doi:<a href=\"https://doi.org/10.1007/s00220-019-03555-9\">10.1007/s00220-019-03555-9</a>","apa":"Boccato, C., Brennecke, C., Cenatiempo, S., &#38; Schlein, B. (2020). Optimal rate for Bose-Einstein condensation in the Gross-Pitaevskii regime. <i>Communications in Mathematical Physics</i>. Springer. <a href=\"https://doi.org/10.1007/s00220-019-03555-9\">https://doi.org/10.1007/s00220-019-03555-9</a>","chicago":"Boccato, Chiara, Christian Brennecke, Serena Cenatiempo, and Benjamin Schlein. “Optimal Rate for Bose-Einstein Condensation in the Gross-Pitaevskii Regime.” <i>Communications in Mathematical Physics</i>. Springer, 2020. <a href=\"https://doi.org/10.1007/s00220-019-03555-9\">https://doi.org/10.1007/s00220-019-03555-9</a>."}},{"issue":"4","year":"2020","date_published":"2020-04-01T00:00:00Z","oa":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"quality_controlled":"1","date_created":"2019-10-14T09:14:28Z","abstract":[{"lang":"eng","text":"We study the problem of automatically detecting if a given multi-class classifier operates outside of its specifications (out-of-specs), i.e. on input data from a different distribution than what it was trained for. This is an important problem to solve on the road towards creating reliable computer vision systems for real-world applications, because the quality of a classifier’s predictions cannot be guaranteed if it operates out-of-specs. Previously proposed methods for out-of-specs detection make decisions on the level of single inputs. This, however, is insufficient to achieve low false positive rate and high false negative rates at the same time. In this work, we describe a new procedure named KS(conf), based on statistical reasoning. Its main component is a classical Kolmogorov–Smirnov test that is applied to the set of predicted confidence values for batches of samples. Working with batches instead of single samples allows increasing the true positive rate without negatively affecting the false positive rate, thereby overcoming a crucial limitation of single sample tests. We show by extensive experiments using a variety of convolutional network architectures and datasets that KS(conf) reliably detects out-of-specs situations even under conditions where other tests fail. It furthermore has a number of properties that make it an excellent candidate for practical deployment: it is easy to implement, adds almost no overhead to the system, works with any classifier that outputs confidence scores, and requires no a priori knowledge about how the data distribution could change."}],"intvolume":"       128","publication":"International Journal of Computer Vision","title":"KS(conf): A light-weight test if a multiclass classifier operates outside of its specifications","article_type":"original","ec_funded":1,"volume":128,"day":"01","publisher":"Springer Nature","_id":"6944","ddc":["004"],"department":[{"_id":"ChLa"}],"date_updated":"2025-04-15T07:10:25Z","author":[{"full_name":"Sun, Rémy","last_name":"Sun","first_name":"Rémy"},{"last_name":"Lampert","full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","first_name":"Christoph"}],"article_processing_charge":"Yes (via OA deal)","oa_version":"Published Version","type":"journal_article","doi":"10.1007/s11263-019-01232-x","publication_status":"published","status":"public","isi":1,"publication_identifier":{"issn":["0920-5691"],"eissn":["1573-1405"]},"external_id":{"isi":["000494406800001"]},"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"6482"}],"link":[{"url":"https://doi.org/10.1007/s11263-019-01262-5","relation":"erratum"}]},"file":[{"file_name":"2019_IJCV_Sun.pdf","date_updated":"2020-07-14T12:47:45Z","file_size":1715072,"checksum":"155e63edf664dcacb3bdc1c2223e606f","relation":"main_file","date_created":"2019-11-26T10:30:02Z","access_level":"open_access","file_id":"7110","content_type":"application/pdf","creator":"dernst"}],"page":"970-995","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","month":"04","file_date_updated":"2020-07-14T12:47:45Z","project":[{"name":"Lifelong Learning of Visual Scene Understanding","_id":"2532554C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"308036"},{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}],"corr_author":"1","scopus_import":"1","language":[{"iso":"eng"}],"has_accepted_license":"1","citation":{"mla":"Sun, Rémy, and Christoph Lampert. “KS(Conf): A Light-Weight Test If a Multiclass Classifier Operates Outside of Its Specifications.” <i>International Journal of Computer Vision</i>, vol. 128, no. 4, Springer Nature, 2020, pp. 970–95, doi:<a href=\"https://doi.org/10.1007/s11263-019-01232-x\">10.1007/s11263-019-01232-x</a>.","short":"R. Sun, C. Lampert, International Journal of Computer Vision 128 (2020) 970–995.","ieee":"R. Sun and C. Lampert, “KS(conf): A light-weight test if a multiclass classifier operates outside of its specifications,” <i>International Journal of Computer Vision</i>, vol. 128, no. 4. Springer Nature, pp. 970–995, 2020.","ista":"Sun R, Lampert C. 2020. KS(conf): A light-weight test if a multiclass classifier operates outside of its specifications. International Journal of Computer Vision. 128(4), 970–995.","ama":"Sun R, Lampert C. KS(conf): A light-weight test if a multiclass classifier operates outside of its specifications. <i>International Journal of Computer Vision</i>. 2020;128(4):970-995. doi:<a href=\"https://doi.org/10.1007/s11263-019-01232-x\">10.1007/s11263-019-01232-x</a>","chicago":"Sun, Rémy, and Christoph Lampert. “KS(Conf): A Light-Weight Test If a Multiclass Classifier Operates Outside of Its Specifications.” <i>International Journal of Computer Vision</i>. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/s11263-019-01232-x\">https://doi.org/10.1007/s11263-019-01232-x</a>.","apa":"Sun, R., &#38; Lampert, C. (2020). KS(conf): A light-weight test if a multiclass classifier operates outside of its specifications. <i>International Journal of Computer Vision</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s11263-019-01232-x\">https://doi.org/10.1007/s11263-019-01232-x</a>"}},{"year":"2020","date_published":"2020-04-01T00:00:00Z","oa":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"quality_controlled":"1","abstract":[{"lang":"eng","text":"We present a unified framework tackling two problems: class-specific 3D reconstruction from a single image, and generation of new 3D shape samples. These tasks have received considerable attention recently; however, most existing approaches rely on 3D supervision, annotation of 2D images with keypoints or poses, and/or training with multiple views of each object instance. Our framework is very general: it can be trained in similar settings to existing approaches, while also supporting weaker supervision. Importantly, it can be trained purely from 2D images, without pose annotations, and with only a single view per instance. We employ meshes as an output representation, instead of voxels used in most prior work. This allows us to reason over lighting parameters and exploit shading information during training, which previous 2D-supervised methods cannot. Thus, our method can learn to generate and reconstruct concave object classes. We evaluate our approach in various settings, showing that: (i) it learns to disentangle shape from pose and lighting; (ii) using shading in the loss improves performance compared to just silhouettes; (iii) when using a standard single white light, our model outperforms state-of-the-art 2D-supervised methods, both with and without pose supervision, thanks to exploiting shading cues; (iv) performance improves further when using multiple coloured lights, even approaching that of state-of-the-art 3D-supervised methods; (v) shapes produced by our model capture smooth surfaces and fine details better than voxel-based approaches; and (vi) our approach supports concave classes such as bathtubs and sofas, which methods based on silhouettes cannot learn."}],"intvolume":"       128","date_created":"2019-10-17T13:38:20Z","publication":"International Journal of Computer Vision","title":"Learning single-image 3D reconstruction by generative modelling of shape, pose and shading","article_type":"original","volume":128,"day":"01","publisher":"Springer Nature","arxiv":1,"_id":"6952","ddc":["004"],"department":[{"_id":"ChLa"}],"date_updated":"2025-04-15T06:53:15Z","article_processing_charge":"Yes (via OA deal)","author":[{"last_name":"Henderson","full_name":"Henderson, Paul M","first_name":"Paul M","id":"13C09E74-18D9-11E9-8878-32CFE5697425","orcid":"0000-0002-5198-7445"},{"full_name":"Ferrari, Vittorio","last_name":"Ferrari","first_name":"Vittorio"}],"oa_version":"Published Version","type":"journal_article","doi":"10.1007/s11263-019-01219-8","publication_status":"published","status":"public","isi":1,"publication_identifier":{"issn":["0920-5691"],"eissn":["1573-1405"]},"external_id":{"isi":["000491042100002"],"arxiv":["1901.06447"]},"page":"835-854","acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria).","file":[{"content_type":"application/pdf","creator":"dernst","access_level":"open_access","date_created":"2019-10-25T10:28:29Z","file_id":"6973","file_size":2243134,"relation":"main_file","checksum":"a0f05dd4f5f64e4f713d8d9d4b5b1e3f","date_updated":"2020-07-14T12:47:46Z","file_name":"2019_CompVision_Henderson.pdf"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","month":"04","file_date_updated":"2020-07-14T12:47:46Z","project":[{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}],"corr_author":"1","scopus_import":"1","language":[{"iso":"eng"}],"has_accepted_license":"1","citation":{"ama":"Henderson PM, Ferrari V. Learning single-image 3D reconstruction by generative modelling of shape, pose and shading. <i>International Journal of Computer Vision</i>. 2020;128:835-854. doi:<a href=\"https://doi.org/10.1007/s11263-019-01219-8\">10.1007/s11263-019-01219-8</a>","chicago":"Henderson, Paul M, and Vittorio Ferrari. “Learning Single-Image 3D Reconstruction by Generative Modelling of Shape, Pose and Shading.” <i>International Journal of Computer Vision</i>. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/s11263-019-01219-8\">https://doi.org/10.1007/s11263-019-01219-8</a>.","apa":"Henderson, P. M., &#38; Ferrari, V. (2020). Learning single-image 3D reconstruction by generative modelling of shape, pose and shading. <i>International Journal of Computer Vision</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s11263-019-01219-8\">https://doi.org/10.1007/s11263-019-01219-8</a>","mla":"Henderson, Paul M., and Vittorio Ferrari. “Learning Single-Image 3D Reconstruction by Generative Modelling of Shape, Pose and Shading.” <i>International Journal of Computer Vision</i>, vol. 128, Springer Nature, 2020, pp. 835–54, doi:<a href=\"https://doi.org/10.1007/s11263-019-01219-8\">10.1007/s11263-019-01219-8</a>.","short":"P.M. Henderson, V. Ferrari, International Journal of Computer Vision 128 (2020) 835–854.","ista":"Henderson PM, Ferrari V. 2020. Learning single-image 3D reconstruction by generative modelling of shape, pose and shading. International Journal of Computer Vision. 128, 835–854.","ieee":"P. M. Henderson and V. Ferrari, “Learning single-image 3D reconstruction by generative modelling of shape, pose and shading,” <i>International Journal of Computer Vision</i>, vol. 128. Springer Nature, pp. 835–854, 2020."}},{"article_type":"original","title":"Auxin guides roots to avoid obstacles during gravitropic growth","ec_funded":1,"volume":225,"publication":"New Phytologist","pmid":1,"ddc":["580"],"day":"01","publisher":"Wiley","_id":"6997","oa":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"issue":"3","year":"2020","date_published":"2020-02-01T00:00:00Z","quality_controlled":"1","intvolume":"       225","date_created":"2019-11-12T11:41:32Z","month":"02","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","publication_identifier":{"eissn":["1469-8137"],"issn":["0028-646x"]},"external_id":{"pmid":["31603260"],"isi":["000489638800001"]},"page":"1049-1052","file":[{"file_id":"8772","success":1,"access_level":"open_access","date_created":"2020-11-18T16:42:48Z","content_type":"application/pdf","creator":"dernst","date_updated":"2020-11-18T16:42:48Z","file_name":"2020_NewPhytologist_Zhang.pdf","relation":"main_file","checksum":"cd42ffdb381fd52812b9583d4d407139","file_size":717345}],"language":[{"iso":"eng"}],"has_accepted_license":"1","citation":{"apa":"Zhang, Y., &#38; Friml, J. (2020). Auxin guides roots to avoid obstacles during gravitropic growth. <i>New Phytologist</i>. Wiley. <a href=\"https://doi.org/10.1111/nph.16203\">https://doi.org/10.1111/nph.16203</a>","chicago":"Zhang, Yuzhou, and Jiří Friml. “Auxin Guides Roots to Avoid Obstacles during Gravitropic Growth.” <i>New Phytologist</i>. Wiley, 2020. <a href=\"https://doi.org/10.1111/nph.16203\">https://doi.org/10.1111/nph.16203</a>.","ama":"Zhang Y, Friml J. Auxin guides roots to avoid obstacles during gravitropic growth. <i>New Phytologist</i>. 2020;225(3):1049-1052. doi:<a href=\"https://doi.org/10.1111/nph.16203\">10.1111/nph.16203</a>","short":"Y. Zhang, J. Friml, New Phytologist 225 (2020) 1049–1052.","ieee":"Y. Zhang and J. Friml, “Auxin guides roots to avoid obstacles during gravitropic growth,” <i>New Phytologist</i>, vol. 225, no. 3. Wiley, pp. 1049–1052, 2020.","ista":"Zhang Y, Friml J. 2020. Auxin guides roots to avoid obstacles during gravitropic growth. New Phytologist. 225(3), 1049–1052.","mla":"Zhang, Yuzhou, and Jiří Friml. “Auxin Guides Roots to Avoid Obstacles during Gravitropic Growth.” <i>New Phytologist</i>, vol. 225, no. 3, Wiley, 2020, pp. 1049–52, doi:<a href=\"https://doi.org/10.1111/nph.16203\">10.1111/nph.16203</a>."},"file_date_updated":"2020-11-18T16:42:48Z","project":[{"_id":"261099A6-B435-11E9-9278-68D0E5697425","name":"Tracing Evolution of Auxin Transport and Polarity in Plants","call_identifier":"H2020","grant_number":"742985"},{"name":"Molecular mechanisms of endocytic cargo recognition in plants","_id":"26538374-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"I03630"},{"_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","grant_number":"291734"}],"corr_author":"1","scopus_import":"1","author":[{"first_name":"Yuzhou","id":"3B6137F2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2627-6956","full_name":"Zhang, Yuzhou","last_name":"Zhang"},{"orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jiří","last_name":"Friml","full_name":"Friml, Jiří"}],"article_processing_charge":"Yes (via OA deal)","department":[{"_id":"JiFr"}],"date_updated":"2025-04-14T07:45:04Z","status":"public","isi":1,"oa_version":"Published Version","type":"journal_article","doi":"10.1111/nph.16203","publication_status":"published"},{"day":"01","publisher":"Springer Nature","arxiv":1,"_id":"7004","article_type":"original","title":"Cohomological Hall algebras, vertex algebras and instantons","ec_funded":1,"volume":376,"publication":"Communications in Mathematical Physics","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1810.10402"}],"abstract":[{"lang":"eng","text":"We define an action of the (double of) Cohomological Hall algebra of Kontsevich and Soibelman on the cohomology of the moduli space of spiked instantons of Nekrasov. We identify this action with the one of the affine Yangian of gl(1). Based on that we derive the vertex algebra at the corner Wr1,r2,r3 of Gaiotto and Rapčák. We conjecture that our approach works for a big class of Calabi–Yau categories, including those associated with toric Calabi–Yau 3-folds."}],"intvolume":"       376","date_created":"2019-11-12T14:01:27Z","oa":1,"year":"2020","date_published":"2020-06-01T00:00:00Z","language":[{"iso":"eng"}],"citation":{"apa":"Rapcak, M., Soibelman, Y., Yang, Y., &#38; Zhao, G. (2020). Cohomological Hall algebras, vertex algebras and instantons. <i>Communications in Mathematical Physics</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00220-019-03575-5\">https://doi.org/10.1007/s00220-019-03575-5</a>","chicago":"Rapcak, Miroslav, Yan Soibelman, Yaping Yang, and Gufang Zhao. “Cohomological Hall Algebras, Vertex Algebras and Instantons.” <i>Communications in Mathematical Physics</i>. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/s00220-019-03575-5\">https://doi.org/10.1007/s00220-019-03575-5</a>.","ama":"Rapcak M, Soibelman Y, Yang Y, Zhao G. Cohomological Hall algebras, vertex algebras and instantons. <i>Communications in Mathematical Physics</i>. 2020;376:1803-1873. doi:<a href=\"https://doi.org/10.1007/s00220-019-03575-5\">10.1007/s00220-019-03575-5</a>","ista":"Rapcak M, Soibelman Y, Yang Y, Zhao G. 2020. Cohomological Hall algebras, vertex algebras and instantons. Communications in Mathematical Physics. 376, 1803–1873.","ieee":"M. Rapcak, Y. Soibelman, Y. Yang, and G. Zhao, “Cohomological Hall algebras, vertex algebras and instantons,” <i>Communications in Mathematical Physics</i>, vol. 376. Springer Nature, pp. 1803–1873, 2020.","short":"M. Rapcak, Y. Soibelman, Y. Yang, G. Zhao, Communications in Mathematical Physics 376 (2020) 1803–1873.","mla":"Rapcak, Miroslav, et al. “Cohomological Hall Algebras, Vertex Algebras and Instantons.” <i>Communications in Mathematical Physics</i>, vol. 376, Springer Nature, 2020, pp. 1803–73, doi:<a href=\"https://doi.org/10.1007/s00220-019-03575-5\">10.1007/s00220-019-03575-5</a>."},"project":[{"call_identifier":"FP7","_id":"25E549F4-B435-11E9-9278-68D0E5697425","name":"Arithmetic and physics of Higgs moduli spaces","grant_number":"320593"}],"scopus_import":"1","month":"06","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","publication_identifier":{"eissn":["1432-0916"],"issn":["0010-3616"]},"external_id":{"arxiv":["1810.10402"],"isi":["000536255500004"]},"page":"1803-1873","status":"public","isi":1,"oa_version":"Preprint","type":"journal_article","doi":"10.1007/s00220-019-03575-5","publication_status":"published","article_processing_charge":"No","author":[{"last_name":"Rapcak","full_name":"Rapcak, Miroslav","first_name":"Miroslav"},{"full_name":"Soibelman, Yan","last_name":"Soibelman","first_name":"Yan"},{"first_name":"Yaping","last_name":"Yang","full_name":"Yang, Yaping"},{"first_name":"Gufang","id":"2BC2AC5E-F248-11E8-B48F-1D18A9856A87","last_name":"Zhao","full_name":"Zhao, Gufang"}],"department":[{"_id":"TaHa"}],"date_updated":"2025-04-14T09:12:46Z"}]