[{"title":"Biochemical and structural investigation of the Mrp antiporter, an ancestor of complex I","publication_status":"published","file_date_updated":"2021-09-16T12:40:56Z","oa_version":"None","article_processing_charge":"No","doi":"10.15479/AT:ISTA:8353","acknowledgement":"I acknowledge the scientific service units of the IST Austria for providing resources by the Life Science Facility, the Electron Microscopy Facility and the high-performance computer cluster. Special thanks to the cryo-EM specialists Valentin Hodirnau and Daniel Johann Gütl for spending many hours with me in front of the microscope and for supporting me to collect the data presented here. I also want to thank Professor Masahiro Ito for providing plasmid DNA\r\nencoding Mrp from Anoxybacillus flavithermus WK1. I am a recipient of a DOC Fellowship of the Austrian Academy of Sciences.","publication_identifier":{"issn":["2663-337X"]},"_id":"8353","file":[{"file_size":117547589,"relation":"main_file","date_updated":"2021-09-16T12:40:56Z","date_created":"2020-09-09T14:22:35Z","file_name":"Thesis_Julia_Steiner_pdfA.pdf","access_level":"open_access","checksum":"2388d7e6e7a4d364c096fa89f305c3de","content_type":"application/pdf","creator":"jsteiner","file_id":"8354"},{"date_updated":"2020-09-15T08:48:37Z","file_size":223328668,"date_created":"2020-09-09T14:23:25Z","relation":"source_file","access_level":"closed","file_name":"Thesis_Julia_Steiner.docx","checksum":"ba112f957b7145462d0ab79044873ee9","creator":"jsteiner","file_id":"8355","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document"}],"date_created":"2020-09-09T14:27:01Z","year":"2020","citation":{"ista":"Steiner J. 2020. Biochemical and structural investigation of the Mrp antiporter, an ancestor of complex I. Institute of Science and Technology Austria.","ieee":"J. Steiner, “Biochemical and structural investigation of the Mrp antiporter, an ancestor of complex I,” Institute of Science and Technology Austria, 2020.","ama":"Steiner J. Biochemical and structural investigation of the Mrp antiporter, an ancestor of complex I. 2020. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8353\">10.15479/AT:ISTA:8353</a>","short":"J. Steiner, Biochemical and Structural Investigation of the Mrp Antiporter, an Ancestor of Complex I, Institute of Science and Technology Austria, 2020.","apa":"Steiner, J. (2020). <i>Biochemical and structural investigation of the Mrp antiporter, an ancestor of complex I</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:8353\">https://doi.org/10.15479/AT:ISTA:8353</a>","chicago":"Steiner, Julia. “Biochemical and Structural Investigation of the Mrp Antiporter, an Ancestor of Complex I.” Institute of Science and Technology Austria, 2020. <a href=\"https://doi.org/10.15479/AT:ISTA:8353\">https://doi.org/10.15479/AT:ISTA:8353</a>.","mla":"Steiner, Julia. <i>Biochemical and Structural Investigation of the Mrp Antiporter, an Ancestor of Complex I</i>. Institute of Science and Technology Austria, 2020, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8353\">10.15479/AT:ISTA:8353</a>."},"abstract":[{"text":"Mrp (Multi resistance and pH adaptation) are broadly distributed secondary active antiporters that catalyze the transport of monovalent ions such as sodium and potassium outside of the cell coupled to the inward translocation of protons. Mrp antiporters are unique in a way that they are composed of seven subunits (MrpABCDEFG) encoded in a single operon, whereas other antiporters catalyzing the same reaction are mostly encoded by a single gene. Mrp exchangers are crucial for intracellular pH homeostasis and Na+ efflux, essential mechanisms for H+ uptake under alkaline environments and for reduction of the intracellular concentration of toxic cations. Mrp displays no homology to any other monovalent Na+(K+)/H+ antiporters but Mrp subunits have primary sequence similarity to essential redox-driven proton pumps, such as respiratory complex I and membrane-bound hydrogenases. This similarity reinforces the hypothesis that these present day redox-driven proton pumps are descended from the Mrp antiporter. The Mrp structure serves as a model to understand the yet obscure coupling mechanism between ion or electron transfer and proton translocation in this large group of proteins. In the thesis, I am presenting the purification, biochemical analysis, cryo-EM analysis and molecular structure of the Mrp complex from Anoxybacillus flavithermus solved by cryo-EM at 3.0 Å resolution. Numerous conditions were screened to purify Mrp to high homogeneity and to obtain an appropriate distribution of single particles on cryo-EM grids covered with a continuous layer of ultrathin carbon. A preferred particle orientation problem was solved by performing a tilted data collection. The activity assays showed the specific pH-dependent\r\nprofile of secondary active antiporters. The molecular structure shows that Mrp is a dimer of seven-subunit protomers with 50 trans-membrane helices each. The dimer interface is built by many short and tilted transmembrane helices, probably causing a thinning of the bacterial membrane. The surface charge distribution shows an extraordinary asymmetry within each monomer, revealing presumable proton and sodium translocation pathways. The two largest\r\nand homologous Mrp subunits MrpA and MrpD probably translocate one proton each into the cell. The sodium ion is likely being translocated in the opposite direction within the small subunits along a ladder of charged and conserved residues. Based on the structure, we propose a mechanism were the antiport activity is accomplished via electrostatic interactions between the charged cations and key charged residues. The flexible key TM helices coordinate these\r\nelectrostatic interactions, while the membrane thinning between the monomers enables the translocation of sodium across the charged membrane. The entire family of redox-driven proton pumps is likely to perform their mechanism in a likewise manner.","lang":"eng"}],"supervisor":[{"first_name":"Leonid A","last_name":"Sazanov","id":"338D39FE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0977-7989","full_name":"Sazanov, Leonid A"}],"acknowledged_ssus":[{"_id":"LifeSc"},{"_id":"EM-Fac"},{"_id":"ScienComp"}],"oa":1,"related_material":{"record":[{"id":"8284","relation":"part_of_dissertation","status":"public"}]},"author":[{"full_name":"Steiner, Julia","orcid":"0000-0003-0493-3775","id":"3BB67EB0-F248-11E8-B48F-1D18A9856A87","last_name":"Steiner","first_name":"Julia"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","department":[{"_id":"LeSa"}],"date_updated":"2023-09-07T13:14:09Z","degree_awarded":"PhD","page":"191","day":"09","has_accepted_license":"1","project":[{"grant_number":"24741","name":"Revealing the functional mechanism of Mrp antiporter, an ancestor of complex I","_id":"26169496-B435-11E9-9278-68D0E5697425"}],"date_published":"2020-09-09T00:00:00Z","type":"dissertation","publisher":"Institute of Science and Technology Austria","month":"09","status":"public","language":[{"iso":"eng"}],"ddc":["572"],"alternative_title":["ISTA Thesis"]},{"status":"public","month":"09","alternative_title":["ISTA Thesis"],"language":[{"iso":"eng"}],"ddc":["572"],"date_published":"2020-09-10T00:00:00Z","type":"dissertation","publisher":"Institute of Science and Technology Austria","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"has_accepted_license":"1","day":"10","page":"135","date_updated":"2023-09-07T13:18:51Z","department":[{"_id":"MaLo"}],"degree_awarded":"PhD","related_material":{"record":[{"id":"7572","relation":"dissertation_contains","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"7197"}]},"oa":1,"acknowledged_ssus":[{"_id":"Bio"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"full_name":"Dos Santos Caldas, Paulo R","orcid":"0000-0001-6730-4461","id":"38FCDB4C-F248-11E8-B48F-1D18A9856A87","last_name":"Dos Santos Caldas","first_name":"Paulo R"}],"_id":"8358","date_created":"2020-09-10T09:26:49Z","file":[{"file_name":"phd_thesis_pcaldas.pdf","access_level":"open_access","success":1,"file_size":141602462,"date_created":"2020-09-10T12:11:29Z","date_updated":"2020-09-10T12:11:29Z","relation":"main_file","content_type":"application/pdf","file_id":"8364","creator":"pcaldas","checksum":"882f93fe9c351962120e2669b84bf088"},{"access_level":"closed","file_name":"phd_thesis_latex_pcaldas.zip","file_size":450437458,"date_updated":"2020-09-11T07:48:10Z","date_created":"2020-09-10T12:18:17Z","relation":"source_file","content_type":"application/x-zip-compressed","file_id":"8365","creator":"pcaldas","checksum":"70cc9e399c4e41e6e6ac445ae55e8558"}],"supervisor":[{"orcid":"0000-0001-7309-9724","id":"462D4284-F248-11E8-B48F-1D18A9856A87","full_name":"Loose, Martin","first_name":"Martin","last_name":"Loose"}],"abstract":[{"lang":"eng","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"}],"year":"2020","citation":{"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.","ama":"Dos Santos Caldas PR. Organization and dynamics of treadmilling filaments in cytoskeletal networks of FtsZ and its crosslinkers. 2020. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8358\">10.15479/AT:ISTA:8358</a>","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. <a href=\"https://doi.org/10.15479/AT:ISTA:8358\">https://doi.org/10.15479/AT:ISTA:8358</a>.","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.","apa":"Dos Santos Caldas, P. R. (2020). <i>Organization and dynamics of treadmilling filaments in cytoskeletal networks of FtsZ and its crosslinkers</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:8358\">https://doi.org/10.15479/AT:ISTA:8358</a>","mla":"Dos Santos Caldas, Paulo R. <i>Organization and Dynamics of Treadmilling Filaments in Cytoskeletal Networks of FtsZ and Its Crosslinkers</i>. Institute of Science and Technology Austria, 2020, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8358\">10.15479/AT:ISTA:8358</a>."},"file_date_updated":"2020-09-11T07:48:10Z","article_processing_charge":"No","oa_version":"Published Version","publication_status":"published","title":"Organization and dynamics of treadmilling filaments in cytoskeletal networks of FtsZ and its crosslinkers","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.","publication_identifier":{"issn":["2663-337X"],"isbn":["978-3-99078-009-1"]},"doi":"10.15479/AT:ISTA:8358"},{"date_updated":"2023-08-22T09:20:37Z","publication":"Journal of Power Sources","department":[{"_id":"StFr"}],"intvolume":"       480","volume":480,"oa":1,"related_material":{"record":[{"id":"8067","relation":"earlier_version","status":"public"}]},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","author":[{"last_name":"Varzi","first_name":"Alberto","full_name":"Varzi, Alberto","orcid":"0000-0001-5069-0589"},{"orcid":"0000-0001-5394-2323","full_name":"Thanner, Katharina","first_name":"Katharina","last_name":"Thanner"},{"full_name":"Scipioni, Roberto","orcid":"0000-0003-1926-421X","last_name":"Scipioni","first_name":"Roberto"},{"full_name":"Di Lecce, Daniele","first_name":"Daniele","last_name":"Di Lecce"},{"full_name":"Hassoun, Jusef","first_name":"Jusef","last_name":"Hassoun"},{"first_name":"Susanne","last_name":"Dörfler","full_name":"Dörfler, Susanne"},{"full_name":"Altheus, Holger","last_name":"Altheus","first_name":"Holger"},{"full_name":"Kaskel, Stefan","last_name":"Kaskel","first_name":"Stefan"},{"orcid":"0000-0003-0654-0940","full_name":"Prehal, Christian","first_name":"Christian","last_name":"Prehal"},{"last_name":"Freunberger","first_name":"Stefan Alexander","full_name":"Freunberger, Stefan Alexander","orcid":"0000-0003-2902-5319","id":"A8CA28E6-CE23-11E9-AD2D-EC27E6697425"}],"date_created":"2020-09-10T10:48:40Z","_id":"8361","abstract":[{"lang":"eng","text":"With the lithium-ion technology approaching its intrinsic limit with graphite-based anodes, Li metal is recently receiving renewed interest from the battery community as potential high capacity anode for next-generation rechargeable batteries. In this focus paper, we review the main advances in this field since the first attempts in the mid-1970s. Strategies for enabling reversible cycling and avoiding dendrite growth are thoroughly discussed, including specific applications in all-solid-state (inorganic and polymeric), Lithium–Sulfur (Li–S) and Lithium-O2 (air) batteries. A particular attention is paid to recent developments of these battery technologies and their current state with respect to the 2030 targets of the EU Integrated Strategic Energy Technology Plan (SET-Plan) Action 7."}],"citation":{"mla":"Varzi, Alberto, et al. “Current Status and Future Perspectives of Lithium Metal Batteries.” <i>Journal of Power Sources</i>, vol. 480, no. 12, 228803, Elsevier, 2020, doi:<a href=\"https://doi.org/10.1016/j.jpowsour.2020.228803\">10.1016/j.jpowsour.2020.228803</a>.","short":"A. Varzi, K. Thanner, R. Scipioni, D. Di Lecce, J. Hassoun, S. Dörfler, H. Altheus, S. Kaskel, C. Prehal, S.A. Freunberger, Journal of Power Sources 480 (2020).","chicago":"Varzi, Alberto, Katharina Thanner, Roberto Scipioni, Daniele Di Lecce, Jusef Hassoun, Susanne Dörfler, Holger Altheus, Stefan Kaskel, Christian Prehal, and Stefan Alexander Freunberger. “Current Status and Future Perspectives of Lithium Metal Batteries.” <i>Journal of Power Sources</i>. Elsevier, 2020. <a href=\"https://doi.org/10.1016/j.jpowsour.2020.228803\">https://doi.org/10.1016/j.jpowsour.2020.228803</a>.","apa":"Varzi, A., Thanner, K., Scipioni, R., Di Lecce, D., Hassoun, J., Dörfler, S., … Freunberger, S. A. (2020). Current status and future perspectives of lithium metal batteries. <i>Journal of Power Sources</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jpowsour.2020.228803\">https://doi.org/10.1016/j.jpowsour.2020.228803</a>","ama":"Varzi A, Thanner K, Scipioni R, et al. Current status and future perspectives of lithium metal batteries. <i>Journal of Power Sources</i>. 2020;480(12). doi:<a href=\"https://doi.org/10.1016/j.jpowsour.2020.228803\">10.1016/j.jpowsour.2020.228803</a>","ieee":"A. Varzi <i>et al.</i>, “Current status and future perspectives of lithium metal batteries,” <i>Journal of Power Sources</i>, vol. 480, no. 12. Elsevier, 2020.","ista":"Varzi A, Thanner K, Scipioni R, Di Lecce D, Hassoun J, Dörfler S, Altheus H, Kaskel S, Prehal C, Freunberger SA. 2020. Current status and future perspectives of lithium metal batteries. Journal of Power Sources. 480(12), 228803."},"article_number":"228803","year":"2020","oa_version":"Published Version","article_processing_charge":"No","publication_status":"published","title":"Current status and future perspectives of lithium metal batteries","publication_identifier":{"issn":["0378-7753"]},"acknowledgement":"A.V. and K.T. acknowledge, respectively, the financial support of the Helmholtz Association and BMW AG. J.H. acknowledges the collabo-ration project “Accordo di Collaborazione Quadro 2015” between Uni-versity of  Ferrara (Department of  Chemical and Pharmaceutical Sciences) and Sapienza University of Rome (Department of Chemistry). S.D., H.A. and S.K. thank the Fraunhofer Gesellschaft, Technische Uni-versit ̈at  Dresden and would like to  acknowledge European Union’s Horizon 2020 research and innovation programme under grant agree-ment No 814471. S.A.F. and C.P. are indebted to the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation program (grant agreement no. 636069) and IST Austria.","article_type":"original","main_file_link":[{"url":"https://doi.org/10.1016/j.jpowsour.2020.228803","open_access":"1"}],"doi":"10.1016/j.jpowsour.2020.228803","status":"public","isi":1,"month":"12","language":[{"iso":"eng"}],"type":"journal_article","external_id":{"isi":["000593857300001"]},"date_published":"2020-12-31T00:00:00Z","publisher":"Elsevier","issue":"12","quality_controlled":"1","day":"31"},{"_id":"8366","date_created":"2020-09-10T16:19:55Z","file":[{"date_updated":"2020-09-10T16:11:49Z","relation":"main_file","file_size":70950442,"date_created":"2020-09-10T16:11:49Z","file_name":"thesis_rguseinov.pdf","access_level":"open_access","success":1,"checksum":"f8da89553da36037296b0a80f14ebf50","file_id":"8367","creator":"rguseino","content_type":"application/pdf"},{"file_name":"thesis_source.zip","access_level":"closed","file_size":76207597,"relation":"source_file","date_updated":"2020-09-16T15:11:01Z","date_created":"2020-09-11T09:39:48Z","content_type":"application/x-zip-compressed","file_id":"8374","creator":"rguseino","checksum":"e8fd944c960c20e0e27e6548af69121d"}],"year":"2020","citation":{"mla":"Guseinov, Ruslan. <i>Computational Design of Curved Thin Shells: From Glass Façades to Programmable Matter</i>. Institute of Science and Technology Austria, 2020, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8366\">10.15479/AT:ISTA:8366</a>.","short":"R. Guseinov, Computational Design of Curved Thin Shells: From Glass Façades to Programmable Matter, Institute of Science and Technology Austria, 2020.","chicago":"Guseinov, Ruslan. “Computational Design of Curved Thin Shells: From Glass Façades to Programmable Matter.” Institute of Science and Technology Austria, 2020. <a href=\"https://doi.org/10.15479/AT:ISTA:8366\">https://doi.org/10.15479/AT:ISTA:8366</a>.","apa":"Guseinov, R. (2020). <i>Computational design of curved thin shells: From glass façades to programmable matter</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:8366\">https://doi.org/10.15479/AT:ISTA:8366</a>","ieee":"R. Guseinov, “Computational design of curved thin shells: From glass façades to programmable matter,” Institute of Science and Technology Austria, 2020.","ista":"Guseinov R. 2020. Computational design of curved thin shells: From glass façades to programmable matter. Institute of Science and Technology Austria.","ama":"Guseinov R. Computational design of curved thin shells: From glass façades to programmable matter. 2020. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8366\">10.15479/AT:ISTA:8366</a>"},"supervisor":[{"last_name":"Bickel","first_name":"Bernd","full_name":"Bickel, Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385"}],"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."}],"title":"Computational design of curved thin shells: From glass façades to programmable matter","publication_status":"published","file_date_updated":"2020-09-16T15:11:01Z","oa_version":"Published Version","article_processing_charge":"No","doi":"10.15479/AT:ISTA:8366","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.","publication_identifier":{"isbn":["978-3-99078-010-7"],"issn":["2663-337X"]},"department":[{"_id":"BeBi"}],"ec_funded":1,"date_updated":"2024-02-21T12:44:29Z","degree_awarded":"PhD","acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"ScienComp"}],"oa":1,"related_material":{"record":[{"id":"7151","relation":"research_data","status":"deleted"},{"status":"public","relation":"part_of_dissertation","id":"7262"},{"status":"public","relation":"part_of_dissertation","id":"8562"},{"status":"public","relation":"part_of_dissertation","id":"1001"},{"id":"8375","status":"public","relation":"research_data"}]},"author":[{"orcid":"0000-0001-9819-5077","id":"3AB45EE2-F248-11E8-B48F-1D18A9856A87","full_name":"Guseinov, Ruslan","first_name":"Ruslan","last_name":"Guseinov"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","has_accepted_license":"1","project":[{"call_identifier":"H2020","grant_number":"715767","_id":"24F9549A-B435-11E9-9278-68D0E5697425","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling"}],"page":"118","day":"21","month":"09","status":"public","language":[{"iso":"eng"}],"ddc":["000"],"keyword":["computer-aided design","shape modeling","self-morphing","mechanical engineering"],"alternative_title":["ISTA Thesis"],"date_published":"2020-09-21T00:00:00Z","type":"dissertation","publisher":"Institute of Science and Technology Austria"},{"oa":1,"related_material":{"record":[{"id":"8366","status":"public","relation":"used_in_publication"}]},"date_published":"2020-09-21T00:00:00Z","type":"research_data","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Institute of Science and Technology Austria","author":[{"last_name":"Guseinov","first_name":"Ruslan","full_name":"Guseinov, Ruslan","orcid":"0000-0001-9819-5077","id":"3AB45EE2-F248-11E8-B48F-1D18A9856A87"}],"status":"public","date_updated":"2024-02-21T12:44:29Z","ec_funded":1,"month":"09","department":[{"_id":"BeBi"}],"ddc":["000"],"file_date_updated":"2020-09-11T09:52:36Z","article_processing_charge":"No","oa_version":"Published Version","contributor":[{"contributor_type":"researcher","last_name":"Guseinov","first_name":"Ruslan","orcid":"0000-0001-9819-5077","id":"3AB45EE2-F248-11E8-B48F-1D18A9856A87"},{"last_name":"McMahan","contributor_type":"researcher","first_name":"Connor"},{"first_name":"Jesus","contributor_type":"researcher","last_name":"Perez Rodriguez","id":"2DC83906-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Chiara","contributor_type":"researcher","last_name":"Daraio"},{"first_name":"Bernd","last_name":"Bickel","contributor_type":"researcher","id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385"}],"title":"Supplementary data for \"Computational design of curved thin shells: from glass façades to programmable matter\"","day":"21","doi":"10.15479/AT:ISTA:8375","_id":"8375","has_accepted_license":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"date_created":"2020-09-11T09:52:54Z","file":[{"checksum":"4029ffd65fb82ef2366b2fc2a4908e16","file_id":"8376","creator":"rguseino","content_type":"video/mp4","date_created":"2020-09-11T09:45:21Z","date_updated":"2020-09-11T09:45:21Z","relation":"main_file","file_size":29214988,"file_name":"supplementary_movie_1.mp4","access_level":"open_access","success":1},{"checksum":"8ed03b04d80f1a4e622cb22e6100afd8","file_id":"8377","creator":"rguseino","content_type":"video/mp4","relation":"main_file","date_created":"2020-09-11T09:45:25Z","date_updated":"2020-09-11T09:45:25Z","file_size":28449475,"success":1,"access_level":"open_access","file_name":"supplementary_movie_2.mp4"},{"content_type":"video/mp4","file_id":"8378","creator":"rguseino","checksum":"ad6864afb5e694e5c52a88fba4e02eea","success":1,"access_level":"open_access","file_name":"supplementary_movie_3.mp4","file_size":26315853,"date_created":"2020-09-11T09:45:28Z","relation":"main_file","date_updated":"2020-09-11T09:45:28Z"},{"checksum":"b079cef7871fe1afb69af0e2b099f3b1","file_id":"8379","creator":"rguseino","content_type":"video/mp4","file_size":25198755,"date_updated":"2020-09-11T09:45:33Z","date_created":"2020-09-11T09:45:33Z","relation":"main_file","file_name":"supplementary_movie_4.mp4","access_level":"open_access","success":1},{"creator":"rguseino","file_id":"8380","content_type":"video/mp4","checksum":"9d1d48a8ed5c109a999c51b044ee523d","file_name":"supplementary_movie_5.mp4","access_level":"open_access","success":1,"date_updated":"2020-09-11T09:45:36Z","file_size":29011354,"relation":"main_file","date_created":"2020-09-11T09:45:36Z"},{"content_type":"text/plain","file_id":"8381","creator":"rguseino","checksum":"d414d0059e982d752d218756b3c3ce05","file_name":"readme.txt","access_level":"open_access","success":1,"file_size":586,"date_created":"2020-09-11T09:52:36Z","date_updated":"2020-09-11T09:52:36Z","relation":"main_file"}],"project":[{"_id":"24F9549A-B435-11E9-9278-68D0E5697425","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","grant_number":"715767","call_identifier":"H2020"}],"abstract":[{"lang":"eng","text":"Supplementary movies showing the following sequences for spatio-temporarily programmed shells: input geometry and actuation time landscape; comparison of morphing processes from a camera recording and a simulation; final actuated shape."}],"year":"2020","citation":{"ista":"Guseinov R. 2020. Supplementary data for ‘Computational design of curved thin shells: from glass façades to programmable matter’, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:8375\">10.15479/AT:ISTA:8375</a>.","ieee":"R. Guseinov, “Supplementary data for ‘Computational design of curved thin shells: from glass façades to programmable matter.’” Institute of Science and Technology Austria, 2020.","ama":"Guseinov R. Supplementary data for “Computational design of curved thin shells: from glass façades to programmable matter.” 2020. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8375\">10.15479/AT:ISTA:8375</a>","apa":"Guseinov, R. (2020). Supplementary data for “Computational design of curved thin shells: from glass façades to programmable matter.” Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:8375\">https://doi.org/10.15479/AT:ISTA:8375</a>","chicago":"Guseinov, Ruslan. “Supplementary Data for ‘Computational Design of Curved Thin Shells: From Glass Façades to Programmable Matter.’” Institute of Science and Technology Austria, 2020. <a href=\"https://doi.org/10.15479/AT:ISTA:8375\">https://doi.org/10.15479/AT:ISTA:8375</a>.","short":"R. Guseinov, (2020).","mla":"Guseinov, Ruslan. <i>Supplementary Data for “Computational Design of Curved Thin Shells: From Glass Façades to Programmable Matter.”</i> Institute of Science and Technology Austria, 2020, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8375\">10.15479/AT:ISTA:8375</a>."}},{"abstract":[{"text":"We introduce extension-based proofs, a class of impossibility proofs that includes valency arguments. They are modelled as an interaction between a prover and a protocol. Using proofs based on combinatorial topology, it has been shown that it is impossible to deterministically solve k-set agreement among n > k ≥ 2 processes in a wait-free manner. However, it was unknown whether proofs based on simpler techniques were possible. We explain why this impossibility result cannot be obtained by an extension-based proof and, hence, extension-based proofs are limited in power.","lang":"eng"}],"year":"2020","citation":{"apa":"Alistarh, D.-A., Aspnes, J., Ellen, F., Gelashvili, R., &#38; Zhu, L. (2020). Brief Announcement: Why Extension-Based Proofs Fail. In <i>Proceedings of the 39th Symposium on Principles of Distributed Computing</i> (pp. 54–56). Virtual, Italy: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3382734.3405743\">https://doi.org/10.1145/3382734.3405743</a>","short":"D.-A. Alistarh, J. Aspnes, F. Ellen, R. Gelashvili, L. Zhu, in:, Proceedings of the 39th Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2020, pp. 54–56.","chicago":"Alistarh, Dan-Adrian, James Aspnes, Faith Ellen, Rati Gelashvili, and Leqi Zhu. “Brief Announcement: Why Extension-Based Proofs Fail.” In <i>Proceedings of the 39th Symposium on Principles of Distributed Computing</i>, 54–56. Association for Computing Machinery, 2020. <a href=\"https://doi.org/10.1145/3382734.3405743\">https://doi.org/10.1145/3382734.3405743</a>.","mla":"Alistarh, Dan-Adrian, et al. “Brief Announcement: Why Extension-Based Proofs Fail.” <i>Proceedings of the 39th Symposium on Principles of Distributed Computing</i>, Association for Computing Machinery, 2020, pp. 54–56, doi:<a href=\"https://doi.org/10.1145/3382734.3405743\">10.1145/3382734.3405743</a>.","ieee":"D.-A. Alistarh, J. Aspnes, F. Ellen, R. Gelashvili, and L. Zhu, “Brief Announcement: Why Extension-Based Proofs Fail,” in <i>Proceedings of the 39th Symposium on Principles of Distributed Computing</i>, Virtual, Italy, 2020, pp. 54–56.","ista":"Alistarh D-A, Aspnes J, Ellen F, Gelashvili R, Zhu L. 2020. Brief Announcement: Why Extension-Based Proofs Fail. Proceedings of the 39th Symposium on Principles of Distributed Computing. PODC: Principles of Distributed Computing, 54–56.","ama":"Alistarh D-A, Aspnes J, Ellen F, Gelashvili R, Zhu L. Brief Announcement: Why Extension-Based Proofs Fail. In: <i>Proceedings of the 39th Symposium on Principles of Distributed Computing</i>. Association for Computing Machinery; 2020:54-56. doi:<a href=\"https://doi.org/10.1145/3382734.3405743\">10.1145/3382734.3405743</a>"},"_id":"8383","date_created":"2020-09-13T22:01:18Z","conference":{"end_date":"2020-08-07","name":"PODC: Principles of Distributed Computing","location":"Virtual, Italy","start_date":"2020-08-03"},"publication_identifier":{"isbn":["9781450375825"]},"day":"31","page":"54-56","doi":"10.1145/3382734.3405743","scopus_import":"1","oa_version":"None","article_processing_charge":"No","title":"Brief Announcement: Why Extension-Based Proofs Fail","publication_status":"published","quality_controlled":"1","language":[{"iso":"eng"}],"status":"public","publication":"Proceedings of the 39th Symposium on Principles of Distributed Computing","date_updated":"2024-02-28T12:54:19Z","month":"07","department":[{"_id":"DaAl"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Association for Computing Machinery","author":[{"full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","first_name":"Dan-Adrian"},{"full_name":"Aspnes, James","first_name":"James","last_name":"Aspnes"},{"full_name":"Ellen, Faith","first_name":"Faith","last_name":"Ellen"},{"full_name":"Gelashvili, Rati","last_name":"Gelashvili","first_name":"Rati"},{"first_name":"Leqi","last_name":"Zhu","full_name":"Zhu, Leqi"}],"date_published":"2020-07-31T00:00:00Z","type":"conference"},{"abstract":[{"lang":"eng","text":"Previous research on animations of soap bubbles, films, and foams largely focuses on the motion and geometric shape of the bubble surface. These works neglect the evolution of the bubble’s thickness, which is normally responsible for visual phenomena like surface vortices, Newton’s interference patterns, capillary waves, and deformation-dependent rupturing of films in a foam. In this paper, we model these natural phenomena by introducing the film thickness as a reduced degree of freedom in the Navier-Stokes equations and deriving their equations of motion. We discretize the equations on a nonmanifold triangle mesh surface and couple it to an existing bubble solver. In doing so, we also introduce an incompressible fluid solver for 2.5D films and a novel advection algorithm for convecting fields across non-manifold surface junctions. Our simulations enhance state-of-the-art bubble solvers with additional effects caused by convection, rippling, draining, and evaporation of the thin film."}],"article_number":"31","year":"2020","citation":{"ama":"Ishida S, Synak P, Narita F, Hachisuka T, Wojtan C. A model for soap film dynamics with evolving thickness. <i>ACM Transactions on Graphics</i>. 2020;39(4). doi:<a href=\"https://doi.org/10.1145/3386569.3392405\">10.1145/3386569.3392405</a>","ista":"Ishida S, Synak P, Narita F, Hachisuka T, Wojtan C. 2020. A model for soap film dynamics with evolving thickness. ACM Transactions on Graphics. 39(4), 31.","ieee":"S. Ishida, P. Synak, F. Narita, T. Hachisuka, and C. Wojtan, “A model for soap film dynamics with evolving thickness,” <i>ACM Transactions on Graphics</i>, vol. 39, no. 4. Association for Computing Machinery, 2020.","apa":"Ishida, S., Synak, P., Narita, F., Hachisuka, T., &#38; Wojtan, C. (2020). A model for soap film dynamics with evolving thickness. <i>ACM Transactions on Graphics</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3386569.3392405\">https://doi.org/10.1145/3386569.3392405</a>","chicago":"Ishida, Sadashige, Peter Synak, Fumiya Narita, Toshiya Hachisuka, and Chris Wojtan. “A Model for Soap Film Dynamics with Evolving Thickness.” <i>ACM Transactions on Graphics</i>. Association for Computing Machinery, 2020. <a href=\"https://doi.org/10.1145/3386569.3392405\">https://doi.org/10.1145/3386569.3392405</a>.","short":"S. Ishida, P. Synak, F. Narita, T. Hachisuka, C. Wojtan, ACM Transactions on Graphics 39 (2020).","mla":"Ishida, Sadashige, et al. “A Model for Soap Film Dynamics with Evolving Thickness.” <i>ACM Transactions on Graphics</i>, vol. 39, no. 4, 31, Association for Computing Machinery, 2020, doi:<a href=\"https://doi.org/10.1145/3386569.3392405\">10.1145/3386569.3392405</a>."},"_id":"8384","date_created":"2020-09-13T22:01:18Z","file":[{"checksum":"813831ca91319d794d9748c276b24578","content_type":"application/pdf","creator":"dernst","file_id":"8795","date_created":"2020-11-23T09:03:19Z","relation":"main_file","date_updated":"2020-11-23T09:03:19Z","file_size":14935529,"access_level":"open_access","success":1,"file_name":"2020_soapfilm_submitted.pdf"}],"article_type":"original","publication_identifier":{"eissn":["15577368"],"issn":["07300301"]},"acknowledgement":"We wish to thank the anonymous reviewers and the members of the Visual Computing Group at IST Austria for their valuable feedback, especially Camille Schreck for her help in rendering. This research was supported by the Scientific Service Units (SSU) of IST Austria through resources provided by Scientific Computing. We would like to thank the authors of [Belcour and Barla 2017] for providing their implementation, the authors of [Atkins and Elliott 2010] and [Seychelles et al. 2008] for allowing us to use their results, and Rok Grah for helpful discussions. Finally, we thank Ryoichi Ando for many discussions from the beginning of the project that resulted in important contents of the paper including our formulation, numerical scheme, and initial implementation. This project has received funding from the\r\nEuropean Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme under grant agreement No. 638176.","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1145/3386569.3392405"}],"doi":"10.1145/3386569.3392405","scopus_import":"1","file_date_updated":"2020-11-23T09:03:19Z","article_processing_charge":"No","oa_version":"Submitted Version","publication_status":"published","title":"A model for soap film dynamics with evolving thickness","intvolume":"        39","publication":"ACM Transactions on Graphics","date_updated":"2024-02-28T12:57:31Z","ec_funded":1,"department":[{"_id":"ChWo"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"id":"6F7C4B96-A8E9-11E9-A7CA-09ECE5697425","full_name":"Ishida, Sadashige","first_name":"Sadashige","last_name":"Ishida"},{"first_name":"Peter","last_name":"Synak","id":"331776E2-F248-11E8-B48F-1D18A9856A87","full_name":"Synak, Peter"},{"full_name":"Narita, Fumiya","last_name":"Narita","first_name":"Fumiya"},{"first_name":"Toshiya","last_name":"Hachisuka","full_name":"Hachisuka, Toshiya"},{"id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6646-5546","full_name":"Wojtan, Christopher J","first_name":"Christopher J","last_name":"Wojtan"}],"oa":1,"volume":39,"acknowledged_ssus":[{"_id":"ScienComp"}],"has_accepted_license":"1","project":[{"_id":"2533E772-B435-11E9-9278-68D0E5697425","name":"Efficient Simulation of Natural Phenomena at Extremely Large Scales","call_identifier":"H2020","grant_number":"638176"}],"issue":"4","day":"08","quality_controlled":"1","language":[{"iso":"eng"}],"ddc":["000"],"status":"public","month":"07","isi":1,"publisher":"Association for Computing Machinery","external_id":{"isi":["000583700300004"]},"date_published":"2020-07-08T00:00:00Z","type":"journal_article"},{"department":[{"_id":"ChWo"}],"date_updated":"2024-02-28T12:57:47Z","ec_funded":1,"publication":"ACM Transactions on Graphics","intvolume":"        39","acknowledged_ssus":[{"_id":"ScienComp"}],"volume":39,"oa":1,"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"12358"}]},"author":[{"id":"4DD40360-F248-11E8-B48F-1D18A9856A87","full_name":"Sperl, Georg","first_name":"Georg","last_name":"Sperl"},{"first_name":"Rahul","last_name":"Narain","full_name":"Narain, Rahul"},{"full_name":"Wojtan, Christopher J","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6646-5546","last_name":"Wojtan","first_name":"Christopher J"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2020-09-13T22:01:18Z","file":[{"file_id":"8794","creator":"dernst","content_type":"application/pdf","checksum":"cf4c1d361c3196c4bd424520a5588205","file_name":"2020_hylc_submitted.pdf","access_level":"open_access","success":1,"file_size":38922662,"date_updated":"2020-11-23T09:01:22Z","date_created":"2020-11-23T09:01:22Z","relation":"main_file"}],"_id":"8385","citation":{"mla":"Sperl, Georg, et al. “Homogenized Yarn-Level Cloth.” <i>ACM Transactions on Graphics</i>, vol. 39, no. 4, 48, Association for Computing Machinery, 2020, doi:<a href=\"https://doi.org/10.1145/3386569.3392412\">10.1145/3386569.3392412</a>.","chicago":"Sperl, Georg, Rahul Narain, and Chris Wojtan. “Homogenized Yarn-Level Cloth.” <i>ACM Transactions on Graphics</i>. Association for Computing Machinery, 2020. <a href=\"https://doi.org/10.1145/3386569.3392412\">https://doi.org/10.1145/3386569.3392412</a>.","short":"G. Sperl, R. Narain, C. Wojtan, ACM Transactions on Graphics 39 (2020).","apa":"Sperl, G., Narain, R., &#38; Wojtan, C. (2020). Homogenized yarn-level cloth. <i>ACM Transactions on Graphics</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3386569.3392412\">https://doi.org/10.1145/3386569.3392412</a>","ama":"Sperl G, Narain R, Wojtan C. Homogenized yarn-level cloth. <i>ACM Transactions on Graphics</i>. 2020;39(4). doi:<a href=\"https://doi.org/10.1145/3386569.3392412\">10.1145/3386569.3392412</a>","ieee":"G. Sperl, R. Narain, and C. Wojtan, “Homogenized yarn-level cloth,” <i>ACM Transactions on Graphics</i>, vol. 39, no. 4. Association for Computing Machinery, 2020.","ista":"Sperl G, Narain R, Wojtan C. 2020. Homogenized yarn-level cloth. ACM Transactions on Graphics. 39(4), 48."},"article_number":"48","year":"2020","abstract":[{"lang":"eng","text":"We present a method for animating yarn-level cloth effects using a thin-shell solver. We accomplish this through numerical homogenization: we first use a large number of yarn-level simulations to build a model of the potential energy density of the cloth, and then use this energy density function to compute forces in a thin shell simulator. We model several yarn-based materials, including both woven and knitted fabrics. Our model faithfully reproduces expected effects like the stiffness of woven fabrics, and the highly deformable nature and anisotropy of knitted fabrics. Our approach does not require any real-world experiments nor measurements; because the method is based entirely on simulations, it can generate entirely new material models quickly, without the need for testing apparatuses or human intervention. We provide data-driven models of several woven and knitted fabrics, which can be used for efficient simulation with an off-the-shelf cloth solver."}],"publication_status":"published","title":"Homogenized yarn-level cloth","article_processing_charge":"No","oa_version":"Submitted Version","file_date_updated":"2020-11-23T09:01:22Z","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1145/3386569.3392412"}],"doi":"10.1145/3386569.3392412","publication_identifier":{"issn":["07300301"],"eissn":["15577368"]},"acknowledgement":"We wish to thank the anonymous reviewers and the members of the Visual Computing Group at IST Austria for their valuable feedback. We also thank the creators of the Berkeley Garment Library [de Joya et al. 2012] for providing garment meshes, [Krishnamurthy and Levoy 1996] and [Turk and Levoy 1994] for the armadillo and bunny meshes, the creators of libWetCloth [Fei et al. 2018] for their implementation of discrete elastic rod forces, and Tomáš Skřivan for\r\ninspiring discussions and help with Mathematica code generation. This research was supported by the Scientific Service Units (SSU) of IST Austria through resources provided by Scientific Computing. This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme under grant agreement No. 638176. Rahul Narain is supported by a Pankaj Gupta Young Faculty Fellowship and a gift from Adobe Inc.","article_type":"original","isi":1,"month":"07","status":"public","ddc":["000"],"language":[{"iso":"eng"}],"type":"journal_article","external_id":{"isi":["000583700300021"]},"date_published":"2020-07-08T00:00:00Z","publisher":"Association for Computing Machinery","issue":"4","project":[{"call_identifier":"H2020","grant_number":"638176","_id":"2533E772-B435-11E9-9278-68D0E5697425","name":"Efficient Simulation of Natural Phenomena at Extremely Large Scales"}],"has_accepted_license":"1","quality_controlled":"1","day":"08"},{"author":[{"id":"4DDBCEB0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3808-281X","full_name":"Zhang, Ran","first_name":"Ran","last_name":"Zhang"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","acknowledged_ssus":[{"_id":"SSU"}],"related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"486"},{"status":"public","relation":"part_of_dissertation","id":"1002"}]},"oa":1,"degree_awarded":"PhD","department":[{"_id":"BeBi"}],"ec_funded":1,"date_updated":"2023-09-22T09:49:31Z","doi":"10.15479/AT:ISTA:8386","publication_identifier":{"issn":["2663-337X"]},"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.","title":"Structure-aware computational design and its application to 3D printable volume scattering, mechanism, and multistability","publication_status":"published","article_processing_charge":"No","oa_version":"Published Version","file_date_updated":"2020-09-15T12:51:53Z","citation":{"apa":"Zhang, R. (2020). <i>Structure-aware computational design and its application to 3D printable volume scattering, mechanism, and multistability</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:8386\">https://doi.org/10.15479/AT:ISTA:8386</a>","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.","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. <a href=\"https://doi.org/10.15479/AT:ISTA:8386\">https://doi.org/10.15479/AT:ISTA:8386</a>.","mla":"Zhang, Ran. <i>Structure-Aware Computational Design and Its Application to 3D Printable Volume Scattering, Mechanism, and Multistability</i>. Institute of Science and Technology Austria, 2020, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8386\">10.15479/AT:ISTA:8386</a>.","ama":"Zhang R. Structure-aware computational design and its application to 3D printable volume scattering, mechanism, and multistability. 2020. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8386\">10.15479/AT:ISTA:8386</a>","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."},"year":"2020","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"}],"supervisor":[{"last_name":"Bickel","first_name":"Bernd","full_name":"Bickel, Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385"}],"date_created":"2020-09-14T01:04:53Z","file":[{"file_id":"8388","creator":"rzhang","content_type":"application/x-zip-compressed","checksum":"edcf578b6e1c9b0dd81ff72d319b66ba","file_name":"Thesis_Ran.zip","access_level":"closed","relation":"source_file","date_updated":"2020-09-14T12:18:43Z","date_created":"2020-09-14T01:02:59Z","file_size":1245800191},{"checksum":"817e20c33be9247f906925517c56a40d","file_id":"8396","creator":"rzhang","content_type":"application/pdf","date_created":"2020-09-15T12:51:53Z","date_updated":"2020-09-15T12:51:53Z","file_size":161385316,"relation":"main_file","success":1,"access_level":"open_access","file_name":"PhD_thesis_Ran Zhang_20200915.pdf"}],"_id":"8386","publisher":"Institute of Science and Technology Austria","type":"dissertation","date_published":"2020-09-14T00:00:00Z","ddc":["003"],"language":[{"iso":"eng"}],"alternative_title":["ISTA Thesis"],"month":"09","status":"public","page":"148","day":"14","has_accepted_license":"1","project":[{"grant_number":"642841","call_identifier":"H2020","_id":"2508E324-B435-11E9-9278-68D0E5697425","name":"Distributed 3D Object Design"},{"call_identifier":"H2020","grant_number":"715767","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","_id":"24F9549A-B435-11E9-9278-68D0E5697425"}]},{"abstract":[{"lang":"eng","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. "}],"supervisor":[{"first_name":"Christoph","last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph"}],"year":"2020","citation":{"mla":"Royer, Amélie. <i>Leveraging Structure in Computer Vision Tasks for Flexible Deep Learning Models</i>. Institute of Science and Technology Austria, 2020, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8390\">10.15479/AT:ISTA:8390</a>.","short":"A. Royer, Leveraging Structure in Computer Vision Tasks for Flexible Deep Learning Models, Institute of Science and Technology Austria, 2020.","chicago":"Royer, Amélie. “Leveraging Structure in Computer Vision Tasks for Flexible Deep Learning Models.” Institute of Science and Technology Austria, 2020. <a href=\"https://doi.org/10.15479/AT:ISTA:8390\">https://doi.org/10.15479/AT:ISTA:8390</a>.","apa":"Royer, A. (2020). <i>Leveraging structure in Computer Vision tasks for flexible Deep Learning models</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:8390\">https://doi.org/10.15479/AT:ISTA:8390</a>","ama":"Royer A. Leveraging structure in Computer Vision tasks for flexible Deep Learning models. 2020. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8390\">10.15479/AT:ISTA:8390</a>","ieee":"A. Royer, “Leveraging structure in Computer Vision tasks for flexible Deep Learning models,” Institute of Science and Technology Austria, 2020.","ista":"Royer A. 2020. Leveraging structure in Computer Vision tasks for flexible Deep Learning models. Institute of Science and Technology Austria."},"_id":"8390","date_created":"2020-09-14T13:42:09Z","file":[{"file_name":"2020_Thesis_Royer.pdf","success":1,"access_level":"open_access","date_updated":"2020-09-14T13:39:14Z","relation":"main_file","date_created":"2020-09-14T13:39:14Z","file_size":30224591,"file_id":"8391","creator":"dernst","content_type":"application/pdf","checksum":"c914d2f88846032f3d8507734861b6ee"},{"date_updated":"2020-09-14T13:39:17Z","file_size":74227627,"date_created":"2020-09-14T13:39:17Z","relation":"main_file","file_name":"thesis_sources.zip","access_level":"closed","checksum":"ae98fb35d912cff84a89035ae5794d3c","content_type":"application/x-zip-compressed","creator":"dernst","file_id":"8392"}],"publication_identifier":{"issn":["2663-337X"],"isbn":["978-3-99078-007-7"]},"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.","doi":"10.15479/AT:ISTA:8390","file_date_updated":"2020-09-14T13:39:17Z","oa_version":"Published Version","article_processing_charge":"No","publication_status":"published","title":"Leveraging structure in Computer Vision tasks for flexible Deep Learning models","degree_awarded":"PhD","date_updated":"2023-10-16T10:04:02Z","department":[{"_id":"ChLa"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"full_name":"Royer, Amélie","orcid":"0000-0002-8407-0705","id":"3811D890-F248-11E8-B48F-1D18A9856A87","last_name":"Royer","first_name":"Amélie"}],"related_material":{"record":[{"id":"7936","status":"public","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"7937"},{"id":"8193","relation":"part_of_dissertation","status":"public"},{"relation":"part_of_dissertation","status":"public","id":"8092"},{"status":"public","relation":"part_of_dissertation","id":"911"}]},"oa":1,"acknowledged_ssus":[{"_id":"CampIT"},{"_id":"ScienComp"}],"license":"https://creativecommons.org/licenses/by-nc-sa/4.0/","has_accepted_license":"1","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","short":"CC BY-NC-SA (4.0)","image":"/images/cc_by_nc_sa.png"},"day":"14","page":"197","alternative_title":["ISTA Thesis"],"language":[{"iso":"eng"}],"ddc":["000"],"status":"public","month":"09","publisher":"Institute of Science and Technology Austria","date_published":"2020-09-14T00:00:00Z","type":"dissertation"},{"issue":"7","has_accepted_license":"1","project":[{"name":"Protein structure and function in filopodia across scales","_id":"2674F658-B435-11E9-9278-68D0E5697425","grant_number":"M02495","call_identifier":"FWF"}],"quality_controlled":"1","day":"09","isi":1,"month":"04","status":"public","ddc":["570"],"language":[{"iso":"eng"}],"keyword":["Cell Biology"],"type":"journal_article","external_id":{"isi":["000534387800005"],"pmid":[" 32094266"]},"date_published":"2020-04-09T00:00:00Z","pmid":1,"publisher":"The Company of Biologists","file":[{"checksum":"ba917e551acc4ece2884b751434df9ae","creator":"dernst","file_id":"8435","content_type":"application/pdf","embargo":"2020-10-10","relation":"main_file","date_updated":"2020-10-11T22:30:02Z","file_size":13493302,"date_created":"2020-09-17T14:07:51Z","file_name":"2020_JournalCellScience_Dimchev.pdf","access_level":"open_access"}],"date_created":"2020-09-17T14:00:33Z","_id":"8434","citation":{"mla":"Dimchev, Georgi A., et al. “Lamellipodin Tunes Cell Migration by Stabilizing Protrusions and Promoting Adhesion Formation.” <i>Journal of Cell Science</i>, vol. 133, no. 7, jcs239020, The Company of Biologists, 2020, doi:<a href=\"https://doi.org/10.1242/jcs.239020\">10.1242/jcs.239020</a>.","short":"G.A. Dimchev, B. Amiri, A.C. Humphries, M. Schaks, V. Dimchev, T.E.B. Stradal, J. Faix, M. Krause, M. Way, M. Falcke, K. Rottner, Journal of Cell Science 133 (2020).","chicago":"Dimchev, Georgi A, Behnam Amiri, Ashley C. Humphries, Matthias Schaks, Vanessa Dimchev, Theresia E. B. Stradal, Jan Faix, et al. “Lamellipodin Tunes Cell Migration by Stabilizing Protrusions and Promoting Adhesion Formation.” <i>Journal of Cell Science</i>. The Company of Biologists, 2020. <a href=\"https://doi.org/10.1242/jcs.239020\">https://doi.org/10.1242/jcs.239020</a>.","apa":"Dimchev, G. A., Amiri, B., Humphries, A. C., Schaks, M., Dimchev, V., Stradal, T. E. B., … Rottner, K. (2020). Lamellipodin tunes cell migration by stabilizing protrusions and promoting adhesion formation. <i>Journal of Cell Science</i>. The Company of Biologists. <a href=\"https://doi.org/10.1242/jcs.239020\">https://doi.org/10.1242/jcs.239020</a>","ama":"Dimchev GA, Amiri B, Humphries AC, et al. Lamellipodin tunes cell migration by stabilizing protrusions and promoting adhesion formation. <i>Journal of Cell Science</i>. 2020;133(7). doi:<a href=\"https://doi.org/10.1242/jcs.239020\">10.1242/jcs.239020</a>","ieee":"G. A. Dimchev <i>et al.</i>, “Lamellipodin tunes cell migration by stabilizing protrusions and promoting adhesion formation,” <i>Journal of Cell Science</i>, vol. 133, no. 7. The Company of Biologists, 2020.","ista":"Dimchev GA, Amiri B, Humphries AC, Schaks M, Dimchev V, Stradal TEB, Faix J, Krause M, Way M, Falcke M, Rottner K. 2020. Lamellipodin tunes cell migration by stabilizing protrusions and promoting adhesion formation. Journal of Cell Science. 133(7), jcs239020."},"year":"2020","article_number":"jcs239020","abstract":[{"lang":"eng","text":"Efficient migration on adhesive surfaces involves the protrusion of lamellipodial actin networks and their subsequent stabilization by nascent adhesions. The actin-binding protein lamellipodin (Lpd) is thought to play a critical role in lamellipodium protrusion, by delivering Ena/VASP proteins onto the growing plus ends of actin filaments and by interacting with the WAVE regulatory complex, an activator of the Arp2/3 complex, at the leading edge. Using B16-F1 melanoma cell lines, we demonstrate that genetic ablation of Lpd compromises protrusion efficiency and coincident cell migration without altering essential parameters of lamellipodia, including their maximal rate of forward advancement and actin polymerization. We also confirmed lamellipodia and migration phenotypes with CRISPR/Cas9-mediated Lpd knockout Rat2 fibroblasts, excluding cell type-specific effects. Moreover, computer-aided analysis of cell-edge morphodynamics on B16-F1 cell lamellipodia revealed that loss of Lpd correlates with reduced temporal protrusion maintenance as a prerequisite of nascent adhesion formation. We conclude that Lpd optimizes protrusion and nascent adhesion formation by counteracting frequent, chaotic retraction and membrane ruffling.This article has an associated First Person interview with the first author of the paper. "}],"title":"Lamellipodin tunes cell migration by stabilizing protrusions and promoting adhesion formation","publication_status":"published","oa_version":"Published Version","article_processing_charge":"No","file_date_updated":"2020-10-11T22:30:02Z","doi":"10.1242/jcs.239020","acknowledgement":"This work was supported in part by Deutsche Forschungsgemeinschaft (DFG)[GRK2223/1, RO2414/5-1 (to K.R.), FA350/11-1 (to M.F.) and FA330/11-1 (to J.F.)],as well as by intramural funding from the Helmholtz Association (to T.E.B.S. andK.R.). G.D. was additionally funded by the Austrian Science Fund (FWF) LiseMeitner Program [M-2495]. A.C.H. and M.W. are supported by the Francis CrickInstitute, which receives its core funding from Cancer Research UK [FC001209], theMedical Research Council [FC001209] and the Wellcome Trust [FC001209]. M.K. issupported by the Biotechnology and Biological Sciences Research Council [BB/F011431/1, BB/J000590/1, BB/N000226/1]. Deposited in PMC for release after 6months.","publication_identifier":{"eissn":["1477-9137"],"issn":["0021-9533"]},"article_type":"original","department":[{"_id":"FlSc"}],"date_updated":"2023-09-05T15:41:48Z","publication":"Journal of Cell Science","intvolume":"       133","volume":133,"oa":1,"author":[{"last_name":"Dimchev","first_name":"Georgi A","full_name":"Dimchev, Georgi A","id":"38C393BE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8370-6161"},{"full_name":"Amiri, Behnam","last_name":"Amiri","first_name":"Behnam"},{"full_name":"Humphries, Ashley C.","last_name":"Humphries","first_name":"Ashley C."},{"full_name":"Schaks, Matthias","first_name":"Matthias","last_name":"Schaks"},{"last_name":"Dimchev","first_name":"Vanessa","full_name":"Dimchev, Vanessa"},{"full_name":"Stradal, Theresia E. B.","first_name":"Theresia E. B.","last_name":"Stradal"},{"last_name":"Faix","first_name":"Jan","full_name":"Faix, Jan"},{"last_name":"Krause","first_name":"Matthias","full_name":"Krause, Matthias"},{"full_name":"Way, Michael","last_name":"Way","first_name":"Michael"},{"first_name":"Martin","last_name":"Falcke","full_name":"Falcke, Martin"},{"full_name":"Rottner, Klemens","last_name":"Rottner","first_name":"Klemens"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1"},{"acknowledged_ssus":[{"_id":"NanoFab"}],"oa":1,"related_material":{"record":[{"relation":"research_data","status":"public","id":"13056"}],"link":[{"relation":"erratum","url":"https://doi.org/10.1038/s41467-020-18912-9"},{"relation":"press_release","description":"News on IST Homepage","url":"https://ist.ac.at/en/news/how-to-transport-microwave-quantum-information-via-optical-fiber/"}]},"volume":11,"author":[{"full_name":"Arnold, Georg M","id":"3770C838-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1397-7876","last_name":"Arnold","first_name":"Georg M"},{"first_name":"Matthias","last_name":"Wulf","id":"45598606-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6613-1378","full_name":"Wulf, Matthias"},{"id":"2D25E1F6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0415-1423","full_name":"Barzanjeh, Shabir","first_name":"Shabir","last_name":"Barzanjeh"},{"id":"2C21D6E8-F248-11E8-B48F-1D18A9856A87","full_name":"Redchenko, Elena","first_name":"Elena","last_name":"Redchenko"},{"first_name":"Alfredo R","last_name":"Rueda Sanchez","id":"3B82B0F8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6249-5860","full_name":"Rueda Sanchez, Alfredo R"},{"last_name":"Hease","first_name":"William J","full_name":"Hease, William J","orcid":"0000-0001-9868-2166","id":"29705398-F248-11E8-B48F-1D18A9856A87"},{"id":"2AED110C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6937-5773","full_name":"Hassani, Farid","first_name":"Farid","last_name":"Hassani"},{"first_name":"Johannes M","last_name":"Fink","orcid":"0000-0001-8112-028X","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","full_name":"Fink, Johannes M"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","department":[{"_id":"JoFi"}],"publication":"Nature Communications","date_updated":"2024-08-07T07:11:51Z","ec_funded":1,"intvolume":"        11","publication_status":"published","title":"Converting microwave and telecom photons with a silicon photonic nanomechanical interface","file_date_updated":"2020-09-18T13:02:37Z","oa_version":"Published Version","article_processing_charge":"No","doi":"10.1038/s41467-020-18269-z","article_type":"original","publication_identifier":{"issn":["2041-1723"]},"acknowledgement":"We thank Yuan Chen for performing supplementary FEM simulations and Andrew Higginbotham, Ralf Riedinger, Sungkun Hong, and Lorenzo Magrini for valuable discussions. This work was supported by IST Austria, the IST nanofabrication facility (NFF), the European Union’s Horizon 2020 research and innovation program under grant agreement no. 732894 (FET Proactive HOT) and the European Research Council under grant agreement no. 758053 (ERC StG QUNNECT). G.A. is the recipient of a DOC fellowship of the Austrian Academy of Sciences at IST Austria. W.H. is the recipient of an ISTplus postdoctoral fellowship with funding from the European Union’s Horizon 2020 research and innovation program under the Marie Sklodowska-Curie grant agreement no. 754411. J.M.F. acknowledges support from the Austrian Science Fund (FWF) through BeyondC (F71), a NOMIS foundation research grant, and the EU’s Horizon 2020 research and innovation program under grant agreement no. 862644 (FET Open QUARTET).","_id":"8529","date_created":"2020-09-18T10:56:20Z","file":[{"checksum":"88f92544889eb18bb38e25629a422a86","creator":"dernst","file_id":"8530","content_type":"application/pdf","date_created":"2020-09-18T13:02:37Z","relation":"main_file","file_size":1002818,"date_updated":"2020-09-18T13:02:37Z","success":1,"access_level":"open_access","file_name":"2020_NatureComm_Arnold.pdf"}],"article_number":"4460","year":"2020","citation":{"mla":"Arnold, Georg M., et al. “Converting Microwave and Telecom Photons with a Silicon Photonic Nanomechanical Interface.” <i>Nature Communications</i>, vol. 11, 4460, Springer Nature, 2020, doi:<a href=\"https://doi.org/10.1038/s41467-020-18269-z\">10.1038/s41467-020-18269-z</a>.","chicago":"Arnold, Georg M, Matthias Wulf, Shabir Barzanjeh, Elena Redchenko, Alfredo R Rueda Sanchez, William J Hease, Farid Hassani, and Johannes M Fink. “Converting Microwave and Telecom Photons with a Silicon Photonic Nanomechanical Interface.” <i>Nature Communications</i>. Springer Nature, 2020. <a href=\"https://doi.org/10.1038/s41467-020-18269-z\">https://doi.org/10.1038/s41467-020-18269-z</a>.","short":"G.M. Arnold, M. Wulf, S. Barzanjeh, E. Redchenko, A.R. Rueda Sanchez, W.J. Hease, F. Hassani, J.M. Fink, Nature Communications 11 (2020).","apa":"Arnold, G. M., Wulf, M., Barzanjeh, S., Redchenko, E., Rueda Sanchez, A. R., Hease, W. J., … Fink, J. M. (2020). Converting microwave and telecom photons with a silicon photonic nanomechanical interface. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41467-020-18269-z\">https://doi.org/10.1038/s41467-020-18269-z</a>","ama":"Arnold GM, Wulf M, Barzanjeh S, et al. Converting microwave and telecom photons with a silicon photonic nanomechanical interface. <i>Nature Communications</i>. 2020;11. doi:<a href=\"https://doi.org/10.1038/s41467-020-18269-z\">10.1038/s41467-020-18269-z</a>","ieee":"G. M. Arnold <i>et al.</i>, “Converting microwave and telecom photons with a silicon photonic nanomechanical interface,” <i>Nature Communications</i>, vol. 11. Springer Nature, 2020.","ista":"Arnold GM, Wulf M, Barzanjeh S, Redchenko E, Rueda Sanchez AR, Hease WJ, Hassani F, Fink JM. 2020. Converting microwave and telecom photons with a silicon photonic nanomechanical interface. Nature Communications. 11, 4460."},"abstract":[{"text":"Practical quantum networks require low-loss and noise-resilient optical interconnects as well as non-Gaussian resources for entanglement distillation and distributed quantum computation. The latter could be provided by superconducting circuits but existing solutions to interface the microwave and optical domains lack either scalability or efficiency, and in most cases the conversion noise is not known. In this work we utilize the unique opportunities of silicon photonics, cavity optomechanics and superconducting circuits to demonstrate a fully integrated, coherent transducer interfacing the microwave X and the telecom S bands with a total (internal) bidirectional transduction efficiency of 1.2% (135%) at millikelvin temperatures. The coupling relies solely on the radiation pressure interaction mediated by the femtometer-scale motion of two silicon nanobeams reaching a <jats:italic>V</jats:italic><jats:sub><jats:italic>π</jats:italic></jats:sub> as low as 16 μV for sub-nanowatt pump powers. Without the associated optomechanical gain, we achieve a total (internal) pure conversion efficiency of up to 0.019% (1.6%), relevant for future noise-free operation on this qubit-compatible platform.","lang":"eng"}],"external_id":{"isi":["000577280200001"]},"date_published":"2020-09-08T00:00:00Z","type":"journal_article","publisher":"Springer Nature","month":"09","isi":1,"status":"public","language":[{"iso":"eng"}],"ddc":["530"],"keyword":["General Biochemistry","Genetics and Molecular Biology","General Physics and Astronomy","General Chemistry"],"quality_controlled":"1","day":"08","project":[{"name":"Hybrid Optomechanical Technologies","_id":"257EB838-B435-11E9-9278-68D0E5697425","grant_number":"732894","call_identifier":"H2020"},{"_id":"26336814-B435-11E9-9278-68D0E5697425","name":"A Fiber Optic Transceiver for Superconducting Qubits","grant_number":"758053","call_identifier":"H2020"},{"_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","grant_number":"754411"},{"_id":"237CBA6C-32DE-11EA-91FC-C7463DDC885E","name":"Quantum readout techniques and technologies","grant_number":"862644","call_identifier":"H2020"},{"name":"Coherent on-chip conversion of superconducting qubit signals from microwaves to optical frequencies","_id":"2671EB66-B435-11E9-9278-68D0E5697425"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"has_accepted_license":"1"},{"author":[{"last_name":"Kleindienst","first_name":"David","full_name":"Kleindienst, David","id":"42E121A4-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Montanaro-Punzengruber, Jacqueline-Claire","id":"3786AB44-F248-11E8-B48F-1D18A9856A87","last_name":"Montanaro-Punzengruber","first_name":"Jacqueline-Claire"},{"last_name":"Bhandari","first_name":"Pradeep","full_name":"Bhandari, Pradeep","id":"45EDD1BC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0863-4481"},{"first_name":"Matthew J","last_name":"Case","id":"44B7CA5A-F248-11E8-B48F-1D18A9856A87","full_name":"Case, Matthew J"},{"full_name":"Fukazawa, Yugo","last_name":"Fukazawa","first_name":"Yugo"},{"last_name":"Shigemoto","first_name":"Ryuichi","full_name":"Shigemoto, Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8761-9444"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","volume":21,"related_material":{"record":[{"id":"9562","status":"public","relation":"dissertation_contains"}]},"oa":1,"intvolume":"        21","department":[{"_id":"RySh"}],"date_updated":"2024-03-25T23:30:16Z","ec_funded":1,"publication":"International Journal of Molecular Sciences","scopus_import":"1","doi":"10.3390/ijms21186737","publication_identifier":{"issn":["16616596"],"eissn":["14220067"]},"acknowledgement":"This research was funded by Austrian Academy of Sciences, DOC fellowship to D.K., European Research\r\nCouncil Advanced Grant 694539 and European Union Human Brain Project (HBP) SGA2 785907 to R.S.\r\nWe acknowledge Elena Hollergschwandtner for technical support.","article_type":"original","publication_status":"published","title":"Deep learning-assisted high-throughput analysis of freeze-fracture replica images applied to glutamate receptors and calcium channels at hippocampal synapses","oa_version":"Published Version","article_processing_charge":"No","file_date_updated":"2020-09-21T14:08:58Z","citation":{"short":"D. Kleindienst, J.-C. Montanaro-Punzengruber, P. Bhandari, M.J. Case, Y. Fukazawa, R. Shigemoto, International Journal of Molecular Sciences 21 (2020).","apa":"Kleindienst, D., Montanaro-Punzengruber, J.-C., Bhandari, P., Case, M. J., Fukazawa, Y., &#38; Shigemoto, R. (2020). Deep learning-assisted high-throughput analysis of freeze-fracture replica images applied to glutamate receptors and calcium channels at hippocampal synapses. <i>International Journal of Molecular Sciences</i>. MDPI. <a href=\"https://doi.org/10.3390/ijms21186737\">https://doi.org/10.3390/ijms21186737</a>","chicago":"Kleindienst, David, Jacqueline-Claire Montanaro-Punzengruber, Pradeep Bhandari, Matthew J Case, Yugo Fukazawa, and Ryuichi Shigemoto. “Deep Learning-Assisted High-Throughput Analysis of Freeze-Fracture Replica Images Applied to Glutamate Receptors and Calcium Channels at Hippocampal Synapses.” <i>International Journal of Molecular Sciences</i>. MDPI, 2020. <a href=\"https://doi.org/10.3390/ijms21186737\">https://doi.org/10.3390/ijms21186737</a>.","mla":"Kleindienst, David, et al. “Deep Learning-Assisted High-Throughput Analysis of Freeze-Fracture Replica Images Applied to Glutamate Receptors and Calcium Channels at Hippocampal Synapses.” <i>International Journal of Molecular Sciences</i>, vol. 21, no. 18, 6737, MDPI, 2020, doi:<a href=\"https://doi.org/10.3390/ijms21186737\">10.3390/ijms21186737</a>.","ista":"Kleindienst D, Montanaro-Punzengruber J-C, Bhandari P, Case MJ, Fukazawa Y, Shigemoto R. 2020. Deep learning-assisted high-throughput analysis of freeze-fracture replica images applied to glutamate receptors and calcium channels at hippocampal synapses. International Journal of Molecular Sciences. 21(18), 6737.","ieee":"D. Kleindienst, J.-C. Montanaro-Punzengruber, P. Bhandari, M. J. Case, Y. Fukazawa, and R. Shigemoto, “Deep learning-assisted high-throughput analysis of freeze-fracture replica images applied to glutamate receptors and calcium channels at hippocampal synapses,” <i>International Journal of Molecular Sciences</i>, vol. 21, no. 18. MDPI, 2020.","ama":"Kleindienst D, Montanaro-Punzengruber J-C, Bhandari P, Case MJ, Fukazawa Y, Shigemoto R. Deep learning-assisted high-throughput analysis of freeze-fracture replica images applied to glutamate receptors and calcium channels at hippocampal synapses. <i>International Journal of Molecular Sciences</i>. 2020;21(18). doi:<a href=\"https://doi.org/10.3390/ijms21186737\">10.3390/ijms21186737</a>"},"year":"2020","article_number":"6737","abstract":[{"lang":"eng","text":"The molecular anatomy of synapses defines their characteristics in transmission and plasticity. Precise measurements of the number and distribution of synaptic proteins are important for our understanding of synapse heterogeneity within and between brain regions. Freeze–fracture replica immunogold electron microscopy enables us to analyze them quantitatively on a two-dimensional membrane surface. Here, we introduce Darea software, which utilizes deep learning for analysis of replica images and demonstrate its usefulness for quick measurements of the pre- and postsynaptic areas, density and distribution of gold particles at synapses in a reproducible manner. We used Darea for comparing glutamate receptor and calcium channel distributions between hippocampal CA3-CA1 spine synapses on apical and basal dendrites, which differ in signaling pathways involved in synaptic plasticity. We found that apical synapses express a higher density of α-amino-3-hydroxy-5-methyl-4-isoxazolepropionic acid (AMPA) receptors and a stronger increase of AMPA receptors with synaptic size, while basal synapses show a larger increase in N-methyl-D-aspartate (NMDA) receptors with size. Interestingly, AMPA and NMDA receptors are segregated within postsynaptic sites and negatively correlated in density among both apical and basal synapses. In the presynaptic sites, Cav2.1 voltage-gated calcium channels show similar densities in apical and basal synapses with distributions consistent with an exclusion zone model of calcium channel-release site topography."}],"date_created":"2020-09-20T22:01:35Z","file":[{"relation":"main_file","file_size":5748456,"date_created":"2020-09-21T14:08:58Z","date_updated":"2020-09-21T14:08:58Z","file_name":"2020_JournMolecSciences_Kleindienst.pdf","success":1,"access_level":"open_access","checksum":"2e4f62f3cfe945b7391fc3070e5a289f","creator":"dernst","file_id":"8551","content_type":"application/pdf"}],"_id":"8532","publisher":"MDPI","type":"journal_article","external_id":{"isi":["000579945300001"]},"date_published":"2020-09-14T00:00:00Z","ddc":["570"],"language":[{"iso":"eng"}],"isi":1,"month":"09","status":"public","day":"14","quality_controlled":"1","issue":"18","has_accepted_license":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"project":[{"_id":"25CA28EA-B435-11E9-9278-68D0E5697425","name":"In situ analysis of single channel subunit composition in neurons: physiological implication in synaptic plasticity and behaviour","grant_number":"694539","call_identifier":"H2020"},{"name":"Mechanism of formation and maintenance of input side-dependent asymmetry in the hippocampus","_id":"25D32BC0-B435-11E9-9278-68D0E5697425"},{"name":"Human Brain Project Specific Grant Agreement 2 (HBP SGA 2)","_id":"26436750-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"785907"}]},{"day":"18","quality_controlled":"1","license":"https://creativecommons.org/licenses/by/3.0/","has_accepted_license":"1","tmp":{"short":"CC BY (3.0)","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)"},"project":[{"name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003"},{"call_identifier":"H2020","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","type":"conference","date_published":"2020-08-18T00:00:00Z","external_id":{"arxiv":["2007.02894"]},"ddc":["000"],"language":[{"iso":"eng"}],"alternative_title":["LIPIcs"],"month":"08","status":"public","scopus_import":"1","doi":"10.4230/LIPIcs.MFCS.2020.22","acknowledgement":"Krishnendu Chatterjee: The research was partially supported by the Vienna Science and\r\nTechnology Fund (WWTF) Project ICT15-003.\r\nIsmaël Jecker: This project has received funding from the European Union’s Horizon 2020 research\r\nand innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 754411.","publication_identifier":{"isbn":["9783959771597"],"issn":["18688969"]},"publication_status":"published","title":"Simplified game of life: Algorithms and complexity","article_processing_charge":"No","oa_version":"Published Version","file_date_updated":"2020-09-21T13:57:34Z","citation":{"mla":"Chatterjee, Krishnendu, et al. “Simplified Game of Life: Algorithms and Complexity.” <i>45th International Symposium on Mathematical Foundations of Computer Science</i>, vol. 170, 22:1-22:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2020.22\">10.4230/LIPIcs.MFCS.2020.22</a>.","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Ismael R Jecker, and Jakub Svoboda. “Simplified Game of Life: Algorithms and Complexity.” In <i>45th International Symposium on Mathematical Foundations of Computer Science</i>, Vol. 170. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2020.22\">https://doi.org/10.4230/LIPIcs.MFCS.2020.22</a>.","short":"K. Chatterjee, R. Ibsen-Jensen, I.R. Jecker, J. Svoboda, in:, 45th International Symposium on Mathematical Foundations of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","apa":"Chatterjee, K., Ibsen-Jensen, R., Jecker, I. R., &#38; Svoboda, J. (2020). Simplified game of life: Algorithms and complexity. In <i>45th International Symposium on Mathematical Foundations of Computer Science</i> (Vol. 170). Prague, Czech Republic: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2020.22\">https://doi.org/10.4230/LIPIcs.MFCS.2020.22</a>","ama":"Chatterjee K, Ibsen-Jensen R, Jecker IR, Svoboda J. Simplified game of life: Algorithms and complexity. In: <i>45th International Symposium on Mathematical Foundations of Computer Science</i>. Vol 170. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2020.22\">10.4230/LIPIcs.MFCS.2020.22</a>","ista":"Chatterjee K, Ibsen-Jensen R, Jecker IR, Svoboda J. 2020. Simplified game of life: Algorithms and complexity. 45th International Symposium on Mathematical Foundations of Computer Science. MFCS: Symposium on Mathematical Foundations of Computer Science, LIPIcs, vol. 170, 22:1-22:13.","ieee":"K. Chatterjee, R. Ibsen-Jensen, I. R. Jecker, and J. Svoboda, “Simplified game of life: Algorithms and complexity,” in <i>45th International Symposium on Mathematical Foundations of Computer Science</i>, Prague, Czech Republic, 2020, vol. 170."},"year":"2020","article_number":"22:1-22:13","abstract":[{"text":"Game of Life is a simple and elegant model to study dynamical system over networks. The model consists of a graph where every vertex has one of two types, namely, dead or alive. A configuration is a mapping of the vertices to the types. An update rule describes how the type of a vertex is updated given the types of its neighbors. In every round, all vertices are updated synchronously, which leads to a configuration update. While in general, Game of Life allows a broad range of update rules, we focus on two simple families of update rules, namely, underpopulation and overpopulation, that model several interesting dynamics studied in the literature. In both settings, a dead vertex requires at least a desired number of live neighbors to become alive. For underpopulation (resp., overpopulation), a live vertex requires at least (resp. at most) a desired number of live neighbors to remain alive. We study the basic computation problems, e.g., configuration reachability, for these two families of rules. For underpopulation rules, we show that these problems can be solved in polynomial time, whereas for overpopulation rules they are PSPACE-complete.","lang":"eng"}],"conference":{"end_date":"2020-08-28","name":"MFCS: Symposium on Mathematical Foundations of Computer Science","location":"Prague, Czech Republic","start_date":"2020-08-24"},"date_created":"2020-09-20T22:01:36Z","file":[{"success":1,"access_level":"open_access","file_name":"2020_LIPIcs_Chatterjee.pdf","relation":"main_file","file_size":491374,"date_created":"2020-09-21T13:57:34Z","date_updated":"2020-09-21T13:57:34Z","creator":"dernst","file_id":"8550","content_type":"application/pdf","checksum":"bbd7c4f55d45f2ff2a0a4ef0e10a77b1"}],"_id":"8533","author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee"},{"orcid":"0000-0003-4783-0389","id":"3B699956-F248-11E8-B48F-1D18A9856A87","full_name":"Ibsen-Jensen, Rasmus","first_name":"Rasmus","last_name":"Ibsen-Jensen"},{"full_name":"Jecker, Ismael R","id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425","last_name":"Jecker","first_name":"Ismael R"},{"first_name":"Jakub","last_name":"Svoboda","orcid":"0000-0002-1419-3267","id":"130759D2-D7DD-11E9-87D2-DE0DE6697425","full_name":"Svoboda, Jakub"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":170,"oa":1,"arxiv":1,"intvolume":"       170","department":[{"_id":"KrCh"}],"date_updated":"2025-06-02T08:53:42Z","ec_funded":1,"publication":"45th International Symposium on Mathematical Foundations of Computer Science"},{"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","date_published":"2020-08-18T00:00:00Z","type":"conference","language":[{"iso":"eng"}],"ddc":["000"],"alternative_title":["LIPIcs"],"month":"08","status":"public","day":"18","quality_controlled":"1","has_accepted_license":"1","tmp":{"short":"CC BY (3.0)","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)"},"project":[{"call_identifier":"H2020","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships"}],"author":[{"id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425","full_name":"Jecker, Ismael R","first_name":"Ismael R","last_name":"Jecker"},{"full_name":"Kupferman, Orna","last_name":"Kupferman","first_name":"Orna"},{"full_name":"Mazzocchi, Nicolas","first_name":"Nicolas","last_name":"Mazzocchi"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"volume":170,"intvolume":"       170","department":[{"_id":"KrCh"}],"publication":"45th International Symposium on Mathematical Foundations of Computer Science","ec_funded":1,"date_updated":"2021-01-12T08:19:56Z","doi":"10.4230/LIPIcs.MFCS.2020.51","scopus_import":"1","acknowledgement":"Ismaël Jecker: This project has received funding from the European Union’s Horizon\r\n2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No.\r\n754411. Nicolas Mazzocchi: PhD fellowship FRIA from the F.R.S.-FNRS.","publication_identifier":{"isbn":["9783959771597"],"issn":["18688969"]},"title":"Unary prime languages","publication_status":"published","file_date_updated":"2020-09-21T14:17:08Z","oa_version":"Published Version","article_processing_charge":"No","article_number":"51:1-51:12","year":"2020","citation":{"apa":"Jecker, I. R., Kupferman, O., &#38; Mazzocchi, N. (2020). Unary prime languages. In <i>45th International Symposium on Mathematical Foundations of Computer Science</i> (Vol. 170). Prague, Czech Republic: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2020.51\">https://doi.org/10.4230/LIPIcs.MFCS.2020.51</a>","short":"I.R. Jecker, O. Kupferman, N. Mazzocchi, in:, 45th International Symposium on Mathematical Foundations of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","chicago":"Jecker, Ismael R, Orna Kupferman, and Nicolas Mazzocchi. “Unary Prime Languages.” In <i>45th International Symposium on Mathematical Foundations of Computer Science</i>, Vol. 170. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2020.51\">https://doi.org/10.4230/LIPIcs.MFCS.2020.51</a>.","mla":"Jecker, Ismael R., et al. “Unary Prime Languages.” <i>45th International Symposium on Mathematical Foundations of Computer Science</i>, vol. 170, 51:1-51:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2020.51\">10.4230/LIPIcs.MFCS.2020.51</a>.","ista":"Jecker IR, Kupferman O, Mazzocchi N. 2020. Unary prime languages. 45th International Symposium on Mathematical Foundations of Computer Science. MFCS: Symposium on Mathematical Foundations of Computer Science, LIPIcs, vol. 170, 51:1-51:12.","ieee":"I. R. Jecker, O. Kupferman, and N. Mazzocchi, “Unary prime languages,” in <i>45th International Symposium on Mathematical Foundations of Computer Science</i>, Prague, Czech Republic, 2020, vol. 170.","ama":"Jecker IR, Kupferman O, Mazzocchi N. Unary prime languages. In: <i>45th International Symposium on Mathematical Foundations of Computer Science</i>. Vol 170. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2020.51\">10.4230/LIPIcs.MFCS.2020.51</a>"},"abstract":[{"lang":"eng","text":"A regular language L of finite words is composite if there are regular languages L₁,L₂,…,L_t such that L = ⋂_{i = 1}^t L_i and the index (number of states in a minimal DFA) of every language L_i is strictly smaller than the index of L. Otherwise, L is prime. Primality of regular languages was introduced and studied in [O. Kupferman and J. Mosheiff, 2015], where the complexity of deciding the primality of the language of a given DFA was left open, with a doubly-exponential gap between the upper and lower bounds. We study primality for unary regular languages, namely regular languages with a singleton alphabet. A unary language corresponds to a subset of ℕ, making the study of unary prime languages closer to that of primality in number theory. We show that the setting of languages is richer. In particular, while every composite number is the product of two smaller numbers, the number t of languages necessary to decompose a composite unary language induces a strict hierarchy. In addition, a primality witness for a unary language L, namely a word that is not in L but is in all products of languages that contain L and have an index smaller than L’s, may be of exponential length. Still, we are able to characterize compositionality by structural properties of a DFA for L, leading to a LogSpace algorithm for primality checking of unary DFAs."}],"conference":{"start_date":"2020-08-24","name":"MFCS: Symposium on Mathematical Foundations of Computer Science","location":"Prague, Czech Republic","end_date":"2020-08-28"},"_id":"8534","date_created":"2020-09-20T22:01:36Z","file":[{"date_created":"2020-09-21T14:17:08Z","relation":"main_file","date_updated":"2020-09-21T14:17:08Z","file_size":597977,"success":1,"access_level":"open_access","file_name":"2020_LIPIcsMFCS_Jecker.pdf","checksum":"2dc9e2fad6becd4563aef3e27a473f70","content_type":"application/pdf","file_id":"8552","creator":"dernst"}]},{"language":[{"iso":"eng"}],"ddc":["000"],"month":"07","isi":1,"status":"public","publisher":"Association for Computing Machinery","date_published":"2020-07-08T00:00:00Z","external_id":{"isi":["000583700300038"]},"type":"journal_article","issue":"4","has_accepted_license":"1","project":[{"name":"Efficient Simulation of Natural Phenomena at Extremely Large Scales","_id":"2533E772-B435-11E9-9278-68D0E5697425","grant_number":"638176","call_identifier":"H2020"},{"name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","call_identifier":"H2020"}],"day":"08","quality_controlled":"1","intvolume":"        39","department":[{"_id":"ChWo"}],"publication":"ACM Transactions on Graphics","date_updated":"2023-08-22T09:28:27Z","ec_funded":1,"author":[{"last_name":"Skrivan","first_name":"Tomas","full_name":"Skrivan, Tomas","id":"486A5A46-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Soderstrom","first_name":"Andreas","full_name":"Soderstrom, Andreas"},{"full_name":"Johansson, John","last_name":"Johansson","first_name":"John"},{"full_name":"Sprenger, Christoph","first_name":"Christoph","last_name":"Sprenger"},{"last_name":"Museth","first_name":"Ken","full_name":"Museth, Ken"},{"last_name":"Wojtan","first_name":"Christopher J","full_name":"Wojtan, Christopher J","orcid":"0000-0001-6646-5546","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","acknowledged_ssus":[{"_id":"ScienComp"}],"oa":1,"volume":39,"year":"2020","article_number":"65","citation":{"apa":"Skrivan, T., Soderstrom, A., Johansson, J., Sprenger, C., Museth, K., &#38; Wojtan, C. (2020). Wave curves: Simulating Lagrangian water waves on dynamically deforming surfaces. <i>ACM Transactions on Graphics</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3386569.3392466\">https://doi.org/10.1145/3386569.3392466</a>","short":"T. Skrivan, A. Soderstrom, J. Johansson, C. Sprenger, K. Museth, C. Wojtan, ACM Transactions on Graphics 39 (2020).","chicago":"Skrivan, Tomas, Andreas Soderstrom, John Johansson, Christoph Sprenger, Ken Museth, and Chris Wojtan. “Wave Curves: Simulating Lagrangian Water Waves on Dynamically Deforming Surfaces.” <i>ACM Transactions on Graphics</i>. Association for Computing Machinery, 2020. <a href=\"https://doi.org/10.1145/3386569.3392466\">https://doi.org/10.1145/3386569.3392466</a>.","mla":"Skrivan, Tomas, et al. “Wave Curves: Simulating Lagrangian Water Waves on Dynamically Deforming Surfaces.” <i>ACM Transactions on Graphics</i>, vol. 39, no. 4, 65, Association for Computing Machinery, 2020, doi:<a href=\"https://doi.org/10.1145/3386569.3392466\">10.1145/3386569.3392466</a>.","ama":"Skrivan T, Soderstrom A, Johansson J, Sprenger C, Museth K, Wojtan C. Wave curves: Simulating Lagrangian water waves on dynamically deforming surfaces. <i>ACM Transactions on Graphics</i>. 2020;39(4). doi:<a href=\"https://doi.org/10.1145/3386569.3392466\">10.1145/3386569.3392466</a>","ista":"Skrivan T, Soderstrom A, Johansson J, Sprenger C, Museth K, Wojtan C. 2020. Wave curves: Simulating Lagrangian water waves on dynamically deforming surfaces. ACM Transactions on Graphics. 39(4), 65.","ieee":"T. Skrivan, A. Soderstrom, J. Johansson, C. Sprenger, K. Museth, and C. Wojtan, “Wave curves: Simulating Lagrangian water waves on dynamically deforming surfaces,” <i>ACM Transactions on Graphics</i>, vol. 39, no. 4. Association for Computing Machinery, 2020."},"abstract":[{"lang":"eng","text":"We propose a method to enhance the visual detail of a water surface simulation. Our method works as a post-processing step which takes a simulation as input and increases its apparent resolution by simulating many detailed Lagrangian water waves on top of it. We extend linear water wave theory to work in non-planar domains which deform over time, and we discretize the theory using Lagrangian wave packets attached to spline curves. The method is numerically stable and trivially parallelizable, and it produces high frequency ripples with dispersive wave-like behaviors customized to the underlying fluid simulation."}],"_id":"8535","file":[{"checksum":"c3a680893f01cc4a9e961ff0a4cfa12f","file_id":"8541","creator":"dernst","content_type":"application/pdf","date_updated":"2020-09-21T07:51:44Z","file_size":20223953,"date_created":"2020-09-21T07:51:44Z","relation":"main_file","success":1,"access_level":"open_access","file_name":"2020_ACM_Skrivan.pdf"}],"date_created":"2020-09-20T22:01:37Z","doi":"10.1145/3386569.3392466","scopus_import":"1","article_type":"original","publication_identifier":{"issn":["07300301"],"eissn":["15577368"]},"acknowledgement":"We wish to thank the anonymous reviewers and the members of the Visual Computing Group at IST Austria for their valuable feedback. This research was supported by the Scientific Service Units (SSU) of IST Austria through resources provided by Scientific Computing. This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme under grant agreement No. 638176 and Marie SkłodowskaCurie Grant Agreement No. 665385.","publication_status":"published","title":"Wave curves: Simulating Lagrangian water waves on dynamically deforming surfaces","file_date_updated":"2020-09-21T07:51:44Z","oa_version":"Published Version","article_processing_charge":"No"},{"day":"01","quality_controlled":"1","publisher":"IEEE","type":"conference","date_published":"2020-06-01T00:00:00Z","external_id":{"arxiv":["1909.04892"]},"language":[{"iso":"eng"}],"status":"public","month":"06","acknowledgement":"M. Mondelli was partially supported by grants NSF DMS-1613091, CCF-1714305, IIS-1741162 and ONR N00014-18-1-2729. S. A. Hashemi is supported by a Postdoctoral Fellowship from the Natural Sciences and Engineering Research Council of Canada (NSERC) and by Huawei.","publication_identifier":{"issn":["21578095"],"isbn":["9781728164328"]},"scopus_import":"1","doi":"10.1109/ISIT44484.2020.9174141","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1909.04892"}],"article_processing_charge":"No","oa_version":"Preprint","title":"Simplified successive cancellation decoding of polar codes has sublinear latency","publication_status":"published","abstract":[{"lang":"eng","text":"This work analyzes the latency of the simplified successive cancellation (SSC) decoding scheme for polar codes proposed by Alamdar-Yazdi and Kschischang. It is shown that, unlike conventional successive cancellation decoding, where latency is linear in the block length, the latency of SSC decoding is sublinear. More specifically, the latency of SSC decoding is O(N 1−1/µ ), where N is the block length and µ is the scaling exponent of the channel, which captures the speed of convergence of the rate to capacity. Numerical results demonstrate the tightness of the bound and show that most of the latency reduction arises from the parallel decoding of subcodes of rate 0 and 1."}],"citation":{"ista":"Mondelli M, Hashemi SA, Cioffi J, Goldsmith A. 2020. Simplified successive cancellation decoding of polar codes has sublinear latency. IEEE International Symposium on Information Theory - Proceedings. ISIT: Internation Symposium on Information Theory vol. 2020–June, 401–406.","ieee":"M. Mondelli, S. A. Hashemi, J. Cioffi, and A. Goldsmith, “Simplified successive cancellation decoding of polar codes has sublinear latency,” in <i>IEEE International Symposium on Information Theory - Proceedings</i>, Los Angeles, CA, United States, 2020, vol. 2020–June.","ama":"Mondelli M, Hashemi SA, Cioffi J, Goldsmith A. Simplified successive cancellation decoding of polar codes has sublinear latency. In: <i>IEEE International Symposium on Information Theory - Proceedings</i>. Vol 2020-June. IEEE; 2020. doi:<a href=\"https://doi.org/10.1109/ISIT44484.2020.9174141\">10.1109/ISIT44484.2020.9174141</a>","mla":"Mondelli, Marco, et al. “Simplified Successive Cancellation Decoding of Polar Codes Has Sublinear Latency.” <i>IEEE International Symposium on Information Theory - Proceedings</i>, vol. 2020–June, 401–406, IEEE, 2020, doi:<a href=\"https://doi.org/10.1109/ISIT44484.2020.9174141\">10.1109/ISIT44484.2020.9174141</a>.","short":"M. Mondelli, S.A. Hashemi, J. Cioffi, A. Goldsmith, in:, IEEE International Symposium on Information Theory - Proceedings, IEEE, 2020.","apa":"Mondelli, M., Hashemi, S. A., Cioffi, J., &#38; Goldsmith, A. (2020). Simplified successive cancellation decoding of polar codes has sublinear latency. In <i>IEEE International Symposium on Information Theory - Proceedings</i> (Vol. 2020–June). Los Angeles, CA, United States: IEEE. <a href=\"https://doi.org/10.1109/ISIT44484.2020.9174141\">https://doi.org/10.1109/ISIT44484.2020.9174141</a>","chicago":"Mondelli, Marco, Seyyed Ali Hashemi, John Cioffi, and Andrea Goldsmith. “Simplified Successive Cancellation Decoding of Polar Codes Has Sublinear Latency.” In <i>IEEE International Symposium on Information Theory - Proceedings</i>, Vol. 2020–June. IEEE, 2020. <a href=\"https://doi.org/10.1109/ISIT44484.2020.9174141\">https://doi.org/10.1109/ISIT44484.2020.9174141</a>."},"article_number":"401-406","year":"2020","date_created":"2020-09-20T22:01:37Z","_id":"8536","conference":{"start_date":"2020-06-21","end_date":"2020-06-26","name":"ISIT: Internation Symposium on Information Theory","location":"Los Angeles, CA, United States"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Marco","last_name":"Mondelli","id":"27EB676C-8706-11E9-9510-7717E6697425","orcid":"0000-0002-3242-7020","full_name":"Mondelli, Marco"},{"full_name":"Hashemi, Seyyed Ali","first_name":"Seyyed Ali","last_name":"Hashemi"},{"full_name":"Cioffi, John","last_name":"Cioffi","first_name":"John"},{"first_name":"Andrea","last_name":"Goldsmith","full_name":"Goldsmith, Andrea"}],"volume":"2020-June","oa":1,"related_material":{"record":[{"id":"9047","relation":"later_version","status":"public"}]},"arxiv":1,"date_updated":"2023-08-07T13:36:24Z","publication":"IEEE International Symposium on Information Theory - Proceedings","department":[{"_id":"MaMo"}]},{"type":"journal_article","date_published":"2020-09-09T00:00:00Z","external_id":{"arxiv":["2001.02934"]},"publisher":"Springer Nature","month":"09","status":"public","language":[{"iso":"eng"}],"quality_controlled":"1","day":"09","project":[{"grant_number":"788183","call_identifier":"H2020","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","name":"Alpha Shape Theory Extended"}],"oa":1,"author":[{"full_name":"Akopyan, Arseniy","orcid":"0000-0002-2548-617X","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","last_name":"Akopyan","first_name":"Arseniy"},{"full_name":"Schwartz, Richard","first_name":"Richard","last_name":"Schwartz"},{"full_name":"Tabachnikov, Serge","first_name":"Serge","last_name":"Tabachnikov"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","department":[{"_id":"HeEd"}],"ec_funded":1,"date_updated":"2021-12-02T15:10:17Z","publication":"European Journal of Mathematics","arxiv":1,"publication_status":"published","title":"Billiards in ellipses revisited","oa_version":"Preprint","article_processing_charge":"No","scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/2001.02934","open_access":"1"}],"doi":"10.1007/s40879-020-00426-9","acknowledgement":" This paper would not be written if not for Dan Reznik’s curiosity and persistence; we are very grateful to him. We also thank R. Garcia and J. Koiller for interesting discussions. It is a pleasure to thank the Mathematical Institute of the University of Heidelberg for its stimulating atmosphere. ST thanks M. Bialy for interesting discussions and the Tel Aviv\r\nUniversity for its invariable hospitality. AA was supported by European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 78818 Alpha). RS is supported by NSF Grant DMS-1807320. ST was supported by NSF grant DMS-1510055 and SFB/TRR 191.","publication_identifier":{"issn":["2199-675X"],"eissn":["2199-6768"]},"article_type":"original","date_created":"2020-09-20T22:01:38Z","_id":"8538","citation":{"mla":"Akopyan, Arseniy, et al. “Billiards in Ellipses Revisited.” <i>European Journal of Mathematics</i>, Springer Nature, 2020, doi:<a href=\"https://doi.org/10.1007/s40879-020-00426-9\">10.1007/s40879-020-00426-9</a>.","apa":"Akopyan, A., Schwartz, R., &#38; Tabachnikov, S. (2020). Billiards in ellipses revisited. <i>European Journal of Mathematics</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s40879-020-00426-9\">https://doi.org/10.1007/s40879-020-00426-9</a>","chicago":"Akopyan, Arseniy, Richard Schwartz, and Serge Tabachnikov. “Billiards in Ellipses Revisited.” <i>European Journal of Mathematics</i>. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/s40879-020-00426-9\">https://doi.org/10.1007/s40879-020-00426-9</a>.","short":"A. Akopyan, R. Schwartz, S. Tabachnikov, European Journal of Mathematics (2020).","ama":"Akopyan A, Schwartz R, Tabachnikov S. Billiards in ellipses revisited. <i>European Journal of Mathematics</i>. 2020. doi:<a href=\"https://doi.org/10.1007/s40879-020-00426-9\">10.1007/s40879-020-00426-9</a>","ieee":"A. Akopyan, R. Schwartz, and S. Tabachnikov, “Billiards in ellipses revisited,” <i>European Journal of Mathematics</i>. Springer Nature, 2020.","ista":"Akopyan A, Schwartz R, Tabachnikov S. 2020. Billiards in ellipses revisited. European Journal of Mathematics."},"year":"2020","abstract":[{"text":"We prove some recent experimental observations of Dan Reznik concerning periodic billiard orbits in ellipses. For example, the sum of cosines of the angles of a periodic billiard polygon remains constant in the 1-parameter family of such polygons (that exist due to the Poncelet porism). In our proofs, we use geometric and complex analytic methods.","lang":"eng"}]},{"status":"public","isi":1,"month":"06","language":[{"iso":"eng"}],"type":"journal_article","external_id":{"arxiv":["1708.08013"],"isi":["000592182600004"]},"date_published":"2020-06-01T00:00:00Z","publisher":"Société Mathématique de France","issue":"3","quality_controlled":"1","day":"01","page":"663-671","date_updated":"2023-08-22T09:27:57Z","publication":"Annales Scientifiques de l'Ecole Normale Superieure","department":[{"_id":"TaHa"}],"intvolume":"        53","arxiv":1,"volume":53,"oa":1,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","author":[{"full_name":"Su, C.","last_name":"Su","first_name":"C."},{"full_name":"Zhao, Gufang","id":"2BC2AC5E-F248-11E8-B48F-1D18A9856A87","last_name":"Zhao","first_name":"Gufang"},{"full_name":"Zhong, C.","last_name":"Zhong","first_name":"C."}],"date_created":"2020-09-20T22:01:38Z","_id":"8539","abstract":[{"lang":"eng","text":"Cohomological and K-theoretic stable bases originated from the study of quantum cohomology and quantum K-theory. Restriction formula for cohomological stable bases played an important role in computing the quantum connection of cotangent bundle of partial flag varieties. In this paper we study the K-theoretic stable bases of cotangent bundles of flag varieties. We describe these bases in terms of the action of the affine Hecke algebra and the twisted group algebra of KostantKumar. Using this algebraic description and the method of root polynomials, we give a restriction formula of the stable bases. We apply it to obtain the restriction formula for partial flag varieties. We also build a relation between the stable basis and the Casselman basis in the principal series representations of the Langlands dual group. As an application, we give a closed formula for the transition matrix between Casselman basis and the characteristic functions."},{"lang":"fre","text":"Les bases stables cohomologiques et K-théoriques proviennent de l’étude de la cohomologie quantique et de la K-théorie quantique. La formule de restriction pour les bases stables cohomologiques a joué un rôle important dans le calcul de la connexion quantique du fibré cotangent de variétés de drapeaux partielles. Dans cet article, nous étudions les bases stables K-théoriques de fibré cotangents des variétés de drapeaux. Nous décrivons ces bases en fonction de l’action de l’algèbre de Hecke affine et de l’algèbre de Kostant-Kumar. En utilisant cette description algébrique et la méthode des polynômes de racine, nous donnons une formule de restriction des bases stables. Nous l’appliquons\r\npour obtenir la formule de restriction pour les variétés de drapeaux partielles. Nous construisons également une relation entre la base stable et la base de Casselman dans les représentations de la série principale du groupe dual de Langlands p-adique. Comme une application, nous donnons une formule close pour la matrice de transition entre la base de Casselman et les fonctions caractéristiques. "}],"citation":{"mla":"Su, C., et al. “On the K-Theory Stable Bases of the Springer Resolution.” <i>Annales Scientifiques de l’Ecole Normale Superieure</i>, vol. 53, no. 3, Société Mathématique de France, 2020, pp. 663–71, doi:<a href=\"https://doi.org/10.24033/asens.2431\">10.24033/asens.2431</a>.","chicago":"Su, C., Gufang Zhao, and C. Zhong. “On the K-Theory Stable Bases of the Springer Resolution.” <i>Annales Scientifiques de l’Ecole Normale Superieure</i>. Société Mathématique de France, 2020. <a href=\"https://doi.org/10.24033/asens.2431\">https://doi.org/10.24033/asens.2431</a>.","short":"C. Su, G. Zhao, C. Zhong, Annales Scientifiques de l’Ecole Normale Superieure 53 (2020) 663–671.","apa":"Su, C., Zhao, G., &#38; Zhong, C. (2020). On the K-theory stable bases of the springer resolution. <i>Annales Scientifiques de l’Ecole Normale Superieure</i>. Société Mathématique de France. <a href=\"https://doi.org/10.24033/asens.2431\">https://doi.org/10.24033/asens.2431</a>","ieee":"C. Su, G. Zhao, and C. Zhong, “On the K-theory stable bases of the springer resolution,” <i>Annales Scientifiques de l’Ecole Normale Superieure</i>, vol. 53, no. 3. Société Mathématique de France, pp. 663–671, 2020.","ista":"Su C, Zhao G, Zhong C. 2020. On the K-theory stable bases of the springer resolution. Annales Scientifiques de l’Ecole Normale Superieure. 53(3), 663–671.","ama":"Su C, Zhao G, Zhong C. On the K-theory stable bases of the springer resolution. <i>Annales Scientifiques de l’Ecole Normale Superieure</i>. 2020;53(3):663-671. doi:<a href=\"https://doi.org/10.24033/asens.2431\">10.24033/asens.2431</a>"},"year":"2020","oa_version":"Preprint","article_processing_charge":"No","title":"On the K-theory stable bases of the springer resolution","publication_status":"published","publication_identifier":{"issn":["0012-9593"]},"article_type":"original","scopus_import":"1","doi":"10.24033/asens.2431","main_file_link":[{"url":"https://arxiv.org/abs/1708.08013","open_access":"1"}]},{"citation":{"ista":"Belyaeva V, Wachner S, Gridchyn I, Linder M, Emtenani S, György A, Sibilia M, Siekhaus DE. Cortical actin properties controlled by Drosophila Fos aid macrophage infiltration against surrounding tissue resistance. bioRxiv, <a href=\"https://doi.org/10.1101/2020.09.18.301481\">10.1101/2020.09.18.301481</a>.","ieee":"V. Belyaeva <i>et al.</i>, “Cortical actin properties controlled by Drosophila Fos aid macrophage infiltration against surrounding tissue resistance,” <i>bioRxiv</i>. .","ama":"Belyaeva V, Wachner S, Gridchyn I, et al. Cortical actin properties controlled by Drosophila Fos aid macrophage infiltration against surrounding tissue resistance. <i>bioRxiv</i>. doi:<a href=\"https://doi.org/10.1101/2020.09.18.301481\">10.1101/2020.09.18.301481</a>","short":"V. Belyaeva, S. Wachner, I. Gridchyn, M. Linder, S. Emtenani, A. György, M. Sibilia, D.E. Siekhaus, BioRxiv (n.d.).","apa":"Belyaeva, V., Wachner, S., Gridchyn, I., Linder, M., Emtenani, S., György, A., … Siekhaus, D. E. (n.d.). Cortical actin properties controlled by Drosophila Fos aid macrophage infiltration against surrounding tissue resistance. <i>bioRxiv</i>. <a href=\"https://doi.org/10.1101/2020.09.18.301481\">https://doi.org/10.1101/2020.09.18.301481</a>","chicago":"Belyaeva, Vera, Stephanie Wachner, Igor Gridchyn, Markus Linder, Shamsi Emtenani, Attila György, Maria Sibilia, and Daria E Siekhaus. “Cortical Actin Properties Controlled by Drosophila Fos Aid Macrophage Infiltration against Surrounding Tissue Resistance.” <i>BioRxiv</i>, n.d. <a href=\"https://doi.org/10.1101/2020.09.18.301481\">https://doi.org/10.1101/2020.09.18.301481</a>.","mla":"Belyaeva, Vera, et al. “Cortical Actin Properties Controlled by Drosophila Fos Aid Macrophage Infiltration against Surrounding Tissue Resistance.” <i>BioRxiv</i>, doi:<a href=\"https://doi.org/10.1101/2020.09.18.301481\">10.1101/2020.09.18.301481</a>."},"year":"2020","abstract":[{"text":"The infiltration of immune cells into tissues underlies the establishment of tissue resident macrophages, and responses to infections and tumors. Yet the mechanisms immune cells utilize to negotiate tissue barriers in living organisms are not well understood, and a role for cortical actin has not been examined. Here we find that the tissue invasion of Drosophila macrophages, also known as plasmatocytes or hemocytes, utilizes enhanced cortical F-actin levels stimulated by the Drosophila member of the fos proto oncogene transcription factor family (Dfos, Kayak). RNA sequencing analysis and live imaging show that Dfos enhances F-actin levels around the entire macrophage surface by increasing mRNA levels of the membrane spanning molecular scaffold tetraspanin TM4SF, and the actin cross-linking filamin Cheerio which are themselves required for invasion. Cortical F-actin levels are critical as expressing a dominant active form of Diaphanous, a actin polymerizing Formin, can rescue the Dfos Dominant Negative macrophage invasion defect. In vivo imaging shows that Dfos is required to enhance the efficiency of the initial phases of macrophage tissue entry. Genetic evidence argues that this Dfos-induced program in macrophages counteracts the constraint produced by the tension of surrounding tissues and buffers the mechanical properties of the macrophage nucleus from affecting tissue entry. We thus identify tuning the cortical actin cytoskeleton through Dfos as a key process allowing efficient forward movement of an immune cell into surrounding tissues.","lang":"eng"}],"project":[{"name":"Drosophila TNFa´s Funktion in Immunzellen","_id":"253B6E48-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P29638"},{"_id":"2536F660-B435-11E9-9278-68D0E5697425","name":"Investigating the role of transporters in invasive migration through junctions","call_identifier":"FP7","grant_number":"334077"},{"grant_number":"24800","name":"Tissue barrier penetration is crucial for immunity and metastasis","_id":"26199CA4-B435-11E9-9278-68D0E5697425"}],"date_created":"2020-09-23T09:36:47Z","_id":"8557","doi":"10.1101/2020.09.18.301481","main_file_link":[{"url":"https://doi.org/10.1101/2020.09.18.301481","open_access":"1"}],"acknowledgement":"We thank the following for their contributions: The Drosophila Genomics Resource Center supported by NIH grant 2P40OD010949-10A1 for plasmids, K. Brueckner. B. Stramer, M. Uhlirova, O. Schuldiner, the Bloomington Drosophila Stock Center supported by NIH grant P40OD018537 and the Vienna Drosophila Resource Center for fly stocks, FlyBase (Thurmond et al., 2019) for essential genomic information, and the BDGP in situ database for data (Tomancak et al., 2002, 2007). For antibodies, we thank the Developmental Studies Hybridoma Bank, which was created by the Eunice Kennedy Shriver National Institute of Child Health and Human Development of the NIH, and is maintained at the University of Iowa, as well as J. Zeitlinger for her generous gift of Dfos antibody. We thank the Vienna BioCenter Core Facilities for RNA sequencing and analysis and the Life Scientific Service Units at IST Austria for technical support and assistance with microscopy and FACS analysis. We thank C.P. Heisenberg, P. Martin, M. Sixt and Siekhaus group members for discussions and T.Hurd, A. Ratheesh and P. Rangan for comments on the manuscript. A.G. was supported by the Austrian Science Fund (FWF) grant DASI_FWF01_P29638S, D.E.S. by Marie Curie CIG 334077/IRTIM. M.S. is supported by the FWF, PhD program W1212 915 and the European Research Council (ERC) Advanced grant (ERC-2015-AdG TNT-Tumors 694883). S.W. is supported by an OEAW, DOC fellowship.","day":"18","title":"Cortical actin properties controlled by Drosophila Fos aid macrophage infiltration against surrounding tissue resistance","publication_status":"submitted","article_processing_charge":"No","oa_version":"Preprint","language":[{"iso":"eng"}],"department":[{"_id":"DaSi"},{"_id":"JoCs"}],"month":"09","date_updated":"2024-03-25T23:30:12Z","ec_funded":1,"status":"public","publication":"bioRxiv","author":[{"full_name":"Belyaeva, Vera","id":"47F080FE-F248-11E8-B48F-1D18A9856A87","last_name":"Belyaeva","first_name":"Vera"},{"first_name":"Stephanie","last_name":"Wachner","id":"2A95E7B0-F248-11E8-B48F-1D18A9856A87","full_name":"Wachner, Stephanie"},{"first_name":"Igor","last_name":"Gridchyn","id":"4B60654C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1807-1929","full_name":"Gridchyn, Igor"},{"first_name":"Markus","last_name":"Linder","full_name":"Linder, Markus"},{"first_name":"Shamsi","last_name":"Emtenani","orcid":"0000-0001-6981-6938","id":"49D32318-F248-11E8-B48F-1D18A9856A87","full_name":"Emtenani, Shamsi"},{"last_name":"György","first_name":"Attila","full_name":"György, Attila","id":"3BCEDBE0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1819-198X"},{"first_name":"Maria","last_name":"Sibilia","full_name":"Sibilia, Maria"},{"last_name":"Siekhaus","first_name":"Daria E","full_name":"Siekhaus, Daria E","orcid":"0000-0001-8323-8353","id":"3D224B9E-F248-11E8-B48F-1D18A9856A87"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"preprint","acknowledged_ssus":[{"_id":"LifeSc"}],"date_published":"2020-09-18T00:00:00Z","oa":1,"related_material":{"record":[{"id":"10614","relation":"later_version","status":"public"},{"status":"public","relation":"dissertation_contains","id":"8983"}]}}]