[{"tmp":{"short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"article_number":"koad324","quality_controlled":"1","keyword":["Cell Biology","Plant Science"],"date_updated":"2024-01-03T12:43:41Z","doi":"10.1093/plcell/koad324","article_processing_charge":"No","date_published":"2023-12-23T00:00:00Z","author":[{"full_name":"Zhou, Liang-Zi","last_name":"Zhou","first_name":"Liang-Zi"},{"last_name":"Wang","first_name":"Lele","full_name":"Wang, Lele"},{"full_name":"Chen, Xia","first_name":"Xia","last_name":"Chen"},{"first_name":"Zengxiang","orcid":"0000-0001-9381-3577","last_name":"Ge","full_name":"Ge, Zengxiang","id":"f43371a3-09ff-11eb-8013-bd0c6a2f6de8"},{"full_name":"Mergner, Julia","first_name":"Julia","last_name":"Mergner"},{"full_name":"Li, Xingli","last_name":"Li","first_name":"Xingli"},{"last_name":"Küster","first_name":"Bernhard","full_name":"Küster, Bernhard"},{"first_name":"Gernot","last_name":"Längst","full_name":"Längst, Gernot"},{"full_name":"Qu, Li-Jia","last_name":"Qu","first_name":"Li-Jia"},{"first_name":"Thomas","last_name":"Dresselhaus","full_name":"Dresselhaus, Thomas"}],"publication_status":"epub_ahead","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1093/plcell/koad324"}],"license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","language":[{"iso":"eng"}],"month":"12","day":"23","ddc":["580"],"oa_version":"Published Version","date_created":"2024-01-02T11:19:37Z","publisher":"Oxford University Press","title":"The RALF signaling pathway regulates cell wall integrity during pollen tube growth in maize","publication":"The Plant Cell","extern":"1","abstract":[{"lang":"eng","text":"Autocrine signaling pathways regulated by RAPID ALKALINIZATION FACTORs (RALFs) control cell wall integrity during pollen tube germination and growth in Arabidopsis (Arabidopsis thaliana). To investigate the role of pollen-specific RALFs in another plant species, we combined gene expression data with phylogenetic and biochemical studies to identify candidate orthologs in maize (Zea mays). We show that Clade IB ZmRALF2/3 mutations, but not Clade III ZmRALF1/5 mutations, cause cell wall instability in the sub-apical region of the growing pollen tube. ZmRALF2/3 are mainly located in the cell wall and are partially able to complement the pollen germination defect of their Arabidopsis orthologs AtRALF4/19. Mutations in ZmRALF2/3 compromise pectin distribution patterns leading to altered cell wall organization and thickness culminating in pollen tube burst. Clade IB, but not Clade III ZmRALFs, strongly interact as ligands with the pollen-specific Catharanthus roseus RLK1-like (CrRLK1L) receptor kinases Zea mays FERONIA-like (ZmFERL) 4/7/9, LORELEI-like glycosylphosphatidylinositol-anchor (LLG) proteins Zea mays LLG 1 and 2 (ZmLLG1/2) and Zea mays pollen extension-like (PEX) cell wall proteins ZmPEX2/4. Notably, ZmFERL4 outcompetes ZmLLG2 and ZmPEX2 outcompetes ZmFERL4 for ZmRALF2 binding. Based on these data, we suggest that Clade IB RALFs act in a dual role as cell wall components and extracellular sensors to regulate cell wall integrity and thickness during pollen tube growth in maize and probably other plants."}],"has_accepted_license":"1","year":"2023","_id":"14726","type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"eissn":["1532-298X"],"issn":["1040-4651"]},"citation":{"ama":"Zhou L-Z, Wang L, Chen X, et al. The RALF signaling pathway regulates cell wall integrity during pollen tube growth in maize. <i>The Plant Cell</i>. 2023. doi:<a href=\"https://doi.org/10.1093/plcell/koad324\">10.1093/plcell/koad324</a>","ista":"Zhou L-Z, Wang L, Chen X, Ge Z, Mergner J, Li X, Küster B, Längst G, Qu L-J, Dresselhaus T. 2023. The RALF signaling pathway regulates cell wall integrity during pollen tube growth in maize. The Plant Cell., koad324.","mla":"Zhou, Liang-Zi, et al. “The RALF Signaling Pathway Regulates Cell Wall Integrity during Pollen Tube Growth in Maize.” <i>The Plant Cell</i>, koad324, Oxford University Press, 2023, doi:<a href=\"https://doi.org/10.1093/plcell/koad324\">10.1093/plcell/koad324</a>.","short":"L.-Z. Zhou, L. Wang, X. Chen, Z. Ge, J. Mergner, X. Li, B. Küster, G. Längst, L.-J. Qu, T. Dresselhaus, The Plant Cell (2023).","chicago":"Zhou, Liang-Zi, Lele Wang, Xia Chen, Zengxiang Ge, Julia Mergner, Xingli Li, Bernhard Küster, Gernot Längst, Li-Jia Qu, and Thomas Dresselhaus. “The RALF Signaling Pathway Regulates Cell Wall Integrity during Pollen Tube Growth in Maize.” <i>The Plant Cell</i>. Oxford University Press, 2023. <a href=\"https://doi.org/10.1093/plcell/koad324\">https://doi.org/10.1093/plcell/koad324</a>.","ieee":"L.-Z. Zhou <i>et al.</i>, “The RALF signaling pathway regulates cell wall integrity during pollen tube growth in maize,” <i>The Plant Cell</i>. Oxford University Press, 2023.","apa":"Zhou, L.-Z., Wang, L., Chen, X., Ge, Z., Mergner, J., Li, X., … Dresselhaus, T. (2023). The RALF signaling pathway regulates cell wall integrity during pollen tube growth in maize. <i>The Plant Cell</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/plcell/koad324\">https://doi.org/10.1093/plcell/koad324</a>"},"article_type":"original","status":"public","oa":1},{"date_created":"2024-01-04T09:35:54Z","oa_version":"Preprint","tmp":{"short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"publication":"bioRxiv","title":"Genetic load, eco-evolutionary feedback and extinction in a metapopulation","department":[{"_id":"NiBa"},{"_id":"JaMa"}],"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","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"14711"}]},"doi":"10.1101/2023.12.02.569702","date_updated":"2025-05-26T09:05:10Z","date_published":"2023-12-04T00:00:00Z","author":[{"first_name":"Oluwafunmilola O","last_name":"Olusanya","orcid":"0000-0003-1971-8314","full_name":"Olusanya, Oluwafunmilola O","id":"41AD96DC-F248-11E8-B48F-1D18A9856A87"},{"id":"4E6DC800-AE37-11E9-AC72-31CAE5697425","full_name":"Khudiakova, Kseniia","orcid":"0000-0002-6246-1465","last_name":"Khudiakova","first_name":"Kseniia"},{"id":"42377A0A-F248-11E8-B48F-1D18A9856A87","full_name":"Sachdeva, Himani","last_name":"Sachdeva","first_name":"Himani"}],"year":"2023","publication_status":"submitted","_id":"14732","main_file_link":[{"open_access":"1","url":"https://www.biorxiv.org/content/10.1101/2023.12.02.569702v1"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","type":"preprint","month":"12","project":[{"grant_number":"P32896","name":"Causes and consequences of population fragmentation","_id":"c08d3278-5a5b-11eb-8a69-fdb09b55f4b8"},{"grant_number":"26293","name":"The impact of deleterious mutations on small populations","_id":"34d33d68-11ca-11ed-8bc3-ec13763c0ca8"},{"grant_number":"26380","name":"Polygenic Adaptation in a Metapopulation","_id":"34c872fe-11ca-11ed-8bc3-8534b82131e6"}],"language":[{"iso":"eng"}],"citation":{"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>","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.).","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>.","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>.","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>"},"day":"04","oa":1,"status":"public"},{"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"author":[{"id":"4cc538d5-803f-11ed-ab7e-8139573aad8f","full_name":"Jethwa, Rajesh B","orcid":"0000-0002-0404-4356","last_name":"Jethwa","first_name":"Rajesh B"},{"full_name":"Hey, Dominic","last_name":"Hey","first_name":"Dominic"},{"full_name":"Kerber, Rachel N.","last_name":"Kerber","first_name":"Rachel N."},{"full_name":"Bond, Andrew D.","last_name":"Bond","first_name":"Andrew D."},{"full_name":"Wright, Dominic S.","first_name":"Dominic S.","last_name":"Wright"},{"last_name":"Grey","first_name":"Clare P.","full_name":"Grey, Clare P."}],"date_published":"2023-12-28T00:00:00Z","date_updated":"2024-01-08T09:03:01Z","doi":"10.1021/acsaem.3c02223","article_processing_charge":"Yes (in subscription journal)","keyword":["Electrical and Electronic Engineering","Materials Chemistry","Electrochemistry","Energy Engineering and Power Technology","Chemical Engineering (miscellaneous)"],"quality_controlled":"1","main_file_link":[{"url":"https://doi.org/10.1021/acsaem.3c02223","open_access":"1"}],"publication_status":"epub_ahead","day":"28","ddc":["540"],"language":[{"iso":"eng"}],"project":[{"grant_number":"101034413","name":"IST-BRIDGE: International postdoctoral program","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","call_identifier":"H2020"}],"month":"12","title":"Exploring the landscape of heterocyclic quinones for redox flow batteries","department":[{"_id":"StFr"}],"publication":"ACS Applied Energy Materials","publisher":"American Chemical Society","oa_version":"Published Version","ec_funded":1,"date_created":"2024-01-05T09:20:48Z","abstract":[{"lang":"eng","text":"Redox flow batteries (RFBs) rely on the development of cheap, highly soluble, and high-energy-density electrolytes. Several candidate quinones have already been investigated in the literature as two-electron anolytes or catholytes, benefiting from fast kinetics, high tunability, and low cost. Here, an investigation of nitrogen-rich fused heteroaromatic quinones was carried out to explore avenues for electrolyte development. These quinones were synthesized and screened by using electrochemical techniques. The most promising candidate, 4,8-dioxo-4,8-dihydrobenzo[1,2-d:4,5-d′]bis([1,2,3]triazole)-1,5-diide (−0.68 V(SHE)), was tested in both an asymmetric and symmetric full-cell setup resulting in capacity fade rates of 0.35% per cycle and 0.0124% per cycle, respectively. In situ ultraviolet-visible spectroscopy (UV–Vis), nuclear magnetic resonance (NMR), and electron paramagnetic resonance (EPR) spectroscopies were used to investigate the electrochemical stability of the charged species during operation. UV–Vis spectroscopy, supported by density functional theory (DFT) modeling, reaffirmed that the two-step charging mechanism observed during battery operation consisted of two, single-electron transfers. The radical concentration during battery operation and the degree of delocalization of the unpaired electron were quantified with NMR and EPR spectroscopy."}],"type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"14733","year":"2023","has_accepted_license":"1","status":"public","oa":1,"article_type":"original","citation":{"ista":"Jethwa RB, Hey D, Kerber RN, Bond AD, Wright DS, Grey CP. 2023. Exploring the landscape of heterocyclic quinones for redox flow batteries. ACS Applied Energy Materials.","mla":"Jethwa, Rajesh B., et al. “Exploring the Landscape of Heterocyclic Quinones for Redox Flow Batteries.” <i>ACS Applied Energy Materials</i>, American Chemical Society, 2023, doi:<a href=\"https://doi.org/10.1021/acsaem.3c02223\">10.1021/acsaem.3c02223</a>.","short":"R.B. Jethwa, D. Hey, R.N. Kerber, A.D. Bond, D.S. Wright, C.P. Grey, ACS Applied Energy Materials (2023).","ama":"Jethwa RB, Hey D, Kerber RN, Bond AD, Wright DS, Grey CP. Exploring the landscape of heterocyclic quinones for redox flow batteries. <i>ACS Applied Energy Materials</i>. 2023. doi:<a href=\"https://doi.org/10.1021/acsaem.3c02223\">10.1021/acsaem.3c02223</a>","apa":"Jethwa, R. B., Hey, D., Kerber, R. N., Bond, A. D., Wright, D. S., &#38; Grey, C. P. (2023). Exploring the landscape of heterocyclic quinones for redox flow batteries. <i>ACS Applied Energy Materials</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/acsaem.3c02223\">https://doi.org/10.1021/acsaem.3c02223</a>","chicago":"Jethwa, Rajesh B, Dominic Hey, Rachel N. Kerber, Andrew D. Bond, Dominic S. Wright, and Clare P. Grey. “Exploring the Landscape of Heterocyclic Quinones for Redox Flow Batteries.” <i>ACS Applied Energy Materials</i>. American Chemical Society, 2023. <a href=\"https://doi.org/10.1021/acsaem.3c02223\">https://doi.org/10.1021/acsaem.3c02223</a>.","ieee":"R. B. Jethwa, D. Hey, R. N. Kerber, A. D. Bond, D. S. Wright, and C. P. Grey, “Exploring the landscape of heterocyclic quinones for redox flow batteries,” <i>ACS Applied Energy Materials</i>. American Chemical Society, 2023."},"publication_identifier":{"eissn":["2574-0962"]}},{"year":"2023","_id":"14735","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference","volume":13950,"page":"3-20","publication_identifier":{"eisbn":["9783031477546"],"eissn":["0302-9743"],"issn":["1611-3349"],"isbn":["9783031477539"]},"citation":{"short":"C. Stefo, Z. Xiang, E. Kokoris Kogias, in:, 27th International Conference on Financial Cryptography and Data Security, Springer Nature, 2023, pp. 3–20.","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.","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>.","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>","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>","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.","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>."},"oa":1,"status":"public","acknowledgement":"Eleftherios Kokoris-Kogias is partially supported by Austrian Science Fund (FWF) grant No: F8512-N.","date_created":"2024-01-08T09:17:38Z","oa_version":"Preprint","publisher":"Springer Nature","publication":"27th International Conference on Financial Cryptography and Data Security","department":[{"_id":"ElKo"},{"_id":"GradSch"}],"title":"Executing and proving over dirty ledgers","abstract":[{"lang":"eng","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."}],"publication_status":"published","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2022/1554"}],"intvolume":"     13950","month":"12","language":[{"iso":"eng"}],"project":[{"_id":"34a4ce89-11ca-11ed-8bc3-8cc37fb6e11f","grant_number":"F8512","name":"Secure Network and Hardware for Efficient Blockchains"}],"day":"01","conference":{"location":"Bol, Brac, Croatia","start_date":"2023-05-01","name":"FC: Financial Cryptography and Data Security","end_date":"2023-05-05"},"quality_controlled":"1","scopus_import":"1","article_processing_charge":"No","alternative_title":["LNCS"],"date_updated":"2024-01-08T09:28:14Z","doi":"10.1007/978-3-031-47754-6_1","author":[{"first_name":"Christos","last_name":"Stefo","full_name":"Stefo, Christos","id":"a20e8902-32b0-11ee-9fa8-b23fa638b793"},{"full_name":"Xiang, Zhuolun","first_name":"Zhuolun","last_name":"Xiang"},{"id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30","full_name":"Kokoris Kogias, Eleftherios","last_name":"Kokoris Kogias","first_name":"Eleftherios"}],"date_published":"2023-12-01T00:00:00Z"},{"arxiv":1,"abstract":[{"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.","lang":"eng"}],"department":[{"_id":"UlWa"}],"title":"Functional John and Löwner conditions for pairs of log-concave functions","publication":"International Mathematics Research Notices","publisher":"Oxford University Press","oa_version":"Published Version","date_created":"2024-01-08T09:48:56Z","oa":1,"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.].","status":"public","external_id":{"arxiv":["2212.11781"]},"article_type":"original","issue":"23","citation":{"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>","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.","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>.","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.","short":"G. Ivanov, M. Naszódi, International Mathematics Research Notices 2023 (2023) 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>.","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>"},"publication_identifier":{"issn":["1073-7928"],"eissn":["1687-0247"]},"page":"20613-20669","volume":2023,"type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"14737","has_accepted_license":"1","year":"2023","author":[{"full_name":"Ivanov, Grigory","id":"87744F66-5C6F-11EA-AFE0-D16B3DDC885E","first_name":"Grigory","last_name":"Ivanov"},{"full_name":"Naszódi, Márton","first_name":"Márton","last_name":"Naszódi"}],"date_published":"2023-12-01T00:00:00Z","doi":"10.1093/imrn/rnad210","date_updated":"2024-01-08T09:57:25Z","article_processing_charge":"Yes (via OA deal)","keyword":["General Mathematics"],"quality_controlled":"1","file_date_updated":"2024-01-08T09:53:09Z","tmp":{"short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"day":"01","ddc":["510"],"language":[{"iso":"eng"}],"month":"12","intvolume":"      2023","publication_status":"published","file":[{"file_id":"14738","date_updated":"2024-01-08T09:53:09Z","file_size":815777,"checksum":"353666cea80633beb0f1ffd342dff6d4","file_name":"2023_IMRN_Ivanov.pdf","relation":"main_file","creator":"dernst","access_level":"open_access","content_type":"application/pdf","date_created":"2024-01-08T09:53:09Z","success":1}]},{"citation":{"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>.","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>","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>","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.","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.","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>."},"publication_identifier":{"issn":["0162-8828"],"eissn":["1939-3539"]},"oa":1,"status":"public","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.","article_type":"original","issue":"12","_id":"14739","has_accepted_license":"1","year":"2023","page":"14069-14080","volume":45,"type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","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."}],"oa_version":"Published Version","date_created":"2024-01-08T09:59:46Z","title":"A survey of vectorization methods in topological data analysis","department":[{"_id":"HeEd"}],"publication":"IEEE Transactions on Pattern Analysis and Machine Intelligence","publisher":"IEEE","language":[{"iso":"eng"}],"month":"12","day":"01","ddc":["000"],"intvolume":"        45","publication_status":"published","file":[{"date_updated":"2024-01-08T10:09:14Z","file_id":"14740","file_name":"2023_IEEEToP_Ali.pdf","checksum":"465c28ef0b151b4b1fb47977ed5581ab","file_size":2370988,"access_level":"open_access","creator":"dernst","relation":"main_file","success":1,"date_created":"2024-01-08T10:09:14Z","content_type":"application/pdf"}],"keyword":["Applied Mathematics","Artificial Intelligence","Computational Theory and Mathematics","Computer Vision and Pattern Recognition","Software"],"quality_controlled":"1","date_published":"2023-12-01T00:00:00Z","author":[{"full_name":"Ali, Dashti","first_name":"Dashti","last_name":"Ali"},{"full_name":"Asaad, Aras","first_name":"Aras","last_name":"Asaad"},{"full_name":"Jimenez, Maria-Jose","last_name":"Jimenez","first_name":"Maria-Jose"},{"first_name":"Vidit","last_name":"Nanda","full_name":"Nanda, Vidit"},{"last_name":"Paluzo-Hidalgo","first_name":"Eduardo","full_name":"Paluzo-Hidalgo, Eduardo"},{"first_name":"Manuel","last_name":"Soriano Trigueros","orcid":"0000-0003-2449-1433","full_name":"Soriano Trigueros, Manuel","id":"15ebd7cf-15bf-11ee-aebd-bb4bb5121ea8"}],"date_updated":"2024-01-08T10:11:46Z","doi":"10.1109/tpami.2023.3308391","article_processing_charge":"Yes (in subscription journal)","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file_date_updated":"2024-01-08T10:09:14Z"},{"abstract":[{"lang":"eng","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."}],"date_created":"2024-01-08T12:43:48Z","oa_version":"Published Version","publication":"Cold Spring Harbor Perspectives in Biology","department":[{"_id":"NiBa"},{"_id":"BeVi"}],"title":"The impact of chromosomal rearrangements in speciation: From micro- to macroevolution","publisher":"Cold Spring Harbor Laboratory","citation":{"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>","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, 2023, doi:<a href=\"https://doi.org/10.1101/cshperspect.a041447\">10.1101/cshperspect.a041447</a>.","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).","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, 2023.","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, 2023. <a href=\"https://doi.org/10.1101/cshperspect.a041447\">https://doi.org/10.1101/cshperspect.a041447</a>.","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. <a href=\"https://doi.org/10.1101/cshperspect.a041447\">https://doi.org/10.1101/cshperspect.a041447</a>"},"publication_identifier":{"issn":["1943-0264"]},"oa":1,"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.","status":"public","issue":"11","external_id":{"pmid":["37604585"]},"article_type":"original","_id":"14742","year":"2023","volume":15,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","keyword":["General Biochemistry","Genetics and Molecular Biology"],"scopus_import":"1","quality_controlled":"1","author":[{"last_name":"Lucek","first_name":"Kay","full_name":"Lucek, Kay"},{"full_name":"Giménez, Mabel D.","first_name":"Mabel D.","last_name":"Giménez"},{"last_name":"Joron","first_name":"Mathieu","full_name":"Joron, Mathieu"},{"full_name":"Rafajlović, Marina","last_name":"Rafajlović","first_name":"Marina"},{"first_name":"Jeremy B.","last_name":"Searle","full_name":"Searle, Jeremy B."},{"first_name":"Nora","last_name":"Walden","full_name":"Walden, Nora"},{"id":"3C147470-F248-11E8-B48F-1D18A9856A87","full_name":"Westram, Anja M","last_name":"Westram","orcid":"0000-0003-1050-4969","first_name":"Anja M"},{"full_name":"Faria, Rui","last_name":"Faria","first_name":"Rui"}],"date_published":"2023-11-01T00:00:00Z","article_processing_charge":"No","doi":"10.1101/cshperspect.a041447","date_updated":"2024-01-08T12:52:29Z","article_number":"a041447","month":"11","language":[{"iso":"eng"}],"pmid":1,"day":"01","intvolume":"        15","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1101/cshperspect.a041447"}],"publication_status":"published"},{"page":"281-297","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference","_id":"14743","main_file_link":[{"url":"https://doi.org/10.1145/3600006.3613150","open_access":"1"}],"year":"2023","publication_status":"published","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.","oa":1,"status":"public","day":"01","citation":{"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>","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>.","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.","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>.","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.","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>"},"month":"10","publication_identifier":{"isbn":["9798400702297"]},"language":[{"iso":"eng"}],"publication":"Proceedings of the 29th Symposium on Operating Systems Principles","title":"QuePaxa: Escaping the tyranny of timeouts in consensus","department":[{"_id":"ElKo"}],"publisher":"Association for Computing Machinery","date_created":"2024-01-08T12:54:35Z","conference":{"end_date":"2023-10-26","name":"SOSP: Symposium on Operating Systems Principles","start_date":"2023-10-23","location":"Koblenz, Germany"},"oa_version":"Published Version","date_published":"2023-10-01T00:00:00Z","author":[{"last_name":"Tennage","first_name":"Pasindu","full_name":"Tennage, Pasindu"},{"full_name":"Basescu, Cristina","last_name":"Basescu","first_name":"Cristina"},{"first_name":"Eleftherios","last_name":"Kokoris Kogias","full_name":"Kokoris Kogias, Eleftherios","id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30"},{"first_name":"Ewa","last_name":"Syta","full_name":"Syta, Ewa"},{"full_name":"Jovanovic, Philipp","last_name":"Jovanovic","first_name":"Philipp"},{"full_name":"Estrada-Galinanes, Vero","first_name":"Vero","last_name":"Estrada-Galinanes"},{"first_name":"Bryan","last_name":"Ford","full_name":"Ford, Bryan"}],"article_processing_charge":"No","date_updated":"2024-02-28T12:51:24Z","doi":"10.1145/3600006.3613150","scopus_import":"1","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."}],"quality_controlled":"1"},{"keyword":["Statistics","Probability and Uncertainty","Statistics and Probability"],"scopus_import":"1","quality_controlled":"1","date_published":"2023-08-01T00:00:00Z","author":[{"last_name":"Ding","first_name":"Xiucai","full_name":"Ding, Xiucai"},{"last_name":"Ji","first_name":"Hong Chang","id":"dd216c0a-c1f9-11eb-beaf-e9ea9d2de76d","full_name":"Ji, Hong Chang"}],"article_processing_charge":"No","doi":"10.1214/22-aap1882","date_updated":"2024-01-09T08:16:41Z","month":"08","project":[{"_id":"62796744-2b32-11ec-9570-940b20777f1d","name":"Random matrices beyond Wigner-Dyson-Mehta","grant_number":"101020331","call_identifier":"H2020"}],"language":[{"iso":"eng"}],"day":"01","intvolume":"        33","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2010.16083","open_access":"1"}],"publication_status":"published","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"}],"arxiv":1,"date_created":"2024-01-08T13:03:18Z","ec_funded":1,"oa_version":"Preprint","publication":"The Annals of Applied Probability","department":[{"_id":"LaEr"}],"title":"Local laws for multiplication of random matrices","publisher":"Institute of Mathematical Statistics","citation":{"short":"X. Ding, H.C. Ji, The Annals of Applied Probability 33 (2023) 2981–3009.","ista":"Ding X, Ji HC. 2023. Local laws for multiplication of random matrices. The Annals of Applied Probability. 33(4), 2981–3009.","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>.","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>","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>","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>.","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."},"publication_identifier":{"issn":["1050-5164"]},"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.","oa":1,"status":"public","issue":"4","article_type":"original","external_id":{"arxiv":["2010.16083"]},"_id":"14750","year":"2023","volume":33,"page":"2981-3009","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article"},{"intvolume":"        69","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2101.12426"}],"publication_status":"published","language":[{"iso":"eng"}],"month":"07","day":"01","scopus_import":"1","keyword":["Computer Science Applications","Information Systems"],"quality_controlled":"1","date_published":"2023-07-01T00:00:00Z","author":[{"orcid":"0000-0002-6465-6258","last_name":"Zhang","first_name":"Yihan","id":"2ce5da42-b2ea-11eb-bba5-9f264e9d002c","full_name":"Zhang, Yihan"}],"doi":"10.1109/tit.2023.3257239","date_updated":"2024-01-09T08:45:24Z","article_processing_charge":"No","_id":"14751","year":"2023","page":"4093-4127","volume":69,"type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"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>","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>.","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.","short":"Y. Zhang, IEEE Transactions on Information Theory 69 (2023) 4093–4127.","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>"},"publication_identifier":{"issn":["0018-9448"],"eissn":["1557-9654"]},"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]","oa":1,"status":"public","article_type":"original","external_id":{"arxiv":["2101.12426"]},"issue":"7","oa_version":"Preprint","date_created":"2024-01-08T13:04:54Z","department":[{"_id":"MaMo"}],"title":"Zero-error communication over adversarial MACs","publication":"IEEE Transactions on Information Theory","publisher":"Institute of Electrical and Electronics Engineers","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."}],"arxiv":1},{"tmp":{"short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"article_number":"e2023AV000880","file_date_updated":"2024-01-09T08:51:25Z","quality_controlled":"1","keyword":["General Earth and Planetary Sciences"],"scopus_import":"1","article_processing_charge":"Yes","doi":"10.1029/2023av000880","date_updated":"2024-01-09T08:54:03Z","date_published":"2023-06-01T00:00:00Z","author":[{"first_name":"B.","last_name":"Fildier","full_name":"Fildier, B."},{"id":"f978ccb0-3f7f-11eb-b193-b0e2bd13182b","full_name":"Muller, Caroline J","last_name":"Muller","orcid":"0000-0001-5836-5350","first_name":"Caroline J"},{"first_name":"R.","last_name":"Pincus","full_name":"Pincus, R."},{"last_name":"Fueglistaler","first_name":"S.","full_name":"Fueglistaler, S."}],"file":[{"date_updated":"2024-01-09T08:51:25Z","file_id":"14761","file_size":24149551,"checksum":"af773220a9fa194c61a8dc2fae092c16","file_name":"2023_AGUAdvances_Fildier.pdf","relation":"main_file","creator":"dernst","access_level":"open_access","content_type":"application/pdf","date_created":"2024-01-09T08:51:25Z","success":1}],"publication_status":"published","intvolume":"         4","month":"06","language":[{"iso":"eng"}],"project":[{"grant_number":"805041","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"}],"ddc":["550"],"day":"01","date_created":"2024-01-08T13:07:49Z","ec_funded":1,"oa_version":"Published Version","publisher":"American Geophysical Union","publication":"AGU Advances","title":"How moisture shapes low‐level radiative cooling in subsidence regimes","department":[{"_id":"CaMu"}],"abstract":[{"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.","lang":"eng"}],"has_accepted_license":"1","year":"2023","_id":"14752","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","volume":4,"publication_identifier":{"eissn":["2576-604X"]},"citation":{"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>","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>.","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.","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>.","short":"B. Fildier, C.J. Muller, R. Pincus, S. Fueglistaler, AGU Advances 4 (2023).","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>"},"issue":"3","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.","status":"public","oa":1},{"intvolume":"       840","file":[{"success":1,"date_created":"2024-01-09T08:59:24Z","content_type":"application/pdf","creator":"dernst","access_level":"open_access","relation":"main_file","file_name":"2023_PhysicsLettersB_Faccioli.pdf","checksum":"02dec160dbc81d95985e755869d8afbf","file_size":855494,"file_id":"14762","date_updated":"2024-01-09T08:59:24Z"}],"publication_status":"published","ddc":["530"],"day":"10","month":"05","language":[{"iso":"eng"}],"file_date_updated":"2024-01-09T08:59:24Z","article_number":"137871","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"author":[{"first_name":"Pietro","last_name":"Faccioli","full_name":"Faccioli, Pietro"},{"orcid":"0000-0002-5636-9259","last_name":"Krätschmer","first_name":"Ilse","id":"30d4014e-7753-11eb-b44b-db6d61112e73","full_name":"Krätschmer, Ilse"},{"first_name":"Carlos","last_name":"Lourenço","full_name":"Lourenço, Carlos"}],"date_published":"2023-05-10T00:00:00Z","article_processing_charge":"Yes (via OA deal)","date_updated":"2024-01-09T09:02:22Z","doi":"10.1016/j.physletb.2023.137871","keyword":["Nuclear and High Energy Physics"],"scopus_import":"1","quality_controlled":"1","volume":840,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","_id":"14753","has_accepted_license":"1","year":"2023","oa":1,"status":"public","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.","article_type":"original","citation":{"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>","ista":"Faccioli P, Krätschmer I, Lourenço C. 2023. Low-pT quarkonium polarization measurements: Challenges and opportunities. Physics Letters B. 840, 137871.","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>.","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>.","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.","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>"},"publication_identifier":{"eissn":["1873-2445"],"issn":["0370-2693"]},"publication":"Physics Letters B","title":"Low-pT quarkonium polarization measurements: Challenges and opportunities","department":[{"_id":"MaRo"}],"publisher":"Elsevier","date_created":"2024-01-08T13:09:17Z","oa_version":"Published Version","abstract":[{"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.","lang":"eng"}]},{"article_type":"original","external_id":{"pmid":["36907214"]},"issue":"2246","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.","status":"public","oa":1,"publication_identifier":{"issn":["1364-503X"],"eissn":["1471-2962"]},"citation":{"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>.","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.","short":"B. Wang, F. Mellibovsky, R. Ayats López, K. Deguchi, A. Meseguer, Philosophical Transactions of the Royal Society A 381 (2023).","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>","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>","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>.","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."},"type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":381,"has_accepted_license":"1","year":"2023","_id":"14754","abstract":[{"lang":"eng","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."}],"publisher":"The Royal Society","department":[{"_id":"BjHo"}],"title":"Mean structure of the supercritical turbulent spiral in Taylor–Couette flow","publication":"Philosophical Transactions of the Royal Society A","oa_version":"Submitted Version","date_created":"2024-01-08T13:11:45Z","day":"01","ddc":["530"],"pmid":1,"language":[{"iso":"eng"}],"month":"05","publication_status":"published","file":[{"relation":"main_file","creator":"dernst","access_level":"open_access","content_type":"application/pdf","date_created":"2024-01-09T09:13:53Z","success":1,"date_updated":"2024-01-09T09:13:53Z","file_id":"14763","file_size":6421086,"checksum":"1978d126c0ce2f47c22ac20107cc0106","file_name":"2023_PhilTransactionsA_Wang_accepted.pdf"}],"intvolume":"       381","doi":"10.1098/rsta.2022.0112","date_updated":"2024-01-09T09:15:29Z","article_processing_charge":"No","date_published":"2023-05-01T00:00:00Z","author":[{"full_name":"Wang, B.","last_name":"Wang","first_name":"B."},{"full_name":"Mellibovsky, F.","last_name":"Mellibovsky","first_name":"F."},{"full_name":"Ayats López, Roger","id":"ab77522d-073b-11ed-8aff-e71b39258362","first_name":"Roger","orcid":"0000-0001-6572-0621","last_name":"Ayats López"},{"full_name":"Deguchi, K.","last_name":"Deguchi","first_name":"K."},{"last_name":"Meseguer","first_name":"A.","full_name":"Meseguer, A."}],"quality_controlled":"1","scopus_import":"1","keyword":["General Physics and Astronomy","General Engineering","General Mathematics"],"article_number":"0112","file_date_updated":"2024-01-09T09:13:53Z","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"}},{"abstract":[{"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)).","lang":"eng"}],"arxiv":1,"date_created":"2024-01-08T13:13:28Z","oa_version":"Preprint","publication":"Asymptotic Analysis","department":[{"_id":"JuFi"}],"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","publisher":"IOS Press","citation":{"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>","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.","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>.","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.","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>.","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>"},"publication_identifier":{"issn":["0921-7134"],"eissn":["1875-8576"]},"oa":1,"status":"public","acknowledgement":"The author gratefully acknowledges support through DFG, GRK 1692 “Curvature,\r\nCycles and Cohomology” during parts of the work.","issue":"3-4","article_type":"original","external_id":{"arxiv":["2105.07100"]},"_id":"14755","year":"2023","volume":131,"page":"297-383","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","keyword":["General Mathematics"],"scopus_import":"1","quality_controlled":"1","author":[{"first_name":"Maximilian","last_name":"Moser","full_name":"Moser, Maximilian","id":"a60047a9-da77-11eb-85b4-c4dc385ebb8c"}],"date_published":"2023-02-02T00:00:00Z","article_processing_charge":"No","doi":"10.3233/asy-221775","date_updated":"2024-01-09T09:22:16Z","month":"02","language":[{"iso":"eng"}],"day":"02","intvolume":"       131","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2105.07100"}],"publication_status":"published"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","volume":14,"page":"467-532","has_accepted_license":"1","year":"2023","_id":"14756","issue":"3","article_type":"original","acknowledgement":"N.C. is supported by the DFG Heisenberg Programme.\r\nWe are grateful to Tobias Dyckerhoff, Lukas Müller, Ingo Runkel, and Christopher Schommer-Pries for helpful discussions.","status":"public","oa":1,"publication_identifier":{"issn":["1663-487X"]},"citation":{"ama":"Carqueville N, Szegedy L. Fully extended r-spin TQFTs. <i>Quantum Topology</i>. 2023;14(3):467-532. doi:<a href=\"https://doi.org/10.4171/qt/193\">10.4171/qt/193</a>","mla":"Carqueville, Nils, and Lorant Szegedy. “Fully Extended R-Spin TQFTs.” <i>Quantum Topology</i>, vol. 14, no. 3, European Mathematical Society, 2023, pp. 467–532, doi:<a href=\"https://doi.org/10.4171/qt/193\">10.4171/qt/193</a>.","short":"N. Carqueville, L. Szegedy, Quantum Topology 14 (2023) 467–532.","ista":"Carqueville N, Szegedy L. 2023. Fully extended r-spin TQFTs. Quantum Topology. 14(3), 467–532.","ieee":"N. Carqueville and L. Szegedy, “Fully extended r-spin TQFTs,” <i>Quantum Topology</i>, vol. 14, no. 3. European Mathematical Society, pp. 467–532, 2023.","chicago":"Carqueville, Nils, and Lorant Szegedy. “Fully Extended R-Spin TQFTs.” <i>Quantum Topology</i>. European Mathematical Society, 2023. <a href=\"https://doi.org/10.4171/qt/193\">https://doi.org/10.4171/qt/193</a>.","apa":"Carqueville, N., &#38; Szegedy, L. (2023). Fully extended r-spin TQFTs. <i>Quantum Topology</i>. European Mathematical Society. <a href=\"https://doi.org/10.4171/qt/193\">https://doi.org/10.4171/qt/193</a>"},"publisher":"European Mathematical Society","publication":"Quantum Topology","title":"Fully extended r-spin TQFTs","department":[{"_id":"MiLe"}],"date_created":"2024-01-08T13:14:48Z","oa_version":"Published Version","abstract":[{"lang":"eng","text":"We prove the r-spin cobordism hypothesis in the setting of (weak) 2-categories for every positive integer r: the 2-groupoid of 2-dimensional fully extended r-spin TQFTs with given target is equivalent to the homotopy fixed points of an induced Spin 2r -action. In particular, such TQFTs are classified by fully dualisable objects together with a trivialisation of the rth power of their Serre automorphisms. For r=1, we recover the oriented case (on which our proof builds), while ordinary spin structures correspond to r=2.\r\nTo construct examples, we explicitly describe Spin 2r​-homotopy fixed points in the equivariant completion of any symmetric monoidal 2-category. We also show that every object in a 2-category of Landau–Ginzburg models gives rise to fully extended spin TQFTs and that half of these do not factor through the oriented bordism 2-category."}],"file":[{"file_size":707344,"checksum":"b0590aff6e7ec89cc149ba94d459d3a3","file_name":"2023_QuantumTopol_Carqueville.pdf","file_id":"14764","date_updated":"2024-01-09T09:25:34Z","content_type":"application/pdf","date_created":"2024-01-09T09:25:34Z","success":1,"relation":"main_file","creator":"dernst","access_level":"open_access"}],"publication_status":"published","intvolume":"        14","ddc":["530"],"day":"16","month":"10","language":[{"iso":"eng"}],"file_date_updated":"2024-01-09T09:25:34Z","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"article_processing_charge":"Yes","date_updated":"2024-01-09T09:27:46Z","doi":"10.4171/qt/193","date_published":"2023-10-16T00:00:00Z","author":[{"first_name":"Nils","last_name":"Carqueville","full_name":"Carqueville, Nils"},{"full_name":"Szegedy, Lorant","id":"7943226E-220E-11EA-94C7-D59F3DDC885E","first_name":"Lorant","last_name":"Szegedy","orcid":"0000-0003-2834-5054"}],"quality_controlled":"1","keyword":["Geometry and Topology","Mathematical Physics"],"scopus_import":"1"},{"intvolume":"     13966","file":[{"date_created":"2024-01-09T10:01:07Z","success":1,"content_type":"application/pdf","creator":"dernst","access_level":"open_access","relation":"main_file","checksum":"1a361d83db0244fd32c03b544c294b5a","file_name":"2023_LNCSCAV_Majumdar.pdf","file_size":405147,"date_updated":"2024-01-09T10:01:07Z","file_id":"14765"}],"publication_status":"published","month":"07","project":[{"call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093"}],"language":[{"iso":"eng"}],"ddc":["000"],"day":"16","conference":{"start_date":"2023-07-17","location":"Paris, France","end_date":"2023-07-22","name":"CAV: Computer Aided Verification"},"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file_date_updated":"2024-01-09T10:01:07Z","scopus_import":"1","quality_controlled":"1","author":[{"first_name":"Rupak","last_name":"Majumdar","full_name":"Majumdar, Rupak"},{"id":"0834ff3c-6d72-11ec-94e0-b5b0a4fb8598","full_name":"Mallik, Kaushik","orcid":"0000-0001-9864-7475","last_name":"Mallik","first_name":"Kaushik"},{"last_name":"Rychlicki","first_name":"Mateusz","full_name":"Rychlicki, Mateusz"},{"last_name":"Schmuck","first_name":"Anne-Kathrin","full_name":"Schmuck, Anne-Kathrin"},{"full_name":"Soudjani, Sadegh","first_name":"Sadegh","last_name":"Soudjani"}],"date_published":"2023-07-16T00:00:00Z","article_processing_charge":"Yes (in subscription journal)","alternative_title":["LNCS"],"related_material":{"record":[{"id":"14994","relation":"research_data","status":"public"}]},"date_updated":"2024-02-27T07:39:51Z","doi":"10.1007/978-3-031-37709-9_1","_id":"14758","year":"2023","has_accepted_license":"1","volume":13966,"page":"3-15","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference","citation":{"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>.","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.","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>","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>","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.","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>."},"publication_identifier":{"eisbn":["9783031377099"],"eissn":["1611-3349"],"issn":["0302-9743"],"isbn":["9783031377082"]},"status":"public","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.","oa":1,"ec_funded":1,"date_created":"2024-01-08T13:18:00Z","oa_version":"Published Version","publication":"35th International Conference on Computer Aided Verification","title":"A flexible toolchain for symbolic rabin games under fair and stochastic uncertainties","department":[{"_id":"ToHe"}],"publisher":"Springer Nature","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"}]},{"abstract":[{"lang":"eng","text":"Proper operation of electro-optic I/Q modulators relies on precise adjustment and control of the relative phase biases between the modulator’s internal interferometer arms. We present an all-analog phase bias locking scheme where error signals are obtained from the beat between the optical carrier and optical tones generated by an auxiliary 2 MHz 𝑅𝐹 tone to lock the phases of all three involved interferometers for operation up to 10 GHz. With the developed method, we demonstrate an I/Q modulator in carrier-suppressed single-sideband mode, where the suppressed carrier and sideband are locked at optical power levels <−27dB\r\n relative to the transmitted sideband. We describe a simple analytical model for calculating the error signals and detail the implementation of the electronic circuitry for the implementation of the method."}],"arxiv":1,"oa_version":"Preprint","date_created":"2024-01-08T13:19:14Z","publisher":"Optica Publishing Group","department":[{"_id":"OnHo"}],"title":"Analog stabilization of an electro-optic I/Q modulator with an auxiliary modulation tone","publication":"Applied Optics","publication_identifier":{"issn":["1559-128X"],"eissn":["2155-3165"]},"citation":{"ista":"Wald S, Diorico FR, Hosten O. 2023. Analog stabilization of an electro-optic I/Q modulator with an auxiliary modulation tone. Applied Optics. 62(1), 1–7.","short":"S. Wald, F.R. Diorico, O. Hosten, Applied Optics 62 (2023) 1–7.","mla":"Wald, Sebastian, et al. “Analog Stabilization of an Electro-Optic I/Q Modulator with an Auxiliary Modulation Tone.” <i>Applied Optics</i>, vol. 62, no. 1, Optica Publishing Group, 2023, pp. 1–7, doi:<a href=\"https://doi.org/10.1364/ao.474118\">10.1364/ao.474118</a>.","ama":"Wald S, Diorico FR, Hosten O. Analog stabilization of an electro-optic I/Q modulator with an auxiliary modulation tone. <i>Applied Optics</i>. 2023;62(1):1-7. doi:<a href=\"https://doi.org/10.1364/ao.474118\">10.1364/ao.474118</a>","apa":"Wald, S., Diorico, F. R., &#38; Hosten, O. (2023). Analog stabilization of an electro-optic I/Q modulator with an auxiliary modulation tone. <i>Applied Optics</i>. Optica Publishing Group. <a href=\"https://doi.org/10.1364/ao.474118\">https://doi.org/10.1364/ao.474118</a>","chicago":"Wald, Sebastian, Fritz R Diorico, and Onur Hosten. “Analog Stabilization of an Electro-Optic I/Q Modulator with an Auxiliary Modulation Tone.” <i>Applied Optics</i>. Optica Publishing Group, 2023. <a href=\"https://doi.org/10.1364/ao.474118\">https://doi.org/10.1364/ao.474118</a>.","ieee":"S. Wald, F. R. Diorico, and O. Hosten, “Analog stabilization of an electro-optic I/Q modulator with an auxiliary modulation tone,” <i>Applied Optics</i>, vol. 62, no. 1. Optica Publishing Group, pp. 1–7, 2023."},"external_id":{"arxiv":["2208.11591"]},"article_type":"original","issue":"1","oa":1,"status":"public","acknowledgement":"We thank Jakob Vorlaufer for technical contributions and Vyacheslav Li and Sofia Agafonova for comments on the manuscript.","year":"2023","_id":"14759","type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"1-7","volume":62,"quality_controlled":"1","scopus_import":"1","keyword":["Atomic and Molecular Physics","and Optics","Engineering (miscellaneous)","Electrical and Electronic Engineering"],"doi":"10.1364/ao.474118","date_updated":"2024-01-09T10:10:34Z","article_processing_charge":"No","date_published":"2023-01-01T00:00:00Z","author":[{"last_name":"Wald","orcid":"0000-0002-5869-1604","first_name":"Sebastian","id":"133F200A-B015-11E9-AD41-0EDAE5697425","full_name":"Wald, Sebastian"},{"orcid":"0000-0002-4947-8924","last_name":"Diorico","first_name":"Fritz R","id":"2E054C4C-F248-11E8-B48F-1D18A9856A87","full_name":"Diorico, Fritz R"},{"first_name":"Onur","last_name":"Hosten","orcid":"0000-0002-2031-204X","full_name":"Hosten, Onur","id":"4C02D85E-F248-11E8-B48F-1D18A9856A87"}],"language":[{"iso":"eng"}],"month":"01","day":"01","publication_status":"published","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2208.11591","open_access":"1"}],"intvolume":"        62"},{"publication_identifier":{"eisbn":["9798350318944"]},"citation":{"short":"V. Cohen-Addad, D. Saulpic, C. Schwiegelshohn, in:, 2023 IEEE 64th Annual Symposium on Foundations of Computer Science, IEEE, 2023, pp. 1105–1130.","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: Symposium on Foundations of Computer Science, 1105–1130.","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>.","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>","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.","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>."},"external_id":{"arxiv":["2310.04076"]},"oa":1,"status":"public","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.","year":"2023","_id":"14768","type":"conference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"1105-1130","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"}],"arxiv":1,"oa_version":"Preprint","date_created":"2024-01-09T16:20:09Z","ec_funded":1,"publisher":"IEEE","title":"Deterministic clustering in high dimensional spaces: Sketches and approximation","department":[{"_id":"MoHe"}],"publication":"2023 IEEE 64th Annual Symposium on Foundations of Computer Science","project":[{"call_identifier":"H2020","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","grant_number":"101034413","name":"IST-BRIDGE: International postdoctoral program"},{"_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","grant_number":"101019564","name":"The design and evaluation of modern fully dynamic data structures","call_identifier":"H2020"}],"language":[{"iso":"eng"}],"month":"12","day":"22","publication_status":"published","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2310.04076","open_access":"1"}],"quality_controlled":"1","scopus_import":"1","doi":"10.1109/focs57990.2023.00066","date_updated":"2024-01-16T07:28:06Z","article_processing_charge":"No","date_published":"2023-12-22T00:00:00Z","author":[{"full_name":"Cohen-Addad, Vincent","last_name":"Cohen-Addad","first_name":"Vincent"},{"id":"f8e48cf0-b0ff-11ed-b0e9-b4c35598f964","full_name":"Saulpic, David","last_name":"Saulpic","first_name":"David"},{"full_name":"Schwiegelshohn, Chris","last_name":"Schwiegelshohn","first_name":"Chris"}],"conference":{"location":"Santa Cruz, CA, United States","start_date":"2023-11-06","name":"FOCS: Symposium on Foundations of Computer Science","end_date":"2023-11-09"}},{"year":"2023","_id":"14771","type":"conference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"24364-24373","publication_identifier":{"eissn":["2575-7075"],"eisbn":["9798350301298"]},"citation":{"ama":"Iofinova EB, Peste E-A, Alistarh D-A. Bias in pruned vision models: In-depth analysis and countermeasures. In: <i>2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition</i>. IEEE; 2023:24364-24373. doi:<a href=\"https://doi.org/10.1109/cvpr52729.2023.02334\">10.1109/cvpr52729.2023.02334</a>","short":"E.B. Iofinova, E.-A. Peste, D.-A. Alistarh, in:, 2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition, IEEE, 2023, pp. 24364–24373.","mla":"Iofinova, Eugenia B., et al. “Bias in Pruned Vision Models: In-Depth Analysis and Countermeasures.” <i>2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition</i>, IEEE, 2023, pp. 24364–73, doi:<a href=\"https://doi.org/10.1109/cvpr52729.2023.02334\">10.1109/cvpr52729.2023.02334</a>.","ista":"Iofinova EB, Peste E-A, Alistarh D-A. 2023. Bias in pruned vision models: In-depth analysis and countermeasures. 2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition. CVPR: Conference on Computer Vision and Pattern Recognition, 24364–24373.","chicago":"Iofinova, Eugenia B, Elena-Alexandra Peste, and Dan-Adrian Alistarh. “Bias in Pruned Vision Models: In-Depth Analysis and Countermeasures.” In <i>2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition</i>, 24364–73. IEEE, 2023. <a href=\"https://doi.org/10.1109/cvpr52729.2023.02334\">https://doi.org/10.1109/cvpr52729.2023.02334</a>.","ieee":"E. B. Iofinova, E.-A. Peste, and D.-A. Alistarh, “Bias in pruned vision models: In-depth analysis and countermeasures,” in <i>2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition</i>, Vancouver, BC, Canada, 2023, pp. 24364–24373.","apa":"Iofinova, E. B., Peste, E.-A., &#38; Alistarh, D.-A. (2023). Bias in pruned vision models: In-depth analysis and countermeasures. In <i>2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition</i> (pp. 24364–24373). Vancouver, BC, Canada: IEEE. <a href=\"https://doi.org/10.1109/cvpr52729.2023.02334\">https://doi.org/10.1109/cvpr52729.2023.02334</a>"},"external_id":{"arxiv":["2304.12622"],"isi":["001062531308068"]},"oa":1,"status":"public","acknowledgement":"The authors would like to sincerely thank Sara Hooker for her feedback during the development of this work. EI was supported in part by the FWF DK VGSCO, grant agreement number W1260-N35. AP and DA acknowledge generous ERC support, via Starting Grant 805223 ScaleML.","oa_version":"Preprint","date_created":"2024-01-10T08:42:40Z","ec_funded":1,"publisher":"IEEE","title":"Bias in pruned vision models: In-depth analysis and countermeasures","department":[{"_id":"DaAl"},{"_id":"ChLa"}],"publication":"2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition","abstract":[{"text":"Pruning—that is, setting a significant subset of the parameters of a neural network to zero—is one of the most popular methods of model compression. Yet, several recent works have raised the issue that pruning may induce or exacerbate bias in the output of the compressed model. Despite existing evidence for this phenomenon, the relationship between neural network pruning and induced bias is not well-understood. In this work, we systematically investigate and characterize this phenomenon in Convolutional Neural Networks for computer vision. First, we show that it is in fact possible to obtain highly-sparse models, e.g. with less than 10% remaining weights, which do not decrease in accuracy nor substantially increase in bias when compared to dense models. At the same time, we also find that, at higher sparsities, pruned models exhibit higher uncertainty in their outputs, as well as increased correlations, which we directly link to increased bias. We propose easy-to-use criteria which, based only on the uncompressed model, establish whether bias will increase with pruning, and identify the samples most susceptible to biased predictions post-compression. Our code can be found at https://github.com/IST-DASLab/pruned-vision-model-bias.","lang":"eng"}],"arxiv":1,"publication_status":"published","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2304.12622"}],"language":[{"iso":"eng"}],"project":[{"grant_number":" W1260-N35","name":"Vienna Graduate School on Computational Optimization","_id":"9B9290DE-BA93-11EA-9121-9846C619BF3A"},{"call_identifier":"H2020","_id":"268A44D6-B435-11E9-9278-68D0E5697425","grant_number":"805223","name":"Elastic Coordination for Scalable Machine Learning"}],"month":"08","isi":1,"day":"22","conference":{"end_date":"2023-06-24","name":"CVPR: Conference on Computer Vision and Pattern Recognition","start_date":"2023-06-17","location":"Vancouver, BC, Canada"},"quality_controlled":"1","related_material":{"link":[{"relation":"software","url":"https://github.com/IST-DASLab/pruned-vision-model-bias"}]},"date_updated":"2024-01-10T08:59:26Z","doi":"10.1109/cvpr52729.2023.02334","article_processing_charge":"No","author":[{"first_name":"Eugenia B","last_name":"Iofinova","orcid":"0000-0002-7778-3221","full_name":"Iofinova, Eugenia B","id":"f9a17499-f6e0-11ea-865d-fdf9a3f77117"},{"first_name":"Elena-Alexandra","last_name":"Peste","full_name":"Peste, Elena-Alexandra","id":"32D78294-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian","last_name":"Alistarh","orcid":"0000-0003-3650-940X"}],"date_published":"2023-08-22T00:00:00Z"},{"file_date_updated":"2024-01-10T11:23:57Z","article_number":"110146","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_published":"2023-12-01T00:00:00Z","author":[{"id":"673cd0cc-9b9a-11eb-b144-88f30e1fbb72","full_name":"Agresti, Antonio","last_name":"Agresti","orcid":"0000-0002-9573-2962","first_name":"Antonio"},{"first_name":"Amru","last_name":"Hussein","full_name":"Hussein, Amru"}],"date_updated":"2024-01-10T11:24:56Z","doi":"10.1016/j.jfa.2023.110146","article_processing_charge":"Yes (in subscription journal)","scopus_import":"1","keyword":["Analysis"],"quality_controlled":"1","intvolume":"       285","publication_status":"published","file":[{"success":1,"date_created":"2024-01-10T11:23:57Z","content_type":"application/pdf","creator":"dernst","access_level":"open_access","relation":"main_file","file_name":"2023_JourFunctionalAnalysis_Agresti.pdf","checksum":"eda98ca2aa73da91bd074baed34c2b3c","file_size":1120592,"date_updated":"2024-01-10T11:23:57Z","file_id":"14789"}],"day":"01","ddc":["510"],"language":[{"iso":"eng"}],"month":"12","isi":1,"title":"Maximal Lp-regularity and H∞-calculus for block operator matrices and applications","department":[{"_id":"JuFi"}],"publication":"Journal of Functional Analysis","publisher":"Elsevier","oa_version":"Published Version","date_created":"2024-01-10T09:15:18Z","arxiv":1,"abstract":[{"lang":"eng","text":"Many coupled evolution equations can be described via 2×2-block operator matrices of the form A=[ \r\nA\tB\r\nC\tD\r\n ] in a product space X=X1×X2 with possibly unbounded entries. Here, the case of diagonally dominant block operator matrices is considered, that is, the case where the full operator A can be seen as a relatively bounded perturbation of its diagonal part with D(A)=D(A)×D(D) though with possibly large relative bound. For such operators the properties of sectoriality, R-sectoriality and the boundedness of the H∞-calculus are studied, and for these properties perturbation results for possibly large but structured perturbations are derived. Thereby, the time dependent parabolic problem associated with A can be analyzed in maximal Lpt\r\n-regularity spaces, and this is applied to a wide range of problems such as different theories for liquid crystals, an artificial Stokes system, strongly damped wave and plate equations, and a Keller-Segel model."}],"volume":285,"type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"14772","year":"2023","has_accepted_license":"1","oa":1,"status":"public","acknowledgement":"We would like to thank Tim Binz, Emiel Lorist and Mark Veraar for valuable discussions. We also thank the anonymous referees for their helpful comments and suggestions, and for the very accurate reading of the manuscript.\r\nThe first author has been supported partially by the Nachwuchsring – Network for the promotion of young scientists – at TU Kaiserslautern. Both authors have been supported by MathApp – Mathematics Applied to Real-World Problems - part of the Research Initiative of the Federal State of Rhineland-Palatinate, Germany.","article_type":"original","external_id":{"arxiv":["2108.01962"],"isi":["001081809000001"]},"issue":"11","citation":{"ama":"Agresti A, Hussein A. Maximal Lp-regularity and H∞-calculus for block operator matrices and applications. <i>Journal of Functional Analysis</i>. 2023;285(11). doi:<a href=\"https://doi.org/10.1016/j.jfa.2023.110146\">10.1016/j.jfa.2023.110146</a>","ista":"Agresti A, Hussein A. 2023. Maximal Lp-regularity and H∞-calculus for block operator matrices and applications. Journal of Functional Analysis. 285(11), 110146.","short":"A. Agresti, A. Hussein, Journal of Functional Analysis 285 (2023).","mla":"Agresti, Antonio, and Amru Hussein. “Maximal Lp-Regularity and H∞-Calculus for Block Operator Matrices and Applications.” <i>Journal of Functional Analysis</i>, vol. 285, no. 11, 110146, Elsevier, 2023, doi:<a href=\"https://doi.org/10.1016/j.jfa.2023.110146\">10.1016/j.jfa.2023.110146</a>.","ieee":"A. Agresti and A. Hussein, “Maximal Lp-regularity and H∞-calculus for block operator matrices and applications,” <i>Journal of Functional Analysis</i>, vol. 285, no. 11. Elsevier, 2023.","chicago":"Agresti, Antonio, and Amru Hussein. “Maximal Lp-Regularity and H∞-Calculus for Block Operator Matrices and Applications.” <i>Journal of Functional Analysis</i>. Elsevier, 2023. <a href=\"https://doi.org/10.1016/j.jfa.2023.110146\">https://doi.org/10.1016/j.jfa.2023.110146</a>.","apa":"Agresti, A., &#38; Hussein, A. (2023). Maximal Lp-regularity and H∞-calculus for block operator matrices and applications. <i>Journal of Functional Analysis</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jfa.2023.110146\">https://doi.org/10.1016/j.jfa.2023.110146</a>"},"publication_identifier":{"issn":["0022-1236"]}}]
