[{"related_material":{"record":[{"id":"2086","relation":"used_in_publication","status":"public"}]},"article_processing_charge":"No","date_created":"2021-08-11T14:17:53Z","publisher":"Public Library of Science","year":"2014","citation":{"ama":"Wolf S, Mcmahon D, Lim K, et al. Supporting information. 2014. doi:<a href=\"https://doi.org/10.1371/journal.pone.0103989.s003\">10.1371/journal.pone.0103989.s003</a>","ista":"Wolf S, Mcmahon D, Lim K, Pull C, Clark S, Paxton R, Osborne J. 2014. Supporting information, Public Library of Science, <a href=\"https://doi.org/10.1371/journal.pone.0103989.s003\">10.1371/journal.pone.0103989.s003</a>.","ieee":"S. Wolf <i>et al.</i>, “Supporting information.” Public Library of Science, 2014.","apa":"Wolf, S., Mcmahon, D., Lim, K., Pull, C., Clark, S., Paxton, R., &#38; Osborne, J. (2014). Supporting information. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pone.0103989.s003\">https://doi.org/10.1371/journal.pone.0103989.s003</a>","chicago":"Wolf, Stephan, Dino Mcmahon, Ka Lim, Christopher Pull, Suzanne Clark, Robert Paxton, and Juliet Osborne. “Supporting Information.” Public Library of Science, 2014. <a href=\"https://doi.org/10.1371/journal.pone.0103989.s003\">https://doi.org/10.1371/journal.pone.0103989.s003</a>.","mla":"Wolf, Stephan, et al. <i>Supporting Information</i>. Public Library of Science, 2014, doi:<a href=\"https://doi.org/10.1371/journal.pone.0103989.s003\">10.1371/journal.pone.0103989.s003</a>.","short":"S. Wolf, D. Mcmahon, K. Lim, C. Pull, S. Clark, R. Paxton, J. Osborne, (2014)."},"month":"08","day":"06","oa_version":"Published Version","department":[{"_id":"SyCr"}],"_id":"9888","status":"public","type":"research_data_reference","doi":"10.1371/journal.pone.0103989.s003","fulldoi":"https://doi.org/10.1371/journal.pone.0103989.s003","title":"Supporting information","abstract":[{"lang":"eng","text":"Detailed description of the experimental prodedures, data analyses and additional statistical analyses of the results."}],"author":[{"last_name":"Wolf","full_name":"Wolf, Stephan","first_name":"Stephan"},{"first_name":"Dino","last_name":"Mcmahon","full_name":"Mcmahon, Dino"},{"first_name":"Ka","full_name":"Lim, Ka","last_name":"Lim"},{"id":"3C7F4840-F248-11E8-B48F-1D18A9856A87","last_name":"Pull","full_name":"Pull, Christopher","orcid":"0000-0003-1122-3982","first_name":"Christopher"},{"last_name":"Clark","full_name":"Clark, Suzanne","first_name":"Suzanne"},{"full_name":"Paxton, Robert","last_name":"Paxton","first_name":"Robert"},{"first_name":"Juliet","full_name":"Osborne, Juliet","last_name":"Osborne"}],"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","date_updated":"2025-09-29T11:45:40Z"},{"oa_version":"None","status":"public","_id":"9931","publisher":"Wiley","citation":{"chicago":"Dhar, Riddhiman, Tobias Bergmiller, and Andreas Wagner. “Increased Gene Dosage Plays a Predominant Role in the Initial Stages of Evolution of Duplicate TEM-1 Beta Lactamase Genes.” <i>Evolution</i>. Wiley, 2014. <a href=\"https://doi.org/10.1111/evo.12373\">https://doi.org/10.1111/evo.12373</a>.","mla":"Dhar, Riddhiman, et al. “Increased Gene Dosage Plays a Predominant Role in the Initial Stages of Evolution of Duplicate TEM-1 Beta Lactamase Genes.” <i>Evolution</i>, vol. 68, no. 6, Wiley, 2014, pp. 1775–91, doi:<a href=\"https://doi.org/10.1111/evo.12373\">10.1111/evo.12373</a>.","short":"R. Dhar, T. Bergmiller, A. Wagner, Evolution 68 (2014) 1775–1791.","ama":"Dhar R, Bergmiller T, Wagner A. Increased gene dosage plays a predominant role in the initial stages of evolution of duplicate TEM-1 beta lactamase genes. <i>Evolution</i>. 2014;68(6):1775-1791. doi:<a href=\"https://doi.org/10.1111/evo.12373\">10.1111/evo.12373</a>","ista":"Dhar R, Bergmiller T, Wagner A. 2014. Increased gene dosage plays a predominant role in the initial stages of evolution of duplicate TEM-1 beta lactamase genes. Evolution. 68(6), 1775–1791.","ieee":"R. Dhar, T. Bergmiller, and A. Wagner, “Increased gene dosage plays a predominant role in the initial stages of evolution of duplicate TEM-1 beta lactamase genes,” <i>Evolution</i>, vol. 68, no. 6. Wiley, pp. 1775–1791, 2014.","apa":"Dhar, R., Bergmiller, T., &#38; Wagner, A. (2014). Increased gene dosage plays a predominant role in the initial stages of evolution of duplicate TEM-1 beta lactamase genes. <i>Evolution</i>. Wiley. <a href=\"https://doi.org/10.1111/evo.12373\">https://doi.org/10.1111/evo.12373</a>"},"acknowledgement":"We thank the Functional Genomics Center Zurich for its service in generating sequencing data, M. Ackermann and E. Hayden for helpful discussions, A. de Visser for comments on earlier versions of this manuscript, and M. Moser for help with quantitative PCR. This work was supported by Swiss National Science Foundation (grant 315230–129708), as well as through the YeastX project of SystemsX.ch, and the University Priority Research Program in Systems Biology at the University of Zurich. RD acknowledges support from the Forschungskredit program of the University of Zurich. The authors declare no conflict of interest.","year":"2014","isi":1,"day":"03","intvolume":"        68","issue":"6","external_id":{"pmid":["24495000"],"isi":["000337558900019"]},"date_updated":"2025-09-29T13:20:48Z","abstract":[{"text":"Gene duplication is important in evolution, because it provides new raw material for evolutionary adaptations. Several existing hypotheses about the causes of duplicate retention and diversification differ in their emphasis on gene dosage, subfunctionalization, and neofunctionalization. Little experimental data exist on the relative importance of gene expression changes and changes in coding regions for the evolution of duplicate genes. Furthermore, we do not know how strongly the environment could affect this importance. To address these questions, we performed evolution experiments with the TEM-1 beta lactamase gene in Escherichia coli to study the initial stages of duplicate gene evolution in the laboratory. We mimicked tandem duplication by inserting two copies of the TEM-1 gene on the same plasmid. We then subjected these copies to repeated cycles of mutagenesis and selection in various environments that contained antibiotics in different combinations and concentrations. Our experiments showed that gene dosage is the most important factor in the initial stages of duplicate gene evolution, and overshadows the importance of point mutations in the coding region.","lang":"eng"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","article_type":"original","fulldoi":"https://doi.org/10.1111/evo.12373","date_published":"2014-06-03T00:00:00Z","publication_status":"published","language":[{"iso":"eng"}],"department":[{"_id":"CaGu"}],"volume":68,"page":"1775-1791","month":"06","article_processing_charge":"No","date_created":"2021-08-17T09:03:09Z","quality_controlled":"1","related_material":{"record":[{"relation":"research_data","id":"9932","status":"public"}]},"scopus_import":"1","author":[{"last_name":"Dhar","full_name":"Dhar, Riddhiman","first_name":"Riddhiman"},{"id":"2C471CFA-F248-11E8-B48F-1D18A9856A87","last_name":"Bergmiller","full_name":"Bergmiller, Tobias","first_name":"Tobias","orcid":"0000-0001-5396-4346"},{"full_name":"Wagner, Andreas","last_name":"Wagner","first_name":"Andreas"}],"publication":"Evolution","type":"journal_article","doi":"10.1111/evo.12373","title":"Increased gene dosage plays a predominant role in the initial stages of evolution of duplicate TEM-1 beta lactamase genes","publication_identifier":{"eissn":["1558-5646"],"issn":["0014-3820"]},"pmid":1},{"day":"27","month":"01","year":"2014","citation":{"ama":"Dhar R, Bergmiller T, Wagner A. Data from: Increased gene dosage plays a predominant role in the initial stages of evolution of duplicate TEM-1 beta lactamase genes. 2014. doi:<a href=\"https://doi.org/10.5061/dryad.jc402\">10.5061/dryad.jc402</a>","ista":"Dhar R, Bergmiller T, Wagner A. 2014. Data from: Increased gene dosage plays a predominant role in the initial stages of evolution of duplicate TEM-1 beta lactamase genes, Dryad, <a href=\"https://doi.org/10.5061/dryad.jc402\">10.5061/dryad.jc402</a>.","apa":"Dhar, R., Bergmiller, T., &#38; Wagner, A. (2014). Data from: Increased gene dosage plays a predominant role in the initial stages of evolution of duplicate TEM-1 beta lactamase genes. Dryad. <a href=\"https://doi.org/10.5061/dryad.jc402\">https://doi.org/10.5061/dryad.jc402</a>","ieee":"R. Dhar, T. Bergmiller, and A. Wagner, “Data from: Increased gene dosage plays a predominant role in the initial stages of evolution of duplicate TEM-1 beta lactamase genes.” Dryad, 2014.","chicago":"Dhar, Riddhiman, Tobias Bergmiller, and Andreas Wagner. “Data from: Increased Gene Dosage Plays a Predominant Role in the Initial Stages of Evolution of Duplicate TEM-1 Beta Lactamase Genes.” Dryad, 2014. <a href=\"https://doi.org/10.5061/dryad.jc402\">https://doi.org/10.5061/dryad.jc402</a>.","short":"R. Dhar, T. Bergmiller, A. Wagner, (2014).","mla":"Dhar, Riddhiman, et al. <i>Data from: Increased Gene Dosage Plays a Predominant Role in the Initial Stages of Evolution of Duplicate TEM-1 Beta Lactamase Genes</i>. Dryad, 2014, doi:<a href=\"https://doi.org/10.5061/dryad.jc402\">10.5061/dryad.jc402</a>."},"publisher":"Dryad","status":"public","_id":"9932","department":[{"_id":"CaGu"}],"oa_version":"Published Version","related_material":{"record":[{"id":"9931","relation":"used_in_publication","status":"public"}]},"date_created":"2021-08-17T09:11:40Z","article_processing_charge":"No","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","abstract":[{"lang":"eng","text":"Gene duplication is important in evolution, because it provides new raw material for evolutionary adaptations. Several existing hypotheses about the causes of duplicate retention and diversification differ in their emphasis on gene dosage, sub-functionalization, and neo-functionalization. Little experimental data exists on the relative importance of gene expression changes and changes in coding regions for the evolution of duplicate genes. Furthermore, we do not know how strongly the environment could affect this importance. To address these questions, we performed evolution experiments with the TEM-1 beta lactamase gene in E. coli to study the initial stages of duplicate gene evolution in the laboratory. We mimicked tandem duplication by inserting two copies of the TEM-1 gene on the same plasmid. We then subjected these copies to repeated cycles of mutagenesis and selection in various environments that contained antibiotics in different combinations and concentrations. Our experiments showed that gene dosage is the most important factor in the initial stages of duplicate gene evolution, and overshadows the importance of point mutations in the coding region."}],"author":[{"last_name":"Dhar","full_name":"Dhar, Riddhiman","first_name":"Riddhiman"},{"last_name":"Bergmiller","id":"2C471CFA-F248-11E8-B48F-1D18A9856A87","full_name":"Bergmiller, Tobias","orcid":"0000-0001-5396-4346","first_name":"Tobias"},{"full_name":"Wagner, Andreas","last_name":"Wagner","first_name":"Andreas"}],"date_updated":"2025-09-29T13:20:47Z","oa":1,"title":"Data from: Increased gene dosage plays a predominant role in the initial stages of evolution of duplicate TEM-1 beta lactamase genes","date_published":"2014-01-27T00:00:00Z","main_file_link":[{"url":"https://doi.org/10.5061/dryad.jc402","open_access":"1"}],"fulldoi":"https://doi.org/10.5061/dryad.jc402","doi":"10.5061/dryad.jc402","type":"research_data_reference"},{"external_id":{"isi":["000330244500130"]},"issue":"1","file":[{"access_level":"open_access","checksum":"1d5816b343abe5eadc3eb419bcece971","relation":"main_file","date_updated":"2020-07-14T12:46:06Z","content_type":"application/pdf","creator":"system","file_id":"5011","file_name":"IST-2016-432-v1+1_journal.pone.0085841.pdf","date_created":"2018-12-12T10:13:28Z","file_size":1568524}],"intvolume":"         9","day":"21","isi":1,"citation":{"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>","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,” <i>PLoS One</i>, vol. 9, no. 1. Public Library of Science, 2014.","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>","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>.","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>.","short":"G. Tkačik, A. Ghosh, E. Schneidman, R. Segev, PLoS One 9 (2014)."},"year":"2014","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","publisher":"Public Library of Science","_id":"3263","status":"public","oa_version":"Published Version","ddc":["570"],"date_published":"2014-01-21T00:00:00Z","has_accepted_license":"1","fulldoi":"https://doi.org/10.1371/journal.pone.0085841","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","file_date_updated":"2020-07-14T12:46:06Z","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."}],"date_updated":"2025-09-29T11:09:18Z","publist_id":"3385","quality_controlled":"1","date_created":"2018-12-11T12:02:20Z","article_processing_charge":"No","month":"01","volume":9,"language":[{"iso":"eng"}],"department":[{"_id":"GaTk"}],"pubrep_id":"432","publication_status":"published","article_number":"e85841","oa":1,"title":"Adaptation to changes in higher-order stimulus statistics in the salamander retina","doi":"10.1371/journal.pone.0085841","type":"journal_article","publication":"PLoS One","author":[{"first_name":"Gasper","orcid":"0000-0002-6699-1455","full_name":"Tkacik, Gasper","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","last_name":"Tkacik"},{"first_name":"Anandamohan","full_name":"Ghosh, Anandamohan","last_name":"Ghosh"},{"last_name":"Schneidman","full_name":"Schneidman, Elad","first_name":"Elad"},{"last_name":"Segev","full_name":"Segev, Ronen","first_name":"Ronen"}],"corr_author":"1","scopus_import":"1"},{"intvolume":"       560","issue":"3","external_id":{"isi":["000347601300009"],"arxiv":["1210.2450"]},"publisher":"Elsevier","citation":{"short":"P. Cerny, M. Chmelik, T.A. Henzinger, A. Radhakrishna, Theoretical Computer Science 560 (2014) 348–363.","mla":"Cerny, Pavol, et al. “Interface Simulation Distances.” <i>Theoretical Computer Science</i>, vol. 560, no. 3, Elsevier, 2014, pp. 348–63, doi:<a href=\"https://doi.org/10.1016/j.tcs.2014.08.019\">10.1016/j.tcs.2014.08.019</a>.","chicago":"Cerny, Pavol, Martin Chmelik, Thomas A Henzinger, and Arjun Radhakrishna. “Interface Simulation Distances.” <i>Theoretical Computer Science</i>. Elsevier, 2014. <a href=\"https://doi.org/10.1016/j.tcs.2014.08.019\">https://doi.org/10.1016/j.tcs.2014.08.019</a>.","apa":"Cerny, P., Chmelik, M., Henzinger, T. A., &#38; Radhakrishna, A. (2014). Interface simulation distances. <i>Theoretical Computer Science</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.tcs.2014.08.019\">https://doi.org/10.1016/j.tcs.2014.08.019</a>","ieee":"P. Cerny, M. Chmelik, T. A. Henzinger, and A. Radhakrishna, “Interface simulation distances,” <i>Theoretical Computer Science</i>, vol. 560, no. 3. Elsevier, pp. 348–363, 2014.","ista":"Cerny P, Chmelik M, Henzinger TA, Radhakrishna A. 2014. Interface simulation distances. Theoretical Computer Science. 560(3), 348–363.","ama":"Cerny P, Chmelik M, Henzinger TA, Radhakrishna A. Interface simulation distances. <i>Theoretical Computer Science</i>. 2014;560(3):348-363. doi:<a href=\"https://doi.org/10.1016/j.tcs.2014.08.019\">10.1016/j.tcs.2014.08.019</a>"},"year":"2014","isi":1,"day":"04","arxiv":1,"oa_version":"Submitted Version","_id":"1733","status":"public","fulldoi":"https://doi.org/10.1016/j.tcs.2014.08.019","date_published":"2014-12-04T00:00:00Z","abstract":[{"text":"The classical (boolean) notion of refinement for behavioral interfaces of system components is the alternating refinement preorder. In this paper, we define a distance for interfaces, called interface simulation distance. It makes the alternating refinement preorder quantitative by, intuitively, tolerating errors (while counting them) in the alternating simulation game. We show that the interface simulation distance satisfies the triangle inequality, that the distance between two interfaces does not increase under parallel composition with a third interface, that the distance between two interfaces can be bounded from above and below by distances between abstractions of the two interfaces, and how to synthesize an interface from incompatible requirements. We illustrate the framework, and the properties of the distances under composition of interfaces, with two case studies.","lang":"eng"}],"ec_funded":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_updated":"2025-09-29T13:14:25Z","publist_id":"5392","related_material":{"record":[{"relation":"earlier_version","id":"2916","status":"public"}]},"quality_controlled":"1","project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","call_identifier":"FP7","grant_number":"267989"},{"grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","name":"Moderne Concurrency Paradigms","call_identifier":"FWF"},{"name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S11407"},{"_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","grant_number":"P 23499-N23"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"article_processing_charge":"No","date_created":"2018-12-11T11:53:43Z","month":"12","publication_status":"published","language":[{"iso":"eng"}],"department":[{"_id":"ToHe"},{"_id":"KrCh"}],"volume":560,"page":"348 - 363","type":"journal_article","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1210.2450"}],"doi":"10.1016/j.tcs.2014.08.019","oa":1,"title":"Interface simulation distances","author":[{"full_name":"Cerny, Pavol","last_name":"Cerny","first_name":"Pavol"},{"first_name":"Martin","full_name":"Chmelik, Martin","last_name":"Chmelik","id":"3624234E-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000−0002−2985−7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"full_name":"Radhakrishna, Arjun","last_name":"Radhakrishna","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","first_name":"Arjun"}],"publication":"Theoretical Computer Science","scopus_import":"1","corr_author":"1"},{"quality_controlled":"1","date_created":"2018-12-11T11:54:07Z","day":"01","month":"04","citation":{"apa":"Baster, P., &#38; Friml, J. (2014). Auxin on the road navigated by cellular PIN polarity. In E. Zažímalová, J. Petrášek, &#38; E. Benková (Eds.), <i>Auxin and Its Role in Plant Development</i> (pp. 143–170). Springer. <a href=\"https://doi.org/10.1007/978-3-7091-1526-8_8\">https://doi.org/10.1007/978-3-7091-1526-8_8</a>","ieee":"P. Baster and J. Friml, “Auxin on the road navigated by cellular PIN polarity,” in <i>Auxin and Its Role in Plant Development</i>, E. Zažímalová, J. Petrášek, and E. Benková, Eds. Springer, 2014, pp. 143–170.","ama":"Baster P, Friml J. Auxin on the road navigated by cellular PIN polarity. In: Zažímalová E, Petrášek J, Benková E, eds. <i>Auxin and Its Role in Plant Development</i>. Springer; 2014:143-170. doi:<a href=\"https://doi.org/10.1007/978-3-7091-1526-8_8\">10.1007/978-3-7091-1526-8_8</a>","ista":"Baster P, Friml J. 2014.Auxin on the road navigated by cellular PIN polarity. In: Auxin and Its Role in Plant Development. , 143–170.","short":"P. Baster, J. Friml, in:, E. Zažímalová, J. Petrášek, E. Benková (Eds.), Auxin and Its Role in Plant Development, Springer, 2014, pp. 143–170.","mla":"Baster, Pawel, and Jiří Friml. “Auxin on the Road Navigated by Cellular PIN Polarity.” <i>Auxin and Its Role in Plant Development</i>, edited by Eva Zažímalová et al., Springer, 2014, pp. 143–70, doi:<a href=\"https://doi.org/10.1007/978-3-7091-1526-8_8\">10.1007/978-3-7091-1526-8_8</a>.","chicago":"Baster, Pawel, and Jiří Friml. “Auxin on the Road Navigated by Cellular PIN Polarity.” In <i>Auxin and Its Role in Plant Development</i>, edited by Eva Zažímalová, Jan Petrášek, and Eva Benková, 143–70. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-7091-1526-8_8\">https://doi.org/10.1007/978-3-7091-1526-8_8</a>."},"year":"2014","publisher":"Springer","_id":"1806","status":"public","page":"143 - 170","department":[{"_id":"JiFr"}],"language":[{"iso":"eng"}],"editor":[{"first_name":"Eva","last_name":"Zažímalová","full_name":"Zažímalová, Eva"},{"first_name":"Jan","last_name":"Petrášek","full_name":"Petrášek, Jan"},{"full_name":"Benková, Eva","id":"38F4F166-F248-11E8-B48F-1D18A9856A87","last_name":"Benková","first_name":"Eva","orcid":"0000-0002-8510-9739"}],"oa_version":"None","publication_status":"published","title":"Auxin on the road navigated by cellular PIN polarity","date_published":"2014-04-01T00:00:00Z","doi":"10.1007/978-3-7091-1526-8_8","fulldoi":"https://doi.org/10.1007/978-3-7091-1526-8_8","type":"book_chapter","publication":"Auxin and Its Role in Plant Development","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"The generation of asymmetry, at both cellular and tissue level, is one of the most essential capabilities of all eukaryotic organisms. It mediates basically all multicellular development ranging from embryogenesis and de novo organ formation till responses to various environmental stimuli. In plants, the awe-inspiring number of such processes is regulated by phytohormone auxin and its directional, cell-to-cell transport. The mediators of this transport, PIN auxin transporters, are asymmetrically localized at the plasma membrane, and this polar localization determines the directionality of intercellular auxin flow. Thus, auxin transport contributes crucially to the generation of local auxin gradients or maxima, which instruct given cell to change its developmental program. Here, we introduce and discuss the molecular components and cellular mechanisms regulating the generation and maintenance of cellular PIN polarity, as the general hallmarks of cell polarity in plants.","lang":"eng"}],"author":[{"first_name":"Pawel","full_name":"Baster, Pawel","id":"3028BD74-F248-11E8-B48F-1D18A9856A87","last_name":"Baster"},{"first_name":"Jiří","orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87","last_name":"Friml","full_name":"Friml, Jiří"}],"corr_author":"1","date_updated":"2024-10-09T20:55:54Z","publist_id":"5304","scopus_import":1},{"fulldoi":"https://doi.org/10.1142/S0218195914500034","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"ddc":["000"],"has_accepted_license":"1","date_published":"2014-03-16T00:00:00Z","publist_id":"5290","date_updated":"2024-10-09T20:55:54Z","abstract":[{"text":"Watermarking techniques for vector graphics dislocate vertices in order to embed imperceptible, yet detectable, statistical features into the input data. The embedding process may result in a change of the topology of the input data, e.g., by introducing self-intersections, which is undesirable or even disastrous for many applications. In this paper we present a watermarking framework for two-dimensional vector graphics that employs conventional watermarking techniques but still provides the guarantee that the topology of the input data is preserved. The geometric part of this framework computes so-called maximum perturbation regions (MPR) of vertices. We propose two efficient algorithms to compute MPRs based on Voronoi diagrams and constrained triangulations. Furthermore, we present two algorithms to conditionally correct the watermarked data in order to increase the watermark embedding capacity and still guarantee topological correctness. While we focus on the watermarking of input formed by straight-line segments, one of our approaches can also be extended to circular arcs. We conclude the paper by demonstrating and analyzing the applicability of our framework in conjunction with two well-known watermarking techniques.","lang":"eng"}],"file_date_updated":"2020-07-14T12:45:17Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","file":[{"date_created":"2018-12-12T10:08:43Z","file_size":991734,"file_name":"IST-2016-443-v1+1_S0218195914500034.pdf","file_id":"4704","creator":"system","content_type":"application/pdf","date_updated":"2020-07-14T12:45:17Z","checksum":"be45c133ab4d43351260e21beaa8f4b1","access_level":"open_access","relation":"main_file"}],"intvolume":"        24","issue":"1","oa_version":"Published Version","status":"public","_id":"1816","citation":{"short":"S. Huber, M. Held, P. Meerwald, R. Kwitt, International Journal of Computational Geometry and Applications 24 (2014) 61–86.","mla":"Huber, Stefan, et al. “Topology-Preserving Watermarking of Vector Graphics.” <i>International Journal of Computational Geometry and Applications</i>, vol. 24, no. 1, World Scientific Publishing, 2014, pp. 61–86, doi:<a href=\"https://doi.org/10.1142/S0218195914500034\">10.1142/S0218195914500034</a>.","chicago":"Huber, Stefan, Martin Held, Peter Meerwald, and Roland Kwitt. “Topology-Preserving Watermarking of Vector Graphics.” <i>International Journal of Computational Geometry and Applications</i>. World Scientific Publishing, 2014. <a href=\"https://doi.org/10.1142/S0218195914500034\">https://doi.org/10.1142/S0218195914500034</a>.","ieee":"S. Huber, M. Held, P. Meerwald, and R. Kwitt, “Topology-preserving watermarking of vector graphics,” <i>International Journal of Computational Geometry and Applications</i>, vol. 24, no. 1. World Scientific Publishing, pp. 61–86, 2014.","apa":"Huber, S., Held, M., Meerwald, P., &#38; Kwitt, R. (2014). Topology-preserving watermarking of vector graphics. <i>International Journal of Computational Geometry and Applications</i>. World Scientific Publishing. <a href=\"https://doi.org/10.1142/S0218195914500034\">https://doi.org/10.1142/S0218195914500034</a>","ista":"Huber S, Held M, Meerwald P, Kwitt R. 2014. Topology-preserving watermarking of vector graphics. International Journal of Computational Geometry and Applications. 24(1), 61–86.","ama":"Huber S, Held M, Meerwald P, Kwitt R. Topology-preserving watermarking of vector graphics. <i>International Journal of Computational Geometry and Applications</i>. 2014;24(1):61-86. doi:<a href=\"https://doi.org/10.1142/S0218195914500034\">10.1142/S0218195914500034</a>"},"year":"2014","acknowledgement":"Work by Martin Held and Stefan Huber was supported by Austrian Science Fund (FWF): L367-N15 and P25816-N15.","publisher":"World Scientific Publishing","day":"16","doi":"10.1142/S0218195914500034","type":"journal_article","oa":1,"title":"Topology-preserving watermarking of vector graphics","scopus_import":1,"corr_author":"1","author":[{"id":"4700A070-F248-11E8-B48F-1D18A9856A87","last_name":"Huber","full_name":"Huber, Stefan","orcid":"0000-0002-8871-5814","first_name":"Stefan"},{"last_name":"Held","full_name":"Held, Martin","first_name":"Martin"},{"full_name":"Meerwald, Peter","last_name":"Meerwald","first_name":"Peter"},{"full_name":"Kwitt, Roland","last_name":"Kwitt","first_name":"Roland"}],"publication":"International Journal of Computational Geometry and Applications","date_created":"2018-12-11T11:54:10Z","quality_controlled":"1","volume":24,"department":[{"_id":"HeEd"}],"language":[{"iso":"eng"}],"pubrep_id":"443","publication_status":"published","page":"61 - 86","month":"03"},{"date_published":"2014-01-01T00:00:00Z","fulldoi":"https://doi.org/10.1007/978-3-319-03194-1_3","alternative_title":["Springer Tracts in Advanced Robotics"],"publist_id":"5274","date_updated":"2021-01-12T06:53:28Z","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"Hitting and batting tasks, such as tennis forehands, ping-pong strokes, or baseball batting, depend on predictions where the ball can be intercepted and how it can properly be returned to the opponent. These predictions get more accurate over time, hence the behaviors need to be continuously modified. As a result, movement templates with a learned global shape need to be adapted during the execution so that the racket reaches a target position and velocity that will return the ball over to the other side of the net or court. It requires altering learned movements to hit a varying target with the necessary velocity at a specific instant in time. Such a task cannot be incorporated straightforwardly in most movement representations suitable for learning. For example, the standard formulation of the dynamical system based motor primitives (introduced by Ijspeert et al (2002b)) does not satisfy this property despite their flexibility which has allowed learning tasks ranging from locomotion to kendama. In order to fulfill this requirement, we reformulate the Ijspeert framework to incorporate the possibility of specifying a desired hitting point and a desired hitting velocity while maintaining all advantages of the original formulation.We show that the proposed movement template formulation works well in two scenarios, i.e., for hitting a ball on a string with a table tennis racket at a specified velocity and for returning balls launched by a ball gun successfully over the net using forehand movements."}],"intvolume":"        97","status":"public","_id":"1829","oa_version":"None","editor":[{"last_name":"Kober","full_name":"Kober, Jens","first_name":"Jens"},{"first_name":"Jan","full_name":"Peters, Jan","last_name":"Peters"}],"day":"01","publisher":"Springer","year":"2014","citation":{"chicago":"Muelling, Katharina, Oliver Kroemer, Christoph Lampert, and Bernhard Schölkopf. “Movement Templates for Learning of Hitting and Batting.” In <i>Learning Motor Skills</i>, edited by Jens Kober and Jan Peters, 97:69–82. From Algorithms to Robot Experiments. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-319-03194-1_3\">https://doi.org/10.1007/978-3-319-03194-1_3</a>.","mla":"Muelling, Katharina, et al. “Movement Templates for Learning of Hitting and Batting.” <i>Learning Motor Skills</i>, edited by Jens Kober and Jan Peters, vol. 97, Springer, 2014, pp. 69–82, doi:<a href=\"https://doi.org/10.1007/978-3-319-03194-1_3\">10.1007/978-3-319-03194-1_3</a>.","short":"K. Muelling, O. Kroemer, C. Lampert, B. Schölkopf, in:, J. Kober, J. Peters (Eds.), Learning Motor Skills, Springer, 2014, pp. 69–82.","ista":"Muelling K, Kroemer O, Lampert C, Schölkopf B. 2014.Movement templates for learning of hitting and batting. In: Learning Motor Skills. Springer Tracts in Advanced Robotics, vol. 97, 69–82.","ama":"Muelling K, Kroemer O, Lampert C, Schölkopf B. Movement templates for learning of hitting and batting. In: Kober J, Peters J, eds. <i>Learning Motor Skills</i>. Vol 97. From Algorithms to Robot Experiments. Springer; 2014:69-82. doi:<a href=\"https://doi.org/10.1007/978-3-319-03194-1_3\">10.1007/978-3-319-03194-1_3</a>","apa":"Muelling, K., Kroemer, O., Lampert, C., &#38; Schölkopf, B. (2014). Movement templates for learning of hitting and batting. In J. Kober &#38; J. Peters (Eds.), <i>Learning Motor Skills</i> (Vol. 97, pp. 69–82). Springer. <a href=\"https://doi.org/10.1007/978-3-319-03194-1_3\">https://doi.org/10.1007/978-3-319-03194-1_3</a>","ieee":"K. Muelling, O. Kroemer, C. Lampert, and B. Schölkopf, “Movement templates for learning of hitting and batting,” in <i>Learning Motor Skills</i>, vol. 97, J. Kober and J. Peters, Eds. Springer, 2014, pp. 69–82."},"title":"Movement templates for learning of hitting and batting","type":"book_chapter","doi":"10.1007/978-3-319-03194-1_3","scopus_import":1,"publication":"Learning Motor Skills","author":[{"last_name":"Muelling","full_name":"Muelling, Katharina","first_name":"Katharina"},{"first_name":"Oliver","last_name":"Kroemer","full_name":"Kroemer, Oliver"},{"full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","last_name":"Lampert","first_name":"Christoph","orcid":"0000-0001-8622-7887"},{"first_name":"Bernhard","last_name":"Schölkopf","full_name":"Schölkopf, Bernhard"}],"date_created":"2018-12-11T11:54:14Z","quality_controlled":"1","series_title":"From Algorithms to Robot Experiments","page":"69 - 82","publication_status":"published","department":[{"_id":"ChLa"}],"volume":97,"language":[{"iso":"eng"}],"month":"01"},{"article_processing_charge":"No","date_created":"2018-12-11T11:54:18Z","publication_status":"published","language":[{"iso":"eng"}],"volume":53,"department":[{"_id":"UlWa"},{"_id":"HeEd"}],"page":"64 - 79","month":"11","type":"journal_article","main_file_link":[{"url":"http://arxiv.org/abs/1310.7004","open_access":"1"}],"doi":"10.1007/s00454-014-9646-x","title":"On the geometric ramsey number of outerplanar graphs","oa":1,"scopus_import":"1","author":[{"full_name":"Cibulka, Josef","last_name":"Cibulka","first_name":"Josef"},{"first_name":"Pu","last_name":"Gao","full_name":"Gao, Pu"},{"full_name":"Krcál, Marek","id":"33E21118-F248-11E8-B48F-1D18A9856A87","last_name":"Krcál","first_name":"Marek"},{"first_name":"Tomáš","last_name":"Valla","full_name":"Valla, Tomáš"},{"last_name":"Valtr","full_name":"Valtr, Pavel","first_name":"Pavel"}],"publication":"Discrete & Computational Geometry","intvolume":"        53","issue":"1","external_id":{"isi":["000346774600005"],"arxiv":["1310.7004"]},"oa_version":"Submitted Version","status":"public","_id":"1842","publisher":"Springer","acknowledgement":"Marek Krčál was supported by the ERC Advanced Grant No. 267165.","year":"2014","citation":{"ista":"Cibulka J, Gao P, Krcál M, Valla T, Valtr P. 2014. On the geometric ramsey number of outerplanar graphs. Discrete &#38; Computational Geometry. 53(1), 64–79.","ama":"Cibulka J, Gao P, Krcál M, Valla T, Valtr P. On the geometric ramsey number of outerplanar graphs. <i>Discrete &#38; Computational Geometry</i>. 2014;53(1):64-79. doi:<a href=\"https://doi.org/10.1007/s00454-014-9646-x\">10.1007/s00454-014-9646-x</a>","ieee":"J. Cibulka, P. Gao, M. Krcál, T. Valla, and P. Valtr, “On the geometric ramsey number of outerplanar graphs,” <i>Discrete &#38; Computational Geometry</i>, vol. 53, no. 1. Springer, pp. 64–79, 2014.","apa":"Cibulka, J., Gao, P., Krcál, M., Valla, T., &#38; Valtr, P. (2014). On the geometric ramsey number of outerplanar graphs. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/s00454-014-9646-x\">https://doi.org/10.1007/s00454-014-9646-x</a>","chicago":"Cibulka, Josef, Pu Gao, Marek Krcál, Tomáš Valla, and Pavel Valtr. “On the Geometric Ramsey Number of Outerplanar Graphs.” <i>Discrete &#38; Computational Geometry</i>. Springer, 2014. <a href=\"https://doi.org/10.1007/s00454-014-9646-x\">https://doi.org/10.1007/s00454-014-9646-x</a>.","mla":"Cibulka, Josef, et al. “On the Geometric Ramsey Number of Outerplanar Graphs.” <i>Discrete &#38; Computational Geometry</i>, vol. 53, no. 1, Springer, 2014, pp. 64–79, doi:<a href=\"https://doi.org/10.1007/s00454-014-9646-x\">10.1007/s00454-014-9646-x</a>.","short":"J. Cibulka, P. Gao, M. Krcál, T. Valla, P. Valtr, Discrete &#38; Computational Geometry 53 (2014) 64–79."},"isi":1,"day":"14","arxiv":1,"fulldoi":"https://doi.org/10.1007/s00454-014-9646-x","date_published":"2014-11-14T00:00:00Z","publist_id":"5260","date_updated":"2025-09-29T13:11:56Z","abstract":[{"lang":"eng","text":"We prove polynomial upper bounds of geometric Ramsey numbers of pathwidth-2 outerplanar triangulations in both convex and general cases. We also prove that the geometric Ramsey numbers of the ladder graph on 2n vertices are bounded by O(n3) and O(n10), in the convex and general case, respectively. We then apply similar methods to prove an (Formula presented.) upper bound on the Ramsey number of a path with n ordered vertices."}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345"},{"fulldoi":"https://doi.org/10.1093/molbev/msu312","tmp":{"name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","short":"CC BY-NC (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png"},"ddc":["571"],"date_published":"2014-11-12T00:00:00Z","has_accepted_license":"1","file_date_updated":"2020-07-14T12:45:19Z","abstract":[{"text":"Local protein interactions (&quot;molecular context&quot; effects) dictate amino acid replacements and can be described in terms of site-specific, energetic preferences for any different amino acid. It has been recently debated whether these preferences remain approximately constant during evolution or whether, due to coevolution of sites, they change strongly. Such research highlights an unresolved and fundamental issue with far-reaching implications for phylogenetic analysis and molecular evolution modeling. Here, we take advantage of the recent availability of phenotypically supported laboratory resurrections of Precambrian thioredoxins and β-lactamases to experimentally address the change of site-specific amino acid preferences over long geological timescales. Extensive mutational analyses support the notion that evolutionary adjustment to a new amino acid may occur, but to a large extent this is insufficient to erase the primitive preference for amino acid replacements. Generally, site-specific amino acid preferences appear to remain conserved throughout evolutionary history despite local sequence divergence. We show such preference conservation to be readily understandable in molecular terms and we provide crystallographic evidence for an intriguing structural-switch mechanism: Energetic preference for an ancestral amino acid in a modern protein can be linked to reorganization upon mutation to the ancestral local structure around the mutated site. Finally, we point out that site-specific preference conservation naturally leads to one plausible evolutionary explanation for the existence of intragenic global suppressor mutations.","lang":"eng"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publist_id":"5257","date_updated":"2025-09-29T13:11:19Z","file":[{"relation":"main_file","access_level":"open_access","checksum":"06215318e66be8f3e0c33abb07e9d3da","content_type":"application/pdf","date_updated":"2020-07-14T12:45:19Z","creator":"system","file_id":"5247","file_name":"IST-2016-430-v1+1_Mol_Biol_Evol-2015-Risso-440-55.pdf","date_created":"2018-12-12T10:16:56Z","file_size":1545246}],"intvolume":"        32","external_id":{"isi":["000350050700012"]},"issue":"2","citation":{"chicago":"Risso, Valeria, Fadia Manssour Triedo, Asuncion Delgado Delgado, Rocio Arco, Alicia Barroso Deljesús, Álvaro Inglés Prieto, Raquel Godoy Ruiz, et al. “Mutational Studies on Resurrected Ancestral Proteins Reveal Conservation of Site-Specific Amino Acid Preferences throughout Evolutionary History.” <i>Molecular Biology and Evolution</i>. Oxford University Press, 2014. <a href=\"https://doi.org/10.1093/molbev/msu312\">https://doi.org/10.1093/molbev/msu312</a>.","short":"V. Risso, F. Manssour Triedo, A. Delgado Delgado, R. Arco, A. Barroso Deljesús, Á. Inglés Prieto, R. Godoy Ruiz, J. Gavira, E. Gaucher, B. Ibarra Molero, J. Sánchez Ruiz, Molecular Biology and Evolution 32 (2014) 440–455.","mla":"Risso, Valeria, et al. “Mutational Studies on Resurrected Ancestral Proteins Reveal Conservation of Site-Specific Amino Acid Preferences throughout Evolutionary History.” <i>Molecular Biology and Evolution</i>, vol. 32, no. 2, Oxford University Press, 2014, pp. 440–55, doi:<a href=\"https://doi.org/10.1093/molbev/msu312\">10.1093/molbev/msu312</a>.","ama":"Risso V, Manssour Triedo F, Delgado Delgado A, et al. Mutational studies on resurrected ancestral proteins reveal conservation of site-specific amino acid preferences throughout evolutionary history. <i>Molecular Biology and Evolution</i>. 2014;32(2):440-455. doi:<a href=\"https://doi.org/10.1093/molbev/msu312\">10.1093/molbev/msu312</a>","ista":"Risso V, Manssour Triedo F, Delgado Delgado A, Arco R, Barroso Deljesús A, Inglés Prieto Á, Godoy Ruiz R, Gavira J, Gaucher E, Ibarra Molero B, Sánchez Ruiz J. 2014. Mutational studies on resurrected ancestral proteins reveal conservation of site-specific amino acid preferences throughout evolutionary history. Molecular Biology and Evolution. 32(2), 440–455.","ieee":"V. Risso <i>et al.</i>, “Mutational studies on resurrected ancestral proteins reveal conservation of site-specific amino acid preferences throughout evolutionary history,” <i>Molecular Biology and Evolution</i>, vol. 32, no. 2. Oxford University Press, pp. 440–455, 2014.","apa":"Risso, V., Manssour Triedo, F., Delgado Delgado, A., Arco, R., Barroso Deljesús, A., Inglés Prieto, Á., … Sánchez Ruiz, J. (2014). Mutational studies on resurrected ancestral proteins reveal conservation of site-specific amino acid preferences throughout evolutionary history. <i>Molecular Biology and Evolution</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/molbev/msu312\">https://doi.org/10.1093/molbev/msu312</a>"},"year":"2014","publisher":"Oxford University Press","day":"12","isi":1,"oa_version":"Published Version","_id":"1844","status":"public","doi":"10.1093/molbev/msu312","type":"journal_article","title":"Mutational studies on resurrected ancestral proteins reveal conservation of site-specific amino acid preferences throughout evolutionary history","oa":1,"author":[{"first_name":"Valeria","last_name":"Risso","full_name":"Risso, Valeria"},{"first_name":"Fadia","last_name":"Manssour Triedo","full_name":"Manssour Triedo, Fadia"},{"full_name":"Delgado Delgado, Asuncion","last_name":"Delgado Delgado","first_name":"Asuncion"},{"last_name":"Arco","full_name":"Arco, Rocio","first_name":"Rocio"},{"first_name":"Alicia","last_name":"Barroso Deljesús","full_name":"Barroso Deljesús, Alicia"},{"first_name":"Álvaro","orcid":"0000-0002-5409-8571","last_name":"Inglés Prieto","id":"2A9DB292-F248-11E8-B48F-1D18A9856A87","full_name":"Inglés Prieto, Álvaro"},{"full_name":"Godoy Ruiz, Raquel","last_name":"Godoy Ruiz","first_name":"Raquel"},{"first_name":"Josè","last_name":"Gavira","full_name":"Gavira, Josè"},{"first_name":"Eric","full_name":"Gaucher, Eric","last_name":"Gaucher"},{"last_name":"Ibarra Molero","full_name":"Ibarra Molero, Beatriz","first_name":"Beatriz"},{"first_name":"Jose","last_name":"Sánchez Ruiz","full_name":"Sánchez Ruiz, Jose"}],"publication":"Molecular Biology and Evolution","scopus_import":"1","quality_controlled":"1","date_created":"2018-12-11T11:54:19Z","article_processing_charge":"No","license":"https://creativecommons.org/licenses/by-nc/4.0/","month":"11","department":[{"_id":"HaJa"}],"volume":32,"language":[{"iso":"eng"}],"publication_status":"published","pubrep_id":"430","page":"440 - 455"},{"page":"31 - 50","department":[{"_id":"HeEd"}],"language":[{"iso":"eng"}],"publication_status":"published","pubrep_id":"544","month":"01","date_created":"2018-12-11T12:00:16Z","article_processing_charge":"No","quality_controlled":"1","corr_author":"1","conference":{"location":"Kraków, Poland","name":"ECM: European Congress of Mathematics","end_date":"2012-07-07","start_date":"2012-07-02"},"author":[{"first_name":"Herbert","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner"},{"full_name":"Morozovy, Dmitriy","last_name":"Morozovy","first_name":"Dmitriy"}],"oa":1,"title":"Persistent homology: Theory and practice","doi":"10.4171/120-1/3","type":"conference","_id":"2905","status":"public","oa_version":"Submitted Version","das_tickbox":"1","day":"01","year":"2014","citation":{"chicago":"Edelsbrunner, Herbert, and Dmitriy Morozovy. “Persistent Homology: Theory and Practice,” 31–50. EMS Press, 2014. <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>. EMS Press, 2014, pp. 31–50, doi:<a href=\"https://doi.org/10.4171/120-1/3\">10.4171/120-1/3</a>.","short":"H. Edelsbrunner, D. Morozovy, in:, EMS Press, 2014, pp. 31–50.","ama":"Edelsbrunner H, Morozovy D. Persistent homology: Theory and practice. In: EMS Press; 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.","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: EMS Press. <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."},"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.","publisher":"EMS Press","file":[{"file_id":"5232","date_created":"2018-12-12T10:16:43Z","file_size":435320,"file_name":"IST-2016-544-v1+1_2012-P-11-PHTheoryPractice.pdf","access_level":"open_access","checksum":"1d4a046f1af945c407c5c4d411d4c5e4","relation":"main_file","creator":"system","date_updated":"2020-07-14T12:45:52Z","content_type":"application/pdf"}],"date_updated":"2026-07-06T11:55:48Z","publist_id":"3842","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"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.","lang":"eng"}],"file_date_updated":"2020-07-14T12:45:52Z","ddc":["000"],"date_published":"2014-01-01T00:00:00Z","has_accepted_license":"1","fulldoi":"https://doi.org/10.4171/120-1/3"},{"date_published":"2014-08-23T00:00:00Z","fulldoi":"https://doi.org/10.4171/JEMS/467","publist_id":"5191","date_updated":"2026-07-06T11:56:08Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"We prove a Strichartz inequality for a system of orthonormal functions, with an optimal behavior of the constant in the limit of a large number of functions. The estimate generalizes the usual Strichartz inequality, in the same fashion as the Lieb-Thirring inequality generalizes the Sobolev inequality. As an application, we consider the Schrödinger equation with a time-dependent potential and we show the existence of the wave operator in Schatten spaces."}],"external_id":{"isi":["000345494900006"],"arxiv":["1306.1309"]},"issue":"7","intvolume":"        16","status":"public","_id":"1904","oa_version":"Submitted Version","day":"23","das_tickbox":"1","arxiv":1,"isi":1,"year":"2014","citation":{"apa":"Frank, R., Lewin, M., Lieb, É., &#38; Seiringer, R. (2014). Strichartz inequality for orthonormal functions. <i>Journal of the European Mathematical Society</i>. EMS Press. <a href=\"https://doi.org/10.4171/JEMS/467\">https://doi.org/10.4171/JEMS/467</a>","ieee":"R. Frank, M. Lewin, É. Lieb, and R. Seiringer, “Strichartz inequality for orthonormal functions,” <i>Journal of the European Mathematical Society</i>, vol. 16, no. 7. EMS Press, pp. 1507–1526, 2014.","ista":"Frank R, Lewin M, Lieb É, Seiringer R. 2014. Strichartz inequality for orthonormal functions. Journal of the European Mathematical Society. 16(7), 1507–1526.","ama":"Frank R, Lewin M, Lieb É, Seiringer R. Strichartz inequality for orthonormal functions. <i>Journal of the European Mathematical Society</i>. 2014;16(7):1507-1526. doi:<a href=\"https://doi.org/10.4171/JEMS/467\">10.4171/JEMS/467</a>","mla":"Frank, Rupert, et al. “Strichartz Inequality for Orthonormal Functions.” <i>Journal of the European Mathematical Society</i>, vol. 16, no. 7, EMS Press, 2014, pp. 1507–26, doi:<a href=\"https://doi.org/10.4171/JEMS/467\">10.4171/JEMS/467</a>.","short":"R. Frank, M. Lewin, É. Lieb, R. Seiringer, Journal of the European Mathematical Society 16 (2014) 1507–1526.","chicago":"Frank, Rupert, Mathieu Lewin, Élliott Lieb, and Robert Seiringer. “Strichartz Inequality for Orthonormal Functions.” <i>Journal of the European Mathematical Society</i>. EMS Press, 2014. <a href=\"https://doi.org/10.4171/JEMS/467\">https://doi.org/10.4171/JEMS/467</a>."},"publisher":"EMS Press","title":"Strichartz inequality for orthonormal functions","oa":1,"main_file_link":[{"url":"http://arxiv.org/abs/1306.1309","open_access":"1"}],"doi":"10.4171/JEMS/467","type":"journal_article","scopus_import":"1","publication":"Journal of the European Mathematical Society","author":[{"last_name":"Frank","full_name":"Frank, Rupert","first_name":"Rupert"},{"first_name":"Mathieu","last_name":"Lewin","full_name":"Lewin, Mathieu"},{"first_name":"Élliott","last_name":"Lieb","full_name":"Lieb, Élliott"},{"last_name":"Seiringer","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","full_name":"Seiringer, Robert","first_name":"Robert","orcid":"0000-0002-6781-0521"}],"date_created":"2018-12-11T11:54:38Z","article_processing_charge":"No","project":[{"name":"NSERC Postdoctoral fellowship","_id":"26450934-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","page":"1507 - 1526","volume":16,"language":[{"iso":"eng"}],"department":[{"_id":"RoSe"}],"publication_status":"published","month":"08"},{"oa_version":"Published Version","_id":"2233","status":"public","publisher":"International Federation for Computational Logic","year":"2014","citation":{"apa":"Boker, U., &#38; Henzinger, T. A. (2014). Exact and approximate determinization of discounted-sum automata. <i>Logical Methods in Computer Science</i>. International Federation for Computational Logic. <a href=\"https://doi.org/10.2168/LMCS-10(1:10)2014\">https://doi.org/10.2168/LMCS-10(1:10)2014</a>","ieee":"U. Boker and T. A. Henzinger, “Exact and approximate determinization of discounted-sum automata,” <i>Logical Methods in Computer Science</i>, vol. 10, no. 1. International Federation for Computational Logic, 2014.","ama":"Boker U, Henzinger TA. Exact and approximate determinization of discounted-sum automata. <i>Logical Methods in Computer Science</i>. 2014;10(1). doi:<a href=\"https://doi.org/10.2168/LMCS-10(1:10)2014\">10.2168/LMCS-10(1:10)2014</a>","ista":"Boker U, Henzinger TA. 2014. Exact and approximate determinization of discounted-sum automata. Logical Methods in Computer Science. 10(1).","mla":"Boker, Udi, and Thomas A. Henzinger. “Exact and Approximate Determinization of Discounted-Sum Automata.” <i>Logical Methods in Computer Science</i>, vol. 10, no. 1, International Federation for Computational Logic, 2014, doi:<a href=\"https://doi.org/10.2168/LMCS-10(1:10)2014\">10.2168/LMCS-10(1:10)2014</a>.","short":"U. Boker, T.A. Henzinger, Logical Methods in Computer Science 10 (2014).","chicago":"Boker, Udi, and Thomas A Henzinger. “Exact and Approximate Determinization of Discounted-Sum Automata.” <i>Logical Methods in Computer Science</i>. International Federation for Computational Logic, 2014. <a href=\"https://doi.org/10.2168/LMCS-10(1:10)2014\">https://doi.org/10.2168/LMCS-10(1:10)2014</a>."},"isi":1,"das_tickbox":"1","day":"13","intvolume":"        10","file":[{"content_type":"application/pdf","date_updated":"2020-07-14T12:45:34Z","creator":"system","checksum":"9f6ea2e2d8d4a32ff0becc29d835bbf8","access_level":"open_access","relation":"main_file","file_name":"IST-2015-389-v1+1_1401.3957.pdf","date_created":"2018-12-12T10:07:45Z","file_size":550936,"file_id":"4643"}],"issue":"1","external_id":{"isi":["000333744700015"]},"publist_id":"4728","date_updated":"2026-07-06T13:22:33Z","abstract":[{"text":" A discounted-sum automaton (NDA) is a nondeterministic finite automaton with edge weights, valuing a run by the discounted sum of visited edge weights. More precisely, the weight in the i-th position of the run is divided by λi, where the discount factor λ is a fixed rational number greater than 1. The value of a word is the minimal value of the automaton runs on it. Discounted summation is a common and useful measuring scheme, especially for infinite sequences, reflecting the assumption that earlier weights are more important than later weights. Unfortunately, determinization of NDAs, which is often essential in formal verification, is, in general, not possible. We provide positive news, showing that every NDA with an integral discount factor is determinizable. We complete the picture by proving that the integers characterize exactly the discount factors that guarantee determinizability: for every nonintegral rational discount factor λ, there is a nondeterminizable λ-NDA. We also prove that the class of NDAs with integral discount factors enjoys closure under the algebraic operations min, max, addition, and subtraction, which is not the case for general NDAs nor for deterministic NDAs. For general NDAs, we look into approximate determinization, which is always possible as the influence of a word's suffix decays. We show that the naive approach, of unfolding the automaton computations up to a sufficient level, is doubly exponential in the discount factor. We provide an alternative construction for approximate determinization, which is singly exponential in the discount factor, in the precision, and in the number of states. We also prove matching lower bounds, showing that the exponential dependency on each of these three parameters cannot be avoided. All our results hold equally for automata over finite words and for automata over infinite words. ","lang":"eng"}],"file_date_updated":"2020-07-14T12:45:34Z","ec_funded":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"fulldoi":"https://doi.org/10.2168/LMCS-10(1:10)2014","has_accepted_license":"1","date_published":"2014-02-13T00:00:00Z","ddc":["000"],"pubrep_id":"389","publication_status":"published","volume":10,"language":[{"iso":"eng"}],"department":[{"_id":"ToHe"}],"month":"02","article_processing_charge":"No","date_created":"2018-12-11T11:56:28Z","quality_controlled":"1","project":[{"grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","call_identifier":"FP7"}],"scopus_import":"1","author":[{"last_name":"Boker","full_name":"Boker, Udi","first_name":"Udi"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000−0002−2985−7724","first_name":"Thomas A"}],"publication":"Logical Methods in Computer Science","type":"journal_article","doi":"10.2168/LMCS-10(1:10)2014","title":"Exact and approximate determinization of discounted-sum automata","oa":1,"publication_identifier":{"issn":["1860-5974"]}},{"das_tickbox":"1","day":"14","isi":1,"citation":{"ista":"Brázdil T, Brožek V, Chatterjee K, Forejt V, Kučera A. 2014. Markov decision processes with multiple long-run average objectives. Logical Methods in Computer Science. 10(1).","ama":"Brázdil T, Brožek V, Chatterjee K, Forejt V, Kučera A. Markov decision processes with multiple long-run average objectives. <i>Logical Methods in Computer Science</i>. 2014;10(1). doi:<a href=\"https://doi.org/10.2168/LMCS-10(1:13)2014\">10.2168/LMCS-10(1:13)2014</a>","ieee":"T. Brázdil, V. Brožek, K. Chatterjee, V. Forejt, and A. Kučera, “Markov decision processes with multiple long-run average objectives,” <i>Logical Methods in Computer Science</i>, vol. 10, no. 1. International Federation for Computational Logic, 2014.","apa":"Brázdil, T., Brožek, V., Chatterjee, K., Forejt, V., &#38; Kučera, A. (2014). Markov decision processes with multiple long-run average objectives. <i>Logical Methods in Computer Science</i>. International Federation for Computational Logic. <a href=\"https://doi.org/10.2168/LMCS-10(1:13)2014\">https://doi.org/10.2168/LMCS-10(1:13)2014</a>","chicago":"Brázdil, Tomáš, Václav Brožek, Krishnendu Chatterjee, Vojtěch Forejt, and Antonín Kučera. “Markov Decision Processes with Multiple Long-Run Average Objectives.” <i>Logical Methods in Computer Science</i>. International Federation for Computational Logic, 2014. <a href=\"https://doi.org/10.2168/LMCS-10(1:13)2014\">https://doi.org/10.2168/LMCS-10(1:13)2014</a>.","short":"T. Brázdil, V. Brožek, K. Chatterjee, V. Forejt, A. Kučera, Logical Methods in Computer Science 10 (2014).","mla":"Brázdil, Tomáš, et al. “Markov Decision Processes with Multiple Long-Run Average Objectives.” <i>Logical Methods in Computer Science</i>, vol. 10, no. 1, International Federation for Computational Logic, 2014, doi:<a href=\"https://doi.org/10.2168/LMCS-10(1:13)2014\">10.2168/LMCS-10(1:13)2014</a>."},"year":"2014","publisher":"International Federation for Computational Logic","_id":"2234","status":"public","oa_version":"Published Version","external_id":{"isi":["000333744700001"]},"issue":"1","file":[{"access_level":"open_access","checksum":"803edcc2d8c1acfba44a9ec43a5eb9f0","relation":"main_file","creator":"system","content_type":"application/pdf","date_updated":"2020-07-14T12:45:34Z","file_id":"4656","file_size":375388,"date_created":"2018-12-12T10:07:57Z","file_name":"IST-2016-428-v1+1_1104.3489.pdf"}],"intvolume":"        10","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"We study Markov decision processes (MDPs) with multiple limit-average (or mean-payoff) functions. We consider two different objectives, namely, expectation and satisfaction objectives. Given an MDP with κ limit-average functions, in the expectation objective the goal is to maximize the expected limit-average value, and in the satisfaction objective the goal is to maximize the probability of runs such that the limit-average value stays above a given vector. We show that under the expectation objective, in contrast to the case of one limit-average function, both randomization and memory are necessary for strategies even for ε-approximation, and that finite-memory randomized strategies are sufficient for achieving Pareto optimal values. Under the satisfaction objective, in contrast to the case of one limit-average function, infinite memory is necessary for strategies achieving a specific value (i.e. randomized finite-memory strategies are not sufficient), whereas memoryless randomized strategies are sufficient for ε-approximation, for all ε &gt; 0. We further prove that the decision problems for both expectation and satisfaction objectives can be solved in polynomial time and the trade-off curve (Pareto curve) can be ε-approximated in time polynomial in the size of the MDP and 1/ε, and exponential in the number of limit-average functions, for all ε &gt; 0. Our analysis also reveals flaws in previous work for MDPs with multiple mean-payoff functions under the expectation objective, corrects the flaws, and allows us to obtain improved results.","lang":"eng"}],"ec_funded":1,"file_date_updated":"2020-07-14T12:45:34Z","date_updated":"2026-07-06T13:23:35Z","publist_id":"4727","ddc":["000"],"date_published":"2014-02-14T00:00:00Z","has_accepted_license":"1","fulldoi":"https://doi.org/10.2168/LMCS-10(1:13)2014","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"month":"02","department":[{"_id":"KrCh"}],"language":[{"iso":"eng"}],"volume":10,"publication_status":"published","pubrep_id":"428","project":[{"grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF"},{"call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","grant_number":"S11407"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","date_created":"2018-12-11T11:56:29Z","article_processing_charge":"No","publication":"Logical Methods in Computer Science","author":[{"full_name":"Brázdil, Tomáš","last_name":"Brázdil","first_name":"Tomáš"},{"last_name":"Brožek","full_name":"Brožek, Václav","first_name":"Václav"},{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"},{"first_name":"Vojtěch","full_name":"Forejt, Vojtěch","last_name":"Forejt"},{"first_name":"Antonín","full_name":"Kučera, Antonín","last_name":"Kučera"}],"scopus_import":"1","publication_identifier":{"issn":["1860-5974"]},"oa":1,"title":"Markov decision processes with multiple long-run average objectives","doi":"10.2168/LMCS-10(1:13)2014","type":"journal_article"},{"intvolume":"       800","external_id":{"isi":["000333646000002"]},"oa_version":"None","editor":[{"first_name":"Laurent","last_name":"Nguyen","full_name":"Nguyen, Laurent"}],"status":"public","_id":"2265","year":"2014","citation":{"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>.","short":"S. Hippenmeyer, in:, L. Nguyen (Ed.), Cellular and Molecular Control of Neuronal Migration, Springer, 2014, pp. 1–24.","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>.","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>","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.","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>","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."},"publisher":"Springer","das_tickbox":"1","day":"01","isi":1,"fulldoi":"https://doi.org/10.1007/978-94-007-7687-6_1","date_published":"2014-01-01T00:00:00Z","alternative_title":["Advances in Experimental Medicine and Biology"],"publist_id":"4679","date_updated":"2026-07-07T13:04:40Z","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."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:56:39Z","article_processing_charge":"No","quality_controlled":"1","language":[{"iso":"eng"}],"volume":800,"department":[{"_id":"SiHi"}],"publication_status":"published","page":"1 - 24","month":"01","doi":"10.1007/978-94-007-7687-6_1","type":"book_chapter","title":"Molecular pathways controlling the sequential steps of cortical projection neuron migration","scopus_import":"1","corr_author":"1","author":[{"first_name":"Simon","orcid":"0000-0003-2279-1061","full_name":"Hippenmeyer, Simon","last_name":"Hippenmeyer","id":"37B36620-F248-11E8-B48F-1D18A9856A87"}],"publication":"Cellular and Molecular Control of Neuronal Migration"},{"date_created":"2018-12-11T11:55:17Z","article_processing_charge":"No","quality_controlled":"1","project":[{"name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"267989"},{"grant_number":"24696","name":"Light-regulated ligand traps for spatio-temporal inhibition of cell signaling","_id":"26241A12-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"},{"name":"Moderne Concurrency Paradigms","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S11402-N23"},{"name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S11407"},{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"language":[{"iso":"eng"}],"volume":8837,"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publication_status":"published","page":"98 - 114","month":"11","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1402.2967"}],"doi":"10.1007/978-3-319-11936-6_8","type":"conference","title":"Verification of Markov decision processes using learning algorithms","oa":1,"scopus_import":"1","conference":{"name":"ATVA: Automated Technology for Verification and Analysis","end_date":"2014-11-07","location":"Sydney, Australia","start_date":"2014-11-03"},"author":[{"last_name":"Brázdil","full_name":"Brázdil, Tomáš","first_name":"Tomáš"},{"orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"first_name":"Martin","full_name":"Chmelik, Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87","last_name":"Chmelik"},{"last_name":"Forejt","full_name":"Forejt, Vojtěch","first_name":"Vojtěch"},{"id":"44CEF464-F248-11E8-B48F-1D18A9856A87","last_name":"Kretinsky","full_name":"Kretinsky, Jan","first_name":"Jan","orcid":"0000-0002-8122-2881"},{"first_name":"Marta","last_name":"Kwiatkowska","full_name":"Kwiatkowska, Marta"},{"first_name":"David","last_name":"Parker","full_name":"Parker, David"},{"full_name":"Ujma, Mateusz","last_name":"Ujma","first_name":"Mateusz"}],"publication":"12th International Symposium on Automated Technology for Verification and Analysis","intvolume":"      8837","external_id":{"arxiv":["1402.2967"]},"oa_version":"Submitted Version","status":"public","_id":"2027","acknowledgement":"This research was funded in part by the European Research Council (ERC) under grant agreement 246967 (VERIWARE), by the EU FP7 project HIERATIC, by the Czech Science Foundation grant No P202/12/P612, by EPSRC project EP/K038575/1.","citation":{"chicago":"Brázdil, Tomáš, Krishnendu Chatterjee, Martin Chmelik, Vojtěch Forejt, Jan Kretinsky, Marta Kwiatkowska, David Parker, and Mateusz Ujma. “Verification of Markov Decision Processes Using Learning Algorithms.” In <i>12th International Symposium on Automated Technology for Verification and Analysis</i>, 8837:98–114. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-319-11936-6_8\">https://doi.org/10.1007/978-3-319-11936-6_8</a>.","short":"T. Brázdil, K. Chatterjee, M. Chmelik, V. Forejt, J. Kretinsky, M. Kwiatkowska, D. Parker, M. Ujma, in:, 12th International Symposium on Automated Technology for Verification and Analysis, Springer, 2014, pp. 98–114.","mla":"Brázdil, Tomáš, et al. “Verification of Markov Decision Processes Using Learning Algorithms.” <i>12th International Symposium on Automated Technology for Verification and Analysis</i>, vol. 8837, Springer, 2014, pp. 98–114, doi:<a href=\"https://doi.org/10.1007/978-3-319-11936-6_8\">10.1007/978-3-319-11936-6_8</a>.","ista":"Brázdil T, Chatterjee K, Chmelik M, Forejt V, Kretinsky J, Kwiatkowska M, Parker D, Ujma M. 2014. Verification of Markov decision processes using learning algorithms. 12th International Symposium on Automated Technology for Verification and Analysis. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 8837, 98–114.","ama":"Brázdil T, Chatterjee K, Chmelik M, et al. Verification of Markov decision processes using learning algorithms. In: <i>12th International Symposium on Automated Technology for Verification and Analysis</i>. Vol 8837. Springer; 2014:98-114. doi:<a href=\"https://doi.org/10.1007/978-3-319-11936-6_8\">10.1007/978-3-319-11936-6_8</a>","apa":"Brázdil, T., Chatterjee, K., Chmelik, M., Forejt, V., Kretinsky, J., Kwiatkowska, M., … Ujma, M. (2014). Verification of Markov decision processes using learning algorithms. In <i>12th International Symposium on Automated Technology for Verification and Analysis</i> (Vol. 8837, pp. 98–114). Sydney, Australia: Springer. <a href=\"https://doi.org/10.1007/978-3-319-11936-6_8\">https://doi.org/10.1007/978-3-319-11936-6_8</a>","ieee":"T. Brázdil <i>et al.</i>, “Verification of Markov decision processes using learning algorithms,” in <i>12th International Symposium on Automated Technology for Verification and Analysis</i>, Sydney, Australia, 2014, vol. 8837, pp. 98–114."},"year":"2014","publisher":"Springer","arxiv":1,"das_tickbox":"1","day":"01","fulldoi":"https://doi.org/10.1007/978-3-319-11936-6_8","date_published":"2014-11-01T00:00:00Z","date_updated":"2026-07-07T13:15:34Z","alternative_title":["LNCS"],"publist_id":"5046","ec_funded":1,"abstract":[{"text":"We present a general framework for applying machine-learning algorithms to the verification of Markov decision processes (MDPs). The primary goal of these techniques is to improve performance by avoiding an exhaustive exploration of the state space. Our framework focuses on probabilistic reachability, which is a core property for verification, and is illustrated through two distinct instantiations. The first assumes that full knowledge of the MDP is available, and performs a heuristic-driven partial exploration of the model, yielding precise lower and upper bounds on the required probability. The second tackles the case where we may only sample the MDP, and yields probabilistic guarantees, again in terms of both the lower and upper bounds, which provides efficient stopping criteria for the approximation. The latter is the first extension of statistical model checking for unbounded properties inMDPs. In contrast with other related techniques, our approach is not restricted to time-bounded (finite-horizon) or discounted properties, nor does it assume any particular properties of the MDP. We also show how our methods extend to LTL objectives. We present experimental results showing the performance of our framework on several examples.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"title":"Characterizing spiking in noisy type II neurons","oa":1,"doi":"10.1016/j.jtbi.2014.09.041","type":"journal_article","corr_author":"1","scopus_import":"1","publication":"Journal of Theoretical Biology","author":[{"last_name":"Bodova","id":"2BA24EA0-F248-11E8-B48F-1D18A9856A87","full_name":"Bodova, Katarina","orcid":"0000-0002-7214-0171","first_name":"Katarina"},{"first_name":"David","full_name":"Paydarfar, David","last_name":"Paydarfar"},{"first_name":"Daniel","last_name":"Forger","full_name":"Forger, Daniel"}],"date_created":"2018-12-11T11:55:18Z","article_processing_charge":"No","quality_controlled":"1","related_material":{"link":[{"relation":"erratum","url":"https://doi.org/10.1016/j.jtbi.2015.03.013"}]},"page":"40 - 54","volume":365,"language":[{"iso":"eng"}],"department":[{"_id":"GaTk"}],"pubrep_id":"444","publication_status":"published","month":"10","ddc":["570"],"date_published":"2014-10-12T00:00:00Z","has_accepted_license":"1","fulldoi":"https://doi.org/10.1016/j.jtbi.2014.09.041","tmp":{"image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"publist_id":"5043","date_updated":"2026-07-07T13:13:09Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2020-07-14T12:45:25Z","abstract":[{"lang":"eng","text":"Understanding the dynamics of noisy neurons remains an important challenge in neuroscience. Here, we describe a simple probabilistic model that accurately describes the firing behavior in a large class (type II) of neurons. To demonstrate the usefulness of this model, we show how it accurately predicts the interspike interval (ISI) distributions, bursting patterns and mean firing rates found by: (1) simulations of the classic Hodgkin-Huxley model with channel noise, (2) experimental data from squid giant axon with a noisy input current and (3) experimental data on noisy firing from a neuron within the suprachiasmatic nucleus (SCN). This simple model has 6 parameters, however, in some cases, two of these parameters are coupled and only 5 parameters account for much of the known behavior. From these parameters, many properties of spiking can be found through simple calculation. Thus, we show how the complex effects of noise can be understood through a simple and general probabilistic model."}],"external_id":{"isi":["000347267200005"]},"file":[{"file_name":"IST-2016-444-v1+1_1-s2.0-S0022519314005888-main.pdf","file_size":2679222,"date_created":"2018-12-12T10:17:58Z","file_id":"5316","content_type":"application/pdf","date_updated":"2020-07-14T12:45:25Z","creator":"system","relation":"main_file","checksum":"a9dbae18d3233b3dab6944fd3f2cd49e","access_level":"open_access"}],"intvolume":"       365","_id":"2028","status":"public","oa_version":"Published Version","day":"12","das_tickbox":"1","isi":1,"acknowledgement":"This work is supported by AFOSR grant FA 9550-11-1-0165, program grant RPG 24/2012 from the Human Frontiers of Science (DBF) and travel support from the European Commission Marie Curie International Reintegration Grant PIRG04-GA-2008-239429 (KB). DP was supported by NIHR01 GM104987 and the Wyss Institute of Biologically Inspired Engineering. ","citation":{"apa":"Bodova, K., Paydarfar, D., &#38; Forger, D. (2014). Characterizing spiking in noisy type II neurons. <i>Journal of Theoretical Biology</i>. Academic Press. <a href=\"https://doi.org/10.1016/j.jtbi.2014.09.041\">https://doi.org/10.1016/j.jtbi.2014.09.041</a>","ieee":"K. Bodova, D. Paydarfar, and D. Forger, “Characterizing spiking in noisy type II neurons,” <i>Journal of Theoretical Biology</i>, vol. 365. Academic Press, pp. 40–54, 2014.","ama":"Bodova K, Paydarfar D, Forger D. Characterizing spiking in noisy type II neurons. <i>Journal of Theoretical Biology</i>. 2014;365:40-54. doi:<a href=\"https://doi.org/10.1016/j.jtbi.2014.09.041\">10.1016/j.jtbi.2014.09.041</a>","ista":"Bodova K, Paydarfar D, Forger D. 2014. Characterizing spiking in noisy type II neurons. Journal of Theoretical Biology. 365, 40–54.","mla":"Bodova, Katarina, et al. “Characterizing Spiking in Noisy Type II Neurons.” <i>Journal of Theoretical Biology</i>, vol. 365, Academic Press, 2014, pp. 40–54, doi:<a href=\"https://doi.org/10.1016/j.jtbi.2014.09.041\">10.1016/j.jtbi.2014.09.041</a>.","short":"K. Bodova, D. Paydarfar, D. Forger, Journal of Theoretical Biology 365 (2014) 40–54.","chicago":"Bodova, Katarina, David Paydarfar, and Daniel Forger. “Characterizing Spiking in Noisy Type II Neurons.” <i>Journal of Theoretical Biology</i>. Academic Press, 2014. <a href=\"https://doi.org/10.1016/j.jtbi.2014.09.041\">https://doi.org/10.1016/j.jtbi.2014.09.041</a>."},"year":"2014","publisher":"Academic Press"},{"fulldoi":"https://doi.org/10.15479/AT:IST-2014-170-v1-1","date_published":"2014-02-19T00:00:00Z","has_accepted_license":"1","ddc":["004"],"date_updated":"2026-07-07T14:01:10Z","alternative_title":["IST Austria Technical Report"],"file_date_updated":"2020-07-14T12:46:48Z","abstract":[{"text":"Recently there has been a significant effort to add quantitative properties in formal verification and synthesis. While weighted automata over finite and infinite words provide a natural and flexible framework to express quantitative properties, perhaps surprisingly, several basic system properties such as average response time cannot be expressed with weighted automata. In this work, we introduce nested weighted automata as a new formalism for expressing important quantitative properties such as average response time. We establish an almost complete decidability picture for the basic decision problems for nested weighted automata, and illustrate its applicability in several domains.  ","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"relation":"main_file","checksum":"31f90dcf2cf899c3f8c6427cfcc2b3c7","access_level":"open_access","creator":"system","content_type":"application/pdf","date_updated":"2020-07-14T12:46:48Z","file_id":"5497","file_size":573457,"date_created":"2018-12-12T11:53:36Z","file_name":"IST-2014-170-v1+1_main.pdf"}],"oa_version":"Published Version","status":"public","_id":"5415","publisher":"IST Austria","year":"2014","citation":{"chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. <i>Nested Weighted Automata</i>. IST Austria, 2014. <a href=\"https://doi.org/10.15479/AT:IST-2014-170-v1-1\">https://doi.org/10.15479/AT:IST-2014-170-v1-1</a>.","short":"K. Chatterjee, T.A. Henzinger, J. Otop, Nested Weighted Automata, IST Austria, 2014.","mla":"Chatterjee, Krishnendu, et al. <i>Nested Weighted Automata</i>. IST Austria, 2014, doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-170-v1-1\">10.15479/AT:IST-2014-170-v1-1</a>.","ama":"Chatterjee K, Henzinger TA, Otop J. <i>Nested Weighted Automata</i>. IST Austria; 2014. doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-170-v1-1\">10.15479/AT:IST-2014-170-v1-1</a>","ista":"Chatterjee K, Henzinger TA, Otop J. 2014. Nested weighted automata, IST Austria, 27p.","ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, <i>Nested weighted automata</i>. IST Austria, 2014.","apa":"Chatterjee, K., Henzinger, T. A., &#38; Otop, J. (2014). <i>Nested weighted automata</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2014-170-v1-1\">https://doi.org/10.15479/AT:IST-2014-170-v1-1</a>"},"day":"19","type":"technical_report","doi":"10.15479/AT:IST-2014-170-v1-1","oa":1,"title":"Nested weighted automata","publication_identifier":{"issn":["2664-1690"]},"author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","first_name":"Thomas A"},{"first_name":"Jan","full_name":"Otop, Jan","last_name":"Otop","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87"}],"date_created":"2018-12-12T11:39:12Z","related_material":{"record":[{"status":"public","relation":"later_version","id":"5436"},{"relation":"later_version","id":"1656","status":"public"},{"relation":"later_version","id":"467","status":"public"}]},"publication_status":"published","pubrep_id":"170","language":[{"iso":"eng"}],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"page":"27","month":"02"},{"has_accepted_license":"1","date_published":"2014-09-16T00:00:00Z","ddc":["000","004"],"fulldoi":"https://doi.org/10.1145/2629686","article_type":"original","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"Recently, there has been an effort to add quantitative objectives to formal verification and synthesis. We introduce and investigate the extension of temporal logics with quantitative atomic assertions. At the heart of quantitative objectives lies the accumulation of values along a computation. It is often the accumulated sum, as with energy objectives, or the accumulated average, as with mean-payoff objectives. We investigate the extension of temporal logics with the prefix-accumulation assertions Sum(v) ≥ c and Avg(v) ≥ c, where v is a numeric (or Boolean) variable of the system, c is a constant rational number, and Sum(v) and Avg(v) denote the accumulated sum and average of the values of v from the beginning of the computation up to the current point in time. We also allow the path-accumulation assertions LimInfAvg(v) ≥ c and LimSupAvg(v) ≥ c, referring to the average value along an entire infinite computation. We study the border of decidability for such quantitative extensions of various temporal logics. In particular, we show that extending the fragment of CTL that has only the EX, EF, AX, and AG temporal modalities with both prefix-accumulation assertions, or extending LTL with both path-accumulation assertions, results in temporal logics whose model-checking problem is decidable. Moreover, the prefix-accumulation assertions may be generalized with &quot;controlled accumulation,&quot; allowing, for example, to specify constraints on the average waiting time between a request and a grant. On the negative side, we show that this branching-time logic is, in a sense, the maximal logic with one or both of the prefix-accumulation assertions that permits a decidable model-checking procedure. Extending a temporal logic that has the EG or EU modalities, such as CTL or LTL, makes the problem undecidable.","lang":"eng"}],"ec_funded":1,"file_date_updated":"2020-07-14T12:45:26Z","publist_id":"5013","date_updated":"2026-07-07T14:01:43Z","issue":"4","external_id":{"isi":["000345570700002"]},"intvolume":"        15","file":[{"file_id":"4851","file_size":346184,"date_created":"2018-12-12T10:10:59Z","file_name":"IST-2014-192-v1+1_AccumulativeValues.pdf","relation":"main_file","checksum":"354c41d37500b56320afce94cf9a99c2","access_level":"open_access","creator":"system","content_type":"application/pdf","date_updated":"2020-07-14T12:45:26Z"}],"isi":1,"das_tickbox":"1","day":"16","publisher":"ACM","citation":{"short":"U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, ACM Transactions on Computational Logic 15 (2014).","mla":"Boker, Udi, et al. “Temporal Specifications with Accumulative Values.” <i>ACM Transactions on Computational Logic</i>, vol. 15, no. 4, 27, ACM, 2014, doi:<a href=\"https://doi.org/10.1145/2629686\">10.1145/2629686</a>.","chicago":"Boker, Udi, Krishnendu Chatterjee, Thomas A Henzinger, and Orna Kupferman. “Temporal Specifications with Accumulative Values.” <i>ACM Transactions on Computational Logic</i>. ACM, 2014. <a href=\"https://doi.org/10.1145/2629686\">https://doi.org/10.1145/2629686</a>.","apa":"Boker, U., Chatterjee, K., Henzinger, T. A., &#38; Kupferman, O. (2014). Temporal specifications with accumulative values. <i>ACM Transactions on Computational Logic</i>. ACM. <a href=\"https://doi.org/10.1145/2629686\">https://doi.org/10.1145/2629686</a>","ieee":"U. Boker, K. Chatterjee, T. A. Henzinger, and O. Kupferman, “Temporal specifications with accumulative values,” <i>ACM Transactions on Computational Logic</i>, vol. 15, no. 4. ACM, 2014.","ista":"Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2014. Temporal specifications with accumulative values. ACM Transactions on Computational Logic. 15(4), 27.","ama":"Boker U, Chatterjee K, Henzinger TA, Kupferman O. Temporal specifications with accumulative values. <i>ACM Transactions on Computational Logic</i>. 2014;15(4). doi:<a href=\"https://doi.org/10.1145/2629686\">10.1145/2629686</a>"},"acknowledgement":"The research was supported in part by ERC Starting grant 278410 (QUALITY).","year":"2014","_id":"2038","status":"public","oa_version":"Submitted Version","article_number":"27","title":"Temporal specifications with accumulative values","oa":1,"type":"journal_article","doi":"10.1145/2629686","publication":"ACM Transactions on Computational Logic","author":[{"id":"31E297B6-F248-11E8-B48F-1D18A9856A87","last_name":"Boker","full_name":"Boker, Udi","first_name":"Udi"},{"first_name":"Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","first_name":"Thomas A"},{"first_name":"Orna","full_name":"Kupferman, Orna","last_name":"Kupferman"}],"scopus_import":"1","project":[{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"call_identifier":"FWF","name":"Moderne Concurrency Paradigms","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","call_identifier":"FWF","grant_number":"S11407"},{"name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307"},{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","grant_number":"267989"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"quality_controlled":"1","related_material":{"record":[{"id":"5385","relation":"earlier_version","status":"public"},{"status":"public","relation":"earlier_version","id":"3356"}]},"article_processing_charge":"No","date_created":"2018-12-11T11:55:21Z","month":"09","publication_status":"published","pubrep_id":"192","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"language":[{"iso":"eng"}],"volume":15},{"corr_author":"1","conference":{"start_date":"2014-08-25","name":"MFCS: Mathematical Foundations of Computer Science","end_date":"2014-08-29","location":"Budapest, Hungary"},"scopus_import":"1","author":[{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"}],"title":"Partial-observation stochastic reachability and parity games","oa":1,"doi":"10.1007/978-3-662-44522-8_1","main_file_link":[{"url":"https://doi.org/10.15479/AT:IST-2011-0007","open_access":"1"}],"type":"conference","page":"1 - 4","volume":8634,"language":[{"iso":"eng"}],"department":[{"_id":"KrCh"}],"pubrep_id":"141","publication_status":"published","month":"01","date_created":"2018-12-11T11:54:38Z","article_processing_charge":"No","project":[{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","call_identifier":"FWF"},{"name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"related_material":{"record":[{"status":"public","id":"5381","relation":"earlier_version"},{"status":"public","id":"2211","relation":"later_version"}]},"quality_controlled":"1","publist_id":"5192","date_updated":"2026-07-07T14:01:25Z","alternative_title":["LNCS"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ec_funded":1,"abstract":[{"lang":"eng","text":"We consider two-player zero-sum partial-observation stochastic games on graphs. Based on the information available to the players these games can be classified as follows: (a) general partial-observation (both players have partial view of the game); (b) one-sided partial-observation (one player has partial-observation and the other player has complete-observation); and (c) perfect-observation (both players have complete view of the game). The one-sided partial-observation games subsumes the important special case of one-player partial-observation stochastic games (or partial-observation Markov decision processes (POMDPs)). Based on the randomization available for the strategies, (a) the players may not be allowed to use randomization (pure strategies), or (b) they may choose a probability distribution over actions but the actual random choice is external and not visible to the player (actions invisible), or (c) they may use full randomization. We consider all these classes of games with reachability, and parity objectives that can express all ω-regular objectives. The analysis problems are classified into the qualitative analysis that asks for the existence of a strategy that ensures the objective with probability 1; and the quantitative analysis that asks for the existence of a strategy that ensures the objective with probability at least λ (0,1). In this talk we will cover a wide range of results: for perfect-observation games; for POMDPs; for one-sided partial-observation games; and for general partial-observation games."}],"OA_type":"green","date_published":"2014-01-01T00:00:00Z","fulldoi":"https://doi.org/10.1007/978-3-662-44522-8_1","OA_place":"repository","_id":"1903","status":"public","oa_version":"Preprint","day":"01","citation":{"chicago":"Chatterjee, Krishnendu. “Partial-Observation Stochastic Reachability and Parity Games,” 8634:1–4. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-662-44522-8_1\">https://doi.org/10.1007/978-3-662-44522-8_1</a>.","short":"K. Chatterjee, in:, Springer, 2014, pp. 1–4.","mla":"Chatterjee, Krishnendu. <i>Partial-Observation Stochastic Reachability and Parity Games</i>. Vol. 8634, no. PART 1, Springer, 2014, pp. 1–4, doi:<a href=\"https://doi.org/10.1007/978-3-662-44522-8_1\">10.1007/978-3-662-44522-8_1</a>.","ista":"Chatterjee K. 2014. Partial-observation stochastic reachability and parity games. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 8634, 1–4.","ama":"Chatterjee K. Partial-observation stochastic reachability and parity games. In: Vol 8634. Springer; 2014:1-4. doi:<a href=\"https://doi.org/10.1007/978-3-662-44522-8_1\">10.1007/978-3-662-44522-8_1</a>","apa":"Chatterjee, K. (2014). Partial-observation stochastic reachability and parity games (Vol. 8634, pp. 1–4). Presented at the MFCS: Mathematical Foundations of Computer Science, Budapest, Hungary: Springer. <a href=\"https://doi.org/10.1007/978-3-662-44522-8_1\">https://doi.org/10.1007/978-3-662-44522-8_1</a>","ieee":"K. Chatterjee, “Partial-observation stochastic reachability and parity games,” presented at the MFCS: Mathematical Foundations of Computer Science, Budapest, Hungary, 2014, vol. 8634, no. PART 1, pp. 1–4."},"year":"2014","publisher":"Springer","issue":"PART 1","intvolume":"      8634"}]