[{"article_processing_charge":"No","citation":{"ieee":"M. Nardin, “On the encoding, transfer, and consolidation of spatial memories,” Institute of Science and Technology Austria, 2022.","short":"M. Nardin, On the Encoding, Transfer, and Consolidation of Spatial Memories, Institute of Science and Technology Austria, 2022.","mla":"Nardin, Michele. <i>On the Encoding, Transfer, and Consolidation of Spatial Memories</i>. Institute of Science and Technology Austria, 2022, doi:<a href=\"https://doi.org/10.15479/at:ista:11932\">10.15479/at:ista:11932</a>.","ista":"Nardin M. 2022. On the encoding, transfer, and consolidation of spatial memories. Institute of Science and Technology Austria.","chicago":"Nardin, Michele. “On the Encoding, Transfer, and Consolidation of Spatial Memories.” Institute of Science and Technology Austria, 2022. <a href=\"https://doi.org/10.15479/at:ista:11932\">https://doi.org/10.15479/at:ista:11932</a>.","apa":"Nardin, M. (2022). <i>On the encoding, transfer, and consolidation of spatial memories</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:11932\">https://doi.org/10.15479/at:ista:11932</a>","ama":"Nardin M. On the encoding, transfer, and consolidation of spatial memories. 2022. doi:<a href=\"https://doi.org/10.15479/at:ista:11932\">10.15479/at:ista:11932</a>"},"related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"6194"},{"relation":"part_of_dissertation","status":"public","id":"10077"}]},"_id":"11932","title":"On the encoding, transfer, and consolidation of spatial memories","month":"08","OA_place":"publisher","doi":"10.15479/at:ista:11932","alternative_title":["ISTA Thesis"],"ddc":["573"],"type":"dissertation","publisher":"Institute of Science and Technology Austria","day":"19","status":"public","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","page":"136","date_published":"2022-08-19T00:00:00Z","has_accepted_license":"1","project":[{"call_identifier":"H2020","name":"International IST Doctoral Program","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"}],"year":"2022","oa_version":"Published Version","date_updated":"2026-04-07T14:22:58Z","abstract":[{"text":"The ability to form and retrieve memories is central to survival. In mammals, the hippocampus\r\nis a brain region essential to the acquisition and consolidation of new memories. It is also\r\ninvolved in keeping track of one’s position in space and aids navigation. Although this\r\nspace-memory has been a source of contradiction, evidence supports the view that the role of\r\nthe hippocampus in navigation is memory, thanks to the formation of cognitive maps. First\r\nintroduced by Tolman in 1948, cognitive maps are generally used to organize experiences in\r\nmemory; however, the detailed mechanisms by which these maps are formed and stored are not\r\nyet agreed upon. Some influential theories describe this process as involving three fundamental\r\nsteps: initial encoding by the hippocampus, interactions between the hippocampus and other\r\ncortical areas, and long-term extra-hippocampal consolidation. In this thesis, I will show how\r\nthe investigation of cognitive maps of space helped to shed light on each of these three memory\r\nprocesses.\r\nThe first study included in this thesis deals with the initial encoding of spatial memories in\r\nthe hippocampus. Much is known about encoding at the level of single cells, but less about\r\ntheir co-activity or joint contribution to the encoding of novel spatial information. I will\r\ndescribe the structure of an interaction network that allows for efficient encoding of noisy\r\nspatial information during the first exploration of a novel environment.\r\nThe second study describes the interactions between the hippocampus and the prefrontal\r\ncortex (PFC), two areas directly and indirectly connected. It is known that the PFC, in concert\r\nwith the hippocampus, is involved in various processes, including memory storage and spatial\r\nnavigation. Nonetheless, the detailed mechanisms by which PFC receives information from the\r\nhippocampus are not clear. I will show how a transient improvement in theta phase locking of\r\nPFC cells enables interactions of cell pairs across the two regions.\r\nThe third study describes the learning of behaviorally-relevant spatial locations in the hippocampus and the medial entorhinal cortex. I will show how the accumulation of firing around\r\ngoal locations, a correlate of learning, can shed light on the transition from short- to long-term\r\nspatial memories and the speed of consolidation in different brain areas.\r\nThe studies included in this thesis represent the main scientific contributions of my Ph.D. They\r\ninvolve statistical analyses and models of neural responses of cells in different brain areas of\r\nrats executing spatial tasks. I will conclude the thesis by discussing the impact of the findings\r\non principles of memory formation and retention, including the mechanisms, the speed, and\r\nthe duration of these processes.","lang":"eng"}],"supervisor":[{"orcid":"0000-0002-5193-4036","first_name":"Jozsef L","id":"3FA14672-F248-11E8-B48F-1D18A9856A87","full_name":"Csicsvari, Jozsef L","last_name":"Csicsvari"}],"department":[{"_id":"GradSch"},{"_id":"JoCs"}],"date_created":"2022-08-19T08:52:30Z","language":[{"iso":"eng"}],"corr_author":"1","degree_awarded":"PhD","publication_status":"published","file":[{"relation":"source_file","access_level":"closed","embargo_to":"open_access","checksum":"2dbb70c74aaa3b64c1f463e943baf09c","content_type":"application/zip","date_updated":"2023-06-20T22:30:04Z","file_id":"11935","date_created":"2022-08-19T16:31:34Z","file_name":"Michele Nardin, Ph.D. Thesis - ISTA (1).zip","creator":"mnardin","file_size":13515457},{"creator":"mnardin","file_name":"Michele_Nardin_Phd_Thesis_PDFA.pdf","file_id":"11941","date_created":"2022-08-22T09:43:50Z","file_size":9906458,"checksum":"0ec94035ea35a47a9f589ed168e60b48","content_type":"application/pdf","date_updated":"2023-06-20T22:30:04Z","embargo":"2023-06-19","access_level":"open_access","relation":"main_file"}],"acknowledgement":"I acknowledge the support from the European Union’s Horizon 2020 research and innovation program under the Marie Skłodowska-Curie Grant Agreement No. 665385.","oa":1,"publication_identifier":{"issn":["2663-337X"]},"author":[{"id":"30BD0376-F248-11E8-B48F-1D18A9856A87","first_name":"Michele","full_name":"Nardin, Michele","last_name":"Nardin","orcid":"0000-0001-8849-6570"}],"file_date_updated":"2023-06-20T22:30:04Z","ec_funded":1},{"publication_status":"published","degree_awarded":"PhD","corr_author":"1","language":[{"iso":"eng"}],"department":[{"_id":"GradSch"},{"_id":"DaSi"}],"date_created":"2022-04-20T08:59:07Z","acknowledged_ssus":[{"_id":"LifeSc"}],"license":"https://creativecommons.org/licenses/by/4.0/","abstract":[{"text":"The infiltration of immune cells into tissues underlies the establishment of tissue-resident\r\nmacrophages and responses to infections and tumors. However, the mechanisms immune\r\ncells utilize to collectively migrate through tissue barriers in vivo are not yet well understood.\r\nIn this thesis, I describe two mechanisms that Drosophila immune cells (hemocytes) use to\r\novercome the tissue barrier of the germband in the embryo. One strategy is the strengthening\r\nof the actin cortex through developmentally controlled transcriptional regulation induced by\r\nthe Drosophila proto-oncogene family member Dfos, which I show in Chapter 2. Dfos induces\r\nexpression of the tetraspanin TM4SF and the filamin Cher leading to higher levels of the\r\nactivated formin Dia at the cortex and increased cortical F-actin. This enhanced cortical\r\nstrength allows hemocytes to overcome the physical resistance of the surrounding tissue and\r\ntranslocate their nucleus to move forward. This mechanism affects the speed of migration\r\nwhen hemocytes face a confined environment in vivo.\r\nAnother aspect of the invasion process is the initial step of the leading hemocytes entering\r\nthe tissue, which potentially guides the follower cells. In Chapter 3, I describe a novel\r\nsubpopulation of hemocytes activated by BMP signaling prior to tissue invasion that leads\r\npenetration into the germband. Hemocytes that are deficient in BMP signaling activation\r\nshow impaired persistence at the tissue entry, while their migration speed remains\r\nunaffected.\r\nThis suggests that there might be different mechanisms controlling immune cell migration\r\nwithin the confined environment in vivo, one of these being the general ability to overcome\r\nthe resistance of the surrounding tissue and another affecting the order of hemocytes that\r\ncollectively invade the tissue in a stream of individual cells.\r\nTogether, my findings provide deeper insights into transcriptional changes in immune\r\ncells that enable efficient tissue invasion and pave the way for future studies investigating the\r\nearly colonization of tissues by macrophages in higher organisms. Moreover, they extend the\r\ncurrent view of Drosophila immune cell heterogeneity and point toward a potentially\r\nconserved role for canonical BMP signaling in specifying immune cells that lead the migration\r\nof tissue resident macrophages during embryogenesis.","lang":"eng"}],"supervisor":[{"full_name":"Siekhaus, Daria E","last_name":"Siekhaus","id":"3D224B9E-F248-11E8-B48F-1D18A9856A87","first_name":"Daria E","orcid":"0000-0001-8323-8353"}],"file_date_updated":"2023-04-21T22:30:03Z","author":[{"first_name":"Stephanie","id":"2A95E7B0-F248-11E8-B48F-1D18A9856A87","last_name":"Wachner","full_name":"Wachner, Stephanie"}],"oa":1,"publication_identifier":{"issn":["2663-337X"]},"file":[{"embargo":"2023-04-20","relation":"main_file","access_level":"open_access","date_created":"2022-04-20T09:03:57Z","file_id":"11195","file_name":"Thesis_Stephanie_Wachner_20200414_formatted.pdf","creator":"cchlebak","file_size":8820951,"checksum":"999ab16884c4522486136ebc5ae8dbff","content_type":"application/pdf","date_updated":"2023-04-21T22:30:03Z"},{"embargo_to":"open_access","relation":"source_file","access_level":"closed","file_size":65864612,"file_id":"11329","date_created":"2022-04-22T12:41:00Z","creator":"cchlebak","file_name":"Thesis_Stephanie_Wachner_20200414.zip","date_updated":"2023-04-21T22:30:03Z","checksum":"fd92b1e38d53bdf8b458213882d41383","content_type":"application/x-zip-compressed"}],"ddc":["570"],"OA_place":"publisher","doi":"10.15479/at:ista:11193","alternative_title":["ISTA Thesis"],"title":"Transcriptional regulation by Dfos and BMP-signaling support tissue invasion of Drosophila immune cells","month":"04","_id":"11193","citation":{"mla":"Wachner, Stephanie. <i>Transcriptional Regulation by Dfos and BMP-Signaling Support Tissue Invasion of Drosophila Immune Cells</i>. Institute of Science and Technology Austria, 2022, doi:<a href=\"https://doi.org/10.15479/at:ista:11193\">10.15479/at:ista:11193</a>.","short":"S. Wachner, Transcriptional Regulation by Dfos and BMP-Signaling Support Tissue Invasion of Drosophila Immune Cells, Institute of Science and Technology Austria, 2022.","ieee":"S. Wachner, “Transcriptional regulation by Dfos and BMP-signaling support tissue invasion of Drosophila immune cells,” Institute of Science and Technology Austria, 2022.","ama":"Wachner S. Transcriptional regulation by Dfos and BMP-signaling support tissue invasion of Drosophila immune cells. 2022. doi:<a href=\"https://doi.org/10.15479/at:ista:11193\">10.15479/at:ista:11193</a>","apa":"Wachner, S. (2022). <i>Transcriptional regulation by Dfos and BMP-signaling support tissue invasion of Drosophila immune cells</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:11193\">https://doi.org/10.15479/at:ista:11193</a>","chicago":"Wachner, Stephanie. “Transcriptional Regulation by Dfos and BMP-Signaling Support Tissue Invasion of Drosophila Immune Cells.” Institute of Science and Technology Austria, 2022. <a href=\"https://doi.org/10.15479/at:ista:11193\">https://doi.org/10.15479/at:ista:11193</a>.","ista":"Wachner S. 2022. Transcriptional regulation by Dfos and BMP-signaling support tissue invasion of Drosophila immune cells. Institute of Science and Technology Austria."},"related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"10614"},{"status":"public","relation":"part_of_dissertation","id":"544"}]},"article_processing_charge":"No","year":"2022","oa_version":"Published Version","date_updated":"2026-04-07T14:24:19Z","date_published":"2022-04-20T00:00:00Z","has_accepted_license":"1","project":[{"name":"Implications of a TGFβ/Dpp-activated subpopulation for Drosophila macrophage migration","grant_number":"24800","_id":"26199CA4-B435-11E9-9278-68D0E5697425"}],"page":"170","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","tmp":{"short":"CC BY (4.0)","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)"},"status":"public","type":"dissertation","publisher":"Institute of Science and Technology Austria","day":"20"},{"tmp":{"short":"CC BY (4.0)","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)"},"status":"public","day":"11","publisher":"Institute of Science and Technology Austria","type":"dissertation","date_updated":"2026-04-07T14:29:41Z","year":"2022","oa_version":"Published Version","project":[{"name":"International IST Doctoral Program","call_identifier":"H2020","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"}],"date_published":"2022-11-11T00:00:00Z","has_accepted_license":"1","page":"142","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","month":"11","title":"MorphOMICs, a tool for mapping microglial morphology, reveals brain region- and sex-dependent phenotypes","_id":"12378","related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"12244"}]},"citation":{"ieee":"G. Colombo, “MorphOMICs, a tool for mapping microglial morphology, reveals brain region- and sex-dependent phenotypes,” Institute of Science and Technology Austria, 2022.","mla":"Colombo, Gloria. <i>MorphOMICs, a Tool for Mapping Microglial Morphology, Reveals Brain Region- and Sex-Dependent Phenotypes</i>. Institute of Science and Technology Austria, 2022, doi:<a href=\"https://doi.org/10.15479/at:ista:12378\">10.15479/at:ista:12378</a>.","short":"G. Colombo, MorphOMICs, a Tool for Mapping Microglial Morphology, Reveals Brain Region- and Sex-Dependent Phenotypes, Institute of Science and Technology Austria, 2022.","chicago":"Colombo, Gloria. “MorphOMICs, a Tool for Mapping Microglial Morphology, Reveals Brain Region- and Sex-Dependent Phenotypes.” Institute of Science and Technology Austria, 2022. <a href=\"https://doi.org/10.15479/at:ista:12378\">https://doi.org/10.15479/at:ista:12378</a>.","ista":"Colombo G. 2022. MorphOMICs, a tool for mapping microglial morphology, reveals brain region- and sex-dependent phenotypes. Institute of Science and Technology Austria.","ama":"Colombo G. MorphOMICs, a tool for mapping microglial morphology, reveals brain region- and sex-dependent phenotypes. 2022. doi:<a href=\"https://doi.org/10.15479/at:ista:12378\">10.15479/at:ista:12378</a>","apa":"Colombo, G. (2022). <i>MorphOMICs, a tool for mapping microglial morphology, reveals brain region- and sex-dependent phenotypes</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:12378\">https://doi.org/10.15479/at:ista:12378</a>"},"article_processing_charge":"No","ddc":["570"],"alternative_title":["ISTA Thesis"],"OA_place":"publisher","doi":"10.15479/at:ista:12378","oa":1,"publication_identifier":{"issn":["2663-337X"]},"file":[{"embargo_to":"open_access","relation":"source_file","access_level":"closed","date_updated":"2023-04-12T22:30:03Z","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","checksum":"8cd3ddfe9b53381dcf086023d8d8893a","file_size":23890382,"file_id":"12379","date_created":"2023-01-25T14:31:32Z","file_name":"Gloria_Colombo_Thesis.docx","creator":"cchlebak"},{"creator":"cchlebak","file_name":"Gloria_Colombo_Thesis.pdf","file_id":"12380","date_created":"2023-01-25T14:31:36Z","file_size":13802421,"content_type":"application/pdf","checksum":"8af4319c18b516e8758e9a6cb02b103b","date_updated":"2023-04-12T22:30:03Z","embargo":"2023-04-11","access_level":"open_access","relation":"main_file"}],"ec_funded":1,"file_date_updated":"2023-04-12T22:30:03Z","author":[{"orcid":"0000-0001-9434-8902","first_name":"Gloria","id":"3483CF6C-F248-11E8-B48F-1D18A9856A87","full_name":"Colombo, Gloria","last_name":"Colombo"}],"acknowledged_ssus":[{"_id":"PreCl"},{"_id":"Bio"},{"_id":"ScienComp"}],"supervisor":[{"last_name":"Siegert","full_name":"Siegert, Sandra","id":"36ACD32E-F248-11E8-B48F-1D18A9856A87","first_name":"Sandra","orcid":"0000-0001-8635-0877"}],"abstract":[{"text":"Environmental cues influence the highly dynamic morphology of microglia. Strategies to \r\ncharacterize these changes usually involve user-selected morphometric features, which \r\npreclude the identification of a spectrum of context-dependent morphological phenotypes. \r\nHere, we develop MorphOMICs, a topological data analysis approach, which enables semi\u0002automatic mapping of microglial morphology into an atlas of cue-dependent phenotypes,\r\novercomes feature-selection bias and minimizes biological variability. \r\nFirst, with MorphOMICs we derive the morphological spectrum of microglia across seven \r\nbrain regions during postnatal development and in two distinct Alzheimer’s disease \r\ndegeneration mouse models. We uncover region-specific and sexually dimorphic\r\nmorphological trajectories, with females showing an earlier morphological shift than males in \r\nthe degenerating brain. Overall, we demonstrate that both long primary- and short terminal \r\nprocesses provide distinct insights to morphological phenotypes. Moreover, using machine \r\nlearning to map novel condition on the spectrum, we observe that microglia morphologies \r\nreflect a dose-dependent adaptation upon ketamine anesthesia and do not recover to control \r\nmorphologies.\r\nNext, we took advantage of MorphOMICs to build a high-resolution and layer-specific map of \r\nmicroglial morphological spectrum in the retina, covering postnatal development and rd10 \r\ndegeneration. Here, following photoreceptor death, microglia assume an early development\u0002like morphology. Finally, we map microglial morphology following optic nerve crush on the \r\nretinal spectrum and observe a layer- and sex-dependent response. \r\nOverall, MorphOMICs opens a new perspective to analyze microglial morphology across \r\nmultiple conditions, and provides a novel tool to characterize microglial morphology beyond \r\nthe traditionally dichotomized view of microglia.","lang":"eng"}],"publication_status":"published","degree_awarded":"PhD","corr_author":"1","language":[{"iso":"eng"}],"date_created":"2023-01-25T14:27:43Z","department":[{"_id":"GradSch"},{"_id":"SaSi"}]},{"degree_awarded":"PhD","publication_status":"published","department":[{"_id":"GradSch"},{"_id":"NiBa"}],"date_created":"2022-05-16T16:49:18Z","language":[{"iso":"eng"}],"corr_author":"1","abstract":[{"lang":"eng","text":"In evolve and resequence experiments, a population is sequenced, subjected to selection and\r\nthen sequenced again, so that genetic changes before and after selection can be observed at\r\nthe genetic level. Here, I use these studies to better understand the genetic basis of complex\r\ntraits - traits which depend on more than a few genes.\r\nIn the first chapter, I discuss the first evolve and resequence experiment, in which a population\r\nof mice, the so-called \"Longshanks\" mice, were selected for tibia length while their body mass\r\nwas kept constant. The full pedigree is known. We observed a selection response on all\r\nchromosomes and used the infinitesimal model with linkage, a model which assumes an infinite\r\nnumber of genes with infinitesimally small effect sizes, as a null model. Results implied a very\r\npolygenic basis with a few loci of major effect standing out and changing in parallel. There\r\nwas large variability between the different chromosomes in this study, probably due to LD.\r\nIn chapter two, I go on to discuss the impact of LD, on the variability in an allele-frequency\r\nbased summary statistic, giving an equation based on the initial allele frequencies, average\r\npairwise LD, and the first four moments of the haplotype block copy number distribution. I\r\ndescribe this distribution by referring back to the founder generation. I then demonstrate\r\nhow to infer selection via a maximum likelihood scheme on the example of a single locus and\r\ndiscuss how to extend this to more realistic scenarios.\r\nIn chapter three, I discuss the second evolve and resequence experiment, in which a small\r\npopulation of Drosophila melanogaster was selected for increased pupal case size over 6\r\ngenerations. The experiment was highly replicated with 27 lines selected within family and a\r\nknown pedigree. We observed a phenotypic selection response of over one standard deviation.\r\nI describe the patterns in allele frequency data, including allele frequency changes and patterns\r\nof heterozygosity, and give ideas for future work."}],"supervisor":[{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H","full_name":"Barton, Nicholas H","last_name":"Barton","orcid":"0000-0002-8548-5240"}],"author":[{"orcid":"0000-0002-9849-498X","last_name":"Belohlavy","full_name":"Belohlavy, Stefanie","first_name":"Stefanie","id":"43FE426A-F248-11E8-B48F-1D18A9856A87"}],"file_date_updated":"2023-05-20T22:30:03Z","file":[{"relation":"main_file","access_level":"open_access","embargo":"2023-05-19","checksum":"4d75e6a619df7e8a9d6e840aee182380","content_type":"application/pdf","date_updated":"2023-05-20T22:30:03Z","file_id":"11398","date_created":"2022-05-19T13:03:13Z","creator":"sbelohla","file_name":"thesis_sb_final_pdfa.pdf","file_size":8247240},{"creator":"sbelohla","file_name":"thesis_sb_final.zip","date_created":"2022-05-19T13:07:47Z","file_id":"11399","file_size":7094,"content_type":"application/x-zip-compressed","checksum":"7a5d8b6dd0ca00784f860075b0a7d8f0","date_updated":"2023-05-20T22:30:03Z","access_level":"closed","relation":"source_file","embargo_to":"open_access"}],"oa":1,"publication_identifier":{"isbn":["978-3-99078-018-3"]},"ddc":["576"],"OA_place":"publisher","doi":"10.15479/at:ista:11388","alternative_title":["ISTA Thesis"],"_id":"11388","title":"The genetic basis of complex traits studied via analysis of evolve and resequence experiments","month":"05","article_processing_charge":"No","citation":{"ieee":"S. Belohlavy, “The genetic basis of complex traits studied via analysis of evolve and resequence experiments,” Institute of Science and Technology Austria, 2022.","mla":"Belohlavy, Stefanie. <i>The Genetic Basis of Complex Traits Studied via Analysis of Evolve and Resequence Experiments</i>. Institute of Science and Technology Austria, 2022, doi:<a href=\"https://doi.org/10.15479/at:ista:11388\">10.15479/at:ista:11388</a>.","short":"S. Belohlavy, The Genetic Basis of Complex Traits Studied via Analysis of Evolve and Resequence Experiments, Institute of Science and Technology Austria, 2022.","chicago":"Belohlavy, Stefanie. “The Genetic Basis of Complex Traits Studied via Analysis of Evolve and Resequence Experiments.” Institute of Science and Technology Austria, 2022. <a href=\"https://doi.org/10.15479/at:ista:11388\">https://doi.org/10.15479/at:ista:11388</a>.","ista":"Belohlavy S. 2022. The genetic basis of complex traits studied via analysis of evolve and resequence experiments. Institute of Science and Technology Austria.","ama":"Belohlavy S. The genetic basis of complex traits studied via analysis of evolve and resequence experiments. 2022. doi:<a href=\"https://doi.org/10.15479/at:ista:11388\">10.15479/at:ista:11388</a>","apa":"Belohlavy, S. (2022). <i>The genetic basis of complex traits studied via analysis of evolve and resequence experiments</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:11388\">https://doi.org/10.15479/at:ista:11388</a>"},"related_material":{"record":[{"id":"6713","relation":"part_of_dissertation","status":"public"}]},"date_published":"2022-05-18T00:00:00Z","has_accepted_license":"1","year":"2022","oa_version":"Published Version","date_updated":"2026-04-07T14:29:57Z","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","page":"98","status":"public","tmp":{"short":"CC BY (4.0)","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)"},"publisher":"Institute of Science and Technology Austria","type":"dissertation","day":"18"},{"abstract":[{"text":"Detachment of the cancer cells from the bulk of the tumor is the first step of metastasis, which\r\nis the primary cause of cancer related deaths. It is unclear, which factors contribute to this step.\r\nRecent studies indicate a crucial role of the tumor microenvironment in malignant\r\ntransformation and metastasis. Studying cancer cell invasion and detachments quantitatively in\r\nthe context of its physiological microenvironment is technically challenging. Especially, precise\r\ncontrol of microenvironmental properties in vivo is currently not possible. Here, I studied the\r\nrole of microenvironment geometry in the invasion and detachment of cancer cells from the\r\nbulk with a simplistic and reductionist approach. In this approach, I engineered microfluidic\r\ndevices to mimic a pseudo 3D extracellular matrix environment, where I was able to\r\nquantitatively tune the geometrical configuration of the microenvironment and follow tumor\r\ncells with fluorescence live imaging. To aid quantitative analysis I developed a widely applicable\r\nsoftware application to automatically analyze and visualize particle tracking data.\r\nQuantitative analysis of tumor cell invasion in isotropic and anisotropic microenvironments\r\nshowed that heterogeneity in the microenvironment promotes faster invasion and more\r\nfrequent detachment of cells. These observations correlated with overall higher speed of cells at\r\nthe edge of the bulk of the cells. In heterogeneous microenvironments cells preferentially\r\npassed through larger pores, thus invading areas of least resistance and generating finger-like\r\ninvasive structures. The detachments occurred mostly at the tips of these structures.\r\nTo investigate the potential mechanism, we established a two dimensional model to simulate\r\nactive Brownian particles representing the cell nuclei dynamics. These simulations backed our in\r\nvitro observations without the need of precise fitting the simulation parameters. Our model\r\nsuggests the importance of the pore heterogeneity in the direction perpendicular to the\r\norientation of bias field (lateral heterogeneity), which causes the interface roughening.","lang":"eng"}],"supervisor":[{"id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","first_name":"Michael K","last_name":"Sixt","full_name":"Sixt, Michael K","orcid":"0000-0002-6620-9179"}],"degree_awarded":"PhD","publication_status":"published","department":[{"_id":"GradSch"},{"_id":"MiSi"}],"date_created":"2023-01-26T11:55:16Z","corr_author":"1","language":[{"iso":"eng"}],"file":[{"access_level":"open_access","relation":"main_file","embargo":"2023-12-20","content_type":"application/pdf","checksum":"cc4a2b4a7e3c4ee8ef7f2dbf909b12bd","date_updated":"2023-12-21T23:30:03Z","creator":"cchlebak","file_name":"PhD-Thesis_Saren Tasciyan_formatted_aftercrash_fixed_600dpi_95pc_final_PDFA3b.pdf","date_created":"2023-01-26T11:58:14Z","file_id":"12402","file_size":42059787},{"creator":"cchlebak","file_name":"Source Files - Saren Tasciyan - PhD Thesis.zip","date_created":"2023-01-26T12:00:10Z","file_id":"12403","file_size":261256696,"checksum":"f1b4ca98b8ab0cb043b1830971e9bd9c","content_type":"application/x-zip-compressed","date_updated":"2023-12-21T23:30:03Z","access_level":"closed","relation":"source_file","embargo_to":"open_access"}],"oa":1,"publication_identifier":{"issn":["2663-337X"]},"file_date_updated":"2023-12-21T23:30:03Z","author":[{"orcid":"0000-0003-1671-393X","id":"4323B49C-F248-11E8-B48F-1D18A9856A87","first_name":"Saren","full_name":"Tasciyan, Saren","last_name":"Tasciyan"}],"_id":"12401","title":"Role of microenvironment heterogeneity in cancer cell invasion","month":"12","article_processing_charge":"No","citation":{"chicago":"Tasciyan, Saren. “Role of Microenvironment Heterogeneity in Cancer Cell Invasion.” Institute of Science and Technology Austria, 2022. <a href=\"https://doi.org/10.15479/at:ista:12401\">https://doi.org/10.15479/at:ista:12401</a>.","ista":"Tasciyan S. 2022. Role of microenvironment heterogeneity in cancer cell invasion. Institute of Science and Technology Austria.","ama":"Tasciyan S. Role of microenvironment heterogeneity in cancer cell invasion. 2022. doi:<a href=\"https://doi.org/10.15479/at:ista:12401\">10.15479/at:ista:12401</a>","apa":"Tasciyan, S. (2022). <i>Role of microenvironment heterogeneity in cancer cell invasion</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:12401\">https://doi.org/10.15479/at:ista:12401</a>","ieee":"S. Tasciyan, “Role of microenvironment heterogeneity in cancer cell invasion,” Institute of Science and Technology Austria, 2022.","short":"S. Tasciyan, Role of Microenvironment Heterogeneity in Cancer Cell Invasion, Institute of Science and Technology Austria, 2022.","mla":"Tasciyan, Saren. <i>Role of Microenvironment Heterogeneity in Cancer Cell Invasion</i>. Institute of Science and Technology Austria, 2022, doi:<a href=\"https://doi.org/10.15479/at:ista:12401\">10.15479/at:ista:12401</a>."},"related_material":{"record":[{"id":"7885","relation":"part_of_dissertation","status":"public"},{"id":"10703","relation":"part_of_dissertation","status":"public"},{"id":"679","status":"public","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"9429"}]},"ddc":["610"],"OA_place":"publisher","doi":"10.15479/at:ista:12401","alternative_title":["ISTA Thesis"],"status":"public","publisher":"Institute of Science and Technology Austria","type":"dissertation","day":"22","date_published":"2022-12-22T00:00:00Z","has_accepted_license":"1","year":"2022","oa_version":"Published Version","date_updated":"2026-04-14T09:07:14Z","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","page":"105"},{"article_number":"e68","abstract":[{"lang":"eng","text":"The brain efficiently performs nonlinear computations through its intricate networks of spiking neurons, but how this is done remains elusive. While nonlinear computations can be implemented successfully in spiking neural networks, this requires supervised training and the resulting connectivity can be hard to interpret. In contrast, the required connectivity for any computation in the form of a linear dynamical system can be directly derived and understood with the spike coding network (SCN) framework. These networks also have biologically realistic activity patterns and are highly robust to cell death. Here we extend the SCN framework to directly implement any polynomial dynamical system, without the need for training. This results in networks requiring a mix of synapse types (fast, slow, and multiplicative), which we term multiplicative spike coding networks (mSCNs). Using mSCNs, we demonstrate how to directly derive the required connectivity for several nonlinear dynamical systems. We also show how to carry out higher-order polynomials with coupled networks that use only pair-wise multiplicative synapses, and provide expected numbers of connections for each synapse type. Overall, our work demonstrates a novel method for implementing nonlinear computations in spiking neural networks, while keeping the attractive features of standard SCNs (robustness, realistic activity patterns, and interpretable connectivity). Finally, we discuss the biological plausibility of our approach, and how the high accuracy and robustness of the approach may be of interest for neuromorphic computing."}],"volume":1,"quality_controlled":"1","date_created":"2022-01-17T11:12:40Z","department":[{"_id":"GradSch"},{"_id":"JoCs"}],"external_id":{"arxiv":["2009.03857"]},"language":[{"iso":"eng"}],"corr_author":"1","publication_status":"published","file":[{"date_updated":"2022-01-17T11:15:26Z","checksum":"cd9af6b331918608f2e3d1c7940cbf4f","content_type":"application/pdf","file_size":3311494,"file_id":"10636","date_created":"2022-01-17T11:15:26Z","file_name":"10_24072_pcjournal_69.pdf","creator":"mnardin","relation":"main_file","access_level":"open_access","success":1}],"acknowledgement":"A preprint version of this article has been peer-reviewed and recommended by Peer Community In Neuroscience (DOI link to the recommendation: https://doi.org/10.24072/pci.cneuro.100003).\r\nWe thank Christian Machens and Nuno Calaim for useful discussions on the project. This report\r\ncame out of a collaboration started at the CAJAL Advanced Neuroscience Training Programme in\r\nComputational Neuroscience in Lisbon, Portugal, during the 2019 summer. The authors would\r\nlike to thank the participants, TAs, lecturers, and organizers of the summer school. SWK was\r\nsupported by the Simons Collaboration on the Global Brain (543009). WFP was supported by\r\nFCT (032077). MN was supported by European Union Horizon 2020 (665385).\r\n","publication_identifier":{"eissn":["2804-3871"]},"oa":1,"publication":"Peer Community Journal","file_date_updated":"2022-01-17T11:15:26Z","author":[{"orcid":"0000-0001-8849-6570","first_name":"Michele","id":"30BD0376-F248-11E8-B48F-1D18A9856A87","last_name":"Nardin","full_name":"Nardin, Michele"},{"full_name":"Phillips, James W.","last_name":"Phillips","first_name":"James W."},{"last_name":"Podlaski","full_name":"Podlaski, William F.","first_name":"William F."},{"first_name":"Sander W.","full_name":"Keemink, Sander W.","last_name":"Keemink"}],"scopus_import":"1","intvolume":"         1","ec_funded":1,"article_processing_charge":"No","citation":{"ista":"Nardin M, Phillips JW, Podlaski WF, Keemink SW. 2021. Nonlinear computations in spiking neural networks through multiplicative synapses. Peer Community Journal. 1, e68.","chicago":"Nardin, Michele, James W. Phillips, William F. Podlaski, and Sander W. Keemink. “Nonlinear Computations in Spiking Neural Networks through Multiplicative Synapses.” <i>Peer Community Journal</i>. Peer Community In, 2021. <a href=\"https://doi.org/10.24072/pcjournal.69\">https://doi.org/10.24072/pcjournal.69</a>.","apa":"Nardin, M., Phillips, J. W., Podlaski, W. F., &#38; Keemink, S. W. (2021). Nonlinear computations in spiking neural networks through multiplicative synapses. <i>Peer Community Journal</i>. Peer Community In. <a href=\"https://doi.org/10.24072/pcjournal.69\">https://doi.org/10.24072/pcjournal.69</a>","ama":"Nardin M, Phillips JW, Podlaski WF, Keemink SW. Nonlinear computations in spiking neural networks through multiplicative synapses. <i>Peer Community Journal</i>. 2021;1. doi:<a href=\"https://doi.org/10.24072/pcjournal.69\">10.24072/pcjournal.69</a>","ieee":"M. Nardin, J. W. Phillips, W. F. Podlaski, and S. W. Keemink, “Nonlinear computations in spiking neural networks through multiplicative synapses,” <i>Peer Community Journal</i>, vol. 1. Peer Community In, 2021.","short":"M. Nardin, J.W. Phillips, W.F. Podlaski, S.W. Keemink, Peer Community Journal 1 (2021).","mla":"Nardin, Michele, et al. “Nonlinear Computations in Spiking Neural Networks through Multiplicative Synapses.” <i>Peer Community Journal</i>, vol. 1, e68, Peer Community In, 2021, doi:<a href=\"https://doi.org/10.24072/pcjournal.69\">10.24072/pcjournal.69</a>."},"_id":"10635","month":"12","title":"Nonlinear computations in spiking neural networks through multiplicative synapses","article_type":"original","doi":"10.24072/pcjournal.69","ddc":["519"],"arxiv":1,"type":"journal_article","day":"15","publisher":"Peer Community In","status":"public","tmp":{"short":"CC BY (4.0)","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)"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","project":[{"grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"International IST Doctoral Program"}],"date_published":"2021-12-15T00:00:00Z","date_updated":"2025-05-14T11:23:19Z","oa_version":"Published Version","year":"2021"},{"intvolume":"       139","publication":"Proceedings of the 38th International Conference on Machine Learning","author":[{"first_name":"Zahra","full_name":"Babaiee, Zahra","last_name":"Babaiee"},{"first_name":"Ramin","full_name":"Hasani, Ramin","last_name":"Hasani"},{"full_name":"Lechner, Mathias","last_name":"Lechner","first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Daniela","full_name":"Rus, Daniela","last_name":"Rus"},{"full_name":"Grosu, Radu","last_name":"Grosu","first_name":"Radu"}],"file_date_updated":"2022-01-26T07:38:32Z","publication_identifier":{"issn":["2640-3498"]},"oa":1,"file":[{"access_level":"open_access","relation":"main_file","success":1,"content_type":"application/pdf","checksum":"d30eae62561bb517d9f978437d7677db","date_updated":"2022-01-26T07:38:32Z","creator":"mlechner","file_name":"babaiee21a.pdf","file_id":"10681","date_created":"2022-01-26T07:38:32Z","file_size":4246561}],"acknowledgement":"Z.B. is supported by the Doctoral College Resilient Embedded Systems, which is run jointly by the TU Wien’s Faculty of Informatics and the UAS Technikum Wien. R.G. is partially supported by the Horizon 2020 Era-Permed project Persorad, and ECSEL Project grant no. 783163 (iDev40). R.H and D.R were partially supported by Boeing and MIT. M.L. is supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award).","main_file_link":[{"open_access":"1","url":"https://proceedings.mlr.press/v139/babaiee21a"}],"publication_status":"published","language":[{"iso":"eng"}],"date_created":"2022-01-25T15:46:33Z","external_id":{"arxiv":["2106.07091"]},"department":[{"_id":"GradSch"},{"_id":"ToHe"}],"quality_controlled":"1","volume":139,"abstract":[{"lang":"eng","text":"Robustness to variations in lighting conditions is a key objective for any deep vision system. To this end, our paper extends the receptive field of convolutional neural networks with two residual components, ubiquitous in the visual processing system of vertebrates: On-center and off-center pathways, with an excitatory center and inhibitory surround; OOCS for short. The On-center pathway is excited by the presence of a light stimulus in its center, but not in its surround, whereas the Off-center pathway is excited by the absence of a light stimulus in its center, but not in its surround. We design OOCS pathways via a difference of Gaussians, with their variance computed analytically from the size of the receptive fields. OOCS pathways complement each other in their response to light stimuli, ensuring this way a strong edge-detection capability, and as a result an accurate and robust inference under challenging lighting conditions. We provide extensive empirical evidence showing that networks supplied with OOCS pathways gain accuracy and illumination-robustness from the novel edge representation, compared to other baselines."}],"license":"https://creativecommons.org/licenses/by-nc-nd/3.0/","date_updated":"2025-05-19T11:28:08Z","oa_version":"Published Version","year":"2021","has_accepted_license":"1","date_published":"2021-07-01T00:00:00Z","project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems"}],"page":"478-489","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode","short":"CC BY-NC-ND (3.0)","image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)"},"status":"public","day":"01","publisher":"ML Research Press","type":"conference","ddc":["000"],"arxiv":1,"alternative_title":["PMLR"],"month":"07","title":"On-off center-surround receptive fields for accurate and robust image classification","_id":"10668","citation":{"ieee":"Z. Babaiee, R. Hasani, M. Lechner, D. Rus, and R. Grosu, “On-off center-surround receptive fields for accurate and robust image classification,” in <i>Proceedings of the 38th International Conference on Machine Learning</i>, Virtual, 2021, vol. 139, pp. 478–489.","short":"Z. Babaiee, R. Hasani, M. Lechner, D. Rus, R. Grosu, in:, Proceedings of the 38th International Conference on Machine Learning, ML Research Press, 2021, pp. 478–489.","mla":"Babaiee, Zahra, et al. “On-off Center-Surround Receptive Fields for Accurate and Robust Image Classification.” <i>Proceedings of the 38th International Conference on Machine Learning</i>, vol. 139, ML Research Press, 2021, pp. 478–89.","chicago":"Babaiee, Zahra, Ramin Hasani, Mathias Lechner, Daniela Rus, and Radu Grosu. “On-off Center-Surround Receptive Fields for Accurate and Robust Image Classification.” In <i>Proceedings of the 38th International Conference on Machine Learning</i>, 139:478–89. ML Research Press, 2021.","ista":"Babaiee Z, Hasani R, Lechner M, Rus D, Grosu R. 2021. On-off center-surround receptive fields for accurate and robust image classification. Proceedings of the 38th International Conference on Machine Learning. ML: Machine Learning, PMLR, vol. 139, 478–489.","ama":"Babaiee Z, Hasani R, Lechner M, Rus D, Grosu R. On-off center-surround receptive fields for accurate and robust image classification. In: <i>Proceedings of the 38th International Conference on Machine Learning</i>. Vol 139. ML Research Press; 2021:478-489.","apa":"Babaiee, Z., Hasani, R., Lechner, M., Rus, D., &#38; Grosu, R. (2021). On-off center-surround receptive fields for accurate and robust image classification. In <i>Proceedings of the 38th International Conference on Machine Learning</i> (Vol. 139, pp. 478–489). Virtual: ML Research Press."},"conference":{"location":"Virtual","end_date":"2021-07-24","name":"ML: Machine Learning","start_date":"2021-07-18"},"article_processing_charge":"No"},{"abstract":[{"text":"We show that Neural ODEs, an emerging class of timecontinuous neural networks, can be verified by solving a set of global-optimization problems. For this purpose, we introduce Stochastic Lagrangian Reachability (SLR), an\r\nabstraction-based technique for constructing a tight Reachtube (an over-approximation of the set of reachable states\r\nover a given time-horizon), and provide stochastic guarantees in the form of confidence intervals for the Reachtube bounds. SLR inherently avoids the infamous wrapping effect (accumulation of over-approximation errors) by performing local optimization steps to expand safe regions instead of repeatedly forward-propagating them as is done by deterministic reachability methods. To enable fast local optimizations, we introduce a novel forward-mode adjoint sensitivity method to compute gradients without the need for backpropagation. Finally, we establish asymptotic and non-asymptotic convergence rates for SLR.","lang":"eng"}],"quality_controlled":"1","volume":35,"language":[{"iso":"eng"}],"corr_author":"1","date_created":"2022-01-25T15:47:20Z","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"external_id":{"arxiv":["2012.08863"]},"publication_status":"published","main_file_link":[{"url":"https://ojs.aaai.org/index.php/AAAI/article/view/17372","open_access":"1"}],"oa":1,"publication_identifier":{"isbn":["978-1-57735-866-4"],"eissn":["2374-3468"],"issn":["2159-5399"]},"acknowledgement":"The authors would like to thank the reviewers for their insightful comments. RH and RG were partially supported by\r\nHorizon-2020 ECSEL Project grant No. 783163 (iDev40). RH was partially supported by Boeing. ML was supported\r\nin part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). SG was funded by FWF\r\nproject W1255-N23. JC was partially supported by NAWA Polish Returns grant PPN/PPO/2018/1/00029. SS was supported by NSF awards DCL-2040599, CCF-1918225, and CPS-1446832.\r\n","file":[{"relation":"main_file","access_level":"open_access","success":1,"date_updated":"2022-01-26T07:38:08Z","checksum":"468d07041e282a1d46ffdae92f709630","content_type":"application/pdf","file_size":286906,"file_id":"10680","date_created":"2022-01-26T07:38:08Z","file_name":"17372-Article Text-20866-1-2-20210518.pdf","creator":"mlechner"}],"intvolume":"        35","publication":"Proceedings of the AAAI Conference on Artificial Intelligence","author":[{"first_name":"Sophie","full_name":"Grunbacher, Sophie","last_name":"Grunbacher"},{"first_name":"Ramin","last_name":"Hasani","full_name":"Hasani, Ramin"},{"last_name":"Lechner","full_name":"Lechner, Mathias","first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Jacek","full_name":"Cyranka, Jacek","last_name":"Cyranka"},{"full_name":"Smolka, Scott A","last_name":"Smolka","first_name":"Scott A"},{"last_name":"Grosu","full_name":"Grosu, Radu","first_name":"Radu"}],"file_date_updated":"2022-01-26T07:38:08Z","citation":{"apa":"Grunbacher, S., Hasani, R., Lechner, M., Cyranka, J., Smolka, S. A., &#38; Grosu, R. (2021). On the verification of neural ODEs with stochastic guarantees. In <i>Proceedings of the AAAI Conference on Artificial Intelligence</i> (Vol. 35, pp. 11525–11535). Virtual: AAAI Press.","ama":"Grunbacher S, Hasani R, Lechner M, Cyranka J, Smolka SA, Grosu R. On the verification of neural ODEs with stochastic guarantees. In: <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>. Vol 35. AAAI Press; 2021:11525-11535.","ista":"Grunbacher S, Hasani R, Lechner M, Cyranka J, Smolka SA, Grosu R. 2021. On the verification of neural ODEs with stochastic guarantees. Proceedings of the AAAI Conference on Artificial Intelligence. AAAI: Association for the Advancement of Artificial Intelligence, Technical Tracks, vol. 35, 11525–11535.","chicago":"Grunbacher, Sophie, Ramin Hasani, Mathias Lechner, Jacek Cyranka, Scott A Smolka, and Radu Grosu. “On the Verification of Neural ODEs with Stochastic Guarantees.” In <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, 35:11525–35. AAAI Press, 2021.","mla":"Grunbacher, Sophie, et al. “On the Verification of Neural ODEs with Stochastic Guarantees.” <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, vol. 35, no. 13, AAAI Press, 2021, pp. 11525–35.","short":"S. Grunbacher, R. Hasani, M. Lechner, J. Cyranka, S.A. Smolka, R. Grosu, in:, Proceedings of the AAAI Conference on Artificial Intelligence, AAAI Press, 2021, pp. 11525–11535.","ieee":"S. Grunbacher, R. Hasani, M. Lechner, J. Cyranka, S. A. Smolka, and R. Grosu, “On the verification of neural ODEs with stochastic guarantees,” in <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, Virtual, 2021, vol. 35, no. 13, pp. 11525–11535."},"conference":{"end_date":"2021-02-09","location":"Virtual","start_date":"2021-02-02","name":"AAAI: Association for the Advancement of Artificial Intelligence"},"article_processing_charge":"No","month":"05","title":"On the verification of neural ODEs with stochastic guarantees","_id":"10669","alternative_title":["Technical Tracks"],"ddc":["000"],"arxiv":1,"issue":"13","type":"conference","publisher":"AAAI Press","day":"28","status":"public","page":"11525-11535","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2025-04-15T06:25:56Z","oa_version":"Published Version","year":"2021","has_accepted_license":"1","project":[{"call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"date_published":"2021-05-28T00:00:00Z"},{"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","date_updated":"2025-04-15T06:25:56Z","oa_version":"Published Version","year":"2021","project":[{"call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211"}],"date_published":"2021-12-01T00:00:00Z","has_accepted_license":"1","day":"01","type":"conference","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode","short":"CC BY-NC-ND (3.0)","image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)"},"status":"public","alternative_title":[" Advances in Neural Information Processing Systems"],"ddc":["000"],"arxiv":1,"citation":{"apa":"Vorbach, C. J., Hasani, R., Amini, A., Lechner, M., &#38; Rus, D. (2021). Causal navigation by continuous-time neural networks. In <i>35th Conference on Neural Information Processing Systems</i>. Virtual.","ama":"Vorbach CJ, Hasani R, Amini A, Lechner M, Rus D. Causal navigation by continuous-time neural networks. In: <i>35th Conference on Neural Information Processing Systems</i>. ; 2021.","ista":"Vorbach CJ, Hasani R, Amini A, Lechner M, Rus D. 2021. Causal navigation by continuous-time neural networks. 35th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems,  Advances in Neural Information Processing Systems, .","chicago":"Vorbach, Charles J, Ramin Hasani, Alexander Amini, Mathias Lechner, and Daniela Rus. “Causal Navigation by Continuous-Time Neural Networks.” In <i>35th Conference on Neural Information Processing Systems</i>, 2021.","mla":"Vorbach, Charles J., et al. “Causal Navigation by Continuous-Time Neural Networks.” <i>35th Conference on Neural Information Processing Systems</i>, 2021.","short":"C.J. Vorbach, R. Hasani, A. Amini, M. Lechner, D. Rus, in:, 35th Conference on Neural Information Processing Systems, 2021.","ieee":"C. J. Vorbach, R. Hasani, A. Amini, M. Lechner, and D. Rus, “Causal navigation by continuous-time neural networks,” in <i>35th Conference on Neural Information Processing Systems</i>, Virtual, 2021."},"conference":{"location":"Virtual","end_date":"2021-12-10","name":"NeurIPS: Neural Information Processing Systems","start_date":"2021-12-06"},"article_processing_charge":"No","month":"12","title":"Causal navigation by continuous-time neural networks","_id":"10670","publication":"35th Conference on Neural Information Processing Systems","author":[{"last_name":"Vorbach","full_name":"Vorbach, Charles J","first_name":"Charles J"},{"full_name":"Hasani, Ramin","last_name":"Hasani","first_name":"Ramin"},{"last_name":"Amini","full_name":"Amini, Alexander","first_name":"Alexander"},{"last_name":"Lechner","full_name":"Lechner, Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","first_name":"Mathias"},{"first_name":"Daniela","last_name":"Rus","full_name":"Rus, Daniela"}],"file_date_updated":"2022-01-26T07:37:24Z","main_file_link":[{"open_access":"1","url":"https://proceedings.neurips.cc/paper/2021/hash/67ba02d73c54f0b83c05507b7fb7267f-Abstract.html"}],"oa":1,"acknowledgement":"C.V., R.H. A.A. and D.R. are partially supported by Boeing and MIT. A.A. is supported by the National Science Foundation (NSF) Graduate Research Fellowship Program. M.L. is supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). Research was sponsored by the United States Air Force Research Laboratory and the United States Air Force Artificial Intelligence Accelerator and was accomplished under Cooperative Agreement Number FA8750-19-2-1000. The views and conclusions contained in this document are those of the authors\r\nand should not be interpreted as representing the official policies, either expressed or implied, of the United States Air Force or the U.S. Government. The U.S. Government is authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation herein.\r\n","file":[{"success":1,"relation":"main_file","access_level":"open_access","file_size":6841228,"file_id":"10679","date_created":"2022-01-26T07:37:24Z","creator":"mlechner","file_name":"NeurIPS-2021-causal-navigation-by-continuous-time-neural-networks-Paper.pdf","date_updated":"2022-01-26T07:37:24Z","checksum":"be81f0ade174a8c9b2d4fe09590b2021","content_type":"application/pdf"}],"language":[{"iso":"eng"}],"date_created":"2022-01-25T15:47:50Z","external_id":{"arxiv":["2106.08314"]},"department":[{"_id":"GradSch"},{"_id":"ToHe"}],"publication_status":"published","abstract":[{"text":"Imitation learning enables high-fidelity, vision-based learning of policies within rich, photorealistic environments. However, such techniques often rely on traditional discrete-time neural models and face difficulties in generalizing to domain shifts by failing to account for the causal relationships between the agent and the environment. In this paper, we propose a theoretical and experimental framework for learning causal representations using continuous-time neural networks, specifically over their discrete-time counterparts. We evaluate our method in the context of visual-control learning of drones over a series of complex tasks, ranging from short- and long-term navigation, to chasing static and dynamic objects through photorealistic environments. Our results demonstrate that causal continuous-time\r\ndeep models can perform robust navigation tasks, where advanced recurrent models fail. These models learn complex causal control representations directly from raw visual inputs and scale to solve a variety of tasks using imitation learning.","lang":"eng"}],"quality_controlled":"1"},{"corr_author":"1","language":[{"iso":"eng"}],"external_id":{"arxiv":["2006.04439"]},"department":[{"_id":"GradSch"},{"_id":"ToHe"}],"date_created":"2022-01-25T15:48:36Z","publication_status":"published","abstract":[{"text":"We introduce a new class of time-continuous recurrent neural network models. Instead of declaring a learning system’s dynamics by implicit nonlinearities, we construct networks of linear first-order dynamical systems modulated via nonlinear interlinked gates. The resulting models represent dynamical systems with varying (i.e., liquid) time-constants coupled to their hidden state, with outputs being computed by numerical differential equation solvers. These neural networks exhibit stable and bounded behavior, yield superior expressivity within the family of neural ordinary differential equations, and give rise to improved performance on time-series prediction tasks. To demonstrate these properties, we first take a theoretical approach to find bounds over their dynamics, and compute their expressive power by the trajectory length measure in a latent trajectory space. We then conduct a series of time-series prediction experiments to manifest the approximation capability of Liquid Time-Constant Networks (LTCs) compared to classical and modern RNNs.","lang":"eng"}],"quality_controlled":"1","volume":35,"intvolume":"        35","author":[{"full_name":"Hasani, Ramin","last_name":"Hasani","first_name":"Ramin"},{"id":"3DC22916-F248-11E8-B48F-1D18A9856A87","first_name":"Mathias","full_name":"Lechner, Mathias","last_name":"Lechner"},{"first_name":"Alexander","last_name":"Amini","full_name":"Amini, Alexander"},{"first_name":"Daniela","full_name":"Rus, Daniela","last_name":"Rus"},{"full_name":"Grosu, Radu","last_name":"Grosu","first_name":"Radu"}],"publication":"Proceedings of the AAAI Conference on Artificial Intelligence","file_date_updated":"2022-01-26T07:36:03Z","main_file_link":[{"open_access":"1","url":"https://ojs.aaai.org/index.php/AAAI/article/view/16936"}],"oa":1,"publication_identifier":{"isbn":["978-1-57735-866-4"],"issn":["2159-5399"],"eissn":["2374-3468"]},"file":[{"access_level":"open_access","relation":"main_file","success":1,"content_type":"application/pdf","checksum":"0f06995fba06dbcfa7ed965fc66027ff","date_updated":"2022-01-26T07:36:03Z","file_name":"16936-Article Text-20430-1-2-20210518 (1).pdf","creator":"mlechner","file_id":"10678","date_created":"2022-01-26T07:36:03Z","file_size":4302669}],"acknowledgement":"R.H. and D.R. are partially supported by Boeing. R.H. and R.G. were partially supported by the Horizon-2020 ECSEL\r\nProject grant No. 783163 (iDev40). M.L. was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). A.A. is supported by the National Science Foundation (NSF) Graduate Research Fellowship Program. This research work is partially drawn from the PhD dissertation of R.H.","alternative_title":["Technical Tracks"],"arxiv":1,"ddc":["000"],"citation":{"chicago":"Hasani, Ramin, Mathias Lechner, Alexander Amini, Daniela Rus, and Radu Grosu. “Liquid Time-Constant Networks.” In <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, 35:7657–66. AAAI Press, 2021.","ista":"Hasani R, Lechner M, Amini A, Rus D, Grosu R. 2021. Liquid time-constant networks. Proceedings of the AAAI Conference on Artificial Intelligence. AAAI: Association for the Advancement of Artificial Intelligence, Technical Tracks, vol. 35, 7657–7666.","ama":"Hasani R, Lechner M, Amini A, Rus D, Grosu R. Liquid time-constant networks. In: <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>. Vol 35. AAAI Press; 2021:7657-7666.","apa":"Hasani, R., Lechner, M., Amini, A., Rus, D., &#38; Grosu, R. (2021). Liquid time-constant networks. In <i>Proceedings of the AAAI Conference on Artificial Intelligence</i> (Vol. 35, pp. 7657–7666). Virtual: AAAI Press.","ieee":"R. Hasani, M. Lechner, A. Amini, D. Rus, and R. Grosu, “Liquid time-constant networks,” in <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, Virtual, 2021, vol. 35, no. 9, pp. 7657–7666.","mla":"Hasani, Ramin, et al. “Liquid Time-Constant Networks.” <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, vol. 35, no. 9, AAAI Press, 2021, pp. 7657–66.","short":"R. Hasani, M. Lechner, A. Amini, D. Rus, R. Grosu, in:, Proceedings of the AAAI Conference on Artificial Intelligence, AAAI Press, 2021, pp. 7657–7666."},"article_processing_charge":"No","conference":{"location":"Virtual","end_date":"2021-02-09","name":"AAAI: Association for the Advancement of Artificial Intelligence","start_date":"2021-02-02"},"title":"Liquid time-constant networks","month":"05","_id":"10671","page":"7657-7666","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","year":"2021","date_updated":"2025-04-15T06:25:56Z","date_published":"2021-05-28T00:00:00Z","project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems","call_identifier":"FWF"}],"has_accepted_license":"1","publisher":"AAAI Press","type":"conference","day":"28","issue":"9","status":"public"},{"conference":{"end_date":"2021-01-13","location":"Virtual","start_date":"2021-01-10","name":"SODA: Symposium on Discrete Algorithms"},"article_processing_charge":"No","citation":{"ieee":"G. Avni, I. R. Jecker, and D. Zikelic, “Infinite-duration all-pay bidding games,” in <i>Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms</i>, Virtual, 2021, pp. 617–636.","mla":"Avni, Guy, et al. “Infinite-Duration All-Pay Bidding Games.” <i>Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms</i>, edited by Dániel Marx, Society for Industrial and Applied Mathematics, 2021, pp. 617–36, doi:<a href=\"https://doi.org/10.1137/1.9781611976465.38\">10.1137/1.9781611976465.38</a>.","short":"G. Avni, I.R. Jecker, D. Zikelic, in:, D. Marx (Ed.), Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2021, pp. 617–636.","ista":"Avni G, Jecker IR, Zikelic D. 2021. Infinite-duration all-pay bidding games. Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 617–636.","chicago":"Avni, Guy, Ismael R Jecker, and Dorde Zikelic. “Infinite-Duration All-Pay Bidding Games.” In <i>Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms</i>, edited by Dániel Marx, 617–36. Society for Industrial and Applied Mathematics, 2021. <a href=\"https://doi.org/10.1137/1.9781611976465.38\">https://doi.org/10.1137/1.9781611976465.38</a>.","apa":"Avni, G., Jecker, I. R., &#38; Zikelic, D. (2021). Infinite-duration all-pay bidding games. In D. Marx (Ed.), <i>Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms</i> (pp. 617–636). Virtual: Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/1.9781611976465.38\">https://doi.org/10.1137/1.9781611976465.38</a>","ama":"Avni G, Jecker IR, Zikelic D. Infinite-duration all-pay bidding games. In: Marx D, ed. <i>Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms</i>. Society for Industrial and Applied Mathematics; 2021:617-636. doi:<a href=\"https://doi.org/10.1137/1.9781611976465.38\">10.1137/1.9781611976465.38</a>"},"_id":"10694","month":"01","title":"Infinite-duration all-pay bidding games","doi":"10.1137/1.9781611976465.38","arxiv":1,"day":"01","publisher":"Society for Industrial and Applied Mathematics","type":"conference","status":"public","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","page":"617-636","project":[{"grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems"},{"call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"},{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","call_identifier":"H2020","name":"International IST Doctoral Program"}],"date_published":"2021-01-01T00:00:00Z","date_updated":"2025-04-15T06:26:15Z","oa_version":"Preprint","year":"2021","abstract":[{"lang":"eng","text":"In a two-player zero-sum graph game the players move a token throughout a graph to produce an infinite path, which determines the winner or payoff of the game. Traditionally, the players alternate turns in moving the token. In bidding games, however, the players have budgets, and in each turn, we hold an “auction” (bidding) to determine which player moves the token: both players simultaneously submit bids and the higher bidder moves the token. The bidding mechanisms differ in their payment schemes. Bidding games were largely studied with variants of first-price bidding in which only the higher bidder pays his bid. We focus on all-pay bidding, where both players pay their bids. Finite-duration all-pay bidding games were studied and shown to be technically more challenging than their first-price counterparts. We study for the first time, infinite-duration all-pay bidding games. Our most interesting results are for mean-payoff objectives: we portray a complete picture for games played on strongly-connected graphs. We study both pure (deterministic) and mixed (probabilistic) strategies and completely characterize the optimal and almost-sure (with probability 1) payoffs the players can respectively guarantee. We show that mean-payoff games under all-pay bidding exhibit the intriguing mathematical properties of their first-price counterparts; namely, an equivalence with random-turn games in which in each turn, the player who moves is selected according to a (biased) coin toss. The equivalences for all-pay bidding are more intricate and unexpected than for first-price bidding."}],"editor":[{"full_name":"Marx, Dániel","last_name":"Marx","first_name":"Dániel"}],"quality_controlled":"1","date_created":"2022-01-27T12:11:23Z","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"external_id":{"arxiv":["2005.06636"]},"corr_author":"1","language":[{"iso":"eng"}],"publication_status":"published","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2005.06636"}],"acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award), ERC CoG 863818 (FoRM-SMArt), and by the European Union's Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385.","publication_identifier":{"isbn":["978-1-61197-646-5"]},"oa":1,"author":[{"orcid":"0000-0001-5588-8287","first_name":"Guy","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","last_name":"Avni","full_name":"Avni, Guy"},{"id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425","first_name":"Ismael R","full_name":"Jecker, Ismael R","last_name":"Jecker"},{"first_name":"Dorde","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","full_name":"Zikelic, Dorde","last_name":"Zikelic","orcid":"0000-0002-4681-1699"}],"publication":"Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms","scopus_import":"1","ec_funded":1},{"acknowledgement":"We thank Federico Stella for invaluable suggestions and discussions. We thank Yosman BapatDhar and Andrea Cumpelik for comments, help and suggestions on the exposure of the text. We thank Predrag Živadinović and Juliana Couras for comments on the text and the figures. This work was supported by the EU-FP7 MC-ITN IN-SENS (grant 607616).","status":"public","oa":1,"day":"02","publisher":"Cold Spring Harbor Laboratory","main_file_link":[{"url":"https://www.biorxiv.org/content/10.1101/2021.09.30.462269","open_access":"1"}],"type":"preprint","date_published":"2021-10-02T00:00:00Z","project":[{"call_identifier":"FP7","name":"inter-and intracellular signalling in schizophrenia","_id":"257BBB4C-B435-11E9-9278-68D0E5697425","grant_number":"607616"}],"date_updated":"2025-04-15T06:48:21Z","year":"2021","oa_version":"Preprint","author":[{"full_name":"Nardin, Michele","last_name":"Nardin","first_name":"Michele","id":"30BD0376-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8849-6570"},{"first_name":"Karola","id":"2DAA49AA-F248-11E8-B48F-1D18A9856A87","full_name":"Käfer, Karola","last_name":"Käfer"},{"id":"3FA14672-F248-11E8-B48F-1D18A9856A87","first_name":"Jozsef L","last_name":"Csicsvari","full_name":"Csicsvari, Jozsef L","orcid":"0000-0002-5193-4036"}],"publication":"bioRxiv","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","ec_funded":1,"_id":"10080","month":"10","title":"The generalized spatial representation in the prefrontal cortex is inherited from the hippocampus","abstract":[{"text":"Hippocampal and neocortical neural activity is modulated by the position of the individual in space. While hippocampal neurons provide the basis for a spatial map, prefrontal cortical neurons generalize over environmental features. Whether these generalized representations result from a bidirectional interaction with, or are mainly derived from hippocampal spatial representations is not known. By examining simultaneously recorded hippocampal and medial prefrontal neurons, we observed that prefrontal spatial representations show a delayed coherence with hippocampal ones. We also identified subpopulations of cells in the hippocampus and medial prefrontal cortex that formed functional cross-area couplings; these resembled the optimal connections predicted by a probabilistic model of spatial information transfer and generalization. Moreover, cross-area couplings were strongest and had the shortest delay preceding spatial decision-making. Our results suggest that generalized spatial coding in the medial prefrontal cortex is inherited from spatial representations in the hippocampus, and that the routing of information can change dynamically with behavioral demands.","lang":"eng"}],"article_processing_charge":"No","citation":{"short":"M. Nardin, K. Käfer, J.L. Csicsvari, BioRxiv (n.d.).","mla":"Nardin, Michele, et al. “The Generalized Spatial Representation in the Prefrontal Cortex Is Inherited from the Hippocampus.” <i>BioRxiv</i>, Cold Spring Harbor Laboratory, doi:<a href=\"https://doi.org/10.1101/2021.09.30.462269\">10.1101/2021.09.30.462269</a>.","ieee":"M. Nardin, K. Käfer, and J. L. Csicsvari, “The generalized spatial representation in the prefrontal cortex is inherited from the hippocampus,” <i>bioRxiv</i>. Cold Spring Harbor Laboratory.","apa":"Nardin, M., Käfer, K., &#38; Csicsvari, J. L. (n.d.). The generalized spatial representation in the prefrontal cortex is inherited from the hippocampus. <i>bioRxiv</i>. Cold Spring Harbor Laboratory. <a href=\"https://doi.org/10.1101/2021.09.30.462269\">https://doi.org/10.1101/2021.09.30.462269</a>","ama":"Nardin M, Käfer K, Csicsvari JL. The generalized spatial representation in the prefrontal cortex is inherited from the hippocampus. <i>bioRxiv</i>. doi:<a href=\"https://doi.org/10.1101/2021.09.30.462269\">10.1101/2021.09.30.462269</a>","ista":"Nardin M, Käfer K, Csicsvari JL. The generalized spatial representation in the prefrontal cortex is inherited from the hippocampus. bioRxiv, <a href=\"https://doi.org/10.1101/2021.09.30.462269\">10.1101/2021.09.30.462269</a>.","chicago":"Nardin, Michele, Karola Käfer, and Jozsef L Csicsvari. “The Generalized Spatial Representation in the Prefrontal Cortex Is Inherited from the Hippocampus.” <i>BioRxiv</i>. Cold Spring Harbor Laboratory, n.d. <a href=\"https://doi.org/10.1101/2021.09.30.462269\">https://doi.org/10.1101/2021.09.30.462269</a>."},"publication_status":"submitted","date_created":"2021-10-04T06:28:32Z","department":[{"_id":"GradSch"},{"_id":"JoCs"}],"doi":"10.1101/2021.09.30.462269","language":[{"iso":"eng"}]},{"quality_controlled":"1","volume":111,"article_number":"20","abstract":[{"text":"We show that the energy gap for the BCS gap equation is\r\nΞ=μ(8e−2+o(1))exp(π2μ−−√a)\r\nin the low density limit μ→0. Together with the similar result for the critical temperature by Hainzl and Seiringer (Lett Math Phys 84: 99–107, 2008), this shows that, in the low density limit, the ratio of the energy gap and critical temperature is a universal constant independent of the interaction potential V. The results hold for a class of potentials with negative scattering length a and no bound states.","lang":"eng"}],"publication_status":"published","language":[{"iso":"eng"}],"date_created":"2021-02-15T09:27:14Z","external_id":{"isi":["000617531900001"]},"department":[{"_id":"GradSch"}],"publication_identifier":{"eissn":["1573-0530"],"issn":["0377-9017"]},"oa":1,"acknowledgement":"Most of this work was done as part of the author’s master’s thesis. The author would like to thank Jan Philip Solovej for his supervision of this process.\r\nOpen Access funding provided by Institute of Science and Technology (IST Austria)","file":[{"success":1,"relation":"main_file","access_level":"open_access","file_id":"9122","date_created":"2021-02-15T09:31:07Z","file_name":"2021_LettersMathPhysics_Lauritsen.pdf","creator":"dernst","file_size":329332,"content_type":"application/pdf","checksum":"eaf1b3ff5026f120f0929a5c417dc842","date_updated":"2021-02-15T09:31:07Z"}],"isi":1,"intvolume":"       111","author":[{"id":"e1a2682f-dc8d-11ea-abe3-81da9ac728f1","first_name":"Asbjørn Bækgaard","last_name":"Lauritsen","full_name":"Lauritsen, Asbjørn Bækgaard","orcid":"0000-0003-4476-2288"}],"file_date_updated":"2021-02-15T09:31:07Z","publication":"Letters in Mathematical Physics","keyword":["Mathematical Physics","Statistical and Nonlinear Physics"],"scopus_import":"1","month":"02","title":"The BCS energy gap at low density","_id":"9121","citation":{"ista":"Lauritsen AB. 2021. The BCS energy gap at low density. Letters in Mathematical Physics. 111, 20.","chicago":"Lauritsen, Asbjørn Bækgaard. “The BCS Energy Gap at Low Density.” <i>Letters in Mathematical Physics</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/s11005-021-01358-5\">https://doi.org/10.1007/s11005-021-01358-5</a>.","apa":"Lauritsen, A. B. (2021). The BCS energy gap at low density. <i>Letters in Mathematical Physics</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s11005-021-01358-5\">https://doi.org/10.1007/s11005-021-01358-5</a>","ama":"Lauritsen AB. The BCS energy gap at low density. <i>Letters in Mathematical Physics</i>. 2021;111. doi:<a href=\"https://doi.org/10.1007/s11005-021-01358-5\">10.1007/s11005-021-01358-5</a>","ieee":"A. B. Lauritsen, “The BCS energy gap at low density,” <i>Letters in Mathematical Physics</i>, vol. 111. Springer Nature, 2021.","short":"A.B. Lauritsen, Letters in Mathematical Physics 111 (2021).","mla":"Lauritsen, Asbjørn Bækgaard. “The BCS Energy Gap at Low Density.” <i>Letters in Mathematical Physics</i>, vol. 111, 20, Springer Nature, 2021, doi:<a href=\"https://doi.org/10.1007/s11005-021-01358-5\">10.1007/s11005-021-01358-5</a>."},"article_processing_charge":"Yes (via OA deal)","ddc":["510"],"article_type":"original","doi":"10.1007/s11005-021-01358-5","tmp":{"short":"CC BY (4.0)","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)"},"status":"public","day":"12","publisher":"Springer Nature","type":"journal_article","date_updated":"2025-04-15T06:53:09Z","year":"2021","oa_version":"Published Version","date_published":"2021-02-12T00:00:00Z","project":[{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}],"has_accepted_license":"1","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1"},{"has_accepted_license":"1","date_published":"2021-02-26T00:00:00Z","oa_version":"Published Version","year":"2021","date_updated":"2025-04-15T08:20:40Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2021-02-24T17:45:13Z","author":[{"orcid":"0000-0001-6395-386X","last_name":"Surendranadh","full_name":"Surendranadh, Parvathy","first_name":"Parvathy","id":"455235B8-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0003-1771-714X","id":"2CFCFF98-F248-11E8-B48F-1D18A9856A87","first_name":"Louise S","last_name":"Arathoon","full_name":"Arathoon, Louise S"},{"orcid":"0000-0002-7354-8574","last_name":"Baskett","full_name":"Baskett, Carina","id":"3B4A7CE2-F248-11E8-B48F-1D18A9856A87","first_name":"Carina"},{"orcid":"0000-0002-4014-8478","first_name":"David","id":"419049E2-F248-11E8-B48F-1D18A9856A87","full_name":"Field, David","last_name":"Field"},{"last_name":"Pickup","full_name":"Pickup, Melinda","id":"2C78037E-F248-11E8-B48F-1D18A9856A87","first_name":"Melinda","orcid":"0000-0001-6118-0541"},{"orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H","last_name":"Barton","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H"}],"file":[{"success":1,"relation":"main_file","access_level":"open_access","date_created":"2021-02-24T17:45:13Z","file_id":"9193","file_name":"Data_Code.zip","creator":"larathoo","file_size":5934452,"content_type":"application/x-zip-compressed","checksum":"f85537815809a8a4b7da9d01163f88c0","date_updated":"2021-02-24T17:45:13Z"}],"status":"public","oa":1,"tmp":{"short":"CC BY (4.0)","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)"},"day":"26","type":"research_data","publisher":"Institute of Science and Technology Austria","ddc":["576"],"department":[{"_id":"GradSch"},{"_id":"NiBa"}],"contributor":[{"last_name":"Surendranadh","contributor_type":"project_member","id":"455235B8-F248-11E8-B48F-1D18A9856A87","first_name":"Parvathy"},{"first_name":"Louise S","id":"2CFCFF98-F248-11E8-B48F-1D18A9856A87","last_name":"Arathoon","contributor_type":"project_member"},{"last_name":"Baskett","contributor_type":"project_member","first_name":"Carina","id":"3B4A7CE2-F248-11E8-B48F-1D18A9856A87"},{"id":"419049E2-F248-11E8-B48F-1D18A9856A87","first_name":"David","last_name":"Field","contributor_type":"project_member","orcid":"0000-0002-4014-8478"},{"contributor_type":"project_member","last_name":"Pickup","id":"2C78037E-F248-11E8-B48F-1D18A9856A87","first_name":"Melinda","orcid":"0000-0001-6118-0541"},{"first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","contributor_type":"project_leader","last_name":"Barton","orcid":"0000-0002-8548-5240"}],"date_created":"2021-02-24T17:49:21Z","doi":"10.15479/AT:ISTA:9192","_id":"9192","title":"Effects of fine-scale population structure on the distribution of heterozygosity in a long-term study of Antirrhinum majus","month":"02","article_processing_charge":"No","abstract":[{"text":"Here are the research data underlying the publication \" Effects of fine-scale population structure on inbreeding in a long-term study of snapdragons (Antirrhinum majus).\" Further information are summed up in the README document.","lang":"eng"}],"citation":{"short":"P. Surendranadh, L.S. Arathoon, C. Baskett, D. Field, M. Pickup, N.H. Barton, (2021).","mla":"Surendranadh, Parvathy, et al. <i>Effects of Fine-Scale Population Structure on the Distribution of Heterozygosity in a Long-Term Study of Antirrhinum Majus</i>. Institute of Science and Technology Austria, 2021, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:9192\">10.15479/AT:ISTA:9192</a>.","ieee":"P. Surendranadh, L. S. Arathoon, C. Baskett, D. Field, M. Pickup, and N. H. Barton, “Effects of fine-scale population structure on the distribution of heterozygosity in a long-term study of Antirrhinum majus.” Institute of Science and Technology Austria, 2021.","ama":"Surendranadh P, Arathoon LS, Baskett C, Field D, Pickup M, Barton NH. Effects of fine-scale population structure on the distribution of heterozygosity in a long-term study of Antirrhinum majus. 2021. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:9192\">10.15479/AT:ISTA:9192</a>","apa":"Surendranadh, P., Arathoon, L. S., Baskett, C., Field, D., Pickup, M., &#38; Barton, N. H. (2021). Effects of fine-scale population structure on the distribution of heterozygosity in a long-term study of Antirrhinum majus. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:9192\">https://doi.org/10.15479/AT:ISTA:9192</a>","chicago":"Surendranadh, Parvathy, Louise S Arathoon, Carina Baskett, David Field, Melinda Pickup, and Nicholas H Barton. “Effects of Fine-Scale Population Structure on the Distribution of Heterozygosity in a Long-Term Study of Antirrhinum Majus.” Institute of Science and Technology Austria, 2021. <a href=\"https://doi.org/10.15479/AT:ISTA:9192\">https://doi.org/10.15479/AT:ISTA:9192</a>.","ista":"Surendranadh P, Arathoon LS, Baskett C, Field D, Pickup M, Barton NH. 2021. Effects of fine-scale population structure on the distribution of heterozygosity in a long-term study of Antirrhinum majus, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:9192\">10.15479/AT:ISTA:9192</a>."},"related_material":{"record":[{"id":"8254","status":"public","relation":"earlier_version"},{"status":"public","relation":"later_version","id":"11321"},{"id":"11411","relation":"used_in_publication","status":"public"}]}},{"_id":"9323","month":"04","title":"Research data for \"A singlet-triplet hole spin qubit planar Ge\"","abstract":[{"text":"This .zip File contains the data for figures presented in the main text and supplementary material of \"A singlet triplet hole spin qubit in planar Ge\" by D. Jirovec, et. al. The measurements were done using Labber Software and the data is stored in the hdf5 file format. The files can be opened using either the Labber Log Browser (https://labber.org/overview/) or Labber Python API (http://labber.org/online-doc/api/LogFile.html). A single file is acquired with QCodes and features the corresponding data type. XRD data are in .dat format and a code to open the data is provided. The code for simulations is as well provided in Python.","lang":"eng"}],"license":"https://creativecommons.org/publicdomain/zero/1.0/","article_processing_charge":"No","related_material":{"record":[{"id":"8909","status":"public","relation":"used_in_publication"}]},"citation":{"chicago":"Jirovec, Daniel. “Research Data for ‘A Singlet-Triplet Hole Spin Qubit Planar Ge.’” Institute of Science and Technology Austria, 2021. <a href=\"https://doi.org/10.15479/AT:ISTA:9323\">https://doi.org/10.15479/AT:ISTA:9323</a>.","ista":"Jirovec D. 2021. Research data for ‘A singlet-triplet hole spin qubit planar Ge’, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:9323\">10.15479/AT:ISTA:9323</a>.","ama":"Jirovec D. Research data for “A singlet-triplet hole spin qubit planar Ge.” 2021. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:9323\">10.15479/AT:ISTA:9323</a>","apa":"Jirovec, D. (2021). Research data for “A singlet-triplet hole spin qubit planar Ge.” Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:9323\">https://doi.org/10.15479/AT:ISTA:9323</a>","ieee":"D. Jirovec, “Research data for ‘A singlet-triplet hole spin qubit planar Ge.’” Institute of Science and Technology Austria, 2021.","mla":"Jirovec, Daniel. <i>Research Data for “A Singlet-Triplet Hole Spin Qubit Planar Ge.”</i> Institute of Science and Technology Austria, 2021, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:9323\">10.15479/AT:ISTA:9323</a>.","short":"D. Jirovec, (2021)."},"ddc":["530"],"contributor":[{"first_name":"Daniel","id":"4C473F58-F248-11E8-B48F-1D18A9856A87","last_name":"Jirovec","contributor_type":"project_member"}],"date_created":"2021-04-14T09:50:22Z","department":[{"_id":"GradSch"},{"_id":"GeKa"}],"doi":"10.15479/AT:ISTA:9323","status":"public","file":[{"checksum":"c569d2a2ce1694445cdbca19cf8ae023","content_type":"application/x-zip-compressed","date_updated":"2021-04-14T09:48:47Z","file_name":"DataRepositorySTqubit.zip","creator":"djirovec","date_created":"2021-04-14T09:48:47Z","file_id":"9324","file_size":221832287,"access_level":"open_access","relation":"main_file","success":1},{"success":1,"relation":"main_file","access_level":"open_access","file_id":"9325","date_created":"2021-04-14T09:49:30Z","creator":"djirovec","file_name":"ReadMe","file_size":4323,"checksum":"845bdf87430718ad6aff47eda7b5fc92","content_type":"application/octet-stream","date_updated":"2021-04-14T09:49:30Z"}],"tmp":{"legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","short":"CC0 (1.0)","image":"/images/cc_0.png","name":"Creative Commons Public Domain Dedication (CC0 1.0)"},"oa":1,"type":"research_data","day":"14","publisher":"Institute of Science and Technology Austria","has_accepted_license":"1","date_published":"2021-04-14T00:00:00Z","date_updated":"2025-06-12T06:57:18Z","oa_version":"Published Version","year":"2021","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2021-04-14T09:49:30Z","author":[{"first_name":"Daniel","id":"4C473F58-F248-11E8-B48F-1D18A9856A87","last_name":"Jirovec","full_name":"Jirovec, Daniel","orcid":"0000-0002-7197-4801"}]},{"oa":1,"publication_identifier":{"issn":["0022-5193"]},"pmid":1,"acknowledgement":"This work was supported by the Russian Science Foundation grant N 16-14-10173.","main_file_link":[{"url":"https://www.biorxiv.org/content/10.1101/477489v1","open_access":"1"}],"isi":1,"intvolume":"       524","author":[{"full_name":"Khudiakova, Kseniia","last_name":"Khudiakova","id":"4E6DC800-AE37-11E9-AC72-31CAE5697425","first_name":"Kseniia","orcid":"0000-0002-6246-1465"},{"first_name":"Tatiana Yu.","full_name":"Neretina, Tatiana Yu.","last_name":"Neretina"},{"first_name":"Alexey S.","last_name":"Kondrashov","full_name":"Kondrashov, Alexey S."}],"keyword":["General Biochemistry","Genetics and Molecular Biology","Modelling and Simulation","Statistics and Probability","General Immunology and Microbiology","Applied Mathematics","General Agricultural and Biological Sciences","General Medicine"],"scopus_import":"1","publication":"Journal of Theoretical Biology","quality_controlled":"1","volume":524,"article_number":"110729","abstract":[{"lang":"eng","text":"We report the complete analysis of a deterministic model of deleterious mutations and negative selection against them at two haploid loci without recombination. As long as mutation is a weaker force than selection, mutant alleles remain rare at the only stable equilibrium, and otherwise, a variety of dynamics are possible. If the mutation-free genotype is absent, generally the only stable equilibrium is the one that corresponds to fixation of the mutant allele at the locus where it is less deleterious. This result suggests that fixation of a deleterious allele that follows a click of the Muller’s ratchet is governed by natural selection, instead of random drift."}],"publication_status":"published","language":[{"iso":"eng"}],"date_created":"2021-05-12T05:58:42Z","department":[{"_id":"GradSch"}],"external_id":{"isi":["000659161500002"],"pmid":["33901507"]},"status":"public","day":"24","publisher":"Elsevier ","type":"journal_article","date_updated":"2025-06-12T06:40:55Z","oa_version":"Preprint","year":"2021","date_published":"2021-04-24T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"04","title":"Two linked loci under mutation-selection balance and Muller’s ratchet","_id":"9387","citation":{"mla":"Khudiakova, Kseniia, et al. “Two Linked Loci under Mutation-Selection Balance and Muller’s Ratchet.” <i>Journal of Theoretical Biology</i>, vol. 524, 110729, Elsevier , 2021, doi:<a href=\"https://doi.org/10.1016/j.jtbi.2021.110729\">10.1016/j.jtbi.2021.110729</a>.","short":"K. Khudiakova, T.Y. Neretina, A.S. Kondrashov, Journal of Theoretical Biology 524 (2021).","ieee":"K. Khudiakova, T. Y. Neretina, and A. S. Kondrashov, “Two linked loci under mutation-selection balance and Muller’s ratchet,” <i>Journal of Theoretical Biology</i>, vol. 524. Elsevier , 2021.","ama":"Khudiakova K, Neretina TY, Kondrashov AS. Two linked loci under mutation-selection balance and Muller’s ratchet. <i>Journal of Theoretical Biology</i>. 2021;524. doi:<a href=\"https://doi.org/10.1016/j.jtbi.2021.110729\">10.1016/j.jtbi.2021.110729</a>","apa":"Khudiakova, K., Neretina, T. Y., &#38; Kondrashov, A. S. (2021). Two linked loci under mutation-selection balance and Muller’s ratchet. <i>Journal of Theoretical Biology</i>. Elsevier . <a href=\"https://doi.org/10.1016/j.jtbi.2021.110729\">https://doi.org/10.1016/j.jtbi.2021.110729</a>","chicago":"Khudiakova, Kseniia, Tatiana Yu. Neretina, and Alexey S. Kondrashov. “Two Linked Loci under Mutation-Selection Balance and Muller’s Ratchet.” <i>Journal of Theoretical Biology</i>. Elsevier , 2021. <a href=\"https://doi.org/10.1016/j.jtbi.2021.110729\">https://doi.org/10.1016/j.jtbi.2021.110729</a>.","ista":"Khudiakova K, Neretina TY, Kondrashov AS. 2021. Two linked loci under mutation-selection balance and Muller’s ratchet. Journal of Theoretical Biology. 524, 110729."},"article_processing_charge":"No","article_type":"original","doi":"10.1016/j.jtbi.2021.110729"},{"article_processing_charge":"No","abstract":[{"lang":"eng","text":"This .zip File contains the transport data for  \"Non-topological zero bias peaks in full-shell nanowires induced by flux tunable Andreev states\" by M. Valentini, et. al.  \r\nThe measurements were done using Labber Software and the data is stored in the hdf5 file format.\r\nInstructions of how to read the data are in \"Notebook_Valentini.pdf\"."}],"citation":{"chicago":"Valentini, Marco. “Research Data for ‘Non-Topological Zero Bias Peaks in Full-Shell Nanowires Induced by Flux Tunable Andreev States.’” Institute of Science and Technology Austria, 2021. <a href=\"https://doi.org/10.15479/AT:ISTA:9389\">https://doi.org/10.15479/AT:ISTA:9389</a>.","ista":"Valentini M. 2021. Research data for ‘Non-topological zero bias peaks in full-shell nanowires induced by flux tunable Andreev states’, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:9389\">10.15479/AT:ISTA:9389</a>.","ama":"Valentini M. Research data for “Non-topological zero bias peaks in full-shell nanowires induced by flux tunable Andreev states.” 2021. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:9389\">10.15479/AT:ISTA:9389</a>","apa":"Valentini, M. (2021). Research data for “Non-topological zero bias peaks in full-shell nanowires induced by flux tunable Andreev states.” Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:9389\">https://doi.org/10.15479/AT:ISTA:9389</a>","ieee":"M. Valentini, “Research data for ‘Non-topological zero bias peaks in full-shell nanowires induced by flux tunable Andreev states.’” Institute of Science and Technology Austria, 2021.","short":"M. Valentini, (2021).","mla":"Valentini, Marco. <i>Research Data for “Non-Topological Zero Bias Peaks in Full-Shell Nanowires Induced by Flux Tunable Andreev States.”</i> Institute of Science and Technology Austria, 2021, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:9389\">10.15479/AT:ISTA:9389</a>."},"acknowledged_ssus":[{"_id":"NanoFab"}],"related_material":{"record":[{"id":"8910","relation":"used_in_publication","status":"public"}]},"_id":"9389","title":"Research data for \"Non-topological zero bias peaks in full-shell nanowires induced by flux tunable Andreev states\"","department":[{"_id":"GradSch"},{"_id":"GeKa"}],"date_created":"2021-05-14T12:07:53Z","contributor":[{"last_name":"Valentini","contributor_type":"contact_person","first_name":"Marco","id":"C0BB2FAC-D767-11E9-B658-BC13E6697425"}],"doi":"10.15479/AT:ISTA:9389","ddc":["530"],"type":"research_data","publisher":"Institute of Science and Technology Austria","status":"public","file":[{"access_level":"open_access","relation":"main_file","date_updated":"2021-05-14T11:42:23Z","checksum":"80a905c4eef24dab6fb247e81a3d67f5","content_type":"application/pdf","file_size":10572981,"creator":"mvalenti","file_name":"Notebook_Valentini.pdf","date_created":"2021-05-14T11:42:23Z","file_id":"9390"},{"access_level":"open_access","relation":"main_file","file_name":"Experimental_data.zip","creator":"mvalenti","date_created":"2021-05-14T11:56:48Z","file_id":"9391","file_size":99076111,"content_type":"application/x-zip-compressed","checksum":"1e61a7e63949448a8db0091cdac23570","date_updated":"2021-05-14T11:56:48Z"}],"oa":1,"tmp":{"legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","short":"CC0 (1.0)","image":"/images/cc_0.png","name":"Creative Commons Public Domain Dedication (CC0 1.0)"},"author":[{"first_name":"Marco","id":"C0BB2FAC-D767-11E9-B658-BC13E6697425","last_name":"Valentini","full_name":"Valentini, Marco"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2021-05-14T11:56:48Z","date_published":"2021-01-01T00:00:00Z","has_accepted_license":"1","oa_version":"Published Version","year":"2021","date_updated":"2025-06-12T06:32:43Z"},{"volume":29,"_id":"9403","month":"03","quality_controlled":"1","title":"The evolution of strategic ignorance in strategic interaction","article_processing_charge":"No","abstract":[{"lang":"eng","text":"Optimal decision making requires individuals to know their available options and to anticipate correctly what consequences these options have. In many social interactions, however, we refrain from gathering all relevant information, even if this information would help us make better decisions and is costless to obtain. This chapter examines several examples of “deliberate ignorance.” Two simple models are proposed to illustrate how ignorance can evolve among self-interested and payoff - maximizing individuals, and open problems are highlighted that lie ahead for future research to explore."}],"editor":[{"last_name":"Hertwig","full_name":"Hertwig, Ralph","first_name":"Ralph"},{"first_name":"Christoph","last_name":"Engel","full_name":"Engel, Christoph"}],"citation":{"short":"L. Schmid, C. Hilbe, in:, R. Hertwig, C. Engel (Eds.), Deliberate Ignorance: Choosing Not To Know, MIT Press, 2021, pp. 139–152.","mla":"Schmid, Laura, and Christian Hilbe. “The Evolution of Strategic Ignorance in Strategic Interaction.” <i>Deliberate Ignorance: Choosing Not To Know</i>, edited by Ralph Hertwig and Christoph Engel, vol. 29, MIT Press, 2021, pp. 139–52.","ieee":"L. Schmid and C. Hilbe, “The evolution of strategic ignorance in strategic interaction,” in <i>Deliberate Ignorance: Choosing Not To Know</i>, vol. 29, R. Hertwig and C. Engel, Eds. MIT Press, 2021, pp. 139–152.","ama":"Schmid L, Hilbe C. The evolution of strategic ignorance in strategic interaction. In: Hertwig R, Engel C, eds. <i>Deliberate Ignorance: Choosing Not To Know</i>. Vol 29. Strüngmann Forum Reports. MIT Press; 2021:139-152.","apa":"Schmid, L., &#38; Hilbe, C. (2021). The evolution of strategic ignorance in strategic interaction. In R. Hertwig &#38; C. Engel (Eds.), <i>Deliberate Ignorance: Choosing Not To Know</i> (Vol. 29, pp. 139–152). MIT Press.","chicago":"Schmid, Laura, and Christian Hilbe. “The Evolution of Strategic Ignorance in Strategic Interaction.” In <i>Deliberate Ignorance: Choosing Not To Know</i>, edited by Ralph Hertwig and Christoph Engel, 29:139–52. Strüngmann Forum Reports. MIT Press, 2021.","ista":"Schmid L, Hilbe C. 2021.The evolution of strategic ignorance in strategic interaction. In: Deliberate Ignorance: Choosing Not To Know. vol. 29, 139–152."},"date_created":"2021-05-19T12:25:42Z","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"language":[{"iso":"eng"}],"status":"public","series_title":"Strüngmann Forum Reports","publication_identifier":{"isbn":["978-0-262-04559-9"]},"oa":1,"main_file_link":[{"url":"https://esforum.de/publications/PDFs/sfr29/SFR29_09_Hilbe%20and%20Schmid.pdf","open_access":"1"}],"publisher":"MIT Press","day":"01","type":"book_chapter","date_published":"2021-03-01T00:00:00Z","date_updated":"2023-02-23T13:57:04Z","oa_version":"Published Version","year":"2021","author":[{"id":"38B437DE-F248-11E8-B48F-1D18A9856A87","first_name":"Laura","last_name":"Schmid","full_name":"Schmid, Laura","orcid":"0000-0002-6978-7329"},{"full_name":"Hilbe, Christian","last_name":"Hilbe","first_name":"Christian"}],"publication":"Deliberate Ignorance: Choosing Not To Know","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","intvolume":"        29","page":"139-152"},{"file":[{"file_size":381306,"creator":"mdvorak","file_name":"Convex-Grabbing-Game_CCCG_proc_version.pdf","date_created":"2021-06-28T20:23:13Z","file_id":"9616","date_updated":"2021-06-28T20:23:13Z","checksum":"45accb1de9b7e0e4bb2fbfe5fd3e6239","content_type":"application/pdf","success":1,"access_level":"open_access","relation":"main_file"},{"content_type":"application/pdf","checksum":"9199cf18c65658553487458cc24d0ab2","date_updated":"2021-08-12T10:57:21Z","file_id":"9902","date_created":"2021-08-12T10:57:21Z","creator":"kschuh","file_name":"Convex-Grabbing-Game_FULL-VERSION.pdf","file_size":403645,"relation":"main_file","access_level":"open_access","success":1}],"oa":1,"publication":"Proceedings of the 33rd Canadian Conference on Computational Geometry","file_date_updated":"2021-08-12T10:57:21Z","author":[{"id":"40ED02A8-C8B4-11E9-A9C0-453BE6697425","first_name":"Martin","last_name":"Dvorak","full_name":"Dvorak, Martin","orcid":"0000-0001-5293-214X"},{"first_name":"Sara","last_name":"Nicholson","full_name":"Nicholson, Sara"}],"keyword":["convex grabbing game","graph grabbing game","combinatorial game","convex geometry"],"quality_controlled":"1","license":"https://creativecommons.org/licenses/by-nd/4.0/","abstract":[{"lang":"eng","text":"The convex grabbing game is a game where two players, Alice and Bob, alternate taking extremal points from the convex hull of a point set on the plane. Rational weights are given to the points. The goal of each player is to maximize the total weight over all points that they obtain. We restrict the setting to the case of binary weights. We show a construction of an arbitrarily large odd-sized point set that allows Bob to obtain almost 3/4 of the total weight. This construction answers a question asked by Matsumoto, Nakamigawa, and Sakuma in [Graphs and Combinatorics, 36/1 (2020)]. We also present an arbitrarily large even-sized point set where Bob can obtain the entirety of the total weight. Finally, we discuss conjectures about optimum moves in the convex grabbing game for both players in general."}],"publication_status":"published","external_id":{"arxiv":["2106.11247"]},"department":[{"_id":"GradSch"},{"_id":"VlKo"}],"date_created":"2021-06-22T15:57:11Z","language":[{"iso":"eng"}],"status":"public","tmp":{"name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","image":"/image/cc_by_nd.png","short":"CC BY-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode"},"publisher":"Canadian Conference on Computational Geometry","type":"conference","day":"29","has_accepted_license":"1","date_published":"2021-06-29T00:00:00Z","oa_version":"Published Version","year":"2021","date_updated":"2025-05-14T11:23:45Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"9592","title":"Massively winning configurations in the convex grabbing game on the plane","month":"06","article_processing_charge":"No","conference":{"name":"CCCG: Canadian Conference on Computational Geometry","start_date":"2021-08-10","location":"Halifax, NS, Canada; Virtual","end_date":"2021-08-12"},"citation":{"chicago":"Dvorak, Martin, and Sara Nicholson. “Massively Winning Configurations in the Convex Grabbing Game on the Plane.” In <i>Proceedings of the 33rd Canadian Conference on Computational Geometry</i>. Canadian Conference on Computational Geometry, 2021.","ista":"Dvorak M, Nicholson S. 2021. Massively winning configurations in the convex grabbing game on the plane. Proceedings of the 33rd Canadian Conference on Computational Geometry. CCCG: Canadian Conference on Computational Geometry.","ama":"Dvorak M, Nicholson S. Massively winning configurations in the convex grabbing game on the plane. In: <i>Proceedings of the 33rd Canadian Conference on Computational Geometry</i>. Canadian Conference on Computational Geometry; 2021.","apa":"Dvorak, M., &#38; Nicholson, S. (2021). Massively winning configurations in the convex grabbing game on the plane. In <i>Proceedings of the 33rd Canadian Conference on Computational Geometry</i>. Halifax, NS, Canada; Virtual: Canadian Conference on Computational Geometry.","ieee":"M. Dvorak and S. Nicholson, “Massively winning configurations in the convex grabbing game on the plane,” in <i>Proceedings of the 33rd Canadian Conference on Computational Geometry</i>, Halifax, NS, Canada; Virtual, 2021.","short":"M. Dvorak, S. Nicholson, in:, Proceedings of the 33rd Canadian Conference on Computational Geometry, Canadian Conference on Computational Geometry, 2021.","mla":"Dvorak, Martin, and Sara Nicholson. “Massively Winning Configurations in the Convex Grabbing Game on the Plane.” <i>Proceedings of the 33rd Canadian Conference on Computational Geometry</i>, Canadian Conference on Computational Geometry, 2021."},"arxiv":1,"ddc":["516"]},{"status":"public","publisher":"Springer Nature","type":"journal_article","day":"23","date_updated":"2025-07-09T09:00:12Z","year":"2021","oa_version":"Preprint","date_published":"2021-08-23T00:00:00Z","page":"32","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"08","title":"Identification of neural oscillations and epileptiform changes in human brain organoids","_id":"6995","citation":{"ieee":"R. A. Samarasinghe <i>et al.</i>, “Identification of neural oscillations and epileptiform changes in human brain organoids,” <i>Nature Neuroscience</i>, vol. 24. Springer Nature, p. 32, 2021.","short":"R.A. Samarasinghe, O. Miranda, J.E. Buth, S. Mitchell, I. Ferando, M. Watanabe, A. Kurdian, P. Golshani, K. Plath, W.E. Lowry, J.M. Parent, I. Mody, B.G. Novitch, Nature Neuroscience 24 (2021) 32.","mla":"Samarasinghe, Ranmal A., et al. “Identification of Neural Oscillations and Epileptiform Changes in Human Brain Organoids.” <i>Nature Neuroscience</i>, vol. 24, Springer Nature, 2021, p. 32, doi:<a href=\"https://doi.org/10.1038/s41593-021-00906-5\">10.1038/s41593-021-00906-5</a>.","chicago":"Samarasinghe, Ranmal A., Osvaldo Miranda, Jessie E. Buth, Simon Mitchell, Isabella Ferando, Momoko Watanabe, Arinnae Kurdian, et al. “Identification of Neural Oscillations and Epileptiform Changes in Human Brain Organoids.” <i>Nature Neuroscience</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1038/s41593-021-00906-5\">https://doi.org/10.1038/s41593-021-00906-5</a>.","ista":"Samarasinghe RA, Miranda O, Buth JE, Mitchell S, Ferando I, Watanabe M, Kurdian A, Golshani P, Plath K, Lowry WE, Parent JM, Mody I, Novitch BG. 2021. Identification of neural oscillations and epileptiform changes in human brain organoids. Nature Neuroscience. 24, 32.","ama":"Samarasinghe RA, Miranda O, Buth JE, et al. Identification of neural oscillations and epileptiform changes in human brain organoids. <i>Nature Neuroscience</i>. 2021;24:32. doi:<a href=\"https://doi.org/10.1038/s41593-021-00906-5\">10.1038/s41593-021-00906-5</a>","apa":"Samarasinghe, R. A., Miranda, O., Buth, J. E., Mitchell, S., Ferando, I., Watanabe, M., … Novitch, B. G. (2021). Identification of neural oscillations and epileptiform changes in human brain organoids. <i>Nature Neuroscience</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41593-021-00906-5\">https://doi.org/10.1038/s41593-021-00906-5</a>"},"article_processing_charge":"No","OA_type":"green","article_type":"review","OA_place":"publisher","doi":"10.1038/s41593-021-00906-5","oa":1,"publication_identifier":{"eissn":["1546-1726"],"issn":["1097-6256"]},"pmid":1,"acknowledgement":"We thank S. Butler, T. Carmichael and members of the laboratory of B.G.N. for helpful discussions and comments on the manuscript; N. Vishlaghi and F. Turcios-Hernandez for technical assistance, and J. Lee, S.-K. Lee, H. Shinagawa and K. Yoshikawa for valuable reagents. We also thank the UCLA Eli and Edythe Broad Stem Cell Research Center (BSCRC) and Intellectual and Developmental Disabilities Research Center microscopy cores for access to imaging facilities. This work was supported by grants from the California Institute for Regenerative Medicine (CIRM) (DISC1-08819 to B.G.N.), the National Institute of Health (R01NS089817, R01DA051897 and P50HD103557 to B.G.N.; K08NS119747 to R.A.S.; K99HD096105 to M.W.; R01MH123922, R01MH121521 and P50HD103557 to M.J.G.; R01GM099134 to K.P.; R01NS103788 to W.E.L.; R01NS088571 to J.M.P.; R01NS030549 and R01AG050474 to I.M.), and research awards from the UCLA Jonsson Comprehensive Cancer Center and BSCRC Ablon Scholars Program (to B.G.N.), the BSCRC Innovation Program (to B.G.N., K.P. and W.E.L.), the UCLA BSCRC Steffy Brain Aging Research Fund (to B.G.N. and W.E.L.) and the UCLA Clinical and Translational Science Institute (to B.G.N.), Paul Allen Family Foundation Frontiers Group (to K.P. and W.E.L.), the March of Dimes Foundation (to W.E.L.) and the Simons Foundation Autism Research Initiative Bridge to Independence Program (to R.A.S. and M.J.G.). R.A.S. was also supported by the UCLA/NINDS Translational Neuroscience Training Grant (R25NS065723), a Research and Training Fellowship from the American Epilepsy Society, a Taking Flight Award from CURE Epilepsy and a Clinician Scientist training award from the UCLA BSCRC. J.E.B. was supported by the UCLA BSCRC Rose Hills Foundation Graduate Scholarship Training Program. M.W. was supported by postdoctoral training awards provided by the UCLA BSCRC and the Uehara Memorial Foundation. O.A.M. and A.K. were supported in part by the UCLA-California State University Northridge CIRM-Bridges training program (EDUC2-08411). We also acknowledge the support of the IDDRC Cells, Circuits and Systems Analysis, Microscopy and Genetics and Genomics Cores of the Semel Institute of Neuroscience at UCLA, which are supported by the NICHD (U54HD087101 and P50HD10355701). We lastly acknowledge support from a Quantitative and Computational Biosciences Collaboratory Postdoctoral Fellowship to S.M. and the Quantitative and Computational Biosciences Collaboratory community, directed by M. Pellegrini.","main_file_link":[{"url":"https://doi.org/10.1101/820183","open_access":"1"}],"intvolume":"        24","isi":1,"author":[{"first_name":"Ranmal A.","last_name":"Samarasinghe","full_name":"Samarasinghe, Ranmal A."},{"last_name":"Miranda","full_name":"Miranda, Osvaldo","first_name":"Osvaldo","id":"862A3C56-A8BF-11E9-B4FA-D9E3E5697425","orcid":"0000-0001-6618-6889"},{"full_name":"Buth, Jessie E.","last_name":"Buth","first_name":"Jessie E."},{"first_name":"Simon","last_name":"Mitchell","full_name":"Mitchell, Simon"},{"first_name":"Isabella","full_name":"Ferando, Isabella","last_name":"Ferando"},{"first_name":"Momoko","last_name":"Watanabe","full_name":"Watanabe, Momoko"},{"first_name":"Arinnae","last_name":"Kurdian","full_name":"Kurdian, Arinnae"},{"last_name":"Golshani","full_name":"Golshani, Peyman","first_name":"Peyman"},{"first_name":"Kathrin","full_name":"Plath, Kathrin","last_name":"Plath"},{"full_name":"Lowry, William E.","last_name":"Lowry","first_name":"William E."},{"last_name":"Parent","full_name":"Parent, Jack M.","first_name":"Jack M."},{"full_name":"Mody, Istvan","last_name":"Mody","first_name":"Istvan"},{"full_name":"Novitch, Bennett G.","last_name":"Novitch","first_name":"Bennett G."}],"publication":"Nature Neuroscience","scopus_import":"1","quality_controlled":"1","volume":24,"abstract":[{"text":"Human brain organoids represent a powerful tool for the study of human neurological diseases particularly those that impact brain growth and structure. However, many neurological diseases lack obvious anatomical abnormalities, yet significantly impact neural network functions, raising the question of whether organoids possess sufficient neural network architecture and complexity to model these conditions. Here, we explore the network level functions of brain organoids using calcium sensor imaging and extracellular recording approaches that together reveal the existence of complex oscillatory network behaviors reminiscent of intact brain preparations. We further demonstrate strikingly abnormal epileptiform network activity in organoids derived from a Rett Syndrome patient despite only modest anatomical differences from isogenically matched controls, and rescue with an unconventional neuromodulatory drug Pifithrin-α. Together, these findings provide an essential foundation for the utilization of human brain organoids to study intact and disordered human brain network formation and illustrate their utility in therapeutic discovery.","lang":"eng"}],"publication_status":"published","language":[{"iso":"eng"}],"date_created":"2019-11-10T11:23:58Z","external_id":{"isi":["000687516300001"],"pmid":["34426698 "]},"department":[{"_id":"GradSch"},{"_id":"SiHi"}]}]