[{"scopus_import":"1","date_updated":"2025-09-09T14:06:03Z","abstract":[{"text":"Background: Antimicrobial resistance (AMR) poses a significant global health threat, and an accurate prediction of bacterial resistance patterns is critical for effective treatment and control strategies. In recent years, machine learning (ML) approaches have emerged as powerful tools for analyzing large-scale bacterial AMR data. However, ML methods often ignore evolutionary relationships among bacterial strains, which can greatly impact performance of the ML methods, especially if resistance-associated features are attempted to be detected. Genome-wide association studies (GWAS) methods like linear mixed models accounts for the evolutionary relationships in bacteria, but they uncover only highly significant variants which have already been reported in literature.\r\n\r\nResults: In this work, we introduce a novel phylogeny-related parallelism score (PRPS), which measures whether a certain feature is correlated with the population structure of a set of samples. We demonstrate that PRPS can be used, in combination with SVM- and random forest-based models, to reduce the number of features in the analysis, while simultaneously increasing models’ performance. We applied our pipeline to publicly available AMR data from PATRIC database for Mycobacterium tuberculosis against six common antibiotics.\r\n\r\nConclusions: Using our pipeline, we re-discovered known resistance-associated mutations as well as new candidate mutations which can be related to resistance and not previously reported in the literature. We demonstrated that taking into account phylogenetic relationships not only improves the model performance, but also yields more biologically relevant predicted most contributing resistance markers.","lang":"eng"}],"_id":"14716","citation":{"apa":"Yurtseven, A., Buyanova, S., Agrawal, A. A. A., Bochkareva, O., &#38; Kalinina, O. V. V. (2023). Machine learning and phylogenetic analysis allow for predicting antibiotic resistance in M. tuberculosis. <i>BMC Microbiology</i>. Springer Nature. <a href=\"https://doi.org/10.1186/s12866-023-03147-7\">https://doi.org/10.1186/s12866-023-03147-7</a>","ista":"Yurtseven A, Buyanova S, Agrawal AAA, Bochkareva O, Kalinina OVV. 2023. Machine learning and phylogenetic analysis allow for predicting antibiotic resistance in M. tuberculosis. BMC Microbiology. 23(1), 404.","mla":"Yurtseven, Alper, et al. “Machine Learning and Phylogenetic Analysis Allow for Predicting Antibiotic Resistance in M. Tuberculosis.” <i>BMC Microbiology</i>, vol. 23, no. 1, 404, Springer Nature, 2023, doi:<a href=\"https://doi.org/10.1186/s12866-023-03147-7\">10.1186/s12866-023-03147-7</a>.","ieee":"A. Yurtseven, S. Buyanova, A. A. A. Agrawal, O. Bochkareva, and O. V. V. Kalinina, “Machine learning and phylogenetic analysis allow for predicting antibiotic resistance in M. tuberculosis,” <i>BMC Microbiology</i>, vol. 23, no. 1. Springer Nature, 2023.","chicago":"Yurtseven, Alper, Sofia Buyanova, Amay Ajaykumar A. Agrawal, Olga Bochkareva, and Olga V V. Kalinina. “Machine Learning and Phylogenetic Analysis Allow for Predicting Antibiotic Resistance in M. Tuberculosis.” <i>BMC Microbiology</i>. Springer Nature, 2023. <a href=\"https://doi.org/10.1186/s12866-023-03147-7\">https://doi.org/10.1186/s12866-023-03147-7</a>.","short":"A. Yurtseven, S. Buyanova, A.A.A. Agrawal, O. Bochkareva, O.V.V. Kalinina, BMC Microbiology 23 (2023).","ama":"Yurtseven A, Buyanova S, Agrawal AAA, Bochkareva O, Kalinina OVV. Machine learning and phylogenetic analysis allow for predicting antibiotic resistance in M. tuberculosis. <i>BMC Microbiology</i>. 2023;23(1). doi:<a href=\"https://doi.org/10.1186/s12866-023-03147-7\">10.1186/s12866-023-03147-7</a>"},"article_processing_charge":"Yes (via OA deal)","doi":"10.1186/s12866-023-03147-7","article_type":"original","acknowledgement":"Open Access funding enabled and organized by Projekt DEAL. A.Y. and O.V.K. acknowledge financial support from the Klaus Faber Foundation. A.A.A. was funded by the Helmholtz AI project AMR-XAI. The work of O.O.B. is funded by Fonds zur Förderung der Wissenschaftlichen Forschung (FWF), Grant ESP 253-B.","date_created":"2023-12-31T23:01:02Z","external_id":{"isi":["001128788700001"],"pmid":["38124060"]},"publication":"BMC Microbiology","file":[{"file_name":"2023_BMCMicrobiology_Yurtseven.pdf","file_size":1979922,"date_updated":"2024-01-02T09:09:32Z","relation":"main_file","creator":"dernst","date_created":"2024-01-02T09:09:32Z","file_id":"14723","content_type":"application/pdf","success":1,"access_level":"open_access","checksum":"7ff5e95f3496ff663301eb4a13a316d5"}],"publisher":"Springer Nature","article_number":"404","date_published":"2023-12-01T00:00:00Z","day":"01","publication_identifier":{"eissn":["1471-2180"]},"type":"journal_article","year":"2023","department":[{"_id":"FyKo"}],"month":"12","author":[{"first_name":"Alper","full_name":"Yurtseven, Alper","last_name":"Yurtseven"},{"full_name":"Buyanova, Sofia","first_name":"Sofia","id":"2F54A7BC-3902-11EA-AC87-BC9F3DDC885E","last_name":"Buyanova"},{"last_name":"Agrawal","full_name":"Agrawal, Amay Ajaykumar A.","first_name":"Amay Ajaykumar A."},{"full_name":"Bochkareva, Olga","first_name":"Olga","id":"C4558D3C-6102-11E9-A62E-F418E6697425","orcid":"0000-0003-1006-6639","last_name":"Bochkareva"},{"last_name":"Kalinina","first_name":"Olga V V.","full_name":"Kalinina, Olga V V."}],"intvolume":"        23","issue":"1","has_accepted_license":"1","ddc":["570"],"status":"public","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"isi":1,"pmid":1,"oa":1,"quality_controlled":"1","publication_status":"published","file_date_updated":"2024-01-02T09:09:32Z","language":[{"iso":"eng"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","title":"Machine learning and phylogenetic analysis allow for predicting antibiotic resistance in M. tuberculosis","volume":23,"oa_version":"Published Version"},{"abstract":[{"lang":"eng","text":"Lithium–sulfur batteries are regarded as an advantageous option for meeting the growing demand for high-energy-density storage, but their commercialization relies on solving the current limitations of both sulfur cathodes and lithium metal anodes. In this scenario, the implementation of lithium sulfide (Li2S) cathodes compatible with alternative anode materials such as silicon has the potential to alleviate the safety concerns associated with lithium metal. In this direction, here, we report a sulfur cathode based on Li2S nanocrystals grown on a catalytic host consisting of CoFeP nanoparticles supported on tubular carbon nitride. Nanosized Li2S is incorporated into the host by a scalable liquid infiltration–evaporation method. Theoretical calculations and experimental results demonstrate that the CoFeP–CN composite can boost the polysulfide adsorption/conversion reaction kinetics and strongly reduce the initial overpotential activation barrier by stretching the Li–S bonds of Li2S. Besides, the ultrasmall size of the Li2S particles in the Li2S–CoFeP–CN composite cathode facilitates the initial activation. Overall, the Li2S–CoFeP–CN electrodes exhibit a low activation barrier of 2.56 V, a high initial capacity of 991 mA h gLi2S–1, and outstanding cyclability with a small fading rate of 0.029% per cycle over 800 cycles. Moreover, Si/Li2S full cells are assembled using the nanostructured Li2S–CoFeP–CN cathode and a prelithiated anode based on graphite-supported silicon nanowires. These Si/Li2S cells demonstrate high initial discharge capacities above 900 mA h gLi2S–1 and good cyclability with a capacity fading rate of 0.28% per cycle over 150 cycles."}],"date_updated":"2025-09-09T14:04:51Z","scopus_import":"1","article_type":"original","acknowledgement":"The authors acknowledge the support from the 2BoSS project of the ERA-MIN3 program with the Spanish grant number PCI2022-132985/AEI/10.13039/501100011033 and the French grant number ANR-22-MIN3-0003-01. J.L. acknowledges the support from the Natural Science Foundation of Sichuan Province 2022NSFSC1229. The authors acknowledge the funding from Generalitat de Catalunya 2021 SGR 01581 and European Union NextGenerationEU/PRTR. This research was supported by the Scientific Service Units (SSU) of ISTA Austria through resources provided by Electron Microscopy Facility (EMF) and the Nanofabrication Facility (NNF).","date_created":"2023-12-31T23:01:03Z","external_id":{"isi":["001143038500001"],"pmid":["38052030"]},"doi":"10.1021/acsami.3c14072","article_processing_charge":"No","_id":"14719","citation":{"ama":"Mollania H, Zhang C, Du R, et al. Nanostructured Li₂S cathodes for silicon-sulfur batteries. <i>ACS Applied Materials and Interfaces</i>. 2023;15(50):58462–58475. doi:<a href=\"https://doi.org/10.1021/acsami.3c14072\">10.1021/acsami.3c14072</a>","ieee":"H. Mollania <i>et al.</i>, “Nanostructured Li₂S cathodes for silicon-sulfur batteries,” <i>ACS Applied Materials and Interfaces</i>, vol. 15, no. 50. American Chemical Society, pp. 58462–58475, 2023.","chicago":"Mollania, Hamid, Chaoqi Zhang, Ruifeng Du, Xueqiang Qi, Junshan Li, Sharona Horta, Maria Ibáñez, et al. “Nanostructured Li₂S Cathodes for Silicon-Sulfur Batteries.” <i>ACS Applied Materials and Interfaces</i>. American Chemical Society, 2023. <a href=\"https://doi.org/10.1021/acsami.3c14072\">https://doi.org/10.1021/acsami.3c14072</a>.","short":"H. Mollania, C. Zhang, R. Du, X. Qi, J. Li, S. Horta, M. Ibáñez, C. Keller, P. Chenevier, M. Oloomi-Buygi, A. Cabot, ACS Applied Materials and Interfaces 15 (2023) 58462–58475.","mla":"Mollania, Hamid, et al. “Nanostructured Li₂S Cathodes for Silicon-Sulfur Batteries.” <i>ACS Applied Materials and Interfaces</i>, vol. 15, no. 50, American Chemical Society, 2023, pp. 58462–58475, doi:<a href=\"https://doi.org/10.1021/acsami.3c14072\">10.1021/acsami.3c14072</a>.","ista":"Mollania H, Zhang C, Du R, Qi X, Li J, Horta S, Ibáñez M, Keller C, Chenevier P, Oloomi-Buygi M, Cabot A. 2023. Nanostructured Li₂S cathodes for silicon-sulfur batteries. ACS Applied Materials and Interfaces. 15(50), 58462–58475.","apa":"Mollania, H., Zhang, C., Du, R., Qi, X., Li, J., Horta, S., … Cabot, A. (2023). Nanostructured Li₂S cathodes for silicon-sulfur batteries. <i>ACS Applied Materials and Interfaces</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/acsami.3c14072\">https://doi.org/10.1021/acsami.3c14072</a>"},"day":"05","date_published":"2023-12-05T00:00:00Z","publication":"ACS Applied Materials and Interfaces","publisher":"American Chemical Society","year":"2023","department":[{"_id":"MaIb"}],"month":"12","acknowledged_ssus":[{"_id":"EM-Fac"},{"_id":"NanoFab"}],"publication_identifier":{"eissn":["1944-8252"],"issn":["1944-8244"]},"type":"journal_article","intvolume":"        15","issue":"50","author":[{"first_name":"Hamid","full_name":"Mollania, Hamid","last_name":"Mollania"},{"full_name":"Zhang, Chaoqi","first_name":"Chaoqi","last_name":"Zhang"},{"first_name":"Ruifeng","full_name":"Du, Ruifeng","last_name":"Du"},{"last_name":"Qi","first_name":"Xueqiang","full_name":"Qi, Xueqiang"},{"first_name":"Junshan","full_name":"Li, Junshan","last_name":"Li"},{"full_name":"Horta, Sharona","first_name":"Sharona","id":"03a7e858-01b1-11ec-8b71-99ae6c4a05bc","last_name":"Horta"},{"first_name":"Maria","full_name":"Ibáñez, Maria","last_name":"Ibáñez","orcid":"0000-0001-5013-2843","id":"43C61214-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Keller","first_name":"Caroline","full_name":"Keller, Caroline"},{"full_name":"Chenevier, Pascale","first_name":"Pascale","last_name":"Chenevier"},{"last_name":"Oloomi-Buygi","first_name":"Majid","full_name":"Oloomi-Buygi, Majid"},{"full_name":"Cabot, Andreu","first_name":"Andreu","last_name":"Cabot"}],"pmid":1,"isi":1,"status":"public","publication_status":"published","quality_controlled":"1","oa_version":"None","volume":15,"title":"Nanostructured Li₂S cathodes for silicon-sulfur batteries","language":[{"iso":"eng"}],"page":"58462–58475","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345"},{"author":[{"orcid":"0000-0003-1971-8314","last_name":"Olusanya","id":"41AD96DC-F248-11E8-B48F-1D18A9856A87","first_name":"Oluwafunmilola O","full_name":"Olusanya, Oluwafunmilola O"},{"id":"4E6DC800-AE37-11E9-AC72-31CAE5697425","last_name":"Khudiakova","orcid":"0000-0002-6246-1465","full_name":"Khudiakova, Kseniia","first_name":"Kseniia"},{"first_name":"Himani","full_name":"Sachdeva, Himani","last_name":"Sachdeva","id":"42377A0A-F248-11E8-B48F-1D18A9856A87"}],"date_updated":"2026-04-07T12:54:28Z","related_material":{"record":[{"id":"21322","status":"public","relation":"later_version"},{"status":"public","relation":"dissertation_contains","id":"14711"}]},"abstract":[{"lang":"eng","text":"Fragmented landscapes pose a significant threat to the persistence of species as they are highly susceptible to heightened risk of extinction due to the combined effects of genetic and demographic factors such as genetic drift and demographic stochasticity. This paper explores the intricate interplay between genetic load and extinction risk within metapopulations with a focus on understanding the impact of eco-evolutionary feedback mechanisms. We distinguish between two models of selection: soft selection, characterised by subpopulations maintaining carrying capacity despite load, and hard selection, where load can significantly affect population size. Within the soft selection framework, we investigate the impact of gene flow on genetic load at a single locus, while also considering the effect of selection strength and dominance coefficient. We subsequently build on this to examine how gene flow influences both population size and load under hard selection as well as identify critical thresholds for metapopulation persistence. Our analysis employs the diffusion, semi-deterministic and effective migration approximations. Our findings reveal that under soft selection, even modest levels of migration can significantly alleviate the burden of load. In sharp contrast, with hard selection, a much higher degree of gene flow is required to mitigate load and prevent the collapse of the metapopulation. Overall, this study sheds light into the crucial role migration plays in shaping the dynamics of genetic load and extinction risk in fragmented landscapes, offering valuable insights for conservation strategies and the preservation of diversity in a changing world."}],"article_processing_charge":"No","OA_place":"repository","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","image":"/images/cc_by_nc_nd.png"},"main_file_link":[{"open_access":"1","url":"https://www.biorxiv.org/content/10.1101/2023.12.02.569702v1"}],"citation":{"mla":"Olusanya, Oluwafunmilola O., et al. “Genetic Load, Eco-Evolutionary Feedback and Extinction in a Metapopulation.” <i>BioRxiv</i>, doi:<a href=\"https://doi.org/10.1101/2023.12.02.569702\">10.1101/2023.12.02.569702</a>.","ista":"Olusanya OO, Khudiakova K, Sachdeva H. Genetic load, eco-evolutionary feedback and extinction in a metapopulation. bioRxiv, <a href=\"https://doi.org/10.1101/2023.12.02.569702\">10.1101/2023.12.02.569702</a>.","ieee":"O. O. Olusanya, K. Khudiakova, and H. Sachdeva, “Genetic load, eco-evolutionary feedback and extinction in a metapopulation,” <i>bioRxiv</i>. .","chicago":"Olusanya, Oluwafunmilola O, Kseniia Khudiakova, and Himani Sachdeva. “Genetic Load, Eco-Evolutionary Feedback and Extinction in a Metapopulation.” <i>BioRxiv</i>, n.d. <a href=\"https://doi.org/10.1101/2023.12.02.569702\">https://doi.org/10.1101/2023.12.02.569702</a>.","short":"O.O. Olusanya, K. Khudiakova, H. Sachdeva, BioRxiv (n.d.).","ama":"Olusanya OO, Khudiakova K, Sachdeva H. Genetic load, eco-evolutionary feedback and extinction in a metapopulation. <i>bioRxiv</i>. doi:<a href=\"https://doi.org/10.1101/2023.12.02.569702\">10.1101/2023.12.02.569702</a>","apa":"Olusanya, O. O., Khudiakova, K., &#38; Sachdeva, H. (n.d.). Genetic load, eco-evolutionary feedback and extinction in a metapopulation. <i>bioRxiv</i>. <a href=\"https://doi.org/10.1101/2023.12.02.569702\">https://doi.org/10.1101/2023.12.02.569702</a>"},"_id":"14732","status":"public","date_created":"2024-01-04T09:35:54Z","oa":1,"doi":"10.1101/2023.12.02.569702","project":[{"_id":"c08d3278-5a5b-11eb-8a69-fdb09b55f4b8","name":"Causes and consequences of population fragmentation","grant_number":"P32896"},{"grant_number":"26293","name":"The impact of deleterious mutations on small populations","_id":"34d33d68-11ca-11ed-8bc3-ec13763c0ca8"},{"name":"Polygenic Adaptation in a Metapopulation","_id":"34c872fe-11ca-11ed-8bc3-8534b82131e6","grant_number":"26380"}],"date_published":"2023-12-04T00:00:00Z","publication":"bioRxiv","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","day":"04","publication_status":"draft","title":"Genetic load, eco-evolutionary feedback and extinction in a metapopulation","corr_author":"1","type":"preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"oa_version":"Preprint","month":"12","department":[{"_id":"NiBa"},{"_id":"JaMa"}],"year":"2023"},{"author":[{"full_name":"Stefo, Christos","first_name":"Christos","id":"a20e8902-32b0-11ee-9fa8-b23fa638b793","last_name":"Stefo"},{"last_name":"Xiang","full_name":"Xiang, Zhuolun","first_name":"Zhuolun"},{"id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30","last_name":"Kokoris Kogias","full_name":"Kokoris Kogias, Eleftherios","first_name":"Eleftherios"}],"intvolume":"     13950","status":"public","isi":1,"oa":1,"quality_controlled":"1","publication_status":"published","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","language":[{"iso":"eng"}],"page":"3-20","title":"Executing and proving over dirty ledgers","corr_author":"1","volume":13950,"oa_version":"Preprint","scopus_import":"1","conference":{"start_date":"2023-05-01","location":"Bol, Brac, Croatia","end_date":"2023-05-05","name":"FC: Financial Cryptography and Data Security"},"date_updated":"2025-09-09T14:07:16Z","abstract":[{"text":"Scaling blockchain protocols to perform on par with the expected needs of Web3.0 has been proven to be a challenging task with almost a decade of research. In the forefront of the current solution is the idea of separating the execution of the updates encoded in a block from the ordering of blocks. In order to achieve this, a new class of protocols called rollups has emerged. Rollups have as input a total ordering of valid and invalid transactions and as output a new valid state-transition.\r\nIf we study rollups from a distributed computing perspective, we uncover that rollups take as input the output of a Byzantine Atomic Broadcast (BAB) protocol and convert it to a State Machine Replication (SMR) protocol. BAB and SMR, however, are considered equivalent as far as distributed computing is concerned and a solution to one can easily be retrofitted to solve the other simply by adding/removing an execution step before the validation of the input.\r\nThis “easy” step of retrofitting an atomic broadcast solution to implement an SMR has, however, been overlooked in practice. In this paper, we formalize the problem and show that after BAB is solved, traditional impossibility results for consensus no longer apply towards an SMR. Leveraging this we propose a distributed execution protocol that allows reduced execution and storage cost per executor (O(log2n/n)) without relaxing the network assumptions of the underlying BAB protocol and providing censorship-resistance. Finally, we propose efficient non-interactive light client constructions that leverage our efficient execution protocols and do not require any synchrony assumptions or expensive ZK-proofs.","lang":"eng"}],"citation":{"mla":"Stefo, Christos, et al. “Executing and Proving over Dirty Ledgers.” <i>27th International Conference on Financial Cryptography and Data Security</i>, vol. 13950, Springer Nature, 2023, pp. 3–20, doi:<a href=\"https://doi.org/10.1007/978-3-031-47754-6_1\">10.1007/978-3-031-47754-6_1</a>.","ista":"Stefo C, Xiang Z, Kokoris Kogias E. 2023. Executing and proving over dirty ledgers. 27th International Conference on Financial Cryptography and Data Security. FC: Financial Cryptography and Data Security, LNCS, vol. 13950, 3–20.","chicago":"Stefo, Christos, Zhuolun Xiang, and Eleftherios Kokoris Kogias. “Executing and Proving over Dirty Ledgers.” In <i>27th International Conference on Financial Cryptography and Data Security</i>, 13950:3–20. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/978-3-031-47754-6_1\">https://doi.org/10.1007/978-3-031-47754-6_1</a>.","ama":"Stefo C, Xiang Z, Kokoris Kogias E. Executing and proving over dirty ledgers. In: <i>27th International Conference on Financial Cryptography and Data Security</i>. Vol 13950. Springer Nature; 2023:3-20. doi:<a href=\"https://doi.org/10.1007/978-3-031-47754-6_1\">10.1007/978-3-031-47754-6_1</a>","ieee":"C. Stefo, Z. Xiang, and E. Kokoris Kogias, “Executing and proving over dirty ledgers,” in <i>27th International Conference on Financial Cryptography and Data Security</i>, Bol, Brac, Croatia, 2023, vol. 13950, pp. 3–20.","short":"C. Stefo, Z. Xiang, E. Kokoris Kogias, in:, 27th International Conference on Financial Cryptography and Data Security, Springer Nature, 2023, pp. 3–20.","apa":"Stefo, C., Xiang, Z., &#38; Kokoris Kogias, E. (2023). Executing and proving over dirty ledgers. In <i>27th International Conference on Financial Cryptography and Data Security</i> (Vol. 13950, pp. 3–20). Bol, Brac, Croatia: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-47754-6_1\">https://doi.org/10.1007/978-3-031-47754-6_1</a>"},"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2022/1554"}],"_id":"14735","article_processing_charge":"No","doi":"10.1007/978-3-031-47754-6_1","external_id":{"isi":["001150222600001"]},"date_created":"2024-01-08T09:17:38Z","acknowledgement":"Eleftherios Kokoris-Kogias is partially supported by Austrian Science Fund (FWF) grant No: F8512-N.","publisher":"Springer Nature","alternative_title":["LNCS"],"publication":"27th International Conference on Financial Cryptography and Data Security","project":[{"grant_number":"F8512","name":"Security and Privacy by Design for Complex Systems","_id":"34a4ce89-11ca-11ed-8bc3-8cc37fb6e11f"}],"date_published":"2023-12-01T00:00:00Z","day":"01","type":"conference","publication_identifier":{"eissn":["0302-9743"],"eisbn":["9783031477546"],"issn":["1611-3349"],"isbn":["9783031477539"]},"month":"12","department":[{"_id":"ElKo"},{"_id":"GradSch"}],"year":"2023"},{"abstract":[{"text":"Payment channel networks (PCNs) are a promising technology to improve the scalability of cryptocurrencies. PCNs, however, face the challenge that the frequent usage of certain routes may deplete channels in one direction, and hence prevent further transactions. In order to reap the full potential of PCNs, recharging and rebalancing mechanisms are required to provision channels, as well as an admission control logic to decide which transactions to reject in case capacity is insufficient. This paper presents a formal model of this optimisation problem. In particular, we consider an online algorithms perspective, where transactions arrive over time in an unpredictable manner. Our main contributions are competitive online algorithms which come with provable guarantees over time. We empirically evaluate our algorithms on randomly generated transactions to compare the average performance of our algorithms to our theoretical bounds. We also show how this model and approach differs from related problems in classic communication networks.","lang":"eng"}],"conference":{"start_date":"2023-05-01","location":"Bol, Brac, Croatia","end_date":"2023-05-05","name":"FC: Financial Cryptography and Data Security"},"date_updated":"2025-11-05T07:37:31Z","scopus_import":"1","date_created":"2024-01-08T09:30:22Z","external_id":{"isi":["001150222600018"]},"ec_funded":1,"acknowledgement":"Supported by the German Federal Ministry of Education and Research (BMBF), grant 16KISK020K (6G-RIC), 2021–2025, and ERC CoG 863818 (ForM-SMArt).","doi":"10.1007/978-3-031-47754-6_18","article_processing_charge":"No","citation":{"ieee":"M. Bastankhah, K. Chatterjee, M. A. Maddah-Ali, S. Schmid, J. Svoboda, and M. X. Yeo, “R2: Boosting liquidity in payment channel networks with online admission control,” in <i>27th International Conference on Financial Cryptography and Data Security</i>, Bol, Brac, Croatia, 2023, vol. 13950, pp. 309–325.","chicago":"Bastankhah, Mahsa, Krishnendu Chatterjee, Mohammad Ali Maddah-Ali, Stefan Schmid, Jakub Svoboda, and Michelle X Yeo. “R2: Boosting Liquidity in Payment Channel Networks with Online Admission Control.” In <i>27th International Conference on Financial Cryptography and Data Security</i>, 13950:309–25. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/978-3-031-47754-6_18\">https://doi.org/10.1007/978-3-031-47754-6_18</a>.","ama":"Bastankhah M, Chatterjee K, Maddah-Ali MA, Schmid S, Svoboda J, Yeo MX. R2: Boosting liquidity in payment channel networks with online admission control. In: <i>27th International Conference on Financial Cryptography and Data Security</i>. Vol 13950. Springer Nature; 2023:309-325. doi:<a href=\"https://doi.org/10.1007/978-3-031-47754-6_18\">10.1007/978-3-031-47754-6_18</a>","short":"M. Bastankhah, K. Chatterjee, M.A. Maddah-Ali, S. Schmid, J. Svoboda, M.X. Yeo, in:, 27th International Conference on Financial Cryptography and Data Security, Springer Nature, 2023, pp. 309–325.","ista":"Bastankhah M, Chatterjee K, Maddah-Ali MA, Schmid S, Svoboda J, Yeo MX. 2023. R2: Boosting liquidity in payment channel networks with online admission control. 27th International Conference on Financial Cryptography and Data Security. FC: Financial Cryptography and Data Security, LNCS, vol. 13950, 309–325.","mla":"Bastankhah, Mahsa, et al. “R2: Boosting Liquidity in Payment Channel Networks with Online Admission Control.” <i>27th International Conference on Financial Cryptography and Data Security</i>, vol. 13950, Springer Nature, 2023, pp. 309–25, doi:<a href=\"https://doi.org/10.1007/978-3-031-47754-6_18\">10.1007/978-3-031-47754-6_18</a>.","apa":"Bastankhah, M., Chatterjee, K., Maddah-Ali, M. A., Schmid, S., Svoboda, J., &#38; Yeo, M. X. (2023). R2: Boosting liquidity in payment channel networks with online admission control. In <i>27th International Conference on Financial Cryptography and Data Security</i> (Vol. 13950, pp. 309–325). Bol, Brac, Croatia: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-47754-6_18\">https://doi.org/10.1007/978-3-031-47754-6_18</a>"},"main_file_link":[{"open_access":"1","url":"https://openreview.net/forum?id=Dg0qdd9uha"}],"_id":"14736","day":"01","project":[{"grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020"}],"date_published":"2023-12-01T00:00:00Z","publisher":"Springer Nature","alternative_title":["LNCS"],"publication":"27th International Conference on Financial Cryptography and Data Security","department":[{"_id":"KrCh"},{"_id":"KrPi"}],"month":"12","year":"2023","type":"conference","OA_type":"green","publication_identifier":{"issn":["0302-9743"],"isbn":["9783031477539"],"eissn":["1611-3349"],"eisbn":["9783031477546"]},"intvolume":"     13950","author":[{"last_name":"Bastankhah","full_name":"Bastankhah, Mahsa","first_name":"Mahsa"},{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"last_name":"Maddah-Ali","full_name":"Maddah-Ali, Mohammad Ali","first_name":"Mohammad Ali"},{"full_name":"Schmid, Stefan","first_name":"Stefan","last_name":"Schmid"},{"first_name":"Jakub","full_name":"Svoboda, Jakub","orcid":"0000-0002-1419-3267","last_name":"Svoboda","id":"130759D2-D7DD-11E9-87D2-DE0DE6697425"},{"first_name":"Michelle X","full_name":"Yeo, Michelle X","last_name":"Yeo","orcid":"0009-0001-3676-4809","id":"2D82B818-F248-11E8-B48F-1D18A9856A87"}],"oa":1,"isi":1,"OA_place":"repository","status":"public","publication_status":"published","quality_controlled":"1","oa_version":"Submitted Version","volume":13950,"title":"R2: Boosting liquidity in payment channel networks with online admission control","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"page":"309-325"},{"issue":"23","intvolume":"      2023","has_accepted_license":"1","author":[{"full_name":"Ivanov, Grigory","first_name":"Grigory","id":"87744F66-5C6F-11EA-AFE0-D16B3DDC885E","last_name":"Ivanov"},{"full_name":"Naszódi, Márton","first_name":"Márton","last_name":"Naszódi"}],"oa":1,"ddc":["510"],"status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","image":"/images/cc_by_nc_nd.png"},"isi":1,"publication_status":"published","file_date_updated":"2024-01-08T09:53:09Z","quality_controlled":"1","volume":2023,"oa_version":"Published Version","page":"20613-20669","language":[{"iso":"eng"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","keyword":["General Mathematics"],"arxiv":1,"title":"Functional John and Löwner conditions for pairs of log-concave functions","corr_author":"1","abstract":[{"lang":"eng","text":"John’s fundamental theorem characterizing the largest volume ellipsoid contained in a convex body $K$ in $\\mathbb{R}^{d}$ has seen several generalizations and extensions. One direction, initiated by V. Milman is to replace ellipsoids by positions (affine images) of another body $L$. Another, more recent direction is to consider logarithmically concave functions on $\\mathbb{R}^{d}$ instead of convex bodies: we designate some special, radially symmetric log-concave function $g$ as the analogue of the Euclidean ball, and want to find its largest integral position under the constraint that it is pointwise below some given log-concave function $f$. We follow both directions simultaneously: we consider the functional question, and allow essentially any meaningful function to play the role of $g$ above. Our general theorems jointly extend known results in both directions. The dual problem in the setting of convex bodies asks for the smallest volume ellipsoid, called Löwner’s ellipsoid, containing $K$. We consider the analogous problem for functions: we characterize the solutions of the optimization problem of finding a smallest integral position of some log-concave function $g$ under the constraint that it is pointwise above $f$. It turns out that in the functional setting, the relationship between the John and the Löwner problems is more intricate than it is in the setting of convex bodies."}],"scopus_import":"1","date_updated":"2025-09-09T14:08:25Z","doi":"10.1093/imrn/rnad210","article_type":"original","acknowledgement":"We thank Alexander Litvak for the many discussions on Theorem 1.1. Igor Tsiutsiurupa participated in the early stage of this project. To our deep regret, Igor chose another road for his life and stopped working with us.\r\nThis work was supported by the János Bolyai Scholarship of the Hungarian Academy of Sciences [to M.N.]; the National Research, Development, and Innovation Fund (NRDI) [K119670 and K131529 to M.N.]; and the ÚNKP-22-5 New National Excellence Program of the Ministry for Innovation and Technology from the source of the NRDI [to M.N.].","external_id":{"isi":["001184146800001"],"arxiv":["2212.11781"]},"date_created":"2024-01-08T09:48:56Z","_id":"14737","citation":{"chicago":"Ivanov, Grigory, and Márton Naszódi. “Functional John and Löwner Conditions for Pairs of Log-Concave Functions.” <i>International Mathematics Research Notices</i>. Oxford University Press, 2023. <a href=\"https://doi.org/10.1093/imrn/rnad210\">https://doi.org/10.1093/imrn/rnad210</a>.","ama":"Ivanov G, Naszódi M. Functional John and Löwner conditions for pairs of log-concave functions. <i>International Mathematics Research Notices</i>. 2023;2023(23):20613-20669. doi:<a href=\"https://doi.org/10.1093/imrn/rnad210\">10.1093/imrn/rnad210</a>","ieee":"G. Ivanov and M. Naszódi, “Functional John and Löwner conditions for pairs of log-concave functions,” <i>International Mathematics Research Notices</i>, vol. 2023, no. 23. Oxford University Press, pp. 20613–20669, 2023.","short":"G. Ivanov, M. Naszódi, International Mathematics Research Notices 2023 (2023) 20613–20669.","ista":"Ivanov G, Naszódi M. 2023. Functional John and Löwner conditions for pairs of log-concave functions. International Mathematics Research Notices. 2023(23), 20613–20669.","mla":"Ivanov, Grigory, and Márton Naszódi. “Functional John and Löwner Conditions for Pairs of Log-Concave Functions.” <i>International Mathematics Research Notices</i>, vol. 2023, no. 23, Oxford University Press, 2023, pp. 20613–69, doi:<a href=\"https://doi.org/10.1093/imrn/rnad210\">10.1093/imrn/rnad210</a>.","apa":"Ivanov, G., &#38; Naszódi, M. (2023). Functional John and Löwner conditions for pairs of log-concave functions. <i>International Mathematics Research Notices</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/imrn/rnad210\">https://doi.org/10.1093/imrn/rnad210</a>"},"article_processing_charge":"Yes (via OA deal)","day":"01","publication":"International Mathematics Research Notices","file":[{"success":1,"checksum":"353666cea80633beb0f1ffd342dff6d4","access_level":"open_access","file_id":"14738","date_created":"2024-01-08T09:53:09Z","content_type":"application/pdf","file_size":815777,"date_updated":"2024-01-08T09:53:09Z","creator":"dernst","relation":"main_file","file_name":"2023_IMRN_Ivanov.pdf"}],"publisher":"Oxford University Press","date_published":"2023-12-01T00:00:00Z","year":"2023","department":[{"_id":"UlWa"}],"month":"12","publication_identifier":{"issn":["1073-7928"],"eissn":["1687-0247"]},"type":"journal_article"},{"author":[{"full_name":"Ali, Dashti","first_name":"Dashti","last_name":"Ali"},{"first_name":"Aras","full_name":"Asaad, Aras","last_name":"Asaad"},{"full_name":"Jimenez, Maria-Jose","first_name":"Maria-Jose","last_name":"Jimenez"},{"last_name":"Nanda","first_name":"Vidit","full_name":"Nanda, Vidit"},{"full_name":"Paluzo-Hidalgo, Eduardo","first_name":"Eduardo","last_name":"Paluzo-Hidalgo"},{"id":"15ebd7cf-15bf-11ee-aebd-bb4bb5121ea8","orcid":"0000-0003-2449-1433","last_name":"Soriano Trigueros","full_name":"Soriano Trigueros, Manuel","first_name":"Manuel"}],"has_accepted_license":"1","intvolume":"        45","issue":"12","isi":1,"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"status":"public","ddc":["000"],"oa":1,"quality_controlled":"1","file_date_updated":"2024-01-08T10:09:14Z","publication_status":"published","title":"A survey of vectorization methods in topological data analysis","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","keyword":["Applied Mathematics","Artificial Intelligence","Computational Theory and Mathematics","Computer Vision and Pattern Recognition","Software"],"page":"14069-14080","language":[{"iso":"eng"}],"oa_version":"Published Version","volume":45,"date_updated":"2025-09-09T14:08:56Z","scopus_import":"1","abstract":[{"lang":"eng","text":"Attempts to incorporate topological information in supervised learning tasks have resulted in the creation of several techniques for vectorizing persistent homology barcodes. In this paper, we study thirteen such methods. Besides describing an organizational framework for these methods, we comprehensively benchmark them against three well-known classification tasks. Surprisingly, we discover that the best-performing method is a simple vectorization, which consists only of a few elementary summary statistics. Finally, we provide a convenient web application which has been designed to facilitate exploration and experimentation with various vectorization methods."}],"article_processing_charge":"Yes (in subscription journal)","citation":{"mla":"Ali, Dashti, et al. “A Survey of Vectorization Methods in Topological Data Analysis.” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>, vol. 45, no. 12, IEEE, 2023, pp. 14069–80, doi:<a href=\"https://doi.org/10.1109/tpami.2023.3308391\">10.1109/tpami.2023.3308391</a>.","ista":"Ali D, Asaad A, Jimenez M-J, Nanda V, Paluzo-Hidalgo E, Soriano Trigueros M. 2023. A survey of vectorization methods in topological data analysis. IEEE Transactions on Pattern Analysis and Machine Intelligence. 45(12), 14069–14080.","ama":"Ali D, Asaad A, Jimenez M-J, Nanda V, Paluzo-Hidalgo E, Soriano Trigueros M. A survey of vectorization methods in topological data analysis. <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. 2023;45(12):14069-14080. doi:<a href=\"https://doi.org/10.1109/tpami.2023.3308391\">10.1109/tpami.2023.3308391</a>","chicago":"Ali, Dashti, Aras Asaad, Maria-Jose Jimenez, Vidit Nanda, Eduardo Paluzo-Hidalgo, and Manuel Soriano Trigueros. “A Survey of Vectorization Methods in Topological Data Analysis.” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. IEEE, 2023. <a href=\"https://doi.org/10.1109/tpami.2023.3308391\">https://doi.org/10.1109/tpami.2023.3308391</a>.","short":"D. Ali, A. Asaad, M.-J. Jimenez, V. Nanda, E. Paluzo-Hidalgo, M. Soriano Trigueros, IEEE Transactions on Pattern Analysis and Machine Intelligence 45 (2023) 14069–14080.","ieee":"D. Ali, A. Asaad, M.-J. Jimenez, V. Nanda, E. Paluzo-Hidalgo, and M. Soriano Trigueros, “A survey of vectorization methods in topological data analysis,” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>, vol. 45, no. 12. IEEE, pp. 14069–14080, 2023.","apa":"Ali, D., Asaad, A., Jimenez, M.-J., Nanda, V., Paluzo-Hidalgo, E., &#38; Soriano Trigueros, M. (2023). A survey of vectorization methods in topological data analysis. <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. IEEE. <a href=\"https://doi.org/10.1109/tpami.2023.3308391\">https://doi.org/10.1109/tpami.2023.3308391</a>"},"_id":"14739","acknowledgement":"The work of Maria-Jose Jimenez, Eduardo Paluzo-Hidalgo and Manuel Soriano-Trigueros was supported in part by the Spanish grant Ministerio de Ciencia e Innovacion under Grants TED2021-129438B-I00 and PID2019-107339GB-I00, and in part by REXASI-PRO H-EU project, call HORIZON-CL4-2021-HUMAN-01-01 under Grant 101070028. The work of\r\nMaria-Jose Jimenez was supported by a grant of Convocatoria de la Universidad de Sevilla para la recualificacion del sistema universitario español, 2021-23, funded by the European Union, NextGenerationEU. The work of Vidit Nanda was supported in part by EPSRC under Grant EP/R018472/1 and in part by US AFOSR under Grant FA9550-22-1-0462. \r\nWe are grateful to the team of GUDHI and TEASPOON developers, for their work and their support. We are also grateful to Streamlit for providing extra resources to deploy the web app\r\nonline on Streamlit community cloud. We thank the anonymous referees for their helpful suggestions.","date_created":"2024-01-08T09:59:46Z","external_id":{"isi":["001104973300002"]},"article_type":"original","doi":"10.1109/tpami.2023.3308391","date_published":"2023-12-01T00:00:00Z","publisher":"IEEE","file":[{"content_type":"application/pdf","file_id":"14740","date_created":"2024-01-08T10:09:14Z","checksum":"465c28ef0b151b4b1fb47977ed5581ab","access_level":"open_access","success":1,"file_name":"2023_IEEEToP_Ali.pdf","relation":"main_file","creator":"dernst","date_updated":"2024-01-08T10:09:14Z","file_size":2370988}],"publication":"IEEE Transactions on Pattern Analysis and Machine Intelligence","day":"01","type":"journal_article","publication_identifier":{"eissn":["1939-3539"],"issn":["0162-8828"]},"department":[{"_id":"HeEd"}],"month":"12","year":"2023"},{"_id":"14742","citation":{"apa":"Lucek, K., Giménez, M. D., Joron, M., Rafajlović, M., Searle, J. B., Walden, N., … Faria, R. (2023). The impact of chromosomal rearrangements in speciation: From micro- to macroevolution. <i>Cold Spring Harbor Perspectives in Biology</i>. Cold Spring Harbor Laboratory Press. <a href=\"https://doi.org/10.1101/cshperspect.a041447\">https://doi.org/10.1101/cshperspect.a041447</a>","ista":"Lucek K, Giménez MD, Joron M, Rafajlović M, Searle JB, Walden N, Westram AM, Faria R. 2023. The impact of chromosomal rearrangements in speciation: From micro- to macroevolution. Cold Spring Harbor Perspectives in Biology. 15(11), a041447.","mla":"Lucek, Kay, et al. “The Impact of Chromosomal Rearrangements in Speciation: From Micro- to Macroevolution.” <i>Cold Spring Harbor Perspectives in Biology</i>, vol. 15, no. 11, a041447, Cold Spring Harbor Laboratory Press, 2023, doi:<a href=\"https://doi.org/10.1101/cshperspect.a041447\">10.1101/cshperspect.a041447</a>.","ama":"Lucek K, Giménez MD, Joron M, et al. The impact of chromosomal rearrangements in speciation: From micro- to macroevolution. <i>Cold Spring Harbor Perspectives in Biology</i>. 2023;15(11). doi:<a href=\"https://doi.org/10.1101/cshperspect.a041447\">10.1101/cshperspect.a041447</a>","chicago":"Lucek, Kay, Mabel D. Giménez, Mathieu Joron, Marina Rafajlović, Jeremy B. Searle, Nora Walden, Anja M Westram, and Rui Faria. “The Impact of Chromosomal Rearrangements in Speciation: From Micro- to Macroevolution.” <i>Cold Spring Harbor Perspectives in Biology</i>. Cold Spring Harbor Laboratory Press, 2023. <a href=\"https://doi.org/10.1101/cshperspect.a041447\">https://doi.org/10.1101/cshperspect.a041447</a>.","ieee":"K. Lucek <i>et al.</i>, “The impact of chromosomal rearrangements in speciation: From micro- to macroevolution,” <i>Cold Spring Harbor Perspectives in Biology</i>, vol. 15, no. 11. Cold Spring Harbor Laboratory Press, 2023.","short":"K. Lucek, M.D. Giménez, M. Joron, M. Rafajlović, J.B. Searle, N. Walden, A.M. Westram, R. Faria, Cold Spring Harbor Perspectives in Biology 15 (2023)."},"main_file_link":[{"url":"https://doi.org/10.1101/cshperspect.a041447","open_access":"1"}],"article_processing_charge":"No","doi":"10.1101/cshperspect.a041447","article_type":"original","acknowledgement":"K.L. was funded by a Swiss National Science Foundation Eccellenza project: The evolution of strong reproductive barriers towards the completion of speciation (PCEFP3_202869). R.F.\r\nwas funded by an FCT CEEC (Fundação para a Ciênca e a Tecnologia, Concurso Estímulo ao\r\nEmprego Científico) contract (2020.00275. CEECIND) and by an FCT research project\r\n(PTDC/BIA-EVL/1614/2021). M.R. was funded by the Swedish Research Council Vetenskapsrådet (grant number 2021-05243). A.M.W. was partly funded by the Norwegian Research Council RCN. We thank Luis Silva for his help preparing Figure 1. We are grateful to Maren Wellenreuther, Daniel Bolnick, and two anonymous reviewers for their constructive feedback on an earlier version of this paper.","external_id":{"pmid":["37604585"],"isi":["001096272600001"]},"date_created":"2024-01-08T12:43:48Z","scopus_import":"1","date_updated":"2026-06-18T17:37:44Z","abstract":[{"text":"Chromosomal rearrangements (CRs) have been known since almost the beginning of genetics.\r\nWhile an important role for CRs in speciation has been suggested, evidence primarily stems\r\nfrom theoretical and empirical studies focusing on the microevolutionary level (i.e., on taxon\r\npairs where speciation is often incomplete). Although the role of CRs in eukaryotic speciation at\r\na macroevolutionary level has been supported by associations between species diversity and\r\nrates of evolution of CRs across phylogenies, these findings are limited to a restricted range of\r\nCRs and taxa. Now that more broadly applicable and precise CR detection approaches have\r\nbecome available, we address the challenges in filling some of the conceptual and empirical\r\ngaps between micro- and macroevolutionary studies on the role of CRs in speciation. We\r\nsynthesize what is known about the macroevolutionary impact of CRs and suggest new research avenues to overcome the pitfalls of previous studies to gain a more comprehensive understanding of the evolutionary significance of CRs in speciation across the tree of life.","lang":"eng"}],"publication_identifier":{"issn":["1943-0264"]},"type":"journal_article","year":"2023","department":[{"_id":"NiBa"},{"_id":"BeVi"}],"month":"11","publication":"Cold Spring Harbor Perspectives in Biology","publisher":"Cold Spring Harbor Laboratory Press","article_number":"a041447","date_published":"2023-11-01T00:00:00Z","day":"01","status":"public","ddc":["570"],"isi":1,"pmid":1,"oa":1,"author":[{"last_name":"Lucek","first_name":"Kay","full_name":"Lucek, Kay"},{"last_name":"Giménez","first_name":"Mabel D.","full_name":"Giménez, Mabel D."},{"last_name":"Joron","first_name":"Mathieu","full_name":"Joron, Mathieu"},{"first_name":"Marina","full_name":"Rafajlović, Marina","last_name":"Rafajlović"},{"last_name":"Searle","full_name":"Searle, Jeremy B.","first_name":"Jeremy B."},{"last_name":"Walden","full_name":"Walden, Nora","first_name":"Nora"},{"id":"3C147470-F248-11E8-B48F-1D18A9856A87","last_name":"Westram","orcid":"0000-0003-1050-4969","full_name":"Westram, Anja M","first_name":"Anja M"},{"full_name":"Faria, Rui","first_name":"Rui","last_name":"Faria"}],"intvolume":"        15","issue":"11","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","keyword":["General Biochemistry","Genetics and Molecular Biology"],"title":"The impact of chromosomal rearrangements in speciation: From micro- to macroevolution","volume":15,"oa_version":"Published Version","quality_controlled":"1","publication_status":"published"},{"scopus_import":"1","conference":{"end_date":"2023-10-26","name":"SOSP: Symposium on Operating Systems Principles","start_date":"2023-10-23","location":"Koblenz, Germany"},"date_updated":"2026-06-18T17:38:12Z","abstract":[{"lang":"eng","text":"Leader-based consensus algorithms are fast and efficient under normal conditions, but lack robustness to adverse conditions due to their reliance on timeouts for liveness. We present QuePaxa, the first protocol offering state-of-the-art normal-case efficiency without depending on timeouts. QuePaxa uses a novel randomized asynchronous consensus core to tolerate adverse conditions such as denial-of-service (DoS) attacks, while a one-round-trip fast path preserves the normal-case efficiency of Multi-Paxos or Raft. By allowing simultaneous proposers without destructive interference, and using short hedging delays instead of conservative timeouts to limit redundant effort, QuePaxa permits rapid recovery after leader failure without risking costly view changes due to false timeouts. By treating leader choice and hedging delay as a multi-armed-bandit optimization, QuePaxa achieves responsiveness to prevalent conditions, and can choose the best leader even if the current one has not failed. Experiments with a prototype confirm that QuePaxa achieves normal-case LAN and WAN performance of 584k and 250k cmd/sec in throughput, respectively, comparable to Multi-Paxos. Under conditions such as DoS attacks, misconfigurations, or slow leaders that severely impact existing protocols, we find that QuePaxa remains live with median latency under 380ms in WAN experiments."}],"citation":{"apa":"Tennage, P., Basescu, C., Kokoris Kogias, E., Syta, E., Jovanovic, P., Estrada-Galinanes, V., &#38; Ford, B. (2023). QuePaxa: Escaping the tyranny of timeouts in consensus. In <i>Proceedings of the 29th Symposium on Operating Systems Principles</i> (pp. 281–297). Koblenz, Germany: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3600006.3613150\">https://doi.org/10.1145/3600006.3613150</a>","chicago":"Tennage, Pasindu, Cristina Basescu, Eleftherios Kokoris Kogias, Ewa Syta, Philipp Jovanovic, Vero Estrada-Galinanes, and Bryan Ford. “QuePaxa: Escaping the Tyranny of Timeouts in Consensus.” In <i>Proceedings of the 29th Symposium on Operating Systems Principles</i>, 281–97. Association for Computing Machinery, 2023. <a href=\"https://doi.org/10.1145/3600006.3613150\">https://doi.org/10.1145/3600006.3613150</a>.","ama":"Tennage P, Basescu C, Kokoris Kogias E, et al. QuePaxa: Escaping the tyranny of timeouts in consensus. In: <i>Proceedings of the 29th Symposium on Operating Systems Principles</i>. Association for Computing Machinery; 2023:281-297. doi:<a href=\"https://doi.org/10.1145/3600006.3613150\">10.1145/3600006.3613150</a>","ieee":"P. Tennage <i>et al.</i>, “QuePaxa: Escaping the tyranny of timeouts in consensus,” in <i>Proceedings of the 29th Symposium on Operating Systems Principles</i>, Koblenz, Germany, 2023, pp. 281–297.","short":"P. Tennage, C. Basescu, E. Kokoris Kogias, E. Syta, P. Jovanovic, V. Estrada-Galinanes, B. Ford, in:, Proceedings of the 29th Symposium on Operating Systems Principles, Association for Computing Machinery, 2023, pp. 281–297.","ista":"Tennage P, Basescu C, Kokoris Kogias E, Syta E, Jovanovic P, Estrada-Galinanes V, Ford B. 2023. QuePaxa: Escaping the tyranny of timeouts in consensus. Proceedings of the 29th Symposium on Operating Systems Principles. SOSP: Symposium on Operating Systems Principles, 281–297.","mla":"Tennage, Pasindu, et al. “QuePaxa: Escaping the Tyranny of Timeouts in Consensus.” <i>Proceedings of the 29th Symposium on Operating Systems Principles</i>, Association for Computing Machinery, 2023, pp. 281–97, doi:<a href=\"https://doi.org/10.1145/3600006.3613150\">10.1145/3600006.3613150</a>."},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1145/3600006.3613150"}],"_id":"14743","article_processing_charge":"No","doi":"10.1145/3600006.3613150","acknowledgement":"The authors would like to thank Marcos K. Aguilera, Pierluca Borsò, Aleksey Charapko, Rachid Guerraoui, Jovan Komatovic, Derek Leung, Louis-Henri Merino, Shailesh Mishra, Haochen Pan, Rodrigo Rodrigues, Lewis Tseng, and Haoqian Zhang for their helpful feedback on early drafts of this paper.","external_id":{"isi":["001135072900018"]},"date_created":"2024-01-08T12:54:35Z","publisher":"Association for Computing Machinery","publication":"Proceedings of the 29th Symposium on Operating Systems Principles","date_published":"2023-10-01T00:00:00Z","day":"01","type":"conference","publication_identifier":{"isbn":["9798400702297"]},"department":[{"_id":"ElKo"}],"month":"10","year":"2023","author":[{"last_name":"Tennage","full_name":"Tennage, Pasindu","first_name":"Pasindu"},{"last_name":"Basescu","full_name":"Basescu, Cristina","first_name":"Cristina"},{"orcid":"0000-0002-8827-3382","last_name":"Kokoris Kogias","id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30","first_name":"Eleftherios","full_name":"Kokoris Kogias, Eleftherios"},{"last_name":"Syta","first_name":"Ewa","full_name":"Syta, Ewa"},{"first_name":"Philipp","full_name":"Jovanovic, Philipp","last_name":"Jovanovic"},{"first_name":"Vero","full_name":"Estrada-Galinanes, Vero","last_name":"Estrada-Galinanes"},{"full_name":"Ford, Bryan","first_name":"Bryan","last_name":"Ford"}],"ddc":["000"],"status":"public","isi":1,"oa":1,"quality_controlled":"1","publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"281-297","language":[{"iso":"eng"}],"title":"QuePaxa: Escaping the tyranny of timeouts in consensus","oa_version":"Published Version"},{"_id":"14744","citation":{"ista":"Avarikioti Z, Desjardins A, Kokoris Kogias E, Wattenhofer R. 2023. Divide &#38; Scale: Formalization and roadmap to robust sharding. 30th International Colloquium on Structural Information and Communication Complexity. SIROCCO: Structural Information and Communication Complexity, LNCS, vol. 13892, 199–245.","mla":"Avarikioti, Zeta, et al. “Divide &#38; Scale: Formalization and Roadmap to Robust Sharding.” <i>30th International Colloquium on Structural Information and Communication Complexity</i>, vol. 13892, Springer Nature, 2023, pp. 199–245, doi:<a href=\"https://doi.org/10.1007/978-3-031-32733-9_10\">10.1007/978-3-031-32733-9_10</a>.","ieee":"Z. Avarikioti, A. Desjardins, E. Kokoris Kogias, and R. Wattenhofer, “Divide &#38; Scale: Formalization and roadmap to robust sharding,” in <i>30th International Colloquium on Structural Information and Communication Complexity</i>, Alcalá de Henares, Spain, 2023, vol. 13892, pp. 199–245.","short":"Z. Avarikioti, A. Desjardins, E. Kokoris Kogias, R. Wattenhofer, in:, 30th International Colloquium on Structural Information and Communication Complexity, Springer Nature, 2023, pp. 199–245.","ama":"Avarikioti Z, Desjardins A, Kokoris Kogias E, Wattenhofer R. Divide &#38; Scale: Formalization and roadmap to robust sharding. In: <i>30th International Colloquium on Structural Information and Communication Complexity</i>. Vol 13892. Springer Nature; 2023:199-245. doi:<a href=\"https://doi.org/10.1007/978-3-031-32733-9_10\">10.1007/978-3-031-32733-9_10</a>","chicago":"Avarikioti, Zeta, Antoine Desjardins, Eleftherios Kokoris Kogias, and Roger Wattenhofer. “Divide &#38; Scale: Formalization and Roadmap to Robust Sharding.” In <i>30th International Colloquium on Structural Information and Communication Complexity</i>, 13892:199–245. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/978-3-031-32733-9_10\">https://doi.org/10.1007/978-3-031-32733-9_10</a>.","apa":"Avarikioti, Z., Desjardins, A., Kokoris Kogias, E., &#38; Wattenhofer, R. (2023). Divide &#38; Scale: Formalization and roadmap to robust sharding. In <i>30th International Colloquium on Structural Information and Communication Complexity</i> (Vol. 13892, pp. 199–245). Alcalá de Henares, Spain: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-32733-9_10\">https://doi.org/10.1007/978-3-031-32733-9_10</a>"},"article_processing_charge":"No","doi":"10.1007/978-3-031-32733-9_10","date_created":"2024-01-08T12:56:46Z","acknowledgement":"The work was partially supported by the Austrian Science Fund (FWF) through the project CoRaF (grant agreement 2020388).","external_id":{"isi":["001292782600010"]},"scopus_import":"1","date_updated":"2025-09-09T14:10:46Z","conference":{"name":"SIROCCO: Structural Information and Communication Complexity","end_date":"2023-06-09","location":"Alcalá de Henares, Spain","start_date":"2023-06-06"},"abstract":[{"text":"Sharding distributed ledgers is a promising on-chain solution for scaling blockchains but lacks formal grounds, nurturing skepticism on whether such complex systems can scale blockchains securely. We fill this gap by introducing the first formal framework as well as a roadmap to robust sharding. In particular, we first define the properties sharded distributed ledgers should fulfill. We build upon and extend the Bitcoin backbone protocol by defining consistency and scalability. Consistency encompasses the need for atomic execution of cross-shard transactions to preserve safety, whereas scalability encapsulates the speedup a sharded system can gain in comparison to a non-sharded system.\r\nUsing our model, we explore the limitations of sharding. We show that a sharded ledger with n participants cannot scale under a fully adaptive adversary, but it can scale up to m shards where n=c'm log m, under an epoch-adaptive adversary; the constant c' encompasses the trade-off between security and scalability. This is possible only if the sharded ledgers create succinct proofs of the valid state updates at every epoch. We leverage our results to identify the sufficient components for robust sharding, which we incorporate in a protocol abstraction termed Divide & Scale. To demonstrate the power of our framework, we analyze the most prominent sharded blockchains (Elastico, Monoxide, OmniLedger, RapidChain) and pinpoint where they fail to meet the desired properties.","lang":"eng"}],"publication_identifier":{"eisbn":["9783031327339"],"eissn":["1611-3349"],"isbn":["9783031327322"],"issn":["0302-9743"]},"type":"conference","year":"2023","month":"06","department":[{"_id":"ElKo"}],"publication":"30th International Colloquium on Structural Information and Communication Complexity","publisher":"Springer Nature","alternative_title":["LNCS"],"date_published":"2023-06-01T00:00:00Z","day":"01","status":"public","isi":1,"author":[{"full_name":"Avarikioti, Zeta","first_name":"Zeta","last_name":"Avarikioti"},{"last_name":"Desjardins","id":"06d0c166-aec1-11ee-a7c0-b96e840a602b","first_name":"Antoine","full_name":"Desjardins, Antoine"},{"full_name":"Kokoris Kogias, Eleftherios","first_name":"Eleftherios","id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30","last_name":"Kokoris Kogias"},{"full_name":"Wattenhofer, Roger","first_name":"Roger","last_name":"Wattenhofer"}],"intvolume":"     13892","page":"199-245","language":[{"iso":"eng"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","title":"Divide & Scale: Formalization and roadmap to robust sharding","volume":13892,"oa_version":"None","quality_controlled":"1","publication_status":"published"},{"article_processing_charge":"No","citation":{"apa":"Chen, Y.-L., Ly, M., &#38; Wojtan, C. (2023). Unified treatment of contact, friction and shock-propagation in rigid body animation. In <i>Proceedings of the ACM SIGGRAPH/Eurographics Symposium on Computer Animation</i>. Los Angeles, CA, United States: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3606037.3606836\">https://doi.org/10.1145/3606037.3606836</a>","short":"Y.-L. Chen, M. Ly, C. Wojtan, in:, Proceedings of the ACM SIGGRAPH/Eurographics Symposium on Computer Animation, Association for Computing Machinery, 2023.","ieee":"Y.-L. Chen, M. Ly, and C. Wojtan, “Unified treatment of contact, friction and shock-propagation in rigid body animation,” in <i>Proceedings of the ACM SIGGRAPH/Eurographics Symposium on Computer Animation</i>, Los Angeles, CA, United States, 2023.","ama":"Chen Y-L, Ly M, Wojtan C. Unified treatment of contact, friction and shock-propagation in rigid body animation. In: <i>Proceedings of the ACM SIGGRAPH/Eurographics Symposium on Computer Animation</i>. Association for Computing Machinery; 2023. doi:<a href=\"https://doi.org/10.1145/3606037.3606836\">10.1145/3606037.3606836</a>","chicago":"Chen, Yi-Lu, Mickaël Ly, and Chris Wojtan. “Unified Treatment of Contact, Friction and Shock-Propagation in Rigid Body Animation.” In <i>Proceedings of the ACM SIGGRAPH/Eurographics Symposium on Computer Animation</i>. Association for Computing Machinery, 2023. <a href=\"https://doi.org/10.1145/3606037.3606836\">https://doi.org/10.1145/3606037.3606836</a>.","ista":"Chen Y-L, Ly M, Wojtan C. 2023. Unified treatment of contact, friction and shock-propagation in rigid body animation. Proceedings of the ACM SIGGRAPH/Eurographics Symposium on Computer Animation. SCA: Symposium on Computer Animation, 5.","mla":"Chen, Yi-Lu, et al. “Unified Treatment of Contact, Friction and Shock-Propagation in Rigid Body Animation.” <i>Proceedings of the ACM SIGGRAPH/Eurographics Symposium on Computer Animation</i>, 5, Association for Computing Machinery, 2023, doi:<a href=\"https://doi.org/10.1145/3606037.3606836\">10.1145/3606037.3606836</a>."},"status":"public","_id":"14748","acknowledgement":"We thank the anonymous reviewers and the members of the Visual Computing Group at ISTA for their helpful comments. This research was supported by the Scientific Service Units (SSU) of ISTA through resources provided by Scientific Computing, and was funded in part by the European Union (ERC-2021-COG 101045083 CoDiNA).","date_created":"2024-01-08T13:00:24Z","doi":"10.1145/3606037.3606836","author":[{"last_name":"Chen","id":"0b467602-dbcd-11ea-9d1d-ed480aa46b70","first_name":"Yi-Lu","full_name":"Chen, Yi-Lu"},{"id":"6340d7f0-b48d-11eb-b10d-b7487e71d9f1","last_name":"Ly","full_name":"Ly, Mickaël","first_name":"Mickaël"},{"first_name":"Christopher J","full_name":"Wojtan, Christopher J","orcid":"0000-0001-6646-5546","last_name":"Wojtan","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87"}],"conference":{"end_date":"2023-08-06","name":"SCA: Symposium on Computer Animation","start_date":"2023-08-04","location":"Los Angeles, CA, United States"},"date_updated":"2025-04-14T12:58:27Z","related_material":{"record":[{"relation":"other","status":"public","id":"15292"}]},"corr_author":"1","title":"Unified treatment of contact, friction and shock-propagation in rigid body animation","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference_abstract","acknowledged_ssus":[{"_id":"ScienComp"}],"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9798400702686"]},"oa_version":"None","month":"08","department":[{"_id":"ChWo"}],"year":"2023","quality_controlled":"1","project":[{"grant_number":"101045083","_id":"34bc2376-11ca-11ed-8bc3-9a3b3961a088","name":"Computational Discovery of Numerical Algorithms for Animation and Simulation of Natural Phenomena"}],"date_published":"2023-08-01T00:00:00Z","article_number":"5","publisher":"Association for Computing Machinery","publication":"Proceedings of the ACM SIGGRAPH/Eurographics Symposium on Computer Animation","day":"01","publication_status":"published"},{"publication_status":"published","quality_controlled":"1","oa_version":"Preprint","volume":33,"corr_author":"1","title":"Local laws for multiplication of random matrices","arxiv":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","keyword":["Statistics","Probability and Uncertainty","Statistics and Probability"],"language":[{"iso":"eng"}],"page":"2981-3009","intvolume":"        33","issue":"4","author":[{"full_name":"Ding, Xiucai","first_name":"Xiucai","last_name":"Ding"},{"last_name":"Ji","id":"dd216c0a-c1f9-11eb-beaf-e9ea9d2de76d","first_name":"Hong Chang","full_name":"Ji, Hong Chang"}],"oa":1,"isi":1,"status":"public","day":"01","date_published":"2023-08-01T00:00:00Z","project":[{"grant_number":"101020331","_id":"62796744-2b32-11ec-9570-940b20777f1d","call_identifier":"H2020","name":"Random matrices beyond Wigner-Dyson-Mehta"}],"publisher":"Institute of Mathematical Statistics","publication":"The Annals of Applied Probability","department":[{"_id":"LaEr"}],"month":"08","year":"2023","type":"journal_article","publication_identifier":{"issn":["1050-5164"]},"abstract":[{"text":"Consider the random matrix model A1/2UBU∗A1/2, where A and B are two N × N deterministic matrices and U is either an N × N Haar unitary or orthogonal random matrix. It is well known that on the macroscopic scale (Invent. Math. 104 (1991) 201–220), the limiting empirical spectral distribution (ESD) of the above model is given by the free multiplicative convolution\r\nof the limiting ESDs of A and B, denoted as μα \u0002 μβ, where μα and μβ are the limiting ESDs of A and B, respectively. In this paper, we study the asymptotic microscopic behavior of the edge eigenvalues and eigenvectors statistics. We prove that both the density of μA \u0002μB, where μA and μB are the ESDs of A and B, respectively and the associated subordination functions\r\nhave a regular behavior near the edges. Moreover, we establish the local laws near the edges on the optimal scale. In particular, we prove that the entries of the resolvent are close to some functionals depending only on the eigenvalues of A, B and the subordination functions with optimal convergence rates. Our proofs and calculations are based on the techniques developed for the additive model A+UBU∗ in (J. Funct. Anal. 271 (2016) 672–719; Comm. Math.\r\nPhys. 349 (2017) 947–990; Adv. Math. 319 (2017) 251–291; J. Funct. Anal. 279 (2020) 108639), and our results can be regarded as the counterparts of (J. Funct. Anal. 279 (2020) 108639) for the multiplicative model. ","lang":"eng"}],"date_updated":"2025-09-09T14:12:00Z","scopus_import":"1","date_created":"2024-01-08T13:03:18Z","external_id":{"arxiv":["2010.16083"],"isi":["001031710500012"]},"ec_funded":1,"acknowledgement":"The first author is partially supported by NSF Grant DMS-2113489 and grateful for the AMS-SIMONS travel grant (2020–2023). The second author is supported by the ERC Advanced Grant “RMTBeyond” No. 101020331.\r\nThe authors would like to thank the Editor, Associate Editor and an anonymous referee for their many critical suggestions which have significantly improved the paper. We also want to thank Zhigang Bao and Ji Oon Lee for many helpful discussions and comments.","article_type":"original","doi":"10.1214/22-aap1882","article_processing_charge":"No","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2010.16083"}],"citation":{"mla":"Ding, Xiucai, and Hong Chang Ji. “Local Laws for Multiplication of Random Matrices.” <i>The Annals of Applied Probability</i>, vol. 33, no. 4, Institute of Mathematical Statistics, 2023, pp. 2981–3009, doi:<a href=\"https://doi.org/10.1214/22-aap1882\">10.1214/22-aap1882</a>.","ista":"Ding X, Ji HC. 2023. Local laws for multiplication of random matrices. The Annals of Applied Probability. 33(4), 2981–3009.","ama":"Ding X, Ji HC. Local laws for multiplication of random matrices. <i>The Annals of Applied Probability</i>. 2023;33(4):2981-3009. doi:<a href=\"https://doi.org/10.1214/22-aap1882\">10.1214/22-aap1882</a>","ieee":"X. Ding and H. C. Ji, “Local laws for multiplication of random matrices,” <i>The Annals of Applied Probability</i>, vol. 33, no. 4. Institute of Mathematical Statistics, pp. 2981–3009, 2023.","short":"X. Ding, H.C. Ji, The Annals of Applied Probability 33 (2023) 2981–3009.","chicago":"Ding, Xiucai, and Hong Chang Ji. “Local Laws for Multiplication of Random Matrices.” <i>The Annals of Applied Probability</i>. Institute of Mathematical Statistics, 2023. <a href=\"https://doi.org/10.1214/22-aap1882\">https://doi.org/10.1214/22-aap1882</a>.","apa":"Ding, X., &#38; Ji, H. C. (2023). Local laws for multiplication of random matrices. <i>The Annals of Applied Probability</i>. Institute of Mathematical Statistics. <a href=\"https://doi.org/10.1214/22-aap1882\">https://doi.org/10.1214/22-aap1882</a>"},"_id":"14750"},{"scopus_import":"1","date_updated":"2025-09-09T14:12:32Z","abstract":[{"lang":"eng","text":"We consider zero-error communication over a two-transmitter deterministic adversarial multiple access channel (MAC) governed by an adversary who has access to the transmissions of both senders (hence called omniscient ) and aims to maliciously corrupt the communication. None of the encoders, jammer and decoder is allowed to randomize using private or public randomness. This enforces a combinatorial nature of the problem. Our model covers a large family of channels studied in the literature, including all deterministic discrete memoryless noisy or noiseless MACs. In this work, given an arbitrary two-transmitter deterministic omniscient adversarial MAC, we characterize when the capacity region: 1) has nonempty interior (in particular, is two-dimensional); 2) consists of two line segments (in particular, has empty interior); 3) consists of one line segment (in particular, is one-dimensional); 4) or only contains (0,0) (in particular, is zero-dimensional). This extends a recent result by Wang et al. (201 9) from the point-to-point setting to the multiple access setting. Indeed, our converse arguments build upon their generalized Plotkin bound and involve delicate case analysis. One of the technical challenges is to take care of both “joint confusability” and “marginal confusability”. In particular, the treatment of marginal confusability does not follow from the point-to-point results by Wang et al. Our achievability results follow from random coding with expurgation."}],"citation":{"mla":"Zhang, Yihan. “Zero-Error Communication over Adversarial MACs.” <i>IEEE Transactions on Information Theory</i>, vol. 69, no. 7, Institute of Electrical and Electronics Engineers, 2023, pp. 4093–127, doi:<a href=\"https://doi.org/10.1109/tit.2023.3257239\">10.1109/tit.2023.3257239</a>.","ista":"Zhang Y. 2023. Zero-error communication over adversarial MACs. IEEE Transactions on Information Theory. 69(7), 4093–4127.","ama":"Zhang Y. Zero-error communication over adversarial MACs. <i>IEEE Transactions on Information Theory</i>. 2023;69(7):4093-4127. doi:<a href=\"https://doi.org/10.1109/tit.2023.3257239\">10.1109/tit.2023.3257239</a>","short":"Y. Zhang, IEEE Transactions on Information Theory 69 (2023) 4093–4127.","ieee":"Y. Zhang, “Zero-error communication over adversarial MACs,” <i>IEEE Transactions on Information Theory</i>, vol. 69, no. 7. Institute of Electrical and Electronics Engineers, pp. 4093–4127, 2023.","chicago":"Zhang, Yihan. “Zero-Error Communication over Adversarial MACs.” <i>IEEE Transactions on Information Theory</i>. Institute of Electrical and Electronics Engineers, 2023. <a href=\"https://doi.org/10.1109/tit.2023.3257239\">https://doi.org/10.1109/tit.2023.3257239</a>.","apa":"Zhang, Y. (2023). Zero-error communication over adversarial MACs. <i>IEEE Transactions on Information Theory</i>. Institute of Electrical and Electronics Engineers. <a href=\"https://doi.org/10.1109/tit.2023.3257239\">https://doi.org/10.1109/tit.2023.3257239</a>"},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2101.12426"}],"_id":"14751","article_processing_charge":"No","doi":"10.1109/tit.2023.3257239","date_created":"2024-01-08T13:04:54Z","acknowledgement":"The author would like to thank Amitalok J. Budkuley and Sidharth Jaggi for many helpful discussions at the early stage of this work. He would also like to thank Nir Ailon, Qi Cao, and Chandra Nair for discussions on a related problem regarding zero-error binary adder MACs.\r\nThe work of Yihan Zhang was supported by the European Union’s Horizon 2020 Research and Innovation Programme under Grant 682203-ERC-[Inf-Speed-Tradeoff]","external_id":{"isi":["001017307000001"],"arxiv":["2101.12426"]},"article_type":"original","publisher":"Institute of Electrical and Electronics Engineers","publication":"IEEE Transactions on Information Theory","date_published":"2023-07-01T00:00:00Z","day":"01","type":"journal_article","publication_identifier":{"issn":["0018-9448"],"eissn":["1557-9654"]},"month":"07","department":[{"_id":"MaMo"}],"year":"2023","author":[{"first_name":"Yihan","full_name":"Zhang, Yihan","orcid":"0000-0002-6465-6258","last_name":"Zhang","id":"2ce5da42-b2ea-11eb-bba5-9f264e9d002c"}],"intvolume":"        69","issue":"7","status":"public","isi":1,"oa":1,"quality_controlled":"1","publication_status":"published","keyword":["Computer Science Applications","Information Systems"],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","page":"4093-4127","language":[{"iso":"eng"}],"title":"Zero-error communication over adversarial MACs","corr_author":"1","arxiv":1,"volume":69,"oa_version":"Preprint"},{"article_type":"original","acknowledgement":"The authors would like to thank two anonymous reviews and gratefully acknowledge diverse funding agencies and resources used for this work. B.F. and C.M. thank funding from the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation program (Project CLUSTER, grant agreement no. 805041), and the EUREC4A campaign organizers for giving the opportunity to take part to the campaign and use the data early on. R. P. was supported by the US National Science Foundation (award AGS 19–16908), by the National Oceanic and Atmospheric Administration (award NA200AR4310375), and the Vetlesen Foundation.","date_created":"2024-01-08T13:07:49Z","ec_funded":1,"external_id":{"isi":["000989037900001"]},"doi":"10.1029/2023av000880","article_processing_charge":"Yes","_id":"14752","citation":{"ista":"Fildier B, Muller CJ, Pincus R, Fueglistaler S. 2023. How moisture shapes low‐level radiative cooling in subsidence regimes. AGU Advances. 4(3), e2023AV000880.","mla":"Fildier, B., et al. “How Moisture Shapes Low‐level Radiative Cooling in Subsidence Regimes.” <i>AGU Advances</i>, vol. 4, no. 3, e2023AV000880, American Geophysical Union, 2023, doi:<a href=\"https://doi.org/10.1029/2023av000880\">10.1029/2023av000880</a>.","ieee":"B. Fildier, C. J. Muller, R. Pincus, and S. Fueglistaler, “How moisture shapes low‐level radiative cooling in subsidence regimes,” <i>AGU Advances</i>, vol. 4, no. 3. American Geophysical Union, 2023.","chicago":"Fildier, B., Caroline J Muller, R. Pincus, and S. Fueglistaler. “How Moisture Shapes Low‐level Radiative Cooling in Subsidence Regimes.” <i>AGU Advances</i>. American Geophysical Union, 2023. <a href=\"https://doi.org/10.1029/2023av000880\">https://doi.org/10.1029/2023av000880</a>.","ama":"Fildier B, Muller CJ, Pincus R, Fueglistaler S. How moisture shapes low‐level radiative cooling in subsidence regimes. <i>AGU Advances</i>. 2023;4(3). doi:<a href=\"https://doi.org/10.1029/2023av000880\">10.1029/2023av000880</a>","short":"B. Fildier, C.J. Muller, R. Pincus, S. Fueglistaler, AGU Advances 4 (2023).","apa":"Fildier, B., Muller, C. J., Pincus, R., &#38; Fueglistaler, S. (2023). How moisture shapes low‐level radiative cooling in subsidence regimes. <i>AGU Advances</i>. American Geophysical Union. <a href=\"https://doi.org/10.1029/2023av000880\">https://doi.org/10.1029/2023av000880</a>"},"abstract":[{"lang":"eng","text":"Radiative cooling of the lowest atmospheric levels is of strong importance for modulating atmospheric circulations and organizing convection, but detailed observations and a robust theoretical understanding are lacking. Here we use unprecedented observational constraints from subsidence regimes in the tropical Atlantic to develop a theory for the shape and magnitude of low‐level longwave radiative cooling in clear‐sky, showing peaks larger than 5–10 K/day at the top of the boundary layer. A suite of novel scaling approximations is first developed from simplified spectral theory, in close agreement with the measurements. The radiative cooling peak height is set by the maximum lapse rate in water vapor path, and its magnitude is mainly controlled by the ratio of column relative humidity above and below the peak. We emphasize how elevated intrusions of moist air can reduce low‐level cooling, by sporadically shading the spectral range which effectively cools to space. The efficiency of this spectral shading depends both on water content and altitude of moist intrusions; its height dependence cannot be explained by the temperature difference between the emitting and absorbing layers, but by the decrease of water vapor extinction with altitude. This analytical work can help to narrow the search for low‐level cloud patterns sensitive to radiative‐convective feedbacks: the most organized patterns with largest cloud fractions occur in atmospheres below 10% relative humidity and feel the strongest low‐level cooling. This motivates further assessment of favorable conditions for radiative‐convective feedbacks and a robust quantification of corresponding shallow cloud dynamics in current and warmer climates."}],"date_updated":"2025-09-09T14:13:05Z","scopus_import":"1","year":"2023","month":"06","department":[{"_id":"CaMu"}],"publication_identifier":{"eissn":["2576-604X"]},"type":"journal_article","day":"01","article_number":"e2023AV000880","project":[{"name":"Organization of CLoUdS, and implications of Tropical  cyclones and for the Energetics of the tropics, in current and waRming climate","_id":"629205d8-2b32-11ec-9570-e1356ff73576","call_identifier":"H2020","grant_number":"805041"}],"date_published":"2023-06-01T00:00:00Z","publication":"AGU Advances","publisher":"American Geophysical Union","file":[{"file_size":24149551,"date_updated":"2024-01-09T08:51:25Z","relation":"main_file","creator":"dernst","file_name":"2023_AGUAdvances_Fildier.pdf","success":1,"access_level":"open_access","checksum":"af773220a9fa194c61a8dc2fae092c16","date_created":"2024-01-09T08:51:25Z","file_id":"14761","content_type":"application/pdf"}],"oa":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","image":"/images/cc_by_nc_nd.png"},"isi":1,"ddc":["550"],"status":"public","has_accepted_license":"1","issue":"3","intvolume":"         4","author":[{"first_name":"B.","full_name":"Fildier, B.","last_name":"Fildier"},{"id":"f978ccb0-3f7f-11eb-b193-b0e2bd13182b","orcid":"0000-0001-5836-5350","last_name":"Muller","full_name":"Muller, Caroline J","first_name":"Caroline J"},{"full_name":"Pincus, R.","first_name":"R.","last_name":"Pincus"},{"full_name":"Fueglistaler, S.","first_name":"S.","last_name":"Fueglistaler"}],"oa_version":"Published Version","volume":4,"title":"How moisture shapes low‐level radiative cooling in subsidence regimes","language":[{"iso":"eng"}],"keyword":["General Earth and Planetary Sciences"],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication_status":"published","file_date_updated":"2024-01-09T08:51:25Z","quality_controlled":"1"},{"type":"journal_article","publication_identifier":{"issn":["0370-2693"],"eissn":["1873-2445"]},"department":[{"_id":"MaRo"}],"month":"05","year":"2023","file":[{"success":1,"access_level":"open_access","checksum":"02dec160dbc81d95985e755869d8afbf","date_created":"2024-01-09T08:59:24Z","file_id":"14762","content_type":"application/pdf","date_updated":"2024-01-09T08:59:24Z","file_size":855494,"relation":"main_file","creator":"dernst","file_name":"2023_PhysicsLettersB_Faccioli.pdf"}],"publisher":"Elsevier","publication":"Physics Letters B","article_number":"137871","date_published":"2023-05-10T00:00:00Z","day":"10","citation":{"short":"P. Faccioli, I. Krätschmer, C. Lourenço, Physics Letters B 840 (2023).","chicago":"Faccioli, Pietro, Ilse Krätschmer, and Carlos Lourenço. “Low-PT Quarkonium Polarization Measurements: Challenges and Opportunities.” <i>Physics Letters B</i>. Elsevier, 2023. <a href=\"https://doi.org/10.1016/j.physletb.2023.137871\">https://doi.org/10.1016/j.physletb.2023.137871</a>.","ama":"Faccioli P, Krätschmer I, Lourenço C. Low-pT quarkonium polarization measurements: Challenges and opportunities. <i>Physics Letters B</i>. 2023;840. doi:<a href=\"https://doi.org/10.1016/j.physletb.2023.137871\">10.1016/j.physletb.2023.137871</a>","ieee":"P. Faccioli, I. Krätschmer, and C. Lourenço, “Low-pT quarkonium polarization measurements: Challenges and opportunities,” <i>Physics Letters B</i>, vol. 840. Elsevier, 2023.","mla":"Faccioli, Pietro, et al. “Low-PT Quarkonium Polarization Measurements: Challenges and Opportunities.” <i>Physics Letters B</i>, vol. 840, 137871, Elsevier, 2023, doi:<a href=\"https://doi.org/10.1016/j.physletb.2023.137871\">10.1016/j.physletb.2023.137871</a>.","ista":"Faccioli P, Krätschmer I, Lourenço C. 2023. Low-pT quarkonium polarization measurements: Challenges and opportunities. Physics Letters B. 840, 137871.","apa":"Faccioli, P., Krätschmer, I., &#38; Lourenço, C. (2023). Low-pT quarkonium polarization measurements: Challenges and opportunities. <i>Physics Letters B</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.physletb.2023.137871\">https://doi.org/10.1016/j.physletb.2023.137871</a>"},"_id":"14753","article_processing_charge":"Yes (via OA deal)","doi":"10.1016/j.physletb.2023.137871","acknowledgement":"P.F. and C.L. acknowledge support from Fundação para a Ciência e a Tecnologia, Portugal, under contract CERN/FIS-PAR/0010/2019.\r\nOpen Access funded by SCOAP3.","date_created":"2024-01-08T13:09:17Z","external_id":{"isi":["000967947300001"]},"article_type":"original","scopus_import":"1","date_updated":"2025-09-09T14:13:46Z","abstract":[{"lang":"eng","text":"Several fixed-target experiments reported J/ψ and ϒ polarizations, as functions of Feynman x (xF) and transverse momentum (PT), in three different frames, using different combinations of beam particles, target nuclei, and collision energies. Despite the diverse and heterogeneous picture formed by these measurements, a detailed look allows us to discern qualitative physical patterns that inspire a simple empirical model. This data-driven scenario offers a good quantitative description of the J/ψ and ϒ(1S) polarizations measured in proton- and pion-nucleus collisions, in the xF 0.5 domain: more than 80 data points (not statistically independent) are well reproduced with only one free parameter. This study sets the context for future low-PT\r\n quarkonium polarization measurements in proton- and pion-nucleus collisions, such as those to be made by the AMBER experiment, and shows that such measurements provide significant constraints on the poorly-known parton distribution functions of the pion."}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","keyword":["Nuclear and High Energy Physics"],"language":[{"iso":"eng"}],"title":"Low-pT quarkonium polarization measurements: Challenges and opportunities","volume":840,"oa_version":"Published Version","quality_controlled":"1","file_date_updated":"2024-01-09T08:59:24Z","publication_status":"published","ddc":["530"],"status":"public","isi":1,"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"oa":1,"author":[{"last_name":"Faccioli","first_name":"Pietro","full_name":"Faccioli, Pietro"},{"id":"30d4014e-7753-11eb-b44b-db6d61112e73","last_name":"Krätschmer","orcid":"0000-0002-5636-9259","full_name":"Krätschmer, Ilse","first_name":"Ilse"},{"last_name":"Lourenço","first_name":"Carlos","full_name":"Lourenço, Carlos"}],"intvolume":"       840","has_accepted_license":"1"},{"author":[{"first_name":"B.","full_name":"Wang, B.","last_name":"Wang"},{"first_name":"F.","full_name":"Mellibovsky, F.","last_name":"Mellibovsky"},{"orcid":"0000-0001-6572-0621","last_name":"Ayats López","id":"ab77522d-073b-11ed-8aff-e71b39258362","first_name":"Roger","full_name":"Ayats López, Roger"},{"first_name":"K.","full_name":"Deguchi, K.","last_name":"Deguchi"},{"full_name":"Meseguer, A.","first_name":"A.","last_name":"Meseguer"}],"has_accepted_license":"1","intvolume":"       381","issue":"2246","isi":1,"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"status":"public","ddc":["530"],"oa":1,"pmid":1,"quality_controlled":"1","file_date_updated":"2024-01-09T09:13:53Z","publication_status":"published","title":"Mean structure of the supercritical turbulent spiral in Taylor–Couette flow","keyword":["General Physics and Astronomy","General Engineering","General Mathematics"],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","language":[{"iso":"eng"}],"oa_version":"Submitted Version","volume":381,"date_updated":"2025-09-09T14:14:17Z","scopus_import":"1","abstract":[{"text":"The large-scale laminar/turbulent spiral patterns that appear in the linearly unstable regime of counter-rotating Taylor–Couette flow are investigated from a statistical perspective by means of direct numerical simulation. Unlike the vast majority of previous numerical studies, we analyse the flow in periodic parallelogram-annular domains, following a coordinate change that aligns one of the parallelogram sides with the spiral pattern. The domain size, shape and spatial resolution have been varied and the results compared with those in a sufficiently large computational orthogonal domain with natural axial and azimuthal periodicity. We find that a minimal parallelogram of the right tilt significantly reduces the computational cost without notably compromising the statistical properties of the supercritical turbulent spiral. Its mean structure, obtained from extremely long time integrations in a co-rotating reference frame using the method of slices, bears remarkable similarity with the turbulent stripes observed in plane Couette flow, the centrifugal instability playing only a secondary role.","lang":"eng"}],"article_processing_charge":"No","citation":{"apa":"Wang, B., Mellibovsky, F., Ayats López, R., Deguchi, K., &#38; Meseguer, A. (2023). Mean structure of the supercritical turbulent spiral in Taylor–Couette flow. <i>Philosophical Transactions of the Royal Society A</i>. The Royal Society. <a href=\"https://doi.org/10.1098/rsta.2022.0112\">https://doi.org/10.1098/rsta.2022.0112</a>","ista":"Wang B, Mellibovsky F, Ayats López R, Deguchi K, Meseguer A. 2023. Mean structure of the supercritical turbulent spiral in Taylor–Couette flow. Philosophical Transactions of the Royal Society A. 381(2246), 0112.","mla":"Wang, B., et al. “Mean Structure of the Supercritical Turbulent Spiral in Taylor–Couette Flow.” <i>Philosophical Transactions of the Royal Society A</i>, vol. 381, no. 2246, 0112, The Royal Society, 2023, doi:<a href=\"https://doi.org/10.1098/rsta.2022.0112\">10.1098/rsta.2022.0112</a>.","short":"B. Wang, F. Mellibovsky, R. Ayats López, K. Deguchi, A. Meseguer, Philosophical Transactions of the Royal Society A 381 (2023).","chicago":"Wang, B., F. Mellibovsky, Roger Ayats López, K. Deguchi, and A. Meseguer. “Mean Structure of the Supercritical Turbulent Spiral in Taylor–Couette Flow.” <i>Philosophical Transactions of the Royal Society A</i>. The Royal Society, 2023. <a href=\"https://doi.org/10.1098/rsta.2022.0112\">https://doi.org/10.1098/rsta.2022.0112</a>.","ama":"Wang B, Mellibovsky F, Ayats López R, Deguchi K, Meseguer A. Mean structure of the supercritical turbulent spiral in Taylor–Couette flow. <i>Philosophical Transactions of the Royal Society A</i>. 2023;381(2246). doi:<a href=\"https://doi.org/10.1098/rsta.2022.0112\">10.1098/rsta.2022.0112</a>","ieee":"B. Wang, F. Mellibovsky, R. Ayats López, K. Deguchi, and A. Meseguer, “Mean structure of the supercritical turbulent spiral in Taylor–Couette flow,” <i>Philosophical Transactions of the Royal Society A</i>, vol. 381, no. 2246. The Royal Society, 2023."},"_id":"14754","date_created":"2024-01-08T13:11:45Z","external_id":{"isi":["000947761800008"],"pmid":["36907214"]},"acknowledgement":"K.D.’s research was supported by Australian Research Council Discovery Early Career Researcher Award (DE170100171). B.W., R.A., F.M. and A.M. research was supported by the Spanish Ministerio de Economía y Competitividad (grant nos. FIS2016-77849-R and FIS2017-85794-P) and Ministerio de Ciencia e Innovación (grant no. PID2020-114043GB-I00) and the Generalitat de Catalunya (grant no. 2017-SGR-785). B.W.’s research was also supported by the Chinese Scholarship Council (grant CSC no. 201806440152). F.M. is a Serra-Húnter Fellow.","article_type":"original","doi":"10.1098/rsta.2022.0112","date_published":"2023-05-01T00:00:00Z","article_number":"0112","file":[{"success":1,"access_level":"open_access","checksum":"1978d126c0ce2f47c22ac20107cc0106","date_created":"2024-01-09T09:13:53Z","file_id":"14763","content_type":"application/pdf","file_size":6421086,"date_updated":"2024-01-09T09:13:53Z","creator":"dernst","relation":"main_file","file_name":"2023_PhilTransactionsA_Wang_accepted.pdf"}],"publisher":"The Royal Society","publication":"Philosophical Transactions of the Royal Society A","day":"01","type":"journal_article","publication_identifier":{"eissn":["1471-2962"],"issn":["1364-503X"]},"department":[{"_id":"BjHo"}],"month":"05","year":"2023"},{"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","keyword":["General Mathematics"],"language":[{"iso":"eng"}],"page":"297-383","title":"Convergence of the scalar- and vector-valued Allen–Cahn equation to mean curvature flow with 90°-contact angle in higher dimensions, part I: Convergence result","corr_author":"1","arxiv":1,"volume":131,"oa_version":"Preprint","quality_controlled":"1","publication_status":"published","status":"public","isi":1,"oa":1,"author":[{"first_name":"Maximilian","full_name":"Moser, Maximilian","last_name":"Moser","id":"a60047a9-da77-11eb-85b4-c4dc385ebb8c"}],"intvolume":"       131","issue":"3-4","type":"journal_article","publication_identifier":{"eissn":["1875-8576"],"issn":["0921-7134"]},"department":[{"_id":"JuFi"}],"month":"02","year":"2023","publisher":"IOS Press","publication":"Asymptotic Analysis","date_published":"2023-02-02T00:00:00Z","day":"02","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2105.07100","open_access":"1"}],"citation":{"chicago":"Moser, Maximilian. “Convergence of the Scalar- and Vector-Valued Allen–Cahn Equation to Mean Curvature Flow with 90°-Contact Angle in Higher Dimensions, Part I: Convergence Result.” <i>Asymptotic Analysis</i>. IOS Press, 2023. <a href=\"https://doi.org/10.3233/asy-221775\">https://doi.org/10.3233/asy-221775</a>.","short":"M. Moser, Asymptotic Analysis 131 (2023) 297–383.","ama":"Moser M. Convergence of the scalar- and vector-valued Allen–Cahn equation to mean curvature flow with 90°-contact angle in higher dimensions, part I: Convergence result. <i>Asymptotic Analysis</i>. 2023;131(3-4):297-383. doi:<a href=\"https://doi.org/10.3233/asy-221775\">10.3233/asy-221775</a>","ieee":"M. Moser, “Convergence of the scalar- and vector-valued Allen–Cahn equation to mean curvature flow with 90°-contact angle in higher dimensions, part I: Convergence result,” <i>Asymptotic Analysis</i>, vol. 131, no. 3–4. IOS Press, pp. 297–383, 2023.","mla":"Moser, Maximilian. “Convergence of the Scalar- and Vector-Valued Allen–Cahn Equation to Mean Curvature Flow with 90°-Contact Angle in Higher Dimensions, Part I: Convergence Result.” <i>Asymptotic Analysis</i>, vol. 131, no. 3–4, IOS Press, 2023, pp. 297–383, doi:<a href=\"https://doi.org/10.3233/asy-221775\">10.3233/asy-221775</a>.","ista":"Moser M. 2023. Convergence of the scalar- and vector-valued Allen–Cahn equation to mean curvature flow with 90°-contact angle in higher dimensions, part I: Convergence result. Asymptotic Analysis. 131(3–4), 297–383.","apa":"Moser, M. (2023). Convergence of the scalar- and vector-valued Allen–Cahn equation to mean curvature flow with 90°-contact angle in higher dimensions, part I: Convergence result. <i>Asymptotic Analysis</i>. IOS Press. <a href=\"https://doi.org/10.3233/asy-221775\">https://doi.org/10.3233/asy-221775</a>"},"_id":"14755","article_processing_charge":"No","doi":"10.3233/asy-221775","external_id":{"arxiv":["2105.07100"],"isi":["000927801300001"]},"acknowledgement":"The author gratefully acknowledges support through DFG, GRK 1692 “Curvature,\r\nCycles and Cohomology” during parts of the work.","date_created":"2024-01-08T13:13:28Z","article_type":"original","scopus_import":"1","date_updated":"2025-09-09T14:14:55Z","abstract":[{"lang":"eng","text":"We consider the sharp interface limit for the scalar-valued and vector-valued Allen–Cahn equation with homogeneous Neumann boundary condition in a bounded smooth domain Ω of arbitrary dimension N ⩾ 2 in the situation when a two-phase diffuse interface has developed and intersects the boundary ∂ Ω. The limit problem is mean curvature flow with 90°-contact angle and we show convergence in strong norms for well-prepared initial data as long as a smooth solution to the limit problem exists. To this end we assume that the limit problem has a smooth solution on [ 0 , T ] for some time T &gt; 0. Based on the latter we construct suitable curvilinear coordinates and set up an asymptotic expansion for the scalar-valued and the vector-valued Allen–Cahn equation. In order to estimate the difference of the exact and approximate solutions with a Gronwall-type argument, a spectral estimate for the linearized Allen–Cahn operator in both cases is required. The latter will be shown in a separate paper, cf. (Moser (2021))."}]},{"title":"Interplay of Cell‐autonomous Gene Function and Tissue‐wide Mechanisms Regulating Radial Glial Progenitor Lineage Progression","corr_author":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"book_chapter","page":"169-191","language":[{"iso":"eng"}],"publication_identifier":{"eisbn":["9781119860914"]},"oa_version":"None","department":[{"_id":"SiHi"}],"month":"08","year":"2023","quality_controlled":"1","date_published":"2023-08-08T00:00:00Z","publisher":"Wiley","publication":"Neocortical Neurogenesis in Development and Evolution","day":"08","publication_status":"published","article_processing_charge":"No","citation":{"apa":"Villalba Requena, A., Amberg, N., &#38; Hippenmeyer, S. (2023). Interplay of Cell‐autonomous Gene Function and Tissue‐wide Mechanisms Regulating Radial Glial Progenitor Lineage Progression. In W. Huttner (Ed.), <i>Neocortical Neurogenesis in Development and Evolution</i> (pp. 169–191). Wiley. <a href=\"https://doi.org/10.1002/9781119860914.ch10\">https://doi.org/10.1002/9781119860914.ch10</a>","mla":"Villalba Requena, Ana, et al. “Interplay of Cell‐autonomous Gene Function and Tissue‐wide Mechanisms Regulating Radial Glial Progenitor Lineage Progression.” <i>Neocortical Neurogenesis in Development and Evolution</i>, edited by Wieland Huttner, Wiley, 2023, pp. 169–91, doi:<a href=\"https://doi.org/10.1002/9781119860914.ch10\">10.1002/9781119860914.ch10</a>.","ista":"Villalba Requena A, Amberg N, Hippenmeyer S. 2023.Interplay of Cell‐autonomous Gene Function and Tissue‐wide Mechanisms Regulating Radial Glial Progenitor Lineage Progression. In: Neocortical Neurogenesis in Development and Evolution. , 169–191.","ama":"Villalba Requena A, Amberg N, Hippenmeyer S. Interplay of Cell‐autonomous Gene Function and Tissue‐wide Mechanisms Regulating Radial Glial Progenitor Lineage Progression. In: Huttner W, ed. <i>Neocortical Neurogenesis in Development and Evolution</i>. Wiley; 2023:169-191. doi:<a href=\"https://doi.org/10.1002/9781119860914.ch10\">10.1002/9781119860914.ch10</a>","ieee":"A. Villalba Requena, N. Amberg, and S. Hippenmeyer, “Interplay of Cell‐autonomous Gene Function and Tissue‐wide Mechanisms Regulating Radial Glial Progenitor Lineage Progression,” in <i>Neocortical Neurogenesis in Development and Evolution</i>, W. Huttner, Ed. Wiley, 2023, pp. 169–191.","short":"A. Villalba Requena, N. Amberg, S. Hippenmeyer, in:, W. Huttner (Ed.), Neocortical Neurogenesis in Development and Evolution, Wiley, 2023, pp. 169–191.","chicago":"Villalba Requena, Ana, Nicole Amberg, and Simon Hippenmeyer. “Interplay of Cell‐autonomous Gene Function and Tissue‐wide Mechanisms Regulating Radial Glial Progenitor Lineage Progression.” In <i>Neocortical Neurogenesis in Development and Evolution</i>, edited by Wieland Huttner, 169–91. Wiley, 2023. <a href=\"https://doi.org/10.1002/9781119860914.ch10\">https://doi.org/10.1002/9781119860914.ch10</a>."},"_id":"14757","status":"public","date_created":"2024-01-08T13:16:36Z","doi":"10.1002/9781119860914.ch10","editor":[{"full_name":"Huttner, Wieland","first_name":"Wieland","last_name":"Huttner"}],"author":[{"orcid":"0000-0002-5615-5277","last_name":"Villalba Requena","id":"68cb85a0-39f7-11eb-9559-9aaab4f6a247","first_name":"Ana","full_name":"Villalba Requena, Ana"},{"first_name":"Nicole","full_name":"Amberg, Nicole","last_name":"Amberg","orcid":"0000-0002-3183-8207","id":"4CD6AAC6-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0003-2279-1061","last_name":"Hippenmeyer","id":"37B36620-F248-11E8-B48F-1D18A9856A87","first_name":"Simon","full_name":"Hippenmeyer, Simon"}],"date_updated":"2024-10-09T21:07:46Z","scopus_import":"1","abstract":[{"lang":"eng","text":"The cerebral cortex is comprised of a vast cell-type diversity sequentially generated by cortical progenitor cells. Faithful progenitor lineage progression requires the tight orchestration of distinct molecular and cellular mechanisms regulating proper progenitor proliferation behavior and differentiation. Correct execution of developmental programs involves a complex interplay of cell intrinsic and tissue-wide mechanisms. Many studies over the past decades have been able to determine a plethora of genes critically involved in cortical development. However, only a few made use of genetic paradigms with sparse and global gene deletion to probe cell-autonomous vs. tissue-wide contribution. In this chapter, we will elaborate on the importance of dissecting the cell-autonomous and tissue-wide mechanisms to gain a precise understanding of gene function during radial glial progenitor lineage progression."}]},{"author":[{"full_name":"Majumdar, Rupak","first_name":"Rupak","last_name":"Majumdar"},{"first_name":"Kaushik","full_name":"Mallik, Kaushik","last_name":"Mallik","orcid":"0000-0001-9864-7475","id":"0834ff3c-6d72-11ec-94e0-b5b0a4fb8598"},{"full_name":"Rychlicki, Mateusz","first_name":"Mateusz","last_name":"Rychlicki"},{"last_name":"Schmuck","full_name":"Schmuck, Anne-Kathrin","first_name":"Anne-Kathrin"},{"first_name":"Sadegh","full_name":"Soudjani, Sadegh","last_name":"Soudjani"}],"has_accepted_license":"1","intvolume":"     13966","isi":1,"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"status":"public","ddc":["000"],"oa":1,"quality_controlled":"1","file_date_updated":"2024-01-09T10:01:07Z","publication_status":"published","corr_author":"1","title":"A flexible toolchain for symbolic rabin games under fair and stochastic uncertainties","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","page":"3-15","language":[{"iso":"eng"}],"oa_version":"Published Version","volume":13966,"conference":{"location":"Paris, France","start_date":"2023-07-17","name":"CAV: Computer Aided Verification","end_date":"2023-07-22"},"date_updated":"2025-09-09T14:16:49Z","related_material":{"record":[{"relation":"research_data","status":"public","id":"14994"}]},"scopus_import":"1","abstract":[{"text":"We present a flexible and efficient toolchain to symbolically solve (standard) Rabin games, fair-adversarial Rabin games, and 2 1/2 license type-player Rabin games. To our best knowledge, our tools are the first ones to be able to solve these problems. Furthermore, using these flexible game solvers as a back-end, we implemented a tool for computing correct-by-construction controllers for stochastic dynamical systems under LTL specifications. Our implementations use the recent theoretical result that all of these games can be solved using the same symbolic fixpoint algorithm but utilizing different, domain specific calculations of the involved predecessor operators. The main feature of our toolchain is the utilization of two programming abstractions: one to separate the symbolic fixpoint computations from the predecessor calculations, and another one to allow the integration of different BDD libraries as back-ends. In particular, we employ a multi-threaded execution of the fixpoint algorithm by using the multi-threaded BDD library Sylvan, which leads to enormous computational savings.","lang":"eng"}],"article_processing_charge":"Yes (in subscription journal)","citation":{"ista":"Majumdar R, Mallik K, Rychlicki M, Schmuck A-K, Soudjani S. 2023. A flexible toolchain for symbolic rabin games under fair and stochastic uncertainties. 35th International Conference on Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 13966, 3–15.","mla":"Majumdar, Rupak, et al. “A Flexible Toolchain for Symbolic Rabin Games under Fair and Stochastic Uncertainties.” <i>35th International Conference on Computer Aided Verification</i>, vol. 13966, Springer Nature, 2023, pp. 3–15, doi:<a href=\"https://doi.org/10.1007/978-3-031-37709-9_1\">10.1007/978-3-031-37709-9_1</a>.","chicago":"Majumdar, Rupak, Kaushik Mallik, Mateusz Rychlicki, Anne-Kathrin Schmuck, and Sadegh Soudjani. “A Flexible Toolchain for Symbolic Rabin Games under Fair and Stochastic Uncertainties.” In <i>35th International Conference on Computer Aided Verification</i>, 13966:3–15. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/978-3-031-37709-9_1\">https://doi.org/10.1007/978-3-031-37709-9_1</a>.","short":"R. Majumdar, K. Mallik, M. Rychlicki, A.-K. Schmuck, S. Soudjani, in:, 35th International Conference on Computer Aided Verification, Springer Nature, 2023, pp. 3–15.","ama":"Majumdar R, Mallik K, Rychlicki M, Schmuck A-K, Soudjani S. A flexible toolchain for symbolic rabin games under fair and stochastic uncertainties. In: <i>35th International Conference on Computer Aided Verification</i>. Vol 13966. Springer Nature; 2023:3-15. doi:<a href=\"https://doi.org/10.1007/978-3-031-37709-9_1\">10.1007/978-3-031-37709-9_1</a>","ieee":"R. Majumdar, K. Mallik, M. Rychlicki, A.-K. Schmuck, and S. Soudjani, “A flexible toolchain for symbolic rabin games under fair and stochastic uncertainties,” in <i>35th International Conference on Computer Aided Verification</i>, Paris, France, 2023, vol. 13966, pp. 3–15.","apa":"Majumdar, R., Mallik, K., Rychlicki, M., Schmuck, A.-K., &#38; Soudjani, S. (2023). A flexible toolchain for symbolic rabin games under fair and stochastic uncertainties. In <i>35th International Conference on Computer Aided Verification</i> (Vol. 13966, pp. 3–15). Paris, France: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-37709-9_1\">https://doi.org/10.1007/978-3-031-37709-9_1</a>"},"_id":"14758","date_created":"2024-01-08T13:18:00Z","ec_funded":1,"external_id":{"isi":["001310805600001"]},"acknowledgement":"Authors ordered alphabetically. R. Majumdar and A.-K. Schmuck are partially supported by DFG project 389792660 TRR 248-CPEC. A.-K. Schmuck is additionally funded through DFG project (SCHM 3541/1-1). K. Mallik is supported by the ERC project ERC-2020-AdG 101020093. M. Rychlicki is supported by the EPSRC project EP/V00252X/1. S. Soudjani is supported by the following projects: EPSRC EP/V043676/1, EIC 101070802, and ERC 101089047.","doi":"10.1007/978-3-031-37709-9_1","project":[{"grant_number":"101020093","name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"}],"date_published":"2023-07-16T00:00:00Z","alternative_title":["LNCS"],"file":[{"success":1,"access_level":"open_access","checksum":"1a361d83db0244fd32c03b544c294b5a","date_created":"2024-01-09T10:01:07Z","file_id":"14765","content_type":"application/pdf","date_updated":"2024-01-09T10:01:07Z","file_size":405147,"relation":"main_file","creator":"dernst","file_name":"2023_LNCSCAV_Majumdar.pdf"}],"publisher":"Springer Nature","publication":"35th International Conference on Computer Aided Verification","day":"16","type":"conference","publication_identifier":{"issn":["0302-9743"],"isbn":["9783031377082"],"eissn":["1611-3349"],"eisbn":["9783031377099"]},"month":"07","department":[{"_id":"ToHe"}],"year":"2023"},{"day":"22","publication":"2023 IEEE 64th Annual Symposium on Foundations of Computer Science","publisher":"IEEE","date_published":"2023-12-22T00:00:00Z","project":[{"grant_number":"101034413","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","call_identifier":"H2020","name":"IST-BRIDGE: International postdoctoral program"},{"_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","call_identifier":"H2020","name":"The design and evaluation of modern fully dynamic data structures","grant_number":"101019564"}],"year":"2023","month":"12","department":[{"_id":"MoHe"}],"publication_identifier":{"eisbn":["9798350318944"]},"type":"conference","abstract":[{"text":"In all state-of-the-art sketching and coreset techniques for clustering, as well as in the best known fixed-parameter tractable approximation algorithms, randomness plays a key role. For the classic k-median and k-means problems, there are no known deterministic dimensionality reduction procedure or coreset construction that avoid an exponential dependency on the input dimension d, the precision parameter $\\varepsilon^{-1}$ or k. Furthermore, there is no coreset construction that succeeds with probability $1-1/n$ and whose size does not depend on the number of input points, n. This has led researchers in the area to ask what is the power of randomness for clustering sketches [Feldman WIREs Data Mining Knowl. Discov’20].Similarly, the best approximation ratio achievable deterministically without a complexity exponential in the dimension are $1+\\sqrt{2}$ for k-median [Cohen-Addad, Esfandiari, Mirrokni, Narayanan, STOC’22] and 6.12903 for k-means [Grandoni, Ostrovsky, Rabani, Schulman, Venkat, Inf. Process. Lett.’22]. Those are the best results, even when allowing a complexity FPT in the number of clusters k: this stands in sharp contrast with the $(1+\\varepsilon)$-approximation achievable in that case, when allowing randomization.In this paper, we provide deterministic sketches constructions for clustering, whose size bounds are close to the best-known randomized ones. We show how to compute a dimension reduction onto $\\varepsilon^{-O(1)} \\log k$ dimensions in time $k^{O\\left(\\varepsilon^{-O(1)}+\\log \\log k\\right)}$ poly $(n d)$, and how to build a coreset of size $O\\left(k^{2} \\log ^{3} k \\varepsilon^{-O(1)}\\right)$ in time $2^{\\varepsilon^{O(1)} k \\log ^{3} k}+k^{O\\left(\\varepsilon^{-O(1)}+\\log \\log k\\right)}$ poly $(n d)$. In the case where k is small, this answers an open question of [Feldman WIDM’20] and [Munteanu and Schwiegelshohn, Künstliche Intell. ’18] on whether it is possible to efficiently compute coresets deterministically.We also construct a deterministic algorithm for computing $(1+$ $\\varepsilon)$-approximation to k-median and k-means in high dimensional Euclidean spaces in time $2^{k^{2} \\log ^{3} k / \\varepsilon^{O(1)}}$ poly $(n d)$, close to the best randomized complexity of $2^{(k / \\varepsilon)^{O(1)}}$ nd (see [Kumar, Sabharwal, Sen, JACM 10] and [Bhattacharya, Jaiswal, Kumar, TCS’18]).Furthermore, our new insights on sketches also yield a randomized coreset construction that uses uniform sampling, that immediately improves over the recent results of [Braverman et al. FOCS ’22] by a factor k.","lang":"eng"}],"scopus_import":"1","date_updated":"2025-09-09T14:17:59Z","conference":{"location":"Santa Cruz, CA, United States","start_date":"2023-11-06","name":"FOCS: Foundations of Computer Science","end_date":"2023-11-09"},"doi":"10.1109/focs57990.2023.00066","acknowledgement":"D. Sauplic has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No 101034413, and Grant agreement No. 101019564 “The Design of Modern Fully Dynamic Data Structures (MoDynStruct)”.\r\nC. Schwiegelshohn acknowledges the support of the Independent Research Fund Denmark (DFF) under a Sapere Aude Research Leader grant No 1051-00106B.","ec_funded":1,"date_created":"2024-01-09T16:20:09Z","external_id":{"arxiv":["2310.04076"],"isi":["001137125900060"]},"_id":"14768","citation":{"apa":"Cohen-Addad, V., Saulpic, D., &#38; Schwiegelshohn, C. (2023). Deterministic clustering in high dimensional spaces: Sketches and approximation. In <i>2023 IEEE 64th Annual Symposium on Foundations of Computer Science</i> (pp. 1105–1130). Santa Cruz, CA, United States: IEEE. <a href=\"https://doi.org/10.1109/focs57990.2023.00066\">https://doi.org/10.1109/focs57990.2023.00066</a>","ieee":"V. Cohen-Addad, D. Saulpic, and C. Schwiegelshohn, “Deterministic clustering in high dimensional spaces: Sketches and approximation,” in <i>2023 IEEE 64th Annual Symposium on Foundations of Computer Science</i>, Santa Cruz, CA, United States, 2023, pp. 1105–1130.","short":"V. Cohen-Addad, D. Saulpic, C. Schwiegelshohn, in:, 2023 IEEE 64th Annual Symposium on Foundations of Computer Science, IEEE, 2023, pp. 1105–1130.","chicago":"Cohen-Addad, Vincent, David Saulpic, and Chris Schwiegelshohn. “Deterministic Clustering in High Dimensional Spaces: Sketches and Approximation.” In <i>2023 IEEE 64th Annual Symposium on Foundations of Computer Science</i>, 1105–30. IEEE, 2023. <a href=\"https://doi.org/10.1109/focs57990.2023.00066\">https://doi.org/10.1109/focs57990.2023.00066</a>.","ama":"Cohen-Addad V, Saulpic D, Schwiegelshohn C. Deterministic clustering in high dimensional spaces: Sketches and approximation. In: <i>2023 IEEE 64th Annual Symposium on Foundations of Computer Science</i>. IEEE; 2023:1105-1130. doi:<a href=\"https://doi.org/10.1109/focs57990.2023.00066\">10.1109/focs57990.2023.00066</a>","mla":"Cohen-Addad, Vincent, et al. “Deterministic Clustering in High Dimensional Spaces: Sketches and Approximation.” <i>2023 IEEE 64th Annual Symposium on Foundations of Computer Science</i>, IEEE, 2023, pp. 1105–30, doi:<a href=\"https://doi.org/10.1109/focs57990.2023.00066\">10.1109/focs57990.2023.00066</a>.","ista":"Cohen-Addad V, Saulpic D, Schwiegelshohn C. 2023. Deterministic clustering in high dimensional spaces: Sketches and approximation. 2023 IEEE 64th Annual Symposium on Foundations of Computer Science. FOCS: Foundations of Computer Science, 1105–1130."},"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2310.04076","open_access":"1"}],"article_processing_charge":"No","publication_status":"published","quality_controlled":"1","oa_version":"Preprint","page":"1105-1130","language":[{"iso":"eng"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","arxiv":1,"title":"Deterministic clustering in high dimensional spaces: Sketches and approximation","author":[{"full_name":"Cohen-Addad, Vincent","first_name":"Vincent","last_name":"Cohen-Addad"},{"full_name":"Saulpic, David","first_name":"David","id":"f8e48cf0-b0ff-11ed-b0e9-b4c35598f964","last_name":"Saulpic"},{"last_name":"Schwiegelshohn","first_name":"Chris","full_name":"Schwiegelshohn, Chris"}],"oa":1,"status":"public","isi":1}]