[{"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1016/j.cub.2010.07.007"}],"extern":"1","department":[{"_id":"DaZi"}],"oa":1,"_id":"9489","title":"Evolution of eukaryotic DNA methylation and the pursuit of safer sex","publication_identifier":{"eissn":["1879-0445"],"issn":["0960-9822"]},"intvolume":" 20","quality_controlled":"1","article_type":"review","date_published":"2010-09-14T00:00:00Z","oa_version":"Published Version","publication_status":"published","year":"2010","issue":"17","citation":{"ista":"Zemach A, Zilberman D. 2010. Evolution of eukaryotic DNA methylation and the pursuit of safer sex. Current Biology. 20(17), R780–R785.","short":"A. Zemach, D. Zilberman, Current Biology 20 (2010) R780–R785.","chicago":"Zemach, Assaf, and Daniel Zilberman. “Evolution of Eukaryotic DNA Methylation and the Pursuit of Safer Sex.” Current Biology. Elsevier, 2010. https://doi.org/10.1016/j.cub.2010.07.007.","mla":"Zemach, Assaf, and Daniel Zilberman. “Evolution of Eukaryotic DNA Methylation and the Pursuit of Safer Sex.” Current Biology, vol. 20, no. 17, Elsevier, 2010, pp. R780–85, doi:10.1016/j.cub.2010.07.007.","apa":"Zemach, A., & Zilberman, D. (2010). Evolution of eukaryotic DNA methylation and the pursuit of safer sex. Current Biology. Elsevier. https://doi.org/10.1016/j.cub.2010.07.007","ieee":"A. Zemach and D. Zilberman, “Evolution of eukaryotic DNA methylation and the pursuit of safer sex,” Current Biology, vol. 20, no. 17. Elsevier, pp. R780–R785, 2010.","ama":"Zemach A, Zilberman D. Evolution of eukaryotic DNA methylation and the pursuit of safer sex. Current Biology. 2010;20(17):R780-R785. doi:10.1016/j.cub.2010.07.007"},"month":"09","author":[{"full_name":"Zemach, Assaf","last_name":"Zemach","first_name":"Assaf"},{"last_name":"Zilberman","first_name":"Daniel","full_name":"Zilberman, Daniel","orcid":"0000-0002-0123-8649","id":"6973db13-dd5f-11ea-814e-b3e5455e9ed1"}],"pmid":1,"page":"R780-R785","publication":"Current Biology","publisher":"Elsevier","date_updated":"2021-12-14T08:52:34Z","day":"14","type":"journal_article","status":"public","date_created":"2021-06-07T09:45:27Z","language":[{"iso":"eng"}],"scopus_import":"1","abstract":[{"lang":"eng","text":"Cytosine methylation is an ancient process with conserved enzymology but diverse biological functions that include defense against transposable elements and regulation of gene expression. Here we will discuss the evolution and biological significance of eukaryotic DNA methylation, the likely drivers of that evolution, and major remaining mysteries."}],"article_processing_charge":"No","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","external_id":{"pmid":["20833323"]},"doi":"10.1016/j.cub.2010.07.007","volume":20},{"doi":"10.1371/journal.pbio.1000429.s003","related_material":{"record":[{"status":"public","relation":"used_in_publication","id":"3779"}]},"month":"07","citation":{"mla":"Rosas, Ulises, et al. Heterosis and the Drift Load. Public Library of Science, 2010, doi:10.1371/journal.pbio.1000429.s003.","ieee":"U. Rosas, N. H. Barton, L. Copsey, P. Barbier De Reuille, and E. Coen, “Heterosis and the drift load.” Public Library of Science, 2010.","apa":"Rosas, U., Barton, N. H., Copsey, L., Barbier De Reuille, P., & Coen, E. (2010). Heterosis and the drift load. Public Library of Science. https://doi.org/10.1371/journal.pbio.1000429.s003","ama":"Rosas U, Barton NH, Copsey L, Barbier De Reuille P, Coen E. Heterosis and the drift load. 2010. doi:10.1371/journal.pbio.1000429.s003","ista":"Rosas U, Barton NH, Copsey L, Barbier De Reuille P, Coen E. 2010. Heterosis and the drift load, Public Library of Science, 10.1371/journal.pbio.1000429.s003.","chicago":"Rosas, Ulises, Nicholas H Barton, Lucy Copsey, Pierre Barbier De Reuille, and Enrico Coen. “Heterosis and the Drift Load.” Public Library of Science, 2010. https://doi.org/10.1371/journal.pbio.1000429.s003.","short":"U. Rosas, N.H. Barton, L. Copsey, P. Barbier De Reuille, E. Coen, (2010)."},"author":[{"first_name":"Ulises","last_name":"Rosas","full_name":"Rosas, Ulises"},{"full_name":"Barton, Nicholas H","last_name":"Barton","first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240"},{"first_name":"Lucy","last_name":"Copsey","full_name":"Copsey, Lucy"},{"full_name":"Barbier De Reuille, Pierre","last_name":"Barbier De Reuille","first_name":"Pierre"},{"full_name":"Coen, Enrico","last_name":"Coen","first_name":"Enrico"}],"year":"2010","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","oa_version":"Published Version","article_processing_charge":"No","date_published":"2010-07-20T00:00:00Z","type":"research_data_reference","day":"20","title":"Heterosis and the drift load","date_updated":"2025-09-30T09:42:52Z","_id":"9764","status":"public","date_created":"2021-08-02T09:45:39Z","department":[{"_id":"NiBa"}],"publisher":"Public Library of Science"},{"isi":1,"publication":"Evolution","publisher":"Wiley-Blackwell","page":"2701 - 2715","acknowledgement":"This work has made use of the resources provided by the Edinburgh Compute and Data Facility (ECDF). The ECDF is partially supported by the eDIKT initiative. NHB is supported in part by EPSRC Grant EP/E066070/1; JK is supported by EPSRC Grant EP/E066070/1; and AME is supported in part by EPSRC Grant EP/E065945/1.","date_created":"2018-12-11T11:46:40Z","status":"public","day":"01","type":"journal_article","date_updated":"2025-09-30T09:50:22Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","abstract":[{"text":"Classical models of gene flow fail in three ways: they cannot explain large-scale patterns; they predict much more genetic diversity than is observed; and they assume that loosely linked genetic loci evolve independently. We propose a new model that deals with these problems. Extinction events kill some fraction of individuals in a region. These are replaced by offspring from a small number of parents, drawn from the preexisting population. This model of evolution forwards in time corresponds to a backwards model, in which ancestral lineages jump to a new location if they are hit by an event, and may coalesce with other lineages that are hit by the same event. We derive an expression for the identity in allelic state, and show that, over scales much larger than the largest event, this converges to the classical value derived by Wright and Malécot. However, rare events that cover large areas cause low genetic diversity, large-scale patterns, and correlations in ancestry between unlinked loci.","lang":"eng"}],"article_processing_charge":"No","scopus_import":"1","language":[{"iso":"eng"}],"volume":64,"external_id":{"isi":["000281636400017"]},"doi":"10.1111/j.1558-5646.2010.01019.x","department":[{"_id":"NiBa"}],"publist_id":"2780","quality_controlled":"1","intvolume":" 64","_id":"474","title":"A new model for extinction and recolonization in two dimensions: Quantifying phylogeography","publication_status":"published","oa_version":"None","year":"2010","date_published":"2010-09-01T00:00:00Z","corr_author":"1","author":[{"first_name":"Nicholas H","last_name":"Barton","full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Kelleher, Jerome","first_name":"Jerome","last_name":"Kelleher"},{"last_name":"Etheridge","first_name":"Alison","full_name":"Etheridge, Alison"}],"issue":"9","citation":{"mla":"Barton, Nicholas H., et al. “A New Model for Extinction and Recolonization in Two Dimensions: Quantifying Phylogeography.” Evolution, vol. 64, no. 9, Wiley-Blackwell, 2010, pp. 2701–15, doi:10.1111/j.1558-5646.2010.01019.x.","ieee":"N. H. Barton, J. Kelleher, and A. Etheridge, “A new model for extinction and recolonization in two dimensions: Quantifying phylogeography,” Evolution, vol. 64, no. 9. Wiley-Blackwell, pp. 2701–2715, 2010.","apa":"Barton, N. H., Kelleher, J., & Etheridge, A. (2010). A new model for extinction and recolonization in two dimensions: Quantifying phylogeography. Evolution. Wiley-Blackwell. https://doi.org/10.1111/j.1558-5646.2010.01019.x","ama":"Barton NH, Kelleher J, Etheridge A. A new model for extinction and recolonization in two dimensions: Quantifying phylogeography. Evolution. 2010;64(9):2701-2715. doi:10.1111/j.1558-5646.2010.01019.x","ista":"Barton NH, Kelleher J, Etheridge A. 2010. A new model for extinction and recolonization in two dimensions: Quantifying phylogeography. Evolution. 64(9), 2701–2715.","chicago":"Barton, Nicholas H, Jerome Kelleher, and Alison Etheridge. “A New Model for Extinction and Recolonization in Two Dimensions: Quantifying Phylogeography.” Evolution. Wiley-Blackwell, 2010. https://doi.org/10.1111/j.1558-5646.2010.01019.x.","short":"N.H. Barton, J. Kelleher, A. Etheridge, Evolution 64 (2010) 2701–2715."},"month":"09"},{"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","abstract":[{"text":"Streaming string transducers [1] define (partial) functions from input strings to output strings. A streaming string transducer makes a single pass through the input string and uses a finite set of variables that range over strings from the output alphabet. At every step, the transducer processes an input symbol, and updates all the variables in parallel using assignments whose right-hand-sides are concatenations of output symbols and variables with the restriction that a variable can be used at most once in a right-hand-side expression. It has been shown that streaming string transducers operating on strings over infinite data domains are of interest in algorithmic verification of list-processing programs, as they lead to PSPACE decision procedures for checking pre/post conditions and for checking semantic equivalence, for a well-defined class of heap-manipulating programs. In order to understand the theoretical expressiveness of streaming transducers, we focus on streaming transducers processing strings over finite alphabets, given the existence of a robust and well-studied class of "regular" transductions for this case. Such regular transductions can be defined either by two-way deterministic finite-state transducers, or using a logical MSO-based characterization. Our main result is that the expressiveness of streaming string transducers coincides exactly with this class of regular transductions. ","lang":"eng"}],"article_processing_charge":"No","scopus_import":"1","language":[{"iso":"eng"}],"volume":8,"external_id":{"isi":["000310361000001"]},"doi":"10.4230/LIPIcs.FSTTCS.2010.1","pubrep_id":"948","isi":1,"file_date_updated":"2020-07-14T12:46:35Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)"},"page":"1 - 12","date_created":"2018-12-11T11:46:45Z","status":"public","day":"01","type":"conference","date_updated":"2025-09-30T09:49:32Z","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","publication_status":"published","oa_version":"Published Version","year":"2010","date_published":"2010-01-01T00:00:00Z","corr_author":"1","author":[{"first_name":"Rajeev","last_name":"Alur","full_name":"Alur, Rajeev"},{"id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","full_name":"Cerny, Pavol","first_name":"Pavol","last_name":"Cerny"}],"citation":{"ieee":"R. Alur and P. Cerny, “Expressiveness of streaming string transducers,” presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Chennai, India, 2010, vol. 8, pp. 1–12.","apa":"Alur, R., & Cerny, P. (2010). Expressiveness of streaming string transducers (Vol. 8, pp. 1–12). Presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Chennai, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.FSTTCS.2010.1","mla":"Alur, Rajeev, and Pavol Cerny. Expressiveness of Streaming String Transducers. Vol. 8, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 1–12, doi:10.4230/LIPIcs.FSTTCS.2010.1.","ama":"Alur R, Cerny P. Expressiveness of streaming string transducers. In: Vol 8. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2010:1-12. doi:10.4230/LIPIcs.FSTTCS.2010.1","short":"R. Alur, P. Cerny, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 1–12.","chicago":"Alur, Rajeev, and Pavol Cerny. “Expressiveness of Streaming String Transducers,” 8:1–12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010. https://doi.org/10.4230/LIPIcs.FSTTCS.2010.1.","ista":"Alur R, Cerny P. 2010. Expressiveness of streaming string transducers. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 8, 1–12."},"month":"01","ddc":["005"],"has_accepted_license":"1","oa":1,"department":[{"_id":"ToHe"}],"publist_id":"7331","conference":{"end_date":"2010-12-18","start_date":"2010-12-15","name":"FSTTCS: Foundations of Software Technology and Theoretical Computer Science","location":"Chennai, India"},"quality_controlled":"1","alternative_title":["LIPIcs"],"intvolume":" 8","file":[{"creator":"system","file_size":492344,"date_created":"2018-12-12T10:08:29Z","file_id":"4690","access_level":"open_access","date_updated":"2020-07-14T12:46:35Z","content_type":"application/pdf","relation":"main_file","checksum":"5845be5aa19791830f7407d8853f2df0","file_name":"IST-2018-948-v1+1_2011_Cerny_Expressiveness_of.pdf"}],"_id":"488","title":"Expressiveness of streaming string transducers"},{"scopus_import":"1","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"Graph games of infinite length are a natural model for open reactive processes: one player represents the controller, trying to ensure a given specification, and the other represents a hostile environment. The evolution of the system depends on the decisions of both players, supplemented by chance. In this work, we focus on the notion of randomised strategy. More specifically, we show that three natural definitions may lead to very different results: in the most general cases, an almost-surely winning situation may become almost-surely losing if the player is only allowed to use a weaker notion of strategy. In more reasonable settings, translations exist, but they require infinite memory, even in simple cases. Finally, some traditional problems becomes undecidable for the strongest type of strategies.","lang":"eng"}],"article_processing_charge":"No","external_id":{"arxiv":["1006.1404"]},"doi":"10.4204/EPTCS.25.7","volume":25,"page":"30 - 39","publication":"Proceedings of GandALF 2010","publisher":"Open Publishing Association","day":"09","type":"conference","date_updated":"2025-06-11T08:14:27Z","arxiv":1,"status":"public","date_created":"2018-12-11T11:46:45Z","corr_author":"1","oa_version":"Published Version","publication_status":"published","year":"2010","date_published":"2010-06-09T00:00:00Z","citation":{"ista":"Cristau J, David C, Horn F. 2010. How do we remember the past in randomised strategies? Proceedings of GandALF 2010. GandALF: Games, Automata, Logic, and Formal Verification, EPTCS, vol. 25, 30–39.","chicago":"Cristau, Julien, Claire David, and Florian Horn. “How Do We Remember the Past in Randomised Strategies?” In Proceedings of GandALF 2010, 25:30–39. Open Publishing Association, 2010. https://doi.org/10.4204/EPTCS.25.7.","short":"J. Cristau, C. David, F. Horn, in:, Proceedings of GandALF 2010, Open Publishing Association, 2010, pp. 30–39.","ama":"Cristau J, David C, Horn F. How do we remember the past in randomised strategies? In: Proceedings of GandALF 2010. Vol 25. Open Publishing Association; 2010:30-39. doi:10.4204/EPTCS.25.7","mla":"Cristau, Julien, et al. “How Do We Remember the Past in Randomised Strategies?” Proceedings of GandALF 2010, vol. 25, Open Publishing Association, 2010, pp. 30–39, doi:10.4204/EPTCS.25.7.","apa":"Cristau, J., David, C., & Horn, F. (2010). How do we remember the past in randomised strategies? In Proceedings of GandALF 2010 (Vol. 25, pp. 30–39). Minori, Amalfi Coast, Italy: Open Publishing Association. https://doi.org/10.4204/EPTCS.25.7","ieee":"J. Cristau, C. David, and F. Horn, “How do we remember the past in randomised strategies?,” in Proceedings of GandALF 2010, Minori, Amalfi Coast, Italy, 2010, vol. 25, pp. 30–39."},"month":"06","author":[{"full_name":"Cristau, Julien","first_name":"Julien","last_name":"Cristau"},{"full_name":"David, Claire","first_name":"Claire","last_name":"David"},{"id":"37327ACE-F248-11E8-B48F-1D18A9856A87","full_name":"Horn, Florian","last_name":"Horn","first_name":"Florian"}],"department":[{"_id":"KrCh"}],"publist_id":"7332","conference":{"name":"GandALF: Games, Automata, Logic, and Formal Verification","end_date":"2010-06-18","start_date":"2010-06-17","location":"Minori, Amalfi Coast, Italy"},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1006.1404"}],"oa":1,"_id":"489","title":"How do we remember the past in randomised strategies?","quality_controlled":"1","alternative_title":["EPTCS"],"intvolume":" 25"},{"type":"journal_article","day":"01","date_updated":"2025-09-30T09:48:58Z","status":"public","date_created":"2018-12-11T11:47:01Z","page":"171 - 199","isi":1,"publisher":"Springer","publication":"Formal Methods in System Design","doi":"10.1007/s10703-010-0102-0","external_id":{"isi":["000286631700004"]},"volume":37,"scopus_import":"1","language":[{"iso":"eng"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","article_processing_charge":"No","abstract":[{"text":"Any programming error that can be revealed before compiling a program saves precious time for the programmer. While integrated development environments already do a good job by detecting, e.g., data-flow abnormalities, current static analysis tools suffer from false positives ("noise") or require strong user interaction. We propose to avoid this deficiency by defining a new class of errors. A program fragment is doomed if its execution will inevitably fail, regardless of which state it is started in. We use a formal verification method to identify such errors fully automatically and, most significantly, without producing noise. We report on experiments with a prototype tool.","lang":"eng"}],"title":"Doomed program points","_id":"533","quality_controlled":"1","intvolume":" 37","publist_id":"7284","department":[{"_id":"ToHe"}],"month":"12","issue":"2-3","citation":{"ista":"Hoenicke J, Leino K, Podelski A, Schäf M, Wies T. 2010. Doomed program points. Formal Methods in System Design. 37(2–3), 171–199.","chicago":"Hoenicke, Jochen, Kari Leino, Andreas Podelski, Martin Schäf, and Thomas Wies. “Doomed Program Points.” Formal Methods in System Design. Springer, 2010. https://doi.org/10.1007/s10703-010-0102-0.","short":"J. Hoenicke, K. Leino, A. Podelski, M. Schäf, T. Wies, Formal Methods in System Design 37 (2010) 171–199.","mla":"Hoenicke, Jochen, et al. “Doomed Program Points.” Formal Methods in System Design, vol. 37, no. 2–3, Springer, 2010, pp. 171–99, doi:10.1007/s10703-010-0102-0.","ieee":"J. Hoenicke, K. Leino, A. Podelski, M. Schäf, and T. Wies, “Doomed program points,” Formal Methods in System Design, vol. 37, no. 2–3. Springer, pp. 171–199, 2010.","apa":"Hoenicke, J., Leino, K., Podelski, A., Schäf, M., & Wies, T. (2010). Doomed program points. Formal Methods in System Design. Springer. https://doi.org/10.1007/s10703-010-0102-0","ama":"Hoenicke J, Leino K, Podelski A, Schäf M, Wies T. Doomed program points. Formal Methods in System Design. 2010;37(2-3):171-199. doi:10.1007/s10703-010-0102-0"},"author":[{"full_name":"Hoenicke, Jochen","first_name":"Jochen","last_name":"Hoenicke"},{"full_name":"Leino, Kari","last_name":"Leino","first_name":"Kari"},{"full_name":"Podelski, Andreas","last_name":"Podelski","first_name":"Andreas"},{"first_name":"Martin","last_name":"Schäf","full_name":"Schäf, Martin"},{"full_name":"Wies, Thomas","last_name":"Wies","first_name":"Thomas","id":"447BFB88-F248-11E8-B48F-1D18A9856A87"}],"corr_author":"1","year":"2010","publication_status":"published","oa_version":"None","date_published":"2010-12-01T00:00:00Z"},{"year":"2010","oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","abstract":[{"lang":"eng","text":"We present an algorithmic method for the synthesis of concurrent programs that are optimal with respect to quantitative performance measures. The input consists of a sequential sketch, that is, a program that does not contain synchronization constructs, and of a parametric performance model that assigns costs to actions such as locking, context switching, and idling. The quantitative synthesis problem is to automatically introduce synchronization constructs into the sequential sketch so that both correctness is guaranteed and worst-case (or average-case) performance is optimized. Correctness is formalized as race freedom or linearizability.\r\n\r\nWe show that for worst-case performance, the problem can be modeled\r\nas a 2-player graph game with quantitative (limit-average) objectives, and\r\nfor average-case performance, as a 2 1/2 -player graph game (with probabilistic transitions). In both cases, the optimal correct program is derived from an optimal strategy in the corresponding quantitative game. We prove that the respective game problems are computationally expensive (NP-complete), and present several techniques that overcome the theoretical difficulty in cases of concurrent programs of practical interest.\r\n\r\nWe have implemented a prototype tool and used it for the automatic syn- thesis of programs that access a concurrent list. For certain parameter val- ues, our method automatically synthesizes various classical synchronization schemes for implementing a concurrent list, such as fine-grained locking or a lazy algorithm. For other parameter values, a new, hybrid synchronization style is synthesized, which uses both the lazy approach and coarse-grained locks (instead of standard fine-grained locks). The trade-off occurs because while fine-grained locking tends to decrease the cost that is due to waiting for locks, it increases cache size requirements."}],"date_published":"2010-10-07T00:00:00Z","language":[{"iso":"eng"}],"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee"},{"last_name":"Cerny","first_name":"Pavol","full_name":"Cerny, Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Arjun","last_name":"Radhakrishna","full_name":"Radhakrishna, Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Rohit","last_name":"Singh","full_name":"Singh, Rohit"}],"doi":"10.15479/AT:IST-2010-0004","related_material":{"record":[{"id":"3366","status":"public","relation":"later_version"}]},"month":"10","pubrep_id":"24","citation":{"ista":"Chatterjee K, Cerny P, Henzinger TA, Radhakrishna A, Singh R. 2010. Quantitative synthesis for concurrent programs, IST Austria, 17p.","chicago":"Chatterjee, Krishnendu, Pavol Cerny, Thomas A Henzinger, Arjun Radhakrishna, and Rohit Singh. Quantitative Synthesis for Concurrent Programs. IST Austria, 2010. https://doi.org/10.15479/AT:IST-2010-0004.","short":"K. Chatterjee, P. Cerny, T.A. Henzinger, A. Radhakrishna, R. Singh, Quantitative Synthesis for Concurrent Programs, IST Austria, 2010.","mla":"Chatterjee, Krishnendu, et al. Quantitative Synthesis for Concurrent Programs. IST Austria, 2010, doi:10.15479/AT:IST-2010-0004.","ieee":"K. Chatterjee, P. Cerny, T. A. Henzinger, A. Radhakrishna, and R. Singh, Quantitative synthesis for concurrent programs. IST Austria, 2010.","apa":"Chatterjee, K., Cerny, P., Henzinger, T. A., Radhakrishna, A., & Singh, R. (2010). Quantitative synthesis for concurrent programs. IST Austria. https://doi.org/10.15479/AT:IST-2010-0004","ama":"Chatterjee K, Cerny P, Henzinger TA, Radhakrishna A, Singh R. Quantitative Synthesis for Concurrent Programs. IST Austria; 2010. doi:10.15479/AT:IST-2010-0004"},"has_accepted_license":"1","file_date_updated":"2020-07-14T12:46:42Z","ddc":["000","005"],"publisher":"IST Austria","oa":1,"page":"17","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"alternative_title":["IST Austria Technical Report"],"date_created":"2018-12-12T11:39:03Z","status":"public","type":"technical_report","publication_identifier":{"issn":["2664-1690"]},"day":"07","file":[{"creator":"system","date_created":"2018-12-12T11:53:53Z","file_size":429101,"file_id":"5515","access_level":"open_access","date_updated":"2020-07-14T12:46:42Z","content_type":"application/pdf","relation":"main_file","checksum":"da38782d2388a6fa32109d10bb9bad67","file_name":"IST-2010-0004_IST-2010-0004.pdf"}],"title":"Quantitative synthesis for concurrent programs","date_updated":"2025-04-15T08:12:00Z","_id":"5388"},{"author":[{"first_name":"Pavol","last_name":"Cerny","full_name":"Cerny, Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","first_name":"Arjun","last_name":"Radhakrishna","full_name":"Radhakrishna, Arjun"}],"related_material":{"record":[{"id":"4393","relation":"later_version","status":"public"},{"id":"3249","status":"public","relation":"later_version"}]},"doi":"10.15479/AT:IST-2010-0003","month":"06","pubrep_id":"25","citation":{"apa":"Cerny, P., Henzinger, T. A., & Radhakrishna, A. (2010). Simulation distances. IST Austria. https://doi.org/10.15479/AT:IST-2010-0003","ieee":"P. Cerny, T. A. Henzinger, and A. Radhakrishna, Simulation distances. IST Austria, 2010.","mla":"Cerny, Pavol, et al. Simulation Distances. IST Austria, 2010, doi:10.15479/AT:IST-2010-0003.","ama":"Cerny P, Henzinger TA, Radhakrishna A. Simulation Distances. IST Austria; 2010. doi:10.15479/AT:IST-2010-0003","chicago":"Cerny, Pavol, Thomas A Henzinger, and Arjun Radhakrishna. Simulation Distances. IST Austria, 2010. https://doi.org/10.15479/AT:IST-2010-0003.","short":"P. Cerny, T.A. Henzinger, A. Radhakrishna, Simulation Distances, IST Austria, 2010.","ista":"Cerny P, Henzinger TA, Radhakrishna A. 2010. Simulation distances, IST Austria, 24p."},"year":"2010","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","publication_status":"published","date_published":"2010-06-04T00:00:00Z","abstract":[{"lang":"eng","text":"Boolean notions of correctness are formalized by preorders on systems. Quantitative measures of correctness can be formalized by real-valued distance functions between systems, where the distance between implementation and specification provides a measure of “fit” or “desirability.” We extend the simulation preorder to the quantitative setting, by making each player of a simulation game pay a certain price for her choices. We use the resulting games with quantitative objectives to define three different simulation distances. The correctness distance measures how much the specification must be changed in order to be satisfied by the implementation. The coverage distance measures how much the im- plementation restricts the degrees of freedom offered by the specification. The robustness distance measures how much a system can deviate from the implementation description without violating the specification. We consider these distances for safety as well as liveness specifications. The distances can be computed in polynomial time for safety specifications, and for liveness specifications given by weak fairness constraints. We show that the distance functions satisfy the triangle inequality, that the distance between two systems does not increase under parallel composition with a third system, and that the distance between two systems can be bounded from above and below by distances between abstractions of the two systems. These properties suggest that our simulation distances provide an appropriate basis for a quantitative theory of discrete systems. We also demonstrate how the robustness distance can be used to measure how many transmission errors are tolerated by error correcting codes."}],"language":[{"iso":"eng"}],"alternative_title":["IST Austria Technical Report"],"date_created":"2018-12-12T11:39:03Z","status":"public","publication_identifier":{"issn":["2664-1690"]},"type":"technical_report","day":"04","file":[{"file_name":"IST-2010-0003_IST-2010-0003.pdf","checksum":"284ded99764e32a583a8ea83fcea254b","relation":"main_file","content_type":"application/pdf","date_updated":"2020-07-14T12:46:42Z","access_level":"open_access","file_id":"5547","file_size":367246,"date_created":"2018-12-12T11:54:25Z","creator":"system"}],"date_updated":"2025-09-30T07:46:05Z","title":"Simulation distances","_id":"5389","file_date_updated":"2020-07-14T12:46:42Z","has_accepted_license":"1","ddc":["005"],"publisher":"IST Austria","oa":1,"page":"24","department":[{"_id":"ToHe"}]},{"citation":{"ieee":"K. Chatterjee and N. Fijalkow, Topological, automata-theoretic and logical characterization of finitary languages. IST Austria, 2010.","apa":"Chatterjee, K., & Fijalkow, N. (2010). Topological, automata-theoretic and logical characterization of finitary languages. IST Austria. https://doi.org/10.15479/AT:IST-2010-0002","mla":"Chatterjee, Krishnendu, and Nathanaël Fijalkow. Topological, Automata-Theoretic and Logical Characterization of Finitary Languages. IST Austria, 2010, doi:10.15479/AT:IST-2010-0002.","ama":"Chatterjee K, Fijalkow N. Topological, Automata-Theoretic and Logical Characterization of Finitary Languages. IST Austria; 2010. doi:10.15479/AT:IST-2010-0002","short":"K. Chatterjee, N. Fijalkow, Topological, Automata-Theoretic and Logical Characterization of Finitary Languages, IST Austria, 2010.","chicago":"Chatterjee, Krishnendu, and Nathanaël Fijalkow. Topological, Automata-Theoretic and Logical Characterization of Finitary Languages. IST Austria, 2010. https://doi.org/10.15479/AT:IST-2010-0002.","ista":"Chatterjee K, Fijalkow N. 2010. Topological, automata-theoretic and logical characterization of finitary languages, IST Austria, 21p."},"month":"06","pubrep_id":"26","doi":"10.15479/AT:IST-2010-0002","author":[{"last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"first_name":"Nathanaël","last_name":"Fijalkow","full_name":"Fijalkow, Nathanaël"}],"language":[{"iso":"eng"}],"date_published":"2010-06-04T00:00:00Z","abstract":[{"lang":"eng","text":"The class of ω regular languages provide a robust specification language in verification. Every ω-regular condition can be decomposed into a safety part and a liveness part. The liveness part ensures that something good happens “eventually.” Two main strengths of the classical, infinite-limit formulation of liveness are robustness (independence from the granularity of transitions) and simplicity (abstraction of complicated time bounds). However, the classical liveness formulation suffers from the drawback that the time until something good happens may be unbounded. A stronger formulation of liveness, so-called finitary liveness, overcomes this drawback, while still retaining robustness and simplicity. Finitary liveness requires that there exists an unknown, fixed bound b such that something good happens within b transitions. In this work we consider the finitary parity and Streett (fairness) conditions. We present the topological, automata-theoretic and logical characterization of finitary languages defined by finitary parity and Streett conditions. We (a) show that the finitary parity and Streett languages are Σ2-complete; (b) present a complete characterization of the expressive power of various classes of automata with finitary and infinitary conditions (in particular we show that non-deterministic finitary parity and Streett automata cannot be determinized to deterministic finitary parity or Streett automata); and (c) show that the languages defined by non-deterministic finitary parity automata exactly characterize the star-free fragment of ωB-regular languages."}],"publication_status":"published","oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2010","_id":"5390","title":"Topological, automata-theoretic and logical characterization of finitary languages","date_updated":"2020-07-14T23:04:41Z","file":[{"checksum":"283d3604d76dd4d5161585d4c8625fbe","file_name":"IST-2010-0002_IST-2010-0002.pdf","relation":"main_file","content_type":"application/pdf","date_updated":"2020-07-14T12:46:43Z","access_level":"open_access","date_created":"2018-12-12T11:54:10Z","file_size":395662,"file_id":"5532","creator":"system"}],"day":"04","type":"technical_report","publication_identifier":{"issn":["2664-1690"]},"date_created":"2018-12-12T11:39:03Z","status":"public","alternative_title":["IST Austria Technical Report"],"department":[{"_id":"KrCh"}],"page":"21","oa":1,"publisher":"IST Austria","ddc":["000"],"has_accepted_license":"1","file_date_updated":"2020-07-14T12:46:43Z"},{"publisher":"IST Austria","oa":1,"has_accepted_license":"1","file_date_updated":"2020-07-14T12:46:43Z","ddc":["004"],"department":[{"_id":"ToHe"}],"page":"27","date_created":"2018-12-12T11:39:04Z","status":"public","alternative_title":["IST Austria Technical Report"],"date_updated":"2024-10-21T06:03:05Z","title":"Model checking of linearizability of concurrent list implementations","_id":"5391","type":"technical_report","publication_identifier":{"issn":["2664-1690"]},"file":[{"access_level":"open_access","date_updated":"2020-07-14T12:46:43Z","creator":"system","date_created":"2018-12-12T11:53:44Z","file_size":372286,"file_id":"5505","checksum":"986645caad7dd85a6a091488f6c646dc","file_name":"IST-2010-0001_IST-2010-0001.pdf","content_type":"application/pdf","relation":"main_file"}],"day":"19","abstract":[{"text":"Concurrent data structures with fine-grained synchronization are notoriously difficult to implement correctly. The difficulty of reasoning about these implementations does not stem from the number of variables or the program size, but rather from the large number of possible interleavings. These implementations are therefore prime candidates for model checking. We introduce an algorithm for verifying linearizability of singly-linked heap-based concurrent data structures. We consider a model consisting of an unbounded heap where each node consists an element from an unbounded data domain, with a restricted set of operations for testing and updating pointers and data elements. Our main result is that linearizability is decidable for programs that invoke a fixed number of methods, possibly in parallel. This decidable fragment covers many of the common implementation techniques — fine-grained locking, lazy synchronization, and lock-free synchronization. We also show how the technique can be used to verify optimistic implementations with the help of programmer annotations. We developed a verification tool CoLT and evaluated it on a representative sample of Java implementations of the concurrent set data structure. The tool verified linearizability of a number of implementations, found a known error in a lock-free imple- mentation and proved that the corrected version is linearizable.","lang":"eng"}],"date_published":"2010-04-19T00:00:00Z","year":"2010","oa_version":"Published Version","publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"author":[{"full_name":"Cerny, Pavol","last_name":"Cerny","first_name":"Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87"},{"id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","full_name":"Radhakrishna, Arjun","last_name":"Radhakrishna","first_name":"Arjun"},{"orcid":"0000-0002-3197-8736","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","first_name":"Damien","last_name":"Zufferey","full_name":"Zufferey, Damien"},{"first_name":"Swarat","last_name":"Chaudhuri","full_name":"Chaudhuri, Swarat"},{"full_name":"Alur, Rajeev","last_name":"Alur","first_name":"Rajeev"}],"pubrep_id":"27","month":"04","citation":{"apa":"Cerny, P., Radhakrishna, A., Zufferey, D., Chaudhuri, S., & Alur, R. (2010). Model checking of linearizability of concurrent list implementations. IST Austria. https://doi.org/10.15479/AT:IST-2010-0001","ieee":"P. Cerny, A. Radhakrishna, D. Zufferey, S. Chaudhuri, and R. Alur, Model checking of linearizability of concurrent list implementations. IST Austria, 2010.","mla":"Cerny, Pavol, et al. Model Checking of Linearizability of Concurrent List Implementations. IST Austria, 2010, doi:10.15479/AT:IST-2010-0001.","ama":"Cerny P, Radhakrishna A, Zufferey D, Chaudhuri S, Alur R. Model Checking of Linearizability of Concurrent List Implementations. IST Austria; 2010. doi:10.15479/AT:IST-2010-0001","short":"P. Cerny, A. Radhakrishna, D. Zufferey, S. Chaudhuri, R. Alur, Model Checking of Linearizability of Concurrent List Implementations, IST Austria, 2010.","chicago":"Cerny, Pavol, Arjun Radhakrishna, Damien Zufferey, Swarat Chaudhuri, and Rajeev Alur. Model Checking of Linearizability of Concurrent List Implementations. IST Austria, 2010. https://doi.org/10.15479/AT:IST-2010-0001.","ista":"Cerny P, Radhakrishna A, Zufferey D, Chaudhuri S, Alur R. 2010. Model checking of linearizability of concurrent list implementations, IST Austria, 27p."},"related_material":{"record":[{"id":"4390","status":"public","relation":"later_version"}]},"doi":"10.15479/AT:IST-2010-0001"},{"page":"1-17","extern":"1","publication":"Applications and Theory of Petri Nets","publisher":"Springer Berlin Heidelberg","type":"book_chapter","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642136740","9783642136757"]},"_id":"5940","date_updated":"2022-04-01T13:45:24Z","title":"Instance Deadlock: A Mystery behind Frozen Programs","status":"public","date_created":"2019-02-08T09:33:41Z","place":"Berlin, Heidelberg","language":[{"iso":"eng"}],"user_id":"4A997E50-F248-11E8-B48F-1D18A9856A87","publication_status":"published","oa_version":"None","year":"2010","date_published":"2010-01-01T00:00:00Z","article_processing_charge":"No","doi":"10.1007/978-3-642-13675-7_1","citation":{"ista":"Juhás G, Kazlov I, Juhásová A. 2010.Instance Deadlock: A Mystery behind Frozen Programs. In: Applications and Theory of Petri Nets. , 1–17.","short":"G. Juhás, I. Kazlov, A. Juhásová, in:, Applications and Theory of Petri Nets, Springer Berlin Heidelberg, Berlin, Heidelberg, 2010, pp. 1–17.","chicago":"Juhás, Gabriel, Igor Kazlov, and Ana Juhásová. “Instance Deadlock: A Mystery behind Frozen Programs.” In Applications and Theory of Petri Nets, 1–17. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. https://doi.org/10.1007/978-3-642-13675-7_1.","mla":"Juhás, Gabriel, et al. “Instance Deadlock: A Mystery behind Frozen Programs.” Applications and Theory of Petri Nets, Springer Berlin Heidelberg, 2010, pp. 1–17, doi:10.1007/978-3-642-13675-7_1.","ieee":"G. Juhás, I. Kazlov, and A. Juhásová, “Instance Deadlock: A Mystery behind Frozen Programs,” in Applications and Theory of Petri Nets, Berlin, Heidelberg: Springer Berlin Heidelberg, 2010, pp. 1–17.","apa":"Juhás, G., Kazlov, I., & Juhásová, A. (2010). Instance Deadlock: A Mystery behind Frozen Programs. In Applications and Theory of Petri Nets (pp. 1–17). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-13675-7_1","ama":"Juhás G, Kazlov I, Juhásová A. Instance Deadlock: A Mystery behind Frozen Programs. In: Applications and Theory of Petri Nets. Berlin, Heidelberg: Springer Berlin Heidelberg; 2010:1-17. doi:10.1007/978-3-642-13675-7_1"},"author":[{"full_name":"Juhás, Gabriel","first_name":"Gabriel","last_name":"Juhás"},{"id":"4A997E50-F248-11E8-B48F-1D18A9856A87","first_name":"Igor","last_name":"Kazlov","full_name":"Kazlov, Igor"},{"last_name":"Juhásová","first_name":"Ana","full_name":"Juhásová, Ana"}]},{"day":"01","type":"journal_article","_id":"598","title":"P53 activates transcription by directing structural shifts in Mediator","date_updated":"2021-01-12T08:05:28Z","status":"public","date_created":"2018-12-11T11:47:24Z","intvolume":" 17","page":"753 - 760","publist_id":"7210","main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2932482/"}],"extern":"1","oa":1,"publication":"Nature Structural and Molecular Biology","publisher":"Nature Publishing Group","doi":"10.1038/nsmb.1816","issue":"6","citation":{"ama":"Meyer K, Lin S, Bernecky C, Gao Y, Taatjes D. P53 activates transcription by directing structural shifts in Mediator. Nature Structural and Molecular Biology. 2010;17(6):753-760. doi:10.1038/nsmb.1816","mla":"Meyer, Krista, et al. “P53 Activates Transcription by Directing Structural Shifts in Mediator.” Nature Structural and Molecular Biology, vol. 17, no. 6, Nature Publishing Group, 2010, pp. 753–60, doi:10.1038/nsmb.1816.","apa":"Meyer, K., Lin, S., Bernecky, C., Gao, Y., & Taatjes, D. (2010). P53 activates transcription by directing structural shifts in Mediator. Nature Structural and Molecular Biology. Nature Publishing Group. https://doi.org/10.1038/nsmb.1816","ieee":"K. Meyer, S. Lin, C. Bernecky, Y. Gao, and D. Taatjes, “P53 activates transcription by directing structural shifts in Mediator,” Nature Structural and Molecular Biology, vol. 17, no. 6. Nature Publishing Group, pp. 753–760, 2010.","ista":"Meyer K, Lin S, Bernecky C, Gao Y, Taatjes D. 2010. P53 activates transcription by directing structural shifts in Mediator. Nature Structural and Molecular Biology. 17(6), 753–760.","chicago":"Meyer, Krista, Shih Lin, Carrie Bernecky, Yuefeng Gao, and Dylan Taatjes. “P53 Activates Transcription by Directing Structural Shifts in Mediator.” Nature Structural and Molecular Biology. Nature Publishing Group, 2010. https://doi.org/10.1038/nsmb.1816.","short":"K. Meyer, S. Lin, C. Bernecky, Y. Gao, D. Taatjes, Nature Structural and Molecular Biology 17 (2010) 753–760."},"month":"06","volume":17,"author":[{"full_name":"Meyer, Krista","last_name":"Meyer","first_name":"Krista"},{"full_name":"Lin, Shih","first_name":"Shih","last_name":"Lin"},{"orcid":"0000-0003-0893-7036","id":"2CB9DFE2-F248-11E8-B48F-1D18A9856A87","last_name":"Bernecky","first_name":"Carrie A","full_name":"Bernecky, Carrie A"},{"full_name":"Gao, Yuefeng","first_name":"Yuefeng","last_name":"Gao"},{"last_name":"Taatjes","first_name":"Dylan","full_name":"Taatjes, Dylan"}],"language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"None","publication_status":"published","year":"2010","date_published":"2010-06-01T00:00:00Z","abstract":[{"lang":"eng","text":"It is not well understood how the human Mediator complex, transcription factor IIH and RNA polymerase II (Pol II) work together with activators to initiate transcription. Activator binding alters Mediator structure, yet the functional consequences of such structural shifts remain unknown. The p53 C terminus and its activation domain interact with different Mediator subunits, and we find that each interaction differentially affects Mediator structure; strikingly, distinct p53-Mediator structures differentially affect Pol II activity. Only the p53 activation domain induces the formation of a large pocket domain at the Mediator-Pol II interaction site, and this correlates with activation of stalled Pol II to a productively elongating state. Moreover, we define a Mediator requirement for TFIIH-dependent Pol II C-terminal domain phosphorylation and identify substantial differences in Pol II C-terminal domain processing that correspond to distinct p53-Mediator structural states. Our results define a fundamental mechanism by which p53 activates transcription and suggest that Mediator structural shifts trigger activation of stalled Pol II complexes."}],"article_processing_charge":"No"},{"publication_identifier":{"issn":["1932-6203"]},"file":[{"relation":"main_file","content_type":"application/pdf","checksum":"a01e6bbe15f044c0c79a26d7d881953e","file_name":"2010_PLOS_Weber.PDF","file_size":578059,"date_created":"2019-03-20T15:22:48Z","file_id":"6143","creator":"kschuh","date_updated":"2020-07-14T12:47:20Z","access_level":"open_access"}],"title":"Whole genome sequencing highlights genetic changes associated with laboratory domestication of C. elegans","_id":"6142","quality_controlled":"1","intvolume":" 5","extern":"1","has_accepted_license":"1","ddc":["570"],"oa":1,"month":"11","issue":"11","citation":{"ama":"Weber KP, De S, Kozarewa I, Turner DJ, Babu MM, de Bono M. Whole genome sequencing highlights genetic changes associated with laboratory domestication of C. elegans. PLoS ONE. 2010;5(11). doi:10.1371/journal.pone.0013922","ieee":"K. P. Weber, S. De, I. Kozarewa, D. J. Turner, M. M. Babu, and M. de Bono, “Whole genome sequencing highlights genetic changes associated with laboratory domestication of C. elegans,” PLoS ONE, vol. 5, no. 11. Public Library of Science, 2010.","apa":"Weber, K. P., De, S., Kozarewa, I., Turner, D. J., Babu, M. M., & de Bono, M. (2010). Whole genome sequencing highlights genetic changes associated with laboratory domestication of C. elegans. PLoS ONE. Public Library of Science. https://doi.org/10.1371/journal.pone.0013922","mla":"Weber, Katherine P., et al. “Whole Genome Sequencing Highlights Genetic Changes Associated with Laboratory Domestication of C. Elegans.” PLoS ONE, vol. 5, no. 11, e13922, Public Library of Science, 2010, doi:10.1371/journal.pone.0013922.","chicago":"Weber, Katherine P., Subhajyoti De, Iwanka Kozarewa, Daniel J. Turner, M. Madan Babu, and Mario de Bono. “Whole Genome Sequencing Highlights Genetic Changes Associated with Laboratory Domestication of C. Elegans.” PLoS ONE. Public Library of Science, 2010. https://doi.org/10.1371/journal.pone.0013922.","short":"K.P. Weber, S. De, I. Kozarewa, D.J. Turner, M.M. Babu, M. de Bono, PLoS ONE 5 (2010).","ista":"Weber KP, De S, Kozarewa I, Turner DJ, Babu MM, de Bono M. 2010. Whole genome sequencing highlights genetic changes associated with laboratory domestication of C. elegans. PLoS ONE. 5(11), e13922."},"author":[{"last_name":"Weber","first_name":"Katherine P.","full_name":"Weber, Katherine P."},{"last_name":"De","first_name":"Subhajyoti","full_name":"De, Subhajyoti"},{"full_name":"Kozarewa, Iwanka","first_name":"Iwanka","last_name":"Kozarewa"},{"last_name":"Turner","first_name":"Daniel J.","full_name":"Turner, Daniel J."},{"full_name":"Babu, M. Madan","first_name":"M. Madan","last_name":"Babu"},{"full_name":"de Bono, Mario","first_name":"Mario","last_name":"de Bono","id":"4E3FF80E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8347-0443"}],"year":"2010","oa_version":"Published Version","license":"https://creativecommons.org/licenses/by/4.0/","publication_status":"published","date_published":"2010-11-11T00:00:00Z","type":"journal_article","day":"11","date_updated":"2021-01-12T08:06:20Z","status":"public","date_created":"2019-03-20T15:20:30Z","pmid":1,"file_date_updated":"2020-07-14T12:47:20Z","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publisher":"Public Library of Science","publication":"PLoS ONE","doi":"10.1371/journal.pone.0013922","external_id":{"pmid":["21085631"]},"volume":5,"language":[{"iso":"eng"}],"article_number":"e13922","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"Defining the mutational landscape when individuals of a species grow separately and diverge over many generations can provide insights into trait evolution. A specific example of this involves studying changes associated with domestication where different lines of the same wild stock have been cultivated independently in different standard environments. Whole genome sequence comparison of such lines permits estimation of mutation rates, inference of genes' ancestral states and ancestry of existing strains, and correction of sequencing errors in genome databases. Here we study domestication of the C. elegans Bristol strain as a model, and report the genome sequence of LSJ1 (Bristol), a sibling of the standard C. elegans reference wild type N2 (Bristol). The LSJ1 and N2 lines were cultivated separately from shortly after the Bristol strain was isolated until methods to freeze C. elegans were developed. We find that during this time the two strains have accumulated 1208 genetic differences. We describe phenotypic variation between N2 and LSJ1 in the rate at which embryos develop, the rate of production of eggs, the maturity of eggs at laying, and feeding behavior, all the result of post-isolation changes. We infer the ancestral alleles in the original Bristol isolate and highlight 2038 likely sequencing errors in the original N2 reference genome sequence. Many of these changes modify genome annotation. Our study provides a starting point to further investigate genotype-phenotype association and offers insights into the process of selection as a result of laboratory domestication."}]},{"publisher":"Facultas.WUV","publication":"Social and cultural interaction and literary landscapes in the Canadian West : impressions of an exploratory field trip and academic interaction in the Canadian West : Rapports interculturels et paysages littéraires dans l'Ouest canadien","publist_id":"7185","page":"173 - 179","extern":1,"quality_controlled":0,"date_created":"2018-12-11T11:47:32Z","status":"public","type":"book_chapter","day":"01","date_updated":"2021-01-12T08:06:40Z","title":"“This is a fundamentalist town”: The Prairie Town as a Site of Social and Cultural Conflict in Sinclair Ross’s As for Me and My House","_id":"619","year":"2010","publication_status":"published","abstract":[{"text":"Sinclair Ross’s novel As for Me and My House has long since been canonized as Canadian prairie fiction. Accordingly, it has been the subject of many critical studies and academic papers. Most commentators have concentrated on such literary issues as the representation of the western landscape or the reliability of the female narrator. But so far little consideration has been given to the social and cultural implications of the novel. Few attempts have been made to analyze the text from a cultural perspective including such social markers as class, gender and ethnicity. That is all the more surprising because Sinclair Ross has often been credited for being a realistic author and As for Me and My House has often been interpreted as a regional novel characteristic of a particular time and place.","lang":"eng"}],"date_published":"2010-01-01T00:00:00Z","author":[{"full_name":"Zacharasiewicz, Waldemar","last_name":"Zacharasiewicz","first_name":"Waldemar"},{"full_name":"Kirsch, Fritz Peter","last_name":"Kirsch","first_name":"Fritz"}],"month":"01","citation":{"chicago":"Zacharasiewicz, Waldemar, and Fritz Kirsch. “‘This Is a Fundamentalist Town’: The Prairie Town as a Site of Social and Cultural Conflict in Sinclair Ross’s As for Me and My House.” In Social and Cultural Interaction and Literary Landscapes in the Canadian West : Impressions of an Exploratory Field Trip and Academic Interaction in the Canadian West : Rapports Interculturels et Paysages Littéraires Dans l’Ouest Canadien, 173–79. Facultas.WUV, 2010.","short":"W. Zacharasiewicz, F. Kirsch, in:, Social and Cultural Interaction and Literary Landscapes in the Canadian West : Impressions of an Exploratory Field Trip and Academic Interaction in the Canadian West : Rapports Interculturels et Paysages Littéraires Dans l’Ouest Canadien, Facultas.WUV, 2010, pp. 173–179.","ista":"Zacharasiewicz W, Kirsch F. 2010.“This is a fundamentalist town”: The Prairie Town as a Site of Social and Cultural Conflict in Sinclair Ross’s As for Me and My House. In: Social and cultural interaction and literary landscapes in the Canadian West : impressions of an exploratory field trip and academic interaction in the Canadian West : Rapports interculturels et paysages littéraires dans l’Ouest canadien. , 173–179.","ama":"Zacharasiewicz W, Kirsch F. “This is a fundamentalist town”: The Prairie Town as a Site of Social and Cultural Conflict in Sinclair Ross’s As for Me and My House. In: Social and Cultural Interaction and Literary Landscapes in the Canadian West : Impressions of an Exploratory Field Trip and Academic Interaction in the Canadian West : Rapports Interculturels et Paysages Littéraires Dans l’Ouest Canadien. Facultas.WUV; 2010:173-179.","apa":"Zacharasiewicz, W., & Kirsch, F. (2010). “This is a fundamentalist town”: The Prairie Town as a Site of Social and Cultural Conflict in Sinclair Ross’s As for Me and My House. In Social and cultural interaction and literary landscapes in the Canadian West : impressions of an exploratory field trip and academic interaction in the Canadian West : Rapports interculturels et paysages littéraires dans l’Ouest canadien (pp. 173–179). Facultas.WUV.","ieee":"W. Zacharasiewicz and F. Kirsch, “‘This is a fundamentalist town’: The Prairie Town as a Site of Social and Cultural Conflict in Sinclair Ross’s As for Me and My House,” in Social and cultural interaction and literary landscapes in the Canadian West : impressions of an exploratory field trip and academic interaction in the Canadian West : Rapports interculturels et paysages littéraires dans l’Ouest canadien, Facultas.WUV, 2010, pp. 173–179.","mla":"Zacharasiewicz, Waldemar, and Fritz Kirsch. “‘This Is a Fundamentalist Town’: The Prairie Town as a Site of Social and Cultural Conflict in Sinclair Ross’s As for Me and My House.” Social and Cultural Interaction and Literary Landscapes in the Canadian West : Impressions of an Exploratory Field Trip and Academic Interaction in the Canadian West : Rapports Interculturels et Paysages Littéraires Dans l’Ouest Canadien, Facultas.WUV, 2010, pp. 173–79."}},{"quality_controlled":"1","date_created":"2019-04-04T14:55:32Z","status":"public","intvolume":" 16","publication_identifier":{"issn":["1078-8956","1546-170x"]},"type":"journal_article","day":"21","title":"Treatment of cerebral ischemia by disrupting ischemia-induced interaction of nNOS with PSD-95","date_updated":"2021-01-12T08:06:43Z","_id":"6198","publisher":"Nature Publishing Group","publication":"Nature Medicine","page":"1439-1443","extern":"1","pmid":1,"author":[{"full_name":"Zhou, L","last_name":"Zhou","first_name":"L"},{"full_name":"Li, F","first_name":"F","last_name":"Li"},{"id":"310349D0-F248-11E8-B48F-1D18A9856A87","last_name":"Xu","first_name":"Haibing","full_name":"Xu, Haibing"},{"full_name":"Luo, CX","first_name":"CX","last_name":"Luo"},{"full_name":"Wu, HY","last_name":"Wu","first_name":"HY"},{"first_name":"MM","last_name":"Zhu","full_name":"Zhu, MM"},{"first_name":"W","last_name":"Lu","full_name":"Lu, W"},{"first_name":"X","last_name":"Ji","full_name":"Ji, X"},{"full_name":"Zhou, QG","first_name":"QG","last_name":"Zhou"},{"first_name":"DY","last_name":"Zhu","full_name":"Zhu, DY"}],"volume":16,"doi":"10.1038/nm.2245","external_id":{"pmid":["21102461"]},"month":"11","citation":{"ama":"Zhou L, Li F, Xu H, et al. Treatment of cerebral ischemia by disrupting ischemia-induced interaction of nNOS with PSD-95. Nature Medicine. 2010;16(12):1439-1443. doi:10.1038/nm.2245","mla":"Zhou, L., et al. “Treatment of Cerebral Ischemia by Disrupting Ischemia-Induced Interaction of NNOS with PSD-95.” Nature Medicine, vol. 16, no. 12, Nature Publishing Group, 2010, pp. 1439–43, doi:10.1038/nm.2245.","ieee":"L. Zhou et al., “Treatment of cerebral ischemia by disrupting ischemia-induced interaction of nNOS with PSD-95,” Nature Medicine, vol. 16, no. 12. Nature Publishing Group, pp. 1439–1443, 2010.","apa":"Zhou, L., Li, F., Xu, H., Luo, C., Wu, H., Zhu, M., … Zhu, D. (2010). Treatment of cerebral ischemia by disrupting ischemia-induced interaction of nNOS with PSD-95. Nature Medicine. Nature Publishing Group. https://doi.org/10.1038/nm.2245","ista":"Zhou L, Li F, Xu H, Luo C, Wu H, Zhu M, Lu W, Ji X, Zhou Q, Zhu D. 2010. Treatment of cerebral ischemia by disrupting ischemia-induced interaction of nNOS with PSD-95. Nature Medicine. 16(12), 1439–1443.","short":"L. Zhou, F. Li, H. Xu, C. Luo, H. Wu, M. Zhu, W. Lu, X. Ji, Q. Zhou, D. Zhu, Nature Medicine 16 (2010) 1439–1443.","chicago":"Zhou, L, F Li, Haibing Xu, CX Luo, HY Wu, MM Zhu, W Lu, X Ji, QG Zhou, and DY Zhu. “Treatment of Cerebral Ischemia by Disrupting Ischemia-Induced Interaction of NNOS with PSD-95.” Nature Medicine. Nature Publishing Group, 2010. https://doi.org/10.1038/nm.2245."},"issue":"12","year":"2010","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa_version":"None","publication_status":"published","date_published":"2010-11-21T00:00:00Z","abstract":[{"text":"Stroke is a major public health problem leading to high rates of death and disability in adults. Excessive stimulation of N-methyl-D-aspartate receptors (NMDARs) and the resulting neuronal nitric oxide synthase (nNOS) activation are crucial for neuronal injury after stroke insult. However, directly inhibiting NMDARs or nNOS can cause severe side effects because they have key physiological functions in the CNS. Here we show that cerebral ischemia induces the interaction of nNOS with postsynaptic density protein-95 (PSD-95). Disrupting nNOS-PSD-95 interaction via overexpressing the N-terminal amino acid residues 1-133 of nNOS (nNOS-N(1-133)) prevented glutamate-induced excitotoxicity and cerebral ischemic damage. Given the mechanism of nNOS-PSD-95 interaction, we developed a series of compounds and discovered a small-molecular inhibitor of the nNOS-PSD-95 interaction, ZL006. This drug blocked the ischemia-induced nNOS-PSD-95 association selectively, had potent neuroprotective activity in vitro and ameliorated focal cerebral ischemic damage in mice and rats subjected to middle cerebral artery occlusion (MCAO) and reperfusion. Moreover, it readily crossed the blood-brain barrier, did not inhibit NMDAR function, catalytic activity of nNOS or spatial memory, and had no effect on aggressive behaviors. Thus, this new drug may serve as a treatment for stroke, perhaps without major side effects. ","lang":"eng"}],"language":[{"iso":"eng"}]},{"author":[{"first_name":"E. K. H.","last_name":"Salje","full_name":"Salje, E. K. H."},{"last_name":"Safarik","first_name":"D. J.","full_name":"Safarik, D. J."},{"id":"13C26AC0-EB69-11E9-87C6-5F3BE6697425","orcid":"0000-0001-9760-3147","full_name":"Modic, Kimberly A","last_name":"Modic","first_name":"Kimberly A"},{"full_name":"Gubernatis, J. E.","first_name":"J. E.","last_name":"Gubernatis"},{"first_name":"J. C.","last_name":"Cooley","full_name":"Cooley, J. C."},{"full_name":"Taylor, R. D.","last_name":"Taylor","first_name":"R. D."},{"first_name":"B.","last_name":"Mihaila","full_name":"Mihaila, B."},{"full_name":"Saxena, A.","last_name":"Saxena","first_name":"A."},{"last_name":"Lookman","first_name":"T.","full_name":"Lookman, T."},{"full_name":"Smith, J. L.","first_name":"J. L.","last_name":"Smith"},{"first_name":"R. A.","last_name":"Fisher","full_name":"Fisher, R. A."},{"first_name":"M.","last_name":"Pasternak","full_name":"Pasternak, M."},{"full_name":"Opeil, C. P.","last_name":"Opeil","first_name":"C. P."},{"first_name":"T.","last_name":"Siegrist","full_name":"Siegrist, T."},{"full_name":"Littlewood, P. B.","first_name":"P. B.","last_name":"Littlewood"},{"full_name":"Lashley, J. C.","last_name":"Lashley","first_name":"J. C."}],"citation":{"ista":"Salje EKH, Safarik DJ, Modic KA, Gubernatis JE, Cooley JC, Taylor RD, Mihaila B, Saxena A, Lookman T, Smith JL, Fisher RA, Pasternak M, Opeil CP, Siegrist T, Littlewood PB, Lashley JC. 2010. Tin telluride: A weakly co-elastic metal. Physical Review B. 82(18), 184112.","short":"E.K.H. Salje, D.J. Safarik, K.A. Modic, J.E. Gubernatis, J.C. Cooley, R.D. Taylor, B. Mihaila, A. Saxena, T. Lookman, J.L. Smith, R.A. Fisher, M. Pasternak, C.P. Opeil, T. Siegrist, P.B. Littlewood, J.C. Lashley, Physical Review B 82 (2010).","chicago":"Salje, E. K. H., D. J. Safarik, Kimberly A Modic, J. E. Gubernatis, J. C. Cooley, R. D. Taylor, B. Mihaila, et al. “Tin Telluride: A Weakly Co-Elastic Metal.” Physical Review B. APS, 2010. https://doi.org/10.1103/physrevb.82.184112.","ama":"Salje EKH, Safarik DJ, Modic KA, et al. Tin telluride: A weakly co-elastic metal. Physical Review B. 2010;82(18). doi:10.1103/physrevb.82.184112","mla":"Salje, E. K. H., et al. “Tin Telluride: A Weakly Co-Elastic Metal.” Physical Review B, vol. 82, no. 18, 184112, APS, 2010, doi:10.1103/physrevb.82.184112.","apa":"Salje, E. K. H., Safarik, D. J., Modic, K. A., Gubernatis, J. E., Cooley, J. C., Taylor, R. D., … Lashley, J. C. (2010). Tin telluride: A weakly co-elastic metal. Physical Review B. APS. https://doi.org/10.1103/physrevb.82.184112","ieee":"E. K. H. Salje et al., “Tin telluride: A weakly co-elastic metal,” Physical Review B, vol. 82, no. 18. APS, 2010."},"issue":"18","month":"11","publication_status":"published","oa_version":"Preprint","year":"2010","date_published":"2010-11-18T00:00:00Z","article_type":"original","quality_controlled":"1","intvolume":" 82","publication_identifier":{"issn":["1098-0121","1550-235X"]},"_id":"7078","title":"Tin telluride: A weakly co-elastic metal","oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1011.1445","open_access":"1"}],"extern":"1","volume":82,"external_id":{"arxiv":["1011.1445"]},"doi":"10.1103/physrevb.82.184112","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"We report resonant ultrasound spectroscopy (RUS), dilatometry/magnetostriction, magnetotransport, magnetization, specific-heat, and 119Sn Mössbauer spectroscopy measurements on SnTe and Sn0.995Cr0.005Te. Hall measurements at T=77 K indicate that our Bridgman-grown single crystals have a p-type carrier concentration of 3.4×1019 cm−3 and that our Cr-doped crystals have an n-type concentration of 5.8×1022 cm−3. Although our SnTe crystals are diamagnetic over the temperature range 2≤T≤1100 K, the Cr-doped crystals are room-temperature ferromagnets with a Curie temperature of 294 K. For each sample type, three-terminal capacitive dilatometry measurements detect a subtle 0.5 μm distortion at Tc≈85 K. Whereas our RUS measurements on SnTe show elastic hardening near the structural transition, pointing to co-elastic behavior, similar measurements on Sn0.995Cr0.005Te show a pronounced softening, pointing to ferroelastic behavior. Effective Debye temperature, θD, values of SnTe obtained from 119Sn Mössbauer studies show a hardening of phonons in the range 60–115 K (θD=162 K) as compared with the 100–300 K range (θD=150 K). In addition, a precursor softening extending over approximately 100 K anticipates this collapse at the critical temperature and quantitative analysis over three decades of its reduced modulus finds ΔC44/C44=A|(T−T0)/T0|−κ with κ=0.50±0.02, a value indicating a three-dimensional softening of phonon branches at a temperature T0∼75 K, considerably below Tc. We suggest that the differences in these two types of elastic behaviors lie in the absence of elastic domain-wall motion in the one case and their nucleation in the other.","lang":"eng"}],"article_processing_charge":"No","article_number":"184112","language":[{"iso":"eng"}],"status":"public","date_created":"2019-11-19T13:46:28Z","day":"18","type":"journal_article","arxiv":1,"date_updated":"2021-01-12T08:11:44Z","publication":"Physical Review B","publisher":"APS"},{"month":"02","issue":"3","citation":{"ista":"Drymiotis FR, Drye TB, Wang Y, He J, Rhodes D, Modic KA, Cawthorne S, Zhang QR. 2010. Structure formation and very low thermal conductivity in Pb:Te:Ag:Se mixtures. Journal of Applied Physics. 107(3), 033519.","short":"F.R. Drymiotis, T.B. Drye, Y. Wang, J. He, D. Rhodes, K.A. Modic, S. Cawthorne, Q.R. Zhang, Journal of Applied Physics 107 (2010).","chicago":"Drymiotis, Fivos R., Tyler B. Drye, Yisha Wang, Jian He, Daniel Rhodes, Kimberly A Modic, Samantha Cawthorne, and Qiu Run Zhang. “Structure Formation and Very Low Thermal Conductivity in Pb:Te:Ag:Se Mixtures.” Journal of Applied Physics. AIP, 2010. https://doi.org/10.1063/1.3284946.","mla":"Drymiotis, Fivos R., et al. “Structure Formation and Very Low Thermal Conductivity in Pb:Te:Ag:Se Mixtures.” Journal of Applied Physics, vol. 107, no. 3, 033519, AIP, 2010, doi:10.1063/1.3284946.","apa":"Drymiotis, F. R., Drye, T. B., Wang, Y., He, J., Rhodes, D., Modic, K. A., … Zhang, Q. R. (2010). Structure formation and very low thermal conductivity in Pb:Te:Ag:Se mixtures. Journal of Applied Physics. AIP. https://doi.org/10.1063/1.3284946","ieee":"F. R. Drymiotis et al., “Structure formation and very low thermal conductivity in Pb:Te:Ag:Se mixtures,” Journal of Applied Physics, vol. 107, no. 3. AIP, 2010.","ama":"Drymiotis FR, Drye TB, Wang Y, et al. Structure formation and very low thermal conductivity in Pb:Te:Ag:Se mixtures. Journal of Applied Physics. 2010;107(3). doi:10.1063/1.3284946"},"doi":"10.1063/1.3284946","author":[{"last_name":"Drymiotis","first_name":"Fivos R.","full_name":"Drymiotis, Fivos R."},{"first_name":"Tyler B.","last_name":"Drye","full_name":"Drye, Tyler B."},{"full_name":"Wang, Yisha","last_name":"Wang","first_name":"Yisha"},{"full_name":"He, Jian","first_name":"Jian","last_name":"He"},{"last_name":"Rhodes","first_name":"Daniel","full_name":"Rhodes, Daniel"},{"first_name":"Kimberly A","last_name":"Modic","full_name":"Modic, Kimberly A","id":"13C26AC0-EB69-11E9-87C6-5F3BE6697425","orcid":"0000-0001-9760-3147"},{"last_name":"Cawthorne","first_name":"Samantha","full_name":"Cawthorne, Samantha"},{"full_name":"Zhang, Qiu Run","last_name":"Zhang","first_name":"Qiu Run"}],"volume":107,"language":[{"iso":"eng"}],"article_number":"033519","article_type":"original","article_processing_charge":"No","abstract":[{"lang":"eng","text":"We have observed that reacting Pb:Te:Ag:Se in a 1:1:1.9:1 molar ratio gives rise to what appears to be a predominantly single-phase alloy, which crystallizes in the PbSe cF8 fcc structure. However, further investigation of the structure using energy dispersive x-ray analysis reveals the presence of two phases, PbSe and β-Ag2Te, with identical lattice parameters. The total thermal conductivity of the formed alloy is remarkably low for a crystalline material, κT<0.6W∕mK at 675K, it is reproducible, and in addition, the compound has good mechanical properties."}],"date_published":"2010-02-09T00:00:00Z","year":"2010","publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"None","title":"Structure formation and very low thermal conductivity in Pb:Te:Ag:Se mixtures","date_updated":"2021-01-12T08:11:44Z","_id":"7079","type":"journal_article","publication_identifier":{"issn":["0021-8979","1089-7550"]},"day":"09","date_created":"2019-11-19T13:47:24Z","intvolume":" 107","status":"public","quality_controlled":"1","extern":"1","publisher":"AIP","publication":"Journal of Applied Physics"},{"volume":13,"author":[{"first_name":"V.","last_name":"Giordani","full_name":"Giordani, V."},{"first_name":"Stefan Alexander","last_name":"Freunberger","full_name":"Freunberger, Stefan Alexander","id":"A8CA28E6-CE23-11E9-AD2D-EC27E6697425","orcid":"0000-0003-2902-5319"},{"last_name":"Bruce","first_name":"P. G.","full_name":"Bruce, P. G."},{"last_name":"Tarascon","first_name":"J.-M.","full_name":"Tarascon, J.-M."},{"first_name":"D.","last_name":"Larcher","full_name":"Larcher, D."}],"doi":"10.1149/1.3494045","citation":{"short":"V. Giordani, S.A. Freunberger, P.G. Bruce, J.-M. Tarascon, D. Larcher, Electrochemical and Solid-State Letters 13 (2010).","chicago":"Giordani, V., Stefan Alexander Freunberger, P. G. Bruce, J.-M. Tarascon, and D. Larcher. “H2O2 Decomposition Reaction as Selecting Tool for Catalysts in Li–O2 Cells.” Electrochemical and Solid-State Letters. The Electrochemical Society, 2010. https://doi.org/10.1149/1.3494045.","ista":"Giordani V, Freunberger SA, Bruce PG, Tarascon J-M, Larcher D. 2010. H2O2 decomposition reaction as selecting tool for catalysts in Li–O2 cells. Electrochemical and Solid-State Letters. 13(12), A180.","ieee":"V. Giordani, S. A. Freunberger, P. G. Bruce, J.-M. Tarascon, and D. Larcher, “H2O2 decomposition reaction as selecting tool for catalysts in Li–O2 cells,” Electrochemical and Solid-State Letters, vol. 13, no. 12. The Electrochemical Society, 2010.","apa":"Giordani, V., Freunberger, S. A., Bruce, P. G., Tarascon, J.-M., & Larcher, D. (2010). H2O2 decomposition reaction as selecting tool for catalysts in Li–O2 cells. Electrochemical and Solid-State Letters. The Electrochemical Society. https://doi.org/10.1149/1.3494045","mla":"Giordani, V., et al. “H2O2 Decomposition Reaction as Selecting Tool for Catalysts in Li–O2 Cells.” Electrochemical and Solid-State Letters, vol. 13, no. 12, A180, The Electrochemical Society, 2010, doi:10.1149/1.3494045.","ama":"Giordani V, Freunberger SA, Bruce PG, Tarascon J-M, Larcher D. H2O2 decomposition reaction as selecting tool for catalysts in Li–O2 cells. Electrochemical and Solid-State Letters. 2010;13(12). doi:10.1149/1.3494045"},"issue":"12","month":"10","oa_version":"None","publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2010","abstract":[{"lang":"eng","text":"The decomposition reaction of H2O2 aqueous solutions (H2O2 - H2O + 1/2O2) catalyzed by transition metal oxide powders has been compared with the charging voltage of nonaqueous Li-O2 cells containing the same catalyst. An inverse linear relationship between Ln k (rate constant for the H2O2 decomposition) and the charging voltage has been found, despite differences in media and possible mechanistic differences. The results suggest that the decomposition may be a reliable, useful, and fast screening tool for materials that promote the charging process of the Li-O2 battery and may ultimately give insight into the charging mechanism."}],"date_published":"2010-10-04T00:00:00Z","article_processing_charge":"No","article_type":"letter_note","article_number":"A180","language":[{"iso":"eng"}],"quality_controlled":"1","date_created":"2020-01-15T12:21:06Z","status":"public","intvolume":" 13","day":"04","type":"journal_article","publication_identifier":{"issn":["1099-0062"]},"_id":"7318","title":"H2O2 decomposition reaction as selecting tool for catalysts in Li–O2 cells","date_updated":"2021-01-12T08:13:01Z","publication":"Electrochemical and Solid-State Letters","publisher":"The Electrochemical Society","extern":"1"},{"status":"public","date_created":"2018-12-11T11:48:19Z","alternative_title":["LNCS"],"_id":"754","date_updated":"2023-02-23T13:10:21Z","title":"Fast randomized test-and-set and renaming","day":"01","type":"conference","publisher":"Springer","extern":"1","acknowledgement":"The work of Dan Alistarh is supported by the Swiss NCCR MICS project. The work of Hagit Attiya is supported in part by the Israel Science Foundation (grant number 953/06).","page":"94 - 108","publist_id":"6900","conference":{"name":"DISC: Distributed Computing"},"volume":"6343 LNCS","author":[{"orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian"},{"first_name":"Hagit","last_name":"Attiya","full_name":"Attiya, Hagit"},{"first_name":"Seth","last_name":"Gilbert","full_name":"Gilbert, Seth"},{"full_name":"Giurgiu, Andrei","first_name":"Andrei","last_name":"Giurgiu"},{"full_name":"Guerraoui, Rachid","first_name":"Rachid","last_name":"Guerraoui"}],"citation":{"chicago":"Alistarh, Dan-Adrian, Hagit Attiya, Seth Gilbert, Andrei Giurgiu, and Rachid Guerraoui. “Fast Randomized Test-and-Set and Renaming,” 6343 LNCS:94–108. Springer, 2010. https://doi.org/10.1007/978-3-642-15763-9_9.","short":"D.-A. Alistarh, H. Attiya, S. Gilbert, A. Giurgiu, R. Guerraoui, in:, Springer, 2010, pp. 94–108.","ista":"Alistarh D-A, Attiya H, Gilbert S, Giurgiu A, Guerraoui R. 2010. Fast randomized test-and-set and renaming. DISC: Distributed Computing, LNCS, vol. 6343 LNCS, 94–108.","apa":"Alistarh, D.-A., Attiya, H., Gilbert, S., Giurgiu, A., & Guerraoui, R. (2010). Fast randomized test-and-set and renaming (Vol. 6343 LNCS, pp. 94–108). Presented at the DISC: Distributed Computing, Springer. https://doi.org/10.1007/978-3-642-15763-9_9","ieee":"D.-A. Alistarh, H. Attiya, S. Gilbert, A. Giurgiu, and R. Guerraoui, “Fast randomized test-and-set and renaming,” presented at the DISC: Distributed Computing, 2010, vol. 6343 LNCS, pp. 94–108.","mla":"Alistarh, Dan-Adrian, et al. Fast Randomized Test-and-Set and Renaming. Vol. 6343 LNCS, Springer, 2010, pp. 94–108, doi:10.1007/978-3-642-15763-9_9.","ama":"Alistarh D-A, Attiya H, Gilbert S, Giurgiu A, Guerraoui R. Fast randomized test-and-set and renaming. In: Vol 6343 LNCS. Springer; 2010:94-108. doi:10.1007/978-3-642-15763-9_9"},"month":"01","doi":"10.1007/978-3-642-15763-9_9","date_published":"2010-01-01T00:00:00Z","abstract":[{"text":"Most people believe that renaming is easy: simply choose a name at random; if more than one process selects the same name, then try again. We highlight the issues that occur when trying to implement such a scheme and shed new light on the read-write complexity of randomized renaming in an asynchronous environment. At the heart of our new perspective stands an adaptive implementation of a randomized test-and-set object, that has poly-logarithmic step complexity per operation, with high probability. Interestingly, our implementation is anonymous, as it does not require process identifiers. Based on this implementation, we present two new randomized renaming algorithms. The first ensures a tight namespace of n names using O( n log4 n) total steps, with high probability. This significantly improves on the complexity of the best previously known namespace-optimal algorithms. The second algorithm achieves a namespace of size k (1 + ε) using O( k log4 k / log2 (1 + ε) ) total steps, both with high probability, where k is the total contention in the execution. It is the first adaptive randomized renaming algorithm, and it improves on existing deterministic solutions by providing a smaller namespace, and by lowering step complexity.","lang":"eng"}],"article_processing_charge":"No","oa_version":"None","publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2010","language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"abstract":[{"text":"Gossip, also known as epidemic dissemination, is becoming an increasingly popular technique in distributed systems. Yet, it has remained a partially open question: how robust are such protocols? We consider a natural extension of the random phone-call model (introduced by Karp et al. [1]), and we analyze two different notions of robustness: the ability to tolerate adaptive failures, and the ability to tolerate oblivious failures. For adaptive failures, we present a new gossip protocol, TrickleGossip, which achieves near-optimal O(n log 3 n) message complexity. To the best of our knowledge, this is the first epidemic-style protocol that can tolerate adaptive failures. We also show a direct relation between resilience and message complexity, demonstrating that gossip protocols which tolerate a large number of adaptive failures need to use a super-linear number of messages with high probability. For oblivious failures, we present a new gossip protocol, CoordinatedGossip, that achieves optimal O(n) message complexity. This protocol makes novel use of the universe reduction technique to limit the message complexity.","lang":"eng"}],"date_published":"2010-01-01T00:00:00Z","article_processing_charge":"No","oa_version":"None","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","year":"2010","citation":{"ista":"Alistarh D-A, Gilbert S, Guerraoui R, Zadimoghaddam M. 2010. How efficient can gossip be? (On the cost of resilient information exchange). ICALP: International Colloquium on Automota, Languages and Programming, LNCS, vol. 6199 LNCS, 115–126.","short":"D.-A. Alistarh, S. Gilbert, R. Guerraoui, M. Zadimoghaddam, in:, Springer, 2010, pp. 115–126.","chicago":"Alistarh, Dan-Adrian, Seth Gilbert, Rachid Guerraoui, and Morteza Zadimoghaddam. “How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange),” 6199 LNCS:115–26. Springer, 2010. https://doi.org/10.1007/978-3-642-14162-1_10.","mla":"Alistarh, Dan-Adrian, et al. How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange). Vol. 6199 LNCS, no. PART 2, Springer, 2010, pp. 115–26, doi:10.1007/978-3-642-14162-1_10.","ieee":"D.-A. Alistarh, S. Gilbert, R. Guerraoui, and M. Zadimoghaddam, “How efficient can gossip be? (On the cost of resilient information exchange),” presented at the ICALP: International Colloquium on Automota, Languages and Programming, 2010, vol. 6199 LNCS, no. PART 2, pp. 115–126.","apa":"Alistarh, D.-A., Gilbert, S., Guerraoui, R., & Zadimoghaddam, M. (2010). How efficient can gossip be? (On the cost of resilient information exchange) (Vol. 6199 LNCS, pp. 115–126). Presented at the ICALP: International Colloquium on Automota, Languages and Programming, Springer. https://doi.org/10.1007/978-3-642-14162-1_10","ama":"Alistarh D-A, Gilbert S, Guerraoui R, Zadimoghaddam M. How efficient can gossip be? (On the cost of resilient information exchange). In: Vol 6199 LNCS. Springer; 2010:115-126. doi:10.1007/978-3-642-14162-1_10"},"issue":"PART 2","month":"01","doi":"10.1007/978-3-642-14162-1_10","volume":"6199 LNCS","author":[{"first_name":"Dan-Adrian","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X"},{"full_name":"Gilbert, Seth","first_name":"Seth","last_name":"Gilbert"},{"full_name":"Guerraoui, Rachid","first_name":"Rachid","last_name":"Guerraoui"},{"full_name":"Zadimoghaddam, Morteza","first_name":"Morteza","last_name":"Zadimoghaddam"}],"extern":"1","acknowledgement":"We would like to thank Prof. Hagit Attiya and the anonymous reviewers for their useful comments on earlier drafts of this paper.","page":"115 - 126","conference":{"name":"ICALP: International Colloquium on Automota, Languages and Programming"},"publist_id":"6901","publisher":"Springer","_id":"755","date_updated":"2023-02-23T13:10:40Z","title":"How efficient can gossip be? (On the cost of resilient information exchange)","day":"01","type":"conference","date_created":"2018-12-11T11:48:20Z","status":"public","alternative_title":["LNCS"]}]