[{"language":[{"iso":"eng"}],"doi":"10.1007/s00114-012-0943-z","date_published":"2012-08-01T00:00:00Z","page":"627 - 636","quality_controlled":"1","citation":{"ama":"Konrad M, Pamminger T, Foitzik S. Two pathways ensuring social harmony. Naturwissenschaften. 2012;99(8):627-636. doi:10.1007/s00114-012-0943-z","ieee":"M. Konrad, T. Pamminger, and S. Foitzik, “Two pathways ensuring social harmony,” Naturwissenschaften, vol. 99, no. 8. Springer, pp. 627–636, 2012.","apa":"Konrad, M., Pamminger, T., & Foitzik, S. (2012). Two pathways ensuring social harmony. Naturwissenschaften. Springer. https://doi.org/10.1007/s00114-012-0943-z","ista":"Konrad M, Pamminger T, Foitzik S. 2012. Two pathways ensuring social harmony. Naturwissenschaften. 99(8), 627–636.","short":"M. Konrad, T. Pamminger, S. Foitzik, Naturwissenschaften 99 (2012) 627–636.","mla":"Konrad, Matthias, et al. “Two Pathways Ensuring Social Harmony.” Naturwissenschaften, vol. 99, no. 8, Springer, 2012, pp. 627–36, doi:10.1007/s00114-012-0943-z.","chicago":"Konrad, Matthias, Tobias Pamminger, and Susanne Foitzik. “Two Pathways Ensuring Social Harmony.” Naturwissenschaften. Springer, 2012. https://doi.org/10.1007/s00114-012-0943-z."},"publication":"Naturwissenschaften","month":"08","day":"01","scopus_import":1,"volume":99,"oa_version":"None","date_updated":"2021-01-12T07:41:17Z","date_created":"2018-12-11T12:01:34Z","author":[{"full_name":"Konrad, Matthias","last_name":"Konrad","first_name":"Matthias","id":"46528076-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Tobias","last_name":"Pamminger","full_name":"Pamminger, Tobias"},{"last_name":"Foitzik","first_name":"Susanne","full_name":"Foitzik, Susanne"}],"department":[{"_id":"SyCr"}],"publisher":"Springer","intvolume":" 99","title":"Two pathways ensuring social harmony","status":"public","publication_status":"published","_id":"3132","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","acknowledgement":"We like to thank the editor and three anonymous reviewers for their time and constructive criticism and Inon Scharf, Volker Witte and Andreas Modlmeier for helpful comments on earlier versions of the manuscript. The first and second authors appear in alphabetical order and contributed equally to this paper.","year":"2012","publist_id":"3565","issue":"8","abstract":[{"text":"Reproductive division of labour is a characteristic trait of social insects. The dominant reproductive individual, often the queen, uses chemical communication and/or behaviour to maintain her social status. Queens of many social insects communicate their fertility status via cuticle-bound substances. As these substances usually possess a low volatility, their range in queen–worker communication is potentially limited. Here, we investigate the range and impact of behavioural and chemical queen signals on workers of the ant Temnothorax longispinosus. We compared the behaviour and ovary development of workers subjected to three different treatments: workers with direct chemical and physical contact to the queen, those solely under the influence of volatile queen substances and those entirely separated from the queen. In addition to short-ranged queen signals preventing ovary development in workers, we discovered a novel secondary pathway influencing worker behaviour. Workers with no physical contact to the queen, but exposed to volatile substances, started to develop their ovaries, but did not change their behaviour compared to workers in direct contact to the queen. In contrast, workers in queen-separated groups showed both increased ovary development and aggressive dominance interactions. We conclude that T. longispinosus queens influence worker ovary development and behaviour via two independent signals, both ensuring social harmony within the colony.","lang":"eng"}],"type":"journal_article"},{"quality_controlled":"1","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"language":[{"iso":"eng"}],"doi":"10.1371/journal.pone.0036044","month":"05","department":[{"_id":"SyCr"}],"publisher":"Public Library of Science","publication_status":"published","acknowledgement":"Supported by National Institutes of Health grants GM071338 (ML) and AI059355 (BM).\r\nWe acknowledge the expertise of Dr. Martina Ralle in Department of Biochemistry and Molecular Biology at OHSU for measurements of potassium using inductively coupled plasma mass spectrometry.","year":"2012","volume":7,"date_created":"2018-12-11T12:01:45Z","date_updated":"2021-01-12T07:41:29Z","author":[{"last_name":"Vyleta","first_name":"Meghan","id":"418901AA-F248-11E8-B48F-1D18A9856A87","full_name":"Vyleta, Meghan"},{"full_name":"Wong, John","last_name":"Wong","first_name":"John"},{"full_name":"Magun, Bruce","last_name":"Magun","first_name":"Bruce"}],"article_number":"e36044","publist_id":"3526","file_date_updated":"2020-07-14T12:46:01Z","citation":{"short":"M. Vyleta, J. Wong, B. Magun, PLoS One 7 (2012).","mla":"Vyleta, Meghan, et al. “Suppression of Ribosomal Function Triggers Innate Immune Signaling through Activation of the NLRP3 Inflammasome.” PLoS One, vol. 7, no. 5, e36044, Public Library of Science, 2012, doi:10.1371/journal.pone.0036044.","chicago":"Vyleta, Meghan, John Wong, and Bruce Magun. “Suppression of Ribosomal Function Triggers Innate Immune Signaling through Activation of the NLRP3 Inflammasome.” PLoS One. Public Library of Science, 2012. https://doi.org/10.1371/journal.pone.0036044.","ama":"Vyleta M, Wong J, Magun B. Suppression of ribosomal function triggers innate immune signaling through activation of the NLRP3 inflammasome. PLoS One. 2012;7(5). doi:10.1371/journal.pone.0036044","apa":"Vyleta, M., Wong, J., & Magun, B. (2012). Suppression of ribosomal function triggers innate immune signaling through activation of the NLRP3 inflammasome. PLoS One. Public Library of Science. https://doi.org/10.1371/journal.pone.0036044","ieee":"M. Vyleta, J. Wong, and B. Magun, “Suppression of ribosomal function triggers innate immune signaling through activation of the NLRP3 inflammasome,” PLoS One, vol. 7, no. 5. Public Library of Science, 2012.","ista":"Vyleta M, Wong J, Magun B. 2012. Suppression of ribosomal function triggers innate immune signaling through activation of the NLRP3 inflammasome. PLoS One. 7(5), e36044."},"publication":"PLoS One","date_published":"2012-05-14T00:00:00Z","scopus_import":1,"has_accepted_license":"1","day":"14","intvolume":" 7","title":"Suppression of ribosomal function triggers innate immune signaling through activation of the NLRP3 inflammasome","status":"public","ddc":["610"],"_id":"3161","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","file":[{"checksum":"30cef37e27eaa467f6571b3640282010","date_updated":"2020-07-14T12:46:01Z","date_created":"2018-12-12T10:14:30Z","relation":"main_file","file_id":"5082","content_type":"application/pdf","file_size":2984012,"creator":"system","access_level":"open_access","file_name":"IST-2012-97-v1+1_journal.pone.0036044.pdf"}],"oa_version":"Published Version","pubrep_id":"97","type":"journal_article","issue":"5","abstract":[{"lang":"eng","text":"Some inflammatory stimuli trigger activation of the NLRP3 inflammasome by inducing efflux of cellular potassium. Loss of cellular potassium is known to potently suppress protein synthesis, leading us to test whether the inhibition of protein synthesis itself serves as an activating signal for the NLRP3 inflammasome. Murine bone marrow-derived macrophages, either primed by LPS or unprimed, were exposed to a panel of inhibitors of ribosomal function: ricin, cycloheximide, puromycin, pactamycin, and anisomycin. Macrophages were also exposed to nigericin, ATP, monosodium urate (MSU), and poly I:C. Synthesis of pro-IL-ß and release of IL-1ß from cells in response to these agents was detected by immunoblotting and ELISA. Release of intracellular potassium was measured by mass spectrometry. Inhibition of translation by each of the tested translation inhibitors led to processing of IL-1ß, which was released from cells. Processing and release of IL-1ß was reduced or absent from cells deficient in NLRP3, ASC, or caspase-1, demonstrating the role of the NLRP3 inflammasome. Despite the inability of these inhibitors to trigger efflux of intracellular potassium, the addition of high extracellular potassium suppressed activation of the NLRP3 inflammasome. MSU and double-stranded RNA, which are known to activate the NLRP3 inflammasome, also substantially inhibited protein translation, supporting a close association between inhibition of translation and inflammasome activation. These data demonstrate that translational inhibition itself constitutes a heretofore-unrecognized mechanism underlying IL-1ß dependent inflammatory signaling and that other physical, chemical, or pathogen-associated agents that impair translation may lead to IL-1ß-dependent inflammation through activation of the NLRP3 inflammasome. For agents that inhibit translation through decreased cellular potassium, the application of high extracellular potassium restores protein translation and suppresses activation of the NLRP inflammasome. For agents that inhibit translation through mechanisms that do not involve loss of potassium, high extracellular potassium suppresses IL-1ß processing through a mechanism that remains undefined."}]},{"day":"01","article_processing_charge":"No","has_accepted_license":"1","scopus_import":1,"date_published":"2012-01-01T00:00:00Z","citation":{"ista":"Asarin E, Donzé A, Maler O, Nickovic D. 2012. Parametric identification of temporal properties. RV: Runtime Verification, LNCS, vol. 7186, 147–160.","apa":"Asarin, E., Donzé, A., Maler, O., & Nickovic, D. (2012). Parametric identification of temporal properties (Vol. 7186, pp. 147–160). Presented at the RV: Runtime Verification, San Francisco, CA, United States: Springer. https://doi.org/10.1007/978-3-642-29860-8_12","ieee":"E. Asarin, A. Donzé, O. Maler, and D. Nickovic, “Parametric identification of temporal properties,” presented at the RV: Runtime Verification, San Francisco, CA, United States, 2012, vol. 7186, pp. 147–160.","ama":"Asarin E, Donzé A, Maler O, Nickovic D. Parametric identification of temporal properties. In: Vol 7186. Springer; 2012:147-160. doi:10.1007/978-3-642-29860-8_12","chicago":"Asarin, Eugene, Alexandre Donzé, Oded Maler, and Dejan Nickovic. “Parametric Identification of Temporal Properties,” 7186:147–60. Springer, 2012. https://doi.org/10.1007/978-3-642-29860-8_12.","mla":"Asarin, Eugene, et al. Parametric Identification of Temporal Properties. Vol. 7186, Springer, 2012, pp. 147–60, doi:10.1007/978-3-642-29860-8_12.","short":"E. Asarin, A. Donzé, O. Maler, D. Nickovic, in:, Springer, 2012, pp. 147–160."},"page":"147 - 160","abstract":[{"text":"Given a dense-time real-valued signal and a parameterized temporal logic formula with both magnitude and timing parameters, we compute the subset of the parameter space that renders the formula satisfied by the trace. We provide two preliminary implementations, one which follows the exact semantics and attempts to compute the validity domain by quantifier elimination in linear arithmetics and one which conducts adaptive search in the parameter space.","lang":"eng"}],"type":"conference","alternative_title":["LNCS"],"file":[{"checksum":"ba4a75287008fc64b8fbf78a7476ec32","date_created":"2020-05-15T12:50:15Z","date_updated":"2020-07-14T12:46:01Z","relation":"main_file","file_id":"7862","content_type":"application/pdf","file_size":374726,"creator":"dernst","access_level":"open_access","file_name":"2012_RV_Asarin.pdf"}],"oa_version":"Submitted Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"3162","title":"Parametric identification of temporal properties","ddc":["000"],"status":"public","intvolume":" 7186","month":"01","conference":{"name":"RV: Runtime Verification","end_date":"2011-09-30","start_date":"2011-09-27","location":"San Francisco, CA, United States"},"doi":"10.1007/978-3-642-29860-8_12","language":[{"iso":"eng"}],"oa":1,"quality_controlled":"1","file_date_updated":"2020-07-14T12:46:01Z","publist_id":"3525","author":[{"full_name":"Asarin, Eugene","last_name":"Asarin","first_name":"Eugene"},{"full_name":"Donzé, Alexandre","first_name":"Alexandre","last_name":"Donzé"},{"full_name":"Maler, Oded","first_name":"Oded","last_name":"Maler"},{"id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87","first_name":"Dejan","last_name":"Nickovic","full_name":"Nickovic, Dejan"}],"date_created":"2018-12-11T12:01:45Z","date_updated":"2021-01-12T07:41:29Z","volume":7186,"year":"2012","publication_status":"published","department":[{"_id":"ToHe"}],"publisher":"Springer"},{"day":"01","month":"06","scopus_import":1,"language":[{"iso":"eng"}],"doi":"10.4161/cc.20118","date_published":"2012-06-01T00:00:00Z","page":"2055 - 2058","quality_controlled":"1","citation":{"ama":"Pantazis P, Bollenbach MT. Transcription factor kinetics and the emerging asymmetry in the early mammalian embryo. Cell Cycle. 2012;11(11):2055-2058. doi:10.4161/cc.20118","ieee":"P. Pantazis and M. T. Bollenbach, “Transcription factor kinetics and the emerging asymmetry in the early mammalian embryo,” Cell Cycle, vol. 11, no. 11. Taylor and Francis, pp. 2055–2058, 2012.","apa":"Pantazis, P., & Bollenbach, M. T. (2012). Transcription factor kinetics and the emerging asymmetry in the early mammalian embryo. Cell Cycle. Taylor and Francis. https://doi.org/10.4161/cc.20118","ista":"Pantazis P, Bollenbach MT. 2012. Transcription factor kinetics and the emerging asymmetry in the early mammalian embryo. Cell Cycle. 11(11), 2055–2058.","short":"P. Pantazis, M.T. Bollenbach, Cell Cycle 11 (2012) 2055–2058.","mla":"Pantazis, Periklis, and Mark Tobias Bollenbach. “Transcription Factor Kinetics and the Emerging Asymmetry in the Early Mammalian Embryo.” Cell Cycle, vol. 11, no. 11, Taylor and Francis, 2012, pp. 2055–58, doi:10.4161/cc.20118.","chicago":"Pantazis, Periklis, and Mark Tobias Bollenbach. “Transcription Factor Kinetics and the Emerging Asymmetry in the Early Mammalian Embryo.” Cell Cycle. Taylor and Francis, 2012. https://doi.org/10.4161/cc.20118."},"publication":"Cell Cycle","issue":"11","publist_id":"3531","abstract":[{"text":"There is a long-running controversy about how early cell fate decisions are made in the developing mammalian embryo. 1,2 In particular, it is controversial when the first events that can predict the establishment of the pluripotent and extra-embryonic lineages in the blastocyst of the pre-implantation embryo occur. It has long been proposed that the position and polarity of cells at the 16- to 32-cell stage embryo influence their decision to either give rise to the pluripotent cell lineage that eventually contributes to the inner cell mass (ICM), comprising the primitive endoderm (PE) and the epiblast (EPI), or the extra-embryonic trophectoderm (TE) surrounding the blastocoel. The positioning of cells in the embryo at this developmental stage could largely be the result of random events, making this a stochastic model of cell lineage allocation. Contrary to such a stochastic model, some studies have detected putative differences in the lineage potential of individual blastomeres before compaction, indicating that the first cell fate decisions may occur as early as at the 4-cell stage. Using a non-invasive, quantitative in vivo imaging assay to study the kinetic behavior of Oct4 (also known as POU5F1), a key transcription factor (TF) controlling pre-implantation development in the mouse embryo, 3-5 a recent study identifies Oct4 kinetics as a predictive measure of cell lineage patterning in the early mouse embryo. 6 Here, we discuss the implications of such molecular heterogeneities in early development and offer potential avenues toward a mechanistic understanding of these observations, contributing to the resolution of the controversy of developmental cell lineage allocation.","lang":"eng"}],"type":"journal_article","volume":11,"oa_version":"None","date_created":"2018-12-11T12:01:44Z","date_updated":"2021-01-12T07:41:28Z","author":[{"last_name":"Pantazis","first_name":"Periklis","full_name":"Pantazis, Periklis"},{"id":"3E6DB97A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4398-476X","first_name":"Tobias","last_name":"Bollenbach","full_name":"Bollenbach, Tobias"}],"intvolume":" 11","department":[{"_id":"ToBo"}],"publisher":"Taylor and Francis","publication_status":"published","status":"public","title":"Transcription factor kinetics and the emerging asymmetry in the early mammalian embryo","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"3160","year":"2012"},{"publist_id":"3521","issue":"3","abstract":[{"lang":"eng","text":"Overview of the Special Issue on structured prediction and inference."}],"type":"journal_article","oa_version":"None","volume":99,"date_updated":"2021-01-12T07:41:30Z","date_created":"2018-12-11T12:01:46Z","author":[{"full_name":"Blaschko, Matthew","last_name":"Blaschko","first_name":"Matthew"},{"last_name":"Lampert","first_name":"Christoph","orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","full_name":"Lampert, Christoph"}],"department":[{"_id":"ChLa"}],"publisher":"Springer","intvolume":" 99","status":"public","publication_status":"published","title":"Guest editorial: Special issue on structured prediction and inference","_id":"3164","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","year":"2012","month":"09","day":"01","scopus_import":1,"language":[{"iso":"eng"}],"date_published":"2012-09-01T00:00:00Z","doi":"10.1007/s11263-012-0530-y","page":"257 - 258","quality_controlled":"1","citation":{"chicago":"Blaschko, Matthew, and Christoph Lampert. “Guest Editorial: Special Issue on Structured Prediction and Inference.” International Journal of Computer Vision. Springer, 2012. https://doi.org/10.1007/s11263-012-0530-y.","mla":"Blaschko, Matthew, and Christoph Lampert. “Guest Editorial: Special Issue on Structured Prediction and Inference.” International Journal of Computer Vision, vol. 99, no. 3, Springer, 2012, pp. 257–58, doi:10.1007/s11263-012-0530-y.","short":"M. Blaschko, C. Lampert, International Journal of Computer Vision 99 (2012) 257–258.","ista":"Blaschko M, Lampert C. 2012. Guest editorial: Special issue on structured prediction and inference. International Journal of Computer Vision. 99(3), 257–258.","apa":"Blaschko, M., & Lampert, C. (2012). Guest editorial: Special issue on structured prediction and inference. International Journal of Computer Vision. Springer. https://doi.org/10.1007/s11263-012-0530-y","ieee":"M. Blaschko and C. Lampert, “Guest editorial: Special issue on structured prediction and inference,” International Journal of Computer Vision, vol. 99, no. 3. Springer, pp. 257–258, 2012.","ama":"Blaschko M, Lampert C. Guest editorial: Special issue on structured prediction and inference. International Journal of Computer Vision. 2012;99(3):257-258. doi:10.1007/s11263-012-0530-y"},"publication":"International Journal of Computer Vision"},{"publication_status":"published","publisher":"BioMed Central","department":[{"_id":"NiBa"}],"acknowledgement":"The author was supported by the ERC-2009-AdG Grant for project 250152 SELECTIONINFORMATION. ","year":"2012","date_created":"2018-12-11T12:01:46Z","date_updated":"2021-01-12T07:41:31Z","volume":7,"author":[{"first_name":"Harold","last_name":"Vladar","id":"2A181218-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5985-7653","full_name":"Vladar, Harold"}],"article_number":"6","file_date_updated":"2020-07-14T12:46:02Z","publist_id":"3518","ec_funded":1,"quality_controlled":"1","project":[{"_id":"25B07788-B435-11E9-9278-68D0E5697425","grant_number":"250152","name":"Limits to selection in biology and in evolutionary computation","call_identifier":"FP7"}],"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"language":[{"iso":"eng"}],"doi":"10.1186/1745-6150-7-6","month":"02","ddc":["570","576"],"title":"Amino acid fermentation at the origin of the genetic code","status":"public","intvolume":" 7","_id":"3166","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","file":[{"content_type":"application/pdf","file_size":4099536,"creator":"system","file_name":"IST-2012-99-v1+1_1745-6150-7-6.pdf","access_level":"open_access","date_updated":"2020-07-14T12:46:02Z","date_created":"2018-12-12T10:15:44Z","checksum":"e511e401e239ef608a7fd79b21a06d78","relation":"main_file","file_id":"5166"}],"pubrep_id":"99","type":"journal_article","abstract":[{"text":"There is evidence that the genetic code was established prior to the existence of proteins, when metabolism was powered by ribozymes. Also, early proto-organisms had to rely on simple anaerobic bioenergetic processes. In this work I propose that amino acid fermentation powered metabolism in the RNA world, and that this was facilitated by proto-adapters, the precursors of the tRNAs. Amino acids were used as carbon sources rather than as catalytic or structural elements. In modern bacteria, amino acid fermentation is known as the Stickland reaction. This pathway involves two amino acids: the first undergoes oxidative deamination, and the second acts as an electron acceptor through reductive deamination. This redox reaction results in two keto acids that are employed to synthesise ATP via substrate-level phosphorylation. The Stickland reaction is the basic bioenergetic pathway of some bacteria of the genus Clostridium. Two other facts support Stickland fermentation in the RNA world. First, several Stickland amino acid pairs are synthesised in abiotic amino acid synthesis. This suggests that amino acids that could be used as an energy substrate were freely available. Second, anticodons that have complementary sequences often correspond to amino acids that form Stickland pairs. The main hypothesis of this paper is that pairs of complementary proto-adapters were assigned to Stickland amino acids pairs. There are signatures of this hypothesis in the genetic code. Furthermore, it is argued that the proto-adapters formed double strands that brought amino acid pairs into proximity to facilitate their mutual redox reaction, structurally constraining the anticodon pairs that are assigned to these amino acid pairs. Significance tests which randomise the code are performed to study the extent of the variability of the energetic (ATP) yield. Random assignments can lead to a substantial yield of ATP and maintain enough variability, thus selection can act and refine the assignments into a proto-code that optimises the energetic yield. Monte Carlo simulations are performed to evaluate the establishment of these simple proto-codes, based on amino acid substitutions and codon swapping. In all cases, donor amino acids are assigned to anticodons composed of U+G, and have low redundancy (1-2 codons), whereas acceptor amino acids are assigned to the the remaining codons. These bioenergetic and structural constraints allow for a metabolic role for amino acids before their co-option as catalyst cofactors. Reviewers: this article was reviewed by Prof. William Martin, Prof. Eors Szathmary (nominated by Dr. Gaspar Jekely) and Dr. Adam Kun (nominated by Dr. Sandor Pongor)","lang":"eng"}],"publication":"Biology Direct","citation":{"mla":"de Vladar, Harold. “Amino Acid Fermentation at the Origin of the Genetic Code.” Biology Direct, vol. 7, 6, BioMed Central, 2012, doi:10.1186/1745-6150-7-6.","short":"H. de Vladar, Biology Direct 7 (2012).","chicago":"Vladar, Harold de. “Amino Acid Fermentation at the Origin of the Genetic Code.” Biology Direct. BioMed Central, 2012. https://doi.org/10.1186/1745-6150-7-6.","ama":"de Vladar H. Amino acid fermentation at the origin of the genetic code. Biology Direct. 2012;7. doi:10.1186/1745-6150-7-6","ista":"de Vladar H. 2012. Amino acid fermentation at the origin of the genetic code. Biology Direct. 7, 6.","ieee":"H. de Vladar, “Amino acid fermentation at the origin of the genetic code,” Biology Direct, vol. 7. BioMed Central, 2012.","apa":"de Vladar, H. (2012). Amino acid fermentation at the origin of the genetic code. Biology Direct. BioMed Central. https://doi.org/10.1186/1745-6150-7-6"},"date_published":"2012-02-10T00:00:00Z","day":"10","has_accepted_license":"1"},{"month":"04","day":"06","date_published":"2012-04-06T00:00:00Z","doi":"10.1126/science.336.6077.32","language":[{"iso":"eng"}],"external_id":{"pmid":["22491839"]},"citation":{"mla":"Weber, Michele. “NextGen Speaks 13 .” Science, vol. 336, no. 6077, American Association for the Advancement of Science, 2012, pp. 32–34, doi:10.1126/science.336.6077.32.","short":"M. Weber, Science 336 (2012) 32–34.","chicago":"Weber, Michele. “NextGen Speaks 13 .” Science. American Association for the Advancement of Science, 2012. https://doi.org/10.1126/science.336.6077.32.","ama":"Weber M. NextGen speaks 13 . Science. 2012;336(6077):32-34. doi:10.1126/science.336.6077.32","ista":"Weber M. 2012. NextGen speaks 13 . Science. 336(6077), 32–34.","apa":"Weber, M. (2012). NextGen speaks 13 . Science. American Association for the Advancement of Science. https://doi.org/10.1126/science.336.6077.32","ieee":"M. Weber, “NextGen speaks 13 ,” Science, vol. 336, no. 6077. American Association for the Advancement of Science, pp. 32–34, 2012."},"publication":"Science","page":"32-34","article_type":"letter_note","publist_id":"3516","issue":"6077","type":"journal_article","popular_science":"1","author":[{"last_name":"Weber","first_name":"Michele","id":"3A3FC708-F248-11E8-B48F-1D18A9856A87","full_name":"Weber, Michele"}],"volume":336,"oa_version":"None","date_created":"2018-12-11T12:01:47Z","date_updated":"2021-01-12T07:41:32Z","pmid":1,"year":"2012","_id":"3167","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"American Association for the Advancement of Science","department":[{"_id":"MiSi"}],"intvolume":" 336","status":"public","publication_status":"published","title":"NextGen speaks 13 "},{"day":"01","month":"11","date_published":"2012-11-01T00:00:00Z","doi":"10.1007/s00145-010-9090-x","page":"116 - 135","quality_controlled":0,"citation":{"apa":"Pietrzak, K. Z., & Wikström, D. (2012). Parallel repetition of computationally sound protocols revisited. Journal of Cryptology. Springer. https://doi.org/10.1007/s00145-010-9090-x","ieee":"K. Z. Pietrzak and D. Wikström, “Parallel repetition of computationally sound protocols revisited,” Journal of Cryptology, vol. 25, no. 1. Springer, pp. 116–135, 2012.","ista":"Pietrzak KZ, Wikström D. 2012. Parallel repetition of computationally sound protocols revisited. Journal of Cryptology. 25(1), 116–135.","ama":"Pietrzak KZ, Wikström D. Parallel repetition of computationally sound protocols revisited. Journal of Cryptology. 2012;25(1):116-135. doi:10.1007/s00145-010-9090-x","chicago":"Pietrzak, Krzysztof Z, and Douglas Wikström. “Parallel Repetition of Computationally Sound Protocols Revisited.” Journal of Cryptology. Springer, 2012. https://doi.org/10.1007/s00145-010-9090-x.","short":"K.Z. Pietrzak, D. Wikström, Journal of Cryptology 25 (2012) 116–135.","mla":"Pietrzak, Krzysztof Z., and Douglas Wikström. “Parallel Repetition of Computationally Sound Protocols Revisited.” Journal of Cryptology, vol. 25, no. 1, Springer, 2012, pp. 116–35, doi:10.1007/s00145-010-9090-x."},"publication":"Journal of Cryptology","extern":1,"issue":"1","publist_id":"3439","abstract":[{"text":"We prove a negative result concerning error reduction by parallel repetition for computationally sound protocols, e.g., interactive arguments. Our main result is a complete and computationally sound eight round interactive argument for which k-fold parallel repetition does not reduce the error below a constant for any polynomial k. The starting point for our construction is the work of Bellare, Impagliazzo and Naor (FOCS'97). For any fixed k, they construct a four round protocol for which k-fold parallel repetition does not lower the soundness error. The communication complexity of this protocol is linear in k. By using universal arguments due to Barak and Goldreich (CCC 2002), we turn this protocol into an eight-round protocol whose complexity is basically independent of k. ","lang":"eng"}],"type":"journal_article","volume":25,"date_updated":"2021-01-12T07:42:03Z","date_created":"2018-12-11T12:02:12Z","author":[{"full_name":"Krzysztof Pietrzak","last_name":"Pietrzak","first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Wikström, Douglas","last_name":"Wikström","first_name":"Douglas"}],"intvolume":" 25","publisher":"Springer","status":"public","title":"Parallel repetition of computationally sound protocols revisited","publication_status":"published","_id":"3241","year":"2012"},{"page":"152 - 168","citation":{"ama":"Chatterjee K, Raman V. Synthesizing protocols for digital contract signing. In: Vol 7148. Springer; 2012:152-168. doi:10.1007/978-3-642-27940-9_11","apa":"Chatterjee, K., & Raman, V. (2012). Synthesizing protocols for digital contract signing (Vol. 7148, pp. 152–168). Presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Philadelphia, PA, USA: Springer. https://doi.org/10.1007/978-3-642-27940-9_11","ieee":"K. Chatterjee and V. Raman, “Synthesizing protocols for digital contract signing,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Philadelphia, PA, USA, 2012, vol. 7148, pp. 152–168.","ista":"Chatterjee K, Raman V. 2012. Synthesizing protocols for digital contract signing. VMCAI: Verification, Model Checking and Abstract Interpretation, LNCS, vol. 7148, 152–168.","short":"K. Chatterjee, V. Raman, in:, Springer, 2012, pp. 152–168.","mla":"Chatterjee, Krishnendu, and Vishwanath Raman. Synthesizing Protocols for Digital Contract Signing. Vol. 7148, Springer, 2012, pp. 152–68, doi:10.1007/978-3-642-27940-9_11.","chicago":"Chatterjee, Krishnendu, and Vishwanath Raman. “Synthesizing Protocols for Digital Contract Signing,” 7148:152–68. Springer, 2012. https://doi.org/10.1007/978-3-642-27940-9_11."},"date_published":"2012-01-20T00:00:00Z","scopus_import":1,"day":"20","intvolume":" 7148","status":"public","title":"Synthesizing protocols for digital contract signing","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"3252","oa_version":"Preprint","alternative_title":["LNCS"],"type":"conference","abstract":[{"lang":"eng","text":"We study the automatic synthesis of fair non-repudiation protocols, a class of fair exchange protocols, used for digital contract signing. First, we show how to specify the objectives of the participating agents, the trusted third party (TTP) and the protocols as path formulas in Linear Temporal Logic (LTL) and prove that the satisfaction of the objectives of the agents and the TTP imply satisfaction of the protocol objectives. We then show that weak (co-operative) co-synthesis and classical (strictly competitive) co-synthesis fail in synthesizing these protocols, whereas assume-guarantee synthesis (AGS) succeeds. We demonstrate the success of assume-guarantee synthesis as follows: (a) any solution of assume-guarantee synthesis is attack-free; no subset of participants can violate the objectives of the other participants without violating their own objectives; (b) the Asokan-Shoup-Waidner (ASW) certified mail protocol that has known vulnerabilities is not a solution of AGS; and (c) the Kremer-Markowitch (KM) non-repudiation protocol is a solution of AGS. To our knowledge this is the first application of synthesis to fair non-repudiation protocols, and our results show how synthesis can generate correct protocols and automatically discover vulnerabilities. The solution to assume-guarantee synthesis can be computed efficiently as the secure equilibrium solution of three-player graph games. © 2012 Springer-Verlag."}],"project":[{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1004.2697"}],"oa":1,"language":[{"iso":"eng"}],"doi":"10.1007/978-3-642-27940-9_11","conference":{"end_date":"2012-01-24","location":"Philadelphia, PA, USA","start_date":"2012-01-22","name":"VMCAI: Verification, Model Checking and Abstract Interpretation"},"month":"01","publisher":"Springer","department":[{"_id":"KrCh"}],"publication_status":"published","year":"2012","acknowledgement":"The research was supported by Austrian Science Fund (FWF) Grant No P 23499-N23 (Modern Graph Algorithmic Techniques in Formal Verification), FWF NFN Grant No S11407-N23 (RiSE), ERC Start grant (279307: Graph Games), and Microsoft faculty fellows award.\r\nThe authors would like to thank Avik Chaudhuri for his invaluable help and feedback.","volume":7148,"date_updated":"2021-01-12T07:42:08Z","date_created":"2018-12-11T12:02:16Z","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"last_name":"Raman","first_name":"Vishwanath","full_name":"Raman, Vishwanath"}],"publist_id":"3405","ec_funded":1},{"article_processing_charge":"No","has_accepted_license":"1","day":"01","scopus_import":1,"date_published":"2012-01-01T00:00:00Z","page":"37 - 46","citation":{"ama":"Chatterjee K, Doyen L. Games and Markov decision processes with mean payoff parity and energy parity objectives. In: Vol 7119. Springer; 2012:37-46. doi:10.1007/978-3-642-25929-6_3","ieee":"K. Chatterjee and L. Doyen, “Games and Markov decision processes with mean payoff parity and energy parity objectives,” presented at the MEMICS: Mathematical and Engineering Methods in Computer Science, Lednice, Czech Republic, 2012, vol. 7119, pp. 37–46.","apa":"Chatterjee, K., & Doyen, L. (2012). Games and Markov decision processes with mean payoff parity and energy parity objectives (Vol. 7119, pp. 37–46). Presented at the MEMICS: Mathematical and Engineering Methods in Computer Science, Lednice, Czech Republic: Springer. https://doi.org/10.1007/978-3-642-25929-6_3","ista":"Chatterjee K, Doyen L. 2012. Games and Markov decision processes with mean payoff parity and energy parity objectives. MEMICS: Mathematical and Engineering Methods in Computer Science, LNCS, vol. 7119, 37–46.","short":"K. Chatterjee, L. Doyen, in:, Springer, 2012, pp. 37–46.","mla":"Chatterjee, Krishnendu, and Laurent Doyen. Games and Markov Decision Processes with Mean Payoff Parity and Energy Parity Objectives. Vol. 7119, Springer, 2012, pp. 37–46, doi:10.1007/978-3-642-25929-6_3.","chicago":"Chatterjee, Krishnendu, and Laurent Doyen. “Games and Markov Decision Processes with Mean Payoff Parity and Energy Parity Objectives,” 7119:37–46. Springer, 2012. https://doi.org/10.1007/978-3-642-25929-6_3."},"abstract":[{"lang":"eng","text":"In this paper we survey results of two-player games on graphs and Markov decision processes with parity, mean-payoff and energy objectives, and the combination of mean-payoff and energy objectives with parity objectives. These problems have applications in verification and synthesis of reactive systems in resource-constrained environments."}],"alternative_title":["LNCS"],"type":"conference","oa_version":"Submitted Version","file":[{"content_type":"application/pdf","file_size":114060,"creator":"dernst","file_name":"2012_MEMICS_Chatterjee.pdf","access_level":"open_access","date_created":"2020-05-15T12:53:12Z","date_updated":"2020-07-14T12:46:05Z","checksum":"eed2cc1e76b160418c977e76e8899a60","relation":"main_file","file_id":"7863"}],"intvolume":" 7119","ddc":["000"],"title":"Games and Markov decision processes with mean payoff parity and energy parity objectives","status":"public","_id":"3255","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"01","language":[{"iso":"eng"}],"doi":"10.1007/978-3-642-25929-6_3","conference":{"name":"MEMICS: Mathematical and Engineering Methods in Computer Science","location":"Lednice, Czech Republic","start_date":"2011-10-14","end_date":"2011-10-16"},"project":[{"name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","oa":1,"publist_id":"3400","file_date_updated":"2020-07-14T12:46:05Z","volume":7119,"date_updated":"2021-01-12T07:42:10Z","date_created":"2018-12-11T12:02:17Z","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"full_name":"Doyen, Laurent","last_name":"Doyen","first_name":"Laurent"}],"publisher":"Springer","department":[{"_id":"KrCh"}],"publication_status":"published","year":"2012","acknowledgement":"This work was partially supported by FWF NFN Grant S11407-N23 (RiSE) and a Microsoft faculty fellowship."}]