[{"publication_identifier":{"issn":["0092-8674"],"eissn":["1097-4172"]},"issue":"1","fulldoi":"https://doi.org/10.1016/j.cell.2013.02.033","publication":"Cell","author":[{"last_name":"Zemach","first_name":"Assaf","full_name":"Zemach, Assaf"},{"full_name":"Kim, M. Yvonne","first_name":"M. Yvonne","last_name":"Kim"},{"full_name":"Hsieh, Ping-Hung","first_name":"Ping-Hung","last_name":"Hsieh"},{"first_name":"Devin","full_name":"Coleman-Derr, Devin","last_name":"Coleman-Derr"},{"full_name":"Eshed-Williams, Leor","first_name":"Leor","last_name":"Eshed-Williams"},{"last_name":"Thao","full_name":"Thao, Ka","first_name":"Ka"},{"full_name":"Harmer, Stacey L.","first_name":"Stacey L.","last_name":"Harmer"},{"last_name":"Zilberman","id":"6973db13-dd5f-11ea-814e-b3e5455e9ed1","first_name":"Daniel","orcid":"0000-0002-0123-8649","full_name":"Zilberman, Daniel"}],"title":"The Arabidopsis nucleosome remodeler DDM1 allows DNA methyltransferases to access H1-containing heterochromatin","page":"193-205","department":[{"_id":"DaZi"}],"year":"2013","citation":{"ama":"Zemach A, Kim MY, Hsieh P-H, et al. The Arabidopsis nucleosome remodeler DDM1 allows DNA methyltransferases to access H1-containing heterochromatin. <i>Cell</i>. 2013;153(1):193-205. doi:<a href=\"https://doi.org/10.1016/j.cell.2013.02.033\">10.1016/j.cell.2013.02.033</a>","ista":"Zemach A, Kim MY, Hsieh P-H, Coleman-Derr D, Eshed-Williams L, Thao K, Harmer SL, Zilberman D. 2013. The Arabidopsis nucleosome remodeler DDM1 allows DNA methyltransferases to access H1-containing heterochromatin. Cell. 153(1), 193–205.","chicago":"Zemach, Assaf, M. Yvonne Kim, Ping-Hung Hsieh, Devin Coleman-Derr, Leor Eshed-Williams, Ka Thao, Stacey L. Harmer, and Daniel Zilberman. “The Arabidopsis Nucleosome Remodeler DDM1 Allows DNA Methyltransferases to Access H1-Containing Heterochromatin.” <i>Cell</i>. Elsevier, 2013. <a href=\"https://doi.org/10.1016/j.cell.2013.02.033\">https://doi.org/10.1016/j.cell.2013.02.033</a>.","ieee":"A. Zemach <i>et al.</i>, “The Arabidopsis nucleosome remodeler DDM1 allows DNA methyltransferases to access H1-containing heterochromatin,” <i>Cell</i>, vol. 153, no. 1. Elsevier, pp. 193–205, 2013.","short":"A. Zemach, M.Y. Kim, P.-H. Hsieh, D. Coleman-Derr, L. Eshed-Williams, K. Thao, S.L. Harmer, D. Zilberman, Cell 153 (2013) 193–205.","apa":"Zemach, A., Kim, M. Y., Hsieh, P.-H., Coleman-Derr, D., Eshed-Williams, L., Thao, K., … Zilberman, D. (2013). The Arabidopsis nucleosome remodeler DDM1 allows DNA methyltransferases to access H1-containing heterochromatin. <i>Cell</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.cell.2013.02.033\">https://doi.org/10.1016/j.cell.2013.02.033</a>","mla":"Zemach, Assaf, et al. “The Arabidopsis Nucleosome Remodeler DDM1 Allows DNA Methyltransferases to Access H1-Containing Heterochromatin.” <i>Cell</i>, vol. 153, no. 1, Elsevier, 2013, pp. 193–205, doi:<a href=\"https://doi.org/10.1016/j.cell.2013.02.033\">10.1016/j.cell.2013.02.033</a>."},"publisher":"Elsevier","volume":153,"date_updated":"2021-12-14T08:25:35Z","doi":"10.1016/j.cell.2013.02.033","pmid":1,"external_id":{"pmid":["23540698"]},"scopus_import":"1","main_file_link":[{"url":"https://doi.org/10.1016/j.cell.2013.02.033","open_access":"1"}],"month":"03","intvolume":"       153","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","date_created":"2021-06-04T12:23:28Z","oa":1,"type":"journal_article","_id":"9459","day":"28","quality_controlled":"1","language":[{"iso":"eng"}],"article_type":"original","article_processing_charge":"No","publication_status":"published","status":"public","abstract":[{"text":"Nucleosome remodelers of the DDM1/Lsh family are required for DNA methylation of transposable elements, but the reason for this is unknown. How DDM1 interacts with other methylation pathways, such as small-RNA-directed DNA methylation (RdDM), which is thought to mediate plant asymmetric methylation through DRM enzymes, is also unclear. Here, we show that most asymmetric methylation is facilitated by DDM1 and mediated by the methyltransferase CMT2 separately from RdDM. We find that heterochromatic sequences preferentially require DDM1 for DNA methylation and that this preference depends on linker histone H1. RdDM is instead inhibited by heterochromatin and absolutely requires the nucleosome remodeler DRD1. Together, DDM1 and RdDM mediate nearly all transposon methylation and collaborate to repress transposition and regulate the methylation and expression of genes. Our results indicate that DDM1 provides DNA methyltransferases access to H1-containing heterochromatin to allow stable silencing of transposable elements in cooperation with the RdDM pathway.","lang":"eng"}],"date_published":"2013-03-28T00:00:00Z","extern":"1","oa_version":"Published Version"},{"title":"Imprinted expression of genes and small RNA is associated with localized hypomethylation of the maternal genome in rice endosperm","page":"7934-7939","fulldoi":"https://doi.org/10.1073/pnas.1306164110","author":[{"last_name":"Rodrigues","first_name":"Jessica A.","full_name":"Rodrigues, Jessica A."},{"last_name":"Ruan","first_name":"Randy","full_name":"Ruan, Randy"},{"last_name":"Nishimura","first_name":"Toshiro","full_name":"Nishimura, Toshiro"},{"full_name":"Sharma, Manoj K.","first_name":"Manoj K.","last_name":"Sharma"},{"last_name":"Sharma","full_name":"Sharma, Rita","first_name":"Rita"},{"last_name":"Ronald","full_name":"Ronald, Pamela C","first_name":"Pamela C"},{"full_name":"Fischer, Robert L.","first_name":"Robert L.","last_name":"Fischer"},{"first_name":"Daniel","orcid":"0000-0002-0123-8649","full_name":"Zilberman, Daniel","id":"6973db13-dd5f-11ea-814e-b3e5455e9ed1","last_name":"Zilberman"}],"publication":"Proceedings of the National Academy of Sciences","issue":"19","publication_identifier":{"issn":["0027-8424"],"eissn":["1091-6490"]},"doi":"10.1073/pnas.1306164110","date_updated":"2021-12-14T08:26:44Z","external_id":{"pmid":["23613580"]},"pmid":1,"scopus_import":"1","department":[{"_id":"DaZi"}],"year":"2013","citation":{"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>","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.","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>.","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."},"volume":110,"publisher":"National Academy of Sciences","type":"journal_article","_id":"9481","day":"07","quality_controlled":"1","oa":1,"main_file_link":[{"url":"https://doi.org/10.1073/pnas.1306164110","open_access":"1"}],"month":"05","intvolume":"       110","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","date_created":"2021-06-07T07:31:02Z","keyword":["Multidisciplinary"],"extern":"1","oa_version":"Published Version","article_processing_charge":"No","abstract":[{"lang":"eng","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."}],"status":"public","publication_status":"published","date_published":"2013-05-07T00:00:00Z","article_type":"original","language":[{"iso":"eng"}]},{"department":[{"_id":"DaZi"},{"_id":"XiFe"}],"citation":{"short":"X. Feng, D. Zilberman, H. Dickinson, Developmental Cell 24 (2013) 215–225.","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>","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>.","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.","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>","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>."},"year":"2013","volume":24,"publisher":"Elsevier","date_updated":"2023-05-08T11:00:59Z","doi":"10.1016/j.devcel.2013.01.014","external_id":{"pmid":["23410937"]},"pmid":1,"scopus_import":"1","publication_identifier":{"eissn":["1878-1551"],"issn":["1534-5807"]},"issue":"3","fulldoi":"https://doi.org/10.1016/j.devcel.2013.01.014","author":[{"full_name":"Feng, Xiaoqi","orcid":"0000-0002-4008-1234","first_name":"Xiaoqi","last_name":"Feng","id":"e0164712-22ee-11ed-b12a-d80fcdf35958"},{"last_name":"Zilberman","id":"6973db13-dd5f-11ea-814e-b3e5455e9ed1","first_name":"Daniel","orcid":"0000-0002-0123-8649","full_name":"Zilberman, Daniel"},{"last_name":"Dickinson","full_name":"Dickinson, Hugh","first_name":"Hugh"}],"publication":"Developmental Cell","title":"A conversation across generations: Soma-germ cell crosstalk in plants","page":"215-225","article_type":"review","language":[{"iso":"eng"}],"article_processing_charge":"No","abstract":[{"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.","lang":"eng"}],"status":"public","publication_status":"published","date_published":"2013-02-11T00:00:00Z","extern":"1","oa_version":"Published Version","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1016/j.devcel.2013.01.014"}],"month":"02","intvolume":"        24","date_created":"2021-06-08T06:14:50Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"_id":"9520","day":"11","type":"journal_article","quality_controlled":"1"},{"article_processing_charge":"No","status":"public","abstract":[{"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.","lang":"eng"}],"date_published":"2013-12-12T00:00:00Z","date_updated":"2025-09-29T14:30:03Z","doi":"10.1371/journal.pone.0080814.s001","oa_version":"Published Version","department":[{"_id":"KrCh"}],"citation":{"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).","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.","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>.","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>","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>."},"year":"2013","publisher":"Public Library of Science","fulldoi":"https://doi.org/10.1371/journal.pone.0080814.s001","author":[{"last_name":"Zagorsky","first_name":"Benjamin","full_name":"Zagorsky, Benjamin"},{"last_name":"Reiter","id":"4A918E98-F248-11E8-B48F-1D18A9856A87","full_name":"Reiter, Johannes","orcid":"0000-0002-0170-7353","first_name":"Johannes"},{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"},{"first_name":"Martin","full_name":"Nowak, Martin","last_name":"Nowak"}],"day":"12","_id":"9749","type":"research_data_reference","title":"Forgiver triumphs in alternating prisoner's dilemma ","month":"12","date_created":"2021-07-28T15:45:07Z","related_material":{"record":[{"status":"public","id":"2247","relation":"used_in_publication"}]},"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf"},{"date_created":"2021-07-30T08:08:09Z","related_material":{"record":[{"relation":"used_in_publication","status":"public","id":"2853"}]},"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","main_file_link":[{"url":"https://doi.org/10.5061/dryad.b1q2n","open_access":"1"}],"month":"03","author":[{"last_name":"Refardt","first_name":"Dominik","full_name":"Refardt, Dominik"},{"full_name":"Bergmiller, Tobias","orcid":"0000-0001-5396-4346","first_name":"Tobias","last_name":"Bergmiller","id":"2C471CFA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Kümmerli, Rolf","first_name":"Rolf","last_name":"Kümmerli"}],"fulldoi":"https://doi.org/10.5061/dryad.b1q2n","oa":1,"title":"Data from: Altruism can evolve when relatedness is low: evidence from bacteria committing suicide upon phage infection","day":"21","_id":"9751","type":"research_data_reference","publisher":"Dryad","department":[{"_id":"CaGu"}],"citation":{"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>","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>.","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>.","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>","short":"D. Refardt, T. Bergmiller, R. Kümmerli, (2013)."},"year":"2013","status":"public","abstract":[{"lang":"eng","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."}],"date_published":"2013-03-21T00:00:00Z","article_processing_charge":"No","oa_version":"Published Version","date_updated":"2025-09-29T13:41:12Z","doi":"10.5061/dryad.b1q2n"},{"related_material":{"record":[{"relation":"used_in_publication","id":"2170","status":"public"}]},"date_created":"2021-07-30T08:31:22Z","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","main_file_link":[{"url":"https://doi.org/10.5061/dryad.r3r60","open_access":"1"}],"month":"10","title":"Data from: Likelihood-based inference of population history from low coverage de novo genome assemblies","_id":"9754","type":"research_data_reference","day":"01","author":[{"last_name":"Hearn","full_name":"Hearn, Jack","first_name":"Jack"},{"full_name":"Stone, Graham","first_name":"Graham","last_name":"Stone"},{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","last_name":"Barton","first_name":"Nicholas H","orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H"},{"full_name":"Lohse, Konrad","first_name":"Konrad","last_name":"Lohse"},{"last_name":"Bunnefeld","first_name":"Lynsey","full_name":"Bunnefeld, Lynsey"}],"fulldoi":"https://doi.org/10.5061/dryad.r3r60","oa":1,"publisher":"Dryad","department":[{"_id":"NiBa"}],"citation":{"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>.","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>","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>.","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.","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).","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>"},"year":"2013","oa_version":"Published Version","date_updated":"2025-09-29T11:38:51Z","doi":"10.5061/dryad.r3r60","status":"public","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."}],"date_published":"2013-10-01T00:00:00Z","article_processing_charge":"No"},{"date_published":"2013-06-13T00:00:00Z","abstract":[{"lang":"eng","text":"In order to guarantee that each method of a data structure updates the logical state exactly once, al-most all non-blocking implementations employ Compare-And-Swap (CAS) based synchronization. For FIFO  queue  implementations  this  translates  into  concurrent  enqueue  or  dequeue  methods competing among themselves to update the same variable, the tail or the head, respectively, leading to high contention and poor scalability. Recent non-blocking queue implementations try to alleviate high contentionby increasing the number of contention points, all the while using CAS-based synchronization. Furthermore, obtaining a wait-free implementation with competition is achieved by additional synchronization which leads to further degradation of performance.In this paper we formalize the notion of competitiveness of a synchronizing statement which can beused as a measure for the scalability of concurrent implementations.  We present a new queue implementation, the Speculative Pairing (SP) queue, which, as we show, decreases competitiveness by using Fetch-And-Increment (FAI) instead of CAS. We prove that the SP queue is linearizable and lock-free.We also show that replacing CAS with FAI leads to wait-freedom for dequeue methods without an adverse effect on performance.  In fact, our experiments suggest that the SP queue can perform and scale better than the state-of-the-art queue implementations."}],"status":"public","publication_status":"published","has_accepted_license":"1","oa_version":"Published Version","date_updated":"2020-07-14T23:06:19Z","doi":"10.15479/AT:IST-2013-124-v1-1","publisher":"IST Austria","alternative_title":["IST Austria Technical Report"],"citation":{"short":"T.A. Henzinger, H. Payer, A. Sezgin, Replacing Competition with Cooperation to Achieve Scalable Lock-Free FIFO Queues , IST Austria, 2013.","apa":"Henzinger, T. A., Payer, H., &#38; Sezgin, A. (2013). <i>Replacing competition with cooperation to achieve scalable lock-free FIFO queues </i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2013-124-v1-1\">https://doi.org/10.15479/AT:IST-2013-124-v1-1</a>","mla":"Henzinger, Thomas A., et al. <i>Replacing Competition with Cooperation to Achieve Scalable Lock-Free FIFO Queues </i>. IST Austria, 2013, doi:<a href=\"https://doi.org/10.15479/AT:IST-2013-124-v1-1\">10.15479/AT:IST-2013-124-v1-1</a>.","ieee":"T. A. Henzinger, H. Payer, and A. Sezgin, <i>Replacing competition with cooperation to achieve scalable lock-free FIFO queues </i>. IST Austria, 2013.","ama":"Henzinger TA, Payer H, Sezgin A. <i>Replacing Competition with Cooperation to Achieve Scalable Lock-Free FIFO Queues </i>. IST Austria; 2013. doi:<a href=\"https://doi.org/10.15479/AT:IST-2013-124-v1-1\">10.15479/AT:IST-2013-124-v1-1</a>","ista":"Henzinger TA, Payer H, Sezgin A. 2013. Replacing competition with cooperation to achieve scalable lock-free FIFO queues , IST Austria, 23p.","chicago":"Henzinger, Thomas A, Hannes Payer, and Ali Sezgin. <i>Replacing Competition with Cooperation to Achieve Scalable Lock-Free FIFO Queues </i>. IST Austria, 2013. <a href=\"https://doi.org/10.15479/AT:IST-2013-124-v1-1\">https://doi.org/10.15479/AT:IST-2013-124-v1-1</a>."},"year":"2013","department":[{"_id":"ToHe"}],"language":[{"iso":"eng"}],"author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"},{"last_name":"Payer","full_name":"Payer, Hannes","first_name":"Hannes"},{"full_name":"Sezgin, Ali","first_name":"Ali","last_name":"Sezgin","id":"4C7638DA-F248-11E8-B48F-1D18A9856A87"}],"fulldoi":"https://doi.org/10.15479/AT:IST-2013-124-v1-1","oa":1,"file":[{"content_type":"application/pdf","file_id":"6441","date_updated":"2020-07-14T12:47:30Z","relation":"main_file","creator":"dernst","checksum":"a219ba4eada6cd62befed52262ee15d4","access_level":"open_access","file_size":549684,"file_name":"2013_TechRep_Henzinger.pdf","date_created":"2019-05-13T14:11:39Z"}],"page":"23","title":"Replacing competition with cooperation to achieve scalable lock-free FIFO queues ","type":"technical_report","_id":"6440","day":"13","date_created":"2019-05-13T14:13:27Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"06","publication_identifier":{"issn":["2664-1690"]},"ddc":["000","005"],"pubrep_id":"124","file_date_updated":"2020-07-14T12:47:30Z"},{"acknowledgement":"This research was supported in part by the National Science Foundation CAREER award CCR-0132780, by the ONR grant N00014-02-1-0671, by the National Science Foundation grants CCR-0427202 and CCR-0234690, and by the ARP award TO.030.MM.D.","issue":"2","title":"Code aware resource management","page":"142 - 174","author":[{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"De Alfaro, Luca","first_name":"Luca","last_name":"De Alfaro"},{"last_name":"Faella","full_name":"Faella, Marco","first_name":"Marco"},{"full_name":"Majumdar, Ritankar","first_name":"Ritankar","last_name":"Majumdar"},{"first_name":"Vishwanath","full_name":"Raman, Vishwanath","last_name":"Raman"}],"publication":"Formal Methods in System Design","fulldoi":"https://doi.org/10.1007/s10703-012-0170-4","volume":42,"publisher":"Springer","department":[{"_id":"KrCh"}],"citation":{"ieee":"K. Chatterjee, L. De Alfaro, M. Faella, R. Majumdar, and V. Raman, “Code aware resource management,” <i>Formal Methods in System Design</i>, vol. 42, no. 2. Springer, pp. 142–174, 2013.","ama":"Chatterjee K, De Alfaro L, Faella M, Majumdar R, Raman V. Code aware resource management. <i>Formal Methods in System Design</i>. 2013;42(2):142-174. doi:<a href=\"https://doi.org/10.1007/s10703-012-0170-4\">10.1007/s10703-012-0170-4</a>","ista":"Chatterjee K, De Alfaro L, Faella M, Majumdar R, Raman V. 2013. Code aware resource management. Formal Methods in System Design. 42(2), 142–174.","chicago":"Chatterjee, Krishnendu, Luca De Alfaro, Marco Faella, Ritankar Majumdar, and Vishwanath Raman. “Code Aware Resource Management.” <i>Formal Methods in System Design</i>. Springer, 2013. <a href=\"https://doi.org/10.1007/s10703-012-0170-4\">https://doi.org/10.1007/s10703-012-0170-4</a>.","short":"K. Chatterjee, L. De Alfaro, M. Faella, R. Majumdar, V. Raman, Formal Methods in System Design 42 (2013) 142–174.","apa":"Chatterjee, K., De Alfaro, L., Faella, M., Majumdar, R., &#38; Raman, V. (2013). Code aware resource management. <i>Formal Methods in System Design</i>. Springer. <a href=\"https://doi.org/10.1007/s10703-012-0170-4\">https://doi.org/10.1007/s10703-012-0170-4</a>","mla":"Chatterjee, Krishnendu, et al. “Code Aware Resource Management.” <i>Formal Methods in System Design</i>, vol. 42, no. 2, Springer, 2013, pp. 142–74, doi:<a href=\"https://doi.org/10.1007/s10703-012-0170-4\">10.1007/s10703-012-0170-4</a>."},"year":"2013","scopus_import":"1","doi":"10.1007/s10703-012-0170-4","date_updated":"2025-09-29T13:24:54Z","external_id":{"isi":["000316677500002"]},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2018-12-11T12:01:29Z","month":"04","intvolume":"        42","quality_controlled":"1","_id":"3116","day":"01","type":"journal_article","publist_id":"3583","language":[{"iso":"eng"}],"oa_version":"None","status":"public","abstract":[{"text":"Multithreaded programs coordinate their interaction through synchronization primitives like mutexes and semaphores, which are managed by an OS-provided resource manager. We propose algorithms for the automatic construction of code-aware resource managers for multithreaded embedded applications. Such managers use knowledge about the structure and resource usage (mutex and semaphore usage) of the threads to guarantee deadlock freedom and progress while managing resources in an efficient way. Our algorithms compute managers as winning strategies in certain infinite games, and produce a compact code description of these strategies. We have implemented the algorithms in the tool Cynthesis. Given a multithreaded program in C, the tool produces C code implementing a code-aware resource manager. We show in experiments that Cynthesis produces compact resource managers within a few minutes on a set of embedded benchmarks with up to 6 threads. © 2012 Springer Science+Business Media, LLC.","lang":"eng"}],"publication_status":"published","date_published":"2013-04-01T00:00:00Z","article_processing_charge":"No","isi":1},{"publist_id":"3387","language":[{"iso":"eng"}],"publication_status":"published","has_accepted_license":"1","status":"public","abstract":[{"text":"Cells in a developing embryo have no direct way of &quot;measuring&quot; their physical position. Through a variety of processes, however, the expression levels of multiple genes come to be correlated with position, and these expression levels thus form a code for &quot;positional information.&quot; We show how to measure this information, in bits, using the gap genes in the Drosophila embryo as an example. Individual genes carry nearly two bits of information, twice as much as expected if the expression patterns consisted only of on/off domains separated by sharp boundaries. Taken together, four gap genes carry enough information to define a cell's location with an error bar of ~1% along the anterior-posterior axis of the embryo. This precision is nearly enough for each cell to have a unique identity, which is the maximum information the system can use, and is nearly constant along the length of the embryo. We argue that this constancy is a signature of optimality in the transmission of information from primary morphogen inputs to the output of the gap gene network.","lang":"eng"}],"date_published":"2013-10-08T00:00:00Z","article_processing_charge":"No","isi":1,"oa_version":"Published Version","date_created":"2018-12-11T12:02:19Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","month":"10","intvolume":"       110","oa":1,"quality_controlled":"1","type":"journal_article","_id":"3261","day":"08","publisher":"National Academy of Sciences","volume":110,"department":[{"_id":"GaTk"}],"year":"2013","citation":{"mla":"Dubuis, Julien, et al. “Positional Information, in Bits.” <i>PNAS</i>, vol. 110, no. 41, National Academy of Sciences, 2013, pp. 16301–08, doi:<a href=\"https://doi.org/10.1073/pnas.1315642110\">10.1073/pnas.1315642110</a>.","apa":"Dubuis, J., Tkačik, G., Wieschaus, E., Gregor, T., &#38; Bialek, W. (2013). Positional information, in bits. <i>PNAS</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1315642110\">https://doi.org/10.1073/pnas.1315642110</a>","short":"J. Dubuis, G. Tkačik, E. Wieschaus, T. Gregor, W. Bialek, PNAS 110 (2013) 16301–16308.","chicago":"Dubuis, Julien, Gašper Tkačik, Eric Wieschaus, Thomas Gregor, and William Bialek. “Positional Information, in Bits.” <i>PNAS</i>. National Academy of Sciences, 2013. <a href=\"https://doi.org/10.1073/pnas.1315642110\">https://doi.org/10.1073/pnas.1315642110</a>.","ista":"Dubuis J, Tkačik G, Wieschaus E, Gregor T, Bialek W. 2013. Positional information, in bits. PNAS. 110(41), 16301–16308.","ama":"Dubuis J, Tkačik G, Wieschaus E, Gregor T, Bialek W. Positional information, in bits. <i>PNAS</i>. 2013;110(41):16301-16308. doi:<a href=\"https://doi.org/10.1073/pnas.1315642110\">10.1073/pnas.1315642110</a>","ieee":"J. Dubuis, G. Tkačik, E. Wieschaus, T. Gregor, and W. Bialek, “Positional information, in bits,” <i>PNAS</i>, vol. 110, no. 41. National Academy of Sciences, pp. 16301–16308, 2013."},"scopus_import":"1","date_updated":"2025-09-29T13:24:21Z","doi":"10.1073/pnas.1315642110","pmid":1,"external_id":{"isi":["000325395600021"],"pmid":["24089448"]},"ddc":["570"],"file_date_updated":"2020-07-14T12:46:06Z","issue":"41","author":[{"full_name":"Dubuis, Julien","first_name":"Julien","last_name":"Dubuis"},{"id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","last_name":"Tkacik","full_name":"Tkacik, Gasper","orcid":"0000-0002-6699-1455","first_name":"Gasper"},{"last_name":"Wieschaus","first_name":"Eric","full_name":"Wieschaus, Eric"},{"full_name":"Gregor, Thomas","first_name":"Thomas","last_name":"Gregor"},{"full_name":"Bialek, William","first_name":"William","last_name":"Bialek"}],"publication":"PNAS","file":[{"file_size":1670548,"file_name":"2013_PNAS_Dubuis.pdf","date_created":"2019-01-22T13:53:23Z","checksum":"ecd859fe52a562193027d428b5524a8d","content_type":"application/pdf","relation":"main_file","date_updated":"2020-07-14T12:46:06Z","file_id":"5873","creator":"dernst","access_level":"open_access"}],"fulldoi":"https://doi.org/10.1073/pnas.1315642110","title":"Positional information, in bits","page":"16301 - 16308"},{"oa_version":"None","doi":"10.1007/978-1-4419-9863-7_604","date_updated":"2021-01-12T07:42:38Z","date_published":"2013-01-01T00:00:00Z","publication_status":"published","status":"public","language":[{"iso":"eng"}],"publist_id":"3314","volume":3,"publisher":"Springer","editor":[{"first_name":"Werner","full_name":"Dubitzky, Werner","last_name":"Dubitzky"},{"last_name":"Wolkenhauer","full_name":"Wolkenhauer, Olaf","first_name":"Olaf"},{"full_name":"Cho, Kwang","first_name":"Kwang","last_name":"Cho"},{"first_name":"Hiroki","full_name":"Yokota, Hiroki","last_name":"Yokota"}],"citation":{"short":"N. Quadrianto, C. Lampert, in:, W. Dubitzky, O. Wolkenhauer, K. Cho, H. Yokota (Eds.), Encyclopedia of Systems Biology, Springer, 2013, pp. 1069–1069.","apa":"Quadrianto, N., &#38; Lampert, C. (2013). Kernel based learning. In W. Dubitzky, O. Wolkenhauer, K. Cho, &#38; H. Yokota (Eds.), <i>Encyclopedia of Systems Biology</i> (Vol. 3, pp. 1069–1069). Springer. <a href=\"https://doi.org/10.1007/978-1-4419-9863-7_604\">https://doi.org/10.1007/978-1-4419-9863-7_604</a>","mla":"Quadrianto, Novi, and Christoph Lampert. “Kernel Based Learning.” <i>Encyclopedia of Systems Biology</i>, edited by Werner Dubitzky et al., vol. 3, Springer, 2013, pp. 1069–1069, doi:<a href=\"https://doi.org/10.1007/978-1-4419-9863-7_604\">10.1007/978-1-4419-9863-7_604</a>.","ieee":"N. Quadrianto and C. Lampert, “Kernel based learning,” in <i>Encyclopedia of Systems Biology</i>, vol. 3, W. Dubitzky, O. Wolkenhauer, K. Cho, and H. Yokota, Eds. Springer, 2013, pp. 1069–1069.","ama":"Quadrianto N, Lampert C. Kernel based learning. In: Dubitzky W, Wolkenhauer O, Cho K, Yokota H, eds. <i>Encyclopedia of Systems Biology</i>. Vol 3. Springer; 2013:1069-1069. doi:<a href=\"https://doi.org/10.1007/978-1-4419-9863-7_604\">10.1007/978-1-4419-9863-7_604</a>","ista":"Quadrianto N, Lampert C. 2013.Kernel based learning. In: Encyclopedia of Systems Biology. vol. 3, 1069–1069.","chicago":"Quadrianto, Novi, and Christoph Lampert. “Kernel Based Learning.” In <i>Encyclopedia of Systems Biology</i>, edited by Werner Dubitzky, Olaf Wolkenhauer, Kwang Cho, and Hiroki Yokota, 3:1069–1069. Springer, 2013. <a href=\"https://doi.org/10.1007/978-1-4419-9863-7_604\">https://doi.org/10.1007/978-1-4419-9863-7_604</a>."},"year":"2013","department":[{"_id":"ChLa"}],"quality_controlled":"1","page":"1069 - 1069","title":"Kernel based learning","day":"01","_id":"3321","type":"encyclopedia_article","publication":"Encyclopedia of Systems Biology","author":[{"first_name":"Novi","full_name":"Quadrianto, Novi","last_name":"Quadrianto"},{"last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph"}],"fulldoi":"https://doi.org/10.1007/978-1-4419-9863-7_604","date_created":"2018-12-11T12:02:39Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":"         3","month":"01"},{"_id":"2698","day":"16","type":"journal_article","quality_controlled":"1","oa":1,"arxiv":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1105.0506"}],"month":"10","intvolume":"        15","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:59:07Z","oa_version":"Preprint","article_processing_charge":"No","isi":1,"status":"public","abstract":[{"lang":"eng","text":"We consider non-interacting particles subject to a fixed external potential V and a self-generated magnetic field B. The total energy includes the field energy β∫B2 and we minimize over all particle states and magnetic fields. In the case of spin-1/2 particles this minimization leads to the coupled Maxwell-Pauli system. The parameter β tunes the coupling strength between the field and the particles and it effectively determines the strength of the field. We investigate the stability and the semiclassical asymptotics, h→0, of the total ground state energy E(β,h,V). The relevant parameter measuring the field strength in the semiclassical limit is κ=βh. We are not able to give the exact leading order semiclassical asymptotics uniformly in κ or even for fixed κ. We do however give upper and lower bounds on E with almost matching dependence on κ. In the simultaneous limit h→0 and κ→∞ we show that the standard non-magnetic Weyl asymptotics holds. The same result also holds for the spinless case, i.e. where the Pauli operator is replaced by the Schrödinger operator."}],"publication_status":"published","date_published":"2013-10-16T00:00:00Z","publist_id":"4198","language":[{"iso":"eng"}],"title":"Stability and semiclassics in self-generated fields","page":"2093 - 2113","fulldoi":"https://doi.org/10.4171/JEMS/416","publication":"Journal of the European Mathematical Society","author":[{"last_name":"Erdös","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","first_name":"László","orcid":"0000-0001-5366-9603","full_name":"Erdös, László"},{"full_name":"Fournais, Søren","first_name":"Søren","last_name":"Fournais"},{"first_name":"Jan","full_name":"Solovej, Jan","last_name":"Solovej"}],"issue":"6","date_updated":"2026-07-06T11:56:35Z","doi":"10.4171/JEMS/416","external_id":{"arxiv":["1105.0506"],"isi":["000326323400006"]},"department":[{"_id":"LaEr"}],"year":"2013","citation":{"short":"L. Erdös, S. Fournais, J. Solovej, Journal of the European Mathematical Society 15 (2013) 2093–2113.","apa":"Erdös, L., Fournais, S., &#38; Solovej, J. (2013). Stability and semiclassics in self-generated fields. <i>Journal of the European Mathematical Society</i>. EMS Press. <a href=\"https://doi.org/10.4171/JEMS/416\">https://doi.org/10.4171/JEMS/416</a>","mla":"Erdös, László, et al. “Stability and Semiclassics in Self-Generated Fields.” <i>Journal of the European Mathematical Society</i>, vol. 15, no. 6, EMS Press, 2013, pp. 2093–113, doi:<a href=\"https://doi.org/10.4171/JEMS/416\">10.4171/JEMS/416</a>.","ama":"Erdös L, Fournais S, Solovej J. Stability and semiclassics in self-generated fields. <i>Journal of the European Mathematical Society</i>. 2013;15(6):2093-2113. doi:<a href=\"https://doi.org/10.4171/JEMS/416\">10.4171/JEMS/416</a>","ista":"Erdös L, Fournais S, Solovej J. 2013. Stability and semiclassics in self-generated fields. Journal of the European Mathematical Society. 15(6), 2093–2113.","chicago":"Erdös, László, Søren Fournais, and Jan Solovej. “Stability and Semiclassics in Self-Generated Fields.” <i>Journal of the European Mathematical Society</i>. EMS Press, 2013. <a href=\"https://doi.org/10.4171/JEMS/416\">https://doi.org/10.4171/JEMS/416</a>.","ieee":"L. Erdös, S. Fournais, and J. Solovej, “Stability and semiclassics in self-generated fields,” <i>Journal of the European Mathematical Society</i>, vol. 15, no. 6. EMS Press, pp. 2093–2113, 2013."},"publisher":"EMS Press","volume":15},{"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","volume":8052,"department":[{"_id":"ToHe"}],"citation":{"ieee":"T. A. Henzinger, A. Sezgin, and V. Vafeiadis, “Aspect-oriented linearizability proofs,” vol. 8052. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 242–256, 2013.","chicago":"Henzinger, Thomas A, Ali Sezgin, and Viktor Vafeiadis. “Aspect-Oriented Linearizability Proofs.” Lecture Notes in Computer Science. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013. <a href=\"https://doi.org/10.1007/978-3-642-40184-8_18\">https://doi.org/10.1007/978-3-642-40184-8_18</a>.","ista":"Henzinger TA, Sezgin A, Vafeiadis V. 2013. Aspect-oriented linearizability proofs. 8052, 242–256.","ama":"Henzinger TA, Sezgin A, Vafeiadis V. Aspect-oriented linearizability proofs. 2013;8052:242-256. doi:<a href=\"https://doi.org/10.1007/978-3-642-40184-8_18\">10.1007/978-3-642-40184-8_18</a>","mla":"Henzinger, Thomas A., et al. <i>Aspect-Oriented Linearizability Proofs</i>. Vol. 8052, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013, pp. 242–56, doi:<a href=\"https://doi.org/10.1007/978-3-642-40184-8_18\">10.1007/978-3-642-40184-8_18</a>.","short":"T.A. Henzinger, A. Sezgin, V. Vafeiadis, 8052 (2013) 242–256.","apa":"Henzinger, T. A., Sezgin, A., &#38; Vafeiadis, V. (2013). Aspect-oriented linearizability proofs. Presented at the CONCUR: Concurrency Theory, Buenos Aires, Argentina: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.1007/978-3-642-40184-8_18\">https://doi.org/10.1007/978-3-642-40184-8_18</a>"},"year":"2013","scopus_import":1,"date_updated":"2026-07-06T13:24:04Z","doi":"10.1007/978-3-642-40184-8_18","ec_funded":1,"ddc":["000","004"],"pubrep_id":"197","file_date_updated":"2020-07-14T12:45:39Z","related_material":{"record":[{"status":"public","id":"1832","relation":"later_version"}]},"title":"Aspect-oriented linearizability proofs","page":"242 - 256","author":[{"orcid":"0000−0002−2985−7724","first_name":"Thomas A","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger"},{"id":"4C7638DA-F248-11E8-B48F-1D18A9856A87","last_name":"Sezgin","first_name":"Ali","full_name":"Sezgin, Ali"},{"last_name":"Vafeiadis","full_name":"Vafeiadis, Viktor","first_name":"Viktor"}],"file":[{"checksum":"bdbb520de91751fe0136309ad4ef67e4","date_updated":"2020-07-14T12:45:39Z","file_id":"4721","creator":"system","relation":"main_file","content_type":"application/pdf","access_level":"open_access","file_size":337059,"date_created":"2018-12-12T10:08:58Z","file_name":"IST-2014-197-v1+1_main-queue-verification.pdf"}],"project":[{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"grant_number":"267989","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"fulldoi":"https://doi.org/10.1007/978-3-642-40184-8_18","conference":{"start_date":"2013-08-27","end_date":"2013-08-30","name":"CONCUR: Concurrency Theory","location":"Buenos Aires, Argentina"},"publist_id":"4598","language":[{"iso":"eng"}],"alternative_title":["LNCS"],"oa_version":"Submitted Version","status":"public","publication_status":"published","has_accepted_license":"1","abstract":[{"lang":"eng","text":"Linearizability of concurrent data structures is usually proved by monolithic simulation arguments relying on identifying the so-called linearization points. Regrettably, such proofs, whether manual or automatic, are often complicated and scale poorly to advanced non-blocking concurrency patterns, such as helping and optimistic updates.\r\nIn response, we propose a more modular way of checking linearizability of concurrent queue algorithms that does not involve identifying linearization points. We reduce the task of proving linearizability with respect to the queue specification to establishing four basic properties, each of which can be proved independently by simpler arguments. As a demonstration of our approach, we verify the Herlihy and Wing queue, an algorithm that is challenging to verify by a simulation proof."}],"date_published":"2013-08-01T00:00:00Z","series_title":"Lecture Notes in Computer Science","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:57:01Z","month":"08","intvolume":"      8052","quality_controlled":"1","day":"01","_id":"2328","type":"conference","oa":1},{"_id":"2901","day":"01","type":"conference","quality_controlled":"1","oa":1,"month":"01","main_file_link":[{"open_access":"1","url":"http://jmlr.org/proceedings/papers/v31/chen13a.html"}],"intvolume":"        31","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T12:00:14Z","oa_version":"None","article_processing_charge":"No","abstract":[{"text":" We introduce the M-modes problem for graphical models: predicting the M label configurations of highest probability that are at the same time local maxima of the probability landscape. M-modes have multiple possible applications: because they are intrinsically diverse, they provide a principled alternative to non-maximum suppression techniques for structured prediction, they can act as codebook vectors for quantizing the configuration space, or they can form component centers for mixture model approximation. We present two algorithms for solving the M-modes problem. The first algorithm solves the problem in polynomial time when the underlying graphical model is a simple chain. The second algorithm solves the problem for junction chains. In synthetic and real dataset, we demonstrate how M-modes can improve the performance of prediction. We also use the generated modes as a tool to understand the topography of the probability distribution of configurations, for example with relation to the training set size and amount of noise in the data. ","lang":"eng"}],"publication_status":"published","status":"public","date_published":"2013-01-01T00:00:00Z","publist_id":"3846","language":[{"iso":"eng"}],"alternative_title":["PMLR"],"title":"Computing the M most probable modes of a graphical model","page":"161 - 169","conference":{"end_date":"2013-05-01","name":"AISTATS: Conference on Uncertainty in Artificial Intelligence","start_date":"2013-04-29","location":"Scottsdale, AZ, United States"},"author":[{"last_name":"Chen","id":"3E92416E-F248-11E8-B48F-1D18A9856A87","full_name":"Chen, Chao","first_name":"Chao"},{"full_name":"Kolmogorov, Vladimir","first_name":"Vladimir","last_name":"Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Yan","first_name":"Zhu","full_name":"Yan, Zhu"},{"last_name":"Metaxas","full_name":"Metaxas, Dimitris","first_name":"Dimitris"},{"full_name":"Lampert, Christoph","first_name":"Christoph","orcid":"0000-0001-8622-7887","last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87"}],"publication":"Proceedings of the 16th International Conference on Artificial Intelligence and Statistics","das_tickbox":"1","date_updated":"2026-07-06T13:43:58Z","scopus_import":"1","department":[{"_id":"HeEd"},{"_id":"VlKo"},{"_id":"ChLa"}],"citation":{"chicago":"Chen, Chao, Vladimir Kolmogorov, Zhu Yan, Dimitris Metaxas, and Christoph Lampert. “Computing the M Most Probable Modes of a Graphical Model.” In <i>Proceedings of the 16th International Conference on Artificial Intelligence and Statistics</i>, 31:161–69. Journal of Machine Learning Research, 2013.","ista":"Chen C, Kolmogorov V, Yan Z, Metaxas D, Lampert C. 2013. Computing the M most probable modes of a graphical model. Proceedings of the 16th International Conference on Artificial Intelligence and Statistics. AISTATS: Conference on Uncertainty in Artificial Intelligence, PMLR, vol. 31, 161–169.","ama":"Chen C, Kolmogorov V, Yan Z, Metaxas D, Lampert C. Computing the M most probable modes of a graphical model. In: <i>Proceedings of the 16th International Conference on Artificial Intelligence and Statistics</i>. Vol 31. Journal of Machine Learning Research; 2013:161-169.","ieee":"C. Chen, V. Kolmogorov, Z. Yan, D. Metaxas, and C. Lampert, “Computing the M most probable modes of a graphical model,” in <i>Proceedings of the 16th International Conference on Artificial Intelligence and Statistics</i>, Scottsdale, AZ, United States, 2013, vol. 31, pp. 161–169.","mla":"Chen, Chao, et al. “Computing the M Most Probable Modes of a Graphical Model.” <i>Proceedings of the 16th International Conference on Artificial Intelligence and Statistics</i>, vol. 31, Journal of Machine Learning Research, 2013, pp. 161–69.","short":"C. Chen, V. Kolmogorov, Z. Yan, D. Metaxas, C. Lampert, in:, Proceedings of the 16th International Conference on Artificial Intelligence and Statistics, Journal of Machine Learning Research, 2013, pp. 161–169.","apa":"Chen, C., Kolmogorov, V., Yan, Z., Metaxas, D., &#38; Lampert, C. (2013). Computing the M most probable modes of a graphical model. In <i>Proceedings of the 16th International Conference on Artificial Intelligence and Statistics</i> (Vol. 31, pp. 161–169). Scottsdale, AZ, United States: Journal of Machine Learning Research."},"year":"2013","volume":31,"publisher":"Journal of Machine Learning Research"},{"oa_version":"Preprint","abstract":[{"text":"Models of neural responses to stimuli with complex spatiotemporal correlation structure often assume that neurons are selective for only a small number of linear projections of a potentially high-dimensional input. In this review, we explore recent modeling approaches where the neural response depends on the quadratic form of the input rather than on its linear projection, that is, the neuron is sensitive to the local covariance structure of the signal preceding the spike. To infer this quadratic dependence in the presence of arbitrary (e.g., naturalistic) stimulus distribution, we review several inference methods, focusing in particular on two information theory–based approaches (maximization of stimulus energy and of noise entropy) and two likelihood-based approaches (Bayesian spike-triggered covariance and extensions of generalized linear models). We analyze the formal relationship between the likelihood-based and information-based approaches to demonstrate how they lead to consistent inference. We demonstrate the practical feasibility of these procedures by using model neurons responding to a flickering variance stimulus.","lang":"eng"}],"publication_status":"published","status":"public","date_published":"2013-07-01T00:00:00Z","article_processing_charge":"No","isi":1,"publist_id":"3983","language":[{"iso":"eng"}],"quality_controlled":"1","_id":"2818","type":"journal_article","day":"01","oa":1,"arxiv":1,"date_created":"2018-12-11T11:59:45Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"07","main_file_link":[{"url":"http://arxiv.org/abs/1209.0121","open_access":"1"}],"intvolume":"        25","scopus_import":"1","date_updated":"2026-07-06T13:45:52Z","doi":"10.1162/NECO_a_00463","external_id":{"arxiv":["1209.0121"],"isi":["000319903700001"]},"publisher":"MIT Press","volume":25,"department":[{"_id":"GaTk"}],"year":"2013","citation":{"mla":"Rajan, Kanaka, et al. “Learning Quadratic Receptive Fields from Neural Responses to Natural Stimuli.” <i>Neural Computation</i>, vol. 25, no. 7, MIT Press, 2013, pp. 1661–92, doi:<a href=\"https://doi.org/10.1162/NECO_a_00463\">10.1162/NECO_a_00463</a>.","apa":"Rajan, K., Marre, O., &#38; Tkačik, G. (2013). Learning quadratic receptive fields from neural responses to natural stimuli. <i>Neural Computation</i>. MIT Press. <a href=\"https://doi.org/10.1162/NECO_a_00463\">https://doi.org/10.1162/NECO_a_00463</a>","short":"K. Rajan, O. Marre, G. Tkačik, Neural Computation 25 (2013) 1661–1692.","ieee":"K. Rajan, O. Marre, and G. Tkačik, “Learning quadratic receptive fields from neural responses to natural stimuli,” <i>Neural Computation</i>, vol. 25, no. 7. MIT Press, pp. 1661–1692, 2013.","chicago":"Rajan, Kanaka, Olivier Marre, and Gašper Tkačik. “Learning Quadratic Receptive Fields from Neural Responses to Natural Stimuli.” <i>Neural Computation</i>. MIT Press, 2013. <a href=\"https://doi.org/10.1162/NECO_a_00463\">https://doi.org/10.1162/NECO_a_00463</a>.","ama":"Rajan K, Marre O, Tkačik G. Learning quadratic receptive fields from neural responses to natural stimuli. <i>Neural Computation</i>. 2013;25(7):1661-1692. doi:<a href=\"https://doi.org/10.1162/NECO_a_00463\">10.1162/NECO_a_00463</a>","ista":"Rajan K, Marre O, Tkačik G. 2013. Learning quadratic receptive fields from neural responses to natural stimuli. Neural Computation. 25(7), 1661–1692."},"title":"Learning quadratic receptive fields from neural responses to natural stimuli","page":"1661 - 1692","publication":"Neural Computation","author":[{"last_name":"Rajan","full_name":"Rajan, Kanaka","first_name":"Kanaka"},{"first_name":"Olivier","full_name":"Marre, Olivier","last_name":"Marre"},{"orcid":"0000-0002-6699-1455","first_name":"Gasper","full_name":"Tkacik, Gasper","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","last_name":"Tkacik"}],"fulldoi":"https://doi.org/10.1162/NECO_a_00463","issue":"7","das_tickbox":"1"},{"department":[{"_id":"HeEd"}],"citation":{"mla":"Bendich, Paul, et al. “Homology and Robustness of Level and Interlevel Sets.” <i>Homology, Homotopy and Applications</i>, vol. 15, no. 1, International Press of Boston, 2013, pp. 51–72, doi:<a href=\"https://doi.org/10.4310/HHA.2013.v15.n1.a3\">10.4310/HHA.2013.v15.n1.a3</a>.","apa":"Bendich, P., Edelsbrunner, H., Morozov, D., &#38; Patel, A. (2013). Homology and robustness of level and interlevel sets. <i>Homology, Homotopy and Applications</i>. International Press of Boston. <a href=\"https://doi.org/10.4310/HHA.2013.v15.n1.a3\">https://doi.org/10.4310/HHA.2013.v15.n1.a3</a>","short":"P. Bendich, H. Edelsbrunner, D. Morozov, A. Patel, Homology, Homotopy and Applications 15 (2013) 51–72.","ieee":"P. Bendich, H. Edelsbrunner, D. Morozov, and A. Patel, “Homology and robustness of level and interlevel sets,” <i>Homology, Homotopy and Applications</i>, vol. 15, no. 1. International Press of Boston, pp. 51–72, 2013.","chicago":"Bendich, Paul, Herbert Edelsbrunner, Dmitriy Morozov, and Amit Patel. “Homology and Robustness of Level and Interlevel Sets.” <i>Homology, Homotopy and Applications</i>. International Press of Boston, 2013. <a href=\"https://doi.org/10.4310/HHA.2013.v15.n1.a3\">https://doi.org/10.4310/HHA.2013.v15.n1.a3</a>.","ista":"Bendich P, Edelsbrunner H, Morozov D, Patel A. 2013. Homology and robustness of level and interlevel sets. Homology, Homotopy and Applications. 15(1), 51–72.","ama":"Bendich P, Edelsbrunner H, Morozov D, Patel A. Homology and robustness of level and interlevel sets. <i>Homology, Homotopy and Applications</i>. 2013;15(1):51-72. doi:<a href=\"https://doi.org/10.4310/HHA.2013.v15.n1.a3\">10.4310/HHA.2013.v15.n1.a3</a>"},"year":"2013","publisher":"International Press of Boston","volume":15,"date_updated":"2026-07-06T13:38:59Z","doi":"10.4310/HHA.2013.v15.n1.a3","external_id":{"isi":["000322423600003"],"arxiv":["1102.3389"]},"scopus_import":"1","issue":"1","das_tickbox":"1","title":"Homology and robustness of level and interlevel sets","page":"51 - 72","fulldoi":"https://doi.org/10.4310/HHA.2013.v15.n1.a3","publication":"Homology, Homotopy and Applications","author":[{"id":"43F6EC54-F248-11E8-B48F-1D18A9856A87","last_name":"Bendich","full_name":"Bendich, Paul","first_name":"Paul"},{"full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner"},{"last_name":"Morozov","full_name":"Morozov, Dmitriy","first_name":"Dmitriy"},{"first_name":"Amit","full_name":"Patel, Amit","last_name":"Patel","id":"34A254A0-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"3930","language":[{"iso":"eng"}],"oa_version":"Preprint","article_processing_charge":"No","isi":1,"status":"public","abstract":[{"lang":"eng","text":"Given a continuous function f:X-R on a topological space, we consider the preimages of intervals and their homology groups and show how to read the ranks of these groups from the extended persistence diagram of f. In addition, we quantify the robustness of the homology classes under perturbations of f using well groups, and we show how to read the ranks of these groups from the same extended persistence diagram. The special case X=R3 has ramifications in the fields of medical imaging and scientific visualization."}],"publication_status":"published","date_published":"2013-05-01T00:00:00Z","arxiv":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1102.3389v1"}],"month":"05","intvolume":"        15","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:59:58Z","_id":"2859","day":"01","type":"journal_article","quality_controlled":"1","oa":1},{"issue":"4","das_tickbox":"1","title":"Packing ellipsoids with overlap","page":"671 - 706","author":[{"last_name":"Uhler","id":"49ADD78E-F248-11E8-B48F-1D18A9856A87","first_name":"Caroline","orcid":"0000-0002-7008-0216","full_name":"Uhler, Caroline"},{"last_name":"Wright","full_name":"Wright, Stephen","first_name":"Stephen"}],"publication":"SIAM Review","fulldoi":"https://doi.org/10.1137/120872309","volume":55,"publisher":"Society for Industrial and Applied Mathematics","department":[{"_id":"CaUh"}],"year":"2013","citation":{"mla":"Uhler, Caroline, and Stephen Wright. “Packing Ellipsoids with Overlap.” <i>SIAM Review</i>, vol. 55, no. 4, Society for Industrial and Applied Mathematics, 2013, pp. 671–706, doi:<a href=\"https://doi.org/10.1137/120872309\">10.1137/120872309</a>.","short":"C. Uhler, S. Wright, SIAM Review 55 (2013) 671–706.","apa":"Uhler, C., &#38; Wright, S. (2013). Packing ellipsoids with overlap. <i>SIAM Review</i>. Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/120872309\">https://doi.org/10.1137/120872309</a>","ieee":"C. Uhler and S. Wright, “Packing ellipsoids with overlap,” <i>SIAM Review</i>, vol. 55, no. 4. Society for Industrial and Applied Mathematics, pp. 671–706, 2013.","chicago":"Uhler, Caroline, and Stephen Wright. “Packing Ellipsoids with Overlap.” <i>SIAM Review</i>. Society for Industrial and Applied Mathematics, 2013. <a href=\"https://doi.org/10.1137/120872309\">https://doi.org/10.1137/120872309</a>.","ama":"Uhler C, Wright S. Packing ellipsoids with overlap. <i>SIAM Review</i>. 2013;55(4):671-706. doi:<a href=\"https://doi.org/10.1137/120872309\">10.1137/120872309</a>","ista":"Uhler C, Wright S. 2013. Packing ellipsoids with overlap. SIAM Review. 55(4), 671–706."},"scopus_import":"1","doi":"10.1137/120872309","date_updated":"2026-07-06T13:58:55Z","external_id":{"arxiv":["1204.0235"],"isi":["000327502800002"]},"arxiv":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:56:44Z","main_file_link":[{"url":"http://arxiv.org/abs/1204.0235","open_access":"1"}],"month":"11","intvolume":"        55","quality_controlled":"1","_id":"2280","type":"journal_article","day":"07","oa":1,"publist_id":"4655","language":[{"iso":"eng"}],"oa_version":"Preprint","publication_status":"published","status":"public","abstract":[{"text":"The problem of packing ellipsoids of different sizes and shapes into an ellipsoidal container so as to minimize a measure of overlap between ellipsoids is considered. A bilevel optimization formulation is given, together with an algorithm for the general case and a simpler algorithm for the special case in which all ellipsoids are in fact spheres. Convergence results are proved and computational experience is described and illustrated. The motivating application-chromosome organization in the human cell nucleus-is discussed briefly, and some illustrative results are presented.","lang":"eng"}],"date_published":"2013-11-07T00:00:00Z","article_processing_charge":"No","isi":1},{"author":[{"orcid":"0000-0002-6026-4409","first_name":"Patrick","full_name":"Danowski, Patrick","last_name":"Danowski","id":"2EBD1598-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Doron","full_name":"Goldfarb, Doron","last_name":"Goldfarb"},{"last_name":"Schaffner","first_name":"Verena","full_name":"Schaffner, Verena"},{"first_name":"Wolfram","full_name":"Seidler, Wolfram","last_name":"Seidler"}],"publication":"VÖB Mitteilungen","file":[{"file_name":"IST-2016-719-v1+1_Patrick_Danowski__Doron_Goldfarb__Verena_Schaffner__Wolfram_Seidler_Linked__Open__Data_Bibliographische_Daten_im_Semantic_Web.pdf","date_created":"2018-12-12T10:08:09Z","file_size":881545,"access_level":"open_access","relation":"main_file","creator":"system","file_id":"4669","date_updated":"2020-07-14T12:45:35Z","content_type":"application/pdf","checksum":"ae57ffcee3720adcc27b0f2767a1e04b"}],"page":"559 - 587","title":"Linked (Open) Data - Bibliographische Daten im Semantic Web","das_tickbox":"1","ddc":["020"],"pubrep_id":"719","file_date_updated":"2020-07-14T12:45:35Z","issue":"3/4","date_updated":"2026-07-07T06:12:03Z","publisher":"Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare","volume":66,"citation":{"mla":"Danowski, Patrick, et al. “Linked (Open) Data - Bibliographische Daten Im Semantic Web.” <i>VÖB Mitteilungen</i>, vol. 66, no. 3/4, Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, 2013, pp. 559–87.","short":"P. Danowski, D. Goldfarb, V. Schaffner, W. Seidler, VÖB Mitteilungen 66 (2013) 559–587.","apa":"Danowski, P., Goldfarb, D., Schaffner, V., &#38; Seidler, W. (2013). Linked (Open) Data - Bibliographische Daten im Semantic Web. <i>VÖB Mitteilungen</i>. Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare.","ieee":"P. Danowski, D. Goldfarb, V. Schaffner, and W. Seidler, “Linked (Open) Data - Bibliographische Daten im Semantic Web,” <i>VÖB Mitteilungen</i>, vol. 66, no. 3/4. Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, pp. 559–587, 2013.","chicago":"Danowski, Patrick, Doron Goldfarb, Verena Schaffner, and Wolfram Seidler. “Linked (Open) Data - Bibliographische Daten Im Semantic Web.” <i>VÖB Mitteilungen</i>. Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, 2013.","ama":"Danowski P, Goldfarb D, Schaffner V, Seidler W. Linked (Open) Data - Bibliographische Daten im Semantic Web. <i>VÖB Mitteilungen</i>. 2013;66(3/4):559-587.","ista":"Danowski P, Goldfarb D, Schaffner V, Seidler W. 2013. Linked (Open) Data - Bibliographische Daten im Semantic Web. VÖB Mitteilungen. 66(3/4), 559–587."},"year":"2013","department":[{"_id":"E-Lib"}],"oa":1,"popular_science":"1","_id":"2256","type":"journal_article","day":"01","date_created":"2018-12-11T11:56:36Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":"        66","month":"12","tmp":{"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)","image":"/images/cc_by.png"},"date_published":"2013-12-01T00:00:00Z","publication_status":"published","abstract":[{"lang":"eng","text":"Linked (Open) Data - bibliographic data on the Semantic Web. Report of the Working Group on Linked Data to the plenary assembly of the Austrian Library Network (translation of the title). Linked Data stands for a certain approach to publishing data on the Web. The underlying idea is to harmonise heterogeneous data sources of different origin in order to improve their accessibility and interoperability, effectively making them queryable as a big distributed database. This report summarises relevant developments in Europe as well as the Linked Data Working Group‘s strategic and technical considerations regarding the publishing of the Austrian Library Network’s (OBV’s) bibliographic datasets. It concludes with the mutual agreement that the implementation of Linked Data principles within the OBV can only be taken into consideration accompanied by a discussion about the provision of the datasets under a free license."},{"text":"Linked Data steht für eine bestimmte Form der Veröffentlichung von Daten via Internet. Die zu Grunde liegende Idee ist es, Daten verschiedenster Provenienz, die derzeit teilweise gar nicht oder nur schwer zugänglich sind, in möglichst \r\neinheitlicher Form miteinander zu verknüpfen und dadurch in ihrer Gesamtheit abfragbar zu machen.\r\nDieser Bericht fasst die Entwicklungen im europäischen Raum, sowie strategische und technische Überlegungen der AG Linked Data hinsichtlich der Veröffentlichung von bibliothekarischen Daten des Österreichischen Bibliothekenverbundes (OBV) zusammen und schließt mit der gemeinsamen Übereinkunft, dass die Umsetzung von Linked Data-Prinzipien im OBV nur in Zusammenhang mit einer Diskussion über die damit einhergehende Veröffentlichung der Daten unter einer freien Lizenz angedacht werden sollte.","lang":"ger"}],"status":"public","has_accepted_license":"1","article_processing_charge":"No","oa_version":"Published Version","language":[{"iso":"eng"}],"publist_id":"4690"},{"article_number":"225","language":[{"iso":"eng"}],"publist_id":"4647","oa_version":"Published Version","date_published":"2013-10-14T00:00:00Z","status":"public","has_accepted_license":"1","abstract":[{"text":"Background: The brood of ants and other social insects is highly susceptible to pathogens, particularly those that penetrate the soft larval and pupal cuticle. We here test whether the presence of a pupal cocoon, which occurs in some ant species but not in others, affects the sanitary brood care and fungal infection patterns after exposure to the entomopathogenic fungus Metarhizium brunneum. We use a) a comparative approach analysing four species with either naked or cocooned pupae and b) a within-species analysis of a single ant species, in which both pupal types co-exist in the same colony. Results: We found that the presence of a cocoon did not compromise fungal pathogen detection by the ants and that species with cocooned pupae increased brood grooming after pathogen exposure. All tested ant species further removed brood from their nests, which was predominantly expressed towards larvae and naked pupae treated with the live fungal pathogen. In contrast, cocooned pupae exposed to live fungus were not removed at higher rates than cocooned pupae exposed to dead fungus or a sham control. Consistent with this, exposure to the live fungus caused high numbers of infections and fungal outgrowth in larvae and naked pupae, but not in cocooned pupae. Moreover, the ants consistently removed the brood prior to fungal outgrowth, ensuring a clean brood chamber. Conclusion: Our study suggests that the pupal cocoon has a protective effect against fungal infection, causing an adaptive change in sanitary behaviours by the ants. It further demonstrates that brood removal-originally described for honeybees as &quot;hygienic behaviour&quot;-is a widespread sanitary behaviour in ants, which likely has important implications on disease dynamics in social insect colonies.","lang":"eng"}],"publication_status":"published","isi":1,"article_processing_charge":"No","tmp":{"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)","image":"/images/cc_by.png"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:56:46Z","intvolume":"        13","month":"10","quality_controlled":"1","corr_author":"1","_id":"2284","day":"14","type":"journal_article","oa":1,"publisher":"BioMed Central","volume":13,"citation":{"ieee":"S. Tragust, L. V. Ugelvig, M. Chapuisat, J. Heinze, and S. Cremer, “Pupal cocoons affect sanitary brood care and limit fungal infections in ant colonies,” <i>BMC Evolutionary Biology</i>, vol. 13, no. 1. BioMed Central, 2013.","ista":"Tragust S, Ugelvig LV, Chapuisat M, Heinze J, Cremer S. 2013. Pupal cocoons affect sanitary brood care and limit fungal infections in ant colonies. BMC Evolutionary Biology. 13(1), 225.","ama":"Tragust S, Ugelvig LV, Chapuisat M, Heinze J, Cremer S. Pupal cocoons affect sanitary brood care and limit fungal infections in ant colonies. <i>BMC Evolutionary Biology</i>. 2013;13(1). doi:<a href=\"https://doi.org/10.1186/1471-2148-13-225\">10.1186/1471-2148-13-225</a>","chicago":"Tragust, Simon, Line V Ugelvig, Michel Chapuisat, Jürgen Heinze, and Sylvia Cremer. “Pupal Cocoons Affect Sanitary Brood Care and Limit Fungal Infections in Ant Colonies.” <i>BMC Evolutionary Biology</i>. BioMed Central, 2013. <a href=\"https://doi.org/10.1186/1471-2148-13-225\">https://doi.org/10.1186/1471-2148-13-225</a>.","short":"S. Tragust, L.V. Ugelvig, M. Chapuisat, J. Heinze, S. Cremer, BMC Evolutionary Biology 13 (2013).","apa":"Tragust, S., Ugelvig, L. V., Chapuisat, M., Heinze, J., &#38; Cremer, S. (2013). Pupal cocoons affect sanitary brood care and limit fungal infections in ant colonies. <i>BMC Evolutionary Biology</i>. BioMed Central. <a href=\"https://doi.org/10.1186/1471-2148-13-225\">https://doi.org/10.1186/1471-2148-13-225</a>","mla":"Tragust, Simon, et al. “Pupal Cocoons Affect Sanitary Brood Care and Limit Fungal Infections in Ant Colonies.” <i>BMC Evolutionary Biology</i>, vol. 13, no. 1, 225, BioMed Central, 2013, doi:<a href=\"https://doi.org/10.1186/1471-2148-13-225\">10.1186/1471-2148-13-225</a>."},"year":"2013","department":[{"_id":"SyCr"}],"scopus_import":"1","external_id":{"isi":["000326620500001"]},"date_updated":"2026-07-28T09:35:11Z","doi":"10.1186/1471-2148-13-225","ec_funded":1,"acknowledgement":"The study was funded by the European Research Council (Marie Curie ERG 036569) and Marie Curie IEF 302204 to LVU\r\nCC BY 2.0\r\n","ddc":["570"],"pubrep_id":"402","file_date_updated":"2020-07-14T12:45:37Z","issue":"1","das_tickbox":"1","related_material":{"record":[{"relation":"research_data","status":"public","id":"9753"}]},"title":"Pupal cocoons affect sanitary brood care and limit fungal infections in ant colonies","publication":"BMC Evolutionary Biology","author":[{"id":"35A7A418-F248-11E8-B48F-1D18A9856A87","last_name":"Tragust","full_name":"Tragust, Simon","first_name":"Simon"},{"id":"3DC97C8E-F248-11E8-B48F-1D18A9856A87","last_name":"Ugelvig","first_name":"Line V","orcid":"0000-0003-1832-8883","full_name":"Ugelvig, Line V"},{"full_name":"Chapuisat, Michel","first_name":"Michel","last_name":"Chapuisat"},{"last_name":"Heinze","first_name":"Jürgen","full_name":"Heinze, Jürgen"},{"first_name":"Sylvia","orcid":"0000-0002-2193-3868","full_name":"Cremer, Sylvia","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","last_name":"Cremer"}],"fulldoi":"https://doi.org/10.1186/1471-2148-13-225","project":[{"grant_number":"243071","name":"Social Vaccination in Ant Colonies: from Individual Mechanisms to Society Effects","_id":"25DC711C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"name":"Host-Parasite Coevolution","grant_number":"CR-118/3-1","_id":"25DAF0B2-B435-11E9-9278-68D0E5697425"},{"_id":"25DDF0F0-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"302004","name":"Collective disease defence and pathogen detection abilities in ant societies: a chemo-neuro-immunological approach"}],"file":[{"file_name":"IST-2016-402-v1+1_1471-2148-13-225.pdf","date_created":"2018-12-12T10:13:41Z","file_size":281736,"access_level":"open_access","checksum":"c16ef36f2a10786a7885e19c4528d707","content_type":"application/pdf","creator":"system","relation":"main_file","file_id":"5026","date_updated":"2020-07-14T12:45:37Z"}]},{"title":"Nondeterminism in the presence of a diverse or unknown future","page":"89 - 100","author":[{"last_name":"Boker","id":"31E297B6-F248-11E8-B48F-1D18A9856A87","full_name":"Boker, Udi","first_name":"Udi"},{"first_name":"Denis","full_name":"Kuperberg, Denis","last_name":"Kuperberg"},{"full_name":"Kupferman, Orna","first_name":"Orna","last_name":"Kupferman"},{"full_name":"Skrzypczak, Michał","first_name":"Michał","last_name":"Skrzypczak"}],"file":[{"file_size":276982,"date_created":"2020-05-15T11:05:50Z","file_name":"2013_ICALP_Boker.pdf","file_id":"7857","date_updated":"2020-07-14T12:44:48Z","relation":"main_file","creator":"dernst","content_type":"application/pdf","checksum":"98bc02e3793072e279ec8d364b381ff3","access_level":"open_access"}],"project":[{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"Quantitative Reactive Modeling","grant_number":"267989","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"}],"fulldoi":"https://doi.org/10.1007/978-3-642-39212-2_11","conference":{"location":"Riga, Latvia","start_date":"2013-07-08","name":"ICALP: Automata, Languages and Programming","end_date":"2013-07-12"},"acknowledgement":"This work was supported in part by the Polish Ministry of Science grant no. N206 567840, Poland’s NCN grant no. DEC-2012/05/N/ST6/03254, Austrian Science Fund NFN RiSE (Rigorous Systems Engineering), ERC Advanced Grant QUAREM (Quantitative Reactive Modeling), and ERC Grant QUALITY. The full version is available at the authors’ URLs.","ddc":["000"],"issue":"PART 2","file_date_updated":"2020-07-14T12:44:48Z","das_tickbox":"1","scopus_import":"1","date_updated":"2026-07-28T09:26:19Z","doi":"10.1007/978-3-642-39212-2_11","ec_funded":1,"publisher":"Springer","volume":7966,"department":[{"_id":"ToHe"}],"year":"2013","citation":{"apa":"Boker, U., Kuperberg, D., Kupferman, O., &#38; Skrzypczak, M. (2013). Nondeterminism in the presence of a diverse or unknown future. Presented at the ICALP: Automata, Languages and Programming, Riga, Latvia: Springer. <a href=\"https://doi.org/10.1007/978-3-642-39212-2_11\">https://doi.org/10.1007/978-3-642-39212-2_11</a>","short":"U. Boker, D. Kuperberg, O. Kupferman, M. Skrzypczak, 7966 (2013) 89–100.","mla":"Boker, Udi, et al. <i>Nondeterminism in the Presence of a Diverse or Unknown Future</i>. Vol. 7966, no. PART 2, Springer, 2013, pp. 89–100, doi:<a href=\"https://doi.org/10.1007/978-3-642-39212-2_11\">10.1007/978-3-642-39212-2_11</a>.","ista":"Boker U, Kuperberg D, Kupferman O, Skrzypczak M. 2013. Nondeterminism in the presence of a diverse or unknown future. 7966(PART 2), 89–100.","ama":"Boker U, Kuperberg D, Kupferman O, Skrzypczak M. Nondeterminism in the presence of a diverse or unknown future. 2013;7966(PART 2):89-100. doi:<a href=\"https://doi.org/10.1007/978-3-642-39212-2_11\">10.1007/978-3-642-39212-2_11</a>","chicago":"Boker, Udi, Denis Kuperberg, Orna Kupferman, and Michał Skrzypczak. “Nondeterminism in the Presence of a Diverse or Unknown Future.” Lecture Notes in Computer Science. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-39212-2_11\">https://doi.org/10.1007/978-3-642-39212-2_11</a>.","ieee":"U. Boker, D. Kuperberg, O. Kupferman, and M. Skrzypczak, “Nondeterminism in the presence of a diverse or unknown future,” vol. 7966, no. PART 2. Springer, pp. 89–100, 2013."},"quality_controlled":"1","type":"conference","_id":"1387","day":"01","oa":1,"series_title":"Lecture Notes in Computer Science","date_created":"2018-12-11T11:51:44Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"07","intvolume":"      7966","oa_version":"Submitted Version","status":"public","has_accepted_license":"1","abstract":[{"lang":"eng","text":"Choices made by nondeterministic word automata depend on both the past (the prefix of the word read so far) and the future (the suffix yet to be read). In several applications, most notably synthesis, the future is diverse or unknown, leading to algorithms that are based on deterministic automata. Hoping to retain some of the advantages of nondeterministic automata, researchers have studied restricted classes of nondeterministic automata. Three such classes are nondeterministic automata that are good for trees (GFT; i.e., ones that can be expanded to tree automata accepting the derived tree languages, thus whose choices should satisfy diverse futures), good for games (GFG; i.e., ones whose choices depend only on the past), and determinizable by pruning (DBP; i.e., ones that embody equivalent deterministic automata). The theoretical properties and relative merits of the different classes are still open, having vagueness on whether they really differ from deterministic automata. In particular, while DBP ⊆ GFG ⊆ GFT, it is not known whether every GFT automaton is GFG and whether every GFG automaton is DBP. Also open is the possible succinctness of GFG and GFT automata compared to deterministic automata. We study these problems for ω-regular automata with all common acceptance conditions. We show that GFT=GFG⊃DBP, and describe a determinization construction for GFG automata."}],"publication_status":"published","date_published":"2013-07-01T00:00:00Z","article_processing_charge":"No","publist_id":"5823","language":[{"iso":"eng"}],"alternative_title":["LNCS"]},{"citation":{"ieee":"S. Almagor, U. Boker, and O. Kupferman, “Formalizing and reasoning about quality,” vol. 7966, no. Part 2. Springer, pp. 15–27, 2013.","chicago":"Almagor, Shaull, Udi Boker, and Orna Kupferman. “Formalizing and Reasoning about Quality.” Lecture Notes in Computer Science. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-39212-2_3\">https://doi.org/10.1007/978-3-642-39212-2_3</a>.","ama":"Almagor S, Boker U, Kupferman O. Formalizing and reasoning about quality. 2013;7966(Part 2):15-27. doi:<a href=\"https://doi.org/10.1007/978-3-642-39212-2_3\">10.1007/978-3-642-39212-2_3</a>","ista":"Almagor S, Boker U, Kupferman O. 2013. Formalizing and reasoning about quality. 7966(Part 2), 15–27.","mla":"Almagor, Shaull, et al. <i>Formalizing and Reasoning about Quality</i>. Vol. 7966, no. Part 2, Springer, 2013, pp. 15–27, doi:<a href=\"https://doi.org/10.1007/978-3-642-39212-2_3\">10.1007/978-3-642-39212-2_3</a>.","short":"S. Almagor, U. Boker, O. Kupferman, 7966 (2013) 15–27.","apa":"Almagor, S., Boker, U., &#38; Kupferman, O. (2013). Formalizing and reasoning about quality. Presented at the ICALP: Automata, Languages and Programming, Riga, Latvia: Springer. <a href=\"https://doi.org/10.1007/978-3-642-39212-2_3\">https://doi.org/10.1007/978-3-642-39212-2_3</a>"},"year":"2013","department":[{"_id":"ToHe"}],"volume":7966,"publisher":"Springer","ec_funded":1,"doi":"10.1007/978-3-642-39212-2_3","date_updated":"2026-07-28T09:28:40Z","scopus_import":"1","das_tickbox":"1","issue":"Part 2","file_date_updated":"2020-07-14T12:45:42Z","ddc":["000"],"acknowledgement":"This work was supported in part by the Austrian Science Fund NFN RiSE (Rigorous Systems Engineering), by the ERC Advanced Grant QUAREM (Quantitative Reactive Modeling), and the ERC Grant QUALITY. The full version is available at the authors’ URLs.","project":[{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","grant_number":"267989"}],"fulldoi":"https://doi.org/10.1007/978-3-642-39212-2_3","conference":{"location":"Riga, Latvia","name":"ICALP: Automata, Languages and Programming","end_date":"2013-07-12","start_date":"2013-07-08"},"file":[{"file_size":363031,"date_created":"2020-05-15T11:16:12Z","file_name":"2013_ICALP_Almagor.pdf","checksum":"85afbf6c18a2c7e377c52c9410e2d824","content_type":"application/pdf","file_id":"7860","relation":"main_file","date_updated":"2020-07-14T12:45:42Z","creator":"dernst","access_level":"open_access"}],"author":[{"last_name":"Almagor","full_name":"Almagor, Shaull","first_name":"Shaull"},{"id":"31E297B6-F248-11E8-B48F-1D18A9856A87","last_name":"Boker","full_name":"Boker, Udi","first_name":"Udi"},{"first_name":"Orna","full_name":"Kupferman, Orna","last_name":"Kupferman"}],"page":"15 - 27","title":"Formalizing and reasoning about quality","alternative_title":["LNCS"],"language":[{"iso":"eng"}],"publist_id":"4384","article_processing_charge":"No","date_published":"2013-07-01T00:00:00Z","publication_status":"published","status":"public","abstract":[{"text":"Traditional formal methods are based on a Boolean satisfaction notion: a reactive system satisfies, or not, a given specification. We generalize formal methods to also address the quality of systems. As an adequate specification formalism we introduce the linear temporal logic LTL[F]. The satisfaction value of an LTL[F] formula is a number between 0 and 1, describing the quality of the satisfaction. The logic generalizes traditional LTL by augmenting it with a (parameterized) set F of arbitrary functions over the interval [0,1]. For example, F may contain the maximum or minimum between the satisfaction values of subformulas, their product, and their average. The classical decision problems in formal methods, such as satisfiability, model checking, and synthesis, are generalized to search and optimization problems in the quantitative setting. For example, model checking asks for the quality in which a specification is satisfied, and synthesis returns a system satisfying the specification with the highest quality. Reasoning about quality gives rise to other natural questions, like the distance between specifications. We formalize these basic questions and study them for LTL[F]. By extending the automata-theoretic approach for LTL to a setting that takes quality into an account, we are able to solve the above problems and show that reasoning about LTL[F] has roughly the same complexity as reasoning about traditional LTL.","lang":"eng"}],"has_accepted_license":"1","oa_version":"Submitted Version","intvolume":"      7966","month":"07","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:58:08Z","series_title":"Lecture Notes in Computer Science","oa":1,"type":"conference","_id":"2517","day":"01","quality_controlled":"1"}]