--- _id: '12305' abstract: - lang: eng text: This paper is concerned with the sharp interface limit for the Allen--Cahn equation with a nonlinear Robin boundary condition in a bounded smooth domain Ω⊂\R2. We assume that a diffuse interface already has developed and that it is in contact with the boundary ∂Ω. The boundary condition is designed in such a way that the limit problem is given by the mean curvature flow with constant α-contact angle. For α close to 90° we prove a local in time convergence result for well-prepared initial data for times when a smooth solution to the limit problem exists. Based on the latter we construct a suitable curvilinear coordinate system and carry out a rigorous asymptotic expansion for the Allen--Cahn equation with the nonlinear Robin boundary condition. Moreover, we show a spectral estimate for the corresponding linearized Allen--Cahn operator and with its aid we derive strong norm estimates for the difference of the exact and approximate solutions using a Gronwall-type argument. article_processing_charge: No article_type: original arxiv: 1 author: - first_name: Helmut full_name: Abels, Helmut last_name: Abels - first_name: Maximilian full_name: Moser, Maximilian id: a60047a9-da77-11eb-85b4-c4dc385ebb8c last_name: Moser citation: ama: Abels H, Moser M. Convergence of the Allen--Cahn equation with a nonlinear Robin boundary condition to mean curvature flow with contact angle close to 90°. SIAM Journal on Mathematical Analysis. 2022;54(1):114-172. doi:10.1137/21m1424925 apa: Abels, H., & Moser, M. (2022). Convergence of the Allen--Cahn equation with a nonlinear Robin boundary condition to mean curvature flow with contact angle close to 90°. SIAM Journal on Mathematical Analysis. Society for Industrial and Applied Mathematics. https://doi.org/10.1137/21m1424925 chicago: Abels, Helmut, and Maximilian Moser. “Convergence of the Allen--Cahn Equation with a Nonlinear Robin Boundary Condition to Mean Curvature Flow with Contact Angle Close to 90°.” SIAM Journal on Mathematical Analysis. Society for Industrial and Applied Mathematics, 2022. https://doi.org/10.1137/21m1424925. ieee: H. Abels and M. Moser, “Convergence of the Allen--Cahn equation with a nonlinear Robin boundary condition to mean curvature flow with contact angle close to 90°,” SIAM Journal on Mathematical Analysis, vol. 54, no. 1. Society for Industrial and Applied Mathematics, pp. 114–172, 2022. ista: Abels H, Moser M. 2022. Convergence of the Allen--Cahn equation with a nonlinear Robin boundary condition to mean curvature flow with contact angle close to 90°. SIAM Journal on Mathematical Analysis. 54(1), 114–172. mla: Abels, Helmut, and Maximilian Moser. “Convergence of the Allen--Cahn Equation with a Nonlinear Robin Boundary Condition to Mean Curvature Flow with Contact Angle Close to 90°.” SIAM Journal on Mathematical Analysis, vol. 54, no. 1, Society for Industrial and Applied Mathematics, 2022, pp. 114–72, doi:10.1137/21m1424925. short: H. Abels, M. Moser, SIAM Journal on Mathematical Analysis 54 (2022) 114–172. date_created: 2023-01-16T10:07:00Z date_published: 2022-01-04T00:00:00Z date_updated: 2023-08-04T10:34:56Z day: '04' department: - _id: JuFi doi: 10.1137/21m1424925 external_id: arxiv: - '2105.08434' isi: - '000762768000004' intvolume: ' 54' isi: 1 issue: '1' keyword: - Applied Mathematics - Computational Mathematics - Analysis language: - iso: eng main_file_link: - open_access: '1' url: ' https://doi.org/10.48550/arXiv.2105.08434' month: '01' oa: 1 oa_version: Preprint page: 114-172 publication: SIAM Journal on Mathematical Analysis publication_identifier: eissn: - 1095-7154 issn: - 0036-1410 publication_status: published publisher: Society for Industrial and Applied Mathematics quality_controlled: '1' scopus_import: '1' status: public title: Convergence of the Allen--Cahn equation with a nonlinear Robin boundary condition to mean curvature flow with contact angle close to 90° type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 54 year: '2022' ... --- _id: '12307' abstract: - lang: eng 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. article_processing_charge: No article_type: original author: - first_name: Barbara A. full_name: Shipman, Barbara A. last_name: Shipman - first_name: Elizabeth R full_name: Stephenson, Elizabeth R id: 2D04F932-F248-11E8-B48F-1D18A9856A87 last_name: Stephenson orcid: 0000-0002-6862-208X citation: ama: Shipman BA, Stephenson ER. Tangible topology through the lens of limits. PRIMUS. 2022;32(5):593-609. doi:10.1080/10511970.2021.1872750 apa: Shipman, B. A., & Stephenson, E. R. (2022). Tangible topology through the lens of limits. PRIMUS. Taylor & Francis. https://doi.org/10.1080/10511970.2021.1872750 chicago: Shipman, Barbara A., and Elizabeth R Stephenson. “Tangible Topology through the Lens of Limits.” PRIMUS. Taylor & Francis, 2022. https://doi.org/10.1080/10511970.2021.1872750. ieee: B. A. Shipman and E. R. Stephenson, “Tangible topology through the lens of limits,” PRIMUS, vol. 32, no. 5. Taylor & Francis, pp. 593–609, 2022. 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.” PRIMUS, vol. 32, no. 5, Taylor & Francis, 2022, pp. 593–609, doi:10.1080/10511970.2021.1872750. short: B.A. Shipman, E.R. Stephenson, PRIMUS 32 (2022) 593–609. date_created: 2023-01-16T10:07:21Z date_published: 2022-05-28T00:00:00Z date_updated: 2023-01-30T13:02:30Z day: '28' department: - _id: HeEd - _id: GradSch doi: 10.1080/10511970.2021.1872750 intvolume: ' 32' issue: '5' keyword: - Education - General Mathematics language: - iso: eng month: '05' oa_version: None page: 593-609 publication: PRIMUS publication_identifier: eissn: - 1935-4053 issn: - 1051-1970 publication_status: published publisher: Taylor & Francis quality_controlled: '1' scopus_import: '1' status: public title: Tangible topology through the lens of limits type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 32 year: '2022' ... --- _id: '12332' abstract: - lang: eng text: Activity of sensory neurons is driven not only by external stimuli but also by feedback signals from higher brain areas. Attention is one particularly important internal signal whose presumed role is to modulate sensory representations such that they only encode information currently relevant to the organism at minimal cost. This hypothesis has, however, not yet been expressed in a normative computational framework. Here, by building on normative principles of probabilistic inference and efficient coding, we developed a model of dynamic population coding in the visual cortex. By continuously adapting the sensory code to changing demands of the perceptual observer, an attention-like modulation emerges. This modulation can dramatically reduce the amount of neural activity without deteriorating the accuracy of task-specific inferences. Our results suggest that a range of seemingly disparate cortical phenomena such as intrinsic gain modulation, attention-related tuning modulation, and response variability could be manifestations of the same underlying principles, which combine efficient sensory coding with optimal probabilistic inference in dynamic environments. acknowledgement: "We thank Robbe Goris for generously providing figures from his work and Ann M. Hermundstad for helpful discussions.\r\nGT & WM were supported by the Austrian Science Fund Standalone Grant P 34015 \"Efficient Coding with Biophysical Realism\" (https://pf.fwf.ac.at/) WM was additionally supported by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 754411 (https://ec.europa.eu/research/mariecurieactions/). The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript." article_processing_charge: No article_type: original author: - first_name: Wiktor F full_name: Mlynarski, Wiktor F id: 358A453A-F248-11E8-B48F-1D18A9856A87 last_name: Mlynarski - first_name: Gašper full_name: Tkačik, Gašper id: 3D494DCA-F248-11E8-B48F-1D18A9856A87 last_name: Tkačik orcid: '1' citation: ama: Mlynarski WF, Tkačik G. Efficient coding theory of dynamic attentional modulation. PLoS Biology. 2022;20(12):e3001889. doi:10.1371/journal.pbio.3001889 apa: Mlynarski, W. F., & Tkačik, G. (2022). Efficient coding theory of dynamic attentional modulation. PLoS Biology. Public Library of Science. https://doi.org/10.1371/journal.pbio.3001889 chicago: Mlynarski, Wiktor F, and Gašper Tkačik. “Efficient Coding Theory of Dynamic Attentional Modulation.” PLoS Biology. Public Library of Science, 2022. https://doi.org/10.1371/journal.pbio.3001889. ieee: W. F. Mlynarski and G. Tkačik, “Efficient coding theory of dynamic attentional modulation,” PLoS Biology, vol. 20, no. 12. Public Library of Science, p. e3001889, 2022. ista: Mlynarski WF, Tkačik G. 2022. Efficient coding theory of dynamic attentional modulation. PLoS Biology. 20(12), e3001889. mla: Mlynarski, Wiktor F., and Gašper Tkačik. “Efficient Coding Theory of Dynamic Attentional Modulation.” PLoS Biology, vol. 20, no. 12, Public Library of Science, 2022, p. e3001889, doi:10.1371/journal.pbio.3001889. short: W.F. Mlynarski, G. Tkačik, PLoS Biology 20 (2022) e3001889. date_created: 2023-01-22T23:00:55Z date_published: 2022-12-21T00:00:00Z date_updated: 2023-08-03T14:23:49Z day: '21' ddc: - '570' department: - _id: GaTk doi: 10.1371/journal.pbio.3001889 ec_funded: 1 external_id: isi: - '000925192000001' file: - access_level: open_access checksum: 5d7f1111a87e5f2c1bf92f8886738894 content_type: application/pdf creator: dernst date_created: 2023-01-23T08:46:40Z date_updated: 2023-01-23T08:46:40Z file_id: '12337' file_name: 2022_PloSBiology_Mlynarski.pdf file_size: 4248838 relation: main_file success: 1 file_date_updated: 2023-01-23T08:46:40Z has_accepted_license: '1' intvolume: ' 20' isi: 1 issue: '12' language: - iso: eng license: https://creativecommons.org/licenses/by/4.0/ month: '12' oa: 1 oa_version: Published Version page: e3001889 project: - _id: 626c45b5-2b32-11ec-9570-e509828c1ba6 grant_number: P34015 name: Efficient coding with biophysical realism - _id: 260C2330-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '754411' name: ISTplus - Postdoctoral Fellowships publication: PLoS Biology publication_identifier: eissn: - 1545-7885 publication_status: published publisher: Public Library of Science quality_controlled: '1' scopus_import: '1' status: public title: Efficient coding theory of dynamic attentional modulation tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 20 year: '2022' ... --- _id: '12333' abstract: - lang: eng text: Together, copy-number and point mutations form the basis for most evolutionary novelty, through the process of gene duplication and divergence. While a plethora of genomic data reveals the long-term fate of diverging coding sequences and their cis-regulatory elements, little is known about the early dynamics around the duplication event itself. In microorganisms, selection for increased gene expression often drives the expansion of gene copy-number mutations, which serves as a crude adaptation, prior to divergence through refining point mutations. Using a simple synthetic genetic reporter system that can distinguish between copy-number and point mutations, we study their early and transient adaptive dynamics in real time in Escherichia coli. We find two qualitatively different routes of adaptation, depending on the level of functional improvement needed. In conditions of high gene expression demand, the two mutation types occur as a combination. However, under low gene expression demand, copy-number and point mutations are mutually exclusive; here, owing to their higher frequency, adaptation is dominated by copy-number mutations, in a process we term amplification hindrance. Ultimately, due to high reversal rates and pleiotropic cost, copy-number mutations may not only serve as a crude and transient adaptation, but also constrain sequence divergence over evolutionary time scales. acknowledgement: "We are grateful to N Barton, F Kondrashov, M Lagator, M Pleska, R Roemhild, D Siekhaus, and G\r\nTkacik for input on the manuscript and to K Tomasek for help with flow cytometry." article_number: e82240 article_processing_charge: No article_type: original author: - first_name: Isabella full_name: Tomanek, Isabella id: 3981F020-F248-11E8-B48F-1D18A9856A87 last_name: Tomanek orcid: 0000-0001-6197-363X - first_name: Calin C full_name: Guet, Calin C id: 47F8433E-F248-11E8-B48F-1D18A9856A87 last_name: Guet orcid: 0000-0001-6220-2052 citation: ama: Tomanek I, Guet CC. Adaptation dynamics between copynumber and point mutations. eLife. 2022;11. doi:10.7554/ELIFE.82240 apa: Tomanek, I., & Guet, C. C. (2022). Adaptation dynamics between copynumber and point mutations. ELife. eLife Sciences Publications. https://doi.org/10.7554/ELIFE.82240 chicago: Tomanek, Isabella, and Calin C Guet. “Adaptation Dynamics between Copynumber and Point Mutations.” ELife. eLife Sciences Publications, 2022. https://doi.org/10.7554/ELIFE.82240. ieee: I. Tomanek and C. C. Guet, “Adaptation dynamics between copynumber and point mutations,” eLife, vol. 11. eLife Sciences Publications, 2022. ista: Tomanek I, Guet CC. 2022. Adaptation dynamics between copynumber and point mutations. eLife. 11, e82240. mla: Tomanek, Isabella, and Calin C. Guet. “Adaptation Dynamics between Copynumber and Point Mutations.” ELife, vol. 11, e82240, eLife Sciences Publications, 2022, doi:10.7554/ELIFE.82240. short: I. Tomanek, C.C. Guet, ELife 11 (2022). date_created: 2023-01-22T23:00:55Z date_published: 2022-12-22T00:00:00Z date_updated: 2023-08-03T14:23:07Z day: '22' ddc: - '570' department: - _id: CaGu doi: 10.7554/ELIFE.82240 external_id: isi: - '000912674700001' file: - access_level: open_access checksum: 9321fd5f06ff59d5e2d33daee84b3da1 content_type: application/pdf creator: dernst date_created: 2023-01-23T08:56:21Z date_updated: 2023-01-23T08:56:21Z file_id: '12338' file_name: 2022_eLife_Tomanek.pdf file_size: 8835954 relation: main_file success: 1 file_date_updated: 2023-01-23T08:56:21Z has_accepted_license: '1' intvolume: ' 11' isi: 1 language: - iso: eng month: '12' oa: 1 oa_version: Published Version publication: eLife publication_identifier: eissn: - 2050-084X publication_status: published publisher: eLife Sciences Publications quality_controlled: '1' related_material: link: - relation: software url: https://doi.org/10.5281/zenodo.6974122 record: - id: '12339' relation: research_data status: public scopus_import: '1' status: public title: Adaptation dynamics between copynumber and point mutations tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 11 year: '2022' ... --- _id: '12339' abstract: - lang: eng text: 'Copy-number and point mutations form the basis for most evolutionary novelty through the process of gene duplication and divergence. While a plethora of genomic sequence data reveals the long-term fate of diverging coding sequences and their cis-regulatory elements, little is known about the early dynamics around the duplication event itself. In microorganisms, selection for increased gene expression often drives the expansion of gene copy-number mutations, which serves as a crude adaptation, prior to divergence through refining point mutations. Using a simple synthetic genetic system that allows us to distinguish copy-number and point mutations, we study their early and transient adaptive dynamics in real-time in Escherichia coli. We find two qualitatively different routes of adaptation depending on the level of functional improvement selected for: In conditions of high gene expression demand, the two types of mutations occur as a combination. Under low gene expression demand, negative epistasis between the two types of mutations renders them mutually exclusive. Thus, owing to their higher frequency, adaptation is dominated by copy-number mutations. Ultimately, due to high rates of reversal and pleiotropic cost, copy-number mutations may not only serve as a crude and transient adaptation but also constrain sequence divergence over evolutionary time scales.' article_processing_charge: No author: - first_name: Isabella full_name: Tomanek, Isabella id: 3981F020-F248-11E8-B48F-1D18A9856A87 last_name: Tomanek orcid: 0000-0001-6197-363X - first_name: Calin C full_name: Guet, Calin C id: 47F8433E-F248-11E8-B48F-1D18A9856A87 last_name: Guet orcid: 0000-0001-6220-2052 citation: ama: Tomanek I, Guet CC. Flow cytometry YFP and CFP data and deep sequencing data of populations evolving in galactose. 2022. doi:10.5061/dryad.rfj6q57ds apa: Tomanek, I., & Guet, C. C. (2022). Flow cytometry YFP and CFP data and deep sequencing data of populations evolving in galactose. Dryad. https://doi.org/10.5061/dryad.rfj6q57ds chicago: Tomanek, Isabella, and Calin C Guet. “Flow Cytometry YFP and CFP Data and Deep Sequencing Data of Populations Evolving in Galactose.” Dryad, 2022. https://doi.org/10.5061/dryad.rfj6q57ds. ieee: I. Tomanek and C. C. Guet, “Flow cytometry YFP and CFP data and deep sequencing data of populations evolving in galactose.” Dryad, 2022. ista: Tomanek I, Guet CC. 2022. Flow cytometry YFP and CFP data and deep sequencing data of populations evolving in galactose, Dryad, 10.5061/dryad.rfj6q57ds. mla: Tomanek, Isabella, and Calin C. Guet. Flow Cytometry YFP and CFP Data and Deep Sequencing Data of Populations Evolving in Galactose. Dryad, 2022, doi:10.5061/dryad.rfj6q57ds. short: I. Tomanek, C.C. Guet, (2022). date_created: 2023-01-23T09:00:37Z date_published: 2022-12-23T00:00:00Z date_updated: 2023-08-03T14:23:06Z day: '23' ddc: - '570' department: - _id: CaGu doi: 10.5061/dryad.rfj6q57ds main_file_link: - open_access: '1' url: https://doi.org/10.5061/dryad.rfj6q57ds month: '12' oa: 1 oa_version: Published Version publisher: Dryad related_material: record: - id: '12333' relation: used_in_publication status: public status: public title: Flow cytometry YFP and CFP data and deep sequencing data of populations evolving in galactose type: research_data_reference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2022' ... --- _id: '12358' 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" acknowledged_ssus: - _id: SSU alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Georg full_name: Sperl, Georg id: 4DD40360-F248-11E8-B48F-1D18A9856A87 last_name: Sperl citation: ama: 'Sperl G. Homogenizing yarn simulations: Large-scale mechanics, small-scale detail, and quantitative fitting. 2022. doi:10.15479/at:ista:12103' apa: 'Sperl, G. (2022). Homogenizing yarn simulations: Large-scale mechanics, small-scale detail, and quantitative fitting. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:12103' chicago: 'Sperl, Georg. “Homogenizing Yarn Simulations: Large-Scale Mechanics, Small-Scale Detail, and Quantitative Fitting.” Institute of Science and Technology Austria, 2022. https://doi.org/10.15479/at:ista:12103.' ieee: 'G. Sperl, “Homogenizing yarn simulations: Large-scale mechanics, small-scale detail, and quantitative fitting,” Institute of Science and Technology Austria, 2022.' ista: 'Sperl G. 2022. Homogenizing yarn simulations: Large-scale mechanics, small-scale detail, and quantitative fitting. Institute of Science and Technology Austria.' mla: 'Sperl, Georg. Homogenizing Yarn Simulations: Large-Scale Mechanics, Small-Scale Detail, and Quantitative Fitting. Institute of Science and Technology Austria, 2022, doi:10.15479/at:ista:12103.' short: 'G. Sperl, Homogenizing Yarn Simulations: Large-Scale Mechanics, Small-Scale Detail, and Quantitative Fitting, Institute of Science and Technology Austria, 2022.' date_created: 2023-01-24T10:49:46Z date_published: 2022-09-22T00:00:00Z date_updated: 2024-02-28T12:57:46Z day: '22' ddc: - '000' - '620' degree_awarded: PhD department: - _id: GradSch - _id: ChWo doi: 10.15479/at:ista:12103 ec_funded: 1 file: - access_level: open_access checksum: 083722acbb8115e52e3b0fdec6226769 content_type: application/pdf creator: cchlebak date_created: 2023-01-25T12:04:41Z date_updated: 2023-02-02T09:29:57Z description: 'This is the main PDF file of the thesis. File size: 105 MB' file_id: '12371' file_name: thesis_gsperl.pdf file_size: 104497530 relation: main_file title: Thesis - access_level: open_access checksum: 511f82025e5fcb70bff4731d6896ca07 content_type: application/pdf creator: cchlebak date_created: 2023-02-02T09:33:37Z date_updated: 2023-02-02T09:33:37Z description: This version of the thesis uses stronger image compression for a smaller file size of 23MB. file_id: '12483' file_name: thesis_gsperl_compressed.pdf file_size: 23183710 relation: main_file title: Thesis (compressed 23MB) - access_level: open_access checksum: ed4cb85225eedff761c25bddfc37a2ed content_type: application/x-zip-compressed creator: cchlebak date_created: 2023-02-02T09:39:25Z date_updated: 2023-02-02T09:39:25Z file_id: '12484' file_name: thesis-source.zip file_size: 98382247 relation: source_file file_date_updated: 2023-02-02T09:39:25Z has_accepted_license: '1' language: - iso: eng month: '09' oa: 1 oa_version: Published Version page: '138' project: - _id: 2533E772-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '638176' name: Efficient Simulation of Natural Phenomena at Extremely Large Scales publication_identifier: isbn: - 978-3-99078-020-6 issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '11736' relation: part_of_dissertation status: public - id: '9818' relation: part_of_dissertation status: public - id: '8385' relation: part_of_dissertation status: public status: public supervisor: - first_name: Christopher J full_name: Wojtan, Christopher J id: 3C61F1D2-F248-11E8-B48F-1D18A9856A87 last_name: Wojtan orcid: 0000-0001-6646-5546 title: 'Homogenizing yarn simulations: Large-scale mechanics, small-scale detail, and quantitative fitting' type: dissertation user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2022' ... --- _id: '12364' abstract: - lang: eng text: "Autism spectrum disorders (ASDs) are a group of neurodevelopmental disorders character\x02ized 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." alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Christoph full_name: Dotter, Christoph id: 4C66542E-F248-11E8-B48F-1D18A9856A87 last_name: Dotter orcid: 0000-0002-9033-9096 citation: ama: Dotter C. Transcriptional consequences of mutations in genes associated with Autism Spectrum Disorder. 2022. doi:10.15479/at:ista:12094 apa: Dotter, C. (2022). Transcriptional consequences of mutations in genes associated with Autism Spectrum Disorder. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:12094 chicago: Dotter, Christoph. “Transcriptional Consequences of Mutations in Genes Associated with Autism Spectrum Disorder.” Institute of Science and Technology Austria, 2022. https://doi.org/10.15479/at:ista:12094. ieee: C. Dotter, “Transcriptional consequences of mutations in genes associated with Autism Spectrum Disorder,” Institute of Science and Technology Austria, 2022. ista: Dotter C. 2022. Transcriptional consequences of mutations in genes associated with Autism Spectrum Disorder. Institute of Science and Technology Austria. mla: Dotter, Christoph. Transcriptional Consequences of Mutations in Genes Associated with Autism Spectrum Disorder. Institute of Science and Technology Austria, 2022, doi:10.15479/at:ista:12094. short: C. Dotter, Transcriptional Consequences of Mutations in Genes Associated with Autism Spectrum Disorder, Institute of Science and Technology Austria, 2022. date_created: 2023-01-24T13:09:57Z date_published: 2022-09-19T00:00:00Z date_updated: 2023-11-16T13:10:22Z day: '19' ddc: - '570' degree_awarded: PhD department: - _id: GradSch - _id: GaNo doi: 10.15479/at:ista:12094 ec_funded: 1 file: - access_level: open_access checksum: 896f4cac9adb6d3f26a6605772f4e1a3 content_type: application/pdf creator: cchlebak date_created: 2023-01-24T13:15:45Z date_updated: 2023-09-20T22:30:03Z embargo: 2023-09-19 file_id: '12365' file_name: 220923_Thesis_CDotter_Final.pdf file_size: 20457465 relation: main_file - access_level: closed checksum: ad01bb20da163be6893b7af832e58419 content_type: application/x-zip-compressed creator: cchlebak date_created: 2023-02-02T09:15:35Z date_updated: 2023-09-20T22:30:03Z embargo_to: open_access file_id: '12482' file_name: latex_source_CDotter_Thesis_2022.zip file_size: 22433512 relation: source_file file_date_updated: 2023-09-20T22:30:03Z has_accepted_license: '1' language: - iso: eng month: '09' oa: 1 oa_version: Published Version page: '152' project: - _id: 254BA948-B435-11E9-9278-68D0E5697425 grant_number: '401299' name: Probing development and reversibility of autism spectrum disorders - _id: 9B91375C-BA93-11EA-9121-9846C619BF3A grant_number: '707964' name: Critical windows and reversibility of ASD associated with mutations in chromatin remodelers - _id: 25444568-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '715508' name: Probing the Reversibility of Autism Spectrum Disorders by Employing in vivo and in vitro Models - _id: 2690FEAC-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: I04205 name: Identification of converging Molecular Pathways Across Chromatinopathies as Targets for Therapy publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '3' relation: part_of_dissertation status: public - id: '11160' relation: part_of_dissertation status: public status: public supervisor: - first_name: Gaia full_name: Novarino, Gaia id: 3E57A680-F248-11E8-B48F-1D18A9856A87 last_name: Novarino orcid: 0000-0002-7673-7178 title: Transcriptional consequences of mutations in genes associated with Autism Spectrum Disorder type: dissertation user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2022' ... --- _id: '12366' abstract: - lang: eng 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" acknowledged_ssus: - _id: NanoFab - _id: M-Shop - _id: EM-Fac alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Elena full_name: Redchenko, Elena id: 2C21D6E8-F248-11E8-B48F-1D18A9856A87 last_name: Redchenko citation: ama: Redchenko E. Controllable states of superconducting Qubit ensembles. 2022. doi:10.15479/at:ista:12132 apa: Redchenko, E. (2022). Controllable states of superconducting Qubit ensembles. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:12132 chicago: Redchenko, Elena. “Controllable States of Superconducting Qubit Ensembles.” Institute of Science and Technology Austria, 2022. https://doi.org/10.15479/at:ista:12132. ieee: 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. mla: Redchenko, Elena. Controllable States of Superconducting Qubit Ensembles. Institute of Science and Technology Austria, 2022, doi:10.15479/at:ista:12132. short: E. Redchenko, Controllable States of Superconducting Qubit Ensembles, Institute of Science and Technology Austria, 2022. date_created: 2023-01-25T09:17:02Z date_published: 2022-09-26T00:00:00Z date_updated: 2024-08-07T07:11:56Z day: '26' ddc: - '530' degree_awarded: PhD department: - _id: GradSch - _id: JoFi doi: 10.15479/at:ista:12132 ec_funded: 1 file: - access_level: open_access checksum: 39eabb1e006b41335f17f3b29af09648 content_type: application/pdf creator: cchlebak date_created: 2023-01-25T09:41:49Z date_updated: 2023-01-26T23:30:44Z embargo: 2022-12-28 file_id: '12367' file_name: Final_Thesis_ES_Redchenko.pdf file_size: 56076868 relation: main_file file_date_updated: 2023-01-26T23:30:44Z has_accepted_license: '1' language: - iso: eng month: '09' oa: 1 oa_version: Published Version page: '168' project: - _id: 2564DBCA-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '665385' name: International IST Doctoral Program - _id: 26336814-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '758053' name: A Fiber Optic Transceiver for Superconducting Qubits - _id: 237CBA6C-32DE-11EA-91FC-C7463DDC885E call_identifier: H2020 grant_number: '862644' name: Quantum readout techniques and technologies publication_identifier: isbn: - 978-3-99078-024-4 issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria status: public supervisor: - first_name: Johannes M full_name: Fink, Johannes M id: 4B591CBA-F248-11E8-B48F-1D18A9856A87 last_name: Fink orcid: 0000-0001-8112-028X title: Controllable states of superconducting Qubit ensembles type: dissertation user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2022' ... --- _id: '12368' 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\x02mediated 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\x02cadherin 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." acknowledged_ssus: - _id: LifeSc - _id: Bio - _id: NanoFab alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Feyza N full_name: Arslan, Feyza N id: 49DA7910-F248-11E8-B48F-1D18A9856A87 last_name: Arslan orcid: 0000-0001-5809-9566 citation: ama: Arslan FN. Remodeling of E-cadherin-mediated contacts via cortical  flows. 2022. doi:10.15479/at:ista:12153 apa: Arslan, F. N. (2022). Remodeling of E-cadherin-mediated contacts via cortical  flows. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:12153 chicago: Arslan, Feyza N. “Remodeling of E-Cadherin-Mediated Contacts via Cortical  Flows.” Institute of Science and Technology Austria, 2022. https://doi.org/10.15479/at:ista:12153. ieee: F. N. Arslan, “Remodeling of E-cadherin-mediated contacts via cortical  flows,” Institute of Science and Technology Austria, 2022. ista: Arslan FN. 2022. Remodeling of E-cadherin-mediated contacts via cortical  flows. Institute of Science and Technology Austria. mla: Arslan, Feyza N. Remodeling of E-Cadherin-Mediated Contacts via Cortical  Flows. Institute of Science and Technology Austria, 2022, doi:10.15479/at:ista:12153. short: F.N. Arslan, Remodeling of E-Cadherin-Mediated Contacts via Cortical  Flows, Institute of Science and Technology Austria, 2022. date_created: 2023-01-25T10:43:24Z date_published: 2022-09-29T00:00:00Z date_updated: 2023-08-08T13:14:10Z day: '29' ddc: - '570' degree_awarded: PhD department: - _id: GradSch - _id: CaHe doi: 10.15479/at:ista:12153 ec_funded: 1 file: - access_level: open_access checksum: e54a3e69b83ebf166544164afd25608e content_type: application/pdf creator: cchlebak date_created: 2023-01-25T10:52:46Z date_updated: 2023-01-25T10:52:46Z file_id: '12369' file_name: THESIS_FINAL_FArslan_pdfa.pdf file_size: 14581024 relation: main_file success: 1 file_date_updated: 2023-01-25T10:52:46Z has_accepted_license: '1' language: - iso: eng month: '09' oa: 1 oa_version: Published Version page: '113' project: - _id: 260F1432-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '742573' name: Interaction and feedback between cell mechanics and fate specification in vertebrate gastrulation publication_identifier: isbn: - ' 978-3-99078-025-1 ' issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '9350' relation: part_of_dissertation status: public status: public supervisor: - first_name: Carl-Philipp J full_name: Heisenberg, Carl-Philipp J id: 39427864-F248-11E8-B48F-1D18A9856A87 last_name: Heisenberg orcid: 0000-0002-0912-4566 title: Remodeling of E-cadherin-mediated contacts via cortical flows tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: dissertation user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2022' ... --- _id: '12378' abstract: - lang: eng 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\x02automatic 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\x02like 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." acknowledged_ssus: - _id: PreCl - _id: Bio - _id: ScienComp alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Gloria full_name: Colombo, Gloria id: 3483CF6C-F248-11E8-B48F-1D18A9856A87 last_name: Colombo orcid: 0000-0001-9434-8902 citation: ama: Colombo G. MorphOMICs, a tool for mapping microglial morphology, reveals brain region- and sex-dependent phenotypes. 2022. doi:10.15479/at:ista:12378 apa: Colombo, G. (2022). MorphOMICs, a tool for mapping microglial morphology, reveals brain region- and sex-dependent phenotypes. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:12378 chicago: Colombo, Gloria. “MorphOMICs, a Tool for Mapping Microglial Morphology, Reveals Brain Region- and Sex-Dependent Phenotypes.” Institute of Science and Technology Austria, 2022. https://doi.org/10.15479/at:ista:12378. ieee: G. Colombo, “MorphOMICs, a tool for mapping microglial morphology, reveals brain region- and sex-dependent phenotypes,” Institute of Science and Technology Austria, 2022. ista: Colombo G. 2022. MorphOMICs, a tool for mapping microglial morphology, reveals brain region- and sex-dependent phenotypes. Institute of Science and Technology Austria. mla: Colombo, Gloria. MorphOMICs, a Tool for Mapping Microglial Morphology, Reveals Brain Region- and Sex-Dependent Phenotypes. Institute of Science and Technology Austria, 2022, doi:10.15479/at:ista:12378. short: G. Colombo, MorphOMICs, a Tool for Mapping Microglial Morphology, Reveals Brain Region- and Sex-Dependent Phenotypes, Institute of Science and Technology Austria, 2022. date_created: 2023-01-25T14:27:43Z date_published: 2022-11-11T00:00:00Z date_updated: 2023-08-04T09:40:37Z day: '11' ddc: - '570' degree_awarded: PhD department: - _id: GradSch - _id: SaSi doi: 10.15479/at:ista:12378 ec_funded: 1 file: - access_level: closed checksum: 8cd3ddfe9b53381dcf086023d8d8893a content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document creator: cchlebak date_created: 2023-01-25T14:31:32Z date_updated: 2023-04-12T22:30:03Z embargo_to: open_access file_id: '12379' file_name: Gloria_Colombo_Thesis.docx file_size: 23890382 relation: source_file - access_level: open_access checksum: 8af4319c18b516e8758e9a6cb02b103b content_type: application/pdf creator: cchlebak date_created: 2023-01-25T14:31:36Z date_updated: 2023-04-12T22:30:03Z embargo: 2023-04-11 file_id: '12380' file_name: Gloria_Colombo_Thesis.pdf file_size: 13802421 relation: main_file file_date_updated: 2023-04-12T22:30:03Z has_accepted_license: '1' language: - iso: eng month: '11' oa: 1 oa_version: Published Version page: '142' project: - _id: 2564DBCA-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '665385' name: International IST Doctoral Program publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '12244' relation: part_of_dissertation status: public status: public supervisor: - first_name: Sandra full_name: Siegert, Sandra id: 36ACD32E-F248-11E8-B48F-1D18A9856A87 last_name: Siegert orcid: 0000-0001-8635-0877 title: MorphOMICs, a tool for mapping microglial morphology, reveals brain region- and sex-dependent phenotypes tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: dissertation user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2022' ... --- _id: '12390' abstract: - lang: eng 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" alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Morris full_name: Brooks, Morris id: B7ECF9FC-AA38-11E9-AC9A-0930E6697425 last_name: Brooks orcid: 0000-0002-6249-0928 citation: ama: Brooks M. Translation-invariant quantum systems with effectively broken symmetry. 2022. doi:10.15479/at:ista:12390 apa: Brooks, M. (2022). Translation-invariant quantum systems with effectively broken symmetry. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:12390 chicago: Brooks, Morris. “Translation-Invariant Quantum Systems with Effectively Broken Symmetry.” Institute of Science and Technology Austria, 2022. https://doi.org/10.15479/at:ista:12390. ieee: M. Brooks, “Translation-invariant quantum systems with effectively broken symmetry,” Institute of Science and Technology Austria, 2022. ista: Brooks M. 2022. Translation-invariant quantum systems with effectively broken symmetry. Institute of Science and Technology Austria. mla: Brooks, Morris. Translation-Invariant Quantum Systems with Effectively Broken Symmetry. Institute of Science and Technology Austria, 2022, doi:10.15479/at:ista:12390. short: M. Brooks, Translation-Invariant Quantum Systems with Effectively Broken Symmetry, Institute of Science and Technology Austria, 2022. date_created: 2023-01-26T10:00:42Z date_published: 2022-12-15T00:00:00Z date_updated: 2023-08-07T13:32:09Z day: '15' ddc: - '500' degree_awarded: PhD department: - _id: GradSch - _id: RoSe doi: 10.15479/at:ista:12390 ec_funded: 1 file: - access_level: open_access checksum: b31460e937f33b557abb40ebef02b567 content_type: application/pdf creator: cchlebak date_created: 2023-01-26T10:02:34Z date_updated: 2023-01-26T10:02:34Z file_id: '12391' file_name: Brooks_Thesis.pdf file_size: 3095225 relation: main_file success: 1 - access_level: closed checksum: 9751869fa5e7981588ad4228f4fd4bd6 content_type: application/octet-stream creator: cchlebak date_created: 2023-01-26T10:02:42Z date_updated: 2023-01-26T10:02:42Z file_id: '12392' file_name: Brooks_Thesis.tex file_size: 809842 relation: source_file file_date_updated: 2023-01-26T10:02:42Z has_accepted_license: '1' language: - iso: eng license: https://creativecommons.org/licenses/by-nc-sa/4.0/ month: '12' oa: 1 oa_version: Published Version page: '196' project: - _id: 25C6DC12-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '694227' name: Analysis of quantum many-body systems publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '9005' relation: part_of_dissertation status: public status: public supervisor: - first_name: Robert full_name: Seiringer, Robert id: 4AFD0470-F248-11E8-B48F-1D18A9856A87 last_name: Seiringer orcid: 0000-0002-6781-0521 title: Translation-invariant quantum systems with effectively broken symmetry tmp: image: /images/cc_by_nc_sa.png 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) short: CC BY-NC-SA (4.0) type: dissertation user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2022' ... --- _id: '12401' 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." alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Saren full_name: Tasciyan, Saren id: 4323B49C-F248-11E8-B48F-1D18A9856A87 last_name: Tasciyan orcid: 0000-0003-1671-393X citation: ama: Tasciyan S. Role of microenvironment heterogeneity in cancer cell invasion. 2022. doi:10.15479/at:ista:12401 apa: Tasciyan, S. (2022). Role of microenvironment heterogeneity in cancer cell invasion. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:12401 chicago: Tasciyan, Saren. “Role of Microenvironment Heterogeneity in Cancer Cell Invasion.” Institute of Science and Technology Austria, 2022. https://doi.org/10.15479/at:ista:12401. ieee: S. Tasciyan, “Role of microenvironment heterogeneity in cancer cell invasion,” Institute of Science and Technology Austria, 2022. ista: Tasciyan S. 2022. Role of microenvironment heterogeneity in cancer cell invasion. Institute of Science and Technology Austria. mla: Tasciyan, Saren. Role of Microenvironment Heterogeneity in Cancer Cell Invasion. Institute of Science and Technology Austria, 2022, doi:10.15479/at:ista:12401. short: S. Tasciyan, Role of Microenvironment Heterogeneity in Cancer Cell Invasion, Institute of Science and Technology Austria, 2022. date_created: 2023-01-26T11:55:16Z date_published: 2022-12-22T00:00:00Z date_updated: 2024-09-10T12:04:26Z day: '22' ddc: - '610' degree_awarded: PhD department: - _id: GradSch - _id: MiSi doi: 10.15479/at:ista:12401 file: - access_level: open_access checksum: cc4a2b4a7e3c4ee8ef7f2dbf909b12bd content_type: application/pdf creator: cchlebak date_created: 2023-01-26T11:58:14Z date_updated: 2023-12-21T23:30:03Z embargo: 2023-12-20 file_id: '12402' file_name: PhD-Thesis_Saren Tasciyan_formatted_aftercrash_fixed_600dpi_95pc_final_PDFA3b.pdf file_size: 42059787 relation: main_file - access_level: closed checksum: f1b4ca98b8ab0cb043b1830971e9bd9c content_type: application/x-zip-compressed creator: cchlebak date_created: 2023-01-26T12:00:10Z date_updated: 2023-12-21T23:30:03Z embargo_to: open_access file_id: '12403' file_name: Source Files - Saren Tasciyan - PhD Thesis.zip file_size: 261256696 relation: source_file file_date_updated: 2023-12-21T23:30:03Z has_accepted_license: '1' language: - iso: eng month: '12' oa: 1 oa_version: Published Version page: '105' publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '679' relation: part_of_dissertation status: public - id: '10703' relation: part_of_dissertation status: public - id: '7885' relation: part_of_dissertation status: public - id: '9429' relation: part_of_dissertation status: public status: public supervisor: - first_name: Michael K full_name: Sixt, Michael K id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87 last_name: Sixt orcid: 0000-0002-6620-9179 title: Role of microenvironment heterogeneity in cancer cell invasion type: dissertation user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2022' ... --- _id: '12431' abstract: - lang: eng text: This paper presents a new representation of curve dynamics, with applications to vortex filaments in fluid dynamics. Instead of representing these filaments with explicit curve geometry and Lagrangian equations of motion, we represent curves implicitly with a new co-dimensional 2 level set description. Our implicit representation admits several redundant mathematical degrees of freedom in both the configuration and the dynamics of the curves, which can be tailored specifically to improve numerical robustness, in contrast to naive approaches for implicit curve dynamics that suffer from overwhelming numerical stability problems. Furthermore, we note how these hidden degrees of freedom perfectly map to a Clebsch representation in fluid dynamics. Motivated by these observations, we introduce untwisted level set functions and non-swirling dynamics which successfully regularize sources of numerical instability, particularly in the twisting modes around curve filaments. A consequence is a novel simulation method which produces stable dynamics for large numbers of interacting vortex filaments and effortlessly handles topological changes and re-connection events. acknowledgement: We thank the visual computing group at IST Austria for their valuable discussions and feedback. Houdini Education licenses were provided by SideFX software. This project was funded in part by the European Research Council (ERC Consolidator Grant 101045083 CoDiNA). article_number: '241' article_processing_charge: No article_type: original author: - first_name: Sadashige full_name: Ishida, Sadashige id: 6F7C4B96-A8E9-11E9-A7CA-09ECE5697425 last_name: Ishida - first_name: Christopher J full_name: Wojtan, Christopher J id: 3C61F1D2-F248-11E8-B48F-1D18A9856A87 last_name: Wojtan orcid: 0000-0001-6646-5546 - first_name: Albert full_name: Chern, Albert last_name: Chern citation: ama: Ishida S, Wojtan C, Chern A. Hidden degrees of freedom in implicit vortex filaments. ACM Transactions on Graphics. 2022;41(6). doi:10.1145/3550454.3555459 apa: Ishida, S., Wojtan, C., & Chern, A. (2022). Hidden degrees of freedom in implicit vortex filaments. ACM Transactions on Graphics. Association for Computing Machinery. https://doi.org/10.1145/3550454.3555459 chicago: Ishida, Sadashige, Chris Wojtan, and Albert Chern. “Hidden Degrees of Freedom in Implicit Vortex Filaments.” ACM Transactions on Graphics. Association for Computing Machinery, 2022. https://doi.org/10.1145/3550454.3555459. ieee: S. Ishida, C. Wojtan, and A. Chern, “Hidden degrees of freedom in implicit vortex filaments,” ACM Transactions on Graphics, vol. 41, no. 6. Association for Computing Machinery, 2022. ista: Ishida S, Wojtan C, Chern A. 2022. Hidden degrees of freedom in implicit vortex filaments. ACM Transactions on Graphics. 41(6), 241. mla: Ishida, Sadashige, et al. “Hidden Degrees of Freedom in Implicit Vortex Filaments.” ACM Transactions on Graphics, vol. 41, no. 6, 241, Association for Computing Machinery, 2022, doi:10.1145/3550454.3555459. short: S. Ishida, C. Wojtan, A. Chern, ACM Transactions on Graphics 41 (2022). date_created: 2023-01-29T23:00:59Z date_published: 2022-12-01T00:00:00Z date_updated: 2023-08-04T09:37:23Z day: '01' ddc: - '000' department: - _id: ChWo doi: 10.1145/3550454.3555459 external_id: isi: - '000891651900061' file: - access_level: open_access checksum: a2fba257fdefe0e747182be6c0f7c70c content_type: application/pdf creator: dernst date_created: 2023-01-30T07:15:48Z date_updated: 2023-01-30T07:15:48Z file_id: '12433' file_name: 2022_ACM_Ishida.pdf file_size: 15551202 relation: main_file success: 1 file_date_updated: 2023-01-30T07:15:48Z has_accepted_license: '1' intvolume: ' 41' isi: 1 issue: '6' language: - iso: eng month: '12' oa: 1 oa_version: Published Version project: - _id: 34bc2376-11ca-11ed-8bc3-9a3b3961a088 grant_number: '101045083' name: Computational Discovery of Numerical Algorithms for Animation and Simulation of Natural Phenomena publication: ACM Transactions on Graphics publication_identifier: eissn: - 1557-7368 issn: - 0730-0301 publication_status: published publisher: Association for Computing Machinery quality_controlled: '1' scopus_import: '1' status: public title: Hidden degrees of freedom in implicit vortex filaments tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 41 year: '2022' ... --- _id: '12432' abstract: - lang: eng text: "We present CertifyHAM, a deterministic algorithm that takes a graph G as input and either finds a Hamilton cycle of G or outputs that such a cycle does not exist. If G ∼ G(n, p) and p ≥\r\n100 log n/n then the expected running time of CertifyHAM is O(n/p) which is best possible. This improves upon previous results due to Gurevich and Shelah, Thomason and Alon, and\r\nKrivelevich, who proved analogous results for p being constant, p ≥ 12n −1/3 and p ≥ 70n\r\n−1/2 respectively." acknowledgement: "This project has received funding from the European Union’s Horizon 2020\r\nresearch and innovation programme under the Marie Skłodowska-Curie grant\r\nagreement No 101034413" article_processing_charge: No author: - first_name: Michael full_name: Anastos, Michael id: 0b2a4358-bb35-11ec-b7b9-e3279b593dbb last_name: Anastos citation: ama: 'Anastos M. Solving the Hamilton cycle problem fast on average. In: 63rd Annual IEEE Symposium on Foundations of Computer Science. Vol 2022-October. Institute of Electrical and Electronics Engineers; 2022:919-930. doi:10.1109/FOCS54457.2022.00091' apa: 'Anastos, M. (2022). Solving the Hamilton cycle problem fast on average. In 63rd Annual IEEE Symposium on Foundations of Computer Science (Vol. 2022–October, pp. 919–930). Denver, CO, United States: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/FOCS54457.2022.00091' chicago: Anastos, Michael. “Solving the Hamilton Cycle Problem Fast on Average.” In 63rd Annual IEEE Symposium on Foundations of Computer Science, 2022–October:919–30. Institute of Electrical and Electronics Engineers, 2022. https://doi.org/10.1109/FOCS54457.2022.00091. ieee: M. Anastos, “Solving the Hamilton cycle problem fast on average,” in 63rd Annual IEEE Symposium on Foundations of Computer Science, Denver, CO, United States, 2022, vol. 2022–October, pp. 919–930. ista: 'Anastos M. 2022. Solving the Hamilton cycle problem fast on average. 63rd Annual IEEE Symposium on Foundations of Computer Science. FOCS: Symposium on Foundations of Computer Science vol. 2022–October, 919–930.' mla: Anastos, Michael. “Solving the Hamilton Cycle Problem Fast on Average.” 63rd Annual IEEE Symposium on Foundations of Computer Science, vol. 2022–October, Institute of Electrical and Electronics Engineers, 2022, pp. 919–30, doi:10.1109/FOCS54457.2022.00091. short: M. Anastos, in:, 63rd Annual IEEE Symposium on Foundations of Computer Science, Institute of Electrical and Electronics Engineers, 2022, pp. 919–930. conference: end_date: 2022-11-03 location: Denver, CO, United States name: 'FOCS: Symposium on Foundations of Computer Science' start_date: 2022-10-31 date_created: 2023-01-29T23:00:59Z date_published: 2022-12-01T00:00:00Z date_updated: 2023-08-04T09:37:56Z day: '01' department: - _id: MaKw doi: 10.1109/FOCS54457.2022.00091 ec_funded: 1 external_id: isi: - '000909382900084' isi: 1 language: - iso: eng month: '12' oa_version: None page: 919-930 project: - _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c call_identifier: H2020 grant_number: '101034413' name: 'IST-BRIDGE: International postdoctoral program' publication: 63rd Annual IEEE Symposium on Foundations of Computer Science publication_identifier: isbn: - '9781665455190' issn: - 0272-5428 publication_status: published publisher: Institute of Electrical and Electronics Engineers quality_controlled: '1' scopus_import: '1' status: public title: Solving the Hamilton cycle problem fast on average type: conference user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 2022-October year: '2022' ... --- _id: '12452' abstract: - lang: eng text: Portrait viewpoint and illumination editing is an important problem with several applications in VR/AR, movies, and photography. Comprehensive knowledge of geometry and illumination is critical for obtaining photorealistic results. Current methods are unable to explicitly model in 3D while handing both viewpoint and illumination editing from a single image. In this paper, we propose VoRF, a novel approach that can take even a single portrait image as input and relight human heads under novel illuminations that can be viewed from arbitrary viewpoints. VoRF represents a human head as a continuous volumetric field and learns a prior model of human heads using a coordinate-based MLP with separate latent spaces for identity and illumination. The prior model is learnt in an auto-decoder manner over a diverse class of head shapes and appearances, allowing VoRF to generalize to novel test identities from a single input image. Additionally, VoRF has a reflectance MLP that uses the intermediate features of the prior model for rendering One-Light-at-A-Time (OLAT) images under novel views. We synthesize novel illuminations by combining these OLAT images with target environment maps. Qualitative and quantitative evaluations demonstrate the effectiveness of VoRF for relighting and novel view synthesis even when applied to unseen subjects under uncontrolled illuminations. acknowledgement: This work was supported by the ERC Consolidator Grant 4DReply (770784). article_number: '708' article_processing_charge: No author: - first_name: Pramod full_name: Rao, Pramod last_name: Rao - first_name: Mallikarjun full_name: B R, Mallikarjun last_name: B R - first_name: Gereon full_name: Fox, Gereon last_name: Fox - first_name: Tim full_name: Weyrich, Tim last_name: Weyrich - first_name: Bernd full_name: Bickel, Bernd id: 49876194-F248-11E8-B48F-1D18A9856A87 last_name: Bickel orcid: 0000-0001-6511-9385 - first_name: Hans-Peter full_name: Seidel, Hans-Peter last_name: Seidel - first_name: Hanspeter full_name: Pfister, Hanspeter last_name: Pfister - first_name: Wojciech full_name: Matusik, Wojciech last_name: Matusik - first_name: Ayush full_name: Tewari, Ayush last_name: Tewari - first_name: Christian full_name: Theobalt, Christian last_name: Theobalt - first_name: Mohamed full_name: Elgharib, Mohamed last_name: Elgharib citation: ama: 'Rao P, B R M, Fox G, et al. VoRF: Volumetric Relightable Faces. In: 33rd British Machine Vision Conference. British Machine Vision Association and Society for Pattern Recognition; 2022.' apa: 'Rao, P., B R, M., Fox, G., Weyrich, T., Bickel, B., Seidel, H.-P., … Elgharib, M. (2022). VoRF: Volumetric Relightable Faces. In 33rd British Machine Vision Conference. London, United Kingdom: British Machine Vision Association and Society for Pattern Recognition.' chicago: 'Rao, Pramod, Mallikarjun B R, Gereon Fox, Tim Weyrich, Bernd Bickel, Hans-Peter Seidel, Hanspeter Pfister, et al. “VoRF: Volumetric Relightable Faces.” In 33rd British Machine Vision Conference. British Machine Vision Association and Society for Pattern Recognition, 2022.' ieee: 'P. Rao et al., “VoRF: Volumetric Relightable Faces,” in 33rd British Machine Vision Conference, London, United Kingdom, 2022.' ista: 'Rao P, B R M, Fox G, Weyrich T, Bickel B, Seidel H-P, Pfister H, Matusik W, Tewari A, Theobalt C, Elgharib M. 2022. VoRF: Volumetric Relightable Faces. 33rd British Machine Vision Conference. BMVC: British Machine Vision Conference, 708.' mla: 'Rao, Pramod, et al. “VoRF: Volumetric Relightable Faces.” 33rd British Machine Vision Conference, 708, British Machine Vision Association and Society for Pattern Recognition, 2022.' short: P. Rao, M. B R, G. Fox, T. Weyrich, B. Bickel, H.-P. Seidel, H. Pfister, W. Matusik, A. Tewari, C. Theobalt, M. Elgharib, in:, 33rd British Machine Vision Conference, British Machine Vision Association and Society for Pattern Recognition, 2022. conference: end_date: 2022-11-24 location: London, United Kingdom name: 'BMVC: British Machine Vision Conference' start_date: 2022-11-21 date_created: 2023-01-30T10:47:06Z date_published: 2022-12-01T00:00:00Z date_updated: 2023-10-31T08:40:55Z day: '01' ddc: - '000' department: - _id: BeBi file: - access_level: open_access checksum: b60b70bb48700aee709c85a69231821d content_type: application/pdf creator: bbickel date_created: 2023-01-30T10:48:18Z date_updated: 2023-01-30T10:48:18Z file_id: '12453' file_name: vorf_main.pdf file_size: 5202710 relation: main_file title: 'VoRF: Volumetric Relightable Faces' - access_level: open_access checksum: ce5f4ce66eaaa1590ee5df989fca6f61 content_type: application/pdf creator: bbickel date_created: 2023-01-30T10:48:29Z date_updated: 2023-01-30T10:48:29Z file_id: '12454' file_name: vorf_supp.pdf file_size: 37953188 relation: supplementary_material title: 'VoRF: Volumetric Relightable Faces – SUPPLEMENTAL MATERIAL –' - access_level: open_access checksum: 08aecca434b08fee75ee1efe87943718 content_type: video/mp4 creator: bbickel date_created: 2023-01-30T10:48:37Z date_updated: 2023-01-30T10:48:37Z file_id: '12455' file_name: video.mp4 file_size: 57855492 relation: supplementary_material file_date_updated: 2023-01-30T10:48:37Z has_accepted_license: '1' language: - iso: eng main_file_link: - open_access: '1' url: https://bmvc2022.mpi-inf.mpg.de/708/ month: '12' oa: 1 oa_version: Published Version publication: 33rd British Machine Vision Conference publication_status: published publisher: British Machine Vision Association and Society for Pattern Recognition quality_controlled: '1' scopus_import: '1' status: public title: 'VoRF: Volumetric Relightable Faces' type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2022' ... --- _id: '12480' abstract: - lang: eng text: 'We consider the problem of estimating a signal from measurements obtained via a generalized linear model. We focus on estimators based on approximate message passing (AMP), a family of iterative algorithms with many appealing features: the performance of AMP in the high-dimensional limit can be succinctly characterized under suitable model assumptions; AMP can also be tailored to the empirical distribution of the signal entries, and for a wide class of estimation problems, AMP is conjectured to be optimal among all polynomial-time algorithms. However, a major issue of AMP is that in many models (such as phase retrieval), it requires an initialization correlated with the ground-truth signal and independent from the measurement matrix. Assuming that such an initialization is available is typically not realistic. In this paper, we solve this problem by proposing an AMP algorithm initialized with a spectral estimator. With such an initialization, the standard AMP analysis fails since the spectral estimator depends in a complicated way on the design matrix. Our main contribution is a rigorous characterization of the performance of AMP with spectral initialization in the high-dimensional limit. The key technical idea is to define and analyze a two-phase artificial AMP algorithm that first produces the spectral estimator, and then closely approximates the iterates of the true AMP. We also provide numerical results that demonstrate the validity of the proposed approach.' acknowledgement: "The authors would like to thank Andrea Montanari for helpful discussions.\r\nM Mondelli was partially supported by the 2019 Lopez-Loreta Prize. R Venkataramanan was partially supported by the Alan Turing Institute under the EPSRC Grant\r\nEP/N510129/1." article_number: '114003' article_processing_charge: Yes (via OA deal) article_type: original author: - first_name: Marco full_name: Mondelli, Marco id: 27EB676C-8706-11E9-9510-7717E6697425 last_name: Mondelli orcid: 0000-0002-3242-7020 - first_name: Ramji full_name: Venkataramanan, Ramji last_name: Venkataramanan citation: ama: 'Mondelli M, Venkataramanan R. Approximate message passing with spectral initialization for generalized linear models. Journal of Statistical Mechanics: Theory and Experiment. 2022;2022(11). doi:10.1088/1742-5468/ac9828' apa: 'Mondelli, M., & Venkataramanan, R. (2022). Approximate message passing with spectral initialization for generalized linear models. Journal of Statistical Mechanics: Theory and Experiment. IOP Publishing. https://doi.org/10.1088/1742-5468/ac9828' chicago: 'Mondelli, Marco, and Ramji Venkataramanan. “Approximate Message Passing with Spectral Initialization for Generalized Linear Models.” Journal of Statistical Mechanics: Theory and Experiment. IOP Publishing, 2022. https://doi.org/10.1088/1742-5468/ac9828.' ieee: 'M. Mondelli and R. Venkataramanan, “Approximate message passing with spectral initialization for generalized linear models,” Journal of Statistical Mechanics: Theory and Experiment, vol. 2022, no. 11. IOP Publishing, 2022.' ista: 'Mondelli M, Venkataramanan R. 2022. Approximate message passing with spectral initialization for generalized linear models. Journal of Statistical Mechanics: Theory and Experiment. 2022(11), 114003.' mla: 'Mondelli, Marco, and Ramji Venkataramanan. “Approximate Message Passing with Spectral Initialization for Generalized Linear Models.” Journal of Statistical Mechanics: Theory and Experiment, vol. 2022, no. 11, 114003, IOP Publishing, 2022, doi:10.1088/1742-5468/ac9828.' short: 'M. Mondelli, R. Venkataramanan, Journal of Statistical Mechanics: Theory and Experiment 2022 (2022).' date_created: 2023-02-02T08:31:57Z date_published: 2022-11-24T00:00:00Z date_updated: 2024-03-07T10:36:52Z day: '24' ddc: - '510' - '530' department: - _id: MaMo doi: 10.1088/1742-5468/ac9828 external_id: isi: - '000889589900001' file: - access_level: open_access checksum: 01411ffa76d3e380a0446baeb89b1ef7 content_type: application/pdf creator: dernst date_created: 2023-02-02T08:35:52Z date_updated: 2023-02-02T08:35:52Z file_id: '12481' file_name: 2022_JourStatisticalMechanics_Mondelli.pdf file_size: 1729997 relation: main_file success: 1 file_date_updated: 2023-02-02T08:35:52Z has_accepted_license: '1' intvolume: ' 2022' isi: 1 issue: '11' keyword: - Statistics - Probability and Uncertainty - Statistics and Probability - Statistical and Nonlinear Physics language: - iso: eng month: '11' oa: 1 oa_version: Published Version project: - _id: 059876FA-7A3F-11EA-A408-12923DDC885E name: Prix Lopez-Loretta 2019 - Marco Mondelli publication: 'Journal of Statistical Mechanics: Theory and Experiment' publication_identifier: issn: - 1742-5468 publication_status: published publisher: IOP Publishing quality_controlled: '1' related_material: record: - id: '10598' relation: earlier_version status: public scopus_import: '1' status: public title: Approximate message passing with spectral initialization for generalized linear models tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 2022 year: '2022' ... --- _id: '12495' abstract: - lang: eng text: "Fairness-aware learning aims at constructing classifiers that not only make accurate predictions, but also do not discriminate against specific groups. It is a fast-growing area of\r\nmachine learning with far-reaching societal impact. However, existing fair learning methods\r\nare vulnerable to accidental or malicious artifacts in the training data, which can cause\r\nthem to unknowingly produce unfair classifiers. In this work we address the problem of\r\nfair learning from unreliable training data in the robust multisource setting, where the\r\navailable training data comes from multiple sources, a fraction of which might not be representative of the true data distribution. We introduce FLEA, a filtering-based algorithm\r\nthat identifies and suppresses those data sources that would have a negative impact on\r\nfairness or accuracy if they were used for training. As such, FLEA is not a replacement of\r\nprior fairness-aware learning methods but rather an augmentation that makes any of them\r\nrobust against unreliable training data. We show the effectiveness of our approach by a\r\ndiverse range of experiments on multiple datasets. Additionally, we prove formally that\r\n–given enough data– FLEA protects the learner against corruptions as long as the fraction of\r\naffected data sources is less than half. Our source code and documentation are available at\r\nhttps://github.com/ISTAustria-CVML/FLEA." acknowledged_ssus: - _id: ScienComp acknowledgement: 'The authors would like to thank Bernd Prach, Elias Frantar, Alexandra Peste, Mahdi Nikdan, and Peter Súkeník for their helpful feedback. This research was supported by the Scientific Service Units (SSU) of IST Austria through resources provided by Scientific Computing (SciComp). This publication was made possible by an ETH AI Center postdoctoral fellowship granted to Nikola Konstantinov. Eugenia Iofinova was supported in part by the FWF DK VGSCO, grant agreement number W1260-N35. ' article_processing_charge: No article_type: original arxiv: 1 author: - first_name: Eugenia B full_name: Iofinova, Eugenia B id: f9a17499-f6e0-11ea-865d-fdf9a3f77117 last_name: Iofinova orcid: 0000-0002-7778-3221 - first_name: Nikola H full_name: Konstantinov, Nikola H id: 4B9D76E4-F248-11E8-B48F-1D18A9856A87 last_name: Konstantinov - first_name: Christoph full_name: Lampert, Christoph id: 40C20FD2-F248-11E8-B48F-1D18A9856A87 last_name: Lampert orcid: 0000-0001-8622-7887 citation: ama: 'Iofinova EB, Konstantinov NH, Lampert C. FLEA: Provably robust fair multisource learning from unreliable training data. Transactions on Machine Learning Research. 2022.' apa: 'Iofinova, E. B., Konstantinov, N. H., & Lampert, C. (2022). FLEA: Provably robust fair multisource learning from unreliable training data. Transactions on Machine Learning Research. ML Research Press.' chicago: 'Iofinova, Eugenia B, Nikola H Konstantinov, and Christoph Lampert. “FLEA: Provably Robust Fair Multisource Learning from Unreliable Training Data.” Transactions on Machine Learning Research. ML Research Press, 2022.' ieee: 'E. B. Iofinova, N. H. Konstantinov, and C. Lampert, “FLEA: Provably robust fair multisource learning from unreliable training data,” Transactions on Machine Learning Research. ML Research Press, 2022.' ista: 'Iofinova EB, Konstantinov NH, Lampert C. 2022. FLEA: Provably robust fair multisource learning from unreliable training data. Transactions on Machine Learning Research.' mla: 'Iofinova, Eugenia B., et al. “FLEA: Provably Robust Fair Multisource Learning from Unreliable Training Data.” Transactions on Machine Learning Research, ML Research Press, 2022.' short: E.B. Iofinova, N.H. Konstantinov, C. Lampert, Transactions on Machine Learning Research (2022). date_created: 2023-02-02T20:29:57Z date_published: 2022-12-22T00:00:00Z date_updated: 2023-02-23T10:30:54Z day: '22' ddc: - '000' department: - _id: ChLa external_id: arxiv: - '2106.11732' file: - access_level: open_access checksum: 97c8a8470759cab597abb973ca137a3b content_type: application/pdf creator: dernst date_created: 2023-02-23T10:30:04Z date_updated: 2023-02-23T10:30:04Z file_id: '12673' file_name: 2022_TMLR_Iofinova.pdf file_size: 1948063 relation: main_file success: 1 file_date_updated: 2023-02-23T10:30:04Z has_accepted_license: '1' language: - iso: eng main_file_link: - open_access: '1' url: https://openreview.net/forum?id=XsPopigZXV month: '12' oa: 1 oa_version: Published Version project: - _id: 9B9290DE-BA93-11EA-9121-9846C619BF3A grant_number: ' W1260-N35' name: Vienna Graduate School on Computational Optimization publication: Transactions on Machine Learning Research publication_identifier: issn: - 2835-8856 publication_status: published publisher: ML Research Press quality_controlled: '1' related_material: link: - description: source code relation: software url: https://github.com/ISTAustria-CVML/FLEA status: public title: 'FLEA: Provably robust fair multisource learning from unreliable training data' tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2022' ... --- _id: '12508' abstract: - lang: eng text: "We explore the notion of history-determinism in the context of timed automata (TA). History-deterministic automata are those in which nondeterminism can be resolved on the fly, based on the run constructed thus far. History-determinism is a robust property that admits different game-based characterisations, and history-deterministic specifications allow for game-based verification without an expensive determinization step.\r\nWe show yet another characterisation of history-determinism in terms of fair simulation, at the general level of labelled transition systems: a system is history-deterministic precisely if and only if it fairly simulates all language smaller systems.\r\nFor timed automata over infinite timed words it is known that universality is undecidable for Büchi TA. We show that for history-deterministic TA with arbitrary parity acceptance, timed universality, inclusion, and synthesis all remain decidable and are ExpTime-complete.\r\nFor the subclass of TA with safety or reachability acceptance, we show that checking whether such an automaton is history-deterministic is decidable (in ExpTime), and history-deterministic TA with safety acceptance are effectively determinizable without introducing new automata states." acknowledgement: "Thomas A. Henzinger: This work was supported in part by the ERC-2020-AdG 101020093.\r\nPatrick Totzke: acknowledges support from the EPSRC, project no. EP/V025848/1.\r\n" alternative_title: - LIPIcs article_processing_charge: No author: - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000-0002-2985-7724 - first_name: Karoliina full_name: Lehtinen, Karoliina last_name: Lehtinen - first_name: Patrick full_name: Totzke, Patrick last_name: Totzke citation: ama: 'Henzinger TA, Lehtinen K, Totzke P. History-deterministic timed automata. In: 33rd International Conference on Concurrency Theory. Vol 243. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022:14:1-14:21. doi:10.4230/LIPIcs.CONCUR.2022.14' apa: 'Henzinger, T. A., Lehtinen, K., & Totzke, P. (2022). History-deterministic timed automata. In 33rd International Conference on Concurrency Theory (Vol. 243, p. 14:1-14:21). Warsaw, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2022.14' chicago: Henzinger, Thomas A, Karoliina Lehtinen, and Patrick Totzke. “History-Deterministic Timed Automata.” In 33rd International Conference on Concurrency Theory, 243:14:1-14:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. https://doi.org/10.4230/LIPIcs.CONCUR.2022.14. ieee: T. A. Henzinger, K. Lehtinen, and P. Totzke, “History-deterministic timed automata,” in 33rd International Conference on Concurrency Theory, Warsaw, Poland, 2022, vol. 243, p. 14:1-14:21. ista: 'Henzinger TA, Lehtinen K, Totzke P. 2022. History-deterministic timed automata. 33rd International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 243, 14:1-14:21.' mla: Henzinger, Thomas A., et al. “History-Deterministic Timed Automata.” 33rd International Conference on Concurrency Theory, vol. 243, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 14:1-14:21, doi:10.4230/LIPIcs.CONCUR.2022.14. short: T.A. Henzinger, K. Lehtinen, P. Totzke, in:, 33rd International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 14:1-14:21. conference: end_date: 2022-09-16 location: Warsaw, Poland name: 'CONCUR: Conference on Concurrency Theory' start_date: 2022-09-13 date_created: 2023-02-05T17:24:23Z date_published: 2022-09-06T00:00:00Z date_updated: 2023-02-06T09:23:31Z day: '06' ddc: - '000' department: - _id: ToHe doi: 10.4230/LIPIcs.CONCUR.2022.14 ec_funded: 1 file: - access_level: open_access checksum: 9e97e15628f66b2ad77f535bb0327dee content_type: application/pdf creator: dernst date_created: 2023-02-06T09:21:09Z date_updated: 2023-02-06T09:21:09Z file_id: '12520' file_name: 2022_LIPICs_Henzinger2.pdf file_size: 717940 relation: main_file success: 1 file_date_updated: 2023-02-06T09:21:09Z has_accepted_license: '1' intvolume: ' 243' language: - iso: eng month: '09' oa: 1 oa_version: Published Version page: 14:1-14:21 project: - _id: 62781420-2b32-11ec-9570-8d9b63373d4d call_identifier: H2020 grant_number: '101020093' name: Vigilant Algorithmic Monitoring of Software publication: 33rd International Conference on Concurrency Theory publication_identifier: isbn: - '9783959772464' issn: - 1868-8969 publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: '1' status: public title: History-deterministic timed automata tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 243 year: '2022' ... --- _id: '12509' abstract: - lang: eng text: A graph game is a two-player zero-sum game in which the players move a token throughout a graph to produce an infinite path, which determines the winner or payoff of the game. In bidding games, both players have budgets, and in each turn, we hold an "auction" (bidding) to determine which player moves the token. In this survey, we consider several bidding mechanisms and their effect on the properties of the game. Specifically, bidding games, and in particular bidding games of infinite duration, have an intriguing equivalence with random-turn games in which in each turn, the player who moves is chosen randomly. We summarize how minor changes in the bidding mechanism lead to unexpected differences in the equivalence with random-turn games. acknowledgement: "Guy Avni: Work partially supported by the Israel Science Foundation, ISF grant agreement\r\nno 1679/21.\r\nThomas A. Henzinger: This work was supported in part by the ERC-2020-AdG 101020093.\r\nWe would like to thank all our collaborators Milad Aghajohari, Ventsislav Chonev, Rasmus Ibsen-Jensen, Ismäel Jecker, Petr Novotný, Josef Tkadlec, and Ðorđe Žikelić; we hope the collaboration was as fun and meaningful for you as it was for us." article_processing_charge: No author: - first_name: Guy full_name: Avni, Guy id: 463C8BC2-F248-11E8-B48F-1D18A9856A87 last_name: Avni orcid: 0000-0001-5588-8287 - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000-0002-2985-7724 citation: ama: 'Avni G, Henzinger TA. An updated survey of bidding games on graphs. In: 47th International Symposium on Mathematical Foundations of Computer Science. Vol 241. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022:3:1-3:6. doi:10.4230/LIPIcs.MFCS.2022.3' apa: 'Avni, G., & Henzinger, T. A. (2022). An updated survey of bidding games on graphs. In 47th International Symposium on Mathematical Foundations of Computer Science (Vol. 241, p. 3:1-3:6). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2022.3' chicago: 'Avni, Guy, and Thomas A Henzinger. “An Updated Survey of Bidding Games on Graphs.” In 47th International Symposium on Mathematical Foundations of Computer Science, 241:3:1-3:6. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. https://doi.org/10.4230/LIPIcs.MFCS.2022.3.' ieee: G. Avni and T. A. Henzinger, “An updated survey of bidding games on graphs,” in 47th International Symposium on Mathematical Foundations of Computer Science, Vienna, Austria, 2022, vol. 241, p. 3:1-3:6. ista: 'Avni G, Henzinger TA. 2022. An updated survey of bidding games on graphs. 47th International Symposium on Mathematical Foundations of Computer Science. MFCS: Symposium on Mathematical Foundations of Computer ScienceLeibniz International Proceedings in Informatics (LIPIcs) vol. 241, 3:1-3:6.' mla: Avni, Guy, and Thomas A. Henzinger. “An Updated Survey of Bidding Games on Graphs.” 47th International Symposium on Mathematical Foundations of Computer Science, vol. 241, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 3:1-3:6, doi:10.4230/LIPIcs.MFCS.2022.3. short: G. Avni, T.A. Henzinger, in:, 47th International Symposium on Mathematical Foundations of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2022, p. 3:1-3:6. conference: end_date: 2022-08-26 location: Vienna, Austria name: 'MFCS: Symposium on Mathematical Foundations of Computer Science' start_date: 2022-08-22 date_created: 2023-02-05T17:26:01Z date_published: 2022-08-22T00:00:00Z date_updated: 2023-02-06T09:16:54Z day: '22' ddc: - '000' department: - _id: ToHe doi: 10.4230/LIPIcs.MFCS.2022.3 ec_funded: 1 file: - access_level: open_access checksum: 1888ec9421622f9526fbec2de035f132 content_type: application/pdf creator: dernst date_created: 2023-02-06T09:13:04Z date_updated: 2023-02-06T09:13:04Z file_id: '12519' file_name: 2022_LIPICs_Avni.pdf file_size: 624586 relation: main_file success: 1 file_date_updated: 2023-02-06T09:13:04Z has_accepted_license: '1' intvolume: ' 241' language: - iso: eng month: '08' oa: 1 oa_version: Published Version page: 3:1-3:6 place: Dagstuhl, Germany project: - _id: 62781420-2b32-11ec-9570-8d9b63373d4d call_identifier: H2020 grant_number: '101020093' name: Vigilant Algorithmic Monitoring of Software publication: 47th International Symposium on Mathematical Foundations of Computer Science publication_identifier: isbn: - '9783959772563' issn: - 1868-8969 publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: '1' series_title: Leibniz International Proceedings in Informatics (LIPIcs) status: public title: An updated survey of bidding games on graphs tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 241 year: '2022' ... --- _id: '12510' abstract: - lang: eng text: "We introduce a new statistical verification algorithm that formally quantifies the behavioral robustness of any time-continuous process formulated as a continuous-depth model. Our algorithm solves a set of global optimization (Go) problems over a given time horizon to construct a tight enclosure (Tube) of the set of all process executions starting from a ball of initial states. We call our algorithm GoTube. Through its construction, GoTube ensures that the bounding tube is conservative up to a desired probability and up to a desired tightness.\r\n GoTube is implemented in JAX and optimized to scale to complex continuous-depth neural network models. Compared to advanced reachability analysis tools for time-continuous neural networks, GoTube does not accumulate overapproximation errors between time steps and avoids the infamous wrapping effect inherent in symbolic techniques. We show that GoTube substantially outperforms state-of-the-art verification tools in terms of the size of the initial ball, speed, time-horizon, task completion, and scalability on a large set of experiments.\r\n GoTube is stable and sets the state-of-the-art in terms of its ability to scale to time horizons well beyond what has been previously possible." acknowledgement: SG is funded by the Austrian Science Fund (FWF) project number W1255-N23. ML and TH are supported in part by FWF under grant Z211-N23 (Wittgenstein Award) and the ERC-2020-AdG 101020093. SS is supported by NSF awards DCL-2040599, CCF-1918225, and CPS-1446832. RH and DR are partially supported by Boeing. RG is partially supported by Horizon-2020 ECSEL Project grant No. 783163 (iDev40). article_processing_charge: No article_type: original arxiv: 1 author: - first_name: Sophie A. full_name: Gruenbacher, Sophie A. last_name: Gruenbacher - first_name: Mathias full_name: Lechner, Mathias id: 3DC22916-F248-11E8-B48F-1D18A9856A87 last_name: Lechner - first_name: Ramin full_name: Hasani, Ramin last_name: Hasani - first_name: Daniela full_name: Rus, Daniela last_name: Rus - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000-0002-2985-7724 - first_name: Scott A. full_name: Smolka, Scott A. last_name: Smolka - first_name: Radu full_name: Grosu, Radu last_name: Grosu citation: ama: 'Gruenbacher SA, Lechner M, Hasani R, et al. GoTube: Scalable statistical verification of continuous-depth models. Proceedings of the AAAI Conference on Artificial Intelligence. 2022;36(6):6755-6764. doi:10.1609/aaai.v36i6.20631' apa: 'Gruenbacher, S. A., Lechner, M., Hasani, R., Rus, D., Henzinger, T. A., Smolka, S. A., & Grosu, R. (2022). GoTube: Scalable statistical verification of continuous-depth models. Proceedings of the AAAI Conference on Artificial Intelligence. Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/aaai.v36i6.20631' chicago: 'Gruenbacher, Sophie A., Mathias Lechner, Ramin Hasani, Daniela Rus, Thomas A Henzinger, Scott A. Smolka, and Radu Grosu. “GoTube: Scalable Statistical Verification of Continuous-Depth Models.” Proceedings of the AAAI Conference on Artificial Intelligence. Association for the Advancement of Artificial Intelligence, 2022. https://doi.org/10.1609/aaai.v36i6.20631.' ieee: 'S. A. Gruenbacher et al., “GoTube: Scalable statistical verification of continuous-depth models,” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 36, no. 6. Association for the Advancement of Artificial Intelligence, pp. 6755–6764, 2022.' ista: 'Gruenbacher SA, Lechner M, Hasani R, Rus D, Henzinger TA, Smolka SA, Grosu R. 2022. GoTube: Scalable statistical verification of continuous-depth models. Proceedings of the AAAI Conference on Artificial Intelligence. 36(6), 6755–6764.' mla: 'Gruenbacher, Sophie A., et al. “GoTube: Scalable Statistical Verification of Continuous-Depth Models.” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 36, no. 6, Association for the Advancement of Artificial Intelligence, 2022, pp. 6755–64, doi:10.1609/aaai.v36i6.20631.' short: S.A. Gruenbacher, M. Lechner, R. Hasani, D. Rus, T.A. Henzinger, S.A. Smolka, R. Grosu, Proceedings of the AAAI Conference on Artificial Intelligence 36 (2022) 6755–6764. date_created: 2023-02-05T17:27:42Z date_published: 2022-06-28T00:00:00Z date_updated: 2023-09-26T10:46:59Z day: '28' department: - _id: ToHe doi: 10.1609/aaai.v36i6.20631 ec_funded: 1 external_id: arxiv: - '2107.08467' intvolume: ' 36' issue: '6' keyword: - General Medicine language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/2107.08467 month: '06' oa: 1 oa_version: Preprint page: 6755-6764 project: - _id: 25F42A32-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z211 name: The Wittgenstein Prize - _id: 62781420-2b32-11ec-9570-8d9b63373d4d call_identifier: H2020 grant_number: '101020093' name: Vigilant Algorithmic Monitoring of Software publication: Proceedings of the AAAI Conference on Artificial Intelligence publication_identifier: eissn: - 2374-3468 isbn: - '978577358350' issn: - 2159-5399 publication_status: published publisher: Association for the Advancement of Artificial Intelligence quality_controlled: '1' scopus_import: '1' status: public title: 'GoTube: Scalable statistical verification of continuous-depth models' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 36 year: '2022' ...