[{"article_number":"e42014","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"short":"J.P. Castro, M.N. Yancoskie, M. Marchini, S. Belohlavy, L. Hiramatsu, M. Kučka, W.H. Beluch, R. Naumann, I. Skuplik, J. Cobb, N.H. Barton, C. Rolian, Y.F. Chan, ELife 8 (2019).","ieee":"J. P. Castro et al., “An integrative genomic analysis of the Longshanks selection experiment for longer limbs in mice,” eLife, vol. 8. eLife Sciences Publications, 2019.","apa":"Castro, J. P., Yancoskie, M. N., Marchini, M., Belohlavy, S., Hiramatsu, L., Kučka, M., … Chan, Y. F. (2019). An integrative genomic analysis of the Longshanks selection experiment for longer limbs in mice. ELife. eLife Sciences Publications. https://doi.org/10.7554/eLife.42014","ama":"Castro JP, Yancoskie MN, Marchini M, et al. An integrative genomic analysis of the Longshanks selection experiment for longer limbs in mice. eLife. 2019;8. doi:10.7554/eLife.42014","mla":"Castro, João Pl, et al. “An Integrative Genomic Analysis of the Longshanks Selection Experiment for Longer Limbs in Mice.” ELife, vol. 8, e42014, eLife Sciences Publications, 2019, doi:10.7554/eLife.42014.","ista":"Castro JP, Yancoskie MN, Marchini M, Belohlavy S, Hiramatsu L, Kučka M, Beluch WH, Naumann R, Skuplik I, Cobb J, Barton NH, Rolian C, Chan YF. 2019. An integrative genomic analysis of the Longshanks selection experiment for longer limbs in mice. eLife. 8, e42014.","chicago":"Castro, João Pl, Michelle N. Yancoskie, Marta Marchini, Stefanie Belohlavy, Layla Hiramatsu, Marek Kučka, William H. Beluch, et al. “An Integrative Genomic Analysis of the Longshanks Selection Experiment for Longer Limbs in Mice.” ELife. eLife Sciences Publications, 2019. https://doi.org/10.7554/eLife.42014."},"title":"An integrative genomic analysis of the Longshanks selection experiment for longer limbs in mice","external_id":{"pmid":["31169497"],"isi":["000473588700001"]},"article_processing_charge":"No","author":[{"last_name":"Castro","full_name":"Castro, João Pl","first_name":"João Pl"},{"first_name":"Michelle N.","full_name":"Yancoskie, Michelle N.","last_name":"Yancoskie"},{"first_name":"Marta","full_name":"Marchini, Marta","last_name":"Marchini"},{"id":"43FE426A-F248-11E8-B48F-1D18A9856A87","first_name":"Stefanie","last_name":"Belohlavy","orcid":"0000-0002-9849-498X","full_name":"Belohlavy, Stefanie"},{"full_name":"Hiramatsu, Layla","last_name":"Hiramatsu","first_name":"Layla"},{"last_name":"Kučka","full_name":"Kučka, Marek","first_name":"Marek"},{"first_name":"William H.","full_name":"Beluch, William H.","last_name":"Beluch"},{"first_name":"Ronald","last_name":"Naumann","full_name":"Naumann, Ronald"},{"full_name":"Skuplik, Isabella","last_name":"Skuplik","first_name":"Isabella"},{"first_name":"John","full_name":"Cobb, John","last_name":"Cobb"},{"last_name":"Barton","full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H"},{"last_name":"Rolian","full_name":"Rolian, Campbell","first_name":"Campbell"},{"last_name":"Chan","full_name":"Chan, Yingguang Frank","first_name":"Yingguang Frank"}],"oa":1,"quality_controlled":"1","publisher":"eLife Sciences Publications","publication":"eLife","day":"06","year":"2019","isi":1,"has_accepted_license":"1","date_created":"2019-07-28T21:59:17Z","date_published":"2019-06-06T00:00:00Z","doi":"10.7554/eLife.42014","_id":"6713","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","ddc":["576"],"date_updated":"2024-03-27T23:30:22Z","file_date_updated":"2020-07-14T12:47:38Z","department":[{"_id":"NiBa"}],"oa_version":"Published Version","pmid":1,"abstract":[{"text":"Evolutionary studies are often limited by missing data that are critical to understanding the history of selection. Selection experiments, which reproduce rapid evolution under controlled conditions, are excellent tools to study how genomes evolve under selection. Here we present a genomic dissection of the Longshanks selection experiment, in which mice were selectively bred over 20 generations for longer tibiae relative to body mass, resulting in 13% longer tibiae in two replicates. We synthesized evolutionary theory, genome sequences and molecular genetics to understand the selection response and found that it involved both polygenic adaptation and discrete loci of major effect, with the strongest loci tending to be selected in parallel between replicates. We show that selection may favor de-repression of bone growth through inactivating two limb enhancers of an inhibitor, Nkx3-2. Our integrative genomic analyses thus show that it is possible to connect individual base-pair changes to the overall selection response.","lang":"eng"}],"intvolume":" 8","month":"06","scopus_import":"1","language":[{"iso":"eng"}],"file":[{"file_size":6748249,"date_updated":"2020-07-14T12:47:38Z","creator":"apreinsp","file_name":"2019_eLife_Castro.pdf","date_created":"2019-07-29T07:41:18Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_id":"6721","checksum":"fa0936fe58f0d9e3f8e75038570e5a17"}],"publication_status":"published","volume":8,"related_material":{"record":[{"id":"9804","status":"public","relation":"research_data"},{"status":"public","id":"11388","relation":"dissertation_contains"}]}},{"date_published":"2019-10-13T00:00:00Z","related_material":{"record":[{"id":"10058","status":"public","relation":"dissertation_contains"}]},"doi":"10.48550/arXiv.1910.05841","date_created":"2021-10-01T12:14:51Z","ec_funded":1,"publication_status":"submitted","year":"2019","day":"13","publication":"arXiv","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://arxiv.org/abs/1910.05841","open_access":"1"}],"oa":1,"month":"10","acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"NanoFab"}],"abstract":[{"text":"We study double quantum dots in a Ge/SiGe heterostructure and test their maturity towards singlet-triplet ($S-T_0$) qubits. We demonstrate a large range of tunability, from two single quantum dots to a double quantum dot. We measure Pauli spin blockade and study the anisotropy of the $g$-factor. We use an adjacent quantum dot for sensing charge transitions in the double quantum dot at interest. In conclusion, Ge/SiGe possesses all ingredients necessary for building a singlet-triplet qubit.","lang":"eng"}],"oa_version":"Preprint","acknowledgement":"We thank Matthias Brauns for helpful discussions and careful proofreading of the manuscript. This project has received funding from the European Union’s Horizon 2020 research and innovation program under the Marie Sklodowska-Curie grant agreement No 844511 and from the FWF project P30207. The research was supported by the Scientific Service Units of IST Austria through resources provided by the MIBA machine shop and the nanofabrication\r\nfacility.","author":[{"full_name":"Hofmann, Andrea C","last_name":"Hofmann","first_name":"Andrea C","id":"340F461A-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Jirovec","orcid":"0000-0002-7197-4801","full_name":"Jirovec, Daniel","first_name":"Daniel","id":"4C473F58-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Maxim","last_name":"Borovkov","full_name":"Borovkov, Maxim"},{"first_name":"Ivan","id":"2A307FE2-F248-11E8-B48F-1D18A9856A87","last_name":"Prieto Gonzalez","full_name":"Prieto Gonzalez, Ivan","orcid":"0000-0002-7370-5357"},{"full_name":"Ballabio, Andrea","last_name":"Ballabio","first_name":"Andrea"},{"full_name":"Frigerio, Jacopo","last_name":"Frigerio","first_name":"Jacopo"},{"first_name":"Daniel","full_name":"Chrastina, Daniel","last_name":"Chrastina"},{"full_name":"Isella, Giovanni","last_name":"Isella","first_name":"Giovanni"},{"orcid":"0000-0001-8342-202X","full_name":"Katsaros, Georgios","last_name":"Katsaros","id":"38DB5788-F248-11E8-B48F-1D18A9856A87","first_name":"Georgios"}],"article_processing_charge":"No","external_id":{"arxiv":["1910.05841"]},"department":[{"_id":"GeKa"}],"title":"Assessing the potential of Ge/SiGe quantum dots as hosts for singlet-triplet qubits","citation":{"mla":"Hofmann, Andrea C., et al. “Assessing the Potential of Ge/SiGe Quantum Dots as Hosts for Singlet-Triplet Qubits.” ArXiv, 1910.05841, doi:10.48550/arXiv.1910.05841.","short":"A.C. Hofmann, D. Jirovec, M. Borovkov, I. Prieto Gonzalez, A. Ballabio, J. Frigerio, D. Chrastina, G. Isella, G. Katsaros, ArXiv (n.d.).","ieee":"A. C. Hofmann et al., “Assessing the potential of Ge/SiGe quantum dots as hosts for singlet-triplet qubits,” arXiv. .","ama":"Hofmann AC, Jirovec D, Borovkov M, et al. Assessing the potential of Ge/SiGe quantum dots as hosts for singlet-triplet qubits. arXiv. doi:10.48550/arXiv.1910.05841","apa":"Hofmann, A. C., Jirovec, D., Borovkov, M., Prieto Gonzalez, I., Ballabio, A., Frigerio, J., … Katsaros, G. (n.d.). Assessing the potential of Ge/SiGe quantum dots as hosts for singlet-triplet qubits. arXiv. https://doi.org/10.48550/arXiv.1910.05841","chicago":"Hofmann, Andrea C, Daniel Jirovec, Maxim Borovkov, Ivan Prieto Gonzalez, Andrea Ballabio, Jacopo Frigerio, Daniel Chrastina, Giovanni Isella, and Georgios Katsaros. “Assessing the Potential of Ge/SiGe Quantum Dots as Hosts for Singlet-Triplet Qubits.” ArXiv, n.d. https://doi.org/10.48550/arXiv.1910.05841.","ista":"Hofmann AC, Jirovec D, Borovkov M, Prieto Gonzalez I, Ballabio A, Frigerio J, Chrastina D, Isella G, Katsaros G. Assessing the potential of Ge/SiGe quantum dots as hosts for singlet-triplet qubits. arXiv, 1910.05841."},"date_updated":"2024-03-27T23:30:26Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"preprint","project":[{"_id":"26A151DA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"844511","name":"Majorana bound states in Ge/SiGe heterostructures"},{"name":"Hole spin orbit qubits in Ge quantum wells","grant_number":"P30207","_id":"2641CE5E-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"status":"public","_id":"10065","article_number":"1910.05841"},{"department":[{"_id":"DaSi"}],"file_date_updated":"2020-07-14T12:47:23Z","ddc":["570"],"date_updated":"2024-03-27T23:30:29Z","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","_id":"6187","ec_funded":1,"volume":8,"related_material":{"record":[{"id":"6530","relation":"dissertation_contains"},{"relation":"dissertation_contains","status":"public","id":"8983"},{"relation":"dissertation_contains","id":"6546","status":"public"}],"link":[{"url":"https://ist.ac.at/en/news/new-gene-potentially-involved-in-metastasis-identified/","relation":"press_release","description":"News on IST Homepage"}]},"language":[{"iso":"eng"}],"file":[{"date_updated":"2020-07-14T12:47:23Z","file_size":4496017,"creator":"dernst","date_created":"2019-03-28T14:00:41Z","file_name":"2019_eLife_Valoskova.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"cc0d1a512559d52e7e7cb0e9b9854b40","file_id":"6188"}],"publication_status":"published","publication_identifier":{"issn":["2050-084X"]},"intvolume":" 8","month":"03","scopus_import":"1","oa_version":"Published Version","acknowledged_ssus":[{"_id":"LifeSc"}],"abstract":[{"lang":"eng","text":"Aberrant display of the truncated core1 O-glycan T-antigen is a common feature of human cancer cells that correlates with metastasis. Here we show that T-antigen in Drosophila melanogaster macrophages is involved in their developmentally programmed tissue invasion. Higher macrophage T-antigen levels require an atypical major facilitator superfamily (MFS) member that we named Minerva which enables macrophage dissemination and invasion. We characterize for the first time the T and Tn glycoform O-glycoproteome of the Drosophila melanogaster embryo, and determine that Minerva increases the presence of T-antigen on proteins in pathways previously linked to cancer, most strongly on the sulfhydryl oxidase Qsox1 which we show is required for macrophage tissue entry. Minerva’s vertebrate ortholog, MFSD1, rescues the minerva mutant’s migration and T-antigen glycosylation defects. We thus identify a key conserved regulator that orchestrates O-glycosylation on a protein subset to activate a program governing migration steps important for both development and cancer metastasis."}],"title":"A conserved major facilitator superfamily member orchestrates a subset of O-glycosylation to aid macrophage tissue invasion","article_processing_charge":"No","external_id":{"isi":["000462530200001"]},"author":[{"first_name":"Katarina","id":"46F146FC-F248-11E8-B48F-1D18A9856A87","last_name":"Valosková","full_name":"Valosková, Katarina"},{"first_name":"Julia","id":"3CCBB46E-F248-11E8-B48F-1D18A9856A87","last_name":"Biebl","full_name":"Biebl, Julia"},{"full_name":"Roblek, Marko","orcid":"0000-0001-9588-1389","last_name":"Roblek","id":"3047D808-F248-11E8-B48F-1D18A9856A87","first_name":"Marko"},{"last_name":"Emtenani","orcid":"0000-0001-6981-6938","full_name":"Emtenani, Shamsi","first_name":"Shamsi","id":"49D32318-F248-11E8-B48F-1D18A9856A87"},{"id":"3BCEDBE0-F248-11E8-B48F-1D18A9856A87","first_name":"Attila","full_name":"György, Attila","orcid":"0000-0002-1819-198X","last_name":"György"},{"last_name":"Misova","full_name":"Misova, Michaela","orcid":"0000-0003-2427-6856","first_name":"Michaela","id":"495A3C32-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0001-7190-0776","full_name":"Ratheesh, Aparna","last_name":"Ratheesh","id":"2F064CFE-F248-11E8-B48F-1D18A9856A87","first_name":"Aparna"},{"last_name":"Rodrigues","full_name":"Rodrigues, Patricia","id":"2CE4065A-F248-11E8-B48F-1D18A9856A87","first_name":"Patricia"},{"first_name":"Katerina","full_name":"Shkarina, Katerina","last_name":"Shkarina"},{"full_name":"Larsen, Ida Signe Bohse","last_name":"Larsen","first_name":"Ida Signe Bohse"},{"first_name":"Sergey Y","last_name":"Vakhrushev","full_name":"Vakhrushev, Sergey Y"},{"first_name":"Henrik","last_name":"Clausen","full_name":"Clausen, Henrik"},{"first_name":"Daria E","id":"3D224B9E-F248-11E8-B48F-1D18A9856A87","last_name":"Siekhaus","orcid":"0000-0001-8323-8353","full_name":"Siekhaus, Daria E"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"mla":"Valosková, Katarina, et al. “A Conserved Major Facilitator Superfamily Member Orchestrates a Subset of O-Glycosylation to Aid Macrophage Tissue Invasion.” ELife, vol. 8, e41801, eLife Sciences Publications, 2019, doi:10.7554/elife.41801.","short":"K. Valosková, J. Bicher, M. Roblek, S. Emtenani, A. György, M. Misova, A. Ratheesh, P. Rodrigues, K. Shkarina, I.S.B. Larsen, S.Y. Vakhrushev, H. Clausen, D.E. Siekhaus, ELife 8 (2019).","ieee":"K. Valosková et al., “A conserved major facilitator superfamily member orchestrates a subset of O-glycosylation to aid macrophage tissue invasion,” eLife, vol. 8. eLife Sciences Publications, 2019.","ama":"Valosková K, Bicher J, Roblek M, et al. A conserved major facilitator superfamily member orchestrates a subset of O-glycosylation to aid macrophage tissue invasion. eLife. 2019;8. doi:10.7554/elife.41801","apa":"Valosková, K., Bicher, J., Roblek, M., Emtenani, S., György, A., Misova, M., … Siekhaus, D. E. (2019). A conserved major facilitator superfamily member orchestrates a subset of O-glycosylation to aid macrophage tissue invasion. ELife. eLife Sciences Publications. https://doi.org/10.7554/elife.41801","chicago":"Valosková, Katarina, Julia Bicher, Marko Roblek, Shamsi Emtenani, Attila György, Michaela Misova, Aparna Ratheesh, et al. “A Conserved Major Facilitator Superfamily Member Orchestrates a Subset of O-Glycosylation to Aid Macrophage Tissue Invasion.” ELife. eLife Sciences Publications, 2019. https://doi.org/10.7554/elife.41801.","ista":"Valosková K, Bicher J, Roblek M, Emtenani S, György A, Misova M, Ratheesh A, Rodrigues P, Shkarina K, Larsen ISB, Vakhrushev SY, Clausen H, Siekhaus DE. 2019. A conserved major facilitator superfamily member orchestrates a subset of O-glycosylation to aid macrophage tissue invasion. eLife. 8, e41801."},"project":[{"_id":"253CDE40-B435-11E9-9278-68D0E5697425","grant_number":"24283","name":"Examination of the role of a MFS transporter in the migration of Drosophila immune cells"},{"call_identifier":"FWF","_id":"253B6E48-B435-11E9-9278-68D0E5697425","grant_number":"P29638","name":"The role of Drosophila TNF alpha in immune cell invasion"},{"_id":"2536F660-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Investigating the role of transporters in invasive migration through junctions","grant_number":"334077"},{"call_identifier":"FP7","_id":"25388084-B435-11E9-9278-68D0E5697425","name":"Breaking barriers: Investigating the junctional and mechanobiological changes underlying the ability of Drosophila immune cells to invade an epithelium","grant_number":"329540"},{"call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","name":"International IST Doctoral Program"}],"article_number":"e41801","date_created":"2019-03-28T13:37:45Z","date_published":"2019-03-26T00:00:00Z","doi":"10.7554/elife.41801","publication":"eLife","day":"26","year":"2019","isi":1,"has_accepted_license":"1","oa":1,"quality_controlled":"1","publisher":"eLife Sciences Publications"},{"language":[{"iso":"eng"}],"file":[{"file_id":"6549","checksum":"68949c2d96210b45b981a23e9c9cd93c","embargo_to":"open_access","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","relation":"source_file","access_level":"closed","file_name":"Katarina Valoskova_PhD thesis_final version.docx","date_created":"2019-06-07T13:00:04Z","file_size":14110626,"date_updated":"2020-07-14T12:47:33Z","creator":"khribikova"},{"file_size":10054156,"date_updated":"2021-02-11T11:17:14Z","creator":"khribikova","file_name":"Katarina Valoskova_PhD thesis_final version.pdf","date_created":"2019-06-07T13:00:08Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","embargo":"2020-06-07","file_id":"6550","checksum":"555329cd76e196c96f5278c480ee2e6e"}],"degree_awarded":"PhD","publication_status":"published","publication_identifier":{"issn":["2663-337X"]},"related_material":{"record":[{"status":"public","id":"6187","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"544"}]},"oa_version":"Published Version","acknowledged_ssus":[{"_id":"Bio"}],"abstract":[{"lang":"eng","text":"Invasive migration plays a crucial role not only during development and homeostasis but also in pathological states, such as tumor metastasis. Drosophila macrophage migration into the extended germband is an interesting system to study invasive migration. It carries similarities to immune cell transmigration and cancer cell invasion, therefore studying this process could also bring new understanding of invasion in higher organisms. In our work, we uncover a highly conserved member of the major facilitator family that plays a role in tissue invasion through regulation of glycosylation on a subgroup of proteins and/or by aiding the precise timing of DN-Cadherin downregulation. \r\n\r\nAberrant display of the truncated core1 O-glycan T-antigen is a common feature of human cancer cells that correlates with metastasis. Here we show that T-antigen in Drosophila melanogaster macrophages is involved in their developmentally programmed tissue invasion. Higher macrophage T-antigen levels require an atypical major facilitator superfamily (MFS) member that we named Minerva which enables macrophage dissemination and invasion. We characterize for the first time the T and Tn glycoform O-glycoproteome of the Drosophila melanogaster embryo, and determine that Minerva increases the presence of T-antigen on proteins in pathways previously linked to cancer, most strongly on the sulfhydryl oxidase Qsox1 which we show is required for macrophage tissue entry. Minerva’s vertebrate ortholog, MFSD1, rescues the minerva mutant’s migration and T-antigen glycosylation defects. We thus identify \r\na key conserved regulator that orchestrates O-glycosylation on a protein subset to activate \r\na program governing migration steps important for both development and cancer metastasis. \r\n"}],"month":"06","alternative_title":["ISTA Thesis"],"ddc":["570"],"date_updated":"2023-09-19T10:15:54Z","supervisor":[{"full_name":"Siekhaus, Daria E","orcid":"0000-0001-8323-8353","last_name":"Siekhaus","id":"3D224B9E-F248-11E8-B48F-1D18A9856A87","first_name":"Daria E"}],"department":[{"_id":"DaSi"}],"file_date_updated":"2021-02-11T11:17:14Z","_id":"6546","status":"public","type":"dissertation","day":"07","year":"2019","has_accepted_license":"1","date_created":"2019-06-07T12:49:19Z","date_published":"2019-06-07T00:00:00Z","doi":"10.15479/AT:ISTA:6546","page":"141","oa":1,"publisher":"Institute of Science and Technology Austria","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ista":"Valosková K. 2019. The role of a highly conserved major facilitator superfamily member in Drosophila embryonic macrophage migration. Institute of Science and Technology Austria.","chicago":"Valosková, Katarina. “The Role of a Highly Conserved Major Facilitator Superfamily Member in Drosophila Embryonic Macrophage Migration.” Institute of Science and Technology Austria, 2019. https://doi.org/10.15479/AT:ISTA:6546.","short":"K. Valosková, The Role of a Highly Conserved Major Facilitator Superfamily Member in Drosophila Embryonic Macrophage Migration, Institute of Science and Technology Austria, 2019.","ieee":"K. Valosková, “The role of a highly conserved major facilitator superfamily member in Drosophila embryonic macrophage migration,” Institute of Science and Technology Austria, 2019.","apa":"Valosková, K. (2019). The role of a highly conserved major facilitator superfamily member in Drosophila embryonic macrophage migration. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:6546","ama":"Valosková K. The role of a highly conserved major facilitator superfamily member in Drosophila embryonic macrophage migration. 2019. doi:10.15479/AT:ISTA:6546","mla":"Valosková, Katarina. The Role of a Highly Conserved Major Facilitator Superfamily Member in Drosophila Embryonic Macrophage Migration. Institute of Science and Technology Austria, 2019, doi:10.15479/AT:ISTA:6546."},"title":"The role of a highly conserved major facilitator superfamily member in Drosophila embryonic macrophage migration","article_processing_charge":"No","author":[{"full_name":"Valosková, Katarina","last_name":"Valosková","id":"46F146FC-F248-11E8-B48F-1D18A9856A87","first_name":"Katarina"}],"project":[{"grant_number":"24283","name":"Examination of the role of a MFS transporter in the migration of Drosophila immune cells","_id":"253CDE40-B435-11E9-9278-68D0E5697425"}]},{"publisher":"Institute of Science and Technology Austria","oa":1,"date_published":"2019-04-30T00:00:00Z","doi":"10.15479/AT:ISTA:6363","date_created":"2019-04-30T11:56:10Z","page":"140","day":"30","has_accepted_license":"1","year":"2019","title":"Parvalbumin+ interneurons enable efficient pattern separation in hippocampal microcircuits","author":[{"id":"31FFEE2E-F248-11E8-B48F-1D18A9856A87","first_name":"Claudia ","orcid":"0000-0003-4710-2082","full_name":"Espinoza Martinez, Claudia ","last_name":"Espinoza Martinez"}],"article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ista":"Espinoza Martinez C. 2019. Parvalbumin+ interneurons enable efficient pattern separation in hippocampal microcircuits. Institute of Science and Technology Austria.","chicago":"Espinoza Martinez, Claudia . “Parvalbumin+ Interneurons Enable Efficient Pattern Separation in Hippocampal Microcircuits.” Institute of Science and Technology Austria, 2019. https://doi.org/10.15479/AT:ISTA:6363.","short":"C. Espinoza Martinez, Parvalbumin+ Interneurons Enable Efficient Pattern Separation in Hippocampal Microcircuits, Institute of Science and Technology Austria, 2019.","ieee":"C. Espinoza Martinez, “Parvalbumin+ interneurons enable efficient pattern separation in hippocampal microcircuits,” Institute of Science and Technology Austria, 2019.","ama":"Espinoza Martinez C. Parvalbumin+ interneurons enable efficient pattern separation in hippocampal microcircuits. 2019. doi:10.15479/AT:ISTA:6363","apa":"Espinoza Martinez, C. (2019). Parvalbumin+ interneurons enable efficient pattern separation in hippocampal microcircuits. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:6363","mla":"Espinoza Martinez, Claudia. Parvalbumin+ Interneurons Enable Efficient Pattern Separation in Hippocampal Microcircuits. Institute of Science and Technology Austria, 2019, doi:10.15479/AT:ISTA:6363."},"month":"04","alternative_title":["ISTA Thesis"],"oa_version":"Published Version","abstract":[{"text":"Distinguishing between similar experiences is achieved by the brain in a process called pattern separation. In the hippocampus, pattern separation reduces the interference of memories and increases the storage capacity by decorrelating similar inputs patterns of neuronal activity into non-overlapping output firing patterns. Winners-take-all (WTA) mechanism is a theoretical model for pattern separation in which a \"winner\" cell suppresses the activity of the neighboring neurons through feedback inhibition. However, if the network properties of the dentate gyrus support WTA as a biologically conceivable model remains unknown. Here, we showed that the connectivity rules of PV+interneurons and their synaptic properties are optimizedfor efficient pattern separation. We found using multiple whole-cell in vitrorecordings that PV+interneurons mainly connect to granule cells (GC) through lateral inhibition, a form of feedback inhibition in which a GC inhibits other GCs but not itself through the activation of PV+interneurons. Thus, lateral inhibition between GC–PV+interneurons was ~10 times more abundant than recurrent connections. Furthermore, the GC–PV+interneuron connectivity was more spatially confined but less abundant than PV+interneurons–GC connectivity, leading to an asymmetrical distribution of excitatory and inhibitory connectivity. Our network model of the dentate gyrus with incorporated real connectivity rules efficiently decorrelates neuronal activity patterns using WTA as the primary mechanism. This process relied on lateral inhibition, fast-signaling properties of PV+interneurons and the asymmetrical distribution of excitatory and inhibitory connectivity. Finally, we found that silencing the activity of PV+interneurons in vivoleads to acute deficits in discrimination between similar environments, suggesting that PV+interneuron networks are necessary for behavioral relevant computations. Our results demonstrate that PV+interneurons possess unique connectivity and fast signaling properties that confer to the dentate gyrus network properties that allow the emergence of pattern separation. Thus, our results contribute to the knowledge of how specific forms of network organization underlie sophisticated types of information processing. \r\n","lang":"eng"}],"related_material":{"record":[{"relation":"part_of_dissertation","id":"21","status":"public"}]},"file":[{"date_created":"2019-05-07T16:00:39Z","file_name":"Espinozathesis_all2.pdf","creator":"cespinoza","date_updated":"2021-02-11T11:17:15Z","file_size":13966891,"file_id":"6389","checksum":"77c6c05cfe8b58c8abcf1b854375d084","embargo":"2020-05-09","access_level":"open_access","relation":"main_file","content_type":"application/pdf"},{"date_created":"2019-05-07T16:00:48Z","file_name":"Espinoza_Thesis.docx","creator":"cespinoza","date_updated":"2020-07-14T12:47:28Z","file_size":11159900,"checksum":"f6aa819f127691a2b0fc21c76eb09746","file_id":"6390","access_level":"closed","relation":"source_file","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","embargo_to":"open_access"}],"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["978-3-99078-000-8"],"issn":["2663-337X"]},"degree_awarded":"PhD","publication_status":"published","status":"public","type":"dissertation","_id":"6363","file_date_updated":"2021-02-11T11:17:15Z","department":[{"_id":"PeJo"}],"ddc":["570"],"supervisor":[{"first_name":"Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","last_name":"Jonas","full_name":"Jonas, Peter M","orcid":"0000-0001-5001-4804"}],"date_updated":"2023-09-15T12:03:48Z"},{"conference":{"start_date":"2019-10-23","location":"Athens, Greece","end_date":"2019-10-25","name":"OOPSLA: Object-oriented Programming, Systems, Languages and Applications"},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","short":"CC BY-NC (4.0)"},"type":"conference","status":"public","_id":"6780","file_date_updated":"2020-07-14T12:47:40Z","department":[{"_id":"KrCh"}],"date_updated":"2024-03-27T23:30:33Z","ddc":["000"],"intvolume":" 3","month":"10","abstract":[{"text":"In this work, we consider the almost-sure termination problem for probabilistic programs that asks whether a\r\ngiven probabilistic program terminates with probability 1. Scalable approaches for program analysis often\r\nrely on modularity as their theoretical basis. In non-probabilistic programs, the classical variant rule (V-rule)\r\nof Floyd-Hoare logic provides the foundation for modular analysis. Extension of this rule to almost-sure\r\ntermination of probabilistic programs is quite tricky, and a probabilistic variant was proposed in [16]. While the\r\nproposed probabilistic variant cautiously addresses the key issue of integrability, we show that the proposed\r\nmodular rule is still not sound for almost-sure termination of probabilistic programs.\r\nBesides establishing unsoundness of the previous rule, our contributions are as follows: First, we present a\r\nsound modular rule for almost-sure termination of probabilistic programs. Our approach is based on a novel\r\nnotion of descent supermartingales. Second, for algorithmic approaches, we consider descent supermartingales\r\nthat are linear and show that they can be synthesized in polynomial time. Finally, we present experimental\r\nresults on a variety of benchmarks and several natural examples that model various types of nested while\r\nloops in probabilistic programs and demonstrate that our approach is able to efficiently prove their almost-sure\r\ntermination property","lang":"eng"}],"oa_version":"Published Version","ec_funded":1,"volume":3,"related_material":{"record":[{"id":"8934","status":"public","relation":"dissertation_contains"}]},"publication_status":"published","language":[{"iso":"eng"}],"file":[{"file_id":"6807","checksum":"3482d8ace6fb4991eb7810e3b70f1b9f","access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2019-08-12T15:40:57Z","file_name":"oopsla-2019.pdf","creator":"akafshda","date_updated":"2020-07-14T12:47:40Z","file_size":1024643},{"file_size":538579,"date_updated":"2020-07-14T12:47:40Z","creator":"dernst","file_name":"2019_ACM_Huang.pdf","date_created":"2020-05-12T15:15:14Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","checksum":"4e5a6fb2b59a75222a4e8335a5a60eac","file_id":"7821"}],"project":[{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Game Theory","grant_number":"S11407"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"},{"_id":"267066CE-B435-11E9-9278-68D0E5697425","name":"Quantitative Analysis of Probablistic Systems with a focus on Crypto-currencies"},{"_id":"266EEEC0-B435-11E9-9278-68D0E5697425","name":"Quantitative Game-theoretic Analysis of Blockchain Applications and Smart Contracts"}],"article_number":"129","article_processing_charge":"No","external_id":{"arxiv":["1901.06087"]},"author":[{"first_name":"Mingzhang","last_name":"Huang","full_name":"Huang, Mingzhang"},{"last_name":"Fu","full_name":"Fu, Hongfei","first_name":"Hongfei"},{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"first_name":"Amir Kafshdar","id":"391365CE-F248-11E8-B48F-1D18A9856A87","last_name":"Goharshady","orcid":"0000-0003-1702-6584","full_name":"Goharshady, Amir Kafshdar"}],"title":"Modular verification for almost-sure termination of probabilistic programs","citation":{"ieee":"M. Huang, H. Fu, K. Chatterjee, and A. K. Goharshady, “Modular verification for almost-sure termination of probabilistic programs,” in Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications , Athens, Greece, 2019, vol. 3.","short":"M. Huang, H. Fu, K. Chatterjee, A.K. Goharshady, in:, Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications , ACM, 2019.","apa":"Huang, M., Fu, H., Chatterjee, K., & Goharshady, A. K. (2019). Modular verification for almost-sure termination of probabilistic programs. In Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications (Vol. 3). Athens, Greece: ACM. https://doi.org/10.1145/3360555","ama":"Huang M, Fu H, Chatterjee K, Goharshady AK. Modular verification for almost-sure termination of probabilistic programs. In: Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications . Vol 3. ACM; 2019. doi:10.1145/3360555","mla":"Huang, Mingzhang, et al. “Modular Verification for Almost-Sure Termination of Probabilistic Programs.” Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications , vol. 3, 129, ACM, 2019, doi:10.1145/3360555.","ista":"Huang M, Fu H, Chatterjee K, Goharshady AK. 2019. Modular verification for almost-sure termination of probabilistic programs. Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications . OOPSLA: Object-oriented Programming, Systems, Languages and Applications vol. 3, 129.","chicago":"Huang, Mingzhang, Hongfei Fu, Krishnendu Chatterjee, and Amir Kafshdar Goharshady. “Modular Verification for Almost-Sure Termination of Probabilistic Programs.” In Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications , Vol. 3. ACM, 2019. https://doi.org/10.1145/3360555."},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","oa":1,"quality_controlled":"1","publisher":"ACM","date_created":"2019-08-09T09:54:20Z","doi":"10.1145/3360555","date_published":"2019-10-01T00:00:00Z","year":"2019","has_accepted_license":"1","publication":"Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications ","day":"01"},{"publication":"Proceedings of the ACM on Programming Languages","day":"01","year":"2019","has_accepted_license":"1","date_created":"2019-05-06T12:18:17Z","date_published":"2019-01-01T00:00:00Z","doi":"10.1145/3290366","oa":1,"publisher":"ACM","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"short":"K. Chatterjee, A.K. Goharshady, N. Okati, A. Pavlogiannis, Proceedings of the ACM on Programming Languages 3 (2019).","ieee":"K. Chatterjee, A. K. Goharshady, N. Okati, and A. Pavlogiannis, “Efficient parameterized algorithms for data packing,” Proceedings of the ACM on Programming Languages, vol. 3, no. POPL. ACM, 2019.","apa":"Chatterjee, K., Goharshady, A. K., Okati, N., & Pavlogiannis, A. (2019). Efficient parameterized algorithms for data packing. Proceedings of the ACM on Programming Languages. ACM. https://doi.org/10.1145/3290366","ama":"Chatterjee K, Goharshady AK, Okati N, Pavlogiannis A. Efficient parameterized algorithms for data packing. Proceedings of the ACM on Programming Languages. 2019;3(POPL). doi:10.1145/3290366","mla":"Chatterjee, Krishnendu, et al. “Efficient Parameterized Algorithms for Data Packing.” Proceedings of the ACM on Programming Languages, vol. 3, no. POPL, 53, ACM, 2019, doi:10.1145/3290366.","ista":"Chatterjee K, Goharshady AK, Okati N, Pavlogiannis A. 2019. Efficient parameterized algorithms for data packing. Proceedings of the ACM on Programming Languages. 3(POPL), 53.","chicago":"Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Nastaran Okati, and Andreas Pavlogiannis. “Efficient Parameterized Algorithms for Data Packing.” Proceedings of the ACM on Programming Languages. ACM, 2019. https://doi.org/10.1145/3290366."},"title":"Efficient parameterized algorithms for data packing","author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"first_name":"Amir Kafshdar","id":"391365CE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1702-6584","full_name":"Goharshady, Amir Kafshdar","last_name":"Goharshady"},{"first_name":"Nastaran","last_name":"Okati","full_name":"Okati, Nastaran"},{"id":"49704004-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas","orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas","last_name":"Pavlogiannis"}],"article_number":"53","project":[{"grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"}],"language":[{"iso":"eng"}],"file":[{"creator":"dernst","file_size":1294962,"date_updated":"2020-07-14T12:47:29Z","file_name":"2019_ACM_POPL_Chatterjee.pdf","date_created":"2019-05-06T12:23:11Z","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_id":"6381","checksum":"c157752f96877b36685ad7063ada4524"}],"publication_status":"published","publication_identifier":{"issn":["2475-1421"]},"ec_funded":1,"volume":3,"related_material":{"record":[{"id":"8934","status":"public","relation":"dissertation_contains"}]},"issue":"POPL","oa_version":"Published Version","abstract":[{"lang":"eng","text":"There is a huge gap between the speeds of modern caches and main memories, and therefore cache misses account for a considerable loss of efficiency in programs. The predominant technique to address this issue has been Data Packing: data elements that are frequently accessed within time proximity are packed into the same cache block, thereby minimizing accesses to the main memory. We consider the algorithmic problem of Data Packing on a two-level memory system. Given a reference sequence R of accesses to data elements, the task is to partition the elements into cache blocks such that the number of cache misses on R is minimized. The problem is notoriously difficult: it is NP-hard even when the cache has size 1, and is hard to approximate for any cache size larger than 4. Therefore, all existing techniques for Data Packing are based on heuristics and lack theoretical guarantees. In this work, we present the first positive theoretical results for Data Packing, along with new and stronger negative results. We consider the problem under the lens of the underlying access hypergraphs, which are hypergraphs of affinities between the data elements, where the order of an access hypergraph corresponds to the size of the affinity group. We study the problem parameterized by the treewidth of access hypergraphs, which is a standard notion in graph theory to measure the closeness of a graph to a tree. Our main results are as follows: We show there is a number q* depending on the cache parameters such that (a) if the access hypergraph of order q* has constant treewidth, then there is a linear-time algorithm for Data Packing; (b)the Data Packing problem remains NP-hard even if the access hypergraph of order q*-1 has constant treewidth. Thus, we establish a fine-grained dichotomy depending on a single parameter, namely, the highest order among access hypegraphs that have constant treewidth; and establish the optimal value q* of this parameter. Finally, we present an experimental evaluation of a prototype implementation of our algorithm. Our results demonstrate that, in practice, access hypergraphs of many commonly-used algorithms have small treewidth. We compare our approach with several state-of-the-art heuristic-based algorithms and show that our algorithm leads to significantly fewer cache-misses. "}],"intvolume":" 3","month":"01","ddc":["004"],"date_updated":"2024-03-27T23:30:33Z","file_date_updated":"2020-07-14T12:47:29Z","department":[{"_id":"KrCh"}],"_id":"6380","pubrep_id":"1056","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article"},{"article_number":"8751326","project":[{"grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Game-theoretic Analysis of Blockchain Applications and Smart Contracts","_id":"266EEEC0-B435-11E9-9278-68D0E5697425"},{"_id":"267066CE-B435-11E9-9278-68D0E5697425","name":"Quantitative Analysis of Probablistic Systems with a focus on Crypto-currencies"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Chatterjee, Krishnendu, et al. “Probabilistic Smart Contracts: Secure Randomness on the Blockchain.” IEEE International Conference on Blockchain and Cryptocurrency, 8751326, IEEE, 2019, doi:10.1109/BLOC.2019.8751326.","ama":"Chatterjee K, Goharshady AK, Pourdamghani A. Probabilistic smart contracts: Secure randomness on the blockchain. In: IEEE International Conference on Blockchain and Cryptocurrency. IEEE; 2019. doi:10.1109/BLOC.2019.8751326","apa":"Chatterjee, K., Goharshady, A. K., & Pourdamghani, A. (2019). Probabilistic smart contracts: Secure randomness on the blockchain. In IEEE International Conference on Blockchain and Cryptocurrency. Seoul, Korea: IEEE. https://doi.org/10.1109/BLOC.2019.8751326","ieee":"K. Chatterjee, A. K. Goharshady, and A. Pourdamghani, “Probabilistic smart contracts: Secure randomness on the blockchain,” in IEEE International Conference on Blockchain and Cryptocurrency, Seoul, Korea, 2019.","short":"K. Chatterjee, A.K. Goharshady, A. Pourdamghani, in:, IEEE International Conference on Blockchain and Cryptocurrency, IEEE, 2019.","chicago":"Chatterjee, Krishnendu, Amir Kafshdar Goharshady, and Arash Pourdamghani. “Probabilistic Smart Contracts: Secure Randomness on the Blockchain.” In IEEE International Conference on Blockchain and Cryptocurrency. IEEE, 2019. https://doi.org/10.1109/BLOC.2019.8751326.","ista":"Chatterjee K, Goharshady AK, Pourdamghani A. 2019. Probabilistic smart contracts: Secure randomness on the blockchain. IEEE International Conference on Blockchain and Cryptocurrency. IEEE International Conference on Blockchain and Cryptocurrency, 8751326."},"title":"Probabilistic smart contracts: Secure randomness on the blockchain","external_id":{"arxiv":["1902.07986"]},"author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"full_name":"Goharshady, Amir Kafshdar","orcid":"0000-0003-1702-6584","last_name":"Goharshady","id":"391365CE-F248-11E8-B48F-1D18A9856A87","first_name":"Amir Kafshdar"},{"full_name":"Pourdamghani, Arash","last_name":"Pourdamghani","first_name":"Arash"}],"oa":1,"quality_controlled":"1","publisher":"IEEE","publication":"IEEE International Conference on Blockchain and Cryptocurrency","day":"01","year":"2019","date_created":"2019-02-26T09:03:15Z","doi":"10.1109/BLOC.2019.8751326","date_published":"2019-05-01T00:00:00Z","_id":"6056","status":"public","conference":{"name":"IEEE International Conference on Blockchain and Cryptocurrency","start_date":"2019-05-14","end_date":"2019-05-17","location":"Seoul, Korea"},"type":"conference","date_updated":"2024-03-27T23:30:33Z","department":[{"_id":"KrCh"}],"oa_version":"Preprint","abstract":[{"text":"In today's programmable blockchains, smart contracts are limited to being deterministic and non-probabilistic. This lack of randomness is a consequential limitation, given that a wide variety of real-world financial contracts, such as casino games and lotteries, depend entirely on randomness. As a result, several ad-hoc random number generation approaches have been developed to be used in smart contracts. These include ideas such as using an oracle or relying on the block hash. However, these approaches are manipulatable, i.e. their output can be tampered with by parties who might not be neutral, such as the owner of the oracle or the miners.We propose a novel game-theoretic approach for generating provably unmanipulatable pseudorandom numbers on the blockchain. Our approach allows smart contracts to access a trustworthy source of randomness that does not rely on potentially compromised miners or oracles, hence enabling the creation of a new generation of smart contracts that are not limited to being non-probabilistic and can be drawn from the much more general class of probabilistic programs.","lang":"eng"}],"month":"05","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1902.07986"}],"scopus_import":1,"language":[{"iso":"eng"}],"publication_status":"published","ec_funded":1,"related_material":{"record":[{"relation":"dissertation_contains","id":"8934","status":"public"}]}},{"citation":{"ieee":"K. Chatterjee, A. K. Goharshady, and A. Pourdamghani, “Hybrid Mining: Exploiting blockchain’s computational power for distributed problem solving,” in Proceedings of the 34th ACM Symposium on Applied Computing, Limassol, Cyprus, 2019, vol. Part F147772, pp. 374–381.","short":"K. Chatterjee, A.K. Goharshady, A. Pourdamghani, in:, Proceedings of the 34th ACM Symposium on Applied Computing, ACM, 2019, pp. 374–381.","ama":"Chatterjee K, Goharshady AK, Pourdamghani A. Hybrid Mining: Exploiting blockchain’s computational power for distributed problem solving. In: Proceedings of the 34th ACM Symposium on Applied Computing. Vol Part F147772. ACM; 2019:374-381. doi:10.1145/3297280.3297319","apa":"Chatterjee, K., Goharshady, A. K., & Pourdamghani, A. (2019). Hybrid Mining: Exploiting blockchain’s computational power for distributed problem solving. In Proceedings of the 34th ACM Symposium on Applied Computing (Vol. Part F147772, pp. 374–381). Limassol, Cyprus: ACM. https://doi.org/10.1145/3297280.3297319","mla":"Chatterjee, Krishnendu, et al. “Hybrid Mining: Exploiting Blockchain’s Computational Power for Distributed Problem Solving.” Proceedings of the 34th ACM Symposium on Applied Computing, vol. Part F147772, ACM, 2019, pp. 374–81, doi:10.1145/3297280.3297319.","ista":"Chatterjee K, Goharshady AK, Pourdamghani A. 2019. Hybrid Mining: Exploiting blockchain’s computational power for distributed problem solving. Proceedings of the 34th ACM Symposium on Applied Computing. ACM Symposium on Applied Computing vol. Part F147772, 374–381.","chicago":"Chatterjee, Krishnendu, Amir Kafshdar Goharshady, and Arash Pourdamghani. “Hybrid Mining: Exploiting Blockchain’s Computational Power for Distributed Problem Solving.” In Proceedings of the 34th ACM Symposium on Applied Computing, Part F147772:374–81. ACM, 2019. https://doi.org/10.1145/3297280.3297319."},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","article_processing_charge":"No","external_id":{"isi":["000474685800049"]},"author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"first_name":"Amir Kafshdar","id":"391365CE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1702-6584","full_name":"Goharshady, Amir Kafshdar","last_name":"Goharshady"},{"first_name":"Arash","last_name":"Pourdamghani","full_name":"Pourdamghani, Arash"}],"title":"Hybrid Mining: Exploiting blockchain’s computational power for distributed problem solving","project":[{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"},{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"year":"2019","isi":1,"has_accepted_license":"1","publication":"Proceedings of the 34th ACM Symposium on Applied Computing","day":"01","page":"374-381","date_created":"2019-05-06T12:11:36Z","doi":"10.1145/3297280.3297319","date_published":"2019-04-01T00:00:00Z","oa":1,"quality_controlled":"1","publisher":"ACM","date_updated":"2024-03-27T23:30:33Z","ddc":["004"],"file_date_updated":"2020-07-14T12:47:29Z","department":[{"_id":"KrCh"}],"_id":"6378","conference":{"name":"ACM Symposium on Applied Computing","start_date":"2019-04-08","location":"Limassol, Cyprus","end_date":"2019-04-12"},"type":"conference","pubrep_id":"1069","status":"public","publication_status":"published","publication_identifier":{"isbn":["9781450359337"]},"language":[{"iso":"eng"}],"file":[{"date_created":"2019-05-06T12:09:27Z","file_name":"2019_ACM_Chatterjee.pdf","date_updated":"2020-07-14T12:47:29Z","file_size":1023934,"creator":"dernst","file_id":"6379","checksum":"fbfbcd5a0c7a743862bfc3045539a614","content_type":"application/pdf","access_level":"open_access","relation":"main_file"}],"ec_funded":1,"volume":"Part F147772","related_material":{"record":[{"id":"8934","status":"public","relation":"dissertation_contains"}]},"abstract":[{"text":"In today's cryptocurrencies, Hashcash proof of work is the most commonly-adopted approach to mining. In Hashcash, when a miner decides to add a block to the chain, she has to solve the difficult computational puzzle of inverting a hash function. While Hashcash has been successfully adopted in both Bitcoin and Ethereum, it has attracted significant and harsh criticism due to its massive waste of electricity, its carbon footprint and environmental effects, and the inherent lack of usefulness in inverting a hash function. Various other mining protocols have been suggested, including proof of stake, in which a miner's chance of adding the next block is proportional to her current balance. However, such protocols lead to a higher entry cost for new miners who might not still have any stake in the cryptocurrency, and can in the worst case lead to an oligopoly, where the rich have complete control over mining. In this paper, we propose Hybrid Mining: a new mining protocol that combines solving real-world useful problems with Hashcash. Our protocol allows new miners to join the network by taking part in Hashcash mining without having to own an initial stake. It also allows nodes of the network to submit hard computational problems whose solutions are of interest in the real world, e.g.~protein folding problems. Then, miners can choose to compete in solving these problems, in lieu of Hashcash, for adding a new block. Hence, Hybrid Mining incentivizes miners to solve useful problems, such as hard computational problems arising in biology, in a distributed manner. It also gives researchers in other areas an easy-to-use tool to outsource their hard computations to the blockchain network, which has enormous computational power, by paying a reward to the miner who solves the problem for them. Moreover, our protocol provides strong security guarantees and is at least as resilient to double spending as Bitcoin.","lang":"eng"}],"oa_version":"Submitted Version","scopus_import":"1","month":"04"},{"_id":"6175","status":"public","keyword":["Program Cost Analysis","Program Termination","Probabilistic Programs","Martingales"],"type":"conference","conference":{"location":"Phoenix, AZ, United States","end_date":"2019-06-26","start_date":"2019-06-22","name":"PLDI: Conference on Programming Language Design and Implementation"},"ddc":["000"],"date_updated":"2024-03-27T23:30:33Z","file_date_updated":"2020-07-14T12:47:20Z","department":[{"_id":"KrCh"}],"oa_version":"Submitted Version","abstract":[{"text":"We consider the problem of expected cost analysis over nondeterministic probabilistic programs,\r\nwhich aims at automated methods for analyzing the resource-usage of such programs.\r\nPrevious approaches for this problem could only handle nonnegative bounded costs.\r\nHowever, in many scenarios, such as queuing networks or analysis of cryptocurrency protocols,\r\nboth positive and negative costs are necessary and the costs are unbounded as well.\r\n\r\nIn this work, we present a sound and efficient approach to obtain polynomial bounds on the\r\nexpected accumulated cost of nondeterministic probabilistic programs.\r\nOur approach can handle (a) general positive and negative costs with bounded updates in\r\nvariables; and (b) nonnegative costs with general updates to variables.\r\nWe show that several natural examples which could not be\r\nhandled by previous approaches are captured in our framework.\r\n\r\nMoreover, our approach leads to an efficient polynomial-time algorithm, while no\r\nprevious approach for cost analysis of probabilistic programs could guarantee polynomial runtime.\r\nFinally, we show the effectiveness of our approach using experimental results on a variety of programs for which we efficiently synthesize tight resource-usage bounds.","lang":"eng"}],"month":"06","scopus_import":"1","file":[{"file_size":4051066,"date_updated":"2020-07-14T12:47:20Z","creator":"akafshda","file_name":"paper.pdf","date_created":"2019-03-25T10:11:22Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","checksum":"703a5e9b8c8587f2a44085ffd9a4db64","file_id":"6176"}],"language":[{"iso":"eng"}],"publication_status":"published","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"5457"},{"id":"8934","status":"public","relation":"dissertation_contains"}]},"ec_funded":1,"project":[{"grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S11407","name":"Game Theory"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"},{"name":"Quantitative Game-theoretic Analysis of Blockchain Applications and Smart Contracts","_id":"266EEEC0-B435-11E9-9278-68D0E5697425"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"chicago":"Wang, Peixin, Hongfei Fu, Amir Kafshdar Goharshady, Krishnendu Chatterjee, Xudong Qin, and Wenjun Shi. “Cost Analysis of Nondeterministic Probabilistic Programs.” In PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, 204–20. Association for Computing Machinery, 2019. https://doi.org/10.1145/3314221.3314581.","ista":"Wang P, Fu H, Goharshady AK, Chatterjee K, Qin X, Shi W. 2019. Cost analysis of nondeterministic probabilistic programs. PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation. PLDI: Conference on Programming Language Design and Implementation, 204–220.","mla":"Wang, Peixin, et al. “Cost Analysis of Nondeterministic Probabilistic Programs.” PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2019, pp. 204–20, doi:10.1145/3314221.3314581.","ama":"Wang P, Fu H, Goharshady AK, Chatterjee K, Qin X, Shi W. Cost analysis of nondeterministic probabilistic programs. In: PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation. Association for Computing Machinery; 2019:204-220. doi:10.1145/3314221.3314581","apa":"Wang, P., Fu, H., Goharshady, A. K., Chatterjee, K., Qin, X., & Shi, W. (2019). Cost analysis of nondeterministic probabilistic programs. In PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation (pp. 204–220). Phoenix, AZ, United States: Association for Computing Machinery. https://doi.org/10.1145/3314221.3314581","ieee":"P. Wang, H. Fu, A. K. Goharshady, K. Chatterjee, X. Qin, and W. Shi, “Cost analysis of nondeterministic probabilistic programs,” in PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, Phoenix, AZ, United States, 2019, pp. 204–220.","short":"P. Wang, H. Fu, A.K. Goharshady, K. Chatterjee, X. Qin, W. Shi, in:, PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2019, pp. 204–220."},"title":"Cost analysis of nondeterministic probabilistic programs","author":[{"first_name":"Peixin","last_name":"Wang","full_name":"Wang, Peixin"},{"id":"3AAD03D6-F248-11E8-B48F-1D18A9856A87","first_name":"Hongfei","full_name":"Fu, Hongfei","last_name":"Fu"},{"last_name":"Goharshady","full_name":"Goharshady, Amir Kafshdar","orcid":"0000-0003-1702-6584","id":"391365CE-F248-11E8-B48F-1D18A9856A87","first_name":"Amir Kafshdar"},{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"first_name":"Xudong","full_name":"Qin, Xudong","last_name":"Qin"},{"first_name":"Wenjun","last_name":"Shi","full_name":"Shi, Wenjun"}],"article_processing_charge":"No","external_id":{"arxiv":["1902.04659"],"isi":["000523190300014"]},"publisher":"Association for Computing Machinery","quality_controlled":"1","oa":1,"day":"08","publication":"PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation","isi":1,"has_accepted_license":"1","year":"2019","doi":"10.1145/3314221.3314581","date_published":"2019-06-08T00:00:00Z","date_created":"2019-03-25T10:13:25Z","page":"204-220"}]