[{"language":[{"iso":"eng"}],"month":"08","project":[{"name":"International IST Doctoral Program","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"oa_version":"Published Version","has_accepted_license":"1","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","status":"public","related_material":{"record":[{"id":"10077","relation":"part_of_dissertation","status":"public"},{"id":"6194","relation":"part_of_dissertation","status":"public"}]},"file":[{"creator":"mnardin","file_id":"11935","access_level":"closed","relation":"source_file","content_type":"application/zip","file_name":"Michele Nardin, Ph.D. Thesis - ISTA (1).zip","date_updated":"2023-06-20T22:30:04Z","file_size":13515457,"checksum":"2dbb70c74aaa3b64c1f463e943baf09c","embargo_to":"open_access","date_created":"2022-08-19T16:31:34Z"},{"content_type":"application/pdf","file_name":"Michele_Nardin_Phd_Thesis_PDFA.pdf","date_updated":"2023-06-20T22:30:04Z","checksum":"0ec94035ea35a47a9f589ed168e60b48","file_size":9906458,"date_created":"2022-08-22T09:43:50Z","embargo":"2023-06-19","creator":"mnardin","file_id":"11941","access_level":"open_access","relation":"main_file"}],"oa":1,"supervisor":[{"orcid":"0000-0002-5193-4036","full_name":"Csicsvari, Jozsef L","first_name":"Jozsef L","last_name":"Csicsvari","id":"3FA14672-F248-11E8-B48F-1D18A9856A87"}],"publication_identifier":{"issn":["2663-337X"]},"type":"dissertation","date_published":"2022-08-19T00:00:00Z","publisher":"Institute of Science and Technology Austria","file_date_updated":"2023-06-20T22:30:04Z","ec_funded":1,"page":"136","alternative_title":["ISTA Thesis"],"title":"On the encoding, transfer, and consolidation of spatial memories","article_processing_charge":"No","department":[{"_id":"GradSch"},{"_id":"JoCs"}],"date_created":"2022-08-19T08:52:30Z","publication_status":"published","author":[{"first_name":"Michele","last_name":"Nardin","orcid":"0000-0001-8849-6570","full_name":"Nardin, Michele","id":"30BD0376-F248-11E8-B48F-1D18A9856A87"}],"_id":"11932","ddc":["573"],"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.","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"}],"day":"19","doi":"10.15479/at:ista:11932","degree_awarded":"PhD","year":"2022","citation":{"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>","ieee":"M. Nardin, “On the encoding, transfer, and consolidation of spatial memories,” Institute of Science and Technology Austria, 2022.","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>.","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."},"date_updated":"2023-09-05T12:02:14Z"},{"ddc":["570"],"citation":{"ista":"Schulz R. 2022. Chimeric G protein-coupled receptors mimic distinct signaling pathways and modulate microglia function. Institute of Science and Technology Austria.","short":"R. Schulz, Chimeric G Protein-Coupled Receptors Mimic Distinct Signaling Pathways and Modulate Microglia Function, Institute of Science and Technology Austria, 2022.","mla":"Schulz, Rouven. <i>Chimeric G Protein-Coupled Receptors Mimic Distinct Signaling Pathways and Modulate Microglia Function</i>. Institute of Science and Technology Austria, 2022, doi:<a href=\"https://doi.org/10.15479/at:ista:11945\">10.15479/at:ista:11945</a>.","ieee":"R. Schulz, “Chimeric G protein-coupled receptors mimic distinct signaling pathways and modulate microglia function,” Institute of Science and Technology Austria, 2022.","chicago":"Schulz, Rouven. “Chimeric G Protein-Coupled Receptors Mimic Distinct Signaling Pathways and Modulate Microglia Function.” Institute of Science and Technology Austria, 2022. <a href=\"https://doi.org/10.15479/at:ista:11945\">https://doi.org/10.15479/at:ista:11945</a>.","ama":"Schulz R. Chimeric G protein-coupled receptors mimic distinct signaling pathways and modulate microglia function. 2022. doi:<a href=\"https://doi.org/10.15479/at:ista:11945\">10.15479/at:ista:11945</a>","apa":"Schulz, R. (2022). <i>Chimeric G protein-coupled receptors mimic distinct signaling pathways and modulate microglia function</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:11945\">https://doi.org/10.15479/at:ista:11945</a>"},"year":"2022","date_updated":"2023-08-03T13:02:26Z","abstract":[{"text":"G protein-coupled receptors (GPCRs) respond to specific ligands and regulate multiple processes ranging from cell growth and immune responses to neuronal signal transmission. However, ligands for many GPCRs remain unknown, suffer from off-target effects or have poor bioavailability. Additional challenges exist to dissect cell-type specific responses when the same GPCR is expressed on several cell types within the body. Here, we overcome these limitations by engineering DREADD-based GPCR chimeras that selectively bind their agonist clozapine-N-oxide (CNO) and mimic a GPCR-of-interest in a desired cell type.\r\nWe validated our approach with β2-adrenergic receptor (β2AR/ADRB2) and show that our chimeric DREADD-β2AR triggers comparable responses on second messenger and kinase activity, post-translational modifications, and protein-protein interactions. Since β2AR is also enriched in microglia, which can drive inflammation in the central nervous system, we expressed chimeric DREADD-β2AR in primary microglia and successfully recapitulate β2AR-mediated filopodia formation through CNO stimulation. To dissect the role of selected GPCRs during microglial inflammation, we additionally generated DREADD-based chimeras for microglia-enriched GPR65 and GPR109A/HCAR2. In a microglia cell line, DREADD-β2AR and DREADD-GPR65 both modulated the inflammatory response with a similar profile as endogenously expressed β2AR, while DREADD-GPR109A showed no impact.\r\nOur DREADD-based approach provides the means to obtain mechanistic and functional insights into GPCR signaling on a cell-type specific level.","lang":"eng"}],"day":"23","doi":"10.15479/at:ista:11945","degree_awarded":"PhD","file_date_updated":"2022-08-25T09:33:31Z","page":"133","publisher":"Institute of Science and Technology Austria","author":[{"full_name":"Schulz, Rouven","orcid":"0000-0001-5297-733X","last_name":"Schulz","first_name":"Rouven","id":"4C5E7B96-F248-11E8-B48F-1D18A9856A87"}],"_id":"11945","title":"Chimeric G protein-coupled receptors mimic distinct signaling pathways and modulate microglia function","alternative_title":["ISTA Thesis"],"date_created":"2022-08-23T11:33:11Z","article_processing_charge":"No","department":[{"_id":"GradSch"},{"_id":"SaSi"}],"publication_status":"published","status":"public","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","related_material":{"record":[{"id":"11995","relation":"dissertation_contains","status":"public"}]},"file":[{"date_created":"2022-08-25T08:59:57Z","file_size":28079331,"checksum":"61b1b666a210ff7cdd0e95ea75207a13","date_updated":"2022-08-25T08:59:57Z","content_type":"application/pdf","file_name":"Thesis_Rouven_Schulz_2022_final.pdf","relation":"main_file","success":1,"access_level":"open_access","file_id":"11970","creator":"rschulz"},{"date_updated":"2022-08-25T09:33:31Z","file_name":"Thesis_Rouven_Schulz_2022_final.docx","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","date_created":"2022-08-25T09:00:11Z","file_size":27226963,"checksum":"2b8f95ea1c134dbdb927b41b1dbeeeb5","file_id":"11971","creator":"rschulz","relation":"source_file","access_level":"closed"}],"type":"dissertation","date_published":"2022-08-23T00:00:00Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"oa":1,"supervisor":[{"id":"36ACD32E-F248-11E8-B48F-1D18A9856A87","first_name":"Sandra","last_name":"Siegert","orcid":"0000-0001-8635-0877","full_name":"Siegert, Sandra"}],"publication_identifier":{"issn":["2663-337X"]},"language":[{"iso":"eng"}],"has_accepted_license":"1","month":"08","project":[{"_id":"267F75D8-B435-11E9-9278-68D0E5697425","name":"Modulating microglia through G protein-coupled receptor (GPCR) signaling"}],"acknowledged_ssus":[{"_id":"Bio"},{"_id":"PreCl"},{"_id":"LifeSc"}],"oa_version":"Published Version"},{"file":[{"file_id":"12073","creator":"ashute","relation":"main_file","access_level":"open_access","success":1,"date_updated":"2022-09-08T21:50:34Z","file_name":"Thesis_final_draft.pdf","content_type":"application/pdf","date_created":"2022-09-08T21:50:34Z","file_size":1907386,"checksum":"bf073344320e05d92c224786cec2e92d"},{"file_name":"athesis.tex","content_type":"application/octet-stream","date_updated":"2022-09-12T11:24:21Z","checksum":"b054ac6baa09f70e8235403a4abbed80","file_size":495393,"date_created":"2022-09-08T21:50:42Z","creator":"ashute","file_id":"12074","access_level":"closed","relation":"source_file"},{"date_updated":"2022-09-12T11:24:21Z","content_type":"application/x-zip-compressed","file_name":"qfcjsfmtvtbfrjjvhdzrnqxfvgjvxtbf.zip","date_created":"2022-09-09T12:05:00Z","file_size":944534,"checksum":"0a31e905f1cff5eb8110978cc90e1e79","file_id":"12078","creator":"ashute","relation":"source_file","access_level":"closed"}],"related_material":{"record":[{"relation":"part_of_dissertation","id":"12076","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"12077"}]},"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"isbn":["978-3-99078-023-7"],"issn":["2663-337X"]},"supervisor":[{"id":"35827D50-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8314-0177","full_name":"Browning, Timothy D","first_name":"Timothy D","last_name":"Browning"}],"oa":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","image":"/images/cc_by_nc_sa.png","short":"CC BY-NC-SA (4.0)"},"date_published":"2022-09-08T00:00:00Z","type":"dissertation","language":[{"iso":"eng"}],"oa_version":"Published Version","project":[{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"International IST Doctoral Program","grant_number":"665385"}],"month":"09","has_accepted_license":"1","acknowledgement":"I acknowledge the received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska Curie Grant Agreement No. 665385.","ddc":["512"],"degree_awarded":"PhD","doi":"10.15479/at:ista:12072","day":"08","abstract":[{"text":"In this thesis, we study two of the most important questions in Arithmetic geometry: that of the existence and density of solutions to Diophantine equations. In order for a Diophantine equation to have any solutions over the rational numbers, it must have solutions everywhere locally, i.e., over R and over Qp for every prime p. The converse, called the Hasse principle, is known to fail in general. However, it is still a central question in Arithmetic geometry to determine for which varieties the Hasse principle does hold. In this work, we establish the Hasse principle for a wide new family of varieties of the form f(t) = NK/Q(x) ̸= 0, where f is a polynomial with integer coefficients and NK/Q denotes the norm\r\nform associated to a number field K. Our results cover products of arbitrarily many linear, quadratic or cubic factors, and generalise an argument of Irving [69], which makes use of the beta sieve of Rosser and Iwaniec. We also demonstrate how our main sieve results can be applied to treat new cases of a conjecture of Harpaz and Wittenberg on locally split values of polynomials over number fields, and discuss consequences for rational points in fibrations.\r\nIn the second question, about the density of solutions, one defines a height function and seeks to estimate asymptotically the number of points of height bounded by B as B → ∞. Traditionally, one either counts rational points, or\r\nintegral points with respect to a suitable model. However, in this thesis, we study an emerging area of interest in Arithmetic geometry known as Campana points, which in some sense interpolate between rational and integral points.\r\nMore precisely, we count the number of nonzero integers z1, z2, z3 such that gcd(z1, z2, z3) = 1, and z1, z2, z3, z1 + z2 + z3 are all squareful and bounded by B. Using the circle method, we obtain an asymptotic formula which agrees in\r\nthe power of B and log B with a bold new generalisation of Manin’s conjecture to the setting of Campana points, recently formulated by Pieropan, Smeets, Tanimoto and Várilly-Alvarado [96]. However, in this thesis we also provide the first known counterexamples to leading constant predicted by their conjecture. ","lang":"eng"}],"date_updated":"2023-02-21T16:37:35Z","year":"2022","citation":{"ista":"Shute AL. 2022. Existence and density problems in Diophantine geometry: From norm forms to Campana points. Institute of Science and Technology Austria.","mla":"Shute, Alec L. <i>Existence and Density Problems in Diophantine Geometry: From Norm Forms to Campana Points</i>. Institute of Science and Technology Austria, 2022, doi:<a href=\"https://doi.org/10.15479/at:ista:12072\">10.15479/at:ista:12072</a>.","short":"A.L. Shute, Existence and Density Problems in Diophantine Geometry: From Norm Forms to Campana Points, Institute of Science and Technology Austria, 2022.","chicago":"Shute, Alec L. “Existence and Density Problems in Diophantine Geometry: From Norm Forms to Campana Points.” Institute of Science and Technology Austria, 2022. <a href=\"https://doi.org/10.15479/at:ista:12072\">https://doi.org/10.15479/at:ista:12072</a>.","ieee":"A. L. Shute, “Existence and density problems in Diophantine geometry: From norm forms to Campana points,” Institute of Science and Technology Austria, 2022.","ama":"Shute AL. Existence and density problems in Diophantine geometry: From norm forms to Campana points. 2022. doi:<a href=\"https://doi.org/10.15479/at:ista:12072\">10.15479/at:ista:12072</a>","apa":"Shute, A. L. (2022). <i>Existence and density problems in Diophantine geometry: From norm forms to Campana points</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:12072\">https://doi.org/10.15479/at:ista:12072</a>"},"publisher":"Institute of Science and Technology Austria","page":"208","ec_funded":1,"file_date_updated":"2022-09-12T11:24:21Z","publication_status":"published","date_created":"2022-09-08T21:53:03Z","department":[{"_id":"GradSch"},{"_id":"TiBr"}],"article_processing_charge":"No","alternative_title":["ISTA Thesis"],"title":"Existence and density problems in Diophantine geometry: From norm forms to Campana points","_id":"12072","license":"https://creativecommons.org/licenses/by-nc-sa/4.0/","author":[{"id":"440EB050-F248-11E8-B48F-1D18A9856A87","full_name":"Shute, Alec L","orcid":"0000-0002-1812-2810","last_name":"Shute","first_name":"Alec L"}]},{"ddc":["000"],"acknowledgement":"The research was partially supported by the Hong Kong Research Grants Council ECS\r\nProject No. 26208122, ERC CoG 863818 (FoRM-SMArt), the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385, HKUST– Kaisa Joint Research Institute Project Grant HKJRI3A-055 and HKUST Startup Grant R9272. Ali Ahmadi and Roodabeh Safavi were interns at HKUST.","volume":250,"abstract":[{"lang":"eng","text":"Given a Markov chain M = (V, v_0, δ), with state space V and a starting state v_0, and a probability threshold ε, an ε-core is a subset C of states that is left with probability at most ε. More formally, C ⊆ V is an ε-core, iff ℙ[reach (V\\C)] ≤ ε. Cores have been applied in a wide variety of verification problems over Markov chains, Markov decision processes, and probabilistic programs, as a means of discarding uninteresting and low-probability parts of a probabilistic system and instead being able to focus on the states that are likely to be encountered in a real-world run. In this work, we focus on the problem of computing a minimal ε-core in a Markov chain. Our contributions include both negative and positive results: (i) We show that the decision problem on the existence of an ε-core of a given size is NP-complete. This solves an open problem posed in [Jan Kretínský and Tobias Meggendorfer, 2020]. We additionally show that the problem remains NP-complete even when limited to acyclic Markov chains with bounded maximal vertex degree; (ii) We provide a polynomial time algorithm for computing a minimal ε-core on Markov chains over control-flow graphs of structured programs. A straightforward combination of our algorithm with standard branch prediction techniques allows one to apply the idea of cores to find a subset of program lines that are left with low probability and then focus any desired static analysis on this core subset."}],"doi":"10.4230/LIPIcs.FSTTCS.2022.29","day":"14","date_updated":"2025-07-14T09:09:55Z","citation":{"mla":"Ahmadi, Ali, et al. “Algorithms and Hardness Results for Computing Cores of Markov Chains.” <i>42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>, vol. 250, 29, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2022.29\">10.4230/LIPIcs.FSTTCS.2022.29</a>.","short":"A. Ahmadi, K. Chatterjee, A.K. Goharshady, T. Meggendorfer, R. Safavi Hemami, D. Zikelic, in:, 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.","ista":"Ahmadi A, Chatterjee K, Goharshady AK, Meggendorfer T, Safavi Hemami R, Zikelic D. 2022. Algorithms and hardness results for computing cores of Markov chains. 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. FSTTC: Foundations of Software Technology and Theoretical Computer Science vol. 250, 29.","apa":"Ahmadi, A., Chatterjee, K., Goharshady, A. K., Meggendorfer, T., Safavi Hemami, R., &#38; Zikelic, D. (2022). Algorithms and hardness results for computing cores of Markov chains. In <i>42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i> (Vol. 250). Madras, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2022.29\">https://doi.org/10.4230/LIPIcs.FSTTCS.2022.29</a>","ama":"Ahmadi A, Chatterjee K, Goharshady AK, Meggendorfer T, Safavi Hemami R, Zikelic D. Algorithms and hardness results for computing cores of Markov chains. In: <i>42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>. Vol 250. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022. doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2022.29\">10.4230/LIPIcs.FSTTCS.2022.29</a>","ieee":"A. Ahmadi, K. Chatterjee, A. K. Goharshady, T. Meggendorfer, R. Safavi Hemami, and D. Zikelic, “Algorithms and hardness results for computing cores of Markov chains,” in <i>42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>, Madras, India, 2022, vol. 250.","chicago":"Ahmadi, Ali, Krishnendu Chatterjee, Amir Kafshdar Goharshady, Tobias Meggendorfer, Roodabeh Safavi Hemami, and Dorde Zikelic. “Algorithms and Hardness Results for Computing Cores of Markov Chains.” In <i>42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>, Vol. 250. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. <a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2022.29\">https://doi.org/10.4230/LIPIcs.FSTTCS.2022.29</a>."},"year":"2022","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","file_date_updated":"2023-01-20T10:39:44Z","quality_controlled":"1","ec_funded":1,"title":"Algorithms and hardness results for computing cores of Markov chains","intvolume":"       250","publication_status":"published","department":[{"_id":"KrCh"},{"_id":"GradSch"}],"article_processing_charge":"No","date_created":"2023-01-01T23:00:50Z","author":[{"last_name":"Ahmadi","first_name":"Ali","full_name":"Ahmadi, Ali"},{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"391365CE-F248-11E8-B48F-1D18A9856A87","last_name":"Goharshady","first_name":"Amir Kafshdar","full_name":"Goharshady, Amir Kafshdar","orcid":"0000-0003-1702-6584"},{"full_name":"Meggendorfer, Tobias","orcid":"0000-0002-1712-2165","last_name":"Meggendorfer","first_name":"Tobias","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1"},{"last_name":"Safavi Hemami","first_name":"Roodabeh","full_name":"Safavi Hemami, Roodabeh","id":"72ed2640-8972-11ed-ae7b-f9c81ec75154"},{"id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","last_name":"Zikelic","first_name":"Dorde","full_name":"Zikelic, Dorde","orcid":"0000-0002-4681-1699"}],"_id":"12102","scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","file":[{"date_created":"2023-01-20T10:39:44Z","checksum":"6660c802489013f034c9e8bd57f4d46e","file_size":872534,"date_updated":"2023-01-20T10:39:44Z","content_type":"application/pdf","file_name":"2022_LIPICs_Ahmadi.pdf","success":1,"relation":"main_file","access_level":"open_access","file_id":"12324","creator":"dernst"}],"oa":1,"publication_identifier":{"isbn":["9783959772617"],"issn":["1868-8969"]},"date_published":"2022-12-14T00:00:00Z","type":"conference","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"conference":{"location":"Madras, India","end_date":"2022-12-20","name":"FSTTC: Foundations of Software Technology and Theoretical Computer Science","start_date":"2022-12-18"},"language":[{"iso":"eng"}],"month":"12","article_number":"29","oa_version":"Published Version","project":[{"grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020"},{"call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program","grant_number":"665385"}],"publication":"42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science","has_accepted_license":"1"},{"abstract":[{"lang":"eng","text":"To understand how potential gene manipulations affect in vitro microglia, we provide a set of short protocols to evaluate microglia identity and function. We detail steps for immunostaining to determine microglia identity. We describe three functional assays for microglia: phagocytosis, calcium response following ATP stimulation, and cytokine expression upon inflammatory stimuli. We apply these protocols to human induced-pluripotent-stem-cell (hiPSC)-derived microglia, but they can be also applied to other in vitro microglial models including primary mouse microglia.\r\nFor complete details on the use and execution of this protocol, please refer to Bartalska et al. (2022).1"}],"doi":"10.1016/j.xpro.2022.101866","day":"16","date_updated":"2023-11-02T12:21:32Z","citation":{"ieee":"V. Hübschmann, M. Korkut, and S. Siegert, “Assessing human iPSC-derived microglia identity and function by immunostaining, phagocytosis, calcium activity, and inflammation assay,” <i>STAR Protocols</i>, vol. 3, no. 4. Elsevier, 2022.","chicago":"Hübschmann, Verena, Medina Korkut, and Sandra Siegert. “Assessing Human IPSC-Derived Microglia Identity and Function by Immunostaining, Phagocytosis, Calcium Activity, and Inflammation Assay.” <i>STAR Protocols</i>. Elsevier, 2022. <a href=\"https://doi.org/10.1016/j.xpro.2022.101866\">https://doi.org/10.1016/j.xpro.2022.101866</a>.","ama":"Hübschmann V, Korkut M, Siegert S. Assessing human iPSC-derived microglia identity and function by immunostaining, phagocytosis, calcium activity, and inflammation assay. <i>STAR Protocols</i>. 2022;3(4). doi:<a href=\"https://doi.org/10.1016/j.xpro.2022.101866\">10.1016/j.xpro.2022.101866</a>","apa":"Hübschmann, V., Korkut, M., &#38; Siegert, S. (2022). Assessing human iPSC-derived microglia identity and function by immunostaining, phagocytosis, calcium activity, and inflammation assay. <i>STAR Protocols</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.xpro.2022.101866\">https://doi.org/10.1016/j.xpro.2022.101866</a>","ista":"Hübschmann V, Korkut M, Siegert S. 2022. Assessing human iPSC-derived microglia identity and function by immunostaining, phagocytosis, calcium activity, and inflammation assay. STAR Protocols. 3(4), 101866.","short":"V. Hübschmann, M. Korkut, S. Siegert, STAR Protocols 3 (2022).","mla":"Hübschmann, Verena, et al. “Assessing Human IPSC-Derived Microglia Identity and Function by Immunostaining, Phagocytosis, Calcium Activity, and Inflammation Assay.” <i>STAR Protocols</i>, vol. 3, no. 4, 101866, Elsevier, 2022, doi:<a href=\"https://doi.org/10.1016/j.xpro.2022.101866\">10.1016/j.xpro.2022.101866</a>."},"year":"2022","ddc":["570"],"volume":3,"acknowledgement":"This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation program (grant No. 715571 to S.S.) and from the Gesellschaft für Forschungsförderung Niederösterreich (grant No. Sc19-017 to V.H.). We thank Rouven Schulz and Alessandro Venturino for their insights into functional assays and data analysis, Verena Seiboth for insights into necessary institutional permission, and ISTA imaging & optics facility (IOF) especially Bernhard Hochreiter for their support.","title":"Assessing human iPSC-derived microglia identity and function by immunostaining, phagocytosis, calcium activity, and inflammation assay","intvolume":"         3","publication_status":"published","department":[{"_id":"SaSi"},{"_id":"GradSch"}],"article_processing_charge":"No","date_created":"2023-01-12T11:56:38Z","author":[{"full_name":"Hübschmann, Verena","last_name":"Hübschmann","first_name":"Verena","id":"32B7C918-F248-11E8-B48F-1D18A9856A87"},{"id":"4B51CE74-F248-11E8-B48F-1D18A9856A87","first_name":"Medina","last_name":"Korkut","orcid":"0000-0003-4309-2251","full_name":"Korkut, Medina"},{"orcid":"0000-0001-8635-0877","full_name":"Siegert, Sandra","first_name":"Sandra","last_name":"Siegert","id":"36ACD32E-F248-11E8-B48F-1D18A9856A87"}],"issue":"4","_id":"12117","scopus_import":"1","article_type":"letter_note","publisher":"Elsevier","file_date_updated":"2023-01-23T09:50:51Z","quality_controlled":"1","ec_funded":1,"oa":1,"publication_identifier":{"issn":["2666-1667"]},"date_published":"2022-12-16T00:00:00Z","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","image":"/images/cc_by_nc_nd.png"},"related_material":{"record":[{"relation":"other","id":"11478","status":"public"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","file":[{"date_created":"2023-01-23T09:50:51Z","checksum":"3c71b8a60633d42c2f77c49025d5559b","file_size":6251945,"date_updated":"2023-01-23T09:50:51Z","content_type":"application/pdf","file_name":"2022_STARProtocols_Huebschmann.pdf","access_level":"open_access","success":1,"relation":"main_file","file_id":"12340","creator":"dernst"}],"month":"12","article_number":"101866","acknowledged_ssus":[{"_id":"Bio"}],"oa_version":"Published Version","project":[{"name":"Microglia action towards neuronal circuit formation and function in health and disease","grant_number":"715571","_id":"25D4A630-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"grant_number":"SC19-017","name":"How human microglia shape developing neurons during health and inflammation","_id":"9B99D380-BA93-11EA-9121-9846C619BF3A"}],"publication":"STAR Protocols","has_accepted_license":"1","language":[{"iso":"eng"}],"keyword":["General Immunology and Microbiology","General Biochemistry","Genetics and Molecular Biology","General Neuroscience"]},{"publisher":"Springer Nature","article_type":"original","page":"575-581","ec_funded":1,"quality_controlled":"1","file_date_updated":"2023-11-02T17:12:37Z","publication_status":"published","department":[{"_id":"JiFr"},{"_id":"GradSch"},{"_id":"EvBe"},{"_id":"EM-Fac"}],"date_created":"2023-01-16T10:04:48Z","article_processing_charge":"No","title":"ABP1–TMK auxin perception for global phosphorylation and auxin canalization","intvolume":"       609","_id":"12291","pmid":1,"scopus_import":"1","author":[{"id":"4159519E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8302-7596","full_name":"Friml, Jiří","first_name":"Jiří","last_name":"Friml"},{"id":"35A03822-F248-11E8-B48F-1D18A9856A87","first_name":"Michelle C","last_name":"Gallei","orcid":"0000-0003-1286-7368","full_name":"Gallei, Michelle C"},{"id":"0AE74790-0E0B-11E9-ABC7-1ACFE5697425","first_name":"Zuzana","last_name":"Gelová","orcid":"0000-0003-4783-1752","full_name":"Gelová, Zuzana"},{"orcid":"0000-0002-2739-8843","full_name":"Johnson, Alexander J","first_name":"Alexander J","last_name":"Johnson","id":"46A62C3A-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Mazur, Ewa","last_name":"Mazur","first_name":"Ewa"},{"id":"2DB5D88C-D7B3-11E9-B8FD-7907E6697425","last_name":"Monzer","first_name":"Aline","full_name":"Monzer, Aline"},{"id":"3922B506-F248-11E8-B48F-1D18A9856A87","full_name":"Rodriguez Solovey, Lesia","orcid":"0000-0002-7244-7237","last_name":"Rodriguez Solovey","first_name":"Lesia"},{"first_name":"Mark","last_name":"Roosjen","full_name":"Roosjen, Mark"},{"orcid":"0000-0001-7241-2328","full_name":"Verstraeten, Inge","first_name":"Inge","last_name":"Verstraeten","id":"362BF7FE-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Živanović","first_name":"Branka D.","full_name":"Živanović, Branka D."},{"id":"5c243f41-03f3-11ec-841c-96faf48a7ef9","full_name":"Zou, Minxia","last_name":"Zou","first_name":"Minxia"},{"id":"7c417475-8972-11ed-ae7b-8b674ca26986","full_name":"Fiedler, Lukas","last_name":"Fiedler","first_name":"Lukas"},{"first_name":"Caterina","last_name":"Giannini","full_name":"Giannini, Caterina","id":"e3fdddd5-f6e0-11ea-865d-ca99ee6367f4"},{"last_name":"Grones","first_name":"Peter","full_name":"Grones, Peter"},{"id":"45A71A74-F248-11E8-B48F-1D18A9856A87","full_name":"Hrtyan, Mónika","first_name":"Mónika","last_name":"Hrtyan"},{"last_name":"Kaufmann","first_name":"Walter","full_name":"Kaufmann, Walter","orcid":"0000-0001-9735-5315","id":"3F99E422-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Andre","last_name":"Kuhn","full_name":"Kuhn, Andre"},{"id":"44BF24D0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8600-0671","full_name":"Narasimhan, Madhumitha","first_name":"Madhumitha","last_name":"Narasimhan"},{"full_name":"Randuch, Marek","last_name":"Randuch","first_name":"Marek","id":"6ac4636d-15b2-11ec-abd3-fb8df79972ae"},{"last_name":"Rýdza","first_name":"Nikola","full_name":"Rýdza, Nikola"},{"last_name":"Takahashi","first_name":"Koji","full_name":"Takahashi, Koji"},{"id":"2DE75584-F248-11E8-B48F-1D18A9856A87","full_name":"Tan, Shutang","orcid":"0000-0002-0471-8285","last_name":"Tan","first_name":"Shutang"},{"id":"e3736151-106c-11ec-b916-c2558e2762c6","full_name":"Teplova, Anastasiia","last_name":"Teplova","first_name":"Anastasiia"},{"full_name":"Kinoshita, Toshinori","first_name":"Toshinori","last_name":"Kinoshita"},{"full_name":"Weijers, Dolf","first_name":"Dolf","last_name":"Weijers"},{"full_name":"Rakusová, Hana","last_name":"Rakusová","first_name":"Hana"}],"issue":"7927","acknowledgement":"We acknowledge K. Kubiasová for excellent technical assistance, J. Neuhold, A. Lehner and A. Sedivy for technical assistance with protein production and purification at Vienna Biocenter Core Facilities; Creoptix for performing GCI; and the Bioimaging, Electron Microscopy and Life Science Facilities at ISTA, the Plant Sciences Core Facility of CEITEC Masaryk University, the Core Facility CELLIM (MEYS CR, LM2018129 Czech-BioImaging) and J. Sprakel for their assistance. J.F. is grateful to R. Napier for many insightful suggestions and support. We thank all past and present members of the Friml group for their support and for other contributions to this effort to clarify the controversial role of ABP1 over the past seven years. The project received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation program (grant agreement no. 742985 to J.F. and 833867 to D.W.); the Austrian Science Fund (FWF; P29988 to J.F.); the Netherlands Organization for Scientific Research (NWO; VICI grant 865.14.001 to D.W. and VENI grant VI.Veni.212.003 to A.K.); the Ministry of Education, Science and Technological Development of the Republic of Serbia (contract no. 451-03-68/2022-14/200053 to B.D.Ž.); and the MEXT/JSPS KAKENHI to K.T. (20K06685) and T.K. (20H05687 and 20H05910).","volume":609,"ddc":["580"],"doi":"10.1038/s41586-022-05187-x","day":"15","abstract":[{"text":"The phytohormone auxin triggers transcriptional reprogramming through a well-characterized perception machinery in the nucleus. By contrast, mechanisms that underlie fast effects of auxin, such as the regulation of ion fluxes, rapid phosphorylation of proteins or auxin feedback on its transport, remain unclear1,2,3. Whether auxin-binding protein 1 (ABP1) is an auxin receptor has been a source of debate for decades1,4. Here we show that a fraction of Arabidopsis thaliana ABP1 is secreted and binds auxin specifically at an acidic pH that is typical of the apoplast. ABP1 and its plasma-membrane-localized partner, transmembrane kinase 1 (TMK1), are required for the auxin-induced ultrafast global phospho-response and for downstream processes that include the activation of H+-ATPase and accelerated cytoplasmic streaming. abp1 and tmk mutants cannot establish auxin-transporting channels and show defective auxin-induced vasculature formation and regeneration. An ABP1(M2X) variant that lacks the capacity to bind auxin is unable to complement these defects in abp1 mutants. These data indicate that ABP1 is the auxin receptor for TMK1-based cell-surface signalling, which mediates the global phospho-response and auxin canalization.","lang":"eng"}],"date_updated":"2023-11-07T08:16:09Z","citation":{"ista":"Friml J, Gallei MC, Gelová Z, Johnson AJ, Mazur E, Monzer A, Rodriguez Solovey L, Roosjen M, Verstraeten I, Živanović BD, Zou M, Fiedler L, Giannini C, Grones P, Hrtyan M, Kaufmann W, Kuhn A, Narasimhan M, Randuch M, Rýdza N, Takahashi K, Tan S, Teplova A, Kinoshita T, Weijers D, Rakusová H. 2022. ABP1–TMK auxin perception for global phosphorylation and auxin canalization. Nature. 609(7927), 575–581.","short":"J. Friml, M.C. Gallei, Z. Gelová, A.J. Johnson, E. Mazur, A. Monzer, L. Rodriguez Solovey, M. Roosjen, I. Verstraeten, B.D. Živanović, M. Zou, L. Fiedler, C. Giannini, P. Grones, M. Hrtyan, W. Kaufmann, A. Kuhn, M. Narasimhan, M. Randuch, N. Rýdza, K. Takahashi, S. Tan, A. Teplova, T. Kinoshita, D. Weijers, H. Rakusová, Nature 609 (2022) 575–581.","mla":"Friml, Jiří, et al. “ABP1–TMK Auxin Perception for Global Phosphorylation and Auxin Canalization.” <i>Nature</i>, vol. 609, no. 7927, Springer Nature, 2022, pp. 575–81, doi:<a href=\"https://doi.org/10.1038/s41586-022-05187-x\">10.1038/s41586-022-05187-x</a>.","ieee":"J. Friml <i>et al.</i>, “ABP1–TMK auxin perception for global phosphorylation and auxin canalization,” <i>Nature</i>, vol. 609, no. 7927. Springer Nature, pp. 575–581, 2022.","chicago":"Friml, Jiří, Michelle C Gallei, Zuzana Gelová, Alexander J Johnson, Ewa Mazur, Aline Monzer, Lesia Rodriguez Solovey, et al. “ABP1–TMK Auxin Perception for Global Phosphorylation and Auxin Canalization.” <i>Nature</i>. Springer Nature, 2022. <a href=\"https://doi.org/10.1038/s41586-022-05187-x\">https://doi.org/10.1038/s41586-022-05187-x</a>.","ama":"Friml J, Gallei MC, Gelová Z, et al. ABP1–TMK auxin perception for global phosphorylation and auxin canalization. <i>Nature</i>. 2022;609(7927):575-581. doi:<a href=\"https://doi.org/10.1038/s41586-022-05187-x\">10.1038/s41586-022-05187-x</a>","apa":"Friml, J., Gallei, M. C., Gelová, Z., Johnson, A. J., Mazur, E., Monzer, A., … Rakusová, H. (2022). ABP1–TMK auxin perception for global phosphorylation and auxin canalization. <i>Nature</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41586-022-05187-x\">https://doi.org/10.1038/s41586-022-05187-x</a>"},"year":"2022","isi":1,"external_id":{"isi":["000851357500002"],"pmid":["36071161"]},"language":[{"iso":"eng"}],"acknowledged_ssus":[{"_id":"Bio"},{"_id":"EM-Fac"},{"_id":"LifeSc"}],"oa_version":"Submitted Version","project":[{"name":"Tracing Evolution of Auxin Transport and Polarity in Plants","grant_number":"742985","call_identifier":"H2020","_id":"261099A6-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"262EF96E-B435-11E9-9278-68D0E5697425","name":"RNA-directed DNA methylation in plant development","grant_number":"P29988"}],"month":"09","publication":"Nature","has_accepted_license":"1","file":[{"file_id":"14483","creator":"amally","access_level":"open_access","success":1,"relation":"main_file","date_updated":"2023-11-02T17:12:37Z","content_type":"application/pdf","file_name":"Friml Nature 2022_merged.pdf","date_created":"2023-11-02T17:12:37Z","checksum":"a6055c606aefb900bf62ae3e7d15f921","file_size":79774945}],"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"eissn":["1476-4687"],"issn":["0028-0836"]},"oa":1,"date_published":"2022-09-15T00:00:00Z","type":"journal_article"},{"year":"2022","citation":{"ista":"Shipman BA, Stephenson ER. 2022. Tangible topology through the lens of limits. PRIMUS. 32(5), 593–609.","mla":"Shipman, Barbara A., and Elizabeth R. Stephenson. “Tangible Topology through the Lens of Limits.” <i>PRIMUS</i>, vol. 32, no. 5, Taylor &#38; Francis, 2022, pp. 593–609, doi:<a href=\"https://doi.org/10.1080/10511970.2021.1872750\">10.1080/10511970.2021.1872750</a>.","short":"B.A. Shipman, E.R. Stephenson, PRIMUS 32 (2022) 593–609.","chicago":"Shipman, Barbara A., and Elizabeth R Stephenson. “Tangible Topology through the Lens of Limits.” <i>PRIMUS</i>. Taylor &#38; Francis, 2022. <a href=\"https://doi.org/10.1080/10511970.2021.1872750\">https://doi.org/10.1080/10511970.2021.1872750</a>.","ieee":"B. A. Shipman and E. R. Stephenson, “Tangible topology through the lens of limits,” <i>PRIMUS</i>, vol. 32, no. 5. Taylor &#38; Francis, pp. 593–609, 2022.","ama":"Shipman BA, Stephenson ER. Tangible topology through the lens of limits. <i>PRIMUS</i>. 2022;32(5):593-609. doi:<a href=\"https://doi.org/10.1080/10511970.2021.1872750\">10.1080/10511970.2021.1872750</a>","apa":"Shipman, B. A., &#38; Stephenson, E. R. (2022). Tangible topology through the lens of limits. <i>PRIMUS</i>. Taylor &#38; Francis. <a href=\"https://doi.org/10.1080/10511970.2021.1872750\">https://doi.org/10.1080/10511970.2021.1872750</a>"},"date_updated":"2023-01-30T13:02:30Z","day":"28","doi":"10.1080/10511970.2021.1872750","abstract":[{"text":"Point-set topology is among the most abstract branches of mathematics in that it lacks tangible notions of distance, length, magnitude, order, and size. There is no shape, no geometry, no algebra, and no direction. Everything we are used to visualizing is gone. In the teaching and learning of mathematics, this can present a conundrum. Yet, this very property makes point set topology perfect for teaching and learning abstract mathematical concepts. It clears our minds of preconceived intuitions and expectations and forces us to think in new and creative ways. In this paper, we present guided investigations into topology through questions and thinking strategies that open up fascinating problems. They are intended for faculty who already teach or are thinking about teaching a class in topology or abstract mathematical reasoning for undergraduates. They can be used to build simple to challenging projects in topology, proofs, honors programs, and research experiences.","lang":"eng"}],"volume":32,"scopus_import":"1","_id":"12307","issue":"5","author":[{"last_name":"Shipman","first_name":"Barbara A.","full_name":"Shipman, Barbara A."},{"first_name":"Elizabeth R","last_name":"Stephenson","orcid":"0000-0002-6862-208X","full_name":"Stephenson, Elizabeth R","id":"2D04F932-F248-11E8-B48F-1D18A9856A87"}],"date_created":"2023-01-16T10:07:21Z","article_processing_charge":"No","department":[{"_id":"HeEd"},{"_id":"GradSch"}],"publication_status":"published","intvolume":"        32","title":"Tangible topology through the lens of limits","quality_controlled":"1","page":"593-609","publisher":"Taylor & Francis","article_type":"original","type":"journal_article","date_published":"2022-05-28T00:00:00Z","publication_identifier":{"eissn":["1935-4053"],"issn":["1051-1970"]},"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"PRIMUS","oa_version":"None","month":"05","keyword":["Education","General Mathematics"],"language":[{"iso":"eng"}]},{"project":[{"grant_number":"638176","name":"Efficient Simulation of Natural Phenomena at Extremely Large Scales","call_identifier":"H2020","_id":"2533E772-B435-11E9-9278-68D0E5697425"}],"acknowledged_ssus":[{"_id":"SSU"}],"oa_version":"Published Version","month":"09","has_accepted_license":"1","language":[{"iso":"eng"}],"publication_identifier":{"issn":["2663-337X"],"isbn":["978-3-99078-020-6"]},"oa":1,"supervisor":[{"first_name":"Christopher J","last_name":"Wojtan","orcid":"0000-0001-6646-5546","full_name":"Wojtan, Christopher J","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87"}],"type":"dissertation","date_published":"2022-09-22T00:00:00Z","file":[{"access_level":"open_access","relation":"main_file","description":"This is the main PDF file of the thesis. File size: 105 MB","creator":"cchlebak","file_id":"12371","title":"Thesis","file_size":104497530,"checksum":"083722acbb8115e52e3b0fdec6226769","date_created":"2023-01-25T12:04:41Z","file_name":"thesis_gsperl.pdf","content_type":"application/pdf","date_updated":"2023-02-02T09:29:57Z"},{"date_updated":"2023-02-02T09:33:37Z","file_name":"thesis_gsperl_compressed.pdf","content_type":"application/pdf","date_created":"2023-02-02T09:33:37Z","checksum":"511f82025e5fcb70bff4731d6896ca07","file_size":23183710,"title":"Thesis (compressed 23MB)","file_id":"12483","creator":"cchlebak","description":"This version of the thesis uses stronger image compression for a smaller file size of 23MB.","relation":"main_file","access_level":"open_access"},{"relation":"source_file","access_level":"open_access","file_id":"12484","creator":"cchlebak","date_created":"2023-02-02T09:39:25Z","file_size":98382247,"checksum":"ed4cb85225eedff761c25bddfc37a2ed","date_updated":"2023-02-02T09:39:25Z","content_type":"application/x-zip-compressed","file_name":"thesis-source.zip"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","related_material":{"record":[{"id":"11736","relation":"part_of_dissertation","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"9818"},{"relation":"part_of_dissertation","id":"8385","status":"public"}]},"status":"public","article_processing_charge":"No","date_created":"2023-01-24T10:49:46Z","department":[{"_id":"GradSch"},{"_id":"ChWo"}],"publication_status":"published","alternative_title":["ISTA Thesis"],"title":"Homogenizing yarn simulations: Large-scale mechanics, small-scale detail, and quantitative fitting","_id":"12358","author":[{"last_name":"Sperl","first_name":"Georg","full_name":"Sperl, Georg","id":"4DD40360-F248-11E8-B48F-1D18A9856A87"}],"publisher":"Institute of Science and Technology Austria","ec_funded":1,"page":"138","file_date_updated":"2023-02-02T09:39:25Z","day":"22","degree_awarded":"PhD","doi":"10.15479/at:ista:12103","abstract":[{"lang":"eng","text":"The complex yarn structure of knitted and woven fabrics gives rise to both a mechanical and\r\nvisual complexity. The small-scale interactions of yarns colliding with and pulling on each\r\nother result in drastically different large-scale stretching and bending behavior, introducing\r\nanisotropy, curling, and more. While simulating cloth as individual yarns can reproduce this\r\ncomplexity and match the quality of real fabric, it may be too computationally expensive for\r\nlarge fabrics. On the other hand, continuum-based approaches do not need to discretize the\r\ncloth at a stitch-level, but it is non-trivial to find a material model that would replicate the\r\nlarge-scale behavior of yarn fabrics, and they discard the intricate visual detail. In this thesis,\r\nwe discuss three methods to try and bridge the gap between small-scale and large-scale yarn\r\nmechanics using numerical homogenization: fitting a continuum model to periodic yarn simulations, adding mechanics-aware yarn detail onto thin-shell simulations, and quantitatively\r\nfitting yarn parameters to physical measurements of real fabric.\r\nTo start, we present a method for animating yarn-level cloth effects using a thin-shell solver.\r\nWe first use a large number of periodic yarn-level simulations to build a model of the potential\r\nenergy density of the cloth, and then use it to compute forces in a thin-shell simulator. The\r\nresulting simulations faithfully reproduce expected effects like the stiffening of woven fabrics\r\nand the highly deformable nature and anisotropy of knitted fabrics at a fraction of the cost of\r\nfull yarn-level simulation.\r\nWhile our thin-shell simulations are able to capture large-scale yarn mechanics, they lack\r\nthe rich visual detail of yarn-level simulations. Therefore, we propose a method to animate\r\nyarn-level cloth geometry on top of an underlying deforming mesh in a mechanics-aware\r\nfashion in real time. Using triangle strains to interpolate precomputed yarn geometry, we are\r\nable to reproduce effects such as knit loops tightening under stretching at negligible cost.\r\nFinally, we introduce a methodology for inverse-modeling of yarn-level mechanics of cloth,\r\nbased on the mechanical response of fabrics in the real world. We compile a database from\r\nphysical tests of several knitted fabrics used in the textile industry spanning diverse physical\r\nproperties like stiffness, nonlinearity, and anisotropy. We then develop a system for approximating these mechanical responses with yarn-level cloth simulation, using homogenized\r\nshell models to speed up computation and adding some small-but-necessary extensions to\r\nyarn-level models used in computer graphics.\r\n"}],"citation":{"short":"G. Sperl, Homogenizing Yarn Simulations: Large-Scale Mechanics, Small-Scale Detail, and Quantitative Fitting, Institute of Science and Technology Austria, 2022.","mla":"Sperl, Georg. <i>Homogenizing Yarn Simulations: Large-Scale Mechanics, Small-Scale Detail, and Quantitative Fitting</i>. Institute of Science and Technology Austria, 2022, doi:<a href=\"https://doi.org/10.15479/at:ista:12103\">10.15479/at:ista:12103</a>.","ista":"Sperl G. 2022. Homogenizing yarn simulations: Large-scale mechanics, small-scale detail, and quantitative fitting. Institute of Science and Technology Austria.","apa":"Sperl, G. (2022). <i>Homogenizing yarn simulations: Large-scale mechanics, small-scale detail, and quantitative fitting</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:12103\">https://doi.org/10.15479/at:ista:12103</a>","ama":"Sperl G. Homogenizing yarn simulations: Large-scale mechanics, small-scale detail, and quantitative fitting. 2022. doi:<a href=\"https://doi.org/10.15479/at:ista:12103\">10.15479/at:ista:12103</a>","ieee":"G. Sperl, “Homogenizing yarn simulations: Large-scale mechanics, small-scale detail, and quantitative fitting,” Institute of Science and Technology Austria, 2022.","chicago":"Sperl, Georg. “Homogenizing Yarn Simulations: Large-Scale Mechanics, Small-Scale Detail, and Quantitative Fitting.” Institute of Science and Technology Austria, 2022. <a href=\"https://doi.org/10.15479/at:ista:12103\">https://doi.org/10.15479/at:ista:12103</a>."},"year":"2022","date_updated":"2024-02-28T12:57:46Z","ddc":["000","620"]},{"ddc":["570"],"day":"19","doi":"10.15479/at:ista:12094","degree_awarded":"PhD","abstract":[{"text":"Autism spectrum disorders (ASDs) are a group of neurodevelopmental disorders character\u0002ized by behavioral symptoms such as problems in social communication and interaction, as\r\nwell as repetitive, restricted behaviors and interests. These disorders show a high degree\r\nof heritability and hundreds of risk genes have been identifed using high throughput\r\nsequencing technologies. This genetic heterogeneity has hampered eforts in understanding\r\nthe pathogenesis of ASD but at the same time given rise to the concept of convergent\r\nmechanisms. Previous studies have identifed that risk genes for ASD broadly converge\r\nonto specifc functional categories with transcriptional regulation being one of the biggest\r\ngroups. In this thesis, I focus on this subgroup of genes and investigate the gene regulatory\r\nconsequences of some of them in the context of neurodevelopment.\r\nFirst, we showed that mutations in the ASD and intellectual disability risk gene Setd5 lead\r\nto perturbations of gene regulatory programs in early cell fate specifcation. In addition,\r\nadult animals display abnormal learning behavior which is mirrored at the transcriptional\r\nlevel by altered activity dependent regulation of postsynaptic gene expression. Lastly,\r\nwe link the regulatory function of Setd5 to its interaction with the Paf1 and the NCoR\r\ncomplex.\r\nSecond, by modeling the heterozygous loss of the top ASD gene CHD8 in human cerebral\r\norganoids we demonstrate profound changes in the developmental trajectories of both\r\ninhibitory and excitatory neurons using single cell RNA-sequencing. While the former\r\nwere generated earlier in CHD8+/- organoids, the generation of the latter was shifted to\r\nlater times in favor of a prolonged progenitor expansion phase and ultimately increased\r\norganoid size.\r\nFinally, by modeling heterozygous mutations for four ASD associated chromatin modifers,\r\nASH1L, KDM6B, KMT5B, and SETD5 in human cortical spheroids we show evidence of\r\nregulatory convergence across three of those genes. We observe a shift from dorsal cortical\r\nexcitatory neuron fates towards partially ventralized cell types resembling cells from the\r\nlateral ganglionic eminence. As this project is still ongoing at the time of writing, future\r\nexperiments will aim at elucidating the regulatory mechanisms underlying this shift with\r\nthe aim of linking these three ASD risk genes through biological convergence.","lang":"eng"}],"citation":{"ista":"Dotter C. 2022. Transcriptional consequences of mutations in genes associated with Autism Spectrum Disorder. Institute of Science and Technology Austria.","short":"C. Dotter, Transcriptional Consequences of Mutations in Genes Associated with Autism Spectrum Disorder, Institute of Science and Technology Austria, 2022.","mla":"Dotter, Christoph. <i>Transcriptional Consequences of Mutations in Genes Associated with Autism Spectrum Disorder</i>. Institute of Science and Technology Austria, 2022, doi:<a href=\"https://doi.org/10.15479/at:ista:12094\">10.15479/at:ista:12094</a>.","chicago":"Dotter, Christoph. “Transcriptional Consequences of Mutations in Genes Associated with Autism Spectrum Disorder.” Institute of Science and Technology Austria, 2022. <a href=\"https://doi.org/10.15479/at:ista:12094\">https://doi.org/10.15479/at:ista:12094</a>.","ieee":"C. Dotter, “Transcriptional consequences of mutations in genes associated with Autism Spectrum Disorder,” Institute of Science and Technology Austria, 2022.","ama":"Dotter C. Transcriptional consequences of mutations in genes associated with Autism Spectrum Disorder. 2022. doi:<a href=\"https://doi.org/10.15479/at:ista:12094\">10.15479/at:ista:12094</a>","apa":"Dotter, C. (2022). <i>Transcriptional consequences of mutations in genes associated with Autism Spectrum Disorder</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:12094\">https://doi.org/10.15479/at:ista:12094</a>"},"year":"2022","date_updated":"2023-11-16T13:10:22Z","publisher":"Institute of Science and Technology Austria","ec_funded":1,"page":"152","file_date_updated":"2023-09-20T22:30:03Z","date_created":"2023-01-24T13:09:57Z","department":[{"_id":"GradSch"},{"_id":"GaNo"}],"article_processing_charge":"No","publication_status":"published","title":"Transcriptional consequences of mutations in genes associated with Autism Spectrum Disorder","alternative_title":["ISTA Thesis"],"_id":"12364","author":[{"first_name":"Christoph","last_name":"Dotter","orcid":"0000-0002-9033-9096","full_name":"Dotter, Christoph","id":"4C66542E-F248-11E8-B48F-1D18A9856A87"}],"file":[{"file_id":"12365","creator":"cchlebak","relation":"main_file","access_level":"open_access","date_updated":"2023-09-20T22:30:03Z","content_type":"application/pdf","file_name":"220923_Thesis_CDotter_Final.pdf","date_created":"2023-01-24T13:15:45Z","embargo":"2023-09-19","checksum":"896f4cac9adb6d3f26a6605772f4e1a3","file_size":20457465},{"creator":"cchlebak","file_id":"12482","access_level":"closed","relation":"source_file","content_type":"application/x-zip-compressed","file_name":"latex_source_CDotter_Thesis_2022.zip","date_updated":"2023-09-20T22:30:03Z","embargo_to":"open_access","file_size":22433512,"checksum":"ad01bb20da163be6893b7af832e58419","date_created":"2023-02-02T09:15:35Z"}],"related_material":{"record":[{"relation":"part_of_dissertation","id":"3","status":"public"},{"id":"11160","relation":"part_of_dissertation","status":"public"}]},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","status":"public","publication_identifier":{"issn":["2663-337X"]},"oa":1,"supervisor":[{"id":"3E57A680-F248-11E8-B48F-1D18A9856A87","last_name":"Novarino","first_name":"Gaia","full_name":"Novarino, Gaia","orcid":"0000-0002-7673-7178"}],"type":"dissertation","date_published":"2022-09-19T00:00:00Z","language":[{"iso":"eng"}],"project":[{"grant_number":"401299","name":"Probing development and reversibility of autism spectrum disorders","_id":"254BA948-B435-11E9-9278-68D0E5697425"},{"name":"Critical windows and reversibility of ASD associated with mutations in chromatin remodelers","grant_number":"707964","_id":"9B91375C-BA93-11EA-9121-9846C619BF3A"},{"name":"Probing the Reversibility of Autism Spectrum Disorders by Employing in vivo and in vitro Models","grant_number":"715508","_id":"25444568-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"_id":"2690FEAC-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Identification of converging Molecular Pathways Across Chromatinopathies as Targets for Therapy","grant_number":"I04205"}],"oa_version":"Published Version","month":"09","has_accepted_license":"1"},{"file_date_updated":"2023-01-26T23:30:44Z","ec_funded":1,"page":"168","publisher":"Institute of Science and Technology Austria","author":[{"id":"2C21D6E8-F248-11E8-B48F-1D18A9856A87","last_name":"Redchenko","first_name":"Elena","full_name":"Redchenko, Elena"}],"_id":"12366","alternative_title":["ISTA Thesis"],"title":"Controllable states of superconducting Qubit ensembles","article_processing_charge":"No","date_created":"2023-01-25T09:17:02Z","department":[{"_id":"GradSch"},{"_id":"JoFi"}],"publication_status":"published","ddc":["530"],"year":"2022","citation":{"mla":"Redchenko, Elena. <i>Controllable States of Superconducting Qubit Ensembles</i>. Institute of Science and Technology Austria, 2022, doi:<a href=\"https://doi.org/10.15479/at:ista:12132\">10.15479/at:ista:12132</a>.","short":"E. Redchenko, Controllable States of Superconducting Qubit Ensembles, Institute of Science and Technology Austria, 2022.","ista":"Redchenko E. 2022. Controllable states of superconducting Qubit ensembles. Institute of Science and Technology Austria.","ama":"Redchenko E. Controllable states of superconducting Qubit ensembles. 2022. doi:<a href=\"https://doi.org/10.15479/at:ista:12132\">10.15479/at:ista:12132</a>","apa":"Redchenko, E. (2022). <i>Controllable states of superconducting Qubit ensembles</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:12132\">https://doi.org/10.15479/at:ista:12132</a>","chicago":"Redchenko, Elena. “Controllable States of Superconducting Qubit Ensembles.” Institute of Science and Technology Austria, 2022. <a href=\"https://doi.org/10.15479/at:ista:12132\">https://doi.org/10.15479/at:ista:12132</a>.","ieee":"E. Redchenko, “Controllable states of superconducting Qubit ensembles,” Institute of Science and Technology Austria, 2022."},"date_updated":"2024-08-07T07:11:56Z","abstract":[{"text":"Recent substantial advances in the feld of superconducting circuits have shown its\r\npotential as a leading platform for future quantum computing. In contrast to classical\r\ncomputers based on bits that are represented by a single binary value, 0 or 1, quantum\r\nbits (or qubits) can be in a superposition of both. Thus, quantum computers can store\r\nand handle more information at the same time and a quantum advantage has already\r\nbeen demonstrated for two types of computational tasks. Rapid progress in academic\r\nand industry labs accelerates the development of superconducting processors which may\r\nsoon fnd applications in complex computations, chemical simulations, cryptography, and\r\noptimization. Now that these machines are scaled up to tackle such problems the questions\r\nof qubit interconnects and networks becomes very relevant. How to route signals on-chip\r\nbetween diferent processor components? What is the most efcient way to entangle\r\nqubits? And how to then send and process entangled signals between distant cryostats\r\nhosting superconducting processors?\r\nIn this thesis, we are looking for solutions to these problems by studying the collective\r\nbehavior of superconducting qubit ensembles. We frst demonstrate on-demand tunable\r\ndirectional scattering of microwave photons from a pair of qubits in a waveguide. Such a\r\ndevice can route microwave photons on-chip with a high diode efciency. Then we focus\r\non studying ultra-strong coupling regimes between light (microwave photons) and matter\r\n(superconducting qubits), a regime that could be promising for extremely fast multi-qubit\r\nentanglement generation. Finally, we show coherent pulse storage and periodic revivals\r\nin a fve qubit ensemble strongly coupled to a resonator. Such a reconfgurable storage\r\ndevice could be used as part of a quantum repeater that is needed for longer-distance\r\nquantum communication.\r\nThe achieved high degree of control over multi-qubit ensembles highlights not only the\r\nbeautiful physics of circuit quantum electrodynamics, it also represents the frst step\r\ntoward new quantum simulation and communication methods, and certain techniques\r\nmay also fnd applications in future superconducting quantum computing hardware.\r\n","lang":"eng"}],"day":"26","degree_awarded":"PhD","doi":"10.15479/at:ista:12132","language":[{"iso":"eng"}],"has_accepted_license":"1","month":"09","project":[{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"International IST Doctoral Program","grant_number":"665385"},{"name":"A Fiber Optic Transceiver for Superconducting Qubits","grant_number":"758053","call_identifier":"H2020","_id":"26336814-B435-11E9-9278-68D0E5697425"},{"_id":"237CBA6C-32DE-11EA-91FC-C7463DDC885E","call_identifier":"H2020","name":"Quantum readout techniques and technologies","grant_number":"862644"}],"oa_version":"Published Version","acknowledged_ssus":[{"_id":"NanoFab"},{"_id":"M-Shop"},{"_id":"EM-Fac"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","status":"public","file":[{"file_id":"12367","creator":"cchlebak","relation":"main_file","access_level":"open_access","date_updated":"2023-01-26T23:30:44Z","content_type":"application/pdf","file_name":"Final_Thesis_ES_Redchenko.pdf","embargo":"2022-12-28","date_created":"2023-01-25T09:41:49Z","file_size":56076868,"checksum":"39eabb1e006b41335f17f3b29af09648"}],"type":"dissertation","date_published":"2022-09-26T00:00:00Z","oa":1,"supervisor":[{"orcid":"0000-0001-8112-028X","full_name":"Fink, Johannes M","first_name":"Johannes M","last_name":"Fink","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87"}],"publication_identifier":{"issn":["2663-337X"],"isbn":["978-3-99078-024-4"]}},{"publication_identifier":{"issn":["2663-337X"],"isbn":[" 978-3-99078-025-1 "]},"oa":1,"supervisor":[{"last_name":"Heisenberg","first_name":"Carl-Philipp J","full_name":"Heisenberg, Carl-Philipp J","orcid":"0000-0002-0912-4566","id":"39427864-F248-11E8-B48F-1D18A9856A87"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"type":"dissertation","date_published":"2022-09-29T00:00:00Z","file":[{"file_id":"12369","creator":"cchlebak","access_level":"open_access","relation":"main_file","success":1,"date_updated":"2023-01-25T10:52:46Z","content_type":"application/pdf","file_name":"THESIS_FINAL_FArslan_pdfa.pdf","date_created":"2023-01-25T10:52:46Z","file_size":14581024,"checksum":"e54a3e69b83ebf166544164afd25608e"}],"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"9350"}]},"project":[{"_id":"260F1432-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Interaction and feedback between cell mechanics and fate specification in vertebrate gastrulation","grant_number":"742573"}],"oa_version":"Published Version","acknowledged_ssus":[{"_id":"LifeSc"},{"_id":"Bio"},{"_id":"NanoFab"}],"month":"09","has_accepted_license":"1","language":[{"iso":"eng"}],"day":"29","degree_awarded":"PhD","doi":"10.15479/at:ista:12153","abstract":[{"lang":"eng","text":"Metazoan development relies on the formation and remodeling of cell-cell contacts. The \r\nbinding of adhesion receptors and remodeling of the actomyosin cell cortex at cell-cell \r\ninteraction sites have been implicated in cell-cell contact formation. Yet, how these two \r\nprocesses functionally interact to drive cell-cell contact expansion and strengthening \r\nremains unclear. Here, we study how primary germ layer progenitor cells from zebrafish \r\nbind to supported lipid bilayers (SLB) functionalized with E-cadherin ectodomains as an \r\nassay system for monitoring cell-cell contact formation at high spatiotemporal resolution. \r\nWe show that cell-cell contact formation represents a two-tiered process: E-cadherin\u0002mediated downregulation of the small GTPase RhoA at the forming contact leads to both \r\ndepletion of Myosin-2 and decrease of F-actin. This is followed by centrifugal actin \r\nnetwork flows at the contact triggered by a sharp gradient of Myosin-2 at the rim of the \r\ncontact zone, with Myosin-2 displaying higher cortical localization outside than inside of \r\nthe contact. These centrifugal cortical actin flows, in turn, not only further dilute the actin \r\nnetwork at the contact disc, but also lead to an accumulation of both F-actin and E\u0002cadherin at the contact rim. Eventually, this combination of actomyosin downregulation \r\nand flows at the contact contribute to the characteristic molecular organization implicated \r\nin contact formation and maintenance: depletion of cortical actomyosin at the contact disc, \r\ndriving contact expansion by lowering interfacial tension at the contact, and accumulation \r\nof both E-cadherin and F-actin at the contact rim, mechanically linking the contractile \r\ncortices of the adhering cells. Thus, using a biomimetic assay, we exemplify how \r\nadhesion signaling and cell mechanics function together to modulate the spatial \r\norganization of cell-cell contacts."}],"year":"2022","citation":{"ista":"Arslan FN. 2022. Remodeling of E-cadherin-mediated contacts via cortical  flows. Institute of Science and Technology Austria.","mla":"Arslan, Feyza N. <i>Remodeling of E-Cadherin-Mediated Contacts via Cortical  Flows</i>. Institute of Science and Technology Austria, 2022, doi:<a href=\"https://doi.org/10.15479/at:ista:12153\">10.15479/at:ista:12153</a>.","short":"F.N. Arslan, Remodeling of E-Cadherin-Mediated Contacts via Cortical  Flows, Institute of Science and Technology Austria, 2022.","chicago":"Arslan, Feyza N. “Remodeling of E-Cadherin-Mediated Contacts via Cortical  Flows.” Institute of Science and Technology Austria, 2022. <a href=\"https://doi.org/10.15479/at:ista:12153\">https://doi.org/10.15479/at:ista:12153</a>.","ieee":"F. N. Arslan, “Remodeling of E-cadherin-mediated contacts via cortical  flows,” Institute of Science and Technology Austria, 2022.","apa":"Arslan, F. N. (2022). <i>Remodeling of E-cadherin-mediated contacts via cortical  flows</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:12153\">https://doi.org/10.15479/at:ista:12153</a>","ama":"Arslan FN. Remodeling of E-cadherin-mediated contacts via cortical  flows. 2022. doi:<a href=\"https://doi.org/10.15479/at:ista:12153\">10.15479/at:ista:12153</a>"},"date_updated":"2023-08-08T13:14:10Z","ddc":["570"],"article_processing_charge":"No","date_created":"2023-01-25T10:43:24Z","department":[{"_id":"GradSch"},{"_id":"CaHe"}],"publication_status":"published","alternative_title":["ISTA Thesis"],"title":"Remodeling of E-cadherin-mediated contacts via cortical  flows","_id":"12368","author":[{"id":"49DA7910-F248-11E8-B48F-1D18A9856A87","first_name":"Feyza N","last_name":"Arslan","orcid":"0000-0001-5809-9566","full_name":"Arslan, Feyza N"}],"publisher":"Institute of Science and Technology Austria","ec_funded":1,"page":"113","file_date_updated":"2023-01-25T10:52:46Z"},{"ddc":["570"],"degree_awarded":"PhD","doi":"10.15479/at:ista:12378","day":"11","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"}],"date_updated":"2023-08-04T09:40:37Z","year":"2022","citation":{"ista":"Colombo G. 2022. MorphOMICs, a tool for mapping microglial morphology, reveals brain region- and sex-dependent phenotypes. Institute of Science and Technology Austria.","short":"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>.","ieee":"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>.","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>","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>"},"publisher":"Institute of Science and Technology Austria","page":"142","ec_funded":1,"file_date_updated":"2023-04-12T22:30:03Z","publication_status":"published","date_created":"2023-01-25T14:27:43Z","department":[{"_id":"GradSch"},{"_id":"SaSi"}],"article_processing_charge":"No","alternative_title":["ISTA Thesis"],"title":"MorphOMICs, a tool for mapping microglial morphology, reveals brain region- and sex-dependent phenotypes","_id":"12378","author":[{"orcid":"0000-0001-9434-8902","full_name":"Colombo, Gloria","first_name":"Gloria","last_name":"Colombo","id":"3483CF6C-F248-11E8-B48F-1D18A9856A87"}],"file":[{"date_updated":"2023-04-12T22:30:03Z","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","file_name":"Gloria_Colombo_Thesis.docx","date_created":"2023-01-25T14:31:32Z","checksum":"8cd3ddfe9b53381dcf086023d8d8893a","file_size":23890382,"embargo_to":"open_access","file_id":"12379","creator":"cchlebak","access_level":"closed","relation":"source_file"},{"file_size":13802421,"checksum":"8af4319c18b516e8758e9a6cb02b103b","date_created":"2023-01-25T14:31:36Z","embargo":"2023-04-11","content_type":"application/pdf","file_name":"Gloria_Colombo_Thesis.pdf","date_updated":"2023-04-12T22:30:03Z","access_level":"open_access","relation":"main_file","creator":"cchlebak","file_id":"12380"}],"related_material":{"record":[{"id":"12244","relation":"part_of_dissertation","status":"public"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","publication_identifier":{"issn":["2663-337X"]},"supervisor":[{"full_name":"Siegert, Sandra","orcid":"0000-0001-8635-0877","last_name":"Siegert","first_name":"Sandra","id":"36ACD32E-F248-11E8-B48F-1D18A9856A87"}],"oa":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"date_published":"2022-11-11T00:00:00Z","type":"dissertation","language":[{"iso":"eng"}],"acknowledged_ssus":[{"_id":"PreCl"},{"_id":"Bio"},{"_id":"ScienComp"}],"oa_version":"Published Version","project":[{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"International IST Doctoral Program","grant_number":"665385"}],"month":"11","has_accepted_license":"1"},{"title":"Translation-invariant quantum systems with effectively broken symmetry","alternative_title":["ISTA Thesis"],"date_created":"2023-01-26T10:00:42Z","department":[{"_id":"GradSch"},{"_id":"RoSe"}],"article_processing_charge":"No","publication_status":"published","author":[{"first_name":"Morris","last_name":"Brooks","orcid":"0000-0002-6249-0928","full_name":"Brooks, Morris","id":"B7ECF9FC-AA38-11E9-AC9A-0930E6697425"}],"_id":"12390","publisher":"Institute of Science and Technology Austria","file_date_updated":"2023-01-26T10:02:42Z","ec_funded":1,"page":"196","abstract":[{"text":"The scope of this thesis is to study quantum systems exhibiting a continuous symmetry that\r\nis broken on the level of the corresponding effective theory. In particular we are going to\r\ninvestigate translation-invariant Bose gases in the mean field limit, effectively described by\r\nthe Hartree functional, and the Fröhlich Polaron in the regime of strong coupling, effectively\r\ndescribed by the Pekar functional. The latter is a model describing the interaction between a\r\ncharged particle and the optical modes of a polar crystal. Regarding the former, we assume in\r\naddition that the particles in the gas are unconfined, and typically we will consider particles\r\nthat are subject to an attractive interaction. In both cases the ground state energy of the\r\nHamiltonian is not a proper eigenvalue due to the underlying translation-invariance, while on\r\nthe contrary there exists a whole invariant orbit of minimizers for the corresponding effective\r\nfunctionals. Both, the absence of proper eigenstates and the broken symmetry of the effective\r\ntheory, make the study significantly more involved and it is the content of this thesis to\r\ndevelop a frameworks which allows for a systematic way to circumvent these issues.\r\nIt is a well-established result that the ground state energy of Bose gases in the mean field limit,\r\nas well as the ground state energy of the Fröhlich Polaron in the regime of strong coupling, is\r\nto leading order given by the minimal energy of the corresponding effective theory. As part\r\nof this thesis we identify the sub-leading term in the expansion of the ground state energy,\r\nwhich can be interpreted as the quantum correction to the classical energy, since the effective\r\ntheories under consideration can be seen as classical counterparts.\r\nWe are further going to establish an asymptotic expression for the energy-momentum relation\r\nof the Fröhlich Polaron in the strong coupling limit. In the regime of suitably small momenta,\r\nthis asymptotic expression agrees with the energy-momentum relation of a free particle having\r\nan effectively increased mass, and we find that this effectively increased mass agrees with the\r\nconjectured value in the physics literature.\r\nIn addition we will discuss two unrelated papers written by the author during his stay at ISTA\r\nin the appendix. The first one concerns the realization of anyons, which are quasi-particles\r\nacquiring a non-trivial phase under the exchange of two particles, as molecular impurities.\r\nThe second one provides a classification of those vector fields defined on a given manifold\r\nthat can be written as the gradient of a given functional with respect to a suitable metric,\r\nprovided that some mild smoothness assumptions hold. This classification is subsequently\r\nused to identify those quantum Markov semigroups that can be written as a gradient flow of\r\nthe relative entropy.\r\n","lang":"eng"}],"day":"15","degree_awarded":"PhD","doi":"10.15479/at:ista:12390","year":"2022","citation":{"short":"M. Brooks, Translation-Invariant Quantum Systems with Effectively Broken Symmetry, Institute of Science and Technology Austria, 2022.","mla":"Brooks, Morris. <i>Translation-Invariant Quantum Systems with Effectively Broken Symmetry</i>. Institute of Science and Technology Austria, 2022, doi:<a href=\"https://doi.org/10.15479/at:ista:12390\">10.15479/at:ista:12390</a>.","ista":"Brooks M. 2022. Translation-invariant quantum systems with effectively broken symmetry. Institute of Science and Technology Austria.","apa":"Brooks, M. (2022). <i>Translation-invariant quantum systems with effectively broken symmetry</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:12390\">https://doi.org/10.15479/at:ista:12390</a>","ama":"Brooks M. Translation-invariant quantum systems with effectively broken symmetry. 2022. doi:<a href=\"https://doi.org/10.15479/at:ista:12390\">10.15479/at:ista:12390</a>","ieee":"M. Brooks, “Translation-invariant quantum systems with effectively broken symmetry,” Institute of Science and Technology Austria, 2022.","chicago":"Brooks, Morris. “Translation-Invariant Quantum Systems with Effectively Broken Symmetry.” Institute of Science and Technology Austria, 2022. <a href=\"https://doi.org/10.15479/at:ista:12390\">https://doi.org/10.15479/at:ista:12390</a>."},"date_updated":"2023-08-07T13:32:09Z","ddc":["500"],"month":"12","project":[{"call_identifier":"H2020","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","name":"Analysis of quantum many-body systems","grant_number":"694227"}],"oa_version":"Published Version","has_accepted_license":"1","language":[{"iso":"eng"}],"oa":1,"supervisor":[{"id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","first_name":"Robert","last_name":"Seiringer","orcid":"0000-0002-6781-0521","full_name":"Seiringer, Robert"}],"publication_identifier":{"issn":["2663-337X"]},"type":"dissertation","date_published":"2022-12-15T00:00:00Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","image":"/images/cc_by_nc_sa.png","short":"CC BY-NC-SA (4.0)"},"related_material":{"record":[{"relation":"part_of_dissertation","id":"9005","status":"public"}]},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","status":"public","file":[{"file_size":3095225,"checksum":"b31460e937f33b557abb40ebef02b567","date_created":"2023-01-26T10:02:34Z","file_name":"Brooks_Thesis.pdf","content_type":"application/pdf","date_updated":"2023-01-26T10:02:34Z","success":1,"access_level":"open_access","relation":"main_file","creator":"cchlebak","file_id":"12391"},{"date_created":"2023-01-26T10:02:42Z","checksum":"9751869fa5e7981588ad4228f4fd4bd6","file_size":809842,"date_updated":"2023-01-26T10:02:42Z","file_name":"Brooks_Thesis.tex","content_type":"application/octet-stream","access_level":"closed","relation":"source_file","file_id":"12392","creator":"cchlebak"}]},{"related_material":{"record":[{"relation":"part_of_dissertation","id":"679","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"10703"},{"relation":"part_of_dissertation","id":"7885","status":"public"},{"relation":"part_of_dissertation","id":"9429","status":"public"}]},"status":"public","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","file":[{"access_level":"open_access","relation":"main_file","creator":"cchlebak","file_id":"12402","file_size":42059787,"checksum":"cc4a2b4a7e3c4ee8ef7f2dbf909b12bd","date_created":"2023-01-26T11:58:14Z","embargo":"2023-12-20","content_type":"application/pdf","file_name":"PhD-Thesis_Saren Tasciyan_formatted_aftercrash_fixed_600dpi_95pc_final_PDFA3b.pdf","date_updated":"2023-12-21T23:30:03Z"},{"date_updated":"2023-12-21T23:30:03Z","file_name":"Source Files - Saren Tasciyan - PhD Thesis.zip","content_type":"application/x-zip-compressed","date_created":"2023-01-26T12:00:10Z","embargo_to":"open_access","file_size":261256696,"checksum":"f1b4ca98b8ab0cb043b1830971e9bd9c","file_id":"12403","creator":"cchlebak","access_level":"closed","relation":"source_file"}],"oa":1,"supervisor":[{"first_name":"Michael K","last_name":"Sixt","orcid":"0000-0002-6620-9179","full_name":"Sixt, Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87"}],"publication_identifier":{"issn":["2663-337X"]},"type":"dissertation","date_published":"2022-12-22T00:00:00Z","language":[{"iso":"eng"}],"month":"12","oa_version":"Published Version","has_accepted_license":"1","ddc":["610"],"abstract":[{"lang":"eng","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."}],"day":"22","doi":"10.15479/at:ista:12401","degree_awarded":"PhD","citation":{"ista":"Tasciyan S. 2022. Role of microenvironment heterogeneity in cancer cell invasion. Institute of Science and Technology Austria.","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>.","short":"S. Tasciyan, Role of Microenvironment Heterogeneity in Cancer Cell Invasion, Institute of Science and Technology Austria, 2022.","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>.","ieee":"S. Tasciyan, “Role of microenvironment heterogeneity in cancer cell invasion,” Institute of Science and Technology Austria, 2022.","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>"},"year":"2022","date_updated":"2024-09-10T12:04:26Z","publisher":"Institute of Science and Technology Austria","file_date_updated":"2023-12-21T23:30:03Z","page":"105","alternative_title":["ISTA Thesis"],"title":"Role of microenvironment heterogeneity in cancer cell invasion","article_processing_charge":"No","date_created":"2023-01-26T11:55:16Z","department":[{"_id":"GradSch"},{"_id":"MiSi"}],"publication_status":"published","author":[{"orcid":"0000-0003-1671-393X","full_name":"Tasciyan, Saren","first_name":"Saren","last_name":"Tasciyan","id":"4323B49C-F248-11E8-B48F-1D18A9856A87"}],"_id":"12401"},{"language":[{"iso":"eng"}],"ec_funded":1,"author":[{"first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Mona","last_name":"Mohammadi","full_name":"Mohammadi, Mona","id":"4363614d-b686-11ed-a7d5-ac9e4a24bc2e"},{"id":"BD1DF4C4-D767-11E9-B658-BC13E6697425","full_name":"Saona Urmeneta, Raimundo J","orcid":"0000-0001-5103-038X","last_name":"Saona Urmeneta","first_name":"Raimundo J"}],"_id":"12677","publication":"arXiv","title":"Repeated prophet inequality with near-optimal bounds","month":"09","article_number":"2209.14368","oa_version":"Preprint","publication_status":"submitted","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"article_processing_charge":"No","date_created":"2023-02-24T12:21:40Z","project":[{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","acknowledgement":"This research was partially supported by the ERC CoG 863818 (ForM-SMArt) grant.","main_file_link":[{"open_access":"1","url":" https://doi.org/10.48550/arXiv.2209.14368"}],"date_published":"2022-09-28T00:00:00Z","external_id":{"arxiv":["2209.14368"]},"type":"preprint","date_updated":"2025-07-14T09:09:51Z","year":"2022","citation":{"ieee":"K. Chatterjee, M. Mohammadi, and R. J. Saona Urmeneta, “Repeated prophet inequality with near-optimal bounds,” <i>arXiv</i>. .","chicago":"Chatterjee, Krishnendu, Mona Mohammadi, and Raimundo J Saona Urmeneta. “Repeated Prophet Inequality with Near-Optimal Bounds.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/ARXIV.2209.14368\">https://doi.org/10.48550/ARXIV.2209.14368</a>.","apa":"Chatterjee, K., Mohammadi, M., &#38; Saona Urmeneta, R. J. (n.d.). Repeated prophet inequality with near-optimal bounds. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/ARXIV.2209.14368\">https://doi.org/10.48550/ARXIV.2209.14368</a>","ama":"Chatterjee K, Mohammadi M, Saona Urmeneta RJ. Repeated prophet inequality with near-optimal bounds. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/ARXIV.2209.14368\">10.48550/ARXIV.2209.14368</a>","ista":"Chatterjee K, Mohammadi M, Saona Urmeneta RJ. Repeated prophet inequality with near-optimal bounds. arXiv, 2209.14368.","mla":"Chatterjee, Krishnendu, et al. “Repeated Prophet Inequality with Near-Optimal Bounds.” <i>ArXiv</i>, 2209.14368, doi:<a href=\"https://doi.org/10.48550/ARXIV.2209.14368\">10.48550/ARXIV.2209.14368</a>.","short":"K. Chatterjee, M. Mohammadi, R.J. Saona Urmeneta, ArXiv (n.d.)."},"abstract":[{"text":"In modern sample-driven Prophet Inequality, an adversary chooses a sequence of n items with values v1,v2,…,vn to be presented to a decision maker (DM). The process follows in two phases. In the first phase (sampling phase), some items, possibly selected at random, are revealed to the DM, but she can never accept them. In the second phase, the DM is presented with the other items in a random order and online fashion. For each item, she must make an irrevocable decision to either accept the item and stop the process or reject the item forever and proceed to the next item. The goal of the DM is to maximize the expected value as compared to a Prophet (or offline algorithm) that has access to all information. In this setting, the sampling phase has no cost and is not part of the optimization process. However, in many scenarios, the samples are obtained as part of the decision-making process.\r\nWe model this aspect as a two-phase Prophet Inequality where an adversary chooses a sequence of 2n items with values v1,v2,…,v2n and the items are randomly ordered. Finally, there are two phases of the Prophet Inequality problem with the first n-items and the rest of the items, respectively. We show that some basic algorithms achieve a ratio of at most 0.450. We present an algorithm that achieves a ratio of at least 0.495. Finally, we show that for every algorithm the ratio it can achieve is at most 0.502. Hence our algorithm is near-optimal.","lang":"eng"}],"oa":1,"doi":"10.48550/ARXIV.2209.14368","arxiv":1,"day":"28"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","related_material":{"record":[{"id":"12732","relation":"dissertation_contains","status":"public"},{"status":"public","id":"14334","relation":"later_version"}]},"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2210.15607","open_access":"1"}],"external_id":{"arxiv":["2210.15607"]},"type":"preprint","date_published":"2022-11-07T00:00:00Z","citation":{"short":"P. Brighi, M. Ljubotina, M. Serbyn, ArXiv (n.d.).","mla":"Brighi, Pietro, et al. “Hilbert Space Fragmentation and Slow Dynamics in Particle-Conserving Quantum East Models.” <i>ArXiv</i>, 2210.15607, doi:<a href=\"https://doi.org/10.48550/arXiv.2210.15607\">10.48550/arXiv.2210.15607</a>.","ista":"Brighi P, Ljubotina M, Serbyn M. Hilbert space fragmentation and slow dynamics in particle-conserving quantum East models. arXiv, 2210.15607.","apa":"Brighi, P., Ljubotina, M., &#38; Serbyn, M. (n.d.). Hilbert space fragmentation and slow dynamics in particle-conserving quantum East models. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2210.15607\">https://doi.org/10.48550/arXiv.2210.15607</a>","ama":"Brighi P, Ljubotina M, Serbyn M. Hilbert space fragmentation and slow dynamics in particle-conserving quantum East models. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2210.15607\">10.48550/arXiv.2210.15607</a>","ieee":"P. Brighi, M. Ljubotina, and M. Serbyn, “Hilbert space fragmentation and slow dynamics in particle-conserving quantum East models,” <i>arXiv</i>. .","chicago":"Brighi, Pietro, Marko Ljubotina, and Maksym Serbyn. “Hilbert Space Fragmentation and Slow Dynamics in Particle-Conserving Quantum East Models.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2210.15607\">https://doi.org/10.48550/arXiv.2210.15607</a>."},"year":"2022","date_updated":"2023-09-20T10:46:29Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","image":"/images/cc_by_nc_sa.png","short":"CC BY-NC-SA (4.0)"},"oa":1,"abstract":[{"lang":"eng","text":"Quantum kinetically constrained models have recently attracted significant attention due to their anomalous dynamics and thermalization. In this work, we introduce a hitherto unexplored family of kinetically constrained models featuring a conserved particle number and strong inversion-symmetry breaking due to facilitated hopping. We demonstrate that these models provide a generic example of so-called quantum Hilbert space fragmentation, that is manifested in disconnected sectors in the Hilbert space that are not apparent in the computational basis. Quantum Hilbert space fragmentation leads to an exponential in system size number of eigenstates with exactly zero entanglement entropy across several bipartite cuts. These eigenstates can be probed dynamically using quenches from simple initial product states. In addition, we study the particle spreading under unitary dynamics launched from the domain wall state, and find faster than diffusive dynamics at high particle densities, that crosses over into logarithmically slow relaxation at smaller densities. Using a classically simulable cellular automaton, we reproduce the logarithmic dynamics observed in the quantum case. Our work suggests that particle conserving constrained models with inversion symmetry breaking realize so far unexplored universality classes of dynamics and invite their further theoretical and experimental studies."}],"day":"07","arxiv":1,"doi":"10.48550/arXiv.2210.15607","language":[{"iso":"eng"}],"author":[{"id":"4115AF5C-F248-11E8-B48F-1D18A9856A87","last_name":"Brighi","first_name":"Pietro","full_name":"Brighi, Pietro","orcid":"0000-0002-7969-2729"},{"id":"F75EE9BE-5C90-11EA-905D-16643DDC885E","last_name":"Ljubotina","first_name":"Marko","full_name":"Ljubotina, Marko","orcid":"0000-0003-0038-7068"},{"first_name":"Maksym","last_name":"Serbyn","orcid":"0000-0002-2399-5827","full_name":"Serbyn, Maksym","id":"47809E7E-F248-11E8-B48F-1D18A9856A87"}],"_id":"12750","publication":"arXiv","article_number":"2210.15607","month":"11","title":"Hilbert space fragmentation and slow dynamics in particle-conserving quantum East models","date_created":"2023-03-23T14:33:13Z","department":[{"_id":"GradSch"},{"_id":"MaSe"}],"article_processing_charge":"No","publication_status":"submitted","oa_version":"Preprint"},{"author":[{"last_name":"Bombari","first_name":"Simone","full_name":"Bombari, Simone","id":"ca726dda-de17-11ea-bc14-f9da834f63aa"},{"full_name":"Achille, Alessandro","last_name":"Achille","first_name":"Alessandro"},{"first_name":"Zijian","last_name":"Wang","full_name":"Wang, Zijian"},{"last_name":"Wang","first_name":"Yu-Xiang","full_name":"Wang, Yu-Xiang"},{"full_name":"Xie, Yusheng","last_name":"Xie","first_name":"Yusheng"},{"full_name":"Singh, Kunwar Yashraj","last_name":"Singh","first_name":"Kunwar Yashraj"},{"first_name":"Srikar","last_name":"Appalaraju","full_name":"Appalaraju, Srikar"},{"first_name":"Vijay","last_name":"Mahadevan","full_name":"Mahadevan, Vijay"},{"last_name":"Soatto","first_name":"Stefano","full_name":"Soatto, Stefano"}],"publication":"arXiv","_id":"12860","article_number":"2203.16701","month":"03","title":"Towards differential relational privacy and its use in question answering","department":[{"_id":"GradSch"},{"_id":"MaMo"}],"date_created":"2023-04-23T16:11:48Z","article_processing_charge":"No","oa_version":"Preprint","publication_status":"submitted","language":[{"iso":"eng"}],"type":"preprint","external_id":{"arxiv":["2203.16701"]},"date_published":"2022-03-30T00:00:00Z","year":"2022","citation":{"mla":"Bombari, Simone, et al. “Towards Differential Relational Privacy and Its Use in Question Answering.” <i>ArXiv</i>, 2203.16701, doi:<a href=\"https://doi.org/10.48550/arXiv.2203.16701\">10.48550/arXiv.2203.16701</a>.","short":"S. Bombari, A. Achille, Z. Wang, Y.-X. Wang, Y. Xie, K.Y. Singh, S. Appalaraju, V. Mahadevan, S. Soatto, ArXiv (n.d.).","ista":"Bombari S, Achille A, Wang Z, Wang Y-X, Xie Y, Singh KY, Appalaraju S, Mahadevan V, Soatto S. Towards differential relational privacy and its use in question answering. arXiv, 2203.16701.","ama":"Bombari S, Achille A, Wang Z, et al. Towards differential relational privacy and its use in question answering. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2203.16701\">10.48550/arXiv.2203.16701</a>","apa":"Bombari, S., Achille, A., Wang, Z., Wang, Y.-X., Xie, Y., Singh, K. Y., … Soatto, S. (n.d.). Towards differential relational privacy and its use in question answering. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2203.16701\">https://doi.org/10.48550/arXiv.2203.16701</a>","chicago":"Bombari, Simone, Alessandro Achille, Zijian Wang, Yu-Xiang Wang, Yusheng Xie, Kunwar Yashraj Singh, Srikar Appalaraju, Vijay Mahadevan, and Stefano Soatto. “Towards Differential Relational Privacy and Its Use in Question Answering.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2203.16701\">https://doi.org/10.48550/arXiv.2203.16701</a>.","ieee":"S. Bombari <i>et al.</i>, “Towards differential relational privacy and its use in question answering,” <i>arXiv</i>. ."},"date_updated":"2023-04-25T07:34:49Z","oa":1,"abstract":[{"lang":"eng","text":"Memorization of the relation between entities in a dataset can lead to privacy issues when using a trained model for question answering. We introduce Relational Memorization (RM) to understand, quantify and control this phenomenon. While bounding general memorization can have detrimental effects on the performance of a trained model, bounding RM does not prevent effective learning. The difference is most pronounced when the data distribution is long-tailed, with many queries having only few training examples: Impeding general memorization prevents effective learning, while impeding only relational memorization still allows learning general properties of the underlying concepts. We formalize the notion of Relational Privacy (RP) and, inspired by Differential Privacy (DP), we provide a possible definition of Differential Relational Privacy (DrP). These notions can be used to describe and compute bounds on the amount of RM in a trained model. We illustrate Relational Privacy concepts in experiments with large-scale models for Question Answering."}],"day":"30","arxiv":1,"doi":"10.48550/arXiv.2203.16701","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2203.16701"}]},{"ddc":["000"],"volume":35,"acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein\r\nAward), ERC CoG 863818 (FoRM-SMArt), and the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385.\r\n","abstract":[{"lang":"eng","text":"Formal verification of neural networks is an active topic of research, and recent advances have significantly increased the size of the networks that verification tools can handle. However, most methods are designed for verification of an idealized model of the actual network which works over real arithmetic and ignores rounding imprecisions. This idealization is in stark contrast to network quantization, which is a technique that trades numerical precision for computational efficiency and is, therefore, often applied in practice. Neglecting rounding errors of such low-bit quantized neural networks has been shown to lead to wrong conclusions about the network’s correctness. Thus, the desired approach for verifying quantized neural networks would be one that takes these rounding errors\r\ninto account. In this paper, we show that verifying the bitexact implementation of quantized neural networks with bitvector specifications is PSPACE-hard, even though verifying idealized real-valued networks and satisfiability of bit-vector specifications alone are each in NP. Furthermore, we explore several practical heuristics toward closing the complexity gap between idealized and bit-exact verification. In particular, we propose three techniques for making SMT-based verification of quantized neural networks more scalable. Our experiments demonstrate that our proposed methods allow a speedup of up to three orders of magnitude over existing approaches."}],"arxiv":1,"day":"28","external_id":{"arxiv":["2012.08185"]},"date_updated":"2025-07-14T09:10:11Z","citation":{"ista":"Henzinger TA, Lechner M, Zikelic D. 2021. Scalable verification of quantized neural networks. Proceedings of the AAAI Conference on Artificial Intelligence. AAAI: Association for the Advancement of Artificial Intelligence, Technical Tracks, vol. 35, 3787–3795.","mla":"Henzinger, Thomas A., et al. “Scalable Verification of Quantized Neural Networks.” <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, vol. 35, no. 5A, AAAI Press, 2021, pp. 3787–95.","short":"T.A. Henzinger, M. Lechner, D. Zikelic, in:, Proceedings of the AAAI Conference on Artificial Intelligence, AAAI Press, 2021, pp. 3787–3795.","ieee":"T. A. Henzinger, M. Lechner, and D. Zikelic, “Scalable verification of quantized neural networks,” in <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, Virtual, 2021, vol. 35, no. 5A, pp. 3787–3795.","chicago":"Henzinger, Thomas A, Mathias Lechner, and Dorde Zikelic. “Scalable Verification of Quantized Neural Networks.” In <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, 35:3787–95. AAAI Press, 2021.","apa":"Henzinger, T. A., Lechner, M., &#38; Zikelic, D. (2021). Scalable verification of quantized neural networks. In <i>Proceedings of the AAAI Conference on Artificial Intelligence</i> (Vol. 35, pp. 3787–3795). Virtual: AAAI Press.","ama":"Henzinger TA, Lechner M, Zikelic D. Scalable verification of quantized neural networks. In: <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>. Vol 35. AAAI Press; 2021:3787-3795."},"year":"2021","publisher":"AAAI Press","file_date_updated":"2022-01-26T07:41:16Z","page":"3787-3795","ec_funded":1,"quality_controlled":"1","title":"Scalable verification of quantized neural networks","alternative_title":["Technical Tracks"],"intvolume":"        35","publication_status":"published","date_created":"2022-01-25T15:15:02Z","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"article_processing_charge":"No","author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","last_name":"Henzinger","first_name":"Thomas A"},{"id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias","last_name":"Lechner","first_name":"Mathias"},{"id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","full_name":"Zikelic, Dorde","orcid":"0000-0002-4681-1699","last_name":"Zikelic","first_name":"Dorde"}],"issue":"5A","_id":"10665","scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"11362"}]},"file":[{"success":1,"access_level":"open_access","relation":"main_file","creator":"mlechner","file_id":"10684","file_size":137235,"checksum":"2bc8155b2526a70fba5b7301bc89dbd1","date_created":"2022-01-26T07:41:16Z","content_type":"application/pdf","file_name":"16496-Article Text-19990-1-2-20210518 (1).pdf","date_updated":"2022-01-26T07:41:16Z"}],"main_file_link":[{"open_access":"1","url":"https://ojs.aaai.org/index.php/AAAI/article/view/16496"}],"oa":1,"publication_identifier":{"eissn":["2374-3468"],"issn":["2159-5399"],"isbn":["978-1-57735-866-4"]},"date_published":"2021-05-28T00:00:00Z","type":"conference","conference":{"end_date":"2021-02-09","location":"Virtual","name":"AAAI: Association for the Advancement of Artificial Intelligence","start_date":"2021-02-02"},"language":[{"iso":"eng"}],"month":"05","oa_version":"Published Version","project":[{"grant_number":"665385","name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"},{"grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"}],"publication":"Proceedings of the AAAI Conference on Artificial Intelligence","has_accepted_license":"1"},{"isi":1,"external_id":{"isi":["000765738803040"],"arxiv":["2103.08187"]},"date_updated":"2023-08-17T06:58:38Z","year":"2021","citation":{"apa":"Lechner, M., Hasani, R., Grosu, R., Rus, D., &#38; Henzinger, T. A. (2021). Adversarial training is not ready for robot learning. In <i>2021 IEEE International Conference on Robotics and Automation</i> (pp. 4140–4147). Xi’an, China. <a href=\"https://doi.org/10.1109/ICRA48506.2021.9561036\">https://doi.org/10.1109/ICRA48506.2021.9561036</a>","ama":"Lechner M, Hasani R, Grosu R, Rus D, Henzinger TA. Adversarial training is not ready for robot learning. In: <i>2021 IEEE International Conference on Robotics and Automation</i>. ICRA. ; 2021:4140-4147. doi:<a href=\"https://doi.org/10.1109/ICRA48506.2021.9561036\">10.1109/ICRA48506.2021.9561036</a>","chicago":"Lechner, Mathias, Ramin Hasani, Radu Grosu, Daniela Rus, and Thomas A Henzinger. “Adversarial Training Is Not Ready for Robot Learning.” In <i>2021 IEEE International Conference on Robotics and Automation</i>, 4140–47. ICRA, 2021. <a href=\"https://doi.org/10.1109/ICRA48506.2021.9561036\">https://doi.org/10.1109/ICRA48506.2021.9561036</a>.","ieee":"M. Lechner, R. Hasani, R. Grosu, D. Rus, and T. A. Henzinger, “Adversarial training is not ready for robot learning,” in <i>2021 IEEE International Conference on Robotics and Automation</i>, Xi’an, China, 2021, pp. 4140–4147.","short":"M. Lechner, R. Hasani, R. Grosu, D. Rus, T.A. Henzinger, in:, 2021 IEEE International Conference on Robotics and Automation, 2021, pp. 4140–4147.","mla":"Lechner, Mathias, et al. “Adversarial Training Is Not Ready for Robot Learning.” <i>2021 IEEE International Conference on Robotics and Automation</i>, 2021, pp. 4140–47, doi:<a href=\"https://doi.org/10.1109/ICRA48506.2021.9561036\">10.1109/ICRA48506.2021.9561036</a>.","ista":"Lechner M, Hasani R, Grosu R, Rus D, Henzinger TA. 2021. Adversarial training is not ready for robot learning. 2021 IEEE International Conference on Robotics and Automation. ICRA: International Conference on Robotics and AutomationICRA, 4140–4147."},"abstract":[{"lang":"eng","text":"Adversarial training is an effective method to train deep learning models that are resilient to norm-bounded perturbations, with the cost of nominal performance drop. While adversarial training appears to enhance the robustness and safety of a deep model deployed in open-world decision-critical applications, counterintuitively, it induces undesired behaviors in robot learning settings. In this paper, we show theoretically and experimentally that neural controllers obtained via adversarial training are subjected to three types of defects, namely transient, systematic, and conditional errors. We first generalize adversarial training to a safety-domain optimization scheme allowing for more generic specifications. We then prove that such a learning process tends to cause certain error profiles. We support our theoretical results by a thorough experimental safety analysis in a robot-learning task. Our results suggest that adversarial training is not yet ready for robot learning."}],"arxiv":1,"doi":"10.1109/ICRA48506.2021.9561036","ddc":["000"],"acknowledgement":"M.L. and T.A.H. are supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). R.H. and D.R. are supported by Boeing and R.G. by Horizon-2020 ECSEL Project grant no. 783163 (iDev40).","author":[{"id":"3DC22916-F248-11E8-B48F-1D18A9856A87","last_name":"Lechner","first_name":"Mathias","full_name":"Lechner, Mathias"},{"last_name":"Hasani","first_name":"Ramin","full_name":"Hasani, Ramin"},{"full_name":"Grosu, Radu","first_name":"Radu","last_name":"Grosu"},{"full_name":"Rus, Daniela","first_name":"Daniela","last_name":"Rus"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","last_name":"Henzinger","first_name":"Thomas A"}],"_id":"10666","license":"https://creativecommons.org/licenses/by-nc-nd/3.0/","title":"Adversarial training is not ready for robot learning","publication_status":"published","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"date_created":"2022-01-25T15:44:54Z","article_processing_charge":"No","page":"4140-4147","series_title":"ICRA","quality_controlled":"1","date_published":"2021-01-01T00:00:00Z","type":"conference","tmp":{"short":"CC BY-NC-ND (3.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode"},"oa":1,"publication_identifier":{"isbn":["978-1-7281-9078-5"],"eisbn":["978-1-7281-9077-8"],"issn":["1050-4729"],"eissn":["2577-087X"]},"related_material":{"record":[{"id":"11362","relation":"dissertation_contains","status":"public"}]},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","status":"public","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2103.08187"}],"publication":"2021 IEEE International Conference on Robotics and Automation","has_accepted_license":"1","oa_version":"None","project":[{"grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"language":[{"iso":"eng"}],"conference":{"name":"ICRA: International Conference on Robotics and Automation","start_date":"2021-05-30","end_date":"2021-06-05","location":"Xi'an, China"}},{"date_updated":"2025-07-14T09:10:12Z","citation":{"mla":"Lechner, Mathias, et al. “Infinite Time Horizon Safety of Bayesian Neural Networks.” <i>35th Conference on Neural Information Processing Systems</i>, 2021, doi:<a href=\"https://doi.org/10.48550/arXiv.2111.03165\">10.48550/arXiv.2111.03165</a>.","short":"M. Lechner, Ð. Žikelić, K. Chatterjee, T.A. Henzinger, in:, 35th Conference on Neural Information Processing Systems, 2021.","ista":"Lechner M, Žikelić Ð, Chatterjee K, Henzinger TA. 2021. Infinite time horizon safety of Bayesian neural networks. 35th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems,  Advances in Neural Information Processing Systems, .","ama":"Lechner M, Žikelić Ð, Chatterjee K, Henzinger TA. Infinite time horizon safety of Bayesian neural networks. In: <i>35th Conference on Neural Information Processing Systems</i>. ; 2021. doi:<a href=\"https://doi.org/10.48550/arXiv.2111.03165\">10.48550/arXiv.2111.03165</a>","apa":"Lechner, M., Žikelić, Ð., Chatterjee, K., &#38; Henzinger, T. A. (2021). Infinite time horizon safety of Bayesian neural networks. In <i>35th Conference on Neural Information Processing Systems</i>. Virtual. <a href=\"https://doi.org/10.48550/arXiv.2111.03165\">https://doi.org/10.48550/arXiv.2111.03165</a>","chicago":"Lechner, Mathias, Ðorđe Žikelić, Krishnendu Chatterjee, and Thomas A Henzinger. “Infinite Time Horizon Safety of Bayesian Neural Networks.” In <i>35th Conference on Neural Information Processing Systems</i>, 2021. <a href=\"https://doi.org/10.48550/arXiv.2111.03165\">https://doi.org/10.48550/arXiv.2111.03165</a>.","ieee":"M. Lechner, Ð. Žikelić, K. Chatterjee, and T. A. Henzinger, “Infinite time horizon safety of Bayesian neural networks,” in <i>35th Conference on Neural Information Processing Systems</i>, Virtual, 2021."},"year":"2021","external_id":{"arxiv":["2111.03165"]},"doi":"10.48550/arXiv.2111.03165","arxiv":1,"day":"01","abstract":[{"text":"Bayesian neural networks (BNNs) place distributions over the weights of a neural network to model uncertainty in the data and the network's prediction. We consider the problem of verifying safety when running a Bayesian neural network policy in a feedback loop with infinite time horizon systems. Compared to the existing sampling-based approaches, which are inapplicable to the infinite time horizon setting, we train a separate deterministic neural network that serves as an infinite time horizon safety certificate. In particular, we show that the certificate network guarantees the safety of the system over a subset of the BNN weight posterior's support. Our method first computes a safe weight set and then alters the BNN's weight posterior to reject samples outside this set. Moreover, we show how to extend our approach to a safe-exploration reinforcement learning setting, in order to avoid unsafe trajectories during the training of the policy. We evaluate our approach on a series of reinforcement learning benchmarks, including non-Lyapunovian safety specifications.","lang":"eng"}],"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 the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385.","ddc":["000"],"_id":"10667","author":[{"id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias","last_name":"Lechner","first_name":"Mathias"},{"last_name":"Žikelić","first_name":"Ðorđe","full_name":"Žikelić, Ðorđe"},{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"publication_status":"published","article_processing_charge":"No","department":[{"_id":"GradSch"},{"_id":"ToHe"},{"_id":"KrCh"}],"date_created":"2022-01-25T15:45:58Z","alternative_title":[" Advances in Neural Information Processing Systems"],"title":"Infinite time horizon safety of Bayesian neural networks","quality_controlled":"1","ec_funded":1,"file_date_updated":"2022-01-26T07:39:59Z","tmp":{"short":"CC BY-NC-ND (3.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode"},"date_published":"2021-12-01T00:00:00Z","type":"conference","oa":1,"file":[{"relation":"main_file","success":1,"access_level":"open_access","creator":"mlechner","file_id":"10682","checksum":"0fc0f852525c10dda9cc9ffea07fb4e4","file_size":452492,"date_created":"2022-01-26T07:39:59Z","content_type":"application/pdf","file_name":"infinite_time_horizon_safety_o.pdf","date_updated":"2022-01-26T07:39:59Z"}],"main_file_link":[{"url":"https://proceedings.neurips.cc/paper/2021/hash/544defa9fddff50c53b71c43e0da72be-Abstract.html","open_access":"1"}],"status":"public","user_id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"relation":"dissertation_contains","id":"11362","status":"public"}]},"publication":"35th Conference on Neural Information Processing Systems","has_accepted_license":"1","oa_version":"Published Version","project":[{"grant_number":"665385","name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications"},{"grant_number":"Z211","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"month":"12","language":[{"iso":"eng"}],"conference":{"location":"Virtual","end_date":"2021-12-10","name":"NeurIPS: Neural Information Processing Systems","start_date":"2021-12-06"}}]