[{"date_updated":"2021-01-12T06:56:18Z","page":"108 - 118","article_type":"original","abstract":[{"lang":"eng","text":"Plant growth is achieved predominantly by cellular elongation, which is thought to be controlled on several levels by apoplastic auxin. Auxin export into the apoplast is achieved by plasma membrane efflux catalysts of the PIN-FORMED (PIN) and ATP-binding cassette protein subfamily B/phosphor- glycoprotein (ABCB/PGP) classes; the latter were shown to depend on interaction with the FKBP42, TWISTED DWARF1 (TWD1). Here by using a transgenic approach in combination with phenotypical, biochemical and cell biological analyses we demonstrate the importance of a putative C-terminal in-plane membrane anchor of TWD1 in the regulation of ABCB-mediated auxin transport. In contrast with dwarfed twd1 loss-of-function alleles, TWD1 gain-of-function lines that lack a putative in-plane membrane anchor (HA-TWD1-Ct) show hypermorphic plant architecture, characterized by enhanced stem length and leaf surface but reduced shoot branching. Greater hypocotyl length is the result of enhanced cell elongation that correlates with reduced polar auxin transport capacity for HA-TWD1-Ct. As a consequence, HA-TWD1-Ct displays higher hypocotyl auxin accumulation, which is shown to result in elevated auxin-induced cell elongation rates. Our data highlight the importance of C-terminal membrane anchoring for TWD1 action, which is required for specific regulation of ABCB-mediated auxin transport. These data support a model in which TWD1 controls lateral ABCB1-mediated export into the apoplast, which is required for auxin-mediated cell elongation."}],"issue":"1","author":[{"full_name":"Bailly, Aurélien","first_name":"Aurélien","last_name":"Bailly"},{"last_name":"Wang","first_name":"Bangjun","full_name":"Wang, Bangjun"},{"first_name":"Marta","full_name":"Zwiewka, Marta","last_name":"Zwiewka"},{"last_name":"Pollmann","first_name":"Stephan","full_name":"Pollmann, Stephan"},{"first_name":"Daniel","full_name":"Schenck, Daniel","last_name":"Schenck"},{"full_name":"Lüthen, Hartwig","first_name":"Hartwig","last_name":"Lüthen"},{"first_name":"Alexander","full_name":"Schulz, Alexander","last_name":"Schulz"},{"full_name":"Friml, Jirí","first_name":"Jirí","orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87","last_name":"Friml"},{"full_name":"Geisler, Markus","first_name":"Markus","last_name":"Geisler"}],"main_file_link":[{"url":"https://doi.org/10.1111/tpj.12369","open_access":"1"}],"publication_identifier":{"issn":["09607412"]},"type":"journal_article","intvolume":" 77","publisher":"Wiley-Blackwell","department":[{"_id":"JiFr"}],"publication_status":"published","citation":{"ista":"Bailly A, Wang B, Zwiewka M, Pollmann S, Schenck D, Lüthen H, Schulz A, Friml J, Geisler M. 2014. Expression of TWISTED DWARF1 lacking its in-plane membrane anchor leads to increased cell elongation and hypermorphic growth. Plant Journal. 77(1), 108–118.","apa":"Bailly, A., Wang, B., Zwiewka, M., Pollmann, S., Schenck, D., Lüthen, H., … Geisler, M. (2014). Expression of TWISTED DWARF1 lacking its in-plane membrane anchor leads to increased cell elongation and hypermorphic growth. Plant Journal. Wiley-Blackwell. https://doi.org/10.1111/tpj.12369","ama":"Bailly A, Wang B, Zwiewka M, et al. Expression of TWISTED DWARF1 lacking its in-plane membrane anchor leads to increased cell elongation and hypermorphic growth. Plant Journal. 2014;77(1):108-118. doi:10.1111/tpj.12369","ieee":"A. Bailly et al., “Expression of TWISTED DWARF1 lacking its in-plane membrane anchor leads to increased cell elongation and hypermorphic growth,” Plant Journal, vol. 77, no. 1. Wiley-Blackwell, pp. 108–118, 2014.","short":"A. Bailly, B. Wang, M. Zwiewka, S. Pollmann, D. Schenck, H. Lüthen, A. Schulz, J. Friml, M. Geisler, Plant Journal 77 (2014) 108–118.","chicago":"Bailly, Aurélien, Bangjun Wang, Marta Zwiewka, Stephan Pollmann, Daniel Schenck, Hartwig Lüthen, Alexander Schulz, Jiří Friml, and Markus Geisler. “Expression of TWISTED DWARF1 Lacking Its In-Plane Membrane Anchor Leads to Increased Cell Elongation and Hypermorphic Growth.” Plant Journal. Wiley-Blackwell, 2014. https://doi.org/10.1111/tpj.12369.","mla":"Bailly, Aurélien, et al. “Expression of TWISTED DWARF1 Lacking Its In-Plane Membrane Anchor Leads to Increased Cell Elongation and Hypermorphic Growth.” Plant Journal, vol. 77, no. 1, Wiley-Blackwell, 2014, pp. 108–18, doi:10.1111/tpj.12369."},"date_created":"2018-12-11T11:56:35Z","date_published":"2014-01-01T00:00:00Z","_id":"2253","title":"Expression of TWISTED DWARF1 lacking its in-plane membrane anchor leads to increased cell elongation and hypermorphic growth","quality_controlled":"1","scopus_import":1,"oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"4694","day":"01","article_processing_charge":"No","year":"2014","language":[{"iso":"eng"}],"status":"public","month":"01","publication":"Plant Journal","doi":"10.1111/tpj.12369","project":[{"_id":"256BDAB0-B435-11E9-9278-68D0E5697425","name":"Innovationsförderung in der Grenzregion Österreich – Tschechische Republik durch die Schaffung von Synergien im Bereich der Forschungsinfrastruktur"}],"oa":1,"volume":77},{"day":"08","publist_id":"4692","pubrep_id":"422","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"01","language":[{"iso":"eng"}],"status":"public","year":"2014","quality_controlled":"1","has_accepted_license":"1","oa_version":"Published Version","scopus_import":1,"volume":81,"oa":1,"publication":"Neuron","project":[{"_id":"25C0F108-B435-11E9-9278-68D0E5697425","name":"Nanophysiology of fast-spiking, parvalbumin-expressing GABAergic interneurons","call_identifier":"FP7","grant_number":"268548"},{"grant_number":"P24909-B24","call_identifier":"FWF","name":"Mechanisms of transmitter release at GABAergic synapses","_id":"25C26B1E-B435-11E9-9278-68D0E5697425"}],"doi":"10.1016/j.neuron.2013.09.046","ddc":["570"],"publication_identifier":{"issn":["08966273"]},"type":"journal_article","intvolume":" 81","page":"140 - 152","abstract":[{"text":"Theta-gamma network oscillations are thought to represent key reference signals for information processing in neuronal ensembles, but the underlying synaptic mechanisms remain unclear. To address this question, we performed whole-cell (WC) patch-clamp recordings from mature hippocampal granule cells (GCs) in vivo in the dentate gyrus of anesthetized and awake rats. GCs in vivo fired action potentials at low frequency, consistent with sparse coding in the dentate gyrus. GCs were exposed to barrages of fast AMPAR-mediated excitatory postsynaptic currents (EPSCs), primarily relayed from the entorhinal cortex, and inhibitory postsynaptic currents (IPSCs), presumably generated by local interneurons. EPSCs exhibited coherence with the field potential predominantly in the theta frequency band, whereas IPSCs showed coherence primarily in the gamma range. Action potentials in GCs were phase locked to network oscillations. Thus, theta-gamma-modulated synaptic currents may provide a framework for sparse temporal coding of information in the dentate gyrus.","lang":"eng"}],"date_updated":"2021-01-12T06:56:19Z","author":[{"first_name":"Alejandro","full_name":"Pernia-Andrade, Alejandro","id":"36963E98-F248-11E8-B48F-1D18A9856A87","last_name":"Pernia-Andrade"},{"first_name":"Peter M","full_name":"Jonas, Peter M","orcid":"0000-0001-5001-4804","last_name":"Jonas","id":"353C1B58-F248-11E8-B48F-1D18A9856A87"}],"file_date_updated":"2020-07-14T12:45:35Z","issue":"1","date_created":"2018-12-11T11:56:35Z","citation":{"ista":"Pernia-Andrade A, Jonas PM. 2014. Theta-gamma-modulated synaptic currents in hippocampal granule cells in vivo define a mechanism for network oscillations. Neuron. 81(1), 140–152.","short":"A. Pernia-Andrade, P.M. Jonas, Neuron 81 (2014) 140–152.","mla":"Pernia-Andrade, Alejandro, and Peter M. Jonas. “Theta-Gamma-Modulated Synaptic Currents in Hippocampal Granule Cells in Vivo Define a Mechanism for Network Oscillations.” Neuron, vol. 81, no. 1, Elsevier, 2014, pp. 140–52, doi:10.1016/j.neuron.2013.09.046.","chicago":"Pernia-Andrade, Alejandro, and Peter M Jonas. “Theta-Gamma-Modulated Synaptic Currents in Hippocampal Granule Cells in Vivo Define a Mechanism for Network Oscillations.” Neuron. Elsevier, 2014. https://doi.org/10.1016/j.neuron.2013.09.046.","apa":"Pernia-Andrade, A., & Jonas, P. M. (2014). Theta-gamma-modulated synaptic currents in hippocampal granule cells in vivo define a mechanism for network oscillations. Neuron. Elsevier. https://doi.org/10.1016/j.neuron.2013.09.046","ama":"Pernia-Andrade A, Jonas PM. Theta-gamma-modulated synaptic currents in hippocampal granule cells in vivo define a mechanism for network oscillations. Neuron. 2014;81(1):140-152. doi:10.1016/j.neuron.2013.09.046","ieee":"A. Pernia-Andrade and P. M. Jonas, “Theta-gamma-modulated synaptic currents in hippocampal granule cells in vivo define a mechanism for network oscillations,” Neuron, vol. 81, no. 1. Elsevier, pp. 140–152, 2014."},"publication_status":"published","title":"Theta-gamma-modulated synaptic currents in hippocampal granule cells in vivo define a mechanism for network oscillations","ec_funded":1,"date_published":"2014-01-08T00:00:00Z","_id":"2254","file":[{"creator":"system","file_id":"4773","file_size":4373072,"date_updated":"2020-07-14T12:45:35Z","checksum":"438547cfcd9045a22f065f2019f07849","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"IST-2016-422-v1+1_1-s2.0-S0896627313009227-main.pdf","date_created":"2018-12-12T10:09:48Z"}],"department":[{"_id":"PeJo"}],"publisher":"Elsevier"},{"doi":"10.1007/s10851-013-0468-x","project":[{"call_identifier":"FP7","grant_number":"318493","_id":"255D761E-B435-11E9-9278-68D0E5697425","name":"Topological Complex Systems"}],"publication":"Journal of Mathematical Imaging and Vision","oa":1,"volume":50,"scopus_import":1,"related_material":{"record":[{"status":"public","id":"2843","relation":"earlier_version"},{"relation":"dissertation_contains","id":"1399","status":"public"}]},"oa_version":"Submitted Version","has_accepted_license":"1","quality_controlled":"1","language":[{"iso":"eng"}],"status":"public","year":"2014","month":"09","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","pubrep_id":"549","publist_id":"4691","day":"01","publisher":"Springer","department":[{"_id":"HeEd"}],"file":[{"content_type":"application/pdf","date_created":"2018-12-12T10:16:18Z","file_name":"IST-2016-549-v1+1_2014-J-06-LengthEstimate.pdf","file_id":"5204","file_size":3941391,"creator":"system","access_level":"open_access","relation":"main_file","date_updated":"2020-07-14T12:45:35Z","checksum":"2f93f3e63a38a85cd4404d7953913b14"}],"_id":"2255","date_published":"2014-09-01T00:00:00Z","ec_funded":1,"title":"Stable length estimates of tube-like shapes","citation":{"ieee":"H. Edelsbrunner and F. Pausinger, “Stable length estimates of tube-like shapes,” Journal of Mathematical Imaging and Vision, vol. 50, no. 1. Springer, pp. 164–177, 2014.","ama":"Edelsbrunner H, Pausinger F. Stable length estimates of tube-like shapes. Journal of Mathematical Imaging and Vision. 2014;50(1):164-177. doi:10.1007/s10851-013-0468-x","apa":"Edelsbrunner, H., & Pausinger, F. (2014). Stable length estimates of tube-like shapes. Journal of Mathematical Imaging and Vision. Springer. https://doi.org/10.1007/s10851-013-0468-x","mla":"Edelsbrunner, Herbert, and Florian Pausinger. “Stable Length Estimates of Tube-like Shapes.” Journal of Mathematical Imaging and Vision, vol. 50, no. 1, Springer, 2014, pp. 164–77, doi:10.1007/s10851-013-0468-x.","chicago":"Edelsbrunner, Herbert, and Florian Pausinger. “Stable Length Estimates of Tube-like Shapes.” Journal of Mathematical Imaging and Vision. Springer, 2014. https://doi.org/10.1007/s10851-013-0468-x.","short":"H. Edelsbrunner, F. Pausinger, Journal of Mathematical Imaging and Vision 50 (2014) 164–177.","ista":"Edelsbrunner H, Pausinger F. 2014. Stable length estimates of tube-like shapes. Journal of Mathematical Imaging and Vision. 50(1), 164–177."},"publication_status":"published","date_created":"2018-12-11T11:56:36Z","issue":"1","file_date_updated":"2020-07-14T12:45:35Z","author":[{"last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","orcid":"0000-0002-9823-6833"},{"last_name":"Pausinger","id":"2A77D7A2-F248-11E8-B48F-1D18A9856A87","first_name":"Florian","full_name":"Pausinger, Florian","orcid":"0000-0002-8379-3768"}],"date_updated":"2023-09-07T11:41:25Z","page":"164 - 177","abstract":[{"text":"Motivated by applications in biology, we present an algorithm for estimating the length of tube-like shapes in 3-dimensional Euclidean space. In a first step, we combine the tube formula of Weyl with integral geometric methods to obtain an integral representation of the length, which we approximate using a variant of the Koksma-Hlawka Theorem. In a second step, we use tools from computational topology to decrease the dependence on small perturbations of the shape. We present computational experiments that shed light on the stability and the convergence rate of our algorithm.","lang":"eng"}],"type":"journal_article","intvolume":" 50","publication_identifier":{"issn":["09249907"]},"ddc":["000"]},{"intvolume":" 10","type":"journal_article","publication_identifier":{"issn":["1553734X"]},"ddc":["570"],"issue":"1","file_date_updated":"2020-07-14T12:45:35Z","main_file_link":[{"url":"http://repository.ist.ac.at/id/eprint/436","open_access":"1"}],"author":[{"last_name":"Tkacik","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6699-1455","full_name":"Tkacik, Gasper","first_name":"Gasper"},{"last_name":"Marre","first_name":"Olivier","full_name":"Marre, Olivier"},{"last_name":"Amodei","first_name":"Dario","full_name":"Amodei, Dario"},{"full_name":"Schneidman, Elad","first_name":"Elad","last_name":"Schneidman"},{"full_name":"Bialek, William","first_name":"William","last_name":"Bialek"},{"first_name":"Michael","full_name":"Berry, Michael","last_name":"Berry"}],"acknowledgement":"\r\n\r\n\r\n\r\nThis work was funded by NSF grant IIS-0613435, NSF grant PHY-0957573, NSF grant CCF-0939370, NIH grant R01 EY14196, NIH grant P50 GM071508, the Fannie and John Hertz Foundation, the Swartz Foundation, the WM Keck Foundation, ANR Optima and the French State program “Investissements d'Avenir” [LIFESENSES: ANR-10-LABX-65], and the Austrian Research Foundation FWF P25651.","date_updated":"2024-02-21T13:46:14Z","abstract":[{"text":"Maximum entropy models are the least structured probability distributions that exactly reproduce a chosen set of statistics measured in an interacting network. Here we use this principle to construct probabilistic models which describe the correlated spiking activity of populations of up to 120 neurons in the salamander retina as it responds to natural movies. Already in groups as small as 10 neurons, interactions between spikes can no longer be regarded as small perturbations in an otherwise independent system; for 40 or more neurons pairwise interactions need to be supplemented by a global interaction that controls the distribution of synchrony in the population. Here we show that such “K-pairwise” models—being systematic extensions of the previously used pairwise Ising models—provide an excellent account of the data. We explore the properties of the neural vocabulary by: 1) estimating its entropy, which constrains the population's capacity to represent visual information; 2) classifying activity patterns into a small set of metastable collective modes; 3) showing that the neural codeword ensembles are extremely inhomogenous; 4) demonstrating that the state of individual neurons is highly predictable from the rest of the population, allowing the capacity for error correction.","lang":"eng"}],"article_number":"e1003408","_id":"2257","date_published":"2014-01-02T00:00:00Z","title":"Searching for collective behavior in a large network of sensory neurons","publication_status":"published","citation":{"ama":"Tkačik G, Marre O, Amodei D, Schneidman E, Bialek W, Berry M. Searching for collective behavior in a large network of sensory neurons. PLoS Computational Biology. 2014;10(1). doi:10.1371/journal.pcbi.1003408","ieee":"G. Tkačik, O. Marre, D. Amodei, E. Schneidman, W. Bialek, and M. Berry, “Searching for collective behavior in a large network of sensory neurons,” PLoS Computational Biology, vol. 10, no. 1. Public Library of Science, 2014.","apa":"Tkačik, G., Marre, O., Amodei, D., Schneidman, E., Bialek, W., & Berry, M. (2014). Searching for collective behavior in a large network of sensory neurons. PLoS Computational Biology. Public Library of Science. https://doi.org/10.1371/journal.pcbi.1003408","chicago":"Tkačik, Gašper, Olivier Marre, Dario Amodei, Elad Schneidman, William Bialek, and Michael Berry. “Searching for Collective Behavior in a Large Network of Sensory Neurons.” PLoS Computational Biology. Public Library of Science, 2014. https://doi.org/10.1371/journal.pcbi.1003408.","mla":"Tkačik, Gašper, et al. “Searching for Collective Behavior in a Large Network of Sensory Neurons.” PLoS Computational Biology, vol. 10, no. 1, e1003408, Public Library of Science, 2014, doi:10.1371/journal.pcbi.1003408.","short":"G. Tkačik, O. Marre, D. Amodei, E. Schneidman, W. Bialek, M. Berry, PLoS Computational Biology 10 (2014).","ista":"Tkačik G, Marre O, Amodei D, Schneidman E, Bialek W, Berry M. 2014. Searching for collective behavior in a large network of sensory neurons. PLoS Computational Biology. 10(1), e1003408."},"date_created":"2018-12-11T11:56:36Z","publisher":"Public Library of Science","department":[{"_id":"GaTk"}],"file":[{"content_type":"application/pdf","date_created":"2018-12-12T10:12:46Z","file_name":"IST-2016-436-v1+1_journal.pcbi.1003408.pdf","creator":"system","file_size":2194790,"file_id":"4965","relation":"main_file","access_level":"open_access","checksum":"c720222c5e924a4acb17f23b9381a6ca","date_updated":"2020-07-14T12:45:35Z"}],"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"status":"public","language":[{"iso":"eng"}],"year":"2014","month":"01","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","pubrep_id":"436","publist_id":"4689","day":"02","scopus_import":1,"related_material":{"record":[{"status":"public","id":"5562","relation":"popular_science"}]},"oa_version":"Published Version","has_accepted_license":"1","quality_controlled":"1","oa":1,"volume":10,"doi":"10.1371/journal.pcbi.1003408","publication":"PLoS Computational Biology"},{"volume":42,"oa":1,"publication":"Nucleic Acids Research","doi":"10.1093/nar/gkt1290","pubrep_id":"961","publist_id":"4684","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"05","language":[{"iso":"eng"}],"year":"2014","status":"public","month":"03","has_accepted_license":"1","quality_controlled":"1","scopus_import":1,"oa_version":"Preprint","date_created":"2018-12-11T11:56:38Z","publication_status":"published","citation":{"ista":"Zhu F, Gamboa M, Farruggio A, Hippenmeyer S, Tasic B, Schüle B, Chen Tsai Y, Calos M. 2014. DICE, an efficient system for iterative genomic editing in human pluripotent stem cells. Nucleic Acids Research. 42(5), e34.","short":"F. Zhu, M. Gamboa, A. Farruggio, S. Hippenmeyer, B. Tasic, B. Schüle, Y. Chen Tsai, M. Calos, Nucleic Acids Research 42 (2014).","mla":"Zhu, Fangfang, et al. “DICE, an Efficient System for Iterative Genomic Editing in Human Pluripotent Stem Cells.” Nucleic Acids Research, vol. 42, no. 5, e34, Oxford University Press, 2014, doi:10.1093/nar/gkt1290.","chicago":"Zhu, Fangfang, Matthew Gamboa, Alfonso Farruggio, Simon Hippenmeyer, Bosiljka Tasic, Birgitt Schüle, Yanru Chen Tsai, and Michele Calos. “DICE, an Efficient System for Iterative Genomic Editing in Human Pluripotent Stem Cells.” Nucleic Acids Research. Oxford University Press, 2014. https://doi.org/10.1093/nar/gkt1290.","apa":"Zhu, F., Gamboa, M., Farruggio, A., Hippenmeyer, S., Tasic, B., Schüle, B., … Calos, M. (2014). DICE, an efficient system for iterative genomic editing in human pluripotent stem cells. Nucleic Acids Research. Oxford University Press. https://doi.org/10.1093/nar/gkt1290","ama":"Zhu F, Gamboa M, Farruggio A, et al. DICE, an efficient system for iterative genomic editing in human pluripotent stem cells. Nucleic Acids Research. 2014;42(5). doi:10.1093/nar/gkt1290","ieee":"F. Zhu et al., “DICE, an efficient system for iterative genomic editing in human pluripotent stem cells,” Nucleic Acids Research, vol. 42, no. 5. Oxford University Press, 2014."},"_id":"2261","date_published":"2014-03-05T00:00:00Z","title":"DICE, an efficient system for iterative genomic editing in human pluripotent stem cells","file":[{"access_level":"open_access","relation":"main_file","checksum":"e9268f5f96a820f04d7ebbf85927c3cb","date_updated":"2020-07-14T12:45:35Z","file_size":11044478,"file_id":"4738","creator":"system","date_created":"2018-12-12T10:09:15Z","file_name":"IST-2018-961-v1+1_2014_Hippenmeyer_DICE.pdf","content_type":"application/pdf"}],"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"department":[{"_id":"SiHi"}],"publisher":"Oxford University Press","ddc":["571","610"],"type":"journal_article","intvolume":" 42","date_updated":"2021-01-12T06:56:22Z","article_number":"e34","abstract":[{"lang":"eng","text":"To reveal the full potential of human pluripotent stem cells, new methods for rapid, site-specific genomic engineering are needed. Here, we describe a system for precise genetic modification of human embryonic stem cells (ESCs) and induced pluripotent stem cells (iPSCs). We identified a novel human locus, H11, located in a safe, intergenic, transcriptionally active region of chromosome 22, as the recipient site, to provide robust, ubiquitous expression of inserted genes. Recipient cell lines were established by site-specific placement of a ‘landing pad’ cassette carrying attP sites for phiC31 and Bxb1 integrases at the H11 locus by spontaneous or TALEN-assisted homologous recombination. Dual integrase cassette exchange (DICE) mediated by phiC31 and Bxb1 integrases was used to insert genes of interest flanked by phiC31 and Bxb1 attB sites at the H11 locus, replacing the landing pad. This system provided complete control over content, direction and copy number of inserted genes, with a specificity of 100%. A series of genes, including mCherry and various combinations of the neural transcription factors LMX1a, FOXA2 and OTX2, were inserted in recipient cell lines derived from H9 ESC, as well as iPSC lines derived from a Parkinson’s disease patient and a normal sibling control. The DICE system offers rapid, efficient and precise gene insertion in ESC and iPSC and is particularly well suited for repeated modifications of the same locus."}],"file_date_updated":"2020-07-14T12:45:35Z","issue":"5","acknowledgement":"California Institute for Regenerative Medicine [RT2-01880 and TR2-01756]. Funding for open access charge: California Institute for Regenerative Medicine [RT2-01880 and TR2-01756]\r\nCC BY 3,0","author":[{"full_name":"Zhu, Fangfang","first_name":"Fangfang","last_name":"Zhu"},{"first_name":"Matthew","full_name":"Gamboa, Matthew","last_name":"Gamboa"},{"last_name":"Farruggio","full_name":"Farruggio, Alfonso","first_name":"Alfonso"},{"last_name":"Hippenmeyer","id":"37B36620-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2279-1061","full_name":"Hippenmeyer, Simon","first_name":"Simon"},{"last_name":"Tasic","first_name":"Bosiljka","full_name":"Tasic, Bosiljka"},{"first_name":"Birgitt","full_name":"Schüle, Birgitt","last_name":"Schüle"},{"last_name":"Chen Tsai","full_name":"Chen Tsai, Yanru","first_name":"Yanru"},{"full_name":"Calos, Michele","first_name":"Michele","last_name":"Calos"}]},{"publication_status":"published","citation":{"ista":"Hippenmeyer S. 2014.Molecular pathways controlling the sequential steps of cortical projection neuron migration. In: Cellular and Molecular Control of Neuronal Migration. Advances in Experimental Medicine and Biology, vol. 800, 1–24.","ieee":"S. Hippenmeyer, “Molecular pathways controlling the sequential steps of cortical projection neuron migration,” in Cellular and Molecular Control of Neuronal Migration, vol. 800, L. Nguyen, Ed. Springer, 2014, pp. 1–24.","ama":"Hippenmeyer S. Molecular pathways controlling the sequential steps of cortical projection neuron migration. In: Nguyen L, ed. Cellular and Molecular Control of Neuronal Migration. Vol 800. Springer; 2014:1-24. doi:10.1007/978-94-007-7687-6_1","apa":"Hippenmeyer, S. (2014). Molecular pathways controlling the sequential steps of cortical projection neuron migration. In L. Nguyen (Ed.), Cellular and Molecular Control of Neuronal Migration (Vol. 800, pp. 1–24). Springer. https://doi.org/10.1007/978-94-007-7687-6_1","mla":"Hippenmeyer, Simon. “Molecular Pathways Controlling the Sequential Steps of Cortical Projection Neuron Migration.” Cellular and Molecular Control of Neuronal Migration, edited by Laurent Nguyen, vol. 800, Springer, 2014, pp. 1–24, doi:10.1007/978-94-007-7687-6_1.","chicago":"Hippenmeyer, Simon. “Molecular Pathways Controlling the Sequential Steps of Cortical Projection Neuron Migration.” In Cellular and Molecular Control of Neuronal Migration, edited by Laurent Nguyen, 800:1–24. Springer, 2014. https://doi.org/10.1007/978-94-007-7687-6_1.","short":"S. Hippenmeyer, in:, L. Nguyen (Ed.), Cellular and Molecular Control of Neuronal Migration, Springer, 2014, pp. 1–24."},"date_created":"2018-12-11T11:56:39Z","_id":"2265","date_published":"2014-01-01T00:00:00Z","title":"Molecular pathways controlling the sequential steps of cortical projection neuron migration","volume":800,"publication":" Cellular and Molecular Control of Neuronal Migration","publisher":"Springer","doi":"10.1007/978-94-007-7687-6_1","department":[{"_id":"SiHi"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","alternative_title":["Advances in Experimental Medicine and Biology"],"publist_id":"4679","day":"01","status":"public","language":[{"iso":"eng"}],"type":"book_chapter","intvolume":" 800","year":"2014","month":"01","editor":[{"last_name":"Nguyen","full_name":"Nguyen, Laurent","first_name":"Laurent"}],"date_updated":"2021-01-12T06:56:23Z","page":"1 - 24","quality_controlled":"1","abstract":[{"lang":"eng","text":"Coordinated migration of newly-born neurons to their target territories is essential for correct neuronal circuit assembly in the developing brain. Although a cohort of signaling pathways has been implicated in the regulation of cortical projection neuron migration, the precise molecular mechanisms and how a balanced interplay of cell-autonomous and non-autonomous functions of candidate signaling molecules controls the discrete steps in the migration process, are just being revealed. In this chapter, I will focally review recent advances that improved our understanding of the cell-autonomous and possible cell-nonautonomous functions of the evolutionarily conserved LIS1/NDEL1-complex in regulating the sequential steps of cortical projection neuron migration. I will then elaborate on the emerging concept that the Reelin signaling pathway, acts exactly at precise stages in the course of cortical projection neuron migration. Lastly, I will discuss how finely tuned transcriptional programs and downstream effectors govern particular aspects in driving radial migration at discrete stages and how they regulate the precise positioning of cortical projection neurons in the developing cerebral cortex."}],"scopus_import":1,"author":[{"id":"37B36620-F248-11E8-B48F-1D18A9856A87","last_name":"Hippenmeyer","first_name":"Simon","full_name":"Hippenmeyer, Simon","orcid":"0000-0003-2279-1061"}],"oa_version":"None"},{"publisher":"IEEE","department":[{"_id":"VlKo"}],"file":[{"relation":"main_file","access_level":"open_access","date_updated":"2020-07-14T12:45:36Z","checksum":"4a74b5c92d6dcd2348c2c10ec8dd18bf","creator":"system","file_size":378601,"file_id":"4754","date_created":"2018-12-12T10:09:30Z","file_name":"IST-2016-566-v1+1_iccv13_part_enumeration.pdf","content_type":"application/pdf"}],"title":"Partial enumeration and curvature regularization","_id":"2275","date_published":"2014-03-03T00:00:00Z","publication_status":"published","citation":{"chicago":"Olsson, Carl, Johannes Ulen, Yuri Boykov, and Vladimir Kolmogorov. “Partial Enumeration and Curvature Regularization,” 2936–43. IEEE, 2014. https://doi.org/10.1109/ICCV.2013.365.","mla":"Olsson, Carl, et al. Partial Enumeration and Curvature Regularization. IEEE, 2014, pp. 2936–43, doi:10.1109/ICCV.2013.365.","short":"C. Olsson, J. Ulen, Y. Boykov, V. Kolmogorov, in:, IEEE, 2014, pp. 2936–2943.","ieee":"C. Olsson, J. Ulen, Y. Boykov, and V. Kolmogorov, “Partial enumeration and curvature regularization,” presented at the ICCV: International Conference on Computer Vision, Sydney, Australia, 2014, pp. 2936–2943.","ama":"Olsson C, Ulen J, Boykov Y, Kolmogorov V. Partial enumeration and curvature regularization. In: IEEE; 2014:2936-2943. doi:10.1109/ICCV.2013.365","apa":"Olsson, C., Ulen, J., Boykov, Y., & Kolmogorov, V. (2014). Partial enumeration and curvature regularization (pp. 2936–2943). Presented at the ICCV: International Conference on Computer Vision, Sydney, Australia: IEEE. https://doi.org/10.1109/ICCV.2013.365","ista":"Olsson C, Ulen J, Boykov Y, Kolmogorov V. 2014. Partial enumeration and curvature regularization. ICCV: International Conference on Computer Vision, 2936–2943."},"date_created":"2018-12-11T11:56:42Z","author":[{"last_name":"Olsson","first_name":"Carl","full_name":"Olsson, Carl"},{"last_name":"Ulen","full_name":"Ulen, Johannes","first_name":"Johannes"},{"last_name":"Boykov","full_name":"Boykov, Yuri","first_name":"Yuri"},{"full_name":"Kolmogorov, Vladimir","first_name":"Vladimir","last_name":"Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87"}],"file_date_updated":"2020-07-14T12:45:36Z","conference":{"name":"ICCV: International Conference on Computer Vision","location":"Sydney, Australia","end_date":"2013-12-08","start_date":"2013-12-01"},"abstract":[{"text":"Energies with high-order non-submodular interactions have been shown to be very useful in vision due to their high modeling power. Optimization of such energies, however, is generally NP-hard. A naive approach that works for small problem instances is exhaustive search, that is, enumeration of all possible labelings of the underlying graph. We propose a general minimization approach for large graphs based on enumeration of labelings of certain small patches. \r\nThis partial enumeration technique reduces complex high-order energy formulations to pairwise Constraint Satisfaction Problems with unary costs (uCSP), which can be efficiently solved using standard methods like TRW-S. Our approach outperforms a number of existing state-of-the-art algorithms on well known difficult problems (e.g. curvature regularization, stereo, deconvolution); it gives near global minimum and better speed. \r\nOur main application of interest is curvature regularization. In the context of segmentation, our partial enumeration technique allows to evaluate curvature directly on small patches using a novel integral geometry approach.\r\n","lang":"eng"}],"page":"2936 - 2943","date_updated":"2021-01-12T06:56:28Z","type":"conference","ddc":["000"],"doi":"10.1109/ICCV.2013.365","oa":1,"oa_version":"Submitted Version","scopus_import":1,"quality_controlled":"1","has_accepted_license":"1","month":"03","status":"public","year":"2014","language":[{"iso":"eng"}],"day":"03","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"4669","pubrep_id":"566"},{"volume":104,"oa":1,"doi":"10.1007/s11005-013-0667-9","arxiv":1,"publication":"Letters in Mathematical Physics","month":"02","status":"public","language":[{"iso":"eng"}],"year":"2014","article_processing_charge":"No","day":"01","publist_id":"4653","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","scopus_import":"1","quality_controlled":"1","external_id":{"arxiv":["1301.5682"]},"title":"On the mass concentration for Bose-Einstein condensates with attractive interactions","date_published":"2014-02-01T00:00:00Z","_id":"2281","date_created":"2018-12-11T11:56:44Z","publication_status":"published","citation":{"ista":"Guo Y, Seiringer R. 2014. On the mass concentration for Bose-Einstein condensates with attractive interactions. Letters in Mathematical Physics. 104(2), 141–156.","short":"Y. Guo, R. Seiringer, Letters in Mathematical Physics 104 (2014) 141–156.","chicago":"Guo, Yujin, and Robert Seiringer. “On the Mass Concentration for Bose-Einstein Condensates with Attractive Interactions.” Letters in Mathematical Physics. Springer, 2014. https://doi.org/10.1007/s11005-013-0667-9.","mla":"Guo, Yujin, and Robert Seiringer. “On the Mass Concentration for Bose-Einstein Condensates with Attractive Interactions.” Letters in Mathematical Physics, vol. 104, no. 2, Springer, 2014, pp. 141–56, doi:10.1007/s11005-013-0667-9.","apa":"Guo, Y., & Seiringer, R. (2014). On the mass concentration for Bose-Einstein condensates with attractive interactions. Letters in Mathematical Physics. Springer. https://doi.org/10.1007/s11005-013-0667-9","ieee":"Y. Guo and R. Seiringer, “On the mass concentration for Bose-Einstein condensates with attractive interactions,” Letters in Mathematical Physics, vol. 104, no. 2. Springer, pp. 141–156, 2014.","ama":"Guo Y, Seiringer R. On the mass concentration for Bose-Einstein condensates with attractive interactions. Letters in Mathematical Physics. 2014;104(2):141-156. doi:10.1007/s11005-013-0667-9"},"department":[{"_id":"RoSe"}],"publisher":"Springer","intvolume":" 104","type":"journal_article","author":[{"first_name":"Yujin","full_name":"Guo, Yujin","last_name":"Guo"},{"id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","last_name":"Seiringer","orcid":"0000-0002-6781-0521","full_name":"Seiringer, Robert","first_name":"Robert"}],"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1301.5682"}],"issue":"2","abstract":[{"text":"We consider two-dimensional Bose-Einstein condensates with attractive interaction, described by the Gross-Pitaevskii functional. Minimizers of this functional exist only if the interaction strength a satisfies {Mathematical expression}, where Q is the unique positive radial solution of {Mathematical expression} in {Mathematical expression}. We present a detailed analysis of the behavior of minimizers as a approaches a*, where all the mass concentrates at a global minimum of the trapping potential.","lang":"eng"}],"page":"141 - 156","article_type":"original","date_updated":"2024-02-14T12:19:42Z"},{"title":"Morpho-physiological criteria divide dentate gyrus interneurons into classes","_id":"2285","date_published":"2014-02-01T00:00:00Z","publication_status":"published","citation":{"ista":"Hosp J, Strüber M, Yanagawa Y, Obata K, Vida I, Jonas PM, Bartos M. 2014. Morpho-physiological criteria divide dentate gyrus interneurons into classes. Hippocampus. 23(2), 189–203.","apa":"Hosp, J., Strüber, M., Yanagawa, Y., Obata, K., Vida, I., Jonas, P. M., & Bartos, M. (2014). Morpho-physiological criteria divide dentate gyrus interneurons into classes. Hippocampus. Wiley-Blackwell. https://doi.org/10.1002/hipo.22214","ieee":"J. Hosp et al., “Morpho-physiological criteria divide dentate gyrus interneurons into classes,” Hippocampus, vol. 23, no. 2. Wiley-Blackwell, pp. 189–203, 2014.","ama":"Hosp J, Strüber M, Yanagawa Y, et al. Morpho-physiological criteria divide dentate gyrus interneurons into classes. Hippocampus. 2014;23(2):189-203. doi:10.1002/hipo.22214","short":"J. Hosp, M. Strüber, Y. Yanagawa, K. Obata, I. Vida, P.M. Jonas, M. Bartos, Hippocampus 23 (2014) 189–203.","chicago":"Hosp, Jonas, Michael Strüber, Yuchio Yanagawa, Kunihiko Obata, Imre Vida, Peter M Jonas, and Marlene Bartos. “Morpho-Physiological Criteria Divide Dentate Gyrus Interneurons into Classes.” Hippocampus. Wiley-Blackwell, 2014. https://doi.org/10.1002/hipo.22214.","mla":"Hosp, Jonas, et al. “Morpho-Physiological Criteria Divide Dentate Gyrus Interneurons into Classes.” Hippocampus, vol. 23, no. 2, Wiley-Blackwell, 2014, pp. 189–203, doi:10.1002/hipo.22214."},"date_created":"2018-12-11T11:56:46Z","publisher":"Wiley-Blackwell","department":[{"_id":"PeJo"}],"tmp":{"short":"CC BY-NC (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","image":"/images/cc_by_nc.png"},"file":[{"access_level":"open_access","relation":"main_file","date_updated":"2020-07-14T12:45:37Z","checksum":"ff6bc75a79dbc985a2e31b79253e6444","file_size":801589,"file_id":"5178","creator":"system","date_created":"2018-12-12T10:15:54Z","file_name":"IST-2016-461-v1+1_Hosp_et_al-2014-Hippocampus.pdf","content_type":"application/pdf"}],"intvolume":" 23","type":"journal_article","ddc":["570"],"acknowledgement":"Funded by Deutsche Forschungsgemeinschaft. Grant Numbers: SFB 505, SFB 780, BA1582/2-1 Excellence Initiative of the German Research Foundation (Spemann Graduate School). Grant Number: GSC-4 Lichtenberg Professorship-Award (VW-Foundation); Schram-Foundation; Excellence Initiative Brain Links-Brain Tools. The authors thank Drs. Jonas-Frederic Sauer and Claudio Elgueta for critically reading the manuscript. They also thank Karin Winterhalter, Margit Northemann and Ulrich Nöller for technical assistance.","author":[{"full_name":"Hosp, Jonas","first_name":"Jonas","last_name":"Hosp"},{"first_name":"Michael","full_name":"Strüber, Michael","last_name":"Strüber"},{"full_name":"Yanagawa, Yuchio","first_name":"Yuchio","last_name":"Yanagawa"},{"full_name":"Obata, Kunihiko","first_name":"Kunihiko","last_name":"Obata"},{"first_name":"Imre","full_name":"Vida, Imre","last_name":"Vida"},{"orcid":"0000-0001-5001-4804","first_name":"Peter M","full_name":"Jonas, Peter M","last_name":"Jonas","id":"353C1B58-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Bartos","full_name":"Bartos, Marlene","first_name":"Marlene"}],"issue":"2","file_date_updated":"2020-07-14T12:45:37Z","abstract":[{"text":"GABAergic inhibitory interneurons control fundamental aspects of neuronal network function. Their functional roles are assumed to be defined by the identity of their input synapses, the architecture of their dendritic tree, the passive and active membrane properties and finally the nature of their postsynaptic targets. Indeed, interneurons display a high degree of morphological and physiological heterogeneity. However, whether their morphological and physiological characteristics are correlated and whether interneuron diversity can be described by a continuum of GABAergic cell types or by distinct classes has remained unclear. Here we perform a detailed morphological and physiological characterization of GABAergic cells in the dentate gyrus, the input region of the hippocampus. To achieve an unbiased and efficient sampling and classification we used knock-in mice expressing the enhanced green fluorescent protein (eGFP) in glutamate decarboxylase 67 (GAD67)-positive neurons and performed cluster analysis. We identified five interneuron classes, each of them characterized by a distinct set of anatomical and physiological parameters. Cross-correlation analysis further revealed a direct relation between morphological and physiological properties indicating that dentate gyrus interneurons fall into functionally distinct classes which may differentially control neuronal network activity.","lang":"eng"}],"page":"189 - 203","date_updated":"2021-01-12T06:56:32Z","oa":1,"volume":23,"doi":"10.1002/hipo.22214","publication":"Hippocampus","month":"02","language":[{"iso":"eng"}],"status":"public","year":"2014","day":"01","user_id":"3FFCCD3A-F248-11E8-B48F-1D18A9856A87","pubrep_id":"461","publist_id":"4646","oa_version":"Published Version","scopus_import":1,"quality_controlled":"1","has_accepted_license":"1"},{"publisher":"Duke University Press","doi":"10.1215/00127094-2649752","department":[{"_id":"LaEr"}],"publication":"Duke Mathematical Journal","_id":"2699","date_published":"2014-04-01T00:00:00Z","oa":1,"title":"Universality of general β-ensembles","volume":163,"publication_status":"published","citation":{"apa":"Erdös, L., Bourgade, P., & Yau, H. (2014). Universality of general β-ensembles. Duke Mathematical Journal. Duke University Press. https://doi.org/10.1215/00127094-2649752","ama":"Erdös L, Bourgade P, Yau H. Universality of general β-ensembles. Duke Mathematical Journal. 2014;163(6):1127-1190. doi:10.1215/00127094-2649752","ieee":"L. Erdös, P. Bourgade, and H. Yau, “Universality of general β-ensembles,” Duke Mathematical Journal, vol. 163, no. 6. Duke University Press, pp. 1127–1190, 2014.","short":"L. Erdös, P. Bourgade, H. Yau, Duke Mathematical Journal 163 (2014) 1127–1190.","mla":"Erdös, László, et al. “Universality of General β-Ensembles.” Duke Mathematical Journal, vol. 163, no. 6, Duke University Press, 2014, pp. 1127–90, doi:10.1215/00127094-2649752.","chicago":"Erdös, László, Paul Bourgade, and Horng Yau. “Universality of General β-Ensembles.” Duke Mathematical Journal. Duke University Press, 2014. https://doi.org/10.1215/00127094-2649752.","ista":"Erdös L, Bourgade P, Yau H. 2014. Universality of general β-ensembles. Duke Mathematical Journal. 163(6), 1127–1190."},"date_created":"2018-12-11T11:59:08Z","issue":"6","scopus_import":1,"main_file_link":[{"url":"http://arxiv.org/abs/1104.2272","open_access":"1"}],"oa_version":"Preprint","author":[{"last_name":"Erdös","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","full_name":"Erdös, László","first_name":"László","orcid":"0000-0001-5366-9603"},{"full_name":"Bourgade, Paul","first_name":"Paul","last_name":"Bourgade"},{"last_name":"Yau","full_name":"Yau, Horng","first_name":"Horng"}],"date_updated":"2021-01-12T06:59:07Z","abstract":[{"text":"We prove the universality of the β-ensembles with convex analytic potentials and for any β >\r\n0, i.e. we show that the spacing distributions of log-gases at any inverse temperature β coincide with those of the Gaussian β-ensembles.","lang":"eng"}],"quality_controlled":"1","page":"1127 - 1190","language":[{"iso":"eng"}],"status":"public","type":"journal_article","year":"2014","intvolume":" 163","month":"04","user_id":"3FFCCD3A-F248-11E8-B48F-1D18A9856A87","publist_id":"4197","day":"01"},{"intvolume":" 51","type":"journal_article","issue":"3-4","acknowledgement":"Krishnendu Chatterjee is supported by Austrian Science Fund (FWF) Grant No P 23499-N23, FWF NFN Grant No S11407 (RiSE), ERC Starting Grant (279307: Graph Games) and Microsoft faculty fellowship. Mickael Randour is supported by F.R.S.-FNRS. fellowship. \r\nJean-François Raskin is supported by ERC Starting Grant (279499: inVEST).Thanks to D. Sbabo for useful pointers, V. Bruyère for comments on a preliminary draft, and A. Bohy for fruitful discussions about the Acacia+ tool. We are grateful to the anonymous reviewers for their insightful comments. ","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"},{"first_name":"Mickael","full_name":"Randour, Mickael","last_name":"Randour"},{"last_name":"Raskin","first_name":"Jean","full_name":"Raskin, Jean"}],"main_file_link":[{"url":"http://arxiv.org/abs/1201.5073","open_access":"1"}],"date_updated":"2023-02-21T16:06:56Z","article_type":"original","page":"129 - 163","abstract":[{"lang":"eng","text":"Multi-dimensional mean-payoff and energy games provide the mathematical foundation for the quantitative study of reactive systems, and play a central role in the emerging quantitative theory of verification and synthesis. In this work, we study the strategy synthesis problem for games with such multi-dimensional objectives along with a parity condition, a canonical way to express ω ω -regular conditions. While in general, the winning strategies in such games may require infinite memory, for synthesis the most relevant problem is the construction of a finite-memory winning strategy (if one exists). Our main contributions are as follows. First, we show a tight exponential bound (matching upper and lower bounds) on the memory required for finite-memory winning strategies in both multi-dimensional mean-payoff and energy games along with parity objectives. This significantly improves the triple exponential upper bound for multi energy games (without parity) that could be derived from results in literature for games on vector addition systems with states. Second, we present an optimal symbolic and incremental algorithm to compute a finite-memory winning strategy (if one exists) in such games. Finally, we give a complete characterization of when finite memory of strategies can be traded off for randomness. In particular, we show that for one-dimension mean-payoff parity games, randomized memoryless strategies are as powerful as their pure finite-memory counterparts."}],"date_published":"2014-06-01T00:00:00Z","_id":"2716","title":"Strategy synthesis for multi-dimensional quantitative objectives","citation":{"short":"K. Chatterjee, M. Randour, J. Raskin, Acta Informatica 51 (2014) 129–163.","mla":"Chatterjee, Krishnendu, et al. “Strategy Synthesis for Multi-Dimensional Quantitative Objectives.” Acta Informatica, vol. 51, no. 3–4, Springer, 2014, pp. 129–63, doi:10.1007/s00236-013-0182-6.","chicago":"Chatterjee, Krishnendu, Mickael Randour, and Jean Raskin. “Strategy Synthesis for Multi-Dimensional Quantitative Objectives.” Acta Informatica. Springer, 2014. https://doi.org/10.1007/s00236-013-0182-6.","apa":"Chatterjee, K., Randour, M., & Raskin, J. (2014). Strategy synthesis for multi-dimensional quantitative objectives. Acta Informatica. Springer. https://doi.org/10.1007/s00236-013-0182-6","ama":"Chatterjee K, Randour M, Raskin J. Strategy synthesis for multi-dimensional quantitative objectives. Acta Informatica. 2014;51(3-4):129-163. doi:10.1007/s00236-013-0182-6","ieee":"K. Chatterjee, M. Randour, and J. Raskin, “Strategy synthesis for multi-dimensional quantitative objectives,” Acta Informatica, vol. 51, no. 3–4. Springer, pp. 129–163, 2014.","ista":"Chatterjee K, Randour M, Raskin J. 2014. Strategy synthesis for multi-dimensional quantitative objectives. Acta Informatica. 51(3–4), 129–163."},"publication_status":"published","date_created":"2018-12-11T11:59:14Z","publisher":"Springer","department":[{"_id":"KrCh"}],"article_processing_charge":"No","year":"2014","status":"public","language":[{"iso":"eng"}],"month":"06","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"4176","day":"01","scopus_import":"1","related_material":{"record":[{"relation":"earlier_version","id":"10904","status":"public"}]},"oa_version":"Preprint","external_id":{"arxiv":["1201.5073"]},"quality_controlled":"1","oa":1,"volume":51,"doi":"10.1007/s00236-013-0182-6","project":[{"call_identifier":"FWF","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory"}],"publication":"Acta Informatica","arxiv":1},{"author":[{"last_name":"Fischlin","full_name":"Fischlin, Marc","first_name":"Marc"},{"last_name":"Lehmann","full_name":"Lehmann, Anja","first_name":"Anja"},{"first_name":"Krzysztof Z","full_name":"Pietrzak, Krzysztof Z","orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak"}],"oa_version":"None","scopus_import":1,"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"3225"}]},"issue":"3","page":"397 - 428","quality_controlled":"1","abstract":[{"text":"A robust combiner for hash functions takes two candidate implementations and constructs a hash function which is secure as long as at least one of the candidates is secure. So far, hash function combiners only aim at preserving a single property such as collision-resistance or pseudorandomness. However, when hash functions are used in protocols like TLS they are often required to provide several properties simultaneously. We therefore put forward the notion of robust multi-property combiners and elaborate on different definitions for such combiners. We then propose a combiner that provably preserves (target) collision-resistance, pseudorandomness, and being a secure message authentication code. This combiner satisfies the strongest notion we propose, which requires that the combined function satisfies every security property which is satisfied by at least one of the underlying hash function. If the underlying hash functions have output length n, the combiner has output length 2 n. This basically matches a known lower bound for black-box combiners for collision-resistance only, thus the other properties can be achieved without penalizing the length of the hash values. We then propose a combiner which also preserves the property of being indifferentiable from a random oracle, slightly increasing the output length to 2 n+ω(log n). Moreover, we show how to augment our constructions in order to make them also robust for the one-wayness property, but in this case require an a priory upper bound on the input length.","lang":"eng"}],"date_updated":"2023-02-23T11:17:53Z","month":"07","status":"public","language":[{"iso":"eng"}],"intvolume":" 27","type":"journal_article","year":"2014","day":"01","publist_id":"3940","user_id":"3FFCCD3A-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"KrPi"}],"publisher":"Springer","doi":"10.1007/s00145-013-9148-7","publication":"Journal of Cryptology","title":"Robust multi-property combiners for hash functions","volume":27,"date_published":"2014-07-01T00:00:00Z","_id":"2852","date_created":"2018-12-11T11:59:56Z","publication_status":"published","citation":{"ista":"Fischlin M, Lehmann A, Pietrzak KZ. 2014. Robust multi-property combiners for hash functions. Journal of Cryptology. 27(3), 397–428.","mla":"Fischlin, Marc, et al. “Robust Multi-Property Combiners for Hash Functions.” Journal of Cryptology, vol. 27, no. 3, Springer, 2014, pp. 397–428, doi:10.1007/s00145-013-9148-7.","chicago":"Fischlin, Marc, Anja Lehmann, and Krzysztof Z Pietrzak. “Robust Multi-Property Combiners for Hash Functions.” Journal of Cryptology. Springer, 2014. https://doi.org/10.1007/s00145-013-9148-7.","short":"M. Fischlin, A. Lehmann, K.Z. Pietrzak, Journal of Cryptology 27 (2014) 397–428.","ama":"Fischlin M, Lehmann A, Pietrzak KZ. Robust multi-property combiners for hash functions. Journal of Cryptology. 2014;27(3):397-428. doi:10.1007/s00145-013-9148-7","ieee":"M. Fischlin, A. Lehmann, and K. Z. Pietrzak, “Robust multi-property combiners for hash functions,” Journal of Cryptology, vol. 27, no. 3. Springer, pp. 397–428, 2014.","apa":"Fischlin, M., Lehmann, A., & Pietrzak, K. Z. (2014). Robust multi-property combiners for hash functions. Journal of Cryptology. Springer. https://doi.org/10.1007/s00145-013-9148-7"}},{"department":[{"_id":"HeEd"}],"publisher":"European Mathematical Society Publishing House","file":[{"checksum":"1d4a046f1af945c407c5c4d411d4c5e4","date_updated":"2020-07-14T12:45:52Z","access_level":"open_access","relation":"main_file","file_id":"5232","file_size":435320,"creator":"system","file_name":"IST-2016-544-v1+1_2012-P-11-PHTheoryPractice.pdf","date_created":"2018-12-12T10:16:43Z","content_type":"application/pdf"}],"_id":"2905","date_published":"2014-01-01T00:00:00Z","title":"Persistent homology: Theory and practice","date_created":"2018-12-11T12:00:16Z","publication_status":"published","citation":{"ista":"Edelsbrunner H, Morozovy D. 2014. Persistent homology: Theory and practice. ECM: European Congress of Mathematics, 31–50.","apa":"Edelsbrunner, H., & Morozovy, D. (2014). Persistent homology: Theory and practice (pp. 31–50). Presented at the ECM: European Congress of Mathematics, Kraków, Poland: European Mathematical Society Publishing House. https://doi.org/10.4171/120-1/3","ieee":"H. Edelsbrunner and D. Morozovy, “Persistent homology: Theory and practice,” presented at the ECM: European Congress of Mathematics, Kraków, Poland, 2014, pp. 31–50.","ama":"Edelsbrunner H, Morozovy D. Persistent homology: Theory and practice. In: European Mathematical Society Publishing House; 2014:31-50. doi:10.4171/120-1/3","short":"H. Edelsbrunner, D. Morozovy, in:, European Mathematical Society Publishing House, 2014, pp. 31–50.","chicago":"Edelsbrunner, Herbert, and Dmitriy Morozovy. “Persistent Homology: Theory and Practice,” 31–50. European Mathematical Society Publishing House, 2014. https://doi.org/10.4171/120-1/3.","mla":"Edelsbrunner, Herbert, and Dmitriy Morozovy. Persistent Homology: Theory and Practice. European Mathematical Society Publishing House, 2014, pp. 31–50, doi:10.4171/120-1/3."},"file_date_updated":"2020-07-14T12:45:52Z","acknowledgement":"This research is partially supported by NSF under grant DBI-0820624, by ESF under the Research Networking Programme, and by the Russian Government Project 11.G34.31.0053.","author":[{"last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","orcid":"0000-0002-9823-6833"},{"first_name":"Dmitriy","full_name":"Morozovy, Dmitriy","last_name":"Morozovy"}],"date_updated":"2021-01-12T07:00:36Z","abstract":[{"lang":"eng","text":"Persistent homology is a recent grandchild of homology that has found use in\r\nscience and engineering as well as in mathematics. This paper surveys the method as well\r\nas the applications, neglecting completeness in favor of highlighting ideas and directions."}],"page":"31 - 50","conference":{"location":"Kraków, Poland","name":"ECM: European Congress of Mathematics","start_date":"2012-07-02","end_date":"2012-07-07"},"type":"conference","ddc":["000"],"doi":"10.4171/120-1/3","oa":1,"oa_version":"Submitted Version","has_accepted_license":"1","quality_controlled":"1","status":"public","year":"2014","language":[{"iso":"eng"}],"article_processing_charge":"No","month":"01","pubrep_id":"544","publist_id":"3842","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01"},{"type":"journal_article","intvolume":" 9","ddc":["570"],"acknowledgement":"This work was supported by The Israel Science Foundation and The Human Frontiers Science Program.\r\nWe thank the referees for helping significantly improve this paper. We also thank Vijay Balasubramanian, Kristina Simmons, and Jason Prentice for stimulating discussions. GT wishes to thank the faculty and students of the “Methods in Computational Neuroscience” course at Marine Biological Laboratory, Woods Hole.\r\n","author":[{"id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","last_name":"Tkacik","orcid":"0000-0002-6699-1455","full_name":"Tkacik, Gasper","first_name":"Gasper"},{"first_name":"Anandamohan","full_name":"Ghosh, Anandamohan","last_name":"Ghosh"},{"last_name":"Schneidman","full_name":"Schneidman, Elad","first_name":"Elad"},{"last_name":"Segev","first_name":"Ronen","full_name":"Segev, Ronen"}],"file_date_updated":"2020-07-14T12:46:06Z","issue":"1","abstract":[{"lang":"eng","text":"Adaptation in the retina is thought to optimize the encoding of natural light signals into sequences of spikes sent to the brain. While adaptive changes in retinal processing to the variations of the mean luminance level and second-order stimulus statistics have been documented before, no such measurements have been performed when higher-order moments of the light distribution change. We therefore measured the ganglion cell responses in the tiger salamander retina to controlled changes in the second (contrast), third (skew) and fourth (kurtosis) moments of the light intensity distribution of spatially uniform temporally independent stimuli. The skew and kurtosis of the stimuli were chosen to cover the range observed in natural scenes. We quantified adaptation in ganglion cells by studying linear-nonlinear models that capture well the retinal encoding properties across all stimuli. We found that the encoding properties of retinal ganglion cells change only marginally when higher-order statistics change, compared to the changes observed in response to the variation in contrast. By analyzing optimal coding in LN-type models, we showed that neurons can maintain a high information rate without large dynamic adaptation to changes in skew or kurtosis. This is because, for uncorrelated stimuli, spatio-temporal summation within the receptive field averages away non-gaussian aspects of the light intensity distribution."}],"article_number":"e85841","date_updated":"2021-01-12T07:42:14Z","title":"Adaptation to changes in higher-order stimulus statistics in the salamander retina","_id":"3263","date_published":"2014-01-21T00:00:00Z","date_created":"2018-12-11T12:02:20Z","publication_status":"published","citation":{"ista":"Tkačik G, Ghosh A, Schneidman E, Segev R. 2014. Adaptation to changes in higher-order stimulus statistics in the salamander retina. PLoS One. 9(1), e85841.","ieee":"G. Tkačik, A. Ghosh, E. Schneidman, and R. Segev, “Adaptation to changes in higher-order stimulus statistics in the salamander retina,” PLoS One, vol. 9, no. 1. Public Library of Science, 2014.","ama":"Tkačik G, Ghosh A, Schneidman E, Segev R. Adaptation to changes in higher-order stimulus statistics in the salamander retina. PLoS One. 2014;9(1). doi:10.1371/journal.pone.0085841","apa":"Tkačik, G., Ghosh, A., Schneidman, E., & Segev, R. (2014). Adaptation to changes in higher-order stimulus statistics in the salamander retina. PLoS One. Public Library of Science. https://doi.org/10.1371/journal.pone.0085841","mla":"Tkačik, Gašper, et al. “Adaptation to Changes in Higher-Order Stimulus Statistics in the Salamander Retina.” PLoS One, vol. 9, no. 1, e85841, Public Library of Science, 2014, doi:10.1371/journal.pone.0085841.","chicago":"Tkačik, Gašper, Anandamohan Ghosh, Elad Schneidman, and Ronen Segev. “Adaptation to Changes in Higher-Order Stimulus Statistics in the Salamander Retina.” PLoS One. Public Library of Science, 2014. https://doi.org/10.1371/journal.pone.0085841.","short":"G. Tkačik, A. Ghosh, E. Schneidman, R. Segev, PLoS One 9 (2014)."},"department":[{"_id":"GaTk"}],"publisher":"Public Library of Science","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"file_name":"IST-2016-432-v1+1_journal.pone.0085841.pdf","date_created":"2018-12-12T10:13:28Z","content_type":"application/pdf","checksum":"1d5816b343abe5eadc3eb419bcece971","date_updated":"2020-07-14T12:46:06Z","relation":"main_file","access_level":"open_access","creator":"system","file_size":1568524,"file_id":"5011"}],"month":"01","year":"2014","language":[{"iso":"eng"}],"status":"public","day":"21","pubrep_id":"432","publist_id":"3385","user_id":"3FFCCD3A-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","scopus_import":1,"quality_controlled":"1","has_accepted_license":"1","volume":9,"oa":1,"doi":"10.1371/journal.pone.0085841","publication":"PLoS One"},{"publisher":"Springer Nature","department":[{"_id":"HeEd"}],"title":"Notes on the simplification of the Morse-Smale complex","ec_funded":1,"_id":"10817","date_published":"2014-03-19T00:00:00Z","citation":{"ista":"Günther D, Reininghaus J, Seidel H-P, Weinkauf T. 2014.Notes on the simplification of the Morse-Smale complex. In: Topological Methods in Data Analysis and Visualization III. , 135–150.","short":"D. Günther, J. Reininghaus, H.-P. Seidel, T. Weinkauf, in:, P.-T. Bremer, I. Hotz, V. Pascucci, R. Peikert (Eds.), Topological Methods in Data Analysis and Visualization III., Springer Nature, Cham, 2014, pp. 135–150.","mla":"Günther, David, et al. “Notes on the Simplification of the Morse-Smale Complex.” Topological Methods in Data Analysis and Visualization III., edited by Peer-Timo Bremer et al., Springer Nature, 2014, pp. 135–50, doi:10.1007/978-3-319-04099-8_9.","chicago":"Günther, David, Jan Reininghaus, Hans-Peter Seidel, and Tino Weinkauf. “Notes on the Simplification of the Morse-Smale Complex.” In Topological Methods in Data Analysis and Visualization III., edited by Peer-Timo Bremer, Ingrid Hotz, Valerio Pascucci, and Ronald Peikert, 135–50. Mathematics and Visualization. Cham: Springer Nature, 2014. https://doi.org/10.1007/978-3-319-04099-8_9.","apa":"Günther, D., Reininghaus, J., Seidel, H.-P., & Weinkauf, T. (2014). Notes on the simplification of the Morse-Smale complex. In P.-T. Bremer, I. Hotz, V. Pascucci, & R. Peikert (Eds.), Topological Methods in Data Analysis and Visualization III. (pp. 135–150). Cham: Springer Nature. https://doi.org/10.1007/978-3-319-04099-8_9","ieee":"D. Günther, J. Reininghaus, H.-P. Seidel, and T. Weinkauf, “Notes on the simplification of the Morse-Smale complex,” in Topological Methods in Data Analysis and Visualization III., P.-T. Bremer, I. Hotz, V. Pascucci, and R. Peikert, Eds. Cham: Springer Nature, 2014, pp. 135–150.","ama":"Günther D, Reininghaus J, Seidel H-P, Weinkauf T. Notes on the simplification of the Morse-Smale complex. In: Bremer P-T, Hotz I, Pascucci V, Peikert R, eds. Topological Methods in Data Analysis and Visualization III. Mathematics and Visualization. Cham: Springer Nature; 2014:135-150. doi:10.1007/978-3-319-04099-8_9"},"publication_status":"published","date_created":"2022-03-04T08:33:57Z","acknowledgement":"This research is supported and funded by the Digiteo unTopoVis project, the TOPOSYS project FP7-ICT-318493-STREP, and MPC-VCC.","author":[{"last_name":"Günther","full_name":"Günther, David","first_name":"David"},{"full_name":"Reininghaus, Jan","first_name":"Jan","id":"4505473A-F248-11E8-B48F-1D18A9856A87","last_name":"Reininghaus"},{"first_name":"Hans-Peter","full_name":"Seidel, Hans-Peter","last_name":"Seidel"},{"first_name":"Tino","full_name":"Weinkauf, Tino","last_name":"Weinkauf"}],"abstract":[{"text":"The Morse-Smale complex can be either explicitly or implicitly represented. Depending on the type of representation, the simplification of the Morse-Smale complex works differently. In the explicit representation, the Morse-Smale complex is directly simplified by explicitly reconnecting the critical points during the simplification. In the implicit representation, on the other hand, the Morse-Smale complex is given by a combinatorial gradient field. In this setting, the simplification changes the combinatorial flow, which yields an indirect simplification of the Morse-Smale complex. The topological complexity of the Morse-Smale complex is reduced in both representations. However, the simplifications generally yield different results. In this chapter, we emphasize properties of the two representations that cause these differences. We also provide a complexity analysis of the two schemes with respect to running time and memory consumption.","lang":"eng"}],"page":"135-150","date_updated":"2023-09-05T15:33:45Z","editor":[{"last_name":"Bremer","first_name":"Peer-Timo","full_name":"Bremer, Peer-Timo"},{"full_name":"Hotz, Ingrid","first_name":"Ingrid","last_name":"Hotz"},{"last_name":"Pascucci","first_name":"Valerio","full_name":"Pascucci, Valerio"},{"last_name":"Peikert","first_name":"Ronald","full_name":"Peikert, Ronald"}],"type":"book_chapter","publication_identifier":{"issn":["1612-3786"],"isbn":["9783319040981"],"eissn":["2197-666X"],"eisbn":["9783319040998"]},"doi":"10.1007/978-3-319-04099-8_9","project":[{"grant_number":"318493","call_identifier":"FP7","name":"Topological Complex Systems","_id":"255D761E-B435-11E9-9278-68D0E5697425"}],"publication":"Topological Methods in Data Analysis and Visualization III.","oa_version":"None","scopus_import":"1","quality_controlled":"1","series_title":"Mathematics and Visualization","month":"03","article_processing_charge":"No","status":"public","language":[{"iso":"eng"}],"year":"2014","day":"19","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","place":"Cham"},{"intvolume":" 8318","type":"conference","publication_identifier":{"eissn":["1611-3349"],"eisbn":["9783642540134"],"issn":["0302-9743"],"isbn":["9783642540127"]},"acknowledgement":"This work was supported by the Austrian Science Fund through grant P23499-N23\r\nand through the RiSE network (S11403, S11405, S11406, S11407-N23); ERC Starting Grant (279307: Graph Games); Vienna Science and Technology Fund (WWTF)\r\ngrants PROSEED, ICT12-059, and VRG11-005.","main_file_link":[{"url":" https://doi.org/10.48550/arXiv.1311.4425","open_access":"1"}],"author":[{"last_name":"Aminof","id":"4A55BD00-F248-11E8-B48F-1D18A9856A87","first_name":"Benjamin","full_name":"Aminof, Benjamin"},{"full_name":"Jacobs, Swen","first_name":"Swen","last_name":"Jacobs"},{"full_name":"Khalimov, Ayrat","first_name":"Ayrat","last_name":"Khalimov"},{"first_name":"Sasha","full_name":"Rubin, Sasha","last_name":"Rubin","id":"2EC51194-F248-11E8-B48F-1D18A9856A87"}],"conference":{"end_date":"2014-01-21","start_date":"2014-01-19","name":"VMCAI: Verifcation, Model Checking, and Abstract Interpretation","location":"San Diego, CA, United States"},"abstract":[{"text":"We revisit the parameterized model checking problem for token-passing systems and specifications in indexed CTL ∗ \\X. Emerson and Namjoshi (1995, 2003) have shown that parameterized model checking of indexed CTL ∗ \\X in uni-directional token rings can be reduced to checking rings up to some cutoff size. Clarke et al. (2004) have shown a similar result for general topologies and indexed LTL \\X, provided processes cannot choose the directions for sending or receiving the token.\r\nWe unify and substantially extend these results by systematically exploring fragments of indexed CTL ∗ \\X with respect to general topologies. For each fragment we establish whether a cutoff exists, and for some concrete topologies, such as rings, cliques and stars, we infer small cutoffs. Finally, we show that the problem becomes undecidable, and thus no cutoffs exist, if processes are allowed to choose the directions in which they send or from which they receive the token.","lang":"eng"}],"page":"262-281","date_updated":"2022-05-17T08:36:01Z","ec_funded":1,"title":"Parameterized model checking of token-passing systems","_id":"10884","date_published":"2014-01-30T00:00:00Z","citation":{"ista":"Aminof B, Jacobs S, Khalimov A, Rubin S. 2014. Parameterized model checking of token-passing systems. Verification, Model Checking, and Abstract Interpretation. VMCAI: Verifcation, Model Checking, and Abstract Interpretation, LNCS, vol. 8318, 262–281.","short":"B. Aminof, S. Jacobs, A. Khalimov, S. Rubin, in:, Verification, Model Checking, and Abstract Interpretation, Springer Nature, 2014, pp. 262–281.","mla":"Aminof, Benjamin, et al. “Parameterized Model Checking of Token-Passing Systems.” Verification, Model Checking, and Abstract Interpretation, vol. 8318, Springer Nature, 2014, pp. 262–81, doi:10.1007/978-3-642-54013-4_15.","chicago":"Aminof, Benjamin, Swen Jacobs, Ayrat Khalimov, and Sasha Rubin. “Parameterized Model Checking of Token-Passing Systems.” In Verification, Model Checking, and Abstract Interpretation, 8318:262–81. Springer Nature, 2014. https://doi.org/10.1007/978-3-642-54013-4_15.","apa":"Aminof, B., Jacobs, S., Khalimov, A., & Rubin, S. (2014). Parameterized model checking of token-passing systems. In Verification, Model Checking, and Abstract Interpretation (Vol. 8318, pp. 262–281). San Diego, CA, United States: Springer Nature. https://doi.org/10.1007/978-3-642-54013-4_15","ieee":"B. Aminof, S. Jacobs, A. Khalimov, and S. Rubin, “Parameterized model checking of token-passing systems,” in Verification, Model Checking, and Abstract Interpretation, San Diego, CA, United States, 2014, vol. 8318, pp. 262–281.","ama":"Aminof B, Jacobs S, Khalimov A, Rubin S. Parameterized model checking of token-passing systems. In: Verification, Model Checking, and Abstract Interpretation. Vol 8318. Springer Nature; 2014:262-281. doi:10.1007/978-3-642-54013-4_15"},"publication_status":"published","date_created":"2022-03-18T13:01:22Z","publisher":"Springer Nature","department":[{"_id":"KrCh"}],"month":"01","article_processing_charge":"No","language":[{"iso":"eng"}],"status":"public","year":"2014","day":"30","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","alternative_title":["LNCS"],"oa_version":"Preprint","scopus_import":"1","quality_controlled":"1","external_id":{"arxiv":["1311.4425"]},"oa":1,"volume":8318,"doi":"10.1007/978-3-642-54013-4_15","project":[{"call_identifier":"FWF","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","call_identifier":"FWF","grant_number":"S11407"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307"}],"publication":"Verification, Model Checking, and Abstract Interpretation","arxiv":1},{"publication":"VMCAI 2014: Verification, Model Checking, and Abstract Interpretation","arxiv":1,"doi":"10.1007/978-3-642-54013-4_5","project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","call_identifier":"FWF"},{"grant_number":"S11407","call_identifier":"FWF","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","call_identifier":"FP7"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"volume":8318,"quality_controlled":"1","external_id":{"arxiv":["1311.3238"]},"oa_version":"Preprint","related_material":{"record":[{"relation":"later_version","id":"681","status":"public"}]},"scopus_import":"1","day":"30","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","alternative_title":["LNCS"],"month":"01","article_processing_charge":"No","language":[{"iso":"eng"}],"year":"2014","status":"public","publisher":"Springer Nature","department":[{"_id":"KrCh"}],"citation":{"ista":"Chatterjee K, Doyen L, Filiot E, Raskin J-F. 2014. Doomsday equilibria for omega-regular games. VMCAI 2014: Verification, Model Checking, and Abstract Interpretation. VMCAI: Verifcation, Model Checking, and Abstract Interpretation, LNCS, vol. 8318, 78–97.","short":"K. Chatterjee, L. Doyen, E. Filiot, J.-F. Raskin, in:, VMCAI 2014: Verification, Model Checking, and Abstract Interpretation, Springer Nature, 2014, pp. 78–97.","chicago":"Chatterjee, Krishnendu, Laurent Doyen, Emmanuel Filiot, and Jean-François Raskin. “Doomsday Equilibria for Omega-Regular Games.” In VMCAI 2014: Verification, Model Checking, and Abstract Interpretation, 8318:78–97. Springer Nature, 2014. https://doi.org/10.1007/978-3-642-54013-4_5.","mla":"Chatterjee, Krishnendu, et al. “Doomsday Equilibria for Omega-Regular Games.” VMCAI 2014: Verification, Model Checking, and Abstract Interpretation, vol. 8318, Springer Nature, 2014, pp. 78–97, doi:10.1007/978-3-642-54013-4_5.","apa":"Chatterjee, K., Doyen, L., Filiot, E., & Raskin, J.-F. (2014). Doomsday equilibria for omega-regular games. In VMCAI 2014: Verification, Model Checking, and Abstract Interpretation (Vol. 8318, pp. 78–97). San Diego, CA, United States: Springer Nature. https://doi.org/10.1007/978-3-642-54013-4_5","ieee":"K. Chatterjee, L. Doyen, E. Filiot, and J.-F. Raskin, “Doomsday equilibria for omega-regular games,” in VMCAI 2014: Verification, Model Checking, and Abstract Interpretation, San Diego, CA, United States, 2014, vol. 8318, pp. 78–97.","ama":"Chatterjee K, Doyen L, Filiot E, Raskin J-F. Doomsday equilibria for omega-regular games. In: VMCAI 2014: Verification, Model Checking, and Abstract Interpretation. Vol 8318. Springer Nature; 2014:78-97. doi:10.1007/978-3-642-54013-4_5"},"publication_status":"published","date_created":"2022-03-18T13:03:15Z","title":"Doomsday equilibria for omega-regular games","ec_funded":1,"_id":"10885","date_published":"2014-01-30T00:00:00Z","conference":{"name":"VMCAI: Verifcation, Model Checking, and Abstract Interpretation","location":"San Diego, CA, United States","end_date":"2014-01-21","start_date":"2014-01-19"},"page":"78-97","abstract":[{"lang":"eng","text":"Two-player games on graphs provide the theoretical framework for many important problems such as reactive synthesis. While the traditional study of two-player zero-sum games has been extended to multi-player games with several notions of equilibria, they are decidable only for perfect-information games, whereas several applications require imperfect-information games.\r\nIn this paper we propose a new notion of equilibria, called doomsday equilibria, which is a strategy profile such that all players satisfy their own objective, and if any coalition of players deviates and violates even one of the players objective, then the objective of every player is violated.\r\nWe present algorithms and complexity results for deciding the existence of doomsday equilibria for various classes of ω-regular objectives, both for imperfect-information games, and for perfect-information games.We provide optimal complexity bounds for imperfect-information games, and in most cases for perfect-information games."}],"date_updated":"2023-02-23T12:52:24Z","acknowledgement":" Supported by Austrian Science Fund (FWF) Grant No P23499-N23, FWF NFN Grant No\r\nS11407-N23 (RiSE), ERC Start grant (279307: Graph Games), and Microsoft faculty fellows award.","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"},{"full_name":"Doyen, Laurent","first_name":"Laurent","last_name":"Doyen"},{"last_name":"Filiot","full_name":"Filiot, Emmanuel","first_name":"Emmanuel"},{"full_name":"Raskin, Jean-François","first_name":"Jean-François","last_name":"Raskin"}],"publication_identifier":{"issn":["0302-9743"],"isbn":["9783642540127"],"eissn":["1611-3349"],"eisbn":["9783642540134"]},"type":"conference","intvolume":" 8318"},{"title":"Visualization of two-dimensional symmetric positive definite tensor fields using the heat kernel signature","date_published":"2014-03-19T00:00:00Z","_id":"10886","citation":{"ista":"Zobel V, Reininghaus J, Hotz I. 2014. Visualization of two-dimensional symmetric positive definite tensor fields using the heat kernel signature. Topological Methods in Data Analysis and Visualization III . , Mathematics and Visualization, , 249–262.","apa":"Zobel, V., Reininghaus, J., & Hotz, I. (2014). Visualization of two-dimensional symmetric positive definite tensor fields using the heat kernel signature. In Topological Methods in Data Analysis and Visualization III (pp. 249–262). Springer. https://doi.org/10.1007/978-3-319-04099-8_16","ieee":"V. Zobel, J. Reininghaus, and I. Hotz, “Visualization of two-dimensional symmetric positive definite tensor fields using the heat kernel signature,” in Topological Methods in Data Analysis and Visualization III , 2014, pp. 249–262.","ama":"Zobel V, Reininghaus J, Hotz I. Visualization of two-dimensional symmetric positive definite tensor fields using the heat kernel signature. In: Topological Methods in Data Analysis and Visualization III . Springer; 2014:249-262. doi:10.1007/978-3-319-04099-8_16","short":"V. Zobel, J. Reininghaus, I. Hotz, in:, Topological Methods in Data Analysis and Visualization III , Springer, 2014, pp. 249–262.","chicago":"Zobel, Valentin, Jan Reininghaus, and Ingrid Hotz. “Visualization of Two-Dimensional Symmetric Positive Definite Tensor Fields Using the Heat Kernel Signature.” In Topological Methods in Data Analysis and Visualization III , 249–62. Springer, 2014. https://doi.org/10.1007/978-3-319-04099-8_16.","mla":"Zobel, Valentin, et al. “Visualization of Two-Dimensional Symmetric Positive Definite Tensor Fields Using the Heat Kernel Signature.” Topological Methods in Data Analysis and Visualization III , Springer, 2014, pp. 249–62, doi:10.1007/978-3-319-04099-8_16."},"publication_status":"published","date_created":"2022-03-18T13:05:39Z","doi":"10.1007/978-3-319-04099-8_16","publisher":"Springer","department":[{"_id":"HeEd"}],"publication":"Topological Methods in Data Analysis and Visualization III ","month":"03","article_processing_charge":"No","language":[{"iso":"eng"}],"status":"public","type":"conference","year":"2014","day":"19","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publication_identifier":{"issn":["1612-3786"],"isbn":["9783319040981"],"eissn":["2197-666X"],"eisbn":["9783319040998"]},"alternative_title":["Mathematics and Visualization"],"author":[{"last_name":"Zobel","first_name":"Valentin","full_name":"Zobel, Valentin"},{"full_name":"Reininghaus, Jan","first_name":"Jan","id":"4505473A-F248-11E8-B48F-1D18A9856A87","last_name":"Reininghaus"},{"last_name":"Hotz","first_name":"Ingrid","full_name":"Hotz, Ingrid"}],"oa_version":"None","acknowledgement":"This research is partially supported by the TOPOSYS project FP7-ICT-318493-STREP.","scopus_import":"1","quality_controlled":"1","page":"249-262","abstract":[{"text":"We propose a method for visualizing two-dimensional symmetric positive definite tensor fields using the Heat Kernel Signature (HKS). The HKS is derived from the heat kernel and was originally introduced as an isometry invariant shape signature. Each positive definite tensor field defines a Riemannian manifold by considering the tensor field as a Riemannian metric. On this Riemmanian manifold we can apply the definition of the HKS. The resulting scalar quantity is used for the visualization of tensor fields. The HKS is closely related to the Gaussian curvature of the Riemannian manifold and the time parameter of the heat kernel allows a multiscale analysis in a natural way. In this way, the HKS represents field related scale space properties, enabling a level of detail analysis of tensor fields. This makes the HKS an interesting new scalar quantity for tensor fields, which differs significantly from usual tensor invariants like the trace or the determinant. A method for visualization and a numerical realization of the HKS for tensor fields is proposed in this chapter. To validate the approach we apply it to some illustrating simple examples as isolated critical points and to a medical diffusion tensor data set.","lang":"eng"}],"date_updated":"2023-09-05T14:13:16Z"},{"intvolume":" 8889","type":"conference","publication_identifier":{"eissn":["1611-3349"],"eisbn":["9783319130750"],"isbn":["9783319130743"],"issn":["0302-9743"]},"author":[{"last_name":"Biedl","first_name":"Therese","full_name":"Biedl, Therese"},{"first_name":"Stefan","full_name":"Huber, Stefan","orcid":"0000-0002-8871-5814","id":"4700A070-F248-11E8-B48F-1D18A9856A87","last_name":"Huber"},{"last_name":"Palfrader","full_name":"Palfrader, Peter","first_name":"Peter"}],"acknowledgement":"T. Biedl was supported by NSERC and the Ross and Muriel Cheriton Fellowship. P. Palfrader was supported by Austrian Science Fund (FWF): P25816-N15.","conference":{"name":"ISAAC: International Symposium on Algorithms and Computation","location":"Jeonju, Korea","start_date":"2014-12-15","end_date":"2014-12-17"},"page":"117-127","abstract":[{"text":"In this paper, we introduce planar matchings on directed pseudo-line arrangements, which yield a planar set of pseudo-line segments such that only matching-partners are adjacent. By translating the planar matching problem into a corresponding stable roommates problem we show that such matchings always exist.\r\nUsing our new framework, we establish, for the first time, a complete, rigorous definition of weighted straight skeletons, which are based on a so-called wavefront propagation process. We present a generalized and unified approach to treat structural changes in the wavefront that focuses on the restoration of weak planarity by finding planar matchings.","lang":"eng"}],"date_updated":"2023-02-23T12:20:55Z","title":"Planar matchings for weighted straight skeletons","date_published":"2014-11-08T00:00:00Z","_id":"10892","publication_status":"published","citation":{"chicago":"Biedl, Therese, Stefan Huber, and Peter Palfrader. “Planar Matchings for Weighted Straight Skeletons.” In 25th International Symposium, ISAAC 2014, 8889:117–27. Springer Nature, 2014. https://doi.org/10.1007/978-3-319-13075-0_10.","mla":"Biedl, Therese, et al. “Planar Matchings for Weighted Straight Skeletons.” 25th International Symposium, ISAAC 2014, vol. 8889, Springer Nature, 2014, pp. 117–27, doi:10.1007/978-3-319-13075-0_10.","short":"T. Biedl, S. Huber, P. Palfrader, in:, 25th International Symposium, ISAAC 2014, Springer Nature, 2014, pp. 117–127.","ieee":"T. Biedl, S. Huber, and P. Palfrader, “Planar matchings for weighted straight skeletons,” in 25th International Symposium, ISAAC 2014, Jeonju, Korea, 2014, vol. 8889, pp. 117–127.","ama":"Biedl T, Huber S, Palfrader P. Planar matchings for weighted straight skeletons. In: 25th International Symposium, ISAAC 2014. Vol 8889. Springer Nature; 2014:117-127. doi:10.1007/978-3-319-13075-0_10","apa":"Biedl, T., Huber, S., & Palfrader, P. (2014). Planar matchings for weighted straight skeletons. In 25th International Symposium, ISAAC 2014 (Vol. 8889, pp. 117–127). Jeonju, Korea: Springer Nature. https://doi.org/10.1007/978-3-319-13075-0_10","ista":"Biedl T, Huber S, Palfrader P. 2014. Planar matchings for weighted straight skeletons. 25th International Symposium, ISAAC 2014. ISAAC: International Symposium on Algorithms and Computation, LNCS, vol. 8889, 117–127."},"date_created":"2022-03-21T07:09:03Z","publisher":"Springer Nature","department":[{"_id":"HeEd"}],"month":"11","article_processing_charge":"No","language":[{"iso":"eng"}],"status":"public","year":"2014","day":"08","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","alternative_title":["LNCS"],"oa_version":"None","scopus_import":"1","related_material":{"record":[{"relation":"later_version","status":"public","id":"481"}]},"quality_controlled":"1","volume":8889,"doi":"10.1007/978-3-319-13075-0_10","publication":"25th International Symposium, ISAAC 2014"},{"editor":[{"last_name":"Bremer","first_name":"Peer-Timo","full_name":"Bremer, Peer-Timo"},{"first_name":"Ingrid","full_name":"Hotz, Ingrid","last_name":"Hotz"},{"first_name":"Valerio","full_name":"Pascucci, Valerio","last_name":"Pascucci"},{"first_name":"Ronald","full_name":"Peikert, Ronald","last_name":"Peikert"}],"type":"book_chapter","intvolume":" 1","publication_identifier":{"eissn":["2197-666X"],"eisbn":["9783319040998"],"isbn":["9783319040981"],"issn":["1612-3786"]},"acknowledgement":"First, we thank the reviewers of this paper for their ideas and critical comments. In addition, we thank Ronny Peikert and Filip Sadlo for a fruitful discussions. This research is supported by the European Commission under the TOPOSYS project FP7-ICT-318493-STREP, the European Social Fund (ESF App. No. 100098251), and the European Science Foundation under the ACAT Research Network Program.","author":[{"last_name":"Kasten","full_name":"Kasten, Jens","first_name":"Jens"},{"id":"4505473A-F248-11E8-B48F-1D18A9856A87","last_name":"Reininghaus","first_name":"Jan","full_name":"Reininghaus, Jan"},{"first_name":"Wieland","full_name":"Reich, Wieland","last_name":"Reich"},{"last_name":"Scheuermann","first_name":"Gerik","full_name":"Scheuermann, Gerik"}],"abstract":[{"text":"Saddle periodic orbits are an essential and stable part of the topological skeleton of a 3D vector field. Nevertheless, there is currently no efficient algorithm to robustly extract these features. In this chapter, we present a novel technique to extract saddle periodic orbits. Exploiting the analytic properties of such an orbit, we propose a scalar measure based on the finite-time Lyapunov exponent (FTLE) that indicates its presence. Using persistent homology, we can then extract the robust cycles of this field. These cycles thereby represent the saddle periodic orbits of the given vector field. We discuss the different existing FTLE approximation schemes regarding their applicability to this specific problem and propose an adapted version of FTLE called Normalized Velocity Separation. Finally, we evaluate our method using simple analytic vector field data.","lang":"eng"}],"page":"55-69","date_updated":"2022-06-21T12:01:47Z","ec_funded":1,"title":"Toward the extraction of saddle periodic orbits","date_published":"2014-03-19T00:00:00Z","_id":"10893","date_created":"2022-03-21T07:11:23Z","citation":{"ista":"Kasten J, Reininghaus J, Reich W, Scheuermann G. 2014.Toward the extraction of saddle periodic orbits. In: Topological Methods in Data Analysis and Visualization III . vol. 1, 55–69.","apa":"Kasten, J., Reininghaus, J., Reich, W., & Scheuermann, G. (2014). Toward the extraction of saddle periodic orbits. In P.-T. Bremer, I. Hotz, V. Pascucci, & R. Peikert (Eds.), Topological Methods in Data Analysis and Visualization III (Vol. 1, pp. 55–69). Cham: Springer. https://doi.org/10.1007/978-3-319-04099-8_4","ieee":"J. Kasten, J. Reininghaus, W. Reich, and G. Scheuermann, “Toward the extraction of saddle periodic orbits,” in Topological Methods in Data Analysis and Visualization III , vol. 1, P.-T. Bremer, I. Hotz, V. Pascucci, and R. Peikert, Eds. Cham: Springer, 2014, pp. 55–69.","ama":"Kasten J, Reininghaus J, Reich W, Scheuermann G. Toward the extraction of saddle periodic orbits. In: Bremer P-T, Hotz I, Pascucci V, Peikert R, eds. Topological Methods in Data Analysis and Visualization III . Vol 1. Mathematics and Visualization. Cham: Springer; 2014:55-69. doi:10.1007/978-3-319-04099-8_4","short":"J. Kasten, J. Reininghaus, W. Reich, G. Scheuermann, in:, P.-T. Bremer, I. Hotz, V. Pascucci, R. Peikert (Eds.), Topological Methods in Data Analysis and Visualization III , Springer, Cham, 2014, pp. 55–69.","mla":"Kasten, Jens, et al. “Toward the Extraction of Saddle Periodic Orbits.” Topological Methods in Data Analysis and Visualization III , edited by Peer-Timo Bremer et al., vol. 1, Springer, 2014, pp. 55–69, doi:10.1007/978-3-319-04099-8_4.","chicago":"Kasten, Jens, Jan Reininghaus, Wieland Reich, and Gerik Scheuermann. “Toward the Extraction of Saddle Periodic Orbits.” In Topological Methods in Data Analysis and Visualization III , edited by Peer-Timo Bremer, Ingrid Hotz, Valerio Pascucci, and Ronald Peikert, 1:55–69. Mathematics and Visualization. Cham: Springer, 2014. https://doi.org/10.1007/978-3-319-04099-8_4."},"publication_status":"published","department":[{"_id":"HeEd"}],"publisher":"Springer","month":"03","language":[{"iso":"eng"}],"year":"2014","status":"public","article_processing_charge":"No","day":"19","place":"Cham","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"None","scopus_import":"1","quality_controlled":"1","series_title":"Mathematics and Visualization","volume":1,"project":[{"grant_number":"318493","call_identifier":"FP7","name":"Topological Complex Systems","_id":"255D761E-B435-11E9-9278-68D0E5697425"}],"doi":"10.1007/978-3-319-04099-8_4","publication":"Topological Methods in Data Analysis and Visualization III "}]