[{"author":[{"last_name":"Brooks","orcid":"0000-0002-6249-0928","full_name":"Brooks, Morris","id":"B7ECF9FC-AA38-11E9-AC9A-0930E6697425","first_name":"Morris"},{"id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","first_name":"Mikhail","orcid":"0000-0002-6990-7802","full_name":"Lemeshko, Mikhail","last_name":"Lemeshko"},{"full_name":"Lundholm, Douglas","last_name":"Lundholm","first_name":"Douglas"},{"last_name":"Yakaboylu","orcid":"0000-0001-5973-0874","full_name":"Yakaboylu, Enderalp","id":"38CB71F6-F248-11E8-B48F-1D18A9856A87","first_name":"Enderalp"}],"year":"2021","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publication_identifier":{"eissn":["2218-2004"]},"department":[{"_id":"MiLe"},{"_id":"RoSe"}],"day":"02","publisher":"MDPI","oa_version":"Published Version","arxiv":1,"doi":"10.3390/atoms9040106","quality_controlled":"1","language":[{"iso":"eng"}],"status":"public","has_accepted_license":"1","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"}],"publication_status":"published","article_type":"original","ddc":["530"],"type":"journal_article","citation":{"short":"M. Brooks, M. Lemeshko, D. Lundholm, E. Yakaboylu, Atoms 9 (2021).","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>","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.","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>.","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>","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>.","ista":"Brooks M, Lemeshko M, Lundholm D, Yakaboylu E. 2021. Emergence of anyons on the two-sphere in molecular impurities. Atoms. 9(4), 106."},"file":[{"access_level":"open_access","success":1,"file_name":"2021_Atoms_Brooks.pdf","file_size":303070,"date_updated":"2022-01-03T10:15:05Z","content_type":"application/pdf","relation":"main_file","checksum":"d0e44b95f36c9e06724f66832af0f8c3","date_created":"2022-01-03T10:15:05Z","creator":"alisjak","file_id":"10592"}],"date_published":"2021-12-02T00:00:00Z","article_processing_charge":"Yes","keyword":["anyons","quasiparticles","Quantum Hall Effect","topological states of matter"],"month":"12","date_updated":"2023-06-15T14:51:49Z","title":"Emergence of anyons on the two-sphere in molecular impurities","date_created":"2022-01-02T23:01:33Z","external_id":{"arxiv":["2108.06966"]},"_id":"10585","file_date_updated":"2022-01-03T10:15:05Z","publication":"Atoms","issue":"4","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","acknowledgement":"D. Lundholm acknowledges financial support from the Göran Gustafsson Foundation (grant no. 1804).","oa":1,"intvolume":"         9","article_number":"106","volume":9,"scopus_import":"1"},{"article_type":"original","ddc":["620"],"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>","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).","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.","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>.","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.","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>."},"type":"journal_article","file":[{"date_created":"2022-01-03T09:46:53Z","creator":"alisjak","file_id":"10591","file_name":"2021_Crystals_Yuzheng.pdf","access_level":"open_access","success":1,"relation":"main_file","checksum":"668e9d777608ce0a3bc2e305133bd06b","file_size":4569639,"content_type":"application/pdf","date_updated":"2022-01-03T09:46:53Z"}],"quality_controlled":"1","language":[{"iso":"eng"}],"status":"public","has_accepted_license":"1","publication_status":"published","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."}],"day":"03","publisher":"MDPI","oa_version":"Published Version","doi":"10.3390/cryst11121509","author":[{"last_name":"Lu","full_name":"Lu, Yuzheng","first_name":"Yuzheng"},{"first_name":"Naila","last_name":"Arshad","full_name":"Arshad, Naila"},{"first_name":"Muhammad Sultan","last_name":"Irshad","full_name":"Irshad, Muhammad Sultan"},{"first_name":"Iftikhar","last_name":"Ahmed","full_name":"Ahmed, Iftikhar"},{"first_name":"Shafiq","last_name":"Ahmad","full_name":"Ahmad, Shafiq"},{"full_name":"Alshahrani, Lina Abdullah","last_name":"Alshahrani","first_name":"Lina Abdullah"},{"full_name":"Yousaf, Muhammad","last_name":"Yousaf","first_name":"Muhammad"},{"first_name":"Abdelaty Edrees","last_name":"Sayed","full_name":"Sayed, Abdelaty Edrees"},{"last_name":"Nauman","full_name":"Nauman, Muhammad","orcid":"0000-0002-2111-4846","id":"32c21954-2022-11eb-9d5f-af9f93c24e71","first_name":"Muhammad"}],"isi":1,"year":"2021","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publication_identifier":{"eissn":["2073-4352"]},"department":[{"_id":"KiMo"}],"scopus_import":"1","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","issue":"12","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.","intvolume":"        11","oa":1,"article_number":"1509","volume":11,"alternative_title":["Hybrid and Composite Crystalline Materials"],"date_created":"2022-01-02T23:01:34Z","external_id":{"isi":["000736602200001"]},"_id":"10586","file_date_updated":"2022-01-03T09:46:53Z","publication":"Crystals","date_published":"2021-12-03T00:00:00Z","article_processing_charge":"No","month":"12","date_updated":"2023-08-17T06:31:20Z","title":"Fe2O3 nanoparticles deposited over self-floating facial sponge for facile interfacial seawater solar desalination"},{"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","oa":1,"intvolume":"        35","volume":35,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2106.02356"}],"scopus_import":"1","date_published":"2021-12-01T00:00:00Z","article_processing_charge":"No","title":"PCA initialization for approximate message passing in rotationally invariant models","date_updated":"2024-09-10T13:03:19Z","month":"12","_id":"10593","project":[{"name":"Prix Lopez-Loretta 2019 - Marco Mondelli","_id":"059876FA-7A3F-11EA-A408-12923DDC885E"}],"date_created":"2022-01-03T10:50:02Z","external_id":{"arxiv":["2106.02356"]},"publication":"35th Conference on Neural Information Processing Systems","page":"29616-29629","quality_controlled":"1","publication_status":"published","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"}],"language":[{"iso":"eng"}],"status":"public","type":"conference","citation":{"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.","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.","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.","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.","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.","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."},"author":[{"id":"27EB676C-8706-11E9-9510-7717E6697425","first_name":"Marco","last_name":"Mondelli","full_name":"Mondelli, Marco","orcid":"0000-0002-3242-7020"},{"first_name":"Ramji","full_name":"Venkataramanan, Ramji","last_name":"Venkataramanan"}],"year":"2021","conference":{"name":"NeurIPS: Neural Information Processing Systems","location":"Virtual","start_date":"2021-12-06","end_date":"2021-12-14"},"department":[{"_id":"MaMo"}],"publication_identifier":{"isbn":["9781713845393"],"issn":["1049-5258"]},"publisher":"Neural Information Processing Systems Foundation","day":"01","oa_version":"Preprint","arxiv":1},{"arxiv":1,"oa_version":"Preprint","publisher":"Neural Information Processing Systems Foundation","day":"01","department":[{"_id":"MaMo"}],"publication_identifier":{"isbn":["9781713845393"],"issn":["1049-5258"]},"author":[{"first_name":"Quynh","full_name":"Nguyen, Quynh","last_name":"Nguyen"},{"last_name":"Bréchet","full_name":"Bréchet, Pierre","first_name":"Pierre"},{"full_name":"Mondelli, Marco","orcid":"0000-0002-3242-7020","last_name":"Mondelli","first_name":"Marco","id":"27EB676C-8706-11E9-9510-7717E6697425"}],"year":"2021","conference":{"start_date":"2021-12-06","location":"Virtual","end_date":"2021-12-14","name":"35th Conference on Neural Information Processing Systems"},"citation":{"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.","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.","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.","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."},"type":"conference","publication_status":"published","abstract":[{"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.","lang":"eng"}],"language":[{"iso":"eng"}],"status":"public","quality_controlled":"1","publication":"35th Conference on Neural Information Processing Systems","project":[{"name":"Prix Lopez-Loretta 2019 - Marco Mondelli","_id":"059876FA-7A3F-11EA-A408-12923DDC885E"}],"_id":"10594","date_created":"2022-01-03T10:56:20Z","external_id":{"arxiv":["2102.09671"]},"title":"When are solutions connected in deep networks?","date_updated":"2024-09-10T13:03:19Z","month":"12","date_published":"2021-12-01T00:00:00Z","article_processing_charge":"No","volume":35,"main_file_link":[{"url":"https://arxiv.org/abs/2102.09671","open_access":"1"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","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).","intvolume":"        35","oa":1},{"quality_controlled":"1","abstract":[{"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.","lang":"eng"}],"publication_status":"published","language":[{"iso":"eng"}],"status":"public","type":"conference","citation":{"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.","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.","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.","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.","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.","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.","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."},"author":[{"last_name":"Nguyen","full_name":"Nguyen, Quynh","first_name":"Quynh"},{"id":"27EB676C-8706-11E9-9510-7717E6697425","first_name":"Marco","full_name":"Mondelli, Marco","orcid":"0000-0002-3242-7020","last_name":"Mondelli"},{"first_name":"Guido F","full_name":"Montufar, Guido F","last_name":"Montufar"}],"conference":{"location":"Virtual","start_date":"2021-07-18","end_date":"2021-07-24","name":"ICML: International Conference on Machine Learning"},"year":"2021","editor":[{"first_name":"Marina","full_name":"Meila, Marina","last_name":"Meila"},{"first_name":"Tong","full_name":"Zhang, Tong","last_name":"Zhang"}],"department":[{"_id":"MaMo"}],"publisher":"ML Research Press","oa_version":"Published Version","arxiv":1,"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).","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","intvolume":"       139","oa":1,"volume":139,"alternative_title":["Proceedings of Machine Learning Research"],"main_file_link":[{"url":"http://proceedings.mlr.press/v139/nguyen21g.html","open_access":"1"}],"date_published":"2021-01-01T00:00:00Z","article_processing_charge":"No","title":"Tight bounds on the smallest eigenvalue of the neural tangent kernel for deep ReLU networks","date_updated":"2024-09-10T13:03:17Z","_id":"10595","project":[{"_id":"059876FA-7A3F-11EA-A408-12923DDC885E","name":"Prix Lopez-Loretta 2019 - Marco Mondelli"}],"date_created":"2022-01-03T10:57:49Z","external_id":{"arxiv":["2012.11654"]},"publication":"Proceedings of the 38th International Conference on Machine Learning","page":"8119-8129"},{"department":[{"_id":"MaMo"}],"publication_identifier":{"isbn":["978-1-5386-8210-4"],"eisbn":["978-1-5386-8209-8"]},"author":[{"first_name":"Dorsa","last_name":"Fathollahi","full_name":"Fathollahi, Dorsa"},{"full_name":"Farsad, Nariman","last_name":"Farsad","first_name":"Nariman"},{"first_name":"Seyyed Ali","last_name":"Hashemi","full_name":"Hashemi, Seyyed Ali"},{"last_name":"Mondelli","full_name":"Mondelli, Marco","orcid":"0000-0002-3242-7020","id":"27EB676C-8706-11E9-9510-7717E6697425","first_name":"Marco"}],"isi":1,"year":"2021","conference":{"end_date":"2021-07-20","start_date":"2021-07-12","location":"Virtual, Melbourne, Australia","name":"ISIT: International Symposium on Information Theory"},"arxiv":1,"oa_version":"Preprint","doi":"10.1109/isit45174.2021.9517887","day":"01","publisher":"Institute of Electrical and Electronics Engineers","language":[{"iso":"eng"}],"status":"public","abstract":[{"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.","lang":"eng"}],"publication_status":"published","quality_controlled":"1","type":"conference","citation":{"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.","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>","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.","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.","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>."},"month":"09","title":"Sparse multi-decoder recursive projection aggregation for Reed-Muller codes","date_updated":"2024-09-10T13:03:18Z","date_published":"2021-09-01T00:00:00Z","article_processing_charge":"No","page":"1082-1087","publication":"2021 IEEE International Symposium on Information Theory","date_created":"2022-01-03T11:31:26Z","external_id":{"arxiv":["2011.12882"],"isi":["000701502201029"]},"_id":"10597","project":[{"_id":"059876FA-7A3F-11EA-A408-12923DDC885E","name":"Prix Lopez-Loretta 2019 - Marco Mondelli"}],"main_file_link":[{"url":"https://arxiv.org/abs/2011.12882","open_access":"1"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","oa":1,"scopus_import":"1"},{"oa":1,"intvolume":"       130","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.","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"status":"public","relation":"later_version","id":"12480"}]},"main_file_link":[{"open_access":"1","url":"https://proceedings.mlr.press/v130/mondelli21a.html"}],"volume":130,"alternative_title":["Proceedings of Machine Learning Research"],"scopus_import":"1","article_processing_charge":"Yes (via OA deal)","date_published":"2021-04-01T00:00:00Z","date_updated":"2024-03-07T10:36:53Z","title":"Approximate message passing with spectral initialization for generalized linear models","month":"04","_id":"10598","project":[{"_id":"059876FA-7A3F-11EA-A408-12923DDC885E","name":"Prix Lopez-Loretta 2019 - Marco Mondelli"}],"external_id":{"arxiv":["2010.03460"]},"date_created":"2022-01-03T11:34:22Z","publication":"Proceedings of The 24th International Conference on Artificial Intelligence and Statistics","page":"397-405","quality_controlled":"1","publication_status":"published","abstract":[{"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. ","lang":"eng"}],"status":"public","language":[{"iso":"eng"}],"type":"conference","citation":{"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.","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.","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.","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.","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.","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.","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."},"conference":{"name":"AISTATS: Artificial Intelligence and Statistics","end_date":"2021-04-15","location":"Virtual, San Diego, CA, United States","start_date":"2021-04-13"},"year":"2021","author":[{"id":"27EB676C-8706-11E9-9510-7717E6697425","first_name":"Marco","full_name":"Mondelli, Marco","orcid":"0000-0002-3242-7020","last_name":"Mondelli"},{"full_name":"Venkataramanan, Ramji","last_name":"Venkataramanan","first_name":"Ramji"}],"editor":[{"full_name":"Banerjee, Arindam","last_name":"Banerjee","first_name":"Arindam"},{"first_name":"Kenji","last_name":"Fukumizu","full_name":"Fukumizu, Kenji"}],"department":[{"_id":"MaMo"}],"publication_identifier":{"issn":["2640-3498"]},"publisher":"ML Research Press","day":"01","oa_version":"Preprint","arxiv":1},{"publication":"Proceedings of the 55th Asilomar Conference on Signals, Systems, and Computers","page":"943-947","_id":"10599","project":[{"name":"Prix Lopez-Loretta 2019 - Marco Mondelli","_id":"059876FA-7A3F-11EA-A408-12923DDC885E"}],"date_created":"2022-01-03T11:39:51Z","external_id":{"arxiv":["2112.00057"]},"date_updated":"2024-09-10T13:03:17Z","title":"Successive syndrome-check decoding of polar codes","month":"11","date_published":"2021-11-01T00:00:00Z","article_processing_charge":"No","scopus_import":"1","volume":"2021-October","main_file_link":[{"open_access":"1","url":" https://doi.org/10.48550/arXiv.2112.00057"}],"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.","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"doi":"10.1109/IEEECONF53345.2021.9723394","arxiv":1,"oa_version":"Preprint","publisher":"Institute of Electrical and Electronics Engineers","day":"01","publication_identifier":{"issn":["1058-6393"],"isbn":["9781665458283"]},"department":[{"_id":"MaMo"}],"author":[{"first_name":"Seyyed Ali","last_name":"Hashemi","full_name":"Hashemi, Seyyed Ali"},{"last_name":"Mondelli","full_name":"Mondelli, Marco","orcid":"0000-0002-3242-7020","id":"27EB676C-8706-11E9-9510-7717E6697425","first_name":"Marco"},{"first_name":"John","last_name":"Cioffi","full_name":"Cioffi, John"},{"first_name":"Andrea","last_name":"Goldsmith","full_name":"Goldsmith, Andrea"}],"conference":{"name":"ACSSC: Asilomar Conference on Signals, Systems, and Computers","end_date":"2021-11-03","start_date":"2021-10-31","location":"Virtual, Pacific Grove, CA, United States"},"year":"2021","citation":{"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>.","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>","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>.","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>","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."},"type":"conference","abstract":[{"lang":"eng","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."}],"publication_status":"published","language":[{"iso":"eng"}],"status":"public","quality_controlled":"1"},{"language":[{"iso":"eng"}],"has_accepted_license":"1","status":"public","publication_status":"published","abstract":[{"lang":"eng","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)."}],"quality_controlled":"1","citation":{"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>.","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>","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>.","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.","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>","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."},"type":"journal_article","file":[{"content_type":"application/pdf","date_updated":"2022-01-10T09:40:37Z","file_size":7769934,"checksum":"759c7a873d554c48a6639e6350746ca6","relation":"main_file","success":1,"access_level":"open_access","file_name":"2021_eLife_Godard.pdf","file_id":"10611","creator":"alisjak","date_created":"2022-01-10T09:40:37Z"}],"article_type":"original","acknowledged_ssus":[{"_id":"NanoFab"},{"_id":"Bio"}],"ddc":["570"],"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publication_identifier":{"eissn":["2050-084X"]},"department":[{"_id":"CaHe"}],"isi":1,"author":[{"full_name":"Godard, Benoit G","last_name":"Godard","id":"33280250-F248-11E8-B48F-1D18A9856A87","first_name":"Benoit G"},{"first_name":"Remi","full_name":"Dumollard, Remi","last_name":"Dumollard"},{"full_name":"Heisenberg, Carl-Philipp J","orcid":"0000-0002-0912-4566","last_name":"Heisenberg","id":"39427864-F248-11E8-B48F-1D18A9856A87","first_name":"Carl-Philipp J"},{"last_name":"Mcdougall","full_name":"Mcdougall, Alex","first_name":"Alex"}],"year":"2021","oa_version":"Published Version","doi":"10.7554/eLife.75639","day":"21","publisher":"eLife Sciences Publications","volume":10,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","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).","intvolume":"        10","oa":1,"article_number":"e75639","scopus_import":"1","month":"12","date_updated":"2023-08-17T06:32:44Z","title":"Combined effect of cell geometry and polarity domains determines the orientation of unequal division","date_published":"2021-12-21T00:00:00Z","article_processing_charge":"No","file_date_updated":"2022-01-10T09:40:37Z","publication":"eLife","date_created":"2022-01-09T23:01:26Z","external_id":{"isi":["000733610100001"]},"project":[{"_id":"2646861A-B435-11E9-9278-68D0E5697425","grant_number":"I03601","call_identifier":"FWF","name":"Control of embryonic cleavage pattern"}],"_id":"10606"},{"quality_controlled":"1","pmid":1,"has_accepted_license":"1","status":"public","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"The evidence linking innate immunity mechanisms and neurodegenerative diseases is growing, but the specific mechanisms are incompletely understood. Experimental data suggest that microglial TLR4 mediates the uptake and clearance of α-synuclein also termed synucleinophagy. The accumulation of misfolded α-synuclein throughout the brain is central to Parkinson's disease (PD). The distribution and progression of the pathology is often attributed to the propagation of α-synuclein. Here, we apply a classical α-synuclein propagation model of prodromal PD in wild type and TLR4 deficient mice to study the role of TLR4 in the progression of the disease. Our data suggest that TLR4 deficiency facilitates the α-synuclein seed spreading associated with reduced lysosomal activity of microglia. Three months after seed inoculation, more pronounced proteinase K-resistant α-synuclein inclusion pathology is observed in mice with TLR4 deficiency. The facilitated propagation of α-synuclein is associated with early loss of dopamine transporter (DAT) signal in the striatum and loss of dopaminergic neurons in substantia nigra pars compacta of TLR4 deficient mice. These new results support TLR4 signaling as a putative target for disease modification to slow the progression of PD and related disorders."}],"publication_status":"published","article_type":"original","ddc":["610"],"citation":{"chicago":"Venezia, Serena, Walter Kaufmann, Gregor K. Wenning, and Nadia Stefanova. “Toll-like Receptor 4 Deficiency Facilitates α-Synuclein Propagation and Neurodegeneration in a Mouse Model of Prodromal Parkinson’s Disease.” <i>Parkinsonism &#38; Related Disorders</i>. Elsevier, 2021. <a href=\"https://doi.org/10.1016/j.parkreldis.2021.09.007\">https://doi.org/10.1016/j.parkreldis.2021.09.007</a>.","ama":"Venezia S, Kaufmann W, Wenning GK, Stefanova N. Toll-like receptor 4 deficiency facilitates α-synuclein propagation and neurodegeneration in a mouse model of prodromal Parkinson’s disease. <i>Parkinsonism &#38; Related Disorders</i>. 2021;91:59-65. doi:<a href=\"https://doi.org/10.1016/j.parkreldis.2021.09.007\">10.1016/j.parkreldis.2021.09.007</a>","ista":"Venezia S, Kaufmann W, Wenning GK, Stefanova N. 2021. Toll-like receptor 4 deficiency facilitates α-synuclein propagation and neurodegeneration in a mouse model of prodromal Parkinson’s disease. Parkinsonism &#38; Related Disorders. 91, 59–65.","mla":"Venezia, Serena, et al. “Toll-like Receptor 4 Deficiency Facilitates α-Synuclein Propagation and Neurodegeneration in a Mouse Model of Prodromal Parkinson’s Disease.” <i>Parkinsonism &#38; Related Disorders</i>, vol. 91, Elsevier, 2021, pp. 59–65, doi:<a href=\"https://doi.org/10.1016/j.parkreldis.2021.09.007\">10.1016/j.parkreldis.2021.09.007</a>.","short":"S. Venezia, W. Kaufmann, G.K. Wenning, N. Stefanova, Parkinsonism &#38; Related Disorders 91 (2021) 59–65.","apa":"Venezia, S., Kaufmann, W., Wenning, G. K., &#38; Stefanova, N. (2021). Toll-like receptor 4 deficiency facilitates α-synuclein propagation and neurodegeneration in a mouse model of prodromal Parkinson’s disease. <i>Parkinsonism &#38; Related Disorders</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.parkreldis.2021.09.007\">https://doi.org/10.1016/j.parkreldis.2021.09.007</a>","ieee":"S. Venezia, W. Kaufmann, G. K. Wenning, and N. Stefanova, “Toll-like receptor 4 deficiency facilitates α-synuclein propagation and neurodegeneration in a mouse model of prodromal Parkinson’s disease,” <i>Parkinsonism &#38; Related Disorders</i>, vol. 91. Elsevier, pp. 59–65, 2021."},"type":"journal_article","file":[{"success":1,"access_level":"open_access","file_name":"2021_Parkinsonism_Venezia.pdf","content_type":"application/pdf","date_updated":"2022-01-10T13:41:40Z","file_size":6848513,"relation":"main_file","checksum":"360681585acb51e80d17c6b213c56b55","date_created":"2022-01-10T13:41:40Z","creator":"alisjak","file_id":"10612"}],"year":"2021","isi":1,"author":[{"last_name":"Venezia","full_name":"Venezia, Serena","first_name":"Serena"},{"orcid":"0000-0001-9735-5315","full_name":"Kaufmann, Walter","last_name":"Kaufmann","first_name":"Walter","id":"3F99E422-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Wenning, Gregor K.","last_name":"Wenning","first_name":"Gregor K."},{"last_name":"Stefanova","full_name":"Stefanova, Nadia","first_name":"Nadia"}],"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"department":[{"_id":"EM-Fac"}],"publication_identifier":{"issn":["1353-8020"],"eissn":["1873-5126"]},"day":"01","publisher":"Elsevier","oa_version":"Published Version","doi":"10.1016/j.parkreldis.2021.09.007","intvolume":"        91","oa":1,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","acknowledgement":"This study was supported by grants of the Austrian Science Fund (FWF) F4414 and W1206-08. Electron microscopy was performed at the Scientific Service Units (SSU) of IST-Austria through resources provided by the Electron Microscopy Facility.","volume":91,"scopus_import":"1","article_processing_charge":"No","date_published":"2021-10-01T00:00:00Z","month":"10","title":"Toll-like receptor 4 deficiency facilitates α-synuclein propagation and neurodegeneration in a mouse model of prodromal Parkinson's disease","date_updated":"2023-08-17T06:36:01Z","external_id":{"pmid":["34530328"],"isi":["000701142900012"]},"date_created":"2022-01-09T23:01:26Z","_id":"10607","page":"59-65","publication":"Parkinsonism & Related Disorders","file_date_updated":"2022-01-10T13:41:40Z"},{"month":"12","date_updated":"2022-01-10T08:36:55Z","title":"Coarse infinite-dimensionality of hyperspaces of finite subsets","article_processing_charge":"Yes (via OA deal)","date_published":"2021-12-30T00:00:00Z","publication":"European Journal of Mathematics","file_date_updated":"2022-01-10T08:33:22Z","date_created":"2022-01-09T23:01:27Z","_id":"10608","oa":1,"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","acknowledgement":"We would like to thank the referees for their careful reading and the comments that improved our work. The third named author would like to thank the Division of Mathematics, Physics and Earth Sciences of the Graduate School of Science and Engineering of Ehime University and the second named author for hosting his visit in June 2018. Open access funding provided by Institute of Science and Technology (IST Austria).","scopus_import":"1","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"department":[{"_id":"HeEd"}],"publication_identifier":{"issn":["2199-675X"],"eissn":["2199-6768"]},"year":"2021","author":[{"last_name":"Weighill","full_name":"Weighill, Thomas","first_name":"Thomas"},{"first_name":"Takamitsu","last_name":"Yamauchi","full_name":"Yamauchi, Takamitsu"},{"full_name":"Zava, Nicolò","last_name":"Zava","id":"c8b3499c-7a77-11eb-b046-aa368cbbf2ad","first_name":"Nicolò"}],"oa_version":"Published Version","doi":"10.1007/s40879-021-00515-3","day":"30","publisher":"Springer Nature","status":"public","has_accepted_license":"1","language":[{"iso":"eng"}],"abstract":[{"text":"We consider infinite-dimensional properties in coarse geometry for hyperspaces consisting of finite subsets of metric spaces with the Hausdorff metric. We see that several infinite-dimensional properties are preserved by taking the hyperspace of subsets with at most n points. On the other hand, we prove that, if a metric space contains a sequence of long intervals coarsely, then its hyperspace of finite subsets is not coarsely embeddable into any uniformly convex Banach space. As a corollary, the hyperspace of finite subsets of the real line is not coarsely embeddable into any uniformly convex Banach space. It is also shown that every (not necessarily bounded geometry) metric space with straight finite decomposition complexity has metric sparsification property.","lang":"eng"}],"publication_status":"published","quality_controlled":"1","type":"journal_article","citation":{"ieee":"T. Weighill, T. Yamauchi, and N. Zava, “Coarse infinite-dimensionality of hyperspaces of finite subsets,” <i>European Journal of Mathematics</i>. Springer Nature, 2021.","short":"T. Weighill, T. Yamauchi, N. Zava, European Journal of Mathematics (2021).","apa":"Weighill, T., Yamauchi, T., &#38; Zava, N. (2021). Coarse infinite-dimensionality of hyperspaces of finite subsets. <i>European Journal of Mathematics</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s40879-021-00515-3\">https://doi.org/10.1007/s40879-021-00515-3</a>","ista":"Weighill T, Yamauchi T, Zava N. 2021. Coarse infinite-dimensionality of hyperspaces of finite subsets. European Journal of Mathematics.","mla":"Weighill, Thomas, et al. “Coarse Infinite-Dimensionality of Hyperspaces of Finite Subsets.” <i>European Journal of Mathematics</i>, Springer Nature, 2021, doi:<a href=\"https://doi.org/10.1007/s40879-021-00515-3\">10.1007/s40879-021-00515-3</a>.","ama":"Weighill T, Yamauchi T, Zava N. Coarse infinite-dimensionality of hyperspaces of finite subsets. <i>European Journal of Mathematics</i>. 2021. doi:<a href=\"https://doi.org/10.1007/s40879-021-00515-3\">10.1007/s40879-021-00515-3</a>","chicago":"Weighill, Thomas, Takamitsu Yamauchi, and Nicolò Zava. “Coarse Infinite-Dimensionality of Hyperspaces of Finite Subsets.” <i>European Journal of Mathematics</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/s40879-021-00515-3\">https://doi.org/10.1007/s40879-021-00515-3</a>."},"file":[{"access_level":"open_access","success":1,"file_name":"2021_EuJournalMath_Weighill.pdf","file_size":384908,"date_updated":"2022-01-10T08:33:22Z","content_type":"application/pdf","relation":"main_file","checksum":"c435dcfa1ad3aadc5cdd7366bc7f4e98","creator":"cchlebak","date_created":"2022-01-10T08:33:22Z","file_id":"10610"}],"article_type":"original","ddc":["500"]},{"alternative_title":["LNCS"],"volume":13091,"main_file_link":[{"url":"https://eprint.iacr.org/2021/1262","open_access":"1"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","oa":1,"intvolume":"     13091","scopus_import":"1","month":"12","title":"Reverse firewalls for adaptively secure MPC without setup","date_updated":"2023-08-17T06:34:41Z","ec_funded":1,"date_published":"2021-12-01T00:00:00Z","article_processing_charge":"No","page":"335-364","publication":"27th International Conference on the Theory and Application of Cryptology and Information Security","date_created":"2022-01-09T23:01:27Z","external_id":{"isi":["000927876200012"]},"_id":"10609","project":[{"name":"Teaching Old Crypto New Tricks","call_identifier":"H2020","grant_number":"682815","_id":"258AA5B2-B435-11E9-9278-68D0E5697425"}],"language":[{"iso":"eng"}],"status":"public","publication_status":"published","abstract":[{"text":"We study Multi-party computation (MPC) in the setting of subversion, where the adversary tampers with the machines of honest parties. Our goal is to construct actively secure MPC protocols where parties are corrupted adaptively by an adversary (as in the standard adaptive security setting), and in addition, honest parties’ machines are compromised.\r\nThe idea of reverse firewalls (RF) was introduced at EUROCRYPT’15 by Mironov and Stephens-Davidowitz as an approach to protecting protocols against corruption of honest parties’ devices. Intuitively, an RF for a party   P  is an external entity that sits between   P  and the outside world and whose scope is to sanitize   P ’s incoming and outgoing messages in the face of subversion of their computer. Mironov and Stephens-Davidowitz constructed a protocol for passively-secure two-party computation. At CRYPTO’20, Chakraborty, Dziembowski and Nielsen constructed a protocol for secure computation with firewalls that improved on this result, both by extending it to multi-party computation protocol, and considering active security in the presence of static corruptions. In this paper, we initiate the study of RF for MPC in the adaptive setting. We put forward a definition for adaptively secure MPC in the reverse firewall setting, explore relationships among the security notions, and then construct reverse firewalls for MPC in this stronger setting of adaptive security. We also resolve the open question of Chakraborty, Dziembowski and Nielsen by removing the need for a trusted setup in constructing RF for MPC. Towards this end, we construct reverse firewalls for adaptively secure augmented coin tossing and adaptively secure zero-knowledge protocols and obtain a constant round adaptively secure MPC protocol in the reverse firewall setting without setup. Along the way, we propose a new multi-party adaptively secure coin tossing protocol in the plain model, that is of independent interest.","lang":"eng"}],"quality_controlled":"1","citation":{"ama":"Chakraborty S, Ganesh C, Pancholi M, Sarkar P. Reverse firewalls for adaptively secure MPC without setup. In: <i>27th International Conference on the Theory and Application of Cryptology and Information Security</i>. Vol 13091. Springer Nature; 2021:335-364. doi:<a href=\"https://doi.org/10.1007/978-3-030-92075-3_12\">10.1007/978-3-030-92075-3_12</a>","chicago":"Chakraborty, Suvradip, Chaya Ganesh, Mahak Pancholi, and Pratik Sarkar. “Reverse Firewalls for Adaptively Secure MPC without Setup.” In <i>27th International Conference on the Theory and Application of Cryptology and Information Security</i>, 13091:335–64. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/978-3-030-92075-3_12\">https://doi.org/10.1007/978-3-030-92075-3_12</a>.","mla":"Chakraborty, Suvradip, et al. “Reverse Firewalls for Adaptively Secure MPC without Setup.” <i>27th International Conference on the Theory and Application of Cryptology and Information Security</i>, vol. 13091, Springer Nature, 2021, pp. 335–64, doi:<a href=\"https://doi.org/10.1007/978-3-030-92075-3_12\">10.1007/978-3-030-92075-3_12</a>.","ista":"Chakraborty S, Ganesh C, Pancholi M, Sarkar P. 2021. Reverse firewalls for adaptively secure MPC without setup. 27th International Conference on the Theory and Application of Cryptology and Information Security. ASIACRYPT: International Conference on Cryptology in Asia, LNCS, vol. 13091, 335–364.","apa":"Chakraborty, S., Ganesh, C., Pancholi, M., &#38; Sarkar, P. (2021). Reverse firewalls for adaptively secure MPC without setup. In <i>27th International Conference on the Theory and Application of Cryptology and Information Security</i> (Vol. 13091, pp. 335–364). Virtual, Singapore: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-92075-3_12\">https://doi.org/10.1007/978-3-030-92075-3_12</a>","short":"S. Chakraborty, C. Ganesh, M. Pancholi, P. Sarkar, in:, 27th International Conference on the Theory and Application of Cryptology and Information Security, Springer Nature, 2021, pp. 335–364.","ieee":"S. Chakraborty, C. Ganesh, M. Pancholi, and P. Sarkar, “Reverse firewalls for adaptively secure MPC without setup,” in <i>27th International Conference on the Theory and Application of Cryptology and Information Security</i>, Virtual, Singapore, 2021, vol. 13091, pp. 335–364."},"type":"conference","department":[{"_id":"KrPi"}],"publication_identifier":{"isbn":["978-3-030-92074-6"],"eisbn":["978-3-030-92075-3"],"issn":["0302-9743"],"eissn":["1611-3349"]},"isi":1,"author":[{"first_name":"Suvradip","id":"B9CD0494-D033-11E9-B219-A439E6697425","full_name":"Chakraborty, Suvradip","last_name":"Chakraborty"},{"last_name":"Ganesh","full_name":"Ganesh, Chaya","first_name":"Chaya"},{"first_name":"Mahak","full_name":"Pancholi, Mahak","last_name":"Pancholi"},{"last_name":"Sarkar","full_name":"Sarkar, Pratik","first_name":"Pratik"}],"year":"2021","conference":{"name":"ASIACRYPT: International Conference on Cryptology in Asia","start_date":"2021-12-06","location":"Virtual, Singapore","end_date":"2021-12-10"},"oa_version":"Preprint","doi":"10.1007/978-3-030-92075-3_12","day":"01","publisher":"Springer Nature"},{"article_processing_charge":"No","keyword":["interacting particle systems","higher-order fields","hydrodynamic limit","equilibrium fluctuations","duality"],"date_published":"2021-03-16T00:00:00Z","ec_funded":1,"title":"Higher-order hydrodynamics and equilibrium fluctuations of interacting particle systems","date_updated":"2022-01-10T15:29:08Z","month":"03","_id":"10613","project":[{"grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships"}],"external_id":{"arxiv":["2008.13403"]},"date_created":"2022-01-10T14:02:31Z","publication":"Markov Processes And Related Fields","page":"339-380","intvolume":"        27","oa":1,"issue":"3","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","acknowledgement":"F.S. would like to thank Mario Ayala and Frank Redig for useful discussions. J.P.C. acknowledges partial financial support from the US National Science Foundation (DMS-1855604). F.S. was financially supported by the European Union’s Horizon 2020 research and innovation programme under the Marie-Skłodowska-Curie grant agreement No. 754411.\r\n","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2008.13403"}],"related_material":{"link":[{"relation":"other","url":"http://math-mprf.org/journal/articles/id1614/","description":"Link to Abstract on publisher's website"},{"relation":"used_for_analysis_in","description":"Referred to in Abstract","url":"https://arxiv.org/abs/2004.08412"}]},"volume":27,"year":"2021","author":[{"first_name":"Joe P.","last_name":"Chen","full_name":"Chen, Joe P."},{"id":"E1836206-9F16-11E9-8814-AEFDE5697425","first_name":"Federico","full_name":"Sau, Federico","last_name":"Sau"}],"publication_identifier":{"issn":["1024-2953"]},"department":[{"_id":"JaMa"}],"publisher":"Polymat Publishing","day":"16","arxiv":1,"oa_version":"Preprint","quality_controlled":"1","publication_status":"published","abstract":[{"lang":"eng","text":"Motivated by the recent preprint [\\emph{arXiv:2004.08412}] by Ayala, Carinci, and Redig, we first provide a general framework for the study of scaling limits of higher-order fields. Then, by considering the same class of infinite interacting particle systems as in [\\emph{arXiv:2004.08412}], namely symmetric simple exclusion and inclusion processes in the d-dimensional Euclidean lattice, we prove the hydrodynamic limit, and convergence for the equilibrium fluctuations, of higher-order fields. In particular, the limit fields exhibit a tensor structure. Our fluctuation result differs from that in [\\emph{arXiv:2004.08412}], since we considered-dimensional Euclidean lattice, we prove the hydrodynamic limit, and convergence for the equilibrium fluctuations, of higher-order fields. In particular, the limit fields exhibit a tensor structure. Our fluctuation result differs from that in [\\emph{arXiv:2004.08412}], since we consider a different notion of higher-order fluctuation fields."}],"status":"public","language":[{"iso":"eng"}],"article_type":"original","citation":{"apa":"Chen, J. P., &#38; Sau, F. (2021). Higher-order hydrodynamics and equilibrium fluctuations of interacting particle systems. <i>Markov Processes And Related Fields</i>. Polymat Publishing.","short":"J.P. Chen, F. Sau, Markov Processes And Related Fields 27 (2021) 339–380.","ieee":"J. P. Chen and F. Sau, “Higher-order hydrodynamics and equilibrium fluctuations of interacting particle systems,” <i>Markov Processes And Related Fields</i>, vol. 27, no. 3. Polymat Publishing, pp. 339–380, 2021.","ama":"Chen JP, Sau F. Higher-order hydrodynamics and equilibrium fluctuations of interacting particle systems. <i>Markov Processes And Related Fields</i>. 2021;27(3):339-380.","chicago":"Chen, Joe P., and Federico Sau. “Higher-Order Hydrodynamics and Equilibrium Fluctuations of Interacting Particle Systems.” <i>Markov Processes And Related Fields</i>. Polymat Publishing, 2021.","ista":"Chen JP, Sau F. 2021. Higher-order hydrodynamics and equilibrium fluctuations of interacting particle systems. Markov Processes And Related Fields. 27(3), 339–380.","mla":"Chen, Joe P., and Federico Sau. “Higher-Order Hydrodynamics and Equilibrium Fluctuations of Interacting Particle Systems.” <i>Markov Processes And Related Fields</i>, vol. 27, no. 3, Polymat Publishing, 2021, pp. 339–80."},"type":"journal_article"},{"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2006.08053"}],"volume":372,"intvolume":"       372","oa":1,"acknowledgement":"We thank A. H. Macdonald, J. Zhu, M. Zaletel, and D. Xiao for discussions of the results and E. Lachman for comments on the manuscript. Funding: The work was primarily funded by the US Department of Energy under DE-SC0020043, with additional support for instrumentation development supported by the Army Research Office under grant W911NF-16-1-0361. K.W. and T.T. acknowledge support from the Elemental Strategy Initiative conducted by MEXT, Japan, grant JPMXP0112101001; JSPS KAKENHI grant JP20H00354 and CREST grant JPMJCR15F3, JST. C.L.T. acknowledges support from the Hertz Foundation and from the National Science Foundation Graduate Research Fellowship Program under grant 1650114. This project is funded in part by the Gordon and Betty Moore Foundation’s EPiQS Initiative, grant GBMF9471 to A.F.Y.","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","issue":"6548","extern":"1","scopus_import":"1","month":"05","date_updated":"2022-01-13T14:11:36Z","title":"Imaging orbital ferromagnetism in a moiré Chern insulator","article_processing_charge":"No","keyword":["multidisciplinary"],"date_published":"2021-05-27T00:00:00Z","page":"1323-1327","publication":"Science","external_id":{"pmid":["34045322"],"arxiv":["2006.08053"]},"date_created":"2022-01-13T12:17:45Z","_id":"10616","status":"public","pmid":1,"language":[{"iso":"eng"}],"publication_status":"published","abstract":[{"text":"Electrons in moiré flat band systems can spontaneously break time-reversal symmetry, giving rise to a quantized anomalous Hall effect. In this study, we use a superconducting quantum interference device to image stray magnetic fields in twisted bilayer graphene aligned to hexagonal boron nitride. We find a magnetization of several Bohr magnetons per charge carrier, demonstrating that the magnetism is primarily orbital in nature. Our measurements reveal a large change in the magnetization as the chemical potential is swept across the quantum anomalous Hall gap, consistent with the expected contribution of chiral edge states to the magnetization of an orbital Chern insulator. Mapping the spatial evolution of field-driven magnetic reversal, we find a series of reproducible micrometer-scale domains pinned to structural disorder.","lang":"eng"}],"quality_controlled":"1","citation":{"ieee":"C. L. Tschirhart <i>et al.</i>, “Imaging orbital ferromagnetism in a moiré Chern insulator,” <i>Science</i>, vol. 372, no. 6548. American Association for the Advancement of Science, pp. 1323–1327, 2021.","short":"C.L. Tschirhart, M. Serlin, H. Polshyn, A. Shragai, Z. Xia, J. Zhu, Y. Zhang, K. Watanabe, T. Taniguchi, M.E. Huber, A.F. Young, Science 372 (2021) 1323–1327.","apa":"Tschirhart, C. L., Serlin, M., Polshyn, H., Shragai, A., Xia, Z., Zhu, J., … Young, A. F. (2021). Imaging orbital ferromagnetism in a moiré Chern insulator. <i>Science</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/science.abd3190\">https://doi.org/10.1126/science.abd3190</a>","mla":"Tschirhart, C. L., et al. “Imaging Orbital Ferromagnetism in a Moiré Chern Insulator.” <i>Science</i>, vol. 372, no. 6548, American Association for the Advancement of Science, 2021, pp. 1323–27, doi:<a href=\"https://doi.org/10.1126/science.abd3190\">10.1126/science.abd3190</a>.","ista":"Tschirhart CL, Serlin M, Polshyn H, Shragai A, Xia Z, Zhu J, Zhang Y, Watanabe K, Taniguchi T, Huber ME, Young AF. 2021. Imaging orbital ferromagnetism in a moiré Chern insulator. Science. 372(6548), 1323–1327.","ama":"Tschirhart CL, Serlin M, Polshyn H, et al. Imaging orbital ferromagnetism in a moiré Chern insulator. <i>Science</i>. 2021;372(6548):1323-1327. doi:<a href=\"https://doi.org/10.1126/science.abd3190\">10.1126/science.abd3190</a>","chicago":"Tschirhart, C. L., M. Serlin, Hryhoriy Polshyn, A. Shragai, Z. Xia, J. Zhu, Y. Zhang, et al. “Imaging Orbital Ferromagnetism in a Moiré Chern Insulator.” <i>Science</i>. American Association for the Advancement of Science, 2021. <a href=\"https://doi.org/10.1126/science.abd3190\">https://doi.org/10.1126/science.abd3190</a>."},"type":"journal_article","article_type":"original","publication_identifier":{"issn":["0036-8075"],"eissn":["1095-9203"]},"year":"2021","author":[{"full_name":"Tschirhart, C. L.","last_name":"Tschirhart","first_name":"C. L."},{"first_name":"M.","full_name":"Serlin, M.","last_name":"Serlin"},{"last_name":"Polshyn","orcid":"0000-0001-8223-8896","full_name":"Polshyn, Hryhoriy","id":"edfc7cb1-526e-11ec-b05a-e6ecc27e4e48","first_name":"Hryhoriy"},{"first_name":"A.","full_name":"Shragai, A.","last_name":"Shragai"},{"first_name":"Z.","last_name":"Xia","full_name":"Xia, Z."},{"last_name":"Zhu","full_name":"Zhu, J.","first_name":"J."},{"last_name":"Zhang","full_name":"Zhang, Y.","first_name":"Y."},{"first_name":"K.","last_name":"Watanabe","full_name":"Watanabe, K."},{"last_name":"Taniguchi","full_name":"Taniguchi, T.","first_name":"T."},{"last_name":"Huber","full_name":"Huber, M. E.","first_name":"M. E."},{"last_name":"Young","full_name":"Young, A. F.","first_name":"A. F."}],"arxiv":1,"oa_version":"Preprint","doi":"10.1126/science.abd3190","day":"27","publisher":"American Association for the Advancement of Science"},{"article_type":"original","type":"journal_article","citation":{"ieee":"H. Polshyn <i>et al.</i>, “Topological charge density waves at half-integer filling of a moiré superlattice,” <i>Nature Physics</i>. Springer Nature, 2021.","apa":"Polshyn, H., Zhang, Y., Kumar, M. A., Soejima, T., Ledwith, P., Watanabe, K., … Young, A. F. (2021). Topological charge density waves at half-integer filling of a moiré superlattice. <i>Nature Physics</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41567-021-01418-6\">https://doi.org/10.1038/s41567-021-01418-6</a>","short":"H. Polshyn, Y. Zhang, M.A. Kumar, T. Soejima, P. Ledwith, K. Watanabe, T. Taniguchi, A. Vishwanath, M.P. Zaletel, A.F. Young, Nature Physics (2021).","mla":"Polshyn, Hryhoriy, et al. “Topological Charge Density Waves at Half-Integer Filling of a Moiré Superlattice.” <i>Nature Physics</i>, Springer Nature, 2021, doi:<a href=\"https://doi.org/10.1038/s41567-021-01418-6\">10.1038/s41567-021-01418-6</a>.","ista":"Polshyn H, Zhang Y, Kumar MA, Soejima T, Ledwith P, Watanabe K, Taniguchi T, Vishwanath A, Zaletel MP, Young AF. 2021. Topological charge density waves at half-integer filling of a moiré superlattice. Nature Physics.","chicago":"Polshyn, Hryhoriy, Y. Zhang, M. A. Kumar, T. Soejima, P. Ledwith, K. Watanabe, T. Taniguchi, A. Vishwanath, M. P. Zaletel, and A. F. Young. “Topological Charge Density Waves at Half-Integer Filling of a Moiré Superlattice.” <i>Nature Physics</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1038/s41567-021-01418-6\">https://doi.org/10.1038/s41567-021-01418-6</a>.","ama":"Polshyn H, Zhang Y, Kumar MA, et al. Topological charge density waves at half-integer filling of a moiré superlattice. <i>Nature Physics</i>. 2021. doi:<a href=\"https://doi.org/10.1038/s41567-021-01418-6\">10.1038/s41567-021-01418-6</a>"},"quality_controlled":"1","abstract":[{"lang":"eng","text":"When a flat band is partially filled with electrons, strong Coulomb interactions between them may lead to the emergence of topological gapped states with quantized Hall conductivity. Such emergent topological states have been found in partially filled Landau levels1 and Hofstadter bands2,3; however, in both cases, a large magnetic field is required to produce the underlying flat band. The recent observation of quantum anomalous Hall effects in narrow-band moiré materials4,5,6,7 has led to the theoretical prediction that such phases could be realized at zero magnetic field8,9,10,11,12. Here we report the observation of insulators with Chern number C = 1 in the zero-magnetic-field limit at half-integer filling of the moiré superlattice unit cell in twisted monolayer–bilayer graphene7,13,14,15. Chern insulators in a half-filled band suggest the spontaneous doubling of the superlattice unit cell2,3,16, and our calculations find a ground state of the topological charge density wave at half-filling of the underlying band. The discovery of these topological phases at fractional superlattice filling enables the further pursuit of zero-magnetic-field phases that have fractional statistics that exist either as elementary excitations or bound to lattice dislocations."}],"publication_status":"published","status":"public","language":[{"iso":"eng"}],"publisher":"Springer Nature","day":"09","doi":"10.1038/s41567-021-01418-6","arxiv":1,"oa_version":"Preprint","year":"2021","author":[{"last_name":"Polshyn","full_name":"Polshyn, Hryhoriy","orcid":"0000-0001-8223-8896","first_name":"Hryhoriy","id":"edfc7cb1-526e-11ec-b05a-e6ecc27e4e48"},{"first_name":"Y.","last_name":"Zhang","full_name":"Zhang, Y."},{"first_name":"M. A.","last_name":"Kumar","full_name":"Kumar, M. A."},{"last_name":"Soejima","full_name":"Soejima, T.","first_name":"T."},{"first_name":"P.","last_name":"Ledwith","full_name":"Ledwith, P."},{"first_name":"K.","last_name":"Watanabe","full_name":"Watanabe, K."},{"last_name":"Taniguchi","full_name":"Taniguchi, T.","first_name":"T."},{"first_name":"A.","last_name":"Vishwanath","full_name":"Vishwanath, A."},{"first_name":"M. P.","last_name":"Zaletel","full_name":"Zaletel, M. P."},{"last_name":"Young","full_name":"Young, A. F.","first_name":"A. F."}],"publication_identifier":{"issn":["1745-2473"],"eissn":["1745-2481"]},"extern":"1","scopus_import":"1","oa":1,"acknowledgement":"We are grateful to J. Zhu for fruitful discussions. A.F.Y. acknowledges support from the Office of Naval Research under award N00014-20-1-2609, and the Gordon and Betty Moore Foundation under award GBMF9471. M.P.Z. acknowledges support from the ARO under MURI W911NF-16-1-0361. K.W. and T.T. acknowledge support from the Elemental Strategy Initiative conducted by the MEXT, Japan, via grant no. JPMXP0112101001; JSPS KAKENHI grant no. JP20H00354; and the CREST(JPMJCR15F3), JST. A.V. was supported by a Simons Investigator Award. P.L. was supported by the Department of Defense (DoD) through the National Defense Science and Engineering Graduate Fellowship (NDSEG) Program.","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","main_file_link":[{"url":"https://arxiv.org/abs/2104.01178","open_access":"1"}],"_id":"10617","external_id":{"arxiv":["2104.01178"]},"date_created":"2022-01-13T12:30:47Z","publication":"Nature Physics","keyword":["general physics","astronomy"],"article_processing_charge":"No","date_published":"2021-12-09T00:00:00Z","title":"Topological charge density waves at half-integer filling of a moiré superlattice","date_updated":"2022-01-13T14:11:31Z","month":"12"},{"date_created":"2022-01-16T23:01:28Z","external_id":{"arxiv":["2012.11625"],"isi":["000734063700001"]},"project":[{"name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","call_identifier":"H2020"}],"_id":"10628","file_date_updated":"2022-01-17T10:01:58Z","publication":"New Journal of Physics","ec_funded":1,"date_published":"2021-12-23T00:00:00Z","article_processing_charge":"No","month":"12","date_updated":"2023-08-17T06:54:54Z","title":"Shadow surface states in topological Kondo insulators","scopus_import":"1","issue":"12","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","acknowledgement":"PG acknowledges support from National Science Foundation Awards No. DMR-1824265 for this work. AG acknowledges support from the European Union's Horizon 2020 research and innovation program under the Marie Skłodowska-Curie Grant Agreement No. 754411. EMN is supported by ASU startup grant. OE is in part supported by NSF-DMR-1904716.","oa":1,"intvolume":"        23","article_number":"123042","volume":23,"day":"23","publisher":"IOP Publishing","arxiv":1,"oa_version":"Published Version","doi":"10.1088/1367-2630/ac4124","isi":1,"author":[{"id":"4AF46FD6-F248-11E8-B48F-1D18A9856A87","first_name":"Areg","last_name":"Ghazaryan","orcid":"0000-0001-9666-3543","full_name":"Ghazaryan, Areg"},{"full_name":"Nica, Emilian M.","last_name":"Nica","first_name":"Emilian M."},{"full_name":"Erten, Onur","last_name":"Erten","first_name":"Onur"},{"first_name":"Pouyan","last_name":"Ghaemi","full_name":"Ghaemi, Pouyan"}],"year":"2021","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publication_identifier":{"issn":["1367-2630"]},"department":[{"_id":"MiLe"}],"article_type":"original","ddc":["530"],"type":"journal_article","citation":{"chicago":"Ghazaryan, Areg, Emilian M. Nica, Onur Erten, and Pouyan Ghaemi. “Shadow Surface States in Topological Kondo Insulators.” <i>New Journal of Physics</i>. IOP Publishing, 2021. <a href=\"https://doi.org/10.1088/1367-2630/ac4124\">https://doi.org/10.1088/1367-2630/ac4124</a>.","ama":"Ghazaryan A, Nica EM, Erten O, Ghaemi P. Shadow surface states in topological Kondo insulators. <i>New Journal of Physics</i>. 2021;23(12). doi:<a href=\"https://doi.org/10.1088/1367-2630/ac4124\">10.1088/1367-2630/ac4124</a>","ista":"Ghazaryan A, Nica EM, Erten O, Ghaemi P. 2021. Shadow surface states in topological Kondo insulators. New Journal of Physics. 23(12), 123042.","mla":"Ghazaryan, Areg, et al. “Shadow Surface States in Topological Kondo Insulators.” <i>New Journal of Physics</i>, vol. 23, no. 12, 123042, IOP Publishing, 2021, doi:<a href=\"https://doi.org/10.1088/1367-2630/ac4124\">10.1088/1367-2630/ac4124</a>.","apa":"Ghazaryan, A., Nica, E. M., Erten, O., &#38; Ghaemi, P. (2021). Shadow surface states in topological Kondo insulators. <i>New Journal of Physics</i>. IOP Publishing. <a href=\"https://doi.org/10.1088/1367-2630/ac4124\">https://doi.org/10.1088/1367-2630/ac4124</a>","short":"A. Ghazaryan, E.M. Nica, O. Erten, P. Ghaemi, New Journal of Physics 23 (2021).","ieee":"A. Ghazaryan, E. M. Nica, O. Erten, and P. Ghaemi, “Shadow surface states in topological Kondo insulators,” <i>New Journal of Physics</i>, vol. 23, no. 12. IOP Publishing, 2021."},"file":[{"checksum":"0c3cb6816242fa8afd1cc87a5fe77821","relation":"main_file","file_size":2533102,"date_updated":"2022-01-17T10:01:58Z","content_type":"application/pdf","file_name":"2021_NewJourPhys_Ghazaryan.pdf","access_level":"open_access","success":1,"file_id":"10632","creator":"cchlebak","date_created":"2022-01-17T10:01:58Z"}],"quality_controlled":"1","language":[{"iso":"eng"}],"status":"public","has_accepted_license":"1","abstract":[{"text":"The surface states of 3D topological insulators in general have negligible quantum oscillations (QOs) when the chemical potential is tuned to the Dirac points. In contrast, we find that topological Kondo insulators (TKIs) can support surface states with an arbitrarily large Fermi surface (FS) when the chemical potential is pinned to the Dirac point. We illustrate that these FSs give rise to finite-frequency QOs, which can become comparable to the extremal area of the unhybridized bulk bands. We show that this occurs when the crystal symmetry is lowered from cubic to tetragonal in a minimal two-orbital model. We label such surface modes as 'shadow surface states'. Moreover, we show that the sufficient next-nearest neighbor out-of-plane hybridization leading to shadow surface states can be self-consistently stabilized for tetragonal TKIs. Consequently, shadow surface states provide an important example of high-frequency QOs beyond the context of cubic TKIs.","lang":"eng"}],"publication_status":"published"},{"article_number":"42","oa":1,"intvolume":"       213","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","volume":213,"alternative_title":["LIPIcs"],"scopus_import":"1","article_processing_charge":"No","date_published":"2021-11-29T00:00:00Z","title":"Quantitative verification on product graphs of small treewidth","date_updated":"2022-01-17T10:39:40Z","month":"11","_id":"10629","date_created":"2022-01-16T23:01:28Z","publication":"41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science","file_date_updated":"2022-01-17T10:36:08Z","quality_controlled":"1","abstract":[{"text":"Product graphs arise naturally in formal verification and program analysis. For example, the analysis of two concurrent threads requires the product of two component control-flow graphs, and for language inclusion of deterministic automata the product of two automata is constructed. In many cases, the component graphs have constant treewidth, e.g., when the input contains control-flow graphs of programs. We consider the algorithmic analysis of products of two constant-treewidth graphs with respect to three classic specification languages, namely, (a) algebraic properties, (b) mean-payoff properties, and (c) initial credit for energy properties.\r\nOur main contributions are as follows. Consider a graph G that is the product of two constant-treewidth graphs of size n each. First, given an idempotent semiring, we present an algorithm that computes the semiring transitive closure of G in time Õ(n⁴). Since the output has size Θ(n⁴), our algorithm is optimal (up to polylog factors). Second, given a mean-payoff objective, we present an O(n³)-time algorithm for deciding whether the value of a starting state is non-negative, improving the previously known O(n⁴) bound. Third, given an initial credit for energy objective, we present an O(n⁵)-time algorithm for computing the minimum initial credit for all nodes of G, improving the previously known O(n⁸) bound. At the heart of our approach lies an algorithm for the efficient construction of strongly-balanced tree decompositions of constant-treewidth graphs. Given a constant-treewidth graph G' of n nodes and a positive integer λ, our algorithm constructs a binary tree decomposition of G' of width O(λ) with the property that the size of each subtree decreases geometrically with rate (1/2 + 2^{-λ}).","lang":"eng"}],"publication_status":"published","has_accepted_license":"1","status":"public","language":[{"iso":"eng"}],"ddc":["000"],"file":[{"file_id":"10633","date_created":"2022-01-17T10:36:08Z","creator":"cchlebak","file_size":891566,"date_updated":"2022-01-17T10:36:08Z","content_type":"application/pdf","checksum":"71141acdeffa9056f24d6dbef952d254","relation":"main_file","access_level":"open_access","success":1,"file_name":"2021_LIPIcs_Chatterjee.pdf"}],"citation":{"ieee":"K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, “Quantitative verification on product graphs of small treewidth,” in <i>41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>, Virtual, 2021, vol. 213.","short":"K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, in:, 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.","apa":"Chatterjee, K., Ibsen-Jensen, R., &#38; Pavlogiannis, A. (2021). Quantitative verification on product graphs of small treewidth. In <i>41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i> (Vol. 213). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2021.42\">https://doi.org/10.4230/LIPIcs.FSTTCS.2021.42</a>","ista":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2021. Quantitative verification on product graphs of small treewidth. 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 213, 42.","mla":"Chatterjee, Krishnendu, et al. “Quantitative Verification on Product Graphs of Small Treewidth.” <i>41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>, vol. 213, 42, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2021.42\">10.4230/LIPIcs.FSTTCS.2021.42</a>.","ama":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. Quantitative verification on product graphs of small treewidth. In: <i>41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>. Vol 213. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021. doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2021.42\">10.4230/LIPIcs.FSTTCS.2021.42</a>","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Quantitative Verification on Product Graphs of Small Treewidth.” In <i>41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>, Vol. 213. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. <a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2021.42\">https://doi.org/10.4230/LIPIcs.FSTTCS.2021.42</a>."},"type":"conference","year":"2021","conference":{"end_date":"2021-12-17","location":"Virtual","start_date":"2021-12-15","name":"FSTTCS: Foundations of Software Technology and Theoretical Computer Science"},"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"id":"3B699956-F248-11E8-B48F-1D18A9856A87","first_name":"Rasmus","last_name":"Ibsen-Jensen","orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus"},{"orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas","last_name":"Pavlogiannis","first_name":"Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87"}],"department":[{"_id":"KrCh"}],"publication_identifier":{"isbn":["978-3-9597-7215-0"],"issn":["1868-8969"]},"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","day":"29","doi":"10.4230/LIPIcs.FSTTCS.2021.42","oa_version":"Published Version"},{"volume":213,"alternative_title":["LIPIcs"],"article_number":"34","acknowledgement":"We like to thank Lukas Fleischer and Michael Wehar for our discussions. This work started at the Schloss Dagstuhl Event 20483 Moderne Aspekte der Komplexitätstheorie in der Automatentheorie https://www.dagstuhl.de/20483.\r\n","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","intvolume":"       213","oa":1,"scopus_import":"1","title":"On the complexity of intersection non-emptiness for star-free language classes","date_updated":"2022-01-17T10:56:19Z","month":"11","date_published":"2021-11-29T00:00:00Z","article_processing_charge":"No","ec_funded":1,"file_date_updated":"2022-01-17T10:49:03Z","publication":"41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science","project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships"}],"_id":"10630","date_created":"2022-01-16T23:01:29Z","external_id":{"arxiv":["2110.01279"]},"publication_status":"published","abstract":[{"lang":"eng","text":"In the Intersection Non-emptiness problem, we are given a list of finite automata A_1, A_2,… , A_m over a common alphabet Σ as input, and the goal is to determine whether some string w ∈ Σ^* lies in the intersection of the languages accepted by the automata in the list. We analyze the complexity of the Intersection Non-emptiness problem under the promise that all input automata accept a language in some level of the dot-depth hierarchy, or some level of the Straubing-Thérien hierarchy. Automata accepting languages from the lowest levels of these hierarchies arise naturally in the context of model checking. We identify a dichotomy in the dot-depth hierarchy by showing that the problem is already NP-complete when all input automata accept languages of the levels B_0 or B_{1/2} and already PSPACE-hard when all automata accept a language from the level B_1. Conversely, we identify a tetrachotomy in the Straubing-Thérien hierarchy. More precisely, we show that the problem is in AC^0 when restricted to level L_0; complete for L or NL, depending on the input representation, when restricted to languages in the level L_{1/2}; NP-complete when the input is given as DFAs accepting a language in L_1 or L_{3/2}; and finally, PSPACE-complete when the input automata accept languages in level L_2 or higher. Moreover, we show that the proof technique used to show containment in NP for DFAs accepting languages in L_1 or L_{3/2} does not generalize to the context of NFAs. To prove this, we identify a family of languages that provide an exponential separation between the state complexity of general NFAs and that of partially ordered NFAs. To the best of our knowledge, this is the first superpolynomial separation between these two models of computation."}],"language":[{"iso":"eng"}],"has_accepted_license":"1","status":"public","quality_controlled":"1","file":[{"date_created":"2022-01-17T10:49:03Z","creator":"cchlebak","file_id":"10634","file_name":"2021_LIPIcs_Arrighi.pdf","success":1,"access_level":"open_access","relation":"main_file","checksum":"d5a82ba893c3bc5da5914edbb3efb92b","date_updated":"2022-01-17T10:49:03Z","content_type":"application/pdf","file_size":844224}],"type":"conference","citation":{"ieee":"E. Arrighi <i>et al.</i>, “On the complexity of intersection non-emptiness for star-free language classes,” in <i>41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>, Virtual, 2021, vol. 213.","apa":"Arrighi, E., Fernau, H., Hoffmann, S., Holzer, M., Jecker, I. R., De Oliveira Oliveira, M., &#38; Wolf, P. (2021). On the complexity of intersection non-emptiness for star-free language classes. In <i>41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i> (Vol. 213). Virtual: Schloss Dagstuhl - Leibniz Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2021.34\">https://doi.org/10.4230/LIPIcs.FSTTCS.2021.34</a>","short":"E. Arrighi, H. Fernau, S. Hoffmann, M. Holzer, I.R. Jecker, M. De Oliveira Oliveira, P. Wolf, in:, 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.","mla":"Arrighi, Emmanuel, et al. “On the Complexity of Intersection Non-Emptiness for Star-Free Language Classes.” <i>41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>, vol. 213, 34, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2021.34\">10.4230/LIPIcs.FSTTCS.2021.34</a>.","ista":"Arrighi E, Fernau H, Hoffmann S, Holzer M, Jecker IR, De Oliveira Oliveira M, Wolf P. 2021. On the complexity of intersection non-emptiness for star-free language classes. 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 213, 34.","chicago":"Arrighi, Emmanuel, Henning Fernau, Stefan Hoffmann, Markus Holzer, Ismael R Jecker, Mateus De Oliveira Oliveira, and Petra Wolf. “On the Complexity of Intersection Non-Emptiness for Star-Free Language Classes.” In <i>41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>, Vol. 213. Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021. <a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2021.34\">https://doi.org/10.4230/LIPIcs.FSTTCS.2021.34</a>.","ama":"Arrighi E, Fernau H, Hoffmann S, et al. On the complexity of intersection non-emptiness for star-free language classes. In: <i>41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>. Vol 213. Schloss Dagstuhl - Leibniz Zentrum für Informatik; 2021. doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2021.34\">10.4230/LIPIcs.FSTTCS.2021.34</a>"},"ddc":["000"],"publication_identifier":{"isbn":["978-3-9597-7215-0"],"issn":["1868-8969"]},"department":[{"_id":"KrCh"}],"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"author":[{"last_name":"Arrighi","full_name":"Arrighi, Emmanuel","first_name":"Emmanuel"},{"first_name":"Henning","full_name":"Fernau, Henning","last_name":"Fernau"},{"last_name":"Hoffmann","full_name":"Hoffmann, Stefan","first_name":"Stefan"},{"full_name":"Holzer, Markus","last_name":"Holzer","first_name":"Markus"},{"id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425","first_name":"Ismael R","last_name":"Jecker","full_name":"Jecker, Ismael R"},{"first_name":"Mateus","last_name":"De Oliveira Oliveira","full_name":"De Oliveira Oliveira, Mateus"},{"full_name":"Wolf, Petra","last_name":"Wolf","first_name":"Petra"}],"year":"2021","conference":{"start_date":"2021-12-15","location":"Virtual","end_date":"2021-12-17","name":"FSTTCS: Foundations of Software Technology and Theoretical Computer Science"},"doi":"10.4230/LIPIcs.FSTTCS.2021.34","arxiv":1,"oa_version":"Published Version","publisher":"Schloss Dagstuhl - Leibniz Zentrum für Informatik","day":"29"},{"scopus_import":"1","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","issue":"6","acknowledgement":"I.C. acknowledges the support by the European Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie Grant Agreement No. 665385. G.B. acknowledges support from the Austrian Science Fund (FWF), under project No. M2461-N27. M.L. acknowledges support by the Austrian Science Fund (FWF), under project No. P29902-N27, and by the European Research Council (ERC) Starting Grant No. 801770 (ANGULON). H.S acknowledges support from the European Research Council-AdG (Project No. 320459, DropletControl) and from The Villum Foundation through a Villum Investigator grant no. 25886.","oa":1,"intvolume":"       104","article_number":"L061303","volume":104,"main_file_link":[{"url":"http://128.84.4.18/abs/2107.00468","open_access":"1"}],"date_created":"2022-01-16T23:01:29Z","external_id":{"isi":["000739618300001"],"arxiv":["2107.00468"]},"_id":"10631","project":[{"_id":"26031614-B435-11E9-9278-68D0E5697425","grant_number":"P29902","call_identifier":"FWF","name":"Quantum rotations in the presence of a many-body environment"},{"name":"Angulon: physics and applications of a new quasiparticle","grant_number":"801770","_id":"2688CF98-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","call_identifier":"H2020"},{"call_identifier":"FWF","grant_number":"M02641","_id":"26986C82-B435-11E9-9278-68D0E5697425","name":"A path-integral approach to composite impurities"}],"publication":"Physical Review A","ec_funded":1,"date_published":"2021-12-30T00:00:00Z","article_processing_charge":"No","month":"12","date_updated":"2024-08-07T07:16:52Z","title":"Excited rotational states of molecules in a superfluid","article_type":"original","citation":{"ista":"Cherepanov I, Bighin G, Schouder CA, Chatterley AS, Albrechtsen SH, Muñoz AV, Christiansen L, Stapelfeldt H, Lemeshko M. 2021. Excited rotational states of molecules in a superfluid. Physical Review A. 104(6), L061303.","mla":"Cherepanov, Igor, et al. “Excited Rotational States of Molecules in a Superfluid.” <i>Physical Review A</i>, vol. 104, no. 6, L061303, American Physical Society, 2021, doi:<a href=\"https://doi.org/10.1103/PhysRevA.104.L061303\">10.1103/PhysRevA.104.L061303</a>.","ama":"Cherepanov I, Bighin G, Schouder CA, et al. Excited rotational states of molecules in a superfluid. <i>Physical Review A</i>. 2021;104(6). doi:<a href=\"https://doi.org/10.1103/PhysRevA.104.L061303\">10.1103/PhysRevA.104.L061303</a>","chicago":"Cherepanov, Igor, Giacomo Bighin, Constant A. Schouder, Adam S. Chatterley, Simon H. Albrechtsen, Alberto Viñas Muñoz, Lars Christiansen, Henrik Stapelfeldt, and Mikhail Lemeshko. “Excited Rotational States of Molecules in a Superfluid.” <i>Physical Review A</i>. American Physical Society, 2021. <a href=\"https://doi.org/10.1103/PhysRevA.104.L061303\">https://doi.org/10.1103/PhysRevA.104.L061303</a>.","ieee":"I. Cherepanov <i>et al.</i>, “Excited rotational states of molecules in a superfluid,” <i>Physical Review A</i>, vol. 104, no. 6. American Physical Society, 2021.","short":"I. Cherepanov, G. Bighin, C.A. Schouder, A.S. Chatterley, S.H. Albrechtsen, A.V. Muñoz, L. Christiansen, H. Stapelfeldt, M. Lemeshko, Physical Review A 104 (2021).","apa":"Cherepanov, I., Bighin, G., Schouder, C. A., Chatterley, A. S., Albrechtsen, S. H., Muñoz, A. V., … Lemeshko, M. (2021). Excited rotational states of molecules in a superfluid. <i>Physical Review A</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevA.104.L061303\">https://doi.org/10.1103/PhysRevA.104.L061303</a>"},"type":"journal_article","quality_controlled":"1","language":[{"iso":"eng"}],"status":"public","abstract":[{"text":"We combine experimental and theoretical approaches to explore excited rotational states of molecules embedded in helium nanodroplets using CS2 and I2 as examples. Laser-induced nonadiabatic molecular alignment is employed to measure spectral lines for rotational states extending beyond those initially populated at the 0.37 K droplet temperature. We construct a simple quantum-mechanical model, based on a linear rotor coupled to a single-mode bosonic bath, to determine the rotational energy structure in its entirety. The calculated and measured spectral lines are in good agreement. We show that the effect of the surrounding superfluid on molecular rotation can be rationalized by a single quantity, the angular momentum, transferred from the molecule to the droplet.","lang":"eng"}],"publication_status":"published","day":"30","publisher":"American Physical Society","oa_version":"Preprint","arxiv":1,"doi":"10.1103/PhysRevA.104.L061303","author":[{"id":"339C7E5A-F248-11E8-B48F-1D18A9856A87","first_name":"Igor","full_name":"Cherepanov, Igor","last_name":"Cherepanov"},{"orcid":"0000-0001-8823-9777","full_name":"Bighin, Giacomo","last_name":"Bighin","first_name":"Giacomo","id":"4CA96FD4-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Constant A.","last_name":"Schouder","full_name":"Schouder, Constant A."},{"first_name":"Adam S.","full_name":"Chatterley, Adam S.","last_name":"Chatterley"},{"full_name":"Albrechtsen, Simon H.","last_name":"Albrechtsen","first_name":"Simon H."},{"first_name":"Alberto Viñas","last_name":"Muñoz","full_name":"Muñoz, Alberto Viñas"},{"first_name":"Lars","full_name":"Christiansen, Lars","last_name":"Christiansen"},{"full_name":"Stapelfeldt, Henrik","last_name":"Stapelfeldt","first_name":"Henrik"},{"full_name":"Lemeshko, Mikhail","orcid":"0000-0002-6990-7802","last_name":"Lemeshko","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","first_name":"Mikhail"}],"isi":1,"year":"2021","department":[{"_id":"MiLe"}],"publication_identifier":{"eissn":["2469-9934"],"issn":["2469-9926"]}},{"month":"12","date_updated":"2022-01-17T13:30:01Z","title":"Nonlinear computations in spiking neural networks through multiplicative synapses","ec_funded":1,"date_published":"2021-12-15T00:00:00Z","article_processing_charge":"No","file_date_updated":"2022-01-17T11:15:26Z","publication":"Peer Community Journal","date_created":"2022-01-17T11:12:40Z","external_id":{"arxiv":["2009.03857"]},"_id":"10635","project":[{"call_identifier":"H2020","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program"}],"volume":1,"acknowledgement":"A preprint version of this article has been peer-reviewed and recommended by Peer Community In Neuroscience (DOI link to the recommendation: https://doi.org/10.24072/pci.cneuro.100003).\r\nWe thank Christian Machens and Nuno Calaim for useful discussions on the project. This report\r\ncame out of a collaboration started at the CAJAL Advanced Neuroscience Training Programme in\r\nComputational Neuroscience in Lisbon, Portugal, during the 2019 summer. The authors would\r\nlike to thank the participants, TAs, lecturers, and organizers of the summer school. SWK was\r\nsupported by the Simons Collaboration on the Global Brain (543009). WFP was supported by\r\nFCT (032077). MN was supported by European Union Horizon 2020 (665385).\r\n","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","intvolume":"         1","oa":1,"article_number":"e68","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publication_identifier":{"eissn":["2804-3871"]},"department":[{"_id":"GradSch"},{"_id":"JoCs"}],"author":[{"id":"30BD0376-F248-11E8-B48F-1D18A9856A87","first_name":"Michele","orcid":"0000-0001-8849-6570","full_name":"Nardin, Michele","last_name":"Nardin"},{"full_name":"Phillips, James W.","last_name":"Phillips","first_name":"James W."},{"full_name":"Podlaski, William F.","last_name":"Podlaski","first_name":"William F."},{"last_name":"Keemink","full_name":"Keemink, Sander W.","first_name":"Sander W."}],"year":"2021","arxiv":1,"oa_version":"Published Version","doi":"10.24072/pcjournal.69","day":"15","publisher":"Centre Mersenne ; Peer Community In","language":[{"iso":"eng"}],"has_accepted_license":"1","status":"public","abstract":[{"text":"The brain efficiently performs nonlinear computations through its intricate networks of spiking neurons, but how this is done remains elusive. While nonlinear computations can be implemented successfully in spiking neural networks, this requires supervised training and the resulting connectivity can be hard to interpret. In contrast, the required connectivity for any computation in the form of a linear dynamical system can be directly derived and understood with the spike coding network (SCN) framework. These networks also have biologically realistic activity patterns and are highly robust to cell death. Here we extend the SCN framework to directly implement any polynomial dynamical system, without the need for training. This results in networks requiring a mix of synapse types (fast, slow, and multiplicative), which we term multiplicative spike coding networks (mSCNs). Using mSCNs, we demonstrate how to directly derive the required connectivity for several nonlinear dynamical systems. We also show how to carry out higher-order polynomials with coupled networks that use only pair-wise multiplicative synapses, and provide expected numbers of connections for each synapse type. Overall, our work demonstrates a novel method for implementing nonlinear computations in spiking neural networks, while keeping the attractive features of standard SCNs (robustness, realistic activity patterns, and interpretable connectivity). Finally, we discuss the biological plausibility of our approach, and how the high accuracy and robustness of the approach may be of interest for neuromorphic computing.","lang":"eng"}],"publication_status":"published","quality_controlled":"1","citation":{"short":"M. Nardin, J.W. Phillips, W.F. Podlaski, S.W. Keemink, Peer Community Journal 1 (2021).","apa":"Nardin, M., Phillips, J. W., Podlaski, W. F., &#38; Keemink, S. W. (2021). Nonlinear computations in spiking neural networks through multiplicative synapses. <i>Peer Community Journal</i>. Centre Mersenne ; Peer Community In. <a href=\"https://doi.org/10.24072/pcjournal.69\">https://doi.org/10.24072/pcjournal.69</a>","ieee":"M. Nardin, J. W. Phillips, W. F. Podlaski, and S. W. Keemink, “Nonlinear computations in spiking neural networks through multiplicative synapses,” <i>Peer Community Journal</i>, vol. 1. Centre Mersenne ; Peer Community In, 2021.","ama":"Nardin M, Phillips JW, Podlaski WF, Keemink SW. Nonlinear computations in spiking neural networks through multiplicative synapses. <i>Peer Community Journal</i>. 2021;1. doi:<a href=\"https://doi.org/10.24072/pcjournal.69\">10.24072/pcjournal.69</a>","chicago":"Nardin, Michele, James W. Phillips, William F. Podlaski, and Sander W. Keemink. “Nonlinear Computations in Spiking Neural Networks through Multiplicative Synapses.” <i>Peer Community Journal</i>. Centre Mersenne ; Peer Community In, 2021. <a href=\"https://doi.org/10.24072/pcjournal.69\">https://doi.org/10.24072/pcjournal.69</a>.","ista":"Nardin M, Phillips JW, Podlaski WF, Keemink SW. 2021. Nonlinear computations in spiking neural networks through multiplicative synapses. Peer Community Journal. 1, e68.","mla":"Nardin, Michele, et al. “Nonlinear Computations in Spiking Neural Networks through Multiplicative Synapses.” <i>Peer Community Journal</i>, vol. 1, e68, Centre Mersenne ; Peer Community In, 2021, doi:<a href=\"https://doi.org/10.24072/pcjournal.69\">10.24072/pcjournal.69</a>."},"type":"journal_article","file":[{"date_created":"2022-01-17T11:15:26Z","creator":"mnardin","file_id":"10636","access_level":"open_access","success":1,"file_name":"10_24072_pcjournal_69.pdf","file_size":3311494,"content_type":"application/pdf","date_updated":"2022-01-17T11:15:26Z","relation":"main_file","checksum":"cd9af6b331918608f2e3d1c7940cbf4f"}],"article_type":"original","ddc":["519"]}]