[{"type":"journal_article","citation":{"ama":"Zhu F, Gamboa M, Farruggio A, et al. DICE, an efficient system for iterative genomic editing in human pluripotent stem cells. <i>Nucleic Acids Research</i>. 2014;42(5). doi:<a href=\"https://doi.org/10.1093/nar/gkt1290\">10.1093/nar/gkt1290</a>","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. <i>Nucleic Acids Research</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/nar/gkt1290\">https://doi.org/10.1093/nar/gkt1290</a>","mla":"Zhu, Fangfang, et al. “DICE, an Efficient System for Iterative Genomic Editing in Human Pluripotent Stem Cells.” <i>Nucleic Acids Research</i>, vol. 42, no. 5, e34, Oxford University Press, 2014, doi:<a href=\"https://doi.org/10.1093/nar/gkt1290\">10.1093/nar/gkt1290</a>.","ieee":"F. Zhu <i>et al.</i>, “DICE, an efficient system for iterative genomic editing in human pluripotent stem cells,” <i>Nucleic Acids Research</i>, vol. 42, no. 5. Oxford University Press, 2014.","short":"F. Zhu, M. Gamboa, A. Farruggio, S. Hippenmeyer, B. Tasic, B. Schüle, Y. Chen Tsai, M. Calos, Nucleic Acids Research 42 (2014).","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.” <i>Nucleic Acids Research</i>. Oxford University Press, 2014. <a href=\"https://doi.org/10.1093/nar/gkt1290\">https://doi.org/10.1093/nar/gkt1290</a>.","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."},"oa_version":"Preprint","date_created":"2018-12-11T11:56:38Z","publication":"Nucleic Acids Research","month":"03","pubrep_id":"961","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","quality_controlled":"1","article_number":"e34","date_published":"2014-03-05T00:00:00Z","doi":"10.1093/nar/gkt1290","intvolume":"        42","status":"public","oa":1,"day":"05","has_accepted_license":"1","volume":42,"scopus_import":1,"tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"issue":"5","year":"2014","author":[{"first_name":"Fangfang","full_name":"Zhu, Fangfang","last_name":"Zhu"},{"first_name":"Matthew","full_name":"Gamboa, Matthew","last_name":"Gamboa"},{"full_name":"Farruggio, Alfonso","last_name":"Farruggio","first_name":"Alfonso"},{"orcid":"0000-0003-2279-1061","first_name":"Simon","full_name":"Hippenmeyer, Simon","id":"37B36620-F248-11E8-B48F-1D18A9856A87","last_name":"Hippenmeyer"},{"first_name":"Bosiljka","full_name":"Tasic, Bosiljka","last_name":"Tasic"},{"first_name":"Birgitt","full_name":"Schüle, Birgitt","last_name":"Schüle"},{"first_name":"Yanru","last_name":"Chen Tsai","full_name":"Chen Tsai, Yanru"},{"first_name":"Michele","last_name":"Calos","full_name":"Calos, Michele"}],"language":[{"iso":"eng"}],"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."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T06:56:22Z","file":[{"date_created":"2018-12-12T10:09:15Z","file_size":11044478,"relation":"main_file","file_id":"4738","creator":"system","access_level":"open_access","content_type":"application/pdf","checksum":"e9268f5f96a820f04d7ebbf85927c3cb","date_updated":"2020-07-14T12:45:35Z","file_name":"IST-2018-961-v1+1_2014_Hippenmeyer_DICE.pdf"}],"_id":"2261","publisher":"Oxford University Press","publist_id":"4684","ddc":["571","610"],"file_date_updated":"2020-07-14T12:45:35Z","publication_status":"published","title":"DICE, an efficient system for iterative genomic editing in human pluripotent stem cells","department":[{"_id":"SiHi"}]},{"volume":800,"type":"book_chapter","year":"2014","publication":" Cellular and Molecular Control of Neuronal Migration","scopus_import":1,"date_created":"2018-12-11T11:56:39Z","citation":{"short":"S. Hippenmeyer, in:, L. Nguyen (Ed.),  Cellular and Molecular Control of Neuronal Migration, Springer, 2014, pp. 1–24.","ieee":"S. Hippenmeyer, “Molecular pathways controlling the sequential steps of cortical projection neuron migration,” in <i> Cellular and Molecular Control of Neuronal Migration</i>, vol. 800, L. Nguyen, Ed. Springer, 2014, pp. 1–24.","chicago":"Hippenmeyer, Simon. “Molecular Pathways Controlling the Sequential Steps of Cortical Projection Neuron Migration.” In <i> Cellular and Molecular Control of Neuronal Migration</i>, edited by Laurent Nguyen, 800:1–24. Springer, 2014. <a href=\"https://doi.org/10.1007/978-94-007-7687-6_1\">https://doi.org/10.1007/978-94-007-7687-6_1</a>.","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.","ama":"Hippenmeyer S. Molecular pathways controlling the sequential steps of cortical projection neuron migration. In: Nguyen L, ed. <i> Cellular and Molecular Control of Neuronal Migration</i>. Vol 800. Springer; 2014:1-24. doi:<a href=\"https://doi.org/10.1007/978-94-007-7687-6_1\">10.1007/978-94-007-7687-6_1</a>","apa":"Hippenmeyer, S. (2014). Molecular pathways controlling the sequential steps of cortical projection neuron migration. In L. Nguyen (Ed.), <i> Cellular and Molecular Control of Neuronal Migration</i> (Vol. 800, pp. 1–24). Springer. <a href=\"https://doi.org/10.1007/978-94-007-7687-6_1\">https://doi.org/10.1007/978-94-007-7687-6_1</a>","mla":"Hippenmeyer, Simon. “Molecular Pathways Controlling the Sequential Steps of Cortical Projection Neuron Migration.” <i> Cellular and Molecular Control of Neuronal Migration</i>, edited by Laurent Nguyen, vol. 800, Springer, 2014, pp. 1–24, doi:<a href=\"https://doi.org/10.1007/978-94-007-7687-6_1\">10.1007/978-94-007-7687-6_1</a>."},"oa_version":"None","language":[{"iso":"eng"}],"author":[{"orcid":"0000-0003-2279-1061","first_name":"Simon","full_name":"Hippenmeyer, Simon","last_name":"Hippenmeyer","id":"37B36620-F248-11E8-B48F-1D18A9856A87"}],"month":"01","quality_controlled":"1","date_updated":"2021-01-12T06:56:23Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","abstract":[{"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.","lang":"eng"}],"intvolume":"       800","publist_id":"4679","publisher":"Springer","doi":"10.1007/978-94-007-7687-6_1","date_published":"2014-01-01T00:00:00Z","_id":"2265","status":"public","publication_status":"published","day":"01","title":"Molecular pathways controlling the sequential steps of cortical projection neuron migration","page":"1 - 24","editor":[{"first_name":"Laurent","last_name":"Nguyen","full_name":"Nguyen, Laurent"}],"department":[{"_id":"SiHi"}],"alternative_title":["Advances in Experimental Medicine and Biology"]},{"department":[{"_id":"VlKo"}],"page":"2936 - 2943","title":"Partial enumeration and curvature regularization","ddc":["000"],"publication_status":"published","file_date_updated":"2020-07-14T12:45:36Z","publisher":"IEEE","publist_id":"4669","_id":"2275","file":[{"checksum":"4a74b5c92d6dcd2348c2c10ec8dd18bf","file_name":"IST-2016-566-v1+1_iccv13_part_enumeration.pdf","date_updated":"2020-07-14T12:45:36Z","file_size":378601,"date_created":"2018-12-12T10:09:30Z","file_id":"4754","relation":"main_file","content_type":"application/pdf","access_level":"open_access","creator":"system"}],"date_updated":"2021-01-12T06:56:28Z","abstract":[{"lang":"eng","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"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"conference":{"start_date":"2013-12-01","name":"ICCV: International Conference on Computer Vision","location":"Sydney, Australia","end_date":"2013-12-08"},"author":[{"first_name":"Carl","full_name":"Olsson, Carl","last_name":"Olsson"},{"last_name":"Ulen","full_name":"Ulen, Johannes","first_name":"Johannes"},{"full_name":"Boykov, Yuri","last_name":"Boykov","first_name":"Yuri"},{"first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Kolmogorov, Vladimir","last_name":"Kolmogorov"}],"scopus_import":1,"year":"2014","has_accepted_license":"1","day":"03","oa":1,"status":"public","doi":"10.1109/ICCV.2013.365","date_published":"2014-03-03T00:00:00Z","quality_controlled":"1","month":"03","pubrep_id":"566","oa_version":"Submitted Version","citation":{"apa":"Olsson, C., Ulen, J., Boykov, Y., &#38; Kolmogorov, V. (2014). Partial enumeration and curvature regularization (pp. 2936–2943). Presented at the ICCV: International Conference on Computer Vision, Sydney, Australia: IEEE. <a href=\"https://doi.org/10.1109/ICCV.2013.365\">https://doi.org/10.1109/ICCV.2013.365</a>","mla":"Olsson, Carl, et al. <i>Partial Enumeration and Curvature Regularization</i>. IEEE, 2014, pp. 2936–43, doi:<a href=\"https://doi.org/10.1109/ICCV.2013.365\">10.1109/ICCV.2013.365</a>.","ama":"Olsson C, Ulen J, Boykov Y, Kolmogorov V. Partial enumeration and curvature regularization. In: IEEE; 2014:2936-2943. doi:<a href=\"https://doi.org/10.1109/ICCV.2013.365\">10.1109/ICCV.2013.365</a>","ista":"Olsson C, Ulen J, Boykov Y, Kolmogorov V. 2014. Partial enumeration and curvature regularization. ICCV: International Conference on Computer Vision, 2936–2943.","chicago":"Olsson, Carl, Johannes Ulen, Yuri Boykov, and Vladimir Kolmogorov. “Partial Enumeration and Curvature Regularization,” 2936–43. IEEE, 2014. <a href=\"https://doi.org/10.1109/ICCV.2013.365\">https://doi.org/10.1109/ICCV.2013.365</a>.","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."},"date_created":"2018-12-11T11:56:42Z","type":"conference"},{"publication":"Letters in Mathematical Physics","citation":{"ieee":"Y. Guo and R. Seiringer, “On the mass concentration for Bose-Einstein condensates with attractive interactions,” <i>Letters in Mathematical Physics</i>, vol. 104, no. 2. Springer, pp. 141–156, 2014.","short":"Y. Guo, R. Seiringer, Letters in Mathematical Physics 104 (2014) 141–156.","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.","chicago":"Guo, Yujin, and Robert Seiringer. “On the Mass Concentration for Bose-Einstein Condensates with Attractive Interactions.” <i>Letters in Mathematical Physics</i>. Springer, 2014. <a href=\"https://doi.org/10.1007/s11005-013-0667-9\">https://doi.org/10.1007/s11005-013-0667-9</a>.","ama":"Guo Y, Seiringer R. On the mass concentration for Bose-Einstein condensates with attractive interactions. <i>Letters in Mathematical Physics</i>. 2014;104(2):141-156. doi:<a href=\"https://doi.org/10.1007/s11005-013-0667-9\">10.1007/s11005-013-0667-9</a>","apa":"Guo, Y., &#38; Seiringer, R. (2014). On the mass concentration for Bose-Einstein condensates with attractive interactions. <i>Letters in Mathematical Physics</i>. Springer. <a href=\"https://doi.org/10.1007/s11005-013-0667-9\">https://doi.org/10.1007/s11005-013-0667-9</a>","mla":"Guo, Yujin, and Robert Seiringer. “On the Mass Concentration for Bose-Einstein Condensates with Attractive Interactions.” <i>Letters in Mathematical Physics</i>, vol. 104, no. 2, Springer, 2014, pp. 141–56, doi:<a href=\"https://doi.org/10.1007/s11005-013-0667-9\">10.1007/s11005-013-0667-9</a>."},"oa_version":"Preprint","date_created":"2018-12-11T11:56:44Z","type":"journal_article","quality_controlled":"1","arxiv":1,"month":"02","status":"public","date_published":"2014-02-01T00:00:00Z","doi":"10.1007/s11005-013-0667-9","intvolume":"       104","external_id":{"arxiv":["1301.5682"]},"day":"01","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1301.5682"}],"oa":1,"issue":"2","scopus_import":"1","year":"2014","volume":104,"article_processing_charge":"No","date_updated":"2024-02-14T12:19:42Z","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"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"author":[{"first_name":"Yujin","full_name":"Guo, Yujin","last_name":"Guo"},{"orcid":"0000-0002-6781-0521","full_name":"Seiringer, Robert","last_name":"Seiringer","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","first_name":"Robert"}],"publication_status":"published","publisher":"Springer","article_type":"original","publist_id":"4653","_id":"2281","department":[{"_id":"RoSe"}],"page":"141 - 156","title":"On the mass concentration for Bose-Einstein condensates with attractive interactions"},{"date_created":"2018-12-11T11:56:46Z","oa_version":"Published Version","citation":{"ama":"Hosp J, Strüber M, Yanagawa Y, et al. Morpho-physiological criteria divide dentate gyrus interneurons into classes. <i>Hippocampus</i>. 2014;23(2):189-203. doi:<a href=\"https://doi.org/10.1002/hipo.22214\">10.1002/hipo.22214</a>","apa":"Hosp, J., Strüber, M., Yanagawa, Y., Obata, K., Vida, I., Jonas, P. M., &#38; Bartos, M. (2014). Morpho-physiological criteria divide dentate gyrus interneurons into classes. <i>Hippocampus</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1002/hipo.22214\">https://doi.org/10.1002/hipo.22214</a>","mla":"Hosp, Jonas, et al. “Morpho-Physiological Criteria Divide Dentate Gyrus Interneurons into Classes.” <i>Hippocampus</i>, vol. 23, no. 2, Wiley-Blackwell, 2014, pp. 189–203, doi:<a href=\"https://doi.org/10.1002/hipo.22214\">10.1002/hipo.22214</a>.","ieee":"J. Hosp <i>et al.</i>, “Morpho-physiological criteria divide dentate gyrus interneurons into classes,” <i>Hippocampus</i>, vol. 23, no. 2. Wiley-Blackwell, pp. 189–203, 2014.","short":"J. Hosp, M. Strüber, Y. Yanagawa, K. Obata, I. Vida, P.M. Jonas, M. Bartos, Hippocampus 23 (2014) 189–203.","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.","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.” <i>Hippocampus</i>. Wiley-Blackwell, 2014. <a href=\"https://doi.org/10.1002/hipo.22214\">https://doi.org/10.1002/hipo.22214</a>."},"publication":"Hippocampus","type":"journal_article","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.","license":"https://creativecommons.org/licenses/by-nc/4.0/","quality_controlled":"1","pubrep_id":"461","month":"02","status":"public","intvolume":"        23","doi":"10.1002/hipo.22214","date_published":"2014-02-01T00:00:00Z","oa":1,"day":"01","year":"2014","scopus_import":1,"tmp":{"name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","image":"/images/cc_by_nc.png","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","short":"CC BY-NC (4.0)"},"issue":"2","has_accepted_license":"1","volume":23,"user_id":"3FFCCD3A-F248-11E8-B48F-1D18A9856A87","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"}],"date_updated":"2021-01-12T06:56:32Z","file":[{"checksum":"ff6bc75a79dbc985a2e31b79253e6444","file_name":"IST-2016-461-v1+1_Hosp_et_al-2014-Hippocampus.pdf","date_updated":"2020-07-14T12:45:37Z","file_size":801589,"date_created":"2018-12-12T10:15:54Z","file_id":"5178","relation":"main_file","content_type":"application/pdf","access_level":"open_access","creator":"system"}],"author":[{"first_name":"Jonas","full_name":"Hosp, Jonas","last_name":"Hosp"},{"full_name":"Strüber, Michael","last_name":"Strüber","first_name":"Michael"},{"last_name":"Yanagawa","full_name":"Yanagawa, Yuchio","first_name":"Yuchio"},{"first_name":"Kunihiko","full_name":"Obata, Kunihiko","last_name":"Obata"},{"first_name":"Imre","full_name":"Vida, Imre","last_name":"Vida"},{"full_name":"Jonas, Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","last_name":"Jonas","first_name":"Peter M","orcid":"0000-0001-5001-4804"},{"first_name":"Marlene","full_name":"Bartos, Marlene","last_name":"Bartos"}],"language":[{"iso":"eng"}],"publication_status":"published","ddc":["570"],"file_date_updated":"2020-07-14T12:45:37Z","_id":"2285","publist_id":"4646","publisher":"Wiley-Blackwell","department":[{"_id":"PeJo"}],"title":"Morpho-physiological criteria divide dentate gyrus interneurons into classes","page":"189 - 203"},{"publisher":"Duke University Press","date_published":"2014-04-01T00:00:00Z","doi":"10.1215/00127094-2649752","publist_id":"4197","intvolume":"       163","_id":"2699","status":"public","publication_status":"published","main_file_link":[{"url":"http://arxiv.org/abs/1104.2272","open_access":"1"}],"day":"01","oa":1,"page":"1127 - 1190","title":"Universality of general β-ensembles","department":[{"_id":"LaEr"}],"type":"journal_article","volume":163,"issue":"6","scopus_import":1,"publication":"Duke Mathematical Journal","year":"2014","citation":{"short":"L. Erdös, P. Bourgade, H. Yau, Duke Mathematical Journal 163 (2014) 1127–1190.","ieee":"L. Erdös, P. Bourgade, and H. Yau, “Universality of general β-ensembles,” <i>Duke Mathematical Journal</i>, vol. 163, no. 6. Duke University Press, pp. 1127–1190, 2014.","ista":"Erdös L, Bourgade P, Yau H. 2014. Universality of general β-ensembles. Duke Mathematical Journal. 163(6), 1127–1190.","chicago":"Erdös, László, Paul Bourgade, and Horng Yau. “Universality of General β-Ensembles.” <i>Duke Mathematical Journal</i>. Duke University Press, 2014. <a href=\"https://doi.org/10.1215/00127094-2649752\">https://doi.org/10.1215/00127094-2649752</a>.","ama":"Erdös L, Bourgade P, Yau H. Universality of general β-ensembles. <i>Duke Mathematical Journal</i>. 2014;163(6):1127-1190. doi:<a href=\"https://doi.org/10.1215/00127094-2649752\">10.1215/00127094-2649752</a>","mla":"Erdös, László, et al. “Universality of General β-Ensembles.” <i>Duke Mathematical Journal</i>, vol. 163, no. 6, Duke University Press, 2014, pp. 1127–90, doi:<a href=\"https://doi.org/10.1215/00127094-2649752\">10.1215/00127094-2649752</a>.","apa":"Erdös, L., Bourgade, P., &#38; Yau, H. (2014). Universality of general β-ensembles. <i>Duke Mathematical Journal</i>. Duke University Press. <a href=\"https://doi.org/10.1215/00127094-2649752\">https://doi.org/10.1215/00127094-2649752</a>"},"oa_version":"Preprint","date_created":"2018-12-11T11:59:08Z","language":[{"iso":"eng"}],"month":"04","author":[{"first_name":"László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","last_name":"Erdös","full_name":"Erdös, László","orcid":"0000-0001-5366-9603"},{"first_name":"Paul","last_name":"Bourgade","full_name":"Bourgade, Paul"},{"first_name":"Horng","last_name":"Yau","full_name":"Yau, Horng"}],"date_updated":"2021-01-12T06:59:07Z","quality_controlled":"1","abstract":[{"text":"We prove the universality of the β-ensembles with convex analytic potentials and for any β &gt;\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"}],"user_id":"3FFCCD3A-F248-11E8-B48F-1D18A9856A87"},{"publication_status":"published","_id":"2716","publisher":"Springer","publist_id":"4176","article_type":"original","department":[{"_id":"KrCh"}],"title":"Strategy synthesis for multi-dimensional quantitative objectives","page":"129 - 163","project":[{"grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","call_identifier":"FWF"}],"scopus_import":"1","issue":"3-4","year":"2014","volume":51,"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."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","date_updated":"2023-02-21T16:06:56Z","author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"},{"full_name":"Randour, Mickael","last_name":"Randour","first_name":"Mickael"},{"first_name":"Jean","last_name":"Raskin","full_name":"Raskin, Jean"}],"language":[{"iso":"eng"}],"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"10904"}]},"status":"public","doi":"10.1007/s00236-013-0182-6","date_published":"2014-06-01T00:00:00Z","intvolume":"        51","oa":1,"external_id":{"arxiv":["1201.5073"]},"day":"01","main_file_link":[{"url":"http://arxiv.org/abs/1201.5073","open_access":"1"}],"citation":{"mla":"Chatterjee, Krishnendu, et al. “Strategy Synthesis for Multi-Dimensional Quantitative Objectives.” <i>Acta Informatica</i>, vol. 51, no. 3–4, Springer, 2014, pp. 129–63, doi:<a href=\"https://doi.org/10.1007/s00236-013-0182-6\">10.1007/s00236-013-0182-6</a>.","apa":"Chatterjee, K., Randour, M., &#38; Raskin, J. (2014). Strategy synthesis for multi-dimensional quantitative objectives. <i>Acta Informatica</i>. Springer. <a href=\"https://doi.org/10.1007/s00236-013-0182-6\">https://doi.org/10.1007/s00236-013-0182-6</a>","ama":"Chatterjee K, Randour M, Raskin J. Strategy synthesis for multi-dimensional quantitative objectives. <i>Acta Informatica</i>. 2014;51(3-4):129-163. doi:<a href=\"https://doi.org/10.1007/s00236-013-0182-6\">10.1007/s00236-013-0182-6</a>","ista":"Chatterjee K, Randour M, Raskin J. 2014. Strategy synthesis for multi-dimensional quantitative objectives. Acta Informatica. 51(3–4), 129–163.","chicago":"Chatterjee, Krishnendu, Mickael Randour, and Jean Raskin. “Strategy Synthesis for Multi-Dimensional Quantitative Objectives.” <i>Acta Informatica</i>. Springer, 2014. <a href=\"https://doi.org/10.1007/s00236-013-0182-6\">https://doi.org/10.1007/s00236-013-0182-6</a>.","short":"K. Chatterjee, M. Randour, J. Raskin, Acta Informatica 51 (2014) 129–163.","ieee":"K. Chatterjee, M. Randour, and J. Raskin, “Strategy synthesis for multi-dimensional quantitative objectives,” <i>Acta Informatica</i>, vol. 51, no. 3–4. Springer, pp. 129–163, 2014."},"oa_version":"Preprint","date_created":"2018-12-11T11:59:14Z","publication":"Acta Informatica","type":"journal_article","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. ","quality_controlled":"1","month":"06","arxiv":1},{"related_material":{"record":[{"id":"3225","relation":"earlier_version","status":"public"}]},"publication_status":"published","status":"public","_id":"2852","intvolume":"        27","publist_id":"3940","doi":"10.1007/s00145-013-9148-7","publisher":"Springer","date_published":"2014-07-01T00:00:00Z","department":[{"_id":"KrPi"}],"page":"397 - 428","title":"Robust multi-property combiners for hash functions","day":"01","date_created":"2018-12-11T11:59:56Z","citation":{"ista":"Fischlin M, Lehmann A, Pietrzak KZ. 2014. Robust multi-property combiners for hash functions. Journal of Cryptology. 27(3), 397–428.","chicago":"Fischlin, Marc, Anja Lehmann, and Krzysztof Z Pietrzak. “Robust Multi-Property Combiners for Hash Functions.” <i>Journal of Cryptology</i>. Springer, 2014. <a href=\"https://doi.org/10.1007/s00145-013-9148-7\">https://doi.org/10.1007/s00145-013-9148-7</a>.","short":"M. Fischlin, A. Lehmann, K.Z. Pietrzak, Journal of Cryptology 27 (2014) 397–428.","ieee":"M. Fischlin, A. Lehmann, and K. Z. Pietrzak, “Robust multi-property combiners for hash functions,” <i>Journal of Cryptology</i>, vol. 27, no. 3. Springer, pp. 397–428, 2014.","mla":"Fischlin, Marc, et al. “Robust Multi-Property Combiners for Hash Functions.” <i>Journal of Cryptology</i>, vol. 27, no. 3, Springer, 2014, pp. 397–428, doi:<a href=\"https://doi.org/10.1007/s00145-013-9148-7\">10.1007/s00145-013-9148-7</a>.","apa":"Fischlin, M., Lehmann, A., &#38; Pietrzak, K. Z. (2014). Robust multi-property combiners for hash functions. <i>Journal of Cryptology</i>. Springer. <a href=\"https://doi.org/10.1007/s00145-013-9148-7\">https://doi.org/10.1007/s00145-013-9148-7</a>","ama":"Fischlin M, Lehmann A, Pietrzak KZ. Robust multi-property combiners for hash functions. <i>Journal of Cryptology</i>. 2014;27(3):397-428. doi:<a href=\"https://doi.org/10.1007/s00145-013-9148-7\">10.1007/s00145-013-9148-7</a>"},"oa_version":"None","publication":"Journal of Cryptology","year":"2014","issue":"3","scopus_import":1,"volume":27,"type":"journal_article","user_id":"3FFCCD3A-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","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."}],"date_updated":"2023-02-23T11:17:53Z","quality_controlled":"1","month":"07","author":[{"first_name":"Marc","last_name":"Fischlin","full_name":"Fischlin, Marc"},{"first_name":"Anja","full_name":"Lehmann, Anja","last_name":"Lehmann"},{"first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak","full_name":"Pietrzak, Krzysztof Z","orcid":"0000-0002-9139-1654"}],"language":[{"iso":"eng"}]},{"file_date_updated":"2020-07-14T12:45:52Z","publication_status":"published","ddc":["000"],"_id":"2905","publist_id":"3842","publisher":"European Mathematical Society Publishing House","department":[{"_id":"HeEd"}],"page":"31 - 50","title":"Persistent homology: Theory and practice","year":"2014","has_accepted_license":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","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."}],"file":[{"relation":"main_file","file_id":"5232","creator":"system","content_type":"application/pdf","access_level":"open_access","date_created":"2018-12-12T10:16:43Z","file_size":435320,"checksum":"1d4a046f1af945c407c5c4d411d4c5e4","date_updated":"2020-07-14T12:45:52Z","file_name":"IST-2016-544-v1+1_2012-P-11-PHTheoryPractice.pdf"}],"date_updated":"2021-01-12T07:00:36Z","article_processing_charge":"No","conference":{"start_date":"2012-07-02","name":"ECM: European Congress of Mathematics","location":"Kraków, Poland","end_date":"2012-07-07"},"author":[{"orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","first_name":"Herbert"},{"full_name":"Morozovy, Dmitriy","last_name":"Morozovy","first_name":"Dmitriy"}],"language":[{"iso":"eng"}],"status":"public","date_published":"2014-01-01T00:00:00Z","doi":"10.4171/120-1/3","oa":1,"day":"01","date_created":"2018-12-11T12:00:16Z","citation":{"apa":"Edelsbrunner, H., &#38; 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. <a href=\"https://doi.org/10.4171/120-1/3\">https://doi.org/10.4171/120-1/3</a>","mla":"Edelsbrunner, Herbert, and Dmitriy Morozovy. <i>Persistent Homology: Theory and Practice</i>. European Mathematical Society Publishing House, 2014, pp. 31–50, doi:<a href=\"https://doi.org/10.4171/120-1/3\">10.4171/120-1/3</a>.","ama":"Edelsbrunner H, Morozovy D. Persistent homology: Theory and practice. In: European Mathematical Society Publishing House; 2014:31-50. doi:<a href=\"https://doi.org/10.4171/120-1/3\">10.4171/120-1/3</a>","ista":"Edelsbrunner H, Morozovy D. 2014. Persistent homology: Theory and practice. ECM: European Congress of Mathematics, 31–50.","chicago":"Edelsbrunner, Herbert, and Dmitriy Morozovy. “Persistent Homology: Theory and Practice,” 31–50. European Mathematical Society Publishing House, 2014. <a href=\"https://doi.org/10.4171/120-1/3\">https://doi.org/10.4171/120-1/3</a>.","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.","short":"H. Edelsbrunner, D. Morozovy, in:, European Mathematical Society Publishing House, 2014, pp. 31–50."},"oa_version":"Submitted Version","type":"conference","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.","quality_controlled":"1","month":"01","pubrep_id":"544"},{"status":"public","intvolume":"         9","doi":"10.1371/journal.pone.0085841","date_published":"2014-01-21T00:00:00Z","article_number":"e85841","day":"21","oa":1,"publication":"PLoS One","date_created":"2018-12-11T12:02:20Z","oa_version":"Published Version","citation":{"short":"G. Tkačik, A. Ghosh, E. Schneidman, R. Segev, PLoS One 9 (2014).","ieee":"G. Tkačik, A. Ghosh, E. Schneidman, and R. Segev, “Adaptation to changes in higher-order stimulus statistics in the salamander retina,” <i>PLoS One</i>, vol. 9, no. 1. Public Library of Science, 2014.","chicago":"Tkačik, Gašper, Anandamohan Ghosh, Elad Schneidman, and Ronen Segev. “Adaptation to Changes in Higher-Order Stimulus Statistics in the Salamander Retina.” <i>PLoS One</i>. Public Library of Science, 2014. <a href=\"https://doi.org/10.1371/journal.pone.0085841\">https://doi.org/10.1371/journal.pone.0085841</a>.","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.","ama":"Tkačik G, Ghosh A, Schneidman E, Segev R. Adaptation to changes in higher-order stimulus statistics in the salamander retina. <i>PLoS One</i>. 2014;9(1). doi:<a href=\"https://doi.org/10.1371/journal.pone.0085841\">10.1371/journal.pone.0085841</a>","mla":"Tkačik, Gašper, et al. “Adaptation to Changes in Higher-Order Stimulus Statistics in the Salamander Retina.” <i>PLoS One</i>, vol. 9, no. 1, e85841, Public Library of Science, 2014, doi:<a href=\"https://doi.org/10.1371/journal.pone.0085841\">10.1371/journal.pone.0085841</a>.","apa":"Tkačik, G., Ghosh, A., Schneidman, E., &#38; Segev, R. (2014). Adaptation to changes in higher-order stimulus statistics in the salamander retina. <i>PLoS One</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pone.0085841\">https://doi.org/10.1371/journal.pone.0085841</a>"},"type":"journal_article","quality_controlled":"1","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","month":"01","pubrep_id":"432","publication_status":"published","file_date_updated":"2020-07-14T12:46:06Z","ddc":["570"],"publist_id":"3385","publisher":"Public Library of Science","_id":"3263","department":[{"_id":"GaTk"}],"title":"Adaptation to changes in higher-order stimulus statistics in the salamander retina","year":"2014","issue":"1","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"scopus_import":1,"volume":9,"has_accepted_license":"1","date_updated":"2021-01-12T07:42:14Z","file":[{"file_name":"IST-2016-432-v1+1_journal.pone.0085841.pdf","date_updated":"2020-07-14T12:46:06Z","checksum":"1d5816b343abe5eadc3eb419bcece971","file_size":1568524,"date_created":"2018-12-12T10:13:28Z","content_type":"application/pdf","access_level":"open_access","creator":"system","file_id":"5011","relation":"main_file"}],"user_id":"3FFCCD3A-F248-11E8-B48F-1D18A9856A87","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."}],"language":[{"iso":"eng"}],"author":[{"first_name":"Gasper","full_name":"Tkacik, Gasper","last_name":"Tkacik","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6699-1455"},{"last_name":"Ghosh","full_name":"Ghosh, Anandamohan","first_name":"Anandamohan"},{"full_name":"Schneidman, Elad","last_name":"Schneidman","first_name":"Elad"},{"first_name":"Ronen","full_name":"Segev, Ronen","last_name":"Segev"}]},{"year":"2014","scopus_import":"1","place":"Cham","date_updated":"2023-09-05T15:33:45Z","article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","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"}],"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9783319040981"],"eisbn":["9783319040998"],"issn":["1612-3786"],"eissn":["2197-666X"]},"author":[{"last_name":"Günther","full_name":"Günther, David","first_name":"David"},{"first_name":"Jan","id":"4505473A-F248-11E8-B48F-1D18A9856A87","last_name":"Reininghaus","full_name":"Reininghaus, Jan"},{"first_name":"Hans-Peter","full_name":"Seidel, Hans-Peter","last_name":"Seidel"},{"first_name":"Tino","full_name":"Weinkauf, Tino","last_name":"Weinkauf"}],"series_title":"Mathematics and Visualization","publication_status":"published","publisher":"Springer Nature","_id":"10817","ec_funded":1,"department":[{"_id":"HeEd"}],"project":[{"name":"Topological Complex Systems","call_identifier":"FP7","_id":"255D761E-B435-11E9-9278-68D0E5697425","grant_number":"318493"}],"title":"Notes on the simplification of the Morse-Smale complex","page":"135-150","publication":"Topological Methods in Data Analysis and Visualization III.","date_created":"2022-03-04T08:33:57Z","oa_version":"None","citation":{"chicago":"Günther, David, Jan Reininghaus, Hans-Peter Seidel, and Tino Weinkauf. “Notes on the Simplification of the Morse-Smale Complex.” In <i>Topological Methods in Data Analysis and Visualization III.</i>, edited by Peer-Timo Bremer, Ingrid Hotz, Valerio Pascucci, and Ronald Peikert, 135–50. Mathematics and Visualization. Cham: Springer Nature, 2014. <a href=\"https://doi.org/10.1007/978-3-319-04099-8_9\">https://doi.org/10.1007/978-3-319-04099-8_9</a>.","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.","ieee":"D. Günther, J. Reininghaus, H.-P. Seidel, and T. Weinkauf, “Notes on the simplification of the Morse-Smale complex,” in <i>Topological Methods in Data Analysis and Visualization III.</i>, P.-T. Bremer, I. Hotz, V. Pascucci, and R. Peikert, Eds. Cham: Springer Nature, 2014, pp. 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.","apa":"Günther, D., Reininghaus, J., Seidel, H.-P., &#38; Weinkauf, T. (2014). Notes on the simplification of the Morse-Smale complex. In P.-T. Bremer, I. Hotz, V. Pascucci, &#38; R. Peikert (Eds.), <i>Topological Methods in Data Analysis and Visualization III.</i> (pp. 135–150). Cham: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-319-04099-8_9\">https://doi.org/10.1007/978-3-319-04099-8_9</a>","mla":"Günther, David, et al. “Notes on the Simplification of the Morse-Smale Complex.” <i>Topological Methods in Data Analysis and Visualization III.</i>, edited by Peer-Timo Bremer et al., Springer Nature, 2014, pp. 135–50, doi:<a href=\"https://doi.org/10.1007/978-3-319-04099-8_9\">10.1007/978-3-319-04099-8_9</a>.","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. <i>Topological Methods in Data Analysis and Visualization III.</i> Mathematics and Visualization. Cham: Springer Nature; 2014:135-150. doi:<a href=\"https://doi.org/10.1007/978-3-319-04099-8_9\">10.1007/978-3-319-04099-8_9</a>"},"type":"book_chapter","quality_controlled":"1","acknowledgement":"This research is supported and funded by the Digiteo unTopoVis project, the TOPOSYS project FP7-ICT-318493-STREP, and MPC-VCC.","month":"03","status":"public","date_published":"2014-03-19T00:00:00Z","doi":"10.1007/978-3-319-04099-8_9","day":"19","editor":[{"first_name":"Peer-Timo","full_name":"Bremer, Peer-Timo","last_name":"Bremer"},{"last_name":"Hotz","full_name":"Hotz, Ingrid","first_name":"Ingrid"},{"first_name":"Valerio","last_name":"Pascucci","full_name":"Pascucci, Valerio"},{"first_name":"Ronald","full_name":"Peikert, Ronald","last_name":"Peikert"}]},{"date_created":"2022-03-18T13:01:22Z","oa_version":"Preprint","citation":{"chicago":"Aminof, Benjamin, Swen Jacobs, Ayrat Khalimov, and Sasha Rubin. “Parameterized Model Checking of Token-Passing Systems.” In <i>Verification, Model Checking, and Abstract Interpretation</i>, 8318:262–81. Springer Nature, 2014. <a href=\"https://doi.org/10.1007/978-3-642-54013-4_15\">https://doi.org/10.1007/978-3-642-54013-4_15</a>.","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.","ieee":"B. Aminof, S. Jacobs, A. Khalimov, and S. Rubin, “Parameterized model checking of token-passing systems,” in <i>Verification, Model Checking, and Abstract Interpretation</i>, San Diego, CA, United States, 2014, vol. 8318, pp. 262–281.","apa":"Aminof, B., Jacobs, S., Khalimov, A., &#38; Rubin, S. (2014). Parameterized model checking of token-passing systems. In <i>Verification, Model Checking, and Abstract Interpretation</i> (Vol. 8318, pp. 262–281). San Diego, CA, United States: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-642-54013-4_15\">https://doi.org/10.1007/978-3-642-54013-4_15</a>","mla":"Aminof, Benjamin, et al. “Parameterized Model Checking of Token-Passing Systems.” <i>Verification, Model Checking, and Abstract Interpretation</i>, vol. 8318, Springer Nature, 2014, pp. 262–81, doi:<a href=\"https://doi.org/10.1007/978-3-642-54013-4_15\">10.1007/978-3-642-54013-4_15</a>.","ama":"Aminof B, Jacobs S, Khalimov A, Rubin S. Parameterized model checking of token-passing systems. In: <i>Verification, Model Checking, and Abstract Interpretation</i>. Vol 8318. Springer Nature; 2014:262-281. doi:<a href=\"https://doi.org/10.1007/978-3-642-54013-4_15\">10.1007/978-3-642-54013-4_15</a>"},"publication":"Verification, Model Checking, and Abstract Interpretation","type":"conference","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.","quality_controlled":"1","month":"01","arxiv":1,"status":"public","intvolume":"      8318","doi":"10.1007/978-3-642-54013-4_15","date_published":"2014-01-30T00:00:00Z","oa":1,"day":"30","main_file_link":[{"open_access":"1","url":" https://doi.org/10.48550/arXiv.1311.4425"}],"external_id":{"arxiv":["1311.4425"]},"year":"2014","scopus_import":"1","volume":8318,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","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"}],"date_updated":"2022-05-17T08:36:01Z","article_processing_charge":"No","author":[{"id":"4A55BD00-F248-11E8-B48F-1D18A9856A87","last_name":"Aminof","full_name":"Aminof, Benjamin","first_name":"Benjamin"},{"first_name":"Swen","full_name":"Jacobs, Swen","last_name":"Jacobs"},{"first_name":"Ayrat","full_name":"Khalimov, Ayrat","last_name":"Khalimov"},{"first_name":"Sasha","last_name":"Rubin","id":"2EC51194-F248-11E8-B48F-1D18A9856A87","full_name":"Rubin, Sasha"}],"conference":{"end_date":"2014-01-21","location":"San Diego, CA, United States","start_date":"2014-01-19","name":"VMCAI: Verifcation, Model Checking, and Abstract Interpretation"},"publication_identifier":{"isbn":["9783642540127"],"eisbn":["9783642540134"],"eissn":["1611-3349"],"issn":["0302-9743"]},"language":[{"iso":"eng"}],"publication_status":"published","_id":"10884","ec_funded":1,"publisher":"Springer Nature","department":[{"_id":"KrCh"}],"alternative_title":["LNCS"],"page":"262-281","title":"Parameterized model checking of token-passing systems","project":[{"grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF"},{"grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Game Theory"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"}]},{"status":"public","related_material":{"record":[{"status":"public","id":"681","relation":"later_version"}]},"intvolume":"      8318","date_published":"2014-01-30T00:00:00Z","doi":"10.1007/978-3-642-54013-4_5","day":"30","external_id":{"arxiv":["1311.3238"]},"publication":"VMCAI 2014: Verification, Model Checking, and Abstract Interpretation","date_created":"2022-03-18T13:03:15Z","citation":{"ama":"Chatterjee K, Doyen L, Filiot E, Raskin J-F. Doomsday equilibria for omega-regular games. In: <i>VMCAI 2014: Verification, Model Checking, and Abstract Interpretation</i>. Vol 8318. Springer Nature; 2014:78-97. doi:<a href=\"https://doi.org/10.1007/978-3-642-54013-4_5\">10.1007/978-3-642-54013-4_5</a>","apa":"Chatterjee, K., Doyen, L., Filiot, E., &#38; Raskin, J.-F. (2014). Doomsday equilibria for omega-regular games. In <i>VMCAI 2014: Verification, Model Checking, and Abstract Interpretation</i> (Vol. 8318, pp. 78–97). San Diego, CA, United States: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-642-54013-4_5\">https://doi.org/10.1007/978-3-642-54013-4_5</a>","mla":"Chatterjee, Krishnendu, et al. “Doomsday Equilibria for Omega-Regular Games.” <i>VMCAI 2014: Verification, Model Checking, and Abstract Interpretation</i>, vol. 8318, Springer Nature, 2014, pp. 78–97, doi:<a href=\"https://doi.org/10.1007/978-3-642-54013-4_5\">10.1007/978-3-642-54013-4_5</a>.","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.","ieee":"K. Chatterjee, L. Doyen, E. Filiot, and J.-F. Raskin, “Doomsday equilibria for omega-regular games,” in <i>VMCAI 2014: Verification, Model Checking, and Abstract Interpretation</i>, San Diego, CA, United States, 2014, vol. 8318, pp. 78–97.","chicago":"Chatterjee, Krishnendu, Laurent Doyen, Emmanuel Filiot, and Jean-François Raskin. “Doomsday Equilibria for Omega-Regular Games.” In <i>VMCAI 2014: Verification, Model Checking, and Abstract Interpretation</i>, 8318:78–97. Springer Nature, 2014. <a href=\"https://doi.org/10.1007/978-3-642-54013-4_5\">https://doi.org/10.1007/978-3-642-54013-4_5</a>.","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."},"oa_version":"Preprint","type":"conference","quality_controlled":"1","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.","arxiv":1,"month":"01","publication_status":"published","publisher":"Springer Nature","_id":"10885","ec_funded":1,"department":[{"_id":"KrCh"}],"alternative_title":["LNCS"],"project":[{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","call_identifier":"FWF"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"title":"Doomsday equilibria for omega-regular games","page":"78-97","year":"2014","scopus_import":"1","volume":8318,"date_updated":"2023-02-23T12:52:24Z","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"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.","lang":"eng"}],"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1611-3349"],"issn":["0302-9743"],"eisbn":["9783642540134"],"isbn":["9783642540127"]},"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"},{"full_name":"Doyen, Laurent","last_name":"Doyen","first_name":"Laurent"},{"full_name":"Filiot, Emmanuel","last_name":"Filiot","first_name":"Emmanuel"},{"first_name":"Jean-François","full_name":"Raskin, Jean-François","last_name":"Raskin"}],"conference":{"end_date":"2014-01-21","location":"San Diego, CA, United States","start_date":"2014-01-19","name":"VMCAI: Verifcation, Model Checking, and Abstract Interpretation"}},{"type":"conference","citation":{"short":"V. Zobel, J. Reininghaus, I. Hotz, in:, Topological Methods in Data Analysis and Visualization III , Springer, 2014, pp. 249–262.","ieee":"V. Zobel, J. Reininghaus, and I. Hotz, “Visualization of two-dimensional symmetric positive definite tensor fields using the heat kernel signature,” in <i>Topological Methods in Data Analysis and Visualization III </i>, 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 <i>Topological Methods in Data Analysis and Visualization III </i>, 249–62. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-319-04099-8_16\">https://doi.org/10.1007/978-3-319-04099-8_16</a>.","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.","ama":"Zobel V, Reininghaus J, Hotz I. Visualization of two-dimensional symmetric positive definite tensor fields using the heat kernel signature. In: <i>Topological Methods in Data Analysis and Visualization III </i>. Springer; 2014:249-262. doi:<a href=\"https://doi.org/10.1007/978-3-319-04099-8_16\">10.1007/978-3-319-04099-8_16</a>","apa":"Zobel, V., Reininghaus, J., &#38; Hotz, I. (2014). Visualization of two-dimensional symmetric positive definite tensor fields using the heat kernel signature. In <i>Topological Methods in Data Analysis and Visualization III </i> (pp. 249–262). Springer. <a href=\"https://doi.org/10.1007/978-3-319-04099-8_16\">https://doi.org/10.1007/978-3-319-04099-8_16</a>","mla":"Zobel, Valentin, et al. “Visualization of Two-Dimensional Symmetric Positive Definite Tensor Fields Using the Heat Kernel Signature.” <i>Topological Methods in Data Analysis and Visualization III </i>, Springer, 2014, pp. 249–62, doi:<a href=\"https://doi.org/10.1007/978-3-319-04099-8_16\">10.1007/978-3-319-04099-8_16</a>."},"oa_version":"None","date_created":"2022-03-18T13:05:39Z","scopus_import":"1","publication":"Topological Methods in Data Analysis and Visualization III ","year":"2014","publication_identifier":{"eisbn":["9783319040998"],"isbn":["9783319040981"],"issn":["1612-3786"],"eissn":["2197-666X"]},"month":"03","author":[{"last_name":"Zobel","full_name":"Zobel, Valentin","first_name":"Valentin"},{"first_name":"Jan","last_name":"Reininghaus","id":"4505473A-F248-11E8-B48F-1D18A9856A87","full_name":"Reininghaus, Jan"},{"full_name":"Hotz, Ingrid","last_name":"Hotz","first_name":"Ingrid"}],"language":[{"iso":"eng"}],"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"}],"acknowledgement":"This research is partially supported by the TOPOSYS project FP7-ICT-318493-STREP.","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","quality_controlled":"1","date_updated":"2023-09-05T14:13:16Z","_id":"10886","publisher":"Springer","doi":"10.1007/978-3-319-04099-8_16","date_published":"2014-03-19T00:00:00Z","publication_status":"published","status":"public","page":"249-262","title":"Visualization of two-dimensional symmetric positive definite tensor fields using the heat kernel signature","day":"19","alternative_title":["Mathematics and Visualization"],"department":[{"_id":"HeEd"}]},{"related_material":{"record":[{"id":"481","relation":"later_version","status":"public"}]},"status":"public","intvolume":"      8889","date_published":"2014-11-08T00:00:00Z","doi":"10.1007/978-3-319-13075-0_10","day":"08","date_created":"2022-03-21T07:09:03Z","citation":{"chicago":"Biedl, Therese, Stefan Huber, and Peter Palfrader. “Planar Matchings for Weighted Straight Skeletons.” In <i>25th International Symposium, ISAAC 2014</i>, 8889:117–27. Springer Nature, 2014. <a href=\"https://doi.org/10.1007/978-3-319-13075-0_10\">https://doi.org/10.1007/978-3-319-13075-0_10</a>.","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.","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 <i>25th International Symposium, ISAAC 2014</i>, Jeonju, Korea, 2014, vol. 8889, pp. 117–127.","mla":"Biedl, Therese, et al. “Planar Matchings for Weighted Straight Skeletons.” <i>25th International Symposium, ISAAC 2014</i>, vol. 8889, Springer Nature, 2014, pp. 117–27, doi:<a href=\"https://doi.org/10.1007/978-3-319-13075-0_10\">10.1007/978-3-319-13075-0_10</a>.","apa":"Biedl, T., Huber, S., &#38; Palfrader, P. (2014). Planar matchings for weighted straight skeletons. In <i>25th International Symposium, ISAAC 2014</i> (Vol. 8889, pp. 117–127). Jeonju, Korea: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-319-13075-0_10\">https://doi.org/10.1007/978-3-319-13075-0_10</a>","ama":"Biedl T, Huber S, Palfrader P. Planar matchings for weighted straight skeletons. In: <i>25th International Symposium, ISAAC 2014</i>. Vol 8889. Springer Nature; 2014:117-127. doi:<a href=\"https://doi.org/10.1007/978-3-319-13075-0_10\">10.1007/978-3-319-13075-0_10</a>"},"oa_version":"None","publication":"25th International Symposium, ISAAC 2014","type":"conference","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.","quality_controlled":"1","month":"11","publication_status":"published","_id":"10892","publisher":"Springer Nature","department":[{"_id":"HeEd"}],"alternative_title":["LNCS"],"page":"117-127","title":"Planar matchings for weighted straight skeletons","year":"2014","scopus_import":"1","volume":8889,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","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","article_processing_charge":"No","author":[{"full_name":"Biedl, Therese","last_name":"Biedl","first_name":"Therese"},{"orcid":"0000-0002-8871-5814","first_name":"Stefan","id":"4700A070-F248-11E8-B48F-1D18A9856A87","full_name":"Huber, Stefan","last_name":"Huber"},{"first_name":"Peter","full_name":"Palfrader, Peter","last_name":"Palfrader"}],"publication_identifier":{"eissn":["1611-3349"],"issn":["0302-9743"],"eisbn":["9783319130750"],"isbn":["9783319130743"]},"conference":{"name":"ISAAC: International Symposium on Algorithms and Computation","start_date":"2014-12-15","location":"Jeonju, Korea","end_date":"2014-12-17"},"language":[{"iso":"eng"}]},{"quality_controlled":"1","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.","month":"03","publication":"Topological Methods in Data Analysis and Visualization III ","oa_version":"None","citation":{"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. <i>Topological Methods in Data Analysis and Visualization III </i>. Vol 1. Mathematics and Visualization. Cham: Springer; 2014:55-69. doi:<a href=\"https://doi.org/10.1007/978-3-319-04099-8_4\">10.1007/978-3-319-04099-8_4</a>","mla":"Kasten, Jens, et al. “Toward the Extraction of Saddle Periodic Orbits.” <i>Topological Methods in Data Analysis and Visualization III </i>, edited by Peer-Timo Bremer et al., vol. 1, Springer, 2014, pp. 55–69, doi:<a href=\"https://doi.org/10.1007/978-3-319-04099-8_4\">10.1007/978-3-319-04099-8_4</a>.","apa":"Kasten, J., Reininghaus, J., Reich, W., &#38; Scheuermann, G. (2014). Toward the extraction of saddle periodic orbits. In P.-T. Bremer, I. Hotz, V. Pascucci, &#38; R. Peikert (Eds.), <i>Topological Methods in Data Analysis and Visualization III </i> (Vol. 1, pp. 55–69). Cham: Springer. <a href=\"https://doi.org/10.1007/978-3-319-04099-8_4\">https://doi.org/10.1007/978-3-319-04099-8_4</a>","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.","ieee":"J. Kasten, J. Reininghaus, W. Reich, and G. Scheuermann, “Toward the extraction of saddle periodic orbits,” in <i>Topological Methods in Data Analysis and Visualization III </i>, vol. 1, P.-T. Bremer, I. Hotz, V. Pascucci, and R. Peikert, Eds. Cham: Springer, 2014, pp. 55–69.","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.","chicago":"Kasten, Jens, Jan Reininghaus, Wieland Reich, and Gerik Scheuermann. “Toward the Extraction of Saddle Periodic Orbits.” In <i>Topological Methods in Data Analysis and Visualization III </i>, edited by Peer-Timo Bremer, Ingrid Hotz, Valerio Pascucci, and Ronald Peikert, 1:55–69. Mathematics and Visualization. Cham: Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-319-04099-8_4\">https://doi.org/10.1007/978-3-319-04099-8_4</a>."},"date_created":"2022-03-21T07:11:23Z","type":"book_chapter","day":"19","editor":[{"first_name":"Peer-Timo","last_name":"Bremer","full_name":"Bremer, Peer-Timo"},{"first_name":"Ingrid","last_name":"Hotz","full_name":"Hotz, Ingrid"},{"full_name":"Pascucci, Valerio","last_name":"Pascucci","first_name":"Valerio"},{"first_name":"Ronald","last_name":"Peikert","full_name":"Peikert, Ronald"}],"status":"public","doi":"10.1007/978-3-319-04099-8_4","date_published":"2014-03-19T00:00:00Z","intvolume":"         1","article_processing_charge":"No","date_updated":"2022-06-21T12:01:47Z","abstract":[{"lang":"eng","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."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"publication_identifier":{"issn":["1612-3786"],"eissn":["2197-666X"],"isbn":["9783319040981"],"eisbn":["9783319040998"]},"author":[{"first_name":"Jens","full_name":"Kasten, Jens","last_name":"Kasten"},{"last_name":"Reininghaus","id":"4505473A-F248-11E8-B48F-1D18A9856A87","full_name":"Reininghaus, Jan","first_name":"Jan"},{"first_name":"Wieland","full_name":"Reich, Wieland","last_name":"Reich"},{"first_name":"Gerik","full_name":"Scheuermann, Gerik","last_name":"Scheuermann"}],"scopus_import":"1","year":"2014","place":"Cham","volume":1,"department":[{"_id":"HeEd"}],"project":[{"_id":"255D761E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Topological Complex Systems","grant_number":"318493"}],"page":"55-69","title":"Toward the extraction of saddle periodic orbits","series_title":"Mathematics and Visualization","publication_status":"published","publisher":"Springer","ec_funded":1,"_id":"10893"},{"department":[{"_id":"HeEd"}],"title":"PHAT – Persistent Homology Algorithms Toolbox","page":"137-143","publication_status":"published","series_title":"LNCS","publisher":"Springer Berlin Heidelberg","_id":"10894","article_processing_charge":"No","date_updated":"2023-09-20T09:42:40Z","abstract":[{"text":"PHAT is a C++ library for the computation of persistent homology by matrix reduction. We aim for a simple generic design that decouples algorithms from data structures without sacrificing efficiency or user-friendliness. This makes PHAT a versatile platform for experimenting with algorithmic ideas and comparing them to state of the art implementations.","lang":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","language":[{"iso":"eng"}],"publication_identifier":{"eisbn":["9783662441992"],"isbn":["9783662441985"],"issn":["0302-9743"],"eissn":["1611-3349"]},"conference":{"end_date":"2014-08-09","location":"Seoul, South Korea","start_date":"2014-08-05","name":"ICMS: International Congress on Mathematical Software"},"author":[{"first_name":"Ulrich","id":"2ADD483A-F248-11E8-B48F-1D18A9856A87","full_name":"Bauer, Ulrich","last_name":"Bauer","orcid":"0000-0002-9683-0724"},{"full_name":"Kerber, Michael","last_name":"Kerber","first_name":"Michael"},{"last_name":"Reininghaus","id":"4505473A-F248-11E8-B48F-1D18A9856A87","full_name":"Reininghaus, Jan","first_name":"Jan"},{"first_name":"Hubert","full_name":"Wagner, Hubert","last_name":"Wagner"}],"scopus_import":"1","year":"2014","place":"Berlin, Heidelberg","volume":8592,"day":"01","status":"public","related_material":{"record":[{"status":"public","id":"1433","relation":"later_version"}]},"date_published":"2014-09-01T00:00:00Z","doi":"10.1007/978-3-662-44199-2_24","intvolume":"      8592","quality_controlled":"1","month":"09","publication":"ICMS 2014: International Congress on Mathematical Software","citation":{"mla":"Bauer, Ulrich, et al. “PHAT – Persistent Homology Algorithms Toolbox.” <i>ICMS 2014: International Congress on Mathematical Software</i>, vol. 8592, Springer Berlin Heidelberg, 2014, pp. 137–43, doi:<a href=\"https://doi.org/10.1007/978-3-662-44199-2_24\">10.1007/978-3-662-44199-2_24</a>.","apa":"Bauer, U., Kerber, M., Reininghaus, J., &#38; Wagner, H. (2014). PHAT – Persistent Homology Algorithms Toolbox. In <i>ICMS 2014: International Congress on Mathematical Software</i> (Vol. 8592, pp. 137–143). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-662-44199-2_24\">https://doi.org/10.1007/978-3-662-44199-2_24</a>","ama":"Bauer U, Kerber M, Reininghaus J, Wagner H. PHAT – Persistent Homology Algorithms Toolbox. In: <i>ICMS 2014: International Congress on Mathematical Software</i>. Vol 8592. LNCS. Berlin, Heidelberg: Springer Berlin Heidelberg; 2014:137-143. doi:<a href=\"https://doi.org/10.1007/978-3-662-44199-2_24\">10.1007/978-3-662-44199-2_24</a>","ista":"Bauer U, Kerber M, Reininghaus J, Wagner H. 2014. PHAT – Persistent Homology Algorithms Toolbox. ICMS 2014: International Congress on Mathematical Software. ICMS: International Congress on Mathematical SoftwareLNCS vol. 8592, 137–143.","chicago":"Bauer, Ulrich, Michael Kerber, Jan Reininghaus, and Hubert Wagner. “PHAT – Persistent Homology Algorithms Toolbox.” In <i>ICMS 2014: International Congress on Mathematical Software</i>, 8592:137–43. LNCS. Berlin, Heidelberg: Springer Berlin Heidelberg, 2014. <a href=\"https://doi.org/10.1007/978-3-662-44199-2_24\">https://doi.org/10.1007/978-3-662-44199-2_24</a>.","ieee":"U. Bauer, M. Kerber, J. Reininghaus, and H. Wagner, “PHAT – Persistent Homology Algorithms Toolbox,” in <i>ICMS 2014: International Congress on Mathematical Software</i>, Seoul, South Korea, 2014, vol. 8592, pp. 137–143.","short":"U. Bauer, M. Kerber, J. Reininghaus, H. Wagner, in:, ICMS 2014: International Congress on Mathematical Software, Springer Berlin Heidelberg, Berlin, Heidelberg, 2014, pp. 137–143."},"oa_version":"None","date_created":"2022-03-21T07:12:16Z","type":"conference"},{"status":"public","doi":"10.3389/fpls.2013.00451","date_published":"2013-11-19T00:00:00Z","intvolume":"         4","article_number":"451","day":"19","oa":1,"publication":"Frontiers in Plant Science","citation":{"ieee":"J. O’Brien and E. Benková, “Cytokinin cross talking during biotic and abiotic stress responses,” <i>Frontiers in Plant Science</i>, vol. 4. Frontiers Research Foundation, 2013.","short":"J. O’Brien, E. Benková, Frontiers in Plant Science 4 (2013).","chicago":"O’Brien, José, and Eva Benková. “Cytokinin Cross Talking during Biotic and Abiotic Stress Responses.” <i>Frontiers in Plant Science</i>. Frontiers Research Foundation, 2013. <a href=\"https://doi.org/10.3389/fpls.2013.00451\">https://doi.org/10.3389/fpls.2013.00451</a>.","ista":"O’Brien J, Benková E. 2013. Cytokinin cross talking during biotic and abiotic stress responses. Frontiers in Plant Science. 4, 451.","ama":"O’Brien J, Benková E. Cytokinin cross talking during biotic and abiotic stress responses. <i>Frontiers in Plant Science</i>. 2013;4. doi:<a href=\"https://doi.org/10.3389/fpls.2013.00451\">10.3389/fpls.2013.00451</a>","apa":"O’Brien, J., &#38; Benková, E. (2013). Cytokinin cross talking during biotic and abiotic stress responses. <i>Frontiers in Plant Science</i>. Frontiers Research Foundation. <a href=\"https://doi.org/10.3389/fpls.2013.00451\">https://doi.org/10.3389/fpls.2013.00451</a>","mla":"O’Brien, José, and Eva Benková. “Cytokinin Cross Talking during Biotic and Abiotic Stress Responses.” <i>Frontiers in Plant Science</i>, vol. 4, 451, Frontiers Research Foundation, 2013, doi:<a href=\"https://doi.org/10.3389/fpls.2013.00451\">10.3389/fpls.2013.00451</a>."},"oa_version":"Published Version","date_created":"2018-12-11T11:48:43Z","type":"journal_article","quality_controlled":"1","month":"11","publication_status":"published","ddc":["580"],"file_date_updated":"2020-07-14T12:48:11Z","publisher":"Frontiers Research Foundation","publist_id":"6821","ec_funded":1,"_id":"827","department":[{"_id":"EvBe"}],"project":[{"_id":"253FCA6A-B435-11E9-9278-68D0E5697425","name":"Hormonal cross-talk in plant organogenesis","call_identifier":"FP7","grant_number":"207362"}],"title":"Cytokinin cross talking during biotic and abiotic stress responses","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"scopus_import":1,"year":"2013","volume":4,"has_accepted_license":"1","date_updated":"2021-01-12T08:17:50Z","file":[{"checksum":"fdc25ddd1bf9a99b99f662cdbafeddd4","date_updated":"2020-07-14T12:48:11Z","file_name":"2013_FrontiersPlant_OBrien.pdf","relation":"main_file","file_id":"5903","creator":"dernst","access_level":"open_access","content_type":"application/pdf","date_created":"2019-01-31T10:40:38Z","file_size":953299}],"abstract":[{"text":"As sessile organisms, plants have to be able to adapt to a continuously changing environment. Plants that perceive some of these changes as stress signals activate signaling pathways to modulate their development and to enable them to survive. The complex responses to environmental cues are to a large extent mediated by plant hormones that together orchestrate the final plant response. The phytohormone cytokinin is involved in many plant developmental processes. Recently, it has been established that cytokinin plays an important role in stress responses, but does not act alone. Indeed, the hormonal control of plant development and stress adaptation is the outcome of a complex network of multiple synergistic and antagonistic interactions between various hormones. Here, we review the recent findings on the cytokinin function as part of this hormonal network. We focus on the importance of the crosstalk between cytokinin and other hormones, such as abscisic acid, jasmonate, salicylic acid, ethylene, and auxin in the modulation of plant development and stress adaptation. Finally, the impact of the current research in the biotechnological industry will be discussed.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"author":[{"full_name":"O'Brien, José","last_name":"O'Brien","first_name":"José"},{"first_name":"Eva","last_name":"Benková","full_name":"Benková, Eva","id":"38F4F166-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8510-9739"}]},{"language":[{"iso":"eng"}],"author":[{"orcid":"0000-0003-1923-2410","last_name":"Cuesta","full_name":"Cuesta, Candela","id":"33A3C818-F248-11E8-B48F-1D18A9856A87","first_name":"Candela"},{"orcid":"0000-0001-7263-0560","first_name":"Krzysztof T","last_name":"Wabnik","full_name":"Wabnik, Krzysztof T","id":"4DE369A4-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-8510-9739","first_name":"Eva","last_name":"Benková","id":"38F4F166-F248-11E8-B48F-1D18A9856A87","full_name":"Benková, Eva"}],"file":[{"checksum":"0185b3c4d7df9a94bd3ce5a66d213506","date_updated":"2020-07-14T12:48:11Z","file_name":"2013_FrontiersPlant_Cuesta.pdf","relation":"main_file","file_id":"5902","creator":"dernst","content_type":"application/pdf","access_level":"open_access","date_created":"2019-01-31T10:36:43Z","file_size":710835}],"date_updated":"2021-01-12T08:17:52Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"The plant root system is essential for providing anchorage to the soil, supplying minerals and water, and synthesizing metabolites. It is a dynamic organ modulated by external cues such as environmental signals, water and nutrients availability, salinity and others. Lateral roots (LRs) are initiated from the primary root post-embryonically, after which they progress through discrete developmental stages which can be independently controlled, providing a high level of plasticity during root system formation. Within this review, main contributions are presented, from the classical forward genetic screens to the more recent high-throughput approaches, combined with computer model predictions, dissecting how LRs and thereby root system architecture is established and developed.","lang":"eng"}],"volume":4,"has_accepted_license":"1","year":"2013","scopus_import":1,"tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"project":[{"name":"Hormonal cross-talk in plant organogenesis","call_identifier":"FP7","_id":"253FCA6A-B435-11E9-9278-68D0E5697425","grant_number":"207362"}],"title":"Systems approaches to study root architecture dynamics","department":[{"_id":"EvBe"}],"publist_id":"6820","publisher":"Frontiers Research Foundation","_id":"828","ec_funded":1,"publication_status":"published","ddc":["580"],"file_date_updated":"2020-07-14T12:48:11Z","month":"12","quality_controlled":"1","type":"journal_article","publication":"Frontiers in Plant Science","date_created":"2018-12-11T11:48:43Z","oa_version":"Published Version","citation":{"short":"C. Cuesta, K.T. Wabnik, E. Benková, Frontiers in Plant Science 4 (2013).","ieee":"C. Cuesta, K. T. Wabnik, and E. Benková, “Systems approaches to study root architecture dynamics,” <i>Frontiers in Plant Science</i>, vol. 4. Frontiers Research Foundation, 2013.","chicago":"Cuesta, Candela, Krzysztof T Wabnik, and Eva Benková. “Systems Approaches to Study Root Architecture Dynamics.” <i>Frontiers in Plant Science</i>. Frontiers Research Foundation, 2013. <a href=\"https://doi.org/10.3389/fpls.2013.00537\">https://doi.org/10.3389/fpls.2013.00537</a>.","ista":"Cuesta C, Wabnik KT, Benková E. 2013. Systems approaches to study root architecture dynamics. Frontiers in Plant Science. 4, 537.","ama":"Cuesta C, Wabnik KT, Benková E. Systems approaches to study root architecture dynamics. <i>Frontiers in Plant Science</i>. 2013;4. doi:<a href=\"https://doi.org/10.3389/fpls.2013.00537\">10.3389/fpls.2013.00537</a>","mla":"Cuesta, Candela, et al. “Systems Approaches to Study Root Architecture Dynamics.” <i>Frontiers in Plant Science</i>, vol. 4, 537, Frontiers Research Foundation, 2013, doi:<a href=\"https://doi.org/10.3389/fpls.2013.00537\">10.3389/fpls.2013.00537</a>.","apa":"Cuesta, C., Wabnik, K. T., &#38; Benková, E. (2013). Systems approaches to study root architecture dynamics. <i>Frontiers in Plant Science</i>. Frontiers Research Foundation. <a href=\"https://doi.org/10.3389/fpls.2013.00537\">https://doi.org/10.3389/fpls.2013.00537</a>"},"day":"26","oa":1,"intvolume":"         4","date_published":"2013-12-26T00:00:00Z","doi":"10.3389/fpls.2013.00537","article_number":"537","status":"public"},{"publication_status":"published","series_title":"Lecture Notes in Computer Science","publist_id":"5077","publisher":"Springer","_id":"2000","ec_funded":1,"department":[{"_id":"KrCh"}],"alternative_title":["LNCS"],"project":[{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"page":"101 - 106","title":"TTP: Tool for tumor progression","year":"2013","scopus_import":1,"volume":8044,"date_updated":"2023-09-07T11:40:43Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"In this work we present a flexible tool for tumor progression, which simulates the evolutionary dynamics of cancer. Tumor progression implements a multi-type branching process where the key parameters are the fitness landscape, the mutation rate, and the average time of cell division. The fitness of a cancer cell depends on the mutations it has accumulated. The input to our tool could be any fitness landscape, mutation rate, and cell division time, and the tool produces the growth dynamics and all relevant statistics."}],"language":[{"iso":"eng"}],"author":[{"orcid":"0000-0002-0170-7353","first_name":"Johannes","full_name":"Reiter, Johannes","last_name":"Reiter","id":"4A918E98-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Ivana","last_name":"Božić","full_name":"Božić, Ivana"},{"first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"first_name":"Martin","last_name":"Nowak","full_name":"Nowak, Martin"}],"conference":{"name":"CAV: Computer Aided Verification","location":"St. Petersburg, Russia","start_date":"2013-07-13","end_date":"2013-07-19"},"status":"public","related_material":{"record":[{"id":"5399","relation":"earlier_version","status":"public"},{"id":"1400","relation":"dissertation_contains","status":"public"}]},"intvolume":"      8044","doi":"10.1007/978-3-642-39799-8_6","date_published":"2013-01-01T00:00:00Z","day":"01","main_file_link":[{"url":"https://arxiv.org/abs/1303.5251","open_access":"1"}],"external_id":{"arxiv":["1303.5251"]},"oa":1,"publication":"Proceedings of 25th Int. Conf. on Computer Aided Verification","date_created":"2018-12-11T11:55:08Z","oa_version":"Preprint","citation":{"chicago":"Reiter, Johannes, Ivana Božić, Krishnendu Chatterjee, and Martin Nowak. “TTP: Tool for Tumor Progression.” In <i>Proceedings of 25th Int. Conf. on Computer Aided Verification</i>, 8044:101–6. Lecture Notes in Computer Science. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-39799-8_6\">https://doi.org/10.1007/978-3-642-39799-8_6</a>.","ista":"Reiter J, Božić I, Chatterjee K, Nowak M. 2013. TTP: Tool for tumor progression. Proceedings of 25th Int. Conf. on Computer Aided Verification. CAV: Computer Aided VerificationLecture Notes in Computer Science, LNCS, vol. 8044, 101–106.","ieee":"J. Reiter, I. Božić, K. Chatterjee, and M. Nowak, “TTP: Tool for tumor progression,” in <i>Proceedings of 25th Int. Conf. on Computer Aided Verification</i>, St. Petersburg, Russia, 2013, vol. 8044, pp. 101–106.","short":"J. Reiter, I. Božić, K. Chatterjee, M. Nowak, in:, Proceedings of 25th Int. Conf. on Computer Aided Verification, Springer, 2013, pp. 101–106.","mla":"Reiter, Johannes, et al. “TTP: Tool for Tumor Progression.” <i>Proceedings of 25th Int. Conf. on Computer Aided Verification</i>, vol. 8044, Springer, 2013, pp. 101–06, doi:<a href=\"https://doi.org/10.1007/978-3-642-39799-8_6\">10.1007/978-3-642-39799-8_6</a>.","apa":"Reiter, J., Božić, I., Chatterjee, K., &#38; Nowak, M. (2013). TTP: Tool for tumor progression. In <i>Proceedings of 25th Int. Conf. on Computer Aided Verification</i> (Vol. 8044, pp. 101–106). St. Petersburg, Russia: Springer. <a href=\"https://doi.org/10.1007/978-3-642-39799-8_6\">https://doi.org/10.1007/978-3-642-39799-8_6</a>","ama":"Reiter J, Božić I, Chatterjee K, Nowak M. TTP: Tool for tumor progression. In: <i>Proceedings of 25th Int. Conf. on Computer Aided Verification</i>. Vol 8044. Lecture Notes in Computer Science. Springer; 2013:101-106. doi:<a href=\"https://doi.org/10.1007/978-3-642-39799-8_6\">10.1007/978-3-642-39799-8_6</a>"},"type":"conference","quality_controlled":"1","arxiv":1,"month":"01"}]