--- _id: '14174' abstract: - lang: eng text: "Building sample-efficient agents that generalize out-of-distribution (OOD) in real-world settings remains a fundamental unsolved problem on the path towards achieving higher-level cognition. One particularly promising approach is to begin with low-dimensional, pretrained representations of our world, which should facilitate efficient downstream learning and generalization. By training 240 representations and over 10,000 reinforcement learning (RL) policies on a simulated robotic setup, we evaluate to what extent different properties of\r\npretrained VAE-based representations affect the OOD generalization of downstream agents. We observe that many agents are surprisingly robust to realistic distribution shifts, including the challenging sim-to-real case. In addition, we find that the generalization performance of a simple downstream proxy task reliably predicts the generalization performance of our RL agents\r\nunder a wide range of OOD settings. Such proxy tasks can thus be used to select pretrained representations that will lead to agents that generalize." article_processing_charge: No arxiv: 1 author: - first_name: Andrea full_name: Dittadi, Andrea last_name: Dittadi - first_name: Frederik full_name: Träuble, Frederik last_name: Träuble - first_name: Manuel full_name: Wüthrich, Manuel last_name: Wüthrich - first_name: Felix full_name: Widmaier, Felix last_name: Widmaier - first_name: Peter full_name: Gehler, Peter last_name: Gehler - first_name: Ole full_name: Winther, Ole last_name: Winther - first_name: Francesco full_name: Locatello, Francesco id: 26cfd52f-2483-11ee-8040-88983bcc06d4 last_name: Locatello orcid: 0000-0002-4850-0683 - first_name: Olivier full_name: Bachem, Olivier last_name: Bachem - first_name: Bernhard full_name: Schölkopf, Bernhard last_name: Schölkopf - first_name: Stefan full_name: Bauer, Stefan last_name: Bauer citation: ama: 'Dittadi A, Träuble F, Wüthrich M, et al. The role of pretrained representations for the OOD generalization of  reinforcement learning agents. In: 10th International Conference on Learning Representations. ; 2022.' apa: Dittadi, A., Träuble, F., Wüthrich, M., Widmaier, F., Gehler, P., Winther, O., … Bauer, S. (2022). The role of pretrained representations for the OOD generalization of  reinforcement learning agents. In 10th International Conference on Learning Representations. Virtual. chicago: Dittadi, Andrea, Frederik Träuble, Manuel Wüthrich, Felix Widmaier, Peter Gehler, Ole Winther, Francesco Locatello, Olivier Bachem, Bernhard Schölkopf, and Stefan Bauer. “The Role of Pretrained Representations for the OOD Generalization of  Reinforcement Learning Agents.” In 10th International Conference on Learning Representations, 2022. ieee: A. Dittadi et al., “The role of pretrained representations for the OOD generalization of  reinforcement learning agents,” in 10th International Conference on Learning Representations, Virtual, 2022. ista: 'Dittadi A, Träuble F, Wüthrich M, Widmaier F, Gehler P, Winther O, Locatello F, Bachem O, Schölkopf B, Bauer S. 2022. The role of pretrained representations for the OOD generalization of  reinforcement learning agents. 10th International Conference on Learning Representations. ICLR: International Conference on Learning Representations.' mla: Dittadi, Andrea, et al. “The Role of Pretrained Representations for the OOD Generalization of  Reinforcement Learning Agents.” 10th International Conference on Learning Representations, 2022. short: A. Dittadi, F. Träuble, M. Wüthrich, F. Widmaier, P. Gehler, O. Winther, F. Locatello, O. Bachem, B. Schölkopf, S. Bauer, in:, 10th International Conference on Learning Representations, 2022. conference: end_date: 2022-04-29 location: Virtual name: 'ICLR: International Conference on Learning Representations' start_date: 2022-04-25 date_created: 2023-08-22T14:02:13Z date_published: 2022-04-25T00:00:00Z date_updated: 2023-09-11T09:48:36Z day: '25' department: - _id: FrLo extern: '1' external_id: arxiv: - '2107.05686' language: - iso: eng main_file_link: - open_access: '1' url: ' https://doi.org/10.48550/arXiv.2107.05686' month: '04' oa: 1 oa_version: Preprint publication: 10th International Conference on Learning Representations publication_status: published quality_controlled: '1' status: public title: The role of pretrained representations for the OOD generalization of reinforcement learning agents type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2022' ... --- _id: '14175' abstract: - lang: eng text: "Predicting the future trajectory of a moving agent can be easy when the past trajectory continues smoothly but is challenging when complex interactions with other agents are involved. Recent deep learning approaches for trajectory prediction show promising performance and partially attribute this to successful reasoning about agent-agent interactions. However, it remains unclear which features such black-box models actually learn to use for making predictions. This paper proposes a procedure that quantifies the contributions\r\nof different cues to model performance based on a variant of Shapley values. Applying this procedure to state-of-the-art trajectory prediction methods on standard benchmark datasets shows that they are, in fact, unable to reason about interactions. Instead, the past trajectory of the target is the only feature used for predicting its future. For a task with richer social\r\ninteraction patterns, on the other hand, the tested models do pick up such interactions to a certain extent, as quantified by our feature attribution method. We discuss the limits of the proposed method and its links to causality." article_processing_charge: No arxiv: 1 author: - first_name: Osama full_name: Makansi, Osama last_name: Makansi - first_name: Julius von full_name: Kügelgen, Julius von last_name: Kügelgen - first_name: Francesco full_name: Locatello, Francesco id: 26cfd52f-2483-11ee-8040-88983bcc06d4 last_name: Locatello orcid: 0000-0002-4850-0683 - first_name: Peter full_name: Gehler, Peter last_name: Gehler - first_name: Dominik full_name: Janzing, Dominik last_name: Janzing - first_name: Thomas full_name: Brox, Thomas last_name: Brox - first_name: Bernhard full_name: Schölkopf, Bernhard last_name: Schölkopf citation: ama: 'Makansi O, Kügelgen J von, Locatello F, et al. You mostly walk alone: Analyzing feature attribution in trajectory prediction. In: 10th International Conference on Learning Representations. ; 2022.' apa: 'Makansi, O., Kügelgen, J. von, Locatello, F., Gehler, P., Janzing, D., Brox, T., & Schölkopf, B. (2022). You mostly walk alone: Analyzing feature attribution in trajectory prediction. In 10th International Conference on Learning Representations. Virtual.' chicago: 'Makansi, Osama, Julius von Kügelgen, Francesco Locatello, Peter Gehler, Dominik Janzing, Thomas Brox, and Bernhard Schölkopf. “You Mostly Walk Alone: Analyzing Feature Attribution in Trajectory Prediction.” In 10th International Conference on Learning Representations, 2022.' ieee: 'O. Makansi et al., “You mostly walk alone: Analyzing feature attribution in trajectory prediction,” in 10th International Conference on Learning Representations, Virtual, 2022.' ista: 'Makansi O, Kügelgen J von, Locatello F, Gehler P, Janzing D, Brox T, Schölkopf B. 2022. You mostly walk alone: Analyzing feature attribution in trajectory prediction. 10th International Conference on Learning Representations. ICLR: International Conference on Learning Representations.' mla: 'Makansi, Osama, et al. “You Mostly Walk Alone: Analyzing Feature Attribution in Trajectory Prediction.” 10th International Conference on Learning Representations, 2022.' short: O. Makansi, J. von Kügelgen, F. Locatello, P. Gehler, D. Janzing, T. Brox, B. Schölkopf, in:, 10th International Conference on Learning Representations, 2022. conference: end_date: 2022-04-29 location: Virtual name: 'ICLR: International Conference on Learning Representations' start_date: 2022-04-25 date_created: 2023-08-22T14:02:34Z date_published: 2022-04-25T00:00:00Z date_updated: 2023-09-11T09:52:20Z day: '25' department: - _id: FrLo extern: '1' external_id: arxiv: - '2110.05304' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2110.05304 month: '04' oa: 1 oa_version: Preprint publication: 10th International Conference on Learning Representations publication_status: published quality_controlled: '1' status: public title: 'You mostly walk alone: Analyzing feature attribution in trajectory prediction' type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2022' ... --- _id: '14215' abstract: - lang: eng text: Geospatial Information Systems are used by researchers and Humanitarian Assistance and Disaster Response (HADR) practitioners to support a wide variety of important applications. However, collaboration between these actors is difficult due to the heterogeneous nature of geospatial data modalities (e.g., multi-spectral images of various resolutions, timeseries, weather data) and diversity of tasks (e.g., regression of human activity indicators or detecting forest fires). In this work, we present a roadmap towards the construction of a general-purpose neural architecture (GPNA) with a geospatial inductive bias, pre-trained on large amounts of unlabelled earth observation data in a self-supervised manner. We envision how such a model may facilitate cooperation between members of the community. We show preliminary results on the first step of the roadmap, where we instantiate an architecture that can process a wide variety of geospatial data modalities and demonstrate that it can achieve competitive performance with domain-specific architectures on tasks relating to the U.N.'s Sustainable Development Goals. article_processing_charge: No arxiv: 1 author: - first_name: Nasim full_name: Rahaman, Nasim last_name: Rahaman - first_name: Martin full_name: Weiss, Martin last_name: Weiss - first_name: Frederik full_name: Träuble, Frederik last_name: Träuble - first_name: Francesco full_name: Locatello, Francesco id: 26cfd52f-2483-11ee-8040-88983bcc06d4 last_name: Locatello orcid: 0000-0002-4850-0683 - first_name: Alexandre full_name: Lacoste, Alexandre last_name: Lacoste - first_name: Yoshua full_name: Bengio, Yoshua last_name: Bengio - first_name: Chris full_name: Pal, Chris last_name: Pal - first_name: Li Erran full_name: Li, Li Erran last_name: Li - first_name: Bernhard full_name: Schölkopf, Bernhard last_name: Schölkopf citation: ama: 'Rahaman N, Weiss M, Träuble F, et al. A general purpose neural architecture for geospatial systems. In: 36th Conference on Neural Information Processing Systems.' apa: Rahaman, N., Weiss, M., Träuble, F., Locatello, F., Lacoste, A., Bengio, Y., … Schölkopf, B. (n.d.). A general purpose neural architecture for geospatial systems. In 36th Conference on Neural Information Processing Systems. New Orleans, LA, United States. chicago: Rahaman, Nasim, Martin Weiss, Frederik Träuble, Francesco Locatello, Alexandre Lacoste, Yoshua Bengio, Chris Pal, Li Erran Li, and Bernhard Schölkopf. “A General Purpose Neural Architecture for Geospatial Systems.” In 36th Conference on Neural Information Processing Systems, n.d. ieee: N. Rahaman et al., “A general purpose neural architecture for geospatial systems,” in 36th Conference on Neural Information Processing Systems, New Orleans, LA, United States. ista: 'Rahaman N, Weiss M, Träuble F, Locatello F, Lacoste A, Bengio Y, Pal C, Li LE, Schölkopf B. A general purpose neural architecture for geospatial systems. 36th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems.' mla: Rahaman, Nasim, et al. “A General Purpose Neural Architecture for Geospatial Systems.” 36th Conference on Neural Information Processing Systems. short: N. Rahaman, M. Weiss, F. Träuble, F. Locatello, A. Lacoste, Y. Bengio, C. Pal, L.E. Li, B. Schölkopf, in:, 36th Conference on Neural Information Processing Systems, n.d. conference: end_date: 2022-12-09 location: New Orleans, LA, United States name: 'NeurIPS: Neural Information Processing Systems' start_date: 2022-11-28 date_created: 2023-08-22T14:21:47Z date_published: 2022-11-04T00:00:00Z date_updated: 2023-09-13T09:35:59Z day: '04' department: - _id: FrLo extern: '1' external_id: arxiv: - '2211.02348' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2211.02348 month: '11' oa: 1 oa_version: Preprint publication: 36th Conference on Neural Information Processing Systems publication_status: submitted quality_controlled: '1' status: public title: A general purpose neural architecture for geospatial systems type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2022' ... --- _id: '14216' abstract: - lang: eng text: CLIP proved that aligning visual and language spaces is key to solving many vision tasks without explicit training, but required to train image and text encoders from scratch on a huge dataset. LiT improved this by only training the text encoder and using a pre-trained vision network. In this paper, we show that a common space can be created without any training at all, using single-domain encoders (trained with or without supervision) and a much smaller amount of image-text pairs. Furthermore, our model has unique properties. Most notably, deploying a new version with updated training samples can be done in a matter of seconds. Additionally, the representations in the common space are easily interpretable as every dimension corresponds to the similarity of the input to a unique entry in the multimodal dataset. Experiments on standard zero-shot visual benchmarks demonstrate the typical transfer ability of image-text models. Overall, our method represents a simple yet surprisingly strong baseline for foundation multi-modal models, raising important questions on their data efficiency and on the role of retrieval in machine learning. article_number: '2210.01738' article_processing_charge: No arxiv: 1 author: - first_name: Antonio full_name: Norelli, Antonio last_name: Norelli - first_name: Marco full_name: Fumero, Marco last_name: Fumero - first_name: Valentino full_name: Maiorca, Valentino last_name: Maiorca - first_name: Luca full_name: Moschella, Luca last_name: Moschella - first_name: Emanuele full_name: Rodolà, Emanuele last_name: Rodolà - first_name: Francesco full_name: Locatello, Francesco id: 26cfd52f-2483-11ee-8040-88983bcc06d4 last_name: Locatello orcid: 0000-0002-4850-0683 citation: ama: 'Norelli A, Fumero M, Maiorca V, Moschella L, Rodolà E, Locatello F. ASIF: Coupled data turns unimodal models to multimodal without training. arXiv. doi:10.48550/arXiv.2210.01738' apa: 'Norelli, A., Fumero, M., Maiorca, V., Moschella, L., Rodolà, E., & Locatello, F. (n.d.). ASIF: Coupled data turns unimodal models to multimodal without training. arXiv. https://doi.org/10.48550/arXiv.2210.01738' chicago: 'Norelli, Antonio, Marco Fumero, Valentino Maiorca, Luca Moschella, Emanuele Rodolà, and Francesco Locatello. “ASIF: Coupled Data Turns Unimodal Models to Multimodal without Training.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2210.01738.' ieee: 'A. Norelli, M. Fumero, V. Maiorca, L. Moschella, E. Rodolà, and F. Locatello, “ASIF: Coupled data turns unimodal models to multimodal without training,” arXiv. .' ista: 'Norelli A, Fumero M, Maiorca V, Moschella L, Rodolà E, Locatello F. ASIF: Coupled data turns unimodal models to multimodal without training. arXiv, 2210.01738.' mla: 'Norelli, Antonio, et al. “ASIF: Coupled Data Turns Unimodal Models to Multimodal without Training.” ArXiv, 2210.01738, doi:10.48550/arXiv.2210.01738.' short: A. Norelli, M. Fumero, V. Maiorca, L. Moschella, E. Rodolà, F. Locatello, ArXiv (n.d.). date_created: 2023-08-22T14:22:04Z date_published: 2022-10-04T00:00:00Z date_updated: 2024-02-12T09:57:14Z day: '04' department: - _id: FrLo doi: 10.48550/arXiv.2210.01738 external_id: arxiv: - '2210.01738' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2210.01738 month: '10' oa: 1 oa_version: Preprint publication: arXiv publication_status: submitted status: public title: 'ASIF: Coupled data turns unimodal models to multimodal without training' type: preprint user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2022' ... --- _id: '14220' abstract: - lang: eng text: Although reinforcement learning has seen remarkable progress over the last years, solving robust dexterous object-manipulation tasks in multi-object settings remains a challenge. In this paper, we focus on models that can learn manipulation tasks in fixed multi-object settings and extrapolate this skill zero-shot without any drop in performance when the number of objects changes. We consider the generic task of bringing a specific cube out of a set to a goal position. We find that previous approaches, which primarily leverage attention and graph neural network-based architectures, do not generalize their skills when the number of input objects changes while scaling as K2. We propose an alternative plug-and-play module based on relational inductive biases to overcome these limitations. Besides exceeding performances in their training environment, we show that our approach, which scales linearly in K, allows agents to extrapolate and generalize zero-shot to any new object number. article_number: '2201.13388' article_processing_charge: No arxiv: 1 author: - first_name: Davide full_name: Mambelli, Davide last_name: Mambelli - first_name: Frederik full_name: Träuble, Frederik last_name: Träuble - first_name: Stefan full_name: Bauer, Stefan last_name: Bauer - first_name: Bernhard full_name: Schölkopf, Bernhard last_name: Schölkopf - first_name: Francesco full_name: Locatello, Francesco id: 26cfd52f-2483-11ee-8040-88983bcc06d4 last_name: Locatello orcid: 0000-0002-4850-0683 citation: ama: Mambelli D, Träuble F, Bauer S, Schölkopf B, Locatello F. Compositional multi-object reinforcement learning with linear relation networks. arXiv. doi:10.48550/arXiv.2201.13388 apa: Mambelli, D., Träuble, F., Bauer, S., Schölkopf, B., & Locatello, F. (n.d.). Compositional multi-object reinforcement learning with linear relation networks. arXiv. https://doi.org/10.48550/arXiv.2201.13388 chicago: Mambelli, Davide, Frederik Träuble, Stefan Bauer, Bernhard Schölkopf, and Francesco Locatello. “Compositional Multi-Object Reinforcement Learning with Linear Relation Networks.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2201.13388. ieee: D. Mambelli, F. Träuble, S. Bauer, B. Schölkopf, and F. Locatello, “Compositional multi-object reinforcement learning with linear relation networks,” arXiv. . ista: Mambelli D, Träuble F, Bauer S, Schölkopf B, Locatello F. Compositional multi-object reinforcement learning with linear relation networks. arXiv, 2201.13388. mla: Mambelli, Davide, et al. “Compositional Multi-Object Reinforcement Learning with Linear Relation Networks.” ArXiv, 2201.13388, doi:10.48550/arXiv.2201.13388. short: D. Mambelli, F. Träuble, S. Bauer, B. Schölkopf, F. Locatello, ArXiv (n.d.). date_created: 2023-08-22T14:23:16Z date_published: 2022-01-31T00:00:00Z date_updated: 2023-09-11T11:49:40Z day: '31' department: - _id: FrLo doi: 10.48550/arXiv.2201.13388 extern: '1' external_id: arxiv: - '2201.13388' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2201.13388 month: '01' oa: 1 oa_version: Preprint publication: arXiv publication_status: submitted status: public title: Compositional multi-object reinforcement learning with linear relation networks type: preprint user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2022' ... --- _id: '14236' abstract: - lang: eng text: We show an $(1+\epsilon)$-approximation algorithm for maintaining maximum $s$-$t$ flow under $m$ edge insertions in $m^{1/2+o(1)} \epsilon^{-1/2}$ amortized update time for directed, unweighted graphs. This constitutes the first sublinear dynamic maximum flow algorithm in general sparse graphs with arbitrarily good approximation guarantee. article_number: '2211.09606' article_processing_charge: No arxiv: 1 author: - first_name: Gramoz full_name: Goranci, Gramoz last_name: Goranci - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 citation: ama: Goranci G, Henzinger MH. Incremental approximate maximum flow in m1/2+o(1) update time. arXiv. doi:10.48550/arXiv.2211.09606 apa: Goranci, G., & Henzinger, M. H. (n.d.). Incremental approximate maximum flow in m1/2+o(1) update time. arXiv. https://doi.org/10.48550/arXiv.2211.09606 chicago: Goranci, Gramoz, and Monika H Henzinger. “Incremental Approximate Maximum Flow in M1/2+o(1) Update Time.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2211.09606. ieee: G. Goranci and M. H. Henzinger, “Incremental approximate maximum flow in m1/2+o(1) update time,” arXiv. . ista: Goranci G, Henzinger MH. Incremental approximate maximum flow in m1/2+o(1) update time. arXiv, 2211.09606. mla: Goranci, Gramoz, and Monika H. Henzinger. “Incremental Approximate Maximum Flow in M1/2+o(1) Update Time.” ArXiv, 2211.09606, doi:10.48550/arXiv.2211.09606. short: G. Goranci, M.H. Henzinger, ArXiv (n.d.). date_created: 2023-08-25T15:04:29Z date_published: 2022-11-17T00:00:00Z date_updated: 2023-09-04T08:31:19Z day: '17' doi: 10.48550/arXiv.2211.09606 extern: '1' external_id: arxiv: - '2211.09606' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2211.09606 month: '11' oa: 1 oa_version: Preprint publication: arXiv publication_status: submitted status: public title: Incremental approximate maximum flow in m1/2+o(1) update time type: preprint user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2022' ... --- _id: '14248' abstract: - lang: eng text: "Recent work by Forsgård indicates that not every convex lattice polygon arises as the characteristic polygon of an affine dimer or, equivalently, an admissible oriented line arrangement on the torus in general position. We begin the classication of convex lattice polygons arising as characteristic polygons of affine dimers. We present several general constructions of new affine dimers from old, and an algorithm for finding affine dimers with prescribed polygon.\r\n\r\nWith these tools we prove that all lattice triangles, generalised parallelograms, and polygons of genus at most two admit an affine dimer." article_processing_charge: No article_type: original arxiv: 1 author: - first_name: Daniel full_name: Holmes, Daniel id: 3a443b4c-080d-11ed-979a-feb062bdcee0 last_name: Holmes citation: ama: Holmes D. Affine dimers from characteristic polygons. PUMP Journal of Undergraduate Research. 2022;5:24-51. apa: Holmes, D. (2022). Affine dimers from characteristic polygons. PUMP Journal of Undergraduate Research. California State University. chicago: Holmes, Daniel. “Affine Dimers from Characteristic Polygons.” PUMP Journal of Undergraduate Research. California State University, 2022. ieee: D. Holmes, “Affine dimers from characteristic polygons,” PUMP Journal of Undergraduate Research, vol. 5. California State University, pp. 24–51, 2022. ista: Holmes D. 2022. Affine dimers from characteristic polygons. PUMP Journal of Undergraduate Research. 5, 24–51. mla: Holmes, Daniel. “Affine Dimers from Characteristic Polygons.” PUMP Journal of Undergraduate Research, vol. 5, California State University, 2022, pp. 24–51. short: D. Holmes, PUMP Journal of Undergraduate Research 5 (2022) 24–51. date_created: 2023-08-29T13:08:09Z date_published: 2022-02-13T00:00:00Z date_updated: 2023-09-05T09:28:32Z day: '13' extern: '1' external_id: arxiv: - '2110.01703' intvolume: ' 5' keyword: - dimer model - hyperplane arrangement - torus - lattice polygon language: - iso: eng main_file_link: - open_access: '1' url: https://journals.calstate.edu/pump/article/view/2711 month: '02' oa: 1 oa_version: Published Version page: 24-51 publication: PUMP Journal of Undergraduate Research publication_identifier: issn: - 2576-3725 publication_status: published publisher: California State University quality_controlled: '1' status: public title: Affine dimers from characteristic polygons type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 5 year: '2022' ... --- _id: '9199' abstract: - lang: eng text: "We associate a certain tensor product lattice to any primitive integer lattice and ask about its typical shape. These lattices are related to the tangent bundle of Grassmannians and their study is motivated by Peyre's programme on \"freeness\" for rational points of bounded height on Fano\r\nvarieties." acknowledgement: The authors are very grateful to Will Sawin for useful remarks about this topic. While working on this paper the first two authors were supported by EPSRC grant EP/P026710/1, and the first and last authors by FWF grant P 32428-N35. article_processing_charge: No article_type: original arxiv: 1 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: Tal full_name: Horesh, Tal id: C8B7BF48-8D81-11E9-BCA9-F536E6697425 last_name: Horesh - first_name: Florian Alexander full_name: Wilsch, Florian Alexander id: 560601DA-8D36-11E9-A136-7AC1E5697425 last_name: Wilsch orcid: 0000-0001-7302-8256 citation: ama: Browning TD, Horesh T, Wilsch FA. Equidistribution and freeness on Grassmannians. Algebra & Number Theory. 2022;16(10):2385-2407. doi:10.2140/ant.2022.16.2385 apa: Browning, T. D., Horesh, T., & Wilsch, F. A. (2022). Equidistribution and freeness on Grassmannians. Algebra & Number Theory. Mathematical Sciences Publishers. https://doi.org/10.2140/ant.2022.16.2385 chicago: Browning, Timothy D, Tal Horesh, and Florian Alexander Wilsch. “Equidistribution and Freeness on Grassmannians.” Algebra & Number Theory. Mathematical Sciences Publishers, 2022. https://doi.org/10.2140/ant.2022.16.2385. ieee: T. D. Browning, T. Horesh, and F. A. Wilsch, “Equidistribution and freeness on Grassmannians,” Algebra & Number Theory, vol. 16, no. 10. Mathematical Sciences Publishers, pp. 2385–2407, 2022. ista: Browning TD, Horesh T, Wilsch FA. 2022. Equidistribution and freeness on Grassmannians. Algebra & Number Theory. 16(10), 2385–2407. mla: Browning, Timothy D., et al. “Equidistribution and Freeness on Grassmannians.” Algebra & Number Theory, vol. 16, no. 10, Mathematical Sciences Publishers, 2022, pp. 2385–407, doi:10.2140/ant.2022.16.2385. short: T.D. Browning, T. Horesh, F.A. Wilsch, Algebra & Number Theory 16 (2022) 2385–2407. date_created: 2021-02-25T09:56:57Z date_published: 2022-12-01T00:00:00Z date_updated: 2023-08-02T06:46:38Z day: '01' department: - _id: TiBr doi: 10.2140/ant.2022.16.2385 external_id: arxiv: - '2102.11552' isi: - '000961514100004' intvolume: ' 16' isi: 1 issue: '10' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/2102.11552 month: '12' oa: 1 oa_version: Preprint page: 2385-2407 project: - _id: 26A8D266-B435-11E9-9278-68D0E5697425 grant_number: EP-P026710-2 name: Between rational and integral points - _id: 26AEDAB2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P32428 name: New frontiers of the Manin conjecture publication: Algebra & Number Theory publication_identifier: eissn: - 1944-7833 issn: - 1937-0652 publication_status: published publisher: Mathematical Sciences Publishers quality_controlled: '1' scopus_import: '1' status: public title: Equidistribution and freeness on Grassmannians type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 16 year: '2022' ... --- _id: '9311' abstract: - lang: eng text: 'Partially observable Markov decision processes (POMDPs) are standard models for dynamic systems with probabilistic and nondeterministic behaviour in uncertain environments. We prove that in POMDPs with long-run average objective, the decision maker has approximately optimal strategies with finite memory. This implies notably that approximating the long-run value is recursively enumerable, as well as a weak continuity property of the value with respect to the transition function. ' acknowledgement: "Partially supported by Austrian Science Fund (FWF) NFN Grant No RiSE/SHiNE S11407, by CONICYT Chile through grant PII 20150140, and by ECOS-CONICYT through grant C15E03.\r\n" article_processing_charge: No article_type: original arxiv: 1 author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Raimundo J full_name: Saona Urmeneta, Raimundo J id: BD1DF4C4-D767-11E9-B658-BC13E6697425 last_name: Saona Urmeneta orcid: 0000-0001-5103-038X - first_name: Bruno full_name: Ziliotto, Bruno last_name: Ziliotto citation: ama: Chatterjee K, Saona Urmeneta RJ, Ziliotto B. Finite-memory strategies in POMDPs with long-run average objectives. Mathematics of Operations Research. 2022;47(1):100-119. doi:10.1287/moor.2020.1116 apa: Chatterjee, K., Saona Urmeneta, R. J., & Ziliotto, B. (2022). Finite-memory strategies in POMDPs with long-run average objectives. Mathematics of Operations Research. Institute for Operations Research and the Management Sciences. https://doi.org/10.1287/moor.2020.1116 chicago: Chatterjee, Krishnendu, Raimundo J Saona Urmeneta, and Bruno Ziliotto. “Finite-Memory Strategies in POMDPs with Long-Run Average Objectives.” Mathematics of Operations Research. Institute for Operations Research and the Management Sciences, 2022. https://doi.org/10.1287/moor.2020.1116. ieee: K. Chatterjee, R. J. Saona Urmeneta, and B. Ziliotto, “Finite-memory strategies in POMDPs with long-run average objectives,” Mathematics of Operations Research, vol. 47, no. 1. Institute for Operations Research and the Management Sciences, pp. 100–119, 2022. ista: Chatterjee K, Saona Urmeneta RJ, Ziliotto B. 2022. Finite-memory strategies in POMDPs with long-run average objectives. Mathematics of Operations Research. 47(1), 100–119. mla: Chatterjee, Krishnendu, et al. “Finite-Memory Strategies in POMDPs with Long-Run Average Objectives.” Mathematics of Operations Research, vol. 47, no. 1, Institute for Operations Research and the Management Sciences, 2022, pp. 100–19, doi:10.1287/moor.2020.1116. short: K. Chatterjee, R.J. Saona Urmeneta, B. Ziliotto, Mathematics of Operations Research 47 (2022) 100–119. date_created: 2021-04-08T09:33:31Z date_published: 2022-02-01T00:00:00Z date_updated: 2023-09-05T13:16:11Z day: '01' department: - _id: GradSch - _id: KrCh doi: 10.1287/moor.2020.1116 external_id: arxiv: - '1904.13360' isi: - '000731918100001' intvolume: ' 47' isi: 1 issue: '1' keyword: - Management Science and Operations Research - General Mathematics - Computer Science Applications language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1904.13360 month: '02' oa: 1 oa_version: Preprint page: 100-119 project: - _id: 25863FF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11407 name: Game Theory publication: Mathematics of Operations Research publication_identifier: eissn: - 1526-5471 issn: - 0364-765X publication_status: published publisher: Institute for Operations Research and the Management Sciences quality_controlled: '1' scopus_import: '1' status: public title: Finite-memory strategies in POMDPs with long-run average objectives type: journal_article user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 47 year: '2022' ... --- _id: '9364' abstract: - lang: eng text: 'Let t : Fp → C be a complex valued function on Fp. A classical problem in analytic number theory is bounding the maximum M(t) := max 0≤H

