[{"degree_awarded":"PhD","type":"dissertation","article_processing_charge":"No","citation":{"mla":"Reiter, Johannes. <i>The Subclonal Evolution of Cancer</i>. Institute of Science and Technology Austria, 2015.","short":"J. Reiter, The Subclonal Evolution of Cancer, Institute of Science and Technology Austria, 2015.","ama":"Reiter J. The subclonal evolution of cancer. 2015.","ista":"Reiter J. 2015. The subclonal evolution of cancer. Institute of Science and Technology Austria.","apa":"Reiter, J. (2015). <i>The subclonal evolution of cancer</i>. Institute of Science and Technology Austria.","ieee":"J. Reiter, “The subclonal evolution of cancer,” Institute of Science and Technology Austria, 2015.","chicago":"Reiter, Johannes. “The Subclonal Evolution of Cancer.” Institute of Science and Technology Austria, 2015."},"language":[{"iso":"eng"}],"publication_identifier":{"issn":["2663-337X"]},"publisher":"Institute of Science and Technology Austria","date_updated":"2023-09-07T11:40:44Z","publist_id":"5807","oa_version":"None","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","status":"public","month":"04","day":"01","related_material":{"record":[{"id":"1709","relation":"part_of_dissertation","status":"public"},{"relation":"part_of_dissertation","id":"2000","status":"public"},{"status":"public","id":"2247","relation":"part_of_dissertation"},{"status":"public","relation":"part_of_dissertation","id":"2816"},{"id":"2858","relation":"part_of_dissertation","status":"public"},{"relation":"part_of_dissertation","id":"3157","status":"public"},{"status":"public","id":"3260","relation":"part_of_dissertation"}]},"supervisor":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"}],"alternative_title":["ISTA Thesis"],"publication_status":"published","date_created":"2018-12-11T11:51:48Z","title":"The subclonal evolution of cancer","abstract":[{"lang":"eng","text":"Cancer results from an uncontrolled growth of abnormal cells. Sequentially accumulated genetic and epigenetic alterations decrease cell death and increase cell replication. We used mathematical models to quantify the effect of driver gene mutations. The recently developed targeted therapies can lead to dramatic regressions. However, in solid cancers, clinical responses are often short-lived because resistant cancer cells evolve. We estimated that approximately 50 different mutations can confer resistance to a typical targeted therapeutic agent. We find that resistant cells are likely to be present in expanded subclones before the start of the treatment. The dominant strategy to prevent the evolution of resistance is combination therapy. Our analytical results suggest that in most patients, dual therapy, but not monotherapy, can result in long-term disease control. However, long-term control can only occur if there are no possible mutations in the genome that can cause cross-resistance to both drugs. Furthermore, we showed that simultaneous therapy with two drugs is much more likely to result in long-term disease control than sequential therapy with the same drugs. To improve our understanding of the underlying subclonal evolution we reconstruct the evolutionary history of a patient's cancer from next-generation sequencing data of spatially-distinct DNA samples. Using a quantitative measure of genetic relatedness, we found that pancreatic cancers and their metastases demonstrated a higher level of relatedness than that expected for any two cells randomly taken from a normal tissue. This minimal amount of genetic divergence among advanced lesions indicates that genetic heterogeneity, when quantitatively defined, is not a fundamental feature of the natural history of untreated pancreatic cancers. Our newly developed, phylogenomic tool Treeomics finds evidence for seeding patterns of metastases and can directly be used to discover rules governing the evolution of solid malignancies to transform cancer into a more predictable disease."}],"year":"2015","_id":"1400","department":[{"_id":"KrCh"}],"date_published":"2015-04-01T00:00:00Z","author":[{"last_name":"Reiter","full_name":"Reiter, Johannes","id":"4A918E98-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0170-7353","first_name":"Johannes"}],"page":"183"},{"degree_awarded":"PhD","oa":1,"publication_identifier":{"issn":["2663-337X"]},"language":[{"iso":"eng"}],"doi":"10.15479/at:ista:1401","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","day":"01","supervisor":[{"id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph","first_name":"Christoph","last_name":"Lampert"}],"main_file_link":[{"url":"http://users.sussex.ac.uk/~nq28/viktoriia/Thesis_Sharmanska.pdf"}],"alternative_title":["ISTA Thesis"],"title":"Learning with attributes for object recognition: Parametric and non-parametrics views","acknowledgement":"I would like to thank my supervisor, Christoph Lampert, for guidance throughout my studies and for patience in transforming me into a scientist, and my thesis committee, Chris Wojtan and Horst Bischof, for their help and advice. \r\n\r\nI would like to thank Elisabeth Hacker who perfectly assisted all my administrative needs and was always nice and friendly to me, and the campus team for making the IST Austria campus my second home. \r\nI was honored to collaborate with brilliant researchers and to learn from their experience. Undoubtedly, I learned most of all from Novi Quadrianto: brainstorming our projects and getting exciting results was the most enjoyable part of my work – thank you! I am also grateful to David Knowles, Zoubin Ghahramani, Daniel Hernández-Lobato, Kristian Kersting and Anastasia Pentina for the fantastic projects we worked on together, and to Kristen Grauman and Adriana Kovashka for the exceptional experience working with user studies. I would like to thank my colleagues at IST Austria and my office mates who shared their happy moods, scientific breakthroughs and thought-provoking conversations with me: Chao, Filip, Rustem, Asya, Sameh, Alex, Vlad, Mayu, Neel, Csaba, Thomas, Vladimir, Cristina, Alex Z., Avro, Amelie and Emilie, Andreas H. and Andreas E., Chris, Lena, Michael, Ali and Ipek, Vera, Igor, Katia. Special thanks to Morten for the countless games of table soccer we played together and the tournaments we teamed up for: we will definitely win next time:) A very warm hug to Asya for always being so inspiring and supportive to me, and for helping me to increase the proportion of female computer scientists in our group. ","department":[{"_id":"ChLa"},{"_id":"GradSch"}],"year":"2015","type":"dissertation","article_processing_charge":"No","publisher":"Institute of Science and Technology Austria","has_accepted_license":"1","citation":{"ieee":"V. Sharmanska, “Learning with attributes for object recognition: Parametric and non-parametrics views,” Institute of Science and Technology Austria, 2015.","apa":"Sharmanska, V. (2015). <i>Learning with attributes for object recognition: Parametric and non-parametrics views</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:1401\">https://doi.org/10.15479/at:ista:1401</a>","chicago":"Sharmanska, Viktoriia. “Learning with Attributes for Object Recognition: Parametric and Non-Parametrics Views.” Institute of Science and Technology Austria, 2015. <a href=\"https://doi.org/10.15479/at:ista:1401\">https://doi.org/10.15479/at:ista:1401</a>.","mla":"Sharmanska, Viktoriia. <i>Learning with Attributes for Object Recognition: Parametric and Non-Parametrics Views</i>. Institute of Science and Technology Austria, 2015, doi:<a href=\"https://doi.org/10.15479/at:ista:1401\">10.15479/at:ista:1401</a>.","short":"V. Sharmanska, Learning with Attributes for Object Recognition: Parametric and Non-Parametrics Views, Institute of Science and Technology Austria, 2015.","ista":"Sharmanska V. 2015. Learning with attributes for object recognition: Parametric and non-parametrics views. Institute of Science and Technology Austria.","ama":"Sharmanska V. Learning with attributes for object recognition: Parametric and non-parametrics views. 2015. doi:<a href=\"https://doi.org/10.15479/at:ista:1401\">10.15479/at:ista:1401</a>"},"publist_id":"5806","oa_version":"Published Version","date_updated":"2023-09-07T11:40:11Z","status":"public","month":"04","ddc":["000"],"file":[{"file_name":"2015_Thesis_Sharmanska.pdf","file_size":7964342,"success":1,"date_updated":"2021-02-22T11:33:17Z","content_type":"application/pdf","relation":"main_file","file_id":"9177","creator":"dernst","checksum":"3605b402bb6934e09ae4cf672c84baf7","date_created":"2021-02-22T11:33:17Z","access_level":"open_access"},{"checksum":"e37593b3ee75bf3180629df2d6ca8f4e","creator":"cchlebak","access_level":"closed","date_created":"2021-11-16T14:40:45Z","file_id":"10297","relation":"main_file","file_name":"2015_Thesis_Sharmanska_pdfa.pdf","content_type":"application/pdf","date_updated":"2021-11-17T13:47:24Z","file_size":7372241}],"publication_status":"published","date_created":"2018-12-11T11:51:48Z","abstract":[{"lang":"eng","text":"The human ability to recognize objects in complex scenes has driven research in the computer vision field over couple of decades. This thesis focuses on the object recognition task in images. That is, given the image, we want the computer system to be able to predict the class of the object that appears in the image. A recent successful attempt to bridge semantic understanding of the image perceived by humans and by computers uses attribute-based models. Attributes are semantic properties of the objects shared across different categories, which humans and computers can decide on. To explore the attribute-based models we take a statistical machine learning approach, and address two key learning challenges in view of object recognition task: learning augmented attributes as mid-level discriminative feature representation, and learning with attributes as privileged information. Our main contributions are parametric and non-parametric models and algorithms to solve these frameworks. In the parametric approach, we explore an autoencoder model combined with the large margin nearest neighbor principle for mid-level feature learning, and linear support vector machines for learning with privileged information. In the non-parametric approach, we propose a supervised Indian Buffet Process for automatic augmentation of semantic attributes, and explore the Gaussian Processes classification framework for learning with privileged information. A thorough experimental analysis shows the effectiveness of the proposed models in both parametric and non-parametric views."}],"file_date_updated":"2021-11-17T13:47:24Z","_id":"1401","page":"144","author":[{"full_name":"Sharmanska, Viktoriia","orcid":"0000-0003-0192-9308","first_name":"Viktoriia","id":"2EA6D09E-F248-11E8-B48F-1D18A9856A87","last_name":"Sharmanska"}],"date_published":"2015-04-01T00:00:00Z"},{"issue":"6262","quality_controlled":"1","_id":"14013","date_published":"2015-10-22T00:00:00Z","intvolume":"       350","page":"790-795","author":[{"last_name":"Kraus","first_name":"P. M.","full_name":"Kraus, P. M."},{"last_name":"Mignolet","full_name":"Mignolet, B.","first_name":"B."},{"last_name":"Baykusheva","id":"71b4d059-2a03-11ee-914d-dfa3beed6530","full_name":"Baykusheva, Denitsa Rangelova","first_name":"Denitsa Rangelova"},{"first_name":"A.","full_name":"Rupenyan, A.","last_name":"Rupenyan"},{"full_name":"Horný, L.","first_name":"L.","last_name":"Horný"},{"first_name":"E. F.","full_name":"Penka, E. F.","last_name":"Penka"},{"last_name":"Grassi","full_name":"Grassi, G.","first_name":"G."},{"first_name":"O. I.","full_name":"Tolstikhin, O. I.","last_name":"Tolstikhin"},{"last_name":"Schneider","full_name":"Schneider, J.","first_name":"J."},{"first_name":"F.","full_name":"Jensen, F.","last_name":"Jensen"},{"full_name":"Madsen, L. B.","first_name":"L. B.","last_name":"Madsen"},{"last_name":"Bandrauk","full_name":"Bandrauk, A. D.","first_name":"A. D."},{"first_name":"F.","full_name":"Remacle, F.","last_name":"Remacle"},{"last_name":"Wörner","first_name":"H. J.","full_name":"Wörner, H. J."}],"volume":350,"scopus_import":"1","publication_status":"published","external_id":{"pmid":["26494175"]},"date_created":"2023-08-10T06:37:35Z","abstract":[{"text":"The ultrafast motion of electrons and holes after light-matter interaction is fundamental to a broad range of chemical and biophysical processes. We advanced high-harmonic spectroscopy to resolve spatially and temporally the migration of an electron hole immediately after ionization of iodoacetylene while simultaneously demonstrating extensive control over the process. A multidimensional approach, based on the measurement and accurate theoretical description of both even and odd harmonic orders, enabled us to reconstruct both quantum amplitudes and phases of the electronic states with a resolution of ~100 attoseconds. We separately reconstructed quasi-field-free and laser-controlled charge migration as a function of the spatial orientation of the molecule and determined the shape of the hole created by ionization. Our technique opens the prospect of laser control over electronic primary processes.","lang":"eng"}],"date_updated":"2023-08-22T08:47:39Z","oa_version":"None","status":"public","month":"10","type":"journal_article","article_processing_charge":"No","citation":{"chicago":"Kraus, P. M., B. Mignolet, Denitsa Rangelova Baykusheva, A. Rupenyan, L. Horný, E. F. Penka, G. Grassi, et al. “Measurement and Laser Control of Attosecond Charge Migration in Ionized Iodoacetylene.” <i>Science</i>. American Association for the Advancement of Science, 2015. <a href=\"https://doi.org/10.1126/science.aab2160\">https://doi.org/10.1126/science.aab2160</a>.","ieee":"P. M. Kraus <i>et al.</i>, “Measurement and laser control of attosecond charge migration in ionized iodoacetylene,” <i>Science</i>, vol. 350, no. 6262. American Association for the Advancement of Science, pp. 790–795, 2015.","apa":"Kraus, P. M., Mignolet, B., Baykusheva, D. R., Rupenyan, A., Horný, L., Penka, E. F., … Wörner, H. J. (2015). Measurement and laser control of attosecond charge migration in ionized iodoacetylene. <i>Science</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/science.aab2160\">https://doi.org/10.1126/science.aab2160</a>","ama":"Kraus PM, Mignolet B, Baykusheva DR, et al. Measurement and laser control of attosecond charge migration in ionized iodoacetylene. <i>Science</i>. 2015;350(6262):790-795. doi:<a href=\"https://doi.org/10.1126/science.aab2160\">10.1126/science.aab2160</a>","ista":"Kraus PM, Mignolet B, Baykusheva DR, Rupenyan A, Horný L, Penka EF, Grassi G, Tolstikhin OI, Schneider J, Jensen F, Madsen LB, Bandrauk AD, Remacle F, Wörner HJ. 2015. Measurement and laser control of attosecond charge migration in ionized iodoacetylene. Science. 350(6262), 790–795.","mla":"Kraus, P. M., et al. “Measurement and Laser Control of Attosecond Charge Migration in Ionized Iodoacetylene.” <i>Science</i>, vol. 350, no. 6262, American Association for the Advancement of Science, 2015, pp. 790–95, doi:<a href=\"https://doi.org/10.1126/science.aab2160\">10.1126/science.aab2160</a>.","short":"P.M. Kraus, B. Mignolet, D.R. Baykusheva, A. Rupenyan, L. Horný, E.F. Penka, G. Grassi, O.I. Tolstikhin, J. Schneider, F. Jensen, L.B. Madsen, A.D. Bandrauk, F. Remacle, H.J. Wörner, Science 350 (2015) 790–795."},"publisher":"American Association for the Advancement of Science","year":"2015","extern":"1","pmid":1,"title":"Measurement and laser control of attosecond charge migration in ionized iodoacetylene","doi":"10.1126/science.aab2160","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"Science","day":"22","article_type":"original","keyword":["Multidisciplinary"],"publication_identifier":{"eissn":["1095-9203"],"issn":["0036-8075"]},"language":[{"iso":"eng"}]},{"publication":"Journal of Physics: Conference Series","day":"01","doi":"10.1088/1742-6596/635/11/112135","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","keyword":["General Physics and Astronomy"],"oa":1,"language":[{"iso":"eng"}],"publication_identifier":{"issn":["1742-6588"],"eissn":["1742-6596"]},"article_number":"112135","article_type":"original","extern":"1","year":"2015","title":"Resolving the dynamics of valence-shell electrons and nuclei through laser-induced diffraction and holography","main_file_link":[{"url":"https://doi.org/10.1088/1742-6596/635/11/112135","open_access":"1"}],"date_updated":"2023-08-22T08:51:33Z","oa_version":"Published Version","month":"11","status":"public","article_processing_charge":"No","citation":{"ista":"Walt SG, Ram NB, von Conta A, Baykusheva DR, Atala M, Wörner HJ. 2015. Resolving the dynamics of valence-shell electrons and nuclei through laser-induced diffraction and holography. Journal of Physics: Conference Series. 635(11), 112135.","ama":"Walt SG, Ram NB, von Conta A, Baykusheva DR, Atala M, Wörner HJ. Resolving the dynamics of valence-shell electrons and nuclei through laser-induced diffraction and holography. <i>Journal of Physics: Conference Series</i>. 2015;635(11). doi:<a href=\"https://doi.org/10.1088/1742-6596/635/11/112135\">10.1088/1742-6596/635/11/112135</a>","mla":"Walt, Samuel G., et al. “Resolving the Dynamics of Valence-Shell Electrons and Nuclei through Laser-Induced Diffraction and Holography.” <i>Journal of Physics: Conference Series</i>, vol. 635, no. 11, 112135, IOP Publishing, 2015, doi:<a href=\"https://doi.org/10.1088/1742-6596/635/11/112135\">10.1088/1742-6596/635/11/112135</a>.","short":"S.G. Walt, N.B. Ram, A. von Conta, D.R. Baykusheva, M. Atala, H.J. Wörner, Journal of Physics: Conference Series 635 (2015).","chicago":"Walt, Samuel G, N Bhargava Ram, Aaron von Conta, Denitsa Rangelova Baykusheva, Marcos Atala, and Hans Jakob Wörner. “Resolving the Dynamics of Valence-Shell Electrons and Nuclei through Laser-Induced Diffraction and Holography.” <i>Journal of Physics: Conference Series</i>. IOP Publishing, 2015. <a href=\"https://doi.org/10.1088/1742-6596/635/11/112135\">https://doi.org/10.1088/1742-6596/635/11/112135</a>.","apa":"Walt, S. G., Ram, N. B., von Conta, A., Baykusheva, D. R., Atala, M., &#38; Wörner, H. J. (2015). Resolving the dynamics of valence-shell electrons and nuclei through laser-induced diffraction and holography. <i>Journal of Physics: Conference Series</i>. IOP Publishing. <a href=\"https://doi.org/10.1088/1742-6596/635/11/112135\">https://doi.org/10.1088/1742-6596/635/11/112135</a>","ieee":"S. G. Walt, N. B. Ram, A. von Conta, D. R. Baykusheva, M. Atala, and H. J. Wörner, “Resolving the dynamics of valence-shell electrons and nuclei through laser-induced diffraction and holography,” <i>Journal of Physics: Conference Series</i>, vol. 635, no. 11. IOP Publishing, 2015."},"publisher":"IOP Publishing","type":"journal_article","intvolume":"       635","date_published":"2015-11-01T00:00:00Z","author":[{"last_name":"Walt","full_name":"Walt, Samuel G","first_name":"Samuel G"},{"first_name":"N Bhargava","full_name":"Ram, N Bhargava","last_name":"Ram"},{"full_name":"von Conta, Aaron","first_name":"Aaron","last_name":"von Conta"},{"first_name":"Denitsa Rangelova","id":"71b4d059-2a03-11ee-914d-dfa3beed6530","full_name":"Baykusheva, Denitsa Rangelova","last_name":"Baykusheva"},{"first_name":"Marcos","full_name":"Atala, Marcos","last_name":"Atala"},{"full_name":"Wörner, Hans Jakob","first_name":"Hans Jakob","last_name":"Wörner"}],"volume":635,"issue":"11","quality_controlled":"1","_id":"14014","date_created":"2023-08-10T06:37:44Z","publication_status":"published","abstract":[{"text":"We have studied a coupled electronic-nuclear wave packet in nitric oxide using time-resolved strong-field photoelectron holography and rescattering. We show that the electronic dynamics mainly appears in the holographic structures whereas nuclear motion strongly modulates the angular distribution of the rescattered photoelectrons.","lang":"eng"}],"scopus_import":"1"},{"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1742-6596"],"issn":["1742-6588"]},"keyword":["General Physics and Astronomy"],"oa":1,"article_type":"original","article_number":"112136","day":"01","publication":"Journal of Physics: Conference Series","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1088/1742-6596/635/11/112136","title":"Attosecond charge migration and its laser control","main_file_link":[{"url":"https://doi.org/10.1088/1742-6596/635/11/112136","open_access":"1"}],"extern":"1","year":"2015","publisher":"IOP Publishing","citation":{"short":"P.M. Kraus, B. Mignolet, D.R. Baykusheva, A. Rupenyan, L. Horný, E.F. Penka, O.I. Tolstikhin, J. Schneider, F. Jensen, L.B. Madsen, A.D. Bandrauk, F. Remacle, H.J. Wörner, Journal of Physics: Conference Series 635 (2015).","mla":"Kraus, P. M., et al. “Attosecond Charge Migration and Its Laser Control.” <i>Journal of Physics: Conference Series</i>, vol. 635, no. 11, 112136, IOP Publishing, 2015, doi:<a href=\"https://doi.org/10.1088/1742-6596/635/11/112136\">10.1088/1742-6596/635/11/112136</a>.","ista":"Kraus PM, Mignolet B, Baykusheva DR, Rupenyan A, Horný L, Penka EF, Tolstikhin OI, Schneider J, Jensen F, Madsen LB, Bandrauk AD, Remacle F, Wörner HJ. 2015. Attosecond charge migration and its laser control. Journal of Physics: Conference Series. 635(11), 112136.","ama":"Kraus PM, Mignolet B, Baykusheva DR, et al. Attosecond charge migration and its laser control. <i>Journal of Physics: Conference Series</i>. 2015;635(11). doi:<a href=\"https://doi.org/10.1088/1742-6596/635/11/112136\">10.1088/1742-6596/635/11/112136</a>","apa":"Kraus, P. M., Mignolet, B., Baykusheva, D. R., Rupenyan, A., Horný, L., Penka, E. F., … Wörner, H. J. (2015). Attosecond charge migration and its laser control. <i>Journal of Physics: Conference Series</i>. IOP Publishing. <a href=\"https://doi.org/10.1088/1742-6596/635/11/112136\">https://doi.org/10.1088/1742-6596/635/11/112136</a>","ieee":"P. M. Kraus <i>et al.</i>, “Attosecond charge migration and its laser control,” <i>Journal of Physics: Conference Series</i>, vol. 635, no. 11. IOP Publishing, 2015.","chicago":"Kraus, P M, B Mignolet, Denitsa Rangelova Baykusheva, A Rupenyan, L Horný, E F Penka, O I Tolstikhin, et al. “Attosecond Charge Migration and Its Laser Control.” <i>Journal of Physics: Conference Series</i>. IOP Publishing, 2015. <a href=\"https://doi.org/10.1088/1742-6596/635/11/112136\">https://doi.org/10.1088/1742-6596/635/11/112136</a>."},"article_processing_charge":"No","type":"journal_article","status":"public","month":"07","oa_version":"Published Version","date_updated":"2023-08-22T08:49:14Z","abstract":[{"text":"We advance high-harmonic spectroscopy to resolve molecular charge migration in time and space and simultaneously demonstrate extensive control over the process. A multidimensional approach enables us to reconstruct both quantum amplitudes and phases with a resolution of better than 100 attoseconds and to separately reconstruct field-free and laser- driven charge migration. Our techniques make charge migration in molecules measurable on the attosecond time scale and open new avenues for laser control of electronic primary processes.","lang":"eng"}],"date_created":"2023-08-10T06:37:53Z","publication_status":"published","scopus_import":"1","author":[{"last_name":"Kraus","full_name":"Kraus, P M","first_name":"P M"},{"full_name":"Mignolet, B","first_name":"B","last_name":"Mignolet"},{"last_name":"Baykusheva","id":"71b4d059-2a03-11ee-914d-dfa3beed6530","full_name":"Baykusheva, Denitsa Rangelova","first_name":"Denitsa Rangelova"},{"first_name":"A","full_name":"Rupenyan, A","last_name":"Rupenyan"},{"last_name":"Horný","full_name":"Horný, L","first_name":"L"},{"full_name":"Penka, E F","first_name":"E F","last_name":"Penka"},{"last_name":"Tolstikhin","first_name":"O I","full_name":"Tolstikhin, O I"},{"first_name":"J","full_name":"Schneider, J","last_name":"Schneider"},{"first_name":"F","full_name":"Jensen, F","last_name":"Jensen"},{"first_name":"L B","full_name":"Madsen, L B","last_name":"Madsen"},{"full_name":"Bandrauk, A D","first_name":"A D","last_name":"Bandrauk"},{"first_name":"F","full_name":"Remacle, F","last_name":"Remacle"},{"last_name":"Wörner","first_name":"H J","full_name":"Wörner, H J"}],"volume":635,"date_published":"2015-07-01T00:00:00Z","intvolume":"       635","_id":"14015","issue":"11","quality_controlled":"1"},{"abstract":[{"text":"All attosecond time-resolved measurements have so far relied on the use of intense near-infrared laser pulses. In particular, attosecond streaking, laser-induced electron diffraction and high-harmonic generation all make use of non-perturbative light–matter interactions. Remarkably, the effect of the strong laser field on the studied sample has often been neglected in previous studies. Here we use high-harmonic spectroscopy to measure laser-induced modifications of the electronic structure of molecules. We study high-harmonic spectra of spatially oriented CH3F and CH3Br as generic examples of polar polyatomic molecules. We accurately measure intensity ratios of even and odd-harmonic orders, and of the emission from aligned and unaligned molecules. We show that these robust observables reveal a substantial modification of the molecular electronic structure by the external laser field. Our insights offer new challenges and opportunities for a range of emerging strong-field attosecond spectroscopies.","lang":"eng"}],"external_id":{"pmid":["25940229"]},"publication_status":"published","date_created":"2023-08-10T06:38:01Z","scopus_import":"1","volume":6,"author":[{"first_name":"P. M.","full_name":"Kraus, P. M.","last_name":"Kraus"},{"full_name":"Tolstikhin, O. I.","first_name":"O. I.","last_name":"Tolstikhin"},{"last_name":"Baykusheva","id":"71b4d059-2a03-11ee-914d-dfa3beed6530","first_name":"Denitsa Rangelova","full_name":"Baykusheva, Denitsa Rangelova"},{"last_name":"Rupenyan","first_name":"A.","full_name":"Rupenyan, A."},{"last_name":"Schneider","full_name":"Schneider, J.","first_name":"J."},{"last_name":"Bisgaard","first_name":"C. Z.","full_name":"Bisgaard, C. Z."},{"full_name":"Morishita, T.","first_name":"T.","last_name":"Morishita"},{"last_name":"Jensen","full_name":"Jensen, F.","first_name":"F."},{"last_name":"Madsen","full_name":"Madsen, L. B.","first_name":"L. B."},{"full_name":"Wörner, H. J.","first_name":"H. J.","last_name":"Wörner"}],"date_published":"2015-05-05T00:00:00Z","intvolume":"         6","_id":"14016","quality_controlled":"1","publisher":"Springer Nature","citation":{"ama":"Kraus PM, Tolstikhin OI, Baykusheva DR, et al. Observation of laser-induced electronic structure in oriented polyatomic molecules. <i>Nature Communications</i>. 2015;6. doi:<a href=\"https://doi.org/10.1038/ncomms8039\">10.1038/ncomms8039</a>","ista":"Kraus PM, Tolstikhin OI, Baykusheva DR, Rupenyan A, Schneider J, Bisgaard CZ, Morishita T, Jensen F, Madsen LB, Wörner HJ. 2015. Observation of laser-induced electronic structure in oriented polyatomic molecules. Nature Communications. 6, 7039.","short":"P.M. Kraus, O.I. Tolstikhin, D.R. Baykusheva, A. Rupenyan, J. Schneider, C.Z. Bisgaard, T. Morishita, F. Jensen, L.B. Madsen, H.J. Wörner, Nature Communications 6 (2015).","mla":"Kraus, P. M., et al. “Observation of Laser-Induced Electronic Structure in Oriented Polyatomic Molecules.” <i>Nature Communications</i>, vol. 6, 7039, Springer Nature, 2015, doi:<a href=\"https://doi.org/10.1038/ncomms8039\">10.1038/ncomms8039</a>.","chicago":"Kraus, P. M., O. I. Tolstikhin, Denitsa Rangelova Baykusheva, A. Rupenyan, J. Schneider, C. Z. Bisgaard, T. Morishita, F. Jensen, L. B. Madsen, and H. J. Wörner. “Observation of Laser-Induced Electronic Structure in Oriented Polyatomic Molecules.” <i>Nature Communications</i>. Springer Nature, 2015. <a href=\"https://doi.org/10.1038/ncomms8039\">https://doi.org/10.1038/ncomms8039</a>.","apa":"Kraus, P. M., Tolstikhin, O. I., Baykusheva, D. R., Rupenyan, A., Schneider, J., Bisgaard, C. Z., … Wörner, H. J. (2015). Observation of laser-induced electronic structure in oriented polyatomic molecules. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/ncomms8039\">https://doi.org/10.1038/ncomms8039</a>","ieee":"P. M. Kraus <i>et al.</i>, “Observation of laser-induced electronic structure in oriented polyatomic molecules,” <i>Nature Communications</i>, vol. 6. Springer Nature, 2015."},"article_processing_charge":"No","type":"journal_article","status":"public","month":"05","oa_version":"Published Version","date_updated":"2023-08-22T08:52:56Z","title":"Observation of laser-induced electronic structure in oriented polyatomic molecules","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1038/ncomms8039"}],"pmid":1,"extern":"1","year":"2015","publication_identifier":{"eissn":["2041-1723"]},"language":[{"iso":"eng"}],"oa":1,"keyword":["General Physics and Astronomy","General Biochemistry","Genetics and Molecular Biology","General Chemistry","Multidisciplinary"],"article_type":"original","article_number":"7039","day":"05","publication":"Nature Communications","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1038/ncomms8039"},{"date_updated":"2023-08-22T08:56:34Z","oa_version":"Preprint","month":"02","status":"public","article_processing_charge":"No","citation":{"ista":"Zhang SB, Baykusheva DR, Kraus PM, Wörner HJ, Rohringer N. 2015. Theoretical study of molecular electronic and rotational coherences by high-order-harmonic generation. Physical Review A. 91(2), 023421.","ama":"Zhang SB, Baykusheva DR, Kraus PM, Wörner HJ, Rohringer N. Theoretical study of molecular electronic and rotational coherences by high-order-harmonic generation. <i>Physical Review A</i>. 2015;91(2). doi:<a href=\"https://doi.org/10.1103/physreva.91.023421\">10.1103/physreva.91.023421</a>","short":"S.B. Zhang, D.R. Baykusheva, P.M. Kraus, H.J. Wörner, N. Rohringer, Physical Review A 91 (2015).","mla":"Zhang, Song Bin, et al. “Theoretical Study of Molecular Electronic and Rotational Coherences by High-Order-Harmonic Generation.” <i>Physical Review A</i>, vol. 91, no. 2, 023421, American Physical Society, 2015, doi:<a href=\"https://doi.org/10.1103/physreva.91.023421\">10.1103/physreva.91.023421</a>.","chicago":"Zhang, Song Bin, Denitsa Rangelova Baykusheva, Peter M. Kraus, Hans Jakob Wörner, and Nina Rohringer. “Theoretical Study of Molecular Electronic and Rotational Coherences by High-Order-Harmonic Generation.” <i>Physical Review A</i>. American Physical Society, 2015. <a href=\"https://doi.org/10.1103/physreva.91.023421\">https://doi.org/10.1103/physreva.91.023421</a>.","apa":"Zhang, S. B., Baykusheva, D. R., Kraus, P. M., Wörner, H. J., &#38; Rohringer, N. (2015). Theoretical study of molecular electronic and rotational coherences by high-order-harmonic generation. <i>Physical Review A</i>. American Physical Society. <a href=\"https://doi.org/10.1103/physreva.91.023421\">https://doi.org/10.1103/physreva.91.023421</a>","ieee":"S. B. Zhang, D. R. Baykusheva, P. M. Kraus, H. J. Wörner, and N. Rohringer, “Theoretical study of molecular electronic and rotational coherences by high-order-harmonic generation,” <i>Physical Review A</i>, vol. 91, no. 2. American Physical Society, 2015."},"publisher":"American Physical Society","type":"journal_article","intvolume":"        91","date_published":"2015-02-19T00:00:00Z","author":[{"last_name":"Zhang","first_name":"Song Bin","full_name":"Zhang, Song Bin"},{"last_name":"Baykusheva","first_name":"Denitsa Rangelova","full_name":"Baykusheva, Denitsa Rangelova","id":"71b4d059-2a03-11ee-914d-dfa3beed6530"},{"last_name":"Kraus","first_name":"Peter M.","full_name":"Kraus, Peter M."},{"first_name":"Hans Jakob","full_name":"Wörner, Hans Jakob","last_name":"Wörner"},{"last_name":"Rohringer","full_name":"Rohringer, Nina","first_name":"Nina"}],"volume":91,"quality_controlled":"1","issue":"2","_id":"14017","date_created":"2023-08-10T06:38:10Z","publication_status":"published","external_id":{"arxiv":["1504.03933"]},"abstract":[{"lang":"eng","text":"The detection of electron motion and electronic wave-packet dynamics is one of the core goals of attosecond science. Recently, choosing the nitric oxide molecule as an example, we have introduced and demonstrated an experimental approach to measure coupled valence electronic and rotational wave packets using high-order-harmonic-generation (HHG) spectroscopy [Kraus et al., Phys. Rev. Lett. 111, 243005 (2013)]. A short outline of the theory to describe the combination of the pump and HHG probe process was published together with an extensive discussion of experimental results [Baykusheva et al., Faraday Discuss. 171, 113 (2014)]. The comparison of theory and experiment showed good agreement on a quantitative level. Here, we present the theory in detail, which is based on a generalized density-matrix approach that describes the pump process and the subsequent probing of the wave packets by a semiclassical quantitative rescattering approach. An in-depth analysis of the different Raman scattering contributions to the creation of the coupled rotational and electronic spin-orbit wave packets is made. We present results for parallel and perpendicular linear polarizations of the pump and probe laser pulses. Furthermore, an analysis of the combined rotational-electronic density matrix in terms of irreducible components is presented that facilitates interpretation of the results."}],"scopus_import":"1","publication":"Physical Review A","day":"19","doi":"10.1103/physreva.91.023421","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","keyword":["Atomic and Molecular Physics","and Optics"],"oa":1,"publication_identifier":{"eissn":["1094-1622"],"issn":["1050-2947"]},"language":[{"iso":"eng"}],"article_number":"023421","article_type":"original","extern":"1","year":"2015","arxiv":1,"title":"Theoretical study of molecular electronic and rotational coherences by high-order-harmonic generation","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1504.03933"}]},{"conference":{"name":"NIPS: Neural Information Processing Systems","end_date":"2015-12-12","location":"Montreal, Canada","start_date":"2015-12-07"},"intvolume":"        28","date_published":"2015-12-01T00:00:00Z","author":[{"full_name":"Kwitt, Roland","first_name":"Roland","last_name":"Kwitt"},{"id":"4700A070-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8871-5814","full_name":"Huber, Stefan","first_name":"Stefan","last_name":"Huber"},{"full_name":"Niethammer, Marc","first_name":"Marc","last_name":"Niethammer"},{"last_name":"Lin","first_name":"Weili","full_name":"Lin, Weili"},{"orcid":"0000-0002-9683-0724","id":"2ADD483A-F248-11E8-B48F-1D18A9856A87","first_name":"Ulrich","full_name":"Bauer, Ulrich","last_name":"Bauer"}],"volume":28,"page":"3070 - 3078","acknowledgement":"This work was partially supported by the Austrian Science FUnd, project no. KLI 00012.","quality_controlled":"1","year":"2015","_id":"1424","department":[{"_id":"HeEd"}],"alternative_title":["Advances in Neural Information Processing Systems"],"publication_status":"published","date_created":"2018-12-11T11:51:56Z","title":"Statistical topological data analysis-A kernel perspective","abstract":[{"lang":"eng","text":"We consider the problem of statistical computations with persistence diagrams, a summary representation of topological features in data. These diagrams encode persistent homology, a widely used invariant in topological data analysis. While several avenues towards a statistical treatment of the diagrams have been explored recently, we follow an alternative route that is motivated by the success of methods based on the embedding of probability measures into reproducing kernel Hilbert spaces. In fact, a positive definite kernel on persistence diagrams has recently been proposed, connecting persistent homology to popular kernel-based learning techniques such as support vector machines. However, important properties of that kernel enabling a principled use in the context of probability measure embeddings remain to be explored. Our contribution is to close this gap by proving universality of a variant of the original kernel, and to demonstrate its effective use in twosample hypothesis testing on synthetic as well as real-world data."}],"main_file_link":[{"open_access":"1","url":"https://papers.nips.cc/paper/5887-statistical-topological-data-analysis-a-kernel-perspective"}],"day":"01","date_updated":"2021-01-12T06:50:38Z","oa_version":"Submitted Version","publist_id":"5782","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"12","status":"public","oa":1,"citation":{"ieee":"R. Kwitt, S. Huber, M. Niethammer, W. Lin, and U. Bauer, “Statistical topological data analysis-A kernel perspective,” presented at the NIPS: Neural Information Processing Systems, Montreal, Canada, 2015, vol. 28, pp. 3070–3078.","apa":"Kwitt, R., Huber, S., Niethammer, M., Lin, W., &#38; Bauer, U. (2015). Statistical topological data analysis-A kernel perspective (Vol. 28, pp. 3070–3078). Presented at the NIPS: Neural Information Processing Systems, Montreal, Canada: Neural Information Processing Systems.","chicago":"Kwitt, Roland, Stefan Huber, Marc Niethammer, Weili Lin, and Ulrich Bauer. “Statistical Topological Data Analysis-A Kernel Perspective,” 28:3070–78. Neural Information Processing Systems, 2015.","short":"R. Kwitt, S. Huber, M. Niethammer, W. Lin, U. Bauer, in:, Neural Information Processing Systems, 2015, pp. 3070–3078.","mla":"Kwitt, Roland, et al. <i>Statistical Topological Data Analysis-A Kernel Perspective</i>. Vol. 28, Neural Information Processing Systems, 2015, pp. 3070–78.","ama":"Kwitt R, Huber S, Niethammer M, Lin W, Bauer U. Statistical topological data analysis-A kernel perspective. In: Vol 28. Neural Information Processing Systems; 2015:3070-3078.","ista":"Kwitt R, Huber S, Niethammer M, Lin W, Bauer U. 2015. Statistical topological data analysis-A kernel perspective. NIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, vol. 28, 3070–3078."},"language":[{"iso":"eng"}],"publisher":"Neural Information Processing Systems","type":"conference"},{"status":"public","month":"01","date_updated":"2021-01-12T06:50:39Z","oa_version":"None","publist_id":"5781","citation":{"ista":"Pentina A, Lampert C. 2015. Lifelong learning with non-i.i.d. tasks. NIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, vol. 2015, 1540–1548.","ama":"Pentina A, Lampert C. Lifelong learning with non-i.i.d. tasks. In: Vol 2015. Neural Information Processing Systems; 2015:1540-1548.","mla":"Pentina, Anastasia, and Christoph Lampert. <i>Lifelong Learning with Non-i.i.d. Tasks</i>. Vol. 2015, Neural Information Processing Systems, 2015, pp. 1540–48.","short":"A. Pentina, C. Lampert, in:, Neural Information Processing Systems, 2015, pp. 1540–1548.","chicago":"Pentina, Anastasia, and Christoph Lampert. “Lifelong Learning with Non-i.i.d. Tasks,” 2015:1540–48. Neural Information Processing Systems, 2015.","ieee":"A. Pentina and C. Lampert, “Lifelong learning with non-i.i.d. tasks,” presented at the NIPS: Neural Information Processing Systems, Montreal, Canada, 2015, vol. 2015, pp. 1540–1548.","apa":"Pentina, A., &#38; Lampert, C. (2015). Lifelong learning with non-i.i.d. tasks (Vol. 2015, pp. 1540–1548). Presented at the NIPS: Neural Information Processing Systems, Montreal, Canada: Neural Information Processing Systems."},"publisher":"Neural Information Processing Systems","type":"conference","intvolume":"      2015","date_published":"2015-01-01T00:00:00Z","conference":{"start_date":"2015-12-07","end_date":"2015-12-12","name":"NIPS: Neural Information Processing Systems","location":"Montreal, Canada"},"volume":2015,"page":"1540 - 1548","author":[{"last_name":"Pentina","id":"42E87FC6-F248-11E8-B48F-1D18A9856A87","first_name":"Anastasia","full_name":"Pentina, Anastasia"},{"id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph","first_name":"Christoph","last_name":"Lampert"}],"_id":"1425","quality_controlled":"1","abstract":[{"lang":"eng","text":"In this work we aim at extending the theoretical foundations of lifelong learning. Previous work analyzing this scenario is based on the assumption that learning tasks are sampled i.i.d. from a task environment or limited to strongly constrained data distributions. Instead, we study two scenarios when lifelong learning is possible, even though the observed tasks do not form an i.i.d. sample: first, when they are sampled from the same environment, but possibly with dependencies, and second, when the task environment is allowed to change over time in a consistent way. In the first case we prove a PAC-Bayesian theorem that can be seen as a direct generalization of the analogous previous result for the i.i.d. case. For the second scenario we propose to learn an inductive bias in form of a transfer procedure. We present a generalization bound and show on a toy example how it can be used to identify a beneficial transfer algorithm."}],"publication_status":"published","date_created":"2018-12-11T11:51:57Z","scopus_import":1,"day":"01","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"oa":1,"ec_funded":1,"year":"2015","department":[{"_id":"ChLa"}],"project":[{"call_identifier":"FP7","name":"Lifelong Learning of Visual Scene Understanding","_id":"2532554C-B435-11E9-9278-68D0E5697425","grant_number":"308036"}],"title":"Lifelong learning with non-i.i.d. tasks","alternative_title":["Advances in Neural Information Processing Systems"],"main_file_link":[{"open_access":"1","url":"http://papers.nips.cc/paper/6007-lifelong-learning-with-non-iid-tasks"}]},{"page":"1455 - 1462","author":[{"first_name":"Tiago","full_name":"Paixao, Tiago","id":"2C5658E6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2361-3953","last_name":"Paixao"},{"first_name":"Dirk","full_name":"Sudholt, Dirk","last_name":"Sudholt"},{"last_name":"Heredia","first_name":"Jorge","full_name":"Heredia, Jorge"},{"id":"42302D54-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6873-2967","first_name":"Barbora","full_name":"Trubenova, Barbora","last_name":"Trubenova"}],"date_published":"2015-07-11T00:00:00Z","conference":{"start_date":"2015-07-11","location":"Madrid, Spain","end_date":"2015-07-15","name":"GECCO: Genetic and evolutionary computation conference"},"quality_controlled":"1","project":[{"call_identifier":"FP7","grant_number":"618091","name":"Speed of Adaptation in Population Genetics and Evolutionary Computation","_id":"25B1EC9E-B435-11E9-9278-68D0E5697425"}],"department":[{"_id":"NiBa"},{"_id":"CaGu"}],"year":"2015","_id":"1430","publication_status":"published","date_created":"2018-12-11T11:51:58Z","title":"First steps towards a runtime comparison of natural and artificial evolution","abstract":[{"lang":"eng","text":"Evolutionary algorithms (EAs) form a popular optimisation paradigm inspired by natural evolution. In recent years the field of evolutionary computation has developed a rigorous analytical theory to analyse their runtime on many illustrative problems. Here we apply this theory to a simple model of natural evolution. In the Strong Selection Weak Mutation (SSWM) evolutionary regime the time between occurrence of new mutations is much longer than the time it takes for a new beneficial mutation to take over the population. In this situation, the population only contains copies of one genotype and evolution can be modelled as a (1+1)-type process where the probability of accepting a new genotype (improvements or worsenings) depends on the change in fitness. We present an initial runtime analysis of SSWM, quantifying its performance for various parameters and investigating differences to the (1+1) EA. We show that SSWM can have a moderate advantage over the (1+1) EA at crossing fitness valleys and study an example where SSWM outperforms the (1+1) EA by taking advantage of information on the fitness gradient."}],"main_file_link":[{"url":"http://arxiv.org/abs/1504.06260","open_access":"1"}],"scopus_import":1,"day":"11","publication":"Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation","publist_id":"5768","oa_version":"Preprint","doi":"10.1145/2739480.2754758","date_updated":"2021-01-12T06:50:41Z","month":"07","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"language":[{"iso":"eng"}],"publisher":"ACM","citation":{"apa":"Paixao, T., Sudholt, D., Heredia, J., &#38; Trubenova, B. (2015). First steps towards a runtime comparison of natural and artificial evolution. In <i>Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation</i> (pp. 1455–1462). Madrid, Spain: ACM. <a href=\"https://doi.org/10.1145/2739480.2754758\">https://doi.org/10.1145/2739480.2754758</a>","ieee":"T. Paixao, D. Sudholt, J. Heredia, and B. Trubenova, “First steps towards a runtime comparison of natural and artificial evolution,” in <i>Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation</i>, Madrid, Spain, 2015, pp. 1455–1462.","chicago":"Paixao, Tiago, Dirk Sudholt, Jorge Heredia, and Barbora Trubenova. “First Steps towards a Runtime Comparison of Natural and Artificial Evolution.” In <i>Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation</i>, 1455–62. ACM, 2015. <a href=\"https://doi.org/10.1145/2739480.2754758\">https://doi.org/10.1145/2739480.2754758</a>.","mla":"Paixao, Tiago, et al. “First Steps towards a Runtime Comparison of Natural and Artificial Evolution.” <i>Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation</i>, ACM, 2015, pp. 1455–62, doi:<a href=\"https://doi.org/10.1145/2739480.2754758\">10.1145/2739480.2754758</a>.","short":"T. Paixao, D. Sudholt, J. Heredia, B. Trubenova, in:, Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation, ACM, 2015, pp. 1455–1462.","ama":"Paixao T, Sudholt D, Heredia J, Trubenova B. First steps towards a runtime comparison of natural and artificial evolution. In: <i>Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation</i>. ACM; 2015:1455-1462. doi:<a href=\"https://doi.org/10.1145/2739480.2754758\">10.1145/2739480.2754758</a>","ista":"Paixao T, Sudholt D, Heredia J, Trubenova B. 2015. First steps towards a runtime comparison of natural and artificial evolution. Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation. GECCO: Genetic and evolutionary computation conference, 1455–1462."},"type":"conference","ec_funded":1},{"month":"06","status":"public","date_updated":"2023-11-07T11:56:32Z","oa_version":"Published Version","type":"journal_article","citation":{"chicago":"Kick, B, Florian M Praetorius, H Dietz, and D Weuster-Botz. “Efficient Production of Single-Stranded Phage DNA as Scaffolds for DNA Origami.” <i>Nano Letters</i>. ACS Publications, 2015. <a href=\"https://doi.org/10.1021/acs.nanolett.5b01461\">https://doi.org/10.1021/acs.nanolett.5b01461</a>.","ieee":"B. Kick, F. M. Praetorius, H. Dietz, and D. Weuster-Botz, “Efficient production of single-stranded phage DNA as scaffolds for DNA origami,” <i>Nano Letters</i>, vol. 15, no. 7. ACS Publications, pp. 4672–4676, 2015.","apa":"Kick, B., Praetorius, F. M., Dietz, H., &#38; Weuster-Botz, D. (2015). Efficient production of single-stranded phage DNA as scaffolds for DNA origami. <i>Nano Letters</i>. ACS Publications. <a href=\"https://doi.org/10.1021/acs.nanolett.5b01461\">https://doi.org/10.1021/acs.nanolett.5b01461</a>","ama":"Kick B, Praetorius FM, Dietz H, Weuster-Botz D. Efficient production of single-stranded phage DNA as scaffolds for DNA origami. <i>Nano Letters</i>. 2015;15(7):4672-4676. doi:<a href=\"https://doi.org/10.1021/acs.nanolett.5b01461\">10.1021/acs.nanolett.5b01461</a>","ista":"Kick B, Praetorius FM, Dietz H, Weuster-Botz D. 2015. Efficient production of single-stranded phage DNA as scaffolds for DNA origami. Nano Letters. 15(7), 4672–4676.","mla":"Kick, B., et al. “Efficient Production of Single-Stranded Phage DNA as Scaffolds for DNA Origami.” <i>Nano Letters</i>, vol. 15, no. 7, ACS Publications, 2015, pp. 4672–76, doi:<a href=\"https://doi.org/10.1021/acs.nanolett.5b01461\">10.1021/acs.nanolett.5b01461</a>.","short":"B. Kick, F.M. Praetorius, H. Dietz, D. Weuster-Botz, Nano Letters 15 (2015) 4672–4676."},"publisher":"ACS Publications","article_processing_charge":"No","_id":"14303","quality_controlled":"1","issue":"7","intvolume":"        15","date_published":"2015-06-01T00:00:00Z","page":"4672-4676","volume":15,"author":[{"last_name":"Kick","full_name":"Kick, B","first_name":"B"},{"last_name":"Praetorius","full_name":"Praetorius, Florian M","id":"dfec9381-4341-11ee-8fd8-faa02bba7d62","first_name":"Florian M"},{"first_name":"H","full_name":"Dietz, H","last_name":"Dietz"},{"full_name":"Weuster-Botz, D","first_name":"D","last_name":"Weuster-Botz"}],"abstract":[{"text":"Scaffolded DNA origami enables the fabrication of a variety of complex nanostructures that promise utility in diverse fields of application, ranging from biosensing over advanced therapeutics to metamaterials. The broad applicability of DNA origami as a material beyond the level of proof-of-concept studies critically depends, among other factors, on the availability of large amounts of pure single-stranded scaffold DNA. Here, we present a method for the efficient production of M13 bacteriophage-derived genomic DNA using high-cell-density fermentation of Escherichia coli in stirred-tank bioreactors. We achieve phage titers of up to 1.6 × 1014 plaque-forming units per mL. Downstream processing yields up to 410 mg of high-quality single-stranded DNA per one liter reaction volume, thus upgrading DNA origami-based nanotechnology from the milligram to the gram scale.","lang":"eng"}],"date_created":"2023-09-06T12:52:47Z","external_id":{"pmid":["26028443"]},"publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1021/acs.nanolett.5b01461","publication":"Nano Letters","day":"01","article_type":"letter_note","language":[{"iso":"eng"}],"publication_identifier":{"issn":["1530-6984"],"eissn":["1530-6992"]},"oa":1,"year":"2015","pmid":1,"extern":"1","main_file_link":[{"url":"https://doi.org/10.1021/acs.nanolett.5b01461","open_access":"1"}],"title":"Efficient production of single-stranded phage DNA as scaffolds for DNA origami"},{"_id":"1473","year":"2015","quality_controlled":0,"issue":"370","page":"113 - 156","author":[{"first_name":"Tamas","full_name":"Tamas Hausel","id":"4A0666D8-F248-11E8-B48F-1D18A9856A87","last_name":"Hausel"},{"last_name":"Rodríguez Villegas","first_name":"Fernando","full_name":"Rodríguez Villegas, Fernando"}],"volume":2015,"extern":1,"intvolume":"      2015","date_published":"2015-01-01T00:00:00Z","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1309.4914"}],"abstract":[{"text":"In this paper we survey geometric and arithmetic techniques to study the cohomology of semiprojective hyperkähler manifolds including toric hyperkähler varieties, Nakajima quiver varieties and moduli spaces of Higgs bundles on Riemann surfaces. The resulting formulae for their Poincaré polynomials are combinatorial and representation theoretical in nature. In particular we will look at their Betti numbers and will establish some results and state some expectations on their asymptotic shape.","lang":"eng"}],"title":"Cohomology of large semiprojective hyperkähler varieties","publication_status":"published","date_created":"2018-12-11T11:52:13Z","status":"public","month":"01","publist_id":"5723","date_updated":"2021-01-12T06:50:59Z","day":"01","publication":"Asterisque","type":"review","publisher":"Societe Mathematique de France","citation":{"apa":"Hausel, T., &#38; Rodríguez Villegas, F. (2015). Cohomology of large semiprojective hyperkähler varieties. <i>Asterisque</i>. Societe Mathematique de France.","ieee":"T. Hausel and F. Rodríguez Villegas, “Cohomology of large semiprojective hyperkähler varieties,” <i>Asterisque</i>, vol. 2015, no. 370. Societe Mathematique de France, pp. 113–156, 2015.","chicago":"Hausel, Tamás, and Fernando Rodríguez Villegas. “Cohomology of Large Semiprojective Hyperkähler Varieties.” <i>Asterisque</i>. Societe Mathematique de France, 2015.","short":"T. Hausel, F. Rodríguez Villegas, Asterisque 2015 (2015) 113–156.","mla":"Hausel, Tamás, and Fernando Rodríguez Villegas. “Cohomology of Large Semiprojective Hyperkähler Varieties.” <i>Asterisque</i>, vol. 2015, no. 370, Societe Mathematique de France, 2015, pp. 113–56.","ama":"Hausel T, Rodríguez Villegas F. Cohomology of large semiprojective hyperkähler varieties. <i>Asterisque</i>. 2015;2015(370):113-156.","ista":"Hausel T, Rodríguez Villegas F. 2015. Cohomology of large semiprojective hyperkähler varieties. Asterisque. 2015(370), 113–156."},"oa":1},{"day":"04","status":"public","month":"09","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"5722","oa_version":"Submitted Version","date_updated":"2021-01-12T06:50:59Z","doi":"10.1109/CSF.2015.11","language":[{"iso":"eng"}],"publisher":"IEEE","citation":{"ieee":"A. Ferrara, G. Fuchsbauer, B. Liu, and B. Warinschi, “Policy privacy in cryptographic access control,” presented at the CSF: Computer Security Foundations, Verona, Italy, 2015, pp. 46–60.","apa":"Ferrara, A., Fuchsbauer, G., Liu, B., &#38; Warinschi, B. (2015). Policy privacy in cryptographic access control (pp. 46–60). Presented at the CSF: Computer Security Foundations, Verona, Italy: IEEE. <a href=\"https://doi.org/10.1109/CSF.2015.11\">https://doi.org/10.1109/CSF.2015.11</a>","chicago":"Ferrara, Anna, Georg Fuchsbauer, Bin Liu, and Bogdan Warinschi. “Policy Privacy in Cryptographic Access Control,” 46–60. IEEE, 2015. <a href=\"https://doi.org/10.1109/CSF.2015.11\">https://doi.org/10.1109/CSF.2015.11</a>.","short":"A. Ferrara, G. Fuchsbauer, B. Liu, B. Warinschi, in:, IEEE, 2015, pp. 46–60.","mla":"Ferrara, Anna, et al. <i>Policy Privacy in Cryptographic Access Control</i>. IEEE, 2015, pp. 46–60, doi:<a href=\"https://doi.org/10.1109/CSF.2015.11\">10.1109/CSF.2015.11</a>.","ama":"Ferrara A, Fuchsbauer G, Liu B, Warinschi B. Policy privacy in cryptographic access control. In: IEEE; 2015:46-60. doi:<a href=\"https://doi.org/10.1109/CSF.2015.11\">10.1109/CSF.2015.11</a>","ista":"Ferrara A, Fuchsbauer G, Liu B, Warinschi B. 2015. Policy privacy in cryptographic access control. CSF: Computer Security Foundations, 46–60."},"article_processing_charge":"No","oa":1,"type":"conference","ec_funded":1,"page":"46-60","author":[{"last_name":"Ferrara","first_name":"Anna","full_name":"Ferrara, Anna"},{"full_name":"Fuchsbauer, Georg","id":"46B4C3EE-F248-11E8-B48F-1D18A9856A87","first_name":"Georg","last_name":"Fuchsbauer"},{"full_name":"Liu, Bin","first_name":"Bin","last_name":"Liu"},{"full_name":"Warinschi, Bogdan","first_name":"Bogdan","last_name":"Warinschi"}],"date_published":"2015-09-04T00:00:00Z","conference":{"location":"Verona, Italy","end_date":"2015-07-17","name":"CSF: Computer Security Foundations","start_date":"2015-07-13"},"department":[{"_id":"KrPi"}],"_id":"1474","year":"2015","quality_controlled":"1","project":[{"grant_number":"259668","_id":"258C570E-B435-11E9-9278-68D0E5697425","name":"Provable Security for Physical Cryptography","call_identifier":"FP7"}],"title":"Policy privacy in cryptographic access control","abstract":[{"text":"Cryptographic access control offers selective access to encrypted data via a combination of key management and functionality-rich cryptographic schemes, such as attribute-based encryption. Using this approach, publicly available meta-data may inadvertently leak information on the access policy that is enforced by cryptography, which renders cryptographic access control unusable in settings where this information is highly sensitive. We begin to address this problem by presenting rigorous definitions for policy privacy in cryptographic access control. For concreteness we set our results in the model of Role-Based Access Control (RBAC), where we identify and formalize several different flavors of privacy, however, our framework should serve as inspiration for other models of access control. Based on our insights we propose a new system which significantly improves on the privacy properties of state-of-the-art constructions. Our design is based on a novel type of privacy-preserving attribute-based encryption, which we introduce and show how to instantiate. We present our results in the context of a cryptographic RBAC system by Ferrara et al. (CSF'13), which uses cryptography to control read access to files, while write access is still delegated to trusted monitors. We give an extension of the construction that permits cryptographic control over write access. Our construction assumes that key management uses out-of-band channels between the policy enforcer and the users but eliminates completely the need for monitoring read/write access to the data.","lang":"eng"}],"date_created":"2018-12-11T11:52:14Z","publication_status":"published","main_file_link":[{"open_access":"1","url":"http://epubs.surrey.ac.uk/808055/"}]},{"oa":1,"citation":{"ieee":"K. Chatterjee, Z. Komarkova, and J. Kretinsky, <i>Unifying two views on multiple mean-payoff objectives in Markov decision processes</i>. IST Austria, 2015.","apa":"Chatterjee, K., Komarkova, Z., &#38; Kretinsky, J. (2015). <i>Unifying two views on multiple mean-payoff objectives in Markov decision processes</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2015-318-v1-1\">https://doi.org/10.15479/AT:IST-2015-318-v1-1</a>","chicago":"Chatterjee, Krishnendu, Zuzana Komarkova, and Jan Kretinsky. <i>Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes</i>. IST Austria, 2015. <a href=\"https://doi.org/10.15479/AT:IST-2015-318-v1-1\">https://doi.org/10.15479/AT:IST-2015-318-v1-1</a>.","mla":"Chatterjee, Krishnendu, et al. <i>Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes</i>. IST Austria, 2015, doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-318-v1-1\">10.15479/AT:IST-2015-318-v1-1</a>.","short":"K. Chatterjee, Z. Komarkova, J. Kretinsky, Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes, IST Austria, 2015.","ama":"Chatterjee K, Komarkova Z, Kretinsky J. <i>Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes</i>. IST Austria; 2015. doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-318-v1-1\">10.15479/AT:IST-2015-318-v1-1</a>","ista":"Chatterjee K, Komarkova Z, Kretinsky J. 2015. Unifying two views on multiple mean-payoff objectives in Markov decision processes, IST Austria, 41p."},"publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1","publisher":"IST Austria","language":[{"iso":"eng"}],"type":"technical_report","day":"12","related_material":{"record":[{"relation":"later_version","id":"1657","status":"public"},{"relation":"later_version","id":"466","status":"public"},{"status":"public","id":"5435","relation":"later_version"}]},"pubrep_id":"318","file":[{"relation":"main_file","file_name":"IST-2015-318-v1+1_main.pdf","date_updated":"2020-07-14T12:46:52Z","content_type":"application/pdf","file_size":689863,"creator":"system","checksum":"e4869a584567c506349abda9c8ec7db3","access_level":"open_access","date_created":"2018-12-12T11:54:11Z","file_id":"5533"}],"doi":"10.15479/AT:IST-2015-318-v1-1","date_updated":"2023-02-23T12:26:16Z","oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["004"],"status":"public","month":"01","alternative_title":["IST Austria Technical Report"],"publication_status":"published","date_created":"2018-12-12T11:39:17Z","title":"Unifying two views on multiple mean-payoff objectives in Markov decision processes","abstract":[{"text":"We consider Markov decision processes (MDPs) with multiple limit-average (or mean-payoff) objectives. \r\nThere have been two different views: (i) the expectation semantics, where the goal is to optimize the expected mean-payoff objective, and (ii) the satisfaction semantics, where the goal is to maximize the probability of runs such that the mean-payoff value stays above a given vector.  \r\nWe consider the problem where the goal is to optimize the expectation under the constraint that the satisfaction semantics is ensured, and thus consider a generalization that unifies the existing semantics.\r\nOur problem captures the notion of optimization with respect to strategies that are risk-averse (i.e., ensures certain probabilistic guarantee).\r\nOur main results are algorithms for the decision problem which are always polynomial in the size of the MDP. We also show that an approximation of the Pareto-curve can be computed in time polynomial in the size of the MDP, and the approximation factor, but exponential in the number of dimensions.\r\nFinally, we present a complete characterization of the strategy complexity (in terms of memory bounds and randomization) required to solve our problem.","lang":"eng"}],"file_date_updated":"2020-07-14T12:46:52Z","date_published":"2015-01-12T00:00:00Z","page":"41","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"last_name":"Komarkova","full_name":"Komarkova, Zuzana","first_name":"Zuzana"},{"last_name":"Kretinsky","orcid":"0000-0002-8122-2881","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","full_name":"Kretinsky, Jan"}],"year":"2015","_id":"5429","department":[{"_id":"KrCh"}]},{"publication_identifier":{"issn":["2664-1690"]},"publisher":"IST Austria","language":[{"iso":"eng"}],"has_accepted_license":"1","citation":{"apa":"Chatterjee, K., Ibsen-Jensen, R., &#38; Pavlogiannis, A. (2015). <i>Faster algorithms for quantitative verification in constant treewidth graphs</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2015-319-v1-1\">https://doi.org/10.15479/AT:IST-2015-319-v1-1</a>","ieee":"K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, <i>Faster algorithms for quantitative verification in constant treewidth graphs</i>. IST Austria, 2015.","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. <i>Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs</i>. IST Austria, 2015. <a href=\"https://doi.org/10.15479/AT:IST-2015-319-v1-1\">https://doi.org/10.15479/AT:IST-2015-319-v1-1</a>.","short":"K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs, IST Austria, 2015.","mla":"Chatterjee, Krishnendu, et al. <i>Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs</i>. IST Austria, 2015, doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-319-v1-1\">10.15479/AT:IST-2015-319-v1-1</a>.","ista":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2015. Faster algorithms for quantitative verification in constant treewidth graphs, IST Austria, 31p.","ama":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. <i>Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs</i>. IST Austria; 2015. doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-319-v1-1\">10.15479/AT:IST-2015-319-v1-1</a>"},"oa":1,"type":"technical_report","file":[{"date_created":"2018-12-12T11:53:21Z","access_level":"open_access","checksum":"62c6ea01e342553dcafb88a070fb1ad5","creator":"system","file_id":"5482","relation":"main_file","file_size":1089651,"content_type":"application/pdf","date_updated":"2020-07-14T12:46:52Z","file_name":"IST-2015-319-v1+1_long.pdf"}],"related_material":{"record":[{"relation":"later_version","id":"1607","status":"public"},{"relation":"later_version","id":"5437","status":"public"}]},"pubrep_id":"319","day":"10","month":"02","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000"],"oa_version":"Published Version","doi":"10.15479/AT:IST-2015-319-v1-1","date_updated":"2023-02-23T12:26:22Z","abstract":[{"text":"We consider the core algorithmic problems related to verification of systems with respect to three classical quantitative properties, namely, the mean- payoff property, the ratio property, and the minimum initial credit for energy property. The algorithmic problem given a graph and a quantitative property asks to compute the optimal value (the infimum value over all traces) from every node of the graph. We consider graphs with constant treewidth, and it is well-known that the control-flow graphs of most programs have constant treewidth. Let n denote the number of nodes of a graph, m the number of edges (for constant treewidth graphs m = O ( n ) ) and W the largest absolute value of the weights. Our main theoretical results are as follows. First, for constant treewidth graphs we present an algorithm that approximates the mean-payoff value within a mul- tiplicative factor of ∊ in time O ( n · log( n/∊ )) and linear space, as compared to the classical algorithms that require quadratic time. Second, for the ratio property we present an algorithm that for constant treewidth graphs works in time O ( n · log( | a · b · n | )) = O ( n · log( n · W )) , when the output is a b , as compared to the previously best known algorithm with running time O ( n 2 · log( n · W )) . Third, for the minimum initial credit problem we show that (i) for general graphs the problem can be solved in O ( n 2 · m ) time and the associated decision problem can be solved in O ( n · m ) time, improving the previous known O ( n 3 · m · log( n · W )) and O ( n 2 · m ) bounds, respectively; and (ii) for constant treewidth graphs we present an algorithm that requires O ( n · log n ) time, improving the previous known O ( n 4 · log( n · W )) bound. We have implemented some of our algorithms and show that they present a significant speedup on standard benchmarks.","lang":"eng"}],"file_date_updated":"2020-07-14T12:46:52Z","title":"Faster algorithms for quantitative verification in constant treewidth graphs","publication_status":"published","date_created":"2018-12-12T11:39:17Z","alternative_title":["IST Austria Technical Report"],"page":"31","author":[{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"},{"last_name":"Ibsen-Jensen","full_name":"Ibsen-Jensen, Rasmus","first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4783-0389"},{"id":"49704004-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas","first_name":"Andreas","last_name":"Pavlogiannis"}],"date_published":"2015-02-10T00:00:00Z","department":[{"_id":"KrCh"}],"_id":"5430","year":"2015"},{"file_date_updated":"2020-07-14T12:46:53Z","abstract":[{"lang":"eng","text":"We consider finite-state concurrent stochastic games, played by k>=2 players for an infinite number of rounds, where in every round, each player simultaneously and independently of the other players chooses an action, whereafter the successor state is determined by a probability distribution given by the current state and the chosen actions. We consider reachability objectives that given a target set of states require that some state in the target set is visited, and the dual safety objectives that given a target set require that only states in the target set are visited. We are interested in the complexity of stationary strategies measured by their patience, which is defined as the inverse of the smallest non-zero probability employed.\r\n\r\n Our main results are as follows: We show that in two-player zero-sum concurrent stochastic games (with reachability objective for one player and the complementary safety objective for the other player): (i) the optimal bound on the patience of optimal and epsilon-optimal strategies, for both players is doubly exponential; and (ii) even in games with a single non-absorbing state exponential (in the number of actions) patience is necessary. In general we study the class of non-zero-sum games admitting epsilon-Nash equilibria. We show that if there is at least one player with reachability objective, then doubly-exponential patience is needed in general for epsilon-Nash equilibrium strategies, whereas in contrast if all players have safety objectives, then the optimal bound on patience for epsilon-Nash equilibrium strategies is only exponential."}],"title":"The patience of concurrent stochastic games with safety and reachability objectives","publication_status":"published","date_created":"2018-12-12T11:39:17Z","alternative_title":["IST Austria Technical Report"],"page":"25","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee"},{"last_name":"Ibsen-Jensen","first_name":"Rasmus","full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389","id":"3B699956-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Kristoffer","full_name":"Hansen, Kristoffer","last_name":"Hansen"}],"date_published":"2015-02-19T00:00:00Z","department":[{"_id":"KrCh"}],"_id":"5431","year":"2015","language":[{"iso":"eng"}],"has_accepted_license":"1","publisher":"IST Austria","publication_identifier":{"issn":["2664-1690"]},"citation":{"ama":"Chatterjee K, Ibsen-Jensen R, Hansen K. <i>The Patience of Concurrent Stochastic Games with Safety and Reachability Objectives</i>. IST Austria; 2015. doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-322-v1-1\">10.15479/AT:IST-2015-322-v1-1</a>","ista":"Chatterjee K, Ibsen-Jensen R, Hansen K. 2015. The patience of concurrent stochastic games with safety and reachability objectives, IST Austria, 25p.","mla":"Chatterjee, Krishnendu, et al. <i>The Patience of Concurrent Stochastic Games with Safety and Reachability Objectives</i>. IST Austria, 2015, doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-322-v1-1\">10.15479/AT:IST-2015-322-v1-1</a>.","short":"K. Chatterjee, R. Ibsen-Jensen, K. Hansen, The Patience of Concurrent Stochastic Games with Safety and Reachability Objectives, IST Austria, 2015.","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Kristoffer Hansen. <i>The Patience of Concurrent Stochastic Games with Safety and Reachability Objectives</i>. IST Austria, 2015. <a href=\"https://doi.org/10.15479/AT:IST-2015-322-v1-1\">https://doi.org/10.15479/AT:IST-2015-322-v1-1</a>.","apa":"Chatterjee, K., Ibsen-Jensen, R., &#38; Hansen, K. (2015). <i>The patience of concurrent stochastic games with safety and reachability objectives</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2015-322-v1-1\">https://doi.org/10.15479/AT:IST-2015-322-v1-1</a>","ieee":"K. Chatterjee, R. Ibsen-Jensen, and K. Hansen, <i>The patience of concurrent stochastic games with safety and reachability objectives</i>. IST Austria, 2015."},"oa":1,"type":"technical_report","file":[{"relation":"main_file","content_type":"application/pdf","date_updated":"2020-07-14T12:46:53Z","file_size":661015,"file_name":"IST-2015-322-v1+1_safetygames.pdf","access_level":"open_access","date_created":"2018-12-12T11:53:31Z","checksum":"bfb858262c30445b8e472c40069178a2","creator":"system","file_id":"5491"}],"pubrep_id":"322","day":"19","month":"02","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["005","519"],"oa_version":"Published Version","doi":"10.15479/AT:IST-2015-322-v1-1","date_updated":"2021-01-12T08:02:13Z"},{"file":[{"file_id":"5519","checksum":"546c1b291d545e7b24aaaf4199dac671","creator":"system","date_created":"2018-12-12T11:53:57Z","access_level":"open_access","file_name":"IST-2015-323-v1+1_main.pdf","file_size":576347,"date_updated":"2020-07-14T12:46:53Z","content_type":"application/pdf","relation":"main_file"}],"related_material":{"record":[{"status":"public","id":"5421","relation":"earlier_version"},{"status":"public","id":"5440","relation":"later_version"}]},"pubrep_id":"323","day":"19","month":"02","status":"public","ddc":["005","576"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","doi":"10.15479/AT:IST-2015-323-v1-1","date_updated":"2023-02-23T12:26:33Z","has_accepted_license":"1","language":[{"iso":"eng"}],"publication_identifier":{"issn":["2664-1690"]},"publisher":"IST Austria","citation":{"chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. <i>The Complexity of Evolutionary Games on Graphs</i>. IST Austria, 2015. <a href=\"https://doi.org/10.15479/AT:IST-2015-323-v1-1\">https://doi.org/10.15479/AT:IST-2015-323-v1-1</a>.","ieee":"K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, <i>The complexity of evolutionary games on graphs</i>. IST Austria, 2015.","apa":"Chatterjee, K., Ibsen-Jensen, R., &#38; Nowak, M. (2015). <i>The complexity of evolutionary games on graphs</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2015-323-v1-1\">https://doi.org/10.15479/AT:IST-2015-323-v1-1</a>","ista":"Chatterjee K, Ibsen-Jensen R, Nowak M. 2015. The complexity of evolutionary games on graphs, IST Austria, 29p.","ama":"Chatterjee K, Ibsen-Jensen R, Nowak M. <i>The Complexity of Evolutionary Games on Graphs</i>. IST Austria; 2015. doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-323-v1-1\">10.15479/AT:IST-2015-323-v1-1</a>","short":"K. Chatterjee, R. Ibsen-Jensen, M. Nowak, The Complexity of Evolutionary Games on Graphs, IST Austria, 2015.","mla":"Chatterjee, Krishnendu, et al. <i>The Complexity of Evolutionary Games on Graphs</i>. IST Austria, 2015, doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-323-v1-1\">10.15479/AT:IST-2015-323-v1-1</a>."},"oa":1,"type":"technical_report","page":"29","author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu"},{"full_name":"Ibsen-Jensen, Rasmus","first_name":"Rasmus","orcid":"0000-0003-4783-0389","id":"3B699956-F248-11E8-B48F-1D18A9856A87","last_name":"Ibsen-Jensen"},{"last_name":"Nowak","first_name":"Martin","full_name":"Nowak, Martin"}],"date_published":"2015-02-19T00:00:00Z","department":[{"_id":"KrCh"}],"_id":"5432","year":"2015","file_date_updated":"2020-07-14T12:46:53Z","title":"The complexity of evolutionary games on graphs","abstract":[{"lang":"eng","text":"Evolution occurs in populations of reproducing individuals. The structure of the population affects the outcome of the evolutionary process. Evolutionary graph theory is a powerful approach to study this phenomenon. There are two graphs. The interaction graph specifies who interacts with whom in the context of evolution.The replacement graph specifies who competes with whom for reproduction. \r\nThe vertices of the two graphs are the same, and each vertex corresponds to an individual of the population. A key quantity is the fixation probability of a new mutant. It is defined as the probability that a newly introduced mutant (on a single vertex) generates a lineage of offspring which eventually takes over the entire population of resident individuals. The basic computational questions are as follows: (i) the qualitative question asks whether the fixation probability is positive; and (ii) the quantitative approximation question asks for an approximation of the fixation probability. \r\nOur main results are:\r\n(1) We show that the qualitative question is NP-complete and the quantitative approximation question is #P-hard in the special case when the interaction and the replacement graphs coincide and even with the restriction that the resident individuals do not reproduce (which corresponds to an invading population taking over an empty structure).\r\n(2) We show that in general the qualitative question is PSPACE-complete and the quantitative approximation question is PSPACE-hard and can be solved in exponential time.\r\n"}],"publication_status":"published","date_created":"2018-12-12T11:39:18Z","alternative_title":["IST Austria Technical Report"]},{"date_published":"2015-02-19T00:00:00Z","page":"16","author":[{"last_name":"Anonymous","full_name":"Anonymous, 1","first_name":"1"},{"last_name":"Anonymous","full_name":"Anonymous, 2","first_name":"2"}],"_id":"5434","year":"2015","alternative_title":["IST Austria Technical Report"],"publication_status":"published","date_created":"2018-12-12T11:39:18Z","file_date_updated":"2020-07-14T12:46:53Z","title":"Optimal cost indefinite-horizon reachability in goal DEC-POMDPs","abstract":[{"lang":"eng","text":"DEC-POMDPs extend POMDPs to a multi-agent setting, where several agents operate in an uncertain environment independently to achieve a joint objective. DEC-POMDPs have been studied with finite-horizon and infinite-horizon discounted-sum objectives, and there exist solvers both for exact and approximate solutions. In this work we consider Goal-DEC-POMDPs, where given a set of target states, the objective is to ensure that the target set is reached with minimal cost. We consider the indefinite-horizon (infinite-horizon with either discounted-sum, or undiscounted-sum, where absorbing goal states have zero-cost) problem. We present a new method to solve the problem that extends methods for finite-horizon DEC- POMDPs and the RTDP-Bel approach for POMDPs. We present experimental results on several examples, and show our approach presents promising results."}],"day":"19","pubrep_id":"326","file":[{"file_name":"IST-2015-326-v1+1_main.pdf","file_size":378162,"content_type":"application/pdf","date_updated":"2020-07-14T12:46:53Z","relation":"main_file","file_id":"5475","checksum":"8542fd0b10aed7811cd41077b8ccb632","creator":"system","date_created":"2018-12-12T11:53:14Z","access_level":"open_access"},{"file_id":"6317","checksum":"84c31c537bdaf7a91909f18d25d640ab","creator":"dernst","access_level":"closed","date_created":"2019-04-16T13:00:33Z","file_name":"IST-2015-326-v1+2_authors.txt","date_updated":"2020-07-14T12:46:53Z","content_type":"text/plain","file_size":64,"relation":"main_file"}],"date_updated":"2020-07-14T23:04:59Z","oa_version":"Published Version","ddc":["000"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"02","status":"public","oa":1,"citation":{"apa":"Anonymous, 1, &#38; Anonymous, 2. (2015). <i>Optimal cost indefinite-horizon reachability in goal DEC-POMDPs</i>. IST Austria.","ieee":"1 Anonymous and 2 Anonymous, <i>Optimal cost indefinite-horizon reachability in goal DEC-POMDPs</i>. IST Austria, 2015.","chicago":"Anonymous, 1, and 2 Anonymous. <i>Optimal Cost Indefinite-Horizon Reachability in Goal DEC-POMDPs</i>. IST Austria, 2015.","mla":"Anonymous, 1, and 2 Anonymous. <i>Optimal Cost Indefinite-Horizon Reachability in Goal DEC-POMDPs</i>. IST Austria, 2015.","short":"1 Anonymous, 2 Anonymous, Optimal Cost Indefinite-Horizon Reachability in Goal DEC-POMDPs, IST Austria, 2015.","ama":"Anonymous 1, Anonymous 2. <i>Optimal Cost Indefinite-Horizon Reachability in Goal DEC-POMDPs</i>. IST Austria; 2015.","ista":"Anonymous 1, Anonymous 2. 2015. Optimal cost indefinite-horizon reachability in goal DEC-POMDPs, IST Austria, 16p."},"language":[{"iso":"eng"}],"has_accepted_license":"1","publication_identifier":{"issn":["2664-1690"]},"publisher":"IST Austria","type":"technical_report"},{"oa":1,"publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1","publisher":"IST Austria","language":[{"iso":"eng"}],"citation":{"chicago":"Chatterjee, Krishnendu, Zuzana Komarkova, and Jan Kretinsky. <i>Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes</i>. IST Austria, 2015. <a href=\"https://doi.org/10.15479/AT:IST-2015-318-v2-1\">https://doi.org/10.15479/AT:IST-2015-318-v2-1</a>.","ieee":"K. Chatterjee, Z. Komarkova, and J. Kretinsky, <i>Unifying two views on multiple mean-payoff objectives in Markov decision processes</i>. IST Austria, 2015.","apa":"Chatterjee, K., Komarkova, Z., &#38; Kretinsky, J. (2015). <i>Unifying two views on multiple mean-payoff objectives in Markov decision processes</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2015-318-v2-1\">https://doi.org/10.15479/AT:IST-2015-318-v2-1</a>","ista":"Chatterjee K, Komarkova Z, Kretinsky J. 2015. Unifying two views on multiple mean-payoff objectives in Markov decision processes, IST Austria, 51p.","ama":"Chatterjee K, Komarkova Z, Kretinsky J. <i>Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes</i>. IST Austria; 2015. doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-318-v2-1\">10.15479/AT:IST-2015-318-v2-1</a>","mla":"Chatterjee, Krishnendu, et al. <i>Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes</i>. IST Austria, 2015, doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-318-v2-1\">10.15479/AT:IST-2015-318-v2-1</a>.","short":"K. Chatterjee, Z. Komarkova, J. Kretinsky, Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes, IST Austria, 2015."},"type":"technical_report","day":"23","file":[{"file_name":"IST-2015-318-v2+1_main.pdf","file_size":717630,"content_type":"application/pdf","date_updated":"2020-07-14T12:46:53Z","relation":"main_file","file_id":"5525","checksum":"75284adec80baabdfe71ff9ebbc27445","creator":"system","date_created":"2018-12-12T11:54:03Z","access_level":"open_access"}],"related_material":{"record":[{"relation":"later_version","id":"1657","status":"public"},{"status":"public","id":"466","relation":"later_version"},{"status":"public","id":"5429","relation":"earlier_version"}]},"pubrep_id":"327","oa_version":"Published Version","doi":"10.15479/AT:IST-2015-318-v2-1","date_updated":"2023-02-23T12:26:00Z","status":"public","month":"02","ddc":["004"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","date_created":"2018-12-12T11:39:19Z","alternative_title":["IST Austria Technical Report"],"file_date_updated":"2020-07-14T12:46:53Z","title":"Unifying two views on multiple mean-payoff objectives in Markov decision processes","abstract":[{"text":"We consider Markov decision processes (MDPs) with multiple limit-average (or mean-payoff) objectives. \r\nThere have been two different views: (i) the expectation semantics, where the goal is to optimize the expected mean-payoff objective, and (ii) the satisfaction semantics, where the goal is to maximize the probability of runs such that the mean-payoff value stays above a given vector.  \r\nWe consider the problem where the goal is to optimize the expectation under the constraint that the satisfaction semantics is ensured, and thus consider a generalization that unifies the existing semantics. Our problem captures the notion of optimization with respect to strategies that are risk-averse (i.e., ensures certain probabilistic guarantee).\r\nOur main results are algorithms for the decision problem which are always polynomial in the size of the MDP.\r\nWe also show that an approximation of the Pareto-curve can be computed in time polynomial in the size of the MDP, and the approximation factor, but exponential in the number of dimensions. Finally, we present a complete characterization of the strategy complexity (in terms of memory bounds and randomization) required to solve our problem.","lang":"eng"}],"author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"last_name":"Komarkova","full_name":"Komarkova, Zuzana","first_name":"Zuzana"},{"full_name":"Kretinsky, Jan","first_name":"Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8122-2881","last_name":"Kretinsky"}],"page":"51","date_published":"2015-02-23T00:00:00Z","department":[{"_id":"KrCh"}],"year":"2015","_id":"5435"},{"day":"24","pubrep_id":"331","related_material":{"record":[{"id":"1656","relation":"later_version","status":"public"},{"status":"public","id":"467","relation":"later_version"},{"status":"public","id":"5415","relation":"earlier_version"}]},"file":[{"file_id":"5541","creator":"system","checksum":"3c402f47d3669c28d04d1af405a08e3f","access_level":"open_access","date_created":"2018-12-12T11:54:19Z","file_name":"IST-2015-170-v2+2_report.pdf","date_updated":"2020-07-14T12:46:54Z","content_type":"application/pdf","file_size":569991,"relation":"main_file"}],"doi":"10.15479/AT:IST-2015-170-v2-2","date_updated":"2023-02-23T12:25:21Z","oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000"],"month":"04","status":"public","oa":1,"citation":{"chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. <i>Nested Weighted Automata</i>. IST Austria, 2015. <a href=\"https://doi.org/10.15479/AT:IST-2015-170-v2-2\">https://doi.org/10.15479/AT:IST-2015-170-v2-2</a>.","apa":"Chatterjee, K., Henzinger, T. A., &#38; Otop, J. (2015). <i>Nested weighted automata</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2015-170-v2-2\">https://doi.org/10.15479/AT:IST-2015-170-v2-2</a>","ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, <i>Nested weighted automata</i>. IST Austria, 2015.","ista":"Chatterjee K, Henzinger TA, Otop J. 2015. Nested weighted automata, IST Austria, 29p.","ama":"Chatterjee K, Henzinger TA, Otop J. <i>Nested Weighted Automata</i>. IST Austria; 2015. doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-170-v2-2\">10.15479/AT:IST-2015-170-v2-2</a>","short":"K. Chatterjee, T.A. Henzinger, J. Otop, Nested Weighted Automata, IST Austria, 2015.","mla":"Chatterjee, Krishnendu, et al. <i>Nested Weighted Automata</i>. IST Austria, 2015, doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-170-v2-2\">10.15479/AT:IST-2015-170-v2-2</a>."},"publisher":"IST Austria","publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1","language":[{"iso":"eng"}],"type":"technical_report","date_published":"2015-04-24T00:00:00Z","page":"29","author":[{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Otop","full_name":"Otop, Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","first_name":"Jan"}],"_id":"5436","year":"2015","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"alternative_title":["IST Austria Technical Report"],"publication_status":"published","date_created":"2018-12-12T11:39:19Z","abstract":[{"lang":"eng","text":"Recently there has been a significant effort to handle quantitative properties in formal verification and synthesis. While weighted automata over finite and infinite words provide a natural and flexible framework to express quantitative properties, perhaps surprisingly, some basic system properties such as average response time cannot be expressed using weighted automata, nor in any other know decidable formalism. In this work, we introduce nested weighted automata as a natural extension of weighted automata which makes it possible to express important quantitative properties such as average response time.\r\nIn nested weighted automata, a master automaton spins off and collects results from weighted slave automata, each of which computes a quantity along a finite portion of an infinite word. Nested weighted automata can be viewed as the quantitative analogue of monitor automata, which are used in run-time verification. We establish an almost complete decidability picture for the basic decision problems about nested weighted automata, and illustrate their applicability in several domains. In particular, nested weighted automata can be used to decide average response time properties."}],"file_date_updated":"2020-07-14T12:46:54Z","title":"Nested weighted automata"}]