[{"external_id":{"arxiv":["2101.12617"]},"department":[{"_id":"VlKo"}],"oa_version":"Preprint","conference":{"name":"ICML: International Conference on Machine Learning","location":"Virtual","start_date":"2021-07-18","end_date":"2021-07-24"},"citation":{"ista":"Kolmogorov V, Pock T. 2021. One-sided Frank-Wolfe algorithms for saddle problems. 38th International Conference on Machine Learning. ICML: International Conference on Machine Learning.","ieee":"V. Kolmogorov and T. Pock, “One-sided Frank-Wolfe algorithms for saddle problems,” in <i>38th International Conference on Machine Learning</i>, Virtual, 2021.","chicago":"Kolmogorov, Vladimir, and Thomas Pock. “One-Sided Frank-Wolfe Algorithms for Saddle Problems.” In <i>38th International Conference on Machine Learning</i>, 2021.","short":"V. Kolmogorov, T. Pock, in:, 38th International Conference on Machine Learning, 2021.","ama":"Kolmogorov V, Pock T. One-sided Frank-Wolfe algorithms for saddle problems. In: <i>38th International Conference on Machine Learning</i>. ; 2021.","mla":"Kolmogorov, Vladimir, and Thomas Pock. “One-Sided Frank-Wolfe Algorithms for Saddle Problems.” <i>38th International Conference on Machine Learning</i>, 2021.","apa":"Kolmogorov, V., &#38; Pock, T. (2021). One-sided Frank-Wolfe algorithms for saddle problems. In <i>38th International Conference on Machine Learning</i>. Virtual."},"oa":1,"day":"01","quality_controlled":"1","date_updated":"2021-12-17T09:06:46Z","abstract":[{"text":"We study a class of convex-concave saddle-point problems of the form minxmaxy⟨Kx,y⟩+fP(x)−h∗(y) where K is a linear operator, fP is the sum of a convex function f with a Lipschitz-continuous gradient and the indicator function of a bounded convex polytope P, and h∗ is a convex (possibly nonsmooth) function. Such problem arises, for example, as a Lagrangian relaxation of various discrete optimization problems. Our main assumptions are the existence of an efficient linear minimization oracle (lmo) for fP and an efficient proximal map for h∗ which motivate the solution via a blend of proximal primal-dual algorithms and Frank-Wolfe algorithms. In case h∗ is the indicator function of a linear constraint and function f is quadratic, we show a O(1/n2) convergence rate on the dual objective, requiring O(nlogn) calls of lmo. If the problem comes from the constrained optimization problem minx∈Rd{fP(x)|Ax−b=0} then we additionally get bound O(1/n2) both on the primal gap and on the infeasibility gap. In the most general case, we show a O(1/n) convergence rate of the primal-dual gap again requiring O(nlogn) calls of lmo. To the best of our knowledge, this improves on the known convergence rates for the considered class of saddle-point problems. We show applications to labeling problems frequently appearing in machine learning and computer vision.","lang":"eng"}],"author":[{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Kolmogorov, Vladimir","last_name":"Kolmogorov","first_name":"Vladimir"},{"full_name":"Pock, Thomas","first_name":"Thomas","last_name":"Pock"}],"project":[{"grant_number":"616160","call_identifier":"FP7","_id":"25FBA906-B435-11E9-9278-68D0E5697425","name":"Discrete Optimization in Computer Vision: Theory and Practice"}],"publication_status":"published","date_published":"2021-07-01T00:00:00Z","acknowledgement":"Vladimir Kolmogorov was supported by the European Research Council under the European Unions Seventh Framework Programme (FP7/2007-2013)/ERC grant agreement no 616160. Thomas Pock acknowledges support by an ERC grant HOMOVIS, no 640156.","ec_funded":1,"month":"07","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","date_created":"2021-12-16T12:41:20Z","status":"public","_id":"10552","year":"2021","type":"conference","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2101.12617"}],"title":"One-sided Frank-Wolfe algorithms for saddle problems","article_processing_charge":"No","arxiv":1,"publication":"38th International Conference on Machine Learning","language":[{"iso":"eng"}]},{"publisher":"Association for Computing Machinery","conference":{"name":"PODC: Principles of Distributed Computing","location":"Virtual, Italy","start_date":"2021-07-26","end_date":"2021-07-30"},"department":[{"_id":"ElKo"}],"keyword":["optimal","state machine replication","fallback","asynchrony","byzantine faults"],"quality_controlled":"1","date_updated":"2023-09-04T11:42:10Z","abstract":[{"lang":"eng","text":"The popularity of permissioned blockchain systems demands BFT SMR protocols that are efficient under good network conditions (synchrony) and robust under bad network conditions (asynchrony). The state-of-the-art partially synchronous BFT SMR protocols provide optimal linear communication cost per decision under synchrony and good leaders, but lose liveness under asynchrony. On the other hand, the state-of-the-art asynchronous BFT SMR protocols are live even under asynchrony, but always pay quadratic cost even under synchrony. In this paper, we propose a BFT SMR protocol that achieves the best of both worlds -- optimal linear cost per decision under good networks and leaders, optimal quadratic cost per decision under bad networks, and remains always live."}],"citation":{"short":"R. Gelashvili, E. Kokoris Kogias, A. Spiegelman, Z. Xiang, in:, Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2021, pp. 187–190.","ieee":"R. Gelashvili, E. Kokoris Kogias, A. Spiegelman, and Z. Xiang, “Brief announcement: Be prepared when network goes bad: An asynchronous view-change protocol,” in <i>Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing</i>, Virtual, Italy, 2021, pp. 187–190.","chicago":"Gelashvili, Rati, Eleftherios Kokoris Kogias, Alexander Spiegelman, and Zhuolun Xiang. “Brief Announcement: Be Prepared When Network Goes Bad: An Asynchronous View-Change Protocol.” In <i>Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing</i>, 187–90. Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3465084.3467941\">https://doi.org/10.1145/3465084.3467941</a>.","ama":"Gelashvili R, Kokoris Kogias E, Spiegelman A, Xiang Z. Brief announcement: Be prepared when network goes bad: An asynchronous view-change protocol. In: <i>Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing</i>. Association for Computing Machinery; 2021:187-190. doi:<a href=\"https://doi.org/10.1145/3465084.3467941\">10.1145/3465084.3467941</a>","apa":"Gelashvili, R., Kokoris Kogias, E., Spiegelman, A., &#38; Xiang, Z. (2021). Brief announcement: Be prepared when network goes bad: An asynchronous view-change protocol. In <i>Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing</i> (pp. 187–190). Virtual, Italy: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3465084.3467941\">https://doi.org/10.1145/3465084.3467941</a>","mla":"Gelashvili, Rati, et al. “Brief Announcement: Be Prepared When Network Goes Bad: An Asynchronous View-Change Protocol.” <i>Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing</i>, Association for Computing Machinery, 2021, pp. 187–90, doi:<a href=\"https://doi.org/10.1145/3465084.3467941\">10.1145/3465084.3467941</a>.","ista":"Gelashvili R, Kokoris Kogias E, Spiegelman A, Xiang Z. 2021. Brief announcement: Be prepared when network goes bad: An asynchronous view-change protocol. Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing. PODC: Principles of Distributed Computing, 187–190."},"page":"187-190","date_created":"2021-12-16T13:20:19Z","author":[{"first_name":"Rati","last_name":"Gelashvili","full_name":"Gelashvili, Rati"},{"last_name":"Kokoris Kogias","first_name":"Eleftherios","full_name":"Kokoris Kogias, Eleftherios","id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30"},{"last_name":"Spiegelman","first_name":"Alexander","full_name":"Spiegelman, Alexander"},{"first_name":"Zhuolun","last_name":"Xiang","full_name":"Xiang, Zhuolun"}],"publication_status":"published","isi":1,"month":"07","year":"2021","_id":"10553","type":"conference","oa_version":"Preprint","doi":"10.1145/3465084.3467941","external_id":{"isi":["000744439800018"],"arxiv":["2103.03181"]},"scopus_import":"1","publication_identifier":{"isbn":["9-781-4503-8548-0"]},"oa":1,"day":"21","status":"public","date_published":"2021-07-21T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","title":"Brief announcement: Be prepared when network goes bad: An asynchronous view-change protocol","arxiv":1,"publication":"Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2103.03181"}]},{"oa":1,"day":"21","oa_version":"Preprint","doi":"10.1145/3465084.3467905","publication_identifier":{"isbn":["978-1-4503-8548-0"]},"external_id":{"isi":["000744439800016"],"arxiv":["2102.08325"]},"scopus_import":"1","publication":"Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing","language":[{"iso":"eng"}],"article_processing_charge":"No","title":"All You Need is DAG","arxiv":1,"main_file_link":[{"url":"https://arxiv.org/abs/2102.08325","open_access":"1"}],"status":"public","date_published":"2021-07-21T00:00:00Z","acknowledgement":"Oded Naor is grateful to the Technion Hiroshi Fujiwara Cyber-Security Research Center for providing a research grant. Part of Oded’s work was done while at Novi Research. This work was funded by the Novi team at Facebook. We also wish to thank the Novi Research team for valuable feedback, and in particular George Danezis, Alberto Sonnino, and Dahlia Malkhi.\r\n","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","date_updated":"2023-08-17T06:24:44Z","abstract":[{"text":"We present DAG-Rider, the first asynchronous Byzantine Atomic Broadcast protocol that achieves optimal resilience, optimal amortized communication complexity, and optimal time complexity. DAG-Rider is post-quantum safe and ensures that all values proposed by correct processes eventually get delivered. We construct DAG-Rider in two layers: In the first layer, processes reliably broadcast their proposals and build a structured Directed Acyclic Graph (DAG) of the communication among them. In the second layer, processes locally observe their DAGs and totally order all proposals with no extra communication.","lang":"eng"}],"quality_controlled":"1","citation":{"apa":"Keidar, I., Kokoris Kogias, E., Naor, O., &#38; Spiegelman, A. (2021). All You Need is DAG. In <i>Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing</i> (pp. 165–175). Virtual, Italy: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3465084.3467905\">https://doi.org/10.1145/3465084.3467905</a>","mla":"Keidar, Idit, et al. “All You Need Is DAG.” <i>Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing</i>, Association for Computing Machinery, 2021, pp. 165–75, doi:<a href=\"https://doi.org/10.1145/3465084.3467905\">10.1145/3465084.3467905</a>.","short":"I. Keidar, E. Kokoris Kogias, O. Naor, A. Spiegelman, in:, Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2021, pp. 165–175.","ieee":"I. Keidar, E. Kokoris Kogias, O. Naor, and A. Spiegelman, “All You Need is DAG,” in <i>Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing</i>, Virtual, Italy, 2021, pp. 165–175.","chicago":"Keidar, Idit, Eleftherios Kokoris Kogias, Oded Naor, and Alexander Spiegelman. “All You Need Is DAG.” In <i>Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing</i>, 165–75. Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3465084.3467905\">https://doi.org/10.1145/3465084.3467905</a>.","ama":"Keidar I, Kokoris Kogias E, Naor O, Spiegelman A. All You Need is DAG. In: <i>Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing</i>. Association for Computing Machinery; 2021:165-175. doi:<a href=\"https://doi.org/10.1145/3465084.3467905\">10.1145/3465084.3467905</a>","ista":"Keidar I, Kokoris Kogias E, Naor O, Spiegelman A. 2021. All You Need is DAG. Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing. PODC: Principles of Distributed Computing, 165–175."},"page":"165-175","conference":{"name":"PODC: Principles of Distributed Computing","start_date":"2021-07-26","location":"Virtual, Italy","end_date":"2021-07-30"},"publisher":"Association for Computing Machinery","department":[{"_id":"ElKo"}],"type":"conference","year":"2021","_id":"10554","date_created":"2021-12-16T13:21:13Z","publication_status":"published","isi":1,"month":"07","author":[{"last_name":"Keidar","first_name":"Idit","full_name":"Keidar, Idit"},{"id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30","last_name":"Kokoris Kogias","first_name":"Eleftherios","full_name":"Kokoris Kogias, Eleftherios"},{"full_name":"Naor, Oded","first_name":"Oded","last_name":"Naor"},{"full_name":"Spiegelman, Alexander","first_name":"Alexander","last_name":"Spiegelman"}]},{"_id":"10559","year":"2021","type":"journal_article","related_material":{"record":[{"relation":"earlier_version","id":"8831","status":"public"},{"id":"8834","status":"public","relation":"research_data"}]},"article_number":"L022005","date_created":"2021-12-16T18:50:57Z","intvolume":"         3","author":[{"orcid":"0000-0001-9985-9293","id":"b22ab905-3539-11eb-84c3-fc159dcd79cb","full_name":"Aggarwal, Kushagra","first_name":"Kushagra","last_name":"Aggarwal"},{"id":"340F461A-F248-11E8-B48F-1D18A9856A87","full_name":"Hofmann, Andrea C","last_name":"Hofmann","first_name":"Andrea C"},{"orcid":"0000-0002-7197-4801","id":"4C473F58-F248-11E8-B48F-1D18A9856A87","full_name":"Jirovec, Daniel","last_name":"Jirovec","first_name":"Daniel"},{"full_name":"Prieto Gonzalez, Ivan","first_name":"Ivan","last_name":"Prieto Gonzalez","id":"2A307FE2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7370-5357"},{"last_name":"Sammak","first_name":"Amir","full_name":"Sammak, Amir"},{"full_name":"Botifoll, Marc","first_name":"Marc","last_name":"Botifoll"},{"first_name":"Sara","last_name":"Martí-Sánchez","full_name":"Martí-Sánchez, Sara"},{"last_name":"Veldhorst","first_name":"Menno","full_name":"Veldhorst, Menno"},{"first_name":"Jordi","last_name":"Arbiol","full_name":"Arbiol, Jordi"},{"full_name":"Scappucci, Giordano","last_name":"Scappucci","first_name":"Giordano"},{"last_name":"Danon","first_name":"Jeroen","full_name":"Danon, Jeroen"},{"full_name":"Katsaros, Georgios","first_name":"Georgios","last_name":"Katsaros","orcid":"0000-0001-8342-202X","id":"38DB5788-F248-11E8-B48F-1D18A9856A87"}],"publication_status":"published","project":[{"grant_number":"844511","call_identifier":"H2020","name":"Majorana bound states in Ge/SiGe heterostructures","_id":"26A151DA-B435-11E9-9278-68D0E5697425"},{"grant_number":"862046","call_identifier":"H2020","name":"TOPOLOGICALLY PROTECTED AND SCALABLE QUANTUM BITS","_id":"237E5020-32DE-11EA-91FC-C7463DDC885E"}],"acknowledged_ssus":[{"_id":"NanoFab"},{"_id":"M-Shop"}],"ec_funded":1,"month":"04","quality_controlled":"1","has_accepted_license":"1","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_updated":"2024-02-21T12:41:26Z","abstract":[{"lang":"eng","text":"Hole gases in planar germanium can have high mobilities in combination with strong spin-orbit interaction and electrically tunable g factors, and are therefore emerging as a promising platform for creating hybrid superconductor-semiconductor devices. A key challenge towards hybrid Ge-based quantum technologies is the design of high-quality interfaces and superconducting contacts that are robust against magnetic fields. In this work, by combining the assets of aluminum, which provides good contact to the Ge, and niobium, which has a significant superconducting gap, we demonstrate highly transparent low-disordered JoFETs with relatively large ICRN products that are capable of withstanding high magnetic fields. We furthermore demonstrate the ability of phase-biasing individual JoFETs, opening up an avenue to explore topological superconductivity in planar Ge. The persistence of superconductivity in the reported hybrid devices beyond 1.8 T paves the way towards integrating spin qubits and proximity-induced superconductivity on the same chip."}],"volume":3,"citation":{"ista":"Aggarwal K, Hofmann AC, Jirovec D, Prieto Gonzalez I, Sammak A, Botifoll M, Martí-Sánchez S, Veldhorst M, Arbiol J, Scappucci G, Danon J, Katsaros G. 2021. Enhancement of proximity-induced superconductivity in a planar Ge hole gas. Physical Review Research. 3(2), L022005.","apa":"Aggarwal, K., Hofmann, A. C., Jirovec, D., Prieto Gonzalez, I., Sammak, A., Botifoll, M., … Katsaros, G. (2021). Enhancement of proximity-induced superconductivity in a planar Ge hole gas. <i>Physical Review Research</i>. American Physical Society. <a href=\"https://doi.org/10.1103/physrevresearch.3.l022005\">https://doi.org/10.1103/physrevresearch.3.l022005</a>","mla":"Aggarwal, Kushagra, et al. “Enhancement of Proximity-Induced Superconductivity in a Planar Ge Hole Gas.” <i>Physical Review Research</i>, vol. 3, no. 2, L022005, American Physical Society, 2021, doi:<a href=\"https://doi.org/10.1103/physrevresearch.3.l022005\">10.1103/physrevresearch.3.l022005</a>.","ama":"Aggarwal K, Hofmann AC, Jirovec D, et al. Enhancement of proximity-induced superconductivity in a planar Ge hole gas. <i>Physical Review Research</i>. 2021;3(2). doi:<a href=\"https://doi.org/10.1103/physrevresearch.3.l022005\">10.1103/physrevresearch.3.l022005</a>","ieee":"K. Aggarwal <i>et al.</i>, “Enhancement of proximity-induced superconductivity in a planar Ge hole gas,” <i>Physical Review Research</i>, vol. 3, no. 2. American Physical Society, 2021.","chicago":"Aggarwal, Kushagra, Andrea C Hofmann, Daniel Jirovec, Ivan Prieto Gonzalez, Amir Sammak, Marc Botifoll, Sara Martí-Sánchez, et al. “Enhancement of Proximity-Induced Superconductivity in a Planar Ge Hole Gas.” <i>Physical Review Research</i>. American Physical Society, 2021. <a href=\"https://doi.org/10.1103/physrevresearch.3.l022005\">https://doi.org/10.1103/physrevresearch.3.l022005</a>.","short":"K. Aggarwal, A.C. Hofmann, D. Jirovec, I. Prieto Gonzalez, A. Sammak, M. Botifoll, S. Martí-Sánchez, M. Veldhorst, J. Arbiol, G. Scappucci, J. Danon, G. Katsaros, Physical Review Research 3 (2021)."},"publisher":"American Physical Society","keyword":["general engineering"],"department":[{"_id":"GeKa"}],"article_processing_charge":"No","title":"Enhancement of proximity-induced superconductivity in a planar Ge hole gas","arxiv":1,"publication":"Physical Review Research","language":[{"iso":"eng"}],"file_date_updated":"2021-12-17T08:12:37Z","ddc":["620"],"status":"public","article_type":"original","acknowledgement":"This research and related results were made possible with the support of the NOMIS Foundation. This research was supported by the Scientific Service Units of IST Austria through resources provided by the MIBA Machine Shop and the nanofabrication facility, the European Union's Horizon 2020 research and innovation program under the Marie Sklodowska-Curie Grant agreement No. 844511 Grant Agreement No. 862046. ICN2 acknowledge funding from Generalitat de Catalunya 2017 SGR 327. ICN2 is supported by the Severo Ochoa program from Spanish MINECO (Grant No. SEV-2017-0706) and is funded by the CERCA Programme/Generalitat de Catalunya. Part of the present work has been performed in the framework of Universitat Autnoma de Barcelona Materials Science PhD program. The HAADF-STEM microscopy was conducted in the Laboratorio de Microscopias Avanzadas at Instituto de Nanociencia de Aragon-Universidad de Zaragoza. Authors acknowledge the LMA-INA for offering access to their instruments and expertise. We acknowledge support from CSIC Research Platform on Quantum Technologies PTI-001. This project has received funding from the European Union's Horizon 2020 research and innovation programme under Grant Agreement No. 823717 ESTEEM3. M.B. acknowledges support from SUR Generalitat de Catalunya and the EU Social Fund; project ref. 2020 FI 00103. G.S. and M.V. acknowledge support through a projectruimte grant associated with the Netherlands Organization of Scientific Research (NWO). J.D. acknowledges support through FRIPRO-project 274853, which is funded by the Research Council of Norway.","date_published":"2021-04-15T00:00:00Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","oa":1,"day":"15","oa_version":"Published Version","doi":"10.1103/physrevresearch.3.l022005","external_id":{"arxiv":["2012.00322"]},"scopus_import":"1","issue":"2","publication_identifier":{"issn":["2643-1564"]},"file":[{"creator":"cchlebak","success":1,"file_size":1917512,"date_created":"2021-12-17T08:12:37Z","file_name":"2021_PhysRevResearch_Aggarwal.pdf","file_id":"10561","checksum":"60a1bc9c9b616b1b155044bb8cfc6484","access_level":"open_access","date_updated":"2021-12-17T08:12:37Z","relation":"main_file","content_type":"application/pdf"}]},{"department":[{"_id":"SaSi"}],"publisher":"Elsevier ; Cell Press","citation":{"chicago":"Venturino, Alessandro, and Sandra Siegert. “Minimally Invasive Protocols and Quantification for Microglia-Mediated Perineuronal Net Disassembly in Mouse Brain.” <i>STAR Protocols</i>. Elsevier ; Cell Press, 2021. <a href=\"https://doi.org/10.1016/j.xpro.2021.101012\">https://doi.org/10.1016/j.xpro.2021.101012</a>.","ama":"Venturino A, Siegert S. Minimally invasive protocols and quantification for microglia-mediated perineuronal net disassembly in mouse brain. <i>STAR Protocols</i>. 2021;2(4). doi:<a href=\"https://doi.org/10.1016/j.xpro.2021.101012\">10.1016/j.xpro.2021.101012</a>","ieee":"A. Venturino and S. Siegert, “Minimally invasive protocols and quantification for microglia-mediated perineuronal net disassembly in mouse brain,” <i>STAR Protocols</i>, vol. 2, no. 4. Elsevier ; Cell Press, 2021.","short":"A. Venturino, S. Siegert, STAR Protocols 2 (2021).","mla":"Venturino, Alessandro, and Sandra Siegert. “Minimally Invasive Protocols and Quantification for Microglia-Mediated Perineuronal Net Disassembly in Mouse Brain.” <i>STAR Protocols</i>, vol. 2, no. 4, 101012, Elsevier ; Cell Press, 2021, doi:<a href=\"https://doi.org/10.1016/j.xpro.2021.101012\">10.1016/j.xpro.2021.101012</a>.","apa":"Venturino, A., &#38; Siegert, S. (2021). Minimally invasive protocols and quantification for microglia-mediated perineuronal net disassembly in mouse brain. <i>STAR Protocols</i>. Elsevier ; Cell Press. <a href=\"https://doi.org/10.1016/j.xpro.2021.101012\">https://doi.org/10.1016/j.xpro.2021.101012</a>","ista":"Venturino A, Siegert S. 2021. Minimally invasive protocols and quantification for microglia-mediated perineuronal net disassembly in mouse brain. STAR Protocols. 2(4), 101012."},"volume":2,"tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_updated":"2023-11-16T13:11:04Z","abstract":[{"text":"Enzymatic digestion of the extracellular matrix with chondroitinase-ABC reinstates juvenile-like plasticity in the adult cortex as it also disassembles the perineuronal nets (PNNs). The disadvantage of the enzyme is that it must be applied intracerebrally and it degrades the ECM for several weeks. Here, we provide two minimally invasive and transient protocols for microglia-enabled PNN disassembly in mouse cortex: repeated treatment with ketamine-xylazine-acepromazine (KXA) anesthesia and 60-Hz light entrainment. We also discuss how to analyze PNNs within microglial endosomes-lysosomes. For complete details on the use and execution of this protocol, please refer to Venturino et al. (2021).","lang":"eng"}],"quality_controlled":"1","has_accepted_license":"1","publication_status":"published","acknowledged_ssus":[{"_id":"Bio"}],"project":[{"grant_number":"715571","call_identifier":"H2020","name":"Microglia action towards neuronal circuit formation and function in health and disease","_id":"25D4A630-B435-11E9-9278-68D0E5697425"}],"month":"12","ec_funded":1,"author":[{"full_name":"Venturino, Alessandro","last_name":"Venturino","first_name":"Alessandro","orcid":"0000-0003-2356-9403","id":"41CB84B2-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0001-8635-0877","id":"36ACD32E-F248-11E8-B48F-1D18A9856A87","last_name":"Siegert","first_name":"Sandra","full_name":"Siegert, Sandra"}],"intvolume":"         2","date_created":"2021-12-19T23:01:32Z","type":"journal_article","article_number":"101012","_id":"10565","year":"2021","file":[{"file_name":"2021_STARProt_Venturino.pdf","access_level":"open_access","date_updated":"2021-12-20T08:58:40Z","file_id":"10570","checksum":"9ea2501056c5df99e84726b845e9b976","relation":"main_file","content_type":"application/pdf","success":1,"creator":"cchlebak","file_size":6207060,"date_created":"2021-12-20T08:58:40Z"}],"publication_identifier":{"eissn":["2666-1667"]},"scopus_import":"1","issue":"4","oa_version":"Published Version","doi":"10.1016/j.xpro.2021.101012","oa":1,"day":"17","date_published":"2021-12-17T00:00:00Z","acknowledgement":"This research was supported by the European Research Council (grant 715571 to S.S.). We thank Rouven Schulz, Michael Schunn, Claudia Gold, Gabriel Krens, Sarah Gorkiewicz, Margaret Maes, Jürgen Siegert, Marco Benevento, and Sara Oakeley for comments on the manuscript and the IST Austria Bioimaging Facility for the technical support.","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","article_type":"original","status":"public","ddc":["573"],"file_date_updated":"2021-12-20T08:58:40Z","publication":"STAR Protocols","language":[{"iso":"eng"}],"article_processing_charge":"Yes","title":"Minimally invasive protocols and quantification for microglia-mediated perineuronal net disassembly in mouse brain"},{"external_id":{"isi":["000637736300001"]},"scopus_import":"1","file":[{"file_name":"2021_Frontiers_Goehlich.pdf","content_type":"application/pdf","relation":"main_file","file_id":"10572","checksum":"8d6e2b767bb0240a9b5a3a3555be51fd","access_level":"open_access","date_updated":"2021-12-20T10:44:20Z","success":1,"creator":"alisjak","date_created":"2021-12-20T10:44:20Z","file_size":3175085}],"publication_identifier":{"issn":["2296-701X"]},"oa_version":"Published Version","doi":"10.3389/fevo.2021.626442","oa":1,"day":"25","article_type":"original","acknowledgement":"We are grateful for the help of Kristina Dauven, Andreas Ebner, Janina Röckner, and Paulina Urban for fish collection in the field and fish maintenance. Furthermore, we thank Fabian Wendt for setting up the aquaria system and Tatjana Liese, Paulina Urban, Jakob Gismann, and Thorsten Reusch for support with DNA extraction and analysis of pipefish population structure. The authors acknowledge support of Isabel Tanger, Agnes Piecyk, Jonas Müller, Grace Walls, Sebastian Albrecht, Julia Böge, and Julia Stefanschitz for their support in preparing cDNA and running of Fluidigm chips. A special thank goes to Diana Gill for general lab support, ordering materials and just being the good spirit of our molecular lab, to Till Bayer for bioinformatics support and to Melanie Heckwolf for fruitful discussion and feedback on the manuscript. HG is very grateful for inspirational office space with ocean view provided by Lisa Hentschel and family. This manuscript has been released as a pre-print at BIORXIV.","date_published":"2021-03-25T00:00:00Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","ddc":["597"],"status":"public","file_date_updated":"2021-12-20T10:44:20Z","title":"Pipefish locally adapted to low salinity in the Baltic Sea retain phenotypic plasticity to cope with ancestral salinity levels","article_processing_charge":"No","publication":"Frontiers in Ecology and Evolution","language":[{"iso":"eng"}],"department":[{"_id":"SyCr"}],"keyword":["ecology","evolution","behavior and systematics","trans-generational plasticity","genetic adaptation","local adaptation","phenotypic plasticity","Baltic Sea","climate change","salinity","syngnathids"],"publisher":"Frontiers Media","citation":{"ieee":"H. Goehlich, L. Sartoris, K.-S. Wagner, C. C. Wendling, and O. Roth, “Pipefish locally adapted to low salinity in the Baltic Sea retain phenotypic plasticity to cope with ancestral salinity levels,” <i>Frontiers in Ecology and Evolution</i>, vol. 9. Frontiers Media, 2021.","short":"H. Goehlich, L. Sartoris, K.-S. Wagner, C.C. Wendling, O. Roth, Frontiers in Ecology and Evolution 9 (2021).","chicago":"Goehlich, Henry, Linda Sartoris, Kim-Sara Wagner, Carolin C. Wendling, and Olivia Roth. “Pipefish Locally Adapted to Low Salinity in the Baltic Sea Retain Phenotypic Plasticity to Cope with Ancestral Salinity Levels.” <i>Frontiers in Ecology and Evolution</i>. Frontiers Media, 2021. <a href=\"https://doi.org/10.3389/fevo.2021.626442\">https://doi.org/10.3389/fevo.2021.626442</a>.","ama":"Goehlich H, Sartoris L, Wagner K-S, Wendling CC, Roth O. Pipefish locally adapted to low salinity in the Baltic Sea retain phenotypic plasticity to cope with ancestral salinity levels. <i>Frontiers in Ecology and Evolution</i>. 2021;9. doi:<a href=\"https://doi.org/10.3389/fevo.2021.626442\">10.3389/fevo.2021.626442</a>","mla":"Goehlich, Henry, et al. “Pipefish Locally Adapted to Low Salinity in the Baltic Sea Retain Phenotypic Plasticity to Cope with Ancestral Salinity Levels.” <i>Frontiers in Ecology and Evolution</i>, vol. 9, 626442, Frontiers Media, 2021, doi:<a href=\"https://doi.org/10.3389/fevo.2021.626442\">10.3389/fevo.2021.626442</a>.","apa":"Goehlich, H., Sartoris, L., Wagner, K.-S., Wendling, C. C., &#38; Roth, O. (2021). Pipefish locally adapted to low salinity in the Baltic Sea retain phenotypic plasticity to cope with ancestral salinity levels. <i>Frontiers in Ecology and Evolution</i>. Frontiers Media. <a href=\"https://doi.org/10.3389/fevo.2021.626442\">https://doi.org/10.3389/fevo.2021.626442</a>","ista":"Goehlich H, Sartoris L, Wagner K-S, Wendling CC, Roth O. 2021. Pipefish locally adapted to low salinity in the Baltic Sea retain phenotypic plasticity to cope with ancestral salinity levels. Frontiers in Ecology and Evolution. 9, 626442."},"volume":9,"has_accepted_license":"1","quality_controlled":"1","date_updated":"2023-08-17T06:27:22Z","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"abstract":[{"lang":"eng","text":"Genetic adaptation and phenotypic plasticity facilitate the migration into new habitats and enable organisms to cope with a rapidly changing environment. In contrast to genetic adaptation that spans multiple generations as an evolutionary process, phenotypic plasticity allows acclimation within the life-time of an organism. Genetic adaptation and phenotypic plasticity are usually studied in isolation, however, only by including their interactive impact, we can understand acclimation and adaptation in nature. We aimed to explore the contribution of adaptation and plasticity in coping with an abiotic (salinity) and a biotic (Vibrio bacteria) stressor using six different populations of the broad-nosed pipefish Syngnathus typhle that originated from either high [14–17 Practical Salinity Unit (PSU)] or low (7–11 PSU) saline environments along the German coastline of the Baltic Sea. We exposed wild caught animals, to either high (15 PSU) or low (7 PSU) salinity, representing native and novel salinity conditions and allowed animals to mate. After male pregnancy, offspring was split and each half was exposed to one of the two salinities and infected with Vibrio alginolyticus bacteria that were evolved at either of the two salinities in a fully reciprocal design. We investigated life-history traits of fathers and expression of 47 target genes in mothers and offspring. Pregnant males originating from high salinity exposed to low salinity were highly susceptible to opportunistic fungi infections resulting in decreased offspring size and number. In contrast, no signs of fungal infection were identified in fathers originating from low saline conditions suggesting that genetic adaptation has the potential to overcome the challenges encountered at low salinity. Offspring from parents with low saline origin survived better at low salinity suggesting genetic adaptation to low salinity. In addition, gene expression analyses of juveniles indicated patterns of local adaptation, trans-generational plasticity and developmental plasticity. In conclusion, our study suggests that pipefish are locally adapted to the low salinity in their environment, however, they are retaining phenotypic plasticity, which allows them to also cope with ancestral salinity levels and prevailing pathogens."}],"author":[{"full_name":"Goehlich, Henry","last_name":"Goehlich","first_name":"Henry"},{"id":"2B9284CA-F248-11E8-B48F-1D18A9856A87","last_name":"Sartoris","first_name":"Linda","full_name":"Sartoris, Linda"},{"full_name":"Wagner, Kim-Sara","last_name":"Wagner","first_name":"Kim-Sara"},{"last_name":"Wendling","first_name":"Carolin C.","full_name":"Wendling, Carolin C."},{"first_name":"Olivia","last_name":"Roth","full_name":"Roth, Olivia"}],"publication_status":"published","month":"03","isi":1,"date_created":"2021-12-20T07:53:19Z","intvolume":"         9","year":"2021","_id":"10568","type":"journal_article","article_number":"626442"},{"article_type":"original","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","date_published":"2021-12-16T00:00:00Z","acknowledgement":"We are grateful to Véronique Helfer, Walter Hödl, Lisa Schretzmeyer and Julia Wotke, who assisted with fieldwork in French Guiana. This work was supported by the Austrian Science Fund (FWF) [P24788, T699 and P31518 to E.R.; P33728 to M.R.; J3827 to Thomas Bugnyar, Tecumseh Fitch and Ludwig Huber]; and by the Austrian Bundesministerium für Wissenschaft, Forschung und Wirtschaft [IS761001 to J.O. (Tecumseh Fitch, Thomas Bugnyar and Ludwig Huber)]. A.P. was supported by the European Union's Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie grant agreement no. 835530. S.A.R. was supported by the HT faculty, Lund University. We thank the CNRS Nouragues Ecological Research Station, which benefited from the ‘Investissement d'Avenir’ grants managed by the Agence Nationale de la Recherche (AnaEE France ANR-11-INBS-0001; Labex CEBA ANR-10-LABX-25-01). Open access funding provided by University of Vienna. Deposited in PMC for immediate release.","ddc":["573"],"status":"public","file_date_updated":"2021-12-20T10:14:14Z","title":"Naïve poison frog tadpoles use bi-modal cues to avoid insect predators but not heterospecific predatory tadpoles","article_processing_charge":"No","language":[{"iso":"eng"}],"publication":"Journal of Experimental Biology","issue":"24","external_id":{"isi":["000738259300013"],"pmid":["34845497"]},"publication_identifier":{"eissn":["1477-9145"],"issn":["0022-0949"]},"file":[{"success":1,"creator":"cchlebak","date_created":"2021-12-20T10:14:14Z","file_size":607096,"file_name":"2021_JExpBio_Szabo.pdf","content_type":"application/pdf","relation":"main_file","checksum":"75d13a5ec8e3b90e3bc02bd8a9c17eef","file_id":"10571","access_level":"open_access","date_updated":"2021-12-20T10:14:14Z"}],"doi":"10.1242/jeb.243647","oa_version":"Published Version","day":"16","oa":1,"author":[{"first_name":"B","last_name":"Szabo","full_name":"Szabo, B"},{"first_name":"R","last_name":"Mangione","full_name":"Mangione, R"},{"last_name":"Rath","first_name":"M","full_name":"Rath, M"},{"full_name":"Pašukonis, A","first_name":"A","last_name":"Pašukonis"},{"last_name":"Reber","first_name":"SA","full_name":"Reber, SA"},{"last_name":"Oh","first_name":"Jinook","full_name":"Oh, Jinook","orcid":"0000-0001-7425-2372","id":"403169A4-080F-11EA-9993-BF3F3DDC885E"},{"first_name":"M","last_name":"Ringler","full_name":"Ringler, M"},{"full_name":"Ringler, E","last_name":"Ringler","first_name":"E"}],"month":"12","isi":1,"publication_status":"published","date_created":"2021-12-20T07:54:22Z","intvolume":"       224","_id":"10569","year":"2021","article_number":"jeb243647","type":"journal_article","department":[{"_id":"SyCr"}],"publisher":"The Company of Biologists","pmid":1,"citation":{"ista":"Szabo B, Mangione R, Rath M, Pašukonis A, Reber S, Oh J, Ringler M, Ringler E. 2021. Naïve poison frog tadpoles use bi-modal cues to avoid insect predators but not heterospecific predatory tadpoles. Journal of Experimental Biology. 224(24), jeb243647.","apa":"Szabo, B., Mangione, R., Rath, M., Pašukonis, A., Reber, S., Oh, J., … Ringler, E. (2021). Naïve poison frog tadpoles use bi-modal cues to avoid insect predators but not heterospecific predatory tadpoles. <i>Journal of Experimental Biology</i>. The Company of Biologists. <a href=\"https://doi.org/10.1242/jeb.243647\">https://doi.org/10.1242/jeb.243647</a>","mla":"Szabo, B., et al. “Naïve Poison Frog Tadpoles Use Bi-Modal Cues to Avoid Insect Predators but Not Heterospecific Predatory Tadpoles.” <i>Journal of Experimental Biology</i>, vol. 224, no. 24, jeb243647, The Company of Biologists, 2021, doi:<a href=\"https://doi.org/10.1242/jeb.243647\">10.1242/jeb.243647</a>.","ieee":"B. Szabo <i>et al.</i>, “Naïve poison frog tadpoles use bi-modal cues to avoid insect predators but not heterospecific predatory tadpoles,” <i>Journal of Experimental Biology</i>, vol. 224, no. 24. The Company of Biologists, 2021.","short":"B. Szabo, R. Mangione, M. Rath, A. Pašukonis, S. Reber, J. Oh, M. Ringler, E. Ringler, Journal of Experimental Biology 224 (2021).","chicago":"Szabo, B, R Mangione, M Rath, A Pašukonis, SA Reber, Jinook Oh, M Ringler, and E Ringler. “Naïve Poison Frog Tadpoles Use Bi-Modal Cues to Avoid Insect Predators but Not Heterospecific Predatory Tadpoles.” <i>Journal of Experimental Biology</i>. The Company of Biologists, 2021. <a href=\"https://doi.org/10.1242/jeb.243647\">https://doi.org/10.1242/jeb.243647</a>.","ama":"Szabo B, Mangione R, Rath M, et al. Naïve poison frog tadpoles use bi-modal cues to avoid insect predators but not heterospecific predatory tadpoles. <i>Journal of Experimental Biology</i>. 2021;224(24). doi:<a href=\"https://doi.org/10.1242/jeb.243647\">10.1242/jeb.243647</a>"},"volume":224,"quality_controlled":"1","has_accepted_license":"1","abstract":[{"text":"For animals to survive until reproduction, it is crucial that juveniles successfully detect potential predators and respond with appropriate behavior. The recognition of cues originating from predators can be innate or learned. Cues of various modalities might be used alone or in multi-modal combinations to detect and distinguish predators but studies investigating multi-modal integration in predator avoidance are scarce. Here, we used wild, naive tadpoles of the Neotropical poison frog Allobates femoralis ( Boulenger, 1884) to test their reaction to cues with two modalities from two different sympatrically occurring potential predators: heterospecific predatory Dendrobates tinctorius tadpoles and dragonfly larvae. We presented A. femoralis tadpoles with olfactory or visual cues, or a combination of the two, and compared their reaction to a water control in a between-individual design. In our trials, A. femoralis tadpoles reacted to multi-modal stimuli (a combination of visual and chemical information) originating from dragonfly larvae with avoidance but showed no reaction to uni-modal cues or cues from heterospecific tadpoles. In addition, visual cues from conspecifics increased swimming activity while cues from predators had no effect on tadpole activity. Our results show that A. femoralis tadpoles can innately recognize some predators and probably need both visual and chemical information to effectively avoid them. This is the first study looking at anti-predator behavior in poison frog tadpoles. We discuss how parental care might influence the expression of predator avoidance responses in tadpoles.","lang":"eng"}],"tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_updated":"2023-08-17T06:26:15Z"},{"status":"public","article_type":"original","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","acknowledgement":"We thank Ian Swinburne, Sandy Nandagopal, and Toru Kawanishi for support, discussions, and reagents. We thank Vanessa Barone, Joseph Nasser, and members of the Megason lab for useful comments on the manuscript and general feedback. We are grateful to the Heisenberg and Knaut labs for transgenic fish. Diagrams on the right in the graphical abstract were created using BioRender. This work was supported by NIH R01DC015478 and NIH R01GM107733 to S.G.M. A.M. was supported by Human Frontiers Science Program LTF and NIH K99HD098918.","date_published":"2021-12-22T00:00:00Z","article_processing_charge":"No","title":"Extracellular hyaluronate pressure shaped by cellular tethers drives tissue morphogenesis","language":[{"iso":"eng"}],"publication":"Cell","main_file_link":[{"url":"https://www.biorxiv.org/content/10.1101/2020.09.28.316042","open_access":"1"}],"doi":"10.1016/j.cell.2021.11.025","oa_version":"Preprint","issue":"26","scopus_import":"1","external_id":{"isi":["000735387500002"]},"publication_identifier":{"eissn":["1097-4172"],"issn":["0092-8674"]},"day":"22","oa":1,"date_created":"2021-12-26T23:01:26Z","intvolume":"       184","author":[{"last_name":"Munjal","first_name":"Akankshi","full_name":"Munjal, Akankshi"},{"orcid":"0000-0001-6005-1561","id":"3A9DB764-F248-11E8-B48F-1D18A9856A87","first_name":"Edouard B","last_name":"Hannezo","full_name":"Hannezo, Edouard B"},{"full_name":"Tsai, Tony Y.C.","first_name":"Tony Y.C.","last_name":"Tsai"},{"full_name":"Mitchison, Timothy J.","first_name":"Timothy J.","last_name":"Mitchison"},{"last_name":"Megason","first_name":"Sean G.","full_name":"Megason, Sean G."}],"month":"12","isi":1,"publication_status":"published","_id":"10573","year":"2021","type":"journal_article","publisher":"Elsevier ; Cell Press","department":[{"_id":"EdHa"}],"quality_controlled":"1","abstract":[{"text":"How tissues acquire complex shapes is a fundamental question in biology and regenerative medicine. Zebrafish semicircular canals form from invaginations in the otic epithelium (buds) that extend and fuse to form the hubs of each canal. We find that conventional actomyosin-driven behaviors are not required. Instead, local secretion of hyaluronan, made by the enzymes uridine 5′-diphosphate dehydrogenase (ugdh) and hyaluronan synthase 3 (has3), drives canal morphogenesis. Charged hyaluronate polymers osmotically swell with water and generate isotropic extracellular pressure to deform the overlying epithelium into buds. The mechanical anisotropy needed to shape buds into tubes is conferred by a polarized distribution of actomyosin and E-cadherin-rich membrane tethers, which we term cytocinches. Most work on tissue morphogenesis ascribes actomyosin contractility as the driving force, while the extracellular matrix shapes tissues through differential stiffness. Our work inverts this expectation. Hyaluronate pressure shaped by anisotropic tissue stiffness may be a widespread mechanism for powering morphological change in organogenesis and tissue engineering.","lang":"eng"}],"date_updated":"2023-08-17T06:28:25Z","citation":{"chicago":"Munjal, Akankshi, Edouard B Hannezo, Tony Y.C. Tsai, Timothy J. Mitchison, and Sean G. Megason. “Extracellular Hyaluronate Pressure Shaped by Cellular Tethers Drives Tissue Morphogenesis.” <i>Cell</i>. Elsevier ; Cell Press, 2021. <a href=\"https://doi.org/10.1016/j.cell.2021.11.025\">https://doi.org/10.1016/j.cell.2021.11.025</a>.","ama":"Munjal A, Hannezo EB, Tsai TYC, Mitchison TJ, Megason SG. Extracellular hyaluronate pressure shaped by cellular tethers drives tissue morphogenesis. <i>Cell</i>. 2021;184(26):6313-6325.e18. doi:<a href=\"https://doi.org/10.1016/j.cell.2021.11.025\">10.1016/j.cell.2021.11.025</a>","ieee":"A. Munjal, E. B. Hannezo, T. Y. C. Tsai, T. J. Mitchison, and S. G. Megason, “Extracellular hyaluronate pressure shaped by cellular tethers drives tissue morphogenesis,” <i>Cell</i>, vol. 184, no. 26. Elsevier ; Cell Press, p. 6313–6325.e18, 2021.","short":"A. Munjal, E.B. Hannezo, T.Y.C. Tsai, T.J. Mitchison, S.G. Megason, Cell 184 (2021) 6313–6325.e18.","mla":"Munjal, Akankshi, et al. “Extracellular Hyaluronate Pressure Shaped by Cellular Tethers Drives Tissue Morphogenesis.” <i>Cell</i>, vol. 184, no. 26, Elsevier ; Cell Press, 2021, p. 6313–6325.e18, doi:<a href=\"https://doi.org/10.1016/j.cell.2021.11.025\">10.1016/j.cell.2021.11.025</a>.","apa":"Munjal, A., Hannezo, E. B., Tsai, T. Y. C., Mitchison, T. J., &#38; Megason, S. G. (2021). Extracellular hyaluronate pressure shaped by cellular tethers drives tissue morphogenesis. <i>Cell</i>. Elsevier ; Cell Press. <a href=\"https://doi.org/10.1016/j.cell.2021.11.025\">https://doi.org/10.1016/j.cell.2021.11.025</a>","ista":"Munjal A, Hannezo EB, Tsai TYC, Mitchison TJ, Megason SG. 2021. Extracellular hyaluronate pressure shaped by cellular tethers drives tissue morphogenesis. Cell. 184(26), 6313–6325.e18."},"page":"6313-6325.e18","volume":184},{"department":[{"_id":"BeBi"}],"publisher":"Springer Nature","page":"2975-2987","citation":{"ista":"Chen B, Wang C, Piovarci M, Seidel HP, Didyk P, Myszkowski K, Serrano A. 2021. The effect of geometry and illumination on appearance perception of different material categories. Visual Computer. 37(12), 2975–2987.","apa":"Chen, B., Wang, C., Piovarci, M., Seidel, H. P., Didyk, P., Myszkowski, K., &#38; Serrano, A. (2021). The effect of geometry and illumination on appearance perception of different material categories. <i>Visual Computer</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00371-021-02227-x\">https://doi.org/10.1007/s00371-021-02227-x</a>","mla":"Chen, Bin, et al. “The Effect of Geometry and Illumination on Appearance Perception of Different Material Categories.” <i>Visual Computer</i>, vol. 37, no. 12, Springer Nature, 2021, pp. 2975–87, doi:<a href=\"https://doi.org/10.1007/s00371-021-02227-x\">10.1007/s00371-021-02227-x</a>.","ieee":"B. Chen <i>et al.</i>, “The effect of geometry and illumination on appearance perception of different material categories,” <i>Visual Computer</i>, vol. 37, no. 12. Springer Nature, pp. 2975–2987, 2021.","chicago":"Chen, Bin, Chao Wang, Michael Piovarci, Hans Peter Seidel, Piotr Didyk, Karol Myszkowski, and Ana Serrano. “The Effect of Geometry and Illumination on Appearance Perception of Different Material Categories.” <i>Visual Computer</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/s00371-021-02227-x\">https://doi.org/10.1007/s00371-021-02227-x</a>.","short":"B. Chen, C. Wang, M. Piovarci, H.P. Seidel, P. Didyk, K. Myszkowski, A. Serrano, Visual Computer 37 (2021) 2975–2987.","ama":"Chen B, Wang C, Piovarci M, et al. The effect of geometry and illumination on appearance perception of different material categories. <i>Visual Computer</i>. 2021;37(12):2975-2987. doi:<a href=\"https://doi.org/10.1007/s00371-021-02227-x\">10.1007/s00371-021-02227-x</a>"},"volume":37,"abstract":[{"lang":"eng","text":"The understanding of material appearance perception is a complex problem due to interactions between material reflectance, surface geometry, and illumination. Recently, Serrano et al. collected the largest dataset to date with subjective ratings of material appearance attributes, including glossiness, metallicness, sharpness and contrast of reflections. In this work, we make use of their dataset to investigate for the first time the impact of the interactions between illumination, geometry, and eight different material categories in perceived appearance attributes. After an initial analysis, we select for further analysis the four material categories that cover the largest range for all perceptual attributes: fabric, plastic, ceramic, and metal. Using a cumulative link mixed model (CLMM) for robust regression, we discover interactions between these material categories and four representative illuminations and object geometries. We believe that our findings contribute to expanding the knowledge on material appearance perception and can be useful for many applications, such as scene design, where any particular material in a given shape can be aligned with dominant classes of illumination, so that a desired strength of appearance attributes can be achieved."}],"date_updated":"2023-08-17T06:29:34Z","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"quality_controlled":"1","has_accepted_license":"1","month":"12","isi":1,"publication_status":"published","author":[{"full_name":"Chen, Bin","first_name":"Bin","last_name":"Chen"},{"full_name":"Wang, Chao","last_name":"Wang","first_name":"Chao"},{"id":"62E473F4-5C99-11EA-A40E-AF823DDC885E","orcid":"0000-0002-5062-4474","first_name":"Michael","last_name":"Piovarci","full_name":"Piovarci, Michael"},{"full_name":"Seidel, Hans Peter","first_name":"Hans Peter","last_name":"Seidel"},{"first_name":"Piotr","last_name":"Didyk","full_name":"Didyk, Piotr"},{"last_name":"Myszkowski","first_name":"Karol","full_name":"Myszkowski, Karol"},{"full_name":"Serrano, Ana","first_name":"Ana","last_name":"Serrano"}],"intvolume":"        37","date_created":"2021-12-26T23:01:26Z","type":"journal_article","year":"2021","_id":"10574","file":[{"file_name":"2021_VisComput_Chen.pdf","file_id":"10578","checksum":"244cfcac0479ca6e3444c098ab2860a1","date_updated":"2021-12-27T13:51:08Z","access_level":"open_access","content_type":"application/pdf","relation":"main_file","creator":"cchlebak","success":1,"file_size":5741094,"date_created":"2021-12-27T13:51:08Z"}],"publication_identifier":{"issn":["0178-2789"],"eissn":["1432-2315"]},"issue":"12","scopus_import":"1","external_id":{"isi":["000673536600003"]},"doi":"10.1007/s00371-021-02227-x","oa_version":"Published Version","day":"01","oa":1,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","date_published":"2021-12-01T00:00:00Z","acknowledgement":"This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie, grant agreement N∘ 765911 (RealVision) and from the European Research Council (ERC), grant agreement N∘ 804226 (PERDY). Open Access funding enabled and organized by Projekt DEAL.","article_type":"original","status":"public","ddc":["000"],"file_date_updated":"2021-12-27T13:51:08Z","language":[{"iso":"eng"}],"publication":"Visual Computer","title":"The effect of geometry and illumination on appearance perception of different material categories","article_processing_charge":"Yes"},{"abstract":[{"lang":"eng","text":"The choice of the boundary conditions in mechanical problems has to reflect the interaction of the considered material with the surface. Still the assumption of the no-slip condition is preferred in order to avoid boundary terms in the analysis and slipping effects are usually overlooked. Besides the “static slip models”, there are phenomena that are not accurately described by them, e.g. at the moment when the slip changes rapidly, the wall shear stress and the slip can exhibit a sudden overshoot and subsequent relaxation. When these effects become significant, the so-called dynamic slip phenomenon occurs. We develop a mathematical analysis of Navier–Stokes-like problems with a dynamic slip boundary condition, which requires a proper generalization of the Gelfand triplet and the corresponding function space setting."}],"tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)"},"date_updated":"2023-08-17T06:29:01Z","quality_controlled":"1","has_accepted_license":"1","page":"2165-2212","volume":31,"citation":{"ista":"Abbatiello A, Bulíček M, Maringová E. 2021. On the dynamic slip boundary condition for Navier-Stokes-like problems. Mathematical Models and Methods in Applied Sciences. 31(11), 2165–2212.","apa":"Abbatiello, A., Bulíček, M., &#38; Maringová, E. (2021). On the dynamic slip boundary condition for Navier-Stokes-like problems. <i>Mathematical Models and Methods in Applied Sciences</i>. World Scientific Publishing. <a href=\"https://doi.org/10.1142/S0218202521500470\">https://doi.org/10.1142/S0218202521500470</a>","mla":"Abbatiello, Anna, et al. “On the Dynamic Slip Boundary Condition for Navier-Stokes-like Problems.” <i>Mathematical Models and Methods in Applied Sciences</i>, vol. 31, no. 11, World Scientific Publishing, 2021, pp. 2165–212, doi:<a href=\"https://doi.org/10.1142/S0218202521500470\">10.1142/S0218202521500470</a>.","ama":"Abbatiello A, Bulíček M, Maringová E. On the dynamic slip boundary condition for Navier-Stokes-like problems. <i>Mathematical Models and Methods in Applied Sciences</i>. 2021;31(11):2165-2212. doi:<a href=\"https://doi.org/10.1142/S0218202521500470\">10.1142/S0218202521500470</a>","chicago":"Abbatiello, Anna, Miroslav Bulíček, and Erika Maringová. “On the Dynamic Slip Boundary Condition for Navier-Stokes-like Problems.” <i>Mathematical Models and Methods in Applied Sciences</i>. World Scientific Publishing, 2021. <a href=\"https://doi.org/10.1142/S0218202521500470\">https://doi.org/10.1142/S0218202521500470</a>.","short":"A. Abbatiello, M. Bulíček, E. Maringová, Mathematical Models and Methods in Applied Sciences 31 (2021) 2165–2212.","ieee":"A. Abbatiello, M. Bulíček, and E. Maringová, “On the dynamic slip boundary condition for Navier-Stokes-like problems,” <i>Mathematical Models and Methods in Applied Sciences</i>, vol. 31, no. 11. World Scientific Publishing, pp. 2165–2212, 2021."},"publisher":"World Scientific Publishing","department":[{"_id":"JuFi"}],"type":"journal_article","_id":"10575","year":"2021","intvolume":"        31","date_created":"2021-12-26T23:01:27Z","month":"10","isi":1,"project":[{"grant_number":"F6504","name":"Taming Complexity in Partial Differential Systems","_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2"},{"name":"Dissipation and Dispersion in Nonlinear Partial Differential Equations","_id":"260788DE-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"publication_status":"published","author":[{"full_name":"Abbatiello, Anna","first_name":"Anna","last_name":"Abbatiello"},{"full_name":"Bulíček, Miroslav","last_name":"Bulíček","first_name":"Miroslav"},{"full_name":"Maringová, Erika","first_name":"Erika","last_name":"Maringová","id":"dbabca31-66eb-11eb-963a-fb9c22c880b4"}],"day":"13","oa":1,"doi":"10.1142/S0218202521500470","oa_version":"Published Version","file":[{"relation":"main_file","content_type":"application/pdf","file_id":"11385","checksum":"8c0a9396335f0b70e1f5cbfe450a987a","access_level":"open_access","date_updated":"2022-05-16T10:55:45Z","file_name":"2021_MathModelsMethods_Abbatiello.pdf","date_created":"2022-05-16T10:55:45Z","file_size":795483,"creator":"dernst","success":1}],"publication_identifier":{"eissn":["1793-6314"],"issn":["0218-2025"]},"issue":"11","scopus_import":"1","external_id":{"arxiv":["2009.09057"],"isi":["000722309400001"]},"language":[{"iso":"eng"}],"publication":"Mathematical Models and Methods in Applied Sciences","arxiv":1,"article_processing_charge":"No","title":"On the dynamic slip boundary condition for Navier-Stokes-like problems","file_date_updated":"2022-05-16T10:55:45Z","status":"public","ddc":["510"],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","acknowledgement":"The research of A. Abbatiello is supported by Einstein Foundation, Berlin. A. Abbatiello is also member of the Italian National Group for the Mathematical Physics (GNFM) of INdAM. M. Bulíček acknowledges the support of the project No. 20-11027X financed by Czech Science Foundation (GACR). M. Bulíček is member of the Jindřich Nečas Center for Mathematical Modelling. E. Maringová acknowledges support from Charles University Research program UNCE/SCI/023, the grant SVV-2020-260583 by the Ministry of Education, Youth and Sports, Czech Republic and from the Austrian Science Fund (FWF), grants P30000, W1245, and F65.","date_published":"2021-10-13T00:00:00Z","article_type":"original"},{"language":[{"iso":"eng"}],"publication":"arXiv","arxiv":1,"title":"Token-driven totally asymmetric simple exclusion process","article_processing_charge":"No","main_file_link":[{"url":"https://arxiv.org/abs/2112.13558","open_access":"1"}],"article_number":"2112.13558","type":"preprint","_id":"10579","year":"2021","status":"public","date_created":"2021-12-28T06:52:09Z","ddc":["530"],"month":"12","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"submitted","date_published":"2021-12-27T00:00:00Z","acknowledgement":"B.K. thanks Stefano Elefante, Simon Rella, and Michal Hledík for their help with the usage of the cluster. B.K. additionally thanks Călin Guet and his group for help and advice. We thank M. Hennessey-Wesen for constructive comments on the manuscript. We thank Ankita Gupta (Indian Institute of Technology) for spotting a typographical error in Eq. (49) in the preprint version of this paper.","author":[{"orcid":"0000-0001-6041-254X","id":"350F91D2-F248-11E8-B48F-1D18A9856A87","full_name":"Kavcic, Bor","last_name":"Kavcic","first_name":"Bor"},{"last_name":"Tkačik","first_name":"Gašper","full_name":"Tkačik, Gašper","orcid":"0000-0002-6699-1455","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87"}],"abstract":[{"text":"We consider a totally asymmetric simple exclusion process (TASEP) consisting of particles on a lattice that require binding by a \"token\" to move. Using a combination of theory and simulations, we address the following questions: (i) How token binding kinetics affects the current-density relation; (ii) How the current-density relation depends on the scarcity of tokens; (iii) How tokens propagate the effects of the locally-imposed disorder (such a slow site) over the entire lattice; (iv) How a shared pool of tokens couples concurrent TASEPs running on multiple lattices; (v) How our results translate to TASEPs with open boundaries that exchange particles with the reservoir. Since real particle motion (including in systems that inspired the standard TASEP model, e.g., protein synthesis or movement of molecular motors) is often catalyzed, regulated, actuated, or otherwise mediated, the token-driven TASEP dynamics analyzed in this paper should allow for a better understanding of real systems and enable a closer match between TASEP theory and experimental observations.","lang":"eng"}],"tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)"},"date_updated":"2023-05-03T10:54:05Z","has_accepted_license":"1","day":"27","oa":1,"citation":{"ista":"Kavcic B, Tkačik G. Token-driven totally asymmetric simple exclusion process. arXiv, 2112.13558.","short":"B. Kavcic, G. Tkačik, ArXiv (n.d.).","chicago":"Kavcic, Bor, and Gašper Tkačik. “Token-Driven Totally Asymmetric Simple Exclusion Process.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2112.13558\">https://doi.org/10.48550/arXiv.2112.13558</a>.","ama":"Kavcic B, Tkačik G. Token-driven totally asymmetric simple exclusion process. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2112.13558\">10.48550/arXiv.2112.13558</a>","ieee":"B. Kavcic and G. Tkačik, “Token-driven totally asymmetric simple exclusion process,” <i>arXiv</i>. .","mla":"Kavcic, Bor, and Gašper Tkačik. “Token-Driven Totally Asymmetric Simple Exclusion Process.” <i>ArXiv</i>, 2112.13558, doi:<a href=\"https://doi.org/10.48550/arXiv.2112.13558\">10.48550/arXiv.2112.13558</a>.","apa":"Kavcic, B., &#38; Tkačik, G. (n.d.). Token-driven totally asymmetric simple exclusion process. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2112.13558\">https://doi.org/10.48550/arXiv.2112.13558</a>"},"doi":"10.48550/arXiv.2112.13558","oa_version":"Preprint","department":[{"_id":"GaTk"}],"external_id":{"arxiv":["2112.13558"]}},{"keyword":["anyons","quasiparticles","Quantum Hall Effect","topological states of matter"],"department":[{"_id":"MiLe"},{"_id":"RoSe"}],"publisher":"MDPI","volume":9,"citation":{"ista":"Brooks M, Lemeshko M, Lundholm D, Yakaboylu E. 2021. Emergence of anyons on the two-sphere in molecular impurities. Atoms. 9(4), 106.","mla":"Brooks, Morris, et al. “Emergence of Anyons on the Two-Sphere in Molecular Impurities.” <i>Atoms</i>, vol. 9, no. 4, 106, MDPI, 2021, doi:<a href=\"https://doi.org/10.3390/atoms9040106\">10.3390/atoms9040106</a>.","apa":"Brooks, M., Lemeshko, M., Lundholm, D., &#38; Yakaboylu, E. (2021). Emergence of anyons on the two-sphere in molecular impurities. <i>Atoms</i>. MDPI. <a href=\"https://doi.org/10.3390/atoms9040106\">https://doi.org/10.3390/atoms9040106</a>","short":"M. Brooks, M. Lemeshko, D. Lundholm, E. Yakaboylu, Atoms 9 (2021).","ieee":"M. Brooks, M. Lemeshko, D. Lundholm, and E. Yakaboylu, “Emergence of anyons on the two-sphere in molecular impurities,” <i>Atoms</i>, vol. 9, no. 4. MDPI, 2021.","ama":"Brooks M, Lemeshko M, Lundholm D, Yakaboylu E. Emergence of anyons on the two-sphere in molecular impurities. <i>Atoms</i>. 2021;9(4). doi:<a href=\"https://doi.org/10.3390/atoms9040106\">10.3390/atoms9040106</a>","chicago":"Brooks, Morris, Mikhail Lemeshko, Douglas Lundholm, and Enderalp Yakaboylu. “Emergence of Anyons on the Two-Sphere in Molecular Impurities.” <i>Atoms</i>. MDPI, 2021. <a href=\"https://doi.org/10.3390/atoms9040106\">https://doi.org/10.3390/atoms9040106</a>."},"tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_updated":"2023-06-15T14:51:49Z","abstract":[{"text":"Recently it was shown that anyons on the two-sphere naturally arise from a system of molecular impurities exchanging angular momentum with a many-particle bath (Phys. Rev. Lett. 126, 015301 (2021)). Here we further advance this approach and rigorously demonstrate that in the experimentally realized regime the lowest spectrum of two linear molecules immersed in superfluid helium corresponds to the spectrum of two anyons on the sphere. We develop the formalism within the framework of the recently experimentally observed angulon quasiparticle","lang":"eng"}],"quality_controlled":"1","has_accepted_license":"1","publication_status":"published","month":"12","author":[{"first_name":"Morris","last_name":"Brooks","full_name":"Brooks, Morris","id":"B7ECF9FC-AA38-11E9-AC9A-0930E6697425","orcid":"0000-0002-6249-0928"},{"first_name":"Mikhail","last_name":"Lemeshko","full_name":"Lemeshko, Mikhail","orcid":"0000-0002-6990-7802","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Lundholm, Douglas","last_name":"Lundholm","first_name":"Douglas"},{"orcid":"0000-0001-5973-0874","id":"38CB71F6-F248-11E8-B48F-1D18A9856A87","full_name":"Yakaboylu, Enderalp","last_name":"Yakaboylu","first_name":"Enderalp"}],"intvolume":"         9","date_created":"2022-01-02T23:01:33Z","type":"journal_article","article_number":"106","_id":"10585","year":"2021","publication_identifier":{"eissn":["2218-2004"]},"file":[{"file_name":"2021_Atoms_Brooks.pdf","relation":"main_file","content_type":"application/pdf","checksum":"d0e44b95f36c9e06724f66832af0f8c3","file_id":"10592","date_updated":"2022-01-03T10:15:05Z","access_level":"open_access","creator":"alisjak","success":1,"date_created":"2022-01-03T10:15:05Z","file_size":303070}],"external_id":{"arxiv":["2108.06966"]},"issue":"4","scopus_import":"1","oa_version":"Published Version","doi":"10.3390/atoms9040106","oa":1,"day":"02","acknowledgement":"D. Lundholm acknowledges financial support from the Göran Gustafsson Foundation (grant no. 1804).","date_published":"2021-12-02T00:00:00Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","article_type":"original","status":"public","ddc":["530"],"file_date_updated":"2022-01-03T10:15:05Z","publication":"Atoms","language":[{"iso":"eng"}],"article_processing_charge":"Yes","title":"Emergence of anyons on the two-sphere in molecular impurities","arxiv":1},{"article_type":"original","date_published":"2021-12-03T00:00:00Z","acknowledgement":"The authors extend their appreciation to King Saud University for funding this work through Researchers Supporting Project number (RSP-2021/387), King Saud University, Riyadh, Saudi Arabia.","alternative_title":["Hybrid and Composite Crystalline Materials"],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","ddc":["620"],"status":"public","file_date_updated":"2022-01-03T09:46:53Z","article_processing_charge":"No","title":"Fe2O3 nanoparticles deposited over self-floating facial sponge for facile interfacial seawater solar desalination","publication":"Crystals","language":[{"iso":"eng"}],"external_id":{"isi":["000736602200001"]},"issue":"12","scopus_import":"1","publication_identifier":{"eissn":["2073-4352"]},"file":[{"date_created":"2022-01-03T09:46:53Z","file_size":4569639,"creator":"alisjak","success":1,"content_type":"application/pdf","relation":"main_file","file_id":"10591","checksum":"668e9d777608ce0a3bc2e305133bd06b","date_updated":"2022-01-03T09:46:53Z","access_level":"open_access","file_name":"2021_Crystals_Yuzheng.pdf"}],"oa_version":"Published Version","doi":"10.3390/cryst11121509","oa":1,"day":"03","author":[{"last_name":"Lu","first_name":"Yuzheng","full_name":"Lu, Yuzheng"},{"last_name":"Arshad","first_name":"Naila","full_name":"Arshad, Naila"},{"first_name":"Muhammad Sultan","last_name":"Irshad","full_name":"Irshad, Muhammad Sultan"},{"full_name":"Ahmed, Iftikhar","last_name":"Ahmed","first_name":"Iftikhar"},{"full_name":"Ahmad, Shafiq","last_name":"Ahmad","first_name":"Shafiq"},{"full_name":"Alshahrani, Lina Abdullah","last_name":"Alshahrani","first_name":"Lina Abdullah"},{"full_name":"Yousaf, Muhammad","first_name":"Muhammad","last_name":"Yousaf"},{"last_name":"Sayed","first_name":"Abdelaty Edrees","full_name":"Sayed, Abdelaty Edrees"},{"last_name":"Nauman","first_name":"Muhammad","full_name":"Nauman, Muhammad","id":"32c21954-2022-11eb-9d5f-af9f93c24e71","orcid":"0000-0002-2111-4846"}],"publication_status":"published","month":"12","isi":1,"date_created":"2022-01-02T23:01:34Z","intvolume":"        11","year":"2021","_id":"10586","type":"journal_article","article_number":"1509","department":[{"_id":"KiMo"}],"publisher":"MDPI","volume":11,"citation":{"apa":"Lu, Y., Arshad, N., Irshad, M. S., Ahmed, I., Ahmad, S., Alshahrani, L. A., … Nauman, M. (2021). Fe2O3 nanoparticles deposited over self-floating facial sponge for facile interfacial seawater solar desalination. <i>Crystals</i>. MDPI. <a href=\"https://doi.org/10.3390/cryst11121509\">https://doi.org/10.3390/cryst11121509</a>","mla":"Lu, Yuzheng, et al. “Fe2O3 Nanoparticles Deposited over Self-Floating Facial Sponge for Facile Interfacial Seawater Solar Desalination.” <i>Crystals</i>, vol. 11, no. 12, 1509, MDPI, 2021, doi:<a href=\"https://doi.org/10.3390/cryst11121509\">10.3390/cryst11121509</a>.","chicago":"Lu, Yuzheng, Naila Arshad, Muhammad Sultan Irshad, Iftikhar Ahmed, Shafiq Ahmad, Lina Abdullah Alshahrani, Muhammad Yousaf, Abdelaty Edrees Sayed, and Muhammad Nauman. “Fe2O3 Nanoparticles Deposited over Self-Floating Facial Sponge for Facile Interfacial Seawater Solar Desalination.” <i>Crystals</i>. MDPI, 2021. <a href=\"https://doi.org/10.3390/cryst11121509\">https://doi.org/10.3390/cryst11121509</a>.","ieee":"Y. Lu <i>et al.</i>, “Fe2O3 nanoparticles deposited over self-floating facial sponge for facile interfacial seawater solar desalination,” <i>Crystals</i>, vol. 11, no. 12. MDPI, 2021.","short":"Y. Lu, N. Arshad, M.S. Irshad, I. Ahmed, S. Ahmad, L.A. Alshahrani, M. Yousaf, A.E. Sayed, M. Nauman, Crystals 11 (2021).","ama":"Lu Y, Arshad N, Irshad MS, et al. Fe2O3 nanoparticles deposited over self-floating facial sponge for facile interfacial seawater solar desalination. <i>Crystals</i>. 2021;11(12). doi:<a href=\"https://doi.org/10.3390/cryst11121509\">10.3390/cryst11121509</a>","ista":"Lu Y, Arshad N, Irshad MS, Ahmed I, Ahmad S, Alshahrani LA, Yousaf M, Sayed AE, Nauman M. 2021. Fe2O3 nanoparticles deposited over self-floating facial sponge for facile interfacial seawater solar desalination. Crystals. 11(12), 1509."},"has_accepted_license":"1","quality_controlled":"1","date_updated":"2023-08-17T06:31:20Z","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"abstract":[{"lang":"eng","text":"A facile approach for developing an interfacial solar evaporator by heat localization of solar-thermal energy conversion at water-air liquid composed by in-situ polymerization of Fe2O3 nanoparticles (Fe2O3@PPy) deposited over a facial sponge is proposed. The demonstrated system consists of a floating solar receiver having a vertically cross-linked microchannel for wicking up saline water. The in situ polymerized Fe2O3@PPy interfacial layer promotes diffuse reflection and its rough black surface allows Omni-directional solar absorption (94%) and facilitates efficient thermal localization at the water/air interface and offers a defect-rich surface to promote heat localization (41.9 °C) and excellent thermal management due to cellulosic content. The self-floating composite foam reveals continuous vapors generation at a rate of 1.52 kg m−2 h−1 under one 1 kW m−2 and profound evaporating efficiency (95%) without heat losses that dissipates in its surroundings. Indeed, long-term evaporation experiments reveal the negligible disparity in continuous evaporation rate (33.84 kg m−2/8.3 h) receiving two sun solar intensity, and ensures the stability of the device under intense seawater conditions synchronized with excellent salt rejection potential. More importantly, Raman spectroscopy investigation validates the orange dye rejection via Fe2O3@PPy solar evaporator. The combined advantages of high efficiency, self-floating capability, multimedia rejection, low cost, and this configuration are promising for producing large-scale solar steam generating systems appropriate for commercial clean water yield due to their scalable fabrication."}]},{"scopus_import":"1","external_id":{"arxiv":["2106.02356"]},"publication_identifier":{"isbn":["9781713845393"],"issn":["1049-5258"]},"oa_version":"Preprint","day":"01","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"M. Mondelli would like to thank László Erdős for helpful discussions. M. Mondelli was partially supported by the 2019 Lopez-Loreta Prize. R. Venkataramanan was partially supported by the Alan Turing Institute under the EPSRC grant EP/N510129/1.\r\n","date_published":"2021-12-01T00:00:00Z","status":"public","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2106.02356"}],"arxiv":1,"article_processing_charge":"No","title":"PCA initialization for approximate message passing in rotationally invariant models","language":[{"iso":"eng"}],"publication":"35th Conference on Neural Information Processing Systems","department":[{"_id":"MaMo"}],"publisher":"Neural Information Processing Systems Foundation","conference":{"end_date":"2021-12-14","start_date":"2021-12-06","location":"Virtual","name":"NeurIPS: Neural Information Processing Systems"},"citation":{"ista":"Mondelli M, Venkataramanan R. 2021. PCA initialization for approximate message passing in rotationally invariant models. 35th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems vol. 35, 29616–29629.","apa":"Mondelli, M., &#38; Venkataramanan, R. (2021). PCA initialization for approximate message passing in rotationally invariant models. In <i>35th Conference on Neural Information Processing Systems</i> (Vol. 35, pp. 29616–29629). Virtual: Neural Information Processing Systems Foundation.","mla":"Mondelli, Marco, and Ramji Venkataramanan. “PCA Initialization for Approximate Message Passing in Rotationally Invariant Models.” <i>35th Conference on Neural Information Processing Systems</i>, vol. 35, Neural Information Processing Systems Foundation, 2021, pp. 29616–29.","short":"M. Mondelli, R. Venkataramanan, in:, 35th Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2021, pp. 29616–29629.","ama":"Mondelli M, Venkataramanan R. PCA initialization for approximate message passing in rotationally invariant models. In: <i>35th Conference on Neural Information Processing Systems</i>. Vol 35. Neural Information Processing Systems Foundation; 2021:29616-29629.","ieee":"M. Mondelli and R. Venkataramanan, “PCA initialization for approximate message passing in rotationally invariant models,” in <i>35th Conference on Neural Information Processing Systems</i>, Virtual, 2021, vol. 35, pp. 29616–29629.","chicago":"Mondelli, Marco, and Ramji Venkataramanan. “PCA Initialization for Approximate Message Passing in Rotationally Invariant Models.” In <i>35th Conference on Neural Information Processing Systems</i>, 35:29616–29. Neural Information Processing Systems Foundation, 2021."},"page":"29616-29629","volume":35,"quality_controlled":"1","abstract":[{"text":"We study the problem of estimating a rank-$1$ signal in the presence of rotationally invariant noise-a class of perturbations more general than Gaussian noise. Principal Component Analysis (PCA) provides a natural estimator, and sharp results on its performance have been obtained in the high-dimensional regime. Recently, an Approximate Message Passing (AMP) algorithm has been proposed as an alternative estimator with the potential to improve the accuracy of PCA. However, the existing analysis of AMP requires an initialization that is both correlated with the signal and independent of the noise, which is often unrealistic in practice. In this work, we combine the two methods, and propose to initialize AMP with PCA. Our main result is a rigorous asymptotic characterization of the performance of this estimator. Both the AMP algorithm and its analysis differ from those previously derived in the Gaussian setting: at every iteration, our AMP algorithm requires a specific term to account for PCA initialization, while in the Gaussian case, PCA initialization affects only the first iteration of AMP. The proof is based on a two-phase artificial AMP that first approximates the PCA estimator and then mimics the true AMP. Our numerical simulations show an excellent agreement between AMP results and theoretical predictions, and suggest an interesting open direction on achieving Bayes-optimal performance.","lang":"eng"}],"date_updated":"2024-09-10T13:03:19Z","author":[{"id":"27EB676C-8706-11E9-9510-7717E6697425","orcid":"0000-0002-3242-7020","last_name":"Mondelli","first_name":"Marco","full_name":"Mondelli, Marco"},{"full_name":"Venkataramanan, Ramji","first_name":"Ramji","last_name":"Venkataramanan"}],"month":"12","project":[{"name":"Prix Lopez-Loretta 2019 - Marco Mondelli","_id":"059876FA-7A3F-11EA-A408-12923DDC885E"}],"publication_status":"published","date_created":"2022-01-03T10:50:02Z","intvolume":"        35","_id":"10593","year":"2021","type":"conference"},{"conference":{"name":"35th Conference on Neural Information Processing Systems","location":"Virtual","start_date":"2021-12-06","end_date":"2021-12-14"},"publisher":"Neural Information Processing Systems Foundation","department":[{"_id":"MaMo"}],"date_updated":"2024-09-10T13:03:19Z","abstract":[{"lang":"eng","text":"The question of how and why the phenomenon of mode connectivity occurs in training deep neural networks has gained remarkable attention in the research community. From a theoretical perspective, two possible explanations have been proposed: (i) the loss function has connected sublevel sets, and (ii) the solutions found by stochastic gradient descent are dropout stable. While these explanations provide insights into the phenomenon, their assumptions are not always satisfied in practice. In particular, the first approach requires the network to have one layer with order of N neurons (N being the number of training samples), while the second one requires the loss to be almost invariant after removing half of the neurons at each layer (up to some rescaling of the remaining ones). In this work, we improve both conditions by exploiting the quality of the features at every intermediate layer together with a milder over-parameterization condition. More specifically, we show that: (i) under generic assumptions on the features of intermediate layers, it suffices that the last two hidden layers have order of N−−√ neurons, and (ii) if subsets of features at each layer are linearly separable, then no over-parameterization is needed to show the connectivity. Our experiments confirm that the proposed condition ensures the connectivity of solutions found by stochastic gradient descent, even in settings where the previous requirements do not hold."}],"quality_controlled":"1","citation":{"chicago":"Nguyen, Quynh, Pierre Bréchet, and Marco Mondelli. “When Are Solutions Connected in Deep Networks?” In <i>35th Conference on Neural Information Processing Systems</i>, Vol. 35. Neural Information Processing Systems Foundation, 2021.","ama":"Nguyen Q, Bréchet P, Mondelli M. When are solutions connected in deep networks? In: <i>35th Conference on Neural Information Processing Systems</i>. Vol 35. Neural Information Processing Systems Foundation; 2021.","ieee":"Q. Nguyen, P. Bréchet, and M. Mondelli, “When are solutions connected in deep networks?,” in <i>35th Conference on Neural Information Processing Systems</i>, Virtual, 2021, vol. 35.","short":"Q. Nguyen, P. Bréchet, M. Mondelli, in:, 35th Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2021.","apa":"Nguyen, Q., Bréchet, P., &#38; Mondelli, M. (2021). When are solutions connected in deep networks? In <i>35th Conference on Neural Information Processing Systems</i> (Vol. 35). Virtual: Neural Information Processing Systems Foundation.","mla":"Nguyen, Quynh, et al. “When Are Solutions Connected in Deep Networks?” <i>35th Conference on Neural Information Processing Systems</i>, vol. 35, Neural Information Processing Systems Foundation, 2021.","ista":"Nguyen Q, Bréchet P, Mondelli M. 2021. When are solutions connected in deep networks? 35th Conference on Neural Information Processing Systems. 35th Conference on Neural Information Processing Systems vol. 35."},"volume":35,"intvolume":"        35","date_created":"2022-01-03T10:56:20Z","project":[{"name":"Prix Lopez-Loretta 2019 - Marco Mondelli","_id":"059876FA-7A3F-11EA-A408-12923DDC885E"}],"publication_status":"published","month":"12","author":[{"full_name":"Nguyen, Quynh","first_name":"Quynh","last_name":"Nguyen"},{"last_name":"Bréchet","first_name":"Pierre","full_name":"Bréchet, Pierre"},{"orcid":"0000-0002-3242-7020","id":"27EB676C-8706-11E9-9510-7717E6697425","last_name":"Mondelli","first_name":"Marco","full_name":"Mondelli, Marco"}],"type":"conference","year":"2021","_id":"10594","oa_version":"Preprint","publication_identifier":{"isbn":["9781713845393"],"issn":["1049-5258"]},"external_id":{"arxiv":["2102.09671"]},"oa":1,"day":"01","status":"public","date_published":"2021-12-01T00:00:00Z","acknowledgement":"MM was partially supported by the 2019 Lopez-Loreta Prize. QN and PB acknowledge support from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement no 757983).","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"35th Conference on Neural Information Processing Systems","language":[{"iso":"eng"}],"title":"When are solutions connected in deep networks?","article_processing_charge":"No","arxiv":1,"main_file_link":[{"url":"https://arxiv.org/abs/2102.09671","open_access":"1"}]},{"type":"conference","year":"2021","_id":"10595","intvolume":"       139","date_created":"2022-01-03T10:57:49Z","publication_status":"published","project":[{"_id":"059876FA-7A3F-11EA-A408-12923DDC885E","name":"Prix Lopez-Loretta 2019 - Marco Mondelli"}],"author":[{"full_name":"Nguyen, Quynh","first_name":"Quynh","last_name":"Nguyen"},{"orcid":"0000-0002-3242-7020","id":"27EB676C-8706-11E9-9510-7717E6697425","full_name":"Mondelli, Marco","last_name":"Mondelli","first_name":"Marco"},{"full_name":"Montufar, Guido F","last_name":"Montufar","first_name":"Guido F"}],"date_updated":"2024-09-10T13:03:17Z","abstract":[{"lang":"eng","text":"A recent line of work has analyzed the theoretical properties of deep neural networks via the Neural Tangent Kernel (NTK). In particular, the smallest eigenvalue of the NTK has been related to the memorization capacity, the global convergence of gradient descent algorithms and the generalization of deep nets. However, existing results either provide bounds in the two-layer setting or assume that the spectrum of the NTK matrices is bounded away from 0 for multi-layer networks. In this paper, we provide tight bounds on the smallest eigenvalue of NTK matrices for deep ReLU nets, both in the limiting case of infinite widths and for finite widths. In the finite-width setting, the network architectures we consider are fairly general: we require the existence of a wide layer with roughly order of $N$ neurons, $N$ being the number of data samples; and the scaling of the remaining layer widths is arbitrary (up to logarithmic factors). To obtain our results, we analyze various quantities of independent interest: we give lower bounds on the smallest singular value of hidden feature matrices, and upper bounds on the Lipschitz constant of input-output feature maps."}],"quality_controlled":"1","citation":{"ieee":"Q. Nguyen, M. Mondelli, and G. F. Montufar, “Tight bounds on the smallest eigenvalue of the neural tangent kernel for deep ReLU networks,” in <i>Proceedings of the 38th International Conference on Machine Learning</i>, Virtual, 2021, vol. 139, pp. 8119–8129.","ama":"Nguyen Q, Mondelli M, Montufar GF. Tight bounds on the smallest eigenvalue of the neural tangent kernel for deep ReLU networks. In: Meila M, Zhang T, eds. <i>Proceedings of the 38th International Conference on Machine Learning</i>. Vol 139. ML Research Press; 2021:8119-8129.","short":"Q. Nguyen, M. Mondelli, G.F. Montufar, in:, M. Meila, T. Zhang (Eds.), Proceedings of the 38th International Conference on Machine Learning, ML Research Press, 2021, pp. 8119–8129.","chicago":"Nguyen, Quynh, Marco Mondelli, and Guido F Montufar. “Tight Bounds on the Smallest Eigenvalue of the Neural Tangent Kernel for Deep ReLU Networks.” In <i>Proceedings of the 38th International Conference on Machine Learning</i>, edited by Marina Meila and Tong Zhang, 139:8119–29. ML Research Press, 2021.","mla":"Nguyen, Quynh, et al. “Tight Bounds on the Smallest Eigenvalue of the Neural Tangent Kernel for Deep ReLU Networks.” <i>Proceedings of the 38th International Conference on Machine Learning</i>, edited by Marina Meila and Tong Zhang, vol. 139, ML Research Press, 2021, pp. 8119–29.","apa":"Nguyen, Q., Mondelli, M., &#38; Montufar, G. F. (2021). Tight bounds on the smallest eigenvalue of the neural tangent kernel for deep ReLU networks. In M. Meila &#38; T. Zhang (Eds.), <i>Proceedings of the 38th International Conference on Machine Learning</i> (Vol. 139, pp. 8119–8129). Virtual: ML Research Press.","ista":"Nguyen Q, Mondelli M, Montufar GF. 2021. Tight bounds on the smallest eigenvalue of the neural tangent kernel for deep ReLU networks. Proceedings of the 38th International Conference on Machine Learning. ICML: International Conference on Machine Learning, Proceedings of Machine Learning Research, vol. 139, 8119–8129."},"volume":139,"page":"8119-8129","conference":{"name":"ICML: International Conference on Machine Learning","end_date":"2021-07-24","start_date":"2021-07-18","location":"Virtual"},"publisher":"ML Research Press","department":[{"_id":"MaMo"}],"publication":"Proceedings of the 38th International Conference on Machine Learning","language":[{"iso":"eng"}],"article_processing_charge":"No","title":"Tight bounds on the smallest eigenvalue of the neural tangent kernel for deep ReLU networks","arxiv":1,"main_file_link":[{"open_access":"1","url":"http://proceedings.mlr.press/v139/nguyen21g.html"}],"editor":[{"full_name":"Meila, Marina","first_name":"Marina","last_name":"Meila"},{"last_name":"Zhang","first_name":"Tong","full_name":"Zhang, Tong"}],"status":"public","acknowledgement":"The authors would like to thank the anonymous reviewers for their helpful comments. MM was partially supported\r\nby the 2019 Lopez-Loreta Prize. QN and GM acknowledge support from the European Research Council (ERC) under\r\nthe European Union’s Horizon 2020 research and innovation programme (grant agreement no 757983).","date_published":"2021-01-01T00:00:00Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","alternative_title":["Proceedings of Machine Learning Research"],"oa":1,"oa_version":"Published Version","external_id":{"arxiv":["2012.11654"]}},{"date_published":"2021-09-01T00:00:00Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","status":"public","main_file_link":[{"url":"https://arxiv.org/abs/2011.12882","open_access":"1"}],"title":"Sparse multi-decoder recursive projection aggregation for Reed-Muller codes","article_processing_charge":"No","arxiv":1,"publication":"2021 IEEE International Symposium on Information Theory","language":[{"iso":"eng"}],"external_id":{"isi":["000701502201029"],"arxiv":["2011.12882"]},"scopus_import":"1","publication_identifier":{"isbn":["978-1-5386-8210-4"],"eisbn":["978-1-5386-8209-8"]},"oa_version":"Preprint","doi":"10.1109/isit45174.2021.9517887","oa":1,"day":"01","author":[{"last_name":"Fathollahi","first_name":"Dorsa","full_name":"Fathollahi, Dorsa"},{"first_name":"Nariman","last_name":"Farsad","full_name":"Farsad, Nariman"},{"last_name":"Hashemi","first_name":"Seyyed Ali","full_name":"Hashemi, Seyyed Ali"},{"orcid":"0000-0002-3242-7020","id":"27EB676C-8706-11E9-9510-7717E6697425","full_name":"Mondelli, Marco","last_name":"Mondelli","first_name":"Marco"}],"publication_status":"published","project":[{"name":"Prix Lopez-Loretta 2019 - Marco Mondelli","_id":"059876FA-7A3F-11EA-A408-12923DDC885E"}],"month":"09","isi":1,"date_created":"2022-01-03T11:31:26Z","year":"2021","_id":"10597","type":"conference","department":[{"_id":"MaMo"}],"publisher":"Institute of Electrical and Electronics Engineers","conference":{"name":"ISIT: International Symposium on Information Theory","end_date":"2021-07-20","start_date":"2021-07-12","location":"Virtual, Melbourne, Australia"},"page":"1082-1087","citation":{"apa":"Fathollahi, D., Farsad, N., Hashemi, S. A., &#38; Mondelli, M. (2021). Sparse multi-decoder recursive projection aggregation for Reed-Muller codes. In <i>2021 IEEE International Symposium on Information Theory</i> (pp. 1082–1087). Virtual, Melbourne, Australia: Institute of Electrical and Electronics Engineers. <a href=\"https://doi.org/10.1109/isit45174.2021.9517887\">https://doi.org/10.1109/isit45174.2021.9517887</a>","mla":"Fathollahi, Dorsa, et al. “Sparse Multi-Decoder Recursive Projection Aggregation for Reed-Muller Codes.” <i>2021 IEEE International Symposium on Information Theory</i>, Institute of Electrical and Electronics Engineers, 2021, pp. 1082–87, doi:<a href=\"https://doi.org/10.1109/isit45174.2021.9517887\">10.1109/isit45174.2021.9517887</a>.","ieee":"D. Fathollahi, N. Farsad, S. A. Hashemi, and M. Mondelli, “Sparse multi-decoder recursive projection aggregation for Reed-Muller codes,” in <i>2021 IEEE International Symposium on Information Theory</i>, Virtual, Melbourne, Australia, 2021, pp. 1082–1087.","short":"D. Fathollahi, N. Farsad, S.A. Hashemi, M. Mondelli, in:, 2021 IEEE International Symposium on Information Theory, Institute of Electrical and Electronics Engineers, 2021, pp. 1082–1087.","ama":"Fathollahi D, Farsad N, Hashemi SA, Mondelli M. Sparse multi-decoder recursive projection aggregation for Reed-Muller codes. In: <i>2021 IEEE International Symposium on Information Theory</i>. Institute of Electrical and Electronics Engineers; 2021:1082-1087. doi:<a href=\"https://doi.org/10.1109/isit45174.2021.9517887\">10.1109/isit45174.2021.9517887</a>","chicago":"Fathollahi, Dorsa, Nariman Farsad, Seyyed Ali Hashemi, and Marco Mondelli. “Sparse Multi-Decoder Recursive Projection Aggregation for Reed-Muller Codes.” In <i>2021 IEEE International Symposium on Information Theory</i>, 1082–87. Institute of Electrical and Electronics Engineers, 2021. <a href=\"https://doi.org/10.1109/isit45174.2021.9517887\">https://doi.org/10.1109/isit45174.2021.9517887</a>.","ista":"Fathollahi D, Farsad N, Hashemi SA, Mondelli M. 2021. Sparse multi-decoder recursive projection aggregation for Reed-Muller codes. 2021 IEEE International Symposium on Information Theory. ISIT: International Symposium on Information Theory, 1082–1087."},"quality_controlled":"1","date_updated":"2024-09-10T13:03:18Z","abstract":[{"lang":"eng","text":"We thank Emmanuel Abbe and Min Ye for providing us the implementation of RPA decoding. D. Fathollahi and M. Mondelli are partially supported by the 2019 Lopez-Loreta Prize. N. Farsad is supported by Discovery Grant from the Natural Sciences and Engineering Research Council of Canada (NSERC) and Canada Foundation for Innovation (CFI), John R. Evans Leader Fund. S. A. Hashemi is supported by a Postdoctoral Fellowship from NSERC."}]},{"oa_version":"Preprint","publication_identifier":{"issn":["2640-3498"]},"scopus_import":"1","external_id":{"arxiv":["2010.03460"]},"day":"01","oa":1,"status":"public","alternative_title":["Proceedings of Machine Learning Research"],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","acknowledgement":"The authors would like to thank Andrea Montanari for helpful discussions. M. Mondelli was partially supported by the 2019 Lopez-Loreta Prize. R. Venkataramanan was partially supported by the Alan Turing Institute under the EPSRC grant EP/N510129/1.","date_published":"2021-04-01T00:00:00Z","language":[{"iso":"eng"}],"publication":"Proceedings of The 24th International Conference on Artificial Intelligence and Statistics","arxiv":1,"title":"Approximate message passing with spectral initialization for generalized linear models","article_processing_charge":"Yes (via OA deal)","editor":[{"full_name":"Banerjee, Arindam","first_name":"Arindam","last_name":"Banerjee"},{"first_name":"Kenji","last_name":"Fukumizu","full_name":"Fukumizu, Kenji"}],"main_file_link":[{"url":"https://proceedings.mlr.press/v130/mondelli21a.html","open_access":"1"}],"conference":{"name":"AISTATS: Artificial Intelligence and Statistics","end_date":"2021-04-15","location":"Virtual, San Diego, CA, United States","start_date":"2021-04-13"},"publisher":"ML Research Press","department":[{"_id":"MaMo"}],"abstract":[{"lang":"eng","text":" We consider the problem of estimating a signal from measurements obtained via a generalized linear model. We focus on estimators based on approximate message passing (AMP), a family of iterative algorithms with many appealing features: the performance of AMP in the high-dimensional limit can be succinctly characterized under suitable model assumptions; AMP can also be tailored to the empirical distribution of the signal entries, and for a wide class of estimation problems, AMP is conjectured to be optimal among all polynomial-time algorithms. However, a major issue of AMP is that in many models (such as phase retrieval), it requires an initialization correlated with the ground-truth signal and independent from the measurement matrix. Assuming that such an initialization is available is typically not realistic. In this paper, we solve this problem by proposing an AMP algorithm initialized with a spectral estimator. With such an initialization, the standard AMP analysis fails since the spectral estimator depends in a complicated way on the design matrix. Our main contribution is a rigorous characterization of the performance of AMP with spectral initialization in the high-dimensional limit. The key technical idea is to define and analyze a two-phase artificial AMP algorithm that first produces the spectral estimator, and then closely approximates the iterates of the true AMP. We also provide numerical results that demonstrate the validity of the proposed approach. "}],"date_updated":"2024-03-07T10:36:53Z","quality_controlled":"1","page":"397-405","volume":130,"citation":{"ista":"Mondelli M, Venkataramanan R. 2021. Approximate message passing with spectral initialization for generalized linear models. Proceedings of The 24th International Conference on Artificial Intelligence and Statistics. AISTATS: Artificial Intelligence and Statistics, Proceedings of Machine Learning Research, vol. 130, 397–405.","ama":"Mondelli M, Venkataramanan R. Approximate message passing with spectral initialization for generalized linear models. In: Banerjee A, Fukumizu K, eds. <i>Proceedings of The 24th International Conference on Artificial Intelligence and Statistics</i>. Vol 130. ML Research Press; 2021:397-405.","chicago":"Mondelli, Marco, and Ramji Venkataramanan. “Approximate Message Passing with Spectral Initialization for Generalized Linear Models.” In <i>Proceedings of The 24th International Conference on Artificial Intelligence and Statistics</i>, edited by Arindam Banerjee and Kenji Fukumizu, 130:397–405. ML Research Press, 2021.","ieee":"M. Mondelli and R. Venkataramanan, “Approximate message passing with spectral initialization for generalized linear models,” in <i>Proceedings of The 24th International Conference on Artificial Intelligence and Statistics</i>, Virtual, San Diego, CA, United States, 2021, vol. 130, pp. 397–405.","short":"M. Mondelli, R. Venkataramanan, in:, A. Banerjee, K. Fukumizu (Eds.), Proceedings of The 24th International Conference on Artificial Intelligence and Statistics, ML Research Press, 2021, pp. 397–405.","mla":"Mondelli, Marco, and Ramji Venkataramanan. “Approximate Message Passing with Spectral Initialization for Generalized Linear Models.” <i>Proceedings of The 24th International Conference on Artificial Intelligence and Statistics</i>, edited by Arindam Banerjee and Kenji Fukumizu, vol. 130, ML Research Press, 2021, pp. 397–405.","apa":"Mondelli, M., &#38; Venkataramanan, R. (2021). Approximate message passing with spectral initialization for generalized linear models. In A. Banerjee &#38; K. Fukumizu (Eds.), <i>Proceedings of The 24th International Conference on Artificial Intelligence and Statistics</i> (Vol. 130, pp. 397–405). Virtual, San Diego, CA, United States: ML Research Press."},"intvolume":"       130","date_created":"2022-01-03T11:34:22Z","month":"04","publication_status":"published","project":[{"name":"Prix Lopez-Loretta 2019 - Marco Mondelli","_id":"059876FA-7A3F-11EA-A408-12923DDC885E"}],"author":[{"id":"27EB676C-8706-11E9-9510-7717E6697425","orcid":"0000-0002-3242-7020","full_name":"Mondelli, Marco","first_name":"Marco","last_name":"Mondelli"},{"first_name":"Ramji","last_name":"Venkataramanan","full_name":"Venkataramanan, Ramji"}],"related_material":{"record":[{"relation":"later_version","status":"public","id":"12480"}]},"type":"conference","year":"2021","_id":"10598"},{"type":"conference","year":"2021","_id":"10599","date_created":"2022-01-03T11:39:51Z","publication_status":"published","project":[{"name":"Prix Lopez-Loretta 2019 - Marco Mondelli","_id":"059876FA-7A3F-11EA-A408-12923DDC885E"}],"month":"11","author":[{"first_name":"Seyyed Ali","last_name":"Hashemi","full_name":"Hashemi, Seyyed Ali"},{"first_name":"Marco","last_name":"Mondelli","full_name":"Mondelli, Marco","orcid":"0000-0002-3242-7020","id":"27EB676C-8706-11E9-9510-7717E6697425"},{"full_name":"Cioffi, John","first_name":"John","last_name":"Cioffi"},{"full_name":"Goldsmith, Andrea","last_name":"Goldsmith","first_name":"Andrea"}],"date_updated":"2024-09-10T13:03:17Z","abstract":[{"text":"A two-part successive syndrome-check decoding of polar codes is proposed with the first part successively refining the received codeword and the second part checking its syndrome. A new formulation of the successive-cancellation (SC) decoding algorithm is presented that allows for successively refining the received codeword by comparing the log-likelihood ratio value of a frozen bit with its predefined value. The syndrome of the refined received codeword is then checked for possible errors. In case there are no errors, the decoding process is terminated. Otherwise, the decoder continues to refine the received codeword. The proposed method is extended to the case of SC list (SCL) decoding by terminating the decoding process when the syndrome of the best candidate in the list indicates no errors. Simulation results show that the proposed method reduces the time-complexity of SC and SCL decoders and their fast variants, especially at high signal-to-noise ratios.","lang":"eng"}],"quality_controlled":"1","page":"943-947","volume":"2021-October","citation":{"ista":"Hashemi SA, Mondelli M, Cioffi J, Goldsmith A. 2021. Successive syndrome-check decoding of polar codes. Proceedings of the 55th Asilomar Conference on Signals, Systems, and Computers. ACSSC: Asilomar Conference on Signals, Systems, and Computers vol. 2021–October, 943–947.","apa":"Hashemi, S. A., Mondelli, M., Cioffi, J., &#38; Goldsmith, A. (2021). Successive syndrome-check decoding of polar codes. In <i>Proceedings of the 55th Asilomar Conference on Signals, Systems, and Computers</i> (Vol. 2021–October, pp. 943–947). Virtual, Pacific Grove, CA, United States: Institute of Electrical and Electronics Engineers. <a href=\"https://doi.org/10.1109/IEEECONF53345.2021.9723394\">https://doi.org/10.1109/IEEECONF53345.2021.9723394</a>","mla":"Hashemi, Seyyed Ali, et al. “Successive Syndrome-Check Decoding of Polar Codes.” <i>Proceedings of the 55th Asilomar Conference on Signals, Systems, and Computers</i>, vol. 2021–October, Institute of Electrical and Electronics Engineers, 2021, pp. 943–47, doi:<a href=\"https://doi.org/10.1109/IEEECONF53345.2021.9723394\">10.1109/IEEECONF53345.2021.9723394</a>.","chicago":"Hashemi, Seyyed Ali, Marco Mondelli, John Cioffi, and Andrea Goldsmith. “Successive Syndrome-Check Decoding of Polar Codes.” In <i>Proceedings of the 55th Asilomar Conference on Signals, Systems, and Computers</i>, 2021–October:943–47. Institute of Electrical and Electronics Engineers, 2021. <a href=\"https://doi.org/10.1109/IEEECONF53345.2021.9723394\">https://doi.org/10.1109/IEEECONF53345.2021.9723394</a>.","short":"S.A. Hashemi, M. Mondelli, J. Cioffi, A. Goldsmith, in:, Proceedings of the 55th Asilomar Conference on Signals, Systems, and Computers, Institute of Electrical and Electronics Engineers, 2021, pp. 943–947.","ieee":"S. A. Hashemi, M. Mondelli, J. Cioffi, and A. Goldsmith, “Successive syndrome-check decoding of polar codes,” in <i>Proceedings of the 55th Asilomar Conference on Signals, Systems, and Computers</i>, Virtual, Pacific Grove, CA, United States, 2021, vol. 2021–October, pp. 943–947.","ama":"Hashemi SA, Mondelli M, Cioffi J, Goldsmith A. Successive syndrome-check decoding of polar codes. In: <i>Proceedings of the 55th Asilomar Conference on Signals, Systems, and Computers</i>. Vol 2021-October. Institute of Electrical and Electronics Engineers; 2021:943-947. doi:<a href=\"https://doi.org/10.1109/IEEECONF53345.2021.9723394\">10.1109/IEEECONF53345.2021.9723394</a>"},"conference":{"end_date":"2021-11-03","start_date":"2021-10-31","location":"Virtual, Pacific Grove, CA, United States","name":"ACSSC: Asilomar Conference on Signals, Systems, and Computers"},"publisher":"Institute of Electrical and Electronics Engineers","department":[{"_id":"MaMo"}],"publication":"Proceedings of the 55th Asilomar Conference on Signals, Systems, and Computers","language":[{"iso":"eng"}],"article_processing_charge":"No","title":"Successive syndrome-check decoding of polar codes","arxiv":1,"main_file_link":[{"open_access":"1","url":" https://doi.org/10.48550/arXiv.2112.00057"}],"status":"public","acknowledgement":"This work is supported in part by ONR grant N00014-18-1-2191. S. A. Hashemi was supported by a Postdoctoral Fellowship from the Natural Sciences and Engineering Research Council of Canada (NSERC) and by Huawei. M. Mondelli was partially supported by the 2019 Lopez-Loreta Prize.","date_published":"2021-11-01T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"day":"01","oa_version":"Preprint","doi":"10.1109/IEEECONF53345.2021.9723394","publication_identifier":{"issn":["1058-6393"],"isbn":["9781665458283"]},"external_id":{"arxiv":["2112.00057"]},"scopus_import":"1"},{"article_type":"original","date_published":"2021-12-21T00:00:00Z","acknowledgement":"We thank members of the Heisenberg and McDougall groups for technical advice and discussion. We are grateful to the Bioimaging and Nanofabrication facilities of IST Austria and the Imaging Platform (PIM) and animal facility (CRB) of Institut de la Mer de Villefranche (IMEV), which is supported by EMBRC-France, whose French state funds are managed by the ANR within the Investments of the Future program under reference ANR-10-INBS-0, for continuous support. This work was supported by a collaborative grant from the French Government funding agency Agence National de la Recherche to McDougall (ANR 'MorCell': ANR-17-CE 13-0028) and the Austrian Science Fund to Heisenberg (FWF: I 3601-B27).","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","ddc":["570"],"status":"public","file_date_updated":"2022-01-10T09:40:37Z","article_processing_charge":"No","title":"Combined effect of cell geometry and polarity domains determines the orientation of unequal division","publication":"eLife","language":[{"iso":"eng"}],"external_id":{"isi":["000733610100001"]},"scopus_import":"1","publication_identifier":{"eissn":["2050-084X"]},"file":[{"file_size":7769934,"date_created":"2022-01-10T09:40:37Z","creator":"alisjak","success":1,"access_level":"open_access","date_updated":"2022-01-10T09:40:37Z","checksum":"759c7a873d554c48a6639e6350746ca6","file_id":"10611","relation":"main_file","content_type":"application/pdf","file_name":"2021_eLife_Godard.pdf"}],"oa_version":"Published Version","doi":"10.7554/eLife.75639","oa":1,"day":"21","author":[{"id":"33280250-F248-11E8-B48F-1D18A9856A87","full_name":"Godard, Benoit G","last_name":"Godard","first_name":"Benoit G"},{"last_name":"Dumollard","first_name":"Remi","full_name":"Dumollard, Remi"},{"orcid":"0000-0002-0912-4566","id":"39427864-F248-11E8-B48F-1D18A9856A87","first_name":"Carl-Philipp J","last_name":"Heisenberg","full_name":"Heisenberg, Carl-Philipp J"},{"full_name":"Mcdougall, Alex","first_name":"Alex","last_name":"Mcdougall"}],"project":[{"grant_number":"I03601","call_identifier":"FWF","name":"Control of embryonic cleavage pattern","_id":"2646861A-B435-11E9-9278-68D0E5697425"}],"acknowledged_ssus":[{"_id":"NanoFab"},{"_id":"Bio"}],"publication_status":"published","isi":1,"month":"12","date_created":"2022-01-09T23:01:26Z","intvolume":"        10","_id":"10606","year":"2021","type":"journal_article","article_number":"e75639","department":[{"_id":"CaHe"}],"publisher":"eLife Sciences Publications","volume":10,"citation":{"ista":"Godard BG, Dumollard R, Heisenberg C-PJ, Mcdougall A. 2021. Combined effect of cell geometry and polarity domains determines the orientation of unequal division. eLife. 10, e75639.","ama":"Godard BG, Dumollard R, Heisenberg C-PJ, Mcdougall A. Combined effect of cell geometry and polarity domains determines the orientation of unequal division. <i>eLife</i>. 2021;10. doi:<a href=\"https://doi.org/10.7554/eLife.75639\">10.7554/eLife.75639</a>","chicago":"Godard, Benoit G, Remi Dumollard, Carl-Philipp J Heisenberg, and Alex Mcdougall. “Combined Effect of Cell Geometry and Polarity Domains Determines the Orientation of Unequal Division.” <i>ELife</i>. eLife Sciences Publications, 2021. <a href=\"https://doi.org/10.7554/eLife.75639\">https://doi.org/10.7554/eLife.75639</a>.","short":"B.G. Godard, R. Dumollard, C.-P.J. Heisenberg, A. Mcdougall, ELife 10 (2021).","ieee":"B. G. Godard, R. Dumollard, C.-P. J. Heisenberg, and A. Mcdougall, “Combined effect of cell geometry and polarity domains determines the orientation of unequal division,” <i>eLife</i>, vol. 10. eLife Sciences Publications, 2021.","apa":"Godard, B. G., Dumollard, R., Heisenberg, C.-P. J., &#38; Mcdougall, A. (2021). Combined effect of cell geometry and polarity domains determines the orientation of unequal division. <i>ELife</i>. eLife Sciences Publications. <a href=\"https://doi.org/10.7554/eLife.75639\">https://doi.org/10.7554/eLife.75639</a>","mla":"Godard, Benoit G., et al. “Combined Effect of Cell Geometry and Polarity Domains Determines the Orientation of Unequal Division.” <i>ELife</i>, vol. 10, e75639, eLife Sciences Publications, 2021, doi:<a href=\"https://doi.org/10.7554/eLife.75639\">10.7554/eLife.75639</a>."},"quality_controlled":"1","has_accepted_license":"1","date_updated":"2023-08-17T06:32:44Z","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"abstract":[{"text":"Cell division orientation is thought to result from a competition between cell geometry and polarity domains controlling the position of the mitotic spindle during mitosis. Depending on the level of cell shape anisotropy or the strength of the polarity domain, one dominates the other and determines the orientation of the spindle. Whether and how such competition is also at work to determine unequal cell division (UCD), producing daughter cells of different size, remains unclear. Here, we show that cell geometry and polarity domains cooperate, rather than compete, in positioning the cleavage plane during UCDs in early ascidian embryos. We found that the UCDs and their orientation at the ascidian third cleavage rely on the spindle tilting in an anisotropic cell shape, and cortical polarity domains exerting different effects on spindle astral microtubules. By systematically varying mitotic cell shape, we could modulate the effect of attractive and repulsive polarity domains and consequently generate predicted daughter cell size asymmetries and position. We therefore propose that the spindle position during UCD is set by the combined activities of cell geometry and polarity domains, where cell geometry modulates the effect of cortical polarity domain(s).","lang":"eng"}]}]