[{"month":"11","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","language":[{"iso":"eng"}],"oa_version":"None","corr_author":"1","department":[{"_id":"JoBo"}],"article_processing_charge":"No","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. "}],"doi":"10.1016/j.beproc.2012.09.006","citation":{"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>.","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>","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.","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.” <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>.","short":"F. Jesse, K. Riebel, Behavioural Processes 91 (2012) 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>"},"title":"Social facilitation of male song by male and female conspecifics in the zebra finch, Taeniopygia guttata","date_updated":"2025-09-30T08:05:37Z","_id":"2963","publisher":"Elsevier","external_id":{"isi":["000311660200007"]},"isi":1,"author":[{"id":"4C8C26A4-F248-11E8-B48F-1D18A9856A87","last_name":"Jesse","first_name":"Fabienne","full_name":"Jesse, Fabienne"},{"last_name":"Riebel","first_name":"Katharina","full_name":"Riebel, Katharina"}],"day":"01","page":"262 - 266","volume":91,"quality_controlled":"1","publist_id":"3756","fulldoi":"https://doi.org/10.1016/j.beproc.2012.09.006","publication_status":"published","publication":"Behavioural Processes","date_created":"2018-12-11T12:00:35Z","date_published":"2012-11-01T00:00:00Z","year":"2012","status":"public","intvolume":"        91","type":"journal_article","issue":"3"},{"date_published":"2012-06-01T00:00:00Z","title":"Active properties of hippocampal CA3 pyramidal neuron dendrites","date_created":"2018-12-11T12:00:35Z","degree_awarded":"PhD","type":"dissertation","_id":"2964","publisher":"Institute of Science and Technology Austria","related_material":{"record":[{"id":"3258","relation":"part_of_dissertation","status":"public"}]},"year":"2012","status":"public","date_updated":"2026-06-18T18:41:53Z","department":[{"_id":"PeJo"},{"_id":"GradSch"}],"corr_author":"1","alternative_title":["ISTA Thesis"],"publist_id":"3755","citation":{"ista":"Kim S. 2012. Active properties of hippocampal CA3 pyramidal neuron dendrites. Institute of Science and Technology Austria.","ieee":"S. Kim, “Active properties of hippocampal CA3 pyramidal neuron dendrites,” Institute of Science and Technology Austria, 2012.","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.","short":"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.","mla":"Kim, Sooyun. <i>Active Properties of Hippocampal CA3 Pyramidal Neuron Dendrites</i>. Institute of Science and Technology Austria, 2012."},"publication_identifier":{"issn":["2663-337X"]},"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"}],"publication_status":"published","article_processing_charge":"No","supervisor":[{"orcid":"0000-0001-5001-4804","last_name":"Jonas","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","full_name":"Jonas, Peter M","first_name":"Peter M"}],"day":"01","author":[{"first_name":"Sooyun","full_name":"Kim, Sooyun","id":"394AB1C8-F248-11E8-B48F-1D18A9856A87","last_name":"Kim"}],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","language":[{"iso":"eng"}],"month":"06","oa_version":"None","page":"65","OA_place":"publisher"},{"type":"journal_article","status":"public","year":"2012","intvolume":"        12","date_published":"2012-06-15T00:00:00Z","oa":1,"date_created":"2018-12-11T12:00:35Z","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publication":"BMC Ecology","fulldoi":"https://doi.org/10.1186/1472-6785-12-7","publication_status":"published","publist_id":"3753","file":[{"creator":"system","file_size":489994,"file_id":"4706","content_type":"application/pdf","date_updated":"2020-07-14T12:45:57Z","relation":"main_file","checksum":"03d004bdff3724fb1627e3f5004bad80","file_name":"IST-2012-94-v1+1_1472-6785-12-7.pdf","date_created":"2018-12-12T10:08:44Z","access_level":"open_access"}],"quality_controlled":"1","volume":12,"license":"https://creativecommons.org/licenses/by/4.0/","day":"15","pubrep_id":"94","isi":1,"author":[{"id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2193-3868","last_name":"Cremer","first_name":"Sylvia","full_name":"Cremer, Sylvia"},{"full_name":"Suefuji, Masaki","first_name":"Masaki","last_name":"Suefuji"},{"full_name":"Schrempf, Alexandra","first_name":"Alexandra","last_name":"Schrempf"},{"last_name":"Heinze","full_name":"Heinze, Jürgen","first_name":"Jürgen"}],"external_id":{"isi":["000307777500001"]},"date_updated":"2025-09-30T08:05:03Z","ddc":["570"],"_id":"2966","publisher":"BioMed Central","title":"The dynamics of male-male competition in Cardiocondyla obscurior ants","abstract":[{"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.","lang":"eng"}],"citation":{"ieee":"S. Cremer, M. Suefuji, A. Schrempf, and J. Heinze, “The dynamics of male-male competition in Cardiocondyla obscurior ants,” <i>BMC Ecology</i>, vol. 12. BioMed Central, 2012.","ista":"Cremer S, Suefuji M, Schrempf A, Heinze J. 2012. The dynamics of male-male competition in Cardiocondyla obscurior ants. BMC Ecology. 12, 7.","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>.","short":"S. Cremer, M. Suefuji, A. Schrempf, J. Heinze, BMC Ecology 12 (2012).","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>","mla":"Cremer, Sylvia, et al. “The Dynamics of Male-Male Competition in Cardiocondyla Obscurior Ants.” <i>BMC Ecology</i>, vol. 12, 7, BioMed Central, 2012, doi:<a href=\"https://doi.org/10.1186/1472-6785-12-7\">10.1186/1472-6785-12-7</a>.","apa":"Cremer, S., Suefuji, M., Schrempf, A., &#38; Heinze, J. (2012). The dynamics of male-male competition in Cardiocondyla obscurior ants. <i>BMC Ecology</i>. BioMed Central. <a href=\"https://doi.org/10.1186/1472-6785-12-7\">https://doi.org/10.1186/1472-6785-12-7</a>"},"doi":"10.1186/1472-6785-12-7","file_date_updated":"2020-07-14T12:45:57Z","article_processing_charge":"No","department":[{"_id":"SyCr"}],"has_accepted_license":"1","corr_author":"1","article_number":"7","oa_version":"Published Version","scopus_import":"1","language":[{"iso":"eng"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","month":"06"},{"volume":21,"quality_controlled":"1","file":[{"checksum":"c14ee4cb2a8ba9575bfd8a9bb7a883bb","date_updated":"2020-07-14T12:45:57Z","relation":"main_file","access_level":"open_access","date_created":"2018-12-12T10:17:47Z","file_name":"IST-2014-296-v1+1_4_wasps_revised3.pdf","file_size":235820,"creator":"system","content_type":"application/pdf","file_id":"5304"},{"creator":"system","file_size":41975,"content_type":"application/pdf","file_id":"5305","checksum":"f00afc5b887c8222014b57375b8caece","relation":"main_file","date_updated":"2020-07-14T12:45:57Z","file_name":"IST-2014-296-v1+2_4_wasps_Supporting2.pdf","access_level":"open_access","date_created":"2018-12-12T10:17:48Z"}],"pubrep_id":"296","day":"01","author":[{"last_name":"Lohse","full_name":"Lohse, Konrad","first_name":"Konrad"},{"last_name":"Barton","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240","first_name":"Nicholas H","full_name":"Barton, Nicholas H"},{"first_name":"George","full_name":"Melika, George","last_name":"Melika"},{"first_name":"Graham","full_name":"Stone, Graham","last_name":"Stone"}],"isi":1,"page":"4605 - 4617","ec_funded":1,"oa":1,"date_published":"2012-09-01T00:00:00Z","date_created":"2018-12-11T12:00:36Z","issue":"18","type":"journal_article","related_material":{"record":[{"relation":"research_data","id":"13075","status":"public"}]},"intvolume":"        21","status":"public","year":"2012","publist_id":"3746","publication":"Molecular Ecology","publication_status":"published","fulldoi":"https://doi.org/10.1111/j.1365-294X.2012.05700.x","project":[{"grant_number":"250152","_id":"25B07788-B435-11E9-9278-68D0E5697425","name":"Limits to selection in biology and in evolutionary computation","call_identifier":"FP7"}],"scopus_import":"1","language":[{"iso":"eng"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","month":"09","oa_version":"Submitted Version","title":"A likelihood based comparison of population histories in a parasitoid guild","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. ","external_id":{"isi":["000308634300016"]},"publisher":"Wiley-Blackwell","_id":"2968","ddc":["570","579"],"date_updated":"2025-09-30T08:04:03Z","has_accepted_license":"1","department":[{"_id":"NiBa"}],"citation":{"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>","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>.","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>","short":"K. Lohse, N.H. Barton, G. Melika, G. Stone, Molecular Ecology 21 (2012) 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>.","ista":"Lohse K, Barton NH, Melika G, Stone G. 2012. A likelihood based comparison of population histories in a parasitoid guild. Molecular Ecology. 21(18), 4605–4617.","ieee":"K. Lohse, N. H. Barton, G. Melika, and G. Stone, “A likelihood based comparison of population histories in a parasitoid guild,” <i>Molecular Ecology</i>, vol. 21, no. 18. Wiley-Blackwell, pp. 4605–4617, 2012."},"doi":"10.1111/j.1365-294X.2012.05700.x","file_date_updated":"2020-07-14T12:45:57Z","abstract":[{"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.","lang":"eng"}],"article_processing_charge":"No"},{"project":[{"grant_number":"SFB-TR3-TP10B","name":"Glutamaterge synaptische Übertragung und Plastizität in hippocampalen Mikroschaltkreisen","_id":"25BDE9A4-B435-11E9-9278-68D0E5697425"}],"scopus_import":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","language":[{"iso":"eng"}],"month":"10","oa_version":"Submitted Version","main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3632771/","open_access":"1"}],"title":"Miniature IPSCs in hippocampal granule cells are triggered by voltage-gated Ca^(2+) channels via microdomain coupling","external_id":{"pmid":["23055500"],"isi":["000309963700030"]},"acknowledgement":"This work was supported by grants from the Deutsche Forschungsgemeinschaft (TR 3/B10, Leibniz program, GSC-4 Spemann Graduate School) and the European Union (European Research Council Advanced Grant).","date_updated":"2025-09-30T08:03:27Z","publisher":"Society for Neuroscience","_id":"2969","department":[{"_id":"PeJo"}],"corr_author":"1","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"}],"citation":{"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>","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>.","ista":"Goswami S, Bucurenciu I, Jonas PM. 2012. Miniature IPSCs in hippocampal granule cells are triggered by voltage-gated Ca^(2+) channels via microdomain coupling. Journal of Neuroscience. 32(41), 14294–14304.","ieee":"S. Goswami, I. Bucurenciu, and P. M. Jonas, “Miniature IPSCs in hippocampal granule cells are triggered by voltage-gated Ca^(2+) channels via microdomain coupling,” <i>Journal of Neuroscience</i>, vol. 32, no. 41. Society for Neuroscience, pp. 14294–14304, 2012.","ama":"Goswami S, Bucurenciu I, Jonas PM. Miniature IPSCs in hippocampal granule cells are triggered by voltage-gated Ca^(2+) channels via microdomain coupling. <i>Journal of Neuroscience</i>. 2012;32(41):14294-14304. doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.6104-11.2012\">10.1523/JNEUROSCI.6104-11.2012</a>","chicago":"Goswami, Sarit, Iancu Bucurenciu, and Peter M Jonas. “Miniature IPSCs in Hippocampal Granule Cells Are Triggered by Voltage-Gated Ca^(2+) Channels via Microdomain Coupling.” <i>Journal of Neuroscience</i>. Society for Neuroscience, 2012. <a href=\"https://doi.org/10.1523/JNEUROSCI.6104-11.2012\">https://doi.org/10.1523/JNEUROSCI.6104-11.2012</a>.","short":"S. Goswami, I. Bucurenciu, P.M. Jonas, Journal of Neuroscience 32 (2012) 14294–14304."},"doi":"10.1523/JNEUROSCI.6104-11.2012","article_processing_charge":"No","volume":32,"quality_controlled":"1","pmid":1,"day":"10","isi":1,"author":[{"last_name":"Goswami","id":"3A578F32-F248-11E8-B48F-1D18A9856A87","full_name":"Goswami, Sarit","first_name":"Sarit"},{"last_name":"Bucurenciu","full_name":"Bucurenciu, Iancu","first_name":"Iancu"},{"id":"353C1B58-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5001-4804","last_name":"Jonas","first_name":"Peter M","full_name":"Jonas, Peter M"}],"page":"14294 - 14304","date_published":"2012-10-10T00:00:00Z","oa":1,"date_created":"2018-12-11T12:00:36Z","type":"journal_article","issue":"41","year":"2012","status":"public","intvolume":"        32","publist_id":"3744","publication":"Journal of Neuroscience","fulldoi":"https://doi.org/10.1523/JNEUROSCI.6104-11.2012","publication_status":"published"},{"intvolume":"        22","year":"2012","status":"public","issue":"6","type":"journal_article","date_created":"2018-12-11T12:00:37Z","date_published":"2012-12-01T00:00:00Z","publication_status":"published","fulldoi":"https://doi.org/10.1016/j.gde.2012.08.004","publication":"Current Opinion in Genetics & Development","publist_id":"3739","quality_controlled":"1","volume":22,"page":"527 - 532","author":[{"first_name":"Anna","full_name":"Kicheva, Anna","last_name":"Kicheva","id":"3959A2A0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4509-4998"},{"first_name":"Mark Tobias","full_name":"Bollenbach, Mark Tobias","orcid":"0000-0003-4398-476X","id":"3E6DB97A-F248-11E8-B48F-1D18A9856A87","last_name":"Bollenbach"},{"last_name":"Wartlick","first_name":"Ortrud","full_name":"Wartlick, Ortrud"},{"last_name":"Julicher","first_name":"Frank","full_name":"Julicher, Frank"},{"full_name":"Gonzalez Gaitan, Marcos","first_name":"Marcos","last_name":"Gonzalez Gaitan"}],"isi":1,"day":"01","publisher":"Elsevier","_id":"2970","date_updated":"2025-09-30T08:02:58Z","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.","external_id":{"isi":["000314490300002"]},"title":"Investigating the principles of morphogen gradient formation: from tissues to cells","article_processing_charge":"No","doi":"10.1016/j.gde.2012.08.004","citation":{"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>","short":"A. Kicheva, M.T. Bollenbach, O. Wartlick, F. Julicher, M. Gonzalez Gaitan, Current Opinion in Genetics &#38; Development 22 (2012) 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>.","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.","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.","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>","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>."},"abstract":[{"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.","lang":"eng"}],"department":[{"_id":"ToBo"}],"oa_version":"None","language":[{"iso":"eng"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","month":"12","scopus_import":"1"},{"scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"08","language":[{"iso":"eng"}],"oa_version":"None","department":[{"_id":"HeEd"}],"alternative_title":["LNCS"],"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"}],"publication_identifier":{"eisbn":["9783642327179"],"eissn":["1611-3349"]},"doi":"10.1007/978-3-642-32717-9_2","citation":{"apa":"Zankl, G., Haxhimusa, Y., &#38; Ion, A. (2012). Interactive labeling of image segmentation hierarchies. In <i>34th DAGM and 36th OAGM Symposium</i> (Vol. 7476, pp. 11–20). 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>","mla":"Zankl, Georg, et al. “Interactive Labeling of Image Segmentation Hierarchies.” <i>34th DAGM and 36th OAGM Symposium</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>.","ista":"Zankl G, Haxhimusa Y, Ion A. 2012. Interactive labeling of image segmentation hierarchies. 34th DAGM and 36th OAGM Symposium. Pattern Recognition, LNCS, vol. 7476, 11–20.","ieee":"G. Zankl, Y. Haxhimusa, and A. Ion, “Interactive labeling of image segmentation hierarchies,” in <i>34th DAGM and 36th OAGM Symposium</i>, Graz, Austria, 2012, vol. 7476, pp. 11–20.","ama":"Zankl G, Haxhimusa Y, Ion A. Interactive labeling of image segmentation hierarchies. In: <i>34th DAGM and 36th OAGM Symposium</i>. 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>","chicago":"Zankl, Georg, Yll Haxhimusa, and Adrian Ion. “Interactive Labeling of Image Segmentation Hierarchies.” In <i>34th DAGM and 36th OAGM Symposium</i>, 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>.","short":"G. Zankl, Y. Haxhimusa, A. Ion, in:, 34th DAGM and 36th OAGM Symposium, Springer, 2012, pp. 11–20."},"article_processing_charge":"No","title":"Interactive labeling of image segmentation hierarchies","date_updated":"2025-05-20T07:21:42Z","publisher":"Springer","_id":"2971","day":"01","author":[{"last_name":"Zankl","first_name":"Georg","full_name":"Zankl, Georg"},{"full_name":"Haxhimusa, Yll","first_name":"Yll","last_name":"Haxhimusa"},{"id":"29F89302-F248-11E8-B48F-1D18A9856A87","last_name":"Ion","full_name":"Ion, Adrian","first_name":"Adrian"}],"page":"11 - 20","volume":7476,"quality_controlled":"1","OA_type":"closed access","publist_id":"3737","conference":{"name":"Pattern Recognition","end_date":"2012-08-31","start_date":"2012-08-28","location":"Graz, Austria"},"publication":"34th DAGM and 36th OAGM Symposium","fulldoi":"https://doi.org/10.1007/978-3-642-32717-9_2","publication_status":"published","date_published":"2012-08-01T00:00:00Z","date_created":"2018-12-11T12:00:37Z","type":"conference","status":"public","year":"2012","intvolume":"      7476"},{"ec_funded":1,"license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","page":"49 - 60","author":[{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"last_name":"Doyen","full_name":"Doyen, Laurent","first_name":"Laurent"}],"isi":1,"pubrep_id":"935","day":"02","quality_controlled":"1","file":[{"content_type":"application/pdf","file_id":"5935","file_size":351271,"creator":"kschuh","access_level":"open_access","date_created":"2019-02-06T11:56:22Z","file_name":"2012_Elsevier_Chatterjee.pdf","checksum":"719e4a5af5a01ad3f2f7f7f05b3c2b09","relation":"main_file","date_updated":"2020-07-14T12:45:57Z"}],"volume":458,"publication_status":"published","arxiv":1,"fulldoi":"https://doi.org/10.1016/j.tcs.2012.07.038","publication":"Theoretical Computer Science","tmp":{"image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"publist_id":"3736","intvolume":"       458","related_material":{"record":[{"status":"public","id":"3851","relation":"earlier_version"}]},"status":"public","year":"2012","type":"journal_article","date_created":"2018-12-11T12:00:37Z","oa":1,"date_published":"2012-11-02T00:00:00Z","oa_version":"Published Version","language":[{"iso":"eng"}],"month":"11","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","scopus_import":"1","project":[{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"grant_number":"279307","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"article_processing_charge":"No","doi":"10.1016/j.tcs.2012.07.038","file_date_updated":"2020-07-14T12:45:57Z","citation":{"ista":"Chatterjee K, Doyen L. 2012. Energy parity games. Theoretical Computer Science. 458, 49–60.","ieee":"K. Chatterjee and L. Doyen, “Energy parity games,” <i>Theoretical Computer Science</i>, vol. 458. Elsevier, pp. 49–60, 2012.","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>.","short":"K. Chatterjee, L. Doyen, Theoretical Computer Science 458 (2012) 49–60.","apa":"Chatterjee, K., &#38; Doyen, L. (2012). Energy parity games. <i>Theoretical Computer Science</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.tcs.2012.07.038\">https://doi.org/10.1016/j.tcs.2012.07.038</a>","mla":"Chatterjee, Krishnendu, and Laurent Doyen. “Energy Parity Games.” <i>Theoretical Computer Science</i>, vol. 458, Elsevier, 2012, pp. 49–60, doi:<a href=\"https://doi.org/10.1016/j.tcs.2012.07.038\">10.1016/j.tcs.2012.07.038</a>."},"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"}],"has_accepted_license":"1","department":[{"_id":"KrCh"}],"_id":"2972","publisher":"Elsevier","date_updated":"2025-09-30T08:02:20Z","ddc":["004"],"external_id":{"isi":["000310184900003"],"arxiv":["1001.5183"]},"title":"Energy parity games"},{"file":[{"date_updated":"2020-07-14T12:45:58Z","relation":"main_file","checksum":"ab879537385efc4cb4203e7ef0fea17b","file_name":"IST-2016-721-v1+1_513.pdf","date_created":"2018-12-12T10:14:00Z","access_level":"open_access","creator":"system","file_size":482570,"content_type":"application/pdf","file_id":"5048"}],"volume":7658,"editor":[{"last_name":"Wang","first_name":"Xiaoyun","full_name":"Wang, Xiaoyun"},{"last_name":"Sako","first_name":"Kazue","full_name":"Sako, Kazue"}],"ec_funded":1,"page":"663 - 680","author":[{"last_name":"Jain","full_name":"Jain, Abhishek","first_name":"Abhishek"},{"first_name":"Stephan","full_name":"Krenn, Stephan","id":"329FCCF0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2835-9093","last_name":"Krenn"},{"last_name":"Pietrzak","orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","full_name":"Pietrzak, Krzysztof Z","first_name":"Krzysztof Z"},{"last_name":"Tentes","first_name":"Aris","full_name":"Tentes, Aris"}],"day":"01","pubrep_id":"721","status":"public","year":"2012","intvolume":"      7658","type":"conference","date_created":"2018-12-11T12:00:38Z","date_published":"2012-12-01T00:00:00Z","oa":1,"fulldoi":"https://doi.org/10.1007/978-3-642-34961-4_40","publication_status":"published","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publist_id":"3730","conference":{"location":"Beijing, China","end_date":"2012-12-06","name":"ASIACRYPT: Theory and Application of Cryptology and Information Security","start_date":"2012-12-02"},"project":[{"name":"Provable Security for Physical Cryptography","_id":"258C570E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"259668"}],"oa_version":"Submitted Version","month":"12","language":[{"iso":"eng"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","scopus_import":1,"date_updated":"2021-01-12T07:40:11Z","ddc":["004","005"],"publisher":"Springer","_id":"2974","acknowledgement":"We are grateful to Petros Mol for helpful discussions on the reduction for the hardness of the xLPN problem.\r\n","title":"Commitments and efficient zero knowledge proofs from learning parity with noise","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."}],"doi":"10.1007/978-3-642-34961-4_40","file_date_updated":"2020-07-14T12:45:58Z","citation":{"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>.","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>.","short":"A. Jain, S. Krenn, K.Z. Pietrzak, A. Tentes, in:, X. Wang, K. Sako (Eds.), Springer, 2012, pp. 663–680.","ama":"Jain A, Krenn S, Pietrzak KZ, Tentes A. Commitments and efficient zero knowledge proofs from learning parity with noise. In: Wang X, Sako K, eds. Vol 7658. Springer; 2012:663-680. doi:<a href=\"https://doi.org/10.1007/978-3-642-34961-4_40\">10.1007/978-3-642-34961-4_40</a>","ieee":"A. Jain, S. Krenn, K. Z. Pietrzak, and A. Tentes, “Commitments and efficient zero knowledge proofs from learning parity with noise,” presented at the ASIACRYPT: Theory and Application of Cryptology and Information Security, Beijing, China, 2012, vol. 7658, pp. 663–680.","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."},"alternative_title":["LNCS"],"department":[{"_id":"KrPi"}],"has_accepted_license":"1"},{"main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4034762/","open_access":"1"}],"oa_version":"Published Version","month":"09","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","_id":"12198","publisher":"American Association for the Advancement of Science","date_updated":"2025-01-14T12:37:28Z","acknowledgement":"We thank S. Harmer for assistance with the analysis of histone modifications, the BioOptics team at the Vienna Biocenter Campus for sorting sperm and vegetative cell nuclei, K. Slotkin for the LAT52p-amiRNA=GFP plasmid, and G. Drews for the DD45p-GFP transgenic line. This work was partially funded by an NIH grant (GM69415) to R.L.F., NSF grants (MCB-0918821 and IOS-1025890) to R.L.F. and D.Z., a Young Investigator Grant from the Arnold and Mabel Beckman Foundation to D.Z., an Austrian Science Fund (FWF) grant P21389-B03 to H.T., a Ruth L. Kirschstein NIH Predoctoral Fellowship (GM093633) to C.A.I., a Fulbright Scholarship to J.A.R., a fellowship from the Jane Coffin Childs Memorial Fund to A.Z., and a Robert and Colleen Haas Scholarship to D.R. Sequencing data are deposited in GEO (GSE38935).","external_id":{"pmid":["22984074"]},"title":"Active DNA demethylation in plant companion cells reinforces transposon methylation in gametes","article_processing_charge":"No","doi":"10.1126/science.1224839","citation":{"mla":"Ibarra, Christian A., et al. “Active DNA Demethylation in Plant Companion Cells Reinforces Transposon Methylation in Gametes.” <i>Science</i>, vol. 337, no. 6100, American Association for the Advancement of Science, 2012, pp. 1360–64, doi:<a href=\"https://doi.org/10.1126/science.1224839\">10.1126/science.1224839</a>.","apa":"Ibarra, C. A., Feng, X., Schoft, V. K., Hsieh, T.-F., Uzawa, R., Rodrigues, J. A., … Zilberman, D. (2012). Active DNA demethylation in plant companion cells reinforces transposon methylation in gametes. <i>Science</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/science.1224839\">https://doi.org/10.1126/science.1224839</a>","ieee":"C. A. Ibarra <i>et al.</i>, “Active DNA demethylation in plant companion cells reinforces transposon methylation in gametes,” <i>Science</i>, vol. 337, no. 6100. American Association for the Advancement of Science, pp. 1360–1364, 2012.","ista":"Ibarra CA, Feng X, Schoft VK, Hsieh T-F, Uzawa R, Rodrigues JA, Zemach A, Chumak N, Machlicova A, Nishimura T, Rojas D, Fischer RL, Tamaru H, Zilberman D. 2012. Active DNA demethylation in plant companion cells reinforces transposon methylation in gametes. Science. 337(6100), 1360–1364.","short":"C.A. Ibarra, X. Feng, V.K. Schoft, T.-F. Hsieh, R. Uzawa, J.A. Rodrigues, A. Zemach, N. Chumak, A. Machlicova, T. Nishimura, D. Rojas, R.L. Fischer, H. Tamaru, D. Zilberman, Science 337 (2012) 1360–1364.","chicago":"Ibarra, Christian A., Xiaoqi Feng, Vera K. Schoft, Tzung-Fu Hsieh, Rie Uzawa, Jessica A. Rodrigues, Assaf Zemach, et al. “Active DNA Demethylation in Plant Companion Cells Reinforces Transposon Methylation in Gametes.” <i>Science</i>. American Association for the Advancement of Science, 2012. <a href=\"https://doi.org/10.1126/science.1224839\">https://doi.org/10.1126/science.1224839</a>.","ama":"Ibarra CA, Feng X, Schoft VK, et al. Active DNA demethylation in plant companion cells reinforces transposon methylation in gametes. <i>Science</i>. 2012;337(6100):1360-1364. doi:<a href=\"https://doi.org/10.1126/science.1224839\">10.1126/science.1224839</a>"},"publication_identifier":{"eissn":["1095-9203"],"issn":["0036-8075"]},"abstract":[{"lang":"eng","text":"The Arabidopsis thaliana central cell, the companion cell of the egg, undergoes DNA demethylation before fertilization, but the targeting preferences, mechanism, and biological significance of this process remain unclear. Here, we show that active DNA demethylation mediated by the DEMETER DNA glycosylase accounts for all of the demethylation in the central cell and preferentially targets small, AT-rich, and nucleosome-depleted euchromatic transposable elements. The vegetative cell, the companion cell of sperm, also undergoes DEMETER-dependent demethylation of similar sequences, and lack of DEMETER in vegetative cells causes reduced small RNA–directed DNA methylation of transposons in sperm. Our results demonstrate that demethylation in companion cells reinforces transposon methylation in plant gametes and likely contributes to stable silencing of transposable elements across generations."}],"keyword":["Multidisciplinary"],"department":[{"_id":"XiFe"}],"article_type":"original","pmid":1,"quality_controlled":"1","volume":337,"page":"1360-1364","author":[{"full_name":"Ibarra, Christian A.","first_name":"Christian A.","last_name":"Ibarra"},{"first_name":"Xiaoqi","full_name":"Feng, Xiaoqi","id":"e0164712-22ee-11ed-b12a-d80fcdf35958","last_name":"Feng","orcid":"0000-0002-4008-1234"},{"last_name":"Schoft","first_name":"Vera K.","full_name":"Schoft, Vera K."},{"last_name":"Hsieh","first_name":"Tzung-Fu","full_name":"Hsieh, Tzung-Fu"},{"last_name":"Uzawa","first_name":"Rie","full_name":"Uzawa, Rie"},{"full_name":"Rodrigues, Jessica A.","first_name":"Jessica A.","last_name":"Rodrigues"},{"full_name":"Zemach, Assaf","first_name":"Assaf","last_name":"Zemach"},{"last_name":"Chumak","full_name":"Chumak, Nina","first_name":"Nina"},{"full_name":"Machlicova, Adriana","first_name":"Adriana","last_name":"Machlicova"},{"last_name":"Nishimura","first_name":"Toshiro","full_name":"Nishimura, Toshiro"},{"last_name":"Rojas","first_name":"Denisse","full_name":"Rojas, Denisse"},{"full_name":"Fischer, Robert L.","first_name":"Robert L.","last_name":"Fischer"},{"full_name":"Tamaru, Hisashi","first_name":"Hisashi","last_name":"Tamaru"},{"first_name":"Daniel","full_name":"Zilberman, Daniel","orcid":"0000-0002-0123-8649","id":"6973db13-dd5f-11ea-814e-b3e5455e9ed1","last_name":"Zilberman"}],"day":"14","intvolume":"       337","extern":"1","year":"2012","status":"public","issue":"6100","type":"journal_article","date_created":"2023-01-16T09:21:24Z","oa":1,"date_published":"2012-09-14T00:00:00Z","publication_status":"published","fulldoi":"https://doi.org/10.1126/science.1224839","publication":"Science"},{"main_file_link":[{"open_access":"1","url":"https://doi.org/10.5061/dryad.0g0fs"}],"oa_version":"Published Version","license":"https://creativecommons.org/publicdomain/zero/1.0/","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"06","author":[{"last_name":"Lohse","first_name":"Konrad","full_name":"Lohse, Konrad"},{"orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","last_name":"Barton","full_name":"Barton, Nicholas H","first_name":"Nicholas H"},{"last_name":"Stone","full_name":"Stone, Graham","first_name":"Graham"},{"first_name":"George","full_name":"Melika, George","last_name":"Melika"}],"day":"08","year":"2012","status":"public","ddc":["570"],"date_updated":"2025-09-30T08:04:02Z","related_material":{"record":[{"relation":"used_in_publication","status":"public","id":"2968"}]},"_id":"13075","publisher":"Dryad","type":"research_data_reference","date_created":"2023-05-23T17:01:02Z","title":"Data from: A likelihood-based comparison of population histories in a parasitoid guild","date_published":"2012-06-08T00:00:00Z","oa":1,"article_processing_charge":"No","fulldoi":"https://doi.org/10.5061/DRYAD.0G0FS","tmp":{"name":"Creative Commons Public Domain Dedication (CC0 1.0)","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","image":"/images/cc_0.png","short":"CC0 (1.0)"},"abstract":[{"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, C. 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.","lang":"eng"}],"citation":{"mla":"Lohse, Konrad, et al. <i>Data from: A Likelihood-Based Comparison of Population Histories in a Parasitoid Guild</i>. Dryad, 2012, doi:<a href=\"https://doi.org/10.5061/DRYAD.0G0FS\">10.5061/DRYAD.0G0FS</a>.","apa":"Lohse, K., Barton, N. H., Stone, G., &#38; Melika, G. (2012). Data from: A likelihood-based comparison of population histories in a parasitoid guild. Dryad. <a href=\"https://doi.org/10.5061/DRYAD.0G0FS\">https://doi.org/10.5061/DRYAD.0G0FS</a>","short":"K. Lohse, N.H. Barton, G. Stone, G. Melika, (2012).","chicago":"Lohse, Konrad, Nicholas H Barton, Graham Stone, and George Melika. “Data from: A Likelihood-Based Comparison of Population Histories in a Parasitoid Guild.” Dryad, 2012. <a href=\"https://doi.org/10.5061/DRYAD.0G0FS\">https://doi.org/10.5061/DRYAD.0G0FS</a>.","ama":"Lohse K, Barton NH, Stone G, Melika G. Data from: A likelihood-based comparison of population histories in a parasitoid guild. 2012. doi:<a href=\"https://doi.org/10.5061/DRYAD.0G0FS\">10.5061/DRYAD.0G0FS</a>","ieee":"K. Lohse, N. H. Barton, G. Stone, and G. Melika, “Data from: A likelihood-based comparison of population histories in a parasitoid guild.” Dryad, 2012.","ista":"Lohse K, Barton NH, Stone G, Melika G. 2012. Data from: A likelihood-based comparison of population histories in a parasitoid guild, Dryad, <a href=\"https://doi.org/10.5061/DRYAD.0G0FS\">10.5061/DRYAD.0G0FS</a>."},"doi":"10.5061/DRYAD.0G0FS","department":[{"_id":"NiBa"}]},{"article_number":"57","project":[{"grant_number":"267989","call_identifier":"FP7","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"}],"scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"11","language":[{"iso":"eng"}],"oa_version":"Preprint","main_file_link":[{"url":"http://arxiv.org/abs/1109.6926","open_access":"1"}],"title":"Conditional model checking: A technique to pass information between verifiers","external_id":{"arxiv":["1109.6926"]},"acknowledgement":"This  research  was  supported  by  the  Canadian  NSERC grant   RGPIN   341819-07,    the   ERC   Advanced   Grant QUAREM, and the Austrian Science Fund NFN RiSE.","date_updated":"2025-06-11T08:07:37Z","_id":"1384","publisher":"ACM","department":[{"_id":"ToHe"}],"abstract":[{"text":"Software model checking, as an undecidable problem, has three possible outcomes: (1) the program satisfies the specification, (2) the program does not satisfy the specification, and (3) the model checker fails. The third outcome usually manifests itself in a space-out, time-out, or one component of the verification tool giving up; in all of these failing cases, significant computation is performed by the verification tool before the failure, but no result is reported. We propose to reformulate the model-checking problem as follows, in order to have the verification tool report a summary of the performed work even in case of failure: given a program and a specification, the model checker returns a condition Ψ - usually a state predicate - such that the program satisfies the specification under the condition Ψ - that is, as long as the program does not leave the states in which Ψ is satisfied. In our experiments, we investigated as one major application of conditional model checking the sequential combination of model checkers with information passing. We give the condition that one model checker produces, as input to a second conditional model checker, such that the verification problem for the second is restricted to the part of the state space that is not covered by the condition, i.e., the second model checker works on the problems that the first model checker could not solve. Our experiments demonstrate that repeated application of conditional model checkers, passing information from one model checker to the next, can significantly improve the verification results and performance, i.e., we can now verify programs that we could not verify before.","lang":"eng"}],"citation":{"chicago":"Beyer, Dirk, Thomas A Henzinger, Mehmet Keremoglu, and Philipp Wendler. “Conditional Model Checking: A Technique to Pass Information between Verifiers.” In <i>Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering</i>. ACM, 2012. <a href=\"https://doi.org/10.1145/2393596.2393664\">https://doi.org/10.1145/2393596.2393664</a>.","short":"D. Beyer, T.A. Henzinger, M. Keremoglu, P. Wendler, in:, Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering, ACM, 2012.","ama":"Beyer D, Henzinger TA, Keremoglu M, Wendler P. Conditional model checking: A technique to pass information between verifiers. In: <i>Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering</i>. ACM; 2012. doi:<a href=\"https://doi.org/10.1145/2393596.2393664\">10.1145/2393596.2393664</a>","ieee":"D. Beyer, T. A. Henzinger, M. Keremoglu, and P. Wendler, “Conditional model checking: A technique to pass information between verifiers,” in <i>Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering</i>, Cary, NC, USA, 2012.","ista":"Beyer D, Henzinger TA, Keremoglu M, Wendler P. 2012. Conditional model checking: A technique to pass information between verifiers. Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering. FSE: Foundations of Software Engineering, 57.","mla":"Beyer, Dirk, et al. “Conditional Model Checking: A Technique to Pass Information between Verifiers.” <i>Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering</i>, 57, ACM, 2012, doi:<a href=\"https://doi.org/10.1145/2393596.2393664\">10.1145/2393596.2393664</a>.","apa":"Beyer, D., Henzinger, T. A., Keremoglu, M., &#38; Wendler, P. (2012). Conditional model checking: A technique to pass information between verifiers. In <i>Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering</i>. Cary, NC, USA: ACM. <a href=\"https://doi.org/10.1145/2393596.2393664\">https://doi.org/10.1145/2393596.2393664</a>"},"doi":"10.1145/2393596.2393664","article_processing_charge":"No","quality_controlled":"1","day":"01","author":[{"last_name":"Beyer","first_name":"Dirk","full_name":"Beyer, Dirk"},{"first_name":"Thomas A","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000−0002−2985−7724"},{"full_name":"Keremoglu, Mehmet","first_name":"Mehmet","last_name":"Keremoglu"},{"full_name":"Wendler, Philipp","first_name":"Philipp","last_name":"Wendler"}],"ec_funded":1,"date_published":"2012-11-01T00:00:00Z","oa":1,"date_created":"2018-12-11T11:51:42Z","type":"conference","status":"public","year":"2012","conference":{"location":"Cary, NC, USA","start_date":"2012-11-11","end_date":"2012-11-16","name":"FSE: Foundations of Software Engineering"},"publist_id":"5826","publication":"Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering","fulldoi":"https://doi.org/10.1145/2393596.2393664","publication_status":"published","arxiv":1},{"quality_controlled":"1","file":[{"creator":"system","file_size":2693701,"file_id":"5356","content_type":"application/pdf","relation":"main_file","date_updated":"2020-07-14T12:46:35Z","checksum":"195238221c4b0b0f4035f6f6c16ea17c","file_name":"IST-2018-945-v1+1_2012_Schloegl_Review_of.pdf","date_created":"2018-12-12T10:18:34Z","access_level":"open_access"}],"volume":6,"pubrep_id":"945","day":"13","author":[{"full_name":"Tangermann, Michael","first_name":"Michael","last_name":"Tangermann"},{"first_name":"Klaus","full_name":"Müller, Klaus","last_name":"Müller"},{"last_name":"Aertsen","first_name":"Ad","full_name":"Aertsen, Ad"},{"first_name":"Niels","full_name":"Birbaumer, Niels","last_name":"Birbaumer"},{"full_name":"Braun, Christoph","first_name":"Christoph","last_name":"Braun"},{"last_name":"Brunner","full_name":"Brunner, Clemens","first_name":"Clemens"},{"first_name":"Robert","full_name":"Leeb, Robert","last_name":"Leeb"},{"last_name":"Mehring","full_name":"Mehring, Carsten","first_name":"Carsten"},{"last_name":"Miller","full_name":"Miller, Kai","first_name":"Kai"},{"full_name":"Müller Putz, Gernot","first_name":"Gernot","last_name":"Müller Putz"},{"last_name":"Nolte","first_name":"Guido","full_name":"Nolte, Guido"},{"last_name":"Pfurtscheller","first_name":"Gert","full_name":"Pfurtscheller, Gert"},{"last_name":"Preissl","first_name":"Hubert","full_name":"Preissl, Hubert"},{"full_name":"Schalk, Gerwin","first_name":"Gerwin","last_name":"Schalk"},{"orcid":"0000-0002-5621-8100","last_name":"Schlögl","id":"45BF87EE-F248-11E8-B48F-1D18A9856A87","full_name":"Schlögl, Alois","first_name":"Alois"},{"full_name":"Vidaurre, Carmen","first_name":"Carmen","last_name":"Vidaurre"},{"full_name":"Waldert, Stephan","first_name":"Stephan","last_name":"Waldert"},{"last_name":"Blankertz","first_name":"Benjamin","full_name":"Blankertz, Benjamin"}],"isi":1,"type":"journal_article","intvolume":"         6","year":"2012","status":"public","oa":1,"date_published":"2012-07-13T00:00:00Z","date_created":"2018-12-11T11:46:46Z","publication":"Frontiers in Neuroscience","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publication_status":"published","fulldoi":"https://doi.org/10.3389/fnins.2012.00055","publist_id":"7327","article_number":"55","oa_version":"Published Version","scopus_import":"1","month":"07","language":[{"iso":"eng"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","acknowledgement":"The studies were in part or completely supported by the Bundesministerium für Bildung und Forschung (BMBF), Fkz 01IB001A, 01GQ0850, by the German Science Foundation (DFG, contract MU 987/3-2), by the European ICT Programme Projects FP7-224631 and 216886, the World Class University Program through the National Research Foundation of Korea funded by the Ministry of Education, Science, and Technology (Grant R31-10008), the US Army Research Office [W911NF-08-1-0216 (Gerwin Schalk) and W911NF-07-1-0415 (Gerwin Schalk)] and the NIH [EB006356 (Gerwin Schalk) and EB000856 (Gerwin Schalk), the WIN-Kolleg of the Heidelberg Academy of Sciences and Humanities, German Federal Ministry of Education and Research grants 01GQ0420, 01GQ0761, 01GQ0762, and 01GQ0830, German Research Foundation grants 550/B5 and C6, and by a scholarship from the German National Academic Foundation. This paper only reflects the authors’ views and funding agencies are not liable for any use that may be made of the information contained herein.\r\n","external_id":{"isi":["000209165300066"]},"_id":"493","publisher":"Frontiers Research Foundation","date_updated":"2025-09-30T08:35:59Z","ddc":["004"],"title":"Review of the BCI competition IV","doi":"10.3389/fnins.2012.00055","citation":{"ista":"Tangermann M, Müller K, Aertsen A, Birbaumer N, Braun C, Brunner C, Leeb R, Mehring C, Miller K, Müller Putz G, Nolte G, Pfurtscheller G, Preissl H, Schalk G, Schlögl A, Vidaurre C, Waldert S, Blankertz B. 2012. Review of the BCI competition IV. Frontiers in Neuroscience. 6, 55.","ieee":"M. Tangermann <i>et al.</i>, “Review of the BCI competition IV,” <i>Frontiers in Neuroscience</i>, vol. 6. Frontiers Research Foundation, 2012.","ama":"Tangermann M, Müller K, Aertsen A, et al. Review of the BCI competition IV. <i>Frontiers in Neuroscience</i>. 2012;6. doi:<a href=\"https://doi.org/10.3389/fnins.2012.00055\">10.3389/fnins.2012.00055</a>","short":"M. Tangermann, K. Müller, A. Aertsen, N. Birbaumer, C. Braun, C. Brunner, R. Leeb, C. Mehring, K. Miller, G. Müller Putz, G. Nolte, G. Pfurtscheller, H. Preissl, G. Schalk, A. Schlögl, C. Vidaurre, S. Waldert, B. Blankertz, Frontiers in Neuroscience 6 (2012).","chicago":"Tangermann, Michael, Klaus Müller, Ad Aertsen, Niels Birbaumer, Christoph Braun, Clemens Brunner, Robert Leeb, et al. “Review of the BCI Competition IV.” <i>Frontiers in Neuroscience</i>. Frontiers Research Foundation, 2012. <a href=\"https://doi.org/10.3389/fnins.2012.00055\">https://doi.org/10.3389/fnins.2012.00055</a>.","apa":"Tangermann, M., Müller, K., Aertsen, A., Birbaumer, N., Braun, C., Brunner, C., … Blankertz, B. (2012). Review of the BCI competition IV. <i>Frontiers in Neuroscience</i>. Frontiers Research Foundation. <a href=\"https://doi.org/10.3389/fnins.2012.00055\">https://doi.org/10.3389/fnins.2012.00055</a>","mla":"Tangermann, Michael, et al. “Review of the BCI Competition IV.” <i>Frontiers in Neuroscience</i>, vol. 6, 55, Frontiers Research Foundation, 2012, doi:<a href=\"https://doi.org/10.3389/fnins.2012.00055\">10.3389/fnins.2012.00055</a>."},"file_date_updated":"2020-07-14T12:46:35Z","abstract":[{"text":"The BCI competition IV stands in the tradition of prior BCI competitions that aim to provide high quality neuroscientific data for open access to the scientific community. As experienced already in prior competitions not only scientists from the narrow field of BCI compete, but scholars with a broad variety of backgrounds and nationalities. They include high specialists as well as students.The goals of all BCI competitions have always been to challenge with respect to novel paradigms and complex data. We report on the following challenges: (1) asynchronous data, (2) synthetic, (3) multi-class continuous data, (4) sessionto-session transfer, (5) directionally modulated MEG, (6) finger movements recorded by ECoG. As after past competitions, our hope is that winning entries may enhance the analysis methods of future BCIs.","lang":"eng"}],"article_processing_charge":"No","has_accepted_license":"1","department":[{"_id":"ScienComp"},{"_id":"PeJo"}]},{"type":"conference","status":"public","year":"2012","intvolume":"        96","date_published":"2012-10-07T00:00:00Z","oa":1,"date_created":"2018-12-11T11:46:47Z","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publication":"Proceedings GandALF 2012","fulldoi":"https://doi.org/10.4204/EPTCS.96.18","publication_status":"published","conference":{"location":"Napoli, Italy","name":"GandALF: Games, Automata, Logics and Formal Verification","end_date":"2012-09-08","start_date":"2012-09-06"},"publist_id":"7325","file":[{"file_id":"5152","content_type":"application/pdf","creator":"system","file_size":97736,"file_name":"IST-2018-944-v1+1_2012_Rubin_A_Myhill.pdf","date_created":"2018-12-12T10:15:31Z","access_level":"open_access","date_updated":"2020-07-14T12:46:35Z","relation":"main_file","checksum":"56277f95edc9d531fa3bdc5f9579fda8"}],"quality_controlled":"1","volume":96,"page":"238 - 246","ec_funded":1,"day":"07","pubrep_id":"944","author":[{"full_name":"Kruckman, Alex","first_name":"Alex","last_name":"Kruckman"},{"full_name":"Rubin, Sasha","first_name":"Sasha","id":"2EC51194-F248-11E8-B48F-1D18A9856A87","last_name":"Rubin"},{"full_name":"Sheridan, John","first_name":"John","last_name":"Sheridan"},{"full_name":"Zax, Ben","first_name":"Ben","last_name":"Zax"}],"ddc":["004"],"date_updated":"2024-10-09T20:55:00Z","publisher":"Open Publishing Association","_id":"495","title":"A Myhill Nerode theorem for automata with advice","abstract":[{"lang":"eng","text":"An automaton with advice is a finite state automaton which has access to an additional fixed infinite string called an advice tape. We refine the Myhill-Nerode theorem to characterize the languages of finite strings that are accepted by automata with advice. We do the same for tree automata with advice."}],"doi":"10.4204/EPTCS.96.18","file_date_updated":"2020-07-14T12:46:35Z","citation":{"mla":"Kruckman, Alex, et al. “A Myhill Nerode Theorem for Automata with Advice.” <i>Proceedings GandALF 2012</i>, vol. 96, Open Publishing Association, 2012, pp. 238–46, doi:<a href=\"https://doi.org/10.4204/EPTCS.96.18\">10.4204/EPTCS.96.18</a>.","apa":"Kruckman, A., Rubin, S., Sheridan, J., &#38; Zax, B. (2012). A Myhill Nerode theorem for automata with advice. In <i>Proceedings GandALF 2012</i> (Vol. 96, pp. 238–246). Napoli, Italy: Open Publishing Association. <a href=\"https://doi.org/10.4204/EPTCS.96.18\">https://doi.org/10.4204/EPTCS.96.18</a>","ieee":"A. Kruckman, S. Rubin, J. Sheridan, and B. Zax, “A Myhill Nerode theorem for automata with advice,” in <i>Proceedings GandALF 2012</i>, Napoli, Italy, 2012, vol. 96, pp. 238–246.","ista":"Kruckman A, Rubin S, Sheridan J, Zax B. 2012. A Myhill Nerode theorem for automata with advice. Proceedings GandALF 2012. GandALF: Games, Automata, Logics and Formal Verification, EPTCS, vol. 96, 238–246.","short":"A. Kruckman, S. Rubin, J. Sheridan, B. Zax, in:, Proceedings GandALF 2012, Open Publishing Association, 2012, pp. 238–246.","chicago":"Kruckman, Alex, Sasha Rubin, John Sheridan, and Ben Zax. “A Myhill Nerode Theorem for Automata with Advice.” In <i>Proceedings GandALF 2012</i>, 96:238–46. Open Publishing Association, 2012. <a href=\"https://doi.org/10.4204/EPTCS.96.18\">https://doi.org/10.4204/EPTCS.96.18</a>.","ama":"Kruckman A, Rubin S, Sheridan J, Zax B. A Myhill Nerode theorem for automata with advice. In: <i>Proceedings GandALF 2012</i>. Vol 96. Open Publishing Association; 2012:238-246. doi:<a href=\"https://doi.org/10.4204/EPTCS.96.18\">10.4204/EPTCS.96.18</a>"},"department":[{"_id":"KrCh"}],"has_accepted_license":"1","alternative_title":["EPTCS"],"corr_author":"1","project":[{"grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"oa_version":"Published Version","scopus_import":1,"language":[{"iso":"eng"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","month":"10"},{"author":[{"first_name":"Alexander","full_name":"Rabinovich, Alexander","last_name":"Rabinovich"},{"full_name":"Rubin, Sasha","first_name":"Sasha","last_name":"Rubin","id":"2EC51194-F248-11E8-B48F-1D18A9856A87"}],"isi":1,"day":"01","ec_funded":1,"quality_controlled":"1","conference":{"end_date":"2012-06-28","name":"LICS: Logic in Computer Science","start_date":"2012-06-25","location":"Dubrovnik, Croatia"},"publist_id":"7324","publication_status":"published","fulldoi":"https://doi.org/10.1109/LICS.2012.65","date_created":"2018-12-11T11:46:47Z","oa":1,"date_published":"2012-01-01T00:00:00Z","year":"2012","status":"public","type":"conference","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","language":[{"iso":"eng"}],"month":"01","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://arise.or.at/pubpdf/Interpretations_in_Trees_with_Countably_Many_Branches.pdf"}],"oa_version":"Preprint","article_number":"6280474","project":[{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23"}],"alternative_title":["LICS"],"department":[{"_id":"KrCh"}],"article_processing_charge":"No","doi":"10.1109/LICS.2012.65","citation":{"apa":"Rabinovich, A., &#38; Rubin, S. (2012). Interpretations in trees with countably many branches. Presented at the LICS: Logic in Computer Science, Dubrovnik, Croatia: IEEE. <a href=\"https://doi.org/10.1109/LICS.2012.65\">https://doi.org/10.1109/LICS.2012.65</a>","mla":"Rabinovich, Alexander, and Sasha Rubin. <i>Interpretations in Trees with Countably Many Branches</i>. 6280474, IEEE, 2012, doi:<a href=\"https://doi.org/10.1109/LICS.2012.65\">10.1109/LICS.2012.65</a>.","ama":"Rabinovich A, Rubin S. Interpretations in trees with countably many branches. In: IEEE; 2012. doi:<a href=\"https://doi.org/10.1109/LICS.2012.65\">10.1109/LICS.2012.65</a>","chicago":"Rabinovich, Alexander, and Sasha Rubin. “Interpretations in Trees with Countably Many Branches.” IEEE, 2012. <a href=\"https://doi.org/10.1109/LICS.2012.65\">https://doi.org/10.1109/LICS.2012.65</a>.","short":"A. Rabinovich, S. Rubin, in:, IEEE, 2012.","ista":"Rabinovich A, Rubin S. 2012. Interpretations in trees with countably many branches. LICS: Logic in Computer Science, LICS, , 6280474.","ieee":"A. Rabinovich and S. Rubin, “Interpretations in trees with countably many branches,” presented at the LICS: Logic in Computer Science, Dubrovnik, Croatia, 2012."},"abstract":[{"lang":"eng","text":"We study the expressive power of logical interpretations on the class of scattered trees, namely those with countably many infinite branches. Scattered trees can be thought of as the tree analogue of scattered linear orders. Every scattered tree has an ordinal rank that reflects the structure of its infinite branches. We prove, roughly, that trees and orders of large rank cannot be interpreted in scattered trees of small rank. We consider a quite general notion of interpretation: each element of the interpreted structure is represented by a set of tuples of subsets of the interpreting tree. Our trees are countable, not necessarily finitely branching, and may have finitely many unary predicates as labellings. We also show how to replace injective set-interpretations in (not necessarily scattered) trees by 'finitary' set-interpretations."}],"title":"Interpretations in trees with countably many branches","_id":"496","publisher":"IEEE","date_updated":"2025-09-30T08:34:47Z","external_id":{"isi":["000309059900061"]}},{"title":"Faster algorithms for alternating refinement relations","ddc":["004"],"date_updated":"2025-01-14T12:24:50Z","_id":"497","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"KrCh"}],"has_accepted_license":"1","alternative_title":["LIPIcs"],"abstract":[{"lang":"eng","text":"One central issue in the formal design and analysis of reactive systems is the notion of refinement that asks whether all behaviors of the implementation is allowed by the specification. The local interpretation of behavior leads to the notion of simulation. Alternating transition systems (ATSs) provide a general model for composite reactive systems, and the simulation relation for ATSs is known as alternating simulation. The simulation relation for fair transition systems is called fair simulation. In this work our main contributions are as follows: (1) We present an improved algorithm for fair simulation with Büchi fairness constraints; our algorithm requires O(n 3·m) time as compared to the previous known O(n 6)-time algorithm, where n is the number of states and m is the number of transitions. (2) We present a game based algorithm for alternating simulation that requires O(m2)-time as compared to the previous known O((n·m)2)-time algorithm, where n is the number of states and m is the size of transition relation. (3) We present an iterative algorithm for alternating simulation that matches the time complexity of the game based algorithm, but is more space efficient than the game based algorithm. © Krishnendu Chatterjee, Siddhesh Chaubal, and Pritish Kamath."}],"file_date_updated":"2020-07-14T12:46:35Z","citation":{"ieee":"K. Chatterjee, S. Chaubal, and P. Kamath, “Faster algorithms for alternating refinement relations,” presented at the EACSL: European Association for Computer Science Logic, Fontainebleau, France, 2012, vol. 16, pp. 167–182.","ista":"Chatterjee K, Chaubal S, Kamath P. 2012. Faster algorithms for alternating refinement relations. EACSL: European Association for Computer Science Logic, LIPIcs, vol. 16, 167–182.","chicago":"Chatterjee, Krishnendu, Siddhesh Chaubal, and Pritish Kamath. “Faster Algorithms for Alternating Refinement Relations,” 16:167–82. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012. <a href=\"https://doi.org/10.4230/LIPIcs.CSL.2012.167\">https://doi.org/10.4230/LIPIcs.CSL.2012.167</a>.","short":"K. Chatterjee, S. Chaubal, P. Kamath, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012, pp. 167–182.","ama":"Chatterjee K, Chaubal S, Kamath P. Faster algorithms for alternating refinement relations. In: Vol 16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2012:167-182. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CSL.2012.167\">10.4230/LIPIcs.CSL.2012.167</a>","mla":"Chatterjee, Krishnendu, et al. <i>Faster Algorithms for Alternating Refinement Relations</i>. Vol. 16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012, pp. 167–82, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CSL.2012.167\">10.4230/LIPIcs.CSL.2012.167</a>.","apa":"Chatterjee, K., Chaubal, S., &#38; Kamath, P. (2012). Faster algorithms for alternating refinement relations (Vol. 16, pp. 167–182). Presented at the EACSL: European Association for Computer Science Logic, Fontainebleau, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CSL.2012.167\">https://doi.org/10.4230/LIPIcs.CSL.2012.167</a>"},"doi":"10.4230/LIPIcs.CSL.2012.167","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","grant_number":"P 23499-N23"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"scopus_import":1,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","month":"09","language":[{"iso":"eng"}],"oa_version":"Published Version","date_published":"2012-09-01T00:00:00Z","oa":1,"date_created":"2018-12-11T11:46:48Z","type":"conference","year":"2012","status":"public","related_material":{"record":[{"status":"public","id":"5378","relation":"earlier_version"}]},"intvolume":"        16","publist_id":"7323","conference":{"location":"Fontainebleau, France","start_date":"2012-09-03","end_date":"2012-09-06","name":"EACSL: European Association for Computer Science Logic"},"tmp":{"image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"fulldoi":"https://doi.org/10.4230/LIPIcs.CSL.2012.167","publication_status":"published","volume":16,"file":[{"file_id":"4712","content_type":"application/pdf","creator":"system","file_size":471236,"file_name":"IST-2018-943-v1+1_2012_Chatterjee_Faster_Algorithms.pdf","date_created":"2018-12-12T10:08:50Z","access_level":"open_access","relation":"main_file","date_updated":"2020-07-14T12:46:35Z","checksum":"f1b0dd99240800db2d7dbf9b5131fe5e"}],"quality_controlled":"1","day":"01","pubrep_id":"943","author":[{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Chaubal, Siddhesh","first_name":"Siddhesh","last_name":"Chaubal"},{"last_name":"Kamath","full_name":"Kamath, Pritish","first_name":"Pritish"}],"page":"167 - 182","ec_funded":1},{"title":"Predicting local adaptation in fragmented plant populations: Implications for restoration genetics","_id":"498","publisher":"Wiley-Blackwell","ddc":["576"],"date_updated":"2025-09-30T08:33:55Z","acknowledgement":"We thank Graham Pickup, David Steer, Linda Broadhurst, Lan Li and Carole Elliott for technical assistance. The New\r\nSouth Wales Department of Environment and Climate Change, ACT Parks, Conservation and Lands and the\r\nDepartment of Sustainability and Environment in Victoria provided permits for seed and soil collection. We thank\r\nSpencer C. H. Barrett for comments that improved the quality of the manuscript.\r\n","external_id":{"isi":["000312808900013"]},"corr_author":"1","has_accepted_license":"1","department":[{"_id":"NiBa"}],"article_processing_charge":"No","file_date_updated":"2020-07-14T12:46:35Z","citation":{"ista":"Pickup M, Field D, Rowell D, Young A. 2012. Predicting local adaptation in fragmented plant populations: Implications for restoration genetics. Evolutionary Applications. 5(8), 913–924.","ieee":"M. Pickup, D. Field, D. Rowell, and A. Young, “Predicting local adaptation in fragmented plant populations: Implications for restoration genetics,” <i>Evolutionary Applications</i>, vol. 5, no. 8. Wiley-Blackwell, pp. 913–924, 2012.","ama":"Pickup M, Field D, Rowell D, Young A. Predicting local adaptation in fragmented plant populations: Implications for restoration genetics. <i>Evolutionary Applications</i>. 2012;5(8):913-924. doi:<a href=\"https://doi.org/10.1111/j.1752-4571.2012.00284.x\">10.1111/j.1752-4571.2012.00284.x</a>","short":"M. Pickup, D. Field, D. Rowell, A. Young, Evolutionary Applications 5 (2012) 913–924.","chicago":"Pickup, Melinda, David Field, David Rowell, and Andrew Young. “Predicting Local Adaptation in Fragmented Plant Populations: Implications for Restoration Genetics.” <i>Evolutionary Applications</i>. Wiley-Blackwell, 2012. <a href=\"https://doi.org/10.1111/j.1752-4571.2012.00284.x\">https://doi.org/10.1111/j.1752-4571.2012.00284.x</a>.","apa":"Pickup, M., Field, D., Rowell, D., &#38; Young, A. (2012). Predicting local adaptation in fragmented plant populations: Implications for restoration genetics. <i>Evolutionary Applications</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/j.1752-4571.2012.00284.x\">https://doi.org/10.1111/j.1752-4571.2012.00284.x</a>","mla":"Pickup, Melinda, et al. “Predicting Local Adaptation in Fragmented Plant Populations: Implications for Restoration Genetics.” <i>Evolutionary Applications</i>, vol. 5, no. 8, Wiley-Blackwell, 2012, pp. 913–24, doi:<a href=\"https://doi.org/10.1111/j.1752-4571.2012.00284.x\">10.1111/j.1752-4571.2012.00284.x</a>."},"doi":"10.1111/j.1752-4571.2012.00284.x","abstract":[{"text":"Understanding patterns and correlates of local adaptation in heterogeneous landscapes can provide important information in the selection of appropriate seed sources for restoration. We assessed the extent of local adaptation of fitness components in 12 population pairs of the perennial herb Rutidosis leptorrhynchoides (Asteraceae) and examined whether spatial scale (0.7-600 km), environmental distance, quantitative (QST) and neutral (FST) genetic differentiation, and size of the local and foreign populations could predict patterns of adaptive differentiation. Local adaptation varied among populations and fitness components. Including all population pairs, local adaptation was observed for seedling survival, but not for biomass, while foreign genotype advantage was observed for reproduction (number of inflorescences). Among population pairs, local adaptation increased with QST and local population size for biomass. QST was associated with environmental distance, suggesting ecological selection for phenotypic divergence. However, low FST and variation in population structure in small populations demonstrates the interaction of gene flow and drift in constraining local adaptation in R. leptorrhynchoides. Our study indicates that for species in heterogeneous landscapes, collecting seed from large populations from similar environments to candidate sites is likely to provide the most appropriate seed sources for restoration.","lang":"eng"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","month":"12","language":[{"iso":"eng"}],"oa_version":"Published Version","date_created":"2018-12-11T11:46:48Z","oa":1,"date_published":"2012-12-01T00:00:00Z","intvolume":"         5","year":"2012","status":"public","issue":"8","type":"journal_article","publist_id":"7322","publication_status":"published","fulldoi":"https://doi.org/10.1111/j.1752-4571.2012.00284.x","publication":"Evolutionary Applications","tmp":{"image":"/images/cc_by_nc.png","short":"CC BY-NC (4.0)","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode"},"volume":5,"quality_controlled":"1","file":[{"content_type":"application/pdf","file_id":"4821","file_size":396136,"creator":"system","access_level":"open_access","date_created":"2018-12-12T10:10:33Z","file_name":"IST-2018-942-v1+1_Pickup_et_al-2012-Evolutionary_Applications.pdf","checksum":"233007138606aca5a2f75f7ae1742f43","relation":"main_file","date_updated":"2020-07-14T12:46:35Z"}],"author":[{"first_name":"Melinda","full_name":"Pickup, Melinda","last_name":"Pickup","orcid":"0000-0001-6118-0541","id":"2C78037E-F248-11E8-B48F-1D18A9856A87"},{"id":"419049E2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4014-8478","last_name":"Field","first_name":"David","full_name":"Field, David"},{"first_name":"David","full_name":"Rowell, David","last_name":"Rowell"},{"full_name":"Young, Andrew","first_name":"Andrew","last_name":"Young"}],"isi":1,"pubrep_id":"942","day":"01","license":"https://creativecommons.org/licenses/by-nc/4.0/","page":"913 - 924"},{"oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"07","language":[{"iso":"eng"}],"ddc":["000","005"],"date_updated":"2025-09-30T08:08:12Z","_id":"5377","publisher":"IST Austria","title":"Mean-payoff pushdown games","article_processing_charge":"No","publication_identifier":{"issn":["2664-1690"]},"abstract":[{"lang":"eng","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 ω-regular 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 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."}],"doi":"10.15479/AT:IST-2012-0002","citation":{"mla":"Chatterjee, Krishnendu, and Yaron Velner. <i>Mean-Payoff Pushdown Games</i>. IST Austria, 2012, doi:<a href=\"https://doi.org/10.15479/AT:IST-2012-0002\">10.15479/AT:IST-2012-0002</a>.","apa":"Chatterjee, K., &#38; Velner, Y. (2012). <i>Mean-payoff pushdown games</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2012-0002\">https://doi.org/10.15479/AT:IST-2012-0002</a>","chicago":"Chatterjee, Krishnendu, and Yaron Velner. <i>Mean-Payoff Pushdown Games</i>. IST Austria, 2012. <a href=\"https://doi.org/10.15479/AT:IST-2012-0002\">https://doi.org/10.15479/AT:IST-2012-0002</a>.","short":"K. Chatterjee, Y. Velner, Mean-Payoff Pushdown Games, IST Austria, 2012.","ama":"Chatterjee K, Velner Y. <i>Mean-Payoff Pushdown Games</i>. IST Austria; 2012. doi:<a href=\"https://doi.org/10.15479/AT:IST-2012-0002\">10.15479/AT:IST-2012-0002</a>","ieee":"K. Chatterjee and Y. Velner, <i>Mean-payoff pushdown games</i>. IST Austria, 2012.","ista":"Chatterjee K, Velner Y. 2012. Mean-payoff pushdown games, IST Austria, 33p."},"file_date_updated":"2020-07-14T12:46:38Z","corr_author":"1","alternative_title":["IST Austria Technical Report"],"department":[{"_id":"KrCh"}],"has_accepted_license":"1","file":[{"relation":"main_file","date_updated":"2020-07-14T12:46:38Z","checksum":"a03c08c1589dbb0c96183a8bcf3ab240","date_created":"2018-12-12T11:54:00Z","access_level":"open_access","file_name":"IST-2012-002_IST-2012-0002.pdf","file_size":592098,"creator":"system","file_id":"5522","content_type":"application/pdf"}],"page":"33","author":[{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Velner","first_name":"Yaron","full_name":"Velner, Yaron"}],"day":"02","pubrep_id":"10","status":"public","year":"2012","related_material":{"record":[{"id":"2956","relation":"later_version","status":"public"}]},"type":"technical_report","date_created":"2018-12-12T11:38:59Z","date_published":"2012-07-02T00:00:00Z","oa":1,"fulldoi":"https://doi.org/10.15479/AT:IST-2012-0002","publication_status":"published"},{"page":"21","pubrep_id":"14","day":"04","author":[{"orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"},{"full_name":"Chaubal, Siddhesh","first_name":"Siddhesh","last_name":"Chaubal"},{"full_name":"Kamath, Pritish","first_name":"Pritish","last_name":"Kamath"}],"file":[{"file_id":"5489","content_type":"application/pdf","creator":"system","file_size":394256,"file_name":"IST-2012-0001_IST-2012-0001.pdf","date_created":"2018-12-12T11:53:28Z","access_level":"open_access","relation":"main_file","date_updated":"2020-07-14T12:46:39Z","checksum":"ec8d1857cc7095d3de5107a0162ced37"}],"publication_status":"published","fulldoi":"https://doi.org/10.15479/AT:IST-2012-0001","type":"technical_report","related_material":{"record":[{"status":"public","id":"497","relation":"later_version"}]},"status":"public","year":"2012","oa":1,"date_published":"2012-07-04T00:00:00Z","date_created":"2018-12-12T11:38:59Z","oa_version":"Published Version","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"07","doi":"10.15479/AT:IST-2012-0001","citation":{"apa":"Chatterjee, K., Chaubal, S., &#38; Kamath, P. (2012). <i>Faster algorithms for alternating refinement relations</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2012-0001\">https://doi.org/10.15479/AT:IST-2012-0001</a>","mla":"Chatterjee, Krishnendu, et al. <i>Faster Algorithms for Alternating Refinement Relations</i>. IST Austria, 2012, doi:<a href=\"https://doi.org/10.15479/AT:IST-2012-0001\">10.15479/AT:IST-2012-0001</a>.","ista":"Chatterjee K, Chaubal S, Kamath P. 2012. Faster algorithms for alternating refinement relations, IST Austria, 21p.","ieee":"K. Chatterjee, S. Chaubal, and P. Kamath, <i>Faster algorithms for alternating refinement relations</i>. IST Austria, 2012.","ama":"Chatterjee K, Chaubal S, Kamath P. <i>Faster Algorithms for Alternating Refinement Relations</i>. IST Austria; 2012. doi:<a href=\"https://doi.org/10.15479/AT:IST-2012-0001\">10.15479/AT:IST-2012-0001</a>","short":"K. Chatterjee, S. Chaubal, P. Kamath, Faster Algorithms for Alternating Refinement Relations, IST Austria, 2012.","chicago":"Chatterjee, Krishnendu, Siddhesh Chaubal, and Pritish Kamath. <i>Faster Algorithms for Alternating Refinement Relations</i>. IST Austria, 2012. <a href=\"https://doi.org/10.15479/AT:IST-2012-0001\">https://doi.org/10.15479/AT:IST-2012-0001</a>."},"file_date_updated":"2020-07-14T12:46:39Z","abstract":[{"lang":"eng","text":"One central issue in the formal design and analysis of reactive systems is the notion of refinement that asks whether all behaviors of the implementation is allowed by the specification. The local interpretation of behavior leads to the notion of simulation. Alternating transition systems (ATSs) provide a general model for composite reactive systems, and the simulation relation for ATSs is known as alternating simulation. The simulation relation for fair transition systems is called fair simulation. In this work our main contributions are as follows: (1) We present an improved algorithm for fair simulation with Büchi fairness constraints; our algorithm requires O(n3 · m) time as compared to the previous known O(n6)-time algorithm, where n is the number of states and m is the number of transitions. (2) We present a game based algorithm for alternating simulation that requires O(m2)-time as compared to the previous known O((n · m)2)-time algorithm, where n is the number of states and m is the size of transition relation. (3) We present an iterative algorithm for alternating simulation that matches the time complexity of the game based algorithm, but is more space efficient than the game based algorithm."}],"publication_identifier":{"issn":["2664-1690"]},"article_processing_charge":"No","has_accepted_license":"1","department":[{"_id":"KrCh"}],"corr_author":"1","alternative_title":["IST Austria Technical Report"],"_id":"5378","publisher":"IST Austria","date_updated":"2025-04-15T08:12:24Z","ddc":["000","005"],"title":"Faster algorithms for alternating refinement relations"},{"publication_status":"published","fulldoi":"https://doi.org/10.15479/AT:IST-2012-0003","oa":1,"date_published":"2012-07-23T00:00:00Z","date_created":"2018-12-12T11:39:06Z","type":"technical_report","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"3124"}]},"year":"2012","status":"public","pubrep_id":"36","day":"23","author":[{"id":"476A2FD6-F248-11E8-B48F-1D18A9856A87","last_name":"Korc","full_name":"Korc, Filip","first_name":"Filip"},{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","last_name":"Kolmogorov","full_name":"Kolmogorov, Vladimir","first_name":"Vladimir"},{"first_name":"Christoph","full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","last_name":"Lampert"}],"page":"13","file":[{"checksum":"7e0ba85ad123b13223aaf6cdde2d288c","date_updated":"2020-07-14T12:46:44Z","relation":"main_file","access_level":"open_access","date_created":"2018-12-12T11:53:29Z","file_name":"IST-2012-0003_IST-2012-0003.pdf","file_size":618744,"creator":"system","file_id":"5490","content_type":"application/pdf"}],"has_accepted_license":"1","department":[{"_id":"VlKo"},{"_id":"ChLa"}],"alternative_title":["IST Austria Technical Report"],"file_date_updated":"2020-07-14T12:46:44Z","citation":{"ieee":"F. Korc, V. Kolmogorov, and C. Lampert, <i>Approximating marginals using discrete energy minimization</i>. IST Austria, 2012.","ista":"Korc F, Kolmogorov V, Lampert C. 2012. Approximating marginals using discrete energy minimization, IST Austria, 13p.","short":"F. Korc, V. Kolmogorov, C. Lampert, Approximating Marginals Using Discrete Energy Minimization, IST Austria, 2012.","chicago":"Korc, Filip, Vladimir Kolmogorov, and Christoph Lampert. <i>Approximating Marginals Using Discrete Energy Minimization</i>. IST Austria, 2012. <a href=\"https://doi.org/10.15479/AT:IST-2012-0003\">https://doi.org/10.15479/AT:IST-2012-0003</a>.","ama":"Korc F, Kolmogorov V, Lampert C. <i>Approximating Marginals Using Discrete Energy Minimization</i>. IST Austria; 2012. doi:<a href=\"https://doi.org/10.15479/AT:IST-2012-0003\">10.15479/AT:IST-2012-0003</a>","mla":"Korc, Filip, et al. <i>Approximating Marginals Using Discrete Energy Minimization</i>. IST Austria, 2012, doi:<a href=\"https://doi.org/10.15479/AT:IST-2012-0003\">10.15479/AT:IST-2012-0003</a>.","apa":"Korc, F., Kolmogorov, V., &#38; Lampert, C. (2012). <i>Approximating marginals using discrete energy minimization</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2012-0003\">https://doi.org/10.15479/AT:IST-2012-0003</a>"},"doi":"10.15479/AT:IST-2012-0003","abstract":[{"text":"We consider the problem of inference in agraphical model with binary variables. While in theory it is arguably preferable to compute marginal probabilities, in practice researchers often use MAP inference due to the availability of efficient discrete optimization algorithms. We bridge the gap between the two approaches by introducing the Discrete  Marginals technique in which approximate marginals are obtained by minimizing an objective function with unary and pair-wise terms over a discretized domain. This allows the use of techniques originally devel-oped for MAP-MRF inference and learning. We explore two ways to set up the objective function - by discretizing the Bethe free energy and by learning it  from training data. Experimental results show that for certain types of graphs a learned function can out-perform the  Bethe approximation. We also establish a link between the Bethe free energy and submodular functions.","lang":"eng"}],"publication_identifier":{"issn":["2664-1690"]},"title":"Approximating marginals using discrete energy minimization","publisher":"IST Austria","_id":"5396","date_updated":"2024-10-09T20:54:48Z","ddc":["000"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"07","language":[{"iso":"eng"}],"oa_version":"Published Version"}]