[{"oa_version":"Published Version","file":[{"file_id":"8034","relation":"main_file","checksum":"bd8be6e4f1addc863dfcc0fad29ee9c3","date_updated":"2020-07-14T12:48:08Z","date_created":"2020-06-26T10:03:58Z","access_level":"open_access","file_name":"Kristof_Huszar-Thesis.pdf","creator":"khuszar","content_type":"application/pdf","file_size":2637562},{"access_level":"closed","file_name":"Kristof_Huszar-Thesis-source.zip","creator":"khuszar","file_size":7163491,"content_type":"application/x-zip-compressed","file_id":"8035","relation":"source_file","checksum":"d5f8456202b32f4a77552ef47a2837d1","date_updated":"2020-07-14T12:48:08Z","date_created":"2020-06-26T10:10:06Z"}],"status":"public","title":"Combinatorial width parameters for 3-dimensional manifolds","ddc":["514"],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"8032","abstract":[{"lang":"eng","text":"Algorithms in computational 3-manifold topology typically take a triangulation as an input and return topological information about the underlying 3-manifold. However, extracting the desired information from a triangulation (e.g., evaluating an invariant) is often computationally very expensive. In recent years this complexity barrier has been successfully tackled in some cases by importing ideas from the theory of parameterized algorithms into the realm of 3-manifolds. Various computationally hard problems were shown to be efficiently solvable for input triangulations that are sufficiently “tree-like.”\r\nIn this thesis we focus on the key combinatorial parameter in the above context: we consider the treewidth of a compact, orientable 3-manifold, i.e., the smallest treewidth of the dual graph of any triangulation thereof. By building on the work of Scharlemann–Thompson and Scharlemann–Schultens–Saito on generalized Heegaard splittings, and on the work of Jaco–Rubinstein on layered triangulations, we establish quantitative relations between the treewidth and classical topological invariants of a 3-manifold. In particular, among other results, we show that the treewidth of a closed, orientable, irreducible, non-Haken 3-manifold is always within a constant factor of its Heegaard genus."}],"alternative_title":["ISTA Thesis"],"type":"dissertation","date_published":"2020-06-26T00:00:00Z","page":"xviii+120","citation":{"ista":"Huszár K. 2020. Combinatorial width parameters for 3-dimensional manifolds. Institute of Science and Technology Austria.","apa":"Huszár, K. (2020). Combinatorial width parameters for 3-dimensional manifolds. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:8032","ieee":"K. Huszár, “Combinatorial width parameters for 3-dimensional manifolds,” Institute of Science and Technology Austria, 2020.","ama":"Huszár K. Combinatorial width parameters for 3-dimensional manifolds. 2020. doi:10.15479/AT:ISTA:8032","chicago":"Huszár, Kristóf. “Combinatorial Width Parameters for 3-Dimensional Manifolds.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:8032.","mla":"Huszár, Kristóf. Combinatorial Width Parameters for 3-Dimensional Manifolds. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:8032.","short":"K. Huszár, Combinatorial Width Parameters for 3-Dimensional Manifolds, Institute of Science and Technology Austria, 2020."},"day":"26","article_processing_charge":"No","has_accepted_license":"1","date_updated":"2023-09-07T13:18:27Z","date_created":"2020-06-26T10:00:36Z","author":[{"full_name":"Huszár, Kristóf","first_name":"Kristóf","last_name":"Huszár","id":"33C26278-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5445-5057"}],"related_material":{"record":[{"id":"6556","status":"public","relation":"dissertation_contains"},{"id":"7093","relation":"dissertation_contains","status":"public"}]},"publication_status":"published","publisher":"Institute of Science and Technology Austria","department":[{"_id":"UlWa"}],"year":"2020","file_date_updated":"2020-07-14T12:48:08Z","acknowledged_ssus":[{"_id":"E-Lib"},{"_id":"CampIT"}],"supervisor":[{"orcid":"0000-0002-1494-0568","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","last_name":"Wagner","first_name":"Uli","full_name":"Wagner, Uli"},{"first_name":"Jonathan","last_name":"Spreer","full_name":"Spreer, Jonathan"}],"degree_awarded":"PhD","language":[{"iso":"eng"}],"doi":"10.15479/AT:ISTA:8032","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"month":"06","publication_identifier":{"issn":["2663-337X"],"isbn":["978-3-99078-006-0"]}},{"supervisor":[{"first_name":"Martin","last_name":"Loose","id":"462D4284-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7309-9724","full_name":"Loose, Martin"}],"acknowledged_ssus":[{"_id":"Bio"}],"degree_awarded":"PhD","language":[{"iso":"eng"}],"doi":"10.15479/AT:ISTA:8358","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"month":"09","publication_identifier":{"isbn":["978-3-99078-009-1"],"issn":["2663-337X"]},"date_created":"2020-09-10T09:26:49Z","date_updated":"2023-09-07T13:18:51Z","author":[{"last_name":"Dos Santos Caldas","first_name":"Paulo R","orcid":"0000-0001-6730-4461","id":"38FCDB4C-F248-11E8-B48F-1D18A9856A87","full_name":"Dos Santos Caldas, Paulo R"}],"related_material":{"record":[{"id":"7572","relation":"dissertation_contains","status":"public"},{"relation":"part_of_dissertation","status":"public","id":"7197"}]},"publication_status":"published","department":[{"_id":"MaLo"}],"publisher":"Institute of Science and Technology Austria","acknowledgement":"I should also express my gratitude to the bioimaging facility at IST Austria, for their assistance with the TIRF setup over the years, and especially to Christoph Sommer, who gave me a lot of input when I was starting to dive into programming.","year":"2020","file_date_updated":"2020-09-11T07:48:10Z","date_published":"2020-09-10T00:00:00Z","page":"135","citation":{"mla":"Dos Santos Caldas, Paulo R. Organization and Dynamics of Treadmilling Filaments in Cytoskeletal Networks of FtsZ and Its Crosslinkers. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:8358.","short":"P.R. Dos Santos Caldas, Organization and Dynamics of Treadmilling Filaments in Cytoskeletal Networks of FtsZ and Its Crosslinkers, Institute of Science and Technology Austria, 2020.","chicago":"Dos Santos Caldas, Paulo R. “Organization and Dynamics of Treadmilling Filaments in Cytoskeletal Networks of FtsZ and Its Crosslinkers.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:8358.","ama":"Dos Santos Caldas PR. Organization and dynamics of treadmilling filaments in cytoskeletal networks of FtsZ and its crosslinkers. 2020. doi:10.15479/AT:ISTA:8358","ista":"Dos Santos Caldas PR. 2020. Organization and dynamics of treadmilling filaments in cytoskeletal networks of FtsZ and its crosslinkers. Institute of Science and Technology Austria.","ieee":"P. R. Dos Santos Caldas, “Organization and dynamics of treadmilling filaments in cytoskeletal networks of FtsZ and its crosslinkers,” Institute of Science and Technology Austria, 2020.","apa":"Dos Santos Caldas, P. R. (2020). Organization and dynamics of treadmilling filaments in cytoskeletal networks of FtsZ and its crosslinkers. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:8358"},"day":"10","has_accepted_license":"1","article_processing_charge":"No","oa_version":"Published Version","file":[{"content_type":"application/pdf","file_size":141602462,"creator":"pcaldas","file_name":"phd_thesis_pcaldas.pdf","access_level":"open_access","date_updated":"2020-09-10T12:11:29Z","date_created":"2020-09-10T12:11:29Z","checksum":"882f93fe9c351962120e2669b84bf088","success":1,"relation":"main_file","file_id":"8364"},{"file_id":"8365","relation":"source_file","checksum":"70cc9e399c4e41e6e6ac445ae55e8558","date_created":"2020-09-10T12:18:17Z","date_updated":"2020-09-11T07:48:10Z","access_level":"closed","file_name":"phd_thesis_latex_pcaldas.zip","creator":"pcaldas","file_size":450437458,"content_type":"application/x-zip-compressed"}],"ddc":["572"],"status":"public","title":"Organization and dynamics of treadmilling filaments in cytoskeletal networks of FtsZ and its crosslinkers","_id":"8358","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","abstract":[{"text":"During bacterial cell division, the tubulin-homolog FtsZ forms a ring-like structure at the center of the cell. This so-called Z-ring acts as a scaffold recruiting several division-related proteins to mid-cell and plays a key role in distributing proteins at the division site, a feature driven by the treadmilling motion of FtsZ filaments around the septum. What regulates the architecture, dynamics and stability of the Z-ring is still poorly understood, but FtsZ-associated proteins (Zaps) are known to play an important role. \r\nAdvances in fluorescence microscopy and in vitro reconstitution experiments have helped to shed light into some of the dynamic properties of these complex systems, but methods that allow to collect and analyze large quantitative data sets of the underlying polymer dynamics are still missing.\r\nHere, using an in vitro reconstitution approach, we studied how different Zaps affect FtsZ filament dynamics and organization into large-scale patterns, giving special emphasis to the role of the well-conserved protein ZapA. For this purpose, we use high-resolution fluorescence microscopy combined with novel image analysis workfows to study pattern organization and polymerization dynamics of active filaments. We quantified the influence of Zaps on FtsZ on three diferent spatial scales: the large-scale organization of the membrane-bound filament network, the underlying\r\npolymerization dynamics and the behavior of single molecules.\r\nWe found that ZapA cooperatively increases the spatial order of the filament network, binds only transiently to FtsZ filaments and has no effect on filament length and treadmilling velocity. Our data provides a model for how FtsZ-associated proteins can increase the precision and stability of the bacterial cell division machinery in a\r\nswitch-like manner, without compromising filament dynamics. Furthermore, we believe that our automated quantitative methods can be used to analyze a large variety of dynamic cytoskeletal systems, using standard time-lapse\r\nmovies of homogeneously labeled proteins obtained from experiments in vitro or even inside the living cell.\r\n","lang":"eng"}],"alternative_title":["ISTA Thesis"],"type":"dissertation"},{"doi":"10.15479/AT:ISTA:8332","degree_awarded":"PhD","supervisor":[{"orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A"}],"language":[{"iso":"eng"}],"oa":1,"month":"09","publication_identifier":{"issn":["2663-337X"]},"author":[{"first_name":"Bernhard","last_name":"Kragl","id":"320FC952-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7745-9117","full_name":"Kragl, Bernhard"}],"related_material":{"record":[{"id":"133","relation":"part_of_dissertation","status":"public"},{"id":"8012","relation":"part_of_dissertation","status":"public"},{"relation":"part_of_dissertation","status":"public","id":"8195"},{"id":"160","relation":"part_of_dissertation","status":"public"}]},"date_created":"2020-09-04T12:24:12Z","date_updated":"2023-09-13T08:45:08Z","year":"2020","publication_status":"published","publisher":"Institute of Science and Technology Austria","department":[{"_id":"ToHe"}],"file_date_updated":"2020-09-04T13:00:17Z","date_published":"2020-09-03T00:00:00Z","citation":{"ista":"Kragl B. 2020. Verifying concurrent programs: Refinement, synchronization, sequentialization. Institute of Science and Technology Austria.","apa":"Kragl, B. (2020). Verifying concurrent programs: Refinement, synchronization, sequentialization. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:8332","ieee":"B. Kragl, “Verifying concurrent programs: Refinement, synchronization, sequentialization,” Institute of Science and Technology Austria, 2020.","ama":"Kragl B. Verifying concurrent programs: Refinement, synchronization, sequentialization. 2020. doi:10.15479/AT:ISTA:8332","chicago":"Kragl, Bernhard. “Verifying Concurrent Programs: Refinement, Synchronization, Sequentialization.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:8332.","mla":"Kragl, Bernhard. Verifying Concurrent Programs: Refinement, Synchronization, Sequentialization. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:8332.","short":"B. Kragl, Verifying Concurrent Programs: Refinement, Synchronization, Sequentialization, Institute of Science and Technology Austria, 2020."},"page":"120","day":"03","article_processing_charge":"No","has_accepted_license":"1","file":[{"relation":"main_file","file_id":"8333","date_updated":"2020-09-04T12:17:47Z","date_created":"2020-09-04T12:17:47Z","checksum":"26fe261550f691280bda4c454bf015c7","file_name":"kragl-thesis.pdf","access_level":"open_access","content_type":"application/pdf","file_size":1348815,"creator":"bkragl"},{"content_type":"application/zip","file_size":372312,"creator":"bkragl","access_level":"closed","file_name":"kragl-thesis.zip","checksum":"b9694ce092b7c55557122adba8337ebc","date_updated":"2020-09-04T13:00:17Z","date_created":"2020-09-04T13:00:17Z","relation":"source_file","file_id":"8335"}],"oa_version":"Published Version","_id":"8332","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","title":"Verifying concurrent programs: Refinement, synchronization, sequentialization","status":"public","ddc":["000"],"abstract":[{"text":"Designing and verifying concurrent programs is a notoriously challenging, time consuming, and error prone task, even for experts. This is due to the sheer number of possible interleavings of a concurrent program, all of which have to be tracked and accounted for in a formal proof. Inventing an inductive invariant that captures all interleavings of a low-level implementation is theoretically possible, but practically intractable. We develop a refinement-based verification framework that provides mechanisms to simplify proof construction by decomposing the verification task into smaller subtasks.\r\n\r\nIn a first line of work, we present a foundation for refinement reasoning over structured concurrent programs. We introduce layered concurrent programs as a compact notation to represent multi-layer refinement proofs. A layered concurrent program specifies a sequence of connected concurrent programs, from most concrete to most abstract, such that common parts of different programs are written exactly once. Each program in this sequence is expressed as structured concurrent program, i.e., a program over (potentially recursive) procedures, imperative control flow, gated atomic actions, structured parallelism, and asynchronous concurrency. This is in contrast to existing refinement-based verifiers, which represent concurrent systems as flat transition relations. We present a powerful refinement proof rule that decomposes refinement checking over structured programs into modular verification conditions. Refinement checking is supported by a new form of modular, parameterized invariants, called yield invariants, and a linear permission system to enhance local reasoning.\r\n\r\nIn a second line of work, we present two new reduction-based program transformations that target asynchronous programs. These transformations reduce the number of interleavings that need to be considered, thus reducing the complexity of invariants. Synchronization simplifies the verification of asynchronous programs by introducing the fiction, for proof purposes, that asynchronous operations complete synchronously. Synchronization summarizes an asynchronous computation as immediate atomic effect. Inductive sequentialization establishes sequential reductions that captures every behavior of the original program up to reordering of coarse-grained commutative actions. A sequential reduction of a concurrent program is easy to reason about since it corresponds to a simple execution of the program in an idealized synchronous environment, where processes act in a fixed order and at the same speed.\r\n\r\nOur approach is implemented the CIVL verifier, which has been successfully used for the verification of several complex concurrent programs. In our methodology, the overall correctness of a program is established piecemeal by focusing on the invariant required for each refinement step separately. While the programmer does the creative work of specifying the chain of programs and the inductive invariant justifying each link in the chain, the tool automatically constructs the verification conditions underlying each refinement step.","lang":"eng"}],"type":"dissertation","alternative_title":["ISTA Thesis"]},{"related_material":{"record":[{"id":"5886","status":"public","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"8587"},{"relation":"part_of_dissertation","status":"public","id":"1120"}]},"author":[{"last_name":"Li","first_name":"Xiang","id":"4B7E523C-F248-11E8-B48F-1D18A9856A87","full_name":"Li, Xiang"}],"date_created":"2020-12-21T09:44:30Z","date_updated":"2023-09-20T11:30:58Z","year":"2020","department":[{"_id":"MiLe"}],"publisher":"Institute of Science and Technology Austria","publication_status":"published","ec_funded":1,"file_date_updated":"2020-12-30T07:18:03Z","doi":"10.15479/AT:ISTA:8958","language":[{"iso":"eng"}],"supervisor":[{"last_name":"Lemeshko","first_name":"Mikhail","orcid":"0000-0002-6990-7802","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","full_name":"Lemeshko, Mikhail"}],"degree_awarded":"PhD","oa":1,"project":[{"_id":"26031614-B435-11E9-9278-68D0E5697425","grant_number":"P29902","name":"Quantum rotations in the presence of a many-body environment","call_identifier":"FWF"},{"_id":"2688CF98-B435-11E9-9278-68D0E5697425","grant_number":"801770","name":"Angulon: physics and applications of a new quasiparticle","call_identifier":"H2020"}],"publication_identifier":{"issn":["2663-337X"]},"month":"12","oa_version":"Published Version","file":[{"date_created":"2020-12-22T10:55:56Z","date_updated":"2020-12-22T10:55:56Z","checksum":"3994c54a1241451d561db1d4f43bad30","success":1,"relation":"main_file","file_id":"8967","file_size":3622305,"content_type":"application/pdf","creator":"xli","file_name":"THESIS_Xiang_Li.pdf","access_level":"open_access"},{"checksum":"0954ecfc5554c05615c14de803341f00","date_created":"2020-12-22T10:56:03Z","date_updated":"2020-12-30T07:18:03Z","file_id":"8968","relation":"source_file","creator":"xli","file_size":4018859,"content_type":"application/x-zip-compressed","access_level":"closed","file_name":"THESIS_Xiang_Li.zip"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"8958","status":"public","title":"Rotation of coupled cold molecules in the presence of a many-body environment","ddc":["539"],"abstract":[{"lang":"eng","text":"The oft-quoted dictum by Arthur Schawlow: ``A diatomic molecule has one atom too many'' has been disavowed. Inspired by the possibility to experimentally manipulate and enhance chemical reactivity in helium nanodroplets, we investigate the rotation of coupled cold molecules in the presence of a many-body environment.\r\nIn this thesis, we introduce new variational approaches to quantum impurities and apply them to the Fröhlich polaron - a quasiparticle formed out of an electron (or other point-like impurity) in a polar medium, and to the angulon - a quasiparticle formed out of a rotating molecule in a bosonic bath.\r\nWith this theoretical toolbox, we reveal the self-localization transition for the angulon quasiparticle. We show that, unlike for polarons, self-localization of angulons occurs at finite impurity-bath coupling already at the mean-field level. The transition is accompanied by the spherical-symmetry breaking of the angulon ground state and a discontinuity in the first derivative of the ground-state energy. Moreover, the type of symmetry breaking is dictated by the symmetry of the microscopic impurity-bath interaction, which leads to a number of distinct self-localized states. \r\nFor the system containing multiple impurities, by analogy with the bipolaron, we introduce the biangulon quasiparticle describing two rotating molecules that align with respect to each other due to the effective attractive interaction mediated by the excitations of the bath. We study this system from the strong-coupling regime to the weak molecule-bath interaction regime. We show that the molecules tend to have a strong alignment in the ground state, the biangulon shows shifted angulon instabilities and an additional spectral instability, where resonant angular momentum transfer between the molecules and the bath takes place. Finally, we introduce a diagonalization scheme that allows us to describe the transition from two separated angulons to a biangulon as a function of the distance between the two molecules."}],"type":"dissertation","alternative_title":["ISTA Thesis"],"date_published":"2020-12-21T00:00:00Z","citation":{"ama":"Li X. Rotation of coupled cold molecules in the presence of a many-body environment. 2020. doi:10.15479/AT:ISTA:8958","apa":"Li, X. (2020). Rotation of coupled cold molecules in the presence of a many-body environment. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:8958","ieee":"X. Li, “Rotation of coupled cold molecules in the presence of a many-body environment,” Institute of Science and Technology Austria, 2020.","ista":"Li X. 2020. Rotation of coupled cold molecules in the presence of a many-body environment. Institute of Science and Technology Austria.","short":"X. Li, Rotation of Coupled Cold Molecules in the Presence of a Many-Body Environment, Institute of Science and Technology Austria, 2020.","mla":"Li, Xiang. Rotation of Coupled Cold Molecules in the Presence of a Many-Body Environment. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:8958.","chicago":"Li, Xiang. “Rotation of Coupled Cold Molecules in the Presence of a Many-Body Environment.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:8958."},"page":"125","article_processing_charge":"No","has_accepted_license":"1","day":"21"},{"page":"148","citation":{"apa":"Zhang, R. (2020). Structure-aware computational design and its application to 3D printable volume scattering, mechanism, and multistability. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:8386","ieee":"R. Zhang, “Structure-aware computational design and its application to 3D printable volume scattering, mechanism, and multistability,” Institute of Science and Technology Austria, 2020.","ista":"Zhang R. 2020. Structure-aware computational design and its application to 3D printable volume scattering, mechanism, and multistability. Institute of Science and Technology Austria.","ama":"Zhang R. Structure-aware computational design and its application to 3D printable volume scattering, mechanism, and multistability. 2020. doi:10.15479/AT:ISTA:8386","chicago":"Zhang, Ran. “Structure-Aware Computational Design and Its Application to 3D Printable Volume Scattering, Mechanism, and Multistability.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:8386.","short":"R. Zhang, Structure-Aware Computational Design and Its Application to 3D Printable Volume Scattering, Mechanism, and Multistability, Institute of Science and Technology Austria, 2020.","mla":"Zhang, Ran. Structure-Aware Computational Design and Its Application to 3D Printable Volume Scattering, Mechanism, and Multistability. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:8386."},"date_published":"2020-09-14T00:00:00Z","article_processing_charge":"No","has_accepted_license":"1","day":"14","title":"Structure-aware computational design and its application to 3D printable volume scattering, mechanism, and multistability","ddc":["003"],"status":"public","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"8386","file":[{"creator":"rzhang","file_size":1245800191,"content_type":"application/x-zip-compressed","access_level":"closed","file_name":"Thesis_Ran.zip","checksum":"edcf578b6e1c9b0dd81ff72d319b66ba","date_created":"2020-09-14T01:02:59Z","date_updated":"2020-09-14T12:18:43Z","file_id":"8388","relation":"source_file"},{"date_created":"2020-09-15T12:51:53Z","date_updated":"2020-09-15T12:51:53Z","checksum":"817e20c33be9247f906925517c56a40d","success":1,"relation":"main_file","file_id":"8396","content_type":"application/pdf","file_size":161385316,"creator":"rzhang","file_name":"PhD_thesis_Ran Zhang_20200915.pdf","access_level":"open_access"}],"oa_version":"Published Version","alternative_title":["ISTA Thesis"],"type":"dissertation","abstract":[{"text":"Form versus function is a long-standing debate in various design-related fields, such as architecture as well as graphic and industrial design. A good design that balances form and function often requires considerable human effort and collaboration among experts from different professional fields. Computational design tools provide a new paradigm for designing functional objects. In computational design, form and function are represented as mathematical\r\nquantities, with the help of numerical and combinatorial algorithms, they can assist even novice users in designing versatile models that exhibit their desired functionality. This thesis presents three disparate research studies on the computational design of functional objects: The appearance of 3d print—we optimize the volumetric material distribution for faithfully replicating colored surface texture in 3d printing; the dynamic motion of mechanical structures—\r\nour design system helps the novice user to retarget various mechanical templates with different functionality to complex 3d shapes; and a more abstract functionality, multistability—our algorithm automatically generates models that exhibit multiple stable target poses. For each of these cases, our computational design tools not only ensure the functionality of the results but also permit the user aesthetic freedom over the form. Moreover, fabrication constraints\r\nwere taken into account, which allow for the immediate creation of physical realization via 3D printing or laser cutting.","lang":"eng"}],"project":[{"_id":"2508E324-B435-11E9-9278-68D0E5697425","grant_number":"642841","name":"Distributed 3D Object Design","call_identifier":"H2020"},{"_id":"24F9549A-B435-11E9-9278-68D0E5697425","grant_number":"715767","call_identifier":"H2020","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling"}],"oa":1,"language":[{"iso":"eng"}],"acknowledged_ssus":[{"_id":"SSU"}],"supervisor":[{"first_name":"Bernd","last_name":"Bickel","id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385","full_name":"Bickel, Bernd"}],"degree_awarded":"PhD","doi":"10.15479/AT:ISTA:8386","publication_identifier":{"issn":["2663-337X"]},"month":"09","department":[{"_id":"BeBi"}],"publisher":"Institute of Science and Technology Austria","publication_status":"published","acknowledgement":"The research in this thesis has received funding from the European Union’s Horizon 2020 research and innovation programme, under the Marie Skłodowska-Curie grant agreement No 642841 (DISTRO) and the European Research Council grant agreement No 715767 (MATERIALIZABLE). All the research projects in this thesis were also supported by Scientific Service Units (SSUs) at IST Austria.","year":"2020","date_created":"2020-09-14T01:04:53Z","date_updated":"2023-09-22T09:49:31Z","related_material":{"record":[{"id":"486","status":"public","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"1002"}]},"author":[{"full_name":"Zhang, Ran","id":"4DDBCEB0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3808-281X","first_name":"Ran","last_name":"Zhang"}],"ec_funded":1,"file_date_updated":"2020-09-15T12:51:53Z"},{"abstract":[{"lang":"eng","text":"Quantum computation enables the execution of algorithms that have exponential complexity. This might open the path towards the synthesis of new materials or medical drugs, optimization of transport or financial strategies etc., intractable on even the fastest classical computers. A quantum computer consists of interconnected two level quantum systems, called qubits, that satisfy DiVincezo’s criteria. Worldwide, there are ongoing efforts to find the qubit architecture which will unite quantum error correction compatible single and two qubit fidelities, long distance qubit to qubit coupling and \r\n calability. Superconducting qubits have gone the furthest in this race, demonstrating an algorithm running on 53 coupled qubits, but still the fidelities are not even close to those required for realizing a single logical qubit. emiconductor qubits offer extremely good characteristics, but they are currently investigated across different platforms. Uniting those good characteristics into a single platform might be a big step towards the quantum computer realization.\r\nHere we describe the implementation of a hole spin qubit hosted in a Ge hut wire double quantum dot. The high and tunable spin-orbit coupling together with a heavy hole state character is expected to allow fast spin manipulation and long coherence times. Furthermore large lever arms, for hut wire devices, should allow good coupling to superconducting resonators enabling efficient long distance spin to spin coupling and a sensitive gate reflectometry spin readout. The developed cryogenic setup (printed circuit board sample holders, filtering, high-frequency wiring) enabled us to perform low temperature spin dynamics experiments. Indeed, we measured the fastest single spin qubit Rabi frequencies reported so far, reaching 140 MHz, while the dephasing times of 130 ns oppose the long decoherence predictions. In order to further investigate this, a double quantum dot gate was connected directly to a lumped element\r\nresonator which enabled gate reflectometry readout. The vanishing inter-dot transition signal, for increasing external magnetic field, revealed the spin nature of the measured quantity."}],"type":"dissertation","alternative_title":["ISTA Thesis"],"oa_version":"Published Version","file":[{"checksum":"467e52feb3e361ce8cf5fe8d5c254ece","date_created":"2020-06-22T09:22:04Z","date_updated":"2020-07-14T12:48:07Z","file_id":"7997","relation":"main_file","creator":"dernst","content_type":"application/x-zip-compressed","file_size":392794743,"access_level":"closed","file_name":"JK_thesis_latex_source_files.zip"},{"content_type":"application/pdf","file_size":28453247,"creator":"dernst","file_name":"PhD_thesis_JK_pdfa.pdf","access_level":"open_access","date_created":"2020-06-22T09:21:29Z","date_updated":"2020-07-14T12:48:07Z","checksum":"1de716bf110dbd77d383e479232bf496","relation":"main_file","file_id":"7998"}],"_id":"7996","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","status":"public","title":"Implementation of a hole spin qubit in Ge hut wires and dispersive spin sensing","ddc":["530"],"article_processing_charge":"No","has_accepted_license":"1","day":"22","date_published":"2020-06-22T00:00:00Z","citation":{"ama":"Kukucka J. Implementation of a hole spin qubit in Ge hut wires and dispersive spin sensing. 2020. doi:10.15479/AT:ISTA:7996","ista":"Kukucka J. 2020. Implementation of a hole spin qubit in Ge hut wires and dispersive spin sensing. Institute of Science and Technology Austria.","ieee":"J. Kukucka, “Implementation of a hole spin qubit in Ge hut wires and dispersive spin sensing,” Institute of Science and Technology Austria, 2020.","apa":"Kukucka, J. (2020). Implementation of a hole spin qubit in Ge hut wires and dispersive spin sensing. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:7996","mla":"Kukucka, Josip. Implementation of a Hole Spin Qubit in Ge Hut Wires and Dispersive Spin Sensing. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:7996.","short":"J. Kukucka, Implementation of a Hole Spin Qubit in Ge Hut Wires and Dispersive Spin Sensing, Institute of Science and Technology Austria, 2020.","chicago":"Kukucka, Josip. “Implementation of a Hole Spin Qubit in Ge Hut Wires and Dispersive Spin Sensing.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:7996."},"page":"178","file_date_updated":"2020-07-14T12:48:07Z","related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"1328"},{"id":"7541","relation":"part_of_dissertation","status":"public"},{"relation":"part_of_dissertation","status":"public","id":"77"},{"id":"23","status":"public","relation":"part_of_dissertation"},{"status":"public","relation":"part_of_dissertation","id":"840"}]},"author":[{"full_name":"Kukucka, Josip","first_name":"Josip","last_name":"Kukucka","id":"3F5D8856-F248-11E8-B48F-1D18A9856A87"}],"date_created":"2020-06-22T09:22:23Z","date_updated":"2023-09-26T15:50:22Z","year":"2020","department":[{"_id":"GeKa"}],"publisher":"Institute of Science and Technology Austria","publication_status":"published","publication_identifier":{"issn":["2663-337X"]},"month":"06","doi":"10.15479/AT:ISTA:7996","language":[{"iso":"eng"}],"supervisor":[{"id":"38DB5788-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8342-202X","first_name":"Georgios","last_name":"Katsaros","full_name":"Katsaros, Georgios"}],"degree_awarded":"PhD","oa":1},{"day":"14","article_processing_charge":"No","has_accepted_license":"1","page":"197","citation":{"ista":"Royer A. 2020. Leveraging structure in Computer Vision tasks for flexible Deep Learning models. Institute of Science and Technology Austria.","apa":"Royer, A. (2020). Leveraging structure in Computer Vision tasks for flexible Deep Learning models. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:8390","ieee":"A. Royer, “Leveraging structure in Computer Vision tasks for flexible Deep Learning models,” Institute of Science and Technology Austria, 2020.","ama":"Royer A. Leveraging structure in Computer Vision tasks for flexible Deep Learning models. 2020. doi:10.15479/AT:ISTA:8390","chicago":"Royer, Amélie. “Leveraging Structure in Computer Vision Tasks for Flexible Deep Learning Models.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:8390.","mla":"Royer, Amélie. Leveraging Structure in Computer Vision Tasks for Flexible Deep Learning Models. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:8390.","short":"A. Royer, Leveraging Structure in Computer Vision Tasks for Flexible Deep Learning Models, Institute of Science and Technology Austria, 2020."},"date_published":"2020-09-14T00:00:00Z","alternative_title":["ISTA Thesis"],"type":"dissertation","abstract":[{"text":"Deep neural networks have established a new standard for data-dependent feature extraction pipelines in the Computer Vision literature. Despite their remarkable performance in the standard supervised learning scenario, i.e. when models are trained with labeled data and tested on samples that follow a similar distribution, neural networks have been shown to struggle with more advanced generalization abilities, such as transferring knowledge across visually different domains, or generalizing to new unseen combinations of known concepts. In this thesis we argue that, in contrast to the usual black-box behavior of neural networks, leveraging more structured internal representations is a promising direction\r\nfor tackling such problems. In particular, we focus on two forms of structure. First, we tackle modularity: We show that (i) compositional architectures are a natural tool for modeling reasoning tasks, in that they efficiently capture their combinatorial nature, which is key for generalizing beyond the compositions seen during training. We investigate how to to learn such models, both formally and experimentally, for the task of abstract visual reasoning. Then, we show that (ii) in some settings, modularity allows us to efficiently break down complex tasks into smaller, easier, modules, thereby improving computational efficiency; We study this behavior in the context of generative models for colorization, as well as for small objects detection. Secondly, we investigate the inherently layered structure of representations learned by neural networks, and analyze its role in the context of transfer learning and domain adaptation across visually\r\ndissimilar domains. ","lang":"eng"}],"ddc":["000"],"status":"public","title":"Leveraging structure in Computer Vision tasks for flexible Deep Learning models","_id":"8390","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa_version":"Published Version","file":[{"checksum":"c914d2f88846032f3d8507734861b6ee","success":1,"date_created":"2020-09-14T13:39:14Z","date_updated":"2020-09-14T13:39:14Z","relation":"main_file","file_id":"8391","file_size":30224591,"content_type":"application/pdf","creator":"dernst","access_level":"open_access","file_name":"2020_Thesis_Royer.pdf"},{"checksum":"ae98fb35d912cff84a89035ae5794d3c","date_created":"2020-09-14T13:39:17Z","date_updated":"2020-09-14T13:39:17Z","relation":"main_file","file_id":"8392","content_type":"application/x-zip-compressed","file_size":74227627,"creator":"dernst","access_level":"closed","file_name":"thesis_sources.zip"}],"month":"09","publication_identifier":{"issn":["2663-337X"],"isbn":["978-3-99078-007-7"]},"tmp":{"name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","image":"/images/cc_by_nc_sa.png","short":"CC BY-NC-SA (4.0)"},"oa":1,"degree_awarded":"PhD","supervisor":[{"last_name":"Lampert","first_name":"Christoph","orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","full_name":"Lampert, Christoph"}],"acknowledged_ssus":[{"_id":"CampIT"},{"_id":"ScienComp"}],"language":[{"iso":"eng"}],"doi":"10.15479/AT:ISTA:8390","license":"https://creativecommons.org/licenses/by-nc-sa/4.0/","file_date_updated":"2020-09-14T13:39:17Z","publication_status":"published","department":[{"_id":"ChLa"}],"publisher":"Institute of Science and Technology Austria","year":"2020","acknowledgement":"Last but not least, I would like to acknowledge the support of the IST IT and scientific computing team for helping provide a great work environment.","date_updated":"2023-10-16T10:04:02Z","date_created":"2020-09-14T13:42:09Z","author":[{"full_name":"Royer, Amélie","first_name":"Amélie","last_name":"Royer","id":"3811D890-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8407-0705"}],"related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"7936"},{"status":"public","relation":"part_of_dissertation","id":"7937"},{"id":"8193","status":"public","relation":"part_of_dissertation"},{"id":"8092","status":"public","relation":"part_of_dissertation"},{"id":"911","status":"public","relation":"part_of_dissertation"}]}},{"citation":{"chicago":"Tkadlec, Josef. “A Role of Graphs in Evolutionary Processes.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:7196.","mla":"Tkadlec, Josef. A Role of Graphs in Evolutionary Processes. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:7196.","short":"J. Tkadlec, A Role of Graphs in Evolutionary Processes, Institute of Science and Technology Austria, 2020.","ista":"Tkadlec J. 2020. A role of graphs in evolutionary processes. Institute of Science and Technology Austria.","apa":"Tkadlec, J. (2020). A role of graphs in evolutionary processes. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:7196","ieee":"J. Tkadlec, “A role of graphs in evolutionary processes,” Institute of Science and Technology Austria, 2020.","ama":"Tkadlec J. A role of graphs in evolutionary processes. 2020. doi:10.15479/AT:ISTA:7196"},"page":"144","date_published":"2020-01-12T00:00:00Z","article_processing_charge":"No","has_accepted_license":"1","day":"12","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"7196","status":"public","ddc":["519"],"title":"A role of graphs in evolutionary processes","oa_version":"Published Version","file":[{"creator":"jtkadlec","file_size":21100497,"content_type":"application/zip","file_name":"thesis.zip","access_level":"closed","date_created":"2020-01-12T11:49:49Z","date_updated":"2020-07-14T12:47:52Z","checksum":"451f8e64b0eb26bf297644ac72bfcbe9","file_id":"7255","relation":"source_file"},{"file_name":"2020_Tkadlec_Thesis.pdf","access_level":"open_access","content_type":"application/pdf","file_size":11670983,"creator":"dernst","relation":"main_file","file_id":"7367","date_updated":"2020-07-14T12:47:52Z","date_created":"2020-01-28T07:32:42Z","checksum":"d8c44cbc4f939c49a8efc9d4b8bb3985"}],"type":"dissertation","alternative_title":["ISTA Thesis"],"abstract":[{"text":"In this thesis we study certain mathematical aspects of evolution. The two primary forces that drive an evolutionary process are mutation and selection. Mutation generates new variants in a population. Selection chooses among the variants depending on the reproductive rates of individuals. Evolutionary processes are intrinsically random – a new mutation that is initially present in the population at low frequency can go extinct, even if it confers a reproductive advantage. The overall rate of evolution is largely determined by two quantities: the probability that an invading advantageous mutation spreads through the population (called fixation probability) and the time until it does so (called fixation time). Both those quantities crucially depend not only on the strength of the invading mutation but also on the population structure. In this thesis, we aim to understand how the underlying population structure affects the overall rate of evolution. Specifically, we study population structures that increase the fixation probability of advantageous mutants (called amplifiers of selection). Broadly speaking, our results are of three different types: We present various strong amplifiers, we identify regimes under which only limited amplification is feasible, and we propose population structures that provide different tradeoffs between high fixation probability and short fixation time.","lang":"eng"}],"oa":1,"doi":"10.15479/AT:ISTA:7196","language":[{"iso":"eng"}],"supervisor":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"}],"degree_awarded":"PhD","publication_identifier":{"eissn":["2663-337X"]},"month":"01","year":"2020","department":[{"_id":"KrCh"},{"_id":"GradSch"}],"publisher":"Institute of Science and Technology Austria","publication_status":"published","related_material":{"record":[{"id":"7210","status":"public","relation":"dissertation_contains"},{"status":"public","relation":"dissertation_contains","id":"5751"},{"id":"7212","status":"public","relation":"dissertation_contains"}]},"author":[{"full_name":"Tkadlec, Josef","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1097-9684","first_name":"Josef","last_name":"Tkadlec"}],"date_created":"2019-12-20T12:26:36Z","date_updated":"2023-10-17T12:29:46Z","file_date_updated":"2020-07-14T12:47:52Z"},{"oa":1,"degree_awarded":"PhD","supervisor":[{"full_name":"Wagner, Uli","last_name":"Wagner","first_name":"Uli","orcid":"0000-0002-1494-0568","id":"36690CA2-F248-11E8-B48F-1D18A9856A87"}],"language":[{"iso":"eng"}],"doi":"10.15479/AT:ISTA:8156","month":"07","publication_identifier":{"issn":["2663-337X"]},"publication_status":"published","publisher":"Institute of Science and Technology Austria","department":[{"_id":"UlWa"}],"year":"2020","date_updated":"2023-12-18T10:51:01Z","date_created":"2020-07-23T09:51:29Z","author":[{"id":"3827DAC8-F248-11E8-B48F-1D18A9856A87","first_name":"Sergey","last_name":"Avvakumov","full_name":"Avvakumov, Sergey"}],"related_material":{"record":[{"id":"8182","relation":"part_of_dissertation","status":"public"},{"relation":"part_of_dissertation","status":"public","id":"8183"},{"id":"8185","relation":"part_of_dissertation","status":"public"},{"relation":"part_of_dissertation","status":"public","id":"8184"},{"relation":"part_of_dissertation","status":"public","id":"6355"},{"relation":"part_of_dissertation","status":"public","id":"75"}]},"file_date_updated":"2020-07-27T12:46:53Z","page":"119","citation":{"chicago":"Avvakumov, Sergey. “Topological Methods in Geometry and Discrete Mathematics.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:8156.","short":"S. Avvakumov, Topological Methods in Geometry and Discrete Mathematics, Institute of Science and Technology Austria, 2020.","mla":"Avvakumov, Sergey. Topological Methods in Geometry and Discrete Mathematics. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:8156.","ieee":"S. Avvakumov, “Topological methods in geometry and discrete mathematics,” Institute of Science and Technology Austria, 2020.","apa":"Avvakumov, S. (2020). Topological methods in geometry and discrete mathematics. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:8156","ista":"Avvakumov S. 2020. Topological methods in geometry and discrete mathematics. Institute of Science and Technology Austria.","ama":"Avvakumov S. Topological methods in geometry and discrete mathematics. 2020. doi:10.15479/AT:ISTA:8156"},"date_published":"2020-07-24T00:00:00Z","day":"24","article_processing_charge":"No","has_accepted_license":"1","status":"public","title":"Topological methods in geometry and discrete mathematics","ddc":["514"],"_id":"8156","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa_version":"Published Version","file":[{"file_name":"source.zip","access_level":"closed","creator":"savvakum","content_type":"application/zip","file_size":1061740,"file_id":"8178","relation":"source_file","date_created":"2020-07-27T12:44:51Z","date_updated":"2020-07-27T12:44:51Z"},{"file_name":"thesis_pdfa.pdf","access_level":"open_access","creator":"savvakum","file_size":1336501,"content_type":"application/pdf","file_id":"8179","relation":"main_file","date_updated":"2020-07-27T12:46:53Z","date_created":"2020-07-27T12:46:53Z","success":1}],"alternative_title":["ISTA Thesis"],"type":"dissertation","abstract":[{"text":"We present solutions to several problems originating from geometry and discrete mathematics: existence of equipartitions, maps without Tverberg multiple points, and inscribing quadrilaterals. Equivariant obstruction theory is the natural topological approach to these type of questions. However, for the specific problems we consider it had yielded only partial or no results. We get our results by complementing equivariant obstruction theory with other techniques from topology and geometry.","lang":"eng"}]},{"article_processing_charge":"No","has_accepted_license":"1","day":"21","keyword":["computer-aided design","shape modeling","self-morphing","mechanical engineering"],"date_published":"2020-09-21T00:00:00Z","page":"118","citation":{"ista":"Guseinov R. 2020. Computational design of curved thin shells: From glass façades to programmable matter. Institute of Science and Technology Austria.","apa":"Guseinov, R. (2020). Computational design of curved thin shells: From glass façades to programmable matter. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:8366","ieee":"R. Guseinov, “Computational design of curved thin shells: From glass façades to programmable matter,” Institute of Science and Technology Austria, 2020.","ama":"Guseinov R. Computational design of curved thin shells: From glass façades to programmable matter. 2020. doi:10.15479/AT:ISTA:8366","chicago":"Guseinov, Ruslan. “Computational Design of Curved Thin Shells: From Glass Façades to Programmable Matter.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:8366.","mla":"Guseinov, Ruslan. Computational Design of Curved Thin Shells: From Glass Façades to Programmable Matter. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:8366.","short":"R. Guseinov, Computational Design of Curved Thin Shells: From Glass Façades to Programmable Matter, Institute of Science and Technology Austria, 2020."},"abstract":[{"lang":"eng","text":"Fabrication of curved shells plays an important role in modern design, industry, and science. Among their remarkable properties are, for example, aesthetics of organic shapes, ability to evenly distribute loads, or efficient flow separation. They find applications across vast length scales ranging from sky-scraper architecture to microscopic devices. But, at\r\nthe same time, the design of curved shells and their manufacturing process pose a variety of challenges. In this thesis, they are addressed from several perspectives. In particular, this thesis presents approaches based on the transformation of initially flat sheets into the target curved surfaces. This involves problems of interactive design of shells with nontrivial mechanical constraints, inverse design of complex structural materials, and data-driven modeling of delicate and time-dependent physical properties. At the same time, two newly-developed self-morphing mechanisms targeting flat-to-curved transformation are presented.\r\nIn architecture, doubly curved surfaces can be realized as cold bent glass panelizations. Originally flat glass panels are bent into frames and remain stressed. This is a cost-efficient fabrication approach compared to hot bending, when glass panels are shaped plastically. However such constructions are prone to breaking during bending, and it is highly\r\nnontrivial to navigate the design space, keeping the panels fabricable and aesthetically pleasing at the same time. We introduce an interactive design system for cold bent glass façades, while previously even offline optimization for such scenarios has not been sufficiently developed. Our method is based on a deep learning approach providing quick\r\nand high precision estimation of glass panel shape and stress while handling the shape\r\nmultimodality.\r\nFabrication of smaller objects of scales below 1 m, can also greatly benefit from shaping originally flat sheets. In this respect, we designed new self-morphing shell mechanisms transforming from an initial flat state to a doubly curved state with high precision and detail. Our so-called CurveUps demonstrate the encodement of the geometric information\r\ninto the shell. Furthermore, we explored the frontiers of programmable materials and showed how temporal information can additionally be encoded into a flat shell. This allows prescribing deformation sequences for doubly curved surfaces and, thus, facilitates self-collision avoidance enabling complex shapes and functionalities otherwise impossible.\r\nBoth of these methods include inverse design tools keeping the user in the design loop."}],"alternative_title":["ISTA Thesis"],"type":"dissertation","oa_version":"Published Version","file":[{"relation":"main_file","file_id":"8367","checksum":"f8da89553da36037296b0a80f14ebf50","success":1,"date_created":"2020-09-10T16:11:49Z","date_updated":"2020-09-10T16:11:49Z","access_level":"open_access","file_name":"thesis_rguseinov.pdf","file_size":70950442,"content_type":"application/pdf","creator":"rguseino"},{"date_updated":"2020-09-16T15:11:01Z","date_created":"2020-09-11T09:39:48Z","checksum":"e8fd944c960c20e0e27e6548af69121d","relation":"source_file","file_id":"8374","file_size":76207597,"content_type":"application/x-zip-compressed","creator":"rguseino","file_name":"thesis_source.zip","access_level":"closed"}],"title":"Computational design of curved thin shells: From glass façades to programmable matter","ddc":["000"],"status":"public","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"8366","publication_identifier":{"isbn":["978-3-99078-010-7"],"issn":["2663-337X"]},"month":"09","language":[{"iso":"eng"}],"degree_awarded":"PhD","supervisor":[{"full_name":"Bickel, Bernd","first_name":"Bernd","last_name":"Bickel","id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385"}],"acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"ScienComp"}],"doi":"10.15479/AT:ISTA:8366","project":[{"_id":"24F9549A-B435-11E9-9278-68D0E5697425","grant_number":"715767","call_identifier":"H2020","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling"}],"oa":1,"ec_funded":1,"file_date_updated":"2020-09-16T15:11:01Z","date_created":"2020-09-10T16:19:55Z","date_updated":"2024-02-21T12:44:29Z","related_material":{"record":[{"id":"7151","status":"deleted","relation":"research_data"},{"id":"7262","relation":"part_of_dissertation","status":"public"},{"relation":"part_of_dissertation","status":"public","id":"8562"},{"status":"public","relation":"part_of_dissertation","id":"1001"},{"relation":"research_data","status":"public","id":"8375"}]},"author":[{"full_name":"Guseinov, Ruslan","id":"3AB45EE2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9819-5077","first_name":"Ruslan","last_name":"Guseinov"}],"department":[{"_id":"BeBi"}],"publisher":"Institute of Science and Technology Austria","publication_status":"published","acknowledgement":"During the work on this thesis, I received substantial support from IST Austria’s scientific service units. A big thank you to Todor Asenov and other Miba Machine Shop team members for their help with fabrication of experimental prototypes. In addition, I would like to thank Scientific Computing team for the support with high performance computing.\r\nFinancial support was provided by the European Research Council (ERC) under grant agreement No 715767 - MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling, which I gratefully acknowledge.","year":"2020"}]