[{"ec_funded":1,"project":[{"name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","grant_number":"715767","call_identifier":"H2020","_id":"24F9549A-B435-11E9-9278-68D0E5697425"}],"file_date_updated":"2022-03-27T17:34:11Z","doi":"10.1111/cgf.14490","month":"05","acknowledgement":"This work was supported by the Research Grants Council of the Hong Kong Special Administrative Region, China [Project No.: CUHK 14201921] and the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 715767 – MATERIALIZABLE). We thank the anonymous reviewers for their insightful feedback; Christian Hafner for proofreading and discussions; Ziqi Wang,\r\nHaisen Zhao, and Martin Hafskjold Thoresen for the helpful discussions; and the Miba Machine Shop at IST Austria for 3D printing the BUNNY and BOOMERANG models.","ddc":["000"],"external_id":{"isi":["000802723900039"]},"quality_controlled":"1","publication_identifier":{"issn":["0167-7055"],"eissn":["1467-8659"]},"file":[{"file_id":"10923","relation":"main_file","date_created":"2022-03-27T17:34:11Z","file_name":"paper.pdf","access_level":"open_access","file_size":19601689,"content_type":"application/pdf","checksum":"b62188b07f5c000f1638c782ec92da41","date_updated":"2022-03-27T17:34:11Z","creator":"bbickel"}],"status":"public","day":"01","publication_status":"published","publisher":"Wiley","volume":41,"publication":"Computer Graphics Forum","oa":1,"isi":1,"issue":"2","type":"journal_article","oa_version":"Submitted Version","date_created":"2022-03-27T17:34:17Z","acknowledged_ssus":[{"_id":"M-Shop"}],"language":[{"iso":"eng"}],"has_accepted_license":"1","_id":"10922","date_updated":"2025-04-14T07:28:57Z","abstract":[{"text":"We study structural rigidity for assemblies with mechanical joints. Existing methods identify whether an assembly is structurally rigid by assuming parts are perfectly rigid. Yet, an assembly identified as rigid may not be that “rigid” in practice, and existing methods cannot quantify how rigid an assembly is. We address this limitation by developing a new measure, worst-case rigidity, to quantify the rigidity of an assembly as the largest possible deformation that the assembly undergoes for arbitrary external loads of fixed magnitude. Computing worst-case rigidity is non-trivial due to non-rigid parts and different joint types. We thus formulate a new computational approach by encoding parts and their connections into a stiffness matrix, in which parts are modeled as deformable objects and joints as soft constraints. Based on this, we formulate worst-case rigidity analysis as an optimization that seeks the worst-case deformation of an assembly for arbitrary external loads, and solve the optimization problem via an eigenanalysis. Furthermore, we present methods to optimize the geometry and topology of various assemblies to enhance their rigidity, as guided by our rigidity measure. In the end, we validate our method on a variety of assembly structures with physical experiments and demonstrate its effectiveness by designing and fabricating several structurally rigid assemblies.","lang":"eng"}],"citation":{"apa":"Liu, Z., Hu, J., Xu, H., Song, P., Zhang, R., Bickel, B., &#38; Fu, C.-W. (2022). Worst-case rigidity analysis and optimization for assemblies with mechanical joints. <i>Computer Graphics Forum</i>. Wiley. <a href=\"https://doi.org/10.1111/cgf.14490\">https://doi.org/10.1111/cgf.14490</a>","mla":"Liu, Zhenyuan, et al. “Worst-Case Rigidity Analysis and Optimization for Assemblies with Mechanical Joints.” <i>Computer Graphics Forum</i>, vol. 41, no. 2, Wiley, 2022, pp. 507–19, doi:<a href=\"https://doi.org/10.1111/cgf.14490\">10.1111/cgf.14490</a>.","short":"Z. Liu, J. Hu, H. Xu, P. Song, R. Zhang, B. Bickel, C.-W. Fu, Computer Graphics Forum 41 (2022) 507–519.","ieee":"Z. Liu <i>et al.</i>, “Worst-case rigidity analysis and optimization for assemblies with mechanical joints,” <i>Computer Graphics Forum</i>, vol. 41, no. 2. Wiley, pp. 507–519, 2022.","ama":"Liu Z, Hu J, Xu H, et al. Worst-case rigidity analysis and optimization for assemblies with mechanical joints. <i>Computer Graphics Forum</i>. 2022;41(2):507-519. doi:<a href=\"https://doi.org/10.1111/cgf.14490\">10.1111/cgf.14490</a>","chicago":"Liu, Zhenyuan, Jingyu Hu, Hao Xu, Peng Song, Ran Zhang, Bernd Bickel, and Chi-Wing Fu. “Worst-Case Rigidity Analysis and Optimization for Assemblies with Mechanical Joints.” <i>Computer Graphics Forum</i>. Wiley, 2022. <a href=\"https://doi.org/10.1111/cgf.14490\">https://doi.org/10.1111/cgf.14490</a>.","ista":"Liu Z, Hu J, Xu H, Song P, Zhang R, Bickel B, Fu C-W. 2022. Worst-case rigidity analysis and optimization for assemblies with mechanical joints. Computer Graphics Forum. 41(2), 507–519."},"department":[{"_id":"BeBi"}],"page":"507-519","date_published":"2022-05-01T00:00:00Z","article_type":"original","intvolume":"        41","author":[{"id":"70f0d7cf-ae65-11ec-a14f-89dfc5505b19","full_name":"Liu, Zhenyuan","first_name":"Zhenyuan","orcid":"0000-0001-9200-5690","last_name":"Liu"},{"last_name":"Hu","first_name":"Jingyu","full_name":"Hu, Jingyu"},{"full_name":"Xu, Hao","last_name":"Xu","first_name":"Hao"},{"full_name":"Song, Peng","first_name":"Peng","last_name":"Song"},{"full_name":"Zhang, Ran","first_name":"Ran","last_name":"Zhang"},{"id":"49876194-F248-11E8-B48F-1D18A9856A87","full_name":"Bickel, Bernd","last_name":"Bickel","orcid":"0000-0001-6511-9385","first_name":"Bernd"},{"last_name":"Fu","first_name":"Chi-Wing","full_name":"Fu, Chi-Wing"}],"article_processing_charge":"No","year":"2022","scopus_import":"1","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","title":"Worst-case rigidity analysis and optimization for assemblies with mechanical joints"},{"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","title":"On the wavenumber-frequency spectrum of the wall pressure fluctuations in turbulent channel flow","scopus_import":"1","author":[{"full_name":"Yang, Bowen","id":"71b6ff4b-15b2-11ec-abd3-aef6b028cf7e","first_name":"Bowen","orcid":"0000-0002-4843-6853","last_name":"Yang"},{"full_name":"Yang, Zixuan","first_name":"Zixuan","last_name":"Yang"}],"intvolume":"       937","article_type":"original","year":"2022","article_processing_charge":"No","citation":{"ama":"Yang B, Yang Z. On the wavenumber-frequency spectrum of the wall pressure fluctuations in turbulent channel flow. <i>Journal of Fluid Mechanics</i>. 2022;937. doi:<a href=\"https://doi.org/10.1017/jfm.2022.137\">10.1017/jfm.2022.137</a>","ieee":"B. Yang and Z. Yang, “On the wavenumber-frequency spectrum of the wall pressure fluctuations in turbulent channel flow,” <i>Journal of Fluid Mechanics</i>, vol. 937. Cambridge University Press, 2022.","ista":"Yang B, Yang Z. 2022. On the wavenumber-frequency spectrum of the wall pressure fluctuations in turbulent channel flow. Journal of Fluid Mechanics. 937, A39.","chicago":"Yang, Bowen, and Zixuan Yang. “On the Wavenumber-Frequency Spectrum of the Wall Pressure Fluctuations in Turbulent Channel Flow.” <i>Journal of Fluid Mechanics</i>. Cambridge University Press, 2022. <a href=\"https://doi.org/10.1017/jfm.2022.137\">https://doi.org/10.1017/jfm.2022.137</a>.","mla":"Yang, Bowen, and Zixuan Yang. “On the Wavenumber-Frequency Spectrum of the Wall Pressure Fluctuations in Turbulent Channel Flow.” <i>Journal of Fluid Mechanics</i>, vol. 937, A39, Cambridge University Press, 2022, doi:<a href=\"https://doi.org/10.1017/jfm.2022.137\">10.1017/jfm.2022.137</a>.","short":"B. Yang, Z. Yang, Journal of Fluid Mechanics 937 (2022).","apa":"Yang, B., &#38; Yang, Z. (2022). On the wavenumber-frequency spectrum of the wall pressure fluctuations in turbulent channel flow. <i>Journal of Fluid Mechanics</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/jfm.2022.137\">https://doi.org/10.1017/jfm.2022.137</a>"},"department":[{"_id":"GradSch"}],"date_published":"2022-04-25T00:00:00Z","_id":"10925","date_updated":"2023-08-03T06:20:26Z","abstract":[{"text":"Direct numerical simulations (DNS) of turbulent channel flows up to  Reτ≈1000  are conducted to investigate the three-dimensional (consisting of streamwise wavenumber, spanwise wavenumber and frequency) spectrum of wall pressure fluctuations. To develop a predictive model of the wavenumber–frequency spectrum from the wavenumber spectrum, the time decorrelation mechanisms of wall pressure fluctuations are investigated. It is discovered that the energy-containing part of the wavenumber–frequency spectrum of wall pressure fluctuations can be well predicted using a similar random sweeping model for streamwise velocity fluctuations. To refine the investigation, we further decompose the spectrum of the total wall pressure fluctuations into the autospectra of rapid and slow pressure fluctuations, and the cross-spectrum between them. We focus on evaluating the assumption applied in many predictive models, that is, the magnitude of the cross-spectrum is negligibly small. The present DNS shows that neglecting the cross-spectrum causes a maximum error up to 4.7 dB in the subconvective region for all Reynolds numbers under test. Our analyses indicate that the approximation of neglecting the cross-spectrum needs to be applied carefully in the investigations of acoustics at low Mach numbers, in which the subconvective components of wall pressure fluctuations make important contributions to the radiated acoustic power.","lang":"eng"}],"language":[{"iso":"eng"}],"oa":1,"isi":1,"oa_version":"Published Version","date_created":"2022-03-27T22:01:45Z","type":"journal_article","article_number":"A39","day":"25","status":"public","arxiv":1,"publication_identifier":{"issn":["0022-1120"],"eissn":["1469-7645"]},"publication":"Journal of Fluid Mechanics","volume":937,"publisher":"Cambridge University Press","publication_status":"published","quality_controlled":"1","external_id":{"isi":["000763547000001"],"arxiv":["2201.04702"]},"acknowledgement":"This research is supported by the NSFC Basic Science Center Program for ‘Multiscale Problems in Nonlinear Mechanics’ (no. 11988102), National Key Project (GJXM92579) and the Strategic Priority Research Program (XDB22040104).","doi":"10.1017/jfm.2022.137","month":"04","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1017/jfm.2022.137"}]},{"main_file_link":[{"url":"https://eprints.whiterose.ac.uk/187332/","open_access":"1"}],"month":"03","doi":"10.1093/mollus/eyab049","external_id":{"isi":["000759081600002"]},"quality_controlled":"1","publication_status":"published","publisher":"Oxford University Press","volume":88,"publication":"Journal of Molluscan Studies","publication_identifier":{"eissn":["1464-3766"],"issn":["0260-1230"]},"status":"public","day":"01","article_number":"eyab049","type":"journal_article","date_created":"2022-03-27T22:01:46Z","oa_version":"Submitted Version","isi":1,"oa":1,"issue":"1","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"Conflict over reproduction between females and males exists because of anisogamy and promiscuity. Together they generate differences in fitness optima between the sexes and result in antagonistic coevolution of female and male reproductive traits. Mounting duration is likely to be a compromise between male and female interests whose outcome depends on the intensity of sexual selection. The timing of sperm transfer during mounting is critical. For example, mountings may be interrupted before sperm is transferred as a consequence of female or male choice, or they may be prolonged to function as mate guarding. In the highly promiscuous intertidal snail Littorina saxatilis, mountings vary substantially in duration, from less than a minute to more than an hour, and it has been assumed that mountings of a few minutes do not result in any sperm being transferred. Here, we examined the timing of sperm transfer, a reproductive trait that is likely affected by sexual conflict. We performed time-controlled mounting trials using L. saxatilis males and virgin females, aiming to examine indirectly when the transfer of sperm starts. We observed the relationship between mounting duration and the proportion of developing embryos out of all eggs and embryos in the brood pouch. Developing embryos were observed in similar proportions in all treatments (i.e. 1, 5 and 10 or more minutes at which mountings were artificially interrupted), suggesting that sperm transfer begins rapidly (within 1 min) in L. saxatilis and very short matings do not result in sperm shortage in the females. We discuss how the observed pattern can be influenced by predation risk, population density, and female status and receptivity."}],"_id":"10926","date_updated":"2025-05-14T11:05:28Z","citation":{"ista":"Perini S, Butlin R, Westram AM, Johannesson K. 2022. Very short mountings are enough for sperm transfer in Littorina saxatilis. Journal of Molluscan Studies. 88(1), eyab049.","chicago":"Perini, Samuel, Rogerk Butlin, Anja M Westram, and Kerstin Johannesson. “Very Short Mountings Are Enough for Sperm Transfer in Littorina Saxatilis.” <i>Journal of Molluscan Studies</i>. Oxford University Press, 2022. <a href=\"https://doi.org/10.1093/mollus/eyab049\">https://doi.org/10.1093/mollus/eyab049</a>.","ieee":"S. Perini, R. Butlin, A. M. Westram, and K. Johannesson, “Very short mountings are enough for sperm transfer in Littorina saxatilis,” <i>Journal of Molluscan Studies</i>, vol. 88, no. 1. Oxford University Press, 2022.","ama":"Perini S, Butlin R, Westram AM, Johannesson K. Very short mountings are enough for sperm transfer in Littorina saxatilis. <i>Journal of Molluscan Studies</i>. 2022;88(1). doi:<a href=\"https://doi.org/10.1093/mollus/eyab049\">10.1093/mollus/eyab049</a>","short":"S. Perini, R. Butlin, A.M. Westram, K. Johannesson, Journal of Molluscan Studies 88 (2022).","mla":"Perini, Samuel, et al. “Very Short Mountings Are Enough for Sperm Transfer in Littorina Saxatilis.” <i>Journal of Molluscan Studies</i>, vol. 88, no. 1, eyab049, Oxford University Press, 2022, doi:<a href=\"https://doi.org/10.1093/mollus/eyab049\">10.1093/mollus/eyab049</a>.","apa":"Perini, S., Butlin, R., Westram, A. M., &#38; Johannesson, K. (2022). Very short mountings are enough for sperm transfer in Littorina saxatilis. <i>Journal of Molluscan Studies</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/mollus/eyab049\">https://doi.org/10.1093/mollus/eyab049</a>"},"date_published":"2022-03-01T00:00:00Z","department":[{"_id":"BeVi"}],"article_processing_charge":"No","year":"2022","article_type":"original","intvolume":"        88","author":[{"full_name":"Perini, Samuel","first_name":"Samuel","last_name":"Perini"},{"first_name":"Rogerk","last_name":"Butlin","full_name":"Butlin, Rogerk"},{"first_name":"Anja M","orcid":"0000-0003-1050-4969","last_name":"Westram","full_name":"Westram, Anja M","id":"3C147470-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Johannesson, Kerstin","last_name":"Johannesson","first_name":"Kerstin"}],"scopus_import":"1","title":"Very short mountings are enough for sperm transfer in Littorina saxatilis","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"article_processing_charge":"No","year":"2022","related_material":{"link":[{"relation":"software","url":"https://github.com/ctlab/parallel-rearrangements"}]},"article_type":"original","intvolume":"        38","author":[{"last_name":"Zabelkin","first_name":"Alexey","full_name":"Zabelkin, Alexey"},{"last_name":"Yakovleva","first_name":"Yulia","full_name":"Yakovleva, Yulia"},{"id":"C4558D3C-6102-11E9-A62E-F418E6697425","full_name":"Bochkareva, Olga","first_name":"Olga","orcid":"0000-0003-1006-6639","last_name":"Bochkareva"},{"full_name":"Alexeev, Nikita","last_name":"Alexeev","first_name":"Nikita"}],"scopus_import":"1","title":"PaReBrick: PArallel REarrangements and BReaks identification toolkit","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","oa_version":"Published Version","date_created":"2022-03-27T22:01:46Z","isi":1,"oa":1,"issue":"2","language":[{"iso":"eng"}],"has_accepted_license":"1","date_updated":"2025-05-14T11:05:09Z","_id":"10927","abstract":[{"lang":"eng","text":"Motivation\r\nHigh plasticity of bacterial genomes is provided by numerous mechanisms including horizontal gene transfer and recombination via numerous flanking repeats. Genome rearrangements such as inversions, deletions, insertions and duplications may independently occur in different strains, providing parallel adaptation or phenotypic diversity. Specifically, such rearrangements might be responsible for virulence, antibiotic resistance and antigenic variation. However, identification of such events requires laborious manual inspection and verification of phyletic pattern consistency.\r\nResults\r\nHere, we define the term ‘parallel rearrangements’ as events that occur independently in phylogenetically distant bacterial strains and present a formalization of the problem of parallel rearrangements calling. We implement an algorithmic solution for the identification of parallel rearrangements in bacterial populations as a tool PaReBrick. The tool takes a collection of strains represented as a sequence of oriented synteny blocks and a phylogenetic tree as input data. It identifies rearrangements, tests them for consistency with a tree, and sorts the events by their parallelism score. The tool provides diagrams of the neighbors for each block of interest, allowing the detection of horizontally transferred blocks or their extra copies and the inversions in which copied blocks are involved. We demonstrated PaReBrick’s efficiency and accuracy and showed its potential to detect genome rearrangements responsible for pathogenicity and adaptation in bacterial genomes."}],"date_published":"2022-01-15T00:00:00Z","citation":{"ama":"Zabelkin A, Yakovleva Y, Bochkareva O, Alexeev N. PaReBrick: PArallel REarrangements and BReaks identification toolkit. <i>Bioinformatics</i>. 2022;38(2):357-363. doi:<a href=\"https://doi.org/10.1093/bioinformatics/btab691\">10.1093/bioinformatics/btab691</a>","ieee":"A. Zabelkin, Y. Yakovleva, O. Bochkareva, and N. Alexeev, “PaReBrick: PArallel REarrangements and BReaks identification toolkit,” <i>Bioinformatics</i>, vol. 38, no. 2. Oxford University Press, pp. 357–363, 2022.","chicago":"Zabelkin, Alexey, Yulia Yakovleva, Olga Bochkareva, and Nikita Alexeev. “PaReBrick: PArallel REarrangements and BReaks Identification Toolkit.” <i>Bioinformatics</i>. Oxford University Press, 2022. <a href=\"https://doi.org/10.1093/bioinformatics/btab691\">https://doi.org/10.1093/bioinformatics/btab691</a>.","ista":"Zabelkin A, Yakovleva Y, Bochkareva O, Alexeev N. 2022. PaReBrick: PArallel REarrangements and BReaks identification toolkit. Bioinformatics. 38(2), 357–363.","apa":"Zabelkin, A., Yakovleva, Y., Bochkareva, O., &#38; Alexeev, N. (2022). PaReBrick: PArallel REarrangements and BReaks identification toolkit. <i>Bioinformatics</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/bioinformatics/btab691\">https://doi.org/10.1093/bioinformatics/btab691</a>","mla":"Zabelkin, Alexey, et al. “PaReBrick: PArallel REarrangements and BReaks Identification Toolkit.” <i>Bioinformatics</i>, vol. 38, no. 2, Oxford University Press, 2022, pp. 357–63, doi:<a href=\"https://doi.org/10.1093/bioinformatics/btab691\">10.1093/bioinformatics/btab691</a>.","short":"A. Zabelkin, Y. Yakovleva, O. Bochkareva, N. Alexeev, Bioinformatics 38 (2022) 357–363."},"department":[{"_id":"FyKo"}],"page":"357-363","acknowledgement":"The authors thank the 2020 student class of the Bioinformatics Institute, who\r\nused the first versions of the tool and provided many valuable suggestions to\r\nimprove usability. They also thank Louisa Gonzalez Somermeyer for manuscript proofreading\r\nThis work was supported by the National Center for Cognitive Research of\r\nITMO University and JetBrains Research [to A.Z and N.A.]; and the European\r\nUnion’s Horizon 2020 Research and Innovation Programme under the Marie\r\nSkłodowska-Curie [754411 to O.B.].\r\nPaReBrick is written in Python and is available on GitHub: https://github.com/ctlab/parallel-rearrangements.","external_id":{"isi":["000743380100008"]},"ddc":["000"],"quality_controlled":"1","publication_status":"published","publisher":"Oxford University Press","volume":38,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"publication":"Bioinformatics","publication_identifier":{"issn":["1367-4803"],"eissn":["1460-2059"]},"file":[{"file_name":"2022_Bioinformatics_Zabelkin.pdf","access_level":"open_access","success":1,"file_size":3425744,"content_type":"application/pdf","checksum":"4b5688ff9ac86180ccdf7f82fa33d926","date_updated":"2022-03-28T08:07:46Z","creator":"dernst","file_id":"10930","relation":"main_file","date_created":"2022-03-28T08:07:46Z"}],"status":"public","day":"15","corr_author":"1","ec_funded":1,"month":"01","project":[{"grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"file_date_updated":"2022-03-28T08:07:46Z","doi":"10.1093/bioinformatics/btab691"},{"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","title":"Parameter inference for stochastic biochemical models from perturbation experiments parallelised at the single cell level","scopus_import":"1","year":"2022","article_processing_charge":"No","intvolume":"        18","author":[{"full_name":"Davidović, Anđela","first_name":"Anđela","last_name":"Davidović"},{"id":"3464AE84-F248-11E8-B48F-1D18A9856A87","full_name":"Chait, Remy P","first_name":"Remy P","orcid":"0000-0003-0876-3187","last_name":"Chait"},{"last_name":"Batt","first_name":"Gregory","full_name":"Batt, Gregory"},{"last_name":"Ruess","orcid":"0000-0003-1615-3282","first_name":"Jakob","full_name":"Ruess, Jakob","id":"4A245D00-F248-11E8-B48F-1D18A9856A87"}],"article_type":"original","related_material":{"link":[{"url":"https://gitlab.pasteur.fr/adavidov/inferencelnakf","relation":"software"}]},"date_published":"2022-03-18T00:00:00Z","department":[{"_id":"CaGu"}],"citation":{"apa":"Davidović, A., Chait, R. P., Batt, G., &#38; Ruess, J. (2022). Parameter inference for stochastic biochemical models from perturbation experiments parallelised at the single cell level. <i>PLoS Computational Biology</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pcbi.1009950\">https://doi.org/10.1371/journal.pcbi.1009950</a>","mla":"Davidović, Anđela, et al. “Parameter Inference for Stochastic Biochemical Models from Perturbation Experiments Parallelised at the Single Cell Level.” <i>PLoS Computational Biology</i>, vol. 18, no. 3, e1009950, Public Library of Science, 2022, doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1009950\">10.1371/journal.pcbi.1009950</a>.","short":"A. Davidović, R.P. Chait, G. Batt, J. Ruess, PLoS Computational Biology 18 (2022).","ama":"Davidović A, Chait RP, Batt G, Ruess J. Parameter inference for stochastic biochemical models from perturbation experiments parallelised at the single cell level. <i>PLoS Computational Biology</i>. 2022;18(3). doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1009950\">10.1371/journal.pcbi.1009950</a>","ieee":"A. Davidović, R. P. Chait, G. Batt, and J. Ruess, “Parameter inference for stochastic biochemical models from perturbation experiments parallelised at the single cell level,” <i>PLoS Computational Biology</i>, vol. 18, no. 3. Public Library of Science, 2022.","chicago":"Davidović, Anđela, Remy P Chait, Gregory Batt, and Jakob Ruess. “Parameter Inference for Stochastic Biochemical Models from Perturbation Experiments Parallelised at the Single Cell Level.” <i>PLoS Computational Biology</i>. Public Library of Science, 2022. <a href=\"https://doi.org/10.1371/journal.pcbi.1009950\">https://doi.org/10.1371/journal.pcbi.1009950</a>.","ista":"Davidović A, Chait RP, Batt G, Ruess J. 2022. Parameter inference for stochastic biochemical models from perturbation experiments parallelised at the single cell level. PLoS Computational Biology. 18(3), e1009950."},"abstract":[{"text":"Understanding and characterising biochemical processes inside single cells requires experimental platforms that allow one to perturb and observe the dynamics of such processes as well as computational methods to build and parameterise models from the collected data. Recent progress with experimental platforms and optogenetics has made it possible to expose each cell in an experiment to an individualised input and automatically record cellular responses over days with fine time resolution. However, methods to infer parameters of stochastic kinetic models from single-cell longitudinal data have generally been developed under the assumption that experimental data is sparse and that responses of cells to at most a few different input perturbations can be observed. Here, we investigate and compare different approaches for calculating parameter likelihoods of single-cell longitudinal data based on approximations of the chemical master equation (CME) with a particular focus on coupling the linear noise approximation (LNA) or moment closure methods to a Kalman filter. We show that, as long as cells are measured sufficiently frequently, coupling the LNA to a Kalman filter allows one to accurately approximate likelihoods and to infer model parameters from data even in cases where the LNA provides poor approximations of the CME. Furthermore, the computational cost of filtering-based iterative likelihood evaluation scales advantageously in the number of measurement times and different input perturbations and is thus ideally suited for data obtained from modern experimental platforms. To demonstrate the practical usefulness of these results, we perform an experiment in which single cells, equipped with an optogenetic gene expression system, are exposed to various different light-input sequences and measured at several hundred time points and use parameter inference based on iterative likelihood evaluation to parameterise a stochastic model of the system.","lang":"eng"}],"_id":"10939","date_updated":"2025-09-09T14:29:53Z","has_accepted_license":"1","language":[{"iso":"eng"}],"date_created":"2022-04-03T22:01:42Z","oa_version":"Published Version","type":"journal_article","article_number":"e1009950","issue":"3","isi":1,"oa":1,"publication":"PLoS Computational Biology","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"volume":18,"publisher":"Public Library of Science","publication_status":"published","pmid":1,"day":"18","status":"public","file":[{"file_name":"2022_PLoSCompBio_Davidovic.pdf","access_level":"open_access","success":1,"file_size":2958642,"content_type":"application/pdf","checksum":"458ef542761fb714ced214f240daf6b2","date_updated":"2022-04-04T10:14:39Z","creator":"dernst","file_id":"10947","relation":"main_file","date_created":"2022-04-04T10:14:39Z"}],"publication_identifier":{"eissn":["1553-7358"],"issn":["1553-734X"]},"quality_controlled":"1","ddc":["570","000"],"external_id":{"pmid":["35303737"],"isi":["001044208400004"]},"acknowledgement":"We thank Virgile Andreani for useful discussions about the model and parameter inference. We thank Johan Paulsson and Jeffrey J Tabor for kind gifts of plasmids. R was supported by the ANR grant CyberCircuits (ANR-18-CE91-0002). The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.","month":"03","doi":"10.1371/journal.pcbi.1009950","file_date_updated":"2022-04-04T10:14:39Z"},{"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","title":"Magnetic field resilience of three-dimensional transmons with thin-film Al/AlOx/Al Josephson junctions approaching 1 T","scopus_import":"1","year":"2022","article_processing_charge":"No","intvolume":"        17","author":[{"first_name":"J.","last_name":"Krause","full_name":"Krause, J."},{"full_name":"Dickel, C.","last_name":"Dickel","first_name":"C."},{"first_name":"E.","last_name":"Vaal","full_name":"Vaal, E."},{"last_name":"Vielmetter","first_name":"M.","full_name":"Vielmetter, M."},{"first_name":"J.","last_name":"Feng","full_name":"Feng, J."},{"last_name":"Bounds","first_name":"R.","full_name":"Bounds, R."},{"last_name":"Catelani","first_name":"G.","full_name":"Catelani, G."},{"full_name":"Fink, Johannes M","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","first_name":"Johannes M","orcid":"0000-0001-8112-028X","last_name":"Fink"},{"full_name":"Ando, Yoichi","first_name":"Yoichi","last_name":"Ando"}],"article_type":"original","date_published":"2022-03-11T00:00:00Z","department":[{"_id":"JoFi"}],"citation":{"chicago":"Krause, J., C. Dickel, E. Vaal, M. Vielmetter, J. Feng, R. Bounds, G. Catelani, Johannes M Fink, and Yoichi Ando. “Magnetic Field Resilience of Three-Dimensional Transmons with Thin-Film Al/AlOx/Al Josephson Junctions Approaching 1 T.” <i>Physical Review Applied</i>. American Physical Society, 2022. <a href=\"https://doi.org/10.1103/PhysRevApplied.17.034032\">https://doi.org/10.1103/PhysRevApplied.17.034032</a>.","ista":"Krause J, Dickel C, Vaal E, Vielmetter M, Feng J, Bounds R, Catelani G, Fink JM, Ando Y. 2022. Magnetic field resilience of three-dimensional transmons with thin-film Al/AlOx/Al Josephson junctions approaching 1 T. Physical Review Applied. 17(3), 034032.","ieee":"J. Krause <i>et al.</i>, “Magnetic field resilience of three-dimensional transmons with thin-film Al/AlOx/Al Josephson junctions approaching 1 T,” <i>Physical Review Applied</i>, vol. 17, no. 3. American Physical Society, 2022.","ama":"Krause J, Dickel C, Vaal E, et al. Magnetic field resilience of three-dimensional transmons with thin-film Al/AlOx/Al Josephson junctions approaching 1 T. <i>Physical Review Applied</i>. 2022;17(3). doi:<a href=\"https://doi.org/10.1103/PhysRevApplied.17.034032\">10.1103/PhysRevApplied.17.034032</a>","apa":"Krause, J., Dickel, C., Vaal, E., Vielmetter, M., Feng, J., Bounds, R., … Ando, Y. (2022). Magnetic field resilience of three-dimensional transmons with thin-film Al/AlOx/Al Josephson junctions approaching 1 T. <i>Physical Review Applied</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevApplied.17.034032\">https://doi.org/10.1103/PhysRevApplied.17.034032</a>","mla":"Krause, J., et al. “Magnetic Field Resilience of Three-Dimensional Transmons with Thin-Film Al/AlOx/Al Josephson Junctions Approaching 1 T.” <i>Physical Review Applied</i>, vol. 17, no. 3, 034032, American Physical Society, 2022, doi:<a href=\"https://doi.org/10.1103/PhysRevApplied.17.034032\">10.1103/PhysRevApplied.17.034032</a>.","short":"J. Krause, C. Dickel, E. Vaal, M. Vielmetter, J. Feng, R. Bounds, G. Catelani, J.M. Fink, Y. Ando, Physical Review Applied 17 (2022)."},"_id":"10940","abstract":[{"lang":"eng","text":"Magnetic-field-resilient superconducting circuits enable sensing applications and hybrid quantum computing architectures involving spin or topological qubits and electromechanical elements, as well as studying flux noise and quasiparticle loss. We investigate the effect of in-plane magnetic fields up to 1 T on the spectrum and coherence times of thin-film three-dimensional aluminum transmons. Using a copper cavity, unaffected by strong magnetic fields, we can probe solely the effect of magnetic fields on the transmons. We present data on a single-junction and a superconducting-quantum-interference-device (SQUID) transmon that are cooled down in the same cavity. As expected, the transmon frequencies decrease with increasing field, due to suppression of the superconducting gap and a geometric Fraunhofer-like contribution. Nevertheless, the thin-film transmons show strong magnetic field resilience: both transmons display microsecond coherence up to at least 0.65 T, and T1 remains above 1μs over the entire measurable range. SQUID spectroscopy is feasible up to 1 T, the limit of our magnet. We conclude that thin-film aluminum Josephson junctions are suitable hardware for superconducting circuits in the high-magnetic-field regime."}],"date_updated":"2023-08-03T06:23:58Z","language":[{"iso":"eng"}],"oa_version":"Preprint","date_created":"2022-04-03T22:01:43Z","type":"journal_article","article_number":"034032","issue":"3","oa":1,"isi":1,"publication":"Physical Review Applied","volume":17,"publisher":"American Physical Society","publication_status":"published","day":"11","status":"public","arxiv":1,"publication_identifier":{"eissn":["2331-7019"]},"quality_controlled":"1","external_id":{"arxiv":["2111.01115"],"isi":["000770371400003"]},"acknowledgement":"We would like to thank Ida Milow for her internship in the laboratory and contributions to our code base. We thank T. Zent and L. Hamdan for technical assistance, and D. Fan for help with setting up the aluminum evaporator. We thank A. Salari, M. Rößler, S. Barzanjeh, M. Zemlicka, F. Hassani, and M. Peruzzo for contributions in the early stages of the experiments. This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation program (Grant Agreement No. 741121) and was also funded by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under CRC 1238 – 277146847 (Subproject B01), as well as under Germany’s Excellence Strategy – Cluster of Excellence Matter and Light for Quantum Computing (ML4Q), EXC 2004/1\r\n– 390534769.","month":"03","doi":"10.1103/PhysRevApplied.17.034032","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2111.01115"}]},{"OA_place":"publisher","file_date_updated":"2022-04-04T10:39:24Z","doi":"10.3390/colorants1020010","OA_type":"gold","month":"04","quality_controlled":"1","acknowledgement":"This research was partly funded by Hacettepe University (Bilimsel Ara¸stırma Projeleri\r\nKoordinasyon Birimi), grant number FHD-2015-8094.The authors are indebted to Ahmet Önal for his supports in acquiring the fluorescence spectra and the decision of excitation wavelengths. The authors also acknowledge use of the services and facilities of UNAM-National Nanotechnology Research Center at Bilkent University and mica donation from Sabuncular Mining Co.","ddc":["570"],"status":"public","day":"01","publication_identifier":{"issn":["2079-6447"]},"file":[{"relation":"main_file","date_created":"2022-04-04T10:39:24Z","file_id":"10949","date_updated":"2022-04-04T10:39:24Z","creator":"dernst","checksum":"2c15c8d3041ebc36bc64870247081758","content_type":"application/pdf","file_size":2437988,"success":1,"file_name":"2022_Colorants_Coruh.pdf","access_level":"open_access"}],"volume":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"publication":"Colorants","publication_status":"published","publisher":"MDPI","issue":"2","oa":1,"oa_version":"Published Version","date_created":"2022-04-04T09:03:54Z","type":"journal_article","date_updated":"2024-10-14T13:52:09Z","_id":"10945","DOAJ_listed":"1","abstract":[{"text":"Mica-titania pearlescent pigments (MTs) were previously coated with organic molecules to obtain combination pigments (CPs) for achieving certain improvements or functionalities. Anthocyanins (ACNs) are molecules that can be extracted from natural resources and exhibit color changes via pH modifications of the enclosing medium. The purpose of the study was to produce a new series of CPs by depositing ACNs on MTs at different pH values, to observe the changes in color, and to associate these changes to thermogravimetrically determined deposition efficiencies in light of spectral differences. The extraction and deposition methods were based on aqueous chemistry and were straightforward. The ACN deposition generally increased with increasing pH and correlated with the consistency between the charges of the MT surfaces and the dominant ACN species at a specific pH value. The fluorescence of the CPs was inversely correlated with the deposition quantities invoking the possibility of a quenching effect.","lang":"eng"}],"date_published":"2022-04-01T00:00:00Z","page":"149-164","citation":{"apa":"Çoruh, M. O., Gündüz, G., Çolak, Ü., &#38; Maviş, B. (2022). pH-dependent coloring of combination effect pigments with anthocyanins from Brassica oleracea var. capitata F. rubra. <i>Colorants</i>. MDPI. <a href=\"https://doi.org/10.3390/colorants1020010\">https://doi.org/10.3390/colorants1020010</a>","short":"M.O. Çoruh, G. Gündüz, Ü. Çolak, B. Maviş, Colorants 1 (2022) 149–164.","mla":"Çoruh, Mehmet Orkun, et al. “PH-Dependent Coloring of Combination Effect Pigments with Anthocyanins from Brassica Oleracea Var. Capitata F. Rubra.” <i>Colorants</i>, vol. 1, no. 2, MDPI, 2022, pp. 149–64, doi:<a href=\"https://doi.org/10.3390/colorants1020010\">10.3390/colorants1020010</a>.","ieee":"M. O. Çoruh, G. Gündüz, Ü. Çolak, and B. Maviş, “pH-dependent coloring of combination effect pigments with anthocyanins from Brassica oleracea var. capitata F. rubra,” <i>Colorants</i>, vol. 1, no. 2. MDPI, pp. 149–164, 2022.","ama":"Çoruh MO, Gündüz G, Çolak Ü, Maviş B. pH-dependent coloring of combination effect pigments with anthocyanins from Brassica oleracea var. capitata F. rubra. <i>Colorants</i>. 2022;1(2):149-164. doi:<a href=\"https://doi.org/10.3390/colorants1020010\">10.3390/colorants1020010</a>","chicago":"Çoruh, Mehmet Orkun, Güngör Gündüz, Üner Çolak, and Bora Maviş. “PH-Dependent Coloring of Combination Effect Pigments with Anthocyanins from Brassica Oleracea Var. Capitata F. Rubra.” <i>Colorants</i>. MDPI, 2022. <a href=\"https://doi.org/10.3390/colorants1020010\">https://doi.org/10.3390/colorants1020010</a>.","ista":"Çoruh MO, Gündüz G, Çolak Ü, Maviş B. 2022. pH-dependent coloring of combination effect pigments with anthocyanins from Brassica oleracea var. capitata F. rubra. Colorants. 1(2), 149–164."},"department":[{"_id":"LeSa"}],"language":[{"iso":"eng"}],"has_accepted_license":"1","author":[{"full_name":"Çoruh, Mehmet Orkun","id":"d25163e5-8d53-11eb-a251-e6dd8ea1b8ef","first_name":"Mehmet Orkun","last_name":"Çoruh","orcid":"0000-0002-3219-2022"},{"last_name":"Gündüz","first_name":"Güngör","full_name":"Gündüz, Güngör"},{"full_name":"Çolak, Üner","last_name":"Çolak","first_name":"Üner"},{"first_name":"Bora","last_name":"Maviş","full_name":"Maviş, Bora"}],"intvolume":"         1","article_type":"original","article_processing_charge":"Yes","year":"2022","user_id":"0043cee0-e5fc-11ee-9736-f83bc23afbf0","title":"pH-dependent coloring of combination effect pigments with anthocyanins from Brassica oleracea var. capitata F. rubra"},{"corr_author":"1","project":[{"_id":"9B8804FC-BA93-11EA-9121-9846C619BF3A","grant_number":"M02889","name":"Bottom-up Engineering for Thermoelectric Applications"}],"doi":"10.1016/j.mtener.2022.100985","month":"04","external_id":{"isi":["000798679100010"]},"acknowledgement":"This work was supported by National Natural Science Foundation of China (52002042), National Key Research and Development Program of China (2018YFA0702100 and 2018YFB0703600), 111 Project (B17002) and Lise Meitner Project M 2889-N. This work was also supported by the National Postdoctoral Program for Innovative Talents (BX20200028). L.D.Z. appreciates the support of the high-performance computing (HPC) resources at Beihang University, the National Science Fund for Distinguished Young Scholars (51925101), and center for High Pressure Science and Technology Advanced Research (HPSTAR) for SEM and TEM measurements.","quality_controlled":"1","publication_identifier":{"eissn":["2468-6069"]},"day":"01","status":"public","publisher":"Elsevier","publication_status":"published","publication":"Materials Today Energy","volume":25,"isi":1,"type":"journal_article","article_number":"100985","oa_version":"None","date_created":"2022-04-10T22:01:39Z","language":[{"iso":"eng"}],"department":[{"_id":"MaIb"}],"date_published":"2022-04-01T00:00:00Z","citation":{"short":"T. Hong, C. Guo, D. Wang, B. Qin, C. Chang, X. Gao, L.D. Zhao, Materials Today Energy 25 (2022).","mla":"Hong, Tao, et al. “Enhanced Thermoelectric Performance in SnTe Due to the Energy Filtering Effect Introduced by Bi2O3.” <i>Materials Today Energy</i>, vol. 25, 100985, Elsevier, 2022, doi:<a href=\"https://doi.org/10.1016/j.mtener.2022.100985\">10.1016/j.mtener.2022.100985</a>.","apa":"Hong, T., Guo, C., Wang, D., Qin, B., Chang, C., Gao, X., &#38; Zhao, L. D. (2022). Enhanced thermoelectric performance in SnTe due to the energy filtering effect introduced by Bi2O3. <i>Materials Today Energy</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.mtener.2022.100985\">https://doi.org/10.1016/j.mtener.2022.100985</a>","ieee":"T. Hong <i>et al.</i>, “Enhanced thermoelectric performance in SnTe due to the energy filtering effect introduced by Bi2O3,” <i>Materials Today Energy</i>, vol. 25. Elsevier, 2022.","ama":"Hong T, Guo C, Wang D, et al. Enhanced thermoelectric performance in SnTe due to the energy filtering effect introduced by Bi2O3. <i>Materials Today Energy</i>. 2022;25. doi:<a href=\"https://doi.org/10.1016/j.mtener.2022.100985\">10.1016/j.mtener.2022.100985</a>","ista":"Hong T, Guo C, Wang D, Qin B, Chang C, Gao X, Zhao LD. 2022. Enhanced thermoelectric performance in SnTe due to the energy filtering effect introduced by Bi2O3. Materials Today Energy. 25, 100985.","chicago":"Hong, Tao, Changrong Guo, Dongyang Wang, Bingchao Qin, Cheng Chang, Xiang Gao, and Li Dong Zhao. “Enhanced Thermoelectric Performance in SnTe Due to the Energy Filtering Effect Introduced by Bi2O3.” <i>Materials Today Energy</i>. Elsevier, 2022. <a href=\"https://doi.org/10.1016/j.mtener.2022.100985\">https://doi.org/10.1016/j.mtener.2022.100985</a>."},"abstract":[{"lang":"eng","text":"SnTe is a promising Pb-free thermoelectric (TE) material with high electrical conductivity. We discovered the synergistic effect of Bi2O3 on enhancing the average power factor (PF) and overall ZT value of the SnTe-based thermoelectric material. The introduction of Bi2O3 forms plenty of SnO2, Bi2O3, and Bi-rich nanoprecipitates. These interfaces between the SnTe matrix and the nanoprecipitates can enhance the average PF through the energy filtering effect. On the other hand, abundant and diverse nanoprecipitates can significantly diminish the lattice thermal conductivity (κlat) through enhanced phonon scattering. The synergistic effect of Bi2O3 resulted in a maximum ZT (ZTmax) value of 0.9 at SnTe-2% Bi2O3 and an average ZT (ZTave) value of 0.4 for SnTe-4% Bi2O3 from 300 K to 823 K. The work provides an excellent reference to develop non-toxic high-performance TE materials."}],"_id":"11142","date_updated":"2025-04-14T09:29:32Z","article_type":"original","intvolume":"        25","author":[{"full_name":"Hong, Tao","first_name":"Tao","last_name":"Hong"},{"full_name":"Guo, Changrong","last_name":"Guo","first_name":"Changrong"},{"first_name":"Dongyang","last_name":"Wang","full_name":"Wang, Dongyang"},{"full_name":"Qin, Bingchao","last_name":"Qin","first_name":"Bingchao"},{"id":"9E331C2E-9F27-11E9-AE48-5033E6697425","full_name":"Chang, Cheng","orcid":"0000-0002-9515-4277","last_name":"Chang","first_name":"Cheng"},{"last_name":"Gao","first_name":"Xiang","full_name":"Gao, Xiang"},{"last_name":"Zhao","first_name":"Li Dong","full_name":"Zhao, Li Dong"}],"year":"2022","article_processing_charge":"No","scopus_import":"1","title":"Enhanced thermoelectric performance in SnTe due to the energy filtering effect introduced by Bi2O3","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8"},{"author":[{"last_name":"Kaneko","first_name":"Keisuke","full_name":"Kaneko, Keisuke"},{"id":"e8321fc5-3091-11eb-8a53-83f309a11ac9","full_name":"Currin, Christopher","first_name":"Christopher","last_name":"Currin","orcid":"0000-0002-4809-5059"},{"full_name":"Goff, Kevin M.","first_name":"Kevin M.","last_name":"Goff"},{"full_name":"Wengert, Eric R.","first_name":"Eric R.","last_name":"Wengert"},{"last_name":"Somarowthu","first_name":"Ala","full_name":"Somarowthu, Ala"},{"id":"CB6FF8D2-008F-11EA-8E08-2637E6697425","full_name":"Vogels, Tim P","first_name":"Tim P","last_name":"Vogels","orcid":"0000-0003-3295-6181"},{"last_name":"Goldberg","first_name":"Ethan M.","full_name":"Goldberg, Ethan M."}],"intvolume":"        38","article_type":"original","year":"2022","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Developmentally regulated impairment of parvalbumin interneuron synaptic transmission in an experimental model of Dravet syndrome","scopus_import":"1","issue":"13","oa":1,"isi":1,"date_created":"2022-04-10T22:01:39Z","oa_version":"Published Version","type":"journal_article","article_number":"110580","department":[{"_id":"TiVo"}],"date_published":"2022-03-29T00:00:00Z","citation":{"apa":"Kaneko, K., Currin, C., Goff, K. M., Wengert, E. R., Somarowthu, A., Vogels, T. P., &#38; Goldberg, E. M. (2022). Developmentally regulated impairment of parvalbumin interneuron synaptic transmission in an experimental model of Dravet syndrome. <i>Cell Reports</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.celrep.2022.110580\">https://doi.org/10.1016/j.celrep.2022.110580</a>","short":"K. Kaneko, C. Currin, K.M. Goff, E.R. Wengert, A. Somarowthu, T.P. Vogels, E.M. Goldberg, Cell Reports 38 (2022).","mla":"Kaneko, Keisuke, et al. “Developmentally Regulated Impairment of Parvalbumin Interneuron Synaptic Transmission in an Experimental Model of Dravet Syndrome.” <i>Cell Reports</i>, vol. 38, no. 13, 110580, Elsevier, 2022, doi:<a href=\"https://doi.org/10.1016/j.celrep.2022.110580\">10.1016/j.celrep.2022.110580</a>.","ieee":"K. Kaneko <i>et al.</i>, “Developmentally regulated impairment of parvalbumin interneuron synaptic transmission in an experimental model of Dravet syndrome,” <i>Cell Reports</i>, vol. 38, no. 13. Elsevier, 2022.","ama":"Kaneko K, Currin C, Goff KM, et al. Developmentally regulated impairment of parvalbumin interneuron synaptic transmission in an experimental model of Dravet syndrome. <i>Cell Reports</i>. 2022;38(13). doi:<a href=\"https://doi.org/10.1016/j.celrep.2022.110580\">10.1016/j.celrep.2022.110580</a>","chicago":"Kaneko, Keisuke, Christopher Currin, Kevin M. Goff, Eric R. Wengert, Ala Somarowthu, Tim P Vogels, and Ethan M. Goldberg. “Developmentally Regulated Impairment of Parvalbumin Interneuron Synaptic Transmission in an Experimental Model of Dravet Syndrome.” <i>Cell Reports</i>. Elsevier, 2022. <a href=\"https://doi.org/10.1016/j.celrep.2022.110580\">https://doi.org/10.1016/j.celrep.2022.110580</a>.","ista":"Kaneko K, Currin C, Goff KM, Wengert ER, Somarowthu A, Vogels TP, Goldberg EM. 2022. Developmentally regulated impairment of parvalbumin interneuron synaptic transmission in an experimental model of Dravet syndrome. Cell Reports. 38(13), 110580."},"_id":"11143","date_updated":"2025-06-11T14:00:11Z","abstract":[{"lang":"eng","text":"Dravet syndrome is a neurodevelopmental disorder characterized by epilepsy, intellectual disability, and sudden death due to pathogenic variants in SCN1A with loss of function of the sodium channel subunit Nav1.1. Nav1.1-expressing parvalbumin GABAergic interneurons (PV-INs) from young Scn1a+/− mice show impaired action potential generation. An approach assessing PV-IN function in the same mice at two time points shows impaired spike generation in all Scn1a+/− mice at postnatal days (P) 16–21, whether deceased prior or surviving to P35, with normalization by P35 in surviving mice. However, PV-IN synaptic transmission is dysfunctional in young Scn1a+/− mice that did not survive and in Scn1a+/− mice ≥ P35. Modeling confirms that PV-IN axonal propagation is more sensitive to decreased sodium conductance than spike generation. These results demonstrate dynamic dysfunction in Dravet syndrome: combined abnormalities of PV-IN spike generation and propagation drives early disease severity, while ongoing dysfunction of synaptic transmission contributes to chronic pathology."}],"has_accepted_license":"1","language":[{"iso":"eng"}],"quality_controlled":"1","ddc":["570"],"external_id":{"pmid":["35354025"],"isi":["000779794000001"]},"acknowledgement":"We would like to thank Bernardo Rudy, Joanna Mattis, and Laura Mcgarry for comments on a previous version of the manuscript; Xiaohong Zhang for expert technical support and mouse colony maintenance; Melody Cheng for assistance with generation of the graphical abstract; and Jennifer Kearney for the gift of Scn1a+/− mice. This work was supported by the National Institute of Neurological Disorders and Stroke of the National Institutes of Health under F31NS111803 (to K.M.G.) and K08NS097633 and R01NS110869 (to E.M.G.), the Dravet Syndrome Foundation (to A.S.), an ERC Consolidator Grant (SYNAPSEEK) (to T.P.V.), and the NOMIS Foundation through the NOMIS Fellowships program at IST Austria (to C.C.). The graphical abstract was prepared using BioRender software (BioRender.com).","day":"29","pmid":1,"status":"public","file":[{"creator":"dernst","date_updated":"2022-04-15T11:00:58Z","checksum":"49105c6c27c9af0f37f50a8bbb4d380d","content_type":"application/pdf","file_size":4774216,"success":1,"file_name":"2022_CellReports_Kaneko.pdf","access_level":"open_access","relation":"main_file","date_created":"2022-04-15T11:00:58Z","file_id":"11172"}],"publication_identifier":{"eissn":["2211-1247"]},"publication":"Cell Reports","volume":38,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"publisher":"Elsevier","publication_status":"published","ec_funded":1,"doi":"10.1016/j.celrep.2022.110580","file_date_updated":"2022-04-15T11:00:58Z","project":[{"_id":"0aacfa84-070f-11eb-9043-d7eb2c709234","name":"Learning the shape of synaptic plasticity rules for neuronal architectures and function through machine learning.","grant_number":"819603","call_identifier":"H2020"},{"name":"NOMIS Fellowship Program","_id":"9B861AAC-BA93-11EA-9121-9846C619BF3A"}],"month":"03"},{"type":"journal_article","oa_version":"None","date_created":"2022-04-10T22:01:40Z","isi":1,"issue":"6587","language":[{"iso":"eng"}],"citation":{"ama":"Su L, Wang D, Wang S, et al. High thermoelectric performance realized through manipulating layered phonon-electron decoupling. <i>Science</i>. 2022;375(6587):1385-1389. doi:<a href=\"https://doi.org/10.1126/science.abn8997\">10.1126/science.abn8997</a>","ieee":"L. Su <i>et al.</i>, “High thermoelectric performance realized through manipulating layered phonon-electron decoupling,” <i>Science</i>, vol. 375, no. 6587. American Association for the Advancement of Science, pp. 1385–1389, 2022.","ista":"Su L, Wang D, Wang S, Qin B, Wang Y, Qin Y, Jin Y, Chang C, Zhao LD. 2022. High thermoelectric performance realized through manipulating layered phonon-electron decoupling. Science. 375(6587), 1385–1389.","chicago":"Su, Lizhong, Dongyang Wang, Sining Wang, Bingchao Qin, Yuping Wang, Yongxin Qin, Yang Jin, Cheng Chang, and Li Dong Zhao. “High Thermoelectric Performance Realized through Manipulating Layered Phonon-Electron Decoupling.” <i>Science</i>. American Association for the Advancement of Science, 2022. <a href=\"https://doi.org/10.1126/science.abn8997\">https://doi.org/10.1126/science.abn8997</a>.","mla":"Su, Lizhong, et al. “High Thermoelectric Performance Realized through Manipulating Layered Phonon-Electron Decoupling.” <i>Science</i>, vol. 375, no. 6587, American Association for the Advancement of Science, 2022, pp. 1385–89, doi:<a href=\"https://doi.org/10.1126/science.abn8997\">10.1126/science.abn8997</a>.","short":"L. Su, D. Wang, S. Wang, B. Qin, Y. Wang, Y. Qin, Y. Jin, C. Chang, L.D. Zhao, Science 375 (2022) 1385–1389.","apa":"Su, L., Wang, D., Wang, S., Qin, B., Wang, Y., Qin, Y., … Zhao, L. D. (2022). High thermoelectric performance realized through manipulating layered phonon-electron decoupling. <i>Science</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/science.abn8997\">https://doi.org/10.1126/science.abn8997</a>"},"date_published":"2022-03-25T00:00:00Z","department":[{"_id":"MaIb"}],"page":"1385-1389","abstract":[{"text":"Thermoelectric materials allow for direct conversion between heat and electricity, offering the potential for power generation. The average dimensionless figure of merit ZTave determines device efficiency. N-type tin selenide crystals exhibit outstanding three-dimensional charge and two-dimensional phonon transport along the out-of-plane direction, contributing to a high maximum figure of merit Zmax of ~3.6 × 10−3 per kelvin but a moderate ZTave of ~1.1. We found an attractive high Zmax of ~4.1 × 10−3 per kelvin at 748 kelvin and a ZTave of ~1.7 at 300 to 773 kelvin in chlorine-doped and lead-alloyed tin selenide crystals by phonon-electron decoupling. The chlorine-induced low deformation potential improved the carrier mobility. The lead-induced mass and strain fluctuations reduced the lattice thermal conductivity. Phonon-electron decoupling plays a critical role to achieve high-performance thermoelectrics.","lang":"eng"}],"_id":"11144","date_updated":"2025-04-14T09:29:32Z","year":"2022","article_processing_charge":"No","article_type":"original","intvolume":"       375","author":[{"full_name":"Su, Lizhong","first_name":"Lizhong","last_name":"Su"},{"full_name":"Wang, Dongyang","last_name":"Wang","first_name":"Dongyang"},{"first_name":"Sining","last_name":"Wang","full_name":"Wang, Sining"},{"last_name":"Qin","first_name":"Bingchao","full_name":"Qin, Bingchao"},{"full_name":"Wang, Yuping","last_name":"Wang","first_name":"Yuping"},{"full_name":"Qin, Yongxin","last_name":"Qin","first_name":"Yongxin"},{"full_name":"Jin, Yang","last_name":"Jin","first_name":"Yang"},{"first_name":"Cheng","orcid":"0000-0002-9515-4277","last_name":"Chang","full_name":"Chang, Cheng","id":"9E331C2E-9F27-11E9-AE48-5033E6697425"},{"last_name":"Zhao","first_name":"Li Dong","full_name":"Zhao, Li Dong"}],"scopus_import":"1","title":"High thermoelectric performance realized through manipulating layered phonon-electron decoupling","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","corr_author":"1","month":"03","project":[{"_id":"9B8804FC-BA93-11EA-9121-9846C619BF3A","name":"Bottom-up Engineering for Thermoelectric Applications","grant_number":"M02889"}],"doi":"10.1126/science.abn8997","external_id":{"isi":["000778894800038"],"pmid":["35324303"]},"acknowledgement":"This work was supported by the Basic Science Center Project of the National Natural Science Foundation of China (51788104), the National Key Research and Development Program of China (2018YFA0702100), the National Science Fund for Distinguished Young Scholars (51925101), the 111 Project (B17002), the Lise Meitner Project (M2889-N), and the National Key Research and Development Program of China (2018YFB0703600). This work is also supported by the National Postdoctoral Program for Innovative Talents (BX20200028). L.-D.Z. is thankful for the high-performance computing resources at Beihang University.","quality_controlled":"1","publisher":"American Association for the Advancement of Science","publication_status":"published","publication":"Science","volume":375,"publication_identifier":{"eissn":["1095-9203"]},"pmid":1,"day":"25","status":"public"},{"isi":1,"oa":1,"type":"conference","oa_version":"Preprint","date_created":"2022-04-10T22:01:40Z","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"List-decodability of Reed-Solomon codes has re-ceived a lot of attention, but the best-possible dependence between the parameters is still not well-understood. In this work, we focus on the case where the list-decoding radius is of the form r=1−ε for ε tending to zero. Our main result states that there exist Reed-Solomon codes with rate Ω(ε) which are (1−ε,O(1/ε) -list-decodable, meaning that any Hamming ball of radius 1−ε contains at most O(1/ε) codewords. This trade-off between rate and list-decoding radius is best-possible for any code with list size less than exponential in the block length. By achieving this trade-off between rate and list-decoding radius we improve a recent result of Guo, Li, Shangguan, Tamo, and Wootters, and resolve the main motivating question of their work. Moreover, while their result requires the field to be exponentially large in the block length, we only need the field size to be polynomially large (and in fact, almost-linear suffices). We deduce our main result from a more general theorem, in which we prove good list-decodability properties of random puncturings of any given code with very large distance."}],"_id":"11145","date_updated":"2025-07-10T11:50:08Z","citation":{"mla":"Ferber, Asaf, et al. “List-Decodability with Large Radius for Reed-Solomon Codes.” <i>62nd Annual IEEE Symposium on Foundations of Computer Science</i>, vol. 2022, IEEE, 2022, pp. 720–26, doi:<a href=\"https://doi.org/10.1109/FOCS52979.2021.00075\">10.1109/FOCS52979.2021.00075</a>.","short":"A. Ferber, M.A. Kwan, L. Sauermann, in:, 62nd Annual IEEE Symposium on Foundations of Computer Science, IEEE, 2022, pp. 720–726.","apa":"Ferber, A., Kwan, M. A., &#38; Sauermann, L. (2022). List-decodability with large radius for Reed-Solomon codes. In <i>62nd Annual IEEE Symposium on Foundations of Computer Science</i> (Vol. 2022, pp. 720–726). Denver, CO, United States: IEEE. <a href=\"https://doi.org/10.1109/FOCS52979.2021.00075\">https://doi.org/10.1109/FOCS52979.2021.00075</a>","ama":"Ferber A, Kwan MA, Sauermann L. List-decodability with large radius for Reed-Solomon codes. In: <i>62nd Annual IEEE Symposium on Foundations of Computer Science</i>. Vol 2022. IEEE; 2022:720-726. doi:<a href=\"https://doi.org/10.1109/FOCS52979.2021.00075\">10.1109/FOCS52979.2021.00075</a>","ieee":"A. Ferber, M. A. Kwan, and L. Sauermann, “List-decodability with large radius for Reed-Solomon codes,” in <i>62nd Annual IEEE Symposium on Foundations of Computer Science</i>, Denver, CO, United States, 2022, vol. 2022, pp. 720–726.","ista":"Ferber A, Kwan MA, Sauermann L. 2022. List-decodability with large radius for Reed-Solomon codes. 62nd Annual IEEE Symposium on Foundations of Computer Science. FOCS: Foundations of Computer Science vol. 2022, 720–726.","chicago":"Ferber, Asaf, Matthew Alan Kwan, and Lisa Sauermann. “List-Decodability with Large Radius for Reed-Solomon Codes.” In <i>62nd Annual IEEE Symposium on Foundations of Computer Science</i>, 2022:720–26. IEEE, 2022. <a href=\"https://doi.org/10.1109/FOCS52979.2021.00075\">https://doi.org/10.1109/FOCS52979.2021.00075</a>."},"department":[{"_id":"MaKw"}],"page":"720-726","date_published":"2022-02-01T00:00:00Z","related_material":{"record":[{"status":"public","id":"10775","relation":"later_version"}]},"intvolume":"      2022","author":[{"full_name":"Ferber, Asaf","first_name":"Asaf","last_name":"Ferber"},{"orcid":"0000-0002-4003-7567","last_name":"Kwan","first_name":"Matthew Alan","full_name":"Kwan, Matthew Alan","id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3"},{"full_name":"Sauermann, Lisa","last_name":"Sauermann","first_name":"Lisa"}],"article_processing_charge":"No","year":"2022","scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"List-decodability with large radius for Reed-Solomon codes","conference":{"end_date":"2022-02-10","name":"FOCS: Foundations of Computer Science","location":"Denver, CO, United States","start_date":"2022-02-07"},"main_file_link":[{"url":" https://doi.org/10.48550/arXiv.2012.10584","open_access":"1"}],"doi":"10.1109/FOCS52979.2021.00075","month":"02","external_id":{"isi":["000802209600065"],"arxiv":["2012.10584"]},"quality_controlled":"1","publication_identifier":{"isbn":["9781665420556"],"issn":["0272-5428"]},"arxiv":1,"status":"public","day":"01","publication_status":"published","publisher":"IEEE","volume":2022,"publication":"62nd Annual IEEE Symposium on Foundations of Computer Science"},{"month":"06","file_date_updated":"2022-08-02T11:07:58Z","doi":"10.1016/j.jsb.2022.107852","project":[{"_id":"26736D6A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Structural conservation and diversity in retroviral capsid","grant_number":"P31445"}],"corr_author":"1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"volume":214,"publication":"Journal of Structural Biology","publication_status":"published","publisher":"Elsevier","status":"public","day":"01","pmid":1,"publication_identifier":{"issn":["1047-8477"]},"file":[{"file_id":"11722","relation":"main_file","date_created":"2022-08-02T11:07:58Z","file_size":7080863,"success":1,"file_name":"2022_JourStructuralBiology_Obr.pdf","access_level":"open_access","creator":"dernst","date_updated":"2022-08-02T11:07:58Z","checksum":"0b1eb53447aae8e95ae4c12d193b0b00","content_type":"application/pdf"}],"quality_controlled":"1","acknowledgement":"This work was funded by the Austrian Science Fund (FWF) grant P31445 to F.K.M.S and the National Institute of Allergy and Infectious Diseases under awards R01AI147890 to R.A.D. This research was also supported by the Scientific Service Units (SSUs) of IST Austria through resources provided by Scientific Computing (SciComp), the Life Science Facility (LSF), and the Electron Microscopy Facility (EMF). We thank Dustin Morado for providing the software SubTOM for data processing. We also thank William Wan for critical reading of the manuscript and valuable feedback.","external_id":{"pmid":["35351542"],"isi":["000790733600001"]},"ddc":["570"],"date_updated":"2025-04-15T08:24:50Z","_id":"11155","abstract":[{"lang":"eng","text":"The potential of energy filtering and direct electron detection for cryo-electron microscopy (cryo-EM) has been well documented. Here, we assess the performance of recently introduced hardware for cryo-electron tomography (cryo-ET) and subtomogram averaging (STA), an increasingly popular structural determination method for complex 3D specimens. We acquired cryo-ET datasets of EIAV virus-like particles (VLPs) on two contemporary cryo-EM systems equipped with different energy filters and direct electron detectors (DED), specifically a Krios G4, equipped with a cold field emission gun (CFEG), Thermo Fisher Scientific Selectris X energy filter, and a Falcon 4 DED; and a Krios G3i, with a Schottky field emission gun (XFEG), a Gatan Bioquantum energy filter, and a K3 DED. We performed constrained cross-correlation-based STA on equally sized datasets acquired on the respective systems. The resulting EIAV CA hexamer reconstructions show that both systems perform comparably in the 4–6 Å resolution range based on Fourier-Shell correlation (FSC). In addition, by employing a recently introduced multiparticle refinement approach, we obtained a reconstruction of the EIAV CA hexamer at 2.9 Å. Our results demonstrate the potential of the new generation of energy filters and DEDs for STA, and the effects of using different processing pipelines on their STA outcomes."}],"date_published":"2022-06-01T00:00:00Z","department":[{"_id":"FlSc"}],"citation":{"mla":"Obr, Martin, et al. “Exploring High-Resolution Cryo-ET and Subtomogram Averaging Capabilities of Contemporary DEDs.” <i>Journal of Structural Biology</i>, vol. 214, no. 2, 107852, Elsevier, 2022, doi:<a href=\"https://doi.org/10.1016/j.jsb.2022.107852\">10.1016/j.jsb.2022.107852</a>.","short":"M. Obr, W.J.H. Hagen, R.A. Dick, L. Yu, A. Kotecha, F.K. Schur, Journal of Structural Biology 214 (2022).","apa":"Obr, M., Hagen, W. J. H., Dick, R. A., Yu, L., Kotecha, A., &#38; Schur, F. K. (2022). Exploring high-resolution cryo-ET and subtomogram averaging capabilities of contemporary DEDs. <i>Journal of Structural Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jsb.2022.107852\">https://doi.org/10.1016/j.jsb.2022.107852</a>","ista":"Obr M, Hagen WJH, Dick RA, Yu L, Kotecha A, Schur FK. 2022. Exploring high-resolution cryo-ET and subtomogram averaging capabilities of contemporary DEDs. Journal of Structural Biology. 214(2), 107852.","chicago":"Obr, Martin, Wim J.H. Hagen, Robert A. Dick, Lingbo Yu, Abhay Kotecha, and Florian KM Schur. “Exploring High-Resolution Cryo-ET and Subtomogram Averaging Capabilities of Contemporary DEDs.” <i>Journal of Structural Biology</i>. Elsevier, 2022. <a href=\"https://doi.org/10.1016/j.jsb.2022.107852\">https://doi.org/10.1016/j.jsb.2022.107852</a>.","ieee":"M. Obr, W. J. H. Hagen, R. A. Dick, L. Yu, A. Kotecha, and F. K. Schur, “Exploring high-resolution cryo-ET and subtomogram averaging capabilities of contemporary DEDs,” <i>Journal of Structural Biology</i>, vol. 214, no. 2. Elsevier, 2022.","ama":"Obr M, Hagen WJH, Dick RA, Yu L, Kotecha A, Schur FK. Exploring high-resolution cryo-ET and subtomogram averaging capabilities of contemporary DEDs. <i>Journal of Structural Biology</i>. 2022;214(2). doi:<a href=\"https://doi.org/10.1016/j.jsb.2022.107852\">10.1016/j.jsb.2022.107852</a>"},"acknowledged_ssus":[{"_id":"LifeSc"},{"_id":"ScienComp"},{"_id":"EM-Fac"}],"language":[{"iso":"eng"}],"has_accepted_license":"1","date_created":"2022-04-15T07:10:26Z","oa_version":"Published Version","article_number":"107852","type":"journal_article","issue":"2","isi":1,"oa":1,"title":"Exploring high-resolution cryo-ET and subtomogram averaging capabilities of contemporary DEDs","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","scopus_import":"1","article_processing_charge":"Yes (via OA deal)","year":"2022","keyword":["Structural Biology"],"intvolume":"       214","author":[{"id":"4741CA5A-F248-11E8-B48F-1D18A9856A87","full_name":"Obr, Martin","last_name":"Obr","orcid":"0000-0003-1756-6564","first_name":"Martin"},{"first_name":"Wim J.H.","last_name":"Hagen","full_name":"Hagen, Wim J.H."},{"last_name":"Dick","first_name":"Robert A.","full_name":"Dick, Robert A."},{"last_name":"Yu","first_name":"Lingbo","full_name":"Yu, Lingbo"},{"full_name":"Kotecha, Abhay","first_name":"Abhay","last_name":"Kotecha"},{"full_name":"Schur, Florian KM","id":"48AD8942-F248-11E8-B48F-1D18A9856A87","first_name":"Florian KM","last_name":"Schur","orcid":"0000-0003-4790-8078"}],"article_type":"original"},{"file":[{"date_updated":"2022-08-05T05:56:03Z","creator":"dernst","content_type":"application/pdf","checksum":"72bdde48853643a32d42b75f54965c44","file_size":815607,"access_level":"open_access","file_name":"2022_CurrentOpStructBiology_Kampjut.pdf","success":1,"relation":"main_file","date_created":"2022-08-05T05:56:03Z","file_id":"11725"}],"publication_identifier":{"issn":["0959-440X"]},"pmid":1,"day":"01","status":"public","publisher":"Elsevier","publication_status":"published","publication":"Current Opinion in Structural Biology","volume":74,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"external_id":{"isi":["000829029500020"],"pmid":["35316665"]},"ddc":["570"],"quality_controlled":"1","doi":"10.1016/j.sbi.2022.102350","file_date_updated":"2022-08-05T05:56:03Z","month":"06","corr_author":"1","scopus_import":"1","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","title":"Structure of respiratory complex I – An emerging blueprint for the mechanism","article_type":"original","author":[{"last_name":"Kampjut","first_name":"Domen","full_name":"Kampjut, Domen","id":"37233050-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Leonid A","orcid":"0000-0002-0977-7989","last_name":"Sazanov","full_name":"Sazanov, Leonid A","id":"338D39FE-F248-11E8-B48F-1D18A9856A87"}],"intvolume":"        74","year":"2022","keyword":["Molecular Biology","Structural Biology"],"article_processing_charge":"Yes (via OA deal)","has_accepted_license":"1","language":[{"iso":"eng"}],"date_published":"2022-06-01T00:00:00Z","citation":{"short":"D. Kampjut, L.A. Sazanov, Current Opinion in Structural Biology 74 (2022).","mla":"Kampjut, Domen, and Leonid A. Sazanov. “Structure of Respiratory Complex I – An Emerging Blueprint for the Mechanism.” <i>Current Opinion in Structural Biology</i>, vol. 74, 102350, Elsevier, 2022, doi:<a href=\"https://doi.org/10.1016/j.sbi.2022.102350\">10.1016/j.sbi.2022.102350</a>.","apa":"Kampjut, D., &#38; Sazanov, L. A. (2022). Structure of respiratory complex I – An emerging blueprint for the mechanism. <i>Current Opinion in Structural Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.sbi.2022.102350\">https://doi.org/10.1016/j.sbi.2022.102350</a>","ista":"Kampjut D, Sazanov LA. 2022. Structure of respiratory complex I – An emerging blueprint for the mechanism. Current Opinion in Structural Biology. 74, 102350.","chicago":"Kampjut, Domen, and Leonid A Sazanov. “Structure of Respiratory Complex I – An Emerging Blueprint for the Mechanism.” <i>Current Opinion in Structural Biology</i>. Elsevier, 2022. <a href=\"https://doi.org/10.1016/j.sbi.2022.102350\">https://doi.org/10.1016/j.sbi.2022.102350</a>.","ama":"Kampjut D, Sazanov LA. Structure of respiratory complex I – An emerging blueprint for the mechanism. <i>Current Opinion in Structural Biology</i>. 2022;74. doi:<a href=\"https://doi.org/10.1016/j.sbi.2022.102350\">10.1016/j.sbi.2022.102350</a>","ieee":"D. Kampjut and L. A. Sazanov, “Structure of respiratory complex I – An emerging blueprint for the mechanism,” <i>Current Opinion in Structural Biology</i>, vol. 74. Elsevier, 2022."},"department":[{"_id":"LeSa"}],"_id":"11167","abstract":[{"text":"Complex I is one of the major respiratory complexes, conserved from bacteria to mammals. It oxidises NADH, reduces quinone and pumps protons across the membrane, thus playing a central role in the oxidative energy metabolism. In this review we discuss our current state of understanding the structure of complex I from various species of mammals, plants, fungi, and bacteria, as well as of several complex I-related proteins. By comparing the structural evidence from these systems in different redox states and data from mutagenesis and molecular simulations, we formulate the mechanisms of electron transfer and proton pumping and explain how they are conformationally and electrostatically coupled. Finally, we discuss the structural basis of the deactivation phenomenon in mammalian complex I.","lang":"eng"}],"date_updated":"2024-10-09T21:02:00Z","isi":1,"oa":1,"type":"journal_article","article_number":"102350","oa_version":"Published Version","date_created":"2022-04-15T09:32:35Z"},{"doi":"10.1038/s41467-022-29423-0","file_date_updated":"2022-05-02T08:48:00Z","month":"04","corr_author":"1","file":[{"creator":"dernst","date_updated":"2022-05-02T08:48:00Z","content_type":"application/pdf","checksum":"db61d5534e988743d6266d3675d77b08","file_size":2637590,"access_level":"open_access","file_name":"2022_NatureCommunications_Gauto.pdf","success":1,"date_created":"2022-05-02T08:48:00Z","relation":"main_file","file_id":"11348"}],"publication_identifier":{"eissn":["2041-1723"]},"day":"08","pmid":1,"status":"public","publisher":"Springer Nature","publication_status":"published","publication":"Nature Communications","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"volume":13,"ddc":["570"],"external_id":{"isi":["000781498700009"],"pmid":["35395851"]},"acknowledgement":"We are grateful to Bernhard Brutscher, Alicia Vallet, and Adrien Favier for excellent NMR\r\nplatform operation and management. The plasmid coding for TET2 was kindly provided\r\nby Bruno Franzetti and Jerome Boisbouvier (IBS Grenoble). We thank Anne-Marie Villard\r\nand the RoBioMol platform for preparing the loop deletion construct. The RoBioMol\r\nplatform is part of the Grenoble Instruct-ERIC center (ISBG; UAR 3518 CNRS-CEAUGA-EMBL) within the Grenoble Partnership for Structural Biology (PSB), supported by FRISBI (ANR-10-INBS-0005-02) and GRAL (ANR-10-LABX-49-01), financed within the University Grenoble Alpes graduate school (Ecoles Universitaires de Recherche) CBHEUR-GS (ANR-17-EURE-0003). This work was supported by the European Research Council (StG-2012-311318-ProtDyn2Function to P. S.) and the French Agence Nationale de la Recherche (ANR), under grant ANR-14-ACHN-0016 (M.P. and A.B.).","quality_controlled":"1","has_accepted_license":"1","language":[{"iso":"eng"}],"department":[{"_id":"PaSc"}],"date_published":"2022-04-08T00:00:00Z","citation":{"ista":"Gauto DF, Macek P, Malinverni D, Fraga H, Paloni M, Sučec I, Hessel A, Bustamante JP, Barducci A, Schanda P. 2022. Functional control of a 0.5 MDa TET aminopeptidase by a flexible loop revealed by MAS NMR. Nature Communications. 13, 1927.","chicago":"Gauto, Diego F., Pavel Macek, Duccio Malinverni, Hugo Fraga, Matteo Paloni, Iva Sučec, Audrey Hessel, Juan Pablo Bustamante, Alessandro Barducci, and Paul Schanda. “Functional Control of a 0.5 MDa TET Aminopeptidase by a Flexible Loop Revealed by MAS NMR.” <i>Nature Communications</i>. Springer Nature, 2022. <a href=\"https://doi.org/10.1038/s41467-022-29423-0\">https://doi.org/10.1038/s41467-022-29423-0</a>.","ama":"Gauto DF, Macek P, Malinverni D, et al. Functional control of a 0.5 MDa TET aminopeptidase by a flexible loop revealed by MAS NMR. <i>Nature Communications</i>. 2022;13. doi:<a href=\"https://doi.org/10.1038/s41467-022-29423-0\">10.1038/s41467-022-29423-0</a>","ieee":"D. F. Gauto <i>et al.</i>, “Functional control of a 0.5 MDa TET aminopeptidase by a flexible loop revealed by MAS NMR,” <i>Nature Communications</i>, vol. 13. Springer Nature, 2022.","short":"D.F. Gauto, P. Macek, D. Malinverni, H. Fraga, M. Paloni, I. Sučec, A. Hessel, J.P. Bustamante, A. Barducci, P. Schanda, Nature Communications 13 (2022).","mla":"Gauto, Diego F., et al. “Functional Control of a 0.5 MDa TET Aminopeptidase by a Flexible Loop Revealed by MAS NMR.” <i>Nature Communications</i>, vol. 13, 1927, Springer Nature, 2022, doi:<a href=\"https://doi.org/10.1038/s41467-022-29423-0\">10.1038/s41467-022-29423-0</a>.","apa":"Gauto, D. F., Macek, P., Malinverni, D., Fraga, H., Paloni, M., Sučec, I., … Schanda, P. (2022). Functional control of a 0.5 MDa TET aminopeptidase by a flexible loop revealed by MAS NMR. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41467-022-29423-0\">https://doi.org/10.1038/s41467-022-29423-0</a>"},"_id":"11179","abstract":[{"text":"Large oligomeric enzymes control a myriad of cellular processes, from protein synthesis and degradation to metabolism. The 0.5 MDa large TET2 aminopeptidase, a prototypical protease important for cellular homeostasis, degrades peptides within a ca. 60 Å wide tetrahedral chamber with four lateral openings. The mechanisms of substrate trafficking and processing remain debated. Here, we integrate magic-angle spinning (MAS) NMR, mutagenesis, co-evolution analysis and molecular dynamics simulations and reveal that a loop in the catalytic chamber is a key element for enzymatic function. The loop is able to stabilize ligands in the active site and may additionally have a direct role in activating the catalytic water molecule whereby a conserved histidine plays a key role. Our data provide a strong case for the functional importance of highly dynamic - and often overlooked - parts of an enzyme, and the potential of MAS NMR to investigate their dynamics at atomic resolution.","lang":"eng"}],"date_updated":"2025-06-11T13:31:55Z","oa":1,"isi":1,"type":"journal_article","article_number":"1927","oa_version":"Published Version","date_created":"2022-04-17T22:01:45Z","scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Functional control of a 0.5 MDa TET aminopeptidase by a flexible loop revealed by MAS NMR","related_material":{"link":[{"url":"https://doi.org/10.1038/s41467-022-31243-1","relation":"erratum"}]},"article_type":"original","intvolume":"        13","author":[{"first_name":"Diego F.","last_name":"Gauto","full_name":"Gauto, Diego F."},{"full_name":"Macek, Pavel","last_name":"Macek","first_name":"Pavel"},{"full_name":"Malinverni, Duccio","first_name":"Duccio","last_name":"Malinverni"},{"full_name":"Fraga, Hugo","first_name":"Hugo","last_name":"Fraga"},{"full_name":"Paloni, Matteo","last_name":"Paloni","first_name":"Matteo"},{"full_name":"Sučec, Iva","first_name":"Iva","last_name":"Sučec"},{"first_name":"Audrey","last_name":"Hessel","full_name":"Hessel, Audrey"},{"first_name":"Juan Pablo","last_name":"Bustamante","full_name":"Bustamante, Juan Pablo"},{"full_name":"Barducci, Alessandro","last_name":"Barducci","first_name":"Alessandro"},{"first_name":"Paul","last_name":"Schanda","orcid":"0000-0002-9350-7606","full_name":"Schanda, Paul","id":"7B541462-FAF6-11E9-A490-E8DFE5697425"}],"year":"2022","article_processing_charge":"No"},{"publication_identifier":{"isbn":["9781450392044"]},"arxiv":1,"status":"public","day":"02","publication_status":"published","publisher":"Association for Computing Machinery","publication":"Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","acknowledgement":"We would like to thank the anonymous reviewers for their useful comments. This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 805223 ScaleML).","external_id":{"arxiv":["2109.00657"],"isi":["000883318200025"]},"quality_controlled":"1","project":[{"_id":"268A44D6-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Elastic Coordination for Scalable Machine Learning","grant_number":"805223"}],"doi":"10.1145/3503221.3508432","month":"04","ec_funded":1,"main_file_link":[{"url":" https://doi.org/10.48550/arXiv.2109.00657","open_access":"1"}],"corr_author":"1","scopus_import":"1","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","title":"Multi-queues can be state-of-the-art priority schedulers","conference":{"name":"PPoPP: Sympopsium on Principles and Practice of Parallel Programming","end_date":"2022-04-06","start_date":"2022-04-02","location":"Seoul, Republic of Korea"},"related_material":{"record":[{"relation":"research_data","status":"public","id":"13076"}]},"author":[{"full_name":"Postnikova, Anastasiia","first_name":"Anastasiia","last_name":"Postnikova"},{"last_name":"Koval","first_name":"Nikita","full_name":"Koval, Nikita","id":"2F4DB10C-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Giorgi","last_name":"Nadiradze","orcid":"0000-0001-5634-0731","id":"3279A00C-F248-11E8-B48F-1D18A9856A87","full_name":"Nadiradze, Giorgi"},{"orcid":"0000-0003-3650-940X","last_name":"Alistarh","first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian"}],"article_processing_charge":"No","year":"2022","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"Designing and implementing efficient parallel priority schedulers is an active research area. An intriguing proposed design is the Multi-Queue: given n threads and m ≥ n distinct priority queues, task insertions are performed uniformly at random, while, to delete, a thread picks two queues uniformly at random, and removes the observed task of higher priority. This approach scales well, and has probabilistic rank guarantees: roughly, the rank of each task removed, relative to remaining tasks in all other queues, is O (m) in expectation. Yet, the performance of this pattern is below that of well-engineered schedulers, which eschew theoretical guarantees for practical efficiency.\r\n\r\nWe investigate whether it is possible to design and implement a Multi-Queue-based task scheduler that is both highly-efficient and has analytical guarantees. We propose a new variant called the Stealing Multi-Queue (SMQ), a cache-efficient variant of the Multi-Queue, which leverages both queue affinity---each thread has a local queue, from which tasks are usually removed; but, with some probability, threads also attempt to steal higher-priority tasks from the other queues---and task batching, that is, the processing of several tasks in a single insert / remove step. These ideas are well-known for task scheduling without priorities; our theoretical contribution is showing that, despite relaxations, this design can still provide rank guarantees, which in turn implies bounds on total work performed. We provide a general SMQ implementation which can surpass state-of-the-art schedulers such as OBIM and PMOD in terms of performance on popular graph-processing benchmarks. Notably, the performance improvement comes mainly from the superior rank guarantees provided by our scheduler, confirming that analytically-reasoned approaches can still provide performance improvements for priority task scheduling."}],"_id":"11180","date_updated":"2025-04-14T07:49:13Z","date_published":"2022-04-02T00:00:00Z","page":"353-367","citation":{"chicago":"Postnikova, Anastasiia, Nikita Koval, Giorgi Nadiradze, and Dan-Adrian Alistarh. “Multi-Queues Can Be State-of-the-Art Priority Schedulers.” In <i>Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming</i>, 353–67. Association for Computing Machinery, 2022. <a href=\"https://doi.org/10.1145/3503221.3508432\">https://doi.org/10.1145/3503221.3508432</a>.","ista":"Postnikova A, Koval N, Nadiradze G, Alistarh D-A. 2022. Multi-queues can be state-of-the-art priority schedulers. Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. PPoPP: Sympopsium on Principles and Practice of Parallel Programming, 353–367.","ieee":"A. Postnikova, N. Koval, G. Nadiradze, and D.-A. Alistarh, “Multi-queues can be state-of-the-art priority schedulers,” in <i>Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming</i>, Seoul, Republic of Korea, 2022, pp. 353–367.","ama":"Postnikova A, Koval N, Nadiradze G, Alistarh D-A. Multi-queues can be state-of-the-art priority schedulers. In: <i>Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming</i>. Association for Computing Machinery; 2022:353-367. doi:<a href=\"https://doi.org/10.1145/3503221.3508432\">10.1145/3503221.3508432</a>","apa":"Postnikova, A., Koval, N., Nadiradze, G., &#38; Alistarh, D.-A. (2022). Multi-queues can be state-of-the-art priority schedulers. In <i>Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming</i> (pp. 353–367). Seoul, Republic of Korea: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3503221.3508432\">https://doi.org/10.1145/3503221.3508432</a>","short":"A. Postnikova, N. Koval, G. Nadiradze, D.-A. Alistarh, in:, Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Association for Computing Machinery, 2022, pp. 353–367.","mla":"Postnikova, Anastasiia, et al. “Multi-Queues Can Be State-of-the-Art Priority Schedulers.” <i>Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming</i>, Association for Computing Machinery, 2022, pp. 353–67, doi:<a href=\"https://doi.org/10.1145/3503221.3508432\">10.1145/3503221.3508432</a>."},"department":[{"_id":"DaAl"}],"isi":1,"oa":1,"type":"conference","oa_version":"Preprint","date_created":"2022-04-17T22:01:46Z"},{"oa":1,"isi":1,"oa_version":"Published Version","date_created":"2022-04-17T22:01:46Z","type":"conference","department":[{"_id":"DaAl"}],"citation":{"ista":"Brown TA, Sigouin W, Alistarh D-A. 2022. PathCAS: An efficient middle ground for concurrent search data structures. Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. PPoPP: Sympopsium on Principles and Practice of Parallel Programming, 385–399.","chicago":"Brown, Trevor A, William Sigouin, and Dan-Adrian Alistarh. “PathCAS: An Efficient Middle Ground for Concurrent Search Data Structures.” In <i>Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming</i>, 385–99. Association for Computing Machinery, 2022. <a href=\"https://doi.org/10.1145/3503221.3508410\">https://doi.org/10.1145/3503221.3508410</a>.","ieee":"T. A. Brown, W. Sigouin, and D.-A. Alistarh, “PathCAS: An efficient middle ground for concurrent search data structures,” in <i>Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming</i>, Seoul, Republic of Korea, 2022, pp. 385–399.","ama":"Brown TA, Sigouin W, Alistarh D-A. PathCAS: An efficient middle ground for concurrent search data structures. In: <i>Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming</i>. Association for Computing Machinery; 2022:385-399. doi:<a href=\"https://doi.org/10.1145/3503221.3508410\">10.1145/3503221.3508410</a>","mla":"Brown, Trevor A., et al. “PathCAS: An Efficient Middle Ground for Concurrent Search Data Structures.” <i>Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming</i>, Association for Computing Machinery, 2022, pp. 385–99, doi:<a href=\"https://doi.org/10.1145/3503221.3508410\">10.1145/3503221.3508410</a>.","short":"T.A. Brown, W. Sigouin, D.-A. Alistarh, in:, Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Association for Computing Machinery, 2022, pp. 385–399.","apa":"Brown, T. A., Sigouin, W., &#38; Alistarh, D.-A. (2022). PathCAS: An efficient middle ground for concurrent search data structures. In <i>Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming</i> (pp. 385–399). Seoul, Republic of Korea: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3503221.3508410\">https://doi.org/10.1145/3503221.3508410</a>"},"page":"385-399","date_published":"2022-04-02T00:00:00Z","abstract":[{"lang":"eng","text":"To maximize the performance of concurrent data structures, researchers have often turned to highly complex fine-grained techniques, resulting in efficient and elegant algorithms, which can however be often difficult to understand and prove correct. While simpler techniques exist, such as transactional memory, they can have limited performance or portability relative to their fine-grained counterparts. Approaches at both ends of this complexity-performance spectrum have been extensively explored, but relatively less is known about the middle ground: approaches that are willing to sacrifice some performance for simplicity, while remaining competitive with state-of-the-art handcrafted designs. In this paper, we explore this middle ground, and present PathCAS, a primitive that combines ideas from multi-word CAS (KCAS) and transactional memory approaches, while carefully avoiding overhead. We show how PathCAS can be used to implement efficient search data structures relatively simply, using an internal binary search tree as an example, then extending this to an AVL tree. Our best implementations outperform many handcrafted search trees: in search-heavy workloads, it rivals the BCCO tree [5], the fastest known concurrent binary tree in terms of search performance [3]. Our results suggest that PathCAS can yield concurrent data structures that are relatively easy to build and prove correct, while offering surprisingly high performance."}],"_id":"11181","date_updated":"2024-10-09T21:02:23Z","has_accepted_license":"1","language":[{"iso":"eng"}],"author":[{"last_name":"Brown","first_name":"Trevor A","id":"3569F0A0-F248-11E8-B48F-1D18A9856A87","full_name":"Brown, Trevor A"},{"full_name":"Sigouin, William","last_name":"Sigouin","first_name":"William"},{"first_name":"Dan-Adrian","last_name":"Alistarh","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"}],"year":"2022","article_processing_charge":"No","conference":{"start_date":"2022-04-02","location":"Seoul, Republic of Korea","name":"PPoPP: Sympopsium on Principles and Practice of Parallel Programming","end_date":"2022-04-06"},"title":"PathCAS: An efficient middle ground for concurrent search data structures","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","scopus_import":"1","corr_author":"1","doi":"10.1145/3503221.3508410","file_date_updated":"2022-08-05T09:19:29Z","month":"04","quality_controlled":"1","ddc":["000"],"external_id":{"isi":["000883318200027"]},"acknowledgement":"This work was supported by: the Natural Sciences and Engineering Research Council of Canada (NSERC) Collaborative Research and Development grant: CRDPJ 539431-19, the\r\nCanada Foundation for Innovation John R. Evans Leaders Fund with equal support from the Ontario Research Fund CFI Leaders Opportunity Fund: 38512, Waterloo Huawei Joint Innovation Lab project “Scalable Infrastructure for Next Generation Data Management Systems”, NSERC Discovery Launch Supplement: DGECR-2019-00048, NSERC Discovery\r\nProgram under the grants: RGPIN-2019-04227 and RGPIN04512-2018, and the University of Waterloo. We would also like to thank the reviewers for their insightful comments.","day":"02","status":"public","file":[{"content_type":"application/pdf","checksum":"8ceea411fa133795cd4903529498eb6b","date_updated":"2022-08-05T09:19:29Z","creator":"dernst","access_level":"open_access","file_name":"2022_PPoPP_Brown.pdf","success":1,"file_size":1128343,"date_created":"2022-08-05T09:19:29Z","relation":"main_file","file_id":"11731"}],"publication_identifier":{"isbn":["9781450392044"]},"publication":"Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"publisher":"Association for Computing Machinery","publication_status":"published"},{"OA_place":"publisher","month":"04","OA_type":"hybrid","doi":"10.1002/cpz1.407","file_date_updated":"2022-05-02T08:16:10Z","external_id":{"pmid":["35384410"]},"ddc":["570"],"acknowledgement":"We thank Kasia Stefanowski for excellent technical assistance, and the Core Facility Bioimaging of the Biomedical Center (BMC) of the Ludwig-Maximilian University for excellent support. We gratefully acknowledge financial support from the Peter Hans Hofschneider Professorship of the Stiftung Experimentelle Biomedizin (to J.R), from the DFG (Collaborative Research Center SFB914, project A12; and Priority Programme SPP2332, project 492014049; both to J.R) and from the LMU Institutional Strategy LMU-Excellent within the framework of the German Excellence Initiative (to J.R).\r\nOpen access funding enabled and organized by Projekt DEAL.","quality_controlled":"1","publisher":"Wiley","publication_status":"published","publication":"Current Protocols","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"volume":2,"file":[{"date_created":"2022-05-02T08:16:10Z","relation":"main_file","file_id":"11347","content_type":"application/pdf","checksum":"72152d005c367777f6cf2f6a477f0d52","date_updated":"2022-05-02T08:16:10Z","creator":"dernst","access_level":"open_access","file_name":"2022_CurrentProtocols_Kroll.pdf","success":1,"file_size":2142703}],"publication_identifier":{"eissn":["2691-1299"]},"pmid":1,"day":"05","status":"public","type":"journal_article","article_number":"e407","oa_version":"Published Version","date_created":"2022-04-17T22:01:46Z","oa":1,"issue":"4","has_accepted_license":"1","language":[{"iso":"eng"}],"citation":{"ama":"Kroll J, Ruiz-Fernandez MJA, Braun MB, Merrin J, Renkawitz J. Quantifying the probing and selection of microenvironmental pores by motile immune cells. <i>Current Protocols</i>. 2022;2(4). doi:<a href=\"https://doi.org/10.1002/cpz1.407\">10.1002/cpz1.407</a>","ieee":"J. Kroll, M. J. A. Ruiz-Fernandez, M. B. Braun, J. Merrin, and J. Renkawitz, “Quantifying the probing and selection of microenvironmental pores by motile immune cells,” <i>Current Protocols</i>, vol. 2, no. 4. Wiley, 2022.","ista":"Kroll J, Ruiz-Fernandez MJA, Braun MB, Merrin J, Renkawitz J. 2022. Quantifying the probing and selection of microenvironmental pores by motile immune cells. Current Protocols. 2(4), e407.","chicago":"Kroll, Janina, Mauricio J.A. Ruiz-Fernandez, Malte B. Braun, Jack Merrin, and Jörg Renkawitz. “Quantifying the Probing and Selection of Microenvironmental Pores by Motile Immune Cells.” <i>Current Protocols</i>. Wiley, 2022. <a href=\"https://doi.org/10.1002/cpz1.407\">https://doi.org/10.1002/cpz1.407</a>.","short":"J. Kroll, M.J.A. Ruiz-Fernandez, M.B. Braun, J. Merrin, J. Renkawitz, Current Protocols 2 (2022).","mla":"Kroll, Janina, et al. “Quantifying the Probing and Selection of Microenvironmental Pores by Motile Immune Cells.” <i>Current Protocols</i>, vol. 2, no. 4, e407, Wiley, 2022, doi:<a href=\"https://doi.org/10.1002/cpz1.407\">10.1002/cpz1.407</a>.","apa":"Kroll, J., Ruiz-Fernandez, M. J. A., Braun, M. B., Merrin, J., &#38; Renkawitz, J. (2022). Quantifying the probing and selection of microenvironmental pores by motile immune cells. <i>Current Protocols</i>. Wiley. <a href=\"https://doi.org/10.1002/cpz1.407\">https://doi.org/10.1002/cpz1.407</a>"},"date_published":"2022-04-05T00:00:00Z","department":[{"_id":"NanoFab"}],"date_updated":"2024-10-14T13:16:54Z","_id":"11182","abstract":[{"lang":"eng","text":"Immune cells are constantly on the move through multicellular organisms to explore and respond to pathogens and other harmful insults. While moving, immune cells efficiently traverse microenvironments composed of tissue cells and extracellular fibers, which together form complex environments of various porosity, stiffness, topography, and chemical composition. In this protocol we describe experimental procedures to investigate immune cell migration through microenvironments of heterogeneous porosity. In particular, we describe micro-channels, micro-pillars, and collagen networks as cell migration paths with alternative pore size choices. Employing micro-channels or micro-pillars that divide at junctions into alternative paths with initially differentially sized pores allows us to precisely (1) measure the cellular translocation time through these porous path junctions, (2) quantify the cellular preference for individual pore sizes, and (3) image cellular components like the nucleus and the cytoskeleton. This reductionistic experimental setup thus can elucidate how immune cells perform decisions in complex microenvironments of various porosity like the interstitium. The setup further allows investigation of the underlying forces of cellular squeezing and the consequences of cellular deformation on the integrity of the cell and its organelles. As a complementary approach that does not require any micro-engineering expertise, we describe the usage of three-dimensional collagen networks with different pore sizes. Whereas we here focus on dendritic cells as a model for motile immune cells, the described protocols are versatile as they are also applicable for other immune cell types like neutrophils and non-immune cell types such as mesenchymal and cancer cells. In summary, we here describe protocols to identify the mechanisms and principles of cellular probing, decision making, and squeezing during cellular movement through microenvironments of heterogeneous porosity."}],"year":"2022","article_processing_charge":"No","article_type":"original","author":[{"last_name":"Kroll","first_name":"Janina","full_name":"Kroll, Janina"},{"full_name":"Ruiz-Fernandez, Mauricio J.A.","first_name":"Mauricio J.A.","last_name":"Ruiz-Fernandez"},{"last_name":"Braun","first_name":"Malte B.","full_name":"Braun, Malte B."},{"first_name":"Jack","last_name":"Merrin","orcid":"0000-0001-5145-4609","id":"4515C308-F248-11E8-B48F-1D18A9856A87","full_name":"Merrin, Jack"},{"id":"3F0587C8-F248-11E8-B48F-1D18A9856A87","full_name":"Renkawitz, Jörg","first_name":"Jörg","last_name":"Renkawitz","orcid":"0000-0003-2856-3369"}],"intvolume":"         2","scopus_import":"1","title":"Quantifying the probing and selection of microenvironmental pores by motile immune cells","user_id":"0043cee0-e5fc-11ee-9736-f83bc23afbf0"},{"alternative_title":["LIPIcs"],"conference":{"start_date":"2021-12-13","location":"Strasbourg, France","end_date":"2021-12-15","name":"OPODIS"},"title":"Beyond distributed subgraph detection: Induced subgraphs, multicolored problems and graph parameters","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","year":"2022","article_processing_charge":"No","intvolume":"       217","author":[{"full_name":"Nikabadi, Amir","first_name":"Amir","last_name":"Nikabadi"},{"last_name":"Korhonen","first_name":"Janne","full_name":"Korhonen, Janne","id":"C5402D42-15BC-11E9-A202-CA2BE6697425"}],"editor":[{"full_name":"Bramas, Quentin","first_name":"Quentin","last_name":"Bramas"},{"first_name":"Vincent","last_name":"Gramoli","full_name":"Gramoli, Vincent"},{"last_name":"Milani","first_name":"Alessia","full_name":"Milani, Alessia"}],"date_published":"2022-02-01T00:00:00Z","citation":{"chicago":"Nikabadi, Amir, and Janne Korhonen. “Beyond Distributed Subgraph Detection: Induced Subgraphs, Multicolored Problems and Graph Parameters.” In <i>25th International Conference on Principles of Distributed Systems</i>, edited by Quentin Bramas, Vincent Gramoli, and Alessia Milani, Vol. 217. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. <a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2021.15\">https://doi.org/10.4230/LIPIcs.OPODIS.2021.15</a>.","ista":"Nikabadi A, Korhonen J. 2022. Beyond distributed subgraph detection: Induced subgraphs, multicolored problems and graph parameters. 25th International Conference on Principles of Distributed Systems. OPODIS, LIPIcs, vol. 217, 15.","ieee":"A. Nikabadi and J. Korhonen, “Beyond distributed subgraph detection: Induced subgraphs, multicolored problems and graph parameters,” in <i>25th International Conference on Principles of Distributed Systems</i>, Strasbourg, France, 2022, vol. 217.","ama":"Nikabadi A, Korhonen J. Beyond distributed subgraph detection: Induced subgraphs, multicolored problems and graph parameters. In: Bramas Q, Gramoli V, Milani A, eds. <i>25th International Conference on Principles of Distributed Systems</i>. Vol 217. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022. doi:<a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2021.15\">10.4230/LIPIcs.OPODIS.2021.15</a>","apa":"Nikabadi, A., &#38; Korhonen, J. (2022). Beyond distributed subgraph detection: Induced subgraphs, multicolored problems and graph parameters. In Q. Bramas, V. Gramoli, &#38; A. Milani (Eds.), <i>25th International Conference on Principles of Distributed Systems</i> (Vol. 217). Strasbourg, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2021.15\">https://doi.org/10.4230/LIPIcs.OPODIS.2021.15</a>","short":"A. Nikabadi, J. Korhonen, in:, Q. Bramas, V. Gramoli, A. Milani (Eds.), 25th International Conference on Principles of Distributed Systems, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.","mla":"Nikabadi, Amir, and Janne Korhonen. “Beyond Distributed Subgraph Detection: Induced Subgraphs, Multicolored Problems and Graph Parameters.” <i>25th International Conference on Principles of Distributed Systems</i>, edited by Quentin Bramas et al., vol. 217, 15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, doi:<a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2021.15\">10.4230/LIPIcs.OPODIS.2021.15</a>."},"department":[{"_id":"DaAl"}],"_id":"11183","date_updated":"2025-04-14T07:49:13Z","abstract":[{"text":"Subgraph detection has recently been one of the most studied problems in the CONGEST model of distributed computing. In this work, we study the distributed complexity of problems closely related to subgraph detection, mainly focusing on induced subgraph detection. The main line of this work presents lower bounds and parameterized algorithms w.r.t structural parameters of the input graph:\r\n- On general graphs, we give unconditional lower bounds for induced detection of cycles and patterns of treewidth 2 in CONGEST. Moreover, by adapting reductions from centralized parameterized complexity, we prove lower bounds in CONGEST for detecting patterns with a 4-clique, and for induced path detection conditional on the hardness of triangle detection in the congested clique.\r\n- On graphs of bounded degeneracy, we show that induced paths can be detected fast in CONGEST using techniques from parameterized algorithms, while detecting cycles and patterns of treewidth 2 is hard.\r\n- On graphs of bounded vertex cover number, we show that induced subgraph detection is easy in CONGEST for any pattern graph. More specifically, we adapt a centralized parameterized algorithm for a more general maximum common induced subgraph detection problem to the distributed setting. In addition to these induced subgraph detection results, we study various related problems in the CONGEST and congested clique models, including for multicolored versions of subgraph-detection-like problems.","lang":"eng"}],"has_accepted_license":"1","language":[{"iso":"eng"}],"date_created":"2022-04-17T22:01:47Z","oa_version":"Published Version","type":"conference","article_number":"15","oa":1,"publication":"25th International Conference on Principles of Distributed Systems","volume":217,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","publication_status":"published","day":"01","status":"public","file":[{"file_size":790396,"access_level":"open_access","file_name":"2022_LIPICs_Nikabadi.pdf","success":1,"date_updated":"2022-05-02T07:53:00Z","creator":"dernst","content_type":"application/pdf","checksum":"626551c14de5d4091573200ed0535752","file_id":"11345","relation":"main_file","date_created":"2022-05-02T07:53:00Z"}],"publication_identifier":{"issn":["1868-8969"],"isbn":["9783959772198"]},"quality_controlled":"1","ddc":["510"],"acknowledgement":"Amir Nikabadi: Supported by the LABEX MILYON (ANR-10-LABX-0070) of Université de Lyon, within the program “Investissements d’Avenir” (ANR-11-IDEX-0007) operated by the French National Research Agency (ANR). Janne H. Korhonen: Supported by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 805223 ScaleML).\r\nWe thank François Le Gall and Masayuki Miyamoto for sharing their work on lower bounds for induced subgraph detection [36].","month":"02","doi":"10.4230/LIPIcs.OPODIS.2021.15","file_date_updated":"2022-05-02T07:53:00Z","project":[{"call_identifier":"H2020","name":"Elastic Coordination for Scalable Machine Learning","grant_number":"805223","_id":"268A44D6-B435-11E9-9278-68D0E5697425"}],"corr_author":"1","ec_funded":1},{"status":"public","day":"01","publication_identifier":{"issn":["1868-8969"],"isbn":["9783959772198"]},"file":[{"relation":"main_file","date_created":"2022-05-02T08:06:33Z","file_id":"11346","creator":"dernst","date_updated":"2022-05-02T08:06:33Z","content_type":"application/pdf","checksum":"2c7c982174c6f98c4ca6e92539d15086","file_size":959406,"file_name":"2022_LIPICs_Alistarh.pdf","access_level":"open_access","success":1}],"arxiv":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"volume":217,"publication":"25th International Conference on Principles of Distributed Systems","publication_status":"published","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","acknowledgement":"Dan Alistarh: This project has received funding from the European Research Council (ERC)\r\nunder the European Union’s Horizon 2020 research and innovation programme (grant agreement No.805223 ScaleML).\r\nJoel Rybicki: This project has received from the European Union’s Horizon 2020 research and\r\ninnovation programme under the Marie Skłodowska-Curie grant agreement No. 840605.\r\nAcknowledgements We grateful to Giorgi Nadiradze for pointing out a generalisation of the phase clock construction to non-regular graphs. We also thank anonymous reviewers for their useful comments on earlier versions of this manuscript.","ddc":["510"],"external_id":{"arxiv":["2102.08808"]},"file_date_updated":"2022-05-02T08:06:33Z","doi":"10.4230/LIPIcs.OPODIS.2021.14","project":[{"_id":"268A44D6-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Elastic Coordination for Scalable Machine Learning","grant_number":"805223"},{"_id":"26A5D39A-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Coordination in constrained and natural distributed systems","grant_number":"840605"}],"month":"02","ec_funded":1,"corr_author":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Fast graphical population protocols","conference":{"end_date":"2021-12-15","name":"OPODIS","start_date":"2021-12-13","location":"Strasbourg, France"},"scopus_import":"1","alternative_title":["LIPIcs"],"author":[{"first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Gelashvili","first_name":"Rati","full_name":"Gelashvili, Rati"},{"id":"334EFD2E-F248-11E8-B48F-1D18A9856A87","full_name":"Rybicki, Joel","orcid":"0000-0002-6432-6646","last_name":"Rybicki","first_name":"Joel"}],"intvolume":"       217","editor":[{"first_name":"Quentin","last_name":"Bramas","full_name":"Bramas, Quentin"},{"full_name":"Gramoli, Vincent","first_name":"Vincent","last_name":"Gramoli"},{"full_name":"Milani, Alessia","first_name":"Alessia","last_name":"Milani"}],"article_processing_charge":"No","year":"2022","abstract":[{"lang":"eng","text":"Let G be a graph on n nodes. In the stochastic population protocol model, a collection of n indistinguishable, resource-limited nodes collectively solve tasks via pairwise interactions. In each interaction, two randomly chosen neighbors first read each other’s states, and then update their local states. A rich line of research has established tight upper and lower bounds on the complexity of fundamental tasks, such as majority and leader election, in this model, when G is a clique. Specifically, in the clique, these tasks can be solved fast, i.e., in n polylog n pairwise interactions, with high probability, using at most polylog n states per node.\r\nIn this work, we consider the more general setting where G is an arbitrary regular graph, and present a technique for simulating protocols designed for fully-connected networks in any connected regular graph. Our main result is a simulation that is efficient on many interesting graph families: roughly, the simulation overhead is polylogarithmic in the number of nodes, and quadratic in the conductance of the graph. As a sample application, we show that, in any regular graph with conductance φ, both leader election and exact majority can be solved in φ^{-2} ⋅ n polylog n pairwise interactions, with high probability, using at most φ^{-2} ⋅ polylog n states per node. This shows that there are fast and space-efficient population protocols for leader election and exact majority on graphs with good expansion properties. We believe our results will prove generally useful, as they allow efficient technology transfer between the well-mixed (clique) case, and the under-explored spatial setting."}],"_id":"11184","date_updated":"2025-04-14T07:49:13Z","date_published":"2022-02-01T00:00:00Z","department":[{"_id":"DaAl"}],"citation":{"chicago":"Alistarh, Dan-Adrian, Rati Gelashvili, and Joel Rybicki. “Fast Graphical Population Protocols.” In <i>25th International Conference on Principles of Distributed Systems</i>, edited by Quentin Bramas, Vincent Gramoli, and Alessia Milani, Vol. 217. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. <a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2021.14\">https://doi.org/10.4230/LIPIcs.OPODIS.2021.14</a>.","ista":"Alistarh D-A, Gelashvili R, Rybicki J. 2022. Fast graphical population protocols. 25th International Conference on Principles of Distributed Systems. OPODIS, LIPIcs, vol. 217, 14.","ama":"Alistarh D-A, Gelashvili R, Rybicki J. Fast graphical population protocols. In: Bramas Q, Gramoli V, Milani A, eds. <i>25th International Conference on Principles of Distributed Systems</i>. Vol 217. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022. doi:<a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2021.14\">10.4230/LIPIcs.OPODIS.2021.14</a>","ieee":"D.-A. Alistarh, R. Gelashvili, and J. Rybicki, “Fast graphical population protocols,” in <i>25th International Conference on Principles of Distributed Systems</i>, Strasbourg, France, 2022, vol. 217.","apa":"Alistarh, D.-A., Gelashvili, R., &#38; Rybicki, J. (2022). Fast graphical population protocols. In Q. Bramas, V. Gramoli, &#38; A. Milani (Eds.), <i>25th International Conference on Principles of Distributed Systems</i> (Vol. 217). Strasbourg, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2021.14\">https://doi.org/10.4230/LIPIcs.OPODIS.2021.14</a>","mla":"Alistarh, Dan-Adrian, et al. “Fast Graphical Population Protocols.” <i>25th International Conference on Principles of Distributed Systems</i>, edited by Quentin Bramas et al., vol. 217, 14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, doi:<a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2021.14\">10.4230/LIPIcs.OPODIS.2021.14</a>.","short":"D.-A. Alistarh, R. Gelashvili, J. Rybicki, in:, Q. Bramas, V. Gramoli, A. Milani (Eds.), 25th International Conference on Principles of Distributed Systems, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022."},"language":[{"iso":"eng"}],"has_accepted_license":"1","oa":1,"oa_version":"Published Version","date_created":"2022-04-17T22:01:47Z","article_number":"14","type":"conference"},{"scopus_import":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","title":"Approximating the bundled crossing number","conference":{"start_date":"2022-03-24","location":"Jember, Indonesia","end_date":"2022-03-26","name":"WALCOM: Algorithms and Computation"},"related_material":{"record":[{"id":"13969","status":"public","relation":"later_version"}]},"author":[{"first_name":"Alan M","orcid":"0000-0003-2401-8670","last_name":"Arroyo Guevara","full_name":"Arroyo Guevara, Alan M","id":"3207FDC6-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Felsner, Stefan","first_name":"Stefan","last_name":"Felsner"}],"intvolume":"     13174","article_processing_charge":"No","year":"2022","language":[{"iso":"eng"}],"abstract":[{"text":"Bundling crossings is a strategy which can enhance the readability of graph drawings. In this paper we consider bundlings for families of pseudosegments, i.e., simple curves such that any two have share at most one point at which they cross. Our main result is that there is a polynomial-time algorithm to compute an 8-approximation of the bundled crossing number of such instances (up to adding a term depending on the facial structure). This 8-approximation also holds for bundlings of good drawings of graphs. In the special case of circular drawings the approximation factor is 8 (no extra term), this improves upon the 10-approximation of Fink et al. [6]. We also show how to compute a 92-approximation when the intersection graph of the pseudosegments is bipartite.","lang":"eng"}],"_id":"11185","date_updated":"2025-09-10T09:35:56Z","page":"383-395","citation":{"ama":"Arroyo Guevara AM, Felsner S. Approximating the bundled crossing number. In: <i>WALCOM 2022: Algorithms and Computation</i>. Vol 13174. LNCS. Springer Nature; 2022:383-395. doi:<a href=\"https://doi.org/10.1007/978-3-030-96731-4_31\">10.1007/978-3-030-96731-4_31</a>","ieee":"A. M. Arroyo Guevara and S. Felsner, “Approximating the bundled crossing number,” in <i>WALCOM 2022: Algorithms and Computation</i>, Jember, Indonesia, 2022, vol. 13174, pp. 383–395.","chicago":"Arroyo Guevara, Alan M, and Stefan Felsner. “Approximating the Bundled Crossing Number.” In <i>WALCOM 2022: Algorithms and Computation</i>, 13174:383–95. LNCS. Springer Nature, 2022. <a href=\"https://doi.org/10.1007/978-3-030-96731-4_31\">https://doi.org/10.1007/978-3-030-96731-4_31</a>.","ista":"Arroyo Guevara AM, Felsner S. 2022. Approximating the bundled crossing number. WALCOM 2022: Algorithms and Computation. WALCOM: Algorithms and ComputationLNCS vol. 13174, 383–395.","apa":"Arroyo Guevara, A. M., &#38; Felsner, S. (2022). Approximating the bundled crossing number. In <i>WALCOM 2022: Algorithms and Computation</i> (Vol. 13174, pp. 383–395). Jember, Indonesia: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-96731-4_31\">https://doi.org/10.1007/978-3-030-96731-4_31</a>","mla":"Arroyo Guevara, Alan M., and Stefan Felsner. “Approximating the Bundled Crossing Number.” <i>WALCOM 2022: Algorithms and Computation</i>, vol. 13174, Springer Nature, 2022, pp. 383–95, doi:<a href=\"https://doi.org/10.1007/978-3-030-96731-4_31\">10.1007/978-3-030-96731-4_31</a>.","short":"A.M. Arroyo Guevara, S. Felsner, in:, WALCOM 2022: Algorithms and Computation, Springer Nature, 2022, pp. 383–395."},"date_published":"2022-03-16T00:00:00Z","department":[{"_id":"UlWa"}],"isi":1,"oa":1,"type":"conference","date_created":"2022-04-17T22:01:47Z","oa_version":"Preprint","publication_identifier":{"issn":["0302-9743"],"isbn":["9783030967307"],"eissn":["1611-3349"]},"arxiv":1,"status":"public","day":"16","publication_status":"published","publisher":"Springer Nature","volume":13174,"series_title":"LNCS","publication":"WALCOM 2022: Algorithms and Computation","acknowledgement":"This work was initiated during the Workshop on Geometric Graphs in November 2019 in Strobl, Austria. We would like to thank Oswin Aichholzer, Fabian Klute, Man-Kwun Chiu, Martin Balko, Pavel Valtr for their avid discussions during the workshop. The first author has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska Curie grant agreement No 754411. The second author has been supported by the German Research Foundation DFG Project FE 340/12-1.","external_id":{"arxiv":["2109.14892"],"isi":["001435074700031"]},"quality_controlled":"1","project":[{"name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"doi":"10.1007/978-3-030-96731-4_31","month":"03","main_file_link":[{"open_access":"1","url":" https://doi.org/10.48550/arXiv.2109.14892"}],"ec_funded":1}]