[{"type":"journal_article","_id":"2951","year":"2012","publication":"Science","language":[{"iso":"eng"}],"title":"Adhesion functions in cell sorting by mechanically coupling the cortices of adhering cells","publication_status":"published","date_published":"2012-10-12T00:00:00Z","acknowledged_ssus":[{"_id":"SSU"}],"month":"10","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Jean-Léon","last_name":"Maître","full_name":"Maître, Jean-Léon","orcid":"0000-0002-3688-1474","id":"48F1E0D8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Berthoumieux, Hélène","last_name":"Berthoumieux","first_name":"Hélène"},{"id":"2B819732-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4761-5996","full_name":"Krens, Gabriel","first_name":"Gabriel","last_name":"Krens"},{"full_name":"Salbreux, Guillaume","last_name":"Salbreux","first_name":"Guillaume"},{"full_name":"Julicher, Frank","first_name":"Frank","last_name":"Julicher"},{"first_name":"Ewa","last_name":"Paluch","full_name":"Paluch, Ewa"},{"id":"39427864-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0912-4566","full_name":"Heisenberg, Carl-Philipp J","first_name":"Carl-Philipp J","last_name":"Heisenberg"}],"intvolume":"       338","status":"public","date_created":"2018-12-11T12:00:31Z","volume":338,"page":"253 - 256","citation":{"mla":"Maître, Jean-Léon, et al. “Adhesion Functions in Cell Sorting by Mechanically Coupling the Cortices of Adhering Cells.” <i>Science</i>, vol. 338, no. 6104, American Association for the Advancement of Science, 2012, pp. 253–56, doi:<a href=\"https://doi.org/10.1126/science.1225399\">10.1126/science.1225399</a>.","apa":"Maître, J.-L., Berthoumieux, H., Krens, G., Salbreux, G., Julicher, F., Paluch, E., &#38; Heisenberg, C.-P. J. (2012). Adhesion functions in cell sorting by mechanically coupling the cortices of adhering cells. <i>Science</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/science.1225399\">https://doi.org/10.1126/science.1225399</a>","chicago":"Maître, Jean-Léon, Hélène Berthoumieux, Gabriel Krens, Guillaume Salbreux, Frank Julicher, Ewa Paluch, and Carl-Philipp J Heisenberg. “Adhesion Functions in Cell Sorting by Mechanically Coupling the Cortices of Adhering Cells.” <i>Science</i>. American Association for the Advancement of Science, 2012. <a href=\"https://doi.org/10.1126/science.1225399\">https://doi.org/10.1126/science.1225399</a>.","ieee":"J.-L. Maître <i>et al.</i>, “Adhesion functions in cell sorting by mechanically coupling the cortices of adhering cells,” <i>Science</i>, vol. 338, no. 6104. American Association for the Advancement of Science, pp. 253–256, 2012.","short":"J.-L. Maître, H. Berthoumieux, G. Krens, G. Salbreux, F. Julicher, E. Paluch, C.-P.J. Heisenberg, Science 338 (2012) 253–256.","ama":"Maître J-L, Berthoumieux H, Krens G, et al. Adhesion functions in cell sorting by mechanically coupling the cortices of adhering cells. <i>Science</i>. 2012;338(6104):253-256. doi:<a href=\"https://doi.org/10.1126/science.1225399\">10.1126/science.1225399</a>","ista":"Maître J-L, Berthoumieux H, Krens G, Salbreux G, Julicher F, Paluch E, Heisenberg C-PJ. 2012. Adhesion functions in cell sorting by mechanically coupling the cortices of adhering cells. Science. 338(6104), 253–256."},"day":"12","date_updated":"2021-01-12T07:40:00Z","abstract":[{"text":"Differential cell adhesion and cortex tension are thought to drive cell sorting by controlling cell-cell contact formation. Here, we show that cell adhesion and cortex tension have different mechanical functions in controlling progenitor cell-cell contact formation and sorting during zebrafish gastrulation. Cortex tension controls cell-cell contact expansion by modulating interfacial tension at the contact. By contrast, adhesion has little direct function in contact expansion, but instead is needed to mechanically couple the cortices of adhering cells at their contacts, allowing cortex tension to control contact expansion. The coupling function of adhesion is mediated by E-cadherin and limited by the mechanical anchoring of E-cadherin to the cortex. Thus, cell adhesion provides the mechanical scaffold for cell cortex tension to drive cell sorting during gastrulation.","lang":"eng"}],"quality_controlled":"1","publist_id":"3777","department":[{"_id":"CaHe"}],"issue":"6104","scopus_import":1,"publisher":"American Association for the Advancement of Science","oa_version":"None","doi":"10.1126/science.1225399"},{"day":"01","citation":{"chicago":"Tada, Masazumi, and Carl-Philipp J Heisenberg. “Convergent Extension Using Collective Cell Migration and Cell Intercalation to Shape Embryos.” <i>Development</i>. Company of Biologists, 2012. <a href=\"https://doi.org/10.1242/dev.073007\">https://doi.org/10.1242/dev.073007</a>.","ieee":"M. Tada and C.-P. J. Heisenberg, “Convergent extension Using collective cell migration and cell intercalation to shape embryos,” <i>Development</i>, vol. 139, no. 21. Company of Biologists, pp. 3897–3904, 2012.","short":"M. Tada, C.-P.J. Heisenberg, Development 139 (2012) 3897–3904.","ama":"Tada M, Heisenberg C-PJ. Convergent extension Using collective cell migration and cell intercalation to shape embryos. <i>Development</i>. 2012;139(21):3897-3904. doi:<a href=\"https://doi.org/10.1242/dev.073007\">10.1242/dev.073007</a>","mla":"Tada, Masazumi, and Carl-Philipp J. Heisenberg. “Convergent Extension Using Collective Cell Migration and Cell Intercalation to Shape Embryos.” <i>Development</i>, vol. 139, no. 21, Company of Biologists, 2012, pp. 3897–904, doi:<a href=\"https://doi.org/10.1242/dev.073007\">10.1242/dev.073007</a>.","apa":"Tada, M., &#38; Heisenberg, C.-P. J. (2012). Convergent extension Using collective cell migration and cell intercalation to shape embryos. <i>Development</i>. Company of Biologists. <a href=\"https://doi.org/10.1242/dev.073007\">https://doi.org/10.1242/dev.073007</a>","ista":"Tada M, Heisenberg C-PJ. 2012. Convergent extension Using collective cell migration and cell intercalation to shape embryos. Development. 139(21), 3897–3904."},"page":"3897 - 3904","volume":139,"quality_controlled":"1","publist_id":"3776","abstract":[{"text":"Body axis elongation represents a common and fundamental morphogenetic process in development. A key mechanism triggering body axis elongation without additional growth is convergent extension (CE), whereby a tissue undergoes simultaneous narrowing and extension. Both collective cell migration and cell intercalation are thought to drive CE and are used to different degrees in various species as they elongate their body axis. Here, we provide an overview of CE as a general strategy for body axis elongation and discuss conserved and divergent mechanisms underlying CE among different species.","lang":"eng"}],"date_updated":"2021-01-12T07:40:00Z","department":[{"_id":"CaHe"}],"issue":"21","scopus_import":1,"doi":"10.1242/dev.073007","oa_version":"None","publisher":"Company of Biologists","_id":"2952","year":"2012","type":"journal_article","title":"Convergent extension Using collective cell migration and cell intercalation to shape embryos","language":[{"iso":"eng"}],"publication":"Development","author":[{"first_name":"Masazumi","last_name":"Tada","full_name":"Tada, Masazumi"},{"orcid":"0000-0002-0912-4566","id":"39427864-F248-11E8-B48F-1D18A9856A87","last_name":"Heisenberg","first_name":"Carl-Philipp J","full_name":"Heisenberg, Carl-Philipp J"}],"month":"11","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_published":"2012-11-01T00:00:00Z","publication_status":"published","acknowledgement":"M.T. is supported by the UK Medical Research Council (MRC) and Royal Society and C.-P.H. by the Fonds zur Förderung der wissenschaftlichen Forschung (FWF), Deutsche Forschungsgemeinschaft (DFG) and Institute of Science and Technology Austria. ","date_created":"2018-12-11T12:00:31Z","status":"public","intvolume":"       139"},{"date_updated":"2021-01-12T07:40:01Z","publist_id":"3773","quality_controlled":"1","day":"01","page":"559 - 561","citation":{"mla":"Heisenberg, Carl-Philipp J., and Reinhard Fässler. “Cell-Cell Adhesion and Extracellular Matrix Diversity Counts.” <i>Current Opinion in Cell Biology</i>, vol. 24, no. 5, Elsevier, 2012, pp. 559–61, doi:<a href=\"https://doi.org/10.1016/j.ceb.2012.09.002\">10.1016/j.ceb.2012.09.002</a>.","apa":"Heisenberg, C.-P. J., &#38; Fässler, R. (2012). Cell-cell adhesion and extracellular matrix diversity counts. <i>Current Opinion in Cell Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ceb.2012.09.002\">https://doi.org/10.1016/j.ceb.2012.09.002</a>","ieee":"C.-P. J. Heisenberg and R. Fässler, “Cell-cell adhesion and extracellular matrix diversity counts,” <i>Current Opinion in Cell Biology</i>, vol. 24, no. 5. Elsevier, pp. 559–561, 2012.","short":"C.-P.J. Heisenberg, R. Fässler, Current Opinion in Cell Biology 24 (2012) 559–561.","chicago":"Heisenberg, Carl-Philipp J, and Reinhard Fässler. “Cell-Cell Adhesion and Extracellular Matrix Diversity Counts.” <i>Current Opinion in Cell Biology</i>. Elsevier, 2012. <a href=\"https://doi.org/10.1016/j.ceb.2012.09.002\">https://doi.org/10.1016/j.ceb.2012.09.002</a>.","ama":"Heisenberg C-PJ, Fässler R. Cell-cell adhesion and extracellular matrix diversity counts. <i>Current Opinion in Cell Biology</i>. 2012;24(5):559-561. doi:<a href=\"https://doi.org/10.1016/j.ceb.2012.09.002\">10.1016/j.ceb.2012.09.002</a>","ista":"Heisenberg C-PJ, Fässler R. 2012. Cell-cell adhesion and extracellular matrix diversity counts. Current Opinion in Cell Biology. 24(5), 559–561."},"volume":24,"doi":"10.1016/j.ceb.2012.09.002","publisher":"Elsevier","oa_version":"None","scopus_import":1,"department":[{"_id":"CaHe"}],"issue":"5","language":[{"iso":"eng"}],"publication":"Current Opinion in Cell Biology","title":"Cell-cell adhesion and extracellular matrix diversity counts","type":"journal_article","_id":"2953","year":"2012","status":"public","intvolume":"        24","date_created":"2018-12-11T12:00:31Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","month":"10","publication_status":"published","date_published":"2012-10-01T00:00:00Z","author":[{"full_name":"Heisenberg, Carl-Philipp J","last_name":"Heisenberg","first_name":"Carl-Philipp J","orcid":"0000-0002-0912-4566","id":"39427864-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Fässler, Reinhard","first_name":"Reinhard","last_name":"Fässler"}]},{"department":[{"_id":"PeJo"},{"_id":"ScienComp"}],"publisher":"Biophysical","pmid":1,"volume":103,"page":"1429 - 1439","citation":{"ista":"Pernia-Andrade A, Goswami S, Stickler Y, Fröbe U, Schlögl A, Jonas PM. 2012. A deconvolution based method with high sensitivity and temporal resolution for detection of spontaneous synaptic currents in vitro and in vivo. Biophysical Journal. 103(7), 1429–1439.","chicago":"Pernia-Andrade, Alejandro, Sarit Goswami, Yvonne Stickler, Ulrich Fröbe, Alois Schlögl, and Peter M Jonas. “A Deconvolution Based Method with High Sensitivity and Temporal Resolution for Detection of Spontaneous Synaptic Currents in Vitro and in Vivo.” <i>Biophysical Journal</i>. Biophysical, 2012. <a href=\"https://doi.org/10.1016/j.bpj.2012.08.039\">https://doi.org/10.1016/j.bpj.2012.08.039</a>.","ama":"Pernia-Andrade A, Goswami S, Stickler Y, Fröbe U, Schlögl A, Jonas PM. A deconvolution based method with high sensitivity and temporal resolution for detection of spontaneous synaptic currents in vitro and in vivo. <i>Biophysical Journal</i>. 2012;103(7):1429-1439. doi:<a href=\"https://doi.org/10.1016/j.bpj.2012.08.039\">10.1016/j.bpj.2012.08.039</a>","ieee":"A. Pernia-Andrade, S. Goswami, Y. Stickler, U. Fröbe, A. Schlögl, and P. M. Jonas, “A deconvolution based method with high sensitivity and temporal resolution for detection of spontaneous synaptic currents in vitro and in vivo,” <i>Biophysical Journal</i>, vol. 103, no. 7. Biophysical, pp. 1429–1439, 2012.","short":"A. Pernia-Andrade, S. Goswami, Y. Stickler, U. Fröbe, A. Schlögl, P.M. Jonas, Biophysical Journal 103 (2012) 1429–1439.","mla":"Pernia-Andrade, Alejandro, et al. “A Deconvolution Based Method with High Sensitivity and Temporal Resolution for Detection of Spontaneous Synaptic Currents in Vitro and in Vivo.” <i>Biophysical Journal</i>, vol. 103, no. 7, Biophysical, 2012, pp. 1429–39, doi:<a href=\"https://doi.org/10.1016/j.bpj.2012.08.039\">10.1016/j.bpj.2012.08.039</a>.","apa":"Pernia-Andrade, A., Goswami, S., Stickler, Y., Fröbe, U., Schlögl, A., &#38; Jonas, P. M. (2012). A deconvolution based method with high sensitivity and temporal resolution for detection of spontaneous synaptic currents in vitro and in vivo. <i>Biophysical Journal</i>. Biophysical. <a href=\"https://doi.org/10.1016/j.bpj.2012.08.039\">https://doi.org/10.1016/j.bpj.2012.08.039</a>"},"publist_id":"3774","quality_controlled":"1","date_updated":"2021-01-12T07:40:01Z","abstract":[{"text":"Spontaneous postsynaptic currents (PSCs) provide key information about the mechanisms of synaptic transmission and the activity modes of neuronal networks. However, detecting spontaneous PSCs in vitro and in vivo has been challenging, because of the small amplitude, the variable kinetics, and the undefined time of generation of these events. Here, we describe a, to our knowledge, new method for detecting spontaneous synaptic events by deconvolution, using a template that approximates the average time course of spontaneous PSCs. A recorded PSC trace is deconvolved from the template, resulting in a series of delta-like functions. The maxima of these delta-like events are reliably detected, revealing the precise onset times of the spontaneous PSCs. Among all detection methods, the deconvolution-based method has a unique temporal resolution, allowing the detection of individual events in high-frequency bursts. Furthermore, the deconvolution-based method has a high amplitude resolution, because deconvolution can substantially increase the signal/noise ratio. When tested against previously published methods using experimental data, the deconvolution-based method was superior for spontaneous PSCs recorded in vivo. Using the high-resolution deconvolution-based detection algorithm, we show that the frequency of spontaneous excitatory postsynaptic currents in dentate gyrus granule cells is 4.5 times higher in vivo than in vitro.","lang":"eng"}],"author":[{"id":"36963E98-F248-11E8-B48F-1D18A9856A87","full_name":"Pernia-Andrade, Alejandro","first_name":"Alejandro","last_name":"Pernia-Andrade"},{"id":"3A578F32-F248-11E8-B48F-1D18A9856A87","full_name":"Goswami, Sarit","first_name":"Sarit","last_name":"Goswami"},{"full_name":"Stickler, Yvonne","last_name":"Stickler","first_name":"Yvonne","id":"63B76600-E9CC-11E9-9B5F-82450873F7A1"},{"full_name":"Fröbe, Ulrich","last_name":"Fröbe","first_name":"Ulrich"},{"orcid":"0000-0002-5621-8100","id":"45BF87EE-F248-11E8-B48F-1D18A9856A87","full_name":"Schlögl, Alois","last_name":"Schlögl","first_name":"Alois"},{"full_name":"Jonas, Peter M","first_name":"Peter M","last_name":"Jonas","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5001-4804"}],"publication_status":"published","project":[{"name":"Glutamaterge synaptische Übertragung und Plastizität in hippocampalen Mikroschaltkreisen","_id":"25BDE9A4-B435-11E9-9278-68D0E5697425","grant_number":"SFB-TR3-TP10B"}],"month":"10","date_created":"2018-12-11T12:00:32Z","intvolume":"       103","_id":"2954","year":"2012","type":"journal_article","external_id":{"pmid":["23062335"]},"scopus_import":1,"issue":"7","oa_version":"Submitted Version","doi":"10.1016/j.bpj.2012.08.039","oa":1,"day":"03","acknowledgement":"This work was supported by the Deutsche Forschungsgemeinschaft (TR3/B10) and a European Research Council Advanced grant to P.J.\r\nWe thank H. Hu, S. J. Guzman, and C. Schmidt-Hieber for critically reading the manuscript, I. Koeva and F. Marr for technical support, and E. Kramberger for editorial assistance.\r\n","date_published":"2012-10-03T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3471482/","open_access":"1"}],"title":"A deconvolution based method with high sensitivity and temporal resolution for detection of spontaneous synaptic currents in vitro and in vivo","publication":"Biophysical Journal","language":[{"iso":"eng"}]},{"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1107.2141"}],"language":[{"iso":"eng"}],"publication":"Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science","arxiv":1,"title":"Partial-observation stochastic games: How to win when belief fails","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2012-08-23T00:00:00Z","acknowledgement":"This work was partially supported by FWF Grant No P 23499-N23, FWF NFN Grant No S11407-N23 (RiSE), ERC Start grant (279307: Graph Games), and Microsoft faculty fellows award.","status":"public","day":"23","oa":1,"scopus_import":1,"external_id":{"arxiv":["1107.2141"]},"doi":"10.1109/LICS.2012.28","oa_version":"Preprint","related_material":{"record":[{"id":"2211","status":"public","relation":"later_version"},{"status":"public","id":"5381","relation":"earlier_version"}]},"article_number":"6280436","type":"conference","_id":"2955","year":"2012","ec_funded":1,"month":"08","publication_status":"published","project":[{"grant_number":"P 23499-N23","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"call_identifier":"FWF","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering"},{"grant_number":"279307","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"author":[{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"last_name":"Doyen","first_name":"Laurent","full_name":"Doyen, Laurent"}],"date_created":"2018-12-11T12:00:32Z","citation":{"ista":"Chatterjee K, Doyen L. 2012. Partial-observation stochastic games: How to win when belief fails. Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 6280436.","short":"K. Chatterjee, L. Doyen, in:, Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2012.","ieee":"K. Chatterjee and L. Doyen, “Partial-observation stochastic games: How to win when belief fails,” in <i>Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science</i>, Dubrovnik, Croatia, 2012.","ama":"Chatterjee K, Doyen L. Partial-observation stochastic games: How to win when belief fails. In: <i>Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science</i>. IEEE; 2012. doi:<a href=\"https://doi.org/10.1109/LICS.2012.28\">10.1109/LICS.2012.28</a>","chicago":"Chatterjee, Krishnendu, and Laurent Doyen. “Partial-Observation Stochastic Games: How to Win When Belief Fails.” In <i>Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science</i>. IEEE, 2012. <a href=\"https://doi.org/10.1109/LICS.2012.28\">https://doi.org/10.1109/LICS.2012.28</a>.","mla":"Chatterjee, Krishnendu, and Laurent Doyen. “Partial-Observation Stochastic Games: How to Win When Belief Fails.” <i>Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science</i>, 6280436, IEEE, 2012, doi:<a href=\"https://doi.org/10.1109/LICS.2012.28\">10.1109/LICS.2012.28</a>.","apa":"Chatterjee, K., &#38; Doyen, L. (2012). Partial-observation stochastic games: How to win when belief fails. In <i>Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science</i>. Dubrovnik, Croatia: IEEE. <a href=\"https://doi.org/10.1109/LICS.2012.28\">https://doi.org/10.1109/LICS.2012.28</a>"},"abstract":[{"text":"We consider two-player stochastic games played on finite graphs with reachability objectives where the first player tries to ensure a target state to be visited almost-surely (i.e., with probability 1), or positively (i.e., with positive probability), no matter the strategy of the second player. We classify such games according to the information and the power of randomization available to the players. On the basis of information, the game can be one-sided with either (a) player 1, or (b) player 2 having partial observation (and the other player has perfect observation), or two-sided with (c) both players having partial observation. On the basis of randomization, the players (a) may not be allowed to use randomization (pure strategies), or (b) may choose a probability distribution over actions but the actual random choice is external and not visible to the player (actions invisible), or (c) may use full randomization. Our main results for pure strategies are as follows. (1) For one-sided games with player 1 having partial observation we show that (in contrast to full randomized strategies) belief-based (subset-construction based) strategies are not sufficient, and we present an exponential upper bound on memory both for almostsure and positive winning strategies; we show that the problem of deciding the existence of almost-sure and positive winning strategies for player 1 is EXPTIME-complete. (2) For one-sided games with player 2 having partial observation we show that non-elementary memory is both necessary and sufficient for both almost-sure and positive winning strategies. (3) We show that for the general (two-sided) case finite-memory strategies are sufficient for both positive and almost-sure winning, and at least non-elementary memory is required. We establish the equivalence of the almost-sure winning problems for pure strategies and for randomized strategies with actions invisible. Our equivalence result exhibits serious flaws in previous results of the literature: we show a non-elementary memory lower bound for almost-sure winning whereas an exponential upper bound was previously claimed.","lang":"eng"}],"date_updated":"2023-02-23T12:23:43Z","quality_controlled":"1","publist_id":"3771","department":[{"_id":"KrCh"}],"conference":{"name":"LICS: Logic in Computer Science","start_date":"2012-06-25","location":"Dubrovnik, Croatia","end_date":"2012-06-28"},"publisher":"IEEE"},{"date_updated":"2023-02-23T12:23:30Z","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 parity objectives, in this work we study for the first time such games with the most well-studied quantitative objective, namely, mean payoff objectives. In pushdown games two types of strategies are relevant: (1) global strategies, that depend on the entire global history; and (2) modular strategies, that have only local memory and thus do not depend on the context of invocation, but only on the history of the current invocation of the module. Our main results are as follows: (1) One-player pushdown games with mean-payoff objectives under global strategies are decidable in polynomial time. (2) Two-player pushdown games with mean-payoff objectives under global strategies are undecidable. (3) One-player pushdown games with mean-payoff objectives under modular strategies are NP-hard. (4) Two-player pushdown games with mean-payoff objectives under modular strategies can be solved in NP (i.e., both one-player and two-player pushdown games with mean-payoff objectives under modular strategies are NP-complete). We also establish the optimal strategy complexity showing that global strategies for mean-payoff objectives require infinite memory even in one-player pushdown games; and memoryless modular strategies are sufficient in two-player pushdown games. Finally we also show that all the problems have the same computational complexity if the stack boundedness condition is added, where along with the mean-payoff objective the player must also ensure that the stack height is bounded."}],"publist_id":"3770","quality_controlled":"1","citation":{"chicago":"Chatterjee, Krishnendu, and Yaron Velner. “Mean Payoff Pushdown Games.” In <i>Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science</i>. IEEE, 2012. <a href=\"https://doi.org/10.1109/LICS.2012.30\">https://doi.org/10.1109/LICS.2012.30</a>.","ieee":"K. Chatterjee and Y. Velner, “Mean payoff pushdown games,” in <i>Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science</i>, Dubrovnik, Croatia , 2012.","short":"K. Chatterjee, Y. Velner, in:, Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2012.","ama":"Chatterjee K, Velner Y. Mean payoff pushdown games. In: <i>Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science</i>. IEEE; 2012. doi:<a href=\"https://doi.org/10.1109/LICS.2012.30\">10.1109/LICS.2012.30</a>","apa":"Chatterjee, K., &#38; Velner, Y. (2012). Mean payoff pushdown games. In <i>Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science</i>. Dubrovnik, Croatia : IEEE. <a href=\"https://doi.org/10.1109/LICS.2012.30\">https://doi.org/10.1109/LICS.2012.30</a>","mla":"Chatterjee, Krishnendu, and Yaron Velner. “Mean Payoff Pushdown Games.” <i>Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science</i>, 6280438, IEEE, 2012, doi:<a href=\"https://doi.org/10.1109/LICS.2012.30\">10.1109/LICS.2012.30</a>.","ista":"Chatterjee K, Velner Y. 2012. Mean payoff pushdown games. Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 6280438."},"day":"23","conference":{"name":"LICS: Logic in Computer Science","start_date":"2012-06-25","location":"Dubrovnik, Croatia ","end_date":"2012-06-28"},"oa_version":"None","publisher":"IEEE","doi":"10.1109/LICS.2012.30","scopus_import":1,"department":[{"_id":"KrCh"}],"publication":"Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science","language":[{"iso":"eng"}],"title":"Mean payoff pushdown games","type":"conference","related_material":{"record":[{"status":"public","id":"5377","relation":"earlier_version"}]},"article_number":"6280438","_id":"2956","year":"2012","status":"public","date_created":"2018-12-11T12:00:32Z","publication_status":"published","project":[{"grant_number":"P 23499-N23","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"acknowledgement":"The research was supported by Austrian Science Fund (FWF) Grant No P 23499-N23, FWF NFN Grant No S11407-N23 (RiSE), ERC Start grant (279307: Graph Games), Microsoft faculty fellows award, the Israeli Centers of Research Excellence (ICORE) program, (Center No. 4/11), the RICH Model Toolkit (ICT COST Action IC0901), and was carried out in partial fulfillment of the requirements for the Ph.D. degree of the second author.\r\nA Technical Report of this paper is available via internal link.","date_published":"2012-08-23T00:00:00Z","ec_funded":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"08","author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"full_name":"Velner, Yaron","first_name":"Yaron","last_name":"Velner"}]},{"date_updated":"2023-02-23T12:23:51Z","abstract":[{"text":"We consider probabilistic automata on infinite words with acceptance defined by parity conditions. We consider three qualitative decision problems: (i) the positive decision problem asks whether there is a word that is accepted with positive probability; (ii) the almost decision problem asks whether there is a word that is accepted with probability 1; and (iii) the limit decision problem asks whether words are accepted with probability arbitrarily close to 1. We unify and generalize several decidability results for probabilistic automata over infinite words, and identify a robust (closed under union and intersection) subclass of probabilistic automata for which all the qualitative decision problems are decidable for parity conditions. We also show that if the input words are restricted to lasso shape (regular) words, then the positive and almost problems are decidable for all probabilistic automata with parity conditions. For most decidable problems we show an optimal PSPACE-complete complexity bound.","lang":"eng"}],"publist_id":"3769","quality_controlled":"1","citation":{"ista":"Chatterjee K, Tracol M. 2012. Decidable problems for probabilistic automata on infinite words. Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 6280437.","mla":"Chatterjee, Krishnendu, and Mathieu Tracol. “Decidable Problems for Probabilistic Automata on Infinite Words.” <i>Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science</i>, 6280437, IEEE, 2012, doi:<a href=\"https://doi.org/10.1109/LICS.2012.29\">10.1109/LICS.2012.29</a>.","apa":"Chatterjee, K., &#38; Tracol, M. (2012). Decidable problems for probabilistic automata on infinite words. In <i>Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science</i>. Dubrovnik, Croatia : IEEE. <a href=\"https://doi.org/10.1109/LICS.2012.29\">https://doi.org/10.1109/LICS.2012.29</a>","ama":"Chatterjee K, Tracol M. Decidable problems for probabilistic automata on infinite words. In: <i>Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science</i>. IEEE; 2012. doi:<a href=\"https://doi.org/10.1109/LICS.2012.29\">10.1109/LICS.2012.29</a>","ieee":"K. Chatterjee and M. Tracol, “Decidable problems for probabilistic automata on infinite words,” in <i>Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science</i>, Dubrovnik, Croatia , 2012.","short":"K. Chatterjee, M. Tracol, in:, Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2012.","chicago":"Chatterjee, Krishnendu, and Mathieu Tracol. “Decidable Problems for Probabilistic Automata on Infinite Words.” In <i>Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science</i>. IEEE, 2012. <a href=\"https://doi.org/10.1109/LICS.2012.29\">https://doi.org/10.1109/LICS.2012.29</a>."},"conference":{"name":"LICS: Logic in Computer Science","location":"Dubrovnik, Croatia ","start_date":"2012-06-25","end_date":"2012-06-28"},"publisher":"IEEE","department":[{"_id":"KrCh"}],"type":"conference","article_number":"6280437","related_material":{"record":[{"relation":"earlier_version","id":"5384","status":"public"}]},"_id":"2957","year":"2012","date_created":"2018-12-11T12:00:33Z","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","grant_number":"P 23499-N23"},{"name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23"},{"call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"publication_status":"published","ec_funded":1,"month":"08","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu"},{"last_name":"Tracol","first_name":"Mathieu","full_name":"Tracol, Mathieu","id":"3F54FA38-F248-11E8-B48F-1D18A9856A87"}],"oa":1,"day":"23","oa_version":"Preprint","doi":"10.1109/LICS.2012.29","external_id":{"arxiv":["1107.2091"]},"scopus_import":1,"publication":"Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science","language":[{"iso":"eng"}],"title":"Decidable problems for probabilistic automata on infinite words","arxiv":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1107.2091"}],"status":"public","date_published":"2012-08-23T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"pmid":1,"publisher":"Society for Neuroscience","department":[{"_id":"JoCs"}],"date_updated":"2021-01-12T07:40:03Z","abstract":[{"lang":"eng","text":"The activity of hippocampal pyramidal cells reflects both the current position of the animal and information related to its current behavior. Here we investigated whether single hippocampal neurons can encode several independent features defining trials during a memory task. We also tested whether task-related information is represented by partial remapping of the place cell population or, instead, via firing rate modulation of spatially stable place cells. To address these two questions, the activity of hippocampal neurons was recorded in rats performing a conditional discrimination task on a modified T-maze in which the identity of a food reward guided behavior. When the rat was on the central arm of the maze, the firing rate of pyramidal cells changed depending on two independent factors: (1) the identity of the food reward given to the animal and (2) the previous location of the animal on the maze. Importantly, some pyramidal cells encoded information relative to both factors. This trial-type specific and retrospective coding did not interfere with the spatial representation of the maze: hippocampal cells had stable place fields and their theta-phase precession profiles were unaltered during the task, indicating that trial-related information was encoded via rate remapping. During error trials, encoding of both trial-related information and spatial location was impaired. Finally, we found that pyramidal cells also encode trial-related information via rate remapping during the continuous version of the rewarded alternation task without delays. These results suggest that hippocampal neurons can encode several task-related cognitive aspects via rate remapping."}],"quality_controlled":"1","publist_id":"3768","page":"14752 - 14766","volume":32,"citation":{"ista":"Allen K, Rawlins JN, Bannerman D, Csicsvari JL. 2012. Hippocampal place cells can encode multiple trial-dependent features through rate remapping. Journal of Neuroscience. 32(42), 14752–14766.","apa":"Allen, K., Rawlins, J. N., Bannerman, D., &#38; Csicsvari, J. L. (2012). Hippocampal place cells can encode multiple trial-dependent features through rate remapping. <i>Journal of Neuroscience</i>. Society for Neuroscience. <a href=\"https://doi.org/10.1523/JNEUROSCI.6175-11.2012\">https://doi.org/10.1523/JNEUROSCI.6175-11.2012</a>","mla":"Allen, Kevin, et al. “Hippocampal Place Cells Can Encode Multiple Trial-Dependent Features through Rate Remapping.” <i>Journal of Neuroscience</i>, vol. 32, no. 42, Society for Neuroscience, 2012, pp. 14752–66, doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.6175-11.2012\">10.1523/JNEUROSCI.6175-11.2012</a>.","chicago":"Allen, Kevin, J Nick Rawlins, David Bannerman, and Jozsef L Csicsvari. “Hippocampal Place Cells Can Encode Multiple Trial-Dependent Features through Rate Remapping.” <i>Journal of Neuroscience</i>. Society for Neuroscience, 2012. <a href=\"https://doi.org/10.1523/JNEUROSCI.6175-11.2012\">https://doi.org/10.1523/JNEUROSCI.6175-11.2012</a>.","ama":"Allen K, Rawlins JN, Bannerman D, Csicsvari JL. Hippocampal place cells can encode multiple trial-dependent features through rate remapping. <i>Journal of Neuroscience</i>. 2012;32(42):14752-14766. doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.6175-11.2012\">10.1523/JNEUROSCI.6175-11.2012</a>","short":"K. Allen, J.N. Rawlins, D. Bannerman, J.L. Csicsvari, Journal of Neuroscience 32 (2012) 14752–14766.","ieee":"K. Allen, J. N. Rawlins, D. Bannerman, and J. L. Csicsvari, “Hippocampal place cells can encode multiple trial-dependent features through rate remapping,” <i>Journal of Neuroscience</i>, vol. 32, no. 42. Society for Neuroscience, pp. 14752–14766, 2012."},"intvolume":"        32","date_created":"2018-12-11T12:00:33Z","project":[{"call_identifier":"FP7","grant_number":"281511","name":"Memory-related information processing in neuronal circuits of the hippocampus and entorhinal cortex","_id":"257A4776-B435-11E9-9278-68D0E5697425"}],"publication_status":"published","month":"10","ec_funded":1,"author":[{"full_name":"Allen, Kevin","last_name":"Allen","first_name":"Kevin"},{"full_name":"Rawlins, J Nick","first_name":"J Nick","last_name":"Rawlins"},{"last_name":"Bannerman","first_name":"David","full_name":"Bannerman, David"},{"last_name":"Csicsvari","first_name":"Jozsef L","full_name":"Csicsvari, Jozsef L","orcid":"0000-0002-5193-4036","id":"3FA14672-F248-11E8-B48F-1D18A9856A87"}],"type":"journal_article","year":"2012","_id":"2958","oa_version":"Submitted Version","doi":"10.1523/JNEUROSCI.6175-11.2012","external_id":{"pmid":["23077060"]},"scopus_import":1,"issue":"42","oa":1,"day":"17","status":"public","date_published":"2012-10-17T00:00:00Z","acknowledgement":"J.C. was supported by a MRC Intramural Programme Grant (U138197111) and a European Research Council Starter Grant (281511). K.A. held a Wellcome Trust PhD studentship and a Humboldt Research Fellowship for Postdoctoral Researchers. D.M.B. was supported by Wellcome Trust Senior Fellowships (074385 and 087736).","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publication":"Journal of Neuroscience","language":[{"iso":"eng"}],"title":"Hippocampal place cells can encode multiple trial-dependent features through rate remapping","main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3531717/"}]},{"author":[{"first_name":"Caroline","last_name":"Uhler","full_name":"Uhler, Caroline","id":"49ADD78E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7008-0216"}],"publication_status":"published","month":"02","date_created":"2018-12-11T12:00:33Z","intvolume":"        40","_id":"2959","year":"2012","type":"journal_article","department":[{"_id":"CaUh"}],"publisher":"Institute of Mathematical Statistics","citation":{"ista":"Uhler C. 2012. Geometry of maximum likelihood estimation in Gaussian graphical models. Annals of Statistics. 40(1), 238–261.","ama":"Uhler C. Geometry of maximum likelihood estimation in Gaussian graphical models. <i>Annals of Statistics</i>. 2012;40(1):238-261. doi:<a href=\"https://doi.org/10.1214/11-AOS957\">10.1214/11-AOS957</a>","ieee":"C. Uhler, “Geometry of maximum likelihood estimation in Gaussian graphical models,” <i>Annals of Statistics</i>, vol. 40, no. 1. Institute of Mathematical Statistics, pp. 238–261, 2012.","short":"C. Uhler, Annals of Statistics 40 (2012) 238–261.","chicago":"Uhler, Caroline. “Geometry of Maximum Likelihood Estimation in Gaussian Graphical Models.” <i>Annals of Statistics</i>. Institute of Mathematical Statistics, 2012. <a href=\"https://doi.org/10.1214/11-AOS957\">https://doi.org/10.1214/11-AOS957</a>.","mla":"Uhler, Caroline. “Geometry of Maximum Likelihood Estimation in Gaussian Graphical Models.” <i>Annals of Statistics</i>, vol. 40, no. 1, Institute of Mathematical Statistics, 2012, pp. 238–61, doi:<a href=\"https://doi.org/10.1214/11-AOS957\">10.1214/11-AOS957</a>.","apa":"Uhler, C. (2012). Geometry of maximum likelihood estimation in Gaussian graphical models. <i>Annals of Statistics</i>. Institute of Mathematical Statistics. <a href=\"https://doi.org/10.1214/11-AOS957\">https://doi.org/10.1214/11-AOS957</a>"},"volume":40,"page":"238 - 261","quality_controlled":"1","publist_id":"3767","date_updated":"2021-01-12T07:40:04Z","abstract":[{"text":"We study maximum likelihood estimation in Gaussian graphical models from a geometric point of view. An algebraic elimination criterion allows us to find exact lower bounds on the number of observations needed to ensure that the maximum likelihood estimator (MLE) exists with probability one. This is applied to bipartite graphs, grids and colored graphs. We also study the ML degree, and we present the first instance of a graph for which the MLE exists with probability one, even when the number of observations equals the treewidth.","lang":"eng"}],"date_published":"2012-02-01T00:00:00Z","acknowledgement":"I wish to thank Bernd Sturmfels for many helpful discus- sions and Steffen Lauritzen for introducing me to the problem of the existence of the MLE in Gaussian graphical models. I would also like to thank two referees who provided helpful comments on the original version of this paper.\r\n","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","status":"public","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1012.2643"}],"title":"Geometry of maximum likelihood estimation in Gaussian graphical models","publication":"Annals of Statistics","language":[{"iso":"eng"}],"issue":"1","scopus_import":1,"oa_version":"Preprint","doi":"10.1214/11-AOS957","oa":1,"day":"01"},{"external_id":{"pmid":["22960215"]},"issue":"3","scopus_import":1,"oa_version":"Submitted Version","doi":"10.1534/genetics.112.143164","oa":1,"day":"01","date_published":"2012-11-01T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3522150/"}],"title":"A novel approach for choosing summary statistics in approximate Bayesian computation","publication":"Genetics","language":[{"iso":"eng"}],"department":[{"_id":"NiBa"}],"publisher":"Genetics Society of America","pmid":1,"page":"1027 - 1047","volume":192,"citation":{"ista":"Aeschbacher S, Beaumont M, Futschik A. 2012. A novel approach for choosing summary statistics in approximate Bayesian computation. Genetics. 192(3), 1027–1047.","ieee":"S. Aeschbacher, M. Beaumont, and A. Futschik, “A novel approach for choosing summary statistics in approximate Bayesian computation,” <i>Genetics</i>, vol. 192, no. 3. Genetics Society of America, pp. 1027–1047, 2012.","short":"S. Aeschbacher, M. Beaumont, A. Futschik, Genetics 192 (2012) 1027–1047.","ama":"Aeschbacher S, Beaumont M, Futschik A. A novel approach for choosing summary statistics in approximate Bayesian computation. <i>Genetics</i>. 2012;192(3):1027-1047. doi:<a href=\"https://doi.org/10.1534/genetics.112.143164\">10.1534/genetics.112.143164</a>","chicago":"Aeschbacher, Simon, Mark Beaumont, and Andreas Futschik. “A Novel Approach for Choosing Summary Statistics in Approximate Bayesian Computation.” <i>Genetics</i>. Genetics Society of America, 2012. <a href=\"https://doi.org/10.1534/genetics.112.143164\">https://doi.org/10.1534/genetics.112.143164</a>.","mla":"Aeschbacher, Simon, et al. “A Novel Approach for Choosing Summary Statistics in Approximate Bayesian Computation.” <i>Genetics</i>, vol. 192, no. 3, Genetics Society of America, 2012, pp. 1027–47, doi:<a href=\"https://doi.org/10.1534/genetics.112.143164\">10.1534/genetics.112.143164</a>.","apa":"Aeschbacher, S., Beaumont, M., &#38; Futschik, A. (2012). A novel approach for choosing summary statistics in approximate Bayesian computation. <i>Genetics</i>. Genetics Society of America. <a href=\"https://doi.org/10.1534/genetics.112.143164\">https://doi.org/10.1534/genetics.112.143164</a>"},"publist_id":"3763","quality_controlled":"1","date_updated":"2021-01-12T07:40:05Z","abstract":[{"lang":"eng","text":"The choice of summary statistics is a crucial step in approximate Bayesian computation (ABC). Since statistics are often not sufficient, this choice involves a trade-off between loss of information and reduction of dimensionality. The latter may increase the efficiency of ABC. Here, we propose an approach for choosing summary statistics based on boosting, a technique from the machine learning literature. We consider different types of boosting and compare them to partial least squares regression as an alternative. To mitigate the lack of sufficiency, we also propose an approach for choosing summary statistics locally, in the putative neighborhood of the true parameter value. We study a demographic model motivated by the re-introduction of Alpine ibex (Capra ibex) into the Swiss Alps. The parameters of interest are the mean and standard deviation across microsatellites of the scaled ancestral mutation rate (θanc = 4 Ne u), and the proportion of males obtaining access to matings per breeding season (ω). By simulation, we assess the properties of the posterior distribution obtained with the various methods. According to our criteria, ABC with summary statistics chosen locally via boosting with the L2-loss performs best. Applying that method to the ibex data, we estimate θanc ≈ 1.288, and find that most of the variation across loci of the ancestral mutation rate u is between 7.7×10−4 and 3.5×10−3 per locus per generation. The proportion of males with access to matings is estimated to ω ≈ 0.21, which is in good agreement with recent independent estimates."}],"author":[{"full_name":"Aeschbacher, Simon","last_name":"Aeschbacher","first_name":"Simon","id":"2D35326E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Beaumont, Mark","first_name":"Mark","last_name":"Beaumont"},{"first_name":"Andreas","last_name":"Futschik","full_name":"Futschik, Andreas"}],"acknowledged_ssus":[{"_id":"ScienComp"}],"publication_status":"published","month":"11","date_created":"2018-12-11T12:00:34Z","intvolume":"       192","_id":"2962","year":"2012","type":"journal_article"},{"intvolume":"        91","status":"public","date_created":"2018-12-11T12:00:35Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","month":"11","date_published":"2012-11-01T00:00:00Z","publication_status":"published","author":[{"last_name":"Jesse","first_name":"Fabienne","full_name":"Jesse, Fabienne","id":"4C8C26A4-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Riebel, Katharina","last_name":"Riebel","first_name":"Katharina"}],"language":[{"iso":"eng"}],"publication":"Behavioural Processes","title":"Social facilitation of male song by male and female conspecifics in the zebra finch, Taeniopygia guttata","type":"journal_article","year":"2012","_id":"2963","doi":"10.1016/j.beproc.2012.09.006","publisher":"Elsevier","oa_version":"None","department":[{"_id":"JoBo"}],"issue":"3","abstract":[{"text":"Zebra finches are an ubiquitous model system for the study of vocal learning in animal communication. Their song has been well described, but its possible function(s) in social communication are only partly understood. The so-called ‘directed song’ is a high-intensity, high-performance song given during courtship in close proximity to the female, which is known to mediate mate choice and mating. However, this singing mode constitutes only a fraction of zebra finch males’ prolific song output. Potential communicative functions of their second, ‘undirected’ singing mode remain unresolved in the face of contradicting reports of both facilitating and inhibiting effects of social company on singing. We addressed this issue by experimentally manipulating social contexts in a within-subject design, comparing a solo versus male or female only company condition, each lasting for 24 hours. Males’ total song output was significantly higher when a conspecific was in audible and visible distance than when they were alone. Male and female company had an equally facilitating effect on song output. Our findings thus indicate that singing motivation is facilitated rather than inhibited by social company, suggesting that singing in zebra finches might function both in inter- and intrasexual communication. ","lang":"eng"}],"date_updated":"2021-01-12T07:40:06Z","publist_id":"3756","quality_controlled":"1","day":"01","citation":{"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.","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.","short":"F. Jesse, K. Riebel, Behavioural Processes 91 (2012) 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>.","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>","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>","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>."},"volume":91,"page":"262 - 266"},{"department":[{"_id":"PeJo"},{"_id":"GradSch"}],"publication_identifier":{"issn":["2663-337X"]},"publisher":"Institute of Science and Technology Austria","oa_version":"None","day":"01","page":"65","citation":{"ista":"Kim S. 2012. Active properties of hippocampal CA3 pyramidal neuron dendrites. Institute of Science and Technology Austria.","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.","chicago":"Kim, Sooyun. “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.","short":"S. Kim, Active Properties of Hippocampal CA3 Pyramidal Neuron Dendrites, Institute of Science and Technology Austria, 2012.","ieee":"S. Kim, “Active properties of hippocampal CA3 pyramidal neuron dendrites,” Institute of Science and Technology Austria, 2012."},"publist_id":"3755","abstract":[{"lang":"eng","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.  "}],"degree_awarded":"PhD","date_updated":"2023-09-07T11:43:51Z","supervisor":[{"id":"353C1B58-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5001-4804","first_name":"Peter M","last_name":"Jonas","full_name":"Jonas, Peter M"}],"author":[{"full_name":"Kim, Sooyun","first_name":"Sooyun","last_name":"Kim","id":"394AB1C8-F248-11E8-B48F-1D18A9856A87"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","month":"06","alternative_title":["ISTA Thesis"],"publication_status":"published","date_published":"2012-06-01T00:00:00Z","date_created":"2018-12-11T12:00:35Z","status":"public","year":"2012","_id":"2964","related_material":{"record":[{"relation":"part_of_dissertation","id":"3258","status":"public"}]},"type":"dissertation","title":"Active properties of hippocampal CA3 pyramidal neuron dendrites","article_processing_charge":"No","language":[{"iso":"eng"}]},{"department":[{"_id":"E-Lib"}],"publisher":"VÖB","page":"200 - 212","citation":{"apa":"Danowski, P. (2012). Kontext Open Access: Creative Commons. <i>Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen &#38; Bibliothekare</i>. VÖB.","mla":"Danowski, Patrick. “Kontext Open Access: Creative Commons.” <i>Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen &#38; Bibliothekare</i>, vol. 65, no. 2, VÖB, 2012, pp. 200–12.","ama":"Danowski P. Kontext Open Access: Creative Commons. <i>Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen &#38; Bibliothekare</i>. 2012;65(2):200-212.","short":"P. Danowski, Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen &#38; Bibliothekare 65 (2012) 200–212.","chicago":"Danowski, Patrick. “Kontext Open Access: Creative Commons.” <i>Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen &#38; Bibliothekare</i>. VÖB, 2012.","ieee":"P. Danowski, “Kontext Open Access: Creative Commons,” <i>Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen &#38; Bibliothekare</i>, vol. 65, no. 2. VÖB, pp. 200–212, 2012.","ista":"Danowski P. 2012. Kontext Open Access: Creative Commons. Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen &#38; Bibliothekare. 65(2), 200–212."},"volume":65,"pubrep_id":"95","abstract":[{"lang":"eng","text":"Dieser Artikel soll die sechs verschiedenen Creative Commons Lizenzen erläutern und ihre Bedeutung im Rahmen des wissenschaftlichen Publizierens und des Open Access erklären (CC-BY, CC-BY-SA, CC-BY-NC, CC-BY-ND, CC-BYNC-SA, CC-BY-NC-ND)."}],"date_updated":"2021-01-12T07:40:07Z","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","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":"3754","has_accepted_license":"1","month":"09","publication_status":"published","author":[{"first_name":"Patrick","last_name":"Danowski","full_name":"Danowski, Patrick","orcid":"0000-0002-6026-4409","id":"2EBD1598-F248-11E8-B48F-1D18A9856A87"}],"intvolume":"        65","date_created":"2018-12-11T12:00:35Z","type":"journal_article","_id":"2965","year":"2012","file":[{"creator":"system","date_created":"2018-12-12T10:08:42Z","file_size":503345,"file_name":"IST-2012-95-v1+1_sp-beitrag_danowski_kontext_open_access_creative_commons.pdf","content_type":"application/pdf","relation":"main_file","access_level":"open_access","date_updated":"2020-07-14T12:45:57Z","file_id":"4703","checksum":"162eea47d9d840c26b496ba6ae4d1c09"}],"scopus_import":1,"issue":"2","oa_version":"Published Version","day":"01","oa":1,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_published":"2012-09-01T00:00:00Z","status":"public","ddc":["020"],"popular_science":"1","main_file_link":[{"open_access":"1","url":" http://hdl.handle.net/10760/17625"}],"file_date_updated":"2020-07-14T12:45:57Z","language":[{"iso":"ger"}],"publication":"Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen & Bibliothekare","title":"Kontext Open Access: Creative Commons"},{"quality_controlled":"1","has_accepted_license":"1","publist_id":"3753","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_updated":"2021-01-12T07:40:07Z","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.","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>","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).","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>","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>.","ista":"Cremer S, Suefuji M, Schrempf A, Heinze J. 2012. The dynamics of male-male competition in Cardiocondyla obscurior ants. BMC Ecology. 12, 7."},"pubrep_id":"94","volume":12,"publisher":"BioMed Central","department":[{"_id":"SyCr"}],"_id":"2966","year":"2012","type":"journal_article","article_number":"7","date_created":"2018-12-11T12:00:35Z","intvolume":"        12","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","last_name":"Suefuji","first_name":"Masaki"},{"first_name":"Alexandra","last_name":"Schrempf","full_name":"Schrempf, Alexandra"},{"last_name":"Heinze","first_name":"Jürgen","full_name":"Heinze, Jürgen"}],"publication_status":"published","month":"06","oa":1,"day":"15","oa_version":"Published Version","doi":"10.1186/1472-6785-12-7","scopus_import":1,"file":[{"file_name":"IST-2012-94-v1+1_1472-6785-12-7.pdf","access_level":"open_access","date_updated":"2020-07-14T12:45:57Z","checksum":"03d004bdff3724fb1627e3f5004bad80","file_id":"4706","relation":"main_file","content_type":"application/pdf","creator":"system","file_size":489994,"date_created":"2018-12-12T10:08:44Z"}],"title":"The dynamics of male-male competition in Cardiocondyla obscurior ants","publication":"BMC Ecology","language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:45:57Z","ddc":["570"],"status":"public","date_published":"2012-06-15T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"scopus_import":1,"issue":"3","oa_version":"None","doi":"10.1145/2287718.2287727","day":"01","date_published":"2012-08-01T00:00:00Z","acknowledgement":"This research was supported in part by the NSF Cybertrust award CNS 0524059, by the European Research Council (ERC) Advanced Investigator Grant QUAREM, and by the Austrian Science Fund (FWF) project S11402-N23.","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","status":"public","title":"Algorithmic analysis of array-accessing programs","publication":"ACM Transactions on Computational Logic (TOCL)","language":[{"iso":"eng"}],"department":[{"_id":"ToHe"}],"publisher":"ACM","citation":{"ista":"Alur R, Cerny P, Weinstein S. 2012. Algorithmic analysis of array-accessing programs. ACM Transactions on Computational Logic (TOCL). 13(3), 27.","mla":"Alur, Rajeev, et al. “Algorithmic Analysis of Array-Accessing Programs.” <i>ACM Transactions on Computational Logic (TOCL)</i>, vol. 13, no. 3, 27, ACM, 2012, doi:<a href=\"https://doi.org/10.1145/2287718.2287727\">10.1145/2287718.2287727</a>.","apa":"Alur, R., Cerny, P., &#38; Weinstein, S. (2012). Algorithmic analysis of array-accessing programs. <i>ACM Transactions on Computational Logic (TOCL)</i>. ACM. <a href=\"https://doi.org/10.1145/2287718.2287727\">https://doi.org/10.1145/2287718.2287727</a>","chicago":"Alur, Rajeev, Pavol Cerny, and Scott Weinstein. “Algorithmic Analysis of Array-Accessing Programs.” <i>ACM Transactions on Computational Logic (TOCL)</i>. ACM, 2012. <a href=\"https://doi.org/10.1145/2287718.2287727\">https://doi.org/10.1145/2287718.2287727</a>.","ieee":"R. Alur, P. Cerny, and S. Weinstein, “Algorithmic analysis of array-accessing programs,” <i>ACM Transactions on Computational Logic (TOCL)</i>, vol. 13, no. 3. ACM, 2012.","short":"R. Alur, P. Cerny, S. Weinstein, ACM Transactions on Computational Logic (TOCL) 13 (2012).","ama":"Alur R, Cerny P, Weinstein S. Algorithmic analysis of array-accessing programs. <i>ACM Transactions on Computational Logic (TOCL)</i>. 2012;13(3). doi:<a href=\"https://doi.org/10.1145/2287718.2287727\">10.1145/2287718.2287727</a>"},"volume":13,"publist_id":"3748","quality_controlled":"1","date_updated":"2023-02-23T12:09:43Z","abstract":[{"lang":"eng","text":"For programs whose data variables range over Boolean or finite domains, program verification is decidable, and this forms the basis of recent tools for software model checking. In this article, we consider algorithmic verification of programs that use Boolean variables, and in addition, access a single read-only array whose length is potentially unbounded, and whose elements range over an unbounded data domain. We show that the reachability problem, while undecidable in general, is (1) PSPACE-complete for programs in which the array-accessing for-loops are not nested, (2) decidable for a restricted class of programs with doubly nested loops. The second result establishes connections to automata and logics defining languages over data words."}],"author":[{"full_name":"Alur, Rajeev","first_name":"Rajeev","last_name":"Alur"},{"id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","last_name":"Cerny","first_name":"Pavol","full_name":"Cerny, Pavol"},{"last_name":"Weinstein","first_name":"Scott","full_name":"Weinstein, Scott"}],"publication_status":"published","project":[{"name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"267989"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23"}],"ec_funded":1,"month":"08","date_created":"2018-12-11T12:00:36Z","intvolume":"        13","year":"2012","_id":"2967","type":"journal_article","article_number":"27","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"4403"}]}},{"file_date_updated":"2020-07-14T12:45:57Z","publication":"Molecular Ecology","language":[{"iso":"eng"}],"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. ","date_published":"2012-09-01T00:00:00Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","status":"public","ddc":["570","579"],"oa":1,"day":"01","file":[{"creator":"system","date_created":"2018-12-12T10:17:47Z","file_size":235820,"file_name":"IST-2014-296-v1+1_4_wasps_revised3.pdf","content_type":"application/pdf","relation":"main_file","access_level":"open_access","date_updated":"2020-07-14T12:45:57Z","checksum":"c14ee4cb2a8ba9575bfd8a9bb7a883bb","file_id":"5304"},{"file_id":"5305","checksum":"f00afc5b887c8222014b57375b8caece","date_updated":"2020-07-14T12:45:57Z","access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_name":"IST-2014-296-v1+2_4_wasps_Supporting2.pdf","file_size":41975,"date_created":"2018-12-12T10:17:48Z","creator":"system"}],"issue":"18","scopus_import":1,"oa_version":"Submitted Version","doi":"10.1111/j.1365-294X.2012.05700.x","type":"journal_article","related_material":{"record":[{"id":"13075","status":"public","relation":"research_data"}]},"_id":"2968","year":"2012","publication_status":"published","project":[{"call_identifier":"FP7","grant_number":"250152","_id":"25B07788-B435-11E9-9278-68D0E5697425","name":"Limits to selection in biology and in evolutionary computation"}],"month":"09","ec_funded":1,"author":[{"full_name":"Lohse, Konrad","first_name":"Konrad","last_name":"Lohse"},{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240","first_name":"Nicholas H","last_name":"Barton","full_name":"Barton, Nicholas H"},{"full_name":"Melika, George","last_name":"Melika","first_name":"George"},{"first_name":"Graham","last_name":"Stone","full_name":"Stone, Graham"}],"intvolume":"        21","date_created":"2018-12-11T12:00:36Z","citation":{"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.","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>.","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.","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>.","short":"K. Lohse, N.H. Barton, G. Melika, G. Stone, Molecular Ecology 21 (2012) 4605–4617.","ama":"Lohse K, Barton NH, Melika G, Stone G. A likelihood based comparison of population histories in a parasitoid guild. <i>Molecular Ecology</i>. 2012;21(18):4605-4617. doi:<a href=\"https://doi.org/10.1111/j.1365-294X.2012.05700.x\">10.1111/j.1365-294X.2012.05700.x</a>"},"pubrep_id":"296","volume":21,"page":"4605 - 4617","date_updated":"2023-05-30T13:07:47Z","abstract":[{"lang":"eng","text":"Little is known about the stability of trophic relationships in complex natural communities over evolutionary timescales. Here, we use sequence data from 18 nuclear loci to reconstruct and compare the intraspecific histories of major Pleistocene refugial populations in the Middle East, the Balkans and Iberia in a guild of four Chalcid parasitoids (Cecidostiba fungosa, Cecidostiba semifascia, Hobbya stenonota and Mesopolobus amaenus) all attacking Cynipid oak galls. We develop a likelihood method to numerically estimate models of divergence between three populations from multilocus data. We investigate the power of this framework on simulated data, and-using triplet alignments of intronic loci-quantify the support for all possible divergence relationships between refugial populations in the four parasitoids. Although an East to West order of population divergence has highest support in all but one species, we cannot rule out alternative population tree topologies. Comparing the estimated times of population splits between species, we find that one species, M. amaenus, has a significantly older history than the rest of the guild and must have arrived in central Europe at least one glacial cycle prior to other guild members. This suggests that although all four species may share a common origin in the East, they expanded westwards into Europe at different times. © 2012 Blackwell Publishing Ltd."}],"has_accepted_license":"1","publist_id":"3746","quality_controlled":"1","department":[{"_id":"NiBa"}],"publisher":"Wiley-Blackwell"},{"main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3632771/","open_access":"1"}],"language":[{"iso":"eng"}],"publication":"Journal of Neuroscience","title":"Miniature IPSCs in hippocampal granule cells are triggered by voltage-gated Ca^(2+) channels via microdomain coupling","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","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_published":"2012-10-10T00:00:00Z","status":"public","day":"10","oa":1,"scopus_import":1,"issue":"41","external_id":{"pmid":["23055500"]},"doi":"10.1523/JNEUROSCI.6104-11.2012","oa_version":"Submitted Version","type":"journal_article","_id":"2969","year":"2012","month":"10","project":[{"grant_number":"SFB-TR3-TP10B","_id":"25BDE9A4-B435-11E9-9278-68D0E5697425","name":"Glutamaterge synaptische Übertragung und Plastizität in hippocampalen Mikroschaltkreisen"}],"publication_status":"published","author":[{"first_name":"Sarit","last_name":"Goswami","full_name":"Goswami, Sarit","id":"3A578F32-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Bucurenciu, Iancu","last_name":"Bucurenciu","first_name":"Iancu"},{"last_name":"Jonas","first_name":"Peter M","full_name":"Jonas, Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5001-4804"}],"intvolume":"        32","date_created":"2018-12-11T12:00:36Z","citation":{"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.","short":"S. Goswami, I. Bucurenciu, P.M. Jonas, Journal of Neuroscience 32 (2012) 14294–14304.","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>.","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."},"page":"14294 - 14304","volume":32,"abstract":[{"lang":"eng","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"}],"date_updated":"2021-01-12T07:40:08Z","publist_id":"3744","quality_controlled":"1","department":[{"_id":"PeJo"}],"pmid":1,"publisher":"Society for Neuroscience"},{"_id":"2970","year":"2012","type":"journal_article","title":"Investigating the principles of morphogen gradient formation: from tissues to cells","publication":"Current Opinion in Genetics & Development","language":[{"iso":"eng"}],"author":[{"full_name":"Kicheva, Anna","last_name":"Kicheva","first_name":"Anna","orcid":"0000-0003-4509-4998","id":"3959A2A0-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Bollenbach, Mark Tobias","last_name":"Bollenbach","first_name":"Mark Tobias","id":"3E6DB97A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4398-476X"},{"last_name":"Wartlick","first_name":"Ortrud","full_name":"Wartlick, Ortrud"},{"first_name":"Frank","last_name":"Julicher","full_name":"Julicher, Frank"},{"first_name":"Marcos","last_name":"Gonzalez Gaitan","full_name":"Gonzalez Gaitan, Marcos"}],"date_published":"2012-12-01T00:00:00Z","publication_status":"published","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.","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","month":"12","date_created":"2018-12-11T12:00:37Z","intvolume":"        22","status":"public","page":"527 - 532","citation":{"ista":"Kicheva A, Bollenbach MT, Wartlick O, Julicher F, Gonzalez Gaitan M. 2012. Investigating the principles of morphogen gradient formation: from tissues to cells. Current Opinion in Genetics &#38; Development. 22(6), 527–532.","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>","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.","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>.","short":"A. Kicheva, M.T. Bollenbach, O. Wartlick, F. Julicher, M. Gonzalez Gaitan, Current Opinion in Genetics &#38; Development 22 (2012) 527–532.","mla":"Kicheva, Anna, et al. “Investigating the Principles of Morphogen Gradient Formation: From Tissues to Cells.” <i>Current Opinion in Genetics &#38; Development</i>, vol. 22, no. 6, Elsevier, 2012, pp. 527–32, doi:<a href=\"https://doi.org/10.1016/j.gde.2012.08.004\">10.1016/j.gde.2012.08.004</a>.","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>"},"volume":22,"day":"01","quality_controlled":"1","publist_id":"3739","date_updated":"2021-01-12T07:40:09Z","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"}],"scopus_import":1,"issue":"6","oa_version":"None","publisher":"Elsevier","doi":"10.1016/j.gde.2012.08.004"},{"abstract":[{"lang":"eng","text":"We study the task of interactive semantic labeling of a segmentation hierarchy. To this end we propose a framework interleaving two components: an automatic labeling step, based on a Conditional Random Field whose dependencies are defined by the inclusion tree of the segmentation hierarchy, and an interaction step that integrates incremental input from a human user. Evaluated on two distinct datasets, the proposed interactive approach efficiently integrates human interventions and illustrates the advantages of structured prediction in an interactive framework. "}],"date_updated":"2021-01-12T07:40:10Z","quality_controlled":"1","publist_id":"3737","day":"01","page":"11 - 20","citation":{"ista":"Zankl G, Haxhimusa Y, Ion A. 2012. Interactive labeling of image segmentation hierarchies. Pattern Recognition vol. 7476, 11–20.","chicago":"Zankl, Georg, Yll Haxhimusa, and Adrian Ion. “Interactive Labeling of Image Segmentation Hierarchies,” 7476:11–20. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-32717-9_2\">https://doi.org/10.1007/978-3-642-32717-9_2</a>.","ama":"Zankl G, Haxhimusa Y, Ion A. Interactive labeling of image segmentation hierarchies. In: Vol 7476. Springer; 2012:11-20. doi:<a href=\"https://doi.org/10.1007/978-3-642-32717-9_2\">10.1007/978-3-642-32717-9_2</a>","short":"G. Zankl, Y. Haxhimusa, A. Ion, in:, Springer, 2012, pp. 11–20.","ieee":"G. Zankl, Y. Haxhimusa, and A. Ion, “Interactive labeling of image segmentation hierarchies,” presented at the Pattern Recognition, Graz, Austria, 2012, vol. 7476, pp. 11–20.","apa":"Zankl, G., Haxhimusa, Y., &#38; Ion, A. (2012). Interactive labeling of image segmentation hierarchies (Vol. 7476, pp. 11–20). Presented at the Pattern Recognition, Graz, Austria: Springer. <a href=\"https://doi.org/10.1007/978-3-642-32717-9_2\">https://doi.org/10.1007/978-3-642-32717-9_2</a>","mla":"Zankl, Georg, et al. <i>Interactive Labeling of Image Segmentation Hierarchies</i>. Vol. 7476, Springer, 2012, pp. 11–20, doi:<a href=\"https://doi.org/10.1007/978-3-642-32717-9_2\">10.1007/978-3-642-32717-9_2</a>."},"volume":7476,"conference":{"name":"Pattern Recognition","location":"Graz, Austria","start_date":"2012-08-28","end_date":"2012-08-31"},"doi":"10.1007/978-3-642-32717-9_2","oa_version":"None","publisher":"Springer","department":[{"_id":"HeEd"}],"scopus_import":1,"language":[{"iso":"eng"}],"title":"Interactive labeling of image segmentation hierarchies","type":"conference","_id":"2971","year":"2012","intvolume":"      7476","status":"public","date_created":"2018-12-11T12:00:37Z","month":"01","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publication_status":"published","date_published":"2012-01-01T00:00:00Z","author":[{"full_name":"Zankl, Georg","first_name":"Georg","last_name":"Zankl"},{"last_name":"Haxhimusa","first_name":"Yll","full_name":"Haxhimusa, Yll"},{"id":"29F89302-F248-11E8-B48F-1D18A9856A87","last_name":"Ion","first_name":"Adrian","full_name":"Ion, Adrian"}]},{"department":[{"_id":"KrCh"}],"publisher":"Elsevier","pubrep_id":"935","page":"49 - 60","volume":458,"citation":{"short":"K. Chatterjee, L. Doyen, Theoretical Computer Science 458 (2012) 49–60.","chicago":"Chatterjee, Krishnendu, and Laurent Doyen. “Energy Parity Games.” <i>Theoretical Computer Science</i>. Elsevier, 2012. <a href=\"https://doi.org/10.1016/j.tcs.2012.07.038\">https://doi.org/10.1016/j.tcs.2012.07.038</a>.","ieee":"K. Chatterjee and L. Doyen, “Energy parity games,” <i>Theoretical Computer Science</i>, vol. 458. Elsevier, pp. 49–60, 2012.","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>","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>.","ista":"Chatterjee K, Doyen L. 2012. Energy parity games. Theoretical Computer Science. 458, 49–60."},"has_accepted_license":"1","publist_id":"3736","quality_controlled":"1","date_updated":"2023-02-23T11:45:29Z","tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)"},"abstract":[{"lang":"eng","text":"Energy parity games are infinite two-player turn-based games played on weighted graphs. The objective of the game combines a (qualitative) parity condition with the (quantitative) requirement that the sum of the weights (i.e., the level of energy in the game) must remain positive. Beside their own interest in the design and synthesis of resource-constrained omega-regular specifications, energy parity games provide one of the simplest model of games with combined qualitative and quantitative objectives. Our main results are as follows: (a) exponential memory is sufficient and may be necessary for winning strategies in energy parity games; (b) the problem of deciding the winner in energy parity games can be solved in NP ∩ coNP; and (c) we give an algorithm to solve energy parity by reduction to energy games. We also show that the problem of deciding the winner in energy parity games is logspace-equivalent to the problem of deciding the winner in mean-payoff parity games, which can thus be solved in NP ∩ coNP. As a consequence we also obtain a conceptually simple algorithm to solve mean-payoff parity games."}],"author":[{"last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"full_name":"Doyen, Laurent","first_name":"Laurent","last_name":"Doyen"}],"project":[{"grant_number":"P 23499-N23","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"publication_status":"published","month":"11","ec_funded":1,"date_created":"2018-12-11T12:00:37Z","intvolume":"       458","year":"2012","_id":"2972","type":"journal_article","related_material":{"record":[{"relation":"earlier_version","id":"3851","status":"public"}]},"external_id":{"arxiv":["1001.5183"]},"scopus_import":1,"file":[{"checksum":"719e4a5af5a01ad3f2f7f7f05b3c2b09","file_id":"5935","date_updated":"2020-07-14T12:45:57Z","access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_name":"2012_Elsevier_Chatterjee.pdf","file_size":351271,"date_created":"2019-02-06T11:56:22Z","creator":"kschuh"}],"oa_version":"Published Version","doi":"10.1016/j.tcs.2012.07.038","oa":1,"day":"02","date_published":"2012-11-02T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["004"],"status":"public","file_date_updated":"2020-07-14T12:45:57Z","title":"Energy parity games","arxiv":1,"publication":"Theoretical Computer Science","language":[{"iso":"eng"}]}]