[{"publication_identifier":{"eisbn":["9783030360207"],"issn":["00758434"],"eissn":["16179692"],"isbn":["9783030360191"]},"month":"06","external_id":{"isi":["000557689300003"],"arxiv":["1808.07350"]},"oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1808.07350"}],"project":[{"grant_number":"716117","_id":"256E75B8-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Optimal Transport and Stochastic Dynamics"}],"isi":1,"quality_controlled":"1","doi":"10.1007/978-3-030-36020-7_1","language":[{"iso":"eng"}],"ec_funded":1,"year":"2020","publisher":"Springer Nature","department":[{"_id":"HeEd"},{"_id":"JaMa"}],"editor":[{"full_name":"Klartag, Bo'az","last_name":"Klartag","first_name":"Bo'az"},{"first_name":"Emanuel","last_name":"Milman","full_name":"Milman, Emanuel"}],"publication_status":"published","author":[{"full_name":"Akopyan, Arseniy","orcid":"0000-0002-2548-617X","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","last_name":"Akopyan","first_name":"Arseniy"},{"first_name":"Roman","last_name":"Karasev","full_name":"Karasev, Roman"}],"volume":2256,"date_created":"2018-12-11T11:44:29Z","date_updated":"2023-08-17T13:48:31Z","scopus_import":"1","series_title":"LNM","article_processing_charge":"No","day":"21","citation":{"short":"A. Akopyan, R. Karasev, in:, B. Klartag, E. Milman (Eds.), Geometric Aspects of Functional Analysis, Springer Nature, 2020, pp. 1–27.","mla":"Akopyan, Arseniy, and Roman Karasev. “Gromov’s Waist of Non-Radial Gaussian Measures and Radial Non-Gaussian Measures.” Geometric Aspects of Functional Analysis, edited by Bo’az Klartag and Emanuel Milman, vol. 2256, Springer Nature, 2020, pp. 1–27, doi:10.1007/978-3-030-36020-7_1.","chicago":"Akopyan, Arseniy, and Roman Karasev. “Gromov’s Waist of Non-Radial Gaussian Measures and Radial Non-Gaussian Measures.” In Geometric Aspects of Functional Analysis, edited by Bo’az Klartag and Emanuel Milman, 2256:1–27. LNM. Springer Nature, 2020. https://doi.org/10.1007/978-3-030-36020-7_1.","ama":"Akopyan A, Karasev R. Gromov’s waist of non-radial Gaussian measures and radial non-Gaussian measures. In: Klartag B, Milman E, eds. Geometric Aspects of Functional Analysis. Vol 2256. LNM. Springer Nature; 2020:1-27. doi:10.1007/978-3-030-36020-7_1","apa":"Akopyan, A., & Karasev, R. (2020). Gromov’s waist of non-radial Gaussian measures and radial non-Gaussian measures. In B. Klartag & E. Milman (Eds.), Geometric Aspects of Functional Analysis (Vol. 2256, pp. 1–27). Springer Nature. https://doi.org/10.1007/978-3-030-36020-7_1","ieee":"A. Akopyan and R. Karasev, “Gromov’s waist of non-radial Gaussian measures and radial non-Gaussian measures,” in Geometric Aspects of Functional Analysis, vol. 2256, B. Klartag and E. Milman, Eds. Springer Nature, 2020, pp. 1–27.","ista":"Akopyan A, Karasev R. 2020.Gromov’s waist of non-radial Gaussian measures and radial non-Gaussian measures. In: Geometric Aspects of Functional Analysis. vol. 2256, 1–27."},"publication":"Geometric Aspects of Functional Analysis","page":"1-27","date_published":"2020-06-21T00:00:00Z","type":"book_chapter","abstract":[{"lang":"eng","text":"We study the Gromov waist in the sense of t-neighborhoods for measures in the Euclidean space, motivated by the famous theorem of Gromov about the waist of radially symmetric Gaussian measures. In particular, it turns our possible to extend Gromov’s original result to the case of not necessarily radially symmetric Gaussian measure. We also provide examples of measures having no t-neighborhood waist property, including a rather wide class\r\nof compactly supported radially symmetric measures and their maps into the Euclidean space of dimension at least 2.\r\nWe use a simpler form of Gromov’s pancake argument to produce some estimates of t-neighborhoods of (weighted) volume-critical submanifolds in the spirit of the waist theorems, including neighborhoods of algebraic manifolds in the complex projective space. In the appendix of this paper we provide for reader’s convenience a more detailed explanation of the Caffarelli theorem that we use to handle not necessarily radially symmetric Gaussian\r\nmeasures."}],"_id":"74","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","intvolume":" 2256","title":"Gromov's waist of non-radial Gaussian measures and radial non-Gaussian measures","status":"public","oa_version":"Preprint"},{"publist_id":"7744","year":"2020","publication_status":"published","publisher":"Princeton University","department":[{"_id":"TiBr"}],"author":[{"id":"35827D50-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8314-0177","first_name":"Timothy D","last_name":"Browning","full_name":"Browning, Timothy D"},{"full_name":"Sawin, Will","first_name":"Will","last_name":"Sawin"}],"date_updated":"2023-08-17T07:12:37Z","date_created":"2018-12-11T11:45:02Z","volume":191,"month":"05","main_file_link":[{"url":"https://arxiv.org/abs/1711.10451","open_access":"1"}],"external_id":{"arxiv":["1711.10451"],"isi":["000526986300004"]},"oa":1,"quality_controlled":"1","isi":1,"doi":"10.4007/annals.2020.191.3.4","language":[{"iso":"eng"}],"type":"journal_article","abstract":[{"lang":"eng","text":"We develop a geometric version of the circle method and use it to compute the compactly supported cohomology of the space of rational curves through a point on a smooth affine hypersurface of sufficiently low degree."}],"issue":"3","_id":"177","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","status":"public","title":"A geometric version of the circle method","intvolume":" 191","oa_version":"Preprint","day":"01","article_processing_charge":"No","publication":"Annals of Mathematics","citation":{"ama":"Browning TD, Sawin W. A geometric version of the circle method. Annals of Mathematics. 2020;191(3):893-948. doi:10.4007/annals.2020.191.3.4","ieee":"T. D. Browning and W. Sawin, “A geometric version of the circle method,” Annals of Mathematics, vol. 191, no. 3. Princeton University, pp. 893–948, 2020.","apa":"Browning, T. D., & Sawin, W. (2020). A geometric version of the circle method. Annals of Mathematics. Princeton University. https://doi.org/10.4007/annals.2020.191.3.4","ista":"Browning TD, Sawin W. 2020. A geometric version of the circle method. Annals of Mathematics. 191(3), 893–948.","short":"T.D. Browning, W. Sawin, Annals of Mathematics 191 (2020) 893–948.","mla":"Browning, Timothy D., and Will Sawin. “A Geometric Version of the Circle Method.” Annals of Mathematics, vol. 191, no. 3, Princeton University, 2020, pp. 893–948, doi:10.4007/annals.2020.191.3.4.","chicago":"Browning, Timothy D, and Will Sawin. “A Geometric Version of the Circle Method.” Annals of Mathematics. Princeton University, 2020. https://doi.org/10.4007/annals.2020.191.3.4."},"article_type":"original","page":"893-948","date_published":"2020-05-01T00:00:00Z"},{"abstract":[{"lang":"eng","text":"While Hartree–Fock theory is well established as a fundamental approximation for interacting fermions, it has been unclear how to describe corrections to it due to many-body correlations. In this paper we start from the Hartree–Fock state given by plane waves and introduce collective particle–hole pair excitations. These pairs can be approximately described by a bosonic quadratic Hamiltonian. We use Bogoliubov theory to construct a trial state yielding a rigorous Gell-Mann–Brueckner–type upper bound to the ground state energy. Our result justifies the random-phase approximation in the mean-field scaling regime, for repulsive, regular interaction potentials.\r\n"}],"type":"journal_article","oa_version":"Published Version","file":[{"date_updated":"2020-07-14T12:47:35Z","date_created":"2019-07-24T07:19:10Z","checksum":"f9dd6dd615a698f1d3636c4a092fed23","file_id":"6668","relation":"main_file","creator":"dernst","content_type":"application/pdf","file_size":853289,"file_name":"2019_CommMathPhysics_Benedikter.pdf","access_level":"open_access"}],"intvolume":" 374","ddc":["530"],"status":"public","title":"Optimal upper bound for the correlation energy of a Fermi gas in the mean-field regime","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"6649","article_processing_charge":"No","has_accepted_license":"1","day":"01","scopus_import":"1","date_published":"2020-03-01T00:00:00Z","page":"2097–2150","article_type":"original","citation":{"mla":"Benedikter, Niels P., et al. “Optimal Upper Bound for the Correlation Energy of a Fermi Gas in the Mean-Field Regime.” Communications in Mathematical Physics, vol. 374, Springer Nature, 2020, pp. 2097–2150, doi:10.1007/s00220-019-03505-5.","short":"N.P. Benedikter, P.T. Nam, M. Porta, B. Schlein, R. Seiringer, Communications in Mathematical Physics 374 (2020) 2097–2150.","chicago":"Benedikter, Niels P, Phan Thành Nam, Marcello Porta, Benjamin Schlein, and Robert Seiringer. “Optimal Upper Bound for the Correlation Energy of a Fermi Gas in the Mean-Field Regime.” Communications in Mathematical Physics. Springer Nature, 2020. https://doi.org/10.1007/s00220-019-03505-5.","ama":"Benedikter NP, Nam PT, Porta M, Schlein B, Seiringer R. Optimal upper bound for the correlation energy of a Fermi gas in the mean-field regime. Communications in Mathematical Physics. 2020;374:2097–2150. doi:10.1007/s00220-019-03505-5","ista":"Benedikter NP, Nam PT, Porta M, Schlein B, Seiringer R. 2020. Optimal upper bound for the correlation energy of a Fermi gas in the mean-field regime. Communications in Mathematical Physics. 374, 2097–2150.","apa":"Benedikter, N. P., Nam, P. T., Porta, M., Schlein, B., & Seiringer, R. (2020). Optimal upper bound for the correlation energy of a Fermi gas in the mean-field regime. Communications in Mathematical Physics. Springer Nature. https://doi.org/10.1007/s00220-019-03505-5","ieee":"N. P. Benedikter, P. T. Nam, M. Porta, B. Schlein, and R. Seiringer, “Optimal upper bound for the correlation energy of a Fermi gas in the mean-field regime,” Communications in Mathematical Physics, vol. 374. Springer Nature, pp. 2097–2150, 2020."},"publication":"Communications in Mathematical Physics","license":"https://creativecommons.org/licenses/by/4.0/","ec_funded":1,"file_date_updated":"2020-07-14T12:47:35Z","volume":374,"date_created":"2019-07-18T13:30:04Z","date_updated":"2023-08-17T13:51:50Z","author":[{"full_name":"Benedikter, Niels P","id":"3DE6C32A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1071-6091","first_name":"Niels P","last_name":"Benedikter"},{"last_name":"Nam","first_name":"Phan Thành","full_name":"Nam, Phan Thành"},{"last_name":"Porta","first_name":"Marcello","full_name":"Porta, Marcello"},{"full_name":"Schlein, Benjamin","last_name":"Schlein","first_name":"Benjamin"},{"id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6781-0521","first_name":"Robert","last_name":"Seiringer","full_name":"Seiringer, Robert"}],"publisher":"Springer Nature","department":[{"_id":"RoSe"}],"publication_status":"published","year":"2020","publication_identifier":{"eissn":["1432-0916"],"issn":["0010-3616"]},"month":"03","language":[{"iso":"eng"}],"doi":"10.1007/s00220-019-03505-5","project":[{"_id":"3AC91DDA-15DF-11EA-824D-93A3E7B544D1","name":"FWF Open Access Fund","call_identifier":"FWF"},{"call_identifier":"FWF","name":"Structure of the Excitation Spectrum for Many-Body Quantum Systems","_id":"25C878CE-B435-11E9-9278-68D0E5697425","grant_number":"P27533_N27"},{"call_identifier":"H2020","name":"Analysis of quantum many-body systems","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","grant_number":"694227"}],"quality_controlled":"1","isi":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"arxiv":["1809.01902"],"isi":["000527910700019"]},"oa":1},{"intvolume":" 30","status":"public","ddc":["570"],"title":"Partial coherence and frustration in self-organizing spherical grids","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"6796","oa_version":"Published Version","file":[{"creator":"dernst","file_size":2370658,"content_type":"application/pdf","file_name":"2019_Hippocampus_Stella.pdf","access_level":"open_access","date_created":"2019-08-12T07:53:33Z","date_updated":"2020-07-14T12:47:40Z","checksum":"7b54d22bfbfc0d1188a9ea24d985bfb2","file_id":"6800","relation":"main_file"}],"type":"journal_article","issue":"4","abstract":[{"text":"Nearby grid cells have been observed to express a remarkable degree of long-rangeorder, which is often idealized as extending potentially to infinity. Yet their strict peri-odic firing and ensemble coherence are theoretically possible only in flat environments, much unlike the burrows which rodents usually live in. Are the symmetrical, coherent grid maps inferred in the lab relevant to chart their way in their natural habitat? We consider spheres as simple models of curved environments and waiting for the appropriate experiments to be performed, we use our adaptation model to predict what grid maps would emerge in a network with the same type of recurrent connections, which on the plane produce coherence among the units. We find that on the sphere such connections distort the maps that single grid units would express on their own, and aggregate them into clusters. When remapping to a different spherical environment, units in each cluster maintain only partial coherence, similar to what is observed in disordered materials, such as spin glasses.","lang":"eng"}],"page":"302-313","article_type":"original","citation":{"ama":"Stella F, Urdapilleta E, Luo Y, Treves A. Partial coherence and frustration in self-organizing spherical grids. Hippocampus. 2020;30(4):302-313. doi:10.1002/hipo.23144","ista":"Stella F, Urdapilleta E, Luo Y, Treves A. 2020. Partial coherence and frustration in self-organizing spherical grids. Hippocampus. 30(4), 302–313.","ieee":"F. Stella, E. Urdapilleta, Y. Luo, and A. Treves, “Partial coherence and frustration in self-organizing spherical grids,” Hippocampus, vol. 30, no. 4. Wiley, pp. 302–313, 2020.","apa":"Stella, F., Urdapilleta, E., Luo, Y., & Treves, A. (2020). Partial coherence and frustration in self-organizing spherical grids. Hippocampus. Wiley. https://doi.org/10.1002/hipo.23144","mla":"Stella, Federico, et al. “Partial Coherence and Frustration in Self-Organizing Spherical Grids.” Hippocampus, vol. 30, no. 4, Wiley, 2020, pp. 302–13, doi:10.1002/hipo.23144.","short":"F. Stella, E. Urdapilleta, Y. Luo, A. Treves, Hippocampus 30 (2020) 302–313.","chicago":"Stella, Federico, Eugenio Urdapilleta, Yifan Luo, and Alessandro Treves. “Partial Coherence and Frustration in Self-Organizing Spherical Grids.” Hippocampus. Wiley, 2020. https://doi.org/10.1002/hipo.23144."},"publication":"Hippocampus","date_published":"2020-04-01T00:00:00Z","scopus_import":"1","article_processing_charge":"No","has_accepted_license":"1","day":"01","publisher":"Wiley","department":[{"_id":"JoCs"}],"publication_status":"published","pmid":1,"year":"2020","volume":30,"date_created":"2019-08-11T21:59:24Z","date_updated":"2023-08-17T13:53:14Z","author":[{"orcid":"0000-0001-9439-3148","id":"39AF1E74-F248-11E8-B48F-1D18A9856A87","last_name":"Stella","first_name":"Federico","full_name":"Stella, Federico"},{"last_name":"Urdapilleta","first_name":"Eugenio","full_name":"Urdapilleta, Eugenio"},{"full_name":"Luo, Yifan","last_name":"Luo","first_name":"Yifan"},{"full_name":"Treves, Alessandro","first_name":"Alessandro","last_name":"Treves"}],"file_date_updated":"2020-07-14T12:47:40Z","isi":1,"quality_controlled":"1","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"isi":["000477299600001"],"pmid":["31339190"]},"language":[{"iso":"eng"}],"doi":"10.1002/hipo.23144","publication_identifier":{"issn":["10509631"],"eissn":["10981063"]},"month":"04"},{"date_published":"2020-02-06T00:00:00Z","publication":"Theoretical Computer Science","citation":{"ista":"Avni G, Henzinger TA, Kupferman O. 2020. Dynamic resource allocation games. Theoretical Computer Science. 807, 42–55.","apa":"Avni, G., Henzinger, T. A., & Kupferman, O. (2020). Dynamic resource allocation games. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2019.06.031","ieee":"G. Avni, T. A. Henzinger, and O. Kupferman, “Dynamic resource allocation games,” Theoretical Computer Science, vol. 807. Elsevier, pp. 42–55, 2020.","ama":"Avni G, Henzinger TA, Kupferman O. Dynamic resource allocation games. Theoretical Computer Science. 2020;807:42-55. doi:10.1016/j.tcs.2019.06.031","chicago":"Avni, Guy, Thomas A Henzinger, and Orna Kupferman. “Dynamic Resource Allocation Games.” Theoretical Computer Science. Elsevier, 2020. https://doi.org/10.1016/j.tcs.2019.06.031.","mla":"Avni, Guy, et al. “Dynamic Resource Allocation Games.” Theoretical Computer Science, vol. 807, Elsevier, 2020, pp. 42–55, doi:10.1016/j.tcs.2019.06.031.","short":"G. Avni, T.A. Henzinger, O. Kupferman, Theoretical Computer Science 807 (2020) 42–55."},"article_type":"original","page":"42-55","day":"06","has_accepted_license":"1","article_processing_charge":"No","scopus_import":"1","file":[{"file_id":"8639","relation":"main_file","success":1,"checksum":"e86635417f45eb2cd75778f91382f737","date_created":"2020-10-09T06:31:22Z","date_updated":"2020-10-09T06:31:22Z","access_level":"open_access","file_name":"2020_TheoreticalCS_Avni.pdf","creator":"dernst","file_size":1413001,"content_type":"application/pdf"}],"oa_version":"Submitted Version","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"6761","title":"Dynamic resource allocation games","ddc":["000"],"status":"public","intvolume":" 807","abstract":[{"text":"In resource allocation games, selfish players share resources that are needed in order to fulfill their objectives. The cost of using a resource depends on the load on it. In the traditional setting, the players make their choices concurrently and in one-shot. That is, a strategy for a player is a subset of the resources. We introduce and study dynamic resource allocation games. In this setting, the game proceeds in phases. In each phase each player chooses one resource. A scheduler dictates the order in which the players proceed in a phase, possibly scheduling several players to proceed concurrently. The game ends when each player has collected a set of resources that fulfills his objective. The cost for each player then depends on this set as well as on the load on the resources in it – we consider both congestion and cost-sharing games. We argue that the dynamic setting is the suitable setting for many applications in practice. We study the stability of dynamic resource allocation games, where the appropriate notion of stability is that of subgame perfect equilibrium, study the inefficiency incurred due to selfish behavior, and also study problems that are particular to the dynamic setting, like constraints on the order in which resources can be chosen or the problem of finding a scheduler that achieves stability.","lang":"eng"}],"type":"journal_article","doi":"10.1016/j.tcs.2019.06.031","language":[{"iso":"eng"}],"oa":1,"external_id":{"isi":["000512219400004"]},"quality_controlled":"1","isi":1,"project":[{"_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"call_identifier":"FWF","name":"The Wittgenstein Prize","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425"},{"name":"Formal Methods meets Algorithmic Game Theory","call_identifier":"FWF","_id":"264B3912-B435-11E9-9278-68D0E5697425","grant_number":"M02369"}],"month":"02","publication_identifier":{"issn":["03043975"]},"author":[{"orcid":"0000-0001-5588-8287","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","last_name":"Avni","first_name":"Guy","full_name":"Avni, Guy"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger"},{"last_name":"Kupferman","first_name":"Orna","full_name":"Kupferman, Orna"}],"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"1341"}]},"date_updated":"2023-08-17T13:52:49Z","date_created":"2019-08-04T21:59:20Z","volume":807,"year":"2020","publication_status":"published","department":[{"_id":"ToHe"}],"publisher":"Elsevier","file_date_updated":"2020-10-09T06:31:22Z"},{"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."}],"type":"journal_article","file":[{"creator":"kschuh","file_size":359654,"content_type":"application/pdf","file_name":"ExtragradientMethodPaper.pdf","access_level":"open_access","date_updated":"2020-07-14T12:47:34Z","date_created":"2019-10-01T13:14:10Z","checksum":"bb1a1eb3ebb2df380863d0db594673ba","file_id":"6927","relation":"main_file"}],"oa_version":"Submitted Version","_id":"6593","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","title":"An efficient projection-type method for monotone variational inequalities in Hilbert spaces","ddc":["000"],"status":"public","intvolume":" 84","day":"01","article_processing_charge":"No","has_accepted_license":"1","scopus_import":"1","date_published":"2020-05-01T00:00:00Z","publication":"Numerical Algorithms","citation":{"ieee":"Y. Shehu, X.-H. Li, and Q.-L. Dong, “An efficient projection-type method for monotone variational inequalities in Hilbert spaces,” Numerical Algorithms, vol. 84. Springer Nature, pp. 365–388, 2020.","apa":"Shehu, Y., Li, X.-H., & Dong, Q.-L. (2020). An efficient projection-type method for monotone variational inequalities in Hilbert spaces. Numerical Algorithms. Springer Nature. https://doi.org/10.1007/s11075-019-00758-y","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.","ama":"Shehu Y, Li X-H, Dong Q-L. An efficient projection-type method for monotone variational inequalities in Hilbert spaces. Numerical Algorithms. 2020;84:365-388. doi:10.1007/s11075-019-00758-y","chicago":"Shehu, Yekini, Xiao-Huan Li, and Qiao-Li Dong. “An Efficient Projection-Type Method for Monotone Variational Inequalities in Hilbert Spaces.” Numerical Algorithms. Springer Nature, 2020. https://doi.org/10.1007/s11075-019-00758-y.","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.” Numerical Algorithms, vol. 84, Springer Nature, 2020, pp. 365–88, doi:10.1007/s11075-019-00758-y."},"article_type":"original","page":"365-388","file_date_updated":"2020-07-14T12:47:34Z","ec_funded":1,"author":[{"first_name":"Yekini","last_name":"Shehu","id":"3FC7CB58-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9224-7139","full_name":"Shehu, Yekini"},{"last_name":"Li","first_name":"Xiao-Huan","full_name":"Li, Xiao-Huan"},{"full_name":"Dong, Qiao-Li","last_name":"Dong","first_name":"Qiao-Li"}],"date_updated":"2023-08-17T13:51:18Z","date_created":"2019-06-27T20:09:33Z","volume":84,"year":"2020","acknowledgement":"The research of this author is supported by the ERC grant at the IST.","publication_status":"published","department":[{"_id":"VlKo"}],"publisher":"Springer Nature","month":"05","publication_identifier":{"issn":["1017-1398"],"eissn":["1572-9265"]},"doi":"10.1007/s11075-019-00758-y","language":[{"iso":"eng"}],"external_id":{"isi":["000528979000015"]},"oa":1,"quality_controlled":"1","isi":1,"project":[{"call_identifier":"FP7","name":"Discrete Optimization in Computer Vision: Theory and Practice","_id":"25FBA906-B435-11E9-9278-68D0E5697425","grant_number":"616160"}]},{"date_published":"2020-03-01T00:00:00Z","page":"27-41","article_type":"original","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.","apa":"Jahr, W., Velicky, P., & Danzl, J. G. (2020). Strategies to maximize performance in STimulated Emission Depletion (STED) nanoscopy of biological specimens. Methods. Elsevier. https://doi.org/10.1016/j.ymeth.2019.07.019","ieee":"W. Jahr, P. Velicky, and J. G. Danzl, “Strategies to maximize performance in STimulated Emission Depletion (STED) nanoscopy of biological specimens,” Methods, vol. 174, no. 3. Elsevier, pp. 27–41, 2020.","ama":"Jahr W, Velicky P, Danzl JG. Strategies to maximize performance in STimulated Emission Depletion (STED) nanoscopy of biological specimens. Methods. 2020;174(3):27-41. doi:10.1016/j.ymeth.2019.07.019","chicago":"Jahr, Wiebke, Philipp Velicky, and Johann G Danzl. “Strategies to Maximize Performance in STimulated Emission Depletion (STED) Nanoscopy of Biological Specimens.” Methods. Elsevier, 2020. https://doi.org/10.1016/j.ymeth.2019.07.019.","mla":"Jahr, Wiebke, et al. “Strategies to Maximize Performance in STimulated Emission Depletion (STED) Nanoscopy of Biological Specimens.” Methods, vol. 174, no. 3, Elsevier, 2020, pp. 27–41, doi:10.1016/j.ymeth.2019.07.019.","short":"W. Jahr, P. Velicky, J.G. Danzl, Methods 174 (2020) 27–41."},"publication":"Methods","article_processing_charge":"No","day":"01","scopus_import":"1","oa_version":"Submitted Version","intvolume":" 174","status":"public","title":"Strategies to maximize performance in STimulated Emission Depletion (STED) nanoscopy of biological specimens","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"6808","issue":"3","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"}],"type":"journal_article","language":[{"iso":"eng"}],"doi":"10.1016/j.ymeth.2019.07.019","project":[{"_id":"265CB4D0-B435-11E9-9278-68D0E5697425","grant_number":"I03600","name":"Optical control of synaptic function via adhesion molecules","call_identifier":"FWF"},{"name":"High-speed 3D-nanoscopy to study the role of adhesion during 3D cell migration","_id":"2668BFA0-B435-11E9-9278-68D0E5697425","grant_number":"LT00057"}],"quality_controlled":"1","isi":1,"oa":1,"main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7100895/"}],"external_id":{"isi":["000525860400005"],"pmid":["31344404"]},"publication_identifier":{"issn":["1046-2023"]},"month":"03","volume":174,"date_updated":"2023-08-17T13:59:57Z","date_created":"2019-08-12T16:36:32Z","author":[{"full_name":"Jahr, Wiebke","first_name":"Wiebke","last_name":"Jahr","id":"425C1CE8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Velicky","first_name":"Philipp","orcid":"0000-0002-2340-7431","id":"39BDC62C-F248-11E8-B48F-1D18A9856A87","full_name":"Velicky, Philipp"},{"id":"42EFD3B6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8559-3973","first_name":"Johann G","last_name":"Danzl","full_name":"Danzl, Johann G"}],"publisher":"Elsevier","department":[{"_id":"JoDa"}],"publication_status":"published","pmid":1,"year":"2020"},{"scopus_import":"1","day":"01","article_processing_charge":"No","publication":"Foundations of Computational Mathematics","citation":{"chicago":"Filakovský, Marek, and Lukas Vokřínek. “Are Two given Maps Homotopic? An Algorithmic Viewpoint.” Foundations of Computational Mathematics. Springer Nature, 2020. https://doi.org/10.1007/s10208-019-09419-x.","mla":"Filakovský, Marek, and Lukas Vokřínek. “Are Two given Maps Homotopic? An Algorithmic Viewpoint.” Foundations of Computational Mathematics, vol. 20, Springer Nature, 2020, pp. 311–30, doi:10.1007/s10208-019-09419-x.","short":"M. Filakovský, L. Vokřínek, Foundations of Computational Mathematics 20 (2020) 311–330.","ista":"Filakovský M, Vokřínek L. 2020. Are two given maps homotopic? An algorithmic viewpoint. Foundations of Computational Mathematics. 20, 311–330.","apa":"Filakovský, M., & Vokřínek, L. (2020). Are two given maps homotopic? An algorithmic viewpoint. Foundations of Computational Mathematics. Springer Nature. https://doi.org/10.1007/s10208-019-09419-x","ieee":"M. Filakovský and L. Vokřínek, “Are two given maps homotopic? An algorithmic viewpoint,” Foundations of Computational Mathematics, vol. 20. Springer Nature, pp. 311–330, 2020.","ama":"Filakovský M, Vokřínek L. Are two given maps homotopic? An algorithmic viewpoint. Foundations of Computational Mathematics. 2020;20:311-330. doi:10.1007/s10208-019-09419-x"},"article_type":"original","page":"311-330","date_published":"2020-04-01T00:00:00Z","type":"journal_article","abstract":[{"lang":"eng","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 𝐴⊆𝑋."}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"6563","status":"public","title":"Are two given maps homotopic? An algorithmic viewpoint","intvolume":" 20","oa_version":"Preprint","month":"04","publication_identifier":{"issn":["16153375"],"eissn":["16153383"]},"oa":1,"external_id":{"isi":["000522437400004"],"arxiv":["1312.2337"]},"main_file_link":[{"url":"https://arxiv.org/abs/1312.2337","open_access":"1"}],"quality_controlled":"1","isi":1,"project":[{"_id":"26611F5C-B435-11E9-9278-68D0E5697425","grant_number":"P31312","name":"Algorithms for Embeddings and Homotopy Theory","call_identifier":"FWF"}],"doi":"10.1007/s10208-019-09419-x","language":[{"iso":"eng"}],"year":"2020","publication_status":"published","publisher":"Springer Nature","department":[{"_id":"UlWa"}],"author":[{"id":"3E8AF77E-F248-11E8-B48F-1D18A9856A87","last_name":"Filakovský","first_name":"Marek","full_name":"Filakovský, Marek"},{"last_name":"Vokřínek","first_name":"Lukas","full_name":"Vokřínek, Lukas"}],"date_updated":"2023-08-17T13:50:44Z","date_created":"2019-06-16T21:59:14Z","volume":20},{"abstract":[{"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.","lang":"eng"}],"type":"journal_article","file":[{"content_type":"application/pdf","file_size":2243134,"creator":"dernst","access_level":"open_access","file_name":"2019_CompVision_Henderson.pdf","checksum":"a0f05dd4f5f64e4f713d8d9d4b5b1e3f","date_updated":"2020-07-14T12:47:46Z","date_created":"2019-10-25T10:28:29Z","relation":"main_file","file_id":"6973"}],"oa_version":"Published Version","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"6952","status":"public","ddc":["004"],"title":"Learning single-image 3D reconstruction by generative modelling of shape, pose and shading","intvolume":" 128","day":"01","article_processing_charge":"Yes (via OA deal)","has_accepted_license":"1","scopus_import":"1","date_published":"2020-04-01T00:00:00Z","publication":"International Journal of Computer Vision","citation":{"short":"P.M. Henderson, V. Ferrari, International Journal of Computer Vision 128 (2020) 835–854.","mla":"Henderson, Paul M., and Vittorio Ferrari. “Learning Single-Image 3D Reconstruction by Generative Modelling of Shape, Pose and Shading.” International Journal of Computer Vision, vol. 128, Springer Nature, 2020, pp. 835–54, doi:10.1007/s11263-019-01219-8.","chicago":"Henderson, Paul M, and Vittorio Ferrari. “Learning Single-Image 3D Reconstruction by Generative Modelling of Shape, Pose and Shading.” International Journal of Computer Vision. Springer Nature, 2020. https://doi.org/10.1007/s11263-019-01219-8.","ama":"Henderson PM, Ferrari V. Learning single-image 3D reconstruction by generative modelling of shape, pose and shading. International Journal of Computer Vision. 2020;128:835-854. doi:10.1007/s11263-019-01219-8","apa":"Henderson, P. M., & Ferrari, V. (2020). Learning single-image 3D reconstruction by generative modelling of shape, pose and shading. International Journal of Computer Vision. Springer Nature. https://doi.org/10.1007/s11263-019-01219-8","ieee":"P. M. Henderson and V. Ferrari, “Learning single-image 3D reconstruction by generative modelling of shape, pose and shading,” International Journal of Computer Vision, vol. 128. Springer Nature, pp. 835–854, 2020.","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."},"article_type":"original","page":"835-854","file_date_updated":"2020-07-14T12:47:46Z","author":[{"last_name":"Henderson","first_name":"Paul M","orcid":"0000-0002-5198-7445","id":"13C09E74-18D9-11E9-8878-32CFE5697425","full_name":"Henderson, Paul M"},{"full_name":"Ferrari, Vittorio","first_name":"Vittorio","last_name":"Ferrari"}],"date_updated":"2023-08-17T14:01:16Z","date_created":"2019-10-17T13:38:20Z","volume":128,"year":"2020","acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria).","publication_status":"published","department":[{"_id":"ChLa"}],"publisher":"Springer Nature","month":"04","publication_identifier":{"issn":["0920-5691"],"eissn":["1573-1405"]},"doi":"10.1007/s11263-019-01219-8","language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"external_id":{"arxiv":["1901.06447"],"isi":["000491042100002"]},"isi":1,"quality_controlled":"1","project":[{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}]},{"author":[{"full_name":"Nakamoto, Chihiro","last_name":"Nakamoto","first_name":"Chihiro"},{"full_name":"Konno, Kohtarou","first_name":"Kohtarou","last_name":"Konno"},{"last_name":"Miyazaki","first_name":"Taisuke","full_name":"Miyazaki, Taisuke"},{"full_name":"Nakatsukasa, Ena","last_name":"Nakatsukasa","first_name":"Ena"},{"full_name":"Natsume, Rie","last_name":"Natsume","first_name":"Rie"},{"first_name":"Manabu","last_name":"Abe","full_name":"Abe, Manabu"},{"last_name":"Kawamura","first_name":"Meiko","full_name":"Kawamura, Meiko"},{"last_name":"Fukazawa","first_name":"Yugo","full_name":"Fukazawa, Yugo"},{"full_name":"Shigemoto, Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8761-9444","first_name":"Ryuichi","last_name":"Shigemoto"},{"full_name":"Yamasaki, Miwako","first_name":"Miwako","last_name":"Yamasaki"},{"last_name":"Sakimura","first_name":"Kenji","full_name":"Sakimura, Kenji"},{"first_name":"Masahiko","last_name":"Watanabe","full_name":"Watanabe, Masahiko"}],"volume":528,"date_updated":"2023-08-17T14:06:50Z","date_created":"2019-12-04T16:09:29Z","pmid":1,"acknowledgement":"This study was supported by Grants-in-Aid for Scientific Research to K.K. (18K06813), Y.M. (17K08503, 17H0631319), and K.S. (16H04650) and a grant for Scientific Research on Innovative Areas to K.S (16H06276) from the Ministry of Education, Culture, Sports, Science and Technology of Japan (MEXT). We thank K. Akashi, I. Watanabe-Iida, Y. Suzuki, and H. Azechi for technical assistance and advice, and H. Uchida for valuable discussions. We thank E. Kushiya,I. Yabe, C. Ohori, Y. Mochizuki, Y. Ishikawa, and N. Ishimoto for technical assistance in generating GluD1-KO mice.","year":"2020","department":[{"_id":"RySh"}],"publisher":"Wiley","publication_status":"published","publication_identifier":{"issn":["0021-9967"],"eissn":["1096-9861"]},"month":"04","doi":"10.1002/cne.24792","language":[{"iso":"eng"}],"external_id":{"pmid":["31625608"],"isi":["000496410200001"]},"isi":1,"quality_controlled":"1","issue":"6","abstract":[{"text":"In the cerebellum, GluD2 is exclusively expressed in Purkinje cells, where it regulates synapse formation and regeneration, synaptic plasticity, and motor learning. Delayed cognitive development in humans with GluD2 gene mutations suggests extracerebellar functions of GluD2. However, extracerebellar expression of GluD2 and its relationship with that of GluD1 are poorly understood. GluD2 mRNA and protein were widely detected, with relatively high levels observed in the olfactory glomerular layer, medial prefrontal cortex, cingulate cortex, retrosplenial granular cortex, olfactory tubercle, subiculum, striatum, lateral septum, anterodorsal thalamic nucleus, and arcuate hypothalamic nucleus. These regions were also enriched for GluD1, and many individual neurons coexpressed the two GluDs. In the retrosplenial granular cortex, GluD1 and GluD2 were selectively expressed at PSD‐95‐expressing glutamatergic synapses, and their coexpression on the same synapses was shown by SDS‐digested freeze‐fracture replica labeling. Biochemically, GluD1 and GluD2 formed coimmunoprecipitable complex formation in HEK293T cells and in the cerebral cortex and hippocampus. We further estimated the relative protein amount by quantitative immunoblotting using GluA2/GluD2 and GluA2/GluD1 chimeric proteins as standards for titration of GluD1 and GluD2 antibodies. Intriguingly, the relative amount of GluD2 was almost comparable to that of GluD1 in the postsynaptic density fraction prepared from the cerebral cortex and hippocampus. In contrast, GluD2 was overwhelmingly predominant in the cerebellum. Thus, we have determined the relative extracerebellar expression of GluD1 and GluD2 at regional, neuronal, and synaptic levels. These data provide a molecular–anatomical basis for possible competitive and cooperative interactions of GluD family members at synapses in various brain regions.","lang":"eng"}],"type":"journal_article","oa_version":"None","_id":"7148","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","intvolume":" 528","ddc":["571","599"],"title":"Expression mapping, quantification, and complex formation of GluD1 and GluD2 glutamate receptors in adult mouse brain","status":"public","article_processing_charge":"No","has_accepted_license":"1","day":"01","scopus_import":"1","date_published":"2020-04-01T00:00:00Z","citation":{"ama":"Nakamoto C, Konno K, Miyazaki T, et al. Expression mapping, quantification, and complex formation of GluD1 and GluD2 glutamate receptors in adult mouse brain. Journal of Comparative Neurology. 2020;528(6):1003-1027. doi:10.1002/cne.24792","ista":"Nakamoto C, Konno K, Miyazaki T, Nakatsukasa E, Natsume R, Abe M, Kawamura M, Fukazawa Y, Shigemoto R, Yamasaki M, Sakimura K, Watanabe M. 2020. Expression mapping, quantification, and complex formation of GluD1 and GluD2 glutamate receptors in adult mouse brain. Journal of Comparative Neurology. 528(6), 1003–1027.","apa":"Nakamoto, C., Konno, K., Miyazaki, T., Nakatsukasa, E., Natsume, R., Abe, M., … Watanabe, M. (2020). Expression mapping, quantification, and complex formation of GluD1 and GluD2 glutamate receptors in adult mouse brain. Journal of Comparative Neurology. Wiley. https://doi.org/10.1002/cne.24792","ieee":"C. Nakamoto et al., “Expression mapping, quantification, and complex formation of GluD1 and GluD2 glutamate receptors in adult mouse brain,” Journal of Comparative Neurology, vol. 528, no. 6. Wiley, pp. 1003–1027, 2020.","mla":"Nakamoto, Chihiro, et al. “Expression Mapping, Quantification, and Complex Formation of GluD1 and GluD2 Glutamate Receptors in Adult Mouse Brain.” Journal of Comparative Neurology, vol. 528, no. 6, Wiley, 2020, pp. 1003–27, doi:10.1002/cne.24792.","short":"C. Nakamoto, K. Konno, T. Miyazaki, E. Nakatsukasa, R. Natsume, M. Abe, M. Kawamura, Y. Fukazawa, R. Shigemoto, M. Yamasaki, K. Sakimura, M. Watanabe, Journal of Comparative Neurology 528 (2020) 1003–1027.","chicago":"Nakamoto, Chihiro, Kohtarou Konno, Taisuke Miyazaki, Ena Nakatsukasa, Rie Natsume, Manabu Abe, Meiko Kawamura, et al. “Expression Mapping, Quantification, and Complex Formation of GluD1 and GluD2 Glutamate Receptors in Adult Mouse Brain.” Journal of Comparative Neurology. Wiley, 2020. https://doi.org/10.1002/cne.24792."},"publication":"Journal of Comparative Neurology","page":"1003-1027","article_type":"original"}]