--- _id: '8761' acknowledged_ssus: - _id: ScienComp article_processing_charge: No author: - first_name: Ruslan full_name: Guseinov, Ruslan id: 3AB45EE2-F248-11E8-B48F-1D18A9856A87 last_name: Guseinov orcid: 0000-0001-9819-5077 citation: ama: Guseinov R. Supplementary data for “Computational design of cold bent glass façades.” 2020. doi:10.15479/AT:ISTA:8761 apa: Guseinov, R. (2020). Supplementary data for “Computational design of cold bent glass façades.” Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:8761 chicago: Guseinov, Ruslan. “Supplementary Data for ‘Computational Design of Cold Bent Glass Façades.’” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:8761. ieee: R. Guseinov, “Supplementary data for ‘Computational design of cold bent glass façades.’” Institute of Science and Technology Austria, 2020. ista: Guseinov R. 2020. Supplementary data for ‘Computational design of cold bent glass façades’, Institute of Science and Technology Austria, 10.15479/AT:ISTA:8761. mla: Guseinov, Ruslan. Supplementary Data for “Computational Design of Cold Bent Glass Façades.” Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:8761. short: R. Guseinov, (2020). contributor: - contributor_type: researcher first_name: Konstantinos last_name: Gavriil - contributor_type: researcher first_name: Ruslan id: 3AB45EE2-F248-11E8-B48F-1D18A9856A87 last_name: Guseinov orcid: 0000-0001-9819-5077 - contributor_type: researcher first_name: Jesus id: 2DC83906-F248-11E8-B48F-1D18A9856A87 last_name: Perez Rodriguez - contributor_type: researcher first_name: Davide last_name: Pellis - contributor_type: researcher first_name: Paul M id: 13C09E74-18D9-11E9-8878-32CFE5697425 last_name: Henderson orcid: 0000-0002-5198-7445 - contributor_type: researcher first_name: Florian last_name: Rist - contributor_type: researcher first_name: Helmut last_name: Pottmann - contributor_type: researcher first_name: Bernd id: 49876194-F248-11E8-B48F-1D18A9856A87 last_name: Bickel orcid: 0000-0001-6511-9385 date_created: 2020-11-16T10:47:18Z date_published: 2020-11-23T00:00:00Z date_updated: 2024-02-21T12:43:22Z day: '23' ddc: - '000' department: - _id: BeBi doi: 10.15479/AT:ISTA:8761 ec_funded: 1 file: - access_level: open_access checksum: f5ae57b97017b9f61081032703361233 content_type: application/x-gzip creator: rguseino date_created: 2020-11-16T10:31:29Z date_updated: 2020-11-16T10:31:29Z file_id: '8762' file_name: mdn_model.tar.gz file_size: 15378270 relation: main_file success: 1 - access_level: open_access checksum: b0d25e04060ee78c585ee2f23542c744 content_type: application/x-gzip creator: rguseino date_created: 2020-11-16T10:43:23Z date_updated: 2020-11-16T10:43:23Z file_id: '8763' file_name: optimal_panels_data.tar.gz file_size: 615387734 relation: main_file success: 1 - access_level: open_access checksum: 69c1dde3434ada86d125e0c2588caf1e content_type: text/plain creator: rguseino date_created: 2020-11-18T10:04:59Z date_updated: 2020-11-18T10:04:59Z file_id: '8770' file_name: readme.txt file_size: 1228 relation: main_file success: 1 file_date_updated: 2020-11-18T10:04:59Z has_accepted_license: '1' month: '11' oa: 1 oa_version: Published Version project: - _id: 24F9549A-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '715767' name: 'MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling' publisher: Institute of Science and Technology Austria related_material: link: - relation: software url: https://github.com/russelmann/cold-glass-acm record: - id: '8562' relation: used_in_publication status: public status: public title: Supplementary data for "Computational design of cold bent glass façades" tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: research_data user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2020' ... --- _id: '8563' abstract: - lang: eng text: "Supplementary data provided for the provided for the publication:\r\nIgor Gridchyn , Philipp Schoenenberger , Joseph O'Neill , Jozsef Csicsvari (2020) Optogenetic inhibition-mediated activity-dependent modification of CA1 pyramidal-interneuron connections during behavior. Elife." article_processing_charge: No author: - first_name: Jozsef L full_name: Csicsvari, Jozsef L id: 3FA14672-F248-11E8-B48F-1D18A9856A87 last_name: Csicsvari orcid: 0000-0002-5193-4036 - first_name: Igor full_name: Gridchyn, Igor id: 4B60654C-F248-11E8-B48F-1D18A9856A87 last_name: Gridchyn orcid: 0000-0002-1807-1929 - first_name: Philipp full_name: Schönenberger, Philipp id: 3B9D816C-F248-11E8-B48F-1D18A9856A87 last_name: Schönenberger citation: ama: Csicsvari JL, Gridchyn I, Schönenberger P. Optogenetic alteration of hippocampal network activity. 2020. doi:10.15479/AT:ISTA:8563 apa: Csicsvari, J. L., Gridchyn, I., & Schönenberger, P. (2020). Optogenetic alteration of hippocampal network activity. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:8563 chicago: Csicsvari, Jozsef L, Igor Gridchyn, and Philipp Schönenberger. “Optogenetic Alteration of Hippocampal Network Activity.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:8563. ieee: J. L. Csicsvari, I. Gridchyn, and P. Schönenberger, “Optogenetic alteration of hippocampal network activity.” Institute of Science and Technology Austria, 2020. ista: Csicsvari JL, Gridchyn I, Schönenberger P. 2020. Optogenetic alteration of hippocampal network activity, Institute of Science and Technology Austria, 10.15479/AT:ISTA:8563. mla: Csicsvari, Jozsef L., et al. Optogenetic Alteration of Hippocampal Network Activity. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:8563. short: J.L. Csicsvari, I. Gridchyn, P. Schönenberger, (2020). contributor: - contributor_type: project_leader first_name: Jozsef L id: 3FA14672-F248-11E8-B48F-1D18A9856A87 last_name: Csicsvari orcid: 0000-0002-5193-4036 date_created: 2020-09-23T14:39:54Z date_published: 2020-10-19T00:00:00Z date_updated: 2024-02-21T12:43:41Z day: '19' ddc: - '570' department: - _id: JoCs doi: 10.15479/AT:ISTA:8563 file: - access_level: open_access checksum: a16098a6d172f9c42ab5af5f6991668c content_type: application/x-compressed creator: jozsef date_created: 2020-09-23T14:36:17Z date_updated: 2020-09-23T14:36:17Z file_id: '8564' file_name: upload.tgz file_size: 145243906 relation: main_file success: 1 - access_level: open_access checksum: 0bfc54b7e14c0694cd081617318ba606 content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document creator: jozsef date_created: 2020-10-19T10:12:29Z date_updated: 2020-10-19T10:12:29Z file_id: '8675' file_name: redme.docx file_size: 11648 relation: main_file success: 1 file_date_updated: 2020-10-19T10:12:29Z has_accepted_license: '1' month: '10' oa: 1 oa_version: Published Version publisher: Institute of Science and Technology Austria related_material: record: - id: '8740' relation: used_in_publication status: public status: public title: Optogenetic alteration of hippocampal network activity tmp: image: /images/cc_by_nc_nd.png legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0) short: CC BY-NC-ND (4.0) type: research_data user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2020' ... --- _id: '7262' abstract: - lang: eng text: Advances in shape-morphing materials, such as hydrogels, shape-memory polymers and light-responsive polymers have enabled prescribing self-directed deformations of initially flat geometries. However, most proposed solutions evolve towards a target geometry without considering time-dependent actuation paths. To achieve more complex geometries and avoid self-collisions, it is critical to encode a spatial and temporal shape evolution within the initially flat shell. Recent realizations of time-dependent morphing are limited to the actuation of few, discrete hinges and cannot form doubly curved surfaces. Here, we demonstrate a method for encoding temporal shape evolution in architected shells that assume complex shapes and doubly curved geometries. The shells are non-periodic tessellations of pre-stressed contractile unit cells that soften in water at rates prescribed locally by mesostructure geometry. The ensuing midplane contraction is coupled to the formation of encoded curvatures. We propose an inverse design tool based on a data-driven model for unit cells’ temporal responses. article_number: '237' article_processing_charge: No article_type: original author: - first_name: Ruslan full_name: Guseinov, Ruslan id: 3AB45EE2-F248-11E8-B48F-1D18A9856A87 last_name: Guseinov orcid: 0000-0001-9819-5077 - first_name: Connor full_name: McMahan, Connor last_name: McMahan - first_name: Jesus full_name: Perez Rodriguez, Jesus id: 2DC83906-F248-11E8-B48F-1D18A9856A87 last_name: Perez Rodriguez - first_name: Chiara full_name: Daraio, Chiara last_name: Daraio - first_name: Bernd full_name: Bickel, Bernd id: 49876194-F248-11E8-B48F-1D18A9856A87 last_name: Bickel orcid: 0000-0001-6511-9385 citation: ama: Guseinov R, McMahan C, Perez Rodriguez J, Daraio C, Bickel B. Programming temporal morphing of self-actuated shells. Nature Communications. 2020;11. doi:10.1038/s41467-019-14015-2 apa: Guseinov, R., McMahan, C., Perez Rodriguez, J., Daraio, C., & Bickel, B. (2020). Programming temporal morphing of self-actuated shells. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-019-14015-2 chicago: Guseinov, Ruslan, Connor McMahan, Jesus Perez Rodriguez, Chiara Daraio, and Bernd Bickel. “Programming Temporal Morphing of Self-Actuated Shells.” Nature Communications. Springer Nature, 2020. https://doi.org/10.1038/s41467-019-14015-2. ieee: R. Guseinov, C. McMahan, J. Perez Rodriguez, C. Daraio, and B. Bickel, “Programming temporal morphing of self-actuated shells,” Nature Communications, vol. 11. Springer Nature, 2020. ista: Guseinov R, McMahan C, Perez Rodriguez J, Daraio C, Bickel B. 2020. Programming temporal morphing of self-actuated shells. Nature Communications. 11, 237. mla: Guseinov, Ruslan, et al. “Programming Temporal Morphing of Self-Actuated Shells.” Nature Communications, vol. 11, 237, Springer Nature, 2020, doi:10.1038/s41467-019-14015-2. short: R. Guseinov, C. McMahan, J. Perez Rodriguez, C. Daraio, B. Bickel, Nature Communications 11 (2020). date_created: 2020-01-13T16:54:26Z date_published: 2020-01-13T00:00:00Z date_updated: 2024-02-21T12:45:02Z day: '13' ddc: - '000' department: - _id: BeBi doi: 10.1038/s41467-019-14015-2 ec_funded: 1 external_id: isi: - '000511916800015' file: - access_level: open_access checksum: 7db23fef2f4cda712f17f1004116ddff content_type: application/pdf creator: rguseino date_created: 2020-01-15T14:35:34Z date_updated: 2020-07-14T12:47:55Z file_id: '7336' file_name: 2020_NatureComm_Guseinov.pdf file_size: 1315270 relation: main_file file_date_updated: 2020-07-14T12:47:55Z has_accepted_license: '1' intvolume: ' 11' isi: 1 keyword: - Design - Synthesis and processing - Mechanical engineering - Polymers language: - iso: eng month: '01' oa: 1 oa_version: Published Version project: - _id: 260C2330-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '754411' name: ISTplus - Postdoctoral Fellowships - _id: 24F9549A-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '715767' name: 'MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling' publication: Nature Communications publication_identifier: issn: - 2041-1723 publication_status: published publisher: Springer Nature quality_controlled: '1' related_material: link: - description: News on IST Homepage relation: press_release url: https://ist.ac.at/en/news/geometry-meets-time/ record: - id: '8366' relation: dissertation_contains status: public - id: '7154' relation: research_data status: public scopus_import: '1' status: public title: Programming temporal morphing of self-actuated shells tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 11 year: '2020' ... --- _id: '14592' abstract: - lang: eng 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. article_processing_charge: No author: - first_name: Florian KM full_name: Schur, Florian KM id: 48AD8942-F248-11E8-B48F-1D18A9856A87 last_name: Schur orcid: 0000-0003-4790-8078 citation: 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 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 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. 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. 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. 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). contributor: - contributor_type: researcher first_name: Florian id: 404F5528-F248-11E8-B48F-1D18A9856A87 last_name: Fäßler orcid: 0000-0001-7149-769X - contributor_type: researcher first_name: Bettina id: 45FD126C-F248-11E8-B48F-1D18A9856A87 last_name: Zens - contributor_type: researcher first_name: Robert id: 4E01D6B4-F248-11E8-B48F-1D18A9856A87 last_name: Hauschild - contributor_type: researcher first_name: Florian KM id: 48AD8942-F248-11E8-B48F-1D18A9856A87 last_name: Schur orcid: 0000-0003-4790-8078 date_created: 2023-11-22T15:00:57Z date_published: 2020-12-01T00:00:00Z date_updated: 2024-02-21T12:44:48Z day: '01' ddc: - '570' department: - _id: FlSc doi: 10.15479/AT:ISTA:14592 file: - access_level: open_access checksum: 0108616e2a59e51879ea51299a29b091 content_type: application/zip creator: fschur date_created: 2023-11-22T14:58:44Z date_updated: 2023-11-22T14:58:44Z file_id: '14593' file_name: 3Dprint-files_download_v2.zip file_size: 49297 relation: main_file success: 1 - access_level: open_access checksum: 4c66ddedee4d01c1c4a7978208350cfc content_type: text/plain creator: cchlebak date_created: 2023-12-01T10:39:59Z date_updated: 2023-12-01T10:39:59Z file_id: '14637' file_name: readme.txt file_size: 641 relation: main_file success: 1 file_date_updated: 2023-12-01T10:39:59Z has_accepted_license: '1' license: https://creativecommons.org/licenses/by-nc-sa/4.0/ month: '12' oa: 1 oa_version: Published Version project: - _id: 9B954C5C-BA93-11EA-9121-9846C619BF3A grant_number: P33367 name: Structure and isoform diversity of the Arp2/3 complex publisher: Institute of Science and Technology Austria related_material: record: - id: '8586' relation: research_data status: public status: public 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 tmp: image: /images/cc_by_nc_sa.png legal_code_url: https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode name: Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0) short: CC BY-NC-SA (4.0) type: research_data user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2020' ... --- _id: '7213' abstract: - lang: eng 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. alternative_title: - SCI article_processing_charge: No author: - first_name: Sumit full_name: Bhatia, Sumit last_name: Bhatia - first_name: Bapi full_name: Chatterjee, Bapi id: 3C41A08A-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-2742-4028 - first_name: Deepak full_name: Nathani, Deepak last_name: Nathani - first_name: Manohar full_name: Kaul, Manohar last_name: Kaul citation: 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' 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' 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. 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.' 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. short: S. Bhatia, B. Chatterjee, D. Nathani, M. Kaul, in:, Complex Networks and Their Applications VIII, Springer Nature, 2020, pp. 27–39. conference: end_date: 2019-12-12 location: Lisbon, Portugal name: 'COMPLEX: International Conference on Complex Networks and their Applications' start_date: 2019-12-10 date_created: 2019-12-29T23:00:45Z date_published: 2020-01-01T00:00:00Z date_updated: 2024-02-22T13:16:06Z day: '01' ddc: - '004' department: - _id: DaAl doi: 10.1007/978-3-030-36687-2_3 ec_funded: 1 external_id: isi: - '000843927300003' file: - access_level: open_access checksum: 8951f094c8c7dae9ff8db885199bc296 content_type: application/pdf creator: bchatter date_created: 2020-10-08T08:16:48Z date_updated: 2020-10-08T08:16:48Z file_id: '8625' file_name: main.pdf file_size: 310598 relation: main_file success: 1 file_date_updated: 2020-10-08T08:16:48Z has_accepted_license: '1' intvolume: ' 881' isi: 1 language: - iso: eng month: '01' oa: 1 oa_version: Submitted Version page: 27-39 project: - _id: 260C2330-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '754411' name: ISTplus - Postdoctoral Fellowships publication: Complex Networks and their applications VIII publication_identifier: eissn: - '18609503' isbn: - '9783030366865' issn: - 1860949X publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: A persistent homology perspective to the link prediction problem type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 881 year: '2020' ... --- _id: '10556' abstract: - lang: eng 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:1751–1767. doi:10.1145/3372297.3423364' 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' 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. 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. 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.' mla: Kokoris Kogias, Eleftherios, et al. “Asynchronous Distributed Key Generation for Computationally-Secure Randomness, Consensus, and Threshold Signatures.” Proceedings 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. conference: end_date: 2020-11-13 location: Virtual, United States name: 'CCS: Computer and Communications Security' start_date: 2020-11-09 date_created: 2021-12-16T13:23:27Z date_published: 2020-10-30T00:00:00Z date_updated: 2024-02-22T13:10:45Z day: '30' department: - _id: ElKo doi: 10.1145/3372297.3423364 external_id: isi: - '000768470400104' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://eprint.iacr.org/2019/1015 month: '10' oa: 1 oa_version: Preprint page: 1751–1767 publication: Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security publication_identifier: isbn: - 978-1-4503-7089-9 publication_status: published publisher: Association for Computing Machinery quality_controlled: '1' scopus_import: '1' status: public title: Asynchronous distributed key generation for computationally-secure randomness, consensus, and threshold signatures type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 year: '2020' ... --- _id: '9202' 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. 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. article_processing_charge: No author: - first_name: Miriam full_name: Garcia Soto, Miriam id: 4B3207F6-F248-11E8-B48F-1D18A9856A87 last_name: Garcia Soto orcid: 0000-0003-2936-5719 - first_name: Pavithra full_name: Prabhakar, Pavithra last_name: Prabhakar citation: 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' 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' 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. 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. 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.' 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. conference: end_date: 2020-12-04 location: 'Houston, TX, USA ' name: 'RTTS: Real-Time Systems Symposium' start_date: 2020-12-01 date_created: 2021-02-26T16:38:24Z date_published: 2020-12-01T00:00:00Z date_updated: 2024-02-22T13:25:19Z day: '01' ddc: - '000' department: - _id: ToHe doi: 10.1109/RTSS49844.2020.00031 external_id: isi: - '000680435100021' file: - access_level: open_access checksum: 8f97f229316c3b3a6f0cf99297aa0941 content_type: application/pdf creator: mgarcias date_created: 2021-02-26T16:38:14Z date_updated: 2021-02-26T16:38:14Z file_id: '9203' file_name: main.pdf file_size: 1125794 relation: main_file file_date_updated: 2021-02-26T16:38:14Z has_accepted_license: '1' isi: 1 language: - iso: eng month: '12' oa: 1 oa_version: Submitted Version page: 244-256 project: - _id: 25F42A32-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z211 name: The Wittgenstein Prize publication: 2020 IEEE Real-Time Systems Symposium publication_identifier: eisbn: - '9781728183244' eissn: - 2576-3172 publication_status: published publisher: IEEE quality_controlled: '1' status: public title: Hybridization for stability verification of nonlinear switched systems type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 year: '2020' ... --- _id: '6906' 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. 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”." article_processing_charge: No article_type: original author: - first_name: Chiara full_name: Boccato, Chiara id: 342E7E22-F248-11E8-B48F-1D18A9856A87 last_name: Boccato - first_name: Christian full_name: Brennecke, Christian last_name: Brennecke - first_name: Serena full_name: Cenatiempo, Serena last_name: Cenatiempo - first_name: Benjamin full_name: Schlein, Benjamin last_name: Schlein citation: 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 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 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. 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. 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. short: C. Boccato, C. Brennecke, S. Cenatiempo, B. Schlein, Communications in Mathematical Physics 376 (2020) 1311–1395. date_created: 2019-09-24T17:30:59Z date_published: 2020-06-01T00:00:00Z date_updated: 2024-02-22T13:33:02Z day: '01' department: - _id: RoSe doi: 10.1007/s00220-019-03555-9 ec_funded: 1 external_id: arxiv: - '1812.03086' isi: - '000536053300012' intvolume: ' 376' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1812.03086 month: '06' oa: 1 oa_version: Preprint page: 1311-1395 project: - _id: 25C6DC12-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '694227' name: Analysis of quantum many-body systems publication: Communications in Mathematical Physics publication_identifier: eissn: - 1432-0916 issn: - 0010-3616 publication_status: published publisher: Springer quality_controlled: '1' scopus_import: '1' status: public title: Optimal rate for Bose-Einstein condensation in the Gross-Pitaevskii regime type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 376 year: '2020' ... --- _id: '6944' abstract: - lang: eng text: 'We study the problem of automatically detecting if a given multi-class classifier operates outside of its specifications (out-of-specs), i.e. on input data from a different distribution than what it was trained for. This is an important problem to solve on the road towards creating reliable computer vision systems for real-world applications, because the quality of a classifier’s predictions cannot be guaranteed if it operates out-of-specs. Previously proposed methods for out-of-specs detection make decisions on the level of single inputs. This, however, is insufficient to achieve low false positive rate and high false negative rates at the same time. In this work, we describe a new procedure named KS(conf), based on statistical reasoning. Its main component is a classical Kolmogorov–Smirnov test that is applied to the set of predicted confidence values for batches of samples. Working with batches instead of single samples allows increasing the true positive rate without negatively affecting the false positive rate, thereby overcoming a crucial limitation of single sample tests. We show by extensive experiments using a variety of convolutional network architectures and datasets that KS(conf) reliably detects out-of-specs situations even under conditions where other tests fail. It furthermore has a number of properties that make it an excellent candidate for practical deployment: it is easy to implement, adds almost no overhead to the system, works with any classifier that outputs confidence scores, and requires no a priori knowledge about how the data distribution could change.' article_processing_charge: Yes (via OA deal) article_type: original author: - first_name: Rémy full_name: Sun, Rémy last_name: Sun - first_name: Christoph full_name: Lampert, Christoph id: 40C20FD2-F248-11E8-B48F-1D18A9856A87 last_name: Lampert orcid: 0000-0001-8622-7887 citation: ama: 'Sun R, Lampert C. KS(conf): A light-weight test if a multiclass classifier operates outside of its specifications. International Journal of Computer Vision. 2020;128(4):970-995. doi:10.1007/s11263-019-01232-x' apa: 'Sun, R., & Lampert, C. (2020). KS(conf): A light-weight test if a multiclass classifier operates outside of its specifications. International Journal of Computer Vision. Springer Nature. https://doi.org/10.1007/s11263-019-01232-x' chicago: 'Sun, Rémy, and Christoph Lampert. “KS(Conf): A Light-Weight Test If a Multiclass Classifier Operates Outside of Its Specifications.” International Journal of Computer Vision. Springer Nature, 2020. https://doi.org/10.1007/s11263-019-01232-x.' ieee: 'R. Sun and C. Lampert, “KS(conf): A light-weight test if a multiclass classifier operates outside of its specifications,” International Journal of Computer Vision, vol. 128, no. 4. Springer Nature, pp. 970–995, 2020.' ista: 'Sun R, Lampert C. 2020. KS(conf): A light-weight test if a multiclass classifier operates outside of its specifications. International Journal of Computer Vision. 128(4), 970–995.' mla: 'Sun, Rémy, and Christoph Lampert. “KS(Conf): A Light-Weight Test If a Multiclass Classifier Operates Outside of Its Specifications.” International Journal of Computer Vision, vol. 128, no. 4, Springer Nature, 2020, pp. 970–95, doi:10.1007/s11263-019-01232-x.' short: R. Sun, C. Lampert, International Journal of Computer Vision 128 (2020) 970–995. date_created: 2019-10-14T09:14:28Z date_published: 2020-04-01T00:00:00Z date_updated: 2024-02-22T14:57:30Z day: '01' ddc: - '004' department: - _id: ChLa doi: 10.1007/s11263-019-01232-x ec_funded: 1 external_id: isi: - '000494406800001' file: - access_level: open_access checksum: 155e63edf664dcacb3bdc1c2223e606f content_type: application/pdf creator: dernst date_created: 2019-11-26T10:30:02Z date_updated: 2020-07-14T12:47:45Z file_id: '7110' file_name: 2019_IJCV_Sun.pdf file_size: 1715072 relation: main_file file_date_updated: 2020-07-14T12:47:45Z has_accepted_license: '1' intvolume: ' 128' isi: 1 issue: '4' language: - iso: eng month: '04' oa: 1 oa_version: Published Version page: 970-995 project: - _id: 2532554C-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '308036' name: Lifelong Learning of Visual Scene Understanding - _id: B67AFEDC-15C9-11EA-A837-991A96BB2854 name: IST Austria Open Access Fund publication: International Journal of Computer Vision publication_identifier: eissn: - 1573-1405 issn: - 0920-5691 publication_status: published publisher: Springer Nature quality_controlled: '1' related_material: link: - relation: erratum url: https://doi.org/10.1007/s11263-019-01262-5 record: - id: '6482' relation: earlier_version status: public scopus_import: '1' status: public title: 'KS(conf): A light-weight test if a multiclass classifier operates outside of its specifications' tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 128 year: '2020' ... --- _id: '8324' abstract: - lang: eng text: The notion of program sensitivity (aka Lipschitz continuity) specifies that changes in the program input result in proportional changes to the program output. For probabilistic programs the notion is naturally extended to expected sensitivity. A previous approach develops a relational program logic framework for proving expected sensitivity of probabilistic while loops, where the number of iterations is fixed and bounded. In this work, we consider probabilistic while loops where the number of iterations is not fixed, but randomized and depends on the initial input values. We present a sound approach for proving expected sensitivity of such programs. Our sound approach is martingale-based and can be automated through existing martingale-synthesis algorithms. Furthermore, our approach is compositional for sequential composition of while loops under a mild side condition. We demonstrate the effectiveness of our approach on several classical examples from Gambler's Ruin, stochastic hybrid systems and stochastic gradient descent. We also present experimental results showing that our automated approach can handle various probabilistic programs in the literature. acknowledgement: We thank anonymous reviewers for helpful comments, especially for pointing to us a scenario of piecewise-linear approximation (Remark5). The research was partially supported by the National Natural Science Foundation of China (NSFC) under Grant No. 61802254, 61672229, 61832015,61772336,11871221 and Austrian Science Fund (FWF) NFN under Grant No. S11407-N23 (RiSE/SHiNE). We thank Prof. Yuxi Fu, director of the BASICS Lab at Shanghai Jiao Tong University, for his support. article_number: '25' article_processing_charge: No author: - first_name: Peixin full_name: Wang, Peixin last_name: Wang - first_name: Hongfei full_name: Fu, Hongfei last_name: Fu - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Yuxin full_name: Deng, Yuxin last_name: Deng - first_name: Ming full_name: Xu, Ming last_name: Xu citation: ama: 'Wang P, Fu H, Chatterjee K, Deng Y, Xu M. Proving expected sensitivity of probabilistic programs with randomized variable-dependent termination time. In: Proceedings of the ACM on Programming Languages. Vol 4. ACM; 2020. doi:10.1145/3371093' apa: Wang, P., Fu, H., Chatterjee, K., Deng, Y., & Xu, M. (2020). Proving expected sensitivity of probabilistic programs with randomized variable-dependent termination time. In Proceedings of the ACM on Programming Languages (Vol. 4). ACM. https://doi.org/10.1145/3371093 chicago: Wang, Peixin, Hongfei Fu, Krishnendu Chatterjee, Yuxin Deng, and Ming Xu. “Proving Expected Sensitivity of Probabilistic Programs with Randomized Variable-Dependent Termination Time.” In Proceedings of the ACM on Programming Languages, Vol. 4. ACM, 2020. https://doi.org/10.1145/3371093. ieee: P. Wang, H. Fu, K. Chatterjee, Y. Deng, and M. Xu, “Proving expected sensitivity of probabilistic programs with randomized variable-dependent termination time,” in Proceedings of the ACM on Programming Languages, 2020, vol. 4, no. POPL. ista: Wang P, Fu H, Chatterjee K, Deng Y, Xu M. 2020. Proving expected sensitivity of probabilistic programs with randomized variable-dependent termination time. Proceedings of the ACM on Programming Languages. vol. 4, 25. mla: Wang, Peixin, et al. “Proving Expected Sensitivity of Probabilistic Programs with Randomized Variable-Dependent Termination Time.” Proceedings of the ACM on Programming Languages, vol. 4, no. POPL, 25, ACM, 2020, doi:10.1145/3371093. short: P. Wang, H. Fu, K. Chatterjee, Y. Deng, M. Xu, in:, Proceedings of the ACM on Programming Languages, ACM, 2020. date_created: 2020-08-30T22:01:12Z date_published: 2020-01-01T00:00:00Z date_updated: 2024-02-22T15:16:45Z day: '01' ddc: - '004' department: - _id: KrCh doi: 10.1145/3371093 external_id: arxiv: - '1902.04744' file: - access_level: open_access checksum: c6193d109ff4ecb17e7a6513d8eb34c0 content_type: application/pdf creator: cziletti date_created: 2020-09-01T11:12:58Z date_updated: 2020-09-01T11:12:58Z file_id: '8328' file_name: 2019_ACM_POPL_Wang.pdf file_size: 564151 relation: main_file success: 1 file_date_updated: 2020-09-01T11:12:58Z has_accepted_license: '1' intvolume: ' 4' issue: POPL language: - iso: eng month: '01' oa: 1 oa_version: Published Version project: - _id: 25863FF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11407 name: Game Theory publication: Proceedings of the ACM on Programming Languages publication_identifier: eissn: - 2475-1421 publication_status: published publisher: ACM quality_controlled: '1' related_material: link: - relation: software url: https://doi.org/10.5281/zenodo.3533633 scopus_import: '1' status: public title: Proving expected sensitivity of probabilistic programs with randomized variable-dependent termination time tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 4 year: '2020' ... --- _id: '6184' abstract: - lang: eng text: We prove edge universality for a general class of correlated real symmetric or complex Hermitian Wigner matrices with arbitrary expectation. Our theorem also applies to internal edges of the self-consistent density of states. In particular, we establish a strong form of band rigidity which excludes mismatches between location and label of eigenvalues close to internal edges in these general models. article_processing_charge: No article_type: original author: - first_name: Johannes full_name: Alt, Johannes id: 36D3D8B6-F248-11E8-B48F-1D18A9856A87 last_name: Alt - first_name: László full_name: Erdös, László id: 4DBD5372-F248-11E8-B48F-1D18A9856A87 last_name: Erdös orcid: 0000-0001-5366-9603 - first_name: Torben H full_name: Krüger, Torben H id: 3020C786-F248-11E8-B48F-1D18A9856A87 last_name: Krüger orcid: 0000-0002-4821-3297 - first_name: Dominik J full_name: Schröder, Dominik J id: 408ED176-F248-11E8-B48F-1D18A9856A87 last_name: Schröder orcid: 0000-0002-2904-1856 citation: ama: 'Alt J, Erdös L, Krüger TH, Schröder DJ. Correlated random matrices: Band rigidity and edge universality. Annals of Probability. 2020;48(2):963-1001. doi:10.1214/19-AOP1379' apa: 'Alt, J., Erdös, L., Krüger, T. H., & Schröder, D. J. (2020). Correlated random matrices: Band rigidity and edge universality. Annals of Probability. Institute of Mathematical Statistics. https://doi.org/10.1214/19-AOP1379' chicago: 'Alt, Johannes, László Erdös, Torben H Krüger, and Dominik J Schröder. “Correlated Random Matrices: Band Rigidity and Edge Universality.” Annals of Probability. Institute of Mathematical Statistics, 2020. https://doi.org/10.1214/19-AOP1379.' ieee: 'J. Alt, L. Erdös, T. H. Krüger, and D. J. Schröder, “Correlated random matrices: Band rigidity and edge universality,” Annals of Probability, vol. 48, no. 2. Institute of Mathematical Statistics, pp. 963–1001, 2020.' ista: 'Alt J, Erdös L, Krüger TH, Schröder DJ. 2020. Correlated random matrices: Band rigidity and edge universality. Annals of Probability. 48(2), 963–1001.' mla: 'Alt, Johannes, et al. “Correlated Random Matrices: Band Rigidity and Edge Universality.” Annals of Probability, vol. 48, no. 2, Institute of Mathematical Statistics, 2020, pp. 963–1001, doi:10.1214/19-AOP1379.' short: J. Alt, L. Erdös, T.H. Krüger, D.J. Schröder, Annals of Probability 48 (2020) 963–1001. date_created: 2019-03-28T09:20:08Z date_published: 2020-03-01T00:00:00Z date_updated: 2024-02-22T14:34:33Z day: '01' department: - _id: LaEr doi: 10.1214/19-AOP1379 ec_funded: 1 external_id: arxiv: - '1804.07744' isi: - '000528269100013' intvolume: ' 48' isi: 1 issue: '2' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1804.07744 month: '03' oa: 1 oa_version: Preprint page: 963-1001 project: - _id: 258DCDE6-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '338804' name: Random matrices, universality and disordered quantum systems publication: Annals of Probability publication_identifier: issn: - 0091-1798 publication_status: published publisher: Institute of Mathematical Statistics quality_controlled: '1' related_material: record: - id: '149' relation: dissertation_contains status: public - id: '6179' relation: dissertation_contains status: public scopus_import: '1' status: public title: 'Correlated random matrices: Band rigidity and edge universality' type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 48 year: '2020' ... --- _id: '15037' abstract: - lang: eng text: Protein abundance and localization at the plasma membrane (PM) shapes plant development and mediates adaptation to changing environmental conditions. It is regulated by ubiquitination, a post-translational modification crucial for the proper sorting of endocytosed PM proteins to the vacuole for subsequent degradation. To understand the significance and the variety of roles played by this reversible modification, the function of ubiquitin receptors, which translate the ubiquitin signature into a cellular response, needs to be elucidated. In this study, we show that TOL (TOM1-like) proteins function in plants as multivalent ubiquitin receptors, governing ubiquitinated cargo delivery to the vacuole via the conserved Endosomal Sorting Complex Required for Transport (ESCRT) pathway. TOL2 and TOL6 interact with components of the ESCRT machinery and bind to K63-linked ubiquitin via two tandemly arranged conserved ubiquitin-binding domains. Mutation of these domains results not only in a loss of ubiquitin binding but also altered localization, abolishing TOL6 ubiquitin receptor activity. Function and localization of TOL6 is itself regulated by ubiquitination, whereby TOL6 ubiquitination potentially modulates degradation of PM-localized cargoes, assisting in the fine-tuning of the delicate interplay between protein recycling and downregulation. Taken together, our findings demonstrate the function and regulation of a ubiquitin receptor that mediates vacuolar degradation of PM proteins in higher plants. article_processing_charge: No article_type: original author: - first_name: Jeanette full_name: Moulinier-Anzola, Jeanette last_name: Moulinier-Anzola - first_name: Maximilian full_name: Schwihla, Maximilian last_name: Schwihla - first_name: Lucinda full_name: De-Araújo, Lucinda last_name: De-Araújo - first_name: Christina full_name: Artner, Christina id: 45DF286A-F248-11E8-B48F-1D18A9856A87 last_name: Artner - first_name: Lisa full_name: Jörg, Lisa last_name: Jörg - first_name: Nataliia full_name: Konstantinova, Nataliia last_name: Konstantinova - first_name: Christian full_name: Luschnig, Christian last_name: Luschnig - first_name: Barbara full_name: Korbei, Barbara last_name: Korbei citation: ama: Moulinier-Anzola J, Schwihla M, De-Araújo L, et al. TOLs function as ubiquitin receptors in the early steps of the ESCRT pathway in higher plants. Molecular Plant. 2020;13(5):717-731. doi:10.1016/j.molp.2020.02.012 apa: Moulinier-Anzola, J., Schwihla, M., De-Araújo, L., Artner, C., Jörg, L., Konstantinova, N., … Korbei, B. (2020). TOLs function as ubiquitin receptors in the early steps of the ESCRT pathway in higher plants. Molecular Plant. Elsevier. https://doi.org/10.1016/j.molp.2020.02.012 chicago: Moulinier-Anzola, Jeanette, Maximilian Schwihla, Lucinda De-Araújo, Christina Artner, Lisa Jörg, Nataliia Konstantinova, Christian Luschnig, and Barbara Korbei. “TOLs Function as Ubiquitin Receptors in the Early Steps of the ESCRT Pathway in Higher Plants.” Molecular Plant. Elsevier, 2020. https://doi.org/10.1016/j.molp.2020.02.012. ieee: J. Moulinier-Anzola et al., “TOLs function as ubiquitin receptors in the early steps of the ESCRT pathway in higher plants,” Molecular Plant, vol. 13, no. 5. Elsevier, pp. 717–731, 2020. ista: Moulinier-Anzola J, Schwihla M, De-Araújo L, Artner C, Jörg L, Konstantinova N, Luschnig C, Korbei B. 2020. TOLs function as ubiquitin receptors in the early steps of the ESCRT pathway in higher plants. Molecular Plant. 13(5), 717–731. mla: Moulinier-Anzola, Jeanette, et al. “TOLs Function as Ubiquitin Receptors in the Early Steps of the ESCRT Pathway in Higher Plants.” Molecular Plant, vol. 13, no. 5, Elsevier, 2020, pp. 717–31, doi:10.1016/j.molp.2020.02.012. short: J. Moulinier-Anzola, M. Schwihla, L. De-Araújo, C. Artner, L. Jörg, N. Konstantinova, C. Luschnig, B. Korbei, Molecular Plant 13 (2020) 717–731. date_created: 2024-02-28T08:55:56Z date_published: 2020-05-04T00:00:00Z date_updated: 2024-02-28T12:41:52Z day: '04' ddc: - '580' department: - _id: EvBe doi: 10.1016/j.molp.2020.02.012 external_id: pmid: - '32087370' file: - access_level: open_access checksum: c538a5008f7827f62d17d40a3bfabe65 content_type: application/pdf creator: dernst date_created: 2024-02-28T12:39:56Z date_updated: 2024-02-28T12:39:56Z file_id: '15038' file_name: 2020_MolecularPlant_MoulinierAnzola.pdf file_size: 3089212 relation: main_file success: 1 file_date_updated: 2024-02-28T12:39:56Z has_accepted_license: '1' intvolume: ' 13' issue: '5' keyword: - Plant Science - Molecular Biology language: - iso: eng month: '05' oa: 1 oa_version: Published Version page: 717-731 pmid: 1 publication: Molecular Plant publication_identifier: issn: - 1674-2052 publication_status: published publisher: Elsevier quality_controlled: '1' status: public title: TOLs function as ubiquitin receptors in the early steps of the ESCRT pathway in higher plants tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 13 year: '2020' ... --- _id: '15036' abstract: - lang: eng text: The assembly of a septin filament requires that homologous monomers must distinguish between one another in establishing appropriate interfaces with their neighbors. To understand this phenomenon at the molecular level, we present the first four crystal structures of heterodimeric septin complexes. We describe in detail the two distinct types of G-interface present within the octameric particles, which must polymerize to form filaments. These are formed between SEPT2 and SEPT6 and between SEPT7 and SEPT3, and their description permits an understanding of the structural basis for the selectivity necessary for correct filament assembly. By replacing SEPT6 by SEPT8 or SEPT11, it is possible to rationalize Kinoshita's postulate, which predicts the exchangeability of septins from within a subgroup. Switches I and II, which in classical small GTPases provide a mechanism for nucleotide-dependent conformational change, have been repurposed in septins to play a fundamental role in molecular recognition. Specifically, it is switch I which holds the key to discriminating between the two different G-interfaces. Moreover, residues which are characteristic for a given subgroup play subtle, but pivotal, roles in guaranteeing that the correct interfaces are formed. article_processing_charge: No article_type: original author: - first_name: Higor Vinícius Dias full_name: Rosa, Higor Vinícius Dias last_name: Rosa - first_name: Diego Antonio full_name: Leonardo, Diego Antonio last_name: Leonardo - first_name: Gabriel full_name: Brognara, Gabriel id: D96FFDA0-A884-11E9-9968-DC26E6697425 last_name: Brognara - first_name: José full_name: Brandão-Neto, José last_name: Brandão-Neto - first_name: Humberto full_name: D'Muniz Pereira, Humberto last_name: D'Muniz Pereira - first_name: Ana Paula Ulian full_name: Araújo, Ana Paula Ulian last_name: Araújo - first_name: Richard Charles full_name: Garratt, Richard Charles last_name: Garratt citation: ama: 'Rosa HVD, Leonardo DA, Brognara G, et al. Molecular recognition at septin interfaces: The switches hold the key. Journal of Molecular Biology. 2020;432(21):5784-5801. doi:10.1016/j.jmb.2020.09.001' apa: 'Rosa, H. V. D., Leonardo, D. A., Brognara, G., Brandão-Neto, J., D’Muniz Pereira, H., Araújo, A. P. U., & Garratt, R. C. (2020). Molecular recognition at septin interfaces: The switches hold the key. Journal of Molecular Biology. Elsevier. https://doi.org/10.1016/j.jmb.2020.09.001' chicago: 'Rosa, Higor Vinícius Dias, Diego Antonio Leonardo, Gabriel Brognara, José Brandão-Neto, Humberto D’Muniz Pereira, Ana Paula Ulian Araújo, and Richard Charles Garratt. “Molecular Recognition at Septin Interfaces: The Switches Hold the Key.” Journal of Molecular Biology. Elsevier, 2020. https://doi.org/10.1016/j.jmb.2020.09.001.' ieee: 'H. V. D. Rosa et al., “Molecular recognition at septin interfaces: The switches hold the key,” Journal of Molecular Biology, vol. 432, no. 21. Elsevier, pp. 5784–5801, 2020.' ista: 'Rosa HVD, Leonardo DA, Brognara G, Brandão-Neto J, D’Muniz Pereira H, Araújo APU, Garratt RC. 2020. Molecular recognition at septin interfaces: The switches hold the key. Journal of Molecular Biology. 432(21), 5784–5801.' mla: 'Rosa, Higor Vinícius Dias, et al. “Molecular Recognition at Septin Interfaces: The Switches Hold the Key.” Journal of Molecular Biology, vol. 432, no. 21, Elsevier, 2020, pp. 5784–801, doi:10.1016/j.jmb.2020.09.001.' short: H.V.D. Rosa, D.A. Leonardo, G. Brognara, J. Brandão-Neto, H. D’Muniz Pereira, A.P.U. Araújo, R.C. Garratt, Journal of Molecular Biology 432 (2020) 5784–5801. date_created: 2024-02-28T08:50:34Z date_published: 2020-10-02T00:00:00Z date_updated: 2024-02-28T12:37:54Z day: '02' department: - _id: MaLo doi: 10.1016/j.jmb.2020.09.001 external_id: pmid: - '32910969' intvolume: ' 432' issue: '21' keyword: - Molecular Biology - Structural Biology language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1016/j.jmb.2020.09.001 month: '10' oa: 1 oa_version: Published Version page: 5784-5801 pmid: 1 publication: Journal of Molecular Biology publication_identifier: issn: - 0022-2836 publication_status: published publisher: Elsevier quality_controlled: '1' status: public title: 'Molecular recognition at septin interfaces: The switches hold the key' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 432 year: '2020' ... --- _id: '8384' 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. acknowledged_ssus: - _id: ScienComp 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." article_number: '31' article_processing_charge: No article_type: original author: - first_name: Sadashige full_name: Ishida, Sadashige id: 6F7C4B96-A8E9-11E9-A7CA-09ECE5697425 last_name: Ishida - first_name: Peter full_name: Synak, Peter id: 331776E2-F248-11E8-B48F-1D18A9856A87 last_name: Synak - first_name: Fumiya full_name: Narita, Fumiya last_name: Narita - first_name: Toshiya full_name: Hachisuka, Toshiya last_name: Hachisuka - first_name: Christopher J full_name: Wojtan, Christopher J id: 3C61F1D2-F248-11E8-B48F-1D18A9856A87 last_name: Wojtan orcid: 0000-0001-6646-5546 citation: ama: Ishida S, Synak P, Narita F, Hachisuka T, Wojtan C. A model for soap film dynamics with evolving thickness. ACM Transactions on Graphics. 2020;39(4). doi:10.1145/3386569.3392405 apa: Ishida, S., Synak, P., Narita, F., Hachisuka, T., & Wojtan, C. (2020). A model for soap film dynamics with evolving thickness. ACM Transactions on Graphics. Association for Computing Machinery. https://doi.org/10.1145/3386569.3392405 chicago: Ishida, Sadashige, Peter Synak, Fumiya Narita, Toshiya Hachisuka, and Chris Wojtan. “A Model for Soap Film Dynamics with Evolving Thickness.” ACM Transactions on Graphics. Association for Computing Machinery, 2020. https://doi.org/10.1145/3386569.3392405. ieee: S. Ishida, P. Synak, F. Narita, T. Hachisuka, and C. Wojtan, “A model for soap film dynamics with evolving thickness,” ACM Transactions on Graphics, vol. 39, no. 4. Association for Computing Machinery, 2020. 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. mla: Ishida, Sadashige, et al. “A Model for Soap Film Dynamics with Evolving Thickness.” ACM Transactions on Graphics, vol. 39, no. 4, 31, Association for Computing Machinery, 2020, doi:10.1145/3386569.3392405. short: S. Ishida, P. Synak, F. Narita, T. Hachisuka, C. Wojtan, ACM Transactions on Graphics 39 (2020). date_created: 2020-09-13T22:01:18Z date_published: 2020-07-08T00:00:00Z date_updated: 2024-02-28T12:57:31Z day: '08' ddc: - '000' department: - _id: ChWo doi: 10.1145/3386569.3392405 ec_funded: 1 external_id: isi: - '000583700300004' file: - access_level: open_access checksum: 813831ca91319d794d9748c276b24578 content_type: application/pdf creator: dernst date_created: 2020-11-23T09:03:19Z date_updated: 2020-11-23T09:03:19Z file_id: '8795' file_name: 2020_soapfilm_submitted.pdf file_size: 14935529 relation: main_file success: 1 file_date_updated: 2020-11-23T09:03:19Z has_accepted_license: '1' intvolume: ' 39' isi: 1 issue: '4' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1145/3386569.3392405 month: '07' oa: 1 oa_version: Submitted Version project: - _id: 2533E772-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '638176' name: Efficient Simulation of Natural Phenomena at Extremely Large Scales publication: ACM Transactions on Graphics publication_identifier: eissn: - '15577368' issn: - '07300301' publication_status: published publisher: Association for Computing Machinery quality_controlled: '1' scopus_import: '1' status: public title: A model for soap film dynamics with evolving thickness type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 39 year: '2020' ... --- _id: '7802' abstract: - lang: eng text: "The Massively Parallel Computation (MPC) model is an emerging model which distills core aspects of distributed and parallel computation. It has been developed as a tool to solve (typically graph) problems in systems where the input is distributed over many machines with limited space.\r\n\t\r\nRecent work has focused on the regime in which machines have sublinear (in $n$, the number of nodes in the input graph) space, with randomized algorithms presented for fundamental graph problems of Maximal Matching and Maximal Independent Set. However, there have been no prior corresponding deterministic algorithms.\r\n\t\r\n\tA major challenge underlying the sublinear space setting is that the local space of each machine might be too small to store all the edges incident to a single node. This poses a considerable obstacle compared to the classical models in which each node is assumed to know and have easy access to its incident edges. To overcome this barrier we introduce a new graph sparsification technique that deterministically computes a low-degree subgraph with additional desired properties. The degree of the nodes in this subgraph is small in the sense that the edges of each node can be now stored on a single machine. This low-degree subgraph also has the property that solving the problem on this subgraph provides \\emph{significant} global progress, i.e., progress towards solving the problem for the original input graph.\r\n\t\r\nUsing this framework to derandomize the well-known randomized algorithm of Luby [SICOMP'86], we obtain $O(\\log \\Delta+\\log\\log n)$-round deterministic MPC algorithms for solving the fundamental problems of Maximal Matching and Maximal Independent Set with $O(n^{\\epsilon})$ space on each machine for any constant $\\epsilon > 0$. Based on the recent work of Ghaffari et al. [FOCS'18], this additive $O(\\log\\log n)$ factor is conditionally essential. These algorithms can also be shown to run in $O(\\log \\Delta)$ rounds in the closely related model of CONGESTED CLIQUE, improving upon the state-of-the-art bound of $O(\\log^2 \\Delta)$ rounds by Censor-Hillel et al. [DISC'17]." article_processing_charge: No author: - first_name: Artur full_name: Czumaj, Artur last_name: Czumaj orcid: 0000-0002-5646-9524 - first_name: Peter full_name: Davies, Peter id: 11396234-BB50-11E9-B24C-90FCE5697425 last_name: Davies orcid: 0000-0002-5646-9524 - first_name: Merav full_name: Parter, Merav last_name: Parter citation: ama: 'Czumaj A, Davies P, Parter M. Graph sparsification for derandomizing massively parallel computation with low space. In: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2020). Association for Computing Machinery; 2020:175-185. doi:10.1145/3350755.3400282' apa: 'Czumaj, A., Davies, P., & Parter, M. (2020). Graph sparsification for derandomizing massively parallel computation with low space. In Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2020) (pp. 175–185). Virtual Event, United States: Association for Computing Machinery. https://doi.org/10.1145/3350755.3400282' chicago: Czumaj, Artur, Peter Davies, and Merav Parter. “Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space.” In Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2020), 175–85. Association for Computing Machinery, 2020. https://doi.org/10.1145/3350755.3400282. ieee: A. Czumaj, P. Davies, and M. Parter, “Graph sparsification for derandomizing massively parallel computation with low space,” in Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2020), Virtual Event, United States, 2020, no. 7, pp. 175–185. ista: 'Czumaj A, Davies P, Parter M. 2020. Graph sparsification for derandomizing massively parallel computation with low space. Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2020). SPAA: Symposium on Parallelism in Algorithms and Architectures, 175–185.' mla: Czumaj, Artur, et al. “Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space.” Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2020), no. 7, Association for Computing Machinery, 2020, pp. 175–85, doi:10.1145/3350755.3400282. short: A. Czumaj, P. Davies, M. Parter, in:, Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2020), Association for Computing Machinery, 2020, pp. 175–185. conference: end_date: 2020-07-17 location: Virtual Event, United States name: 'SPAA: Symposium on Parallelism in Algorithms and Architectures' start_date: 2020-07-15 date_created: 2020-05-06T08:53:34Z date_published: 2020-07-01T00:00:00Z date_updated: 2024-02-28T12:53:09Z day: '01' department: - _id: DaAl doi: 10.1145/3350755.3400282 ec_funded: 1 external_id: arxiv: - '1912.05390' isi: - '000744436200015' isi: 1 issue: '7' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1912.05390 month: '07' oa: 1 oa_version: Preprint page: 175-185 project: - _id: 260C2330-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '754411' name: ISTplus - Postdoctoral Fellowships publication: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2020) publication_status: published publisher: Association for Computing Machinery quality_controlled: '1' related_material: record: - id: '9541' relation: later_version status: public scopus_import: '1' status: public title: Graph sparsification for derandomizing massively parallel computation with low space type: conference user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 year: '2020' ... --- _id: '7636' abstract: - lang: eng text: "Balanced search trees typically use key comparisons to guide their operations, and achieve logarithmic running time. By relying on numerical properties of the keys, interpolation search achieves lower search complexity and better performance. Although interpolation-based data structures were investigated in the past, their non-blocking concurrent variants have received very little attention so far.\r\nIn this paper, we propose the first non-blocking implementation of the classic interpolation search tree (IST) data structure. For arbitrary key distributions, the data structure ensures worst-case O(log n + p) amortized time for search, insertion and deletion traversals. When the input key distributions are smooth, lookups run in expected O(log log n + p) time, and insertion and deletion run in expected amortized O(log log n + p) time, where p is a bound on the number of threads. To improve the scalability of concurrent insertion and deletion, we propose a novel parallel rebuilding technique, which should be of independent interest.\r\nWe evaluate whether the theoretical improvements translate to practice by implementing the concurrent interpolation search tree, and benchmarking it on uniform and nonuniform key distributions, for dataset sizes in the millions to billions of keys. Relative to the state-of-the-art concurrent data structures, the concurrent interpolation search tree achieves performance improvements of up to 15% under high update rates, and of up to 50% under moderate update rates. Further, ISTs exhibit up to 2X less cache-misses, and consume 1.2 -- 2.6X less memory compared to the next best alternative on typical dataset sizes. We find that the results are surprisingly robust to distributional skew, which suggests that our data structure can be a promising alternative to classic concurrent search structures." acknowledgement: "This project has received funding from the European Research Council (ERC) under the European Union Horizon 2020 research and innovation program, grant agreement No 805223, ERC Starting Grant ScaleML. We acknowledge the support of the Natural Sciences and\r\nEngineering Research Council of Canada (NSERC). " article_processing_charge: No author: - first_name: Trevor A full_name: Brown, Trevor A id: 3569F0A0-F248-11E8-B48F-1D18A9856A87 last_name: Brown - first_name: Aleksandar full_name: Prokopec, Aleksandar last_name: Prokopec - first_name: Dan-Adrian full_name: Alistarh, Dan-Adrian id: 4A899BFC-F248-11E8-B48F-1D18A9856A87 last_name: Alistarh orcid: 0000-0003-3650-940X citation: ama: 'Brown TA, Prokopec A, Alistarh D-A. Non-blocking interpolation search trees with doubly-logarithmic running time. In: Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. Association for Computing Machinery; 2020:276-291. doi:10.1145/3332466.3374542' apa: 'Brown, T. A., Prokopec, A., & Alistarh, D.-A. (2020). Non-blocking interpolation search trees with doubly-logarithmic running time. In Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (pp. 276–291). San Diego, CA, United States: Association for Computing Machinery. https://doi.org/10.1145/3332466.3374542' chicago: Brown, Trevor A, Aleksandar Prokopec, and Dan-Adrian Alistarh. “Non-Blocking Interpolation Search Trees with Doubly-Logarithmic Running Time.” In Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 276–91. Association for Computing Machinery, 2020. https://doi.org/10.1145/3332466.3374542. ieee: T. A. Brown, A. Prokopec, and D.-A. Alistarh, “Non-blocking interpolation search trees with doubly-logarithmic running time,” in Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, San Diego, CA, United States, 2020, pp. 276–291. ista: 'Brown TA, Prokopec A, Alistarh D-A. 2020. Non-blocking interpolation search trees with doubly-logarithmic running time. Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. PPOPP: Principles and Practice of Parallel Programming, 276–291.' mla: Brown, Trevor A., et al. “Non-Blocking Interpolation Search Trees with Doubly-Logarithmic Running Time.” Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Association for Computing Machinery, 2020, pp. 276–91, doi:10.1145/3332466.3374542. short: T.A. Brown, A. Prokopec, D.-A. Alistarh, in:, Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Association for Computing Machinery, 2020, pp. 276–291. conference: end_date: 2020-02-26 location: San Diego, CA, United States name: 'PPOPP: Principles and Practice of Parallel Programming' start_date: 2020-02-22 date_created: 2020-04-05T22:00:49Z date_published: 2020-02-19T00:00:00Z date_updated: 2024-02-28T12:55:14Z day: '19' department: - _id: DaAl doi: 10.1145/3332466.3374542 ec_funded: 1 external_id: isi: - '000564476500020' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1145/3332466.3374542 month: '02' oa: 1 oa_version: Published Version page: 276-291 project: - _id: 268A44D6-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '805223' name: Elastic Coordination for Scalable Machine Learning publication: Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming publication_identifier: isbn: - '9781450368186' publication_status: published publisher: Association for Computing Machinery quality_controlled: '1' scopus_import: '1' status: public title: Non-blocking interpolation search trees with doubly-logarithmic running time type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2020' ... --- _id: '8385' 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.' acknowledged_ssus: - _id: ScienComp 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_number: '48' article_processing_charge: No article_type: original author: - first_name: Georg full_name: Sperl, Georg id: 4DD40360-F248-11E8-B48F-1D18A9856A87 last_name: Sperl - first_name: Rahul full_name: Narain, Rahul last_name: Narain - first_name: Christopher J full_name: Wojtan, Christopher J id: 3C61F1D2-F248-11E8-B48F-1D18A9856A87 last_name: Wojtan orcid: 0000-0001-6646-5546 citation: ama: Sperl G, Narain R, Wojtan C. Homogenized yarn-level cloth. ACM Transactions on Graphics. 2020;39(4). doi:10.1145/3386569.3392412 apa: Sperl, G., Narain, R., & Wojtan, C. (2020). Homogenized yarn-level cloth. ACM Transactions on Graphics. Association for Computing Machinery. https://doi.org/10.1145/3386569.3392412 chicago: Sperl, Georg, Rahul Narain, and Chris Wojtan. “Homogenized Yarn-Level Cloth.” ACM Transactions on Graphics. Association for Computing Machinery, 2020. https://doi.org/10.1145/3386569.3392412. ieee: G. Sperl, R. Narain, and C. Wojtan, “Homogenized yarn-level cloth,” ACM Transactions on Graphics, 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. mla: Sperl, Georg, et al. “Homogenized Yarn-Level Cloth.” ACM Transactions on Graphics, vol. 39, no. 4, 48, Association for Computing Machinery, 2020, doi:10.1145/3386569.3392412. short: G. Sperl, R. Narain, C. Wojtan, ACM Transactions on Graphics 39 (2020). date_created: 2020-09-13T22:01:18Z date_published: 2020-07-08T00:00:00Z date_updated: 2024-02-28T12:57:47Z day: '08' ddc: - '000' department: - _id: ChWo doi: 10.1145/3386569.3392412 ec_funded: 1 external_id: isi: - '000583700300021' file: - access_level: open_access checksum: cf4c1d361c3196c4bd424520a5588205 content_type: application/pdf creator: dernst date_created: 2020-11-23T09:01:22Z date_updated: 2020-11-23T09:01:22Z file_id: '8794' file_name: 2020_hylc_submitted.pdf file_size: 38922662 relation: main_file success: 1 file_date_updated: 2020-11-23T09:01:22Z has_accepted_license: '1' intvolume: ' 39' isi: 1 issue: '4' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1145/3386569.3392412 month: '07' oa: 1 oa_version: Submitted Version project: - _id: 2533E772-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '638176' name: Efficient Simulation of Natural Phenomena at Extremely Large Scales publication: ACM Transactions on Graphics publication_identifier: eissn: - '15577368' issn: - '07300301' publication_status: published publisher: Association for Computing Machinery quality_controlled: '1' related_material: record: - id: '12358' relation: dissertation_contains status: public scopus_import: '1' status: public title: Homogenized yarn-level cloth type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 39 year: '2020' ... --- _id: '7956' abstract: - lang: eng text: When short-range attractions are combined with long-range repulsions in colloidal particle systems, complex microphases can emerge. Here, we study a system of isotropic particles, which can form lamellar structures or a disordered fluid phase when temperature is varied. We show that, at equilibrium, the lamellar structure crystallizes, while out of equilibrium, the system forms a variety of structures at different shear rates and temperatures above melting. The shear-induced ordering is analyzed by means of principal component analysis and artificial neural networks, which are applied to data of reduced dimensionality. Our results reveal the possibility of inducing ordering by shear, potentially providing a feasible route to the fabrication of ordered lamellar structures from isotropic particles. article_number: '204905' article_processing_charge: No article_type: original author: - first_name: J. full_name: Pȩkalski, J. last_name: Pȩkalski - first_name: Wojciech full_name: Rzadkowski, Wojciech id: 48C55298-F248-11E8-B48F-1D18A9856A87 last_name: Rzadkowski orcid: 0000-0002-1106-4419 - first_name: A. Z. full_name: Panagiotopoulos, A. Z. last_name: Panagiotopoulos citation: ama: 'Pȩkalski J, Rzadkowski W, Panagiotopoulos AZ. Shear-induced ordering in systems with competing interactions: A machine learning study. The Journal of chemical physics. 2020;152(20). doi:10.1063/5.0005194' apa: 'Pȩkalski, J., Rzadkowski, W., & Panagiotopoulos, A. Z. (2020). Shear-induced ordering in systems with competing interactions: A machine learning study. The Journal of Chemical Physics. AIP Publishing. https://doi.org/10.1063/5.0005194' chicago: 'Pȩkalski, J., Wojciech Rzadkowski, and A. Z. Panagiotopoulos. “Shear-Induced Ordering in Systems with Competing Interactions: A Machine Learning Study.” The Journal of Chemical Physics. AIP Publishing, 2020. https://doi.org/10.1063/5.0005194.' ieee: 'J. Pȩkalski, W. Rzadkowski, and A. Z. Panagiotopoulos, “Shear-induced ordering in systems with competing interactions: A machine learning study,” The Journal of chemical physics, vol. 152, no. 20. AIP Publishing, 2020.' ista: 'Pȩkalski J, Rzadkowski W, Panagiotopoulos AZ. 2020. Shear-induced ordering in systems with competing interactions: A machine learning study. The Journal of chemical physics. 152(20), 204905.' mla: 'Pȩkalski, J., et al. “Shear-Induced Ordering in Systems with Competing Interactions: A Machine Learning Study.” The Journal of Chemical Physics, vol. 152, no. 20, 204905, AIP Publishing, 2020, doi:10.1063/5.0005194.' short: J. Pȩkalski, W. Rzadkowski, A.Z. Panagiotopoulos, The Journal of Chemical Physics 152 (2020). date_created: 2020-06-14T22:00:49Z date_published: 2020-05-29T00:00:00Z date_updated: 2024-02-28T13:00:28Z day: '29' department: - _id: MiLe doi: 10.1063/5.0005194 ec_funded: 1 external_id: arxiv: - '2002.07294' isi: - '000537900300001' intvolume: ' 152' isi: 1 issue: '20' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1063/5.0005194 month: '05' oa: 1 oa_version: Published Version project: - _id: 2564DBCA-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '665385' name: International IST Doctoral Program publication: The Journal of chemical physics publication_identifier: eissn: - '10897690' publication_status: published publisher: AIP Publishing quality_controlled: '1' related_material: record: - id: '10759' relation: dissertation_contains status: public scopus_import: '1' status: public title: 'Shear-induced ordering in systems with competing interactions: A machine learning study' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 152 year: '2020' ... --- _id: '8382' abstract: - lang: eng text: We present the first deterministic wait-free long-lived snapshot algorithm, using only read and write operations, that guarantees polylogarithmic amortized step complexity in all executions. This is the first non-blocking snapshot algorithm, using reads and writes only, that has sub-linear amortized step complexity in executions of arbitrary length. The key to our construction is a novel implementation of a 2-component max array object which may be of independent interest. article_processing_charge: No author: - first_name: Mirza Ahad full_name: Baig, Mirza Ahad id: 3EDE6DE4-AA5A-11E9-986D-341CE6697425 last_name: Baig - first_name: Danny full_name: Hendler, Danny last_name: Hendler - first_name: Alessia full_name: Milani, Alessia last_name: Milani - first_name: Corentin full_name: Travers, Corentin last_name: Travers citation: ama: 'Baig MA, Hendler D, Milani A, Travers C. Long-lived snapshots with polylogarithmic amortized step complexity. In: Proceedings of the 39th Symposium on Principles of Distributed Computing. Association for Computing Machinery; 2020:31-40. doi:10.1145/3382734.3406005' apa: 'Baig, M. A., Hendler, D., Milani, A., & Travers, C. (2020). Long-lived snapshots with polylogarithmic amortized step complexity. In Proceedings of the 39th Symposium on Principles of Distributed Computing (pp. 31–40). Virtual, Italy: Association for Computing Machinery. https://doi.org/10.1145/3382734.3406005' chicago: Baig, Mirza Ahad, Danny Hendler, Alessia Milani, and Corentin Travers. “Long-Lived Snapshots with Polylogarithmic Amortized Step Complexity.” In Proceedings of the 39th Symposium on Principles of Distributed Computing, 31–40. Association for Computing Machinery, 2020. https://doi.org/10.1145/3382734.3406005. ieee: M. A. Baig, D. Hendler, A. Milani, and C. Travers, “Long-lived snapshots with polylogarithmic amortized step complexity,” in Proceedings of the 39th Symposium on Principles of Distributed Computing, Virtual, Italy, 2020, pp. 31–40. ista: 'Baig MA, Hendler D, Milani A, Travers C. 2020. Long-lived snapshots with polylogarithmic amortized step complexity. Proceedings of the 39th Symposium on Principles of Distributed Computing. PODC: Principles of Distributed Computing, 31–40.' mla: Baig, Mirza Ahad, et al. “Long-Lived Snapshots with Polylogarithmic Amortized Step Complexity.” Proceedings of the 39th Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2020, pp. 31–40, doi:10.1145/3382734.3406005. short: M.A. Baig, D. Hendler, A. Milani, C. Travers, in:, Proceedings of the 39th Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2020, pp. 31–40. conference: end_date: 2020-08-07 location: Virtual, Italy name: 'PODC: Principles of Distributed Computing' start_date: 2020-08-03 date_created: 2020-09-13T22:01:17Z date_published: 2020-07-31T00:00:00Z date_updated: 2024-02-28T12:54:30Z day: '31' doi: 10.1145/3382734.3406005 language: - iso: eng main_file_link: - open_access: '1' url: https://hal.archives-ouvertes.fr/hal-02860087/document month: '07' oa: 1 oa_version: Preprint page: 31-40 publication: Proceedings of the 39th Symposium on Principles of Distributed Computing publication_identifier: isbn: - '9781450375825' publication_status: published publisher: Association for Computing Machinery quality_controlled: '1' scopus_import: '1' status: public title: Long-lived snapshots with polylogarithmic amortized step complexity type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2020' ... --- _id: '7428' abstract: - lang: eng text: In the superconducting regime of FeTe(1−x)Sex, there exist two types of vortices which are distinguished by the presence or absence of zero-energy states in their core. To understand their origin, we examine the interplay of Zeeman coupling and superconducting pairings in three-dimensional metals with band inversion. Weak Zeeman fields are found to suppress intraorbital spin-singlet pairing, known to localize the states at the ends of the vortices on the surface. On the other hand, an orbital-triplet pairing is shown to be stable against Zeeman interactions, but leads to delocalized zero-energy Majorana modes which extend through the vortex. In contrast, the finite-energy vortex modes remain localized at the vortex ends even when the pairing is of orbital-triplet form. Phenomenologically, this manifests as an observed disappearance of zero-bias peaks within the cores of topological vortices upon an increase of the applied magnetic field. The presence of magnetic impurities in FeTe(1−x)Sex, which are attracted to the vortices, would lead to such Zeeman-induced delocalization of Majorana modes in a fraction of vortices that capture a large enough number of magnetic impurities. Our results provide an explanation for the dichotomy between topological and nontopological vortices recently observed in FeTe(1−x)Sex. article_number: '020504' article_processing_charge: No article_type: original author: - first_name: Areg full_name: Ghazaryan, Areg id: 4AF46FD6-F248-11E8-B48F-1D18A9856A87 last_name: Ghazaryan orcid: 0000-0001-9666-3543 - first_name: P. L.S. full_name: Lopes, P. L.S. last_name: Lopes - first_name: Pavan full_name: Hosur, Pavan last_name: Hosur - first_name: Matthew J. full_name: Gilbert, Matthew J. last_name: Gilbert - first_name: Pouyan full_name: Ghaemi, Pouyan last_name: Ghaemi citation: ama: Ghazaryan A, Lopes PLS, Hosur P, Gilbert MJ, Ghaemi P. Effect of Zeeman coupling on the Majorana vortex modes in iron-based topological superconductors. Physical Review B. 2020;101(2). doi:10.1103/PhysRevB.101.020504 apa: Ghazaryan, A., Lopes, P. L. S., Hosur, P., Gilbert, M. J., & Ghaemi, P. (2020). Effect of Zeeman coupling on the Majorana vortex modes in iron-based topological superconductors. Physical Review B. American Physical Society. https://doi.org/10.1103/PhysRevB.101.020504 chicago: Ghazaryan, Areg, P. L.S. Lopes, Pavan Hosur, Matthew J. Gilbert, and Pouyan Ghaemi. “Effect of Zeeman Coupling on the Majorana Vortex Modes in Iron-Based Topological Superconductors.” Physical Review B. American Physical Society, 2020. https://doi.org/10.1103/PhysRevB.101.020504. ieee: A. Ghazaryan, P. L. S. Lopes, P. Hosur, M. J. Gilbert, and P. Ghaemi, “Effect of Zeeman coupling on the Majorana vortex modes in iron-based topological superconductors,” Physical Review B, vol. 101, no. 2. American Physical Society, 2020. ista: Ghazaryan A, Lopes PLS, Hosur P, Gilbert MJ, Ghaemi P. 2020. Effect of Zeeman coupling on the Majorana vortex modes in iron-based topological superconductors. Physical Review B. 101(2), 020504. mla: Ghazaryan, Areg, et al. “Effect of Zeeman Coupling on the Majorana Vortex Modes in Iron-Based Topological Superconductors.” Physical Review B, vol. 101, no. 2, 020504, American Physical Society, 2020, doi:10.1103/PhysRevB.101.020504. short: A. Ghazaryan, P.L.S. Lopes, P. Hosur, M.J. Gilbert, P. Ghaemi, Physical Review B 101 (2020). date_created: 2020-02-02T23:01:01Z date_published: 2020-01-13T00:00:00Z date_updated: 2024-02-28T13:11:13Z day: '13' department: - _id: MiLe doi: 10.1103/PhysRevB.101.020504 external_id: arxiv: - '1907.02077' isi: - '000506843500001' intvolume: ' 101' isi: 1 issue: '2' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1907.02077 month: '01' oa: 1 oa_version: Preprint publication: Physical Review B publication_identifier: eissn: - '24699969' issn: - '24699950' publication_status: published publisher: American Physical Society quality_controlled: '1' scopus_import: '1' status: public title: Effect of Zeeman coupling on the Majorana vortex modes in iron-based topological superconductors type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 101 year: '2020' ...