[{"publication_identifier":{"issn":["1097-6256"],"eissn":["1546-1726"]},"isi":1,"project":[{"call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411"}],"month":"05","year":"2021","department":[{"_id":"GaTk"}],"article_type":"original","publisher":"Springer Nature","oa_version":"Preprint","type":"journal_article","publication_status":"published","external_id":{"isi":["000652577300003"]},"_id":"9439","status":"public","author":[{"id":"358A453A-F248-11E8-B48F-1D18A9856A87","first_name":"Wiktor F","last_name":"Mlynarski","full_name":"Mlynarski, Wiktor F"},{"first_name":"Ann M.","full_name":"Hermundstad, Ann M.","last_name":"Hermundstad"}],"date_updated":"2023-08-08T13:51:14Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://doi.org/10.1101/669200 ","open_access":"1"}],"abstract":[{"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.","lang":"eng"}],"scopus_import":"1","page":"998-1009","title":"Efficient and adaptive sensory codes","oa":1,"citation":{"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>","ista":"Mlynarski WF, Hermundstad AM. 2021. Efficient and adaptive sensory codes. Nature Neuroscience. 24, 998–1009.","short":"W.F. Mlynarski, A.M. Hermundstad, Nature Neuroscience 24 (2021) 998–1009.","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>","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>.","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>."},"date_created":"2021-05-30T22:01:24Z","quality_controlled":"1","doi":"10.1038/s41593-021-00846-0","article_processing_charge":"No","ec_funded":1,"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.","publication":"Nature Neuroscience","day":"20","volume":24,"intvolume":"        24","date_published":"2021-05-20T00:00:00Z"},{"volume":189,"publication":"37th International Symposium on Computational Geometry (SoCG 2021)","day":"02","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.","place":"Dagstuhl, Germany","intvolume":"       189","has_accepted_license":"1","date_published":"2021-06-02T00:00:00Z","doi":"10.4230/LIPIcs.SoCG.2021.17","file_date_updated":"2021-06-02T10:22:33Z","ec_funded":1,"article_processing_charge":"No","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"oa":1,"date_created":"2021-06-02T10:10:55Z","citation":{"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>.","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>","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>.","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.","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.","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.","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>"},"conference":{"name":"SoCG: Symposium on Computational Geometry","start_date":"2021-06-07","location":"Virtual","end_date":"2021-06-11"},"quality_controlled":"1","page":"17:1-17:16","title":"Tracing isomanifolds in Rd in time polynomial in d using Coxeter-Freudenthal-Kuhn triangulations","date_updated":"2023-10-10T07:34:34Z","series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","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. "}],"related_material":{"record":[{"id":"12960","status":"public","relation":"later_version"}]},"license":"https://creativecommons.org/licenses/by/4.0/","author":[{"first_name":"Jean-Daniel","last_name":"Boissonnat","full_name":"Boissonnat, Jean-Daniel"},{"first_name":"Siargey","full_name":"Kachanovich, Siargey","last_name":"Kachanovich"},{"orcid":"0000-0002-7472-2220","full_name":"Wintraecken, Mathijs","last_name":"Wintraecken","first_name":"Mathijs","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87"}],"status":"public","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","oa_version":"Published Version","ddc":["005","516","514"],"type":"conference","file":[{"access_level":"open_access","content_type":"application/pdf","date_updated":"2021-06-02T10:22:33Z","checksum":"c322aa48d5d35a35877896cc565705b6","file_size":1972902,"success":1,"date_created":"2021-06-02T10:22:33Z","file_name":"LIPIcs-SoCG-2021-17.pdf","file_id":"9442","creator":"mwintrae","relation":"main_file"}],"_id":"9441","publication_status":"published","alternative_title":["LIPIcs"],"publication_identifier":{"isbn":["978-3-95977-184-9"],"issn":["1868-8969"]},"year":"2021","month":"06","project":[{"grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships"}],"department":[{"_id":"HeEd"}]},{"project":[{"grant_number":"742985","name":"Tracing Evolution of Auxin Transport and Polarity in Plants","call_identifier":"H2020","_id":"261099A6-B435-11E9-9278-68D0E5697425"}],"month":"07","year":"2021","publication_identifier":{"eissn":["1532-298x"],"issn":["1040-4651"]},"isi":1,"article_type":"original","department":[{"_id":"JiFr"}],"publisher":"American Society of Plant Biologists","external_id":{"pmid":["33944955"],"isi":["000703938100026"]},"publication_status":"published","issue":"7","_id":"9443","oa_version":"Published Version","type":"journal_article","file":[{"relation":"main_file","creator":"cchlebak","file_id":"10141","file_name":"2021_PlantCell_RuizLopez.pdf","date_created":"2021-10-14T13:36:38Z","checksum":"22d596678d00310d793611864a6d0fcd","file_size":2952028,"success":1,"date_updated":"2021-10-14T13:36:38Z","content_type":"application/pdf","access_level":"open_access"}],"ddc":["580"],"status":"public","author":[{"full_name":"Ruiz-Lopez, N","last_name":"Ruiz-Lopez","first_name":"N"},{"first_name":"J","last_name":"Pérez-Sancho","full_name":"Pérez-Sancho, J"},{"first_name":"A","last_name":"Esteban Del Valle","full_name":"Esteban Del Valle, A"},{"first_name":"RP","full_name":"Haslam, RP","last_name":"Haslam"},{"first_name":"S","full_name":"Vanneste, S","last_name":"Vanneste"},{"last_name":"Catalá","full_name":"Catalá, R","first_name":"R"},{"first_name":"C","full_name":"Perea-Resa, C","last_name":"Perea-Resa"},{"first_name":"D","last_name":"Van Damme","full_name":"Van Damme, D"},{"first_name":"S","full_name":"García-Hernández, S","last_name":"García-Hernández"},{"first_name":"A","full_name":"Albert, A","last_name":"Albert"},{"last_name":"Vallarino","full_name":"Vallarino, J","first_name":"J"},{"first_name":"J","last_name":"Lin","full_name":"Lin, J"},{"full_name":"Friml, Jiří","last_name":"Friml","orcid":"0000-0002-8302-7596","first_name":"Jiří","id":"4159519E-F248-11E8-B48F-1D18A9856A87"},{"first_name":"AP","last_name":"Macho","full_name":"Macho, AP"},{"full_name":"Salinas, J","last_name":"Salinas","first_name":"J"},{"last_name":"Rosado","full_name":"Rosado, A","first_name":"A"},{"full_name":"Napier, JA","last_name":"Napier","first_name":"JA"},{"first_name":"V","last_name":"Amorim-Silva","full_name":"Amorim-Silva, V"},{"first_name":"MA","full_name":"Botella, MA","last_name":"Botella"}],"language":[{"iso":"eng"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","date_updated":"2023-08-08T13:54:32Z","scopus_import":"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"}],"page":"2431-2453","title":"Synaptotagmins at the endoplasmic reticulum-plasma membrane contact sites maintain diacylglycerol homeostasis during abiotic stress","oa":1,"quality_controlled":"1","citation":{"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>.","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>","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>.","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.","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.","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>"},"date_created":"2021-06-02T13:13:58Z","file_date_updated":"2021-10-14T13:36:38Z","doi":"10.1093/plcell/koab122","tmp":{"image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)"},"article_processing_charge":"No","ec_funded":1,"pmid":1,"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","publication":"Plant Cell","day":"01","volume":33,"date_published":"2021-07-01T00:00:00Z","has_accepted_license":"1","intvolume":"        33"},{"keyword":["Renewable Energy","Sustainability and the Environment","Electrochemistry","Materials Chemistry","Electronic","Optical and Magnetic Materials","Surfaces","Coatings and Films","Condensed Matter Physics"],"abstract":[{"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.","lang":"eng"}],"language":[{"iso":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_updated":"2023-09-05T13:25:30Z","status":"public","author":[{"first_name":"Marion","last_name":"Maffre","full_name":"Maffre, Marion"},{"full_name":"Bouchal, Roza","last_name":"Bouchal","first_name":"Roza"},{"last_name":"Freunberger","full_name":"Freunberger, Stefan Alexander","orcid":"0000-0003-2902-5319","id":"A8CA28E6-CE23-11E9-AD2D-EC27E6697425","first_name":"Stefan Alexander"},{"full_name":"Lindahl, Niklas","last_name":"Lindahl","first_name":"Niklas"},{"first_name":"Patrik","full_name":"Johansson, Patrik","last_name":"Johansson"},{"first_name":"Frédéric","full_name":"Favier, Frédéric","last_name":"Favier"},{"full_name":"Fontaine, Olivier","last_name":"Fontaine","first_name":"Olivier"},{"full_name":"Bélanger, Daniel","last_name":"Bélanger","first_name":"Daniel"}],"external_id":{"isi":["000657724200001"]},"publication_status":"published","_id":"9447","issue":"5","oa_version":"None","type":"journal_article","publisher":"IOP Publishing","department":[{"_id":"StFr"}],"year":"2021","month":"05","publication_identifier":{"issn":["0013-4651"],"eissn":["1945-7111"]},"isi":1,"date_published":"2021-05-01T00:00:00Z","intvolume":"       168","publication":"Journal of The Electrochemical Society","day":"01","volume":168,"article_processing_charge":"No","doi":"10.1149/1945-7111/ac0300","quality_controlled":"1","date_created":"2021-06-03T09:58:38Z","citation":{"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).","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.","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.","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>","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>.","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>.","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>"},"article_number":"050550","title":"Investigation of electrochemical and chemical processes occurring at positive potentials in “Water-in-Salt” electrolytes"},{"author":[{"first_name":"Andreas","full_name":"Deuchert, Andreas","last_name":"Deuchert"},{"full_name":"Seiringer, Robert","last_name":"Seiringer","orcid":"0000-0002-6781-0521","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","first_name":"Robert"}],"status":"public","abstract":[{"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.","lang":"eng"}],"main_file_link":[{"url":"https://arxiv.org/abs/2009.00992","open_access":"1"}],"scopus_import":"1","date_updated":"2023-08-08T13:56:27Z","language":[{"iso":"eng"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","department":[{"_id":"RoSe"}],"article_type":"original","isi":1,"publication_identifier":{"eissn":["1096-0783"],"issn":["0022-1236"]},"year":"2021","month":"09","project":[{"grant_number":"694227","name":"Analysis of quantum many-body systems","call_identifier":"H2020","_id":"25C6DC12-B435-11E9-9278-68D0E5697425"}],"type":"journal_article","oa_version":"Preprint","issue":"6","_id":"9462","external_id":{"isi":["000656508600008"],"arxiv":["2009.00992"]},"publication_status":"published","publisher":"Elsevier","ec_funded":1,"article_processing_charge":"No","doi":"10.1016/j.jfa.2021.109096","intvolume":"       281","date_published":"2021-09-15T00:00:00Z","volume":281,"day":"15","publication":"Journal of Functional Analysis","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.","title":"Semiclassical approximation and critical temperature shift for weakly interacting trapped bosons","citation":{"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>","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>.","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>.","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>","ista":"Deuchert A, Seiringer R. 2021. Semiclassical approximation and critical temperature shift for weakly interacting trapped bosons. Journal of Functional Analysis. 281(6), 109096.","short":"A. Deuchert, R. Seiringer, Journal of Functional Analysis 281 (2021).","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."},"date_created":"2021-06-06T22:01:28Z","arxiv":1,"quality_controlled":"1","article_number":"109096","oa":1},{"date_updated":"2023-10-03T12:51:59Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"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."}],"scopus_import":"1","author":[{"full_name":"Gao, Fei","last_name":"Gao","first_name":"Fei"},{"full_name":"Zhang, Jie Yin","last_name":"Zhang","first_name":"Jie Yin"},{"last_name":"Wang","full_name":"Wang, Jian Huan","first_name":"Jian Huan"},{"full_name":"Ming, Ming","last_name":"Ming","first_name":"Ming"},{"first_name":"Tina","last_name":"Wang","full_name":"Wang, Tina"},{"full_name":"Zhang, Jian Jun","last_name":"Zhang","first_name":"Jian Jun"},{"full_name":"Watzinger, Hannes","last_name":"Watzinger","id":"35DF8E50-F248-11E8-B48F-1D18A9856A87","first_name":"Hannes"},{"first_name":"Josip","id":"3F5D8856-F248-11E8-B48F-1D18A9856A87","full_name":"Kukucka, Josip","last_name":"Kukucka"},{"first_name":"Lada","id":"31E9F056-F248-11E8-B48F-1D18A9856A87","last_name":"Vukušić","full_name":"Vukušić, Lada","orcid":"0000-0003-2424-8636"},{"first_name":"Georgios","id":"38DB5788-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8342-202X","full_name":"Katsaros, Georgios","last_name":"Katsaros"},{"first_name":"Ke","last_name":"Wang","full_name":"Wang, Ke"},{"full_name":"Xu, Gang","last_name":"Xu","first_name":"Gang"},{"first_name":"Hai Ou","last_name":"Li","full_name":"Li, Hai Ou"},{"full_name":"Guo, Guo Ping","last_name":"Guo","first_name":"Guo Ping"}],"status":"public","publisher":"IEEE","type":"conference","oa_version":"None","_id":"9464","external_id":{"isi":["000675595800006"]},"publication_status":"published","isi":1,"publication_identifier":{"isbn":["9781728181769"]},"month":"04","year":"2021","project":[{"_id":"25517E86-B435-11E9-9278-68D0E5697425","name":"Towards Spin qubits and Majorana fermions in Germanium selfassembled hut-wires","call_identifier":"FP7","grant_number":"335497"}],"department":[{"_id":"GeKa"}],"publication":"2021 5th IEEE Electron Devices Technology and Manufacturing Conference, EDTM 2021","acknowledgement":"This work was supported by the National Key R&D Program of China (Grant No. 2016YFA0301700) and the ERC Starting Grant no. 335497.","day":"08","date_published":"2021-04-08T00:00:00Z","doi":"10.1109/EDTM50988.2021.9420817","ec_funded":1,"article_processing_charge":"No","article_number":"9420817","citation":{"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>","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>.","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>.","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>","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.","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.","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."},"date_created":"2021-06-06T22:01:29Z","conference":{"location":"Virtual, Online","end_date":"2021-04-11","start_date":"2021-04-08","name":"EDTM: IEEE Electron Devices Technology and Manufacturing Conference"},"quality_controlled":"1","title":"Ge/Si quantum wires for quantum computing"},{"date_published":"2021-04-01T00:00:00Z","intvolume":"       112","has_accepted_license":"1","day":"01","publication":"Journal of Geometry","volume":112,"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"article_processing_charge":"Yes (via OA deal)","file_date_updated":"2021-06-11T13:16:26Z","doi":"10.1007/s00022-021-00577-4","quality_controlled":"1","citation":{"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.","ista":"Edelsbrunner H, Nikitenko A, Osang GF. 2021. A step in the Delaunay mosaic of order k. Journal of Geometry. 112(1), 15.","short":"H. Edelsbrunner, A. Nikitenko, G.F. Osang, Journal of Geometry 112 (2021).","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>","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>.","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>.","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>"},"date_created":"2021-06-06T22:01:29Z","oa":1,"article_number":"15","title":"A step in the Delaunay mosaic of order k","scopus_import":"1","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"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"date_updated":"2022-05-12T11:41:45Z","status":"public","author":[{"first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833"},{"first_name":"Anton","id":"3E4FF1BA-F248-11E8-B48F-1D18A9856A87","last_name":"Nikitenko","full_name":"Nikitenko, Anton"},{"first_name":"Georg F","id":"464B40D6-F248-11E8-B48F-1D18A9856A87","full_name":"Osang, Georg F","last_name":"Osang"}],"publication_status":"published","issue":"1","_id":"9465","file":[{"date_created":"2021-06-11T13:16:26Z","file_size":694706,"checksum":"e52a832f1def52a2b23d21bcc09e646f","success":1,"date_updated":"2021-06-11T13:16:26Z","access_level":"open_access","content_type":"application/pdf","relation":"main_file","file_id":"9544","creator":"kschuh","file_name":"2021_Geometry_Edelsbrunner.pdf"}],"type":"journal_article","oa_version":"Published Version","ddc":["510"],"publisher":"Springer Nature","article_type":"original","department":[{"_id":"HeEd"}],"year":"2021","month":"04","publication_identifier":{"eissn":["14208997"],"issn":["00472468"]}},{"publisher":"Springer Nature","type":"conference","file":[{"file_name":"2021_PKC_Walter.pdf","relation":"main_file","file_id":"11416","creator":"dernst","date_updated":"2022-05-27T09:48:31Z","access_level":"open_access","content_type":"application/pdf","date_created":"2022-05-27T09:48:31Z","success":1,"checksum":"413e564d645ed93d7318672361d9d470","file_size":489017}],"oa_version":"Published Version","ddc":["000"],"alternative_title":["LNCS"],"publication_status":"published","_id":"9466","publication_identifier":{"isbn":["9783030752446"],"issn":["03029743"],"eissn":["16113349"]},"project":[{"grant_number":"682815","call_identifier":"H2020","name":"Teaching Old Crypto New Tricks","_id":"258AA5B2-B435-11E9-9278-68D0E5697425"}],"year":"2021","month":"05","department":[{"_id":"KrPi"}],"date_updated":"2023-02-23T13:58:47Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"abstract":[{"text":"In this work, we apply the dynamical systems analysis of Hanrot et al. (CRYPTO’11) to a class of lattice block reduction algorithms that includes (natural variants of) slide reduction and block-Rankin reduction. This implies sharper bounds on the polynomial running times (in the query model) for these algorithms and opens the door to faster practical variants of slide reduction. We give heuristic arguments showing that such variants can indeed speed up slide reduction significantly in practice. This is confirmed by experimental evidence, which also shows that our variants are competitive with state-of-the-art reduction algorithms.","lang":"eng"}],"scopus_import":"1","status":"public","author":[{"orcid":"0000-0003-3186-2482","full_name":"Walter, Michael","last_name":"Walter","first_name":"Michael","id":"488F98B0-F248-11E8-B48F-1D18A9856A87"}],"oa":1,"citation":{"ista":"Walter M. 2021. The convergence of slide-type reductions. Public-Key Cryptography – PKC 2021. PKC: IACR International Conference on Practice and Theory of Public Key Cryptography, LNCS, vol. 12710, 45–67.","ieee":"M. Walter, “The convergence of slide-type reductions,” in <i>Public-Key Cryptography – PKC 2021</i>, Virtual, 2021, vol. 12710, pp. 45–67.","short":"M. Walter, in:, Public-Key Cryptography – PKC 2021, Springer Nature, 2021, pp. 45–67.","ama":"Walter M. The convergence of slide-type reductions. In: <i>Public-Key Cryptography – PKC 2021</i>. Vol 12710. Springer Nature; 2021:45-67. doi:<a href=\"https://doi.org/10.1007/978-3-030-75245-3_3\">10.1007/978-3-030-75245-3_3</a>","mla":"Walter, Michael. “The Convergence of Slide-Type Reductions.” <i>Public-Key Cryptography – PKC 2021</i>, vol. 12710, Springer Nature, 2021, pp. 45–67, doi:<a href=\"https://doi.org/10.1007/978-3-030-75245-3_3\">10.1007/978-3-030-75245-3_3</a>.","chicago":"Walter, Michael. “The Convergence of Slide-Type Reductions.” In <i>Public-Key Cryptography – PKC 2021</i>, 12710:45–67. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/978-3-030-75245-3_3\">https://doi.org/10.1007/978-3-030-75245-3_3</a>.","apa":"Walter, M. (2021). The convergence of slide-type reductions. In <i>Public-Key Cryptography – PKC 2021</i> (Vol. 12710, pp. 45–67). Virtual: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-75245-3_3\">https://doi.org/10.1007/978-3-030-75245-3_3</a>"},"date_created":"2021-06-06T22:01:29Z","quality_controlled":"1","conference":{"location":"Virtual","end_date":"2021-05-13","name":"PKC: IACR International Conference on Practice and Theory of Public Key Cryptography","start_date":"2021-05-10"},"page":"45-67","title":"The convergence of slide-type reductions","day":"01","acknowledgement":"This work was initiated in discussions with Léo Ducas, when the author was visiting the Simons Institute for the Theory of Computation during the program “Lattices: Algorithms, Complexity, and Cryptography”. We thank Thomas Espitau for pointing out a bug in a proof in an earlier version of this manuscript.","publication":"Public-Key Cryptography – PKC 2021","volume":12710,"has_accepted_license":"1","intvolume":"     12710","date_published":"2021-05-01T00:00:00Z","doi":"10.1007/978-3-030-75245-3_3","file_date_updated":"2022-05-27T09:48:31Z","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"ec_funded":1,"article_processing_charge":"No"},{"date_updated":"2023-08-08T13:58:41Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","language":[{"iso":"eng"}],"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."}],"scopus_import":"1","status":"public","author":[{"last_name":"Marensi","full_name":"Marensi, Elena","first_name":"Elena","id":"0BE7553A-1004-11EA-B805-18983DDC885E"},{"last_name":"He","full_name":"He, Shuisheng","first_name":"Shuisheng"},{"first_name":"Ashley P.","last_name":"Willis","full_name":"Willis, Ashley P."}],"publisher":"Cambridge University Press","type":"journal_article","oa_version":"Published Version","ddc":["530"],"file":[{"creator":"kschuh","file_id":"9766","relation":"main_file","file_name":"2021_JournalFluidMechanics_Marensi.pdf","success":1,"checksum":"867ad077e45c181c2c5ec1311ba27c41","file_size":4087358,"date_created":"2021-08-03T09:53:28Z","content_type":"application/pdf","access_level":"open_access","date_updated":"2021-08-03T09:53:28Z"}],"publication_status":"published","external_id":{"isi":["000653785000001"],"arxiv":["2008.13486"]},"_id":"9467","publication_identifier":{"issn":["00221120"],"eissn":["14697645"]},"isi":1,"month":"07","year":"2021","department":[{"_id":"BjHo"}],"article_type":"original","day":"25","acknowledgement":"The anonymous referees are kindly acknowledged for their useful suggestions andcomments.","publication":"Journal of Fluid Mechanics","volume":919,"has_accepted_license":"1","intvolume":"       919","date_published":"2021-07-25T00:00:00Z","doi":"10.1017/jfm.2021.371","file_date_updated":"2021-08-03T09:53:28Z","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"article_processing_charge":"Yes (via OA deal)","oa":1,"article_number":"A17","citation":{"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>","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.","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>","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>.","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>."},"date_created":"2021-06-06T22:01:30Z","arxiv":1,"quality_controlled":"1","title":"Suppression of turbulence and travelling waves in a vertical heated pipe"},{"issue":"2","_id":"9468","external_id":{"isi":["000674142200022"],"arxiv":["2001.06053"]},"publication_status":"published","oa_version":"Preprint","type":"journal_article","publisher":"Society for Industrial and Applied Mathematics","article_type":"original","department":[{"_id":"UlWa"}],"year":"2021","month":"05","project":[{"grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"isi":1,"publication_identifier":{"issn":["08954801"]},"scopus_import":"1","abstract":[{"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","lang":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2001.06053"}],"language":[{"iso":"eng"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","date_updated":"2023-08-08T13:58:12Z","author":[{"first_name":"Alan M","id":"3207FDC6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2401-8670","last_name":"Arroyo Guevara","full_name":"Arroyo Guevara, Alan M"},{"full_name":"Richter, R. Bruce","last_name":"Richter","first_name":"R. Bruce"},{"last_name":"Sunohara","full_name":"Sunohara, Matthew","first_name":"Matthew"}],"status":"public","quality_controlled":"1","arxiv":1,"date_created":"2021-06-06T22:01:30Z","citation":{"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>","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.","short":"A.M. Arroyo Guevara, R.B. Richter, M. Sunohara, SIAM Journal on Discrete Mathematics 35 (2021) 1050–1076.","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>","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>.","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>."},"oa":1,"title":"Extending drawings of complete graphs into arrangements of pseudocircles","page":"1050-1076","date_published":"2021-05-20T00:00:00Z","intvolume":"        35","volume":35,"day":"20","publication":"SIAM Journal on Discrete Mathematics","article_processing_charge":"No","ec_funded":1,"doi":"10.1137/20M1313234"},{"ec_funded":1,"article_processing_charge":"No","doi":"10.1080/10556788.2021.1924715","date_published":"2021-05-12T00:00:00Z","acknowledgement":"The authors are grateful to the anonymous referees and the handling Editor for their insightful comments which have improved the earlier version of the manuscript greatly. The second author is grateful to the University of Hafr Al Batin. The last author has received funding from the European Research Council (ERC) under the European Union's Seventh Framework Program (FP7-2007-2013) (Grant agreement No. 616160).","publication":"Optimization Methods and Software","day":"12","title":"Reflected three-operator splitting method for monotone inclusion problem","date_created":"2021-06-06T22:01:30Z","citation":{"ieee":"O. S. Iyiola, C. D. Enyi, and Y. Shehu, “Reflected three-operator splitting method for monotone inclusion problem,” <i>Optimization Methods and Software</i>. Taylor and Francis, 2021.","short":"O.S. Iyiola, C.D. Enyi, Y. Shehu, Optimization Methods and Software (2021).","ista":"Iyiola OS, Enyi CD, Shehu Y. 2021. Reflected three-operator splitting method for monotone inclusion problem. Optimization Methods and Software.","ama":"Iyiola OS, Enyi CD, Shehu Y. Reflected three-operator splitting method for monotone inclusion problem. <i>Optimization Methods and Software</i>. 2021. doi:<a href=\"https://doi.org/10.1080/10556788.2021.1924715\">10.1080/10556788.2021.1924715</a>","chicago":"Iyiola, Olaniyi S., Cyril D. Enyi, and Yekini Shehu. “Reflected Three-Operator Splitting Method for Monotone Inclusion Problem.” <i>Optimization Methods and Software</i>. Taylor and Francis, 2021. <a href=\"https://doi.org/10.1080/10556788.2021.1924715\">https://doi.org/10.1080/10556788.2021.1924715</a>.","apa":"Iyiola, O. S., Enyi, C. D., &#38; Shehu, Y. (2021). Reflected three-operator splitting method for monotone inclusion problem. <i>Optimization Methods and Software</i>. Taylor and Francis. <a href=\"https://doi.org/10.1080/10556788.2021.1924715\">https://doi.org/10.1080/10556788.2021.1924715</a>","mla":"Iyiola, Olaniyi S., et al. “Reflected Three-Operator Splitting Method for Monotone Inclusion Problem.” <i>Optimization Methods and Software</i>, Taylor and Francis, 2021, doi:<a href=\"https://doi.org/10.1080/10556788.2021.1924715\">10.1080/10556788.2021.1924715</a>."},"quality_controlled":"1","author":[{"first_name":"Olaniyi S.","full_name":"Iyiola, Olaniyi S.","last_name":"Iyiola"},{"last_name":"Enyi","full_name":"Enyi, Cyril D.","first_name":"Cyril D."},{"first_name":"Yekini","id":"3FC7CB58-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9224-7139","full_name":"Shehu, Yekini","last_name":"Shehu"}],"status":"public","abstract":[{"lang":"eng","text":"In this paper, we consider reflected three-operator splitting methods for monotone inclusion problems in real Hilbert spaces. To do this, we first obtain weak convergence analysis and nonasymptotic O(1/n) convergence rate of the reflected Krasnosel'skiĭ-Mann iteration for finding a fixed point of nonexpansive mapping in real Hilbert spaces under some seemingly easy to implement conditions on the iterative parameters. We then apply our results to three-operator splitting for the monotone inclusion problem and consequently obtain the corresponding convergence analysis. Furthermore, we derive reflected primal-dual algorithms for highly structured monotone inclusion problems. Some numerical implementations are drawn from splitting methods to support the theoretical analysis."}],"scopus_import":"1","date_updated":"2023-08-08T13:57:43Z","language":[{"iso":"eng"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","department":[{"_id":"VlKo"}],"article_type":"original","isi":1,"publication_identifier":{"issn":["1055-6788"],"eissn":["1029-4937"]},"year":"2021","month":"05","project":[{"name":"Discrete Optimization in Computer Vision: Theory and Practice","call_identifier":"FP7","_id":"25FBA906-B435-11E9-9278-68D0E5697425","grant_number":"616160"}],"oa_version":"None","type":"journal_article","_id":"9469","external_id":{"isi":["000650507600001"]},"publication_status":"published","publisher":"Taylor and Francis"},{"tmp":{"name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","image":"/images/cc_by_nc.png","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","short":"CC BY-NC (4.0)"},"ec_funded":1,"article_processing_charge":"No","file_date_updated":"2021-06-11T15:34:53Z","doi":"10.1111/mec.15936","date_published":"2021-06-01T00:00:00Z","intvolume":"        30","has_accepted_license":"1","day":"01","publication":"Molecular Ecology","acknowledgement":"We thank the editor, two helpful reviewers, Roger Butlin, Kerstin Johannesson, Valentina Peona, Rike Stelkens, Julie Blommaert, Nick Barton, and João Alpedrinha for helpful comments that improved the manuscript. The authors acknowledge funding from the Swedish Research Council Formas (2017-01597 to AS), the Swedish Research Council Vetenskapsrådet (2016-05139 to AS, 2019-04452 to TS) and from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement no. 757451 to TS). ELB was funded by a Carl Tryggers grant awarded to Tanja Slotte. Anja M. Westram was funded by the European Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie grant agreement No 797747. Inês Fragata was funded by a Junior Researcher contract from FCT (CEECIND/02616/2018).","volume":30,"title":"Unboxing mutations: Connecting mutation types with evolutionary consequences","page":"2710-2723","quality_controlled":"1","date_created":"2021-06-06T22:01:31Z","citation":{"short":"E.L. Berdan, A. Blanckaert, T. Slotte, A. Suh, A.M. Westram, I. Fragata, Molecular Ecology 30 (2021) 2710–2723.","ieee":"E. L. Berdan, A. Blanckaert, T. Slotte, A. Suh, A. M. Westram, and I. Fragata, “Unboxing mutations: Connecting mutation types with evolutionary consequences,” <i>Molecular Ecology</i>, vol. 30, no. 12. Wiley, pp. 2710–2723, 2021.","ista":"Berdan EL, Blanckaert A, Slotte T, Suh A, Westram AM, Fragata I. 2021. Unboxing mutations: Connecting mutation types with evolutionary consequences. Molecular Ecology. 30(12), 2710–2723.","ama":"Berdan EL, Blanckaert A, Slotte T, Suh A, Westram AM, Fragata I. Unboxing mutations: Connecting mutation types with evolutionary consequences. <i>Molecular Ecology</i>. 2021;30(12):2710-2723. doi:<a href=\"https://doi.org/10.1111/mec.15936\">10.1111/mec.15936</a>","chicago":"Berdan, Emma L., Alexandre Blanckaert, Tanja Slotte, Alexander Suh, Anja M Westram, and Inês Fragata. “Unboxing Mutations: Connecting Mutation Types with Evolutionary Consequences.” <i>Molecular Ecology</i>. Wiley, 2021. <a href=\"https://doi.org/10.1111/mec.15936\">https://doi.org/10.1111/mec.15936</a>.","apa":"Berdan, E. L., Blanckaert, A., Slotte, T., Suh, A., Westram, A. M., &#38; Fragata, I. (2021). Unboxing mutations: Connecting mutation types with evolutionary consequences. <i>Molecular Ecology</i>. Wiley. <a href=\"https://doi.org/10.1111/mec.15936\">https://doi.org/10.1111/mec.15936</a>","mla":"Berdan, Emma L., et al. “Unboxing Mutations: Connecting Mutation Types with Evolutionary Consequences.” <i>Molecular Ecology</i>, vol. 30, no. 12, Wiley, 2021, pp. 2710–23, doi:<a href=\"https://doi.org/10.1111/mec.15936\">10.1111/mec.15936</a>."},"oa":1,"status":"public","author":[{"first_name":"Emma L.","last_name":"Berdan","full_name":"Berdan, Emma L."},{"first_name":"Alexandre","last_name":"Blanckaert","full_name":"Blanckaert, Alexandre"},{"full_name":"Slotte, Tanja","last_name":"Slotte","first_name":"Tanja"},{"full_name":"Suh, Alexander","last_name":"Suh","first_name":"Alexander"},{"orcid":"0000-0003-1050-4969","full_name":"Westram, Anja M","last_name":"Westram","first_name":"Anja M","id":"3C147470-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Inês","last_name":"Fragata","full_name":"Fragata, Inês"}],"license":"https://creativecommons.org/licenses/by-nc/4.0/","scopus_import":"1","abstract":[{"text":"A key step in understanding the genetic basis of different evolutionary outcomes (e.g., adaptation) is to determine the roles played by different mutation types (e.g., SNPs, translocations and inversions). To do this we must simultaneously consider different mutation types in an evolutionary framework. Here, we propose a research framework that directly utilizes the most important characteristics of mutations, their population genetic effects, to determine their relative evolutionary significance in a given scenario. We review known population genetic effects of different mutation types and show how these may be connected to different evolutionary outcomes. We provide examples of how to implement this framework and pinpoint areas where more data, theory and synthesis are needed. Linking experimental and theoretical approaches to examine different mutation types simultaneously is a critical step towards understanding their evolutionary significance.","lang":"eng"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","language":[{"iso":"eng"}],"date_updated":"2023-08-08T13:59:18Z","department":[{"_id":"NiBa"}],"project":[{"grant_number":"797747","name":"Theoretical and empirical approaches to understanding Parallel Adaptation","call_identifier":"H2020","_id":"265B41B8-B435-11E9-9278-68D0E5697425"}],"year":"2021","month":"06","publication_identifier":{"eissn":["1365294X"],"issn":["09621083"]},"isi":1,"publication_status":"published","external_id":{"isi":["000652056400001"]},"_id":"9470","issue":"12","type":"journal_article","file":[{"file_size":1031978,"checksum":"e6f4731365bde2614b333040a08265d8","success":1,"date_created":"2021-06-11T15:34:53Z","access_level":"open_access","content_type":"application/pdf","date_updated":"2021-06-11T15:34:53Z","file_id":"9545","creator":"kschuh","relation":"main_file","file_name":"2021_MolecularEcology_Berdan.pdf"}],"ddc":["570"],"oa_version":"Published Version","publisher":"Wiley"},{"article_number":"16","oa":1,"citation":{"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.","short":"A. Czumaj, P. Davies, M. Parter, ACM Transactions on Algorithms 17 (2021).","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.","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>","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>.","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>.","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>"},"date_created":"2021-06-10T19:31:05Z","arxiv":1,"quality_controlled":"1","title":"Graph sparsification for derandomizing massively parallel computation with low space","volume":17,"day":"01","publication":"ACM Transactions on Algorithms","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.","has_accepted_license":"1","intvolume":"        17","date_published":"2021-06-01T00:00:00Z","doi":"10.1145/3451992","file_date_updated":"2021-06-10T19:33:56Z","article_processing_charge":"No","ec_funded":1,"publisher":"Association for Computing Machinery","file":[{"file_name":"MISMM-arxiv.pdf","relation":"main_file","file_id":"9542","creator":"pdavies","date_updated":"2021-06-10T19:33:56Z","access_level":"open_access","content_type":"application/pdf","date_created":"2021-06-10T19:33:56Z","success":1,"file_size":587404,"checksum":"a21c627683890c309a68f6389302c408"}],"ddc":["000"],"type":"journal_article","oa_version":"Submitted Version","_id":"9541","issue":"2","publication_status":"published","external_id":{"arxiv":["1912.05390"],"isi":["000661311300006"]},"isi":1,"publication_identifier":{"eissn":["1549-6333"],"issn":["1549-6325"]},"month":"06","year":"2021","project":[{"grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"department":[{"_id":"DaAl"}],"article_type":"original","date_updated":"2024-02-28T12:53:09Z","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"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].","lang":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1912.05390"}],"related_material":{"record":[{"id":"7802","relation":"earlier_version","status":"public"}]},"author":[{"last_name":"Czumaj","full_name":"Czumaj, Artur","first_name":"Artur"},{"orcid":"0000-0002-5646-9524","full_name":"Davies, Peter","last_name":"Davies","id":"11396234-BB50-11E9-B24C-90FCE5697425","first_name":"Peter"},{"last_name":"Parter","full_name":"Parter, Merav","first_name":"Merav"}],"status":"public"},{"project":[{"grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"year":"2021","month":"05","department":[{"_id":"DaAl"}],"title":"New bounds for distributed mean estimation and variance reduction","oa":1,"oa_version":"Published Version","type":"conference","citation":{"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.","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.","short":"P. Davies, V. Gurunanthan, N. Moshrefi, S. Ashkboos, D.-A. Alistarh, in:, 9th International Conference on Learning Representations, 2021.","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.","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.","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.","mla":"Davies, Peter, et al. “New Bounds for Distributed Mean Estimation and Variance Reduction.” <i>9th International Conference on Learning Representations</i>, 2021."},"date_created":"2021-06-10T19:46:08Z","arxiv":1,"external_id":{"arxiv":["2002.09268"]},"quality_controlled":"1","publication_status":"published","conference":{"location":"Virtual","end_date":"2021-05-07","name":" ICLR: International Conference on Learning Representations","start_date":"2021-05-03"},"_id":"9543","status":"public","ec_funded":1,"article_processing_charge":"No","author":[{"last_name":"Davies","full_name":"Davies, Peter","orcid":"0000-0002-5646-9524","id":"11396234-BB50-11E9-B24C-90FCE5697425","first_name":"Peter"},{"first_name":"Vijaykrishna","last_name":"Gurunanthan","full_name":"Gurunanthan, Vijaykrishna"},{"id":"4db776ff-ce15-11eb-96e3-bc2b90b01c16","first_name":"Niusha ","last_name":"Moshrefi","full_name":"Moshrefi, Niusha "},{"first_name":"Saleh","id":"0D0A9058-257B-11EA-A937-9341C3D8BC8A","full_name":"Ashkboos, Saleh","last_name":"Ashkboos"},{"full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian"}],"publication":"9th International Conference on Learning Representations","day":"01","date_updated":"2023-02-23T14:00:40Z","language":[{"iso":"eng"}],"user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425","main_file_link":[{"url":"https://openreview.net/pdf?id=t86MwoUCCNe","open_access":"1"}],"abstract":[{"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.","lang":"eng"}],"date_published":"2021-05-01T00:00:00Z"},{"scopus_import":"1","abstract":[{"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.","lang":"eng"}],"language":[{"iso":"eng"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","date_updated":"2023-08-14T08:01:50Z","status":"public","author":[{"full_name":"Rittig, Tobias","last_name":"Rittig","first_name":"Tobias"},{"first_name":"Denis","last_name":"Sumin","full_name":"Sumin, Denis"},{"last_name":"Babaei","full_name":"Babaei, Vahid","first_name":"Vahid"},{"first_name":"Piotr","full_name":"Didyk, Piotr","last_name":"Didyk"},{"first_name":"Alexey","full_name":"Voloboy, Alexey","last_name":"Voloboy"},{"full_name":"Wilkie, Alexander","last_name":"Wilkie","first_name":"Alexander"},{"first_name":"Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385","full_name":"Bickel, Bernd","last_name":"Bickel"},{"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"}],"external_id":{"isi":["000657959600017"]},"publication_status":"published","issue":"2","_id":"9547","oa_version":"Submitted Version","ddc":["004"],"file":[{"file_size":26026501,"success":1,"checksum":"33271724215f54a75c39d2ed40f2c502","date_created":"2021-10-11T12:06:50Z","access_level":"open_access","content_type":"application/pdf","date_updated":"2021-10-11T12:06:50Z","file_id":"10120","creator":"bbickel","relation":"main_file","file_name":"ScatteringAwareColor3DPrinting_authorVersion.pdf"}],"type":"journal_article","publisher":"Wiley","article_type":"original","department":[{"_id":"BeBi"}],"project":[{"_id":"2508E324-B435-11E9-9278-68D0E5697425","name":"Distributed 3D Object Design","call_identifier":"H2020","grant_number":"642841"},{"grant_number":"715767","_id":"24F9549A-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling"}],"month":"05","year":"2021","publication_identifier":{"issn":["0167-7055"],"eissn":["1467-8659"]},"isi":1,"date_published":"2021-05-01T00:00:00Z","intvolume":"        40","has_accepted_license":"1","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).","day":"01","publication":"Computer Graphics Forum","volume":40,"article_processing_charge":"No","ec_funded":1,"file_date_updated":"2021-10-11T12:06:50Z","doi":"10.1111/cgf.142626","quality_controlled":"1","date_created":"2021-06-13T22:01:32Z","citation":{"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>","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.","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.","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.","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>.","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>","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>."},"oa":1,"title":"Neural acceleration of scattering-aware color 3D printing","page":"205-219"},{"article_processing_charge":"No","doi":"10.1007/s12220-021-00691-4","date_published":"2021-05-31T00:00:00Z","intvolume":"        31","day":"31","acknowledgement":"The authors acknowledge the support of the grant of the Russian Government N 075-15-2019-1926.","publication":"Journal of Geometric Analysis","volume":31,"title":"Functional Löwner ellipsoids","page":"11493-11528","quality_controlled":"1","arxiv":1,"date_created":"2021-06-13T22:01:32Z","citation":{"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>.","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>.","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>","ieee":"G. Ivanov and I. Tsiutsiurupa, “Functional Löwner ellipsoids,” <i>Journal of Geometric Analysis</i>, vol. 31. Springer, pp. 11493–11528, 2021.","ista":"Ivanov G, Tsiutsiurupa I. 2021. Functional Löwner ellipsoids. Journal of Geometric Analysis. 31, 11493–11528.","short":"G. Ivanov, I. Tsiutsiurupa, Journal of Geometric Analysis 31 (2021) 11493–11528.","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>"},"oa":1,"status":"public","author":[{"full_name":"Ivanov, Grigory","last_name":"Ivanov","id":"87744F66-5C6F-11EA-AFE0-D16B3DDC885E","first_name":"Grigory"},{"first_name":"Igor","full_name":"Tsiutsiurupa, Igor","last_name":"Tsiutsiurupa"}],"scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2008.09543"}],"abstract":[{"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.","lang":"eng"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","language":[{"iso":"eng"}],"date_updated":"2023-08-08T14:04:49Z","article_type":"original","department":[{"_id":"UlWa"}],"year":"2021","month":"05","publication_identifier":{"eissn":["1559-002X"],"issn":["1050-6926"]},"isi":1,"external_id":{"arxiv":["2008.09543"],"isi":["000656507500001"]},"publication_status":"published","_id":"9548","type":"journal_article","oa_version":"Preprint","publisher":"Springer"},{"page":"454-458","title":"Gating and modulation of a hetero-octameric AMPA glutamate receptor","oa":1,"date_created":"2021-06-13T22:01:33Z","citation":{"chicago":"Zhang, Danyang, Jake Watson, Peter M. Matthews, Ondrej Cais, and Ingo H. Greger. “Gating and Modulation of a Hetero-Octameric AMPA Glutamate Receptor.” <i>Nature</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1038/s41586-021-03613-0\">https://doi.org/10.1038/s41586-021-03613-0</a>.","apa":"Zhang, D., Watson, J., Matthews, P. M., Cais, O., &#38; Greger, I. H. (2021). Gating and modulation of a hetero-octameric AMPA glutamate receptor. <i>Nature</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41586-021-03613-0\">https://doi.org/10.1038/s41586-021-03613-0</a>","mla":"Zhang, Danyang, et al. “Gating and Modulation of a Hetero-Octameric AMPA Glutamate Receptor.” <i>Nature</i>, vol. 594, Springer Nature, 2021, pp. 454–58, doi:<a href=\"https://doi.org/10.1038/s41586-021-03613-0\">10.1038/s41586-021-03613-0</a>.","ieee":"D. Zhang, J. Watson, P. M. Matthews, O. Cais, and I. H. Greger, “Gating and modulation of a hetero-octameric AMPA glutamate receptor,” <i>Nature</i>, vol. 594. Springer Nature, pp. 454–458, 2021.","ista":"Zhang D, Watson J, Matthews PM, Cais O, Greger IH. 2021. Gating and modulation of a hetero-octameric AMPA glutamate receptor. Nature. 594, 454–458.","short":"D. Zhang, J. Watson, P.M. Matthews, O. Cais, I.H. Greger, Nature 594 (2021) 454–458.","ama":"Zhang D, Watson J, Matthews PM, Cais O, Greger IH. Gating and modulation of a hetero-octameric AMPA glutamate receptor. <i>Nature</i>. 2021;594:454-458. doi:<a href=\"https://doi.org/10.1038/s41586-021-03613-0\">10.1038/s41586-021-03613-0</a>"},"quality_controlled":"1","doi":"10.1038/s41586-021-03613-0","article_processing_charge":"No","volume":594,"day":"02","acknowledgement":"We thank members of the Greger laboratory, B. Herguedas, J. Krieger and J.-N. Dohrke for comments on the manuscript; J. Krieger and J.-N. Dohrke for discussion, J. Krieger for help with the normal mode analysis, B. Köhegyi for help with cryo-EM imaging, V. Chang and K. Suzuki for helping to generate the CNIH2-1D4-HA stable cell line, M. Carvalho for assistance at early stages of this project, the LMB scientific computing and the cryo-EM facility for support, P. Emsley for help with model building, T. Nakane for helpful comments with RELION 3.1 and R. Warshamanage for helping with EMDA cryo-EM-map processing. We acknowledge the Diamond Light Source for access and support of the Cryo-EM facilities at the UK national electron bio10 imaging centre (eBIC), proposal EM17434, funded by the Wellcome Trust, MRC and BBSRC. This work was supported by grants from the Medical Research Council, as part of United Kingdom Research and Innovation (also known as UK Research and Innovation) (MC_U105174197) and BBSRC (BB/N002113/1) to I.H.G.","publication":"Nature","pmid":1,"intvolume":"       594","date_published":"2021-06-02T00:00:00Z","isi":1,"publication_identifier":{"issn":["0028-0836"],"eissn":["1476-4687"]},"month":"06","year":"2021","department":[{"_id":"PeJo"}],"article_type":"original","publisher":"Springer Nature","oa_version":"Published Version","type":"journal_article","_id":"9549","external_id":{"pmid":["34079129"],"isi":["000657238100003"]},"publication_status":"published","author":[{"last_name":"Zhang","full_name":"Zhang, Danyang","first_name":"Danyang"},{"first_name":"Jake","id":"63836096-4690-11EA-BD4E-32803DDC885E","orcid":"0000-0002-8698-3823","last_name":"Watson","full_name":"Watson, Jake"},{"full_name":"Matthews, Peter M.","last_name":"Matthews","first_name":"Peter M."},{"full_name":"Cais, Ondrej","last_name":"Cais","first_name":"Ondrej"},{"last_name":"Greger","full_name":"Greger, Ingo H.","first_name":"Ingo H."}],"status":"public","date_updated":"2023-08-08T13:59:51Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"AMPA receptors (AMPARs) mediate the majority of excitatory transmission in the brain and enable the synaptic plasticity that underlies learning1. A diverse array of AMPAR signalling complexes are established by receptor auxiliary subunits, which associate with the AMPAR in various combinations to modulate trafficking, gating and synaptic strength2. However, their mechanisms of action are poorly understood. Here we determine cryo-electron microscopy structures of the heteromeric GluA1–GluA2 receptor assembled with both TARP-γ8 and CNIH2, the predominant AMPAR complex in the forebrain, in both resting and active states. Two TARP-γ8 and two CNIH2 subunits insert at distinct sites beneath the ligand-binding domains of the receptor, with site-specific lipids shaping each interaction and affecting the gating regulation of the AMPARs. Activation of the receptor leads to asymmetry between GluA1 and GluA2 along the ion conduction path and an outward expansion of the channel triggers counter-rotations of both auxiliary subunit pairs, promoting the active-state conformation. In addition, both TARP-γ8 and CNIH2 pivot towards the pore exit upon activation, extending their reach for cytoplasmic receptor elements. CNIH2 achieves this through its uniquely extended M2 helix, which has transformed this endoplasmic reticulum-export factor into a powerful AMPAR modulator that is capable of providing hippocampal pyramidal neurons with their integrative synaptic properties. "}],"main_file_link":[{"url":"https://doi.org/10.1038/s41586-021-03613-0","open_access":"1"}],"scopus_import":"1"},{"author":[{"last_name":"Bao","full_name":"Bao, Zhigang","orcid":"0000-0003-3036-1475","first_name":"Zhigang","id":"442E6A6C-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0001-5366-9603","last_name":"Erdös","full_name":"Erdös, László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","first_name":"László"},{"orcid":"0000-0003-0954-3231","full_name":"Schnelli, Kevin","last_name":"Schnelli","first_name":"Kevin","id":"434AD0AE-F248-11E8-B48F-1D18A9856A87"}],"status":"public","date_updated":"2023-08-08T14:03:40Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"We prove that the energy of any eigenvector of a sum of several independent large Wigner matrices is equally distributed among these matrices with very high precision. This shows a particularly strong microcanonical form of the equipartition principle for quantum systems whose components are modelled by Wigner matrices. "}],"scopus_import":"1","isi":1,"publication_identifier":{"eissn":["20505094"]},"month":"05","year":"2021","project":[{"_id":"258DCDE6-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Random matrices, universality and disordered quantum systems","grant_number":"338804"}],"department":[{"_id":"LaEr"}],"article_type":"original","publisher":"Cambridge University Press","type":"journal_article","oa_version":"Published Version","ddc":["510"],"file":[{"file_name":"2021_ForumMath_Bao.pdf","relation":"main_file","creator":"cziletti","file_id":"9555","date_updated":"2021-06-15T14:40:45Z","content_type":"application/pdf","access_level":"open_access","date_created":"2021-06-15T14:40:45Z","success":1,"file_size":483458,"checksum":"47c986578de132200d41e6d391905519"}],"_id":"9550","external_id":{"arxiv":["2008.07061"],"isi":["000654960800001"]},"publication_status":"published","doi":"10.1017/fms.2021.38","file_date_updated":"2021-06-15T14:40:45Z","ec_funded":1,"article_processing_charge":"No","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"volume":9,"day":"27","acknowledgement":"The first author is supported in part by Hong Kong RGC Grant GRF 16301519 and NSFC 11871425. The second author is supported in part by ERC Advanced Grant RANMAT 338804. The third author is supported in part by Swedish Research Council Grant VR-2017-05195 and the Knut and Alice Wallenberg Foundation","publication":"Forum of Mathematics, Sigma","has_accepted_license":"1","intvolume":"         9","date_published":"2021-05-27T00:00:00Z","title":"Equipartition principle for Wigner matrices","article_number":"e44","oa":1,"citation":{"short":"Z. Bao, L. Erdös, K. Schnelli, Forum of Mathematics, Sigma 9 (2021).","ieee":"Z. Bao, L. Erdös, and K. Schnelli, “Equipartition principle for Wigner matrices,” <i>Forum of Mathematics, Sigma</i>, vol. 9. Cambridge University Press, 2021.","ista":"Bao Z, Erdös L, Schnelli K. 2021. Equipartition principle for Wigner matrices. Forum of Mathematics, Sigma. 9, e44.","ama":"Bao Z, Erdös L, Schnelli K. Equipartition principle for Wigner matrices. <i>Forum of Mathematics, Sigma</i>. 2021;9. doi:<a href=\"https://doi.org/10.1017/fms.2021.38\">10.1017/fms.2021.38</a>","mla":"Bao, Zhigang, et al. “Equipartition Principle for Wigner Matrices.” <i>Forum of Mathematics, Sigma</i>, vol. 9, e44, Cambridge University Press, 2021, doi:<a href=\"https://doi.org/10.1017/fms.2021.38\">10.1017/fms.2021.38</a>.","chicago":"Bao, Zhigang, László Erdös, and Kevin Schnelli. “Equipartition Principle for Wigner Matrices.” <i>Forum of Mathematics, Sigma</i>. Cambridge University Press, 2021. <a href=\"https://doi.org/10.1017/fms.2021.38\">https://doi.org/10.1017/fms.2021.38</a>.","apa":"Bao, Z., Erdös, L., &#38; Schnelli, K. (2021). Equipartition principle for Wigner matrices. <i>Forum of Mathematics, Sigma</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/fms.2021.38\">https://doi.org/10.1017/fms.2021.38</a>"},"date_created":"2021-06-13T22:01:33Z","arxiv":1,"quality_controlled":"1"},{"oa_version":"Preprint","type":"journal_article","issue":"24","_id":"9558","external_id":{"isi":["000663310100008"],"arxiv":["2007.02584"]},"publication_status":"published","publisher":"American Physical Society","department":[{"_id":"GradSch"},{"_id":"BjHo"}],"article_type":"letter_note","isi":1,"publication_identifier":{"issn":["0031-9007"],"eissn":["1079-7114"]},"year":"2021","month":"06","project":[{"_id":"238598C6-32DE-11EA-91FC-C7463DDC885E","name":"Revisiting the Turbulence Problem Using Statistical Mechanics: Experimental Studies on Transitional and Turbulent Flows","grant_number":"662960"}],"abstract":[{"lang":"eng","text":"We show that turbulent dynamics that arise in simulations of the three-dimensional Navier--Stokes equations in a triply-periodic domain under sinusoidal forcing can be described as transient visits to the neighborhoods of unstable time-periodic solutions. Based on this description, we reduce the original system with more than 10^5 degrees of freedom to a 17-node Markov chain where each node corresponds to the neighborhood of a periodic orbit. The model accurately reproduces long-term averages of the system's observables as weighted sums over the periodic orbits.\r\n"}],"related_material":{"link":[{"relation":"press_release","url":"https://ist.ac.at/en/news/turbulent-flow-simplified/","description":"News on IST Homepage"}]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2007.02584"}],"date_updated":"2023-08-08T14:08:36Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","language":[{"iso":"eng"}],"author":[{"orcid":"0000-0002-8490-9312","last_name":"Yalniz","full_name":"Yalniz, Gökhan","id":"66E74FA2-D8BF-11E9-8249-8DE2E5697425","first_name":"Gökhan"},{"full_name":"Hof, Björn","last_name":"Hof","orcid":"0000-0003-2057-2754","id":"3A374330-F248-11E8-B48F-1D18A9856A87","first_name":"Björn"},{"id":"3EA1010E-F248-11E8-B48F-1D18A9856A87","first_name":"Nazmi B","full_name":"Budanur, Nazmi B","last_name":"Budanur","orcid":"0000-0003-0423-5010"}],"status":"public","acknowledged_ssus":[{"_id":"ScienComp"}],"citation":{"ama":"Yalniz G, Hof B, Budanur NB. Coarse graining the state space of a turbulent flow using periodic orbits. <i>Physical Review Letters</i>. 2021;126(24). doi:<a href=\"https://doi.org/10.1103/PhysRevLett.126.244502\">10.1103/PhysRevLett.126.244502</a>","short":"G. Yalniz, B. Hof, N.B. Budanur, Physical Review Letters 126 (2021).","ista":"Yalniz G, Hof B, Budanur NB. 2021. Coarse graining the state space of a turbulent flow using periodic orbits. Physical Review Letters. 126(24), 244502.","ieee":"G. Yalniz, B. Hof, and N. B. Budanur, “Coarse graining the state space of a turbulent flow using periodic orbits,” <i>Physical Review Letters</i>, vol. 126, no. 24. American Physical Society, 2021.","mla":"Yalniz, Gökhan, et al. “Coarse Graining the State Space of a Turbulent Flow Using Periodic Orbits.” <i>Physical Review Letters</i>, vol. 126, no. 24, 244502, American Physical Society, 2021, doi:<a href=\"https://doi.org/10.1103/PhysRevLett.126.244502\">10.1103/PhysRevLett.126.244502</a>.","apa":"Yalniz, G., Hof, B., &#38; Budanur, N. B. (2021). Coarse graining the state space of a turbulent flow using periodic orbits. <i>Physical Review Letters</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevLett.126.244502\">https://doi.org/10.1103/PhysRevLett.126.244502</a>","chicago":"Yalniz, Gökhan, Björn Hof, and Nazmi B Budanur. “Coarse Graining the State Space of a Turbulent Flow Using Periodic Orbits.” <i>Physical Review Letters</i>. American Physical Society, 2021. <a href=\"https://doi.org/10.1103/PhysRevLett.126.244502\">https://doi.org/10.1103/PhysRevLett.126.244502</a>."},"date_created":"2021-06-16T15:45:36Z","arxiv":1,"quality_controlled":"1","article_number":"244502","oa":1,"title":"Coarse graining the state space of a turbulent flow using periodic orbits","intvolume":"       126","date_published":"2021-06-18T00:00:00Z","volume":126,"publication":"Physical Review Letters","acknowledgement":"We thank the referees for improving this Letter with their comments. We acknowledge stimulating discussions with\r\nH. Edelsbrunner. This work was supported by Grant No. 662960 from the Simons Foundation (B. H.). The numerical calculations were performed at TUBITAK ULAKBIM High Performance and Grid Computing Center (TRUBA resources) and IST Austria High Performance Computing cluster.","day":"18","article_processing_charge":"No","doi":"10.1103/PhysRevLett.126.244502"},{"ddc":["570"],"type":"dissertation","file":[{"file_name":"Thesis.pdf","relation":"main_file","file_id":"9563","creator":"dkleindienst","date_updated":"2022-07-02T22:30:04Z","access_level":"open_access","embargo":"2022-07-01","content_type":"application/pdf","date_created":"2021-06-17T14:03:14Z","checksum":"659df5518db495f679cb1df9e9bd1d94","file_size":77299142},{"checksum":"3bcf63a2b19e5b6663be051bea332748","file_size":369804895,"embargo_to":"open_access","date_created":"2021-06-17T14:04:30Z","access_level":"closed","content_type":"application/zip","date_updated":"2022-07-02T22:30:04Z","file_id":"9564","creator":"dkleindienst","relation":"source_file","file_name":"Thesis_source.zip"}],"oa_version":"Published Version","alternative_title":["ISTA Thesis"],"publication_status":"published","_id":"9562","publisher":"Institute of Science and Technology Austria","supervisor":[{"full_name":"Shigemoto, Ryuichi","last_name":"Shigemoto","orcid":"0000-0001-8761-9444","first_name":"Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87"}],"department":[{"_id":"GradSch"},{"_id":"RySh"}],"publication_identifier":{"issn":["2663-337X"]},"month":"06","year":"2021","related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"9756"},{"relation":"part_of_dissertation","status":"public","id":"9437"},{"id":"8532","status":"public","relation":"part_of_dissertation"},{"status":"public","relation":"part_of_dissertation","id":"612"}]},"abstract":[{"text":"Left-right asymmetries can be considered a fundamental organizational principle of the vertebrate central nervous system. The hippocampal CA3-CA1 pyramidal cell synaptic connection shows an input-side dependent asymmetry where the hemispheric location of the presynaptic CA3 neuron determines the synaptic properties. Left-input synapses terminating on apical dendrites in stratum radiatum have a higher density of NMDA receptor subunit GluN2B, a lower density of AMPA receptor subunit GluA1 and smaller areas with less often perforated PSDs. On the other hand, left-input synapses terminating on basal dendrites in stratum oriens have lower GluN2B densities than right-input ones. Apical and basal synapses further employ different signaling pathways involved in LTP. SDS-digested freeze-fracture replica labeling can visualize synaptic membrane proteins with high sensitivity and resolution, and has been used to reveal the asymmetry at the electron microscopic level. However, it requires time-consuming manual demarcation of the synaptic surface for quantitative measurements. To facilitate the analysis of replica labeling, I first developed a software named Darea, which utilizes deep-learning to automatize this demarcation. With Darea I characterized the synaptic distribution of NMDA and AMPA receptors as well as the voltage-gated Ca2+ channels in CA1 stratum radiatum and oriens. Second, I explored the role of GluN2B and its carboxy-terminus in the establishment of input-side dependent hippocampal asymmetry. In conditional knock-out mice lacking GluN2B expression in CA1 and GluN2B-2A swap mice, where GluN2B carboxy-terminus was exchanged to that of GluN2A, no significant asymmetries of GluN2B, GluA1 and PSD area were detected. We further discovered a previously unknown functional asymmetry of GluN2A, which was also lost in the swap mouse. These results demonstrate that GluN2B carboxy-terminus plays a critical role in normal formation of input-side dependent asymmetry.","lang":"eng"}],"date_updated":"2023-09-11T12:55:53Z","language":[{"iso":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","status":"public","author":[{"full_name":"Kleindienst, David","last_name":"Kleindienst","id":"42E121A4-F248-11E8-B48F-1D18A9856A87","first_name":"David"}],"date_created":"2021-06-17T14:10:47Z","citation":{"chicago":"Kleindienst, David. “2B or Not 2B: Hippocampal Asymmetries Mediated by NMDA Receptor Subunit GluN2B C-Terminus and High-Throughput Image Analysis by Deep-Learning.” Institute of Science and Technology Austria, 2021. <a href=\"https://doi.org/10.15479/at:ista:9562\">https://doi.org/10.15479/at:ista:9562</a>.","apa":"Kleindienst, D. (2021). <i>2B or not 2B: Hippocampal asymmetries mediated by NMDA receptor subunit GluN2B C-terminus and high-throughput image analysis by Deep-Learning</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:9562\">https://doi.org/10.15479/at:ista:9562</a>","mla":"Kleindienst, David. <i>2B or Not 2B: Hippocampal Asymmetries Mediated by NMDA Receptor Subunit GluN2B C-Terminus and High-Throughput Image Analysis by Deep-Learning</i>. Institute of Science and Technology Austria, 2021, doi:<a href=\"https://doi.org/10.15479/at:ista:9562\">10.15479/at:ista:9562</a>.","short":"D. Kleindienst, 2B or Not 2B: Hippocampal Asymmetries Mediated by NMDA Receptor Subunit GluN2B C-Terminus and High-Throughput Image Analysis by Deep-Learning, Institute of Science and Technology Austria, 2021.","ista":"Kleindienst D. 2021. 2B or not 2B: Hippocampal asymmetries mediated by NMDA receptor subunit GluN2B C-terminus and high-throughput image analysis by Deep-Learning. Institute of Science and Technology Austria.","ieee":"D. Kleindienst, “2B or not 2B: Hippocampal asymmetries mediated by NMDA receptor subunit GluN2B C-terminus and high-throughput image analysis by Deep-Learning,” Institute of Science and Technology Austria, 2021.","ama":"Kleindienst D. 2B or not 2B: Hippocampal asymmetries mediated by NMDA receptor subunit GluN2B C-terminus and high-throughput image analysis by Deep-Learning. 2021. doi:<a href=\"https://doi.org/10.15479/at:ista:9562\">10.15479/at:ista:9562</a>"},"acknowledged_ssus":[{"_id":"EM-Fac"}],"oa":1,"title":"2B or not 2B: Hippocampal asymmetries mediated by NMDA receptor subunit GluN2B C-terminus and high-throughput image analysis by Deep-Learning","page":"124","degree_awarded":"PhD","has_accepted_license":"1","date_published":"2021-06-01T00:00:00Z","day":"01","article_processing_charge":"No","doi":"10.15479/at:ista:9562","file_date_updated":"2022-07-02T22:30:04Z"}]