[{"date_created":"2018-12-11T12:00:32Z","type":"conference","_id":"2956","acknowledgement":"The research was supported by Austrian Science Fund (FWF) Grant No P 23499-N23, FWF NFN Grant No S11407-N23 (RiSE), ERC Start grant (279307: Graph Games), Microsoft faculty fellows award, the Israeli Centers of Research Excellence (ICORE) program, (Center No. 4/11), the RICH Model Toolkit (ICT COST Action IC0901), and was carried out in partial fulfillment of the requirements for the Ph.D. degree of the second author.\r\nA Technical Report of this paper is available via internal link.","status":"public","year":"2012","day":"23","doi":"10.1109/LICS.2012.30","scopus_import":1,"related_material":{"record":[{"id":"5377","relation":"earlier_version","status":"public"}]},"conference":{"location":"Dubrovnik, Croatia ","name":"LICS: Logic in Computer Science","end_date":"2012-06-28","start_date":"2012-06-25"},"publist_id":"3770","ec_funded":1,"publication":"Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science","project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","call_identifier":"FWF"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","call_identifier":"FP7"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"quality_controlled":"1","department":[{"_id":"KrCh"}],"date_updated":"2023-02-23T12:23:30Z","oa_version":"None","citation":{"ieee":"K. Chatterjee and Y. Velner, “Mean payoff pushdown games,” in <i>Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science</i>, Dubrovnik, Croatia , 2012.","chicago":"Chatterjee, Krishnendu, and Yaron Velner. “Mean Payoff Pushdown Games.” 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.30\">https://doi.org/10.1109/LICS.2012.30</a>.","ista":"Chatterjee K, Velner Y. 2012. Mean payoff pushdown games. Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 6280438.","ama":"Chatterjee K, Velner Y. Mean payoff pushdown games. 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.30\">10.1109/LICS.2012.30</a>","apa":"Chatterjee, K., &#38; Velner, Y. (2012). Mean payoff pushdown games. 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.30\">https://doi.org/10.1109/LICS.2012.30</a>","short":"K. Chatterjee, Y. Velner, in:, Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2012.","mla":"Chatterjee, Krishnendu, and Yaron Velner. “Mean Payoff Pushdown Games.” <i>Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science</i>, 6280438, IEEE, 2012, doi:<a href=\"https://doi.org/10.1109/LICS.2012.30\">10.1109/LICS.2012.30</a>."},"author":[{"orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Velner, Yaron","last_name":"Velner","first_name":"Yaron"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","month":"08","abstract":[{"text":"Two-player games on graphs are central in many problems in formal verification and program analysis such as synthesis and verification of open systems. In this work we consider solving recursive game graphs (or pushdown game graphs) that can model the control flow of sequential programs with recursion. While pushdown games have been studied before with qualitative objectives, such as reachability and parity objectives, in this work we study for the first time such games with the most well-studied quantitative objective, namely, mean payoff objectives. In pushdown games two types of strategies are relevant: (1) global strategies, that depend on the entire global history; and (2) modular strategies, that have only local memory and thus do not depend on the context of invocation, but only on the history of the current invocation of the module. Our main results are as follows: (1) One-player pushdown games with mean-payoff objectives under global strategies are decidable in polynomial time. (2) Two-player pushdown games with mean-payoff objectives under global strategies are undecidable. (3) One-player pushdown games with mean-payoff objectives under modular strategies are NP-hard. (4) Two-player pushdown games with mean-payoff objectives under modular strategies can be solved in NP (i.e., both one-player and two-player pushdown games with mean-payoff objectives under modular strategies are NP-complete). We also establish the optimal strategy complexity showing that global strategies for mean-payoff objectives require infinite memory even in one-player pushdown games; and memoryless modular strategies are sufficient in two-player pushdown games. Finally we also show that all the problems have the same computational complexity if the stack boundedness condition is added, where along with the mean-payoff objective the player must also ensure that the stack height is bounded.","lang":"eng"}],"article_number":"6280438","publisher":"IEEE","date_published":"2012-08-23T00:00:00Z","language":[{"iso":"eng"}],"title":"Mean payoff pushdown games"},{"month":"08","article_number":"6280437","language":[{"iso":"eng"}],"project":[{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","oa_version":"Preprint","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"},{"first_name":"Mathieu","last_name":"Tracol","full_name":"Tracol, Mathieu","id":"3F54FA38-F248-11E8-B48F-1D18A9856A87"}],"ec_funded":1,"conference":{"end_date":"2012-06-28","start_date":"2012-06-25","name":"LICS: Logic in Computer Science","location":"Dubrovnik, Croatia "},"date_created":"2018-12-11T12:00:33Z","type":"conference","_id":"2957","status":"public","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1107.2091"}],"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."}],"publication_status":"published","publisher":"IEEE","date_published":"2012-08-23T00:00:00Z","title":"Decidable problems for probabilistic automata on infinite words","date_updated":"2023-02-23T12:23:51Z","department":[{"_id":"KrCh"}],"citation":{"short":"K. Chatterjee, M. Tracol, in:, Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2012.","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>","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>","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.","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>.","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."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["1107.2091"]},"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"5384"}]},"scopus_import":1,"publist_id":"3769","arxiv":1,"publication":"Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science","oa":1,"year":"2012","doi":"10.1109/LICS.2012.29","day":"23"},{"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).","doi":"10.1523/JNEUROSCI.6175-11.2012","page":"14752 - 14766","year":"2012","day":"17","oa":1,"intvolume":"        32","publist_id":"3768","publication":"Journal of Neuroscience","scopus_import":1,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","external_id":{"pmid":["23077060"]},"date_updated":"2021-01-12T07:40:03Z","department":[{"_id":"JoCs"}],"citation":{"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>.","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.","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>","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>","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>.","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."},"publisher":"Society for Neuroscience","date_published":"2012-10-17T00:00:00Z","pmid":1,"title":"Hippocampal place cells can encode multiple trial-dependent features through rate remapping","abstract":[{"lang":"eng","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."}],"publication_status":"published","status":"public","main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3531717/","open_access":"1"}],"date_created":"2018-12-11T12:00:33Z","type":"journal_article","_id":"2958","ec_funded":1,"author":[{"full_name":"Allen, Kevin","last_name":"Allen","first_name":"Kevin"},{"full_name":"Rawlins, J Nick","first_name":"J Nick","last_name":"Rawlins"},{"first_name":"David","last_name":"Bannerman","full_name":"Bannerman, David"},{"id":"3FA14672-F248-11E8-B48F-1D18A9856A87","full_name":"Csicsvari, Jozsef L","last_name":"Csicsvari","first_name":"Jozsef L","orcid":"0000-0002-5193-4036"}],"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"}],"quality_controlled":"1","oa_version":"Submitted Version","language":[{"iso":"eng"}],"volume":32,"month":"10","issue":"42"},{"_id":"2959","type":"journal_article","date_created":"2018-12-11T12:00:33Z","status":"public","main_file_link":[{"url":"http://arxiv.org/abs/1012.2643","open_access":"1"}],"issue":"1","month":"02","volume":40,"language":[{"iso":"eng"}],"oa_version":"Preprint","quality_controlled":"1","author":[{"orcid":"0000-0002-7008-0216","last_name":"Uhler","first_name":"Caroline","full_name":"Uhler, Caroline","id":"49ADD78E-F248-11E8-B48F-1D18A9856A87"}],"scopus_import":1,"publication":"Annals of Statistics","intvolume":"        40","publist_id":"3767","oa":1,"day":"01","year":"2012","doi":"10.1214/11-AOS957","page":"238 - 261","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","abstract":[{"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.","lang":"eng"}],"publication_status":"published","title":"Geometry of maximum likelihood estimation in Gaussian graphical models","date_published":"2012-02-01T00:00:00Z","publisher":"Institute of Mathematical Statistics","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>","ista":"Uhler C. 2012. Geometry of maximum likelihood estimation in Gaussian graphical models. Annals of Statistics. 40(1), 238–261.","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>","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>.","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.","short":"C. Uhler, Annals of Statistics 40 (2012) 238–261.","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>."},"date_updated":"2021-01-12T07:40:04Z","department":[{"_id":"CaUh"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87"},{"main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3522150/","open_access":"1"}],"status":"public","_id":"2962","type":"journal_article","date_created":"2018-12-11T12:00:34Z","author":[{"full_name":"Aeschbacher, Simon","id":"2D35326E-F248-11E8-B48F-1D18A9856A87","first_name":"Simon","last_name":"Aeschbacher"},{"full_name":"Beaumont, Mark","first_name":"Mark","last_name":"Beaumont"},{"first_name":"Andreas","last_name":"Futschik","full_name":"Futschik, Andreas"}],"oa_version":"Submitted Version","quality_controlled":"1","acknowledged_ssus":[{"_id":"ScienComp"}],"volume":192,"language":[{"iso":"eng"}],"issue":"3","month":"11","day":"01","page":"1027 - 1047","doi":"10.1534/genetics.112.143164","year":"2012","oa":1,"publication":"Genetics","intvolume":"       192","publist_id":"3763","scopus_import":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"pmid":["22960215"]},"citation":{"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>.","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.","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>","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>","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>."},"date_updated":"2021-01-12T07:40:05Z","department":[{"_id":"NiBa"}],"title":"A novel approach for choosing summary statistics in approximate Bayesian computation","publisher":"Genetics Society of America","date_published":"2012-11-01T00:00:00Z","pmid":1,"abstract":[{"lang":"eng","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."}],"publication_status":"published"},{"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Jesse","first_name":"Fabienne","full_name":"Jesse, Fabienne","id":"4C8C26A4-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Riebel, Katharina","last_name":"Riebel","first_name":"Katharina"}],"oa_version":"None","citation":{"ieee":"F. Jesse and K. Riebel, “Social facilitation of male song by male and female conspecifics in the zebra finch, Taeniopygia guttata,” <i>Behavioural Processes</i>, vol. 91, no. 3. Elsevier, pp. 262–266, 2012.","apa":"Jesse, F., &#38; Riebel, K. (2012). Social facilitation of male song by male and female conspecifics in the zebra finch, Taeniopygia guttata. <i>Behavioural Processes</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.beproc.2012.09.006\">https://doi.org/10.1016/j.beproc.2012.09.006</a>","ista":"Jesse F, Riebel K. 2012. Social facilitation of male song by male and female conspecifics in the zebra finch, Taeniopygia guttata. Behavioural Processes. 91(3), 262–266.","ama":"Jesse F, Riebel K. Social facilitation of male song by male and female conspecifics in the zebra finch, Taeniopygia guttata. <i>Behavioural Processes</i>. 2012;91(3):262-266. doi:<a href=\"https://doi.org/10.1016/j.beproc.2012.09.006\">10.1016/j.beproc.2012.09.006</a>","chicago":"Jesse, Fabienne, and Katharina Riebel. “Social Facilitation of Male Song by Male and Female Conspecifics in the Zebra Finch, Taeniopygia Guttata.” <i>Behavioural Processes</i>. Elsevier, 2012. <a href=\"https://doi.org/10.1016/j.beproc.2012.09.006\">https://doi.org/10.1016/j.beproc.2012.09.006</a>.","mla":"Jesse, Fabienne, and Katharina Riebel. “Social Facilitation of Male Song by Male and Female Conspecifics in the Zebra Finch, Taeniopygia Guttata.” <i>Behavioural Processes</i>, vol. 91, no. 3, Elsevier, 2012, pp. 262–66, doi:<a href=\"https://doi.org/10.1016/j.beproc.2012.09.006\">10.1016/j.beproc.2012.09.006</a>.","short":"F. Jesse, K. Riebel, Behavioural Processes 91 (2012) 262–266."},"date_updated":"2021-01-12T07:40:06Z","quality_controlled":"1","department":[{"_id":"JoBo"}],"title":"Social facilitation of male song by male and female conspecifics in the zebra finch, Taeniopygia guttata","volume":91,"publisher":"Elsevier","date_published":"2012-11-01T00:00:00Z","language":[{"iso":"eng"}],"issue":"3","abstract":[{"lang":"eng","text":"Zebra finches are an ubiquitous model system for the study of vocal learning in animal communication. Their song has been well described, but its possible function(s) in social communication are only partly understood. The so-called ‘directed song’ is a high-intensity, high-performance song given during courtship in close proximity to the female, which is known to mediate mate choice and mating. However, this singing mode constitutes only a fraction of zebra finch males’ prolific song output. Potential communicative functions of their second, ‘undirected’ singing mode remain unresolved in the face of contradicting reports of both facilitating and inhibiting effects of social company on singing. We addressed this issue by experimentally manipulating social contexts in a within-subject design, comparing a solo versus male or female only company condition, each lasting for 24 hours. Males’ total song output was significantly higher when a conspecific was in audible and visible distance than when they were alone. Male and female company had an equally facilitating effect on song output. Our findings thus indicate that singing motivation is facilitated rather than inhibited by social company, suggesting that singing in zebra finches might function both in inter- and intrasexual communication. "}],"month":"11","publication_status":"published","status":"public","day":"01","year":"2012","doi":"10.1016/j.beproc.2012.09.006","page":"262 - 266","_id":"2963","type":"journal_article","date_created":"2018-12-11T12:00:35Z","publication":"Behavioural Processes","intvolume":"        91","publist_id":"3756"},{"type":"dissertation","_id":"2964","date_created":"2018-12-11T12:00:35Z","page":"65","year":"2012","publication_identifier":{"issn":["2663-337X"]},"day":"01","status":"public","supervisor":[{"orcid":"0000-0001-5001-4804","first_name":"Peter M","last_name":"Jonas","full_name":"Jonas, Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87"}],"related_material":{"record":[{"relation":"part_of_dissertation","id":"3258","status":"public"}]},"publist_id":"3755","oa_version":"None","citation":{"mla":"Kim, Sooyun. <i>Active Properties of Hippocampal CA3 Pyramidal Neuron Dendrites</i>. Institute of Science and Technology Austria, 2012.","short":"S. Kim, Active Properties of Hippocampal CA3 Pyramidal Neuron Dendrites, Institute of Science and Technology Austria, 2012.","ieee":"S. Kim, “Active properties of hippocampal CA3 pyramidal neuron dendrites,” Institute of Science and Technology Austria, 2012.","apa":"Kim, S. (2012). <i>Active properties of hippocampal CA3 pyramidal neuron dendrites</i>. Institute of Science and Technology Austria.","ama":"Kim S. Active properties of hippocampal CA3 pyramidal neuron dendrites. 2012.","chicago":"Kim, Sooyun. “Active Properties of Hippocampal CA3 Pyramidal Neuron Dendrites.” Institute of Science and Technology Austria, 2012.","ista":"Kim S. 2012. Active properties of hippocampal CA3 pyramidal neuron dendrites. Institute of Science and Technology Austria."},"department":[{"_id":"PeJo"},{"_id":"GradSch"}],"date_updated":"2023-09-07T11:43:51Z","alternative_title":["ISTA Thesis"],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","author":[{"first_name":"Sooyun","last_name":"Kim","full_name":"Kim, Sooyun","id":"394AB1C8-F248-11E8-B48F-1D18A9856A87"}],"degree_awarded":"PhD","month":"06","publication_status":"published","abstract":[{"text":"CA3 pyramidal neurons are important for memory formation and pattern completion in the hippocampal network. These neurons receive multiple excitatory inputs from numerous sources. Therefore, the rules of spatiotemporal integration of multiple synaptic inputs and propagation of action potentials are important to understand how CA3 neurons contribute to higher brain functions at cellular level. By using confocally targeted patch-clamp recording techniques, we investigated the biophysical properties of rat CA3 pyramidal neuron dendrites. We found two distinct dendritic domains critical for action potential initiation and propagation: In the proximal domain, action potentials initiated in the axon backpropagate actively with large amplitude and fast time course. In the distal domain, Na+-channel mediated dendritic spikes are efficiently evoked by local dendritic depolarization or waveforms mimicking synaptic events. These findings can be explained by a high Na+-to-K+ conductance density ratio of CA3 pyramidal neuron dendrites. The results challenge the prevailing view that proximal mossy fiber inputs activate CA3 pyramidal neurons more efficiently than distal perforant inputs by showing that the distal synapses trigger a different form of activity represented by dendritic spikes. The high probability of dendritic spike initiation in the distal area may enhance the computational power of CA3 pyramidal neurons in the hippocampal network.  ","lang":"eng"}],"title":"Active properties of hippocampal CA3 pyramidal neuron dendrites","article_processing_charge":"No","date_published":"2012-06-01T00:00:00Z","language":[{"iso":"eng"}],"publisher":"Institute of Science and Technology Austria"},{"publist_id":"3754","intvolume":"        65","publication":"Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen & Bibliothekare","scopus_import":1,"year":"2012","page":"200 - 212","day":"01","oa":1,"date_published":"2012-09-01T00:00:00Z","file_date_updated":"2020-07-14T12:45:57Z","publisher":"VÖB","title":"Kontext Open Access: Creative Commons","publication_status":"published","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"}],"ddc":["020"],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"department":[{"_id":"E-Lib"}],"date_updated":"2021-01-12T07:40:07Z","citation":{"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.","ama":"Danowski P. Kontext Open Access: Creative Commons. <i>Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen &#38; Bibliothekare</i>. 2012;65(2):200-212.","chicago":"Danowski, Patrick. “Kontext Open Access: Creative Commons.” <i>Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen &#38; Bibliothekare</i>. VÖB, 2012.","ista":"Danowski P. 2012. Kontext Open Access: Creative Commons. Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen &#38; Bibliothekare. 65(2), 200–212.","apa":"Danowski, P. (2012). Kontext Open Access: Creative Commons. <i>Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen &#38; Bibliothekare</i>. VÖB.","short":"P. Danowski, Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen &#38; Bibliothekare 65 (2012) 200–212.","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."},"pubrep_id":"95","status":"public","main_file_link":[{"url":" http://hdl.handle.net/10760/17625","open_access":"1"}],"date_created":"2018-12-11T12:00:35Z","type":"journal_article","_id":"2965","language":[{"iso":"ger"}],"volume":65,"month":"09","has_accepted_license":"1","file":[{"date_updated":"2020-07-14T12:45:57Z","date_created":"2018-12-12T10:08:42Z","content_type":"application/pdf","file_name":"IST-2012-95-v1+1_sp-beitrag_danowski_kontext_open_access_creative_commons.pdf","relation":"main_file","file_size":503345,"access_level":"open_access","creator":"system","checksum":"162eea47d9d840c26b496ba6ae4d1c09","file_id":"4703"}],"issue":"2","author":[{"full_name":"Danowski, Patrick","id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6026-4409","first_name":"Patrick","last_name":"Danowski"}],"popular_science":"1","oa_version":"Published Version"},{"_id":"2966","type":"journal_article","date_created":"2018-12-11T12:00:35Z","status":"public","pubrep_id":"94","oa_version":"Published Version","quality_controlled":"1","author":[{"orcid":"0000-0002-2193-3868","first_name":"Sylvia","last_name":"Cremer","full_name":"Cremer, Sylvia","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Masaki","last_name":"Suefuji","full_name":"Suefuji, Masaki"},{"full_name":"Schrempf, Alexandra","first_name":"Alexandra","last_name":"Schrempf"},{"first_name":"Jürgen","last_name":"Heinze","full_name":"Heinze, Jürgen"}],"file":[{"checksum":"03d004bdff3724fb1627e3f5004bad80","file_id":"4706","creator":"system","access_level":"open_access","file_size":489994,"relation":"main_file","file_name":"IST-2012-94-v1+1_1472-6785-12-7.pdf","content_type":"application/pdf","date_created":"2018-12-12T10:08:44Z","date_updated":"2020-07-14T12:45:57Z"}],"article_number":"7","has_accepted_license":"1","month":"06","volume":12,"language":[{"iso":"eng"}],"oa":1,"day":"15","doi":"10.1186/1472-6785-12-7","year":"2012","scopus_import":1,"publication":"BMC Ecology","publist_id":"3753","intvolume":"        12","citation":{"short":"S. Cremer, M. Suefuji, A. Schrempf, J. Heinze, BMC Ecology 12 (2012).","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>.","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>","ista":"Cremer S, Suefuji M, Schrempf A, Heinze J. 2012. The dynamics of male-male competition in Cardiocondyla obscurior ants. BMC Ecology. 12, 7.","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>.","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>","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."},"department":[{"_id":"SyCr"}],"date_updated":"2021-01-12T07:40:07Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"ddc":["570"],"publication_status":"published","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."}],"title":"The dynamics of male-male competition in Cardiocondyla obscurior ants","publisher":"BioMed Central","date_published":"2012-06-15T00:00:00Z","file_date_updated":"2020-07-14T12:45:57Z"},{"intvolume":"        13","publist_id":"3748","publication":"ACM Transactions on Computational Logic (TOCL)","related_material":{"record":[{"status":"public","id":"4403","relation":"earlier_version"}]},"scopus_import":1,"acknowledgement":"This research was supported in part by the NSF Cybertrust award CNS 0524059, by the European Research Council (ERC) Advanced Investigator Grant QUAREM, and by the Austrian Science Fund (FWF) project S11402-N23.","year":"2012","doi":"10.1145/2287718.2287727","day":"01","publisher":"ACM","date_published":"2012-08-01T00:00:00Z","title":"Algorithmic analysis of array-accessing programs","abstract":[{"lang":"eng","text":"For programs whose data variables range over Boolean or finite domains, program verification is decidable, and this forms the basis of recent tools for software model checking. In this article, we consider algorithmic verification of programs that use Boolean variables, and in addition, access a single read-only array whose length is potentially unbounded, and whose elements range over an unbounded data domain. We show that the reachability problem, while undecidable in general, is (1) PSPACE-complete for programs in which the array-accessing for-loops are not nested, (2) decidable for a restricted class of programs with doubly nested loops. The second result establishes connections to automata and logics defining languages over data words."}],"publication_status":"published","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-02-23T12:09:43Z","department":[{"_id":"ToHe"}],"citation":{"mla":"Alur, Rajeev, et al. “Algorithmic Analysis of Array-Accessing Programs.” <i>ACM Transactions on Computational Logic (TOCL)</i>, vol. 13, no. 3, 27, ACM, 2012, doi:<a href=\"https://doi.org/10.1145/2287718.2287727\">10.1145/2287718.2287727</a>.","short":"R. Alur, P. Cerny, S. Weinstein, ACM Transactions on Computational Logic (TOCL) 13 (2012).","ieee":"R. Alur, P. Cerny, and S. Weinstein, “Algorithmic analysis of array-accessing programs,” <i>ACM Transactions on Computational Logic (TOCL)</i>, vol. 13, no. 3. ACM, 2012.","apa":"Alur, R., Cerny, P., &#38; Weinstein, S. (2012). Algorithmic analysis of array-accessing programs. <i>ACM Transactions on Computational Logic (TOCL)</i>. ACM. <a href=\"https://doi.org/10.1145/2287718.2287727\">https://doi.org/10.1145/2287718.2287727</a>","ama":"Alur R, Cerny P, Weinstein S. Algorithmic analysis of array-accessing programs. <i>ACM Transactions on Computational Logic (TOCL)</i>. 2012;13(3). doi:<a href=\"https://doi.org/10.1145/2287718.2287727\">10.1145/2287718.2287727</a>","ista":"Alur R, Cerny P, Weinstein S. 2012. Algorithmic analysis of array-accessing programs. ACM Transactions on Computational Logic (TOCL). 13(3), 27.","chicago":"Alur, Rajeev, Pavol Cerny, and Scott Weinstein. “Algorithmic Analysis of Array-Accessing Programs.” <i>ACM Transactions on Computational Logic (TOCL)</i>. ACM, 2012. <a href=\"https://doi.org/10.1145/2287718.2287727\">https://doi.org/10.1145/2287718.2287727</a>."},"ec_funded":1,"status":"public","date_created":"2018-12-11T12:00:36Z","_id":"2967","type":"journal_article","language":[{"iso":"eng"}],"volume":13,"month":"08","issue":"3","article_number":"27","author":[{"full_name":"Alur, Rajeev","last_name":"Alur","first_name":"Rajeev"},{"first_name":"Pavol","last_name":"Cerny","full_name":"Cerny, Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Scott","last_name":"Weinstein","full_name":"Weinstein, Scott"}],"quality_controlled":"1","project":[{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","name":"Quantitative Reactive Modeling"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"oa_version":"None"},{"pubrep_id":"296","ec_funded":1,"date_created":"2018-12-11T12:00:36Z","type":"journal_article","_id":"2968","status":"public","has_accepted_license":"1","month":"09","file":[{"relation":"main_file","file_id":"5304","checksum":"c14ee4cb2a8ba9575bfd8a9bb7a883bb","creator":"system","access_level":"open_access","file_size":235820,"content_type":"application/pdf","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"},{"date_updated":"2020-07-14T12:45:57Z","date_created":"2018-12-12T10:17:48Z","content_type":"application/pdf","file_name":"IST-2014-296-v1+2_4_wasps_Supporting2.pdf","relation":"main_file","file_size":41975,"access_level":"open_access","creator":"system","file_id":"5305","checksum":"f00afc5b887c8222014b57375b8caece"}],"issue":"18","language":[{"iso":"eng"}],"volume":21,"project":[{"_id":"25B07788-B435-11E9-9278-68D0E5697425","grant_number":"250152","name":"Limits to selection in biology and in evolutionary computation","call_identifier":"FP7"}],"quality_controlled":"1","oa_version":"Submitted Version","author":[{"last_name":"Lohse","first_name":"Konrad","full_name":"Lohse, Konrad"},{"first_name":"Nicholas H","last_name":"Barton","orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Barton, Nicholas H"},{"full_name":"Melika, George","last_name":"Melika","first_name":"George"},{"first_name":"Graham","last_name":"Stone","full_name":"Stone, Graham"}],"scopus_import":1,"related_material":{"record":[{"relation":"research_data","id":"13075","status":"public"}]},"publist_id":"3746","intvolume":"        21","publication":"Molecular Ecology","oa":1,"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. ","day":"01","year":"2012","doi":"10.1111/j.1365-294X.2012.05700.x","page":"4605 - 4617","publication_status":"published","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."}],"ddc":["570","579"],"date_published":"2012-09-01T00:00:00Z","publisher":"Wiley-Blackwell","file_date_updated":"2020-07-14T12:45:57Z","title":"A likelihood based comparison of population histories in a parasitoid guild","department":[{"_id":"NiBa"}],"date_updated":"2023-05-30T13:07:47Z","citation":{"short":"K. Lohse, N.H. Barton, G. Melika, G. Stone, Molecular Ecology 21 (2012) 4605–4617.","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>.","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.","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.","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>.","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>","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>"},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87"},{"_id":"2969","type":"journal_article","date_created":"2018-12-11T12:00:36Z","status":"public","main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3632771/"}],"oa_version":"Submitted Version","project":[{"name":"Glutamaterge synaptische Übertragung und Plastizität in hippocampalen Mikroschaltkreisen","grant_number":"SFB-TR3-TP10B","_id":"25BDE9A4-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","author":[{"last_name":"Goswami","first_name":"Sarit","full_name":"Goswami, Sarit","id":"3A578F32-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Iancu","last_name":"Bucurenciu","full_name":"Bucurenciu, Iancu"},{"id":"353C1B58-F248-11E8-B48F-1D18A9856A87","full_name":"Jonas, Peter M","first_name":"Peter M","last_name":"Jonas","orcid":"0000-0001-5001-4804"}],"issue":"41","month":"10","volume":32,"language":[{"iso":"eng"}],"oa":1,"page":"14294 - 14304","year":"2012","day":"10","doi":"10.1523/JNEUROSCI.6104-11.2012","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).","scopus_import":1,"publication":"Journal of Neuroscience","intvolume":"        32","publist_id":"3744","citation":{"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>.","short":"S. Goswami, I. Bucurenciu, P.M. Jonas, Journal of Neuroscience 32 (2012) 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.","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>","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>","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.","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>."},"date_updated":"2021-01-12T07:40:08Z","department":[{"_id":"PeJo"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","external_id":{"pmid":["23055500"]},"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"}],"publication_status":"published","title":"Miniature IPSCs in hippocampal granule cells are triggered by voltage-gated Ca^(2+) channels via microdomain coupling","publisher":"Society for Neuroscience","date_published":"2012-10-10T00:00:00Z","pmid":1},{"language":[{"iso":"eng"}],"publisher":"Elsevier","date_published":"2012-12-01T00:00:00Z","title":"Investigating the principles of morphogen gradient formation: from tissues to cells","volume":22,"abstract":[{"lang":"eng","text":"Morphogen gradients regulate the patterning and growth of many tissues, hence a key question is how they are established and maintained during development. Theoretical descriptions have helped to explain how gradient shape is controlled by the rates of morphogen production, spreading and degradation. These effective rates have been measured using fluorescence recovery after photobleaching (FRAP) and photoactivation. To unravel which molecular events determine the effective rates, such tissue-level assays have been combined with genetic analysis, high-resolution assays, and models that take into account interactions with receptors, extracellular components and trafficking. Nevertheless, because of the natural and experimental data variability, and the underlying assumptions of transport models, it remains challenging to conclusively distinguish between cellular mechanisms."}],"month":"12","publication_status":"published","issue":"6","author":[{"full_name":"Kicheva, Anna","id":"3959A2A0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4509-4998","last_name":"Kicheva","first_name":"Anna"},{"last_name":"Bollenbach","first_name":"Mark Tobias","orcid":"0000-0003-4398-476X","id":"3E6DB97A-F248-11E8-B48F-1D18A9856A87","full_name":"Bollenbach, Mark Tobias"},{"full_name":"Wartlick, Ortrud","last_name":"Wartlick","first_name":"Ortrud"},{"full_name":"Julicher, Frank","first_name":"Frank","last_name":"Julicher"},{"full_name":"Gonzalez Gaitan, Marcos","last_name":"Gonzalez Gaitan","first_name":"Marcos"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T07:40:09Z","quality_controlled":"1","department":[{"_id":"ToBo"}],"oa_version":"None","citation":{"short":"A. Kicheva, M.T. Bollenbach, O. Wartlick, F. Julicher, M. Gonzalez Gaitan, Current Opinion in Genetics &#38; Development 22 (2012) 527–532.","mla":"Kicheva, Anna, et al. “Investigating the Principles of Morphogen Gradient Formation: From Tissues to Cells.” <i>Current Opinion in Genetics &#38; Development</i>, vol. 22, no. 6, Elsevier, 2012, pp. 527–32, doi:<a href=\"https://doi.org/10.1016/j.gde.2012.08.004\">10.1016/j.gde.2012.08.004</a>.","ama":"Kicheva A, Bollenbach MT, Wartlick O, Julicher F, Gonzalez Gaitan M. Investigating the principles of morphogen gradient formation: from tissues to cells. <i>Current Opinion in Genetics &#38; Development</i>. 2012;22(6):527-532. doi:<a href=\"https://doi.org/10.1016/j.gde.2012.08.004\">10.1016/j.gde.2012.08.004</a>","ista":"Kicheva A, Bollenbach MT, Wartlick O, Julicher F, Gonzalez Gaitan M. 2012. Investigating the principles of morphogen gradient formation: from tissues to cells. Current Opinion in Genetics &#38; Development. 22(6), 527–532.","chicago":"Kicheva, Anna, Mark Tobias Bollenbach, Ortrud Wartlick, Frank Julicher, and Marcos Gonzalez Gaitan. “Investigating the Principles of Morphogen Gradient Formation: From Tissues to Cells.” <i>Current Opinion in Genetics &#38; Development</i>. Elsevier, 2012. <a href=\"https://doi.org/10.1016/j.gde.2012.08.004\">https://doi.org/10.1016/j.gde.2012.08.004</a>.","apa":"Kicheva, A., Bollenbach, M. T., Wartlick, O., Julicher, F., &#38; Gonzalez Gaitan, M. (2012). Investigating the principles of morphogen gradient formation: from tissues to cells. <i>Current Opinion in Genetics &#38; Development</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.gde.2012.08.004\">https://doi.org/10.1016/j.gde.2012.08.004</a>","ieee":"A. Kicheva, M. T. Bollenbach, O. Wartlick, F. Julicher, and M. Gonzalez Gaitan, “Investigating the principles of morphogen gradient formation: from tissues to cells,” <i>Current Opinion in Genetics &#38; Development</i>, vol. 22, no. 6. Elsevier, pp. 527–532, 2012."},"intvolume":"        22","publist_id":"3739","publication":"Current Opinion in Genetics & Development","scopus_import":1,"acknowledgement":"AK is currently supported by an MRC CDF. MGG and OW were supported by the Swiss National Science Foundation, grants from the Swiss SystemsX.ch initiative, LipidX-2008/011, an ERC advanced investigator grant and the Polish-Swiss research program.","doi":"10.1016/j.gde.2012.08.004","page":"527 - 532","year":"2012","day":"01","status":"public","date_created":"2018-12-11T12:00:37Z","_id":"2970","type":"journal_article"},{"abstract":[{"lang":"eng","text":"We study the task of interactive semantic labeling of a segmentation hierarchy. To this end we propose a framework interleaving two components: an automatic labeling step, based on a Conditional Random Field whose dependencies are defined by the inclusion tree of the segmentation hierarchy, and an interaction step that integrates incremental input from a human user. Evaluated on two distinct datasets, the proposed interactive approach efficiently integrates human interventions and illustrates the advantages of structured prediction in an interactive framework. "}],"month":"01","publication_status":"published","language":[{"iso":"eng"}],"date_published":"2012-01-01T00:00:00Z","publisher":"Springer","volume":7476,"title":"Interactive labeling of image segmentation hierarchies","date_updated":"2021-01-12T07:40:10Z","quality_controlled":"1","department":[{"_id":"HeEd"}],"citation":{"ieee":"G. Zankl, Y. Haxhimusa, and A. Ion, “Interactive labeling of image segmentation hierarchies,” presented at the Pattern Recognition, Graz, Austria, 2012, vol. 7476, pp. 11–20.","apa":"Zankl, G., Haxhimusa, Y., &#38; Ion, A. (2012). Interactive labeling of image segmentation hierarchies (Vol. 7476, pp. 11–20). Presented at the Pattern Recognition, Graz, Austria: Springer. <a href=\"https://doi.org/10.1007/978-3-642-32717-9_2\">https://doi.org/10.1007/978-3-642-32717-9_2</a>","chicago":"Zankl, Georg, Yll Haxhimusa, and Adrian Ion. “Interactive Labeling of Image Segmentation Hierarchies,” 7476:11–20. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-32717-9_2\">https://doi.org/10.1007/978-3-642-32717-9_2</a>.","ama":"Zankl G, Haxhimusa Y, Ion A. Interactive labeling of image segmentation hierarchies. In: Vol 7476. Springer; 2012:11-20. doi:<a href=\"https://doi.org/10.1007/978-3-642-32717-9_2\">10.1007/978-3-642-32717-9_2</a>","ista":"Zankl G, Haxhimusa Y, Ion A. 2012. Interactive labeling of image segmentation hierarchies. Pattern Recognition vol. 7476, 11–20.","mla":"Zankl, Georg, et al. <i>Interactive Labeling of Image Segmentation Hierarchies</i>. Vol. 7476, Springer, 2012, pp. 11–20, doi:<a href=\"https://doi.org/10.1007/978-3-642-32717-9_2\">10.1007/978-3-642-32717-9_2</a>.","short":"G. Zankl, Y. Haxhimusa, A. Ion, in:, Springer, 2012, pp. 11–20."},"oa_version":"None","author":[{"full_name":"Zankl, Georg","first_name":"Georg","last_name":"Zankl"},{"last_name":"Haxhimusa","first_name":"Yll","full_name":"Haxhimusa, Yll"},{"last_name":"Ion","first_name":"Adrian","id":"29F89302-F248-11E8-B48F-1D18A9856A87","full_name":"Ion, Adrian"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","scopus_import":1,"intvolume":"      7476","publist_id":"3737","conference":{"name":"Pattern Recognition","location":"Graz, Austria","start_date":"2012-08-28","end_date":"2012-08-31"},"date_created":"2018-12-11T12:00:37Z","type":"conference","_id":"2971","page":"11 - 20","status":"public","day":"01","year":"2012","doi":"10.1007/978-3-642-32717-9_2"},{"intvolume":"       458","publist_id":"3736","arxiv":1,"publication":"Theoretical Computer Science","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"3851"}]},"scopus_import":1,"year":"2012","doi":"10.1016/j.tcs.2012.07.038","page":"49 - 60","day":"02","oa":1,"file_date_updated":"2020-07-14T12:45:57Z","date_published":"2012-11-02T00:00:00Z","publisher":"Elsevier","title":"Energy parity games","abstract":[{"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.","lang":"eng"}],"publication_status":"published","ddc":["004"],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","short":"CC BY-NC-ND (4.0)"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["1001.5183"]},"date_updated":"2023-02-23T11:45:29Z","department":[{"_id":"KrCh"}],"citation":{"short":"K. Chatterjee, L. Doyen, Theoretical Computer Science 458 (2012) 49–60.","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>.","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>","ista":"Chatterjee K, Doyen L. 2012. Energy parity games. Theoretical Computer Science. 458, 49–60.","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>","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>.","ieee":"K. Chatterjee and L. Doyen, “Energy parity games,” <i>Theoretical Computer Science</i>, vol. 458. Elsevier, pp. 49–60, 2012."},"ec_funded":1,"pubrep_id":"935","status":"public","date_created":"2018-12-11T12:00:37Z","_id":"2972","type":"journal_article","language":[{"iso":"eng"}],"volume":458,"has_accepted_license":"1","month":"11","file":[{"relation":"main_file","file_size":351271,"access_level":"open_access","creator":"kschuh","checksum":"719e4a5af5a01ad3f2f7f7f05b3c2b09","file_id":"5935","date_updated":"2020-07-14T12:45:57Z","date_created":"2019-02-06T11:56:22Z","content_type":"application/pdf","file_name":"2012_Elsevier_Chatterjee.pdf"}],"author":[{"first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"full_name":"Doyen, Laurent","first_name":"Laurent","last_name":"Doyen"}],"project":[{"call_identifier":"FWF","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","call_identifier":"FP7"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"quality_controlled":"1","oa_version":"Published Version"},{"project":[{"_id":"258C570E-B435-11E9-9278-68D0E5697425","grant_number":"259668","name":"Provable Security for Physical Cryptography","call_identifier":"FP7"}],"oa_version":"Submitted Version","author":[{"full_name":"Jain, Abhishek","last_name":"Jain","first_name":"Abhishek"},{"orcid":"0000-0003-2835-9093","last_name":"Krenn","first_name":"Stephan","full_name":"Krenn, Stephan","id":"329FCCF0-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Pietrzak, Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654","last_name":"Pietrzak","first_name":"Krzysztof Z"},{"full_name":"Tentes, Aris","last_name":"Tentes","first_name":"Aris"}],"month":"12","has_accepted_license":"1","file":[{"date_created":"2018-12-12T10:14:00Z","date_updated":"2020-07-14T12:45:58Z","content_type":"application/pdf","file_name":"IST-2016-721-v1+1_513.pdf","relation":"main_file","access_level":"open_access","file_size":482570,"file_id":"5048","checksum":"ab879537385efc4cb4203e7ef0fea17b","creator":"system"}],"language":[{"iso":"eng"}],"volume":7658,"date_created":"2018-12-11T12:00:38Z","type":"conference","_id":"2974","status":"public","pubrep_id":"721","ec_funded":1,"conference":{"name":"ASIACRYPT: Theory and Application of Cryptology and Information Security","location":"Beijing, China","start_date":"2012-12-02","end_date":"2012-12-06"},"date_updated":"2021-01-12T07:40:11Z","department":[{"_id":"KrPi"}],"citation":{"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.","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>","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>.","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>","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.","short":"A. Jain, S. Krenn, K.Z. Pietrzak, A. Tentes, in:, X. Wang, K. Sako (Eds.), Springer, 2012, pp. 663–680.","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>."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"alternative_title":["LNCS"],"abstract":[{"lang":"eng","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."}],"publication_status":"published","ddc":["004","005"],"file_date_updated":"2020-07-14T12:45:58Z","date_published":"2012-12-01T00:00:00Z","publisher":"Springer","title":"Commitments and efficient zero knowledge proofs from learning parity with noise","oa":1,"acknowledgement":"We are grateful to Petros Mol for helpful discussions on the reduction for the hardness of the xLPN problem.\r\n","day":"01","doi":"10.1007/978-3-642-34961-4_40","year":"2012","page":"663 - 680","editor":[{"full_name":"Wang, Xiaoyun","first_name":"Xiaoyun","last_name":"Wang"},{"full_name":"Sako, Kazue","first_name":"Kazue","last_name":"Sako"}],"scopus_import":1,"intvolume":"      7658","publist_id":"3730"},{"date_created":"2018-12-11T12:01:28Z","type":"journal_article","_id":"3115","status":"public","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1109.2158"}],"month":"12","issue":"4","language":[{"iso":"eng"}],"volume":48,"quality_controlled":"1","oa_version":"Preprint","author":[{"first_name":"Eric","last_name":"Berberich","full_name":"Berberich, Eric"},{"first_name":"Dan","last_name":"Halperin","full_name":"Halperin, Dan"},{"full_name":"Kerber, Michael","id":"36E4574A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8030-9299","first_name":"Michael","last_name":"Kerber"},{"full_name":"Pogalnikova, Roza","last_name":"Pogalnikova","first_name":"Roza"}],"related_material":{"record":[{"status":"public","id":"3329","relation":"earlier_version"}]},"scopus_import":1,"intvolume":"        48","publist_id":"3584","arxiv":1,"publication":"Discrete & Computational Geometry","oa":1,"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","day":"01","doi":"10.1007/s00454-012-9441-5","year":"2012","page":"964 - 989","abstract":[{"lang":"eng","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."}],"publication_status":"published","publisher":"Springer","date_published":"2012-12-01T00:00:00Z","title":"Deconstructing approximate offsets","date_updated":"2023-02-23T11:22:30Z","department":[{"_id":"HeEd"}],"citation":{"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>.","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.","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>","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>.","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>","ista":"Berberich E, Halperin D, Kerber M, Pogalnikova R. 2012. Deconstructing approximate offsets. Discrete &#38; Computational Geometry. 48(4), 964–989."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["1109.2158"]}},{"year":"2012","day":"01","status":"public","doi":"10.1016/j.dam.2012.05.025","page":"2246 - 2258","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1006.1990"}],"oa":1,"date_created":"2018-12-11T12:01:29Z","type":"journal_article","_id":"3117","intvolume":"       160","publist_id":"3582","publication":"Discrete Applied Mathematics","scopus_import":1,"author":[{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Kolmogorov, Vladimir","last_name":"Kolmogorov","first_name":"Vladimir"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T07:41:11Z","quality_controlled":"1","department":[{"_id":"VlKo"}],"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>","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>.","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>","ista":"Kolmogorov V. 2012. Minimizing a sum of submodular functions. Discrete Applied Mathematics. 160(15), 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.","short":"V. Kolmogorov, Discrete Applied Mathematics 160 (2012) 2246–2258.","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>."},"oa_version":"Preprint","date_published":"2012-10-01T00:00:00Z","language":[{"iso":"eng"}],"publisher":"Elsevier","volume":160,"title":"Minimizing a sum of submodular functions","abstract":[{"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.","lang":"eng"}],"publication_status":"published","month":"10","issue":"15"},{"language":[{"iso":"eng"}],"volume":31,"article_processing_charge":"No","month":"07","has_accepted_license":"1","article_number":"53","file":[{"content_type":"application/pdf","date_created":"2018-12-12T10:18:37Z","date_updated":"2020-07-14T12:46:00Z","file_name":"IST-2016-602-v1+1_topoReg.pdf","relation":"main_file","checksum":"1e219c5bf4e5552c1290c62eefa5cd60","file_id":"5359","creator":"system","access_level":"open_access","file_size":44538518}],"issue":"4","author":[{"orcid":"0000-0002-4417-3224","first_name":"Morten","last_name":"Bojsen-Hansen","full_name":"Bojsen-Hansen, Morten","id":"439F0C8C-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Li","first_name":"Hao","full_name":"Li, Hao"},{"first_name":"Christopher J","last_name":"Wojtan","orcid":"0000-0001-6646-5546","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","full_name":"Wojtan, Christopher J"}],"quality_controlled":"1","oa_version":"Submitted Version","pubrep_id":"602","status":"public","date_created":"2018-12-11T12:01:29Z","article_type":"original","type":"journal_article","_id":"3118","date_published":"2012-07-01T00:00:00Z","file_date_updated":"2020-07-14T12:46:00Z","publisher":"ACM","title":"Tracking surfaces with evolving topology","publication_status":"published","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"}],"ddc":["000"],"alternative_title":["SIGGRAPH"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"ChWo"}],"date_updated":"2022-05-24T08:21:11Z","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.","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>","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>","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.","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>.","short":"M. Bojsen-Hansen, H. Li, C. Wojtan, ACM Transactions on Graphics 31 (2012)."},"publist_id":"3581","intvolume":"        31","publication":"ACM Transactions on Graphics","scopus_import":"1","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. ","doi":"10.1145/2185520.2185549","year":"2012","day":"01","oa":1},{"month":"07","has_accepted_license":"1","file":[{"file_name":"IST-2016-600-v1+1_ControllingLiquids_Preprint.pdf","date_updated":"2020-07-14T12:46:00Z","date_created":"2018-12-12T10:11:23Z","content_type":"application/pdf","file_size":4939370,"access_level":"open_access","creator":"system","checksum":"babda64c24cf90a4d05ae86d712bed08","file_id":"4877","relation":"main_file"}],"language":[{"iso":"eng"}],"quality_controlled":"1","oa_version":"Submitted Version","author":[{"last_name":"Raveendran","first_name":"Karthik","full_name":"Raveendran, Karthik"},{"first_name":"Nils","last_name":"Thuerey","full_name":"Thuerey, Nils"},{"first_name":"Christopher J","last_name":"Wojtan","orcid":"0000-0001-6646-5546","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","full_name":"Wojtan, Christopher J"},{"full_name":"Turk, Greg","first_name":"Greg","last_name":"Turk"}],"pubrep_id":"600","conference":{"start_date":"2012-07-29","end_date":"2012-07-31","location":"Aire-la-Ville, Switzerland","name":"SCA: ACM SIGGRAPH/Eurographics Symposium on Computer animation"},"date_created":"2018-12-11T12:01:30Z","type":"conference","_id":"3119","status":"public","abstract":[{"lang":"eng","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"}],"publication_status":"published","ddc":["000"],"date_published":"2012-07-29T00:00:00Z","file_date_updated":"2020-07-14T12:46:00Z","publisher":"ACM","title":"Controlling liquids using meshes","date_updated":"2023-02-23T11:13:07Z","department":[{"_id":"ChWo"}],"citation":{"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.","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.","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.","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.","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.","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.","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."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","related_material":{"link":[{"relation":"table_of_contents","url":"http://dl.acm.org/citation.cfm?id=2422393"}]},"scopus_import":1,"publist_id":"3580","publication":"Proceedings of the ACM SIGGRAPH/Eurographics Symposium on Computer Animation","oa":1,"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.","year":"2012","page":"255 - 264","day":"29"}]