[{"month":"03","quality_controlled":"1","isi":1,"project":[{"grant_number":"P29638","_id":"253B6E48-B435-11E9-9278-68D0E5697425","name":"Drosophila TNFa´s Funktion in Immunzellen","call_identifier":"FWF"},{"call_identifier":"FWF","name":"The role of Drosophila TNF alpha in immune cell invasion","grant_number":"P29638","_id":"253B6E48-B435-11E9-9278-68D0E5697425"},{"_id":"2637E9C0-B435-11E9-9278-68D0E5697425","grant_number":"LSC16-021 ","name":"Investigating the role of the novel major superfamily facilitator transporter family member MFSD1 in metastasis"},{"call_identifier":"FP7","name":"Investigating the role of transporters in invasive migration through junctions","grant_number":"334077","_id":"2536F660-B435-11E9-9278-68D0E5697425"}],"external_id":{"isi":["000426693300011"]},"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"},"oa":1,"acknowledged_ssus":[{"_id":"LifeSc"}],"language":[{"iso":"eng"}],"doi":"10.1534/g3.117.300452","file_date_updated":"2020-07-14T12:46:56Z","publist_id":"7271","ec_funded":1,"publication_status":"published","publisher":"Genetics Society of America","department":[{"_id":"DaSi"}],"acknowledgement":" A. Ratheesh also by Marie Curie IIF GA-2012-32950BB:DICJI, Marko Roblek by the provincial government of Lower Austria, K. Valoskova and S. Wachner by DOC Fellowships from the Austrian Academy of Sciences, ","year":"2018","date_created":"2018-12-11T11:47:05Z","date_updated":"2024-03-28T23:30:30Z","volume":8,"author":[{"first_name":"Attila","last_name":"György","id":"3BCEDBE0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1819-198X","full_name":"György, Attila"},{"id":"3047D808-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9588-1389","first_name":"Marko","last_name":"Roblek","full_name":"Roblek, Marko"},{"full_name":"Ratheesh, Aparna","first_name":"Aparna","last_name":"Ratheesh","id":"2F064CFE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7190-0776"},{"id":"46F146FC-F248-11E8-B48F-1D18A9856A87","last_name":"Valosková","first_name":"Katarina","full_name":"Valosková, Katarina"},{"last_name":"Belyaeva","first_name":"Vera","id":"47F080FE-F248-11E8-B48F-1D18A9856A87","full_name":"Belyaeva, Vera"},{"id":"2A95E7B0-F248-11E8-B48F-1D18A9856A87","first_name":"Stephanie","last_name":"Wachner","full_name":"Wachner, Stephanie"},{"first_name":"Yutaka","last_name":"Matsubayashi","full_name":"Matsubayashi, Yutaka"},{"last_name":"Sanchez Sanchez","first_name":"Besaiz","full_name":"Sanchez Sanchez, Besaiz"},{"last_name":"Stramer","first_name":"Brian","full_name":"Stramer, Brian"},{"full_name":"Siekhaus, Daria E","orcid":"0000-0001-8323-8353","id":"3D224B9E-F248-11E8-B48F-1D18A9856A87","last_name":"Siekhaus","first_name":"Daria E"}],"related_material":{"record":[{"relation":"research_paper","id":"6530"},{"id":"6543","relation":"research_paper"},{"id":"11193","relation":"dissertation_contains","status":"public"},{"relation":"dissertation_contains","status":"public","id":"6546"}]},"scopus_import":"1","day":"01","has_accepted_license":"1","article_processing_charge":"No","page":"845 - 857","publication":"G3: Genes, Genomes, Genetics","citation":{"ieee":"A. György et al., “Tools allowing independent visualization and genetic manipulation of Drosophila melanogaster macrophages and surrounding tissues,” G3: Genes, Genomes, Genetics, vol. 8, no. 3. Genetics Society of America, pp. 845–857, 2018.","apa":"György, A., Roblek, M., Ratheesh, A., Valosková, K., Belyaeva, V., Wachner, S., … Siekhaus, D. E. (2018). Tools allowing independent visualization and genetic manipulation of Drosophila melanogaster macrophages and surrounding tissues. G3: Genes, Genomes, Genetics. Genetics Society of America. https://doi.org/10.1534/g3.117.300452","ista":"György A, Roblek M, Ratheesh A, Valosková K, Belyaeva V, Wachner S, Matsubayashi Y, Sanchez Sanchez B, Stramer B, Siekhaus DE. 2018. Tools allowing independent visualization and genetic manipulation of Drosophila melanogaster macrophages and surrounding tissues. G3: Genes, Genomes, Genetics. 8(3), 845–857.","ama":"György A, Roblek M, Ratheesh A, et al. Tools allowing independent visualization and genetic manipulation of Drosophila melanogaster macrophages and surrounding tissues. G3: Genes, Genomes, Genetics. 2018;8(3):845-857. doi:10.1534/g3.117.300452","chicago":"György, Attila, Marko Roblek, Aparna Ratheesh, Katarina Valosková, Vera Belyaeva, Stephanie Wachner, Yutaka Matsubayashi, Besaiz Sanchez Sanchez, Brian Stramer, and Daria E Siekhaus. “Tools Allowing Independent Visualization and Genetic Manipulation of Drosophila Melanogaster Macrophages and Surrounding Tissues.” G3: Genes, Genomes, Genetics. Genetics Society of America, 2018. https://doi.org/10.1534/g3.117.300452.","short":"A. György, M. Roblek, A. Ratheesh, K. Valosková, V. Belyaeva, S. Wachner, Y. Matsubayashi, B. Sanchez Sanchez, B. Stramer, D.E. Siekhaus, G3: Genes, Genomes, Genetics 8 (2018) 845–857.","mla":"György, Attila, et al. “Tools Allowing Independent Visualization and Genetic Manipulation of Drosophila Melanogaster Macrophages and Surrounding Tissues.” G3: Genes, Genomes, Genetics, vol. 8, no. 3, Genetics Society of America, 2018, pp. 845–57, doi:10.1534/g3.117.300452."},"date_published":"2018-03-01T00:00:00Z","type":"journal_article","abstract":[{"lang":"eng","text":"Drosophila melanogaster plasmatocytes, the phagocytic cells among hemocytes, are essential for immune responses, but also play key roles from early development to death through their interactions with other cell types. They regulate homeostasis and signaling during development, stem cell proliferation, metabolism, cancer, wound responses and aging, displaying intriguing molecular and functional conservation with vertebrate macrophages. Given the relative ease of genetics in Drosophila compared to vertebrates, tools permitting visualization and genetic manipulation of plasmatocytes and surrounding tissues independently at all stages would greatly aid in fully understanding these processes, but are lacking. Here we describe a comprehensive set of transgenic lines that allow this. These include extremely brightly fluorescing mCherry-based lines that allow GAL4-independent visualization of plasmatocyte nuclei, cytoplasm or actin cytoskeleton from embryonic Stage 8 through adulthood in both live and fixed samples even as heterozygotes, greatly facilitating screening. These lines allow live visualization and tracking of embryonic plasmatocytes, as well as larval plasmatocytes residing at the body wall or flowing with the surrounding hemolymph. With confocal imaging, interactions of plasmatocytes and inner tissues can be seen in live or fixed embryos, larvae and adults. They permit efficient GAL4-independent FACS analysis/sorting of plasmatocytes throughout life. To facilitate genetic analysis of reciprocal signaling, we have also made a plasmatocyte-expressing QF2 line that in combination with extant GAL4 drivers allows independent genetic manipulation of both plasmatocytes and surrounding tissues, and a GAL80 line that blocks GAL4 drivers from affecting plasmatocytes, both of which function from the early embryo to the adult."}],"issue":"3","ddc":["570"],"status":"public","title":"Tools allowing independent visualization and genetic manipulation of Drosophila melanogaster macrophages and surrounding tissues","intvolume":" 8","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"544","file":[{"file_size":2251222,"content_type":"application/pdf","creator":"system","file_name":"IST-2018-990-v1+1_2018_Gyoergy_Tools_allowing.pdf","access_level":"open_access","date_updated":"2020-07-14T12:46:56Z","date_created":"2018-12-12T10:11:48Z","checksum":"7d9d28b915159078a4ca7add568010e8","relation":"main_file","file_id":"4905"}],"oa_version":"Published Version","pubrep_id":"990"},{"article_processing_charge":"No","has_accepted_license":"1","day":"01","scopus_import":"1","date_published":"2018-04-01T00:00:00Z","page":"1565 - 1587","article_type":"original","citation":{"chicago":"Luján, Rafael, Carolina Aguado, Francisco Ciruela, Javier Cózar, David Kleindienst, Luis De La Ossa, Bernhard Bettler, et al. “Differential Association of GABAB Receptors with Their Effector Ion Channels in Purkinje Cells.” Brain Structure and Function. Springer, 2018. https://doi.org/10.1007/s00429-017-1568-y.","mla":"Luján, Rafael, et al. “Differential Association of GABAB Receptors with Their Effector Ion Channels in Purkinje Cells.” Brain Structure and Function, vol. 223, no. 3, Springer, 2018, pp. 1565–87, doi:10.1007/s00429-017-1568-y.","short":"R. Luján, C. Aguado, F. Ciruela, J. Cózar, D. Kleindienst, L. De La Ossa, B. Bettler, K. Wickman, M. Watanabe, R. Shigemoto, Y. Fukazawa, Brain Structure and Function 223 (2018) 1565–1587.","ista":"Luján R, Aguado C, Ciruela F, Cózar J, Kleindienst D, De La Ossa L, Bettler B, Wickman K, Watanabe M, Shigemoto R, Fukazawa Y. 2018. Differential association of GABAB receptors with their effector ion channels in Purkinje cells. Brain Structure and Function. 223(3), 1565–1587.","apa":"Luján, R., Aguado, C., Ciruela, F., Cózar, J., Kleindienst, D., De La Ossa, L., … Fukazawa, Y. (2018). Differential association of GABAB receptors with their effector ion channels in Purkinje cells. Brain Structure and Function. Springer. https://doi.org/10.1007/s00429-017-1568-y","ieee":"R. Luján et al., “Differential association of GABAB receptors with their effector ion channels in Purkinje cells,” Brain Structure and Function, vol. 223, no. 3. Springer, pp. 1565–1587, 2018.","ama":"Luján R, Aguado C, Ciruela F, et al. Differential association of GABAB receptors with their effector ion channels in Purkinje cells. Brain Structure and Function. 2018;223(3):1565-1587. doi:10.1007/s00429-017-1568-y"},"publication":"Brain Structure and Function","issue":"3","abstract":[{"text":"Metabotropic GABAB receptors mediate slow inhibitory effects presynaptically and postsynaptically through the modulation of different effector signalling pathways. Here, we analysed the distribution of GABAB receptors using highly sensitive SDS-digested freeze-fracture replica labelling in mouse cerebellar Purkinje cells. Immunoreactivity for GABAB1 was observed on presynaptic and, more abundantly, on postsynaptic compartments, showing both scattered and clustered distribution patterns. Quantitative analysis of immunoparticles revealed a somato-dendritic gradient, with the density of immunoparticles increasing 26-fold from somata to dendritic spines. To understand the spatial relationship of GABAB receptors with two key effector ion channels, the G protein-gated inwardly rectifying K+ (GIRK/Kir3) channel and the voltage-dependent Ca2+ channel, biochemical and immunohistochemical approaches were performed. Co-immunoprecipitation analysis demonstrated that GABAB receptors co-assembled with GIRK and CaV2.1 channels in the cerebellum. Using double-labelling immunoelectron microscopic techniques, co-clustering between GABAB1 and GIRK2 was detected in dendritic spines, whereas they were mainly segregated in the dendritic shafts. In contrast, co-clustering of GABAB1 and CaV2.1 was detected in dendritic shafts but not spines. Presynaptically, although no significant co-clustering of GABAB1 and GIRK2 or CaV2.1 channels was detected, inter-cluster distance for GABAB1 and GIRK2 was significantly smaller in the active zone than in the dendritic shafts, and that for GABAB1 and CaV2.1 was significantly smaller in the active zone than in the dendritic shafts and spines. Thus, GABAB receptors are associated with GIRK and CaV2.1 channels in different subcellular compartments. These data provide a better framework for understanding the different roles played by GABAB receptors and their effector ion channels in the cerebellar network.","lang":"eng"}],"type":"journal_article","file":[{"creator":"system","content_type":"application/pdf","file_size":5542926,"access_level":"open_access","file_name":"IST-2018-1013-v1+1_2018_Kleindienst_Differential.pdf","checksum":"a55b3103476ecb5f4f983d8801807e8b","date_created":"2018-12-12T10:15:36Z","date_updated":"2020-07-14T12:47:20Z","file_id":"5157","relation":"main_file"}],"oa_version":"Published Version","pubrep_id":"1013","intvolume":" 223","status":"public","title":"Differential association of GABAB receptors with their effector ion channels in Purkinje cells","ddc":["571"],"_id":"612","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","month":"04","language":[{"iso":"eng"}],"doi":"10.1007/s00429-017-1568-y","project":[{"name":"Human Brain Project Specific Grant Agreement 1 (HBP SGA 1)","call_identifier":"H2020","_id":"25CBA828-B435-11E9-9278-68D0E5697425","grant_number":"720270"},{"grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7"}],"isi":1,"quality_controlled":"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"},"external_id":{"isi":["000428419500030"]},"oa":1,"ec_funded":1,"publist_id":"7192","file_date_updated":"2020-07-14T12:47:20Z","volume":223,"date_updated":"2024-03-28T23:30:31Z","date_created":"2018-12-11T11:47:29Z","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"9562"}]},"author":[{"last_name":"Luján","first_name":"Rafael","full_name":"Luján, Rafael"},{"full_name":"Aguado, Carolina","first_name":"Carolina","last_name":"Aguado"},{"full_name":"Ciruela, Francisco","last_name":"Ciruela","first_name":"Francisco"},{"full_name":"Cózar, Javier","first_name":"Javier","last_name":"Cózar"},{"id":"42E121A4-F248-11E8-B48F-1D18A9856A87","last_name":"Kleindienst","first_name":"David","full_name":"Kleindienst, David"},{"first_name":"Luis","last_name":"De La Ossa","full_name":"De La Ossa, Luis"},{"last_name":"Bettler","first_name":"Bernhard","full_name":"Bettler, Bernhard"},{"full_name":"Wickman, Kevin","last_name":"Wickman","first_name":"Kevin"},{"last_name":"Watanabe","first_name":"Masahiko","full_name":"Watanabe, Masahiko"},{"orcid":"0000-0001-8761-9444","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","last_name":"Shigemoto","first_name":"Ryuichi","full_name":"Shigemoto, Ryuichi"},{"full_name":"Fukazawa, Yugo","last_name":"Fukazawa","first_name":"Yugo"}],"department":[{"_id":"RySh"}],"publisher":"Springer","publication_status":"published","year":"2018"},{"language":[{"iso":"eng"}],"doi":"10.1038/s41467-018-06899-3","isi":1,"quality_controlled":"1","project":[{"_id":"25B7EB9E-B435-11E9-9278-68D0E5697425","grant_number":"692692","name":"Biophysics and circuit function of a giant cortical glumatergic synapse","call_identifier":"H2020"},{"_id":"25C5A090-B435-11E9-9278-68D0E5697425","grant_number":"Z00312","call_identifier":"FWF","name":"The Wittgenstein Prize"}],"external_id":{"isi":["000449069700009"]},"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"},"oa":1,"month":"11","date_created":"2018-12-11T11:44:12Z","date_updated":"2024-03-28T23:30:31Z","volume":9,"author":[{"full_name":"Espinoza Martinez, Claudia ","orcid":"0000-0003-4710-2082","id":"31FFEE2E-F248-11E8-B48F-1D18A9856A87","last_name":"Espinoza Martinez","first_name":"Claudia "},{"last_name":"Guzmán","first_name":"José","orcid":"0000-0003-2209-5242","id":"30CC5506-F248-11E8-B48F-1D18A9856A87","full_name":"Guzmán, José"},{"full_name":"Zhang, Xiaomin","first_name":"Xiaomin","last_name":"Zhang","id":"423EC9C2-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0001-5001-4804","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","last_name":"Jonas","first_name":"Peter M","full_name":"Jonas, Peter M"}],"related_material":{"record":[{"id":"6363","status":"public","relation":"dissertation_contains"}],"link":[{"description":"News on IST Homepage","relation":"press_release","url":"https://ist.ac.at/en/news/lateral-inhibition-keeps-similar-memories-apart/"}]},"publication_status":"published","department":[{"_id":"PeJo"}],"publisher":"Nature Publishing Group","year":"2018","acknowledgement":"This project received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 692692) and the Fond zur Förderung der Wissenschaftlichen Forschung (Z 312-B27, Wittgenstein award), both to P.J..","file_date_updated":"2020-07-14T12:45:28Z","publist_id":"8034","ec_funded":1,"article_number":"4605","date_published":"2018-11-02T00:00:00Z","article_type":"original","publication":"Nature Communications","citation":{"mla":"Espinoza Martinez, Claudia, et al. “Parvalbumin+ Interneurons Obey Unique Connectivity Rules and Establish a Powerful Lateral-Inhibition Microcircuit in Dentate Gyrus.” Nature Communications, vol. 9, no. 1, 4605, Nature Publishing Group, 2018, doi:10.1038/s41467-018-06899-3.","short":"C. Espinoza Martinez, J. Guzmán, X. Zhang, P.M. Jonas, Nature Communications 9 (2018).","chicago":"Espinoza Martinez, Claudia , José Guzmán, Xiaomin Zhang, and Peter M Jonas. “Parvalbumin+ Interneurons Obey Unique Connectivity Rules and Establish a Powerful Lateral-Inhibition Microcircuit in Dentate Gyrus.” Nature Communications. Nature Publishing Group, 2018. https://doi.org/10.1038/s41467-018-06899-3.","ama":"Espinoza Martinez C, Guzmán J, Zhang X, Jonas PM. Parvalbumin+ interneurons obey unique connectivity rules and establish a powerful lateral-inhibition microcircuit in dentate gyrus. Nature Communications. 2018;9(1). doi:10.1038/s41467-018-06899-3","ista":"Espinoza Martinez C, Guzmán J, Zhang X, Jonas PM. 2018. Parvalbumin+ interneurons obey unique connectivity rules and establish a powerful lateral-inhibition microcircuit in dentate gyrus. Nature Communications. 9(1), 4605.","ieee":"C. Espinoza Martinez, J. Guzmán, X. Zhang, and P. M. Jonas, “Parvalbumin+ interneurons obey unique connectivity rules and establish a powerful lateral-inhibition microcircuit in dentate gyrus,” Nature Communications, vol. 9, no. 1. Nature Publishing Group, 2018.","apa":"Espinoza Martinez, C., Guzmán, J., Zhang, X., & Jonas, P. M. (2018). Parvalbumin+ interneurons obey unique connectivity rules and establish a powerful lateral-inhibition microcircuit in dentate gyrus. Nature Communications. Nature Publishing Group. https://doi.org/10.1038/s41467-018-06899-3"},"day":"02","article_processing_charge":"No","has_accepted_license":"1","scopus_import":"1","oa_version":"Published Version","file":[{"date_updated":"2020-07-14T12:45:28Z","date_created":"2018-12-17T15:41:57Z","checksum":"9fe2a63bd95a5067d896c087d07998f3","relation":"main_file","file_id":"5715","file_size":4651930,"content_type":"application/pdf","creator":"dernst","file_name":"2018_NatureComm_Espinoza.pdf","access_level":"open_access"}],"status":"public","ddc":["570"],"title":"Parvalbumin+ interneurons obey unique connectivity rules and establish a powerful lateral-inhibition microcircuit in dentate gyrus","intvolume":" 9","_id":"21","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","abstract":[{"lang":"eng","text":"Parvalbumin-positive (PV+) GABAergic interneurons in hippocampal microcircuits are thought to play a key role in several higher network functions, such as feedforward and feedback inhibition, network oscillations, and pattern separation. Fast lateral inhibition mediated by GABAergic interneurons may implement a winner-takes-all mechanism in the hippocampal input layer. However, it is not clear whether the functional connectivity rules of granule cells (GCs) and interneurons in the dentate gyrus are consistent with such a mechanism. Using simultaneous patch-clamp recordings from up to seven GCs and up to four PV+ interneurons in the dentate gyrus, we find that connectivity is structured in space, synapse-specific, and enriched in specific disynaptic motifs. In contrast to the neocortex, lateral inhibition in the dentate gyrus (in which a GC inhibits neighboring GCs via a PV+ interneuron) is ~ 10-times more abundant than recurrent inhibition (in which a GC inhibits itself). Thus, unique connectivity rules may enable the dentate gyrus to perform specific higher-order computations"}],"issue":"1","type":"journal_article"},{"article_processing_charge":"No","has_accepted_license":"1","day":"01","scopus_import":"1","date_published":"2018-09-01T00:00:00Z","citation":{"apa":"Chatterjee, K., Goharshady, A. K., Ibsen-Jensen, R., & Velner, Y. (2018). Ergodic mean-payoff games for the analysis of attacks in crypto-currencies (Vol. 118). Presented at the CONCUR: Conference on Concurrency Theory, Beijing, China: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2018.11","ieee":"K. Chatterjee, A. K. Goharshady, R. Ibsen-Jensen, and Y. Velner, “Ergodic mean-payoff games for the analysis of attacks in crypto-currencies,” presented at the CONCUR: Conference on Concurrency Theory, Beijing, China, 2018, vol. 118.","ista":"Chatterjee K, Goharshady AK, Ibsen-Jensen R, Velner Y. 2018. Ergodic mean-payoff games for the analysis of attacks in crypto-currencies. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 118, 11.","ama":"Chatterjee K, Goharshady AK, Ibsen-Jensen R, Velner Y. Ergodic mean-payoff games for the analysis of attacks in crypto-currencies. In: Vol 118. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:10.4230/LIPIcs.CONCUR.2018.11","chicago":"Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, and Yaron Velner. “Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies,” Vol. 118. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPIcs.CONCUR.2018.11.","short":"K. Chatterjee, A.K. Goharshady, R. Ibsen-Jensen, Y. Velner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.","mla":"Chatterjee, Krishnendu, et al. Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies. Vol. 118, 11, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPIcs.CONCUR.2018.11."},"abstract":[{"lang":"eng","text":"Crypto-currencies are digital assets designed to work as a medium of exchange, e.g., Bitcoin, but they are susceptible to attacks (dishonest behavior of participants). A framework for the analysis of attacks in crypto-currencies requires (a) modeling of game-theoretic aspects to analyze incentives for deviation from honest behavior; (b) concurrent interactions between participants; and (c) analysis of long-term monetary gains. Traditional game-theoretic approaches for the analysis of security protocols consider either qualitative temporal properties such as safety and termination, or the very special class of one-shot (stateless) games. However, to analyze general attacks on protocols for crypto-currencies, both stateful analysis and quantitative objectives are necessary. In this work our main contributions are as follows: (a) we show how a class of concurrent mean-payo games, namely ergodic games, can model various attacks that arise naturally in crypto-currencies; (b) we present the first practical implementation of algorithms for ergodic games that scales to model realistic problems for crypto-currencies; and (c) we present experimental results showing that our framework can handle games with thousands of states and millions of transitions."}],"alternative_title":["LIPIcs"],"type":"conference","oa_version":"Published Version","file":[{"relation":"main_file","file_id":"5696","checksum":"68a055b1aaa241cc38375083cf832a7d","date_created":"2018-12-17T12:08:00Z","date_updated":"2020-07-14T12:47:34Z","access_level":"open_access","file_name":"2018_CONCUR_Chatterjee.pdf","content_type":"application/pdf","file_size":1078309,"creator":"dernst"}],"intvolume":" 118","status":"public","title":"Ergodic mean-payoff games for the analysis of attacks in crypto-currencies","ddc":["000"],"_id":"66","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"isbn":["978-3-95977-087-3"]},"month":"09","language":[{"iso":"eng"}],"doi":"10.4230/LIPIcs.CONCUR.2018.11","conference":{"end_date":"2018-09-07","location":"Beijing, China","start_date":"2018-09-04","name":"CONCUR: Conference on Concurrency Theory"},"project":[{"name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"},{"name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"_id":"266EEEC0-B435-11E9-9278-68D0E5697425","name":"Quantitative Game-theoretic Analysis of Blockchain Applications and Smart Contracts"}],"quality_controlled":"1","external_id":{"arxiv":["1806.03108"]},"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"},"oa":1,"publist_id":"7988","ec_funded":1,"file_date_updated":"2020-07-14T12:47:34Z","article_number":"11","volume":118,"date_updated":"2024-03-28T23:30:34Z","date_created":"2018-12-11T11:44:27Z","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"8934"}]},"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"last_name":"Goharshady","first_name":"Amir","orcid":"0000-0003-1702-6584","id":"391365CE-F248-11E8-B48F-1D18A9856A87","full_name":"Goharshady, Amir"},{"full_name":"Ibsen-Jensen, Rasmus","last_name":"Ibsen-Jensen","first_name":"Rasmus","orcid":"0000-0003-4783-0389","id":"3B699956-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Velner","first_name":"Yaron","full_name":"Velner, Yaron"}],"department":[{"_id":"KrCh"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","publication_status":"published","year":"2018"},{"month":"04","conference":{"name":"ESOP: European Symposium on Programming","end_date":"2018-04-19","start_date":"2018-04-16","location":"Thessaloniki, Greece"},"doi":"10.1007/978-3-319-89884-1_26","language":[{"iso":"eng"}],"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"},"quality_controlled":"1","project":[{"name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"}],"file_date_updated":"2020-07-14T12:46:00Z","publist_id":"7554","ec_funded":1,"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"full_name":"Goharshady, Amir","first_name":"Amir","last_name":"Goharshady","id":"391365CE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1702-6584"},{"full_name":"Velner, Yaron","first_name":"Yaron","last_name":"Velner"}],"related_material":{"record":[{"id":"8934","status":"public","relation":"dissertation_contains"}]},"date_created":"2018-12-11T11:45:45Z","date_updated":"2024-03-28T23:30:33Z","volume":10801,"year":"2018","acknowledgement":"The research was partially supported by Vienna Science and Technology Fund (WWTF) Project ICT15-003, Austrian Science Fund (FWF) NFN Grant No S11407-N23 (RiSE/SHiNE), and ERC Starting grant (279307: Graph Games).","publication_status":"published","publisher":"Springer","department":[{"_id":"KrCh"}],"day":"01","article_processing_charge":"No","has_accepted_license":"1","scopus_import":"1","date_published":"2018-04-01T00:00:00Z","citation":{"chicago":"Chatterjee, Krishnendu, Amir Kafshdar Goharshady, and Yaron Velner. “Quantitative Analysis of Smart Contracts,” 10801:739–67. Springer, 2018. https://doi.org/10.1007/978-3-319-89884-1_26.","mla":"Chatterjee, Krishnendu, et al. Quantitative Analysis of Smart Contracts. Vol. 10801, Springer, 2018, pp. 739–67, doi:10.1007/978-3-319-89884-1_26.","short":"K. Chatterjee, A.K. Goharshady, Y. Velner, in:, Springer, 2018, pp. 739–767.","ista":"Chatterjee K, Goharshady AK, Velner Y. 2018. Quantitative analysis of smart contracts. ESOP: European Symposium on Programming, LNCS, vol. 10801, 739–767.","apa":"Chatterjee, K., Goharshady, A. K., & Velner, Y. (2018). Quantitative analysis of smart contracts (Vol. 10801, pp. 739–767). Presented at the ESOP: European Symposium on Programming, Thessaloniki, Greece: Springer. https://doi.org/10.1007/978-3-319-89884-1_26","ieee":"K. Chatterjee, A. K. Goharshady, and Y. Velner, “Quantitative analysis of smart contracts,” presented at the ESOP: European Symposium on Programming, Thessaloniki, Greece, 2018, vol. 10801, pp. 739–767.","ama":"Chatterjee K, Goharshady AK, Velner Y. Quantitative analysis of smart contracts. In: Vol 10801. Springer; 2018:739-767. doi:10.1007/978-3-319-89884-1_26"},"page":"739 - 767","abstract":[{"lang":"eng","text":"Smart contracts are computer programs that are executed by a network of mutually distrusting agents, without the need of an external trusted authority. Smart contracts handle and transfer assets of considerable value (in the form of crypto-currency like Bitcoin). Hence, it is crucial that their implementation is bug-free. We identify the utility (or expected payoff) of interacting with such smart contracts as the basic and canonical quantitative property for such contracts. We present a framework for such quantitative analysis of smart contracts. Such a formal framework poses new and novel research challenges in programming languages, as it requires modeling of game-theoretic aspects to analyze incentives for deviation from honest behavior and modeling utilities which are not specified as standard temporal properties such as safety and termination. While game-theoretic incentives have been analyzed in the security community, their analysis has been restricted to the very special case of stateless games. However, to analyze smart contracts, stateful analysis is required as it must account for the different program states of the protocol. Our main contributions are as follows: we present (i)~a simplified programming language for smart contracts; (ii)~an automatic translation of the programs to state-based games; (iii)~an abstraction-refinement approach to solve such games; and (iv)~experimental results on real-world-inspired smart contracts."}],"type":"conference","alternative_title":["LNCS"],"oa_version":"Published Version","file":[{"date_created":"2018-12-17T15:45:49Z","date_updated":"2020-07-14T12:46:00Z","checksum":"9c8a8338c571903b599b6ca93abd2cce","file_id":"5716","relation":"main_file","creator":"dernst","content_type":"application/pdf","file_size":1394993,"file_name":"2018_ESOP_Chatterjee.pdf","access_level":"open_access"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"311","title":"Quantitative analysis of smart contracts","ddc":["000"],"status":"public","intvolume":" 10801"},{"type":"conference","abstract":[{"lang":"eng","text":"We present a secure approach for maintaining andreporting credit history records on the Blockchain. Our ap-proach removes third-parties such as credit reporting agen-cies from the lending process and replaces them with smartcontracts. This allows customers to interact directly with thelenders or banks while ensuring the integrity, unmalleabilityand privacy of their credit data. Additionally, each customerhas full control over complete or selective disclosure of hercredit records, eliminating the risk of privacy violations or databreaches. Moreover, our approach provides strong guaranteesfor the lenders as well. A lender can check both correctness andcompleteness of the credit data disclosed to her. This is the firstapproach that can perform all credit reporting tasks withouta central authority or changing the financial mechanisms*."}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"6340","status":"public","ddc":["000"],"title":"Secure Credit Reporting on the Blockchain","file":[{"date_updated":"2020-07-14T12:47:27Z","date_created":"2019-04-18T10:36:39Z","checksum":"b25c9bb7cf6e7e6634e692d26d41ead8","file_id":"6341","relation":"main_file","creator":"akafshda","file_size":624338,"content_type":"application/pdf","file_name":"blockchain2018.pdf","access_level":"open_access"}],"oa_version":"Submitted Version","scopus_import":"1","article_processing_charge":"No","has_accepted_license":"1","day":"01","citation":{"ama":"Goharshady AK, Behrouz A, Chatterjee K. Secure Credit Reporting on the Blockchain. In: Proceedings of the IEEE International Conference on Blockchain. IEEE; 2018:1343-1348. doi:10.1109/Cybermatics_2018.2018.00231","ieee":"A. K. Goharshady, A. Behrouz, and K. Chatterjee, “Secure Credit Reporting on the Blockchain,” in Proceedings of the IEEE International Conference on Blockchain, Halifax, Canada, 2018, pp. 1343–1348.","apa":"Goharshady, A. K., Behrouz, A., & Chatterjee, K. (2018). Secure Credit Reporting on the Blockchain. In Proceedings of the IEEE International Conference on Blockchain (pp. 1343–1348). Halifax, Canada: IEEE. https://doi.org/10.1109/Cybermatics_2018.2018.00231","ista":"Goharshady AK, Behrouz A, Chatterjee K. 2018. Secure Credit Reporting on the Blockchain. Proceedings of the IEEE International Conference on Blockchain. IEEE International Conference on Blockchain, 1343–1348.","short":"A.K. Goharshady, A. Behrouz, K. Chatterjee, in:, Proceedings of the IEEE International Conference on Blockchain, IEEE, 2018, pp. 1343–1348.","mla":"Goharshady, Amir Kafshdar, et al. “Secure Credit Reporting on the Blockchain.” Proceedings of the IEEE International Conference on Blockchain, IEEE, 2018, pp. 1343–48, doi:10.1109/Cybermatics_2018.2018.00231.","chicago":"Goharshady, Amir Kafshdar, Ali Behrouz, and Krishnendu Chatterjee. “Secure Credit Reporting on the Blockchain.” In Proceedings of the IEEE International Conference on Blockchain, 1343–48. IEEE, 2018. https://doi.org/10.1109/Cybermatics_2018.2018.00231."},"publication":"Proceedings of the IEEE International Conference on Blockchain","page":"1343-1348","date_published":"2018-09-01T00:00:00Z","ec_funded":1,"file_date_updated":"2020-07-14T12:47:27Z","year":"2018","publisher":"IEEE","department":[{"_id":"KrCh"}],"publication_status":"published","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"8934"}]},"author":[{"full_name":"Goharshady, Amir Kafshdar","first_name":"Amir Kafshdar","last_name":"Goharshady","id":"391365CE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1702-6584"},{"last_name":"Behrouz","first_name":"Ali","full_name":"Behrouz, Ali"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"}],"date_created":"2019-04-18T10:37:35Z","date_updated":"2024-03-28T23:30:34Z","publication_identifier":{"isbn":["978-1-5386-7975-3 "]},"month":"09","tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png"},"oa":1,"external_id":{"arxiv":["1805.09104"],"isi":["000481634500196"]},"project":[{"name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003"},{"_id":"266EEEC0-B435-11E9-9278-68D0E5697425","name":"Quantitative Game-theoretic Analysis of Blockchain Applications and Smart Contracts"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"}],"quality_controlled":"1","isi":1,"doi":"10.1109/Cybermatics_2018.2018.00231","conference":{"location":"Halifax, Canada","start_date":"2018-07-30","end_date":"2018-08-03","name":"IEEE International Conference on Blockchain"},"language":[{"iso":"eng"}]},{"date_published":"2018-08-01T00:00:00Z","publication":"ACM Transactions on Programming Languages and Systems","citation":{"ieee":"K. Chatterjee, R. Ibsen-Jensen, A. K. Goharshady, and A. Pavlogiannis, “Algorithms for algebraic path properties in concurrent systems of constant treewidth components,” ACM Transactions on Programming Languages and Systems, vol. 40, no. 3. Association for Computing Machinery (ACM), 2018.","apa":"Chatterjee, K., Ibsen-Jensen, R., Goharshady, A. K., & Pavlogiannis, A. (2018). Algorithms for algebraic path properties in concurrent systems of constant treewidth components. ACM Transactions on Programming Languages and Systems. Association for Computing Machinery (ACM). https://doi.org/10.1145/3210257","ista":"Chatterjee K, Ibsen-Jensen R, Goharshady AK, Pavlogiannis A. 2018. Algorithms for algebraic path properties in concurrent systems of constant treewidth components. ACM Transactions on Programming Languages and Systems. 40(3), 9.","ama":"Chatterjee K, Ibsen-Jensen R, Goharshady AK, Pavlogiannis A. Algorithms for algebraic path properties in concurrent systems of constant treewidth components. ACM Transactions on Programming Languages and Systems. 2018;40(3). doi:10.1145/3210257","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Amir Kafshdar Goharshady, and Andreas Pavlogiannis. “Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components.” ACM Transactions on Programming Languages and Systems. Association for Computing Machinery (ACM), 2018. https://doi.org/10.1145/3210257.","short":"K. Chatterjee, R. Ibsen-Jensen, A.K. Goharshady, A. Pavlogiannis, ACM Transactions on Programming Languages and Systems 40 (2018).","mla":"Chatterjee, Krishnendu, et al. “Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components.” ACM Transactions on Programming Languages and Systems, vol. 40, no. 3, 9, Association for Computing Machinery (ACM), 2018, doi:10.1145/3210257."},"day":"01","article_processing_charge":"No","scopus_import":"1","oa_version":"Preprint","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"6009","status":"public","title":"Algorithms for algebraic path properties in concurrent systems of constant treewidth components","intvolume":" 40","abstract":[{"lang":"eng","text":"We study algorithmic questions wrt algebraic path properties in concurrent systems, where the transitions of the system are labeled from a complete, closed semiring. The algebraic path properties can model dataflow analysis problems, the shortest path problem, and many other natural problems that arise in program analysis. We consider that each component of the concurrent system is a graph with constant treewidth, a property satisfied by the controlflow graphs of most programs. We allow for multiple possible queries, which arise naturally in demand driven dataflow analysis. The study of multiple queries allows us to consider the tradeoff between the resource usage of the one-time preprocessing and for each individual query. The traditional approach constructs the product graph of all components and applies the best-known graph algorithm on the product. In this approach, even the answer to a single query requires the transitive closure (i.e., the results of all possible queries), which provides no room for tradeoff between preprocessing and query time.\r\nOur main contributions are algorithms that significantly improve the worst-case running time of the traditional approach, and provide various tradeoffs depending on the number of queries. For example, in a concurrent system of two components, the traditional approach requires hexic time in the worst case for answering one query as well as computing the transitive closure, whereas we show that with one-time preprocessing in almost cubic time, each subsequent query can be answered in at most linear time, and even the transitive closure can be computed in almost quartic time. Furthermore, we establish conditional optimality results showing that the worst-case running time of our algorithms cannot be improved without achieving major breakthroughs in graph algorithms (i.e., improving the worst-case bound for the shortest path problem in general graphs). Preliminary experimental results show that our algorithms perform favorably on several benchmarks.\r\n"}],"issue":"3","type":"journal_article","doi":"10.1145/3210257","language":[{"iso":"eng"}],"oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1510.07565","open_access":"1"}],"external_id":{"isi":["000444694800001"],"arxiv":["1510.07565"]},"quality_controlled":"1","isi":1,"project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"}],"month":"08","publication_identifier":{"issn":["0164-0925"]},"author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"first_name":"Rasmus","last_name":"Ibsen-Jensen","id":"3B699956-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus"},{"first_name":"Amir Kafshdar","last_name":"Goharshady","id":"391365CE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1702-6584","full_name":"Goharshady, Amir Kafshdar"},{"full_name":"Pavlogiannis, Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8943-0722","first_name":"Andreas","last_name":"Pavlogiannis"}],"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"1437"},{"status":"public","relation":"earlier_version","id":"5441"},{"id":"5442","relation":"earlier_version","status":"public"},{"id":"8934","relation":"dissertation_contains","status":"public"}]},"date_updated":"2024-03-28T23:30:34Z","date_created":"2019-02-14T14:31:52Z","volume":40,"year":"2018","publication_status":"published","publisher":"Association for Computing Machinery (ACM)","department":[{"_id":"KrCh"}],"ec_funded":1,"article_number":"9"},{"month":"07","publication_identifier":{"issn":["10450823"],"isbn":["978-099924112-7"]},"language":[{"iso":"eng"}],"conference":{"name":"IJCAI: International Joint Conference on Artificial Intelligence","end_date":"2018-07-19","start_date":"2018-07-13","location":"Stockholm, Sweden"},"doi":"10.24963/ijcai.2018/653","quality_controlled":"1","isi":1,"project":[{"name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1804.08984"}],"external_id":{"arxiv":["1804.08984"],"isi":["000764175404118"]},"oa":1,"ec_funded":1,"date_updated":"2024-03-28T23:30:34Z","date_created":"2019-02-13T13:26:27Z","volume":2018,"author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"first_name":"Hongfei","last_name":"Fu","id":"3AAD03D6-F248-11E8-B48F-1D18A9856A87","full_name":"Fu, Hongfei"},{"full_name":"Goharshady, Amir","last_name":"Goharshady","first_name":"Amir","orcid":"0000-0003-1702-6584","id":"391365CE-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Okati","first_name":"Nastaran","full_name":"Okati, Nastaran"}],"related_material":{"record":[{"id":"8934","relation":"dissertation_contains","status":"public"}]},"publication_status":"published","publisher":"IJCAI","department":[{"_id":"KrCh"}],"year":"2018","day":"17","article_processing_charge":"No","scopus_import":"1","date_published":"2018-07-17T00:00:00Z","page":"4700-4707","publication":"Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence","citation":{"ama":"Chatterjee K, Fu H, Goharshady AK, Okati N. Computational approaches for stochastic shortest path on succinct MDPs. In: Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence. Vol 2018. IJCAI; 2018:4700-4707. doi:10.24963/ijcai.2018/653","ieee":"K. Chatterjee, H. Fu, A. K. Goharshady, and N. Okati, “Computational approaches for stochastic shortest path on succinct MDPs,” in Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, Stockholm, Sweden, 2018, vol. 2018, pp. 4700–4707.","apa":"Chatterjee, K., Fu, H., Goharshady, A. K., & Okati, N. (2018). Computational approaches for stochastic shortest path on succinct MDPs. In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence (Vol. 2018, pp. 4700–4707). Stockholm, Sweden: IJCAI. https://doi.org/10.24963/ijcai.2018/653","ista":"Chatterjee K, Fu H, Goharshady AK, Okati N. 2018. Computational approaches for stochastic shortest path on succinct MDPs. Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence. IJCAI: International Joint Conference on Artificial Intelligence vol. 2018, 4700–4707.","short":"K. Chatterjee, H. Fu, A.K. Goharshady, N. Okati, in:, Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI, 2018, pp. 4700–4707.","mla":"Chatterjee, Krishnendu, et al. “Computational Approaches for Stochastic Shortest Path on Succinct MDPs.” Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, vol. 2018, IJCAI, 2018, pp. 4700–07, doi:10.24963/ijcai.2018/653.","chicago":"Chatterjee, Krishnendu, Hongfei Fu, Amir Kafshdar Goharshady, and Nastaran Okati. “Computational Approaches for Stochastic Shortest Path on Succinct MDPs.” In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018:4700–4707. IJCAI, 2018. https://doi.org/10.24963/ijcai.2018/653."},"abstract":[{"text":"We consider the stochastic shortest path (SSP)problem for succinct Markov decision processes(MDPs), where the MDP consists of a set of vari-ables, and a set of nondeterministic rules that up-date the variables. First, we show that several ex-amples from the AI literature can be modeled assuccinct MDPs. Then we present computationalapproaches for upper and lower bounds for theSSP problem: (a) for computing upper bounds, ourmethod is polynomial-time in the implicit descrip-tion of the MDP; (b) for lower bounds, we present apolynomial-time (in the size of the implicit descrip-tion) reduction to quadratic programming. Our ap-proach is applicable even to infinite-state MDPs.Finally, we present experimental results to demon-strate the effectiveness of our approach on severalclassical examples from the AI literature.","lang":"eng"}],"type":"conference","oa_version":"Preprint","status":"public","title":"Computational approaches for stochastic shortest path on succinct MDPs","intvolume":" 2018","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"5977"},{"date_published":"2018-01-01T00:00:00Z","publication":"Flow Turbulence and Combustion","citation":{"short":"J. Kühnen, D. Scarselli, M. Schaner, B. Hof, Flow Turbulence and Combustion 100 (2018) 919–942.","mla":"Kühnen, Jakob, et al. “Relaminarization by Steady Modification of the Streamwise Velocity Profile in a Pipe.” Flow Turbulence and Combustion, vol. 100, no. 4, Springer, 2018, pp. 919–42, doi:10.1007/s10494-018-9896-4.","chicago":"Kühnen, Jakob, Davide Scarselli, Markus Schaner, and Björn Hof. “Relaminarization by Steady Modification of the Streamwise Velocity Profile in a Pipe.” Flow Turbulence and Combustion. Springer, 2018. https://doi.org/10.1007/s10494-018-9896-4.","ama":"Kühnen J, Scarselli D, Schaner M, Hof B. Relaminarization by steady modification of the streamwise velocity profile in a pipe. Flow Turbulence and Combustion. 2018;100(4):919-942. doi:10.1007/s10494-018-9896-4","ieee":"J. Kühnen, D. Scarselli, M. Schaner, and B. Hof, “Relaminarization by steady modification of the streamwise velocity profile in a pipe,” Flow Turbulence and Combustion, vol. 100, no. 4. Springer, pp. 919–942, 2018.","apa":"Kühnen, J., Scarselli, D., Schaner, M., & Hof, B. (2018). Relaminarization by steady modification of the streamwise velocity profile in a pipe. Flow Turbulence and Combustion. Springer. https://doi.org/10.1007/s10494-018-9896-4","ista":"Kühnen J, Scarselli D, Schaner M, Hof B. 2018. Relaminarization by steady modification of the streamwise velocity profile in a pipe. Flow Turbulence and Combustion. 100(4), 919–942."},"page":"919 - 942","day":"01","has_accepted_license":"1","article_processing_charge":"Yes (via OA deal)","scopus_import":"1","file":[{"file_name":"2018_FlowTurbulenceCombust_Kuehnen.pdf","access_level":"open_access","creator":"dernst","content_type":"application/pdf","file_size":2210020,"file_id":"5717","relation":"main_file","date_created":"2018-12-17T15:52:37Z","date_updated":"2020-07-14T12:46:25Z","checksum":"d7c0bade150faabca150b0a9986e60ca"}],"oa_version":"Published Version","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"422","ddc":["530"],"title":"Relaminarization by steady modification of the streamwise velocity profile in a pipe","status":"public","intvolume":" 100","abstract":[{"text":"We show that a rather simple, steady modification of the streamwise velocity profile in a pipe can lead to a complete collapse of turbulence and the flow fully relaminarizes. Two different devices, a stationary obstacle (inset) and a device which injects fluid through an annular gap close to the wall, are used to control the flow. Both devices modify the streamwise velocity profile such that the flow in the center of the pipe is decelerated and the flow in the near wall region is accelerated. We present measurements with stereoscopic particle image velocimetry to investigate and capture the development of the relaminarizing flow downstream these devices and the specific circumstances responsible for relaminarization. We find total relaminarization up to Reynolds numbers of 6000, where the skin friction in the far downstream distance is reduced by a factor of 3.4 due to relaminarization. In a smooth straight pipe the flow remains completely laminar downstream of the control. Furthermore, we show that transient (temporary) relaminarization in a spatially confined region right downstream the devices occurs also at much higher Reynolds numbers, accompanied by a significant local skin friction drag reduction. The underlying physical mechanism of relaminarization is attributed to a weakening of the near-wall turbulence production cycle.","lang":"eng"}],"issue":"4","type":"journal_article","doi":"10.1007/s10494-018-9896-4","language":[{"iso":"eng"}],"external_id":{"isi":["000433113900004"]},"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"},"oa":1,"quality_controlled":"1","isi":1,"project":[{"_id":"25152F3A-B435-11E9-9278-68D0E5697425","grant_number":"306589","name":"Decoding the complexity of turbulence at its origin","call_identifier":"FP7"}],"month":"01","author":[{"id":"3A47AE32-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4312-0179","first_name":"Jakob","last_name":"Kühnen","full_name":"Kühnen, Jakob"},{"full_name":"Scarselli, Davide","orcid":"0000-0001-5227-4271","id":"40315C30-F248-11E8-B48F-1D18A9856A87","last_name":"Scarselli","first_name":"Davide"},{"last_name":"Schaner","first_name":"Markus","id":"316CE034-F248-11E8-B48F-1D18A9856A87","full_name":"Schaner, Markus"},{"full_name":"Hof, Björn","first_name":"Björn","last_name":"Hof","id":"3A374330-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2057-2754"}],"related_material":{"record":[{"id":"7258","relation":"dissertation_contains","status":"public"}]},"date_updated":"2024-03-28T23:30:36Z","date_created":"2018-12-11T11:46:23Z","volume":100,"year":"2018","publication_status":"published","department":[{"_id":"BjHo"}],"publisher":"Springer","file_date_updated":"2020-07-14T12:46:25Z","publist_id":"7401","ec_funded":1},{"date_published":"2018-01-08T00:00:00Z","publication":"Nature Physics","citation":{"ista":"Kühnen J, Song B, Scarselli D, Budanur NB, Riedl M, Willis A, Avila M, Hof B. 2018. Destabilizing turbulence in pipe flow. Nature Physics. 14, 386–390.","ieee":"J. Kühnen et al., “Destabilizing turbulence in pipe flow,” Nature Physics, vol. 14. Nature Publishing Group, pp. 386–390, 2018.","apa":"Kühnen, J., Song, B., Scarselli, D., Budanur, N. B., Riedl, M., Willis, A., … Hof, B. (2018). Destabilizing turbulence in pipe flow. Nature Physics. Nature Publishing Group. https://doi.org/10.1038/s41567-017-0018-3","ama":"Kühnen J, Song B, Scarselli D, et al. Destabilizing turbulence in pipe flow. Nature Physics. 2018;14:386-390. doi:10.1038/s41567-017-0018-3","chicago":"Kühnen, Jakob, Baofang Song, Davide Scarselli, Nazmi B Budanur, Michael Riedl, Ashley Willis, Marc Avila, and Björn Hof. “Destabilizing Turbulence in Pipe Flow.” Nature Physics. Nature Publishing Group, 2018. https://doi.org/10.1038/s41567-017-0018-3.","mla":"Kühnen, Jakob, et al. “Destabilizing Turbulence in Pipe Flow.” Nature Physics, vol. 14, Nature Publishing Group, 2018, pp. 386–90, doi:10.1038/s41567-017-0018-3.","short":"J. Kühnen, B. Song, D. Scarselli, N.B. Budanur, M. Riedl, A. Willis, M. Avila, B. Hof, Nature Physics 14 (2018) 386–390."},"page":"386-390","day":"08","article_processing_charge":"No","scopus_import":"1","oa_version":"Preprint","_id":"461","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","title":"Destabilizing turbulence in pipe flow","status":"public","intvolume":" 14","abstract":[{"text":"Turbulence is the major cause of friction losses in transport processes and it is responsible for a drastic drag increase in flows over bounding surfaces. While much effort is invested into developing ways to control and reduce turbulence intensities, so far no methods exist to altogether eliminate turbulence if velocities are sufficiently large. We demonstrate for pipe flow that appropriate distortions to the velocity profile lead to a complete collapse of turbulence and subsequently friction losses are reduced by as much as 90%. Counterintuitively, the return to laminar motion is accomplished by initially increasing turbulence intensities or by transiently amplifying wall shear. Since neither the Reynolds number nor the shear stresses decrease (the latter often increase), these measures are not indicative of turbulence collapse. Instead, an amplification mechanism measuring the interaction between eddies and the mean shear is found to set a threshold below which turbulence is suppressed beyond recovery.","lang":"eng"}],"type":"journal_article","doi":"10.1038/s41567-017-0018-3","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1711.06543"}],"oa":1,"external_id":{"isi":["000429434100020"]},"isi":1,"quality_controlled":"1","project":[{"call_identifier":"FP7","name":"Decoding the complexity of turbulence at its origin","grant_number":"306589","_id":"25152F3A-B435-11E9-9278-68D0E5697425"},{"_id":"25104D44-B435-11E9-9278-68D0E5697425","grant_number":"737549","name":"Eliminating turbulence in oil pipelines","call_identifier":"H2020"}],"month":"01","author":[{"last_name":"Kühnen","first_name":"Jakob","orcid":"0000-0003-4312-0179","id":"3A47AE32-F248-11E8-B48F-1D18A9856A87","full_name":"Kühnen, Jakob"},{"full_name":"Song, Baofang","first_name":"Baofang","last_name":"Song"},{"last_name":"Scarselli","first_name":"Davide","orcid":"0000-0001-5227-4271","id":"40315C30-F248-11E8-B48F-1D18A9856A87","full_name":"Scarselli, Davide"},{"full_name":"Budanur, Nazmi B","orcid":"0000-0003-0423-5010","id":"3EA1010E-F248-11E8-B48F-1D18A9856A87","last_name":"Budanur","first_name":"Nazmi B"},{"first_name":"Michael","last_name":"Riedl","id":"3BE60946-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4844-6311","full_name":"Riedl, Michael"},{"first_name":"Ashley","last_name":"Willis","full_name":"Willis, Ashley"},{"full_name":"Avila, Marc","last_name":"Avila","first_name":"Marc"},{"full_name":"Hof, Björn","first_name":"Björn","last_name":"Hof","id":"3A374330-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2057-2754"}],"related_material":{"record":[{"id":"12726","relation":"dissertation_contains","status":"public"},{"relation":"dissertation_contains","status":"public","id":"14530"},{"relation":"dissertation_contains","status":"public","id":"7258"}]},"date_created":"2018-12-11T11:46:36Z","date_updated":"2024-03-28T23:30:36Z","volume":14,"year":"2018","acknowledgement":"We acknowledge the European Research Council under the European Union’s Seventh Framework Programme (FP/2007-2013)/ERC Grant Agreement 306589, the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement no. 737549) and the Deutsche Forschungsgemeinschaft (Project No. FOR 1182) for financial support. We thank our technician P. Maier for providing highly valuable ideas and greatly supporting us in all technical aspects. We thank M. Schaner for technical drawings, construction and design. We thank M. Schwegel for a Matlab code to post-process experimental data.","publication_status":"published","publisher":"Nature Publishing Group","department":[{"_id":"BjHo"}],"ec_funded":1,"publist_id":"7360"}]