0 there exists a large subset of a ∈ F×p such that for kl a,1,p : x → e((ax+x) / p) we have M(kla,1,p) ≥ (1−ε/√2π + o(1)) log log p, as p→∞. Finally, we prove a result on the growth of the moments of {M (kla,1,p)}a∈F×p. 2020 Mathematics Subject Classification: 11L03, 11T23 (Primary); 14F20, 60F10 (Secondary).' acknowledgement: I am most thankful to my advisor, Emmanuel Kowalski, for suggesting this problem and for his guidance during these years. I also would like to thank Youness Lamzouri for informing me about his work on sum of incomplete Birch sums and Tal Horesh for her suggestions on a previous version of the paper. Finally, I am very grateful to the anonymous referee for their careful reading of the manuscript and their valuable comments. article_processing_charge: Yes (via OA deal) article_type: original arxiv: 1 author: - first_name: Dante full_name: Bonolis, Dante id: 6A459894-5FDD-11E9-AF35-BB24E6697425 last_name: Bonolis citation: ama: Bonolis D. On the size of the maximum of incomplete Kloosterman sums. Mathematical Proceedings of the Cambridge Philosophical Society. 2022;172(3):563-590. doi:10.1017/S030500412100030X apa: Bonolis, D. (2022). On the size of the maximum of incomplete Kloosterman sums. Mathematical Proceedings of the Cambridge Philosophical Society. Cambridge University Press. https://doi.org/10.1017/S030500412100030X chicago: Bonolis, Dante. “On the Size of the Maximum of Incomplete Kloosterman Sums.” Mathematical Proceedings of the Cambridge Philosophical Society. Cambridge University Press, 2022. https://doi.org/10.1017/S030500412100030X. ieee: D. Bonolis, “On the size of the maximum of incomplete Kloosterman sums,” Mathematical Proceedings of the Cambridge Philosophical Society, vol. 172, no. 3. Cambridge University Press, pp. 563–590, 2022. ista: Bonolis D. 2022. On the size of the maximum of incomplete Kloosterman sums. Mathematical Proceedings of the Cambridge Philosophical Society. 172(3), 563–590. mla: Bonolis, Dante. “On the Size of the Maximum of Incomplete Kloosterman Sums.” Mathematical Proceedings of the Cambridge Philosophical Society, vol. 172, no. 3, Cambridge University Press, 2022, pp. 563–90, doi:10.1017/S030500412100030X. short: D. Bonolis, Mathematical Proceedings of the Cambridge Philosophical Society 172 (2022) 563–590. date_created: 2021-05-02T22:01:29Z date_published: 2022-05-01T00:00:00Z date_updated: 2023-08-02T06:47:48Z day: '01' ddc: - '510' department: - _id: TiBr doi: 10.1017/S030500412100030X external_id: arxiv: - '1811.10563' isi: - '000784421500001' file: - access_level: open_access checksum: 614d2e9b83a78100408e4ee7752a80a8 content_type: application/pdf creator: cchlebak date_created: 2021-12-01T14:01:54Z date_updated: 2021-12-01T14:01:54Z file_id: '10395' file_name: 2021_MathProcCamPhilSoc_Bonolis.pdf file_size: 334064 relation: main_file success: 1 file_date_updated: 2021-12-01T14:01:54Z has_accepted_license: '1' intvolume: ' 172' isi: 1 issue: '3' language: - iso: eng month: '05' oa: 1 oa_version: Published Version page: 563 - 590 publication: Mathematical Proceedings of the Cambridge Philosophical Society publication_identifier: eissn: - 1469-8064 issn: - 0305-0041 publication_status: published publisher: Cambridge University Press quality_controlled: '1' scopus_import: '1' status: public title: On the size of the maximum of incomplete Kloosterman sums 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: 172 year: '2022' ... --- _id: '9649' 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 : Rd → Rd−n. A natural (and efficient) way to approximate an isomanifold is to consider its Piecewise-Linear (PL) approximation based on a triangulation T of the ambient space Rd. 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\r\nfine triangulation T . 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." acknowledgement: "First and foremost, we acknowledge Siargey Kachanovich for discussions. We thank Herbert Edelsbrunner and all members of his group, all former and current members of the Datashape team (formerly known as Geometrica), and André Lieutier for encouragement. We further thank the reviewers of Foundations of Computational Mathematics and the reviewers and program committee of the Symposium on Computational Geometry for their feedback, which improved the exposition.\r\nThis work was funded by the European Research Council under the European Union’s ERC Grant Agreement number 339025 GUDHI (Algorithmic Foundations of Geometric Understanding in Higher Dimensions). This work was also supported by the French government, through the 3IA Côte d’Azur Investments in the Future project managed by the National Research Agency (ANR) with the reference number ANR-19-P3IA-0002. Mathijs Wintraecken also received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement no. 754411." article_processing_charge: Yes (via OA deal) article_type: original 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. Foundations of Computational Mathematics . 2022;22:967-1012. doi:10.1007/s10208-021-09520-0 apa: Boissonnat, J.-D., & Wintraecken, M. (2022). The topological correctness of PL approximations of isomanifolds. Foundations of Computational Mathematics . Springer Nature. https://doi.org/10.1007/s10208-021-09520-0 chicago: Boissonnat, Jean-Daniel, and Mathijs Wintraecken. “The Topological Correctness of PL Approximations of Isomanifolds.” Foundations of Computational Mathematics . Springer Nature, 2022. https://doi.org/10.1007/s10208-021-09520-0. ieee: J.-D. Boissonnat and M. Wintraecken, “The topological correctness of PL approximations of isomanifolds,” Foundations of Computational Mathematics , vol. 22. Springer Nature, pp. 967–1012, 2022. ista: Boissonnat J-D, Wintraecken M. 2022. The topological correctness of PL approximations of isomanifolds. Foundations of Computational Mathematics . 22, 967–1012. mla: Boissonnat, Jean-Daniel, and Mathijs Wintraecken. “The Topological Correctness of PL Approximations of Isomanifolds.” Foundations of Computational Mathematics , vol. 22, Springer Nature, 2022, pp. 967–1012, doi:10.1007/s10208-021-09520-0. short: J.-D. Boissonnat, M. Wintraecken, Foundations of Computational Mathematics 22 (2022) 967–1012. date_created: 2021-07-14T06:44:53Z date_published: 2022-01-01T00:00:00Z date_updated: 2023-08-02T06:49:17Z day: '01' ddc: - '516' department: - _id: HeEd doi: 10.1007/s10208-021-09520-0 ec_funded: 1 external_id: isi: - '000673039600001' file: - access_level: open_access checksum: f1d372ec3c08ec22e84f8e93e1126b8c content_type: application/pdf creator: mwintrae date_created: 2021-07-14T06:44:36Z date_updated: 2021-07-14T06:44:36Z file_id: '9650' file_name: Boissonnat-Wintraecken2021_Article_TheTopologicalCorrectnessOfPLA.pdf file_size: 1455699 relation: main_file file_date_updated: 2021-07-14T06:44:36Z has_accepted_license: '1' intvolume: ' 22' isi: 1 language: - iso: eng month: '0' oa: 1 oa_version: Published Version page: 967-1012 project: - _id: 260C2330-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '754411' name: ISTplus - Postdoctoral Fellowships publication: 'Foundations of Computational Mathematics ' publication_identifier: eissn: - 1615-3383 publication_status: published publisher: Springer Nature quality_controlled: '1' related_material: record: - id: '7952' relation: earlier_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: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 22 year: '2022' ... --- _id: '10016' abstract: - lang: eng text: 'Auxin has always been at the forefront of research in plant physiology and development. Since the earliest contemplations by Julius von Sachs and Charles Darwin, more than a century-long struggle has been waged to understand its function. This largely reflects the failures, successes, and inevitable progress in the entire field of plant signaling and development. Here I present 14 stations on our long and sometimes mystical journey to understand auxin. These highlights were selected to give a flavor of the field and to show the scope and limits of our current knowledge. A special focus is put on features that make auxin unique among phytohormones, such as its dynamic, directional transport network, which integrates external and internal signals, including self-organizing feedback. Accented are persistent mysteries and controversies. The unexpected discoveries related to rapid auxin responses and growth regulation recently disturbed our contentment regarding understanding of the auxin signaling mechanism. These new revelations, along with advances in technology, usher us into a new, exciting era in auxin research. ' acknowledgement: "The author thanks the whole community of researchers consciously or unconsciously working on questions related to auxin, whose hard work and enthusiasm contributed to development of this exciting story. Particular thanks go to many\r\nbrilliant present and past members of the Friml group and our numerous excellent collaborators, without whom my own personal journey would not be possible. The way of the cross with its 14 stations is a popular devotion among Roman Catholics and inspires them to make a spiritual pilgrimage through contemplation of Christ on his last day. Its aspects of gradual progress, struggle, passion, and revelation served as an inspiration for the formal depiction of our journey to understanding auxin as described in this review. It is in no way intended to reflect the personal beliefs of the author and readers. I am grateful to Nick Barton, Eva Benková, Lenka Caisová, Matyáš Fendrych, Lukáš Fiedler, Monika Frátriková, Jarmila Frimlová, Michelle Gallei, Jakub Hajný, Lukas Hoermayer, Alexandra Mally, Ondrˇej Novák, Jan Petrášek, Aleš Pěnčík, Steffen Vanneste, Tongda Xu, and Zhenbiao Yang for their valuable comments. Special thanks go to Michelle Gallei for her invaluable assistance with the figures." article_number: a039859 article_processing_charge: No article_type: review author: - first_name: Jiří full_name: Friml, Jiří id: 4159519E-F248-11E8-B48F-1D18A9856A87 last_name: Friml orcid: 0000-0002-8302-7596 citation: ama: Friml J. Fourteen stations of auxin. Cold Spring Harbor Perspectives in Biology. 2022;14(5). doi:10.1101/cshperspect.a039859 apa: Friml, J. (2022). Fourteen stations of auxin. Cold Spring Harbor Perspectives in Biology. Cold Spring Harbor Laboratory. https://doi.org/10.1101/cshperspect.a039859 chicago: Friml, Jiří. “Fourteen Stations of Auxin.” Cold Spring Harbor Perspectives in Biology. Cold Spring Harbor Laboratory, 2022. https://doi.org/10.1101/cshperspect.a039859 . ieee: J. Friml, “Fourteen stations of auxin,” Cold Spring Harbor Perspectives in Biology, vol. 14, no. 5. Cold Spring Harbor Laboratory, 2022. ista: Friml J. 2022. Fourteen stations of auxin. Cold Spring Harbor Perspectives in Biology. 14(5), a039859. mla: Friml, Jiří. “Fourteen Stations of Auxin.” Cold Spring Harbor Perspectives in Biology, vol. 14, no. 5, a039859, Cold Spring Harbor Laboratory, 2022, doi:10.1101/cshperspect.a039859 . short: J. Friml, Cold Spring Harbor Perspectives in Biology 14 (2022). date_created: 2021-09-14T11:36:53Z date_published: 2022-05-27T00:00:00Z date_updated: 2023-08-02T06:54:42Z day: '27' department: - _id: JiFr doi: '10.1101/cshperspect.a039859 ' external_id: isi: - '000806563000003' pmid: - '34400554' intvolume: ' 14' isi: 1 issue: '5' language: - iso: eng main_file_link: - open_access: '1' url: 'https://doi.org/10.1101/cshperspect.a039859 ' month: '05' oa: 1 oa_version: Published Version pmid: 1 publication: Cold Spring Harbor Perspectives in Biology publication_identifier: issn: - 1943-0264 publication_status: published publisher: Cold Spring Harbor Laboratory quality_controlled: '1' scopus_import: '1' status: public title: Fourteen stations of auxin type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 14 year: '2022' ... --- _id: '10018' abstract: - lang: eng text: In order to study integral points of bounded log-anticanonical height on weak del Pezzo surfaces, we classify weak del Pezzo pairs. As a representative example, we consider a quartic del Pezzo surface of singularity type A1 + A3 and prove an analogue of Manin's conjecture for integral points with respect to its singularities and its lines. acknowledgement: The first author was partly supported by grant DE 1646/4-2 of the Deutsche Forschungsgemeinschaft. The second author was partly supported by FWF grant P 32428-N35 and conducted part of this work as a guest at the Institut de Mathématiques de Jussieu–Paris Rive Gauche invited by Antoine Chambert-Loir and funded by DAAD. article_processing_charge: Yes (via OA deal) article_type: original arxiv: 1 author: - first_name: Ulrich full_name: Derenthal, Ulrich last_name: Derenthal - first_name: Florian Alexander full_name: Wilsch, Florian Alexander id: 560601DA-8D36-11E9-A136-7AC1E5697425 last_name: Wilsch orcid: 0000-0001-7302-8256 citation: ama: Derenthal U, Wilsch FA. Integral points on singular del Pezzo surfaces. Journal of the Institute of Mathematics of Jussieu. 2022. doi:10.1017/S1474748022000482 apa: Derenthal, U., & Wilsch, F. A. (2022). Integral points on singular del Pezzo surfaces. Journal of the Institute of Mathematics of Jussieu. Cambridge University Press. https://doi.org/10.1017/S1474748022000482 chicago: Derenthal, Ulrich, and Florian Alexander Wilsch. “Integral Points on Singular Del Pezzo Surfaces.” Journal of the Institute of Mathematics of Jussieu. Cambridge University Press, 2022. https://doi.org/10.1017/S1474748022000482. ieee: U. Derenthal and F. A. Wilsch, “Integral points on singular del Pezzo surfaces,” Journal of the Institute of Mathematics of Jussieu. Cambridge University Press, 2022. ista: Derenthal U, Wilsch FA. 2022. Integral points on singular del Pezzo surfaces. Journal of the Institute of Mathematics of Jussieu. mla: Derenthal, Ulrich, and Florian Alexander Wilsch. “Integral Points on Singular Del Pezzo Surfaces.” Journal of the Institute of Mathematics of Jussieu, Cambridge University Press, 2022, doi:10.1017/S1474748022000482. short: U. Derenthal, F.A. Wilsch, Journal of the Institute of Mathematics of Jussieu (2022). date_created: 2021-09-15T10:06:48Z date_published: 2022-11-10T00:00:00Z date_updated: 2023-08-02T06:55:10Z day: '10' department: - _id: TiBr doi: 10.1017/S1474748022000482 external_id: arxiv: - '2109.06778' isi: - '000881319200001' isi: 1 keyword: - Integral points - del Pezzo surface - universal torsor - Manin’s conjecture language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1017/S1474748022000482 month: '11' oa: 1 oa_version: Published Version project: - _id: 26AEDAB2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P32428 name: New frontiers of the Manin conjecture publication: Journal of the Institute of Mathematics of Jussieu publication_identifier: eissn: - '1475-3030 ' issn: - 1474-7480 publication_status: epub_ahead publisher: Cambridge University Press quality_controlled: '1' scopus_import: '1' status: public title: Integral points on singular del Pezzo surfaces type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 year: '2022' ... --- _id: '10042' abstract: - lang: eng text: SnSe has emerged as one of the most promising materials for thermoelectric energy conversion due to its extraordinary performance in its single-crystal form and its low-cost constituent elements. However, to achieve an economic impact, the polycrystalline counterpart needs to replicate the performance of the single crystal. Herein, we optimize the thermoelectric performance of polycrystalline SnSe produced by consolidating solution-processed and surface-engineered SnSe particles. In particular, the SnSe particles are coated with CdSe molecular complexes that crystallize during the sintering process, forming CdSe nanoparticles. The presence of CdSe nanoparticles inhibits SnSe grain growth during the consolidation step due to Zener pinning, yielding a material with a high density of grain boundaries. Moreover, the resulting SnSe–CdSe nanocomposites present a large number of defects at different length scales, which significantly reduce the thermal conductivity. The produced SnSe–CdSe nanocomposites exhibit thermoelectric figures of merit up to 2.2 at 786 K, which is among the highest reported for solution-processed SnSe. acknowledgement: 'This work was financially supported by IST Austria and the Werner Siemens Foundation. Y.L. acknowledges funding from the European Union’s Horizon 2020 research and innovation program under the Marie Sklodowska-Curie grant agreement No. 754411. S.L. and M.C. received funding from the European Union’s Horizon 2020 research and innovation program under the Marie Skłodowska-Curie Grant Agreement No. 665385. J.D. acknowledges funding from the European Union’s Horizon 2020 research and innovation program under the Marie Sklodowska-Curie grant agreement no. 665919 (P-SPHERE) cofunded by Severo Ochoa Programme. C.C. acknowledges funding from the FWF “Lise Meitner Fellowship” grant agreement M 2889-N. Y.Y. and O.C.-M. acknowledge the financial support from DFG within the project SFB 917: Nanoswitches. M.C.S. received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 754510 (PROBIST) and the Severo Ochoa programme. J.D. received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie grant agreement No. 665919 (P-SPHERE) cofunded by Severo Ochoa Programme. The ICN2 is funded by the CERCA Program/Generalitat de Catalunya and by the Severo Ochoa program of the Spanish Ministry of Economy, Industry, and Competitiveness (MINECO, grant no. SEV-2017-0706). ICN2 acknowledges funding from Generalitat de Catalunya 2017 SGR 327 and the Spanish MINECO project NANOGEN (PID2020-116093RB-C43). This project received funding from the European Union’s Horizon 2020 research and innovation program under grant agreement No. 823717-ESTEEM3. The FIB sample preparation was conducted in the LMA-INA-Universidad de Zaragoza.' article_processing_charge: Yes (via OA deal) article_type: original author: - first_name: Yu full_name: Liu, Yu id: 2A70014E-F248-11E8-B48F-1D18A9856A87 last_name: Liu orcid: 0000-0001-7313-6740 - first_name: Mariano full_name: Calcabrini, Mariano id: 45D7531A-F248-11E8-B48F-1D18A9856A87 last_name: Calcabrini - first_name: Yuan full_name: Yu, Yuan last_name: Yu - first_name: Seungho full_name: Lee, Seungho id: BB243B88-D767-11E9-B658-BC13E6697425 last_name: Lee orcid: 0000-0002-6962-8598 - first_name: Cheng full_name: Chang, Cheng id: 9E331C2E-9F27-11E9-AE48-5033E6697425 last_name: Chang orcid: 0000-0002-9515-4277 - first_name: Jérémy full_name: David, Jérémy last_name: David - first_name: Tanmoy full_name: Ghosh, Tanmoy id: a5fc9bc3-feff-11ea-93fe-e8015a3c7e9d last_name: Ghosh - first_name: Maria Chiara full_name: Spadaro, Maria Chiara last_name: Spadaro - first_name: Chenyang full_name: Xie, Chenyang last_name: Xie - first_name: Oana full_name: Cojocaru-Mirédin, Oana last_name: Cojocaru-Mirédin - first_name: Jordi full_name: Arbiol, Jordi last_name: Arbiol - first_name: Maria full_name: Ibáñez, Maria id: 43C61214-F248-11E8-B48F-1D18A9856A87 last_name: Ibáñez orcid: 0000-0001-5013-2843 citation: ama: Liu Y, Calcabrini M, Yu Y, et al. Defect engineering in solution-processed polycrystalline SnSe leads to high thermoelectric performance. ACS Nano. 2022;16(1):78-88. doi:10.1021/acsnano.1c06720 apa: Liu, Y., Calcabrini, M., Yu, Y., Lee, S., Chang, C., David, J., … Ibáñez, M. (2022). Defect engineering in solution-processed polycrystalline SnSe leads to high thermoelectric performance. ACS Nano. American Chemical Society . https://doi.org/10.1021/acsnano.1c06720 chicago: Liu, Yu, Mariano Calcabrini, Yuan Yu, Seungho Lee, Cheng Chang, Jérémy David, Tanmoy Ghosh, et al. “Defect Engineering in Solution-Processed Polycrystalline SnSe Leads to High Thermoelectric Performance.” ACS Nano. American Chemical Society , 2022. https://doi.org/10.1021/acsnano.1c06720. ieee: Y. Liu et al., “Defect engineering in solution-processed polycrystalline SnSe leads to high thermoelectric performance,” ACS Nano, vol. 16, no. 1. American Chemical Society , pp. 78–88, 2022. ista: Liu Y, Calcabrini M, Yu Y, Lee S, Chang C, David J, Ghosh T, Spadaro MC, Xie C, Cojocaru-Mirédin O, Arbiol J, Ibáñez M. 2022. Defect engineering in solution-processed polycrystalline SnSe leads to high thermoelectric performance. ACS Nano. 16(1), 78–88. mla: Liu, Yu, et al. “Defect Engineering in Solution-Processed Polycrystalline SnSe Leads to High Thermoelectric Performance.” ACS Nano, vol. 16, no. 1, American Chemical Society , 2022, pp. 78–88, doi:10.1021/acsnano.1c06720. short: Y. Liu, M. Calcabrini, Y. Yu, S. Lee, C. Chang, J. David, T. Ghosh, M.C. Spadaro, C. Xie, O. Cojocaru-Mirédin, J. Arbiol, M. Ibáñez, ACS Nano 16 (2022) 78–88. date_created: 2021-09-24T07:55:12Z date_published: 2022-01-25T00:00:00Z date_updated: 2023-08-02T14:41:05Z day: '25' ddc: - '540' department: - _id: MaIb doi: 10.1021/acsnano.1c06720 ec_funded: 1 external_id: isi: - '000767223400008' pmid: - '34549956' file: - access_level: open_access checksum: 74f9c1aa5f95c0b992a4328e8e0247b4 content_type: application/pdf creator: cchlebak date_created: 2022-03-02T16:17:29Z date_updated: 2022-03-02T16:17:29Z file_id: '10808' file_name: 2022_ACSNano_Liu.pdf file_size: 9050764 relation: main_file success: 1 file_date_updated: 2022-03-02T16:17:29Z has_accepted_license: '1' intvolume: ' 16' isi: 1 issue: '1' keyword: - tin selenide - nanocomposite - grain growth - Zener pinning - thermoelectricity - annealing - solution processing language: - iso: eng month: '01' oa: 1 oa_version: Published Version page: 78-88 pmid: 1 project: - _id: 260C2330-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '754411' name: ISTplus - Postdoctoral Fellowships - _id: 2564DBCA-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '665385' name: International IST Doctoral Program - _id: 9B8F7476-BA93-11EA-9121-9846C619BF3A name: 'HighTE: The Werner Siemens Laboratory for the High Throughput Discovery of Semiconductors for Waste Heat Recovery' - _id: 9B8804FC-BA93-11EA-9121-9846C619BF3A grant_number: M02889 name: Bottom-up Engineering for Thermoelectric Applications publication: ACS Nano publication_identifier: eissn: - 1936-086X issn: - 1936-0851 publication_status: published publisher: 'American Chemical Society ' quality_controlled: '1' related_material: record: - id: '12885' relation: dissertation_contains status: public scopus_import: '1' status: public title: Defect engineering in solution-processed polycrystalline SnSe leads to high thermoelectric performance 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: 16 year: '2022' ... --- _id: '10208' abstract: - lang: eng text: It is practical to collect a huge amount of movement data and environmental context information along with the health signals of individuals because there is the emergence of new generations of positioning and tracking technologies and rapid advancements of health sensors. The study of the relations between these datasets and their sequence similarity analysis is of interest to many applications such as health monitoring and recommender systems. However, entering all movement parameters and health signals can lead to the complexity of the problem and an increase in its computational load. In this situation, dimension reduction techniques can be used to avoid consideration of simultaneous dependent parameters in the process of similarity measurement of the trajectories. The present study provides a framework, named CaDRAW, to use spatial–temporal data and movement parameters along with independent context information in the process of measuring the similarity of trajectories. In this regard, the omission of dependent movement characteristic signals is conducted by using an unsupervised feature selection dimension reduction technique. To evaluate the effectiveness of the proposed framework, it was applied to a real contextualized movement and related health signal datasets of individuals. The results indicated the capability of the proposed framework in measuring the similarity and in decreasing the characteristic signals in such a way that the similarity results -before and after reduction of dependent characteristic signals- have small differences. The mean differences between the obtained results before and after reducing the dimension were 0.029 and 0.023 for the round path, respectively. acknowledgement: The third author acknowledges the funding received from the Wittgenstein Prize, Austrian Science Fund (FWF), grant no. Z 342-N31. article_processing_charge: No article_type: original author: - first_name: Samira full_name: Goudarzi, Samira last_name: Goudarzi - first_name: Mohammad full_name: Sharif, Mohammad last_name: Sharif - first_name: Farid full_name: Karimipour, Farid id: 2A2BCDC4-CF62-11E9-BE5E-3B1EE6697425 last_name: Karimipour orcid: 0000-0001-6746-4174 citation: ama: Goudarzi S, Sharif M, Karimipour F. A context-aware dimension reduction framework for trajectory and health signal analyses. Journal of Ambient Intelligence and Humanized Computing. 2022;13:2621–2635. doi:10.1007/s12652-021-03569-z apa: Goudarzi, S., Sharif, M., & Karimipour, F. (2022). A context-aware dimension reduction framework for trajectory and health signal analyses. Journal of Ambient Intelligence and Humanized Computing. Springer Nature. https://doi.org/10.1007/s12652-021-03569-z chicago: Goudarzi, Samira, Mohammad Sharif, and Farid Karimipour. “A Context-Aware Dimension Reduction Framework for Trajectory and Health Signal Analyses.” Journal of Ambient Intelligence and Humanized Computing. Springer Nature, 2022. https://doi.org/10.1007/s12652-021-03569-z. ieee: S. Goudarzi, M. Sharif, and F. Karimipour, “A context-aware dimension reduction framework for trajectory and health signal analyses,” Journal of Ambient Intelligence and Humanized Computing, vol. 13. Springer Nature, pp. 2621–2635, 2022. ista: Goudarzi S, Sharif M, Karimipour F. 2022. A context-aware dimension reduction framework for trajectory and health signal analyses. Journal of Ambient Intelligence and Humanized Computing. 13, 2621–2635. mla: Goudarzi, Samira, et al. “A Context-Aware Dimension Reduction Framework for Trajectory and Health Signal Analyses.” Journal of Ambient Intelligence and Humanized Computing, vol. 13, Springer Nature, 2022, pp. 2621–2635, doi:10.1007/s12652-021-03569-z. short: S. Goudarzi, M. Sharif, F. Karimipour, Journal of Ambient Intelligence and Humanized Computing 13 (2022) 2621–2635. date_created: 2021-11-02T09:28:55Z date_published: 2022-05-01T00:00:00Z date_updated: 2023-08-02T13:31:48Z day: '01' ddc: - '000' department: - _id: HeEd doi: 10.1007/s12652-021-03569-z external_id: isi: - '000712198000001' file: - access_level: open_access checksum: 0a8961416a9bb2be5a1cebda65468bcf content_type: application/pdf creator: fkarimip date_created: 2021-11-12T19:38:05Z date_updated: 2022-12-20T23:30:08Z embargo: 2022-11-12 file_id: '10279' file_name: A Context‑aware Dimension Reduction Framework - Journal of Ambient Intelligence 2021 (Preprint version).pdf file_size: 1634958 relation: main_file file_date_updated: 2022-12-20T23:30:08Z has_accepted_license: '1' intvolume: ' 13' isi: 1 keyword: - general computer science language: - iso: eng month: '05' oa: 1 oa_version: Submitted Version page: 2621–2635 project: - _id: 268116B8-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z00342 name: The Wittgenstein Prize publication: Journal of Ambient Intelligence and Humanized Computing publication_identifier: eissn: - 1868-5145 issn: - 1868-5137 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: A context-aware dimension reduction framework for trajectory and health signal analyses type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 13 year: '2022' ... --- _id: '10284' abstract: - lang: eng text: Infections early in life can have enduring effects on an organism's development and immunity. In this study, we show that this equally applies to developing ‘superorganisms’––incipient social insect colonies. When we exposed newly mated Lasius niger ant queens to a low pathogen dose, their colonies grew more slowly than controls before winter, but reached similar sizes afterwards. Independent of exposure, queen hibernation survival improved when the ratio of pupae to workers was small. Queens that reared fewer pupae before worker emergence exhibited lower pathogen levels, indicating that high brood rearing efforts interfere with the ability of the queen's immune system to suppress pathogen proliferation. Early-life queen pathogen exposure also improved the immunocompetence of her worker offspring, as demonstrated by challenging the workers to the same pathogen a year later. Transgenerational transfer of the queen's pathogen experience to her workforce can hence durably reduce the disease susceptibility of the whole superorganism. acknowledged_ssus: - _id: ScienComp acknowledgement: The authors are grateful to G. Tkačik and V. Mireles for advice on data analyses and to A. Schloegl for help using the IST Austria HPC cluster for data processing. The authors thank J. Eilenberg for providing the fungal strain and A.V. Grasse for support with the molecular analysis. The authors also thank the Social Immunity group at IST Austria, in particular B. Milutinović, for discussions throughout and comments on the manuscript. article_processing_charge: Yes (via OA deal) article_type: original author: - first_name: Barbara E full_name: Casillas Perez, Barbara E id: 351ED2AA-F248-11E8-B48F-1D18A9856A87 last_name: Casillas Perez - first_name: Christopher full_name: Pull, Christopher id: 3C7F4840-F248-11E8-B48F-1D18A9856A87 last_name: Pull orcid: 0000-0003-1122-3982 - first_name: Filip full_name: Naiser, Filip last_name: Naiser - first_name: Elisabeth full_name: Naderlinger, Elisabeth id: 31757262-F248-11E8-B48F-1D18A9856A87 last_name: Naderlinger - first_name: Jiri full_name: Matas, Jiri last_name: Matas - first_name: Sylvia full_name: Cremer, Sylvia id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87 last_name: Cremer orcid: 0000-0002-2193-3868 citation: ama: Casillas Perez BE, Pull C, Naiser F, Naderlinger E, Matas J, Cremer S. Early queen infection shapes developmental dynamics and induces long-term disease protection in incipient ant colonies. Ecology Letters. 2022;25(1):89-100. doi:10.1111/ele.13907 apa: Casillas Perez, B. E., Pull, C., Naiser, F., Naderlinger, E., Matas, J., & Cremer, S. (2022). Early queen infection shapes developmental dynamics and induces long-term disease protection in incipient ant colonies. Ecology Letters. Wiley. https://doi.org/10.1111/ele.13907 chicago: Casillas Perez, Barbara E, Christopher Pull, Filip Naiser, Elisabeth Naderlinger, Jiri Matas, and Sylvia Cremer. “Early Queen Infection Shapes Developmental Dynamics and Induces Long-Term Disease Protection in Incipient Ant Colonies.” Ecology Letters. Wiley, 2022. https://doi.org/10.1111/ele.13907. ieee: B. E. Casillas Perez, C. Pull, F. Naiser, E. Naderlinger, J. Matas, and S. Cremer, “Early queen infection shapes developmental dynamics and induces long-term disease protection in incipient ant colonies,” Ecology Letters, vol. 25, no. 1. Wiley, pp. 89–100, 2022. ista: Casillas Perez BE, Pull C, Naiser F, Naderlinger E, Matas J, Cremer S. 2022. Early queen infection shapes developmental dynamics and induces long-term disease protection in incipient ant colonies. Ecology Letters. 25(1), 89–100. mla: Casillas Perez, Barbara E., et al. “Early Queen Infection Shapes Developmental Dynamics and Induces Long-Term Disease Protection in Incipient Ant Colonies.” Ecology Letters, vol. 25, no. 1, Wiley, 2022, pp. 89–100, doi:10.1111/ele.13907. short: B.E. Casillas Perez, C. Pull, F. Naiser, E. Naderlinger, J. Matas, S. Cremer, Ecology Letters 25 (2022) 89–100. date_created: 2021-11-14T23:01:25Z date_published: 2022-01-01T00:00:00Z date_updated: 2023-08-14T11:45:29Z day: '01' ddc: - '573' department: - _id: SyCr doi: 10.1111/ele.13907 ec_funded: 1 external_id: isi: - '000713396100001' pmid: - '34725912' file: - access_level: open_access checksum: 0bd4210400e9876609b7c538ab4f9a3c content_type: application/pdf creator: cchlebak date_created: 2022-02-03T13:37:11Z date_updated: 2022-02-03T13:37:11Z file_id: '10721' file_name: 2021_EcologyLetters_CasillasPerez.pdf file_size: 700087 relation: main_file success: 1 file_date_updated: 2022-02-03T13:37:11Z has_accepted_license: '1' intvolume: ' 25' isi: 1 issue: '1' language: - iso: eng month: '01' oa: 1 oa_version: Published Version page: 89-100 pmid: 1 project: - _id: 2649B4DE-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '771402' name: Epidemics in ant societies on a chip publication: Ecology Letters publication_identifier: eissn: - 1461-0248 issn: - 1461-023X publication_status: published publisher: Wiley quality_controlled: '1' related_material: record: - id: '13061' relation: research_data status: public scopus_import: '1' status: public title: Early queen infection shapes developmental dynamics and induces long-term disease protection in incipient ant colonies 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: 25 year: '2022' ... --- _id: '10335' abstract: - lang: eng text: "Van der Holst and Pendavingh introduced a graph parameter σ, which coincides with the more famous Colin de Verdière graph parameter μ for small values. However, the definition of a is much more geometric/topological directly reflecting embeddability properties of the graph. They proved μ(G) ≤ σ(G) + 2 and conjectured σ(G) ≤ σ(G) for any graph G. We confirm this conjecture. As far as we know, this is the first topological upper bound on σ(G) which is, in general, tight.\r\nEquality between μ and σ does not hold in general as van der Holst and Pendavingh showed that there is a graph G with μ(G) ≤ 18 and σ(G) ≥ 20. We show that the gap appears at much smaller values, namely, we exhibit a graph H for which μ(H) ≥ 7 and σ(H) ≥ 8. We also prove that, in general, the gap can be large: The incidence graphs Hq of finite projective planes of order q satisfy μ(Hq) ∈ O(q3/2) and σ(Hq) ≥ q2." acknowledgement: 'V. K. gratefully acknowledges the support of Austrian Science Fund (FWF): P 30902-N35. This work was done mostly while he was employed at the University of Innsbruck. During the early stage of this research, V. K. was partially supported by Charles University project GAUK 926416. M. T. is supported by the grant no. 19-04113Y of the Czech Science Foundation(GA ˇCR) and partially supported by Charles University project UNCE/SCI/004.' article_processing_charge: No article_type: original arxiv: 1 author: - first_name: Vojtech full_name: Kaluza, Vojtech id: 21AE5134-9EAC-11EA-BEA2-D7BD3DDC885E last_name: Kaluza orcid: 0000-0002-2512-8698 - first_name: Martin full_name: Tancer, Martin id: 38AC689C-F248-11E8-B48F-1D18A9856A87 last_name: Tancer orcid: 0000-0002-1191-6714 citation: ama: Kaluza V, Tancer M. Even maps, the Colin de Verdière number and representations of graphs. Combinatorica. 2022;42:1317-1345. doi:10.1007/s00493-021-4443-7 apa: Kaluza, V., & Tancer, M. (2022). Even maps, the Colin de Verdière number and representations of graphs. Combinatorica. Springer Nature. https://doi.org/10.1007/s00493-021-4443-7 chicago: Kaluza, Vojtech, and Martin Tancer. “Even Maps, the Colin de Verdière Number and Representations of Graphs.” Combinatorica. Springer Nature, 2022. https://doi.org/10.1007/s00493-021-4443-7. ieee: V. Kaluza and M. Tancer, “Even maps, the Colin de Verdière number and representations of graphs,” Combinatorica, vol. 42. Springer Nature, pp. 1317–1345, 2022. ista: Kaluza V, Tancer M. 2022. Even maps, the Colin de Verdière number and representations of graphs. Combinatorica. 42, 1317–1345. mla: Kaluza, Vojtech, and Martin Tancer. “Even Maps, the Colin de Verdière Number and Representations of Graphs.” Combinatorica, vol. 42, Springer Nature, 2022, pp. 1317–45, doi:10.1007/s00493-021-4443-7. short: V. Kaluza, M. Tancer, Combinatorica 42 (2022) 1317–1345. date_created: 2021-11-25T13:49:16Z date_published: 2022-12-01T00:00:00Z date_updated: 2023-08-02T06:43:27Z day: '01' ddc: - '514' - '516' department: - _id: UlWa doi: 10.1007/s00493-021-4443-7 external_id: arxiv: - '1907.05055' isi: - '000798210100003' intvolume: ' 42' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: ' https://doi.org/10.48550/arXiv.1907.05055' month: '12' oa: 1 oa_version: Preprint page: 1317-1345 publication: Combinatorica publication_identifier: issn: - 0209-9683 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: Even maps, the Colin de Verdière number and representations of graphs type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 42 year: '2022' ... --- _id: '10364' abstract: - lang: eng text: 'This paper characterizes the latency of the simplified successive-cancellation (SSC) decoding scheme for polar codes under hardware resource constraints. In particular, when the number of processing elements P that can perform SSC decoding operations in parallel is limited, as is the case in practice, the latency of SSC decoding is O(N1-1/μ + N/P log2 log2 N/P), where N is the block length of the code and μ is the scaling exponent of the channel. Three direct consequences of this bound are presented. First, in a fully-parallel implementation where P = N/2, the latency of SSC decoding is O(N1-1/μ), which is sublinear in the block length. This recovers a result from our earlier work. Second, in a fully-serial implementation where P = 1, the latency of SSC decoding scales as O(N log2 log2 N). The multiplicative constant is also calculated: we show that the latency of SSC decoding when P = 1 is given by (2 + o(1))N log2 log2 N. Third, in a semi-parallel implementation, the smallest P that gives the same latency as that of the fully-parallel implementation is P = N1/μ. The tightness of our bound on SSC decoding latency and the applicability of the foregoing results is validated through extensive simulations.' acknowledgement: "S. A. Hashemi is supported by a Postdoctoral Fellowship from the Natural Sciences and\r\nEngineering Research Council of Canada (NSERC) and by Huawei. M. Mondelli is partially\r\nsupported by the 2019 Lopez-Loreta Prize. A. Fazeli and A. Vardy were supported in part by\r\nthe National Science Foundation under Grant CCF-1764104." article_processing_charge: No article_type: original arxiv: 1 author: - first_name: Seyyed Ali full_name: Hashemi, Seyyed Ali last_name: Hashemi - first_name: Marco full_name: Mondelli, Marco id: 27EB676C-8706-11E9-9510-7717E6697425 last_name: Mondelli orcid: 0000-0002-3242-7020 - first_name: Arman full_name: Fazeli, Arman last_name: Fazeli - first_name: Alexander full_name: Vardy, Alexander last_name: Vardy - first_name: John full_name: Cioffi, John last_name: Cioffi - first_name: Andrea full_name: Goldsmith, Andrea last_name: Goldsmith citation: ama: Hashemi SA, Mondelli M, Fazeli A, Vardy A, Cioffi J, Goldsmith A. Parallelism versus latency in simplified successive-cancellation decoding of polar codes. IEEE Transactions on Wireless Communications. 2022;21(6):3909-3920. doi:10.1109/TWC.2021.3125626 apa: Hashemi, S. A., Mondelli, M., Fazeli, A., Vardy, A., Cioffi, J., & Goldsmith, A. (2022). Parallelism versus latency in simplified successive-cancellation decoding of polar codes. IEEE Transactions on Wireless Communications. Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/TWC.2021.3125626 chicago: Hashemi, Seyyed Ali, Marco Mondelli, Arman Fazeli, Alexander Vardy, John Cioffi, and Andrea Goldsmith. “Parallelism versus Latency in Simplified Successive-Cancellation Decoding of Polar Codes.” IEEE Transactions on Wireless Communications. Institute of Electrical and Electronics Engineers, 2022. https://doi.org/10.1109/TWC.2021.3125626. ieee: S. A. Hashemi, M. Mondelli, A. Fazeli, A. Vardy, J. Cioffi, and A. Goldsmith, “Parallelism versus latency in simplified successive-cancellation decoding of polar codes,” IEEE Transactions on Wireless Communications, vol. 21, no. 6. Institute of Electrical and Electronics Engineers, pp. 3909–3920, 2022. ista: Hashemi SA, Mondelli M, Fazeli A, Vardy A, Cioffi J, Goldsmith A. 2022. Parallelism versus latency in simplified successive-cancellation decoding of polar codes. IEEE Transactions on Wireless Communications. 21(6), 3909–3920. mla: Hashemi, Seyyed Ali, et al. “Parallelism versus Latency in Simplified Successive-Cancellation Decoding of Polar Codes.” IEEE Transactions on Wireless Communications, vol. 21, no. 6, Institute of Electrical and Electronics Engineers, 2022, pp. 3909–20, doi:10.1109/TWC.2021.3125626. short: S.A. Hashemi, M. Mondelli, A. Fazeli, A. Vardy, J. Cioffi, A. Goldsmith, IEEE Transactions on Wireless Communications 21 (2022) 3909–3920. date_created: 2021-11-28T23:01:29Z date_published: 2022-06-01T00:00:00Z date_updated: 2024-09-10T13:03:18Z day: '01' department: - _id: MaMo doi: 10.1109/TWC.2021.3125626 external_id: arxiv: - '2012.13378' isi: - '000809406400028' intvolume: ' 21' isi: 1 issue: '6' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/2012.13378 month: '06' oa: 1 oa_version: Preprint page: 3909-3920 project: - _id: 059876FA-7A3F-11EA-A408-12923DDC885E name: Prix Lopez-Loretta 2019 - Marco Mondelli publication: IEEE Transactions on Wireless Communications publication_identifier: eissn: - 1558-2248 issn: - 1536-1276 publication_status: published publisher: Institute of Electrical and Electronics Engineers quality_controlled: '1' related_material: record: - id: '10053' relation: earlier_version status: public scopus_import: '1' status: public title: Parallelism versus latency in simplified successive-cancellation decoding of polar codes type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 21 year: '2022' ... --- _id: '10411' abstract: - lang: eng text: The phytohormone auxin is the major growth regulator governing tropic responses including gravitropism. Auxin build-up at the lower side of stimulated shoots promotes cell expansion, whereas in roots it inhibits growth, leading to upward shoot bending and downward root bending, respectively. Yet it remains an enigma how the same signal can trigger such opposite cellular responses. In this review, we discuss several recent unexpected insights into the mechanisms underlying auxin regulation of growth, challenging several existing models. We focus on the divergent mechanisms of apoplastic pH regulation in shoots and roots revisiting the classical Acid Growth Theory and discuss coordinated involvement of multiple auxin signaling pathways. From this emerges a more comprehensive, updated picture how auxin regulates growth. acknowledgement: The authors thank Alexandra Mally for editing the text. This work was supported by the Austrian Science Fund (FWF) I 3630-B25 to Jiří Friml and the DOC Fellowship of the Austrian Academy of Sciences to Lanxin Li. All figures were created with BioRender.com. article_processing_charge: No article_type: original author: - first_name: Lanxin full_name: Li, Lanxin id: 367EF8FA-F248-11E8-B48F-1D18A9856A87 last_name: Li orcid: 0000-0002-5607-272X - 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: Jiří full_name: Friml, Jiří id: 4159519E-F248-11E8-B48F-1D18A9856A87 last_name: Friml orcid: 0000-0002-8302-7596 citation: ama: 'Li L, Gallei MC, Friml J. Bending to auxin: Fast acid growth for tropisms. Trends in Plant Science. 2022;27(5):440-449. doi:10.1016/j.tplants.2021.11.006' apa: 'Li, L., Gallei, M. C., & Friml, J. (2022). Bending to auxin: Fast acid growth for tropisms. Trends in Plant Science. Cell Press. https://doi.org/10.1016/j.tplants.2021.11.006' chicago: 'Li, Lanxin, Michelle C Gallei, and Jiří Friml. “Bending to Auxin: Fast Acid Growth for Tropisms.” Trends in Plant Science. Cell Press, 2022. https://doi.org/10.1016/j.tplants.2021.11.006.' ieee: 'L. Li, M. C. Gallei, and J. Friml, “Bending to auxin: Fast acid growth for tropisms,” Trends in Plant Science, vol. 27, no. 5. Cell Press, pp. 440–449, 2022.' ista: 'Li L, Gallei MC, Friml J. 2022. Bending to auxin: Fast acid growth for tropisms. Trends in Plant Science. 27(5), 440–449.' mla: 'Li, Lanxin, et al. “Bending to Auxin: Fast Acid Growth for Tropisms.” Trends in Plant Science, vol. 27, no. 5, Cell Press, 2022, pp. 440–49, doi:10.1016/j.tplants.2021.11.006.' short: L. Li, M.C. Gallei, J. Friml, Trends in Plant Science 27 (2022) 440–449. date_created: 2021-12-05T23:01:43Z date_published: 2022-05-01T00:00:00Z date_updated: 2024-10-29T10:12:33Z day: '01' ddc: - '580' department: - _id: JiFr doi: 10.1016/j.tplants.2021.11.006 external_id: isi: - '000793707900005' pmid: - '34848141' file: - access_level: open_access checksum: 3d94980ee1ff6bec100dd813f6a921a6 content_type: application/pdf creator: amally date_created: 2023-11-02T17:00:03Z date_updated: 2023-11-02T17:00:03Z file_id: '14480' file_name: Li Plants 2021_accepted.pdf file_size: 805779 relation: main_file success: 1 file_date_updated: 2023-11-02T17:00:03Z has_accepted_license: '1' intvolume: ' 27' isi: 1 issue: '5' language: - iso: eng month: '05' oa: 1 oa_version: Submitted Version page: 440-449 pmid: 1 project: - _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: Trends in Plant Science publication_identifier: issn: - 1360-1385 publication_status: published publisher: Cell Press quality_controlled: '1' related_material: record: - id: '11626' relation: dissertation_contains status: public scopus_import: '1' status: public title: 'Bending to auxin: Fast acid growth for tropisms' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 27 year: '2022' ... --- _id: '10530' abstract: - lang: eng text: "Cell dispersion from a confined area is fundamental in a number of biological processes,\r\nincluding cancer metastasis. To date, a quantitative understanding of the interplay of single\r\ncell motility, cell proliferation, and intercellular contacts remains elusive. In particular, the role\r\nof E- and N-Cadherin junctions, central components of intercellular contacts, is still\r\ncontroversial. Combining theoretical modeling with in vitro observations, we investigate the\r\ncollective spreading behavior of colonies of human cancer cells (T24). The spreading of these\r\ncolonies is driven by stochastic single-cell migration with frequent transient cell-cell contacts.\r\nWe find that inhibition of E- and N-Cadherin junctions decreases colony spreading and average\r\nspreading velocities, without affecting the strength of correlations in spreading velocities of\r\nneighboring cells. Based on a biophysical simulation model for cell migration, we show that the\r\nbehavioral changes upon disruption of these junctions can be explained by reduced repulsive\r\nexcluded volume interactions between cells. This suggests that in cancer cell migration,\r\ncadherin-based intercellular contacts sharpen cell boundaries leading to repulsive rather than\r\ncohesive interactions between cells, thereby promoting efficient cell spreading during collective\r\nmigration.\r\n" acknowledgement: Funded by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) - Project-ID 201269156 - SFB 1032 (Projects B8 and B12). D.B.B. is supported in part by a DFG fellowship within the Graduate School of Quantitative Biosciences Munich (QBM) and by the Joachim Herz Stiftung. article_processing_charge: No article_type: original author: - first_name: Themistoklis full_name: Zisis, Themistoklis last_name: Zisis - first_name: David full_name: Brückner, David id: e1e86031-6537-11eb-953a-f7ab92be508d last_name: Brückner orcid: 0000-0001-7205-2975 - first_name: Tom full_name: Brandstätter, Tom last_name: Brandstätter - first_name: Wei Xiong full_name: Siow, Wei Xiong last_name: Siow - first_name: Joseph full_name: d’Alessandro, Joseph last_name: d’Alessandro - first_name: Angelika M. full_name: Vollmar, Angelika M. last_name: Vollmar - first_name: Chase P. full_name: Broedersz, Chase P. last_name: Broedersz - first_name: Stefan full_name: Zahler, Stefan last_name: Zahler citation: ama: Zisis T, Brückner D, Brandstätter T, et al. Disentangling cadherin-mediated cell-cell interactions in collective cancer cell migration. Biophysical Journal. 2022;121(1):P44-60. doi:10.1016/j.bpj.2021.12.006 apa: Zisis, T., Brückner, D., Brandstätter, T., Siow, W. X., d’Alessandro, J., Vollmar, A. M., … Zahler, S. (2022). Disentangling cadherin-mediated cell-cell interactions in collective cancer cell migration. Biophysical Journal. Elsevier. https://doi.org/10.1016/j.bpj.2021.12.006 chicago: Zisis, Themistoklis, David Brückner, Tom Brandstätter, Wei Xiong Siow, Joseph d’Alessandro, Angelika M. Vollmar, Chase P. Broedersz, and Stefan Zahler. “Disentangling Cadherin-Mediated Cell-Cell Interactions in Collective Cancer Cell Migration.” Biophysical Journal. Elsevier, 2022. https://doi.org/10.1016/j.bpj.2021.12.006. ieee: T. Zisis et al., “Disentangling cadherin-mediated cell-cell interactions in collective cancer cell migration,” Biophysical Journal, vol. 121, no. 1. Elsevier, pp. P44-60, 2022. ista: Zisis T, Brückner D, Brandstätter T, Siow WX, d’Alessandro J, Vollmar AM, Broedersz CP, Zahler S. 2022. Disentangling cadherin-mediated cell-cell interactions in collective cancer cell migration. Biophysical Journal. 121(1), P44-60. mla: Zisis, Themistoklis, et al. “Disentangling Cadherin-Mediated Cell-Cell Interactions in Collective Cancer Cell Migration.” Biophysical Journal, vol. 121, no. 1, Elsevier, 2022, pp. P44-60, doi:10.1016/j.bpj.2021.12.006. short: T. Zisis, D. Brückner, T. Brandstätter, W.X. Siow, J. d’Alessandro, A.M. Vollmar, C.P. Broedersz, S. Zahler, Biophysical Journal 121 (2022) P44-60. date_created: 2021-12-10T09:48:19Z date_published: 2022-01-04T00:00:00Z date_updated: 2023-08-02T13:34:25Z day: '04' ddc: - '570' department: - _id: EdHa - _id: GaTk doi: 10.1016/j.bpj.2021.12.006 external_id: isi: - '000740815400007' file: - access_level: open_access checksum: 1aa7c3478e0c8256b973b632efd1f6b4 content_type: application/pdf creator: dernst date_created: 2022-07-29T10:17:10Z date_updated: 2022-07-29T10:17:10Z file_id: '11697' file_name: 2022_BiophysicalJour_Zisis.pdf file_size: 4475504 relation: main_file success: 1 file_date_updated: 2022-07-29T10:17:10Z has_accepted_license: '1' intvolume: ' 121' isi: 1 issue: '1' keyword: - Biophysics language: - iso: eng month: '01' oa: 1 oa_version: Published Version page: P44-60 project: - _id: 9B861AAC-BA93-11EA-9121-9846C619BF3A name: NOMIS Fellowship Program publication: Biophysical Journal publication_identifier: issn: - 0006-3495 publication_status: published publisher: Elsevier quality_controlled: '1' status: public title: Disentangling cadherin-mediated cell-cell interactions in collective cancer cell migration 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: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 121 year: '2022' ...