[{"year":"2015","article_processing_charge":"No","date_published":"2015-03-23T00:00:00Z","author":[{"first_name":"Tamar","id":"36A5845C-F248-11E8-B48F-1D18A9856A87","last_name":"Friedlander","full_name":"Friedlander, Tamar"},{"first_name":"Avraham E.","last_name":"Mayo","full_name":"Mayo, Avraham E."},{"full_name":"Tlusty, Tsvi","last_name":"Tlusty","first_name":"Tsvi"},{"full_name":"Alon, Uri","last_name":"Alon","first_name":"Uri"}],"department":[{"_id":"GaTk"}],"date_updated":"2023-02-23T10:16:13Z","title":"Evolutionary simulation code","month":"03","_id":"9773","publisher":"Public Library of Science","day":"23","date_created":"2021-08-05T12:58:07Z","doi":"10.1371/journal.pcbi.1004055.s002","oa_version":"Published Version","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","related_material":{"record":[{"status":"public","relation":"used_in_publication","id":"1827"}]},"status":"public","citation":{"ama":"Friedlander T, Mayo AE, Tlusty T, Alon U. Evolutionary simulation code. 2015. doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1004055.s002\">10.1371/journal.pcbi.1004055.s002</a>","chicago":"Friedlander, Tamar, Avraham E. Mayo, Tsvi Tlusty, and Uri Alon. “Evolutionary Simulation Code.” Public Library of Science, 2015. <a href=\"https://doi.org/10.1371/journal.pcbi.1004055.s002\">https://doi.org/10.1371/journal.pcbi.1004055.s002</a>.","ista":"Friedlander T, Mayo AE, Tlusty T, Alon U. 2015. Evolutionary simulation code, Public Library of Science, <a href=\"https://doi.org/10.1371/journal.pcbi.1004055.s002\">10.1371/journal.pcbi.1004055.s002</a>.","mla":"Friedlander, Tamar, et al. <i>Evolutionary Simulation Code</i>. Public Library of Science, 2015, doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1004055.s002\">10.1371/journal.pcbi.1004055.s002</a>.","short":"T. Friedlander, A.E. Mayo, T. Tlusty, U. Alon, (2015).","apa":"Friedlander, T., Mayo, A. E., Tlusty, T., &#38; Alon, U. (2015). Evolutionary simulation code. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pcbi.1004055.s002\">https://doi.org/10.1371/journal.pcbi.1004055.s002</a>","ieee":"T. Friedlander, A. E. Mayo, T. Tlusty, and U. Alon, “Evolutionary simulation code.” Public Library of Science, 2015."},"type":"research_data_reference"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","issue":"2","oa":1,"intvolume":"       215","quality_controlled":"1","language":[{"iso":"eng"}],"status":"public","volume":215,"abstract":[{"lang":"eng","text":"We study the spectrum of a large system of N identical bosons interacting via a two-body potential with strength 1/N. In this mean-field regime, Bogoliubov's theory predicts that the spectrum of the N-particle Hamiltonian can be approximated by that of an effective quadratic Hamiltonian acting on Fock space, which describes the fluctuations around a condensed state. Recently, Bogoliubov's theory has been justified rigorously in the case that the low-energy eigenvectors of the N-particle Hamiltonian display complete condensation in the unique minimizer of the corresponding Hartree functional. In this paper, we shall justify Bogoliubov's theory for the high-energy part of the spectrum of the N-particle Hamiltonian corresponding to (non-linear) excited states of the Hartree functional. Moreover, we shall extend the existing results on the excitation spectrum to the case of non-uniqueness and/or degeneracy of the Hartree minimizer. In particular, the latter covers the case of rotating Bose gases, when the rotation speed is large enough to break the symmetry and to produce multiple quantized vortices in the Hartree minimizer. "}],"publication_status":"published","publist_id":"4951","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1402.1153"}],"type":"journal_article","scopus_import":1,"citation":{"apa":"Nam, P., &#38; Seiringer, R. (2015). Collective excitations of Bose gases in the mean-field regime. <i>Archive for Rational Mechanics and Analysis</i>. Springer. <a href=\"https://doi.org/10.1007/s00205-014-0781-6\">https://doi.org/10.1007/s00205-014-0781-6</a>","short":"P. Nam, R. Seiringer, Archive for Rational Mechanics and Analysis 215 (2015) 381–417.","ieee":"P. Nam and R. Seiringer, “Collective excitations of Bose gases in the mean-field regime,” <i>Archive for Rational Mechanics and Analysis</i>, vol. 215, no. 2. Springer, pp. 381–417, 2015.","ama":"Nam P, Seiringer R. Collective excitations of Bose gases in the mean-field regime. <i>Archive for Rational Mechanics and Analysis</i>. 2015;215(2):381-417. doi:<a href=\"https://doi.org/10.1007/s00205-014-0781-6\">10.1007/s00205-014-0781-6</a>","chicago":"Nam, Phan, and Robert Seiringer. “Collective Excitations of Bose Gases in the Mean-Field Regime.” <i>Archive for Rational Mechanics and Analysis</i>. Springer, 2015. <a href=\"https://doi.org/10.1007/s00205-014-0781-6\">https://doi.org/10.1007/s00205-014-0781-6</a>.","mla":"Nam, Phan, and Robert Seiringer. “Collective Excitations of Bose Gases in the Mean-Field Regime.” <i>Archive for Rational Mechanics and Analysis</i>, vol. 215, no. 2, Springer, 2015, pp. 381–417, doi:<a href=\"https://doi.org/10.1007/s00205-014-0781-6\">10.1007/s00205-014-0781-6</a>.","ista":"Nam P, Seiringer R. 2015. Collective excitations of Bose gases in the mean-field regime. Archive for Rational Mechanics and Analysis. 215(2), 381–417."},"author":[{"last_name":"Nam","full_name":"Nam, Phan","id":"404092F4-F248-11E8-B48F-1D18A9856A87","first_name":"Phan"},{"last_name":"Seiringer","full_name":"Seiringer, Robert","orcid":"0000-0002-6781-0521","first_name":"Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87"}],"date_published":"2015-02-01T00:00:00Z","year":"2015","month":"02","title":"Collective excitations of Bose gases in the mean-field regime","date_updated":"2021-01-12T06:55:13Z","department":[{"_id":"RoSe"}],"date_created":"2018-12-11T11:55:37Z","day":"01","_id":"2085","publisher":"Springer","page":"381 - 417","oa_version":"Preprint","publication":"Archive for Rational Mechanics and Analysis","doi":"10.1007/s00205-014-0781-6"},{"publication":"Communications in Mathematical Physics","doi":"10.1007/s00220-014-2119-5","page":"1365 - 1416","oa_version":"Preprint","_id":"2166","publisher":"Springer","day":"01","date_created":"2018-12-11T11:56:05Z","department":[{"_id":"LaEr"}],"date_updated":"2021-01-12T06:55:43Z","title":"The Altshuler-Shklovskii formulas for random band matrices I: the unimodular case","month":"02","year":"2015","date_published":"2015-02-01T00:00:00Z","author":[{"orcid":"0000-0001-5366-9603","full_name":"Erdös, László","last_name":"Erdös","first_name":"László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Knowles, Antti","last_name":"Knowles","first_name":"Antti"}],"type":"journal_article","citation":{"ieee":"L. Erdös and A. Knowles, “The Altshuler-Shklovskii formulas for random band matrices I: the unimodular case,” <i>Communications in Mathematical Physics</i>, vol. 333, no. 3. Springer, pp. 1365–1416, 2015.","short":"L. Erdös, A. Knowles, Communications in Mathematical Physics 333 (2015) 1365–1416.","apa":"Erdös, L., &#38; Knowles, A. (2015). The Altshuler-Shklovskii formulas for random band matrices I: the unimodular case. <i>Communications in Mathematical Physics</i>. Springer. <a href=\"https://doi.org/10.1007/s00220-014-2119-5\">https://doi.org/10.1007/s00220-014-2119-5</a>","mla":"Erdös, László, and Antti Knowles. “The Altshuler-Shklovskii Formulas for Random Band Matrices I: The Unimodular Case.” <i>Communications in Mathematical Physics</i>, vol. 333, no. 3, Springer, 2015, pp. 1365–416, doi:<a href=\"https://doi.org/10.1007/s00220-014-2119-5\">10.1007/s00220-014-2119-5</a>.","ista":"Erdös L, Knowles A. 2015. The Altshuler-Shklovskii formulas for random band matrices I: the unimodular case. Communications in Mathematical Physics. 333(3), 1365–1416.","ama":"Erdös L, Knowles A. The Altshuler-Shklovskii formulas for random band matrices I: the unimodular case. <i>Communications in Mathematical Physics</i>. 2015;333(3):1365-1416. doi:<a href=\"https://doi.org/10.1007/s00220-014-2119-5\">10.1007/s00220-014-2119-5</a>","chicago":"Erdös, László, and Antti Knowles. “The Altshuler-Shklovskii Formulas for Random Band Matrices I: The Unimodular Case.” <i>Communications in Mathematical Physics</i>. Springer, 2015. <a href=\"https://doi.org/10.1007/s00220-014-2119-5\">https://doi.org/10.1007/s00220-014-2119-5</a>."},"scopus_import":1,"publist_id":"4818","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1309.5106"}],"abstract":[{"lang":"eng","text":"We consider the spectral statistics of large random band matrices on mesoscopic energy scales. We show that the correlation function of the local eigenvalue density exhibits a universal power law behaviour that differs from the Wigner-Dyson- Mehta statistics. This law had been predicted in the physics literature by Altshuler and Shklovskii in (Zh Eksp Teor Fiz (Sov Phys JETP) 91(64):220(127), 1986); it describes the correlations of the eigenvalue density in general metallic sampleswith weak disorder. Our result rigorously establishes the Altshuler-Shklovskii formulas for band matrices. In two dimensions, where the leading term vanishes owing to an algebraic cancellation, we identify the first non-vanishing term and show that it differs substantially from the prediction of Kravtsov and Lerner in (Phys Rev Lett 74:2563-2566, 1995). The proof is given in the current paper and its companion (Ann. H. Poincaré. arXiv:1309.5107, 2014). "}],"volume":333,"publication_status":"published","status":"public","language":[{"iso":"eng"}],"quality_controlled":"1","intvolume":"       333","oa":1,"issue":"3","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"citation":{"ieee":"V. Kolmogorov, J. Thapper, and S. Živný, “The power of linear programming for general-valued CSPs,” <i>SIAM Journal on Computing</i>, vol. 44, no. 1. SIAM, pp. 1–36, 2015.","short":"V. Kolmogorov, J. Thapper, S. Živný, SIAM Journal on Computing 44 (2015) 1–36.","apa":"Kolmogorov, V., Thapper, J., &#38; Živný, S. (2015). The power of linear programming for general-valued CSPs. <i>SIAM Journal on Computing</i>. SIAM. <a href=\"https://doi.org/10.1137/130945648\">https://doi.org/10.1137/130945648</a>","mla":"Kolmogorov, Vladimir, et al. “The Power of Linear Programming for General-Valued CSPs.” <i>SIAM Journal on Computing</i>, vol. 44, no. 1, SIAM, 2015, pp. 1–36, doi:<a href=\"https://doi.org/10.1137/130945648\">10.1137/130945648</a>.","ista":"Kolmogorov V, Thapper J, Živný S. 2015. The power of linear programming for general-valued CSPs. SIAM Journal on Computing. 44(1), 1–36.","chicago":"Kolmogorov, Vladimir, Johan Thapper, and Stanislav Živný. “The Power of Linear Programming for General-Valued CSPs.” <i>SIAM Journal on Computing</i>. SIAM, 2015. <a href=\"https://doi.org/10.1137/130945648\">https://doi.org/10.1137/130945648</a>.","ama":"Kolmogorov V, Thapper J, Živný S. The power of linear programming for general-valued CSPs. <i>SIAM Journal on Computing</i>. 2015;44(1):1-36. doi:<a href=\"https://doi.org/10.1137/130945648\">10.1137/130945648</a>"},"type":"journal_article","quality_controlled":"1","status":"public","language":[{"iso":"eng"}],"publist_id":"4673","publication_status":"published","abstract":[{"text":"A class of valued constraint satisfaction problems (VCSPs) is characterised by a valued constraint language, a fixed set of cost functions on a finite domain. Finite-valued constraint languages contain functions that take on rational costs and general-valued constraint languages contain functions that take on rational or infinite costs. An instance of the problem is specified by a sum of functions from the language with the goal to minimise the sum. This framework includes and generalises well-studied constraint satisfaction problems (CSPs) and maximum constraint satisfaction problems (Max-CSPs).\r\nOur main result is a precise algebraic characterisation of valued constraint languages whose instances can be solved exactly by the basic linear programming relaxation (BLP). For a general-valued constraint language Γ, BLP is a decision procedure for Γ if and only if Γ admits a symmetric fractional polymorphism of every arity. For a finite-valued constraint language Γ, BLP is a decision procedure if and only if Γ admits a symmetric fractional polymorphism of some arity, or equivalently, if Γ admits a symmetric fractional polymorphism of arity 2.\r\nUsing these results, we obtain tractability of several novel and previously widely-open classes of VCSPs, including problems over valued constraint languages that are: (1) submodular on arbitrary lattices; (2) bisubmodular (also known as k-submodular) on arbitrary finite domains; (3) weakly (and hence strongly) tree-submodular on arbitrary trees. ","lang":"eng"}],"day":"01","publisher":"SIAM","oa_version":"Preprint","arxiv":1,"doi":"10.1137/130945648","year":"2015","author":[{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir","last_name":"Kolmogorov","full_name":"Kolmogorov, Vladimir"},{"first_name":"Johan","last_name":"Thapper","full_name":"Thapper, Johan"},{"first_name":"Stanislav","full_name":"Živný, Stanislav","last_name":"Živný"}],"department":[{"_id":"VlKo"}],"scopus_import":1,"oa":1,"intvolume":"        44","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","issue":"1","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"2518"}]},"main_file_link":[{"url":"http://arxiv.org/abs/1311.4219","open_access":"1"}],"volume":44,"external_id":{"arxiv":["1311.4219"]},"date_created":"2018-12-11T11:56:41Z","_id":"2271","page":"1 - 36","publication":"SIAM Journal on Computing","date_published":"2015-02-01T00:00:00Z","month":"02","title":"The power of linear programming for general-valued CSPs","date_updated":"2023-02-23T10:46:30Z"},{"quality_controlled":"1","has_accepted_license":"1","status":"public","language":[{"iso":"eng"}],"publist_id":"7344","publication_status":"published","abstract":[{"lang":"eng","text":"We prove that nonlinear Gibbs measures can be obtained from the corresponding many-body, grand-canonical, quantum Gibbs states, in a mean-field limit where the temperature T diverges and the interaction strength behaves as 1/T. We proceed by characterizing the interacting Gibbs state as minimizing a functional counting the free-energy relatively to the non-interacting case. We then perform an infinite-dimensional analogue of phase-space semiclassical analysis, using fine properties of the quantum relative entropy, the link between quantum de Finetti measures and upper/lower symbols in a coherent state basis, as well as Berezin-Lieb type inequalities. Our results cover the measure built on the defocusing nonlinear Schrödinger functional on a finite interval, as well as smoother interactions in dimensions d 2."}],"ddc":["539"],"type":"journal_article","citation":{"ieee":"M. Lewin, P. Nam, and N. Rougerie, “Derivation of nonlinear gibbs measures from many-body quantum mechanics,” <i>Journal de l’Ecole Polytechnique - Mathematiques</i>, vol. 2. Ecole Polytechnique, pp. 65–115, 2015.","short":"M. Lewin, P. Nam, N. Rougerie, Journal de l’Ecole Polytechnique - Mathematiques 2 (2015) 65–115.","apa":"Lewin, M., Nam, P., &#38; Rougerie, N. (2015). Derivation of nonlinear gibbs measures from many-body quantum mechanics. <i>Journal de l’Ecole Polytechnique - Mathematiques</i>. Ecole Polytechnique. <a href=\"https://doi.org/10.5802/jep.18\">https://doi.org/10.5802/jep.18</a>","mla":"Lewin, Mathieu, et al. “Derivation of Nonlinear Gibbs Measures from Many-Body Quantum Mechanics.” <i>Journal de l’Ecole Polytechnique - Mathematiques</i>, vol. 2, Ecole Polytechnique, 2015, pp. 65–115, doi:<a href=\"https://doi.org/10.5802/jep.18\">10.5802/jep.18</a>.","ista":"Lewin M, Nam P, Rougerie N. 2015. Derivation of nonlinear gibbs measures from many-body quantum mechanics. Journal de l’Ecole Polytechnique - Mathematiques. 2, 65–115.","ama":"Lewin M, Nam P, Rougerie N. Derivation of nonlinear gibbs measures from many-body quantum mechanics. <i>Journal de l’Ecole Polytechnique - Mathematiques</i>. 2015;2:65-115. doi:<a href=\"https://doi.org/10.5802/jep.18\">10.5802/jep.18</a>","chicago":"Lewin, Mathieu, Phan Nam, and Nicolas Rougerie. “Derivation of Nonlinear Gibbs Measures from Many-Body Quantum Mechanics.” <i>Journal de l’Ecole Polytechnique - Mathematiques</i>. Ecole Polytechnique, 2015. <a href=\"https://doi.org/10.5802/jep.18\">https://doi.org/10.5802/jep.18</a>."},"file":[{"date_created":"2018-12-12T10:12:53Z","creator":"system","file_id":"4974","access_level":"open_access","file_name":"IST-2018-951-v1+1_2015_Thanh-Nam_Derivation_of.pdf","file_size":1084254,"content_type":"application/pdf","date_updated":"2020-07-14T12:46:35Z","checksum":"a40eb4016717ddc9927154798a4c164a","relation":"main_file"}],"year":"2015","author":[{"last_name":"Lewin","full_name":"Lewin, Mathieu","first_name":"Mathieu"},{"first_name":"Nam","id":"404092F4-F248-11E8-B48F-1D18A9856A87","full_name":"Phan Thanh, Nam","last_name":"Phan Thanh"},{"first_name":"Nicolas","full_name":"Rougerie, Nicolas","last_name":"Rougerie"}],"tmp":{"image":"/image/cc_by_nd.png","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","short":"CC BY-ND (4.0)"},"department":[{"_id":"RoSe"}],"day":"01","publisher":"Ecole Polytechnique","oa_version":"Published Version","doi":"10.5802/jep.18","oa":1,"intvolume":"         2","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":2,"license":"https://creativecommons.org/licenses/by-nd/4.0/","scopus_import":1,"ec_funded":1,"date_published":"2015-01-01T00:00:00Z","month":"01","date_updated":"2021-01-12T08:00:52Z","title":"Derivation of nonlinear gibbs measures from many-body quantum mechanics","date_created":"2018-12-11T11:46:40Z","_id":"473","project":[{"name":"International IST Postdoc Fellowship Programme","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"page":"65 - 115","publication":"Journal de l'Ecole Polytechnique - Mathematiques","file_date_updated":"2020-07-14T12:46:35Z","pubrep_id":"951"},{"day":"15","date_created":"2018-12-11T11:46:41Z","_id":"477","publisher":"Company of Biologists","page":"2866 - 2880","oa_version":"None","doi":"10.1242/jcs.167999","publication":"Journal of Cell Science","year":"2015","author":[{"last_name":"Holst","full_name":"Holst, Katrin","first_name":"Katrin"},{"first_name":"Daria","last_name":"Guseva","full_name":"Guseva, Daria"},{"last_name":"Schindler","full_name":"Schindler, Susann","first_name":"Susann"},{"orcid":"0000-0002-6620-9179","full_name":"Sixt, Michael K","last_name":"Sixt","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","first_name":"Michael K"},{"first_name":"Armin","full_name":"Braun, Armin","last_name":"Braun"},{"last_name":"Chopra","full_name":"Chopra, Himpriya","first_name":"Himpriya"},{"last_name":"Pabst","full_name":"Pabst, Oliver","first_name":"Oliver"},{"first_name":"Evgeni","full_name":"Ponimaskin, Evgeni","last_name":"Ponimaskin"}],"date_published":"2015-06-15T00:00:00Z","month":"06","department":[{"_id":"MiSi"}],"date_updated":"2021-01-12T08:00:54Z","title":"The serotonin receptor 5-HT7R regulates the morphology and migratory properties of dendritic cells","citation":{"chicago":"Holst, Katrin, Daria Guseva, Susann Schindler, Michael K Sixt, Armin Braun, Himpriya Chopra, Oliver Pabst, and Evgeni Ponimaskin. “The Serotonin Receptor 5-HT7R Regulates the Morphology and Migratory Properties of Dendritic Cells.” <i>Journal of Cell Science</i>. Company of Biologists, 2015. <a href=\"https://doi.org/10.1242/jcs.167999\">https://doi.org/10.1242/jcs.167999</a>.","ama":"Holst K, Guseva D, Schindler S, et al. The serotonin receptor 5-HT7R regulates the morphology and migratory properties of dendritic cells. <i>Journal of Cell Science</i>. 2015;128(15):2866-2880. doi:<a href=\"https://doi.org/10.1242/jcs.167999\">10.1242/jcs.167999</a>","ista":"Holst K, Guseva D, Schindler S, Sixt MK, Braun A, Chopra H, Pabst O, Ponimaskin E. 2015. The serotonin receptor 5-HT7R regulates the morphology and migratory properties of dendritic cells. Journal of Cell Science. 128(15), 2866–2880.","mla":"Holst, Katrin, et al. “The Serotonin Receptor 5-HT7R Regulates the Morphology and Migratory Properties of Dendritic Cells.” <i>Journal of Cell Science</i>, vol. 128, no. 15, Company of Biologists, 2015, pp. 2866–80, doi:<a href=\"https://doi.org/10.1242/jcs.167999\">10.1242/jcs.167999</a>.","apa":"Holst, K., Guseva, D., Schindler, S., Sixt, M. K., Braun, A., Chopra, H., … Ponimaskin, E. (2015). The serotonin receptor 5-HT7R regulates the morphology and migratory properties of dendritic cells. <i>Journal of Cell Science</i>. Company of Biologists. <a href=\"https://doi.org/10.1242/jcs.167999\">https://doi.org/10.1242/jcs.167999</a>","short":"K. Holst, D. Guseva, S. Schindler, M.K. Sixt, A. Braun, H. Chopra, O. Pabst, E. Ponimaskin, Journal of Cell Science 128 (2015) 2866–2880.","ieee":"K. Holst <i>et al.</i>, “The serotonin receptor 5-HT7R regulates the morphology and migratory properties of dendritic cells,” <i>Journal of Cell Science</i>, vol. 128, no. 15. Company of Biologists, pp. 2866–2880, 2015."},"type":"journal_article","scopus_import":1,"intvolume":"       128","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","issue":"15","quality_controlled":"1","status":"public","language":[{"iso":"eng"}],"publist_id":"7343","volume":128,"publication_status":"published","abstract":[{"text":"Dendritic cells are potent antigen-presenting cells endowed with the unique ability to initiate adaptive immune responses upon inflammation. Inflammatory processes are often associated with an increased production of serotonin, which operates by activating specific receptors. However, the functional role of serotonin receptors in regulation of dendritic cell functions is poorly understood. Here, we demonstrate that expression of serotonin receptor 5-HT7 (5-HT7TR) as well as its downstream effector Cdc42 is upregulated in dendritic cells upon maturation. Although dendritic cell maturation was independent of 5-HT7TR, receptor stimulation affected dendritic cell morphology through Cdc42-mediated signaling. In addition, basal activity of 5-HT7TR was required for the proper expression of the chemokine receptor CCR7, which is a key factor that controls dendritic cell migration. Consistent with this, we observed that 5-HT7TR enhances chemotactic motility of dendritic cells in vitro by modulating their directionality and migration velocity. Accordingly, migration of dendritic cells in murine colon explants was abolished after pharmacological receptor inhibition. Our results indicate that there is a crucial role for 5-HT7TR-Cdc42-mediated signaling in the regulation of dendritic cell morphology and motility, suggesting that 5-HT7TR could be a new target for treatment of a variety of inflammatory and immune disorders.","lang":"eng"}]},{"scopus_import":1,"oa":1,"intvolume":"       242","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","issue":"6","main_file_link":[{"url":"https://arxiv.org/abs/1302.4248","open_access":"1"}],"related_material":{"record":[{"id":"2279","relation":"earlier_version","status":"public"}]},"volume":242,"date_created":"2018-12-11T11:46:57Z","project":[{"grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","call_identifier":"FWF"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"_id":"523","page":"25 - 52","publication":"Information and Computation","ec_funded":1,"date_published":"2015-03-24T00:00:00Z","month":"03","title":"Looking at mean-payoff and total-payoff through windows","date_updated":"2023-02-23T10:36:02Z","type":"journal_article","citation":{"mla":"Chatterjee, Krishnendu, et al. “Looking at Mean-Payoff and Total-Payoff through Windows.” <i>Information and Computation</i>, vol. 242, no. 6, Elsevier, 2015, pp. 25–52, doi:<a href=\"https://doi.org/10.1016/j.ic.2015.03.010\">10.1016/j.ic.2015.03.010</a>.","ista":"Chatterjee K, Doyen L, Randour M, Raskin J. 2015. Looking at mean-payoff and total-payoff through windows. Information and Computation. 242(6), 25–52.","ama":"Chatterjee K, Doyen L, Randour M, Raskin J. Looking at mean-payoff and total-payoff through windows. <i>Information and Computation</i>. 2015;242(6):25-52. doi:<a href=\"https://doi.org/10.1016/j.ic.2015.03.010\">10.1016/j.ic.2015.03.010</a>","chicago":"Chatterjee, Krishnendu, Laurent Doyen, Mickael Randour, and Jean Raskin. “Looking at Mean-Payoff and Total-Payoff through Windows.” <i>Information and Computation</i>. Elsevier, 2015. <a href=\"https://doi.org/10.1016/j.ic.2015.03.010\">https://doi.org/10.1016/j.ic.2015.03.010</a>.","ieee":"K. Chatterjee, L. Doyen, M. Randour, and J. Raskin, “Looking at mean-payoff and total-payoff through windows,” <i>Information and Computation</i>, vol. 242, no. 6. Elsevier, pp. 25–52, 2015.","apa":"Chatterjee, K., Doyen, L., Randour, M., &#38; Raskin, J. (2015). Looking at mean-payoff and total-payoff through windows. <i>Information and Computation</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ic.2015.03.010\">https://doi.org/10.1016/j.ic.2015.03.010</a>","short":"K. Chatterjee, L. Doyen, M. Randour, J. Raskin, Information and Computation 242 (2015) 25–52."},"quality_controlled":"1","status":"public","language":[{"iso":"eng"}],"publist_id":"7296","abstract":[{"lang":"eng","text":"We consider two-player games played on weighted directed graphs with mean-payoff and total-payoff objectives, two classical quantitative objectives. While for single-dimensional games the complexity and memory bounds for both objectives coincide, we show that in contrast to multi-dimensional mean-payoff games that are known to be coNP-complete, multi-dimensional total-payoff games are undecidable. We introduce conservative approximations of these objectives, where the payoff is considered over a local finite window sliding along a play, instead of the whole play. For single dimension, we show that (i) if the window size is polynomial, deciding the winner takes polynomial time, and (ii) the existence of a bounded window can be decided in NP ∩ coNP, and is at least as hard as solving mean-payoff games. For multiple dimensions, we show that (i) the problem with fixed window size is EXPTIME-complete, and (ii) there is no primitive-recursive algorithm to decide the existence of a bounded window."}],"publication_status":"published","day":"24","publisher":"Elsevier","oa_version":"Preprint","doi":"10.1016/j.ic.2015.03.010","year":"2015","author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Doyen, Laurent","last_name":"Doyen","first_name":"Laurent"},{"last_name":"Randour","full_name":"Randour, Mickael","first_name":"Mickael"},{"first_name":"Jean","full_name":"Raskin, Jean","last_name":"Raskin"}],"department":[{"_id":"KrCh"}]},{"scopus_import":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","issue":"6","intvolume":"       242","oa":1,"volume":242,"main_file_link":[{"url":"https://arxiv.org/abs/1409.5306","open_access":"1"}],"related_material":{"record":[{"id":"5403","status":"public","relation":"earlier_version"}]},"_id":"524","date_created":"2018-12-11T11:46:57Z","external_id":{"arxiv":["1409.5306"]},"publication":"Information and Computation","page":"2 - 24","date_published":"2015-10-11T00:00:00Z","date_updated":"2023-02-23T12:24:45Z","title":"Qualitative analysis of concurrent mean payoff games","month":"10","type":"journal_article","citation":{"short":"K. Chatterjee, R. Ibsen-Jensen, Information and Computation 242 (2015) 2–24.","apa":"Chatterjee, K., &#38; Ibsen-Jensen, R. (2015). Qualitative analysis of concurrent mean payoff games. <i>Information and Computation</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ic.2015.03.009\">https://doi.org/10.1016/j.ic.2015.03.009</a>","ieee":"K. Chatterjee and R. Ibsen-Jensen, “Qualitative analysis of concurrent mean payoff games,” <i>Information and Computation</i>, vol. 242, no. 6. Elsevier, pp. 2–24, 2015.","ama":"Chatterjee K, Ibsen-Jensen R. Qualitative analysis of concurrent mean payoff games. <i>Information and Computation</i>. 2015;242(6):2-24. doi:<a href=\"https://doi.org/10.1016/j.ic.2015.03.009\">10.1016/j.ic.2015.03.009</a>","chicago":"Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “Qualitative Analysis of Concurrent Mean Payoff Games.” <i>Information and Computation</i>. Elsevier, 2015. <a href=\"https://doi.org/10.1016/j.ic.2015.03.009\">https://doi.org/10.1016/j.ic.2015.03.009</a>.","ista":"Chatterjee K, Ibsen-Jensen R. 2015. Qualitative analysis of concurrent mean payoff games. Information and Computation. 242(6), 2–24.","mla":"Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “Qualitative Analysis of Concurrent Mean Payoff Games.” <i>Information and Computation</i>, vol. 242, no. 6, Elsevier, 2015, pp. 2–24, doi:<a href=\"https://doi.org/10.1016/j.ic.2015.03.009\">10.1016/j.ic.2015.03.009</a>."},"quality_controlled":"1","abstract":[{"lang":"eng","text":"We consider concurrent games played by two players on a finite-state graph, where in every round the players simultaneously choose a move, and the current state along with the joint moves determine the successor state. We study the most fundamental objective for concurrent games, namely, mean-payoff or limit-average objective, where a reward is associated to each transition, and the goal of player 1 is to maximize the long-run average of the rewards, and the objective of player 2 is strictly the opposite (i.e., the games are zero-sum). The path constraint for player 1 could be qualitative, i.e., the mean-payoff is the maximal reward, or arbitrarily close to it; or quantitative, i.e., a given threshold between the minimal and maximal reward. We consider the computation of the almost-sure (resp. positive) winning sets, where player 1 can ensure that the path constraint is satisfied with probability 1 (resp. positive probability). Almost-sure winning with qualitative constraint exactly corresponds to the question of whether there exists a strategy to ensure that the payoff is the maximal reward of the game. Our main results for qualitative path constraints are as follows: (1) we establish qualitative determinacy results that show that for every state either player 1 has a strategy to ensure almost-sure (resp. positive) winning against all player-2 strategies, or player 2 has a spoiling strategy to falsify almost-sure (resp. positive) winning against all player-1 strategies; (2) we present optimal strategy complexity results that precisely characterize the classes of strategies required for almost-sure and positive winning for both players; and (3) we present quadratic time algorithms to compute the almost-sure and the positive winning sets, matching the best known bound of the algorithms for much simpler problems (such as reachability objectives). For quantitative constraints we show that a polynomial time solution for the almost-sure or the positive winning set would imply a solution to a long-standing open problem (of solving the value problem of turn-based deterministic mean-payoff games) that is not known to be solvable in polynomial time."}],"publication_status":"published","publist_id":"7295","language":[{"iso":"eng"}],"status":"public","publisher":"Elsevier","day":"11","doi":"10.1016/j.ic.2015.03.009","arxiv":1,"oa_version":"Preprint","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"last_name":"Ibsen-Jensen","full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389","id":"3B699956-F248-11E8-B48F-1D18A9856A87","first_name":"Rasmus"}],"year":"2015","department":[{"_id":"KrCh"}]},{"date_created":"2018-12-11T11:47:00Z","day":"22","publisher":"Cell Press","_id":"532","oa_version":"None","page":"670 - 683","doi":"10.1016/j.cell.2015.09.037","publication":"Cell","date_published":"2015-10-22T00:00:00Z","author":[{"last_name":"Li","full_name":"Li, Wenyang","first_name":"Wenyang"},{"last_name":"Ma","full_name":"Ma, Mengdi","first_name":"Mengdi"},{"full_name":"Feng, Ying","last_name":"Feng","first_name":"Ying"},{"last_name":"Li","orcid":"0000-0001-5039-9660","full_name":"Li, Hongjiang","id":"33CA54A6-F248-11E8-B48F-1D18A9856A87","first_name":"Hongjiang"},{"full_name":"Wang, Yichuan","last_name":"Wang","first_name":"Yichuan"},{"first_name":"Yutong","full_name":"Ma, Yutong","last_name":"Ma"},{"full_name":"Li, Mingzhe","last_name":"Li","first_name":"Mingzhe"},{"first_name":"Fengying","full_name":"An, Fengying","last_name":"An"},{"last_name":"Guo","full_name":"Guo, Hongwei","first_name":"Hongwei"}],"year":"2015","month":"10","date_updated":"2021-01-12T08:01:27Z","title":"EIN2-directed translational regulation of ethylene signaling in arabidopsis","department":[{"_id":"JiFr"}],"citation":{"ama":"Li W, Ma M, Feng Y, et al. EIN2-directed translational regulation of ethylene signaling in arabidopsis. <i>Cell</i>. 2015;163(3):670-683. doi:<a href=\"https://doi.org/10.1016/j.cell.2015.09.037\">10.1016/j.cell.2015.09.037</a>","chicago":"Li, Wenyang, Mengdi Ma, Ying Feng, Hongjiang Li, Yichuan Wang, Yutong Ma, Mingzhe Li, Fengying An, and Hongwei Guo. “EIN2-Directed Translational Regulation of Ethylene Signaling in Arabidopsis.” <i>Cell</i>. Cell Press, 2015. <a href=\"https://doi.org/10.1016/j.cell.2015.09.037\">https://doi.org/10.1016/j.cell.2015.09.037</a>.","ista":"Li W, Ma M, Feng Y, Li H, Wang Y, Ma Y, Li M, An F, Guo H. 2015. EIN2-directed translational regulation of ethylene signaling in arabidopsis. Cell. 163(3), 670–683.","mla":"Li, Wenyang, et al. “EIN2-Directed Translational Regulation of Ethylene Signaling in Arabidopsis.” <i>Cell</i>, vol. 163, no. 3, Cell Press, 2015, pp. 670–83, doi:<a href=\"https://doi.org/10.1016/j.cell.2015.09.037\">10.1016/j.cell.2015.09.037</a>.","short":"W. Li, M. Ma, Y. Feng, H. Li, Y. Wang, Y. Ma, M. Li, F. An, H. Guo, Cell 163 (2015) 670–683.","apa":"Li, W., Ma, M., Feng, Y., Li, H., Wang, Y., Ma, Y., … Guo, H. (2015). EIN2-directed translational regulation of ethylene signaling in arabidopsis. <i>Cell</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.cell.2015.09.037\">https://doi.org/10.1016/j.cell.2015.09.037</a>","ieee":"W. Li <i>et al.</i>, “EIN2-directed translational regulation of ethylene signaling in arabidopsis,” <i>Cell</i>, vol. 163, no. 3. Cell Press, pp. 670–683, 2015."},"type":"journal_article","scopus_import":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","issue":"3","intvolume":"       163","quality_controlled":"1","language":[{"iso":"eng"}],"status":"public","volume":163,"publication_status":"published","abstract":[{"text":"Ethylene is a gaseous phytohormone that plays vital roles in plant growth and development. Previous studies uncovered EIN2 as an essential signal transducer linking ethylene perception on ER to transcriptional regulation in the nucleus through a “cleave and shuttle” model. In this study, we report another mechanism of EIN2-mediated ethylene signaling, whereby EIN2 imposes the translational repression of EBF1 and EBF2 mRNA. We find that the EBF1/2 3′ UTRs mediate EIN2-directed translational repression and identify multiple poly-uridylates (PolyU) motifs as functional cis elements of 3′ UTRs. Furthermore, we demonstrate that ethylene induces EIN2 to associate with 3′ UTRs and target EBF1/2 mRNA to cytoplasmic processing-body (P-body) through interacting with multiple P-body factors, including EIN5 and PABs. Our study illustrates translational regulation as a key step in ethylene signaling and presents mRNA 3′ UTR functioning as a “signal transducer” to sense and relay cellular signaling in plants.","lang":"eng"}],"publist_id":"7285"},{"date_updated":"2020-07-14T23:11:45Z","title":"Playful Math - An introduction to mathematical games","department":[{"_id":"VlKo"},{"_id":"UlWa"}],"month":"06","author":[{"last_name":"Huszár","orcid":"0000-0002-5445-5057","full_name":"Huszár, Kristóf","first_name":"Kristóf","id":"33C26278-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Rolinek, Michal","last_name":"Rolinek","first_name":"Michal","id":"3CB3BC06-F248-11E8-B48F-1D18A9856A87"}],"date_published":"2014-06-30T00:00:00Z","article_processing_charge":"No","year":"2014","file_date_updated":"2020-07-14T12:47:48Z","page":"5","oa_version":"Published Version","_id":"7038","publisher":"IST Austria","date_created":"2019-11-18T15:57:05Z","day":"30","publication_status":"draft","language":[{"iso":"eng"}],"has_accepted_license":"1","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"file":[{"content_type":"application/pdf","date_updated":"2020-07-14T12:47:48Z","file_size":511233,"relation":"main_file","checksum":"2b94e5e1f4c3fe8ab89b12806276fb09","access_level":"open_access","file_name":"2014_Playful_Math_Huszar.pdf","file_id":"7039","creator":"dernst","date_created":"2019-11-18T15:57:51Z"}],"type":"working_paper","citation":{"short":"K. Huszár, M. Rolinek, Playful Math - An Introduction to Mathematical Games, IST Austria, n.d.","apa":"Huszár, K., &#38; Rolinek, M. (n.d.). <i>Playful Math - An introduction to mathematical games</i>. IST Austria.","ieee":"K. Huszár and M. Rolinek, <i>Playful Math - An introduction to mathematical games</i>. IST Austria.","chicago":"Huszár, Kristóf, and Michal Rolinek. <i>Playful Math - An Introduction to Mathematical Games</i>. IST Austria, n.d.","ama":"Huszár K, Rolinek M. <i>Playful Math - An Introduction to Mathematical Games</i>. IST Austria","mla":"Huszár, Kristóf, and Michal Rolinek. <i>Playful Math - An Introduction to Mathematical Games</i>. IST Austria.","ista":"Huszár K, Rolinek M. Playful Math - An introduction to mathematical games, IST Austria, 5p."},"ddc":["510"]},{"article_processing_charge":"No","conference":{"end_date":"2014-08-21","start_date":"2014-08-13","location":"Seoul, South Korea","name":"ICM: International Congress of Mathematicans"},"year":"2014","date_published":"2014-08-01T00:00:00Z","author":[{"full_name":"Seiringer, Robert","orcid":"0000-0002-6781-0521","last_name":"Seiringer","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","first_name":"Robert"}],"month":"08","publication_identifier":{"isbn":["9788961058063"]},"department":[{"_id":"RoSe"}],"date_updated":"2023-10-17T11:12:33Z","title":"Structure of the excitation spectrum for many-body quantum systems","day":"01","date_created":"2020-06-29T07:59:35Z","_id":"8044","publisher":"International Congress of Mathematicians","page":"1175-1194","oa_version":"Published Version","publication":"Proceeding of the International Congress of Mathematicans","intvolume":"         3","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","status":"public","language":[{"iso":"eng"}],"main_file_link":[{"url":"http://www.icm2014.org/en/vod/proceedings.html","open_access":"1"}],"volume":3,"abstract":[{"lang":"eng","text":"Many questions concerning models in quantum mechanics require a detailed analysis of the spectrum of the corresponding Hamiltonian, a linear operator on a suitable Hilbert space. Of particular relevance for an understanding of the low-temperature properties of a system is the structure of the excitation spectrum, which is the part of the spectrum close to the spectral bottom. We present recent progress on this question for bosonic many-body quantum systems with weak two-body interactions. Such system are currently of great interest, due to their experimental realization in ultra-cold atomic gases. We investigate the accuracy of the Bogoliubov approximations, which predicts that the low-energy spectrum is made up of sums of elementary excitations, with linear dispersion law at low momentum. The latter property is crucial for the superfluid behavior the system."}],"publication_status":"published","citation":{"apa":"Seiringer, R. (2014). Structure of the excitation spectrum for many-body quantum systems. In <i>Proceeding of the International Congress of Mathematicans</i> (Vol. 3, pp. 1175–1194). Seoul, South Korea: International Congress of Mathematicians.","short":"R. Seiringer, in:, Proceeding of the International Congress of Mathematicans, International Congress of Mathematicians, 2014, pp. 1175–1194.","ieee":"R. Seiringer, “Structure of the excitation spectrum for many-body quantum systems,” in <i>Proceeding of the International Congress of Mathematicans</i>, Seoul, South Korea, 2014, vol. 3, pp. 1175–1194.","ama":"Seiringer R. Structure of the excitation spectrum for many-body quantum systems. In: <i>Proceeding of the International Congress of Mathematicans</i>. Vol 3. International Congress of Mathematicians; 2014:1175-1194.","chicago":"Seiringer, Robert. “Structure of the Excitation Spectrum for Many-Body Quantum Systems.” In <i>Proceeding of the International Congress of Mathematicans</i>, 3:1175–94. International Congress of Mathematicians, 2014.","ista":"Seiringer R. 2014. Structure of the excitation spectrum for many-body quantum systems. Proceeding of the International Congress of Mathematicans. ICM: International Congress of Mathematicans vol. 3, 1175–1194.","mla":"Seiringer, Robert. “Structure of the Excitation Spectrum for Many-Body Quantum Systems.” <i>Proceeding of the International Congress of Mathematicans</i>, vol. 3, International Congress of Mathematicians, 2014, pp. 1175–94."},"scopus_import":"1","type":"conference"},{"department":[{"_id":"LaEr"}],"year":"2014","conference":{"start_date":"2014-08-13","location":"Seoul, Korea","end_date":"2014-08-21","name":"ICM: International Congress of Mathematicians"},"author":[{"first_name":"László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5366-9603","full_name":"Erdös, László","last_name":"Erdös"}],"oa_version":"Submitted Version","publisher":"International Congress of Mathematicians","day":"01","publist_id":"5670","abstract":[{"lang":"eng","text":"The Wigner-Dyson-Gaudin-Mehta conjecture asserts that the local eigenvalue statistics of large real and complex Hermitian matrices with independent, identically distributed entries are universal in a sense that they depend only on the symmetry class of the matrix and otherwise are independent of the details of the distribution. We present the recent solution to this half-century old conjecture. We explain how stochastic tools, such as the Dyson Brownian motion, and PDE ideas, such as De Giorgi-Nash-Moser regularity theory, were combined in the solution. We also show related results for log-gases that represent a universal model for strongly correlated systems. Finally, in the spirit of Wigner’s original vision, we discuss the extensions of these universality results to more realistic physical systems such as random band matrices."}],"publication_status":"published","status":"public","language":[{"iso":"eng"}],"quality_controlled":"1","type":"conference","citation":{"chicago":"Erdös, László. “Random Matrices, Log-Gases and Hölder Regularity.” In <i>Proceedings of the International Congress of Mathematicians</i>, 3:214–36. International Congress of Mathematicians, 2014.","ama":"Erdös L. Random matrices, log-gases and Hölder regularity. In: <i>Proceedings of the International Congress of Mathematicians</i>. Vol 3. International Congress of Mathematicians; 2014:214-236.","mla":"Erdös, László. “Random Matrices, Log-Gases and Hölder Regularity.” <i>Proceedings of the International Congress of Mathematicians</i>, vol. 3, International Congress of Mathematicians, 2014, pp. 214–36.","ista":"Erdös L. 2014. Random matrices, log-gases and Hölder regularity. Proceedings of the International Congress of Mathematicians. ICM: International Congress of Mathematicians vol. 3, 214–236.","apa":"Erdös, L. (2014). Random matrices, log-gases and Hölder regularity. In <i>Proceedings of the International Congress of Mathematicians</i> (Vol. 3, pp. 214–236). Seoul, Korea: International Congress of Mathematicians.","short":"L. Erdös, in:, Proceedings of the International Congress of Mathematicians, International Congress of Mathematicians, 2014, pp. 214–236.","ieee":"L. Erdös, “Random matrices, log-gases and Hölder regularity,” in <i>Proceedings of the International Congress of Mathematicians</i>, Seoul, Korea, 2014, vol. 3, pp. 214–236."},"date_updated":"2023-10-17T11:12:55Z","title":"Random matrices, log-gases and Hölder regularity","month":"08","article_processing_charge":"No","date_published":"2014-08-01T00:00:00Z","ec_funded":1,"publication":"Proceedings of the International Congress of Mathematicians","page":"214 - 236","_id":"1507","project":[{"_id":"258DCDE6-B435-11E9-9278-68D0E5697425","grant_number":"338804","call_identifier":"FP7","name":"Random matrices, universality and disordered quantum systems"}],"date_created":"2018-12-11T11:52:25Z","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1407.5752"}],"volume":3,"oa":1,"intvolume":"         3","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"The author is partially supported by SFB-TR 12 Grant of the German Research Council.","scopus_import":"1"},{"day":"01","external_id":{"arxiv":["1403.2563"]},"date_created":"2018-12-11T11:52:28Z","publisher":"World Scientific Publishing","_id":"1516","arxiv":1,"page":"127 - 137","oa_version":"Preprint","publication":"Proceedings of the QMath12 Conference","doi":"10.1142/9789814618144_0007","conference":{"end_date":"2013-09-13","start_date":"2013-09-10","location":"Berlin, Germany","name":"QMath: Mathematical Results in Quantum Physics"},"article_processing_charge":"No","year":"2014","date_published":"2014-01-01T00:00:00Z","author":[{"first_name":"Gerhard","full_name":"Bräunlich, Gerhard","last_name":"Bräunlich"},{"last_name":"Hainzl","full_name":"Hainzl, Christian","first_name":"Christian"},{"full_name":"Seiringer, Robert","orcid":"0000-0002-6781-0521","last_name":"Seiringer","first_name":"Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87"}],"month":"01","department":[{"_id":"RoSe"}],"date_updated":"2021-01-12T06:51:19Z","title":"On the BCS gap equation for superfluid fermionic gases","citation":{"mla":"Bräunlich, Gerhard, et al. “On the BCS Gap Equation for Superfluid Fermionic Gases.” <i>Proceedings of the QMath12 Conference</i>, World Scientific Publishing, 2014, pp. 127–37, doi:<a href=\"https://doi.org/10.1142/9789814618144_0007\">10.1142/9789814618144_0007</a>.","ista":"Bräunlich G, Hainzl C, Seiringer R. 2014. On the BCS gap equation for superfluid fermionic gases. Proceedings of the QMath12 Conference. QMath: Mathematical Results in Quantum Physics, 127–137.","chicago":"Bräunlich, Gerhard, Christian Hainzl, and Robert Seiringer. “On the BCS Gap Equation for Superfluid Fermionic Gases.” In <i>Proceedings of the QMath12 Conference</i>, 127–37. World Scientific Publishing, 2014. <a href=\"https://doi.org/10.1142/9789814618144_0007\">https://doi.org/10.1142/9789814618144_0007</a>.","ama":"Bräunlich G, Hainzl C, Seiringer R. On the BCS gap equation for superfluid fermionic gases. In: <i>Proceedings of the QMath12 Conference</i>. World Scientific Publishing; 2014:127-137. doi:<a href=\"https://doi.org/10.1142/9789814618144_0007\">10.1142/9789814618144_0007</a>","ieee":"G. Bräunlich, C. Hainzl, and R. Seiringer, “On the BCS gap equation for superfluid fermionic gases,” in <i>Proceedings of the QMath12 Conference</i>, Berlin, Germany, 2014, pp. 127–137.","short":"G. Bräunlich, C. Hainzl, R. Seiringer, in:, Proceedings of the QMath12 Conference, World Scientific Publishing, 2014, pp. 127–137.","apa":"Bräunlich, G., Hainzl, C., &#38; Seiringer, R. (2014). On the BCS gap equation for superfluid fermionic gases. In <i>Proceedings of the QMath12 Conference</i> (pp. 127–137). Berlin, Germany: World Scientific Publishing. <a href=\"https://doi.org/10.1142/9789814618144_0007\">https://doi.org/10.1142/9789814618144_0007</a>"},"type":"conference","oa":1,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","status":"public","language":[{"iso":"eng"}],"publist_id":"5661","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1403.2563"}],"publication_status":"published","abstract":[{"text":"We present a rigorous derivation of the BCS gap equation for superfluid fermionic gases with point interactions. Our starting point is the BCS energy functional, whose minimizer we investigate in the limit when the range of the interaction potential goes to zero.\r\n","lang":"eng"}]},{"article_number":"15","oa":1,"intvolume":"        33","issue":"2","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","volume":33,"date_published":"2014-03-01T00:00:00Z","date_updated":"2021-01-12T06:52:06Z","title":"Edit propagation using geometric relationship functions","month":"03","_id":"1629","date_created":"2018-12-11T11:53:08Z","publication":"ACM Transactions on Graphics","pubrep_id":"577","file_date_updated":"2020-07-14T12:45:07Z","quality_controlled":"1","publist_id":"5526","abstract":[{"lang":"eng","text":"We propose a method for propagating edit operations in 2D vector graphics, based on geometric relationship functions. These functions quantify the geometric relationship of a point to a polygon, such as the distance to the boundary or the direction to the closest corner vertex. The level sets of the relationship functions describe points with the same relationship to a polygon. For a given query point, we first determine a set of relationships to local features, construct all level sets for these relationships, and accumulate them. The maxima of the resulting distribution are points with similar geometric relationships. We show extensions to handle mirror symmetries, and discuss the use of relationship functions as local coordinate systems. Our method can be applied, for example, to interactive floorplan editing, and it is especially useful for large layouts, where individual edits would be cumbersome. We demonstrate populating 2D layouts with tens to hundreds of objects by propagating relatively few edit operations."}],"publication_status":"published","status":"public","has_accepted_license":"1","language":[{"iso":"eng"}],"ddc":["000"],"file":[{"file_id":"4876","creator":"system","date_created":"2018-12-12T10:11:22Z","checksum":"7f91e588a4e888610313b98271e6418e","relation":"main_file","date_updated":"2020-07-14T12:45:07Z","content_type":"application/pdf","file_size":9832561,"file_name":"IST-2016-577-v1+1_2014.TOG.Paul.EditingPropagation.final.pdf","access_level":"open_access"}],"citation":{"ieee":"P. Guerrero, S. Jeschke, M. Wimmer, and P. Wonka, “Edit propagation using geometric relationship functions,” <i>ACM Transactions on Graphics</i>, vol. 33, no. 2. ACM, 2014.","apa":"Guerrero, P., Jeschke, S., Wimmer, M., &#38; Wonka, P. (2014). Edit propagation using geometric relationship functions. <i>ACM Transactions on Graphics</i>. ACM. <a href=\"https://doi.org/10.1145/2591010\">https://doi.org/10.1145/2591010</a>","short":"P. Guerrero, S. Jeschke, M. Wimmer, P. Wonka, ACM Transactions on Graphics 33 (2014).","ista":"Guerrero P, Jeschke S, Wimmer M, Wonka P. 2014. Edit propagation using geometric relationship functions. ACM Transactions on Graphics. 33(2), 15.","mla":"Guerrero, Paul, et al. “Edit Propagation Using Geometric Relationship Functions.” <i>ACM Transactions on Graphics</i>, vol. 33, no. 2, 15, ACM, 2014, doi:<a href=\"https://doi.org/10.1145/2591010\">10.1145/2591010</a>.","chicago":"Guerrero, Paul, Stefan Jeschke, Michael Wimmer, and Peter Wonka. “Edit Propagation Using Geometric Relationship Functions.” <i>ACM Transactions on Graphics</i>. ACM, 2014. <a href=\"https://doi.org/10.1145/2591010\">https://doi.org/10.1145/2591010</a>.","ama":"Guerrero P, Jeschke S, Wimmer M, Wonka P. Edit propagation using geometric relationship functions. <i>ACM Transactions on Graphics</i>. 2014;33(2). doi:<a href=\"https://doi.org/10.1145/2591010\">10.1145/2591010</a>"},"type":"journal_article","year":"2014","author":[{"full_name":"Guerrero, Paul","last_name":"Guerrero","first_name":"Paul"},{"id":"44D6411A-F248-11E8-B48F-1D18A9856A87","first_name":"Stefan","full_name":"Jeschke, Stefan","last_name":"Jeschke"},{"last_name":"Wimmer","full_name":"Wimmer, Michael","first_name":"Michael"},{"first_name":"Peter","last_name":"Wonka","full_name":"Wonka, Peter"}],"department":[{"_id":"ChWo"}],"publisher":"ACM","day":"01","doi":"10.1145/2591010","oa_version":"Submitted Version"},{"ec_funded":1,"date_published":"2014-01-01T00:00:00Z","month":"01","title":"Constrained Verifiable Random Functions ","date_updated":"2021-01-12T06:52:12Z","date_created":"2018-12-11T11:53:13Z","project":[{"name":"Provable Security for Physical Cryptography","_id":"258C570E-B435-11E9-9278-68D0E5697425","grant_number":"259668","call_identifier":"FP7"}],"_id":"1643","page":"95 - 114","publication":"SCN 2014","oa":1,"intvolume":"      8642","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"open_access":"1","url":"http://eprint.iacr.org/2014/537"}],"alternative_title":["LNCS"],"volume":8642,"scopus_import":1,"editor":[{"first_name":"Michel","full_name":"Abdalla, Michel","last_name":"Abdalla"},{"last_name":"De Prisco","full_name":"De Prisco, Roberto","first_name":"Roberto"}],"conference":{"name":"SCN: Security and Cryptography for Networks","end_date":"2014-09-05","location":"Amalfi, Italy","start_date":"2014-09-03"},"year":"2014","author":[{"first_name":"Georg","id":"46B4C3EE-F248-11E8-B48F-1D18A9856A87","last_name":"Fuchsbauer","full_name":"Fuchsbauer, Georg"}],"department":[{"_id":"KrPi"}],"day":"01","publisher":"Springer","oa_version":"Submitted Version","doi":"10.1007/978-3-319-10879-7_7","status":"public","language":[{"iso":"eng"}],"publist_id":"5509","publication_status":"published","abstract":[{"text":"We extend the notion of verifiable random functions (VRF) to constrained VRFs, which generalize the concept of constrained pseudorandom functions, put forward by Boneh and Waters (Asiacrypt’13), and independently by Kiayias et al. (CCS’13) and Boyle et al. (PKC’14), who call them delegatable PRFs and functional PRFs, respectively. In a standard VRF the secret key sk allows one to evaluate a pseudorandom function at any point of its domain; in addition, it enables computation of a non-interactive proof that the function value was computed correctly. In a constrained VRF from the key sk one can derive constrained keys skS for subsets S of the domain, which allow computation of function values and proofs only at points in S. After formally defining constrained VRFs, we derive instantiations from the multilinear-maps-based constrained PRFs by Boneh and Waters, yielding a VRF with constrained keys for any set that can be decided by a polynomial-size circuit. Our VRFs have the same function values as the Boneh-Waters PRFs and are proved secure under the same hardness assumption, showing that verifiability comes at no cost. Constrained (functional) VRFs were stated as an open problem by Boyle et al.","lang":"eng"}],"type":"conference","citation":{"ieee":"G. Fuchsbauer, “Constrained Verifiable Random Functions ,” in <i>SCN 2014</i>, Amalfi, Italy, 2014, vol. 8642, pp. 95–114.","short":"G. Fuchsbauer, in:, M. Abdalla, R. De Prisco (Eds.), SCN 2014, Springer, 2014, pp. 95–114.","apa":"Fuchsbauer, G. (2014). Constrained Verifiable Random Functions . In M. Abdalla &#38; R. De Prisco (Eds.), <i>SCN 2014</i> (Vol. 8642, pp. 95–114). Amalfi, Italy: Springer. <a href=\"https://doi.org/10.1007/978-3-319-10879-7_7\">https://doi.org/10.1007/978-3-319-10879-7_7</a>","ista":"Fuchsbauer G. 2014. Constrained Verifiable Random Functions . SCN 2014. SCN: Security and Cryptography for Networks, LNCS, vol. 8642, 95–114.","mla":"Fuchsbauer, Georg. “Constrained Verifiable Random Functions .” <i>SCN 2014</i>, edited by Michel Abdalla and Roberto De Prisco, vol. 8642, Springer, 2014, pp. 95–114, doi:<a href=\"https://doi.org/10.1007/978-3-319-10879-7_7\">10.1007/978-3-319-10879-7_7</a>.","ama":"Fuchsbauer G. Constrained Verifiable Random Functions . In: Abdalla M, De Prisco R, eds. <i>SCN 2014</i>. Vol 8642. Springer; 2014:95-114. doi:<a href=\"https://doi.org/10.1007/978-3-319-10879-7_7\">10.1007/978-3-319-10879-7_7</a>","chicago":"Fuchsbauer, Georg. “Constrained Verifiable Random Functions .” In <i>SCN 2014</i>, edited by Michel Abdalla and Roberto De Prisco, 8642:95–114. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-319-10879-7_7\">https://doi.org/10.1007/978-3-319-10879-7_7</a>."}},{"publisher":"Open Publishing","_id":"1702","day":"02","date_created":"2018-12-11T11:53:33Z","publication":"Electronic Proceedings in Theoretical Computer Science, EPTCS","doi":"10.4204/EPTCS.169.5","oa_version":"Submitted Version","page":"31 - 38","year":"2014","conference":{"name":"HCVS: Horn Clauses for Verification and Synthesis","end_date":"2014-07-17","start_date":"2014-07-17","location":"Vienna, Austria"},"date_published":"2014-12-02T00:00:00Z","author":[{"last_name":"Gupta","full_name":"Gupta, Ashutosh","first_name":"Ashutosh","id":"335E5684-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Popeea","full_name":"Popeea, Corneliu","first_name":"Corneliu"},{"full_name":"Rybalchenko, Andrey","last_name":"Rybalchenko","first_name":"Andrey"}],"department":[{"_id":"ToHe"}],"title":"Generalised interpolation by solving recursion free-horn clauses","date_updated":"2021-01-12T06:52:38Z","month":"12","citation":{"chicago":"Gupta, Ashutosh, Corneliu Popeea, and Andrey Rybalchenko. “Generalised Interpolation by Solving Recursion Free-Horn Clauses.” In <i>Electronic Proceedings in Theoretical Computer Science, EPTCS</i>, 169:31–38. Open Publishing, 2014. <a href=\"https://doi.org/10.4204/EPTCS.169.5\">https://doi.org/10.4204/EPTCS.169.5</a>.","ama":"Gupta A, Popeea C, Rybalchenko A. Generalised interpolation by solving recursion free-horn clauses. In: <i>Electronic Proceedings in Theoretical Computer Science, EPTCS</i>. Vol 169. Open Publishing; 2014:31-38. doi:<a href=\"https://doi.org/10.4204/EPTCS.169.5\">10.4204/EPTCS.169.5</a>","mla":"Gupta, Ashutosh, et al. “Generalised Interpolation by Solving Recursion Free-Horn Clauses.” <i>Electronic Proceedings in Theoretical Computer Science, EPTCS</i>, vol. 169, Open Publishing, 2014, pp. 31–38, doi:<a href=\"https://doi.org/10.4204/EPTCS.169.5\">10.4204/EPTCS.169.5</a>.","ista":"Gupta A, Popeea C, Rybalchenko A. 2014. Generalised interpolation by solving recursion free-horn clauses. Electronic Proceedings in Theoretical Computer Science, EPTCS. HCVS: Horn Clauses for Verification and Synthesis, EPTCS, vol. 169, 31–38.","short":"A. Gupta, C. Popeea, A. Rybalchenko, in:, Electronic Proceedings in Theoretical Computer Science, EPTCS, Open Publishing, 2014, pp. 31–38.","apa":"Gupta, A., Popeea, C., &#38; Rybalchenko, A. (2014). Generalised interpolation by solving recursion free-horn clauses. In <i>Electronic Proceedings in Theoretical Computer Science, EPTCS</i> (Vol. 169, pp. 31–38). Vienna, Austria: Open Publishing. <a href=\"https://doi.org/10.4204/EPTCS.169.5\">https://doi.org/10.4204/EPTCS.169.5</a>","ieee":"A. Gupta, C. Popeea, and A. Rybalchenko, “Generalised interpolation by solving recursion free-horn clauses,” in <i>Electronic Proceedings in Theoretical Computer Science, EPTCS</i>, Vienna, Austria, 2014, vol. 169, pp. 31–38."},"type":"conference","quality_controlled":"1","intvolume":"       169","oa":1,"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","publist_id":"5435","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1303.7378v2"}],"volume":169,"alternative_title":["EPTCS"],"publication_status":"published","abstract":[{"lang":"eng","text":"In this paper we present INTERHORN, a solver for recursion-free Horn clauses. The main application domain of INTERHORN lies in solving interpolation problems arising in software verification. We show how a range of interpolation problems, including path, transition, nested, state/transition and well-founded interpolation can be handled directly by INTERHORN. By detailing these interpolation problems and their Horn clause representations, we hope to encourage the emergence of a common back-end interpolation interface useful for diverse verification tools."}],"status":"public","language":[{"iso":"eng"}]},{"abstract":[{"lang":"eng","text":"It has been long argued that, because of inherent ambiguity and noise, the brain needs to represent uncertainty in the form of probability distributions. The neural encoding of such distributions remains however highly controversial. Here we present a novel circuit model for representing multidimensional real-valued distributions using a spike based spatio-temporal code. Our model combines the computational advantages of the currently competing models for probabilistic codes and exhibits realistic neural responses along a variety of classic measures. Furthermore, the model highlights the challenges associated with interpreting neural activity in relation to behavioral uncertainty and points to alternative population-level approaches for the experimental validation of distributed representations."}],"volume":3,"publication_status":"published","main_file_link":[{"url":"http://papers.nips.cc/paper/5343-spatio-temporal-representations-of-uncertainty-in-spiking-neural-networks.pdf"}],"publist_id":"5427","language":[{"iso":"eng"}],"status":"public","quality_controlled":"1","issue":"January","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","intvolume":"         3","scopus_import":1,"type":"conference","citation":{"ama":"Savin C, Denève S. Spatio-temporal representations of uncertainty in spiking neural networks. In: Vol 3. Neural Information Processing Systems; 2014:2024-2032.","chicago":"Savin, Cristina, and Sophie Denève. “Spatio-Temporal Representations of Uncertainty in Spiking Neural Networks,” 3:2024–32. Neural Information Processing Systems, 2014.","mla":"Savin, Cristina, and Sophie Denève. <i>Spatio-Temporal Representations of Uncertainty in Spiking Neural Networks</i>. Vol. 3, no. January, Neural Information Processing Systems, 2014, pp. 2024–32.","ista":"Savin C, Denève S. 2014. Spatio-temporal representations of uncertainty in spiking neural networks. NIPS: Neural Information Processing Systems vol. 3, 2024–2032.","short":"C. Savin, S. Denève, in:, Neural Information Processing Systems, 2014, pp. 2024–2032.","apa":"Savin, C., &#38; Denève, S. (2014). Spatio-temporal representations of uncertainty in spiking neural networks (Vol. 3, pp. 2024–2032). Presented at the NIPS: Neural Information Processing Systems, Montreal, Canada: Neural Information Processing Systems.","ieee":"C. Savin and S. Denève, “Spatio-temporal representations of uncertainty in spiking neural networks,” presented at the NIPS: Neural Information Processing Systems, Montreal, Canada, 2014, vol. 3, no. January, pp. 2024–2032."},"date_updated":"2021-01-12T06:52:40Z","title":"Spatio-temporal representations of uncertainty in spiking neural networks","department":[{"_id":"GaTk"}],"month":"01","author":[{"last_name":"Savin","full_name":"Savin, Cristina","first_name":"Cristina","id":"3933349E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Denève, Sophie","last_name":"Denève","first_name":"Sophie"}],"date_published":"2014-01-01T00:00:00Z","year":"2014","conference":{"start_date":"2014-12-08","location":"Montreal, Canada","end_date":"2014-12-13","name":"NIPS: Neural Information Processing Systems"},"oa_version":"None","page":"2024 - 2032","_id":"1708","publisher":"Neural Information Processing Systems","date_created":"2018-12-11T11:53:35Z","day":"01"},{"day":"04","publisher":"Elsevier","oa_version":"Submitted Version","doi":"10.1016/j.tcs.2014.08.019","author":[{"first_name":"Pavol","last_name":"Cerny","full_name":"Cerny, Pavol"},{"id":"3624234E-F248-11E8-B48F-1D18A9856A87","first_name":"Martin","full_name":"Chmelik, Martin","last_name":"Chmelik"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"},{"full_name":"Radhakrishna, Arjun","last_name":"Radhakrishna","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","first_name":"Arjun"}],"year":"2014","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"type":"journal_article","citation":{"chicago":"Cerny, Pavol, Martin Chmelik, Thomas A Henzinger, and Arjun Radhakrishna. “Interface Simulation Distances.” <i>Theoretical Computer Science</i>. Elsevier, 2014. <a href=\"https://doi.org/10.1016/j.tcs.2014.08.019\">https://doi.org/10.1016/j.tcs.2014.08.019</a>.","ama":"Cerny P, Chmelik M, Henzinger TA, Radhakrishna A. Interface simulation distances. <i>Theoretical Computer Science</i>. 2014;560(3):348-363. doi:<a href=\"https://doi.org/10.1016/j.tcs.2014.08.019\">10.1016/j.tcs.2014.08.019</a>","mla":"Cerny, Pavol, et al. “Interface Simulation Distances.” <i>Theoretical Computer Science</i>, vol. 560, no. 3, Elsevier, 2014, pp. 348–63, doi:<a href=\"https://doi.org/10.1016/j.tcs.2014.08.019\">10.1016/j.tcs.2014.08.019</a>.","ista":"Cerny P, Chmelik M, Henzinger TA, Radhakrishna A. 2014. Interface simulation distances. Theoretical Computer Science. 560(3), 348–363.","short":"P. Cerny, M. Chmelik, T.A. Henzinger, A. Radhakrishna, Theoretical Computer Science 560 (2014) 348–363.","apa":"Cerny, P., Chmelik, M., Henzinger, T. A., &#38; Radhakrishna, A. (2014). Interface simulation distances. <i>Theoretical Computer Science</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.tcs.2014.08.019\">https://doi.org/10.1016/j.tcs.2014.08.019</a>","ieee":"P. Cerny, M. Chmelik, T. A. Henzinger, and A. Radhakrishna, “Interface simulation distances,” <i>Theoretical Computer Science</i>, vol. 560, no. 3. Elsevier, pp. 348–363, 2014."},"quality_controlled":"1","language":[{"iso":"eng"}],"status":"public","abstract":[{"lang":"eng","text":"The classical (boolean) notion of refinement for behavioral interfaces of system components is the alternating refinement preorder. In this paper, we define a distance for interfaces, called interface simulation distance. It makes the alternating refinement preorder quantitative by, intuitively, tolerating errors (while counting them) in the alternating simulation game. We show that the interface simulation distance satisfies the triangle inequality, that the distance between two interfaces does not increase under parallel composition with a third interface, that the distance between two interfaces can be bounded from above and below by distances between abstractions of the two interfaces, and how to synthesize an interface from incompatible requirements. We illustrate the framework, and the properties of the distances under composition of interfaces, with two case studies."}],"publication_status":"published","publist_id":"5392","date_created":"2018-12-11T11:53:43Z","_id":"1733","project":[{"call_identifier":"FP7","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling"},{"name":"Moderne Concurrency Paradigms","call_identifier":"FWF","grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","name":"Game Theory"},{"name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"page":"348 - 363","publication":"Theoretical Computer Science","ec_funded":1,"date_published":"2014-12-04T00:00:00Z","month":"12","title":"Interface simulation distances","date_updated":"2023-02-23T11:04:00Z","scopus_import":1,"issue":"3","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","oa":1,"intvolume":"       560","volume":560,"main_file_link":[{"url":"http://arxiv.org/abs/1210.2450","open_access":"1"}],"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"2916"}]}},{"abstract":[{"text":"The generation of asymmetry, at both cellular and tissue level, is one of the most essential capabilities of all eukaryotic organisms. It mediates basically all multicellular development ranging from embryogenesis and de novo organ formation till responses to various environmental stimuli. In plants, the awe-inspiring number of such processes is regulated by phytohormone auxin and its directional, cell-to-cell transport. The mediators of this transport, PIN auxin transporters, are asymmetrically localized at the plasma membrane, and this polar localization determines the directionality of intercellular auxin flow. Thus, auxin transport contributes crucially to the generation of local auxin gradients or maxima, which instruct given cell to change its developmental program. Here, we introduce and discuss the molecular components and cellular mechanisms regulating the generation and maintenance of cellular PIN polarity, as the general hallmarks of cell polarity in plants.","lang":"eng"}],"publication_status":"published","publist_id":"5304","language":[{"iso":"eng"}],"status":"public","quality_controlled":"1","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","type":"book_chapter","scopus_import":1,"citation":{"ista":"Baster P, Friml J. 2014.Auxin on the road navigated by cellular PIN polarity. In: Auxin and Its Role in Plant Development. , 143–170.","mla":"Baster, Pawel, and Jiří Friml. “Auxin on the Road Navigated by Cellular PIN Polarity.” <i>Auxin and Its Role in Plant Development</i>, edited by Eva Zažímalová et al., Springer, 2014, pp. 143–70, doi:<a href=\"https://doi.org/10.1007/978-3-7091-1526-8_8\">10.1007/978-3-7091-1526-8_8</a>.","ama":"Baster P, Friml J. Auxin on the road navigated by cellular PIN polarity. In: Zažímalová E, Petrášek J, Benková E, eds. <i>Auxin and Its Role in Plant Development</i>. Springer; 2014:143-170. doi:<a href=\"https://doi.org/10.1007/978-3-7091-1526-8_8\">10.1007/978-3-7091-1526-8_8</a>","chicago":"Baster, Pawel, and Jiří Friml. “Auxin on the Road Navigated by Cellular PIN Polarity.” In <i>Auxin and Its Role in Plant Development</i>, edited by Eva Zažímalová, Jan Petrášek, and Eva Benková, 143–70. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-7091-1526-8_8\">https://doi.org/10.1007/978-3-7091-1526-8_8</a>.","ieee":"P. Baster and J. Friml, “Auxin on the road navigated by cellular PIN polarity,” in <i>Auxin and Its Role in Plant Development</i>, E. Zažímalová, J. Petrášek, and E. Benková, Eds. Springer, 2014, pp. 143–170.","short":"P. Baster, J. Friml, in:, E. Zažímalová, J. Petrášek, E. Benková (Eds.), Auxin and Its Role in Plant Development, Springer, 2014, pp. 143–170.","apa":"Baster, P., &#38; Friml, J. (2014). Auxin on the road navigated by cellular PIN polarity. In E. Zažímalová, J. Petrášek, &#38; E. Benková (Eds.), <i>Auxin and Its Role in Plant Development</i> (pp. 143–170). Springer. <a href=\"https://doi.org/10.1007/978-3-7091-1526-8_8\">https://doi.org/10.1007/978-3-7091-1526-8_8</a>"},"date_updated":"2021-01-12T06:53:19Z","title":"Auxin on the road navigated by cellular PIN polarity","department":[{"_id":"JiFr"}],"month":"04","date_published":"2014-04-01T00:00:00Z","author":[{"full_name":"Baster, Pawel","last_name":"Baster","first_name":"Pawel","id":"3028BD74-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Jiří","id":"4159519E-F248-11E8-B48F-1D18A9856A87","full_name":"Friml, Jiří","orcid":"0000-0002-8302-7596","last_name":"Friml"}],"year":"2014","editor":[{"first_name":"Eva","full_name":"Zažímalová, Eva","last_name":"Zažímalová"},{"first_name":"Jan","full_name":"Petrášek, Jan","last_name":"Petrášek"},{"full_name":"Benková, Eva","orcid":"0000-0002-8510-9739","last_name":"Benková","first_name":"Eva","id":"38F4F166-F248-11E8-B48F-1D18A9856A87"}],"doi":"10.1007/978-3-7091-1526-8_8","publication":"Auxin and Its Role in Plant Development","page":"143 - 170","oa_version":"None","_id":"1806","publisher":"Springer","date_created":"2018-12-11T11:54:07Z","day":"01"},{"quality_controlled":"1","abstract":[{"lang":"eng","text":"Watermarking techniques for vector graphics dislocate vertices in order to embed imperceptible, yet detectable, statistical features into the input data. The embedding process may result in a change of the topology of the input data, e.g., by introducing self-intersections, which is undesirable or even disastrous for many applications. In this paper we present a watermarking framework for two-dimensional vector graphics that employs conventional watermarking techniques but still provides the guarantee that the topology of the input data is preserved. The geometric part of this framework computes so-called maximum perturbation regions (MPR) of vertices. We propose two efficient algorithms to compute MPRs based on Voronoi diagrams and constrained triangulations. Furthermore, we present two algorithms to conditionally correct the watermarked data in order to increase the watermark embedding capacity and still guarantee topological correctness. While we focus on the watermarking of input formed by straight-line segments, one of our approaches can also be extended to circular arcs. We conclude the paper by demonstrating and analyzing the applicability of our framework in conjunction with two well-known watermarking techniques."}],"publication_status":"published","publist_id":"5290","language":[{"iso":"eng"}],"has_accepted_license":"1","status":"public","ddc":["000"],"file":[{"creator":"system","date_created":"2018-12-12T10:08:43Z","file_id":"4704","access_level":"open_access","file_name":"IST-2016-443-v1+1_S0218195914500034.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:45:17Z","file_size":991734,"checksum":"be45c133ab4d43351260e21beaa8f4b1","relation":"main_file"}],"citation":{"ama":"Huber S, Held M, Meerwald P, Kwitt R. Topology-preserving watermarking of vector graphics. <i>International Journal of Computational Geometry and Applications</i>. 2014;24(1):61-86. doi:<a href=\"https://doi.org/10.1142/S0218195914500034\">10.1142/S0218195914500034</a>","chicago":"Huber, Stefan, Martin Held, Peter Meerwald, and Roland Kwitt. “Topology-Preserving Watermarking of Vector Graphics.” <i>International Journal of Computational Geometry and Applications</i>. World Scientific Publishing, 2014. <a href=\"https://doi.org/10.1142/S0218195914500034\">https://doi.org/10.1142/S0218195914500034</a>.","ista":"Huber S, Held M, Meerwald P, Kwitt R. 2014. Topology-preserving watermarking of vector graphics. International Journal of Computational Geometry and Applications. 24(1), 61–86.","mla":"Huber, Stefan, et al. “Topology-Preserving Watermarking of Vector Graphics.” <i>International Journal of Computational Geometry and Applications</i>, vol. 24, no. 1, World Scientific Publishing, 2014, pp. 61–86, doi:<a href=\"https://doi.org/10.1142/S0218195914500034\">10.1142/S0218195914500034</a>.","short":"S. Huber, M. Held, P. Meerwald, R. Kwitt, International Journal of Computational Geometry and Applications 24 (2014) 61–86.","apa":"Huber, S., Held, M., Meerwald, P., &#38; Kwitt, R. (2014). Topology-preserving watermarking of vector graphics. <i>International Journal of Computational Geometry and Applications</i>. World Scientific Publishing. <a href=\"https://doi.org/10.1142/S0218195914500034\">https://doi.org/10.1142/S0218195914500034</a>","ieee":"S. Huber, M. Held, P. Meerwald, and R. Kwitt, “Topology-preserving watermarking of vector graphics,” <i>International Journal of Computational Geometry and Applications</i>, vol. 24, no. 1. World Scientific Publishing, pp. 61–86, 2014."},"type":"journal_article","author":[{"full_name":"Huber, Stefan","orcid":"0000-0002-8871-5814","last_name":"Huber","id":"4700A070-F248-11E8-B48F-1D18A9856A87","first_name":"Stefan"},{"full_name":"Held, Martin","last_name":"Held","first_name":"Martin"},{"first_name":"Peter","last_name":"Meerwald","full_name":"Meerwald, Peter"},{"full_name":"Kwitt, Roland","last_name":"Kwitt","first_name":"Roland"}],"year":"2014","department":[{"_id":"HeEd"}],"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publisher":"World Scientific Publishing","day":"16","doi":"10.1142/S0218195914500034","oa_version":"Published Version","acknowledgement":"Work by Martin Held and Stefan Huber was supported by Austrian Science Fund (FWF): L367-N15 and P25816-N15.","issue":"1","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","intvolume":"        24","oa":1,"volume":24,"scopus_import":1,"date_published":"2014-03-16T00:00:00Z","title":"Topology-preserving watermarking of vector graphics","date_updated":"2021-01-12T06:53:23Z","month":"03","_id":"1816","date_created":"2018-12-11T11:54:10Z","pubrep_id":"443","file_date_updated":"2020-07-14T12:45:17Z","publication":"International Journal of Computational Geometry and Applications","page":"61 - 86"}]