[{"file":[{"access_level":"open_access","file_name":"2020_PlosCompBio_Grah.pdf","creator":"dernst","content_type":"application/pdf","file_size":2209325,"file_id":"7579","relation":"main_file","checksum":"5239dd134dc6e1c71fe7b3ce2953da37","date_created":"2020-03-09T15:12:21Z","date_updated":"2020-07-14T12:48:00Z"}],"oa_version":"Published Version","intvolume":" 16","title":"The relation between crosstalk and gene regulation form revisited","status":"public","ddc":["000","570"],"_id":"7569","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","issue":"2","abstract":[{"text":"Genes differ in the frequency at which they are expressed and in the form of regulation used to control their activity. In particular, positive or negative regulation can lead to activation of a gene in response to an external signal. Previous works proposed that the form of regulation of a gene correlates with its frequency of usage: positive regulation when the gene is frequently expressed and negative regulation when infrequently expressed. Such network design means that, in the absence of their regulators, the genes are found in their least required activity state, hence regulatory intervention is often necessary. Due to the multitude of genes and regulators, spurious binding and unbinding events, called “crosstalk”, could occur. To determine how the form of regulation affects the global crosstalk in the network, we used a mathematical model that includes multiple regulators and multiple target genes. We found that crosstalk depends non-monotonically on the availability of regulators. Our analysis showed that excess use of regulation entailed by the formerly suggested network design caused high crosstalk levels in a large part of the parameter space. We therefore considered the opposite ‘idle’ design, where the default unregulated state of genes is their frequently required activity state. We found, that ‘idle’ design minimized the use of regulation and thus minimized crosstalk. In addition, we estimated global crosstalk of S. cerevisiae using transcription factors binding data. We demonstrated that even partial network data could suffice to estimate its global crosstalk, suggesting its applicability to additional organisms. We found that S. cerevisiae estimated crosstalk is lower than that of a random network, suggesting that natural selection reduces crosstalk. In summary, our study highlights a new type of protein production cost which is typically overlooked: that of regulatory interference caused by the presence of excess regulators in the cell. It demonstrates the importance of whole-network descriptions, which could show effects missed by single-gene models.","lang":"eng"}],"type":"journal_article","date_published":"2020-02-25T00:00:00Z","article_type":"original","citation":{"chicago":"Grah, Rok, and Tamar Friedlander. “The Relation between Crosstalk and Gene Regulation Form Revisited.” PLOS Computational Biology. Public Library of Science, 2020. https://doi.org/10.1371/journal.pcbi.1007642.","short":"R. Grah, T. Friedlander, PLOS Computational Biology 16 (2020).","mla":"Grah, Rok, and Tamar Friedlander. “The Relation between Crosstalk and Gene Regulation Form Revisited.” PLOS Computational Biology, vol. 16, no. 2, e1007642, Public Library of Science, 2020, doi:10.1371/journal.pcbi.1007642.","ieee":"R. Grah and T. Friedlander, “The relation between crosstalk and gene regulation form revisited,” PLOS Computational Biology, vol. 16, no. 2. Public Library of Science, 2020.","apa":"Grah, R., & Friedlander, T. (2020). The relation between crosstalk and gene regulation form revisited. PLOS Computational Biology. Public Library of Science. https://doi.org/10.1371/journal.pcbi.1007642","ista":"Grah R, Friedlander T. 2020. The relation between crosstalk and gene regulation form revisited. PLOS Computational Biology. 16(2), e1007642.","ama":"Grah R, Friedlander T. The relation between crosstalk and gene regulation form revisited. PLOS Computational Biology. 2020;16(2). doi:10.1371/journal.pcbi.1007642"},"publication":"PLOS Computational Biology","article_processing_charge":"No","has_accepted_license":"1","day":"25","scopus_import":"1","volume":16,"date_updated":"2023-09-12T11:02:24Z","date_created":"2020-03-06T07:39:38Z","related_material":{"record":[{"relation":"research_data","status":"deleted","id":"9716"},{"id":"9776","status":"public","relation":"research_data"},{"relation":"used_in_publication","status":"public","id":"9779"},{"relation":"dissertation_contains","status":"public","id":"8155"},{"relation":"research_data","status":"public","id":"9777"}]},"author":[{"full_name":"Grah, Rok","last_name":"Grah","first_name":"Rok","orcid":"0000-0003-2539-3560","id":"483E70DE-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Friedlander","first_name":"Tamar","full_name":"Friedlander, Tamar"}],"department":[{"_id":"CaGu"},{"_id":"GaTk"}],"publisher":"Public Library of Science","publication_status":"published","year":"2020","file_date_updated":"2020-07-14T12:48:00Z","article_number":"e1007642","language":[{"iso":"eng"}],"doi":"10.1371/journal.pcbi.1007642","quality_controlled":"1","isi":1,"external_id":{"isi":["000526725200019"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"publication_identifier":{"issn":["1553-7358"]},"month":"02"},{"publisher":"Cold Spring Harbor Laboratory","department":[{"_id":"SiHi"}],"publication_status":"submitted","status":"public","title":"Novel imprints in mouse blastocysts are predominantly DNA methylation independent","pmid":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"8813","year":"2020","oa_version":"Preprint","date_updated":"2023-09-12T11:05:28Z","date_created":"2020-11-26T07:17:19Z","author":[{"full_name":"Santini, Laura","first_name":"Laura","last_name":"Santini"},{"first_name":"Florian","last_name":"Halbritter","full_name":"Halbritter, Florian"},{"last_name":"Titz-Teixeira","first_name":"Fabian","full_name":"Titz-Teixeira, Fabian"},{"full_name":"Suzuki, Toru","last_name":"Suzuki","first_name":"Toru"},{"last_name":"Asami","first_name":"Maki","full_name":"Asami, Maki"},{"full_name":"Ramesmayer, Julia","last_name":"Ramesmayer","first_name":"Julia"},{"first_name":"Xiaoyan","last_name":"Ma","full_name":"Ma, Xiaoyan"},{"full_name":"Lackner, Andreas","first_name":"Andreas","last_name":"Lackner"},{"full_name":"Warr, Nick","last_name":"Warr","first_name":"Nick"},{"full_name":"Pauler, Florian","first_name":"Florian","last_name":"Pauler","id":"48EA0138-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7462-0048"},{"id":"37B36620-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2279-1061","first_name":"Simon","last_name":"Hippenmeyer","full_name":"Hippenmeyer, Simon"},{"full_name":"Laue, Ernest","first_name":"Ernest","last_name":"Laue"},{"full_name":"Farlik, Matthias","first_name":"Matthias","last_name":"Farlik"},{"last_name":"Bock","first_name":"Christoph","full_name":"Bock, Christoph"},{"last_name":"Beyer","first_name":"Andreas","full_name":"Beyer, Andreas"},{"full_name":"Perry, Anthony C. F.","first_name":"Anthony C. F.","last_name":"Perry"},{"last_name":"Leeb","first_name":"Martin","full_name":"Leeb, Martin"}],"type":"preprint","abstract":[{"text":"In mammals, chromatin marks at imprinted genes are asymmetrically inherited to control parentally-biased gene expression. This control is thought predominantly to involve parent-specific differentially methylated regions (DMR) in genomic DNA. However, neither parent-of-origin-specific transcription nor DMRs have been comprehensively mapped. We here address this by integrating transcriptomic and epigenomic approaches in mouse preimplantation embryos (blastocysts). Transcriptome-analysis identified 71 genes expressed with previously unknown parent-of-origin-specific expression in blastocysts (nBiX: novel blastocyst-imprinted expression). Uniparental expression of nBiX genes disappeared soon after implantation. Micro-whole-genome bisulfite sequencing (μWGBS) of individual uniparental blastocysts detected 859 DMRs. Only 18% of nBiXs were associated with a DMR, whereas 60% were associated with parentally-biased H3K27me3. This suggests a major role for Polycomb-mediated imprinting in blastocysts. Five nBiX-clusters contained at least one known imprinted gene, and five novel clusters contained exclusively nBiX-genes. These data suggest a complex program of stage-specific imprinting involving different tiers of regulation.","lang":"eng"}],"citation":{"ama":"Santini L, Halbritter F, Titz-Teixeira F, et al. Novel imprints in mouse blastocysts are predominantly DNA methylation independent. bioRxiv. doi:10.1101/2020.11.03.366948","ista":"Santini L, Halbritter F, Titz-Teixeira F, Suzuki T, Asami M, Ramesmayer J, Ma X, Lackner A, Warr N, Pauler F, Hippenmeyer S, Laue E, Farlik M, Bock C, Beyer A, Perry ACF, Leeb M. Novel imprints in mouse blastocysts are predominantly DNA methylation independent. bioRxiv, 10.1101/2020.11.03.366948.","apa":"Santini, L., Halbritter, F., Titz-Teixeira, F., Suzuki, T., Asami, M., Ramesmayer, J., … Leeb, M. (n.d.). Novel imprints in mouse blastocysts are predominantly DNA methylation independent. bioRxiv. Cold Spring Harbor Laboratory. https://doi.org/10.1101/2020.11.03.366948","ieee":"L. Santini et al., “Novel imprints in mouse blastocysts are predominantly DNA methylation independent,” bioRxiv. Cold Spring Harbor Laboratory.","mla":"Santini, Laura, et al. “Novel Imprints in Mouse Blastocysts Are Predominantly DNA Methylation Independent.” BioRxiv, Cold Spring Harbor Laboratory, doi:10.1101/2020.11.03.366948.","short":"L. Santini, F. Halbritter, F. Titz-Teixeira, T. Suzuki, M. Asami, J. Ramesmayer, X. Ma, A. Lackner, N. Warr, F. Pauler, S. Hippenmeyer, E. Laue, M. Farlik, C. Bock, A. Beyer, A.C.F. Perry, M. Leeb, BioRxiv (n.d.).","chicago":"Santini, Laura, Florian Halbritter, Fabian Titz-Teixeira, Toru Suzuki, Maki Asami, Julia Ramesmayer, Xiaoyan Ma, et al. “Novel Imprints in Mouse Blastocysts Are Predominantly DNA Methylation Independent.” BioRxiv. Cold Spring Harbor Laboratory, n.d. https://doi.org/10.1101/2020.11.03.366948."},"main_file_link":[{"url":"https://doi.org/10.1101/2020.11.03.366948","open_access":"1"}],"external_id":{"pmid":["PPR234457 "]},"oa":1,"publication":"bioRxiv","language":[{"iso":"eng"}],"doi":"10.1101/2020.11.03.366948","date_published":"2020-11-05T00:00:00Z","article_processing_charge":"No","month":"11","day":"05"},{"_id":"9777","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2020","title":"Maximizing crosstalk","status":"public","publisher":"Public Library of Science","department":[{"_id":"GaTk"}],"author":[{"full_name":"Grah, Rok","last_name":"Grah","first_name":"Rok","orcid":"0000-0003-2539-3560","id":"483E70DE-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Friedlander, Tamar","first_name":"Tamar","last_name":"Friedlander"}],"related_material":{"record":[{"relation":"used_in_publication","status":"public","id":"7569"}]},"date_created":"2021-08-06T07:21:51Z","date_updated":"2023-09-12T11:02:25Z","oa_version":"None","type":"research_data_reference","citation":{"ama":"Grah R, Friedlander T. Maximizing crosstalk. 2020. doi:10.1371/journal.pcbi.1007642.s002","ieee":"R. Grah and T. Friedlander, “Maximizing crosstalk.” Public Library of Science, 2020.","apa":"Grah, R., & Friedlander, T. (2020). Maximizing crosstalk. Public Library of Science. https://doi.org/10.1371/journal.pcbi.1007642.s002","ista":"Grah R, Friedlander T. 2020. Maximizing crosstalk, Public Library of Science, 10.1371/journal.pcbi.1007642.s002.","short":"R. Grah, T. Friedlander, (2020).","mla":"Grah, Rok, and Tamar Friedlander. Maximizing Crosstalk. Public Library of Science, 2020, doi:10.1371/journal.pcbi.1007642.s002.","chicago":"Grah, Rok, and Tamar Friedlander. “Maximizing Crosstalk.” Public Library of Science, 2020. https://doi.org/10.1371/journal.pcbi.1007642.s002."},"oa":1,"main_file_link":[{"url":"https://doi.org/10.1371/journal.pcbi.1007642.s002","open_access":"1"}],"date_published":"2020-02-25T00:00:00Z","doi":"10.1371/journal.pcbi.1007642.s002","day":"25","month":"02","article_processing_charge":"No"},{"file_date_updated":"2020-09-04T13:00:17Z","date_created":"2020-09-04T12:24:12Z","date_updated":"2023-09-13T08:45:08Z","author":[{"full_name":"Kragl, Bernhard","id":"320FC952-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7745-9117","first_name":"Bernhard","last_name":"Kragl"}],"related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"133"},{"id":"8012","relation":"part_of_dissertation","status":"public"},{"relation":"part_of_dissertation","status":"public","id":"8195"},{"id":"160","status":"public","relation":"part_of_dissertation"}]},"publication_status":"published","department":[{"_id":"ToHe"}],"publisher":"Institute of Science and Technology Austria","year":"2020","month":"09","publication_identifier":{"issn":["2663-337X"]},"degree_awarded":"PhD","supervisor":[{"orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A"}],"language":[{"iso":"eng"}],"doi":"10.15479/AT:ISTA:8332","oa":1,"abstract":[{"text":"Designing and verifying concurrent programs is a notoriously challenging, time consuming, and error prone task, even for experts. This is due to the sheer number of possible interleavings of a concurrent program, all of which have to be tracked and accounted for in a formal proof. Inventing an inductive invariant that captures all interleavings of a low-level implementation is theoretically possible, but practically intractable. We develop a refinement-based verification framework that provides mechanisms to simplify proof construction by decomposing the verification task into smaller subtasks.\r\n\r\nIn a first line of work, we present a foundation for refinement reasoning over structured concurrent programs. We introduce layered concurrent programs as a compact notation to represent multi-layer refinement proofs. A layered concurrent program specifies a sequence of connected concurrent programs, from most concrete to most abstract, such that common parts of different programs are written exactly once. Each program in this sequence is expressed as structured concurrent program, i.e., a program over (potentially recursive) procedures, imperative control flow, gated atomic actions, structured parallelism, and asynchronous concurrency. This is in contrast to existing refinement-based verifiers, which represent concurrent systems as flat transition relations. We present a powerful refinement proof rule that decomposes refinement checking over structured programs into modular verification conditions. Refinement checking is supported by a new form of modular, parameterized invariants, called yield invariants, and a linear permission system to enhance local reasoning.\r\n\r\nIn a second line of work, we present two new reduction-based program transformations that target asynchronous programs. These transformations reduce the number of interleavings that need to be considered, thus reducing the complexity of invariants. Synchronization simplifies the verification of asynchronous programs by introducing the fiction, for proof purposes, that asynchronous operations complete synchronously. Synchronization summarizes an asynchronous computation as immediate atomic effect. Inductive sequentialization establishes sequential reductions that captures every behavior of the original program up to reordering of coarse-grained commutative actions. A sequential reduction of a concurrent program is easy to reason about since it corresponds to a simple execution of the program in an idealized synchronous environment, where processes act in a fixed order and at the same speed.\r\n\r\nOur approach is implemented the CIVL verifier, which has been successfully used for the verification of several complex concurrent programs. In our methodology, the overall correctness of a program is established piecemeal by focusing on the invariant required for each refinement step separately. While the programmer does the creative work of specifying the chain of programs and the inductive invariant justifying each link in the chain, the tool automatically constructs the verification conditions underlying each refinement step.","lang":"eng"}],"alternative_title":["ISTA Thesis"],"type":"dissertation","oa_version":"Published Version","file":[{"checksum":"26fe261550f691280bda4c454bf015c7","date_created":"2020-09-04T12:17:47Z","date_updated":"2020-09-04T12:17:47Z","relation":"main_file","file_id":"8333","content_type":"application/pdf","file_size":1348815,"creator":"bkragl","access_level":"open_access","file_name":"kragl-thesis.pdf"},{"creator":"bkragl","content_type":"application/zip","file_size":372312,"access_level":"closed","file_name":"kragl-thesis.zip","checksum":"b9694ce092b7c55557122adba8337ebc","date_created":"2020-09-04T13:00:17Z","date_updated":"2020-09-04T13:00:17Z","file_id":"8335","relation":"source_file"}],"ddc":["000"],"status":"public","title":"Verifying concurrent programs: Refinement, synchronization, sequentialization","_id":"8332","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","day":"03","article_processing_charge":"No","has_accepted_license":"1","date_published":"2020-09-03T00:00:00Z","page":"120","citation":{"apa":"Kragl, B. (2020). Verifying concurrent programs: Refinement, synchronization, sequentialization. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:8332","ieee":"B. Kragl, “Verifying concurrent programs: Refinement, synchronization, sequentialization,” Institute of Science and Technology Austria, 2020.","ista":"Kragl B. 2020. Verifying concurrent programs: Refinement, synchronization, sequentialization. Institute of Science and Technology Austria.","ama":"Kragl B. Verifying concurrent programs: Refinement, synchronization, sequentialization. 2020. doi:10.15479/AT:ISTA:8332","chicago":"Kragl, Bernhard. “Verifying Concurrent Programs: Refinement, Synchronization, Sequentialization.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:8332.","short":"B. Kragl, Verifying Concurrent Programs: Refinement, Synchronization, Sequentialization, Institute of Science and Technology Austria, 2020.","mla":"Kragl, Bernhard. Verifying Concurrent Programs: Refinement, Synchronization, Sequentialization. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:8332."}},{"abstract":[{"text":"Learning object-centric representations of complex scenes is a promising step towards enabling efficient abstract reasoning from low-level perceptual features. Yet, most deep learning approaches learn distributed representations that do not capture the compositional properties of natural scenes. In this paper, we present the Slot Attention module, an architectural component that interfaces with perceptual representations such as the output of a convolutional neural network and produces a set of task-dependent abstract representations which we call slots. These slots are exchangeable and can bind to any object in the input by specializing through a competitive procedure over multiple rounds of attention. We empirically demonstrate that Slot Attention can extract object-centric representations that enable generalization to unseen compositions when trained on unsupervised object discovery and supervised property prediction tasks.\r\n\r\n","lang":"eng"}],"extern":"1","type":"conference","author":[{"id":"26cfd52f-2483-11ee-8040-88983bcc06d4","orcid":"0000-0002-4850-0683","first_name":"Francesco","last_name":"Locatello","full_name":"Locatello, Francesco"},{"full_name":"Weissenborn, Dirk","first_name":"Dirk","last_name":"Weissenborn"},{"full_name":"Unterthiner, Thomas","last_name":"Unterthiner","first_name":"Thomas"},{"full_name":"Mahendran, Aravindh","last_name":"Mahendran","first_name":"Aravindh"},{"full_name":"Heigold, Georg","last_name":"Heigold","first_name":"Georg"},{"full_name":"Uszkoreit, Jakob","last_name":"Uszkoreit","first_name":"Jakob"},{"last_name":"Dosovitskiy","first_name":"Alexey","full_name":"Dosovitskiy, Alexey"},{"last_name":"Kipf","first_name":"Thomas","full_name":"Kipf, Thomas"}],"volume":33,"oa_version":"Preprint","date_created":"2023-09-13T12:03:46Z","date_updated":"2023-09-13T12:19:19Z","_id":"14326","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2020","publisher":"Curran Associates","department":[{"_id":"FrLo"}],"intvolume":" 33","title":"Object-centric learning with slot attention","status":"public","publication_status":"published","publication_identifier":{"isbn":["9781713829546"]},"article_processing_charge":"No","date_published":"2020-01-01T00:00:00Z","conference":{"end_date":"2020-12-12","start_date":"2020-12-06","location":"Virtual","name":"NeurIPS: Neural Information Processing Systems"},"language":[{"iso":"eng"}],"external_id":{"arxiv":["2006.15055"]},"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2006.15055","open_access":"1"}],"citation":{"short":"F. Locatello, D. Weissenborn, T. Unterthiner, A. Mahendran, G. Heigold, J. Uszkoreit, A. Dosovitskiy, T. Kipf, in:, Advances in Neural Information Processing Systems, Curran Associates, 2020, pp. 11525–11538.","mla":"Locatello, Francesco, et al. “Object-Centric Learning with Slot Attention.” Advances in Neural Information Processing Systems, vol. 33, Curran Associates, 2020, pp. 11525–38.","chicago":"Locatello, Francesco, Dirk Weissenborn, Thomas Unterthiner, Aravindh Mahendran, Georg Heigold, Jakob Uszkoreit, Alexey Dosovitskiy, and Thomas Kipf. “Object-Centric Learning with Slot Attention.” In Advances in Neural Information Processing Systems, 33:11525–38. Curran Associates, 2020.","ama":"Locatello F, Weissenborn D, Unterthiner T, et al. Object-centric learning with slot attention. In: Advances in Neural Information Processing Systems. Vol 33. Curran Associates; 2020:11525-11538.","ieee":"F. Locatello et al., “Object-centric learning with slot attention,” in Advances in Neural Information Processing Systems, Virtual, 2020, vol. 33, pp. 11525–11538.","apa":"Locatello, F., Weissenborn, D., Unterthiner, T., Mahendran, A., Heigold, G., Uszkoreit, J., … Kipf, T. (2020). Object-centric learning with slot attention. In Advances in Neural Information Processing Systems (Vol. 33, pp. 11525–11538). Virtual: Curran Associates.","ista":"Locatello F, Weissenborn D, Unterthiner T, Mahendran A, Heigold G, Uszkoreit J, Dosovitskiy A, Kipf T. 2020. Object-centric learning with slot attention. Advances in Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems vol. 33, 11525–11538."},"oa":1,"publication":"Advances in Neural Information Processing Systems","page":"11525-11538","quality_controlled":"1"},{"issue":"3","abstract":[{"lang":"eng","text":"We consider dynamical transport metrics for probability measures on discretisations of a bounded convex domain in ℝd. These metrics are natural discrete counterparts to the Kantorovich metric 𝕎2, defined using a Benamou-Brenier type formula. Under mild assumptions we prove an asymptotic upper bound for the discrete transport metric Wt in terms of 𝕎2, as the size of the mesh T tends to 0. However, we show that the corresponding lower bound may fail in general, even on certain one-dimensional and symmetric two-dimensional meshes. In addition, we show that the asymptotic lower bound holds under an isotropy assumption on the mesh, which turns out to be essentially necessary. This assumption is satisfied, e.g., for tilings by convex regular polygons, and it implies Gromov-Hausdorff convergence of the transport metric."}],"type":"journal_article","oa_version":"Preprint","intvolume":" 52","title":"Scaling limits of discrete optimal transport","status":"public","_id":"71","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","day":"01","scopus_import":"1","date_published":"2020-10-01T00:00:00Z","page":"2759-2802","article_type":"original","citation":{"short":"P. Gladbach, E. Kopfer, J. Maas, SIAM Journal on Mathematical Analysis 52 (2020) 2759–2802.","mla":"Gladbach, Peter, et al. “Scaling Limits of Discrete Optimal Transport.” SIAM Journal on Mathematical Analysis, vol. 52, no. 3, Society for Industrial and Applied Mathematics, 2020, pp. 2759–802, doi:10.1137/19M1243440.","chicago":"Gladbach, Peter, Eva Kopfer, and Jan Maas. “Scaling Limits of Discrete Optimal Transport.” SIAM Journal on Mathematical Analysis. Society for Industrial and Applied Mathematics, 2020. https://doi.org/10.1137/19M1243440.","ama":"Gladbach P, Kopfer E, Maas J. Scaling limits of discrete optimal transport. SIAM Journal on Mathematical Analysis. 2020;52(3):2759-2802. doi:10.1137/19M1243440","ieee":"P. Gladbach, E. Kopfer, and J. Maas, “Scaling limits of discrete optimal transport,” SIAM Journal on Mathematical Analysis, vol. 52, no. 3. Society for Industrial and Applied Mathematics, pp. 2759–2802, 2020.","apa":"Gladbach, P., Kopfer, E., & Maas, J. (2020). Scaling limits of discrete optimal transport. SIAM Journal on Mathematical Analysis. Society for Industrial and Applied Mathematics. https://doi.org/10.1137/19M1243440","ista":"Gladbach P, Kopfer E, Maas J. 2020. Scaling limits of discrete optimal transport. SIAM Journal on Mathematical Analysis. 52(3), 2759–2802."},"publication":"SIAM Journal on Mathematical Analysis","publist_id":"7983","volume":52,"date_created":"2018-12-11T11:44:28Z","date_updated":"2023-09-18T08:13:15Z","author":[{"first_name":"Peter","last_name":"Gladbach","full_name":"Gladbach, Peter"},{"last_name":"Kopfer","first_name":"Eva","full_name":"Kopfer, Eva"},{"full_name":"Maas, Jan","first_name":"Jan","last_name":"Maas","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0845-1338"}],"publisher":"Society for Industrial and Applied Mathematics","department":[{"_id":"JaMa"}],"publication_status":"published","year":"2020","publication_identifier":{"eissn":["10957154"],"issn":["00361410"]},"month":"10","language":[{"iso":"eng"}],"doi":"10.1137/19M1243440","isi":1,"quality_controlled":"1","main_file_link":[{"url":"https://arxiv.org/abs/1809.01092","open_access":"1"}],"external_id":{"arxiv":["1809.01092"],"isi":["000546975100017"]},"oa":1},{"month":"06","publication_identifier":{"issn":["10772626"],"eissn":["19410506"]},"quality_controlled":"1","isi":1,"oa":1,"external_id":{"isi":["000532295600014"],"pmid":["30507534"]},"acknowledged_ssus":[{"_id":"ScienComp"}],"language":[{"iso":"eng"}],"doi":"10.1109/TVCG.2018.2883628","file_date_updated":"2020-10-08T08:34:53Z","publication_status":"published","department":[{"_id":"ChWo"}],"publisher":"IEEE","acknowledgement":"This work was partially supported by JSPS Grant-in-Aid forYoung Scientists (Start-up) 16H07410, the ERC StartingGrantsrealFlow(StG-2015-637014) andBigSplash(StG-2014-638176). This research was supported by the Scientific Ser-vice Units (SSU) of IST Austria through resources providedby Scientific Computing. We would like to express my grati-tude to Nobuyuki Umetani and Tomas Skrivan for insight-ful discussion.","year":"2020","pmid":1,"date_updated":"2023-09-18T09:30:01Z","date_created":"2018-12-16T22:59:21Z","volume":26,"author":[{"full_name":"Hikaru, Ibayashi","first_name":"Ibayashi","last_name":"Hikaru"},{"full_name":"Wojtan, Christopher J","first_name":"Christopher J","last_name":"Wojtan","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6646-5546"},{"last_name":"Thuerey","first_name":"Nils","full_name":"Thuerey, Nils"},{"full_name":"Igarashi, Takeo","first_name":"Takeo","last_name":"Igarashi"},{"full_name":"Ando, Ryoichi","last_name":"Ando","first_name":"Ryoichi"}],"scopus_import":"1","day":"01","article_processing_charge":"No","has_accepted_license":"1","article_type":"original","page":"2288-2302","publication":"IEEE Transactions on Visualization and Computer Graphics","citation":{"chicago":"Hikaru, Ibayashi, Chris Wojtan, Nils Thuerey, Takeo Igarashi, and Ryoichi Ando. “Simulating Liquids on Dynamically Warping Grids.” IEEE Transactions on Visualization and Computer Graphics. IEEE, 2020. https://doi.org/10.1109/TVCG.2018.2883628.","short":"I. Hikaru, C. Wojtan, N. Thuerey, T. Igarashi, R. Ando, IEEE Transactions on Visualization and Computer Graphics 26 (2020) 2288–2302.","mla":"Hikaru, Ibayashi, et al. “Simulating Liquids on Dynamically Warping Grids.” IEEE Transactions on Visualization and Computer Graphics, vol. 26, no. 6, IEEE, 2020, pp. 2288–302, doi:10.1109/TVCG.2018.2883628.","apa":"Hikaru, I., Wojtan, C., Thuerey, N., Igarashi, T., & Ando, R. (2020). Simulating liquids on dynamically warping grids. IEEE Transactions on Visualization and Computer Graphics. IEEE. https://doi.org/10.1109/TVCG.2018.2883628","ieee":"I. Hikaru, C. Wojtan, N. Thuerey, T. Igarashi, and R. Ando, “Simulating liquids on dynamically warping grids,” IEEE Transactions on Visualization and Computer Graphics, vol. 26, no. 6. IEEE, pp. 2288–2302, 2020.","ista":"Hikaru I, Wojtan C, Thuerey N, Igarashi T, Ando R. 2020. Simulating liquids on dynamically warping grids. IEEE Transactions on Visualization and Computer Graphics. 26(6), 2288–2302.","ama":"Hikaru I, Wojtan C, Thuerey N, Igarashi T, Ando R. Simulating liquids on dynamically warping grids. IEEE Transactions on Visualization and Computer Graphics. 2020;26(6):2288-2302. doi:10.1109/TVCG.2018.2883628"},"date_published":"2020-06-01T00:00:00Z","type":"journal_article","abstract":[{"lang":"eng","text":"We introduce dynamically warping grids for adaptive liquid simulation. Our primary contributions are a strategy for dynamically deforming regular grids over the course of a simulation and a method for efficiently utilizing these deforming grids for liquid simulation. Prior work has shown that unstructured grids are very effective for adaptive fluid simulations. However, unstructured grids often lead to complicated implementations and a poor cache hit rate due to inconsistent memory access. Regular grids, on the other hand, provide a fast, fixed memory access pattern and straightforward implementation. Our method combines the advantages of both: we leverage the simplicity of regular grids while still achieving practical and controllable spatial adaptivity. We demonstrate that our method enables adaptive simulations that are fast, flexible, and robust to null-space issues. At the same time, our method is simple to implement and takes advantage of existing highly-tuned algorithms."}],"issue":"6","status":"public","title":"Simulating liquids on dynamically warping grids","ddc":["006"],"intvolume":" 26","_id":"5681","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa_version":"Submitted Version","file":[{"file_id":"8626","relation":"main_file","date_created":"2020-10-08T08:34:53Z","date_updated":"2020-10-08T08:34:53Z","success":1,"checksum":"8d4c55443a0ee335bb5bb652de503042","file_name":"preprint.pdf","access_level":"open_access","creator":"wojtan","content_type":"application/pdf","file_size":21910098}]},{"month":"12","publication_identifier":{"issn":["2663-337X"]},"doi":"10.15479/AT:ISTA:8958","degree_awarded":"PhD","supervisor":[{"first_name":"Mikhail","last_name":"Lemeshko","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6990-7802","full_name":"Lemeshko, Mikhail"}],"language":[{"iso":"eng"}],"oa":1,"project":[{"_id":"26031614-B435-11E9-9278-68D0E5697425","grant_number":"P29902","name":"Quantum rotations in the presence of a many-body environment","call_identifier":"FWF"},{"_id":"2688CF98-B435-11E9-9278-68D0E5697425","grant_number":"801770","call_identifier":"H2020","name":"Angulon: physics and applications of a new quasiparticle"}],"file_date_updated":"2020-12-30T07:18:03Z","ec_funded":1,"author":[{"id":"4B7E523C-F248-11E8-B48F-1D18A9856A87","last_name":"Li","first_name":"Xiang","full_name":"Li, Xiang"}],"related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"5886"},{"status":"public","relation":"part_of_dissertation","id":"8587"},{"status":"public","relation":"part_of_dissertation","id":"1120"}]},"date_created":"2020-12-21T09:44:30Z","date_updated":"2023-09-20T11:30:58Z","year":"2020","publication_status":"published","publisher":"Institute of Science and Technology Austria","department":[{"_id":"MiLe"}],"day":"21","has_accepted_license":"1","article_processing_charge":"No","date_published":"2020-12-21T00:00:00Z","citation":{"short":"X. Li, Rotation of Coupled Cold Molecules in the Presence of a Many-Body Environment, Institute of Science and Technology Austria, 2020.","mla":"Li, Xiang. Rotation of Coupled Cold Molecules in the Presence of a Many-Body Environment. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:8958.","chicago":"Li, Xiang. “Rotation of Coupled Cold Molecules in the Presence of a Many-Body Environment.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:8958.","ama":"Li X. Rotation of coupled cold molecules in the presence of a many-body environment. 2020. doi:10.15479/AT:ISTA:8958","ieee":"X. Li, “Rotation of coupled cold molecules in the presence of a many-body environment,” Institute of Science and Technology Austria, 2020.","apa":"Li, X. (2020). Rotation of coupled cold molecules in the presence of a many-body environment. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:8958","ista":"Li X. 2020. Rotation of coupled cold molecules in the presence of a many-body environment. Institute of Science and Technology Austria."},"page":"125","abstract":[{"text":"The oft-quoted dictum by Arthur Schawlow: ``A diatomic molecule has one atom too many'' has been disavowed. Inspired by the possibility to experimentally manipulate and enhance chemical reactivity in helium nanodroplets, we investigate the rotation of coupled cold molecules in the presence of a many-body environment.\r\nIn this thesis, we introduce new variational approaches to quantum impurities and apply them to the Fröhlich polaron - a quasiparticle formed out of an electron (or other point-like impurity) in a polar medium, and to the angulon - a quasiparticle formed out of a rotating molecule in a bosonic bath.\r\nWith this theoretical toolbox, we reveal the self-localization transition for the angulon quasiparticle. We show that, unlike for polarons, self-localization of angulons occurs at finite impurity-bath coupling already at the mean-field level. The transition is accompanied by the spherical-symmetry breaking of the angulon ground state and a discontinuity in the first derivative of the ground-state energy. Moreover, the type of symmetry breaking is dictated by the symmetry of the microscopic impurity-bath interaction, which leads to a number of distinct self-localized states. \r\nFor the system containing multiple impurities, by analogy with the bipolaron, we introduce the biangulon quasiparticle describing two rotating molecules that align with respect to each other due to the effective attractive interaction mediated by the excitations of the bath. We study this system from the strong-coupling regime to the weak molecule-bath interaction regime. We show that the molecules tend to have a strong alignment in the ground state, the biangulon shows shifted angulon instabilities and an additional spectral instability, where resonant angular momentum transfer between the molecules and the bath takes place. Finally, we introduce a diagonalization scheme that allows us to describe the transition from two separated angulons to a biangulon as a function of the distance between the two molecules.","lang":"eng"}],"type":"dissertation","alternative_title":["ISTA Thesis"],"file":[{"creator":"xli","file_size":3622305,"content_type":"application/pdf","file_name":"THESIS_Xiang_Li.pdf","access_level":"open_access","date_updated":"2020-12-22T10:55:56Z","date_created":"2020-12-22T10:55:56Z","success":1,"checksum":"3994c54a1241451d561db1d4f43bad30","file_id":"8967","relation":"main_file"},{"checksum":"0954ecfc5554c05615c14de803341f00","date_created":"2020-12-22T10:56:03Z","date_updated":"2020-12-30T07:18:03Z","file_id":"8968","relation":"source_file","creator":"xli","file_size":4018859,"content_type":"application/x-zip-compressed","access_level":"closed","file_name":"THESIS_Xiang_Li.zip"}],"oa_version":"Published Version","_id":"8958","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","title":"Rotation of coupled cold molecules in the presence of a many-body environment","status":"public","ddc":["539"]},{"abstract":[{"text":"Form versus function is a long-standing debate in various design-related fields, such as architecture as well as graphic and industrial design. A good design that balances form and function often requires considerable human effort and collaboration among experts from different professional fields. Computational design tools provide a new paradigm for designing functional objects. In computational design, form and function are represented as mathematical\r\nquantities, with the help of numerical and combinatorial algorithms, they can assist even novice users in designing versatile models that exhibit their desired functionality. This thesis presents three disparate research studies on the computational design of functional objects: The appearance of 3d print—we optimize the volumetric material distribution for faithfully replicating colored surface texture in 3d printing; the dynamic motion of mechanical structures—\r\nour design system helps the novice user to retarget various mechanical templates with different functionality to complex 3d shapes; and a more abstract functionality, multistability—our algorithm automatically generates models that exhibit multiple stable target poses. For each of these cases, our computational design tools not only ensure the functionality of the results but also permit the user aesthetic freedom over the form. Moreover, fabrication constraints\r\nwere taken into account, which allow for the immediate creation of physical realization via 3D printing or laser cutting.","lang":"eng"}],"type":"dissertation","alternative_title":["ISTA Thesis"],"oa_version":"Published Version","file":[{"checksum":"edcf578b6e1c9b0dd81ff72d319b66ba","date_created":"2020-09-14T01:02:59Z","date_updated":"2020-09-14T12:18:43Z","file_id":"8388","relation":"source_file","creator":"rzhang","file_size":1245800191,"content_type":"application/x-zip-compressed","access_level":"closed","file_name":"Thesis_Ran.zip"},{"date_updated":"2020-09-15T12:51:53Z","date_created":"2020-09-15T12:51:53Z","checksum":"817e20c33be9247f906925517c56a40d","success":1,"relation":"main_file","file_id":"8396","content_type":"application/pdf","file_size":161385316,"creator":"rzhang","file_name":"PhD_thesis_Ran Zhang_20200915.pdf","access_level":"open_access"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"8386","status":"public","ddc":["003"],"title":"Structure-aware computational design and its application to 3D printable volume scattering, mechanism, and multistability","day":"14","has_accepted_license":"1","article_processing_charge":"No","date_published":"2020-09-14T00:00:00Z","citation":{"mla":"Zhang, Ran. Structure-Aware Computational Design and Its Application to 3D Printable Volume Scattering, Mechanism, and Multistability. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:8386.","short":"R. Zhang, Structure-Aware Computational Design and Its Application to 3D Printable Volume Scattering, Mechanism, and Multistability, Institute of Science and Technology Austria, 2020.","chicago":"Zhang, Ran. “Structure-Aware Computational Design and Its Application to 3D Printable Volume Scattering, Mechanism, and Multistability.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:8386.","ama":"Zhang R. Structure-aware computational design and its application to 3D printable volume scattering, mechanism, and multistability. 2020. doi:10.15479/AT:ISTA:8386","ista":"Zhang R. 2020. Structure-aware computational design and its application to 3D printable volume scattering, mechanism, and multistability. Institute of Science and Technology Austria.","apa":"Zhang, R. (2020). Structure-aware computational design and its application to 3D printable volume scattering, mechanism, and multistability. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:8386","ieee":"R. Zhang, “Structure-aware computational design and its application to 3D printable volume scattering, mechanism, and multistability,” Institute of Science and Technology Austria, 2020."},"page":"148","file_date_updated":"2020-09-15T12:51:53Z","ec_funded":1,"author":[{"full_name":"Zhang, Ran","id":"4DDBCEB0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3808-281X","first_name":"Ran","last_name":"Zhang"}],"related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"486"},{"id":"1002","status":"public","relation":"part_of_dissertation"}]},"date_updated":"2023-09-22T09:49:31Z","date_created":"2020-09-14T01:04:53Z","acknowledgement":"The research in this thesis has received funding from the European Union’s Horizon 2020 research and innovation programme, under the Marie Skłodowska-Curie grant agreement No 642841 (DISTRO) and the European Research Council grant agreement No 715767 (MATERIALIZABLE). All the research projects in this thesis were also supported by Scientific Service Units (SSUs) at IST Austria.","year":"2020","publication_status":"published","department":[{"_id":"BeBi"}],"publisher":"Institute of Science and Technology Austria","month":"09","publication_identifier":{"issn":["2663-337X"]},"doi":"10.15479/AT:ISTA:8386","supervisor":[{"full_name":"Bickel, Bernd","last_name":"Bickel","first_name":"Bernd","orcid":"0000-0001-6511-9385","id":"49876194-F248-11E8-B48F-1D18A9856A87"}],"acknowledged_ssus":[{"_id":"SSU"}],"degree_awarded":"PhD","language":[{"iso":"eng"}],"oa":1,"project":[{"name":"Distributed 3D Object Design","call_identifier":"H2020","_id":"2508E324-B435-11E9-9278-68D0E5697425","grant_number":"642841"},{"grant_number":"715767","_id":"24F9549A-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling"}]},{"file":[{"date_created":"2020-06-22T09:22:04Z","date_updated":"2020-07-14T12:48:07Z","checksum":"467e52feb3e361ce8cf5fe8d5c254ece","relation":"main_file","file_id":"7997","content_type":"application/x-zip-compressed","file_size":392794743,"creator":"dernst","file_name":"JK_thesis_latex_source_files.zip","access_level":"closed"},{"creator":"dernst","content_type":"application/pdf","file_size":28453247,"access_level":"open_access","file_name":"PhD_thesis_JK_pdfa.pdf","checksum":"1de716bf110dbd77d383e479232bf496","date_updated":"2020-07-14T12:48:07Z","date_created":"2020-06-22T09:21:29Z","file_id":"7998","relation":"main_file"}],"oa_version":"Published Version","ddc":["530"],"status":"public","title":"Implementation of a hole spin qubit in Ge hut wires and dispersive spin sensing","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"7996","abstract":[{"lang":"eng","text":"Quantum computation enables the execution of algorithms that have exponential complexity. This might open the path towards the synthesis of new materials or medical drugs, optimization of transport or financial strategies etc., intractable on even the fastest classical computers. A quantum computer consists of interconnected two level quantum systems, called qubits, that satisfy DiVincezo’s criteria. Worldwide, there are ongoing efforts to find the qubit architecture which will unite quantum error correction compatible single and two qubit fidelities, long distance qubit to qubit coupling and \r\n calability. Superconducting qubits have gone the furthest in this race, demonstrating an algorithm running on 53 coupled qubits, but still the fidelities are not even close to those required for realizing a single logical qubit. emiconductor qubits offer extremely good characteristics, but they are currently investigated across different platforms. Uniting those good characteristics into a single platform might be a big step towards the quantum computer realization.\r\nHere we describe the implementation of a hole spin qubit hosted in a Ge hut wire double quantum dot. The high and tunable spin-orbit coupling together with a heavy hole state character is expected to allow fast spin manipulation and long coherence times. Furthermore large lever arms, for hut wire devices, should allow good coupling to superconducting resonators enabling efficient long distance spin to spin coupling and a sensitive gate reflectometry spin readout. The developed cryogenic setup (printed circuit board sample holders, filtering, high-frequency wiring) enabled us to perform low temperature spin dynamics experiments. Indeed, we measured the fastest single spin qubit Rabi frequencies reported so far, reaching 140 MHz, while the dephasing times of 130 ns oppose the long decoherence predictions. In order to further investigate this, a double quantum dot gate was connected directly to a lumped element\r\nresonator which enabled gate reflectometry readout. The vanishing inter-dot transition signal, for increasing external magnetic field, revealed the spin nature of the measured quantity."}],"alternative_title":["ISTA Thesis"],"type":"dissertation","date_published":"2020-06-22T00:00:00Z","page":"178","citation":{"mla":"Kukucka, Josip. Implementation of a Hole Spin Qubit in Ge Hut Wires and Dispersive Spin Sensing. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:7996.","short":"J. Kukucka, Implementation of a Hole Spin Qubit in Ge Hut Wires and Dispersive Spin Sensing, Institute of Science and Technology Austria, 2020.","chicago":"Kukucka, Josip. “Implementation of a Hole Spin Qubit in Ge Hut Wires and Dispersive Spin Sensing.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:7996.","ama":"Kukucka J. Implementation of a hole spin qubit in Ge hut wires and dispersive spin sensing. 2020. doi:10.15479/AT:ISTA:7996","ista":"Kukucka J. 2020. Implementation of a hole spin qubit in Ge hut wires and dispersive spin sensing. Institute of Science and Technology Austria.","ieee":"J. Kukucka, “Implementation of a hole spin qubit in Ge hut wires and dispersive spin sensing,” Institute of Science and Technology Austria, 2020.","apa":"Kukucka, J. (2020). Implementation of a hole spin qubit in Ge hut wires and dispersive spin sensing. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:7996"},"article_processing_charge":"No","has_accepted_license":"1","day":"22","date_created":"2020-06-22T09:22:23Z","date_updated":"2023-09-26T15:50:22Z","related_material":{"record":[{"id":"1328","relation":"part_of_dissertation","status":"public"},{"id":"7541","relation":"part_of_dissertation","status":"public"},{"id":"77","relation":"part_of_dissertation","status":"public"},{"id":"23","status":"public","relation":"part_of_dissertation"},{"id":"840","status":"public","relation":"part_of_dissertation"}]},"author":[{"id":"3F5D8856-F248-11E8-B48F-1D18A9856A87","first_name":"Josip","last_name":"Kukucka","full_name":"Kukucka, Josip"}],"publisher":"Institute of Science and Technology Austria","department":[{"_id":"GeKa"}],"publication_status":"published","year":"2020","file_date_updated":"2020-07-14T12:48:07Z","language":[{"iso":"eng"}],"degree_awarded":"PhD","supervisor":[{"full_name":"Katsaros, Georgios","last_name":"Katsaros","first_name":"Georgios","orcid":"0000-0001-8342-202X","id":"38DB5788-F248-11E8-B48F-1D18A9856A87"}],"doi":"10.15479/AT:ISTA:7996","oa":1,"publication_identifier":{"issn":["2663-337X"]},"month":"06"},{"publication_identifier":{"eissn":["16113349"],"isbn":["9783030532901"],"issn":["03029743"]},"month":"07","language":[{"iso":"eng"}],"doi":"10.1007/978-3-030-53291-8_21","conference":{"name":"CAV: Computer Aided Verification"},"project":[{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020"},{"name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003"}],"quality_controlled":"1","isi":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"external_id":{"isi":["000695272500021"],"arxiv":["2005.04018"]},"ec_funded":1,"file_date_updated":"2020-08-17T11:32:44Z","volume":12225,"date_updated":"2023-10-03T11:36:13Z","date_created":"2020-08-16T22:00:58Z","related_material":{"record":[{"status":"public","relation":"later_version","id":"12738"}]},"author":[{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Joost P","last_name":"Katoen","id":"4524F760-F248-11E8-B48F-1D18A9856A87","full_name":"Katoen, Joost P"},{"full_name":"Weininger, Maximilian","last_name":"Weininger","first_name":"Maximilian"},{"full_name":"Winkler, Tobias","first_name":"Tobias","last_name":"Winkler"}],"publisher":"Springer Nature","department":[{"_id":"KrCh"}],"publication_status":"published","year":"2020","article_processing_charge":"No","has_accepted_license":"1","day":"14","scopus_import":"1","date_published":"2020-07-14T00:00:00Z","page":"398-420","citation":{"chicago":"Chatterjee, Krishnendu, Joost P Katoen, Maximilian Weininger, and Tobias Winkler. “Stochastic Games with Lexicographic Reachability-Safety Objectives.” In International Conference on Computer Aided Verification, 12225:398–420. Springer Nature, 2020. https://doi.org/10.1007/978-3-030-53291-8_21.","mla":"Chatterjee, Krishnendu, et al. “Stochastic Games with Lexicographic Reachability-Safety Objectives.” International Conference on Computer Aided Verification, vol. 12225, Springer Nature, 2020, pp. 398–420, doi:10.1007/978-3-030-53291-8_21.","short":"K. Chatterjee, J.P. Katoen, M. Weininger, T. Winkler, in:, International Conference on Computer Aided Verification, Springer Nature, 2020, pp. 398–420.","ista":"Chatterjee K, Katoen JP, Weininger M, Winkler T. 2020. Stochastic games with lexicographic reachability-safety objectives. International Conference on Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 12225, 398–420.","apa":"Chatterjee, K., Katoen, J. P., Weininger, M., & Winkler, T. (2020). Stochastic games with lexicographic reachability-safety objectives. In International Conference on Computer Aided Verification (Vol. 12225, pp. 398–420). Springer Nature. https://doi.org/10.1007/978-3-030-53291-8_21","ieee":"K. Chatterjee, J. P. Katoen, M. Weininger, and T. Winkler, “Stochastic games with lexicographic reachability-safety objectives,” in International Conference on Computer Aided Verification, 2020, vol. 12225, pp. 398–420.","ama":"Chatterjee K, Katoen JP, Weininger M, Winkler T. Stochastic games with lexicographic reachability-safety objectives. In: International Conference on Computer Aided Verification. Vol 12225. Springer Nature; 2020:398-420. doi:10.1007/978-3-030-53291-8_21"},"publication":"International Conference on Computer Aided Verification","abstract":[{"text":"We study turn-based stochastic zero-sum games with lexicographic preferences over reachability and safety objectives. Stochastic games are standard models in control, verification, and synthesis of stochastic reactive systems that exhibit both randomness as well as angelic and demonic non-determinism. Lexicographic order allows to consider multiple objectives with a strict preference order over the satisfaction of the objectives. To the best of our knowledge, stochastic games with lexicographic objectives have not been studied before. We establish determinacy of such games and present strategy and computational complexity results. For strategy complexity, we show that lexicographically optimal strategies exist that are deterministic and memory is only required to remember the already satisfied and violated objectives. For a constant number of objectives, we show that the relevant decision problem is in NP∩coNP , matching the current known bound for single objectives; and in general the decision problem is PSPACE -hard and can be solved in NEXPTIME∩coNEXPTIME . We present an algorithm that computes the lexicographically optimal strategies via a reduction to computation of optimal strategies in a sequence of single-objectives games. We have implemented our algorithm and report experimental results on various case studies.","lang":"eng"}],"alternative_title":["LNCS"],"type":"conference","oa_version":"Published Version","file":[{"date_created":"2020-08-17T11:32:44Z","date_updated":"2020-08-17T11:32:44Z","success":1,"checksum":"093d4788d7d5b2ce0ffe64fbe7820043","file_id":"8276","relation":"main_file","creator":"dernst","file_size":625056,"content_type":"application/pdf","file_name":"2020_LNCS_CAV_Chatterjee.pdf","access_level":"open_access"}],"intvolume":" 12225","title":"Stochastic games with lexicographic reachability-safety objectives","status":"public","ddc":["000"],"_id":"8272","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8"},{"date_published":"2020-02-27T00:00:00Z","page":"145-161","citation":{"chicago":"Dos Santos Caldas, Paulo R, Philipp Radler, Christoph M Sommer, and Martin Loose. “Computational Analysis of Filament Polymerization Dynamics in Cytoskeletal Networks.” In Methods in Cell Biology, edited by Phong Tran, 158:145–61. Elsevier, 2020. https://doi.org/10.1016/bs.mcb.2020.01.006.","mla":"Dos Santos Caldas, Paulo R., et al. “Computational Analysis of Filament Polymerization Dynamics in Cytoskeletal Networks.” Methods in Cell Biology, edited by Phong Tran, vol. 158, Elsevier, 2020, pp. 145–61, doi:10.1016/bs.mcb.2020.01.006.","short":"P.R. Dos Santos Caldas, P. Radler, C.M. Sommer, M. Loose, in:, P. Tran (Ed.), Methods in Cell Biology, Elsevier, 2020, pp. 145–161.","ista":"Dos Santos Caldas PR, Radler P, Sommer CM, Loose M. 2020.Computational analysis of filament polymerization dynamics in cytoskeletal networks. In: Methods in Cell Biology. Methods in Cell Biology, vol. 158, 145–161.","apa":"Dos Santos Caldas, P. R., Radler, P., Sommer, C. M., & Loose, M. (2020). Computational analysis of filament polymerization dynamics in cytoskeletal networks. In P. Tran (Ed.), Methods in Cell Biology (Vol. 158, pp. 145–161). Elsevier. https://doi.org/10.1016/bs.mcb.2020.01.006","ieee":"P. R. Dos Santos Caldas, P. Radler, C. M. Sommer, and M. Loose, “Computational analysis of filament polymerization dynamics in cytoskeletal networks,” in Methods in Cell Biology, vol. 158, P. Tran, Ed. Elsevier, 2020, pp. 145–161.","ama":"Dos Santos Caldas PR, Radler P, Sommer CM, Loose M. Computational analysis of filament polymerization dynamics in cytoskeletal networks. In: Tran P, ed. Methods in Cell Biology. Vol 158. Elsevier; 2020:145-161. doi:10.1016/bs.mcb.2020.01.006"},"publication":"Methods in Cell Biology","article_processing_charge":"No","day":"27","scopus_import":"1","oa_version":"Preprint","intvolume":" 158","status":"public","title":"Computational analysis of filament polymerization dynamics in cytoskeletal networks","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"7572","abstract":[{"text":"The polymerization–depolymerization dynamics of cytoskeletal proteins play essential roles in the self-organization of cytoskeletal structures, in eukaryotic as well as prokaryotic cells. While advances in fluorescence microscopy and in vitro reconstitution experiments have helped to study the dynamic properties of these complex systems, methods that allow to collect and analyze large quantitative datasets of the underlying polymer dynamics are still missing. Here, we present a novel image analysis workflow to study polymerization dynamics of active filaments in a nonbiased, highly automated manner. Using treadmilling filaments of the bacterial tubulin FtsZ as an example, we demonstrate that our method is able to specifically detect, track and analyze growth and shrinkage of polymers, even in dense networks of filaments. We believe that this automated method can facilitate the analysis of a large variety of dynamic cytoskeletal systems, using standard time-lapse movies obtained from experiments in vitro as well as in the living cell. Moreover, we provide scripts implementing this method as supplementary material.","lang":"eng"}],"alternative_title":["Methods in Cell Biology"],"type":"book_chapter","language":[{"iso":"eng"}],"doi":"10.1016/bs.mcb.2020.01.006","project":[{"name":"Self-Organization of the Bacterial Cell","call_identifier":"H2020","grant_number":"679239","_id":"2595697A-B435-11E9-9278-68D0E5697425"},{"name":"Reconstitution of Bacterial Cell Division Using Purified Components","_id":"260D98C8-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","isi":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1101/839571"}],"external_id":{"isi":["000611826500008"]},"oa":1,"publication_identifier":{"issn":["0091679X"]},"month":"02","volume":158,"date_updated":"2023-10-04T09:50:24Z","date_created":"2020-03-08T23:00:47Z","related_material":{"record":[{"id":"8358","status":"public","relation":"part_of_dissertation"}]},"author":[{"full_name":"Dos Santos Caldas, Paulo R","first_name":"Paulo R","last_name":"Dos Santos Caldas","id":"38FCDB4C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6730-4461"},{"first_name":"Philipp","last_name":"Radler","id":"40136C2A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9198-2182 ","full_name":"Radler, Philipp"},{"full_name":"Sommer, Christoph M","id":"4DF26D8C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1216-9105","first_name":"Christoph M","last_name":"Sommer"},{"full_name":"Loose, Martin","orcid":"0000-0001-7309-9724","id":"462D4284-F248-11E8-B48F-1D18A9856A87","last_name":"Loose","first_name":"Martin"}],"publisher":"Elsevier","department":[{"_id":"MaLo"}],"editor":[{"full_name":"Tran, Phong ","last_name":"Tran","first_name":"Phong "}],"publication_status":"published","year":"2020","ec_funded":1},{"project":[{"grant_number":"679239","_id":"2595697A-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Self-Organization of the Bacterial Cell"},{"_id":"259B655A-B435-11E9-9278-68D0E5697425","grant_number":"LT000824/2016","name":"Reconstitution of bacterial cell wall sythesis"},{"_id":"2596EAB6-B435-11E9-9278-68D0E5697425","grant_number":"ALTF 2015-1163","name":"Synthesis of bacterial cell wall"}],"quality_controlled":"1","isi":1,"main_file_link":[{"url":"http://europepmc.org/article/PMC/7048620","open_access":"1"}],"external_id":{"pmid":["31959972"],"isi":["000508584700007"]},"oa":1,"language":[{"iso":"eng"}],"doi":"10.1038/s41564-019-0657-5","publication_identifier":{"issn":["2058-5276"]},"month":"01","department":[{"_id":"MaLo"}],"publisher":"Springer Nature","publication_status":"published","pmid":1,"year":"2020","acknowledgement":"We acknowledge members of the Loose laboratory at IST Austria for helpful discussions—in particular, P. Caldas for help with the treadmilling analysis, M. Jimenez, A. Raso and N. Ropero for providing Alexa Fluor 488- and Alexa Fluor 647-labelled FtsA for the MST and analytical ultracentrifugation experiments. We thank C. You for providing the DODA-tris-NTA phospholipids, as well as J. Piehler and C. Richter (Department of Biology, University of Osnabruck, Germany) for the SLIMfast single-molecule tracking software and help with the confinement analysis. We thank J. Errington and H. Murray (both at Newcastle University, UK) for critical reading of the manuscript, and J. Brugués (MPI-CBG and MPI-PKS, Dresden, Germany) for help with the MATLAB programming and reading of the manuscript. This work was supported by the European Research Council through grant ERC-2015-StG-679239 to M.L. and grants HFSP LT 000824/2016-L4 and EMBO ALTF 1163-2015 to N.B., a grant from the Ministry of Economy and Competitiveness of the Spanish Government (BFU2016-75471-C2-1-P) to C.A. and G.R., and a Wellcome Trust Senior Investigator award (101824/Z/13/Z) and a grant from the BBSRC (BB/R017409/1) to W.V.","volume":5,"date_updated":"2023-10-06T12:22:38Z","date_created":"2020-01-28T16:14:41Z","related_material":{"link":[{"url":"https://ist.ac.at/en/news/little-cell-big-cover-story/","relation":"press_release","description":"News on IST Homepage"}],"record":[{"relation":"dissertation_contains","status":"public","id":"14280"}]},"author":[{"full_name":"Baranova, Natalia S.","orcid":"0000-0002-3086-9124","id":"38661662-F248-11E8-B48F-1D18A9856A87","last_name":"Baranova","first_name":"Natalia S."},{"full_name":"Radler, Philipp","id":"40136C2A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9198-2182 ","first_name":"Philipp","last_name":"Radler"},{"full_name":"Hernández-Rocamora, Víctor M.","first_name":"Víctor M.","last_name":"Hernández-Rocamora"},{"full_name":"Alfonso, Carlos","first_name":"Carlos","last_name":"Alfonso"},{"last_name":"Lopez Pelegrin","first_name":"Maria D","id":"319AA9CE-F248-11E8-B48F-1D18A9856A87","full_name":"Lopez Pelegrin, Maria D"},{"full_name":"Rivas, Germán","last_name":"Rivas","first_name":"Germán"},{"full_name":"Vollmer, Waldemar","last_name":"Vollmer","first_name":"Waldemar"},{"id":"462D4284-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7309-9724","first_name":"Martin","last_name":"Loose","full_name":"Loose, Martin"}],"ec_funded":1,"page":"407-417","article_type":"letter_note","citation":{"chicago":"Baranova, Natalia S., Philipp Radler, Víctor M. Hernández-Rocamora, Carlos Alfonso, Maria D Lopez Pelegrin, Germán Rivas, Waldemar Vollmer, and Martin Loose. “Diffusion and Capture Permits Dynamic Coupling between Treadmilling FtsZ Filaments and Cell Division Proteins.” Nature Microbiology. Springer Nature, 2020. https://doi.org/10.1038/s41564-019-0657-5.","short":"N.S. Baranova, P. Radler, V.M. Hernández-Rocamora, C. Alfonso, M.D. Lopez Pelegrin, G. Rivas, W. Vollmer, M. Loose, Nature Microbiology 5 (2020) 407–417.","mla":"Baranova, Natalia S., et al. “Diffusion and Capture Permits Dynamic Coupling between Treadmilling FtsZ Filaments and Cell Division Proteins.” Nature Microbiology, vol. 5, Springer Nature, 2020, pp. 407–17, doi:10.1038/s41564-019-0657-5.","apa":"Baranova, N. S., Radler, P., Hernández-Rocamora, V. M., Alfonso, C., Lopez Pelegrin, M. D., Rivas, G., … Loose, M. (2020). Diffusion and capture permits dynamic coupling between treadmilling FtsZ filaments and cell division proteins. Nature Microbiology. Springer Nature. https://doi.org/10.1038/s41564-019-0657-5","ieee":"N. S. Baranova et al., “Diffusion and capture permits dynamic coupling between treadmilling FtsZ filaments and cell division proteins,” Nature Microbiology, vol. 5. Springer Nature, pp. 407–417, 2020.","ista":"Baranova NS, Radler P, Hernández-Rocamora VM, Alfonso C, Lopez Pelegrin MD, Rivas G, Vollmer W, Loose M. 2020. Diffusion and capture permits dynamic coupling between treadmilling FtsZ filaments and cell division proteins. Nature Microbiology. 5, 407–417.","ama":"Baranova NS, Radler P, Hernández-Rocamora VM, et al. Diffusion and capture permits dynamic coupling between treadmilling FtsZ filaments and cell division proteins. Nature Microbiology. 2020;5:407-417. doi:10.1038/s41564-019-0657-5"},"publication":"Nature Microbiology","date_published":"2020-01-20T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"20","intvolume":" 5","status":"public","title":"Diffusion and capture permits dynamic coupling between treadmilling FtsZ filaments and cell division proteins","_id":"7387","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","oa_version":"Submitted Version","type":"journal_article","abstract":[{"lang":"eng","text":"Most bacteria accomplish cell division with the help of a dynamic protein complex called the divisome, which spans the cell envelope in the plane of division. Assembly and activation of this machinery are coordinated by the tubulin-related GTPase FtsZ, which was found to form treadmilling filaments on supported bilayers in vitro1, as well as in live cells, in which filaments circle around the cell division site2,3. Treadmilling of FtsZ is thought to actively move proteins around the division septum, thereby distributing peptidoglycan synthesis and coordinating the inward growth of the septum to form the new poles of the daughter cells4. However, the molecular mechanisms underlying this function are largely unknown. Here, to study how FtsZ polymerization dynamics are coupled to downstream proteins, we reconstituted part of the bacterial cell division machinery using its purified components FtsZ, FtsA and truncated transmembrane proteins essential for cell division. We found that the membrane-bound cytosolic peptides of FtsN and FtsQ co-migrated with treadmilling FtsZ–FtsA filaments, but despite their directed collective behaviour, individual peptides showed random motion and transient confinement. Our work suggests that divisome proteins follow treadmilling FtsZ filaments by a diffusion-and-capture mechanism, which can give rise to a moving zone of signalling activity at the division site."}]},{"day":"24","has_accepted_license":"1","article_processing_charge":"No","scopus_import":"1","date_published":"2020-07-24T00:00:00Z","article_type":"original","page":"193-199","publication":"Studia Scientiarum Mathematicarum Hungarica","citation":{"apa":"Vegter, G., & Wintraecken, M. (2020). Refutation of a claim made by Fejes Tóth on the accuracy of surface meshes. Studia Scientiarum Mathematicarum Hungarica. Akadémiai Kiadó. https://doi.org/10.1556/012.2020.57.2.1454","ieee":"G. Vegter and M. Wintraecken, “Refutation of a claim made by Fejes Tóth on the accuracy of surface meshes,” Studia Scientiarum Mathematicarum Hungarica, vol. 57, no. 2. Akadémiai Kiadó, pp. 193–199, 2020.","ista":"Vegter G, Wintraecken M. 2020. Refutation of a claim made by Fejes Tóth on the accuracy of surface meshes. Studia Scientiarum Mathematicarum Hungarica. 57(2), 193–199.","ama":"Vegter G, Wintraecken M. Refutation of a claim made by Fejes Tóth on the accuracy of surface meshes. Studia Scientiarum Mathematicarum Hungarica. 2020;57(2):193-199. doi:10.1556/012.2020.57.2.1454","chicago":"Vegter, Gert, and Mathijs Wintraecken. “Refutation of a Claim Made by Fejes Tóth on the Accuracy of Surface Meshes.” Studia Scientiarum Mathematicarum Hungarica. Akadémiai Kiadó, 2020. https://doi.org/10.1556/012.2020.57.2.1454.","short":"G. Vegter, M. Wintraecken, Studia Scientiarum Mathematicarum Hungarica 57 (2020) 193–199.","mla":"Vegter, Gert, and Mathijs Wintraecken. “Refutation of a Claim Made by Fejes Tóth on the Accuracy of Surface Meshes.” Studia Scientiarum Mathematicarum Hungarica, vol. 57, no. 2, Akadémiai Kiadó, 2020, pp. 193–99, doi:10.1556/012.2020.57.2.1454."},"abstract":[{"lang":"eng","text":"Fejes Tóth [3] studied approximations of smooth surfaces in three-space by piecewise flat triangular meshes with a given number of vertices on the surface that are optimal with respect to Hausdorff distance. He proves that this Hausdorff distance decreases inversely proportional with the number of vertices of the approximating mesh if the surface is convex. He also claims that this Hausdorff distance is inversely proportional to the square of the number of vertices for a specific non-convex surface, namely a one-sheeted hyperboloid of revolution bounded by two congruent circles. We refute this claim, and show that the asymptotic behavior of the Hausdorff distance is linear, that is the same as for convex surfaces."}],"issue":"2","type":"journal_article","file":[{"date_created":"2020-07-24T07:09:06Z","date_updated":"2020-07-24T07:09:06Z","file_id":"8164","relation":"main_file","creator":"mwintrae","file_size":1476072,"content_type":"application/pdf","file_name":"57-2-05_4214-1454Vegter-Wintraecken_OpenAccess_CC-BY-NC.pdf","access_level":"open_access"}],"oa_version":"Published Version","status":"public","ddc":["510"],"title":"Refutation of a claim made by Fejes Tóth on the accuracy of surface meshes","intvolume":" 57","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"8163","month":"07","publication_identifier":{"issn":["0081-6906"],"eissn":["1588-2896"]},"language":[{"iso":"eng"}],"doi":"10.1556/012.2020.57.2.1454","isi":1,"quality_controlled":"1","project":[{"grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships"},{"_id":"268116B8-B435-11E9-9278-68D0E5697425","grant_number":"Z00342","call_identifier":"FWF","name":"The Wittgenstein Prize"}],"external_id":{"isi":["000570978400005"]},"tmp":{"name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png","short":"CC BY-NC (4.0)"},"oa":1,"file_date_updated":"2020-07-24T07:09:06Z","ec_funded":1,"date_updated":"2023-10-10T13:05:27Z","date_created":"2020-07-24T07:09:18Z","volume":57,"author":[{"full_name":"Vegter, Gert","first_name":"Gert","last_name":"Vegter"},{"full_name":"Wintraecken, Mathijs","last_name":"Wintraecken","first_name":"Mathijs","orcid":"0000-0002-7472-2220","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87"}],"publication_status":"published","publisher":"Akadémiai Kiadó","department":[{"_id":"HeEd"}],"acknowledgement":"The authors are greatly indebted to Dror Atariah, Günther Rote and John Sullivan for discussion and suggestions. The authors also thank Jean-Daniel Boissonnat, Ramsay Dyer, David de Laat and Rien van de Weijgaert for discussion. This work has been supported in part by the European Union’s Seventh Framework Programme for Research of the\r\nEuropean Commission, under FET-Open grant number 255827 (CGL Computational Geometry Learning) and ERC Grant Agreement number 339025 GUDHI (Algorithmic Foundations of Geometry Understanding in Higher Dimensions), the European Union’s Horizon 2020 research and innovation programme under the Marie Sk lodowska-Curie grant agreement number 754411,and the Austrian Science Fund (FWF): Z00342 N31.","year":"2020"},{"scopus_import":"1","has_accepted_license":"1","article_processing_charge":"No","day":"01","page":"117-128","article_type":"original","citation":{"mla":"Shakiba, A., et al. “A Note on Belief Structures and S-Approximation Spaces.” Iranian Journal of Mathematical Sciences and Informatics, vol. 15, no. 2, Iranian Academic Center for Education, Culture and Research, 2020, pp. 117–28, doi:10.29252/ijmsi.15.2.117.","short":"A. Shakiba, A.K. Goharshady, M.R. Hooshmandasl, M. Alambardar Meybodi, Iranian Journal of Mathematical Sciences and Informatics 15 (2020) 117–128.","chicago":"Shakiba, A., Amir Kafshdar Goharshady, M.R. Hooshmandasl, and M. Alambardar Meybodi. “A Note on Belief Structures and S-Approximation Spaces.” Iranian Journal of Mathematical Sciences and Informatics. Iranian Academic Center for Education, Culture and Research, 2020. https://doi.org/10.29252/ijmsi.15.2.117.","ama":"Shakiba A, Goharshady AK, Hooshmandasl MR, Alambardar Meybodi M. A note on belief structures and s-approximation spaces. Iranian Journal of Mathematical Sciences and Informatics. 2020;15(2):117-128. doi:10.29252/ijmsi.15.2.117","ista":"Shakiba A, Goharshady AK, Hooshmandasl MR, Alambardar Meybodi M. 2020. A note on belief structures and s-approximation spaces. Iranian Journal of Mathematical Sciences and Informatics. 15(2), 117–128.","apa":"Shakiba, A., Goharshady, A. K., Hooshmandasl, M. R., & Alambardar Meybodi, M. (2020). A note on belief structures and s-approximation spaces. Iranian Journal of Mathematical Sciences and Informatics. Iranian Academic Center for Education, Culture and Research. https://doi.org/10.29252/ijmsi.15.2.117","ieee":"A. Shakiba, A. K. Goharshady, M. R. Hooshmandasl, and M. Alambardar Meybodi, “A note on belief structures and s-approximation spaces,” Iranian Journal of Mathematical Sciences and Informatics, vol. 15, no. 2. Iranian Academic Center for Education, Culture and Research, pp. 117–128, 2020."},"publication":"Iranian Journal of Mathematical Sciences and Informatics","date_published":"2020-10-01T00:00:00Z","type":"journal_article","issue":"2","abstract":[{"text":"We study relations between evidence theory and S-approximation spaces. Both theories have their roots in the analysis of Dempsterchr('39')s multivalued mappings and lower and upper probabilities, and have close relations to rough sets. We show that an S-approximation space, satisfying a monotonicity condition, can induce a natural belief structure which is a fundamental block in evidence theory. We also demonstrate that one can induce a natural belief structure on one set, given a belief structure on another set, if the two sets are related by a partial monotone S-approximation space. ","lang":"eng"}],"intvolume":" 15","ddc":["000"],"status":"public","title":"A note on belief structures and s-approximation spaces","_id":"8671","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"date_created":"2020-10-19T11:14:20Z","date_updated":"2020-10-19T11:14:20Z","checksum":"f299661a6d51cda6d255a76be696f48d","success":1,"relation":"main_file","file_id":"8676","file_size":261688,"content_type":"application/pdf","creator":"dernst","file_name":"2020_ijmsi_Shakiba_accepted.pdf","access_level":"open_access"}],"oa_version":"Submitted Version","publication_identifier":{"issn":["1735-4463"],"eissn":["2008-9473"]},"month":"10","project":[{"_id":"267066CE-B435-11E9-9278-68D0E5697425","name":"Quantitative Analysis of Probablistic Systems with a focus on Crypto-currencies"}],"quality_controlled":"1","oa":1,"external_id":{"arxiv":["1805.10672"]},"language":[{"iso":"eng"}],"doi":"10.29252/ijmsi.15.2.117","file_date_updated":"2020-10-19T11:14:20Z","publisher":"Iranian Academic Center for Education, Culture and Research","department":[{"_id":"KrCh"}],"publication_status":"published","acknowledgement":"We are very grateful to the anonymous reviewer for detailed comments and suggestions that significantly improved the presentation of this paper. The research was partially supported by a DOC fellowship of the Austrian Academy of Sciences.","year":"2020","volume":15,"date_updated":"2023-10-16T09:25:00Z","date_created":"2020-10-18T22:01:36Z","author":[{"first_name":"A.","last_name":"Shakiba","full_name":"Shakiba, A."},{"orcid":"0000-0003-1702-6584","id":"391365CE-F248-11E8-B48F-1D18A9856A87","last_name":"Goharshady","first_name":"Amir Kafshdar","full_name":"Goharshady, Amir Kafshdar"},{"full_name":"Hooshmandasl, M.R.","first_name":"M.R.","last_name":"Hooshmandasl"},{"full_name":"Alambardar Meybodi, M.","first_name":"M.","last_name":"Alambardar Meybodi"}]},{"article_number":"82","file_date_updated":"2020-09-21T13:15:02Z","publication_status":"published","department":[{"_id":"JaMa"}],"publisher":"Institute of Mathematical Statistics","year":"2020","date_updated":"2023-10-16T09:22:50Z","date_created":"2019-04-30T07:40:17Z","volume":25,"author":[{"first_name":"Konstantinos","last_name":"Dareiotis","full_name":"Dareiotis, Konstantinos"},{"last_name":"Gerencser","first_name":"Mate","id":"44ECEDF2-F248-11E8-B48F-1D18A9856A87","full_name":"Gerencser, Mate"}],"month":"07","publication_identifier":{"eissn":["1083-6489"]},"quality_controlled":"1","isi":1,"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"arxiv":["1812.04583"],"isi":["000550150700001"]},"language":[{"iso":"eng"}],"doi":"10.1214/20-EJP479","type":"journal_article","abstract":[{"lang":"eng","text":"The strong rate of convergence of the Euler-Maruyama scheme for nondegenerate SDEs with irregular drift coefficients is considered. In the case of α-Hölder drift in the recent literature the rate α/2 was proved in many related situations. By exploiting the regularising effect of the noise more efficiently, we show that the rate is in fact arbitrarily close to 1/2 for all α>0. The result extends to Dini continuous coefficients, while in d=1 also to all bounded measurable coefficients."}],"ddc":["510"],"status":"public","title":"On the regularisation of the noise for the Euler-Maruyama scheme with irregular drift","intvolume":" 25","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"6359","file":[{"file_name":"2020_EJournProbab_Dareiotis.pdf","access_level":"open_access","content_type":"application/pdf","file_size":273042,"creator":"dernst","relation":"main_file","file_id":"8549","date_created":"2020-09-21T13:15:02Z","date_updated":"2020-09-21T13:15:02Z","checksum":"8e7c42e72596f6889d786e8e8b89994f","success":1}],"oa_version":"Published Version","scopus_import":"1","day":"16","article_processing_charge":"No","has_accepted_license":"1","article_type":"original","publication":"Electronic Journal of Probability","citation":{"ista":"Dareiotis K, Gerencser M. 2020. On the regularisation of the noise for the Euler-Maruyama scheme with irregular drift. Electronic Journal of Probability. 25, 82.","ieee":"K. Dareiotis and M. Gerencser, “On the regularisation of the noise for the Euler-Maruyama scheme with irregular drift,” Electronic Journal of Probability, vol. 25. Institute of Mathematical Statistics, 2020.","apa":"Dareiotis, K., & Gerencser, M. (2020). On the regularisation of the noise for the Euler-Maruyama scheme with irregular drift. Electronic Journal of Probability. Institute of Mathematical Statistics. https://doi.org/10.1214/20-EJP479","ama":"Dareiotis K, Gerencser M. On the regularisation of the noise for the Euler-Maruyama scheme with irregular drift. Electronic Journal of Probability. 2020;25. doi:10.1214/20-EJP479","chicago":"Dareiotis, Konstantinos, and Mate Gerencser. “On the Regularisation of the Noise for the Euler-Maruyama Scheme with Irregular Drift.” Electronic Journal of Probability. Institute of Mathematical Statistics, 2020. https://doi.org/10.1214/20-EJP479.","mla":"Dareiotis, Konstantinos, and Mate Gerencser. “On the Regularisation of the Noise for the Euler-Maruyama Scheme with Irregular Drift.” Electronic Journal of Probability, vol. 25, 82, Institute of Mathematical Statistics, 2020, doi:10.1214/20-EJP479.","short":"K. Dareiotis, M. Gerencser, Electronic Journal of Probability 25 (2020)."},"date_published":"2020-07-16T00:00:00Z"},{"date_published":"2020-09-14T00:00:00Z","page":"197","citation":{"chicago":"Royer, Amélie. “Leveraging Structure in Computer Vision Tasks for Flexible Deep Learning Models.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:8390.","short":"A. Royer, Leveraging Structure in Computer Vision Tasks for Flexible Deep Learning Models, Institute of Science and Technology Austria, 2020.","mla":"Royer, Amélie. Leveraging Structure in Computer Vision Tasks for Flexible Deep Learning Models. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:8390.","apa":"Royer, A. (2020). Leveraging structure in Computer Vision tasks for flexible Deep Learning models. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:8390","ieee":"A. Royer, “Leveraging structure in Computer Vision tasks for flexible Deep Learning models,” Institute of Science and Technology Austria, 2020.","ista":"Royer A. 2020. Leveraging structure in Computer Vision tasks for flexible Deep Learning models. Institute of Science and Technology Austria.","ama":"Royer A. Leveraging structure in Computer Vision tasks for flexible Deep Learning models. 2020. doi:10.15479/AT:ISTA:8390"},"day":"14","has_accepted_license":"1","article_processing_charge":"No","file":[{"file_name":"2020_Thesis_Royer.pdf","access_level":"open_access","creator":"dernst","file_size":30224591,"content_type":"application/pdf","file_id":"8391","relation":"main_file","date_created":"2020-09-14T13:39:14Z","date_updated":"2020-09-14T13:39:14Z","success":1,"checksum":"c914d2f88846032f3d8507734861b6ee"},{"checksum":"ae98fb35d912cff84a89035ae5794d3c","date_updated":"2020-09-14T13:39:17Z","date_created":"2020-09-14T13:39:17Z","file_id":"8392","relation":"main_file","creator":"dernst","file_size":74227627,"content_type":"application/x-zip-compressed","access_level":"closed","file_name":"thesis_sources.zip"}],"oa_version":"Published Version","title":"Leveraging structure in Computer Vision tasks for flexible Deep Learning models","status":"public","ddc":["000"],"_id":"8390","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","abstract":[{"lang":"eng","text":"Deep neural networks have established a new standard for data-dependent feature extraction pipelines in the Computer Vision literature. Despite their remarkable performance in the standard supervised learning scenario, i.e. when models are trained with labeled data and tested on samples that follow a similar distribution, neural networks have been shown to struggle with more advanced generalization abilities, such as transferring knowledge across visually different domains, or generalizing to new unseen combinations of known concepts. In this thesis we argue that, in contrast to the usual black-box behavior of neural networks, leveraging more structured internal representations is a promising direction\r\nfor tackling such problems. In particular, we focus on two forms of structure. First, we tackle modularity: We show that (i) compositional architectures are a natural tool for modeling reasoning tasks, in that they efficiently capture their combinatorial nature, which is key for generalizing beyond the compositions seen during training. We investigate how to to learn such models, both formally and experimentally, for the task of abstract visual reasoning. Then, we show that (ii) in some settings, modularity allows us to efficiently break down complex tasks into smaller, easier, modules, thereby improving computational efficiency; We study this behavior in the context of generative models for colorization, as well as for small objects detection. Secondly, we investigate the inherently layered structure of representations learned by neural networks, and analyze its role in the context of transfer learning and domain adaptation across visually\r\ndissimilar domains. "}],"alternative_title":["ISTA Thesis"],"type":"dissertation","supervisor":[{"first_name":"Christoph","last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph"}],"degree_awarded":"PhD","acknowledged_ssus":[{"_id":"CampIT"},{"_id":"ScienComp"}],"language":[{"iso":"eng"}],"doi":"10.15479/AT:ISTA:8390","oa":1,"tmp":{"name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","image":"/images/cc_by_nc_sa.png","short":"CC BY-NC-SA (4.0)"},"month":"09","publication_identifier":{"isbn":["978-3-99078-007-7"],"issn":["2663-337X"]},"date_created":"2020-09-14T13:42:09Z","date_updated":"2023-10-16T10:04:02Z","author":[{"full_name":"Royer, Amélie","id":"3811D890-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8407-0705","first_name":"Amélie","last_name":"Royer"}],"related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"7936"},{"id":"7937","relation":"part_of_dissertation","status":"public"},{"id":"8193","relation":"part_of_dissertation","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"8092"},{"id":"911","status":"public","relation":"part_of_dissertation"}]},"publication_status":"published","publisher":"Institute of Science and Technology Austria","department":[{"_id":"ChLa"}],"year":"2020","acknowledgement":"Last but not least, I would like to acknowledge the support of the IST IT and scientific computing team for helping provide a great work environment.","file_date_updated":"2020-09-14T13:39:17Z"},{"abstract":[{"text":"Numerous methods have been proposed for probabilistic generative modelling of\r\n3D objects. However, none of these is able to produce textured objects, which\r\nrenders them of limited use for practical tasks. In this work, we present the\r\nfirst generative model of textured 3D meshes. Training such a model would\r\ntraditionally require a large dataset of textured meshes, but unfortunately,\r\nexisting datasets of meshes lack detailed textures. We instead propose a new\r\ntraining methodology that allows learning from collections of 2D images without\r\nany 3D information. To do so, we train our model to explain a distribution of\r\nimages by modelling each image as a 3D foreground object placed in front of a\r\n2D background. Thus, it learns to generate meshes that when rendered, produce\r\nimages similar to those in its training set.\r\n A well-known problem when generating meshes with deep networks is the\r\nemergence of self-intersections, which are problematic for many use-cases. As a\r\nsecond contribution we therefore introduce a new generation process for 3D\r\nmeshes that guarantees no self-intersections arise, based on the physical\r\nintuition that faces should push one another out of the way as they move.\r\n We conduct extensive experiments on our approach, reporting quantitative and\r\nqualitative results on both synthetic data and natural images. These show our\r\nmethod successfully learns to generate plausible and diverse textured 3D\r\nsamples for five challenging object classes.","lang":"eng"}],"type":"conference","file":[{"creator":"phenders","file_size":10262773,"content_type":"application/pdf","access_level":"open_access","file_name":"paper.pdf","success":1,"date_created":"2020-07-31T16:57:12Z","date_updated":"2020-07-31T16:57:12Z","file_id":"8187","relation":"main_file"}],"oa_version":"Submitted Version","title":"Leveraging 2D data to learn textured 3D mesh generation","ddc":["004"],"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"8186","article_processing_charge":"No","has_accepted_license":"1","day":"01","scopus_import":"1","date_published":"2020-07-01T00:00:00Z","page":"7498-7507","citation":{"ista":"Henderson PM, Tsiminaki V, Lampert C. 2020. Leveraging 2D data to learn textured 3D mesh generation. Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. CVPR: Conference on Computer Vision and Pattern Recognition, 7498–7507.","ieee":"P. M. Henderson, V. Tsiminaki, and C. Lampert, “Leveraging 2D data to learn textured 3D mesh generation,” in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, Virtual, 2020, pp. 7498–7507.","apa":"Henderson, P. M., Tsiminaki, V., & Lampert, C. (2020). Leveraging 2D data to learn textured 3D mesh generation. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (pp. 7498–7507). Virtual: IEEE. https://doi.org/10.1109/CVPR42600.2020.00752","ama":"Henderson PM, Tsiminaki V, Lampert C. Leveraging 2D data to learn textured 3D mesh generation. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. IEEE; 2020:7498-7507. doi:10.1109/CVPR42600.2020.00752","chicago":"Henderson, Paul M, Vagia Tsiminaki, and Christoph Lampert. “Leveraging 2D Data to Learn Textured 3D Mesh Generation.” In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 7498–7507. IEEE, 2020. https://doi.org/10.1109/CVPR42600.2020.00752.","mla":"Henderson, Paul M., et al. “Leveraging 2D Data to Learn Textured 3D Mesh Generation.” Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, IEEE, 2020, pp. 7498–507, doi:10.1109/CVPR42600.2020.00752.","short":"P.M. Henderson, V. Tsiminaki, C. Lampert, in:, Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, IEEE, 2020, pp. 7498–7507."},"publication":"Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition","file_date_updated":"2020-07-31T16:57:12Z","date_updated":"2023-10-17T07:37:11Z","date_created":"2020-07-31T16:53:49Z","author":[{"full_name":"Henderson, Paul M","orcid":"0000-0002-5198-7445","id":"13C09E74-18D9-11E9-8878-32CFE5697425","last_name":"Henderson","first_name":"Paul M"},{"first_name":"Vagia","last_name":"Tsiminaki","full_name":"Tsiminaki, Vagia"},{"orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","last_name":"Lampert","first_name":"Christoph","full_name":"Lampert, Christoph"}],"publisher":"IEEE","department":[{"_id":"ChLa"}],"publication_status":"published","year":"2020","publication_identifier":{"eissn":["2575-7075"],"eisbn":["9781728171685"]},"month":"07","language":[{"iso":"eng"}],"doi":"10.1109/CVPR42600.2020.00752","conference":{"name":"CVPR: Conference on Computer Vision and Pattern Recognition","location":"Virtual","start_date":"2020-06-14","end_date":"2020-06-19"},"quality_controlled":"1","external_id":{"arxiv":["2004.04180"]},"main_file_link":[{"url":"https://openaccess.thecvf.com/content_CVPR_2020/papers/Henderson_Leveraging_2D_Data_to_Learn_Textured_3D_Mesh_Generation_CVPR_2020_paper.pdf","open_access":"1"}],"oa":1},{"oa":1,"main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7012054"}],"external_id":{"isi":["000494909300001"],"pmid":["31696764"]},"quality_controlled":"1","isi":1,"doi":"10.1080/15592324.2019.1687175","language":[{"iso":"eng"}],"publication_identifier":{"issn":["1559-2324"]},"month":"01","pmid":1,"year":"2020","department":[{"_id":"JiFr"}],"publisher":"Taylor & Francis","publication_status":"published","author":[{"last_name":"Sinclair","first_name":"Scott A","orcid":"0000-0002-4566-0593","id":"2D99FE6A-F248-11E8-B48F-1D18A9856A87","full_name":"Sinclair, Scott A"},{"last_name":"Krämer","first_name":"U.","full_name":"Krämer, U."}],"volume":15,"date_created":"2020-01-30T10:12:04Z","date_updated":"2023-10-17T09:01:48Z","article_number":"1687175","citation":{"short":"S.A. Sinclair, U. Krämer, Plant Signaling & Behavior 15 (2020).","mla":"Sinclair, Scott A., and U. Krämer. “Generation of Effective Zinc-Deficient Agar-Solidified Media Allows Identification of Root Morphology Changes in Response to Zinc Limitation.” Plant Signaling & Behavior, vol. 15, no. 1, 1687175, Taylor & Francis, 2020, doi:10.1080/15592324.2019.1687175.","chicago":"Sinclair, Scott A, and U. Krämer. “Generation of Effective Zinc-Deficient Agar-Solidified Media Allows Identification of Root Morphology Changes in Response to Zinc Limitation.” Plant Signaling & Behavior. Taylor & Francis, 2020. https://doi.org/10.1080/15592324.2019.1687175.","ama":"Sinclair SA, Krämer U. Generation of effective zinc-deficient agar-solidified media allows identification of root morphology changes in response to zinc limitation. Plant Signaling & Behavior. 2020;15(1). doi:10.1080/15592324.2019.1687175","apa":"Sinclair, S. A., & Krämer, U. (2020). Generation of effective zinc-deficient agar-solidified media allows identification of root morphology changes in response to zinc limitation. Plant Signaling & Behavior. Taylor & Francis. https://doi.org/10.1080/15592324.2019.1687175","ieee":"S. A. Sinclair and U. Krämer, “Generation of effective zinc-deficient agar-solidified media allows identification of root morphology changes in response to zinc limitation,” Plant Signaling & Behavior, vol. 15, no. 1. Taylor & Francis, 2020.","ista":"Sinclair SA, Krämer U. 2020. Generation of effective zinc-deficient agar-solidified media allows identification of root morphology changes in response to zinc limitation. Plant Signaling & Behavior. 15(1), 1687175."},"publication":"Plant Signaling & Behavior","article_type":"original","date_published":"2020-01-01T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"01","_id":"7416","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 15","status":"public","title":"Generation of effective zinc-deficient agar-solidified media allows identification of root morphology changes in response to zinc limitation","oa_version":"Submitted Version","type":"journal_article","issue":"1","abstract":[{"text":"Earlier, we demonstrated that transcript levels of METAL TOLERANCE PROTEIN2 (MTP2) and of HEAVY METAL ATPase2 (HMA2) increase strongly in roots of Arabidopsis upon prolonged zinc (Zn) deficiency and respond to shoot physiological Zn status, and not to the local Zn status in roots. This provided evidence for shoot-to-root communication in the acclimation of plants to Zn deficiency. Zn-deficient soils limit both the yield and quality of agricultural crops and can result in clinically relevant nutritional Zn deficiency in human populations. Implementing Zn deficiency during cultivation of the model plant Arabidopsis thaliana on agar-solidified media is difficult because trace element contaminations are present in almost all commercially available agars. Here, we demonstrate root morphological acclimations to Zn deficiency on agar-solidified medium following the effective removal of contaminants. These advancements allow reproducible phenotyping toward understanding fundamental plant responses to deficiencies of Zn and other essential trace elements.","lang":"eng"}]},{"publication_status":"published","department":[{"_id":"JuFi"},{"_id":"GradSch"}],"publisher":"Instytut Matematyczny","year":"2020","date_created":"2021-02-25T08:55:03Z","date_updated":"2023-10-17T09:15:53Z","volume":252,"author":[{"id":"4D23B7DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7252-8072","first_name":"Sebastian","last_name":"Hensel","full_name":"Hensel, Sebastian"},{"full_name":"Rosati, Tommaso","last_name":"Rosati","first_name":"Tommaso"}],"month":"03","publication_identifier":{"eissn":["1730-6337"],"issn":["0039-3223"]},"isi":1,"quality_controlled":"1","external_id":{"isi":["000558100500002"],"arxiv":["1709.05202"]},"language":[{"iso":"eng"}],"doi":"10.4064/sm180411-11-2","type":"journal_article","abstract":[{"text":"In order to provide a local description of a regular function in a small neighbourhood of a point x, it is sufficient by Taylor’s theorem to know the value of the function as well as all of its derivatives up to the required order at the point x itself. In other words, one could say that a regular function is locally modelled by the set of polynomials. The theory of regularity structures due to Hairer generalizes this observation and provides an abstract setup, which in the application to singular SPDE extends the set of polynomials by functionals constructed from, e.g., white noise. In this context, the notion of Taylor polynomials is lifted to the notion of so-called modelled distributions. The celebrated reconstruction theorem, which in turn was inspired by Gubinelli’s \\textit {sewing lemma}, is of paramount importance for the theory. It enables one to reconstruct a modelled distribution as a true distribution on Rd which is locally approximated by this extended set of models or “monomials”. In the original work of Hairer, the error is measured by means of Hölder norms. This was then generalized to the whole scale of Besov spaces by Hairer and Labbé. It is the aim of this work to adapt the analytic part of the theory of regularity structures to the scale of Triebel–Lizorkin spaces.","lang":"eng"}],"issue":"3","title":"Modelled distributions of Triebel–Lizorkin type","status":"public","intvolume":" 252","_id":"9196","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","keyword":["General Mathematics"],"scopus_import":"1","day":"01","article_processing_charge":"No","article_type":"original","page":"251-297","publication":"Studia Mathematica","citation":{"ama":"Hensel S, Rosati T. Modelled distributions of Triebel–Lizorkin type. Studia Mathematica. 2020;252(3):251-297. doi:10.4064/sm180411-11-2","apa":"Hensel, S., & Rosati, T. (2020). Modelled distributions of Triebel–Lizorkin type. Studia Mathematica. Instytut Matematyczny. https://doi.org/10.4064/sm180411-11-2","ieee":"S. Hensel and T. Rosati, “Modelled distributions of Triebel–Lizorkin type,” Studia Mathematica, vol. 252, no. 3. Instytut Matematyczny, pp. 251–297, 2020.","ista":"Hensel S, Rosati T. 2020. Modelled distributions of Triebel–Lizorkin type. Studia Mathematica. 252(3), 251–297.","short":"S. Hensel, T. Rosati, Studia Mathematica 252 (2020) 251–297.","mla":"Hensel, Sebastian, and Tommaso Rosati. “Modelled Distributions of Triebel–Lizorkin Type.” Studia Mathematica, vol. 252, no. 3, Instytut Matematyczny, 2020, pp. 251–97, doi:10.4064/sm180411-11-2.","chicago":"Hensel, Sebastian, and Tommaso Rosati. “Modelled Distributions of Triebel–Lizorkin Type.” Studia Mathematica. Instytut Matematyczny, 2020. https://doi.org/10.4064/sm180411-11-2."},"date_published":"2020-03-01T00:00:00Z"},{"oa_version":"Published Version","file":[{"relation":"main_file","file_id":"7484","checksum":"a297f54d1fef0efe4789ca00f37f241e","date_created":"2020-02-11T10:07:28Z","date_updated":"2020-07-14T12:47:59Z","access_level":"open_access","file_name":"2020_PLOSPatho_Dick.pdf","content_type":"application/pdf","file_size":4551246,"creator":"dernst"}],"status":"public","title":"Structures of immature EIAV Gag lattices reveal a conserved role for IP6 in lentivirus assembly","ddc":["570"],"intvolume":" 16","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"7464","abstract":[{"lang":"eng","text":"Retrovirus assembly is driven by the multidomain structural protein Gag. Interactions between the capsid domains (CA) of Gag result in Gag multimerization, leading to an immature virus particle that is formed by a protein lattice based on dimeric, trimeric, and hexameric protein contacts. Among retroviruses the inter- and intra-hexamer contacts differ, especially in the N-terminal sub-domain of CA (CANTD). For HIV-1 the cellular molecule inositol hexakisphosphate (IP6) interacts with and stabilizes the immature hexamer, and is required for production of infectious virus particles. We have used in vitro assembly, cryo-electron tomography and subtomogram averaging, atomistic molecular dynamics simulations and mutational analyses to study the HIV-related lentivirus equine infectious anemia virus (EIAV). In particular, we sought to understand the structural conservation of the immature lentivirus lattice and the role of IP6 in EIAV assembly. Similar to HIV-1, IP6 strongly promoted in vitro assembly of EIAV Gag proteins into virus-like particles (VLPs), which took three morphologically highly distinct forms: narrow tubes, wide tubes, and spheres. Structural characterization of these VLPs to sub-4Å resolution unexpectedly showed that all three morphologies are based on an immature lattice with preserved key structural components, highlighting the structural versatility of CA to form immature assemblies. A direct comparison between EIAV and HIV revealed that both lentiviruses maintain similar immature interfaces, which are established by both conserved and non-conserved residues. In both EIAV and HIV-1, IP6 regulates immature assembly via conserved lysine residues within the CACTD and SP. Lastly, we demonstrate that IP6 stimulates in vitro assembly of immature particles of several other retroviruses in the lentivirus genus, suggesting a conserved role for IP6 in lentiviral assembly."}],"issue":"1","type":"journal_article","date_published":"2020-01-27T00:00:00Z","article_type":"original","publication":"PLOS Pathogens","citation":{"mla":"Dick, Robert A., et al. “Structures of Immature EIAV Gag Lattices Reveal a Conserved Role for IP6 in Lentivirus Assembly.” PLOS Pathogens, vol. 16, no. 1, e1008277, Public Library of Science, 2020, doi:10.1371/journal.ppat.1008277.","short":"R.A. Dick, C. Xu, D.R. Morado, V. Kravchuk, C.L. Ricana, T.D. Lyddon, A.M. Broad, J.R. Feathers, M.C. Johnson, V.M. Vogt, J.R. Perilla, J.A.G. Briggs, F.K. Schur, PLOS Pathogens 16 (2020).","chicago":"Dick, Robert A., Chaoyi Xu, Dustin R. Morado, Vladyslav Kravchuk, Clifton L. Ricana, Terri D. Lyddon, Arianna M. Broad, et al. “Structures of Immature EIAV Gag Lattices Reveal a Conserved Role for IP6 in Lentivirus Assembly.” PLOS Pathogens. Public Library of Science, 2020. https://doi.org/10.1371/journal.ppat.1008277.","ama":"Dick RA, Xu C, Morado DR, et al. Structures of immature EIAV Gag lattices reveal a conserved role for IP6 in lentivirus assembly. PLOS Pathogens. 2020;16(1). doi:10.1371/journal.ppat.1008277","ista":"Dick RA, Xu C, Morado DR, Kravchuk V, Ricana CL, Lyddon TD, Broad AM, Feathers JR, Johnson MC, Vogt VM, Perilla JR, Briggs JAG, Schur FK. 2020. Structures of immature EIAV Gag lattices reveal a conserved role for IP6 in lentivirus assembly. PLOS Pathogens. 16(1), e1008277.","ieee":"R. A. Dick et al., “Structures of immature EIAV Gag lattices reveal a conserved role for IP6 in lentivirus assembly,” PLOS Pathogens, vol. 16, no. 1. Public Library of Science, 2020.","apa":"Dick, R. A., Xu, C., Morado, D. R., Kravchuk, V., Ricana, C. L., Lyddon, T. D., … Schur, F. K. (2020). Structures of immature EIAV Gag lattices reveal a conserved role for IP6 in lentivirus assembly. PLOS Pathogens. Public Library of Science. https://doi.org/10.1371/journal.ppat.1008277"},"day":"27","has_accepted_license":"1","article_processing_charge":"No","scopus_import":"1","date_updated":"2023-10-17T12:29:34Z","date_created":"2020-02-06T18:47:17Z","volume":16,"author":[{"full_name":"Dick, Robert A.","first_name":"Robert A.","last_name":"Dick"},{"first_name":"Chaoyi","last_name":"Xu","full_name":"Xu, Chaoyi"},{"first_name":"Dustin R.","last_name":"Morado","full_name":"Morado, Dustin R."},{"id":"4D62F2A6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9523-9089","first_name":"Vladyslav","last_name":"Kravchuk","full_name":"Kravchuk, Vladyslav"},{"full_name":"Ricana, Clifton L.","first_name":"Clifton L.","last_name":"Ricana"},{"first_name":"Terri D.","last_name":"Lyddon","full_name":"Lyddon, Terri D."},{"full_name":"Broad, Arianna M.","first_name":"Arianna M.","last_name":"Broad"},{"full_name":"Feathers, J. Ryan","last_name":"Feathers","first_name":"J. Ryan"},{"last_name":"Johnson","first_name":"Marc C.","full_name":"Johnson, Marc C."},{"full_name":"Vogt, Volker M.","last_name":"Vogt","first_name":"Volker M."},{"last_name":"Perilla","first_name":"Juan R.","full_name":"Perilla, Juan R."},{"first_name":"John A. G.","last_name":"Briggs","full_name":"Briggs, John A. G."},{"full_name":"Schur, Florian KM","id":"48AD8942-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4790-8078","first_name":"Florian KM","last_name":"Schur"}],"related_material":{"record":[{"relation":"research_data","status":"deleted","id":"9723"}]},"publication_status":"published","publisher":"Public Library of Science","department":[{"_id":"FlSc"}],"year":"2020","pmid":1,"file_date_updated":"2020-07-14T12:47:59Z","article_number":"e1008277","acknowledged_ssus":[{"_id":"ScienComp"}],"language":[{"iso":"eng"}],"doi":"10.1371/journal.ppat.1008277","isi":1,"quality_controlled":"1","project":[{"_id":"26736D6A-B435-11E9-9278-68D0E5697425","grant_number":"P31445","call_identifier":"FWF","name":"Structural conservation and diversity in retroviral capsid"}],"external_id":{"pmid":["31986188"],"isi":["000510746400010"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"month":"01","publication_identifier":{"issn":["1553-7374"]}},{"article_number":"e1007494","file_date_updated":"2020-07-14T12:47:53Z","ec_funded":1,"publication_status":"published","department":[{"_id":"KrCh"}],"publisher":"Public Library of Science","year":"2020","date_updated":"2023-10-17T12:29:47Z","date_created":"2019-12-23T13:45:11Z","volume":16,"author":[{"first_name":"Josef","last_name":"Tkadlec","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1097-9684","full_name":"Tkadlec, Josef"},{"full_name":"Pavlogiannis, Andreas","last_name":"Pavlogiannis","first_name":"Andreas","orcid":"0000-0002-8943-0722","id":"49704004-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"full_name":"Nowak, Martin A.","first_name":"Martin A.","last_name":"Nowak"}],"related_material":{"record":[{"id":"7196","relation":"part_of_dissertation","status":"public"}]},"month":"01","publication_identifier":{"eissn":["15537358"]},"isi":1,"quality_controlled":"1","project":[{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"},{"name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Game Theory"}],"external_id":{"isi":["000510916500025"],"arxiv":["1906.02785"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"language":[{"iso":"eng"}],"doi":"10.1371/journal.pcbi.1007494","type":"journal_article","abstract":[{"text":"The fixation probability of a single mutant invading a population of residents is among the most widely-studied quantities in evolutionary dynamics. Amplifiers of natural selection are population structures that increase the fixation probability of advantageous mutants, compared to well-mixed populations. Extensive studies have shown that many amplifiers exist for the Birth-death Moran process, some of them substantially increasing the fixation probability or even guaranteeing fixation in the limit of large population size. On the other hand, no amplifiers are known for the death-Birth Moran process, and computer-assisted exhaustive searches have failed to discover amplification. In this work we resolve this disparity, by showing that any amplification under death-Birth updating is necessarily bounded and transient. Our boundedness result states that even if a population structure does amplify selection, the resulting fixation probability is close to that of the well-mixed population. Our transience result states that for any population structure there exists a threshold r⋆ such that the population structure ceases to amplify selection if the mutant fitness advantage r is larger than r⋆. Finally, we also extend the above results to δ-death-Birth updating, which is a combination of Birth-death and death-Birth updating. On the positive side, we identify population structures that maintain amplification for a wide range of values r and δ. These results demonstrate that amplification of natural selection depends on the specific mechanisms of the evolutionary process.","lang":"eng"}],"ddc":["000"],"status":"public","title":"Limits on amplifiers of natural selection under death-Birth updating","intvolume":" 16","_id":"7212","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"relation":"main_file","file_id":"7441","date_updated":"2020-07-14T12:47:53Z","date_created":"2020-02-03T07:32:42Z","checksum":"ce32ee2d2f53aed832f78bbd47e882df","file_name":"2020_PlosCompBio_Tkadlec.pdf","access_level":"open_access","file_size":1817531,"content_type":"application/pdf","creator":"dernst"}],"oa_version":"Published Version","scopus_import":"1","day":"17","article_processing_charge":"No","has_accepted_license":"1","article_type":"original","publication":"PLoS computational biology","citation":{"ieee":"J. Tkadlec, A. Pavlogiannis, K. Chatterjee, and M. A. Nowak, “Limits on amplifiers of natural selection under death-Birth updating,” PLoS computational biology, vol. 16. Public Library of Science, 2020.","apa":"Tkadlec, J., Pavlogiannis, A., Chatterjee, K., & Nowak, M. A. (2020). Limits on amplifiers of natural selection under death-Birth updating. PLoS Computational Biology. Public Library of Science. https://doi.org/10.1371/journal.pcbi.1007494","ista":"Tkadlec J, Pavlogiannis A, Chatterjee K, Nowak MA. 2020. Limits on amplifiers of natural selection under death-Birth updating. PLoS computational biology. 16, e1007494.","ama":"Tkadlec J, Pavlogiannis A, Chatterjee K, Nowak MA. Limits on amplifiers of natural selection under death-Birth updating. PLoS computational biology. 2020;16. doi:10.1371/journal.pcbi.1007494","chicago":"Tkadlec, Josef, Andreas Pavlogiannis, Krishnendu Chatterjee, and Martin A. Nowak. “Limits on Amplifiers of Natural Selection under Death-Birth Updating.” PLoS Computational Biology. Public Library of Science, 2020. https://doi.org/10.1371/journal.pcbi.1007494.","short":"J. Tkadlec, A. Pavlogiannis, K. Chatterjee, M.A. Nowak, PLoS Computational Biology 16 (2020).","mla":"Tkadlec, Josef, et al. “Limits on Amplifiers of Natural Selection under Death-Birth Updating.” PLoS Computational Biology, vol. 16, e1007494, Public Library of Science, 2020, doi:10.1371/journal.pcbi.1007494."},"date_published":"2020-01-17T00:00:00Z"},{"date_created":"2019-12-20T12:26:36Z","date_updated":"2023-10-17T12:29:46Z","author":[{"id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1097-9684","first_name":"Josef","last_name":"Tkadlec","full_name":"Tkadlec, Josef"}],"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"7210"},{"id":"5751","relation":"dissertation_contains","status":"public"},{"id":"7212","relation":"dissertation_contains","status":"public"}]},"publication_status":"published","publisher":"Institute of Science and Technology Austria","department":[{"_id":"KrCh"},{"_id":"GradSch"}],"year":"2020","file_date_updated":"2020-07-14T12:47:52Z","supervisor":[{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"}],"degree_awarded":"PhD","language":[{"iso":"eng"}],"doi":"10.15479/AT:ISTA:7196","oa":1,"month":"01","publication_identifier":{"eissn":["2663-337X"]},"file":[{"file_name":"thesis.zip","access_level":"closed","file_size":21100497,"content_type":"application/zip","creator":"jtkadlec","relation":"source_file","file_id":"7255","date_updated":"2020-07-14T12:47:52Z","date_created":"2020-01-12T11:49:49Z","checksum":"451f8e64b0eb26bf297644ac72bfcbe9"},{"file_name":"2020_Tkadlec_Thesis.pdf","access_level":"open_access","creator":"dernst","content_type":"application/pdf","file_size":11670983,"file_id":"7367","relation":"main_file","date_updated":"2020-07-14T12:47:52Z","date_created":"2020-01-28T07:32:42Z","checksum":"d8c44cbc4f939c49a8efc9d4b8bb3985"}],"oa_version":"Published Version","status":"public","title":"A role of graphs in evolutionary processes","ddc":["519"],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"7196","abstract":[{"text":"In this thesis we study certain mathematical aspects of evolution. The two primary forces that drive an evolutionary process are mutation and selection. Mutation generates new variants in a population. Selection chooses among the variants depending on the reproductive rates of individuals. Evolutionary processes are intrinsically random – a new mutation that is initially present in the population at low frequency can go extinct, even if it confers a reproductive advantage. The overall rate of evolution is largely determined by two quantities: the probability that an invading advantageous mutation spreads through the population (called fixation probability) and the time until it does so (called fixation time). Both those quantities crucially depend not only on the strength of the invading mutation but also on the population structure. In this thesis, we aim to understand how the underlying population structure affects the overall rate of evolution. Specifically, we study population structures that increase the fixation probability of advantageous mutants (called amplifiers of selection). Broadly speaking, our results are of three different types: We present various strong amplifiers, we identify regimes under which only limited amplification is feasible, and we propose population structures that provide different tradeoffs between high fixation probability and short fixation time.","lang":"eng"}],"alternative_title":["ISTA Thesis"],"type":"dissertation","date_published":"2020-01-12T00:00:00Z","page":"144","citation":{"chicago":"Tkadlec, Josef. “A Role of Graphs in Evolutionary Processes.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:7196.","mla":"Tkadlec, Josef. A Role of Graphs in Evolutionary Processes. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:7196.","short":"J. Tkadlec, A Role of Graphs in Evolutionary Processes, Institute of Science and Technology Austria, 2020.","ista":"Tkadlec J. 2020. A role of graphs in evolutionary processes. Institute of Science and Technology Austria.","apa":"Tkadlec, J. (2020). A role of graphs in evolutionary processes. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:7196","ieee":"J. Tkadlec, “A role of graphs in evolutionary processes,” Institute of Science and Technology Austria, 2020.","ama":"Tkadlec J. A role of graphs in evolutionary processes. 2020. doi:10.15479/AT:ISTA:7196"},"day":"12","article_processing_charge":"No","has_accepted_license":"1"},{"article_processing_charge":"No","has_accepted_license":"1","day":"13","date_published":"2020-07-13T00:00:00Z","page":"8773-8784","citation":{"short":"A. Shevchenko, M. Mondelli, in:, Proceedings of the 37th International Conference on Machine Learning, ML Research Press, 2020, pp. 8773–8784.","mla":"Shevchenko, Alexander, and Marco Mondelli. “Landscape Connectivity and Dropout Stability of SGD Solutions for Over-Parameterized Neural Networks.” Proceedings of the 37th International Conference on Machine Learning, vol. 119, ML Research Press, 2020, pp. 8773–84.","chicago":"Shevchenko, Alexander, and Marco Mondelli. “Landscape Connectivity and Dropout Stability of SGD Solutions for Over-Parameterized Neural Networks.” In Proceedings of the 37th International Conference on Machine Learning, 119:8773–84. ML Research Press, 2020.","ama":"Shevchenko A, Mondelli M. Landscape connectivity and dropout stability of SGD solutions for over-parameterized neural networks. In: Proceedings of the 37th International Conference on Machine Learning. Vol 119. ML Research Press; 2020:8773-8784.","ieee":"A. Shevchenko and M. Mondelli, “Landscape connectivity and dropout stability of SGD solutions for over-parameterized neural networks,” in Proceedings of the 37th International Conference on Machine Learning, 2020, vol. 119, pp. 8773–8784.","apa":"Shevchenko, A., & Mondelli, M. (2020). Landscape connectivity and dropout stability of SGD solutions for over-parameterized neural networks. In Proceedings of the 37th International Conference on Machine Learning (Vol. 119, pp. 8773–8784). ML Research Press.","ista":"Shevchenko A, Mondelli M. 2020. Landscape connectivity and dropout stability of SGD solutions for over-parameterized neural networks. Proceedings of the 37th International Conference on Machine Learning. vol. 119, 8773–8784."},"publication":"Proceedings of the 37th International Conference on Machine Learning","abstract":[{"text":"The optimization of multilayer neural networks typically leads to a solution\r\nwith zero training error, yet the landscape can exhibit spurious local minima\r\nand the minima can be disconnected. In this paper, we shed light on this\r\nphenomenon: we show that the combination of stochastic gradient descent (SGD)\r\nand over-parameterization makes the landscape of multilayer neural networks\r\napproximately connected and thus more favorable to optimization. More\r\nspecifically, we prove that SGD solutions are connected via a piecewise linear\r\npath, and the increase in loss along this path vanishes as the number of\r\nneurons grows large. This result is a consequence of the fact that the\r\nparameters found by SGD are increasingly dropout stable as the network becomes\r\nwider. We show that, if we remove part of the neurons (and suitably rescale the\r\nremaining ones), the change in loss is independent of the total number of\r\nneurons, and it depends only on how many neurons are left. Our results exhibit\r\na mild dependence on the input dimension: they are dimension-free for two-layer\r\nnetworks and depend linearly on the dimension for multilayer networks. We\r\nvalidate our theoretical findings with numerical experiments for different\r\narchitectures and classification tasks.","lang":"eng"}],"type":"conference","oa_version":"Published Version","file":[{"date_updated":"2021-03-02T15:38:14Z","date_created":"2021-03-02T15:38:14Z","checksum":"f042c8d4316bd87c6361aa76f1fbdbbe","success":1,"relation":"main_file","file_id":"9217","file_size":5336380,"content_type":"application/pdf","creator":"dernst","file_name":"2020_PMLR_Shevchenko.pdf","access_level":"open_access"}],"intvolume":" 119","status":"public","title":"Landscape connectivity and dropout stability of SGD solutions for over-parameterized neural networks","ddc":["000"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"9198","month":"07","language":[{"iso":"eng"}],"project":[{"_id":"059876FA-7A3F-11EA-A408-12923DDC885E","name":"Prix Lopez-Loretta 2019 - Marco Mondelli"}],"quality_controlled":"1","oa":1,"external_id":{"arxiv":["1912.10095"]},"file_date_updated":"2021-03-02T15:38:14Z","volume":119,"date_created":"2021-02-25T09:36:22Z","date_updated":"2023-10-17T12:43:19Z","author":[{"full_name":"Shevchenko, Alexander","last_name":"Shevchenko","first_name":"Alexander"},{"first_name":"Marco","last_name":"Mondelli","id":"27EB676C-8706-11E9-9510-7717E6697425","orcid":"0000-0002-3242-7020","full_name":"Mondelli, Marco"}],"department":[{"_id":"MaMo"}],"publisher":"ML Research Press","publication_status":"published","acknowledgement":"M. Mondelli was partially supported by the 2019 LopezLoreta Prize. The authors thank Phan-Minh Nguyen for helpful discussions and the IST Distributed Algorithms and Systems Lab for providing computational resources.","year":"2020"},{"month":"06","publication_identifier":{"issn":["2544-7297"]},"language":[{"iso":"eng"}],"doi":"10.1515/cmb-2020-0100","quality_controlled":"1","project":[{"name":"Alpha Shape Theory Extended","call_identifier":"H2020","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","grant_number":"788183"},{"name":"Persistence and stability of geometric complexes","call_identifier":"FWF","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","grant_number":"I02979-N35"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"file_date_updated":"2021-02-19T13:56:24Z","ec_funded":1,"date_updated":"2023-10-17T12:34:51Z","date_created":"2021-02-17T15:13:01Z","volume":8,"author":[{"last_name":"Akopyan","first_name":"Arseniy","orcid":"0000-0002-2548-617X","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","full_name":"Akopyan, Arseniy"},{"full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","first_name":"Herbert","last_name":"Edelsbrunner"}],"publication_status":"published","publisher":"De Gruyter","department":[{"_id":"HeEd"}],"acknowledgement":"The authors of this paper thank Roland Roth for suggesting the analysis of the weighted\r\ncurvature derivatives for the purpose of improving molecular dynamics simulations and for his continued encouragement. They also thank Patrice Koehl for the implementation of the formulas and for his encouragement and advise along the road. Finally, they thank two anonymous reviewers for their constructive criticism.\r\nThis project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 78818 Alpha). It is also partially supported by the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, through grant no. I02979-N35 of the Austrian Science Fund (FWF).","year":"2020","day":"20","article_processing_charge":"No","has_accepted_license":"1","date_published":"2020-06-20T00:00:00Z","article_type":"original","page":"51-67","publication":"Computational and Mathematical Biophysics","citation":{"chicago":"Akopyan, Arseniy, and Herbert Edelsbrunner. “The Weighted Mean Curvature Derivative of a Space-Filling Diagram.” Computational and Mathematical Biophysics. De Gruyter, 2020. https://doi.org/10.1515/cmb-2020-0100.","mla":"Akopyan, Arseniy, and Herbert Edelsbrunner. “The Weighted Mean Curvature Derivative of a Space-Filling Diagram.” Computational and Mathematical Biophysics, vol. 8, no. 1, De Gruyter, 2020, pp. 51–67, doi:10.1515/cmb-2020-0100.","short":"A. Akopyan, H. Edelsbrunner, Computational and Mathematical Biophysics 8 (2020) 51–67.","ista":"Akopyan A, Edelsbrunner H. 2020. The weighted mean curvature derivative of a space-filling diagram. Computational and Mathematical Biophysics. 8(1), 51–67.","apa":"Akopyan, A., & Edelsbrunner, H. (2020). The weighted mean curvature derivative of a space-filling diagram. Computational and Mathematical Biophysics. De Gruyter. https://doi.org/10.1515/cmb-2020-0100","ieee":"A. Akopyan and H. Edelsbrunner, “The weighted mean curvature derivative of a space-filling diagram,” Computational and Mathematical Biophysics, vol. 8, no. 1. De Gruyter, pp. 51–67, 2020.","ama":"Akopyan A, Edelsbrunner H. The weighted mean curvature derivative of a space-filling diagram. Computational and Mathematical Biophysics. 2020;8(1):51-67. doi:10.1515/cmb-2020-0100"},"abstract":[{"lang":"eng","text":"Representing an atom by a solid sphere in 3-dimensional Euclidean space, we get the space-filling diagram of a molecule by taking the union. Molecular dynamics simulates its motion subject to bonds and other forces, including the solvation free energy. The morphometric approach [12, 17] writes the latter as a linear combination of weighted versions of the volume, area, mean curvature, and Gaussian curvature of the space-filling diagram. We give a formula for the derivative of the weighted mean curvature. Together with the derivatives of the weighted volume in [7], the weighted area in [3], and the weighted Gaussian curvature [1], this yields the derivative of the morphometric expression of the solvation free energy."}],"issue":"1","type":"journal_article","file":[{"date_updated":"2021-02-19T13:56:24Z","date_created":"2021-02-19T13:56:24Z","success":1,"checksum":"cea41de9937d07a3b927d71ee8b4e432","file_id":"9171","relation":"main_file","creator":"dernst","content_type":"application/pdf","file_size":562359,"file_name":"2020_CompMathBiophysics_Akopyan2.pdf","access_level":"open_access"}],"oa_version":"Published Version","status":"public","title":"The weighted mean curvature derivative of a space-filling diagram","ddc":["510"],"intvolume":" 8","_id":"9157","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"publication_identifier":{"issn":["2544-7297"]},"month":"07","project":[{"name":"Alpha Shape Theory Extended","call_identifier":"H2020","grant_number":"788183","_id":"266A2E9E-B435-11E9-9278-68D0E5697425"},{"name":"Persistence and stability of geometric complexes","call_identifier":"FWF","grant_number":"I02979-N35","_id":"2561EBF4-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"arxiv":["1908.06777"]},"language":[{"iso":"eng"}],"doi":"10.1515/cmb-2020-0101","ec_funded":1,"file_date_updated":"2021-02-19T13:33:19Z","department":[{"_id":"HeEd"}],"publisher":"De Gruyter","publication_status":"published","year":"2020","acknowledgement":"The authors of this paper thank Roland Roth for suggesting the analysis of theweighted\r\ncurvature derivatives for the purpose of improving molecular dynamics simulations. They also thank Patrice Koehl for the implementation of the formulas and for his encouragement and advise along the road. Finally, they thank two anonymous reviewers for their constructive criticism.\r\nThis project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 78818 Alpha). It is also partially supported by the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, through grant no. I02979-N35 of the Austrian Science Fund (FWF).","volume":8,"date_created":"2021-02-17T15:12:44Z","date_updated":"2023-10-17T12:35:10Z","author":[{"full_name":"Akopyan, Arseniy","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2548-617X","first_name":"Arseniy","last_name":"Akopyan"},{"full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","first_name":"Herbert","last_name":"Edelsbrunner"}],"article_processing_charge":"No","has_accepted_license":"1","day":"21","page":"74-88","article_type":"original","citation":{"mla":"Akopyan, Arseniy, and Herbert Edelsbrunner. “The Weighted Gaussian Curvature Derivative of a Space-Filling Diagram.” Computational and Mathematical Biophysics, vol. 8, no. 1, De Gruyter, 2020, pp. 74–88, doi:10.1515/cmb-2020-0101.","short":"A. Akopyan, H. Edelsbrunner, Computational and Mathematical Biophysics 8 (2020) 74–88.","chicago":"Akopyan, Arseniy, and Herbert Edelsbrunner. “The Weighted Gaussian Curvature Derivative of a Space-Filling Diagram.” Computational and Mathematical Biophysics. De Gruyter, 2020. https://doi.org/10.1515/cmb-2020-0101.","ama":"Akopyan A, Edelsbrunner H. The weighted Gaussian curvature derivative of a space-filling diagram. Computational and Mathematical Biophysics. 2020;8(1):74-88. doi:10.1515/cmb-2020-0101","ista":"Akopyan A, Edelsbrunner H. 2020. The weighted Gaussian curvature derivative of a space-filling diagram. Computational and Mathematical Biophysics. 8(1), 74–88.","ieee":"A. Akopyan and H. Edelsbrunner, “The weighted Gaussian curvature derivative of a space-filling diagram,” Computational and Mathematical Biophysics, vol. 8, no. 1. De Gruyter, pp. 74–88, 2020.","apa":"Akopyan, A., & Edelsbrunner, H. (2020). The weighted Gaussian curvature derivative of a space-filling diagram. Computational and Mathematical Biophysics. De Gruyter. https://doi.org/10.1515/cmb-2020-0101"},"publication":"Computational and Mathematical Biophysics","date_published":"2020-07-21T00:00:00Z","type":"journal_article","issue":"1","abstract":[{"lang":"eng","text":"The morphometric approach [11, 14] writes the solvation free energy as a linear combination of weighted versions of the volume, area, mean curvature, and Gaussian curvature of the space-filling diagram. We give a formula for the derivative of the weighted Gaussian curvature. Together with the derivatives of the weighted volume in [7], the weighted area in [4], and the weighted mean curvature in [1], this yields the derivative of the morphometric expression of solvation free energy."}],"intvolume":" 8","title":"The weighted Gaussian curvature derivative of a space-filling diagram","ddc":["510"],"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"9156","oa_version":"Published Version","file":[{"relation":"main_file","file_id":"9170","checksum":"ca43a7440834eab6bbea29c59b56ef3a","success":1,"date_created":"2021-02-19T13:33:19Z","date_updated":"2021-02-19T13:33:19Z","access_level":"open_access","file_name":"2020_CompMathBiophysics_Akopyan.pdf","content_type":"application/pdf","file_size":707452,"creator":"dernst"}]},{"ec_funded":1,"file_date_updated":"2020-12-28T08:24:08Z","article_number":"138","volume":25,"date_created":"2020-12-27T23:01:17Z","date_updated":"2023-10-17T12:51:56Z","author":[{"first_name":"Frank","last_name":"Redig","full_name":"Redig, Frank"},{"first_name":"Ellen","last_name":"Saada","full_name":"Saada, Ellen"},{"full_name":"Sau, Federico","id":"E1836206-9F16-11E9-8814-AEFDE5697425","first_name":"Federico","last_name":"Sau"}],"department":[{"_id":"JaMa"}],"publisher":" Institute of Mathematical Statistics","publication_status":"published","acknowledgement":"We warmly thank S.R.S. Varadhan for many enlightening discussions at an early stage of this work. We are indebted to Francesca Collet for fruitful discussions and constant support all throughout this work. We thank Simone Floreani\r\nand Alberto Chiarini for helpful conversations on the final part of this paper as well as both referees for their careful reading and for raising relevant issues on some weak points contained in a previous version of this manuscript; we believe this helped us to improve it.\r\nPart of this work was done during the authors’ stay at the Institut Henri Poincaré (UMS 5208 CNRS-Sorbonne Université) – Centre Emile Borel during the trimester Stochastic Dynamics Out of Equilibrium. The authors thank this institution for hospitality and support (through LabEx CARMIN, ANR-10-LABX-59-01). F.S. thanks laboratoire\r\nMAP5 of Université de Paris, and E.S. thanks Delft University, for financial support and hospitality. F.S. acknowledges NWO for financial support via the TOP1 grant 613.001.552 as well as funding from the European Union’s Horizon 2020 research and innovation programme under the Marie-Skłodowska-Curie grant agreement No. 754411. This research has been conducted within the FP2M federation (CNRS FR 2036).","year":"2020","publication_identifier":{"eissn":["1083-6489"]},"month":"10","language":[{"iso":"eng"}],"doi":"10.1214/20-EJP536","project":[{"grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020"}],"quality_controlled":"1","isi":1,"oa":1,"external_id":{"isi":["000591737500001"],"arxiv":["1811.01366"]},"abstract":[{"text":"We consider the symmetric simple exclusion process in Zd with quenched bounded dynamic random conductances and prove its hydrodynamic limit in path space. The main tool is the connection, due to the self-duality of the process, between the invariance principle for single particles starting from all points and the macroscopic behavior of the density field. While the hydrodynamic limit at fixed macroscopic times is obtained via a generalization to the time-inhomogeneous context of the strategy introduced in [41], in order to prove tightness for the sequence of empirical density fields we develop a new criterion based on the notion of uniform conditional stochastic continuity, following [50]. In conclusion, we show that uniform elliptic dynamic conductances provide an example of environments in which the so-called arbitrary starting point invariance principle may be derived from the invariance principle of a single particle starting from the origin. Therefore, our hydrodynamics result applies to the examples of quenched environments considered in, e.g., [1], [3], [6] in combination with the hypothesis of uniform ellipticity.","lang":"eng"}],"type":"journal_article","oa_version":"Published Version","file":[{"date_updated":"2020-12-28T08:24:08Z","date_created":"2020-12-28T08:24:08Z","success":1,"checksum":"d75359b9814e78d57c0a481b7cde3751","file_id":"8976","relation":"main_file","creator":"dernst","content_type":"application/pdf","file_size":696653,"file_name":"2020_ElectronJProbab_Redig.pdf","access_level":"open_access"}],"intvolume":" 25","ddc":["510"],"title":"Symmetric simple exclusion process in dynamic environment: Hydrodynamics","status":"public","_id":"8973","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","has_accepted_license":"1","day":"21","scopus_import":"1","date_published":"2020-10-21T00:00:00Z","article_type":"original","citation":{"short":"F. Redig, E. Saada, F. Sau, Electronic Journal of Probability 25 (2020).","mla":"Redig, Frank, et al. “Symmetric Simple Exclusion Process in Dynamic Environment: Hydrodynamics.” Electronic Journal of Probability, vol. 25, 138, Institute of Mathematical Statistics, 2020, doi:10.1214/20-EJP536.","chicago":"Redig, Frank, Ellen Saada, and Federico Sau. “Symmetric Simple Exclusion Process in Dynamic Environment: Hydrodynamics.” Electronic Journal of Probability. Institute of Mathematical Statistics, 2020. https://doi.org/10.1214/20-EJP536.","ama":"Redig F, Saada E, Sau F. Symmetric simple exclusion process in dynamic environment: Hydrodynamics. Electronic Journal of Probability. 2020;25. doi:10.1214/20-EJP536","ieee":"F. Redig, E. Saada, and F. Sau, “Symmetric simple exclusion process in dynamic environment: Hydrodynamics,” Electronic Journal of Probability, vol. 25. Institute of Mathematical Statistics, 2020.","apa":"Redig, F., Saada, E., & Sau, F. (2020). Symmetric simple exclusion process in dynamic environment: Hydrodynamics. Electronic Journal of Probability. Institute of Mathematical Statistics. https://doi.org/10.1214/20-EJP536","ista":"Redig F, Saada E, Sau F. 2020. Symmetric simple exclusion process in dynamic environment: Hydrodynamics. Electronic Journal of Probability. 25, 138."},"publication":"Electronic Journal of Probability"},{"type":"journal_article","abstract":[{"text":"An asymptotic formula is established for the number of rational points of bounded anticanonical height which lie on a certain Zariski dense subset of the biprojective hypersurface x1y21+⋯+x4y24=0 in ℙ3×ℙ3. This confirms the modified Manin conjecture for this variety, in which the removal of a thin set of rational points is allowed.","lang":"eng"}],"issue":"16","status":"public","title":"Density of rational points on a quadric bundle in ℙ3×ℙ3","intvolume":" 169","_id":"179","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","day":"10","article_processing_charge":"No","article_type":"original","page":"3099-3165","publication":"Duke Mathematical Journal","citation":{"ama":"Browning TD, Heath Brown R. Density of rational points on a quadric bundle in ℙ3×ℙ3. Duke Mathematical Journal. 2020;169(16):3099-3165. doi:10.1215/00127094-2020-0031","apa":"Browning, T. D., & Heath Brown, R. (2020). Density of rational points on a quadric bundle in ℙ3×ℙ3. Duke Mathematical Journal. Duke University Press. https://doi.org/10.1215/00127094-2020-0031","ieee":"T. D. Browning and R. Heath Brown, “Density of rational points on a quadric bundle in ℙ3×ℙ3,” Duke Mathematical Journal, vol. 169, no. 16. Duke University Press, pp. 3099–3165, 2020.","ista":"Browning TD, Heath Brown R. 2020. Density of rational points on a quadric bundle in ℙ3×ℙ3. Duke Mathematical Journal. 169(16), 3099–3165.","short":"T.D. Browning, R. Heath Brown, Duke Mathematical Journal 169 (2020) 3099–3165.","mla":"Browning, Timothy D., and Roger Heath Brown. “Density of Rational Points on a Quadric Bundle in ℙ3×ℙ3.” Duke Mathematical Journal, vol. 169, no. 16, Duke University Press, 2020, pp. 3099–165, doi:10.1215/00127094-2020-0031.","chicago":"Browning, Timothy D, and Roger Heath Brown. “Density of Rational Points on a Quadric Bundle in ℙ3×ℙ3.” Duke Mathematical Journal. Duke University Press, 2020. https://doi.org/10.1215/00127094-2020-0031."},"date_published":"2020-09-10T00:00:00Z","publication_status":"published","publisher":"Duke University Press","department":[{"_id":"TiBr"}],"year":"2020","date_created":"2018-12-11T11:45:02Z","date_updated":"2023-10-17T12:51:10Z","volume":169,"author":[{"full_name":"Browning, Timothy D","last_name":"Browning","first_name":"Timothy D","orcid":"0000-0002-8314-0177","id":"35827D50-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Heath Brown, Roger","first_name":"Roger","last_name":"Heath Brown"}],"month":"09","publication_identifier":{"issn":["0012-7094"]},"isi":1,"quality_controlled":"1","external_id":{"isi":["000582676300002"],"arxiv":["1805.10715"]},"oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1805.10715"}],"language":[{"iso":"eng"}],"doi":"10.1215/00127094-2020-0031"},{"abstract":[{"text":"Data and mathematica notebooks for plotting figures from Language learning with communication between learners","lang":"eng"}],"type":"research_data_reference","oa_version":"Published Version","date_updated":"2023-10-18T06:36:00Z","date_created":"2021-08-06T13:09:57Z","related_material":{"record":[{"id":"198","relation":"used_in_publication","status":"public"}]},"author":[{"full_name":"Ibsen-Jensen, Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4783-0389","first_name":"Rasmus","last_name":"Ibsen-Jensen"},{"last_name":"Tkadlec","first_name":"Josef","orcid":"0000-0002-1097-9684","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","full_name":"Tkadlec, Josef"},{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"full_name":"Nowak, Martin","first_name":"Martin","last_name":"Nowak"}],"publisher":"Royal Society","department":[{"_id":"KrCh"}],"status":"public","title":"Data and mathematica notebooks for plotting figures from language learning with communication between learners from language acquisition with communication between learners","_id":"9814","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","year":"2020","article_processing_charge":"No","month":"10","day":"15","date_published":"2020-10-15T00:00:00Z","doi":"10.6084/m9.figshare.5973013.v1","citation":{"ama":"Ibsen-Jensen R, Tkadlec J, Chatterjee K, Nowak M. Data and mathematica notebooks for plotting figures from language learning with communication between learners from language acquisition with communication between learners. 2020. doi:10.6084/m9.figshare.5973013.v1","ista":"Ibsen-Jensen R, Tkadlec J, Chatterjee K, Nowak M. 2020. Data and mathematica notebooks for plotting figures from language learning with communication between learners from language acquisition with communication between learners, Royal Society, 10.6084/m9.figshare.5973013.v1.","apa":"Ibsen-Jensen, R., Tkadlec, J., Chatterjee, K., & Nowak, M. (2020). Data and mathematica notebooks for plotting figures from language learning with communication between learners from language acquisition with communication between learners. Royal Society. https://doi.org/10.6084/m9.figshare.5973013.v1","ieee":"R. Ibsen-Jensen, J. Tkadlec, K. Chatterjee, and M. Nowak, “Data and mathematica notebooks for plotting figures from language learning with communication between learners from language acquisition with communication between learners.” Royal Society, 2020.","mla":"Ibsen-Jensen, Rasmus, et al. Data and Mathematica Notebooks for Plotting Figures from Language Learning with Communication between Learners from Language Acquisition with Communication between Learners. Royal Society, 2020, doi:10.6084/m9.figshare.5973013.v1.","short":"R. Ibsen-Jensen, J. Tkadlec, K. Chatterjee, M. Nowak, (2020).","chicago":"Ibsen-Jensen, Rasmus, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. “Data and Mathematica Notebooks for Plotting Figures from Language Learning with Communication between Learners from Language Acquisition with Communication between Learners.” Royal Society, 2020. https://doi.org/10.6084/m9.figshare.5973013.v1."},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.6084/m9.figshare.5973013.v1"}],"oa":1},{"publication_identifier":{"eissn":["1079-7114"],"issn":["0031-9007"]},"month":"07","doi":"10.1103/PhysRevLett.125.043202","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://arxiv.org/abs/1912.10218","open_access":"1"}],"external_id":{"arxiv":["1912.10218"],"pmid":["32794788"],"isi":["000552227400008"]},"oa":1,"isi":1,"quality_controlled":"1","article_number":"043202","author":[{"full_name":"Malia, Benjamin K.","last_name":"Malia","first_name":"Benjamin K."},{"full_name":"Martínez-Rincón, Julián","last_name":"Martínez-Rincón","first_name":"Julián"},{"first_name":"Yunfan","last_name":"Wu","full_name":"Wu, Yunfan"},{"orcid":"0000-0002-2031-204X","id":"4C02D85E-F248-11E8-B48F-1D18A9856A87","last_name":"Hosten","first_name":"Onur","full_name":"Hosten, Onur"},{"first_name":"Mark A.","last_name":"Kasevich","full_name":"Kasevich, Mark A."}],"volume":125,"date_updated":"2023-10-18T08:38:35Z","date_created":"2020-08-24T06:24:04Z","pmid":1,"year":"2020","acknowledgement":"This work is supported by the Office of Naval Research (N00014-16-1-2927- A00003), Vannevar Bush Faculty Fellowship (N00014-16-1-2812- P00005), Department of Energy (DE-SC0019174- 0001), and Defense Threat Reduction Agency (HDTRA1-15-1-0017- P00005).","department":[{"_id":"OnHo"}],"publisher":"American Physical Society","publication_status":"published","article_processing_charge":"No","day":"24","scopus_import":"1","date_published":"2020-07-24T00:00:00Z","citation":{"chicago":"Malia, Benjamin K., Julián Martínez-Rincón, Yunfan Wu, Onur Hosten, and Mark A. Kasevich. “Free Space Ramsey Spectroscopy in Rubidium with Noise below the Quantum Projection Limit.” Physical Review Letters. American Physical Society, 2020. https://doi.org/10.1103/PhysRevLett.125.043202.","mla":"Malia, Benjamin K., et al. “Free Space Ramsey Spectroscopy in Rubidium with Noise below the Quantum Projection Limit.” Physical Review Letters, vol. 125, no. 4, 043202, American Physical Society, 2020, doi:10.1103/PhysRevLett.125.043202.","short":"B.K. Malia, J. Martínez-Rincón, Y. Wu, O. Hosten, M.A. Kasevich, Physical Review Letters 125 (2020).","ista":"Malia BK, Martínez-Rincón J, Wu Y, Hosten O, Kasevich MA. 2020. Free space Ramsey spectroscopy in rubidium with noise below the quantum projection limit. Physical Review Letters. 125(4), 043202.","ieee":"B. K. Malia, J. Martínez-Rincón, Y. Wu, O. Hosten, and M. A. Kasevich, “Free space Ramsey spectroscopy in rubidium with noise below the quantum projection limit,” Physical Review Letters, vol. 125, no. 4. American Physical Society, 2020.","apa":"Malia, B. K., Martínez-Rincón, J., Wu, Y., Hosten, O., & Kasevich, M. A. (2020). Free space Ramsey spectroscopy in rubidium with noise below the quantum projection limit. Physical Review Letters. American Physical Society. https://doi.org/10.1103/PhysRevLett.125.043202","ama":"Malia BK, Martínez-Rincón J, Wu Y, Hosten O, Kasevich MA. Free space Ramsey spectroscopy in rubidium with noise below the quantum projection limit. Physical Review Letters. 2020;125(4). doi:10.1103/PhysRevLett.125.043202"},"publication":"Physical Review Letters","article_type":"original","issue":"4","abstract":[{"text":"We demonstrate the utility of optical cavity generated spin-squeezed states in free space atomic fountain clocks in ensembles of 390 000 87Rb atoms. Fluorescence imaging, correlated to an initial quantum nondemolition measurement, is used for population spectroscopy after the atoms are released from a confining lattice. For a free fall time of 4 milliseconds, we resolve a single-shot phase sensitivity of 814(61) microradians, which is 5.8(0.6) decibels (dB) below the quantum projection limit. We observe that this squeezing is preserved as the cloud expands to a roughly 200 μm radius and falls roughly 300 μm in free space. Ramsey spectroscopy with 240 000 atoms at a 3.6 ms Ramsey time results in a single-shot fractional frequency stability of 8.4(0.2)×10−12, 3.8(0.2) dB below the quantum projection limit. The sensitivity and stability are limited by the technical noise in the fluorescence detection protocol and the microwave system, respectively.","lang":"eng"}],"type":"journal_article","oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"8285","intvolume":" 125","title":"Free space Ramsey spectroscopy in rubidium with noise below the quantum projection limit","status":"public"},{"date_created":"2021-11-21T23:01:31Z","date_updated":"2023-10-18T08:32:34Z","oa_version":"None","author":[{"last_name":"Lambert","first_name":"Nicholas J.","full_name":"Lambert, Nicholas J."},{"full_name":"Mobassem, Sonia","last_name":"Mobassem","first_name":"Sonia"},{"full_name":"Rueda Sanchez, Alfredo R","id":"3B82B0F8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6249-5860","first_name":"Alfredo R","last_name":"Rueda Sanchez"},{"full_name":"Schwefel, Harald G.L.","first_name":"Harald G.L.","last_name":"Schwefel"}],"status":"public","publication_status":"published","title":"New designs and noise channels in electro-optic microwave to optical up-conversion","department":[{"_id":"JoFi"}],"publisher":"Optica Publishing Group","_id":"10328","year":"2020","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"We discus noise channels in coherent electro-optic up-conversion between microwave and optical fields, in particular due to optical heating. We also report on a novel configuration, which promises to be flexible and highly efficient.","lang":"eng"}],"alternative_title":["OSA Technical Digest"],"article_number":"QTu8A.1","type":"conference","language":[{"iso":"eng"}],"conference":{"name":"OSA: Optical Society of America","location":"Washington, DC, United States","start_date":"2020-09-14","end_date":"2020-09-17"},"date_published":"2020-01-01T00:00:00Z","doi":"10.1364/QUANTUM.2020.QTu8A.1","quality_controlled":"1","publication":"OSA Quantum 2.0 Conference","citation":{"chicago":"Lambert, Nicholas J., Sonia Mobassem, Alfredo R Rueda Sanchez, and Harald G.L. Schwefel. “New Designs and Noise Channels in Electro-Optic Microwave to Optical up-Conversion.” In OSA Quantum 2.0 Conference. Optica Publishing Group, 2020. https://doi.org/10.1364/QUANTUM.2020.QTu8A.1.","mla":"Lambert, Nicholas J., et al. “New Designs and Noise Channels in Electro-Optic Microwave to Optical up-Conversion.” OSA Quantum 2.0 Conference, QTu8A.1, Optica Publishing Group, 2020, doi:10.1364/QUANTUM.2020.QTu8A.1.","short":"N.J. Lambert, S. Mobassem, A.R. Rueda Sanchez, H.G.L. Schwefel, in:, OSA Quantum 2.0 Conference, Optica Publishing Group, 2020.","ista":"Lambert NJ, Mobassem S, Rueda Sanchez AR, Schwefel HGL. 2020. New designs and noise channels in electro-optic microwave to optical up-conversion. OSA Quantum 2.0 Conference. OSA: Optical Society of America, OSA Technical Digest, , QTu8A.1.","ieee":"N. J. Lambert, S. Mobassem, A. R. Rueda Sanchez, and H. G. L. Schwefel, “New designs and noise channels in electro-optic microwave to optical up-conversion,” in OSA Quantum 2.0 Conference, Washington, DC, United States, 2020.","apa":"Lambert, N. J., Mobassem, S., Rueda Sanchez, A. R., & Schwefel, H. G. L. (2020). New designs and noise channels in electro-optic microwave to optical up-conversion. In OSA Quantum 2.0 Conference. Washington, DC, United States: Optica Publishing Group. https://doi.org/10.1364/QUANTUM.2020.QTu8A.1","ama":"Lambert NJ, Mobassem S, Rueda Sanchez AR, Schwefel HGL. New designs and noise channels in electro-optic microwave to optical up-conversion. In: OSA Quantum 2.0 Conference. Optica Publishing Group; 2020. doi:10.1364/QUANTUM.2020.QTu8A.1"},"month":"01","day":"01","publication_identifier":{"isbn":["9-781-5575-2820-9"]},"article_processing_charge":"No","scopus_import":"1"},{"publication_identifier":{"issn":["1049-5258"]},"month":"12","main_file_link":[{"url":"https://proceedings.neurips.cc/paper/2020/hash/bdbd5ebfde4934142c8a88e7a3796cd5-Abstract.html","open_access":"1"}],"oa":1,"project":[{"grant_number":"214316/Z/18/Z","_id":"c084a126-5a5b-11eb-8a69-d75314a70a87","name":"What’s in a memory? Spatiotemporal dynamics in strongly coupled recurrent neuronal networks."},{"name":"Learning the shape of synaptic plasticity rules for neuronal architectures and function through machine learning.","call_identifier":"H2020","grant_number":"819603","_id":"0aacfa84-070f-11eb-9043-d7eb2c709234"}],"quality_controlled":"1","conference":{"start_date":"2020-12-06","location":"Vancouver, Canada","end_date":"2020-12-12","name":"NeurIPS: Conference on Neural Information Processing Systems"},"language":[{"iso":"eng"}],"ec_funded":1,"year":"2020","acknowledgement":"We would like to thank Chaitanya Chintaluri, Georgia Christodoulou, Bill Podlaski and Merima Šabanovic for useful discussions and comments. This work was supported by a Wellcome Trust ´ Senior Research Fellowship (214316/Z/18/Z), a BBSRC grant (BB/N019512/1), an ERC consolidator Grant (SYNAPSEEK), a Leverhulme Trust Project Grant (RPG-2016-446), and funding from École Polytechnique, Paris.","department":[{"_id":"TiVo"}],"publication_status":"published","related_material":{"link":[{"url":"https://doi.org/10.1101/2020.10.24.353409","relation":"is_continued_by"}],"record":[{"status":"public","relation":"dissertation_contains","id":"14422"}]},"author":[{"first_name":"Basile J","last_name":"Confavreux","id":"C7610134-B532-11EA-BD9F-F5753DDC885E","full_name":"Confavreux, Basile J"},{"last_name":"Zenke","first_name":"Friedemann","full_name":"Zenke, Friedemann"},{"first_name":"Everton J.","last_name":"Agnes","full_name":"Agnes, Everton J."},{"first_name":"Timothy","last_name":"Lillicrap","full_name":"Lillicrap, Timothy"},{"orcid":"0000-0003-3295-6181","id":"CB6FF8D2-008F-11EA-8E08-2637E6697425","last_name":"Vogels","first_name":"Tim P","full_name":"Vogels, Tim P"}],"volume":33,"date_updated":"2023-10-18T09:20:55Z","date_created":"2021-07-04T22:01:27Z","scopus_import":"1","article_processing_charge":"No","day":"06","citation":{"short":"B.J. Confavreux, F. Zenke, E.J. Agnes, T. Lillicrap, T.P. Vogels, in:, Advances in Neural Information Processing Systems, 2020, pp. 16398–16408.","mla":"Confavreux, Basile J., et al. “A Meta-Learning Approach to (Re)Discover Plasticity Rules That Carve a Desired Function into a Neural Network.” Advances in Neural Information Processing Systems, vol. 33, 2020, pp. 16398–408.","chicago":"Confavreux, Basile J, Friedemann Zenke, Everton J. Agnes, Timothy Lillicrap, and Tim P Vogels. “A Meta-Learning Approach to (Re)Discover Plasticity Rules That Carve a Desired Function into a Neural Network.” In Advances in Neural Information Processing Systems, 33:16398–408, 2020.","ama":"Confavreux BJ, Zenke F, Agnes EJ, Lillicrap T, Vogels TP. A meta-learning approach to (re)discover plasticity rules that carve a desired function into a neural network. In: Advances in Neural Information Processing Systems. Vol 33. ; 2020:16398-16408.","ieee":"B. J. Confavreux, F. Zenke, E. J. Agnes, T. Lillicrap, and T. P. Vogels, “A meta-learning approach to (re)discover plasticity rules that carve a desired function into a neural network,” in Advances in Neural Information Processing Systems, Vancouver, Canada, 2020, vol. 33, pp. 16398–16408.","apa":"Confavreux, B. J., Zenke, F., Agnes, E. J., Lillicrap, T., & Vogels, T. P. (2020). A meta-learning approach to (re)discover plasticity rules that carve a desired function into a neural network. In Advances in Neural Information Processing Systems (Vol. 33, pp. 16398–16408). Vancouver, Canada.","ista":"Confavreux BJ, Zenke F, Agnes EJ, Lillicrap T, Vogels TP. 2020. A meta-learning approach to (re)discover plasticity rules that carve a desired function into a neural network. Advances in Neural Information Processing Systems. NeurIPS: Conference on Neural Information Processing Systems vol. 33, 16398–16408."},"publication":"Advances in Neural Information Processing Systems","page":"16398-16408","date_published":"2020-12-06T00:00:00Z","type":"conference","abstract":[{"lang":"eng","text":"The search for biologically faithful synaptic plasticity rules has resulted in a large body of models. They are usually inspired by – and fitted to – experimental data, but they rarely produce neural dynamics that serve complex functions. These failures suggest that current plasticity models are still under-constrained by existing data. Here, we present an alternative approach that uses meta-learning to discover plausible synaptic plasticity rules. Instead of experimental data, the rules are constrained by the functions they implement and the structure they are meant to produce. Briefly, we parameterize synaptic plasticity rules by a Volterra expansion and then use supervised learning methods (gradient descent or evolutionary strategies) to minimize a problem-dependent loss function that quantifies how effectively a candidate plasticity rule transforms an initially random network into one with the desired function. We first validate our approach by re-discovering previously described plasticity rules, starting at the single-neuron level and “Oja’s rule”, a simple Hebbian plasticity rule that captures the direction of most variability of inputs to a neuron (i.e., the first principal component). We expand the problem to the network level and ask the framework to find Oja’s rule together with an anti-Hebbian rule such that an initially random two-layer firing-rate network will recover several principal components of the input space after learning. Next, we move to networks of integrate-and-fire neurons with plastic inhibitory afferents. We train for rules that achieve a target firing rate by countering tuned excitation. Our algorithm discovers a specific subset of the manifold of rules that can solve this task. Our work is a proof of principle of an automated and unbiased approach to unveil synaptic plasticity rules that obey biological constraints and can solve complex functions."}],"_id":"9633","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","intvolume":" 33","status":"public","title":"A meta-learning approach to (re)discover plasticity rules that carve a desired function into a neural network","oa_version":"Published Version"},{"scopus_import":"1","article_processing_charge":"Yes","has_accepted_license":"1","day":"01","citation":{"chicago":"Tan, Shutang, Martin Di Donato, Matous Glanc, Xixi Zhang, Petr Klíma, Jie Liu, Aurélien Bailly, et al. “Non-Steroidal Anti-Inflammatory Drugs Target TWISTED DWARF1-Regulated Actin Dynamics and Auxin Transport-Mediated Plant Development.” Cell Reports. Elsevier, 2020. https://doi.org/10.1016/j.celrep.2020.108463.","short":"S. Tan, M. Di Donato, M. Glanc, X. Zhang, P. Klíma, J. Liu, A. Bailly, N. Ferro, J. Petrášek, M. Geisler, J. Friml, Cell Reports 33 (2020).","mla":"Tan, Shutang, et al. “Non-Steroidal Anti-Inflammatory Drugs Target TWISTED DWARF1-Regulated Actin Dynamics and Auxin Transport-Mediated Plant Development.” Cell Reports, vol. 33, no. 9, 108463, Elsevier, 2020, doi:10.1016/j.celrep.2020.108463.","apa":"Tan, S., Di Donato, M., Glanc, M., Zhang, X., Klíma, P., Liu, J., … Friml, J. (2020). Non-steroidal anti-inflammatory drugs target TWISTED DWARF1-regulated actin dynamics and auxin transport-mediated plant development. Cell Reports. Elsevier. https://doi.org/10.1016/j.celrep.2020.108463","ieee":"S. Tan et al., “Non-steroidal anti-inflammatory drugs target TWISTED DWARF1-regulated actin dynamics and auxin transport-mediated plant development,” Cell Reports, vol. 33, no. 9. Elsevier, 2020.","ista":"Tan S, Di Donato M, Glanc M, Zhang X, Klíma P, Liu J, Bailly A, Ferro N, Petrášek J, Geisler M, Friml J. 2020. Non-steroidal anti-inflammatory drugs target TWISTED DWARF1-regulated actin dynamics and auxin transport-mediated plant development. Cell Reports. 33(9), 108463.","ama":"Tan S, Di Donato M, Glanc M, et al. Non-steroidal anti-inflammatory drugs target TWISTED DWARF1-regulated actin dynamics and auxin transport-mediated plant development. Cell Reports. 2020;33(9). doi:10.1016/j.celrep.2020.108463"},"publication":"Cell Reports","article_type":"original","date_published":"2020-12-01T00:00:00Z","type":"journal_article","issue":"9","abstract":[{"lang":"eng","text":"The widely used non-steroidal anti-inflammatory drugs (NSAIDs) are derivatives of the phytohormone salicylic acid (SA). SA is well known to regulate plant immunity and development, whereas there have been few reports focusing on the effects of NSAIDs in plants. Our studies here reveal that NSAIDs exhibit largely overlapping physiological activities to SA in the model plant Arabidopsis. NSAID treatments lead to shorter and agravitropic primary roots and inhibited lateral root organogenesis. Notably, in addition to the SA-like action, which in roots involves binding to the protein phosphatase 2A (PP2A), NSAIDs also exhibit PP2A-independent effects. Cell biological and biochemical analyses reveal that many NSAIDs bind directly to and inhibit the chaperone activity of TWISTED DWARF1, thereby regulating actin cytoskeleton dynamics and subsequent endosomal trafficking. Our findings uncover an unexpected bioactivity of human pharmaceuticals in plants and provide insights into the molecular mechanism underlying the cellular action of this class of anti-inflammatory compounds."}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"8943","intvolume":" 33","status":"public","title":"Non-steroidal anti-inflammatory drugs target TWISTED DWARF1-regulated actin dynamics and auxin transport-mediated plant development","ddc":["580"],"file":[{"access_level":"open_access","file_name":"2020_CellReports_Tan.pdf","creator":"dernst","file_size":8056434,"content_type":"application/pdf","file_id":"8948","relation":"main_file","success":1,"checksum":"ed18cba0fb48ed2e789381a54cc21904","date_updated":"2020-12-14T07:33:39Z","date_created":"2020-12-14T07:33:39Z"}],"oa_version":"Published Version","publication_identifier":{"eissn":["22111247"]},"month":"12","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"isi":["000595658100018"],"pmid":["33264621"]},"project":[{"name":"Tracing Evolution of Auxin Transport and Polarity in Plants","call_identifier":"H2020","_id":"261099A6-B435-11E9-9278-68D0E5697425","grant_number":"742985"},{"grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme"},{"grant_number":"723-2015","_id":"256FEF10-B435-11E9-9278-68D0E5697425","name":"Long Term Fellowship"}],"isi":1,"quality_controlled":"1","doi":"10.1016/j.celrep.2020.108463","language":[{"iso":"eng"}],"acknowledged_ssus":[{"_id":"LifeSc"},{"_id":"Bio"}],"article_number":"108463","ec_funded":1,"file_date_updated":"2020-12-14T07:33:39Z","pmid":1,"year":"2020","acknowledgement":"We thank Drs. Sebastian Bednarek (University of Wisconsin-Madison), Niko Geldner (University of Lausanne), and Karin Schumacher (Heidelberg University) for kindly sharing published Arabidopsis lines; Dr. Satoshi Naramoto for the pPIN2::PIN2-GFP; pVHA-a1::VHA-a1-mRFP reporter; the staff at the Life Science Facility and Bioimaging Facility, Monika Hrtyan, and Dorota Jaworska at IST Austria for technical support; and Drs. Su Tang (Texas A&M University),\r\nMelinda Abas (BOKU), Eva Benkova´ (IST Austria), Christian Luschnig (BOKU), Bartel Vanholme (Gent University), and the Friml group for valuable discussions. The research leading to these findings was funded by the European Union’s Horizon 2020 program (ERC grant agreement no. 742985, to J.F.), the People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007-2013) under REA grant agreement no.\r\n291734, the Swiss National Funds (31003A_165877, to M.G.), the Ministry of Education, Youth, and Sports of the Czech Republic (project no. CZ.02.1.01/0.0/0.0/16_019/0000738, EU Operational Programme ‘‘Research, development and education and Centre for Plant Experimental Biology’’), and the EU Operational Programme Prague - Competitiveness (project no. CZ.2.16/3.1.00/21519). S.T. was funded by a European Molecular Biology Organization (EMBO) long-term postdoctoral fellowship (ALTF 723-2015). X.Z. was partly supported by a PhD scholarship from the China Scholarship Council.","department":[{"_id":"JiFr"}],"publisher":"Elsevier","publication_status":"published","related_material":{"link":[{"description":"News on IST Homepage","relation":"press_release","url":"https://ist.ac.at/en/news/plants-on-aspirin/"}]},"author":[{"id":"2DE75584-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0471-8285","first_name":"Shutang","last_name":"Tan","full_name":"Tan, Shutang"},{"full_name":"Di Donato, Martin","last_name":"Di Donato","first_name":"Martin"},{"last_name":"Glanc","first_name":"Matous","orcid":"0000-0003-0619-7783","id":"1AE1EA24-02D0-11E9-9BAA-DAF4881429F2","full_name":"Glanc, Matous"},{"full_name":"Zhang, Xixi","orcid":"0000-0001-7048-4627","id":"61A66458-47E9-11EA-85BA-8AEAAF14E49A","last_name":"Zhang","first_name":"Xixi"},{"last_name":"Klíma","first_name":"Petr","full_name":"Klíma, Petr"},{"first_name":"Jie","last_name":"Liu","full_name":"Liu, Jie"},{"last_name":"Bailly","first_name":"Aurélien","full_name":"Bailly, Aurélien"},{"full_name":"Ferro, Noel","first_name":"Noel","last_name":"Ferro"},{"first_name":"Jan","last_name":"Petrášek","full_name":"Petrášek, Jan"},{"full_name":"Geisler, Markus","first_name":"Markus","last_name":"Geisler"},{"full_name":"Friml, Jiří","id":"4159519E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8302-7596","first_name":"Jiří","last_name":"Friml"}],"volume":33,"date_updated":"2023-11-16T13:03:31Z","date_created":"2020-12-13T23:01:21Z"},{"publication_identifier":{"eissn":["10916490"],"issn":["00278424"]},"month":"05","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2005.11190"}],"oa":1,"external_id":{"isi":["000536797100014"],"arxiv":["2005.11190"]},"project":[{"grant_number":"I04188","_id":"238B8092-32DE-11EA-91FC-C7463DDC885E","name":"Instabilities in pulsating pipe flow of Newtonian and complex fluids","call_identifier":"FWF"},{"call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","isi":1,"doi":"10.1073/pnas.1913716117","language":[{"iso":"eng"}],"ec_funded":1,"year":"2020","department":[{"_id":"BjHo"}],"publisher":"National Academy of Sciences","publication_status":"published","related_material":{"link":[{"description":"News on IST Homepage","relation":"press_release","url":"https://ist.ac.at/en/news/blood-flows-more-turbulent-than-previously-expected/"}],"record":[{"status":"public","relation":"dissertation_contains","id":"12726"},{"relation":"dissertation_contains","status":"public","id":"14530"}]},"author":[{"full_name":"Xu, Duo","last_name":"Xu","first_name":"Duo","id":"3454D55E-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Atul","last_name":"Varshney","id":"2A2006B2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3072-5999","full_name":"Varshney, Atul"},{"last_name":"Ma","first_name":"Xingyu","orcid":"0000-0002-0179-9737","id":"34BADBA6-F248-11E8-B48F-1D18A9856A87","full_name":"Ma, Xingyu"},{"full_name":"Song, Baofang","last_name":"Song","first_name":"Baofang"},{"last_name":"Riedl","first_name":"Michael","orcid":"0000-0003-4844-6311","id":"3BE60946-F248-11E8-B48F-1D18A9856A87","full_name":"Riedl, Michael"},{"last_name":"Avila","first_name":"Marc","full_name":"Avila, Marc"},{"last_name":"Hof","first_name":"Björn","orcid":"0000-0003-2057-2754","id":"3A374330-F248-11E8-B48F-1D18A9856A87","full_name":"Hof, Björn"}],"volume":117,"date_created":"2020-06-07T22:00:51Z","date_updated":"2023-11-30T10:55:13Z","scopus_import":"1","article_processing_charge":"No","day":"26","citation":{"chicago":"Xu, Duo, Atul Varshney, Xingyu Ma, Baofang Song, Michael Riedl, Marc Avila, and Björn Hof. “Nonlinear Hydrodynamic Instability and Turbulence in Pulsatile Flow.” Proceedings of the National Academy of Sciences of the United States of America. National Academy of Sciences, 2020. https://doi.org/10.1073/pnas.1913716117.","mla":"Xu, Duo, et al. “Nonlinear Hydrodynamic Instability and Turbulence in Pulsatile Flow.” Proceedings of the National Academy of Sciences of the United States of America, vol. 117, no. 21, National Academy of Sciences, 2020, pp. 11233–39, doi:10.1073/pnas.1913716117.","short":"D. Xu, A. Varshney, X. Ma, B. Song, M. Riedl, M. Avila, B. Hof, Proceedings of the National Academy of Sciences of the United States of America 117 (2020) 11233–11239.","ista":"Xu D, Varshney A, Ma X, Song B, Riedl M, Avila M, Hof B. 2020. Nonlinear hydrodynamic instability and turbulence in pulsatile flow. Proceedings of the National Academy of Sciences of the United States of America. 117(21), 11233–11239.","ieee":"D. Xu et al., “Nonlinear hydrodynamic instability and turbulence in pulsatile flow,” Proceedings of the National Academy of Sciences of the United States of America, vol. 117, no. 21. National Academy of Sciences, pp. 11233–11239, 2020.","apa":"Xu, D., Varshney, A., Ma, X., Song, B., Riedl, M., Avila, M., & Hof, B. (2020). Nonlinear hydrodynamic instability and turbulence in pulsatile flow. Proceedings of the National Academy of Sciences of the United States of America. National Academy of Sciences. https://doi.org/10.1073/pnas.1913716117","ama":"Xu D, Varshney A, Ma X, et al. Nonlinear hydrodynamic instability and turbulence in pulsatile flow. Proceedings of the National Academy of Sciences of the United States of America. 2020;117(21):11233-11239. doi:10.1073/pnas.1913716117"},"publication":"Proceedings of the National Academy of Sciences of the United States of America","page":"11233-11239","article_type":"original","date_published":"2020-05-26T00:00:00Z","type":"journal_article","issue":"21","abstract":[{"lang":"eng","text":"Pulsating flows through tubular geometries are laminar provided that velocities are moderate. This in particular is also believed to apply to cardiovascular flows where inertial forces are typically too low to sustain turbulence. On the other hand, flow instabilities and fluctuating shear stresses are held responsible for a variety of cardiovascular diseases. Here we report a nonlinear instability mechanism for pulsating pipe flow that gives rise to bursts of turbulence at low flow rates. Geometrical distortions of small, yet finite, amplitude are found to excite a state consisting of helical vortices during flow deceleration. The resulting flow pattern grows rapidly in magnitude, breaks down into turbulence, and eventually returns to laminar when the flow accelerates. This scenario causes shear stress fluctuations and flow reversal during each pulsation cycle. Such unsteady conditions can adversely affect blood vessels and have been shown to promote inflammation and dysfunction of the shear stress-sensitive endothelial cell layer."}],"_id":"7932","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","intvolume":" 117","title":"Nonlinear hydrodynamic instability and turbulence in pulsatile flow","status":"public","oa_version":"Preprint"},{"publication_identifier":{"issn":["1431-0635"],"eissn":["1431-0643"]},"month":"09","language":[{"iso":"eng"}],"doi":"10.4171/dm/780","quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"arxiv":["1804.07752"]},"oa":1,"file_date_updated":"2023-12-18T10:42:32Z","volume":25,"date_updated":"2023-12-18T10:46:09Z","date_created":"2023-12-18T10:37:43Z","related_material":{"record":[{"id":"6183","relation":"earlier_version","status":"public"}]},"author":[{"first_name":"Johannes","last_name":"Alt","id":"36D3D8B6-F248-11E8-B48F-1D18A9856A87","full_name":"Alt, Johannes"},{"orcid":"0000-0001-5366-9603","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","last_name":"Erdös","first_name":"László","full_name":"Erdös, László"},{"full_name":"Krüger, Torben H","id":"3020C786-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4821-3297","first_name":"Torben H","last_name":"Krüger"}],"department":[{"_id":"LaEr"}],"publisher":"EMS Press","publication_status":"published","year":"2020","has_accepted_license":"1","article_processing_charge":"Yes","day":"01","keyword":["General Mathematics"],"date_published":"2020-09-01T00:00:00Z","page":"1421-1539","article_type":"original","citation":{"chicago":"Alt, Johannes, László Erdös, and Torben H Krüger. “The Dyson Equation with Linear Self-Energy: Spectral Bands, Edges and Cusps.” Documenta Mathematica. EMS Press, 2020. https://doi.org/10.4171/dm/780.","mla":"Alt, Johannes, et al. “The Dyson Equation with Linear Self-Energy: Spectral Bands, Edges and Cusps.” Documenta Mathematica, vol. 25, EMS Press, 2020, pp. 1421–539, doi:10.4171/dm/780.","short":"J. Alt, L. Erdös, T.H. Krüger, Documenta Mathematica 25 (2020) 1421–1539.","ista":"Alt J, Erdös L, Krüger TH. 2020. The Dyson equation with linear self-energy: Spectral bands, edges and cusps. Documenta Mathematica. 25, 1421–1539.","apa":"Alt, J., Erdös, L., & Krüger, T. H. (2020). The Dyson equation with linear self-energy: Spectral bands, edges and cusps. Documenta Mathematica. EMS Press. https://doi.org/10.4171/dm/780","ieee":"J. Alt, L. Erdös, and T. H. Krüger, “The Dyson equation with linear self-energy: Spectral bands, edges and cusps,” Documenta Mathematica, vol. 25. EMS Press, pp. 1421–1539, 2020.","ama":"Alt J, Erdös L, Krüger TH. The Dyson equation with linear self-energy: Spectral bands, edges and cusps. Documenta Mathematica. 2020;25:1421-1539. doi:10.4171/dm/780"},"publication":"Documenta Mathematica","abstract":[{"text":"We study the unique solution m of the Dyson equation \\( -m(z)^{-1} = z\\1 - a + S[m(z)] \\) on a von Neumann algebra A with the constraint Imm≥0. Here, z lies in the complex upper half-plane, a is a self-adjoint element of A and S is a positivity-preserving linear operator on A. We show that m is the Stieltjes transform of a compactly supported A-valued measure on R. Under suitable assumptions, we establish that this measure has a uniformly 1/3-Hölder continuous density with respect to the Lebesgue measure, which is supported on finitely many intervals, called bands. In fact, the density is analytic inside the bands with a square-root growth at the edges and internal cubic root cusps whenever the gap between two bands vanishes. The shape of these singularities is universal and no other singularity may occur. We give a precise asymptotic description of m near the singular points. These asymptotics generalize the analysis at the regular edges given in the companion paper on the Tracy-Widom universality for the edge eigenvalue statistics for correlated random matrices [the first author et al., Ann. Probab. 48, No. 2, 963--1001 (2020; Zbl 1434.60017)] and they play a key role in the proof of the Pearcey universality at the cusp for Wigner-type matrices [G. Cipolloni et al., Pure Appl. Anal. 1, No. 4, 615--707 (2019; Zbl 07142203); the second author et al., Commun. Math. Phys. 378, No. 2, 1203--1278 (2020; Zbl 07236118)]. We also extend the finite dimensional band mass formula from [the first author et al., loc. cit.] to the von Neumann algebra setting by showing that the spectral mass of the bands is topologically rigid under deformations and we conclude that these masses are quantized in some important cases.","lang":"eng"}],"type":"journal_article","oa_version":"Published Version","file":[{"access_level":"open_access","file_name":"2020_DocumentaMathematica_Alt.pdf","content_type":"application/pdf","file_size":1374708,"creator":"dernst","relation":"main_file","file_id":"14695","checksum":"12aacc1d63b852ff9a51c1f6b218d4a6","success":1,"date_created":"2023-12-18T10:42:32Z","date_updated":"2023-12-18T10:42:32Z"}],"intvolume":" 25","ddc":["510"],"status":"public","title":"The Dyson equation with linear self-energy: Spectral bands, edges and cusps","_id":"14694","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"status":"public","ddc":["514"],"title":"Topological methods in geometry and discrete mathematics","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"8156","oa_version":"Published Version","file":[{"file_name":"source.zip","access_level":"closed","creator":"savvakum","file_size":1061740,"content_type":"application/zip","file_id":"8178","relation":"source_file","date_updated":"2020-07-27T12:44:51Z","date_created":"2020-07-27T12:44:51Z"},{"file_id":"8179","relation":"main_file","date_updated":"2020-07-27T12:46:53Z","date_created":"2020-07-27T12:46:53Z","success":1,"file_name":"thesis_pdfa.pdf","access_level":"open_access","creator":"savvakum","file_size":1336501,"content_type":"application/pdf"}],"alternative_title":["ISTA Thesis"],"type":"dissertation","abstract":[{"text":"We present solutions to several problems originating from geometry and discrete mathematics: existence of equipartitions, maps without Tverberg multiple points, and inscribing quadrilaterals. Equivariant obstruction theory is the natural topological approach to these type of questions. However, for the specific problems we consider it had yielded only partial or no results. We get our results by complementing equivariant obstruction theory with other techniques from topology and geometry.","lang":"eng"}],"page":"119","citation":{"chicago":"Avvakumov, Sergey. “Topological Methods in Geometry and Discrete Mathematics.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:8156.","mla":"Avvakumov, Sergey. Topological Methods in Geometry and Discrete Mathematics. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:8156.","short":"S. Avvakumov, Topological Methods in Geometry and Discrete Mathematics, Institute of Science and Technology Austria, 2020.","ista":"Avvakumov S. 2020. Topological methods in geometry and discrete mathematics. Institute of Science and Technology Austria.","ieee":"S. Avvakumov, “Topological methods in geometry and discrete mathematics,” Institute of Science and Technology Austria, 2020.","apa":"Avvakumov, S. (2020). Topological methods in geometry and discrete mathematics. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:8156","ama":"Avvakumov S. Topological methods in geometry and discrete mathematics. 2020. doi:10.15479/AT:ISTA:8156"},"date_published":"2020-07-24T00:00:00Z","has_accepted_license":"1","article_processing_charge":"No","day":"24","publisher":"Institute of Science and Technology Austria","department":[{"_id":"UlWa"}],"publication_status":"published","year":"2020","date_created":"2020-07-23T09:51:29Z","date_updated":"2023-12-18T10:51:01Z","related_material":{"record":[{"id":"8182","relation":"part_of_dissertation","status":"public"},{"id":"8183","status":"public","relation":"part_of_dissertation"},{"id":"8185","relation":"part_of_dissertation","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"8184"},{"id":"6355","relation":"part_of_dissertation","status":"public"},{"id":"75","relation":"part_of_dissertation","status":"public"}]},"author":[{"full_name":"Avvakumov, Sergey","last_name":"Avvakumov","first_name":"Sergey","id":"3827DAC8-F248-11E8-B48F-1D18A9856A87"}],"file_date_updated":"2020-07-27T12:46:53Z","oa":1,"language":[{"iso":"eng"}],"supervisor":[{"full_name":"Wagner, Uli","last_name":"Wagner","first_name":"Uli","orcid":"0000-0002-1494-0568","id":"36690CA2-F248-11E8-B48F-1D18A9856A87"}],"degree_awarded":"PhD","doi":"10.15479/AT:ISTA:8156","publication_identifier":{"issn":["2663-337X"]},"month":"07"},{"language":[{"iso":"eng"}],"doi":"10.2140/paa.2020.2.35","quality_controlled":"1","oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.1903.04046"}],"external_id":{"arxiv":["1903.04046"]},"month":"01","publication_identifier":{"issn":["2578-5893"],"eissn":["2578-5885"]},"date_created":"2024-01-28T23:01:44Z","date_updated":"2024-01-29T09:01:12Z","volume":2,"author":[{"last_name":"Lewin","first_name":"Mathieu","full_name":"Lewin, Mathieu"},{"full_name":"Lieb, Elliott H.","first_name":"Elliott H.","last_name":"Lieb"},{"full_name":"Seiringer, Robert","first_name":"Robert","last_name":"Seiringer","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6781-0521"}],"publication_status":"published","publisher":"Mathematical Sciences Publishers","department":[{"_id":"RoSe"}],"year":"2020","date_published":"2020-01-01T00:00:00Z","article_type":"original","page":"35-73","publication":"Pure and Applied Analysis","citation":{"chicago":"Lewin, Mathieu, Elliott H. Lieb, and Robert Seiringer. “ The Local Density Approximation in Density Functional Theory.” Pure and Applied Analysis. Mathematical Sciences Publishers, 2020. https://doi.org/10.2140/paa.2020.2.35.","mla":"Lewin, Mathieu, et al. “ The Local Density Approximation in Density Functional Theory.” Pure and Applied Analysis, vol. 2, no. 1, Mathematical Sciences Publishers, 2020, pp. 35–73, doi:10.2140/paa.2020.2.35.","short":"M. Lewin, E.H. Lieb, R. Seiringer, Pure and Applied Analysis 2 (2020) 35–73.","ista":"Lewin M, Lieb EH, Seiringer R. 2020. The local density approximation in density functional theory. Pure and Applied Analysis. 2(1), 35–73.","apa":"Lewin, M., Lieb, E. H., & Seiringer, R. (2020). The local density approximation in density functional theory. Pure and Applied Analysis. Mathematical Sciences Publishers. https://doi.org/10.2140/paa.2020.2.35","ieee":"M. Lewin, E. H. Lieb, and R. Seiringer, “ The local density approximation in density functional theory,” Pure and Applied Analysis, vol. 2, no. 1. Mathematical Sciences Publishers, pp. 35–73, 2020.","ama":"Lewin M, Lieb EH, Seiringer R. The local density approximation in density functional theory. Pure and Applied Analysis. 2020;2(1):35-73. doi:10.2140/paa.2020.2.35"},"day":"01","article_processing_charge":"No","scopus_import":"1","oa_version":"Preprint","title":" The local density approximation in density functional theory","status":"public","intvolume":" 2","_id":"14891","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"We give the first mathematically rigorous justification of the local density approximation in density functional theory. We provide a quantitative estimate on the difference between the grand-canonical Levy–Lieb energy of a given density (the lowest possible energy of all quantum states having this density) and the integral over the uniform electron gas energy of this density. The error involves gradient terms and justifies the use of the local density approximation in the situation where the density is very flat on sufficiently large regions in space.","lang":"eng"}],"issue":"1","type":"journal_article"},{"isi":1,"quality_controlled":"1","tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png"},"oa":1,"external_id":{"isi":["000595588700008"],"pmid":["32858144"]},"language":[{"iso":"eng"}],"doi":"10.1016/j.neuroscience.2020.08.011","publication_identifier":{"issn":["0306-4522"]},"month":"12","publisher":"Elsevier","department":[{"_id":"LoSw"}],"publication_status":"published","pmid":1,"acknowledgement":"This work was made possible by the generous support of Project ALS. Imaging and related analyses were facilitated by The Waitt Advanced Biophotonics Center Core at the Salk Institute, supported by grants from NIH-NCI CCSG (P30 014195) and NINDS Neuroscience Center (NS072031). The authors would like to additionally thank Drs. Jane Dodd, Robert Brownstone, and Laskaro Zagoraiou for helpful comments on the manuscript. This manuscript is dedicated to Tom Jessell, an inspirational scientist, friend and mentor.","year":"2020","volume":450,"date_created":"2020-12-03T11:47:31Z","date_updated":"2024-01-31T10:15:34Z","author":[{"last_name":"Salamatina","first_name":"Alina","full_name":"Salamatina, Alina"},{"full_name":"Yang, Jerry H","last_name":"Yang","first_name":"Jerry H"},{"first_name":"Susan","last_name":"Brenner-Morton","full_name":"Brenner-Morton, Susan"},{"full_name":"Bikoff, Jay B ","first_name":"Jay B ","last_name":"Bikoff"},{"full_name":"Fang, Linjing","last_name":"Fang","first_name":"Linjing"},{"full_name":"Kintner, Christopher R","first_name":"Christopher R","last_name":"Kintner"},{"full_name":"Jessell, Thomas M","last_name":"Jessell","first_name":"Thomas M"},{"full_name":"Sweeney, Lora Beatrice Jaeger","orcid":"0000-0001-9242-5601","id":"56BE8254-C4F0-11E9-8E45-0B23E6697425","last_name":"Sweeney","first_name":"Lora Beatrice Jaeger"}],"file_date_updated":"2020-12-03T11:45:26Z","page":"81-95","article_type":"original","citation":{"ista":"Salamatina A, Yang JH, Brenner-Morton S, Bikoff JB, Fang L, Kintner CR, Jessell TM, Sweeney LB. 2020. Differential loss of spinal interneurons in a mouse model of ALS. Neuroscience. 450, 81–95.","ieee":"A. Salamatina et al., “Differential loss of spinal interneurons in a mouse model of ALS,” Neuroscience, vol. 450. Elsevier, pp. 81–95, 2020.","apa":"Salamatina, A., Yang, J. H., Brenner-Morton, S., Bikoff, J. B., Fang, L., Kintner, C. R., … Sweeney, L. B. (2020). Differential loss of spinal interneurons in a mouse model of ALS. Neuroscience. Elsevier. https://doi.org/10.1016/j.neuroscience.2020.08.011","ama":"Salamatina A, Yang JH, Brenner-Morton S, et al. Differential loss of spinal interneurons in a mouse model of ALS. Neuroscience. 2020;450:81-95. doi:10.1016/j.neuroscience.2020.08.011","chicago":"Salamatina, Alina, Jerry H Yang, Susan Brenner-Morton, Jay B Bikoff, Linjing Fang, Christopher R Kintner, Thomas M Jessell, and Lora B. Sweeney. “Differential Loss of Spinal Interneurons in a Mouse Model of ALS.” Neuroscience. Elsevier, 2020. https://doi.org/10.1016/j.neuroscience.2020.08.011.","mla":"Salamatina, Alina, et al. “Differential Loss of Spinal Interneurons in a Mouse Model of ALS.” Neuroscience, vol. 450, Elsevier, 2020, pp. 81–95, doi:10.1016/j.neuroscience.2020.08.011.","short":"A. Salamatina, J.H. Yang, S. Brenner-Morton, J.B. Bikoff, L. Fang, C.R. Kintner, T.M. Jessell, L.B. Sweeney, Neuroscience 450 (2020) 81–95."},"publication":"Neuroscience","date_published":"2020-12-01T00:00:00Z","scopus_import":"1","article_processing_charge":"Yes (via OA deal)","has_accepted_license":"1","day":"01","intvolume":" 450","status":"public","ddc":["570"],"title":"Differential loss of spinal interneurons in a mouse model of ALS","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"8914","file":[{"relation":"main_file","file_id":"8915","date_created":"2020-12-03T11:45:26Z","date_updated":"2020-12-03T11:45:26Z","checksum":"da7413c819e079720669c82451b49294","success":1,"file_name":"2020_Neuroscience_Salamatina.pdf","access_level":"open_access","file_size":4071247,"content_type":"application/pdf","creator":"dernst"}],"oa_version":"Published Version","type":"journal_article","abstract":[{"lang":"eng","text":"Amyotrophic lateral sclerosis (ALS) leads to a loss of specific motor neuron populations in the spinal cord and cortex. Emerging evidence suggests that interneurons may also be affected, but a detailed characterization of interneuron loss and its potential impacts on motor neuron loss and disease progression is lacking. To examine this issue, the fate of V1 inhibitory neurons during ALS was assessed in the ventral spinal cord using the SODG93A mouse model. The V1 population makes up ∼30% of all ventral inhibitory neurons, ∼50% of direct inhibitory synaptic contacts onto motor neuron cell bodies, and is thought to play a key role in modulating motor output, in part through recurrent and reciprocal inhibitory circuits. We find that approximately half of V1 inhibitory neurons are lost in SODG93A mice at late disease stages, but that this loss is delayed relative to the loss of motor neurons and V2a excitatory neurons. We further identify V1 subpopulations based on transcription factor expression that are differentially susceptible to degeneration in SODG93A mice. At an early disease stage, we show that V1 synaptic contacts with motor neuron cell bodies increase, suggesting an upregulation of inhibition before V1 neurons are lost in substantial numbers. These data support a model in which progressive changes in V1 synaptic contacts early in disease, and in select V1 subpopulations at later stages, represent a compensatory upregulation and then deleterious breakdown of specific interneuron circuits within the spinal cord."}]},{"file_date_updated":"2020-12-02T10:46:27Z","abstract":[{"lang":"eng","text":"This data collection contains the transport data for figures presented in the supplementary material of \"Enhancement of Proximity Induced Superconductivity in Planar Germanium\" by K. Aggarwal, et. al. \r\nThe measurements were done using Labber Software and the data is stored in the hdf5 file format. The files can be opened using either the Labber Log Browser (https://labber.org/overview/) or Labber Python API (http://labber.org/online-doc/api/LogFile.html).\r\n"}],"type":"research_data","author":[{"full_name":"Katsaros, Georgios","id":"38DB5788-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8342-202X","first_name":"Georgios","last_name":"Katsaros"}],"related_material":{"record":[{"relation":"used_in_publication","status":"public","id":"10559"},{"relation":"used_in_publication","status":"public","id":"8831"}]},"contributor":[{"first_name":"Kushagra","last_name":"Aggarwal","contributor_type":"project_member","id":"b22ab905-3539-11eb-84c3-fc159dcd79cb"},{"id":"340F461A-F248-11E8-B48F-1D18A9856A87","first_name":"Andrea C","contributor_type":"project_member","last_name":"Hofmann"},{"contributor_type":"project_member","last_name":"Jirovec","first_name":"Daniel","id":"4C473F58-F248-11E8-B48F-1D18A9856A87"},{"contributor_type":"project_member","last_name":"Prieto Gonzalez","first_name":"Ivan","id":"2A307FE2-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Amir","contributor_type":"project_member","last_name":"Sammak"},{"contributor_type":"project_member","last_name":"Botifoll","first_name":"Marc"},{"contributor_type":"project_member","last_name":"Marti-Sanchez","first_name":"Sara"},{"last_name":"Veldhorst","contributor_type":"project_member","first_name":"Menno"},{"last_name":"Arbiol","contributor_type":"project_member","first_name":"Jordi"},{"last_name":"Scappucci","contributor_type":"project_member","first_name":"Giordano"},{"last_name":"Katsaros","contributor_type":"project_leader","first_name":"Georgios","id":"38DB5788-F248-11E8-B48F-1D18A9856A87"}],"date_updated":"2024-02-21T12:41:26Z","date_created":"2020-12-02T10:49:30Z","file":[{"date_created":"2020-12-02T10:46:21Z","date_updated":"2020-12-02T10:46:21Z","checksum":"898607ac9d7cfbd5c7dd84bcb6d8a924","success":1,"relation":"main_file","file_id":"8836","file_size":898039,"content_type":"application/octet-stream","creator":"gkatsaro","file_name":"Figure1-ICvsVG.hdf5","access_level":"open_access"},{"date_created":"2020-12-02T10:46:21Z","date_updated":"2020-12-02T10:46:21Z","success":1,"checksum":"f6f5888f8425e82b4dcd5ec3db9162a6","file_id":"8837","relation":"main_file","creator":"gkatsaro","file_size":184971,"content_type":"application/octet-stream","file_name":"Figure1-RNvsVG.hdf5","access_level":"open_access"},{"relation":"main_file","file_id":"8838","checksum":"63a26c4b0299538610ec58c48c0ab1e3","success":1,"date_updated":"2020-12-02T10:46:22Z","date_created":"2020-12-02T10:46:22Z","access_level":"open_access","file_name":"Figure2-MAR.hdf5","file_size":2097740,"content_type":"application/octet-stream","creator":"gkatsaro"},{"creator":"gkatsaro","content_type":"application/octet-stream","file_size":911501,"access_level":"open_access","file_name":"Figure3-Fraunhofer.hdf5","success":1,"checksum":"4c6795b64b05088606ab7881f801acd7","date_created":"2020-12-02T10:46:22Z","date_updated":"2020-12-02T10:46:22Z","file_id":"8839","relation":"main_file"},{"creator":"gkatsaro","file_size":384239,"content_type":"application/octet-stream","access_level":"open_access","file_name":"Figure3-ICvsBparallel.hdf5","success":1,"checksum":"6b1b07e8ab0d6c1fead91032bf543818","date_created":"2020-12-02T10:46:22Z","date_updated":"2020-12-02T10:46:22Z","file_id":"8840","relation":"main_file"},{"relation":"main_file","file_id":"8841","checksum":"d825f77f57cbf455a4ac48afeec27f5b","success":1,"date_updated":"2020-12-02T10:46:22Z","date_created":"2020-12-02T10:46:22Z","access_level":"open_access","file_name":"Figure3-ICvsBperp.hdf5","file_size":942878,"content_type":"application/octet-stream","creator":"gkatsaro"},{"content_type":"application/octet-stream","file_size":623246,"creator":"gkatsaro","file_name":"Figure4-CPR.hdf5","access_level":"open_access","date_created":"2020-12-02T10:46:22Z","date_updated":"2020-12-02T10:46:22Z","checksum":"ec81afc3697da097a224e9142322243c","success":1,"relation":"main_file","file_id":"8842"},{"file_id":"8843","relation":"main_file","success":1,"checksum":"ca5860a8850a6874312c4ca1d7d41013","date_created":"2020-12-02T10:46:22Z","date_updated":"2020-12-02T10:46:22Z","access_level":"open_access","file_name":"Figure4-SQUID.hdf5","creator":"gkatsaro","content_type":"application/octet-stream","file_size":507164},{"file_id":"8844","relation":"main_file","date_created":"2020-12-02T10:46:22Z","date_updated":"2020-12-02T10:46:22Z","success":1,"checksum":"770721205d081c847316d9122c94eb9b","file_name":"Readme.txt","access_level":"open_access","creator":"gkatsaro","content_type":"text/plain","file_size":1573},{"relation":"main_file","file_id":"8845","checksum":"5e2e407ca631fb15b8c3cc51c5dd3bdb","success":1,"date_updated":"2020-12-02T10:46:22Z","date_created":"2020-12-02T10:46:22Z","access_level":"open_access","file_name":"Figure S5-ICvsVG.hdf5","content_type":"application/octet-stream","file_size":842702,"creator":"gkatsaro"},{"success":1,"checksum":"2076e5f68264ed76c297811f449d768d","date_created":"2020-12-02T10:46:22Z","date_updated":"2020-12-02T10:46:22Z","file_id":"8846","relation":"main_file","creator":"gkatsaro","content_type":"application/octet-stream","file_size":208921,"access_level":"open_access","file_name":"Figure S5-RNvsVG.hdf5"},{"success":1,"checksum":"5dccb801d694749fe8cb496821f12f79","date_updated":"2020-12-02T10:46:22Z","date_created":"2020-12-02T10:46:22Z","file_id":"8847","relation":"main_file","creator":"gkatsaro","content_type":"application/octet-stream","file_size":912249,"access_level":"open_access","file_name":"Figure S8-ICvsVG.hdf5"},{"date_created":"2020-12-02T10:46:22Z","date_updated":"2020-12-02T10:46:22Z","success":1,"checksum":"2b104aee4276e594c0d50557ead36441","file_id":"8848","relation":"main_file","creator":"gkatsaro","file_size":230550,"content_type":"application/octet-stream","file_name":"Figure S8-RNvsVG.hdf5","access_level":"open_access"},{"file_size":533581,"content_type":"application/octet-stream","creator":"gkatsaro","access_level":"open_access","file_name":"Figure S9-JoFET1-Fraunhofer.hdf5","checksum":"1645b03bdc6999d120c3fcc7012c6984","success":1,"date_updated":"2020-12-02T10:46:23Z","date_created":"2020-12-02T10:46:23Z","relation":"main_file","file_id":"8849"},{"file_name":"Figure S9-JoFET1-ICvsVG.hdf5","access_level":"open_access","file_size":1394384,"content_type":"application/octet-stream","creator":"gkatsaro","relation":"main_file","file_id":"8850","date_updated":"2020-12-02T10:46:23Z","date_created":"2020-12-02T10:46:23Z","checksum":"7ba623bbee93e8cb5645c4866f241d43","success":1},{"access_level":"open_access","file_name":"Figure S9-JoFET2-Fraunhofer.hdf5","creator":"gkatsaro","file_size":548051,"content_type":"application/octet-stream","file_id":"8851","relation":"main_file","success":1,"checksum":"3b65ccb68cea8d3c30832fc77aa9eea3","date_created":"2020-12-02T10:46:23Z","date_updated":"2020-12-02T10:46:23Z"},{"file_name":"Figure S9-JoFET2-ICvsVG.hdf5","access_level":"open_access","content_type":"application/octet-stream","file_size":112602,"creator":"gkatsaro","relation":"main_file","file_id":"8852","date_created":"2020-12-02T10:46:23Z","date_updated":"2020-12-02T10:46:23Z","checksum":"3d7394a7bc8ff08bcc7928262514d2b9","success":1},{"file_name":"Readme.txt","access_level":"open_access","content_type":"text/plain","file_size":1449,"creator":"gkatsaro","relation":"main_file","file_id":"8853","date_created":"2020-12-02T10:46:23Z","date_updated":"2020-12-02T10:46:23Z","checksum":"2ef8b3226a99fc65cad1162a52552848","success":1},{"file_name":"dev2-jj2-ICvsVG-Tdependence_1000mK.hdf5","access_level":"open_access","creator":"gkatsaro","content_type":"application/octet-stream","file_size":149502,"file_id":"8854","relation":"main_file","date_created":"2020-12-02T10:46:23Z","date_updated":"2020-12-02T10:46:23Z","success":1,"checksum":"361ef6521f6b23223a34f8cf9645ee68"},{"file_size":167055,"content_type":"application/octet-stream","creator":"gkatsaro","access_level":"open_access","file_name":"dev2-jj2-ICvsVG-Tdependence_100mK.hdf5","checksum":"f8ff5a6dd64d68d55daa79a4145bbd9c","success":1,"date_updated":"2020-12-02T10:46:23Z","date_created":"2020-12-02T10:46:23Z","relation":"main_file","file_id":"8855"},{"file_size":149648,"content_type":"application/octet-stream","creator":"gkatsaro","file_name":"dev2-jj2-ICvsVG-Tdependence_1100mK.hdf5","access_level":"open_access","date_updated":"2020-12-02T10:46:23Z","date_created":"2020-12-02T10:46:23Z","checksum":"f9309e1f1a5f727281960b01a3be64b4","success":1,"relation":"main_file","file_id":"8856"},{"content_type":"application/octet-stream","file_size":144688,"creator":"gkatsaro","access_level":"open_access","file_name":"dev2-jj2-ICvsVG-Tdependence_1200mK.hdf5","checksum":"e0589a34db4c5b7643c8179b0c156e48","success":1,"date_created":"2020-12-02T10:46:23Z","date_updated":"2020-12-02T10:46:23Z","relation":"main_file","file_id":"8857"},{"file_id":"8858","relation":"main_file","success":1,"checksum":"f9736851466851cca596124b1ccdbe01","date_created":"2020-12-02T10:46:23Z","date_updated":"2020-12-02T10:46:23Z","access_level":"open_access","file_name":"dev2-jj2-ICvsVG-Tdependence_125mK.hdf5","creator":"gkatsaro","file_size":148611,"content_type":"application/octet-stream"},{"success":1,"checksum":"d517a4781bb242f7bfb75e7c054131e4","date_created":"2020-12-02T10:46:23Z","date_updated":"2020-12-02T10:46:23Z","file_id":"8859","relation":"main_file","creator":"gkatsaro","file_size":144702,"content_type":"application/octet-stream","access_level":"open_access","file_name":"dev2-jj2-ICvsVG-Tdependence_1300mK.hdf5"},{"creator":"gkatsaro","file_size":150639,"content_type":"application/octet-stream","access_level":"open_access","file_name":"dev2-jj2-ICvsVG-Tdependence_1400mK.hdf5","success":1,"checksum":"ce1dafef1008405b7d63b9d9018bba0d","date_updated":"2020-12-02T10:46:23Z","date_created":"2020-12-02T10:46:23Z","file_id":"8860","relation":"main_file"},{"success":1,"checksum":"0a13039fdb83caee41437685fe73d2b4","date_created":"2020-12-02T10:46:23Z","date_updated":"2020-12-02T10:46:23Z","file_id":"8861","relation":"main_file","creator":"gkatsaro","content_type":"application/octet-stream","file_size":150819,"access_level":"open_access","file_name":"dev2-jj2-ICvsVG-Tdependence_1500mK.hdf5"},{"access_level":"open_access","file_name":"dev2-jj2-ICvsVG-Tdependence_150mK.hdf5","creator":"gkatsaro","file_size":148362,"content_type":"application/octet-stream","file_id":"8862","relation":"main_file","success":1,"checksum":"6e543bc92d4dd4b9b2fcfd7992bfa101","date_created":"2020-12-02T10:46:24Z","date_updated":"2020-12-02T10:46:24Z"},{"file_id":"8863","relation":"main_file","date_created":"2020-12-02T10:46:24Z","date_updated":"2020-12-02T10:46:24Z","success":1,"checksum":"91cfcef1edfbb5c7bed3dde4b2cee5b8","file_name":"dev2-jj2-ICvsVG-Tdependence_1600mK.hdf5","access_level":"open_access","creator":"gkatsaro","file_size":150766,"content_type":"application/octet-stream"},{"creator":"gkatsaro","file_size":169554,"content_type":"application/octet-stream","file_name":"dev2-jj2-ICvsVG-Tdependence_1700mK.hdf5","access_level":"open_access","date_created":"2020-12-02T10:46:24Z","date_updated":"2020-12-02T10:46:24Z","success":1,"checksum":"528fa8c3128e0d79de599ba0bc715665","file_id":"8864","relation":"main_file"},{"date_updated":"2020-12-02T10:46:24Z","date_created":"2020-12-02T10:46:24Z","success":1,"checksum":"9e35c7f20c0b162e205bfa520dc4535d","file_id":"8865","relation":"main_file","creator":"gkatsaro","content_type":"application/octet-stream","file_size":148548,"file_name":"dev2-jj2-ICvsVG-Tdependence_175mK.hdf5","access_level":"open_access"},{"creator":"gkatsaro","content_type":"application/octet-stream","file_size":147386,"access_level":"open_access","file_name":"dev2-jj2-ICvsVG-Tdependence_1800mK.hdf5","success":1,"checksum":"1fb5a8b651447a7204ae31883a1da269","date_updated":"2020-12-02T10:46:24Z","date_created":"2020-12-02T10:46:24Z","file_id":"8866","relation":"main_file"},{"date_created":"2020-12-02T10:46:24Z","date_updated":"2020-12-02T10:46:24Z","success":1,"checksum":"0d3ee65697bceaae15fbcd5d5a8480c1","file_id":"8867","relation":"main_file","creator":"gkatsaro","content_type":"application/octet-stream","file_size":147265,"file_name":"dev2-jj2-ICvsVG-Tdependence_1900mK.hdf5","access_level":"open_access"},{"date_created":"2020-12-02T10:46:24Z","date_updated":"2020-12-02T10:46:24Z","checksum":"fc386694414fee55a21adbc21c5c9b35","success":1,"relation":"main_file","file_id":"8868","content_type":"application/octet-stream","file_size":147371,"creator":"gkatsaro","file_name":"dev2-jj2-ICvsVG-Tdependence_2000mK.hdf5","access_level":"open_access"},{"content_type":"application/octet-stream","file_size":148576,"creator":"gkatsaro","file_name":"dev2-jj2-ICvsVG-Tdependence_200mK.hdf5","access_level":"open_access","date_updated":"2020-12-02T10:46:24Z","date_created":"2020-12-02T10:46:24Z","checksum":"de7c4a302b9fbad6dbcd7dd76af9f585","success":1,"relation":"main_file","file_id":"8869"},{"relation":"main_file","file_id":"8870","checksum":"3f31eb2fb17cdaa70f4f3de2f1c6a563","success":1,"date_updated":"2020-12-02T10:46:24Z","date_created":"2020-12-02T10:46:24Z","access_level":"open_access","file_name":"dev2-jj2-ICvsVG-Tdependence_20mK.hdf5","file_size":183004,"content_type":"application/octet-stream","creator":"gkatsaro"},{"access_level":"open_access","file_name":"dev2-jj2-ICvsVG-Tdependence_2100mK.hdf5","creator":"gkatsaro","content_type":"application/octet-stream","file_size":131582,"file_id":"8871","relation":"main_file","success":1,"checksum":"9044e65b660b5a90931ddcc0d4da7baa","date_updated":"2020-12-02T10:46:24Z","date_created":"2020-12-02T10:46:24Z"},{"creator":"gkatsaro","file_size":131645,"content_type":"application/octet-stream","file_name":"dev2-jj2-ICvsVG-Tdependence_2200mK.hdf5","access_level":"open_access","date_updated":"2020-12-02T10:46:24Z","date_created":"2020-12-02T10:46:24Z","success":1,"checksum":"a4d0644bed0076a5c3a9b10dadac217a","file_id":"8872","relation":"main_file"},{"file_id":"8873","relation":"main_file","date_updated":"2020-12-02T10:46:24Z","date_created":"2020-12-02T10:46:24Z","success":1,"checksum":"7177bd4d5bd80655b513168ebdf4a0c6","file_name":"dev2-jj2-ICvsVG-Tdependence_225mK.hdf5","access_level":"open_access","creator":"gkatsaro","file_size":144366,"content_type":"application/octet-stream"},{"relation":"main_file","file_id":"8874","checksum":"62e51c2cabcb586af21222e60eb8910e","success":1,"date_created":"2020-12-02T10:46:24Z","date_updated":"2020-12-02T10:46:24Z","access_level":"open_access","file_name":"dev2-jj2-ICvsVG-Tdependence_2300mK.hdf5","content_type":"application/octet-stream","file_size":148466,"creator":"gkatsaro"},{"creator":"gkatsaro","file_size":160774,"content_type":"application/octet-stream","file_name":"dev2-jj2-ICvsVG-Tdependence_2400mK.hdf5","access_level":"open_access","date_created":"2020-12-02T10:46:25Z","date_updated":"2020-12-02T10:46:25Z","success":1,"checksum":"67f943fbaae90d117f0f82c3a29e6ccc","file_id":"8875","relation":"main_file"},{"file_name":"dev2-jj2-ICvsVG-Tdependence_2500mK.hdf5","access_level":"open_access","file_size":150110,"content_type":"application/octet-stream","creator":"gkatsaro","relation":"main_file","file_id":"8876","date_created":"2020-12-02T10:46:25Z","date_updated":"2020-12-02T10:46:25Z","checksum":"c6b33f7c61ba57178fa613c58131fd3d","success":1},{"date_updated":"2020-12-02T10:46:25Z","date_created":"2020-12-02T10:46:25Z","success":1,"checksum":"be127426947b8778cfae29a7ad2013f1","file_id":"8877","relation":"main_file","creator":"gkatsaro","content_type":"application/octet-stream","file_size":144419,"file_name":"dev2-jj2-ICvsVG-Tdependence_250mK.hdf5","access_level":"open_access"},{"checksum":"81dfeb4d94c1efec10b623e94d13faa5","success":1,"date_updated":"2020-12-02T10:46:25Z","date_created":"2020-12-02T10:46:25Z","relation":"main_file","file_id":"8878","content_type":"application/octet-stream","file_size":148905,"creator":"gkatsaro","access_level":"open_access","file_name":"dev2-jj2-ICvsVG-Tdependence_2600mK.hdf5"},{"date_created":"2020-12-02T10:46:25Z","date_updated":"2020-12-02T10:46:25Z","checksum":"5c0a37e0de317c7d8df62075ff35f1ec","success":1,"relation":"main_file","file_id":"8879","file_size":131966,"content_type":"application/octet-stream","creator":"gkatsaro","file_name":"dev2-jj2-ICvsVG-Tdependence_2700mK.hdf5","access_level":"open_access"},{"file_id":"8880","relation":"main_file","success":1,"checksum":"0f25d03f2551cbd903c7522883510492","date_updated":"2020-12-02T10:46:25Z","date_created":"2020-12-02T10:46:25Z","access_level":"open_access","file_name":"dev2-jj2-ICvsVG-Tdependence_275mK.hdf5","creator":"gkatsaro","content_type":"application/octet-stream","file_size":144253},{"creator":"gkatsaro","file_size":131997,"content_type":"application/octet-stream","file_name":"dev2-jj2-ICvsVG-Tdependence_2800mK.hdf5","access_level":"open_access","date_updated":"2020-12-02T10:46:25Z","date_created":"2020-12-02T10:46:25Z","success":1,"checksum":"93923640d8bb599f6a459d2fda915b8b","file_id":"8881","relation":"main_file"},{"date_updated":"2020-12-02T10:46:25Z","date_created":"2020-12-02T10:46:25Z","checksum":"c4fcf44e88ed344f4b747a67cae4e147","success":1,"relation":"main_file","file_id":"8882","content_type":"application/octet-stream","file_size":131950,"creator":"gkatsaro","file_name":"dev2-jj2-ICvsVG-Tdependence_2900mK.hdf5","access_level":"open_access"},{"file_size":150616,"content_type":"application/octet-stream","creator":"gkatsaro","file_name":"dev2-jj2-ICvsVG-Tdependence_3000mK.hdf5","access_level":"open_access","date_updated":"2020-12-02T10:46:25Z","date_created":"2020-12-02T10:46:25Z","checksum":"5c1b296c6e654b16f610516b4a2fae30","success":1,"relation":"main_file","file_id":"8883"},{"date_created":"2020-12-02T10:46:25Z","date_updated":"2020-12-02T10:46:25Z","success":1,"checksum":"5d1a2735216b1d6abf4c2645ebe0164e","file_id":"8884","relation":"main_file","creator":"gkatsaro","file_size":144570,"content_type":"application/octet-stream","file_name":"dev2-jj2-ICvsVG-Tdependence_300mK.hdf5","access_level":"open_access"},{"creator":"gkatsaro","content_type":"application/octet-stream","file_size":150709,"file_name":"dev2-jj2-ICvsVG-Tdependence_3100mK.hdf5","access_level":"open_access","date_created":"2020-12-02T10:46:25Z","date_updated":"2020-12-02T10:46:25Z","success":1,"checksum":"50dd9572cee3262ab4d64573289f9832","file_id":"8885","relation":"main_file"},{"file_id":"8886","relation":"main_file","success":1,"checksum":"f528a1daeaddef5deef914798f5569ec","date_created":"2020-12-02T10:46:25Z","date_updated":"2020-12-02T10:46:25Z","access_level":"open_access","file_name":"dev2-jj2-ICvsVG-Tdependence_3200mK.hdf5","creator":"gkatsaro","content_type":"application/octet-stream","file_size":131954},{"creator":"gkatsaro","content_type":"application/octet-stream","file_size":144197,"access_level":"open_access","file_name":"dev2-jj2-ICvsVG-Tdependence_325mK.hdf5","success":1,"checksum":"c2f53134c6877f200bdf4e5638e5c6d3","date_updated":"2020-12-02T10:46:25Z","date_created":"2020-12-02T10:46:25Z","file_id":"8887","relation":"main_file"},{"file_size":144729,"content_type":"application/octet-stream","creator":"gkatsaro","access_level":"open_access","file_name":"dev2-jj2-ICvsVG-Tdependence_360mK.hdf5","checksum":"10dd70f340df3bbe0cfe8cc9e6427d50","success":1,"date_created":"2020-12-02T10:46:25Z","date_updated":"2020-12-02T10:46:25Z","relation":"main_file","file_id":"8888"},{"relation":"main_file","file_id":"8889","checksum":"6da19e1e3ff6f254ce859a2c6952fd3a","success":1,"date_created":"2020-12-02T10:46:26Z","date_updated":"2020-12-02T10:46:26Z","access_level":"open_access","file_name":"dev2-jj2-ICvsVG-Tdependence_400mK.hdf5","content_type":"application/octet-stream","file_size":144502,"creator":"gkatsaro"},{"relation":"main_file","file_id":"8890","checksum":"49b78d23ef1538e1ecfc51dcfcf423d4","success":1,"date_updated":"2020-12-02T10:46:26Z","date_created":"2020-12-02T10:46:26Z","access_level":"open_access","file_name":"dev2-jj2-ICvsVG-Tdependence_430mK.hdf5","content_type":"application/octet-stream","file_size":144280,"creator":"gkatsaro"},{"creator":"gkatsaro","file_size":173158,"content_type":"application/octet-stream","file_name":"dev2-jj2-ICvsVG-Tdependence_45mK.hdf5","access_level":"open_access","date_updated":"2020-12-02T10:46:26Z","date_created":"2020-12-02T10:46:26Z","success":1,"checksum":"065610415e2386a6e571fce3f14a2fc4","file_id":"8891","relation":"main_file"},{"file_name":"dev2-jj2-ICvsVG-Tdependence_460mK.hdf5","access_level":"open_access","file_size":144447,"content_type":"application/octet-stream","creator":"gkatsaro","relation":"main_file","file_id":"8892","date_created":"2020-12-02T10:46:26Z","date_updated":"2020-12-02T10:46:26Z","checksum":"06a83873a1e72377728c080fb8db15fd","success":1},{"file_id":"8893","relation":"main_file","success":1,"checksum":"c4391fda28b9a44e44f2d039ec8651b7","date_created":"2020-12-02T10:46:26Z","date_updated":"2020-12-02T10:46:26Z","access_level":"open_access","file_name":"dev2-jj2-ICvsVG-Tdependence_500mK.hdf5","creator":"gkatsaro","file_size":144800,"content_type":"application/octet-stream"},{"file_id":"8894","relation":"main_file","date_created":"2020-12-02T10:46:26Z","date_updated":"2020-12-02T10:46:26Z","success":1,"checksum":"e9d2ffde84357e8e0be5581408da9b8a","file_name":"dev2-jj2-ICvsVG-Tdependence_530mK.hdf5","access_level":"open_access","creator":"gkatsaro","file_size":144594,"content_type":"application/octet-stream"},{"file_id":"8895","relation":"main_file","date_updated":"2020-12-02T10:46:26Z","date_created":"2020-12-02T10:46:26Z","success":1,"checksum":"d2966be14e8877ca27bf5daff23d76d6","file_name":"dev2-jj2-ICvsVG-Tdependence_560mK.hdf5","access_level":"open_access","creator":"gkatsaro","file_size":144681,"content_type":"application/octet-stream"},{"creator":"gkatsaro","content_type":"application/octet-stream","file_size":144909,"file_name":"dev2-jj2-ICvsVG-Tdependence_600mK.hdf5","access_level":"open_access","date_updated":"2020-12-02T10:46:26Z","date_created":"2020-12-02T10:46:26Z","success":1,"checksum":"75cc9b9a2991b356471ca956076cc376","file_id":"8896","relation":"main_file"},{"file_size":144985,"content_type":"application/octet-stream","creator":"gkatsaro","file_name":"dev2-jj2-ICvsVG-Tdependence_630mK.hdf5","access_level":"open_access","date_created":"2020-12-02T10:46:26Z","date_updated":"2020-12-02T10:46:26Z","checksum":"9144cff758563b93f22c7946146fa5d5","success":1,"relation":"main_file","file_id":"8897"},{"file_id":"8898","relation":"main_file","success":1,"checksum":"14509a2dd1bf74d9c6fc05c046e5b6ff","date_created":"2020-12-02T10:46:26Z","date_updated":"2020-12-02T10:46:26Z","access_level":"open_access","file_name":"dev2-jj2-ICvsVG-Tdependence_660mK.hdf5","creator":"gkatsaro","content_type":"application/octet-stream","file_size":144782},{"content_type":"application/octet-stream","file_size":145046,"creator":"gkatsaro","access_level":"open_access","file_name":"dev2-jj2-ICvsVG-Tdependence_700mK.hdf5","checksum":"9c38e2178f0fda99a02e6d7b2c034082","success":1,"date_updated":"2020-12-02T10:46:26Z","date_created":"2020-12-02T10:46:26Z","relation":"main_file","file_id":"8899"},{"access_level":"open_access","file_name":"dev2-jj2-ICvsVG-Tdependence_730mK.hdf5","creator":"gkatsaro","content_type":"application/octet-stream","file_size":145107,"file_id":"8900","relation":"main_file","success":1,"checksum":"962a205f7ff515b9aad2df28cc5a95e7","date_created":"2020-12-02T10:46:26Z","date_updated":"2020-12-02T10:46:26Z"},{"file_size":145018,"content_type":"application/octet-stream","creator":"gkatsaro","access_level":"open_access","file_name":"dev2-jj2-ICvsVG-Tdependence_760mK.hdf5","checksum":"5e24b1a7840e6a2b3b04bf922b521ec4","success":1,"date_created":"2020-12-02T10:46:26Z","date_updated":"2020-12-02T10:46:26Z","relation":"main_file","file_id":"8901"},{"file_size":145318,"content_type":"application/octet-stream","creator":"gkatsaro","file_name":"dev2-jj2-ICvsVG-Tdependence_800mK.hdf5","access_level":"open_access","date_created":"2020-12-02T10:46:27Z","date_updated":"2020-12-02T10:46:27Z","checksum":"dfbefc2d53df7afd1e534ced7d669b30","success":1,"relation":"main_file","file_id":"8902"},{"file_id":"8903","relation":"main_file","success":1,"checksum":"1629ae97d2748bbf02fdb2d165d236e5","date_created":"2020-12-02T10:46:27Z","date_updated":"2020-12-02T10:46:27Z","access_level":"open_access","file_name":"dev2-jj2-ICvsVG-Tdependence_830mK.hdf5","creator":"gkatsaro","content_type":"application/octet-stream","file_size":145322},{"creator":"gkatsaro","content_type":"application/octet-stream","file_size":145282,"file_name":"dev2-jj2-ICvsVG-Tdependence_850mK.hdf5","access_level":"open_access","date_created":"2020-12-02T10:46:27Z","date_updated":"2020-12-02T10:46:27Z","success":1,"checksum":"618f507780343c6b9145c40d3d5b0ff0","file_id":"8904","relation":"main_file"},{"checksum":"7547c3607280c7eedca3168854976cc9","success":1,"date_updated":"2020-12-02T10:46:27Z","date_created":"2020-12-02T10:46:27Z","relation":"main_file","file_id":"8905","content_type":"application/octet-stream","file_size":143681,"creator":"gkatsaro","access_level":"open_access","file_name":"dev2-jj2-ICvsVG-Tdependence_900mK.hdf5"},{"access_level":"open_access","file_name":"dev2-jj2-ICvsVG-Tdependence_90mK.hdf5","creator":"gkatsaro","file_size":167184,"content_type":"application/octet-stream","file_id":"8906","relation":"main_file","success":1,"checksum":"514d9a43ed3888ce7d8b26ca772cadc3","date_updated":"2020-12-02T10:46:27Z","date_created":"2020-12-02T10:46:27Z"},{"checksum":"77285471178fa68c1eade48761b2aba5","success":1,"date_updated":"2020-12-02T10:46:27Z","date_created":"2020-12-02T10:46:27Z","relation":"main_file","file_id":"8907","content_type":"application/octet-stream","file_size":143491,"creator":"gkatsaro","access_level":"open_access","file_name":"dev2-jj2-ICvsVG-Tdependence_930mK.hdf5"},{"date_created":"2020-12-02T10:46:27Z","date_updated":"2020-12-02T10:46:27Z","success":1,"checksum":"bf8da09fcfa20196fb7e65528a581297","file_id":"8908","relation":"main_file","creator":"gkatsaro","file_size":144057,"content_type":"application/octet-stream","file_name":"dev2-jj2-ICvsVG-Tdependence_965mK.hdf5","access_level":"open_access"}],"oa_version":"Published Version","_id":"8834","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2020","status":"public","ddc":["530"],"title":"Enhancement of proximity induced superconductivity in planar Germanium","department":[{"_id":"GeKa"}],"publisher":"Institute of Science and Technology Austria","day":"02","month":"12","article_processing_charge":"No","has_accepted_license":"1","date_published":"2020-12-02T00:00:00Z","doi":"10.15479/AT:ISTA:8834","tmp":{"short":"CC0 (1.0)","image":"/images/cc_0.png","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","name":"Creative Commons Public Domain Dedication (CC0 1.0)"},"citation":{"ista":"Katsaros G. 2020. Enhancement of proximity induced superconductivity in planar Germanium, Institute of Science and Technology Austria, 10.15479/AT:ISTA:8834.","ieee":"G. Katsaros, “Enhancement of proximity induced superconductivity in planar Germanium.” Institute of Science and Technology Austria, 2020.","apa":"Katsaros, G. (2020). Enhancement of proximity induced superconductivity in planar Germanium. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:8834","ama":"Katsaros G. Enhancement of proximity induced superconductivity in planar Germanium. 2020. doi:10.15479/AT:ISTA:8834","chicago":"Katsaros, Georgios. “Enhancement of Proximity Induced Superconductivity in Planar Germanium.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:8834.","mla":"Katsaros, Georgios. Enhancement of Proximity Induced Superconductivity in Planar Germanium. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:8834.","short":"G. Katsaros, (2020)."},"oa":1},{"file_date_updated":"2020-07-14T12:48:09Z","abstract":[{"text":"Antibiotics that interfere with translation, when combined, interact in diverse and difficult-to-predict ways. Here, we explain these interactions by \"translation bottlenecks\": points in the translation cycle where antibiotics block ribosomal progression. To elucidate the underlying mechanisms of drug interactions between translation inhibitors, we generate translation bottlenecks genetically using inducible control of translation factors that regulate well-defined translation cycle steps. These perturbations accurately mimic antibiotic action and drug interactions, supporting that the interplay of different translation bottlenecks causes these interactions. We further show that growth laws, combined with drug uptake and binding kinetics, enable the direct prediction of a large fraction of observed interactions, yet fail to predict suppression. However, varying two translation bottlenecks simultaneously supports that dense traffic of ribosomes and competition for translation factors account for the previously unexplained suppression. These results highlight the importance of \"continuous epistasis\" in bacterial physiology.","lang":"eng"}],"type":"research_data","author":[{"full_name":"Kavcic, Bor","last_name":"Kavcic","first_name":"Bor","orcid":"0000-0001-6041-254X","id":"350F91D2-F248-11E8-B48F-1D18A9856A87"}],"contributor":[{"first_name":"Gašper","last_name":"Tkačik","contributor_type":"research_group","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6699-1455"},{"id":"3E6DB97A-F248-11E8-B48F-1D18A9856A87","contributor_type":"research_group","last_name":"Bollenbach","first_name":"Tobias"}],"date_updated":"2024-02-21T12:40:51Z","date_created":"2020-07-06T20:40:19Z","oa_version":"Published Version","file":[{"date_updated":"2020-07-14T12:48:09Z","date_created":"2020-07-06T20:38:27Z","checksum":"5c321dbbb6d4b3c85da786fd3ebbdc98","relation":"main_file","file_id":"8098","file_size":255770756,"content_type":"application/zip","creator":"bkavcic","file_name":"natComm_2020_scripts.zip","access_level":"open_access"}],"_id":"8097","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2020","status":"public","title":"Analysis scripts and research data for the paper \"Mechanisms of drug interactions between translation-inhibiting antibiotics\"","publisher":"Institute of Science and Technology Austria","department":[{"_id":"GaTk"}],"day":"15","month":"07","article_processing_charge":"No","has_accepted_license":"1","keyword":["Escherichia coli","antibiotic combinations","translation","growth laws","drug interactions","bacterial physiology","translation inhibitors"],"doi":"10.15479/AT:ISTA:8097","date_published":"2020-07-15T00:00:00Z","acknowledged_ssus":[{"_id":"LifeSc"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"citation":{"apa":"Kavcic, B. (2020). Analysis scripts and research data for the paper “Mechanisms of drug interactions between translation-inhibiting antibiotics.” Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:8097","ieee":"B. Kavcic, “Analysis scripts and research data for the paper ‘Mechanisms of drug interactions between translation-inhibiting antibiotics.’” Institute of Science and Technology Austria, 2020.","ista":"Kavcic B. 2020. Analysis scripts and research data for the paper ‘Mechanisms of drug interactions between translation-inhibiting antibiotics’, Institute of Science and Technology Austria, 10.15479/AT:ISTA:8097.","ama":"Kavcic B. Analysis scripts and research data for the paper “Mechanisms of drug interactions between translation-inhibiting antibiotics.” 2020. doi:10.15479/AT:ISTA:8097","chicago":"Kavcic, Bor. “Analysis Scripts and Research Data for the Paper ‘Mechanisms of Drug Interactions between Translation-Inhibiting Antibiotics.’” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:8097.","short":"B. Kavcic, (2020).","mla":"Kavcic, Bor. Analysis Scripts and Research Data for the Paper “Mechanisms of Drug Interactions between Translation-Inhibiting Antibiotics.” Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:8097."},"oa":1},{"type":"research_data","file_date_updated":"2020-08-18T08:03:23Z","abstract":[{"lang":"eng","text":"Here are the research data underlying the publication \"Estimating inbreeding and its effects in a long-term study of snapdragons (Antirrhinum majus)\". Further information are summed up in the README document.\r\nThe files for this record have been updated and are now found in the linked DOI https://doi.org/10.15479/AT:ISTA:9192."}],"publisher":"Institute of Science and Technology Austria","department":[{"_id":"NiBa"}],"ddc":["576"],"status":"public","title":"Estimating inbreeding and its effects in a long-term study of snapdragons (Antirrhinum majus)","_id":"8254","year":"2020","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"content_type":"application/x-zip-compressed","file_size":5778420,"creator":"dernst","access_level":"open_access","file_name":"Data_Rcode_MathematicaNB.zip","checksum":"4f1382ed4384751b6013398c11557bf6","success":1,"date_updated":"2020-08-18T08:03:23Z","date_created":"2020-08-18T08:03:23Z","relation":"main_file","file_id":"8280"}],"oa_version":"Published Version","date_created":"2020-08-12T12:49:23Z","date_updated":"2024-02-21T12:41:09Z","related_material":{"record":[{"relation":"later_version","status":"public","id":"11321"},{"relation":"later_version","status":"public","id":"9192"}]},"contributor":[{"id":"2CFCFF98-F248-11E8-B48F-1D18A9856A87","first_name":"Louise S","contributor_type":"data_collector","last_name":"Arathoon"},{"id":"455235B8-F248-11E8-B48F-1D18A9856A87","first_name":"Parvathy","last_name":"Surendranadh","contributor_type":"project_member"},{"first_name":"Nicholas H","contributor_type":"project_member","last_name":"Barton","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240"},{"orcid":"0000-0002-4014-8478","id":"419049E2-F248-11E8-B48F-1D18A9856A87","contributor_type":"project_member","last_name":"Field","first_name":"David"},{"contributor_type":"project_member","last_name":"Pickup","first_name":"Melinda","orcid":"0000-0001-6118-0541","id":"2C78037E-F248-11E8-B48F-1D18A9856A87"},{"id":"3B4A7CE2-F248-11E8-B48F-1D18A9856A87","last_name":"Baskett","contributor_type":"project_member","first_name":"Carina"}],"author":[{"orcid":"0000-0003-1771-714X","id":"2CFCFF98-F248-11E8-B48F-1D18A9856A87","last_name":"Arathoon","first_name":"Louise S","full_name":"Arathoon, Louise S"}],"article_processing_charge":"No","has_accepted_license":"1","month":"08","day":"18","citation":{"ama":"Arathoon LS. Estimating inbreeding and its effects in a long-term study of snapdragons (Antirrhinum majus). 2020. doi:10.15479/AT:ISTA:8254","ista":"Arathoon LS. 2020. Estimating inbreeding and its effects in a long-term study of snapdragons (Antirrhinum majus), Institute of Science and Technology Austria, 10.15479/AT:ISTA:8254.","ieee":"L. S. Arathoon, “Estimating inbreeding and its effects in a long-term study of snapdragons (Antirrhinum majus).” Institute of Science and Technology Austria, 2020.","apa":"Arathoon, L. S. (2020). Estimating inbreeding and its effects in a long-term study of snapdragons (Antirrhinum majus). Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:8254","mla":"Arathoon, Louise S. Estimating Inbreeding and Its Effects in a Long-Term Study of Snapdragons (Antirrhinum Majus). Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:8254.","short":"L.S. Arathoon, (2020).","chicago":"Arathoon, Louise S. “Estimating Inbreeding and Its Effects in a Long-Term Study of Snapdragons (Antirrhinum Majus).” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:8254."},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"doi":"10.15479/AT:ISTA:8254","date_published":"2020-08-18T00:00:00Z"},{"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"isi":["000516660900001"]},"oa":1,"quality_controlled":"1","isi":1,"project":[{"call_identifier":"FP7","name":"Towards Spin qubits and Majorana fermions in Germanium selfassembled hut-wires","_id":"25517E86-B435-11E9-9278-68D0E5697425","grant_number":"335497"},{"name":"Towards scalable hut wire quantum devices","call_identifier":"FWF","grant_number":"P32235","_id":"237B3DA4-32DE-11EA-91FC-C7463DDC885E"},{"_id":"237E5020-32DE-11EA-91FC-C7463DDC885E","grant_number":"862046","name":"TOPOLOGICALLY PROTECTED AND SCALABLE QUANTUM BITS","call_identifier":"H2020"}],"doi":"10.1002/adma.201906523","acknowledged_ssus":[{"_id":"NanoFab"},{"_id":"M-Shop"}],"language":[{"iso":"eng"}],"month":"04","publication_identifier":{"issn":["0935-9648"]},"year":"2020","acknowledgement":"This work was supported by the National Key R&D Program of China (Grant Nos. 2016YFA0301701 and 2016YFA0300600), the NSFC (Grant Nos. 11574356, 11434010, and 11404252), the Strategic Priority Research Program of CAS (Grant No. XDB30000000), the ERC Starting Grant No. 335497, the FWF P32235 project, and the European Union's Horizon 2020 research and innovation program under Grant Agreement #862046. This research was supported by the Scientific Service Units of IST Austria through resources provided by the MIBA Machine Shop and the nanofabrication facility. F.L. thanks support from DOE (Grant No. DE‐FG02‐04ER46148). H.H. thanks the Startup Funding from Xi'an Jiaotong University.","publication_status":"published","publisher":"Wiley","department":[{"_id":"GeKa"}],"author":[{"full_name":"Gao, Fei","first_name":"Fei","last_name":"Gao"},{"full_name":"Wang, Jian-Huan","last_name":"Wang","first_name":"Jian-Huan"},{"last_name":"Watzinger","first_name":"Hannes","id":"35DF8E50-F248-11E8-B48F-1D18A9856A87","full_name":"Watzinger, Hannes"},{"first_name":"Hao","last_name":"Hu","full_name":"Hu, Hao"},{"first_name":"Marko J.","last_name":"Rančić","full_name":"Rančić, Marko J."},{"full_name":"Zhang, Jie-Yin","last_name":"Zhang","first_name":"Jie-Yin"},{"full_name":"Wang, Ting","last_name":"Wang","first_name":"Ting"},{"first_name":"Yuan","last_name":"Yao","full_name":"Yao, Yuan"},{"full_name":"Wang, Gui-Lei","first_name":"Gui-Lei","last_name":"Wang"},{"full_name":"Kukucka, Josip","id":"3F5D8856-F248-11E8-B48F-1D18A9856A87","first_name":"Josip","last_name":"Kukucka"},{"first_name":"Lada","last_name":"Vukušić","id":"31E9F056-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2424-8636","full_name":"Vukušić, Lada"},{"last_name":"Kloeffel","first_name":"Christoph","full_name":"Kloeffel, Christoph"},{"first_name":"Daniel","last_name":"Loss","full_name":"Loss, Daniel"},{"full_name":"Liu, Feng","first_name":"Feng","last_name":"Liu"},{"full_name":"Katsaros, Georgios","id":"38DB5788-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8342-202X","first_name":"Georgios","last_name":"Katsaros"},{"full_name":"Zhang, Jian-Jun","first_name":"Jian-Jun","last_name":"Zhang"}],"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"7996"},{"id":"9222","status":"public","relation":"research_data"}]},"date_updated":"2024-02-21T12:42:12Z","date_created":"2020-02-28T09:47:00Z","volume":32,"article_number":"1906523","file_date_updated":"2020-11-20T10:11:35Z","ec_funded":1,"publication":"Advanced Materials","citation":{"ama":"Gao F, Wang J-H, Watzinger H, et al. Site-controlled uniform Ge/Si hut wires with electrically tunable spin-orbit coupling. Advanced Materials. 2020;32(16). doi:10.1002/adma.201906523","ista":"Gao F, Wang J-H, Watzinger H, Hu H, Rančić MJ, Zhang J-Y, Wang T, Yao Y, Wang G-L, Kukucka J, Vukušić L, Kloeffel C, Loss D, Liu F, Katsaros G, Zhang J-J. 2020. Site-controlled uniform Ge/Si hut wires with electrically tunable spin-orbit coupling. Advanced Materials. 32(16), 1906523.","apa":"Gao, F., Wang, J.-H., Watzinger, H., Hu, H., Rančić, M. J., Zhang, J.-Y., … Zhang, J.-J. (2020). Site-controlled uniform Ge/Si hut wires with electrically tunable spin-orbit coupling. Advanced Materials. Wiley. https://doi.org/10.1002/adma.201906523","ieee":"F. Gao et al., “Site-controlled uniform Ge/Si hut wires with electrically tunable spin-orbit coupling,” Advanced Materials, vol. 32, no. 16. Wiley, 2020.","mla":"Gao, Fei, et al. “Site-Controlled Uniform Ge/Si Hut Wires with Electrically Tunable Spin-Orbit Coupling.” Advanced Materials, vol. 32, no. 16, 1906523, Wiley, 2020, doi:10.1002/adma.201906523.","short":"F. Gao, J.-H. Wang, H. Watzinger, H. Hu, M.J. Rančić, J.-Y. Zhang, T. Wang, Y. Yao, G.-L. Wang, J. Kukucka, L. Vukušić, C. Kloeffel, D. Loss, F. Liu, G. Katsaros, J.-J. Zhang, Advanced Materials 32 (2020).","chicago":"Gao, Fei, Jian-Huan Wang, Hannes Watzinger, Hao Hu, Marko J. Rančić, Jie-Yin Zhang, Ting Wang, et al. “Site-Controlled Uniform Ge/Si Hut Wires with Electrically Tunable Spin-Orbit Coupling.” Advanced Materials. Wiley, 2020. https://doi.org/10.1002/adma.201906523."},"article_type":"original","date_published":"2020-04-23T00:00:00Z","scopus_import":"1","day":"23","has_accepted_license":"1","article_processing_charge":"Yes (via OA deal)","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"7541","status":"public","ddc":["530"],"title":"Site-controlled uniform Ge/Si hut wires with electrically tunable spin-orbit coupling","intvolume":" 32","file":[{"date_updated":"2020-11-20T10:11:35Z","date_created":"2020-11-20T10:11:35Z","checksum":"c622737dc295972065782558337124a2","success":1,"relation":"main_file","file_id":"8782","content_type":"application/pdf","file_size":5242880,"creator":"dernst","file_name":"2020_AdvancedMaterials_Gao.pdf","access_level":"open_access"}],"oa_version":"Published Version","type":"journal_article","abstract":[{"text":"Semiconductor nanowires have been playing a crucial role in the development of nanoscale devices for the realization of spin qubits, Majorana fermions, single photon emitters, nanoprocessors, etc. The monolithic growth of site‐controlled nanowires is a prerequisite toward the next generation of devices that will require addressability and scalability. Here, combining top‐down nanofabrication and bottom‐up self‐assembly, the growth of Ge wires on prepatterned Si (001) substrates with controllable position, distance, length, and structure is reported. This is achieved by a novel growth process that uses a SiGe strain‐relaxation template and can be potentially generalized to other material combinations. Transport measurements show an electrically tunable spin–orbit coupling, with a spin–orbit length similar to that of III–V materials. Also, charge sensing between quantum dots in closely spaced wires is observed, which underlines their potential for the realization of advanced quantum devices. The reported results open a path toward scalable qubit devices using nanowires on silicon.","lang":"eng"}],"issue":"16"},{"date_published":"2020-12-10T00:00:00Z","doi":"10.15479/AT:ISTA:8930","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"citation":{"ieee":"B. Kavcic, “Analysis scripts and research data for the paper ‘Minimal biophysical model of combined antibiotic action.’” Institute of Science and Technology Austria, 2020.","apa":"Kavcic, B. (2020). Analysis scripts and research data for the paper “Minimal biophysical model of combined antibiotic action.” Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:8930","ista":"Kavcic B. 2020. Analysis scripts and research data for the paper ‘Minimal biophysical model of combined antibiotic action’, Institute of Science and Technology Austria, 10.15479/AT:ISTA:8930.","ama":"Kavcic B. Analysis scripts and research data for the paper “Minimal biophysical model of combined antibiotic action.” 2020. doi:10.15479/AT:ISTA:8930","chicago":"Kavcic, Bor. “Analysis Scripts and Research Data for the Paper ‘Minimal Biophysical Model of Combined Antibiotic Action.’” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:8930.","short":"B. Kavcic, (2020).","mla":"Kavcic, Bor. Analysis Scripts and Research Data for the Paper “Minimal Biophysical Model of Combined Antibiotic Action.” Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:8930."},"month":"12","day":"10","has_accepted_license":"1","article_processing_charge":"No","keyword":["Escherichia coli","antibiotic combinations","translation","growth laws","drug interactions","bacterial physiology","translation inhibitors"],"author":[{"full_name":"Kavcic, Bor","orcid":"0000-0001-6041-254X","id":"350F91D2-F248-11E8-B48F-1D18A9856A87","last_name":"Kavcic","first_name":"Bor"}],"contributor":[{"id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6699-1455","first_name":"Gašper","last_name":"Tkačik","contributor_type":"supervisor"},{"contributor_type":"supervisor","last_name":"Bollenbach","first_name":"Tobias","id":"3E6DB97A-F248-11E8-B48F-1D18A9856A87"}],"related_material":{"record":[{"id":"8997","relation":"used_in_publication","status":"public"}]},"date_created":"2020-12-09T15:04:02Z","date_updated":"2024-02-21T12:41:42Z","oa_version":"Published Version","file":[{"content_type":"application/zip","file_size":315494370,"creator":"bkavcic","file_name":"PLoSCompBiol2020_datarep.zip","access_level":"open_access","date_updated":"2020-12-09T15:00:19Z","date_created":"2020-12-09T15:00:19Z","checksum":"60a818edeffaa7da1ebf5f8fbea9ba18","success":1,"relation":"main_file","file_id":"8932"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"8930","year":"2020","title":"Analysis scripts and research data for the paper \"Minimal biophysical model of combined antibiotic action\"","status":"public","ddc":["570"],"department":[{"_id":"GaTk"}],"publisher":"Institute of Science and Technology Austria","abstract":[{"lang":"eng","text":"Phenomenological relations such as Ohm’s or Fourier’s law have a venerable history in physics but are still scarce in biology. This situation restrains predictive theory. Here, we build on bacterial “growth laws,” which capture physiological feedback between translation and cell growth, to construct a minimal biophysical model for the combined action of ribosome-targeting antibiotics. Our model predicts drug interactions like antagonism or synergy solely from responses to individual drugs. We provide analytical results for limiting cases, which agree well with numerical results. We systematically refine the model by including direct physical interactions of different antibiotics on the ribosome. In a limiting case, our model provides a mechanistic underpinning for recent predictions of higher-order interactions that were derived using entropy maximization. We further refine the model to include the effects of antibiotics that mimic starvation and the presence of resistance genes. We describe the impact of a starvation-mimicking antibiotic on drug interactions analytically and verify it experimentally. Our extended model suggests a change in the type of drug interaction that depends on the strength of resistance, which challenges established rescaling paradigms. We experimentally show that the presence of unregulated resistance genes can lead to altered drug interaction, which agrees with the prediction of the model. While minimal, the model is readily adaptable and opens the door to predicting interactions of second and higher-order in a broad range of biological systems."}],"file_date_updated":"2020-12-09T15:00:19Z","type":"research_data"},{"status":"public","title":"Sequences of gene regulatory network permutations for the article \"Local genetic context shapes the function of a gene regulatory network\"","ddc":["570"],"publisher":"Institute of Science and Technology Austria","department":[{"_id":"CaGu"}],"_id":"8951","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2020","date_updated":"2024-02-21T12:41:57Z","date_created":"2020-12-20T10:00:26Z","file":[{"file_size":523,"content_type":"text/plain","creator":"bkavcic","file_name":"readme.txt","access_level":"open_access","date_created":"2020-12-20T09:52:52Z","date_updated":"2020-12-20T09:52:52Z","checksum":"f57862aeee1690c7effd2b1117d40ed1","success":1,"relation":"main_file","file_id":"8952"},{"file_id":"8954","relation":"main_file","date_created":"2020-12-20T22:01:44Z","date_updated":"2020-12-20T22:01:44Z","success":1,"checksum":"f2c6d5232ec6d551b6993991e8689e9f","file_name":"GRNs Research depository.gb","access_level":"open_access","creator":"bkavcic","content_type":"application/octet-stream","file_size":379228}],"oa_version":"Published Version","author":[{"full_name":"Nagy-Staron, Anna A","orcid":"0000-0002-1391-8377","id":"3ABC5BA6-F248-11E8-B48F-1D18A9856A87","last_name":"Nagy-Staron","first_name":"Anna A"}],"related_material":{"record":[{"id":"9283","relation":"used_in_publication","status":"public"}]},"contributor":[{"id":"3ABC5BA6-F248-11E8-B48F-1D18A9856A87","first_name":"Anna A","contributor_type":"project_member","last_name":"Nagy-Staron"},{"id":"3AEC8556-F248-11E8-B48F-1D18A9856A87","last_name":"Tomasek","contributor_type":"project_member","first_name":"Kathrin"},{"first_name":"Caroline","contributor_type":"project_member","last_name":"Caruso Carter"},{"first_name":"Elisabeth","contributor_type":"project_member","last_name":"Sonnleitner"},{"first_name":"Bor","last_name":"Kavcic","contributor_type":"project_member","id":"350F91D2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6041-254X"},{"contributor_type":"project_member","last_name":"Paixão","first_name":"Tiago"},{"orcid":"0000-0001-6220-2052","id":"47F8433E-F248-11E8-B48F-1D18A9856A87","contributor_type":"project_manager","last_name":"Guet","first_name":"Calin C"}],"type":"research_data","abstract":[{"lang":"eng","text":"Gene expression levels are influenced by multiple coexisting molecular mechanisms. Some of these interactions, such as those of transcription factors and promoters have been studied extensively. However, predicting phenotypes of gene regulatory networks remains a major challenge. Here, we use a well-defined synthetic gene regulatory network to study how network phenotypes depend on local genetic context, i.e. the genetic neighborhood of a transcription factor and its relative position. We show that one gene regulatory network with fixed topology can display not only quantitatively but also qualitatively different phenotypes, depending solely on the local genetic context of its components. Our results demonstrate that changes in local genetic context can place a single transcriptional unit within two separate regulons without the need for complex regulatory sequences. We propose that relative order of individual transcriptional units, with its potential for combinatorial complexity, plays an important role in shaping phenotypes of gene regulatory networks."}],"file_date_updated":"2020-12-20T22:01:44Z","citation":{"mla":"Nagy-Staron, Anna A. Sequences of Gene Regulatory Network Permutations for the Article “Local Genetic Context Shapes the Function of a Gene Regulatory Network.” Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:8951.","short":"A.A. Nagy-Staron, (2020).","chicago":"Nagy-Staron, Anna A. “Sequences of Gene Regulatory Network Permutations for the Article ‘Local Genetic Context Shapes the Function of a Gene Regulatory Network.’” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:8951.","ama":"Nagy-Staron AA. Sequences of gene regulatory network permutations for the article “Local genetic context shapes the function of a gene regulatory network.” 2020. doi:10.15479/AT:ISTA:8951","ista":"Nagy-Staron AA. 2020. Sequences of gene regulatory network permutations for the article ‘Local genetic context shapes the function of a gene regulatory network’, Institute of Science and Technology Austria, 10.15479/AT:ISTA:8951.","apa":"Nagy-Staron, A. A. (2020). Sequences of gene regulatory network permutations for the article “Local genetic context shapes the function of a gene regulatory network.” Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:8951","ieee":"A. A. Nagy-Staron, “Sequences of gene regulatory network permutations for the article ‘Local genetic context shapes the function of a gene regulatory network.’” Institute of Science and Technology Austria, 2020."},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"date_published":"2020-12-21T00:00:00Z","doi":"10.15479/AT:ISTA:8951","keyword":["Gene regulatory networks","Gene expression","Escherichia coli","Synthetic Biology"],"month":"12","day":"21","article_processing_charge":"No","has_accepted_license":"1"},{"date_published":"2020-01-28T00:00:00Z","doi":"10.15479/AT:ISTA:7383","oa":1,"citation":{"ama":"Grah R. Matlab scripts for the Paper: Gene Amplification as a Form of Population-Level Gene Expression regulation. 2020. doi:10.15479/AT:ISTA:7383","ista":"Grah R. 2020. Matlab scripts for the Paper: Gene Amplification as a Form of Population-Level Gene Expression regulation, Institute of Science and Technology Austria, 10.15479/AT:ISTA:7383.","apa":"Grah, R. (2020). Matlab scripts for the Paper: Gene Amplification as a Form of Population-Level Gene Expression regulation. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:7383","ieee":"R. Grah, “Matlab scripts for the Paper: Gene Amplification as a Form of Population-Level Gene Expression regulation.” Institute of Science and Technology Austria, 2020.","mla":"Grah, Rok. Matlab Scripts for the Paper: Gene Amplification as a Form of Population-Level Gene Expression Regulation. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:7383.","short":"R. Grah, (2020).","chicago":"Grah, Rok. “Matlab Scripts for the Paper: Gene Amplification as a Form of Population-Level Gene Expression Regulation.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:7383."},"has_accepted_license":"1","article_processing_charge":"No","day":"28","month":"01","keyword":["Matlab scripts","analysis of microfluidics","mathematical model"],"related_material":{"record":[{"id":"7652","status":"public","relation":"used_in_publication"}]},"contributor":[{"last_name":"Guet","contributor_type":"project_leader","first_name":"Calin C","orcid":"0000-0001-6220-2052","id":"47F8433E-F248-11E8-B48F-1D18A9856A87"}],"author":[{"first_name":"Rok","last_name":"Grah","id":"483E70DE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2539-3560","full_name":"Grah, Rok"}],"file":[{"content_type":"application/zip","file_size":73363365,"creator":"rgrah","file_name":"Scripts.zip","access_level":"open_access","date_created":"2020-01-28T10:39:40Z","date_updated":"2020-07-14T12:47:57Z","checksum":"9d292cf5207b3829225f44c044cdb3fd","relation":"main_file","file_id":"7384"},{"checksum":"4076ceab32ef588cc233802bab24c1ab","date_created":"2020-01-28T10:39:30Z","date_updated":"2020-07-14T12:47:57Z","relation":"main_file","file_id":"7385","file_size":962,"content_type":"text/plain","creator":"rgrah","access_level":"open_access","file_name":"READ_ME_MAIN.txt"}],"oa_version":"Published Version","date_created":"2020-01-28T10:41:49Z","date_updated":"2024-02-21T12:42:31Z","year":"2020","_id":"7383","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Institute of Science and Technology Austria","department":[{"_id":"CaGu"},{"_id":"GaTk"}],"status":"public","title":"Matlab scripts for the Paper: Gene Amplification as a Form of Population-Level Gene Expression regulation","file_date_updated":"2020-07-14T12:47:57Z","abstract":[{"lang":"eng","text":"Organisms cope with change by employing transcriptional regulators. However, when faced with rare environments, the evolution of transcriptional regulators and their promoters may be too slow. We ask whether the intrinsic instability of gene duplication and amplification provides a generic alternative to canonical gene regulation. By real-time monitoring of gene copy number mutations in E. coli, we show that gene duplications and amplifications enable adaptation to fluctuating environments by rapidly generating copy number, and hence expression level, polymorphism. This ‘amplification-mediated gene expression tuning’ occurs on timescales similar to canonical gene regulation and can deal with rapid environmental changes. Mathematical modeling shows that amplifications also tune gene expression in stochastic environments where transcription factor-based schemes are hard to evolve or maintain. The fleeting nature of gene amplifications gives rise to a generic population-level mechanism that relies on genetic heterogeneity to rapidly tune expression of any gene, without leaving any genomic signature."}],"type":"research_data"},{"day":"16","month":"03","has_accepted_license":"1","article_processing_charge":"No","oa":1,"tmp":{"short":"CC0 (1.0)","image":"/images/cc_0.png","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","name":"Creative Commons Public Domain Dedication (CC0 1.0)"},"citation":{"ama":"Katsaros G. Transport data for: Site‐controlled uniform Ge/Si Hut wires with electrically tunable spin–orbit coupling. 2020. doi:10.15479/AT:ISTA:9222","apa":"Katsaros, G. (2020). Transport data for: Site‐controlled uniform Ge/Si Hut wires with electrically tunable spin–orbit coupling. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:9222","ieee":"G. Katsaros, “Transport data for: Site‐controlled uniform Ge/Si Hut wires with electrically tunable spin–orbit coupling.” Institute of Science and Technology Austria, 2020.","ista":"Katsaros G. 2020. Transport data for: Site‐controlled uniform Ge/Si Hut wires with electrically tunable spin–orbit coupling, Institute of Science and Technology Austria, 10.15479/AT:ISTA:9222.","short":"G. Katsaros, (2020).","mla":"Katsaros, Georgios. Transport Data for: Site‐controlled Uniform Ge/Si Hut Wires with Electrically Tunable Spin–Orbit Coupling. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:9222.","chicago":"Katsaros, Georgios. “Transport Data for: Site‐controlled Uniform Ge/Si Hut Wires with Electrically Tunable Spin–Orbit Coupling.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:9222."},"doi":"10.15479/AT:ISTA:9222","date_published":"2020-03-16T00:00:00Z","type":"research_data","file_date_updated":"2021-03-10T07:31:50Z","status":"public","title":"Transport data for: Site‐controlled uniform Ge/Si Hut wires with electrically tunable spin–orbit coupling","ddc":["530"],"publisher":"Institute of Science and Technology Austria","department":[{"_id":"GeKa"}],"year":"2020","_id":"9222","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2024-02-21T12:42:13Z","date_created":"2021-03-05T18:00:47Z","file":[{"content_type":"application/x-zip-compressed","file_size":13317557,"creator":"gkatsaro","access_level":"open_access","file_name":"DOI_SiteControlledHWs.zip","checksum":"41b66e195ed3dbd73077feee77b05652","date_created":"2021-03-05T17:50:45Z","date_updated":"2021-03-05T17:50:45Z","relation":"main_file","file_id":"9223"},{"file_id":"9233","relation":"main_file","success":1,"checksum":"a1dc5f710ba4b3bb7f248195ba754ab2","date_updated":"2021-03-10T07:31:50Z","date_created":"2021-03-10T07:31:50Z","access_level":"open_access","file_name":"Readme.txt","creator":"dernst","content_type":"text/plain","file_size":3515}],"oa_version":"Published Version","author":[{"full_name":"Katsaros, Georgios","first_name":"Georgios","last_name":"Katsaros","id":"38DB5788-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8342-202X"}],"contributor":[{"first_name":"Georgios","contributor_type":"research_group","last_name":"Katsaros","id":"38DB5788-F248-11E8-B48F-1D18A9856A87"}],"related_material":{"record":[{"id":"7541","status":"public","relation":"used_in_publication"}]}},{"ec_funded":1,"file_date_updated":"2020-09-16T15:11:01Z","acknowledgement":"During the work on this thesis, I received substantial support from IST Austria’s scientific service units. A big thank you to Todor Asenov and other Miba Machine Shop team members for their help with fabrication of experimental prototypes. In addition, I would like to thank Scientific Computing team for the support with high performance computing.\r\nFinancial support was provided by the European Research Council (ERC) under grant agreement No 715767 - MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling, which I gratefully acknowledge.","year":"2020","publisher":"Institute of Science and Technology Austria","department":[{"_id":"BeBi"}],"publication_status":"published","related_material":{"record":[{"id":"7151","relation":"research_data","status":"deleted"},{"id":"7262","relation":"part_of_dissertation","status":"public"},{"id":"8562","status":"public","relation":"part_of_dissertation"},{"status":"public","relation":"part_of_dissertation","id":"1001"},{"status":"public","relation":"research_data","id":"8375"}]},"author":[{"orcid":"0000-0001-9819-5077","id":"3AB45EE2-F248-11E8-B48F-1D18A9856A87","last_name":"Guseinov","first_name":"Ruslan","full_name":"Guseinov, Ruslan"}],"date_created":"2020-09-10T16:19:55Z","date_updated":"2024-02-21T12:44:29Z","publication_identifier":{"isbn":["978-3-99078-010-7"],"issn":["2663-337X"]},"month":"09","oa":1,"project":[{"name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","call_identifier":"H2020","grant_number":"715767","_id":"24F9549A-B435-11E9-9278-68D0E5697425"}],"doi":"10.15479/AT:ISTA:8366","language":[{"iso":"eng"}],"degree_awarded":"PhD","supervisor":[{"last_name":"Bickel","first_name":"Bernd","orcid":"0000-0001-6511-9385","id":"49876194-F248-11E8-B48F-1D18A9856A87","full_name":"Bickel, Bernd"}],"acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"ScienComp"}],"type":"dissertation","alternative_title":["ISTA Thesis"],"abstract":[{"lang":"eng","text":"Fabrication of curved shells plays an important role in modern design, industry, and science. Among their remarkable properties are, for example, aesthetics of organic shapes, ability to evenly distribute loads, or efficient flow separation. They find applications across vast length scales ranging from sky-scraper architecture to microscopic devices. But, at\r\nthe same time, the design of curved shells and their manufacturing process pose a variety of challenges. In this thesis, they are addressed from several perspectives. In particular, this thesis presents approaches based on the transformation of initially flat sheets into the target curved surfaces. This involves problems of interactive design of shells with nontrivial mechanical constraints, inverse design of complex structural materials, and data-driven modeling of delicate and time-dependent physical properties. At the same time, two newly-developed self-morphing mechanisms targeting flat-to-curved transformation are presented.\r\nIn architecture, doubly curved surfaces can be realized as cold bent glass panelizations. Originally flat glass panels are bent into frames and remain stressed. This is a cost-efficient fabrication approach compared to hot bending, when glass panels are shaped plastically. However such constructions are prone to breaking during bending, and it is highly\r\nnontrivial to navigate the design space, keeping the panels fabricable and aesthetically pleasing at the same time. We introduce an interactive design system for cold bent glass façades, while previously even offline optimization for such scenarios has not been sufficiently developed. Our method is based on a deep learning approach providing quick\r\nand high precision estimation of glass panel shape and stress while handling the shape\r\nmultimodality.\r\nFabrication of smaller objects of scales below 1 m, can also greatly benefit from shaping originally flat sheets. In this respect, we designed new self-morphing shell mechanisms transforming from an initial flat state to a doubly curved state with high precision and detail. Our so-called CurveUps demonstrate the encodement of the geometric information\r\ninto the shell. Furthermore, we explored the frontiers of programmable materials and showed how temporal information can additionally be encoded into a flat shell. This allows prescribing deformation sequences for doubly curved surfaces and, thus, facilitates self-collision avoidance enabling complex shapes and functionalities otherwise impossible.\r\nBoth of these methods include inverse design tools keeping the user in the design loop."}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"8366","ddc":["000"],"title":"Computational design of curved thin shells: From glass façades to programmable matter","status":"public","oa_version":"Published Version","file":[{"date_created":"2020-09-10T16:11:49Z","date_updated":"2020-09-10T16:11:49Z","checksum":"f8da89553da36037296b0a80f14ebf50","success":1,"relation":"main_file","file_id":"8367","file_size":70950442,"content_type":"application/pdf","creator":"rguseino","file_name":"thesis_rguseinov.pdf","access_level":"open_access"},{"content_type":"application/x-zip-compressed","file_size":76207597,"creator":"rguseino","file_name":"thesis_source.zip","access_level":"closed","date_updated":"2020-09-16T15:11:01Z","date_created":"2020-09-11T09:39:48Z","checksum":"e8fd944c960c20e0e27e6548af69121d","relation":"source_file","file_id":"8374"}],"keyword":["computer-aided design","shape modeling","self-morphing","mechanical engineering"],"article_processing_charge":"No","has_accepted_license":"1","day":"21","citation":{"ista":"Guseinov R. 2020. Computational design of curved thin shells: From glass façades to programmable matter. Institute of Science and Technology Austria.","apa":"Guseinov, R. (2020). Computational design of curved thin shells: From glass façades to programmable matter. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:8366","ieee":"R. Guseinov, “Computational design of curved thin shells: From glass façades to programmable matter,” Institute of Science and Technology Austria, 2020.","ama":"Guseinov R. Computational design of curved thin shells: From glass façades to programmable matter. 2020. doi:10.15479/AT:ISTA:8366","chicago":"Guseinov, Ruslan. “Computational Design of Curved Thin Shells: From Glass Façades to Programmable Matter.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:8366.","mla":"Guseinov, Ruslan. Computational Design of Curved Thin Shells: From Glass Façades to Programmable Matter. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:8366.","short":"R. Guseinov, Computational Design of Curved Thin Shells: From Glass Façades to Programmable Matter, Institute of Science and Technology Austria, 2020."},"page":"118","date_published":"2020-09-21T00:00:00Z"},{"ec_funded":1,"file_date_updated":"2023-05-23T20:54:43Z","article_number":"208","related_material":{"record":[{"id":"8366","relation":"dissertation_contains","status":"public"},{"status":"public","relation":"research_data","id":"8761"}],"link":[{"url":"https://ist.ac.at/en/news/bend-dont-break/","description":"News on IST Homepage","relation":"press_release"}]},"author":[{"last_name":"Gavriil","first_name":"Konstantinos","full_name":"Gavriil, Konstantinos"},{"last_name":"Guseinov","first_name":"Ruslan","orcid":"0000-0001-9819-5077","id":"3AB45EE2-F248-11E8-B48F-1D18A9856A87","full_name":"Guseinov, Ruslan"},{"id":"2DC83906-F248-11E8-B48F-1D18A9856A87","first_name":"Jesus","last_name":"Perez Rodriguez","full_name":"Perez Rodriguez, Jesus"},{"first_name":"Davide","last_name":"Pellis","full_name":"Pellis, Davide"},{"full_name":"Henderson, Paul M","last_name":"Henderson","first_name":"Paul M","orcid":"0000-0002-5198-7445","id":"13C09E74-18D9-11E9-8878-32CFE5697425"},{"last_name":"Rist","first_name":"Florian","full_name":"Rist, Florian"},{"first_name":"Helmut","last_name":"Pottmann","full_name":"Pottmann, Helmut"},{"id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385","first_name":"Bernd","last_name":"Bickel","full_name":"Bickel, Bernd"}],"volume":39,"date_updated":"2024-02-21T12:43:21Z","date_created":"2020-09-23T11:30:02Z","year":"2020","acknowledgement":"We thank IST Austria’s Scientific Computing team for their support, Corinna Datsiou and Sophie Pennetier for their expert input on the practical applications of cold bent glass, and Zaha Hadid Architects and Waagner Biro for providing the architectural datasets. Photo of Fondation Louis Vuitton by Francisco Anzola / CC BY 2.0 / cropped.\r\nPhoto of Opus by Danica O. Kus. This project has received funding from the European Union’s\r\nHorizon 2020 research and innovation program under grant agreement No 675789 - Algebraic Representations in Computer-Aided Design for complEx Shapes (ARCADES), from the European Research Council (ERC) under grant agreement No 715767 - MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling, and SFB-Transregio “Discretization in Geometry and Dynamics” through grant I 2978 of the Austrian Science Fund (FWF). F. Rist and K. Gavriil have been partially supported by KAUST baseline funding.","publisher":"Association for Computing Machinery","department":[{"_id":"BeBi"}],"publication_status":"published","publication_identifier":{"issn":["0730-0301"],"eissn":["1557-7368"]},"month":"11","doi":"10.1145/3414685.3417843","language":[{"iso":"eng"}],"acknowledged_ssus":[{"_id":"ScienComp"}],"oa":1,"external_id":{"isi":["000595589100048"],"arxiv":["2009.03667"]},"project":[{"name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","call_identifier":"H2020","grant_number":"715767","_id":"24F9549A-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","isi":1,"issue":"6","abstract":[{"lang":"eng","text":"Cold bent glass is a promising and cost-efficient method for realizing doubly curved glass facades. They are produced by attaching planar glass sheets to curved frames and require keeping the occurring stress within safe limits.\r\nHowever, it is very challenging to navigate the design space of cold bent glass panels due to the fragility of the material, which impedes the form-finding for practically feasible and aesthetically pleasing cold bent glass facades. We propose an interactive, data-driven approach for designing cold bent glass facades that can be seamlessly integrated into a typical architectural design pipeline. Our method allows non-expert users to interactively edit a parametric surface while providing real-time feedback on the deformed shape and maximum stress of cold bent glass panels. Designs are automatically refined to minimize several fairness criteria while maximal stresses are kept within glass limits. We achieve interactive frame rates by using a differentiable Mixture Density Network trained from more than a million simulations. Given a curved boundary, our regression model is capable of handling multistable\r\nconfigurations and accurately predicting the equilibrium shape of the panel and its corresponding maximal stress. We show predictions are highly accurate and validate our results with a physical realization of a cold bent glass surface."}],"type":"journal_article","file":[{"file_name":"coldglass.pdf","access_level":"open_access","creator":"bbickel","file_size":28964641,"content_type":"application/pdf","file_id":"13084","relation":"main_file","date_created":"2023-05-23T20:54:43Z","date_updated":"2023-05-23T20:54:43Z","success":1,"checksum":"c7f67717ad74e670b7daeae732abe151"}],"oa_version":"Submitted Version","_id":"8562","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","intvolume":" 39","status":"public","ddc":["000"],"title":"Computational design of cold bent glass façades","article_processing_charge":"No","has_accepted_license":"1","day":"26","scopus_import":"1","date_published":"2020-11-26T00:00:00Z","citation":{"chicago":"Gavriil, Konstantinos, Ruslan Guseinov, Jesus Perez Rodriguez, Davide Pellis, Paul M Henderson, Florian Rist, Helmut Pottmann, and Bernd Bickel. “Computational Design of Cold Bent Glass Façades.” ACM Transactions on Graphics. Association for Computing Machinery, 2020. https://doi.org/10.1145/3414685.3417843.","short":"K. Gavriil, R. Guseinov, J. Perez Rodriguez, D. Pellis, P.M. Henderson, F. Rist, H. Pottmann, B. Bickel, ACM Transactions on Graphics 39 (2020).","mla":"Gavriil, Konstantinos, et al. “Computational Design of Cold Bent Glass Façades.” ACM Transactions on Graphics, vol. 39, no. 6, 208, Association for Computing Machinery, 2020, doi:10.1145/3414685.3417843.","apa":"Gavriil, K., Guseinov, R., Perez Rodriguez, J., Pellis, D., Henderson, P. M., Rist, F., … Bickel, B. (2020). Computational design of cold bent glass façades. ACM Transactions on Graphics. Association for Computing Machinery. https://doi.org/10.1145/3414685.3417843","ieee":"K. Gavriil et al., “Computational design of cold bent glass façades,” ACM Transactions on Graphics, vol. 39, no. 6. Association for Computing Machinery, 2020.","ista":"Gavriil K, Guseinov R, Perez Rodriguez J, Pellis D, Henderson PM, Rist F, Pottmann H, Bickel B. 2020. Computational design of cold bent glass façades. ACM Transactions on Graphics. 39(6), 208.","ama":"Gavriil K, Guseinov R, Perez Rodriguez J, et al. Computational design of cold bent glass façades. ACM Transactions on Graphics. 2020;39(6). doi:10.1145/3414685.3417843"},"publication":"ACM Transactions on Graphics","article_type":"original"},{"oa_version":"Published Version","file":[{"success":1,"date_updated":"2020-08-06T09:35:37Z","date_created":"2020-08-06T09:35:37Z","relation":"main_file","file_id":"8204","content_type":"application/pdf","file_size":3308906,"creator":"dernst","access_level":"open_access","file_name":"2020_NanoLetters_Katsaros.pdf"}],"intvolume":" 20","status":"public","title":"Zero field splitting of heavy-hole states in quantum dots","ddc":["530"],"_id":"8203","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","issue":"7","abstract":[{"text":"Using inelastic cotunneling spectroscopy we observe a zero field splitting within the spin triplet manifold of Ge hut wire quantum dots. The states with spin ±1 in the confinement direction are energetically favored by up to 55 μeV compared to the spin 0 triplet state because of the strong spin–orbit coupling. The reported effect should be observable in a broad class of strongly confined hole quantum-dot systems and might need to be considered when operating hole spin qubits.","lang":"eng"}],"type":"journal_article","date_published":"2020-06-01T00:00:00Z","page":"5201-5206","article_type":"original","citation":{"chicago":"Katsaros, Georgios, Josip Kukucka, Lada Vukušić, Hannes Watzinger, Fei Gao, Ting Wang, Jian-Jun Zhang, and Karsten Held. “Zero Field Splitting of Heavy-Hole States in Quantum Dots.” Nano Letters. American Chemical Society, 2020. https://doi.org/10.1021/acs.nanolett.0c01466.","short":"G. Katsaros, J. Kukucka, L. Vukušić, H. Watzinger, F. Gao, T. Wang, J.-J. Zhang, K. Held, Nano Letters 20 (2020) 5201–5206.","mla":"Katsaros, Georgios, et al. “Zero Field Splitting of Heavy-Hole States in Quantum Dots.” Nano Letters, vol. 20, no. 7, American Chemical Society, 2020, pp. 5201–06, doi:10.1021/acs.nanolett.0c01466.","apa":"Katsaros, G., Kukucka, J., Vukušić, L., Watzinger, H., Gao, F., Wang, T., … Held, K. (2020). Zero field splitting of heavy-hole states in quantum dots. Nano Letters. American Chemical Society. https://doi.org/10.1021/acs.nanolett.0c01466","ieee":"G. Katsaros et al., “Zero field splitting of heavy-hole states in quantum dots,” Nano Letters, vol. 20, no. 7. American Chemical Society, pp. 5201–5206, 2020.","ista":"Katsaros G, Kukucka J, Vukušić L, Watzinger H, Gao F, Wang T, Zhang J-J, Held K. 2020. Zero field splitting of heavy-hole states in quantum dots. Nano Letters. 20(7), 5201–5206.","ama":"Katsaros G, Kukucka J, Vukušić L, et al. Zero field splitting of heavy-hole states in quantum dots. Nano Letters. 2020;20(7):5201-5206. doi:10.1021/acs.nanolett.0c01466"},"publication":"Nano Letters","article_processing_charge":"Yes (via OA deal)","has_accepted_license":"1","day":"01","scopus_import":"1","volume":20,"date_created":"2020-08-06T09:25:04Z","date_updated":"2024-02-21T12:44:01Z","related_material":{"record":[{"id":"7689","status":"public","relation":"research_data"}]},"author":[{"orcid":"0000-0001-8342-202X","id":"38DB5788-F248-11E8-B48F-1D18A9856A87","last_name":"Katsaros","first_name":"Georgios","full_name":"Katsaros, Georgios"},{"full_name":"Kukucka, Josip","id":"3F5D8856-F248-11E8-B48F-1D18A9856A87","first_name":"Josip","last_name":"Kukucka"},{"full_name":"Vukušić, Lada","orcid":"0000-0003-2424-8636","id":"31E9F056-F248-11E8-B48F-1D18A9856A87","last_name":"Vukušić","first_name":"Lada"},{"first_name":"Hannes","last_name":"Watzinger","id":"35DF8E50-F248-11E8-B48F-1D18A9856A87","full_name":"Watzinger, Hannes"},{"full_name":"Gao, Fei","first_name":"Fei","last_name":"Gao"},{"first_name":"Ting","last_name":"Wang","orcid":"0000-0002-4619-9575","full_name":"Wang, Ting"},{"last_name":"Zhang","first_name":"Jian-Jun","full_name":"Zhang, Jian-Jun"},{"last_name":"Held","first_name":"Karsten","full_name":"Held, Karsten"}],"department":[{"_id":"GeKa"}],"publisher":"American Chemical Society","publication_status":"published","pmid":1,"year":"2020","acknowledgement":"We acknowledge G. Burkard, V. N. Golovach, C. Kloeffel, D.Loss, P. Rabl, and M. Rancič ́ for helpful discussions. We\r\nfurther acknowledge T. Adletzberger, J. Aguilera, T. Asenov, S. Bagiante, T. Menner, L. Shafeek, P. Taus, P. Traunmüller, and D. Waldhausl for their invaluable assistance. This research was supported by the Scientific Service Units of IST Austria through resources provided by the MIBA Machine Shop and the nanofabrication facility, by the FWF-P 32235 project, by the National Key R&D Program of China (2016YFA0301701, 2016YFA0300600), and by the European Union’s Horizon 2020 research and innovation program under grant agreement no. 862046. All data of this publication are available at 10.15479/AT:ISTA:7689.","ec_funded":1,"file_date_updated":"2020-08-06T09:35:37Z","language":[{"iso":"eng"}],"acknowledged_ssus":[{"_id":"NanoFab"},{"_id":"M-Shop"}],"doi":"10.1021/acs.nanolett.0c01466","project":[{"name":"Towards scalable hut wire quantum devices","call_identifier":"FWF","grant_number":"P32235","_id":"237B3DA4-32DE-11EA-91FC-C7463DDC885E"},{"_id":"237E5020-32DE-11EA-91FC-C7463DDC885E","grant_number":"862046","call_identifier":"H2020","name":"TOPOLOGICALLY PROTECTED AND SCALABLE QUANTUM BITS"}],"isi":1,"quality_controlled":"1","external_id":{"isi":["000548893200066"],"pmid":["32479090"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"publication_identifier":{"eissn":["1530-6992"],"issn":["1530-6984"]},"month":"06"},{"department":[{"_id":"JoCs"}],"publisher":"eLife Sciences Publications","publication_status":"published","year":"2020","acknowledgement":"We thank Michele Nardin and Federico Stella for comments on an earlier version of the manuscript. K Deisseroth for providing the pAAV-CaMKIIα::eNpHR3.0-YFP plasmid through Addgene. E Boyden for providing AAV2/1.CaMKII::ArchT.GFP.WPRE.SV40 plasmid through Penn Vector Core. This work was supported by the Austrian Science Fund (I02072 and I03713) and a Swiss National Science Foundation grant to PS. The authors declare no conflicts of interest.","volume":9,"date_updated":"2024-02-21T12:43:40Z","date_created":"2020-11-08T23:01:25Z","related_material":{"record":[{"id":"8563","status":"public","relation":"research_data"}]},"author":[{"first_name":"Igor","last_name":"Gridchyn","id":"4B60654C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1807-1929","full_name":"Gridchyn, Igor"},{"full_name":"Schönenberger, Philipp","id":"3B9D816C-F248-11E8-B48F-1D18A9856A87","last_name":"Schönenberger","first_name":"Philipp"},{"first_name":"Joseph","last_name":"O'Neill","id":"426376DC-F248-11E8-B48F-1D18A9856A87","full_name":"O'Neill, Joseph"},{"full_name":"Csicsvari, Jozsef L","first_name":"Jozsef L","last_name":"Csicsvari","id":"3FA14672-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5193-4036"}],"article_number":"61106","file_date_updated":"2020-11-09T09:17:40Z","project":[{"name":"Interneuron plasticity during spatial learning","call_identifier":"FWF","grant_number":"I2072-B27","_id":"257D4372-B435-11E9-9278-68D0E5697425"},{"name":"Interneuro Plasticity During Spatial Learning","call_identifier":"FWF","grant_number":"I03713","_id":"2654F984-B435-11E9-9278-68D0E5697425"}],"isi":1,"quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"isi":["000584369000001"]},"oa":1,"language":[{"iso":"eng"}],"doi":"10.7554/eLife.61106","publication_identifier":{"eissn":["2050084X"]},"month":"10","intvolume":" 9","status":"public","title":"Optogenetic inhibition-mediated activity-dependent modification of CA1 pyramidal-interneuron connections during behavior","ddc":["570"],"_id":"8740","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","oa_version":"Published Version","file":[{"relation":"main_file","file_id":"8749","date_updated":"2020-11-09T09:17:40Z","date_created":"2020-11-09T09:17:40Z","checksum":"6a7b0543c440f4c000a1864e69377d95","success":1,"file_name":"2020_eLife_Gridchyn.pdf","access_level":"open_access","file_size":447669,"content_type":"application/pdf","creator":"dernst"}],"type":"journal_article","abstract":[{"lang":"eng","text":"In vitro work revealed that excitatory synaptic inputs to hippocampal inhibitory interneurons could undergo Hebbian, associative, or non-associative plasticity. Both behavioral and learning-dependent reorganization of these connections has also been demonstrated by measuring spike transmission probabilities in pyramidal cell-interneuron spike cross-correlations that indicate monosynaptic connections. Here we investigated the activity-dependent modification of these connections during exploratory behavior in rats by optogenetically inhibiting pyramidal cell and interneuron subpopulations. Light application and associated firing alteration of pyramidal and interneuron populations led to lasting changes in pyramidal-interneuron connection weights as indicated by spike transmission changes. Spike transmission alterations were predicted by the light-mediated changes in the number of pre- and postsynaptic spike pairing events and by firing rate changes of interneurons but not pyramidal cells. This work demonstrates the presence of activity-dependent associative and non-associative reorganization of pyramidal-interneuron connections triggered by the optogenetic modification of the firing rate and spike synchrony of cells."}],"article_type":"original","citation":{"ieee":"I. Gridchyn, P. Schönenberger, J. O’Neill, and J. L. Csicsvari, “Optogenetic inhibition-mediated activity-dependent modification of CA1 pyramidal-interneuron connections during behavior,” eLife, vol. 9. eLife Sciences Publications, 2020.","apa":"Gridchyn, I., Schönenberger, P., O’Neill, J., & Csicsvari, J. L. (2020). Optogenetic inhibition-mediated activity-dependent modification of CA1 pyramidal-interneuron connections during behavior. ELife. eLife Sciences Publications. https://doi.org/10.7554/eLife.61106","ista":"Gridchyn I, Schönenberger P, O’Neill J, Csicsvari JL. 2020. Optogenetic inhibition-mediated activity-dependent modification of CA1 pyramidal-interneuron connections during behavior. eLife. 9, 61106.","ama":"Gridchyn I, Schönenberger P, O’Neill J, Csicsvari JL. Optogenetic inhibition-mediated activity-dependent modification of CA1 pyramidal-interneuron connections during behavior. eLife. 2020;9. doi:10.7554/eLife.61106","chicago":"Gridchyn, Igor, Philipp Schönenberger, Joseph O’Neill, and Jozsef L Csicsvari. “Optogenetic Inhibition-Mediated Activity-Dependent Modification of CA1 Pyramidal-Interneuron Connections during Behavior.” ELife. eLife Sciences Publications, 2020. https://doi.org/10.7554/eLife.61106.","short":"I. Gridchyn, P. Schönenberger, J. O’Neill, J.L. Csicsvari, ELife 9 (2020).","mla":"Gridchyn, Igor, et al. “Optogenetic Inhibition-Mediated Activity-Dependent Modification of CA1 Pyramidal-Interneuron Connections during Behavior.” ELife, vol. 9, 61106, eLife Sciences Publications, 2020, doi:10.7554/eLife.61106."},"publication":"eLife","date_published":"2020-10-05T00:00:00Z","scopus_import":"1","article_processing_charge":"No","has_accepted_license":"1","day":"05"},{"publisher":"Institute of Science and Technology Austria","department":[{"_id":"BeBi"}],"status":"public","ddc":["000"],"title":"Supplementary data for \"Computational design of curved thin shells: from glass façades to programmable matter\"","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"8375","year":"2020","oa_version":"Published Version","file":[{"creator":"rguseino","file_size":29214988,"content_type":"video/mp4","access_level":"open_access","file_name":"supplementary_movie_1.mp4","success":1,"checksum":"4029ffd65fb82ef2366b2fc2a4908e16","date_updated":"2020-09-11T09:45:21Z","date_created":"2020-09-11T09:45:21Z","file_id":"8376","relation":"main_file"},{"access_level":"open_access","file_name":"supplementary_movie_2.mp4","file_size":28449475,"content_type":"video/mp4","creator":"rguseino","relation":"main_file","file_id":"8377","checksum":"8ed03b04d80f1a4e622cb22e6100afd8","success":1,"date_updated":"2020-09-11T09:45:25Z","date_created":"2020-09-11T09:45:25Z"},{"file_name":"supplementary_movie_3.mp4","access_level":"open_access","creator":"rguseino","content_type":"video/mp4","file_size":26315853,"file_id":"8378","relation":"main_file","date_updated":"2020-09-11T09:45:28Z","date_created":"2020-09-11T09:45:28Z","success":1,"checksum":"ad6864afb5e694e5c52a88fba4e02eea"},{"file_id":"8379","relation":"main_file","date_created":"2020-09-11T09:45:33Z","date_updated":"2020-09-11T09:45:33Z","success":1,"checksum":"b079cef7871fe1afb69af0e2b099f3b1","file_name":"supplementary_movie_4.mp4","access_level":"open_access","creator":"rguseino","file_size":25198755,"content_type":"video/mp4"},{"success":1,"checksum":"9d1d48a8ed5c109a999c51b044ee523d","date_created":"2020-09-11T09:45:36Z","date_updated":"2020-09-11T09:45:36Z","file_id":"8380","relation":"main_file","creator":"rguseino","file_size":29011354,"content_type":"video/mp4","access_level":"open_access","file_name":"supplementary_movie_5.mp4"},{"creator":"rguseino","file_size":586,"content_type":"text/plain","file_name":"readme.txt","access_level":"open_access","date_updated":"2020-09-11T09:52:36Z","date_created":"2020-09-11T09:52:36Z","success":1,"checksum":"d414d0059e982d752d218756b3c3ce05","file_id":"8381","relation":"main_file"}],"date_updated":"2024-02-21T12:44:29Z","date_created":"2020-09-11T09:52:54Z","related_material":{"record":[{"id":"8366","relation":"used_in_publication","status":"public"}]},"contributor":[{"id":"3AB45EE2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9819-5077","first_name":"Ruslan","contributor_type":"researcher","last_name":"Guseinov"},{"contributor_type":"researcher","last_name":"McMahan","first_name":"Connor"},{"id":"2DC83906-F248-11E8-B48F-1D18A9856A87","first_name":"Jesus","contributor_type":"researcher","last_name":"Perez Rodriguez"},{"first_name":"Chiara","contributor_type":"researcher","last_name":"Daraio"},{"id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385","first_name":"Bernd","last_name":"Bickel","contributor_type":"researcher"}],"author":[{"last_name":"Guseinov","first_name":"Ruslan","orcid":"0000-0001-9819-5077","id":"3AB45EE2-F248-11E8-B48F-1D18A9856A87","full_name":"Guseinov, Ruslan"}],"type":"research_data","ec_funded":1,"file_date_updated":"2020-09-11T09:52:36Z","abstract":[{"text":"Supplementary movies showing the following sequences for spatio-temporarily programmed shells: input geometry and actuation time landscape; comparison of morphing processes from a camera recording and a simulation; final actuated shape.","lang":"eng"}],"project":[{"name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","call_identifier":"H2020","grant_number":"715767","_id":"24F9549A-B435-11E9-9278-68D0E5697425"}],"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"citation":{"chicago":"Guseinov, Ruslan. “Supplementary Data for ‘Computational Design of Curved Thin Shells: From Glass Façades to Programmable Matter.’” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:8375.","mla":"Guseinov, Ruslan. Supplementary Data for “Computational Design of Curved Thin Shells: From Glass Façades to Programmable Matter.” Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:8375.","short":"R. Guseinov, (2020).","ista":"Guseinov R. 2020. Supplementary data for ‘Computational design of curved thin shells: from glass façades to programmable matter’, Institute of Science and Technology Austria, 10.15479/AT:ISTA:8375.","apa":"Guseinov, R. (2020). Supplementary data for “Computational design of curved thin shells: from glass façades to programmable matter.” Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:8375","ieee":"R. Guseinov, “Supplementary data for ‘Computational design of curved thin shells: from glass façades to programmable matter.’” Institute of Science and Technology Austria, 2020.","ama":"Guseinov R. Supplementary data for “Computational design of curved thin shells: from glass façades to programmable matter.” 2020. doi:10.15479/AT:ISTA:8375"},"date_published":"2020-09-21T00:00:00Z","doi":"10.15479/AT:ISTA:8375","has_accepted_license":"1","article_processing_charge":"No","month":"09","day":"21"},{"month":"05","day":"01","has_accepted_license":"1","article_processing_charge":"No","date_published":"2020-05-01T00:00:00Z","doi":"10.15479/AT:ISTA:7689","project":[{"grant_number":"862046","_id":"237E5020-32DE-11EA-91FC-C7463DDC885E","call_identifier":"H2020","name":"TOPOLOGICALLY PROTECTED AND SCALABLE QUANTUM BITS"},{"call_identifier":"FWF","name":"Towards scalable hut wire quantum devices","grant_number":"P32235","_id":"237B3DA4-32DE-11EA-91FC-C7463DDC885E"}],"tmp":{"short":"CC0 (1.0)","image":"/images/cc_0.png","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","name":"Creative Commons Public Domain Dedication (CC0 1.0)"},"citation":{"chicago":"Katsaros, Georgios. “Supplementary Data for ‘Zero Field Splitting of Heavy-Hole States in Quantum Dots.’” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:7689.","short":"G. Katsaros, (2020).","mla":"Katsaros, Georgios. Supplementary Data for “Zero Field Splitting of Heavy-Hole States in Quantum Dots.” Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:7689.","apa":"Katsaros, G. (2020). Supplementary data for “Zero field splitting of heavy-hole states in quantum dots.” Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:7689","ieee":"G. Katsaros, “Supplementary data for ‘Zero field splitting of heavy-hole states in quantum dots.’” Institute of Science and Technology Austria, 2020.","ista":"Katsaros G. 2020. Supplementary data for ‘Zero field splitting of heavy-hole states in quantum dots’, Institute of Science and Technology Austria, 10.15479/AT:ISTA:7689.","ama":"Katsaros G. Supplementary data for “Zero field splitting of heavy-hole states in quantum dots.” 2020. doi:10.15479/AT:ISTA:7689"},"oa":1,"file_date_updated":"2020-07-14T12:48:02Z","abstract":[{"lang":"eng","text":"These are the supplementary research data to the publication \"Zero field splitting of heavy-hole states in quantum dots\". All matrix files have the same format. Within each column the bias voltage is changed. Each column corresponds to either a different gate voltage or magnetic field. The voltage values are given in mV, the current values in pA. Find a specific description in the included Readme file.\r\n"}],"ec_funded":1,"type":"research_data","date_updated":"2024-02-21T12:44:02Z","date_created":"2020-05-01T15:14:46Z","oa_version":"Published Version","file":[{"file_id":"7786","relation":"main_file","date_created":"2020-05-01T15:13:28Z","date_updated":"2020-07-14T12:48:02Z","checksum":"d23c0cb9e2d19e14e2f902b88b97c05d","file_name":"DOI_ZeroFieldSplitting.zip","access_level":"open_access","creator":"gkatsaro","file_size":5514403,"content_type":"application/x-zip-compressed"}],"author":[{"full_name":"Katsaros, Georgios","orcid":"0000-0001-8342-202X","id":"38DB5788-F248-11E8-B48F-1D18A9856A87","last_name":"Katsaros","first_name":"Georgios"}],"related_material":{"record":[{"status":"public","relation":"used_in_publication","id":"8203"}]},"contributor":[{"id":"38DB5788-F248-11E8-B48F-1D18A9856A87","contributor_type":"contact_person","last_name":"Katsaros","first_name":"Georgios"}],"status":"public","ddc":["530"],"title":"Supplementary data for \"Zero field splitting of heavy-hole states in quantum dots\"","publisher":"Institute of Science and Technology Austria","department":[{"_id":"GeKa"}],"_id":"7689","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2020"},{"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"citation":{"short":"R. Guseinov, (2020).","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.","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.","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","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."},"oa":1,"project":[{"name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","call_identifier":"H2020","_id":"24F9549A-B435-11E9-9278-68D0E5697425","grant_number":"715767"}],"date_published":"2020-11-23T00:00:00Z","doi":"10.15479/AT:ISTA:8761","acknowledged_ssus":[{"_id":"ScienComp"}],"month":"11","day":"23","has_accepted_license":"1","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"8761","year":"2020","status":"public","title":"Supplementary data for \"Computational design of cold bent glass façades\"","ddc":["000"],"publisher":"Institute of Science and Technology Austria","department":[{"_id":"BeBi"}],"author":[{"full_name":"Guseinov, Ruslan","orcid":"0000-0001-9819-5077","id":"3AB45EE2-F248-11E8-B48F-1D18A9856A87","last_name":"Guseinov","first_name":"Ruslan"}],"related_material":{"link":[{"relation":"software","url":"https://github.com/russelmann/cold-glass-acm"}],"record":[{"status":"public","relation":"used_in_publication","id":"8562"}]},"contributor":[{"first_name":"Konstantinos","last_name":"Gavriil","contributor_type":"researcher"},{"orcid":"0000-0001-9819-5077","id":"3AB45EE2-F248-11E8-B48F-1D18A9856A87","contributor_type":"researcher","last_name":"Guseinov","first_name":"Ruslan"},{"first_name":"Jesus","contributor_type":"researcher","last_name":"Perez Rodriguez","id":"2DC83906-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Davide","last_name":"Pellis","contributor_type":"researcher"},{"first_name":"Paul M","contributor_type":"researcher","last_name":"Henderson","id":"13C09E74-18D9-11E9-8878-32CFE5697425","orcid":"0000-0002-5198-7445"},{"last_name":"Rist","contributor_type":"researcher","first_name":"Florian"},{"contributor_type":"researcher","last_name":"Pottmann","first_name":"Helmut"},{"first_name":"Bernd","last_name":"Bickel","contributor_type":"researcher","id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385"}],"date_updated":"2024-02-21T12:43:22Z","date_created":"2020-11-16T10:47:18Z","oa_version":"Published Version","file":[{"success":1,"checksum":"f5ae57b97017b9f61081032703361233","date_created":"2020-11-16T10:31:29Z","date_updated":"2020-11-16T10:31:29Z","file_id":"8762","relation":"main_file","creator":"rguseino","content_type":"application/x-gzip","file_size":15378270,"access_level":"open_access","file_name":"mdn_model.tar.gz"},{"content_type":"application/x-gzip","file_size":615387734,"creator":"rguseino","file_name":"optimal_panels_data.tar.gz","access_level":"open_access","date_updated":"2020-11-16T10:43:23Z","date_created":"2020-11-16T10:43:23Z","checksum":"b0d25e04060ee78c585ee2f23542c744","success":1,"relation":"main_file","file_id":"8763"},{"file_id":"8770","relation":"main_file","success":1,"checksum":"69c1dde3434ada86d125e0c2588caf1e","date_updated":"2020-11-18T10:04:59Z","date_created":"2020-11-18T10:04:59Z","access_level":"open_access","file_name":"readme.txt","creator":"rguseino","file_size":1228,"content_type":"text/plain"}],"type":"research_data","file_date_updated":"2020-11-18T10:04:59Z","ec_funded":1},{"_id":"8563","year":"2020","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","ddc":["570"],"title":"Optogenetic alteration of hippocampal network activity","department":[{"_id":"JoCs"}],"publisher":"Institute of Science and Technology Austria","author":[{"id":"3FA14672-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5193-4036","first_name":"Jozsef L","last_name":"Csicsvari","full_name":"Csicsvari, Jozsef L"},{"full_name":"Gridchyn, Igor","first_name":"Igor","last_name":"Gridchyn","id":"4B60654C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1807-1929"},{"last_name":"Schönenberger","first_name":"Philipp","id":"3B9D816C-F248-11E8-B48F-1D18A9856A87","full_name":"Schönenberger, Philipp"}],"contributor":[{"contributor_type":"project_leader","last_name":"Csicsvari","first_name":"Jozsef L","orcid":"0000-0002-5193-4036","id":"3FA14672-F248-11E8-B48F-1D18A9856A87"}],"related_material":{"record":[{"id":"8740","status":"public","relation":"used_in_publication"}]},"date_updated":"2024-02-21T12:43:41Z","date_created":"2020-09-23T14:39:54Z","oa_version":"Published Version","file":[{"file_id":"8564","relation":"main_file","success":1,"checksum":"a16098a6d172f9c42ab5af5f6991668c","date_updated":"2020-09-23T14:36:17Z","date_created":"2020-09-23T14:36:17Z","access_level":"open_access","file_name":"upload.tgz","creator":"jozsef","content_type":"application/x-compressed","file_size":145243906},{"date_updated":"2020-10-19T10:12:29Z","date_created":"2020-10-19T10:12:29Z","success":1,"checksum":"0bfc54b7e14c0694cd081617318ba606","file_id":"8675","relation":"main_file","creator":"jozsef","file_size":11648,"content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","file_name":"redme.docx","access_level":"open_access"}],"type":"research_data","file_date_updated":"2020-10-19T10:12:29Z","abstract":[{"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.","lang":"eng"}],"citation":{"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","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.","ama":"Csicsvari JL, Gridchyn I, Schönenberger P. Optogenetic alteration of hippocampal network activity. 2020. doi: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.","short":"J.L. Csicsvari, I. Gridchyn, P. Schönenberger, (2020).","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."},"tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png"},"oa":1,"doi":"10.15479/AT:ISTA:8563","date_published":"2020-10-19T00:00:00Z","day":"19","month":"10","has_accepted_license":"1","article_processing_charge":"No"},{"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."}],"type":"journal_article","file":[{"date_created":"2020-01-15T14:35:34Z","date_updated":"2020-07-14T12:47:55Z","checksum":"7db23fef2f4cda712f17f1004116ddff","relation":"main_file","file_id":"7336","file_size":1315270,"content_type":"application/pdf","creator":"rguseino","file_name":"2020_NatureComm_Guseinov.pdf","access_level":"open_access"}],"oa_version":"Published Version","title":"Programming temporal morphing of self-actuated shells","status":"public","ddc":["000"],"intvolume":" 11","_id":"7262","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","day":"13","article_processing_charge":"No","has_accepted_license":"1","keyword":["Design","Synthesis and processing","Mechanical engineering","Polymers"],"scopus_import":"1","date_published":"2020-01-13T00:00:00Z","article_type":"original","publication":"Nature Communications","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","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.","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","ista":"Guseinov R, McMahan C, Perez Rodriguez J, Daraio C, Bickel B. 2020. Programming temporal morphing of self-actuated shells. Nature Communications. 11, 237.","short":"R. Guseinov, C. McMahan, J. Perez Rodriguez, C. Daraio, B. Bickel, Nature Communications 11 (2020).","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.","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."},"file_date_updated":"2020-07-14T12:47:55Z","ec_funded":1,"article_number":"237","date_updated":"2024-02-21T12:45:02Z","date_created":"2020-01-13T16:54:26Z","volume":11,"author":[{"full_name":"Guseinov, Ruslan","id":"3AB45EE2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9819-5077","first_name":"Ruslan","last_name":"Guseinov"},{"first_name":"Connor","last_name":"McMahan","full_name":"McMahan, Connor"},{"full_name":"Perez Rodriguez, Jesus","id":"2DC83906-F248-11E8-B48F-1D18A9856A87","last_name":"Perez Rodriguez","first_name":"Jesus"},{"last_name":"Daraio","first_name":"Chiara","full_name":"Daraio, Chiara"},{"orcid":"0000-0001-6511-9385","id":"49876194-F248-11E8-B48F-1D18A9856A87","last_name":"Bickel","first_name":"Bernd","full_name":"Bickel, Bernd"}],"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"8366"},{"status":"public","relation":"research_data","id":"7154"}],"link":[{"url":"https://ist.ac.at/en/news/geometry-meets-time/","relation":"press_release","description":"News on IST Homepage"}]},"publication_status":"published","publisher":"Springer Nature","department":[{"_id":"BeBi"}],"year":"2020","month":"01","publication_identifier":{"issn":["2041-1723"]},"language":[{"iso":"eng"}],"doi":"10.1038/s41467-019-14015-2","isi":1,"quality_controlled":"1","project":[{"name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425"},{"call_identifier":"H2020","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","_id":"24F9549A-B435-11E9-9278-68D0E5697425","grant_number":"715767"}],"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"isi":["000511916800015"]}},{"file_date_updated":"2023-12-01T10:39:59Z","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."}],"type":"research_data","file":[{"file_size":49297,"content_type":"application/zip","creator":"fschur","file_name":"3Dprint-files_download_v2.zip","access_level":"open_access","date_updated":"2023-11-22T14:58:44Z","date_created":"2023-11-22T14:58:44Z","checksum":"0108616e2a59e51879ea51299a29b091","success":1,"relation":"main_file","file_id":"14593"},{"file_name":"readme.txt","access_level":"open_access","file_size":641,"content_type":"text/plain","creator":"cchlebak","relation":"main_file","file_id":"14637","date_updated":"2023-12-01T10:39:59Z","date_created":"2023-12-01T10:39:59Z","checksum":"4c66ddedee4d01c1c4a7978208350cfc","success":1}],"oa_version":"Published Version","date_created":"2023-11-22T15:00:57Z","date_updated":"2024-02-21T12:44:48Z","contributor":[{"first_name":"Florian","contributor_type":"researcher","last_name":"Fäßler","id":"404F5528-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7149-769X"},{"id":"45FD126C-F248-11E8-B48F-1D18A9856A87","first_name":"Bettina","last_name":"Zens","contributor_type":"researcher"},{"contributor_type":"researcher","last_name":"Hauschild","first_name":"Robert","id":"4E01D6B4-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0003-4790-8078","id":"48AD8942-F248-11E8-B48F-1D18A9856A87","last_name":"Schur","contributor_type":"researcher","first_name":"Florian KM"}],"related_material":{"record":[{"status":"public","relation":"research_data","id":"8586"}]},"author":[{"orcid":"0000-0003-4790-8078","id":"48AD8942-F248-11E8-B48F-1D18A9856A87","last_name":"Schur","first_name":"Florian KM","full_name":"Schur, Florian KM"}],"publisher":"Institute of Science and Technology Austria","department":[{"_id":"FlSc"}],"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","ddc":["570"],"year":"2020","_id":"14592","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","article_processing_charge":"No","month":"12","day":"01","date_published":"2020-12-01T00:00:00Z","doi":"10.15479/AT:ISTA:14592","project":[{"name":"Structure and isoform diversity of the Arp2/3 complex","_id":"9B954C5C-BA93-11EA-9121-9846C619BF3A","grant_number":"P33367"}],"oa":1,"tmp":{"name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","image":"/images/cc_by_nc_sa.png","short":"CC BY-NC-SA (4.0)"},"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","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.","short":"F.K. Schur, (2020).","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.","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."}},{"date_published":"2020-01-01T00:00:00Z","page":"27-39","citation":{"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.","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.","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.","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.","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","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"},"publication":"Complex Networks and their applications VIII","article_processing_charge":"No","has_accepted_license":"1","day":"01","scopus_import":"1","oa_version":"Submitted Version","file":[{"content_type":"application/pdf","file_size":310598,"creator":"bchatter","file_name":"main.pdf","access_level":"open_access","date_updated":"2020-10-08T08:16:48Z","date_created":"2020-10-08T08:16:48Z","checksum":"8951f094c8c7dae9ff8db885199bc296","success":1,"relation":"main_file","file_id":"8625"}],"intvolume":" 881","title":"A persistent homology perspective to the link prediction problem","ddc":["004"],"status":"public","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_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"],"type":"conference","language":[{"iso":"eng"}],"doi":"10.1007/978-3-030-36687-2_3","conference":{"end_date":"2019-12-12","location":"Lisbon, Portugal","start_date":"2019-12-10","name":"COMPLEX: International Conference on Complex Networks and their Applications"},"project":[{"call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","isi":1,"external_id":{"isi":["000843927300003"]},"oa":1,"publication_identifier":{"eissn":["18609503"],"isbn":["9783030366865"],"issn":["1860949X"]},"month":"01","volume":881,"date_updated":"2024-02-22T13:16:06Z","date_created":"2019-12-29T23:00:45Z","author":[{"last_name":"Bhatia","first_name":"Sumit","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"}],"publisher":"Springer Nature","department":[{"_id":"DaAl"}],"publication_status":"published","year":"2020","ec_funded":1,"file_date_updated":"2020-10-08T08:16:48Z"},{"_id":"10556","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","title":"Asynchronous distributed key generation for computationally-secure randomness, consensus, and threshold signatures","status":"public","oa_version":"Preprint","type":"conference","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:1751–1767. doi: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.","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","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.","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.","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.","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."},"page":"1751–1767","date_published":"2020-10-30T00:00:00Z","scopus_import":"1","day":"30","article_processing_charge":"No","year":"2020","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.","publication_status":"published","publisher":"Association for Computing Machinery","department":[{"_id":"ElKo"}],"author":[{"full_name":"Kokoris Kogias, Eleftherios","id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30","first_name":"Eleftherios","last_name":"Kokoris Kogias"},{"full_name":"Malkhi, Dahlia","last_name":"Malkhi","first_name":"Dahlia"},{"last_name":"Spiegelman","first_name":"Alexander","full_name":"Spiegelman, Alexander"}],"date_created":"2021-12-16T13:23:27Z","date_updated":"2024-02-22T13:10:45Z","external_id":{"isi":["000768470400104"]},"main_file_link":[{"url":"https://eprint.iacr.org/2019/1015","open_access":"1"}],"oa":1,"isi":1,"quality_controlled":"1","conference":{"name":"CCS: Computer and Communications Security","start_date":"2020-11-09","location":"Virtual, United States","end_date":"2020-11-13"},"doi":"10.1145/3372297.3423364","language":[{"iso":"eng"}],"month":"10","publication_identifier":{"isbn":["978-1-4503-7089-9"]}},{"day":"01","article_processing_charge":"No","has_accepted_license":"1","publication":"2020 IEEE Real-Time Systems Symposium","citation":{"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.","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.","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","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.","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","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."},"page":"244-256","date_published":"2020-12-01T00:00:00Z","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."}],"_id":"9202","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","title":"Hybridization for stability verification of nonlinear switched systems","status":"public","ddc":["000"],"oa_version":"Submitted Version","file":[{"file_id":"9203","relation":"main_file","date_created":"2021-02-26T16:38:14Z","date_updated":"2021-02-26T16:38:14Z","checksum":"8f97f229316c3b3a6f0cf99297aa0941","file_name":"main.pdf","access_level":"open_access","creator":"mgarcias","content_type":"application/pdf","file_size":1125794}],"month":"12","publication_identifier":{"eisbn":["9781728183244"],"eissn":["2576-3172"]},"external_id":{"isi":["000680435100021"]},"oa":1,"quality_controlled":"1","isi":1,"project":[{"grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","call_identifier":"FWF"}],"conference":{"name":"RTTS: Real-Time Systems Symposium","location":"Houston, TX, USA ","start_date":"2020-12-01","end_date":"2020-12-04"},"doi":"10.1109/RTSS49844.2020.00031","language":[{"iso":"eng"}],"file_date_updated":"2021-02-26T16:38:14Z","year":"2020","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.","publication_status":"published","publisher":"IEEE","department":[{"_id":"ToHe"}],"author":[{"full_name":"Garcia Soto, Miriam","first_name":"Miriam","last_name":"Garcia Soto","id":"4B3207F6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2936-5719"},{"full_name":"Prabhakar, Pavithra","last_name":"Prabhakar","first_name":"Pavithra"}],"date_updated":"2024-02-22T13:25:19Z","date_created":"2021-02-26T16:38:24Z"},{"type":"journal_article","abstract":[{"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.","lang":"eng"}],"_id":"6906","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","intvolume":" 376","status":"public","title":"Optimal rate for Bose-Einstein condensation in the Gross-Pitaevskii regime","oa_version":"Preprint","scopus_import":"1","article_processing_charge":"No","day":"01","citation":{"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.","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.","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","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","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.","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."},"publication":"Communications in Mathematical Physics","page":"1311-1395","article_type":"original","date_published":"2020-06-01T00:00:00Z","ec_funded":1,"year":"2020","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”.","department":[{"_id":"RoSe"}],"publisher":"Springer","publication_status":"published","author":[{"id":"342E7E22-F248-11E8-B48F-1D18A9856A87","first_name":"Chiara","last_name":"Boccato","full_name":"Boccato, Chiara"},{"full_name":"Brennecke, Christian","first_name":"Christian","last_name":"Brennecke"},{"last_name":"Cenatiempo","first_name":"Serena","full_name":"Cenatiempo, Serena"},{"full_name":"Schlein, Benjamin","first_name":"Benjamin","last_name":"Schlein"}],"volume":376,"date_created":"2019-09-24T17:30:59Z","date_updated":"2024-02-22T13:33:02Z","publication_identifier":{"issn":["0010-3616"],"eissn":["1432-0916"]},"month":"06","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1812.03086"}],"external_id":{"arxiv":["1812.03086"],"isi":["000536053300012"]},"oa":1,"project":[{"grant_number":"694227","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","name":"Analysis of quantum many-body systems","call_identifier":"H2020"}],"isi":1,"quality_controlled":"1","doi":"10.1007/s00220-019-03555-9","language":[{"iso":"eng"}]},{"day":"01","article_processing_charge":"No","series_title":"Current Topics in Developmental Biology","scopus_import":"1","date_published":"2020-01-01T00:00:00Z","page":"319-341","publication":"Gastrulation: From Embryonic Pattern to Form","citation":{"chicago":"Bruce, Ashley E.E., and Carl-Philipp J Heisenberg. “Mechanisms of Zebrafish Epiboly: A Current View.” In Gastrulation: From Embryonic Pattern to Form, edited by Lilianna Solnica-Krezel, 136:319–41. Current Topics in Developmental Biology. Elsevier, 2020. https://doi.org/10.1016/bs.ctdb.2019.07.001.","mla":"Bruce, Ashley E. E., and Carl-Philipp J. Heisenberg. “Mechanisms of Zebrafish Epiboly: A Current View.” Gastrulation: From Embryonic Pattern to Form, edited by Lilianna Solnica-Krezel, vol. 136, Elsevier, 2020, pp. 319–41, doi:10.1016/bs.ctdb.2019.07.001.","short":"A.E.E. Bruce, C.-P.J. Heisenberg, in:, L. Solnica-Krezel (Ed.), Gastrulation: From Embryonic Pattern to Form, Elsevier, 2020, pp. 319–341.","ista":"Bruce AEE, Heisenberg C-PJ. 2020.Mechanisms of zebrafish epiboly: A current view. In: Gastrulation: From Embryonic Pattern to Form. vol. 136, 319–341.","ieee":"A. E. E. Bruce and C.-P. J. Heisenberg, “Mechanisms of zebrafish epiboly: A current view,” in Gastrulation: From Embryonic Pattern to Form, vol. 136, L. Solnica-Krezel, Ed. Elsevier, 2020, pp. 319–341.","apa":"Bruce, A. E. E., & Heisenberg, C.-P. J. (2020). Mechanisms of zebrafish epiboly: A current view. In L. Solnica-Krezel (Ed.), Gastrulation: From Embryonic Pattern to Form (Vol. 136, pp. 319–341). Elsevier. https://doi.org/10.1016/bs.ctdb.2019.07.001","ama":"Bruce AEE, Heisenberg C-PJ. Mechanisms of zebrafish epiboly: A current view. In: Solnica-Krezel L, ed. Gastrulation: From Embryonic Pattern to Form. Vol 136. Current Topics in Developmental Biology. Elsevier; 2020:319-341. doi:10.1016/bs.ctdb.2019.07.001"},"abstract":[{"text":"Epiboly is a conserved gastrulation movement describing the thinning and spreading of a sheet or multi-layer of cells. The zebrafish embryo has emerged as a vital model system to address the cellular and molecular mechanisms that drive epiboly. In the zebrafish embryo, the blastoderm, consisting of a simple squamous epithelium (the enveloping layer) and an underlying mass of deep cells, as well as a yolk nuclear syncytium (the yolk syncytial layer) undergo epiboly to internalize the yolk cell during gastrulation. The major events during zebrafish epiboly are: expansion of the enveloping layer and the internal yolk syncytial layer, reduction and removal of the yolk membrane ahead of the advancing blastoderm margin and deep cell rearrangements between the enveloping layer and yolk syncytial layer to thin the blastoderm. Here, work addressing the cellular and molecular mechanisms as well as the sources of the mechanical forces that underlie these events is reviewed. The contribution of recent findings to the current model of epiboly as well as open questions and future prospects are also discussed.","lang":"eng"}],"type":"book_chapter","oa_version":"None","title":"Mechanisms of zebrafish epiboly: A current view","status":"public","intvolume":" 136","_id":"7410","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","month":"01","publication_identifier":{"isbn":["9780128127988"],"issn":["0070-2153"]},"language":[{"iso":"eng"}],"doi":"10.1016/bs.ctdb.2019.07.001","isi":1,"quality_controlled":"1","external_id":{"isi":["000611830600012"]},"date_created":"2020-01-30T09:24:06Z","date_updated":"2024-02-22T13:23:09Z","volume":136,"author":[{"first_name":"Ashley E.E.","last_name":"Bruce","full_name":"Bruce, Ashley E.E."},{"first_name":"Carl-Philipp J","last_name":"Heisenberg","id":"39427864-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0912-4566","full_name":"Heisenberg, Carl-Philipp J"}],"publication_status":"published","publisher":"Elsevier","editor":[{"last_name":"Solnica-Krezel","first_name":"Lilianna ","full_name":"Solnica-Krezel, Lilianna "}],"department":[{"_id":"CaHe"}],"year":"2020"},{"scopus_import":"1","day":"01","article_processing_charge":"Yes (via OA deal)","has_accepted_license":"1","article_type":"original","page":"970-995","publication":"International Journal of Computer Vision","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","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.","short":"R. Sun, C. Lampert, International Journal of Computer Vision 128 (2020) 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.","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."},"date_published":"2020-04-01T00:00:00Z","type":"journal_article","abstract":[{"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.","lang":"eng"}],"issue":"4","ddc":["004"],"status":"public","title":"KS(conf): A light-weight test if a multiclass classifier operates outside of its specifications","intvolume":" 128","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"6944","oa_version":"Published Version","file":[{"creator":"dernst","content_type":"application/pdf","file_size":1715072,"file_name":"2019_IJCV_Sun.pdf","access_level":"open_access","date_updated":"2020-07-14T12:47:45Z","date_created":"2019-11-26T10:30:02Z","checksum":"155e63edf664dcacb3bdc1c2223e606f","file_id":"7110","relation":"main_file"}],"month":"04","publication_identifier":{"issn":["0920-5691"],"eissn":["1573-1405"]},"quality_controlled":"1","isi":1,"project":[{"call_identifier":"FP7","name":"Lifelong Learning of Visual Scene Understanding","grant_number":"308036","_id":"2532554C-B435-11E9-9278-68D0E5697425"},{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}],"external_id":{"isi":["000494406800001"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"language":[{"iso":"eng"}],"doi":"10.1007/s11263-019-01232-x","file_date_updated":"2020-07-14T12:47:45Z","ec_funded":1,"publication_status":"published","publisher":"Springer Nature","department":[{"_id":"ChLa"}],"year":"2020","date_updated":"2024-02-22T14:57:30Z","date_created":"2019-10-14T09:14:28Z","volume":128,"author":[{"full_name":"Sun, Rémy","last_name":"Sun","first_name":"Rémy"},{"orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","last_name":"Lampert","first_name":"Christoph","full_name":"Lampert, Christoph"}],"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"6482"}],"link":[{"url":"https://doi.org/10.1007/s11263-019-01262-5","relation":"erratum"}]}},{"type":"conference","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."}],"issue":"POPL","status":"public","title":"Proving expected sensitivity of probabilistic programs with randomized variable-dependent termination time","ddc":["004"],"intvolume":" 4","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"8324","file":[{"creator":"cziletti","file_size":564151,"content_type":"application/pdf","file_name":"2019_ACM_POPL_Wang.pdf","access_level":"open_access","date_updated":"2020-09-01T11:12:58Z","date_created":"2020-09-01T11:12:58Z","success":1,"checksum":"c6193d109ff4ecb17e7a6513d8eb34c0","file_id":"8328","relation":"main_file"}],"oa_version":"Published Version","scopus_import":"1","day":"01","has_accepted_license":"1","article_processing_charge":"No","publication":"Proceedings of the ACM on Programming Languages","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","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.","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","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.","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.","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."},"date_published":"2020-01-01T00:00:00Z","article_number":"25","file_date_updated":"2020-09-01T11:12:58Z","publication_status":"published","publisher":"ACM","department":[{"_id":"KrCh"}],"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.","year":"2020","date_created":"2020-08-30T22:01:12Z","date_updated":"2024-02-22T15:16:45Z","volume":4,"author":[{"first_name":"Peixin","last_name":"Wang","full_name":"Wang, Peixin"},{"full_name":"Fu, Hongfei","last_name":"Fu","first_name":"Hongfei"},{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"first_name":"Yuxin","last_name":"Deng","full_name":"Deng, Yuxin"},{"full_name":"Xu, Ming","first_name":"Ming","last_name":"Xu"}],"related_material":{"link":[{"relation":"software","url":"https://doi.org/10.5281/zenodo.3533633"}]},"month":"01","publication_identifier":{"eissn":["2475-1421"]},"quality_controlled":"1","project":[{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","name":"Game Theory","call_identifier":"FWF"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"external_id":{"arxiv":["1902.04744"]},"language":[{"iso":"eng"}],"doi":"10.1145/3371093"},{"day":"01","article_processing_charge":"No","scopus_import":"1","date_published":"2020-01-01T00:00:00Z","publication":"Brain, Behavior and Evolution","citation":{"ama":"Salazar JE, Severin D, Vega Zuniga TA, et al. Anatomical specializations related to foraging in the visual system of a nocturnal insectivorous bird, the band-winged nightjar (Aves: Caprimulgiformes). Brain, Behavior and Evolution. 2020;94(1-4):27-36. doi:10.1159/000504162","ieee":"J. E. Salazar et al., “Anatomical specializations related to foraging in the visual system of a nocturnal insectivorous bird, the band-winged nightjar (Aves: Caprimulgiformes),” Brain, Behavior and Evolution, vol. 94, no. 1–4. Karger Publishers, pp. 27–36, 2020.","apa":"Salazar, J. E., Severin, D., Vega Zuniga, T. A., Fernández-Aburto, P., Deichler, A., Sallaberry A., M., & Mpodozis, J. (2020). Anatomical specializations related to foraging in the visual system of a nocturnal insectivorous bird, the band-winged nightjar (Aves: Caprimulgiformes). Brain, Behavior and Evolution. Karger Publishers. https://doi.org/10.1159/000504162","ista":"Salazar JE, Severin D, Vega Zuniga TA, Fernández-Aburto P, Deichler A, Sallaberry A. M, Mpodozis J. 2020. Anatomical specializations related to foraging in the visual system of a nocturnal insectivorous bird, the band-winged nightjar (Aves: Caprimulgiformes). Brain, Behavior and Evolution. 94(1–4), 27–36.","short":"J.E. Salazar, D. Severin, T.A. Vega Zuniga, P. Fernández-Aburto, A. Deichler, M. Sallaberry A., J. Mpodozis, Brain, Behavior and Evolution 94 (2020) 27–36.","mla":"Salazar, Juan Esteban, et al. “Anatomical Specializations Related to Foraging in the Visual System of a Nocturnal Insectivorous Bird, the Band-Winged Nightjar (Aves: Caprimulgiformes).” Brain, Behavior and Evolution, vol. 94, no. 1–4, Karger Publishers, 2020, pp. 27–36, doi:10.1159/000504162.","chicago":"Salazar, Juan Esteban, Daniel Severin, Tomas A Vega Zuniga, Pedro Fernández-Aburto, Alfonso Deichler, Michel Sallaberry A., and Jorge Mpodozis. “Anatomical Specializations Related to Foraging in the Visual System of a Nocturnal Insectivorous Bird, the Band-Winged Nightjar (Aves: Caprimulgiformes).” Brain, Behavior and Evolution. Karger Publishers, 2020. https://doi.org/10.1159/000504162."},"article_type":"original","page":"27-36","abstract":[{"lang":"eng","text":"Nocturnal animals that rely on their visual system for foraging, mating, and navigation usually exhibit specific traits associated with living in scotopic conditions. Most nocturnal birds have several visual specializations, such as enlarged eyes and an increased orbital convergence. However, the actual role of binocular vision in nocturnal foraging is still debated. Nightjars (Aves: Caprimulgidae) are predators that actively pursue and capture flying insects in crepuscular and nocturnal environments, mainly using a conspicuous “sit-and-wait” tactic on which pursuit begins with an insect flying over the bird that sits on the ground. In this study, we describe the visual system of the band-winged nightjar (Systellura longirostris), with emphasis on anatomical features previously described as relevant for nocturnal birds. Orbit convergence, determined by 3D scanning of the skull, was 73.28°. The visual field, determined by ophthalmoscopic reflex, exhibits an area of maximum binocular overlap of 42°, and it is dorsally oriented. The eyes showed a nocturnal-like normalized corneal aperture/axial length index. Retinal ganglion cells (RGCs) were relatively scant, and distributed in an unusual oblique-band pattern, with higher concentrations in the ventrotemporal quadrant. Together, these results indicate that the band-winged nightjar exhibits a retinal specialization associated with the binocular area of their dorsal visual field, a relevant area for pursuit triggering and prey attacks. The RGC distribution observed is unusual among birds, but similar to that of some visually dependent insectivorous bats, suggesting that those features might be convergent in relation to feeding strategies."}],"issue":"1-4","type":"journal_article","oa_version":"None","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"7160","title":"Anatomical specializations related to foraging in the visual system of a nocturnal insectivorous bird, the band-winged nightjar (Aves: Caprimulgiformes)","status":"public","intvolume":" 94","month":"01","publication_identifier":{"eissn":["1421-9743"],"issn":["0006-8977"]},"doi":"10.1159/000504162","language":[{"iso":"eng"}],"external_id":{"isi":["000522856600004"],"pmid":["31751995"]},"isi":1,"quality_controlled":"1","author":[{"full_name":"Salazar, Juan Esteban","first_name":"Juan Esteban","last_name":"Salazar"},{"last_name":"Severin","first_name":"Daniel","full_name":"Severin, Daniel"},{"last_name":"Vega Zuniga","first_name":"Tomas A","id":"2E7C4E78-F248-11E8-B48F-1D18A9856A87","full_name":"Vega Zuniga, Tomas A"},{"full_name":"Fernández-Aburto, Pedro","first_name":"Pedro","last_name":"Fernández-Aburto"},{"full_name":"Deichler, Alfonso","last_name":"Deichler","first_name":"Alfonso"},{"first_name":"Michel","last_name":"Sallaberry A.","full_name":"Sallaberry A., Michel"},{"full_name":"Mpodozis, Jorge","first_name":"Jorge","last_name":"Mpodozis"}],"date_created":"2019-12-09T09:04:13Z","date_updated":"2024-02-22T15:18:34Z","volume":94,"year":"2020","pmid":1,"publication_status":"published","department":[{"_id":"MaJö"}],"publisher":"Karger Publishers"},{"intvolume":" 48","status":"public","title":"Correlated random matrices: Band rigidity and edge universality","_id":"6184","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","type":"journal_article","issue":"2","abstract":[{"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.","lang":"eng"}],"page":"963-1001","article_type":"original","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","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.","short":"J. Alt, L. Erdös, T.H. Krüger, D.J. Schröder, Annals of Probability 48 (2020) 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.","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."},"publication":"Annals of Probability","date_published":"2020-03-01T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"01","publisher":"Institute of Mathematical Statistics","department":[{"_id":"LaEr"}],"publication_status":"published","year":"2020","volume":48,"date_created":"2019-03-28T09:20:08Z","date_updated":"2024-02-22T14:34:33Z","related_material":{"record":[{"id":"149","status":"public","relation":"dissertation_contains"},{"status":"public","relation":"dissertation_contains","id":"6179"}]},"author":[{"first_name":"Johannes","last_name":"Alt","id":"36D3D8B6-F248-11E8-B48F-1D18A9856A87","full_name":"Alt, Johannes"},{"full_name":"Erdös, László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5366-9603","first_name":"László","last_name":"Erdös"},{"full_name":"Krüger, Torben H","id":"3020C786-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4821-3297","first_name":"Torben H","last_name":"Krüger"},{"full_name":"Schröder, Dominik J","last_name":"Schröder","first_name":"Dominik J","orcid":"0000-0002-2904-1856","id":"408ED176-F248-11E8-B48F-1D18A9856A87"}],"ec_funded":1,"project":[{"call_identifier":"FP7","name":"Random matrices, universality and disordered quantum systems","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","grant_number":"338804"}],"isi":1,"quality_controlled":"1","oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1804.07744","open_access":"1"}],"external_id":{"isi":["000528269100013"],"arxiv":["1804.07744"]},"language":[{"iso":"eng"}],"doi":"10.1214/19-AOP1379","publication_identifier":{"issn":["0091-1798"]},"month":"03"},{"type":"journal_article","issue":"5","abstract":[{"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.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"15037","intvolume":" 13","status":"public","ddc":["580"],"title":"TOLs function as ubiquitin receptors in the early steps of the ESCRT pathway in higher plants","oa_version":"Published Version","file":[{"file_name":"2020_MolecularPlant_MoulinierAnzola.pdf","access_level":"open_access","creator":"dernst","file_size":3089212,"content_type":"application/pdf","file_id":"15038","relation":"main_file","date_created":"2024-02-28T12:39:56Z","date_updated":"2024-02-28T12:39:56Z","success":1,"checksum":"c538a5008f7827f62d17d40a3bfabe65"}],"keyword":["Plant Science","Molecular Biology"],"has_accepted_license":"1","article_processing_charge":"No","day":"04","citation":{"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.","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.","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.","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.","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","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"},"publication":"Molecular Plant","page":"717-731","article_type":"original","date_published":"2020-05-04T00:00:00Z","file_date_updated":"2024-02-28T12:39:56Z","pmid":1,"year":"2020","department":[{"_id":"EvBe"}],"publisher":"Elsevier","publication_status":"published","author":[{"last_name":"Moulinier-Anzola","first_name":"Jeanette","full_name":"Moulinier-Anzola, Jeanette"},{"full_name":"Schwihla, Maximilian","first_name":"Maximilian","last_name":"Schwihla"},{"last_name":"De-Araújo","first_name":"Lucinda","full_name":"De-Araújo, Lucinda"},{"full_name":"Artner, Christina","id":"45DF286A-F248-11E8-B48F-1D18A9856A87","first_name":"Christina","last_name":"Artner"},{"full_name":"Jörg, Lisa","last_name":"Jörg","first_name":"Lisa"},{"full_name":"Konstantinova, Nataliia","first_name":"Nataliia","last_name":"Konstantinova"},{"first_name":"Christian","last_name":"Luschnig","full_name":"Luschnig, Christian"},{"first_name":"Barbara","last_name":"Korbei","full_name":"Korbei, Barbara"}],"volume":13,"date_updated":"2024-02-28T12:41:52Z","date_created":"2024-02-28T08:55:56Z","publication_identifier":{"issn":["1674-2052"]},"month":"05","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"pmid":["32087370"]},"oa":1,"quality_controlled":"1","doi":"10.1016/j.molp.2020.02.012","language":[{"iso":"eng"}]},{"keyword":["Molecular Biology","Structural Biology"],"day":"02","article_processing_charge":"No","publication":"Journal of Molecular Biology","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","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.","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","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.","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.","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."},"article_type":"original","page":"5784-5801","date_published":"2020-10-02T00:00:00Z","type":"journal_article","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."}],"issue":"21","_id":"15036","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Molecular recognition at septin interfaces: The switches hold the key","status":"public","intvolume":" 432","oa_version":"Published Version","month":"10","publication_identifier":{"issn":["0022-2836"]},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1016/j.jmb.2020.09.001"}],"external_id":{"pmid":["32910969"]},"oa":1,"quality_controlled":"1","doi":"10.1016/j.jmb.2020.09.001","language":[{"iso":"eng"}],"year":"2020","pmid":1,"publication_status":"published","publisher":"Elsevier","department":[{"_id":"MaLo"}],"author":[{"first_name":"Higor Vinícius Dias","last_name":"Rosa","full_name":"Rosa, Higor Vinícius Dias"},{"last_name":"Leonardo","first_name":"Diego Antonio","full_name":"Leonardo, Diego Antonio"},{"last_name":"Brognara","first_name":"Gabriel","id":"D96FFDA0-A884-11E9-9968-DC26E6697425","full_name":"Brognara, Gabriel"},{"first_name":"José","last_name":"Brandão-Neto","full_name":"Brandão-Neto, José"},{"first_name":"Humberto","last_name":"D'Muniz Pereira","full_name":"D'Muniz Pereira, Humberto"},{"first_name":"Ana Paula Ulian","last_name":"Araújo","full_name":"Araújo, Ana Paula Ulian"},{"last_name":"Garratt","first_name":"Richard Charles","full_name":"Garratt, Richard Charles"}],"date_created":"2024-02-28T08:50:34Z","date_updated":"2024-02-28T12:37:54Z","volume":432},{"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","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.","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","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.","short":"S. Ishida, P. Synak, F. Narita, T. Hachisuka, C. Wojtan, ACM Transactions on Graphics 39 (2020).","mla":"Ishida, Sadashige, et al. “A Model for Soap Film Dynamics with Evolving Thickness.” ACM Transactions on Graphics, vol. 39, no. 4, 31, Association for Computing Machinery, 2020, doi: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."},"publication":"ACM Transactions on Graphics","article_type":"original","date_published":"2020-07-08T00:00:00Z","scopus_import":"1","has_accepted_license":"1","article_processing_charge":"No","day":"08","_id":"8384","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 39","ddc":["000"],"status":"public","title":"A model for soap film dynamics with evolving thickness","oa_version":"Submitted Version","file":[{"file_id":"8795","relation":"main_file","success":1,"checksum":"813831ca91319d794d9748c276b24578","date_updated":"2020-11-23T09:03:19Z","date_created":"2020-11-23T09:03:19Z","access_level":"open_access","file_name":"2020_soapfilm_submitted.pdf","creator":"dernst","file_size":14935529,"content_type":"application/pdf"}],"type":"journal_article","issue":"4","abstract":[{"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.","lang":"eng"}],"oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1145/3386569.3392405"}],"external_id":{"isi":["000583700300004"]},"project":[{"_id":"2533E772-B435-11E9-9278-68D0E5697425","grant_number":"638176","name":"Efficient Simulation of Natural Phenomena at Extremely Large Scales","call_identifier":"H2020"}],"quality_controlled":"1","isi":1,"doi":"10.1145/3386569.3392405","language":[{"iso":"eng"}],"acknowledged_ssus":[{"_id":"ScienComp"}],"publication_identifier":{"issn":["07300301"],"eissn":["15577368"]},"month":"07","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.","year":"2020","publisher":"Association for Computing Machinery","department":[{"_id":"ChWo"}],"publication_status":"published","author":[{"last_name":"Ishida","first_name":"Sadashige","id":"6F7C4B96-A8E9-11E9-A7CA-09ECE5697425","full_name":"Ishida, Sadashige"},{"full_name":"Synak, Peter","first_name":"Peter","last_name":"Synak","id":"331776E2-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Narita, Fumiya","last_name":"Narita","first_name":"Fumiya"},{"full_name":"Hachisuka, Toshiya","first_name":"Toshiya","last_name":"Hachisuka"},{"last_name":"Wojtan","first_name":"Christopher J","orcid":"0000-0001-6646-5546","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","full_name":"Wojtan, Christopher J"}],"volume":39,"date_updated":"2024-02-28T12:57:31Z","date_created":"2020-09-13T22:01:18Z","article_number":"31","ec_funded":1,"file_date_updated":"2020-11-23T09:03:19Z"},{"ec_funded":1,"date_created":"2020-05-06T08:53:34Z","date_updated":"2024-02-28T12:53:09Z","author":[{"full_name":"Czumaj, Artur","orcid":"0000-0002-5646-9524","first_name":"Artur","last_name":"Czumaj"},{"full_name":"Davies, Peter","last_name":"Davies","first_name":"Peter","orcid":"0000-0002-5646-9524","id":"11396234-BB50-11E9-B24C-90FCE5697425"},{"full_name":"Parter, Merav","last_name":"Parter","first_name":"Merav"}],"related_material":{"record":[{"id":"9541","relation":"later_version","status":"public"}]},"publication_status":"published","department":[{"_id":"DaAl"}],"publisher":"Association for Computing Machinery","year":"2020","month":"07","language":[{"iso":"eng"}],"conference":{"location":"Virtual Event, United States","start_date":"2020-07-15","end_date":"2020-07-17","name":"SPAA: Symposium on Parallelism in Algorithms and Architectures"},"doi":"10.1145/3350755.3400282","quality_controlled":"1","isi":1,"project":[{"name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"external_id":{"arxiv":["1912.05390"],"isi":["000744436200015"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1912.05390"}],"oa":1,"abstract":[{"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].","lang":"eng"}],"issue":"7","type":"conference","oa_version":"Preprint","status":"public","title":"Graph sparsification for derandomizing massively parallel computation with low space","_id":"7802","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","day":"01","article_processing_charge":"No","scopus_import":"1","date_published":"2020-07-01T00:00:00Z","page":"175-185","publication":"Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2020)","citation":{"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.","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.","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","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","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.","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."}},{"ec_funded":1,"author":[{"full_name":"Brown, Trevor A","id":"3569F0A0-F248-11E8-B48F-1D18A9856A87","first_name":"Trevor A","last_name":"Brown"},{"first_name":"Aleksandar","last_name":"Prokopec","full_name":"Prokopec, Aleksandar"},{"full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"}],"date_created":"2020-04-05T22:00:49Z","date_updated":"2024-02-28T12:55:14Z","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). ","year":"2020","publication_status":"published","department":[{"_id":"DaAl"}],"publisher":"Association for Computing Machinery","month":"02","publication_identifier":{"isbn":["9781450368186"]},"conference":{"name":"PPOPP: Principles and Practice of Parallel Programming","location":"San Diego, CA, United States","start_date":"2020-02-22","end_date":"2020-02-26"},"doi":"10.1145/3332466.3374542","language":[{"iso":"eng"}],"external_id":{"isi":["000564476500020"]},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1145/3332466.3374542"}],"oa":1,"isi":1,"quality_controlled":"1","project":[{"grant_number":"805223","_id":"268A44D6-B435-11E9-9278-68D0E5697425","name":"Elastic Coordination for Scalable Machine Learning","call_identifier":"H2020"}],"abstract":[{"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.","lang":"eng"}],"type":"conference","oa_version":"Published Version","_id":"7636","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Non-blocking interpolation search trees with doubly-logarithmic running time","status":"public","day":"19","article_processing_charge":"No","scopus_import":"1","date_published":"2020-02-19T00:00:00Z","publication":"Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","citation":{"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.","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.","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.","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","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.","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","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."},"page":"276-291"},{"publication_identifier":{"isbn":["9781450369350"]},"article_processing_charge":"No","month":"07","day":"06","scopus_import":"1","language":[{"iso":"eng"}],"date_published":"2020-07-06T00:00:00Z","doi":"10.1145/3350755.3400213","conference":{"end_date":"2020-07-17","start_date":"2020-07-15","location":"Virtual Event, United States","name":"SPAA: Symposium on Parallelism in Algorithms and Architectures"},"page":"37-49","quality_controlled":"1","isi":1,"external_id":{"isi":["000744436200004"]},"citation":{"ama":"Alistarh D-A, Brown TA, Singhal N. Memory tagging: Minimalist synchronization for scalable concurrent data structures. In: Annual ACM Symposium on Parallelism in Algorithms and Architectures. Association for Computing Machinery; 2020:37-49. doi:10.1145/3350755.3400213","ista":"Alistarh D-A, Brown TA, Singhal N. 2020. Memory tagging: Minimalist synchronization for scalable concurrent data structures. Annual ACM Symposium on Parallelism in Algorithms and Architectures. SPAA: Symposium on Parallelism in Algorithms and Architectures, 37–49.","ieee":"D.-A. Alistarh, T. A. Brown, and N. Singhal, “Memory tagging: Minimalist synchronization for scalable concurrent data structures,” in Annual ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, United States, 2020, no. 7, pp. 37–49.","apa":"Alistarh, D.-A., Brown, T. A., & Singhal, N. (2020). Memory tagging: Minimalist synchronization for scalable concurrent data structures. In Annual ACM Symposium on Parallelism in Algorithms and Architectures (pp. 37–49). Virtual Event, United States: Association for Computing Machinery. https://doi.org/10.1145/3350755.3400213","mla":"Alistarh, Dan-Adrian, et al. “Memory Tagging: Minimalist Synchronization for Scalable Concurrent Data Structures.” Annual ACM Symposium on Parallelism in Algorithms and Architectures, no. 7, Association for Computing Machinery, 2020, pp. 37–49, doi:10.1145/3350755.3400213.","short":"D.-A. Alistarh, T.A. Brown, N. Singhal, in:, Annual ACM Symposium on Parallelism in Algorithms and Architectures, Association for Computing Machinery, 2020, pp. 37–49.","chicago":"Alistarh, Dan-Adrian, Trevor A Brown, and Nandini Singhal. “Memory Tagging: Minimalist Synchronization for Scalable Concurrent Data Structures.” In Annual ACM Symposium on Parallelism in Algorithms and Architectures, 37–49. Association for Computing Machinery, 2020. https://doi.org/10.1145/3350755.3400213."},"publication":"Annual ACM Symposium on Parallelism in Algorithms and Architectures","issue":"7","abstract":[{"text":"There has been a significant amount of research on hardware and software support for efficient concurrent data structures; yet, the question of how to build correct, simple, and scalable data structures has not yet been definitively settled. In this paper, we revisit this question from a minimalist perspective, and ask: what is the smallest amount of synchronization required for correct and efficient concurrent search data structures, and how could this minimal synchronization support be provided in hardware?\r\n\r\nTo address these questions, we introduce memory tagging, a simple hardware mechanism which enables the programmer to \"tag\" a dynamic set of memory locations, at cache-line granularity, and later validate whether the memory has been concurrently modified, with the possibility of updating one of the underlying locations atomically if validation succeeds. We provide several examples showing that this mechanism can enable fast and arguably simple concurrent data structure designs, such as lists, binary search trees, balanced search trees, range queries, and Software Transactional Memory (STM) implementations. We provide an implementation of memory tags in the Graphite multi-core simulator, showing that the mechanism can be implemented entirely at the level of L1 cache, and that it can enable non-trivial speedups versus existing implementations of the above data structures.","lang":"eng"}],"type":"conference","oa_version":"None","date_updated":"2024-02-28T12:56:32Z","date_created":"2020-08-02T22:00:58Z","author":[{"full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Brown, Trevor A","first_name":"Trevor A","last_name":"Brown","id":"3569F0A0-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Nandini","last_name":"Singhal","full_name":"Singhal, Nandini"}],"publisher":"Association for Computing Machinery","department":[{"_id":"DaAl"}],"publication_status":"published","status":"public","title":"Memory tagging: Minimalist synchronization for scalable concurrent data structures","_id":"8191","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2020"},{"abstract":[{"text":"Concurrent programming can be notoriously complex and error-prone. Programming bugs can arise from a variety of sources, such as operation re-reordering, or incomplete understanding of the memory model. A variety of formal and model checking methods have been developed to address this fundamental difficulty. While technically interesting, existing academic methods are still hard to apply to the large codebases typical of industrial deployments, which limits their practical impact.","lang":"eng"}],"type":"conference","author":[{"full_name":"Koval, Nikita","id":"2F4DB10C-F248-11E8-B48F-1D18A9856A87","first_name":"Nikita","last_name":"Koval"},{"id":"26217AE4-77FF-11EA-8101-AD24D49E41F4","first_name":"Mariia","last_name":"Sokolova","full_name":"Sokolova, Mariia"},{"full_name":"Fedorov, Alexander","last_name":"Fedorov","first_name":"Alexander"},{"full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X"},{"full_name":"Tsitelov, Dmitry","first_name":"Dmitry","last_name":"Tsitelov"}],"oa_version":"None","date_updated":"2024-02-28T12:53:46Z","date_created":"2020-04-05T22:00:48Z","_id":"7635","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2020","publisher":"Association for Computing Machinery","department":[{"_id":"DaAl"}],"status":"public","publication_status":"published","title":"Testing concurrency on the JVM with Lincheck","article_processing_charge":"No","publication_identifier":{"isbn":["9781450368186"]},"day":"19","month":"02","scopus_import":"1","doi":"10.1145/3332466.3374503","date_published":"2020-02-19T00:00:00Z","conference":{"end_date":"2020-02-26","start_date":"2020-02-22","location":"San Diego, CA, United States","name":"PPOPP: Principles and Practice of Parallel Programming"},"language":[{"iso":"eng"}],"citation":{"ama":"Koval N, Sokolova M, Fedorov A, Alistarh D-A, Tsitelov D. Testing concurrency on the JVM with Lincheck. In: Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP. Association for Computing Machinery; 2020:423-424. doi:10.1145/3332466.3374503","apa":"Koval, N., Sokolova, M., Fedorov, A., Alistarh, D.-A., & Tsitelov, D. (2020). Testing concurrency on the JVM with Lincheck. In Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP (pp. 423–424). San Diego, CA, United States: Association for Computing Machinery. https://doi.org/10.1145/3332466.3374503","ieee":"N. Koval, M. Sokolova, A. Fedorov, D.-A. Alistarh, and D. Tsitelov, “Testing concurrency on the JVM with Lincheck,” in Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP, San Diego, CA, United States, 2020, pp. 423–424.","ista":"Koval N, Sokolova M, Fedorov A, Alistarh D-A, Tsitelov D. 2020. Testing concurrency on the JVM with Lincheck. Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP. PPOPP: Principles and Practice of Parallel Programming, 423–424.","short":"N. Koval, M. Sokolova, A. Fedorov, D.-A. Alistarh, D. Tsitelov, in:, Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP, Association for Computing Machinery, 2020, pp. 423–424.","mla":"Koval, Nikita, et al. “Testing Concurrency on the JVM with Lincheck.” Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP, Association for Computing Machinery, 2020, pp. 423–24, doi:10.1145/3332466.3374503.","chicago":"Koval, Nikita, Mariia Sokolova, Alexander Fedorov, Dan-Adrian Alistarh, and Dmitry Tsitelov. “Testing Concurrency on the JVM with Lincheck.” In Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP, 423–24. Association for Computing Machinery, 2020. https://doi.org/10.1145/3332466.3374503."},"publication":"Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP","page":"423-424","quality_controlled":"1"},{"publisher":"Association for Computing Machinery","department":[{"_id":"DaAl"}],"publication_status":"published","status":"public","title":"Brief Announcement: Why Extension-Based Proofs Fail","year":"2020","_id":"8383","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"None","date_updated":"2024-02-28T12:54:19Z","date_created":"2020-09-13T22:01:18Z","author":[{"orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian"},{"full_name":"Aspnes, James","first_name":"James","last_name":"Aspnes"},{"first_name":"Faith","last_name":"Ellen","full_name":"Ellen, Faith"},{"full_name":"Gelashvili, Rati","first_name":"Rati","last_name":"Gelashvili"},{"full_name":"Zhu, Leqi","first_name":"Leqi","last_name":"Zhu"}],"type":"conference","abstract":[{"text":"We introduce extension-based proofs, a class of impossibility proofs that includes valency arguments. They are modelled as an interaction between a prover and a protocol. Using proofs based on combinatorial topology, it has been shown that it is impossible to deterministically solve k-set agreement among n > k ≥ 2 processes in a wait-free manner. However, it was unknown whether proofs based on simpler techniques were possible. We explain why this impossibility result cannot be obtained by an extension-based proof and, hence, extension-based proofs are limited in power.","lang":"eng"}],"page":"54-56","quality_controlled":"1","citation":{"short":"D.-A. Alistarh, J. Aspnes, F. Ellen, R. Gelashvili, L. Zhu, in:, Proceedings of the 39th Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2020, pp. 54–56.","mla":"Alistarh, Dan-Adrian, et al. “Brief Announcement: Why Extension-Based Proofs Fail.” Proceedings of the 39th Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2020, pp. 54–56, doi:10.1145/3382734.3405743.","chicago":"Alistarh, Dan-Adrian, James Aspnes, Faith Ellen, Rati Gelashvili, and Leqi Zhu. “Brief Announcement: Why Extension-Based Proofs Fail.” In Proceedings of the 39th Symposium on Principles of Distributed Computing, 54–56. Association for Computing Machinery, 2020. https://doi.org/10.1145/3382734.3405743.","ama":"Alistarh D-A, Aspnes J, Ellen F, Gelashvili R, Zhu L. Brief Announcement: Why Extension-Based Proofs Fail. In: Proceedings of the 39th Symposium on Principles of Distributed Computing. Association for Computing Machinery; 2020:54-56. doi:10.1145/3382734.3405743","ieee":"D.-A. Alistarh, J. Aspnes, F. Ellen, R. Gelashvili, and L. Zhu, “Brief Announcement: Why Extension-Based Proofs Fail,” in Proceedings of the 39th Symposium on Principles of Distributed Computing, Virtual, Italy, 2020, pp. 54–56.","apa":"Alistarh, D.-A., Aspnes, J., Ellen, F., Gelashvili, R., & Zhu, L. (2020). Brief Announcement: Why Extension-Based Proofs Fail. In Proceedings of the 39th Symposium on Principles of Distributed Computing (pp. 54–56). Virtual, Italy: Association for Computing Machinery. https://doi.org/10.1145/3382734.3405743","ista":"Alistarh D-A, Aspnes J, Ellen F, Gelashvili R, Zhu L. 2020. Brief Announcement: Why Extension-Based Proofs Fail. Proceedings of the 39th Symposium on Principles of Distributed Computing. PODC: Principles of Distributed Computing, 54–56."},"publication":"Proceedings of the 39th Symposium on Principles of Distributed Computing","language":[{"iso":"eng"}],"date_published":"2020-07-31T00:00:00Z","doi":"10.1145/3382734.3405743","conference":{"name":"PODC: Principles of Distributed Computing","start_date":"2020-08-03","location":"Virtual, Italy","end_date":"2020-08-07"},"scopus_import":"1","publication_identifier":{"isbn":["9781450375825"]},"article_processing_charge":"No","month":"07","day":"31"},{"citation":{"ama":"Sperl G, Narain R, Wojtan C. Homogenized yarn-level cloth. ACM Transactions on Graphics. 2020;39(4). doi:10.1145/3386569.3392412","ista":"Sperl G, Narain R, Wojtan C. 2020. Homogenized yarn-level cloth. ACM Transactions on Graphics. 39(4), 48.","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","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.","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).","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."},"publication":"ACM Transactions on Graphics","article_type":"original","date_published":"2020-07-08T00:00:00Z","scopus_import":"1","article_processing_charge":"No","has_accepted_license":"1","day":"08","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"8385","intvolume":" 39","ddc":["000"],"status":"public","title":"Homogenized yarn-level cloth","file":[{"access_level":"open_access","file_name":"2020_hylc_submitted.pdf","creator":"dernst","content_type":"application/pdf","file_size":38922662,"file_id":"8794","relation":"main_file","success":1,"checksum":"cf4c1d361c3196c4bd424520a5588205","date_updated":"2020-11-23T09:01:22Z","date_created":"2020-11-23T09:01:22Z"}],"oa_version":"Submitted Version","type":"journal_article","issue":"4","abstract":[{"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.","lang":"eng"}],"oa":1,"external_id":{"isi":["000583700300021"]},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1145/3386569.3392412"}],"project":[{"name":"Efficient Simulation of Natural Phenomena at Extremely Large Scales","call_identifier":"H2020","grant_number":"638176","_id":"2533E772-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","isi":1,"doi":"10.1145/3386569.3392412","language":[{"iso":"eng"}],"acknowledged_ssus":[{"_id":"ScienComp"}],"publication_identifier":{"eissn":["15577368"],"issn":["07300301"]},"month":"07","year":"2020","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.","publisher":"Association for Computing Machinery","department":[{"_id":"ChWo"}],"publication_status":"published","related_material":{"record":[{"id":"12358","relation":"dissertation_contains","status":"public"}]},"author":[{"last_name":"Sperl","first_name":"Georg","id":"4DD40360-F248-11E8-B48F-1D18A9856A87","full_name":"Sperl, Georg"},{"first_name":"Rahul","last_name":"Narain","full_name":"Narain, Rahul"},{"full_name":"Wojtan, Christopher J","last_name":"Wojtan","first_name":"Christopher J","orcid":"0000-0001-6646-5546","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87"}],"volume":39,"date_created":"2020-09-13T22:01:18Z","date_updated":"2024-02-28T12:57:47Z","article_number":"48","ec_funded":1,"file_date_updated":"2020-11-23T09:01:22Z"},{"ec_funded":1,"article_number":"204905","date_created":"2020-06-14T22:00:49Z","date_updated":"2024-02-28T13:00:28Z","volume":152,"author":[{"first_name":"J.","last_name":"Pȩkalski","full_name":"Pȩkalski, J."},{"last_name":"Rzadkowski","first_name":"Wojciech","orcid":"0000-0002-1106-4419","id":"48C55298-F248-11E8-B48F-1D18A9856A87","full_name":"Rzadkowski, Wojciech"},{"full_name":"Panagiotopoulos, A. Z.","last_name":"Panagiotopoulos","first_name":"A. Z."}],"related_material":{"record":[{"id":"10759","status":"public","relation":"dissertation_contains"}]},"publication_status":"published","department":[{"_id":"MiLe"}],"publisher":"AIP Publishing","year":"2020","month":"05","publication_identifier":{"eissn":["10897690"]},"language":[{"iso":"eng"}],"doi":"10.1063/5.0005194","isi":1,"quality_controlled":"1","project":[{"name":"International IST Doctoral Program","call_identifier":"H2020","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1063/5.0005194"}],"external_id":{"isi":["000537900300001"],"arxiv":["2002.07294"]},"oa":1,"abstract":[{"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.","lang":"eng"}],"issue":"20","type":"journal_article","oa_version":"Published Version","title":"Shear-induced ordering in systems with competing interactions: A machine learning study","status":"public","intvolume":" 152","_id":"7956","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"29","article_processing_charge":"No","scopus_import":"1","date_published":"2020-05-29T00:00:00Z","article_type":"original","publication":"The Journal of chemical physics","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","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.","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.","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","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).","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."}},{"author":[{"id":"3EDE6DE4-AA5A-11E9-986D-341CE6697425","first_name":"Mirza Ahad","last_name":"Baig","full_name":"Baig, Mirza Ahad"},{"first_name":"Danny","last_name":"Hendler","full_name":"Hendler, Danny"},{"full_name":"Milani, Alessia","last_name":"Milani","first_name":"Alessia"},{"last_name":"Travers","first_name":"Corentin","full_name":"Travers, Corentin"}],"date_updated":"2024-02-28T12:54:30Z","date_created":"2020-09-13T22:01:17Z","oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"8382","year":"2020","publication_status":"published","status":"public","title":"Long-lived snapshots with polylogarithmic amortized step complexity","publisher":"Association for Computing Machinery","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."}],"type":"conference","conference":{"name":"PODC: Principles of Distributed Computing","start_date":"2020-08-03","location":"Virtual, Italy","end_date":"2020-08-07"},"doi":"10.1145/3382734.3406005","date_published":"2020-07-31T00:00:00Z","language":[{"iso":"eng"}],"publication":"Proceedings of the 39th Symposium on Principles of Distributed Computing","main_file_link":[{"open_access":"1","url":"https://hal.archives-ouvertes.fr/hal-02860087/document"}],"oa":1,"citation":{"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.","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.","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.","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","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.","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"},"quality_controlled":"1","page":"31-40","month":"07","day":"31","article_processing_charge":"No","publication_identifier":{"isbn":["9781450375825"]},"scopus_import":"1"},{"date_published":"2020-01-13T00:00:00Z","article_type":"original","citation":{"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).","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.","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","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.","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.","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"},"publication":"Physical Review B","article_processing_charge":"No","day":"13","scopus_import":"1","oa_version":"Preprint","intvolume":" 101","title":"Effect of Zeeman coupling on the Majorana vortex modes in iron-based topological superconductors","status":"public","_id":"7428","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","issue":"2","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."}],"type":"journal_article","language":[{"iso":"eng"}],"doi":"10.1103/PhysRevB.101.020504","isi":1,"quality_controlled":"1","oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1907.02077"}],"external_id":{"isi":["000506843500001"],"arxiv":["1907.02077"]},"publication_identifier":{"eissn":["24699969"],"issn":["24699950"]},"month":"01","volume":101,"date_created":"2020-02-02T23:01:01Z","date_updated":"2024-02-28T13:11:13Z","author":[{"full_name":"Ghazaryan, Areg","last_name":"Ghazaryan","first_name":"Areg","orcid":"0000-0001-9666-3543","id":"4AF46FD6-F248-11E8-B48F-1D18A9856A87"},{"first_name":"P. L.S.","last_name":"Lopes","full_name":"Lopes, P. L.S."},{"full_name":"Hosur, Pavan","first_name":"Pavan","last_name":"Hosur"},{"full_name":"Gilbert, Matthew J.","first_name":"Matthew J.","last_name":"Gilbert"},{"full_name":"Ghaemi, Pouyan","first_name":"Pouyan","last_name":"Ghaemi"}],"department":[{"_id":"MiLe"}],"publisher":"American Physical Society","publication_status":"published","year":"2020","article_number":"020504"},{"month":"07","publication_identifier":{"issn":["24699926"],"eissn":["24699934"]},"doi":"10.1103/PhysRevA.102.012224","language":[{"iso":"eng"}],"external_id":{"isi":["000555104200011"],"arxiv":["1912.08334"]},"oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1912.08334"}],"isi":1,"quality_controlled":"1","article_number":"012224","author":[{"first_name":"Yunfan","last_name":"Wu","full_name":"Wu, Yunfan"},{"full_name":"Krishnakumar, Rajiv","last_name":"Krishnakumar","first_name":"Rajiv"},{"full_name":"Martínez-Rincón, Julián","first_name":"Julián","last_name":"Martínez-Rincón"},{"last_name":"Malia","first_name":"Benjamin K.","full_name":"Malia, Benjamin K."},{"first_name":"Onur","last_name":"Hosten","id":"4C02D85E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2031-204X","full_name":"Hosten, Onur"},{"last_name":"Kasevich","first_name":"Mark A.","full_name":"Kasevich, Mark A."}],"date_created":"2020-08-30T22:01:10Z","date_updated":"2024-02-28T13:11:28Z","volume":102,"acknowledgement":"We thank N. Engelsen for comments on the manuscript. This work was supported by the Office of Naval Research, Vannevar Bush Faculty Fellowship, Department of Energy, and Defense Threat Reduction Agency. R.K. was partly supported by the AQT/INQNET program at Caltech.","year":"2020","publication_status":"published","publisher":"American Physical Society","department":[{"_id":"OnHo"}],"day":"30","article_processing_charge":"No","scopus_import":"1","date_published":"2020-07-30T00:00:00Z","publication":"Physical Review A","citation":{"chicago":"Wu, Yunfan, Rajiv Krishnakumar, Julián Martínez-Rincón, Benjamin K. Malia, Onur Hosten, and Mark A. Kasevich. “Retrieval of Cavity-Generated Atomic Spin Squeezing after Free-Space Release.” Physical Review A. American Physical Society, 2020. https://doi.org/10.1103/PhysRevA.102.012224.","mla":"Wu, Yunfan, et al. “Retrieval of Cavity-Generated Atomic Spin Squeezing after Free-Space Release.” Physical Review A, vol. 102, no. 1, 012224, American Physical Society, 2020, doi:10.1103/PhysRevA.102.012224.","short":"Y. Wu, R. Krishnakumar, J. Martínez-Rincón, B.K. Malia, O. Hosten, M.A. Kasevich, Physical Review A 102 (2020).","ista":"Wu Y, Krishnakumar R, Martínez-Rincón J, Malia BK, Hosten O, Kasevich MA. 2020. Retrieval of cavity-generated atomic spin squeezing after free-space release. Physical Review A. 102(1), 012224.","ieee":"Y. Wu, R. Krishnakumar, J. Martínez-Rincón, B. K. Malia, O. Hosten, and M. A. Kasevich, “Retrieval of cavity-generated atomic spin squeezing after free-space release,” Physical Review A, vol. 102, no. 1. American Physical Society, 2020.","apa":"Wu, Y., Krishnakumar, R., Martínez-Rincón, J., Malia, B. K., Hosten, O., & Kasevich, M. A. (2020). Retrieval of cavity-generated atomic spin squeezing after free-space release. Physical Review A. American Physical Society. https://doi.org/10.1103/PhysRevA.102.012224","ama":"Wu Y, Krishnakumar R, Martínez-Rincón J, Malia BK, Hosten O, Kasevich MA. Retrieval of cavity-generated atomic spin squeezing after free-space release. Physical Review A. 2020;102(1). doi:10.1103/PhysRevA.102.012224"},"article_type":"original","abstract":[{"lang":"eng","text":"We demonstrate that releasing atoms into free space from an optical lattice does not deteriorate cavity-generated spin squeezing for metrological purposes. In this work, an ensemble of 500000 spin-squeezed atoms in a high-finesse optical cavity with near-uniform atom-cavity coupling is prepared, released into free space, recaptured in the cavity, and probed. Up to ∼10 dB of metrologically relevant squeezing is retrieved for 700μs free-fall times, and decaying levels of squeezing are realized for up to 3 ms free-fall times. The degradation of squeezing results from loss of atom-cavity coupling homogeneity between the initial squeezed state generation and final collective state readout. A theoretical model is developed to quantify this degradation and this model is experimentally validated."}],"issue":"1","type":"journal_article","oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"8319","status":"public","title":"Retrieval of cavity-generated atomic spin squeezing after free-space release","intvolume":" 102"},{"month":"12","external_id":{"isi":["000591780400005"]},"project":[{"call_identifier":"H2020","name":"Efficient Simulation of Natural Phenomena at Extremely Large Scales","_id":"2533E772-B435-11E9-9278-68D0E5697425","grant_number":"638176"},{"name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","call_identifier":"H2020","grant_number":"715767","_id":"24F9549A-B435-11E9-9278-68D0E5697425"}],"isi":1,"quality_controlled":"1","doi":"10.1111/cgf.14100","conference":{"name":"SCA: Symposium on Computer Animation","start_date":"2020-10-06","location":"Online Symposium","end_date":"2020-10-09"},"language":[{"iso":"eng"}],"ec_funded":1,"year":"2020","department":[{"_id":"ChWo"},{"_id":"BeBi"}],"publisher":"Wiley","publication_status":"published","author":[{"last_name":"Jeschke","first_name":"Stefan","id":"44D6411A-F248-11E8-B48F-1D18A9856A87","full_name":"Jeschke, Stefan"},{"full_name":"Hafner, Christian","last_name":"Hafner","first_name":"Christian","id":"400429CC-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Chentanez","first_name":"Nuttapong","full_name":"Chentanez, Nuttapong"},{"first_name":"Miles","last_name":"Macklin","full_name":"Macklin, Miles"},{"full_name":"Müller-Fischer, Matthias","last_name":"Müller-Fischer","first_name":"Matthias"},{"last_name":"Wojtan","first_name":"Christopher J","orcid":"0000-0001-6646-5546","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","full_name":"Wojtan, Christopher J"}],"volume":39,"date_updated":"2024-02-28T13:58:11Z","date_created":"2020-11-17T10:47:48Z","scopus_import":"1","article_processing_charge":"No","day":"01","citation":{"chicago":"Jeschke, Stefan, Christian Hafner, Nuttapong Chentanez, Miles Macklin, Matthias Müller-Fischer, and Chris Wojtan. “Making Procedural Water Waves Boundary-Aware.” Computer Graphics Forum. Wiley, 2020. https://doi.org/10.1111/cgf.14100.","mla":"Jeschke, Stefan, et al. “Making Procedural Water Waves Boundary-Aware.” Computer Graphics Forum, vol. 39, no. 8, Wiley, 2020, pp. 47–54, doi:10.1111/cgf.14100.","short":"S. Jeschke, C. Hafner, N. Chentanez, M. Macklin, M. Müller-Fischer, C. Wojtan, Computer Graphics Forum 39 (2020) 47–54.","ista":"Jeschke S, Hafner C, Chentanez N, Macklin M, Müller-Fischer M, Wojtan C. 2020. Making procedural water waves boundary-aware. Computer Graphics forum. 39(8), 47–54.","ieee":"S. Jeschke, C. Hafner, N. Chentanez, M. Macklin, M. Müller-Fischer, and C. Wojtan, “Making procedural water waves boundary-aware,” Computer Graphics forum, vol. 39, no. 8. Wiley, pp. 47–54, 2020.","apa":"Jeschke, S., Hafner, C., Chentanez, N., Macklin, M., Müller-Fischer, M., & Wojtan, C. (2020). Making procedural water waves boundary-aware. Computer Graphics Forum. Online Symposium: Wiley. https://doi.org/10.1111/cgf.14100","ama":"Jeschke S, Hafner C, Chentanez N, Macklin M, Müller-Fischer M, Wojtan C. Making procedural water waves boundary-aware. Computer Graphics forum. 2020;39(8):47-54. doi:10.1111/cgf.14100"},"publication":"Computer Graphics forum","page":"47-54","article_type":"original","date_published":"2020-12-01T00:00:00Z","type":"journal_article","issue":"8","abstract":[{"lang":"eng","text":"The “procedural” approach to animating ocean waves is the dominant algorithm for animating larger bodies of water in\r\ninteractive applications as well as in off-line productions — it provides high visual quality with a low computational demand. In this paper, we widen the applicability of procedural water wave animation with an extension that guarantees the satisfaction of boundary conditions imposed by terrain while still approximating physical wave behavior. In combination with a particle system that models wave breaking, foam, and spray, this allows us to naturally model waves interacting with beaches and rocks. Our system is able to animate waves at large scales at interactive frame rates on a commodity PC."}],"_id":"8766","user_id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","intvolume":" 39","status":"public","title":"Making procedural water waves boundary-aware","oa_version":"None"},{"author":[{"full_name":"Brázdil, Tomáš","first_name":"Tomáš","last_name":"Brázdil"},{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"last_name":"Novotný","first_name":"Petr","full_name":"Novotný, Petr"},{"last_name":"Vahala","first_name":"Jiří","full_name":"Vahala, Jiří"}],"date_updated":"2024-03-04T08:30:16Z","date_created":"2024-03-04T08:07:22Z","volume":34,"year":"2020","acknowledgement":"Krishnendu Chatterjee is supported by the Austrian Science Fund (FWF) NFN Grant No. S11407-N23 (RiSE/SHiNE), and COST Action GAMENET. Tomas Brazdil is supported by the Grant Agency of Masaryk University grant no. MUNI/G/0739/2017 and by the Czech Science Foundation grant No. 18-11193S. Petr Novotny and Jirı Vahala are supported by the Czech Science Foundation grant No. GJ19-15134Y.","publication_status":"published","department":[{"_id":"KrCh"}],"publisher":"Association for the Advancement of Artificial Intelligence","conference":{"name":"AAAI: Conference on Artificial Intelligence","location":"New York, NY, United States","start_date":"2020-02-07","end_date":"2020-02-12"},"doi":"10.1609/aaai.v34i06.6531","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2002.12086"}],"oa":1,"external_id":{"arxiv":["2002.12086"]},"quality_controlled":"1","project":[{"name":"Game Theory","call_identifier":"FWF","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425"}],"month":"04","publication_identifier":{"issn":["2374-3468"]},"oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"15055","status":"public","title":"Reinforcement learning of risk-constrained policies in Markov decision processes","intvolume":" 34","abstract":[{"lang":"eng","text":"Markov decision processes (MDPs) are the defacto framework for sequential decision making in the presence of stochastic uncertainty. A classical optimization criterion for MDPs is to maximize the expected discounted-sum payoff, which ignores low probability catastrophic events with highly negative impact on the system. On the other hand, risk-averse policies require the probability of undesirable events to be below a given threshold, but they do not account for optimization of the expected payoff. We consider MDPs with discounted-sum payoff with failure states which represent catastrophic outcomes. The objective of risk-constrained planning is to maximize the expected discounted-sum payoff among risk-averse policies that ensure the probability to encounter a failure state is below a desired threshold. Our main contribution is an efficient risk-constrained planning algorithm that combines UCT-like search with a predictor learned through interaction with the MDP (in the style of AlphaZero) and with a risk-constrained action selection via linear programming. We demonstrate the effectiveness of our approach with experiments on classical MDPs from the literature, including benchmarks with an order of 106 states."}],"issue":"06","type":"journal_article","date_published":"2020-04-03T00:00:00Z","publication":"Proceedings of the 34th AAAI Conference on Artificial Intelligence","citation":{"ista":"Brázdil T, Chatterjee K, Novotný P, Vahala J. 2020. Reinforcement learning of risk-constrained policies in Markov decision processes. Proceedings of the 34th AAAI Conference on Artificial Intelligence. 34(06), 9794–9801.","ieee":"T. Brázdil, K. Chatterjee, P. Novotný, and J. Vahala, “Reinforcement learning of risk-constrained policies in Markov decision processes,” Proceedings of the 34th AAAI Conference on Artificial Intelligence, vol. 34, no. 06. Association for the Advancement of Artificial Intelligence, pp. 9794–9801, 2020.","apa":"Brázdil, T., Chatterjee, K., Novotný, P., & Vahala, J. (2020). Reinforcement learning of risk-constrained policies in Markov decision processes. Proceedings of the 34th AAAI Conference on Artificial Intelligence. New York, NY, United States: Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/aaai.v34i06.6531","ama":"Brázdil T, Chatterjee K, Novotný P, Vahala J. Reinforcement learning of risk-constrained policies in Markov decision processes. Proceedings of the 34th AAAI Conference on Artificial Intelligence. 2020;34(06):9794-9801. doi:10.1609/aaai.v34i06.6531","chicago":"Brázdil, Tomáš, Krishnendu Chatterjee, Petr Novotný, and Jiří Vahala. “Reinforcement Learning of Risk-Constrained Policies in Markov Decision Processes.” Proceedings of the 34th AAAI Conference on Artificial Intelligence. Association for the Advancement of Artificial Intelligence, 2020. https://doi.org/10.1609/aaai.v34i06.6531.","mla":"Brázdil, Tomáš, et al. “Reinforcement Learning of Risk-Constrained Policies in Markov Decision Processes.” Proceedings of the 34th AAAI Conference on Artificial Intelligence, vol. 34, no. 06, Association for the Advancement of Artificial Intelligence, 2020, pp. 9794–801, doi:10.1609/aaai.v34i06.6531.","short":"T. Brázdil, K. Chatterjee, P. Novotný, J. Vahala, Proceedings of the 34th AAAI Conference on Artificial Intelligence 34 (2020) 9794–9801."},"article_type":"original","page":"9794-9801","day":"03","article_processing_charge":"No","keyword":["General Medicine"]},{"day":"01","has_accepted_license":"1","article_processing_charge":"No","publication":"Science Advances","citation":{"chicago":"Park, Sangsoon, Murat Artan, Seung Hyun Han, Hae-Eun H. Park, Yoonji Jung, Ara B. Hwang, Won Sik Shin, Kyong-Tai Kim, and Seung-Jae V. Lee. “VRK-1 Extends Life Span by Activation of AMPK via Phosphorylation.” Science Advances. American Association for the Advancement of Science, 2020. https://doi.org/10.1126/sciadv.aaw7824.","mla":"Park, Sangsoon, et al. “VRK-1 Extends Life Span by Activation of AMPK via Phosphorylation.” Science Advances, vol. 6, no. 27, aaw7824, American Association for the Advancement of Science, 2020, doi:10.1126/sciadv.aaw7824.","short":"S. Park, M. Artan, S.H. Han, H.-E.H. Park, Y. Jung, A.B. Hwang, W.S. Shin, K.-T. Kim, S.-J.V. Lee, Science Advances 6 (2020).","ista":"Park S, Artan M, Han SH, Park H-EH, Jung Y, Hwang AB, Shin WS, Kim K-T, Lee S-JV. 2020. VRK-1 extends life span by activation of AMPK via phosphorylation. Science Advances. 6(27), aaw7824.","apa":"Park, S., Artan, M., Han, S. H., Park, H.-E. H., Jung, Y., Hwang, A. B., … Lee, S.-J. V. (2020). VRK-1 extends life span by activation of AMPK via phosphorylation. Science Advances. American Association for the Advancement of Science. https://doi.org/10.1126/sciadv.aaw7824","ieee":"S. Park et al., “VRK-1 extends life span by activation of AMPK via phosphorylation,” Science Advances, vol. 6, no. 27. American Association for the Advancement of Science, 2020.","ama":"Park S, Artan M, Han SH, et al. VRK-1 extends life span by activation of AMPK via phosphorylation. Science Advances. 2020;6(27). doi:10.1126/sciadv.aaw7824"},"article_type":"original","date_published":"2020-07-01T00:00:00Z","type":"journal_article","abstract":[{"text":"Vaccinia virus–related kinase (VRK) is an evolutionarily conserved nuclear protein kinase. VRK-1, the single Caenorhabditis elegans VRK ortholog, functions in cell division and germline proliferation. However, the role of VRK-1 in postmitotic cells and adult life span remains unknown. Here, we show that VRK-1 increases organismal longevity by activating the cellular energy sensor, AMP-activated protein kinase (AMPK), via direct phosphorylation. We found that overexpression of vrk-1 in the soma of adult C. elegans increased life span and, conversely, inhibition of vrk-1 decreased life span. In addition, vrk-1 was required for longevity conferred by mutations that inhibit C. elegans mitochondrial respiration, which requires AMPK. VRK-1 directly phosphorylated and up-regulated AMPK in both C. elegans and cultured human cells. Thus, our data show that the somatic nuclear kinase, VRK-1, promotes longevity through AMPK activation, and this function appears to be conserved between C. elegans and humans.","lang":"eng"}],"issue":"27","_id":"15057","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"VRK-1 extends life span by activation of AMPK via phosphorylation","ddc":["570"],"status":"public","intvolume":" 6","oa_version":"Published Version","file":[{"creator":"dernst","file_size":1864415,"content_type":"application/pdf","access_level":"open_access","file_name":"2020_ScienceAdvances_Park.pdf","success":1,"checksum":"a37157cd0de709dce5fe03f4a31cd0b6","date_created":"2024-03-04T09:46:41Z","date_updated":"2024-03-04T09:46:41Z","file_id":"15058","relation":"main_file"}],"month":"07","publication_identifier":{"eissn":["2375-2548"]},"oa":1,"tmp":{"name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png","short":"CC BY-NC (4.0)"},"quality_controlled":"1","doi":"10.1126/sciadv.aaw7824","language":[{"iso":"eng"}],"article_number":"aaw7824","file_date_updated":"2024-03-04T09:46:41Z","year":"2020","acknowledgement":"This research was supported by grants NRF-2019R1A3B2067745 and NRF-2017R1A5A1015366 funded by the Korean Government (MSIT) through the National Research Foundation (NRF) of Korea to S.-J.V.L. and by grant Basic Science Research Program (No. 2019R1A2C2009440) funded by the Korean Government (MSIT) through the NRF of Korea to K.-T.K. ","publication_status":"published","department":[{"_id":"MaDe"}],"publisher":"American Association for the Advancement of Science","author":[{"full_name":"Park, Sangsoon","last_name":"Park","first_name":"Sangsoon"},{"full_name":"Artan, Murat","orcid":"0000-0001-8945-6992","id":"C407B586-6052-11E9-B3AE-7006E6697425","last_name":"Artan","first_name":"Murat"},{"full_name":"Han, Seung Hyun","first_name":"Seung Hyun","last_name":"Han"},{"full_name":"Park, Hae-Eun H.","first_name":"Hae-Eun H.","last_name":"Park"},{"first_name":"Yoonji","last_name":"Jung","full_name":"Jung, Yoonji"},{"full_name":"Hwang, Ara B.","first_name":"Ara B.","last_name":"Hwang"},{"full_name":"Shin, Won Sik","first_name":"Won Sik","last_name":"Shin"},{"first_name":"Kyong-Tai","last_name":"Kim","full_name":"Kim, Kyong-Tai"},{"first_name":"Seung-Jae V.","last_name":"Lee","full_name":"Lee, Seung-Jae V."}],"date_updated":"2024-03-04T09:52:09Z","date_created":"2024-03-04T09:41:57Z","volume":6},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"15061","title":"Calcium modulates the domain flexibility and function of an α-actinin similar to the ancestral α-actinin","status":"public","intvolume":" 117","oa_version":"Published Version","type":"journal_article","abstract":[{"text":"The actin cytoskeleton, a dynamic network of actin filaments and associated F-actin–binding proteins, is fundamentally important in eukaryotes. α-Actinins are major F-actin bundlers that are inhibited by Ca2+ in nonmuscle cells. Here we report the mechanism of Ca2+-mediated regulation of Entamoeba histolytica α-actinin-2 (EhActn2) with features expected for the common ancestor of Entamoeba and higher eukaryotic α-actinins. Crystal structures of Ca2+-free and Ca2+-bound EhActn2 reveal a calmodulin-like domain (CaMD) uniquely inserted within the rod domain. Integrative studies reveal an exceptionally high affinity of the EhActn2 CaMD for Ca2+, binding of which can only be regulated in the presence of physiological concentrations of Mg2+. Ca2+ binding triggers an increase in protein multidomain rigidity, reducing conformational flexibility of F-actin–binding domains via interdomain cross-talk and consequently inhibiting F-actin bundling. In vivo studies uncover that EhActn2 plays an important role in phagocytic cup formation and might constitute a new drug target for amoebic dysentery.","lang":"eng"}],"issue":"36","publication":"Proceedings of the National Academy of Sciences","citation":{"chicago":"Pinotsis, Nikos, Karolina Zielinska, Mrigya Babuta, Joan L. Arolas, Julius Kostan, Muhammad Bashir Khan, Claudia Schreiner, et al. “Calcium Modulates the Domain Flexibility and Function of an α-Actinin Similar to the Ancestral α-Actinin.” Proceedings of the National Academy of Sciences. Proceedings of the National Academy of Sciences, 2020. https://doi.org/10.1073/pnas.1917269117.","mla":"Pinotsis, Nikos, et al. “Calcium Modulates the Domain Flexibility and Function of an α-Actinin Similar to the Ancestral α-Actinin.” Proceedings of the National Academy of Sciences, vol. 117, no. 36, Proceedings of the National Academy of Sciences, 2020, pp. 22101–12, doi:10.1073/pnas.1917269117.","short":"N. Pinotsis, K. Zielinska, M. Babuta, J.L. Arolas, J. Kostan, M.B. Khan, C. Schreiner, A.P. Testa Salmazo, L. Ciccarelli, M. Puchinger, E.A. Gkougkoulia, E. de A. Ribeiro, T.C. Marlovits, A. Bhattacharya, K. Djinovic-Carugo, Proceedings of the National Academy of Sciences 117 (2020) 22101–22112.","ista":"Pinotsis N, Zielinska K, Babuta M, Arolas JL, Kostan J, Khan MB, Schreiner C, Testa Salmazo AP, Ciccarelli L, Puchinger M, Gkougkoulia EA, Ribeiro E de A, Marlovits TC, Bhattacharya A, Djinovic-Carugo K. 2020. Calcium modulates the domain flexibility and function of an α-actinin similar to the ancestral α-actinin. Proceedings of the National Academy of Sciences. 117(36), 22101–22112.","ieee":"N. Pinotsis et al., “Calcium modulates the domain flexibility and function of an α-actinin similar to the ancestral α-actinin,” Proceedings of the National Academy of Sciences, vol. 117, no. 36. Proceedings of the National Academy of Sciences, pp. 22101–22112, 2020.","apa":"Pinotsis, N., Zielinska, K., Babuta, M., Arolas, J. L., Kostan, J., Khan, M. B., … Djinovic-Carugo, K. (2020). Calcium modulates the domain flexibility and function of an α-actinin similar to the ancestral α-actinin. Proceedings of the National Academy of Sciences. Proceedings of the National Academy of Sciences. https://doi.org/10.1073/pnas.1917269117","ama":"Pinotsis N, Zielinska K, Babuta M, et al. Calcium modulates the domain flexibility and function of an α-actinin similar to the ancestral α-actinin. Proceedings of the National Academy of Sciences. 2020;117(36):22101-22112. doi:10.1073/pnas.1917269117"},"article_type":"original","page":"22101-22112","date_published":"2020-09-08T00:00:00Z","day":"08","article_processing_charge":"No","acknowledgement":"We thank the staff of the macromolecular crystallography (MX) and SAXS beamlines at the European Synchrotron Radiation facility, Diamond, and Swiss Light Source for excellent support, and the Life Sciences Facility of the Institute of Science and Technology Austria for usage of the rheometer. We thank Life Sciences editors for editing assistance. EM data were\r\nrecorded at the EM Facility of the Vienna BioCenter Core Facilities (Austria). Confocal microscopy was carried out at the Advanced Instrument Research Facility, Jawaharlal Nehru University. K.D.-C.’s research was supported by the Initial Training Network MUZIC (ITN-MUZIC) (N°238423), Austrian Science Fund (FWF) Projects I525, I1593, P22276, P19060, and W1221, Laura Bassi Centre of Optimized Structural Studies (N°253275), a Wellcome Trust Collaborative Award (201543/Z/16/Z), COST Action BM1405, Vienna Science and Technology Fund (WWTF) Chemical Biology Project LS17-008, and Christian Doppler Laboratory for High-Content Structural Biology and Biotechnology. K.Z., J.L.A., C.S., E.A.G., and A.S. were supported by the University of Vienna, J.K. by a Wellcome Trust Collaborative Award and by the Centre of Optimized Structural Studies, M.P. by FWF Project I1593, E.d.A.R. ITN-MUZIC, and FWF Projects I525 and I1593, and T.C.M. and L.C. by FWF Project I 2408-B22. E.A.G. acknowledges the PhD program Structure and Interaction of Biological Macromolecules. M.B. acknowledges the University Grant Commission, India, for a senior research fellowship. A.B. acknowledges a JC Bose Fellowship from the Science Engineering Research Council. ","year":"2020","pmid":1,"publication_status":"published","publisher":"Proceedings of the National Academy of Sciences","department":[{"_id":"CaBe"}],"author":[{"last_name":"Pinotsis","first_name":"Nikos","full_name":"Pinotsis, Nikos"},{"last_name":"Zielinska","first_name":"Karolina","full_name":"Zielinska, Karolina"},{"full_name":"Babuta, Mrigya","last_name":"Babuta","first_name":"Mrigya"},{"full_name":"Arolas, Joan L.","last_name":"Arolas","first_name":"Joan L."},{"full_name":"Kostan, Julius","first_name":"Julius","last_name":"Kostan"},{"full_name":"Khan, Muhammad Bashir","last_name":"Khan","first_name":"Muhammad Bashir"},{"first_name":"Claudia","last_name":"Schreiner","full_name":"Schreiner, Claudia"},{"first_name":"Anita P","last_name":"Testa Salmazo","id":"41F1F098-F248-11E8-B48F-1D18A9856A87","full_name":"Testa Salmazo, Anita P"},{"first_name":"Luciano","last_name":"Ciccarelli","full_name":"Ciccarelli, Luciano"},{"last_name":"Puchinger","first_name":"Martin","full_name":"Puchinger, Martin"},{"first_name":"Eirini A.","last_name":"Gkougkoulia","full_name":"Gkougkoulia, Eirini A."},{"full_name":"Ribeiro, Euripedes de Almeida","last_name":"Ribeiro","first_name":"Euripedes de Almeida"},{"full_name":"Marlovits, Thomas C.","last_name":"Marlovits","first_name":"Thomas C."},{"full_name":"Bhattacharya, Alok","last_name":"Bhattacharya","first_name":"Alok"},{"last_name":"Djinovic-Carugo","first_name":"Kristina","full_name":"Djinovic-Carugo, Kristina"}],"date_created":"2024-03-04T10:03:52Z","date_updated":"2024-03-04T10:14:44Z","volume":117,"external_id":{"pmid":["32848067"]},"oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1073/pnas.191726911"}],"quality_controlled":"1","doi":"10.1073/pnas.1917269117","acknowledged_ssus":[{"_id":"LifeSc"}],"language":[{"iso":"eng"}],"month":"09","publication_identifier":{"eissn":["1091-6490"],"issn":["0027-8424"]}},{"type":"journal_article","abstract":[{"lang":"eng","text":"We call a continuous self-map that reveals itself through a discrete set of point-value pairs a sampled dynamical system. Capturing the available information with chain maps on Delaunay complexes, we use persistent homology to quantify the evidence of recurrent behavior. We establish a sampling theorem to recover the eigenspaces of the endomorphism on homology induced by the self-map. Using a combinatorial gradient flow arising from the discrete Morse theory for Čech and Delaunay complexes, we construct a chain map to transform the problem from the natural but expensive Čech complexes to the computationally efficient Delaunay triangulations. The fast chain map algorithm has applications beyond dynamical systems."}],"issue":"4","_id":"15064","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["500"],"title":"Čech-Delaunay gradient flow and homology inference for self-maps","status":"public","intvolume":" 4","file":[{"file_size":851190,"content_type":"application/pdf","creator":"dernst","access_level":"open_access","file_name":"2020_JourApplCompTopology_Bauer.pdf","checksum":"eed1168b6e66cd55272c19bb7fca8a1c","success":1,"date_created":"2024-03-04T10:52:42Z","date_updated":"2024-03-04T10:52:42Z","relation":"main_file","file_id":"15065"}],"oa_version":"Published Version","scopus_import":"1","day":"01","article_processing_charge":"Yes (via OA deal)","has_accepted_license":"1","publication":"Journal of Applied and Computational Topology","citation":{"mla":"Bauer, U., et al. “Čech-Delaunay Gradient Flow and Homology Inference for Self-Maps.” Journal of Applied and Computational Topology, vol. 4, no. 4, Springer Nature, 2020, pp. 455–80, doi:10.1007/s41468-020-00058-8.","short":"U. Bauer, H. Edelsbrunner, G. Jablonski, M. Mrozek, Journal of Applied and Computational Topology 4 (2020) 455–480.","chicago":"Bauer, U., Herbert Edelsbrunner, Grzegorz Jablonski, and M. Mrozek. “Čech-Delaunay Gradient Flow and Homology Inference for Self-Maps.” Journal of Applied and Computational Topology. Springer Nature, 2020. https://doi.org/10.1007/s41468-020-00058-8.","ama":"Bauer U, Edelsbrunner H, Jablonski G, Mrozek M. Čech-Delaunay gradient flow and homology inference for self-maps. Journal of Applied and Computational Topology. 2020;4(4):455-480. doi:10.1007/s41468-020-00058-8","ista":"Bauer U, Edelsbrunner H, Jablonski G, Mrozek M. 2020. Čech-Delaunay gradient flow and homology inference for self-maps. Journal of Applied and Computational Topology. 4(4), 455–480.","apa":"Bauer, U., Edelsbrunner, H., Jablonski, G., & Mrozek, M. (2020). Čech-Delaunay gradient flow and homology inference for self-maps. Journal of Applied and Computational Topology. Springer Nature. https://doi.org/10.1007/s41468-020-00058-8","ieee":"U. Bauer, H. Edelsbrunner, G. Jablonski, and M. Mrozek, “Čech-Delaunay gradient flow and homology inference for self-maps,” Journal of Applied and Computational Topology, vol. 4, no. 4. Springer Nature, pp. 455–480, 2020."},"article_type":"original","page":"455-480","date_published":"2020-12-01T00:00:00Z","file_date_updated":"2024-03-04T10:52:42Z","year":"2020","acknowledgement":"This research has been supported by the DFG Collaborative Research Center SFB/TRR 109 “Discretization in Geometry and Dynamics”, by Polish MNiSzW Grant No. 2621/7.PR/12/2013/2, by the Polish National Science Center under Maestro Grant No. 2014/14/A/ST1/00453 and Grant No. DEC-2013/09/N/ST6/02995. Open Access funding provided by Projekt DEAL.","publication_status":"published","publisher":"Springer Nature","department":[{"_id":"HeEd"}],"author":[{"first_name":"U.","last_name":"Bauer","full_name":"Bauer, U."},{"full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","first_name":"Herbert"},{"full_name":"Jablonski, Grzegorz","orcid":"0000-0002-3536-9866","id":"4483EF78-F248-11E8-B48F-1D18A9856A87","last_name":"Jablonski","first_name":"Grzegorz"},{"last_name":"Mrozek","first_name":"M.","full_name":"Mrozek, M."}],"date_updated":"2024-03-04T10:54:04Z","date_created":"2024-03-04T10:47:49Z","volume":4,"month":"12","publication_identifier":{"issn":["2367-1726"],"eissn":["2367-1734"]},"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"quality_controlled":"1","doi":"10.1007/s41468-020-00058-8","language":[{"iso":"eng"}]},{"date_published":"2020-11-16T00:00:00Z","page":"101-146","article_type":"original","citation":{"ieee":"G. Cipolloni, L. Erdös, and D. J. Schröder, “Optimal lower bound on the least singular value of the shifted Ginibre ensemble,” Probability and Mathematical Physics, vol. 1, no. 1. Mathematical Sciences Publishers, pp. 101–146, 2020.","apa":"Cipolloni, G., Erdös, L., & Schröder, D. J. (2020). Optimal lower bound on the least singular value of the shifted Ginibre ensemble. Probability and Mathematical Physics. Mathematical Sciences Publishers. https://doi.org/10.2140/pmp.2020.1.101","ista":"Cipolloni G, Erdös L, Schröder DJ. 2020. Optimal lower bound on the least singular value of the shifted Ginibre ensemble. Probability and Mathematical Physics. 1(1), 101–146.","ama":"Cipolloni G, Erdös L, Schröder DJ. Optimal lower bound on the least singular value of the shifted Ginibre ensemble. Probability and Mathematical Physics. 2020;1(1):101-146. doi:10.2140/pmp.2020.1.101","chicago":"Cipolloni, Giorgio, László Erdös, and Dominik J Schröder. “Optimal Lower Bound on the Least Singular Value of the Shifted Ginibre Ensemble.” Probability and Mathematical Physics. Mathematical Sciences Publishers, 2020. https://doi.org/10.2140/pmp.2020.1.101.","short":"G. Cipolloni, L. Erdös, D.J. Schröder, Probability and Mathematical Physics 1 (2020) 101–146.","mla":"Cipolloni, Giorgio, et al. “Optimal Lower Bound on the Least Singular Value of the Shifted Ginibre Ensemble.” Probability and Mathematical Physics, vol. 1, no. 1, Mathematical Sciences Publishers, 2020, pp. 101–46, doi:10.2140/pmp.2020.1.101."},"publication":"Probability and Mathematical Physics","article_processing_charge":"No","day":"16","keyword":["General Medicine"],"scopus_import":"1","oa_version":"Preprint","intvolume":" 1","status":"public","title":"Optimal lower bound on the least singular value of the shifted Ginibre ensemble","_id":"15063","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","issue":"1","abstract":[{"text":"We consider the least singular value of a large random matrix with real or complex i.i.d. Gaussian entries shifted by a constant z∈C. We prove an optimal lower tail estimate on this singular value in the critical regime where z is around the spectral edge, thus improving the classical bound of Sankar, Spielman and Teng (SIAM J. Matrix Anal. Appl. 28:2 (2006), 446–476) for the particular shift-perturbation in the edge regime. Lacking Brézin–Hikami formulas in the real case, we rely on the superbosonization formula (Comm. Math. Phys. 283:2 (2008), 343–395).","lang":"eng"}],"type":"journal_article","language":[{"iso":"eng"}],"doi":"10.2140/pmp.2020.1.101","project":[{"grant_number":"338804","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Random matrices, universality and disordered quantum systems"},{"call_identifier":"H2020","name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385"}],"quality_controlled":"1","oa":1,"external_id":{"arxiv":["1908.01653"]},"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.1908.01653","open_access":"1"}],"publication_identifier":{"issn":["2690-1005","2690-0998"]},"month":"11","volume":1,"date_updated":"2024-03-04T10:33:15Z","date_created":"2024-03-04T10:27:57Z","author":[{"last_name":"Cipolloni","first_name":"Giorgio","orcid":"0000-0002-4901-7992","id":"42198EFA-F248-11E8-B48F-1D18A9856A87","full_name":"Cipolloni, Giorgio"},{"full_name":"Erdös, László","last_name":"Erdös","first_name":"László","orcid":"0000-0001-5366-9603","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Schröder, Dominik J","first_name":"Dominik J","last_name":"Schröder","id":"408ED176-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2904-1856"}],"department":[{"_id":"LaEr"}],"publisher":"Mathematical Sciences Publishers","publication_status":"published","acknowledgement":"Partially supported by ERC Advanced Grant No. 338804. This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie Grant Agreement No. 66538","year":"2020","ec_funded":1},{"oa_version":"None","date_created":"2024-03-04T09:57:48Z","date_updated":"2024-03-04T10:02:49Z","author":[{"full_name":"Wasiak, Michal","last_name":"Wasiak","first_name":"Michal"},{"first_name":"Gabriel Santamaria","last_name":"Botello","full_name":"Botello, Gabriel Santamaria"},{"full_name":"Abdalmalak, Kerlos Atia","first_name":"Kerlos Atia","last_name":"Abdalmalak"},{"first_name":"Florian","last_name":"Sedlmeir","full_name":"Sedlmeir, Florian"},{"last_name":"Rueda Sanchez","first_name":"Alfredo R","orcid":"0000-0001-6249-5860","id":"3B82B0F8-F248-11E8-B48F-1D18A9856A87","full_name":"Rueda Sanchez, Alfredo R"},{"first_name":"Daniel","last_name":"Segovia-Vargas","full_name":"Segovia-Vargas, Daniel"},{"last_name":"Schwefel","first_name":"Harald G. L.","full_name":"Schwefel, Harald G. L."},{"full_name":"Munoz, Luis Enrique Garcia","first_name":"Luis Enrique Garcia","last_name":"Munoz"}],"publisher":"IEEE","department":[{"_id":"JoFi"}],"title":"Compact millimeter and submillimeter-wave photonic radiometer for cubesats","publication_status":"published","status":"public","acknowledgement":"This work has been financially supported by Comunidad de Madrid S2018/NMT-4333 ARTINLARA-CM projects, and “FUNDACIÓN SENER” REFTA projects.","_id":"15059","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2020","abstract":[{"lang":"eng","text":"In this paper we present a room temperature radiometer that can eliminate the need of using cryostats in satellite payload reducing its weight and improving reliability. The proposed radiometer is based on an electro-optic upconverter that boosts up microwave photons energy by upconverting them into an optical domain what makes them immune to thermal noise even if operating at room temperature. The converter uses a high-quality factor whispering gallery\r\nmode (WGM) resonator providing naturally narrow bandwidth and therefore might be useful for applications like microwave hyperspectral sensing. The upconversion process is explained by\r\nproviding essential information about photon conversion efficiency and sensitivity. To prove the concept, we describe an experiment which shows state-of-the-art photon conversion efficiency n=10-5 per mW of pump power at the frequency of 80 GHz."}],"type":"conference","language":[{"iso":"eng"}],"date_published":"2020-07-08T00:00:00Z","doi":"10.23919/eucap48036.2020.9135962","conference":{"name":"EuCAP: European Conference on Antennas and Propagation","start_date":"2020-03-15","location":"Copenhagen, Denmark","end_date":"2020-03-20"},"quality_controlled":"1","citation":{"ista":"Wasiak M, Botello GS, Abdalmalak KA, Sedlmeir F, Rueda Sanchez AR, Segovia-Vargas D, Schwefel HGL, Munoz LEG. 2020. Compact millimeter and submillimeter-wave photonic radiometer for cubesats. 14th European Conference on Antennas and Propagation. EuCAP: European Conference on Antennas and Propagation.","apa":"Wasiak, M., Botello, G. S., Abdalmalak, K. A., Sedlmeir, F., Rueda Sanchez, A. R., Segovia-Vargas, D., … Munoz, L. E. G. (2020). Compact millimeter and submillimeter-wave photonic radiometer for cubesats. In 14th European Conference on Antennas and Propagation. Copenhagen, Denmark: IEEE. https://doi.org/10.23919/eucap48036.2020.9135962","ieee":"M. Wasiak et al., “Compact millimeter and submillimeter-wave photonic radiometer for cubesats,” in 14th European Conference on Antennas and Propagation, Copenhagen, Denmark, 2020.","ama":"Wasiak M, Botello GS, Abdalmalak KA, et al. Compact millimeter and submillimeter-wave photonic radiometer for cubesats. In: 14th European Conference on Antennas and Propagation. IEEE; 2020. doi:10.23919/eucap48036.2020.9135962","chicago":"Wasiak, Michal, Gabriel Santamaria Botello, Kerlos Atia Abdalmalak, Florian Sedlmeir, Alfredo R Rueda Sanchez, Daniel Segovia-Vargas, Harald G. L. Schwefel, and Luis Enrique Garcia Munoz. “Compact Millimeter and Submillimeter-Wave Photonic Radiometer for Cubesats.” In 14th European Conference on Antennas and Propagation. IEEE, 2020. https://doi.org/10.23919/eucap48036.2020.9135962.","mla":"Wasiak, Michal, et al. “Compact Millimeter and Submillimeter-Wave Photonic Radiometer for Cubesats.” 14th European Conference on Antennas and Propagation, IEEE, 2020, doi:10.23919/eucap48036.2020.9135962.","short":"M. Wasiak, G.S. Botello, K.A. Abdalmalak, F. Sedlmeir, A.R. Rueda Sanchez, D. Segovia-Vargas, H.G.L. Schwefel, L.E.G. Munoz, in:, 14th European Conference on Antennas and Propagation, IEEE, 2020."},"publication":"14th European Conference on Antennas and Propagation","publication_identifier":{"eisbn":["9788831299008"]},"article_processing_charge":"No","day":"08","month":"07"},{"abstract":[{"text":"We introduce a new graph problem, the token dropping game, and we show how to solve it efficiently in a distributed setting. We use the token dropping game as a tool to design an efficient distributed algorithm for the stable orientation problem, which is a special case of the more general locally optimal semi-matching problem. The prior work by Czygrinow et al. (DISC 2012) finds a locally optimal semi-matching in O(Δ⁵) rounds in graphs of maximum degree Δ, which directly implies an algorithm with the same runtime for stable orientations. We improve the runtime to O(Δ⁴) for stable orientations and prove a lower bound of Ω(Δ) rounds.","lang":"eng"}],"alternative_title":["LIPIcs"],"type":"conference","file":[{"content_type":"application/pdf","file_size":303529,"creator":"dernst","access_level":"open_access","file_name":"2020_LIPIcs_Brandt.pdf","checksum":"23e2d9321aef53092dc1e24a8ab82d72","success":1,"date_updated":"2024-03-05T07:08:27Z","date_created":"2024-03-05T07:08:27Z","relation":"main_file","file_id":"15075"}],"oa_version":"Published Version","intvolume":" 179","title":"Brief announcement: Efficient load-balancing through distributed token dropping","ddc":["000"],"status":"public","_id":"15074","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","article_processing_charge":"No","day":"07","scopus_import":"1","date_published":"2020-10-07T00:00:00Z","citation":{"ista":"Brandt S, Keller B, Rybicki J, Suomela J, Uitto J. 2020. Brief announcement: Efficient load-balancing through distributed token dropping. 34th International Symposium on Distributed Computing. DISC: Symposium on Distributed Computing, LIPIcs, vol. 179, 40.","apa":"Brandt, S., Keller, B., Rybicki, J., Suomela, J., & Uitto, J. (2020). Brief announcement: Efficient load-balancing through distributed token dropping. In 34th International Symposium on Distributed Computing (Vol. 179). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.DISC.2020.40","ieee":"S. Brandt, B. Keller, J. Rybicki, J. Suomela, and J. Uitto, “Brief announcement: Efficient load-balancing through distributed token dropping,” in 34th International Symposium on Distributed Computing, Virtual, 2020, vol. 179.","ama":"Brandt S, Keller B, Rybicki J, Suomela J, Uitto J. Brief announcement: Efficient load-balancing through distributed token dropping. In: 34th International Symposium on Distributed Computing. Vol 179. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.DISC.2020.40","chicago":"Brandt, Sebastian, Barbara Keller, Joel Rybicki, Jukka Suomela, and Jara Uitto. “Brief Announcement: Efficient Load-Balancing through Distributed Token Dropping.” In 34th International Symposium on Distributed Computing, Vol. 179. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.DISC.2020.40.","mla":"Brandt, Sebastian, et al. “Brief Announcement: Efficient Load-Balancing through Distributed Token Dropping.” 34th International Symposium on Distributed Computing, vol. 179, 40, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.DISC.2020.40.","short":"S. Brandt, B. Keller, J. Rybicki, J. Suomela, J. Uitto, in:, 34th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020."},"publication":"34th International Symposium on Distributed Computing","license":"https://creativecommons.org/licenses/by/3.0/","file_date_updated":"2024-03-05T07:08:27Z","article_number":"40","volume":179,"date_created":"2024-03-05T07:09:12Z","date_updated":"2024-03-05T07:13:13Z","related_material":{"record":[{"id":"9678","relation":"later_version","status":"public"}]},"author":[{"full_name":"Brandt, Sebastian","first_name":"Sebastian","last_name":"Brandt"},{"last_name":"Keller","first_name":"Barbara","full_name":"Keller, Barbara"},{"full_name":"Rybicki, Joel","id":"334EFD2E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6432-6646","first_name":"Joel","last_name":"Rybicki"},{"full_name":"Suomela, Jukka","first_name":"Jukka","last_name":"Suomela"},{"last_name":"Uitto","first_name":"Jara","full_name":"Uitto, Jara"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"DaAl"}],"publication_status":"published","year":"2020","month":"10","language":[{"iso":"eng"}],"doi":"10.4230/LIPIcs.DISC.2020.40","conference":{"name":"DISC: Symposium on Distributed Computing","location":"Virtual","start_date":"2020-10-12","end_date":"2020-10-16"},"quality_controlled":"1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","short":"CC BY (3.0)","image":"/images/cc_by.png"},"external_id":{"arxiv":["2005.07761"]},"oa":1},{"day":"29","has_accepted_license":"1","article_processing_charge":"No","scopus_import":"1","date_published":"2020-06-29T00:00:00Z","publication":"47th International Colloquium on Automata, Languages, and Programming","citation":{"chicago":"Alistarh, Dan-Adrian, Giorgi Nadiradze, and Amirmojtaba Sabour. “Dynamic Averaging Load Balancing on Cycles.” In 47th International Colloquium on Automata, Languages, and Programming, Vol. 168. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.ICALP.2020.7.","short":"D.-A. Alistarh, G. Nadiradze, A. Sabour, in:, 47th International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","mla":"Alistarh, Dan-Adrian, et al. “Dynamic Averaging Load Balancing on Cycles.” 47th International Colloquium on Automata, Languages, and Programming, vol. 168, 7, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.ICALP.2020.7.","apa":"Alistarh, D.-A., Nadiradze, G., & Sabour, A. (2020). Dynamic averaging load balancing on cycles. In 47th International Colloquium on Automata, Languages, and Programming (Vol. 168). Saarbrücken, Germany, Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2020.7","ieee":"D.-A. Alistarh, G. Nadiradze, and A. Sabour, “Dynamic averaging load balancing on cycles,” in 47th International Colloquium on Automata, Languages, and Programming, Saarbrücken, Germany, Virtual, 2020, vol. 168.","ista":"Alistarh D-A, Nadiradze G, Sabour A. 2020. Dynamic averaging load balancing on cycles. 47th International Colloquium on Automata, Languages, and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LIPIcs, vol. 168, 7.","ama":"Alistarh D-A, Nadiradze G, Sabour A. Dynamic averaging load balancing on cycles. In: 47th International Colloquium on Automata, Languages, and Programming. Vol 168. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.ICALP.2020.7"},"abstract":[{"lang":"eng","text":"We consider the following dynamic load-balancing process: given an underlying graph G with n nodes, in each step t≥ 0, one unit of load is created, and placed at a randomly chosen graph node. In the same step, the chosen node picks a random neighbor, and the two nodes balance their loads by averaging them. We are interested in the expected gap between the minimum and maximum loads at nodes as the process progresses, and its dependence on n and on the graph structure. Variants of the above graphical balanced allocation process have been studied previously by Peres, Talwar, and Wieder [Peres et al., 2015], and by Sauerwald and Sun [Sauerwald and Sun, 2015]. These authors left as open the question of characterizing the gap in the case of cycle graphs in the dynamic case, where weights are created during the algorithm’s execution. For this case, the only known upper bound is of 𝒪(n log n), following from a majorization argument due to [Peres et al., 2015], which analyzes a related graphical allocation process. In this paper, we provide an upper bound of 𝒪 (√n log n) on the expected gap of the above process for cycles of length n. We introduce a new potential analysis technique, which enables us to bound the difference in load between k-hop neighbors on the cycle, for any k ≤ n/2. We complement this with a \"gap covering\" argument, which bounds the maximum value of the gap by bounding its value across all possible subsets of a certain structure, and recursively bounding the gaps within each subset. We provide analytical and experimental evidence that our upper bound on the gap is tight up to a logarithmic factor."}],"type":"conference","alternative_title":["LIPIcs"],"file":[{"content_type":"application/pdf","file_size":782987,"creator":"dernst","file_name":"2020_LIPIcs_Alistarh.pdf","access_level":"open_access","date_updated":"2024-03-05T07:25:15Z","date_created":"2024-03-05T07:25:15Z","checksum":"e5eb16199f4ccfd77a321977eb3f026f","success":1,"relation":"main_file","file_id":"15078"}],"oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"15077","ddc":["000"],"status":"public","title":"Dynamic averaging load balancing on cycles","intvolume":" 168","month":"06","conference":{"location":"Saarbrücken, Germany, Virtual","start_date":"2020-07-08","end_date":"2020-07-11","name":"ICALP: International Colloquium on Automata, Languages, and Programming"},"doi":"10.4230/LIPIcs.ICALP.2020.7","language":[{"iso":"eng"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","short":"CC BY (3.0)","image":"/images/cc_by.png"},"external_id":{"arxiv":["2003.09297"]},"oa":1,"quality_controlled":"1","project":[{"grant_number":"805223","_id":"268A44D6-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Elastic Coordination for Scalable Machine Learning"}],"file_date_updated":"2024-03-05T07:25:15Z","ec_funded":1,"article_number":"7","author":[{"orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian"},{"full_name":"Nadiradze, Giorgi","last_name":"Nadiradze","first_name":"Giorgi","orcid":"0000-0001-5634-0731","id":"3279A00C-F248-11E8-B48F-1D18A9856A87"},{"id":"bcc145fd-e77f-11ea-ae8b-80d661dbff67","first_name":"Amirmojtaba","last_name":"Sabour","full_name":"Sabour, Amirmojtaba"}],"related_material":{"record":[{"id":"8286","status":"public","relation":"later_version"}]},"date_updated":"2024-03-05T07:35:53Z","date_created":"2024-03-05T07:25:37Z","volume":168,"year":"2020","acknowledgement":"The authors sincerely thank Thomas Sauerwald and George Giakkoupis for insightful discussions, and Mohsen Ghaffari, Yuval Peres, and Udi Wieder for feedback on earlier\r\nversions of this draft. We also thank the ICALP anonymous reviewers for their very useful comments.\r\nFunding: European Research Council funding award PR1042ERC01","publication_status":"published","department":[{"_id":"DaAl"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik"},{"abstract":[{"lang":"eng","text":"Two plane drawings of geometric graphs on the same set of points are called disjoint compatible if their union is plane and they do not have an edge in common. For a given set S of 2n points two plane drawings of perfect matchings M1 and M2 (which do not need to be disjoint nor compatible) are disjoint tree-compatible if there exists a plane drawing of a spanning tree T on S which is disjoint compatible to both M1 and M2.\r\nWe show that the graph of all disjoint tree-compatible perfect geometric matchings on 2n points in convex position is connected if and only if 2n ≥ 10. Moreover, in that case the diameter\r\nof this graph is either 4 or 5, independent of n."}],"article_number":"56","type":"conference","date_created":"2024-03-05T08:57:17Z","date_updated":"2024-03-05T09:00:07Z","oa_version":"Published Version","author":[{"full_name":"Aichholzer, Oswin","first_name":"Oswin","last_name":"Aichholzer"},{"full_name":"Obmann, Julia","first_name":"Julia","last_name":"Obmann"},{"id":"B593B804-1035-11EA-B4F1-947645A5BB83","first_name":"Pavel","last_name":"Patak","full_name":"Patak, Pavel"},{"full_name":"Perz, Daniel","last_name":"Perz","first_name":"Daniel"},{"id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1097-9684","first_name":"Josef","last_name":"Tkadlec","full_name":"Tkadlec, Josef"}],"title":"Disjoint tree-compatible plane perfect matchings","status":"public","publication_status":"published","department":[{"_id":"KrCh"},{"_id":"UlWa"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"15082","year":"2020","acknowledgement":"Research on this work was initiated at the 6th Austrian-Japanese-Mexican-Spanish Workshop on Discrete Geometry and continued during the 16th European Geometric Graph-Week, both held near Strobl, Austria. We are grateful to the participants for the inspiring atmosphere. We especially thank Alexander Pilz for bringing this class of problems to our attention and Birgit Vogtenhuber for inspiring discussions. D.P. is partially supported by the FWF grant I 3340-N35 (Collaborative DACH project Arrangements and Drawings). The research stay of P.P. at IST Austria is funded by the project CZ.02.2.69/0.0/0.0/17_050/0008466 Improvement of internationalization in the field of research and development at Charles University, through the support of quality projects MSCA-IF. This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No 734922.","month":"04","day":"01","article_processing_charge":"No","language":[{"iso":"eng"}],"conference":{"name":"EuroCG: European Workshop on Computational Geometry","location":"Würzburg, Germany, Virtual","start_date":"2020-03-16","end_date":"2020-03-18"},"date_published":"2020-04-01T00:00:00Z","quality_controlled":"1","publication":"36th European Workshop on Computational Geometry","oa":1,"main_file_link":[{"open_access":"1","url":"https://www1.pub.informatik.uni-wuerzburg.de/eurocg2020/data/uploads/papers/eurocg20_paper_56.pdf"}],"citation":{"ama":"Aichholzer O, Obmann J, Patak P, Perz D, Tkadlec J. Disjoint tree-compatible plane perfect matchings. In: 36th European Workshop on Computational Geometry. ; 2020.","ista":"Aichholzer O, Obmann J, Patak P, Perz D, Tkadlec J. 2020. Disjoint tree-compatible plane perfect matchings. 36th European Workshop on Computational Geometry. EuroCG: European Workshop on Computational Geometry, 56.","ieee":"O. Aichholzer, J. Obmann, P. Patak, D. Perz, and J. Tkadlec, “Disjoint tree-compatible plane perfect matchings,” in 36th European Workshop on Computational Geometry, Würzburg, Germany, Virtual, 2020.","apa":"Aichholzer, O., Obmann, J., Patak, P., Perz, D., & Tkadlec, J. (2020). Disjoint tree-compatible plane perfect matchings. In 36th European Workshop on Computational Geometry. Würzburg, Germany, Virtual.","mla":"Aichholzer, Oswin, et al. “Disjoint Tree-Compatible Plane Perfect Matchings.” 36th European Workshop on Computational Geometry, 56, 2020.","short":"O. Aichholzer, J. Obmann, P. Patak, D. Perz, J. Tkadlec, in:, 36th European Workshop on Computational Geometry, 2020.","chicago":"Aichholzer, Oswin, Julia Obmann, Pavel Patak, Daniel Perz, and Josef Tkadlec. “Disjoint Tree-Compatible Plane Perfect Matchings.” In 36th European Workshop on Computational Geometry, 2020."}},{"intvolume":" 48","title":"Analysis of a two-layer neural network via displacement convexity","status":"public","_id":"6748","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","type":"journal_article","issue":"6","abstract":[{"lang":"eng","text":"Fitting a function by using linear combinations of a large number N of `simple' components is one of the most fruitful ideas in statistical learning. This idea lies at the core of a variety of methods, from two-layer neural networks to kernel regression, to boosting. In general, the resulting risk minimization problem is non-convex and is solved by gradient descent or its variants. Unfortunately, little is known about global convergence properties of these approaches.\r\nHere we consider the problem of learning a concave function f on a compact convex domain Ω⊆ℝd, using linear combinations of `bump-like' components (neurons). The parameters to be fitted are the centers of N bumps, and the resulting empirical risk minimization problem is highly non-convex. We prove that, in the limit in which the number of neurons diverges, the evolution of gradient descent converges to a Wasserstein gradient flow in the space of probability distributions over Ω. Further, when the bump width δ tends to 0, this gradient flow has a limit which is a viscous porous medium equation. Remarkably, the cost function optimized by this gradient flow exhibits a special property known as displacement convexity, which implies exponential convergence rates for N→∞, δ→0. Surprisingly, this asymptotic theory appears to capture well the behavior for moderate values of δ,N. Explaining this phenomenon, and understanding the dependence on δ,N in a quantitative manner remains an outstanding challenge."}],"page":"3619-3642","article_type":"original","citation":{"mla":"Javanmard, Adel, et al. “Analysis of a Two-Layer Neural Network via Displacement Convexity.” Annals of Statistics, vol. 48, no. 6, Institute of Mathematical Statistics, 2020, pp. 3619–42, doi:10.1214/20-AOS1945.","short":"A. Javanmard, M. Mondelli, A. Montanari, Annals of Statistics 48 (2020) 3619–3642.","chicago":"Javanmard, Adel, Marco Mondelli, and Andrea Montanari. “Analysis of a Two-Layer Neural Network via Displacement Convexity.” Annals of Statistics. Institute of Mathematical Statistics, 2020. https://doi.org/10.1214/20-AOS1945.","ama":"Javanmard A, Mondelli M, Montanari A. Analysis of a two-layer neural network via displacement convexity. Annals of Statistics. 2020;48(6):3619-3642. doi:10.1214/20-AOS1945","ista":"Javanmard A, Mondelli M, Montanari A. 2020. Analysis of a two-layer neural network via displacement convexity. Annals of Statistics. 48(6), 3619–3642.","ieee":"A. Javanmard, M. Mondelli, and A. Montanari, “Analysis of a two-layer neural network via displacement convexity,” Annals of Statistics, vol. 48, no. 6. Institute of Mathematical Statistics, pp. 3619–3642, 2020.","apa":"Javanmard, A., Mondelli, M., & Montanari, A. (2020). Analysis of a two-layer neural network via displacement convexity. Annals of Statistics. Institute of Mathematical Statistics. https://doi.org/10.1214/20-AOS1945"},"publication":"Annals of Statistics","date_published":"2020-12-11T00:00:00Z","article_processing_charge":"No","day":"11","publisher":"Institute of Mathematical Statistics","department":[{"_id":"MaMo"}],"publication_status":"published","year":"2020","volume":48,"date_created":"2019-07-31T09:39:42Z","date_updated":"2024-03-06T08:28:50Z","author":[{"last_name":"Javanmard","first_name":"Adel","full_name":"Javanmard, Adel"},{"full_name":"Mondelli, Marco","orcid":"0000-0002-3242-7020","id":"27EB676C-8706-11E9-9510-7717E6697425","last_name":"Mondelli","first_name":"Marco"},{"full_name":"Montanari, Andrea","last_name":"Montanari","first_name":"Andrea"}],"isi":1,"quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1901.01375"}],"external_id":{"isi":["000598369200021"],"arxiv":["1901.01375"]},"oa":1,"language":[{"iso":"eng"}],"doi":"10.1214/20-AOS1945","publication_identifier":{"issn":["1932-6157"],"eissn":["1941-7330"]},"month":"12"},{"month":"06","day":"04","article_processing_charge":"No","publication_identifier":{"issn":["1660-8933"]},"keyword":["Organic Chemistry","Biochemistry"],"language":[{"iso":"eng"}],"date_published":"2020-06-04T00:00:00Z","doi":"10.4171/owr/2019/23","article_type":"original","quality_controlled":"1","page":"1357-1417","publication":"Oberwolfach Reports","citation":{"mla":"Anderson, Lara, et al. “Geometry and Physics of Higgs Bundles.” Oberwolfach Reports, vol. 16, no. 2, European Mathematical Society, 2020, pp. 1357–417, doi:10.4171/owr/2019/23.","short":"L. Anderson, T. Hausel, R. Mazzeo, L. Schaposnik, Oberwolfach Reports 16 (2020) 1357–1417.","chicago":"Anderson, Lara, Tamás Hausel, Rafe Mazzeo, and Laura Schaposnik. “Geometry and Physics of Higgs Bundles.” Oberwolfach Reports. European Mathematical Society, 2020. https://doi.org/10.4171/owr/2019/23.","ama":"Anderson L, Hausel T, Mazzeo R, Schaposnik L. Geometry and physics of Higgs bundles. Oberwolfach Reports. 2020;16(2):1357-1417. doi:10.4171/owr/2019/23","ista":"Anderson L, Hausel T, Mazzeo R, Schaposnik L. 2020. Geometry and physics of Higgs bundles. Oberwolfach Reports. 16(2), 1357–1417.","ieee":"L. Anderson, T. Hausel, R. Mazzeo, and L. Schaposnik, “Geometry and physics of Higgs bundles,” Oberwolfach Reports, vol. 16, no. 2. European Mathematical Society, pp. 1357–1417, 2020.","apa":"Anderson, L., Hausel, T., Mazzeo, R., & Schaposnik, L. (2020). Geometry and physics of Higgs bundles. Oberwolfach Reports. European Mathematical Society. https://doi.org/10.4171/owr/2019/23"},"abstract":[{"text":"This workshop focused on interactions between the various perspectives on the moduli space of Higgs bundles over a Riemann surface. This subject draws on algebraic geometry, geometric topology, geometric analysis and mathematical physics, and the goal was to promote interactions between these various branches of the subject. The main current directions of research were well represented by the participants, and the talks included many from both senior and junior participants.","lang":"eng"}],"issue":"2","type":"journal_article","date_created":"2024-03-04T11:36:31Z","date_updated":"2024-03-11T09:20:34Z","volume":16,"oa_version":"None","author":[{"full_name":"Anderson, Lara","last_name":"Anderson","first_name":"Lara"},{"full_name":"Hausel, Tamás","id":"4A0666D8-F248-11E8-B48F-1D18A9856A87","first_name":"Tamás","last_name":"Hausel"},{"full_name":"Mazzeo, Rafe","first_name":"Rafe","last_name":"Mazzeo"},{"first_name":"Laura","last_name":"Schaposnik","full_name":"Schaposnik, Laura"}],"status":"public","title":"Geometry and physics of Higgs bundles","publication_status":"published","department":[{"_id":"TaHa"}],"publisher":"European Mathematical Society","intvolume":" 16","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"15070","year":"2020"},{"publication_identifier":{"eissn":["20545703"]},"month":"06","language":[{"iso":"eng"}],"doi":"10.1098/rsos.200599","quality_controlled":"1","isi":1,"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"arxiv":["1910.12042"],"isi":["000545625200001"]},"file_date_updated":"2020-11-09T09:07:11Z","article_number":"200599","volume":7,"date_updated":"2024-03-12T12:31:30Z","date_created":"2020-11-08T23:01:25Z","author":[{"full_name":"Klose, Ann Kristin","first_name":"Ann Kristin","last_name":"Klose"},{"full_name":"Karle, Volker","id":"D7C012AE-D7ED-11E9-95E8-1EC5E5697425","orcid":"0000-0002-6963-0129","first_name":"Volker","last_name":"Karle"},{"full_name":"Winkelmann, Ricarda","last_name":"Winkelmann","first_name":"Ricarda"},{"full_name":"Donges, Jonathan F.","first_name":"Jonathan F.","last_name":"Donges"}],"department":[{"_id":"MiLe"}],"publisher":"The Royal Society","publication_status":"published","year":"2020","acknowledgement":"V.K. thanks the German National Academic Foundation (Studienstiftung des deutschen Volkes) for financial\r\nsupport. J.F.D. is grateful for financial support by the Stordalen Foundation via the Planetary Boundary Research\r\nNetwork (PB.net), the Earth League’s EarthDoc program and the European Research Council Advanced Grant\r\nproject ERA (Earth Resilience in the Anthropocene). We are thankful for support by the Leibniz Association\r\n(project DominoES).\r\nAcknowledgements. This work has been performed in the context of the copan collaboration and the FutureLab on Earth\r\nResilience in the Anthropocene at the Potsdam Institute for Climate Impact Research. Furthermore, we acknowledge\r\ndiscussions with and helpful comments by N. Wunderling, J. Heitzig and M. Wiedermann.","article_processing_charge":"No","has_accepted_license":"1","day":"01","scopus_import":"1","date_published":"2020-06-01T00:00:00Z","article_type":"original","citation":{"chicago":"Klose, Ann Kristin, Volker Karle, Ricarda Winkelmann, and Jonathan F. Donges. “Emergence of Cascading Dynamics in Interacting Tipping Elements of Ecology and Climate: Cascading Dynamics in Tipping Elements.” Royal Society Open Science. The Royal Society, 2020. https://doi.org/10.1098/rsos.200599.","mla":"Klose, Ann Kristin, et al. “Emergence of Cascading Dynamics in Interacting Tipping Elements of Ecology and Climate: Cascading Dynamics in Tipping Elements.” Royal Society Open Science, vol. 7, no. 6, 200599, The Royal Society, 2020, doi:10.1098/rsos.200599.","short":"A.K. Klose, V. Karle, R. Winkelmann, J.F. Donges, Royal Society Open Science 7 (2020).","ista":"Klose AK, Karle V, Winkelmann R, Donges JF. 2020. Emergence of cascading dynamics in interacting tipping elements of ecology and climate: Cascading dynamics in tipping elements. Royal Society Open Science. 7(6), 200599.","apa":"Klose, A. K., Karle, V., Winkelmann, R., & Donges, J. F. (2020). Emergence of cascading dynamics in interacting tipping elements of ecology and climate: Cascading dynamics in tipping elements. Royal Society Open Science. The Royal Society. https://doi.org/10.1098/rsos.200599","ieee":"A. K. Klose, V. Karle, R. Winkelmann, and J. F. Donges, “Emergence of cascading dynamics in interacting tipping elements of ecology and climate: Cascading dynamics in tipping elements,” Royal Society Open Science, vol. 7, no. 6. The Royal Society, 2020.","ama":"Klose AK, Karle V, Winkelmann R, Donges JF. Emergence of cascading dynamics in interacting tipping elements of ecology and climate: Cascading dynamics in tipping elements. Royal Society Open Science. 2020;7(6). doi:10.1098/rsos.200599"},"publication":"Royal Society Open Science","issue":"6","abstract":[{"text":"In ecology, climate and other fields, (sub)systems have been identified that can transition into a qualitatively different state when a critical threshold or tipping point in a driving process is crossed. An understanding of those tipping elements is of great interest given the increasing influence of humans on the biophysical Earth system. Complex interactions exist between tipping elements, e.g. physical mechanisms connect subsystems of the climate system. Based on earlier work on such coupled nonlinear systems, we systematically assessed the qualitative long-term behaviour of interacting tipping elements. We developed an understanding of the consequences of interactions\r\non the tipping behaviour allowing for tipping cascades to emerge under certain conditions. The (narrative) application of\r\nthese qualitative results to real-world examples of interacting tipping elements indicates that tipping cascades with profound consequences may occur: the interacting Greenland ice sheet and thermohaline ocean circulation might tip before the tipping points of the isolated subsystems are crossed. The eutrophication of the first lake in a lake chain might propagate through the following lakes without a crossing of their individual critical nutrient input levels. The possibility of emerging cascading tipping dynamics calls for the development of a unified theory of interacting tipping elements and the quantitative analysis of interacting real-world tipping elements.","lang":"eng"}],"type":"journal_article","oa_version":"Published Version","file":[{"access_level":"open_access","file_name":"2020_RoyalSocOpenScience_Klose.pdf","creator":"dernst","file_size":1611485,"content_type":"application/pdf","file_id":"8748","relation":"main_file","success":1,"checksum":"5505c445de373bfd836eb4d3b48b1f37","date_created":"2020-11-09T09:07:11Z","date_updated":"2020-11-09T09:07:11Z"}],"intvolume":" 7","title":"Emergence of cascading dynamics in interacting tipping elements of ecology and climate: Cascading dynamics in tipping elements","status":"public","ddc":["530","550"],"_id":"8741","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"file_date_updated":"2024-03-12T10:12:33Z","publication_status":"published","department":[{"_id":"E-Lib"}],"publisher":"Vereinigung Osterreichischer Bibliothekarinnen und Bibliothekare","year":"2020","date_created":"2020-04-28T08:37:38Z","date_updated":"2024-03-12T10:12:33Z","volume":73,"author":[{"last_name":"Ernst","first_name":"Doris","orcid":"0000-0002-2354-0195","id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","full_name":"Ernst, Doris"},{"full_name":"Novotny, Gertraud","first_name":"Gertraud","last_name":"Novotny"},{"last_name":"Schönher","first_name":"Eva Maria","full_name":"Schönher, Eva Maria"}],"month":"04","publication_identifier":{"issn":["1022-2588"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"language":[{"iso":"ger"}],"doi":"10.31263/voebm.v73i1.3491","type":"journal_article","abstract":[{"text":"A working group, which was established within the Network of Repository Managers (RepManNet), has dealt with common certifications for repositories. In addition, current requirements of the research funding agencies FWF and EU were also taken into account. The Core Trust Seal was examined in more detail. For this purpose, a questionnaire was sent to those organizations that are already certified with CTS in Austria. The answers were summarized and evaluated anonymously. It is recommended to go for a repository certification. Moreover, the development of a DINI certificate in Austria is strongly suggested.","lang":"eng"},{"text":" Eine Arbeitsgruppe, die im Rahmen des Netzwerks für RepositorienmanagerInnen (RepManNet) entstanden ist, hat sich mit gängigen Zertifizierungen für Repositorien beschäftigt. Weiters wurden aktuelle Vorgaben der Forschungsförderer FWF und EU herangezogen. Das Core Trust Seal wurde genauer betrachtet. Hierfür wurden jenen Organisationen, die in Österreich bereits mit CTS zertifiziert sind, ein Fragebogen übermittelt. Die Antworten wurden anonymisiert zusammengefasst und ausgewertet. Plädiert wird für eine Zertifizierung von Repositorien und die Entwicklung einer DINI-Zertifizierung in Österreich.","lang":"ger"}],"issue":"1","status":"public","ddc":["020"],"title":"(Core Trust) Seal your repository!","intvolume":" 73","_id":"7687","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"file_id":"7970","relation":"main_file","checksum":"fee784f15a489deb7def6ccf8c5bf8c3","date_updated":"2024-03-12T10:12:33Z","date_created":"2020-06-17T10:50:13Z","access_level":"open_access","file_name":"2020_VOEB_Ernst.pdf","creator":"dernst","file_size":579291,"content_type":"application/pdf"}],"oa_version":"Published Version","popular_science":"1","scopus_import":"1","day":"28","article_processing_charge":"No","has_accepted_license":"1","article_type":"original","page":"46-59","publication":"Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare","citation":{"short":"D. Ernst, G. Novotny, E.M. Schönher, Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare 73 (2020) 46–59.","mla":"Ernst, Doris, et al. “(Core Trust) Seal your repository!” Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, vol. 73, no. 1, Vereinigung Osterreichischer Bibliothekarinnen und Bibliothekare, 2020, pp. 46–59, doi:10.31263/voebm.v73i1.3491.","chicago":"Ernst, Doris, Gertraud Novotny, and Eva Maria Schönher. “(Core Trust) Seal your repository!” Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare. Vereinigung Osterreichischer Bibliothekarinnen und Bibliothekare, 2020. https://doi.org/10.31263/voebm.v73i1.3491.","ama":"Ernst D, Novotny G, Schönher EM. (Core Trust) Seal your repository! Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare. 2020;73(1):46-59. doi:10.31263/voebm.v73i1.3491","ieee":"D. Ernst, G. Novotny, and E. M. Schönher, “(Core Trust) Seal your repository!,” Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, vol. 73, no. 1. Vereinigung Osterreichischer Bibliothekarinnen und Bibliothekare, pp. 46–59, 2020.","apa":"Ernst, D., Novotny, G., & Schönher, E. M. (2020). (Core Trust) Seal your repository! Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare. Vereinigung Osterreichischer Bibliothekarinnen und Bibliothekare. https://doi.org/10.31263/voebm.v73i1.3491","ista":"Ernst D, Novotny G, Schönher EM. 2020. (Core Trust) Seal your repository! Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare. 73(1), 46–59."},"date_published":"2020-04-28T00:00:00Z"},{"_id":"15079","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2020","publication_status":"published","title":"Random matrices","status":"public","publisher":"European Mathematical Society","intvolume":" 16","department":[{"_id":"LaEr"}],"author":[{"last_name":"Erdös","first_name":"László","orcid":"0000-0001-5366-9603","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","full_name":"Erdös, László"},{"first_name":"Friedrich","last_name":"Götze","full_name":"Götze, Friedrich"},{"first_name":"Alice","last_name":"Guionnet","full_name":"Guionnet, Alice"}],"date_created":"2024-03-05T07:54:44Z","date_updated":"2024-03-12T12:25:18Z","oa_version":"None","volume":16,"type":"journal_article","abstract":[{"lang":"eng","text":"Large complex systems tend to develop universal patterns that often represent their essential characteristics. For example, the cumulative effects of independent or weakly dependent random variables often yield the Gaussian universality class via the central limit theorem. For non-commutative random variables, e.g. matrices, the Gaussian behavior is often replaced by another universality class, commonly called random matrix statistics. Nearby eigenvalues are strongly correlated, and, remarkably, their correlation structure is universal, depending only on the symmetry type of the matrix. Even more surprisingly, this feature is not restricted to matrices; in fact Eugene Wigner, the pioneer of the field, discovered in the 1950s that distributions of the gaps between energy levels of complicated quantum systems universally follow the same random matrix statistics. This claim has never been rigorously proved for any realistic physical system but experimental data and extensive numerics leave no doubt as to its correctness. Since then random matrices have proved to be extremely useful phenomenological models in a wide range of applications beyond quantum physics that include number theory, statistics, neuroscience, population dynamics, wireless communication and mathematical finance. The ubiquity of random matrices in natural sciences is still a mystery, but recent years have witnessed a breakthrough in the mathematical description of the statistical structure of their spectrum. Random matrices and closely related areas such as log-gases have become an extremely active research area in probability theory.\r\nThis workshop brought together outstanding researchers from a variety of mathematical backgrounds whose areas of research are linked to random matrices. While there are strong links between their motivations, the techniques used by these researchers span a large swath of mathematics, ranging from purely algebraic techniques to stochastic analysis, classical probability theory, operator algebra, supersymmetry, orthogonal polynomials, etc."}],"issue":"4","publication":"Oberwolfach Reports","citation":{"ama":"Erdös L, Götze F, Guionnet A. Random matrices. Oberwolfach Reports. 2020;16(4):3459-3527. doi:10.4171/owr/2019/56","ieee":"L. Erdös, F. Götze, and A. Guionnet, “Random matrices,” Oberwolfach Reports, vol. 16, no. 4. European Mathematical Society, pp. 3459–3527, 2020.","apa":"Erdös, L., Götze, F., & Guionnet, A. (2020). Random matrices. Oberwolfach Reports. European Mathematical Society. https://doi.org/10.4171/owr/2019/56","ista":"Erdös L, Götze F, Guionnet A. 2020. Random matrices. Oberwolfach Reports. 16(4), 3459–3527.","short":"L. Erdös, F. Götze, A. Guionnet, Oberwolfach Reports 16 (2020) 3459–3527.","mla":"Erdös, László, et al. “Random Matrices.” Oberwolfach Reports, vol. 16, no. 4, European Mathematical Society, 2020, pp. 3459–527, doi:10.4171/owr/2019/56.","chicago":"Erdös, László, Friedrich Götze, and Alice Guionnet. “Random Matrices.” Oberwolfach Reports. European Mathematical Society, 2020. https://doi.org/10.4171/owr/2019/56."},"quality_controlled":"1","article_type":"original","page":"3459-3527","doi":"10.4171/owr/2019/56","date_published":"2020-11-19T00:00:00Z","language":[{"iso":"eng"}],"day":"19","month":"11","article_processing_charge":"No","publication_identifier":{"issn":["1660-8933"]}},{"day":"10","month":"09","publication_identifier":{"issn":["1660-8933"]},"article_processing_charge":"No","language":[{"iso":"eng"}],"date_published":"2020-09-10T00:00:00Z","doi":"10.4171/owr/2019/41","article_type":"original","quality_controlled":"1","page":"2541-2603","publication":"Oberwolfach Reports","citation":{"ama":"Hainzl C, Schlein B, Seiringer R, Warzel S. Many-body quantum systems. Oberwolfach Reports. 2020;16(3):2541-2603. doi:10.4171/owr/2019/41","apa":"Hainzl, C., Schlein, B., Seiringer, R., & Warzel, S. (2020). Many-body quantum systems. Oberwolfach Reports. European Mathematical Society. https://doi.org/10.4171/owr/2019/41","ieee":"C. Hainzl, B. Schlein, R. Seiringer, and S. Warzel, “Many-body quantum systems,” Oberwolfach Reports, vol. 16, no. 3. European Mathematical Society, pp. 2541–2603, 2020.","ista":"Hainzl C, Schlein B, Seiringer R, Warzel S. 2020. Many-body quantum systems. Oberwolfach Reports. 16(3), 2541–2603.","short":"C. Hainzl, B. Schlein, R. Seiringer, S. Warzel, Oberwolfach Reports 16 (2020) 2541–2603.","mla":"Hainzl, Christian, et al. “Many-Body Quantum Systems.” Oberwolfach Reports, vol. 16, no. 3, European Mathematical Society, 2020, pp. 2541–603, doi:10.4171/owr/2019/41.","chicago":"Hainzl, Christian, Benjamin Schlein, Robert Seiringer, and Simone Warzel. “Many-Body Quantum Systems.” Oberwolfach Reports. European Mathematical Society, 2020. https://doi.org/10.4171/owr/2019/41."},"abstract":[{"text":"The interaction among fundamental particles in nature leads to many interesting effects in quantum statistical mechanics; examples include superconductivity for charged systems and superfluidity in cold gases. It is a huge challenge for mathematical physics to understand the collective behavior of systems containing a large number of particles, emerging from known microscopic interactions. In this workshop we brought together researchers working on different aspects of many-body quantum mechanics to discuss recent developments, exchange ideas and propose new challenges and research directions.","lang":"eng"}],"issue":"3","type":"journal_article","date_updated":"2024-03-12T12:02:00Z","date_created":"2024-03-04T11:46:12Z","oa_version":"None","volume":16,"author":[{"full_name":"Hainzl, Christian","last_name":"Hainzl","first_name":"Christian"},{"first_name":"Benjamin","last_name":"Schlein","full_name":"Schlein, Benjamin"},{"full_name":"Seiringer, Robert","last_name":"Seiringer","first_name":"Robert","orcid":"0000-0002-6781-0521","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Warzel, Simone","first_name":"Simone","last_name":"Warzel"}],"title":"Many-body quantum systems","status":"public","publication_status":"published","intvolume":" 16","publisher":"European Mathematical Society","department":[{"_id":"RoSe"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"15072","year":"2020"},{"status":"public","title":"Characterization of methanosarcina mazei JL01 isolated from holocene arctic permafrost and study of the archaeon cooperation with bacterium Sphaerochaeta associata GLS2T","ddc":["570"],"_id":"15071","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"date_updated":"2024-03-20T08:05:46Z","date_created":"2024-03-20T08:05:46Z","success":1,"checksum":"d1914af7811a21a4b2744eb51b5834e3","file_id":"15127","relation":"main_file","creator":"dernst","content_type":"application/pdf","file_size":595543,"file_name":"2020_ECM_Oshurkova.pdf","access_level":"open_access"}],"oa_version":"Published Version","type":"conference","abstract":[{"lang":"eng","text":"A mesophilic methanogenic culture, designated JL01, was isolated from Holocene permafrost in the Russian Arctic [1]. After long-term extensive cultivation at 15°C it turned out to be a tied binary culture of archaeal (JL01) and bacterial (Sphaerochaeta associata GLS2) strains.\r\nStrain JL01 was a strict anaerobe and grew on methanol, acetate and methylamines as energy and carbon sources. Cells were irregular coccoid, non-motile, non-spore-forming, and Gram-stainpositive. Optimum conditions for growth were 24-28 oC, pH 6.8–7.3 and 0.075-0.1 M NaCl.\r\nPhylogenetic tree reconstructions based on 16S rRNA and concatenated alignment of broadly\r\nconserved protein-coding genes revealed its close relation to Methanosarcina mazei S-6\r\nT (similarity 99.5%). The comparison of whole genomic sequences (ANI) of the isolate and the type strain of M.mazei was 98.5%, which is higher than the values recommended for new species. Thus strain JL01 (=VKM B-2370=JCM 31898) represents the first M. mazei isolated from permanently subzero Arcticsediments. The long-term co-cultivation of JL01 with S. associata GLS2T showed the methane production without any additional carbon and energy sources. Genome analysis of S. associata GLS2T revealed putative genes involved in methanochondroithin catabolism."}],"publication":"Proceedings of 1st International Electronic Conference on Microbiology","citation":{"ieee":"V. Oshurkova, O. Troshina, V. Trubitsyn, Y. Ryzhmanova, O. Bochkareva, and V. Shcherbakova, “Characterization of methanosarcina mazei JL01 isolated from holocene arctic permafrost and study of the archaeon cooperation with bacterium Sphaerochaeta associata GLS2T,” in Proceedings of 1st International Electronic Conference on Microbiology, Virtual, 2020.","apa":"Oshurkova, V., Troshina, O., Trubitsyn, V., Ryzhmanova, Y., Bochkareva, O., & Shcherbakova, V. (2020). Characterization of methanosarcina mazei JL01 isolated from holocene arctic permafrost and study of the archaeon cooperation with bacterium Sphaerochaeta associata GLS2T. In Proceedings of 1st International Electronic Conference on Microbiology. Virtual: MDPI. https://doi.org/10.3390/ecm2020-07116","ista":"Oshurkova V, Troshina O, Trubitsyn V, Ryzhmanova Y, Bochkareva O, Shcherbakova V. 2020. Characterization of methanosarcina mazei JL01 isolated from holocene arctic permafrost and study of the archaeon cooperation with bacterium Sphaerochaeta associata GLS2T. Proceedings of 1st International Electronic Conference on Microbiology. ECM: Electronic Conference on Microbiology.","ama":"Oshurkova V, Troshina O, Trubitsyn V, Ryzhmanova Y, Bochkareva O, Shcherbakova V. Characterization of methanosarcina mazei JL01 isolated from holocene arctic permafrost and study of the archaeon cooperation with bacterium Sphaerochaeta associata GLS2T. In: Proceedings of 1st International Electronic Conference on Microbiology. MDPI; 2020. doi:10.3390/ecm2020-07116","chicago":"Oshurkova, Viktoriia, Olga Troshina, Vladimir Trubitsyn, Yana Ryzhmanova, Olga Bochkareva, and Viktoria Shcherbakova. “Characterization of Methanosarcina Mazei JL01 Isolated from Holocene Arctic Permafrost and Study of the Archaeon Cooperation with Bacterium Sphaerochaeta Associata GLS2T.” In Proceedings of 1st International Electronic Conference on Microbiology. MDPI, 2020. https://doi.org/10.3390/ecm2020-07116.","short":"V. Oshurkova, O. Troshina, V. Trubitsyn, Y. Ryzhmanova, O. Bochkareva, V. Shcherbakova, in:, Proceedings of 1st International Electronic Conference on Microbiology, MDPI, 2020.","mla":"Oshurkova, Viktoriia, et al. “Characterization of Methanosarcina Mazei JL01 Isolated from Holocene Arctic Permafrost and Study of the Archaeon Cooperation with Bacterium Sphaerochaeta Associata GLS2T.” Proceedings of 1st International Electronic Conference on Microbiology, MDPI, 2020, doi:10.3390/ecm2020-07116."},"date_published":"2020-11-02T00:00:00Z","day":"02","article_processing_charge":"Yes","has_accepted_license":"1","publication_status":"published","department":[{"_id":"FyKo"}],"publisher":"MDPI","acknowledgement":"The work was supported by of Russian Foundation of Basic Research: grant № 19-04-00831 for Viktoria Shcherbakova and Olga Troshina, grant № 18-34-00334 for Viktoriia Oshurkova and Vladimir Trubitsyn. \r\nWe thank Dr Natalia Suzina (IBPM RAS, Federal Research Center Pushchino Center for\r\nBiological Research RAS) for the help with the microscopic studies, respectively; Dr. Margarita Meyer (Division of Genetics, Department of Medicine, BWH and HMS, USA) and Dr Fedor Kondrashov (IST, Austria) for their help in obtaining the genomic sequence of strain JL01. ","year":"2020","date_created":"2024-03-04T11:41:31Z","date_updated":"2024-03-20T08:06:22Z","author":[{"full_name":"Oshurkova, Viktoriia","first_name":"Viktoriia","last_name":"Oshurkova"},{"full_name":"Troshina, Olga","first_name":"Olga","last_name":"Troshina"},{"first_name":"Vladimir","last_name":"Trubitsyn","full_name":"Trubitsyn, Vladimir"},{"full_name":"Ryzhmanova, Yana","last_name":"Ryzhmanova","first_name":"Yana"},{"last_name":"Bochkareva","first_name":"Olga","orcid":"0000-0003-1006-6639","id":"C4558D3C-6102-11E9-A62E-F418E6697425","full_name":"Bochkareva, Olga"},{"full_name":"Shcherbakova, Viktoria","last_name":"Shcherbakova","first_name":"Viktoria"}],"file_date_updated":"2024-03-20T08:05:46Z","quality_controlled":"1","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"language":[{"iso":"eng"}],"conference":{"start_date":"2020-11-02","location":"Virtual","end_date":"2020-11-30","name":"ECM: Electronic Conference on Microbiology"},"doi":"10.3390/ecm2020-07116","month":"11"},{"year":"2020","publisher":"eLife Sciences Publications","publication_status":"published","author":[{"full_name":"Fribourgh, Jennifer L","first_name":"Jennifer L","last_name":"Fribourgh"},{"full_name":"Srivastava, Ashutosh","first_name":"Ashutosh","last_name":"Srivastava"},{"full_name":"Sandate, Colby R","last_name":"Sandate","first_name":"Colby R"},{"full_name":"Michael, Alicia Kathleen","last_name":"Michael","first_name":"Alicia Kathleen","id":"6437c950-2a03-11ee-914d-d6476dd7b75c"},{"full_name":"Hsu, Peter L","last_name":"Hsu","first_name":"Peter L"},{"full_name":"Rakers, Christin","first_name":"Christin","last_name":"Rakers"},{"full_name":"Nguyen, Leslee T","last_name":"Nguyen","first_name":"Leslee T"},{"full_name":"Torgrimson, Megan R","first_name":"Megan R","last_name":"Torgrimson"},{"full_name":"Parico, Gian Carlo G","last_name":"Parico","first_name":"Gian Carlo G"},{"last_name":"Tripathi","first_name":"Sarvind","full_name":"Tripathi, Sarvind"},{"full_name":"Zheng, Ning","last_name":"Zheng","first_name":"Ning"},{"last_name":"Lander","first_name":"Gabriel C","full_name":"Lander, Gabriel C"},{"full_name":"Hirota, Tsuyoshi","last_name":"Hirota","first_name":"Tsuyoshi"},{"full_name":"Tama, Florence","first_name":"Florence","last_name":"Tama"},{"last_name":"Partch","first_name":"Carrie L","full_name":"Partch, Carrie L"}],"volume":9,"date_updated":"2024-03-25T12:25:02Z","date_created":"2024-03-21T07:55:12Z","article_number":"55275","extern":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.7554/eLife.55275"}],"oa":1,"quality_controlled":"1","doi":"10.7554/elife.55275","language":[{"iso":"eng"}],"publication_identifier":{"issn":["2050-084X"]},"month":"02","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"15153","intvolume":" 9","status":"public","title":"Dynamics at the serine loop underlie differential affinity of cryptochromes for CLOCK:BMAL1 to control circadian timing","oa_version":"Published Version","type":"journal_article","abstract":[{"text":"Mammalian circadian rhythms are generated by a transcription-based feedback loop in which CLOCK:BMAL1 drives transcription of its repressors (PER1/2, CRY1/2), which ultimately interact with CLOCK:BMAL1 to close the feedback loop with ~24 hr periodicity. Here we pinpoint a key difference between CRY1 and CRY2 that underlies their differential strengths as transcriptional repressors. Both cryptochromes bind the BMAL1 transactivation domain similarly to sequester it from coactivators and repress CLOCK:BMAL1 activity. However, we find that CRY1 is recruited with much higher affinity to the PAS domain core of CLOCK:BMAL1, allowing it to serve as a stronger repressor that lengthens circadian period. We discovered a dynamic serine-rich loop adjacent to the secondary pocket in the photolyase homology region (PHR) domain that regulates differential binding of cryptochromes to the PAS domain core of CLOCK:BMAL1. Notably, binding of the co-repressor PER2 remodels the serine loop of CRY2, making it more CRY1-like and enhancing its affinity for CLOCK:BMAL1.","lang":"eng"}],"citation":{"ista":"Fribourgh JL, Srivastava A, Sandate CR, Michael AK, Hsu PL, Rakers C, Nguyen LT, Torgrimson MR, Parico GCG, Tripathi S, Zheng N, Lander GC, Hirota T, Tama F, Partch CL. 2020. Dynamics at the serine loop underlie differential affinity of cryptochromes for CLOCK:BMAL1 to control circadian timing. eLife. 9, 55275.","ieee":"J. L. Fribourgh et al., “Dynamics at the serine loop underlie differential affinity of cryptochromes for CLOCK:BMAL1 to control circadian timing,” eLife, vol. 9. eLife Sciences Publications, 2020.","apa":"Fribourgh, J. L., Srivastava, A., Sandate, C. R., Michael, A. K., Hsu, P. L., Rakers, C., … Partch, C. L. (2020). Dynamics at the serine loop underlie differential affinity of cryptochromes for CLOCK:BMAL1 to control circadian timing. ELife. eLife Sciences Publications. https://doi.org/10.7554/elife.55275","ama":"Fribourgh JL, Srivastava A, Sandate CR, et al. Dynamics at the serine loop underlie differential affinity of cryptochromes for CLOCK:BMAL1 to control circadian timing. eLife. 2020;9. doi:10.7554/elife.55275","chicago":"Fribourgh, Jennifer L, Ashutosh Srivastava, Colby R Sandate, Alicia K. Michael, Peter L Hsu, Christin Rakers, Leslee T Nguyen, et al. “Dynamics at the Serine Loop Underlie Differential Affinity of Cryptochromes for CLOCK:BMAL1 to Control Circadian Timing.” ELife. eLife Sciences Publications, 2020. https://doi.org/10.7554/elife.55275.","mla":"Fribourgh, Jennifer L., et al. “Dynamics at the Serine Loop Underlie Differential Affinity of Cryptochromes for CLOCK:BMAL1 to Control Circadian Timing.” ELife, vol. 9, 55275, eLife Sciences Publications, 2020, doi:10.7554/elife.55275.","short":"J.L. Fribourgh, A. Srivastava, C.R. Sandate, A.K. Michael, P.L. Hsu, C. Rakers, L.T. Nguyen, M.R. Torgrimson, G.C.G. Parico, S. Tripathi, N. Zheng, G.C. Lander, T. Hirota, F. Tama, C.L. Partch, ELife 9 (2020)."},"publication":"eLife","article_type":"original","date_published":"2020-02-26T00:00:00Z","scopus_import":"1","keyword":["General Immunology and Microbiology","General Biochemistry","Genetics and Molecular Biology","General Medicine","General Neuroscience"],"article_processing_charge":"No","day":"26"},{"author":[{"full_name":"Michael, Alicia Kathleen","id":"6437c950-2a03-11ee-914d-d6476dd7b75c","orcid":"0000-0002-6080-839X","first_name":"Alicia Kathleen","last_name":"Michael"},{"full_name":"Grand, Ralph S.","first_name":"Ralph S.","last_name":"Grand"},{"full_name":"Isbel, Luke","last_name":"Isbel","first_name":"Luke"},{"last_name":"Cavadini","first_name":"Simone","full_name":"Cavadini, Simone"},{"full_name":"Kozicka, Zuzanna","first_name":"Zuzanna","last_name":"Kozicka"},{"full_name":"Kempf, Georg","first_name":"Georg","last_name":"Kempf"},{"full_name":"Bunker, Richard D.","last_name":"Bunker","first_name":"Richard D."},{"first_name":"Andreas D.","last_name":"Schenk","full_name":"Schenk, Andreas D."},{"last_name":"Graff-Meyer","first_name":"Alexandra","full_name":"Graff-Meyer, Alexandra"},{"full_name":"Pathare, Ganesh R.","last_name":"Pathare","first_name":"Ganesh R."},{"first_name":"Joscha","last_name":"Weiss","full_name":"Weiss, Joscha"},{"full_name":"Matsumoto, Syota","last_name":"Matsumoto","first_name":"Syota"},{"first_name":"Lukas","last_name":"Burger","full_name":"Burger, Lukas"},{"first_name":"Dirk","last_name":"Schübeler","full_name":"Schübeler, Dirk"},{"first_name":"Nicolas H.","last_name":"Thomä","full_name":"Thomä, Nicolas H."}],"volume":368,"oa_version":"None","date_updated":"2024-03-25T12:29:34Z","date_created":"2024-03-21T07:54:44Z","_id":"15152","year":"2020","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 368","publisher":"American Association for the Advancement of Science ","status":"public","publication_status":"published","title":"Mechanisms of OCT4-SOX2 motif readout on nucleosomes","issue":"6498","abstract":[{"lang":"eng","text":"Transcription factors (TFs) regulate gene expression through chromatin where nucleosomes restrict DNA access. To study how TFs bind nucleosome-occupied motifs, we focused on the reprogramming factors OCT4 and SOX2 in mouse embryonic stem cells. We determined TF engagement throughout a nucleosome at base-pair resolution in vitro, enabling structure determination by cryo–electron microscopy at two preferred positions. Depending on motif location, OCT4 and SOX2 differentially distort nucleosomal DNA. At one position, OCT4-SOX2 removes DNA from histone H2A and histone H3; however, at an inverted motif, the TFs only induce local DNA distortions. OCT4 uses one of its two DNA-binding domains to engage DNA in both structures, reading out a partial motif. These findings explain site-specific nucleosome engagement by the pluripotency factors OCT4 and SOX2, and they reveal how TFs distort nucleosomes to access chromatinized motifs."}],"extern":"1","type":"journal_article","doi":"10.1126/science.abb0074","date_published":"2020-04-23T00:00:00Z","language":[{"iso":"eng"}],"citation":{"short":"A.K. Michael, R.S. Grand, L. Isbel, S. Cavadini, Z. Kozicka, G. Kempf, R.D. Bunker, A.D. Schenk, A. Graff-Meyer, G.R. Pathare, J. Weiss, S. Matsumoto, L. Burger, D. Schübeler, N.H. Thomä, Science 368 (2020) 1460–1465.","mla":"Michael, Alicia K., et al. “Mechanisms of OCT4-SOX2 Motif Readout on Nucleosomes.” Science, vol. 368, no. 6498, American Association for the Advancement of Science , 2020, pp. 1460–65, doi:10.1126/science.abb0074.","chicago":"Michael, Alicia K., Ralph S. Grand, Luke Isbel, Simone Cavadini, Zuzanna Kozicka, Georg Kempf, Richard D. Bunker, et al. “Mechanisms of OCT4-SOX2 Motif Readout on Nucleosomes.” Science. American Association for the Advancement of Science , 2020. https://doi.org/10.1126/science.abb0074.","ama":"Michael AK, Grand RS, Isbel L, et al. Mechanisms of OCT4-SOX2 motif readout on nucleosomes. Science. 2020;368(6498):1460-1465. doi:10.1126/science.abb0074","apa":"Michael, A. K., Grand, R. S., Isbel, L., Cavadini, S., Kozicka, Z., Kempf, G., … Thomä, N. H. (2020). Mechanisms of OCT4-SOX2 motif readout on nucleosomes. Science. American Association for the Advancement of Science . https://doi.org/10.1126/science.abb0074","ieee":"A. K. Michael et al., “Mechanisms of OCT4-SOX2 motif readout on nucleosomes,” Science, vol. 368, no. 6498. American Association for the Advancement of Science , pp. 1460–1465, 2020.","ista":"Michael AK, Grand RS, Isbel L, Cavadini S, Kozicka Z, Kempf G, Bunker RD, Schenk AD, Graff-Meyer A, Pathare GR, Weiss J, Matsumoto S, Burger L, Schübeler D, Thomä NH. 2020. Mechanisms of OCT4-SOX2 motif readout on nucleosomes. Science. 368(6498), 1460–1465."},"publication":"Science","page":"1460-1465","article_type":"original","quality_controlled":"1","publication_identifier":{"eissn":["1095-9203"],"issn":["0036-8075"]},"article_processing_charge":"No","month":"04","day":"23","scopus_import":"1"},{"file":[{"creator":"pbhandari","file_size":9646346,"content_type":"application/pdf","access_level":"open_access","file_name":"Pradeep Bhandari Thesis.pdf","checksum":"4589234fdb12b4ad72273b311723a7b4","date_updated":"2021-03-01T23:30:04Z","date_created":"2020-02-28T08:37:53Z","file_id":"7538","title":"Localization and functional role of Cav2.3 in the medial habenula to interpeduncular nucleus pathway","embargo":"2021-02-28","relation":"main_file"},{"file_size":35252164,"content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","creator":"pbhandari","embargo_to":"open_access","file_name":"Pradeep Bhandari Thesis.docx","access_level":"closed","date_created":"2020-02-28T08:47:14Z","date_updated":"2021-03-01T23:30:04Z","checksum":"aa79490553ca0a5c9b6fbcd152e93928","relation":"source_file","title":"Localization and functional role of Cav2.3 in the medial habenula to interpeduncular nucleus pathway","file_id":"7539"}],"oa_version":"Published Version","ddc":["570"],"status":"public","title":"Localization and functional role of Cav2.3 in the medial habenula to interpeduncular nucleus pathway","_id":"7525","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","abstract":[{"text":"The medial habenula (MHb) is an evolutionary conserved epithalamic structure important for the modulation of emotional memory. It is involved in regulation of anxiety, compulsive behavior, addiction (nicotinic and opioid), sexual and feeding behavior. MHb receives inputs from septal regions and projects exclusively to the interpeduncular nucleus (IPN). Distinct sub-regions of the septum project to different subnuclei of MHb: the bed nucleus of anterior commissure projects to dorsal MHb and the triangular septum projects to ventral MHb. Furthermore, the dorsal and ventral MHb project to the lateral and rostral/central IPN, respectively. Importantly, these projections have unique features of prominent co-release of different neurotransmitters and requirement of a peculiar type of calcium channel for release. In general, synaptic neurotransmission requires an activity-dependent influx of Ca2+ into the presynaptic terminal through voltage-gated calcium channels. The calcium channel family most commonly involved in neurotransmitter release comprises three members, P/Q-, N- and R-type with Cav2.1, Cav2.2 and Cav2.3 subunits, respectively. In contrast to most CNS synapses that mainly express Cav2.1 and/or Cav2.2, MHb terminals in the IPN exclusively express Cav2.3. In other parts of the brain, such as the hippocampus, Cav2.3 is mostly located to postsynaptic elements. This unusual presynaptic location of Cav2.3 in the MHb-IPN pathway implies unique mechanisms of glutamate release in this pathway. One potential example of such uniqueness is the facilitation of release by GABAB receptor (GBR) activation. Presynaptic GBRs usually inhibit the release of neurotransmitters by inhibiting presynaptic calcium channels. MHb shows the highest expression levels of GBR in the brain. GBRs comprise two subunits, GABAB1 (GB1) and GABAB2 (GB2), and are associated with auxiliary subunits, called potassium channel tetramerization domain containing proteins (KCTD) 8, 12, 12b and 16. Among these four subunits, KCTD12b is exclusively expressed in ventral MHb, and KCTD8 shows the strongest expression in the whole MHb among other brain regions, indicating that KCTD8 and KCTD12b may be involved in the unique mechanisms of neurotransmitter release mediated by Cav2.3 and regulated by GBRs in this pathway. \r\nIn the present study, we first verified that neurotransmission in both dorsal and ventral MHb-IPN pathways is mainly mediated by Cav2.3 using a selective blocker of R-type channels, SNX-482. We next found that baclofen, a GBR agonist, has facilitatory effects on release from ventral MHb terminal in rostral IPN, whereas it has inhibitory effects on release from dorsal MHb terminals in lateral IPN, indicating that KCTD12b expressed exclusively in ventral MHb may have a role in the facilitatory effects of GBR activation. In a heterologous expression system using HEK cells, we found that KCTD8 and KCTD12b but not KCTD12 directly bind with Cav2.3. Pre-embedding immunogold electron microscopy data show that Cav2.3 and KCTD12b are distributed most densely in presynaptic active zone in IPN with KCTD12b being present only in rostral/central but not lateral IPN, whereas GABAB, KCTD8 and KCTD12 are distributed most densely in perisynaptic sites with KCTD12 present more frequently in postsynaptic elements and only in rostral/central IPN. In freeze-fracture replica labelling, Cav2.3, KCTD8 and KCTD12b are co-localized with each other in the same active zone indicating that they may form complexes regulating vesicle release in rostral IPN. \r\nOn electrophysiological studies of wild type (WT) mice, we found that paired-pulse ratio in rostral IPN of KCTD12b knock-out (KO) mice is lower than those of WT and KCTD8 KO mice. Consistent with this finding, in mean variance analysis, release probability in rostral IPN of KCTD12b KO mice is higher than that of WT and KCTD8 KO mice. Although paired-pulse ratios are not different between WT and KCTD8 KO mice, the mean variance analysis revealed significantly lower release probability in rostral IPN of KCTD8 KO than WT mice. These results demonstrate bidirectional regulation of Cav2.3-mediated release by KCTD8 and KCTD12b without GBR activation in rostral IPN. Finally, we examined the baclofen effects in rostral IPN of KCTD8 and KCTD12b KO mice, and found the facilitation of release remained in both KO mice, indicating that the peculiar effects of the GBR activation in this pathway do not depend on the selective expression of these KCTD subunits in ventral MHb. However, we found that presynaptic potentiation of evoked EPSC amplitude by baclofen falls to baseline after washout faster in KCTD12b KO mice than WT, KCTD8 KO and KCTD8/12b double KO mice. This result indicates that KCTD12b is involved in sustained potentiation of vesicle release by GBR activation, whereas KCTD8 is involved in its termination in the absence of KCTD12b. Consistent with these functional findings, replica labelling revealed an increase in density of KCTD8, but not Cav2.3 or GBR at active zone in rostral IPN of KCTD12b KO mice compared with that of WT mice, suggesting that increased association of KCTD8 with Cav2.3 facilitates the release probability and termination of the GBR effect in the absence of KCTD12b.\r\nIn summary, our study provided new insights into the physiological roles of presynaptic Cav2.3, GBRs and their auxiliary subunits KCTDs at an evolutionary conserved neuronal circuit. Future studies will be required to identify the exact molecular mechanism underlying the GBR-mediated presynaptic potentiation on ventral MHb terminals. It remains to be determined whether the prominent presence of presynaptic KCTDs at active zone could exert similar neuromodulatory functions in different pathways of the brain.\r\n","lang":"eng"}],"alternative_title":["ISTA Thesis"],"type":"dissertation","date_published":"2020-02-28T00:00:00Z","page":"79","citation":{"ieee":"P. Bhandari, “Localization and functional role of Cav2.3 in the medial habenula to interpeduncular nucleus pathway,” Institute of Science and Technology Austria, 2020.","apa":"Bhandari, P. (2020). Localization and functional role of Cav2.3 in the medial habenula to interpeduncular nucleus pathway. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:7525","ista":"Bhandari P. 2020. Localization and functional role of Cav2.3 in the medial habenula to interpeduncular nucleus pathway. Institute of Science and Technology Austria.","ama":"Bhandari P. Localization and functional role of Cav2.3 in the medial habenula to interpeduncular nucleus pathway. 2020. doi:10.15479/AT:ISTA:7525","chicago":"Bhandari, Pradeep. “Localization and Functional Role of Cav2.3 in the Medial Habenula to Interpeduncular Nucleus Pathway.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:7525.","short":"P. Bhandari, Localization and Functional Role of Cav2.3 in the Medial Habenula to Interpeduncular Nucleus Pathway, Institute of Science and Technology Austria, 2020.","mla":"Bhandari, Pradeep. Localization and Functional Role of Cav2.3 in the Medial Habenula to Interpeduncular Nucleus Pathway. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:7525."},"day":"28","has_accepted_license":"1","article_processing_charge":"No","keyword":["Cav2.3","medial habenula (MHb)","interpeduncular nucleus (IPN)"],"date_updated":"2023-09-07T13:20:03Z","date_created":"2020-02-26T10:56:37Z","author":[{"first_name":"Pradeep","last_name":"Bhandari","id":"45EDD1BC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0863-4481","full_name":"Bhandari, Pradeep"}],"publication_status":"published","department":[{"_id":"RySh"}],"publisher":"Institute of Science and Technology Austria","year":"2020","file_date_updated":"2021-03-01T23:30:04Z","degree_awarded":"PhD","supervisor":[{"orcid":"0000-0001-8761-9444","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","last_name":"Shigemoto","first_name":"Ryuichi","full_name":"Shigemoto, Ryuichi"}],"acknowledged_ssus":[{"_id":"EM-Fac"}],"language":[{"iso":"eng"}],"doi":"10.15479/AT:ISTA:7525","oa":1,"month":"02","publication_identifier":{"issn":["2663-337X"]}},{"doi":"10.1016/j.jsb.2020.107633","acknowledged_ssus":[{"_id":"ScienComp"},{"_id":"LifeSc"},{"_id":"Bio"},{"_id":"EM-Fac"}],"language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"isi":["000600997800008"]},"oa":1,"quality_controlled":"1","isi":1,"project":[{"name":"Structure and isoform diversity of the Arp2/3 complex","grant_number":"P33367","_id":"9B954C5C-BA93-11EA-9121-9846C619BF3A"},{"_id":"059B463C-7A3F-11EA-A408-12923DDC885E","name":"NÖ-Fonds Preis für die Jungforscherin des Jahres am IST Austria"}],"month":"12","publication_identifier":{"issn":["1047-8477"]},"author":[{"orcid":"0000-0001-7149-769X","id":"404F5528-F248-11E8-B48F-1D18A9856A87","last_name":"Fäßler","first_name":"Florian","full_name":"Fäßler, Florian"},{"full_name":"Zens, Bettina","id":"45FD126C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9561-1239","first_name":"Bettina","last_name":"Zens"},{"first_name":"Robert","last_name":"Hauschild","id":"4E01D6B4-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9843-3522","full_name":"Hauschild, Robert"},{"full_name":"Schur, Florian KM","orcid":"0000-0003-4790-8078","id":"48AD8942-F248-11E8-B48F-1D18A9856A87","last_name":"Schur","first_name":"Florian KM"}],"related_material":{"record":[{"status":"public","relation":"used_in_publication","id":"14592"},{"status":"public","relation":"dissertation_contains","id":"12491"}]},"date_created":"2020-09-29T13:24:06Z","date_updated":"2024-03-28T23:30:05Z","volume":212,"year":"2020","acknowledgement":"This work was supported by the Austrian Science Fund (FWF, P33367) to FKMS. BZ acknowledges support by the Niederösterreich Fond. This research was also supported by the Scientific Service Units (SSU) of IST Austria through resources provided by Scientific Computing (SciComp), the Life Science Facility (LSF), the BioImaging Facility (BIF) and the Electron Microscopy Facility (EMF). We thank Georgi Dimchev (IST Austria) and Sonja Jacob (Vienna Biocenter Core Facilities) for testing our grid holders in different experimental setups and Daniel Gütl and the Kondrashov group (IST Austria) for granting us repeated access to their 3D printers. We also thank Jonna Alanko and the Sixt lab (IST Austria) for providing us HeLa cells, primary BL6 mouse tail fibroblasts, NIH 3T3 fibroblasts and human telomerase immortalised foreskin fibroblasts for our experiments. We are thankful to Ori Avinoam and William Wan for helpful comments on the manuscript and also thank Dorotea Fracchiolla (Art&Science) for illustrating the graphical abstract.","publication_status":"published","department":[{"_id":"FlSc"}],"publisher":"Elsevier","file_date_updated":"2020-12-10T14:01:10Z","article_number":"107633","date_published":"2020-12-01T00:00:00Z","publication":"Journal of Structural Biology","citation":{"chicago":"Fäßler, Florian, Bettina Zens, Robert Hauschild, and Florian KM Schur. “3D Printed Cell Culture Grid Holders for Improved Cellular Specimen Preparation in Cryo-Electron Microscopy.” Journal of Structural Biology. Elsevier, 2020. https://doi.org/10.1016/j.jsb.2020.107633.","mla":"Fäßler, Florian, et al. “3D Printed Cell Culture Grid Holders for Improved Cellular Specimen Preparation in Cryo-Electron Microscopy.” Journal of Structural Biology, vol. 212, no. 3, 107633, Elsevier, 2020, doi:10.1016/j.jsb.2020.107633.","short":"F. Fäßler, B. Zens, R. Hauschild, F.K. Schur, Journal of Structural Biology 212 (2020).","ista":"Fäßler F, Zens B, Hauschild R, Schur FK. 2020. 3D printed cell culture grid holders for improved cellular specimen preparation in cryo-electron microscopy. Journal of Structural Biology. 212(3), 107633.","apa":"Fäßler, F., Zens, B., Hauschild, R., & Schur, F. K. (2020). 3D printed cell culture grid holders for improved cellular specimen preparation in cryo-electron microscopy. Journal of Structural Biology. Elsevier. https://doi.org/10.1016/j.jsb.2020.107633","ieee":"F. Fäßler, B. Zens, R. Hauschild, and F. K. Schur, “3D printed cell culture grid holders for improved cellular specimen preparation in cryo-electron microscopy,” Journal of Structural Biology, vol. 212, no. 3. Elsevier, 2020.","ama":"Fäßler F, Zens B, Hauschild R, Schur FK. 3D printed cell culture grid holders for improved cellular specimen preparation in cryo-electron microscopy. Journal of Structural Biology. 2020;212(3). doi:10.1016/j.jsb.2020.107633"},"article_type":"original","day":"01","article_processing_charge":"Yes (via OA deal)","has_accepted_license":"1","scopus_import":"1","keyword":["electron microscopy","cryo-EM","EM sample preparation","3D printing","cell culture"],"file":[{"relation":"main_file","file_id":"8937","checksum":"c48cbf594e84fc2f91966ffaafc0918c","success":1,"date_created":"2020-12-10T14:01:10Z","date_updated":"2020-12-10T14:01:10Z","access_level":"open_access","file_name":"2020_JourStrucBiology_Faessler.pdf","file_size":7076870,"content_type":"application/pdf","creator":"dernst"}],"oa_version":"Published Version","_id":"8586","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","title":"3D printed cell culture grid holders for improved cellular specimen preparation in cryo-electron microscopy","ddc":["570"],"status":"public","intvolume":" 212","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"}],"issue":"3","type":"journal_article"},{"publication_identifier":{"isbn":["978-3-99078-011-4"],"issn":["2663-337X"]},"month":"10","oa":1,"doi":"10.15479/AT:ISTA:8657","language":[{"iso":"eng"}],"acknowledged_ssus":[{"_id":"LifeSc"},{"_id":"M-Shop"}],"supervisor":[{"last_name":"Tkačik","first_name":"Gašper","orcid":"0000-0002-6699-1455","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","full_name":"Tkačik, Gašper"},{"full_name":"Bollenbach, Mark Tobias","first_name":"Mark Tobias","last_name":"Bollenbach","id":"3E6DB97A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4398-476X"}],"degree_awarded":"PhD","file_date_updated":"2021-10-07T22:30:03Z","acknowledgement":"I thank Life Science Facilities for their continuous support with providing top-notch laboratory materials, keeping the devices humming, and coordinating the repairs and building of custom-designed laboratory equipment with the MIBA Machine shop.","year":"2020","publisher":"Institute of Science and Technology Austria","department":[{"_id":"GaTk"}],"publication_status":"published","related_material":{"record":[{"id":"7673","status":"public","relation":"part_of_dissertation"},{"id":"8250","relation":"part_of_dissertation","status":"public"}]},"author":[{"first_name":"Bor","last_name":"Kavcic","id":"350F91D2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6041-254X","full_name":"Kavcic, Bor"}],"date_updated":"2023-09-07T13:20:48Z","date_created":"2020-10-13T16:46:14Z","has_accepted_license":"1","article_processing_charge":"No","day":"14","citation":{"chicago":"Kavcic, Bor. “Perturbations of Protein Synthesis: From Antibiotics to Genetics and Physiology.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:8657.","short":"B. Kavcic, Perturbations of Protein Synthesis: From Antibiotics to Genetics and Physiology, Institute of Science and Technology Austria, 2020.","mla":"Kavcic, Bor. Perturbations of Protein Synthesis: From Antibiotics to Genetics and Physiology. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:8657.","apa":"Kavcic, B. (2020). Perturbations of protein synthesis: from antibiotics to genetics and physiology. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:8657","ieee":"B. Kavcic, “Perturbations of protein synthesis: from antibiotics to genetics and physiology,” Institute of Science and Technology Austria, 2020.","ista":"Kavcic B. 2020. Perturbations of protein synthesis: from antibiotics to genetics and physiology. Institute of Science and Technology Austria.","ama":"Kavcic B. Perturbations of protein synthesis: from antibiotics to genetics and physiology. 2020. doi:10.15479/AT:ISTA:8657"},"page":"271","date_published":"2020-10-14T00:00:00Z","type":"dissertation","alternative_title":["ISTA Thesis"],"abstract":[{"text":"Synthesis of proteins – translation – is a fundamental process of life. Quantitative studies anchor translation into the context of bacterial physiology and reveal several mathematical relationships, called “growth laws,” which capture physiological feedbacks between protein synthesis and cell growth. Growth laws describe the dependency of the ribosome abundance as a function of growth rate, which can change depending on the growth conditions. Perturbations of translation reveal that bacteria employ a compensatory strategy in which the reduced translation capability results in increased expression of the translation machinery.\r\nPerturbations of translation are achieved in various ways; clinically interesting is the application of translation-targeting antibiotics – translation inhibitors. The antibiotic effects on bacterial physiology are often poorly understood. Bacterial responses to two or more simultaneously applied antibiotics are even more puzzling. The combined antibiotic effect determines the type of drug interaction, which ranges from synergy (the effect is stronger than expected) to antagonism (the effect is weaker) and suppression (one of the drugs loses its potency).\r\nIn the first part of this work, we systematically measure the pairwise interaction network for translation inhibitors that interfere with different steps in translation. We find that the interactions are surprisingly diverse and tend to be more antagonistic. To explore the underlying mechanisms, we begin with a minimal biophysical model of combined antibiotic action. We base this model on the kinetics of antibiotic uptake and binding together with the physiological response described by the growth laws. The biophysical model explains some drug interactions, but not all; it specifically fails to predict suppression.\r\nIn the second part of this work, we hypothesize that elusive suppressive drug interactions result from the interplay between ribosomes halted in different stages of translation. To elucidate this putative mechanism of drug interactions between translation inhibitors, we generate translation bottlenecks genetically using in- ducible control of translation factors that regulate well-defined translation cycle steps. These perturbations accurately mimic antibiotic action and drug interactions, supporting that the interplay of different translation bottlenecks partially causes these interactions.\r\nWe extend this approach by varying two translation bottlenecks simultaneously. This approach reveals the suppression of translocation inhibition by inhibited translation. We rationalize this effect by modeling dense traffic of ribosomes that move on transcripts in a translation factor-mediated manner. This model predicts a dissolution of traffic jams caused by inhibited translocation when the density of ribosome traffic is reduced by lowered initiation. We base this model on the growth laws and quantitative relationships between different translation and growth parameters.\r\nIn the final part of this work, we describe a set of tools aimed at quantification of physiological and translation parameters. We further develop a simple model that directly connects the abundance of a translation factor with the growth rate, which allows us to extract physiological parameters describing initiation. We demonstrate the development of tools for measuring translation rate.\r\nThis thesis showcases how a combination of high-throughput growth rate mea- surements, genetics, and modeling can reveal mechanisms of drug interactions. Furthermore, by a gradual transition from combinations of antibiotics to precise genetic interventions, we demonstrated the equivalency between genetic and chemi- cal perturbations of translation. These findings tile the path for quantitative studies of antibiotic combinations and illustrate future approaches towards the quantitative description of translation.","lang":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"8657","status":"public","title":"Perturbations of protein synthesis: from antibiotics to genetics and physiology","ddc":["571","530","570"],"file":[{"checksum":"d708ecd62b6fcc3bc1feb483b8dbe9eb","date_updated":"2021-10-07T22:30:03Z","date_created":"2020-10-15T06:41:20Z","relation":"main_file","file_id":"8663","embargo":"2021-10-06","file_size":52636162,"content_type":"application/pdf","creator":"bkavcic","access_level":"open_access","file_name":"kavcicB_thesis202009.pdf"},{"embargo_to":"open_access","file_name":"2020b.zip","access_level":"closed","file_size":321681247,"content_type":"application/zip","creator":"bkavcic","relation":"source_file","file_id":"8664","date_updated":"2021-10-07T22:30:03Z","date_created":"2020-10-15T06:41:53Z","checksum":"bb35f2352a04db19164da609f00501f3"}],"oa_version":"Published Version"}]