[{"author":[{"full_name":"Rodrigues, Jessica A.","last_name":"Rodrigues","first_name":"Jessica A."},{"last_name":"Ruan","first_name":"Randy","full_name":"Ruan, Randy"},{"last_name":"Nishimura","first_name":"Toshiro","full_name":"Nishimura, Toshiro"},{"first_name":"Manoj K.","last_name":"Sharma","full_name":"Sharma, Manoj K."},{"last_name":"Sharma","first_name":"Rita","full_name":"Sharma, Rita"},{"first_name":"Pamela C","last_name":"Ronald","full_name":"Ronald, Pamela C"},{"first_name":"Robert L.","last_name":"Fischer","full_name":"Fischer, Robert L."},{"last_name":"Zilberman","first_name":"Daniel","orcid":"0000-0002-0123-8649","id":"6973db13-dd5f-11ea-814e-b3e5455e9ed1","full_name":"Zilberman, Daniel"}],"oa_version":"Published Version","quality_controlled":"1","article_processing_charge":"No","volume":110,"language":[{"iso":"eng"}],"issue":"19","month":"05","status":"public","publication_identifier":{"eissn":["1091-6490"],"issn":["0027-8424"]},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1073/pnas.1306164110"}],"_id":"9481","type":"journal_article","article_type":"original","date_created":"2021-06-07T07:31:02Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","external_id":{"pmid":["23613580"]},"citation":{"mla":"Rodrigues, Jessica A., et al. “Imprinted Expression of Genes and Small RNA Is Associated with Localized Hypomethylation of the Maternal Genome in Rice Endosperm.” <i>Proceedings of the National Academy of Sciences</i>, vol. 110, no. 19, National Academy of Sciences, 2013, pp. 7934–39, doi:<a href=\"https://doi.org/10.1073/pnas.1306164110\">10.1073/pnas.1306164110</a>.","short":"J.A. Rodrigues, R. Ruan, T. Nishimura, M.K. Sharma, R. Sharma, P.C. Ronald, R.L. Fischer, D. Zilberman, Proceedings of the National Academy of Sciences 110 (2013) 7934–7939.","apa":"Rodrigues, J. A., Ruan, R., Nishimura, T., Sharma, M. K., Sharma, R., Ronald, P. C., … Zilberman, D. (2013). Imprinted expression of genes and small RNA is associated with localized hypomethylation of the maternal genome in rice endosperm. <i>Proceedings of the National Academy of Sciences</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1306164110\">https://doi.org/10.1073/pnas.1306164110</a>","ista":"Rodrigues JA, Ruan R, Nishimura T, Sharma MK, Sharma R, Ronald PC, Fischer RL, Zilberman D. 2013. Imprinted expression of genes and small RNA is associated with localized hypomethylation of the maternal genome in rice endosperm. Proceedings of the National Academy of Sciences. 110(19), 7934–7939.","ama":"Rodrigues JA, Ruan R, Nishimura T, et al. Imprinted expression of genes and small RNA is associated with localized hypomethylation of the maternal genome in rice endosperm. <i>Proceedings of the National Academy of Sciences</i>. 2013;110(19):7934-7939. doi:<a href=\"https://doi.org/10.1073/pnas.1306164110\">10.1073/pnas.1306164110</a>","chicago":"Rodrigues, Jessica A., Randy Ruan, Toshiro Nishimura, Manoj K. Sharma, Rita Sharma, Pamela C Ronald, Robert L. Fischer, and Daniel Zilberman. “Imprinted Expression of Genes and Small RNA Is Associated with Localized Hypomethylation of the Maternal Genome in Rice Endosperm.” <i>Proceedings of the National Academy of Sciences</i>. National Academy of Sciences, 2013. <a href=\"https://doi.org/10.1073/pnas.1306164110\">https://doi.org/10.1073/pnas.1306164110</a>.","ieee":"J. A. Rodrigues <i>et al.</i>, “Imprinted expression of genes and small RNA is associated with localized hypomethylation of the maternal genome in rice endosperm,” <i>Proceedings of the National Academy of Sciences</i>, vol. 110, no. 19. National Academy of Sciences, pp. 7934–7939, 2013."},"date_updated":"2021-12-14T08:26:44Z","extern":"1","department":[{"_id":"DaZi"}],"title":"Imprinted expression of genes and small RNA is associated with localized hypomethylation of the maternal genome in rice endosperm","publisher":"National Academy of Sciences","date_published":"2013-05-07T00:00:00Z","pmid":1,"abstract":[{"text":"Arabidopsis thaliana endosperm, a transient tissue that nourishes the embryo, exhibits extensive localized DNA demethylation on maternally inherited chromosomes. Demethylation mediates parent-of-origin–specific (imprinted) gene expression but is apparently unnecessary for the extensive accumulation of maternally biased small RNA (sRNA) molecules detected in seeds. Endosperm DNA in the distantly related monocots rice and maize is likewise locally hypomethylated, but whether this hypomethylation is generally parent-of-origin specific is unknown. Imprinted expression of sRNA also remains uninvestigated in monocot seeds. Here, we report high-coverage sequencing of the Kitaake rice cultivar that enabled us to show that localized hypomethylation in rice endosperm occurs solely on the maternal genome, preferring regions of high DNA accessibility. Maternally expressed imprinted genes are enriched for hypomethylation at putative promoter regions and transcriptional termini and paternally expressed genes at promoters and gene bodies, mirroring our recent results in A. thaliana. However, unlike in A. thaliana, rice endosperm sRNA populations are dominated by specific strong sRNA-producing loci, and imprinted 24-nt sRNAs are expressed from both parental genomes and correlate with hypomethylation. Overlaps between imprinted sRNA loci and imprinted genes expressed from opposite alleles suggest that sRNAs may regulate genomic imprinting. Whereas sRNAs in seedling tissues primarily originate from small class II (cut-and-paste) transposable elements, those in endosperm are more uniformly derived, including sequences from other transposon classes, as well as genic and intergenic regions. Our data indicate that the endosperm exhibits a unique pattern of sRNA expression and suggest that localized hypomethylation of maternal endosperm DNA is conserved in flowering plants.","lang":"eng"}],"publication_status":"published","page":"7934-7939","day":"07","doi":"10.1073/pnas.1306164110","year":"2013","oa":1,"publication":"Proceedings of the National Academy of Sciences","intvolume":"       110","keyword":["Multidisciplinary"],"scopus_import":"1"},{"citation":{"short":"X. Feng, D. Zilberman, H. Dickinson, Developmental Cell 24 (2013) 215–225.","mla":"Feng, Xiaoqi, et al. “A Conversation across Generations: Soma-Germ Cell Crosstalk in Plants.” <i>Developmental Cell</i>, vol. 24, no. 3, Elsevier, 2013, pp. 215–25, doi:<a href=\"https://doi.org/10.1016/j.devcel.2013.01.014\">10.1016/j.devcel.2013.01.014</a>.","chicago":"Feng, Xiaoqi, Daniel Zilberman, and Hugh Dickinson. “A Conversation across Generations: Soma-Germ Cell Crosstalk in Plants.” <i>Developmental Cell</i>. Elsevier, 2013. <a href=\"https://doi.org/10.1016/j.devcel.2013.01.014\">https://doi.org/10.1016/j.devcel.2013.01.014</a>.","ista":"Feng X, Zilberman D, Dickinson H. 2013. A conversation across generations: Soma-germ cell crosstalk in plants. Developmental Cell. 24(3), 215–225.","ama":"Feng X, Zilberman D, Dickinson H. A conversation across generations: Soma-germ cell crosstalk in plants. <i>Developmental Cell</i>. 2013;24(3):215-225. doi:<a href=\"https://doi.org/10.1016/j.devcel.2013.01.014\">10.1016/j.devcel.2013.01.014</a>","apa":"Feng, X., Zilberman, D., &#38; Dickinson, H. (2013). A conversation across generations: Soma-germ cell crosstalk in plants. <i>Developmental Cell</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.devcel.2013.01.014\">https://doi.org/10.1016/j.devcel.2013.01.014</a>","ieee":"X. Feng, D. Zilberman, and H. Dickinson, “A conversation across generations: Soma-germ cell crosstalk in plants,” <i>Developmental Cell</i>, vol. 24, no. 3. Elsevier, pp. 215–225, 2013."},"department":[{"_id":"DaZi"},{"_id":"XiFe"}],"extern":"1","date_updated":"2023-05-08T11:00:59Z","external_id":{"pmid":["23410937"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","abstract":[{"lang":"eng","text":"Plants undergo alternation of generation in which reproductive cells develop in the plant body (\"sporophytic generation\") and then differentiate into a multicellular gamete-forming \"gametophytic generation.\" Different populations of helper cells assist in this transgenerational journey, with somatic tissues supporting early development and single nurse cells supporting gametogenesis. New data reveal a two-way relationship between early reproductive cells and their helpers involving complex epigenetic and signaling networks determining cell number and fate. Later, the egg cell plays a central role in specifying accessory cells, whereas in both gametophytes, companion cells contribute non-cell-autonomously to the epigenetic landscape of the gamete genomes."}],"title":"A conversation across generations: Soma-germ cell crosstalk in plants","pmid":1,"publisher":"Elsevier","date_published":"2013-02-11T00:00:00Z","oa":1,"day":"11","year":"2013","doi":"10.1016/j.devcel.2013.01.014","page":"215-225","scopus_import":"1","publication":"Developmental Cell","intvolume":"        24","oa_version":"Published Version","quality_controlled":"1","author":[{"id":"e0164712-22ee-11ed-b12a-d80fcdf35958","full_name":"Feng, Xiaoqi","last_name":"Feng","first_name":"Xiaoqi","orcid":"0000-0002-4008-1234"},{"id":"6973db13-dd5f-11ea-814e-b3e5455e9ed1","full_name":"Zilberman, Daniel","first_name":"Daniel","last_name":"Zilberman","orcid":"0000-0002-0123-8649"},{"full_name":"Dickinson, Hugh","first_name":"Hugh","last_name":"Dickinson"}],"issue":"3","month":"02","volume":24,"article_processing_charge":"No","language":[{"iso":"eng"}],"article_type":"review","_id":"9520","type":"journal_article","date_created":"2021-06-08T06:14:50Z","status":"public","main_file_link":[{"url":"https://doi.org/10.1016/j.devcel.2013.01.014","open_access":"1"}],"publication_identifier":{"eissn":["1878-1551"],"issn":["1534-5807"]}},{"author":[{"full_name":"Schlögl, Alois","id":"45BF87EE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5621-8100","first_name":"Alois","last_name":"Schlögl"},{"orcid":"0000-0001-5001-4804","first_name":"Peter M","last_name":"Jonas","full_name":"Jonas, Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Schmidt-Hieber, C.","first_name":"C.","last_name":"Schmidt-Hieber"},{"last_name":"Guzman","first_name":"S. J.","full_name":"Guzman, S. J."}],"oa_version":"Submitted Version","quality_controlled":"1","article_processing_charge":"No","volume":58,"language":[{"iso":"eng"}],"issue":"SI-1-Track-G","article_number":"000010151520134181","file":[{"content_type":"application/pdf","date_updated":"2021-12-01T14:38:08Z","date_created":"2021-12-01T14:38:08Z","file_name":"Schloegl_Abstract-BMT2013.pdf","relation":"main_file","success":1,"creator":"schloegl","file_id":"10397","checksum":"cdfc5339b530a25d6079f7223f0b1f16","file_size":149825,"access_level":"open_access"}],"month":"08","has_accepted_license":"1","publication_identifier":{"eissn":["1862-278X"],"issn":["0013-5585"]},"status":"public","type":"journal_article","_id":"10396","article_type":"original","date_created":"2021-12-01T14:35:35Z","conference":{"name":"BMT: Biomedizinische Technik ","location":"Graz, Austria","end_date":"2013-09-21","start_date":"2013-09-19"},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","external_id":{"pmid":["24042795"]},"citation":{"ieee":"A. Schlögl, P. M. Jonas, C. Schmidt-Hieber, and S. J. Guzman, “Stimfit: A fast visualization and analysis environment for cellular neurophysiology,” <i>Biomedical Engineering / Biomedizinische Technik</i>, vol. 58, no. SI-1-Track-G. De Gruyter, 2013.","chicago":"Schlögl, Alois, Peter M Jonas, C. Schmidt-Hieber, and S. J. Guzman. “Stimfit: A Fast Visualization and Analysis Environment for Cellular Neurophysiology.” <i>Biomedical Engineering / Biomedizinische Technik</i>. De Gruyter, 2013. <a href=\"https://doi.org/10.1515/bmt-2013-4181\">https://doi.org/10.1515/bmt-2013-4181</a>.","ista":"Schlögl A, Jonas PM, Schmidt-Hieber C, Guzman SJ. 2013. Stimfit: A fast visualization and analysis environment for cellular neurophysiology. Biomedical Engineering / Biomedizinische Technik. 58(SI-1-Track-G), 000010151520134181.","ama":"Schlögl A, Jonas PM, Schmidt-Hieber C, Guzman SJ. Stimfit: A fast visualization and analysis environment for cellular neurophysiology. <i>Biomedical Engineering / Biomedizinische Technik</i>. 2013;58(SI-1-Track-G). doi:<a href=\"https://doi.org/10.1515/bmt-2013-4181\">10.1515/bmt-2013-4181</a>","apa":"Schlögl, A., Jonas, P. M., Schmidt-Hieber, C., &#38; Guzman, S. J. (2013). Stimfit: A fast visualization and analysis environment for cellular neurophysiology. <i>Biomedical Engineering / Biomedizinische Technik</i>. Graz, Austria: De Gruyter. <a href=\"https://doi.org/10.1515/bmt-2013-4181\">https://doi.org/10.1515/bmt-2013-4181</a>","mla":"Schlögl, Alois, et al. “Stimfit: A Fast Visualization and Analysis Environment for Cellular Neurophysiology.” <i>Biomedical Engineering / Biomedizinische Technik</i>, vol. 58, no. SI-1-Track-G, 000010151520134181, De Gruyter, 2013, doi:<a href=\"https://doi.org/10.1515/bmt-2013-4181\">10.1515/bmt-2013-4181</a>.","short":"A. Schlögl, P.M. Jonas, C. Schmidt-Hieber, S.J. Guzman, Biomedical Engineering / Biomedizinische Technik 58 (2013)."},"date_updated":"2021-12-02T12:51:12Z","department":[{"_id":"PeJo"}],"title":"Stimfit: A fast visualization and analysis environment for cellular neurophysiology","file_date_updated":"2021-12-01T14:38:08Z","date_published":"2013-08-01T00:00:00Z","publisher":"De Gruyter","pmid":1,"ddc":["005","610"],"abstract":[{"text":"Stimfit is a free cross-platform software package for viewing and analyzing electrophysiological data. It supports most standard file types for cellular neurophysiology and other biomedical formats. Its analysis algorithms have been used and validated in several experimental laboratories. Its embedded Python scripting interface makes Stimfit highly extensible and customizable.","lang":"eng"}],"publication_status":"published","year":"2013","day":"01","doi":"10.1515/bmt-2013-4181","oa":1,"publication":"Biomedical Engineering / Biomedizinische Technik","intvolume":"        58","keyword":["biomedical engineering","data analysis","free software"]},{"status":"public","doi":"10.1371/journal.pone.0080814.s001","year":"2013","day":"12","date_created":"2021-07-28T15:45:07Z","_id":"9749","type":"research_data_reference","related_material":{"record":[{"status":"public","relation":"used_in_publication","id":"2247"}]},"author":[{"full_name":"Zagorsky, Benjamin","first_name":"Benjamin","last_name":"Zagorsky"},{"id":"4A918E98-F248-11E8-B48F-1D18A9856A87","full_name":"Reiter, Johannes","last_name":"Reiter","first_name":"Johannes","orcid":"0000-0002-0170-7353"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"},{"last_name":"Nowak","first_name":"Martin","full_name":"Nowak, Martin"}],"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","date_updated":"2023-02-23T10:34:39Z","department":[{"_id":"KrCh"}],"citation":{"ama":"Zagorsky B, Reiter J, Chatterjee K, Nowak M. Forgiver triumphs in alternating prisoner’s dilemma . 2013. doi:<a href=\"https://doi.org/10.1371/journal.pone.0080814.s001\">10.1371/journal.pone.0080814.s001</a>","chicago":"Zagorsky, Benjamin, Johannes Reiter, Krishnendu Chatterjee, and Martin Nowak. “Forgiver Triumphs in Alternating Prisoner’s Dilemma .” Public Library of Science, 2013. <a href=\"https://doi.org/10.1371/journal.pone.0080814.s001\">https://doi.org/10.1371/journal.pone.0080814.s001</a>.","ista":"Zagorsky B, Reiter J, Chatterjee K, Nowak M. 2013. Forgiver triumphs in alternating prisoner’s dilemma , Public Library of Science, <a href=\"https://doi.org/10.1371/journal.pone.0080814.s001\">10.1371/journal.pone.0080814.s001</a>.","apa":"Zagorsky, B., Reiter, J., Chatterjee, K., &#38; Nowak, M. (2013). Forgiver triumphs in alternating prisoner’s dilemma . Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pone.0080814.s001\">https://doi.org/10.1371/journal.pone.0080814.s001</a>","ieee":"B. Zagorsky, J. Reiter, K. Chatterjee, and M. Nowak, “Forgiver triumphs in alternating prisoner’s dilemma .” Public Library of Science, 2013.","mla":"Zagorsky, Benjamin, et al. <i>Forgiver Triumphs in Alternating Prisoner’s Dilemma </i>. Public Library of Science, 2013, doi:<a href=\"https://doi.org/10.1371/journal.pone.0080814.s001\">10.1371/journal.pone.0080814.s001</a>.","short":"B. Zagorsky, J. Reiter, K. Chatterjee, M. Nowak, (2013)."},"oa_version":"Published Version","date_published":"2013-12-12T00:00:00Z","publisher":"Public Library of Science","article_processing_charge":"No","title":"Forgiver triumphs in alternating prisoner's dilemma ","abstract":[{"lang":"eng","text":"Cooperative behavior, where one individual incurs a cost to help another, is a wide spread phenomenon. Here we study direct reciprocity in the context of the alternating Prisoner's Dilemma. We consider all strategies that can be implemented by one and two-state automata. We calculate the payoff matrix of all pairwise encounters in the presence of noise. We explore deterministic selection dynamics with and without mutation. Using different error rates and payoff values, we observe convergence to a small number of distinct equilibria. Two of them are uncooperative strict Nash equilibria representing always-defect (ALLD) and Grim. The third equilibrium is mixed and represents a cooperative alliance of several strategies, dominated by a strategy which we call Forgiver. Forgiver cooperates whenever the opponent has cooperated; it defects once when the opponent has defected, but subsequently Forgiver attempts to re-establish cooperation even if the opponent has defected again. Forgiver is not an evolutionarily stable strategy, but the alliance, which it rules, is asymptotically stable. For a wide range of parameter values the most commonly observed outcome is convergence to the mixed equilibrium, dominated by Forgiver. Our results show that although forgiving might incur a short-term loss it can lead to a long-term gain. Forgiveness facilitates stable cooperation in the presence of exploitation and noise."}],"month":"12"},{"title":"Data from: Altruism can evolve when relatedness is low: evidence from bacteria committing suicide upon phage infection","article_processing_charge":"No","publisher":"Dryad","date_published":"2013-03-21T00:00:00Z","month":"03","abstract":[{"text":"High relatedness among interacting individuals has generally been considered a precondition for the evolution of altruism. However, kin-selection theory also predicts the evolution of altruism when relatedness is low, as long as the cost of the altruistic act is minor compared to its benefit. Here, we demonstrate evidence for a low-cost altruistic act in bacteria. We investigated Escherichia coli responding to the attack of an obligately lytic phage by committing suicide in order to prevent parasite transmission to nearby relatives. We found that bacterial suicide provides large benefits to survivors at marginal costs to committers. The cost of suicide was low because infected cells are moribund, rapidly dying upon phage infection, such that no more opportunity for reproduction remains. As a consequence of its marginal cost, host suicide was selectively favoured even when relatedness between committers and survivors approached zero. Altogether, our findings demonstrate that low-cost suicide can evolve with ease, represents an effective host-defence strategy, and seems to be widespread among microbes. Moreover, low-cost suicide might also occur in higher organisms as exemplified by infected social insect workers leaving the colony to die in isolation.","lang":"eng"}],"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","author":[{"full_name":"Refardt, Dominik","last_name":"Refardt","first_name":"Dominik"},{"id":"2C471CFA-F248-11E8-B48F-1D18A9856A87","full_name":"Bergmiller, Tobias","last_name":"Bergmiller","first_name":"Tobias","orcid":"0000-0001-5396-4346"},{"full_name":"Kümmerli, Rolf","last_name":"Kümmerli","first_name":"Rolf"}],"citation":{"ista":"Refardt D, Bergmiller T, Kümmerli R. 2013. Data from: Altruism can evolve when relatedness is low: evidence from bacteria committing suicide upon phage infection, Dryad, <a href=\"https://doi.org/10.5061/dryad.b1q2n\">10.5061/dryad.b1q2n</a>.","chicago":"Refardt, Dominik, Tobias Bergmiller, and Rolf Kümmerli. “Data from: Altruism Can Evolve When Relatedness Is Low: Evidence from Bacteria Committing Suicide upon Phage Infection.” Dryad, 2013. <a href=\"https://doi.org/10.5061/dryad.b1q2n\">https://doi.org/10.5061/dryad.b1q2n</a>.","ama":"Refardt D, Bergmiller T, Kümmerli R. Data from: Altruism can evolve when relatedness is low: evidence from bacteria committing suicide upon phage infection. 2013. doi:<a href=\"https://doi.org/10.5061/dryad.b1q2n\">10.5061/dryad.b1q2n</a>","apa":"Refardt, D., Bergmiller, T., &#38; Kümmerli, R. (2013). Data from: Altruism can evolve when relatedness is low: evidence from bacteria committing suicide upon phage infection. Dryad. <a href=\"https://doi.org/10.5061/dryad.b1q2n\">https://doi.org/10.5061/dryad.b1q2n</a>","ieee":"D. Refardt, T. Bergmiller, and R. Kümmerli, “Data from: Altruism can evolve when relatedness is low: evidence from bacteria committing suicide upon phage infection.” Dryad, 2013.","mla":"Refardt, Dominik, et al. <i>Data from: Altruism Can Evolve When Relatedness Is Low: Evidence from Bacteria Committing Suicide upon Phage Infection</i>. Dryad, 2013, doi:<a href=\"https://doi.org/10.5061/dryad.b1q2n\">10.5061/dryad.b1q2n</a>.","short":"D. Refardt, T. Bergmiller, R. Kümmerli, (2013)."},"oa_version":"Published Version","department":[{"_id":"CaGu"}],"date_updated":"2023-10-18T06:43:22Z","related_material":{"record":[{"status":"public","relation":"used_in_publication","id":"2853"}]},"year":"2013","day":"21","doi":"10.5061/dryad.b1q2n","status":"public","main_file_link":[{"open_access":"1","url":"https://doi.org/10.5061/dryad.b1q2n"}],"type":"research_data_reference","_id":"9751","oa":1,"date_created":"2021-07-30T08:08:09Z"},{"author":[{"full_name":"Hearn, Jack","last_name":"Hearn","first_name":"Jack"},{"full_name":"Stone, Graham","first_name":"Graham","last_name":"Stone"},{"orcid":"0000-0002-8548-5240","first_name":"Nicholas H","last_name":"Barton","full_name":"Barton, Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Lohse, Konrad","first_name":"Konrad","last_name":"Lohse"},{"last_name":"Bunnefeld","first_name":"Lynsey","full_name":"Bunnefeld, Lynsey"}],"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","department":[{"_id":"NiBa"}],"date_updated":"2023-02-23T10:31:17Z","oa_version":"Published Version","citation":{"mla":"Hearn, Jack, et al. <i>Data from: Likelihood-Based Inference of Population History from Low Coverage de Novo Genome Assemblies</i>. Dryad, 2013, doi:<a href=\"https://doi.org/10.5061/dryad.r3r60\">10.5061/dryad.r3r60</a>.","short":"J. Hearn, G. Stone, N.H. Barton, K. Lohse, L. Bunnefeld, (2013).","ama":"Hearn J, Stone G, Barton NH, Lohse K, Bunnefeld L. Data from: Likelihood-based inference of population history from low coverage de novo genome assemblies. 2013. doi:<a href=\"https://doi.org/10.5061/dryad.r3r60\">10.5061/dryad.r3r60</a>","chicago":"Hearn, Jack, Graham Stone, Nicholas H Barton, Konrad Lohse, and Lynsey Bunnefeld. “Data from: Likelihood-Based Inference of Population History from Low Coverage de Novo Genome Assemblies.” Dryad, 2013. <a href=\"https://doi.org/10.5061/dryad.r3r60\">https://doi.org/10.5061/dryad.r3r60</a>.","ista":"Hearn J, Stone G, Barton NH, Lohse K, Bunnefeld L. 2013. Data from: Likelihood-based inference of population history from low coverage de novo genome assemblies, Dryad, <a href=\"https://doi.org/10.5061/dryad.r3r60\">10.5061/dryad.r3r60</a>.","apa":"Hearn, J., Stone, G., Barton, N. H., Lohse, K., &#38; Bunnefeld, L. (2013). Data from: Likelihood-based inference of population history from low coverage de novo genome assemblies. Dryad. <a href=\"https://doi.org/10.5061/dryad.r3r60\">https://doi.org/10.5061/dryad.r3r60</a>","ieee":"J. Hearn, G. Stone, N. H. Barton, K. Lohse, and L. Bunnefeld, “Data from: Likelihood-based inference of population history from low coverage de novo genome assemblies.” Dryad, 2013."},"date_published":"2013-10-01T00:00:00Z","publisher":"Dryad","title":"Data from: Likelihood-based inference of population history from low coverage de novo genome assemblies","article_processing_charge":"No","month":"10","abstract":[{"lang":"eng","text":"Short-read sequencing technologies have in principle made it feasible to draw detailed inferences about the recent history of any organism. In practice, however, this remains challenging due to the difficulty of genome assembly in most organisms and the lack of statistical methods powerful enough to discriminate among recent, non-equilibrium histories. We address both the assembly and inference challenges. We develop a bioinformatic pipeline for generating outgroup-rooted alignments of orthologous sequence blocks from de novo low-coverage short-read data for a small number of genomes, and show how such sequence blocks can be used to fit explicit models of population divergence and admixture in a likelihood framework. To illustrate our approach, we reconstruct the Pleistocene history of an oak-feeding insect (the oak gallwasp Biorhiza pallida) which, in common with many other taxa, was restricted during Pleistocene ice ages to a longitudinal series of southern refugia spanning theWestern Palaearctic. Our analysis of sequence blocks sampled from a single genome from each of three major glacial refugia reveals support for an unexpected history dominated by recent admixture. Despite the fact that 80% of the genome is affected by admixture during the last glacial cycle, we are able to infer the deeper divergence history of these populations. These inferences are robust to variation in block length, mutation model, and the sampling location of individual genomes within refugia. This combination of de novo assembly and numerical likelihood calculation provides a powerful framework for estimating recent population history that can be applied to any organism without the need for prior genetic resources."}],"main_file_link":[{"url":"https://doi.org/10.5061/dryad.r3r60","open_access":"1"}],"doi":"10.5061/dryad.r3r60","status":"public","year":"2013","day":"01","date_created":"2021-07-30T08:31:22Z","oa":1,"type":"research_data_reference","_id":"9754","related_material":{"record":[{"status":"public","relation":"used_in_publication","id":"2170"}]}},{"oa":1,"day":"07","doi":"10.1098/rspb.2012.2058","year":"2013","intvolume":"       280","publist_id":"7372","publication":"Proceedings of the Royal Society of London Series B Biological Sciences","date_updated":"2021-01-12T07:57:25Z","department":[{"_id":"NiBa"}],"citation":{"short":"M. Pickup, D. Field, D. Rowell, A. Young, Proceedings of the Royal Society of London Series B Biological Sciences 280 (2013).","mla":"Pickup, Melinda, et al. “Source Population Characteristics Affect Heterosis Following Genetic Rescue of Fragmented Plant Populations.” <i>Proceedings of the Royal Society of London Series B Biological Sciences</i>, vol. 280, no. 1750, 2058, Royal Society, The, 2013, doi:<a href=\"https://doi.org/10.1098/rspb.2012.2058\">10.1098/rspb.2012.2058</a>.","ieee":"M. Pickup, D. Field, D. Rowell, and A. Young, “Source population characteristics affect heterosis following genetic rescue of fragmented plant populations,” <i>Proceedings of the Royal Society of London Series B Biological Sciences</i>, vol. 280, no. 1750. Royal Society, The, 2013.","ista":"Pickup M, Field D, Rowell D, Young A. 2013. Source population characteristics affect heterosis following genetic rescue of fragmented plant populations. Proceedings of the Royal Society of London Series B Biological Sciences. 280(1750), 2058.","ama":"Pickup M, Field D, Rowell D, Young A. Source population characteristics affect heterosis following genetic rescue of fragmented plant populations. <i>Proceedings of the Royal Society of London Series B Biological Sciences</i>. 2013;280(1750). doi:<a href=\"https://doi.org/10.1098/rspb.2012.2058\">10.1098/rspb.2012.2058</a>","chicago":"Pickup, Melinda, David Field, David Rowell, and Andrew Young. “Source Population Characteristics Affect Heterosis Following Genetic Rescue of Fragmented Plant Populations.” <i>Proceedings of the Royal Society of London Series B Biological Sciences</i>. Royal Society, The, 2013. <a href=\"https://doi.org/10.1098/rspb.2012.2058\">https://doi.org/10.1098/rspb.2012.2058</a>.","apa":"Pickup, M., Field, D., Rowell, D., &#38; Young, A. (2013). Source population characteristics affect heterosis following genetic rescue of fragmented plant populations. <i>Proceedings of the Royal Society of London Series B Biological Sciences</i>. Royal Society, The. <a href=\"https://doi.org/10.1098/rspb.2012.2058\">https://doi.org/10.1098/rspb.2012.2058</a>"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"pmid":["23173202"]},"abstract":[{"text":"Understanding the relative importance of heterosis and outbreeding depression over multiple generations is a key question in evolutionary biology and is essential for identifying appropriate genetic sources for population and ecosystem restoration. Here we use 2455 experimental crosses between 12 population pairs of the rare perennial plant Rutidosis leptorrhynchoides (Asteraceae) to investigate the multi-generational (F1, F2, F3) fitness outcomes of inter-population hybridization. We detected no evidence of outbreeding depression, with inter-population hybrids and backcrosses showing either similar fitness or significant heterosis for fitness components across the three generations. Variation in heterosis among population pairs was best explained by characteristics of the foreign source or home population, and was greatest when the source population was large, with high genetic diversity and low inbreeding, and the home population was small and inbred. Our results indicate that the primary consideration for maximizing progeny fitness following population augmentation or restoration is the use of seed from large, genetically diverse populations.","lang":"eng"}],"publication_status":"published","date_published":"2013-01-07T00:00:00Z","publisher":"Royal Society, The","pmid":1,"title":"Source population characteristics affect heterosis following genetic rescue of fragmented plant populations","date_created":"2018-12-11T11:46:32Z","_id":"450","type":"journal_article","status":"public","main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3574427/","open_access":"1"}],"quality_controlled":"1","oa_version":"Submitted Version","author":[{"orcid":"0000-0001-6118-0541","last_name":"Pickup","first_name":"Melinda","full_name":"Pickup, Melinda","id":"2C78037E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Field","first_name":"David","orcid":"0000-0002-4014-8478","id":"419049E2-F248-11E8-B48F-1D18A9856A87","full_name":"Field, David"},{"first_name":"David","last_name":"Rowell","full_name":"Rowell, David"},{"first_name":"Andrew","last_name":"Young","full_name":"Young, Andrew"}],"month":"01","issue":"1750","article_number":"2058","language":[{"iso":"eng"}],"volume":280},{"volume":18,"language":[{"iso":"eng"}],"file":[{"checksum":"d4d644ed1a885dbfc4fa1ef4c5724dab","file_id":"5040","creator":"system","access_level":"open_access","file_size":519040,"relation":"main_file","file_name":"IST-2016-525-v1+1_42_1_.pdf","content_type":"application/pdf","date_created":"2018-12-12T10:13:53Z","date_updated":"2020-07-14T12:45:45Z"}],"month":"12","has_accepted_license":"1","author":[{"first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"full_name":"Joglekar, Manas","first_name":"Manas","last_name":"Joglekar"},{"full_name":"Shah, Nisarg","first_name":"Nisarg","last_name":"Shah"}],"oa_version":"Published Version","quality_controlled":"1","project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","call_identifier":"FWF"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","name":"Game Theory","call_identifier":"FWF"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"conference":{"start_date":"2012-12-15","end_date":"2012-12-17","name":"FSTTCS: Foundations of Software Technology and Theoretical Computer Science","location":"Hyderabad, India"},"ec_funded":1,"pubrep_id":"525","status":"public","type":"conference","_id":"2715","date_created":"2018-12-11T11:59:13Z","title":"Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives","file_date_updated":"2020-07-14T12:45:45Z","date_published":"2012-12-10T00:00:00Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","ddc":["000"],"publication_status":"published","abstract":[{"text":"We consider Markov decision processes (MDPs) with specifications given as Büchi (liveness) objectives. We consider the problem of computing the set of almost-sure winning vertices from where the objective can be ensured with probability 1. We study for the first time the average case complexity of the classical algorithm for computing the set of almost-sure winning vertices for MDPs with Büchi objectives. Our contributions are as follows: First, we show that for MDPs with constant out-degree the expected number of iterations is at most logarithmic and the average case running time is linear (as compared to the worst case linear number of iterations and quadratic time complexity). Second, for the average case analysis over all MDPs we show that the expected number of iterations is constant and the average case running time is linear (again as compared to the worst case linear number of iterations and quadratic time complexity). Finally we also show that given that all MDPs are equally likely, the probability that the classical algorithm requires more than constant number of iterations is exponentially small.","lang":"eng"}],"alternative_title":["LIPIcs"],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","short":"CC BY-NC-ND (4.0)"},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"short":"K. Chatterjee, M. Joglekar, N. Shah, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012, pp. 461–473.","mla":"Chatterjee, Krishnendu, et al. <i>Average Case Analysis of the Classical Algorithm for Markov Decision Processes with Büchi Objectives</i>. Vol. 18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012, pp. 461–73, doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2012.461\">10.4230/LIPIcs.FSTTCS.2012.461</a>.","apa":"Chatterjee, K., Joglekar, M., &#38; Shah, N. (2012). Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives (Vol. 18, pp. 461–473). Presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Hyderabad, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2012.461\">https://doi.org/10.4230/LIPIcs.FSTTCS.2012.461</a>","ama":"Chatterjee K, Joglekar M, Shah N. Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives. In: Vol 18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2012:461-473. doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2012.461\">10.4230/LIPIcs.FSTTCS.2012.461</a>","chicago":"Chatterjee, Krishnendu, Manas Joglekar, and Nisarg Shah. “Average Case Analysis of the Classical Algorithm for Markov Decision Processes with Büchi Objectives,” 18:461–73. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012. <a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2012.461\">https://doi.org/10.4230/LIPIcs.FSTTCS.2012.461</a>.","ista":"Chatterjee K, Joglekar M, Shah N. 2012. Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 18, 461–473.","ieee":"K. Chatterjee, M. Joglekar, and N. Shah, “Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives,” presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Hyderabad, India, 2012, vol. 18, pp. 461–473."},"department":[{"_id":"KrCh"}],"date_updated":"2023-02-23T10:06:04Z","publist_id":"4180","intvolume":"        18","scopus_import":1,"related_material":{"record":[{"status":"public","relation":"later_version","id":"1598"}]},"page":"461 - 473","year":"2012","doi":"10.4230/LIPIcs.FSTTCS.2012.461","day":"10","oa":1},{"scopus_import":1,"publist_id":"3975","conference":{"name":"NIPS: Neural Information Processing Systems","location":"Lake Tahoe, NV, United States","end_date":"2012-12-06","start_date":"2012-12-03"},"intvolume":"         1","date_created":"2018-12-11T11:59:48Z","_id":"2825","type":"conference","page":"82 - 90","day":"01","year":"2012","status":"public","publication_status":"published","month":"12","abstract":[{"lang":"eng","text":"We study the problem of maximum marginal prediction (MMP) in probabilistic graphical models, a task that occurs, for example, as the Bayes optimal decision rule under a Hamming loss. MMP is typically performed as a two-stage procedure: one estimates each variable's marginal probability and then forms a prediction from the states of maximal probability. In this work we propose a simple yet effective technique for accelerating MMP when inference is sampling-based: instead of the above two-stage procedure we directly estimate the posterior probability of each decision variable. This allows us to identify the point of time when we are sufficiently certain about any individual decision. Whenever this is the case, we dynamically prune the variables we are confident about from the underlying factor graph. Consequently, at any time only samples of variables whose decision is still uncertain need to be created. Experiments in two prototypical scenarios, multi-label classification and image inpainting, show that adaptive sampling can drastically accelerate MMP without sacrificing prediction accuracy."}],"language":[{"iso":"eng"}],"date_published":"2012-12-01T00:00:00Z","publisher":"Neural Information Processing Systems","title":"Dynamic pruning of factor graphs for maximum marginal prediction","volume":1,"department":[{"_id":"ChLa"}],"quality_controlled":"1","date_updated":"2021-01-12T06:59:59Z","citation":{"ieee":"C. Lampert, “Dynamic pruning of factor graphs for maximum marginal prediction,” presented at the NIPS: Neural Information Processing Systems, Lake Tahoe, NV, United States, 2012, vol. 1, pp. 82–90.","ista":"Lampert C. 2012. Dynamic pruning of factor graphs for maximum marginal prediction. NIPS: Neural Information Processing Systems vol. 1, 82–90.","chicago":"Lampert, Christoph. “Dynamic Pruning of Factor Graphs for Maximum Marginal Prediction,” 1:82–90. Neural Information Processing Systems, 2012.","ama":"Lampert C. Dynamic pruning of factor graphs for maximum marginal prediction. In: Vol 1. Neural Information Processing Systems; 2012:82-90.","apa":"Lampert, C. (2012). Dynamic pruning of factor graphs for maximum marginal prediction (Vol. 1, pp. 82–90). Presented at the NIPS: Neural Information Processing Systems, Lake Tahoe, NV, United States: Neural Information Processing Systems.","mla":"Lampert, Christoph. <i>Dynamic Pruning of Factor Graphs for Maximum Marginal Prediction</i>. Vol. 1, Neural Information Processing Systems, 2012, pp. 82–90.","short":"C. Lampert, in:, Neural Information Processing Systems, 2012, pp. 82–90."},"oa_version":"None","author":[{"full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","first_name":"Christoph","last_name":"Lampert"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87"},{"_id":"2848","type":"journal_article","date_created":"2018-12-11T11:59:55Z","status":"public","main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3322297/"}],"ec_funded":1,"oa_version":"Submitted Version","quality_controlled":"1","project":[{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","call_identifier":"FWF"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu"},{"last_name":"Zufferey","first_name":"Damien","orcid":"0000-0002-3197-8736","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","full_name":"Zufferey, Damien"},{"full_name":"Nowak, Martin","first_name":"Martin","last_name":"Nowak"}],"month":"05","volume":301,"language":[{"iso":"eng"}],"oa":1,"doi":"10.1016/j.jtbi.2012.02.021","day":"21","page":"161 - 173","year":"2012","scopus_import":1,"publication":"Journal of Theoretical Biology","intvolume":"       301","publist_id":"3946","citation":{"short":"K. Chatterjee, D. Zufferey, M. Nowak, Journal of Theoretical Biology 301 (2012) 161–173.","mla":"Chatterjee, Krishnendu, et al. “Evolutionary Game Dynamics in Populations with Different Learners.” <i>Journal of Theoretical Biology</i>, vol. 301, Elsevier, 2012, pp. 161–73, doi:<a href=\"https://doi.org/10.1016/j.jtbi.2012.02.021\">10.1016/j.jtbi.2012.02.021</a>.","apa":"Chatterjee, K., Zufferey, D., &#38; Nowak, M. (2012). Evolutionary game dynamics in populations with different learners. <i>Journal of Theoretical Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jtbi.2012.02.021\">https://doi.org/10.1016/j.jtbi.2012.02.021</a>","ama":"Chatterjee K, Zufferey D, Nowak M. Evolutionary game dynamics in populations with different learners. <i>Journal of Theoretical Biology</i>. 2012;301:161-173. doi:<a href=\"https://doi.org/10.1016/j.jtbi.2012.02.021\">10.1016/j.jtbi.2012.02.021</a>","chicago":"Chatterjee, Krishnendu, Damien Zufferey, and Martin Nowak. “Evolutionary Game Dynamics in Populations with Different Learners.” <i>Journal of Theoretical Biology</i>. Elsevier, 2012. <a href=\"https://doi.org/10.1016/j.jtbi.2012.02.021\">https://doi.org/10.1016/j.jtbi.2012.02.021</a>.","ista":"Chatterjee K, Zufferey D, Nowak M. 2012. Evolutionary game dynamics in populations with different learners. Journal of Theoretical Biology. 301, 161–173.","ieee":"K. Chatterjee, D. Zufferey, and M. Nowak, “Evolutionary game dynamics in populations with different learners,” <i>Journal of Theoretical Biology</i>, vol. 301. Elsevier, pp. 161–173, 2012."},"date_updated":"2021-01-12T07:00:12Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","external_id":{"pmid":["22394652"]},"abstract":[{"text":"We study evolutionary game theory in a setting where individuals learn from each other. We extend the traditional approach by assuming that a population contains individuals with different learning abilities. In particular, we explore the situation where individuals have different search spaces, when attempting to learn the strategies of others. The search space of an individual specifies the set of strategies learnable by that individual. The search space is genetically given and does not change under social evolutionary dynamics. We introduce a general framework and study a specific example in the context of direct reciprocity. For this example, we obtain the counter intuitive result that cooperation can only evolve for intermediate benefit-to-cost ratios, while small and large benefit-to-cost ratios favor defection. Our paper is a step toward making a connection between computational learning theory and evolutionary game dynamics.","lang":"eng"}],"publication_status":"published","title":"Evolutionary game dynamics in populations with different learners","publisher":"Elsevier","date_published":"2012-05-21T00:00:00Z","pmid":1},{"author":[{"orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","first_name":"Herbert","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Strelkova, Nataliya","first_name":"Nataliya","last_name":"Strelkova"}],"oa_version":"Submitted Version","quality_controlled":"1","volume":67,"language":[{"iso":"eng"}],"file":[{"file_name":"IST-2016-546-v1+1_2014-J-05-SteinerMinTrees.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:45:51Z","date_created":"2018-12-12T10:14:26Z","creator":"system","checksum":"44ee8d173487e8ed41a51136816bbeb4","file_id":"5078","file_size":392021,"access_level":"open_access","relation":"main_file"}],"issue":"6","has_accepted_license":"1","month":"01","status":"public","type":"journal_article","_id":"2849","date_created":"2018-12-11T11:59:55Z","pubrep_id":"546","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"H. Edelsbrunner and N. Strelkova, “On the configuration space of Steiner minimal trees,” <i>Russian Mathematical Surveys</i>, vol. 67, no. 6. IOP Publishing Ltd., pp. 1167–1168, 2012.","apa":"Edelsbrunner, H., &#38; Strelkova, N. (2012). On the configuration space of Steiner minimal trees. <i>Russian Mathematical Surveys</i>. IOP Publishing Ltd. <a href=\"https://doi.org/10.1070/RM2012v067n06ABEH004820\">https://doi.org/10.1070/RM2012v067n06ABEH004820</a>","ista":"Edelsbrunner H, Strelkova N. 2012. On the configuration space of Steiner minimal trees. Russian Mathematical Surveys. 67(6), 1167–1168.","ama":"Edelsbrunner H, Strelkova N. On the configuration space of Steiner minimal trees. <i>Russian Mathematical Surveys</i>. 2012;67(6):1167-1168. doi:<a href=\"https://doi.org/10.1070/RM2012v067n06ABEH004820\">10.1070/RM2012v067n06ABEH004820</a>","chicago":"Edelsbrunner, Herbert, and Nataliya Strelkova. “On the Configuration Space of Steiner Minimal Trees.” <i>Russian Mathematical Surveys</i>. IOP Publishing Ltd., 2012. <a href=\"https://doi.org/10.1070/RM2012v067n06ABEH004820\">https://doi.org/10.1070/RM2012v067n06ABEH004820</a>.","short":"H. Edelsbrunner, N. Strelkova, Russian Mathematical Surveys 67 (2012) 1167–1168.","mla":"Edelsbrunner, Herbert, and Nataliya Strelkova. “On the Configuration Space of Steiner Minimal Trees.” <i>Russian Mathematical Surveys</i>, vol. 67, no. 6, IOP Publishing Ltd., 2012, pp. 1167–68, doi:<a href=\"https://doi.org/10.1070/RM2012v067n06ABEH004820\">10.1070/RM2012v067n06ABEH004820</a>."},"department":[{"_id":"HeEd"}],"date_updated":"2021-01-12T07:00:13Z","title":"On the configuration space of Steiner minimal trees","publisher":"IOP Publishing Ltd.","file_date_updated":"2020-07-14T12:45:51Z","date_published":"2012-01-01T00:00:00Z","ddc":["000"],"publication_status":"published","year":"2012","day":"01","doi":"10.1070/RM2012v067n06ABEH004820","page":"1167 - 1168","oa":1,"publication":"Russian Mathematical Surveys","publist_id":"3943","intvolume":"        67","scopus_import":1},{"status":"public","_id":"2888","type":"conference","date_created":"2018-12-11T12:00:09Z","ec_funded":1,"conference":{"end_date":"2012-10-05","start_date":"2012-09-30","location":"Innsbruck, Austria","name":"MODELS: Model-driven Engineering Languages and Systems"},"author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724"}],"oa_version":"None","quality_controlled":"1","project":[{"name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","call_identifier":"FP7"},{"call_identifier":"FWF","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering"}],"volume":7590,"language":[{"iso":"eng"}],"month":"09","day":"01","doi":"10.1007/978-3-642-33666-9_1","page":"1 - 2","year":"2012","publication":"Conference proceedings MODELS 2012","intvolume":"      7590","publist_id":"3870","scopus_import":1,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","alternative_title":["LNCS"],"citation":{"short":"T.A. Henzinger, in:, Conference Proceedings MODELS 2012, Springer, 2012, pp. 1–2.","mla":"Henzinger, Thomas A. “Quantitative Reactive Models.” <i>Conference Proceedings MODELS 2012</i>, vol. 7590, Springer, 2012, pp. 1–2, doi:<a href=\"https://doi.org/10.1007/978-3-642-33666-9_1\">10.1007/978-3-642-33666-9_1</a>.","ieee":"T. A. Henzinger, “Quantitative reactive models,” in <i>Conference proceedings MODELS 2012</i>, Innsbruck, Austria, 2012, vol. 7590, pp. 1–2.","apa":"Henzinger, T. A. (2012). Quantitative reactive models. In <i>Conference proceedings MODELS 2012</i> (Vol. 7590, pp. 1–2). Innsbruck, Austria: Springer. <a href=\"https://doi.org/10.1007/978-3-642-33666-9_1\">https://doi.org/10.1007/978-3-642-33666-9_1</a>","chicago":"Henzinger, Thomas A. “Quantitative Reactive Models.” In <i>Conference Proceedings MODELS 2012</i>, 7590:1–2. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-33666-9_1\">https://doi.org/10.1007/978-3-642-33666-9_1</a>.","ista":"Henzinger TA. 2012. Quantitative reactive models. Conference proceedings MODELS 2012. MODELS: Model-driven Engineering Languages and Systems, LNCS, vol. 7590, 1–2.","ama":"Henzinger TA. Quantitative reactive models. In: <i>Conference Proceedings MODELS 2012</i>. Vol 7590. Springer; 2012:1-2. doi:<a href=\"https://doi.org/10.1007/978-3-642-33666-9_1\">10.1007/978-3-642-33666-9_1</a>"},"date_updated":"2021-01-12T07:00:29Z","department":[{"_id":"ToHe"}],"title":"Quantitative reactive models","date_published":"2012-09-01T00:00:00Z","publisher":"Springer","abstract":[{"text":"Formal verification aims to improve the quality of hardware and software by detecting errors before they do harm. At the basis of formal verification lies the logical notion of correctness, which purports to capture whether or not a circuit or program behaves as desired. We suggest that the boolean partition into correct and incorrect systems falls short of the practical need to assess the behavior of hardware and software in a more nuanced fashion against multiple criteria.","lang":"eng"}],"publication_status":"published"},{"scopus_import":1,"ec_funded":1,"conference":{"location":"Tampere, Finland","name":"EMSOFT: Embedded Software ","start_date":"2012-10-07","end_date":"2012-10-12"},"publist_id":"3868","publication":"Proceedings of the tenth ACM international conference on Embedded software","date_created":"2018-12-11T12:00:10Z","_id":"2890","type":"conference","status":"public","doi":"10.1145/2380356.2380371","year":"2012","day":"01","page":"53 - 62","abstract":[{"text":"Systems are often specified using multiple requirements on their behavior. In practice, these requirements can be contradictory. The classical approach to specification, verification, and synthesis demands more detailed specifications that resolve any contradictions in the requirements. These detailed specifications are usually large, cumbersome, and hard to maintain or modify. In contrast, quantitative frameworks allow the formalization of the intuitive idea that what is desired is an implementation that comes &quot;closest&quot; to satisfying the mutually incompatible requirements, according to a measure of fit that can be defined by the requirements engineer. One flexible framework for quantifying how &quot;well&quot; an implementation satisfies a specification is offered by simulation distances that are parameterized by an error model. We introduce this framework, study its properties, and provide an algorithmic solution for the following quantitative synthesis question: given two (or more) behavioral requirements specified by possibly incompatible finite-state machines, and an error model, find the finite-state implementation that minimizes the maximal simulation distance to the given requirements. Furthermore, we generalize the framework to handle infinite alphabets (for example, realvalued domains). We also demonstrate how quantitative specifications based on simulation distances might lead to smaller and easier to modify specifications. Finally, we illustrate our approach using case studies on error correcting codes and scheduler synthesis.","lang":"eng"}],"month":"10","publication_status":"published","date_published":"2012-10-01T00:00:00Z","language":[{"iso":"eng"}],"publisher":"ACM","title":"Synthesis from incompatible specifications","date_updated":"2021-01-12T07:00:30Z","quality_controlled":"1","project":[{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"}],"department":[{"_id":"ToHe"}],"citation":{"short":"P. Cerny, S. Gopi, T.A. Henzinger, A. Radhakrishna, N. Totla, in:, Proceedings of the Tenth ACM International Conference on Embedded Software, ACM, 2012, pp. 53–62.","mla":"Cerny, Pavol, et al. “Synthesis from Incompatible Specifications.” <i>Proceedings of the Tenth ACM International Conference on Embedded Software</i>, ACM, 2012, pp. 53–62, doi:<a href=\"https://doi.org/10.1145/2380356.2380371\">10.1145/2380356.2380371</a>.","ieee":"P. Cerny, S. Gopi, T. A. Henzinger, A. Radhakrishna, and N. Totla, “Synthesis from incompatible specifications,” in <i>Proceedings of the tenth ACM international conference on Embedded software</i>, Tampere, Finland, 2012, pp. 53–62.","chicago":"Cerny, Pavol, Sivakanth Gopi, Thomas A Henzinger, Arjun Radhakrishna, and Nishant Totla. “Synthesis from Incompatible Specifications.” In <i>Proceedings of the Tenth ACM International Conference on Embedded Software</i>, 53–62. ACM, 2012. <a href=\"https://doi.org/10.1145/2380356.2380371\">https://doi.org/10.1145/2380356.2380371</a>.","ista":"Cerny P, Gopi S, Henzinger TA, Radhakrishna A, Totla N. 2012. Synthesis from incompatible specifications. Proceedings of the tenth ACM international conference on Embedded software. EMSOFT: Embedded Software , 53–62.","ama":"Cerny P, Gopi S, Henzinger TA, Radhakrishna A, Totla N. Synthesis from incompatible specifications. In: <i>Proceedings of the Tenth ACM International Conference on Embedded Software</i>. ACM; 2012:53-62. doi:<a href=\"https://doi.org/10.1145/2380356.2380371\">10.1145/2380356.2380371</a>","apa":"Cerny, P., Gopi, S., Henzinger, T. A., Radhakrishna, A., &#38; Totla, N. (2012). Synthesis from incompatible specifications. In <i>Proceedings of the tenth ACM international conference on Embedded software</i> (pp. 53–62). Tampere, Finland: ACM. <a href=\"https://doi.org/10.1145/2380356.2380371\">https://doi.org/10.1145/2380356.2380371</a>"},"oa_version":"None","author":[{"first_name":"Pavol","last_name":"Cerny","full_name":"Cerny, Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Gopi","first_name":"Sivakanth","full_name":"Gopi, Sivakanth"},{"orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Arjun","last_name":"Radhakrishna","full_name":"Radhakrishna, Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Totla","first_name":"Nishant","full_name":"Totla, Nishant"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87"},{"acknowledgement":"We thank Laurent Doyen for great ideas and valuable help in analyzing discounted-sum automata.","year":"2012","doi":"10.4230/LIPIcs.FSTTCS.2012.362","page":"362 - 373","day":"01","oa":1,"publist_id":"3867","intvolume":"        18","publication":"Leibniz International Proceedings in Informatics","scopus_import":1,"alternative_title":["LIPIcs"],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","short":"CC BY-NC-ND (4.0)"},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"ToHe"}],"date_updated":"2021-01-12T07:00:31Z","citation":{"ama":"Boker U, Henzinger TA. Approximate determinization of quantitative automata. In: <i>Leibniz International Proceedings in Informatics</i>. Vol 18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2012:362-373. doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2012.362\">10.4230/LIPIcs.FSTTCS.2012.362</a>","ista":"Boker U, Henzinger TA. 2012. Approximate determinization of quantitative automata. Leibniz International Proceedings in Informatics. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 18, 362–373.","chicago":"Boker, Udi, and Thomas A Henzinger. “Approximate Determinization of Quantitative Automata.” In <i>Leibniz International Proceedings in Informatics</i>, 18:362–73. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012. <a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2012.362\">https://doi.org/10.4230/LIPIcs.FSTTCS.2012.362</a>.","apa":"Boker, U., &#38; Henzinger, T. A. (2012). Approximate determinization of quantitative automata. In <i>Leibniz International Proceedings in Informatics</i> (Vol. 18, pp. 362–373). Hyderabad, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2012.362\">https://doi.org/10.4230/LIPIcs.FSTTCS.2012.362</a>","ieee":"U. Boker and T. A. Henzinger, “Approximate determinization of quantitative automata,” in <i>Leibniz International Proceedings in Informatics</i>, Hyderabad, India, 2012, vol. 18, pp. 362–373.","short":"U. Boker, T.A. Henzinger, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012, pp. 362–373.","mla":"Boker, Udi, and Thomas A. Henzinger. “Approximate Determinization of Quantitative Automata.” <i>Leibniz International Proceedings in Informatics</i>, vol. 18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012, pp. 362–73, doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2012.362\">10.4230/LIPIcs.FSTTCS.2012.362</a>."},"file_date_updated":"2020-07-14T12:45:52Z","date_published":"2012-12-01T00:00:00Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","title":"Approximate determinization of quantitative automata","publication_status":"published","abstract":[{"text":"Quantitative automata are nondeterministic finite automata with edge weights. They value a\r\nrun by some function from the sequence of visited weights to the reals, and value a word by its\r\nminimal/maximal run. They generalize boolean automata, and have gained much attention in\r\nrecent years. Unfortunately, important automaton classes, such as sum, discounted-sum, and\r\nlimit-average automata, cannot be determinized. Yet, the quantitative setting provides the potential\r\nof approximate determinization. We define approximate determinization with respect to\r\na distance function, and investigate this potential.\r\nWe show that sum automata cannot be determinized approximately with respect to any\r\ndistance function. However, restricting to nonnegative weights allows for approximate determinization\r\nwith respect to some distance functions.\r\nDiscounted-sum automata allow for approximate determinization, as the influence of a word’s\r\nsuffix is decaying. However, the naive approach, of unfolding the automaton computations up\r\nto a sufficient level, is shown to be doubly exponential in the discount factor. We provide an\r\nalternative construction that is singly exponential in the discount factor, in the precision, and\r\nin the number of states. We prove matching lower bounds, showing exponential dependency on\r\neach of these three parameters.\r\nAverage and limit-average automata are shown to prohibit approximate determinization with\r\nrespect to any distance function, and this is the case even for two weights, 0 and 1.","lang":"eng"}],"ddc":["004"],"status":"public","date_created":"2018-12-11T12:00:10Z","_id":"2891","type":"conference","conference":{"start_date":"2012-12-15","end_date":"2012-12-17","location":"Hyderabad, India","name":"FSTTCS: Foundations of Software Technology and Theoretical Computer Science"},"ec_funded":1,"pubrep_id":"805","author":[{"full_name":"Boker, Udi","id":"31E297B6-F248-11E8-B48F-1D18A9856A87","last_name":"Boker","first_name":"Udi"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724"}],"quality_controlled":"1","project":[{"name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF"},{"name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","call_identifier":"FP7"}],"oa_version":"Published Version","language":[{"iso":"eng"}],"volume":18,"has_accepted_license":"1","month":"12","file":[{"checksum":"88da18d3e2cb2e5011d7d10ce38a3864","file_id":"4826","creator":"system","access_level":"open_access","file_size":559069,"relation":"main_file","file_name":"IST-2017-805-v1+1_34.pdf","content_type":"application/pdf","date_created":"2018-12-12T10:10:37Z","date_updated":"2020-07-14T12:45:52Z"}]},{"date_updated":"2023-10-18T07:34:45Z","quality_controlled":"1","department":[{"_id":"HeEd"}],"oa_version":"Published Version","citation":{"short":"H. Edelsbrunner, O. Musin, A. Ukhalov, O. Yakimova, V. Alexeev, V. Bogaevskaya, A. Gorohov, M. Preobrazhenskaya, Modeling and Analysis of Information Systems 19 (2012) 152–160.","mla":"Edelsbrunner, Herbert, et al. “Fractal and computational geometry for generalizing cartographic objects.” <i>Modeling and Analysis of Information Systems</i>, vol. 19, no. 6, Russian Academy of Sciences, 2012, pp. 152–60.","chicago":"Edelsbrunner, Herbert, Oleg Musin, Alexey Ukhalov, Olga Yakimova, Vladislav Alexeev, Victoriya Bogaevskaya, Andrey Gorohov, and Margarita Preobrazhenskaya. “Fractal and computational geometry for generalizing cartographic objects.” <i>Modeling and Analysis of Information Systems</i>. Russian Academy of Sciences, 2012.","ama":"Edelsbrunner H, Musin O, Ukhalov A, et al. Fractal and computational geometry for generalizing cartographic objects. <i>Modeling and Analysis of Information Systems</i>. 2012;19(6):152-160.","ista":"Edelsbrunner H, Musin O, Ukhalov A, Yakimova O, Alexeev V, Bogaevskaya V, Gorohov A, Preobrazhenskaya M. 2012. Fractal and computational geometry for generalizing cartographic objects. Modeling and Analysis of Information Systems. 19(6), 152–160.","apa":"Edelsbrunner, H., Musin, O., Ukhalov, A., Yakimova, O., Alexeev, V., Bogaevskaya, V., … Preobrazhenskaya, M. (2012). Fractal and computational geometry for generalizing cartographic objects. <i>Modeling and Analysis of Information Systems</i>. Russian Academy of Sciences.","ieee":"H. Edelsbrunner <i>et al.</i>, “Fractal and computational geometry for generalizing cartographic objects,” <i>Modeling and Analysis of Information Systems</i>, vol. 19, no. 6. Russian Academy of Sciences, pp. 152–160, 2012."},"author":[{"full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","first_name":"Herbert","last_name":"Edelsbrunner"},{"full_name":"Musin, Oleg","first_name":"Oleg","last_name":"Musin"},{"full_name":"Ukhalov, Alexey","first_name":"Alexey","last_name":"Ukhalov"},{"first_name":"Olga","last_name":"Yakimova","full_name":"Yakimova, Olga"},{"first_name":"Vladislav","last_name":"Alexeev","full_name":"Alexeev, Vladislav"},{"full_name":"Bogaevskaya, Victoriya","first_name":"Victoriya","last_name":"Bogaevskaya"},{"full_name":"Gorohov, Andrey","first_name":"Andrey","last_name":"Gorohov"},{"full_name":"Preobrazhenskaya, Margarita","first_name":"Margarita","last_name":"Preobrazhenskaya"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"We present an algorithm for simplifying linear cartographic objects and results obtained with a computer program implementing this algorithm. ","lang":"eng"}],"month":"12","publication_status":"published","issue":"6","publisher":"Russian Academy of Sciences","date_published":"2012-12-01T00:00:00Z","language":[{"iso":"rus"}],"article_processing_charge":"No","volume":19,"title":"Fractal and computational geometry for generalizing cartographic objects","oa":1,"date_created":"2018-12-11T12:00:15Z","type":"journal_article","_id":"2902","article_type":"original","main_file_link":[{"url":"http://mi.mathnet.ru/eng/mais280","open_access":"1"}],"page":"152 - 160","day":"01","year":"2012","status":"public","intvolume":"        19","publist_id":"3845","publication":"Modeling and Analysis of Information Systems"},{"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Edelsbrunner H, Symonova O. 2012. The adaptive topology of a digital image. ISVD: International Symposium on Voronoi Diagrams in Science and Engineering, 41–48.","chicago":"Edelsbrunner, Herbert, and Olga Symonova. “The Adaptive Topology of a Digital Image,” 41–48. IEEE, 2012. <a href=\"https://doi.org/10.1109/ISVD.2012.11\">https://doi.org/10.1109/ISVD.2012.11</a>.","ama":"Edelsbrunner H, Symonova O. The adaptive topology of a digital image. In: IEEE; 2012:41-48. doi:<a href=\"https://doi.org/10.1109/ISVD.2012.11\">10.1109/ISVD.2012.11</a>","apa":"Edelsbrunner, H., &#38; Symonova, O. (2012). The adaptive topology of a digital image (pp. 41–48). Presented at the ISVD: International Symposium on Voronoi Diagrams in Science and Engineering, New Brunswick, NJ, USA : IEEE. <a href=\"https://doi.org/10.1109/ISVD.2012.11\">https://doi.org/10.1109/ISVD.2012.11</a>","ieee":"H. Edelsbrunner and O. Symonova, “The adaptive topology of a digital image,” presented at the ISVD: International Symposium on Voronoi Diagrams in Science and Engineering, New Brunswick, NJ, USA , 2012, pp. 41–48.","mla":"Edelsbrunner, Herbert, and Olga Symonova. <i>The Adaptive Topology of a Digital Image</i>. IEEE, 2012, pp. 41–48, doi:<a href=\"https://doi.org/10.1109/ISVD.2012.11\">10.1109/ISVD.2012.11</a>.","short":"H. Edelsbrunner, O. Symonova, in:, IEEE, 2012, pp. 41–48."},"date_updated":"2021-01-12T07:00:35Z","department":[{"_id":"HeEd"},{"_id":"MaJö"}],"title":"The adaptive topology of a digital image","date_published":"2012-08-06T00:00:00Z","file_date_updated":"2020-07-14T12:45:52Z","publisher":"IEEE","ddc":["000"],"abstract":[{"text":"In order to enjoy a digital version of the Jordan Curve Theorem, it is common to use the closed topology for the foreground and the open topology for the background of a 2-dimensional binary image. In this paper, we introduce a single topology that enjoys this theorem for all thresholds decomposing a real-valued image into foreground and background. This topology is easy to construct and it generalizes to n-dimensional images.","lang":"eng"}],"publication_status":"published","year":"2012","day":"06","page":"41 - 48","doi":"10.1109/ISVD.2012.11","oa":1,"publist_id":"3844","scopus_import":1,"author":[{"full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","first_name":"Herbert"},{"full_name":"Symonova, Olga","id":"3C0C7BC6-F248-11E8-B48F-1D18A9856A87","last_name":"Symonova","first_name":"Olga"}],"oa_version":"Submitted Version","quality_controlled":"1","language":[{"iso":"eng"}],"file":[{"date_created":"2018-12-12T10:09:41Z","date_updated":"2020-07-14T12:45:52Z","content_type":"application/pdf","file_name":"IST-2016-545-v1+1_2012-P-10-AdaptiveTopology.pdf","relation":"main_file","access_level":"open_access","file_size":760548,"checksum":"444869a4e8abf07834f88b6e5cb5e9c3","file_id":"4765","creator":"system"}],"has_accepted_license":"1","month":"08","status":"public","type":"conference","_id":"2903","date_created":"2018-12-11T12:00:15Z","conference":{"start_date":"2012-06-27","end_date":"2012-06-29","name":"ISVD: International Symposium on Voronoi Diagrams in Science and Engineering","location":"New Brunswick, NJ, USA "},"pubrep_id":"545"},{"oa":1,"day":"01","year":"2012","doi":"10.5802/jtnb.819","page":"729 - 749","scopus_import":"1","publist_id":"3843","intvolume":"        24","publication":"Journal de Theorie des Nombres des Bordeaux","department":[{"_id":"HeEd"}],"date_updated":"2023-10-18T07:53:47Z","citation":{"mla":"Pausinger, Florian. “Weak Multipliers for Generalized van Der Corput Sequences.” <i>Journal de Theorie Des Nombres Des Bordeaux</i>, vol. 24, no. 3, Université de Bordeaux, 2012, pp. 729–49, doi:<a href=\"https://doi.org/10.5802/jtnb.819\">10.5802/jtnb.819</a>.","short":"F. Pausinger, Journal de Theorie Des Nombres Des Bordeaux 24 (2012) 729–749.","apa":"Pausinger, F. (2012). Weak multipliers for generalized van der Corput sequences. <i>Journal de Theorie Des Nombres Des Bordeaux</i>. Université de Bordeaux. <a href=\"https://doi.org/10.5802/jtnb.819\">https://doi.org/10.5802/jtnb.819</a>","chicago":"Pausinger, Florian. “Weak Multipliers for Generalized van Der Corput Sequences.” <i>Journal de Theorie Des Nombres Des Bordeaux</i>. Université de Bordeaux, 2012. <a href=\"https://doi.org/10.5802/jtnb.819\">https://doi.org/10.5802/jtnb.819</a>.","ista":"Pausinger F. 2012. Weak multipliers for generalized van der Corput sequences. Journal de Theorie des Nombres des Bordeaux. 24(3), 729–749.","ama":"Pausinger F. Weak multipliers for generalized van der Corput sequences. <i>Journal de Theorie des Nombres des Bordeaux</i>. 2012;24(3):729-749. doi:<a href=\"https://doi.org/10.5802/jtnb.819\">10.5802/jtnb.819</a>","ieee":"F. Pausinger, “Weak multipliers for generalized van der Corput sequences,” <i>Journal de Theorie des Nombres des Bordeaux</i>, vol. 24, no. 3. Université de Bordeaux, pp. 729–749, 2012."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","abstract":[{"lang":"eng","text":"Generalized van der Corput sequences are onedimensional, infinite sequences in the unit interval. They are generated from permutations in integer base b and are the building blocks of the multi-dimensional Halton sequences. Motivated by recent progress of Atanassov on the uniform distribution behavior of Halton sequences, we study, among others, permutations of the form P(i) = ai (mod b) for coprime integers a and b. We show that multipliers a that either divide b - 1 or b + 1 generate van der Corput sequences with weak distribution properties. We give explicit lower bounds for the asymptotic distribution behavior of these sequences and relate them to sequences generated from the identity permutation in smaller bases, which are, due to Faure, the weakest distributed generalized van der Corput sequences."},{"text":"Les suites de Van der Corput généralisées sont dessuites unidimensionnelles et infinies dans l’intervalle de l’unité.Elles sont générées par permutations des entiers de la basebetsont les éléments constitutifs des suites multi-dimensionnelles deHalton. Suites aux progrès récents d’Atanassov concernant le com-portement de distribution uniforme des suites de Halton nous nousintéressons aux permutations de la formuleP(i)  =ai(modb)pour les entiers premiers entre euxaetb. Dans cet article nousidentifions des multiplicateursagénérant des suites de Van derCorput ayant une mauvaise distribution. Nous donnons les bornesinférieures explicites pour cette distribution asymptotique asso-ciée à ces suites et relions ces dernières aux suites générées parpermutation d’identité, qui sont, selon Faure, les moins bien dis-tribuées des suites généralisées de Van der Corput dans une basedonnée.","lang":"fre"}],"ddc":["510"],"file_date_updated":"2020-07-14T12:45:52Z","date_published":"2012-01-01T00:00:00Z","publisher":"Université de Bordeaux","title":"Weak multipliers for generalized van der Corput sequences","date_created":"2018-12-11T12:00:15Z","article_type":"original","_id":"2904","type":"journal_article","status":"public","publication_identifier":{"issn":["1246-7405"],"eissn":["2118-8572"]},"quality_controlled":"1","oa_version":"Published Version","author":[{"id":"2A77D7A2-F248-11E8-B48F-1D18A9856A87","full_name":"Pausinger, Florian","last_name":"Pausinger","first_name":"Florian","orcid":"0000-0002-8379-3768"}],"month":"01","has_accepted_license":"1","file":[{"creator":"dernst","checksum":"6954bfe9d7f4119fbdda7a11cf0f5c67","file_id":"7819","file_size":819275,"access_level":"open_access","relation":"main_file","file_name":"JTNB_2012__24_3_729_0.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:45:52Z","date_created":"2020-05-11T12:40:39Z"}],"issue":"3","language":[{"iso":"eng"}],"volume":24,"article_processing_charge":"No"},{"intvolume":"        67","publist_id":"3831","publication":"Russian Mathematical Surveys","date_created":"2018-12-11T12:00:18Z","_id":"2912","type":"journal_article","doi":"10.4213/rm9503","page":"1167–1168","status":"public","year":"2012","day":"01","publication_status":"published","month":"10","issue":"6","date_published":"2012-10-01T00:00:00Z","publisher":"Russian Academy of Sciences","language":[{"iso":"eng"}],"article_processing_charge":"No","volume":67,"title":"On the configuration space for the shortest networks","date_updated":"2023-10-17T11:40:39Z","quality_controlled":"1","department":[{"_id":"HeEd"}],"oa_version":"None","citation":{"ieee":"H. Edelsbrunner and N. Strelkova, “On the configuration space for the shortest networks,” <i>Russian Mathematical Surveys</i>, vol. 67, no. 6. Russian Academy of Sciences, pp. 1167–1168, 2012.","apa":"Edelsbrunner, H., &#38; Strelkova, N. (2012). On the configuration space for the shortest networks. <i>Russian Mathematical Surveys</i>. Russian Academy of Sciences. <a href=\"https://doi.org/10.4213/rm9503\">https://doi.org/10.4213/rm9503</a>","ama":"Edelsbrunner H, Strelkova N. On the configuration space for the shortest networks. <i>Russian Mathematical Surveys</i>. 2012;67(6):1167–1168. doi:<a href=\"https://doi.org/10.4213/rm9503\">10.4213/rm9503</a>","chicago":"Edelsbrunner, Herbert, and Nataliya Strelkova. “On the Configuration Space for the Shortest Networks.” <i>Russian Mathematical Surveys</i>. Russian Academy of Sciences, 2012. <a href=\"https://doi.org/10.4213/rm9503\">https://doi.org/10.4213/rm9503</a>.","ista":"Edelsbrunner H, Strelkova N. 2012. On the configuration space for the shortest networks. Russian Mathematical Surveys. 67(6), 1167–1168.","short":"H. Edelsbrunner, N. Strelkova, Russian Mathematical Surveys 67 (2012) 1167–1168.","mla":"Edelsbrunner, Herbert, and Nataliya Strelkova. “On the Configuration Space for the Shortest Networks.” <i>Russian Mathematical Surveys</i>, vol. 67, no. 6, Russian Academy of Sciences, 2012, pp. 1167–1168, doi:<a href=\"https://doi.org/10.4213/rm9503\">10.4213/rm9503</a>."},"author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833"},{"first_name":"Nataliya","last_name":"Strelkova","full_name":"Strelkova, Nataliya"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"publist_id":"3828","day":"11","status":"public","year":"2012","acknowledgement":"The project receives funding from the European Community’s Seventh Framework Programme under grant agreement\r\nno. ICT- 248273 GeRT.","type":"conference","_id":"2915","date_created":"2018-12-11T12:00:19Z","title":"Multi-modal learning for dynamic tactile sensing","article_processing_charge":"No","language":[{"iso":"eng"}],"date_published":"2012-10-11T00:00:00Z","publisher":"Deutsches Zentrum für Luft und Raumfahrt","month":"10","publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Kroemer","first_name":"Oliver","full_name":"Kroemer, Oliver"},{"full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","last_name":"Lampert","first_name":"Christoph"},{"last_name":"Peters","first_name":"Jan","full_name":"Peters, Jan"}],"oa_version":"None","citation":{"mla":"Kroemer, Oliver, et al. <i>Multi-Modal Learning for Dynamic Tactile Sensing</i>. Deutsches Zentrum für Luft und Raumfahrt, 2012.","short":"O. Kroemer, C. Lampert, J. Peters, in:, Deutsches Zentrum für Luft und Raumfahrt, 2012.","ista":"Kroemer O, Lampert C, Peters J. 2012. Multi-modal learning for dynamic tactile sensing","chicago":"Kroemer, Oliver, Christoph Lampert, and Jan Peters. “Multi-Modal Learning for Dynamic Tactile Sensing.” Deutsches Zentrum für Luft und Raumfahrt, 2012.","ama":"Kroemer O, Lampert C, Peters J. Multi-modal learning for dynamic tactile sensing. In: Deutsches Zentrum für Luft und Raumfahrt; 2012.","apa":"Kroemer, O., Lampert, C., &#38; Peters, J. (2012). Multi-modal learning for dynamic tactile sensing. Deutsches Zentrum für Luft und Raumfahrt.","ieee":"O. Kroemer, C. Lampert, and J. Peters, “Multi-modal learning for dynamic tactile sensing,” 2012."},"quality_controlled":"1","department":[{"_id":"ChLa"}],"date_updated":"2023-10-17T07:58:59Z"},{"language":[{"iso":"eng"}],"volume":96,"month":"10","author":[{"full_name":"Cerny, Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","last_name":"Cerny","first_name":"Pavol"},{"id":"3624234E-F248-11E8-B48F-1D18A9856A87","full_name":"Chmelik, Martin","first_name":"Martin","last_name":"Chmelik"},{"orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Radhakrishna, Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","last_name":"Radhakrishna","first_name":"Arjun"}],"quality_controlled":"1","project":[{"name":"Quantitative Reactive Modeling","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF"},{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"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"}],"oa_version":"Submitted Version","conference":{"location":"Napoli, Italy","name":"GandALF: Games, Automata, Logic, and Formal Verification","end_date":"2012-09-08","start_date":"2012-09-06"},"ec_funded":1,"status":"public","main_file_link":[{"url":"http://arxiv.org/abs/1210.2450","open_access":"1"}],"date_created":"2018-12-11T12:00:19Z","type":"conference","_id":"2916","date_published":"2012-10-07T00:00:00Z","publisher":"EPTCS","title":"Interface Simulation Distances","publication_status":"published","abstract":[{"lang":"eng","text":"The classical (boolean) notion of refinement for behavioral interfaces of system components is the alternating refinement preorder. In this paper, we define a quantitative measure for interfaces, called interface simulation distance. It makes the alternating refinement preorder quantitative by, intu- itively, 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, and that the distance between two interfaces can be bounded from above and below by distances between abstractions of the two interfaces. We illustrate the framework, and the properties of the distances under composition of interfaces, with two case studies."}],"external_id":{"arxiv":["1210.2450"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"date_updated":"2023-02-23T10:12:05Z","citation":{"apa":"Cerny, P., Chmelik, M., Henzinger, T. A., &#38; Radhakrishna, A. (2012). Interface Simulation Distances. In <i>Electronic Proceedings in Theoretical Computer Science</i> (Vol. 96, pp. 29–42). Napoli, Italy: EPTCS. <a href=\"https://doi.org/10.4204/EPTCS.96.3\">https://doi.org/10.4204/EPTCS.96.3</a>","ama":"Cerny P, Chmelik M, Henzinger TA, Radhakrishna A. Interface Simulation Distances. In: <i>Electronic Proceedings in Theoretical Computer Science</i>. Vol 96. EPTCS; 2012:29-42. doi:<a href=\"https://doi.org/10.4204/EPTCS.96.3\">10.4204/EPTCS.96.3</a>","ista":"Cerny P, Chmelik M, Henzinger TA, Radhakrishna A. 2012. Interface Simulation Distances. Electronic Proceedings in Theoretical Computer Science. GandALF: Games, Automata, Logic, and Formal Verification vol. 96, 29–42.","chicago":"Cerny, Pavol, Martin Chmelik, Thomas A Henzinger, and Arjun Radhakrishna. “Interface Simulation Distances.” In <i>Electronic Proceedings in Theoretical Computer Science</i>, 96:29–42. EPTCS, 2012. <a href=\"https://doi.org/10.4204/EPTCS.96.3\">https://doi.org/10.4204/EPTCS.96.3</a>.","ieee":"P. Cerny, M. Chmelik, T. A. Henzinger, and A. Radhakrishna, “Interface Simulation Distances,” in <i>Electronic Proceedings in Theoretical Computer Science</i>, Napoli, Italy, 2012, vol. 96, pp. 29–42.","mla":"Cerny, Pavol, et al. “Interface Simulation Distances.” <i>Electronic Proceedings in Theoretical Computer Science</i>, vol. 96, EPTCS, 2012, pp. 29–42, doi:<a href=\"https://doi.org/10.4204/EPTCS.96.3\">10.4204/EPTCS.96.3</a>.","short":"P. Cerny, M. Chmelik, T.A. Henzinger, A. Radhakrishna, in:, Electronic Proceedings in Theoretical Computer Science, EPTCS, 2012, pp. 29–42."},"arxiv":1,"publist_id":"3827","intvolume":"        96","publication":"Electronic Proceedings in Theoretical Computer Science","scopus_import":1,"related_material":{"record":[{"relation":"later_version","id":"1733","status":"public"}]},"year":"2012","doi":"10.4204/EPTCS.96.3","page":"29 - 42","day":"07","oa":1}]