[{"publisher":"IEEE","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"id":"3F54FA38-F248-11E8-B48F-1D18A9856A87","first_name":"Mathieu","last_name":"Tracol","full_name":"Tracol, Mathieu"}],"title":"Decidable problems for probabilistic automata on infinite words","department":[{"_id":"KrCh"}],"publist_id":"3769","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"We consider probabilistic automata on infinite words with acceptance defined by parity conditions. We consider three qualitative decision problems: (i) the positive decision problem asks whether there is a word that is accepted with positive probability; (ii) the almost decision problem asks whether there is a word that is accepted with probability 1; and (iii) the limit decision problem asks whether words are accepted with probability arbitrarily close to 1. We unify and generalize several decidability results for probabilistic automata over infinite words, and identify a robust (closed under union and intersection) subclass of probabilistic automata for which all the qualitative decision problems are decidable for parity conditions. We also show that if the input words are restricted to lasso shape (regular) words, then the positive and almost problems are decidable for all probabilistic automata with parity conditions. For most decidable problems we show an optimal PSPACE-complete complexity bound."}],"scopus_import":1,"arxiv":1,"type":"conference","citation":{"mla":"Chatterjee, Krishnendu, and Mathieu Tracol. “Decidable Problems for Probabilistic Automata on Infinite Words.” <i>Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science</i>, 6280437, IEEE, 2012, doi:<a href=\"https://doi.org/10.1109/LICS.2012.29\">10.1109/LICS.2012.29</a>.","apa":"Chatterjee, K., &#38; Tracol, M. (2012). Decidable problems for probabilistic automata on infinite words. In <i>Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science</i>. Dubrovnik, Croatia : IEEE. <a href=\"https://doi.org/10.1109/LICS.2012.29\">https://doi.org/10.1109/LICS.2012.29</a>","chicago":"Chatterjee, Krishnendu, and Mathieu Tracol. “Decidable Problems for Probabilistic Automata on Infinite Words.” In <i>Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science</i>. IEEE, 2012. <a href=\"https://doi.org/10.1109/LICS.2012.29\">https://doi.org/10.1109/LICS.2012.29</a>.","ama":"Chatterjee K, Tracol M. Decidable problems for probabilistic automata on infinite words. In: <i>Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science</i>. IEEE; 2012. doi:<a href=\"https://doi.org/10.1109/LICS.2012.29\">10.1109/LICS.2012.29</a>","short":"K. Chatterjee, M. Tracol, in:, Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2012.","ieee":"K. Chatterjee and M. Tracol, “Decidable problems for probabilistic automata on infinite words,” in <i>Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science</i>, Dubrovnik, Croatia , 2012.","ista":"Chatterjee K, Tracol M. 2012. Decidable problems for probabilistic automata on infinite words. Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 6280437."},"quality_controlled":"1","_id":"2957","publication_status":"published","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","call_identifier":"FWF"},{"name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23"},{"name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","call_identifier":"FP7"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"article_number":"6280437","date_published":"2012-08-23T00:00:00Z","month":"08","oa":1,"date_updated":"2023-02-23T12:23:51Z","conference":{"location":"Dubrovnik, Croatia ","end_date":"2012-06-28","start_date":"2012-06-25","name":"LICS: Logic in Computer Science"},"external_id":{"arxiv":["1107.2091"]},"year":"2012","status":"public","day":"23","date_created":"2018-12-11T12:00:33Z","publication":"Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science","doi":"10.1109/LICS.2012.29","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1107.2091"}],"ec_funded":1,"oa_version":"Preprint","related_material":{"record":[{"id":"5384","status":"public","relation":"earlier_version"}]}},{"oa":1,"issue":"42","date_updated":"2021-01-12T07:40:03Z","acknowledgement":"J.C. was supported by a MRC Intramural Programme Grant (U138197111) and a European Research Council Starter Grant (281511). K.A. held a Wellcome Trust PhD studentship and a Humboldt Research Fellowship for Postdoctoral Researchers. D.M.B. was supported by Wellcome Trust Senior Fellowships (074385 and 087736).","date_published":"2012-10-17T00:00:00Z","intvolume":"        32","month":"10","year":"2012","page":"14752 - 14766","external_id":{"pmid":["23077060"]},"day":"17","status":"public","date_created":"2018-12-11T12:00:33Z","volume":32,"pmid":1,"oa_version":"Submitted Version","ec_funded":1,"publication":"Journal of Neuroscience","main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3531717/","open_access":"1"}],"doi":"10.1523/JNEUROSCI.6175-11.2012","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Allen, Kevin","last_name":"Allen","first_name":"Kevin"},{"first_name":"J Nick","last_name":"Rawlins","full_name":"Rawlins, J Nick"},{"first_name":"David","last_name":"Bannerman","full_name":"Bannerman, David"},{"first_name":"Jozsef L","id":"3FA14672-F248-11E8-B48F-1D18A9856A87","last_name":"Csicsvari","orcid":"0000-0002-5193-4036","full_name":"Csicsvari, Jozsef L"}],"title":"Hippocampal place cells can encode multiple trial-dependent features through rate remapping","publisher":"Society for Neuroscience","language":[{"iso":"eng"}],"publist_id":"3768","department":[{"_id":"JoCs"}],"quality_controlled":"1","_id":"2958","abstract":[{"text":"The activity of hippocampal pyramidal cells reflects both the current position of the animal and information related to its current behavior. Here we investigated whether single hippocampal neurons can encode several independent features defining trials during a memory task. We also tested whether task-related information is represented by partial remapping of the place cell population or, instead, via firing rate modulation of spatially stable place cells. To address these two questions, the activity of hippocampal neurons was recorded in rats performing a conditional discrimination task on a modified T-maze in which the identity of a food reward guided behavior. When the rat was on the central arm of the maze, the firing rate of pyramidal cells changed depending on two independent factors: (1) the identity of the food reward given to the animal and (2) the previous location of the animal on the maze. Importantly, some pyramidal cells encoded information relative to both factors. This trial-type specific and retrospective coding did not interfere with the spatial representation of the maze: hippocampal cells had stable place fields and their theta-phase precession profiles were unaltered during the task, indicating that trial-related information was encoded via rate remapping. During error trials, encoding of both trial-related information and spatial location was impaired. Finally, we found that pyramidal cells also encode trial-related information via rate remapping during the continuous version of the rewarded alternation task without delays. These results suggest that hippocampal neurons can encode several task-related cognitive aspects via rate remapping.","lang":"eng"}],"scopus_import":1,"type":"journal_article","citation":{"apa":"Allen, K., Rawlins, J. N., Bannerman, D., &#38; Csicsvari, J. L. (2012). Hippocampal place cells can encode multiple trial-dependent features through rate remapping. <i>Journal of Neuroscience</i>. Society for Neuroscience. <a href=\"https://doi.org/10.1523/JNEUROSCI.6175-11.2012\">https://doi.org/10.1523/JNEUROSCI.6175-11.2012</a>","mla":"Allen, Kevin, et al. “Hippocampal Place Cells Can Encode Multiple Trial-Dependent Features through Rate Remapping.” <i>Journal of Neuroscience</i>, vol. 32, no. 42, Society for Neuroscience, 2012, pp. 14752–66, doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.6175-11.2012\">10.1523/JNEUROSCI.6175-11.2012</a>.","ama":"Allen K, Rawlins JN, Bannerman D, Csicsvari JL. Hippocampal place cells can encode multiple trial-dependent features through rate remapping. <i>Journal of Neuroscience</i>. 2012;32(42):14752-14766. doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.6175-11.2012\">10.1523/JNEUROSCI.6175-11.2012</a>","ista":"Allen K, Rawlins JN, Bannerman D, Csicsvari JL. 2012. Hippocampal place cells can encode multiple trial-dependent features through rate remapping. Journal of Neuroscience. 32(42), 14752–14766.","short":"K. Allen, J.N. Rawlins, D. Bannerman, J.L. Csicsvari, Journal of Neuroscience 32 (2012) 14752–14766.","ieee":"K. Allen, J. N. Rawlins, D. Bannerman, and J. L. Csicsvari, “Hippocampal place cells can encode multiple trial-dependent features through rate remapping,” <i>Journal of Neuroscience</i>, vol. 32, no. 42. Society for Neuroscience, pp. 14752–14766, 2012.","chicago":"Allen, Kevin, J Nick Rawlins, David Bannerman, and Jozsef L Csicsvari. “Hippocampal Place Cells Can Encode Multiple Trial-Dependent Features through Rate Remapping.” <i>Journal of Neuroscience</i>. Society for Neuroscience, 2012. <a href=\"https://doi.org/10.1523/JNEUROSCI.6175-11.2012\">https://doi.org/10.1523/JNEUROSCI.6175-11.2012</a>."},"publication_status":"published","project":[{"name":"Memory-related information processing in neuronal circuits of the hippocampus and entorhinal cortex","_id":"257A4776-B435-11E9-9278-68D0E5697425","grant_number":"281511","call_identifier":"FP7"}]},{"acknowledgement":"I wish to thank Bernd Sturmfels for many helpful discus- sions and Steffen Lauritzen for introducing me to the problem of the existence of the MLE in Gaussian graphical models. I would also like to thank two referees who provided helpful comments on the original version of this paper.\r\n","date_published":"2012-02-01T00:00:00Z","intvolume":"        40","month":"02","oa":1,"issue":"1","date_updated":"2021-01-12T07:40:04Z","page":"238 - 261","year":"2012","volume":40,"day":"01","status":"public","date_created":"2018-12-11T12:00:33Z","publication":"Annals of Statistics","doi":"10.1214/11-AOS957","main_file_link":[{"url":"http://arxiv.org/abs/1012.2643","open_access":"1"}],"oa_version":"Preprint","publisher":"Institute of Mathematical Statistics","title":"Geometry of maximum likelihood estimation in Gaussian graphical models","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Uhler, Caroline","last_name":"Uhler","orcid":"0000-0002-7008-0216","first_name":"Caroline","id":"49ADD78E-F248-11E8-B48F-1D18A9856A87"}],"department":[{"_id":"CaUh"}],"publist_id":"3767","language":[{"iso":"eng"}],"scopus_import":1,"abstract":[{"lang":"eng","text":"We study maximum likelihood estimation in Gaussian graphical models from a geometric point of view. An algebraic elimination criterion allows us to find exact lower bounds on the number of observations needed to ensure that the maximum likelihood estimator (MLE) exists with probability one. This is applied to bipartite graphs, grids and colored graphs. We also study the ML degree, and we present the first instance of a graph for which the MLE exists with probability one, even when the number of observations equals the treewidth."}],"type":"journal_article","citation":{"apa":"Uhler, C. (2012). Geometry of maximum likelihood estimation in Gaussian graphical models. <i>Annals of Statistics</i>. Institute of Mathematical Statistics. <a href=\"https://doi.org/10.1214/11-AOS957\">https://doi.org/10.1214/11-AOS957</a>","mla":"Uhler, Caroline. “Geometry of Maximum Likelihood Estimation in Gaussian Graphical Models.” <i>Annals of Statistics</i>, vol. 40, no. 1, Institute of Mathematical Statistics, 2012, pp. 238–61, doi:<a href=\"https://doi.org/10.1214/11-AOS957\">10.1214/11-AOS957</a>.","ama":"Uhler C. Geometry of maximum likelihood estimation in Gaussian graphical models. <i>Annals of Statistics</i>. 2012;40(1):238-261. doi:<a href=\"https://doi.org/10.1214/11-AOS957\">10.1214/11-AOS957</a>","ista":"Uhler C. 2012. Geometry of maximum likelihood estimation in Gaussian graphical models. Annals of Statistics. 40(1), 238–261.","short":"C. Uhler, Annals of Statistics 40 (2012) 238–261.","ieee":"C. Uhler, “Geometry of maximum likelihood estimation in Gaussian graphical models,” <i>Annals of Statistics</i>, vol. 40, no. 1. Institute of Mathematical Statistics, pp. 238–261, 2012.","chicago":"Uhler, Caroline. “Geometry of Maximum Likelihood Estimation in Gaussian Graphical Models.” <i>Annals of Statistics</i>. Institute of Mathematical Statistics, 2012. <a href=\"https://doi.org/10.1214/11-AOS957\">https://doi.org/10.1214/11-AOS957</a>."},"quality_controlled":"1","_id":"2959","publication_status":"published"},{"external_id":{"pmid":["22960215"]},"page":"1027 - 1047","year":"2012","date_published":"2012-11-01T00:00:00Z","intvolume":"       192","month":"11","date_updated":"2021-01-12T07:40:05Z","oa":1,"acknowledged_ssus":[{"_id":"ScienComp"}],"issue":"3","publication":"Genetics","main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3522150/"}],"doi":"10.1534/genetics.112.143164","oa_version":"Submitted Version","volume":192,"pmid":1,"date_created":"2018-12-11T12:00:34Z","status":"public","day":"01","publist_id":"3763","department":[{"_id":"NiBa"}],"language":[{"iso":"eng"}],"publisher":"Genetics Society of America","title":"A novel approach for choosing summary statistics in approximate Bayesian computation","author":[{"id":"2D35326E-F248-11E8-B48F-1D18A9856A87","first_name":"Simon","last_name":"Aeschbacher","full_name":"Aeschbacher, Simon"},{"full_name":"Beaumont, Mark","first_name":"Mark","last_name":"Beaumont"},{"last_name":"Futschik","first_name":"Andreas","full_name":"Futschik, Andreas"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","citation":{"chicago":"Aeschbacher, Simon, Mark Beaumont, and Andreas Futschik. “A Novel Approach for Choosing Summary Statistics in Approximate Bayesian Computation.” <i>Genetics</i>. Genetics Society of America, 2012. <a href=\"https://doi.org/10.1534/genetics.112.143164\">https://doi.org/10.1534/genetics.112.143164</a>.","short":"S. Aeschbacher, M. Beaumont, A. Futschik, Genetics 192 (2012) 1027–1047.","ieee":"S. Aeschbacher, M. Beaumont, and A. Futschik, “A novel approach for choosing summary statistics in approximate Bayesian computation,” <i>Genetics</i>, vol. 192, no. 3. Genetics Society of America, pp. 1027–1047, 2012.","ista":"Aeschbacher S, Beaumont M, Futschik A. 2012. A novel approach for choosing summary statistics in approximate Bayesian computation. Genetics. 192(3), 1027–1047.","ama":"Aeschbacher S, Beaumont M, Futschik A. A novel approach for choosing summary statistics in approximate Bayesian computation. <i>Genetics</i>. 2012;192(3):1027-1047. doi:<a href=\"https://doi.org/10.1534/genetics.112.143164\">10.1534/genetics.112.143164</a>","mla":"Aeschbacher, Simon, et al. “A Novel Approach for Choosing Summary Statistics in Approximate Bayesian Computation.” <i>Genetics</i>, vol. 192, no. 3, Genetics Society of America, 2012, pp. 1027–47, doi:<a href=\"https://doi.org/10.1534/genetics.112.143164\">10.1534/genetics.112.143164</a>.","apa":"Aeschbacher, S., Beaumont, M., &#38; Futschik, A. (2012). A novel approach for choosing summary statistics in approximate Bayesian computation. <i>Genetics</i>. Genetics Society of America. <a href=\"https://doi.org/10.1534/genetics.112.143164\">https://doi.org/10.1534/genetics.112.143164</a>"},"abstract":[{"text":"The choice of summary statistics is a crucial step in approximate Bayesian computation (ABC). Since statistics are often not sufficient, this choice involves a trade-off between loss of information and reduction of dimensionality. The latter may increase the efficiency of ABC. Here, we propose an approach for choosing summary statistics based on boosting, a technique from the machine learning literature. We consider different types of boosting and compare them to partial least squares regression as an alternative. To mitigate the lack of sufficiency, we also propose an approach for choosing summary statistics locally, in the putative neighborhood of the true parameter value. We study a demographic model motivated by the re-introduction of Alpine ibex (Capra ibex) into the Swiss Alps. The parameters of interest are the mean and standard deviation across microsatellites of the scaled ancestral mutation rate (θanc = 4 Ne u), and the proportion of males obtaining access to matings per breeding season (ω). By simulation, we assess the properties of the posterior distribution obtained with the various methods. According to our criteria, ABC with summary statistics chosen locally via boosting with the L2-loss performs best. Applying that method to the ibex data, we estimate θanc ≈ 1.288, and find that most of the variation across loci of the ancestral mutation rate u is between 7.7×10−4 and 3.5×10−3 per locus per generation. The proportion of males with access to matings is estimated to ω ≈ 0.21, which is in good agreement with recent independent estimates.","lang":"eng"}],"scopus_import":1,"type":"journal_article","_id":"2962","quality_controlled":"1"},{"publication_status":"published","_id":"2965","type":"journal_article","file_date_updated":"2020-07-14T12:45:57Z","abstract":[{"text":"Dieser Artikel soll die sechs verschiedenen Creative Commons Lizenzen erläutern und ihre Bedeutung im Rahmen des wissenschaftlichen Publizierens und des Open Access erklären (CC-BY, CC-BY-SA, CC-BY-NC, CC-BY-ND, CC-BYNC-SA, CC-BY-NC-ND).","lang":"eng"}],"scopus_import":1,"citation":{"mla":"Danowski, Patrick. “Kontext Open Access: Creative Commons.” <i>Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen &#38; Bibliothekare</i>, vol. 65, no. 2, VÖB, 2012, pp. 200–12.","apa":"Danowski, P. (2012). Kontext Open Access: Creative Commons. <i>Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen &#38; Bibliothekare</i>. VÖB.","chicago":"Danowski, Patrick. “Kontext Open Access: Creative Commons.” <i>Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen &#38; Bibliothekare</i>. VÖB, 2012.","ama":"Danowski P. Kontext Open Access: Creative Commons. <i>Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen &#38; Bibliothekare</i>. 2012;65(2):200-212.","ista":"Danowski P. 2012. Kontext Open Access: Creative Commons. Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen &#38; Bibliothekare. 65(2), 200–212.","short":"P. Danowski, Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen &#38; Bibliothekare 65 (2012) 200–212.","ieee":"P. Danowski, “Kontext Open Access: Creative Commons,” <i>Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen &#38; Bibliothekare</i>, vol. 65, no. 2. VÖB, pp. 200–212, 2012."},"pubrep_id":"95","language":[{"iso":"ger"}],"department":[{"_id":"E-Lib"}],"publist_id":"3754","file":[{"content_type":"application/pdf","file_id":"4703","file_size":503345,"creator":"system","checksum":"162eea47d9d840c26b496ba6ae4d1c09","access_level":"open_access","relation":"main_file","file_name":"IST-2012-95-v1+1_sp-beitrag_danowski_kontext_open_access_creative_commons.pdf","date_updated":"2020-07-14T12:45:57Z","date_created":"2018-12-12T10:08:42Z"}],"author":[{"last_name":"Danowski","orcid":"0000-0002-6026-4409","id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","first_name":"Patrick","full_name":"Danowski, Patrick"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","title":"Kontext Open Access: Creative Commons","publisher":"VÖB","has_accepted_license":"1","oa_version":"Published Version","main_file_link":[{"open_access":"1","url":" http://hdl.handle.net/10760/17625"}],"publication":"Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen & Bibliothekare","status":"public","day":"01","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ddc":["020"],"date_created":"2018-12-11T12:00:35Z","volume":65,"year":"2012","page":"200 - 212","issue":"2","oa":1,"date_updated":"2021-01-12T07:40:07Z","popular_science":"1","intvolume":"        65","month":"09","date_published":"2012-09-01T00:00:00Z"},{"year":"2012","date_published":"2012-06-15T00:00:00Z","month":"06","intvolume":"        12","article_number":"7","date_updated":"2021-01-12T07:40:07Z","oa":1,"publication":"BMC Ecology","doi":"10.1186/1472-6785-12-7","oa_version":"Published Version","volume":12,"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ddc":["570"],"date_created":"2018-12-11T12:00:35Z","status":"public","day":"15","department":[{"_id":"SyCr"}],"publist_id":"3753","language":[{"iso":"eng"}],"pubrep_id":"94","has_accepted_license":"1","publisher":"BioMed Central","author":[{"full_name":"Cremer, Sylvia","last_name":"Cremer","orcid":"0000-0002-2193-3868","first_name":"Sylvia","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Suefuji, Masaki","first_name":"Masaki","last_name":"Suefuji"},{"full_name":"Schrempf, Alexandra","first_name":"Alexandra","last_name":"Schrempf"},{"full_name":"Heinze, Jürgen","first_name":"Jürgen","last_name":"Heinze"}],"title":"The dynamics of male-male competition in Cardiocondyla obscurior ants","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"file_name":"IST-2012-94-v1+1_1472-6785-12-7.pdf","date_created":"2018-12-12T10:08:44Z","date_updated":"2020-07-14T12:45:57Z","file_id":"4706","content_type":"application/pdf","file_size":489994,"creator":"system","relation":"main_file","checksum":"03d004bdff3724fb1627e3f5004bad80","access_level":"open_access"}],"publication_status":"published","citation":{"mla":"Cremer, Sylvia, et al. “The Dynamics of Male-Male Competition in Cardiocondyla Obscurior Ants.” <i>BMC Ecology</i>, vol. 12, 7, BioMed Central, 2012, doi:<a href=\"https://doi.org/10.1186/1472-6785-12-7\">10.1186/1472-6785-12-7</a>.","apa":"Cremer, S., Suefuji, M., Schrempf, A., &#38; Heinze, J. (2012). The dynamics of male-male competition in Cardiocondyla obscurior ants. <i>BMC Ecology</i>. BioMed Central. <a href=\"https://doi.org/10.1186/1472-6785-12-7\">https://doi.org/10.1186/1472-6785-12-7</a>","chicago":"Cremer, Sylvia, Masaki Suefuji, Alexandra Schrempf, and Jürgen Heinze. “The Dynamics of Male-Male Competition in Cardiocondyla Obscurior Ants.” <i>BMC Ecology</i>. BioMed Central, 2012. <a href=\"https://doi.org/10.1186/1472-6785-12-7\">https://doi.org/10.1186/1472-6785-12-7</a>.","ama":"Cremer S, Suefuji M, Schrempf A, Heinze J. The dynamics of male-male competition in Cardiocondyla obscurior ants. <i>BMC Ecology</i>. 2012;12. doi:<a href=\"https://doi.org/10.1186/1472-6785-12-7\">10.1186/1472-6785-12-7</a>","short":"S. Cremer, M. Suefuji, A. Schrempf, J. Heinze, BMC Ecology 12 (2012).","ieee":"S. Cremer, M. Suefuji, A. Schrempf, and J. Heinze, “The dynamics of male-male competition in Cardiocondyla obscurior ants,” <i>BMC Ecology</i>, vol. 12. BioMed Central, 2012.","ista":"Cremer S, Suefuji M, Schrempf A, Heinze J. 2012. The dynamics of male-male competition in Cardiocondyla obscurior ants. BMC Ecology. 12, 7."},"scopus_import":1,"abstract":[{"lang":"eng","text":"Background: The outcome of male-male competition can be predicted from the relative fighting qualities of the opponents, which often depend on their age. In insects, freshly emerged and still sexually inactive males are morphologically indistinct from older, sexually active males. These young inactive males may thus be easy targets for older males if they cannot conceal themselves from their attacks. The ant Cardiocondyla obscurior is characterised by lethal fighting between wingless (&quot; ergatoid&quot; ) males. Here, we analyse for how long young males are defenceless after eclosion, and how early adult males can detect the presence of rival males.Results: We found that old ergatoid males consistently won fights against ergatoid males younger than two days. Old males did not differentiate between different types of unpigmented pupae several days before emergence, but had more frequent contact to ready-to-eclose pupae of female sexuals and winged males than of workers and ergatoid males. In rare cases, old ergatoid males displayed alleviated biting of pigmented ergatoid male pupae shortly before adult eclosion, as well as copulation attempts to dark pupae of female sexuals and winged males. Ergatoid male behaviour may be promoted by a closer similarity of the chemical profile of ready-to-eclose pupae to the profile of adults than that of young pupae several days prior to emergence.Conclusion: Young ergatoid males of C. obscurior would benefit greatly by hiding their identity from older, resident males, as they are highly vulnerable during the first two days of their adult lives. In contrast to the winged males of the same species, which are able to prevent ergatoid male attacks by chemical female mimicry, young ergatoids do not seem to be able to produce a protective chemical profile. Conflicts in male-male competition between ergatoid males of different age thus seem to be resolved in favour of the older males. This might represent selection at the colony level rather than the individual level. © 2012 Cremer et al.; licensee BioMed Central Ltd."}],"type":"journal_article","file_date_updated":"2020-07-14T12:45:57Z","_id":"2966","quality_controlled":"1"},{"type":"journal_article","file_date_updated":"2020-07-14T12:45:57Z","abstract":[{"lang":"eng","text":"Little is known about the stability of trophic relationships in complex natural communities over evolutionary timescales. Here, we use sequence data from 18 nuclear loci to reconstruct and compare the intraspecific histories of major Pleistocene refugial populations in the Middle East, the Balkans and Iberia in a guild of four Chalcid parasitoids (Cecidostiba fungosa, Cecidostiba semifascia, Hobbya stenonota and Mesopolobus amaenus) all attacking Cynipid oak galls. We develop a likelihood method to numerically estimate models of divergence between three populations from multilocus data. We investigate the power of this framework on simulated data, and-using triplet alignments of intronic loci-quantify the support for all possible divergence relationships between refugial populations in the four parasitoids. Although an East to West order of population divergence has highest support in all but one species, we cannot rule out alternative population tree topologies. Comparing the estimated times of population splits between species, we find that one species, M. amaenus, has a significantly older history than the rest of the guild and must have arrived in central Europe at least one glacial cycle prior to other guild members. This suggests that although all four species may share a common origin in the East, they expanded westwards into Europe at different times. © 2012 Blackwell Publishing Ltd."}],"scopus_import":1,"citation":{"chicago":"Lohse, Konrad, Nicholas H Barton, George Melika, and Graham Stone. “A Likelihood Based Comparison of Population Histories in a Parasitoid Guild.” <i>Molecular Ecology</i>. Wiley-Blackwell, 2012. <a href=\"https://doi.org/10.1111/j.1365-294X.2012.05700.x\">https://doi.org/10.1111/j.1365-294X.2012.05700.x</a>.","ista":"Lohse K, Barton NH, Melika G, Stone G. 2012. A likelihood based comparison of population histories in a parasitoid guild. Molecular Ecology. 21(18), 4605–4617.","ieee":"K. Lohse, N. H. Barton, G. Melika, and G. Stone, “A likelihood based comparison of population histories in a parasitoid guild,” <i>Molecular Ecology</i>, vol. 21, no. 18. Wiley-Blackwell, pp. 4605–4617, 2012.","short":"K. Lohse, N.H. Barton, G. Melika, G. Stone, Molecular Ecology 21 (2012) 4605–4617.","ama":"Lohse K, Barton NH, Melika G, Stone G. A likelihood based comparison of population histories in a parasitoid guild. <i>Molecular Ecology</i>. 2012;21(18):4605-4617. doi:<a href=\"https://doi.org/10.1111/j.1365-294X.2012.05700.x\">10.1111/j.1365-294X.2012.05700.x</a>","mla":"Lohse, Konrad, et al. “A Likelihood Based Comparison of Population Histories in a Parasitoid Guild.” <i>Molecular Ecology</i>, vol. 21, no. 18, Wiley-Blackwell, 2012, pp. 4605–17, doi:<a href=\"https://doi.org/10.1111/j.1365-294X.2012.05700.x\">10.1111/j.1365-294X.2012.05700.x</a>.","apa":"Lohse, K., Barton, N. H., Melika, G., &#38; Stone, G. (2012). A likelihood based comparison of population histories in a parasitoid guild. <i>Molecular Ecology</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/j.1365-294X.2012.05700.x\">https://doi.org/10.1111/j.1365-294X.2012.05700.x</a>"},"quality_controlled":"1","_id":"2968","publication_status":"published","project":[{"_id":"25B07788-B435-11E9-9278-68D0E5697425","name":"Limits to selection in biology and in evolutionary computation","call_identifier":"FP7","grant_number":"250152"}],"publisher":"Wiley-Blackwell","has_accepted_license":"1","file":[{"relation":"main_file","checksum":"c14ee4cb2a8ba9575bfd8a9bb7a883bb","access_level":"open_access","content_type":"application/pdf","file_id":"5304","creator":"system","file_size":235820,"date_created":"2018-12-12T10:17:47Z","date_updated":"2020-07-14T12:45:57Z","file_name":"IST-2014-296-v1+1_4_wasps_revised3.pdf"},{"relation":"main_file","checksum":"f00afc5b887c8222014b57375b8caece","access_level":"open_access","file_id":"5305","content_type":"application/pdf","file_size":41975,"creator":"system","date_updated":"2020-07-14T12:45:57Z","date_created":"2018-12-12T10:17:48Z","file_name":"IST-2014-296-v1+2_4_wasps_Supporting2.pdf"}],"title":"A likelihood based comparison of population histories in a parasitoid guild","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Lohse, Konrad","last_name":"Lohse","first_name":"Konrad"},{"orcid":"0000-0002-8548-5240","last_name":"Barton","first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Barton, Nicholas H"},{"last_name":"Melika","first_name":"George","full_name":"Melika, George"},{"full_name":"Stone, Graham","last_name":"Stone","first_name":"Graham"}],"department":[{"_id":"NiBa"}],"publist_id":"3746","pubrep_id":"296","language":[{"iso":"eng"}],"volume":21,"status":"public","day":"01","date_created":"2018-12-11T12:00:36Z","ddc":["570","579"],"doi":"10.1111/j.1365-294X.2012.05700.x","publication":"Molecular Ecology","oa_version":"Submitted Version","ec_funded":1,"related_material":{"record":[{"id":"13075","relation":"research_data","status":"public"}]},"acknowledgement":"This work was supported by funding from the UK Natural Environment Research Council to KL (NE/I020288/1) and GS (NE/H000038/1, NE/E014453/1, NER/B/504406/1, NER/B/S2003/00856) and a grant from the European Research Council (250152) to NB.\r\nWe thank Majide Tavakoli, Juli Pujade-Villar and Pablo-Fuentes Utrilla for contributing specimens. Mike Hickerson and three anonymous reviewers gave helpful comments on earlier versions of the manuscript. ","intvolume":"        21","month":"09","date_published":"2012-09-01T00:00:00Z","issue":"18","oa":1,"date_updated":"2023-05-30T13:07:47Z","page":"4605 - 4617","year":"2012"},{"intvolume":"        32","month":"10","date_published":"2012-10-10T00:00:00Z","acknowledgement":"This work was supported by grants from the Deutsche Forschungsgemeinschaft (TR 3/B10, Leibniz program, GSC-4 Spemann Graduate School) and the European Union (European Research Council Advanced Grant).","date_updated":"2021-01-12T07:40:08Z","issue":"41","oa":1,"page":"14294 - 14304","external_id":{"pmid":["23055500"]},"year":"2012","pmid":1,"volume":32,"date_created":"2018-12-11T12:00:36Z","status":"public","day":"10","main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3632771/"}],"doi":"10.1523/JNEUROSCI.6104-11.2012","publication":"Journal of Neuroscience","oa_version":"Submitted Version","publisher":"Society for Neuroscience","author":[{"last_name":"Goswami","first_name":"Sarit","id":"3A578F32-F248-11E8-B48F-1D18A9856A87","full_name":"Goswami, Sarit"},{"full_name":"Bucurenciu, Iancu","first_name":"Iancu","last_name":"Bucurenciu"},{"id":"353C1B58-F248-11E8-B48F-1D18A9856A87","first_name":"Peter M","orcid":"0000-0001-5001-4804","last_name":"Jonas","full_name":"Jonas, Peter M"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","title":"Miniature IPSCs in hippocampal granule cells are triggered by voltage-gated Ca^(2+) channels via microdomain coupling","department":[{"_id":"PeJo"}],"publist_id":"3744","language":[{"iso":"eng"}],"citation":{"chicago":"Goswami, Sarit, Iancu Bucurenciu, and Peter M Jonas. “Miniature IPSCs in Hippocampal Granule Cells Are Triggered by Voltage-Gated Ca^(2+) Channels via Microdomain Coupling.” <i>Journal of Neuroscience</i>. Society for Neuroscience, 2012. <a href=\"https://doi.org/10.1523/JNEUROSCI.6104-11.2012\">https://doi.org/10.1523/JNEUROSCI.6104-11.2012</a>.","short":"S. Goswami, I. Bucurenciu, P.M. Jonas, Journal of Neuroscience 32 (2012) 14294–14304.","ista":"Goswami S, Bucurenciu I, Jonas PM. 2012. Miniature IPSCs in hippocampal granule cells are triggered by voltage-gated Ca^(2+) channels via microdomain coupling. Journal of Neuroscience. 32(41), 14294–14304.","ieee":"S. Goswami, I. Bucurenciu, and P. M. Jonas, “Miniature IPSCs in hippocampal granule cells are triggered by voltage-gated Ca^(2+) channels via microdomain coupling,” <i>Journal of Neuroscience</i>, vol. 32, no. 41. Society for Neuroscience, pp. 14294–14304, 2012.","ama":"Goswami S, Bucurenciu I, Jonas PM. Miniature IPSCs in hippocampal granule cells are triggered by voltage-gated Ca^(2+) channels via microdomain coupling. <i>Journal of Neuroscience</i>. 2012;32(41):14294-14304. doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.6104-11.2012\">10.1523/JNEUROSCI.6104-11.2012</a>","mla":"Goswami, Sarit, et al. “Miniature IPSCs in Hippocampal Granule Cells Are Triggered by Voltage-Gated Ca^(2+) Channels via Microdomain Coupling.” <i>Journal of Neuroscience</i>, vol. 32, no. 41, Society for Neuroscience, 2012, pp. 14294–304, doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.6104-11.2012\">10.1523/JNEUROSCI.6104-11.2012</a>.","apa":"Goswami, S., Bucurenciu, I., &#38; Jonas, P. M. (2012). Miniature IPSCs in hippocampal granule cells are triggered by voltage-gated Ca^(2+) channels via microdomain coupling. <i>Journal of Neuroscience</i>. Society for Neuroscience. <a href=\"https://doi.org/10.1523/JNEUROSCI.6104-11.2012\">https://doi.org/10.1523/JNEUROSCI.6104-11.2012</a>"},"type":"journal_article","abstract":[{"text":"The coupling between presynaptic Ca^(2+) channels and Ca^(2+) sensors of exocytosis is a key determinant of synaptic transmission. Evoked release from parvalbumin (PV)-expressing interneurons is triggered by nanodomain coupling of P/Q-type Ca^(2+) channels, whereas release from cholecystokinin (CCK)-containing interneurons is generated by microdomain coupling of N-type channels. Nanodomain coupling has several functional advantages, including speed and efficacy of transmission. One potential disadvantage is that stochastic\r\nopening of presynaptic Ca^(2+) channels may trigger spontaneous transmitter release. We addressed this possibility in rat hippocampal\r\ngranule cells, which receive converging inputs from different inhibitory sources. Both reduction of extracellular Ca^(2+) concentration and the unselective Ca^(2+) channel blocker Cd^(2+) reduced the frequency of miniature IPSCs (mIPSCs) in granule cells by ~50%, suggesting that the opening of presynaptic Ca^(2+) channels contributes to spontaneous release. Application of the selective P/Q-type Ca^(2+) channel blocker\r\nω-agatoxin IVa had no detectable effects, whereas both the N-type blocker ω-conotoxin GVIa and the L-type blocker nimodipine reduced\r\nmIPSC frequency. Furthermore, both the fast Ca^(2+) chelator BAPTA-AM and the slow chelator EGTA-AM reduced the mIPSC frequency,\r\nsuggesting that Ca^(2+)-dependent spontaneous release is triggered by microdomain rather than nanodomain coupling. The CB_(1) receptor\r\nagonist WIN 55212-2 also decreased spontaneous release; this effect was occluded by prior application of ω-conotoxin GVIa, suggesting that a major fraction of Ca^(2+)-dependent spontaneous release was generated at the terminals of CCK-expressing interneurons. Tonic inhibition generated by spontaneous opening of presynaptic N- and L-type Ca^(2+) channels may be important for hippocampal information processing.\r\n","lang":"eng"}],"scopus_import":1,"_id":"2969","quality_controlled":"1","project":[{"_id":"25BDE9A4-B435-11E9-9278-68D0E5697425","name":"Glutamaterge synaptische Übertragung und Plastizität in hippocampalen Mikroschaltkreisen","grant_number":"SFB-TR3-TP10B"}],"publication_status":"published"},{"arxiv":1,"scopus_import":1,"abstract":[{"lang":"eng","text":"Energy parity games are infinite two-player turn-based games played on weighted graphs. The objective of the game combines a (qualitative) parity condition with the (quantitative) requirement that the sum of the weights (i.e., the level of energy in the game) must remain positive. Beside their own interest in the design and synthesis of resource-constrained omega-regular specifications, energy parity games provide one of the simplest model of games with combined qualitative and quantitative objectives. Our main results are as follows: (a) exponential memory is sufficient and may be necessary for winning strategies in energy parity games; (b) the problem of deciding the winner in energy parity games can be solved in NP ∩ coNP; and (c) we give an algorithm to solve energy parity by reduction to energy games. We also show that the problem of deciding the winner in energy parity games is logspace-equivalent to the problem of deciding the winner in mean-payoff parity games, which can thus be solved in NP ∩ coNP. As a consequence we also obtain a conceptually simple algorithm to solve mean-payoff parity games."}],"file_date_updated":"2020-07-14T12:45:57Z","type":"journal_article","citation":{"apa":"Chatterjee, K., &#38; Doyen, L. (2012). Energy parity games. <i>Theoretical Computer Science</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.tcs.2012.07.038\">https://doi.org/10.1016/j.tcs.2012.07.038</a>","mla":"Chatterjee, Krishnendu, and Laurent Doyen. “Energy Parity Games.” <i>Theoretical Computer Science</i>, vol. 458, Elsevier, 2012, pp. 49–60, doi:<a href=\"https://doi.org/10.1016/j.tcs.2012.07.038\">10.1016/j.tcs.2012.07.038</a>.","ama":"Chatterjee K, Doyen L. Energy parity games. <i>Theoretical Computer Science</i>. 2012;458:49-60. doi:<a href=\"https://doi.org/10.1016/j.tcs.2012.07.038\">10.1016/j.tcs.2012.07.038</a>","ista":"Chatterjee K, Doyen L. 2012. Energy parity games. Theoretical Computer Science. 458, 49–60.","short":"K. Chatterjee, L. Doyen, Theoretical Computer Science 458 (2012) 49–60.","ieee":"K. Chatterjee and L. Doyen, “Energy parity games,” <i>Theoretical Computer Science</i>, vol. 458. Elsevier, pp. 49–60, 2012.","chicago":"Chatterjee, Krishnendu, and Laurent Doyen. “Energy Parity Games.” <i>Theoretical Computer Science</i>. Elsevier, 2012. <a href=\"https://doi.org/10.1016/j.tcs.2012.07.038\">https://doi.org/10.1016/j.tcs.2012.07.038</a>."},"quality_controlled":"1","_id":"2972","publication_status":"published","project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P 23499-N23"},{"call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"publisher":"Elsevier","has_accepted_license":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"full_name":"Doyen, Laurent","first_name":"Laurent","last_name":"Doyen"}],"title":"Energy parity games","file":[{"content_type":"application/pdf","file_id":"5935","creator":"kschuh","file_size":351271,"access_level":"open_access","checksum":"719e4a5af5a01ad3f2f7f7f05b3c2b09","relation":"main_file","file_name":"2012_Elsevier_Chatterjee.pdf","date_updated":"2020-07-14T12:45:57Z","date_created":"2019-02-06T11:56:22Z"}],"department":[{"_id":"KrCh"}],"publist_id":"3736","pubrep_id":"935","language":[{"iso":"eng"}],"volume":458,"day":"02","status":"public","tmp":{"short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"ddc":["004"],"date_created":"2018-12-11T12:00:37Z","publication":"Theoretical Computer Science","doi":"10.1016/j.tcs.2012.07.038","ec_funded":1,"oa_version":"Published Version","related_material":{"record":[{"id":"3851","status":"public","relation":"earlier_version"}]},"date_published":"2012-11-02T00:00:00Z","intvolume":"       458","month":"11","oa":1,"date_updated":"2023-02-23T11:45:29Z","page":"49 - 60","external_id":{"arxiv":["1001.5183"]},"year":"2012"},{"volume":7658,"day":"01","status":"public","ddc":["004","005"],"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"date_created":"2018-12-11T12:00:38Z","doi":"10.1007/978-3-642-34961-4_40","ec_funded":1,"oa_version":"Submitted Version","acknowledgement":"We are grateful to Petros Mol for helpful discussions on the reduction for the hardness of the xLPN problem.\r\n","month":"12","intvolume":"      7658","date_published":"2012-12-01T00:00:00Z","alternative_title":["LNCS"],"oa":1,"date_updated":"2021-01-12T07:40:11Z","conference":{"location":"Beijing, China","name":"ASIACRYPT: Theory and Application of Cryptology and Information Security","start_date":"2012-12-02","end_date":"2012-12-06"},"page":"663 - 680","year":"2012","file_date_updated":"2020-07-14T12:45:58Z","type":"conference","abstract":[{"text":"We construct a perfectly binding string commitment scheme whose security is based on the learning parity with noise (LPN) assumption, or equivalently, the hardness of decoding random linear codes. Our scheme not only allows for a simple and efficient zero-knowledge proof of knowledge for committed values (essentially a Σ-protocol), but also for such proofs showing any kind of relation amongst committed values, i.e. proving that messages m_0,...,m_u, are such that m_0=C(m_1,...,m_u) for any circuit C.\r\n\r\nTo get soundness which is exponentially small in a security parameter t, and when the zero-knowledge property relies on the LPN problem with secrets of length l, our 3 round protocol has communication complexity O(t|C|l log(l)) and computational complexity of O(t|C|l) bit operations. The hidden constants are small, and the computation consists mostly of computing inner products of bit-vectors.","lang":"eng"}],"scopus_import":1,"citation":{"apa":"Jain, A., Krenn, S., Pietrzak, K. Z., &#38; Tentes, A. (2012). Commitments and efficient zero knowledge proofs from learning parity with noise. In X. Wang &#38; K. Sako (Eds.) (Vol. 7658, pp. 663–680). Presented at the ASIACRYPT: Theory and Application of Cryptology and Information Security, Beijing, China: Springer. <a href=\"https://doi.org/10.1007/978-3-642-34961-4_40\">https://doi.org/10.1007/978-3-642-34961-4_40</a>","mla":"Jain, Abhishek, et al. <i>Commitments and Efficient Zero Knowledge Proofs from Learning Parity with Noise</i>. Edited by Xiaoyun Wang and Kazue Sako, vol. 7658, Springer, 2012, pp. 663–80, doi:<a href=\"https://doi.org/10.1007/978-3-642-34961-4_40\">10.1007/978-3-642-34961-4_40</a>.","ama":"Jain A, Krenn S, Pietrzak KZ, Tentes A. Commitments and efficient zero knowledge proofs from learning parity with noise. In: Wang X, Sako K, eds. Vol 7658. Springer; 2012:663-680. doi:<a href=\"https://doi.org/10.1007/978-3-642-34961-4_40\">10.1007/978-3-642-34961-4_40</a>","ieee":"A. Jain, S. Krenn, K. Z. Pietrzak, and A. Tentes, “Commitments and efficient zero knowledge proofs from learning parity with noise,” presented at the ASIACRYPT: Theory and Application of Cryptology and Information Security, Beijing, China, 2012, vol. 7658, pp. 663–680.","short":"A. Jain, S. Krenn, K.Z. Pietrzak, A. Tentes, in:, X. Wang, K. Sako (Eds.), Springer, 2012, pp. 663–680.","ista":"Jain A, Krenn S, Pietrzak KZ, Tentes A. 2012. Commitments and efficient zero knowledge proofs from learning parity with noise. ASIACRYPT: Theory and Application of Cryptology and Information Security, LNCS, vol. 7658, 663–680.","chicago":"Jain, Abhishek, Stephan Krenn, Krzysztof Z Pietrzak, and Aris Tentes. “Commitments and Efficient Zero Knowledge Proofs from Learning Parity with Noise.” edited by Xiaoyun Wang and Kazue Sako, 7658:663–80. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-34961-4_40\">https://doi.org/10.1007/978-3-642-34961-4_40</a>."},"editor":[{"first_name":"Xiaoyun","last_name":"Wang","full_name":"Wang, Xiaoyun"},{"full_name":"Sako, Kazue","last_name":"Sako","first_name":"Kazue"}],"_id":"2974","publication_status":"published","project":[{"grant_number":"259668","call_identifier":"FP7","_id":"258C570E-B435-11E9-9278-68D0E5697425","name":"Provable Security for Physical Cryptography"}],"publisher":"Springer","has_accepted_license":"1","file":[{"file_name":"IST-2016-721-v1+1_513.pdf","date_created":"2018-12-12T10:14:00Z","date_updated":"2020-07-14T12:45:58Z","creator":"system","file_size":482570,"file_id":"5048","content_type":"application/pdf","relation":"main_file","access_level":"open_access","checksum":"ab879537385efc4cb4203e7ef0fea17b"}],"title":"Commitments and efficient zero knowledge proofs from learning parity with noise","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Jain, Abhishek","last_name":"Jain","first_name":"Abhishek"},{"last_name":"Krenn","orcid":"0000-0003-2835-9093","id":"329FCCF0-F248-11E8-B48F-1D18A9856A87","first_name":"Stephan","full_name":"Krenn, Stephan"},{"full_name":"Pietrzak, Krzysztof Z","first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak","orcid":"0000-0002-9139-1654"},{"last_name":"Tentes","first_name":"Aris","full_name":"Tentes, Aris"}],"publist_id":"3730","department":[{"_id":"KrPi"}],"pubrep_id":"721","language":[{"iso":"eng"}]},{"page":"964 - 989","external_id":{"arxiv":["1109.2158"]},"year":"2012","acknowledgement":"We thank Eyal Flato (Plataine Ltd.) for raising the offset-deconstruction problem in connection with wood cutting. We also thank Tim Bretl (UIUC) for suggesting the digital-pen offset-deconstruction problem. This work has been supported in part by the Israel Science Foundation (grant no. 1102/11), by the German–Israeli Foundation (grant no. 969/07), by the Hermann Minkowski–Minerva Center for Geometry at Tel Aviv University, and by the EU Project under Contract No. 255827 (CGL—Computational Geometry Learning).\r\n","month":"12","intvolume":"        48","date_published":"2012-12-01T00:00:00Z","issue":"4","oa":1,"date_updated":"2023-02-23T11:22:30Z","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1109.2158"}],"doi":"10.1007/s00454-012-9441-5","publication":"Discrete & Computational Geometry","oa_version":"Preprint","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"3329"}]},"volume":48,"day":"01","status":"public","date_created":"2018-12-11T12:01:28Z","publist_id":"3584","department":[{"_id":"HeEd"}],"language":[{"iso":"eng"}],"publisher":"Springer","author":[{"full_name":"Berberich, Eric","last_name":"Berberich","first_name":"Eric"},{"last_name":"Halperin","first_name":"Dan","full_name":"Halperin, Dan"},{"orcid":"0000-0002-8030-9299","last_name":"Kerber","id":"36E4574A-F248-11E8-B48F-1D18A9856A87","first_name":"Michael","full_name":"Kerber, Michael"},{"last_name":"Pogalnikova","first_name":"Roza","full_name":"Pogalnikova, Roza"}],"title":"Deconstructing approximate offsets","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","type":"journal_article","arxiv":1,"abstract":[{"text":"We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum of another polygonal shape P with a disk of fixed radius? If it does, we also seek a preferably simple-looking solution P; then, P's offset constitutes an accurate, vertex-reduced, and smoothened approximation of Q. We give an O(nlogn)-time exact decision algorithm that handles any polygonal shape, assuming the real-RAM model of computation. A variant of the algorithm, which we have implemented using the cgal library, is based on rational arithmetic and answers the same deconstruction problem up to an uncertainty parameter δ its running time additionally depends on δ. If the input shape is found to be approximable, this algorithm also computes an approximate solution for the problem. It also allows us to solve parameter-optimization problems induced by the offset-deconstruction problem. For convex shapes, the complexity of the exact decision algorithm drops to O(n), which is also the time required to compute a solution P with at most one more vertex than a vertex-minimal one.","lang":"eng"}],"scopus_import":1,"citation":{"short":"E. Berberich, D. Halperin, M. Kerber, R. Pogalnikova, Discrete &#38; Computational Geometry 48 (2012) 964–989.","ieee":"E. Berberich, D. Halperin, M. Kerber, and R. Pogalnikova, “Deconstructing approximate offsets,” <i>Discrete &#38; Computational Geometry</i>, vol. 48, no. 4. Springer, pp. 964–989, 2012.","ista":"Berberich E, Halperin D, Kerber M, Pogalnikova R. 2012. Deconstructing approximate offsets. Discrete &#38; Computational Geometry. 48(4), 964–989.","ama":"Berberich E, Halperin D, Kerber M, Pogalnikova R. Deconstructing approximate offsets. <i>Discrete &#38; Computational Geometry</i>. 2012;48(4):964-989. doi:<a href=\"https://doi.org/10.1007/s00454-012-9441-5\">10.1007/s00454-012-9441-5</a>","chicago":"Berberich, Eric, Dan Halperin, Michael Kerber, and Roza Pogalnikova. “Deconstructing Approximate Offsets.” <i>Discrete &#38; Computational Geometry</i>. Springer, 2012. <a href=\"https://doi.org/10.1007/s00454-012-9441-5\">https://doi.org/10.1007/s00454-012-9441-5</a>.","apa":"Berberich, E., Halperin, D., Kerber, M., &#38; Pogalnikova, R. (2012). Deconstructing approximate offsets. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/s00454-012-9441-5\">https://doi.org/10.1007/s00454-012-9441-5</a>","mla":"Berberich, Eric, et al. “Deconstructing Approximate Offsets.” <i>Discrete &#38; Computational Geometry</i>, vol. 48, no. 4, Springer, 2012, pp. 964–89, doi:<a href=\"https://doi.org/10.1007/s00454-012-9441-5\">10.1007/s00454-012-9441-5</a>."},"quality_controlled":"1","_id":"3115"},{"language":[{"iso":"eng"}],"year":"2012","page":"2246 - 2258","department":[{"_id":"VlKo"}],"publist_id":"3582","date_updated":"2021-01-12T07:41:11Z","oa":1,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","title":"Minimizing a sum of submodular functions","author":[{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir","last_name":"Kolmogorov","full_name":"Kolmogorov, Vladimir"}],"issue":"15","date_published":"2012-10-01T00:00:00Z","month":"10","intvolume":"       160","publisher":"Elsevier","oa_version":"Preprint","publication":"Discrete Applied Mathematics","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1006.1990"}],"publication_status":"published","doi":"10.1016/j.dam.2012.05.025","date_created":"2018-12-11T12:01:29Z","_id":"3117","status":"public","day":"01","quality_controlled":"1","volume":160,"citation":{"apa":"Kolmogorov, V. (2012). Minimizing a sum of submodular functions. <i>Discrete Applied Mathematics</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.dam.2012.05.025\">https://doi.org/10.1016/j.dam.2012.05.025</a>","mla":"Kolmogorov, Vladimir. “Minimizing a Sum of Submodular Functions.” <i>Discrete Applied Mathematics</i>, vol. 160, no. 15, Elsevier, 2012, pp. 2246–58, doi:<a href=\"https://doi.org/10.1016/j.dam.2012.05.025\">10.1016/j.dam.2012.05.025</a>.","ista":"Kolmogorov V. 2012. Minimizing a sum of submodular functions. Discrete Applied Mathematics. 160(15), 2246–2258.","short":"V. Kolmogorov, Discrete Applied Mathematics 160 (2012) 2246–2258.","ieee":"V. Kolmogorov, “Minimizing a sum of submodular functions,” <i>Discrete Applied Mathematics</i>, vol. 160, no. 15. Elsevier, pp. 2246–2258, 2012.","ama":"Kolmogorov V. Minimizing a sum of submodular functions. <i>Discrete Applied Mathematics</i>. 2012;160(15):2246-2258. doi:<a href=\"https://doi.org/10.1016/j.dam.2012.05.025\">10.1016/j.dam.2012.05.025</a>","chicago":"Kolmogorov, Vladimir. “Minimizing a Sum of Submodular Functions.” <i>Discrete Applied Mathematics</i>. Elsevier, 2012. <a href=\"https://doi.org/10.1016/j.dam.2012.05.025\">https://doi.org/10.1016/j.dam.2012.05.025</a>."},"abstract":[{"lang":"eng","text":"We consider the problem of minimizing a function represented as a sum of submodular terms. We assume each term allows an efficient computation of exchange capacities. This holds, for example, for terms depending on a small number of variables, or for certain cardinality-dependent terms. A naive application of submodular minimization algorithms would not exploit the existence of specialized exchange capacity subroutines for individual terms. To overcome this, we cast the problem as a submodular flow (SF) problem in an auxiliary graph in such a way that applying most existing SF algorithms would rely only on these subroutines. We then explore in more detail Iwata's capacity scaling approach for submodular flows (Iwata 1997 [19]). In particular, we show how to improve its complexity in the case when the function contains cardinality-dependent terms."}],"scopus_import":1,"type":"journal_article"},{"ddc":["000"],"date_created":"2018-12-11T12:01:29Z","day":"01","status":"public","volume":31,"oa_version":"Submitted Version","publication":"ACM Transactions on Graphics","doi":"10.1145/2185520.2185549","date_updated":"2022-05-24T08:21:11Z","oa":1,"issue":"4","date_published":"2012-07-01T00:00:00Z","alternative_title":["SIGGRAPH"],"intvolume":"        31","month":"07","acknowledgement":"This work is supported by the SNF fellowship PBEZP2-134464.\r\nWe would like to thank Xiaochen Hu for implementing mesh con- version tools, Duygu Ceylan for helping with the rendering, and Art Tevs for the human performance data comparison. We also thank Nils Thuerey and Christopher Batty for helpful discussions. ","article_number":"53","year":"2012","_id":"3118","quality_controlled":"1","citation":{"chicago":"Bojsen-Hansen, Morten, Hao Li, and Chris Wojtan. “Tracking Surfaces with Evolving Topology.” <i>ACM Transactions on Graphics</i>. ACM, 2012. <a href=\"https://doi.org/10.1145/2185520.2185549\">https://doi.org/10.1145/2185520.2185549</a>.","ista":"Bojsen-Hansen M, Li H, Wojtan C. 2012. Tracking surfaces with evolving topology. ACM Transactions on Graphics. 31(4), 53.","short":"M. Bojsen-Hansen, H. Li, C. Wojtan, ACM Transactions on Graphics 31 (2012).","ieee":"M. Bojsen-Hansen, H. Li, and C. Wojtan, “Tracking surfaces with evolving topology,” <i>ACM Transactions on Graphics</i>, vol. 31, no. 4. ACM, 2012.","ama":"Bojsen-Hansen M, Li H, Wojtan C. Tracking surfaces with evolving topology. <i>ACM Transactions on Graphics</i>. 2012;31(4). doi:<a href=\"https://doi.org/10.1145/2185520.2185549\">10.1145/2185520.2185549</a>","mla":"Bojsen-Hansen, Morten, et al. “Tracking Surfaces with Evolving Topology.” <i>ACM Transactions on Graphics</i>, vol. 31, no. 4, 53, ACM, 2012, doi:<a href=\"https://doi.org/10.1145/2185520.2185549\">10.1145/2185520.2185549</a>.","apa":"Bojsen-Hansen, M., Li, H., &#38; Wojtan, C. (2012). Tracking surfaces with evolving topology. <i>ACM Transactions on Graphics</i>. ACM. <a href=\"https://doi.org/10.1145/2185520.2185549\">https://doi.org/10.1145/2185520.2185549</a>"},"abstract":[{"text":"We present a method for recovering a temporally coherent, deforming triangle mesh with arbitrarily changing topology from an incoherent sequence of static closed surfaces. We solve this problem using the surface geometry alone, without any prior information like surface templates or velocity fields. Our system combines a proven strategy for triangle mesh improvement, a robust multi-resolution non-rigid registration routine, and a reliable technique for changing surface mesh topology. We also introduce a novel topological constraint enforcement algorithm to ensure that the output and input always have similar topology. We apply our technique to a series of diverse input data from video reconstructions, physics simulations, and artistic morphs. The structured output of our algorithm allows us to efficiently track information like colors and displacement maps, recover velocity information, and solve PDEs on the mesh as a post process.","lang":"eng"}],"scopus_import":"1","file_date_updated":"2020-07-14T12:46:00Z","type":"journal_article","publication_status":"published","author":[{"full_name":"Bojsen-Hansen, Morten","last_name":"Bojsen-Hansen","orcid":"0000-0002-4417-3224","id":"439F0C8C-F248-11E8-B48F-1D18A9856A87","first_name":"Morten"},{"last_name":"Li","first_name":"Hao","full_name":"Li, Hao"},{"full_name":"Wojtan, Christopher J","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","first_name":"Christopher J","last_name":"Wojtan","orcid":"0000-0001-6646-5546"}],"title":"Tracking surfaces with evolving topology","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"content_type":"application/pdf","file_id":"5359","creator":"system","file_size":44538518,"relation":"main_file","access_level":"open_access","checksum":"1e219c5bf4e5552c1290c62eefa5cd60","file_name":"IST-2016-602-v1+1_topoReg.pdf","date_updated":"2020-07-14T12:46:00Z","date_created":"2018-12-12T10:18:37Z"}],"has_accepted_license":"1","publisher":"ACM","language":[{"iso":"eng"}],"article_type":"original","pubrep_id":"602","article_processing_charge":"No","publist_id":"3581","department":[{"_id":"ChWo"}]},{"acknowledgement":"This work was partially funded by NSF grants CCF-0811485 and IIS-1130934. We would like to thank Scanline VFX for additional funding. We would like to thank Jie Tan as well as our anonymous reviewers for their useful suggestions and feedback.","date_published":"2012-07-29T00:00:00Z","month":"07","oa":1,"date_updated":"2023-02-23T11:13:07Z","conference":{"start_date":"2012-07-29","end_date":"2012-07-31","name":"SCA: ACM SIGGRAPH/Eurographics Symposium on Computer animation","location":"Aire-la-Ville, Switzerland"},"page":"255 - 264","year":"2012","status":"public","day":"29","date_created":"2018-12-11T12:01:30Z","ddc":["000"],"publication":"Proceedings of the ACM SIGGRAPH/Eurographics Symposium on Computer Animation","oa_version":"Submitted Version","related_material":{"link":[{"relation":"table_of_contents","url":"http://dl.acm.org/citation.cfm?id=2422393"}]},"publisher":"ACM","has_accepted_license":"1","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Raveendran, Karthik","first_name":"Karthik","last_name":"Raveendran"},{"full_name":"Thuerey, Nils","last_name":"Thuerey","first_name":"Nils"},{"full_name":"Wojtan, Christopher J","orcid":"0000-0001-6646-5546","last_name":"Wojtan","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","first_name":"Christopher J"},{"full_name":"Turk, Greg","last_name":"Turk","first_name":"Greg"}],"title":"Controlling liquids using meshes","file":[{"file_size":4939370,"creator":"system","content_type":"application/pdf","file_id":"4877","checksum":"babda64c24cf90a4d05ae86d712bed08","access_level":"open_access","relation":"main_file","file_name":"IST-2016-600-v1+1_ControllingLiquids_Preprint.pdf","date_created":"2018-12-12T10:11:23Z","date_updated":"2020-07-14T12:46:00Z"}],"department":[{"_id":"ChWo"}],"publist_id":"3580","pubrep_id":"600","language":[{"iso":"eng"}],"abstract":[{"text":"We present an approach for artist-directed animation of liquids using multiple levels of control over the simulation, ranging from the overall tracking of desired shapes to highly detailed secondary effects such as dripping streams, separating sheets of fluid, surface waves and ripples. The first portion of our technique is a volume preserving morph that allows the animator to produce a plausible fluid-like motion from a sparse set of control meshes. By rasterizing the resulting control meshes onto the simulation grid, the mesh velocities act as boundary conditions during the projection step of the fluid simulation. We can then blend this motion together with uncontrolled fluid velocities to achieve a more relaxed control over the fluid that captures natural inertial effects. Our method can produce highly detailed liquid surfaces with control over sub-grid details by using a mesh-based surface tracker on top of a coarse grid-based fluid simulation. We can create ripples and waves on the fluid surface attracting the surface mesh to the control mesh with spring-like forces and also by running a wave simulation over the surface mesh. Our video results demonstrate how our control scheme can be used to create animated characters and shapes that are made of water.\r\n","lang":"eng"}],"scopus_import":1,"type":"conference","file_date_updated":"2020-07-14T12:46:00Z","citation":{"apa":"Raveendran, K., Thuerey, N., Wojtan, C., &#38; Turk, G. (2012). Controlling liquids using meshes. In <i>Proceedings of the ACM SIGGRAPH/Eurographics Symposium on Computer Animation</i> (pp. 255–264). Aire-la-Ville, Switzerland: ACM.","mla":"Raveendran, Karthik, et al. “Controlling Liquids Using Meshes.” <i>Proceedings of the ACM SIGGRAPH/Eurographics Symposium on Computer Animation</i>, ACM, 2012, pp. 255–64.","ama":"Raveendran K, Thuerey N, Wojtan C, Turk G. Controlling liquids using meshes. In: <i>Proceedings of the ACM SIGGRAPH/Eurographics Symposium on Computer Animation</i>. ACM; 2012:255-264.","short":"K. Raveendran, N. Thuerey, C. Wojtan, G. Turk, in:, Proceedings of the ACM SIGGRAPH/Eurographics Symposium on Computer Animation, ACM, 2012, pp. 255–264.","ieee":"K. Raveendran, N. Thuerey, C. Wojtan, and G. Turk, “Controlling liquids using meshes,” in <i>Proceedings of the ACM SIGGRAPH/Eurographics Symposium on Computer Animation</i>, Aire-la-Ville, Switzerland, 2012, pp. 255–264.","ista":"Raveendran K, Thuerey N, Wojtan C, Turk G. 2012. Controlling liquids using meshes. Proceedings of the ACM SIGGRAPH/Eurographics Symposium on Computer Animation. SCA: ACM SIGGRAPH/Eurographics Symposium on Computer animation, 255–264.","chicago":"Raveendran, Karthik, Nils Thuerey, Chris Wojtan, and Greg Turk. “Controlling Liquids Using Meshes.” In <i>Proceedings of the ACM SIGGRAPH/Eurographics Symposium on Computer Animation</i>, 255–64. ACM, 2012."},"quality_controlled":"1","_id":"3119","publication_status":"published"},{"publication_status":"published","type":"journal_article","abstract":[{"lang":"eng","text":"We introduce a strategy based on Kustin-Miller unprojection that allows us to construct many hundreds of Gorenstein codimension 4 ideals with 9 × 16 resolutions (that is, nine equations and sixteen first syzygies). Our two basic games are called Tom and Jerry; the main application is the biregular construction of most of the anticanonically polarised Mori Fano 3-folds of Altinok's thesis. There are 115 cases whose numerical data (in effect, the Hilbert series) allow a Type I projection. In every case, at least one Tom and one Jerry construction works, providing at least two deformation families of quasismooth Fano 3-folds having the same numerics but different topology. © 2012 Copyright Foundation Compositio Mathematica."}],"scopus_import":1,"citation":{"apa":"Brown, G., Kerber, M., &#38; Reid, M. (2012). Fano 3 folds in codimension 4 Tom and Jerry Part I. <i>Compositio Mathematica</i>. Cambridge University Press. <a href=\"https://doi.org/10.1112/S0010437X11007226\">https://doi.org/10.1112/S0010437X11007226</a>","mla":"Brown, Gavin, et al. “Fano 3 Folds in Codimension 4 Tom and Jerry Part I.” <i>Compositio Mathematica</i>, vol. 148, no. 4, Cambridge University Press, 2012, pp. 1171–94, doi:<a href=\"https://doi.org/10.1112/S0010437X11007226\">10.1112/S0010437X11007226</a>.","ieee":"G. Brown, M. Kerber, and M. Reid, “Fano 3 folds in codimension 4 Tom and Jerry Part I,” <i>Compositio Mathematica</i>, vol. 148, no. 4. Cambridge University Press, pp. 1171–1194, 2012.","short":"G. Brown, M. Kerber, M. Reid, Compositio Mathematica 148 (2012) 1171–1194.","ista":"Brown G, Kerber M, Reid M. 2012. Fano 3 folds in codimension 4 Tom and Jerry Part I. Compositio Mathematica. 148(4), 1171–1194.","ama":"Brown G, Kerber M, Reid M. Fano 3 folds in codimension 4 Tom and Jerry Part I. <i>Compositio Mathematica</i>. 2012;148(4):1171-1194. doi:<a href=\"https://doi.org/10.1112/S0010437X11007226\">10.1112/S0010437X11007226</a>","chicago":"Brown, Gavin, Michael Kerber, and Miles Reid. “Fano 3 Folds in Codimension 4 Tom and Jerry Part I.” <i>Compositio Mathematica</i>. Cambridge University Press, 2012. <a href=\"https://doi.org/10.1112/S0010437X11007226\">https://doi.org/10.1112/S0010437X11007226</a>."},"quality_controlled":"1","_id":"3120","publist_id":"3579","department":[{"_id":"HeEd"}],"language":[{"iso":"eng"}],"publisher":"Cambridge University Press","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","title":"Fano 3 folds in codimension 4 Tom and Jerry Part I","author":[{"last_name":"Brown","first_name":"Gavin","full_name":"Brown, Gavin"},{"full_name":"Kerber, Michael","orcid":"0000-0002-8030-9299","last_name":"Kerber","first_name":"Michael","id":"36E4574A-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Miles","last_name":"Reid","full_name":"Reid, Miles"}],"doi":"10.1112/S0010437X11007226","main_file_link":[{"url":"http://arxiv.org/abs/1009.4313","open_access":"1"}],"publication":"Compositio Mathematica","oa_version":"Preprint","volume":148,"status":"public","day":"01","date_created":"2018-12-11T12:01:30Z","page":"1171 - 1194","year":"2012","acknowledgement":"This research is supported by the Korean Government WCU Grant R33-2008-000-10101-0.","month":"07","intvolume":"       148","date_published":"2012-07-01T00:00:00Z","issue":"4","oa":1,"date_updated":"2021-01-12T07:41:12Z"},{"type":"journal_article","abstract":[{"text":"Voltage-activated Ca(2+) channels (VACCs) mediate Ca(2+) influx to trigger action potential-evoked neurotransmitter release, but the mechanism by which Ca(2+) regulates spontaneous transmission is unclear. We found that VACCs are the major physiological triggers for spontaneous release at mouse neocortical inhibitory synapses. Moreover, despite the absence of a synchronizing action potential, we found that spontaneous fusion of a GABA-containing vesicle required the activation of multiple tightly coupled VACCs of variable type.","lang":"eng"}],"scopus_import":1,"citation":{"mla":"Williams, Courtney, et al. “Coactivation of Multiple Tightly Coupled Calcium Channels Triggers Spontaneous Release of GABA.” <i>Nature Neuroscience</i>, vol. 15, no. 9, Nature Publishing Group, 2012, pp. 1195–97, doi:<a href=\"https://doi.org/10.1038/nn.3162\">10.1038/nn.3162</a>.","apa":"Williams, C., Chen, W., Lee, C., Yaeger, D., Vyleta, N., &#38; Smith, S. (2012). Coactivation of multiple tightly coupled calcium channels triggers spontaneous release of GABA. <i>Nature Neuroscience</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/nn.3162\">https://doi.org/10.1038/nn.3162</a>","chicago":"Williams, Courtney, Wenyan Chen, Chia Lee, Daniel Yaeger, Nicholas Vyleta, and Stephen Smith. “Coactivation of Multiple Tightly Coupled Calcium Channels Triggers Spontaneous Release of GABA.” <i>Nature Neuroscience</i>. Nature Publishing Group, 2012. <a href=\"https://doi.org/10.1038/nn.3162\">https://doi.org/10.1038/nn.3162</a>.","ama":"Williams C, Chen W, Lee C, Yaeger D, Vyleta N, Smith S. Coactivation of multiple tightly coupled calcium channels triggers spontaneous release of GABA. <i>Nature Neuroscience</i>. 2012;15(9):1195-1197. doi:<a href=\"https://doi.org/10.1038/nn.3162\">10.1038/nn.3162</a>","ista":"Williams C, Chen W, Lee C, Yaeger D, Vyleta N, Smith S. 2012. Coactivation of multiple tightly coupled calcium channels triggers spontaneous release of GABA. Nature Neuroscience. 15(9), 1195–1197.","short":"C. Williams, W. Chen, C. Lee, D. Yaeger, N. Vyleta, S. Smith, Nature Neuroscience 15 (2012) 1195–1197.","ieee":"C. Williams, W. Chen, C. Lee, D. Yaeger, N. Vyleta, and S. Smith, “Coactivation of multiple tightly coupled calcium channels triggers spontaneous release of GABA,” <i>Nature Neuroscience</i>, vol. 15, no. 9. Nature Publishing Group, pp. 1195–1197, 2012."},"quality_controlled":"1","_id":"3121","publication_status":"published","publisher":"Nature Publishing Group","title":"Coactivation of multiple tightly coupled calcium channels triggers spontaneous release of GABA","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Courtney","last_name":"Williams","full_name":"Williams, Courtney"},{"last_name":"Chen","first_name":"Wenyan","full_name":"Chen, Wenyan"},{"last_name":"Lee","first_name":"Chia","full_name":"Lee, Chia"},{"first_name":"Daniel","last_name":"Yaeger","full_name":"Yaeger, Daniel"},{"full_name":"Vyleta, Nicholas","last_name":"Vyleta","id":"36C4978E-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas"},{"last_name":"Smith","first_name":"Stephen","full_name":"Smith, Stephen"}],"publist_id":"3578","department":[{"_id":"PeJo"}],"language":[{"iso":"eng"}],"pmid":1,"volume":15,"day":"01","status":"public","date_created":"2018-12-11T12:01:30Z","doi":"10.1038/nn.3162","main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3431448/","open_access":"1"}],"publication":"Nature Neuroscience","oa_version":"Submitted Version","acknowledgement":"The work was supported by the US National Institutes of Health (DA027110 and GM097433) and OCTRI. C.W. and N.P.V. were supported by a grant from the National Heart, Lung, and Blood Institute (T32HL033808).\r\nWe thank M. Andresen and K. Khodakhah for helpful comments. ","month":"09","intvolume":"        15","date_published":"2012-09-01T00:00:00Z","issue":"9","oa":1,"date_updated":"2021-01-12T07:41:12Z","page":"1195 - 1197","external_id":{"pmid":["22842148"]},"year":"2012"},{"publication":"Computer Graphics Forum","doi":"10.1111/j.1467-8659.2012.03062.x","oa_version":"Submitted Version","volume":31,"date_created":"2018-12-11T12:01:31Z","ddc":["000"],"status":"public","day":"01","page":"815 - 824","conference":{"name":"EUROGRAPHICS: Conference on European Association for Computer Graphics","end_date":"2012-05-18","start_date":"2012-05-13","location":"Cagliari, Sardinia, Italy"},"year":"2012","date_published":"2012-05-01T00:00:00Z","alternative_title":["Eurographics"],"intvolume":"        31","month":"05","acknowledgement":"This work was funded by NSF grant IIS-1017014 and CCF- 0917093.","date_updated":"2023-10-16T09:54:40Z","oa":1,"issue":"2","publication_status":"published","citation":{"mla":"Yu, Jihun, et al. “Explicit Mesh Surfaces for Particle Based Fluids.” <i>Computer Graphics Forum</i>, vol. 31, no. 2, Wiley, 2012, pp. 815–24, doi:<a href=\"https://doi.org/10.1111/j.1467-8659.2012.03062.x\">10.1111/j.1467-8659.2012.03062.x</a>.","apa":"Yu, J., Wojtan, C., Turk, G., &#38; Yap, C. (2012). Explicit mesh surfaces for particle based fluids. In <i>Computer Graphics Forum</i> (Vol. 31, pp. 815–824). Cagliari, Sardinia, Italy: Wiley. <a href=\"https://doi.org/10.1111/j.1467-8659.2012.03062.x\">https://doi.org/10.1111/j.1467-8659.2012.03062.x</a>","chicago":"Yu, Jihun, Chris Wojtan, Greg Turk, and Chee Yap. “Explicit Mesh Surfaces for Particle Based Fluids.” In <i>Computer Graphics Forum</i>, 31:815–24. Wiley, 2012. <a href=\"https://doi.org/10.1111/j.1467-8659.2012.03062.x\">https://doi.org/10.1111/j.1467-8659.2012.03062.x</a>.","ama":"Yu J, Wojtan C, Turk G, Yap C. Explicit mesh surfaces for particle based fluids. In: <i>Computer Graphics Forum</i>. Vol 31. Wiley; 2012:815-824. doi:<a href=\"https://doi.org/10.1111/j.1467-8659.2012.03062.x\">10.1111/j.1467-8659.2012.03062.x</a>","ista":"Yu J, Wojtan C, Turk G, Yap C. 2012. Explicit mesh surfaces for particle based fluids. Computer Graphics Forum. EUROGRAPHICS: Conference on European Association for Computer Graphics, Eurographics, vol. 31, 815–824.","ieee":"J. Yu, C. Wojtan, G. Turk, and C. Yap, “Explicit mesh surfaces for particle based fluids,” in <i>Computer Graphics Forum</i>, Cagliari, Sardinia, Italy, 2012, vol. 31, no. 2, pp. 815–824.","short":"J. Yu, C. Wojtan, G. Turk, C. Yap, in:, Computer Graphics Forum, Wiley, 2012, pp. 815–824."},"publication_identifier":{"issn":["0167-7055"],"eissn":["1467-8659"]},"abstract":[{"text":"We introduce the idea of using an explicit triangle mesh to track the air/fluid interface in a smoothed particle hydrodynamics (SPH) simulator. Once an initial surface mesh is created, this mesh is carried forward in time using nearby particle velocities to advect the mesh vertices. The mesh connectivity remains mostly unchanged across time-steps; it is only modified locally for topology change events or for the improvement of triangle quality. In order to ensure that the surface mesh does not diverge from the underlying particle simulation, we periodically project the mesh surface onto an implicit surface defined by the physics simulation. The mesh surface gives us several advantages over previous SPH surface tracking techniques. We demonstrate a new method for surface tension calculations that clearly outperforms the state of the art in SPH surface tension for computer graphics. We also demonstrate a method for tracking detailed surface information (like colors) that is less susceptible to numerical diffusion than competing techniques. Finally, our temporally-coherent surface mesh allows us to simulate high-resolution surface wave dynamics without being limited by the particle resolution of the SPH simulation.","lang":"eng"}],"scopus_import":"1","type":"conference","file_date_updated":"2020-07-14T12:46:00Z","_id":"3123","quality_controlled":"1","article_processing_charge":"No","department":[{"_id":"ChWo"}],"publist_id":"3576","language":[{"iso":"eng"}],"pubrep_id":"601","has_accepted_license":"1","publisher":"Wiley","author":[{"full_name":"Yu, Jihun","first_name":"Jihun","last_name":"Yu"},{"last_name":"Wojtan","orcid":"0000-0001-6646-5546","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","first_name":"Christopher J","full_name":"Wojtan, Christopher J"},{"full_name":"Turk, Greg","first_name":"Greg","last_name":"Turk"},{"first_name":"Chee","last_name":"Yap","full_name":"Yap, Chee"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Explicit mesh surfaces for particle based fluids","file":[{"file_name":"IST-2016-601-v1+1_meshSPH.pdf","date_created":"2018-12-12T10:14:39Z","date_updated":"2020-07-14T12:46:00Z","file_size":5740527,"creator":"system","file_id":"5092","content_type":"application/pdf","relation":"main_file","checksum":"acb325dd1e31859bedd30e013f61d0b9","access_level":"open_access"}]},{"language":[{"iso":"eng"}],"year":"2012","pubrep_id":"565","conference":{"start_date":"2012-06-26","end_date":"2012-07-01","name":"ICML: International Conference on Machine Learning","location":"Edinburgh, Scotland"},"publist_id":"3575","department":[{"_id":"ChLa"},{"_id":"VlKo"}],"date_updated":"2023-02-23T12:24:24Z","file":[{"file_id":"4889","content_type":"application/pdf","creator":"system","file_size":305836,"relation":"main_file","access_level":"open_access","checksum":"3d0d4246548c736857302aadb2ff5d15","file_name":"IST-2016-565-v1+1_DM-inferning2012.pdf","date_updated":"2020-07-14T12:46:00Z","date_created":"2018-12-12T10:11:34Z"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa":1,"title":"Approximating marginals using discrete energy minimization","author":[{"full_name":"Korc, Filip","last_name":"Korc","id":"476A2FD6-F248-11E8-B48F-1D18A9856A87","first_name":"Filip"},{"full_name":"Kolmogorov, Vladimir","last_name":"Kolmogorov","first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0001-8622-7887","last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph","full_name":"Lampert, Christoph"}],"month":"06","has_accepted_license":"1","alternative_title":["Inferning 2012"],"date_published":"2012-06-30T00:00:00Z","publisher":"ICML","related_material":{"record":[{"status":"public","relation":"later_version","id":"5396"}]},"oa_version":"Submitted Version","publication_status":"published","_id":"3124","date_created":"2018-12-11T12:01:31Z","ddc":["000"],"day":"30","status":"public","quality_controlled":"1","citation":{"mla":"Korc, Filip, et al. <i>Approximating Marginals Using Discrete Energy Minimization</i>. ICML, 2012.","apa":"Korc, F., Kolmogorov, V., &#38; Lampert, C. (2012). Approximating marginals using discrete energy minimization. Presented at the ICML: International Conference on Machine Learning, Edinburgh, Scotland: ICML.","chicago":"Korc, Filip, Vladimir Kolmogorov, and Christoph Lampert. “Approximating Marginals Using Discrete Energy Minimization.” ICML, 2012.","ama":"Korc F, Kolmogorov V, Lampert C. Approximating marginals using discrete energy minimization. In: ICML; 2012.","short":"F. Korc, V. Kolmogorov, C. Lampert, in:, ICML, 2012.","ista":"Korc F, Kolmogorov V, Lampert C. 2012. Approximating marginals using discrete energy minimization. ICML: International Conference on Machine Learning, Inferning 2012, .","ieee":"F. Korc, V. Kolmogorov, and C. Lampert, “Approximating marginals using discrete energy minimization,” presented at the ICML: International Conference on Machine Learning, Edinburgh, Scotland, 2012."},"type":"conference","file_date_updated":"2020-07-14T12:46:00Z","abstract":[{"text":"We consider the problem of inference in a graphical model with binary variables. While in theory it is arguably preferable to compute marginal probabilities, in practice researchers often use MAP inference due to the availability of efficient discrete optimization algorithms. We bridge the gap between the two approaches by introducing the Discrete Marginals technique in which approximate marginals are obtained by minimizing an objective function with unary and pairwise terms over a discretized domain. This allows the use of techniques originally developed for MAP-MRF inference and learning. We explore two ways to set up the objective function - by discretizing the Bethe free energy and by learning it from training data. Experimental results show that for certain types of graphs a learned function can outperform the Bethe approximation. We also establish a link between the Bethe free energy and submodular functions.\r\n","lang":"eng"}]},{"language":[{"iso":"eng"}],"article_processing_charge":"No","publist_id":"3574","department":[{"_id":"ChLa"}],"title":"Augmented attribute representations","author":[{"first_name":"Viktoriia","id":"2EA6D09E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0192-9308","last_name":"Sharmanska","full_name":"Sharmanska, Viktoriia"},{"last_name":"Quadrianto","first_name":"Novi","full_name":"Quadrianto, Novi"},{"full_name":"Lampert, Christoph","orcid":"0000-0001-8622-7887","last_name":"Lampert","first_name":"Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"file_size":6073897,"creator":"dernst","file_id":"7861","content_type":"application/pdf","access_level":"open_access","checksum":"bccdbe0663780d25a1e0524002b2d896","relation":"main_file","file_name":"2012_ECCV_Sharmanska.pdf","date_created":"2020-05-15T12:29:04Z","date_updated":"2020-07-14T12:46:00Z"}],"has_accepted_license":"1","publisher":"Springer","publication_status":"published","_id":"3125","quality_controlled":"1","citation":{"chicago":"Sharmanska, Viktoriia, Novi Quadrianto, and Christoph Lampert. “Augmented Attribute Representations,” 7576:242–55. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-33715-4_18\">https://doi.org/10.1007/978-3-642-33715-4_18</a>.","ama":"Sharmanska V, Quadrianto N, Lampert C. Augmented attribute representations. In: Vol 7576. Springer; 2012:242-255. doi:<a href=\"https://doi.org/10.1007/978-3-642-33715-4_18\">10.1007/978-3-642-33715-4_18</a>","ista":"Sharmanska V, Quadrianto N, Lampert C. 2012. Augmented attribute representations. ECCV: European Conference on Computer Vision, LNCS, vol. 7576, 242–255.","ieee":"V. Sharmanska, N. Quadrianto, and C. Lampert, “Augmented attribute representations,” presented at the ECCV: European Conference on Computer Vision, Florence, Italy, 2012, vol. 7576, no. PART 5, pp. 242–255.","short":"V. Sharmanska, N. Quadrianto, C. Lampert, in:, Springer, 2012, pp. 242–255.","mla":"Sharmanska, Viktoriia, et al. <i>Augmented Attribute Representations</i>. Vol. 7576, no. PART 5, Springer, 2012, pp. 242–55, doi:<a href=\"https://doi.org/10.1007/978-3-642-33715-4_18\">10.1007/978-3-642-33715-4_18</a>.","apa":"Sharmanska, V., Quadrianto, N., &#38; Lampert, C. (2012). Augmented attribute representations (Vol. 7576, pp. 242–255). Presented at the ECCV: European Conference on Computer Vision, Florence, Italy: Springer. <a href=\"https://doi.org/10.1007/978-3-642-33715-4_18\">https://doi.org/10.1007/978-3-642-33715-4_18</a>"},"scopus_import":1,"abstract":[{"lang":"eng","text":"We propose a new learning method to infer a mid-level feature representation that combines the advantage of semantic attribute representations with the higher expressive power of non-semantic features. The idea lies in augmenting an existing attribute-based representation with additional dimensions for which an autoencoder model is coupled with a large-margin principle. This construction allows a smooth transition between the zero-shot regime with no training example, the unsupervised regime with training examples but without class labels, and the supervised regime with training examples and with class labels. The resulting optimization problem can be solved efficiently, because several of the necessity steps have closed-form solutions. Through extensive experiments we show that the augmented representation achieves better results in terms of object categorization accuracy than the semantic representation alone."}],"type":"conference","file_date_updated":"2020-07-14T12:46:00Z","year":"2012","page":"242 - 255","conference":{"end_date":"2012-10-13","start_date":"2012-10-07","name":"ECCV: European Conference on Computer Vision","location":"Florence, Italy"},"date_updated":"2023-02-23T11:13:25Z","oa":1,"issue":"PART 5","date_published":"2012-10-01T00:00:00Z","alternative_title":["LNCS"],"intvolume":"      7576","month":"10","oa_version":"Submitted Version","doi":"10.1007/978-3-642-33715-4_18","date_created":"2018-12-11T12:01:32Z","ddc":["000"],"day":"01","status":"public","volume":7576},{"article_processing_charge":"No","page":"211-218","department":[{"_id":"ChLa"},{"_id":"HeEd"}],"publist_id":"3572","conference":{"start_date":"2012-06-26","end_date":"2012-07-01","name":"ICML: International Conference on Machine Learning","location":"Edinburgh, United Kingdom"},"language":[{"iso":"eng"}],"year":"2012","date_published":"2012-06-01T00:00:00Z","month":"06","publisher":"ML Research Press","date_updated":"2023-10-17T11:55:06Z","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"The most persistent soft-clique in a set of sampled graphs","author":[{"last_name":"Quadrianto","first_name":"Novi","full_name":"Quadrianto, Novi"},{"id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph","last_name":"Lampert","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph"},{"full_name":"Chen, Chao","last_name":"Chen","first_name":"Chao","id":"3E92416E-F248-11E8-B48F-1D18A9856A87"}],"publication":"Proceedings of the 29th International Conference on Machine Learning","main_file_link":[{"url":"http://arxiv.org/abs/1206.4652","open_access":"1"}],"publication_status":"published","oa_version":"Preprint","citation":{"ista":"Quadrianto N, Lampert C, Chen C. 2012. The most persistent soft-clique in a set of sampled graphs. Proceedings of the 29th International Conference on Machine Learning. ICML: International Conference on Machine Learning, 211–218.","short":"N. Quadrianto, C. Lampert, C. Chen, in:, Proceedings of the 29th International Conference on Machine Learning, ML Research Press, 2012, pp. 211–218.","ieee":"N. Quadrianto, C. Lampert, and C. Chen, “The most persistent soft-clique in a set of sampled graphs,” in <i>Proceedings of the 29th International Conference on Machine Learning</i>, Edinburgh, United Kingdom, 2012, pp. 211–218.","ama":"Quadrianto N, Lampert C, Chen C. The most persistent soft-clique in a set of sampled graphs. In: <i>Proceedings of the 29th International Conference on Machine Learning</i>. ML Research Press; 2012:211-218.","chicago":"Quadrianto, Novi, Christoph Lampert, and Chao Chen. “The Most Persistent Soft-Clique in a Set of Sampled Graphs.” In <i>Proceedings of the 29th International Conference on Machine Learning</i>, 211–18. ML Research Press, 2012.","apa":"Quadrianto, N., Lampert, C., &#38; Chen, C. (2012). The most persistent soft-clique in a set of sampled graphs. In <i>Proceedings of the 29th International Conference on Machine Learning</i> (pp. 211–218). Edinburgh, United Kingdom: ML Research Press.","mla":"Quadrianto, Novi, et al. “The Most Persistent Soft-Clique in a Set of Sampled Graphs.” <i>Proceedings of the 29th International Conference on Machine Learning</i>, ML Research Press, 2012, pp. 211–18."},"scopus_import":"1","abstract":[{"lang":"eng","text":"When searching for characteristic subpatterns in potentially noisy graph data, it appears self-evident that having multiple observations would be better than having just one. However, it turns out that the inconsistencies introduced when different graph instances have different edge sets pose a serious challenge. In this work we address this challenge for the problem of finding maximum weighted cliques.\r\n    We introduce the concept of most persistent soft-clique. This is subset of vertices, that 1) is almost fully or at least densely connected, 2) occurs in all or almost all graph instances, and 3) has the maximum weight. We present a measure of clique-ness, that essentially counts the number of edge missing to make a subset of vertices into a clique. With this measure, we show that the problem of finding the most persistent soft-clique problem can be cast either as: a) a max-min two person game optimization problem, or b) a min-min soft margin optimization problem. Both formulations lead to the same solution when using a partial Lagrangian method to solve the optimization problems. By experiments on synthetic data and on real social network data, we show that the proposed method is able to reliably find soft cliques in graph data, even if that is distorted by random noise or unreliable observations."}],"type":"conference","date_created":"2018-12-11T12:01:33Z","_id":"3127","status":"public","day":"01","quality_controlled":"1"}]