[{"date_updated":"2024-10-09T10:49:42Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","oa_version":"Preprint","publication_status":"published","fulldoi":"https://doi.org/10.1021/acs.joc.2c02381","external_id":{"pmid":["36696660"]},"issue":"14","abstract":[{"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.","lang":"eng"}],"status":"public","year":"2023","doi":"10.1021/acs.joc.2c02381","publication_identifier":{"eissn":["1520-6904"],"issn":["0022-3263"]},"month":"01","citation":{"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.","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.","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.","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","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."},"day":"25","type":"journal_article","main_file_link":[{"open_access":"1","url":"10.26434/chemrxiv-2022-krng1"}],"language":[{"iso":"eng"}],"date_published":"2023-01-25T00:00:00Z","pmid":1,"quality_controlled":"1","volume":88,"title":"Interpretable deep-learning unveils structure–property relationships in polybenzenoid hydrocarbons","author":[{"full_name":"Weiss, Tomer","last_name":"Weiss","first_name":"Tomer"},{"full_name":"Wahab, Alexandra","last_name":"Wahab","first_name":"Alexandra"},{"full_name":"Bronstein, Alexander","orcid":"0000-0001-9699-8730","first_name":"Alexander","last_name":"Bronstein","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6"},{"last_name":"Gershoni-Poranne","first_name":"Renana","full_name":"Gershoni-Poranne, Renana"}],"date_created":"2024-10-08T12:47:17Z","oa":1,"article_type":"original","page":"9645-9656","_id":"18209","publication":"The Journal of Organic Chemistry","extern":"1","scopus_import":"1","intvolume":" 88","publisher":"American Chemical Society"},{"title":"GRACE: A scalable graph-based approach to accelerating recommendation model inference","author":[{"last_name":"Ye","first_name":"Haojie","full_name":"Ye, Haojie"},{"full_name":"Vedula, Sanketh","first_name":"Sanketh","last_name":"Vedula"},{"full_name":"Chen, Yuhan","first_name":"Yuhan","last_name":"Chen"},{"last_name":"Yang","first_name":"Yichen","full_name":"Yang, Yichen"},{"orcid":"0000-0001-9699-8730","full_name":"Bronstein, Alexander","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","first_name":"Alexander","last_name":"Bronstein"},{"full_name":"Dreslinski, Ronald","last_name":"Dreslinski","first_name":"Ronald"},{"first_name":"Trevor","last_name":"Mudge","full_name":"Mudge, Trevor"},{"full_name":"Talati, Nishil","first_name":"Nishil","last_name":"Talati"}],"quality_controlled":"1","volume":11,"date_published":"2023-03-01T00:00:00Z","related_material":{"link":[{"relation":"software","url":"https://doi.org/10.5281/zenodo.7699872"}]},"language":[{"iso":"eng"}],"publisher":"Association for Computing Machinery","extern":"1","publication":"Proceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems","intvolume":" 11","scopus_import":"1","page":"282-301","_id":"18212","date_created":"2024-10-08T12:48:11Z","fulldoi":"https://doi.org/10.1145/3582016.3582029","publication_status":"published","article_processing_charge":"No","oa_version":"None","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2024-10-09T11:21:19Z","type":"conference","day":"01","citation":{"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.","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","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.","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.","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.","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."},"month":"03","publication_identifier":{"isbn":["9781450399180"]},"doi":"10.1145/3582016.3582029","status":"public","year":"2023","issue":"3","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."}]},{"status":"public","year":"2023","publication_identifier":{"eissn":["1556-472X"],"issn":["1556-4681"]},"doi":"10.1145/3561058","issue":"4","abstract":[{"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.","lang":"eng"}],"type":"journal_article","day":"24","month":"02","citation":{"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.","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","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","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.","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.","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)."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"None","article_processing_charge":"No","date_updated":"2024-10-09T11:24:50Z","article_number":"50","fulldoi":"https://doi.org/10.1145/3561058","publication_status":"published","_id":"18213","publication":"ACM Transactions on Knowledge Discovery from Data","extern":"1","intvolume":" 17","scopus_import":"1","date_created":"2024-10-08T12:48:38Z","article_type":"original","publisher":"Association for Computing Machinery","date_published":"2023-02-24T00:00:00Z","language":[{"iso":"eng"}],"title":"GRASP: Scalable graph alignment by spectral corresponding functions","author":[{"full_name":"Hermanns, Judith","first_name":"Judith","last_name":"Hermanns"},{"first_name":"Konstantinos","last_name":"Skitsas","full_name":"Skitsas, Konstantinos"},{"first_name":"Anton","last_name":"Tsitsulin","full_name":"Tsitsulin, Anton"},{"full_name":"Munkhoeva, Marina","first_name":"Marina","last_name":"Munkhoeva"},{"last_name":"Kyster","first_name":"Alexander","full_name":"Kyster, Alexander"},{"full_name":"Nielsen, Simon","first_name":"Simon","last_name":"Nielsen"},{"full_name":"Bronstein, Alexander","orcid":"0000-0001-9699-8730","last_name":"Bronstein","first_name":"Alexander","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6"},{"first_name":"Davide","last_name":"Mottin","full_name":"Mottin, Davide"},{"full_name":"Karras, Panagiotis","first_name":"Panagiotis","last_name":"Karras"}],"quality_controlled":"1","volume":17},{"intvolume":" 17","scopus_import":"1","publication":"Proceedings of the VLDB Endowment","extern":"1","_id":"18214","page":"427-440","article_type":"original","date_created":"2024-10-08T12:48:57Z","oa":1,"publisher":"Association for Computing Machinery","date_published":"2023-11-01T00:00:00Z","arxiv":1,"language":[{"iso":"eng"}],"title":"Demystifying graph sparsification algorithms in graph properties preservation","author":[{"first_name":"Yuhan","last_name":"Chen","full_name":"Chen, Yuhan"},{"first_name":"Haojie","last_name":"Ye","full_name":"Ye, Haojie"},{"full_name":"Vedula, Sanketh","last_name":"Vedula","first_name":"Sanketh"},{"full_name":"Bronstein, Alexander","orcid":"0000-0001-9699-8730","first_name":"Alexander","last_name":"Bronstein","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6"},{"last_name":"Dreslinski","first_name":"Ronald","full_name":"Dreslinski, Ronald"},{"full_name":"Mudge, Trevor","last_name":"Mudge","first_name":"Trevor"},{"first_name":"Nishil","last_name":"Talati","full_name":"Talati, Nishil"}],"volume":17,"quality_controlled":"1","publication_identifier":{"issn":["2150-8097"]},"doi":"10.14778/3632093.3632106","year":"2023","status":"public","abstract":[{"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.","lang":"eng"}],"issue":"3","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2311.12314"}],"day":"01","type":"journal_article","citation":{"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.","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","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.","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","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.","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.","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."},"month":"11","oa_version":"Preprint","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2024-10-09T11:28:33Z","external_id":{"arxiv":["2311.12314"]},"fulldoi":"https://doi.org/10.14778/3632093.3632106","publication_status":"published"},{"date_published":"2023-11-01T00:00:00Z","language":[{"iso":"eng"}],"arxiv":1,"title":"Using deep reinforcement learning for mmWave real-time scheduling","author":[{"full_name":"Gahtan, Barak","first_name":"Barak","last_name":"Gahtan"},{"last_name":"Cohen","first_name":"Reuven","full_name":"Cohen, Reuven"},{"orcid":"0000-0001-9699-8730","full_name":"Bronstein, Alexander","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","last_name":"Bronstein","first_name":"Alexander"},{"full_name":"Kedar, Gil","last_name":"Kedar","first_name":"Gil"}],"quality_controlled":"1","page":"71-79","_id":"18215","extern":"1","publication":"14th International Conference on Network of the Future","scopus_import":"1","date_created":"2024-10-08T12:50:18Z","oa":1,"publisher":"IEEE","conference":{"name":"NoF: Conference on Network of the Future","location":"Izmir, Turkiye","start_date":"2023-10-04","end_date":"2023-10-06"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","oa_version":"Preprint","date_updated":"2024-10-09T11:40:45Z","fulldoi":"https://doi.org/10.1109/nof58724.2023.10302794","external_id":{"arxiv":["2210.01423"]},"publication_status":"published","status":"public","year":"2023","doi":"10.1109/nof58724.2023.10302794","publication_identifier":{"isbn":["9798350338089"],"eissn":["2833-0072"]},"abstract":[{"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.","lang":"eng"}],"day":"01","type":"conference","main_file_link":[{"open_access":"1","url":" https://doi.org/10.48550/arXiv.2210.01423"}],"month":"11","citation":{"short":"B. Gahtan, R. Cohen, A.M. Bronstein, G. Kedar, in:, 14th International Conference on Network of the Future, IEEE, 2023, pp. 71–79.","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.","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.","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","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.","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.","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"}},{"volume":120,"pmid":1,"quality_controlled":"1","author":[{"last_name":"Rosenberg","first_name":"Aviv A.","full_name":"Rosenberg, Aviv A."},{"last_name":"Yehishalom","first_name":"Nitsan","full_name":"Yehishalom, Nitsan"},{"full_name":"Marx, Ailie","first_name":"Ailie","last_name":"Marx"},{"last_name":"Bronstein","first_name":"Alexander","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","full_name":"Bronstein, Alexander","orcid":"0000-0001-9699-8730"}],"title":"An amino-domino model described by a cross-peptide-bond Ramachandran plot defines amino acid pairs as local structural units","language":[{"iso":"eng"}],"date_published":"2023-10-25T00:00:00Z","publisher":"National Academy of Sciences","oa":1,"date_created":"2024-10-08T12:50:36Z","article_type":"original","_id":"18216","scopus_import":"1","intvolume":" 120","extern":"1","publication":"Proceedings of the National Academy of Sciences","publication_status":"published","fulldoi":"https://doi.org/10.1073/pnas.2301064120","external_id":{"pmid":["37878722"]},"article_number":"e2301064120","date_updated":"2024-10-09T11:55:12Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"Yes (in subscription journal)","oa_version":"Published Version","month":"10","citation":{"short":"A.A. Rosenberg, N. Yehishalom, A. Marx, A.M. Bronstein, Proceedings of the National Academy of Sciences 120 (2023).","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.","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.","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","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","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.","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."},"day":"25","type":"journal_article","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1073/pnas.2301064120"}],"abstract":[{"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.","lang":"eng"}],"issue":"44","year":"2023","status":"public","doi":"10.1073/pnas.2301064120","publication_identifier":{"issn":["0027-8424"],"eissn":["1091-6490"]}},{"publication_identifier":{"eisbn":["9798350323658"]},"doi":"10.1109/icra48891.2023.10160601","status":"public","year":"2023","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."}],"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2202.05204","open_access":"1"}],"day":"04","type":"conference","citation":{"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.","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.","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","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.","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"},"month":"07","article_processing_charge":"No","oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2024-10-09T12:00:32Z","external_id":{"arxiv":["2202.05204"]},"fulldoi":"https://doi.org/10.1109/icra48891.2023.10160601","publication_status":"published","publication":"2023 IEEE International Conference on Robotics and Automation","extern":"1","intvolume":" 27","scopus_import":"1","_id":"18217","oa":1,"date_created":"2024-10-08T12:50:55Z","publisher":"IEEE","conference":{"start_date":"2023-05-29","location":"London, United Kingdom","name":"ICRA: Conference on Robotics and Automation","end_date":"2023-06-02"},"date_published":"2023-07-04T00:00:00Z","language":[{"iso":"eng"}],"arxiv":1,"author":[{"last_name":"Zadok","first_name":"Dean","full_name":"Zadok, Dean"},{"last_name":"Salzman","first_name":"Oren","full_name":"Salzman, Oren"},{"first_name":"Alon","last_name":"Wolf","full_name":"Wolf, Alon"},{"last_name":"Bronstein","first_name":"Alexander","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","full_name":"Bronstein, Alexander","orcid":"0000-0001-9699-8730"}],"title":"Towards predicting fine finger motions from ultrasound images via kinematic representation","quality_controlled":"1","volume":27},{"status":"public","year":"2023","doi":"10.1007/978-3-031-26293-7_31","publication_identifier":{"isbn":["9783031262920"],"issn":["0302-9743"],"eisbn":["9783031262937"],"eissn":["1611-3349"]},"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."}],"type":"conference","day":"11","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2207.05729"}],"month":"03","citation":{"short":"Y. Nemcovsky, M. Jacoby, A.M. Bronstein, C. Baskin, in:, 16th Asian Conference on Computer Vision, Springer Nature, 2023, pp. 518–534.","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.","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.","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","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.","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","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."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","article_processing_charge":"No","date_updated":"2024-10-09T12:13:36Z","fulldoi":"https://doi.org/10.1007/978-3-031-26293-7_31","external_id":{"arxiv":["2207.05729"]},"publication_status":"published","page":"518-534","_id":"18218","publication":"16th Asian Conference on Computer Vision","extern":"1","scopus_import":"1","intvolume":" 13847","date_created":"2024-10-08T12:51:14Z","oa":1,"publisher":"Springer Nature","conference":{"end_date":"2022-12-08","name":"ACCV: Asian Conference on Computer Vision","location":"Macao, China","start_date":"2022-12-04"},"alternative_title":["LNCS"],"related_material":{"link":[{"url":"https://github.com/patchadversarialattacks/patchadversarialattacks","relation":"software"}]},"date_published":"2023-03-11T00:00:00Z","language":[{"iso":"eng"}],"arxiv":1,"title":"Physical passive patch adversarial attacks on visual odometry systems","author":[{"full_name":"Nemcovsky, Yaniv","last_name":"Nemcovsky","first_name":"Yaniv"},{"full_name":"Jacoby, Matan","last_name":"Jacoby","first_name":"Matan"},{"id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","last_name":"Bronstein","first_name":"Alexander","orcid":"0000-0001-9699-8730","full_name":"Bronstein, Alexander"},{"first_name":"Chaim","last_name":"Baskin","full_name":"Baskin, Chaim"}],"quality_controlled":"1","volume":13847},{"month":"01","citation":{"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.","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.","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.","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","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","ista":"Schwartz E, Bronstein AM, Giryes R. 2023. ISP Distillation. IEEE Open Journal of Signal Processing. 4, 12–20."},"type":"journal_article","day":"25","main_file_link":[{"url":"https://doi.org/10.1109/OJSP.2023.3239819","open_access":"1"}],"abstract":[{"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.","lang":"eng"}],"status":"public","year":"2023","doi":"10.1109/ojsp.2023.3239819","publication_identifier":{"issn":["2644-1322"]},"publication_status":"published","fulldoi":"https://doi.org/10.1109/ojsp.2023.3239819","external_id":{"arxiv":["2101.10203"]},"date_updated":"2024-10-09T12:24:13Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","oa_version":"Published Version","publisher":"Institute of Electrical and Electronics Engineers","date_created":"2024-10-08T12:51:32Z","oa":1,"article_type":"original","page":"12-20","_id":"18219","extern":"1","publication":"IEEE Open Journal of Signal Processing","scopus_import":"1","intvolume":" 4","quality_controlled":"1","volume":4,"title":"ISP Distillation","author":[{"first_name":"Eli","last_name":"Schwartz","full_name":"Schwartz, Eli"},{"orcid":"0000-0001-9699-8730","full_name":"Bronstein, Alexander","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","first_name":"Alexander","last_name":"Bronstein"},{"last_name":"Giryes","first_name":"Raja","full_name":"Giryes, Raja"}],"language":[{"iso":"eng"}],"arxiv":1,"date_published":"2023-01-25T00:00:00Z"},{"oa":1,"date_created":"2026-06-19T07:49:24Z","article_type":"original","das_tickbox":"1","page":"3751-3775","_id":"22046","publication":"Nonlinearity","extern":"1","intvolume":" 36","scopus_import":"1","publisher":"IOP Publishing","language":[{"iso":"eng"}],"arxiv":1,"date_published":"2023-06-09T00:00:00Z","quality_controlled":"1","mathsc":["35Q55","37K05","37K10"],"OA_type":"green","volume":36,"OA_place":"repository","title":"Continuum limit for the Ablowitz–Ladik system","author":[{"first_name":"Rowan","last_name":"Killip","full_name":"Killip, Rowan"},{"first_name":"Zhimeng","last_name":"Ouyang","full_name":"Ouyang, Zhimeng"},{"full_name":"Visan, Monica","last_name":"Visan","first_name":"Monica","id":"056daca0-b8d1-11f0-964f-f91054abf8ca"},{"first_name":"Lei","last_name":"Wu","full_name":"Wu, Lei"}],"issue":"7","abstract":[{"lang":"eng","text":"We show that solutions to the Ablowitz–Ladik system converge to solutions of the cubic nonlinear Schrödinger equation for merely L2 initial data. Furthermore, we consider initial data for this lattice model that excites Fourier modes near both critical points of the discrete dispersion relation and demonstrate convergence to a decoupled system of nonlinear Schrödinger equations."}],"status":"public","year":"2023","doi":"10.1088/1361-6544/acd978","publication_identifier":{"eissn":["1361-6544"],"issn":["0951-7715"]},"month":"06","citation":{"ama":"Killip R, Ouyang Z, Vişan M, Wu L. Continuum limit for the Ablowitz–Ladik system. Nonlinearity. 2023;36(7):3751-3775. doi:10.1088/1361-6544/acd978","apa":"Killip, R., Ouyang, Z., Vişan, M., & Wu, L. (2023). Continuum limit for the Ablowitz–Ladik system. Nonlinearity. IOP Publishing. https://doi.org/10.1088/1361-6544/acd978","ista":"Killip R, Ouyang Z, Vişan M, Wu L. 2023. Continuum limit for the Ablowitz–Ladik system. Nonlinearity. 36(7), 3751–3775.","ieee":"R. Killip, Z. Ouyang, M. Vişan, and L. Wu, “Continuum limit for the Ablowitz–Ladik system,” Nonlinearity, vol. 36, no. 7. IOP Publishing, pp. 3751–3775, 2023.","mla":"Killip, Rowan, et al. “Continuum Limit for the Ablowitz–Ladik System.” Nonlinearity, vol. 36, no. 7, IOP Publishing, 2023, pp. 3751–75, doi:10.1088/1361-6544/acd978.","chicago":"Killip, Rowan, Zhimeng Ouyang, Monica Vişan, and Lei Wu. “Continuum Limit for the Ablowitz–Ladik System.” Nonlinearity. IOP Publishing, 2023. https://doi.org/10.1088/1361-6544/acd978.","short":"R. Killip, Z. Ouyang, M. Vişan, L. Wu, Nonlinearity 36 (2023) 3751–3775."},"type":"journal_article","day":"09","keyword":["Ablowitz–Ladik","continuum limit","cubic NLS"],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2206.02720"}],"date_updated":"2026-06-25T07:54:44Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","article_processing_charge":"No","publication_status":"published","fulldoi":"https://doi.org/10.1088/1361-6544/acd978","external_id":{"arxiv":["2206.02720"]}},{"title":"On the well-posedness problem for the derivativenonlinear Schrödinger equation","author":[{"full_name":"Killip, Rowan","last_name":"Killip","first_name":"Rowan"},{"last_name":"Ntekoume","first_name":"Maria","full_name":"Ntekoume, Maria"},{"id":"056daca0-b8d1-11f0-964f-f91054abf8ca","first_name":"Monica","last_name":"Visan","full_name":"Visan, Monica"}],"OA_place":"publisher","quality_controlled":"1","mathsc":["35Q55"],"OA_type":"diamond","volume":16,"date_published":"2023-08-12T00:00:00Z","language":[{"iso":"eng"}],"arxiv":1,"publisher":"Mathematical Sciences Publishers","publication":"Analysis & PDE","extern":"1","intvolume":" 16","scopus_import":"1","page":"1245-1270","ddc":["500"],"das_tickbox":"1","_id":"22067","has_accepted_license":"1","article_type":"original","date_created":"2026-06-19T08:15:32Z","oa":1,"external_id":{"arxiv":["2101.12274"]},"fulldoi":"https://doi.org/10.2140/apde.2023.16.1245","publication_status":"published","oa_version":"Published Version","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2026-06-30T07:20:56Z","main_file_link":[{"open_access":"1","url":"https://doi.org/10.2140/apde.2023.16.1245"}],"day":"12","type":"journal_article","citation":{"short":"R. Killip, M. Ntekoume, M. Vişan, Analysis & PDE 16 (2023) 1245–1270.","mla":"Killip, Rowan, et al. “On the Well-Posedness Problem for the Derivativenonlinear Schrödinger Equation.” Analysis & PDE, vol. 16, no. 5, Mathematical Sciences Publishers, 2023, pp. 1245–70, doi:10.2140/apde.2023.16.1245.","chicago":"Killip, Rowan, Maria Ntekoume, and Monica Vişan. “On the Well-Posedness Problem for the Derivativenonlinear Schrödinger Equation.” Analysis & PDE. Mathematical Sciences Publishers, 2023. https://doi.org/10.2140/apde.2023.16.1245.","ieee":"R. Killip, M. Ntekoume, and M. Vişan, “On the well-posedness problem for the derivativenonlinear Schrödinger equation,” Analysis & PDE, vol. 16, no. 5. Mathematical Sciences Publishers, pp. 1245–1270, 2023.","ista":"Killip R, Ntekoume M, Vişan M. 2023. On the well-posedness problem for the derivativenonlinear Schrödinger equation. Analysis & PDE. 16(5), 1245–1270.","ama":"Killip R, Ntekoume M, Vişan M. On the well-posedness problem for the derivativenonlinear Schrödinger equation. Analysis & PDE. 2023;16(5):1245-1270. doi:10.2140/apde.2023.16.1245","apa":"Killip, R., Ntekoume, M., & Vişan, M. (2023). On the well-posedness problem for the derivativenonlinear Schrödinger equation. Analysis & PDE. Mathematical Sciences Publishers. https://doi.org/10.2140/apde.2023.16.1245"},"month":"08","publication_identifier":{"eissn":["1948-206X"],"issn":["2157-5045"]},"doi":"10.2140/apde.2023.16.1245","status":"public","year":"2023","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"issue":"5","abstract":[{"lang":"eng","text":"We consider the derivative nonlinear Schrödinger equation in one space dimension, posed both on the line and on the circle. This model is known to be completely integrable and L^2-critical with respect to scaling. We first discuss whether ensembles of orbits with L^2-equicontinuous initial data remain equicontinuous under evolution. We prove that this is true under the restriction \r\nM(q)=∫∣∣q∣∣2<4π. We conjecture that this restriction is unnecessary. Further, we prove that the problem is globally well posed for initial data in H1∕6 under the same restriction on M. Moreover, we show that this restriction would be removed by a successful resolution of our equicontinuity conjecture."}]},{"type":"journal_article","day":"01","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2207.02414"}],"month":"06","citation":{"ieee":"R. Killip, J. Murphy, and M. Vişan, “The scattering map determines the nonlinearity,” Proceedings of the American Mathematical Society, vol. 151, no. 6. American Mathematical Society, pp. 2543–2557, 2023.","apa":"Killip, R., Murphy, J., & Vişan, M. (2023). The scattering map determines the nonlinearity. Proceedings of the American Mathematical Society. American Mathematical Society. https://doi.org/10.1090/proc/16297","ista":"Killip R, Murphy J, Vişan M. 2023. The scattering map determines the nonlinearity. Proceedings of the American Mathematical Society. 151(6), 2543–2557.","ama":"Killip R, Murphy J, Vişan M. The scattering map determines the nonlinearity. Proceedings of the American Mathematical Society. 2023;151(6):2543-2557. doi:10.1090/proc/16297","short":"R. Killip, J. Murphy, M. Vişan, Proceedings of the American Mathematical Society 151 (2023) 2543–2557.","chicago":"Killip, Rowan, Jason Murphy, and Monica Vişan. “The Scattering Map Determines the Nonlinearity.” Proceedings of the American Mathematical Society. American Mathematical Society, 2023. https://doi.org/10.1090/proc/16297.","mla":"Killip, Rowan, et al. “The Scattering Map Determines the Nonlinearity.” Proceedings of the American Mathematical Society, vol. 151, no. 6, American Mathematical Society, 2023, pp. 2543–57, doi:10.1090/proc/16297."},"status":"public","year":"2023","doi":"10.1090/proc/16297","publication_identifier":{"eissn":["1088-6826"],"issn":["0002-9939"]},"issue":"6","abstract":[{"lang":"eng","text":"Using the two-dimensional nonlinear Schrödinger equation as a model example, we present a general method for recovering the nonlinearity of a nonlinear dispersive equation from its small-data scattering behavior. We prove that under very mild assumptions on the nonlinearity, the wave operator uniquely determines the nonlinearity, as does the scattering map. Evaluating the scattering map on well-chosen initial data, we reduce the problem to an inverse convolution problem, which we solve by means of an application of the Beurling–Lax Theorem."}],"fulldoi":"https://doi.org/10.1090/proc/16297","external_id":{"arxiv":["2207.02414"]},"publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","article_processing_charge":"No","date_updated":"2026-06-30T07:08:20Z","publisher":"American Mathematical Society","page":"2543-2557","das_tickbox":"1","_id":"22064","extern":"1","publication":"Proceedings of the American Mathematical Society","intvolume":" 151","scopus_import":"1","date_created":"2026-06-19T08:12:42Z","oa":1,"article_type":"original","title":"The scattering map determines the nonlinearity","author":[{"last_name":"Killip","first_name":"Rowan","full_name":"Killip, Rowan"},{"full_name":"Murphy, Jason","first_name":"Jason","last_name":"Murphy"},{"full_name":"Visan, Monica","first_name":"Monica","last_name":"Visan","id":"056daca0-b8d1-11f0-964f-f91054abf8ca"}],"mathsc":["35Q55"],"quality_controlled":"1","volume":151,"OA_type":"green","OA_place":"repository","date_published":"2023-06-01T00:00:00Z","language":[{"iso":"eng"}],"arxiv":1},{"author":[{"full_name":"Harrop-Griffiths, Benjamin","last_name":"Harrop-Griffiths","first_name":"Benjamin"},{"first_name":"Rowan","last_name":"Killip","full_name":"Killip, Rowan"},{"full_name":"Visan, Monica","id":"056daca0-b8d1-11f0-964f-f91054abf8ca","first_name":"Monica","last_name":"Visan"}],"title":"Large-data equicontinuity for the derivative NLS","volume":2023,"OA_type":"green","quality_controlled":"1","OA_place":"repository","date_published":"2023-03-01T00:00:00Z","arxiv":1,"language":[{"iso":"eng"}],"publisher":"Oxford University Press","_id":"22072","das_tickbox":"1","page":"4601-4642","intvolume":" 2023","scopus_import":"1","publication":"International Mathematics Research Notices","extern":"1","date_created":"2026-06-19T08:22:03Z","oa":1,"article_type":"original","fulldoi":"https://doi.org/10.1093/imrn/rnab374","external_id":{"arxiv":["2106.13333"]},"publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","article_processing_charge":"No","date_updated":"2026-06-30T10:56:42Z","type":"journal_article","day":"01","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2106.13333"}],"month":"03","citation":{"mla":"Harrop-Griffiths, Benjamin, et al. “Large-Data Equicontinuity for the Derivative NLS.” International Mathematics Research Notices, vol. 2023, no. 6, Oxford University Press, 2023, pp. 4601–42, doi:10.1093/imrn/rnab374.","chicago":"Harrop-Griffiths, Benjamin, Rowan Killip, and Monica Vişan. “Large-Data Equicontinuity for the Derivative NLS.” International Mathematics Research Notices. Oxford University Press, 2023. https://doi.org/10.1093/imrn/rnab374.","short":"B. Harrop-Griffiths, R. Killip, M. Vişan, International Mathematics Research Notices 2023 (2023) 4601–4642.","ista":"Harrop-Griffiths B, Killip R, Vişan M. 2023. Large-data equicontinuity for the derivative NLS. International Mathematics Research Notices. 2023(6), 4601–4642.","ieee":"B. Harrop-Griffiths, R. Killip, and M. Vişan, “Large-data equicontinuity for the derivative NLS,” International Mathematics Research Notices, vol. 2023, no. 6. Oxford University Press, pp. 4601–4642, 2023.","ama":"Harrop-Griffiths B, Killip R, Vişan M. Large-data equicontinuity for the derivative NLS. International Mathematics Research Notices. 2023;2023(6):4601-4642. doi:10.1093/imrn/rnab374","apa":"Harrop-Griffiths, B., Killip, R., & Vişan, M. (2023). Large-data equicontinuity for the derivative NLS. International Mathematics Research Notices. Oxford University Press. https://doi.org/10.1093/imrn/rnab374"},"year":"2023","status":"public","publication_identifier":{"issn":["1073-7928"],"eissn":["1687-0247"]},"doi":"10.1093/imrn/rnab374","abstract":[{"text":"We consider the derivative nonlinear Schrödinger equation in one spatial dimension, which is known to be completely integrable. We prove that the orbits of L^2 bounded and equicontinuous sets of initial data remain bounded and equicontinuous, not only under this flow, but also under the entire hierarchy. This allows us to remove the small-data restriction from prior conservation laws and global well-posedness results.","lang":"eng"}],"issue":"6"},{"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"doi":"10.5194/egusphere-egu23-6157","status":"public","year":"2023","citation":{"chicago":"Polesello, Andrea, Caroline J Muller, Claudia Pasquero, and Agostino N. Meroni. “Intensification Mechanisms of Tropical Cyclones.” In EGU General Assembly 2023. European Geosciences Union, 2023. https://doi.org/10.5194/egusphere-egu23-6157.","mla":"Polesello, Andrea, et al. “Intensification Mechanisms of Tropical Cyclones.” EGU General Assembly 2023, EGU23-6157, European Geosciences Union, 2023, doi:10.5194/egusphere-egu23-6157.","short":"A. Polesello, C.J. Muller, C. Pasquero, A.N. Meroni, in:, EGU General Assembly 2023, European Geosciences Union, 2023.","ista":"Polesello A, Muller CJ, Pasquero C, Meroni AN. 2023. Intensification mechanisms of tropical cyclones. EGU General Assembly 2023. EGU General Assembly, EGU23-6157.","ieee":"A. Polesello, C. J. Muller, C. Pasquero, and A. N. Meroni, “Intensification mechanisms of tropical cyclones,” in EGU General Assembly 2023, Vienna, Austria & Virtual, 2023.","ama":"Polesello A, Muller CJ, Pasquero C, Meroni AN. Intensification mechanisms of tropical cyclones. In: EGU General Assembly 2023. European Geosciences Union; 2023. doi:10.5194/egusphere-egu23-6157","apa":"Polesello, A., Muller, C. J., Pasquero, C., & Meroni, A. N. (2023). Intensification mechanisms of tropical cyclones. In EGU General Assembly 2023. Vienna, Austria & Virtual: European Geosciences Union. https://doi.org/10.5194/egusphere-egu23-6157"},"month":"04","type":"conference_abstract","day":"13","file_date_updated":"2024-01-24T11:19:54Z","date_updated":"2026-07-02T06:42:45Z","article_number":"EGU23-6157","oa_version":"Published Version","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"CaMu"},{"_id":"GradSch"}],"publication_status":"published","fulldoi":"https://doi.org/10.5194/egusphere-egu23-6157","has_accepted_license":"1","date_created":"2024-01-22T12:08:12Z","oa":1,"publication":"EGU General Assembly 2023","ddc":["550"],"_id":"14863","conference":{"end_date":"2023-04-28","start_date":"2023-04-23","location":"Vienna, Austria & Virtual","name":"EGU General Assembly"},"publisher":"European Geosciences Union","language":[{"iso":"eng"}],"corr_author":"1","date_published":"2023-04-13T00:00:00Z","file":[{"date_created":"2024-01-24T11:19:54Z","date_updated":"2024-01-24T11:19:54Z","content_type":"application/pdf","creator":"dernst","file_name":"2023_EGU_Polesello.pdf","checksum":"8cb88c1bc80ccee328478a62064d98f7","access_level":"open_access","file_id":"14883","relation":"main_file","success":1,"file_size":296769}],"author":[{"id":"74c777f4-32da-11ee-b498-874db0835561","last_name":"Polesello","first_name":"Andrea","full_name":"Polesello, Andrea"},{"last_name":"Muller","first_name":"Caroline J","id":"f978ccb0-3f7f-11eb-b193-b0e2bd13182b","full_name":"Muller, Caroline J","orcid":"0000-0001-5836-5350"},{"full_name":"Pasquero, Claudia","first_name":"Claudia","last_name":"Pasquero"},{"full_name":"Meroni, Agostino N.","first_name":"Agostino N.","last_name":"Meroni"}],"title":"Intensification mechanisms of tropical cyclones"},{"OA_type":"gold","publication_status":"published","OA_place":"publisher","fulldoi":"https://doi.org/10.5194/egusphere-egu23-5510","author":[{"orcid":"0000-0002-1990-8508","full_name":"Muñoz Hermosilla, José M","id":"e1037a6d-646e-11ef-b402-e0ed9ab0901e","first_name":"José M","last_name":"Muñoz Hermosilla"},{"full_name":"De Andrés, Eva","last_name":"De Andrés","first_name":"Eva"},{"full_name":"Shahateet, Kaian","first_name":"Kaian","last_name":"Shahateet"},{"first_name":"Jaime","last_name":"Otero","full_name":"Otero, Jaime"},{"last_name":"Navarro","first_name":"Francisco J.","full_name":"Navarro, Francisco J."}],"title":"A 3D glacier dynamics-line plume model to estimate the frontal ablation of Hansbreen, Svalbard","date_updated":"2026-07-02T07:13:16Z","article_number":"EGU23-5510","language":[{"iso":"eng"}],"related_material":{"record":[{"id":"22123","status":"public","relation":"later_version"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2023-09-14T00:00:00Z","oa_version":"None","article_processing_charge":"No","month":"09","conference":{"location":"Vienna, Austria & Virtual","start_date":"2023-04-23","name":"EGU General Assembly","end_date":"2023-04-28"},"citation":{"ama":"Muñoz Hermosilla JM, De Andrés E, Shahateet K, Otero J, Navarro FJ. A 3D glacier dynamics-line plume model to estimate the frontal ablation of Hansbreen, Svalbard. In: EGU General Assembly 2023. European Geosciences Union; 2023. doi:10.5194/egusphere-egu23-5510","ieee":"J. M. Muñoz Hermosilla, E. De Andrés, K. Shahateet, J. Otero, and F. J. Navarro, “A 3D glacier dynamics-line plume model to estimate the frontal ablation of Hansbreen, Svalbard,” in EGU General Assembly 2023, Vienna, Austria & Virtual, 2023.","apa":"Muñoz Hermosilla, J. M., De Andrés, E., Shahateet, K., Otero, J., & Navarro, F. J. (2023). A 3D glacier dynamics-line plume model to estimate the frontal ablation of Hansbreen, Svalbard. In EGU General Assembly 2023. Vienna, Austria & Virtual: European Geosciences Union. https://doi.org/10.5194/egusphere-egu23-5510","ista":"Muñoz Hermosilla JM, De Andrés E, Shahateet K, Otero J, Navarro FJ. 2023. A 3D glacier dynamics-line plume model to estimate the frontal ablation of Hansbreen, Svalbard. EGU General Assembly 2023. EGU General Assembly, EGU23-5510.","chicago":"Muñoz Hermosilla, José M, Eva De Andrés, Kaian Shahateet, Jaime Otero, and Francisco J. Navarro. “A 3D Glacier Dynamics-Line Plume Model to Estimate the Frontal Ablation of Hansbreen, Svalbard.” In EGU General Assembly 2023. European Geosciences Union, 2023. https://doi.org/10.5194/egusphere-egu23-5510.","mla":"Muñoz Hermosilla, José M., et al. “A 3D Glacier Dynamics-Line Plume Model to Estimate the Frontal Ablation of Hansbreen, Svalbard.” EGU General Assembly 2023, EGU23-5510, European Geosciences Union, 2023, doi:10.5194/egusphere-egu23-5510.","short":"J.M. Muñoz Hermosilla, E. De Andrés, K. Shahateet, J. Otero, F.J. Navarro, in:, EGU General Assembly 2023, European Geosciences Union, 2023."},"day":"14","type":"conference_abstract","publisher":"European Geosciences Union","date_created":"2026-06-22T12:19:10Z","has_accepted_license":"1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"ddc":["550"],"status":"public","year":"2023","_id":"22125","publication":"EGU General Assembly 2023","extern":"1","doi":"10.5194/egusphere-egu23-5510"},{"publication_status":"published","department":[{"_id":"MiLe"}],"fulldoi":"https://doi.org/10.4171/qt/193","external_id":{"isi":["001104620800003"]},"date_updated":"2026-07-06T11:52:15Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"Yes","oa_version":"Published Version","month":"10","citation":{"apa":"Carqueville, N., & Szegedy, L. (2023). Fully extended r-spin TQFTs. Quantum Topology. EMS Press. https://doi.org/10.4171/qt/193","ista":"Carqueville N, Szegedy L. 2023. Fully extended r-spin TQFTs. Quantum Topology. 14(3), 467–532.","ama":"Carqueville N, Szegedy L. Fully extended r-spin TQFTs. Quantum Topology. 2023;14(3):467-532. doi:10.4171/qt/193","ieee":"N. Carqueville and L. Szegedy, “Fully extended r-spin TQFTs,” Quantum Topology, vol. 14, no. 3. EMS Press, pp. 467–532, 2023.","short":"N. Carqueville, L. Szegedy, Quantum Topology 14 (2023) 467–532.","mla":"Carqueville, Nils, and Lorant Szegedy. “Fully Extended R-Spin TQFTs.” Quantum Topology, vol. 14, no. 3, EMS Press, 2023, pp. 467–532, doi:10.4171/qt/193.","chicago":"Carqueville, Nils, and Lorant Szegedy. “Fully Extended R-Spin TQFTs.” Quantum Topology. EMS Press, 2023. https://doi.org/10.4171/qt/193."},"type":"journal_article","day":"16","keyword":["Geometry and Topology","Mathematical Physics"],"file_date_updated":"2024-01-09T09:25:34Z","issue":"3","abstract":[{"lang":"eng","text":"We prove the r-spin cobordism hypothesis in the setting of (weak) 2-categories for every positive integer r: the 2-groupoid of 2-dimensional fully extended r-spin TQFTs with given target is equivalent to the homotopy fixed points of an induced Spin 2r -action. In particular, such TQFTs are classified by fully dualisable objects together with a trivialisation of the rth power of their Serre automorphisms. For r=1, we recover the oriented case (on which our proof builds), while ordinary spin structures correspond to r=2.\r\nTo construct examples, we explicitly describe Spin 2r-homotopy fixed points in the equivariant completion of any symmetric monoidal 2-category. We also show that every object in a 2-category of Landau–Ginzburg models gives rise to fully extended spin TQFTs and that half of these do not factor through the oriented bordism 2-category."}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"status":"public","acknowledgement":"N.C. is supported by the DFG Heisenberg Programme.\r\nWe are grateful to Tobias Dyckerhoff, Lukas Müller, Ingo Runkel, and Christopher Schommer-Pries for helpful discussions.","year":"2023","publication_identifier":{"issn":["1663-487X"]},"doi":"10.4171/qt/193","quality_controlled":"1","volume":14,"title":"Fully extended r-spin TQFTs","author":[{"full_name":"Carqueville, Nils","first_name":"Nils","last_name":"Carqueville"},{"orcid":"0000-0003-2834-5054","full_name":"Szegedy, Lorant","id":"7943226E-220E-11EA-94C7-D59F3DDC885E","last_name":"Szegedy","first_name":"Lorant"}],"language":[{"iso":"eng"}],"corr_author":"1","date_published":"2023-10-16T00:00:00Z","file":[{"success":1,"file_size":707344,"relation":"main_file","file_id":"14764","checksum":"b0590aff6e7ec89cc149ba94d459d3a3","access_level":"open_access","creator":"dernst","file_name":"2023_QuantumTopol_Carqueville.pdf","content_type":"application/pdf","date_created":"2024-01-09T09:25:34Z","date_updated":"2024-01-09T09:25:34Z"}],"isi":1,"publisher":"EMS Press","oa":1,"date_created":"2024-01-08T13:14:48Z","has_accepted_license":"1","article_type":"original","das_tickbox":"1","ddc":["530"],"page":"467-532","_id":"14756","publication":"Quantum Topology","scopus_import":"1","intvolume":" 14"},{"department":[{"_id":"DaAl"}],"publication_status":"published","fulldoi":"https://doi.org/10.1145/3591230","date_updated":"2026-07-06T12:12:08Z","article_number":"116","oa_version":"Published Version","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Koval N, Khalanskiy D, Alistarh D-A. 2023. CQS: A formally-verified framework for fair and abortable synchronization. Proceedings of the ACM on Programming Languages. 7, 116.","ama":"Koval N, Khalanskiy D, Alistarh D-A. CQS: A formally-verified framework for fair and abortable synchronization. Proceedings of the ACM on Programming Languages. 2023;7. doi:10.1145/3591230","ieee":"N. Koval, D. Khalanskiy, and D.-A. Alistarh, “CQS: A formally-verified framework for fair and abortable synchronization,” Proceedings of the ACM on Programming Languages, vol. 7. Association for Computing Machinery, 2023.","apa":"Koval, N., Khalanskiy, D., & Alistarh, D.-A. (2023). CQS: A formally-verified framework for fair and abortable synchronization. Proceedings of the ACM on Programming Languages. Association for Computing Machinery. https://doi.org/10.1145/3591230","mla":"Koval, Nikita, et al. “CQS: A Formally-Verified Framework for Fair and Abortable Synchronization.” Proceedings of the ACM on Programming Languages, vol. 7, 116, Association for Computing Machinery, 2023, doi:10.1145/3591230.","chicago":"Koval, Nikita, Dmitry Khalanskiy, and Dan-Adrian Alistarh. “CQS: A Formally-Verified Framework for Fair and Abortable Synchronization.” Proceedings of the ACM on Programming Languages. Association for Computing Machinery, 2023. https://doi.org/10.1145/3591230.","short":"N. Koval, D. Khalanskiy, D.-A. Alistarh, Proceedings of the ACM on Programming Languages 7 (2023)."},"month":"06","day":"06","type":"journal_article","file_date_updated":"2023-07-03T13:09:39Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"abstract":[{"lang":"eng","text":"Writing concurrent code that is both correct and efficient is notoriously difficult. Thus, programmers often prefer to use synchronization abstractions, which render code simpler and easier to reason about. Despite a wealth of work on this topic, there is still a gap between the rich semantics provided by synchronization abstractions in modern programming languages—specifically, fair FIFO ordering of synchronization requests and support for abortable operations—and frameworks for implementing it correctly and efficiently. Supporting such semantics is critical given the rising popularity of constructs for asynchronous programming, such as coroutines, which abort frequently and are cheaper to suspend and resume compared to native threads.\r\n\r\nThis paper introduces a new framework called CancellableQueueSynchronizer (CQS), which enables simple yet efficient implementations of a wide range of fair and abortable synchronization primitives: mutexes, semaphores, barriers, count-down latches, and blocking pools. Our main contribution is algorithmic, as implementing both fairness and abortability efficiently at this level of generality is non-trivial. Importantly, all our algorithms, including the CQS framework and the primitives built on top of it, come with formal proofs in the Iris framework for Coq for many of their properties. These proofs are modular, so it is easy to show correctness for new primitives implemented on top of CQS. From a practical perspective, implementation of CQS for native threads on the JVM improves throughput by up to two orders of magnitude over Java’s AbstractQueuedSynchronizer, the only practical abstraction offering similar semantics. Further, we successfully integrated CQS as a core component of the popular Kotlin Coroutines library, validating the framework’s practical impact and expressiveness in a real-world environment. In sum, CancellableQueueSynchronizer is the first framework to combine expressiveness with formal guarantees and solid practical performance. Our approach should be extensible to other languages and families of synchronization primitives."}],"doi":"10.1145/3591230","publication_identifier":{"eissn":["2475-1421"]},"status":"public","year":"2023","quality_controlled":"1","volume":7,"author":[{"full_name":"Koval, Nikita","id":"2F4DB10C-F248-11E8-B48F-1D18A9856A87","first_name":"Nikita","last_name":"Koval"},{"full_name":"Khalanskiy, Dmitry","last_name":"Khalanskiy","first_name":"Dmitry"},{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian"}],"title":"CQS: A formally-verified framework for fair and abortable synchronization","language":[{"iso":"eng"}],"date_published":"2023-06-06T00:00:00Z","corr_author":"1","file":[{"date_updated":"2023-07-03T13:09:39Z","date_created":"2023-07-03T13:09:39Z","content_type":"application/pdf","file_name":"2023_ACMProgram.Lang._Koval.pdf","creator":"alisjak","access_level":"open_access","checksum":"5dba6e73f0ed79adbdae14d165bc2f68","relation":"main_file","file_id":"13187","success":1,"file_size":1266773}],"publisher":"Association for Computing Machinery","has_accepted_license":"1","article_type":"original","date_created":"2023-07-02T22:00:43Z","oa":1,"publication":"Proceedings of the ACM on Programming Languages","scopus_import":"1","intvolume":" 7","das_tickbox":"1","ddc":["000"],"_id":"13179"},{"article_processing_charge":"No","oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2026-07-06T11:57:38Z","external_id":{"arxiv":["2108.02655"]},"fulldoi":"https://doi.org/10.1137/1.9781611977585.ch17","department":[{"_id":"DaAl"}],"publication_status":"published","doi":"10.1137/1.9781611977585.ch17","publication_identifier":{"eisbn":["9781611977585"]},"year":"2023","status":"public","acknowledgement":"We thank the anonymous reviewers for their helpful feedback on previous versions of this work. Parts ofthis work appeared in DISC 2021 as a brief announcement [ 21]. This work was supported in part by theEuropean Research Council (ERC) under the European Union’s Horizon 2020 research and innovationprogramme (grant agreement No 805223 ScaleML), the Academy of Finland (grant agreement No 333837),the Austrian Science Fund (FWF) and netIDEE (grant agreement No P 33775-N), and the AustrianScience Fund (FWF) project DELTA (grant agreement No I 5025-N).","abstract":[{"text":"The sinkless orientation problem plays a key role in understanding the foundations of distributed computing. The problem can be used to separate two fundamental models of distributed graph algorithms, LOCAL and SLOCAL: the locality of sinkless orientation is Ω(log n) in the deterministic LOCAL model and O(log log n) in the deterministic SLOCAL model. Both of these results are known by prior work, but here we give new simple, self-contained proofs for them.","lang":"eng"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2108.02655"}],"ec_funded":1,"type":"book_chapter","day":"12","citation":{"mla":"Balliu, Alkida, et al. “Sinkless Orientation Made Simple.” Symposium on Simplicity in Algorithms, Society for Industrial and Applied Mathematics, 2023, pp. 175–91, doi:10.1137/1.9781611977585.ch17.","chicago":"Balliu, Alkida, Janne Korhonen, Fabian Kuhn, Henrik Lievonen, Dennis Olivetti, Shreyas Pai, Ami Paz, et al. “Sinkless Orientation Made Simple.” In Symposium on Simplicity in Algorithms, 175–91. Society for Industrial and Applied Mathematics, 2023. https://doi.org/10.1137/1.9781611977585.ch17.","short":"A. Balliu, J. Korhonen, F. Kuhn, H. Lievonen, D. Olivetti, S. Pai, A. Paz, J. Rybicki, S. Schmid, J. Studený, J. Suomela, J. Uitto, in:, Symposium on Simplicity in Algorithms, Society for Industrial and Applied Mathematics, 2023, pp. 175–191.","ista":"Balliu A, Korhonen J, Kuhn F, Lievonen H, Olivetti D, Pai S, Paz A, Rybicki J, Schmid S, Studený J, Suomela J, Uitto J. 2023.Sinkless Orientation Made Simple. In: Symposium on Simplicity in Algorithms. , 175–191.","ama":"Balliu A, Korhonen J, Kuhn F, et al. Sinkless Orientation Made Simple. In: Symposium on Simplicity in Algorithms. Society for Industrial and Applied Mathematics; 2023:175-191. doi:10.1137/1.9781611977585.ch17","apa":"Balliu, A., Korhonen, J., Kuhn, F., Lievonen, H., Olivetti, D., Pai, S., … Uitto, J. (2023). Sinkless Orientation Made Simple. In Symposium on Simplicity in Algorithms (pp. 175–191). Florence, Italy: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611977585.ch17","ieee":"A. Balliu et al., “Sinkless Orientation Made Simple,” in Symposium on Simplicity in Algorithms, Society for Industrial and Applied Mathematics, 2023, pp. 175–191."},"month":"01","date_published":"2023-01-12T00:00:00Z","arxiv":1,"language":[{"iso":"eng"}],"author":[{"full_name":"Balliu, Alkida","last_name":"Balliu","first_name":"Alkida"},{"full_name":"Korhonen, Janne","last_name":"Korhonen","first_name":"Janne","id":"C5402D42-15BC-11E9-A202-CA2BE6697425"},{"full_name":"Kuhn, Fabian","last_name":"Kuhn","first_name":"Fabian"},{"first_name":"Henrik","last_name":"Lievonen","full_name":"Lievonen, Henrik"},{"first_name":"Dennis","last_name":"Olivetti","full_name":"Olivetti, Dennis"},{"full_name":"Pai, Shreyas","first_name":"Shreyas","last_name":"Pai"},{"full_name":"Paz, Ami","first_name":"Ami","last_name":"Paz"},{"full_name":"Rybicki, Joel","orcid":"0000-0002-6432-6646","first_name":"Joel","last_name":"Rybicki","id":"334EFD2E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Schmid, Stefan","first_name":"Stefan","last_name":"Schmid"},{"full_name":"Studený, Jan","last_name":"Studený","first_name":"Jan"},{"first_name":"Jukka","last_name":"Suomela","full_name":"Suomela, Jukka"},{"last_name":"Uitto","first_name":"Jara","full_name":"Uitto, Jara"}],"title":"Sinkless Orientation Made Simple","OA_place":"repository","OA_type":"green","quality_controlled":"1","publication":"Symposium on Simplicity in Algorithms","_id":"19983","page":"175-191","das_tickbox":"1","project":[{"grant_number":"805223","_id":"268A44D6-B435-11E9-9278-68D0E5697425","name":"Elastic Coordination for Scalable Machine Learning","call_identifier":"H2020"},{"_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe","grant_number":"P33775","name":"Fast Algorithms for a Reactive Network Layer"}],"date_created":"2025-07-10T13:11:47Z","oa":1,"publisher":"Society for Industrial and Applied Mathematics","conference":{"start_date":"2023-01-23","location":"Florence, Italy","name":"SOSA: Symposium on Simplicity in Algorithms","end_date":"2023-01-25"}},{"date_published":"2023-08-01T00:00:00Z","file":[{"date_created":"2023-08-02T07:42:26Z","date_updated":"2023-08-02T07:42:26Z","file_name":"2023_AstrophysicalJour_Mathur.pdf","creator":"dernst","content_type":"application/pdf","access_level":"open_access","checksum":"f12452834d7ed6748dbf5ace18af4723","success":1,"file_size":4192386,"file_id":"13448","relation":"main_file"}],"language":[{"iso":"eng"}],"title":"Magnetic activity evolution of solar-like stars. I. Sph–age relation derived from Kepler observations","author":[{"last_name":"Mathur","first_name":"Savita","full_name":"Mathur, Savita"},{"full_name":"Claytor, Zachary R.","first_name":"Zachary R.","last_name":"Claytor"},{"first_name":"Ângela R. G.","last_name":"Santos","full_name":"Santos, Ângela R. G."},{"first_name":"Rafael A.","last_name":"García","full_name":"García, Rafael A."},{"full_name":"Amard, Louis","last_name":"Amard","first_name":"Louis"},{"last_name":"Bugnet","first_name":"Lisa Annabelle","id":"d9edb345-f866-11ec-9b37-d119b5234501","full_name":"Bugnet, Lisa Annabelle","orcid":"0000-0003-0142-4000"},{"first_name":"Enrico","last_name":"Corsaro","full_name":"Corsaro, Enrico"},{"full_name":"Bonanno, Alfio","last_name":"Bonanno","first_name":"Alfio"},{"first_name":"Sylvain N.","last_name":"Breton","full_name":"Breton, Sylvain N."},{"last_name":"Godoy-Rivera","first_name":"Diego","full_name":"Godoy-Rivera, Diego"},{"last_name":"Pinsonneault","first_name":"Marc H.","full_name":"Pinsonneault, Marc H."},{"last_name":"van Saders","first_name":"Jennifer","full_name":"van Saders, Jennifer"}],"quality_controlled":"1","volume":952,"das_tickbox":"1","ddc":["520"],"_id":"13443","publication":"The Astrophysical Journal","scopus_import":"1","intvolume":" 952","date_created":"2023-08-01T14:19:16Z","oa":1,"has_accepted_license":"1","article_type":"original","publisher":"IOP Publishing","isi":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"Yes","oa_version":"Published Version","date_updated":"2026-07-06T12:20:17Z","article_number":"131","fulldoi":"https://doi.org/10.3847/1538-4357/acd118","external_id":{"isi":["001034185700001"]},"publication_status":"published","department":[{"_id":"LiBu"}],"status":"public","acknowledgement":"This paper includes data collected by the Kepler mission and obtained from the MAST data archive at the Space Telescope Science Institute (STScI). Funding for the Kepler mission is provided by the NASA Science Mission Directorate. STScI is operated by the Association of Universities for Research in Astronomy, Inc., under NASA contract NAS 5–26555. We acknowledge that this research was supported in part by the National Science Foundation under grant No. NSF PHY-1748958. S.M. acknowledges support from the Spanish Ministry of Science and Innovation (MICINN) with the Ramón y Cajal fellowship No. RYC-2015-17697, the grant No. PID2019-107061GB-C66, and through AEI under the Severo Ochoa Centres of Excellence Programme 2020–2023 (CEX2019-000920-S). S.M. and D.G.R. acknowledge support from the Spanish Ministry of Science and Innovation (MICINN) with the grant No. PID2019-107187GB-I00. Z.R.C. acknowledges support from National Aeronautics and Space Administration via the TESS Guest Investigator Program (grant No. 80NSSC18K18584). The work presented here was partially supported by the NASA grant NNX17AF27G. A.R.G.S. acknowledges the support by FCT through national funds and by FEDER through COMPETE2020 by the following grants: UIDB/04434/2020 and UIDP/04434/2020. A.R.G.S. is supported by FCT through the work contract No. 2020.02480.CEECIND/CP1631/CT0001. R.A.G., L.A., and S.N.B. acknowledge the support from PLATO and GOLF CNES grants. S.N.B. acknowledges support from PLATO ASI-INAF agreement No. 2015-019-R.1-2018.","year":"2023","doi":"10.3847/1538-4357/acd118","publication_identifier":{"eissn":["1538-4357"],"issn":["0004-637X"]},"issue":"2","abstract":[{"lang":"eng","text":"The ages of solar-like stars have been at the center of many studies such as exoplanet characterization or Galactic-archeology. While ages are usually computed from stellar evolution models, relations linking ages to other stellar properties, such as rotation and magnetic activity, have been investigated. With the large catalog of 55,232 rotation periods, Prot, and photometric magnetic activity index, Sph from Kepler data, we have the opportunity to look for such magneto-gyro-chronology relations. Stellar ages are obtained with two stellar evolution codes that include treatment of angular momentum evolution, hence using Prot as input in addition to classical atmospheric parameters. We explore two different ways of predicting stellar ages on three subsamples with spectroscopic observations: solar analogs, late-F and G dwarfs, and K dwarfs. We first perform a Bayesian analysis to derive relations between Sph and ages between 1 and 5 Gyr, and other stellar properties. For late-F and G dwarfs, and K dwarfs, the multivariate regression favors the model with Prot and Sph with median differences of 0.1% and 0.2%, respectively. We also apply Machine Learning techniques with a Random Forest algorithm to predict ages up to 14 Gyr with the same set of input parameters. For late-F, G and K dwarfs together, predicted ages are on average within 5.3% of the model ages and improve to 3.1% when including Prot. These are very promising results for a quick age estimation for solar-like stars with photometric observations, especially with current and future space missions."}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"day":"01","type":"journal_article","keyword":["Space and Planetary Science","Astronomy and Astrophysics"],"file_date_updated":"2023-08-02T07:42:26Z","month":"08","citation":{"mla":"Mathur, Savita, et al. “Magnetic Activity Evolution of Solar-like Stars. I. Sph–Age Relation Derived from Kepler Observations.” The Astrophysical Journal, vol. 952, no. 2, 131, IOP Publishing, 2023, doi:10.3847/1538-4357/acd118.","chicago":"Mathur, Savita, Zachary R. Claytor, Ângela R. G. Santos, Rafael A. García, Louis Amard, Lisa Annabelle Bugnet, Enrico Corsaro, et al. “Magnetic Activity Evolution of Solar-like Stars. I. Sph–Age Relation Derived from Kepler Observations.” The Astrophysical Journal. IOP Publishing, 2023. https://doi.org/10.3847/1538-4357/acd118.","short":"S. Mathur, Z.R. Claytor, Â.R.G. Santos, R.A. García, L. Amard, L.A. Bugnet, E. Corsaro, A. Bonanno, S.N. Breton, D. Godoy-Rivera, M.H. Pinsonneault, J. van Saders, The Astrophysical Journal 952 (2023).","ista":"Mathur S, Claytor ZR, Santos ÂRG, García RA, Amard L, Bugnet LA, Corsaro E, Bonanno A, Breton SN, Godoy-Rivera D, Pinsonneault MH, van Saders J. 2023. Magnetic activity evolution of solar-like stars. I. Sph–age relation derived from Kepler observations. The Astrophysical Journal. 952(2), 131.","apa":"Mathur, S., Claytor, Z. R., Santos, Â. R. G., García, R. A., Amard, L., Bugnet, L. A., … van Saders, J. (2023). Magnetic activity evolution of solar-like stars. I. Sph–age relation derived from Kepler observations. The Astrophysical Journal. IOP Publishing. https://doi.org/10.3847/1538-4357/acd118","ama":"Mathur S, Claytor ZR, Santos ÂRG, et al. Magnetic activity evolution of solar-like stars. I. Sph–age relation derived from Kepler observations. The Astrophysical Journal. 2023;952(2). doi:10.3847/1538-4357/acd118","ieee":"S. Mathur et al., “Magnetic activity evolution of solar-like stars. I. Sph–age relation derived from Kepler observations,” The Astrophysical Journal, vol. 952, no. 2. IOP Publishing, 2023."}},{"ec_funded":1,"day":"28","type":"dissertation","file_date_updated":"2023-05-02T07:43:18Z","citation":{"apa":"Calcabrini, M. (2023). Nanoparticle-based semiconductor solids: From synthesis to consolidation. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:12885","ista":"Calcabrini M. 2023. Nanoparticle-based semiconductor solids: From synthesis to consolidation. Institute of Science and Technology Austria.","ama":"Calcabrini M. Nanoparticle-based semiconductor solids: From synthesis to consolidation. 2023. doi:10.15479/at:ista:12885","ieee":"M. Calcabrini, “Nanoparticle-based semiconductor solids: From synthesis to consolidation,” Institute of Science and Technology Austria, 2023.","short":"M. Calcabrini, Nanoparticle-Based Semiconductor Solids: From Synthesis to Consolidation, Institute of Science and Technology Austria, 2023.","mla":"Calcabrini, Mariano. Nanoparticle-Based Semiconductor Solids: From Synthesis to Consolidation. Institute of Science and Technology Austria, 2023, doi:10.15479/at:ista:12885.","chicago":"Calcabrini, Mariano. “Nanoparticle-Based Semiconductor Solids: From Synthesis to Consolidation.” Institute of Science and Technology Austria, 2023. https://doi.org/10.15479/at:ista:12885."},"month":"04","doi":"10.15479/at:ista:12885","publication_identifier":{"isbn":["978-3-99078-028-2"],"issn":["2663-337X"]},"status":"public","year":"2023","abstract":[{"lang":"eng","text":"High-performance semiconductors rely upon precise control of heat and charge transport. This can be achieved by precisely engineering defects in polycrystalline solids. There are multiple approaches to preparing such polycrystalline semiconductors, and the transformation of solution-processed colloidal nanoparticles is appealing because colloidal nanoparticles combine low cost with structural and compositional tunability along with rich surface chemistry. However, the multiple processes from nanoparticle synthesis to the final bulk nanocomposites are very complex. They involve nanoparticle purification, post-synthetic modifications, and finally consolidation (thermal treatments and densification). All these properties dictate the final material’s composition and microstructure, ultimately affecting its functional properties. This thesis explores the synthesis, surface chemistry and consolidation of colloidal semiconductor nanoparticles into dense solids. In particular, the transformations that take place during these processes, and their effect on the material’s transport properties are evaluated. "}],"fulldoi":"https://doi.org/10.15479/at:ista:12885","department":[{"_id":"GradSch"},{"_id":"MaIb"}],"publication_status":"published","oa_version":"Published Version","article_processing_charge":"No","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","date_updated":"2026-07-06T12:16:05Z","publisher":"Institute of Science and Technology Austria","alternative_title":["ISTA Thesis"],"ddc":["546","541"],"page":"82","_id":"12885","has_accepted_license":"1","project":[{"call_identifier":"H2020","name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385"}],"degree_awarded":"PhD","date_created":"2023-05-02T07:58:57Z","oa":1,"acknowledged_ssus":[{"_id":"EM-Fac"},{"_id":"NanoFab"}],"author":[{"full_name":"Calcabrini, Mariano","orcid":"0000-0003-4566-5877","last_name":"Calcabrini","first_name":"Mariano","id":"45D7531A-F248-11E8-B48F-1D18A9856A87"}],"title":"Nanoparticle-based semiconductor solids: From synthesis to consolidation","OA_place":"publisher","supervisor":[{"orcid":"0000-0001-5013-2843","full_name":"Ibáñez, Maria","id":"43C61214-F248-11E8-B48F-1D18A9856A87","last_name":"Ibáñez","first_name":"Maria"}],"corr_author":"1","date_published":"2023-04-28T00:00:00Z","file":[{"date_created":"2023-05-02T07:43:18Z","date_updated":"2023-05-02T07:43:18Z","file_name":"Thesis_Calcabrini.docx","creator":"mcalcabr","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","access_level":"closed","checksum":"9347b0e09425f56fdcede5d3528404dc","file_size":99627036,"file_id":"12887","relation":"source_file"},{"file_name":"Thesis_Calcabrini_pdfa.pdf","creator":"mcalcabr","content_type":"application/pdf","date_updated":"2023-05-02T07:42:45Z","date_created":"2023-05-02T07:42:45Z","success":1,"file_size":8742220,"relation":"main_file","file_id":"12888","checksum":"2d188b76621086cd384f0b9264b0a576","access_level":"open_access"}],"related_material":{"record":[{"id":"12237","status":"public","relation":"part_of_dissertation"},{"status":"public","relation":"part_of_dissertation","id":"10806"},{"status":"public","relation":"part_of_dissertation","id":"10123"},{"id":"9118","status":"public","relation":"part_of_dissertation"},{"status":"public","relation":"part_of_dissertation","id":"10042"}]},"language":[{"iso":"eng"}]}]