--- _id: '9287' abstract: - lang: eng text: "The phytohormone auxin and its directional transport through tissues are intensively studied. However, a mechanistic understanding of auxin-mediated feedback on endocytosis and polar distribution of PIN auxin transporters remains limited due to contradictory observations and interpretations. Here, we used state-of-the-art methods to reexamine the\r\nauxin effects on PIN endocytic trafficking. We used high auxin concentrations or longer treatments versus lower concentrations and shorter treatments of natural (IAA) and synthetic (NAA) auxins to distinguish between specific and nonspecific effects. Longer treatments of both auxins interfere with Brefeldin A-mediated intracellular PIN2 accumulation and also with general aggregation of endomembrane compartments. NAA treatment decreased the internalization of the endocytic tracer dye, FM4-64; however, NAA treatment also affected the number, distribution, and compartment identity of the early endosome/trans-Golgi network (EE/TGN), rendering the FM4-64 endocytic assays at high NAA concentrations unreliable. To circumvent these nonspecific effects of NAA and IAA affecting the endomembrane system, we opted for alternative approaches visualizing the endocytic events directly at the plasma membrane (PM). Using Total Internal Reflection Fluorescence (TIRF) microscopy, we saw no significant effects of IAA or NAA treatments on the incidence and dynamics of clathrin foci, implying that these treatments do not affect the overall endocytosis rate. However, both NAA and IAA at low concentrations rapidly and specifically promoted endocytosis of photo-converted PIN2 from the PM. These analyses identify a specific effect of NAA and IAA on PIN2 endocytosis, thus contributing to its\r\npolarity maintenance and furthermore illustrate that high auxin levels have nonspecific effects on trafficking and endomembrane compartments. " acknowledged_ssus: - _id: M-Shop - _id: Bio acknowledgement: 'We thank Ivan Kulik for developing the Chip’n’Dale apparatus with Lanxin Li; the IST machine shop and the Bioimaging facility for their excellent support; Matouš Glanc and Matyáš Fendrych for their valuable discussions and help; Barbara Casillas-Perez for her help with statistics. This project has received funding from the European Research Council (ERC) under the European Union''s Horizon 2020 research and innovation program (grant agreement No 742985). A.J. is supported by funding from the Austrian Science Fund (FWF): I3630B25 to J.F. ' article_processing_charge: Yes (in subscription journal) article_type: original author: - first_name: Madhumitha full_name: Narasimhan, Madhumitha id: 44BF24D0-F248-11E8-B48F-1D18A9856A87 last_name: Narasimhan orcid: 0000-0002-8600-0671 - first_name: Michelle C full_name: Gallei, Michelle C id: 35A03822-F248-11E8-B48F-1D18A9856A87 last_name: Gallei orcid: 0000-0003-1286-7368 - first_name: Shutang full_name: Tan, Shutang id: 2DE75584-F248-11E8-B48F-1D18A9856A87 last_name: Tan orcid: 0000-0002-0471-8285 - first_name: Alexander J full_name: Johnson, Alexander J id: 46A62C3A-F248-11E8-B48F-1D18A9856A87 last_name: Johnson orcid: 0000-0002-2739-8843 - first_name: Inge full_name: Verstraeten, Inge id: 362BF7FE-F248-11E8-B48F-1D18A9856A87 last_name: Verstraeten orcid: 0000-0001-7241-2328 - first_name: Lanxin full_name: Li, Lanxin id: 367EF8FA-F248-11E8-B48F-1D18A9856A87 last_name: Li orcid: 0000-0002-5607-272X - first_name: Lesia full_name: Rodriguez Solovey, Lesia id: 3922B506-F248-11E8-B48F-1D18A9856A87 last_name: Rodriguez Solovey orcid: 0000-0002-7244-7237 - first_name: Huibin full_name: Han, Huibin id: 31435098-F248-11E8-B48F-1D18A9856A87 last_name: Han - first_name: E full_name: Himschoot, E last_name: Himschoot - first_name: R full_name: Wang, R last_name: Wang - first_name: S full_name: Vanneste, S last_name: Vanneste - first_name: J full_name: Sánchez-Simarro, J last_name: Sánchez-Simarro - first_name: F full_name: Aniento, F last_name: Aniento - first_name: Maciek full_name: Adamowski, Maciek id: 45F536D2-F248-11E8-B48F-1D18A9856A87 last_name: Adamowski orcid: 0000-0001-6463-5257 - first_name: Jiří full_name: Friml, Jiří id: 4159519E-F248-11E8-B48F-1D18A9856A87 last_name: Friml orcid: 0000-0002-8302-7596 citation: ama: Narasimhan M, Gallei MC, Tan S, et al. Systematic analysis of specific and nonspecific auxin effects on endocytosis and trafficking. Plant Physiology. 2021;186(2):1122–1142. doi:10.1093/plphys/kiab134 apa: Narasimhan, M., Gallei, M. C., Tan, S., Johnson, A. J., Verstraeten, I., Li, L., … Friml, J. (2021). Systematic analysis of specific and nonspecific auxin effects on endocytosis and trafficking. Plant Physiology. Oxford University Press. https://doi.org/10.1093/plphys/kiab134 chicago: Narasimhan, Madhumitha, Michelle C Gallei, Shutang Tan, Alexander J Johnson, Inge Verstraeten, Lanxin Li, Lesia Rodriguez Solovey, et al. “Systematic Analysis of Specific and Nonspecific Auxin Effects on Endocytosis and Trafficking.” Plant Physiology. Oxford University Press, 2021. https://doi.org/10.1093/plphys/kiab134. ieee: M. Narasimhan et al., “Systematic analysis of specific and nonspecific auxin effects on endocytosis and trafficking,” Plant Physiology, vol. 186, no. 2. Oxford University Press, pp. 1122–1142, 2021. ista: Narasimhan M, Gallei MC, Tan S, Johnson AJ, Verstraeten I, Li L, Rodriguez Solovey L, Han H, Himschoot E, Wang R, Vanneste S, Sánchez-Simarro J, Aniento F, Adamowski M, Friml J. 2021. Systematic analysis of specific and nonspecific auxin effects on endocytosis and trafficking. Plant Physiology. 186(2), 1122–1142. mla: Narasimhan, Madhumitha, et al. “Systematic Analysis of Specific and Nonspecific Auxin Effects on Endocytosis and Trafficking.” Plant Physiology, vol. 186, no. 2, Oxford University Press, 2021, pp. 1122–1142, doi:10.1093/plphys/kiab134. short: M. Narasimhan, M.C. Gallei, S. Tan, A.J. Johnson, I. Verstraeten, L. Li, L. Rodriguez Solovey, H. Han, E. Himschoot, R. Wang, S. Vanneste, J. Sánchez-Simarro, F. Aniento, M. Adamowski, J. Friml, Plant Physiology 186 (2021) 1122–1142. date_created: 2021-03-26T12:08:38Z date_published: 2021-06-01T00:00:00Z date_updated: 2024-03-27T23:30:43Z day: '01' ddc: - '580' department: - _id: JiFr doi: 10.1093/plphys/kiab134 ec_funded: 1 external_id: isi: - '000671555900031' pmid: - '33734402' file: - access_level: open_access checksum: 532bb9469d3b665907f06df8c383eade content_type: application/pdf creator: cziletti date_created: 2021-11-11T15:07:51Z date_updated: 2021-11-11T15:07:51Z file_id: '10273' file_name: 2021_PlantPhysio_Narasimhan.pdf file_size: 2289127 relation: main_file success: 1 file_date_updated: 2021-11-11T15:07:51Z has_accepted_license: '1' intvolume: ' 186' isi: 1 issue: '2' language: - iso: eng license: https://creativecommons.org/licenses/by/4.0/ month: '06' oa: 1 oa_version: Published Version page: 1122–1142 pmid: 1 project: - _id: 261099A6-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '742985' name: Tracing Evolution of Auxin Transport and Polarity in Plants - _id: 26538374-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: I03630 name: Molecular mechanisms of endocytic cargo recognition in plants publication: Plant Physiology publication_identifier: eissn: - 1532-2548 issn: - 0032-0889 publication_status: published publisher: Oxford University Press quality_controlled: '1' related_material: link: - relation: erratum url: 10.1093/plphys/kiab380 record: - id: '11626' relation: dissertation_contains status: public - id: '10083' relation: dissertation_contains status: public status: public title: Systematic analysis of specific and nonspecific auxin effects on endocytosis and trafficking tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 186 year: '2021' ... --- _id: '10083' abstract: - lang: eng text: "Plant motions occur across a wide spectrum of timescales, ranging from seed dispersal through bursting (milliseconds) and stomatal opening (minutes) to long-term adaptation of gross architecture. Relatively fast motions include water-driven growth as exemplified by root cell expansion under abiotic/biotic stresses or during gravitropism. A showcase is a root growth inhibition in 30 seconds triggered by the phytohormone auxin. However, the cellular and molecular mechanisms are still largely unknown. This thesis covers the studies about this topic as follows. By taking advantage of microfluidics combined with live imaging, pharmaceutical tools, and transgenic lines, we examined the kinetics of and causal relationship among various auxininduced rapid cellular changes in root growth, apoplastic pH, cytosolic Ca2+, cortical microtubule (CMT) orientation, and vacuolar morphology. We revealed that CMT reorientation and vacuolar constriction are the consequence of growth itself instead of responding directly to auxin. In contrast, auxin induces apoplast alkalinization to rapidly inhibit root growth in 30 seconds. This auxin-triggered apoplast alkalinization results from rapid H+- influx that is contributed by Ca2+ inward channel CYCLIC NUCLEOTIDE-GATED CHANNEL 14 (CNGC14)-dependent Ca2+ signaling. To dissect which auxin signaling mediates the rapid apoplast alkalinization, we\r\ncombined microfluidics and genetic engineering to verify that TIR1/AFB receptors conduct a non-transcriptional regulation on Ca2+ and H+ -influx. This non-canonical pathway is mostly mediated by the cytosolic portion of TIR1/AFB. On the other hand, we uncovered, using biochemical and phospho-proteomic analysis, that auxin cell surface signaling component TRANSMEMBRANE KINASE 1 (TMK1) plays a negative role during auxin-trigger apoplast\r\nalkalinization and root growth inhibition through directly activating PM H+ -ATPases. Therefore, we discovered that PM H+ -ATPases counteract instead of mediate the auxintriggered rapid H+ -influx, and that TIR1/AFB and TMK1 regulate root growth antagonistically. This opposite effect of TIR1/AFB and TMK1 is consistent during auxin-induced hypocotyl elongation, leading us to explore the relation of two signaling pathways. Assisted with biochemistry and fluorescent imaging, we verified for the first time that TIR1/AFB and TMK1 can interact with each other. The ability of TIR1/AFB binding to membrane lipid provides a basis for the interaction of plasma membrane- and cytosol-localized proteins.\r\nBesides, transgenic analysis combined with genetic engineering and biochemistry showed that vi\r\nthey do function in the same pathway. Particularly, auxin-induced TMK1 increase is TIR1/AFB dependent, suggesting TIR1/AFB regulation on TMK1. Conversely, TMK1 also regulates TIR1/AFB protein levels and thus auxin canonical signaling. To follow the study of rapid growth regulation, we analyzed another rapid growth regulator, signaling peptide RALF1. We showed that RALF1 also triggers a rapid and reversible growth inhibition caused by H + influx, highly resembling but not dependent on auxin. Besides, RALF1 promotes auxin biosynthesis by increasing expression of auxin biosynthesis enzyme YUCCAs and thus induces auxin signaling in ca. 1 hour, contributing to the sustained RALF1-triggered growth inhibition. These studies collectively contribute to understanding rapid regulation on plant cell\r\ngrowth, novel auxin signaling pathway as well as auxin-peptide crosstalk. " alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Lanxin full_name: Li, Lanxin last_name: Li citation: ama: Li L. Rapid cell growth regulation in Arabidopsis. 2021. doi:10.15479/at:ista:10083 apa: Li, L. (2021). Rapid cell growth regulation in Arabidopsis. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:10083 chicago: Li, Lanxin. “Rapid Cell Growth Regulation in Arabidopsis.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:10083. ieee: L. Li, “Rapid cell growth regulation in Arabidopsis,” Institute of Science and Technology Austria, 2021. ista: Li L. 2021. Rapid cell growth regulation in Arabidopsis. Institute of Science and Technology Austria. mla: Li, Lanxin. Rapid Cell Growth Regulation in Arabidopsis. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:10083. short: L. Li, Rapid Cell Growth Regulation in Arabidopsis, Institute of Science and Technology Austria, 2021. date_created: 2021-10-04T13:33:10Z date_published: 2021-10-06T00:00:00Z date_updated: 2023-10-31T19:30:02Z day: '06' ddc: - '575' degree_awarded: PhD department: - _id: GradSch - _id: JiFr doi: 10.15479/at:ista:10083 ec_funded: 1 file: - access_level: open_access checksum: 3b2f55b3b8ae05337a0dcc1cd8595b10 content_type: application/pdf creator: cchlebak date_created: 2021-10-14T08:00:07Z date_updated: 2022-12-20T23:30:03Z embargo: 2022-10-14 file_id: '10138' file_name: 0._IST_Austria_Thesis_Lanxin_Li_1014_pdftron.pdf file_size: 8616142 relation: main_file - access_level: closed checksum: f23ed258ca894f6aabf58b0c128bf242 content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document creator: cchlebak date_created: 2021-10-14T08:00:13Z date_updated: 2022-12-20T23:30:03Z embargo_to: open_access file_id: '10139' file_name: 0._IST_Austria_Thesis_Lanxin_Li_1014.docx file_size: 15058499 relation: source_file file_date_updated: 2022-12-20T23:30:03Z has_accepted_license: '1' language: - iso: eng license: https://creativecommons.org/licenses/by-nc-nd/4.0/ month: '10' oa: 1 oa_version: Published Version project: - _id: 2564DBCA-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '665385' name: International IST Doctoral Program - _id: 26B4D67E-B435-11E9-9278-68D0E5697425 grant_number: '25351' name: 'A Case Study of Plant Growth Regulation: Molecular Mechanism of Auxin-mediated Rapid Growth Inhibition in Arabidopsis Root' publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '442' relation: part_of_dissertation status: public - id: '8931' relation: part_of_dissertation status: public - id: '9287' relation: part_of_dissertation status: public - id: '8283' relation: part_of_dissertation status: public - id: '8986' relation: part_of_dissertation status: public - id: '6627' relation: part_of_dissertation status: public - id: '10095' relation: part_of_dissertation status: public - id: '10015' relation: part_of_dissertation status: public status: public supervisor: - first_name: Jiří full_name: Friml, Jiří id: 4159519E-F248-11E8-B48F-1D18A9856A87 last_name: Friml orcid: 0000-0002-8302-7596 title: Rapid cell growth regulation in Arabidopsis tmp: image: /images/cc_by_nc_nd.png legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0) short: CC BY-NC-ND (4.0) type: dissertation user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 year: '2021' ... --- _id: '10015' abstract: - lang: eng text: "Auxin plays a dual role in growth regulation and, depending on the tissue and concentration of the hormone, it can either promote or inhibit division and expansion processes in plants. Recent studies have revealed that, beyond transcriptional reprogramming, alternative auxincontrolled mechanisms regulate root growth. Here, we explored the impact of different concentrations of the synthetic auxin NAA that establish growth-promoting and -repressing conditions on the root tip proteome and phosphoproteome, generating a unique resource. From the phosphoproteome data, we pinpointed (novel) growth regulators, such as the RALF34-THE1 module. Our results, together with previously published studies, suggest that auxin, H+-ATPases, cell wall modifications and cell wall sensing receptor-like kinases are tightly embedded in a pathway regulating cell elongation. Furthermore, our study assigned a novel role to MKK2 as a regulator of primary root growth and a (potential) regulator of auxin biosynthesis and signalling, and suggests the importance of the MKK2\r\nThr31 phosphorylation site for growth regulation in the Arabidopsis root tip." acknowledgement: We thank the Nottingham Stock Centre for seeds, Frank Van Breusegem for the phb3 mutant, and Herman Höfte for the the1 mutant. Open Access Funding by the Austrian Science Fund (FWF). alternative_title: - Protein Phosphorylation and Cell Signaling in Plants article_number: '1665 ' article_processing_charge: Yes article_type: original author: - first_name: N full_name: Nikonorova, N last_name: Nikonorova - first_name: E full_name: Murphy, E last_name: Murphy - first_name: CF full_name: Fonseca de Lima, CF last_name: Fonseca de Lima - first_name: S full_name: Zhu, S last_name: Zhu - first_name: B full_name: van de Cotte, B last_name: van de Cotte - first_name: LD full_name: Vu, LD last_name: Vu - first_name: D full_name: Balcerowicz, D last_name: Balcerowicz - first_name: Lanxin full_name: Li, Lanxin id: 367EF8FA-F248-11E8-B48F-1D18A9856A87 last_name: Li orcid: 0000-0002-5607-272X - first_name: X full_name: Kong, X last_name: Kong - first_name: G full_name: De Rop, G last_name: De Rop - first_name: T full_name: Beeckman, T last_name: Beeckman - first_name: Jiří full_name: Friml, Jiří id: 4159519E-F248-11E8-B48F-1D18A9856A87 last_name: Friml orcid: 0000-0002-8302-7596 - first_name: K full_name: Vissenberg, K last_name: Vissenberg - first_name: PC full_name: Morris, PC last_name: Morris - first_name: Z full_name: Ding, Z last_name: Ding - first_name: I full_name: De Smet, I last_name: De Smet citation: ama: Nikonorova N, Murphy E, Fonseca de Lima C, et al. The Arabidopsis root tip (phospho)proteomes at growth-promoting versus growth-repressing conditions reveal novel root growth regulators. Cells. 2021;10. doi:10.3390/cells10071665 apa: Nikonorova, N., Murphy, E., Fonseca de Lima, C., Zhu, S., van de Cotte, B., Vu, L., … De Smet, I. (2021). The Arabidopsis root tip (phospho)proteomes at growth-promoting versus growth-repressing conditions reveal novel root growth regulators. Cells. MDPI. https://doi.org/10.3390/cells10071665 chicago: Nikonorova, N, E Murphy, CF Fonseca de Lima, S Zhu, B van de Cotte, LD Vu, D Balcerowicz, et al. “The Arabidopsis Root Tip (Phospho)Proteomes at Growth-Promoting versus Growth-Repressing Conditions Reveal Novel Root Growth Regulators.” Cells. MDPI, 2021. https://doi.org/10.3390/cells10071665. ieee: N. Nikonorova et al., “The Arabidopsis root tip (phospho)proteomes at growth-promoting versus growth-repressing conditions reveal novel root growth regulators,” Cells, vol. 10. MDPI, 2021. ista: Nikonorova N, Murphy E, Fonseca de Lima C, Zhu S, van de Cotte B, Vu L, Balcerowicz D, Li L, Kong X, De Rop G, Beeckman T, Friml J, Vissenberg K, Morris P, Ding Z, De Smet I. 2021. The Arabidopsis root tip (phospho)proteomes at growth-promoting versus growth-repressing conditions reveal novel root growth regulators. Cells. 10, 1665. mla: Nikonorova, N., et al. “The Arabidopsis Root Tip (Phospho)Proteomes at Growth-Promoting versus Growth-Repressing Conditions Reveal Novel Root Growth Regulators.” Cells, vol. 10, 1665, MDPI, 2021, doi:10.3390/cells10071665. short: N. Nikonorova, E. Murphy, C. Fonseca de Lima, S. Zhu, B. van de Cotte, L. Vu, D. Balcerowicz, L. Li, X. Kong, G. De Rop, T. Beeckman, J. Friml, K. Vissenberg, P. Morris, Z. Ding, I. De Smet, Cells 10 (2021). date_created: 2021-09-14T11:36:20Z date_published: 2021-07-02T00:00:00Z date_updated: 2024-03-27T23:30:43Z day: '02' ddc: - '575' department: - _id: JiFr doi: 10.3390/cells10071665 ec_funded: 1 external_id: isi: - '000676604700001' pmid: - '34359847' file: - access_level: open_access checksum: 2a9f534b9c2200e72e2cde95afaf4eed content_type: application/pdf creator: cchlebak date_created: 2021-09-16T09:07:06Z date_updated: 2021-09-16T09:07:06Z file_id: '10021' file_name: 2021_Cells_Nikonorova.pdf file_size: 2667848 relation: main_file success: 1 file_date_updated: 2021-09-16T09:07:06Z has_accepted_license: '1' intvolume: ' 10' isi: 1 keyword: - primary root - (phospho)proteomics - auxin - (receptor) kinase language: - iso: eng month: '07' oa: 1 oa_version: Published Version pmid: 1 project: - _id: 2564DBCA-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '665385' name: International IST Doctoral Program - _id: 3AC91DDA-15DF-11EA-824D-93A3E7B544D1 call_identifier: FWF name: FWF Open Access Fund publication: Cells publication_identifier: issn: - 2073-4409 publication_status: published publisher: MDPI quality_controlled: '1' related_material: record: - id: '10083' relation: dissertation_contains status: public status: public title: The Arabidopsis root tip (phospho)proteomes at growth-promoting versus growth-repressing conditions reveal novel root growth regulators tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 10 year: '2021' ... --- _id: '10095' abstract: - lang: eng text: Growth regulation tailors plant development to its environment. A showcase is response to gravity, where shoots bend up and roots down1. This paradox is based on opposite effects of the phytohormone auxin, which promotes cell expansion in shoots, while inhibiting it in roots via a yet unknown cellular mechanism2. Here, by combining microfluidics, live imaging, genetic engineering and phospho-proteomics in Arabidopsis thaliana, we advance our understanding how auxin inhibits root growth. We show that auxin activates two distinct, antagonistically acting signalling pathways that converge on the rapid regulation of the apoplastic pH, a causative growth determinant. Cell surface-based TRANSMEMBRANE KINASE1 (TMK1) interacts with and mediates phosphorylation and activation of plasma membrane H+-ATPases for apoplast acidification, while intracellular canonical auxin signalling promotes net cellular H+-influx, causing apoplast alkalinisation. The simultaneous activation of these two counteracting mechanisms poises the root for a rapid, fine-tuned growth modulation while navigating complex soil environment. acknowledged_ssus: - _id: LifeSc - _id: M-Shop - _id: Bio acknowledgement: We thank Nataliia Gnyliukh and Lukas Hörmayer for technical assistance and Nadine Paris for sharing PM-Cyto seeds. We gratefully acknowledge Life Science, Machine Shop and Bioimaging Facilities of IST Austria. This project has received funding from the European Research Council Advanced Grant (ETAP-742985) and the Austrian Science Fund (FWF) I 3630-B25 to J.F., the National Institutes of Health (GM067203) to W.M.G., the Netherlands Organization for Scientific Research (NWO; VIDI-864.13.001.), the Research Foundation-Flanders (FWO; Odysseus II G0D0515N) and a European Research Council Starting Grant (TORPEDO-714055) to W.S. and B.D.R., the VICI grant (865.14.001) from the Netherlands Organization for Scientific Research to M.R and D.W., the Australian Research Council and China National Distinguished Expert Project (WQ20174400441) to S.S., the MEXT/JSPS KAKENHI to K.T. (20K06685) and T.K. (20H05687 and 20H05910), the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385 and the DOC Fellowship of the Austrian Academy of Sciences to L.L., the China Scholarship Council to J.C. article_number: '266395' article_processing_charge: No author: - first_name: Lanxin full_name: Li, Lanxin id: 367EF8FA-F248-11E8-B48F-1D18A9856A87 last_name: Li orcid: 0000-0002-5607-272X - first_name: Inge full_name: Verstraeten, Inge id: 362BF7FE-F248-11E8-B48F-1D18A9856A87 last_name: Verstraeten orcid: 0000-0001-7241-2328 - first_name: Mark full_name: Roosjen, Mark last_name: Roosjen - first_name: Koji full_name: Takahashi, Koji last_name: Takahashi - first_name: Lesia full_name: Rodriguez Solovey, Lesia id: 3922B506-F248-11E8-B48F-1D18A9856A87 last_name: Rodriguez Solovey orcid: 0000-0002-7244-7237 - first_name: Jack full_name: Merrin, Jack id: 4515C308-F248-11E8-B48F-1D18A9856A87 last_name: Merrin orcid: 0000-0001-5145-4609 - first_name: Jian full_name: Chen, Jian last_name: Chen - first_name: Lana full_name: Shabala, Lana last_name: Shabala - first_name: Wouter full_name: Smet, Wouter last_name: Smet - first_name: Hong full_name: Ren, Hong last_name: Ren - first_name: Steffen full_name: Vanneste, Steffen last_name: Vanneste - first_name: Sergey full_name: Shabala, Sergey last_name: Shabala - first_name: Bert full_name: De Rybel, Bert last_name: De Rybel - first_name: Dolf full_name: Weijers, Dolf last_name: Weijers - first_name: Toshinori full_name: Kinoshita, Toshinori last_name: Kinoshita - first_name: William M. full_name: Gray, William M. last_name: Gray - first_name: Jiří full_name: Friml, Jiří id: 4159519E-F248-11E8-B48F-1D18A9856A87 last_name: Friml orcid: 0000-0002-8302-7596 citation: ama: Li L, Verstraeten I, Roosjen M, et al. Cell surface and intracellular auxin signalling for H+-fluxes in root growth. Research Square. doi:10.21203/rs.3.rs-266395/v3 apa: Li, L., Verstraeten, I., Roosjen, M., Takahashi, K., Rodriguez Solovey, L., Merrin, J., … Friml, J. (n.d.). Cell surface and intracellular auxin signalling for H+-fluxes in root growth. Research Square. https://doi.org/10.21203/rs.3.rs-266395/v3 chicago: Li, Lanxin, Inge Verstraeten, Mark Roosjen, Koji Takahashi, Lesia Rodriguez Solovey, Jack Merrin, Jian Chen, et al. “Cell Surface and Intracellular Auxin Signalling for H+-Fluxes in Root Growth.” Research Square, n.d. https://doi.org/10.21203/rs.3.rs-266395/v3. ieee: L. Li et al., “Cell surface and intracellular auxin signalling for H+-fluxes in root growth,” Research Square. . ista: Li L, Verstraeten I, Roosjen M, Takahashi K, Rodriguez Solovey L, Merrin J, Chen J, Shabala L, Smet W, Ren H, Vanneste S, Shabala S, De Rybel B, Weijers D, Kinoshita T, Gray WM, Friml J. Cell surface and intracellular auxin signalling for H+-fluxes in root growth. Research Square, 266395. mla: Li, Lanxin, et al. “Cell Surface and Intracellular Auxin Signalling for H+-Fluxes in Root Growth.” Research Square, 266395, doi:10.21203/rs.3.rs-266395/v3. short: L. Li, I. Verstraeten, M. Roosjen, K. Takahashi, L. Rodriguez Solovey, J. Merrin, J. Chen, L. Shabala, W. Smet, H. Ren, S. Vanneste, S. Shabala, B. De Rybel, D. Weijers, T. Kinoshita, W.M. Gray, J. Friml, Research Square (n.d.). date_created: 2021-10-06T08:56:22Z date_published: 2021-09-09T00:00:00Z date_updated: 2024-03-27T23:30:43Z day: '09' department: - _id: JiFr - _id: NanoFab doi: 10.21203/rs.3.rs-266395/v3 ec_funded: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://www.doi.org/10.21203/rs.3.rs-266395/v3 month: '09' oa: 1 oa_version: Preprint project: - _id: 2564DBCA-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '665385' name: International IST Doctoral Program - _id: 261099A6-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '742985' name: Tracing Evolution of Auxin Transport and Polarity in Plants - _id: 26538374-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: I03630 name: Molecular mechanisms of endocytic cargo recognition in plants - _id: 26B4D67E-B435-11E9-9278-68D0E5697425 grant_number: '25351' name: 'A Case Study of Plant Growth Regulation: Molecular Mechanism of Auxin-mediated Rapid Growth Inhibition in Arabidopsis Root' publication: Research Square publication_identifier: issn: - 2693-5015 publication_status: accepted related_material: record: - id: '10223' relation: later_version status: public - id: '10083' relation: dissertation_contains status: public status: public title: Cell surface and intracellular auxin signalling for H+-fluxes in root growth tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: preprint user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2021' ... --- _id: '10293' abstract: - lang: eng text: "Indirect reciprocity in evolutionary game theory is a prominent mechanism for explaining the evolution of cooperation among unrelated individuals. In contrast to direct reciprocity, which is based on individuals meeting repeatedly, and conditionally cooperating by using their own experiences, indirect reciprocity is based on individuals’ reputations. If a player helps another, this increases the helper’s public standing, benefitting them in the future. This lets cooperation in the population emerge without individuals having to meet more than once. While the two modes of reciprocity are intertwined, they are difficult to compare. Thus, they are usually studied in isolation. Direct reciprocity can maintain cooperation with simple strategies, and is robust against noise even when players do not remember more\r\nthan their partner’s last action. Meanwhile, indirect reciprocity requires its successful strategies, or social norms, to be more complex. Exhaustive search previously identified eight such norms, called the “leading eight”, which excel at maintaining cooperation. However, as the first result of this thesis, we show that the leading eight break down once we remove the fundamental assumption that information is synchronized and public, such that everyone agrees on reputations. Once we consider a more realistic scenario of imperfect information, where reputations are private, and individuals occasionally misinterpret or miss observations, the leading eight do not promote cooperation anymore. Instead, minor initial disagreements can proliferate, fragmenting populations into subgroups. In a next step, we consider ways to mitigate this issue. We first explore whether introducing “generosity” can stabilize cooperation when players use the leading eight strategies in noisy environments. This approach of modifying strategies to include probabilistic elements for coping with errors is known to work well in direct reciprocity. However, as we show here, it fails for the more complex norms of indirect reciprocity. Imperfect information still prevents cooperation from evolving. On the other hand, we succeeded to show in this thesis that modifying the leading eight to use “quantitative assessment”, i.e. tracking reputation scores on a scale beyond good and bad, and making overall judgments of others based on a threshold, is highly successful, even when noise increases in the environment. Cooperation can flourish when reputations\r\nare more nuanced, and players have a broader understanding what it means to be “good.” Finally, we present a single theoretical framework that unites the two modes of reciprocity despite their differences. Within this framework, we identify a novel simple and successful strategy for indirect reciprocity, which can cope with noisy environments and has an analogue in direct reciprocity. We can also analyze decision making when different sources of information are available. Our results help highlight that for sustaining cooperation, already the most simple rules of reciprocity can be sufficient." alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Laura full_name: Schmid, Laura id: 38B437DE-F248-11E8-B48F-1D18A9856A87 last_name: Schmid orcid: 0000-0002-6978-7329 citation: ama: Schmid L. Evolution of cooperation via (in)direct reciprocity under imperfect information. 2021. doi:10.15479/at:ista:10293 apa: Schmid, L. (2021). Evolution of cooperation via (in)direct reciprocity under imperfect information. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:10293 chicago: Schmid, Laura. “Evolution of Cooperation via (in)Direct Reciprocity under Imperfect Information.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:10293. ieee: L. Schmid, “Evolution of cooperation via (in)direct reciprocity under imperfect information,” Institute of Science and Technology Austria, 2021. ista: Schmid L. 2021. Evolution of cooperation via (in)direct reciprocity under imperfect information. Institute of Science and Technology Austria. mla: Schmid, Laura. Evolution of Cooperation via (in)Direct Reciprocity under Imperfect Information. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:10293. short: L. Schmid, Evolution of Cooperation via (in)Direct Reciprocity under Imperfect Information, Institute of Science and Technology Austria, 2021. date_created: 2021-11-15T17:12:57Z date_published: 2021-11-17T00:00:00Z date_updated: 2023-11-07T08:28:29Z day: '17' ddc: - '519' - '576' degree_awarded: PhD department: - _id: GradSch - _id: KrCh doi: 10.15479/at:ista:10293 ec_funded: 1 file: - access_level: closed checksum: 86a05b430756ca12ae8107b6e6f3c1e5 content_type: application/zip creator: lschmid date_created: 2021-11-18T12:41:46Z date_updated: 2022-12-20T23:30:08Z embargo_to: open_access file_id: '10305' file_name: submission_new.zip file_size: 29703124 relation: source_file - access_level: open_access checksum: d940af042e94660c6b6a7b4f0b184d47 content_type: application/pdf creator: lschmid date_created: 2021-11-18T12:59:15Z date_updated: 2022-12-20T23:30:08Z embargo: 2022-10-18 file_id: '10306' file_name: thesis_new_upload.pdf file_size: 8320985 relation: main_file file_date_updated: 2022-12-20T23:30:08Z has_accepted_license: '1' language: - iso: eng month: '11' oa: 1 oa_version: Published Version page: '171' project: - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' - _id: 0599E47C-7A3F-11EA-A408-12923DDC885E call_identifier: H2020 grant_number: '863818' name: 'Formal Methods for Stochastic Models: Algorithms and Applications' - _id: 25F42A32-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z211 name: The Wittgenstein Prize - _id: 2584A770-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P 23499-N23 name: Modern Graph Algorithmic Techniques in Formal Verification - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '9997' relation: part_of_dissertation status: public - id: '2' relation: part_of_dissertation status: public - id: '9402' relation: part_of_dissertation status: public status: public supervisor: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X title: Evolution of cooperation via (in)direct reciprocity under imperfect information type: dissertation user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 year: '2021' ... --- _id: '9997' abstract: - lang: eng text: Indirect reciprocity is a mechanism for the evolution of cooperation based on social norms. This mechanism requires that individuals in a population observe and judge each other’s behaviors. Individuals with a good reputation are more likely to receive help from others. Previous work suggests that indirect reciprocity is only effective when all relevant information is reliable and publicly available. Otherwise, individuals may disagree on how to assess others, even if they all apply the same social norm. Such disagreements can lead to a breakdown of cooperation. Here we explore whether the predominantly studied ‘leading eight’ social norms of indirect reciprocity can be made more robust by equipping them with an element of generosity. To this end, we distinguish between two kinds of generosity. According to assessment generosity, individuals occasionally assign a good reputation to group members who would usually be regarded as bad. According to action generosity, individuals occasionally cooperate with group members with whom they would usually defect. Using individual-based simulations, we show that the two kinds of generosity have a very different effect on the resulting reputation dynamics. Assessment generosity tends to add to the overall noise and allows defectors to invade. In contrast, a limited amount of action generosity can be beneficial in a few cases. However, even when action generosity is beneficial, the respective simulations do not result in full cooperation. Our results suggest that while generosity can favor cooperation when individuals use the most simple strategies of reciprocity, it is disadvantageous when individuals use more complex social norms. acknowledgement: 'This work was supported by the European Research Council CoG 863818 (ForM-SMArt) (to K.C.) and the European Research Council Starting Grant 850529: E-DIRECT (to C.H.). L.S. received additional partial support by the Austrian Science Fund (FWF) under Grant Z211-N23 (Wittgenstein Award).' article_number: '17443' article_processing_charge: Yes article_type: original author: - first_name: Laura full_name: Schmid, Laura id: 38B437DE-F248-11E8-B48F-1D18A9856A87 last_name: Schmid orcid: 0000-0002-6978-7329 - first_name: Pouya full_name: Shati, Pouya last_name: Shati - first_name: Christian full_name: Hilbe, Christian last_name: Hilbe - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X citation: ama: Schmid L, Shati P, Hilbe C, Chatterjee K. The evolution of indirect reciprocity under action and assessment generosity. Scientific Reports. 2021;11(1). doi:10.1038/s41598-021-96932-1 apa: Schmid, L., Shati, P., Hilbe, C., & Chatterjee, K. (2021). The evolution of indirect reciprocity under action and assessment generosity. Scientific Reports. Springer Nature. https://doi.org/10.1038/s41598-021-96932-1 chicago: Schmid, Laura, Pouya Shati, Christian Hilbe, and Krishnendu Chatterjee. “The Evolution of Indirect Reciprocity under Action and Assessment Generosity.” Scientific Reports. Springer Nature, 2021. https://doi.org/10.1038/s41598-021-96932-1. ieee: L. Schmid, P. Shati, C. Hilbe, and K. Chatterjee, “The evolution of indirect reciprocity under action and assessment generosity,” Scientific Reports, vol. 11, no. 1. Springer Nature, 2021. ista: Schmid L, Shati P, Hilbe C, Chatterjee K. 2021. The evolution of indirect reciprocity under action and assessment generosity. Scientific Reports. 11(1), 17443. mla: Schmid, Laura, et al. “The Evolution of Indirect Reciprocity under Action and Assessment Generosity.” Scientific Reports, vol. 11, no. 1, 17443, Springer Nature, 2021, doi:10.1038/s41598-021-96932-1. short: L. Schmid, P. Shati, C. Hilbe, K. Chatterjee, Scientific Reports 11 (2021). date_created: 2021-09-11T16:22:02Z date_published: 2021-08-31T00:00:00Z date_updated: 2024-03-27T23:30:44Z day: '31' ddc: - '003' department: - _id: GradSch - _id: KrCh doi: 10.1038/s41598-021-96932-1 ec_funded: 1 external_id: isi: - '000692406400018' pmid: - '34465830' file: - access_level: open_access checksum: 19df8816cf958b272b85841565c73182 content_type: application/pdf creator: cchlebak date_created: 2021-09-13T10:31:21Z date_updated: 2021-09-13T10:31:21Z file_id: '10006' file_name: 2021_ScientificReports_Schmid.pdf file_size: 2424943 relation: main_file success: 1 file_date_updated: 2021-09-13T10:31:21Z has_accepted_license: '1' intvolume: ' 11' isi: 1 issue: '1' keyword: - Multidisciplinary language: - iso: eng month: '08' oa: 1 oa_version: Published Version pmid: 1 project: - _id: 0599E47C-7A3F-11EA-A408-12923DDC885E call_identifier: H2020 grant_number: '863818' name: 'Formal Methods for Stochastic Models: Algorithms and Applications' - _id: 25F42A32-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z211 name: The Wittgenstein Prize publication: Scientific Reports publication_identifier: eissn: - 2045-2322 publication_status: published publisher: Springer Nature quality_controlled: '1' related_material: record: - id: '10293' relation: dissertation_contains status: public status: public title: The evolution of indirect reciprocity under action and assessment generosity tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 11 year: '2021' ... --- _id: '9402' abstract: - lang: eng text: Direct and indirect reciprocity are key mechanisms for the evolution of cooperation. Direct reciprocity means that individuals use their own experience to decide whether to cooperate with another person. Indirect reciprocity means that they also consider the experiences of others. Although these two mechanisms are intertwined, they are typically studied in isolation. Here, we introduce a mathematical framework that allows us to explore both kinds of reciprocity simultaneously. We show that the well-known ‘generous tit-for-tat’ strategy of direct reciprocity has a natural analogue in indirect reciprocity, which we call ‘generous scoring’. Using an equilibrium analysis, we characterize under which conditions either of the two strategies can maintain cooperation. With simulations, we additionally explore which kind of reciprocity evolves when members of a population engage in social learning to adapt to their environment. Our results draw unexpected connections between direct and indirect reciprocity while highlighting important differences regarding their evolvability. acknowledgement: 'This work was supported by the European Research Council CoG 863818 (ForM-SMArt) (to K.C.), the European Research Council Start Grant 279307: Graph Games (to K.C.), and the European Research Council Starting Grant 850529: E-DIRECT (to C.H.). The funders had no role in study design, data collection and analysis, decision to publish or preparation of the manuscript.' article_processing_charge: No article_type: original author: - first_name: Laura full_name: Schmid, Laura id: 38B437DE-F248-11E8-B48F-1D18A9856A87 last_name: Schmid orcid: 0000-0002-6978-7329 - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Christian full_name: Hilbe, Christian id: 2FDF8F3C-F248-11E8-B48F-1D18A9856A87 last_name: Hilbe orcid: 0000-0001-5116-955X - first_name: Martin A. full_name: Nowak, Martin A. last_name: Nowak citation: ama: Schmid L, Chatterjee K, Hilbe C, Nowak MA. A unified framework of direct and indirect reciprocity. Nature Human Behaviour. 2021;5(10):1292–1302. doi:10.1038/s41562-021-01114-8 apa: Schmid, L., Chatterjee, K., Hilbe, C., & Nowak, M. A. (2021). A unified framework of direct and indirect reciprocity. Nature Human Behaviour. Springer Nature. https://doi.org/10.1038/s41562-021-01114-8 chicago: Schmid, Laura, Krishnendu Chatterjee, Christian Hilbe, and Martin A. Nowak. “A Unified Framework of Direct and Indirect Reciprocity.” Nature Human Behaviour. Springer Nature, 2021. https://doi.org/10.1038/s41562-021-01114-8. ieee: L. Schmid, K. Chatterjee, C. Hilbe, and M. A. Nowak, “A unified framework of direct and indirect reciprocity,” Nature Human Behaviour, vol. 5, no. 10. Springer Nature, pp. 1292–1302, 2021. ista: Schmid L, Chatterjee K, Hilbe C, Nowak MA. 2021. A unified framework of direct and indirect reciprocity. Nature Human Behaviour. 5(10), 1292–1302. mla: Schmid, Laura, et al. “A Unified Framework of Direct and Indirect Reciprocity.” Nature Human Behaviour, vol. 5, no. 10, Springer Nature, 2021, pp. 1292–1302, doi:10.1038/s41562-021-01114-8. short: L. Schmid, K. Chatterjee, C. Hilbe, M.A. Nowak, Nature Human Behaviour 5 (2021) 1292–1302. date_created: 2021-05-18T16:56:57Z date_published: 2021-05-13T00:00:00Z date_updated: 2024-03-27T23:30:44Z day: '13' ddc: - '000' department: - _id: KrCh - _id: GradSch doi: 10.1038/s41562-021-01114-8 ec_funded: 1 external_id: isi: - '000650304000002' pmid: - '33986519' file: - access_level: open_access checksum: 34f55e173f90dc1dab731063458ac780 content_type: application/pdf creator: dernst date_created: 2023-11-07T08:27:23Z date_updated: 2023-11-07T08:27:23Z file_id: '14496' file_name: 2021_NatureHumanBehaviour_Schmid_accepted.pdf file_size: 5232761 relation: main_file success: 1 file_date_updated: 2023-11-07T08:27:23Z has_accepted_license: '1' intvolume: ' 5' isi: 1 issue: '10' language: - iso: eng month: '05' oa: 1 oa_version: Submitted Version page: 1292–1302 pmid: 1 project: - _id: 0599E47C-7A3F-11EA-A408-12923DDC885E call_identifier: H2020 grant_number: '863818' name: 'Formal Methods for Stochastic Models: Algorithms and Applications' - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' publication: Nature Human Behaviour publication_identifier: eissn: - 2397-3374 publication_status: published publisher: Springer Nature quality_controlled: '1' related_material: link: - description: News on IST Homepage relation: press_release url: https://ist.ac.at/en/news/the-emergence-of-cooperation/ record: - id: '10293' relation: dissertation_contains status: public scopus_import: '1' status: public title: A unified framework of direct and indirect reciprocity type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 5 year: '2021' ... --- _id: '9817' abstract: - lang: eng text: Elastic bending of initially flat slender elements allows the realization and economic fabrication of intriguing curved shapes. In this work, we derive an intuitive but rigorous geometric characterization of the design space of plane elastic rods with variable stiffness. It enables designers to determine which shapes are physically viable with active bending by visual inspection alone. Building on these insights, we propose a method for efficiently designing the geometry of a flat elastic rod that realizes a target equilibrium curve, which only requires solving a linear program. We implement this method in an interactive computational design tool that gives feedback about the feasibility of a design, and computes the geometry of the structural elements necessary to realize it within an instant. The tool also offers an iterative optimization routine that improves the fabricability of a model while modifying it as little as possible. In addition, we use our geometric characterization to derive an algorithm for analyzing and recovering the stability of elastic curves that would otherwise snap out of their unstable equilibrium shapes by buckling. We show the efficacy of our approach by designing and manufacturing several physical models that are assembled from flat elements. acknowledgement: "We thank the anonymous reviewers for their generous feedback, and Michal Piovarči for his help in producing the supplemental video. This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 715767).\r\n" article_number: '126' article_processing_charge: No article_type: original author: - first_name: Christian full_name: Hafner, Christian id: 400429CC-F248-11E8-B48F-1D18A9856A87 last_name: Hafner - first_name: Bernd full_name: Bickel, Bernd id: 49876194-F248-11E8-B48F-1D18A9856A87 last_name: Bickel orcid: 0000-0001-6511-9385 citation: ama: Hafner C, Bickel B. The design space of plane elastic curves. ACM Transactions on Graphics. 2021;40(4). doi:10.1145/3450626.3459800 apa: 'Hafner, C., & Bickel, B. (2021). The design space of plane elastic curves. ACM Transactions on Graphics. Virtual: Association for Computing Machinery. https://doi.org/10.1145/3450626.3459800' chicago: Hafner, Christian, and Bernd Bickel. “The Design Space of Plane Elastic Curves.” ACM Transactions on Graphics. Association for Computing Machinery, 2021. https://doi.org/10.1145/3450626.3459800. ieee: C. Hafner and B. Bickel, “The design space of plane elastic curves,” ACM Transactions on Graphics, vol. 40, no. 4. Association for Computing Machinery, 2021. ista: Hafner C, Bickel B. 2021. The design space of plane elastic curves. ACM Transactions on Graphics. 40(4), 126. mla: Hafner, Christian, and Bernd Bickel. “The Design Space of Plane Elastic Curves.” ACM Transactions on Graphics, vol. 40, no. 4, 126, Association for Computing Machinery, 2021, doi:10.1145/3450626.3459800. short: C. Hafner, B. Bickel, ACM Transactions on Graphics 40 (2021). conference: end_date: 2021-08-13 location: Virtual name: 'SIGGRAF: Special Interest Group on Computer Graphics and Interactive Techniques' start_date: 2021-08-09 date_created: 2021-08-08T22:01:26Z date_published: 2021-07-19T00:00:00Z date_updated: 2024-03-27T23:30:45Z day: '19' ddc: - '516' department: - _id: BeBi doi: 10.1145/3450626.3459800 ec_funded: 1 external_id: isi: - '000674930900091' file: - access_level: open_access checksum: 7e5d08ce46b0451b3102eacd3d00f85f content_type: application/pdf creator: chafner date_created: 2021-10-18T10:42:15Z date_updated: 2021-10-18T10:42:15Z file_id: '10150' file_name: elastic-curves-paper.pdf file_size: 17064290 relation: main_file success: 1 - access_level: open_access checksum: 0088643478be7c01a703b5b10767348f content_type: application/pdf creator: chafner date_created: 2021-10-18T10:42:22Z date_updated: 2021-10-18T10:42:22Z file_id: '10151' file_name: elastic-curves-supp.pdf file_size: 547156 relation: supplementary_material file_date_updated: 2021-10-18T10:42:22Z has_accepted_license: '1' intvolume: ' 40' isi: 1 issue: '4' keyword: - Computing methodologies - shape modeling - modeling and simulation - theory of computation - computational geometry - mathematics of computing - mathematical optimization language: - iso: eng month: '07' oa: 1 oa_version: Published Version project: - _id: 24F9549A-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '715767' name: 'MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling' publication: ACM Transactions on Graphics publication_identifier: eissn: - 1557-7368 issn: - 0730-0301 publication_status: published publisher: Association for Computing Machinery quality_controlled: '1' related_material: link: - description: News on IST Website relation: press_release url: https://ist.ac.at/en/news/designing-with-elastic-structures/ record: - id: '12897' relation: dissertation_contains status: public scopus_import: '1' status: public title: The design space of plane elastic curves tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 40 year: '2021' ... --- _id: '10135' abstract: - lang: eng text: "Plants maintain the capacity to develop new organs e.g. lateral roots post-embryonically throughout their whole life and thereby flexibly adapt to ever-changing environmental conditions. Plant hormones auxin and cytokinin are the main regulators of the lateral root organogenesis. Additionally to their solo activities, the interaction between auxin and\r\ncytokinin plays crucial role in fine-tuning of lateral root development and growth. In particular, cytokinin modulates auxin distribution within the developing lateral root by affecting the endomembrane trafficking of auxin transporter PIN1 and promoting its vacuolar degradation (Marhavý et al., 2011, 2014). This effect is independent of transcription and\r\ntranslation. Therefore, it suggests novel, non-canonical cytokinin activity occuring possibly on the posttranslational level. Impact of cytokinin and other plant hormones on auxin transporters (including PIN1) on the posttranslational level is described in detail in the introduction part of this thesis in a form of a review (Semeradova et al., 2020). To gain insights into the molecular machinery underlying cytokinin effect on the endomembrane trafficking in the plant cell, in particular on the PIN1 degradation, we conducted two large proteomic screens: 1) Identification of cytokinin binding proteins using\r\nchemical proteomics. 2) Monitoring of proteomic and phosphoproteomic changes upon cytokinin treatment. In the first screen, we identified DYNAMIN RELATED PROTEIN 2A (DRP2A). We found that DRP2A plays a role in cytokinin regulated processes during the plant growth and that cytokinin treatment promotes destabilization of DRP2A protein. However, the role of DRP2A in the PIN1 degradation remains to be elucidated. In the second screen, we found VACUOLAR PROTEIN SORTING 9A (VPS9A). VPS9a plays crucial role in plant’s response to cytokin and in cytokinin mediated PIN1 degradation. Altogether, we identified proteins, which bind to cytokinin and proteins that in response to\r\ncytokinin exhibit significantly changed abundance or phosphorylation pattern. By combining information from these two screens, we can pave our way towards understanding of noncanonical cytokinin effects." alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Hana full_name: Semerádová, Hana id: 42FE702E-F248-11E8-B48F-1D18A9856A87 last_name: Semerádová citation: ama: Semerádová H. Molecular mechanisms of the cytokinin-regulated endomembrane trafficking to coordinate plant organogenesis. 2021. doi:10.15479/at:ista:10135 apa: Semerádová, H. (2021). Molecular mechanisms of the cytokinin-regulated endomembrane trafficking to coordinate plant organogenesis. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:10135 chicago: Semerádová, Hana. “Molecular Mechanisms of the Cytokinin-Regulated Endomembrane Trafficking to Coordinate Plant Organogenesis.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:10135. ieee: H. Semerádová, “Molecular mechanisms of the cytokinin-regulated endomembrane trafficking to coordinate plant organogenesis,” Institute of Science and Technology Austria, 2021. ista: Semerádová H. 2021. Molecular mechanisms of the cytokinin-regulated endomembrane trafficking to coordinate plant organogenesis. Institute of Science and Technology Austria. mla: Semerádová, Hana. Molecular Mechanisms of the Cytokinin-Regulated Endomembrane Trafficking to Coordinate Plant Organogenesis. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:10135. short: H. Semerádová, Molecular Mechanisms of the Cytokinin-Regulated Endomembrane Trafficking to Coordinate Plant Organogenesis, Institute of Science and Technology Austria, 2021. date_created: 2021-10-13T13:42:48Z date_published: 2021-10-13T00:00:00Z date_updated: 2024-01-25T10:53:29Z day: '13' ddc: - '570' degree_awarded: PhD department: - _id: GradSch - _id: EvBe doi: 10.15479/at:ista:10135 file: - access_level: closed checksum: ce7108853e6cec6224f17cd6429b51fe content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document creator: cziletti date_created: 2021-10-27T07:45:37Z date_updated: 2022-12-20T23:30:05Z embargo_to: open_access file_id: '10186' file_name: Hana_Semeradova_Disertation_Thesis_II_Revised_3.docx file_size: 28508629 relation: source_file - access_level: open_access checksum: 0d7afb846e8e31ec794de47bf44e12ef content_type: application/pdf creator: cziletti date_created: 2021-10-27T07:45:57Z date_updated: 2022-12-20T23:30:05Z embargo: 2022-10-28 file_id: '10187' file_name: Hana_Semeradova_Disertation_Thesis_II_Revised_3PDFA.pdf file_size: 10623525 relation: main_file file_date_updated: 2022-12-20T23:30:05Z has_accepted_license: '1' language: - iso: eng month: '10' oa: 1 oa_version: Published Version project: - _id: 261821BC-B435-11E9-9278-68D0E5697425 grant_number: '24746' name: Molecular mechanisms of the cytokinin regulated endomembrane trafficking to coordinate plant organogenesis. publication_identifier: isbn: - 978-3-99078-014-5 issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '9160' relation: part_of_dissertation status: public status: public supervisor: - first_name: Eva full_name: Benková, Eva id: 38F4F166-F248-11E8-B48F-1D18A9856A87 last_name: Benková orcid: 0000-0002-8510-9739 title: Molecular mechanisms of the cytokinin-regulated endomembrane trafficking to coordinate plant organogenesis type: dissertation user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2021' ... --- _id: '9728' abstract: - lang: eng text: "Most real-world flows are multiphase, yet we know little about them compared to their single-phase counterparts. Multiphase flows are more difficult to investigate as their dynamics occur in large parameter space and involve complex phenomena such as preferential concentration, turbulence modulation, non-Newtonian rheology, etc. Over the last few decades, experiments in particle-laden flows have taken a back seat in favour of ever-improving computational resources. However, computers are still not powerful enough to simulate a real-world fluid with millions of finite-size particles. Experiments are essential not only because they offer a reliable way to investigate real-world multiphase flows but also because they serve to validate numerical studies and steer the research in a relevant direction. In this work, we have experimentally investigated particle-laden flows in pipes, and in particular, examined the effect of particles on the laminar-turbulent transition and the drag scaling in turbulent flows.\r\n\r\nFor particle-laden pipe flows, an earlier study [Matas et al., 2003] reported how the sub-critical (i.e., hysteretic) transition that occurs via localised turbulent structures called puffs is affected by the addition of particles. In this study, in addition to this known transition, we found a super-critical transition to a globally fluctuating state with increasing particle concentration. At the same time, the Newtonian-type transition via puffs is delayed to larger Reynolds numbers. At an even higher concentration, only the globally fluctuating state is found. The dynamics of particle-laden flows are hence determined by two competing instabilities that give rise to three flow regimes: Newtonian-type turbulence at low, a particle-induced globally fluctuating state at high, and a coexistence state at intermediate concentrations.\r\n\r\nThe effect of particles on turbulent drag is ambiguous, with studies reporting drag reduction, no net change, and even drag increase. The ambiguity arises because, in addition to particle concentration, particle shape, size, and density also affect the net drag. Even similar particles might affect the flow dissimilarly in different Reynolds number and concentration ranges. In the present study, we explored a wide range of both Reynolds number and concentration, using spherical as well as cylindrical particles. We found that the spherical particles do not reduce drag while the cylindrical particles are drag-reducing within a specific Reynolds number interval. The interval strongly depends on the particle concentration and the relative size of the pipe and particles. Within this interval, the magnitude of drag reduction reaches a maximum. These drag reduction maxima appear to fall onto a distinct power-law curve irrespective of the pipe diameter and particle concentration, and this curve can be considered as the maximum drag reduction asymptote for a given fibre shape. Such an asymptote is well known for polymeric flows but had not been identified for particle-laden flows prior to this work." acknowledged_ssus: - _id: M-Shop alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Nishchal full_name: Agrawal, Nishchal id: 469E6004-F248-11E8-B48F-1D18A9856A87 last_name: Agrawal citation: ama: Agrawal N. Transition to turbulence and drag reduction in particle-laden pipe flows. 2021. doi:10.15479/at:ista:9728 apa: Agrawal, N. (2021). Transition to turbulence and drag reduction in particle-laden pipe flows. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:9728 chicago: Agrawal, Nishchal. “Transition to Turbulence and Drag Reduction in Particle-Laden Pipe Flows.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:9728. ieee: N. Agrawal, “Transition to turbulence and drag reduction in particle-laden pipe flows,” Institute of Science and Technology Austria, 2021. ista: Agrawal N. 2021. Transition to turbulence and drag reduction in particle-laden pipe flows. Institute of Science and Technology Austria. mla: Agrawal, Nishchal. Transition to Turbulence and Drag Reduction in Particle-Laden Pipe Flows. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:9728. short: N. Agrawal, Transition to Turbulence and Drag Reduction in Particle-Laden Pipe Flows, Institute of Science and Technology Austria, 2021. date_created: 2021-07-27T13:40:30Z date_published: 2021-07-29T00:00:00Z date_updated: 2024-02-28T13:14:39Z day: '29' ddc: - '532' degree_awarded: PhD department: - _id: GradSch - _id: BjHo doi: 10.15479/at:ista:9728 file: - access_level: closed checksum: 77436be3563a90435024307b1b5ee7e8 content_type: application/x-zip-compressed creator: nagrawal date_created: 2021-07-28T13:32:02Z date_updated: 2022-07-29T22:30:05Z embargo_to: open_access file_id: '9744' file_name: Transition to Turbulence and Drag Reduction in Particle-Laden Pipe Flows.zip file_size: 22859658 relation: source_file - access_level: open_access checksum: 72a891d7daba85445c29b868c22575ed content_type: application/pdf creator: nagrawal date_created: 2021-07-28T13:32:05Z date_updated: 2022-07-29T22:30:05Z embargo: 2022-07-28 file_id: '9745' file_name: Transition to Turbulence and Drag Reduction in Particle-Laden Pipe Flows.pdf file_size: 18658048 relation: main_file file_date_updated: 2022-07-29T22:30:05Z has_accepted_license: '1' keyword: - Drag Reduction - Transition to Turbulence - Multiphase Flows - particle Laden Flows - Complex Flows - Experiments - Fluid Dynamics language: - iso: eng month: '07' oa: 1 oa_version: Published Version page: '118' publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '6189' relation: part_of_dissertation status: public status: public supervisor: - first_name: Björn full_name: Hof, Björn id: 3A374330-F248-11E8-B48F-1D18A9856A87 last_name: Hof orcid: 0000-0003-2057-2754 title: Transition to turbulence and drag reduction in particle-laden pipe flows tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: dissertation user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 year: '2021' ... --- _id: '10673' abstract: - lang: eng text: We propose a neural information processing system obtained by re-purposing the function of a biological neural circuit model to govern simulated and real-world control tasks. Inspired by the structure of the nervous system of the soil-worm, C. elegans, we introduce ordinary neural circuits (ONCs), defined as the model of biological neural circuits reparameterized for the control of alternative tasks. We first demonstrate that ONCs realize networks with higher maximum flow compared to arbitrary wired networks. We then learn instances of ONCs to control a series of robotic tasks, including the autonomous parking of a real-world rover robot. For reconfiguration of the purpose of the neural circuit, we adopt a search-based optimization algorithm. Ordinary neural circuits perform on par and, in some cases, significantly surpass the performance of contemporary deep learning models. ONC networks are compact, 77% sparser than their counterpart neural controllers, and their neural dynamics are fully interpretable at the cell-level. acknowledgement: "RH and RG are partially supported by Horizon-2020 ECSEL Project grant No. 783163 (iDev40), Productive 4.0, and ATBMBFW CPS-IoT Ecosystem. ML was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23\r\n(Wittgenstein Award). AA is supported by the National Science Foundation (NSF) Graduate Research Fellowship\r\nProgram. RH and DR are partially supported by The Boeing Company and JP Morgan Chase. This research work is\r\npartially drawn from the PhD dissertation of RH.\r\n" alternative_title: - PMLR article_processing_charge: No author: - first_name: Ramin full_name: Hasani, Ramin last_name: Hasani - first_name: Mathias full_name: Lechner, Mathias id: 3DC22916-F248-11E8-B48F-1D18A9856A87 last_name: Lechner - first_name: Alexander full_name: Amini, Alexander last_name: Amini - first_name: Daniela full_name: Rus, Daniela last_name: Rus - first_name: Radu full_name: Grosu, Radu last_name: Grosu citation: ama: 'Hasani R, Lechner M, Amini A, Rus D, Grosu R. A natural lottery ticket winner: Reinforcement learning with ordinary neural circuits. In: Proceedings of the 37th International Conference on Machine Learning. PMLR. ; 2020:4082-4093.' apa: 'Hasani, R., Lechner, M., Amini, A., Rus, D., & Grosu, R. (2020). A natural lottery ticket winner: Reinforcement learning with ordinary neural circuits. In Proceedings of the 37th International Conference on Machine Learning (pp. 4082–4093). Virtual.' chicago: 'Hasani, Ramin, Mathias Lechner, Alexander Amini, Daniela Rus, and Radu Grosu. “A Natural Lottery Ticket Winner: Reinforcement Learning with Ordinary Neural Circuits.” In Proceedings of the 37th International Conference on Machine Learning, 4082–93. PMLR, 2020.' ieee: 'R. Hasani, M. Lechner, A. Amini, D. Rus, and R. Grosu, “A natural lottery ticket winner: Reinforcement learning with ordinary neural circuits,” in Proceedings of the 37th International Conference on Machine Learning, Virtual, 2020, pp. 4082–4093.' ista: 'Hasani R, Lechner M, Amini A, Rus D, Grosu R. 2020. A natural lottery ticket winner: Reinforcement learning with ordinary neural circuits. Proceedings of the 37th International Conference on Machine Learning. ML: Machine LearningPMLR, PMLR, , 4082–4093.' mla: 'Hasani, Ramin, et al. “A Natural Lottery Ticket Winner: Reinforcement Learning with Ordinary Neural Circuits.” Proceedings of the 37th International Conference on Machine Learning, 2020, pp. 4082–93.' short: R. Hasani, M. Lechner, A. Amini, D. Rus, R. Grosu, in:, Proceedings of the 37th International Conference on Machine Learning, 2020, pp. 4082–4093. conference: end_date: 2020-07-18 location: Virtual name: 'ML: Machine Learning' start_date: 2020-07-12 date_created: 2022-01-25T15:50:34Z date_published: 2020-01-01T00:00:00Z date_updated: 2022-01-26T11:14:27Z ddc: - '000' department: - _id: GradSch - _id: ToHe file: - access_level: open_access checksum: c9a4a29161777fc1a89ef451c040e3b1 content_type: application/pdf creator: cchlebak date_created: 2022-01-26T11:08:51Z date_updated: 2022-01-26T11:08:51Z file_id: '10691' file_name: 2020_PMLR_Hasani.pdf file_size: 2329798 relation: main_file success: 1 file_date_updated: 2022-01-26T11:08:51Z has_accepted_license: '1' language: - iso: eng license: https://creativecommons.org/licenses/by-nc-nd/3.0/ main_file_link: - open_access: '1' url: http://proceedings.mlr.press/v119/hasani20a.html oa: 1 oa_version: Published Version page: 4082-4093 project: - _id: 25F42A32-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z211 name: The Wittgenstein Prize publication: Proceedings of the 37th International Conference on Machine Learning publication_identifier: issn: - 2640-3498 publication_status: published quality_controlled: '1' scopus_import: '1' series_title: PMLR status: public title: 'A natural lottery ticket winner: Reinforcement learning with ordinary neural circuits' tmp: image: /images/cc_by_nc_nd.png legal_code_url: https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode name: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0) short: CC BY-NC-ND (3.0) type: conference user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2020' ... --- _id: '7272' abstract: - lang: eng text: "Many systems rely on optimistic concurrent search trees for multi-core scalability. In principle, optimistic trees have a simple performance story: searches are read-only and so run in parallel, with writes to shared memory occurring only when modifying the data structure. However, this paper shows that in practice, obtaining the full performance benefits of optimistic search trees is not so simple.\r\n\r\nWe focus on optimistic binary search trees (BSTs) and perform a detailed performance analysis of 10 state-of-the-art BSTs on large scale x86-64 hardware, using both microbenchmarks and an in-memory database system. We find and explain significant unexpected performance differences between BSTs with similar tree structure and search implementations, which we trace to subtle performance-degrading interactions of BSTs with systems software and hardware subsystems. We further derive a prescriptive approach to avoid this performance degradation, as well as algorithmic insights on optimistic BST design. Our work underlines the gap between the theory and practice of multi-core performance, and calls for further research to help bridge this gap." article_processing_charge: No author: - first_name: Maya full_name: Arbel-Raviv, Maya last_name: Arbel-Raviv - first_name: Trevor A full_name: Brown, Trevor A id: 3569F0A0-F248-11E8-B48F-1D18A9856A87 last_name: Brown - first_name: Adam full_name: Morrison, Adam last_name: Morrison citation: ama: 'Arbel-Raviv M, Brown TA, Morrison A. Getting to the root of concurrent binary search tree performance. In: Proceedings of the 2018 USENIX Annual Technical Conference. USENIX Association; 2020:295-306.' apa: 'Arbel-Raviv, M., Brown, T. A., & Morrison, A. (2020). Getting to the root of concurrent binary search tree performance. In Proceedings of the 2018 USENIX Annual Technical Conference (pp. 295–306). Boston, MA, United States: USENIX Association.' chicago: Arbel-Raviv, Maya, Trevor A Brown, and Adam Morrison. “Getting to the Root of Concurrent Binary Search Tree Performance.” In Proceedings of the 2018 USENIX Annual Technical Conference, 295–306. USENIX Association, 2020. ieee: M. Arbel-Raviv, T. A. Brown, and A. Morrison, “Getting to the root of concurrent binary search tree performance,” in Proceedings of the 2018 USENIX Annual Technical Conference, Boston, MA, United States, 2020, pp. 295–306. ista: 'Arbel-Raviv M, Brown TA, Morrison A. 2020. Getting to the root of concurrent binary search tree performance. Proceedings of the 2018 USENIX Annual Technical Conference. USENIX: Annual Technical Conference, 295–306.' mla: Arbel-Raviv, Maya, et al. “Getting to the Root of Concurrent Binary Search Tree Performance.” Proceedings of the 2018 USENIX Annual Technical Conference, USENIX Association, 2020, pp. 295–306. short: M. Arbel-Raviv, T.A. Brown, A. Morrison, in:, Proceedings of the 2018 USENIX Annual Technical Conference, USENIX Association, 2020, pp. 295–306. conference: end_date: 2018-07-13 location: Boston, MA, United States name: 'USENIX: Annual Technical Conference' start_date: 2018-07-11 date_created: 2020-01-14T07:27:08Z date_published: 2020-01-01T00:00:00Z date_updated: 2021-01-11T15:25:48Z day: '01' ddc: - '000' department: - _id: DaAl language: - iso: eng main_file_link: - open_access: '1' url: https://www.usenix.org/system/files/conference/atc18/atc18-arbel-raviv.pdf month: '01' oa: 1 oa_version: Published Version page: 295-306 project: - _id: 26450934-B435-11E9-9278-68D0E5697425 name: NSERC Postdoctoral fellowship publication: Proceedings of the 2018 USENIX Annual Technical Conference publication_identifier: isbn: - '9781939133021' publication_status: published publisher: USENIX Association quality_controlled: '1' scopus_import: '1' status: public title: Getting to the root of concurrent binary search tree performance type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2020' ... --- _id: '7346' abstract: - lang: eng text: 'The Price of Anarchy (PoA) is a well-established game-theoretic concept to shed light on coordination issues arising in open distributed systems. Leaving agents to selfishly optimize comes with the risk of ending up in sub-optimal states (in terms of performance and/or costs), compared to a centralized system design. However, the PoA relies on strong assumptions about agents'' rationality (e.g., resources and information) and interactions, whereas in many distributed systems agents interact locally with bounded resources. They do so repeatedly over time (in contrast to "one-shot games"), and their strategies may evolve. Using a more realistic evolutionary game model, this paper introduces a realized evolutionary Price of Anarchy (ePoA). The ePoA allows an exploration of equilibrium selection in dynamic distributed systems with multiple equilibria, based on local interactions of simple memoryless agents. Considering a fundamental game related to virus propagation on networks, we present analytical bounds on the ePoA in basic network topologies and for different strategy update dynamics. In particular, deriving stationary distributions of the stochastic evolutionary process, we find that the Nash equilibria are not always the most abundant states, and that different processes can feature significant off-equilibrium behavior, leading to a significantly higher ePoA compared to the PoA studied traditionally in the literature. ' alternative_title: - LIPIcs article_number: '21' article_processing_charge: No author: - first_name: Laura full_name: Schmid, Laura id: 38B437DE-F248-11E8-B48F-1D18A9856A87 last_name: Schmid orcid: 0000-0002-6978-7329 - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Stefan full_name: Schmid, Stefan last_name: Schmid citation: ama: 'Schmid L, Chatterjee K, Schmid S. The evolutionary price of anarchy: Locally bounded agents in a dynamic virus game. In: Proceedings of the 23rd International Conference on Principles of Distributed Systems. Vol 153. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.OPODIS.2019.21' apa: 'Schmid, L., Chatterjee, K., & Schmid, S. (2020). The evolutionary price of anarchy: Locally bounded agents in a dynamic virus game. In Proceedings of the 23rd International Conference on Principles of Distributed Systems (Vol. 153). Neuchâtel, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.OPODIS.2019.21' chicago: 'Schmid, Laura, Krishnendu Chatterjee, and Stefan Schmid. “The Evolutionary Price of Anarchy: Locally Bounded Agents in a Dynamic Virus Game.” In Proceedings of the 23rd International Conference on Principles of Distributed Systems, Vol. 153. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.OPODIS.2019.21.' ieee: 'L. Schmid, K. Chatterjee, and S. Schmid, “The evolutionary price of anarchy: Locally bounded agents in a dynamic virus game,” in Proceedings of the 23rd International Conference on Principles of Distributed Systems, Neuchâtel, Switzerland, 2020, vol. 153.' ista: 'Schmid L, Chatterjee K, Schmid S. 2020. The evolutionary price of anarchy: Locally bounded agents in a dynamic virus game. Proceedings of the 23rd International Conference on Principles of Distributed Systems. OPODIS: International Conference on Principles of Distributed Systems, LIPIcs, vol. 153, 21.' mla: 'Schmid, Laura, et al. “The Evolutionary Price of Anarchy: Locally Bounded Agents in a Dynamic Virus Game.” Proceedings of the 23rd International Conference on Principles of Distributed Systems, vol. 153, 21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.OPODIS.2019.21.' short: L. Schmid, K. Chatterjee, S. Schmid, in:, Proceedings of the 23rd International Conference on Principles of Distributed Systems, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. conference: end_date: 2019-12-19 location: Neuchâtel, Switzerland name: 'OPODIS: International Conference on Principles of Distributed Systems' start_date: 2019-12-17 date_created: 2020-01-21T16:00:26Z date_published: 2020-02-10T00:00:00Z date_updated: 2023-02-23T13:05:49Z day: '10' ddc: - '000' department: - _id: KrCh doi: 10.4230/LIPIcs.OPODIS.2019.21 external_id: arxiv: - '1906.00110' file: - access_level: open_access checksum: 9a91916ac2c21ab42458fcda39ef0b8d content_type: application/pdf creator: dernst date_created: 2020-03-23T09:14:06Z date_updated: 2020-07-14T12:47:56Z file_id: '7608' file_name: 2019_LIPIcS_Schmid.pdf file_size: 630752 relation: main_file file_date_updated: 2020-07-14T12:47:56Z has_accepted_license: '1' intvolume: ' 153' language: - iso: eng month: '02' oa: 1 oa_version: Preprint project: - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering publication: Proceedings of the 23rd International Conference on Principles of Distributed Systems publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: '1' status: public title: 'The evolutionary price of anarchy: Locally bounded agents in a dynamic virus game' tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 153 year: '2020' ... --- _id: '7348' abstract: - lang: eng text: 'The monitoring of event frequencies can be used to recognize behavioral anomalies, to identify trends, and to deduce or discard hypotheses about the underlying system. For example, the performance of a web server may be monitored based on the ratio of the total count of requests from the least and most active clients. Exact frequency monitoring, however, can be prohibitively expensive; in the above example it would require as many counters as there are clients. In this paper, we propose the efficient probabilistic monitoring of common frequency properties, including the mode (i.e., the most common event) and the median of an event sequence. We define a logic to express composite frequency properties as a combination of atomic frequency properties. Our main contribution is an algorithm that, under suitable probabilistic assumptions, can be used to monitor these important frequency properties with four counters, independent of the number of different events. Our algorithm samples longer and longer subwords of an infinite event sequence. We prove the almost-sure convergence of our algorithm by generalizing ergodic theory from increasing-length prefixes to increasing-length subwords of an infinite sequence. A similar algorithm could be used to learn a connected Markov chain of a given structure from observing its outputs, to arbitrary precision, for a given confidence. ' alternative_title: - LIPIcs article_number: '20' article_processing_charge: No author: - first_name: Thomas full_name: Ferrere, Thomas id: 40960E6E-F248-11E8-B48F-1D18A9856A87 last_name: Ferrere orcid: 0000-0001-5199-3143 - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000−0002−2985−7724 - first_name: Bernhard full_name: Kragl, Bernhard id: 320FC952-F248-11E8-B48F-1D18A9856A87 last_name: Kragl orcid: 0000-0001-7745-9117 citation: ama: 'Ferrere T, Henzinger TA, Kragl B. Monitoring event frequencies. In: 28th EACSL Annual Conference on Computer Science Logic. Vol 152. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.CSL.2020.20' apa: 'Ferrere, T., Henzinger, T. A., & Kragl, B. (2020). Monitoring event frequencies. In 28th EACSL Annual Conference on Computer Science Logic (Vol. 152). Barcelona, Spain: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CSL.2020.20' chicago: Ferrere, Thomas, Thomas A Henzinger, and Bernhard Kragl. “Monitoring Event Frequencies.” In 28th EACSL Annual Conference on Computer Science Logic, Vol. 152. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.CSL.2020.20. ieee: T. Ferrere, T. A. Henzinger, and B. Kragl, “Monitoring event frequencies,” in 28th EACSL Annual Conference on Computer Science Logic, Barcelona, Spain, 2020, vol. 152. ista: 'Ferrere T, Henzinger TA, Kragl B. 2020. Monitoring event frequencies. 28th EACSL Annual Conference on Computer Science Logic. CSL: Computer Science Logic, LIPIcs, vol. 152, 20.' mla: Ferrere, Thomas, et al. “Monitoring Event Frequencies.” 28th EACSL Annual Conference on Computer Science Logic, vol. 152, 20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.CSL.2020.20. short: T. Ferrere, T.A. Henzinger, B. Kragl, in:, 28th EACSL Annual Conference on Computer Science Logic, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. conference: end_date: 2020-01-16 location: Barcelona, Spain name: 'CSL: Computer Science Logic' start_date: 2020-01-13 date_created: 2020-01-21T11:22:21Z date_published: 2020-01-15T00:00:00Z date_updated: 2021-01-12T08:13:12Z day: '15' ddc: - '000' department: - _id: ToHe doi: 10.4230/LIPIcs.CSL.2020.20 external_id: arxiv: - '1910.06097' file: - access_level: open_access checksum: b9a691d658d075c6369d3304d17fb818 content_type: application/pdf creator: bkragl date_created: 2020-01-21T11:21:04Z date_updated: 2020-07-14T12:47:56Z file_id: '7349' file_name: main.pdf file_size: 617206 relation: main_file file_date_updated: 2020-07-14T12:47:56Z has_accepted_license: '1' intvolume: ' 152' language: - iso: eng month: '01' oa: 1 oa_version: Published Version project: - _id: 25F2ACDE-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11402-N23 name: Rigorous Systems Engineering - _id: 25F42A32-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z211 name: The Wittgenstein Prize publication: 28th EACSL Annual Conference on Computer Science Logic publication_identifier: isbn: - '9783959771320' issn: - 1868-8969 publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: 1 status: public title: Monitoring event frequencies tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 152 year: '2020' ... --- _id: '7567' abstract: - lang: eng text: Coxeter triangulations are triangulations of Euclidean space based on a single simplex. By this we mean that given an individual simplex we can recover the entire triangulation of Euclidean space by inductively reflecting in the faces of the simplex. In this paper we establish that the quality of the simplices in all Coxeter triangulations is O(1/d−−√) of the quality of regular simplex. We further investigate the Delaunay property for these triangulations. Moreover, we consider an extension of the Delaunay property, namely protection, which is a measure of non-degeneracy of a Delaunay triangulation. In particular, one family of Coxeter triangulations achieves the protection O(1/d2). We conjecture that both bounds are optimal for triangulations in Euclidean space. article_processing_charge: Yes (via OA deal) article_type: original author: - first_name: Aruni full_name: Choudhary, Aruni last_name: Choudhary - first_name: Siargey full_name: Kachanovich, Siargey last_name: Kachanovich - first_name: Mathijs full_name: Wintraecken, Mathijs id: 307CFBC8-F248-11E8-B48F-1D18A9856A87 last_name: Wintraecken orcid: 0000-0002-7472-2220 citation: ama: Choudhary A, Kachanovich S, Wintraecken M. Coxeter triangulations have good quality. Mathematics in Computer Science. 2020;14:141-176. doi:10.1007/s11786-020-00461-5 apa: Choudhary, A., Kachanovich, S., & Wintraecken, M. (2020). Coxeter triangulations have good quality. Mathematics in Computer Science. Springer Nature. https://doi.org/10.1007/s11786-020-00461-5 chicago: Choudhary, Aruni, Siargey Kachanovich, and Mathijs Wintraecken. “Coxeter Triangulations Have Good Quality.” Mathematics in Computer Science. Springer Nature, 2020. https://doi.org/10.1007/s11786-020-00461-5. ieee: A. Choudhary, S. Kachanovich, and M. Wintraecken, “Coxeter triangulations have good quality,” Mathematics in Computer Science, vol. 14. Springer Nature, pp. 141–176, 2020. ista: Choudhary A, Kachanovich S, Wintraecken M. 2020. Coxeter triangulations have good quality. Mathematics in Computer Science. 14, 141–176. mla: Choudhary, Aruni, et al. “Coxeter Triangulations Have Good Quality.” Mathematics in Computer Science, vol. 14, Springer Nature, 2020, pp. 141–76, doi:10.1007/s11786-020-00461-5. short: A. Choudhary, S. Kachanovich, M. Wintraecken, Mathematics in Computer Science 14 (2020) 141–176. date_created: 2020-03-05T13:30:18Z date_published: 2020-03-01T00:00:00Z date_updated: 2021-01-12T08:14:13Z day: '01' ddc: - '510' department: - _id: HeEd doi: 10.1007/s11786-020-00461-5 ec_funded: 1 file: - access_level: open_access checksum: 1d145f3ab50ccee735983cb89236e609 content_type: application/pdf creator: dernst date_created: 2020-11-20T10:18:02Z date_updated: 2020-11-20T10:18:02Z file_id: '8783' file_name: 2020_MathCompScie_Choudhary.pdf file_size: 872275 relation: main_file success: 1 file_date_updated: 2020-11-20T10:18:02Z has_accepted_license: '1' intvolume: ' 14' language: - iso: eng month: '03' oa: 1 oa_version: Published Version page: 141-176 project: - _id: B67AFEDC-15C9-11EA-A837-991A96BB2854 name: IST Austria Open Access Fund - _id: 260C2330-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '754411' name: ISTplus - Postdoctoral Fellowships publication: Mathematics in Computer Science publication_identifier: eissn: - 1661-8289 issn: - 1661-8270 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: Coxeter triangulations have good quality tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 14 year: '2020' ... --- _id: '7594' abstract: - lang: eng text: The concept of the entanglement between spin and orbital degrees of freedom plays a crucial role in our understanding of various phases and exotic ground states in a broad class of materials, including orbitally ordered materials and spin liquids. We investigate how the spin-orbital entanglement in a Mott insulator depends on the value of the spin-orbit coupling of the relativistic origin. To this end, we numerically diagonalize a one-dimensional spin-orbital model with Kugel-Khomskii exchange interactions between spins and orbitals on different sites supplemented by the on-site spin-orbit coupling. In the regime of small spin-orbit coupling with regard to the spin-orbital exchange, the ground state to a large extent resembles the one obtained in the limit of vanishing spin-orbit coupling. On the other hand, for large spin-orbit coupling the ground state can, depending on the model parameters, either still show negligible spin-orbital entanglement or evolve to a highly spin-orbitally-entangled phase with completely distinct properties that are described by an effective XXZ model. The presented results suggest that (i) the spin-orbital entanglement may be induced by large on-site spin-orbit coupling, as found in the 5d transition metal oxides, such as the iridates; (ii) for Mott insulators with weak spin-orbit coupling of Ising type, such as, e.g., the alkali hyperoxides, the effects of the spin-orbit coupling on the ground state can, in the first order of perturbation theory, be neglected. article_number: '013353' article_processing_charge: No article_type: original author: - first_name: Dorota full_name: Gotfryd, Dorota last_name: Gotfryd - first_name: Ekaterina full_name: Paerschke, Ekaterina id: 8275014E-6063-11E9-9B7F-6338E6697425 last_name: Paerschke orcid: 0000-0003-0853-8182 - first_name: Jiri full_name: Chaloupka, Jiri last_name: Chaloupka - first_name: Andrzej M. full_name: Oles, Andrzej M. last_name: Oles - first_name: Krzysztof full_name: Wohlfeld, Krzysztof last_name: Wohlfeld citation: ama: Gotfryd D, Paerschke E, Chaloupka J, Oles AM, Wohlfeld K. How spin-orbital entanglement depends on the spin-orbit coupling in a Mott insulator. Physical Review Research. 2020;2(1). doi:10.1103/PhysRevResearch.2.013353 apa: Gotfryd, D., Paerschke, E., Chaloupka, J., Oles, A. M., & Wohlfeld, K. (2020). How spin-orbital entanglement depends on the spin-orbit coupling in a Mott insulator. Physical Review Research. American Physical Society. https://doi.org/10.1103/PhysRevResearch.2.013353 chicago: Gotfryd, Dorota, Ekaterina Paerschke, Jiri Chaloupka, Andrzej M. Oles, and Krzysztof Wohlfeld. “How Spin-Orbital Entanglement Depends on the Spin-Orbit Coupling in a Mott Insulator.” Physical Review Research. American Physical Society, 2020. https://doi.org/10.1103/PhysRevResearch.2.013353. ieee: D. Gotfryd, E. Paerschke, J. Chaloupka, A. M. Oles, and K. Wohlfeld, “How spin-orbital entanglement depends on the spin-orbit coupling in a Mott insulator,” Physical Review Research, vol. 2, no. 1. American Physical Society, 2020. ista: Gotfryd D, Paerschke E, Chaloupka J, Oles AM, Wohlfeld K. 2020. How spin-orbital entanglement depends on the spin-orbit coupling in a Mott insulator. Physical Review Research. 2(1), 013353. mla: Gotfryd, Dorota, et al. “How Spin-Orbital Entanglement Depends on the Spin-Orbit Coupling in a Mott Insulator.” Physical Review Research, vol. 2, no. 1, 013353, American Physical Society, 2020, doi:10.1103/PhysRevResearch.2.013353. short: D. Gotfryd, E. Paerschke, J. Chaloupka, A.M. Oles, K. Wohlfeld, Physical Review Research 2 (2020). date_created: 2020-03-20T15:21:10Z date_published: 2020-03-20T00:00:00Z date_updated: 2021-01-12T08:14:23Z day: '20' ddc: - '530' department: - _id: MiLe doi: 10.1103/PhysRevResearch.2.013353 ec_funded: 1 file: - access_level: open_access checksum: 1be551fd5f5583635076017d7391ffdc content_type: application/pdf creator: dernst date_created: 2020-03-23T10:18:38Z date_updated: 2020-07-14T12:48:00Z file_id: '7610' file_name: 2020_PhysRevResearch_Gotfryd.pdf file_size: 1436735 relation: main_file file_date_updated: 2020-07-14T12:48:00Z has_accepted_license: '1' intvolume: ' 2' issue: '1' language: - iso: eng month: '03' oa: 1 oa_version: Published Version project: - _id: 260C2330-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '754411' name: ISTplus - Postdoctoral Fellowships publication: Physical Review Research publication_status: published publisher: American Physical Society quality_controlled: '1' status: public title: How spin-orbital entanglement depends on the spin-orbit coupling in a Mott insulator tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 2 year: '2020' ... --- _id: '7605' abstract: - lang: eng text: 'Union-Find (or Disjoint-Set Union) is one of the fundamental problems in computer science; it has been well-studied from both theoretical and practical perspectives in the sequential case. Recently, there has been mounting interest in analyzing this problem in the concurrent scenario, and several asymptotically-efficient algorithms have been proposed. Yet, to date, there is very little known about the practical performance of concurrent Union-Find. This work addresses this gap. We evaluate and analyze the performance of several concurrent Union-Find algorithms and optimization strategies across a wide range of platforms (Intel, AMD, and ARM) and workloads (social, random, and road networks, as well as integrations into more complex algorithms). We first observe that, due to the limited computational cost, the number of induced cache misses is the critical determining factor for the performance of existing algorithms. We introduce new techniques to reduce this cost by storing node priorities implicitly and by using plain reads and writes in a way that does not affect the correctness of the algorithms. Finally, we show that Union-Find implementations are an interesting application for Transactional Memory (TM): one of the fastest algorithm variants we discovered is a sequential one that uses coarse-grained locking with the lock elision optimization to reduce synchronization cost and increase scalability. ' alternative_title: - LIPIcs article_processing_charge: No author: - first_name: Dan-Adrian full_name: Alistarh, Dan-Adrian id: 4A899BFC-F248-11E8-B48F-1D18A9856A87 last_name: Alistarh orcid: 0000-0003-3650-940X - first_name: Alexander full_name: Fedorov, Alexander last_name: Fedorov - first_name: Nikita full_name: Koval, Nikita id: 2F4DB10C-F248-11E8-B48F-1D18A9856A87 last_name: Koval citation: ama: 'Alistarh D-A, Fedorov A, Koval N. In search of the fastest concurrent union-find algorithm. In: 23rd International Conference on Principles of Distributed Systems. Vol 153. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020:15:1-15:16. doi:10.4230/LIPIcs.OPODIS.2019.15' apa: 'Alistarh, D.-A., Fedorov, A., & Koval, N. (2020). In search of the fastest concurrent union-find algorithm. In 23rd International Conference on Principles of Distributed Systems (Vol. 153, p. 15:1-15:16). Neuchatal, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.OPODIS.2019.15' chicago: Alistarh, Dan-Adrian, Alexander Fedorov, and Nikita Koval. “In Search of the Fastest Concurrent Union-Find Algorithm.” In 23rd International Conference on Principles of Distributed Systems, 153:15:1-15:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.OPODIS.2019.15. ieee: D.-A. Alistarh, A. Fedorov, and N. Koval, “In search of the fastest concurrent union-find algorithm,” in 23rd International Conference on Principles of Distributed Systems, Neuchatal, Switzerland, 2020, vol. 153, p. 15:1-15:16. ista: 'Alistarh D-A, Fedorov A, Koval N. 2020. In search of the fastest concurrent union-find algorithm. 23rd International Conference on Principles of Distributed Systems. OPODIS: International Conference on Principles of Distributed Systems, LIPIcs, vol. 153, 15:1-15:16.' mla: Alistarh, Dan-Adrian, et al. “In Search of the Fastest Concurrent Union-Find Algorithm.” 23rd International Conference on Principles of Distributed Systems, vol. 153, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, p. 15:1-15:16, doi:10.4230/LIPIcs.OPODIS.2019.15. short: D.-A. Alistarh, A. Fedorov, N. Koval, in:, 23rd International Conference on Principles of Distributed Systems, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, p. 15:1-15:16. conference: end_date: 2019-12-19 location: Neuchatal, Switzerland name: 'OPODIS: International Conference on Principles of Distributed Systems' start_date: 2019-12-17 date_created: 2020-03-22T23:00:46Z date_published: 2020-02-01T00:00:00Z date_updated: 2023-02-23T13:12:12Z day: '01' ddc: - '000' department: - _id: DaAl doi: 10.4230/LIPIcs.OPODIS.2019.15 external_id: arxiv: - '1911.06347' file: - access_level: open_access checksum: d66f07ecb609d9f02433e39f80a447e9 content_type: application/pdf creator: dernst date_created: 2020-03-23T09:22:48Z date_updated: 2020-07-14T12:48:01Z file_id: '7609' file_name: 2019_LIPIcs_Alistarh.pdf file_size: 13074131 relation: main_file file_date_updated: 2020-07-14T12:48:01Z has_accepted_license: '1' intvolume: ' 153' language: - iso: eng license: https://creativecommons.org/licenses/by/3.0/ month: '02' oa: 1 oa_version: Published Version page: 15:1-15:16 publication: 23rd International Conference on Principles of Distributed Systems publication_identifier: isbn: - '9783959771337' issn: - '18688969' publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: '1' status: public title: In search of the fastest concurrent union-find algorithm tmp: image: /images/cc_by.png 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) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 153 year: '2020' ... --- _id: '7601' abstract: - lang: eng text: Plasmodesmata (PD) are crucial structures for intercellular communication in multicellular plants with remorins being their crucial plant-specific structural and functional constituents. The PD biogenesis is an intriguing but poorly understood process. By expressing an Arabidopsis remorin protein in mammalian cells, we have reconstituted a PD-like filamentous structure, termed remorin filament (RF), connecting neighboring cells physically and physiologically. Notably, RFs are capable of transporting macromolecules intercellularly, in a way similar to plant PD. With further super-resolution microscopic analysis and biochemical characterization, we found that RFs are also composed of actin filaments, forming the core skeleton structure, aligned with the remorin protein. This unique heterologous filamentous structure might explain the molecular mechanism for remorin function as well as PD construction. Furthermore, remorin protein exhibits a specific distribution manner in the plasma membrane in mammalian cells, representing a lipid nanodomain, depending on its lipid modification status. Our studies not only provide crucial insights into the mechanism of PD biogenesis, but also uncovers unsuspected fundamental mechanistic and evolutionary links between intercellular communication systems of plants and animals. article_processing_charge: No author: - first_name: Zhuang full_name: Wei, Zhuang last_name: Wei - first_name: Shutang full_name: Tan, Shutang id: 2DE75584-F248-11E8-B48F-1D18A9856A87 last_name: Tan orcid: 0000-0002-0471-8285 - first_name: Tao full_name: Liu, Tao last_name: Liu - first_name: Yuan full_name: Wu, Yuan last_name: Wu - first_name: Ji-Gang full_name: Lei, Ji-Gang last_name: Lei - first_name: ZhengJun full_name: Chen, ZhengJun last_name: Chen - first_name: Jiří full_name: Friml, Jiří id: 4159519E-F248-11E8-B48F-1D18A9856A87 last_name: Friml orcid: 0000-0002-8302-7596 - first_name: Hong-Wei full_name: Xue, Hong-Wei last_name: Xue - first_name: Kan full_name: Liao, Kan last_name: Liao citation: ama: Wei Z, Tan S, Liu T, et al. Plasmodesmata-like intercellular connections by plant remorin in animal cells. bioRxiv. 2020. doi:10.1101/791137 apa: Wei, Z., Tan, S., Liu, T., Wu, Y., Lei, J.-G., Chen, Z., … Liao, K. (2020). Plasmodesmata-like intercellular connections by plant remorin in animal cells. bioRxiv. Cold Spring Harbor Laboratory. https://doi.org/10.1101/791137 chicago: Wei, Zhuang, Shutang Tan, Tao Liu, Yuan Wu, Ji-Gang Lei, ZhengJun Chen, Jiří Friml, Hong-Wei Xue, and Kan Liao. “Plasmodesmata-like Intercellular Connections by Plant Remorin in Animal Cells.” BioRxiv. Cold Spring Harbor Laboratory, 2020. https://doi.org/10.1101/791137. ieee: Z. Wei et al., “Plasmodesmata-like intercellular connections by plant remorin in animal cells,” bioRxiv. Cold Spring Harbor Laboratory, 2020. ista: Wei Z, Tan S, Liu T, Wu Y, Lei J-G, Chen Z, Friml J, Xue H-W, Liao K. 2020. Plasmodesmata-like intercellular connections by plant remorin in animal cells. bioRxiv, 10.1101/791137. mla: Wei, Zhuang, et al. “Plasmodesmata-like Intercellular Connections by Plant Remorin in Animal Cells.” BioRxiv, Cold Spring Harbor Laboratory, 2020, doi:10.1101/791137. short: Z. Wei, S. Tan, T. Liu, Y. Wu, J.-G. Lei, Z. Chen, J. Friml, H.-W. Xue, K. Liao, BioRxiv (2020). date_created: 2020-03-21T16:34:42Z date_published: 2020-02-19T00:00:00Z date_updated: 2021-01-12T08:14:26Z day: '19' department: - _id: JiFr doi: 10.1101/791137 language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1101/791137 month: '02' oa: 1 oa_version: Preprint page: '22' publication: bioRxiv publication_status: published publisher: Cold Spring Harbor Laboratory status: public title: Plasmodesmata-like intercellular connections by plant remorin in animal cells type: preprint user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2020' ... --- _id: '7651' abstract: - lang: eng text: The growth of snail shells can be described by simple mathematical rules. Variation in a few parameters can explain much of the diversity of shell shapes seen in nature. However, empirical studies of gastropod shell shape variation typically use geometric morphometric approaches, which do not capture this growth pattern. We have developed a way to infer a set of developmentally descriptive shape parameters based on three-dimensional logarithmic helicospiral growth and using landmarks from two-dimensional shell images as input. We demonstrate the utility of this approach, and compare it to the geometric morphometric approach, using a large set of Littorina saxatilis shells in which locally adapted populations differ in shape. Our method can be modified easily to make it applicable to a wide range of shell forms, which would allow for investigations of the similarities and differences between and within many different species of gastropods. article_number: '20190721' article_processing_charge: No article_type: original author: - first_name: J. full_name: Larsson, J. last_name: Larsson - first_name: Anja M full_name: Westram, Anja M id: 3C147470-F248-11E8-B48F-1D18A9856A87 last_name: Westram orcid: 0000-0003-1050-4969 - first_name: S. full_name: Bengmark, S. last_name: Bengmark - first_name: T. full_name: Lundh, T. last_name: Lundh - first_name: R. K. full_name: Butlin, R. K. last_name: Butlin citation: ama: Larsson J, Westram AM, Bengmark S, Lundh T, Butlin RK. A developmentally descriptive method for quantifying shape in gastropod shells. Journal of The Royal Society Interface. 2020;17(163). doi:10.1098/rsif.2019.0721 apa: Larsson, J., Westram, A. M., Bengmark, S., Lundh, T., & Butlin, R. K. (2020). A developmentally descriptive method for quantifying shape in gastropod shells. Journal of The Royal Society Interface. The Royal Society. https://doi.org/10.1098/rsif.2019.0721 chicago: Larsson, J., Anja M Westram, S. Bengmark, T. Lundh, and R. K. Butlin. “A Developmentally Descriptive Method for Quantifying Shape in Gastropod Shells.” Journal of The Royal Society Interface. The Royal Society, 2020. https://doi.org/10.1098/rsif.2019.0721. ieee: J. Larsson, A. M. Westram, S. Bengmark, T. Lundh, and R. K. Butlin, “A developmentally descriptive method for quantifying shape in gastropod shells,” Journal of The Royal Society Interface, vol. 17, no. 163. The Royal Society, 2020. ista: Larsson J, Westram AM, Bengmark S, Lundh T, Butlin RK. 2020. A developmentally descriptive method for quantifying shape in gastropod shells. Journal of The Royal Society Interface. 17(163), 20190721. mla: Larsson, J., et al. “A Developmentally Descriptive Method for Quantifying Shape in Gastropod Shells.” Journal of The Royal Society Interface, vol. 17, no. 163, 20190721, The Royal Society, 2020, doi:10.1098/rsif.2019.0721. short: J. Larsson, A.M. Westram, S. Bengmark, T. Lundh, R.K. Butlin, Journal of The Royal Society Interface 17 (2020). date_created: 2020-04-08T15:19:17Z date_published: 2020-02-01T00:00:00Z date_updated: 2021-01-12T08:14:41Z day: '01' ddc: - '570' department: - _id: NiBa doi: 10.1098/rsif.2019.0721 file: - access_level: open_access checksum: 4eb102304402f5c56432516b84df86d6 content_type: application/pdf creator: dernst date_created: 2020-04-14T12:31:16Z date_updated: 2020-07-14T12:48:01Z file_id: '7660' file_name: 2020_JournRoyalSociety_Larsson.pdf file_size: 1556190 relation: main_file file_date_updated: 2020-07-14T12:48:01Z has_accepted_license: '1' intvolume: ' 17' issue: '163' language: - iso: eng month: '02' oa: 1 oa_version: Published Version publication: Journal of The Royal Society Interface publication_identifier: eissn: - 1742-5662 issn: - 1742-5689 publication_status: published publisher: The Royal Society quality_controlled: '1' scopus_import: 1 status: public title: A developmentally descriptive method for quantifying shape in gastropod shells tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 17 year: '2020' ... --- _id: '7803' abstract: - lang: eng text: "We settle the complexity of the (Δ+1)-coloring and (Δ+1)-list coloring problems in the CONGESTED CLIQUE model by presenting a simple deterministic algorithm for both problems running in a constant number of rounds. This matches the complexity of the recent breakthrough randomized constant-round (Δ+1)-list coloring algorithm due to Chang et al. (PODC'19), and significantly improves upon the state-of-the-art O(logΔ)-round deterministic (Δ+1)-coloring bound of Parter (ICALP'18).\r\nA remarkable property of our algorithm is its simplicity. Whereas the state-of-the-art randomized algorithms for this problem are based on the quite involved local coloring algorithm of Chang et al. (STOC'18), our algorithm can be described in just a few lines. At a high level, it applies a careful derandomization of a recursive procedure which partitions the nodes and their respective palettes into separate bins. We show that after O(1) recursion steps, the remaining uncolored subgraph within each bin has linear size, and thus can be solved locally by collecting it to a single node. This algorithm can also be implemented in the Massively Parallel Computation (MPC) model provided that each machine has linear (in n, the number of nodes in the input graph) space.\r\nWe also show an extension of our algorithm to the MPC regime in which machines have sublinear space: we present the first deterministic (Δ+1)-list coloring algorithm designed for sublinear-space MPC, which runs in O(logΔ+loglogn) rounds." article_processing_charge: No author: - first_name: Artur full_name: Czumaj, Artur last_name: Czumaj orcid: 0000-0002-5646-9524 - first_name: Peter full_name: Davies, Peter id: 11396234-BB50-11E9-B24C-90FCE5697425 last_name: Davies orcid: 0000-0002-5646-9524 - first_name: Merav full_name: Parter, Merav last_name: Parter citation: ama: 'Czumaj A, Davies P, Parter M. Simple, deterministic, constant-round coloring in the congested clique. In: Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery; 2020:309-318. doi:10.1145/3382734.3405751' apa: 'Czumaj, A., Davies, P., & Parter, M. (2020). Simple, deterministic, constant-round coloring in the congested clique. In Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing (pp. 309–318). Salerno, Italy: Association for Computing Machinery. https://doi.org/10.1145/3382734.3405751' chicago: Czumaj, Artur, Peter Davies, and Merav Parter. “Simple, Deterministic, Constant-Round Coloring in the Congested Clique.” In Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing, 309–18. Association for Computing Machinery, 2020. https://doi.org/10.1145/3382734.3405751. ieee: A. Czumaj, P. Davies, and M. Parter, “Simple, deterministic, constant-round coloring in the congested clique,” in Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing, Salerno, Italy, 2020, pp. 309–318. ista: 'Czumaj A, Davies P, Parter M. 2020. Simple, deterministic, constant-round coloring in the congested clique. Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing. PODC: Symposium on Principles of Distributed Computing, 309–318.' mla: Czumaj, Artur, et al. “Simple, Deterministic, Constant-Round Coloring in the Congested Clique.” Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2020, pp. 309–18, doi:10.1145/3382734.3405751. short: A. Czumaj, P. Davies, M. Parter, in:, Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2020, pp. 309–318. conference: end_date: 2020-08-07 location: Salerno, Italy name: 'PODC: Symposium on Principles of Distributed Computing' start_date: 2020-08-03 date_created: 2020-05-06T09:02:14Z date_published: 2020-07-01T00:00:00Z date_updated: 2021-01-12T08:15:37Z day: '01' ddc: - '000' department: - _id: DaAl doi: 10.1145/3382734.3405751 ec_funded: 1 external_id: arxiv: - '2009.06043' file: - access_level: open_access checksum: 46fe4fc58a64eb04068115573f631d4c content_type: application/pdf creator: pdavies date_created: 2020-10-08T08:17:36Z date_updated: 2020-10-08T08:17:36Z file_id: '8624' file_name: ColoringArxiv.pdf file_size: 520051 relation: main_file success: 1 file_date_updated: 2020-10-08T08:17:36Z has_accepted_license: '1' language: - iso: eng month: '07' oa: 1 oa_version: Submitted Version page: 309-318 project: - _id: 260C2330-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '754411' name: ISTplus - Postdoctoral Fellowships publication: Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing publication_status: published publisher: Association for Computing Machinery quality_controlled: '1' status: public title: Simple, deterministic, constant-round coloring in the congested clique type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2020' ... --- _id: '7806' abstract: - lang: eng text: "We consider the following decision problem EMBEDk→d in computational topology (where k ≤ d are fixed positive integers): Given a finite simplicial complex K of dimension k, does there exist a (piecewise-linear) embedding of K into ℝd?\r\nThe special case EMBED1→2 is graph planarity, which is decidable in linear time, as shown by Hopcroft and Tarjan. In higher dimensions, EMBED2→3 and EMBED3→3 are known to be decidable (as well as NP-hard), and recent results of Čadek et al. in computational homotopy theory, in combination with the classical Haefliger–Weber theorem in geometric topology, imply that EMBEDk→d can be solved in polynomial time for any fixed pair (k, d) of dimensions in the so-called metastable range .\r\nHere, by contrast, we prove that EMBEDk→d is algorithmically undecidable for almost all pairs of dimensions outside the metastable range, namely for . This almost completely resolves the decidability vs. undecidability of EMBEDk→d in higher dimensions and establishes a sharp dichotomy between polynomial-time solvability and undecidability.\r\nOur result complements (and in a wide range of dimensions strengthens) earlier results of Matoušek, Tancer, and the second author, who showed that EMBEDk→d is undecidable for 4 ≤ k ϵ {d – 1, d}, and NP-hard for all remaining pairs (k, d) outside the metastable range and satisfying d ≥ 4." article_processing_charge: No author: - first_name: Marek full_name: Filakovský, Marek id: 3E8AF77E-F248-11E8-B48F-1D18A9856A87 last_name: Filakovský - first_name: Uli full_name: Wagner, Uli id: 36690CA2-F248-11E8-B48F-1D18A9856A87 last_name: Wagner orcid: 0000-0002-1494-0568 - first_name: Stephan Y full_name: Zhechev, Stephan Y id: 3AA52972-F248-11E8-B48F-1D18A9856A87 last_name: Zhechev citation: ama: 'Filakovský M, Wagner U, Zhechev SY. Embeddability of simplicial complexes is undecidable. In: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. Vol 2020-January. SIAM; 2020:767-785. doi:10.1137/1.9781611975994.47' apa: 'Filakovský, M., Wagner, U., & Zhechev, S. Y. (2020). Embeddability of simplicial complexes is undecidable. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (Vol. 2020–January, pp. 767–785). Salt Lake City, UT, United States: SIAM. https://doi.org/10.1137/1.9781611975994.47' chicago: Filakovský, Marek, Uli Wagner, and Stephan Y Zhechev. “Embeddability of Simplicial Complexes Is Undecidable.” In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 2020–January:767–85. SIAM, 2020. https://doi.org/10.1137/1.9781611975994.47. ieee: M. Filakovský, U. Wagner, and S. Y. Zhechev, “Embeddability of simplicial complexes is undecidable,” in Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, Salt Lake City, UT, United States, 2020, vol. 2020–January, pp. 767–785. ista: 'Filakovský M, Wagner U, Zhechev SY. 2020. Embeddability of simplicial complexes is undecidable. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms vol. 2020–January, 767–785.' mla: Filakovský, Marek, et al. “Embeddability of Simplicial Complexes Is Undecidable.” Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, vol. 2020–January, SIAM, 2020, pp. 767–85, doi:10.1137/1.9781611975994.47. short: M. Filakovský, U. Wagner, S.Y. Zhechev, in:, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2020, pp. 767–785. conference: end_date: 2020-01-08 location: Salt Lake City, UT, United States name: 'SODA: Symposium on Discrete Algorithms' start_date: 2020-01-05 date_created: 2020-05-10T22:00:48Z date_published: 2020-01-01T00:00:00Z date_updated: 2021-01-12T08:15:38Z day: '01' department: - _id: UlWa doi: 10.1137/1.9781611975994.47 language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1137/1.9781611975994.47 month: '01' oa: 1 oa_version: Published Version page: 767-785 project: - _id: 26611F5C-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P31312 name: Algorithms for Embeddings and Homotopy Theory publication: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms publication_identifier: isbn: - '9781611975994' publication_status: published publisher: SIAM quality_controlled: '1' scopus_import: 1 status: public title: Embeddability of simplicial complexes is undecidable type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 2020-January year: '2020' ... --- _id: '7814' abstract: - lang: eng text: 'Scientific research is to date largely restricted to wealthy laboratories in developed nations due to the necessity of complex and expensive equipment. This inequality limits the capacity of science to be used as a diplomatic channel. Maker movements use open-source technologies including additive manufacturing (3D printing) and laser cutting, together with low-cost computers for developing novel products. This movement is setting the groundwork for a revolution, allowing scientific equipment to be sourced at a fraction of the cost and has the potential to increase the availability of equipment for scientists around the world. Science education is increasingly recognized as another channel for science diplomacy. In this perspective, we introduce the idea that the Maker movement and open-source technologies have the potential to revolutionize science, technology, engineering and mathematics (STEM) education worldwide. We present an open-source STEM didactic tool called SCOPES (Sparking Curiosity through Open-source Platforms in Education and Science). SCOPES is self-contained, independent of local resources, and cost-effective. SCOPES can be adapted to communicate complex subjects from genetics to neurobiology, perform real-world biological experiments and explore digitized scientific samples. We envision such platforms will enhance science diplomacy by providing a means for scientists to share their findings with classrooms and for educators to incorporate didactic concepts into STEM lessons. By providing students the opportunity to design, perform, and share scientific experiments, students also experience firsthand the benefits of a multinational scientific community. We provide instructions on how to build and use SCOPES on our webpage: http://scopeseducation.org.' acknowledged_ssus: - _id: Bio - _id: LifeSc - _id: PreCl - _id: EM-Fac article_number: '48' article_processing_charge: No article_type: original author: - first_name: Robert J full_name: Beattie, Robert J id: 2E26DF60-F248-11E8-B48F-1D18A9856A87 last_name: Beattie orcid: 0000-0002-8483-8753 - first_name: Simon full_name: Hippenmeyer, Simon id: 37B36620-F248-11E8-B48F-1D18A9856A87 last_name: Hippenmeyer orcid: 0000-0003-2279-1061 - first_name: Florian full_name: Pauler, Florian id: 48EA0138-F248-11E8-B48F-1D18A9856A87 last_name: Pauler citation: ama: 'Beattie RJ, Hippenmeyer S, Pauler F. SCOPES: Sparking curiosity through Open-Source platforms in education and science. Frontiers in Education. 2020;5. doi:10.3389/feduc.2020.00048' apa: 'Beattie, R. J., Hippenmeyer, S., & Pauler, F. (2020). SCOPES: Sparking curiosity through Open-Source platforms in education and science. Frontiers in Education. Frontiers Media. https://doi.org/10.3389/feduc.2020.00048' chicago: 'Beattie, Robert J, Simon Hippenmeyer, and Florian Pauler. “SCOPES: Sparking Curiosity through Open-Source Platforms in Education and Science.” Frontiers in Education. Frontiers Media, 2020. https://doi.org/10.3389/feduc.2020.00048.' ieee: 'R. J. Beattie, S. Hippenmeyer, and F. Pauler, “SCOPES: Sparking curiosity through Open-Source platforms in education and science,” Frontiers in Education, vol. 5. Frontiers Media, 2020.' ista: 'Beattie RJ, Hippenmeyer S, Pauler F. 2020. SCOPES: Sparking curiosity through Open-Source platforms in education and science. Frontiers in Education. 5, 48.' mla: 'Beattie, Robert J., et al. “SCOPES: Sparking Curiosity through Open-Source Platforms in Education and Science.” Frontiers in Education, vol. 5, 48, Frontiers Media, 2020, doi:10.3389/feduc.2020.00048.' short: R.J. Beattie, S. Hippenmeyer, F. Pauler, Frontiers in Education 5 (2020). date_created: 2020-05-11T08:18:48Z date_published: 2020-05-08T00:00:00Z date_updated: 2021-01-12T08:15:42Z day: '08' ddc: - '570' department: - _id: SiHi doi: 10.3389/feduc.2020.00048 ec_funded: 1 file: - access_level: open_access checksum: a24ec24e38d843341ae620ec76c53688 content_type: application/pdf creator: dernst date_created: 2020-05-11T11:34:08Z date_updated: 2020-07-14T12:48:03Z file_id: '7818' file_name: 2020_FrontiersEduc_Beattie.pdf file_size: 1402146 relation: main_file file_date_updated: 2020-07-14T12:48:03Z has_accepted_license: '1' intvolume: ' 5' language: - iso: eng month: '05' oa: 1 oa_version: Published Version project: - _id: 264E56E2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: M02416 name: Molecular Mechanisms Regulating Gliogenesis in the Cerebral Cortex - _id: 260018B0-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '725780' name: Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development publication: Frontiers in Education publication_identifier: issn: - 2504-284X publication_status: published publisher: Frontiers Media quality_controlled: '1' status: public title: 'SCOPES: Sparking curiosity through Open-Source platforms in education and science' tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 5 year: '2020' ... --- _id: '7866' abstract: - lang: eng text: In this paper, we establish convergence to equilibrium for a drift–diffusion–recombination system modelling the charge transport within certain semiconductor devices. More precisely, we consider a two-level system for electrons and holes which is augmented by an intermediate energy level for electrons in so-called trapped states. The recombination dynamics use the mass action principle by taking into account this additional trap level. The main part of the paper is concerned with the derivation of an entropy–entropy production inequality, which entails exponential convergence to the equilibrium via the so-called entropy method. The novelty of our approach lies in the fact that the entropy method is applied uniformly in a fast-reaction parameter which governs the lifetime of electrons on the trap level. Thus, the resulting decay estimate for the densities of electrons and holes extends to the corresponding quasi-steady-state approximation. acknowledgement: Open access funding provided by Austrian Science Fund (FWF). The second author has been supported by the International Research Training Group IGDK 1754 “Optimization and Numerical Analysis for Partial Differential Equations with Nonsmooth Structures”, funded by the German Research Council (DFG) and the Austrian Science Fund (FWF) under grant number [W 1244-N18]. article_processing_charge: No article_type: original author: - first_name: Klemens full_name: Fellner, Klemens last_name: Fellner - first_name: Michael full_name: Kniely, Michael id: 2CA2C08C-F248-11E8-B48F-1D18A9856A87 last_name: Kniely orcid: 0000-0001-5645-4333 citation: ama: Fellner K, Kniely M. Uniform convergence to equilibrium for a family of drift–diffusion models with trap-assisted recombination and the limiting Shockley–Read–Hall model. Journal of Elliptic and Parabolic Equations. 2020;6:529-598. doi:10.1007/s41808-020-00068-8 apa: Fellner, K., & Kniely, M. (2020). Uniform convergence to equilibrium for a family of drift–diffusion models with trap-assisted recombination and the limiting Shockley–Read–Hall model. Journal of Elliptic and Parabolic Equations. Springer Nature. https://doi.org/10.1007/s41808-020-00068-8 chicago: Fellner, Klemens, and Michael Kniely. “Uniform Convergence to Equilibrium for a Family of Drift–Diffusion Models with Trap-Assisted Recombination and the Limiting Shockley–Read–Hall Model.” Journal of Elliptic and Parabolic Equations. Springer Nature, 2020. https://doi.org/10.1007/s41808-020-00068-8. ieee: K. Fellner and M. Kniely, “Uniform convergence to equilibrium for a family of drift–diffusion models with trap-assisted recombination and the limiting Shockley–Read–Hall model,” Journal of Elliptic and Parabolic Equations, vol. 6. Springer Nature, pp. 529–598, 2020. ista: Fellner K, Kniely M. 2020. Uniform convergence to equilibrium for a family of drift–diffusion models with trap-assisted recombination and the limiting Shockley–Read–Hall model. Journal of Elliptic and Parabolic Equations. 6, 529–598. mla: Fellner, Klemens, and Michael Kniely. “Uniform Convergence to Equilibrium for a Family of Drift–Diffusion Models with Trap-Assisted Recombination and the Limiting Shockley–Read–Hall Model.” Journal of Elliptic and Parabolic Equations, vol. 6, Springer Nature, 2020, pp. 529–98, doi:10.1007/s41808-020-00068-8. short: K. Fellner, M. Kniely, Journal of Elliptic and Parabolic Equations 6 (2020) 529–598. date_created: 2020-05-17T22:00:45Z date_published: 2020-12-01T00:00:00Z date_updated: 2021-01-12T08:15:47Z day: '01' ddc: - '510' department: - _id: JuFi doi: 10.1007/s41808-020-00068-8 file: - access_level: open_access checksum: 6bc6832caacddceee1471291e93dcf1d content_type: application/pdf creator: dernst date_created: 2020-11-25T08:59:59Z date_updated: 2020-11-25T08:59:59Z file_id: '8802' file_name: 2020_JourEllipticParabEquat_Fellner.pdf file_size: 8408694 relation: main_file success: 1 file_date_updated: 2020-11-25T08:59:59Z has_accepted_license: '1' intvolume: ' 6' language: - iso: eng month: '12' oa: 1 oa_version: Published Version page: 529-598 project: - _id: 3AC91DDA-15DF-11EA-824D-93A3E7B544D1 call_identifier: FWF name: FWF Open Access Fund publication: Journal of Elliptic and Parabolic Equations publication_identifier: eissn: - '22969039' issn: - '22969020' publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: Uniform convergence to equilibrium for a family of drift–diffusion models with trap-assisted recombination and the limiting Shockley–Read–Hall model tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 6 year: '2020' ... --- _id: '7919' abstract: - lang: eng text: We explore the time evolution of two impurities in a trapped one-dimensional Bose gas that follows a change of the boson-impurity interaction. We study the induced impurity-impurity interactions and their effect on the quench dynamics. In particular, we report on the size of the impurity cloud, the impurity-impurity entanglement, and the impurity-impurity correlation function. The presented numerical simulations are based upon the variational multilayer multiconfiguration time-dependent Hartree method for bosons. To analyze and quantify induced impurity-impurity correlations, we employ an effective two-body Hamiltonian with a contact interaction. We show that the effective model consistent with the mean-field attraction of two heavy impurities explains qualitatively our results for weak interactions. Our findings suggest that the quench dynamics in cold-atom systems can be a tool for studying impurity-impurity correlations. article_number: '023154 ' article_processing_charge: No article_type: original author: - first_name: S. I. full_name: Mistakidis, S. I. last_name: Mistakidis - first_name: Artem full_name: Volosniev, Artem id: 37D278BC-F248-11E8-B48F-1D18A9856A87 last_name: Volosniev orcid: 0000-0003-0393-5525 - first_name: P. full_name: Schmelcher, P. last_name: Schmelcher citation: ama: Mistakidis SI, Volosniev A, Schmelcher P. Induced correlations between impurities in a one-dimensional quenched Bose gas. Physical Review Research. 2020;2. doi:10.1103/physrevresearch.2.023154 apa: Mistakidis, S. I., Volosniev, A., & Schmelcher, P. (2020). Induced correlations between impurities in a one-dimensional quenched Bose gas. Physical Review Research. American Physical Society. https://doi.org/10.1103/physrevresearch.2.023154 chicago: Mistakidis, S. I., Artem Volosniev, and P. Schmelcher. “Induced Correlations between Impurities in a One-Dimensional Quenched Bose Gas.” Physical Review Research. American Physical Society, 2020. https://doi.org/10.1103/physrevresearch.2.023154. ieee: S. I. Mistakidis, A. Volosniev, and P. Schmelcher, “Induced correlations between impurities in a one-dimensional quenched Bose gas,” Physical Review Research, vol. 2. American Physical Society, 2020. ista: Mistakidis SI, Volosniev A, Schmelcher P. 2020. Induced correlations between impurities in a one-dimensional quenched Bose gas. Physical Review Research. 2, 023154. mla: Mistakidis, S. I., et al. “Induced Correlations between Impurities in a One-Dimensional Quenched Bose Gas.” Physical Review Research, vol. 2, 023154, American Physical Society, 2020, doi:10.1103/physrevresearch.2.023154. short: S.I. Mistakidis, A. Volosniev, P. Schmelcher, Physical Review Research 2 (2020). date_created: 2020-06-03T11:30:10Z date_published: 2020-05-11T00:00:00Z date_updated: 2023-02-23T13:20:16Z day: '11' ddc: - '530' department: - _id: MiLe doi: 10.1103/physrevresearch.2.023154 ec_funded: 1 file: - access_level: open_access checksum: e1c362fe094d6b246b3cd4a49722e78b content_type: application/pdf creator: dernst date_created: 2020-06-04T13:51:59Z date_updated: 2020-07-14T12:48:05Z file_id: '7926' file_name: 2020_PhysRevResearch_Mistakidis.pdf file_size: 1741098 relation: main_file file_date_updated: 2020-07-14T12:48:05Z has_accepted_license: '1' intvolume: ' 2' language: - iso: eng month: '05' oa: 1 oa_version: Published Version project: - _id: 260C2330-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '754411' name: ISTplus - Postdoctoral Fellowships publication: Physical Review Research publication_identifier: issn: - 2643-1564 publication_status: published publisher: American Physical Society quality_controlled: '1' status: public title: Induced correlations between impurities in a one-dimensional quenched Bose gas tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 2 year: '2020' ... --- _id: '7991' abstract: - lang: eng text: 'We define and study a discrete process that generalizes the convex-layer decomposition of a planar point set. Our process, which we call homotopic curve shortening (HCS), starts with a closed curve (which might self-intersect) in the presence of a set P⊂ ℝ² of point obstacles, and evolves in discrete steps, where each step consists of (1) taking shortcuts around the obstacles, and (2) reducing the curve to its shortest homotopic equivalent. We find experimentally that, if the initial curve is held fixed and P is chosen to be either a very fine regular grid or a uniformly random point set, then HCS behaves at the limit like the affine curve-shortening flow (ACSF). This connection between HCS and ACSF generalizes the link between "grid peeling" and the ACSF observed by Eppstein et al. (2017), which applied only to convex curves, and which was studied only for regular grids. We prove that HCS satisfies some properties analogous to those of ACSF: HCS is invariant under affine transformations, preserves convexity, and does not increase the total absolute curvature. Furthermore, the number of self-intersections of a curve, or intersections between two curves (appropriately defined), does not increase. Finally, if the initial curve is simple, then the number of inflection points (appropriately defined) does not increase.' alternative_title: - LIPIcs article_number: 12:1 - 12:15 article_processing_charge: No author: - first_name: Sergey full_name: Avvakumov, Sergey id: 3827DAC8-F248-11E8-B48F-1D18A9856A87 last_name: Avvakumov - first_name: Gabriel full_name: Nivasch, Gabriel last_name: Nivasch citation: ama: 'Avvakumov S, Nivasch G. Homotopic curve shortening and the affine curve-shortening flow. In: 36th International Symposium on Computational Geometry. Vol 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.SoCG.2020.12' apa: 'Avvakumov, S., & Nivasch, G. (2020). Homotopic curve shortening and the affine curve-shortening flow. In 36th International Symposium on Computational Geometry (Vol. 164). Zürich, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2020.12' chicago: Avvakumov, Sergey, and Gabriel Nivasch. “Homotopic Curve Shortening and the Affine Curve-Shortening Flow.” In 36th International Symposium on Computational Geometry, Vol. 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.SoCG.2020.12. ieee: S. Avvakumov and G. Nivasch, “Homotopic curve shortening and the affine curve-shortening flow,” in 36th International Symposium on Computational Geometry, Zürich, Switzerland, 2020, vol. 164. ista: 'Avvakumov S, Nivasch G. 2020. Homotopic curve shortening and the affine curve-shortening flow. 36th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 164, 12:1-12:15.' mla: Avvakumov, Sergey, and Gabriel Nivasch. “Homotopic Curve Shortening and the Affine Curve-Shortening Flow.” 36th International Symposium on Computational Geometry, vol. 164, 12:1-12:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.SoCG.2020.12. short: S. Avvakumov, G. Nivasch, in:, 36th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. conference: end_date: 2020-06-26 location: Zürich, Switzerland name: 'SoCG: Symposium on Computational Geometry' start_date: 2020-06-22 date_created: 2020-06-22T09:14:19Z date_published: 2020-06-01T00:00:00Z date_updated: 2021-01-12T08:16:23Z day: '01' ddc: - '510' department: - _id: UlWa doi: 10.4230/LIPIcs.SoCG.2020.12 external_id: arxiv: - '1909.00263' file: - access_level: open_access checksum: 6872df6549142f709fb6354a1b2f2c06 content_type: application/pdf creator: dernst date_created: 2020-06-23T11:13:49Z date_updated: 2020-07-14T12:48:06Z file_id: '8007' file_name: 2020_LIPIcsSoCG_Avvakumov.pdf file_size: 575896 relation: main_file file_date_updated: 2020-07-14T12:48:06Z has_accepted_license: '1' intvolume: ' 164' language: - iso: eng month: '06' oa: 1 oa_version: Published Version project: - _id: 26611F5C-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P31312 name: Algorithms for Embeddings and Homotopy Theory publication: 36th International Symposium on Computational Geometry publication_identifier: isbn: - '9783959771436' issn: - '18688969' publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: '1' status: public title: Homotopic curve shortening and the affine curve-shortening flow tmp: image: /images/cc_by.png 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) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 164 year: '2020' ... --- _id: '7989' abstract: - lang: eng text: 'We prove general topological Radon-type theorems for sets in ℝ^d, smooth real manifolds or finite dimensional simplicial complexes. Combined with a recent result of Holmsen and Lee, it gives fractional Helly theorem, and consequently the existence of weak ε-nets as well as a (p,q)-theorem. More precisely: Let X be either ℝ^d, smooth real d-manifold, or a finite d-dimensional simplicial complex. Then if F is a finite, intersection-closed family of sets in X such that the ith reduced Betti number (with ℤ₂ coefficients) of any set in F is at most b for every non-negative integer i less or equal to k, then the Radon number of F is bounded in terms of b and X. Here k is the smallest integer larger or equal to d/2 - 1 if X = ℝ^d; k=d-1 if X is a smooth real d-manifold and not a surface, k=0 if X is a surface and k=d if X is a d-dimensional simplicial complex. Using the recent result of the author and Kalai, we manage to prove the following optimal bound on fractional Helly number for families of open sets in a surface: Let F be a finite family of open sets in a surface S such that the intersection of any subfamily of F is either empty, or path-connected. Then the fractional Helly number of F is at most three. This also settles a conjecture of Holmsen, Kim, and Lee about an existence of a (p,q)-theorem for open subsets of a surface.' alternative_title: - LIPIcs article_number: 61:1-61:13 article_processing_charge: No author: - first_name: Zuzana full_name: Patakova, Zuzana id: 48B57058-F248-11E8-B48F-1D18A9856A87 last_name: Patakova orcid: 0000-0002-3975-1683 citation: ama: 'Patakova Z. Bounding radon number via Betti numbers. In: 36th International Symposium on Computational Geometry. Vol 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.SoCG.2020.61' apa: 'Patakova, Z. (2020). Bounding radon number via Betti numbers. In 36th International Symposium on Computational Geometry (Vol. 164). Zürich, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2020.61' chicago: Patakova, Zuzana. “Bounding Radon Number via Betti Numbers.” In 36th International Symposium on Computational Geometry, Vol. 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.SoCG.2020.61. ieee: Z. Patakova, “Bounding radon number via Betti numbers,” in 36th International Symposium on Computational Geometry, Zürich, Switzerland, 2020, vol. 164. ista: 'Patakova Z. 2020. Bounding radon number via Betti numbers. 36th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 164, 61:1-61:13.' mla: Patakova, Zuzana. “Bounding Radon Number via Betti Numbers.” 36th International Symposium on Computational Geometry, vol. 164, 61:1-61:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.SoCG.2020.61. short: Z. Patakova, in:, 36th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. conference: end_date: 2020-06-26 location: Zürich, Switzerland name: 'SoCG: Symposium on Computational Geometry' start_date: 2020-06-22 date_created: 2020-06-22T09:14:18Z date_published: 2020-06-01T00:00:00Z date_updated: 2021-01-12T08:16:22Z day: '01' ddc: - '510' department: - _id: UlWa doi: 10.4230/LIPIcs.SoCG.2020.61 external_id: arxiv: - '1908.01677' file: - access_level: open_access checksum: d0996ca5f6eb32ce955ce782b4f2afbe content_type: application/pdf creator: dernst date_created: 2020-06-23T06:56:23Z date_updated: 2020-07-14T12:48:06Z file_id: '8005' file_name: 2020_LIPIcsSoCG_Patakova_61.pdf file_size: 645421 relation: main_file file_date_updated: 2020-07-14T12:48:06Z has_accepted_license: '1' intvolume: ' 164' language: - iso: eng month: '06' oa: 1 oa_version: Published Version publication: 36th International Symposium on Computational Geometry publication_identifier: isbn: - '9783959771436' issn: - '18688969' publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: '1' status: public title: Bounding radon number via Betti numbers tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 164 year: '2020' ... --- _id: '7992' abstract: - lang: eng text: 'Let K be a convex body in ℝⁿ (i.e., a compact convex set with nonempty interior). Given a point p in the interior of K, a hyperplane h passing through p is called barycentric if p is the barycenter of K ∩ h. In 1961, Grünbaum raised the question whether, for every K, there exists an interior point p through which there are at least n+1 distinct barycentric hyperplanes. Two years later, this was seemingly resolved affirmatively by showing that this is the case if p=p₀ is the point of maximal depth in K. However, while working on a related question, we noticed that one of the auxiliary claims in the proof is incorrect. Here, we provide a counterexample; this re-opens Grünbaum’s question. It follows from known results that for n ≥ 2, there are always at least three distinct barycentric cuts through the point p₀ ∈ K of maximal depth. Using tools related to Morse theory we are able to improve this bound: four distinct barycentric cuts through p₀ are guaranteed if n ≥ 3.' alternative_title: - LIPIcs article_number: 62:1 - 62:16 article_processing_charge: No author: - first_name: Zuzana full_name: Patakova, Zuzana id: 48B57058-F248-11E8-B48F-1D18A9856A87 last_name: Patakova orcid: 0000-0002-3975-1683 - first_name: Martin full_name: Tancer, Martin id: 38AC689C-F248-11E8-B48F-1D18A9856A87 last_name: Tancer orcid: 0000-0002-1191-6714 - first_name: Uli full_name: Wagner, Uli id: 36690CA2-F248-11E8-B48F-1D18A9856A87 last_name: Wagner orcid: 0000-0002-1494-0568 citation: ama: 'Patakova Z, Tancer M, Wagner U. Barycentric cuts through a convex body. In: 36th International Symposium on Computational Geometry. Vol 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.SoCG.2020.62' apa: 'Patakova, Z., Tancer, M., & Wagner, U. (2020). Barycentric cuts through a convex body. In 36th International Symposium on Computational Geometry (Vol. 164). Zürich, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2020.62' chicago: Patakova, Zuzana, Martin Tancer, and Uli Wagner. “Barycentric Cuts through a Convex Body.” In 36th International Symposium on Computational Geometry, Vol. 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.SoCG.2020.62. ieee: Z. Patakova, M. Tancer, and U. Wagner, “Barycentric cuts through a convex body,” in 36th International Symposium on Computational Geometry, Zürich, Switzerland, 2020, vol. 164. ista: 'Patakova Z, Tancer M, Wagner U. 2020. Barycentric cuts through a convex body. 36th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 164, 62:1-62:16.' mla: Patakova, Zuzana, et al. “Barycentric Cuts through a Convex Body.” 36th International Symposium on Computational Geometry, vol. 164, 62:1-62:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.SoCG.2020.62. short: Z. Patakova, M. Tancer, U. Wagner, in:, 36th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. conference: end_date: 2020-06-26 location: Zürich, Switzerland name: 'SoCG: Symposium on Computational Geometry' start_date: 2020-06-22 date_created: 2020-06-22T09:14:20Z date_published: 2020-06-01T00:00:00Z date_updated: 2021-01-12T08:16:23Z day: '01' ddc: - '510' department: - _id: UlWa doi: 10.4230/LIPIcs.SoCG.2020.62 external_id: arxiv: - '2003.13536' file: - access_level: open_access checksum: ce1c9194139a664fb59d1efdfc88eaae content_type: application/pdf creator: dernst date_created: 2020-06-23T06:45:52Z date_updated: 2020-07-14T12:48:06Z file_id: '8004' file_name: 2020_LIPIcsSoCG_Patakova.pdf file_size: 750318 relation: main_file file_date_updated: 2020-07-14T12:48:06Z has_accepted_license: '1' intvolume: ' 164' language: - iso: eng month: '06' oa: 1 oa_version: Published Version publication: 36th International Symposium on Computational Geometry publication_identifier: isbn: - '9783959771436' issn: - '18688969' publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: 1 status: public title: Barycentric cuts through a convex body tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 164 year: '2020' ... --- _id: '7994' abstract: - lang: eng text: In the recent study of crossing numbers, drawings of graphs that can be extended to an arrangement of pseudolines (pseudolinear drawings) have played an important role as they are a natural combinatorial extension of rectilinear (or straight-line) drawings. A characterization of the pseudolinear drawings of K_n was found recently. We extend this characterization to all graphs, by describing the set of minimal forbidden subdrawings for pseudolinear drawings. Our characterization also leads to a polynomial-time algorithm to recognize pseudolinear drawings and construct the pseudolines when it is possible. alternative_title: - LIPIcs article_number: 9:1 - 9:14 article_processing_charge: No author: - first_name: Alan M full_name: Arroyo Guevara, Alan M id: 3207FDC6-F248-11E8-B48F-1D18A9856A87 last_name: Arroyo Guevara orcid: 0000-0003-2401-8670 - first_name: Julien full_name: Bensmail, Julien last_name: Bensmail - first_name: R. full_name: Bruce Richter, R. last_name: Bruce Richter citation: ama: 'Arroyo Guevara AM, Bensmail J, Bruce Richter R. Extending drawings of graphs to arrangements of pseudolines. In: 36th International Symposium on Computational Geometry. Vol 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.SoCG.2020.9' apa: 'Arroyo Guevara, A. M., Bensmail, J., & Bruce Richter, R. (2020). Extending drawings of graphs to arrangements of pseudolines. In 36th International Symposium on Computational Geometry (Vol. 164). Zürich, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2020.9' chicago: Arroyo Guevara, Alan M, Julien Bensmail, and R. Bruce Richter. “Extending Drawings of Graphs to Arrangements of Pseudolines.” In 36th International Symposium on Computational Geometry, Vol. 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.SoCG.2020.9. ieee: A. M. Arroyo Guevara, J. Bensmail, and R. Bruce Richter, “Extending drawings of graphs to arrangements of pseudolines,” in 36th International Symposium on Computational Geometry, Zürich, Switzerland, 2020, vol. 164. ista: 'Arroyo Guevara AM, Bensmail J, Bruce Richter R. 2020. Extending drawings of graphs to arrangements of pseudolines. 36th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 164, 9:1-9:14.' mla: Arroyo Guevara, Alan M., et al. “Extending Drawings of Graphs to Arrangements of Pseudolines.” 36th International Symposium on Computational Geometry, vol. 164, 9:1-9:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.SoCG.2020.9. short: A.M. Arroyo Guevara, J. Bensmail, R. Bruce Richter, in:, 36th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. conference: end_date: 2020-06-26 location: Zürich, Switzerland name: 'SoCG: Symposium on Computational Geometry' start_date: 2020-06-22 date_created: 2020-06-22T09:14:21Z date_published: 2020-06-01T00:00:00Z date_updated: 2023-02-23T13:22:12Z day: '01' ddc: - '510' department: - _id: UlWa doi: 10.4230/LIPIcs.SoCG.2020.9 ec_funded: 1 external_id: arxiv: - '1804.09317' file: - access_level: open_access checksum: 93571b76cf97d5b7c8aabaeaa694dd7e content_type: application/pdf creator: dernst date_created: 2020-06-23T11:06:23Z date_updated: 2020-07-14T12:48:06Z file_id: '8006' file_name: 2020_LIPIcsSoCG_Arroyo.pdf file_size: 592661 relation: main_file file_date_updated: 2020-07-14T12:48:06Z has_accepted_license: '1' intvolume: ' 164' language: - iso: eng month: '06' oa: 1 oa_version: Published Version project: - _id: 260C2330-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '754411' name: ISTplus - Postdoctoral Fellowships publication: 36th International Symposium on Computational Geometry publication_identifier: isbn: - '9783959771436' issn: - '18688969' publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: '1' status: public title: Extending drawings of graphs to arrangements of pseudolines tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 164 year: '2020' ... --- _id: '8011' abstract: - lang: eng text: 'Relaxation to a thermal state is the inevitable fate of nonequilibrium interacting quantum systems without special conservation laws. While thermalization in one-dimensional systems can often be suppressed by integrability mechanisms, in two spatial dimensions thermalization is expected to be far more effective due to the increased phase space. In this work we propose a general framework for escaping or delaying the emergence of the thermal state in two-dimensional arrays of Rydberg atoms via the mechanism of quantum scars, i.e., initial states that fail to thermalize. The suppression of thermalization is achieved in two complementary ways: by adding local perturbations or by adjusting the driving Rabi frequency according to the local connectivity of the lattice. We demonstrate that these mechanisms allow us to realize robust quantum scars in various two-dimensional lattices, including decorated lattices with nonconstant connectivity. In particular, we show that a small decrease of the Rabi frequency at the corners of the lattice is crucial for mitigating the strong boundary effects in two-dimensional systems. Our results identify synchronization as an important tool for future experiments on two-dimensional quantum scars.' article_number: '022065' article_processing_charge: No article_type: original author: - first_name: Alexios full_name: Michailidis, Alexios id: 36EBAD38-F248-11E8-B48F-1D18A9856A87 last_name: Michailidis - first_name: C. J. full_name: Turner, C. J. last_name: Turner - first_name: Z. full_name: Papić, Z. last_name: Papić - first_name: D. A. full_name: Abanin, D. A. last_name: Abanin - first_name: Maksym full_name: Serbyn, Maksym id: 47809E7E-F248-11E8-B48F-1D18A9856A87 last_name: Serbyn orcid: 0000-0002-2399-5827 citation: ama: Michailidis A, Turner CJ, Papić Z, Abanin DA, Serbyn M. Stabilizing two-dimensional quantum scars by deformation and synchronization. Physical Review Research. 2020;2(2). doi:10.1103/physrevresearch.2.022065 apa: Michailidis, A., Turner, C. J., Papić, Z., Abanin, D. A., & Serbyn, M. (2020). Stabilizing two-dimensional quantum scars by deformation and synchronization. Physical Review Research. American Physical Society. https://doi.org/10.1103/physrevresearch.2.022065 chicago: Michailidis, Alexios, C. J. Turner, Z. Papić, D. A. Abanin, and Maksym Serbyn. “Stabilizing Two-Dimensional Quantum Scars by Deformation and Synchronization.” Physical Review Research. American Physical Society, 2020. https://doi.org/10.1103/physrevresearch.2.022065. ieee: A. Michailidis, C. J. Turner, Z. Papić, D. A. Abanin, and M. Serbyn, “Stabilizing two-dimensional quantum scars by deformation and synchronization,” Physical Review Research, vol. 2, no. 2. American Physical Society, 2020. ista: Michailidis A, Turner CJ, Papić Z, Abanin DA, Serbyn M. 2020. Stabilizing two-dimensional quantum scars by deformation and synchronization. Physical Review Research. 2(2), 022065. mla: Michailidis, Alexios, et al. “Stabilizing Two-Dimensional Quantum Scars by Deformation and Synchronization.” Physical Review Research, vol. 2, no. 2, 022065, American Physical Society, 2020, doi:10.1103/physrevresearch.2.022065. short: A. Michailidis, C.J. Turner, Z. Papić, D.A. Abanin, M. Serbyn, Physical Review Research 2 (2020). date_created: 2020-06-23T12:00:19Z date_published: 2020-06-22T00:00:00Z date_updated: 2021-01-12T08:16:30Z day: '22' ddc: - '530' department: - _id: MaSe doi: 10.1103/physrevresearch.2.022065 ec_funded: 1 file: - access_level: open_access checksum: e6959dc8220f14a008d1933858795e6d content_type: application/pdf creator: dernst date_created: 2020-06-29T14:41:27Z date_updated: 2020-07-14T12:48:08Z file_id: '8050' file_name: 2020_PhysicalReviewResearch_Michailidis.pdf file_size: 2066011 relation: main_file file_date_updated: 2020-07-14T12:48:08Z has_accepted_license: '1' intvolume: ' 2' issue: '2' language: - iso: eng month: '06' oa: 1 oa_version: Published Version project: - _id: 23841C26-32DE-11EA-91FC-C7463DDC885E call_identifier: H2020 grant_number: '850899' name: 'Non-Ergodic Quantum Matter: Universality, Dynamics and Control' publication: Physical Review Research publication_identifier: issn: - 2643-1564 publication_status: published publisher: American Physical Society quality_controlled: '1' status: public title: Stabilizing two-dimensional quantum scars by deformation and synchronization tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 2 year: '2020' ... --- _id: '8063' abstract: - lang: eng text: "We present a generative model of images that explicitly reasons over the set\r\nof objects they show. Our model learns a structured latent representation that\r\nseparates objects from each other and from the background; unlike prior works,\r\nit explicitly represents the 2D position and depth of each object, as well as\r\nan embedding of its segmentation mask and appearance. The model can be trained\r\nfrom images alone in a purely unsupervised fashion without the need for object\r\nmasks or depth information. Moreover, it always generates complete objects,\r\neven though a significant fraction of training images contain occlusions.\r\nFinally, we show that our model can infer decompositions of novel images into\r\ntheir constituent objects, including accurate prediction of depth ordering and\r\nsegmentation of occluded parts." article_number: '2004.00642' article_processing_charge: No author: - first_name: Titas full_name: Anciukevicius, Titas last_name: Anciukevicius - first_name: Christoph full_name: Lampert, Christoph id: 40C20FD2-F248-11E8-B48F-1D18A9856A87 last_name: Lampert orcid: 0000-0001-8622-7887 - first_name: Paul M full_name: Henderson, Paul M id: 13C09E74-18D9-11E9-8878-32CFE5697425 last_name: Henderson orcid: 0000-0002-5198-7445 citation: ama: Anciukevicius T, Lampert C, Henderson PM. Object-centric image generation with factored depths, locations, and appearances. arXiv. apa: Anciukevicius, T., Lampert, C., & Henderson, P. M. (n.d.). Object-centric image generation with factored depths, locations, and appearances. arXiv. chicago: Anciukevicius, Titas, Christoph Lampert, and Paul M Henderson. “Object-Centric Image Generation with Factored Depths, Locations, and Appearances.” ArXiv, n.d. ieee: T. Anciukevicius, C. Lampert, and P. M. Henderson, “Object-centric image generation with factored depths, locations, and appearances,” arXiv. . ista: Anciukevicius T, Lampert C, Henderson PM. Object-centric image generation with factored depths, locations, and appearances. arXiv, 2004.00642. mla: Anciukevicius, Titas, et al. “Object-Centric Image Generation with Factored Depths, Locations, and Appearances.” ArXiv, 2004.00642. short: T. Anciukevicius, C. Lampert, P.M. Henderson, ArXiv (n.d.). date_created: 2020-06-29T23:55:23Z date_published: 2020-04-01T00:00:00Z date_updated: 2021-01-12T08:16:44Z day: '01' ddc: - '004' department: - _id: ChLa external_id: arxiv: - '2004.00642' language: - iso: eng license: https://creativecommons.org/licenses/by-sa/4.0/ main_file_link: - open_access: '1' url: https://arxiv.org/abs/2004.00642 month: '04' oa: 1 oa_version: Preprint publication: arXiv publication_status: submitted status: public title: Object-centric image generation with factored depths, locations, and appearances tmp: image: /images/cc_by_sa.png legal_code_url: https://creativecommons.org/licenses/by-sa/4.0/legalcode name: Creative Commons Attribution-ShareAlike 4.0 International Public License (CC BY-SA 4.0) short: CC BY-SA (4.0) type: preprint user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2020' ... --- _id: '8081' abstract: - lang: eng text: "Here, we employ micro- and nanosized cellulose particles, namely paper fines and cellulose\r\nnanocrystals, to induce hierarchical organization over a wide length scale. After processing\r\nthem into carbonaceous materials, we demonstrate that these hierarchically organized materials\r\noutperform the best materials for supercapacitors operating with organic electrolytes reported\r\nin literature in terms of specific energy/power (Ragone plot) while showing hardly any capacity\r\nfade over 4,000 cycles. The highly porous materials feature a specific surface area as high as\r\n2500 m2ˑg-1 and exhibit pore sizes in the range of 0.5 to 200 nm as proven by scanning electron\r\nmicroscopy and N2 physisorption. The carbonaceous materials have been further investigated\r\nby X-ray photoelectron spectroscopy and RAMAN spectroscopy. Since paper fines are an\r\nunderutilized side stream in any paper production process, they are a cheap and highly available\r\nfeedstock to prepare carbonaceous materials with outstanding performance in electrochemical\r\napplications. " acknowledgement: 'The authors M.A.H., S.S., R.E., and W.B. acknowledge the industrial partners Sappi Gratkorn, Zellstoff Pöls and Mondi Frantschach, the Austrian Research Promotion Agency (FFG), COMET, BMVIT, BMWFJ, the Province of Styria and Carinthia for their financial support of the K-project Flippr²-Process Integration. E.M. and S.A.F. are indebted to the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation program (grant agreement No 636069). W. T. and S. E. thank FWO (G.0C60.13N) and the European Union’s European Fund for Regional Development and Flanders Innovation & Entrepreneurship (Accelerate3 project, Interreg Vlaanderen-Nederland program) for financial support. W. T. also thanks the Provincie West-Vlaanderen (Belgium) for his Provincial Chair in Advanced Materials. S. B. thanks the European Regional Development Fund (EFRE) and the province of Upper Austria for financial support through the program IWB 2014-2020 (project BioCarb-K). AMR gratefully acknowledges funding support through the SC EPSCoR/IDeAProgram under Award #18-SR03, and the NASA EPSCoR Program under Award #NNH17ZHA002C. Icons in Scheme 1 were provided by Good Ware, monkik, photo3idea_studio, and OCHA from www.flaticon.com.' article_processing_charge: No author: - first_name: 'Mathias A. ' full_name: 'Hobisch, Mathias A. ' last_name: Hobisch - first_name: 'Eléonore ' full_name: 'Mourad, Eléonore ' last_name: Mourad - first_name: 'Wolfgang J. ' full_name: 'Fischer, Wolfgang J. ' last_name: Fischer - first_name: 'Christian ' full_name: 'Prehal, Christian ' last_name: Prehal - first_name: 'Samuel ' full_name: 'Eyley, Samuel ' last_name: Eyley - first_name: 'Anthony ' full_name: 'Childress, Anthony ' last_name: Childress - first_name: 'Armin ' full_name: 'Zankel, Armin ' last_name: Zankel - first_name: 'Andreas ' full_name: 'Mautner, Andreas ' last_name: Mautner - first_name: 'Stefan ' full_name: 'Breitenbach, Stefan ' last_name: Breitenbach - first_name: 'Apparao M. ' full_name: 'Rao, Apparao M. ' last_name: Rao - first_name: 'Wim ' full_name: 'Thielemans, Wim ' last_name: Thielemans - first_name: Stefan Alexander full_name: Freunberger, Stefan Alexander id: A8CA28E6-CE23-11E9-AD2D-EC27E6697425 last_name: Freunberger orcid: 0000-0003-2902-5319 - first_name: 'Rene ' full_name: 'Eckhart, Rene ' last_name: Eckhart - first_name: 'Wolfgang ' full_name: 'Bauer, Wolfgang ' last_name: Bauer - first_name: 'Stefan ' full_name: 'Spirk, Stefan ' last_name: Spirk citation: ama: Hobisch MA, Mourad E, Fischer WJ, et al. High specific capacitance supercapacitors from hierarchically organized all-cellulose composites. apa: Hobisch, M. A., Mourad, E., Fischer, W. J., Prehal, C., Eyley, S., Childress, A., … Spirk, S. (n.d.). High specific capacitance supercapacitors from hierarchically organized all-cellulose composites. chicago: Hobisch, Mathias A. , Eléonore Mourad, Wolfgang J. Fischer, Christian Prehal, Samuel Eyley, Anthony Childress, Armin Zankel, et al. “High Specific Capacitance Supercapacitors from Hierarchically Organized All-Cellulose Composites,” n.d. ieee: M. A. Hobisch et al., “High specific capacitance supercapacitors from hierarchically organized all-cellulose composites.” . ista: Hobisch MA, Mourad E, Fischer WJ, Prehal C, Eyley S, Childress A, Zankel A, Mautner A, Breitenbach S, Rao AM, Thielemans W, Freunberger SA, Eckhart R, Bauer W, Spirk S. High specific capacitance supercapacitors from hierarchically organized all-cellulose composites. mla: Hobisch, Mathias A., et al. High Specific Capacitance Supercapacitors from Hierarchically Organized All-Cellulose Composites. short: M.A. Hobisch, E. Mourad, W.J. Fischer, C. Prehal, S. Eyley, A. Childress, A. Zankel, A. Mautner, S. Breitenbach, A.M. Rao, W. Thielemans, S.A. Freunberger, R. Eckhart, W. Bauer, S. Spirk, (n.d.). date_created: 2020-07-02T20:24:42Z date_published: 2020-07-13T00:00:00Z date_updated: 2022-06-17T08:39:49Z day: '13' ddc: - '540' department: - _id: StFr file: - access_level: open_access checksum: 6970d621984c03ebc2eee71adfe706dd content_type: application/pdf creator: sfreunbe date_created: 2020-07-02T20:21:59Z date_updated: 2020-07-14T12:48:09Z file_id: '8082' file_name: AM.pdf file_size: 1129852 relation: main_file - access_level: open_access checksum: cd74c7bd47d6e7163d54d67f074dcc36 content_type: application/pdf creator: cziletti date_created: 2020-07-08T12:14:04Z date_updated: 2020-07-14T12:48:09Z file_id: '8102' file_name: Supporting_Information.pdf file_size: 945565 relation: supplementary_material file_date_updated: 2020-07-14T12:48:09Z has_accepted_license: '1' language: - iso: eng month: '07' oa: 1 oa_version: Submitted Version publication_status: submitted status: public title: High specific capacitance supercapacitors from hierarchically organized all-cellulose composites type: preprint user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2020' ... --- _id: '8105' abstract: - lang: eng text: Physical and biological systems often exhibit intermittent dynamics with bursts or avalanches (active states) characterized by power-law size and duration distributions. These emergent features are typical of systems at the critical point of continuous phase transitions, and have led to the hypothesis that such systems may self-organize at criticality, i.e. without any fine tuning of parameters. Since the introduction of the Bak-Tang-Wiesenfeld (BTW) model, the paradigm of self-organized criticality (SOC) has been very fruitful for the analysis of emergent collective behaviors in a number of systems, including the brain. Although considerable effort has been devoted in identifying and modeling scaling features of burst and avalanche statistics, dynamical aspects related to the temporal organization of bursts remain often poorly understood or controversial. Of crucial importance to understand the mechanisms responsible for emergent behaviors is the relationship between active and quiet periods, and the nature of the correlations. Here we investigate the dynamics of active (θ-bursts) and quiet states (δ-bursts) in brain activity during the sleep-wake cycle. We show the duality of power-law (θ, active phase) and exponential-like (δ, quiescent phase) duration distributions, typical of SOC, jointly emerge with power-law temporal correlations and anti-correlated coupling between active and quiet states. Importantly, we demonstrate that such temporal organization shares important similarities with earthquake dynamics, and propose that specific power-law correlations and coupling between active and quiet states are distinctive characteristics of a class of systems with self-organization at criticality. article_number: '00005' article_processing_charge: No article_type: original author: - first_name: Fabrizio full_name: Lombardi, Fabrizio id: A057D288-3E88-11E9-986D-0CF4E5697425 last_name: Lombardi orcid: 0000-0003-2623-5249 - first_name: Jilin W.J.L. full_name: Wang, Jilin W.J.L. last_name: Wang - first_name: Xiyun full_name: Zhang, Xiyun last_name: Zhang - first_name: Plamen Ch full_name: Ivanov, Plamen Ch last_name: Ivanov citation: ama: Lombardi F, Wang JWJL, Zhang X, Ivanov PC. Power-law correlations and coupling of active and quiet states underlie a class of complex systems with self-organization at criticality. EPJ Web of Conferences. 2020;230. doi:10.1051/epjconf/202023000005 apa: Lombardi, F., Wang, J. W. J. L., Zhang, X., & Ivanov, P. C. (2020). Power-law correlations and coupling of active and quiet states underlie a class of complex systems with self-organization at criticality. EPJ Web of Conferences. EDP Sciences. https://doi.org/10.1051/epjconf/202023000005 chicago: Lombardi, Fabrizio, Jilin W.J.L. Wang, Xiyun Zhang, and Plamen Ch Ivanov. “Power-Law Correlations and Coupling of Active and Quiet States Underlie a Class of Complex Systems with Self-Organization at Criticality.” EPJ Web of Conferences. EDP Sciences, 2020. https://doi.org/10.1051/epjconf/202023000005. ieee: F. Lombardi, J. W. J. L. Wang, X. Zhang, and P. C. Ivanov, “Power-law correlations and coupling of active and quiet states underlie a class of complex systems with self-organization at criticality,” EPJ Web of Conferences, vol. 230. EDP Sciences, 2020. ista: Lombardi F, Wang JWJL, Zhang X, Ivanov PC. 2020. Power-law correlations and coupling of active and quiet states underlie a class of complex systems with self-organization at criticality. EPJ Web of Conferences. 230, 00005. mla: Lombardi, Fabrizio, et al. “Power-Law Correlations and Coupling of Active and Quiet States Underlie a Class of Complex Systems with Self-Organization at Criticality.” EPJ Web of Conferences, vol. 230, 00005, EDP Sciences, 2020, doi:10.1051/epjconf/202023000005. short: F. Lombardi, J.W.J.L. Wang, X. Zhang, P.C. Ivanov, EPJ Web of Conferences 230 (2020). date_created: 2020-07-12T16:20:33Z date_published: 2020-03-11T00:00:00Z date_updated: 2021-01-12T08:16:55Z day: '11' ddc: - '530' department: - _id: GaTk doi: 10.1051/epjconf/202023000005 file: - access_level: open_access content_type: application/pdf creator: dernst date_created: 2020-07-22T06:17:11Z date_updated: 2020-07-22T06:17:11Z file_id: '8144' file_name: 2020_EPJWebConf_Lombardi.pdf file_size: 2197543 relation: main_file success: 1 file_date_updated: 2020-07-22T06:17:11Z has_accepted_license: '1' intvolume: ' 230' language: - iso: eng month: '03' oa: 1 oa_version: Published Version publication: EPJ Web of Conferences publication_identifier: issn: - 2100-014X publication_status: published publisher: EDP Sciences quality_controlled: '1' status: public title: Power-law correlations and coupling of active and quiet states underlie a class of complex systems with self-organization at criticality tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 230 year: '2020' ... --- _id: '8135' abstract: - lang: eng text: Discrete Morse theory has recently lead to new developments in the theory of random geometric complexes. This article surveys the methods and results obtained with this new approach, and discusses some of its shortcomings. It uses simulations to illustrate the results and to form conjectures, getting numerical estimates for combinatorial, topological, and geometric properties of weighted and unweighted Delaunay mosaics, their dual Voronoi tessellations, and the Alpha and Wrap complexes contained in the mosaics. acknowledgement: This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreements No 78818 Alpha and No 638176). 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). alternative_title: - Abel Symposia article_processing_charge: No author: - first_name: Herbert full_name: Edelsbrunner, Herbert id: 3FB178DA-F248-11E8-B48F-1D18A9856A87 last_name: Edelsbrunner orcid: 0000-0002-9823-6833 - first_name: Anton full_name: Nikitenko, Anton id: 3E4FF1BA-F248-11E8-B48F-1D18A9856A87 last_name: Nikitenko - first_name: Katharina full_name: Ölsböck, Katharina id: 4D4AA390-F248-11E8-B48F-1D18A9856A87 last_name: Ölsböck - first_name: Peter full_name: Synak, Peter id: 331776E2-F248-11E8-B48F-1D18A9856A87 last_name: Synak citation: ama: 'Edelsbrunner H, Nikitenko A, Ölsböck K, Synak P. Radius functions on Poisson–Delaunay mosaics and related complexes experimentally. In: Topological Data Analysis. Vol 15. Springer Nature; 2020:181-218. doi:10.1007/978-3-030-43408-3_8' apa: Edelsbrunner, H., Nikitenko, A., Ölsböck, K., & Synak, P. (2020). Radius functions on Poisson–Delaunay mosaics and related complexes experimentally. In Topological Data Analysis (Vol. 15, pp. 181–218). Springer Nature. https://doi.org/10.1007/978-3-030-43408-3_8 chicago: Edelsbrunner, Herbert, Anton Nikitenko, Katharina Ölsböck, and Peter Synak. “Radius Functions on Poisson–Delaunay Mosaics and Related Complexes Experimentally.” In Topological Data Analysis, 15:181–218. Springer Nature, 2020. https://doi.org/10.1007/978-3-030-43408-3_8. ieee: H. Edelsbrunner, A. Nikitenko, K. Ölsböck, and P. Synak, “Radius functions on Poisson–Delaunay mosaics and related complexes experimentally,” in Topological Data Analysis, 2020, vol. 15, pp. 181–218. ista: Edelsbrunner H, Nikitenko A, Ölsböck K, Synak P. 2020. Radius functions on Poisson–Delaunay mosaics and related complexes experimentally. Topological Data Analysis. , Abel Symposia, vol. 15, 181–218. mla: Edelsbrunner, Herbert, et al. “Radius Functions on Poisson–Delaunay Mosaics and Related Complexes Experimentally.” Topological Data Analysis, vol. 15, Springer Nature, 2020, pp. 181–218, doi:10.1007/978-3-030-43408-3_8. short: H. Edelsbrunner, A. Nikitenko, K. Ölsböck, P. Synak, in:, Topological Data Analysis, Springer Nature, 2020, pp. 181–218. date_created: 2020-07-19T22:00:59Z date_published: 2020-06-22T00:00:00Z date_updated: 2021-01-12T08:17:06Z day: '22' ddc: - '510' department: - _id: HeEd doi: 10.1007/978-3-030-43408-3_8 ec_funded: 1 file: - access_level: open_access checksum: 7b5e0de10675d787a2ddb2091370b8d8 content_type: application/pdf creator: dernst date_created: 2020-10-08T08:56:14Z date_updated: 2020-10-08T08:56:14Z file_id: '8628' file_name: 2020-B-01-PoissonExperimentalSurvey.pdf file_size: 2207071 relation: main_file success: 1 file_date_updated: 2020-10-08T08:56:14Z has_accepted_license: '1' intvolume: ' 15' language: - iso: eng month: '06' oa: 1 oa_version: Submitted Version page: 181-218 project: - _id: 266A2E9E-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '788183' name: Alpha Shape Theory Extended - _id: 2533E772-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '638176' name: Efficient Simulation of Natural Phenomena at Extremely Large Scales - _id: 2561EBF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: I02979-N35 name: Persistence and stability of geometric complexes publication: Topological Data Analysis publication_identifier: eissn: - '21978549' isbn: - '9783030434076' issn: - '21932808' publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: Radius functions on Poisson–Delaunay mosaics and related complexes experimentally type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 15 year: '2020' ... --- _id: '8173' abstract: - lang: eng text: Understanding how the activity of membrane receptors and cellular signaling pathways shapes cell behavior is of fundamental interest in basic and applied research. Reengineering receptors to react to light instead of their cognate ligands allows for generating defined signaling inputs with high spatial and temporal precision and facilitates the dissection of complex signaling networks. Here, we describe fundamental considerations in the design of light-regulated receptor tyrosine kinases (Opto-RTKs) and appropriate control experiments. We also introduce methods for transient receptor expression in HEK293 cells, quantitative assessment of signaling activity in reporter gene assays, semiquantitative assessment of (in)activation time courses through Western blot (WB) analysis, and easy to implement light stimulation hardware. alternative_title: - Methods in Molecular Biology article_processing_charge: No author: - first_name: Stephanie full_name: Kainrath, Stephanie id: 32CFBA64-F248-11E8-B48F-1D18A9856A87 last_name: Kainrath - first_name: Harald L full_name: Janovjak, Harald L id: 33BA6C30-F248-11E8-B48F-1D18A9856A87 last_name: Janovjak orcid: 0000-0002-8023-9315 citation: ama: 'Kainrath S, Janovjak HL. Design and application of light-regulated receptor tyrosine kinases. In: Niopek D, ed. Photoswitching Proteins. Vol 2173. MIMB. Springer Nature; 2020:233-246. doi:10.1007/978-1-0716-0755-8_16' apa: Kainrath, S., & Janovjak, H. L. (2020). Design and application of light-regulated receptor tyrosine kinases. In D. Niopek (Ed.), Photoswitching Proteins (Vol. 2173, pp. 233–246). Springer Nature. https://doi.org/10.1007/978-1-0716-0755-8_16 chicago: Kainrath, Stephanie, and Harald L Janovjak. “Design and Application of Light-Regulated Receptor Tyrosine Kinases.” In Photoswitching Proteins, edited by Dominik Niopek, 2173:233–46. MIMB. Springer Nature, 2020. https://doi.org/10.1007/978-1-0716-0755-8_16. ieee: S. Kainrath and H. L. Janovjak, “Design and application of light-regulated receptor tyrosine kinases,” in Photoswitching Proteins, vol. 2173, D. Niopek, Ed. Springer Nature, 2020, pp. 233–246. ista: 'Kainrath S, Janovjak HL. 2020.Design and application of light-regulated receptor tyrosine kinases. In: Photoswitching Proteins. Methods in Molecular Biology, vol. 2173, 233–246.' mla: Kainrath, Stephanie, and Harald L. Janovjak. “Design and Application of Light-Regulated Receptor Tyrosine Kinases.” Photoswitching Proteins, edited by Dominik Niopek, vol. 2173, Springer Nature, 2020, pp. 233–46, doi:10.1007/978-1-0716-0755-8_16. short: S. Kainrath, H.L. Janovjak, in:, D. Niopek (Ed.), Photoswitching Proteins, Springer Nature, 2020, pp. 233–246. date_created: 2020-07-26T22:01:03Z date_published: 2020-07-11T00:00:00Z date_updated: 2021-01-12T08:17:17Z day: '11' department: - _id: CaGu doi: 10.1007/978-1-0716-0755-8_16 editor: - first_name: Dominik full_name: Niopek, Dominik last_name: Niopek intvolume: ' 2173' language: - iso: eng month: '07' oa_version: None page: 233-246 publication: Photoswitching Proteins publication_identifier: eisbn: - '9781071607558' eissn: - '19406029' publication_status: published publisher: Springer Nature scopus_import: '1' series_title: MIMB status: public title: Design and application of light-regulated receptor tyrosine kinases type: book_chapter user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 2173 year: '2020' ... --- _id: '8181' author: - first_name: Robert full_name: Hauschild, Robert id: 4E01D6B4-F248-11E8-B48F-1D18A9856A87 last_name: Hauschild orcid: 0000-0001-9843-3522 citation: ama: Hauschild R. Amplified centrosomes in dendritic cells promote immune cell effector functions. 2020. doi:10.15479/AT:ISTA:8181 apa: Hauschild, R. (2020). Amplified centrosomes in dendritic cells promote immune cell effector functions. IST Austria. https://doi.org/10.15479/AT:ISTA:8181 chicago: Hauschild, Robert. “Amplified Centrosomes in Dendritic Cells Promote Immune Cell Effector Functions.” IST Austria, 2020. https://doi.org/10.15479/AT:ISTA:8181. ieee: R. Hauschild, “Amplified centrosomes in dendritic cells promote immune cell effector functions.” IST Austria, 2020. ista: Hauschild R. 2020. Amplified centrosomes in dendritic cells promote immune cell effector functions, IST Austria, 10.15479/AT:ISTA:8181. mla: Hauschild, Robert. Amplified Centrosomes in Dendritic Cells Promote Immune Cell Effector Functions. IST Austria, 2020, doi:10.15479/AT:ISTA:8181. short: R. Hauschild, (2020). date_created: 2020-07-28T16:24:37Z date_published: 2020-08-24T00:00:00Z date_updated: 2021-01-11T15:29:08Z day: '24' department: - _id: Bio doi: 10.15479/AT:ISTA:8181 file: - access_level: open_access checksum: 878c60885ce30afb59a884dd5eef451c content_type: text/plain creator: rhauschild date_created: 2020-08-24T15:43:49Z date_updated: 2020-08-24T15:43:49Z file_id: '8290' file_name: centriolesDistance.m file_size: 6577 relation: main_file success: 1 - access_level: open_access checksum: 5a93ac7be2b66b28e4bd8b113ee6aade content_type: text/plain creator: rhauschild date_created: 2020-08-24T15:43:52Z date_updated: 2020-08-24T15:43:52Z file_id: '8291' file_name: goTracking.m file_size: 2680 relation: main_file success: 1 file_date_updated: 2020-08-24T15:43:52Z has_accepted_license: '1' license: https://opensource.org/licenses/BSD-3-Clause month: '08' oa: 1 publisher: IST Austria status: public title: Amplified centrosomes in dendritic cells promote immune cell effector functions tmp: legal_code_url: https://opensource.org/licenses/BSD-3-Clause name: The 3-Clause BSD License short: 3-Clause BSD type: software user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2020' ... --- _id: '8294' abstract: - lang: eng text: 'Automated root growth analysis and tracking of root tips. ' author: - first_name: Robert full_name: Hauschild, Robert id: 4E01D6B4-F248-11E8-B48F-1D18A9856A87 last_name: Hauschild orcid: 0000-0001-9843-3522 citation: ama: Hauschild R. RGtracker. 2020. doi:10.15479/AT:ISTA:8294 apa: Hauschild, R. (2020). RGtracker. IST Austria. https://doi.org/10.15479/AT:ISTA:8294 chicago: Hauschild, Robert. “RGtracker.” IST Austria, 2020. https://doi.org/10.15479/AT:ISTA:8294. ieee: R. Hauschild, “RGtracker.” IST Austria, 2020. ista: Hauschild R. 2020. RGtracker, IST Austria, 10.15479/AT:ISTA:8294. mla: Hauschild, Robert. RGtracker. IST Austria, 2020, doi:10.15479/AT:ISTA:8294. short: R. Hauschild, (2020). date_created: 2020-08-25T12:52:48Z date_published: 2020-09-10T00:00:00Z date_updated: 2021-01-12T08:17:56Z day: '10' ddc: - '570' department: - _id: Bio doi: 10.15479/AT:ISTA:8294 file: - access_level: open_access checksum: 108352149987ac6f066e4925bd56e35e content_type: text/plain creator: rhauschild date_created: 2020-09-08T14:26:31Z date_updated: 2020-09-08T14:26:31Z file_id: '8346' file_name: readme.txt file_size: 882 relation: main_file success: 1 - access_level: open_access checksum: ffd6c643b28e0cc7c6d0060a18a7e8ea content_type: application/octet-stream creator: rhauschild date_created: 2020-09-08T14:26:33Z date_updated: 2020-09-08T14:26:33Z file_id: '8347' file_name: RGtracker.mlappinstall file_size: 246121 relation: main_file success: 1 file_date_updated: 2020-09-08T14:26:33Z has_accepted_license: '1' month: '09' oa: 1 publisher: IST Austria status: public title: RGtracker tmp: legal_code_url: https://opensource.org/licenses/BSD-3-Clause name: The 3-Clause BSD License short: 3-Clause BSD type: software user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2020' ... --- _id: '8322' abstract: - lang: eng text: "Reverse firewalls were introduced at Eurocrypt 2015 by Miro-nov and Stephens-Davidowitz, as a method for protecting cryptographic protocols against attacks on the devices of the honest parties. In a nutshell: a reverse firewall is placed outside of a device and its goal is to “sanitize” the messages sent by it, in such a way that a malicious device cannot leak its secrets to the outside world. It is typically assumed that the cryptographic devices are attacked in a “functionality-preserving way” (i.e. informally speaking, the functionality of the protocol remains unchanged under this attacks). In their paper, Mironov and Stephens-Davidowitz construct a protocol for passively-secure two-party computations with firewalls, leaving extension of this result to stronger models as an open question.\r\nIn this paper, we address this problem by constructing a protocol for secure computation with firewalls that has two main advantages over the original protocol from Eurocrypt 2015. Firstly, it is a multiparty computation protocol (i.e. it works for an arbitrary number n of the parties, and not just for 2). Secondly, it is secure in much stronger corruption settings, namely in the active corruption model. More precisely: we consider an adversary that can fully corrupt up to \U0001D45B−1 parties, while the remaining parties are corrupt in a functionality-preserving way.\r\nOur core techniques are: malleable commitments and malleable non-interactive zero-knowledge, which in particular allow us to create a novel protocol for multiparty augmented coin-tossing into the well with reverse firewalls (that is based on a protocol of Lindell from Crypto 2001)." acknowledgement: We would like to thank the anonymous reviewers for their helpful comments and suggestions. The work was initiated while the first author was in IIT Madras, India. Part of this work was done while the author was visiting the University of Warsaw. This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (682815 - TOCNeT) and from the Foundation for Polish Science under grant TEAM/2016-1/4 founded within the UE 2014–2020 Smart Growth Operational Program. The last author was supported by the Independent Research Fund Denmark project BETHE and the Concordium Blockchain Research Center, Aarhus University, Denmark. alternative_title: - LNCS article_processing_charge: No author: - first_name: Suvradip full_name: Chakraborty, Suvradip id: B9CD0494-D033-11E9-B219-A439E6697425 last_name: Chakraborty - first_name: Stefan full_name: Dziembowski, Stefan last_name: Dziembowski - first_name: Jesper Buus full_name: Nielsen, Jesper Buus last_name: Nielsen citation: ama: 'Chakraborty S, Dziembowski S, Nielsen JB. Reverse firewalls for actively secure MPCs. In: Advances in Cryptology – CRYPTO 2020. Vol 12171. Springer Nature; 2020:732-762. doi:10.1007/978-3-030-56880-1_26' apa: 'Chakraborty, S., Dziembowski, S., & Nielsen, J. B. (2020). Reverse firewalls for actively secure MPCs. In Advances in Cryptology – CRYPTO 2020 (Vol. 12171, pp. 732–762). Santa Barbara, CA, United States: Springer Nature. https://doi.org/10.1007/978-3-030-56880-1_26' chicago: Chakraborty, Suvradip, Stefan Dziembowski, and Jesper Buus Nielsen. “Reverse Firewalls for Actively Secure MPCs.” In Advances in Cryptology – CRYPTO 2020, 12171:732–62. Springer Nature, 2020. https://doi.org/10.1007/978-3-030-56880-1_26. ieee: S. Chakraborty, S. Dziembowski, and J. B. Nielsen, “Reverse firewalls for actively secure MPCs,” in Advances in Cryptology – CRYPTO 2020, Santa Barbara, CA, United States, 2020, vol. 12171, pp. 732–762. ista: 'Chakraborty S, Dziembowski S, Nielsen JB. 2020. Reverse firewalls for actively secure MPCs. Advances in Cryptology – CRYPTO 2020. CRYPTO: Annual International Cryptology Conference, LNCS, vol. 12171, 732–762.' mla: Chakraborty, Suvradip, et al. “Reverse Firewalls for Actively Secure MPCs.” Advances in Cryptology – CRYPTO 2020, vol. 12171, Springer Nature, 2020, pp. 732–62, doi:10.1007/978-3-030-56880-1_26. short: S. Chakraborty, S. Dziembowski, J.B. Nielsen, in:, Advances in Cryptology – CRYPTO 2020, Springer Nature, 2020, pp. 732–762. conference: end_date: 2020-08-21 location: Santa Barbara, CA, United States name: 'CRYPTO: Annual International Cryptology Conference' start_date: 2020-08-17 date_created: 2020-08-30T22:01:12Z date_published: 2020-08-10T00:00:00Z date_updated: 2021-01-12T08:18:08Z day: '10' department: - _id: KrPi doi: 10.1007/978-3-030-56880-1_26 ec_funded: 1 intvolume: ' 12171' language: - iso: eng main_file_link: - open_access: '1' url: https://eprint.iacr.org/2019/1317 month: '08' oa: 1 oa_version: Preprint page: 732-762 project: - _id: 258AA5B2-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '682815' name: Teaching Old Crypto New Tricks publication: Advances in Cryptology – CRYPTO 2020 publication_identifier: eissn: - '16113349' isbn: - '9783030568795' issn: - '03029743' publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: Reverse firewalls for actively secure MPCs type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 12171 year: '2020' ... --- _id: '8339' abstract: - lang: eng text: "Discrete Gaussian distributions over lattices are central to lattice-based cryptography, and to the computational and mathematical aspects of lattices more broadly. The literature contains a wealth of useful theorems about the behavior of discrete Gaussians under convolutions and related operations. Yet despite their structural similarities, most of these theorems are formally incomparable, and their proofs tend to be monolithic and written nearly “from scratch,” making them unnecessarily hard to verify, understand, and extend.\r\nIn this work we present a modular framework for analyzing linear operations on discrete Gaussian distributions. The framework abstracts away the particulars of Gaussians, and usually reduces proofs to the choice of appropriate linear transformations and elementary linear algebra. To showcase the approach, we establish several general properties of discrete Gaussians, and show how to obtain all prior convolution theorems (along with some new ones) as straightforward corollaries. As another application, we describe a self-reduction for Learning With Errors (LWE) that uses a fixed number of samples to generate an unlimited number of additional ones (having somewhat larger error). The distinguishing features of our reduction are its simple analysis in our framework, and its exclusive use of discrete Gaussians without any loss in parameters relative to a prior mixed discrete-and-continuous approach.\r\nAs a contribution of independent interest, for subgaussian random matrices we prove a singular value concentration bound with explicitly stated constants, and we give tighter heuristics for specific distributions that are commonly used for generating lattice trapdoors. These bounds yield improvements in the concrete bit-security estimates for trapdoor lattice cryptosystems." alternative_title: - LNCS article_processing_charge: No author: - first_name: Nicholas full_name: Genise, Nicholas last_name: Genise - first_name: Daniele full_name: Micciancio, Daniele last_name: Micciancio - first_name: Chris full_name: Peikert, Chris last_name: Peikert - first_name: Michael full_name: Walter, Michael id: 488F98B0-F248-11E8-B48F-1D18A9856A87 last_name: Walter orcid: 0000-0003-3186-2482 citation: ama: 'Genise N, Micciancio D, Peikert C, Walter M. Improved discrete Gaussian and subgaussian analysis for lattice cryptography. In: 23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography. Vol 12110. Springer Nature; 2020:623-651. doi:10.1007/978-3-030-45374-9_21' apa: 'Genise, N., Micciancio, D., Peikert, C., & Walter, M. (2020). Improved discrete Gaussian and subgaussian analysis for lattice cryptography. In 23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography (Vol. 12110, pp. 623–651). Edinburgh, United Kingdom: Springer Nature. https://doi.org/10.1007/978-3-030-45374-9_21' chicago: Genise, Nicholas, Daniele Micciancio, Chris Peikert, and Michael Walter. “Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography.” In 23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography, 12110:623–51. Springer Nature, 2020. https://doi.org/10.1007/978-3-030-45374-9_21. ieee: N. Genise, D. Micciancio, C. Peikert, and M. Walter, “Improved discrete Gaussian and subgaussian analysis for lattice cryptography,” in 23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography, Edinburgh, United Kingdom, 2020, vol. 12110, pp. 623–651. ista: 'Genise N, Micciancio D, Peikert C, Walter M. 2020. Improved discrete Gaussian and subgaussian analysis for lattice cryptography. 23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography. PKC: Public-Key Cryptography, LNCS, vol. 12110, 623–651.' mla: Genise, Nicholas, et al. “Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography.” 23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography, vol. 12110, Springer Nature, 2020, pp. 623–51, doi:10.1007/978-3-030-45374-9_21. short: N. Genise, D. Micciancio, C. Peikert, M. Walter, in:, 23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography, Springer Nature, 2020, pp. 623–651. conference: end_date: 2020-05-07 location: Edinburgh, United Kingdom name: 'PKC: Public-Key Cryptography' start_date: 2020-05-04 date_created: 2020-09-06T22:01:13Z date_published: 2020-05-15T00:00:00Z date_updated: 2023-02-23T13:31:06Z day: '15' department: - _id: KrPi doi: 10.1007/978-3-030-45374-9_21 ec_funded: 1 intvolume: ' 12110' language: - iso: eng main_file_link: - open_access: '1' url: https://eprint.iacr.org/2020/337 month: '05' oa: 1 oa_version: Preprint page: 623-651 project: - _id: 258AA5B2-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '682815' name: Teaching Old Crypto New Tricks publication: 23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography publication_identifier: eissn: - '16113349' isbn: - '9783030453732' issn: - '03029743' publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: Improved discrete Gaussian and subgaussian analysis for lattice cryptography type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 12110 year: '2020' ... --- _id: '8572' abstract: - lang: eng text: 'We present the results of the ARCH 2020 friendly competition for formal verification of continuous and hybrid systems with linear continuous dynamics. In its fourth edition, eight tools have been applied to solve eight different benchmark problems in the category for linear continuous dynamics (in alphabetical order): CORA, C2E2, HyDRA, Hylaa, Hylaa-Continuous, JuliaReach, SpaceEx, and XSpeed. This report is a snapshot of the current landscape of tools and the types of benchmarks they are particularly suited for. Due to the diversity of problems, we are not ranking tools, yet the presented results provide one of the most complete assessments of tools for the safety verification of continuous and hybrid systems with linear continuous dynamics up to this date.' acknowledgement: "The authors gratefully acknowledge financial support by the European Commission project\r\njustITSELF under grant number 817629, by the Austrian Science Fund (FWF) under grant\r\nZ211-N23 (Wittgenstein Award), by the European Union’s Horizon 2020 research and innovation programme under the Marie Sk lodowska-Curie grant agreement No. 754411, and by the\r\nScience and Engineering Research Board (SERB) project with file number IMP/2018/000523.\r\nThis material is based upon work supported by the Air Force Office of Scientific Research under\r\naward number FA9550-19-1-0288. Any opinions, finding, and conclusions or recommendations\r\nexpressed in this material are those of the author(s) and do not necessarily reflect the views of\r\nthe United States Air Force." article_processing_charge: No author: - first_name: Matthias full_name: Althoff, Matthias last_name: Althoff - first_name: Stanley full_name: Bak, Stanley last_name: Bak - first_name: Zongnan full_name: Bao, Zongnan last_name: Bao - first_name: Marcelo full_name: Forets, Marcelo last_name: Forets - first_name: Goran full_name: Frehse, Goran last_name: Frehse - first_name: Daniel full_name: Freire, Daniel last_name: Freire - first_name: Niklas full_name: Kochdumper, Niklas last_name: Kochdumper - first_name: Yangge full_name: Li, Yangge last_name: Li - first_name: Sayan full_name: Mitra, Sayan last_name: Mitra - first_name: Rajarshi full_name: Ray, Rajarshi last_name: Ray - first_name: Christian full_name: Schilling, Christian id: 3A2F4DCE-F248-11E8-B48F-1D18A9856A87 last_name: Schilling orcid: 0000-0003-3658-1065 - first_name: Stefan full_name: Schupp, Stefan last_name: Schupp - first_name: Mark full_name: Wetzlinger, Mark last_name: Wetzlinger citation: ama: 'Althoff M, Bak S, Bao Z, et al. ARCH-COMP20 Category Report: Continuous and hybrid systems with linear dynamics. In: EPiC Series in Computing. Vol 74. EasyChair; 2020:16-48. doi:10.29007/7dt2' apa: 'Althoff, M., Bak, S., Bao, Z., Forets, M., Frehse, G., Freire, D., … Wetzlinger, M. (2020). ARCH-COMP20 Category Report: Continuous and hybrid systems with linear dynamics. In EPiC Series in Computing (Vol. 74, pp. 16–48). EasyChair. https://doi.org/10.29007/7dt2' chicago: 'Althoff, Matthias, Stanley Bak, Zongnan Bao, Marcelo Forets, Goran Frehse, Daniel Freire, Niklas Kochdumper, et al. “ARCH-COMP20 Category Report: Continuous and Hybrid Systems with Linear Dynamics.” In EPiC Series in Computing, 74:16–48. EasyChair, 2020. https://doi.org/10.29007/7dt2.' ieee: 'M. Althoff et al., “ARCH-COMP20 Category Report: Continuous and hybrid systems with linear dynamics,” in EPiC Series in Computing, 2020, vol. 74, pp. 16–48.' ista: 'Althoff M, Bak S, Bao Z, Forets M, Frehse G, Freire D, Kochdumper N, Li Y, Mitra S, Ray R, Schilling C, Schupp S, Wetzlinger M. 2020. ARCH-COMP20 Category Report: Continuous and hybrid systems with linear dynamics. EPiC Series in Computing. ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems vol. 74, 16–48.' mla: 'Althoff, Matthias, et al. “ARCH-COMP20 Category Report: Continuous and Hybrid Systems with Linear Dynamics.” EPiC Series in Computing, vol. 74, EasyChair, 2020, pp. 16–48, doi:10.29007/7dt2.' short: M. Althoff, S. Bak, Z. Bao, M. Forets, G. Frehse, D. Freire, N. Kochdumper, Y. Li, S. Mitra, R. Ray, C. Schilling, S. Schupp, M. Wetzlinger, in:, EPiC Series in Computing, EasyChair, 2020, pp. 16–48. conference: end_date: 2020-07-12 name: 'ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems' start_date: 2020-07-12 date_created: 2020-09-26T14:49:43Z date_published: 2020-09-25T00:00:00Z date_updated: 2021-01-12T08:20:06Z day: '25' department: - _id: ToHe doi: 10.29007/7dt2 ec_funded: 1 intvolume: ' 74' language: - iso: eng main_file_link: - open_access: '1' url: https://easychair.org/publications/download/DRpS month: '09' oa: 1 oa_version: Published Version page: 16-48 project: - _id: 25C5A090-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z00312 name: The Wittgenstein Prize - _id: 260C2330-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '754411' name: ISTplus - Postdoctoral Fellowships publication: EPiC Series in Computing publication_status: published publisher: EasyChair quality_controlled: '1' status: public title: 'ARCH-COMP20 Category Report: Continuous and hybrid systems with linear dynamics' type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 74 year: '2020' ... --- _id: '8571' abstract: - lang: eng text: We present the results of a friendly competition for formal verification of continuous and hybrid systems with nonlinear continuous dynamics. The friendly competition took place as part of the workshop Applied Verification for Continuous and Hybrid Systems (ARCH) in 2020. This year, 6 tools Ariadne, CORA, DynIbex, Flow*, Isabelle/HOL, and JuliaReach (in alphabetic order) participated. These tools are applied to solve reachability analysis problems on six benchmark problems, two of them featuring hybrid dynamics. We do not rank the tools based on the results, but show the current status and discover the potential advantages of different tools. acknowledgement: Christian Schilling acknowledges support in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award) and the European Union’s Horizon 2020 research and innovation programme under the Marie Sk lodowska-Curie grant agreement No. 754411. article_processing_charge: No author: - first_name: Luca full_name: Geretti, Luca last_name: Geretti - first_name: Julien full_name: Alexandre Dit Sandretto, Julien last_name: Alexandre Dit Sandretto - first_name: Matthias full_name: Althoff, Matthias last_name: Althoff - first_name: Luis full_name: Benet, Luis last_name: Benet - first_name: Alexandre full_name: Chapoutot, Alexandre last_name: Chapoutot - first_name: Xin full_name: Chen, Xin last_name: Chen - first_name: Pieter full_name: Collins, Pieter last_name: Collins - first_name: Marcelo full_name: Forets, Marcelo last_name: Forets - first_name: Daniel full_name: Freire, Daniel last_name: Freire - first_name: Fabian full_name: Immler, Fabian last_name: Immler - first_name: Niklas full_name: Kochdumper, Niklas last_name: Kochdumper - first_name: David full_name: Sanders, David last_name: Sanders - first_name: Christian full_name: Schilling, Christian id: 3A2F4DCE-F248-11E8-B48F-1D18A9856A87 last_name: Schilling orcid: 0000-0003-3658-1065 citation: ama: 'Geretti L, Alexandre Dit Sandretto J, Althoff M, et al. ARCH-COMP20 Category Report: Continuous and hybrid systems with nonlinear dynamics. In: EPiC Series in Computing. Vol 74. EasyChair; 2020:49-75. doi:10.29007/zkf6' apa: 'Geretti, L., Alexandre Dit Sandretto, J., Althoff, M., Benet, L., Chapoutot, A., Chen, X., … Schilling, C. (2020). ARCH-COMP20 Category Report: Continuous and hybrid systems with nonlinear dynamics. In EPiC Series in Computing (Vol. 74, pp. 49–75). EasyChair. https://doi.org/10.29007/zkf6' chicago: 'Geretti, Luca, Julien Alexandre Dit Sandretto, Matthias Althoff, Luis Benet, Alexandre Chapoutot, Xin Chen, Pieter Collins, et al. “ARCH-COMP20 Category Report: Continuous and Hybrid Systems with Nonlinear Dynamics.” In EPiC Series in Computing, 74:49–75. EasyChair, 2020. https://doi.org/10.29007/zkf6.' ieee: 'L. Geretti et al., “ARCH-COMP20 Category Report: Continuous and hybrid systems with nonlinear dynamics,” in EPiC Series in Computing, 2020, vol. 74, pp. 49–75.' ista: 'Geretti L, Alexandre Dit Sandretto J, Althoff M, Benet L, Chapoutot A, Chen X, Collins P, Forets M, Freire D, Immler F, Kochdumper N, Sanders D, Schilling C. 2020. ARCH-COMP20 Category Report: Continuous and hybrid systems with nonlinear dynamics. EPiC Series in Computing. ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems vol. 74, 49–75.' mla: 'Geretti, Luca, et al. “ARCH-COMP20 Category Report: Continuous and Hybrid Systems with Nonlinear Dynamics.” EPiC Series in Computing, vol. 74, EasyChair, 2020, pp. 49–75, doi:10.29007/zkf6.' short: L. Geretti, J. Alexandre Dit Sandretto, M. Althoff, L. Benet, A. Chapoutot, X. Chen, P. Collins, M. Forets, D. Freire, F. Immler, N. Kochdumper, D. Sanders, C. Schilling, in:, EPiC Series in Computing, EasyChair, 2020, pp. 49–75. conference: end_date: 2020-07-12 name: 'ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems' start_date: 2020-07-12 date_created: 2020-09-26T14:41:29Z date_published: 2020-09-25T00:00:00Z date_updated: 2021-01-12T08:20:06Z day: '25' department: - _id: ToHe doi: 10.29007/zkf6 ec_funded: 1 intvolume: ' 74' language: - iso: eng main_file_link: - open_access: '1' url: https://easychair.org/publications/download/nrdD month: '09' oa: 1 oa_version: Published Version page: 49-75 project: - _id: 260C2330-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '754411' name: ISTplus - Postdoctoral Fellowships - _id: 25F42A32-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z211 name: The Wittgenstein Prize publication: EPiC Series in Computing publication_status: published publisher: EasyChair quality_controlled: '1' status: public title: 'ARCH-COMP20 Category Report: Continuous and hybrid systems with nonlinear dynamics' type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 74 year: '2020' ... --- _id: '8600' abstract: - lang: eng text: 'A vector addition system with states (VASS) consists of a finite set of states and counters. A transition changes the current state to the next state, and every counter is either incremented, or decremented, or left unchanged. A state and value for each counter is a configuration; and a computation is an infinite sequence of configurations with transitions between successive configurations. A probabilistic VASS consists of a VASS along with a probability distribution over the transitions for each state. Qualitative properties such as state and configuration reachability have been widely studied for VASS. In this work we consider multi-dimensional long-run average objectives for VASS and probabilistic VASS. For a counter, the cost of a configuration is the value of the counter; and the long-run average value of a computation for the counter is the long-run average of the costs of the configurations in the computation. The multi-dimensional long-run average problem given a VASS and a threshold value for each counter, asks whether there is a computation such that for each counter the long-run average value for the counter does not exceed the respective threshold. For probabilistic VASS, instead of the existence of a computation, we consider whether the expected long-run average value for each counter does not exceed the respective threshold. Our main results are as follows: we show that the multi-dimensional long-run average problem (a) is NP-complete for integer-valued VASS; (b) is undecidable for natural-valued VASS (i.e., nonnegative counters); and (c) can be solved in polynomial time for probabilistic integer-valued VASS, and probabilistic natural-valued VASS when all computations are non-terminating.' alternative_title: - LIPIcs article_number: '23' article_processing_charge: No author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000-0002-2985-7724 - first_name: Jan full_name: Otop, Jan id: 2FC5DA74-F248-11E8-B48F-1D18A9856A87 last_name: Otop citation: ama: 'Chatterjee K, Henzinger TA, Otop J. Multi-dimensional long-run average problems for vector addition systems with states. In: 31st International Conference on Concurrency Theory. Vol 171. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.CONCUR.2020.23' apa: 'Chatterjee, K., Henzinger, T. A., & Otop, J. (2020). Multi-dimensional long-run average problems for vector addition systems with states. In 31st International Conference on Concurrency Theory (Vol. 171). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2020.23' chicago: Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States.” In 31st International Conference on Concurrency Theory, Vol. 171. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.CONCUR.2020.23. ieee: K. Chatterjee, T. A. Henzinger, and J. Otop, “Multi-dimensional long-run average problems for vector addition systems with states,” in 31st International Conference on Concurrency Theory, Virtual, 2020, vol. 171. ista: 'Chatterjee K, Henzinger TA, Otop J. 2020. Multi-dimensional long-run average problems for vector addition systems with states. 31st International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 171, 23.' mla: Chatterjee, Krishnendu, et al. “Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States.” 31st International Conference on Concurrency Theory, vol. 171, 23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.CONCUR.2020.23. short: K. Chatterjee, T.A. Henzinger, J. Otop, in:, 31st International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. conference: end_date: 2020-09-04 location: Virtual name: 'CONCUR: Conference on Concurrency Theory' start_date: 2020-09-01 date_created: 2020-10-04T22:01:36Z date_published: 2020-08-06T00:00:00Z date_updated: 2021-01-12T08:20:15Z day: '06' ddc: - '000' department: - _id: KrCh - _id: ToHe doi: 10.4230/LIPIcs.CONCUR.2020.23 external_id: arxiv: - '2007.08917' file: - access_level: open_access checksum: 5039752f644c4b72b9361d21a5e31baf content_type: application/pdf creator: dernst date_created: 2020-10-05T14:04:25Z date_updated: 2020-10-05T14:04:25Z file_id: '8610' file_name: 2020_LIPIcsCONCUR_Chatterjee.pdf file_size: 601231 relation: main_file success: 1 file_date_updated: 2020-10-05T14:04:25Z has_accepted_license: '1' intvolume: ' 171' language: - iso: eng month: '08' oa: 1 oa_version: Published Version project: - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 25F2ACDE-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11402-N23 name: Rigorous Systems Engineering - _id: 25F42A32-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z211 name: The Wittgenstein Prize publication: 31st International Conference on Concurrency Theory publication_identifier: isbn: - '9783959771603' issn: - '18688969' publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: '1' status: public title: Multi-dimensional long-run average problems for vector addition systems with states tmp: image: /images/cc_by.png 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) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 171 year: '2020' ... --- _id: '8599' abstract: - lang: eng text: A graph game is a two-player zero-sum game in which the players move a token throughout a graph to produce an infinite path, which determines the winner or payoff of the game. In bidding games, both players have budgets, and in each turn, we hold an "auction" (bidding) to determine which player moves the token. In this survey, we consider several bidding mechanisms and study their effect on the properties of the game. Specifically, bidding games, and in particular bidding games of infinite duration, have an intriguing equivalence with random-turn games in which in each turn, the player who moves is chosen randomly. We show how minor changes in the bidding mechanism lead to unexpected differences in the equivalence with random-turn games. acknowledgement: We would like to thank all our collaborators Milad Aghajohari, Ventsislav Chonev, Rasmus Ibsen-Jensen, Ismäel Jecker, Petr Novotný, Josef Tkadlec, and Ðorđe Žikelić; we hope the collaboration was as fun and meaningful for you as it was for us. alternative_title: - LIPIcs article_number: '2' article_processing_charge: No author: - first_name: Guy full_name: Avni, Guy id: 463C8BC2-F248-11E8-B48F-1D18A9856A87 last_name: Avni orcid: 0000-0001-5588-8287 - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000-0002-2985-7724 citation: ama: 'Avni G, Henzinger TA. A survey of bidding games on graphs. In: 31st International Conference on Concurrency Theory. Vol 171. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.CONCUR.2020.2' apa: 'Avni, G., & Henzinger, T. A. (2020). A survey of bidding games on graphs. In 31st International Conference on Concurrency Theory (Vol. 171). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2020.2' chicago: Avni, Guy, and Thomas A Henzinger. “A Survey of Bidding Games on Graphs.” In 31st International Conference on Concurrency Theory, Vol. 171. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.CONCUR.2020.2. ieee: G. Avni and T. A. Henzinger, “A survey of bidding games on graphs,” in 31st International Conference on Concurrency Theory, Virtual, 2020, vol. 171. ista: 'Avni G, Henzinger TA. 2020. A survey of bidding games on graphs. 31st International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 171, 2.' mla: Avni, Guy, and Thomas A. Henzinger. “A Survey of Bidding Games on Graphs.” 31st International Conference on Concurrency Theory, vol. 171, 2, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.CONCUR.2020.2. short: G. Avni, T.A. Henzinger, in:, 31st International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. conference: end_date: 2020-09-04 location: Virtual name: 'CONCUR: Conference on Concurrency Theory' start_date: 2020-09-01 date_created: 2020-10-04T22:01:36Z date_published: 2020-08-06T00:00:00Z date_updated: 2021-01-12T08:20:13Z day: '06' ddc: - '000' department: - _id: ToHe doi: 10.4230/LIPIcs.CONCUR.2020.2 file: - access_level: open_access checksum: 8f33b098e73724e0ac817f764d8e1a2d content_type: application/pdf creator: dernst date_created: 2020-10-05T14:13:19Z date_updated: 2020-10-05T14:13:19Z file_id: '8611' file_name: 2020_LIPIcsCONCUR_Avni.pdf file_size: 868510 relation: main_file success: 1 file_date_updated: 2020-10-05T14:13:19Z has_accepted_license: '1' intvolume: ' 171' language: - iso: eng month: '08' oa: 1 oa_version: Published Version project: - _id: 25F42A32-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z211 name: The Wittgenstein Prize publication: 31st International Conference on Concurrency Theory publication_identifier: isbn: - '9783959771603' issn: - '18688969' publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: '1' status: public title: A survey of bidding games on graphs tmp: image: /images/cc_by.png 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) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 171 year: '2020' ... --- _id: '8725' abstract: - lang: eng text: "The design and implementation of efficient concurrent data structures have\r\nseen significant attention. However, most of this work has focused on\r\nconcurrent data structures providing good \\emph{worst-case} guarantees. In real\r\nworkloads, objects are often accessed at different rates, since access\r\ndistributions may be non-uniform. Efficient distribution-adaptive data\r\nstructures are known in the sequential case, e.g. the splay-trees; however,\r\nthey often are hard to translate efficiently in the concurrent case.\r\n In this paper, we investigate distribution-adaptive concurrent data\r\nstructures and propose a new design called the splay-list. At a high level, the\r\nsplay-list is similar to a standard skip-list, with the key distinction that\r\nthe height of each element adapts dynamically to its access rate: popular\r\nelements ``move up,'' whereas rarely-accessed elements decrease in height. We\r\nshow that the splay-list provides order-optimal amortized complexity bounds for\r\na subset of operations while being amenable to efficient concurrent\r\nimplementation. Experimental results show that the splay-list can leverage\r\ndistribution-adaptivity to improve on the performance of classic concurrent\r\ndesigns, and can outperform the only previously-known distribution-adaptive\r\ndesign in certain settings." acknowledgement: "Vitaly Aksenov: Government of Russian Federation (Grant 08-08).\r\nDan Alistarh: ERC Starting Grant 805223 ScaleML." article_processing_charge: No author: - first_name: Vitaly full_name: Aksenov, Vitaly last_name: Aksenov - first_name: Dan-Adrian full_name: Alistarh, Dan-Adrian id: 4A899BFC-F248-11E8-B48F-1D18A9856A87 last_name: Alistarh orcid: 0000-0003-3650-940X - first_name: Alexandra full_name: Drozdova, Alexandra last_name: Drozdova - first_name: Amirkeivan full_name: Mohtashami, Amirkeivan last_name: Mohtashami citation: ama: 'Aksenov V, Alistarh D-A, Drozdova A, Mohtashami A. The splay-list: A distribution-adaptive concurrent skip-list. In: 34th International Symposium on Distributed Computing. Vol 179. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020:3:1-3:18. doi:10.4230/LIPIcs.DISC.2020.3' apa: 'Aksenov, V., Alistarh, D.-A., Drozdova, A., & Mohtashami, A. (2020). The splay-list: A distribution-adaptive concurrent skip-list. In 34th International Symposium on Distributed Computing (Vol. 179, p. 3:1-3:18). Freiburg, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.DISC.2020.3' chicago: 'Aksenov, Vitaly, Dan-Adrian Alistarh, Alexandra Drozdova, and Amirkeivan Mohtashami. “The Splay-List: A Distribution-Adaptive Concurrent Skip-List.” In 34th International Symposium on Distributed Computing, 179:3:1-3:18. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.DISC.2020.3.' ieee: 'V. Aksenov, D.-A. Alistarh, A. Drozdova, and A. Mohtashami, “The splay-list: A distribution-adaptive concurrent skip-list,” in 34th International Symposium on Distributed Computing, Freiburg, Germany, 2020, vol. 179, p. 3:1-3:18.' ista: 'Aksenov V, Alistarh D-A, Drozdova A, Mohtashami A. 2020. The splay-list: A distribution-adaptive concurrent skip-list. 34th International Symposium on Distributed Computing. DISC: Symposium on Distributed ComputingLIPIcs vol. 179, 3:1-3:18.' mla: 'Aksenov, Vitaly, et al. “The Splay-List: A Distribution-Adaptive Concurrent Skip-List.” 34th International Symposium on Distributed Computing, vol. 179, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, p. 3:1-3:18, doi:10.4230/LIPIcs.DISC.2020.3.' short: V. Aksenov, D.-A. Alistarh, A. Drozdova, A. Mohtashami, in:, 34th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, p. 3:1-3:18. conference: end_date: 2020-10-16 location: Freiburg, Germany name: 'DISC: Symposium on Distributed Computing' start_date: 2020-10-12 date_created: 2020-11-05T15:26:17Z date_published: 2020-08-03T00:00:00Z date_updated: 2023-02-23T13:41:40Z day: '03' ddc: - '000' department: - _id: DaAl doi: 10.4230/LIPIcs.DISC.2020.3 ec_funded: 1 external_id: arxiv: - '2008.01009' file: - access_level: open_access checksum: a626a9c47df52b6f6d97edd910dae4ba content_type: application/pdf creator: dernst date_created: 2021-03-11T12:33:35Z date_updated: 2021-03-11T12:33:35Z file_id: '9237' file_name: 2020_LIPIcs_Aksenov.pdf file_size: 740358 relation: main_file success: 1 file_date_updated: 2021-03-11T12:33:35Z has_accepted_license: '1' intvolume: ' 179' language: - iso: eng month: '08' oa: 1 oa_version: Published Version page: 3:1-3:18 project: - _id: 268A44D6-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '805223' name: Elastic Coordination for Scalable Machine Learning publication: 34th International Symposium on Distributed Computing publication_identifier: isbn: - '9783959771689' issn: - 1868-8969 publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' series_title: LIPIcs status: public title: 'The splay-list: A distribution-adaptive concurrent skip-list' tmp: image: /images/cc_by.png 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) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 179 year: '2020' ... --- _id: '8726' abstract: - lang: eng text: Several realistic spin-orbital models for transition metal oxides go beyond the classical expectations and could be understood only by employing the quantum entanglement. Experiments on these materials confirm that spin-orbital entanglement has measurable consequences. Here, we capture the essential features of spin-orbital entanglement in complex quantum matter utilizing 1D spin-orbital model which accommodates SU(2)⊗SU(2) symmetric Kugel-Khomskii superexchange as well as the Ising on-site spin-orbit coupling. Building on the results obtained for full and effective models in the regime of strong spin-orbit coupling, we address the question whether the entanglement found on superexchange bonds always increases when the Ising spin-orbit coupling is added. We show that (i) quantum entanglement is amplified by strong spin-orbit coupling and, surprisingly, (ii) almost classical disentangled states are possible. We complete the latter case by analyzing how the entanglement existing for intermediate values of spin-orbit coupling can disappear for higher values of this coupling. article_number: '53' article_processing_charge: No article_type: original author: - first_name: Dorota full_name: Gotfryd, Dorota last_name: Gotfryd - first_name: Ekaterina full_name: Paerschke, Ekaterina id: 8275014E-6063-11E9-9B7F-6338E6697425 last_name: Paerschke orcid: 0000-0003-0853-8182 - first_name: Krzysztof full_name: Wohlfeld, Krzysztof last_name: Wohlfeld - first_name: Andrzej M. full_name: Oleś, Andrzej M. last_name: Oleś citation: ama: Gotfryd D, Paerschke E, Wohlfeld K, Oleś AM. Evolution of spin-orbital entanglement with increasing ising spin-orbit coupling. Condensed Matter. 2020;5(3). doi:10.3390/condmat5030053 apa: Gotfryd, D., Paerschke, E., Wohlfeld, K., & Oleś, A. M. (2020). Evolution of spin-orbital entanglement with increasing ising spin-orbit coupling. Condensed Matter. MDPI. https://doi.org/10.3390/condmat5030053 chicago: Gotfryd, Dorota, Ekaterina Paerschke, Krzysztof Wohlfeld, and Andrzej M. Oleś. “Evolution of Spin-Orbital Entanglement with Increasing Ising Spin-Orbit Coupling.” Condensed Matter. MDPI, 2020. https://doi.org/10.3390/condmat5030053. ieee: D. Gotfryd, E. Paerschke, K. Wohlfeld, and A. M. Oleś, “Evolution of spin-orbital entanglement with increasing ising spin-orbit coupling,” Condensed Matter, vol. 5, no. 3. MDPI, 2020. ista: Gotfryd D, Paerschke E, Wohlfeld K, Oleś AM. 2020. Evolution of spin-orbital entanglement with increasing ising spin-orbit coupling. Condensed Matter. 5(3), 53. mla: Gotfryd, Dorota, et al. “Evolution of Spin-Orbital Entanglement with Increasing Ising Spin-Orbit Coupling.” Condensed Matter, vol. 5, no. 3, 53, MDPI, 2020, doi:10.3390/condmat5030053. short: D. Gotfryd, E. Paerschke, K. Wohlfeld, A.M. Oleś, Condensed Matter 5 (2020). date_created: 2020-11-06T07:21:00Z date_published: 2020-08-26T00:00:00Z date_updated: 2021-01-12T08:20:46Z day: '26' ddc: - '530' department: - _id: MiLe doi: 10.3390/condmat5030053 ec_funded: 1 external_id: arxiv: - '2009.11773' file: - access_level: open_access checksum: a57a698ff99a11b6665bafd1bac7afbc content_type: application/pdf creator: dernst date_created: 2020-11-06T07:24:40Z date_updated: 2020-11-06T07:24:40Z file_id: '8727' file_name: 2020_CondensedMatter_Gotfryd.pdf file_size: 768336 relation: main_file success: 1 file_date_updated: 2020-11-06T07:24:40Z has_accepted_license: '1' intvolume: ' 5' issue: '3' language: - iso: eng month: '08' oa: 1 oa_version: Published Version project: - _id: 260C2330-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '754411' name: ISTplus - Postdoctoral Fellowships publication: Condensed Matter publication_identifier: issn: - 2410-3896 publication_status: published publisher: MDPI quality_controlled: '1' scopus_import: '1' status: public title: Evolution of spin-orbital entanglement with increasing ising spin-orbit coupling tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 5 year: '2020' ... --- _id: '9040' abstract: - lang: eng text: Machine learning and formal methods have complimentary benefits and drawbacks. In this work, we address the controller-design problem with a combination of techniques from both fields. The use of black-box neural networks in deep reinforcement learning (deep RL) poses a challenge for such a combination. Instead of reasoning formally about the output of deep RL, which we call the wizard, we extract from it a decision-tree based model, which we refer to as the magic book. Using the extracted model as an intermediary, we are able to handle problems that are infeasible for either deep RL or formal methods by themselves. First, we suggest, for the first time, a synthesis procedure that is based on a magic book. We synthesize a stand-alone correct-by-design controller that enjoys the favorable performance of RL. Second, we incorporate a magic book in a bounded model checking (BMC) procedure. BMC allows us to find numerous traces of the plant under the control of the wizard, which a user can use to increase the trustworthiness of the wizard and direct further training. acknowledgement: This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). article_processing_charge: No author: - first_name: Par Alizadeh full_name: Alamdari, Par Alizadeh last_name: Alamdari - first_name: Guy full_name: Avni, Guy id: 463C8BC2-F248-11E8-B48F-1D18A9856A87 last_name: Avni orcid: 0000-0001-5588-8287 - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000-0002-2985-7724 - first_name: Anna full_name: Lukina, Anna id: CBA4D1A8-0FE8-11E9-BDE6-07BFE5697425 last_name: Lukina citation: ama: 'Alamdari PA, Avni G, Henzinger TA, Lukina A. Formal methods with a touch of magic. In: Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design. TU Wien Academic Press; 2020:138-147. doi:10.34727/2020/isbn.978-3-85448-042-6_21' apa: 'Alamdari, P. A., Avni, G., Henzinger, T. A., & Lukina, A. (2020). Formal methods with a touch of magic. In Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design (pp. 138–147). Online Conference: TU Wien Academic Press. https://doi.org/10.34727/2020/isbn.978-3-85448-042-6_21' chicago: Alamdari, Par Alizadeh, Guy Avni, Thomas A Henzinger, and Anna Lukina. “Formal Methods with a Touch of Magic.” In Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design, 138–47. TU Wien Academic Press, 2020. https://doi.org/10.34727/2020/isbn.978-3-85448-042-6_21. ieee: P. A. Alamdari, G. Avni, T. A. Henzinger, and A. Lukina, “Formal methods with a touch of magic,” in Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design, Online Conference, 2020, pp. 138–147. ista: 'Alamdari PA, Avni G, Henzinger TA, Lukina A. 2020. Formal methods with a touch of magic. Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design. FMCAD: Formal Methods in Computer-Aided Design, 138–147.' mla: Alamdari, Par Alizadeh, et al. “Formal Methods with a Touch of Magic.” Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design, TU Wien Academic Press, 2020, pp. 138–47, doi:10.34727/2020/isbn.978-3-85448-042-6_21. short: P.A. Alamdari, G. Avni, T.A. Henzinger, A. Lukina, in:, Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design, TU Wien Academic Press, 2020, pp. 138–147. conference: end_date: 2020-09-24 location: Online Conference name: ' FMCAD: Formal Methods in Computer-Aided Design' start_date: 2020-09-21 date_created: 2021-01-24T23:01:10Z date_published: 2020-09-21T00:00:00Z date_updated: 2021-02-09T09:39:59Z day: '21' ddc: - '000' department: - _id: ToHe doi: 10.34727/2020/isbn.978-3-85448-042-6_21 file: - access_level: open_access checksum: d616d549a0ade78606b16f8a9540820f content_type: application/pdf creator: dernst date_created: 2021-02-09T09:39:02Z date_updated: 2021-02-09T09:39:02Z file_id: '9109' file_name: 2020_FMCAD_Alamdari.pdf file_size: 990999 relation: main_file success: 1 file_date_updated: 2021-02-09T09:39:02Z has_accepted_license: '1' language: - iso: eng month: '09' oa: 1 oa_version: Published Version page: 138-147 project: - _id: 25F42A32-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z211 name: The Wittgenstein Prize publication: Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design publication_identifier: eissn: - 2708-7824 isbn: - '9783854480426' publication_status: published publisher: TU Wien Academic Press quality_controlled: '1' scopus_import: '1' status: public title: Formal methods with a touch of magic tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2020' ... --- _id: '9096' article_processing_charge: No author: - first_name: Paul full_name: Schmid-Hempel, Paul last_name: Schmid-Hempel - first_name: Sylvia M full_name: Cremer, Sylvia M id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87 last_name: Cremer orcid: 0000-0002-2193-3868 citation: ama: 'Schmid-Hempel P, Cremer S. Parasites and Pathogens. In: Starr C, ed. Encyclopedia of Social Insects. Cham: Springer Nature; 2020. doi:10.1007/978-3-319-90306-4_94-1' apa: 'Schmid-Hempel, P., & Cremer, S. (2020). Parasites and Pathogens. In C. Starr (Ed.), Encyclopedia of Social Insects. Cham: Springer Nature. https://doi.org/10.1007/978-3-319-90306-4_94-1' chicago: 'Schmid-Hempel, Paul, and Sylvia Cremer. “Parasites and Pathogens.” In Encyclopedia of Social Insects, edited by C Starr. Cham: Springer Nature, 2020. https://doi.org/10.1007/978-3-319-90306-4_94-1.' ieee: 'P. Schmid-Hempel and S. Cremer, “Parasites and Pathogens,” in Encyclopedia of Social Insects, C. Starr, Ed. Cham: Springer Nature, 2020.' ista: 'Schmid-Hempel P, Cremer S. 2020.Parasites and Pathogens. In: Encyclopedia of Social Insects. .' mla: Schmid-Hempel, Paul, and Sylvia Cremer. “Parasites and Pathogens.” Encyclopedia of Social Insects, edited by C Starr, Springer Nature, 2020, doi:10.1007/978-3-319-90306-4_94-1. short: P. Schmid-Hempel, S. Cremer, in:, C. Starr (Ed.), Encyclopedia of Social Insects, Springer Nature, Cham, 2020. date_created: 2021-02-05T12:15:18Z date_published: 2020-02-22T00:00:00Z date_updated: 2021-02-05T12:19:21Z day: '22' department: - _id: SyCr doi: 10.1007/978-3-319-90306-4_94-1 editor: - first_name: C full_name: Starr, C last_name: Starr language: - iso: eng month: '02' oa_version: None place: Cham publication: Encyclopedia of Social Insects publication_identifier: isbn: - '9783319903064' publication_status: published publisher: Springer Nature quality_controlled: '1' status: public title: Parasites and Pathogens type: book_chapter user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2020' ... --- _id: '9123' abstract: - lang: eng text: 'Inversions are chromosomal rearrangements where the order of genes is reversed. Inversions originate by mutation and can be under positive, negative or balancing selection. Selective effects result from potential disruptive effects on meiosis, gene disruption at inversion breakpoints and, importantly, the effects of inversions as modifiers of recombination rate: Recombination is strongly reduced in individuals heterozygous for an inversion, allowing for alleles at different loci to be inherited as a ‘block’. This may lead to a selective advantage whenever it is favourable to keep certain combinations of alleles associated, for example under local adaptation with gene flow. Inversions can cover a considerable part of a chromosome and contain numerous loci under different selection pressures, so that the resulting overall effects may be complex. Empirical data from various systems show that inversions may have a prominent role in local adaptation, speciation, parallel evolution, the maintenance of polymorphism and sex chromosome evolution.' article_processing_charge: No author: - first_name: Anja M full_name: Westram, Anja M id: 3C147470-F248-11E8-B48F-1D18A9856A87 last_name: Westram orcid: 0000-0003-1050-4969 - first_name: Rui full_name: Faria, Rui last_name: Faria - first_name: Roger full_name: Butlin, Roger last_name: Butlin - first_name: Kerstin full_name: Johannesson, Kerstin last_name: Johannesson citation: ama: 'Westram AM, Faria R, Butlin R, Johannesson K. Inversions and Evolution. In: ELS. Wiley; 2020. doi:10.1002/9780470015902.a0029007' apa: Westram, A. M., Faria, R., Butlin, R., & Johannesson, K. (2020). Inversions and Evolution. In eLS. Wiley. https://doi.org/10.1002/9780470015902.a0029007 chicago: Westram, Anja M, Rui Faria, Roger Butlin, and Kerstin Johannesson. “Inversions and Evolution.” In ELS. Wiley, 2020. https://doi.org/10.1002/9780470015902.a0029007. ieee: A. M. Westram, R. Faria, R. Butlin, and K. Johannesson, “Inversions and Evolution,” in eLS, Wiley, 2020. ista: 'Westram AM, Faria R, Butlin R, Johannesson K. 2020.Inversions and Evolution. In: eLS. .' mla: Westram, Anja M., et al. “Inversions and Evolution.” ELS, Wiley, 2020, doi:10.1002/9780470015902.a0029007. short: A.M. Westram, R. Faria, R. Butlin, K. Johannesson, in:, ELS, Wiley, 2020. date_created: 2021-02-15T12:39:04Z date_published: 2020-05-16T00:00:00Z date_updated: 2021-02-15T13:18:16Z day: '16' department: - _id: NiBa doi: 10.1002/9780470015902.a0029007 language: - iso: eng month: '05' oa_version: None publication: eLS publication_identifier: isbn: - '9780470016176' - '9780470015902' publication_status: published publisher: Wiley quality_controlled: '1' status: public title: Inversions and Evolution type: book_chapter user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2020' ... --- _id: '9249' abstract: - lang: eng text: Rhombic dodecahedron is a space filling polyhedron which represents the close packing of spheres in 3D space and the Voronoi structures of the face centered cubic (FCC) lattice. In this paper, we describe a new coordinate system where every 3-integer coordinates grid point corresponds to a rhombic dodecahedron centroid. In order to illustrate the interest of the new coordinate system, we propose the characterization of 3D digital plane with its topological features, such as the interrelation between the thickness of the digital plane and the separability constraint we aim to obtain. We also present the characterization of 3D digital lines and study it as the intersection of multiple digital planes. Characterization of 3D digital sphere with relevant topological features is proposed as well along with the 48-symmetry appearing in the new coordinate system. acknowledgement: "This work has been partially supported by the European Research Council (ERC) under\r\nthe European Union’s Horizon 2020 research and innovation programme, grant no. 788183, and the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, Austrian Science Fund (FWF), grant no. I 02979-N35. " article_processing_charge: No article_type: original author: - first_name: Ranita full_name: Biswas, Ranita id: 3C2B033E-F248-11E8-B48F-1D18A9856A87 last_name: Biswas orcid: 0000-0002-5372-7890 - first_name: Gaëlle full_name: Largeteau-Skapin, Gaëlle last_name: Largeteau-Skapin - first_name: Rita full_name: Zrour, Rita last_name: Zrour - first_name: Eric full_name: Andres, Eric last_name: Andres citation: ama: Biswas R, Largeteau-Skapin G, Zrour R, Andres E. Digital objects in rhombic dodecahedron grid. Mathematical Morphology - Theory and Applications. 2020;4(1):143-158. doi:10.1515/mathm-2020-0106 apa: Biswas, R., Largeteau-Skapin, G., Zrour, R., & Andres, E. (2020). Digital objects in rhombic dodecahedron grid. Mathematical Morphology - Theory and Applications. De Gruyter. https://doi.org/10.1515/mathm-2020-0106 chicago: Biswas, Ranita, Gaëlle Largeteau-Skapin, Rita Zrour, and Eric Andres. “Digital Objects in Rhombic Dodecahedron Grid.” Mathematical Morphology - Theory and Applications. De Gruyter, 2020. https://doi.org/10.1515/mathm-2020-0106. ieee: R. Biswas, G. Largeteau-Skapin, R. Zrour, and E. Andres, “Digital objects in rhombic dodecahedron grid,” Mathematical Morphology - Theory and Applications, vol. 4, no. 1. De Gruyter, pp. 143–158, 2020. ista: Biswas R, Largeteau-Skapin G, Zrour R, Andres E. 2020. Digital objects in rhombic dodecahedron grid. Mathematical Morphology - Theory and Applications. 4(1), 143–158. mla: Biswas, Ranita, et al. “Digital Objects in Rhombic Dodecahedron Grid.” Mathematical Morphology - Theory and Applications, vol. 4, no. 1, De Gruyter, 2020, pp. 143–58, doi:10.1515/mathm-2020-0106. short: R. Biswas, G. Largeteau-Skapin, R. Zrour, E. Andres, Mathematical Morphology - Theory and Applications 4 (2020) 143–158. date_created: 2021-03-16T08:55:19Z date_published: 2020-11-17T00:00:00Z date_updated: 2021-03-22T09:01:50Z day: '17' ddc: - '510' department: - _id: HeEd doi: 10.1515/mathm-2020-0106 ec_funded: 1 file: - access_level: open_access checksum: 4a1043fa0548a725d464017fe2483ce0 content_type: application/pdf creator: dernst date_created: 2021-03-22T08:56:37Z date_updated: 2021-03-22T08:56:37Z file_id: '9272' file_name: 2020_MathMorpholTheoryAppl_Biswas.pdf file_size: 3668725 relation: main_file success: 1 file_date_updated: 2021-03-22T08:56:37Z has_accepted_license: '1' intvolume: ' 4' issue: '1' language: - iso: eng month: '11' oa: 1 oa_version: Published Version page: 143-158 project: - _id: 266A2E9E-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '788183' name: Alpha Shape Theory Extended - _id: 2561EBF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: I02979-N35 name: Persistence and stability of geometric complexes publication: Mathematical Morphology - Theory and Applications publication_identifier: issn: - 2353-3390 publication_status: published publisher: De Gruyter quality_controlled: '1' status: public title: Digital objects in rhombic dodecahedron grid tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 4 year: '2020' ... --- _id: '9299' abstract: - lang: eng text: We call a multigraph non-homotopic if it can be drawn in the plane in such a way that no two edges connecting the same pair of vertices can be continuously transformed into each other without passing through a vertex, and no loop can be shrunk to its end-vertex in the same way. It is easy to see that a non-homotopic multigraph on n>1 vertices can have arbitrarily many edges. We prove that the number of crossings between the edges of a non-homotopic multigraph with n vertices and m>4n edges is larger than cm2n for some constant c>0 , and that this bound is tight up to a polylogarithmic factor. We also show that the lower bound is not asymptotically sharp as n is fixed and m⟶∞ . acknowledgement: Supported by the National Research, Development and Innovation Office, NKFIH, KKP-133864, K-131529, K-116769, K-132696, by the Higher Educational Institutional Excellence Program 2019 NKFIH-1158-6/2019, the Austrian Science Fund (FWF), grant Z 342-N31, by the Ministry of Education and Science of the Russian Federation MegaGrant No. 075-15-2019-1926, and by the ERC Synergy Grant “Dynasnet” No. 810115. A full version can be found at https://arxiv.org/abs/2006.14908. article_processing_charge: No author: - first_name: János full_name: Pach, János id: E62E3130-B088-11EA-B919-BF823C25FEA4 last_name: Pach - first_name: Gábor full_name: Tardos, Gábor last_name: Tardos - first_name: Géza full_name: Tóth, Géza last_name: Tóth citation: ama: 'Pach J, Tardos G, Tóth G. Crossings between non-homotopic edges. In: 28th International Symposium on Graph Drawing and Network Visualization. Vol 12590. LNCS. Springer Nature; 2020:359-371. doi:10.1007/978-3-030-68766-3_28' apa: 'Pach, J., Tardos, G., & Tóth, G. (2020). Crossings between non-homotopic edges. In 28th International Symposium on Graph Drawing and Network Visualization (Vol. 12590, pp. 359–371). Virtual, Online: Springer Nature. https://doi.org/10.1007/978-3-030-68766-3_28' chicago: Pach, János, Gábor Tardos, and Géza Tóth. “Crossings between Non-Homotopic Edges.” In 28th International Symposium on Graph Drawing and Network Visualization, 12590:359–71. LNCS. Springer Nature, 2020. https://doi.org/10.1007/978-3-030-68766-3_28. ieee: J. Pach, G. Tardos, and G. Tóth, “Crossings between non-homotopic edges,” in 28th International Symposium on Graph Drawing and Network Visualization, Virtual, Online, 2020, vol. 12590, pp. 359–371. ista: 'Pach J, Tardos G, Tóth G. 2020. Crossings between non-homotopic edges. 28th International Symposium on Graph Drawing and Network Visualization. GD: Graph Drawing and Network VisualizationLNCS vol. 12590, 359–371.' mla: Pach, János, et al. “Crossings between Non-Homotopic Edges.” 28th International Symposium on Graph Drawing and Network Visualization, vol. 12590, Springer Nature, 2020, pp. 359–71, doi:10.1007/978-3-030-68766-3_28. short: J. Pach, G. Tardos, G. Tóth, in:, 28th International Symposium on Graph Drawing and Network Visualization, Springer Nature, 2020, pp. 359–371. conference: end_date: 2020-09-18 location: Virtual, Online name: 'GD: Graph Drawing and Network Visualization' start_date: 2020-09-16 date_created: 2021-03-28T22:01:44Z date_published: 2020-09-20T00:00:00Z date_updated: 2021-04-06T11:32:32Z day: '20' department: - _id: HeEd doi: 10.1007/978-3-030-68766-3_28 external_id: arxiv: - '2006.14908' intvolume: ' 12590' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/2006.14908 month: '09' oa: 1 oa_version: Preprint page: 359-371 project: - _id: 268116B8-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z00342 name: The Wittgenstein Prize publication: 28th International Symposium on Graph Drawing and Network Visualization publication_identifier: eissn: - 1611-3349 isbn: - '9783030687656' issn: - 0302-9743 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' series_title: LNCS status: public title: Crossings between non-homotopic edges type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 12590 year: '2020' ... --- _id: '9632' abstract: - lang: eng text: "Second-order information, in the form of Hessian- or Inverse-Hessian-vector products, is a fundamental tool for solving optimization problems. Recently, there has been significant interest in utilizing this information in the context of deep\r\nneural networks; however, relatively little is known about the quality of existing approximations in this context. Our work examines this question, identifies issues with existing approaches, and proposes a method called WoodFisher to compute a faithful and efficient estimate of the inverse Hessian. Our main application is to neural network compression, where we build on the classic Optimal Brain Damage/Surgeon framework. We demonstrate that WoodFisher significantly outperforms popular state-of-the-art methods for oneshot pruning. Further, even when iterative, gradual pruning is allowed, our method results in a gain in test accuracy over the state-of-the-art approaches, for standard image classification datasets such as ImageNet ILSVRC. We examine how our method can be extended to take into account first-order information, as well as\r\nillustrate its ability to automatically set layer-wise pruning thresholds and perform compression in the limited-data regime. The code is available at the following link, https://github.com/IST-DASLab/WoodFisher." acknowledgement: This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 805223 ScaleML). Also, we would like to thank Alexander Shevchenko, Alexandra Peste, and other members of the group for fruitful discussions. article_processing_charge: No author: - first_name: Sidak Pal full_name: Singh, Sidak Pal id: DD138E24-D89D-11E9-9DC0-DEF6E5697425 last_name: Singh - first_name: Dan-Adrian full_name: Alistarh, Dan-Adrian id: 4A899BFC-F248-11E8-B48F-1D18A9856A87 last_name: Alistarh orcid: 0000-0003-3650-940X citation: ama: 'Singh SP, Alistarh D-A. WoodFisher: Efficient second-order approximation for neural network compression. In: Advances in Neural Information Processing Systems. Vol 33. Curran Associates; 2020:18098-18109.' apa: 'Singh, S. P., & Alistarh, D.-A. (2020). WoodFisher: Efficient second-order approximation for neural network compression. In Advances in Neural Information Processing Systems (Vol. 33, pp. 18098–18109). Vancouver, Canada: Curran Associates.' chicago: 'Singh, Sidak Pal, and Dan-Adrian Alistarh. “WoodFisher: Efficient Second-Order Approximation for Neural Network Compression.” In Advances in Neural Information Processing Systems, 33:18098–109. Curran Associates, 2020.' ieee: 'S. P. Singh and D.-A. Alistarh, “WoodFisher: Efficient second-order approximation for neural network compression,” in Advances in Neural Information Processing Systems, Vancouver, Canada, 2020, vol. 33, pp. 18098–18109.' ista: 'Singh SP, Alistarh D-A. 2020. WoodFisher: Efficient second-order approximation for neural network compression. Advances in Neural Information Processing Systems. NeurIPS: Conference on Neural Information Processing Systems vol. 33, 18098–18109.' mla: 'Singh, Sidak Pal, and Dan-Adrian Alistarh. “WoodFisher: Efficient Second-Order Approximation for Neural Network Compression.” Advances in Neural Information Processing Systems, vol. 33, Curran Associates, 2020, pp. 18098–109.' short: S.P. Singh, D.-A. Alistarh, in:, Advances in Neural Information Processing Systems, Curran Associates, 2020, pp. 18098–18109. conference: end_date: 2020-12-12 location: Vancouver, Canada name: 'NeurIPS: Conference on Neural Information Processing Systems' start_date: 2020-12-06 date_created: 2021-07-04T22:01:26Z date_published: 2020-12-06T00:00:00Z date_updated: 2023-02-23T14:03:06Z day: '06' department: - _id: DaAl - _id: ToHe ec_funded: 1 external_id: arxiv: - '2004.14340' intvolume: ' 33' language: - iso: eng main_file_link: - open_access: '1' url: https://proceedings.neurips.cc/paper/2020/hash/d1ff1ec86b62cd5f3903ff19c3a326b2-Abstract.html month: '12' oa: 1 oa_version: Published Version page: 18098-18109 project: - _id: 268A44D6-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '805223' name: Elastic Coordination for Scalable Machine Learning publication: Advances in Neural Information Processing Systems publication_identifier: isbn: - '9781713829546' issn: - '10495258' publication_status: published publisher: Curran Associates quality_controlled: '1' scopus_import: '1' status: public title: 'WoodFisher: Efficient second-order approximation for neural network compression' type: conference user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf volume: 33 year: '2020' ... --- _id: '9630' abstract: - lang: eng text: Various kinds of data are routinely represented as discrete probability distributions. Examples include text documents summarized by histograms of word occurrences and images represented as histograms of oriented gradients. Viewing a discrete probability distribution as a point in the standard simplex of the appropriate dimension, we can understand collections of such objects in geometric and topological terms. Importantly, instead of using the standard Euclidean distance, we look into dissimilarity measures with information-theoretic justification, and we develop the theory needed for applying topological data analysis in this setting. In doing so, we emphasize constructions that enable the usage of existing computational topology software in this context. acknowledgement: This research is partially supported by the Office of Naval Research, through grant no. N62909-18-1-2038, and the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, through grant no. I02979-N35 of the Austrian Science Fund (FWF). article_processing_charge: Yes article_type: original author: - first_name: Herbert full_name: Edelsbrunner, Herbert id: 3FB178DA-F248-11E8-B48F-1D18A9856A87 last_name: Edelsbrunner orcid: 0000-0002-9823-6833 - first_name: Ziga full_name: Virk, Ziga id: 2E36B656-F248-11E8-B48F-1D18A9856A87 last_name: Virk - first_name: Hubert full_name: Wagner, Hubert id: 379CA8B8-F248-11E8-B48F-1D18A9856A87 last_name: Wagner citation: ama: Edelsbrunner H, Virk Z, Wagner H. Topological data analysis in information space. Journal of Computational Geometry. 2020;11(2):162-182. doi:10.20382/jocg.v11i2a7 apa: Edelsbrunner, H., Virk, Z., & Wagner, H. (2020). Topological data analysis in information space. Journal of Computational Geometry. Carleton University. https://doi.org/10.20382/jocg.v11i2a7 chicago: Edelsbrunner, Herbert, Ziga Virk, and Hubert Wagner. “Topological Data Analysis in Information Space.” Journal of Computational Geometry. Carleton University, 2020. https://doi.org/10.20382/jocg.v11i2a7. ieee: H. Edelsbrunner, Z. Virk, and H. Wagner, “Topological data analysis in information space,” Journal of Computational Geometry, vol. 11, no. 2. Carleton University, pp. 162–182, 2020. ista: Edelsbrunner H, Virk Z, Wagner H. 2020. Topological data analysis in information space. Journal of Computational Geometry. 11(2), 162–182. mla: Edelsbrunner, Herbert, et al. “Topological Data Analysis in Information Space.” Journal of Computational Geometry, vol. 11, no. 2, Carleton University, 2020, pp. 162–82, doi:10.20382/jocg.v11i2a7. short: H. Edelsbrunner, Z. Virk, H. Wagner, Journal of Computational Geometry 11 (2020) 162–182. date_created: 2021-07-04T22:01:26Z date_published: 2020-12-14T00:00:00Z date_updated: 2021-08-11T12:26:34Z day: '14' ddc: - '510' - '000' department: - _id: HeEd doi: 10.20382/jocg.v11i2a7 file: - access_level: open_access checksum: f02d0b2b3838e7891a6c417fc34ffdcd content_type: application/pdf creator: asandaue date_created: 2021-08-11T11:55:11Z date_updated: 2021-08-11T11:55:11Z file_id: '9882' file_name: 2020_JournalOfComputationalGeometry_Edelsbrunner.pdf file_size: 1449234 relation: main_file success: 1 file_date_updated: 2021-08-11T11:55:11Z has_accepted_license: '1' intvolume: ' 11' issue: '2' language: - iso: eng month: '12' oa: 1 oa_version: Published Version page: 162-182 project: - _id: 0aa4bc98-070f-11eb-9043-e6fff9c6a316 grant_number: I4887 name: Discretization in Geometry and Dynamics publication: Journal of Computational Geometry publication_identifier: eissn: - 1920180X publication_status: published publisher: Carleton University quality_controlled: '1' scopus_import: '1' status: public title: Topological data analysis in information space tmp: image: /images/cc_by.png 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) type: journal_article user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf volume: 11 year: '2020' ... --- _id: '9631' abstract: - lang: eng text: The ability to leverage large-scale hardware parallelism has been one of the key enablers of the accelerated recent progress in machine learning. Consequently, there has been considerable effort invested into developing efficient parallel variants of classic machine learning algorithms. However, despite the wealth of knowledge on parallelization, some classic machine learning algorithms often prove hard to parallelize efficiently while maintaining convergence. In this paper, we focus on efficient parallel algorithms for the key machine learning task of inference on graphical models, in particular on the fundamental belief propagation algorithm. We address the challenge of efficiently parallelizing this classic paradigm by showing how to leverage scalable relaxed schedulers in this context. We present an extensive empirical study, showing that our approach outperforms previous parallel belief propagation implementations both in terms of scalability and in terms of wall-clock convergence time, on a range of practical applications. acknowledgement: "We thank Marco Mondelli for discussions related to LDPC decoding, and Giorgi Nadiradze for discussions on analysis of relaxed schedulers. This project has received funding from the European Research Council (ERC) under the European\r\nUnion’s Horizon 2020 research and innovation programme (grant agreement No 805223 ScaleML)." article_processing_charge: No author: - first_name: Vitaly full_name: Aksenov, Vitaly last_name: Aksenov - first_name: Dan-Adrian full_name: Alistarh, Dan-Adrian id: 4A899BFC-F248-11E8-B48F-1D18A9856A87 last_name: Alistarh orcid: 0000-0003-3650-940X - first_name: Janne full_name: Korhonen, Janne id: C5402D42-15BC-11E9-A202-CA2BE6697425 last_name: Korhonen citation: ama: 'Aksenov V, Alistarh D-A, Korhonen J. Scalable belief propagation via relaxed scheduling. In: Advances in Neural Information Processing Systems. Vol 33. Curran Associates; 2020:22361-22372.' apa: 'Aksenov, V., Alistarh, D.-A., & Korhonen, J. (2020). Scalable belief propagation via relaxed scheduling. In Advances in Neural Information Processing Systems (Vol. 33, pp. 22361–22372). Vancouver, Canada: Curran Associates.' chicago: Aksenov, Vitaly, Dan-Adrian Alistarh, and Janne Korhonen. “Scalable Belief Propagation via Relaxed Scheduling.” In Advances in Neural Information Processing Systems, 33:22361–72. Curran Associates, 2020. ieee: V. Aksenov, D.-A. Alistarh, and J. Korhonen, “Scalable belief propagation via relaxed scheduling,” in Advances in Neural Information Processing Systems, Vancouver, Canada, 2020, vol. 33, pp. 22361–22372. ista: 'Aksenov V, Alistarh D-A, Korhonen J. 2020. Scalable belief propagation via relaxed scheduling. Advances in Neural Information Processing Systems. NeurIPS: Conference on Neural Information Processing Systems vol. 33, 22361–22372.' mla: Aksenov, Vitaly, et al. “Scalable Belief Propagation via Relaxed Scheduling.” Advances in Neural Information Processing Systems, vol. 33, Curran Associates, 2020, pp. 22361–72. short: V. Aksenov, D.-A. Alistarh, J. Korhonen, in:, Advances in Neural Information Processing Systems, Curran Associates, 2020, pp. 22361–22372. conference: end_date: 2020-12-12 location: Vancouver, Canada name: 'NeurIPS: Conference on Neural Information Processing Systems' start_date: 2020-12-06 date_created: 2021-07-04T22:01:26Z date_published: 2020-12-06T00:00:00Z date_updated: 2023-02-23T14:03:03Z day: '06' department: - _id: DaAl ec_funded: 1 external_id: arxiv: - '2002.11505' intvolume: ' 33' language: - iso: eng main_file_link: - open_access: '1' url: https://proceedings.neurips.cc/paper/2020/hash/fdb2c3bab9d0701c4a050a4d8d782c7f-Abstract.html month: '12' oa: 1 oa_version: Published Version page: 22361-22372 project: - _id: 268A44D6-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '805223' name: Elastic Coordination for Scalable Machine Learning publication: Advances in Neural Information Processing Systems publication_identifier: isbn: - '9781713829546' issn: - '10495258' publication_status: published publisher: Curran Associates quality_controlled: '1' scopus_import: '1' status: public title: Scalable belief propagation via relaxed scheduling type: conference user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf volume: 33 year: '2020' ... --- _id: '8533' abstract: - lang: eng text: Game of Life is a simple and elegant model to study dynamical system over networks. The model consists of a graph where every vertex has one of two types, namely, dead or alive. A configuration is a mapping of the vertices to the types. An update rule describes how the type of a vertex is updated given the types of its neighbors. In every round, all vertices are updated synchronously, which leads to a configuration update. While in general, Game of Life allows a broad range of update rules, we focus on two simple families of update rules, namely, underpopulation and overpopulation, that model several interesting dynamics studied in the literature. In both settings, a dead vertex requires at least a desired number of live neighbors to become alive. For underpopulation (resp., overpopulation), a live vertex requires at least (resp. at most) a desired number of live neighbors to remain alive. We study the basic computation problems, e.g., configuration reachability, for these two families of rules. For underpopulation rules, we show that these problems can be solved in polynomial time, whereas for overpopulation rules they are PSPACE-complete. acknowledgement: "Krishnendu Chatterjee: The research was partially supported by the Vienna Science and\r\nTechnology Fund (WWTF) Project ICT15-003.\r\nIsmaël Jecker: This project has received funding from the European Union’s Horizon 2020 research\r\nand innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 754411." alternative_title: - LIPIcs article_number: 22:1-22:13 article_processing_charge: No author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Rasmus full_name: Ibsen-Jensen, Rasmus id: 3B699956-F248-11E8-B48F-1D18A9856A87 last_name: Ibsen-Jensen orcid: 0000-0003-4783-0389 - first_name: Ismael R full_name: Jecker, Ismael R id: 85D7C63E-7D5D-11E9-9C0F-98C4E5697425 last_name: Jecker - first_name: Jakub full_name: Svoboda, Jakub id: 130759D2-D7DD-11E9-87D2-DE0DE6697425 last_name: Svoboda citation: ama: 'Chatterjee K, Ibsen-Jensen R, Jecker IR, Svoboda J. Simplified game of life: Algorithms and complexity. In: 45th International Symposium on Mathematical Foundations of Computer Science. Vol 170. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.MFCS.2020.22' apa: 'Chatterjee, K., Ibsen-Jensen, R., Jecker, I. R., & Svoboda, J. (2020). Simplified game of life: Algorithms and complexity. In 45th International Symposium on Mathematical Foundations of Computer Science (Vol. 170). Prague, Czech Republic: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2020.22' chicago: 'Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Ismael R Jecker, and Jakub Svoboda. “Simplified Game of Life: Algorithms and Complexity.” In 45th International Symposium on Mathematical Foundations of Computer Science, Vol. 170. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.MFCS.2020.22.' ieee: 'K. Chatterjee, R. Ibsen-Jensen, I. R. Jecker, and J. Svoboda, “Simplified game of life: Algorithms and complexity,” in 45th International Symposium on Mathematical Foundations of Computer Science, Prague, Czech Republic, 2020, vol. 170.' ista: 'Chatterjee K, Ibsen-Jensen R, Jecker IR, Svoboda J. 2020. Simplified game of life: Algorithms and complexity. 45th International Symposium on Mathematical Foundations of Computer Science. MFCS: Symposium on Mathematical Foundations of Computer Science, LIPIcs, vol. 170, 22:1-22:13.' mla: 'Chatterjee, Krishnendu, et al. “Simplified Game of Life: Algorithms and Complexity.” 45th International Symposium on Mathematical Foundations of Computer Science, vol. 170, 22:1-22:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.MFCS.2020.22.' short: K. Chatterjee, R. Ibsen-Jensen, I.R. Jecker, J. Svoboda, in:, 45th International Symposium on Mathematical Foundations of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. conference: end_date: 2020-08-28 location: Prague, Czech Republic name: 'MFCS: Symposium on Mathematical Foundations of Computer Science' start_date: 2020-08-24 date_created: 2020-09-20T22:01:36Z date_published: 2020-08-18T00:00:00Z date_updated: 2021-01-12T08:19:55Z day: '18' ddc: - '000' department: - _id: KrCh doi: 10.4230/LIPIcs.MFCS.2020.22 ec_funded: 1 external_id: arxiv: - '2007.02894' file: - access_level: open_access checksum: bbd7c4f55d45f2ff2a0a4ef0e10a77b1 content_type: application/pdf creator: dernst date_created: 2020-09-21T13:57:34Z date_updated: 2020-09-21T13:57:34Z file_id: '8550' file_name: 2020_LIPIcs_Chatterjee.pdf file_size: 491374 relation: main_file success: 1 file_date_updated: 2020-09-21T13:57:34Z has_accepted_license: '1' intvolume: ' 170' language: - iso: eng month: '08' oa: 1 oa_version: Published Version project: - _id: 25892FC0-B435-11E9-9278-68D0E5697425 grant_number: ICT15-003 name: Efficient Algorithms for Computer Aided Verification - _id: 260C2330-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '754411' name: ISTplus - Postdoctoral Fellowships publication: 45th International Symposium on Mathematical Foundations of Computer Science publication_identifier: isbn: - '9783959771597' issn: - '18688969' publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: '1' status: public title: 'Simplified game of life: Algorithms and complexity' tmp: image: /images/cc_by.png 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) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 170 year: '2020' ... --- _id: '8534' abstract: - lang: eng text: A regular language L of finite words is composite if there are regular languages L₁,L₂,…,L_t such that L = ⋂_{i = 1}^t L_i and the index (number of states in a minimal DFA) of every language L_i is strictly smaller than the index of L. Otherwise, L is prime. Primality of regular languages was introduced and studied in [O. Kupferman and J. Mosheiff, 2015], where the complexity of deciding the primality of the language of a given DFA was left open, with a doubly-exponential gap between the upper and lower bounds. We study primality for unary regular languages, namely regular languages with a singleton alphabet. A unary language corresponds to a subset of ℕ, making the study of unary prime languages closer to that of primality in number theory. We show that the setting of languages is richer. In particular, while every composite number is the product of two smaller numbers, the number t of languages necessary to decompose a composite unary language induces a strict hierarchy. In addition, a primality witness for a unary language L, namely a word that is not in L but is in all products of languages that contain L and have an index smaller than L’s, may be of exponential length. Still, we are able to characterize compositionality by structural properties of a DFA for L, leading to a LogSpace algorithm for primality checking of unary DFAs. acknowledgement: "Ismaël Jecker: This project has received funding from the European Union’s Horizon\r\n2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No.\r\n754411. Nicolas Mazzocchi: PhD fellowship FRIA from the F.R.S.-FNRS." alternative_title: - LIPIcs article_number: 51:1-51:12 article_processing_charge: No author: - first_name: Ismael R full_name: Jecker, Ismael R id: 85D7C63E-7D5D-11E9-9C0F-98C4E5697425 last_name: Jecker - first_name: Orna full_name: Kupferman, Orna last_name: Kupferman - first_name: Nicolas full_name: Mazzocchi, Nicolas last_name: Mazzocchi citation: ama: 'Jecker IR, Kupferman O, Mazzocchi N. Unary prime languages. In: 45th International Symposium on Mathematical Foundations of Computer Science. Vol 170. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.MFCS.2020.51' apa: 'Jecker, I. R., Kupferman, O., & Mazzocchi, N. (2020). Unary prime languages. In 45th International Symposium on Mathematical Foundations of Computer Science (Vol. 170). Prague, Czech Republic: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2020.51' chicago: Jecker, Ismael R, Orna Kupferman, and Nicolas Mazzocchi. “Unary Prime Languages.” In 45th International Symposium on Mathematical Foundations of Computer Science, Vol. 170. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.MFCS.2020.51. ieee: I. R. Jecker, O. Kupferman, and N. Mazzocchi, “Unary prime languages,” in 45th International Symposium on Mathematical Foundations of Computer Science, Prague, Czech Republic, 2020, vol. 170. ista: 'Jecker IR, Kupferman O, Mazzocchi N. 2020. Unary prime languages. 45th International Symposium on Mathematical Foundations of Computer Science. MFCS: Symposium on Mathematical Foundations of Computer Science, LIPIcs, vol. 170, 51:1-51:12.' mla: Jecker, Ismael R., et al. “Unary Prime Languages.” 45th International Symposium on Mathematical Foundations of Computer Science, vol. 170, 51:1-51:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.MFCS.2020.51. short: I.R. Jecker, O. Kupferman, N. Mazzocchi, in:, 45th International Symposium on Mathematical Foundations of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. conference: end_date: 2020-08-28 location: Prague, Czech Republic name: 'MFCS: Symposium on Mathematical Foundations of Computer Science' start_date: 2020-08-24 date_created: 2020-09-20T22:01:36Z date_published: 2020-08-18T00:00:00Z date_updated: 2021-01-12T08:19:56Z day: '18' ddc: - '000' department: - _id: KrCh doi: 10.4230/LIPIcs.MFCS.2020.51 ec_funded: 1 file: - access_level: open_access checksum: 2dc9e2fad6becd4563aef3e27a473f70 content_type: application/pdf creator: dernst date_created: 2020-09-21T14:17:08Z date_updated: 2020-09-21T14:17:08Z file_id: '8552' file_name: 2020_LIPIcsMFCS_Jecker.pdf file_size: 597977 relation: main_file success: 1 file_date_updated: 2020-09-21T14:17:08Z has_accepted_license: '1' intvolume: ' 170' language: - iso: eng month: '08' oa: 1 oa_version: Published Version project: - _id: 260C2330-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '754411' name: ISTplus - Postdoctoral Fellowships publication: 45th International Symposium on Mathematical Foundations of Computer Science publication_identifier: isbn: - '9783959771597' issn: - '18688969' publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: '1' status: public title: Unary prime languages tmp: image: /images/cc_by.png 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) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 170 year: '2020' ... --- _id: '8538' abstract: - lang: eng text: We prove some recent experimental observations of Dan Reznik concerning periodic billiard orbits in ellipses. For example, the sum of cosines of the angles of a periodic billiard polygon remains constant in the 1-parameter family of such polygons (that exist due to the Poncelet porism). In our proofs, we use geometric and complex analytic methods. acknowledgement: " This paper would not be written if not for Dan Reznik’s curiosity and persistence; we are very grateful to him. We also thank R. Garcia and J. Koiller for interesting discussions. It is a pleasure to thank the Mathematical Institute of the University of Heidelberg for its stimulating atmosphere. ST thanks M. Bialy for interesting discussions and the Tel Aviv\r\nUniversity for its invariable hospitality. AA was supported by European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 78818 Alpha). RS is supported by NSF Grant DMS-1807320. ST was supported by NSF grant DMS-1510055 and SFB/TRR 191." article_processing_charge: No article_type: original author: - first_name: Arseniy full_name: Akopyan, Arseniy id: 430D2C90-F248-11E8-B48F-1D18A9856A87 last_name: Akopyan orcid: 0000-0002-2548-617X - first_name: Richard full_name: Schwartz, Richard last_name: Schwartz - first_name: Serge full_name: Tabachnikov, Serge last_name: Tabachnikov citation: ama: Akopyan A, Schwartz R, Tabachnikov S. Billiards in ellipses revisited. European Journal of Mathematics. 2020. doi:10.1007/s40879-020-00426-9 apa: Akopyan, A., Schwartz, R., & Tabachnikov, S. (2020). Billiards in ellipses revisited. European Journal of Mathematics. Springer Nature. https://doi.org/10.1007/s40879-020-00426-9 chicago: Akopyan, Arseniy, Richard Schwartz, and Serge Tabachnikov. “Billiards in Ellipses Revisited.” European Journal of Mathematics. Springer Nature, 2020. https://doi.org/10.1007/s40879-020-00426-9. ieee: A. Akopyan, R. Schwartz, and S. Tabachnikov, “Billiards in ellipses revisited,” European Journal of Mathematics. Springer Nature, 2020. ista: Akopyan A, Schwartz R, Tabachnikov S. 2020. Billiards in ellipses revisited. European Journal of Mathematics. mla: Akopyan, Arseniy, et al. “Billiards in Ellipses Revisited.” European Journal of Mathematics, Springer Nature, 2020, doi:10.1007/s40879-020-00426-9. short: A. Akopyan, R. Schwartz, S. Tabachnikov, European Journal of Mathematics (2020). date_created: 2020-09-20T22:01:38Z date_published: 2020-09-09T00:00:00Z date_updated: 2021-12-02T15:10:17Z day: '09' department: - _id: HeEd doi: 10.1007/s40879-020-00426-9 ec_funded: 1 external_id: arxiv: - '2001.02934' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/2001.02934 month: '09' oa: 1 oa_version: Preprint project: - _id: 266A2E9E-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '788183' name: Alpha Shape Theory Extended publication: European Journal of Mathematics publication_identifier: eissn: - 2199-6768 issn: - 2199-675X publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: Billiards in ellipses revisited type: journal_article user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2020' ... --- _id: '8616' abstract: - lang: eng text: The brain vasculature supplies neurons with glucose and oxygen, but little is known about how vascular plasticity contributes to brain function. Using longitudinal in vivo imaging, we reported that a substantial proportion of blood vessels in the adult brain sporadically occluded and regressed. Their regression proceeded through sequential stages of blood-flow occlusion, endothelial cell collapse, relocation or loss of pericytes, and retraction of glial endfeet. Regressing vessels were found to be widespread in mouse, monkey and human brains. Both brief occlusions of the middle cerebral artery and lipopolysaccharide-mediated inflammation induced an increase of vessel regression. Blockage of leukocyte adhesion to endothelial cells alleviated LPS-induced vessel regression. We further revealed that blood vessel regression caused a reduction of neuronal activity due to a dysfunction in mitochondrial metabolism and glutamate production. Our results elucidate the mechanism of vessel regression and its role in neuronal function in the adult brain. acknowledgement: 'The project was initiated in the Jan lab at UCSF. We thank Lily Jan and Yuh-Nung Jan’s generous support. We thank Liqun Luo’s lab for providing MADM-7 mice and Rolf A Brekken for VEGF-antibodies. Drs. Yuanquan Song (UPenn), Zhaozhu Hu (JHU), Ji Hu (ShanghaiTech), Yang Xiang (U. Mass), Hao Wang (Zhejiang U.) and Ruikang Wang (U. Washington) for critical input, colleagues at Children’s Research Institute, Departments of Neuroscience, Neurology and Neurotherapeutics, Pediatrics from UT Southwestern, and colleagues from the Jan lab for discussion. Dr. Bridget Samuels, Sean Morrison (UT Southwestern), and Nannan Lu (Zhejiang U.) for critical reading. We acknowledge the assistance of the CIBR Imaging core. We also thank UT Southwestern Live Cell Imaging Facility, a Shared Resource of the Harold C. Simmons Cancer Center, supported in part by an NCI Cancer Center Support Grant, P30 CA142543K. This work is supported by CIBR funds and the American Heart Association AWRP Summer 2016 Innovative Research Grant (17IRG33410377) to W-P.G.; National Natural Science Foundation of China (No.81370031) to Z.Z.;National Key Research and Development Program of China (2016YFE0125400)to F.H.;National Natural Science Foundations of China (No. 81473202) to Y.L.; National Natural Science Foundation of China (No.31600839) and Shenzhen Science and Technology Research Program (JCYJ20170818163320865) to B.P.; National Natural Science Foundation of China (No. 31800864) and Westlake University start-up funds to J-M. J. NIH R01NS088627 to W.L.J.; NIH: R01 AG020670 and RF1AG054111 to H.Z.; R01 NS088555 to A.M.S., and European Research Council No.725780 to S.H.;W-P.G. was a recipient of Bugher-American Heart Association Dan Adams Thinking Outside the Box Award.' article_processing_charge: No author: - first_name: Xiaofei full_name: Gao, Xiaofei last_name: Gao - first_name: Jun-Liszt full_name: Li, Jun-Liszt last_name: Li - first_name: Xingjun full_name: Chen, Xingjun last_name: Chen - first_name: Bo full_name: Ci, Bo last_name: Ci - first_name: Fei full_name: Chen, Fei last_name: Chen - first_name: Nannan full_name: Lu, Nannan last_name: Lu - first_name: Bo full_name: Shen, Bo last_name: Shen - first_name: Lijun full_name: Zheng, Lijun last_name: Zheng - first_name: Jie-Min full_name: Jia, Jie-Min last_name: Jia - first_name: Yating full_name: Yi, Yating last_name: Yi - first_name: Shiwen full_name: Zhang, Shiwen last_name: Zhang - first_name: Ying-Chao full_name: Shi, Ying-Chao last_name: Shi - first_name: Kaibin full_name: Shi, Kaibin last_name: Shi - first_name: Nicholas E full_name: Propson, Nicholas E last_name: Propson - first_name: Yubin full_name: Huang, Yubin last_name: Huang - first_name: Katherine full_name: Poinsatte, Katherine last_name: Poinsatte - first_name: Zhaohuan full_name: Zhang, Zhaohuan last_name: Zhang - first_name: Yuanlei full_name: Yue, Yuanlei last_name: Yue - first_name: Dale B full_name: Bosco, Dale B last_name: Bosco - first_name: Ying-mei full_name: Lu, Ying-mei last_name: Lu - first_name: Shi-bing full_name: Yang, Shi-bing last_name: Yang - first_name: Ralf H. full_name: Adams, Ralf H. last_name: Adams - first_name: Volkhard full_name: Lindner, Volkhard last_name: Lindner - first_name: Fen full_name: Huang, Fen last_name: Huang - first_name: Long-Jun full_name: Wu, Long-Jun last_name: Wu - first_name: Hui full_name: Zheng, Hui last_name: Zheng - first_name: Feng full_name: Han, Feng last_name: Han - first_name: Simon full_name: Hippenmeyer, Simon id: 37B36620-F248-11E8-B48F-1D18A9856A87 last_name: Hippenmeyer orcid: 0000-0003-2279-1061 - first_name: Ann M. full_name: Stowe, Ann M. last_name: Stowe - first_name: Bo full_name: Peng, Bo last_name: Peng - first_name: Marta full_name: Margeta, Marta last_name: Margeta - first_name: Xiaoqun full_name: Wang, Xiaoqun last_name: Wang - first_name: Qiang full_name: Liu, Qiang last_name: Liu - first_name: Jakob full_name: Körbelin, Jakob last_name: Körbelin - first_name: Martin full_name: Trepel, Martin last_name: Trepel - first_name: Hui full_name: Lu, Hui last_name: Lu - first_name: Bo O. full_name: Zhou, Bo O. last_name: Zhou - first_name: Hu full_name: Zhao, Hu last_name: Zhao - first_name: Wenzhi full_name: Su, Wenzhi last_name: Su - first_name: Robert M. full_name: Bachoo, Robert M. last_name: Bachoo - first_name: Woo-ping full_name: Ge, Woo-ping last_name: Ge citation: ama: Gao X, Li J-L, Chen X, et al. Reduction of neuronal activity mediated by blood-vessel regression in the brain. bioRxiv. doi:10.1101/2020.09.15.262782 apa: Gao, X., Li, J.-L., Chen, X., Ci, B., Chen, F., Lu, N., … Ge, W. (n.d.). Reduction of neuronal activity mediated by blood-vessel regression in the brain. bioRxiv. Cold Spring Harbor Laboratory. https://doi.org/10.1101/2020.09.15.262782 chicago: Gao, Xiaofei, Jun-Liszt Li, Xingjun Chen, Bo Ci, Fei Chen, Nannan Lu, Bo Shen, et al. “Reduction of Neuronal Activity Mediated by Blood-Vessel Regression in the Brain.” BioRxiv. Cold Spring Harbor Laboratory, n.d. https://doi.org/10.1101/2020.09.15.262782. ieee: X. Gao et al., “Reduction of neuronal activity mediated by blood-vessel regression in the brain,” bioRxiv. Cold Spring Harbor Laboratory. ista: Gao X, Li J-L, Chen X, Ci B, Chen F, Lu N, Shen B, Zheng L, Jia J-M, Yi Y, Zhang S, Shi Y-C, Shi K, Propson NE, Huang Y, Poinsatte K, Zhang Z, Yue Y, Bosco DB, Lu Y, Yang S, Adams RH, Lindner V, Huang F, Wu L-J, Zheng H, Han F, Hippenmeyer S, Stowe AM, Peng B, Margeta M, Wang X, Liu Q, Körbelin J, Trepel M, Lu H, Zhou BO, Zhao H, Su W, Bachoo RM, Ge W. Reduction of neuronal activity mediated by blood-vessel regression in the brain. bioRxiv, 10.1101/2020.09.15.262782. mla: Gao, Xiaofei, et al. “Reduction of Neuronal Activity Mediated by Blood-Vessel Regression in the Brain.” BioRxiv, Cold Spring Harbor Laboratory, doi:10.1101/2020.09.15.262782. short: X. Gao, J.-L. Li, X. Chen, B. Ci, F. Chen, N. Lu, B. Shen, L. Zheng, J.-M. Jia, Y. Yi, S. Zhang, Y.-C. Shi, K. Shi, N.E. Propson, Y. Huang, K. Poinsatte, Z. Zhang, Y. Yue, D.B. Bosco, Y. Lu, S. Yang, R.H. Adams, V. Lindner, F. Huang, L.-J. Wu, H. Zheng, F. Han, S. Hippenmeyer, A.M. Stowe, B. Peng, M. Margeta, X. Wang, Q. Liu, J. Körbelin, M. Trepel, H. Lu, B.O. Zhou, H. Zhao, W. Su, R.M. Bachoo, W. Ge, BioRxiv (n.d.). date_created: 2020-10-06T08:58:59Z date_published: 2020-09-15T00:00:00Z date_updated: 2021-01-12T08:20:19Z day: '15' department: - _id: SiHi doi: 10.1101/2020.09.15.262782 ec_funded: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1101/2020.09.15.262782 month: '09' oa: 1 oa_version: Preprint project: - _id: 260018B0-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '725780' name: Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development publication: bioRxiv publication_status: submitted publisher: Cold Spring Harbor Laboratory status: public title: Reduction of neuronal activity mediated by blood-vessel regression in the brain type: preprint user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2020' ... --- _id: '8695' abstract: - lang: eng text: A look at international activities on Open Science reveals a broad spectrum from individual institutional policies to national action plans. The present Recommendations for a National Open Science Strategy in Austria are based on these international initiatives and present practical considerations for their coordinated implementation with regard to strategic developments in research, technology and innovation (RTI) in Austria until 2030. They are addressed to all relevant actors in the RTI system, in particular to Research Performing Organisations, Research Funding Organisations, Research Policy, memory institutions such as Libraries and Researchers. The recommendation paper was developed from 2018 to 2020 by the OANA working group "Open Science Strategy" and published for the first time in spring 2020 for a public consultation. The now available final version of the recommendation document, which contains feedback and comments from the consultation, is intended to provide an impetus for further discussion and implementation of Open Science in Austria and serves as a contribution and basis for a potential national Open Science Strategy in Austria. The document builds on the diverse expertise of the authors (academia, administration, library and archive, information technology, science policy, funding system, etc.) and reflects their personal experiences and opinions. - lang: ger text: Der Blick auf internationale Aktivitäten zu Open Science zeigt ein breites Spektrum von einzelnen institutionellen Policies bis hin zu nationalen Aktionsplänen. Die vorliegenden Empfehlungen für eine nationale Open Science Strategie in Österreich orientieren sich an diesen internationalen Initiativen und stellen praktische Überlegungen für ihre koordinierte Implementierung im Hinblick auf strategische Entwicklungen in Forschung, Technologie und Innovation (FTI) bis 2030 in Österreich dar. Dabei richten sie sich an alle relevanten Akteur*innen im FTI System, im Besonderen an Forschungsstätten, Forschungsförderer, Forschungspolitik, Gedächtnisinstitutionen wie Bibliotheken und Wissenschafter*innen. Das Empfehlungspapier wurde von 2018 bis 2020 von der OANA-Arbeitsgruppe "Open Science Strategie" entwickelt und im Frühling 2020 das erste Mal für eine öffentliche Konsultation veröffentlicht. Die nun vorliegende finale Version des Empfehlungsdokuments, die Feedback und Kommentare aus der Konsultation enthält, soll ein Anstoß für die weitere Diskussion und Umsetzung von Open Science in Österreich sein und als Beitrag und Grundlage einer potentiellen nationalen Open Science Strategie in Österreich dienen. Das Dokument baut auf der vielfältigen Expertise der Autor*innen auf (Wissenschaft, Administration, Bibliothek und Archiv, Informationstechnologie, Wissenschaftspolitik, Förderwesen etc.) und spiegelt deren persönliche Erfahrungen und Meinung wider. article_processing_charge: No author: - first_name: Katja full_name: Mayer, Katja last_name: Mayer - first_name: Katharina full_name: Rieck, Katharina last_name: Rieck - first_name: Stefan full_name: Reichmann, Stefan last_name: Reichmann - first_name: Patrick full_name: Danowski, Patrick id: 2EBD1598-F248-11E8-B48F-1D18A9856A87 last_name: Danowski orcid: 0000-0002-6026-4409 - first_name: Anton full_name: Graschopf, Anton last_name: Graschopf - first_name: Thomas full_name: König, Thomas last_name: König - first_name: Peter full_name: Kraker, Peter last_name: Kraker - first_name: Patrick full_name: Lehner, Patrick last_name: Lehner - first_name: Falk full_name: Reckling, Falk last_name: Reckling - first_name: Tony full_name: Ross-Hellauer, Tony last_name: Ross-Hellauer - first_name: Daniel full_name: Spichtinger, Daniel last_name: Spichtinger - first_name: Michalis full_name: Tzatzanis, Michalis last_name: Tzatzanis - first_name: Stefanie full_name: Schürz, Stefanie last_name: Schürz citation: ama: Mayer K, Rieck K, Reichmann S, et al. Empfehlungen für eine nationale Open Science Strategie in Österreich / Recommendations for a National Open Science Strategy in Austria. OANA; 2020. doi:10.5281/ZENODO.4109242 apa: Mayer, K., Rieck, K., Reichmann, S., Danowski, P., Graschopf, A., König, T., … Schürz, S. (2020). Empfehlungen für eine nationale Open Science Strategie in Österreich / Recommendations for a National Open Science Strategy in Austria. OANA. https://doi.org/10.5281/ZENODO.4109242 chicago: Mayer, Katja, Katharina Rieck, Stefan Reichmann, Patrick Danowski, Anton Graschopf, Thomas König, Peter Kraker, et al. Empfehlungen für eine nationale Open Science Strategie in Österreich / Recommendations for a National Open Science Strategy in Austria. OANA, 2020. https://doi.org/10.5281/ZENODO.4109242. ieee: K. Mayer et al., Empfehlungen für eine nationale Open Science Strategie in Österreich / Recommendations for a National Open Science Strategy in Austria. OANA, 2020. ista: Mayer K, Rieck K, Reichmann S, Danowski P, Graschopf A, König T, Kraker P, Lehner P, Reckling F, Ross-Hellauer T, Spichtinger D, Tzatzanis M, Schürz S. 2020. Empfehlungen für eine nationale Open Science Strategie in Österreich / Recommendations for a National Open Science Strategy in Austria, OANA, 36p. mla: Mayer, Katja, et al. Empfehlungen für eine nationale Open Science Strategie in Österreich / Recommendations for a National Open Science Strategy in Austria. OANA, 2020, doi:10.5281/ZENODO.4109242. short: K. Mayer, K. Rieck, S. Reichmann, P. Danowski, A. Graschopf, T. König, P. Kraker, P. Lehner, F. Reckling, T. Ross-Hellauer, D. Spichtinger, M. Tzatzanis, S. Schürz, Empfehlungen für eine nationale Open Science Strategie in Österreich / Recommendations for a National Open Science Strategy in Austria, OANA, 2020. date_created: 2020-10-23T09:08:28Z date_published: 2020-10-21T00:00:00Z date_updated: 2020-10-23T09:34:40Z day: '21' ddc: - '020' department: - _id: E-Lib doi: 10.5281/ZENODO.4109242 file: - access_level: open_access checksum: 8eba912bb4b20b4f82f8010f2110461a content_type: application/pdf creator: dernst date_created: 2020-10-23T09:29:45Z date_updated: 2020-10-23T09:29:45Z file_id: '8696' file_name: 2020_OANA_Mayer.pdf file_size: 2298363 relation: main_file success: 1 file_date_updated: 2020-10-23T09:29:45Z has_accepted_license: '1' language: - iso: ger month: '10' oa: 1 oa_version: Published Version page: '36' publication_status: published publisher: OANA status: public title: Empfehlungen für eine nationale Open Science Strategie in Österreich / Recommendations for a National Open Science Strategy in Austria tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: working_paper user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2020' ... --- _id: '8706' abstract: - lang: eng text: As part of the Austrian Transition to Open Access (AT2OA) project, subproject TP1-B is working on designing a monitoring solution for the output of Open Access publications in Austria. This report on a potential Open Access monitoring approach in Austria is one of the results of these efforts and can serve as a basis for discussion on an international level. - lang: ger text: Als Teil des Hochschulraumstrukturmittel-Projekts Austrian Transition to Open Access (AT2OA) befasst sich das Teilprojekt TP1-B mit der Konzeption einer Monitoring-Lösung für den Open Access-Publikationsoutput in Österreich. Der nun vorliegende Bericht zu einem potentiellen Open Access-Monitoring in Österreich ist eines der Ergebnisse dieser Bemühungen und kann als Grundlage einer Diskussion auf internationaler Ebene dienen. article_processing_charge: No article_type: original author: - first_name: Patrick full_name: Danowski, Patrick id: 2EBD1598-F248-11E8-B48F-1D18A9856A87 last_name: Danowski orcid: 0000-0002-6026-4409 - first_name: Andreas full_name: Ferus, Andreas last_name: Ferus - first_name: Anna-Laetitia full_name: Hikl, Anna-Laetitia last_name: Hikl - first_name: Gerda full_name: McNeill, Gerda last_name: McNeill - first_name: Clemens full_name: Miniberger, Clemens last_name: Miniberger - first_name: Steve full_name: Reding, Steve last_name: Reding - first_name: Tobias full_name: Zarka, Tobias last_name: Zarka - first_name: Michael full_name: Zojer, Michael last_name: Zojer citation: ama: Danowski P, Ferus A, Hikl A-L, et al. „Recommendation“ for the further procedure for open access monitoring. Deliverable of the AT2OA subproject TP1-B. Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare. 2020;73(2):278-284. doi:10.31263/voebm.v73i2.3941 apa: Danowski, P., Ferus, A., Hikl, A.-L., McNeill, G., Miniberger, C., Reding, S., … Zojer, M. (2020). „Recommendation“ for the further procedure for open access monitoring. Deliverable of the AT2OA subproject TP1-B. Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare. Vereinigung Osterreichischer Bibliothekarinnen und Bibliothekare. https://doi.org/10.31263/voebm.v73i2.3941 chicago: Danowski, Patrick, Andreas Ferus, Anna-Laetitia Hikl, Gerda McNeill, Clemens Miniberger, Steve Reding, Tobias Zarka, and Michael Zojer. “„Recommendation“ for the further procedure for open access monitoring. Deliverable of the AT2OA subproject TP1-B.” Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare. Vereinigung Osterreichischer Bibliothekarinnen und Bibliothekare, 2020. https://doi.org/10.31263/voebm.v73i2.3941. ieee: P. Danowski et al., “„Recommendation“ for the further procedure for open access monitoring. Deliverable of the AT2OA subproject TP1-B,” Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, vol. 73, no. 2. Vereinigung Osterreichischer Bibliothekarinnen und Bibliothekare, pp. 278–284, 2020. ista: Danowski P, Ferus A, Hikl A-L, McNeill G, Miniberger C, Reding S, Zarka T, Zojer M. 2020. „Recommendation“ for the further procedure for open access monitoring. Deliverable of the AT2OA subproject TP1-B. Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare. 73(2), 278–284. mla: Danowski, Patrick, et al. “„Recommendation“ for the further procedure for open access monitoring. Deliverable of the AT2OA subproject TP1-B.” Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, vol. 73, no. 2, Vereinigung Osterreichischer Bibliothekarinnen und Bibliothekare, 2020, pp. 278–84, doi:10.31263/voebm.v73i2.3941. short: P. Danowski, A. Ferus, A.-L. Hikl, G. McNeill, C. Miniberger, S. Reding, T. Zarka, M. Zojer, Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare 73 (2020) 278–284. date_created: 2020-10-25T23:01:19Z date_published: 2020-07-14T00:00:00Z date_updated: 2021-01-12T08:20:40Z day: '14' ddc: - '020' department: - _id: E-Lib doi: 10.31263/voebm.v73i2.3941 file: - access_level: open_access checksum: 37443c34d91d5bdbeb38c78b14792537 content_type: application/pdf creator: kschuh date_created: 2020-10-27T16:27:25Z date_updated: 2020-10-27T16:27:25Z file_id: '8714' file_name: 2020_VOEB_Danowski.pdf file_size: 960317 relation: main_file success: 1 file_date_updated: 2020-10-27T16:27:25Z has_accepted_license: '1' intvolume: ' 73' issue: '2' language: - iso: ger month: '07' oa: 1 oa_version: Published Version page: 278-284 publication: Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare publication_identifier: eissn: - '10222588' publication_status: published publisher: Vereinigung Osterreichischer Bibliothekarinnen und Bibliothekare quality_controlled: '1' scopus_import: '1' status: public title: „Recommendation“ for the further procedure for open access monitoring. Deliverable of the AT2OA subproject TP1-B tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 73 year: '2020' ... --- _id: '8978' abstract: - lang: eng text: "Mosaic analysis with double markers (MADM) technology enables concomitant fluorescent cell labeling and induction of uniparental chromosome disomy (UPD) with single-cell resolution. In UPD, imprinted genes are either overexpressed 2-fold or are not expressed. Here, the MADM platform is utilized to probe imprinting phenotypes at the transcriptional level. This protocol highlights major steps for the generation and isolation of projection neurons and astrocytes with MADM-induced UPD from mouse cerebral cortex for downstream single-cell and low-input sample RNA-sequencing experiments.\r\n\r\nFor complete details on the use and execution of this protocol, please refer to Laukoter et al. (2020b)." acknowledged_ssus: - _id: Bio - _id: PreCl acknowledgement: This research was supported by the Scientific Service Units (SSU) at IST Austria through resources provided by the Bioimaging (BIF) and Preclinical Facilities (PCF). N.A received support from the FWF Firnberg-Programm (T 1031). This work was also supported by IST Austria institutional funds; FWF SFB F78 to S.H.; NÖ Forschung und Bildung n[f+b] life science call grant (C13-002) to S.H.; the People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007-2013) under REA grant agreement no. 618444 to S.H.; and the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement no. 725780 LinPro) to S.H. article_number: '100215' article_processing_charge: No article_type: original author: - first_name: Susanne full_name: Laukoter, Susanne id: 2D6B7A9A-F248-11E8-B48F-1D18A9856A87 last_name: Laukoter - first_name: Nicole full_name: Amberg, Nicole id: 4CD6AAC6-F248-11E8-B48F-1D18A9856A87 last_name: Amberg orcid: 0000-0002-3183-8207 - first_name: Florian full_name: Pauler, Florian id: 48EA0138-F248-11E8-B48F-1D18A9856A87 last_name: Pauler - first_name: Simon full_name: Hippenmeyer, Simon id: 37B36620-F248-11E8-B48F-1D18A9856A87 last_name: Hippenmeyer orcid: 0000-0003-2279-1061 citation: ama: Laukoter S, Amberg N, Pauler F, Hippenmeyer S. Generation and isolation of single cells from mouse brain with mosaic analysis with double markers-induced uniparental chromosome disomy. STAR Protocols. 2020;1(3). doi:10.1016/j.xpro.2020.100215 apa: Laukoter, S., Amberg, N., Pauler, F., & Hippenmeyer, S. (2020). Generation and isolation of single cells from mouse brain with mosaic analysis with double markers-induced uniparental chromosome disomy. STAR Protocols. Elsevier. https://doi.org/10.1016/j.xpro.2020.100215 chicago: Laukoter, Susanne, Nicole Amberg, Florian Pauler, and Simon Hippenmeyer. “Generation and Isolation of Single Cells from Mouse Brain with Mosaic Analysis with Double Markers-Induced Uniparental Chromosome Disomy.” STAR Protocols. Elsevier, 2020. https://doi.org/10.1016/j.xpro.2020.100215. ieee: S. Laukoter, N. Amberg, F. Pauler, and S. Hippenmeyer, “Generation and isolation of single cells from mouse brain with mosaic analysis with double markers-induced uniparental chromosome disomy,” STAR Protocols, vol. 1, no. 3. Elsevier, 2020. ista: Laukoter S, Amberg N, Pauler F, Hippenmeyer S. 2020. Generation and isolation of single cells from mouse brain with mosaic analysis with double markers-induced uniparental chromosome disomy. STAR Protocols. 1(3), 100215. mla: Laukoter, Susanne, et al. “Generation and Isolation of Single Cells from Mouse Brain with Mosaic Analysis with Double Markers-Induced Uniparental Chromosome Disomy.” STAR Protocols, vol. 1, no. 3, 100215, Elsevier, 2020, doi:10.1016/j.xpro.2020.100215. short: S. Laukoter, N. Amberg, F. Pauler, S. Hippenmeyer, STAR Protocols 1 (2020). date_created: 2020-12-30T10:17:07Z date_published: 2020-12-18T00:00:00Z date_updated: 2021-01-12T08:21:36Z day: '18' ddc: - '570' department: - _id: SiHi doi: 10.1016/j.xpro.2020.100215 ec_funded: 1 external_id: pmid: - '33377108' file: - access_level: open_access checksum: f1e9a433e9cb0f41f7b6df6b76db1f6e content_type: application/pdf creator: dernst date_created: 2021-01-07T15:57:27Z date_updated: 2021-01-07T15:57:27Z file_id: '8996' file_name: 2020_STARProtocols_Laukoter.pdf file_size: 4031449 relation: main_file success: 1 file_date_updated: 2021-01-07T15:57:27Z has_accepted_license: '1' intvolume: ' 1' issue: '3' language: - iso: eng month: '12' oa: 1 oa_version: Published Version pmid: 1 project: - _id: 268F8446-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: T0101031 name: Role of Eed in neural stem cell lineage progression - _id: 059F6AB4-7A3F-11EA-A408-12923DDC885E grant_number: F07805 name: Molecular Mechanisms of Neural Stem Cell Lineage Progression - _id: 25D92700-B435-11E9-9278-68D0E5697425 grant_number: LS13-002 name: Mapping Cell-Type Specificity of the Genomic Imprintome in the Brain - _id: 25D61E48-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '618444' name: Molecular Mechanisms of Cerebral Cortex Development - _id: 260018B0-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '725780' name: Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development publication: STAR Protocols publication_identifier: issn: - 2666-1667 publication_status: published publisher: Elsevier quality_controlled: '1' status: public title: Generation and isolation of single cells from mouse brain with mosaic analysis with double markers-induced uniparental chromosome disomy tmp: image: /images/cc_by_nc_nd.png legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0) short: CC BY-NC-ND (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 1 year: '2020' ... --- _id: '9103' abstract: - lang: eng text: 'We introduce LRT-NG, a set of techniques and an associated toolset that computes a reachtube (an over-approximation of the set of reachable states over a given time horizon) of a nonlinear dynamical system. LRT-NG significantly advances the state-of-the-art Langrangian Reachability and its associated tool LRT. From a theoretical perspective, LRT-NG is superior to LRT in three ways. First, it uses for the first time an analytically computed metric for the propagated ball which is proven to minimize the ball’s volume. We emphasize that the metric computation is the centerpiece of all bloating-based techniques. Secondly, it computes the next reachset as the intersection of two balls: one based on the Cartesian metric and the other on the new metric. While the two metrics were previously considered opposing approaches, their joint use considerably tightens the reachtubes. Thirdly, it avoids the "wrapping effect" associated with the validated integration of the center of the reachset, by optimally absorbing the interval approximation in the radius of the next ball. From a tool-development perspective, LRT-NG is superior to LRT in two ways. First, it is a standalone tool that no longer relies on CAPD. This required the implementation of the Lohner method and a Runge-Kutta time-propagation method. Secondly, it has an improved interface, allowing the input model and initial conditions to be provided as external input files. Our experiments on a comprehensive set of benchmarks, including two Neural ODEs, demonstrates LRT-NG’s superior performance compared to LRT, CAPD, and Flow*.' acknowledgement: "The authors would like to thank Ramin Hasani and Guillaume Berger for intellectual discussions about the research which lead to the generation of new ideas. ML was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). Smolka’s research was supported by NSF grants CPS-1446832 and CCF-1918225. Gruenbacher is funded by FWF project W1255-N23. JC was partially supported by NAWA Polish Returns grant\r\nPPN/PPO/2018/1/00029.\r\n" article_processing_charge: No author: - first_name: Sophie full_name: Gruenbacher, Sophie last_name: Gruenbacher - first_name: Jacek full_name: Cyranka, Jacek last_name: Cyranka - first_name: Mathias full_name: Lechner, Mathias id: 3DC22916-F248-11E8-B48F-1D18A9856A87 last_name: Lechner - first_name: Md Ariful full_name: Islam, Md Ariful last_name: Islam - first_name: Scott A. full_name: Smolka, Scott A. last_name: Smolka - first_name: Radu full_name: Grosu, Radu last_name: Grosu citation: ama: 'Gruenbacher S, Cyranka J, Lechner M, Islam MA, Smolka SA, Grosu R. Lagrangian reachtubes: The next generation. In: Proceedings of the 59th IEEE Conference on Decision and Control. Vol 2020. IEEE; 2020:1556-1563. doi:10.1109/CDC42340.2020.9304042' apa: 'Gruenbacher, S., Cyranka, J., Lechner, M., Islam, M. A., Smolka, S. A., & Grosu, R. (2020). Lagrangian reachtubes: The next generation. In Proceedings of the 59th IEEE Conference on Decision and Control (Vol. 2020, pp. 1556–1563). Jeju Islang, Korea (South): IEEE. https://doi.org/10.1109/CDC42340.2020.9304042' chicago: 'Gruenbacher, Sophie, Jacek Cyranka, Mathias Lechner, Md Ariful Islam, Scott A. Smolka, and Radu Grosu. “Lagrangian Reachtubes: The next Generation.” In Proceedings of the 59th IEEE Conference on Decision and Control, 2020:1556–63. IEEE, 2020. https://doi.org/10.1109/CDC42340.2020.9304042.' ieee: 'S. Gruenbacher, J. Cyranka, M. Lechner, M. A. Islam, S. A. Smolka, and R. Grosu, “Lagrangian reachtubes: The next generation,” in Proceedings of the 59th IEEE Conference on Decision and Control, Jeju Islang, Korea (South), 2020, vol. 2020, pp. 1556–1563.' ista: 'Gruenbacher S, Cyranka J, Lechner M, Islam MA, Smolka SA, Grosu R. 2020. Lagrangian reachtubes: The next generation. Proceedings of the 59th IEEE Conference on Decision and Control. CDC: Conference on Decision and Control vol. 2020, 1556–1563.' mla: 'Gruenbacher, Sophie, et al. “Lagrangian Reachtubes: The next Generation.” Proceedings of the 59th IEEE Conference on Decision and Control, vol. 2020, IEEE, 2020, pp. 1556–63, doi:10.1109/CDC42340.2020.9304042.' short: S. Gruenbacher, J. Cyranka, M. Lechner, M.A. Islam, S.A. Smolka, R. Grosu, in:, Proceedings of the 59th IEEE Conference on Decision and Control, IEEE, 2020, pp. 1556–1563. conference: end_date: 2020-12-18 location: Jeju Islang, Korea (South) name: 'CDC: Conference on Decision and Control' start_date: 2020-12-14 date_created: 2021-02-07T23:01:14Z date_published: 2020-12-14T00:00:00Z date_updated: 2021-02-09T09:20:58Z day: '14' department: - _id: ToHe doi: 10.1109/CDC42340.2020.9304042 external_id: arxiv: - '2012.07458' intvolume: ' 2020' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/2012.07458 month: '12' oa: 1 oa_version: Preprint page: 1556-1563 project: - _id: 25F42A32-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z211 name: The Wittgenstein Prize publication: Proceedings of the 59th IEEE Conference on Decision and Control publication_identifier: isbn: - '9781728174471' issn: - '07431546' publication_status: published publisher: IEEE quality_controlled: '1' scopus_import: '1' status: public title: 'Lagrangian reachtubes: The next generation' type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 2020 year: '2020' ... --- _id: '9208' abstract: - lang: eng text: 'Bending-active structures are able to efficiently produce complex curved shapes from flat panels. The desired deformation of the panels derives from the proper selection of their elastic properties. Optimized panels, called FlexMaps, are designed such that, once they are bent and assembled, the resulting static equilibrium configuration matches a desired input 3D shape. The FlexMaps elastic properties are controlled by locally varying spiraling geometric mesostructures, which are optimized in size and shape to match specific bending requests, namely the global curvature of the target shape. The design pipeline starts from a quad mesh representing the input 3D shape, which defines the edge size and the total amount of spirals: every quad will embed one spiral. Then, an optimization algorithm tunes the geometry of the spirals by using a simplified pre-computed rod model. This rod model is derived from a non-linear regression algorithm which approximates the non-linear behavior of solid FEM spiral models subject to hundreds of load combinations. This innovative pipeline has been applied to the project of a lightweight plywood pavilion named FlexMaps Pavilion, which is a single-layer piecewise twisted arch that fits a bounding box of 3.90x3.96x3.25 meters. This case study serves to test the applicability of this methodology at the architectural scale. The structure is validated via FE analyses and the fabrication of the full scale prototype.' acknowledgement: 'The FlexMaps Pavilion has been awarded First Prize at the “Competition and Exhibition of innovative lightweight structures” organized by the IASS Working Group 21 within the FORM and FORCE, joint international conference of IASS Symposium 2019 and Structural Membranes 2019 (Barcelona, 7-11 October 2019) with the following motivation: “for its structural innovation of bending-twisting system, connection constructability and exquisite craftmanship”[20]. The authors would like to acknowledge the Visual Computing Lab Staff of ISTI - CNR, in particular Thomas Alderighi, Marco Callieri, Paolo Pingi; Antonio Rizzo of IPCF - CNR; and the Administrative Staff of ISTI - CNR. This research was partially funded by the EU H2020 Programme EVOCATION: Advanced Visual and Geometric Computing for 3D Capture, Display, and Fabrication (grant no. 813170).' article_number: '1505' article_processing_charge: No article_type: original author: - first_name: Francesco full_name: Laccone, Francesco last_name: Laccone - first_name: Luigi full_name: Malomo, Luigi last_name: Malomo - first_name: Jesus full_name: Perez Rodriguez, Jesus id: 2DC83906-F248-11E8-B48F-1D18A9856A87 last_name: Perez Rodriguez - first_name: Nico full_name: Pietroni, Nico last_name: Pietroni - first_name: Federico full_name: Ponchio, Federico last_name: Ponchio - first_name: Bernd full_name: Bickel, Bernd id: 49876194-F248-11E8-B48F-1D18A9856A87 last_name: Bickel orcid: 0000-0001-6511-9385 - first_name: Paolo full_name: Cignoni, Paolo last_name: Cignoni citation: ama: 'Laccone F, Malomo L, Perez Rodriguez J, et al. A bending-active twisted-arch plywood structure: Computational design and fabrication of the FlexMaps Pavilion. SN Applied Sciences. 2020;2(9). doi:10.1007/s42452-020-03305-w' apa: 'Laccone, F., Malomo, L., Perez Rodriguez, J., Pietroni, N., Ponchio, F., Bickel, B., & Cignoni, P. (2020). A bending-active twisted-arch plywood structure: Computational design and fabrication of the FlexMaps Pavilion. SN Applied Sciences. Springer Nature. https://doi.org/10.1007/s42452-020-03305-w' chicago: 'Laccone, Francesco, Luigi Malomo, Jesus Perez Rodriguez, Nico Pietroni, Federico Ponchio, Bernd Bickel, and Paolo Cignoni. “A Bending-Active Twisted-Arch Plywood Structure: Computational Design and Fabrication of the FlexMaps Pavilion.” SN Applied Sciences. Springer Nature, 2020. https://doi.org/10.1007/s42452-020-03305-w.' ieee: 'F. Laccone et al., “A bending-active twisted-arch plywood structure: Computational design and fabrication of the FlexMaps Pavilion,” SN Applied Sciences, vol. 2, no. 9. Springer Nature, 2020.' ista: 'Laccone F, Malomo L, Perez Rodriguez J, Pietroni N, Ponchio F, Bickel B, Cignoni P. 2020. A bending-active twisted-arch plywood structure: Computational design and fabrication of the FlexMaps Pavilion. SN Applied Sciences. 2(9), 1505.' mla: 'Laccone, Francesco, et al. “A Bending-Active Twisted-Arch Plywood Structure: Computational Design and Fabrication of the FlexMaps Pavilion.” SN Applied Sciences, vol. 2, no. 9, 1505, Springer Nature, 2020, doi:10.1007/s42452-020-03305-w.' short: F. Laccone, L. Malomo, J. Perez Rodriguez, N. Pietroni, F. Ponchio, B. Bickel, P. Cignoni, SN Applied Sciences 2 (2020). date_created: 2021-02-28T23:01:25Z date_published: 2020-09-01T00:00:00Z date_updated: 2021-03-03T09:43:14Z day: '01' department: - _id: BeBi doi: 10.1007/s42452-020-03305-w intvolume: ' 2' issue: '9' language: - iso: eng month: '09' oa_version: None publication: SN Applied Sciences publication_identifier: eissn: - '25233971' publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: 'A bending-active twisted-arch plywood structure: Computational design and fabrication of the FlexMaps Pavilion' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 2 year: '2020' ... --- _id: '9221' abstract: - lang: eng text: "Recent works have shown that gradient descent can find a global minimum for over-parameterized neural networks where the widths of all the hidden layers scale polynomially with N (N being the number of training samples). In this paper, we prove that, for deep networks, a single layer of width N following the input layer suffices to ensure a similar guarantee. In particular, all the remaining layers are allowed to have constant widths, and form a pyramidal topology. We show an application of our result to the widely used LeCun’s initialization and obtain an over-parameterization requirement for the single wide layer of order N2.\r\n" acknowledgement: The authors would like to thank Jan Maas, Mahdi Soltanolkotabi, and Daniel Soudry for the helpful discussions, Marius Kloft, Matthias Hein and Quoc Dinh Tran for proofreading portions of a prior version of this paper, and James Martens for a clarification concerning LeCun’s initialization. M. Mondelli was partially supported by the 2019 Lopez-Loreta Prize. Q. Nguyen was partially supported by the German Research Foundation (DFG) award KL 2698/2-1. article_processing_charge: No author: - first_name: Quynh full_name: Nguyen, Quynh last_name: Nguyen - first_name: Marco full_name: Mondelli, Marco id: 27EB676C-8706-11E9-9510-7717E6697425 last_name: Mondelli orcid: 0000-0002-3242-7020 citation: ama: 'Nguyen Q, Mondelli M. Global convergence of deep networks with one wide layer followed by pyramidal topology. In: 34th Conference on Neural Information Processing Systems. Vol 33. Curran Associates; 2020:11961–11972.' apa: 'Nguyen, Q., & Mondelli, M. (2020). Global convergence of deep networks with one wide layer followed by pyramidal topology. In 34th Conference on Neural Information Processing Systems (Vol. 33, pp. 11961–11972). Vancouver, Canada: Curran Associates.' chicago: Nguyen, Quynh, and Marco Mondelli. “Global Convergence of Deep Networks with One Wide Layer Followed by Pyramidal Topology.” In 34th Conference on Neural Information Processing Systems, 33:11961–11972. Curran Associates, 2020. ieee: Q. Nguyen and M. Mondelli, “Global convergence of deep networks with one wide layer followed by pyramidal topology,” in 34th Conference on Neural Information Processing Systems, Vancouver, Canada, 2020, vol. 33, pp. 11961–11972. ista: 'Nguyen Q, Mondelli M. 2020. Global convergence of deep networks with one wide layer followed by pyramidal topology. 34th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems vol. 33, 11961–11972.' mla: Nguyen, Quynh, and Marco Mondelli. “Global Convergence of Deep Networks with One Wide Layer Followed by Pyramidal Topology.” 34th Conference on Neural Information Processing Systems, vol. 33, Curran Associates, 2020, pp. 11961–11972. short: Q. Nguyen, M. Mondelli, in:, 34th Conference on Neural Information Processing Systems, Curran Associates, 2020, pp. 11961–11972. conference: end_date: 2020-12-12 location: Vancouver, Canada name: 'NeurIPS: Neural Information Processing Systems' start_date: 2020-12-06 date_created: 2021-03-03T12:06:02Z date_published: 2020-07-07T00:00:00Z date_updated: 2022-01-04T09:24:41Z day: '07' department: - _id: MaMo external_id: arxiv: - '2002.07867' intvolume: ' 33' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/2002.07867 month: '07' oa: 1 oa_version: Preprint page: 11961–11972 project: - _id: 059876FA-7A3F-11EA-A408-12923DDC885E name: Prix Lopez-Loretta 2019 - Marco Mondelli publication: 34th Conference on Neural Information Processing Systems publication_status: published publisher: Curran Associates quality_controlled: '1' status: public title: Global convergence of deep networks with one wide layer followed by pyramidal topology type: conference user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 volume: 33 year: '2020' ... --- _id: '9415' abstract: - lang: eng text: 'Optimizing convolutional neural networks for fast inference has recently become an extremely active area of research. One of the go-to solutions in this context is weight pruning, which aims to reduce computational and memory footprint by removing large subsets of the connections in a neural network. Surprisingly, much less attention has been given to exploiting sparsity in the activation maps, which tend to be naturally sparse in many settings thanks to the structure of rectified linear (ReLU) activation functions. In this paper, we present an in-depth analysis of methods for maximizing the sparsity of the activations in a trained neural network, and show that, when coupled with an efficient sparse-input convolution algorithm, we can leverage this sparsity for significant performance gains. To induce highly sparse activation maps without accuracy loss, we introduce a new regularization technique, coupled with a new threshold-based sparsification method based on a parameterized activation function called Forced-Activation-Threshold Rectified Linear Unit (FATReLU). We examine the impact of our methods on popular image classification models, showing that most architectures can adapt to significantly sparser activation maps without any accuracy loss. Our second contribution is showing that these these compression gains can be translated into inference speedups: we provide a new algorithm to enable fast convolution operations over networks with sparse activations, and show that it can enable significant speedups for end-to-end inference on a range of popular models on the large-scale ImageNet image classification task on modern Intel CPUs, with little or no retraining cost. ' article_processing_charge: No author: - first_name: Mark full_name: Kurtz, Mark last_name: Kurtz - first_name: Justin full_name: Kopinsky, Justin last_name: Kopinsky - first_name: Rati full_name: Gelashvili, Rati last_name: Gelashvili - first_name: Alexander full_name: Matveev, Alexander last_name: Matveev - first_name: John full_name: Carr, John last_name: Carr - first_name: Michael full_name: Goin, Michael last_name: Goin - first_name: William full_name: Leiserson, William last_name: Leiserson - first_name: Sage full_name: Moore, Sage last_name: Moore - first_name: Bill full_name: Nell, Bill last_name: Nell - first_name: Nir full_name: Shavit, Nir last_name: Shavit - first_name: Dan-Adrian full_name: Alistarh, Dan-Adrian id: 4A899BFC-F248-11E8-B48F-1D18A9856A87 last_name: Alistarh orcid: 0000-0003-3650-940X citation: ama: 'Kurtz M, Kopinsky J, Gelashvili R, et al. Inducing and exploiting activation sparsity for fast neural network inference. In: 37th International Conference on Machine Learning, ICML 2020. Vol 119. ; 2020:5533-5543.' apa: Kurtz, M., Kopinsky, J., Gelashvili, R., Matveev, A., Carr, J., Goin, M., … Alistarh, D.-A. (2020). Inducing and exploiting activation sparsity for fast neural network inference. In 37th International Conference on Machine Learning, ICML 2020 (Vol. 119, pp. 5533–5543). Online. chicago: Kurtz, Mark, Justin Kopinsky, Rati Gelashvili, Alexander Matveev, John Carr, Michael Goin, William Leiserson, et al. “Inducing and Exploiting Activation Sparsity for Fast Neural Network Inference.” In 37th International Conference on Machine Learning, ICML 2020, 119:5533–43, 2020. ieee: M. Kurtz et al., “Inducing and exploiting activation sparsity for fast neural network inference,” in 37th International Conference on Machine Learning, ICML 2020, Online, 2020, vol. 119, pp. 5533–5543. ista: 'Kurtz M, Kopinsky J, Gelashvili R, Matveev A, Carr J, Goin M, Leiserson W, Moore S, Nell B, Shavit N, Alistarh D-A. 2020. Inducing and exploiting activation sparsity for fast neural network inference. 37th International Conference on Machine Learning, ICML 2020. ICML: International Conference on Machine Learning vol. 119, 5533–5543.' mla: Kurtz, Mark, et al. “Inducing and Exploiting Activation Sparsity for Fast Neural Network Inference.” 37th International Conference on Machine Learning, ICML 2020, vol. 119, 2020, pp. 5533–43. short: M. Kurtz, J. Kopinsky, R. Gelashvili, A. Matveev, J. Carr, M. Goin, W. Leiserson, S. Moore, B. Nell, N. Shavit, D.-A. Alistarh, in:, 37th International Conference on Machine Learning, ICML 2020, 2020, pp. 5533–5543. conference: end_date: 2020-07-18 location: Online name: 'ICML: International Conference on Machine Learning' start_date: 2020-07-12 date_created: 2021-05-23T22:01:45Z date_published: 2020-07-12T00:00:00Z date_updated: 2023-02-23T13:57:24Z day: '12' ddc: - '000' department: - _id: DaAl file: - access_level: open_access checksum: 2aaaa7d7226e49161311d91627cf783b content_type: application/pdf creator: kschuh date_created: 2021-05-25T09:51:36Z date_updated: 2021-05-25T09:51:36Z file_id: '9421' file_name: 2020_PMLR_Kurtz.pdf file_size: 741899 relation: main_file success: 1 file_date_updated: 2021-05-25T09:51:36Z has_accepted_license: '1' intvolume: ' 119' language: - iso: eng month: '07' oa: 1 oa_version: Published Version page: 5533-5543 publication: 37th International Conference on Machine Learning, ICML 2020 publication_identifier: issn: - 2640-3498 quality_controlled: '1' scopus_import: '1' status: public title: Inducing and exploiting activation sparsity for fast neural network inference type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 119 year: '2020' ... --- _id: '10672' abstract: - lang: eng text: The family of feedback alignment (FA) algorithms aims to provide a more biologically motivated alternative to backpropagation (BP), by substituting the computations that are unrealistic to be implemented in physical brains. While FA algorithms have been shown to work well in practice, there is a lack of rigorous theory proofing their learning capabilities. Here we introduce the first feedback alignment algorithm with provable learning guarantees. In contrast to existing work, we do not require any assumption about the size or depth of the network except that it has a single output neuron, i.e., such as for binary classification tasks. We show that our FA algorithm can deliver its theoretical promises in practice, surpassing the learning performance of existing FA methods and matching backpropagation in binary classification tasks. Finally, we demonstrate the limits of our FA variant when the number of output neurons grows beyond a certain quantity. acknowledgement: "This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23\r\n(Wittgenstein Award).\r\n" article_processing_charge: No author: - first_name: Mathias full_name: Lechner, Mathias id: 3DC22916-F248-11E8-B48F-1D18A9856A87 last_name: Lechner citation: ama: 'Lechner M. Learning representations for binary-classification without backpropagation. In: 8th International Conference on Learning Representations. ICLR; 2020.' apa: 'Lechner, M. (2020). Learning representations for binary-classification without backpropagation. In 8th International Conference on Learning Representations. Virtual ; Addis Ababa, Ethiopia: ICLR.' chicago: Lechner, Mathias. “Learning Representations for Binary-Classification without Backpropagation.” In 8th International Conference on Learning Representations. ICLR, 2020. ieee: M. Lechner, “Learning representations for binary-classification without backpropagation,” in 8th International Conference on Learning Representations, Virtual ; Addis Ababa, Ethiopia, 2020. ista: 'Lechner M. 2020. Learning representations for binary-classification without backpropagation. 8th International Conference on Learning Representations. ICLR: International Conference on Learning Representations.' mla: Lechner, Mathias. “Learning Representations for Binary-Classification without Backpropagation.” 8th International Conference on Learning Representations, ICLR, 2020. short: M. Lechner, in:, 8th International Conference on Learning Representations, ICLR, 2020. conference: end_date: 2020-05-01 location: Virtual ; Addis Ababa, Ethiopia name: 'ICLR: International Conference on Learning Representations' start_date: 2020-04-26 date_created: 2022-01-25T15:50:00Z date_published: 2020-03-11T00:00:00Z date_updated: 2023-04-03T07:33:40Z day: '11' ddc: - '000' department: - _id: GradSch - _id: ToHe file: - access_level: open_access checksum: ea13d42dd4541ddb239b6a75821fd6c9 content_type: application/pdf creator: mlechner date_created: 2022-01-26T07:35:17Z date_updated: 2022-01-26T07:35:17Z file_id: '10677' file_name: iclr_2020.pdf file_size: 249431 relation: main_file success: 1 file_date_updated: 2022-01-26T07:35:17Z has_accepted_license: '1' language: - iso: eng main_file_link: - open_access: '1' url: https://openreview.net/forum?id=Bke61krFvS month: '03' oa: 1 oa_version: Published Version project: - _id: 25F42A32-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z211 name: The Wittgenstein Prize publication: 8th International Conference on Learning Representations publication_status: published publisher: ICLR quality_controlled: '1' scopus_import: '1' status: public title: Learning representations for binary-classification without backpropagation tmp: image: /images/cc_by_nc_nd.png legal_code_url: https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode name: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0) short: CC BY-NC-ND (3.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2020' ... --- _id: '8188' abstract: - lang: eng text: "A natural approach to generative modeling of videos is to represent them as a composition of moving objects. Recent works model a set of 2D sprites over a slowly-varying background, but without considering the underlying 3D scene that\r\ngives rise to them. We instead propose to model a video as the view seen while moving through a scene with multiple 3D objects and a 3D background. Our model is trained from monocular videos without any supervision, yet learns to\r\ngenerate coherent 3D scenes containing several moving objects. We conduct detailed experiments on two datasets, going beyond the visual complexity supported by state-of-the-art generative approaches. We evaluate our method on\r\ndepth-prediction and 3D object detection---tasks which cannot be addressed by those earlier works---and show it out-performs them even on 2D instance segmentation and tracking." acknowledged_ssus: - _id: ScienComp acknowledgement: "This research was supported by the Scientific Service Units (SSU) of IST Austria through resources\r\nprovided by Scientific Computing (SciComp). PH is employed part-time by Blackford Analysis, but\r\nthey did not support this project in any way." article_processing_charge: No author: - first_name: Paul M full_name: Henderson, Paul M id: 13C09E74-18D9-11E9-8878-32CFE5697425 last_name: Henderson orcid: 0000-0002-5198-7445 - first_name: Christoph full_name: Lampert, Christoph id: 40C20FD2-F248-11E8-B48F-1D18A9856A87 last_name: Lampert orcid: 0000-0001-8622-7887 citation: ama: 'Henderson PM, Lampert C. Unsupervised object-centric video generation and decomposition in 3D. In: 34th Conference on Neural Information Processing Systems. Vol 33. Curran Associates; 2020:3106–3117.' apa: 'Henderson, P. M., & Lampert, C. (2020). Unsupervised object-centric video generation and decomposition in 3D. In 34th Conference on Neural Information Processing Systems (Vol. 33, pp. 3106–3117). Vancouver, Canada: Curran Associates.' chicago: Henderson, Paul M, and Christoph Lampert. “Unsupervised Object-Centric Video Generation and Decomposition in 3D.” In 34th Conference on Neural Information Processing Systems, 33:3106–3117. Curran Associates, 2020. ieee: P. M. Henderson and C. Lampert, “Unsupervised object-centric video generation and decomposition in 3D,” in 34th Conference on Neural Information Processing Systems, Vancouver, Canada, 2020, vol. 33, pp. 3106–3117. ista: 'Henderson PM, Lampert C. 2020. Unsupervised object-centric video generation and decomposition in 3D. 34th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems vol. 33, 3106–3117.' mla: Henderson, Paul M., and Christoph Lampert. “Unsupervised Object-Centric Video Generation and Decomposition in 3D.” 34th Conference on Neural Information Processing Systems, vol. 33, Curran Associates, 2020, pp. 3106–3117. short: P.M. Henderson, C. Lampert, in:, 34th Conference on Neural Information Processing Systems, Curran Associates, 2020, pp. 3106–3117. conference: end_date: 2020-12-12 location: Vancouver, Canada name: 'NeurIPS: Neural Information Processing Systems' start_date: 2020-12-06 date_created: 2020-07-31T16:59:19Z date_published: 2020-07-07T00:00:00Z date_updated: 2023-04-25T09:49:58Z day: '07' department: - _id: ChLa external_id: arxiv: - '2007.06705' intvolume: ' 33' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/2007.06705 month: '07' oa: 1 oa_version: Preprint page: 3106–3117 publication: 34th Conference on Neural Information Processing Systems publication_identifier: isbn: - '9781713829546' publication_status: published publisher: Curran Associates quality_controlled: '1' status: public title: Unsupervised object-centric video generation and decomposition in 3D type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 33 year: '2020' ... --- _id: '7474' abstract: - lang: eng text: This booklet is a collection of abstracts presented at the AHPC conference. article_processing_charge: No citation: ama: 'Schlögl A, Kiss J, Elefante S, eds. Austrian High-Performance-Computing Meeting (AHPC2020). Klosterneuburg, Austria: IST Austria; 2020. doi:10.15479/AT:ISTA:7474' apa: 'Schlögl, A., Kiss, J., & Elefante, S. (Eds.). (2020). Austrian High-Performance-Computing meeting (AHPC2020). Presented at the AHPC: Austrian High-Performance-Computing Meeting, Klosterneuburg, Austria: IST Austria. https://doi.org/10.15479/AT:ISTA:7474' chicago: 'Schlögl, Alois, Janos Kiss, and Stefano Elefante, eds. Austrian High-Performance-Computing Meeting (AHPC2020). Klosterneuburg, Austria: IST Austria, 2020. https://doi.org/10.15479/AT:ISTA:7474.' ieee: 'A. Schlögl, J. Kiss, and S. Elefante, Eds., Austrian High-Performance-Computing meeting (AHPC2020). Klosterneuburg, Austria: IST Austria, 2020.' ista: 'Schlögl A, Kiss J, Elefante S eds. 2020. Austrian High-Performance-Computing meeting (AHPC2020), Klosterneuburg, Austria: IST Austria, 72p.' mla: Schlögl, Alois, et al., editors. Austrian High-Performance-Computing Meeting (AHPC2020). IST Austria, 2020, doi:10.15479/AT:ISTA:7474. short: A. Schlögl, J. Kiss, S. Elefante, eds., Austrian High-Performance-Computing Meeting (AHPC2020), IST Austria, Klosterneuburg, Austria, 2020. conference: end_date: 2020-02-21 location: Klosterneuburg, Austria name: 'AHPC: Austrian High-Performance-Computing Meeting' start_date: 2020-02-19 date_created: 2020-02-11T07:59:04Z date_published: 2020-02-19T00:00:00Z date_updated: 2023-05-16T07:48:28Z day: '19' ddc: - '000' department: - _id: ScienComp doi: 10.15479/AT:ISTA:7474 editor: - first_name: Alois full_name: Schlögl, Alois id: 45BF87EE-F248-11E8-B48F-1D18A9856A87 last_name: Schlögl orcid: 0000-0002-5621-8100 - first_name: Janos full_name: Kiss, Janos id: 3D3A06F8-F248-11E8-B48F-1D18A9856A87 last_name: Kiss - first_name: Stefano full_name: Elefante, Stefano id: 490F40CE-F248-11E8-B48F-1D18A9856A87 last_name: Elefante file: - access_level: open_access checksum: 49798edb9e57bbd6be18362d1d7b18a9 content_type: application/pdf creator: schloegl date_created: 2020-02-19T06:53:38Z date_updated: 2020-07-14T12:47:59Z file_id: '7504' file_name: BOOKLET_AHPC2020.final.pdf file_size: 90899507 relation: main_file file_date_updated: 2020-07-14T12:47:59Z has_accepted_license: '1' language: - iso: eng month: '02' oa: 1 oa_version: Published Version page: '72' place: Klosterneuburg, Austria publication_identifier: isbn: - 978-3-99078-004-6 publication_status: published publisher: IST Austria quality_controlled: '1' status: public title: Austrian High-Performance-Computing meeting (AHPC2020) tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: book_editor user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2020' ... --- _id: '7808' abstract: - lang: eng text: Quantization converts neural networks into low-bit fixed-point computations which can be carried out by efficient integer-only hardware, and is standard practice for the deployment of neural networks on real-time embedded devices. However, like their real-numbered counterpart, quantized networks are not immune to malicious misclassification caused by adversarial attacks. We investigate how quantization affects a network’s robustness to adversarial attacks, which is a formal verification question. We show that neither robustness nor non-robustness are monotonic with changing the number of bits for the representation and, also, neither are preserved by quantization from a real-numbered network. For this reason, we introduce a verification method for quantized neural networks which, using SMT solving over bit-vectors, accounts for their exact, bit-precise semantics. We built a tool and analyzed the effect of quantization on a classifier for the MNIST dataset. We demonstrate that, compared to our method, existing methods for the analysis of real-numbered networks often derive false conclusions about their quantizations, both when determining robustness and when detecting attacks, and that existing methods for quantized networks often miss attacks. Furthermore, we applied our method beyond robustness, showing how the number of bits in quantization enlarges the gender bias of a predictor for students’ grades. alternative_title: - LNCS article_processing_charge: No author: - first_name: Mirco full_name: Giacobbe, Mirco id: 3444EA5E-F248-11E8-B48F-1D18A9856A87 last_name: Giacobbe orcid: 0000-0001-8180-0904 - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000-0002-2985-7724 - first_name: Mathias full_name: Lechner, Mathias id: 3DC22916-F248-11E8-B48F-1D18A9856A87 last_name: Lechner citation: ama: 'Giacobbe M, Henzinger TA, Lechner M. How many bits does it take to quantize your neural network? In: International Conference on Tools and Algorithms for the Construction and Analysis of Systems. Vol 12079. Springer Nature; 2020:79-97. doi:10.1007/978-3-030-45237-7_5' apa: 'Giacobbe, M., Henzinger, T. A., & Lechner, M. (2020). How many bits does it take to quantize your neural network? In International Conference on Tools and Algorithms for the Construction and Analysis of Systems (Vol. 12079, pp. 79–97). Dublin, Ireland: Springer Nature. https://doi.org/10.1007/978-3-030-45237-7_5' chicago: Giacobbe, Mirco, Thomas A Henzinger, and Mathias Lechner. “How Many Bits Does It Take to Quantize Your Neural Network?” In International Conference on Tools and Algorithms for the Construction and Analysis of Systems, 12079:79–97. Springer Nature, 2020. https://doi.org/10.1007/978-3-030-45237-7_5. ieee: M. Giacobbe, T. A. Henzinger, and M. Lechner, “How many bits does it take to quantize your neural network?,” in International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Dublin, Ireland, 2020, vol. 12079, pp. 79–97. ista: 'Giacobbe M, Henzinger TA, Lechner M. 2020. How many bits does it take to quantize your neural network? International Conference on Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 12079, 79–97.' mla: Giacobbe, Mirco, et al. “How Many Bits Does It Take to Quantize Your Neural Network?” International Conference on Tools and Algorithms for the Construction and Analysis of Systems, vol. 12079, Springer Nature, 2020, pp. 79–97, doi:10.1007/978-3-030-45237-7_5. short: M. Giacobbe, T.A. Henzinger, M. Lechner, in:, International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Springer Nature, 2020, pp. 79–97. conference: end_date: 2020-04-30 location: Dublin, Ireland name: 'TACAS: Tools and Algorithms for the Construction and Analysis of Systems' start_date: 2020-04-25 date_created: 2020-05-10T22:00:49Z date_published: 2020-04-17T00:00:00Z date_updated: 2023-06-23T07:01:11Z day: '17' ddc: - '000' department: - _id: ToHe doi: 10.1007/978-3-030-45237-7_5 file: - access_level: open_access checksum: f19905a42891fe5ce93d69143fa3f6fb content_type: application/pdf creator: dernst date_created: 2020-05-26T12:48:15Z date_updated: 2020-07-14T12:48:03Z file_id: '7893' file_name: 2020_TACAS_Giacobbe.pdf file_size: 2744030 relation: main_file file_date_updated: 2020-07-14T12:48:03Z has_accepted_license: '1' intvolume: ' 12079' language: - iso: eng month: '04' oa: 1 oa_version: Published Version page: 79-97 project: - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 25F42A32-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z211 name: The Wittgenstein Prize publication: International Conference on Tools and Algorithms for the Construction and Analysis of Systems publication_identifier: eissn: - '16113349' isbn: - '9783030452360' issn: - '03029743' publication_status: published publisher: Springer Nature quality_controlled: '1' related_material: record: - id: '11362' relation: dissertation_contains status: public scopus_import: 1 status: public title: How many bits does it take to quantize your neural network? tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 12079 year: '2020' ... --- _id: '7952' abstract: - lang: eng text: "Isomanifolds are the generalization of isosurfaces to arbitrary dimension and codimension, i.e. manifolds defined as the zero set of some multivariate vector-valued smooth function f: ℝ^d → ℝ^(d-n). A natural (and efficient) way to approximate an isomanifold is to consider its Piecewise-Linear (PL) approximation based on a triangulation \U0001D4AF of the ambient space ℝ^d. In this paper, we give conditions under which the PL-approximation of an isomanifold is topologically equivalent to the isomanifold. The conditions are easy to satisfy in the sense that they can always be met by taking a sufficiently fine triangulation \U0001D4AF. This contrasts with previous results on the triangulation of manifolds where, in arbitrary dimensions, delicate perturbations are needed to guarantee topological correctness, which leads to strong limitations in practice. We further give a bound on the Fréchet distance between the original isomanifold and its PL-approximation. Finally we show analogous results for the PL-approximation of an isomanifold with boundary. " alternative_title: - LIPIcs article_number: 20:1-20:18 article_processing_charge: No author: - first_name: Jean-Daniel full_name: Boissonnat, Jean-Daniel last_name: Boissonnat - first_name: Mathijs full_name: Wintraecken, Mathijs id: 307CFBC8-F248-11E8-B48F-1D18A9856A87 last_name: Wintraecken orcid: 0000-0002-7472-2220 citation: ama: 'Boissonnat J-D, Wintraecken M. The topological correctness of PL-approximations of isomanifolds. In: 36th International Symposium on Computational Geometry. Vol 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.SoCG.2020.20' apa: 'Boissonnat, J.-D., & Wintraecken, M. (2020). The topological correctness of PL-approximations of isomanifolds. In 36th International Symposium on Computational Geometry (Vol. 164). Zürich, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2020.20' chicago: Boissonnat, Jean-Daniel, and Mathijs Wintraecken. “The Topological Correctness of PL-Approximations of Isomanifolds.” In 36th International Symposium on Computational Geometry, Vol. 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.SoCG.2020.20. ieee: J.-D. Boissonnat and M. Wintraecken, “The topological correctness of PL-approximations of isomanifolds,” in 36th International Symposium on Computational Geometry, Zürich, Switzerland, 2020, vol. 164. ista: 'Boissonnat J-D, Wintraecken M. 2020. The topological correctness of PL-approximations of isomanifolds. 36th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 164, 20:1-20:18.' mla: Boissonnat, Jean-Daniel, and Mathijs Wintraecken. “The Topological Correctness of PL-Approximations of Isomanifolds.” 36th International Symposium on Computational Geometry, vol. 164, 20:1-20:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.SoCG.2020.20. short: J.-D. Boissonnat, M. Wintraecken, in:, 36th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. conference: end_date: 2020-06-26 location: Zürich, Switzerland name: 'SoCG: Symposium on Computational Geometry' start_date: 2020-06-22 date_created: 2020-06-09T07:24:11Z date_published: 2020-06-01T00:00:00Z date_updated: 2023-08-02T06:49:16Z day: '01' ddc: - '510' department: - _id: HeEd doi: 10.4230/LIPIcs.SoCG.2020.20 ec_funded: 1 file: - access_level: open_access checksum: 38cbfa4f5d484d267a35d44d210df044 content_type: application/pdf creator: dernst date_created: 2020-06-17T10:13:34Z date_updated: 2020-07-14T12:48:06Z file_id: '7969' file_name: 2020_LIPIcsSoCG_Boissonnat.pdf file_size: 1009739 relation: main_file file_date_updated: 2020-07-14T12:48:06Z has_accepted_license: '1' intvolume: ' 164' language: - iso: eng month: '06' oa: 1 oa_version: Published Version project: - _id: 260C2330-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '754411' name: ISTplus - Postdoctoral Fellowships publication: 36th International Symposium on Computational Geometry publication_identifier: isbn: - 978-3-95977-143-6 issn: - 1868-8969 publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' related_material: record: - id: '9649' relation: later_version status: public scopus_import: '1' status: public title: The topological correctness of PL-approximations of isomanifolds tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 164 year: '2020' ... --- _id: '7990' abstract: - lang: eng text: 'Given a finite point set P in general position in the plane, a full triangulation is a maximal straight-line embedded plane graph on P. A partial triangulation on P is a full triangulation of some subset P'' of P containing all extreme points in P. A bistellar flip on a partial triangulation either flips an edge, removes a non-extreme point of degree 3, or adds a point in P ⧵ P'' as vertex of degree 3. The bistellar flip graph has all partial triangulations as vertices, and a pair of partial triangulations is adjacent if they can be obtained from one another by a bistellar flip. The goal of this paper is to investigate the structure of this graph, with emphasis on its connectivity. For sets P of n points in general position, we show that the bistellar flip graph is (n-3)-connected, thereby answering, for sets in general position, an open questions raised in a book (by De Loera, Rambau, and Santos) and a survey (by Lee and Santos) on triangulations. This matches the situation for the subfamily of regular triangulations (i.e., partial triangulations obtained by lifting the points and projecting the lower convex hull), where (n-3)-connectivity has been known since the late 1980s through the secondary polytope (Gelfand, Kapranov, Zelevinsky) and Balinski’s Theorem. Our methods also yield the following results (see the full version [Wagner and Welzl, 2020]): (i) The bistellar flip graph can be covered by graphs of polytopes of dimension n-3 (products of secondary polytopes). (ii) A partial triangulation is regular, if it has distance n-3 in the Hasse diagram of the partial order of partial subdivisions from the trivial subdivision. (iii) All partial triangulations are regular iff the trivial subdivision has height n-3 in the partial order of partial subdivisions. (iv) There are arbitrarily large sets P with non-regular partial triangulations, while every proper subset has only regular triangulations, i.e., there are no small certificates for the existence of non-regular partial triangulations (answering a question by F. Santos in the unexpected direction).' alternative_title: - LIPIcs article_number: 67:1 - 67:16 article_processing_charge: No author: - first_name: Uli full_name: Wagner, Uli id: 36690CA2-F248-11E8-B48F-1D18A9856A87 last_name: Wagner orcid: 0000-0002-1494-0568 - first_name: Emo full_name: Welzl, Emo last_name: Welzl citation: ama: 'Wagner U, Welzl E. Connectivity of triangulation flip graphs in the plane (Part II: Bistellar flips). In: 36th International Symposium on Computational Geometry. Vol 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.SoCG.2020.67' apa: 'Wagner, U., & Welzl, E. (2020). Connectivity of triangulation flip graphs in the plane (Part II: Bistellar flips). In 36th International Symposium on Computational Geometry (Vol. 164). Zürich, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2020.67' chicago: 'Wagner, Uli, and Emo Welzl. “Connectivity of Triangulation Flip Graphs in the Plane (Part II: Bistellar Flips).” In 36th International Symposium on Computational Geometry, Vol. 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.SoCG.2020.67.' ieee: 'U. Wagner and E. Welzl, “Connectivity of triangulation flip graphs in the plane (Part II: Bistellar flips),” in 36th International Symposium on Computational Geometry, Zürich, Switzerland, 2020, vol. 164.' ista: 'Wagner U, Welzl E. 2020. Connectivity of triangulation flip graphs in the plane (Part II: Bistellar flips). 36th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 164, 67:1-67:16.' mla: 'Wagner, Uli, and Emo Welzl. “Connectivity of Triangulation Flip Graphs in the Plane (Part II: Bistellar Flips).” 36th International Symposium on Computational Geometry, vol. 164, 67:1-67:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.SoCG.2020.67.' short: U. Wagner, E. Welzl, in:, 36th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. conference: end_date: 2020-06-26 location: Zürich, Switzerland name: 'SoCG: Symposium on Computational Geometry' start_date: 2020-06-22 date_created: 2020-06-22T09:14:19Z date_published: 2020-06-01T00:00:00Z date_updated: 2023-08-04T08:51:07Z day: '01' ddc: - '510' department: - _id: UlWa doi: 10.4230/LIPIcs.SoCG.2020.67 external_id: arxiv: - '2003.13557' file: - access_level: open_access checksum: 3f6925be5f3dcdb3b14cab92f410edf7 content_type: application/pdf creator: dernst date_created: 2020-06-23T06:37:27Z date_updated: 2020-07-14T12:48:06Z file_id: '8003' file_name: 2020_LIPIcsSoCG_Wagner.pdf file_size: 793187 relation: main_file file_date_updated: 2020-07-14T12:48:06Z has_accepted_license: '1' intvolume: ' 164' language: - iso: eng month: '06' oa: 1 oa_version: Published Version publication: 36th International Symposium on Computational Geometry publication_identifier: isbn: - '9783959771436' issn: - '18688969' publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' related_material: record: - id: '12129' relation: later_version status: public scopus_import: 1 status: public title: 'Connectivity of triangulation flip graphs in the plane (Part II: Bistellar flips)' tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 164 year: '2020' ... --- _id: '7807' abstract: - lang: eng text: "In a straight-line embedded triangulation of a point set P in the plane, removing an inner edge and—provided the resulting quadrilateral is convex—adding the other diagonal is called an edge flip. The (edge) flip graph has all triangulations as vertices, and a pair of triangulations is adjacent if they can be obtained from each other by an edge flip. The goal of this paper is to contribute to a better understanding of the flip graph, with an emphasis on its connectivity.\r\nFor sets in general position, it is known that every triangulation allows at least edge flips (a tight bound) which gives the minimum degree of any flip graph for n points. We show that for every point set P in general position, the flip graph is at least -vertex connected. Somewhat more strongly, we show that the vertex connectivity equals the minimum degree occurring in the flip graph, i.e. the minimum number of flippable edges in any triangulation of P, provided P is large enough. Finally, we exhibit some of the geometry of the flip graph by showing that the flip graph can be covered by 1-skeletons of polytopes of dimension (products of associahedra).\r\nA corresponding result ((n – 3)-vertex connectedness) can be shown for the bistellar flip graph of partial triangulations, i.e. the set of all triangulations of subsets of P which contain all extreme points of P. This will be treated separately in a second part." article_processing_charge: No author: - first_name: Uli full_name: Wagner, Uli id: 36690CA2-F248-11E8-B48F-1D18A9856A87 last_name: Wagner orcid: 0000-0002-1494-0568 - first_name: Emo full_name: Welzl, Emo last_name: Welzl citation: ama: 'Wagner U, Welzl E. Connectivity of triangulation flip graphs in the plane (Part I: Edge flips). In: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. Vol 2020-January. SIAM; 2020:2823-2841. doi:10.1137/1.9781611975994.172' apa: 'Wagner, U., & Welzl, E. (2020). Connectivity of triangulation flip graphs in the plane (Part I: Edge flips). In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (Vol. 2020–January, pp. 2823–2841). Salt Lake City, UT, United States: SIAM. https://doi.org/10.1137/1.9781611975994.172' chicago: 'Wagner, Uli, and Emo Welzl. “Connectivity of Triangulation Flip Graphs in the Plane (Part I: Edge Flips).” In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 2020–January:2823–41. SIAM, 2020. https://doi.org/10.1137/1.9781611975994.172.' ieee: 'U. Wagner and E. Welzl, “Connectivity of triangulation flip graphs in the plane (Part I: Edge flips),” in Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, Salt Lake City, UT, United States, 2020, vol. 2020–January, pp. 2823–2841.' ista: 'Wagner U, Welzl E. 2020. Connectivity of triangulation flip graphs in the plane (Part I: Edge flips). Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms vol. 2020–January, 2823–2841.' mla: 'Wagner, Uli, and Emo Welzl. “Connectivity of Triangulation Flip Graphs in the Plane (Part I: Edge Flips).” Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, vol. 2020–January, SIAM, 2020, pp. 2823–41, doi:10.1137/1.9781611975994.172.' short: U. Wagner, E. Welzl, in:, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2020, pp. 2823–2841. conference: end_date: 2020-01-08 location: Salt Lake City, UT, United States name: 'SODA: Symposium on Discrete Algorithms' start_date: 2020-01-05 date_created: 2020-05-10T22:00:48Z date_published: 2020-01-01T00:00:00Z date_updated: 2023-08-04T08:51:07Z day: '01' department: - _id: UlWa doi: 10.1137/1.9781611975994.172 external_id: arxiv: - '2003.13557' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1137/1.9781611975994.172 month: '01' oa: 1 oa_version: Submitted Version page: 2823-2841 publication: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms publication_identifier: isbn: - '9781611975994' publication_status: published publisher: SIAM quality_controlled: '1' related_material: record: - id: '12129' relation: later_version status: public scopus_import: 1 status: public title: 'Connectivity of triangulation flip graphs in the plane (Part I: Edge flips)' type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 2020-January year: '2020' ... --- _id: '13073' abstract: - lang: eng text: The Mytilus complex of marine mussel species forms a mosaic of hybrid zones, found across temperate regions of the globe. This allows us to study "replicated" instances of secondary contact between closely-related species. Previous work on this complex has shown that local introgression is both widespread and highly heterogeneous, and has identified SNPs that are outliers of differentiation between lineages. Here, we developed an ancestry-informative panel of such SNPs. We then compared their frequencies in newly-sampled populations, including samples from within the hybrid zones, and parental populations at different distances from the contact. Results show that close to the hybrid zones, some outlier loci are near to fixation for the heterospecific allele, suggesting enhanced local introgression, or the local sweep of a shared ancestral allele. Conversely, genomic cline analyses, treating local parental populations as the reference, reveal a globally high concordance among loci, albeit with a few signals of asymmetric introgression. Enhanced local introgression at specific loci is consistent with the early transfer of adaptive variants after contact, possibly including asymmetric bi-stable variants (Dobzhansky-Muller incompatibilities), or haplotypes loaded with fewer deleterious mutations. Having escaped one barrier, however, these variants can be trapped or delayed at the next barrier, confining the introgression locally. These results shed light on the decay of species barriers during phases of contact. article_processing_charge: No author: - first_name: Alexis full_name: Simon, Alexis last_name: Simon - first_name: Christelle full_name: Fraisse, Christelle id: 32DF5794-F248-11E8-B48F-1D18A9856A87 last_name: Fraisse orcid: 0000-0001-8441-5075 - first_name: Tahani full_name: El Ayari, Tahani last_name: El Ayari - first_name: Cathy full_name: Liautard-Haag, Cathy last_name: Liautard-Haag - first_name: Petr full_name: Strelkov, Petr last_name: Strelkov - first_name: John full_name: Welch, John last_name: Welch - first_name: Nicolas full_name: Bierne, Nicolas last_name: Bierne citation: ama: Simon A, Fraisse C, El Ayari T, et al. How do species barriers decay? concordance and local introgression in mosaic hybrid zones of mussels. 2020. doi:10.5061/DRYAD.R4XGXD29N apa: Simon, A., Fraisse, C., El Ayari, T., Liautard-Haag, C., Strelkov, P., Welch, J., & Bierne, N. (2020). How do species barriers decay? concordance and local introgression in mosaic hybrid zones of mussels. Dryad. https://doi.org/10.5061/DRYAD.R4XGXD29N chicago: Simon, Alexis, Christelle Fraisse, Tahani El Ayari, Cathy Liautard-Haag, Petr Strelkov, John Welch, and Nicolas Bierne. “How Do Species Barriers Decay? Concordance and Local Introgression in Mosaic Hybrid Zones of Mussels.” Dryad, 2020. https://doi.org/10.5061/DRYAD.R4XGXD29N. ieee: A. Simon et al., “How do species barriers decay? concordance and local introgression in mosaic hybrid zones of mussels.” Dryad, 2020. ista: Simon A, Fraisse C, El Ayari T, Liautard-Haag C, Strelkov P, Welch J, Bierne N. 2020. How do species barriers decay? concordance and local introgression in mosaic hybrid zones of mussels, Dryad, 10.5061/DRYAD.R4XGXD29N. mla: Simon, Alexis, et al. How Do Species Barriers Decay? Concordance and Local Introgression in Mosaic Hybrid Zones of Mussels. Dryad, 2020, doi:10.5061/DRYAD.R4XGXD29N. short: A. Simon, C. Fraisse, T. El Ayari, C. Liautard-Haag, P. Strelkov, J. Welch, N. Bierne, (2020). date_created: 2023-05-23T16:48:27Z date_published: 2020-09-22T00:00:00Z date_updated: 2023-08-04T11:04:11Z day: '22' ddc: - '570' department: - _id: NiBa doi: 10.5061/DRYAD.R4XGXD29N license: https://creativecommons.org/publicdomain/zero/1.0/ main_file_link: - open_access: '1' url: https://doi.org/10.5061/dryad.r4xgxd29n month: '09' oa: 1 oa_version: Published Version publisher: Dryad related_material: record: - id: '8708' relation: used_in_publication status: public status: public title: How do species barriers decay? concordance and local introgression in mosaic hybrid zones of mussels tmp: 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) short: CC0 (1.0) type: research_data_reference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2020' ... --- _id: '13065' abstract: - lang: eng text: Domestication is a human-induced selection process that imprints the genomes of domesticated populations over a short evolutionary time scale, and that occurs in a given demographic context. Reconstructing historical gene flow, effective population size changes and their timing is therefore of fundamental interest to understand how plant demography and human selection jointly shape genomic divergence during domestication. Yet, the comparison under a single statistical framework of independent domestication histories across different crop species has been little evaluated so far. Thus, it is unclear whether domestication leads to convergent demographic changes that similarly affect crop genomes. To address this question, we used existing and new transcriptome data on three crop species of Solanaceae (eggplant, pepper and tomato), together with their close wild relatives. We fitted twelve demographic models of increasing complexity on the unfolded joint allele frequency spectrum for each wild/crop pair, and we found evidence for both shared and species-specific demographic processes between species. A convergent history of domestication with gene-flow was inferred for all three species, along with evidence of strong reduction in the effective population size during the cultivation stage of tomato and pepper. The absence of any reduction in size of the crop in eggplant stands out from the classical view of the domestication process; as does the existence of a “protracted period” of management before cultivation. Our results also suggest divergent management strategies of modern cultivars among species as their current demography substantially differs. Finally, the timing of domestication is species-specific and supported by the few historical records available. article_processing_charge: No author: - first_name: Stephanie full_name: Arnoux, Stephanie last_name: Arnoux - first_name: Christelle full_name: Fraisse, Christelle id: 32DF5794-F248-11E8-B48F-1D18A9856A87 last_name: Fraisse orcid: 0000-0001-8441-5075 - first_name: Christopher full_name: Sauvage, Christopher last_name: Sauvage citation: ama: 'Arnoux S, Fraisse C, Sauvage C. VCF files of synonymous SNPs related to: Genomic inference of complex domestication histories in three Solanaceae species. 2020. doi:10.5061/DRYAD.Q2BVQ83HD' apa: 'Arnoux, S., Fraisse, C., & Sauvage, C. (2020). VCF files of synonymous SNPs related to: Genomic inference of complex domestication histories in three Solanaceae species. Dryad. https://doi.org/10.5061/DRYAD.Q2BVQ83HD' chicago: 'Arnoux, Stephanie, Christelle Fraisse, and Christopher Sauvage. “VCF Files of Synonymous SNPs Related to: Genomic Inference of Complex Domestication Histories in Three Solanaceae Species.” Dryad, 2020. https://doi.org/10.5061/DRYAD.Q2BVQ83HD.' ieee: 'S. Arnoux, C. Fraisse, and C. Sauvage, “VCF files of synonymous SNPs related to: Genomic inference of complex domestication histories in three Solanaceae species.” Dryad, 2020.' ista: 'Arnoux S, Fraisse C, Sauvage C. 2020. VCF files of synonymous SNPs related to: Genomic inference of complex domestication histories in three Solanaceae species, Dryad, 10.5061/DRYAD.Q2BVQ83HD.' mla: 'Arnoux, Stephanie, et al. VCF Files of Synonymous SNPs Related to: Genomic Inference of Complex Domestication Histories in Three Solanaceae Species. Dryad, 2020, doi:10.5061/DRYAD.Q2BVQ83HD.' short: S. Arnoux, C. Fraisse, C. Sauvage, (2020). date_created: 2023-05-23T16:30:20Z date_published: 2020-10-19T00:00:00Z date_updated: 2023-08-04T11:19:26Z day: '19' ddc: - '570' department: - _id: NiBa doi: 10.5061/DRYAD.Q2BVQ83HD main_file_link: - open_access: '1' url: https://doi.org/10.5061/dryad.q2bvq83hd month: '10' oa: 1 oa_version: Published Version publisher: Dryad related_material: link: - relation: software url: https://github.com/starnoux/arnoux_et_al_2019 record: - id: '8928' relation: used_in_publication status: public status: public title: 'VCF files of synonymous SNPs related to: Genomic inference of complex domestication histories in three Solanaceae species' tmp: 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) short: CC0 (1.0) type: research_data_reference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2020' ... --- _id: '8536' abstract: - lang: eng text: This work analyzes the latency of the simplified successive cancellation (SSC) decoding scheme for polar codes proposed by Alamdar-Yazdi and Kschischang. It is shown that, unlike conventional successive cancellation decoding, where latency is linear in the block length, the latency of SSC decoding is sublinear. More specifically, the latency of SSC decoding is O(N 1−1/µ ), where N is the block length and µ is the scaling exponent of the channel, which captures the speed of convergence of the rate to capacity. Numerical results demonstrate the tightness of the bound and show that most of the latency reduction arises from the parallel decoding of subcodes of rate 0 and 1. acknowledgement: M. Mondelli was partially supported by grants NSF DMS-1613091, CCF-1714305, IIS-1741162 and ONR N00014-18-1-2729. S. A. Hashemi is supported by a Postdoctoral Fellowship from the Natural Sciences and Engineering Research Council of Canada (NSERC) and by Huawei. article_number: 401-406 article_processing_charge: No author: - first_name: Marco full_name: Mondelli, Marco id: 27EB676C-8706-11E9-9510-7717E6697425 last_name: Mondelli orcid: 0000-0002-3242-7020 - first_name: Seyyed Ali full_name: Hashemi, Seyyed Ali last_name: Hashemi - first_name: John full_name: Cioffi, John last_name: Cioffi - first_name: Andrea full_name: Goldsmith, Andrea last_name: Goldsmith citation: ama: 'Mondelli M, Hashemi SA, Cioffi J, Goldsmith A. Simplified successive cancellation decoding of polar codes has sublinear latency. In: IEEE International Symposium on Information Theory - Proceedings. Vol 2020-June. IEEE; 2020. doi:10.1109/ISIT44484.2020.9174141' apa: 'Mondelli, M., Hashemi, S. A., Cioffi, J., & Goldsmith, A. (2020). Simplified successive cancellation decoding of polar codes has sublinear latency. In IEEE International Symposium on Information Theory - Proceedings (Vol. 2020–June). Los Angeles, CA, United States: IEEE. https://doi.org/10.1109/ISIT44484.2020.9174141' chicago: Mondelli, Marco, Seyyed Ali Hashemi, John Cioffi, and Andrea Goldsmith. “Simplified Successive Cancellation Decoding of Polar Codes Has Sublinear Latency.” In IEEE International Symposium on Information Theory - Proceedings, Vol. 2020–June. IEEE, 2020. https://doi.org/10.1109/ISIT44484.2020.9174141. ieee: M. Mondelli, S. A. Hashemi, J. Cioffi, and A. Goldsmith, “Simplified successive cancellation decoding of polar codes has sublinear latency,” in IEEE International Symposium on Information Theory - Proceedings, Los Angeles, CA, United States, 2020, vol. 2020–June. ista: 'Mondelli M, Hashemi SA, Cioffi J, Goldsmith A. 2020. Simplified successive cancellation decoding of polar codes has sublinear latency. IEEE International Symposium on Information Theory - Proceedings. ISIT: Internation Symposium on Information Theory vol. 2020–June, 401–406.' mla: Mondelli, Marco, et al. “Simplified Successive Cancellation Decoding of Polar Codes Has Sublinear Latency.” IEEE International Symposium on Information Theory - Proceedings, vol. 2020–June, 401–406, IEEE, 2020, doi:10.1109/ISIT44484.2020.9174141. short: M. Mondelli, S.A. Hashemi, J. Cioffi, A. Goldsmith, in:, IEEE International Symposium on Information Theory - Proceedings, IEEE, 2020. conference: end_date: 2020-06-26 location: Los Angeles, CA, United States name: 'ISIT: Internation Symposium on Information Theory' start_date: 2020-06-21 date_created: 2020-09-20T22:01:37Z date_published: 2020-06-01T00:00:00Z date_updated: 2023-08-07T13:36:24Z day: '01' department: - _id: MaMo doi: 10.1109/ISIT44484.2020.9174141 external_id: arxiv: - '1909.04892' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1909.04892 month: '06' oa: 1 oa_version: Preprint publication: IEEE International Symposium on Information Theory - Proceedings publication_identifier: isbn: - '9781728164328' issn: - '21578095' publication_status: published publisher: IEEE quality_controlled: '1' related_material: record: - id: '9047' relation: later_version status: public scopus_import: '1' status: public title: Simplified successive cancellation decoding of polar codes has sublinear latency type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 2020-June year: '2020' ... --- _id: '9308' acknowledgement: This research was carried out with the support of the Russian Foundation for Basic Research(grant no. 19-01-00169) article_processing_charge: No article_type: original author: - first_name: Sergey full_name: Avvakumov, Sergey id: 3827DAC8-F248-11E8-B48F-1D18A9856A87 last_name: Avvakumov - first_name: Uli full_name: Wagner, Uli id: 36690CA2-F248-11E8-B48F-1D18A9856A87 last_name: Wagner orcid: 0000-0002-1494-0568 - first_name: Isaac full_name: Mabillard, Isaac id: 32BF9DAA-F248-11E8-B48F-1D18A9856A87 last_name: Mabillard - first_name: A. B. full_name: Skopenkov, A. B. last_name: Skopenkov citation: ama: Avvakumov S, Wagner U, Mabillard I, Skopenkov AB. Eliminating higher-multiplicity intersections, III. Codimension 2. Russian Mathematical Surveys. 2020;75(6):1156-1158. doi:10.1070/RM9943 apa: Avvakumov, S., Wagner, U., Mabillard, I., & Skopenkov, A. B. (2020). Eliminating higher-multiplicity intersections, III. Codimension 2. Russian Mathematical Surveys. IOP Publishing. https://doi.org/10.1070/RM9943 chicago: Avvakumov, Sergey, Uli Wagner, Isaac Mabillard, and A. B. Skopenkov. “Eliminating Higher-Multiplicity Intersections, III. Codimension 2.” Russian Mathematical Surveys. IOP Publishing, 2020. https://doi.org/10.1070/RM9943. ieee: S. Avvakumov, U. Wagner, I. Mabillard, and A. B. Skopenkov, “Eliminating higher-multiplicity intersections, III. Codimension 2,” Russian Mathematical Surveys, vol. 75, no. 6. IOP Publishing, pp. 1156–1158, 2020. ista: Avvakumov S, Wagner U, Mabillard I, Skopenkov AB. 2020. Eliminating higher-multiplicity intersections, III. Codimension 2. Russian Mathematical Surveys. 75(6), 1156–1158. mla: Avvakumov, Sergey, et al. “Eliminating Higher-Multiplicity Intersections, III. Codimension 2.” Russian Mathematical Surveys, vol. 75, no. 6, IOP Publishing, 2020, pp. 1156–58, doi:10.1070/RM9943. short: S. Avvakumov, U. Wagner, I. Mabillard, A.B. Skopenkov, Russian Mathematical Surveys 75 (2020) 1156–1158. date_created: 2021-04-04T22:01:22Z date_published: 2020-12-01T00:00:00Z date_updated: 2023-08-14T11:43:54Z day: '01' department: - _id: UlWa doi: 10.1070/RM9943 external_id: arxiv: - '1511.03501' isi: - '000625983100001' intvolume: ' 75' isi: 1 issue: '6' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1511.03501 month: '12' oa: 1 oa_version: Preprint page: 1156-1158 publication: Russian Mathematical Surveys publication_identifier: issn: - 0036-0279 publication_status: published publisher: IOP Publishing quality_controlled: '1' related_material: record: - id: '8183' relation: earlier_version status: public - id: '10220' relation: later_version status: public scopus_import: '1' status: public title: Eliminating higher-multiplicity intersections, III. Codimension 2 type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 75 year: '2020' ... --- _id: '6358' abstract: - lang: eng text: We study dynamical optimal transport metrics between density matricesassociated to symmetric Dirichlet forms on finite-dimensional C∗-algebras. Our settingcovers arbitrary skew-derivations and it provides a unified framework that simultaneously generalizes recently constructed transport metrics for Markov chains, Lindblad equations, and the Fermi Ornstein–Uhlenbeck semigroup. We develop a non-nommutative differential calculus that allows us to obtain non-commutative Ricci curvature bounds, logarithmic Sobolev inequalities, transport-entropy inequalities, andspectral gap estimates. article_processing_charge: Yes (via OA deal) article_type: original author: - first_name: Eric A. full_name: Carlen, Eric A. last_name: Carlen - first_name: Jan full_name: Maas, Jan id: 4C5696CE-F248-11E8-B48F-1D18A9856A87 last_name: Maas orcid: 0000-0002-0845-1338 citation: ama: Carlen EA, Maas J. Non-commutative calculus, optimal transport and functional inequalities  in dissipative quantum systems. Journal of Statistical Physics. 2020;178(2):319-378. doi:10.1007/s10955-019-02434-w apa: Carlen, E. A., & Maas, J. (2020). Non-commutative calculus, optimal transport and functional inequalities  in dissipative quantum systems. Journal of Statistical Physics. Springer Nature. https://doi.org/10.1007/s10955-019-02434-w chicago: Carlen, Eric A., and Jan Maas. “Non-Commutative Calculus, Optimal Transport and Functional Inequalities  in Dissipative Quantum Systems.” Journal of Statistical Physics. Springer Nature, 2020. https://doi.org/10.1007/s10955-019-02434-w. ieee: E. A. Carlen and J. Maas, “Non-commutative calculus, optimal transport and functional inequalities  in dissipative quantum systems,” Journal of Statistical Physics, vol. 178, no. 2. Springer Nature, pp. 319–378, 2020. ista: Carlen EA, Maas J. 2020. Non-commutative calculus, optimal transport and functional inequalities  in dissipative quantum systems. Journal of Statistical Physics. 178(2), 319–378. mla: Carlen, Eric A., and Jan Maas. “Non-Commutative Calculus, Optimal Transport and Functional Inequalities  in Dissipative Quantum Systems.” Journal of Statistical Physics, vol. 178, no. 2, Springer Nature, 2020, pp. 319–78, doi:10.1007/s10955-019-02434-w. short: E.A. Carlen, J. Maas, Journal of Statistical Physics 178 (2020) 319–378. date_created: 2019-04-30T07:34:18Z date_published: 2020-01-01T00:00:00Z date_updated: 2023-08-17T13:49:40Z day: '01' ddc: - '500' department: - _id: JaMa doi: 10.1007/s10955-019-02434-w ec_funded: 1 external_id: arxiv: - '1811.04572' isi: - '000498933300001' file: - access_level: open_access checksum: 7b04befbdc0d4982c0ee945d25d19872 content_type: application/pdf creator: dernst date_created: 2019-12-23T12:03:09Z date_updated: 2020-07-14T12:47:28Z file_id: '7209' file_name: 2019_JourStatistPhysics_Carlen.pdf file_size: 905538 relation: main_file file_date_updated: 2020-07-14T12:47:28Z has_accepted_license: '1' intvolume: ' 178' isi: 1 issue: '2' language: - iso: eng month: '01' oa: 1 oa_version: Published Version page: 319-378 project: - _id: B67AFEDC-15C9-11EA-A837-991A96BB2854 name: IST Austria Open Access Fund - _id: 256E75B8-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '716117' name: Optimal Transport and Stochastic Dynamics - _id: 260482E2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: ' F06504' name: Taming Complexity in Partial Di erential Systems publication: Journal of Statistical Physics publication_identifier: eissn: - '15729613' issn: - '00224715' publication_status: published publisher: Springer Nature quality_controlled: '1' related_material: link: - relation: erratum url: https://doi.org/10.1007/s10955-020-02671-4 scopus_import: '1' status: public title: Non-commutative calculus, optimal transport and functional inequalities in dissipative quantum systems tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 178 year: '2020' ... --- _id: '74' abstract: - lang: eng text: "We study the Gromov waist in the sense of t-neighborhoods for measures in the Euclidean space, motivated by the famous theorem of Gromov about \ the waist of radially symmetric Gaussian measures. In particular, it turns our possible to extend Gromov’s original result to the case of not necessarily \ radially symmetric Gaussian measure. We also provide examples of measures having no t-neighborhood waist property, including a rather wide class\r\nof compactly supported radially symmetric measures and their maps into the Euclidean space of dimension at least 2.\r\nWe use a simpler form of Gromov’s pancake argument \ to produce some estimates of t-neighborhoods of (weighted) volume-critical submanifolds in the spirit of the waist theorems, including neighborhoods of algebraic manifolds in the complex projective space. In the appendix of this paper we provide for reader’s convenience a more detailed explanation of the Caffarelli theorem that we use to handle not necessarily radially symmetric Gaussian\r\nmeasures." article_processing_charge: No author: - first_name: Arseniy full_name: Akopyan, Arseniy id: 430D2C90-F248-11E8-B48F-1D18A9856A87 last_name: Akopyan orcid: 0000-0002-2548-617X - first_name: Roman full_name: Karasev, Roman last_name: Karasev citation: ama: 'Akopyan A, Karasev R. Gromov’s waist of non-radial Gaussian measures and radial non-Gaussian measures. In: Klartag B, Milman E, eds. Geometric Aspects of Functional Analysis. Vol 2256. LNM. Springer Nature; 2020:1-27. doi:10.1007/978-3-030-36020-7_1' apa: Akopyan, A., & Karasev, R. (2020). Gromov’s waist of non-radial Gaussian measures and radial non-Gaussian measures. In B. Klartag & E. Milman (Eds.), Geometric Aspects of Functional Analysis (Vol. 2256, pp. 1–27). Springer Nature. https://doi.org/10.1007/978-3-030-36020-7_1 chicago: Akopyan, Arseniy, and Roman Karasev. “Gromov’s Waist of Non-Radial Gaussian Measures and Radial Non-Gaussian Measures.” In Geometric Aspects of Functional Analysis, edited by Bo’az Klartag and Emanuel Milman, 2256:1–27. LNM. Springer Nature, 2020. https://doi.org/10.1007/978-3-030-36020-7_1. ieee: A. Akopyan and R. Karasev, “Gromov’s waist of non-radial Gaussian measures and radial non-Gaussian measures,” in Geometric Aspects of Functional Analysis, vol. 2256, B. Klartag and E. Milman, Eds. Springer Nature, 2020, pp. 1–27. ista: 'Akopyan A, Karasev R. 2020.Gromov’s waist of non-radial Gaussian measures and radial non-Gaussian measures. In: Geometric Aspects of Functional Analysis. vol. 2256, 1–27.' mla: Akopyan, Arseniy, and Roman Karasev. “Gromov’s Waist of Non-Radial Gaussian Measures and Radial Non-Gaussian Measures.” Geometric Aspects of Functional Analysis, edited by Bo’az Klartag and Emanuel Milman, vol. 2256, Springer Nature, 2020, pp. 1–27, doi:10.1007/978-3-030-36020-7_1. short: A. Akopyan, R. Karasev, in:, B. Klartag, E. Milman (Eds.), Geometric Aspects of Functional Analysis, Springer Nature, 2020, pp. 1–27. date_created: 2018-12-11T11:44:29Z date_published: 2020-06-21T00:00:00Z date_updated: 2023-08-17T13:48:31Z day: '21' department: - _id: HeEd - _id: JaMa doi: 10.1007/978-3-030-36020-7_1 ec_funded: 1 editor: - first_name: Bo'az full_name: Klartag, Bo'az last_name: Klartag - first_name: Emanuel full_name: Milman, Emanuel last_name: Milman external_id: arxiv: - '1808.07350' isi: - '000557689300003' intvolume: ' 2256' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1808.07350 month: '06' oa: 1 oa_version: Preprint page: 1-27 project: - _id: 256E75B8-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '716117' name: Optimal Transport and Stochastic Dynamics publication: Geometric Aspects of Functional Analysis publication_identifier: eisbn: - '9783030360207' eissn: - '16179692' isbn: - '9783030360191' issn: - '00758434' publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' series_title: LNM status: public title: Gromov's waist of non-radial Gaussian measures and radial non-Gaussian measures type: book_chapter user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 2256 year: '2020' ... --- _id: '177' abstract: - lang: eng text: We develop a geometric version of the circle method and use it to compute the compactly supported cohomology of the space of rational curves through a point on a smooth affine hypersurface of sufficiently low degree. article_processing_charge: No article_type: original author: - first_name: Timothy D full_name: Browning, Timothy D id: 35827D50-F248-11E8-B48F-1D18A9856A87 last_name: Browning orcid: 0000-0002-8314-0177 - first_name: Will full_name: Sawin, Will last_name: Sawin citation: ama: Browning TD, Sawin W. A geometric version of the circle method. Annals of Mathematics. 2020;191(3):893-948. doi:10.4007/annals.2020.191.3.4 apa: Browning, T. D., & Sawin, W. (2020). A geometric version of the circle method. Annals of Mathematics. Princeton University. https://doi.org/10.4007/annals.2020.191.3.4 chicago: Browning, Timothy D, and Will Sawin. “A Geometric Version of the Circle Method.” Annals of Mathematics. Princeton University, 2020. https://doi.org/10.4007/annals.2020.191.3.4. ieee: T. D. Browning and W. Sawin, “A geometric version of the circle method,” Annals of Mathematics, vol. 191, no. 3. Princeton University, pp. 893–948, 2020. ista: Browning TD, Sawin W. 2020. A geometric version of the circle method. Annals of Mathematics. 191(3), 893–948. mla: Browning, Timothy D., and Will Sawin. “A Geometric Version of the Circle Method.” Annals of Mathematics, vol. 191, no. 3, Princeton University, 2020, pp. 893–948, doi:10.4007/annals.2020.191.3.4. short: T.D. Browning, W. Sawin, Annals of Mathematics 191 (2020) 893–948. date_created: 2018-12-11T11:45:02Z date_published: 2020-05-01T00:00:00Z date_updated: 2023-08-17T07:12:37Z day: '01' department: - _id: TiBr doi: 10.4007/annals.2020.191.3.4 external_id: arxiv: - '1711.10451' isi: - '000526986300004' intvolume: ' 191' isi: 1 issue: '3' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1711.10451 month: '05' oa: 1 oa_version: Preprint page: 893-948 publication: Annals of Mathematics publication_status: published publisher: Princeton University publist_id: '7744' quality_controlled: '1' status: public title: A geometric version of the circle method type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 191 year: '2020' ... --- _id: '6649' abstract: - lang: eng text: "While Hartree–Fock theory is well established as a fundamental approximation for interacting fermions, it has been unclear how to describe corrections to it due to many-body correlations. In this paper we start from the Hartree–Fock state given by plane waves and introduce collective particle–hole pair excitations. These pairs can be approximately described by a bosonic quadratic Hamiltonian. We use Bogoliubov theory to construct a trial state yielding a rigorous Gell-Mann–Brueckner–type upper bound to the ground state energy. Our result justifies the random-phase approximation in the mean-field scaling regime, for repulsive, regular interaction potentials.\r\n" article_processing_charge: No article_type: original author: - first_name: Niels P full_name: Benedikter, Niels P id: 3DE6C32A-F248-11E8-B48F-1D18A9856A87 last_name: Benedikter orcid: 0000-0002-1071-6091 - first_name: Phan Thành full_name: Nam, Phan Thành last_name: Nam - first_name: Marcello full_name: Porta, Marcello last_name: Porta - first_name: Benjamin full_name: Schlein, Benjamin last_name: Schlein - first_name: Robert full_name: Seiringer, Robert id: 4AFD0470-F248-11E8-B48F-1D18A9856A87 last_name: Seiringer orcid: 0000-0002-6781-0521 citation: ama: Benedikter NP, Nam PT, Porta M, Schlein B, Seiringer R. Optimal upper bound for the correlation energy of a Fermi gas in the mean-field regime. Communications in Mathematical Physics. 2020;374:2097–2150. doi:10.1007/s00220-019-03505-5 apa: Benedikter, N. P., Nam, P. T., Porta, M., Schlein, B., & Seiringer, R. (2020). Optimal upper bound for the correlation energy of a Fermi gas in the mean-field regime. Communications in Mathematical Physics. Springer Nature. https://doi.org/10.1007/s00220-019-03505-5 chicago: Benedikter, Niels P, Phan Thành Nam, Marcello Porta, Benjamin Schlein, and Robert Seiringer. “Optimal Upper Bound for the Correlation Energy of a Fermi Gas in the Mean-Field Regime.” Communications in Mathematical Physics. Springer Nature, 2020. https://doi.org/10.1007/s00220-019-03505-5. ieee: N. P. Benedikter, P. T. Nam, M. Porta, B. Schlein, and R. Seiringer, “Optimal upper bound for the correlation energy of a Fermi gas in the mean-field regime,” Communications in Mathematical Physics, vol. 374. Springer Nature, pp. 2097–2150, 2020. ista: Benedikter NP, Nam PT, Porta M, Schlein B, Seiringer R. 2020. Optimal upper bound for the correlation energy of a Fermi gas in the mean-field regime. Communications in Mathematical Physics. 374, 2097–2150. mla: Benedikter, Niels P., et al. “Optimal Upper Bound for the Correlation Energy of a Fermi Gas in the Mean-Field Regime.” Communications in Mathematical Physics, vol. 374, Springer Nature, 2020, pp. 2097–2150, doi:10.1007/s00220-019-03505-5. short: N.P. Benedikter, P.T. Nam, M. Porta, B. Schlein, R. Seiringer, Communications in Mathematical Physics 374 (2020) 2097–2150. date_created: 2019-07-18T13:30:04Z date_published: 2020-03-01T00:00:00Z date_updated: 2023-08-17T13:51:50Z day: '01' ddc: - '530' department: - _id: RoSe doi: 10.1007/s00220-019-03505-5 ec_funded: 1 external_id: arxiv: - '1809.01902' isi: - '000527910700019' file: - access_level: open_access checksum: f9dd6dd615a698f1d3636c4a092fed23 content_type: application/pdf creator: dernst date_created: 2019-07-24T07:19:10Z date_updated: 2020-07-14T12:47:35Z file_id: '6668' file_name: 2019_CommMathPhysics_Benedikter.pdf file_size: 853289 relation: main_file file_date_updated: 2020-07-14T12:47:35Z has_accepted_license: '1' intvolume: ' 374' isi: 1 language: - iso: eng month: '03' oa: 1 oa_version: Published Version page: 2097–2150 project: - _id: 3AC91DDA-15DF-11EA-824D-93A3E7B544D1 call_identifier: FWF name: FWF Open Access Fund - _id: 25C878CE-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P27533_N27 name: Structure of the Excitation Spectrum for Many-Body Quantum Systems - _id: 25C6DC12-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '694227' name: Analysis of quantum many-body systems publication: Communications in Mathematical Physics publication_identifier: eissn: - 1432-0916 issn: - 0010-3616 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: Optimal upper bound for the correlation energy of a Fermi gas in the mean-field regime tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 374 year: '2020' ... --- _id: '6796' abstract: - lang: eng text: Nearby grid cells have been observed to express a remarkable degree of long-rangeorder, which is often idealized as extending potentially to infinity. Yet their strict peri-odic firing and ensemble coherence are theoretically possible only in flat environments, much unlike the burrows which rodents usually live in. Are the symmetrical, coherent grid maps inferred in the lab relevant to chart their way in their natural habitat? We consider spheres as simple models of curved environments and waiting for the appropriate experiments to be performed, we use our adaptation model to predict what grid maps would emerge in a network with the same type of recurrent connections, which on the plane produce coherence among the units. We find that on the sphere such connections distort the maps that single grid units would express on their own, and aggregate them into clusters. When remapping to a different spherical environment, units in each cluster maintain only partial coherence, similar to what is observed in disordered materials, such as spin glasses. article_processing_charge: No article_type: original author: - first_name: Federico full_name: Stella, Federico id: 39AF1E74-F248-11E8-B48F-1D18A9856A87 last_name: Stella orcid: 0000-0001-9439-3148 - first_name: Eugenio full_name: Urdapilleta, Eugenio last_name: Urdapilleta - first_name: Yifan full_name: Luo, Yifan last_name: Luo - first_name: Alessandro full_name: Treves, Alessandro last_name: Treves citation: ama: Stella F, Urdapilleta E, Luo Y, Treves A. Partial coherence and frustration in self-organizing spherical grids. Hippocampus. 2020;30(4):302-313. doi:10.1002/hipo.23144 apa: Stella, F., Urdapilleta, E., Luo, Y., & Treves, A. (2020). Partial coherence and frustration in self-organizing spherical grids. Hippocampus. Wiley. https://doi.org/10.1002/hipo.23144 chicago: Stella, Federico, Eugenio Urdapilleta, Yifan Luo, and Alessandro Treves. “Partial Coherence and Frustration in Self-Organizing Spherical Grids.” Hippocampus. Wiley, 2020. https://doi.org/10.1002/hipo.23144. ieee: F. Stella, E. Urdapilleta, Y. Luo, and A. Treves, “Partial coherence and frustration in self-organizing spherical grids,” Hippocampus, vol. 30, no. 4. Wiley, pp. 302–313, 2020. ista: Stella F, Urdapilleta E, Luo Y, Treves A. 2020. Partial coherence and frustration in self-organizing spherical grids. Hippocampus. 30(4), 302–313. mla: Stella, Federico, et al. “Partial Coherence and Frustration in Self-Organizing Spherical Grids.” Hippocampus, vol. 30, no. 4, Wiley, 2020, pp. 302–13, doi:10.1002/hipo.23144. short: F. Stella, E. Urdapilleta, Y. Luo, A. Treves, Hippocampus 30 (2020) 302–313. date_created: 2019-08-11T21:59:24Z date_published: 2020-04-01T00:00:00Z date_updated: 2023-08-17T13:53:14Z day: '01' ddc: - '570' department: - _id: JoCs doi: 10.1002/hipo.23144 external_id: isi: - '000477299600001' pmid: - '31339190' file: - access_level: open_access checksum: 7b54d22bfbfc0d1188a9ea24d985bfb2 content_type: application/pdf creator: dernst date_created: 2019-08-12T07:53:33Z date_updated: 2020-07-14T12:47:40Z file_id: '6800' file_name: 2019_Hippocampus_Stella.pdf file_size: 2370658 relation: main_file file_date_updated: 2020-07-14T12:47:40Z has_accepted_license: '1' intvolume: ' 30' isi: 1 issue: '4' language: - iso: eng month: '04' oa: 1 oa_version: Published Version page: 302-313 pmid: 1 publication: Hippocampus publication_identifier: eissn: - '10981063' issn: - '10509631' publication_status: published publisher: Wiley quality_controlled: '1' scopus_import: '1' status: public title: Partial coherence and frustration in self-organizing spherical grids tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 30 year: '2020' ... --- _id: '6761' abstract: - lang: eng text: In resource allocation games, selfish players share resources that are needed in order to fulfill their objectives. The cost of using a resource depends on the load on it. In the traditional setting, the players make their choices concurrently and in one-shot. That is, a strategy for a player is a subset of the resources. We introduce and study dynamic resource allocation games. In this setting, the game proceeds in phases. In each phase each player chooses one resource. A scheduler dictates the order in which the players proceed in a phase, possibly scheduling several players to proceed concurrently. The game ends when each player has collected a set of resources that fulfills his objective. The cost for each player then depends on this set as well as on the load on the resources in it – we consider both congestion and cost-sharing games. We argue that the dynamic setting is the suitable setting for many applications in practice. We study the stability of dynamic resource allocation games, where the appropriate notion of stability is that of subgame perfect equilibrium, study the inefficiency incurred due to selfish behavior, and also study problems that are particular to the dynamic setting, like constraints on the order in which resources can be chosen or the problem of finding a scheduler that achieves stability. article_processing_charge: No article_type: original author: - first_name: Guy full_name: Avni, Guy id: 463C8BC2-F248-11E8-B48F-1D18A9856A87 last_name: Avni orcid: 0000-0001-5588-8287 - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000−0002−2985−7724 - first_name: Orna full_name: Kupferman, Orna last_name: Kupferman citation: ama: Avni G, Henzinger TA, Kupferman O. Dynamic resource allocation games. Theoretical Computer Science. 2020;807:42-55. doi:10.1016/j.tcs.2019.06.031 apa: Avni, G., Henzinger, T. A., & Kupferman, O. (2020). Dynamic resource allocation games. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2019.06.031 chicago: Avni, Guy, Thomas A Henzinger, and Orna Kupferman. “Dynamic Resource Allocation Games.” Theoretical Computer Science. Elsevier, 2020. https://doi.org/10.1016/j.tcs.2019.06.031. ieee: G. Avni, T. A. Henzinger, and O. Kupferman, “Dynamic resource allocation games,” Theoretical Computer Science, vol. 807. Elsevier, pp. 42–55, 2020. ista: Avni G, Henzinger TA, Kupferman O. 2020. Dynamic resource allocation games. Theoretical Computer Science. 807, 42–55. mla: Avni, Guy, et al. “Dynamic Resource Allocation Games.” Theoretical Computer Science, vol. 807, Elsevier, 2020, pp. 42–55, doi:10.1016/j.tcs.2019.06.031. short: G. Avni, T.A. Henzinger, O. Kupferman, Theoretical Computer Science 807 (2020) 42–55. date_created: 2019-08-04T21:59:20Z date_published: 2020-02-06T00:00:00Z date_updated: 2023-08-17T13:52:49Z day: '06' ddc: - '000' department: - _id: ToHe doi: 10.1016/j.tcs.2019.06.031 external_id: isi: - '000512219400004' file: - access_level: open_access checksum: e86635417f45eb2cd75778f91382f737 content_type: application/pdf creator: dernst date_created: 2020-10-09T06:31:22Z date_updated: 2020-10-09T06:31:22Z file_id: '8639' file_name: 2020_TheoreticalCS_Avni.pdf file_size: 1413001 relation: main_file success: 1 file_date_updated: 2020-10-09T06:31:22Z has_accepted_license: '1' intvolume: ' 807' isi: 1 language: - iso: eng month: '02' oa: 1 oa_version: Submitted Version page: 42-55 project: - _id: 25F2ACDE-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11402-N23 name: Rigorous Systems Engineering - _id: 25F42A32-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z211 name: The Wittgenstein Prize - _id: 264B3912-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: M02369 name: Formal Methods meets Algorithmic Game Theory publication: Theoretical Computer Science publication_identifier: issn: - '03043975' publication_status: published publisher: Elsevier quality_controlled: '1' related_material: record: - id: '1341' relation: earlier_version status: public scopus_import: '1' status: public title: Dynamic resource allocation games type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 807 year: '2020' ... --- _id: '6593' abstract: - lang: eng text: 'We consider the monotone variational inequality problem in a Hilbert space and describe a projection-type method with inertial terms under the following properties: (a) The method generates a strongly convergent iteration sequence; (b) The method requires, at each iteration, only one projection onto the feasible set and two evaluations of the operator; (c) The method is designed for variational inequality for which the underline operator is monotone and uniformly continuous; (d) The method includes an inertial term. The latter is also shown to speed up the convergence in our numerical results. A comparison with some related methods is given and indicates that the new method is promising.' acknowledgement: The research of this author is supported by the ERC grant at the IST. article_processing_charge: No article_type: original author: - first_name: Yekini full_name: Shehu, Yekini id: 3FC7CB58-F248-11E8-B48F-1D18A9856A87 last_name: Shehu orcid: 0000-0001-9224-7139 - first_name: Xiao-Huan full_name: Li, Xiao-Huan last_name: Li - first_name: Qiao-Li full_name: Dong, Qiao-Li last_name: Dong citation: ama: Shehu Y, Li X-H, Dong Q-L. An efficient projection-type method for monotone variational inequalities in Hilbert spaces. Numerical Algorithms. 2020;84:365-388. doi:10.1007/s11075-019-00758-y apa: Shehu, Y., Li, X.-H., & Dong, Q.-L. (2020). An efficient projection-type method for monotone variational inequalities in Hilbert spaces. Numerical Algorithms. Springer Nature. https://doi.org/10.1007/s11075-019-00758-y chicago: Shehu, Yekini, Xiao-Huan Li, and Qiao-Li Dong. “An Efficient Projection-Type Method for Monotone Variational Inequalities in Hilbert Spaces.” Numerical Algorithms. Springer Nature, 2020. https://doi.org/10.1007/s11075-019-00758-y. ieee: Y. Shehu, X.-H. Li, and Q.-L. Dong, “An efficient projection-type method for monotone variational inequalities in Hilbert spaces,” Numerical Algorithms, vol. 84. Springer Nature, pp. 365–388, 2020. ista: Shehu Y, Li X-H, Dong Q-L. 2020. An efficient projection-type method for monotone variational inequalities in Hilbert spaces. Numerical Algorithms. 84, 365–388. mla: Shehu, Yekini, et al. “An Efficient Projection-Type Method for Monotone Variational Inequalities in Hilbert Spaces.” Numerical Algorithms, vol. 84, Springer Nature, 2020, pp. 365–88, doi:10.1007/s11075-019-00758-y. short: Y. Shehu, X.-H. Li, Q.-L. Dong, Numerical Algorithms 84 (2020) 365–388. date_created: 2019-06-27T20:09:33Z date_published: 2020-05-01T00:00:00Z date_updated: 2023-08-17T13:51:18Z day: '01' ddc: - '000' department: - _id: VlKo doi: 10.1007/s11075-019-00758-y ec_funded: 1 external_id: isi: - '000528979000015' file: - access_level: open_access checksum: bb1a1eb3ebb2df380863d0db594673ba content_type: application/pdf creator: kschuh date_created: 2019-10-01T13:14:10Z date_updated: 2020-07-14T12:47:34Z file_id: '6927' file_name: ExtragradientMethodPaper.pdf file_size: 359654 relation: main_file file_date_updated: 2020-07-14T12:47:34Z has_accepted_license: '1' intvolume: ' 84' isi: 1 language: - iso: eng month: '05' oa: 1 oa_version: Submitted Version page: 365-388 project: - _id: 25FBA906-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '616160' name: 'Discrete Optimization in Computer Vision: Theory and Practice' publication: Numerical Algorithms publication_identifier: eissn: - 1572-9265 issn: - 1017-1398 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: An efficient projection-type method for monotone variational inequalities in Hilbert spaces type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 84 year: '2020' ... --- _id: '6808' abstract: - lang: eng text: Super-resolution fluorescence microscopy has become an important catalyst for discovery in the life sciences. In STimulated Emission Depletion (STED) microscopy, a pattern of light drives fluorophores from a signal-emitting on-state to a non-signalling off-state. Only emitters residing in a sub-diffraction volume around an intensity minimum are allowed to fluoresce, rendering them distinguishable from the nearby, but dark fluorophores. STED routinely achieves resolution in the few tens of nanometers range in biological samples and is suitable for live imaging. Here, we review the working principle of STED and provide general guidelines for successful STED imaging. The strive for ever higher resolution comes at the cost of increased light burden. We discuss techniques to reduce light exposure and mitigate its detrimental effects on the specimen. These include specialized illumination strategies as well as protecting fluorophores from photobleaching mediated by high-intensity STED light. This opens up the prospect of volumetric imaging in living cells and tissues with diffraction-unlimited resolution in all three spatial dimensions. article_processing_charge: No article_type: original author: - first_name: Wiebke full_name: Jahr, Wiebke id: 425C1CE8-F248-11E8-B48F-1D18A9856A87 last_name: Jahr - first_name: Philipp full_name: Velicky, Philipp id: 39BDC62C-F248-11E8-B48F-1D18A9856A87 last_name: Velicky orcid: 0000-0002-2340-7431 - first_name: Johann G full_name: Danzl, Johann G id: 42EFD3B6-F248-11E8-B48F-1D18A9856A87 last_name: Danzl orcid: 0000-0001-8559-3973 citation: ama: Jahr W, Velicky P, Danzl JG. Strategies to maximize performance in STimulated Emission Depletion (STED) nanoscopy of biological specimens. Methods. 2020;174(3):27-41. doi:10.1016/j.ymeth.2019.07.019 apa: Jahr, W., Velicky, P., & Danzl, J. G. (2020). Strategies to maximize performance in STimulated Emission Depletion (STED) nanoscopy of biological specimens. Methods. Elsevier. https://doi.org/10.1016/j.ymeth.2019.07.019 chicago: Jahr, Wiebke, Philipp Velicky, and Johann G Danzl. “Strategies to Maximize Performance in STimulated Emission Depletion (STED) Nanoscopy of Biological Specimens.” Methods. Elsevier, 2020. https://doi.org/10.1016/j.ymeth.2019.07.019. ieee: W. Jahr, P. Velicky, and J. G. Danzl, “Strategies to maximize performance in STimulated Emission Depletion (STED) nanoscopy of biological specimens,” Methods, vol. 174, no. 3. Elsevier, pp. 27–41, 2020. ista: Jahr W, Velicky P, Danzl JG. 2020. Strategies to maximize performance in STimulated Emission Depletion (STED) nanoscopy of biological specimens. Methods. 174(3), 27–41. mla: Jahr, Wiebke, et al. “Strategies to Maximize Performance in STimulated Emission Depletion (STED) Nanoscopy of Biological Specimens.” Methods, vol. 174, no. 3, Elsevier, 2020, pp. 27–41, doi:10.1016/j.ymeth.2019.07.019. short: W. Jahr, P. Velicky, J.G. Danzl, Methods 174 (2020) 27–41. date_created: 2019-08-12T16:36:32Z date_published: 2020-03-01T00:00:00Z date_updated: 2023-08-17T13:59:57Z day: '01' department: - _id: JoDa doi: 10.1016/j.ymeth.2019.07.019 external_id: isi: - '000525860400005' pmid: - '31344404' intvolume: ' 174' isi: 1 issue: '3' language: - iso: eng main_file_link: - open_access: '1' url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7100895/ month: '03' oa: 1 oa_version: Submitted Version page: 27-41 pmid: 1 project: - _id: 265CB4D0-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: I03600 name: Optical control of synaptic function via adhesion molecules - _id: 2668BFA0-B435-11E9-9278-68D0E5697425 grant_number: LT00057 name: High-speed 3D-nanoscopy to study the role of adhesion during 3D cell migration publication: Methods publication_identifier: issn: - 1046-2023 publication_status: published publisher: Elsevier quality_controlled: '1' scopus_import: '1' status: public title: Strategies to maximize performance in STimulated Emission Depletion (STED) nanoscopy of biological specimens type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 174 year: '2020' ... --- _id: '6563' abstract: - lang: eng text: "This paper presents two algorithms. The first decides the existence of a pointed homotopy between given simplicial maps \U0001D453,\U0001D454:\U0001D44B→\U0001D44C, and the second computes the group [\U0001D6F4\U0001D44B,\U0001D44C]∗ of pointed homotopy classes of maps from a suspension; in both cases, the target Y is assumed simply connected. More generally, these algorithms work relative to \U0001D434⊆\U0001D44B." article_processing_charge: No article_type: original author: - first_name: Marek full_name: Filakovský, Marek id: 3E8AF77E-F248-11E8-B48F-1D18A9856A87 last_name: Filakovský - first_name: Lukas full_name: Vokřínek, Lukas last_name: Vokřínek citation: ama: Filakovský M, Vokřínek L. Are two given maps homotopic? An algorithmic viewpoint. Foundations of Computational Mathematics. 2020;20:311-330. doi:10.1007/s10208-019-09419-x apa: Filakovský, M., & Vokřínek, L. (2020). Are two given maps homotopic? An algorithmic viewpoint. Foundations of Computational Mathematics. Springer Nature. https://doi.org/10.1007/s10208-019-09419-x chicago: Filakovský, Marek, and Lukas Vokřínek. “Are Two given Maps Homotopic? An Algorithmic Viewpoint.” Foundations of Computational Mathematics. Springer Nature, 2020. https://doi.org/10.1007/s10208-019-09419-x. ieee: M. Filakovský and L. Vokřínek, “Are two given maps homotopic? An algorithmic viewpoint,” Foundations of Computational Mathematics, vol. 20. Springer Nature, pp. 311–330, 2020. ista: Filakovský M, Vokřínek L. 2020. Are two given maps homotopic? An algorithmic viewpoint. Foundations of Computational Mathematics. 20, 311–330. mla: Filakovský, Marek, and Lukas Vokřínek. “Are Two given Maps Homotopic? An Algorithmic Viewpoint.” Foundations of Computational Mathematics, vol. 20, Springer Nature, 2020, pp. 311–30, doi:10.1007/s10208-019-09419-x. short: M. Filakovský, L. Vokřínek, Foundations of Computational Mathematics 20 (2020) 311–330. date_created: 2019-06-16T21:59:14Z date_published: 2020-04-01T00:00:00Z date_updated: 2023-08-17T13:50:44Z day: '01' department: - _id: UlWa doi: 10.1007/s10208-019-09419-x external_id: arxiv: - '1312.2337' isi: - '000522437400004' intvolume: ' 20' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1312.2337 month: '04' oa: 1 oa_version: Preprint page: 311-330 project: - _id: 26611F5C-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P31312 name: Algorithms for Embeddings and Homotopy Theory publication: Foundations of Computational Mathematics publication_identifier: eissn: - '16153383' issn: - '16153375' publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: Are two given maps homotopic? An algorithmic viewpoint type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 20 year: '2020' ... --- _id: '6952' abstract: - lang: eng text: 'We present a unified framework tackling two problems: class-specific 3D reconstruction from a single image, and generation of new 3D shape samples. These tasks have received considerable attention recently; however, most existing approaches rely on 3D supervision, annotation of 2D images with keypoints or poses, and/or training with multiple views of each object instance. Our framework is very general: it can be trained in similar settings to existing approaches, while also supporting weaker supervision. Importantly, it can be trained purely from 2D images, without pose annotations, and with only a single view per instance. We employ meshes as an output representation, instead of voxels used in most prior work. This allows us to reason over lighting parameters and exploit shading information during training, which previous 2D-supervised methods cannot. Thus, our method can learn to generate and reconstruct concave object classes. We evaluate our approach in various settings, showing that: (i) it learns to disentangle shape from pose and lighting; (ii) using shading in the loss improves performance compared to just silhouettes; (iii) when using a standard single white light, our model outperforms state-of-the-art 2D-supervised methods, both with and without pose supervision, thanks to exploiting shading cues; (iv) performance improves further when using multiple coloured lights, even approaching that of state-of-the-art 3D-supervised methods; (v) shapes produced by our model capture smooth surfaces and fine details better than voxel-based approaches; and (vi) our approach supports concave classes such as bathtubs and sofas, which methods based on silhouettes cannot learn.' acknowledgement: Open access funding provided by Institute of Science and Technology (IST Austria). article_processing_charge: Yes (via OA deal) article_type: original author: - first_name: Paul M full_name: Henderson, Paul M id: 13C09E74-18D9-11E9-8878-32CFE5697425 last_name: Henderson orcid: 0000-0002-5198-7445 - first_name: Vittorio full_name: Ferrari, Vittorio last_name: Ferrari citation: ama: Henderson PM, Ferrari V. Learning single-image 3D reconstruction by generative modelling of shape, pose and shading. International Journal of Computer Vision. 2020;128:835-854. doi:10.1007/s11263-019-01219-8 apa: Henderson, P. M., & Ferrari, V. (2020). Learning single-image 3D reconstruction by generative modelling of shape, pose and shading. International Journal of Computer Vision. Springer Nature. https://doi.org/10.1007/s11263-019-01219-8 chicago: Henderson, Paul M, and Vittorio Ferrari. “Learning Single-Image 3D Reconstruction by Generative Modelling of Shape, Pose and Shading.” International Journal of Computer Vision. Springer Nature, 2020. https://doi.org/10.1007/s11263-019-01219-8. ieee: P. M. Henderson and V. Ferrari, “Learning single-image 3D reconstruction by generative modelling of shape, pose and shading,” International Journal of Computer Vision, vol. 128. Springer Nature, pp. 835–854, 2020. ista: Henderson PM, Ferrari V. 2020. Learning single-image 3D reconstruction by generative modelling of shape, pose and shading. International Journal of Computer Vision. 128, 835–854. mla: Henderson, Paul M., and Vittorio Ferrari. “Learning Single-Image 3D Reconstruction by Generative Modelling of Shape, Pose and Shading.” International Journal of Computer Vision, vol. 128, Springer Nature, 2020, pp. 835–54, doi:10.1007/s11263-019-01219-8. short: P.M. Henderson, V. Ferrari, International Journal of Computer Vision 128 (2020) 835–854. date_created: 2019-10-17T13:38:20Z date_published: 2020-04-01T00:00:00Z date_updated: 2023-08-17T14:01:16Z day: '01' ddc: - '004' department: - _id: ChLa doi: 10.1007/s11263-019-01219-8 external_id: arxiv: - '1901.06447' isi: - '000491042100002' file: - access_level: open_access checksum: a0f05dd4f5f64e4f713d8d9d4b5b1e3f content_type: application/pdf creator: dernst date_created: 2019-10-25T10:28:29Z date_updated: 2020-07-14T12:47:46Z file_id: '6973' file_name: 2019_CompVision_Henderson.pdf file_size: 2243134 relation: main_file file_date_updated: 2020-07-14T12:47:46Z has_accepted_license: '1' intvolume: ' 128' isi: 1 language: - iso: eng month: '04' oa: 1 oa_version: Published Version page: 835-854 project: - _id: B67AFEDC-15C9-11EA-A837-991A96BB2854 name: IST Austria Open Access Fund publication: International Journal of Computer Vision publication_identifier: eissn: - 1573-1405 issn: - 0920-5691 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: Learning single-image 3D reconstruction by generative modelling of shape, pose and shading tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 128 year: '2020' ... --- _id: '7148' abstract: - lang: eng text: In the cerebellum, GluD2 is exclusively expressed in Purkinje cells, where it regulates synapse formation and regeneration, synaptic plasticity, and motor learning. Delayed cognitive development in humans with GluD2 gene mutations suggests extracerebellar functions of GluD2. However, extracerebellar expression of GluD2 and its relationship with that of GluD1 are poorly understood. GluD2 mRNA and protein were widely detected, with relatively high levels observed in the olfactory glomerular layer, medial prefrontal cortex, cingulate cortex, retrosplenial granular cortex, olfactory tubercle, subiculum, striatum, lateral septum, anterodorsal thalamic nucleus, and arcuate hypothalamic nucleus. These regions were also enriched for GluD1, and many individual neurons coexpressed the two GluDs. In the retrosplenial granular cortex, GluD1 and GluD2 were selectively expressed at PSD‐95‐expressing glutamatergic synapses, and their coexpression on the same synapses was shown by SDS‐digested freeze‐fracture replica labeling. Biochemically, GluD1 and GluD2 formed coimmunoprecipitable complex formation in HEK293T cells and in the cerebral cortex and hippocampus. We further estimated the relative protein amount by quantitative immunoblotting using GluA2/GluD2 and GluA2/GluD1 chimeric proteins as standards for titration of GluD1 and GluD2 antibodies. Intriguingly, the relative amount of GluD2 was almost comparable to that of GluD1 in the postsynaptic density fraction prepared from the cerebral cortex and hippocampus. In contrast, GluD2 was overwhelmingly predominant in the cerebellum. Thus, we have determined the relative extracerebellar expression of GluD1 and GluD2 at regional, neuronal, and synaptic levels. These data provide a molecular–anatomical basis for possible competitive and cooperative interactions of GluD family members at synapses in various brain regions. acknowledgement: This study was supported by Grants-in-Aid for Scientific Research to K.K. (18K06813), Y.M. (17K08503, 17H0631319), and K.S. (16H04650) and a grant for Scientific Research on Innovative Areas to K.S (16H06276) from the Ministry of Education, Culture, Sports, Science and Technology of Japan (MEXT). We thank K. Akashi, I. Watanabe-Iida, Y. Suzuki, and H. Azechi for technical assistance and advice, and H. Uchida for valuable discussions. We thank E. Kushiya,I. Yabe, C. Ohori, Y. Mochizuki, Y. Ishikawa, and N. Ishimoto for technical assistance in generating GluD1-KO mice. article_processing_charge: No article_type: original author: - first_name: Chihiro full_name: Nakamoto, Chihiro last_name: Nakamoto - first_name: Kohtarou full_name: Konno, Kohtarou last_name: Konno - first_name: Taisuke full_name: Miyazaki, Taisuke last_name: Miyazaki - first_name: Ena full_name: Nakatsukasa, Ena last_name: Nakatsukasa - first_name: Rie full_name: Natsume, Rie last_name: Natsume - first_name: Manabu full_name: Abe, Manabu last_name: Abe - first_name: Meiko full_name: Kawamura, Meiko last_name: Kawamura - first_name: Yugo full_name: Fukazawa, Yugo last_name: Fukazawa - first_name: Ryuichi full_name: Shigemoto, Ryuichi id: 499F3ABC-F248-11E8-B48F-1D18A9856A87 last_name: Shigemoto orcid: 0000-0001-8761-9444 - first_name: Miwako full_name: Yamasaki, Miwako last_name: Yamasaki - first_name: Kenji full_name: Sakimura, Kenji last_name: Sakimura - first_name: Masahiko full_name: Watanabe, Masahiko last_name: Watanabe citation: ama: Nakamoto C, Konno K, Miyazaki T, et al. Expression mapping, quantification, and complex formation of GluD1 and GluD2 glutamate receptors in adult mouse brain. Journal of Comparative Neurology. 2020;528(6):1003-1027. doi:10.1002/cne.24792 apa: Nakamoto, C., Konno, K., Miyazaki, T., Nakatsukasa, E., Natsume, R., Abe, M., … Watanabe, M. (2020). Expression mapping, quantification, and complex formation of GluD1 and GluD2 glutamate receptors in adult mouse brain. Journal of Comparative Neurology. Wiley. https://doi.org/10.1002/cne.24792 chicago: Nakamoto, Chihiro, Kohtarou Konno, Taisuke Miyazaki, Ena Nakatsukasa, Rie Natsume, Manabu Abe, Meiko Kawamura, et al. “Expression Mapping, Quantification, and Complex Formation of GluD1 and GluD2 Glutamate Receptors in Adult Mouse Brain.” Journal of Comparative Neurology. Wiley, 2020. https://doi.org/10.1002/cne.24792. ieee: C. Nakamoto et al., “Expression mapping, quantification, and complex formation of GluD1 and GluD2 glutamate receptors in adult mouse brain,” Journal of Comparative Neurology, vol. 528, no. 6. Wiley, pp. 1003–1027, 2020. ista: Nakamoto C, Konno K, Miyazaki T, Nakatsukasa E, Natsume R, Abe M, Kawamura M, Fukazawa Y, Shigemoto R, Yamasaki M, Sakimura K, Watanabe M. 2020. Expression mapping, quantification, and complex formation of GluD1 and GluD2 glutamate receptors in adult mouse brain. Journal of Comparative Neurology. 528(6), 1003–1027. mla: Nakamoto, Chihiro, et al. “Expression Mapping, Quantification, and Complex Formation of GluD1 and GluD2 Glutamate Receptors in Adult Mouse Brain.” Journal of Comparative Neurology, vol. 528, no. 6, Wiley, 2020, pp. 1003–27, doi:10.1002/cne.24792. short: C. Nakamoto, K. Konno, T. Miyazaki, E. Nakatsukasa, R. Natsume, M. Abe, M. Kawamura, Y. Fukazawa, R. Shigemoto, M. Yamasaki, K. Sakimura, M. Watanabe, Journal of Comparative Neurology 528 (2020) 1003–1027. date_created: 2019-12-04T16:09:29Z date_published: 2020-04-01T00:00:00Z date_updated: 2023-08-17T14:06:50Z day: '01' ddc: - '571' - '599' department: - _id: RySh doi: 10.1002/cne.24792 external_id: isi: - '000496410200001' pmid: - '31625608' has_accepted_license: '1' intvolume: ' 528' isi: 1 issue: '6' language: - iso: eng month: '04' oa_version: None page: 1003-1027 pmid: 1 publication: Journal of Comparative Neurology publication_identifier: eissn: - 1096-9861 issn: - 0021-9967 publication_status: published publisher: Wiley quality_controlled: '1' scopus_import: '1' status: public title: Expression mapping, quantification, and complex formation of GluD1 and GluD2 glutamate receptors in adult mouse brain type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 528 year: '2020' ... --- _id: '7033' abstract: - lang: eng text: Removal of the Bax gene from mice completely protects the somas of retinal ganglion cells (RGCs) from apoptosis following optic nerve injury. This makes BAX a promising therapeutic target to prevent neurodegeneration. In this study, Bax+/− mice were used to test the hypothesis that lowering the quantity of BAX in RGCs would delay apoptosis following optic nerve injury. RGCs were damaged by performing optic nerve crush (ONC) and then immunostaining for phospho-cJUN, and quantitative PCR were used to monitor the status of the BAX activation mechanism in the months following injury. The apoptotic susceptibility of injured cells was directly tested by virally introducing GFP-BAX into Bax−/− RGCs after injury. The competency of quiescent RGCs to reactivate their BAX activation mechanism was tested by intravitreal injection of the JNK pathway agonist, anisomycin. Twenty-four weeks after ONC, Bax+/− mice had significantly less cell loss in their RGC layer than Bax+/+ mice 3 weeks after ONC. Bax+/− and Bax+/+ RGCs exhibited similar patterns of nuclear phospho-cJUN accumulation immediately after ONC, which persisted in Bax+/− RGCs for up to 7 weeks before abating. The transcriptional activation of BAX-activating genes was similar in Bax+/− and Bax+/+ RGCs following ONC. Intriguingly, cells deactivated their BAX activation mechanism between 7 and 12 weeks after crush. Introduction of GFP-BAX into Bax−/− cells at 4 weeks after ONC showed that these cells had a nearly normal capacity to activate this protein, but this capacity was lost 8 weeks after crush. Collectively, these data suggest that 8–12 weeks after crush, damaged cells no longer displayed increased susceptibility to BAX activation relative to their naïve counterparts. In this same timeframe, retinal glial activation and the signaling of the pro-apoptotic JNK pathway also abated. Quiescent RGCs did not show a timely reactivation of their JNK pathway following intravitreal injection with anisomycin. These findings demonstrate that lowering the quantity of BAX in RGCs is neuroprotective after acute injury. Damaged RGCs enter a quiescent state months after injury and are no longer responsive to an apoptotic stimulus. Quiescent RGCs will require rejuvenation to reacquire functionality. acknowledgement: This work was supported by National Eye Institute grants R01 EY012223 (RWN), R01 EY030123 (RWN), T32 EY027721 (Department of Ophthalmology and Visual Sciences, University of Wisconsin-Madison), and a Vision Science Core grant P30 EY016665 (Department of Ophthalmology and Visual Sciences, University of Wisconsin-Madison), an unrestricted funding grant from Research to Prevent Blindness (Department of Ophthalmology and Visual Sciences, University of Wisconsin-Madison), the Frederick A. Davis Endowment (RWN), and the Mr. and Mrs. George Taylor Foundation (RWN). article_processing_charge: No article_type: original author: - first_name: RJ full_name: Donahue, RJ last_name: Donahue - first_name: Margaret E full_name: Maes, Margaret E id: 3838F452-F248-11E8-B48F-1D18A9856A87 last_name: Maes orcid: 0000-0001-9642-1085 - first_name: JA full_name: Grosser, JA last_name: Grosser - first_name: RW full_name: Nickells, RW last_name: Nickells citation: ama: Donahue R, Maes ME, Grosser J, Nickells R. BAX-depleted retinal ganglion cells survive and become quiescent following optic nerve damage. Molecular Neurobiology. 2020;57(2):1070–1084. doi:10.1007/s12035-019-01783-7 apa: Donahue, R., Maes, M. E., Grosser, J., & Nickells, R. (2020). BAX-depleted retinal ganglion cells survive and become quiescent following optic nerve damage. Molecular Neurobiology. Springer Nature. https://doi.org/10.1007/s12035-019-01783-7 chicago: Donahue, RJ, Margaret E Maes, JA Grosser, and RW Nickells. “BAX-Depleted Retinal Ganglion Cells Survive and Become Quiescent Following Optic Nerve Damage.” Molecular Neurobiology. Springer Nature, 2020. https://doi.org/10.1007/s12035-019-01783-7. ieee: R. Donahue, M. E. Maes, J. Grosser, and R. Nickells, “BAX-depleted retinal ganglion cells survive and become quiescent following optic nerve damage,” Molecular Neurobiology, vol. 57, no. 2. Springer Nature, pp. 1070–1084, 2020. ista: Donahue R, Maes ME, Grosser J, Nickells R. 2020. BAX-depleted retinal ganglion cells survive and become quiescent following optic nerve damage. Molecular Neurobiology. 57(2), 1070–1084. mla: Donahue, RJ, et al. “BAX-Depleted Retinal Ganglion Cells Survive and Become Quiescent Following Optic Nerve Damage.” Molecular Neurobiology, vol. 57, no. 2, Springer Nature, 2020, pp. 1070–1084, doi:10.1007/s12035-019-01783-7. short: R. Donahue, M.E. Maes, J. Grosser, R. Nickells, Molecular Neurobiology 57 (2020) 1070–1084. date_created: 2019-11-18T14:18:39Z date_published: 2020-02-01T00:00:00Z date_updated: 2023-08-17T14:05:48Z day: '01' department: - _id: SaSi doi: 10.1007/s12035-019-01783-7 external_id: isi: - '000493754200001' pmid: - '31673950' intvolume: ' 57' isi: 1 issue: '2' language: - iso: eng main_file_link: - open_access: '1' url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7035206/ month: '02' oa: 1 oa_version: Submitted Version page: 1070–1084 pmid: 1 publication: Molecular Neurobiology publication_identifier: eissn: - 1559-1182 issn: - 0893-7648 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: BAX-depleted retinal ganglion cells survive and become quiescent following optic nerve damage type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 57 year: '2020' ... --- _id: '6997' article_processing_charge: Yes (via OA deal) article_type: original author: - first_name: Yuzhou full_name: Zhang, Yuzhou id: 3B6137F2-F248-11E8-B48F-1D18A9856A87 last_name: Zhang orcid: 0000-0003-2627-6956 - first_name: Jiří full_name: Friml, Jiří id: 4159519E-F248-11E8-B48F-1D18A9856A87 last_name: Friml orcid: 0000-0002-8302-7596 citation: ama: Zhang Y, Friml J. Auxin guides roots to avoid obstacles during gravitropic growth. New Phytologist. 2020;225(3):1049-1052. doi:10.1111/nph.16203 apa: Zhang, Y., & Friml, J. (2020). Auxin guides roots to avoid obstacles during gravitropic growth. New Phytologist. Wiley. https://doi.org/10.1111/nph.16203 chicago: Zhang, Yuzhou, and Jiří Friml. “Auxin Guides Roots to Avoid Obstacles during Gravitropic Growth.” New Phytologist. Wiley, 2020. https://doi.org/10.1111/nph.16203. ieee: Y. Zhang and J. Friml, “Auxin guides roots to avoid obstacles during gravitropic growth,” New Phytologist, vol. 225, no. 3. Wiley, pp. 1049–1052, 2020. ista: Zhang Y, Friml J. 2020. Auxin guides roots to avoid obstacles during gravitropic growth. New Phytologist. 225(3), 1049–1052. mla: Zhang, Yuzhou, and Jiří Friml. “Auxin Guides Roots to Avoid Obstacles during Gravitropic Growth.” New Phytologist, vol. 225, no. 3, Wiley, 2020, pp. 1049–52, doi:10.1111/nph.16203. short: Y. Zhang, J. Friml, New Phytologist 225 (2020) 1049–1052. date_created: 2019-11-12T11:41:32Z date_published: 2020-02-01T00:00:00Z date_updated: 2023-08-17T14:01:49Z day: '01' ddc: - '580' department: - _id: JiFr doi: 10.1111/nph.16203 ec_funded: 1 external_id: isi: - '000489638800001' pmid: - '31603260' file: - access_level: open_access checksum: cd42ffdb381fd52812b9583d4d407139 content_type: application/pdf creator: dernst date_created: 2020-11-18T16:42:48Z date_updated: 2020-11-18T16:42:48Z file_id: '8772' file_name: 2020_NewPhytologist_Zhang.pdf file_size: 717345 relation: main_file success: 1 file_date_updated: 2020-11-18T16:42:48Z has_accepted_license: '1' intvolume: ' 225' isi: 1 issue: '3' language: - iso: eng month: '02' oa: 1 oa_version: Published Version page: 1049-1052 pmid: 1 project: - _id: 261099A6-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '742985' name: Tracing Evolution of Auxin Transport and Polarity in Plants - _id: 26538374-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: I03630 name: Molecular mechanisms of endocytic cargo recognition in plants - _id: 25681D80-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '291734' name: International IST Postdoc Fellowship Programme publication: New Phytologist publication_identifier: eissn: - 1469-8137 issn: - 0028-646x publication_status: published publisher: Wiley quality_controlled: '1' scopus_import: '1' status: public title: Auxin guides roots to avoid obstacles during gravitropic growth tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 225 year: '2020' ... --- _id: '7149' abstract: - lang: eng text: In recent years, many genes have been associated with chromatinopathies classified as “Cornelia de Lange Syndrome‐like.” It is known that the phenotype of these patients becomes less recognizable, overlapping to features characteristic of other syndromes caused by genetic variants affecting different regulators of chromatin structure and function. Therefore, Cornelia de Lange syndrome diagnosis might be arduous due to the seldom discordance between unexpected molecular diagnosis and clinical evaluation. Here, we review the molecular features of Cornelia de Lange syndrome, supporting the hypothesis that “CdLS‐like syndromes” are part of a larger “rare disease family” sharing multiple clinical features and common disrupted molecular pathways. acknowledgement: ' Dipartimento DiSS, Università degli Studi di Milano, Grant/Award Number: Linea 2; Fondazione Cariplo, Grant/Award Number: 2015-0783; German Federal Ministry of Education and Research (BMBF), Grant/Award Number: CHROMATIN-Net; Medical Faculty of the University of Lübeck, Grant/Award Number: J09-2017; Nickel & Co S.p.A.; Università degli Studi di Milano, Grant/Award Numbers: Molecular & Translational Medicine PhD Scholarship, Translational Medicine PhD Scholarship' article_processing_charge: No article_type: review author: - first_name: Laura full_name: Avagliano, Laura last_name: Avagliano - first_name: Ilaria full_name: Parenti, Ilaria id: D93538B0-5B71-11E9-AC62-02EBE5697425 last_name: Parenti - first_name: Paolo full_name: Grazioli, Paolo last_name: Grazioli - first_name: Elisabetta full_name: Di Fede, Elisabetta last_name: Di Fede - first_name: Chiara full_name: Parodi, Chiara last_name: Parodi - first_name: Milena full_name: Mariani, Milena last_name: Mariani - first_name: Frank J. full_name: Kaiser, Frank J. last_name: Kaiser - first_name: Angelo full_name: Selicorni, Angelo last_name: Selicorni - first_name: Cristina full_name: Gervasini, Cristina last_name: Gervasini - first_name: Valentina full_name: Massa, Valentina last_name: Massa citation: ama: 'Avagliano L, Parenti I, Grazioli P, et al. Chromatinopathies: A focus on Cornelia de Lange syndrome. Clinical Genetics. 2020;97(1):3-11. doi:10.1111/cge.13674' apa: 'Avagliano, L., Parenti, I., Grazioli, P., Di Fede, E., Parodi, C., Mariani, M., … Massa, V. (2020). Chromatinopathies: A focus on Cornelia de Lange syndrome. Clinical Genetics. Wiley. https://doi.org/10.1111/cge.13674' chicago: 'Avagliano, Laura, Ilaria Parenti, Paolo Grazioli, Elisabetta Di Fede, Chiara Parodi, Milena Mariani, Frank J. Kaiser, Angelo Selicorni, Cristina Gervasini, and Valentina Massa. “Chromatinopathies: A Focus on Cornelia de Lange Syndrome.” Clinical Genetics. Wiley, 2020. https://doi.org/10.1111/cge.13674.' ieee: 'L. Avagliano et al., “Chromatinopathies: A focus on Cornelia de Lange syndrome,” Clinical Genetics, vol. 97, no. 1. Wiley, pp. 3–11, 2020.' ista: 'Avagliano L, Parenti I, Grazioli P, Di Fede E, Parodi C, Mariani M, Kaiser FJ, Selicorni A, Gervasini C, Massa V. 2020. Chromatinopathies: A focus on Cornelia de Lange syndrome. Clinical Genetics. 97(1), 3–11.' mla: 'Avagliano, Laura, et al. “Chromatinopathies: A Focus on Cornelia de Lange Syndrome.” Clinical Genetics, vol. 97, no. 1, Wiley, 2020, pp. 3–11, doi:10.1111/cge.13674.' short: L. Avagliano, I. Parenti, P. Grazioli, E. Di Fede, C. Parodi, M. Mariani, F.J. Kaiser, A. Selicorni, C. Gervasini, V. Massa, Clinical Genetics 97 (2020) 3–11. date_created: 2019-12-04T16:10:59Z date_published: 2020-01-01T00:00:00Z date_updated: 2023-08-17T14:06:20Z day: '01' department: - _id: GaNo doi: 10.1111/cge.13674 external_id: isi: - '000562561800001' pmid: - '31721174' intvolume: ' 97' isi: 1 issue: '1' language: - iso: eng month: '01' oa_version: None page: 3-11 pmid: 1 publication: Clinical Genetics publication_identifier: eissn: - 1399-0004 issn: - 0009-9163 publication_status: published publisher: Wiley quality_controlled: '1' scopus_import: '1' status: public title: 'Chromatinopathies: A focus on Cornelia de Lange syndrome' type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 97 year: '2020' ... --- _id: '7004' abstract: - lang: eng text: We define an action of the (double of) Cohomological Hall algebra of Kontsevich and Soibelman on the cohomology of the moduli space of spiked instantons of Nekrasov. We identify this action with the one of the affine Yangian of gl(1). Based on that we derive the vertex algebra at the corner Wr1,r2,r3 of Gaiotto and Rapčák. We conjecture that our approach works for a big class of Calabi–Yau categories, including those associated with toric Calabi–Yau 3-folds. article_processing_charge: No article_type: original author: - first_name: Miroslav full_name: Rapcak, Miroslav last_name: Rapcak - first_name: Yan full_name: Soibelman, Yan last_name: Soibelman - first_name: Yaping full_name: Yang, Yaping last_name: Yang - first_name: Gufang full_name: Zhao, Gufang id: 2BC2AC5E-F248-11E8-B48F-1D18A9856A87 last_name: Zhao citation: ama: Rapcak M, Soibelman Y, Yang Y, Zhao G. Cohomological Hall algebras, vertex algebras and instantons. Communications in Mathematical Physics. 2020;376:1803-1873. doi:10.1007/s00220-019-03575-5 apa: Rapcak, M., Soibelman, Y., Yang, Y., & Zhao, G. (2020). Cohomological Hall algebras, vertex algebras and instantons. Communications in Mathematical Physics. Springer Nature. https://doi.org/10.1007/s00220-019-03575-5 chicago: Rapcak, Miroslav, Yan Soibelman, Yaping Yang, and Gufang Zhao. “Cohomological Hall Algebras, Vertex Algebras and Instantons.” Communications in Mathematical Physics. Springer Nature, 2020. https://doi.org/10.1007/s00220-019-03575-5. ieee: M. Rapcak, Y. Soibelman, Y. Yang, and G. Zhao, “Cohomological Hall algebras, vertex algebras and instantons,” Communications in Mathematical Physics, vol. 376. Springer Nature, pp. 1803–1873, 2020. ista: Rapcak M, Soibelman Y, Yang Y, Zhao G. 2020. Cohomological Hall algebras, vertex algebras and instantons. Communications in Mathematical Physics. 376, 1803–1873. mla: Rapcak, Miroslav, et al. “Cohomological Hall Algebras, Vertex Algebras and Instantons.” Communications in Mathematical Physics, vol. 376, Springer Nature, 2020, pp. 1803–73, doi:10.1007/s00220-019-03575-5. short: M. Rapcak, Y. Soibelman, Y. Yang, G. Zhao, Communications in Mathematical Physics 376 (2020) 1803–1873. date_created: 2019-11-12T14:01:27Z date_published: 2020-06-01T00:00:00Z date_updated: 2023-08-17T14:02:59Z day: '01' department: - _id: TaHa doi: 10.1007/s00220-019-03575-5 ec_funded: 1 external_id: arxiv: - '1810.10402' isi: - '000536255500004' intvolume: ' 376' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1810.10402 month: '06' oa: 1 oa_version: Preprint page: 1803-1873 project: - _id: 25E549F4-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '320593' name: Arithmetic and physics of Higgs moduli spaces publication: Communications in Mathematical Physics publication_identifier: eissn: - 1432-0916 issn: - 0010-3616 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: Cohomological Hall algebras, vertex algebras and instantons type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 376 year: '2020' ... --- _id: '7204' abstract: - lang: eng text: Plant root architecture dynamically adapts to various environmental conditions, such as salt‐containing soil. The phytohormone abscisic acid (ABA) is involved among others also in these developmental adaptations, but the underlying molecular mechanism remains elusive. Here, a novel branch of the ABA signaling pathway in Arabidopsis involving PYR/PYL/RCAR (abbreviated as PYLs) receptor‐protein phosphatase 2A (PP2A) complex that acts in parallel to the canonical PYLs‐protein phosphatase 2C (PP2C) mechanism is identified. The PYLs‐PP2A signaling modulates root gravitropism and lateral root formation through regulating phytohormone auxin transport. In optimal conditions, PYLs ABA receptor interacts with the catalytic subunits of PP2A, increasing their phosphatase activity and thus counteracting PINOID (PID) kinase‐mediated phosphorylation of PIN‐FORMED (PIN) auxin transporters. By contrast, in salt and osmotic stress conditions, ABA binds to PYLs, inhibiting the PP2A activity, which leads to increased PIN phosphorylation and consequently modulated directional auxin transport leading to adapted root architecture. This work reveals an adaptive mechanism that may flexibly adjust plant root growth to withstand saline and osmotic stresses. It occurs via the cross‐talk between the stress hormone ABA and the versatile developmental regulator auxin. article_number: '1901455' article_processing_charge: No article_type: original author: - first_name: Yang full_name: Li, Yang last_name: Li - first_name: Yaping full_name: Wang, Yaping last_name: Wang - first_name: Shutang full_name: Tan, Shutang id: 2DE75584-F248-11E8-B48F-1D18A9856A87 last_name: Tan orcid: 0000-0002-0471-8285 - first_name: Zhen full_name: Li, Zhen last_name: Li - first_name: Zhi full_name: Yuan, Zhi last_name: Yuan - first_name: Matous full_name: Glanc, Matous id: 1AE1EA24-02D0-11E9-9BAA-DAF4881429F2 last_name: Glanc orcid: 0000-0003-0619-7783 - first_name: David full_name: Domjan, David id: C684CD7A-257E-11EA-9B6F-D8588B4F947F last_name: Domjan orcid: 0000-0003-2267-106X - first_name: Kai full_name: Wang, Kai last_name: Wang - first_name: Wei full_name: Xuan, Wei last_name: Xuan - first_name: Yan full_name: Guo, Yan last_name: Guo - first_name: Zhizhong full_name: Gong, Zhizhong last_name: Gong - first_name: Jiří full_name: Friml, Jiří id: 4159519E-F248-11E8-B48F-1D18A9856A87 last_name: Friml orcid: 0000-0002-8302-7596 - first_name: Jing full_name: Zhang, Jing last_name: Zhang citation: ama: Li Y, Wang Y, Tan S, et al. Root growth adaptation is mediated by PYLs ABA receptor-PP2A protein phosphatase complex. Advanced Science. 2020;7(3). doi:10.1002/advs.201901455 apa: Li, Y., Wang, Y., Tan, S., Li, Z., Yuan, Z., Glanc, M., … Zhang, J. (2020). Root growth adaptation is mediated by PYLs ABA receptor-PP2A protein phosphatase complex. Advanced Science. Wiley. https://doi.org/10.1002/advs.201901455 chicago: Li, Yang, Yaping Wang, Shutang Tan, Zhen Li, Zhi Yuan, Matous Glanc, David Domjan, et al. “Root Growth Adaptation Is Mediated by PYLs ABA Receptor-PP2A Protein Phosphatase Complex.” Advanced Science. Wiley, 2020. https://doi.org/10.1002/advs.201901455. ieee: Y. Li et al., “Root growth adaptation is mediated by PYLs ABA receptor-PP2A protein phosphatase complex,” Advanced Science, vol. 7, no. 3. Wiley, 2020. ista: Li Y, Wang Y, Tan S, Li Z, Yuan Z, Glanc M, Domjan D, Wang K, Xuan W, Guo Y, Gong Z, Friml J, Zhang J. 2020. Root growth adaptation is mediated by PYLs ABA receptor-PP2A protein phosphatase complex. Advanced Science. 7(3), 1901455. mla: Li, Yang, et al. “Root Growth Adaptation Is Mediated by PYLs ABA Receptor-PP2A Protein Phosphatase Complex.” Advanced Science, vol. 7, no. 3, 1901455, Wiley, 2020, doi:10.1002/advs.201901455. short: Y. Li, Y. Wang, S. Tan, Z. Li, Z. Yuan, M. Glanc, D. Domjan, K. Wang, W. Xuan, Y. Guo, Z. Gong, J. Friml, J. Zhang, Advanced Science 7 (2020). date_created: 2019-12-22T23:00:43Z date_published: 2020-02-05T00:00:00Z date_updated: 2023-08-17T14:13:17Z day: '05' ddc: - '580' department: - _id: JiFr doi: 10.1002/advs.201901455 external_id: isi: - '000501912800001' pmid: - '32042554' file: - access_level: open_access checksum: 016eeab5860860af038e2da95ffe75c3 content_type: application/pdf creator: dernst date_created: 2020-02-24T14:29:54Z date_updated: 2020-07-14T12:47:53Z file_id: '7519' file_name: 2020_AdvScience_Li.pdf file_size: 3586924 relation: main_file file_date_updated: 2020-07-14T12:47:53Z has_accepted_license: '1' intvolume: ' 7' isi: 1 issue: '3' language: - iso: eng month: '02' oa: 1 oa_version: Published Version pmid: 1 publication: Advanced Science publication_identifier: eissn: - 2198-3844 publication_status: published publisher: Wiley quality_controlled: '1' scopus_import: '1' status: public title: Root growth adaptation is mediated by PYLs ABA receptor-PP2A protein phosphatase complex tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 7 year: '2020' ... --- _id: '7220' abstract: - lang: eng text: BACKGROUND:The introduction of image-guided methods to bypass surgery has resulted in optimized preoperative identification of the recipients and excellent patency rates. However, the recently presented methods have also been resource-consuming. In the present study, we have reported a cost-efficient planning workflow for extracranial-intracranial (EC-IC) revascularization combined with transdural indocyanine green videoangiography (tICG-VA). METHODS:We performed a retrospective review at a single tertiary referral center from 2011 to 2018. A novel software-derived workflow was applied for 25 of 92 bypass procedures during the study period. The precision and accuracy were assessed using tICG-VA identification of the cortical recipients and a comparison of the virtual and actual data. The data from a control group of 25 traditionally planned procedures were also matched. RESULTS:The intraoperative transfer time of the calculated coordinates averaged 0.8 minute (range, 0.4-1.9 minutes). The definitive recipients matched the targeted branches in 80%, and a neighboring branch was used in 16%. Our workflow led to a significant craniotomy size reduction in the study group compared with that in the control group (P = 0.005). tICG-VA was successfully applied in 19 cases. An average of 2 potential recipient arteries were identified transdurally, resulting in tailored durotomy and 3 craniotomy adjustments. Follow-up patency results were available for 49 bypass surgeries, comprising 54 grafts. The overall patency rate was 91% at a median follow-up period of 26 months. No significant difference was found in the patency rate between the study and control groups (P = 0.317). CONCLUSIONS:Our clinical results have validated the presented planning and surgical workflow and support the routine implementation of tICG-VA for recipient identification before durotomy. article_processing_charge: No article_type: original author: - first_name: Philippe full_name: Dodier, Philippe last_name: Dodier - first_name: Thomas full_name: Auzinger, Thomas id: 4718F954-F248-11E8-B48F-1D18A9856A87 last_name: Auzinger orcid: 0000-0002-1546-3265 - first_name: Gabriel full_name: Mistelbauer, Gabriel last_name: Mistelbauer - first_name: Wei Te full_name: Wang, Wei Te last_name: Wang - first_name: Heber full_name: Ferraz-Leite, Heber last_name: Ferraz-Leite - first_name: Andreas full_name: Gruber, Andreas last_name: Gruber - first_name: Wolfgang full_name: Marik, Wolfgang last_name: Marik - first_name: Fabian full_name: Winter, Fabian last_name: Winter - first_name: Gerrit full_name: Fischer, Gerrit last_name: Fischer - first_name: Josa M. full_name: Frischer, Josa M. last_name: Frischer - first_name: Gerhard full_name: Bavinzski, Gerhard last_name: Bavinzski citation: ama: Dodier P, Auzinger T, Mistelbauer G, et al. Novel software-derived workflow in extracranial–intracranial bypass surgery validated by transdural indocyanine green videoangiography. World Neurosurgery. 2020;134(2):e892-e902. doi:10.1016/j.wneu.2019.11.038 apa: Dodier, P., Auzinger, T., Mistelbauer, G., Wang, W. T., Ferraz-Leite, H., Gruber, A., … Bavinzski, G. (2020). Novel software-derived workflow in extracranial–intracranial bypass surgery validated by transdural indocyanine green videoangiography. World Neurosurgery. Elsevier. https://doi.org/10.1016/j.wneu.2019.11.038 chicago: Dodier, Philippe, Thomas Auzinger, Gabriel Mistelbauer, Wei Te Wang, Heber Ferraz-Leite, Andreas Gruber, Wolfgang Marik, et al. “Novel Software-Derived Workflow in Extracranial–Intracranial Bypass Surgery Validated by Transdural Indocyanine Green Videoangiography.” World Neurosurgery. Elsevier, 2020. https://doi.org/10.1016/j.wneu.2019.11.038. ieee: P. Dodier et al., “Novel software-derived workflow in extracranial–intracranial bypass surgery validated by transdural indocyanine green videoangiography,” World Neurosurgery, vol. 134, no. 2. Elsevier, pp. e892–e902, 2020. ista: Dodier P, Auzinger T, Mistelbauer G, Wang WT, Ferraz-Leite H, Gruber A, Marik W, Winter F, Fischer G, Frischer JM, Bavinzski G. 2020. Novel software-derived workflow in extracranial–intracranial bypass surgery validated by transdural indocyanine green videoangiography. World Neurosurgery. 134(2), e892–e902. mla: Dodier, Philippe, et al. “Novel Software-Derived Workflow in Extracranial–Intracranial Bypass Surgery Validated by Transdural Indocyanine Green Videoangiography.” World Neurosurgery, vol. 134, no. 2, Elsevier, 2020, pp. e892–902, doi:10.1016/j.wneu.2019.11.038. short: P. Dodier, T. Auzinger, G. Mistelbauer, W.T. Wang, H. Ferraz-Leite, A. Gruber, W. Marik, F. Winter, G. Fischer, J.M. Frischer, G. Bavinzski, World Neurosurgery 134 (2020) e892–e902. date_created: 2019-12-29T23:00:48Z date_published: 2020-02-01T00:00:00Z date_updated: 2023-08-17T14:14:23Z day: '01' department: - _id: BeBi doi: 10.1016/j.wneu.2019.11.038 external_id: isi: - '000512878200104' pmid: - '31733380' intvolume: ' 134' isi: 1 issue: '2' language: - iso: eng month: '02' oa_version: None page: e892-e902 pmid: 1 publication: World Neurosurgery publication_identifier: eissn: - 1878-8769 issn: - 1878-8750 publication_status: published publisher: Elsevier quality_controlled: '1' scopus_import: '1' status: public title: Novel software-derived workflow in extracranial–intracranial bypass surgery validated by transdural indocyanine green videoangiography type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 134 year: '2020' ... --- _id: '7142' abstract: - lang: eng text: The phytohormone auxin acts as an amazingly versatile coordinator of plant growth and development. With its morphogen-like properties, auxin controls sites and timing of differentiation and/or growth responses both, in quantitative and qualitative terms. Specificity in the auxin response depends largely on distinct modes of signal transmission, by which individual cells perceive and convert auxin signals into a remarkable diversity of responses. The best understood, or so-called canonical mechanism of auxin perception ultimately results in variable adjustments of the cellular transcriptome, via a short, nuclear signal transduction pathway. Additional findings that accumulated over decades implied that an additional, presumably, cell surface-based auxin perception mechanism mediates very rapid cellular responses and decisively contributes to the cell's overall hormonal response. Recent investigations into both, nuclear and cell surface auxin signalling challenged this assumed partition of roles for different auxin signalling pathways and revealed an unexpected complexity in transcriptional and non-transcriptional cellular responses mediated by auxin. acknowledgement: Research in J.F. laboratory is funded by the European Union's Horizon 2020 program (ERC grant agreement n° 742985); C.L. is supported by the Austrian Science Fund (FWF grant P 31493). article_processing_charge: No article_type: original author: - first_name: Michelle C full_name: Gallei, Michelle C id: 35A03822-F248-11E8-B48F-1D18A9856A87 last_name: Gallei orcid: 0000-0003-1286-7368 - first_name: Christian full_name: Luschnig, Christian last_name: Luschnig - first_name: Jiří full_name: Friml, Jiří id: 4159519E-F248-11E8-B48F-1D18A9856A87 last_name: Friml orcid: 0000-0002-8302-7596 citation: ama: 'Gallei MC, Luschnig C, Friml J. Auxin signalling in growth: Schrödinger’s cat out of the bag. Current Opinion in Plant Biology. 2020;53(2):43-49. doi:10.1016/j.pbi.2019.10.003' apa: 'Gallei, M. C., Luschnig, C., & Friml, J. (2020). Auxin signalling in growth: Schrödinger’s cat out of the bag. Current Opinion in Plant Biology. Elsevier. https://doi.org/10.1016/j.pbi.2019.10.003' chicago: 'Gallei, Michelle C, Christian Luschnig, and Jiří Friml. “Auxin Signalling in Growth: Schrödinger’s Cat out of the Bag.” Current Opinion in Plant Biology. Elsevier, 2020. https://doi.org/10.1016/j.pbi.2019.10.003.' ieee: 'M. C. Gallei, C. Luschnig, and J. Friml, “Auxin signalling in growth: Schrödinger’s cat out of the bag,” Current Opinion in Plant Biology, vol. 53, no. 2. Elsevier, pp. 43–49, 2020.' ista: 'Gallei MC, Luschnig C, Friml J. 2020. Auxin signalling in growth: Schrödinger’s cat out of the bag. Current Opinion in Plant Biology. 53(2), 43–49.' mla: 'Gallei, Michelle C., et al. “Auxin Signalling in Growth: Schrödinger’s Cat out of the Bag.” Current Opinion in Plant Biology, vol. 53, no. 2, Elsevier, 2020, pp. 43–49, doi:10.1016/j.pbi.2019.10.003.' short: M.C. Gallei, C. Luschnig, J. Friml, Current Opinion in Plant Biology 53 (2020) 43–49. date_created: 2019-12-02T12:05:26Z date_published: 2020-02-01T00:00:00Z date_updated: 2023-08-17T14:07:22Z day: '01' department: - _id: JiFr doi: 10.1016/j.pbi.2019.10.003 ec_funded: 1 external_id: isi: - '000521120600007' pmid: - '31760231' intvolume: ' 53' isi: 1 issue: '2' language: - iso: eng month: '02' oa_version: None page: 43-49 pmid: 1 project: - _id: 261099A6-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '742985' name: Tracing Evolution of Auxin Transport and Polarity in Plants publication: Current Opinion in Plant Biology publication_identifier: eissn: - 1879-0356 issn: - 1369-5266 publication_status: published publisher: Elsevier quality_controlled: '1' related_material: record: - id: '11626' relation: dissertation_contains status: public scopus_import: '1' status: public title: 'Auxin signalling in growth: Schrödinger''s cat out of the bag' type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 53 year: '2020' ... --- _id: '7166' abstract: - lang: eng text: In the living cell, we encounter a large variety of motile processes such as organelle transport and cytoskeleton remodeling. These processes are driven by motor proteins that generate force by transducing chemical free energy into mechanical work. In many cases, the molecular motors work in teams to collectively generate larger forces. Recent optical trapping experiments on small teams of cytoskeletal motors indicated that the collectively generated force increases with the size of the motor team but that this increase depends on the motor type and on whether the motors are studied in vitro or in vivo. Here, we use the theory of stochastic processes to describe the motion of N motors in a stationary optical trap and to compute the N-dependence of the collectively generated forces. We consider six distinct motor types, two kinesins, two dyneins, and two myosins. We show that the force increases always linearly with N but with a prefactor that depends on the performance of the single motor. Surprisingly, this prefactor increases for weaker motors with a lower stall force. This counter-intuitive behavior reflects the increased probability with which stronger motors detach from the filament during strain generation. Our theoretical results are in quantitative agreement with experimental data on small teams of kinesin-1 motors. article_processing_charge: No article_type: letter_note author: - first_name: Mehmet C full_name: Ucar, Mehmet C id: 50B2A802-6007-11E9-A42B-EB23E6697425 last_name: Ucar orcid: 0000-0003-0506-4217 - first_name: Reinhard full_name: Lipowsky, Reinhard last_name: Lipowsky citation: ama: Ucar MC, Lipowsky R. Collective force generation by molecular motors is determined by strain-induced unbinding. Nano Letters. 2020;20(1):669-676. doi:10.1021/acs.nanolett.9b04445 apa: Ucar, M. C., & Lipowsky, R. (2020). Collective force generation by molecular motors is determined by strain-induced unbinding. Nano Letters. American Chemical Society. https://doi.org/10.1021/acs.nanolett.9b04445 chicago: Ucar, Mehmet C, and Reinhard Lipowsky. “Collective Force Generation by Molecular Motors Is Determined by Strain-Induced Unbinding.” Nano Letters. American Chemical Society, 2020. https://doi.org/10.1021/acs.nanolett.9b04445. ieee: M. C. Ucar and R. Lipowsky, “Collective force generation by molecular motors is determined by strain-induced unbinding,” Nano Letters, vol. 20, no. 1. American Chemical Society, pp. 669–676, 2020. ista: Ucar MC, Lipowsky R. 2020. Collective force generation by molecular motors is determined by strain-induced unbinding. Nano Letters. 20(1), 669–676. mla: Ucar, Mehmet C., and Reinhard Lipowsky. “Collective Force Generation by Molecular Motors Is Determined by Strain-Induced Unbinding.” Nano Letters, vol. 20, no. 1, American Chemical Society, 2020, pp. 669–76, doi:10.1021/acs.nanolett.9b04445. short: M.C. Ucar, R. Lipowsky, Nano Letters 20 (2020) 669–676. date_created: 2019-12-10T15:36:05Z date_published: 2020-01-08T00:00:00Z date_updated: 2023-08-17T14:07:52Z day: '08' department: - _id: EdHa doi: 10.1021/acs.nanolett.9b04445 external_id: isi: - '000507151600087' pmid: - '31797672' intvolume: ' 20' isi: 1 issue: '1' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1021/acs.nanolett.9b04445 month: '01' oa: 1 oa_version: Published Version page: 669-676 pmid: 1 publication: Nano Letters publication_identifier: eissn: - 1530-6992 issn: - 1530-6984 publication_status: published publisher: American Chemical Society quality_controlled: '1' related_material: record: - id: '9726' relation: research_data status: public - id: '9885' relation: research_data status: public scopus_import: '1' status: public title: Collective force generation by molecular motors is determined by strain-induced unbinding type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 20 year: '2020' ... --- _id: '9885' abstract: - lang: eng text: Data obtained from the fine-grained simulations used in Figures 2-5, data obtained from the coarse-grained numerical calculations used in Figure 6, and a sample script for the fine-grained simulation as a Jupyter notebook (ZIP) article_processing_charge: No author: - first_name: Mehmet C full_name: Ucar, Mehmet C id: 50B2A802-6007-11E9-A42B-EB23E6697425 last_name: Ucar orcid: 0000-0003-0506-4217 - first_name: Reinhard full_name: Lipowsky, Reinhard last_name: Lipowsky citation: ama: Ucar MC, Lipowsky R. MURL_Dataz. 2020. doi:10.1021/acs.nanolett.9b04445.s002 apa: Ucar, M. C., & Lipowsky, R. (2020). MURL_Dataz. American Chemical Society . https://doi.org/10.1021/acs.nanolett.9b04445.s002 chicago: Ucar, Mehmet C, and Reinhard Lipowsky. “MURL_Dataz.” American Chemical Society , 2020. https://doi.org/10.1021/acs.nanolett.9b04445.s002. ieee: M. C. Ucar and R. Lipowsky, “MURL_Dataz.” American Chemical Society , 2020. ista: Ucar MC, Lipowsky R. 2020. MURL_Dataz, American Chemical Society , 10.1021/acs.nanolett.9b04445.s002. mla: Ucar, Mehmet C., and Reinhard Lipowsky. MURL_Dataz. American Chemical Society , 2020, doi:10.1021/acs.nanolett.9b04445.s002. short: M.C. Ucar, R. Lipowsky, (2020). date_created: 2021-08-11T13:16:03Z date_published: 2020-01-08T00:00:00Z date_updated: 2023-08-17T14:07:52Z day: '08' department: - _id: EdHa doi: 10.1021/acs.nanolett.9b04445.s002 month: '01' oa_version: Published Version publisher: 'American Chemical Society ' related_material: record: - id: '7166' relation: used_in_publication status: public status: public title: MURL_Dataz type: research_data_reference user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf year: '2020' ... --- _id: '7218' abstract: - lang: eng text: The combined resection of skull-infiltrating tumours and immediate cranioplastic reconstruction predominantly relies on freehand-moulded solutions. Techniques that enable this procedure to be performed easily in routine clinical practice would be useful. A cadaveric study was developed in which a new software tool was used to perform single-stage reconstructions with prefabricated implants after the resection of skull-infiltrating pathologies. A novel 3D visualization and interaction framework was developed to create 10 virtual craniotomies in five cadaveric specimens. Polyether ether ketone (PEEK) implants were manufactured according to the bone defects. The image-guided craniotomy was reconstructed with PEEK and compared to polymethyl methacrylate (PMMA). Navigational accuracy and surgical precision were assessed. The PEEK workflow resulted in up to 10-fold shorter reconstruction times than the standard technique. Surgical precision was reflected by the mean 1.1 ± 0.29 mm distance between the virtual and real craniotomy, with submillimetre precision in 50%. Assessment of the global offset between virtual and actual craniotomy revealed an average shift of 4.5 ± 3.6 mm. The results validated the ‘elective single-stage cranioplasty’ technique as a state-of-the-art virtual planning method and surgical workflow. This patient-tailored workflow could significantly reduce surgical times compared to the traditional, intraoperative acrylic moulding method and may be an option for the reconstruction of bone defects in the craniofacial region. article_processing_charge: No article_type: original author: - first_name: Philippe full_name: Dodier, Philippe last_name: Dodier - first_name: Fabian full_name: Winter, Fabian last_name: Winter - first_name: Thomas full_name: Auzinger, Thomas id: 4718F954-F248-11E8-B48F-1D18A9856A87 last_name: Auzinger orcid: 0000-0002-1546-3265 - first_name: Gabriel full_name: Mistelbauer, Gabriel last_name: Mistelbauer - first_name: Josa M. full_name: Frischer, Josa M. last_name: Frischer - first_name: Wei Te full_name: Wang, Wei Te last_name: Wang - first_name: Ammar full_name: Mallouhi, Ammar last_name: Mallouhi - first_name: Wolfgang full_name: Marik, Wolfgang last_name: Marik - first_name: Stefan full_name: Wolfsberger, Stefan last_name: Wolfsberger - first_name: Lukas full_name: Reissig, Lukas last_name: Reissig - first_name: Firas full_name: Hammadi, Firas last_name: Hammadi - first_name: Christian full_name: Matula, Christian last_name: Matula - first_name: Arnulf full_name: Baumann, Arnulf last_name: Baumann - first_name: Gerhard full_name: Bavinzski, Gerhard last_name: Bavinzski citation: ama: 'Dodier P, Winter F, Auzinger T, et al. Single-stage bone resection and cranioplastic reconstruction: Comparison of a novel software-derived PEEK workflow with the standard reconstructive method. International Journal of Oral and Maxillofacial Surgery. 2020;49(8):P1007-1015. doi:10.1016/j.ijom.2019.11.011' apa: 'Dodier, P., Winter, F., Auzinger, T., Mistelbauer, G., Frischer, J. M., Wang, W. T., … Bavinzski, G. (2020). Single-stage bone resection and cranioplastic reconstruction: Comparison of a novel software-derived PEEK workflow with the standard reconstructive method. International Journal of Oral and Maxillofacial Surgery. Elsevier. https://doi.org/10.1016/j.ijom.2019.11.011' chicago: 'Dodier, Philippe, Fabian Winter, Thomas Auzinger, Gabriel Mistelbauer, Josa M. Frischer, Wei Te Wang, Ammar Mallouhi, et al. “Single-Stage Bone Resection and Cranioplastic Reconstruction: Comparison of a Novel Software-Derived PEEK Workflow with the Standard Reconstructive Method.” International Journal of Oral and Maxillofacial Surgery. Elsevier, 2020. https://doi.org/10.1016/j.ijom.2019.11.011.' ieee: 'P. Dodier et al., “Single-stage bone resection and cranioplastic reconstruction: Comparison of a novel software-derived PEEK workflow with the standard reconstructive method,” International Journal of Oral and Maxillofacial Surgery, vol. 49, no. 8. Elsevier, pp. P1007-1015, 2020.' ista: 'Dodier P, Winter F, Auzinger T, Mistelbauer G, Frischer JM, Wang WT, Mallouhi A, Marik W, Wolfsberger S, Reissig L, Hammadi F, Matula C, Baumann A, Bavinzski G. 2020. Single-stage bone resection and cranioplastic reconstruction: Comparison of a novel software-derived PEEK workflow with the standard reconstructive method. International Journal of Oral and Maxillofacial Surgery. 49(8), P1007-1015.' mla: 'Dodier, Philippe, et al. “Single-Stage Bone Resection and Cranioplastic Reconstruction: Comparison of a Novel Software-Derived PEEK Workflow with the Standard Reconstructive Method.” International Journal of Oral and Maxillofacial Surgery, vol. 49, no. 8, Elsevier, 2020, pp. P1007-1015, doi:10.1016/j.ijom.2019.11.011.' short: P. Dodier, F. Winter, T. Auzinger, G. Mistelbauer, J.M. Frischer, W.T. Wang, A. Mallouhi, W. Marik, S. Wolfsberger, L. Reissig, F. Hammadi, C. Matula, A. Baumann, G. Bavinzski, International Journal of Oral and Maxillofacial Surgery 49 (2020) P1007-1015. date_created: 2019-12-29T23:00:47Z date_published: 2020-08-01T00:00:00Z date_updated: 2023-08-17T14:15:22Z day: '01' department: - _id: BeBi doi: 10.1016/j.ijom.2019.11.011 external_id: isi: - '000556819800005' pmid: - '31866145' intvolume: ' 49' isi: 1 issue: '8' language: - iso: eng month: '08' oa_version: None page: P1007-1015 pmid: 1 publication: International Journal of Oral and Maxillofacial Surgery publication_identifier: eissn: - 1399-0020 issn: - 0901-5027 publication_status: published publisher: Elsevier quality_controlled: '1' scopus_import: '1' status: public title: 'Single-stage bone resection and cranioplastic reconstruction: Comparison of a novel software-derived PEEK workflow with the standard reconstructive method' type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 49 year: '2020' ... --- _id: '7219' abstract: - lang: eng text: Root system architecture (RSA), governed by the phytohormone auxin, endows plants with an adaptive advantage in particular environments. Using geographically representative arabidopsis (Arabidopsis thaliana) accessions as a resource for GWA mapping, Waidmann et al. and Ogura et al. recently identified two novel components involved in modulating auxin-mediated RSA and conferring plant fitness in particular habitats. article_processing_charge: No article_type: original author: - first_name: Guanghui full_name: Xiao, Guanghui last_name: Xiao - first_name: Yuzhou full_name: Zhang, Yuzhou id: 3B6137F2-F248-11E8-B48F-1D18A9856A87 last_name: Zhang orcid: 0000-0003-2627-6956 citation: ama: 'Xiao G, Zhang Y. Adaptive growth: Shaping auxin-mediated root system architecture. Trends in Plant Science. 2020;25(2):P121-123. doi:10.1016/j.tplants.2019.12.001' apa: 'Xiao, G., & Zhang, Y. (2020). Adaptive growth: Shaping auxin-mediated root system architecture. Trends in Plant Science. Elsevier. https://doi.org/10.1016/j.tplants.2019.12.001' chicago: 'Xiao, Guanghui, and Yuzhou Zhang. “Adaptive Growth: Shaping Auxin-Mediated Root System Architecture.” Trends in Plant Science. Elsevier, 2020. https://doi.org/10.1016/j.tplants.2019.12.001.' ieee: 'G. Xiao and Y. Zhang, “Adaptive growth: Shaping auxin-mediated root system architecture,” Trends in Plant Science, vol. 25, no. 2. Elsevier, pp. P121-123, 2020.' ista: 'Xiao G, Zhang Y. 2020. Adaptive growth: Shaping auxin-mediated root system architecture. Trends in Plant Science. 25(2), P121-123.' mla: 'Xiao, Guanghui, and Yuzhou Zhang. “Adaptive Growth: Shaping Auxin-Mediated Root System Architecture.” Trends in Plant Science, vol. 25, no. 2, Elsevier, 2020, pp. P121-123, doi:10.1016/j.tplants.2019.12.001.' short: G. Xiao, Y. Zhang, Trends in Plant Science 25 (2020) P121-123. date_created: 2019-12-29T23:00:48Z date_published: 2020-02-01T00:00:00Z date_updated: 2023-08-17T14:14:50Z day: '01' department: - _id: JiFr doi: 10.1016/j.tplants.2019.12.001 external_id: isi: - '000508637500001' pmid: - '31843370' intvolume: ' 25' isi: 1 issue: '2' language: - iso: eng month: '02' oa_version: None page: P121-123 pmid: 1 publication: Trends in Plant Science publication_identifier: issn: - '13601385' publication_status: published publisher: Elsevier quality_controlled: '1' scopus_import: '1' status: public title: 'Adaptive growth: Shaping auxin-mediated root system architecture' type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 25 year: '2020' ... --- _id: '7234' abstract: - lang: eng text: T lymphocytes utilize amoeboid migration to navigate effectively within complex microenvironments. The precise rearrangement of the actin cytoskeleton required for cellular forward propulsion is mediated by actin regulators, including the actin‐related protein 2/3 (Arp2/3) complex, a macromolecular machine that nucleates branched actin filaments at the leading edge. The consequences of modulating Arp2/3 activity on the biophysical properties of the actomyosin cortex and downstream T cell function are incompletely understood. We report that even a moderate decrease of Arp3 levels in T cells profoundly affects actin cortex integrity. Reduction in total F‐actin content leads to reduced cortical tension and disrupted lamellipodia formation. Instead, in Arp3‐knockdown cells, the motility mode is dominated by blebbing migration characterized by transient, balloon‐like protrusions at the leading edge. Although this migration mode seems to be compatible with interstitial migration in three‐dimensional environments, diminished locomotion kinetics and impaired cytotoxicity interfere with optimal T cell function. These findings define the importance of finely tuned, Arp2/3‐dependent mechanophysical membrane integrity in cytotoxic effector T lymphocyte activities. article_processing_charge: No article_type: original author: - first_name: Peyman full_name: Obeidy, Peyman last_name: Obeidy - first_name: Lining A. full_name: Ju, Lining A. last_name: Ju - first_name: Stefan H. full_name: Oehlers, Stefan H. last_name: Oehlers - first_name: Nursafwana S. full_name: Zulkhernain, Nursafwana S. last_name: Zulkhernain - first_name: Quintin full_name: Lee, Quintin last_name: Lee - first_name: Jorge L. full_name: Galeano Niño, Jorge L. last_name: Galeano Niño - first_name: Rain Y.Q. full_name: Kwan, Rain Y.Q. last_name: Kwan - first_name: Shweta full_name: Tikoo, Shweta last_name: Tikoo - first_name: Lois L. full_name: Cavanagh, Lois L. last_name: Cavanagh - first_name: Paulus full_name: Mrass, Paulus last_name: Mrass - first_name: Adam J.L. full_name: Cook, Adam J.L. last_name: Cook - first_name: Shaun P. full_name: Jackson, Shaun P. last_name: Jackson - first_name: Maté full_name: Biro, Maté last_name: Biro - first_name: Ben full_name: Roediger, Ben last_name: Roediger - first_name: Michael K full_name: Sixt, Michael K id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87 last_name: Sixt orcid: 0000-0002-6620-9179 - first_name: Wolfgang full_name: Weninger, Wolfgang last_name: Weninger citation: ama: Obeidy P, Ju LA, Oehlers SH, et al. Partial loss of actin nucleator actin-related protein 2/3 activity triggers blebbing in primary T lymphocytes. Immunology and Cell Biology. 2020;98(2):93-113. doi:10.1111/imcb.12304 apa: Obeidy, P., Ju, L. A., Oehlers, S. H., Zulkhernain, N. S., Lee, Q., Galeano Niño, J. L., … Weninger, W. (2020). Partial loss of actin nucleator actin-related protein 2/3 activity triggers blebbing in primary T lymphocytes. Immunology and Cell Biology. Wiley. https://doi.org/10.1111/imcb.12304 chicago: Obeidy, Peyman, Lining A. Ju, Stefan H. Oehlers, Nursafwana S. Zulkhernain, Quintin Lee, Jorge L. Galeano Niño, Rain Y.Q. Kwan, et al. “Partial Loss of Actin Nucleator Actin-Related Protein 2/3 Activity Triggers Blebbing in Primary T Lymphocytes.” Immunology and Cell Biology. Wiley, 2020. https://doi.org/10.1111/imcb.12304. ieee: P. Obeidy et al., “Partial loss of actin nucleator actin-related protein 2/3 activity triggers blebbing in primary T lymphocytes,” Immunology and Cell Biology, vol. 98, no. 2. Wiley, pp. 93–113, 2020. ista: Obeidy P, Ju LA, Oehlers SH, Zulkhernain NS, Lee Q, Galeano Niño JL, Kwan RYQ, Tikoo S, Cavanagh LL, Mrass P, Cook AJL, Jackson SP, Biro M, Roediger B, Sixt MK, Weninger W. 2020. Partial loss of actin nucleator actin-related protein 2/3 activity triggers blebbing in primary T lymphocytes. Immunology and Cell Biology. 98(2), 93–113. mla: Obeidy, Peyman, et al. “Partial Loss of Actin Nucleator Actin-Related Protein 2/3 Activity Triggers Blebbing in Primary T Lymphocytes.” Immunology and Cell Biology, vol. 98, no. 2, Wiley, 2020, pp. 93–113, doi:10.1111/imcb.12304. short: P. Obeidy, L.A. Ju, S.H. Oehlers, N.S. Zulkhernain, Q. Lee, J.L. Galeano Niño, R.Y.Q. Kwan, S. Tikoo, L.L. Cavanagh, P. Mrass, A.J.L. Cook, S.P. Jackson, M. Biro, B. Roediger, M.K. Sixt, W. Weninger, Immunology and Cell Biology 98 (2020) 93–113. date_created: 2020-01-05T23:00:48Z date_published: 2020-02-01T00:00:00Z date_updated: 2023-08-17T14:21:12Z day: '01' ddc: - '570' department: - _id: MiSi doi: 10.1111/imcb.12304 external_id: isi: - '000503885600001' pmid: - '31698518' file: - access_level: open_access checksum: c389477b4b52172ef76afff8a06c6775 content_type: application/pdf creator: dernst date_created: 2020-11-19T11:22:33Z date_updated: 2020-11-19T11:22:33Z file_id: '8775' file_name: 2020_ImmunologyCellBio_Obeidy.pdf file_size: 8569945 relation: main_file success: 1 file_date_updated: 2020-11-19T11:22:33Z has_accepted_license: '1' intvolume: ' 98' isi: 1 issue: '2' language: - iso: eng month: '02' oa: 1 oa_version: Published Version page: 93-113 pmid: 1 publication: Immunology and Cell Biology publication_identifier: eissn: - '14401711' issn: - '08189641' publication_status: published publisher: Wiley quality_controlled: '1' scopus_import: '1' status: public title: Partial loss of actin nucleator actin-related protein 2/3 activity triggers blebbing in primary T lymphocytes tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 98 year: '2020' ... --- _id: '7253' abstract: - lang: eng text: The cyclin-dependent kinase inhibitor p57KIP2 is encoded by the imprinted Cdkn1c locus, exhibits maternal expression, and is essential for cerebral cortex development. How Cdkn1c regulates corticogenesis is however not clear. To this end we employ Mosaic Analysis with Double Markers (MADM) technology to genetically dissect Cdkn1c gene function in corticogenesis at single cell resolution. We find that the previously described growth-inhibitory Cdkn1c function is a non-cell-autonomous one, acting on the whole organism. In contrast we reveal a growth-promoting cell-autonomous Cdkn1c function which at the mechanistic level mediates radial glial progenitor cell and nascent projection neuron survival. Strikingly, the growth-promoting function of Cdkn1c is highly dosage sensitive but not subject to genomic imprinting. Collectively, our results suggest that the Cdkn1c locus regulates cortical development through distinct cell-autonomous and non-cell-autonomous mechanisms. More generally, our study highlights the importance to probe the relative contributions of cell intrinsic gene function and tissue-wide mechanisms to the overall phenotype. acknowledged_ssus: - _id: PreCl article_number: '195' article_processing_charge: No article_type: original author: - first_name: Susanne full_name: Laukoter, Susanne id: 2D6B7A9A-F248-11E8-B48F-1D18A9856A87 last_name: Laukoter orcid: 0000-0002-7903-3010 - first_name: Robert J full_name: Beattie, Robert J id: 2E26DF60-F248-11E8-B48F-1D18A9856A87 last_name: Beattie orcid: 0000-0002-8483-8753 - first_name: Florian full_name: Pauler, Florian id: 48EA0138-F248-11E8-B48F-1D18A9856A87 last_name: Pauler orcid: 0000-0002-7462-0048 - first_name: Nicole full_name: Amberg, Nicole id: 4CD6AAC6-F248-11E8-B48F-1D18A9856A87 last_name: Amberg orcid: 0000-0002-3183-8207 - first_name: Keiichi I. full_name: Nakayama, Keiichi I. last_name: Nakayama - first_name: Simon full_name: Hippenmeyer, Simon id: 37B36620-F248-11E8-B48F-1D18A9856A87 last_name: Hippenmeyer orcid: 0000-0003-2279-1061 citation: ama: Laukoter S, Beattie RJ, Pauler F, Amberg N, Nakayama KI, Hippenmeyer S. Imprinted Cdkn1c genomic locus cell-autonomously promotes cell survival in cerebral cortex development. Nature Communications. 2020;11. doi:10.1038/s41467-019-14077-2 apa: Laukoter, S., Beattie, R. J., Pauler, F., Amberg, N., Nakayama, K. I., & Hippenmeyer, S. (2020). Imprinted Cdkn1c genomic locus cell-autonomously promotes cell survival in cerebral cortex development. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-019-14077-2 chicago: Laukoter, Susanne, Robert J Beattie, Florian Pauler, Nicole Amberg, Keiichi I. Nakayama, and Simon Hippenmeyer. “Imprinted Cdkn1c Genomic Locus Cell-Autonomously Promotes Cell Survival in Cerebral Cortex Development.” Nature Communications. Springer Nature, 2020. https://doi.org/10.1038/s41467-019-14077-2. ieee: S. Laukoter, R. J. Beattie, F. Pauler, N. Amberg, K. I. Nakayama, and S. Hippenmeyer, “Imprinted Cdkn1c genomic locus cell-autonomously promotes cell survival in cerebral cortex development,” Nature Communications, vol. 11. Springer Nature, 2020. ista: Laukoter S, Beattie RJ, Pauler F, Amberg N, Nakayama KI, Hippenmeyer S. 2020. Imprinted Cdkn1c genomic locus cell-autonomously promotes cell survival in cerebral cortex development. Nature Communications. 11, 195. mla: Laukoter, Susanne, et al. “Imprinted Cdkn1c Genomic Locus Cell-Autonomously Promotes Cell Survival in Cerebral Cortex Development.” Nature Communications, vol. 11, 195, Springer Nature, 2020, doi:10.1038/s41467-019-14077-2. short: S. Laukoter, R.J. Beattie, F. Pauler, N. Amberg, K.I. Nakayama, S. Hippenmeyer, Nature Communications 11 (2020). date_created: 2020-01-11T10:42:48Z date_published: 2020-01-10T00:00:00Z date_updated: 2023-08-17T14:23:41Z day: '10' ddc: - '570' department: - _id: SiHi doi: 10.1038/s41467-019-14077-2 ec_funded: 1 external_id: isi: - '000551459000005' file: - access_level: open_access checksum: ebf1ed522f4e0be8d94c939c1806a709 content_type: application/pdf creator: dernst date_created: 2020-01-13T07:42:31Z date_updated: 2020-07-14T12:47:54Z file_id: '7261' file_name: 2020_NatureComm_Laukoter.pdf file_size: 8063333 relation: main_file file_date_updated: 2020-07-14T12:47:54Z has_accepted_license: '1' intvolume: ' 11' isi: 1 language: - iso: eng month: '01' oa: 1 oa_version: Published Version project: - _id: 268F8446-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: T0101031 name: Role of Eed in neural stem cell lineage progression - _id: 264E56E2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: M02416 name: Molecular Mechanisms Regulating Gliogenesis in the Cerebral Cortex - _id: 260018B0-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '725780' name: Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development - _id: 25D92700-B435-11E9-9278-68D0E5697425 grant_number: LS13-002 name: Mapping Cell-Type Specificity of the Genomic Imprintome in the Brain publication: Nature Communications publication_identifier: issn: - 2041-1723 publication_status: published publisher: Springer Nature quality_controlled: '1' related_material: link: - description: News on IST Homepage relation: press_release url: https://ist.ac.at/en/news/new-function-for-potential-tumour-suppressor-in-brain-development/ scopus_import: '1' status: public title: Imprinted Cdkn1c genomic locus cell-autonomously promotes cell survival in cerebral cortex development tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 11 year: '2020' ... --- _id: '7339' abstract: - lang: eng text: Cytoskeletal filaments such as microtubules (MTs) and filamentous actin (F-actin) dynamically support cell structure and functions. In central presynaptic terminals, F-actin is expressed along the release edge and reportedly plays diverse functional roles, but whether axonal MTs extend deep into terminals and play any physiological role remains controversial. At the calyx of Held in rats of either sex, confocal and high-resolution microscopy revealed that MTs enter deep into presynaptic terminal swellings and partially colocalize with a subset of synaptic vesicles (SVs). Electrophysiological analysis demonstrated that depolymerization of MTs specifically prolonged the slow-recovery time component of EPSCs from short-term depression induced by a train of high-frequency stimulation, whereas depolymerization of F-actin specifically prolonged the fast-recovery component. In simultaneous presynaptic and postsynaptic action potential recordings, depolymerization of MTs or F-actin significantly impaired the fidelity of high-frequency neurotransmission. We conclude that MTs and F-actin differentially contribute to slow and fast SV replenishment, thereby maintaining high-frequency neurotransmission. article_processing_charge: No article_type: original author: - first_name: Lashmi full_name: Piriya Ananda Babu, Lashmi last_name: Piriya Ananda Babu - first_name: Han Ying full_name: Wang, Han Ying last_name: Wang - first_name: Kohgaku full_name: Eguchi, Kohgaku id: 2B7846DC-F248-11E8-B48F-1D18A9856A87 last_name: Eguchi orcid: 0000-0002-6170-2546 - first_name: Laurent full_name: Guillaud, Laurent last_name: Guillaud - first_name: Tomoyuki full_name: Takahashi, Tomoyuki last_name: Takahashi citation: ama: Piriya Ananda Babu L, Wang HY, Eguchi K, Guillaud L, Takahashi T. Microtubule and actin differentially regulate synaptic vesicle cycling to maintain high-frequency neurotransmission. Journal of neuroscience. 2020;40(1):131-142. doi:10.1523/JNEUROSCI.1571-19.2019 apa: Piriya Ananda Babu, L., Wang, H. Y., Eguchi, K., Guillaud, L., & Takahashi, T. (2020). Microtubule and actin differentially regulate synaptic vesicle cycling to maintain high-frequency neurotransmission. Journal of Neuroscience. Society for Neuroscience. https://doi.org/10.1523/JNEUROSCI.1571-19.2019 chicago: Piriya Ananda Babu, Lashmi, Han Ying Wang, Kohgaku Eguchi, Laurent Guillaud, and Tomoyuki Takahashi. “Microtubule and Actin Differentially Regulate Synaptic Vesicle Cycling to Maintain High-Frequency Neurotransmission.” Journal of Neuroscience. Society for Neuroscience, 2020. https://doi.org/10.1523/JNEUROSCI.1571-19.2019. ieee: L. Piriya Ananda Babu, H. Y. Wang, K. Eguchi, L. Guillaud, and T. Takahashi, “Microtubule and actin differentially regulate synaptic vesicle cycling to maintain high-frequency neurotransmission,” Journal of neuroscience, vol. 40, no. 1. Society for Neuroscience, pp. 131–142, 2020. ista: Piriya Ananda Babu L, Wang HY, Eguchi K, Guillaud L, Takahashi T. 2020. Microtubule and actin differentially regulate synaptic vesicle cycling to maintain high-frequency neurotransmission. Journal of neuroscience. 40(1), 131–142. mla: Piriya Ananda Babu, Lashmi, et al. “Microtubule and Actin Differentially Regulate Synaptic Vesicle Cycling to Maintain High-Frequency Neurotransmission.” Journal of Neuroscience, vol. 40, no. 1, Society for Neuroscience, 2020, pp. 131–42, doi:10.1523/JNEUROSCI.1571-19.2019. short: L. Piriya Ananda Babu, H.Y. Wang, K. Eguchi, L. Guillaud, T. Takahashi, Journal of Neuroscience 40 (2020) 131–142. date_created: 2020-01-19T23:00:38Z date_published: 2020-01-02T00:00:00Z date_updated: 2023-08-17T14:25:23Z day: '02' ddc: - '570' department: - _id: RySh doi: 10.1523/JNEUROSCI.1571-19.2019 external_id: isi: - '000505167600013' pmid: - '31767677' file: - access_level: open_access checksum: 92f5e8a47f454fc131fb94cd7f106e60 content_type: application/pdf creator: dernst date_created: 2020-01-20T14:44:10Z date_updated: 2020-07-14T12:47:56Z file_id: '7345' file_name: 2020_JourNeuroscience_Piriya.pdf file_size: 4460781 relation: main_file file_date_updated: 2020-07-14T12:47:56Z has_accepted_license: '1' intvolume: ' 40' isi: 1 issue: '1' language: - iso: eng month: '01' oa: 1 oa_version: Published Version page: 131-142 pmid: 1 publication: Journal of neuroscience publication_identifier: eissn: - '15292401' publication_status: published publisher: Society for Neuroscience quality_controlled: '1' scopus_import: '1' status: public title: Microtubule and actin differentially regulate synaptic vesicle cycling to maintain high-frequency neurotransmission tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 40 year: '2020' ... --- _id: '7350' abstract: - lang: eng text: The ability to sense environmental temperature and to coordinate growth and development accordingly, is critical to the reproductive success of plants. Flowering time is regulated at the level of gene expression by a complex network of factors that integrate environmental and developmental cues. One of the main players, involved in modulating flowering time in response to changes in ambient temperature is FLOWERING LOCUS M (FLM). FLM transcripts can undergo extensive alternative splicing producing multiple variants, of which FLM-β and FLM-δ are the most representative. While FLM-β codes for the flowering repressor FLM protein, translation of FLM-δ has the opposite effect on flowering. Here we show that the cyclin-dependent kinase G2 (CDKG2), together with its cognate cyclin, CYCLYN L1 (CYCL1) affects the alternative splicing of FLM, balancing the levels of FLM-β and FLM-δ across the ambient temperature range. In the absence of the CDKG2/CYCL1 complex, FLM-β expression is reduced while FLM-δ is increased in a temperature dependent manner and these changes are associated with an early flowering phenotype in the cdkg2 mutant lines. In addition, we found that transcript variants retaining the full FLM intron 1 are sequestered in the cell nucleus. Strikingly, FLM intron 1 splicing is also regulated by CDKG2/CYCL1. Our results provide evidence that temperature and CDKs regulate the alternative splicing of FLM, contributing to flowering time definition. article_number: '1680' article_processing_charge: No article_type: original author: - first_name: Candida full_name: Nibau, Candida last_name: Nibau - first_name: Marçal full_name: Gallemi, Marçal id: 460C6802-F248-11E8-B48F-1D18A9856A87 last_name: Gallemi orcid: 0000-0003-4675-6893 - first_name: Despoina full_name: Dadarou, Despoina last_name: Dadarou - first_name: John H. full_name: Doonan, John H. last_name: Doonan - first_name: Nicola full_name: Cavallari, Nicola id: 457160E6-F248-11E8-B48F-1D18A9856A87 last_name: Cavallari citation: ama: Nibau C, Gallemi M, Dadarou D, Doonan JH, Cavallari N. Thermo-sensitive alternative splicing of FLOWERING LOCUS M is modulated by cyclin-dependent kinase G2. Frontiers in Plant Science. 2020;10. doi:10.3389/fpls.2019.01680 apa: Nibau, C., Gallemi, M., Dadarou, D., Doonan, J. H., & Cavallari, N. (2020). Thermo-sensitive alternative splicing of FLOWERING LOCUS M is modulated by cyclin-dependent kinase G2. Frontiers in Plant Science. Frontiers Media. https://doi.org/10.3389/fpls.2019.01680 chicago: Nibau, Candida, Marçal Gallemi, Despoina Dadarou, John H. Doonan, and Nicola Cavallari. “Thermo-Sensitive Alternative Splicing of FLOWERING LOCUS M Is Modulated by Cyclin-Dependent Kinase G2.” Frontiers in Plant Science. Frontiers Media, 2020. https://doi.org/10.3389/fpls.2019.01680. ieee: C. Nibau, M. Gallemi, D. Dadarou, J. H. Doonan, and N. Cavallari, “Thermo-sensitive alternative splicing of FLOWERING LOCUS M is modulated by cyclin-dependent kinase G2,” Frontiers in Plant Science, vol. 10. Frontiers Media, 2020. ista: Nibau C, Gallemi M, Dadarou D, Doonan JH, Cavallari N. 2020. Thermo-sensitive alternative splicing of FLOWERING LOCUS M is modulated by cyclin-dependent kinase G2. Frontiers in Plant Science. 10, 1680. mla: Nibau, Candida, et al. “Thermo-Sensitive Alternative Splicing of FLOWERING LOCUS M Is Modulated by Cyclin-Dependent Kinase G2.” Frontiers in Plant Science, vol. 10, 1680, Frontiers Media, 2020, doi:10.3389/fpls.2019.01680. short: C. Nibau, M. Gallemi, D. Dadarou, J.H. Doonan, N. Cavallari, Frontiers in Plant Science 10 (2020). date_created: 2020-01-22T15:23:57Z date_published: 2020-01-22T00:00:00Z date_updated: 2023-08-17T14:21:45Z day: '22' ddc: - '580' department: - _id: EvBe doi: 10.3389/fpls.2019.01680 external_id: isi: - '000511376000001' file: - access_level: open_access checksum: d1f92e60a713fbd15097ce895e5c7ccb content_type: application/pdf creator: dernst date_created: 2020-01-27T09:07:02Z date_updated: 2020-07-14T12:47:56Z file_id: '7366' file_name: 2020_FrontiersPlantScience_Nibau.pdf file_size: 1951438 relation: main_file file_date_updated: 2020-07-14T12:47:56Z has_accepted_license: '1' intvolume: ' 10' isi: 1 language: - iso: eng month: '01' oa: 1 oa_version: Published Version publication: Frontiers in Plant Science publication_identifier: issn: - 1664-462X publication_status: published publisher: Frontiers Media quality_controlled: '1' scopus_import: '1' status: public title: Thermo-sensitive alternative splicing of FLOWERING LOCUS M is modulated by cyclin-dependent kinase G2 tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 10 year: '2020' ...