[{"year":"2022","citation":{"chicago":"Protte, Marius, Rene Fahr, and Daniel E. Quevedo. “Behavioral Economics for Human-in-the-Loop Control Systems Design: Overconfidence and the Hot Hand Fallacy.” <i>IEEE Control Systems</i> 40, no. 6 (2022): 57–76. <a href=\"https://doi.org/10.1109/mcs.2020.3019723\">https://doi.org/10.1109/mcs.2020.3019723</a>.","ieee":"M. Protte, R. Fahr, and D. E. Quevedo, “Behavioral Economics for Human-in-the-Loop Control Systems Design: Overconfidence and the Hot Hand Fallacy,” <i>IEEE Control Systems</i>, vol. 40, no. 6, pp. 57–76, 2022, doi: <a href=\"https://doi.org/10.1109/mcs.2020.3019723\">10.1109/mcs.2020.3019723</a>.","ama":"Protte M, Fahr R, Quevedo DE. Behavioral Economics for Human-in-the-Loop Control Systems Design: Overconfidence and the Hot Hand Fallacy. <i>IEEE Control Systems</i>. 2022;40(6):57-76. doi:<a href=\"https://doi.org/10.1109/mcs.2020.3019723\">10.1109/mcs.2020.3019723</a>","mla":"Protte, Marius, et al. “Behavioral Economics for Human-in-the-Loop Control Systems Design: Overconfidence and the Hot Hand Fallacy.” <i>IEEE Control Systems</i>, vol. 40, no. 6, Institute of Electrical and Electronics Engineers (IEEE), 2022, pp. 57–76, doi:<a href=\"https://doi.org/10.1109/mcs.2020.3019723\">10.1109/mcs.2020.3019723</a>.","short":"M. Protte, R. Fahr, D.E. Quevedo, IEEE Control Systems 40 (2022) 57–76.","bibtex":"@article{Protte_Fahr_Quevedo_2022, title={Behavioral Economics for Human-in-the-Loop Control Systems Design: Overconfidence and the Hot Hand Fallacy}, volume={40}, DOI={<a href=\"https://doi.org/10.1109/mcs.2020.3019723\">10.1109/mcs.2020.3019723</a>}, number={6}, journal={IEEE Control Systems}, publisher={Institute of Electrical and Electronics Engineers (IEEE)}, author={Protte, Marius and Fahr, Rene and Quevedo, Daniel E.}, year={2022}, pages={57–76} }","apa":"Protte, M., Fahr, R., &#38; Quevedo, D. E. (2022). Behavioral Economics for Human-in-the-Loop Control Systems Design: Overconfidence and the Hot Hand Fallacy. <i>IEEE Control Systems</i>, <i>40</i>(6), 57–76. <a href=\"https://doi.org/10.1109/mcs.2020.3019723\">https://doi.org/10.1109/mcs.2020.3019723</a>"},"intvolume":"        40","page":"57-76","publication_status":"published","publication_identifier":{"issn":["1066-033X","1941-000X"]},"issue":"6","title":"Behavioral Economics for Human-in-the-Loop Control Systems Design: Overconfidence and the Hot Hand Fallacy","doi":"10.1109/mcs.2020.3019723","date_updated":"2023-01-09T16:47:00Z","publisher":"Institute of Electrical and Electronics Engineers (IEEE)","date_created":"2023-01-09T16:46:46Z","author":[{"last_name":"Protte","full_name":"Protte, Marius","first_name":"Marius"},{"last_name":"Fahr","full_name":"Fahr, Rene","first_name":"Rene"},{"last_name":"Quevedo","full_name":"Quevedo, Daniel E.","first_name":"Daniel E."}],"volume":40,"status":"public","type":"journal_article","publication":"IEEE Control Systems","keyword":["Electrical and Electronic Engineering","Modeling and Simulation","Control and Systems Engineering","Electrical and Electronic Engineering","Modeling and Simulation","Control and Systems Engineering"],"language":[{"iso":"eng"}],"_id":"35586","user_id":"158","department":[{"_id":"57"}]},{"issue":"1","year":"2022","date_created":"2022-12-22T09:19:43Z","publisher":"International Press of Boston","title":"Regularity of Lie groups","publication":"Communications in Analysis and Geometry","language":[{"iso":"eng"}],"keyword":["regularity of Lie groups"],"publication_identifier":{"issn":["1019-8385","1944-9992"]},"publication_status":"published","page":"53-152","intvolume":"        30","citation":{"apa":"Hanusch, M. (2022). Regularity of Lie groups. <i>Communications in Analysis and Geometry</i>, <i>30</i>(1), 53–152. <a href=\"https://doi.org/10.4310/cag.2022.v30.n1.a2\">https://doi.org/10.4310/cag.2022.v30.n1.a2</a>","short":"M. Hanusch, Communications in Analysis and Geometry 30 (2022) 53–152.","bibtex":"@article{Hanusch_2022, title={Regularity of Lie groups}, volume={30}, DOI={<a href=\"https://doi.org/10.4310/cag.2022.v30.n1.a2\">10.4310/cag.2022.v30.n1.a2</a>}, number={1}, journal={Communications in Analysis and Geometry}, publisher={International Press of Boston}, author={Hanusch, Maximilian}, year={2022}, pages={53–152} }","mla":"Hanusch, Maximilian. “Regularity of Lie Groups.” <i>Communications in Analysis and Geometry</i>, vol. 30, no. 1, International Press of Boston, 2022, pp. 53–152, doi:<a href=\"https://doi.org/10.4310/cag.2022.v30.n1.a2\">10.4310/cag.2022.v30.n1.a2</a>.","chicago":"Hanusch, Maximilian. “Regularity of Lie Groups.” <i>Communications in Analysis and Geometry</i> 30, no. 1 (2022): 53–152. <a href=\"https://doi.org/10.4310/cag.2022.v30.n1.a2\">https://doi.org/10.4310/cag.2022.v30.n1.a2</a>.","ieee":"M. Hanusch, “Regularity of Lie groups,” <i>Communications in Analysis and Geometry</i>, vol. 30, no. 1, pp. 53–152, 2022, doi: <a href=\"https://doi.org/10.4310/cag.2022.v30.n1.a2\">10.4310/cag.2022.v30.n1.a2</a>.","ama":"Hanusch M. Regularity of Lie groups. <i>Communications in Analysis and Geometry</i>. 2022;30(1):53-152. doi:<a href=\"https://doi.org/10.4310/cag.2022.v30.n1.a2\">10.4310/cag.2022.v30.n1.a2</a>"},"volume":30,"author":[{"id":"30905","full_name":"Hanusch, Maximilian","last_name":"Hanusch","first_name":"Maximilian"}],"date_updated":"2023-01-09T18:07:30Z","doi":"10.4310/cag.2022.v30.n1.a2","type":"journal_article","status":"public","department":[{"_id":"93"}],"user_id":"30905","_id":"34817","extern":"1","article_type":"original"},{"language":[{"iso":"ger"}],"user_id":"30905","department":[{"_id":"93"}],"_id":"34856","status":"public","type":"working_paper","title":"Analysis 1 und 2 Skript/Buch","author":[{"last_name":"Hanusch","full_name":"Hanusch, Maximilian","id":"30905","first_name":"Maximilian"}],"date_created":"2022-12-22T17:06:02Z","date_updated":"2023-01-09T18:07:00Z","publisher":"https://maximilianhanusch.wixsite.com/my-site/lehre-teaching","citation":{"ama":"Hanusch M. <i>Analysis 1 und 2 Skript/Buch</i>. https://maximilianhanusch.wixsite.com/my-site/lehre-teaching","chicago":"Hanusch, Maximilian. <i>Analysis 1 und 2 Skript/Buch</i>. https://maximilianhanusch.wixsite.com/my-site/lehre-teaching, n.d.","ieee":"M. Hanusch, <i>Analysis 1 und 2 Skript/Buch</i>. https://maximilianhanusch.wixsite.com/my-site/lehre-teaching.","apa":"Hanusch, M. (n.d.). <i>Analysis 1 und 2 Skript/Buch</i>. https://maximilianhanusch.wixsite.com/my-site/lehre-teaching.","mla":"Hanusch, Maximilian. <i>Analysis 1 und 2 Skript/Buch</i>. https://maximilianhanusch.wixsite.com/my-site/lehre-teaching.","short":"M. Hanusch, Analysis 1 und 2 Skript/Buch, https://maximilianhanusch.wixsite.com/my-site/lehre-teaching, n.d.","bibtex":"@book{Hanusch, title={Analysis 1 und 2 Skript/Buch}, publisher={https://maximilianhanusch.wixsite.com/my-site/lehre-teaching}, author={Hanusch, Maximilian} }"},"page":"385","year":"2022","publication_status":"draft"},{"issue":"4","publication_status":"published","citation":{"mla":"Kolb, Martin, and Alexander Klump. “Uniqueness of the Inverse First Passage Time Problem and the Shape of the Shiryaev Boundary.” <i>Theory of Probability and Its Applications</i>, vol. 67, no. 4, Society for Industrial and Applied Mathematics, 2022, pp. 717–44.","short":"M. Kolb, A. Klump, Theory of Probability and Its Applications 67 (2022) 717–744.","bibtex":"@article{Kolb_Klump_2022, title={Uniqueness of the Inverse First Passage Time Problem and the Shape of the Shiryaev boundary}, volume={67}, number={4}, journal={Theory of Probability and its Applications}, publisher={Society for Industrial and Applied Mathematics}, author={Kolb, Martin and Klump, Alexander}, year={2022}, pages={717–744} }","apa":"Kolb, M., &#38; Klump, A. (2022). Uniqueness of the Inverse First Passage Time Problem and the Shape of the Shiryaev boundary. <i>Theory of Probability and Its Applications</i>, <i>67</i>(4), 717–744.","ama":"Kolb M, Klump A. Uniqueness of the Inverse First Passage Time Problem and the Shape of the Shiryaev boundary. <i>Theory of Probability and its Applications</i>. 2022;67(4):717-744.","chicago":"Kolb, Martin, and Alexander Klump. “Uniqueness of the Inverse First Passage Time Problem and the Shape of the Shiryaev Boundary.” <i>Theory of Probability and Its Applications</i> 67, no. 4 (2022): 717–44.","ieee":"M. Kolb and A. Klump, “Uniqueness of the Inverse First Passage Time Problem and the Shape of the Shiryaev boundary,” <i>Theory of Probability and its Applications</i>, vol. 67, no. 4, pp. 717–744, 2022."},"intvolume":"        67","page":"717-744","year":"2022","author":[{"full_name":"Kolb, Martin","id":"48880","last_name":"Kolb","first_name":"Martin"},{"full_name":"Klump, Alexander","id":"45067","last_name":"Klump","first_name":"Alexander"}],"date_created":"2023-01-10T08:13:17Z","volume":67,"date_updated":"2023-01-10T08:13:30Z","publisher":"Society for Industrial and Applied Mathematics","title":"Uniqueness of the Inverse First Passage Time Problem and the Shape of the Shiryaev boundary","type":"journal_article","publication":"Theory of Probability and its Applications","status":"public","user_id":"85821","department":[{"_id":"96"}],"_id":"35644","language":[{"iso":"eng"}]},{"year":"2022","citation":{"ieee":"M. Kolb and M. Liesenfeld, “On non-extinction in a Fleming-Viot-type particle model with Bessel drift,” <i>Electronic Journal of Probability</i>, no. 27, pp. 1–28, 2022, doi: <a href=\"https://doi.org/10.1214/22-EJP866\">https://doi.org/10.1214/22-EJP866</a>.","chicago":"Kolb, Martin, and Matthias Liesenfeld. “On Non-Extinction in a Fleming-Viot-Type Particle Model with Bessel Drift.” <i>Electronic Journal of Probability</i>, no. 27 (2022): 1–28. <a href=\"https://doi.org/10.1214/22-EJP866\">https://doi.org/10.1214/22-EJP866</a>.","ama":"Kolb M, Liesenfeld M. On non-extinction in a Fleming-Viot-type particle model with Bessel drift. <i>Electronic Journal of Probability</i>. 2022;(27):1-28. doi:<a href=\"https://doi.org/10.1214/22-EJP866\">https://doi.org/10.1214/22-EJP866</a>","short":"M. Kolb, M. Liesenfeld, Electronic Journal of Probability (2022) 1–28.","bibtex":"@article{Kolb_Liesenfeld_2022, title={On non-extinction in a Fleming-Viot-type particle model with Bessel drift}, DOI={<a href=\"https://doi.org/10.1214/22-EJP866\">https://doi.org/10.1214/22-EJP866</a>}, number={27}, journal={Electronic Journal of Probability}, publisher={Institute of Mathematical Statistics}, author={Kolb, Martin and Liesenfeld, Matthias}, year={2022}, pages={1–28} }","mla":"Kolb, Martin, and Matthias Liesenfeld. “On Non-Extinction in a Fleming-Viot-Type Particle Model with Bessel Drift.” <i>Electronic Journal of Probability</i>, no. 27, Institute of Mathematical Statistics, 2022, pp. 1–28, doi:<a href=\"https://doi.org/10.1214/22-EJP866\">https://doi.org/10.1214/22-EJP866</a>.","apa":"Kolb, M., &#38; Liesenfeld, M. (2022). On non-extinction in a Fleming-Viot-type particle model with Bessel drift. <i>Electronic Journal of Probability</i>, <i>27</i>, 1–28. <a href=\"https://doi.org/10.1214/22-EJP866\">https://doi.org/10.1214/22-EJP866</a>"},"page":"1-28","publication_status":"published","issue":"27","title":"On non-extinction in a Fleming-Viot-type particle model with Bessel drift","doi":"https://doi.org/10.1214/22-EJP866","date_updated":"2023-01-10T08:19:38Z","publisher":"Institute of Mathematical Statistics","date_created":"2023-01-10T08:19:25Z","author":[{"last_name":"Kolb","full_name":"Kolb, Martin","id":"48880","first_name":"Martin"},{"first_name":"Matthias","last_name":"Liesenfeld","full_name":"Liesenfeld, Matthias"}],"abstract":[{"text":"Motivated by the work [6] of Mariusz Bieniek, Krzysztof Burdzy and Soumik Pal we study a Fleming-Viot-type particle system consisting of independently moving particles each driven by generalized Bessel processes on the positive real line. Upon hitting the boundary {0} this particle is killed and an uniformly chosen different one branches into two particles. Using the symmetry of the model and the self similarity property of Bessel processes, we obtain a criterion to decide whether the particles converge to the origin at a finite time. This addresses open problem 1.4 in [6]. Specifically, inspired by [6, Open Problem 1.5], we investigate the case of three moving particles and refine the general result of [6, Theorem 1.1(ii)] extending the regime of drift parameters, where convergence does not occur – even to values, where it does occur when considering the case of only two particles.","lang":"eng"}],"status":"public","type":"journal_article","publication":"Electronic Journal of Probability","language":[{"iso":"eng"}],"_id":"35649","user_id":"85821","department":[{"_id":"96"}]},{"abstract":[{"lang":"eng","text":"We consider autoregressive sequences Xn = aXn−1 + ξn and\r\nMn = max{aMn−1 , ξn} with a constant a ∈ (0, 1) and with positive, in-\r\ndependent and identically distributed innovations {ξk }. It is known that if\r\nP(ξ1 > x) ∼ d\r\nlog x with some d ∈ (0, − log a) then the chains {Xn} and {Mn}\r\nare null recurrent. We investigate the tail behaviour of recurrence times in this\r\ncase of logarithmically decaying tails. More precisely, we show that the tails\r\nof recurrence times are regularly varying of index −1 − d/ log a. We also prove\r\nlimit theorems for {Xn} and {Mn} conditioned to stay over a fixed level x0.\r\nFurthermore, we study tail asymptotics for recurrence times of {Xn} and {Mn}\r\nin the case when these chains are positive recurrent and the tail of log ξ1 is\r\nsubexponential."}],"status":"public","publication":"Electronic Journal of Probability","type":"journal_article","language":[{"iso":"eng"}],"_id":"35650","department":[{"_id":"96"}],"user_id":"85821","year":"2022","page":"1-43","intvolume":"        27","citation":{"apa":"Denisov, D., Hinrichs, G., Kolb, M., &#38; Wachtel, V. (2022). Persistence of autoregressive sequences with logarithmic tails. <i>Electronic Journal of Probability</i>, <i>27</i>, 1–43. <a href=\"https://doi.org/10.48550/arXiv.2203.14772\">https://doi.org/10.48550/arXiv.2203.14772</a>","bibtex":"@article{Denisov_Hinrichs_Kolb_Wachtel_2022, title={Persistence of autoregressive sequences with logarithmic tails}, volume={27}, DOI={<a href=\"https://doi.org/10.48550/arXiv.2203.14772\">https://doi.org/10.48550/arXiv.2203.14772</a>}, journal={Electronic Journal of Probability}, publisher={Institute of Mathematical Statistics}, author={Denisov, Denis and Hinrichs, Günter and Kolb, Martin and Wachtel, Vitali}, year={2022}, pages={1–43} }","mla":"Denisov, Denis, et al. “Persistence of Autoregressive Sequences with Logarithmic Tails.” <i>Electronic Journal of Probability</i>, vol. 27, Institute of Mathematical Statistics, 2022, pp. 1–43, doi:<a href=\"https://doi.org/10.48550/arXiv.2203.14772\">https://doi.org/10.48550/arXiv.2203.14772</a>.","short":"D. Denisov, G. Hinrichs, M. Kolb, V. Wachtel, Electronic Journal of Probability 27 (2022) 1–43.","chicago":"Denisov, Denis, Günter Hinrichs, Martin Kolb, and Vitali Wachtel. “Persistence of Autoregressive Sequences with Logarithmic Tails.” <i>Electronic Journal of Probability</i> 27 (2022): 1–43. <a href=\"https://doi.org/10.48550/arXiv.2203.14772\">https://doi.org/10.48550/arXiv.2203.14772</a>.","ieee":"D. Denisov, G. Hinrichs, M. Kolb, and V. Wachtel, “Persistence of autoregressive sequences with logarithmic tails,” <i>Electronic Journal of Probability</i>, vol. 27, pp. 1–43, 2022, doi: <a href=\"https://doi.org/10.48550/arXiv.2203.14772\">https://doi.org/10.48550/arXiv.2203.14772</a>.","ama":"Denisov D, Hinrichs G, Kolb M, Wachtel V. Persistence of autoregressive sequences with logarithmic tails. <i>Electronic Journal of Probability</i>. 2022;27:1-43. doi:<a href=\"https://doi.org/10.48550/arXiv.2203.14772\">https://doi.org/10.48550/arXiv.2203.14772</a>"},"publication_status":"published","title":"Persistence of autoregressive sequences with logarithmic tails","doi":"https://doi.org/10.48550/arXiv.2203.14772","date_updated":"2023-01-10T08:29:02Z","publisher":"Institute of Mathematical Statistics","volume":27,"date_created":"2023-01-10T08:28:12Z","author":[{"last_name":"Denisov","full_name":"Denisov, Denis","first_name":"Denis"},{"first_name":"Günter","last_name":"Hinrichs","full_name":"Hinrichs, Günter"},{"full_name":"Kolb, Martin","id":"48880","last_name":"Kolb","first_name":"Martin"},{"first_name":"Vitali","full_name":"Wachtel, Vitali","last_name":"Wachtel"}]},{"type":"bachelorsthesis","status":"public","department":[{"_id":"34"},{"_id":"64"}],"user_id":"41047","_id":"34962","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"name":"SFB 901 - C1: SFB 901 - Subproject C1","_id":"13"}],"language":[{"iso":"eng"}],"citation":{"ama":"Anonymous A. <i>Evaluating Database Systems Relying on Secure Multiparty Computation</i>.; 2022.","ieee":"A. Anonymous, <i>Evaluating database systems relying on secure multiparty computation</i>. 2022.","chicago":"Anonymous, A. <i>Evaluating Database Systems Relying on Secure Multiparty Computation</i>, 2022.","short":"A. Anonymous, Evaluating Database Systems Relying on Secure Multiparty Computation, 2022.","mla":"Anonymous, A. <i>Evaluating Database Systems Relying on Secure Multiparty Computation</i>. 2022.","bibtex":"@book{Anonymous_2022, title={Evaluating database systems relying on secure multiparty computation}, author={Anonymous, A}, year={2022} }","apa":"Anonymous, A. (2022). <i>Evaluating database systems relying on secure multiparty computation</i>."},"year":"2022","supervisor":[{"first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes","id":"23"}],"author":[{"full_name":"Anonymous, A","last_name":"Anonymous","first_name":"A"}],"date_created":"2022-12-24T00:14:34Z","date_updated":"2023-01-10T10:31:35Z","title":"Evaluating database systems relying on secure multiparty computation"},{"department":[{"_id":"34"},{"_id":"64"}],"user_id":"41047","_id":"34963","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"_id":"13","name":"SFB 901 - C1: SFB 901 - Subproject C1"}],"language":[{"iso":"eng"}],"type":"mastersthesis","status":"public","date_created":"2022-12-24T00:16:39Z","author":[{"first_name":"A","last_name":"Anonymous","full_name":"Anonymous, A"}],"supervisor":[{"full_name":"Blömer, Johannes","id":"23","last_name":"Blömer","first_name":"Johannes"}],"date_updated":"2023-01-10T10:31:49Z","title":"Cost of Privacy-preserving SMPC Protocols for NN-Based Inference","citation":{"bibtex":"@book{Anonymous_2022, title={Cost of Privacy-preserving SMPC Protocols for NN-Based Inference}, author={Anonymous, A}, year={2022} }","short":"A. Anonymous, Cost of Privacy-Preserving SMPC Protocols for NN-Based Inference, 2022.","mla":"Anonymous, A. <i>Cost of Privacy-Preserving SMPC Protocols for NN-Based Inference</i>. 2022.","apa":"Anonymous, A. (2022). <i>Cost of Privacy-preserving SMPC Protocols for NN-Based Inference</i>.","chicago":"Anonymous, A. <i>Cost of Privacy-Preserving SMPC Protocols for NN-Based Inference</i>, 2022.","ieee":"A. Anonymous, <i>Cost of Privacy-preserving SMPC Protocols for NN-Based Inference</i>. 2022.","ama":"Anonymous A. <i>Cost of Privacy-Preserving SMPC Protocols for NN-Based Inference</i>.; 2022."},"year":"2022"},{"year":"2022","citation":{"apa":"Lohse, J. (2022). <i>Lattice Revocation Mechanisms</i>.","mla":"Lohse, Jan. <i>Lattice Revocation Mechanisms</i>. 2022.","short":"J. Lohse, Lattice Revocation Mechanisms, 2022.","bibtex":"@book{Lohse_2022, title={Lattice Revocation Mechanisms}, author={Lohse, Jan}, year={2022} }","ama":"Lohse J. <i>Lattice Revocation Mechanisms</i>.; 2022.","ieee":"J. Lohse, <i>Lattice Revocation Mechanisms</i>. 2022.","chicago":"Lohse, Jan. <i>Lattice Revocation Mechanisms</i>, 2022."},"title":"Lattice Revocation Mechanisms","date_updated":"2023-01-10T11:54:43Z","date_created":"2023-01-10T10:39:27Z","supervisor":[{"first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes"}],"author":[{"first_name":"Jan","full_name":"Lohse, Jan","last_name":"Lohse"}],"status":"public","type":"bachelorsthesis","language":[{"iso":"eng"}],"_id":"35772","user_id":"47434","department":[{"_id":"64"}]},{"status":"public","type":"report","language":[{"iso":"ger"}],"ddc":["004"],"department":[{"_id":"34"},{"_id":"7"},{"_id":"534"}],"user_id":"40795","_id":"36227","citation":{"apa":"Hammer, B., Hüllermeier, E., Lohweg, V., Schneider, A., Schenck, W., Kuhl, U., Braun, M., Pfeifer, A., Holst, C.-A., Schmidt, M., Schomaker, G., &#38; Tornede, T. (2022). <i>Schlussbericht ITS.ML: Intelligente Technische Systeme der nächsten Generation durch Maschinelles Lernen. Forschungsvorhaben zur automatisierten Analyse von Daten mittels Maschinellen Lernens</i>. <a href=\"https://doi.org/10.4119/unibi/2965622\">https://doi.org/10.4119/unibi/2965622</a>","ama":"Hammer B, Hüllermeier E, Lohweg V, et al. <i>Schlussbericht ITS.ML: Intelligente Technische Systeme der nächsten Generation durch Maschinelles Lernen. Forschungsvorhaben zur automatisierten Analyse von Daten mittels Maschinellen Lernens</i>.; 2022. doi:<a href=\"https://doi.org/10.4119/unibi/2965622\">10.4119/unibi/2965622</a>","bibtex":"@book{Hammer_Hüllermeier_Lohweg_Schneider_Schenck_Kuhl_Braun_Pfeifer_Holst_Schmidt_et al._2022, title={Schlussbericht ITS.ML: Intelligente Technische Systeme der nächsten Generation durch Maschinelles Lernen. Forschungsvorhaben zur automatisierten Analyse von Daten mittels Maschinellen Lernens}, DOI={<a href=\"https://doi.org/10.4119/unibi/2965622\">10.4119/unibi/2965622</a>}, author={Hammer, Barbara and Hüllermeier, Eyke and Lohweg, Volker and Schneider, Alexander and Schenck, Wolfram and Kuhl, Ulrike and Braun, Marco and Pfeifer, Anton and Holst, Christoph-Alexander and Schmidt, Malte and et al.}, year={2022} }","mla":"Hammer, Barbara, et al. <i>Schlussbericht ITS.ML: Intelligente Technische Systeme der nächsten Generation durch Maschinelles Lernen. Forschungsvorhaben zur automatisierten Analyse von Daten mittels Maschinellen Lernens</i>. 2022, doi:<a href=\"https://doi.org/10.4119/unibi/2965622\">10.4119/unibi/2965622</a>.","short":"B. Hammer, E. Hüllermeier, V. Lohweg, A. Schneider, W. Schenck, U. Kuhl, M. Braun, A. Pfeifer, C.-A. Holst, M. Schmidt, G. Schomaker, T. Tornede, Schlussbericht ITS.ML: Intelligente Technische Systeme der nächsten Generation durch Maschinelles Lernen. Forschungsvorhaben zur automatisierten Analyse von Daten mittels Maschinellen Lernens, 2022.","ieee":"B. Hammer <i>et al.</i>, <i>Schlussbericht ITS.ML: Intelligente Technische Systeme der nächsten Generation durch Maschinelles Lernen. Forschungsvorhaben zur automatisierten Analyse von Daten mittels Maschinellen Lernens</i>. 2022.","chicago":"Hammer, Barbara, Eyke Hüllermeier, Volker Lohweg, Alexander Schneider, Wolfram Schenck, Ulrike Kuhl, Marco Braun, et al. <i>Schlussbericht ITS.ML: Intelligente Technische Systeme der nächsten Generation durch Maschinelles Lernen. Forschungsvorhaben zur automatisierten Analyse von Daten mittels Maschinellen Lernens</i>, 2022. <a href=\"https://doi.org/10.4119/unibi/2965622\">https://doi.org/10.4119/unibi/2965622</a>."},"year":"2022","has_accepted_license":"1","doi":"10.4119/unibi/2965622","title":"Schlussbericht ITS.ML: Intelligente Technische Systeme der nächsten Generation durch Maschinelles Lernen. Forschungsvorhaben zur automatisierten Analyse von Daten mittels Maschinellen Lernens","date_created":"2023-01-11T15:00:00Z","author":[{"first_name":"Barbara","full_name":"Hammer, Barbara","last_name":"Hammer"},{"first_name":"Eyke","last_name":"Hüllermeier","id":"48129","full_name":"Hüllermeier, Eyke"},{"first_name":"Volker","last_name":"Lohweg","full_name":"Lohweg, Volker"},{"first_name":"Alexander","last_name":"Schneider","full_name":"Schneider, Alexander"},{"first_name":"Wolfram","last_name":"Schenck","full_name":"Schenck, Wolfram"},{"first_name":"Ulrike","full_name":"Kuhl, Ulrike","last_name":"Kuhl"},{"full_name":"Braun, Marco","last_name":"Braun","first_name":"Marco"},{"first_name":"Anton","last_name":"Pfeifer","full_name":"Pfeifer, Anton"},{"full_name":"Holst, Christoph-Alexander","last_name":"Holst","first_name":"Christoph-Alexander"},{"full_name":"Schmidt, Malte","last_name":"Schmidt","first_name":"Malte"},{"full_name":"Schomaker, Gunnar","last_name":"Schomaker","first_name":"Gunnar"},{"first_name":"Tanja","id":"40795","full_name":"Tornede, Tanja","last_name":"Tornede"}],"date_updated":"2023-01-11T15:20:40Z"},{"abstract":[{"text":"We review our results of numerical simulations of light scattering from different systems of densely packed irregular particles. We consider spherical clusters, thick layers and monolayers with realistic topologies and dimensions much larger than the wavelength of light. The maximum bulk packing density of clusters is 0.5. A numerically exact solution of the electromagnetic problem is obtained using the Discontinuous Galerkin Time Domain method and with application of high- performance computing. We show that high packing density causes light localization in such structures which makes an impact on the opposition phenomena: backscattering intensity surge and negative linear polarization feature. Diffuse multiple scattering is significantly reduced in the case of non-absorbing particles and near-field interaction results in a percolation-like light transport determined by the topology of the medium. With this the negative polarization feature caused by single scattering gets enhanced if compared to lower density samples. We also confirm coherent double scattering mechanism of negative polarization for light scattered from dense absorbing slabs. In this case convergent result for the scattering angle polarization dependency at backscattering can be obtained for a layer of just a few tens of particles if they are larger than the wavelength.","lang":"eng"}],"file":[{"access_level":"local","file_name":"2022-09 Grynko - Book chapter on Light Scattering by Large Densely Packed Clusters of Particles.pdf","file_id":"33467","file_size":1525307,"date_created":"2022-09-22T09:24:45Z","creator":"fossie","date_updated":"2022-09-22T09:24:45Z","relation":"main_file","content_type":"application/pdf"}],"publication":"Springer Series in Light Scattering - Volume 8: Light Polarization and Multiple Scattering in Turbid Media","ddc":["530"],"keyword":["tet_topic_scattering"],"language":[{"iso":"eng"}],"year":"2022","title":"Light Scattering by Large Densely Packed Clusters of Particles","publisher":"Springer International Publishing","date_created":"2022-09-22T09:18:45Z","editor":[{"first_name":"Alexander","last_name":"Kokhanovsky","full_name":"Kokhanovsky, Alexander"}],"status":"public","type":"book_chapter","file_date_updated":"2022-09-22T09:24:45Z","project":[{"_id":"52","name":"PC2: Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"_id":"33466","series_title":"Springer Series in Light Scattering","user_id":"158","department":[{"_id":"61"},{"_id":"230"},{"_id":"429"}],"place":"Cham","citation":{"ama":"Grynko Y, Shkuratov Y, Alhaddad S, Förstner J. Light Scattering by Large Densely Packed Clusters of Particles. In: Kokhanovsky A, ed. <i>Springer Series in Light Scattering - Volume 8: Light Polarization and Multiple Scattering in Turbid Media</i>. Vol 8. Springer Series in Light Scattering. Springer International Publishing; 2022. doi:<a href=\"https://doi.org/10.1007/978-3-031-10298-1_4\">10.1007/978-3-031-10298-1_4</a>","chicago":"Grynko, Yevgen, Yuriy Shkuratov, Samer Alhaddad, and Jens Förstner. “Light Scattering by Large Densely Packed Clusters of Particles.” In <i>Springer Series in Light Scattering - Volume 8: Light Polarization and Multiple Scattering in Turbid Media</i>, edited by Alexander Kokhanovsky, Vol. 8. Springer Series in Light Scattering. Cham: Springer International Publishing, 2022. <a href=\"https://doi.org/10.1007/978-3-031-10298-1_4\">https://doi.org/10.1007/978-3-031-10298-1_4</a>.","ieee":"Y. Grynko, Y. Shkuratov, S. Alhaddad, and J. Förstner, “Light Scattering by Large Densely Packed Clusters of Particles,” in <i>Springer Series in Light Scattering - Volume 8: Light Polarization and Multiple Scattering in Turbid Media</i>, vol. 8, A. Kokhanovsky, Ed. Cham: Springer International Publishing, 2022.","short":"Y. Grynko, Y. Shkuratov, S. Alhaddad, J. Förstner, in: A. Kokhanovsky (Ed.), Springer Series in Light Scattering - Volume 8: Light Polarization and Multiple Scattering in Turbid Media, Springer International Publishing, Cham, 2022.","bibtex":"@inbook{Grynko_Shkuratov_Alhaddad_Förstner_2022, place={Cham}, series={Springer Series in Light Scattering}, title={Light Scattering by Large Densely Packed Clusters of Particles}, volume={8}, DOI={<a href=\"https://doi.org/10.1007/978-3-031-10298-1_4\">10.1007/978-3-031-10298-1_4</a>}, booktitle={Springer Series in Light Scattering - Volume 8: Light Polarization and Multiple Scattering in Turbid Media}, publisher={Springer International Publishing}, author={Grynko, Yevgen and Shkuratov, Yuriy and Alhaddad, Samer and Förstner, Jens}, editor={Kokhanovsky, Alexander}, year={2022}, collection={Springer Series in Light Scattering} }","mla":"Grynko, Yevgen, et al. “Light Scattering by Large Densely Packed Clusters of Particles.” <i>Springer Series in Light Scattering - Volume 8: Light Polarization and Multiple Scattering in Turbid Media</i>, edited by Alexander Kokhanovsky, vol. 8, Springer International Publishing, 2022, doi:<a href=\"https://doi.org/10.1007/978-3-031-10298-1_4\">10.1007/978-3-031-10298-1_4</a>.","apa":"Grynko, Y., Shkuratov, Y., Alhaddad, S., &#38; Förstner, J. (2022). Light Scattering by Large Densely Packed Clusters of Particles. In A. Kokhanovsky (Ed.), <i>Springer Series in Light Scattering - Volume 8: Light Polarization and Multiple Scattering in Turbid Media</i> (Vol. 8). Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-031-10298-1_4\">https://doi.org/10.1007/978-3-031-10298-1_4</a>"},"intvolume":"         8","publication_status":"published","publication_identifier":{"issn":["2509-2790","2509-2804"],"isbn":["9783031102974","9783031102981"]},"has_accepted_license":"1","main_file_link":[{"open_access":"1","url":"https://rdcu.be/cV5GC"}],"doi":"10.1007/978-3-031-10298-1_4","date_updated":"2023-01-11T15:28:17Z","oa":"1","author":[{"first_name":"Yevgen","last_name":"Grynko","id":"26059","full_name":"Grynko, Yevgen"},{"full_name":"Shkuratov, Yuriy","last_name":"Shkuratov","first_name":"Yuriy"},{"first_name":"Samer","last_name":"Alhaddad","full_name":"Alhaddad, Samer","id":"42456"},{"orcid":"0000-0001-7059-9862","last_name":"Förstner","full_name":"Förstner, Jens","id":"158","first_name":"Jens"}],"volume":8},{"year":"2022","place":"Wiesbaden","citation":{"ama":"Hoffmann M, Biehler R. Schnittstellenaufgaben in der Analysis I zur Verknüpfung von Schul- und Hochschulmathematik - Aufgabenbeispiele und Ergebnisse einer Evaluationsstudie. In: Halverscheid S, Kersten I, Schmidt-Thieme B, eds. <i> Bedarfsgerechte fachmathematische Lehramtsausbildung. Analyse, Zielsetzungen und Konzepte unter heterogenen Voraussetzungen </i>. Springer Spektrum; 2022:351-368.","chicago":"Hoffmann, Max, and Rolf Biehler. “Schnittstellenaufgaben in der Analysis I zur Verknüpfung von Schul- und Hochschulmathematik - Aufgabenbeispiele und Ergebnisse einer Evaluationsstudie.” In <i> Bedarfsgerechte fachmathematische Lehramtsausbildung. Analyse, Zielsetzungen und Konzepte unter heterogenen Voraussetzungen </i>, edited by Stefan Halverscheid, Ina Kersten, and Barbara Schmidt-Thieme, 351–68. Wiesbaden: Springer Spektrum, 2022.","ieee":"M. Hoffmann and R. Biehler, “Schnittstellenaufgaben in der Analysis I zur Verknüpfung von Schul- und Hochschulmathematik - Aufgabenbeispiele und Ergebnisse einer Evaluationsstudie.,” in <i> Bedarfsgerechte fachmathematische Lehramtsausbildung. Analyse, Zielsetzungen und Konzepte unter heterogenen Voraussetzungen </i>, 2022, pp. 351–368.","bibtex":"@inproceedings{Hoffmann_Biehler_2022, place={Wiesbaden}, title={Schnittstellenaufgaben in der Analysis I zur Verknüpfung von Schul- und Hochschulmathematik - Aufgabenbeispiele und Ergebnisse einer Evaluationsstudie.}, booktitle={ Bedarfsgerechte fachmathematische Lehramtsausbildung. Analyse, Zielsetzungen und Konzepte unter heterogenen Voraussetzungen }, publisher={Springer Spektrum}, author={Hoffmann, Max and Biehler, Rolf}, editor={Halverscheid, Stefan and Kersten, Ina and Schmidt-Thieme, Barbara}, year={2022}, pages={351–368} }","mla":"Hoffmann, Max, and Rolf Biehler. “Schnittstellenaufgaben in der Analysis I zur Verknüpfung von Schul- und Hochschulmathematik - Aufgabenbeispiele und Ergebnisse einer Evaluationsstudie.” <i> Bedarfsgerechte fachmathematische Lehramtsausbildung. Analyse, Zielsetzungen und Konzepte unter heterogenen Voraussetzungen </i>, edited by Stefan Halverscheid et al., Springer Spektrum, 2022, pp. 351–68.","short":"M. Hoffmann, R. Biehler, in: S. Halverscheid, I. Kersten, B. Schmidt-Thieme (Eds.),  Bedarfsgerechte fachmathematische Lehramtsausbildung. Analyse, Zielsetzungen und Konzepte unter heterogenen Voraussetzungen , Springer Spektrum, Wiesbaden, 2022, pp. 351–368.","apa":"Hoffmann, M., &#38; Biehler, R. (2022). Schnittstellenaufgaben in der Analysis I zur Verknüpfung von Schul- und Hochschulmathematik - Aufgabenbeispiele und Ergebnisse einer Evaluationsstudie. In S. Halverscheid, I. Kersten, &#38; B. Schmidt-Thieme (Eds.), <i> Bedarfsgerechte fachmathematische Lehramtsausbildung. Analyse, Zielsetzungen und Konzepte unter heterogenen Voraussetzungen </i> (pp. 351–368). Springer Spektrum."},"page":"351-368","publication_status":"published","quality_controlled":"1","title":"Schnittstellenaufgaben in der Analysis I zur Verknüpfung von Schul- und Hochschulmathematik - Aufgabenbeispiele und Ergebnisse einer Evaluationsstudie.","date_updated":"2023-01-11T15:28:21Z","publisher":"Springer Spektrum","author":[{"full_name":"Hoffmann, Max","id":"32202","orcid":"0000-0002-6964-7123","last_name":"Hoffmann","first_name":"Max"},{"first_name":"Rolf","id":"16274","full_name":"Biehler, Rolf","last_name":"Biehler"}],"date_created":"2022-05-22T14:16:52Z","editor":[{"first_name":"Stefan","last_name":"Halverscheid","full_name":"Halverscheid, Stefan"},{"first_name":"Ina","full_name":"Kersten, Ina","last_name":"Kersten"},{"first_name":"Barbara","full_name":"Schmidt-Thieme, Barbara","last_name":"Schmidt-Thieme"}],"status":"public","type":"conference","publication":" Bedarfsgerechte fachmathematische Lehramtsausbildung. Analyse, Zielsetzungen und Konzepte unter heterogenen Voraussetzungen ","language":[{"iso":"ger"}],"_id":"31367","user_id":"32202","department":[{"_id":"97"}]},{"title":"Fachwissen als Grundlage fachdidaktischer Urteilskompetenz – Beispiele für die Herstellung konzeptueller Bezüge zwischen fachwissenschaftlicher und fachdidaktischer Lehre im gymnasialen Lehramtsstudium","publisher":"Springer","date_created":"2022-05-22T14:03:58Z","year":"2022","quality_controlled":"1","language":[{"iso":"ger"}],"publication":" Professionsorientierte Fachwissenschaft. Kohärenzstiftende Lerngelegenheiten für das Lehramtsstudium Mathematik","main_file_link":[{"url":"https://link.springer.com/chapter/10.1007/978-3-662-63948-1_4"}],"doi":"10.1007/978-3-662-63948-1_4","date_updated":"2023-01-11T15:29:09Z","author":[{"first_name":"Rolf","id":"16274","full_name":"Biehler, Rolf","last_name":"Biehler"},{"orcid":"0000-0002-6964-7123","last_name":"Hoffmann","full_name":"Hoffmann, Max","id":"32202","first_name":"Max"}],"place":"Berlin, Heidelberg","citation":{"apa":"Biehler, R., &#38; Hoffmann, M. (2022). Fachwissen als Grundlage fachdidaktischer Urteilskompetenz – Beispiele für die Herstellung konzeptueller Bezüge zwischen fachwissenschaftlicher und fachdidaktischer Lehre im gymnasialen Lehramtsstudium. In V. Isaev, A. Eichler, &#38; F. Loose (Eds.), <i> Professionsorientierte Fachwissenschaft. Kohärenzstiftende Lerngelegenheiten für das Lehramtsstudium Mathematik</i> (pp. 49–72). Springer. <a href=\"https://doi.org/10.1007/978-3-662-63948-1_4\">https://doi.org/10.1007/978-3-662-63948-1_4</a>","mla":"Biehler, Rolf, and Max Hoffmann. “Fachwissen als Grundlage fachdidaktischer Urteilskompetenz – Beispiele für die Herstellung konzeptueller Bezüge zwischen fachwissenschaftlicher und fachdidaktischer Lehre im gymnasialen Lehramtsstudium.” <i> Professionsorientierte Fachwissenschaft. Kohärenzstiftende Lerngelegenheiten für das Lehramtsstudium Mathematik</i>, edited by Viktor Isaev et al., Springer, 2022, pp. 49–72, doi:<a href=\"https://doi.org/10.1007/978-3-662-63948-1_4\">10.1007/978-3-662-63948-1_4</a>.","bibtex":"@inproceedings{Biehler_Hoffmann_2022, place={Berlin, Heidelberg}, title={Fachwissen als Grundlage fachdidaktischer Urteilskompetenz – Beispiele für die Herstellung konzeptueller Bezüge zwischen fachwissenschaftlicher und fachdidaktischer Lehre im gymnasialen Lehramtsstudium}, DOI={<a href=\"https://doi.org/10.1007/978-3-662-63948-1_4\">10.1007/978-3-662-63948-1_4</a>}, booktitle={ Professionsorientierte Fachwissenschaft. Kohärenzstiftende Lerngelegenheiten für das Lehramtsstudium Mathematik}, publisher={Springer}, author={Biehler, Rolf and Hoffmann, Max}, editor={Isaev, Viktor and Eichler, Andreas and Loose, Frank}, year={2022}, pages={49–72} }","short":"R. Biehler, M. Hoffmann, in: V. Isaev, A. Eichler, F. Loose (Eds.),  Professionsorientierte Fachwissenschaft. Kohärenzstiftende Lerngelegenheiten für das Lehramtsstudium Mathematik, Springer, Berlin, Heidelberg, 2022, pp. 49–72.","ieee":"R. Biehler and M. Hoffmann, “Fachwissen als Grundlage fachdidaktischer Urteilskompetenz – Beispiele für die Herstellung konzeptueller Bezüge zwischen fachwissenschaftlicher und fachdidaktischer Lehre im gymnasialen Lehramtsstudium,” in <i> Professionsorientierte Fachwissenschaft. Kohärenzstiftende Lerngelegenheiten für das Lehramtsstudium Mathematik</i>, 2022, pp. 49–72, doi: <a href=\"https://doi.org/10.1007/978-3-662-63948-1_4\">10.1007/978-3-662-63948-1_4</a>.","chicago":"Biehler, Rolf, and Max Hoffmann. “Fachwissen als Grundlage fachdidaktischer Urteilskompetenz – Beispiele für die Herstellung konzeptueller Bezüge zwischen fachwissenschaftlicher und fachdidaktischer Lehre im gymnasialen Lehramtsstudium.” In <i> Professionsorientierte Fachwissenschaft. Kohärenzstiftende Lerngelegenheiten für das Lehramtsstudium Mathematik</i>, edited by Viktor Isaev, Andreas Eichler, and Frank Loose, 49–72. Berlin, Heidelberg: Springer, 2022. <a href=\"https://doi.org/10.1007/978-3-662-63948-1_4\">https://doi.org/10.1007/978-3-662-63948-1_4</a>.","ama":"Biehler R, Hoffmann M. Fachwissen als Grundlage fachdidaktischer Urteilskompetenz – Beispiele für die Herstellung konzeptueller Bezüge zwischen fachwissenschaftlicher und fachdidaktischer Lehre im gymnasialen Lehramtsstudium. In: Isaev V, Eichler A, Loose F, eds. <i> Professionsorientierte Fachwissenschaft. Kohärenzstiftende Lerngelegenheiten für das Lehramtsstudium Mathematik</i>. Springer; 2022:49–72. doi:<a href=\"https://doi.org/10.1007/978-3-662-63948-1_4\">10.1007/978-3-662-63948-1_4</a>"},"page":" 49–72","publication_status":"published","publication_identifier":{"isbn":["9783662639474","9783662639481"],"issn":["2197-8751","2197-876X"]},"_id":"31365","user_id":"32202","department":[{"_id":"97"}],"editor":[{"first_name":"Viktor","full_name":"Isaev, Viktor","last_name":"Isaev"},{"first_name":"Andreas","last_name":"Eichler","full_name":"Eichler, Andreas"},{"full_name":"Loose, Frank","last_name":"Loose","first_name":"Frank"}],"status":"public","type":"conference"},{"title":"Assessment of Energy Efficiency and Flexibility Measures in Electrified Process Heat Generation Based on Simulations in the Animal Feed Industry","date_updated":"2023-10-02T09:02:05Z","publisher":"17th sdewes conference","author":[{"first_name":"Lukas","last_name":"Knorr","id":"90391","full_name":"Knorr, Lukas"},{"id":"88614","full_name":"Schlosser, Florian","last_name":"Schlosser","first_name":"Florian"},{"orcid":"0000-0002-1538-089X","last_name":"Meschede","id":"86954","full_name":"Meschede, Henning","first_name":"Henning"}],"date_created":"2023-01-11T12:49:28Z","year":"2022","citation":{"chicago":"Knorr, Lukas, Florian Schlosser, and Henning Meschede. <i>Assessment of Energy Efficiency and Flexibility Measures in Electrified Process Heat Generation Based on Simulations in the Animal Feed Industry</i>. 17th sdewes conference, 2022.","ieee":"L. Knorr, F. Schlosser, and H. Meschede, <i>Assessment of Energy Efficiency and Flexibility Measures in Electrified Process Heat Generation Based on Simulations in the Animal Feed Industry</i>. 17th sdewes conference, 2022.","ama":"Knorr L, Schlosser F, Meschede H. <i>Assessment of Energy Efficiency and Flexibility Measures in Electrified Process Heat Generation Based on Simulations in the Animal Feed Industry</i>. 17th sdewes conference; 2022.","apa":"Knorr, L., Schlosser, F., &#38; Meschede, H. (2022). <i>Assessment of Energy Efficiency and Flexibility Measures in Electrified Process Heat Generation Based on Simulations in the Animal Feed Industry</i>. 17th sdewes conference.","mla":"Knorr, Lukas, et al. <i>Assessment of Energy Efficiency and Flexibility Measures in Electrified Process Heat Generation Based on Simulations in the Animal Feed Industry</i>. 17th sdewes conference, 2022.","short":"L. Knorr, F. Schlosser, H. Meschede, Assessment of Energy Efficiency and Flexibility Measures in Electrified Process Heat Generation Based on Simulations in the Animal Feed Industry, 17th sdewes conference, 2022.","bibtex":"@book{Knorr_Schlosser_Meschede_2022, title={Assessment of Energy Efficiency and Flexibility Measures in Electrified Process Heat Generation Based on Simulations in the Animal Feed Industry}, publisher={17th sdewes conference}, author={Knorr, Lukas and Schlosser, Florian and Meschede, Henning}, year={2022} }"},"language":[{"iso":"eng"}],"_id":"36109","user_id":"90391","department":[{"_id":"644"}],"status":"public","type":"misc"},{"author":[{"first_name":"Sevag","last_name":"Gharibian","orcid":"0000-0002-9992-3379","id":"71541","full_name":"Gharibian, Sevag"},{"full_name":"Gall, François Le","last_name":"Gall","first_name":"François Le"}],"date_created":"2021-11-18T07:32:56Z","date_updated":"2023-10-09T04:17:29Z","oa":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2111.09079"}],"title":"Dequantizing the Quantum Singular Value Transformation: Hardness and  Applications to Quantum Chemistry and the Quantum PCP Conjecture","publication_status":"published","citation":{"ieee":"S. Gharibian and F. L. Gall, “Dequantizing the Quantum Singular Value Transformation: Hardness and  Applications to Quantum Chemistry and the Quantum PCP Conjecture,” in <i>Proceedings of the 54th ACM Symposium on Theory of Computing (STOC)</i>, 2022, pp. 19–32.","chicago":"Gharibian, Sevag, and François Le Gall. “Dequantizing the Quantum Singular Value Transformation: Hardness and  Applications to Quantum Chemistry and the Quantum PCP Conjecture.” In <i>Proceedings of the 54th ACM Symposium on Theory of Computing (STOC)</i>, 19–32, 2022.","ama":"Gharibian S, Gall FL. Dequantizing the Quantum Singular Value Transformation: Hardness and  Applications to Quantum Chemistry and the Quantum PCP Conjecture. In: <i>Proceedings of the 54th ACM Symposium on Theory of Computing (STOC)</i>. ; 2022:19-32.","bibtex":"@inproceedings{Gharibian_Gall_2022, title={Dequantizing the Quantum Singular Value Transformation: Hardness and  Applications to Quantum Chemistry and the Quantum PCP Conjecture}, booktitle={Proceedings of the 54th ACM Symposium on Theory of Computing (STOC)}, author={Gharibian, Sevag and Gall, François Le}, year={2022}, pages={19–32} }","short":"S. Gharibian, F.L. Gall, in: Proceedings of the 54th ACM Symposium on Theory of Computing (STOC), 2022, pp. 19–32.","mla":"Gharibian, Sevag, and François Le Gall. “Dequantizing the Quantum Singular Value Transformation: Hardness and  Applications to Quantum Chemistry and the Quantum PCP Conjecture.” <i>Proceedings of the 54th ACM Symposium on Theory of Computing (STOC)</i>, 2022, pp. 19–32.","apa":"Gharibian, S., &#38; Gall, F. L. (2022). Dequantizing the Quantum Singular Value Transformation: Hardness and  Applications to Quantum Chemistry and the Quantum PCP Conjecture. <i>Proceedings of the 54th ACM Symposium on Theory of Computing (STOC)</i>, 19–32."},"page":"19-32","year":"2022","user_id":"71541","department":[{"_id":"623"},{"_id":"7"}],"external_id":{"arxiv":["2111.09079"]},"_id":"27531","language":[{"iso":"eng"}],"type":"conference","publication":"Proceedings of the 54th ACM Symposium on Theory of Computing (STOC)","status":"public","abstract":[{"text":"The Quantum Singular Value Transformation (QSVT) is a recent technique that\r\ngives a unified framework to describe most quantum algorithms discovered so\r\nfar, and may lead to the development of novel quantum algorithms. In this paper\r\nwe investigate the hardness of classically simulating the QSVT. A recent result\r\nby Chia, Gily\\'en, Li, Lin, Tang and Wang (STOC 2020) showed that the QSVT can\r\nbe efficiently \"dequantized\" for low-rank matrices, and discussed its\r\nimplication to quantum machine learning. In this work, motivated by\r\nestablishing the superiority of quantum algorithms for quantum chemistry and\r\nmaking progress on the quantum PCP conjecture, we focus on the other main class\r\nof matrices considered in applications of the QSVT, sparse matrices.\r\n  We first show how to efficiently \"dequantize\", with arbitrarily small\r\nconstant precision, the QSVT associated with a low-degree polynomial. We apply\r\nthis technique to design classical algorithms that estimate, with constant\r\nprecision, the singular values of a sparse matrix. We show in particular that a\r\ncentral computational problem considered by quantum algorithms for quantum\r\nchemistry (estimating the ground state energy of a local Hamiltonian when\r\ngiven, as an additional input, a state sufficiently close to the ground state)\r\ncan be solved efficiently with constant precision on a classical computer. As a\r\ncomplementary result, we prove that with inverse-polynomial precision, the same\r\nproblem becomes BQP-complete. This gives theoretical evidence for the\r\nsuperiority of quantum algorithms for chemistry, and strongly suggests that\r\nsaid superiority stems from the improved precision achievable in the quantum\r\nsetting. We also discuss how this dequantization technique may help make\r\nprogress on the central quantum PCP conjecture.","lang":"eng"}]},{"language":[{"iso":"eng"}],"department":[{"_id":"819"},{"_id":"34"}],"user_id":"15504","_id":"46300","status":"public","editor":[{"first_name":"Gerrit","full_name":"Weitzel, Gerrit","last_name":"Weitzel"},{"first_name":"Stephan","last_name":"Mündges","full_name":"Mündges, Stephan"}],"publication":"Hate Speech — Definitionen, Ausprägungen, Lösungen","type":"book_chapter","doi":"10.1007/978-3-658-35658-3_13","title":"(Semi-)Automatische Kommentarmoderation zur Erhaltung Konstruktiver Diskurse","date_created":"2023-08-04T07:03:47Z","author":[{"first_name":"Marco","full_name":"Niemann, Marco","last_name":"Niemann"},{"full_name":"Assenmacher, Dennis","last_name":"Assenmacher","first_name":"Dennis"},{"first_name":"Jens","full_name":"Brunk, Jens","last_name":"Brunk"},{"first_name":"Dennis Maximilian","full_name":"Riehle, Dennis Maximilian","last_name":"Riehle"},{"first_name":"Jörg","full_name":"Becker, Jörg","last_name":"Becker"},{"id":"100740","full_name":"Trautmann, Heike","orcid":"0000-0002-9788-8282","last_name":"Trautmann","first_name":"Heike"}],"date_updated":"2023-10-16T12:35:41Z","publisher":"VS Verlag für Sozialwissenschaften","page":"249–274","citation":{"mla":"Niemann, Marco, et al. “(Semi-)Automatische Kommentarmoderation Zur Erhaltung Konstruktiver Diskurse.” <i>Hate Speech — Definitionen, Ausprägungen, Lösungen</i>, edited by Gerrit Weitzel and Stephan Mündges, VS Verlag für Sozialwissenschaften, 2022, pp. 249–274, doi:<a href=\"https://doi.org/10.1007/978-3-658-35658-3_13\">10.1007/978-3-658-35658-3_13</a>.","short":"M. Niemann, D. Assenmacher, J. Brunk, D.M. Riehle, J. Becker, H. Trautmann, in: G. Weitzel, S. Mündges (Eds.), Hate Speech — Definitionen, Ausprägungen, Lösungen, VS Verlag für Sozialwissenschaften, Wiesbaden, 2022, pp. 249–274.","bibtex":"@inbook{Niemann_Assenmacher_Brunk_Riehle_Becker_Trautmann_2022, place={Wiesbaden}, title={(Semi-)Automatische Kommentarmoderation zur Erhaltung Konstruktiver Diskurse}, DOI={<a href=\"https://doi.org/10.1007/978-3-658-35658-3_13\">10.1007/978-3-658-35658-3_13</a>}, booktitle={Hate Speech — Definitionen, Ausprägungen, Lösungen}, publisher={VS Verlag für Sozialwissenschaften}, author={Niemann, Marco and Assenmacher, Dennis and Brunk, Jens and Riehle, Dennis Maximilian and Becker, Jörg and Trautmann, Heike}, editor={Weitzel, Gerrit and Mündges, Stephan}, year={2022}, pages={249–274} }","apa":"Niemann, M., Assenmacher, D., Brunk, J., Riehle, D. M., Becker, J., &#38; Trautmann, H. (2022). (Semi-)Automatische Kommentarmoderation zur Erhaltung Konstruktiver Diskurse. In G. Weitzel &#38; S. Mündges (Eds.), <i>Hate Speech — Definitionen, Ausprägungen, Lösungen</i> (pp. 249–274). VS Verlag für Sozialwissenschaften. <a href=\"https://doi.org/10.1007/978-3-658-35658-3_13\">https://doi.org/10.1007/978-3-658-35658-3_13</a>","ieee":"M. Niemann, D. Assenmacher, J. Brunk, D. M. Riehle, J. Becker, and H. Trautmann, “(Semi-)Automatische Kommentarmoderation zur Erhaltung Konstruktiver Diskurse,” in <i>Hate Speech — Definitionen, Ausprägungen, Lösungen</i>, G. Weitzel and S. Mündges, Eds. Wiesbaden: VS Verlag für Sozialwissenschaften, 2022, pp. 249–274.","chicago":"Niemann, Marco, Dennis Assenmacher, Jens Brunk, Dennis Maximilian Riehle, Jörg Becker, and Heike Trautmann. “(Semi-)Automatische Kommentarmoderation Zur Erhaltung Konstruktiver Diskurse.” In <i>Hate Speech — Definitionen, Ausprägungen, Lösungen</i>, edited by Gerrit Weitzel and Stephan Mündges, 249–274. Wiesbaden: VS Verlag für Sozialwissenschaften, 2022. <a href=\"https://doi.org/10.1007/978-3-658-35658-3_13\">https://doi.org/10.1007/978-3-658-35658-3_13</a>.","ama":"Niemann M, Assenmacher D, Brunk J, Riehle DM, Becker J, Trautmann H. (Semi-)Automatische Kommentarmoderation zur Erhaltung Konstruktiver Diskurse. In: Weitzel G, Mündges S, eds. <i>Hate Speech — Definitionen, Ausprägungen, Lösungen</i>. VS Verlag für Sozialwissenschaften; 2022:249–274. doi:<a href=\"https://doi.org/10.1007/978-3-658-35658-3_13\">10.1007/978-3-658-35658-3_13</a>"},"place":"Wiesbaden","year":"2022","publication_identifier":{"isbn":["978-3-658-35658-3"]}},{"_id":"46301","department":[{"_id":"819"},{"_id":"34"}],"user_id":"15504","language":[{"iso":"eng"}],"publication":"Intelligent Information and Database Systems","type":"conference","editor":[{"last_name":"et al. Tran","full_name":"et al. Tran, T","first_name":"T"}],"status":"public","date_updated":"2023-10-16T12:35:22Z","publisher":"Springer International Publishing","date_created":"2023-08-04T07:04:54Z","author":[{"first_name":"D","full_name":"Assenmacher, D","last_name":"Assenmacher"},{"first_name":"Heike","full_name":"Trautmann, Heike","id":"100740","orcid":"0000-0002-9788-8282","last_name":"Trautmann"}],"title":"Textual One-Pass Stream Clustering with Automated Distance Threshold Adaption","doi":"10.1007/978-3-031-21743-2_1","place":"Cham","year":"2022","page":"3–16","citation":{"mla":"Assenmacher, D., and Heike Trautmann. “Textual One-Pass Stream Clustering with Automated Distance Threshold Adaption.” <i>Intelligent Information and Database Systems</i>, edited by T et al. Tran, Springer International Publishing, 2022, pp. 3–16, doi:<a href=\"https://doi.org/10.1007/978-3-031-21743-2_1\">10.1007/978-3-031-21743-2_1</a>.","bibtex":"@inproceedings{Assenmacher_Trautmann_2022, place={Cham}, title={Textual One-Pass Stream Clustering with Automated Distance Threshold Adaption}, DOI={<a href=\"https://doi.org/10.1007/978-3-031-21743-2_1\">10.1007/978-3-031-21743-2_1</a>}, booktitle={Intelligent Information and Database Systems}, publisher={Springer International Publishing}, author={Assenmacher, D and Trautmann, Heike}, editor={et al. Tran, T}, year={2022}, pages={3–16} }","short":"D. Assenmacher, H. Trautmann, in: T. et al. Tran (Ed.), Intelligent Information and Database Systems, Springer International Publishing, Cham, 2022, pp. 3–16.","apa":"Assenmacher, D., &#38; Trautmann, H. (2022). Textual One-Pass Stream Clustering with Automated Distance Threshold Adaption. In T. et al. Tran (Ed.), <i>Intelligent Information and Database Systems</i> (pp. 3–16). Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-031-21743-2_1\">https://doi.org/10.1007/978-3-031-21743-2_1</a>","ieee":"D. Assenmacher and H. Trautmann, “Textual One-Pass Stream Clustering with Automated Distance Threshold Adaption,” in <i>Intelligent Information and Database Systems</i>, 2022, pp. 3–16, doi: <a href=\"https://doi.org/10.1007/978-3-031-21743-2_1\">10.1007/978-3-031-21743-2_1</a>.","chicago":"Assenmacher, D, and Heike Trautmann. “Textual One-Pass Stream Clustering with Automated Distance Threshold Adaption.” In <i>Intelligent Information and Database Systems</i>, edited by T et al. Tran, 3–16. Cham: Springer International Publishing, 2022. <a href=\"https://doi.org/10.1007/978-3-031-21743-2_1\">https://doi.org/10.1007/978-3-031-21743-2_1</a>.","ama":"Assenmacher D, Trautmann H. Textual One-Pass Stream Clustering with Automated Distance Threshold Adaption. In: et al. Tran T, ed. <i>Intelligent Information and Database Systems</i>. Springer International Publishing; 2022:3–16. doi:<a href=\"https://doi.org/10.1007/978-3-031-21743-2_1\">10.1007/978-3-031-21743-2_1</a>"}},{"publication":"Social Science Computer Review","type":"journal_article","status":"public","abstract":[{"text":" Computational social science uses computational and statistical methods in order to evaluate social interaction. The public availability of data sets is thus a necessary precondition for reliable and replicable research. These data allow researchers to benchmark the computational methods they develop, test the generalizability of their findings, and build confidence in their results. When social media data are concerned, data sharing is often restricted for legal or privacy reasons, which makes the comparison of methods and the replicability of research results infeasible. Social media analytics research, consequently, faces an integrity crisis. How is it possible to create trust in computational or statistical analyses, when they cannot be validated by third parties? In this work, we explore this well-known, yet little discussed, problem for social media analytics. We investigate how this problem can be solved by looking at related computational research areas. Moreover, we propose and implement a prototype to address the problem in the form of a new evaluation framework that enables the comparison of algorithms without the need to exchange data directly, while maintaining flexibility for the algorithm design. ","lang":"eng"}],"department":[{"_id":"34"},{"_id":"819"}],"user_id":"15504","_id":"46316","language":[{"iso":"eng"}],"issue":"6","intvolume":"        40","page":"1496-1522","citation":{"apa":"Assenmacher, D., Weber, D., Preuss, M., Valdez, A. C., Bradshaw, A., Ross, B., Cresci, S., Trautmann, H., Neumann, F., &#38; Grimme, C. (2022). Benchmarking Crisis in Social Media Analytics: A Solution for the Data-Sharing Problem. <i>Social Science Computer Review</i>, <i>40</i>(6), 1496–1522. <a href=\"https://doi.org/10.1177/08944393211012268\">https://doi.org/10.1177/08944393211012268</a>","mla":"Assenmacher, Dennis, et al. “Benchmarking Crisis in Social Media Analytics: A Solution for the Data-Sharing Problem.” <i>Social Science Computer Review</i>, vol. 40, no. 6, 2022, pp. 1496–522, doi:<a href=\"https://doi.org/10.1177/08944393211012268\">10.1177/08944393211012268</a>.","bibtex":"@article{Assenmacher_Weber_Preuss_Valdez_Bradshaw_Ross_Cresci_Trautmann_Neumann_Grimme_2022, title={Benchmarking Crisis in Social Media Analytics: A Solution for the Data-Sharing Problem}, volume={40}, DOI={<a href=\"https://doi.org/10.1177/08944393211012268\">10.1177/08944393211012268</a>}, number={6}, journal={Social Science Computer Review}, author={Assenmacher, Dennis and Weber, Derek and Preuss, Mike and Valdez, André Calero and Bradshaw, Alison and Ross, Björn and Cresci, Stefano and Trautmann, Heike and Neumann, Frank and Grimme, Christian}, year={2022}, pages={1496–1522} }","short":"D. Assenmacher, D. Weber, M. Preuss, A.C. Valdez, A. Bradshaw, B. Ross, S. Cresci, H. Trautmann, F. Neumann, C. Grimme, Social Science Computer Review 40 (2022) 1496–1522.","ama":"Assenmacher D, Weber D, Preuss M, et al. Benchmarking Crisis in Social Media Analytics: A Solution for the Data-Sharing Problem. <i>Social Science Computer Review</i>. 2022;40(6):1496-1522. doi:<a href=\"https://doi.org/10.1177/08944393211012268\">10.1177/08944393211012268</a>","ieee":"D. Assenmacher <i>et al.</i>, “Benchmarking Crisis in Social Media Analytics: A Solution for the Data-Sharing Problem,” <i>Social Science Computer Review</i>, vol. 40, no. 6, pp. 1496–1522, 2022, doi: <a href=\"https://doi.org/10.1177/08944393211012268\">10.1177/08944393211012268</a>.","chicago":"Assenmacher, Dennis, Derek Weber, Mike Preuss, André Calero Valdez, Alison Bradshaw, Björn Ross, Stefano Cresci, Heike Trautmann, Frank Neumann, and Christian Grimme. “Benchmarking Crisis in Social Media Analytics: A Solution for the Data-Sharing Problem.” <i>Social Science Computer Review</i> 40, no. 6 (2022): 1496–1522. <a href=\"https://doi.org/10.1177/08944393211012268\">https://doi.org/10.1177/08944393211012268</a>."},"year":"2022","volume":40,"author":[{"full_name":"Assenmacher, Dennis","last_name":"Assenmacher","first_name":"Dennis"},{"last_name":"Weber","full_name":"Weber, Derek","first_name":"Derek"},{"first_name":"Mike","full_name":"Preuss, Mike","last_name":"Preuss"},{"full_name":"Valdez, André Calero","last_name":"Valdez","first_name":"André Calero"},{"first_name":"Alison","last_name":"Bradshaw","full_name":"Bradshaw, Alison"},{"full_name":"Ross, Björn","last_name":"Ross","first_name":"Björn"},{"first_name":"Stefano","last_name":"Cresci","full_name":"Cresci, Stefano"},{"first_name":"Heike","id":"100740","full_name":"Trautmann, Heike","last_name":"Trautmann","orcid":"0000-0002-9788-8282"},{"first_name":"Frank","last_name":"Neumann","full_name":"Neumann, Frank"},{"first_name":"Christian","full_name":"Grimme, Christian","last_name":"Grimme"}],"date_created":"2023-08-04T07:26:36Z","date_updated":"2023-10-16T12:57:24Z","doi":"10.1177/08944393211012268","title":"Benchmarking Crisis in Social Media Analytics: A Solution for the Data-Sharing Problem"},{"citation":{"apa":"Unruh, R., Schafmeister, F., &#38; Böcker, J. (2022). Zero-Sequence Voltage Reduces DC-Link Capacitor Demand in Cascaded H-Bridge Converters for Large-Scale Electrolyzers by 40%. <i>24th European Conference on Power Electronics and Applications (EPE’22 ECCE Europe)</i>. 24th European Conference on Power Electronics and Applications (EPE’22 ECCE Europe), Hanover, Germany.","mla":"Unruh, Roland, et al. “Zero-Sequence Voltage Reduces DC-Link Capacitor Demand in Cascaded H-Bridge Converters for Large-Scale Electrolyzers by 40%.” <i>24th European Conference on Power Electronics and Applications (EPE’22 ECCE Europe)</i>, IEEE, 2022.","bibtex":"@inproceedings{Unruh_Schafmeister_Böcker_2022, title={Zero-Sequence Voltage Reduces DC-Link Capacitor Demand in Cascaded H-Bridge Converters for Large-Scale Electrolyzers by 40%}, booktitle={24th European Conference on Power Electronics and Applications (EPE’22 ECCE Europe)}, publisher={IEEE}, author={Unruh, Roland and Schafmeister, Frank and Böcker, Joachim}, year={2022} }","short":"R. Unruh, F. Schafmeister, J. Böcker, in: 24th European Conference on Power Electronics and Applications (EPE’22 ECCE Europe), IEEE, 2022.","chicago":"Unruh, Roland, Frank Schafmeister, and Joachim Böcker. “Zero-Sequence Voltage Reduces DC-Link Capacitor Demand in Cascaded H-Bridge Converters for Large-Scale Electrolyzers by 40%.” In <i>24th European Conference on Power Electronics and Applications (EPE’22 ECCE Europe)</i>. IEEE, 2022.","ieee":"R. Unruh, F. Schafmeister, and J. Böcker, “Zero-Sequence Voltage Reduces DC-Link Capacitor Demand in Cascaded H-Bridge Converters for Large-Scale Electrolyzers by 40%,” presented at the 24th European Conference on Power Electronics and Applications (EPE’22 ECCE Europe), Hanover, Germany, 2022.","ama":"Unruh R, Schafmeister F, Böcker J. Zero-Sequence Voltage Reduces DC-Link Capacitor Demand in Cascaded H-Bridge Converters for Large-Scale Electrolyzers by 40%. In: <i>24th European Conference on Power Electronics and Applications (EPE’22 ECCE Europe)</i>. IEEE; 2022."},"year":"2022","publication_status":"published","publication_identifier":{"isbn":["978-9-0758-1539-9"]},"main_file_link":[{"url":"https://ieeexplore.ieee.org/abstract/document/9907278"}],"conference":{"location":"Hanover, Germany","end_date":"2022-09-09","start_date":"2022-09-05","name":"24th European Conference on Power Electronics and Applications (EPE'22 ECCE Europe)"},"title":"Zero-Sequence Voltage Reduces DC-Link Capacitor Demand in Cascaded H-Bridge Converters for Large-Scale Electrolyzers by 40%","author":[{"id":"34289","full_name":"Unruh, Roland","last_name":"Unruh","first_name":"Roland"},{"last_name":"Schafmeister","id":"71291","full_name":"Schafmeister, Frank","first_name":"Frank"},{"id":"66","full_name":"Böcker, Joachim","last_name":"Böcker","orcid":"0000-0002-8480-7295","first_name":"Joachim"}],"date_created":"2022-12-02T12:47:38Z","publisher":"IEEE","date_updated":"2023-10-23T09:04:23Z","status":"public","abstract":[{"text":"Cascaded H-bridge Converters (CHBs) are a promising solution in converting power from a three-phase medium voltage of 6.6 kV...30 kV to a lower DC-voltage in the range of 100 V...1 kV to provide pure DC power to applications such as electrolyzers for hydrogen generation, data centers with a DC power distribution and DC microgrids. CHBs can be interpreted as modular multilevel converters with an isolated DC-DC output stage per module, require a large DC-link capacitor for each module to handle the second harmonic voltage ripple caused by the fluctuating input power within a fundamental grid period. Without a zero-sequence voltage injection, star-connected CHBs are operated with approximately sinusoidal arm voltages and currents. The floating star point potential enables to utilize different zero-sequence voltage injection techniques such as a third-harmonic injection with 1/6 of the grid voltage amplitude or a Min-Max voltage injection. Both well-known methods have the advantage to reduce the peak arm voltage and thereby the number of required modules by 13.4 % (to √ 3 2). This paper proves analytically that the third-harmonic injection with 1/6 of the grid voltage amplitude reduces the second harmonic voltage ripple by only 15.1 % compared to no-voltage injection for unity power factor operation and balanced grid voltages. Then it is shown, that the Min-Max injection has the often overlooked advantage of reducing the second harmonic voltage ripple by even 18.8 %. By applying the here proposed zero-sequence voltage injection in saturation modulation, the second harmonic voltage ripple of the DC-link capacitors is reduced by even 24.3 %, while still requiring the same number of modules as the Min-Max injection. For a realistic number of reserve modules, the overall energy ripple in the DC-link capacitors is reduced by 40 %.","lang":"eng"}],"type":"conference","publication":"24th European Conference on Power Electronics and Applications (EPE'22 ECCE Europe)","language":[{"iso":"eng"}],"keyword":["Cascaded H-Bridge","Solid-State Transformer","Zero sequence voltage","Third harmonic injection","Capacitor voltage ripple"],"user_id":"34289","department":[{"_id":"52"}],"_id":"34176"},{"ddc":["000"],"file_date_updated":"2022-09-22T10:48:31Z","language":[{"iso":"eng"}],"project":[{"name":"PC2: Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"_id":"33471","user_id":"460","department":[{"_id":"54"}],"abstract":[{"lang":"eng","text":"The intelligibility of demodulated audio signals from analog high frequency transmissions, e.g., using single-sideband\r\n(SSB) modulation, can be severely degraded by channel distortions and/or a mismatch between modulation and demodulation carrier frequency. In this work a neural network (NN)-based approach for carrier frequency offset (CFO) estimation from demodulated SSB signals is proposed, whereby a task specific architecture is presented. Additionally, a simulation framework for SSB signals is introduced and utilized for training the NNs. The CFO estimator is combined with a speech enhancement network to investigate its influence on the enhancement performance. The NN-based system is compared to a recently proposed pitch tracking based approach on publicly available data from real high frequency transmissions. Experiments show that the NN exhibits good CFO estimation properties and results in significant improvements in speech intelligibility, especially when combined with a noise reduction network."}],"file":[{"file_size":1231379,"file_id":"33472","access_level":"closed","file_name":"cfo.pdf","date_updated":"2022-09-22T10:48:31Z","creator":"jensheit","date_created":"2022-09-22T10:48:31Z","success":1,"relation":"main_file","content_type":"application/pdf"}],"status":"public","type":"conference","publication":"Proceedings of the 30th European Signal Processing Conference (EUSIPCO)","title":"Neural Network Based Carrier Frequency Offset Estimation From Speech Transmitted Over High Frequency Channels","conference":{"name":"30th European Signal Processing Conference (EUSIPCO)","start_date":"2022-08-29","end_date":"2022-09-02","location":"Belgrad"},"date_updated":"2023-10-26T08:15:57Z","date_created":"2022-09-22T10:56:13Z","author":[{"id":"27643","full_name":"Heitkämper, Jens","last_name":"Heitkämper","first_name":"Jens"},{"id":"460","full_name":"Schmalenstroeer, Joerg","last_name":"Schmalenstroeer","first_name":"Joerg"},{"id":"242","full_name":"Haeb-Umbach, Reinhold","last_name":"Haeb-Umbach","first_name":"Reinhold"}],"year":"2022","place":"Belgrad","citation":{"ieee":"J. Heitkämper, J. Schmalenstroeer, and R. Haeb-Umbach, “Neural Network Based Carrier Frequency Offset Estimation From Speech Transmitted Over High Frequency Channels,” presented at the 30th European Signal Processing Conference (EUSIPCO), Belgrad.","chicago":"Heitkämper, Jens, Joerg Schmalenstroeer, and Reinhold Haeb-Umbach. “Neural Network Based Carrier Frequency Offset Estimation From Speech Transmitted Over High Frequency Channels.” In <i>Proceedings of the 30th European Signal Processing Conference (EUSIPCO)</i>. Belgrad, n.d.","ama":"Heitkämper J, Schmalenstroeer J, Haeb-Umbach R. Neural Network Based Carrier Frequency Offset Estimation From Speech Transmitted Over High Frequency Channels. In: <i>Proceedings of the 30th European Signal Processing Conference (EUSIPCO)</i>.","short":"J. Heitkämper, J. Schmalenstroeer, R. Haeb-Umbach, in: Proceedings of the 30th European Signal Processing Conference (EUSIPCO), Belgrad, n.d.","mla":"Heitkämper, Jens, et al. “Neural Network Based Carrier Frequency Offset Estimation From Speech Transmitted Over High Frequency Channels.” <i>Proceedings of the 30th European Signal Processing Conference (EUSIPCO)</i>.","bibtex":"@inproceedings{Heitkämper_Schmalenstroeer_Haeb-Umbach, place={Belgrad}, title={Neural Network Based Carrier Frequency Offset Estimation From Speech Transmitted Over High Frequency Channels}, booktitle={Proceedings of the 30th European Signal Processing Conference (EUSIPCO)}, author={Heitkämper, Jens and Schmalenstroeer, Joerg and Haeb-Umbach, Reinhold} }","apa":"Heitkämper, J., Schmalenstroeer, J., &#38; Haeb-Umbach, R. (n.d.). Neural Network Based Carrier Frequency Offset Estimation From Speech Transmitted Over High Frequency Channels. <i>Proceedings of the 30th European Signal Processing Conference (EUSIPCO)</i>. 30th European Signal Processing Conference (EUSIPCO), Belgrad."},"publication_status":"accepted","has_accepted_license":"1","quality_controlled":"1"}]