[{"publication_status":"published","language":[{"iso":"eng"}],"ec_funded":1,"volume":32,"issue":"42","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"}],"pmid":1,"oa_version":"Submitted Version","main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3531717/"}],"scopus_import":1,"intvolume":" 32","month":"10","date_updated":"2021-01-12T07:40:03Z","department":[{"_id":"JoCs"}],"_id":"2958","type":"journal_article","status":"public","year":"2012","publication":"Journal of Neuroscience","day":"17","page":"14752 - 14766","date_created":"2018-12-11T12:00:33Z","date_published":"2012-10-17T00:00:00Z","doi":"10.1523/JNEUROSCI.6175-11.2012","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).","oa":1,"publisher":"Society for Neuroscience","quality_controlled":"1","citation":{"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.","chicago":"Allen, Kevin, J Nick Rawlins, David Bannerman, and Jozsef L Csicsvari. “Hippocampal Place Cells Can Encode Multiple Trial-Dependent Features through Rate Remapping.” Journal of Neuroscience. Society for Neuroscience, 2012. https://doi.org/10.1523/JNEUROSCI.6175-11.2012.","ama":"Allen K, Rawlins JN, Bannerman D, Csicsvari JL. Hippocampal place cells can encode multiple trial-dependent features through rate remapping. Journal of Neuroscience. 2012;32(42):14752-14766. doi:10.1523/JNEUROSCI.6175-11.2012","apa":"Allen, K., Rawlins, J. N., Bannerman, D., & Csicsvari, J. L. (2012). Hippocampal place cells can encode multiple trial-dependent features through rate remapping. Journal of Neuroscience. Society for Neuroscience. https://doi.org/10.1523/JNEUROSCI.6175-11.2012","ieee":"K. Allen, J. N. Rawlins, D. Bannerman, and J. L. Csicsvari, “Hippocampal place cells can encode multiple trial-dependent features through rate remapping,” Journal of Neuroscience, vol. 32, no. 42. Society for Neuroscience, pp. 14752–14766, 2012.","short":"K. Allen, J.N. Rawlins, D. Bannerman, J.L. Csicsvari, Journal of Neuroscience 32 (2012) 14752–14766.","mla":"Allen, Kevin, et al. “Hippocampal Place Cells Can Encode Multiple Trial-Dependent Features through Rate Remapping.” Journal of Neuroscience, vol. 32, no. 42, Society for Neuroscience, 2012, pp. 14752–66, doi:10.1523/JNEUROSCI.6175-11.2012."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","external_id":{"pmid":["23077060"]},"publist_id":"3768","author":[{"full_name":"Allen, Kevin","last_name":"Allen","first_name":"Kevin"},{"first_name":"J Nick","last_name":"Rawlins","full_name":"Rawlins, J Nick"},{"full_name":"Bannerman, David","last_name":"Bannerman","first_name":"David"},{"id":"3FA14672-F248-11E8-B48F-1D18A9856A87","first_name":"Jozsef L","full_name":"Csicsvari, Jozsef L","orcid":"0000-0002-5193-4036","last_name":"Csicsvari"}],"title":"Hippocampal place cells can encode multiple trial-dependent features through rate remapping","project":[{"_id":"257A4776-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Memory-related information processing in neuronal circuits of the hippocampus and entorhinal cortex","grant_number":"281511"}]},{"year":"2012","day":"01","publication":"Annals of Statistics","page":"238 - 261","doi":"10.1214/11-AOS957","date_published":"2012-02-01T00:00:00Z","date_created":"2018-12-11T12:00:33Z","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","publisher":"Institute of Mathematical Statistics","quality_controlled":"1","oa":1,"citation":{"chicago":"Uhler, Caroline. “Geometry of Maximum Likelihood Estimation in Gaussian Graphical Models.” Annals of Statistics. Institute of Mathematical Statistics, 2012. https://doi.org/10.1214/11-AOS957.","ista":"Uhler C. 2012. Geometry of maximum likelihood estimation in Gaussian graphical models. Annals of Statistics. 40(1), 238–261.","mla":"Uhler, Caroline. “Geometry of Maximum Likelihood Estimation in Gaussian Graphical Models.” Annals of Statistics, vol. 40, no. 1, Institute of Mathematical Statistics, 2012, pp. 238–61, doi:10.1214/11-AOS957.","ieee":"C. Uhler, “Geometry of maximum likelihood estimation in Gaussian graphical models,” Annals of Statistics, vol. 40, no. 1. Institute of Mathematical Statistics, pp. 238–261, 2012.","short":"C. Uhler, Annals of Statistics 40 (2012) 238–261.","ama":"Uhler C. Geometry of maximum likelihood estimation in Gaussian graphical models. Annals of Statistics. 2012;40(1):238-261. doi:10.1214/11-AOS957","apa":"Uhler, C. (2012). Geometry of maximum likelihood estimation in Gaussian graphical models. Annals of Statistics. Institute of Mathematical Statistics. https://doi.org/10.1214/11-AOS957"},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Caroline","id":"49ADD78E-F248-11E8-B48F-1D18A9856A87","full_name":"Uhler, Caroline","orcid":"0000-0002-7008-0216","last_name":"Uhler"}],"publist_id":"3767","title":"Geometry of maximum likelihood estimation in Gaussian graphical models","publication_status":"published","language":[{"iso":"eng"}],"volume":40,"issue":"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."}],"oa_version":"Preprint","scopus_import":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1012.2643"}],"month":"02","intvolume":" 40","date_updated":"2021-01-12T07:40:04Z","department":[{"_id":"CaUh"}],"_id":"2959","type":"journal_article","status":"public"},{"type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public","pubrep_id":"94","_id":"2966","department":[{"_id":"SyCr"}],"file_date_updated":"2020-07-14T12:45:57Z","date_updated":"2021-01-12T07:40:07Z","ddc":["570"],"scopus_import":1,"month":"06","intvolume":" 12","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 (" ergatoid" ) 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."}],"oa_version":"Published Version","volume":12,"publication_status":"published","file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","checksum":"03d004bdff3724fb1627e3f5004bad80","file_id":"4706","creator":"system","date_updated":"2020-07-14T12:45:57Z","file_size":489994,"date_created":"2018-12-12T10:08:44Z","file_name":"IST-2012-94-v1+1_1472-6785-12-7.pdf"}],"language":[{"iso":"eng"}],"article_number":"7","author":[{"last_name":"Cremer","full_name":"Cremer, Sylvia","orcid":"0000-0002-2193-3868","first_name":"Sylvia","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Suefuji, Masaki","last_name":"Suefuji","first_name":"Masaki"},{"last_name":"Schrempf","full_name":"Schrempf, Alexandra","first_name":"Alexandra"},{"first_name":"Jürgen","full_name":"Heinze, Jürgen","last_name":"Heinze"}],"publist_id":"3753","title":"The dynamics of male-male competition in Cardiocondyla obscurior ants","citation":{"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,” BMC Ecology, vol. 12. BioMed Central, 2012.","ama":"Cremer S, Suefuji M, Schrempf A, Heinze J. The dynamics of male-male competition in Cardiocondyla obscurior ants. BMC Ecology. 2012;12. doi:10.1186/1472-6785-12-7","apa":"Cremer, S., Suefuji, M., Schrempf, A., & Heinze, J. (2012). The dynamics of male-male competition in Cardiocondyla obscurior ants. BMC Ecology. BioMed Central. https://doi.org/10.1186/1472-6785-12-7","mla":"Cremer, Sylvia, et al. “The Dynamics of Male-Male Competition in Cardiocondyla Obscurior Ants.” BMC Ecology, vol. 12, 7, BioMed Central, 2012, doi:10.1186/1472-6785-12-7.","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.” BMC Ecology. BioMed Central, 2012. https://doi.org/10.1186/1472-6785-12-7."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","publisher":"BioMed Central","oa":1,"doi":"10.1186/1472-6785-12-7","date_published":"2012-06-15T00:00:00Z","date_created":"2018-12-11T12:00:35Z","has_accepted_license":"1","year":"2012","day":"15","publication":"BMC Ecology"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Aeschbacher S, Beaumont M, Futschik A. A novel approach for choosing summary statistics in approximate Bayesian computation. Genetics. 2012;192(3):1027-1047. doi:10.1534/genetics.112.143164","apa":"Aeschbacher, S., Beaumont, M., & Futschik, A. (2012). A novel approach for choosing summary statistics in approximate Bayesian computation. Genetics. Genetics Society of America. https://doi.org/10.1534/genetics.112.143164","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,” Genetics, vol. 192, no. 3. Genetics Society of America, pp. 1027–1047, 2012.","mla":"Aeschbacher, Simon, et al. “A Novel Approach for Choosing Summary Statistics in Approximate Bayesian Computation.” Genetics, vol. 192, no. 3, Genetics Society of America, 2012, pp. 1027–47, doi:10.1534/genetics.112.143164.","ista":"Aeschbacher S, Beaumont M, Futschik A. 2012. A novel approach for choosing summary statistics in approximate Bayesian computation. Genetics. 192(3), 1027–1047.","chicago":"Aeschbacher, Simon, Mark Beaumont, and Andreas Futschik. “A Novel Approach for Choosing Summary Statistics in Approximate Bayesian Computation.” Genetics. Genetics Society of America, 2012. https://doi.org/10.1534/genetics.112.143164."},"title":"A novel approach for choosing summary statistics in approximate Bayesian computation","external_id":{"pmid":["22960215"]},"author":[{"first_name":"Simon","id":"2D35326E-F248-11E8-B48F-1D18A9856A87","full_name":"Aeschbacher, Simon","last_name":"Aeschbacher"},{"first_name":"Mark","full_name":"Beaumont, Mark","last_name":"Beaumont"},{"full_name":"Futschik, Andreas","last_name":"Futschik","first_name":"Andreas"}],"publist_id":"3763","oa":1,"quality_controlled":"1","publisher":"Genetics Society of America","publication":"Genetics","day":"01","year":"2012","date_created":"2018-12-11T12:00:34Z","date_published":"2012-11-01T00:00:00Z","doi":"10.1534/genetics.112.143164","page":"1027 - 1047","_id":"2962","status":"public","type":"journal_article","date_updated":"2021-01-12T07:40:05Z","department":[{"_id":"NiBa"}],"oa_version":"Submitted Version","pmid":1,"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"}],"acknowledged_ssus":[{"_id":"ScienComp"}],"intvolume":" 192","month":"11","main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3522150/","open_access":"1"}],"scopus_import":1,"language":[{"iso":"eng"}],"publication_status":"published","volume":192,"issue":"3"},{"citation":{"mla":"Danowski, Patrick. “Kontext Open Access: Creative Commons.” Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen & Bibliothekare, vol. 65, no. 2, VÖB, 2012, pp. 200–12.","short":"P. Danowski, Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen & Bibliothekare 65 (2012) 200–212.","ieee":"P. Danowski, “Kontext Open Access: Creative Commons,” Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen & Bibliothekare, vol. 65, no. 2. VÖB, pp. 200–212, 2012.","apa":"Danowski, P. (2012). Kontext Open Access: Creative Commons. Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen & Bibliothekare. VÖB.","ama":"Danowski P. Kontext Open Access: Creative Commons. Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen & Bibliothekare. 2012;65(2):200-212.","chicago":"Danowski, Patrick. “Kontext Open Access: Creative Commons.” Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen & Bibliothekare. VÖB, 2012.","ista":"Danowski P. 2012. Kontext Open Access: Creative Commons. Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen & Bibliothekare. 65(2), 200–212."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","first_name":"Patrick","last_name":"Danowski","orcid":"0000-0002-6026-4409","full_name":"Danowski, Patrick"}],"publist_id":"3754","title":"Kontext Open Access: Creative Commons","publisher":"VÖB","oa":1,"popular_science":"1","has_accepted_license":"1","year":"2012","day":"01","publication":"Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen & Bibliothekare","page":"200 - 212","date_published":"2012-09-01T00:00:00Z","date_created":"2018-12-11T12:00:35Z","_id":"2965","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public","pubrep_id":"95","date_updated":"2021-01-12T07:40:07Z","ddc":["020"],"file_date_updated":"2020-07-14T12:45:57Z","department":[{"_id":"E-Lib"}],"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"}],"oa_version":"Published Version","scopus_import":1,"main_file_link":[{"open_access":"1","url":" http://hdl.handle.net/10760/17625"}],"month":"09","intvolume":" 65","publication_status":"published","file":[{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_id":"4703","checksum":"162eea47d9d840c26b496ba6ae4d1c09","creator":"system","file_size":503345,"date_updated":"2020-07-14T12:45:57Z","file_name":"IST-2012-95-v1+1_sp-beitrag_danowski_kontext_open_access_creative_commons.pdf","date_created":"2018-12-12T10:08:42Z"}],"language":[{"iso":"ger"}],"volume":65,"issue":"2"},{"status":"public","type":"journal_article","_id":"2963","title":"Social facilitation of male song by male and female conspecifics in the zebra finch, Taeniopygia guttata","department":[{"_id":"JoBo"}],"publist_id":"3756","author":[{"last_name":"Jesse","full_name":"Jesse, Fabienne","id":"4C8C26A4-F248-11E8-B48F-1D18A9856A87","first_name":"Fabienne"},{"full_name":"Riebel, Katharina","last_name":"Riebel","first_name":"Katharina"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Jesse, F., & Riebel, K. (2012). Social facilitation of male song by male and female conspecifics in the zebra finch, Taeniopygia guttata. Behavioural Processes. Elsevier. https://doi.org/10.1016/j.beproc.2012.09.006","ama":"Jesse F, Riebel K. Social facilitation of male song by male and female conspecifics in the zebra finch, Taeniopygia guttata. Behavioural Processes. 2012;91(3):262-266. doi:10.1016/j.beproc.2012.09.006","short":"F. Jesse, K. Riebel, Behavioural Processes 91 (2012) 262–266.","ieee":"F. Jesse and K. Riebel, “Social facilitation of male song by male and female conspecifics in the zebra finch, Taeniopygia guttata,” Behavioural Processes, vol. 91, no. 3. Elsevier, pp. 262–266, 2012.","mla":"Jesse, Fabienne, and Katharina Riebel. “Social Facilitation of Male Song by Male and Female Conspecifics in the Zebra Finch, Taeniopygia Guttata.” Behavioural Processes, vol. 91, no. 3, Elsevier, 2012, pp. 262–66, doi:10.1016/j.beproc.2012.09.006.","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.","chicago":"Jesse, Fabienne, and Katharina Riebel. “Social Facilitation of Male Song by Male and Female Conspecifics in the Zebra Finch, Taeniopygia Guttata.” Behavioural Processes. Elsevier, 2012. https://doi.org/10.1016/j.beproc.2012.09.006."},"date_updated":"2021-01-12T07:40:06Z","intvolume":" 91","month":"11","publisher":"Elsevier","quality_controlled":"1","oa_version":"None","abstract":[{"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. ","lang":"eng"}],"date_created":"2018-12-11T12:00:35Z","doi":"10.1016/j.beproc.2012.09.006","issue":"3","volume":91,"date_published":"2012-11-01T00:00:00Z","page":"262 - 266","language":[{"iso":"eng"}],"publication":"Behavioural Processes","day":"01","year":"2012","publication_status":"published"},{"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Jain, Abhishek, et al. Commitments and Efficient Zero Knowledge Proofs from Learning Parity with Noise. Edited by Xiaoyun Wang and Kazue Sako, vol. 7658, Springer, 2012, pp. 663–80, doi:10.1007/978-3-642-34961-4_40.","short":"A. Jain, S. Krenn, K.Z. Pietrzak, A. Tentes, in:, X. Wang, K. Sako (Eds.), Springer, 2012, pp. 663–680.","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., & Tentes, A. (2012). Commitments and efficient zero knowledge proofs from learning parity with noise. In X. Wang & K. Sako (Eds.) (Vol. 7658, pp. 663–680). Presented at the ASIACRYPT: Theory and Application of Cryptology and Information Security, Beijing, China: Springer. https://doi.org/10.1007/978-3-642-34961-4_40","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:10.1007/978-3-642-34961-4_40","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. https://doi.org/10.1007/978-3-642-34961-4_40.","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."},"editor":[{"first_name":"Xiaoyun","last_name":"Wang","full_name":"Wang, Xiaoyun"},{"first_name":"Kazue","full_name":"Sako, Kazue","last_name":"Sako"}],"title":"Commitments and efficient zero knowledge proofs from learning parity with noise","author":[{"first_name":"Abhishek","last_name":"Jain","full_name":"Jain, Abhishek"},{"orcid":"0000-0003-2835-9093","full_name":"Krenn, Stephan","last_name":"Krenn","id":"329FCCF0-F248-11E8-B48F-1D18A9856A87","first_name":"Stephan"},{"full_name":"Pietrzak, Krzysztof Z","orcid":"0000-0002-9139-1654","last_name":"Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z"},{"first_name":"Aris","full_name":"Tentes, Aris","last_name":"Tentes"}],"publist_id":"3730","project":[{"_id":"258C570E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"259668","name":"Provable Security for Physical Cryptography"}],"day":"01","has_accepted_license":"1","year":"2012","date_published":"2012-12-01T00:00:00Z","doi":"10.1007/978-3-642-34961-4_40","date_created":"2018-12-11T12:00:38Z","page":"663 - 680","acknowledgement":"We are grateful to Petros Mol for helpful discussions on the reduction for the hardness of the xLPN problem.\r\n","publisher":"Springer","oa":1,"ddc":["004","005"],"date_updated":"2021-01-12T07:40:11Z","file_date_updated":"2020-07-14T12:45:58Z","department":[{"_id":"KrPi"}],"_id":"2974","status":"public","pubrep_id":"721","type":"conference","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"conference":{"start_date":"2012-12-02","end_date":"2012-12-06","location":"Beijing, China","name":"ASIACRYPT: Theory and Application of Cryptology and Information Security"},"file":[{"file_id":"5048","checksum":"ab879537385efc4cb4203e7ef0fea17b","access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2018-12-12T10:14:00Z","file_name":"IST-2016-721-v1+1_513.pdf","creator":"system","date_updated":"2020-07-14T12:45:58Z","file_size":482570}],"language":[{"iso":"eng"}],"publication_status":"published","volume":7658,"ec_funded":1,"oa_version":"Submitted Version","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."}],"month":"12","intvolume":" 7658","alternative_title":["LNCS"],"scopus_import":1},{"citation":{"apa":"Goswami, S., Bucurenciu, I., & Jonas, P. M. (2012). Miniature IPSCs in hippocampal granule cells are triggered by voltage-gated Ca^(2+) channels via microdomain coupling. Journal of Neuroscience. Society for Neuroscience. https://doi.org/10.1523/JNEUROSCI.6104-11.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. Journal of Neuroscience. 2012;32(41):14294-14304. doi:10.1523/JNEUROSCI.6104-11.2012","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,” Journal of Neuroscience, vol. 32, no. 41. Society for Neuroscience, pp. 14294–14304, 2012.","short":"S. Goswami, I. Bucurenciu, P.M. Jonas, Journal of Neuroscience 32 (2012) 14294–14304.","mla":"Goswami, Sarit, et al. “Miniature IPSCs in Hippocampal Granule Cells Are Triggered by Voltage-Gated Ca^(2+) Channels via Microdomain Coupling.” Journal of Neuroscience, vol. 32, no. 41, Society for Neuroscience, 2012, pp. 14294–304, doi:10.1523/JNEUROSCI.6104-11.2012.","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.” Journal of Neuroscience. Society for Neuroscience, 2012. https://doi.org/10.1523/JNEUROSCI.6104-11.2012."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Goswami, Sarit","last_name":"Goswami","first_name":"Sarit","id":"3A578F32-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Iancu","last_name":"Bucurenciu","full_name":"Bucurenciu, Iancu"},{"orcid":"0000-0001-5001-4804","full_name":"Jonas, Peter M","last_name":"Jonas","first_name":"Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"3744","external_id":{"pmid":["23055500"]},"title":"Miniature IPSCs in hippocampal granule cells are triggered by voltage-gated Ca^(2+) channels via microdomain coupling","project":[{"_id":"25BDE9A4-B435-11E9-9278-68D0E5697425","name":"Glutamaterge synaptische Übertragung und Plastizität in hippocampalen Mikroschaltkreisen","grant_number":"SFB-TR3-TP10B"}],"year":"2012","day":"10","publication":"Journal of Neuroscience","page":"14294 - 14304","date_published":"2012-10-10T00:00:00Z","doi":"10.1523/JNEUROSCI.6104-11.2012","date_created":"2018-12-11T12:00:36Z","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).","quality_controlled":"1","publisher":"Society for Neuroscience","oa":1,"date_updated":"2021-01-12T07:40:08Z","department":[{"_id":"PeJo"}],"_id":"2969","type":"journal_article","status":"public","publication_status":"published","language":[{"iso":"eng"}],"issue":"41","volume":32,"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"}],"pmid":1,"oa_version":"Submitted Version","scopus_import":1,"main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3632771/","open_access":"1"}],"month":"10","intvolume":" 32"},{"publisher":"Elsevier","quality_controlled":"1","scopus_import":1,"intvolume":" 22","month":"12","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."}],"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.","oa_version":"None","page":"527 - 532","date_created":"2018-12-11T12:00:37Z","doi":"10.1016/j.gde.2012.08.004","issue":"6","volume":22,"date_published":"2012-12-01T00:00:00Z","year":"2012","publication_status":"published","publication":"Current Opinion in Genetics & Development","language":[{"iso":"eng"}],"day":"01","type":"journal_article","status":"public","_id":"2970","author":[{"first_name":"Anna","id":"3959A2A0-F248-11E8-B48F-1D18A9856A87","last_name":"Kicheva","orcid":"0000-0003-4509-4998","full_name":"Kicheva, Anna"},{"first_name":"Mark Tobias","id":"3E6DB97A-F248-11E8-B48F-1D18A9856A87","last_name":"Bollenbach","full_name":"Bollenbach, Mark Tobias","orcid":"0000-0003-4398-476X"},{"first_name":"Ortrud","full_name":"Wartlick, Ortrud","last_name":"Wartlick"},{"last_name":"Julicher","full_name":"Julicher, Frank","first_name":"Frank"},{"first_name":"Marcos","full_name":"Gonzalez Gaitan, Marcos","last_name":"Gonzalez Gaitan"}],"publist_id":"3739","department":[{"_id":"ToBo"}],"title":"Investigating the principles of morphogen gradient formation: from tissues to cells","date_updated":"2021-01-12T07:40:09Z","citation":{"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 & 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.” Current Opinion in Genetics & Development. Elsevier, 2012. https://doi.org/10.1016/j.gde.2012.08.004.","ama":"Kicheva A, Bollenbach MT, Wartlick O, Julicher F, Gonzalez Gaitan M. Investigating the principles of morphogen gradient formation: from tissues to cells. Current Opinion in Genetics & Development. 2012;22(6):527-532. doi:10.1016/j.gde.2012.08.004","apa":"Kicheva, A., Bollenbach, M. T., Wartlick, O., Julicher, F., & Gonzalez Gaitan, M. (2012). Investigating the principles of morphogen gradient formation: from tissues to cells. Current Opinion in Genetics & Development. Elsevier. https://doi.org/10.1016/j.gde.2012.08.004","short":"A. Kicheva, M.T. Bollenbach, O. Wartlick, F. Julicher, M. Gonzalez Gaitan, Current Opinion in Genetics & Development 22 (2012) 527–532.","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,” Current Opinion in Genetics & Development, vol. 22, no. 6. Elsevier, pp. 527–532, 2012.","mla":"Kicheva, Anna, et al. “Investigating the Principles of Morphogen Gradient Formation: From Tissues to Cells.” Current Opinion in Genetics & Development, vol. 22, no. 6, Elsevier, 2012, pp. 527–32, doi:10.1016/j.gde.2012.08.004."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87"},{"month":"01","intvolume":" 7476","scopus_import":1,"quality_controlled":"1","publisher":"Springer","oa_version":"None","abstract":[{"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. ","lang":"eng"}],"doi":"10.1007/978-3-642-32717-9_2","date_published":"2012-01-01T00:00:00Z","volume":7476,"date_created":"2018-12-11T12:00:37Z","page":"11 - 20","day":"01","language":[{"iso":"eng"}],"publication_status":"published","year":"2012","status":"public","type":"conference","conference":{"name":"Pattern Recognition","start_date":"2012-08-28","location":"Graz, Austria","end_date":"2012-08-31"},"_id":"2971","department":[{"_id":"HeEd"}],"title":"Interactive labeling of image segmentation hierarchies","publist_id":"3737","author":[{"first_name":"Georg","full_name":"Zankl, Georg","last_name":"Zankl"},{"first_name":"Yll","last_name":"Haxhimusa","full_name":"Haxhimusa, Yll"},{"last_name":"Ion","full_name":"Ion, Adrian","first_name":"Adrian","id":"29F89302-F248-11E8-B48F-1D18A9856A87"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T07:40:10Z","citation":{"ista":"Zankl G, Haxhimusa Y, Ion A. 2012. Interactive labeling of image segmentation hierarchies. Pattern Recognition vol. 7476, 11–20.","chicago":"Zankl, Georg, Yll Haxhimusa, and Adrian Ion. “Interactive Labeling of Image Segmentation Hierarchies,” 7476:11–20. Springer, 2012. https://doi.org/10.1007/978-3-642-32717-9_2.","apa":"Zankl, G., Haxhimusa, Y., & Ion, A. (2012). Interactive labeling of image segmentation hierarchies (Vol. 7476, pp. 11–20). Presented at the Pattern Recognition, Graz, Austria: Springer. https://doi.org/10.1007/978-3-642-32717-9_2","ama":"Zankl G, Haxhimusa Y, Ion A. Interactive labeling of image segmentation hierarchies. In: Vol 7476. Springer; 2012:11-20. doi:10.1007/978-3-642-32717-9_2","short":"G. Zankl, Y. Haxhimusa, A. Ion, in:, Springer, 2012, pp. 11–20.","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.","mla":"Zankl, Georg, et al. Interactive Labeling of Image Segmentation Hierarchies. Vol. 7476, Springer, 2012, pp. 11–20, doi:10.1007/978-3-642-32717-9_2."}}]