[{"date_updated":"2025-04-15T07:23:30Z","department":[{"_id":"KrCh"}],"month":"09","title":"Faster algorithms for quantitative verification in bounded treewidth graphs","isi":1,"date_published":"2021-09-01T00:00:00Z","year":"2021","citation":{"mla":"Chatterjee, Krishnendu, et al. “Faster Algorithms for Quantitative Verification in Bounded Treewidth Graphs.” <i>Formal Methods in System Design</i>, vol. 57, Springer, 2021, pp. 401–28, doi:<a href=\"https://doi.org/10.1007/s10703-021-00373-5\">10.1007/s10703-021-00373-5</a>.","ieee":"K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, “Faster algorithms for quantitative verification in bounded treewidth graphs,” <i>Formal Methods in System Design</i>, vol. 57. Springer, pp. 401–428, 2021.","ista":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2021. Faster algorithms for quantitative verification in bounded treewidth graphs. Formal Methods in System Design. 57, 401–428.","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Faster Algorithms for Quantitative Verification in Bounded Treewidth Graphs.” <i>Formal Methods in System Design</i>. Springer, 2021. <a href=\"https://doi.org/10.1007/s10703-021-00373-5\">https://doi.org/10.1007/s10703-021-00373-5</a>.","ama":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. Faster algorithms for quantitative verification in bounded treewidth graphs. <i>Formal Methods in System Design</i>. 2021;57:401-428. doi:<a href=\"https://doi.org/10.1007/s10703-021-00373-5\">10.1007/s10703-021-00373-5</a>","apa":"Chatterjee, K., Ibsen-Jensen, R., &#38; Pavlogiannis, A. (2021). Faster algorithms for quantitative verification in bounded treewidth graphs. <i>Formal Methods in System Design</i>. Springer. <a href=\"https://doi.org/10.1007/s10703-021-00373-5\">https://doi.org/10.1007/s10703-021-00373-5</a>","short":"K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Formal Methods in System Design 57 (2021) 401–428."},"publication_status":"published","publication_identifier":{"issn":["0925-9856"],"eissn":["1572-8102"]},"article_processing_charge":"No","publisher":"Springer","doi":"10.1007/s10703-021-00373-5","main_file_link":[{"url":"https://arxiv.org/abs/1504.07384","open_access":"1"}],"abstract":[{"text":"We consider the core algorithmic problems related to verification of systems with respect to three classical quantitative properties, namely, the mean-payoff, the ratio, and the minimum initial credit for energy property. The algorithmic problem given a graph and a quantitative property asks to compute the optimal value (the infimum value over all traces) from every node of the graph. We consider graphs with bounded treewidth—a class that contains the control flow graphs of most programs. Let n denote the number of nodes of a graph, m the number of edges (for bounded treewidth 𝑚=𝑂(𝑛)) and W the largest absolute value of the weights. Our main theoretical results are as follows. First, for the minimum initial credit problem we show that (1) for general graphs the problem can be solved in 𝑂(𝑛2⋅𝑚) time and the associated decision problem in 𝑂(𝑛⋅𝑚) time, improving the previous known 𝑂(𝑛3⋅𝑚⋅log(𝑛⋅𝑊)) and 𝑂(𝑛2⋅𝑚) bounds, respectively; and (2) for bounded treewidth graphs we present an algorithm that requires 𝑂(𝑛⋅log𝑛) time. Second, for bounded treewidth graphs we present an algorithm that approximates the mean-payoff value within a factor of 1+𝜖 in time 𝑂(𝑛⋅log(𝑛/𝜖)) as compared to the classical exact algorithms on general graphs that require quadratic time. Third, for the ratio property we present an algorithm that for bounded treewidth graphs works in time 𝑂(𝑛⋅log(|𝑎⋅𝑏|))=𝑂(𝑛⋅log(𝑛⋅𝑊)), when the output is 𝑎𝑏, as compared to the previously best known algorithm on general graphs with running time 𝑂(𝑛2⋅log(𝑛⋅𝑊)). We have implemented some of our algorithms and show that they present a significant speedup on standard benchmarks.","lang":"eng"}],"article_type":"original","volume":57,"day":"01","oa_version":"Preprint","ec_funded":1,"quality_controlled":"1","external_id":{"isi":["000645490300001"],"arxiv":["1504.07384"]},"project":[{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"author":[{"orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Rasmus","orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","last_name":"Ibsen-Jensen"},{"first_name":"Andreas","orcid":"0000-0002-8943-0722","last_name":"Pavlogiannis","id":"49704004-F248-11E8-B48F-1D18A9856A87","full_name":"Pavlogiannis, Andreas"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"The research was partly supported by Austrian Science Fund (FWF) Grant No P23499- N23, FWF NFN Grant No S11407-N23 (RiSE/SHiNE), ERC Start Grant (279307: Graph Games), and Microsoft faculty fellows award.","type":"journal_article","oa":1,"_id":"9393","arxiv":1,"page":"401-428","intvolume":"        57","date_created":"2021-05-16T22:01:47Z","scopus_import":"1","status":"public","publication":"Formal Methods in System Design","language":[{"iso":"eng"}]},{"date_updated":"2023-02-23T13:57:04Z","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"month":"03","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Schmid","full_name":"Schmid, Laura","id":"38B437DE-F248-11E8-B48F-1D18A9856A87","first_name":"Laura","orcid":"0000-0002-6978-7329"},{"last_name":"Hilbe","full_name":"Hilbe, Christian","first_name":"Christian"}],"type":"book_chapter","title":"The evolution of strategic ignorance in strategic interaction","year":"2021","oa":1,"date_published":"2021-03-01T00:00:00Z","citation":{"ista":"Schmid L, Hilbe C. 2021.The evolution of strategic ignorance in strategic interaction. In: Deliberate Ignorance: Choosing Not To Know. vol. 29, 139–152.","mla":"Schmid, Laura, and Christian Hilbe. “The Evolution of Strategic Ignorance in Strategic Interaction.” <i>Deliberate Ignorance: Choosing Not To Know</i>, edited by Ralph Hertwig and Christoph Engel, vol. 29, MIT Press, 2021, pp. 139–52.","ieee":"L. Schmid and C. Hilbe, “The evolution of strategic ignorance in strategic interaction,” in <i>Deliberate Ignorance: Choosing Not To Know</i>, vol. 29, R. Hertwig and C. Engel, Eds. MIT Press, 2021, pp. 139–152.","apa":"Schmid, L., &#38; Hilbe, C. (2021). The evolution of strategic ignorance in strategic interaction. In R. Hertwig &#38; C. Engel (Eds.), <i>Deliberate Ignorance: Choosing Not To Know</i> (Vol. 29, pp. 139–152). MIT Press.","short":"L. Schmid, C. Hilbe, in:, R. Hertwig, C. Engel (Eds.), Deliberate Ignorance: Choosing Not To Know, MIT Press, 2021, pp. 139–152.","chicago":"Schmid, Laura, and Christian Hilbe. “The Evolution of Strategic Ignorance in Strategic Interaction.” In <i>Deliberate Ignorance: Choosing Not To Know</i>, edited by Ralph Hertwig and Christoph Engel, 29:139–52. Strüngmann Forum Reports. MIT Press, 2021.","ama":"Schmid L, Hilbe C. The evolution of strategic ignorance in strategic interaction. In: Hertwig R, Engel C, eds. <i>Deliberate Ignorance: Choosing Not To Know</i>. Vol 29. Strüngmann Forum Reports. MIT Press; 2021:139-152."},"editor":[{"last_name":"Hertwig","full_name":"Hertwig, Ralph","first_name":"Ralph"},{"full_name":"Engel, Christoph","last_name":"Engel","first_name":"Christoph"}],"article_processing_charge":"No","publisher":"MIT Press","publication_identifier":{"isbn":["978-0-262-04559-9"]},"_id":"9403","main_file_link":[{"open_access":"1","url":"https://esforum.de/publications/PDFs/sfr29/SFR29_09_Hilbe%20and%20Schmid.pdf"}],"series_title":"Strüngmann Forum Reports","abstract":[{"text":"Optimal decision making requires individuals to know their available options and to anticipate correctly what consequences these options have. In many social interactions, however, we refrain from gathering all relevant information, even if this information would help us make better decisions and is costless to obtain. This chapter examines several examples of “deliberate ignorance.” Two simple models are proposed to illustrate how ignorance can evolve among self-interested and payoff - maximizing individuals, and open problems are highlighted that lie ahead for future research to explore.","lang":"eng"}],"intvolume":"        29","page":"139-152","status":"public","date_created":"2021-05-19T12:25:42Z","oa_version":"Published Version","day":"01","volume":29,"publication":"Deliberate Ignorance: Choosing Not To Know","language":[{"iso":"eng"}],"quality_controlled":"1"},{"oa":1,"_id":"9408","file_date_updated":"2021-05-25T15:08:49Z","issue":"6","type":"journal_article","author":[{"last_name":"Feng","full_name":"Feng, Xudong","first_name":"Xudong"},{"last_name":"Liu","full_name":"Liu, Jiafeng","first_name":"Jiafeng"},{"first_name":"Huamin","last_name":"Wang","full_name":"Wang, Huamin"},{"last_name":"Yang","full_name":"Yang, Yin","first_name":"Yin"},{"full_name":"Bao, Hujun","last_name":"Bao","first_name":"Hujun"},{"last_name":"Bickel","full_name":"Bickel, Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87","first_name":"Bernd","orcid":"0000-0001-6511-9385"},{"full_name":"Xu, Weiwei","last_name":"Xu","first_name":"Weiwei"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"The authors would like to thank anonymous reviewers for their constructive comments. Weiwei Xu is partially supported by Zhejiang Lab. Yin Yang is partially spported by NSF under Grant Nos. CHS 1845024 and 1717972. Weiwei Xu and Hujun Bao are supported by Fundamental Research Funds for the Central Universities. This project has received funding from the European Research Council (ERC) under the European Unions Horizon 2020 research and innovation programme (Grant agreement No 715767).","date_created":"2021-05-23T22:01:42Z","status":"public","scopus_import":"1","has_accepted_license":"1","language":[{"iso":"eng"}],"publication":"IEEE Transactions on Visualization and Computer Graphics","file":[{"date_created":"2021-05-25T15:08:49Z","checksum":"a78e6ac94e33ade4ffaea66943d5f7dc","success":1,"access_level":"open_access","relation":"main_file","file_size":6183002,"date_updated":"2021-05-25T15:08:49Z","file_name":"2021_TVCG_Feng.pdf","content_type":"application/pdf","file_id":"9427","creator":"kschuh"}],"ddc":["000"],"pmid":1,"intvolume":"        27","citation":{"ieee":"X. Feng <i>et al.</i>, “Computational design of skinned Quad-Robots,” <i>IEEE Transactions on Visualization and Computer Graphics</i>, vol. 27, no. 6. IEEE, 2021.","mla":"Feng, Xudong, et al. “Computational Design of Skinned Quad-Robots.” <i>IEEE Transactions on Visualization and Computer Graphics</i>, vol. 27, no. 6, 2881–2895, IEEE, 2021, doi:<a href=\"https://doi.org/10.1109/TVCG.2019.2957218\">10.1109/TVCG.2019.2957218</a>.","ista":"Feng X, Liu J, Wang H, Yang Y, Bao H, Bickel B, Xu W. 2021. Computational design of skinned Quad-Robots. IEEE Transactions on Visualization and Computer Graphics. 27(6), 2881–2895.","ama":"Feng X, Liu J, Wang H, et al. Computational design of skinned Quad-Robots. <i>IEEE Transactions on Visualization and Computer Graphics</i>. 2021;27(6). doi:<a href=\"https://doi.org/10.1109/TVCG.2019.2957218\">10.1109/TVCG.2019.2957218</a>","chicago":"Feng, Xudong, Jiafeng Liu, Huamin Wang, Yin Yang, Hujun Bao, Bernd Bickel, and Weiwei Xu. “Computational Design of Skinned Quad-Robots.” <i>IEEE Transactions on Visualization and Computer Graphics</i>. IEEE, 2021. <a href=\"https://doi.org/10.1109/TVCG.2019.2957218\">https://doi.org/10.1109/TVCG.2019.2957218</a>.","short":"X. Feng, J. Liu, H. Wang, Y. Yang, H. Bao, B. Bickel, W. Xu, IEEE Transactions on Visualization and Computer Graphics 27 (2021).","apa":"Feng, X., Liu, J., Wang, H., Yang, Y., Bao, H., Bickel, B., &#38; Xu, W. (2021). Computational design of skinned Quad-Robots. <i>IEEE Transactions on Visualization and Computer Graphics</i>. IEEE. <a href=\"https://doi.org/10.1109/TVCG.2019.2957218\">https://doi.org/10.1109/TVCG.2019.2957218</a>"},"year":"2021","date_published":"2021-06-01T00:00:00Z","publication_status":"published","doi":"10.1109/TVCG.2019.2957218","article_processing_charge":"No","publication_identifier":{"issn":["1941-0506"],"eissn":["1077-2626"]},"publisher":"IEEE","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)"},"month":"06","department":[{"_id":"BeBi"}],"date_updated":"2025-07-10T12:01:44Z","title":"Computational design of skinned Quad-Robots","isi":1,"article_number":"2881-2895","day":"01","oa_version":"Published Version","volume":27,"ec_funded":1,"project":[{"grant_number":"715767","_id":"24F9549A-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling"}],"external_id":{"pmid":["31804937"],"isi":["000649620700009"]},"quality_controlled":"1","abstract":[{"lang":"eng","text":"We present a computational design system that assists users to model, optimize, and fabricate quad-robots with soft skins. Our system addresses the challenging task of predicting their physical behavior by fully integrating the multibody dynamics of the mechanical skeleton and the elastic behavior of the soft skin. The developed motion control strategy uses an alternating optimization scheme to avoid expensive full space time-optimization, interleaving space-time optimization for the skeleton, and frame-by-frame optimization for the full dynamics. The output are motor torques to drive the robot to achieve a user prescribed motion trajectory. We also provide a collection of convenient engineering tools and empirical manufacturing guidance to support the fabrication of the designed quad-robot. We validate the feasibility of designs generated with our system through physics simulations and with a physically-fabricated prototype."}]},{"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)"},"department":[{"_id":"ScWa"}],"month":"04","date_updated":"2025-07-10T12:01:45Z","title":"Regimes of motion of magnetocapillary swimmers","isi":1,"article_number":"59","citation":{"mla":"Sukhov, Alexander, et al. “Regimes of Motion of Magnetocapillary Swimmers.” <i>European Physical Journal E</i>, vol. 44, no. 4, 59, Springer, 2021, doi:<a href=\"https://doi.org/10.1140/epje/s10189-021-00065-2\">10.1140/epje/s10189-021-00065-2</a>.","ieee":"A. Sukhov <i>et al.</i>, “Regimes of motion of magnetocapillary swimmers,” <i>European Physical Journal E</i>, vol. 44, no. 4. Springer, 2021.","ista":"Sukhov A, Hubert M, Grosjean GM, Trosman O, Ziegler S, Collard Y, Vandewalle N, Smith AS, Harting J. 2021. Regimes of motion of magnetocapillary swimmers. European Physical Journal E. 44(4), 59.","chicago":"Sukhov, Alexander, Maxime Hubert, Galien M Grosjean, Oleg Trosman, Sebastian Ziegler, Ylona Collard, Nicolas Vandewalle, Ana Sunčana Smith, and Jens Harting. “Regimes of Motion of Magnetocapillary Swimmers.” <i>European Physical Journal E</i>. Springer, 2021. <a href=\"https://doi.org/10.1140/epje/s10189-021-00065-2\">https://doi.org/10.1140/epje/s10189-021-00065-2</a>.","ama":"Sukhov A, Hubert M, Grosjean GM, et al. Regimes of motion of magnetocapillary swimmers. <i>European Physical Journal E</i>. 2021;44(4). doi:<a href=\"https://doi.org/10.1140/epje/s10189-021-00065-2\">10.1140/epje/s10189-021-00065-2</a>","apa":"Sukhov, A., Hubert, M., Grosjean, G. M., Trosman, O., Ziegler, S., Collard, Y., … Harting, J. (2021). Regimes of motion of magnetocapillary swimmers. <i>European Physical Journal E</i>. Springer. <a href=\"https://doi.org/10.1140/epje/s10189-021-00065-2\">https://doi.org/10.1140/epje/s10189-021-00065-2</a>","short":"A. Sukhov, M. Hubert, G.M. Grosjean, O. Trosman, S. Ziegler, Y. Collard, N. Vandewalle, A.S. Smith, J. Harting, European Physical Journal E 44 (2021)."},"year":"2021","date_published":"2021-04-24T00:00:00Z","publication_status":"published","doi":"10.1140/epje/s10189-021-00065-2","article_processing_charge":"No","publication_identifier":{"eissn":["1292-895X"],"issn":["1292-8941"]},"publisher":"Springer","abstract":[{"lang":"eng","text":"The dynamics of a triangular magnetocapillary swimmer is studied using the lattice Boltzmann method. We extend on our previous work, which deals with the self-assembly and a specific type of the swimmer motion characterized by the swimmer’s maximum velocity centred around the particle’s inverse viscous time. Here, we identify additional regimes of motion. First, modifying the ratio of surface tension and magnetic forces allows to study the swimmer propagation in the regime of significantly lower frequencies mainly defined by the strength of the magnetocapillary potential. Second, introducing a constant magnetic contribution in each of the particles in addition to their magnetic moment induced by external fields leads to another regime characterized by strong in-plane swimmer reorientations that resemble experimental observations."}],"oa_version":"Published Version","volume":44,"day":"24","external_id":{"isi":["000643251300001"]},"quality_controlled":"1","file_date_updated":"2021-05-25T11:32:14Z","issue":"4","type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"This work was financially supported by the DFG Priority Programme SPP 1726 “Microswimmers–From Single Particle Motion to Collective Behaviour” (HA 4382/5-1). We further acknowledge the Jülich Supercomputing Centre (JSC) and the High Performance Computing Centre Stuttgart (HLRS) for the allocation of computing time.","author":[{"full_name":"Sukhov, Alexander","last_name":"Sukhov","first_name":"Alexander"},{"full_name":"Hubert, Maxime","last_name":"Hubert","first_name":"Maxime"},{"id":"0C5FDA4A-9CF6-11E9-8939-FF05E6697425","full_name":"Grosjean, Galien M","last_name":"Grosjean","first_name":"Galien M","orcid":"0000-0001-5154-417X"},{"first_name":"Oleg","full_name":"Trosman, Oleg","last_name":"Trosman"},{"first_name":"Sebastian","last_name":"Ziegler","full_name":"Ziegler, Sebastian"},{"first_name":"Ylona","full_name":"Collard, Ylona","last_name":"Collard"},{"full_name":"Vandewalle, Nicolas","last_name":"Vandewalle","first_name":"Nicolas"},{"full_name":"Smith, Ana Sunčana","last_name":"Smith","first_name":"Ana Sunčana"},{"first_name":"Jens","full_name":"Harting, Jens","last_name":"Harting"}],"oa":1,"_id":"9411","file":[{"file_name":"2021_EPJE_Sukhov.pdf","date_updated":"2021-05-25T11:32:14Z","content_type":"application/pdf","creator":"kschuh","file_id":"9422","date_created":"2021-05-25T11:32:14Z","checksum":"0ef342d011afbe3c5cb058fda9a3f395","access_level":"open_access","success":1,"file_size":2507870,"relation":"main_file"}],"ddc":["530"],"intvolume":"        44","scopus_import":"1","status":"public","date_created":"2021-05-23T22:01:44Z","has_accepted_license":"1","language":[{"iso":"eng"}],"publication":"European Physical Journal E"},{"main_file_link":[{"open_access":"1","url":"https://www.molbiolcell.org/doi/10.1091/mbc.E20-11-0723"}],"abstract":[{"lang":"eng","text":"Microtubule plus-end depolymerization rate is a potentially important target of physiological regulation, but it has been challenging to measure, so its role in spatial organization is poorly understood. Here we apply a method for tracking plus ends based on time difference imaging to measure depolymerization rates in large interphase asters growing in Xenopus egg extract. We observed strong spatial regulation of depolymerization rates, which were higher in the aster interior compared with the periphery, and much less regulation of polymerization or catastrophe rates. We interpret these data in terms of a limiting component model, where aster growth results in lower levels of soluble tubulin and microtubule-associated proteins (MAPs) in the interior cytosol compared with that at the periphery. The steady-state polymer fraction of tubulin was ∼30%, so tubulin is not strongly depleted in the aster interior. We propose that the limiting component for microtubule assembly is a MAP that inhibits depolymerization, and that egg asters are tuned to low microtubule density."}],"article_type":"original","quality_controlled":"1","external_id":{"pmid":["33439671"],"isi":["000641574700005"]},"project":[{"grant_number":"679239","name":"Self-Organization of the Bacterial Cell","_id":"2595697A-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"_id":"260D98C8-B435-11E9-9278-68D0E5697425","name":"Reconstitution of Bacterial Cell Division Using Purified Components"}],"volume":32,"day":"19","oa_version":"Published Version","ec_funded":1,"title":"Spatial variation of microtubule depolymerization in large asters","isi":1,"license":"https://creativecommons.org/licenses/by-nc-sa/3.0/","tmp":{"image":"/images/cc_by_nc_sa.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/3.0/legalcode","short":"CC BY-NC-SA (3.0)","name":"Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported (CC BY-NC-SA 3.0)"},"date_updated":"2025-04-14T07:21:30Z","department":[{"_id":"MaLo"}],"month":"04","publication_status":"published","article_processing_charge":"No","publication_identifier":{"eissn":["1939-4586"],"issn":["1059-1524"]},"publisher":"American Society for Cell Biology","doi":"10.1091/MBC.E20-11-0723","year":"2021","date_published":"2021-04-19T00:00:00Z","citation":{"ama":"Ishihara K, Decker F, Dos Santos Caldas PR, et al. Spatial variation of microtubule depolymerization in large asters. <i>Molecular Biology of the Cell</i>. 2021;32(9):869-879. doi:<a href=\"https://doi.org/10.1091/MBC.E20-11-0723\">10.1091/MBC.E20-11-0723</a>","chicago":"Ishihara, Keisuke, Franziska Decker, Paulo R Dos Santos Caldas, James F. Pelletier, Martin Loose, Jan Brugués, and Timothy J. Mitchison. “Spatial Variation of Microtubule Depolymerization in Large Asters.” <i>Molecular Biology of the Cell</i>. American Society for Cell Biology, 2021. <a href=\"https://doi.org/10.1091/MBC.E20-11-0723\">https://doi.org/10.1091/MBC.E20-11-0723</a>.","short":"K. Ishihara, F. Decker, P.R. Dos Santos Caldas, J.F. Pelletier, M. Loose, J. Brugués, T.J. Mitchison, Molecular Biology of the Cell 32 (2021) 869–879.","apa":"Ishihara, K., Decker, F., Dos Santos Caldas, P. R., Pelletier, J. F., Loose, M., Brugués, J., &#38; Mitchison, T. J. (2021). Spatial variation of microtubule depolymerization in large asters. <i>Molecular Biology of the Cell</i>. American Society for Cell Biology. <a href=\"https://doi.org/10.1091/MBC.E20-11-0723\">https://doi.org/10.1091/MBC.E20-11-0723</a>","ieee":"K. Ishihara <i>et al.</i>, “Spatial variation of microtubule depolymerization in large asters,” <i>Molecular Biology of the Cell</i>, vol. 32, no. 9. American Society for Cell Biology, pp. 869–879, 2021.","mla":"Ishihara, Keisuke, et al. “Spatial Variation of Microtubule Depolymerization in Large Asters.” <i>Molecular Biology of the Cell</i>, vol. 32, no. 9, American Society for Cell Biology, 2021, pp. 869–79, doi:<a href=\"https://doi.org/10.1091/MBC.E20-11-0723\">10.1091/MBC.E20-11-0723</a>.","ista":"Ishihara K, Decker F, Dos Santos Caldas PR, Pelletier JF, Loose M, Brugués J, Mitchison TJ. 2021. Spatial variation of microtubule depolymerization in large asters. Molecular Biology of the Cell. 32(9), 869–879."},"pmid":1,"intvolume":"        32","page":"869-879","publication":"Molecular Biology of the Cell","language":[{"iso":"eng"}],"date_created":"2021-05-23T22:01:45Z","status":"public","scopus_import":"1","author":[{"first_name":"Keisuke","last_name":"Ishihara","full_name":"Ishihara, Keisuke"},{"first_name":"Franziska","full_name":"Decker, Franziska","last_name":"Decker"},{"first_name":"Paulo R","orcid":"0000-0001-6730-4461","last_name":"Dos Santos Caldas","full_name":"Dos Santos Caldas, Paulo R","id":"38FCDB4C-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Pelletier, James F.","last_name":"Pelletier","first_name":"James F."},{"last_name":"Loose","full_name":"Loose, Martin","id":"462D4284-F248-11E8-B48F-1D18A9856A87","first_name":"Martin","orcid":"0000-0001-7309-9724"},{"first_name":"Jan","full_name":"Brugués, Jan","last_name":"Brugués"},{"last_name":"Mitchison","full_name":"Mitchison, Timothy J.","first_name":"Timothy J."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"The authors thank the members of Mitchison, Brugués, and Jay Gatlin groups (University of Wyoming) for discussions. We thank Heino Andreas (MPI-CBG) for frog maintenance. We thank Nikon for microscopy support at Marine Biological Laboratory (MBL). K.I. was supported by fellowships from the Honjo International Scholarship Foundation and Center of Systems Biology Dresden. F.D. was supported by the DIGGS-BB fellowship provided by the German Research Foundation (DFG). P.C. is supported by a Boehringer Ingelheim Fonds PhD fellowship. J.F.P. was supported by a fellowship from the Fannie and John Hertz Foundation. M.L.’s research is supported by European Research Council (ERC) Grant no. ERC-2015-StG-679239. J.B.’s research is supported by the Human Frontiers Science Program (CDA00074/2014). T.J.M.’s research is supported by National Institutes of Health Grant no. R35GM131753.","type":"journal_article","issue":"9","_id":"9414","oa":1},{"department":[{"_id":"FlSc"}],"month":"05","date_updated":"2025-04-15T08:24:49Z","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)"},"isi":1,"article_number":"3226","title":"Structure of the mature Rous sarcoma virus lattice reveals a role for IP6 in the formation of the capsid hexamer","citation":{"ista":"Obr M, Ricana CL, Nikulin N, Feathers J-PR, Klanschnig M, Thader A, Johnson MC, Vogt VM, Schur FK, Dick RA. 2021. Structure of the mature Rous sarcoma virus lattice reveals a role for IP6 in the formation of the capsid hexamer. Nature Communications. 12(1), 3226.","ieee":"M. Obr <i>et al.</i>, “Structure of the mature Rous sarcoma virus lattice reveals a role for IP6 in the formation of the capsid hexamer,” <i>Nature Communications</i>, vol. 12, no. 1. Nature Research, 2021.","mla":"Obr, Martin, et al. “Structure of the Mature Rous Sarcoma Virus Lattice Reveals a Role for IP6 in the Formation of the Capsid Hexamer.” <i>Nature Communications</i>, vol. 12, no. 1, 3226, Nature Research, 2021, doi:<a href=\"https://doi.org/10.1038/s41467-021-23506-0\">10.1038/s41467-021-23506-0</a>.","short":"M. Obr, C.L. Ricana, N. Nikulin, J.-P.R. Feathers, M. Klanschnig, A. Thader, M.C. Johnson, V.M. Vogt, F.K. Schur, R.A. Dick, Nature Communications 12 (2021).","apa":"Obr, M., Ricana, C. L., Nikulin, N., Feathers, J.-P. R., Klanschnig, M., Thader, A., … Dick, R. A. (2021). Structure of the mature Rous sarcoma virus lattice reveals a role for IP6 in the formation of the capsid hexamer. <i>Nature Communications</i>. Nature Research. <a href=\"https://doi.org/10.1038/s41467-021-23506-0\">https://doi.org/10.1038/s41467-021-23506-0</a>","ama":"Obr M, Ricana CL, Nikulin N, et al. Structure of the mature Rous sarcoma virus lattice reveals a role for IP6 in the formation of the capsid hexamer. <i>Nature Communications</i>. 2021;12(1). doi:<a href=\"https://doi.org/10.1038/s41467-021-23506-0\">10.1038/s41467-021-23506-0</a>","chicago":"Obr, Martin, Clifton L. Ricana, Nadia Nikulin, Jon-Philip R. Feathers, Marco Klanschnig, Andreas Thader, Marc C. Johnson, Volker M. Vogt, Florian KM Schur, and Robert A. Dick. “Structure of the Mature Rous Sarcoma Virus Lattice Reveals a Role for IP6 in the Formation of the Capsid Hexamer.” <i>Nature Communications</i>. Nature Research, 2021. <a href=\"https://doi.org/10.1038/s41467-021-23506-0\">https://doi.org/10.1038/s41467-021-23506-0</a>."},"year":"2021","date_published":"2021-05-28T00:00:00Z","doi":"10.1038/s41467-021-23506-0","publication_identifier":{"eissn":["2041-1723"]},"article_processing_charge":"No","publisher":"Nature Research","publication_status":"published","article_type":"original","abstract":[{"text":"Inositol hexakisphosphate (IP6) is an assembly cofactor for HIV-1. We report here that IP6 is also used for assembly of Rous sarcoma virus (RSV), a retrovirus from a different genus. IP6 is ~100-fold more potent at promoting RSV mature capsid protein (CA) assembly than observed for HIV-1 and removal of IP6 in cells reduces infectivity by 100-fold. Here, visualized by cryo-electron tomography and subtomogram averaging, mature capsid-like particles show an IP6-like density in the CA hexamer, coordinated by rings of six lysines and six arginines. Phosphate and IP6 have opposing effects on CA in vitro assembly, inducing formation of T = 1 icosahedrons and tubes, respectively, implying that phosphate promotes pentamer and IP6 hexamer formation. Subtomogram averaging and classification optimized for analysis of pleomorphic retrovirus particles reveal that the heterogeneity of mature RSV CA polyhedrons results from an unexpected, intrinsic CA hexamer flexibility. In contrast, the CA pentamer forms rigid units organizing the local architecture. These different features of hexamers and pentamers determine the structural mechanism to form CA polyhedrons of variable shape in mature RSV particles.","lang":"eng"}],"oa_version":"Published Version","day":"28","volume":12,"project":[{"name":"Structural conservation and diversity in retroviral capsid","_id":"26736D6A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P31445"}],"quality_controlled":"1","external_id":{"isi":["000659145000011"]},"issue":"1","corr_author":"1","file_date_updated":"2021-06-09T15:21:14Z","type":"journal_article","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","author":[{"orcid":"0000-0003-1756-6564","first_name":"Martin","last_name":"Obr","id":"4741CA5A-F248-11E8-B48F-1D18A9856A87","full_name":"Obr, Martin"},{"last_name":"Ricana","full_name":"Ricana, Clifton L.","first_name":"Clifton L."},{"full_name":"Nikulin, Nadia","last_name":"Nikulin","first_name":"Nadia"},{"full_name":"Feathers, Jon-Philip R.","last_name":"Feathers","first_name":"Jon-Philip R."},{"full_name":"Klanschnig, Marco","last_name":"Klanschnig","first_name":"Marco"},{"first_name":"Andreas","last_name":"Thader","full_name":"Thader, Andreas","id":"3A18A7B8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Johnson","full_name":"Johnson, Marc C.","first_name":"Marc C."},{"first_name":"Volker M.","last_name":"Vogt","full_name":"Vogt, Volker M."},{"id":"48AD8942-F248-11E8-B48F-1D18A9856A87","full_name":"Schur, Florian KM","last_name":"Schur","orcid":"0000-0003-4790-8078","first_name":"Florian KM"},{"first_name":"Robert A.","full_name":"Dick, Robert A.","last_name":"Dick"}],"acknowledgement":"This work was funded by the National Institute of Allergy and Infectious Diseases under awards R01AI147890 to R.A.D., R01AI150454 to V.M.V, R35GM136258 in support of J-P.R.F, and the Austrian Science Fund (FWF) grant P31445 to F.K.M.S. Access to high-resolution cryo-ET data acquisition at EMBL Heidelberg was supported by iNEXT (grant no. 653706), funded by the Horizon 2020 program of the European Union (PID 4246). We thank Wim Hagen and Felix Weis at EMBL Heidelberg for support in cryo-ET data acquisition. This work made use of the Cornell Center for Materials Research Shared Facilities, which are supported through the NSF MRSEC program (DMR-179875). 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).","oa":1,"related_material":{"link":[{"description":"News on IST Homepage","url":"https://ist.ac.at/en/news/how-retroviruses-become-infectious/","relation":"press_release"}]},"_id":"9431","ddc":["570"],"file":[{"content_type":"application/pdf","file_name":"2021_NatureCommunications_Obr.pdf","date_updated":"2021-06-09T15:21:14Z","creator":"kschuh","file_id":"9538","checksum":"53ccc53d09a9111143839dbe7784e663","date_created":"2021-06-09T15:21:14Z","relation":"main_file","file_size":6166295,"access_level":"open_access","success":1}],"intvolume":"        12","date_created":"2021-05-28T14:25:50Z","keyword":["General Biochemistry","Genetics and Molecular Biology","General Physics and Astronomy","General Chemistry"],"status":"public","scopus_import":"1","language":[{"iso":"eng"}],"publication":"Nature Communications","acknowledged_ssus":[{"_id":"ScienComp"},{"_id":"LifeSc"},{"_id":"EM-Fac"}],"has_accepted_license":"1"},{"file":[{"content_type":"application/pdf","file_name":"CoExistence 2&3 caustics 3_17_6_2_3.pdf","date_updated":"2021-05-30T13:57:37Z","creator":"ekoudjin","file_id":"9436","checksum":"b281b5c2e3e90de0646c3eafcb2c6c25","date_created":"2021-05-30T13:57:37Z","relation":"main_file","file_size":353431,"access_level":"open_access"}],"ddc":["500"],"has_accepted_license":"1","language":[{"iso":"eng"}],"publication":"arXiv","date_created":"2021-05-30T13:58:13Z","status":"public","type":"preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"orcid":"0000-0002-6051-2628","first_name":"Vadim","last_name":"Kaloshin","full_name":"Kaloshin, Vadim","id":"FE553552-CDE8-11E9-B324-C0EBE5697425"},{"full_name":"Koudjinan, Edmond","id":"52DF3E68-AEFA-11EA-95A4-124A3DDC885E","last_name":"Koudjinan","orcid":"0000-0003-2640-4049","first_name":"Edmond"}],"file_date_updated":"2021-05-30T13:57:37Z","corr_author":"1","OA_place":"repository","_id":"9435","arxiv":1,"oa":1,"abstract":[{"lang":"eng","text":"For any given positive integer l, we prove that every plane deformation of a circlewhich preserves the 1/2and 1/ (2l + 1) -rational caustics is trivial i.e. the deformationconsists only of similarities (rescalings and isometries)."}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2107.03499"}],"external_id":{"arxiv":["2107.03499"]},"day":"07","oa_version":"Submitted Version","title":"Non co-preservation of the 1/2 and  1/(2l+1)-rational caustics along deformations of circles","article_number":"2107.03499","department":[{"_id":"VaKa"}],"month":"07","date_updated":"2025-01-22T08:09:40Z","publication_status":"submitted","doi":"10.48550/arXiv.2107.03499","article_processing_charge":"No","citation":{"ieee":"V. Kaloshin and E. Koudjinan, “Non co-preservation of the 1/2 and  1/(2l+1)-rational caustics along deformations of circles,” <i>arXiv</i>. .","mla":"Kaloshin, Vadim, and Edmond Koudjinan. “Non Co-Preservation of the 1/2 and  1/(2l+1)-Rational Caustics along Deformations of Circles.” <i>ArXiv</i>, 2107.03499, doi:<a href=\"https://doi.org/10.48550/arXiv.2107.03499\">10.48550/arXiv.2107.03499</a>.","ista":"Kaloshin V, Koudjinan E. Non co-preservation of the 1/2 and  1/(2l+1)-rational caustics along deformations of circles. arXiv, 2107.03499.","ama":"Kaloshin V, Koudjinan E. Non co-preservation of the 1/2 and  1/(2l+1)-rational caustics along deformations of circles. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2107.03499\">10.48550/arXiv.2107.03499</a>","chicago":"Kaloshin, Vadim, and Edmond Koudjinan. “Non Co-Preservation of the 1/2 and  1/(2l+1)-Rational Caustics along Deformations of Circles.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2107.03499\">https://doi.org/10.48550/arXiv.2107.03499</a>.","short":"V. Kaloshin, E. Koudjinan, ArXiv (n.d.).","apa":"Kaloshin, V., &#38; Koudjinan, E. (n.d.). Non co-preservation of the 1/2 and  1/(2l+1)-rational caustics along deformations of circles. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2107.03499\">https://doi.org/10.48550/arXiv.2107.03499</a>"},"date_published":"2021-07-07T00:00:00Z","year":"2021"},{"page":"998-1009","pmid":1,"intvolume":"        24","date_created":"2021-05-30T22:01:24Z","status":"public","scopus_import":"1","language":[{"iso":"eng"}],"publication":"Nature Neuroscience","type":"journal_article","acknowledgement":"We thank D. Kastner and T. Münch for generously providing figures from their work. We also thank V. Jayaraman, M. Noorman, T. Ma, and K. Krishnamurthy for useful discussions and feedback on the manuscript. W.F.M. was funded by the European Union’s Horizon 2020 Research and Innovation Programme under Marie Skłodowska-Curie Grant Agreement No. 754411. A.M.H. was supported by the Howard Hughes Medical Institute.","author":[{"first_name":"Wiktor F","last_name":"Mlynarski","id":"358A453A-F248-11E8-B48F-1D18A9856A87","full_name":"Mlynarski, Wiktor F"},{"first_name":"Ann M.","last_name":"Hermundstad","full_name":"Hermundstad, Ann M."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"_id":"9439","article_type":"original","abstract":[{"lang":"eng","text":"The ability to adapt to changes in stimulus statistics is a hallmark of sensory systems. Here, we developed a theoretical framework that can account for the dynamics of adaptation from an information processing perspective. We use this framework to optimize and analyze adaptive sensory codes, and we show that codes optimized for stationary environments can suffer from prolonged periods of poor performance when the environment changes. To mitigate the adversarial effects of these environmental changes, sensory systems must navigate tradeoffs between the ability to accurately encode incoming stimuli and the ability to rapidly detect and adapt to changes in the distribution of these stimuli. We derive families of codes that balance these objectives, and we demonstrate their close match to experimentally observed neural dynamics during mean and variance adaptation. Our results provide a unifying perspective on adaptation across a range of sensory systems, environments, and sensory tasks."}],"main_file_link":[{"url":"https://doi.org/10.1101/669200 ","open_access":"1"}],"ec_funded":1,"oa_version":"Preprint","day":"20","volume":24,"project":[{"name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"754411"}],"external_id":{"isi":["000652577300003"],"pmid":["34017131"]},"quality_controlled":"1","department":[{"_id":"GaTk"}],"month":"05","date_updated":"2025-06-12T06:41:38Z","isi":1,"title":"Efficient and adaptive sensory codes","citation":{"ista":"Mlynarski WF, Hermundstad AM. 2021. Efficient and adaptive sensory codes. Nature Neuroscience. 24, 998–1009.","mla":"Mlynarski, Wiktor F., and Ann M. Hermundstad. “Efficient and Adaptive Sensory Codes.” <i>Nature Neuroscience</i>, vol. 24, Springer Nature, 2021, pp. 998–1009, doi:<a href=\"https://doi.org/10.1038/s41593-021-00846-0\">10.1038/s41593-021-00846-0</a>.","ieee":"W. F. Mlynarski and A. M. Hermundstad, “Efficient and adaptive sensory codes,” <i>Nature Neuroscience</i>, vol. 24. Springer Nature, pp. 998–1009, 2021.","apa":"Mlynarski, W. F., &#38; Hermundstad, A. M. (2021). Efficient and adaptive sensory codes. <i>Nature Neuroscience</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41593-021-00846-0\">https://doi.org/10.1038/s41593-021-00846-0</a>","short":"W.F. Mlynarski, A.M. Hermundstad, Nature Neuroscience 24 (2021) 998–1009.","chicago":"Mlynarski, Wiktor F, and Ann M. Hermundstad. “Efficient and Adaptive Sensory Codes.” <i>Nature Neuroscience</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1038/s41593-021-00846-0\">https://doi.org/10.1038/s41593-021-00846-0</a>.","ama":"Mlynarski WF, Hermundstad AM. Efficient and adaptive sensory codes. <i>Nature Neuroscience</i>. 2021;24:998-1009. doi:<a href=\"https://doi.org/10.1038/s41593-021-00846-0\">10.1038/s41593-021-00846-0</a>"},"date_published":"2021-05-20T00:00:00Z","year":"2021","doi":"10.1038/s41593-021-00846-0","publisher":"Springer Nature","publication_identifier":{"issn":["1097-6256"],"eissn":["1546-1726"]},"article_processing_charge":"No","publication_status":"published"},{"file_date_updated":"2021-06-02T10:22:33Z","acknowledgement":"We thank Dominique Attali, Guilherme de Fonseca, Arijit Ghosh, Vincent Pilaud and Aurélien Alvarez for their comments and suggestions. We also acknowledge the reviewers.","user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425","author":[{"first_name":"Jean-Daniel","last_name":"Boissonnat","full_name":"Boissonnat, Jean-Daniel"},{"first_name":"Siargey","full_name":"Kachanovich, Siargey","last_name":"Kachanovich"},{"last_name":"Wintraecken","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","full_name":"Wintraecken, Mathijs","first_name":"Mathijs","orcid":"0000-0002-7472-2220"}],"type":"conference","related_material":{"record":[{"relation":"later_version","id":"12960","status":"public"}]},"oa":1,"place":"Dagstuhl, Germany","_id":"9441","ddc":["005","516","514"],"file":[{"file_id":"9442","creator":"mwintrae","file_name":"LIPIcs-SoCG-2021-17.pdf","date_updated":"2021-06-02T10:22:33Z","content_type":"application/pdf","access_level":"open_access","success":1,"file_size":1972902,"relation":"main_file","date_created":"2021-06-02T10:22:33Z","checksum":"c322aa48d5d35a35877896cc565705b6"}],"series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","page":"17:1-17:16","intvolume":"       189","date_created":"2021-06-02T10:10:55Z","status":"public","scopus_import":"1","publication":"37th International Symposium on Computational Geometry (SoCG 2021)","language":[{"iso":"eng"}],"has_accepted_license":"1","date_updated":"2025-04-15T07:09:18Z","month":"06","department":[{"_id":"HeEd"}],"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)"},"title":"Tracing isomanifolds in Rd in time polynomial in d using Coxeter-Freudenthal-Kuhn triangulations","year":"2021","date_published":"2021-06-02T00:00:00Z","citation":{"ista":"Boissonnat J-D, Kachanovich S, Wintraecken M. 2021. Tracing isomanifolds in Rd in time polynomial in d using Coxeter-Freudenthal-Kuhn triangulations. 37th International Symposium on Computational Geometry (SoCG 2021). SoCG: Symposium on Computational GeometryLeibniz International Proceedings in Informatics (LIPIcs), LIPIcs, vol. 189, 17:1-17:16.","ieee":"J.-D. Boissonnat, S. Kachanovich, and M. Wintraecken, “Tracing isomanifolds in Rd in time polynomial in d using Coxeter-Freudenthal-Kuhn triangulations,” in <i>37th International Symposium on Computational Geometry (SoCG 2021)</i>, Virtual, 2021, vol. 189, p. 17:1-17:16.","mla":"Boissonnat, Jean-Daniel, et al. “Tracing Isomanifolds in Rd in Time Polynomial in d Using Coxeter-Freudenthal-Kuhn Triangulations.” <i>37th International Symposium on Computational Geometry (SoCG 2021)</i>, vol. 189, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, p. 17:1-17:16, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2021.17\">10.4230/LIPIcs.SoCG.2021.17</a>.","short":"J.-D. Boissonnat, S. Kachanovich, M. Wintraecken, in:, 37th International Symposium on Computational Geometry (SoCG 2021), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2021, p. 17:1-17:16.","apa":"Boissonnat, J.-D., Kachanovich, S., &#38; Wintraecken, M. (2021). Tracing isomanifolds in Rd in time polynomial in d using Coxeter-Freudenthal-Kuhn triangulations. In <i>37th International Symposium on Computational Geometry (SoCG 2021)</i> (Vol. 189, p. 17:1-17:16). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2021.17\">https://doi.org/10.4230/LIPIcs.SoCG.2021.17</a>","ama":"Boissonnat J-D, Kachanovich S, Wintraecken M. Tracing isomanifolds in Rd in time polynomial in d using Coxeter-Freudenthal-Kuhn triangulations. In: <i>37th International Symposium on Computational Geometry (SoCG 2021)</i>. Vol 189. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021:17:1-17:16. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2021.17\">10.4230/LIPIcs.SoCG.2021.17</a>","chicago":"Boissonnat, Jean-Daniel, Siargey Kachanovich, and Mathijs Wintraecken. “Tracing Isomanifolds in Rd in Time Polynomial in d Using Coxeter-Freudenthal-Kuhn Triangulations.” In <i>37th International Symposium on Computational Geometry (SoCG 2021)</i>, 189:17:1-17:16. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2021.17\">https://doi.org/10.4230/LIPIcs.SoCG.2021.17</a>."},"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","publication_identifier":{"isbn":["978-3-95977-184-9"],"issn":["1868-8969"]},"article_processing_charge":"No","doi":"10.4230/LIPIcs.SoCG.2021.17","publication_status":"published","abstract":[{"text":"Isomanifolds are the generalization of isosurfaces to arbitrary dimension and codimension, i.e. submanifolds of ℝ^d defined as the zero set of some multivariate multivalued smooth function f: ℝ^d → ℝ^{d-n}, where n is the intrinsic dimension of the manifold. A natural way to approximate a smooth isomanifold M is to consider its Piecewise-Linear (PL) approximation M̂ based on a triangulation 𝒯 of the ambient space ℝ^d. In this paper, we describe a simple algorithm to trace isomanifolds from a given starting point. The algorithm works for arbitrary dimensions n and d, and any precision D. Our main result is that, when f (or M) has bounded complexity, the complexity of the algorithm is polynomial in d and δ = 1/D (and unavoidably exponential in n). Since it is known that for δ = Ω (d^{2.5}), M̂ is O(D²)-close and isotopic to M, our algorithm produces a faithful PL-approximation of isomanifolds of bounded complexity in time polynomial in d. Combining this algorithm with dimensionality reduction techniques, the dependency on d in the size of M̂ can be completely removed with high probability. We also show that the algorithm can handle isomanifolds with boundary and, more generally, isostratifolds. The algorithm for isomanifolds with boundary has been implemented and experimental results are reported, showing that it is practical and can handle cases that are far ahead of the state-of-the-art. ","lang":"eng"}],"conference":{"location":"Virtual","start_date":"2021-06-07","name":"SoCG: Symposium on Computational Geometry","end_date":"2021-06-11"},"ec_funded":1,"day":"02","oa_version":"Published Version","volume":189,"alternative_title":["LIPIcs"],"quality_controlled":"1","project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411"}]},{"_id":"9443","oa":1,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","acknowledgement":"We would also like to thank Lothar Willmitzer for the lipidomic analysis at the Max Planck Institute of Molecular Plant Physiology (Potsdam, Germany). We thank Manuela Vega from SCI for her technical assistance in image analysis. We thank John R. Pearson and the Bionand Nanoimaging Unit, F. David Navas Fernández and the SCAI Imaging Facility and The Plant Cell Biology facility at the Shanghai Center for Plant Stress Biology for assistance with confocal microscopy. The FaFAH1 clone was a gift from Iraida Amaya Saavedra (IFAPA-Centro de Churriana, Málaga, Spain). The AHA3 antibody against the H+-ATPase was a gift from Ramón Serrano Salom (Instituto de Biología Molecular y Celular de Plantas, Valencia, Spain). The MAP-mTU2-SAC1 construct was provided by Yvon Jaillais (Laboratoire Reproduction et Développement des Plantes, Univ Lyon, France). The pGWB5 from the pGWB vector series, was provided by Tsuyoshi Nakagawa (Department of Molecular and Functional Genomics, Shimane University). We thank Plan Propio from the University of Málaga for financial support.\r\nFunding","author":[{"first_name":"N","full_name":"Ruiz-Lopez, N","last_name":"Ruiz-Lopez"},{"last_name":"Pérez-Sancho","full_name":"Pérez-Sancho, J","first_name":"J"},{"first_name":"A","last_name":"Esteban Del Valle","full_name":"Esteban Del Valle, A"},{"first_name":"RP","last_name":"Haslam","full_name":"Haslam, RP"},{"first_name":"S","last_name":"Vanneste","full_name":"Vanneste, S"},{"last_name":"Catalá","full_name":"Catalá, R","first_name":"R"},{"full_name":"Perea-Resa, C","last_name":"Perea-Resa","first_name":"C"},{"full_name":"Van Damme, D","last_name":"Van Damme","first_name":"D"},{"last_name":"García-Hernández","full_name":"García-Hernández, S","first_name":"S"},{"first_name":"A","full_name":"Albert, A","last_name":"Albert"},{"first_name":"J","full_name":"Vallarino, J","last_name":"Vallarino"},{"first_name":"J","last_name":"Lin","full_name":"Lin, J"},{"id":"4159519E-F248-11E8-B48F-1D18A9856A87","full_name":"Friml, Jiří","last_name":"Friml","first_name":"Jiří","orcid":"0000-0002-8302-7596"},{"last_name":"Macho","full_name":"Macho, AP","first_name":"AP"},{"first_name":"J","last_name":"Salinas","full_name":"Salinas, J"},{"full_name":"Rosado, A","last_name":"Rosado","first_name":"A"},{"full_name":"Napier, JA","last_name":"Napier","first_name":"JA"},{"last_name":"Amorim-Silva","full_name":"Amorim-Silva, V","first_name":"V"},{"first_name":"MA","full_name":"Botella, MA","last_name":"Botella"}],"type":"journal_article","file_date_updated":"2021-10-14T13:36:38Z","issue":"7","has_accepted_license":"1","publication":"Plant Cell","language":[{"iso":"eng"}],"scopus_import":"1","status":"public","date_created":"2021-06-02T13:13:58Z","page":"2431-2453","pmid":1,"intvolume":"        33","file":[{"creator":"cchlebak","file_id":"10141","file_name":"2021_PlantCell_RuizLopez.pdf","date_updated":"2021-10-14T13:36:38Z","content_type":"application/pdf","success":1,"access_level":"open_access","file_size":2952028,"relation":"main_file","date_created":"2021-10-14T13:36:38Z","checksum":"22d596678d00310d793611864a6d0fcd"}],"ddc":["580"],"publication_status":"published","publisher":"American Society of Plant Biologists","publication_identifier":{"eissn":["1532-298x"],"issn":["1040-4651"]},"article_processing_charge":"No","doi":"10.1093/plcell/koab122","year":"2021","date_published":"2021-07-01T00:00:00Z","citation":{"ieee":"N. Ruiz-Lopez <i>et al.</i>, “Synaptotagmins at the endoplasmic reticulum-plasma membrane contact sites maintain diacylglycerol homeostasis during abiotic stress,” <i>Plant Cell</i>, vol. 33, no. 7. American Society of Plant Biologists, pp. 2431–2453, 2021.","mla":"Ruiz-Lopez, N., et al. “Synaptotagmins at the Endoplasmic Reticulum-Plasma Membrane Contact Sites Maintain Diacylglycerol Homeostasis during Abiotic Stress.” <i>Plant Cell</i>, vol. 33, no. 7, American Society of Plant Biologists, 2021, pp. 2431–53, doi:<a href=\"https://doi.org/10.1093/plcell/koab122\">10.1093/plcell/koab122</a>.","ista":"Ruiz-Lopez N, Pérez-Sancho J, Esteban Del Valle A, Haslam R, Vanneste S, Catalá R, Perea-Resa C, Van Damme D, García-Hernández S, Albert A, Vallarino J, Lin J, Friml J, Macho A, Salinas J, Rosado A, Napier J, Amorim-Silva V, Botella M. 2021. Synaptotagmins at the endoplasmic reticulum-plasma membrane contact sites maintain diacylglycerol homeostasis during abiotic stress. Plant Cell. 33(7), 2431–2453.","ama":"Ruiz-Lopez N, Pérez-Sancho J, Esteban Del Valle A, et al. Synaptotagmins at the endoplasmic reticulum-plasma membrane contact sites maintain diacylglycerol homeostasis during abiotic stress. <i>Plant Cell</i>. 2021;33(7):2431-2453. doi:<a href=\"https://doi.org/10.1093/plcell/koab122\">10.1093/plcell/koab122</a>","chicago":"Ruiz-Lopez, N, J Pérez-Sancho, A Esteban Del Valle, RP Haslam, S Vanneste, R Catalá, C Perea-Resa, et al. “Synaptotagmins at the Endoplasmic Reticulum-Plasma Membrane Contact Sites Maintain Diacylglycerol Homeostasis during Abiotic Stress.” <i>Plant Cell</i>. American Society of Plant Biologists, 2021. <a href=\"https://doi.org/10.1093/plcell/koab122\">https://doi.org/10.1093/plcell/koab122</a>.","short":"N. Ruiz-Lopez, J. Pérez-Sancho, A. Esteban Del Valle, R. Haslam, S. Vanneste, R. Catalá, C. Perea-Resa, D. Van Damme, S. García-Hernández, A. Albert, J. Vallarino, J. Lin, J. Friml, A. Macho, J. Salinas, A. Rosado, J. Napier, V. Amorim-Silva, M. Botella, Plant Cell 33 (2021) 2431–2453.","apa":"Ruiz-Lopez, N., Pérez-Sancho, J., Esteban Del Valle, A., Haslam, R., Vanneste, S., Catalá, R., … Botella, M. (2021). Synaptotagmins at the endoplasmic reticulum-plasma membrane contact sites maintain diacylglycerol homeostasis during abiotic stress. <i>Plant Cell</i>. American Society of Plant Biologists. <a href=\"https://doi.org/10.1093/plcell/koab122\">https://doi.org/10.1093/plcell/koab122</a>"},"title":"Synaptotagmins at the endoplasmic reticulum-plasma membrane contact sites maintain diacylglycerol homeostasis during abiotic stress","isi":1,"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)"},"date_updated":"2025-04-14T07:45:00Z","month":"07","department":[{"_id":"JiFr"}],"external_id":{"isi":["000703938100026"],"pmid":["33944955"]},"quality_controlled":"1","project":[{"grant_number":"742985","name":"Tracing Evolution of Auxin Transport and Polarity in Plants","_id":"261099A6-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"volume":33,"oa_version":"Published Version","day":"01","ec_funded":1,"abstract":[{"text":"Endoplasmic reticulum–plasma membrane contact sites (ER–PM CS) play fundamental roles in all eukaryotic cells. Arabidopsis thaliana mutants lacking the ER–PM protein tether synaptotagmin1 (SYT1) exhibit decreased PM integrity under multiple abiotic stresses, such as freezing, high salt, osmotic stress, and mechanical damage. Here, we show that, together with SYT1, the stress-induced SYT3 is an ER–PM tether that also functions in maintaining PM integrity. The ER–PM CS localization of SYT1 and SYT3 is dependent on PM phosphatidylinositol-4-phosphate and is regulated by abiotic stress. Lipidomic analysis revealed that cold stress increased the accumulation of diacylglycerol at the PM in a syt1/3 double mutant relative to wild-type while the levels of most glycerolipid species remain unchanged. In addition, the SYT1-green fluorescent protein fusion preferentially binds diacylglycerol in vivo with little affinity for polar glycerolipids. Our work uncovers a SYT-dependent mechanism of stress adaptation counteracting the detrimental accumulation of diacylglycerol at the PM produced during episodes of abiotic stress.","lang":"eng"}],"article_type":"original"},{"date_updated":"2024-10-21T06:02:10Z","month":"05","department":[{"_id":"StFr"}],"title":"Investigation of electrochemical and chemical processes occurring at positive potentials in “Water-in-Salt” electrolytes","article_number":"050550","isi":1,"date_published":"2021-05-01T00:00:00Z","year":"2021","citation":{"apa":"Maffre, M., Bouchal, R., Freunberger, S. A., Lindahl, N., Johansson, P., Favier, F., … Bélanger, D. (2021). Investigation of electrochemical and chemical processes occurring at positive potentials in “Water-in-Salt” electrolytes. <i>Journal of The Electrochemical Society</i>. IOP Publishing. <a href=\"https://doi.org/10.1149/1945-7111/ac0300\">https://doi.org/10.1149/1945-7111/ac0300</a>","short":"M. Maffre, R. Bouchal, S.A. Freunberger, N. Lindahl, P. Johansson, F. Favier, O. Fontaine, D. Bélanger, Journal of The Electrochemical Society 168 (2021).","chicago":"Maffre, Marion, Roza Bouchal, Stefan Alexander Freunberger, Niklas Lindahl, Patrik Johansson, Frédéric Favier, Olivier Fontaine, and Daniel Bélanger. “Investigation of Electrochemical and Chemical Processes Occurring at Positive Potentials in ‘Water-in-Salt’ Electrolytes.” <i>Journal of The Electrochemical Society</i>. IOP Publishing, 2021. <a href=\"https://doi.org/10.1149/1945-7111/ac0300\">https://doi.org/10.1149/1945-7111/ac0300</a>.","ama":"Maffre M, Bouchal R, Freunberger SA, et al. Investigation of electrochemical and chemical processes occurring at positive potentials in “Water-in-Salt” electrolytes. <i>Journal of The Electrochemical Society</i>. 2021;168(5). doi:<a href=\"https://doi.org/10.1149/1945-7111/ac0300\">10.1149/1945-7111/ac0300</a>","ista":"Maffre M, Bouchal R, Freunberger SA, Lindahl N, Johansson P, Favier F, Fontaine O, Bélanger D. 2021. Investigation of electrochemical and chemical processes occurring at positive potentials in “Water-in-Salt” electrolytes. Journal of The Electrochemical Society. 168(5), 050550.","mla":"Maffre, Marion, et al. “Investigation of Electrochemical and Chemical Processes Occurring at Positive Potentials in ‘Water-in-Salt’ Electrolytes.” <i>Journal of The Electrochemical Society</i>, vol. 168, no. 5, 050550, IOP Publishing, 2021, doi:<a href=\"https://doi.org/10.1149/1945-7111/ac0300\">10.1149/1945-7111/ac0300</a>.","ieee":"M. Maffre <i>et al.</i>, “Investigation of electrochemical and chemical processes occurring at positive potentials in ‘Water-in-Salt’ electrolytes,” <i>Journal of The Electrochemical Society</i>, vol. 168, no. 5. IOP Publishing, 2021."},"publication_status":"published","article_processing_charge":"No","publisher":"IOP Publishing","publication_identifier":{"eissn":["1945-7111"],"issn":["0013-4651"]},"doi":"10.1149/1945-7111/ac0300","abstract":[{"lang":"eng","text":"Lithium bis(trifluoromethylsulfonyl)imide (LiTFSI) based water-in-salt electrolytes (WiSEs) has recently emerged as a new promising class of electrolytes, primarily owing to their wide electrochemical stability windows (~3–4 V), that by far exceed the thermodynamic stability window of water (1.23 V). Upon increasing the salt concentration towards superconcentration the onset of the oxygen evolution reaction (OER) shifts more significantly than the hydrogen evolution reaction (HER) does. The OER shift has been explained by the accumulation of hydrophobic anions blocking water access to the electrode surface, hence by double layer theory. Here we demonstrate that the processes during oxidation are much more complex, involving OER, carbon and salt decomposition by OER intermediates, and salt precipitation upon local oversaturation. The positive shift in the onset potential of oxidation currents was elucidated by combining several advanced analysis techniques: rotating ring-disk electrode voltammetry, online electrochemical mass spectrometry, and X-ray photoelectron spectroscopy, using both dilute and superconcentrated electrolytes. The results demonstrate the importance of reactive OER intermediates and surface films for electrolyte and electrode stability and motivate further studies of the nature of the electrode."}],"day":"01","oa_version":"None","volume":168,"quality_controlled":"1","external_id":{"isi":["000657724200001"]},"issue":"5","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"first_name":"Marion","last_name":"Maffre","full_name":"Maffre, Marion"},{"first_name":"Roza","last_name":"Bouchal","full_name":"Bouchal, Roza"},{"orcid":"0000-0003-2902-5319","first_name":"Stefan Alexander","full_name":"Freunberger, Stefan Alexander","id":"A8CA28E6-CE23-11E9-AD2D-EC27E6697425","last_name":"Freunberger"},{"first_name":"Niklas","full_name":"Lindahl, Niklas","last_name":"Lindahl"},{"last_name":"Johansson","full_name":"Johansson, Patrik","first_name":"Patrik"},{"first_name":"Frédéric","full_name":"Favier, Frédéric","last_name":"Favier"},{"first_name":"Olivier","last_name":"Fontaine","full_name":"Fontaine, Olivier"},{"first_name":"Daniel","last_name":"Bélanger","full_name":"Bélanger, Daniel"}],"type":"journal_article","_id":"9447","intvolume":"       168","scopus_import":"1","date_created":"2021-06-03T09:58:38Z","status":"public","keyword":["Renewable Energy","Sustainability and the Environment","Electrochemistry","Materials Chemistry","Electronic","Optical and Magnetic Materials","Surfaces","Coatings and Films","Condensed Matter Physics"],"publication":"Journal of The Electrochemical Society","language":[{"iso":"eng"}]},{"oa":1,"_id":"9462","arxiv":1,"issue":"6","type":"journal_article","author":[{"full_name":"Deuchert, Andreas","last_name":"Deuchert","first_name":"Andreas"},{"orcid":"0000-0002-6781-0521","first_name":"Robert","last_name":"Seiringer","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","full_name":"Seiringer, Robert"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","acknowledgement":"Funding from the European Union's Horizon 2020 research and innovation programme under the ERC grant agreement No 694227 (R.S.) and under the Marie Sklodowska-Curie grant agreement No 836146 (A.D.) is gratefully acknowledged. A.D. acknowledges support of the Swiss National Science Foundation through the Ambizione grant PZ00P2 185851.","date_created":"2021-06-06T22:01:28Z","status":"public","scopus_import":"1","language":[{"iso":"eng"}],"publication":"Journal of Functional Analysis","intvolume":"       281","citation":{"mla":"Deuchert, Andreas, and Robert Seiringer. “Semiclassical Approximation and Critical Temperature Shift for Weakly Interacting Trapped Bosons.” <i>Journal of Functional Analysis</i>, vol. 281, no. 6, 109096, Elsevier, 2021, doi:<a href=\"https://doi.org/10.1016/j.jfa.2021.109096\">10.1016/j.jfa.2021.109096</a>.","ieee":"A. Deuchert and R. Seiringer, “Semiclassical approximation and critical temperature shift for weakly interacting trapped bosons,” <i>Journal of Functional Analysis</i>, vol. 281, no. 6. Elsevier, 2021.","ista":"Deuchert A, Seiringer R. 2021. Semiclassical approximation and critical temperature shift for weakly interacting trapped bosons. Journal of Functional Analysis. 281(6), 109096.","chicago":"Deuchert, Andreas, and Robert Seiringer. “Semiclassical Approximation and Critical Temperature Shift for Weakly Interacting Trapped Bosons.” <i>Journal of Functional Analysis</i>. Elsevier, 2021. <a href=\"https://doi.org/10.1016/j.jfa.2021.109096\">https://doi.org/10.1016/j.jfa.2021.109096</a>.","ama":"Deuchert A, Seiringer R. Semiclassical approximation and critical temperature shift for weakly interacting trapped bosons. <i>Journal of Functional Analysis</i>. 2021;281(6). doi:<a href=\"https://doi.org/10.1016/j.jfa.2021.109096\">10.1016/j.jfa.2021.109096</a>","apa":"Deuchert, A., &#38; Seiringer, R. (2021). Semiclassical approximation and critical temperature shift for weakly interacting trapped bosons. <i>Journal of Functional Analysis</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jfa.2021.109096\">https://doi.org/10.1016/j.jfa.2021.109096</a>","short":"A. Deuchert, R. Seiringer, Journal of Functional Analysis 281 (2021)."},"date_published":"2021-09-15T00:00:00Z","year":"2021","publication_status":"published","doi":"10.1016/j.jfa.2021.109096","publication_identifier":{"issn":["0022-1236"],"eissn":["1096-0783"]},"publisher":"Elsevier","article_processing_charge":"No","department":[{"_id":"RoSe"}],"month":"09","date_updated":"2025-04-14T07:26:53Z","title":"Semiclassical approximation and critical temperature shift for weakly interacting trapped bosons","isi":1,"article_number":"109096","volume":281,"oa_version":"Preprint","day":"15","ec_funded":1,"project":[{"name":"Analysis of quantum many-body systems","call_identifier":"H2020","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","grant_number":"694227"}],"quality_controlled":"1","external_id":{"isi":["000656508600008"],"arxiv":["2009.00992"]},"abstract":[{"lang":"eng","text":"We consider a system of N trapped bosons with repulsive interactions in a combined semiclassical mean-field limit at positive temperature. We show that the free energy is well approximated by the minimum of the Hartree free energy functional – a natural extension of the Hartree energy functional to positive temperatures. The Hartree free energy functional converges in the same limit to a semiclassical free energy functional, and we show that the system displays Bose–Einstein condensation if and only if it occurs in the semiclassical free energy functional. This allows us to show that for weak coupling the critical temperature decreases due to the repulsive interactions."}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2009.00992"}],"article_type":"original"},{"type":"conference","acknowledgement":"This work was supported by the National Key R&D Program of China (Grant No. 2016YFA0301700) and the ERC Starting Grant no. 335497.","author":[{"full_name":"Gao, Fei","last_name":"Gao","first_name":"Fei"},{"first_name":"Jie Yin","last_name":"Zhang","full_name":"Zhang, Jie Yin"},{"first_name":"Jian Huan","full_name":"Wang, Jian Huan","last_name":"Wang"},{"full_name":"Ming, Ming","last_name":"Ming","first_name":"Ming"},{"full_name":"Wang, Tina","last_name":"Wang","first_name":"Tina"},{"first_name":"Jian Jun","last_name":"Zhang","full_name":"Zhang, Jian Jun"},{"full_name":"Watzinger, Hannes","id":"35DF8E50-F248-11E8-B48F-1D18A9856A87","last_name":"Watzinger","first_name":"Hannes"},{"full_name":"Kukucka, Josip","id":"3F5D8856-F248-11E8-B48F-1D18A9856A87","last_name":"Kukucka","first_name":"Josip"},{"first_name":"Lada","orcid":"0000-0003-2424-8636","id":"31E9F056-F248-11E8-B48F-1D18A9856A87","full_name":"Vukušić, Lada","last_name":"Vukušić"},{"last_name":"Katsaros","id":"38DB5788-F248-11E8-B48F-1D18A9856A87","full_name":"Katsaros, Georgios","orcid":"0000-0001-8342-202X","first_name":"Georgios"},{"full_name":"Wang, Ke","last_name":"Wang","first_name":"Ke"},{"last_name":"Xu","full_name":"Xu, Gang","first_name":"Gang"},{"first_name":"Hai Ou","full_name":"Li, Hai Ou","last_name":"Li"},{"first_name":"Guo Ping","last_name":"Guo","full_name":"Guo, Guo Ping"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"9464","scopus_import":"1","date_created":"2021-06-06T22:01:29Z","status":"public","language":[{"iso":"eng"}],"publication":"2021 5th IEEE Electron Devices Technology and Manufacturing Conference, EDTM 2021","department":[{"_id":"GeKa"}],"month":"04","date_updated":"2024-10-22T09:41:03Z","title":"Ge/Si quantum wires for quantum computing","isi":1,"article_number":"9420817","citation":{"ieee":"F. Gao <i>et al.</i>, “Ge/Si quantum wires for quantum computing,” in <i>2021 5th IEEE Electron Devices Technology and Manufacturing Conference, EDTM 2021</i>, Virtual, Online, 2021.","mla":"Gao, Fei, et al. “Ge/Si Quantum Wires for Quantum Computing.” <i>2021 5th IEEE Electron Devices Technology and Manufacturing Conference, EDTM 2021</i>, 9420817, IEEE, 2021, doi:<a href=\"https://doi.org/10.1109/EDTM50988.2021.9420817\">10.1109/EDTM50988.2021.9420817</a>.","ista":"Gao F, Zhang JY, Wang JH, Ming M, Wang T, Zhang JJ, Watzinger H, Kukucka J, Vukušić L, Katsaros G, Wang K, Xu G, Li HO, Guo GP. 2021. Ge/Si quantum wires for quantum computing. 2021 5th IEEE Electron Devices Technology and Manufacturing Conference, EDTM 2021. EDTM: IEEE Electron Devices Technology and Manufacturing Conference, 9420817.","ama":"Gao F, Zhang JY, Wang JH, et al. Ge/Si quantum wires for quantum computing. In: <i>2021 5th IEEE Electron Devices Technology and Manufacturing Conference, EDTM 2021</i>. IEEE; 2021. doi:<a href=\"https://doi.org/10.1109/EDTM50988.2021.9420817\">10.1109/EDTM50988.2021.9420817</a>","chicago":"Gao, Fei, Jie Yin Zhang, Jian Huan Wang, Ming Ming, Tina Wang, Jian Jun Zhang, Hannes Watzinger, et al. “Ge/Si Quantum Wires for Quantum Computing.” In <i>2021 5th IEEE Electron Devices Technology and Manufacturing Conference, EDTM 2021</i>. IEEE, 2021. <a href=\"https://doi.org/10.1109/EDTM50988.2021.9420817\">https://doi.org/10.1109/EDTM50988.2021.9420817</a>.","short":"F. Gao, J.Y. Zhang, J.H. Wang, M. Ming, T. Wang, J.J. Zhang, H. Watzinger, J. Kukucka, L. Vukušić, G. Katsaros, K. Wang, G. Xu, H.O. Li, G.P. Guo, in:, 2021 5th IEEE Electron Devices Technology and Manufacturing Conference, EDTM 2021, IEEE, 2021.","apa":"Gao, F., Zhang, J. Y., Wang, J. H., Ming, M., Wang, T., Zhang, J. J., … Guo, G. P. (2021). Ge/Si quantum wires for quantum computing. In <i>2021 5th IEEE Electron Devices Technology and Manufacturing Conference, EDTM 2021</i>. Virtual, Online: IEEE. <a href=\"https://doi.org/10.1109/EDTM50988.2021.9420817\">https://doi.org/10.1109/EDTM50988.2021.9420817</a>"},"date_published":"2021-04-08T00:00:00Z","year":"2021","publication_status":"published","doi":"10.1109/EDTM50988.2021.9420817","article_processing_charge":"No","publisher":"IEEE","publication_identifier":{"isbn":["9781728181769"]},"abstract":[{"lang":"eng","text":"We firstly introduce the self-assembled growth of highly uniform Ge quantum wires with controllable position, distance and length on patterned Si (001) substrates. We then present the electrically tunable strong spin-orbit coupling, the first Ge hole spin qubit and ultrafast operation of hole spin qubit in the Ge/Si quantum wires."}],"conference":{"location":"Virtual, Online","start_date":"2021-04-08","end_date":"2021-04-11","name":"EDTM: IEEE Electron Devices Technology and Manufacturing Conference"},"day":"08","oa_version":"None","ec_funded":1,"project":[{"call_identifier":"FP7","_id":"25517E86-B435-11E9-9278-68D0E5697425","name":"Towards Spin qubits and Majorana fermions in Germanium self assembled hut-wires","grant_number":"335497"}],"quality_controlled":"1","external_id":{"isi":["000675595800006"]}},{"title":"A step in the Delaunay mosaic of order k","article_number":"15","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)"},"date_updated":"2025-07-10T12:01:46Z","month":"04","department":[{"_id":"HeEd"}],"publication_status":"published","publication_identifier":{"eissn":["1420-8997"],"issn":["0047-2468"]},"publisher":"Springer Nature","article_processing_charge":"Yes (via OA deal)","doi":"10.1007/s00022-021-00577-4","year":"2021","date_published":"2021-04-01T00:00:00Z","citation":{"short":"H. Edelsbrunner, A. Nikitenko, G.F. Osang, Journal of Geometry 112 (2021).","apa":"Edelsbrunner, H., Nikitenko, A., &#38; Osang, G. F. (2021). A step in the Delaunay mosaic of order k. <i>Journal of Geometry</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00022-021-00577-4\">https://doi.org/10.1007/s00022-021-00577-4</a>","ama":"Edelsbrunner H, Nikitenko A, Osang GF. A step in the Delaunay mosaic of order k. <i>Journal of Geometry</i>. 2021;112(1). doi:<a href=\"https://doi.org/10.1007/s00022-021-00577-4\">10.1007/s00022-021-00577-4</a>","chicago":"Edelsbrunner, Herbert, Anton Nikitenko, and Georg F Osang. “A Step in the Delaunay Mosaic of Order K.” <i>Journal of Geometry</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/s00022-021-00577-4\">https://doi.org/10.1007/s00022-021-00577-4</a>.","ista":"Edelsbrunner H, Nikitenko A, Osang GF. 2021. A step in the Delaunay mosaic of order k. Journal of Geometry. 112(1), 15.","ieee":"H. Edelsbrunner, A. Nikitenko, and G. F. Osang, “A step in the Delaunay mosaic of order k,” <i>Journal of Geometry</i>, vol. 112, no. 1. Springer Nature, 2021.","mla":"Edelsbrunner, Herbert, et al. “A Step in the Delaunay Mosaic of Order K.” <i>Journal of Geometry</i>, vol. 112, no. 1, 15, Springer Nature, 2021, doi:<a href=\"https://doi.org/10.1007/s00022-021-00577-4\">10.1007/s00022-021-00577-4</a>."},"abstract":[{"text":"Given a locally finite set 𝑋⊆ℝ𝑑 and an integer 𝑘≥0, we consider the function 𝐰𝑘:Del𝑘(𝑋)→ℝ on the dual of the order-k Voronoi tessellation, whose sublevel sets generalize the notion of alpha shapes from order-1 to order-k (Edelsbrunner et al. in IEEE Trans Inf Theory IT-29:551–559, 1983; Krasnoshchekov and Polishchuk in Inf Process Lett 114:76–83, 2014). While this function is not necessarily generalized discrete Morse, in the sense of Forman (Adv Math 134:90–145, 1998) and Freij (Discrete Math 309:3821–3829, 2009), we prove that it satisfies similar properties so that its increments can be meaningfully classified into critical and non-critical steps. This result extends to the case of weighted points and sheds light on k-fold covers with balls in Euclidean space.","lang":"eng"}],"article_type":"original","quality_controlled":"1","volume":112,"day":"01","oa_version":"Published Version","author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","first_name":"Herbert","orcid":"0000-0002-9823-6833"},{"full_name":"Nikitenko, Anton","id":"3E4FF1BA-F248-11E8-B48F-1D18A9856A87","last_name":"Nikitenko","orcid":"0000-0002-0659-3201","first_name":"Anton"},{"orcid":"0000-0002-8882-5116","first_name":"Georg F","last_name":"Osang","full_name":"Osang, Georg F","id":"464B40D6-F248-11E8-B48F-1D18A9856A87"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","file_date_updated":"2021-06-11T13:16:26Z","corr_author":"1","issue":"1","_id":"9465","oa":1,"intvolume":"       112","file":[{"content_type":"application/pdf","file_name":"2021_Geometry_Edelsbrunner.pdf","date_updated":"2021-06-11T13:16:26Z","file_id":"9544","creator":"kschuh","checksum":"e52a832f1def52a2b23d21bcc09e646f","date_created":"2021-06-11T13:16:26Z","file_size":694706,"relation":"main_file","success":1,"access_level":"open_access"}],"ddc":["510"],"has_accepted_license":"1","publication":"Journal of Geometry","language":[{"iso":"eng"}],"date_created":"2021-06-06T22:01:29Z","status":"public","scopus_import":"1"},{"title":"Suppression of turbulence and travelling waves in a vertical heated pipe","article_number":"A17","isi":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)"},"date_updated":"2025-07-10T12:01:47Z","month":"07","department":[{"_id":"BjHo"}],"publication_status":"published","publication_identifier":{"eissn":["1469-7645"],"issn":["0022-1120"]},"article_processing_charge":"Yes (via OA deal)","publisher":"Cambridge University Press","doi":"10.1017/jfm.2021.371","date_published":"2021-07-25T00:00:00Z","year":"2021","citation":{"ista":"Marensi E, He S, Willis AP. 2021. Suppression of turbulence and travelling waves in a vertical heated pipe. Journal of Fluid Mechanics. 919, A17.","ieee":"E. Marensi, S. He, and A. P. Willis, “Suppression of turbulence and travelling waves in a vertical heated pipe,” <i>Journal of Fluid Mechanics</i>, vol. 919. Cambridge University Press, 2021.","mla":"Marensi, Elena, et al. “Suppression of Turbulence and Travelling Waves in a Vertical Heated Pipe.” <i>Journal of Fluid Mechanics</i>, vol. 919, A17, Cambridge University Press, 2021, doi:<a href=\"https://doi.org/10.1017/jfm.2021.371\">10.1017/jfm.2021.371</a>.","short":"E. Marensi, S. He, A.P. Willis, Journal of Fluid Mechanics 919 (2021).","apa":"Marensi, E., He, S., &#38; Willis, A. P. (2021). Suppression of turbulence and travelling waves in a vertical heated pipe. <i>Journal of Fluid Mechanics</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/jfm.2021.371\">https://doi.org/10.1017/jfm.2021.371</a>","ama":"Marensi E, He S, Willis AP. Suppression of turbulence and travelling waves in a vertical heated pipe. <i>Journal of Fluid Mechanics</i>. 2021;919. doi:<a href=\"https://doi.org/10.1017/jfm.2021.371\">10.1017/jfm.2021.371</a>","chicago":"Marensi, Elena, Shuisheng He, and Ashley P. Willis. “Suppression of Turbulence and Travelling Waves in a Vertical Heated Pipe.” <i>Journal of Fluid Mechanics</i>. Cambridge University Press, 2021. <a href=\"https://doi.org/10.1017/jfm.2021.371\">https://doi.org/10.1017/jfm.2021.371</a>."},"abstract":[{"lang":"eng","text":"Turbulence in the flow of fluid through a pipe can be suppressed by buoyancy forces. As the suppression of turbulence leads to severe heat transfer deterioration, this is an important and undesirable phenomenon in both heating and cooling applications. Vertical flow is often considered, as the axial buoyancy force can help drive the flow. With heating measured by the buoyancy parameter 𝐶, our direct numerical simulations show that shear-driven turbulence may either be completely laminarised or it transitions to a relatively quiescent convection-driven state. Buoyancy forces cause a flattening of the base flow profile, which in isothermal pipe flow has recently been linked to complete suppression of turbulence (Kühnen et al., Nat. Phys., vol. 14, 2018, pp. 386–390), and the flattened laminar base profile has enhanced nonlinear stability (Marensi et al., J. Fluid Mech., vol. 863, 2019, pp. 50–875). In agreement with these findings, the nonlinear lower-branch travelling-wave solution analysed here, which is believed to mediate transition to turbulence in isothermal pipe flow, is shown to be suppressed by buoyancy. A linear instability of the laminar base flow is responsible for the appearance of the relatively quiescent convection driven state for 𝐶≳4 across the range of Reynolds numbers considered. In the suppression of turbulence, however, i.e. in the transition from turbulence, we find clearer association with the analysis of He et al. (J. Fluid Mech., vol. 809, 2016, pp. 31–71) than with the above dynamical systems approach, which describes better the transition to turbulence. The laminarisation criterion He et al. propose, based on an apparent Reynolds number of the flow as measured by its driving pressure gradient, is found to capture the critical 𝐶=𝐶𝑐𝑟(𝑅𝑒) above which the flow will be laminarised or switch to the convection-driven type. Our analysis suggests that it is the weakened rolls, rather than the streaks, which appear to be critical for laminarisation."}],"article_type":"original","external_id":{"isi":["000653785000001"],"arxiv":["2008.13486"]},"quality_controlled":"1","volume":919,"day":"25","oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"The anonymous referees are kindly acknowledged for their useful suggestions andcomments.","author":[{"last_name":"Marensi","full_name":"Marensi, Elena","id":"0BE7553A-1004-11EA-B805-18983DDC885E","first_name":"Elena","orcid":"0000-0001-7173-4923"},{"last_name":"He","full_name":"He, Shuisheng","first_name":"Shuisheng"},{"first_name":"Ashley P.","full_name":"Willis, Ashley P.","last_name":"Willis"}],"type":"journal_article","file_date_updated":"2021-08-03T09:53:28Z","corr_author":"1","_id":"9467","arxiv":1,"oa":1,"intvolume":"       919","file":[{"relation":"main_file","file_size":4087358,"access_level":"open_access","success":1,"checksum":"867ad077e45c181c2c5ec1311ba27c41","date_created":"2021-08-03T09:53:28Z","file_id":"9766","creator":"kschuh","content_type":"application/pdf","file_name":"2021_JournalFluidMechanics_Marensi.pdf","date_updated":"2021-08-03T09:53:28Z"}],"ddc":["530"],"has_accepted_license":"1","publication":"Journal of Fluid Mechanics","language":[{"iso":"eng"}],"date_created":"2021-06-06T22:01:30Z","scopus_import":"1","status":"public"},{"language":[{"iso":"eng"}],"publication":"SIAM Journal on Discrete Mathematics","status":"public","date_created":"2021-06-06T22:01:30Z","scopus_import":"1","page":"1050-1076","intvolume":"        35","arxiv":1,"_id":"9468","oa":1,"type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"orcid":"0000-0003-2401-8670","first_name":"Alan M","id":"3207FDC6-F248-11E8-B48F-1D18A9856A87","full_name":"Arroyo Guevara, Alan M","last_name":"Arroyo Guevara"},{"last_name":"Richter","full_name":"Richter, R. Bruce","first_name":"R. Bruce"},{"full_name":"Sunohara, Matthew","last_name":"Sunohara","first_name":"Matthew"}],"issue":"2","project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","grant_number":"754411"}],"external_id":{"arxiv":["2001.06053"],"isi":["000674142200022"]},"quality_controlled":"1","ec_funded":1,"volume":35,"day":"20","oa_version":"Preprint","article_type":"original","abstract":[{"lang":"eng","text":"Motivated by the successful application of geometry to proving the Harary--Hill conjecture for “pseudolinear” drawings of $K_n$, we introduce “pseudospherical” drawings of graphs. A spherical drawing of a graph $G$ is a drawing in the unit sphere $\\mathbb{S}^2$ in which the vertices of $G$ are represented as points---no three on a great circle---and the edges of $G$ are shortest-arcs in $\\mathbb{S}^2$ connecting pairs of vertices. Such a drawing has three properties: (1) every edge $e$ is contained in a simple closed curve $\\gamma_e$ such that the only vertices in $\\gamma_e$ are the ends of $e$; (2) if $e\\ne f$, then $\\gamma_e\\cap\\gamma_f$ has precisely two crossings; and (3) if $e\\ne f$, then $e$ intersects $\\gamma_f$ at most once, in either a crossing or an end of $e$. We use properties (1)--(3) to define a pseudospherical drawing of $G$. Our main result is that for the complete graph, properties (1)--(3) are equivalent to the same three properties but with “precisely two crossings” in (2) replaced by “at most two crossings.” The proof requires a result in the geometric transversal theory of arrangements of pseudocircles. This is proved using the surprising result that the absence of special arcs (coherent spirals) in an arrangement of simple closed curves characterizes the fact that any two curves in the arrangement have at most two crossings. Our studies provide the necessary ideas for exhibiting a drawing of $K_{10}$ that has no extension to an arrangement of pseudocircles and a drawing of $K_9$ that does extend to an arrangement of pseudocircles, but no such extension has all pairs of pseudocircles crossing twice.\r\n"}],"main_file_link":[{"url":"https://arxiv.org/abs/2001.06053","open_access":"1"}],"doi":"10.1137/20M1313234","article_processing_charge":"No","publication_identifier":{"issn":["0895-4801"]},"publisher":"Society for Industrial and Applied Mathematics","publication_status":"published","citation":{"mla":"Arroyo Guevara, Alan M., et al. “Extending Drawings of Complete Graphs into Arrangements of Pseudocircles.” <i>SIAM Journal on Discrete Mathematics</i>, vol. 35, no. 2, Society for Industrial and Applied Mathematics, 2021, pp. 1050–76, doi:<a href=\"https://doi.org/10.1137/20M1313234\">10.1137/20M1313234</a>.","ieee":"A. M. Arroyo Guevara, R. B. Richter, and M. Sunohara, “Extending drawings of complete graphs into arrangements of pseudocircles,” <i>SIAM Journal on Discrete Mathematics</i>, vol. 35, no. 2. Society for Industrial and Applied Mathematics, pp. 1050–1076, 2021.","ista":"Arroyo Guevara AM, Richter RB, Sunohara M. 2021. Extending drawings of complete graphs into arrangements of pseudocircles. SIAM Journal on Discrete Mathematics. 35(2), 1050–1076.","chicago":"Arroyo Guevara, Alan M, R. Bruce Richter, and Matthew Sunohara. “Extending Drawings of Complete Graphs into Arrangements of Pseudocircles.” <i>SIAM Journal on Discrete Mathematics</i>. Society for Industrial and Applied Mathematics, 2021. <a href=\"https://doi.org/10.1137/20M1313234\">https://doi.org/10.1137/20M1313234</a>.","ama":"Arroyo Guevara AM, Richter RB, Sunohara M. Extending drawings of complete graphs into arrangements of pseudocircles. <i>SIAM Journal on Discrete Mathematics</i>. 2021;35(2):1050-1076. doi:<a href=\"https://doi.org/10.1137/20M1313234\">10.1137/20M1313234</a>","apa":"Arroyo Guevara, A. M., Richter, R. B., &#38; Sunohara, M. (2021). Extending drawings of complete graphs into arrangements of pseudocircles. <i>SIAM Journal on Discrete Mathematics</i>. Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/20M1313234\">https://doi.org/10.1137/20M1313234</a>","short":"A.M. Arroyo Guevara, R.B. Richter, M. Sunohara, SIAM Journal on Discrete Mathematics 35 (2021) 1050–1076."},"date_published":"2021-05-20T00:00:00Z","year":"2021","isi":1,"title":"Extending drawings of complete graphs into arrangements of pseudocircles","month":"05","department":[{"_id":"UlWa"}],"date_updated":"2025-04-14T07:43:46Z"},{"file_date_updated":"2021-06-10T19:33:56Z","issue":"2","type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"Institute of Science and Technology Austria (IST Austria). Email: peter.davies@ist.ac.at. Work partially\r\ndone at the Department of Computer Science and Centre for Discrete Mathematics and its Applications (DIMAP),University of Warwick. Research partially supported by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No 754411, the Centre for Discrete Mathematics and its Applications, a Weizmann-UK Making Connections Grant, and EPSRC award EP/N011163/1.","author":[{"first_name":"Artur","last_name":"Czumaj","full_name":"Czumaj, Artur"},{"last_name":"Davies","full_name":"Davies, Peter","id":"11396234-BB50-11E9-B24C-90FCE5697425","first_name":"Peter","orcid":"0000-0002-5646-9524"},{"first_name":"Merav","last_name":"Parter","full_name":"Parter, Merav"}],"oa":1,"related_material":{"record":[{"relation":"earlier_version","id":"7802","status":"public"}]},"_id":"9541","arxiv":1,"file":[{"file_id":"9542","creator":"pdavies","content_type":"application/pdf","date_updated":"2021-06-10T19:33:56Z","file_name":"MISMM-arxiv.pdf","relation":"main_file","file_size":587404,"success":1,"access_level":"open_access","checksum":"a21c627683890c309a68f6389302c408","date_created":"2021-06-10T19:33:56Z"}],"ddc":["000"],"intvolume":"        17","date_created":"2021-06-10T19:31:05Z","status":"public","scopus_import":"1","has_accepted_license":"1","language":[{"iso":"eng"}],"publication":"ACM Transactions on Algorithms","department":[{"_id":"DaAl"}],"month":"06","date_updated":"2025-04-15T06:54:47Z","title":"Graph sparsification for derandomizing massively parallel computation with low space","isi":1,"article_number":"16","citation":{"ista":"Czumaj A, Davies P, Parter M. 2021. Graph sparsification for derandomizing massively parallel computation with low space. ACM Transactions on Algorithms. 17(2), 16.","mla":"Czumaj, Artur, et al. “Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space.” <i>ACM Transactions on Algorithms</i>, vol. 17, no. 2, 16, Association for Computing Machinery, 2021, doi:<a href=\"https://doi.org/10.1145/3451992\">10.1145/3451992</a>.","ieee":"A. Czumaj, P. Davies, and M. Parter, “Graph sparsification for derandomizing massively parallel computation with low space,” <i>ACM Transactions on Algorithms</i>, vol. 17, no. 2. Association for Computing Machinery, 2021.","apa":"Czumaj, A., Davies, P., &#38; Parter, M. (2021). Graph sparsification for derandomizing massively parallel computation with low space. <i>ACM Transactions on Algorithms</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3451992\">https://doi.org/10.1145/3451992</a>","short":"A. Czumaj, P. Davies, M. Parter, ACM Transactions on Algorithms 17 (2021).","chicago":"Czumaj, Artur, Peter Davies, and Merav Parter. “Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space.” <i>ACM Transactions on Algorithms</i>. Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3451992\">https://doi.org/10.1145/3451992</a>.","ama":"Czumaj A, Davies P, Parter M. Graph sparsification for derandomizing massively parallel computation with low space. <i>ACM Transactions on Algorithms</i>. 2021;17(2). doi:<a href=\"https://doi.org/10.1145/3451992\">10.1145/3451992</a>"},"date_published":"2021-06-01T00:00:00Z","year":"2021","publication_status":"published","doi":"10.1145/3451992","publication_identifier":{"eissn":["1549-6333"],"issn":["1549-6325"]},"publisher":"Association for Computing Machinery","article_processing_charge":"No","abstract":[{"lang":"eng","text":"The Massively Parallel Computation (MPC) model is an emerging model that distills core aspects of distributed and parallel computation, developed as a tool to solve combinatorial (typically graph) problems in systems of many machines with limited space. Recent work has focused on the regime in which machines have sublinear (in n, the number of nodes in the input graph) space, with randomized algorithms presented for the fundamental problems of Maximal Matching and Maximal Independent Set. However, there have been no prior corresponding deterministic algorithms. A major challenge underlying the sublinear space setting is that the local space of each machine might be too small to store all edges incident to a single node. This poses a considerable obstacle compared to classical models in which each node is assumed to know and have easy access to its incident edges. To overcome this barrier, we introduce a new graph sparsification technique that deterministically computes a low-degree subgraph, with the additional property that solving the problem on this subgraph provides significant progress towards solving the problem for the original input graph. Using this framework to derandomize the well-known algorithm of Luby [SICOMP’86], we obtain O(log Δ + log log n)-round deterministic MPC algorithms for solving the problems of Maximal Matching and Maximal Independent Set with O(nɛ) space on each machine for any constant ɛ > 0. These algorithms also run in O(log Δ) rounds in the closely related model of CONGESTED CLIQUE, improving upon the state-of-the-art bound of O(log 2Δ) rounds by Censor-Hillel et al. [DISC’17]."}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1912.05390"}],"article_type":"original","day":"01","volume":17,"oa_version":"Submitted Version","ec_funded":1,"project":[{"name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"754411"}],"quality_controlled":"1","external_id":{"arxiv":["1912.05390"],"isi":["000661311300006"]}},{"conference":{"location":"Virtual","start_date":"2021-05-03","end_date":"2021-05-07","name":"ICLR: International Conference on Learning Representations"},"main_file_link":[{"url":"https://openreview.net/pdf?id=t86MwoUCCNe","open_access":"1"}],"abstract":[{"lang":"eng","text":"We consider the problem ofdistributed mean estimation (DME), in which n machines are each given a local d-dimensional vector xv∈Rd, and must cooperate to estimate the mean of their inputs μ=1n∑nv=1xv, while minimizing total communication cost. DME is a fundamental construct in distributed machine learning, and there has been considerable work on variants of this problem, especially in the context of distributed variance reduction for stochastic gradients in parallel SGD. Previous work typically assumes an upper bound on the norm of the input vectors, and achieves an error bound in terms of this norm. However, in many real applications, the input vectors are concentrated around the correct output μ, but μ itself has large norm. In such cases, previous output error bounds perform poorly. In this paper, we show that output error bounds need not depend on input norm. We provide a method of quantization which allows distributed mean estimation to be performed with solution quality dependent only on the distance between inputs, not on input norm, and show an analogous result for distributed variance reduction. The technique is based on a new connection with lattice theory. We also provide lower bounds showing that the communication to error trade-off of our algorithms is asymptotically optimal. As the lattices achieving optimal bounds under l2-norm can be computationally impractical, we also present an extension which leverages easy-to-use cubic lattices, and is loose only up to a logarithmic factor ind. We show experimentally that our method yields practical improvements for common applications, relative to prior approaches."}],"language":[{"iso":"eng"}],"publication":"9th International Conference on Learning Representations","project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411"}],"quality_controlled":"1","external_id":{"arxiv":["2002.09268"]},"ec_funded":1,"status":"public","date_created":"2021-06-10T19:46:08Z","day":"01","oa_version":"Published Version","type":"conference","author":[{"last_name":"Davies","id":"11396234-BB50-11E9-B24C-90FCE5697425","full_name":"Davies, Peter","first_name":"Peter","orcid":"0000-0002-5646-9524"},{"first_name":"Vijaykrishna","full_name":"Gurunanthan, Vijaykrishna","last_name":"Gurunanthan"},{"first_name":"Niusha ","last_name":"Moshrefi","full_name":"Moshrefi, Niusha ","id":"4db776ff-ce15-11eb-96e3-bc2b90b01c16"},{"full_name":"Ashkboos, Saleh","id":"0D0A9058-257B-11EA-A937-9341C3D8BC8A","last_name":"Ashkboos","first_name":"Saleh"},{"last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"New bounds for distributed mean estimation and variance reduction","month":"05","department":[{"_id":"DaAl"}],"date_updated":"2025-07-10T12:01:50Z","corr_author":"1","arxiv":1,"article_processing_charge":"No","publication_status":"published","_id":"9543","citation":{"short":"P. Davies, V. Gurunanthan, N. Moshrefi, S. Ashkboos, D.-A. Alistarh, in:, 9th International Conference on Learning Representations, 2021.","apa":"Davies, P., Gurunanthan, V., Moshrefi, N., Ashkboos, S., &#38; Alistarh, D.-A. (2021). New bounds for distributed mean estimation and variance reduction. In <i>9th International Conference on Learning Representations</i>. Virtual.","ama":"Davies P, Gurunanthan V, Moshrefi N, Ashkboos S, Alistarh D-A. New bounds for distributed mean estimation and variance reduction. In: <i>9th International Conference on Learning Representations</i>. ; 2021.","chicago":"Davies, Peter, Vijaykrishna Gurunanthan, Niusha  Moshrefi, Saleh Ashkboos, and Dan-Adrian Alistarh. “New Bounds for Distributed Mean Estimation and Variance Reduction.” In <i>9th International Conference on Learning Representations</i>, 2021.","ista":"Davies P, Gurunanthan V, Moshrefi N, Ashkboos S, Alistarh D-A. 2021. New bounds for distributed mean estimation and variance reduction. 9th International Conference on Learning Representations. ICLR: International Conference on Learning Representations.","ieee":"P. Davies, V. Gurunanthan, N. Moshrefi, S. Ashkboos, and D.-A. Alistarh, “New bounds for distributed mean estimation and variance reduction,” in <i>9th International Conference on Learning Representations</i>, Virtual, 2021.","mla":"Davies, Peter, et al. “New Bounds for Distributed Mean Estimation and Variance Reduction.” <i>9th International Conference on Learning Representations</i>, 2021."},"year":"2021","oa":1,"date_published":"2021-05-01T00:00:00Z"},{"citation":{"ista":"Rittig T, Sumin D, Babaei V, Didyk P, Voloboy A, Wilkie A, Bickel B, Myszkowski K, Weyrich T, Křivánek J. 2021. Neural acceleration of scattering-aware color 3D printing. Computer Graphics Forum. 40(2), 205–219.","mla":"Rittig, Tobias, et al. “Neural Acceleration of Scattering-Aware Color 3D Printing.” <i>Computer Graphics Forum</i>, vol. 40, no. 2, Wiley, 2021, pp. 205–19, doi:<a href=\"https://doi.org/10.1111/cgf.142626\">10.1111/cgf.142626</a>.","ieee":"T. Rittig <i>et al.</i>, “Neural acceleration of scattering-aware color 3D printing,” <i>Computer Graphics Forum</i>, vol. 40, no. 2. Wiley, pp. 205–219, 2021.","apa":"Rittig, T., Sumin, D., Babaei, V., Didyk, P., Voloboy, A., Wilkie, A., … Křivánek, J. (2021). Neural acceleration of scattering-aware color 3D printing. <i>Computer Graphics Forum</i>. Wiley. <a href=\"https://doi.org/10.1111/cgf.142626\">https://doi.org/10.1111/cgf.142626</a>","short":"T. Rittig, D. Sumin, V. Babaei, P. Didyk, A. Voloboy, A. Wilkie, B. Bickel, K. Myszkowski, T. Weyrich, J. Křivánek, Computer Graphics Forum 40 (2021) 205–219.","chicago":"Rittig, Tobias, Denis Sumin, Vahid Babaei, Piotr Didyk, Alexey Voloboy, Alexander Wilkie, Bernd Bickel, Karol Myszkowski, Tim Weyrich, and Jaroslav Křivánek. “Neural Acceleration of Scattering-Aware Color 3D Printing.” <i>Computer Graphics Forum</i>. Wiley, 2021. <a href=\"https://doi.org/10.1111/cgf.142626\">https://doi.org/10.1111/cgf.142626</a>.","ama":"Rittig T, Sumin D, Babaei V, et al. Neural acceleration of scattering-aware color 3D printing. <i>Computer Graphics Forum</i>. 2021;40(2):205-219. doi:<a href=\"https://doi.org/10.1111/cgf.142626\">10.1111/cgf.142626</a>"},"date_published":"2021-05-01T00:00:00Z","year":"2021","doi":"10.1111/cgf.142626","publication_identifier":{"issn":["0167-7055"],"eissn":["1467-8659"]},"publisher":"Wiley","article_processing_charge":"No","publication_status":"published","month":"05","department":[{"_id":"BeBi"}],"date_updated":"2025-03-31T15:58:16Z","isi":1,"title":"Neural acceleration of scattering-aware color 3D printing","ec_funded":1,"day":"01","volume":40,"oa_version":"Submitted Version","project":[{"grant_number":"642841","_id":"2508E324-B435-11E9-9278-68D0E5697425","name":"Distributed 3D Object Design","call_identifier":"H2020"},{"name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","call_identifier":"H2020","_id":"24F9549A-B435-11E9-9278-68D0E5697425","grant_number":"715767"}],"quality_controlled":"1","external_id":{"isi":["000657959600017"]},"article_type":"original","abstract":[{"lang":"eng","text":"With the wider availability of full-color 3D printers, color-accurate 3D-print preparation has received increased attention. A key challenge lies in the inherent translucency of commonly used print materials that blurs out details of the color texture. Previous work tries to compensate for these scattering effects through strategic assignment of colored primary materials to printer voxels. To date, the highest-quality approach uses iterative optimization that relies on computationally expensive Monte Carlo light transport simulation to predict the surface appearance from subsurface scattering within a given print material distribution; that optimization, however, takes in the order of days on a single machine. In our work, we dramatically speed up the process by replacing the light transport simulation with a data-driven approach. Leveraging a deep neural network to predict the scattering within a highly heterogeneous medium, our method performs around two orders of magnitude faster than Monte Carlo rendering while yielding optimization results of similar quality level. The network is based on an established method from atmospheric cloud rendering, adapted to our domain and extended by a physically motivated weight sharing scheme that substantially reduces the network size. We analyze its performance in an end-to-end print preparation pipeline and compare quality and runtime to alternative approaches, and demonstrate its generalization to unseen geometry and material values. This for the first time enables full heterogenous material optimization for 3D-print preparation within time frames in the order of the actual printing time."}],"oa":1,"_id":"9547","issue":"2","file_date_updated":"2021-10-11T12:06:50Z","type":"journal_article","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","author":[{"first_name":"Tobias","full_name":"Rittig, Tobias","last_name":"Rittig"},{"full_name":"Sumin, Denis","last_name":"Sumin","first_name":"Denis"},{"full_name":"Babaei, Vahid","last_name":"Babaei","first_name":"Vahid"},{"first_name":"Piotr","last_name":"Didyk","full_name":"Didyk, Piotr"},{"first_name":"Alexey","full_name":"Voloboy, Alexey","last_name":"Voloboy"},{"first_name":"Alexander","full_name":"Wilkie, Alexander","last_name":"Wilkie"},{"last_name":"Bickel","full_name":"Bickel, Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87","first_name":"Bernd","orcid":"0000-0001-6511-9385"},{"first_name":"Karol","last_name":"Myszkowski","full_name":"Myszkowski, Karol"},{"first_name":"Tim","full_name":"Weyrich, Tim","last_name":"Weyrich"},{"full_name":"Křivánek, Jaroslav","last_name":"Křivánek","first_name":"Jaroslav"}],"acknowledgement":"We thank Sebastian Cucerca for processing and capturing the phys-cal printouts. This work was supported by the Charles University grant SVV-260588 and Czech Science Foundation grant 19-07626S. This project has received funding from the European Union’s Horizon 2020 research and innovation programme, under the Marie Skłodowska Curie grant agreements No 642841 (DISTRO) and No765911 (RealVision), and under the European Research Council grant agreement No 715767 (MATERIALIZABLE).","status":"public","date_created":"2021-06-13T22:01:32Z","scopus_import":"1","language":[{"iso":"eng"}],"publication":"Computer Graphics Forum","has_accepted_license":"1","ddc":["004"],"file":[{"relation":"main_file","file_size":26026501,"success":1,"access_level":"open_access","checksum":"33271724215f54a75c39d2ed40f2c502","date_created":"2021-10-11T12:06:50Z","file_id":"10120","creator":"bbickel","content_type":"application/pdf","date_updated":"2021-10-11T12:06:50Z","file_name":"ScatteringAwareColor3DPrinting_authorVersion.pdf"}],"intvolume":"        40","page":"205-219"},{"oa":1,"_id":"9548","arxiv":1,"type":"journal_article","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","author":[{"last_name":"Ivanov","id":"87744F66-5C6F-11EA-AFE0-D16B3DDC885E","full_name":"Ivanov, Grigory","first_name":"Grigory"},{"first_name":"Igor","full_name":"Tsiutsiurupa, Igor","last_name":"Tsiutsiurupa"}],"acknowledgement":"The authors acknowledge the support of the grant of the Russian Government N 075-15-2019-1926.","scopus_import":"1","date_created":"2021-06-13T22:01:32Z","status":"public","language":[{"iso":"eng"}],"publication":"Journal of Geometric Analysis","intvolume":"        31","page":"11493-11528","citation":{"ista":"Ivanov G, Tsiutsiurupa I. 2021. Functional Löwner ellipsoids. Journal of Geometric Analysis. 31, 11493–11528.","mla":"Ivanov, Grigory, and Igor Tsiutsiurupa. “Functional Löwner Ellipsoids.” <i>Journal of Geometric Analysis</i>, vol. 31, Springer, 2021, pp. 11493–528, doi:<a href=\"https://doi.org/10.1007/s12220-021-00691-4\">10.1007/s12220-021-00691-4</a>.","ieee":"G. Ivanov and I. Tsiutsiurupa, “Functional Löwner ellipsoids,” <i>Journal of Geometric Analysis</i>, vol. 31. Springer, pp. 11493–11528, 2021.","apa":"Ivanov, G., &#38; Tsiutsiurupa, I. (2021). Functional Löwner ellipsoids. <i>Journal of Geometric Analysis</i>. Springer. <a href=\"https://doi.org/10.1007/s12220-021-00691-4\">https://doi.org/10.1007/s12220-021-00691-4</a>","short":"G. Ivanov, I. Tsiutsiurupa, Journal of Geometric Analysis 31 (2021) 11493–11528.","chicago":"Ivanov, Grigory, and Igor Tsiutsiurupa. “Functional Löwner Ellipsoids.” <i>Journal of Geometric Analysis</i>. Springer, 2021. <a href=\"https://doi.org/10.1007/s12220-021-00691-4\">https://doi.org/10.1007/s12220-021-00691-4</a>.","ama":"Ivanov G, Tsiutsiurupa I. Functional Löwner ellipsoids. <i>Journal of Geometric Analysis</i>. 2021;31:11493-11528. doi:<a href=\"https://doi.org/10.1007/s12220-021-00691-4\">10.1007/s12220-021-00691-4</a>"},"date_published":"2021-05-31T00:00:00Z","year":"2021","publication_status":"published","doi":"10.1007/s12220-021-00691-4","publication_identifier":{"eissn":["1559-002X"],"issn":["1050-6926"]},"publisher":"Springer","article_processing_charge":"No","month":"05","department":[{"_id":"UlWa"}],"date_updated":"2023-08-08T14:04:49Z","title":"Functional Löwner ellipsoids","isi":1,"volume":31,"day":"31","oa_version":"Preprint","quality_controlled":"1","external_id":{"isi":["000656507500001"],"arxiv":["2008.09543"]},"abstract":[{"lang":"eng","text":"We extend the notion of the minimal volume ellipsoid containing a convex body in Rd to the setting of logarithmically concave functions. We consider a vast class of logarithmically concave functions whose superlevel sets are concentric ellipsoids. For a fixed function from this class, we consider the set of all its “affine” positions. For any log-concave function f on Rd, we consider functions belonging to this set of “affine” positions, and find the one with the minimal integral under the condition that it is pointwise greater than or equal to f. We study the properties of existence and uniqueness of the solution to this problem. For any s∈[0,+∞), we consider the construction dual to the recently defined John s-function (Ivanov and Naszódi in Functional John ellipsoids. arXiv preprint: arXiv:2006.09934, 2020). We prove that such a construction determines a unique function and call it the Löwner s-function of f. We study the Löwner s-functions as s tends to zero and to infinity. Finally, extending the notion of the outer volume ratio, we define the outer integral ratio of a log-concave function and give an asymptotically tight bound on it."}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2008.09543"}],"article_type":"original"}]
