[{"external_id":{"isi":["000680039500013"],"arxiv":["2101.10958"]},"project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","grant_number":"754411"},{"name":"Angulon: physics and applications of a new quasiparticle","_id":"2688CF98-B435-11E9-9278-68D0E5697425","grant_number":"801770","call_identifier":"H2020"}],"scopus_import":"1","citation":{"ieee":"F. Brauneis, H.-W. Hammer, M. Lemeshko, and A. Volosniev, “Impurities in a one-dimensional Bose gas: The flow equation approach,” <i>SciPost Physics</i>, vol. 11, no. 1. SciPost, 2021.","ista":"Brauneis F, Hammer H-W, Lemeshko M, Volosniev A. 2021. Impurities in a one-dimensional Bose gas: The flow equation approach. SciPost Physics. 11(1), 008.","ama":"Brauneis F, Hammer H-W, Lemeshko M, Volosniev A. Impurities in a one-dimensional Bose gas: The flow equation approach. <i>SciPost Physics</i>. 2021;11(1). doi:<a href=\"https://doi.org/10.21468/scipostphys.11.1.008\">10.21468/scipostphys.11.1.008</a>","chicago":"Brauneis, Fabian, Hans-Werner Hammer, Mikhail Lemeshko, and Artem Volosniev. “Impurities in a One-Dimensional Bose Gas: The Flow Equation Approach.” <i>SciPost Physics</i>. SciPost, 2021. <a href=\"https://doi.org/10.21468/scipostphys.11.1.008\">https://doi.org/10.21468/scipostphys.11.1.008</a>.","mla":"Brauneis, Fabian, et al. “Impurities in a One-Dimensional Bose Gas: The Flow Equation Approach.” <i>SciPost Physics</i>, vol. 11, no. 1, 008, SciPost, 2021, doi:<a href=\"https://doi.org/10.21468/scipostphys.11.1.008\">10.21468/scipostphys.11.1.008</a>.","apa":"Brauneis, F., Hammer, H.-W., Lemeshko, M., &#38; Volosniev, A. (2021). Impurities in a one-dimensional Bose gas: The flow equation approach. <i>SciPost Physics</i>. SciPost. <a href=\"https://doi.org/10.21468/scipostphys.11.1.008\">https://doi.org/10.21468/scipostphys.11.1.008</a>","short":"F. Brauneis, H.-W. Hammer, M. Lemeshko, A. Volosniev, SciPost Physics 11 (2021)."},"arxiv":1,"intvolume":"        11","day":"13","isi":1,"department":[{"_id":"MiLe"}],"month":"07","author":[{"full_name":"Brauneis, Fabian","last_name":"Brauneis","first_name":"Fabian"},{"first_name":"Hans-Werner","last_name":"Hammer","full_name":"Hammer, Hans-Werner"},{"orcid":"0000-0002-6990-7802","full_name":"Lemeshko, Mikhail","first_name":"Mikhail","last_name":"Lemeshko","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0003-0393-5525","full_name":"Volosniev, Artem","first_name":"Artem","last_name":"Volosniev","id":"37D278BC-F248-11E8-B48F-1D18A9856A87"}],"article_type":"original","date_updated":"2023-08-11T10:25:44Z","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"volume":11,"acknowledgement":"We thank Matthias Heinz and Volker Karle for helpful comments on the manuscript; Zoran Ristivojevic for useful correspondence regarding mean-field calculations of induced impurity-impurity interactions; Fabian Grusdt for sharing with us the data for the densities presented in Ref. [14]. This work has received funding from the DFG Project No. 413495248 [VO 2437/1-1] (F. B., H.-W. H., A. G. V.) and European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 754411 (A. G. V.). M. L. acknowledges support by the European Research Council (ERC) Starting Grant No. 801770 (ANGULON). H.-W.H. thanks the ECT* for hospitality during the workshop “Universal physics in Many-Body Quantum Systems – From Atoms to Quarks\". This infrastructure is part of a project that has received funding from the European Union’s Horizon 2020 research and innovation programme under grant agreement No 824093. H.-W.H. was supported by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) - Project-ID 279384907 - SFB 1245.","file_date_updated":"2021-08-10T11:44:59Z","issue":"1","date_created":"2021-08-04T15:00:55Z","_id":"9769","publication":"SciPost Physics","abstract":[{"text":"A few years ago, flow equations were introduced as a technique for calculating the ground-state energies of cold Bose gases with and without impurities. In this paper, we extend this approach to compute observables other than the energy. As an example, we calculate the densities, and phase fluctuations of one-dimensional Bose gases with one and two impurities. For a single mobile impurity, we use flow equations to validate the mean-field results obtained upon the Lee-Low-Pines transformation. We show that the mean-field approximation is accurate for all values of the boson-impurity interaction strength as long as the phase coherence length is much larger than the healing length of the condensate. For two static impurities, we calculate impurity-impurity interactions induced by the Bose gas. We find that leading order perturbation theory fails when boson-impurity interactions are stronger than boson-boson interactions. The mean-field approximation reproduces the flow equation results for all values of the boson-impurity interaction strength as long as boson-boson interactions are weak.","lang":"eng"}],"doi":"10.21468/scipostphys.11.1.008","title":"Impurities in a one-dimensional Bose gas: The flow equation approach","type":"journal_article","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","file":[{"checksum":"eaa847346b1a023d97bbb291779610ed","access_level":"open_access","creator":"asandaue","content_type":"application/pdf","relation":"main_file","date_created":"2021-08-10T11:44:59Z","file_size":1085300,"date_updated":"2021-08-10T11:44:59Z","file_name":"2021_SciPostPhysics_Brauneis.pdf","success":1,"file_id":"9875"}],"ddc":["530"],"quality_controlled":"1","publisher":"SciPost","date_published":"2021-07-13T00:00:00Z","publication_identifier":{"eissn":["2542-4653"]},"year":"2021","publication_status":"published","has_accepted_license":"1","oa":1,"oa_version":"Published Version","status":"public","language":[{"iso":"eng"}],"ec_funded":1,"article_number":"008","article_processing_charge":"Yes"},{"_id":"9770","date_created":"2021-08-04T15:05:32Z","issue":"2","volume":104,"acknowledgement":"We thank Rafael Barfknecht for useful discussions. This work has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 754411 (A.G.\r\nand A.G.V.). M.L. acknowledges support by the European Research Council (ERC) Starting Grant No. 801770 (ANGULON). Y.P. and O.M. acknowledge funding from the Nidersachsen Ministry of Science and Culture, and from the\r\nAcademia Sinica Research Program. O.M. is thankful for support through the Harry de Jur Chair in Applied Science.","date_updated":"2023-08-10T14:27:07Z","author":[{"full_name":"Volosniev, Artem","orcid":"0000-0003-0393-5525","first_name":"Artem","id":"37D278BC-F248-11E8-B48F-1D18A9856A87","last_name":"Volosniev"},{"first_name":"Hen","last_name":"Alpern","full_name":"Alpern, Hen"},{"full_name":"Paltiel, Yossi","last_name":"Paltiel","first_name":"Yossi"},{"full_name":"Millo, Oded","last_name":"Millo","first_name":"Oded"},{"full_name":"Lemeshko, Mikhail","orcid":"0000-0002-6990-7802","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","last_name":"Lemeshko","first_name":"Mikhail"},{"full_name":"Ghazaryan, Areg","orcid":"0000-0001-9666-3543","first_name":"Areg","id":"4AF46FD6-F248-11E8-B48F-1D18A9856A87","last_name":"Ghazaryan"}],"article_type":"original","department":[{"_id":"MiLe"}],"month":"07","isi":1,"day":"01","intvolume":"       104","arxiv":1,"citation":{"ieee":"A. Volosniev, H. Alpern, Y. Paltiel, O. Millo, M. Lemeshko, and A. Ghazaryan, “Interplay between friction and spin-orbit coupling as a source of spin polarization,” <i>Physical Review B</i>, vol. 104, no. 2. American Physical Society, 2021.","ama":"Volosniev A, Alpern H, Paltiel Y, Millo O, Lemeshko M, Ghazaryan A. Interplay between friction and spin-orbit coupling as a source of spin polarization. <i>Physical Review B</i>. 2021;104(2). doi:<a href=\"https://doi.org/10.1103/physrevb.104.024430\">10.1103/physrevb.104.024430</a>","chicago":"Volosniev, Artem, Hen Alpern, Yossi Paltiel, Oded Millo, Mikhail Lemeshko, and Areg Ghazaryan. “Interplay between Friction and Spin-Orbit Coupling as a Source of Spin Polarization.” <i>Physical Review B</i>. American Physical Society, 2021. <a href=\"https://doi.org/10.1103/physrevb.104.024430\">https://doi.org/10.1103/physrevb.104.024430</a>.","ista":"Volosniev A, Alpern H, Paltiel Y, Millo O, Lemeshko M, Ghazaryan A. 2021. Interplay between friction and spin-orbit coupling as a source of spin polarization. Physical Review B. 104(2), 024430.","apa":"Volosniev, A., Alpern, H., Paltiel, Y., Millo, O., Lemeshko, M., &#38; Ghazaryan, A. (2021). Interplay between friction and spin-orbit coupling as a source of spin polarization. <i>Physical Review B</i>. American Physical Society. <a href=\"https://doi.org/10.1103/physrevb.104.024430\">https://doi.org/10.1103/physrevb.104.024430</a>","mla":"Volosniev, Artem, et al. “Interplay between Friction and Spin-Orbit Coupling as a Source of Spin Polarization.” <i>Physical Review B</i>, vol. 104, no. 2, 024430, American Physical Society, 2021, doi:<a href=\"https://doi.org/10.1103/physrevb.104.024430\">10.1103/physrevb.104.024430</a>.","short":"A. Volosniev, H. Alpern, Y. Paltiel, O. Millo, M. Lemeshko, A. Ghazaryan, Physical Review B 104 (2021)."},"project":[{"call_identifier":"H2020","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425"},{"_id":"2688CF98-B435-11E9-9278-68D0E5697425","name":"Angulon: physics and applications of a new quasiparticle","call_identifier":"H2020","grant_number":"801770"}],"scopus_import":"1","external_id":{"isi":["000678780800003"],"arxiv":["2101.05173"]},"article_processing_charge":"No","ec_funded":1,"article_number":"024430","language":[{"iso":"eng"}],"status":"public","oa_version":"Preprint","oa":1,"publication_identifier":{"eissn":["2469-9969"],"issn":["2469-9950"]},"year":"2021","publication_status":"published","date_published":"2021-07-01T00:00:00Z","publisher":"American Physical Society","quality_controlled":"1","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","type":"journal_article","title":"Interplay between friction and spin-orbit coupling as a source of spin polarization","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2101.05173"}],"doi":"10.1103/physrevb.104.024430","abstract":[{"text":"We study an effective one-dimensional quantum model that includes friction and spin-orbit coupling (SOC), and show that the model exhibits spin polarization when both terms are finite. Most important, strong spin polarization can be observed even for moderate SOC, provided that the friction is strong. Our findings might help to explain the pronounced effect of chirality on spin distribution and transport in chiral molecules. In particular, our model implies static magnetic properties of a chiral molecule, which lead to Shiba-like states when a molecule is placed on a superconductor, in accordance with recent experimental data.","lang":"eng"}],"publication":"Physical Review B"},{"date_updated":"2023-08-10T14:16:16Z","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"article_type":"original","keyword":["general physics and astronomy","general biochemistry","genetics and molecular biology","general chemistry"],"author":[{"id":"3AE48E0A-F248-11E8-B48F-1D18A9856A87","last_name":"Vandael","first_name":"David H","full_name":"Vandael, David H","orcid":"0000-0001-7577-1676"},{"id":"3337E116-F248-11E8-B48F-1D18A9856A87","last_name":"Okamoto","first_name":"Yuji","full_name":"Okamoto, Yuji","orcid":"0000-0003-0408-6094"},{"last_name":"Jonas","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","first_name":"Peter M","orcid":"0000-0001-5001-4804","full_name":"Jonas, Peter M"}],"date_created":"2021-08-06T07:22:55Z","_id":"9778","acknowledgement":"We thank Drs. Carolina Borges-Merjane and Jose Guzman for critically reading the manuscript, and Pablo Castillo for discussions. We are grateful to Alois Schlögl for help with analysis, Florian Marr for excellent technical assistance and cell reconstruction, Christina Altmutter for technical help, Eleftheria Kralli-Beller for manuscript editing, and the Scientific Service Units of IST Austria for support. This project received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation program (grant agreement No 692692) and the Fond zur Förderung der Wissenschaftlichen Forschung (Z 312-B27, Wittgenstein award), both to P.J.","volume":12,"issue":"1","file_date_updated":"2021-12-17T11:34:50Z","scopus_import":"1","project":[{"call_identifier":"H2020","grant_number":"692692","_id":"25B7EB9E-B435-11E9-9278-68D0E5697425","name":"Biophysics and circuit function of a giant cortical glumatergic synapse"},{"name":"The Wittgenstein Prize","_id":"25C5A090-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z00312"}],"citation":{"ieee":"D. H. Vandael, Y. Okamoto, and P. M. Jonas, “Transsynaptic modulation of presynaptic short-term plasticity in hippocampal mossy fiber synapses,” <i>Nature Communications</i>, vol. 12, no. 1. Springer, 2021.","short":"D.H. Vandael, Y. Okamoto, P.M. Jonas, Nature Communications 12 (2021).","apa":"Vandael, D. H., Okamoto, Y., &#38; Jonas, P. M. (2021). Transsynaptic modulation of presynaptic short-term plasticity in hippocampal mossy fiber synapses. <i>Nature Communications</i>. Springer. <a href=\"https://doi.org/10.1038/s41467-021-23153-5\">https://doi.org/10.1038/s41467-021-23153-5</a>","mla":"Vandael, David H., et al. “Transsynaptic Modulation of Presynaptic Short-Term Plasticity in Hippocampal Mossy Fiber Synapses.” <i>Nature Communications</i>, vol. 12, no. 1, 2912, Springer, 2021, doi:<a href=\"https://doi.org/10.1038/s41467-021-23153-5\">10.1038/s41467-021-23153-5</a>.","chicago":"Vandael, David H, Yuji Okamoto, and Peter M Jonas. “Transsynaptic Modulation of Presynaptic Short-Term Plasticity in Hippocampal Mossy Fiber Synapses.” <i>Nature Communications</i>. Springer, 2021. <a href=\"https://doi.org/10.1038/s41467-021-23153-5\">https://doi.org/10.1038/s41467-021-23153-5</a>.","ama":"Vandael DH, Okamoto Y, Jonas PM. Transsynaptic modulation of presynaptic short-term plasticity in hippocampal mossy fiber synapses. <i>Nature Communications</i>. 2021;12(1). doi:<a href=\"https://doi.org/10.1038/s41467-021-23153-5\">10.1038/s41467-021-23153-5</a>","ista":"Vandael DH, Okamoto Y, Jonas PM. 2021. Transsynaptic modulation of presynaptic short-term plasticity in hippocampal mossy fiber synapses. Nature Communications. 12(1), 2912."},"external_id":{"isi":["000655481800014"]},"isi":1,"department":[{"_id":"PeJo"}],"month":"05","intvolume":"        12","day":"18","date_published":"2021-05-18T00:00:00Z","year":"2021","publication_status":"published","publication_identifier":{"issn":["2041-1723"]},"quality_controlled":"1","publisher":"Springer","language":[{"iso":"eng"}],"related_material":{"link":[{"url":"https://ist.ac.at/en/news/synaptic-transmission-not-a-one-way-street/","relation":"press_release","description":"News on IST Homepage"}]},"article_number":"2912","ec_funded":1,"article_processing_charge":"No","has_accepted_license":"1","oa":1,"oa_version":"Published Version","status":"public","doi":"10.1038/s41467-021-23153-5","publication":"Nature Communications","abstract":[{"lang":"eng","text":"The hippocampal mossy fiber synapse is a key synapse of the trisynaptic circuit. Post-tetanic potentiation (PTP) is the most powerful form of plasticity at this synaptic connection. It is widely believed that mossy fiber PTP is an entirely presynaptic phenomenon, implying that PTP induction is input-specific, and requires neither activity of multiple inputs nor stimulation of postsynaptic neurons. To directly test cooperativity and associativity, we made paired recordings between single mossy fiber terminals and postsynaptic CA3 pyramidal neurons in rat brain slices. By stimulating non-overlapping mossy fiber inputs converging onto single CA3 neurons, we confirm that PTP is input-specific and non-cooperative. Unexpectedly, mossy fiber PTP exhibits anti-associative induction properties. EPSCs show only minimal PTP after combined pre- and postsynaptic high-frequency stimulation with intact postsynaptic Ca2+ signaling, but marked PTP in the absence of postsynaptic spiking and after suppression of postsynaptic Ca2+ signaling (10 mM EGTA). PTP is largely recovered by inhibitors of voltage-gated R- and L-type Ca2+ channels, group II mGluRs, and vacuolar-type H+-ATPase, suggesting the involvement of retrograde vesicular glutamate signaling. Transsynaptic regulation of PTP extends the repertoire of synaptic computations, implementing a brake on mossy fiber detonation and a “smart teacher” function of hippocampal mossy fiber synapses."}],"acknowledged_ssus":[{"_id":"SSU"}],"ddc":["570"],"file":[{"file_id":"10563","date_updated":"2021-12-17T11:34:50Z","file_name":"2021_NatureCommunications_Vandael.pdf","success":1,"file_size":3108845,"date_created":"2021-12-17T11:34:50Z","relation":"main_file","creator":"kschuh","content_type":"application/pdf","access_level":"open_access","checksum":"6036a8cdae95e1707c2a04d54e325ff4"}],"title":"Transsynaptic modulation of presynaptic short-term plasticity in hippocampal mossy fiber synapses","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","type":"journal_article"},{"ddc":["510"],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2101.12566"}],"user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425","type":"preprint","title":"The strongly coupled polaron on the torus: Quantum corrections to the Pekar asymptotics","publication":"arXiv","abstract":[{"text":"We investigate the Fröhlich polaron model on a three-dimensional torus, and give a proof of the second-order quantum corrections to its ground-state energy in the strong-coupling limit. Compared to previous work in the confined case, the translational symmetry (and its breaking in the Pekar approximation) makes the analysis substantially more challenging.","lang":"eng"}],"ec_funded":1,"article_number":"2101.12566","language":[{"iso":"eng"}],"related_material":{"record":[{"status":"public","id":"10224","relation":"later_version"},{"status":"public","id":"9733","relation":"dissertation_contains"}]},"article_processing_charge":"No","oa":1,"has_accepted_license":"1","status":"public","oa_version":"Preprint","date_published":"2021-02-01T00:00:00Z","year":"2021","publication_status":"submitted","month":"02","department":[{"_id":"RoSe"}],"arxiv":1,"day":"01","project":[{"_id":"25C6DC12-B435-11E9-9278-68D0E5697425","name":"Analysis of quantum many-body systems","call_identifier":"H2020","grant_number":"694227"}],"citation":{"ama":"Feliciangeli D, Seiringer R. The strongly coupled polaron on the torus: Quantum corrections to the Pekar asymptotics. <i>arXiv</i>.","ista":"Feliciangeli D, Seiringer R. The strongly coupled polaron on the torus: Quantum corrections to the Pekar asymptotics. arXiv, 2101.12566.","chicago":"Feliciangeli, Dario, and Robert Seiringer. “The Strongly Coupled Polaron on the Torus: Quantum Corrections to the Pekar Asymptotics.” <i>ArXiv</i>, n.d.","mla":"Feliciangeli, Dario, and Robert Seiringer. “The Strongly Coupled Polaron on the Torus: Quantum Corrections to the Pekar Asymptotics.” <i>ArXiv</i>, 2101.12566.","apa":"Feliciangeli, D., &#38; Seiringer, R. (n.d.). The strongly coupled polaron on the torus: Quantum corrections to the Pekar asymptotics. <i>arXiv</i>.","short":"D. Feliciangeli, R. Seiringer, ArXiv (n.d.).","ieee":"D. Feliciangeli and R. Seiringer, “The strongly coupled polaron on the torus: Quantum corrections to the Pekar asymptotics,” <i>arXiv</i>. ."},"external_id":{"arxiv":["2101.12566"]},"_id":"9787","date_created":"2021-08-06T08:25:57Z","acknowledgement":"Funding from the European Union’s Horizon 2020 research and innovation programme under the ERC grant agreement No 694227 is gratefully acknowledged. We would also like to thank Rupert Frank for many helpful discussions, especially related to the Gross coordinate transformation defined in Def. 4.1.\r\n","date_updated":"2023-09-07T13:30:10Z","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"author":[{"full_name":"Feliciangeli, Dario","orcid":"0000-0003-0754-8530","first_name":"Dario","id":"41A639AA-F248-11E8-B48F-1D18A9856A87","last_name":"Feliciangeli"},{"last_name":"Seiringer","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","first_name":"Robert","orcid":"0000-0002-6781-0521","full_name":"Seiringer, Robert"}]},{"author":[{"last_name":"Feliciangeli","id":"41A639AA-F248-11E8-B48F-1D18A9856A87","first_name":"Dario","orcid":"0000-0003-0754-8530","full_name":"Feliciangeli, Dario"},{"full_name":"Rademacher, Simone Anna Elvira","orcid":"0000-0001-5059-4466","id":"856966FE-A408-11E9-977E-802DE6697425","last_name":"Rademacher","first_name":"Simone Anna Elvira"},{"orcid":"0000-0002-6781-0521","full_name":"Seiringer, Robert","first_name":"Robert","last_name":"Seiringer","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87"}],"date_published":"2021-07-08T00:00:00Z","year":"2021","publication_status":"submitted","date_updated":"2024-03-06T12:30:45Z","acknowledgement":"We thank Herbert Spohn for helpful comments. Funding from the European Union’s Horizon 2020 research and innovation programme under the ERC grant agreement No. 694227 (D.F. and R.S.) and under the Marie Skłodowska-Curie Grant Agreement No. 754411 (S.R.) is gratefully acknowledged..","oa":1,"oa_version":"Preprint","status":"public","date_created":"2021-08-06T08:49:45Z","language":[{"iso":"eng"}],"related_material":{"record":[{"relation":"later_version","status":"public","id":"10755"},{"status":"public","id":"9733","relation":"dissertation_contains"}]},"ec_funded":1,"_id":"9791","article_number":"2107.03720 ","article_processing_charge":"No","publication":"arXiv","external_id":{"arxiv":["2107.03720"]},"abstract":[{"lang":"eng","text":"We provide a definition of the effective mass for the classical polaron described by the Landau-Pekar equations. It is based on a novel variational principle, minimizing the energy functional over states with given (initial) velocity. The resulting formula for the polaron's effective mass agrees with the prediction by Landau and Pekar."}],"project":[{"call_identifier":"H2020","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425"},{"grant_number":"694227","call_identifier":"H2020","name":"Analysis of quantum many-body systems","_id":"25C6DC12-B435-11E9-9278-68D0E5697425"}],"citation":{"ama":"Feliciangeli D, Rademacher SAE, Seiringer R. The effective mass problem for the Landau-Pekar equations. <i>arXiv</i>.","ista":"Feliciangeli D, Rademacher SAE, Seiringer R. The effective mass problem for the Landau-Pekar equations. arXiv, 2107.03720.","chicago":"Feliciangeli, Dario, Simone Anna Elvira Rademacher, and Robert Seiringer. “The Effective Mass Problem for the Landau-Pekar Equations.” <i>ArXiv</i>, n.d.","apa":"Feliciangeli, D., Rademacher, S. A. E., &#38; Seiringer, R. (n.d.). The effective mass problem for the Landau-Pekar equations. <i>arXiv</i>.","short":"D. Feliciangeli, S.A.E. Rademacher, R. Seiringer, ArXiv (n.d.).","mla":"Feliciangeli, Dario, et al. “The Effective Mass Problem for the Landau-Pekar Equations.” <i>ArXiv</i>, 2107.03720.","ieee":"D. Feliciangeli, S. A. E. Rademacher, and R. Seiringer, “The effective mass problem for the Landau-Pekar equations,” <i>arXiv</i>. ."},"arxiv":1,"main_file_link":[{"url":"https://arxiv.org/abs/2107.03720","open_access":"1"}],"title":"The effective mass problem for the Landau-Pekar equations","type":"preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"08","ddc":["510"],"department":[{"_id":"RoSe"}],"month":"07"},{"external_id":{"arxiv":["2106.11217"]},"citation":{"ieee":"D. Feliciangeli, A. Gerolin, and L. Portinale, “A non-commutative entropic optimal transport approach to quantum composite systems at positive temperature,” <i>arXiv</i>. .","short":"D. Feliciangeli, A. Gerolin, L. Portinale, ArXiv (n.d.).","mla":"Feliciangeli, Dario, et al. “A Non-Commutative Entropic Optimal Transport Approach to Quantum Composite Systems at Positive Temperature.” <i>ArXiv</i>, 2106.11217, doi:<a href=\"https://doi.org/10.48550/arXiv.2106.11217\">10.48550/arXiv.2106.11217</a>.","apa":"Feliciangeli, D., Gerolin, A., &#38; Portinale, L. (n.d.). A non-commutative entropic optimal transport approach to quantum composite systems at positive temperature. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2106.11217\">https://doi.org/10.48550/arXiv.2106.11217</a>","chicago":"Feliciangeli, Dario, Augusto Gerolin, and Lorenzo Portinale. “A Non-Commutative Entropic Optimal Transport Approach to Quantum Composite Systems at Positive Temperature.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2106.11217\">https://doi.org/10.48550/arXiv.2106.11217</a>.","ista":"Feliciangeli D, Gerolin A, Portinale L. A non-commutative entropic optimal transport approach to quantum composite systems at positive temperature. arXiv, 2106.11217.","ama":"Feliciangeli D, Gerolin A, Portinale L. A non-commutative entropic optimal transport approach to quantum composite systems at positive temperature. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2106.11217\">10.48550/arXiv.2106.11217</a>"},"project":[{"grant_number":"694227","call_identifier":"H2020","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","name":"Analysis of quantum many-body systems"},{"_id":"256E75B8-B435-11E9-9278-68D0E5697425","name":"Optimal Transport and Stochastic Dynamics","grant_number":"716117","call_identifier":"H2020"},{"name":"Taming Complexity in Partial Differential Systems","_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2","grant_number":"F6504"}],"day":"21","arxiv":1,"month":"07","department":[{"_id":"RoSe"},{"_id":"JaMa"}],"author":[{"full_name":"Feliciangeli, Dario","orcid":"0000-0003-0754-8530","first_name":"Dario","id":"41A639AA-F248-11E8-B48F-1D18A9856A87","last_name":"Feliciangeli"},{"full_name":"Gerolin, Augusto","last_name":"Gerolin","first_name":"Augusto"},{"full_name":"Portinale, Lorenzo","id":"30AD2CBC-F248-11E8-B48F-1D18A9856A87","last_name":"Portinale","first_name":"Lorenzo"}],"tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_updated":"2023-11-14T13:21:01Z","acknowledgement":"This work started when A.G. was visiting the Erwin Schrödinger Institute and then continued when D.F. and L.P visited the Theoretical Chemistry Department of the Vrije Universiteit Amsterdam. The authors thanks the hospitality of both places and, especially, P. Gori-Giorgi and K. Giesbertz for fruitful discussions and literature suggestions in the early state of the project. Finally, the authors also thanks J. Maas and R. Seiringer for their feedback and useful comments to a first draft of the article.  L.P. acknowledges support by the Austrian Science Fund (FWF), grants No W1245 and NoF65. D.F acknowledges support by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreements No 716117 and No 694227). A.G. acknowledges funding by the European Research Council under H2020/MSCA-IF “OTmeetsDFT” [grant ID: 795942].","_id":"9792","date_created":"2021-08-06T09:07:12Z","abstract":[{"lang":"eng","text":"This paper establishes new connections between many-body quantum systems, One-body Reduced Density Matrices Functional Theory (1RDMFT) and Optimal Transport (OT), by interpreting the problem of computing the ground-state energy of a finite dimensional composite quantum system at positive temperature as a non-commutative entropy regularized Optimal Transport problem. We develop a new approach to fully characterize the dual-primal solutions in such non-commutative setting. The mathematical formalism is particularly relevant in quantum chemistry: numerical realizations of the many-electron ground state energy can be computed via a non-commutative version of Sinkhorn algorithm. Our approach allows to prove convergence and robustness of this algorithm, which, to our best knowledge, were unknown even in the two marginal case. Our methods are based on careful a priori estimates in the dual problem, which we believe to be of independent interest. Finally, the above results are extended in 1RDMFT setting, where bosonic or fermionic symmetry conditions are enforced on the problem."}],"publication":"arXiv","doi":"10.48550/arXiv.2106.11217","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"preprint","title":"A non-commutative entropic optimal transport approach to quantum composite systems at positive temperature","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2106.11217"}],"ddc":["510"],"year":"2021","publication_status":"submitted","date_published":"2021-07-21T00:00:00Z","status":"public","oa_version":"Preprint","oa":1,"has_accepted_license":"1","article_processing_charge":"No","article_number":"2106.11217","ec_funded":1,"language":[{"iso":"eng"}],"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"9733"},{"status":"public","id":"10030","relation":"dissertation_contains"},{"relation":"later_version","status":"public","id":"12911"}]}},{"title":"HepaCAM controls astrocyte self-organization and coupling","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","main_file_link":[{"url":"https://doi.org/10.1016/j.neuron.2021.05.025","open_access":"1"}],"doi":"10.1016/j.neuron.2021.05.025","abstract":[{"lang":"eng","text":"Astrocytes extensively infiltrate the neuropil to regulate critical aspects of synaptic development and function. This process is regulated by transcellular interactions between astrocytes and neurons via cell adhesion molecules. How astrocytes coordinate developmental processes among one another to parse out the synaptic neuropil and form non-overlapping territories is unknown. Here we identify a molecular mechanism regulating astrocyte-astrocyte interactions during development to coordinate astrocyte morphogenesis and gap junction coupling. We show that hepaCAM, a disease-linked, astrocyte-enriched cell adhesion molecule, regulates astrocyte competition for territory and morphological complexity in the developing mouse cortex. Furthermore, conditional deletion of Hepacam from developing astrocytes significantly impairs gap junction coupling between astrocytes and disrupts the balance between synaptic excitation and inhibition. Mutations in HEPACAM cause megalencephalic leukoencephalopathy with subcortical cysts in humans. Therefore, our findings suggest that disruption of astrocyte self-organization mechanisms could be an underlying cause of neural pathology."}],"publication":"Neuron","article_processing_charge":"No","language":[{"iso":"eng"}],"ec_funded":1,"oa_version":"Published Version","status":"public","oa":1,"publication_status":"published","publication_identifier":{"eissn":["1097-4199"],"issn":["0896-6273"]},"year":"2021","date_published":"2021-08-04T00:00:00Z","quality_controlled":"1","publisher":"Elsevier","page":"2427-2442.e10","pmid":1,"isi":1,"month":"08","department":[{"_id":"SiHi"}],"intvolume":"       109","day":"04","citation":{"short":"K.T. Baldwin, C.X. Tan, S.T. Strader, C. Jiang, J.T. Savage, X. Elorza-Vidal, X. Contreras, T. Rülicke, S. Hippenmeyer, R. Estévez, R.-R. Ji, C. Eroglu, Neuron 109 (2021) 2427–2442.e10.","mla":"Baldwin, Katherine T., et al. “HepaCAM Controls Astrocyte Self-Organization and Coupling.” <i>Neuron</i>, vol. 109, no. 15, Elsevier, 2021, p. 2427–2442.e10, doi:<a href=\"https://doi.org/10.1016/j.neuron.2021.05.025\">10.1016/j.neuron.2021.05.025</a>.","apa":"Baldwin, K. T., Tan, C. X., Strader, S. T., Jiang, C., Savage, J. T., Elorza-Vidal, X., … Eroglu, C. (2021). HepaCAM controls astrocyte self-organization and coupling. <i>Neuron</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.neuron.2021.05.025\">https://doi.org/10.1016/j.neuron.2021.05.025</a>","chicago":"Baldwin, Katherine T., Christabel X. Tan, Samuel T. Strader, Changyu Jiang, Justin T. Savage, Xabier Elorza-Vidal, Ximena Contreras, et al. “HepaCAM Controls Astrocyte Self-Organization and Coupling.” <i>Neuron</i>. Elsevier, 2021. <a href=\"https://doi.org/10.1016/j.neuron.2021.05.025\">https://doi.org/10.1016/j.neuron.2021.05.025</a>.","ista":"Baldwin KT, Tan CX, Strader ST, Jiang C, Savage JT, Elorza-Vidal X, Contreras X, Rülicke T, Hippenmeyer S, Estévez R, Ji R-R, Eroglu C. 2021. HepaCAM controls astrocyte self-organization and coupling. Neuron. 109(15), 2427–2442.e10.","ama":"Baldwin KT, Tan CX, Strader ST, et al. HepaCAM controls astrocyte self-organization and coupling. <i>Neuron</i>. 2021;109(15):2427-2442.e10. doi:<a href=\"https://doi.org/10.1016/j.neuron.2021.05.025\">10.1016/j.neuron.2021.05.025</a>","ieee":"K. T. Baldwin <i>et al.</i>, “HepaCAM controls astrocyte self-organization and coupling,” <i>Neuron</i>, vol. 109, no. 15. Elsevier, p. 2427–2442.e10, 2021."},"project":[{"grant_number":"725780","call_identifier":"H2020","_id":"260018B0-B435-11E9-9278-68D0E5697425","name":"Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development"}],"scopus_import":"1","external_id":{"pmid":["34171291"],"isi":["000692851900010"]},"date_created":"2021-08-06T09:08:25Z","_id":"9793","volume":109,"acknowledgement":"This work was supported by the National Institutes of Health (R01 DA047258 and R01 NS102237 to C.E., F32 NS100392 to K.T.B.) and the Holland-Trice Brain Research Award (to C.E.). K.T.B. was supported by postdoctoral fellowships from the Foerster-Bernstein Family and The Hartwell Foundation. The Hippenmeyer lab was supported by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovations program (725780 LinPro) to S.H. R.E. was supported by Ministerio de Ciencia y Tecnología (RTI2018-093493-B-I00). We thank the Duke Light Microscopy Core Facility, the Duke Transgenic Mouse Facility, Dr. U. Schulte for assistance with proteomic experiments, and Dr. D. Silver for critical review of the manuscript. Cartoon elements of figure panels were created using BioRender.com.","issue":"15","date_updated":"2023-09-27T07:46:09Z","article_type":"original","author":[{"first_name":"Katherine T.","last_name":"Baldwin","full_name":"Baldwin, Katherine T."},{"first_name":"Christabel X.","last_name":"Tan","full_name":"Tan, Christabel X."},{"full_name":"Strader, Samuel T.","first_name":"Samuel T.","last_name":"Strader"},{"full_name":"Jiang, Changyu","last_name":"Jiang","first_name":"Changyu"},{"first_name":"Justin T.","last_name":"Savage","full_name":"Savage, Justin T."},{"first_name":"Xabier","last_name":"Elorza-Vidal","full_name":"Elorza-Vidal, Xabier"},{"full_name":"Contreras, Ximena","last_name":"Contreras","id":"475990FE-F248-11E8-B48F-1D18A9856A87","first_name":"Ximena"},{"last_name":"Rülicke","first_name":"Thomas","full_name":"Rülicke, Thomas"},{"full_name":"Hippenmeyer, Simon","orcid":"0000-0003-2279-1061","first_name":"Simon","id":"37B36620-F248-11E8-B48F-1D18A9856A87","last_name":"Hippenmeyer"},{"last_name":"Estévez","first_name":"Raúl","full_name":"Estévez, Raúl"},{"full_name":"Ji, Ru-Rong","last_name":"Ji","first_name":"Ru-Rong"},{"full_name":"Eroglu, Cagla","last_name":"Eroglu","first_name":"Cagla"}]},{"article_number":"045005","language":[{"iso":"eng"}],"article_processing_charge":"Yes","oa":1,"has_accepted_license":"1","status":"public","oa_version":"Published Version","date_published":"2021-07-15T00:00:00Z","publication_identifier":{"eissn":["2058-9565"]},"year":"2021","publication_status":"published","publisher":"IOP Publishing","quality_controlled":"1","file":[{"file_id":"9836","file_name":"2021_QuantumScienceTechnology_Mobassem.pdf","date_updated":"2021-08-09T12:23:13Z","file_size":2366118,"date_created":"2021-08-09T12:23:13Z","relation":"main_file","creator":"cchlebak","content_type":"application/pdf","access_level":"open_access","checksum":"b15c2c228487a75002c3b52d56f23d5c"}],"ddc":["530"],"type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Thermal noise in electro-optic devices at cryogenic temperatures","doi":"10.1088/2058-9565/ac0f36","publication":"Quantum Science and Technology","abstract":[{"lang":"eng","text":"The quantum bits (qubits) on which superconducting quantum computers are based have energy scales corresponding to photons with GHz frequencies. The energy of photons in the gigahertz domain is too low to allow transmission through the noisy room-temperature environment, where the signal would be lost in thermal noise. Optical photons, on the other hand, have much higher energies, and signals can be detected using highly efficient single-photon detectors. Transduction from microwave to optical frequencies is therefore a potential enabling technology for quantum devices. However, in such a device the optical pump can be a source of thermal noise and thus degrade the fidelity; the similarity of input microwave state to the output optical state. In order to investigate the magnitude of this effect we model the sub-Kelvin thermal behavior of an electro-optic transducer based on a lithium niobate whispering gallery mode resonator. We find that there is an optimum power level for a continuous pump, whilst pulsed operation of the pump increases the fidelity of the conversion."}],"_id":"9815","date_created":"2021-08-08T22:01:25Z","file_date_updated":"2021-08-09T12:23:13Z","issue":"4","volume":6,"acknowledgement":"NJL is supported by the MBIE Endeavour Fund (UOOX1805) and GL is by the Julius von Haast Fellowship of New Zealand. SM acknowledges stimulating discussions with T M Jensen.","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_updated":"2023-10-17T12:54:54Z","author":[{"first_name":"Sonia","last_name":"Mobassem","full_name":"Mobassem, Sonia"},{"first_name":"Nicholas J.","last_name":"Lambert","full_name":"Lambert, Nicholas J."},{"last_name":"Rueda Sanchez","id":"3B82B0F8-F248-11E8-B48F-1D18A9856A87","first_name":"Alfredo R","orcid":"0000-0001-6249-5860","full_name":"Rueda Sanchez, Alfredo R"},{"full_name":"Fink, Johannes M","orcid":"0000-0001-8112-028X","first_name":"Johannes M","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","last_name":"Fink"},{"last_name":"Leuchs","first_name":"Gerd","full_name":"Leuchs, Gerd"},{"full_name":"Schwefel, Harald G.L.","last_name":"Schwefel","first_name":"Harald G.L."}],"article_type":"original","month":"07","department":[{"_id":"JoFi"}],"isi":1,"arxiv":1,"day":"15","intvolume":"         6","scopus_import":"1","citation":{"ieee":"S. Mobassem, N. J. Lambert, A. R. Rueda Sanchez, J. M. Fink, G. Leuchs, and H. G. L. Schwefel, “Thermal noise in electro-optic devices at cryogenic temperatures,” <i>Quantum Science and Technology</i>, vol. 6, no. 4. IOP Publishing, 2021.","apa":"Mobassem, S., Lambert, N. J., Rueda Sanchez, A. R., Fink, J. M., Leuchs, G., &#38; Schwefel, H. G. L. (2021). Thermal noise in electro-optic devices at cryogenic temperatures. <i>Quantum Science and Technology</i>. IOP Publishing. <a href=\"https://doi.org/10.1088/2058-9565/ac0f36\">https://doi.org/10.1088/2058-9565/ac0f36</a>","mla":"Mobassem, Sonia, et al. “Thermal Noise in Electro-Optic Devices at Cryogenic Temperatures.” <i>Quantum Science and Technology</i>, vol. 6, no. 4, 045005, IOP Publishing, 2021, doi:<a href=\"https://doi.org/10.1088/2058-9565/ac0f36\">10.1088/2058-9565/ac0f36</a>.","short":"S. Mobassem, N.J. Lambert, A.R. Rueda Sanchez, J.M. Fink, G. Leuchs, H.G.L. Schwefel, Quantum Science and Technology 6 (2021).","ama":"Mobassem S, Lambert NJ, Rueda Sanchez AR, Fink JM, Leuchs G, Schwefel HGL. Thermal noise in electro-optic devices at cryogenic temperatures. <i>Quantum Science and Technology</i>. 2021;6(4). doi:<a href=\"https://doi.org/10.1088/2058-9565/ac0f36\">10.1088/2058-9565/ac0f36</a>","ista":"Mobassem S, Lambert NJ, Rueda Sanchez AR, Fink JM, Leuchs G, Schwefel HGL. 2021. Thermal noise in electro-optic devices at cryogenic temperatures. Quantum Science and Technology. 6(4), 045005.","chicago":"Mobassem, Sonia, Nicholas J. Lambert, Alfredo R Rueda Sanchez, Johannes M Fink, Gerd Leuchs, and Harald G.L. Schwefel. “Thermal Noise in Electro-Optic Devices at Cryogenic Temperatures.” <i>Quantum Science and Technology</i>. IOP Publishing, 2021. <a href=\"https://doi.org/10.1088/2058-9565/ac0f36\">https://doi.org/10.1088/2058-9565/ac0f36</a>."},"external_id":{"arxiv":["2008.08764"],"isi":["000673081500001"]}},{"publication_status":"published","publication_identifier":{"eissn":["1932-6203"]},"year":"2021","date_published":"2021-07-29T00:00:00Z","publisher":"Public Library of Science","quality_controlled":"1","article_processing_charge":"Yes","article_number":"e0255267","language":[{"iso":"eng"}],"status":"public","oa_version":"Published Version","oa":1,"has_accepted_license":"1","doi":"10.1371/journal.pone.0255267","abstract":[{"lang":"eng","text":"Aims: Mass antigen testing programs have been challenged because of an alleged insufficient specificity, leading to a large number of false positives. The objective of this study is to derive a lower bound of the specificity of the SD Biosensor Standard Q Ag-Test in large scale practical use.\r\nMethods: Based on county data from the nationwide tests for SARS-CoV-2 in Slovakia between 31.10.–1.11. 2020 we calculate a lower confidence bound for the specificity. As positive test results were not systematically verified by PCR tests, we base the lower bound on a worst case assumption, assuming all positives to be false positives.\r\nResults: 3,625,332 persons from 79 counties were tested. The lowest positivity rate was observed in the county of Rožňava where 100 out of 34307 (0.29%) tests were positive. This implies a test specificity of at least 99.6% (97.5% one-sided lower confidence bound, adjusted for multiplicity).\r\nConclusion: The obtained lower bound suggests a higher specificity compared to earlier studies in spite of the underlying worst case assumption and the application in a mass testing setting. The actual specificity is expected to exceed 99.6% if the prevalence in the respective regions was non-negligible at the time of testing. To our knowledge, this estimate constitutes the first bound obtained from large scale practical use of an antigen test."}],"publication":"PLoS ONE","ddc":["610"],"file":[{"file_id":"9835","success":1,"file_name":"2021_PLoSONE_Hledík.pdf","date_updated":"2021-08-09T11:52:14Z","file_size":773921,"date_created":"2021-08-09T11:52:14Z","relation":"main_file","access_level":"open_access","creator":"asandaue","content_type":"application/pdf","checksum":"ae4df60eb62f4491278588548d0c1f93"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","type":"journal_article","title":"Analysis of the specificity of a COVID-19 antigen test in the Slovak mass testing program","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_updated":"2023-08-10T14:26:32Z","article_type":"original","author":[{"full_name":"Hledik, Michal","id":"4171253A-F248-11E8-B48F-1D18A9856A87","last_name":"Hledik","first_name":"Michal"},{"full_name":"Polechova, Jitka","orcid":"0000-0003-0951-3112","first_name":"Jitka","id":"3BBFB084-F248-11E8-B48F-1D18A9856A87","last_name":"Polechova"},{"last_name":"Beiglböck","first_name":"Mathias","full_name":"Beiglböck, Mathias"},{"first_name":"Anna Nele","last_name":"Herdina","full_name":"Herdina, Anna Nele"},{"first_name":"Robert","last_name":"Strassl","full_name":"Strassl, Robert"},{"last_name":"Posch","first_name":"Martin","full_name":"Posch, Martin"}],"_id":"9816","date_created":"2021-08-08T22:01:26Z","issue":"7","file_date_updated":"2021-08-09T11:52:14Z","acknowledgement":"We would like to thank Alfred Uhl, Richard Kollár and Katarína Bod’ová for very helpful comments. We also thank Matej Mišík for discussion and information regarding the Slovak testing data and Ag-Test used.","volume":16,"citation":{"mla":"Hledik, Michal, et al. “Analysis of the Specificity of a COVID-19 Antigen Test in the Slovak Mass Testing Program.” <i>PLoS ONE</i>, vol. 16, no. 7, e0255267, Public Library of Science, 2021, doi:<a href=\"https://doi.org/10.1371/journal.pone.0255267\">10.1371/journal.pone.0255267</a>.","apa":"Hledik, M., Polechova, J., Beiglböck, M., Herdina, A. N., Strassl, R., &#38; Posch, M. (2021). Analysis of the specificity of a COVID-19 antigen test in the Slovak mass testing program. <i>PLoS ONE</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pone.0255267\">https://doi.org/10.1371/journal.pone.0255267</a>","short":"M. Hledik, J. Polechova, M. Beiglböck, A.N. Herdina, R. Strassl, M. Posch, PLoS ONE 16 (2021).","ama":"Hledik M, Polechova J, Beiglböck M, Herdina AN, Strassl R, Posch M. Analysis of the specificity of a COVID-19 antigen test in the Slovak mass testing program. <i>PLoS ONE</i>. 2021;16(7). doi:<a href=\"https://doi.org/10.1371/journal.pone.0255267\">10.1371/journal.pone.0255267</a>","ista":"Hledik M, Polechova J, Beiglböck M, Herdina AN, Strassl R, Posch M. 2021. Analysis of the specificity of a COVID-19 antigen test in the Slovak mass testing program. PLoS ONE. 16(7), e0255267.","chicago":"Hledik, Michal, Jitka Polechova, Mathias Beiglböck, Anna Nele Herdina, Robert Strassl, and Martin Posch. “Analysis of the Specificity of a COVID-19 Antigen Test in the Slovak Mass Testing Program.” <i>PLoS ONE</i>. Public Library of Science, 2021. <a href=\"https://doi.org/10.1371/journal.pone.0255267\">https://doi.org/10.1371/journal.pone.0255267</a>.","ieee":"M. Hledik, J. Polechova, M. Beiglböck, A. N. Herdina, R. Strassl, and M. Posch, “Analysis of the specificity of a COVID-19 antigen test in the Slovak mass testing program,” <i>PLoS ONE</i>, vol. 16, no. 7. Public Library of Science, 2021."},"scopus_import":"1","external_id":{"pmid":["34324553"],"isi":["000685248200095"]},"month":"07","department":[{"_id":"NiBa"}],"pmid":1,"isi":1,"day":"29","intvolume":"        16"},{"date_created":"2021-08-08T22:01:26Z","_id":"9817","volume":40,"acknowledgement":"We thank the anonymous reviewers for their generous feedback, and Michal Piovarči for his help in producing the supplemental video. This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 715767).\r\n","file_date_updated":"2021-10-18T10:42:22Z","issue":"4","date_updated":"2024-03-25T23:30:26Z","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"article_type":"original","keyword":["Computing methodologies","shape modeling","modeling and simulation","theory of computation","computational geometry","mathematics of computing","mathematical optimization"],"author":[{"full_name":"Hafner, Christian","first_name":"Christian","last_name":"Hafner","id":"400429CC-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Bickel","id":"49876194-F248-11E8-B48F-1D18A9856A87","first_name":"Bernd","orcid":"0000-0001-6511-9385","full_name":"Bickel, Bernd"}],"isi":1,"month":"07","department":[{"_id":"BeBi"}],"intvolume":"        40","day":"19","citation":{"ama":"Hafner C, Bickel B. The design space of plane elastic curves. <i>ACM Transactions on Graphics</i>. 2021;40(4). doi:<a href=\"https://doi.org/10.1145/3450626.3459800\">10.1145/3450626.3459800</a>","chicago":"Hafner, Christian, and Bernd Bickel. “The Design Space of Plane Elastic Curves.” <i>ACM Transactions on Graphics</i>. Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3450626.3459800\">https://doi.org/10.1145/3450626.3459800</a>.","ista":"Hafner C, Bickel B. 2021. The design space of plane elastic curves. ACM Transactions on Graphics. 40(4), 126.","mla":"Hafner, Christian, and Bernd Bickel. “The Design Space of Plane Elastic Curves.” <i>ACM Transactions on Graphics</i>, vol. 40, no. 4, 126, Association for Computing Machinery, 2021, doi:<a href=\"https://doi.org/10.1145/3450626.3459800\">10.1145/3450626.3459800</a>.","apa":"Hafner, C., &#38; Bickel, B. (2021). The design space of plane elastic curves. <i>ACM Transactions on Graphics</i>. Virtual: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3450626.3459800\">https://doi.org/10.1145/3450626.3459800</a>","short":"C. Hafner, B. Bickel, ACM Transactions on Graphics 40 (2021).","ieee":"C. Hafner and B. Bickel, “The design space of plane elastic curves,” <i>ACM Transactions on Graphics</i>, vol. 40, no. 4. Association for Computing Machinery, 2021."},"scopus_import":"1","project":[{"call_identifier":"H2020","grant_number":"715767","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","_id":"24F9549A-B435-11E9-9278-68D0E5697425"}],"conference":{"start_date":"2021-08-09","name":"SIGGRAF: Special Interest Group on Computer Graphics and Interactive Techniques","location":"Virtual","end_date":"2021-08-13"},"external_id":{"isi":["000674930900091"]},"article_processing_charge":"No","related_material":{"record":[{"relation":"dissertation_contains","id":"12897","status":"public"}],"link":[{"url":"https://ist.ac.at/en/news/designing-with-elastic-structures/","relation":"press_release","description":"News on IST Website"}]},"language":[{"iso":"eng"}],"article_number":"126","ec_funded":1,"oa_version":"Published Version","status":"public","has_accepted_license":"1","oa":1,"year":"2021","publication_status":"published","publication_identifier":{"issn":["0730-0301"],"eissn":["1557-7368"]},"date_published":"2021-07-19T00:00:00Z","quality_controlled":"1","publisher":"Association for Computing Machinery","ddc":["516"],"file":[{"file_id":"10150","date_updated":"2021-10-18T10:42:15Z","file_name":"elastic-curves-paper.pdf","success":1,"file_size":17064290,"date_created":"2021-10-18T10:42:15Z","relation":"main_file","content_type":"application/pdf","access_level":"open_access","creator":"chafner","checksum":"7e5d08ce46b0451b3102eacd3d00f85f"},{"file_size":547156,"file_name":"elastic-curves-supp.pdf","date_updated":"2021-10-18T10:42:22Z","file_id":"10151","checksum":"0088643478be7c01a703b5b10767348f","creator":"chafner","content_type":"application/pdf","access_level":"open_access","relation":"supplementary_material","date_created":"2021-10-18T10:42:22Z"}],"title":"The design space of plane elastic curves","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","type":"journal_article","doi":"10.1145/3450626.3459800","abstract":[{"lang":"eng","text":"Elastic bending of initially flat slender elements allows the realization and economic fabrication of intriguing curved shapes. In this work, we derive an intuitive but rigorous geometric characterization of the design space of plane elastic rods with variable stiffness. It enables designers to determine which shapes are physically viable with active bending by visual inspection alone. Building on these insights, we propose a method for efficiently designing the geometry of a flat elastic rod that realizes a target equilibrium curve, which only requires solving a linear program. We implement this method in an interactive computational design tool that gives feedback about the feasibility of a design, and computes the geometry of the structural elements necessary to realize it within an instant. The tool also offers an iterative optimization routine that improves the fabricability of a model while modifying it as little as possible. In addition, we use our geometric characterization to derive an algorithm for analyzing and recovering the stability of elastic curves that would otherwise snap out of their unstable equilibrium shapes by buckling. We show the efficacy of our approach by designing and manufacturing several physical models that are assembled from flat elements."}],"publication":"ACM Transactions on Graphics"},{"date_published":"2021-08-01T00:00:00Z","publication_status":"published","year":"2021","publication_identifier":{"issn":["07300301"],"eissn":["15577368"]},"publisher":"Association for Computing Machinery","quality_controlled":"1","article_number":"168","ec_funded":1,"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"12358"},{"id":"9327","status":"public","relation":"software"}],"link":[{"url":"https://ist.ac.at/en/news/knitting-virtual-yarn/","relation":"press_release","description":"News on IST Webpage"}]},"language":[{"iso":"eng"}],"article_processing_charge":"Yes (in subscription journal)","oa":1,"status":"public","oa_version":"Published Version","doi":"10.1145/3450626.3459816","publication":"ACM Transactions on Graphics","abstract":[{"lang":"eng","text":"Triangle mesh-based simulations are able to produce satisfying animations of knitted and woven cloth; however, they lack the rich geometric detail of yarn-level simulations. Naive texturing approaches do not consider yarn-level physics, while full yarn-level simulations may become prohibitively expensive for large garments. We propose a method to animate yarn-level cloth geometry on top of an underlying deforming mesh in a mechanics-aware fashion. Using triangle strains to interpolate precomputed yarn geometry, we are able to reproduce effects such as knit loops tightening under stretching. In combination with precomputed mesh animation or real-time mesh simulation, our method is able to animate yarn-level cloth in real-time at large scales."}],"acknowledged_ssus":[{"_id":"ScienComp"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1145/3450626.3459816"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","type":"journal_article","title":"Mechanics-aware deformation of yarn pattern geometry","date_updated":"2023-08-10T14:24:36Z","author":[{"id":"4DD40360-F248-11E8-B48F-1D18A9856A87","last_name":"Sperl","first_name":"Georg","full_name":"Sperl, Georg"},{"first_name":"Rahul","last_name":"Narain","full_name":"Narain, Rahul"},{"full_name":"Wojtan, Christopher J","orcid":"0000-0001-6646-5546","first_name":"Christopher J","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","last_name":"Wojtan"}],"article_type":"original","_id":"9818","date_created":"2021-08-08T22:01:27Z","issue":"4","volume":40,"acknowledgement":"We wish to thank the anonymous reviewers and the members of the Visual Computing Group at IST Austria for their valuable feedback. We also thank Seddi Labs for providing the garment model with fold-over seams.\r\nThis research was supported by the Scientific Service Units (SSU) of IST Austria through resources provided by Scientific\r\nComputing. This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme under grant agreement No. 638176. Rahul Narain is supported by a Pankaj Gupta Young Faculty Fellowship and a gift from Adobe Inc.","scopus_import":"1","project":[{"_id":"2533E772-B435-11E9-9278-68D0E5697425","name":"Efficient Simulation of Natural Phenomena at Extremely Large Scales","call_identifier":"H2020","grant_number":"638176"}],"citation":{"ieee":"G. Sperl, R. Narain, and C. Wojtan, “Mechanics-aware deformation of yarn pattern geometry,” <i>ACM Transactions on Graphics</i>, vol. 40, no. 4. Association for Computing Machinery, 2021.","chicago":"Sperl, Georg, Rahul Narain, and Chris Wojtan. “Mechanics-Aware Deformation of Yarn Pattern Geometry.” <i>ACM Transactions on Graphics</i>. Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3450626.3459816\">https://doi.org/10.1145/3450626.3459816</a>.","ama":"Sperl G, Narain R, Wojtan C. Mechanics-aware deformation of yarn pattern geometry. <i>ACM Transactions on Graphics</i>. 2021;40(4). doi:<a href=\"https://doi.org/10.1145/3450626.3459816\">10.1145/3450626.3459816</a>","ista":"Sperl G, Narain R, Wojtan C. 2021. Mechanics-aware deformation of yarn pattern geometry. ACM Transactions on Graphics. 40(4), 168.","mla":"Sperl, Georg, et al. “Mechanics-Aware Deformation of Yarn Pattern Geometry.” <i>ACM Transactions on Graphics</i>, vol. 40, no. 4, 168, Association for Computing Machinery, 2021, doi:<a href=\"https://doi.org/10.1145/3450626.3459816\">10.1145/3450626.3459816</a>.","apa":"Sperl, G., Narain, R., &#38; Wojtan, C. (2021). Mechanics-aware deformation of yarn pattern geometry. <i>ACM Transactions on Graphics</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3450626.3459816\">https://doi.org/10.1145/3450626.3459816</a>","short":"G. Sperl, R. Narain, C. Wojtan, ACM Transactions on Graphics 40 (2021)."},"external_id":{"isi":["000674930900132"]},"month":"08","department":[{"_id":"GradSch"},{"_id":"ChWo"}],"isi":1,"day":"01","intvolume":"        40"},{"date_updated":"2023-08-10T14:25:08Z","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"article_type":"original","author":[{"first_name":"B. R.","last_name":"Mallikarjun","full_name":"Mallikarjun, B. R."},{"first_name":"Ayush","last_name":"Tewari","full_name":"Tewari, Ayush"},{"last_name":"Dib","first_name":"Abdallah","full_name":"Dib, Abdallah"},{"full_name":"Weyrich, Tim","last_name":"Weyrich","first_name":"Tim"},{"orcid":"0000-0001-6511-9385","full_name":"Bickel, Bernd","first_name":"Bernd","last_name":"Bickel","id":"49876194-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Hans Peter","last_name":"Seidel","full_name":"Seidel, Hans Peter"},{"full_name":"Pfister, Hanspeter","first_name":"Hanspeter","last_name":"Pfister"},{"full_name":"Matusik, Wojciech","last_name":"Matusik","first_name":"Wojciech"},{"full_name":"Chevallier, Louis","last_name":"Chevallier","first_name":"Louis"},{"first_name":"Mohamed A.","last_name":"Elgharib","full_name":"Elgharib, Mohamed A."},{"full_name":"Theobalt, Christian","first_name":"Christian","last_name":"Theobalt"}],"_id":"9819","date_created":"2021-08-08T22:01:27Z","issue":"4","file_date_updated":"2021-08-09T11:41:50Z","volume":40,"acknowledgement":"This work was supported by the ERC Consolidator Grant 4DReply (770784). We also acknowledge support from Technicolor and InterDigital. We thank Tiancheng Sun for kindly helping us with the comparisons with Sun et al. [2019].","citation":{"mla":"Mallikarjun, B. R., et al. “PhotoApp: Photorealistic Appearance Editing of Head Portraits.” <i>ACM Transactions on Graphics</i>, vol. 40, no. 4, 44, Association for Computing Machinery, 2021, doi:<a href=\"https://doi.org/10.1145/3450626.3459765\">10.1145/3450626.3459765</a>.","short":"B.R. Mallikarjun, A. Tewari, A. Dib, T. Weyrich, B. Bickel, H.P. Seidel, H. Pfister, W. Matusik, L. Chevallier, M.A. Elgharib, C. Theobalt, ACM Transactions on Graphics 40 (2021).","apa":"Mallikarjun, B. R., Tewari, A., Dib, A., Weyrich, T., Bickel, B., Seidel, H. P., … Theobalt, C. (2021). PhotoApp: Photorealistic appearance editing of head portraits. <i>ACM Transactions on Graphics</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3450626.3459765\">https://doi.org/10.1145/3450626.3459765</a>","ista":"Mallikarjun BR, Tewari A, Dib A, Weyrich T, Bickel B, Seidel HP, Pfister H, Matusik W, Chevallier L, Elgharib MA, Theobalt C. 2021. PhotoApp: Photorealistic appearance editing of head portraits. ACM Transactions on Graphics. 40(4), 44.","ama":"Mallikarjun BR, Tewari A, Dib A, et al. PhotoApp: Photorealistic appearance editing of head portraits. <i>ACM Transactions on Graphics</i>. 2021;40(4). doi:<a href=\"https://doi.org/10.1145/3450626.3459765\">10.1145/3450626.3459765</a>","chicago":"Mallikarjun, B. R., Ayush Tewari, Abdallah Dib, Tim Weyrich, Bernd Bickel, Hans Peter Seidel, Hanspeter Pfister, et al. “PhotoApp: Photorealistic Appearance Editing of Head Portraits.” <i>ACM Transactions on Graphics</i>. Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3450626.3459765\">https://doi.org/10.1145/3450626.3459765</a>.","ieee":"B. R. Mallikarjun <i>et al.</i>, “PhotoApp: Photorealistic appearance editing of head portraits,” <i>ACM Transactions on Graphics</i>, vol. 40, no. 4. Association for Computing Machinery, 2021."},"scopus_import":"1","external_id":{"isi":["000674930900011"],"arxiv":["2103.07658"]},"month":"08","department":[{"_id":"BeBi"}],"isi":1,"day":"01","intvolume":"        40","arxiv":1,"publication_status":"published","year":"2021","publication_identifier":{"issn":["07300301"],"eissn":["15577368"]},"date_published":"2021-08-01T00:00:00Z","publisher":"Association for Computing Machinery","quality_controlled":"1","article_processing_charge":"Yes (in subscription journal)","article_number":"44","language":[{"iso":"eng"}],"status":"public","oa_version":"Published Version","oa":1,"has_accepted_license":"1","doi":"10.1145/3450626.3459765","abstract":[{"lang":"eng","text":"Photorealistic editing of head portraits is a challenging task as humans are very sensitive to inconsistencies in faces. We present an approach for high-quality intuitive editing of the camera viewpoint and scene illumination (parameterised with an environment map) in a portrait image. This requires our method to capture and control the full reflectance field of the person in the image. Most editing approaches rely on supervised learning using training data captured with setups such as light and camera stages. Such datasets are expensive to acquire, not readily available and do not capture all the rich variations of in-the-wild portrait images. In addition, most supervised approaches only focus on relighting, and do not allow camera viewpoint editing. Thus, they only capture and control a subset of the reflectance field. Recently, portrait editing has been demonstrated by operating in the generative model space of StyleGAN. While such approaches do not require direct supervision, there is a significant loss of quality when compared to the supervised approaches. In this paper, we present a method which learns from limited supervised training data. The training images only include people in a fixed neutral expression with eyes closed, without much hair or background variations. Each person is captured under 150 one-light-at-a-time conditions and under 8 camera poses. Instead of training directly in the image space, we design a supervised problem which learns transformations in the latent space of StyleGAN. This combines the best of supervised learning and generative adversarial modeling. We show that the StyleGAN prior allows for generalisation to different expressions, hairstyles and backgrounds. This produces high-quality photorealistic results for in-the-wild images and significantly outperforms existing methods. Our approach can edit the illumination and pose simultaneously, and runs at interactive rates."}],"publication":"ACM Transactions on Graphics","file":[{"checksum":"51b61b7e5c175e2d7ed8fa3b35f7525a","access_level":"open_access","creator":"asandaue","content_type":"application/pdf","relation":"main_file","date_created":"2021-08-09T11:41:50Z","file_size":49840741,"success":1,"file_name":"2021_ACMTransactionsOnGraphics_Mallikarjun.pdf","date_updated":"2021-08-09T11:41:50Z","file_id":"9834"}],"ddc":["000"],"type":"journal_article","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","title":"PhotoApp: Photorealistic appearance editing of head portraits"},{"scopus_import":"1","citation":{"ieee":"A. Serrano <i>et al.</i>, “The effect of shape and illumination on material perception: Model and applications,” <i>ACM Transactions on Graphics</i>, vol. 40, no. 4. Association for Computing Machinery, 2021.","ista":"Serrano A, Chen B, Wang C, Piovarci M, Seidel HP, Didyk P, Myszkowski K. 2021. The effect of shape and illumination on material perception: Model and applications. ACM Transactions on Graphics. 40(4), 125.","chicago":"Serrano, Ana, Bin Chen, Chao Wang, Michael Piovarci, Hans Peter Seidel, Piotr Didyk, and Karol Myszkowski. “The Effect of Shape and Illumination on Material Perception: Model and Applications.” <i>ACM Transactions on Graphics</i>. Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3450626.3459813\">https://doi.org/10.1145/3450626.3459813</a>.","ama":"Serrano A, Chen B, Wang C, et al. The effect of shape and illumination on material perception: Model and applications. <i>ACM Transactions on Graphics</i>. 2021;40(4). doi:<a href=\"https://doi.org/10.1145/3450626.3459813\">10.1145/3450626.3459813</a>","short":"A. Serrano, B. Chen, C. Wang, M. Piovarci, H.P. Seidel, P. Didyk, K. Myszkowski, ACM Transactions on Graphics 40 (2021).","apa":"Serrano, A., Chen, B., Wang, C., Piovarci, M., Seidel, H. P., Didyk, P., &#38; Myszkowski, K. (2021). The effect of shape and illumination on material perception: Model and applications. <i>ACM Transactions on Graphics</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3450626.3459813\">https://doi.org/10.1145/3450626.3459813</a>","mla":"Serrano, Ana, et al. “The Effect of Shape and Illumination on Material Perception: Model and Applications.” <i>ACM Transactions on Graphics</i>, vol. 40, no. 4, 125, Association for Computing Machinery, 2021, doi:<a href=\"https://doi.org/10.1145/3450626.3459813\">10.1145/3450626.3459813</a>."},"external_id":{"isi":["000674930900090"]},"month":"08","department":[{"_id":"BeBi"}],"isi":1,"day":"01","intvolume":"        40","date_updated":"2023-08-10T14:20:10Z","author":[{"full_name":"Serrano, Ana","last_name":"Serrano","first_name":"Ana"},{"full_name":"Chen, Bin","last_name":"Chen","first_name":"Bin"},{"full_name":"Wang, Chao","first_name":"Chao","last_name":"Wang"},{"full_name":"Piovarci, Michael","orcid":"0000-0002-5062-4474","id":"62E473F4-5C99-11EA-A40E-AF823DDC885E","last_name":"Piovarci","first_name":"Michael"},{"full_name":"Seidel, Hans Peter","last_name":"Seidel","first_name":"Hans Peter"},{"first_name":"Piotr","last_name":"Didyk","full_name":"Didyk, Piotr"},{"first_name":"Karol","last_name":"Myszkowski","full_name":"Myszkowski, Karol"}],"article_type":"original","_id":"9820","date_created":"2021-08-08T22:01:28Z","issue":"4","acknowledgement":"This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie, grant agreement Nº 765911 (RealVision) and from the European Research Council (ERC), grant agreement Nº 804226 (PERDY).","volume":40,"doi":"10.1145/3450626.3459813","publication":"ACM Transactions on Graphics","abstract":[{"text":"Material appearance hinges on material reflectance properties but also surface geometry and illumination. The unlimited number of potential combinations between these factors makes understanding and predicting material appearance a very challenging task. In this work, we collect a large-scale dataset of perceptual ratings of appearance attributes with more than 215,680 responses for 42,120 distinct combinations of material, shape, and illumination. The goal of this dataset is twofold. First, we analyze for the first time the effects of illumination and geometry in material perception across such a large collection of varied appearances. We connect our findings to those of the literature, discussing how previous knowledge generalizes across very diverse materials, shapes, and illuminations. Second, we use the collected dataset to train a deep learning architecture for predicting perceptual attributes that correlate with human judgments. We demonstrate the consistent and robust behavior of our predictor in various challenging scenarios, which, for the first time, enables estimating perceived material attributes from general 2D images. Since our predictor relies on the final appearance in an image, it can compare appearance properties across different geometries and illumination conditions. Finally, we demonstrate several applications that use our predictor, including appearance reproduction using 3D printing, BRDF editing by integrating our predictor in a differentiable renderer, illumination design, or material recommendations for scene design.","lang":"eng"}],"main_file_link":[{"url":"https://zaguan.unizar.es/record/110704/files/texto_completo.pdf","open_access":"1"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","type":"journal_article","title":"The effect of shape and illumination on material perception: Model and applications","date_published":"2021-08-01T00:00:00Z","publication_identifier":{"issn":["07300301"],"eissn":["15577368"]},"publication_status":"published","year":"2021","publisher":"Association for Computing Machinery","quality_controlled":"1","article_number":"125","language":[{"iso":"eng"}],"article_processing_charge":"No","oa":1,"status":"public","oa_version":"Submitted Version"},{"volume":16,"acknowledgement":"We express our gratitude to the anonymous referees who provided constructive comments that helped us improve the quality of the paper.","issue":"7","file_date_updated":"2021-08-09T09:25:41Z","date_created":"2021-08-08T22:01:28Z","_id":"9821","article_type":"original","author":[{"last_name":"Graff","first_name":"Grzegorz","full_name":"Graff, Grzegorz"},{"first_name":"Beata","last_name":"Graff","full_name":"Graff, Beata"},{"id":"3768D56A-F248-11E8-B48F-1D18A9856A87","last_name":"Pilarczyk","first_name":"Pawel","full_name":"Pilarczyk, Pawel"},{"last_name":"Jablonski","id":"4483EF78-F248-11E8-B48F-1D18A9856A87","first_name":"Grzegorz","orcid":"0000-0002-3536-9866","full_name":"Jablonski, Grzegorz"},{"first_name":"Dariusz","last_name":"Gąsecki","full_name":"Gąsecki, Dariusz"},{"first_name":"Krzysztof","last_name":"Narkiewicz","full_name":"Narkiewicz, Krzysztof"}],"date_updated":"2023-08-10T14:21:42Z","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"intvolume":"        16","day":"01","pmid":1,"isi":1,"month":"07","department":[{"_id":"HeEd"}],"external_id":{"isi":["000678124900050"],"pmid":["34292957"]},"scopus_import":"1","citation":{"ieee":"G. Graff, B. Graff, P. Pilarczyk, G. Jablonski, D. Gąsecki, and K. Narkiewicz, “Persistent homology as a new method of the assessment of heart rate variability,” <i>PLoS ONE</i>, vol. 16, no. 7. Public Library of Science, 2021.","apa":"Graff, G., Graff, B., Pilarczyk, P., Jablonski, G., Gąsecki, D., &#38; Narkiewicz, K. (2021). Persistent homology as a new method of the assessment of heart rate variability. <i>PLoS ONE</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pone.0253851\">https://doi.org/10.1371/journal.pone.0253851</a>","mla":"Graff, Grzegorz, et al. “Persistent Homology as a New Method of the Assessment of Heart Rate Variability.” <i>PLoS ONE</i>, vol. 16, no. 7, e0253851, Public Library of Science, 2021, doi:<a href=\"https://doi.org/10.1371/journal.pone.0253851\">10.1371/journal.pone.0253851</a>.","short":"G. Graff, B. Graff, P. Pilarczyk, G. Jablonski, D. Gąsecki, K. Narkiewicz, PLoS ONE 16 (2021).","ama":"Graff G, Graff B, Pilarczyk P, Jablonski G, Gąsecki D, Narkiewicz K. Persistent homology as a new method of the assessment of heart rate variability. <i>PLoS ONE</i>. 2021;16(7). doi:<a href=\"https://doi.org/10.1371/journal.pone.0253851\">10.1371/journal.pone.0253851</a>","chicago":"Graff, Grzegorz, Beata Graff, Pawel Pilarczyk, Grzegorz Jablonski, Dariusz Gąsecki, and Krzysztof Narkiewicz. “Persistent Homology as a New Method of the Assessment of Heart Rate Variability.” <i>PLoS ONE</i>. Public Library of Science, 2021. <a href=\"https://doi.org/10.1371/journal.pone.0253851\">https://doi.org/10.1371/journal.pone.0253851</a>.","ista":"Graff G, Graff B, Pilarczyk P, Jablonski G, Gąsecki D, Narkiewicz K. 2021. Persistent homology as a new method of the assessment of heart rate variability. PLoS ONE. 16(7), e0253851."},"has_accepted_license":"1","oa":1,"oa_version":"Published Version","status":"public","language":[{"iso":"eng"}],"article_number":"e0253851","article_processing_charge":"Yes","quality_controlled":"1","publisher":"Public Library of Science","date_published":"2021-07-01T00:00:00Z","publication_identifier":{"eissn":["19326203"]},"publication_status":"published","year":"2021","title":"Persistent homology as a new method of the assessment of heart rate variability","type":"journal_article","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","file":[{"content_type":"application/pdf","access_level":"open_access","creator":"asandaue","checksum":"0277aa155d5db1febd2cb384768bba5f","date_created":"2021-08-09T09:25:41Z","relation":"main_file","file_size":2706919,"file_id":"9832","date_updated":"2021-08-09T09:25:41Z","success":1,"file_name":"2021_PLoSONE_Graff.pdf"}],"ddc":["006"],"publication":"PLoS ONE","abstract":[{"text":"Heart rate variability (hrv) is a physiological phenomenon of the variation in the length of the time interval between consecutive heartbeats. In many cases it could be an indicator of the development of pathological states. The classical approach to the analysis of hrv includes time domain methods and frequency domain methods. However, attempts are still being made to define new and more effective hrv assessment tools. Persistent homology is a novel data analysis tool developed in the recent decades that is rooted at algebraic topology. The Topological Data Analysis (TDA) approach focuses on examining the shape of the data in terms of connectedness and holes, and has recently proved to be very effective in various fields of research. In this paper we propose the use of persistent homology to the hrv analysis. We recall selected topological descriptors used in the literature and we introduce some new topological descriptors that reflect the specificity of hrv, and we discuss their relation to the standard hrv measures. In particular, we show that this novel approach provides a collection of indices that might be at least as useful as the classical parameters in differentiating between series of beat-to-beat intervals (RR-intervals) in healthy subjects and patients suffering from a stroke episode.","lang":"eng"}],"doi":"10.1371/journal.pone.0253851"},{"date_published":"2021-08-04T00:00:00Z","publication_status":"published","publication_identifier":{"eissn":["19448252"],"issn":["19448244"]},"year":"2021","page":"35545–35560","publisher":"American Chemical Society","quality_controlled":"1","ec_funded":1,"language":[{"iso":"eng"}],"article_processing_charge":"Yes (in subscription journal)","oa":1,"has_accepted_license":"1","status":"public","oa_version":"Published Version","doi":"10.1021/acsami.1c09850","publication":"ACS Applied Materials and Interfaces","abstract":[{"lang":"eng","text":"Attachment of adhesive molecules on cell culture surfaces to restrict cell adhesion to defined areas and shapes has been vital for the progress of in vitro research. In currently existing patterning methods, a combination of pattern properties such as stability, precision, specificity, high-throughput outcome, and spatiotemporal control is highly desirable but challenging to achieve. Here, we introduce a versatile and high-throughput covalent photoimmobilization technique, comprising a light-dose-dependent patterning step and a subsequent functionalization of the pattern via click chemistry. This two-step process is feasible on arbitrary surfaces and allows for generation of sustainable patterns and gradients. The method is validated in different biological systems by patterning adhesive ligands on cell-repellent surfaces, thereby constraining the growth and migration of cells to the designated areas. We then implement a sequential photopatterning approach by adding a second switchable patterning step, allowing for spatiotemporal control over two distinct surface patterns. As a proof of concept, we reconstruct the dynamics of the tip/stalk cell switch during angiogenesis. Our results show that the spatiotemporal control provided by our “sequential photopatterning” system is essential for mimicking dynamic biological processes and that our innovative approach has great potential for further applications in cell science."}],"ddc":["620","570"],"file":[{"file_name":"2021_ACSAppliedMaterialsAndInterfaces_Zisis.pdf","success":1,"date_updated":"2021-08-09T09:44:03Z","file_id":"9833","file_size":7123293,"date_created":"2021-08-09T09:44:03Z","relation":"main_file","checksum":"b043a91d9f9200e467b970b692687ed3","access_level":"open_access","content_type":"application/pdf","creator":"asandaue"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","type":"journal_article","title":"Sequential and switchable patterning for studying cellular processes under spatiotemporal control","tmp":{"short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"date_updated":"2023-08-10T14:22:48Z","author":[{"full_name":"Zisis, Themistoklis","first_name":"Themistoklis","last_name":"Zisis"},{"full_name":"Schwarz, Jan","first_name":"Jan","id":"346C1EC6-F248-11E8-B48F-1D18A9856A87","last_name":"Schwarz"},{"last_name":"Balles","first_name":"Miriam","full_name":"Balles, Miriam"},{"full_name":"Kretschmer, Maibritt","last_name":"Kretschmer","first_name":"Maibritt"},{"last_name":"Nemethova","id":"34E27F1C-F248-11E8-B48F-1D18A9856A87","first_name":"Maria","full_name":"Nemethova, Maria"},{"first_name":"Remy P","last_name":"Chait","id":"3464AE84-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0876-3187","full_name":"Chait, Remy P"},{"full_name":"Hauschild, Robert","orcid":"0000-0001-9843-3522","first_name":"Robert","id":"4E01D6B4-F248-11E8-B48F-1D18A9856A87","last_name":"Hauschild"},{"full_name":"Lange, Janina","first_name":"Janina","last_name":"Lange"},{"id":"47F8433E-F248-11E8-B48F-1D18A9856A87","last_name":"Guet","first_name":"Calin C","full_name":"Guet, Calin C","orcid":"0000-0001-6220-2052"},{"full_name":"Sixt, Michael K","orcid":"0000-0002-4561-241X","first_name":"Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","last_name":"Sixt"},{"first_name":"Stefan","last_name":"Zahler","full_name":"Zahler, Stefan"}],"article_type":"original","_id":"9822","date_created":"2021-08-08T22:01:28Z","issue":"30","file_date_updated":"2021-08-09T09:44:03Z","acknowledgement":"We would like to thank Charlott Leu for the production of our chromium wafers, Louise Ritter for her contribution of the IF stainings in Figure 4, Shokoufeh Teymouri for her help with the Bioinert coated slides, and finally Prof. Dr. Joachim Rädler for his valuable scientific guidance.","volume":13,"project":[{"_id":"25FE9508-B435-11E9-9278-68D0E5697425","name":"Cellular navigation along spatial gradients","grant_number":"724373","call_identifier":"H2020"}],"scopus_import":"1","citation":{"apa":"Zisis, T., Schwarz, J., Balles, M., Kretschmer, M., Nemethova, M., Chait, R. P., … Zahler, S. (2021). Sequential and switchable patterning for studying cellular processes under spatiotemporal control. <i>ACS Applied Materials and Interfaces</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/acsami.1c09850\">https://doi.org/10.1021/acsami.1c09850</a>","short":"T. Zisis, J. Schwarz, M. Balles, M. Kretschmer, M. Nemethova, R.P. Chait, R. Hauschild, J. Lange, C.C. Guet, M.K. Sixt, S. Zahler, ACS Applied Materials and Interfaces 13 (2021) 35545–35560.","mla":"Zisis, Themistoklis, et al. “Sequential and Switchable Patterning for Studying Cellular Processes under Spatiotemporal Control.” <i>ACS Applied Materials and Interfaces</i>, vol. 13, no. 30, American Chemical Society, 2021, pp. 35545–35560, doi:<a href=\"https://doi.org/10.1021/acsami.1c09850\">10.1021/acsami.1c09850</a>.","chicago":"Zisis, Themistoklis, Jan Schwarz, Miriam Balles, Maibritt Kretschmer, Maria Nemethova, Remy P Chait, Robert Hauschild, et al. “Sequential and Switchable Patterning for Studying Cellular Processes under Spatiotemporal Control.” <i>ACS Applied Materials and Interfaces</i>. American Chemical Society, 2021. <a href=\"https://doi.org/10.1021/acsami.1c09850\">https://doi.org/10.1021/acsami.1c09850</a>.","ama":"Zisis T, Schwarz J, Balles M, et al. Sequential and switchable patterning for studying cellular processes under spatiotemporal control. <i>ACS Applied Materials and Interfaces</i>. 2021;13(30):35545–35560. doi:<a href=\"https://doi.org/10.1021/acsami.1c09850\">10.1021/acsami.1c09850</a>","ista":"Zisis T, Schwarz J, Balles M, Kretschmer M, Nemethova M, Chait RP, Hauschild R, Lange J, Guet CC, Sixt MK, Zahler S. 2021. Sequential and switchable patterning for studying cellular processes under spatiotemporal control. ACS Applied Materials and Interfaces. 13(30), 35545–35560.","ieee":"T. Zisis <i>et al.</i>, “Sequential and switchable patterning for studying cellular processes under spatiotemporal control,” <i>ACS Applied Materials and Interfaces</i>, vol. 13, no. 30. American Chemical Society, pp. 35545–35560, 2021."},"external_id":{"isi":["000683741400026"],"pmid":["34283577"]},"month":"08","department":[{"_id":"MiSi"},{"_id":"GaTk"},{"_id":"Bio"},{"_id":"CaGu"}],"pmid":1,"isi":1,"day":"04","intvolume":"        13"},{"publication":"Structural Information and Communication Complexity","abstract":[{"text":"Approximate agreement is one of the few variants of consensus that can be solved in a wait-free manner in asynchronous systems where processes communicate by reading and writing to shared memory. In this work, we consider a natural generalisation of approximate agreement on arbitrary undirected connected graphs. Each process is given a vertex of the graph as input and, if non-faulty, must output a vertex such that\r\nall the outputs are within distance 1 of one another, and\r\n\r\neach output value lies on a shortest path between two input values.\r\n\r\nFrom prior work, it is known that there is no wait-free algorithm among   𝑛≥3  processes for this problem on any cycle of length   𝑐≥4 , by reduction from 2-set agreement (Castañeda et al. 2018).\r\n\r\nIn this work, we investigate the solvability and complexity of this task on general graphs. We give a new, direct proof of the impossibility of approximate agreement on cycles of length   𝑐≥4 , via a generalisation of Sperner’s Lemma to convex polygons. We also extend the reduction from 2-set agreement to a larger class of graphs, showing that approximate agreement on these graphs is unsolvable. On the positive side, we present a wait-free algorithm for a class of graphs that properly contains the class of chordal graphs.","lang":"eng"}],"doi":"10.1007/978-3-030-79527-6_6","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2103.08949"}],"title":"Wait-free approximate agreement on graphs","type":"conference","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","page":"87-105","quality_controlled":"1","publisher":"Springer Nature","date_published":"2021-06-20T00:00:00Z","publication_identifier":{"eissn":["16113349"],"issn":["03029743"],"isbn":["9783030795269"]},"publication_status":"published","year":"2021","oa":1,"oa_version":"Preprint","status":"public","language":[{"iso":"eng"}],"alternative_title":["LNCS"],"article_processing_charge":"No","external_id":{"arxiv":["2103.08949"]},"scopus_import":"1","conference":{"location":"Wrocław, Poland","start_date":"2021-06-28","name":"SIROCCO: Structural Information and Communication Complexity","end_date":"2021-07-01"},"citation":{"ieee":"D.-A. Alistarh, F. Ellen, and J. Rybicki, “Wait-free approximate agreement on graphs,” in <i>Structural Information and Communication Complexity</i>, Wrocław, Poland, 2021, vol. 12810, pp. 87–105.","short":"D.-A. Alistarh, F. Ellen, J. Rybicki, in:, Structural Information and Communication Complexity, Springer Nature, 2021, pp. 87–105.","apa":"Alistarh, D.-A., Ellen, F., &#38; Rybicki, J. (2021). Wait-free approximate agreement on graphs. In <i>Structural Information and Communication Complexity</i> (Vol. 12810, pp. 87–105). Wrocław, Poland: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-79527-6_6\">https://doi.org/10.1007/978-3-030-79527-6_6</a>","mla":"Alistarh, Dan-Adrian, et al. “Wait-Free Approximate Agreement on Graphs.” <i>Structural Information and Communication Complexity</i>, vol. 12810, Springer Nature, 2021, pp. 87–105, doi:<a href=\"https://doi.org/10.1007/978-3-030-79527-6_6\">10.1007/978-3-030-79527-6_6</a>.","ista":"Alistarh D-A, Ellen F, Rybicki J. 2021. Wait-free approximate agreement on graphs. Structural Information and Communication Complexity. SIROCCO: Structural Information and Communication Complexity, LNCS, vol. 12810, 87–105.","chicago":"Alistarh, Dan-Adrian, Faith Ellen, and Joel Rybicki. “Wait-Free Approximate Agreement on Graphs.” In <i>Structural Information and Communication Complexity</i>, 12810:87–105. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/978-3-030-79527-6_6\">https://doi.org/10.1007/978-3-030-79527-6_6</a>.","ama":"Alistarh D-A, Ellen F, Rybicki J. Wait-free approximate agreement on graphs. In: <i>Structural Information and Communication Complexity</i>. Vol 12810. Springer Nature; 2021:87-105. doi:<a href=\"https://doi.org/10.1007/978-3-030-79527-6_6\">10.1007/978-3-030-79527-6_6</a>"},"arxiv":1,"intvolume":"     12810","day":"20","month":"06","department":[{"_id":"DaAl"}],"author":[{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X"},{"full_name":"Ellen, Faith","last_name":"Ellen","first_name":"Faith"},{"first_name":"Joel","id":"334EFD2E-F248-11E8-B48F-1D18A9856A87","last_name":"Rybicki","full_name":"Rybicki, Joel","orcid":"0000-0002-6432-6646"}],"date_updated":"2023-02-23T14:09:49Z","volume":12810,"date_created":"2021-08-08T22:01:29Z","_id":"9823"},{"date_updated":"2022-05-31T06:58:21Z","author":[{"full_name":"Čomić, Lidija","first_name":"Lidija","last_name":"Čomić"},{"first_name":"Rita","last_name":"Zrour","full_name":"Zrour, Rita"},{"full_name":"Largeteau-Skapin, Gaëlle","last_name":"Largeteau-Skapin","first_name":"Gaëlle"},{"orcid":"0000-0002-5372-7890","full_name":"Biswas, Ranita","first_name":"Ranita","last_name":"Biswas","id":"3C2B033E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Andres, Eric","last_name":"Andres","first_name":"Eric"}],"date_created":"2021-08-08T22:01:29Z","_id":"9824","acknowledgement":"This work has been partially supported by the Ministry of Education, Science and Technological Development of the Republic of Serbia through the project no. 451-03-68/2020-14/200156: “Innovative scientific and artistic research from the FTS (activity) domain” (LČ), the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme, grant no. 788183 (RB), and the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, Austrian Science Fund (FWF), grant no. I 02979-N35 (RB).","volume":12708,"citation":{"short":"L. Čomić, R. Zrour, G. Largeteau-Skapin, R. Biswas, E. Andres, in:, Discrete Geometry and Mathematical Morphology, Springer Nature, 2021, pp. 152–163.","mla":"Čomić, Lidija, et al. “Body Centered Cubic Grid - Coordinate System and Discrete Analytical Plane Definition.” <i>Discrete Geometry and Mathematical Morphology</i>, vol. 12708, Springer Nature, 2021, pp. 152–63, doi:<a href=\"https://doi.org/10.1007/978-3-030-76657-3_10\">10.1007/978-3-030-76657-3_10</a>.","apa":"Čomić, L., Zrour, R., Largeteau-Skapin, G., Biswas, R., &#38; Andres, E. (2021). Body centered cubic grid - coordinate system and discrete analytical plane definition. In <i>Discrete Geometry and Mathematical Morphology</i> (Vol. 12708, pp. 152–163). Uppsala, Sweden: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-76657-3_10\">https://doi.org/10.1007/978-3-030-76657-3_10</a>","ista":"Čomić L, Zrour R, Largeteau-Skapin G, Biswas R, Andres E. 2021. Body centered cubic grid - coordinate system and discrete analytical plane definition. Discrete Geometry and Mathematical Morphology. DGMM: International Conference on Discrete Geometry and Mathematical Morphology, LNCS, vol. 12708, 152–163.","chicago":"Čomić, Lidija, Rita Zrour, Gaëlle Largeteau-Skapin, Ranita Biswas, and Eric Andres. “Body Centered Cubic Grid - Coordinate System and Discrete Analytical Plane Definition.” In <i>Discrete Geometry and Mathematical Morphology</i>, 12708:152–63. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/978-3-030-76657-3_10\">https://doi.org/10.1007/978-3-030-76657-3_10</a>.","ama":"Čomić L, Zrour R, Largeteau-Skapin G, Biswas R, Andres E. Body centered cubic grid - coordinate system and discrete analytical plane definition. In: <i>Discrete Geometry and Mathematical Morphology</i>. Vol 12708. Springer Nature; 2021:152-163. doi:<a href=\"https://doi.org/10.1007/978-3-030-76657-3_10\">10.1007/978-3-030-76657-3_10</a>","ieee":"L. Čomić, R. Zrour, G. Largeteau-Skapin, R. Biswas, and E. Andres, “Body centered cubic grid - coordinate system and discrete analytical plane definition,” in <i>Discrete Geometry and Mathematical Morphology</i>, Uppsala, Sweden, 2021, vol. 12708, pp. 152–163."},"project":[{"grant_number":"788183","call_identifier":"H2020","name":"Alpha Shape Theory Extended","_id":"266A2E9E-B435-11E9-9278-68D0E5697425"},{"name":"Persistence and stability of geometric complexes","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"I02979-N35"}],"scopus_import":"1","conference":{"start_date":"2021-05-24","name":"DGMM: International Conference on Discrete Geometry and Mathematical Morphology","location":"Uppsala, Sweden","end_date":"2021-05-27"},"month":"05","department":[{"_id":"HeEd"}],"intvolume":"     12708","day":"16","publication_identifier":{"isbn":["9783030766566"],"eissn":["16113349"],"issn":["03029743"]},"publication_status":"published","year":"2021","date_published":"2021-05-16T00:00:00Z","quality_controlled":"1","publisher":"Springer Nature","page":"152-163","article_processing_charge":"No","language":[{"iso":"eng"}],"alternative_title":["LNCS"],"ec_funded":1,"oa_version":"None","status":"public","doi":"10.1007/978-3-030-76657-3_10","abstract":[{"text":"We define a new compact coordinate system in which each integer triplet addresses a voxel in the BCC grid, and we investigate some of its properties. We propose a characterization of 3D discrete analytical planes with their topological features (in the Cartesian and in the new coordinate system) such as the interrelation between the thickness of the plane and the separability constraint we aim to obtain.","lang":"eng"}],"publication":"Discrete Geometry and Mathematical Morphology","title":"Body centered cubic grid - coordinate system and discrete analytical plane definition","type":"conference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"page":"478-502","publisher":"Springer Nature","quality_controlled":"1","date_published":"2021-05-11T00:00:00Z","year":"2021","publication_identifier":{"issn":["03029743"],"eissn":["16113349"],"isbn":["9783030755386"]},"publication_status":"published","oa":1,"status":"public","oa_version":"Preprint","language":[{"iso":"eng"}],"alternative_title":["LNCS"],"article_processing_charge":"No","publication":"Topics in Cryptology – CT-RSA 2021","abstract":[{"lang":"eng","text":"The dual attack has long been considered a relevant attack on lattice-based cryptographic schemes relying on the hardness of learning with errors (LWE) and its structured variants. As solving LWE corresponds to finding a nearest point on a lattice, one may naturally wonder how efficient this dual approach is for solving more general closest vector problems, such as the classical closest vector problem (CVP), the variants bounded distance decoding (BDD) and approximate CVP, and preprocessing versions of these problems. While primal, sieving-based solutions to these problems (with preprocessing) were recently studied in a series of works on approximate Voronoi cells [Laa16b, DLdW19, Laa20, DLvW20], for the dual attack no such overview exists, especially for problems with preprocessing. With one of the take-away messages of the approximate Voronoi cell line of work being that primal attacks work well for approximate CVP(P) but scale poorly for BDD(P), one may further wonder if the dual attack suffers the same drawbacks, or if it is perhaps a better solution when trying to solve BDD(P).\r\n\r\nIn this work we provide an overview of cost estimates for dual algorithms for solving these “classical” closest lattice vector problems. Heuristically we expect to solve the search version of average-case CVPP in time and space   20.293𝑑+𝑜(𝑑)  in the single-target model. The distinguishing version of average-case CVPP, where we wish to distinguish between random targets and targets planted at distance (say)   0.99⋅𝑔𝑑  from the lattice, has the same complexity in the single-target model, but can be solved in time and space   20.195𝑑+𝑜(𝑑)  in the multi-target setting, when given a large number of targets from either target distribution. This suggests an inequivalence between distinguishing and searching, as we do not expect a similar improvement in the multi-target setting to hold for search-CVPP. We analyze three slightly different decoders, both for distinguishing and searching, and experimentally obtain concrete cost estimates for the dual attack in dimensions 50 to 80, which confirm our heuristic assumptions, and show that the hidden order terms in the asymptotic estimates are quite small.\r\n\r\nOur main take-away message is that the dual attack appears to mirror the approximate Voronoi cell line of work – whereas using approximate Voronoi cells works well for approximate CVP(P) but scales poorly for BDD(P), the dual approach scales well for BDD(P) instances but performs poorly on approximate CVP(P)."}],"doi":"10.1007/978-3-030-75539-3_20","main_file_link":[{"url":"https://eprint.iacr.org/2021/557","open_access":"1"}],"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","type":"conference","title":"Dual lattice attacks for closest vector problems (with preprocessing)","author":[{"last_name":"Laarhoven","first_name":"Thijs","full_name":"Laarhoven, Thijs"},{"last_name":"Walter","id":"488F98B0-F248-11E8-B48F-1D18A9856A87","first_name":"Michael","orcid":"0000-0003-3186-2482","full_name":"Walter, Michael"}],"date_updated":"2023-02-23T14:09:54Z","volume":12704,"acknowledgement":"The authors thank Sauvik Bhattacharya, L´eo Ducas, Rachel Player, and Christine van Vredendaal for early discussions on this topic and on preliminary results. The authors further thank the reviewers of CT-RSA 2021 for their valuable feedback.","_id":"9825","date_created":"2021-08-08T22:01:30Z","conference":{"location":"Virtual Event","name":"CT-RSA: Cryptographers’ Track at the RSA Conference","start_date":"2021-05-17","end_date":"2021-05-20"},"scopus_import":"1","citation":{"short":"T. Laarhoven, M. Walter, in:, Topics in Cryptology – CT-RSA 2021, Springer Nature, 2021, pp. 478–502.","apa":"Laarhoven, T., &#38; Walter, M. (2021). Dual lattice attacks for closest vector problems (with preprocessing). In <i>Topics in Cryptology – CT-RSA 2021</i> (Vol. 12704, pp. 478–502). Virtual Event: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-75539-3_20\">https://doi.org/10.1007/978-3-030-75539-3_20</a>","mla":"Laarhoven, Thijs, and Michael Walter. “Dual Lattice Attacks for Closest Vector Problems (with Preprocessing).” <i>Topics in Cryptology – CT-RSA 2021</i>, vol. 12704, Springer Nature, 2021, pp. 478–502, doi:<a href=\"https://doi.org/10.1007/978-3-030-75539-3_20\">10.1007/978-3-030-75539-3_20</a>.","ama":"Laarhoven T, Walter M. Dual lattice attacks for closest vector problems (with preprocessing). In: <i>Topics in Cryptology – CT-RSA 2021</i>. Vol 12704. Springer Nature; 2021:478-502. doi:<a href=\"https://doi.org/10.1007/978-3-030-75539-3_20\">10.1007/978-3-030-75539-3_20</a>","ista":"Laarhoven T, Walter M. 2021. Dual lattice attacks for closest vector problems (with preprocessing). Topics in Cryptology – CT-RSA 2021. CT-RSA: Cryptographers’ Track at the RSA Conference, LNCS, vol. 12704, 478–502.","chicago":"Laarhoven, Thijs, and Michael Walter. “Dual Lattice Attacks for Closest Vector Problems (with Preprocessing).” In <i>Topics in Cryptology – CT-RSA 2021</i>, 12704:478–502. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/978-3-030-75539-3_20\">https://doi.org/10.1007/978-3-030-75539-3_20</a>.","ieee":"T. Laarhoven and M. Walter, “Dual lattice attacks for closest vector problems (with preprocessing),” in <i>Topics in Cryptology – CT-RSA 2021</i>, Virtual Event, 2021, vol. 12704, pp. 478–502."},"day":"11","intvolume":"     12704","department":[{"_id":"KrPi"}],"month":"05"},{"status":"public","oa_version":"Submitted Version","oa":1,"article_processing_charge":"No","ec_funded":1,"language":[{"iso":"eng"}],"alternative_title":["LNCS"],"publisher":"Springer Nature","quality_controlled":"1","page":"399-421","year":"2021","publication_status":"published","publication_identifier":{"isbn":["9783030755386"],"issn":["03029743"],"eissn":["16113349"]},"date_published":"2021-05-11T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference","title":"Inverse-Sybil attacks in automated contact tracing","main_file_link":[{"url":"https://eprint.iacr.org/2020/670","open_access":"1"}],"abstract":[{"text":"Automated contract tracing aims at supporting manual contact tracing during pandemics by alerting users of encounters with infected people. There are currently many proposals for protocols (like the “decentralized” DP-3T and PACT or the “centralized” ROBERT and DESIRE) to be run on mobile phones, where the basic idea is to regularly broadcast (using low energy Bluetooth) some values, and at the same time store (a function of) incoming messages broadcasted by users in their proximity. In the existing proposals one can trigger false positives on a massive scale by an “inverse-Sybil” attack, where a large number of devices (malicious users or hacked phones) pretend to be the same user, such that later, just a single person needs to be diagnosed (and allowed to upload) to trigger an alert for all users who were in proximity to any of this large group of devices.\r\n\r\nWe propose the first protocols that do not succumb to such attacks assuming the devices involved in the attack do not constantly communicate, which we observe is a necessary assumption. The high level idea of the protocols is to derive the values to be broadcasted by a hash chain, so that two (or more) devices who want to launch an inverse-Sybil attack will not be able to connect their respective chains and thus only one of them will be able to upload. Our protocols also achieve security against replay, belated replay, and one of them even against relay attacks.","lang":"eng"}],"publication":"Topics in Cryptology – CT-RSA 2021","doi":"10.1007/978-3-030-75539-3_17","acknowledgement":"Guillermo Pascual-Perez and Michelle Yeo were funded by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska–Curie Grant Agreement No. 665385; the remaining contributors to this project have received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (682815 - TOCNeT).","volume":12704,"_id":"9826","date_created":"2021-08-08T22:01:30Z","author":[{"full_name":"Auerbach, Benedikt","orcid":"0000-0002-7553-6606","id":"D33D2B18-E445-11E9-ABB7-15F4E5697425","last_name":"Auerbach","first_name":"Benedikt"},{"first_name":"Suvradip","last_name":"Chakraborty","id":"B9CD0494-D033-11E9-B219-A439E6697425","full_name":"Chakraborty, Suvradip"},{"full_name":"Klein, Karen","first_name":"Karen","last_name":"Klein","id":"3E83A2F8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Guillermo","id":"2D7ABD02-F248-11E8-B48F-1D18A9856A87","last_name":"Pascual Perez","full_name":"Pascual Perez, Guillermo"},{"orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z","last_name":"Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z"},{"orcid":"0000-0003-3186-2482","full_name":"Walter, Michael","last_name":"Walter","id":"488F98B0-F248-11E8-B48F-1D18A9856A87","first_name":"Michael"},{"id":"2D82B818-F248-11E8-B48F-1D18A9856A87","last_name":"Yeo","first_name":"Michelle X","full_name":"Yeo, Michelle X"}],"date_updated":"2023-02-23T14:09:56Z","day":"11","intvolume":"     12704","month":"05","department":[{"_id":"KrPi"},{"_id":"GradSch"}],"citation":{"chicago":"Auerbach, Benedikt, Suvradip Chakraborty, Karen Klein, Guillermo Pascual Perez, Krzysztof Z Pietrzak, Michael Walter, and Michelle X Yeo. “Inverse-Sybil Attacks in Automated Contact Tracing.” In <i>Topics in Cryptology – CT-RSA 2021</i>, 12704:399–421. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/978-3-030-75539-3_17\">https://doi.org/10.1007/978-3-030-75539-3_17</a>.","ista":"Auerbach B, Chakraborty S, Klein K, Pascual Perez G, Pietrzak KZ, Walter M, Yeo MX. 2021. Inverse-Sybil attacks in automated contact tracing. Topics in Cryptology – CT-RSA 2021. CT-RSA: Cryptographers’ Track at the RSA Conference, LNCS, vol. 12704, 399–421.","ama":"Auerbach B, Chakraborty S, Klein K, et al. Inverse-Sybil attacks in automated contact tracing. In: <i>Topics in Cryptology – CT-RSA 2021</i>. Vol 12704. Springer Nature; 2021:399-421. doi:<a href=\"https://doi.org/10.1007/978-3-030-75539-3_17\">10.1007/978-3-030-75539-3_17</a>","apa":"Auerbach, B., Chakraborty, S., Klein, K., Pascual Perez, G., Pietrzak, K. Z., Walter, M., &#38; Yeo, M. X. (2021). Inverse-Sybil attacks in automated contact tracing. In <i>Topics in Cryptology – CT-RSA 2021</i> (Vol. 12704, pp. 399–421). Virtual Event: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-75539-3_17\">https://doi.org/10.1007/978-3-030-75539-3_17</a>","mla":"Auerbach, Benedikt, et al. “Inverse-Sybil Attacks in Automated Contact Tracing.” <i>Topics in Cryptology – CT-RSA 2021</i>, vol. 12704, Springer Nature, 2021, pp. 399–421, doi:<a href=\"https://doi.org/10.1007/978-3-030-75539-3_17\">10.1007/978-3-030-75539-3_17</a>.","short":"B. Auerbach, S. Chakraborty, K. Klein, G. Pascual Perez, K.Z. Pietrzak, M. Walter, M.X. Yeo, in:, Topics in Cryptology – CT-RSA 2021, Springer Nature, 2021, pp. 399–421.","ieee":"B. Auerbach <i>et al.</i>, “Inverse-Sybil attacks in automated contact tracing,” in <i>Topics in Cryptology – CT-RSA 2021</i>, Virtual Event, 2021, vol. 12704, pp. 399–421."},"conference":{"location":"Virtual Event","start_date":"2021-05-17","name":"CT-RSA: Cryptographers’ Track at the RSA Conference","end_date":"2021-05-20"},"scopus_import":"1","project":[{"name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","call_identifier":"H2020"},{"grant_number":"682815","call_identifier":"H2020","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","name":"Teaching Old Crypto New Tricks"}]},{"keyword":["Concurrent data structure","kD-tree","Nearest neighbor search","Similarity search","Lock-free","Linearizability"],"article_type":"original","author":[{"full_name":"Chatterjee, Bapi","orcid":"0000-0002-2742-4028","id":"3C41A08A-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Bapi"},{"first_name":"Ivan","last_name":"Walulya","full_name":"Walulya, Ivan"},{"first_name":"Philippas","last_name":"Tsigas","full_name":"Tsigas, Philippas"}],"date_updated":"2023-08-10T14:27:43Z","volume":886,"_id":"9827","date_created":"2021-08-08T22:01:31Z","external_id":{"isi":["000694718900004"]},"citation":{"ama":"Chatterjee B, Walulya I, Tsigas P. Concurrent linearizable nearest neighbour search in LockFree-kD-tree. <i>Theoretical Computer Science</i>. 2021;886:27-48. doi:<a href=\"https://doi.org/10.1016/j.tcs.2021.06.041\">10.1016/j.tcs.2021.06.041</a>","chicago":"Chatterjee, Bapi, Ivan Walulya, and Philippas Tsigas. “Concurrent Linearizable Nearest Neighbour Search in LockFree-KD-Tree.” <i>Theoretical Computer Science</i>. Elsevier, 2021. <a href=\"https://doi.org/10.1016/j.tcs.2021.06.041\">https://doi.org/10.1016/j.tcs.2021.06.041</a>.","ista":"Chatterjee B, Walulya I, Tsigas P. 2021. Concurrent linearizable nearest neighbour search in LockFree-kD-tree. Theoretical Computer Science. 886, 27–48.","apa":"Chatterjee, B., Walulya, I., &#38; Tsigas, P. (2021). Concurrent linearizable nearest neighbour search in LockFree-kD-tree. <i>Theoretical Computer Science</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.tcs.2021.06.041\">https://doi.org/10.1016/j.tcs.2021.06.041</a>","mla":"Chatterjee, Bapi, et al. “Concurrent Linearizable Nearest Neighbour Search in LockFree-KD-Tree.” <i>Theoretical Computer Science</i>, vol. 886, Elsevier, 2021, pp. 27–48, doi:<a href=\"https://doi.org/10.1016/j.tcs.2021.06.041\">10.1016/j.tcs.2021.06.041</a>.","short":"B. Chatterjee, I. Walulya, P. Tsigas, Theoretical Computer Science 886 (2021) 27–48.","ieee":"B. Chatterjee, I. Walulya, and P. Tsigas, “Concurrent linearizable nearest neighbour search in LockFree-kD-tree,” <i>Theoretical Computer Science</i>, vol. 886. Elsevier, pp. 27–48, 2021."},"scopus_import":"1","day":"13","intvolume":"       886","month":"09","department":[{"_id":"DaAl"}],"isi":1,"publisher":"Elsevier","quality_controlled":"1","page":"27-48","publication_status":"published","publication_identifier":{"issn":["0304-3975"]},"year":"2021","date_published":"2021-09-13T00:00:00Z","status":"public","oa_version":"Submitted Version","oa":1,"article_processing_charge":"No","language":[{"iso":"eng"}],"abstract":[{"text":"The Nearest neighbour search (NNS) is a fundamental problem in many application domains dealing with multidimensional data. In a concurrent setting, where dynamic modifications are allowed, a linearizable implementation of the NNS is highly desirable.This paper introduces the LockFree-kD-tree (LFkD-tree ): a lock-free concurrent kD-tree, which implements an abstract data type (ADT) that provides the operations Add, Remove, Contains, and NNS. Our implementation is linearizable. The operations in the LFkD-tree use single-word read and compare-and-swap (Image 1 ) atomic primitives, which are readily supported on available multi-core processors. We experimentally evaluate the LFkD-tree using several benchmarks comprising real-world and synthetic datasets. The experiments show that the presented design is scalable and achieves significant speed-up compared to the implementations of an existing sequential kD-tree and a recently proposed multidimensional indexing structure, PH-tree.","lang":"eng"}],"publication":"Theoretical Computer Science","doi":"10.1016/j.tcs.2021.06.041","type":"journal_article","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","title":"Concurrent linearizable nearest neighbour search in LockFree-kD-tree","main_file_link":[{"open_access":"1","url":"https://publications.lib.chalmers.se/records/fulltext/232185/232185.pdf"}]}]