--- _id: '18189' abstract: - lang: eng text: 'Strongly interacting topological matter1 exhibits fundamentally new phenomena with potential applications in quantum information technology2,3. Emblematic instances are fractional quantum Hall (FQH) states4, in which the interplay of a magnetic field and strong interactions gives rise to fractionally charged quasi-particles, long-ranged entanglement and anyonic exchange statistics. Progress in engineering synthetic magnetic fields5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21 has raised the hope to create these exotic states in controlled quantum systems. However, except for a recent Laughlin state of light22, preparing FQH states in engineered systems remains elusive. Here we realize a FQH state with ultracold atoms in an optical lattice. The state is a lattice version of a bosonic ν = 1/2 Laughlin state4,23 with two particles on 16 sites. This minimal system already captures many hallmark features of Laughlin-type FQH states24,25,26,27,28: we observe a suppression of two-body interactions, we find a distinctive vortex structure in the density correlations and we measure a fractional Hall conductivity of σH/σ0 = 0.6(2) by means of the bulk response to a magnetic perturbation. Furthermore, by tuning the magnetic field, we map out the transition point between the normal and the FQH regime through a spectroscopic investigation of the many-body gap. Our work provides a starting point for exploring highly entangled topological matter with ultracold atoms29,30,31,32,33.' article_processing_charge: No article_type: original arxiv: 1 author: - first_name: Julian full_name: Leonard, Julian id: b75b3f45-7995-11ef-9bfd-9a9cd02c3577 last_name: Leonard - first_name: Sooshin full_name: Kim, Sooshin last_name: Kim - first_name: Joyce full_name: Kwan, Joyce last_name: Kwan - first_name: Perrin full_name: Segura, Perrin last_name: Segura - first_name: Fabian full_name: Grusdt, Fabian last_name: Grusdt - first_name: Cécile full_name: Repellin, Cécile last_name: Repellin - first_name: Nathan full_name: Goldman, Nathan last_name: Goldman - first_name: Markus full_name: Greiner, Markus last_name: Greiner citation: ama: Leonard J, Kim S, Kwan J, et al. Realization of a fractional quantum Hall state with ultracold atoms. Nature. 2023;619(7970):495-499. doi:10.1038/s41586-023-06122-4 apa: Leonard, J., Kim, S., Kwan, J., Segura, P., Grusdt, F., Repellin, C., … Greiner, M. (2023). Realization of a fractional quantum Hall state with ultracold atoms. Nature. Springer Nature. https://doi.org/10.1038/s41586-023-06122-4 chicago: Leonard, Julian, Sooshin Kim, Joyce Kwan, Perrin Segura, Fabian Grusdt, Cécile Repellin, Nathan Goldman, and Markus Greiner. “Realization of a Fractional Quantum Hall State with Ultracold Atoms.” Nature. Springer Nature, 2023. https://doi.org/10.1038/s41586-023-06122-4. ieee: J. Leonard et al., “Realization of a fractional quantum Hall state with ultracold atoms,” Nature, vol. 619, no. 7970. Springer Nature, pp. 495–499, 2023. ista: Leonard J, Kim S, Kwan J, Segura P, Grusdt F, Repellin C, Goldman N, Greiner M. 2023. Realization of a fractional quantum Hall state with ultracold atoms. Nature. 619(7970), 495–499. mla: Leonard, Julian, et al. “Realization of a Fractional Quantum Hall State with Ultracold Atoms.” Nature, vol. 619, no. 7970, Springer Nature, 2023, pp. 495–99, doi:10.1038/s41586-023-06122-4. short: J. Leonard, S. Kim, J. Kwan, P. Segura, F. Grusdt, C. Repellin, N. Goldman, M. Greiner, Nature 619 (2023) 495–499. date_created: 2024-10-07T11:46:13Z date_published: 2023-06-21T00:00:00Z date_updated: 2024-10-08T11:09:24Z day: '21' doi: 10.1038/s41586-023-06122-4 extern: '1' external_id: arxiv: - '2210.10919' pmid: - '37344594 ' intvolume: ' 619' issue: '7970' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2210.10919 month: '06' oa: 1 oa_version: Preprint page: 495-499 pmid: 1 publication: Nature publication_identifier: eissn: - 1476-4687 issn: - 0028-0836 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: Realization of a fractional quantum Hall state with ultracold atoms type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 619 year: '2023' ... --- _id: '18190' abstract: - lang: eng text: Strongly correlated systems can exhibit unexpected phenomena when brought in a state far from equilibrium. An example is many-body localization, which prevents generic interacting systems from reaching thermal equilibrium even at long times1,2. The stability of the many-body localized phase has been predicted to be hindered by the presence of small thermal inclusions that act as a bath, leading to the delocalization of the entire system through an avalanche propagation mechanism3,4,5,6,7,8. Here we study the dynamics of a thermal inclusion of variable size when it is coupled to a many-body localized system. We find evidence for accelerated transport of thermal inclusion into the localized region. We monitor how the avalanche spreads through the localized system and thermalizes it site by site by measuring the site-resolved entropy over time. Furthermore, we isolate the strongly correlated bath-induced dynamics with multipoint correlations between the bath and the system. Our results have implications on the robustness of many-body localized systems and their critical behaviour. article_processing_charge: No article_type: letter_note arxiv: 1 author: - first_name: Julian full_name: Leonard, Julian id: b75b3f45-7995-11ef-9bfd-9a9cd02c3577 last_name: Leonard - first_name: Sooshin full_name: Kim, Sooshin last_name: Kim - first_name: Matthew full_name: Rispoli, Matthew last_name: Rispoli - first_name: Alexander full_name: Lukin, Alexander last_name: Lukin - first_name: Robert full_name: Schittko, Robert last_name: Schittko - first_name: Joyce full_name: Kwan, Joyce last_name: Kwan - first_name: Eugene full_name: Demler, Eugene last_name: Demler - first_name: Dries full_name: Sels, Dries last_name: Sels - first_name: Markus full_name: Greiner, Markus last_name: Greiner citation: ama: Leonard J, Kim S, Rispoli M, et al. Probing the onset of quantum avalanches in a many-body localized system. Nature Physics. 2023;19(4):481-485. doi:10.1038/s41567-022-01887-3 apa: Leonard, J., Kim, S., Rispoli, M., Lukin, A., Schittko, R., Kwan, J., … Greiner, M. (2023). Probing the onset of quantum avalanches in a many-body localized system. Nature Physics. Springer Nature. https://doi.org/10.1038/s41567-022-01887-3 chicago: Leonard, Julian, Sooshin Kim, Matthew Rispoli, Alexander Lukin, Robert Schittko, Joyce Kwan, Eugene Demler, Dries Sels, and Markus Greiner. “Probing the Onset of Quantum Avalanches in a Many-Body Localized System.” Nature Physics. Springer Nature, 2023. https://doi.org/10.1038/s41567-022-01887-3. ieee: J. Leonard et al., “Probing the onset of quantum avalanches in a many-body localized system,” Nature Physics, vol. 19, no. 4. Springer Nature, pp. 481–485, 2023. ista: Leonard J, Kim S, Rispoli M, Lukin A, Schittko R, Kwan J, Demler E, Sels D, Greiner M. 2023. Probing the onset of quantum avalanches in a many-body localized system. Nature Physics. 19(4), 481–485. mla: Leonard, Julian, et al. “Probing the Onset of Quantum Avalanches in a Many-Body Localized System.” Nature Physics, vol. 19, no. 4, Springer Nature, 2023, pp. 481–85, doi:10.1038/s41567-022-01887-3. short: J. Leonard, S. Kim, M. Rispoli, A. Lukin, R. Schittko, J. Kwan, E. Demler, D. Sels, M. Greiner, Nature Physics 19 (2023) 481–485. date_created: 2024-10-07T11:46:33Z date_published: 2023-01-26T00:00:00Z date_updated: 2024-10-08T10:52:08Z day: '26' doi: 10.1038/s41567-022-01887-3 extern: '1' external_id: arxiv: - '2012.15270' intvolume: ' 19' issue: '4' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2012.15270 month: '01' oa: 1 oa_version: Preprint page: 481-485 publication: Nature Physics publication_identifier: eissn: - 1745-2481 issn: - 1745-2473 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: Probing the onset of quantum avalanches in a many-body localized system type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 19 year: '2023' ... --- _id: '18207' abstract: - lang: eng text: Comparison of myoglobin structures reveals that protein isolated from horse heart consistently adopts an alternate turn conformation in comparison to its homologues. Analysis of hundreds of high-resolution structures discounts crystallization conditions or the surrounding amino acid protein environment as explaining this difference, that is also not captured by the AlphaFold prediction. Rather, a water molecule is identified as stabilizing the conformation in the horse heart structure, which immediately reverts to the whale conformation in molecular dynamics simulations excluding that structural water. article_number: '6094' article_processing_charge: No article_type: original author: - first_name: Alexander full_name: Bronstein, Alexander id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6 last_name: Bronstein orcid: 0000-0001-9699-8730 - first_name: Ailie full_name: Marx, Ailie last_name: Marx citation: ama: Bronstein AM, Marx A. Water stabilizes an alternate turn conformation in horse heart myoglobin. Scientific Reports. 2023;13. doi:10.1038/s41598-023-32821-z apa: Bronstein, A. M., & Marx, A. (2023). Water stabilizes an alternate turn conformation in horse heart myoglobin. Scientific Reports. Springer Nature. https://doi.org/10.1038/s41598-023-32821-z chicago: Bronstein, Alex M., and Ailie Marx. “Water Stabilizes an Alternate Turn Conformation in Horse Heart Myoglobin.” Scientific Reports. Springer Nature, 2023. https://doi.org/10.1038/s41598-023-32821-z. ieee: A. M. Bronstein and A. Marx, “Water stabilizes an alternate turn conformation in horse heart myoglobin,” Scientific Reports, vol. 13. Springer Nature, 2023. ista: Bronstein AM, Marx A. 2023. Water stabilizes an alternate turn conformation in horse heart myoglobin. Scientific Reports. 13, 6094. mla: Bronstein, Alex M., and Ailie Marx. “Water Stabilizes an Alternate Turn Conformation in Horse Heart Myoglobin.” Scientific Reports, vol. 13, 6094, Springer Nature, 2023, doi:10.1038/s41598-023-32821-z. short: A.M. Bronstein, A. Marx, Scientific Reports 13 (2023). date_created: 2024-10-08T12:46:41Z date_published: 2023-04-13T00:00:00Z date_updated: 2024-10-09T10:39:26Z day: '13' doi: 10.1038/s41598-023-32821-z extern: '1' external_id: pmid: - '37055458' has_accepted_license: '1' intvolume: ' 13' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1038/s41598-023-32821-z month: '04' oa: 1 oa_version: Published Version pmid: 1 publication: Scientific Reports publication_identifier: issn: - 2045-2322 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: Water stabilizes an alternate turn conformation in horse heart myoglobin tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 13 year: '2023' ... --- _id: '18208' abstract: - lang: eng text: The holy grail of materials science is de novo molecular design, meaning engineering molecules with desired characteristics. The introduction of generative deep learning has greatly advanced efforts in this direction, yet molecular discovery remains challenging and often inefficient. Herein we introduce GaUDI, a guided diffusion model for inverse molecular design that combines an equivariant graph neural net for property prediction and a generative diffusion model. We demonstrate GaUDI’s effectiveness in designing molecules for organic electronic applications by using single- and multiple-objective tasks applied to a generated dataset of 475,000 polycyclic aromatic systems. GaUDI shows improved conditional design, generating molecules with optimal properties and even going beyond the original distribution to suggest better molecules than those in the dataset. In addition to point-wise targets, GaUDI can also be guided toward open-ended targets (for example, a minimum or maximum) and in all cases achieves close to 100% validity of generated molecules. article_processing_charge: No article_type: original author: - first_name: Tomer full_name: Weiss, Tomer last_name: Weiss - first_name: Eduardo full_name: Mayo Yanes, Eduardo last_name: Mayo Yanes - first_name: Sabyasachi full_name: Chakraborty, Sabyasachi last_name: Chakraborty - first_name: Luca full_name: Cosmo, Luca last_name: Cosmo - first_name: Alexander full_name: Bronstein, Alexander id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6 last_name: Bronstein orcid: 0000-0001-9699-8730 - first_name: Renana full_name: Gershoni-Poranne, Renana last_name: Gershoni-Poranne citation: ama: Weiss T, Mayo Yanes E, Chakraborty S, Cosmo L, Bronstein AM, Gershoni-Poranne R. Guided diffusion for inverse molecular design. Nature Computational Science. 2023;3(10):873-882. doi:10.1038/s43588-023-00532-0 apa: Weiss, T., Mayo Yanes, E., Chakraborty, S., Cosmo, L., Bronstein, A. M., & Gershoni-Poranne, R. (2023). Guided diffusion for inverse molecular design. Nature Computational Science. Springer Nature. https://doi.org/10.1038/s43588-023-00532-0 chicago: Weiss, Tomer, Eduardo Mayo Yanes, Sabyasachi Chakraborty, Luca Cosmo, Alex M. Bronstein, and Renana Gershoni-Poranne. “Guided Diffusion for Inverse Molecular Design.” Nature Computational Science. Springer Nature, 2023. https://doi.org/10.1038/s43588-023-00532-0. ieee: T. Weiss, E. Mayo Yanes, S. Chakraborty, L. Cosmo, A. M. Bronstein, and R. Gershoni-Poranne, “Guided diffusion for inverse molecular design,” Nature Computational Science, vol. 3, no. 10. Springer Nature, pp. 873–882, 2023. ista: Weiss T, Mayo Yanes E, Chakraborty S, Cosmo L, Bronstein AM, Gershoni-Poranne R. 2023. Guided diffusion for inverse molecular design. Nature Computational Science. 3(10), 873–882. mla: Weiss, Tomer, et al. “Guided Diffusion for Inverse Molecular Design.” Nature Computational Science, vol. 3, no. 10, Springer Nature, 2023, pp. 873–82, doi:10.1038/s43588-023-00532-0. short: T. Weiss, E. Mayo Yanes, S. Chakraborty, L. Cosmo, A.M. Bronstein, R. Gershoni-Poranne, Nature Computational Science 3 (2023) 873–882. date_created: 2024-10-08T12:46:58Z date_published: 2023-10-05T00:00:00Z date_updated: 2024-10-09T10:44:41Z day: '05' doi: 10.1038/s43588-023-00532-0 extern: '1' external_id: pmid: - '38177755' intvolume: ' 3' issue: '10' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.26434/chemrxiv-2023-z8ltp month: '10' oa: 1 oa_version: Preprint page: 873-882 pmid: 1 publication: Nature Computational Science publication_identifier: issn: - 2662-8457 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: Guided diffusion for inverse molecular design type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 3 year: '2023' ... --- _id: '18209' abstract: - lang: eng text: In this work, interpretable deep learning was used to identify structure–property relationships governing the HOMO–LUMO gap and the relative stability of polybenzenoid hydrocarbons (PBHs) using a ring-based graph representation. This representation was combined with a subunit-based perception of PBHs, allowing chemical insights to be presented in terms of intuitive and simple structural motifs. The resulting insights agree with conventional organic chemistry knowledge and electronic structure-based analyses and also reveal new behaviors and identify influential structural motifs. In particular, we evaluated and compared the effects of linear, angular, and branching motifs on these two molecular properties and explored the role of dispersion in mitigating the torsional strain inherent in nonplanar PBHs. Hence, the observed regularities and the proposed analysis contribute to a deeper understanding of the behavior of PBHs and form the foundation for design strategies for new functional PBHs. article_processing_charge: No article_type: original author: - first_name: Tomer full_name: Weiss, Tomer last_name: Weiss - first_name: Alexandra full_name: Wahab, Alexandra last_name: Wahab - first_name: Alexander full_name: Bronstein, Alexander id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6 last_name: Bronstein orcid: 0000-0001-9699-8730 - first_name: Renana full_name: Gershoni-Poranne, Renana last_name: Gershoni-Poranne citation: ama: Weiss T, Wahab A, Bronstein AM, Gershoni-Poranne R. Interpretable deep-learning unveils structure–property relationships in polybenzenoid hydrocarbons. The Journal of Organic Chemistry. 2023;88(14):9645-9656. doi:10.1021/acs.joc.2c02381 apa: Weiss, T., Wahab, A., Bronstein, A. M., & Gershoni-Poranne, R. (2023). Interpretable deep-learning unveils structure–property relationships in polybenzenoid hydrocarbons. The Journal of Organic Chemistry. American Chemical Society. https://doi.org/10.1021/acs.joc.2c02381 chicago: Weiss, Tomer, Alexandra Wahab, Alex M. Bronstein, and Renana Gershoni-Poranne. “Interpretable Deep-Learning Unveils Structure–Property Relationships in Polybenzenoid Hydrocarbons.” The Journal of Organic Chemistry. American Chemical Society, 2023. https://doi.org/10.1021/acs.joc.2c02381. ieee: T. Weiss, A. Wahab, A. M. Bronstein, and R. Gershoni-Poranne, “Interpretable deep-learning unveils structure–property relationships in polybenzenoid hydrocarbons,” The Journal of Organic Chemistry, vol. 88, no. 14. American Chemical Society, pp. 9645–9656, 2023. ista: Weiss T, Wahab A, Bronstein AM, Gershoni-Poranne R. 2023. Interpretable deep-learning unveils structure–property relationships in polybenzenoid hydrocarbons. The Journal of Organic Chemistry. 88(14), 9645–9656. mla: Weiss, Tomer, et al. “Interpretable Deep-Learning Unveils Structure–Property Relationships in Polybenzenoid Hydrocarbons.” The Journal of Organic Chemistry, vol. 88, no. 14, American Chemical Society, 2023, pp. 9645–56, doi:10.1021/acs.joc.2c02381. short: T. Weiss, A. Wahab, A.M. Bronstein, R. Gershoni-Poranne, The Journal of Organic Chemistry 88 (2023) 9645–9656. date_created: 2024-10-08T12:47:17Z date_published: 2023-01-25T00:00:00Z date_updated: 2024-10-09T10:49:42Z day: '25' doi: 10.1021/acs.joc.2c02381 extern: '1' external_id: pmid: - '36696660' intvolume: ' 88' issue: '14' language: - iso: eng main_file_link: - open_access: '1' url: 10.26434/chemrxiv-2022-krng1 month: '01' oa: 1 oa_version: Preprint page: 9645-9656 pmid: 1 publication: The Journal of Organic Chemistry publication_identifier: eissn: - 1520-6904 issn: - 0022-3263 publication_status: published publisher: American Chemical Society quality_controlled: '1' scopus_import: '1' status: public title: Interpretable deep-learning unveils structure–property relationships in polybenzenoid hydrocarbons type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 88 year: '2023' ... --- _id: '18212' abstract: - lang: eng text: The high memory bandwidth demand of sparse embedding layers continues to be a critical challenge in scaling the performance of recommendation models. While prior works have exploited heterogeneous memory system designs and partial embedding sum memoization techniques, they offer limited benefits. This is because prior designs either target a very small subset of embeddings to simplify their analysis or incur a high processing cost to account for all embeddings, which does not scale with the large sizes of modern embedding tables. This paper proposes GRACE-a lightweight and scalable graph-based algorithm-system co-design framework to significantly improve the embedding layer performance of recommendation models. GRACE proposes a novel Item Co-occurrence Graph (ICG) that scalably records item co-occurrences. GRACE then presents a new system-aware ICG clustering algorithm to find frequently accessed item combinations of arbitrary lengths to compute and memoize their partial sums. High-frequency partial sums are stored in a software-managed cache space to reduce memory traffic and improve the throughput of computing sparse features. We further present a cache data layout and low-cost address computation logic to efficiently lookup item embeddings and their partial sums. Our evaluation shows that GRACE significantly outperforms the state-of-the-art techniques SPACE and MERCI by 1.5x and 1.4x, respectively. article_processing_charge: No author: - first_name: Haojie full_name: Ye, Haojie last_name: Ye - first_name: Sanketh full_name: Vedula, Sanketh last_name: Vedula - first_name: Yuhan full_name: Chen, Yuhan last_name: Chen - first_name: Yichen full_name: Yang, Yichen last_name: Yang - first_name: Alexander full_name: Bronstein, Alexander id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6 last_name: Bronstein orcid: 0000-0001-9699-8730 - first_name: Ronald full_name: Dreslinski, Ronald last_name: Dreslinski - first_name: Trevor full_name: Mudge, Trevor last_name: Mudge - first_name: Nishil full_name: Talati, Nishil last_name: Talati citation: ama: 'Ye H, Vedula S, Chen Y, et al. GRACE: A scalable graph-based approach to accelerating recommendation model inference. In: Proceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems. Vol 11. Association for Computing Machinery; 2023:282-301. doi:10.1145/3582016.3582029' apa: 'Ye, H., Vedula, S., Chen, Y., Yang, Y., Bronstein, A. M., Dreslinski, R., … Talati, N. (2023). GRACE: A scalable graph-based approach to accelerating recommendation model inference. In Proceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems (Vol. 11, pp. 282–301). Association for Computing Machinery. https://doi.org/10.1145/3582016.3582029' chicago: 'Ye, Haojie, Sanketh Vedula, Yuhan Chen, Yichen Yang, Alex M. Bronstein, Ronald Dreslinski, Trevor Mudge, and Nishil Talati. “GRACE: A Scalable Graph-Based Approach to Accelerating Recommendation Model Inference.” In Proceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, 11:282–301. Association for Computing Machinery, 2023. https://doi.org/10.1145/3582016.3582029.' ieee: 'H. Ye et al., “GRACE: A scalable graph-based approach to accelerating recommendation model inference,” in Proceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, 2023, vol. 11, no. 3, pp. 282–301.' ista: 'Ye H, Vedula S, Chen Y, Yang Y, Bronstein AM, Dreslinski R, Mudge T, Talati N. 2023. GRACE: A scalable graph-based approach to accelerating recommendation model inference. Proceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems. vol. 11, 282–301.' mla: 'Ye, Haojie, et al. “GRACE: A Scalable Graph-Based Approach to Accelerating Recommendation Model Inference.” Proceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, vol. 11, no. 3, Association for Computing Machinery, 2023, pp. 282–301, doi:10.1145/3582016.3582029.' short: H. Ye, S. Vedula, Y. Chen, Y. Yang, A.M. Bronstein, R. Dreslinski, T. Mudge, N. Talati, in:, Proceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Association for Computing Machinery, 2023, pp. 282–301. date_created: 2024-10-08T12:48:11Z date_published: 2023-03-01T00:00:00Z date_updated: 2024-10-09T11:21:19Z day: '01' doi: 10.1145/3582016.3582029 extern: '1' intvolume: ' 11' issue: '3' language: - iso: eng month: '03' oa_version: None page: 282-301 publication: Proceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems publication_identifier: isbn: - '9781450399180' publication_status: published publisher: Association for Computing Machinery quality_controlled: '1' related_material: link: - relation: software url: https://doi.org/10.5281/zenodo.7699872 scopus_import: '1' status: public title: 'GRACE: A scalable graph-based approach to accelerating recommendation model inference' type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 11 year: '2023' ... --- _id: '18213' abstract: - lang: eng text: "What is the best way to match the nodes of two graphs? This graph alignment problem generalizes graph isomorphism and arises in applications from social network analysis to bioinformatics. Some solutions assume that auxiliary information on known matches or node or edge attributes is available, or utilize arbitrary graph features. Such methods fare poorly in the pure form of the problem, in which only graph structures are given. Other proposals translate the problem to one of aligning node embeddings, yet, by doing so, provide only a single-scale view of the graph.\r\nIn this article, we transfer the shape-analysis concept of functional maps from the continuous to the discrete case, and treat the graph alignment problem as a special case of the problem of finding a mapping between functions on graphs. We present GRASP, a method that first establishes a correspondence between functions derived from Laplacian matrix eigenvectors, which capture multiscale structural characteristics, and then exploits this correspondence to align nodes. We enhance the basic form of GRASP by altering two of its components, namely the embedding method and the assignment procedure it employs, leveraging its modular, hence adaptable design. Our experimental study, featuring noise levels higher than anything used in previous studies, shows that the enhanced form of GRASP outperforms scalable state-of-the-art methods for graph alignment across noise levels and graph types, and performs competitively with respect to the best non-scalable ones. We include in our study another modular graph alignment algorithm, CONE, which is also adaptable thanks to its modular nature, and show it can manage graphs with skewed power-law degree distributions." article_number: '50' article_processing_charge: No article_type: original author: - first_name: Judith full_name: Hermanns, Judith last_name: Hermanns - first_name: Konstantinos full_name: Skitsas, Konstantinos last_name: Skitsas - first_name: Anton full_name: Tsitsulin, Anton last_name: Tsitsulin - first_name: Marina full_name: Munkhoeva, Marina last_name: Munkhoeva - first_name: Alexander full_name: Kyster, Alexander last_name: Kyster - first_name: Simon full_name: Nielsen, Simon last_name: Nielsen - first_name: Alexander full_name: Bronstein, Alexander id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6 last_name: Bronstein orcid: 0000-0001-9699-8730 - first_name: Davide full_name: Mottin, Davide last_name: Mottin - first_name: Panagiotis full_name: Karras, Panagiotis last_name: Karras citation: ama: 'Hermanns J, Skitsas K, Tsitsulin A, et al. GRASP: Scalable graph alignment by spectral corresponding functions. ACM Transactions on Knowledge Discovery from Data. 2023;17(4). doi:10.1145/3561058' apa: 'Hermanns, J., Skitsas, K., Tsitsulin, A., Munkhoeva, M., Kyster, A., Nielsen, S., … Karras, P. (2023). GRASP: Scalable graph alignment by spectral corresponding functions. ACM Transactions on Knowledge Discovery from Data. Association for Computing Machinery. https://doi.org/10.1145/3561058' chicago: 'Hermanns, Judith, Konstantinos Skitsas, Anton Tsitsulin, Marina Munkhoeva, Alexander Kyster, Simon Nielsen, Alex M. Bronstein, Davide Mottin, and Panagiotis Karras. “GRASP: Scalable Graph Alignment by Spectral Corresponding Functions.” ACM Transactions on Knowledge Discovery from Data. Association for Computing Machinery, 2023. https://doi.org/10.1145/3561058.' ieee: 'J. Hermanns et al., “GRASP: Scalable graph alignment by spectral corresponding functions,” ACM Transactions on Knowledge Discovery from Data, vol. 17, no. 4. Association for Computing Machinery, 2023.' ista: 'Hermanns J, Skitsas K, Tsitsulin A, Munkhoeva M, Kyster A, Nielsen S, Bronstein AM, Mottin D, Karras P. 2023. GRASP: Scalable graph alignment by spectral corresponding functions. ACM Transactions on Knowledge Discovery from Data. 17(4), 50.' mla: 'Hermanns, Judith, et al. “GRASP: Scalable Graph Alignment by Spectral Corresponding Functions.” ACM Transactions on Knowledge Discovery from Data, vol. 17, no. 4, 50, Association for Computing Machinery, 2023, doi:10.1145/3561058.' short: J. Hermanns, K. Skitsas, A. Tsitsulin, M. Munkhoeva, A. Kyster, S. Nielsen, A.M. Bronstein, D. Mottin, P. Karras, ACM Transactions on Knowledge Discovery from Data 17 (2023). date_created: 2024-10-08T12:48:38Z date_published: 2023-02-24T00:00:00Z date_updated: 2024-10-09T11:24:50Z day: '24' doi: 10.1145/3561058 extern: '1' intvolume: ' 17' issue: '4' language: - iso: eng month: '02' oa_version: None publication: ACM Transactions on Knowledge Discovery from Data publication_identifier: eissn: - 1556-472X issn: - 1556-4681 publication_status: published publisher: Association for Computing Machinery quality_controlled: '1' scopus_import: '1' status: public title: 'GRASP: Scalable graph alignment by spectral corresponding functions' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 17 year: '2023' ... --- _id: '18214' abstract: - lang: eng text: "Graph sparsification is a technique that approximates a given graph by a sparse graph with a subset of vertices and/or edges. The goal of an effective sparsification algorithm is to maintain specific graph properties relevant to the downstream task while minimizing the graph's size. Graph algorithms often suffer from long execution time due to the irregularity and the large real-world graph size. Graph sparsification can be applied to greatly reduce the run time of graph algorithms by substituting the full graph with a much smaller sparsified graph, without significantly degrading the output quality. However, the interaction between numerous sparsifiers and graph properties is not widely explored, and the potential of graph sparsification is not fully understood.\r\n In this work, we cover 16 widely-used graph metrics, 12 representative graph sparsification algorithms, and 14 real-world input graphs spanning various categories, exhibiting diverse characteristics, sizes, and densities. We developed a framework to extensively assess the performance of these sparsification algorithms against graph metrics, and provide insights to the results. Our study shows that there is no one sparsifier that performs the best in preserving all graph properties, e.g. sparsifiers that preserve distance-related graph properties (eccentricity) struggle to perform well on Graph Neural Networks (GNN). This paper presents a comprehensive experimental study evaluating the performance of sparsification algorithms in preserving essential graph metrics. The insights inform future research in incorporating matching graph sparsification to graph algorithms to maximize benefits while minimizing quality degradation. Furthermore, we provide a framework to facilitate the future evaluation of evolving sparsification algorithms, graph metrics, and ever-growing graph data." article_processing_charge: No article_type: original arxiv: 1 author: - first_name: Yuhan full_name: Chen, Yuhan last_name: Chen - first_name: Haojie full_name: Ye, Haojie last_name: Ye - first_name: Sanketh full_name: Vedula, Sanketh last_name: Vedula - first_name: Alexander full_name: Bronstein, Alexander id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6 last_name: Bronstein orcid: 0000-0001-9699-8730 - first_name: Ronald full_name: Dreslinski, Ronald last_name: Dreslinski - first_name: Trevor full_name: Mudge, Trevor last_name: Mudge - first_name: Nishil full_name: Talati, Nishil last_name: Talati citation: ama: Chen Y, Ye H, Vedula S, et al. Demystifying graph sparsification algorithms in graph properties preservation. Proceedings of the VLDB Endowment. 2023;17(3):427-440. doi:10.14778/3632093.3632106 apa: Chen, Y., Ye, H., Vedula, S., Bronstein, A. M., Dreslinski, R., Mudge, T., & Talati, N. (2023). Demystifying graph sparsification algorithms in graph properties preservation. Proceedings of the VLDB Endowment. Association for Computing Machinery. https://doi.org/10.14778/3632093.3632106 chicago: Chen, Yuhan, Haojie Ye, Sanketh Vedula, Alex M. Bronstein, Ronald Dreslinski, Trevor Mudge, and Nishil Talati. “Demystifying Graph Sparsification Algorithms in Graph Properties Preservation.” Proceedings of the VLDB Endowment. Association for Computing Machinery, 2023. https://doi.org/10.14778/3632093.3632106. ieee: Y. Chen et al., “Demystifying graph sparsification algorithms in graph properties preservation,” Proceedings of the VLDB Endowment, vol. 17, no. 3. Association for Computing Machinery, pp. 427–440, 2023. ista: Chen Y, Ye H, Vedula S, Bronstein AM, Dreslinski R, Mudge T, Talati N. 2023. Demystifying graph sparsification algorithms in graph properties preservation. Proceedings of the VLDB Endowment. 17(3), 427–440. mla: Chen, Yuhan, et al. “Demystifying Graph Sparsification Algorithms in Graph Properties Preservation.” Proceedings of the VLDB Endowment, vol. 17, no. 3, Association for Computing Machinery, 2023, pp. 427–40, doi:10.14778/3632093.3632106. short: Y. Chen, H. Ye, S. Vedula, A.M. Bronstein, R. Dreslinski, T. Mudge, N. Talati, Proceedings of the VLDB Endowment 17 (2023) 427–440. date_created: 2024-10-08T12:48:57Z date_published: 2023-11-01T00:00:00Z date_updated: 2024-10-09T11:28:33Z day: '01' doi: 10.14778/3632093.3632106 extern: '1' external_id: arxiv: - '2311.12314' intvolume: ' 17' issue: '3' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2311.12314 month: '11' oa: 1 oa_version: Preprint page: 427-440 publication: Proceedings of the VLDB Endowment publication_identifier: issn: - 2150-8097 publication_status: published publisher: Association for Computing Machinery quality_controlled: '1' scopus_import: '1' status: public title: Demystifying graph sparsification algorithms in graph properties preservation type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 17 year: '2023' ... --- _id: '18215' abstract: - lang: eng text: 'We study the problem of real-time scheduling in a multi-hop millimeter-wave (mmWave) mesh. We develop a model-free deep reinforcement learning algorithm called Adaptive Activator RL (AARL), which determines the subset of mmWave links that should be activated during each time slot and the power level for each link. The most important property of AARL is its ability to make scheduling decisions within the strict time frame constraints of typical 5G mmWave networks. AARL can handle a variety of network topologies, network loads, and interference models, it can also adapt to different workloads. We demonstrate the operation of AARL on several topologies: a small topology with 10 links, a moderately-sized mesh with 48 links, and a large topology with 96 links. We show that for each topology, we compare the throughput obtained by AARL to that of a benchmark algorithm called RPMA (Residual Profit Maximizer Algorithm). The most important advantage of AARL compared to RPMA is that it is much faster and can make the necessary scheduling decisions very rapidly during every time slot, while RPMA cannot. In addition, the quality of the scheduling decisions made by AARL outperforms those made by RPMA.' article_processing_charge: No arxiv: 1 author: - first_name: Barak full_name: Gahtan, Barak last_name: Gahtan - first_name: Reuven full_name: Cohen, Reuven last_name: Cohen - first_name: Alexander full_name: Bronstein, Alexander id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6 last_name: Bronstein orcid: 0000-0001-9699-8730 - first_name: Gil full_name: Kedar, Gil last_name: Kedar citation: ama: 'Gahtan B, Cohen R, Bronstein AM, Kedar G. Using deep reinforcement learning for mmWave real-time scheduling. In: 14th International Conference on Network of the Future. IEEE; 2023:71-79. doi:10.1109/nof58724.2023.10302794' apa: 'Gahtan, B., Cohen, R., Bronstein, A. M., & Kedar, G. (2023). Using deep reinforcement learning for mmWave real-time scheduling. In 14th International Conference on Network of the Future (pp. 71–79). Izmir, Turkiye: IEEE. https://doi.org/10.1109/nof58724.2023.10302794' chicago: Gahtan, Barak, Reuven Cohen, Alex M. Bronstein, and Gil Kedar. “Using Deep Reinforcement Learning for MmWave Real-Time Scheduling.” In 14th International Conference on Network of the Future, 71–79. IEEE, 2023. https://doi.org/10.1109/nof58724.2023.10302794. ieee: B. Gahtan, R. Cohen, A. M. Bronstein, and G. Kedar, “Using deep reinforcement learning for mmWave real-time scheduling,” in 14th International Conference on Network of the Future, Izmir, Turkiye, 2023, pp. 71–79. ista: 'Gahtan B, Cohen R, Bronstein AM, Kedar G. 2023. Using deep reinforcement learning for mmWave real-time scheduling. 14th International Conference on Network of the Future. NoF: Conference on Network of the Future, 71–79.' mla: Gahtan, Barak, et al. “Using Deep Reinforcement Learning for MmWave Real-Time Scheduling.” 14th International Conference on Network of the Future, IEEE, 2023, pp. 71–79, doi:10.1109/nof58724.2023.10302794. short: B. Gahtan, R. Cohen, A.M. Bronstein, G. Kedar, in:, 14th International Conference on Network of the Future, IEEE, 2023, pp. 71–79. conference: end_date: 2023-10-06 location: Izmir, Turkiye name: 'NoF: Conference on Network of the Future' start_date: 2023-10-04 date_created: 2024-10-08T12:50:18Z date_published: 2023-11-01T00:00:00Z date_updated: 2024-10-09T11:40:45Z day: '01' doi: 10.1109/nof58724.2023.10302794 extern: '1' external_id: arxiv: - '2210.01423' language: - iso: eng main_file_link: - open_access: '1' url: ' https://doi.org/10.48550/arXiv.2210.01423' month: '11' oa: 1 oa_version: Preprint page: 71-79 publication: 14th International Conference on Network of the Future publication_identifier: eissn: - 2833-0072 isbn: - '9798350338089' publication_status: published publisher: IEEE quality_controlled: '1' scopus_import: '1' status: public title: Using deep reinforcement learning for mmWave real-time scheduling type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2023' ... --- _id: '18216' abstract: - lang: eng text: Protein structure, both at the global and local level, dictates function. Proteins fold from chains of amino acids, forming secondary structures, α-helices and β-strands, that, at least for globular proteins, subsequently fold into a three-dimensional structure. Here, we show that a Ramachandran-type plot focusing on the two dihedral angles separated by the peptide bond, and entirely contained within an amino acid pair, defines a local structural unit. We further demonstrate the usefulness of this cross-peptide-bond Ramachandran plot by showing that it captures β-turn conformations in coil regions, that traditional Ramachandran plot outliers fall into occupied regions of our plot, and that thermophilic proteins prefer specific amino acid pair conformations. Further, we demonstrate experimentally that the effect of a point mutation on backbone conformation and protein stability depends on the amino acid pair context, i.e., the identity of the adjacent amino acid, in a manner predictable by our method. article_number: e2301064120 article_processing_charge: Yes (in subscription journal) article_type: original author: - first_name: Aviv A. full_name: Rosenberg, Aviv A. last_name: Rosenberg - first_name: Nitsan full_name: Yehishalom, Nitsan last_name: Yehishalom - first_name: Ailie full_name: Marx, Ailie last_name: Marx - first_name: Alexander full_name: Bronstein, Alexander id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6 last_name: Bronstein orcid: 0000-0001-9699-8730 citation: ama: Rosenberg AA, Yehishalom N, Marx A, Bronstein AM. An amino-domino model described by a cross-peptide-bond Ramachandran plot defines amino acid pairs as local structural units. Proceedings of the National Academy of Sciences. 2023;120(44). doi:10.1073/pnas.2301064120 apa: Rosenberg, A. A., Yehishalom, N., Marx, A., & Bronstein, A. M. (2023). An amino-domino model described by a cross-peptide-bond Ramachandran plot defines amino acid pairs as local structural units. Proceedings of the National Academy of Sciences. National Academy of Sciences. https://doi.org/10.1073/pnas.2301064120 chicago: Rosenberg, Aviv A., Nitsan Yehishalom, Ailie Marx, and Alex M. Bronstein. “An Amino-Domino Model Described by a Cross-Peptide-Bond Ramachandran Plot Defines Amino Acid Pairs as Local Structural Units.” Proceedings of the National Academy of Sciences. National Academy of Sciences, 2023. https://doi.org/10.1073/pnas.2301064120. ieee: A. A. Rosenberg, N. Yehishalom, A. Marx, and A. M. Bronstein, “An amino-domino model described by a cross-peptide-bond Ramachandran plot defines amino acid pairs as local structural units,” Proceedings of the National Academy of Sciences, vol. 120, no. 44. National Academy of Sciences, 2023. ista: Rosenberg AA, Yehishalom N, Marx A, Bronstein AM. 2023. An amino-domino model described by a cross-peptide-bond Ramachandran plot defines amino acid pairs as local structural units. Proceedings of the National Academy of Sciences. 120(44), e2301064120. mla: Rosenberg, Aviv A., et al. “An Amino-Domino Model Described by a Cross-Peptide-Bond Ramachandran Plot Defines Amino Acid Pairs as Local Structural Units.” Proceedings of the National Academy of Sciences, vol. 120, no. 44, e2301064120, National Academy of Sciences, 2023, doi:10.1073/pnas.2301064120. short: A.A. Rosenberg, N. Yehishalom, A. Marx, A.M. Bronstein, Proceedings of the National Academy of Sciences 120 (2023). date_created: 2024-10-08T12:50:36Z date_published: 2023-10-25T00:00:00Z date_updated: 2024-10-09T11:55:12Z day: '25' doi: 10.1073/pnas.2301064120 extern: '1' external_id: pmid: - '37878722' intvolume: ' 120' issue: '44' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1073/pnas.2301064120 month: '10' oa: 1 oa_version: Published Version pmid: 1 publication: Proceedings of the National Academy of Sciences publication_identifier: eissn: - 1091-6490 issn: - 0027-8424 publication_status: published publisher: National Academy of Sciences quality_controlled: '1' scopus_import: '1' status: public title: An amino-domino model described by a cross-peptide-bond Ramachandran plot defines amino acid pairs as local structural units type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 120 year: '2023' ... --- _id: '18217' abstract: - lang: eng text: A central challenge in building robotic prostheses is the creation of a sensor-based system able to read physiological signals from the lower limb and instruct a robotic hand to perform various tasks. Existing systems typically perform discrete gestures such as pointing or grasping, by employing electromyography (EMG) or ultrasound (US) technologies to analyze muscle states. While estimating finger gestures has been done in the past by detecting prominent gestures, we are interested in detection, or inference, done in the context of fine motions that evolve over time. Examples include motions occurring when performing fine and dexterous tasks such as keyboard typing or piano playing. We consider this task as an important step towards higher adoption rates of robotic prostheses among arm amputees, as it has the potential to dramatically increase functionality in performing daily tasks. To this end, we present an end-to-end robotic system, which can successfully infer fine finger motions. This is achieved by modeling the hand as a robotic manipulator and using it as an intermediate representation to encode muscles' dynamics from a sequence of US images. We evaluated our method by collecting data from a group of subjects and demonstrating how it can be used to replay music played or text typed. To the best of our knowledge, this is the first study demonstrating these downstream tasks within an end-to-end system. article_processing_charge: No arxiv: 1 author: - first_name: Dean full_name: Zadok, Dean last_name: Zadok - first_name: Oren full_name: Salzman, Oren last_name: Salzman - first_name: Alon full_name: Wolf, Alon last_name: Wolf - first_name: Alexander full_name: Bronstein, Alexander id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6 last_name: Bronstein orcid: 0000-0001-9699-8730 citation: ama: 'Zadok D, Salzman O, Wolf A, Bronstein AM. Towards predicting fine finger motions from ultrasound images via kinematic representation. In: 2023 IEEE International Conference on Robotics and Automation. Vol 27. IEEE; 2023. doi:10.1109/icra48891.2023.10160601' apa: 'Zadok, D., Salzman, O., Wolf, A., & Bronstein, A. M. (2023). Towards predicting fine finger motions from ultrasound images via kinematic representation. In 2023 IEEE International Conference on Robotics and Automation (Vol. 27). London, United Kingdom: IEEE. https://doi.org/10.1109/icra48891.2023.10160601' chicago: Zadok, Dean, Oren Salzman, Alon Wolf, and Alex M. Bronstein. “Towards Predicting Fine Finger Motions from Ultrasound Images via Kinematic Representation.” In 2023 IEEE International Conference on Robotics and Automation, Vol. 27. IEEE, 2023. https://doi.org/10.1109/icra48891.2023.10160601. ieee: D. Zadok, O. Salzman, A. Wolf, and A. M. Bronstein, “Towards predicting fine finger motions from ultrasound images via kinematic representation,” in 2023 IEEE International Conference on Robotics and Automation, London, United Kingdom, 2023, vol. 27. ista: 'Zadok D, Salzman O, Wolf A, Bronstein AM. 2023. Towards predicting fine finger motions from ultrasound images via kinematic representation. 2023 IEEE International Conference on Robotics and Automation. ICRA: Conference on Robotics and Automation vol. 27.' mla: Zadok, Dean, et al. “Towards Predicting Fine Finger Motions from Ultrasound Images via Kinematic Representation.” 2023 IEEE International Conference on Robotics and Automation, vol. 27, IEEE, 2023, doi:10.1109/icra48891.2023.10160601. short: D. Zadok, O. Salzman, A. Wolf, A.M. Bronstein, in:, 2023 IEEE International Conference on Robotics and Automation, IEEE, 2023. conference: end_date: 2023-06-02 location: London, United Kingdom name: 'ICRA: Conference on Robotics and Automation' start_date: 2023-05-29 date_created: 2024-10-08T12:50:55Z date_published: 2023-07-04T00:00:00Z date_updated: 2024-10-09T12:00:32Z day: '04' doi: 10.1109/icra48891.2023.10160601 extern: '1' external_id: arxiv: - '2202.05204' intvolume: ' 27' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2202.05204 month: '07' oa: 1 oa_version: Preprint publication: 2023 IEEE International Conference on Robotics and Automation publication_identifier: eisbn: - '9798350323658' publication_status: published publisher: IEEE quality_controlled: '1' scopus_import: '1' status: public title: Towards predicting fine finger motions from ultrasound images via kinematic representation type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 27 year: '2023' ... --- _id: '18218' abstract: - lang: eng text: Deep neural networks are known to be susceptible to adversarial perturbations – small perturbations that alter the output of the network and exist under strict norm limitations. While such perturbations are usually discussed as tailored to a specific input, a universal perturbation can be constructed to alter the model’s output on a set of inputs. Universal perturbations present a more realistic case of adversarial attacks, as awareness of the model’s exact input is not required. In addition, the universal attack setting raises the subject of generalization to unseen data, where given a set of inputs, the universal perturbations aim to alter the model’s output on out-of-sample data. In this work, we study physical passive patch adversarial attacks on visual odometry-based autonomous navigation systems. A visual odometry system aims to infer the relative camera motion between two corresponding viewpoints, and is frequently used by vision-based autonomous navigation systems to estimate their state. For such navigation systems, a patch adversarial perturbation poses a severe security issue, as it can be used to mislead a system onto some collision course. To the best of our knowledge, we show for the first time that the error margin of a visual odometry model can be significantly increased by deploying patch adversarial attacks in the scene. We provide evaluation on synthetic closed-loop drone navigation data and demonstrate that a comparable vulnerability exists in real data. A reference implementation of the proposed method and the reported experiments is provided at https://github.com/patchadversarialattacks/patchadversarialattacks. alternative_title: - LNCS article_processing_charge: No arxiv: 1 author: - first_name: Yaniv full_name: Nemcovsky, Yaniv last_name: Nemcovsky - first_name: Matan full_name: Jacoby, Matan last_name: Jacoby - first_name: Alexander full_name: Bronstein, Alexander id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6 last_name: Bronstein orcid: 0000-0001-9699-8730 - first_name: Chaim full_name: Baskin, Chaim last_name: Baskin citation: ama: 'Nemcovsky Y, Jacoby M, Bronstein AM, Baskin C. Physical passive patch adversarial attacks on visual odometry systems. In: 16th Asian Conference on Computer Vision. Vol 13847. Springer Nature; 2023:518-534. doi:10.1007/978-3-031-26293-7_31' apa: 'Nemcovsky, Y., Jacoby, M., Bronstein, A. M., & Baskin, C. (2023). Physical passive patch adversarial attacks on visual odometry systems. In 16th Asian Conference on Computer Vision (Vol. 13847, pp. 518–534). Macao, China: Springer Nature. https://doi.org/10.1007/978-3-031-26293-7_31' chicago: Nemcovsky, Yaniv, Matan Jacoby, Alex M. Bronstein, and Chaim Baskin. “Physical Passive Patch Adversarial Attacks on Visual Odometry Systems.” In 16th Asian Conference on Computer Vision, 13847:518–34. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-26293-7_31. ieee: Y. Nemcovsky, M. Jacoby, A. M. Bronstein, and C. Baskin, “Physical passive patch adversarial attacks on visual odometry systems,” in 16th Asian Conference on Computer Vision, Macao, China, 2023, vol. 13847, pp. 518–534. ista: 'Nemcovsky Y, Jacoby M, Bronstein AM, Baskin C. 2023. Physical passive patch adversarial attacks on visual odometry systems. 16th Asian Conference on Computer Vision. ACCV: Asian Conference on Computer Vision, LNCS, vol. 13847, 518–534.' mla: Nemcovsky, Yaniv, et al. “Physical Passive Patch Adversarial Attacks on Visual Odometry Systems.” 16th Asian Conference on Computer Vision, vol. 13847, Springer Nature, 2023, pp. 518–34, doi:10.1007/978-3-031-26293-7_31. short: Y. Nemcovsky, M. Jacoby, A.M. Bronstein, C. Baskin, in:, 16th Asian Conference on Computer Vision, Springer Nature, 2023, pp. 518–534. conference: end_date: 2022-12-08 location: Macao, China name: 'ACCV: Asian Conference on Computer Vision' start_date: 2022-12-04 date_created: 2024-10-08T12:51:14Z date_published: 2023-03-11T00:00:00Z date_updated: 2024-10-09T12:13:36Z day: '11' doi: 10.1007/978-3-031-26293-7_31 extern: '1' external_id: arxiv: - '2207.05729' intvolume: ' 13847' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2207.05729 month: '03' oa: 1 oa_version: Preprint page: 518-534 publication: 16th Asian Conference on Computer Vision publication_identifier: eisbn: - '9783031262937' eissn: - 1611-3349 isbn: - '9783031262920' issn: - 0302-9743 publication_status: published publisher: Springer Nature quality_controlled: '1' related_material: link: - relation: software url: https://github.com/patchadversarialattacks/patchadversarialattacks scopus_import: '1' status: public title: Physical passive patch adversarial attacks on visual odometry systems type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 13847 year: '2023' ... --- _id: '18219' abstract: - lang: eng text: Nowadays, many of the images captured are ‘observed’ by machines only and not by humans, e.g., in autonomous systems. High-level machine vision models, such as object recognition or semantic segmentation, assume images are transformed into some canonical image space by the camera Image Signal Processor (ISP). However, the camera ISP is optimized for producing visually pleasing images for human observers and not for machines. Therefore, one may spare the ISP compute time and apply vision models directly to RAW images. Yet, it has been shown that training such models directly on RAW images results in a performance drop. To mitigate this drop, we use a RAW and RGB image pairs dataset, which can be easily acquired with no human labeling. We then train a model that is applied directly to the RAW data by using knowledge distillation such that the model predictions for RAW images will be aligned with the predictions of an off-the-shelf pre-trained model for processed RGB images. Our experiments show that our performance on RAW images for object classification and semantic segmentation is significantly better than models trained on labeled RAW images. It also reasonably matches the predictions of a pre-trained model on processed RGB images, while saving the ISP compute overhead. article_processing_charge: No article_type: original arxiv: 1 author: - first_name: Eli full_name: Schwartz, Eli last_name: Schwartz - first_name: Alexander full_name: Bronstein, Alexander id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6 last_name: Bronstein orcid: 0000-0001-9699-8730 - first_name: Raja full_name: Giryes, Raja last_name: Giryes citation: ama: Schwartz E, Bronstein AM, Giryes R. ISP Distillation. IEEE Open Journal of Signal Processing. 2023;4:12-20. doi:10.1109/ojsp.2023.3239819 apa: Schwartz, E., Bronstein, A. M., & Giryes, R. (2023). ISP Distillation. IEEE Open Journal of Signal Processing. Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/ojsp.2023.3239819 chicago: Schwartz, Eli, Alex M. Bronstein, and Raja Giryes. “ISP Distillation.” IEEE Open Journal of Signal Processing. Institute of Electrical and Electronics Engineers, 2023. https://doi.org/10.1109/ojsp.2023.3239819. ieee: E. Schwartz, A. M. Bronstein, and R. Giryes, “ISP Distillation,” IEEE Open Journal of Signal Processing, vol. 4. Institute of Electrical and Electronics Engineers, pp. 12–20, 2023. ista: Schwartz E, Bronstein AM, Giryes R. 2023. ISP Distillation. IEEE Open Journal of Signal Processing. 4, 12–20. mla: Schwartz, Eli, et al. “ISP Distillation.” IEEE Open Journal of Signal Processing, vol. 4, Institute of Electrical and Electronics Engineers, 2023, pp. 12–20, doi:10.1109/ojsp.2023.3239819. short: E. Schwartz, A.M. Bronstein, R. Giryes, IEEE Open Journal of Signal Processing 4 (2023) 12–20. date_created: 2024-10-08T12:51:32Z date_published: 2023-01-25T00:00:00Z date_updated: 2024-10-09T12:24:13Z day: '25' doi: 10.1109/ojsp.2023.3239819 extern: '1' external_id: arxiv: - '2101.10203' intvolume: ' 4' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1109/OJSP.2023.3239819 month: '01' oa: 1 oa_version: Published Version page: 12-20 publication: IEEE Open Journal of Signal Processing publication_identifier: issn: - 2644-1322 publication_status: published publisher: Institute of Electrical and Electronics Engineers quality_controlled: '1' scopus_import: '1' status: public title: ISP Distillation type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 4 year: '2023' ... --- OA_place: publisher OA_type: hybrid _id: '18621' abstract: - lang: eng text: During neural development, cellular adhesion is crucial for interactions among and between neurons and surrounding tissues. This function is mediated by conserved cell adhesion molecules, which are tightly regulated to allow for coordinated neuronal outgrowth. Here, we show that the proprotein convertase KPC-1 (homolog of mammalian furin) regulates the Menorin adhesion complex during development of PVD dendritic arbors in Caenorhabditis elegans. We found a finely regulated antagonistic balance between PVD-expressed KPC-1 and the epidermally expressed putative cell adhesion molecule MNR-1 (Menorin). Genetically, partial loss of mnr-1 suppressed partial loss of kpc-1, and both loss of kpc-1 and transgenic overexpression of mnr-1 resulted in indistinguishable phenotypes in PVD dendrites. This balance regulated cell-surface localization of the DMA-1 leucine-rich transmembrane receptor in PVD neurons. Lastly, kpc-1 mutants showed increased amounts of MNR-1 and decreased amounts of muscle-derived LECT-2 (Chondromodulin II), which is also part of the Menorin adhesion complex. These observations suggest that KPC-1 in PVD neurons directly or indirectly controls the abundance of proteins of the Menorin adhesion complex from adjacent tissues, thereby providing negative feedback from the dendrite to the instructive cues of surrounding tissues. acknowledgement: "We thank members of the Bülow laboratory for comments on the manuscript and discussions throughout the course of this work; and Ryan Peer and William Corman for their initial help with the modifier genetic screen. We acknowledge the Genomics Core facility and the Advanced Imaging Facility at Albert Einstein College of Medicine for help during these studies. We are grateful to Kang Shen, David Miller and the Caenorhabditis Genetics Center (which is funded by National Institutes of Health Office of Research Infrastructure Programs P40OD0104400) for some of the strains used in this study, and Lhisia Chen for the anti-SAX-7 antibody.\r\nThis work was supported by grants from the National Institutes of Health (F31NS100370 to M.R.; T32GM007288 and F31NS111939 to M.T.; R01NS096672, R21NS081505 and R01NS129992 to H.E.B.; and P30HD071593 to Albert Einstein College of Medicine). N.J.R.-S. was the recipient of a Colciencias-Fulbright Fellowship [funded by Departamento Administrativo de Ciencia, Tecnología e Innovación (COLCIENCIAS) and Fulbright Colombia], L.T.H.T. of a Croucher Foundation Fellowship, and H.E.B. of an Irma T. Hirschl Trust/Monique Weill-Caulier Trust research fellowship. Open Access funding provided by Albert Einstein College of Medicine, Yeshiva University. Deposited in PMC for immediate release." article_processing_charge: No article_type: original author: - first_name: Nelson full_name: Ramirez, Nelson id: 39831956-E4FE-11E9-85DE-0DC7E5697425 last_name: Ramirez - first_name: Helen M. full_name: Belalcazar, Helen M. last_name: Belalcazar - first_name: Maisha full_name: Rahman, Maisha last_name: Rahman - first_name: Meera full_name: Trivedi, Meera last_name: Trivedi - first_name: Leo T. H. full_name: Tang, Leo T. H. last_name: Tang - first_name: Hannes E. full_name: Bülow, Hannes E. last_name: Bülow citation: ama: Ramirez N, Belalcazar HM, Rahman M, Trivedi M, Tang LTH, Bülow HE. Convertase-dependent regulation of membrane-tethered and secreted ligands tunes dendrite adhesion. Development. 2023;150(18). doi:10.1242/dev.201208 apa: Ramirez, N., Belalcazar, H. M., Rahman, M., Trivedi, M., Tang, L. T. H., & Bülow, H. E. (2023). Convertase-dependent regulation of membrane-tethered and secreted ligands tunes dendrite adhesion. Development. The Company of Biologists. https://doi.org/10.1242/dev.201208 chicago: Ramirez, Nelson, Helen M. Belalcazar, Maisha Rahman, Meera Trivedi, Leo T. H. Tang, and Hannes E. Bülow. “Convertase-Dependent Regulation of Membrane-Tethered and Secreted Ligands Tunes Dendrite Adhesion.” Development. The Company of Biologists, 2023. https://doi.org/10.1242/dev.201208. ieee: N. Ramirez, H. M. Belalcazar, M. Rahman, M. Trivedi, L. T. H. Tang, and H. E. Bülow, “Convertase-dependent regulation of membrane-tethered and secreted ligands tunes dendrite adhesion,” Development, vol. 150, no. 18. The Company of Biologists, 2023. ista: Ramirez N, Belalcazar HM, Rahman M, Trivedi M, Tang LTH, Bülow HE. 2023. Convertase-dependent regulation of membrane-tethered and secreted ligands tunes dendrite adhesion. Development. 150(18). mla: Ramirez, Nelson, et al. “Convertase-Dependent Regulation of Membrane-Tethered and Secreted Ligands Tunes Dendrite Adhesion.” Development, vol. 150, no. 18, The Company of Biologists, 2023, doi:10.1242/dev.201208. short: N. Ramirez, H.M. Belalcazar, M. Rahman, M. Trivedi, L.T.H. Tang, H.E. Bülow, Development 150 (2023). date_created: 2024-12-04T22:02:52Z date_published: 2023-09-18T00:00:00Z date_updated: 2024-12-09T11:43:40Z day: '18' ddc: - '570' doi: 10.1242/dev.201208 extern: '1' external_id: pmid: - '37721334' file: - access_level: open_access checksum: d2158dc56db50457e6404c4afec4401c content_type: application/pdf creator: nramirez date_created: 2024-12-04T22:12:04Z date_updated: 2024-12-04T22:12:04Z file_id: '18624' file_name: dev201208.pdf file_size: 9559527 relation: main_file success: 1 file_date_updated: 2024-12-04T22:12:04Z has_accepted_license: '1' intvolume: ' 150' issue: '18' language: - iso: eng month: '09' oa: 1 oa_version: Published Version pmid: 1 publication: Development publication_identifier: eissn: - 1477-9129 issn: - 0950-1991 publication_status: published publisher: The Company of Biologists quality_controlled: '1' scopus_import: '1' status: public title: Convertase-dependent regulation of membrane-tethered and secreted ligands tunes dendrite adhesion 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: 150 year: '2023' ... --- OA_place: repository _id: '18634' abstract: - lang: eng text: 'There are 4 tar.xz files with the result of the model for the paper: A 3D glacier dynamics-line plume model to estimate the frontal ablation of Hansbreen, Svalbard. ' article_processing_charge: No author: - first_name: José M full_name: Muñoz Hermosilla, José M id: e1037a6d-646e-11ef-b402-e0ed9ab0901e last_name: Muñoz Hermosilla citation: ama: Muñoz Hermosilla JM. A 3D glacier dynamics-line plume model to estimate the frontal ablation of Hansbreen. 2023. doi:10.5281/ZENODO.8005257 apa: Muñoz Hermosilla, J. M. (2023). A 3D glacier dynamics-line plume model to estimate the frontal ablation of Hansbreen. Zenodo. https://doi.org/10.5281/ZENODO.8005257 chicago: Muñoz Hermosilla, José M. “A 3D Glacier Dynamics-Line Plume Model to Estimate the Frontal Ablation of Hansbreen.” Zenodo, 2023. https://doi.org/10.5281/ZENODO.8005257. ieee: J. M. Muñoz Hermosilla, “A 3D glacier dynamics-line plume model to estimate the frontal ablation of Hansbreen.” Zenodo, 2023. ista: Muñoz Hermosilla JM. 2023. A 3D glacier dynamics-line plume model to estimate the frontal ablation of Hansbreen, Zenodo, 10.5281/ZENODO.8005257. mla: Muñoz Hermosilla, José M. A 3D Glacier Dynamics-Line Plume Model to Estimate the Frontal Ablation of Hansbreen. Zenodo, 2023, doi:10.5281/ZENODO.8005257. short: J.M. Muñoz Hermosilla, (2023). corr_author: '1' date_created: 2024-12-09T09:33:07Z date_published: 2023-06-05T00:00:00Z date_updated: 2024-12-09T09:43:47Z day: '05' ddc: - '550' department: - _id: FrPe doi: 10.5281/ZENODO.8005257 main_file_link: - open_access: '1' url: https://doi.org/10.5281/zenodo.8005258 month: '06' oa: 1 oa_version: Published Version publisher: Zenodo related_material: record: - id: '18628' relation: research_data status: public status: public title: A 3D glacier dynamics-line plume model to estimate the frontal ablation of Hansbreen type: research_data_reference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2023' ... --- _id: '12287' abstract: - lang: eng text: We present criteria for establishing a triangulation of a manifold. Given a manifold M, a simplicial complex A, and a map H from the underlying space of A to M, our criteria are presented in local coordinate charts for M, and ensure that H is a homeomorphism. These criteria do not require a differentiable structure, or even an explicit metric on M. No Delaunay property of A is assumed. The result provides a triangulation guarantee for algorithms that construct a simplicial complex by working in local coordinate patches. Because the criteria are easily verified in such a setting, they are expected to be of general use. acknowledgement: "This work has been 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). Arijit Ghosh is supported by Ramanujan Fellowship (No. SB/S2/RJN-064/2015). Part of this work was done when Arijit Ghosh was a Researcher at Max-Planck-Institute for Informatics, Germany, supported by the IndoGerman Max Planck Center for Computer Science (IMPECS). 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 and the Austrian Science Fund (FWF): M-3073. A part of the results described in this paper were presented at SoCG 2018 and in [3]. \r\nOpen access funding provided by the Austrian Science Fund (FWF)." article_processing_charge: No article_type: original author: - first_name: Jean-Daniel full_name: Boissonnat, Jean-Daniel last_name: Boissonnat - first_name: Ramsay full_name: Dyer, Ramsay last_name: Dyer - first_name: Arijit full_name: Ghosh, Arijit last_name: Ghosh - 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, Dyer R, Ghosh A, Wintraecken M. Local criteria for triangulating general manifolds. Discrete & Computational Geometry. 2023;69:156-191. doi:10.1007/s00454-022-00431-7 apa: Boissonnat, J.-D., Dyer, R., Ghosh, A., & Wintraecken, M. (2023). Local criteria for triangulating general manifolds. Discrete & Computational Geometry. Springer Nature. https://doi.org/10.1007/s00454-022-00431-7 chicago: Boissonnat, Jean-Daniel, Ramsay Dyer, Arijit Ghosh, and Mathijs Wintraecken. “Local Criteria for Triangulating General Manifolds.” Discrete & Computational Geometry. Springer Nature, 2023. https://doi.org/10.1007/s00454-022-00431-7. ieee: J.-D. Boissonnat, R. Dyer, A. Ghosh, and M. Wintraecken, “Local criteria for triangulating general manifolds,” Discrete & Computational Geometry, vol. 69. Springer Nature, pp. 156–191, 2023. ista: Boissonnat J-D, Dyer R, Ghosh A, Wintraecken M. 2023. Local criteria for triangulating general manifolds. Discrete & Computational Geometry. 69, 156–191. mla: Boissonnat, Jean-Daniel, et al. “Local Criteria for Triangulating General Manifolds.” Discrete & Computational Geometry, vol. 69, Springer Nature, 2023, pp. 156–91, doi:10.1007/s00454-022-00431-7. short: J.-D. Boissonnat, R. Dyer, A. Ghosh, M. Wintraecken, Discrete & Computational Geometry 69 (2023) 156–191. corr_author: '1' date_created: 2023-01-16T10:04:06Z date_published: 2023-01-01T00:00:00Z date_updated: 2025-04-14T07:44:00Z day: '01' ddc: - '510' department: - _id: HeEd doi: 10.1007/s00454-022-00431-7 ec_funded: 1 external_id: isi: - '000862193600001' file: - access_level: open_access checksum: 46352e0ee71e460848f88685ca852681 content_type: application/pdf creator: dernst date_created: 2023-02-02T11:01:10Z date_updated: 2023-02-02T11:01:10Z file_id: '12488' file_name: 2023_DiscreteCompGeometry_Boissonnat.pdf file_size: 582850 relation: main_file success: 1 file_date_updated: 2023-02-02T11:01:10Z has_accepted_license: '1' intvolume: ' 69' isi: 1 keyword: - Computational Theory and Mathematics - Discrete Mathematics and Combinatorics - Geometry and Topology - Theoretical Computer Science language: - iso: eng month: '01' oa: 1 oa_version: Published Version page: 156-191 project: - _id: 260C2330-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '754411' name: ISTplus - Postdoctoral Fellowships - _id: fc390959-9c52-11eb-aca3-afa58bd282b2 grant_number: M03073 name: Learning and triangulating manifolds via collapses publication: Discrete & Computational Geometry publication_identifier: eissn: - 1432-0444 issn: - 0179-5376 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: Local criteria for triangulating general manifolds 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: 69 year: '2023' ... --- _id: '12313' abstract: - lang: eng text: Let P be a nontorsion point on an elliptic curve defined over a number field K and consider the sequence {Bn}n∈N of the denominators of x(nP). We prove that every term of the sequence of the Bn has a primitive divisor for n greater than an effectively computable constant that we will explicitly compute. This constant will depend only on the model defining the curve. acknowledgement: "This paper is part of the author’s PhD thesis at Università of Pisa. Moreover, this\r\nproject has received funding from the European Union’s Horizon 2020 research\r\nand innovation programme under the Marie Skłodowska-Curie Grant Agreement\r\nNo. 101034413. I thank the referee for many helpful comments." article_processing_charge: Yes (in subscription journal) article_type: original arxiv: 1 author: - first_name: Matteo full_name: Verzobio, Matteo id: 7aa8f170-131e-11ed-88e1-a9efd01027cb last_name: Verzobio orcid: 0000-0002-0854-0306 citation: ama: Verzobio M. Some effectivity results for primitive divisors of elliptic divisibility  sequences. Pacific Journal of Mathematics. 2023;325(2):331-351. doi:10.2140/pjm.2023.325.331 apa: Verzobio, M. (2023). Some effectivity results for primitive divisors of elliptic divisibility  sequences. Pacific Journal of Mathematics. Mathematical Sciences Publishers. https://doi.org/10.2140/pjm.2023.325.331 chicago: Verzobio, Matteo. “Some Effectivity Results for Primitive Divisors of Elliptic Divisibility  Sequences.” Pacific Journal of Mathematics. Mathematical Sciences Publishers, 2023. https://doi.org/10.2140/pjm.2023.325.331. ieee: M. Verzobio, “Some effectivity results for primitive divisors of elliptic divisibility  sequences,” Pacific Journal of Mathematics, vol. 325, no. 2. Mathematical Sciences Publishers, pp. 331–351, 2023. ista: Verzobio M. 2023. Some effectivity results for primitive divisors of elliptic divisibility  sequences. Pacific Journal of Mathematics. 325(2), 331–351. mla: Verzobio, Matteo. “Some Effectivity Results for Primitive Divisors of Elliptic Divisibility  Sequences.” Pacific Journal of Mathematics, vol. 325, no. 2, Mathematical Sciences Publishers, 2023, pp. 331–51, doi:10.2140/pjm.2023.325.331. short: M. Verzobio, Pacific Journal of Mathematics 325 (2023) 331–351. corr_author: '1' date_created: 2023-01-16T11:46:19Z date_published: 2023-11-03T00:00:00Z date_updated: 2025-04-14T07:54:54Z day: '03' ddc: - '510' department: - _id: TiBr doi: 10.2140/pjm.2023.325.331 ec_funded: 1 external_id: arxiv: - '2001.02987' isi: - '001104766900001' file: - access_level: open_access checksum: b6218d16a72742d8bb38d6fc3c9bb8c6 content_type: application/pdf creator: dernst date_created: 2023-11-13T09:50:41Z date_updated: 2023-11-13T09:50:41Z file_id: '14525' file_name: 2023_PacificJourMaths_Verzobio.pdf file_size: 389897 relation: main_file success: 1 file_date_updated: 2023-11-13T09:50:41Z has_accepted_license: '1' intvolume: ' 325' isi: 1 issue: '2' language: - iso: eng month: '11' oa: 1 oa_version: Published Version page: 331-351 project: - _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c call_identifier: H2020 grant_number: '101034413' name: 'IST-BRIDGE: International postdoctoral program' publication: Pacific Journal of Mathematics publication_identifier: eissn: - 0030-8730 publication_status: published publisher: Mathematical Sciences Publishers quality_controlled: '1' scopus_import: '1' status: public title: Some effectivity results for primitive divisors of elliptic divisibility sequences 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: 325 year: '2023' ... --- _id: '12329' abstract: - lang: eng text: In this article, we develop two independent and new approaches to model epidemic spread in a network. Contrary to the most studied models, those developed here allow for contacts with different probabilities of transmitting the disease (transmissibilities). We then examine each of these models using some mean field type approximations. The first model looks at the late-stage effects of an epidemic outbreak and allows for the computation of the probability that a given vertex was infected. This computation is based on a mean field approximation and only depends on the number of contacts and their transmissibilities. This approach shares many similarities with percolation models in networks. The second model we develop is a dynamic model which we analyze using a mean field approximation which highly reduces the dimensionality of the system. In particular, the original system which individually analyses each vertex of the network is reduced to one with as many equations as different transmissibilities. Perhaps the greatest contribution of this article is the observation that, in both these models, the existence and size of an epidemic outbreak are linked to the properties of a matrix which we call the R-matrix. This is a generalization of the basic reproduction number which more precisely characterizes the main routes of infection. acknowledgement: Gonçalo Oliveira is supported by the NOMIS Foundation, Fundação Serrapilheira 1812-27395, by CNPq grants 428959/2018-0 and 307475/2018-2, and by FAPERJ through the grant Jovem Cientista do Nosso Estado E-26/202.793/2019. article_number: '468' article_processing_charge: No article_type: original author: - first_name: Arturo full_name: Gómez, Arturo last_name: Gómez - first_name: Goncalo full_name: Oliveira, Goncalo id: 58abbde8-f455-11eb-a497-98c8fd71b905 last_name: Oliveira citation: ama: Gómez A, Oliveira G. New approaches to epidemic modeling on networks. Scientific Reports. 2023;13. doi:10.1038/s41598-022-19827-9 apa: Gómez, A., & Oliveira, G. (2023). New approaches to epidemic modeling on networks. Scientific Reports. Springer Nature. https://doi.org/10.1038/s41598-022-19827-9 chicago: Gómez, Arturo, and Goncalo Oliveira. “New Approaches to Epidemic Modeling on Networks.” Scientific Reports. Springer Nature, 2023. https://doi.org/10.1038/s41598-022-19827-9. ieee: A. Gómez and G. Oliveira, “New approaches to epidemic modeling on networks,” Scientific Reports, vol. 13. Springer Nature, 2023. ista: Gómez A, Oliveira G. 2023. New approaches to epidemic modeling on networks. Scientific Reports. 13, 468. mla: Gómez, Arturo, and Goncalo Oliveira. “New Approaches to Epidemic Modeling on Networks.” Scientific Reports, vol. 13, 468, Springer Nature, 2023, doi:10.1038/s41598-022-19827-9. short: A. Gómez, G. Oliveira, Scientific Reports 13 (2023). corr_author: '1' date_created: 2023-01-22T23:00:55Z date_published: 2023-01-10T00:00:00Z date_updated: 2024-10-09T21:03:29Z day: '10' ddc: - '510' department: - _id: TaHa doi: 10.1038/s41598-022-19827-9 external_id: isi: - '001003345000051' file: - access_level: open_access checksum: a8b83739f4a951e83e0b2a778f03b327 content_type: application/pdf creator: dernst date_created: 2023-01-23T07:53:23Z date_updated: 2023-01-23T07:53:23Z file_id: '12336' file_name: 2023_ScientificReports_Gomez.pdf file_size: 2167792 relation: main_file success: 1 file_date_updated: 2023-01-23T07:53:23Z has_accepted_license: '1' intvolume: ' 13' isi: 1 language: - iso: eng month: '01' oa: 1 oa_version: Published Version publication: Scientific Reports publication_identifier: eissn: - 2045-2322 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: New approaches to epidemic modeling on networks 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: 13 year: '2023' ... --- _id: '12330' abstract: - lang: eng text: 'The design and implementation of efficient concurrent data structures has seen significant attention. However, most of this work has focused on concurrent data structures providing good worst-case guarantees, although, in real workloads, objects are often accessed at different rates. Efficient distribution-adaptive data structures, such as splay-trees, are known in the sequential case; however, they often are hard to translate efficiently to the concurrent case. We investigate distribution-adaptive concurrent data structures, and propose a new design called the splay-list. At a high level, the splay-list is similar to a standard skip-list, with the key distinction that the height of each element adapts dynamically to its access rate: popular elements “move up,” whereas rarely-accessed elements decrease in height. We show that the splay-list provides order-optimal amortized complexity bounds for a subset of operations, while being amenable to efficient concurrent implementation. Experiments show that the splay-list can leverage distribution-adaptivity for performance, and can outperform the only previously-known distribution-adaptive concurrent design in certain workloads.' article_processing_charge: No article_type: original arxiv: 1 author: - first_name: Vitalii full_name: Aksenov, Vitalii id: 2980135A-F248-11E8-B48F-1D18A9856A87 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. Distributed Computing. 2023;36:395-418. doi:10.1007/s00446-022-00441-x' apa: 'Aksenov, V., Alistarh, D.-A., Drozdova, A., & Mohtashami, A. (2023). The splay-list: A distribution-adaptive concurrent skip-list. Distributed Computing. Springer Nature. https://doi.org/10.1007/s00446-022-00441-x' chicago: 'Aksenov, Vitalii, Dan-Adrian Alistarh, Alexandra Drozdova, and Amirkeivan Mohtashami. “The Splay-List: A Distribution-Adaptive Concurrent Skip-List.” Distributed Computing. Springer Nature, 2023. https://doi.org/10.1007/s00446-022-00441-x.' ieee: 'V. Aksenov, D.-A. Alistarh, A. Drozdova, and A. Mohtashami, “The splay-list: A distribution-adaptive concurrent skip-list,” Distributed Computing, vol. 36. Springer Nature, pp. 395–418, 2023.' ista: 'Aksenov V, Alistarh D-A, Drozdova A, Mohtashami A. 2023. The splay-list: A distribution-adaptive concurrent skip-list. Distributed Computing. 36, 395–418.' mla: 'Aksenov, Vitalii, et al. “The Splay-List: A Distribution-Adaptive Concurrent Skip-List.” Distributed Computing, vol. 36, Springer Nature, 2023, pp. 395–418, doi:10.1007/s00446-022-00441-x.' short: V. Aksenov, D.-A. Alistarh, A. Drozdova, A. Mohtashami, Distributed Computing 36 (2023) 395–418. date_created: 2023-01-22T23:00:55Z date_published: 2023-09-01T00:00:00Z date_updated: 2023-08-14T12:54:32Z day: '01' department: - _id: DaAl doi: 10.1007/s00446-022-00441-x external_id: arxiv: - '2008.01009' isi: - '000913424000001' intvolume: ' 36' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2008.01009 month: '09' oa: 1 oa_version: Preprint page: 395-418 publication: Distributed Computing publication_identifier: eissn: - 1432-0452 issn: - 0178-2770 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: 'The splay-list: A distribution-adaptive concurrent skip-list' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 36 year: '2023' ... --- _id: '12331' abstract: - lang: eng text: High carrier mobility is critical to improving thermoelectric performance over a broad temperature range. However, traditional doping inevitably deteriorates carrier mobility. Herein, we develop a strategy for fine tuning of defects to improve carrier mobility. To begin, n-type PbTe is created by compensating for the intrinsic Pb vacancy in bare PbTe. Excess Pb2+ reduces vacancy scattering, resulting in a high carrier mobility of ∼3400 cm2 V–1 s–1. Then, excess Ag is introduced to compensate for the remaining intrinsic Pb vacancies. We find that excess Ag exhibits a dynamic doping process with increasing temperatures, increasing both the carrier concentration and carrier mobility throughout a wide temperature range; specifically, an ultrahigh carrier mobility ∼7300 cm2 V–1 s–1 is obtained for Pb1.01Te + 0.002Ag at 300 K. Moreover, the dynamic doping-induced high carrier concentration suppresses the bipolar thermal conductivity at high temperatures. The final step is using iodine to optimize the carrier concentration to ∼1019 cm–3. Ultimately, a maximum ZT value of ∼1.5 and a large average ZTave value of ∼1.0 at 300–773 K are obtained for Pb1.01Te0.998I0.002 + 0.002Ag. These findings demonstrate that fine tuning of defects with <0.5% impurities can remarkably enhance carrier mobility and improve thermoelectric performance. acknowledgement: The National Key Research and Development Program of China (2018YFA0702100), the Basic Science Center Project of the National Natural Science Foundation of China (51788104), the National Natural Science Foundation of China (51571007 and 51772012), the Beijing Natural Science Foundation (JQ18004), the 111 Project (B17002), the National Science Fund for Distinguished Young Scholars (51925101), and the FWF “Lise Meitner Fellowship” (grant agreement M2889-N). Open Access is funded by the Austrian Science Fund (FWF). article_processing_charge: No article_type: original author: - first_name: Siqi full_name: Wang, Siqi last_name: Wang - first_name: Cheng full_name: Chang, Cheng id: 9E331C2E-9F27-11E9-AE48-5033E6697425 last_name: Chang orcid: 0000-0002-9515-4277 - first_name: Shulin full_name: Bai, Shulin last_name: Bai - first_name: Bingchao full_name: Qin, Bingchao last_name: Qin - first_name: Yingcai full_name: Zhu, Yingcai last_name: Zhu - first_name: Shaoping full_name: Zhan, Shaoping last_name: Zhan - first_name: Junqing full_name: Zheng, Junqing last_name: Zheng - first_name: Shuwei full_name: Tang, Shuwei last_name: Tang - first_name: Li Dong full_name: Zhao, Li Dong last_name: Zhao citation: ama: Wang S, Chang C, Bai S, et al. Fine tuning of defects enables high carrier mobility and enhanced thermoelectric performance of n-type PbTe. Chemistry of Materials. 2023;35(2):755-763. doi:10.1021/acs.chemmater.2c03542 apa: Wang, S., Chang, C., Bai, S., Qin, B., Zhu, Y., Zhan, S., … Zhao, L. D. (2023). Fine tuning of defects enables high carrier mobility and enhanced thermoelectric performance of n-type PbTe. Chemistry of Materials. American Chemical Society. https://doi.org/10.1021/acs.chemmater.2c03542 chicago: Wang, Siqi, Cheng Chang, Shulin Bai, Bingchao Qin, Yingcai Zhu, Shaoping Zhan, Junqing Zheng, Shuwei Tang, and Li Dong Zhao. “Fine Tuning of Defects Enables High Carrier Mobility and Enhanced Thermoelectric Performance of N-Type PbTe.” Chemistry of Materials. American Chemical Society, 2023. https://doi.org/10.1021/acs.chemmater.2c03542. ieee: S. Wang et al., “Fine tuning of defects enables high carrier mobility and enhanced thermoelectric performance of n-type PbTe,” Chemistry of Materials, vol. 35, no. 2. American Chemical Society, pp. 755–763, 2023. ista: Wang S, Chang C, Bai S, Qin B, Zhu Y, Zhan S, Zheng J, Tang S, Zhao LD. 2023. Fine tuning of defects enables high carrier mobility and enhanced thermoelectric performance of n-type PbTe. Chemistry of Materials. 35(2), 755–763. mla: Wang, Siqi, et al. “Fine Tuning of Defects Enables High Carrier Mobility and Enhanced Thermoelectric Performance of N-Type PbTe.” Chemistry of Materials, vol. 35, no. 2, American Chemical Society, 2023, pp. 755–63, doi:10.1021/acs.chemmater.2c03542. short: S. Wang, C. Chang, S. Bai, B. Qin, Y. Zhu, S. Zhan, J. Zheng, S. Tang, L.D. Zhao, Chemistry of Materials 35 (2023) 755–763. corr_author: '1' date_created: 2023-01-22T23:00:55Z date_published: 2023-01-24T00:00:00Z date_updated: 2025-04-23T08:47:37Z day: '24' ddc: - '540' department: - _id: MaIb doi: 10.1021/acs.chemmater.2c03542 external_id: isi: - '000914749700001' pmid: - '36711054' file: - access_level: open_access checksum: b21dca2aa7a80c068bc256bdd1fea9df content_type: application/pdf creator: dernst date_created: 2023-08-14T12:57:25Z date_updated: 2023-08-14T12:57:25Z file_id: '14055' file_name: 2023_ChemistryMaterials_Wang.pdf file_size: 2961043 relation: main_file success: 1 file_date_updated: 2023-08-14T12:57:25Z has_accepted_license: '1' intvolume: ' 35' isi: 1 issue: '2' language: - iso: eng month: '01' oa: 1 oa_version: Published Version page: 755-763 pmid: 1 project: - _id: 9B8804FC-BA93-11EA-9121-9846C619BF3A grant_number: M02889 name: Bottom-up Engineering for Thermoelectric Applications publication: Chemistry of Materials publication_identifier: eissn: - 1520-5002 issn: - 0897-4756 publication_status: published publisher: American Chemical Society quality_controlled: '1' scopus_import: '1' status: public title: Fine tuning of defects enables high carrier mobility and enhanced thermoelectric performance of n-type PbTe 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: 35 year: '2023' ...