[{"doi":"10.15479/AT:ISTA:14592","date_published":"2020-12-01T00:00:00Z","tmp":{"name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","image":"/images/cc_by_nc_sa.png","short":"CC BY-NC-SA (4.0)"},"citation":{"ista":"Schur FK. 2020. STL-files for 3D-printed grid holders described in Fäßler F, Zens B, et al.; 3D printed cell culture grid holders for improved cellular specimen preparation in cryo-electron microscopy, Institute of Science and Technology Austria, 10.15479/AT:ISTA:14592.","apa":"Schur, F. K. (2020). STL-files for 3D-printed grid holders described in Fäßler F, Zens B, et al.; 3D printed cell culture grid holders for improved cellular specimen preparation in cryo-electron microscopy. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:14592","ieee":"F. K. Schur, “STL-files for 3D-printed grid holders described in Fäßler F, Zens B, et al.; 3D printed cell culture grid holders for improved cellular specimen preparation in cryo-electron microscopy.” Institute of Science and Technology Austria, 2020.","ama":"Schur FK. STL-files for 3D-printed grid holders described in Fäßler F, Zens B, et al.; 3D printed cell culture grid holders for improved cellular specimen preparation in cryo-electron microscopy. 2020. doi:10.15479/AT:ISTA:14592","chicago":"Schur, Florian KM. “STL-Files for 3D-Printed Grid Holders Described in Fäßler F, Zens B, et Al.; 3D Printed Cell Culture Grid Holders for Improved Cellular Specimen Preparation in Cryo-Electron Microscopy.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:14592.","mla":"Schur, Florian KM. STL-Files for 3D-Printed Grid Holders Described in Fäßler F, Zens B, et Al.; 3D Printed Cell Culture Grid Holders for Improved Cellular Specimen Preparation in Cryo-Electron Microscopy. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:14592.","short":"F.K. Schur, (2020)."},"oa":1,"project":[{"name":"Structure and isoform diversity of the Arp2/3 complex","_id":"9B954C5C-BA93-11EA-9121-9846C619BF3A","grant_number":"P33367"}],"article_processing_charge":"No","has_accepted_license":"1","day":"01","month":"12","related_material":{"record":[{"status":"public","relation":"research_data","id":"8586"}]},"contributor":[{"first_name":"Florian","contributor_type":"researcher","last_name":"Fäßler","id":"404F5528-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7149-769X"},{"first_name":"Bettina","contributor_type":"researcher","last_name":"Zens","id":"45FD126C-F248-11E8-B48F-1D18A9856A87"},{"id":"4E01D6B4-F248-11E8-B48F-1D18A9856A87","first_name":"Robert","last_name":"Hauschild","contributor_type":"researcher"},{"first_name":"Florian KM","contributor_type":"researcher","last_name":"Schur","id":"48AD8942-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4790-8078"}],"author":[{"last_name":"Schur","first_name":"Florian KM","orcid":"0000-0003-4790-8078","id":"48AD8942-F248-11E8-B48F-1D18A9856A87","full_name":"Schur, Florian KM"}],"oa_version":"Published Version","file":[{"access_level":"open_access","file_name":"3Dprint-files_download_v2.zip","file_size":49297,"content_type":"application/zip","creator":"fschur","relation":"main_file","file_id":"14593","checksum":"0108616e2a59e51879ea51299a29b091","success":1,"date_created":"2023-11-22T14:58:44Z","date_updated":"2023-11-22T14:58:44Z"},{"creator":"cchlebak","content_type":"text/plain","file_size":641,"file_name":"readme.txt","access_level":"open_access","date_updated":"2023-12-01T10:39:59Z","date_created":"2023-12-01T10:39:59Z","success":1,"checksum":"4c66ddedee4d01c1c4a7978208350cfc","file_id":"14637","relation":"main_file"}],"date_updated":"2024-02-21T12:44:48Z","date_created":"2023-11-22T15:00:57Z","_id":"14592","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2020","publisher":"Institute of Science and Technology Austria","department":[{"_id":"FlSc"}],"title":"STL-files for 3D-printed grid holders described in Fäßler F, Zens B, et al.; 3D printed cell culture grid holders for improved cellular specimen preparation in cryo-electron microscopy","status":"public","ddc":["570"],"file_date_updated":"2023-12-01T10:39:59Z","abstract":[{"text":"Cryo-electron microscopy (cryo-EM) of cellular specimens provides insights into biological processes and structures within a native context. However, a major challenge still lies in the efficient and reproducible preparation of adherent cells for subsequent cryo-EM analysis. This is due to the sensitivity of many cellular specimens to the varying seeding and culturing conditions required for EM experiments, the often limited amount of cellular material and also the fragility of EM grids and their substrate. Here, we present low-cost and reusable 3D printed grid holders, designed to improve specimen preparation when culturing challenging cellular samples directly on grids. The described grid holders increase cell culture reproducibility and throughput, and reduce the resources required for cell culturing. We show that grid holders can be integrated into various cryo-EM workflows, including micro-patterning approaches to control cell seeding on grids, and for generating samples for cryo-focused ion beam milling and cryo-electron tomography experiments. Their adaptable design allows for the generation of specialized grid holders customized to a large variety of applications.","lang":"eng"}],"type":"research_data"},{"file":[{"date_updated":"2020-10-08T08:16:48Z","date_created":"2020-10-08T08:16:48Z","checksum":"8951f094c8c7dae9ff8db885199bc296","success":1,"relation":"main_file","file_id":"8625","file_size":310598,"content_type":"application/pdf","creator":"bchatter","file_name":"main.pdf","access_level":"open_access"}],"oa_version":"Submitted Version","ddc":["004"],"title":"A persistent homology perspective to the link prediction problem","status":"public","intvolume":" 881","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"7213","abstract":[{"text":"Persistent homology is a powerful tool in Topological Data Analysis (TDA) to capture the topological properties of data succinctly at different spatial resolutions. For graphical data, the shape, and structure of the neighborhood of individual data items (nodes) are an essential means of characterizing their properties. We propose the use of persistent homology methods to capture structural and topological properties of graphs and use it to address the problem of link prediction. We achieve encouraging results on nine different real-world datasets that attest to the potential of persistent homology-based methods for network analysis.","lang":"eng"}],"alternative_title":["SCI"],"type":"conference","date_published":"2020-01-01T00:00:00Z","page":"27-39","publication":"Complex Networks and their applications VIII","citation":{"apa":"Bhatia, S., Chatterjee, B., Nathani, D., & Kaul, M. (2020). A persistent homology perspective to the link prediction problem. In Complex Networks and their applications VIII (Vol. 881, pp. 27–39). Lisbon, Portugal: Springer Nature. https://doi.org/10.1007/978-3-030-36687-2_3","ieee":"S. Bhatia, B. Chatterjee, D. Nathani, and M. Kaul, “A persistent homology perspective to the link prediction problem,” in Complex Networks and their applications VIII, Lisbon, Portugal, 2020, vol. 881, pp. 27–39.","ista":"Bhatia S, Chatterjee B, Nathani D, Kaul M. 2020. A persistent homology perspective to the link prediction problem. Complex Networks and their applications VIII. COMPLEX: International Conference on Complex Networks and their Applications, SCI, vol. 881, 27–39.","ama":"Bhatia S, Chatterjee B, Nathani D, Kaul M. A persistent homology perspective to the link prediction problem. In: Complex Networks and Their Applications VIII. Vol 881. Springer Nature; 2020:27-39. doi:10.1007/978-3-030-36687-2_3","chicago":"Bhatia, Sumit, Bapi Chatterjee, Deepak Nathani, and Manohar Kaul. “A Persistent Homology Perspective to the Link Prediction Problem.” In Complex Networks and Their Applications VIII, 881:27–39. Springer Nature, 2020. https://doi.org/10.1007/978-3-030-36687-2_3.","short":"S. Bhatia, B. Chatterjee, D. Nathani, M. Kaul, in:, Complex Networks and Their Applications VIII, Springer Nature, 2020, pp. 27–39.","mla":"Bhatia, Sumit, et al. “A Persistent Homology Perspective to the Link Prediction Problem.” Complex Networks and Their Applications VIII, vol. 881, Springer Nature, 2020, pp. 27–39, doi:10.1007/978-3-030-36687-2_3."},"day":"01","article_processing_charge":"No","has_accepted_license":"1","scopus_import":"1","date_updated":"2024-02-22T13:16:06Z","date_created":"2019-12-29T23:00:45Z","volume":881,"author":[{"first_name":"Sumit","last_name":"Bhatia","full_name":"Bhatia, Sumit"},{"full_name":"Chatterjee, Bapi","id":"3C41A08A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2742-4028","first_name":"Bapi","last_name":"Chatterjee"},{"last_name":"Nathani","first_name":"Deepak","full_name":"Nathani, Deepak"},{"full_name":"Kaul, Manohar","first_name":"Manohar","last_name":"Kaul"}],"publication_status":"published","publisher":"Springer Nature","department":[{"_id":"DaAl"}],"year":"2020","file_date_updated":"2020-10-08T08:16:48Z","ec_funded":1,"language":[{"iso":"eng"}],"conference":{"name":"COMPLEX: International Conference on Complex Networks and their Applications","start_date":"2019-12-10","location":"Lisbon, Portugal","end_date":"2019-12-12"},"doi":"10.1007/978-3-030-36687-2_3","isi":1,"quality_controlled":"1","project":[{"name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"external_id":{"isi":["000843927300003"]},"oa":1,"month":"01","publication_identifier":{"issn":["1860949X"],"eissn":["18609503"],"isbn":["9783030366865"]}},{"abstract":[{"text":"In this paper, we present the first Asynchronous Distributed Key Generation (ADKG) algorithm which is also the first distributed key generation algorithm that can generate cryptographic keys with a dual (f,2f+1)-threshold (where f is the number of faulty parties). As a result, using our ADKG we remove the trusted setup assumption that the most scalable consensus algorithms make. In order to create a DKG with a dual (f,2f+1)- threshold we first answer in the affirmative the open question posed by Cachin et al. [7] on how to create an Asynchronous Verifiable Secret Sharing (AVSS) protocol with a reconstruction threshold of f+1Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security, Association for Computing Machinery, 2020, pp. 1751–1767, doi:10.1145/3372297.3423364.","short":"E. Kokoris Kogias, D. Malkhi, A. Spiegelman, in:, Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security, Association for Computing Machinery, 2020, pp. 1751–1767.","chicago":"Kokoris Kogias, Eleftherios, Dahlia Malkhi, and Alexander Spiegelman. “Asynchronous Distributed Key Generation for Computationally-Secure Randomness, Consensus, and Threshold Signatures.” In Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security, 1751–1767. Association for Computing Machinery, 2020. https://doi.org/10.1145/3372297.3423364.","ama":"Kokoris Kogias E, Malkhi D, Spiegelman A. Asynchronous distributed key generation for computationally-secure randomness, consensus, and threshold signatures. In: Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security. Association for Computing Machinery; 2020:1751–1767. doi:10.1145/3372297.3423364","ista":"Kokoris Kogias E, Malkhi D, Spiegelman A. 2020. Asynchronous distributed key generation for computationally-secure randomness, consensus, and threshold signatures. Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security. CCS: Computer and Communications Security, 1751–1767.","ieee":"E. Kokoris Kogias, D. Malkhi, and A. Spiegelman, “Asynchronous distributed key generation for computationally-secure randomness, consensus, and threshold signatures,” in Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security, Virtual, United States, 2020, pp. 1751–1767.","apa":"Kokoris Kogias, E., Malkhi, D., & Spiegelman, A. (2020). Asynchronous distributed key generation for computationally-secure randomness, consensus, and threshold signatures. In Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security (pp. 1751–1767). Virtual, United States: Association for Computing Machinery. https://doi.org/10.1145/3372297.3423364"},"publication":"Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security","date_created":"2021-12-16T13:23:27Z","date_updated":"2024-02-22T13:10:45Z","author":[{"full_name":"Kokoris Kogias, Eleftherios","id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30","first_name":"Eleftherios","last_name":"Kokoris Kogias"},{"first_name":"Dahlia","last_name":"Malkhi","full_name":"Malkhi, Dahlia"},{"first_name":"Alexander","last_name":"Spiegelman","full_name":"Spiegelman, Alexander"}],"department":[{"_id":"ElKo"}],"publisher":"Association for Computing Machinery","publication_status":"published","acknowledgement":"We would like to thank Ittai Abraham for the discussions and guidance during the initial conception of the project, especially for HAVSS. Furthermore, we would like to thank the anonymous reviewers for pointing out the relevance of this work to MPC protocols.","year":"2020","publication_identifier":{"isbn":["978-1-4503-7089-9"]},"month":"10","language":[{"iso":"eng"}],"doi":"10.1145/3372297.3423364","conference":{"end_date":"2020-11-13","location":"Virtual, United States","start_date":"2020-11-09","name":"CCS: Computer and Communications Security"},"isi":1,"quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2019/1015"}],"oa":1,"external_id":{"isi":["000768470400104"]}},{"isi":1,"quality_controlled":"1","project":[{"name":"The Wittgenstein Prize","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211"}],"external_id":{"isi":["000680435100021"]},"oa":1,"language":[{"iso":"eng"}],"conference":{"name":"RTTS: Real-Time Systems Symposium","start_date":"2020-12-01","location":"Houston, TX, USA ","end_date":"2020-12-04"},"doi":"10.1109/RTSS49844.2020.00031","month":"12","publication_identifier":{"eisbn":["9781728183244"],"eissn":["2576-3172"]},"publication_status":"published","publisher":"IEEE","department":[{"_id":"ToHe"}],"acknowledgement":"Miriam Garc´ıa Soto was partially supported by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). Pavithra Prabhakar was partially supported by NSF CAREER Award No. 1552668, NSF Award No. 2008957 and ONR YIP Award No. N000141712577.","year":"2020","date_updated":"2024-02-22T13:25:19Z","date_created":"2021-02-26T16:38:24Z","author":[{"full_name":"Garcia Soto, Miriam","id":"4B3207F6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2936-5719","first_name":"Miriam","last_name":"Garcia Soto"},{"full_name":"Prabhakar, Pavithra","last_name":"Prabhakar","first_name":"Pavithra"}],"file_date_updated":"2021-02-26T16:38:14Z","page":"244-256","publication":"2020 IEEE Real-Time Systems Symposium","citation":{"ista":"Garcia Soto M, Prabhakar P. 2020. Hybridization for stability verification of nonlinear switched systems. 2020 IEEE Real-Time Systems Symposium. RTTS: Real-Time Systems Symposium, 244–256.","ieee":"M. Garcia Soto and P. Prabhakar, “Hybridization for stability verification of nonlinear switched systems,” in 2020 IEEE Real-Time Systems Symposium, Houston, TX, USA , 2020, pp. 244–256.","apa":"Garcia Soto, M., & Prabhakar, P. (2020). Hybridization for stability verification of nonlinear switched systems. In 2020 IEEE Real-Time Systems Symposium (pp. 244–256). Houston, TX, USA : IEEE. https://doi.org/10.1109/RTSS49844.2020.00031","ama":"Garcia Soto M, Prabhakar P. Hybridization for stability verification of nonlinear switched systems. In: 2020 IEEE Real-Time Systems Symposium. IEEE; 2020:244-256. doi:10.1109/RTSS49844.2020.00031","chicago":"Garcia Soto, Miriam, and Pavithra Prabhakar. “Hybridization for Stability Verification of Nonlinear Switched Systems.” In 2020 IEEE Real-Time Systems Symposium, 244–56. IEEE, 2020. https://doi.org/10.1109/RTSS49844.2020.00031.","mla":"Garcia Soto, Miriam, and Pavithra Prabhakar. “Hybridization for Stability Verification of Nonlinear Switched Systems.” 2020 IEEE Real-Time Systems Symposium, IEEE, 2020, pp. 244–56, doi:10.1109/RTSS49844.2020.00031.","short":"M. Garcia Soto, P. Prabhakar, in:, 2020 IEEE Real-Time Systems Symposium, IEEE, 2020, pp. 244–256."},"date_published":"2020-12-01T00:00:00Z","day":"01","has_accepted_license":"1","article_processing_charge":"No","ddc":["000"],"title":"Hybridization for stability verification of nonlinear switched systems","status":"public","_id":"9202","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","file":[{"file_name":"main.pdf","access_level":"open_access","creator":"mgarcias","file_size":1125794,"content_type":"application/pdf","file_id":"9203","relation":"main_file","date_updated":"2021-02-26T16:38:14Z","date_created":"2021-02-26T16:38:14Z","checksum":"8f97f229316c3b3a6f0cf99297aa0941"}],"type":"conference","abstract":[{"lang":"eng","text":"We propose a novel hybridization method for stability analysis that over-approximates nonlinear dynamical systems by switched systems with linear inclusion dynamics. We observe that existing hybridization techniques for safety analysis that over-approximate nonlinear dynamical systems by switched affine inclusion dynamics and provide fixed approximation error, do not suffice for stability analysis. Hence, we propose a hybridization method that provides a state-dependent error which converges to zero as the state tends to the equilibrium point. The crux of our hybridization computation is an elegant recursive algorithm that uses partial derivatives of a given function to obtain upper and lower bound matrices for the over-approximating linear inclusion. We illustrate our method on some examples to demonstrate the application of the theory for stability analysis. In particular, our method is able to establish stability of a nonlinear system which does not admit a polynomial Lyapunov function."}]},{"ec_funded":1,"acknowledgement":"We would like to thank P. T. Nam and R. Seiringer for several useful discussions and\r\nfor suggesting us to use the localization techniques from [9]. C. Boccato has received funding from the\r\nEuropean Research Council (ERC) under the programme Horizon 2020 (Grant Agreement 694227). B. Schlein gratefully acknowledges support from the NCCR SwissMAP and from the Swiss National Foundation of Science (Grant No. 200020_1726230) through the SNF Grant “Dynamical and energetic properties of Bose–Einstein condensates”.","year":"2020","publication_status":"published","department":[{"_id":"RoSe"}],"publisher":"Springer","author":[{"last_name":"Boccato","first_name":"Chiara","id":"342E7E22-F248-11E8-B48F-1D18A9856A87","full_name":"Boccato, Chiara"},{"full_name":"Brennecke, Christian","last_name":"Brennecke","first_name":"Christian"},{"last_name":"Cenatiempo","first_name":"Serena","full_name":"Cenatiempo, Serena"},{"first_name":"Benjamin","last_name":"Schlein","full_name":"Schlein, Benjamin"}],"date_created":"2019-09-24T17:30:59Z","date_updated":"2024-02-22T13:33:02Z","volume":376,"month":"06","publication_identifier":{"eissn":["1432-0916"],"issn":["0010-3616"]},"external_id":{"isi":["000536053300012"],"arxiv":["1812.03086"]},"oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1812.03086","open_access":"1"}],"isi":1,"quality_controlled":"1","project":[{"call_identifier":"H2020","name":"Analysis of quantum many-body systems","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","grant_number":"694227"}],"doi":"10.1007/s00220-019-03555-9","language":[{"iso":"eng"}],"type":"journal_article","abstract":[{"lang":"eng","text":"We consider systems of bosons trapped in a box, in the Gross–Pitaevskii regime. We show that low-energy states exhibit complete Bose–Einstein condensation with an optimal bound on the number of orthogonal excitations. This extends recent results obtained in Boccato et al. (Commun Math Phys 359(3):975–1026, 2018), removing the assumption of small interaction potential."}],"_id":"6906","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","title":"Optimal rate for Bose-Einstein condensation in the Gross-Pitaevskii regime","status":"public","intvolume":" 376","oa_version":"Preprint","scopus_import":"1","day":"01","article_processing_charge":"No","publication":"Communications in Mathematical Physics","citation":{"chicago":"Boccato, Chiara, Christian Brennecke, Serena Cenatiempo, and Benjamin Schlein. “Optimal Rate for Bose-Einstein Condensation in the Gross-Pitaevskii Regime.” Communications in Mathematical Physics. Springer, 2020. https://doi.org/10.1007/s00220-019-03555-9.","short":"C. Boccato, C. Brennecke, S. Cenatiempo, B. Schlein, Communications in Mathematical Physics 376 (2020) 1311–1395.","mla":"Boccato, Chiara, et al. “Optimal Rate for Bose-Einstein Condensation in the Gross-Pitaevskii Regime.” Communications in Mathematical Physics, vol. 376, Springer, 2020, pp. 1311–95, doi:10.1007/s00220-019-03555-9.","apa":"Boccato, C., Brennecke, C., Cenatiempo, S., & Schlein, B. (2020). Optimal rate for Bose-Einstein condensation in the Gross-Pitaevskii regime. Communications in Mathematical Physics. Springer. https://doi.org/10.1007/s00220-019-03555-9","ieee":"C. Boccato, C. Brennecke, S. Cenatiempo, and B. Schlein, “Optimal rate for Bose-Einstein condensation in the Gross-Pitaevskii regime,” Communications in Mathematical Physics, vol. 376. Springer, pp. 1311–1395, 2020.","ista":"Boccato C, Brennecke C, Cenatiempo S, Schlein B. 2020. Optimal rate for Bose-Einstein condensation in the Gross-Pitaevskii regime. Communications in Mathematical Physics. 376, 1311–1395.","ama":"Boccato C, Brennecke C, Cenatiempo S, Schlein B. Optimal rate for Bose-Einstein condensation in the Gross-Pitaevskii regime. Communications in Mathematical Physics. 2020;376:1311-1395. doi:10.1007/s00220-019-03555-9"},"article_type":"original","page":"1311-1395","date_published":"2020-06-01T00:00:00Z"}]