[{"abstract":[{"lang":"eng","text":"Repeated pathogen exposure is a common threat in colonies of social insects, posing selection pressures on colony members to respond with improved disease-defense performance. We here tested whether experience gained by repeated tending of low-level fungus-exposed (Metarhizium robertsii) larvae may alter the performance of sanitary brood care in the clonal ant, Platythyrea punctata. We trained ants individually over nine consecutive trials to either sham-treated or fungus-exposed larvae. We then compared the larval grooming behavior of naive and trained ants and measured how effectively they removed infectious fungal conidiospores from the fungus-exposed larvae. We found that the ants changed the duration of larval grooming in response to both, larval treatment and their level of experience: (1) sham-treated larvae received longer grooming than the fungus-exposed larvae and (2) trained ants performed less self-grooming but longer larval grooming than naive ants, which was true for both, ants trained to fungus-exposed and also to sham-treated larvae. Ants that groomed the fungus-exposed larvae for longer periods removed a higher number of fungal conidiospores from the surface of the fungus-exposed larvae. As experienced ants performed longer larval grooming, they were more effective in fungal removal, thus making them better caretakers under pathogen attack of the colony. By studying this clonal ant, we can thus conclude that even in the absence of genetic variation between colony members, differences in experience levels of brood care may affect performance of sanitary brood care in social insects."}],"related_material":{"record":[{"status":"public","relation":"used_in_publication","id":"2161"}]},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.5061/dryad.7kc79"}],"status":"public","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","oa":1,"citation":{"ieee":"C. Westhus, L. V. Ugelvig, E. Tourdot, J. Heinze, C. Doums, and S. Cremer, “Data from: Increased grooming after repeated brood care provides sanitary benefits in a clonal ant.” Dryad, 2015.","short":"C. Westhus, L.V. Ugelvig, E. Tourdot, J. Heinze, C. Doums, S. Cremer, (2015).","apa":"Westhus, C., Ugelvig, L. V., Tourdot, E., Heinze, J., Doums, C., &#38; Cremer, S. (2015). Data from: Increased grooming after repeated brood care provides sanitary benefits in a clonal ant. Dryad. <a href=\"https://doi.org/10.5061/dryad.7kc79\">https://doi.org/10.5061/dryad.7kc79</a>","mla":"Westhus, Claudia, et al. <i>Data from: Increased Grooming after Repeated Brood Care Provides Sanitary Benefits in a Clonal Ant</i>. Dryad, 2015, doi:<a href=\"https://doi.org/10.5061/dryad.7kc79\">10.5061/dryad.7kc79</a>.","ista":"Westhus C, Ugelvig LV, Tourdot E, Heinze J, Doums C, Cremer S. 2015. Data from: Increased grooming after repeated brood care provides sanitary benefits in a clonal ant, Dryad, <a href=\"https://doi.org/10.5061/dryad.7kc79\">10.5061/dryad.7kc79</a>.","chicago":"Westhus, Claudia, Line V Ugelvig, Edouard Tourdot, Jürgen Heinze, Claudie Doums, and Sylvia Cremer. “Data from: Increased Grooming after Repeated Brood Care Provides Sanitary Benefits in a Clonal Ant.” Dryad, 2015. <a href=\"https://doi.org/10.5061/dryad.7kc79\">https://doi.org/10.5061/dryad.7kc79</a>.","ama":"Westhus C, Ugelvig LV, Tourdot E, Heinze J, Doums C, Cremer S. Data from: Increased grooming after repeated brood care provides sanitary benefits in a clonal ant. 2015. doi:<a href=\"https://doi.org/10.5061/dryad.7kc79\">10.5061/dryad.7kc79</a>"},"type":"research_data_reference","title":"Data from: Increased grooming after repeated brood care provides sanitary benefits in a clonal ant","date_updated":"2023-02-23T10:30:52Z","department":[{"_id":"SyCr"}],"month":"07","author":[{"full_name":"Westhus, Claudia","last_name":"Westhus","first_name":"Claudia"},{"id":"3DC97C8E-F248-11E8-B48F-1D18A9856A87","first_name":"Line V","full_name":"Ugelvig, Line V","orcid":"0000-0003-1832-8883","last_name":"Ugelvig"},{"last_name":"Tourdot","full_name":"Tourdot, Edouard","first_name":"Edouard"},{"full_name":"Heinze, Jürgen","last_name":"Heinze","first_name":"Jürgen"},{"full_name":"Doums, Claudie","last_name":"Doums","first_name":"Claudie"},{"id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","first_name":"Sylvia","last_name":"Cremer","full_name":"Cremer, Sylvia","orcid":"0000-0002-2193-3868"}],"date_published":"2015-07-09T00:00:00Z","article_processing_charge":"No","year":"2015","doi":"10.5061/dryad.7kc79","oa_version":"Published Version","_id":"9742","publisher":"Dryad","date_created":"2021-07-28T08:52:53Z","day":"09"},{"date_published":"2015-11-18T00:00:00Z","author":[{"first_name":"Guillaume","id":"424D78A0-F248-11E8-B48F-1D18A9856A87","full_name":"Chevereau, Guillaume","last_name":"Chevereau"},{"last_name":"Lukacisinova","orcid":"0000-0002-2519-8004","full_name":"Lukacisinova, Marta","first_name":"Marta","id":"4342E402-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Tugce","full_name":"Batur, Tugce","last_name":"Batur"},{"last_name":"Guvenek","full_name":"Guvenek, Aysegul","first_name":"Aysegul"},{"full_name":"Ayhan, Dilay Hazal","last_name":"Ayhan","first_name":"Dilay Hazal"},{"last_name":"Toprak","full_name":"Toprak, Erdal","first_name":"Erdal"},{"first_name":"Mark Tobias","id":"3E6DB97A-F248-11E8-B48F-1D18A9856A87","last_name":"Bollenbach","full_name":"Bollenbach, Mark Tobias","orcid":"0000-0003-4398-476X"}],"year":"2015","article_processing_charge":"No","date_updated":"2023-02-23T10:07:02Z","title":"Gene ontology enrichment analysis for the most sensitive gene deletion strains for all drugs","department":[{"_id":"ToBo"}],"month":"11","_id":"9765","publisher":"Public Library of Science","date_created":"2021-08-03T07:05:16Z","day":"18","doi":"10.1371/journal.pbio.1002299.s008","oa_version":"Published Version","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","related_material":{"record":[{"relation":"used_in_publication","status":"public","id":"1619"}]},"status":"public","citation":{"ieee":"G. Chevereau <i>et al.</i>, “Gene ontology enrichment analysis for the most sensitive gene deletion strains for all drugs.” Public Library of Science, 2015.","short":"G. Chevereau, M. Lukacisinova, T. Batur, A. Guvenek, D.H. Ayhan, E. Toprak, M.T. Bollenbach, (2015).","apa":"Chevereau, G., Lukacisinova, M., Batur, T., Guvenek, A., Ayhan, D. H., Toprak, E., &#38; Bollenbach, M. T. (2015). Gene ontology enrichment analysis for the most sensitive gene deletion strains for all drugs. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pbio.1002299.s008\">https://doi.org/10.1371/journal.pbio.1002299.s008</a>","ista":"Chevereau G, Lukacisinova M, Batur T, Guvenek A, Ayhan DH, Toprak E, Bollenbach MT. 2015. Gene ontology enrichment analysis for the most sensitive gene deletion strains for all drugs, Public Library of Science, <a href=\"https://doi.org/10.1371/journal.pbio.1002299.s008\">10.1371/journal.pbio.1002299.s008</a>.","mla":"Chevereau, Guillaume, et al. <i>Gene Ontology Enrichment Analysis for the Most Sensitive Gene Deletion Strains for All Drugs</i>. Public Library of Science, 2015, doi:<a href=\"https://doi.org/10.1371/journal.pbio.1002299.s008\">10.1371/journal.pbio.1002299.s008</a>.","ama":"Chevereau G, Lukacisinova M, Batur T, et al. Gene ontology enrichment analysis for the most sensitive gene deletion strains for all drugs. 2015. doi:<a href=\"https://doi.org/10.1371/journal.pbio.1002299.s008\">10.1371/journal.pbio.1002299.s008</a>","chicago":"Chevereau, Guillaume, Marta Lukacisinova, Tugce Batur, Aysegul Guvenek, Dilay Hazal Ayhan, Erdal Toprak, and Mark Tobias Bollenbach. “Gene Ontology Enrichment Analysis for the Most Sensitive Gene Deletion Strains for All Drugs.” Public Library of Science, 2015. <a href=\"https://doi.org/10.1371/journal.pbio.1002299.s008\">https://doi.org/10.1371/journal.pbio.1002299.s008</a>."},"type":"research_data_reference"},{"month":"05","date_updated":"2023-02-23T10:15:25Z","title":"Description of the agent based simulations","department":[{"_id":"NiBa"}],"author":[{"first_name":"Barbora","id":"42302D54-F248-11E8-B48F-1D18A9856A87","full_name":"Trubenova, Barbora","orcid":"0000-0002-6873-2967","last_name":"Trubenova"},{"last_name":"Novak","full_name":"Novak, Sebastian","id":"461468AE-F248-11E8-B48F-1D18A9856A87","first_name":"Sebastian"},{"first_name":"Reinmar","full_name":"Hager, Reinmar","last_name":"Hager"}],"date_published":"2015-05-18T00:00:00Z","article_processing_charge":"No","year":"2015","oa_version":"Published Version","doi":"10.1371/journal.pone.0126907.s003","date_created":"2021-08-05T12:55:20Z","day":"18","publisher":"Public Library of Science","_id":"9772","status":"public","related_material":{"record":[{"relation":"used_in_publication","status":"public","id":"1809"}]},"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","citation":{"mla":"Trubenova, Barbora, et al. <i>Description of the Agent Based Simulations</i>. Public Library of Science, 2015, doi:<a href=\"https://doi.org/10.1371/journal.pone.0126907.s003\">10.1371/journal.pone.0126907.s003</a>.","ista":"Trubenova B, Novak S, Hager R. 2015. Description of the agent based simulations, Public Library of Science, <a href=\"https://doi.org/10.1371/journal.pone.0126907.s003\">10.1371/journal.pone.0126907.s003</a>.","ama":"Trubenova B, Novak S, Hager R. Description of the agent based simulations. 2015. doi:<a href=\"https://doi.org/10.1371/journal.pone.0126907.s003\">10.1371/journal.pone.0126907.s003</a>","chicago":"Trubenova, Barbora, Sebastian Novak, and Reinmar Hager. “Description of the Agent Based Simulations.” Public Library of Science, 2015. <a href=\"https://doi.org/10.1371/journal.pone.0126907.s003\">https://doi.org/10.1371/journal.pone.0126907.s003</a>.","ieee":"B. Trubenova, S. Novak, and R. Hager, “Description of the agent based simulations.” Public Library of Science, 2015.","apa":"Trubenova, B., Novak, S., &#38; Hager, R. (2015). Description of the agent based simulations. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pone.0126907.s003\">https://doi.org/10.1371/journal.pone.0126907.s003</a>","short":"B. Trubenova, S. Novak, R. Hager, (2015)."},"type":"research_data_reference"},{"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","status":"public","related_material":{"record":[{"status":"public","relation":"used_in_publication","id":"1827"}]},"citation":{"ieee":"T. Friedlander, A. E. Mayo, T. Tlusty, and U. Alon, “Evolutionary simulation code.” Public Library of Science, 2015.","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>","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>.","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>.","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>"},"type":"research_data_reference","year":"2015","article_processing_charge":"No","author":[{"full_name":"Friedlander, Tamar","last_name":"Friedlander","id":"36A5845C-F248-11E8-B48F-1D18A9856A87","first_name":"Tamar"},{"first_name":"Avraham E.","full_name":"Mayo, Avraham E.","last_name":"Mayo"},{"first_name":"Tsvi","full_name":"Tlusty, Tsvi","last_name":"Tlusty"},{"last_name":"Alon","full_name":"Alon, Uri","first_name":"Uri"}],"date_published":"2015-03-23T00:00:00Z","month":"03","department":[{"_id":"GaTk"}],"title":"Evolutionary simulation code","date_updated":"2023-02-23T10:16:13Z","day":"23","date_created":"2021-08-05T12:58:07Z","publisher":"Public Library of Science","_id":"9773","oa_version":"Published Version","doi":"10.1371/journal.pcbi.1004055.s002"},{"issue":"2","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":"       215","oa":1,"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","main_file_link":[{"url":"http://arxiv.org/abs/1402.1153","open_access":"1"}],"publist_id":"4951","citation":{"short":"P. Nam, R. Seiringer, Archive for Rational Mechanics and Analysis 215 (2015) 381–417.","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>","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.","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>.","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>","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."},"type":"journal_article","scopus_import":1,"date_published":"2015-02-01T00:00:00Z","author":[{"last_name":"Nam","full_name":"Nam, Phan","first_name":"Phan","id":"404092F4-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Seiringer","orcid":"0000-0002-6781-0521","full_name":"Seiringer, Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","first_name":"Robert"}],"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","oa_version":"Preprint","page":"381 - 417","publication":"Archive for Rational Mechanics and Analysis","doi":"10.1007/s00205-014-0781-6"},{"day":"01","date_created":"2018-12-11T11:56:05Z","publisher":"Springer","_id":"2166","oa_version":"Preprint","page":"1365 - 1416","publication":"Communications in Mathematical Physics","doi":"10.1007/s00220-014-2119-5","year":"2015","author":[{"last_name":"Erdös","full_name":"Erdös, László","orcid":"0000-0001-5366-9603","first_name":"László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Antti","full_name":"Knowles, Antti","last_name":"Knowles"}],"date_published":"2015-02-01T00:00:00Z","month":"02","department":[{"_id":"LaEr"}],"date_updated":"2021-01-12T06:55:43Z","title":"The Altshuler-Shklovskii formulas for random band matrices I: the unimodular case","citation":{"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>","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.","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>.","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.","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>."},"type":"journal_article","scopus_import":1,"intvolume":"       333","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","issue":"3","quality_controlled":"1","status":"public","language":[{"iso":"eng"}],"main_file_link":[{"url":"http://arxiv.org/abs/1309.5106","open_access":"1"}],"publist_id":"4818","abstract":[{"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). ","lang":"eng"}],"publication_status":"published","volume":333},{"citation":{"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>","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>"},"type":"journal_article","quality_controlled":"1","publist_id":"4673","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"}],"publication_status":"published","status":"public","language":[{"iso":"eng"}],"publisher":"SIAM","day":"01","doi":"10.1137/130945648","oa_version":"Preprint","arxiv":1,"year":"2015","author":[{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir","last_name":"Kolmogorov","full_name":"Kolmogorov, Vladimir"},{"last_name":"Thapper","full_name":"Thapper, Johan","first_name":"Johan"},{"full_name":"Živný, Stanislav","last_name":"Živný","first_name":"Stanislav"}],"department":[{"_id":"VlKo"}],"scopus_import":1,"oa":1,"intvolume":"        44","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","issue":"1","main_file_link":[{"url":"http://arxiv.org/abs/1311.4219","open_access":"1"}],"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"2518"}]},"volume":44,"_id":"2271","external_id":{"arxiv":["1311.4219"]},"date_created":"2018-12-11T11:56:41Z","publication":"SIAM Journal on Computing","page":"1 - 36","date_published":"2015-02-01T00:00:00Z","title":"The power of linear programming for general-valued CSPs","date_updated":"2023-02-23T10:46:30Z","month":"02"},{"page":"65 - 115","publication":"Journal de l'Ecole Polytechnique - Mathematiques","pubrep_id":"951","file_date_updated":"2020-07-14T12:46:35Z","date_created":"2018-12-11T11:46:40Z","project":[{"name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734"}],"_id":"473","month":"01","title":"Derivation of nonlinear gibbs measures from many-body quantum mechanics","date_updated":"2021-01-12T08:00:52Z","ec_funded":1,"date_published":"2015-01-01T00:00:00Z","license":"https://creativecommons.org/licenses/by-nd/4.0/","scopus_import":1,"volume":2,"intvolume":"         2","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","doi":"10.5802/jep.18","day":"01","publisher":"Ecole Polytechnique","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"}],"year":"2015","author":[{"first_name":"Mathieu","last_name":"Lewin","full_name":"Lewin, Mathieu"},{"full_name":"Phan Thanh, Nam","last_name":"Phan Thanh","first_name":"Nam","id":"404092F4-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Rougerie, Nicolas","last_name":"Rougerie","first_name":"Nicolas"}],"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.","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>","short":"M. Lewin, P. Nam, N. Rougerie, Journal de l’Ecole Polytechnique - Mathematiques 2 (2015) 65–115.","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":[{"content_type":"application/pdf","date_updated":"2020-07-14T12:46:35Z","file_size":1084254,"checksum":"a40eb4016717ddc9927154798a4c164a","relation":"main_file","access_level":"open_access","file_name":"IST-2018-951-v1+1_2015_Thanh-Nam_Derivation_of.pdf","file_id":"4974","creator":"system","date_created":"2018-12-12T10:12:53Z"}],"ddc":["539"],"has_accepted_license":"1","status":"public","language":[{"iso":"eng"}],"publist_id":"7344","abstract":[{"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.","lang":"eng"}],"publication_status":"published","quality_controlled":"1"},{"publication":"Journal of Cell Science","doi":"10.1242/jcs.167999","oa_version":"None","page":"2866 - 2880","publisher":"Company of Biologists","_id":"477","day":"15","date_created":"2018-12-11T11:46:41Z","department":[{"_id":"MiSi"}],"title":"The serotonin receptor 5-HT7R regulates the morphology and migratory properties of dendritic cells","date_updated":"2021-01-12T08:00:54Z","month":"06","year":"2015","date_published":"2015-06-15T00:00:00Z","author":[{"first_name":"Katrin","last_name":"Holst","full_name":"Holst, Katrin"},{"first_name":"Daria","full_name":"Guseva, Daria","last_name":"Guseva"},{"first_name":"Susann","last_name":"Schindler","full_name":"Schindler, Susann"},{"id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","first_name":"Michael K","last_name":"Sixt","orcid":"0000-0002-6620-9179","full_name":"Sixt, Michael K"},{"first_name":"Armin","full_name":"Braun, Armin","last_name":"Braun"},{"first_name":"Himpriya","full_name":"Chopra, Himpriya","last_name":"Chopra"},{"full_name":"Pabst, Oliver","last_name":"Pabst","first_name":"Oliver"},{"last_name":"Ponimaskin","full_name":"Ponimaskin, Evgeni","first_name":"Evgeni"}],"citation":{"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.","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>","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.","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>","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>.","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."},"type":"journal_article","scopus_import":1,"publist_id":"7343","volume":128,"publication_status":"published","abstract":[{"lang":"eng","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."}],"status":"public","language":[{"iso":"eng"}],"quality_controlled":"1","intvolume":"       128","issue":"15","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"last_name":"Doyen","full_name":"Doyen, Laurent","first_name":"Laurent"},{"full_name":"Randour, Mickael","last_name":"Randour","first_name":"Mickael"},{"last_name":"Raskin","full_name":"Raskin, Jean","first_name":"Jean"}],"year":"2015","department":[{"_id":"KrCh"}],"publisher":"Elsevier","day":"24","doi":"10.1016/j.ic.2015.03.010","oa_version":"Preprint","quality_controlled":"1","abstract":[{"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.","lang":"eng"}],"publication_status":"published","publist_id":"7296","language":[{"iso":"eng"}],"status":"public","citation":{"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>.","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>","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.","short":"K. Chatterjee, L. Doyen, M. Randour, J. Raskin, Information and Computation 242 (2015) 25–52.","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>","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."},"type":"journal_article","date_published":"2015-03-24T00:00:00Z","ec_funded":1,"date_updated":"2023-02-23T10:36:02Z","title":"Looking at mean-payoff and total-payoff through windows","month":"03","_id":"523","project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","call_identifier":"FWF","name":"Game Theory"},{"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"}],"date_created":"2018-12-11T11:46:57Z","publication":"Information and Computation","page":"25 - 52","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","issue":"6","oa":1,"intvolume":"       242","volume":242,"main_file_link":[{"url":"https://arxiv.org/abs/1302.4248","open_access":"1"}],"related_material":{"record":[{"id":"2279","relation":"earlier_version","status":"public"}]},"scopus_import":1},{"publication":"Information and Computation","page":"2 - 24","_id":"524","external_id":{"arxiv":["1409.5306"]},"date_created":"2018-12-11T11:46:57Z","date_updated":"2023-02-23T12:24:45Z","title":"Qualitative analysis of concurrent mean payoff games","month":"10","date_published":"2015-10-11T00:00:00Z","scopus_import":1,"related_material":{"record":[{"id":"5403","status":"public","relation":"earlier_version"}]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1409.5306"}],"volume":242,"intvolume":"       242","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","issue":"6","doi":"10.1016/j.ic.2015.03.009","oa_version":"Preprint","arxiv":1,"publisher":"Elsevier","day":"11","department":[{"_id":"KrCh"}],"year":"2015","author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus","last_name":"Ibsen-Jensen","id":"3B699956-F248-11E8-B48F-1D18A9856A87","first_name":"Rasmus"}],"citation":{"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.","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>","short":"K. Chatterjee, R. Ibsen-Jensen, Information and Computation 242 (2015) 2–24.","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>.","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>."},"type":"journal_article","publist_id":"7295","publication_status":"published","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."}],"status":"public","language":[{"iso":"eng"}],"quality_controlled":"1"},{"year":"2015","date_published":"2015-10-22T00:00:00Z","author":[{"last_name":"Li","full_name":"Li, Wenyang","first_name":"Wenyang"},{"first_name":"Mengdi","full_name":"Ma, Mengdi","last_name":"Ma"},{"first_name":"Ying","last_name":"Feng","full_name":"Feng, Ying"},{"id":"33CA54A6-F248-11E8-B48F-1D18A9856A87","first_name":"Hongjiang","orcid":"0000-0001-5039-9660","full_name":"Li, Hongjiang","last_name":"Li"},{"last_name":"Wang","full_name":"Wang, Yichuan","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","last_name":"An","full_name":"An, Fengying"},{"last_name":"Guo","full_name":"Guo, Hongwei","first_name":"Hongwei"}],"department":[{"_id":"JiFr"}],"title":"EIN2-directed translational regulation of ethylene signaling in arabidopsis","date_updated":"2021-01-12T08:01:27Z","month":"10","_id":"532","publisher":"Cell Press","day":"22","date_created":"2018-12-11T11:47:00Z","publication":"Cell","doi":"10.1016/j.cell.2015.09.037","oa_version":"None","page":"670 - 683","quality_controlled":"1","intvolume":"       163","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","issue":"3","publist_id":"7285","volume":163,"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"}],"publication_status":"published","status":"public","language":[{"iso":"eng"}],"citation":{"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.","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>","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>.","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.","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>.","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>"},"type":"journal_article","scopus_import":1},{"publication_status":"draft","status":"public","has_accepted_license":"1","language":[{"iso":"eng"}],"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"content_type":"application/pdf","date_updated":"2020-07-14T12:47:48Z","file_size":511233,"checksum":"2b94e5e1f4c3fe8ab89b12806276fb09","relation":"main_file","access_level":"open_access","file_name":"2014_Playful_Math_Huszar.pdf","file_id":"7039","date_created":"2019-11-18T15:57:51Z","creator":"dernst"}],"type":"working_paper","citation":{"ieee":"K. Huszár and M. Rolinek, <i>Playful Math - An introduction to mathematical games</i>. IST Austria.","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.","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.","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"},"ddc":["510"],"department":[{"_id":"VlKo"},{"_id":"UlWa"}],"date_updated":"2020-07-14T23:11:45Z","title":"Playful Math - An introduction to mathematical games","month":"06","year":"2014","article_processing_charge":"No","author":[{"full_name":"Huszár, Kristóf","orcid":"0000-0002-5445-5057","last_name":"Huszár","first_name":"Kristóf","id":"33C26278-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Rolinek","full_name":"Rolinek, Michal","first_name":"Michal","id":"3CB3BC06-F248-11E8-B48F-1D18A9856A87"}],"date_published":"2014-06-30T00:00:00Z","file_date_updated":"2020-07-14T12:47:48Z","page":"5","oa_version":"Published Version","_id":"7038","publisher":"IST Austria","day":"30","date_created":"2019-11-18T15:57:05Z"},{"month":"08","department":[{"_id":"RoSe"}],"publication_identifier":{"isbn":["9788961058063"]},"date_updated":"2023-10-17T11:12:33Z","title":"Structure of the excitation spectrum for many-body quantum systems","conference":{"end_date":"2014-08-21","start_date":"2014-08-13","location":"Seoul, South Korea","name":"ICM: International Congress of Mathematicans"},"article_processing_charge":"No","year":"2014","date_published":"2014-08-01T00:00:00Z","author":[{"first_name":"Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","last_name":"Seiringer","orcid":"0000-0002-6781-0521","full_name":"Seiringer, Robert"}],"oa_version":"Published Version","page":"1175-1194","publication":"Proceeding of the International Congress of Mathematicans","day":"01","date_created":"2020-06-29T07:59:35Z","publisher":"International Congress of Mathematicians","_id":"8044","status":"public","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"http://www.icm2014.org/en/vod/proceedings.html"}],"publication_status":"published","abstract":[{"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.","lang":"eng"}],"volume":3,"intvolume":"         3","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","scopus_import":"1","citation":{"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.","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.","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.","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.","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.","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."},"type":"conference"},{"ec_funded":1,"article_processing_charge":"No","date_published":"2014-08-01T00:00:00Z","month":"08","date_updated":"2023-10-17T11:12:55Z","title":"Random matrices, log-gases and Hölder regularity","date_created":"2018-12-11T11:52:25Z","project":[{"call_identifier":"FP7","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","grant_number":"338804","name":"Random matrices, universality and disordered quantum systems"}],"_id":"1507","page":"214 - 236","publication":"Proceedings of the International Congress of Mathematicians","oa":1,"intvolume":"         3","acknowledgement":"The author is partially supported by SFB-TR 12 Grant of the German Research Council.","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1407.5752"}],"volume":3,"scopus_import":"1","conference":{"location":"Seoul, Korea","start_date":"2014-08-13","end_date":"2014-08-21","name":"ICM: International Congress of Mathematicians"},"year":"2014","author":[{"full_name":"Erdös, László","orcid":"0000-0001-5366-9603","last_name":"Erdös","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","first_name":"László"}],"department":[{"_id":"LaEr"}],"day":"01","publisher":"International Congress of Mathematicians","oa_version":"Submitted Version","quality_controlled":"1","status":"public","language":[{"iso":"eng"}],"publist_id":"5670","abstract":[{"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.","lang":"eng"}],"publication_status":"published","type":"conference","citation":{"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.","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.","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.","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.","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."}},{"publication_status":"published","abstract":[{"lang":"eng","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"}],"publist_id":"5661","main_file_link":[{"url":"https://arxiv.org/abs/1403.2563","open_access":"1"}],"language":[{"iso":"eng"}],"status":"public","quality_controlled":"1","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa":1,"type":"conference","citation":{"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>","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.","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>","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>.","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.","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>."},"date_updated":"2021-01-12T06:51:19Z","title":"On the BCS gap equation for superfluid fermionic gases","department":[{"_id":"RoSe"}],"month":"01","date_published":"2014-01-01T00:00:00Z","author":[{"first_name":"Gerhard","last_name":"Bräunlich","full_name":"Bräunlich, Gerhard"},{"first_name":"Christian","last_name":"Hainzl","full_name":"Hainzl, Christian"},{"first_name":"Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","last_name":"Seiringer","orcid":"0000-0002-6781-0521","full_name":"Seiringer, Robert"}],"conference":{"end_date":"2013-09-13","start_date":"2013-09-10","location":"Berlin, Germany","name":"QMath: Mathematical Results in Quantum Physics"},"year":"2014","article_processing_charge":"No","publication":"Proceedings of the QMath12 Conference","doi":"10.1142/9789814618144_0007","oa_version":"Preprint","page":"127 - 137","arxiv":1,"publisher":"World Scientific Publishing","_id":"1516","date_created":"2018-12-11T11:52:28Z","external_id":{"arxiv":["1403.2563"]},"day":"01"},{"volume":33,"article_number":"15","issue":"2","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","oa":1,"intvolume":"        33","title":"Edit propagation using geometric relationship functions","date_updated":"2021-01-12T06:52:06Z","month":"03","date_published":"2014-03-01T00:00:00Z","pubrep_id":"577","file_date_updated":"2020-07-14T12:45:07Z","publication":"ACM Transactions on Graphics","_id":"1629","date_created":"2018-12-11T11:53:08Z","abstract":[{"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.","lang":"eng"}],"publication_status":"published","publist_id":"5526","language":[{"iso":"eng"}],"has_accepted_license":"1","status":"public","quality_controlled":"1","file":[{"file_id":"4876","date_created":"2018-12-12T10:11:22Z","creator":"system","file_size":9832561,"date_updated":"2020-07-14T12:45:07Z","content_type":"application/pdf","relation":"main_file","checksum":"7f91e588a4e888610313b98271e6418e","access_level":"open_access","file_name":"IST-2016-577-v1+1_2014.TOG.Paul.EditingPropagation.final.pdf"}],"citation":{"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>.","ista":"Guerrero P, Jeschke S, Wimmer M, Wonka P. 2014. Edit propagation using geometric relationship functions. ACM Transactions on Graphics. 33(2), 15.","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>","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)."},"type":"journal_article","ddc":["000"],"department":[{"_id":"ChWo"}],"author":[{"full_name":"Guerrero, Paul","last_name":"Guerrero","first_name":"Paul"},{"last_name":"Jeschke","full_name":"Jeschke, Stefan","first_name":"Stefan","id":"44D6411A-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Michael","full_name":"Wimmer, Michael","last_name":"Wimmer"},{"last_name":"Wonka","full_name":"Wonka, Peter","first_name":"Peter"}],"year":"2014","doi":"10.1145/2591010","oa_version":"Submitted Version","publisher":"ACM","day":"01"},{"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"}],"status":"public","language":[{"iso":"eng"}],"citation":{"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>.","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>.","ista":"Fuchsbauer G. 2014. Constrained Verifiable Random Functions . SCN 2014. SCN: Security and Cryptography for Networks, LNCS, vol. 8642, 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>","ieee":"G. Fuchsbauer, “Constrained Verifiable Random Functions ,” in <i>SCN 2014</i>, Amalfi, Italy, 2014, vol. 8642, pp. 95–114."},"type":"conference","department":[{"_id":"KrPi"}],"conference":{"location":"Amalfi, Italy","start_date":"2014-09-03","end_date":"2014-09-05","name":"SCN: Security and Cryptography for Networks"},"year":"2014","author":[{"last_name":"Fuchsbauer","full_name":"Fuchsbauer, Georg","id":"46B4C3EE-F248-11E8-B48F-1D18A9856A87","first_name":"Georg"}],"editor":[{"first_name":"Michel","last_name":"Abdalla","full_name":"Abdalla, Michel"},{"last_name":"De Prisco","full_name":"De Prisco, Roberto","first_name":"Roberto"}],"doi":"10.1007/978-3-319-10879-7_7","oa_version":"Submitted Version","publisher":"Springer","day":"01","main_file_link":[{"open_access":"1","url":"http://eprint.iacr.org/2014/537"}],"alternative_title":["LNCS"],"volume":8642,"oa":1,"intvolume":"      8642","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","scopus_import":1,"date_updated":"2021-01-12T06:52:12Z","title":"Constrained Verifiable Random Functions ","month":"01","date_published":"2014-01-01T00:00:00Z","ec_funded":1,"publication":"SCN 2014","page":"95 - 114","_id":"1643","project":[{"grant_number":"259668","_id":"258C570E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Provable Security for Physical Cryptography"}],"date_created":"2018-12-11T11:53:13Z"},{"date_published":"2014-12-02T00:00:00Z","author":[{"id":"335E5684-F248-11E8-B48F-1D18A9856A87","first_name":"Ashutosh","full_name":"Gupta, Ashutosh","last_name":"Gupta"},{"last_name":"Popeea","full_name":"Popeea, Corneliu","first_name":"Corneliu"},{"first_name":"Andrey","last_name":"Rybalchenko","full_name":"Rybalchenko, Andrey"}],"year":"2014","conference":{"start_date":"2014-07-17","location":"Vienna, Austria","end_date":"2014-07-17","name":"HCVS: Horn Clauses for Verification and Synthesis"},"title":"Generalised interpolation by solving recursion free-horn clauses","date_updated":"2021-01-12T06:52:38Z","department":[{"_id":"ToHe"}],"month":"12","publisher":"Open Publishing","_id":"1702","date_created":"2018-12-11T11:53:33Z","day":"02","publication":"Electronic Proceedings in Theoretical Computer Science, EPTCS","doi":"10.4204/EPTCS.169.5","oa_version":"Submitted Version","page":"31 - 38","quality_controlled":"1","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","intvolume":"       169","oa":1,"abstract":[{"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.","lang":"eng"}],"alternative_title":["EPTCS"],"publication_status":"published","volume":169,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1303.7378v2"}],"publist_id":"5435","language":[{"iso":"eng"}],"status":"public","type":"conference","citation":{"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>","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>.","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.","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>.","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."}},{"quality_controlled":"1","intvolume":"         3","issue":"January","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","publist_id":"5427","main_file_link":[{"url":"http://papers.nips.cc/paper/5343-spatio-temporal-representations-of-uncertainty-in-spiking-neural-networks.pdf"}],"abstract":[{"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.","lang":"eng"}],"publication_status":"published","volume":3,"status":"public","language":[{"iso":"eng"}],"citation":{"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.","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.","short":"C. Savin, S. Denève, in:, Neural Information Processing Systems, 2014, pp. 2024–2032.","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.","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."},"scopus_import":1,"type":"conference","conference":{"name":"NIPS: Neural Information Processing Systems","end_date":"2014-12-13","start_date":"2014-12-08","location":"Montreal, Canada"},"year":"2014","date_published":"2014-01-01T00:00:00Z","author":[{"first_name":"Cristina","id":"3933349E-F248-11E8-B48F-1D18A9856A87","full_name":"Savin, Cristina","last_name":"Savin"},{"last_name":"Denève","full_name":"Denève, Sophie","first_name":"Sophie"}],"department":[{"_id":"GaTk"}],"title":"Spatio-temporal representations of uncertainty in spiking neural networks","date_updated":"2021-01-12T06:52:40Z","month":"01","publisher":"Neural Information Processing Systems","_id":"1708","day":"01","date_created":"2018-12-11T11:53:35Z","page":"2024 - 2032","oa_version":"None"}]