[{"doi":"10.1145/3551349.3561339","main_file_link":[{"url":"https://doi.org/10.1145/3551349.3561339","open_access":"1"}],"title":"Scaling Arbitrary Android App Analyses","date_created":"2023-01-09T06:32:33Z","author":[{"first_name":"Felix","last_name":"Pauck","full_name":"Pauck, Felix","id":"22398"}],"oa":"1","date_updated":"2023-01-19T13:49:52Z","publisher":"ACM","citation":{"apa":"Pauck, F. (2023). Scaling Arbitrary Android App Analyses. <i>37th IEEE/ACM International Conference on Automated Software Engineering</i>. <a href=\"https://doi.org/10.1145/3551349.3561339\">https://doi.org/10.1145/3551349.3561339</a>","bibtex":"@inproceedings{Pauck_2023, title={Scaling Arbitrary Android App Analyses}, DOI={<a href=\"https://doi.org/10.1145/3551349.3561339\">10.1145/3551349.3561339</a>}, booktitle={37th IEEE/ACM International Conference on Automated Software Engineering}, publisher={ACM}, author={Pauck, Felix}, year={2023} }","mla":"Pauck, Felix. “Scaling Arbitrary Android App Analyses.” <i>37th IEEE/ACM International Conference on Automated Software Engineering</i>, ACM, 2023, doi:<a href=\"https://doi.org/10.1145/3551349.3561339\">10.1145/3551349.3561339</a>.","short":"F. Pauck, in: 37th IEEE/ACM International Conference on Automated Software Engineering, ACM, 2023.","chicago":"Pauck, Felix. “Scaling Arbitrary Android App Analyses.” In <i>37th IEEE/ACM International Conference on Automated Software Engineering</i>. ACM, 2023. <a href=\"https://doi.org/10.1145/3551349.3561339\">https://doi.org/10.1145/3551349.3561339</a>.","ieee":"F. Pauck, “Scaling Arbitrary Android App Analyses,” 2023, doi: <a href=\"https://doi.org/10.1145/3551349.3561339\">10.1145/3551349.3561339</a>.","ama":"Pauck F. Scaling Arbitrary Android App Analyses. In: <i>37th IEEE/ACM International Conference on Automated Software Engineering</i>. ACM; 2023. doi:<a href=\"https://doi.org/10.1145/3551349.3561339\">10.1145/3551349.3561339</a>"},"year":"2023","publication_status":"published","language":[{"iso":"eng"}],"department":[{"_id":"77"}],"user_id":"477","_id":"35427","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"},{"name":"SFB 901 - B4: SFB 901 - Subproject B4","_id":"12"}],"status":"public","publication":"37th IEEE/ACM International Conference on Automated Software Engineering","type":"conference"},{"year":"2023","intvolume":"        41","page":"137-148","citation":{"short":"R. Noé, Journal of Lightwave Technology 41 (2023) 137–148.","bibtex":"@article{Noé_2023, title={Consistent Optical and Electrical Noise Figure}, volume={41}, DOI={<a href=\"https://doi.org/10.1109/JLT.2022.3212936\">10.1109/JLT.2022.3212936</a>}, number={1}, journal={Journal of Lightwave Technology}, author={Noé, Reinhold}, year={2023}, pages={137–148} }","mla":"Noé, Reinhold. “Consistent Optical and Electrical Noise Figure.” <i>Journal of Lightwave Technology</i>, vol. 41, no. 1, 2023, pp. 137–48, doi:<a href=\"https://doi.org/10.1109/JLT.2022.3212936\">10.1109/JLT.2022.3212936</a>.","apa":"Noé, R. (2023). Consistent Optical and Electrical Noise Figure. <i>Journal of Lightwave Technology</i>, <i>41</i>(1), 137–148. <a href=\"https://doi.org/10.1109/JLT.2022.3212936\">https://doi.org/10.1109/JLT.2022.3212936</a>","ama":"Noé R. Consistent Optical and Electrical Noise Figure. <i>Journal of Lightwave Technology</i>. 2023;41(1):137-148. doi:<a href=\"https://doi.org/10.1109/JLT.2022.3212936\">10.1109/JLT.2022.3212936</a>","chicago":"Noé, Reinhold. “Consistent Optical and Electrical Noise Figure.” <i>Journal of Lightwave Technology</i> 41, no. 1 (2023): 137–48. <a href=\"https://doi.org/10.1109/JLT.2022.3212936\">https://doi.org/10.1109/JLT.2022.3212936</a>.","ieee":"R. Noé, “Consistent Optical and Electrical Noise Figure,” <i>Journal of Lightwave Technology</i>, vol. 41, no. 1, pp. 137–148, 2023, doi: <a href=\"https://doi.org/10.1109/JLT.2022.3212936\">10.1109/JLT.2022.3212936</a>."},"issue":"1","title":"Consistent Optical and Electrical Noise Figure","doi":"10.1109/JLT.2022.3212936","date_updated":"2023-01-25T23:00:09Z","volume":41,"date_created":"2023-01-23T18:04:58Z","author":[{"id":"381","full_name":"Noé, Reinhold","orcid":"https://orcid.org/0000-0002-5839-7616","last_name":"Noé","first_name":"Reinhold"}],"status":"public","publication":"Journal of Lightwave Technology","type":"journal_article","language":[{"iso":"eng"}],"_id":"38280","department":[{"_id":"56"}],"user_id":"14931"},{"date_created":"2023-01-26T16:07:19Z","supervisor":[{"first_name":"Johannes","full_name":"Blömer, Johannes","id":"23","last_name":"Blömer"}],"author":[{"last_name":"Pilot","full_name":"Pilot, Matthias","first_name":"Matthias"}],"date_updated":"2023-01-26T16:08:11Z","title":"Updatable Privacy-Preserving Reputation System based on Blockchain","citation":{"apa":"Pilot, M. (2023). <i>Updatable Privacy-Preserving Reputation System based on Blockchain</i>.","bibtex":"@book{Pilot_2023, title={Updatable Privacy-Preserving Reputation System based on Blockchain}, author={Pilot, Matthias}, year={2023} }","mla":"Pilot, Matthias. <i>Updatable Privacy-Preserving Reputation System Based on Blockchain</i>. 2023.","short":"M. Pilot, Updatable Privacy-Preserving Reputation System Based on Blockchain, 2023.","ieee":"M. Pilot, <i>Updatable Privacy-Preserving Reputation System based on Blockchain</i>. 2023.","chicago":"Pilot, Matthias. <i>Updatable Privacy-Preserving Reputation System Based on Blockchain</i>, 2023.","ama":"Pilot M. <i>Updatable Privacy-Preserving Reputation System Based on Blockchain</i>.; 2023."},"year":"2023","user_id":"27207","department":[{"_id":"7"},{"_id":"64"}],"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"}],"_id":"40440","extern":"1","language":[{"iso":"eng"}],"type":"mastersthesis","status":"public"},{"publication_identifier":{"isbn":["9781350296916","9781350296909","9781350296930","9781350296923","9781350296947"]},"publication_status":"published","year":"2023","citation":{"chicago":"Hüsing, Sven, Carsten Schulte, and Felix Winkelnkemper. “Epistemic Programming.” In <i>Computer Science Education</i>. Bloomsbury Academic, 2023. <a href=\"https://doi.org/10.5040/9781350296947.ch-022\">https://doi.org/10.5040/9781350296947.ch-022</a>.","ieee":"S. Hüsing, C. Schulte, and F. Winkelnkemper, “Epistemic Programming,” in <i>Computer Science Education</i>, Bloomsbury Academic, 2023.","ama":"Hüsing S, Schulte C, Winkelnkemper F. Epistemic Programming. In: <i>Computer Science Education</i>. Bloomsbury Academic; 2023. doi:<a href=\"https://doi.org/10.5040/9781350296947.ch-022\">10.5040/9781350296947.ch-022</a>","short":"S. Hüsing, C. Schulte, F. Winkelnkemper, in: Computer Science Education, Bloomsbury Academic, 2023.","mla":"Hüsing, Sven, et al. “Epistemic Programming.” <i>Computer Science Education</i>, Bloomsbury Academic, 2023, doi:<a href=\"https://doi.org/10.5040/9781350296947.ch-022\">10.5040/9781350296947.ch-022</a>.","bibtex":"@inbook{Hüsing_Schulte_Winkelnkemper_2023, title={Epistemic Programming}, DOI={<a href=\"https://doi.org/10.5040/9781350296947.ch-022\">10.5040/9781350296947.ch-022</a>}, booktitle={Computer Science Education}, publisher={Bloomsbury Academic}, author={Hüsing, Sven and Schulte, Carsten and Winkelnkemper, Felix}, year={2023} }","apa":"Hüsing, S., Schulte, C., &#38; Winkelnkemper, F. (2023). Epistemic Programming. In <i>Computer Science Education</i>. Bloomsbury Academic. <a href=\"https://doi.org/10.5040/9781350296947.ch-022\">https://doi.org/10.5040/9781350296947.ch-022</a>"},"publisher":"Bloomsbury Academic","date_updated":"2023-01-27T12:26:06Z","author":[{"id":"58465","full_name":"Hüsing, Sven","last_name":"Hüsing","first_name":"Sven"},{"first_name":"Carsten","last_name":"Schulte","id":"60311","full_name":"Schulte, Carsten"},{"first_name":"Felix","last_name":"Winkelnkemper","id":"3117","full_name":"Winkelnkemper, Felix"}],"date_created":"2023-01-27T12:25:37Z","title":"Epistemic Programming","doi":"10.5040/9781350296947.ch-022","publication":"Computer Science Education","type":"book_chapter","status":"public","_id":"40511","department":[{"_id":"67"}],"user_id":"58465","language":[{"iso":"eng"}]},{"project":[{"_id":"106","name":"Algorithmen für Schwarmrobotik: Verteiltes Rechnen trifft Dynamische Systeme"}],"_id":"33947","user_id":"38705","department":[{"_id":"63"}],"article_type":"original","type":"journal_article","status":"public","date_updated":"2023-01-30T09:20:09Z","author":[{"first_name":"Jannik","full_name":"Castenow, Jannik","id":"38705","last_name":"Castenow"},{"first_name":"Jonas","last_name":"Harbig","full_name":"Harbig, Jonas","id":"47213"},{"first_name":"Daniel","id":"37827","full_name":"Jung, Daniel","last_name":"Jung"},{"first_name":"Till","orcid":"0000-0003-2014-4696","last_name":"Knollmann","full_name":"Knollmann, Till","id":"39241"},{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"volume":939,"doi":"10.1016/j.tcs.2022.10.031","publication_status":"published","publication_identifier":{"issn":["0304-3975"]},"citation":{"ama":"Castenow J, Harbig J, Jung D, Knollmann T, Meyer auf der Heide F. Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation. <i>Theoretical Computer Science</i>. 2023;939:261-291. doi:<a href=\"https://doi.org/10.1016/j.tcs.2022.10.031\">10.1016/j.tcs.2022.10.031</a>","chicago":"Castenow, Jannik, Jonas Harbig, Daniel Jung, Till Knollmann, and Friedhelm Meyer auf der Heide. “Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation.” <i>Theoretical Computer Science</i> 939 (2023): 261–91. <a href=\"https://doi.org/10.1016/j.tcs.2022.10.031\">https://doi.org/10.1016/j.tcs.2022.10.031</a>.","ieee":"J. Castenow, J. Harbig, D. Jung, T. Knollmann, and F. Meyer auf der Heide, “Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation,” <i>Theoretical Computer Science</i>, vol. 939, pp. 261–291, 2023, doi: <a href=\"https://doi.org/10.1016/j.tcs.2022.10.031\">10.1016/j.tcs.2022.10.031</a>.","short":"J. Castenow, J. Harbig, D. Jung, T. Knollmann, F. Meyer auf der Heide, Theoretical Computer Science 939 (2023) 261–291.","bibtex":"@article{Castenow_Harbig_Jung_Knollmann_Meyer auf der Heide_2023, title={Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation}, volume={939}, DOI={<a href=\"https://doi.org/10.1016/j.tcs.2022.10.031\">10.1016/j.tcs.2022.10.031</a>}, journal={Theoretical Computer Science}, publisher={Elsevier BV}, author={Castenow, Jannik and Harbig, Jonas and Jung, Daniel and Knollmann, Till and Meyer auf der Heide, Friedhelm}, year={2023}, pages={261–291} }","mla":"Castenow, Jannik, et al. “Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation.” <i>Theoretical Computer Science</i>, vol. 939, Elsevier BV, 2023, pp. 261–91, doi:<a href=\"https://doi.org/10.1016/j.tcs.2022.10.031\">10.1016/j.tcs.2022.10.031</a>.","apa":"Castenow, J., Harbig, J., Jung, D., Knollmann, T., &#38; Meyer auf der Heide, F. (2023). Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation. <i>Theoretical Computer Science</i>, <i>939</i>, 261–291. <a href=\"https://doi.org/10.1016/j.tcs.2022.10.031\">https://doi.org/10.1016/j.tcs.2022.10.031</a>"},"intvolume":"       939","page":"261-291","external_id":{"arxiv":["2010.04424 "]},"keyword":["General Computer Science","Theoretical Computer Science"],"language":[{"iso":"eng"}],"publication":"Theoretical Computer Science","publisher":"Elsevier BV","date_created":"2022-10-28T05:11:16Z","title":"Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation","year":"2023"},{"language":[{"iso":"ger"},{"iso":"eng"}],"_id":"41369","user_id":"66","department":[{"_id":"52"}],"status":"public","type":"book","title":"Mechatronik und elektrische Antriebe / Mechatronics and electrical drives","doi":"10.17619/UNIPB/1-1640","date_updated":"2023-02-01T12:51:25Z","publisher":"Paderborn University","author":[{"first_name":"Joachim","full_name":"Böcker, Joachim","id":"66","last_name":"Böcker","orcid":"0000-0002-8480-7295"}],"date_created":"2023-02-01T12:46:34Z","year":"2023","place":"Paderborn","citation":{"apa":"Böcker, J. (n.d.). <i>Mechatronik und elektrische Antriebe / Mechatronics and electrical drives</i>. Paderborn University. <a href=\"https://doi.org/10.17619/UNIPB/1-1640\">https://doi.org/10.17619/UNIPB/1-1640</a>","bibtex":"@book{Böcker, place={Paderborn}, title={Mechatronik und elektrische Antriebe / Mechatronics and electrical drives}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-1640\">10.17619/UNIPB/1-1640</a>}, publisher={Paderborn University}, author={Böcker, Joachim} }","short":"J. Böcker, Mechatronik und elektrische Antriebe / Mechatronics and electrical drives, Paderborn University, Paderborn, n.d.","mla":"Böcker, Joachim. <i>Mechatronik und elektrische Antriebe / Mechatronics and electrical drives</i>. Paderborn University, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1640\">10.17619/UNIPB/1-1640</a>.","ama":"Böcker J. <i>Mechatronik und elektrische Antriebe / Mechatronics and electrical drives</i>. Paderborn University doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1640\">10.17619/UNIPB/1-1640</a>","chicago":"Böcker, Joachim. <i>Mechatronik und elektrische Antriebe / Mechatronics and electrical drives</i>. Paderborn: Paderborn University, n.d. <a href=\"https://doi.org/10.17619/UNIPB/1-1640\">https://doi.org/10.17619/UNIPB/1-1640</a>.","ieee":"J. Böcker, <i>Mechatronik und elektrische Antriebe / Mechatronics and electrical drives</i>. Paderborn: Paderborn University."},"publication_status":"submitted"},{"citation":{"apa":"Shivarpatna Venkatesh, A. P., Wang, J., Li, L., &#38; Bodden, E. (2023). Enhancing Comprehension and Navigation in Jupyter Notebooks with Static Analysis. <i>IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER)</i>.","mla":"Shivarpatna Venkatesh, Ashwin Prasad, et al. “Enhancing Comprehension and Navigation in Jupyter Notebooks with Static Analysis.” <i>IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER)</i>, 2023.","short":"A.P. Shivarpatna Venkatesh, J. Wang, L. Li, E. Bodden, in: IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER), 2023.","bibtex":"@inproceedings{Shivarpatna Venkatesh_Wang_Li_Bodden_2023, title={Enhancing Comprehension and Navigation in Jupyter Notebooks with Static Analysis}, booktitle={IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER)}, author={Shivarpatna Venkatesh, Ashwin Prasad and Wang, Jiawei and Li, Li and Bodden, Eric}, year={2023} }","ieee":"A. P. Shivarpatna Venkatesh, J. Wang, L. Li, and E. Bodden, “Enhancing Comprehension and Navigation in Jupyter Notebooks with Static Analysis,” 2023.","chicago":"Shivarpatna Venkatesh, Ashwin Prasad, Jiawei Wang, Li Li, and Eric Bodden. “Enhancing Comprehension and Navigation in Jupyter Notebooks with Static Analysis.” In <i>IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER)</i>, 2023.","ama":"Shivarpatna Venkatesh AP, Wang J, Li L, Bodden E. Enhancing Comprehension and Navigation in Jupyter Notebooks with Static Analysis. In: <i>IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER)</i>. ; 2023."},"year":"2023","title":"Enhancing Comprehension and Navigation in Jupyter Notebooks with Static Analysis","author":[{"first_name":"Ashwin Prasad","id":"66637","full_name":"Shivarpatna Venkatesh, Ashwin Prasad","last_name":"Shivarpatna Venkatesh"},{"first_name":"Jiawei","full_name":"Wang, Jiawei","last_name":"Wang"},{"last_name":"Li","full_name":"Li, Li","first_name":"Li"},{"first_name":"Eric","id":"59256","full_name":"Bodden, Eric","last_name":"Bodden","orcid":"0000-0003-3470-3647"}],"date_created":"2023-02-06T10:44:08Z","date_updated":"2023-02-06T10:46:00Z","status":"public","type":"conference","publication":"IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER)","language":[{"iso":"eng"}],"user_id":"15249","department":[{"_id":"76"}],"_id":"41813"},{"title":"End-User Development of Interactive Web-Based Virtual Reality Scenes","author":[{"first_name":"Enes","id":"8447","full_name":"Yigitbas, Enes","orcid":"0000-0002-5967-833X","last_name":"Yigitbas"},{"first_name":"Jonas","id":"40915","full_name":"Klauke, Jonas","orcid":"0000-0001-9160-9636","last_name":"Klauke"},{"last_name":"Gottschalk","full_name":"Gottschalk, Sebastian","id":"47208","first_name":"Sebastian"},{"id":"107","full_name":"Engels, Gregor","last_name":"Engels","first_name":"Gregor"}],"date_created":"2022-12-12T20:04:29Z","date_updated":"2023-02-14T10:48:12Z","publisher":"Elsevier","citation":{"chicago":"Yigitbas, Enes, Jonas Klauke, Sebastian Gottschalk, and Gregor Engels. “End-User Development of Interactive Web-Based Virtual Reality Scenes.” <i>Journal on Computer Languages (COLA) </i>, 2023.","ieee":"E. Yigitbas, J. Klauke, S. Gottschalk, and G. Engels, “End-User Development of Interactive Web-Based Virtual Reality Scenes,” <i>Journal on Computer Languages (COLA) </i>, 2023.","ama":"Yigitbas E, Klauke J, Gottschalk S, Engels G. End-User Development of Interactive Web-Based Virtual Reality Scenes. <i>Journal on Computer Languages (COLA) </i>. Published online 2023.","mla":"Yigitbas, Enes, et al. “End-User Development of Interactive Web-Based Virtual Reality Scenes.” <i>Journal on Computer Languages (COLA) </i>, Elsevier, 2023.","short":"E. Yigitbas, J. Klauke, S. Gottschalk, G. Engels, Journal on Computer Languages (COLA)  (2023).","bibtex":"@article{Yigitbas_Klauke_Gottschalk_Engels_2023, title={End-User Development of Interactive Web-Based Virtual Reality Scenes}, journal={Journal on Computer Languages (COLA) }, publisher={Elsevier}, author={Yigitbas, Enes and Klauke, Jonas and Gottschalk, Sebastian and Engels, Gregor}, year={2023} }","apa":"Yigitbas, E., Klauke, J., Gottschalk, S., &#38; Engels, G. (2023). End-User Development of Interactive Web-Based Virtual Reality Scenes. <i>Journal on Computer Languages (COLA) </i>."},"year":"2023","language":[{"iso":"eng"}],"user_id":"8447","department":[{"_id":"66"},{"_id":"534"}],"_id":"34402","status":"public","type":"journal_article","publication":"Journal on Computer Languages (COLA) "},{"date_created":"2022-10-04T13:30:06Z","author":[{"first_name":"Enes","full_name":"Yigitbas, Enes","id":"8447","last_name":"Yigitbas","orcid":"0000-0002-5967-833X"},{"id":"107","full_name":"Engels, Gregor","last_name":"Engels","first_name":"Gregor"}],"publisher":"ScholarSpace","date_updated":"2023-02-14T10:49:19Z","title":"Enhancing Robot Programming through Digital Twin and Augmented Reality ","citation":{"apa":"Yigitbas, E., &#38; Engels, G. (2023). Enhancing Robot Programming through Digital Twin and Augmented Reality . <i>56th Hawaii International Conference on System Science (HICSS 2023) </i>.","short":"E. Yigitbas, G. Engels, in: 56th Hawaii International Conference on System Science (HICSS 2023) , ScholarSpace, 2023.","bibtex":"@inproceedings{Yigitbas_Engels_2023, title={Enhancing Robot Programming through Digital Twin and Augmented Reality }, booktitle={56th Hawaii International Conference on System Science (HICSS 2023) }, publisher={ScholarSpace}, author={Yigitbas, Enes and Engels, Gregor}, year={2023} }","mla":"Yigitbas, Enes, and Gregor Engels. “Enhancing Robot Programming through Digital Twin and Augmented Reality .” <i>56th Hawaii International Conference on System Science (HICSS 2023) </i>, ScholarSpace, 2023.","ieee":"E. Yigitbas and G. Engels, “Enhancing Robot Programming through Digital Twin and Augmented Reality ,” 2023.","chicago":"Yigitbas, Enes, and Gregor Engels. “Enhancing Robot Programming through Digital Twin and Augmented Reality .” In <i>56th Hawaii International Conference on System Science (HICSS 2023) </i>. ScholarSpace, 2023.","ama":"Yigitbas E, Engels G. Enhancing Robot Programming through Digital Twin and Augmented Reality . In: <i>56th Hawaii International Conference on System Science (HICSS 2023) </i>. ScholarSpace; 2023."},"year":"2023","department":[{"_id":"66"},{"_id":"534"}],"user_id":"8447","_id":"33511","language":[{"iso":"eng"}],"publication":"56th Hawaii International Conference on System Science (HICSS 2023) ","type":"conference","status":"public"},{"title":"Towards Enhanced Guiding Mechanisms in VR Training through Process Mining","date_updated":"2023-02-14T10:49:40Z","author":[{"first_name":"Enes","last_name":"Yigitbas","orcid":"0000-0002-5967-833X","id":"8447","full_name":"Yigitbas, Enes"},{"first_name":"Sebastian","full_name":"Krois, Sebastian","last_name":"Krois"},{"last_name":"Gottschalk","id":"47208","full_name":"Gottschalk, Sebastian","first_name":"Sebastian"},{"first_name":"Gregor","last_name":"Engels","id":"107","full_name":"Engels, Gregor"}],"date_created":"2022-12-12T20:02:01Z","year":"2023","citation":{"ama":"Yigitbas E, Krois S, Gottschalk S, Engels G. Towards Enhanced Guiding Mechanisms in VR Training through Process Mining. In: <i>Proceedings of the 7th International Conference on Human Computer Interaction Theory and Applications (HUCAPP’23) </i>. ; 2023.","ieee":"E. Yigitbas, S. Krois, S. Gottschalk, and G. Engels, “Towards Enhanced Guiding Mechanisms in VR Training through Process Mining,” 2023.","chicago":"Yigitbas, Enes, Sebastian Krois, Sebastian Gottschalk, and Gregor Engels. “Towards Enhanced Guiding Mechanisms in VR Training through Process Mining.” In <i>Proceedings of the 7th International Conference on Human Computer Interaction Theory and Applications (HUCAPP’23) </i>, 2023.","apa":"Yigitbas, E., Krois, S., Gottschalk, S., &#38; Engels, G. (2023). Towards Enhanced Guiding Mechanisms in VR Training through Process Mining. <i>Proceedings of the 7th International Conference on Human Computer Interaction Theory and Applications (HUCAPP’23) </i>.","mla":"Yigitbas, Enes, et al. “Towards Enhanced Guiding Mechanisms in VR Training through Process Mining.” <i>Proceedings of the 7th International Conference on Human Computer Interaction Theory and Applications (HUCAPP’23) </i>, 2023.","short":"E. Yigitbas, S. Krois, S. Gottschalk, G. Engels, in: Proceedings of the 7th International Conference on Human Computer Interaction Theory and Applications (HUCAPP’23) , 2023.","bibtex":"@inproceedings{Yigitbas_Krois_Gottschalk_Engels_2023, title={Towards Enhanced Guiding Mechanisms in VR Training through Process Mining}, booktitle={Proceedings of the 7th International Conference on Human Computer Interaction Theory and Applications (HUCAPP’23) }, author={Yigitbas, Enes and Krois, Sebastian and Gottschalk, Sebastian and Engels, Gregor}, year={2023} }"},"language":[{"iso":"eng"}],"_id":"34401","department":[{"_id":"66"},{"_id":"534"}],"user_id":"8447","status":"public","publication":"Proceedings of the 7th International Conference on Human Computer Interaction Theory and Applications (HUCAPP'23) ","type":"conference"},{"status":"public","editor":[{"first_name":"Eshcar","full_name":"Hillel, Eshcar","last_name":"Hillel"},{"last_name":"Palmieri","full_name":"Palmieri, Roberto","first_name":"Roberto"},{"first_name":"Etienne","full_name":"Riviére, Etienne","last_name":"Riviére"}],"type":"conference","department":[{"_id":"63"}],"series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","user_id":"38705","_id":"34008","project":[{"_id":"106","name":"Algorithmen für Schwarmrobotik: Verteiltes Rechnen trifft Dynamische Systeme"}],"intvolume":"       253","page":"15:1–15:25","citation":{"mla":"Castenow, Jannik, et al. “A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots with Limited Visibility .” <i>Proceedings of the 26th International Conference on Principles of Distributed Systems (OPODIS) </i>, edited by Eshcar Hillel et al., vol. 253, Schloss Dagstuhl – Leibniz Zentrum für Informatik, 2023, p. 15:1–15:25, doi:<a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2022.15\">10.4230/LIPIcs.OPODIS.2022.15</a>.","short":"J. Castenow, J. Harbig, D. Jung, P. Kling, T. Knollmann, F. Meyer auf der Heide, in: E. Hillel, R. Palmieri, E. Riviére (Eds.), Proceedings of the 26th International Conference on Principles of Distributed Systems (OPODIS) , Schloss Dagstuhl – Leibniz Zentrum für Informatik, Brussels, 2023, p. 15:1–15:25.","bibtex":"@inproceedings{Castenow_Harbig_Jung_Kling_Knollmann_Meyer auf der Heide_2023, place={Brussels}, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots with Limited Visibility }, volume={253}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2022.15\">10.4230/LIPIcs.OPODIS.2022.15</a>}, booktitle={Proceedings of the 26th International Conference on Principles of Distributed Systems (OPODIS) }, publisher={Schloss Dagstuhl – Leibniz Zentrum für Informatik}, author={Castenow, Jannik and Harbig, Jonas and Jung, Daniel and Kling, Peter and Knollmann, Till and Meyer auf der Heide, Friedhelm}, editor={Hillel, Eshcar and Palmieri, Roberto and Riviére, Etienne}, year={2023}, pages={15:1–15:25}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }","apa":"Castenow, J., Harbig, J., Jung, D., Kling, P., Knollmann, T., &#38; Meyer auf der Heide, F. (2023). A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots with Limited Visibility . In E. Hillel, R. Palmieri, &#38; E. Riviére (Eds.), <i>Proceedings of the 26th International Conference on Principles of Distributed Systems (OPODIS) </i> (Vol. 253, p. 15:1–15:25). Schloss Dagstuhl – Leibniz Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2022.15\">https://doi.org/10.4230/LIPIcs.OPODIS.2022.15</a>","chicago":"Castenow, Jannik, Jonas Harbig, Daniel Jung, Peter Kling, Till Knollmann, and Friedhelm Meyer auf der Heide. “A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots with Limited Visibility .” In <i>Proceedings of the 26th International Conference on Principles of Distributed Systems (OPODIS) </i>, edited by Eshcar Hillel, Roberto Palmieri, and Etienne Riviére, 253:15:1–15:25. Leibniz International Proceedings in Informatics (LIPIcs). Brussels: Schloss Dagstuhl – Leibniz Zentrum für Informatik, 2023. <a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2022.15\">https://doi.org/10.4230/LIPIcs.OPODIS.2022.15</a>.","ieee":"J. Castenow, J. Harbig, D. Jung, P. Kling, T. Knollmann, and F. Meyer auf der Heide, “A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots with Limited Visibility ,” in <i>Proceedings of the 26th International Conference on Principles of Distributed Systems (OPODIS) </i>, Brussels, 2023, vol. 253, p. 15:1–15:25, doi: <a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2022.15\">10.4230/LIPIcs.OPODIS.2022.15</a>.","ama":"Castenow J, Harbig J, Jung D, Kling P, Knollmann T, Meyer auf der Heide F. A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots with Limited Visibility . In: Hillel E, Palmieri R, Riviére E, eds. <i>Proceedings of the 26th International Conference on Principles of Distributed Systems (OPODIS) </i>. Vol 253. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl – Leibniz Zentrum für Informatik; 2023:15:1–15:25. doi:<a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2022.15\">10.4230/LIPIcs.OPODIS.2022.15</a>"},"place":"Brussels","publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-95977-265-5"]},"publication_status":"published","doi":"10.4230/LIPIcs.OPODIS.2022.15","conference":{"end_date":"2022-12-15","location":"Brussels","name":"26th International Conference on Principles of Distributed Systems (OPODIS)","start_date":"2022-12-13"},"volume":253,"author":[{"last_name":"Castenow","id":"38705","full_name":"Castenow, Jannik","first_name":"Jannik"},{"full_name":"Harbig, Jonas","id":"47213","last_name":"Harbig","first_name":"Jonas"},{"last_name":"Jung","id":"37827","full_name":"Jung, Daniel","first_name":"Daniel"},{"first_name":"Peter","full_name":"Kling, Peter","last_name":"Kling"},{"first_name":"Till","full_name":"Knollmann, Till","id":"39241","last_name":"Knollmann","orcid":"0000-0003-2014-4696"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm"}],"date_updated":"2023-02-15T14:53:12Z","publication":"Proceedings of the 26th International Conference on Principles of Distributed Systems (OPODIS) ","language":[{"iso":"eng"}],"external_id":{"arxiv":["2206.07567 "]},"year":"2023","title":"A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots with Limited Visibility ","date_created":"2022-11-04T09:41:30Z","publisher":"Schloss Dagstuhl – Leibniz Zentrum für Informatik"},{"publication":"arXiv:2302.07160","type":"preprint","status":"public","abstract":[{"lang":"eng","text":"The goal of this paper is to make a strong point for the usage of dynamical models when using reinforcement learning (RL) for feedback control of dynamical systems governed by partial differential equations (PDEs). To breach the gap between the immense promises we see in RL and the applicability in complex engineering systems, the main challenges are the massive requirements in terms of the training data, as well as the lack of performance guarantees. We present a solution for the first issue using a data-driven surrogate model in the form of a convolutional LSTM with actuation. We demonstrate that learning an actuated model in parallel to training the RL agent significantly reduces the total amount of required data sampled from the real system. Furthermore, we show that iteratively updating the model is of major importance to avoid biases in the RL training. Detailed ablation studies reveal the most important ingredients of the modeling process. We use the chaotic Kuramoto-Sivashinsky equation do demonstarte our findings."}],"department":[{"_id":"655"}],"user_id":"47427","external_id":{"arxiv":["2302.07160"]},"_id":"42160","language":[{"iso":"eng"}],"citation":{"ama":"Werner S, Peitz S. Learning a model is paramount for sample efficiency in reinforcement  learning control of PDEs. <i>arXiv:230207160</i>. Published online 2023.","chicago":"Werner, Stefan, and Sebastian Peitz. “Learning a Model Is Paramount for Sample Efficiency in Reinforcement  Learning Control of PDEs.” <i>ArXiv:2302.07160</i>, 2023.","ieee":"S. Werner and S. Peitz, “Learning a model is paramount for sample efficiency in reinforcement  learning control of PDEs,” <i>arXiv:2302.07160</i>. 2023.","short":"S. Werner, S. Peitz, ArXiv:2302.07160 (2023).","mla":"Werner, Stefan, and Sebastian Peitz. “Learning a Model Is Paramount for Sample Efficiency in Reinforcement  Learning Control of PDEs.” <i>ArXiv:2302.07160</i>, 2023.","bibtex":"@article{Werner_Peitz_2023, title={Learning a model is paramount for sample efficiency in reinforcement  learning control of PDEs}, journal={arXiv:2302.07160}, author={Werner, Stefan and Peitz, Sebastian}, year={2023} }","apa":"Werner, S., &#38; Peitz, S. (2023). Learning a model is paramount for sample efficiency in reinforcement  learning control of PDEs. In <i>arXiv:2302.07160</i>."},"year":"2023","author":[{"full_name":"Werner, Stefan","last_name":"Werner","first_name":"Stefan"},{"id":"47427","full_name":"Peitz, Sebastian","last_name":"Peitz","orcid":"0000-0002-3389-793X","first_name":"Sebastian"}],"date_created":"2023-02-15T20:57:20Z","oa":"1","date_updated":"2023-02-15T20:58:33Z","main_file_link":[{"open_access":"1","url":"https://arxiv.org/pdf/2302.07160"}],"title":"Learning a model is paramount for sample efficiency in reinforcement  learning control of PDEs"},{"type":"journal_article","publication":"Canadian Journal of Mathematics","status":"public","user_id":"30905","department":[{"_id":"93"}],"project":[{"name":"RegLie: Regularität von Lie-Gruppen und Lie's Dritter Satz (RegLie)","_id":"161"}],"_id":"34814","language":[{"iso":"eng"}],"article_type":"original","keyword":["extension of differentiable maps"],"issue":"1","publication_status":"published","publication_identifier":{"issn":["0008-414X","1496-4279"]},"citation":{"ama":"Hanusch M. A $C^k$-seeley-extension-theorem for Bastiani’s differential calculus. <i>Canadian Journal of Mathematics</i>. 2023;75(1):170-201. doi:<a href=\"https://doi.org/10.4153/s0008414x21000596\">10.4153/s0008414x21000596</a>","ieee":"M. Hanusch, “A $C^k$-seeley-extension-theorem for Bastiani’s differential calculus,” <i>Canadian Journal of Mathematics</i>, vol. 75, no. 1, pp. 170–201, 2023, doi: <a href=\"https://doi.org/10.4153/s0008414x21000596\">10.4153/s0008414x21000596</a>.","chicago":"Hanusch, Maximilian. “A $C^k$-Seeley-Extension-Theorem for Bastiani’s Differential Calculus.” <i>Canadian Journal of Mathematics</i> 75, no. 1 (2023): 170–201. <a href=\"https://doi.org/10.4153/s0008414x21000596\">https://doi.org/10.4153/s0008414x21000596</a>.","mla":"Hanusch, Maximilian. “A $C^k$-Seeley-Extension-Theorem for Bastiani’s Differential Calculus.” <i>Canadian Journal of Mathematics</i>, vol. 75, no. 1, Canadian Mathematical Society, 2023, pp. 170–201, doi:<a href=\"https://doi.org/10.4153/s0008414x21000596\">10.4153/s0008414x21000596</a>.","bibtex":"@article{Hanusch_2023, title={A $C^k$-seeley-extension-theorem for Bastiani’s differential calculus}, volume={75}, DOI={<a href=\"https://doi.org/10.4153/s0008414x21000596\">10.4153/s0008414x21000596</a>}, number={1}, journal={Canadian Journal of Mathematics}, publisher={Canadian Mathematical Society}, author={Hanusch, Maximilian}, year={2023}, pages={170–201} }","short":"M. Hanusch, Canadian Journal of Mathematics 75 (2023) 170–201.","apa":"Hanusch, M. (2023). A $C^k$-seeley-extension-theorem for Bastiani’s differential calculus. <i>Canadian Journal of Mathematics</i>, <i>75</i>(1), 170–201. <a href=\"https://doi.org/10.4153/s0008414x21000596\">https://doi.org/10.4153/s0008414x21000596</a>"},"page":"170-201","intvolume":"        75","year":"2023","date_created":"2022-12-22T09:16:48Z","author":[{"full_name":"Hanusch, Maximilian","id":"30905","last_name":"Hanusch","first_name":"Maximilian"}],"volume":75,"date_updated":"2023-02-22T11:38:32Z","publisher":"Canadian Mathematical Society","doi":"10.4153/s0008414x21000596","title":"A $C^k$-seeley-extension-theorem for Bastiani’s differential calculus"},{"language":[{"iso":"eng"}],"external_id":{"arxiv":["2206.05243"]},"abstract":[{"text":"Savitch's theorem states that NPSPACE computations can be simulated in\r\nPSPACE. We initiate the study of a quantum analogue of NPSPACE, denoted\r\nStreaming-QCMASPACE (SQCMASPACE), where an exponentially long classical proof\r\nis streamed to a poly-space quantum verifier. Besides two main results, we also\r\nshow that a quantum analogue of Savitch's theorem is unlikely to hold, as\r\nSQCMASPACE=NEXP. For completeness, we introduce Streaming-QMASPACE (SQMASPACE)\r\nwith an exponentially long streamed quantum proof, and show SQMASPACE=QMA_EXP\r\n(quantum analogue of NEXP). Our first main result shows, in contrast to the\r\nclassical setting, the solution space of a quantum constraint satisfaction\r\nproblem (i.e. a local Hamiltonian) is always connected when exponentially long\r\nproofs are permitted. For this, we show how to simulate any Lipschitz\r\ncontinuous path on the unit hypersphere via a sequence of local unitary gates,\r\nat the expense of blowing up the circuit size. This shows quantum\r\nerror-correcting codes can be unable to detect one codeword erroneously\r\nevolving to another if the evolution happens sufficiently slowly, and answers\r\nan open question of [Gharibian, Sikora, ICALP 2015] regarding the Ground State\r\nConnectivity problem. Our second main result is that any SQCMASPACE computation\r\ncan be embedded into \"unentanglement\", i.e. into a quantum constraint\r\nsatisfaction problem with unentangled provers. Formally, we show how to embed\r\nSQCMASPACE into the Sparse Separable Hamiltonian problem of [Chailloux,\r\nSattath, CCC 2012] (QMA(2)-complete for 1/poly promise gap), at the expense of\r\nscaling the promise gap with the streamed proof size. As a corollary, we obtain\r\nthe first systematic construction for obtaining QMA(2)-type upper bounds on\r\narbitrary multi-prover interactive proof systems, where the QMA(2) promise gap\r\nscales exponentially with the number of bits of communication in the\r\ninteractive proof.","lang":"eng"}],"publication":"14th Innovations in Theoretical Computer Science (ITCS)","title":"Quantum space, ground space traversal, and how to embed multi-prover  interactive proofs into unentanglement","date_created":"2022-06-13T14:40:46Z","year":"2023","_id":"31872","department":[{"_id":"623"},{"_id":"7"}],"user_id":"71541","status":"public","type":"conference","doi":"10.4230/LIPIcs.ITCS.2023.53","date_updated":"2023-02-28T11:06:55Z","volume":251,"author":[{"first_name":"Sevag","full_name":"Gharibian, Sevag","id":"71541","last_name":"Gharibian","orcid":"0000-0002-9992-3379"},{"full_name":"Rudolph, Dorian","last_name":"Rudolph","first_name":"Dorian"}],"intvolume":"       251","page":"53:1-53:23","citation":{"bibtex":"@inproceedings{Gharibian_Rudolph_2023, title={Quantum space, ground space traversal, and how to embed multi-prover  interactive proofs into unentanglement}, volume={251}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2023.53\">10.4230/LIPIcs.ITCS.2023.53</a>}, booktitle={14th Innovations in Theoretical Computer Science (ITCS)}, author={Gharibian, Sevag and Rudolph, Dorian}, year={2023}, pages={53:1-53:23} }","mla":"Gharibian, Sevag, and Dorian Rudolph. “Quantum Space, Ground Space Traversal, and How to Embed Multi-Prover  Interactive Proofs into Unentanglement.” <i>14th Innovations in Theoretical Computer Science (ITCS)</i>, vol. 251, 2023, p. 53:1-53:23, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2023.53\">10.4230/LIPIcs.ITCS.2023.53</a>.","short":"S. Gharibian, D. Rudolph, in: 14th Innovations in Theoretical Computer Science (ITCS), 2023, p. 53:1-53:23.","apa":"Gharibian, S., &#38; Rudolph, D. (2023). Quantum space, ground space traversal, and how to embed multi-prover  interactive proofs into unentanglement. <i>14th Innovations in Theoretical Computer Science (ITCS)</i>, <i>251</i>, 53:1-53:23. <a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2023.53\">https://doi.org/10.4230/LIPIcs.ITCS.2023.53</a>","ieee":"S. Gharibian and D. Rudolph, “Quantum space, ground space traversal, and how to embed multi-prover  interactive proofs into unentanglement,” in <i>14th Innovations in Theoretical Computer Science (ITCS)</i>, 2023, vol. 251, p. 53:1-53:23, doi: <a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2023.53\">10.4230/LIPIcs.ITCS.2023.53</a>.","chicago":"Gharibian, Sevag, and Dorian Rudolph. “Quantum Space, Ground Space Traversal, and How to Embed Multi-Prover  Interactive Proofs into Unentanglement.” In <i>14th Innovations in Theoretical Computer Science (ITCS)</i>, 251:53:1-53:23, 2023. <a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2023.53\">https://doi.org/10.4230/LIPIcs.ITCS.2023.53</a>.","ama":"Gharibian S, Rudolph D. Quantum space, ground space traversal, and how to embed multi-prover  interactive proofs into unentanglement. In: <i>14th Innovations in Theoretical Computer Science (ITCS)</i>. Vol 251. ; 2023:53:1-53:23. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2023.53\">10.4230/LIPIcs.ITCS.2023.53</a>"},"publication_status":"published"},{"type":"journal_article","publication":"Journal of Global Optimization","status":"public","abstract":[{"text":"Regularization is used in many different areas of optimization when solutions\r\nare sought which not only minimize a given function, but also possess a certain\r\ndegree of regularity. Popular applications are image denoising, sparse\r\nregression and machine learning. Since the choice of the regularization\r\nparameter is crucial but often difficult, path-following methods are used to\r\napproximate the entire regularization path, i.e., the set of all possible\r\nsolutions for all regularization parameters. Due to their nature, the\r\ndevelopment of these methods requires structural results about the\r\nregularization path. The goal of this article is to derive these results for\r\nthe case of a smooth objective function which is penalized by a piecewise\r\ndifferentiable regularization term. We do this by treating regularization as a\r\nmultiobjective optimization problem. Our results suggest that even in this\r\ngeneral case, the regularization path is piecewise smooth. Moreover, our theory\r\nallows for a classification of the nonsmooth features that occur in between\r\nsmooth parts. This is demonstrated in two applications, namely support-vector\r\nmachines and exact penalty methods.","lang":"eng"}],"user_id":"47427","department":[{"_id":"101"},{"_id":"655"}],"_id":"27426","language":[{"iso":"eng"}],"issue":"3","citation":{"apa":"Gebken, B., Bieker, K., &#38; Peitz, S. (2023). On the structure of regularization paths for piecewise differentiable regularization terms. <i>Journal of Global Optimization</i>, <i>85</i>(3), 709–741. <a href=\"https://doi.org/10.1007/s10898-022-01223-2\">https://doi.org/10.1007/s10898-022-01223-2</a>","bibtex":"@article{Gebken_Bieker_Peitz_2023, title={On the structure of regularization paths for piecewise differentiable regularization terms}, volume={85}, DOI={<a href=\"https://doi.org/10.1007/s10898-022-01223-2\">10.1007/s10898-022-01223-2</a>}, number={3}, journal={Journal of Global Optimization}, author={Gebken, Bennet and Bieker, Katharina and Peitz, Sebastian}, year={2023}, pages={709–741} }","short":"B. Gebken, K. Bieker, S. Peitz, Journal of Global Optimization 85 (2023) 709–741.","mla":"Gebken, Bennet, et al. “On the Structure of Regularization Paths for Piecewise Differentiable Regularization Terms.” <i>Journal of Global Optimization</i>, vol. 85, no. 3, 2023, pp. 709–41, doi:<a href=\"https://doi.org/10.1007/s10898-022-01223-2\">10.1007/s10898-022-01223-2</a>.","chicago":"Gebken, Bennet, Katharina Bieker, and Sebastian Peitz. “On the Structure of Regularization Paths for Piecewise Differentiable Regularization Terms.” <i>Journal of Global Optimization</i> 85, no. 3 (2023): 709–41. <a href=\"https://doi.org/10.1007/s10898-022-01223-2\">https://doi.org/10.1007/s10898-022-01223-2</a>.","ieee":"B. Gebken, K. Bieker, and S. Peitz, “On the structure of regularization paths for piecewise differentiable regularization terms,” <i>Journal of Global Optimization</i>, vol. 85, no. 3, pp. 709–741, 2023, doi: <a href=\"https://doi.org/10.1007/s10898-022-01223-2\">10.1007/s10898-022-01223-2</a>.","ama":"Gebken B, Bieker K, Peitz S. On the structure of regularization paths for piecewise differentiable regularization terms. <i>Journal of Global Optimization</i>. 2023;85(3):709-741. doi:<a href=\"https://doi.org/10.1007/s10898-022-01223-2\">10.1007/s10898-022-01223-2</a>"},"intvolume":"        85","page":"709-741","year":"2023","author":[{"last_name":"Gebken","id":"32643","full_name":"Gebken, Bennet","first_name":"Bennet"},{"full_name":"Bieker, Katharina","id":"32829","last_name":"Bieker","first_name":"Katharina"},{"first_name":"Sebastian","orcid":"0000-0002-3389-793X","last_name":"Peitz","id":"47427","full_name":"Peitz, Sebastian"}],"date_created":"2021-11-15T09:24:59Z","volume":85,"oa":"1","date_updated":"2023-03-11T17:16:33Z","main_file_link":[{"url":"https://link.springer.com/content/pdf/10.1007/s10898-022-01223-2.pdf","open_access":"1"}],"doi":"10.1007/s10898-022-01223-2","title":"On the structure of regularization paths for piecewise differentiable regularization terms"},{"publication":"Journal of Quantitative Spectroscopy and Radiative Transfer","file":[{"content_type":"application/pdf","relation":"main_file","date_updated":"2023-03-15T15:58:15Z","date_created":"2023-03-15T15:58:15Z","creator":"fossie","file_size":1508833,"access_level":"local","file_name":"2023-03 Alhaddad - JQSRT - Numerical study of light backscattering from layers of absorbing particles larger than the wavelength.pdf","file_id":"43028"},{"file_size":4254386,"access_level":"open_access","file_id":"43029","file_name":"2023-03 Alhaddad - JQSRT - Numerical study of light backscattering from layers of absorbing particles larger than the wavelength (accepted manuscript).pdf","date_updated":"2023-03-15T17:35:29Z","date_created":"2023-03-15T17:35:29Z","creator":"fossie","relation":"main_file","content_type":"application/pdf"}],"keyword":["tet_topic_scattering"],"ddc":["530"],"language":[{"iso":"eng"}],"year":"2023","publisher":"Elsevier BV","date_created":"2023-03-14T12:32:54Z","title":"Numerical study of light backscattering from layers of absorbing irregular particles larger than the wavelength","type":"journal_article","status":"public","_id":"43018","project":[{"_id":"52","name":"PC2: Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"department":[{"_id":"61"}],"user_id":"158","article_number":"108557","file_date_updated":"2023-03-15T17:35:29Z","publication_identifier":{"issn":["0022-4073"]},"has_accepted_license":"1","publication_status":"published","intvolume":"       302","citation":{"bibtex":"@article{Alhaddad_Förstner_Grynko_2023, title={Numerical study of light backscattering from layers of absorbing irregular particles larger than the wavelength}, volume={302}, DOI={<a href=\"https://doi.org/10.1016/j.jqsrt.2023.108557\">10.1016/j.jqsrt.2023.108557</a>}, number={108557}, journal={Journal of Quantitative Spectroscopy and Radiative Transfer}, publisher={Elsevier BV}, author={Alhaddad, Samer and Förstner, Jens and Grynko, Yevgen}, year={2023} }","mla":"Alhaddad, Samer, et al. “Numerical Study of Light Backscattering from Layers of Absorbing Irregular Particles Larger than the Wavelength.” <i>Journal of Quantitative Spectroscopy and Radiative Transfer</i>, vol. 302, 108557, Elsevier BV, 2023, doi:<a href=\"https://doi.org/10.1016/j.jqsrt.2023.108557\">10.1016/j.jqsrt.2023.108557</a>.","short":"S. Alhaddad, J. Förstner, Y. Grynko, Journal of Quantitative Spectroscopy and Radiative Transfer 302 (2023).","apa":"Alhaddad, S., Förstner, J., &#38; Grynko, Y. (2023). Numerical study of light backscattering from layers of absorbing irregular particles larger than the wavelength. <i>Journal of Quantitative Spectroscopy and Radiative Transfer</i>, <i>302</i>, Article 108557. <a href=\"https://doi.org/10.1016/j.jqsrt.2023.108557\">https://doi.org/10.1016/j.jqsrt.2023.108557</a>","ama":"Alhaddad S, Förstner J, Grynko Y. Numerical study of light backscattering from layers of absorbing irregular particles larger than the wavelength. <i>Journal of Quantitative Spectroscopy and Radiative Transfer</i>. 2023;302. doi:<a href=\"https://doi.org/10.1016/j.jqsrt.2023.108557\">10.1016/j.jqsrt.2023.108557</a>","chicago":"Alhaddad, Samer, Jens Förstner, and Yevgen Grynko. “Numerical Study of Light Backscattering from Layers of Absorbing Irregular Particles Larger than the Wavelength.” <i>Journal of Quantitative Spectroscopy and Radiative Transfer</i> 302 (2023). <a href=\"https://doi.org/10.1016/j.jqsrt.2023.108557\">https://doi.org/10.1016/j.jqsrt.2023.108557</a>.","ieee":"S. Alhaddad, J. Förstner, and Y. Grynko, “Numerical study of light backscattering from layers of absorbing irregular particles larger than the wavelength,” <i>Journal of Quantitative Spectroscopy and Radiative Transfer</i>, vol. 302, Art. no. 108557, 2023, doi: <a href=\"https://doi.org/10.1016/j.jqsrt.2023.108557\">10.1016/j.jqsrt.2023.108557</a>."},"date_updated":"2023-03-15T17:36:13Z","oa":"1","volume":302,"author":[{"full_name":"Alhaddad, Samer","id":"42456","last_name":"Alhaddad","first_name":"Samer"},{"first_name":"Jens","full_name":"Förstner, Jens","id":"158","last_name":"Förstner","orcid":"0000-0001-7059-9862"},{"first_name":"Yevgen","full_name":"Grynko, Yevgen","id":"26059","last_name":"Grynko"}],"doi":"10.1016/j.jqsrt.2023.108557"},{"quality_controlled":"1","year":"2023","date_created":"2022-06-12T11:07:34Z","publisher":"University of Hannover and INDRUM.","title":"Student Teachers ’ Knowledge of Congruence before a University Course on Geometry","publication":"Proceedings of the Fourth Conference of the International Network for Didactic Research in University Mathematics (INDRUM 2022, 19-22 October 2022)","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2023-03-25T10:01:03Z","creator":"maxh","date_updated":"2023-03-25T10:01:03Z","file_name":"HoffmannBiehler2022_indrum_congruence.pdf","access_level":"closed","file_id":"43096","file_size":201942}],"language":[{"iso":"eng"}],"keyword":["Teaching and learning of specific topics in university mathematics","Transition to","across and from university mathematics","Student Teachers","Geometry","Congruence","Double Discontinuity."],"ddc":["370","510"],"has_accepted_license":"1","publication_status":"published","citation":{"apa":"Hoffmann, M., &#38; Biehler, R. (2023). Student Teachers ’ Knowledge of Congruence before a University Course on Geometry. In M. Trigueros, B. Barquero, R. Hochmuth, &#38; J. Peters (Eds.), <i>Proceedings of the Fourth Conference of the International Network for Didactic Research in University Mathematics (INDRUM 2022, 19-22 October 2022)</i>. University of Hannover and INDRUM.","mla":"Hoffmann, Max, and Rolf Biehler. “Student Teachers ’ Knowledge of Congruence before a University Course on Geometry.” <i>Proceedings of the Fourth Conference of the International Network for Didactic Research in University Mathematics (INDRUM 2022, 19-22 October 2022)</i>, edited by Marı́a Trigueros et al., University of Hannover and INDRUM., 2023.","bibtex":"@inproceedings{Hoffmann_Biehler_2023, place={Hannover}, title={Student Teachers ’ Knowledge of Congruence before a University Course on Geometry}, booktitle={Proceedings of the Fourth Conference of the International Network for Didactic Research in University Mathematics (INDRUM 2022, 19-22 October 2022)}, publisher={University of Hannover and INDRUM.}, author={Hoffmann, Max and Biehler, Rolf}, editor={Trigueros, Marı́a and Barquero, Berta and Hochmuth, Reinhard and Peters, Jana}, year={2023} }","short":"M. Hoffmann, R. Biehler, in: M. Trigueros, B. Barquero, R. Hochmuth, J. Peters (Eds.), Proceedings of the Fourth Conference of the International Network for Didactic Research in University Mathematics (INDRUM 2022, 19-22 October 2022), University of Hannover and INDRUM., Hannover, 2023.","ama":"Hoffmann M, Biehler R. Student Teachers ’ Knowledge of Congruence before a University Course on Geometry. In: Trigueros M, Barquero B, Hochmuth R, Peters J, eds. <i>Proceedings of the Fourth Conference of the International Network for Didactic Research in University Mathematics (INDRUM 2022, 19-22 October 2022)</i>. University of Hannover and INDRUM.; 2023.","chicago":"Hoffmann, Max, and Rolf Biehler. “Student Teachers ’ Knowledge of Congruence before a University Course on Geometry.” In <i>Proceedings of the Fourth Conference of the International Network for Didactic Research in University Mathematics (INDRUM 2022, 19-22 October 2022)</i>, edited by Marı́a Trigueros, Berta Barquero, Reinhard Hochmuth, and Jana Peters. Hannover: University of Hannover and INDRUM., 2023.","ieee":"M. Hoffmann and R. Biehler, “Student Teachers ’ Knowledge of Congruence before a University Course on Geometry,” in <i>Proceedings of the Fourth Conference of the International Network for Didactic Research in University Mathematics (INDRUM 2022, 19-22 October 2022)</i>, 2023."},"place":"Hannover","author":[{"last_name":"Hoffmann","orcid":"0000-0002-6964-7123","full_name":"Hoffmann, Max","id":"32202","first_name":"Max"},{"first_name":"Rolf","id":"16274","full_name":"Biehler, Rolf","last_name":"Biehler"}],"oa":"1","date_updated":"2023-03-25T10:11:35Z","main_file_link":[{"url":"https://hal.univ-reims.fr/INDRUM2022/","open_access":"1"}],"type":"conference","status":"public","editor":[{"first_name":"Marı́a","full_name":"Trigueros, Marı́a","last_name":"Trigueros"},{"full_name":"Barquero, Berta","last_name":"Barquero","first_name":"Berta"},{"last_name":"Hochmuth","full_name":"Hochmuth, Reinhard","first_name":"Reinhard"},{"last_name":"Peters","full_name":"Peters, Jana","first_name":"Jana"}],"department":[{"_id":"97"}],"user_id":"32202","_id":"31849","file_date_updated":"2023-03-25T10:01:03Z"},{"year":"2023","quality_controlled":"1","title":"Innovations in university teaching based on mathematic education research","date_created":"2023-03-25T10:09:06Z","file":[{"date_created":"2023-03-25T10:07:54Z","creator":"maxh","date_updated":"2023-03-25T10:07:54Z","access_level":"closed","file_name":"2022_FlorensaEtAl_indrum_panelInnovations.pdf","file_id":"43098","file_size":642388,"content_type":"application/pdf","relation":"main_file","success":1}],"publication":"Proceedings of the Fourth Conference of the International Network for Didactic Research in University Mathematics (INDRUM 2022, 19-22 October 2022)","ddc":["370","510"],"language":[{"iso":"eng"}],"place":"Hannover","citation":{"ama":"Florensa I, Hoffmann M, Romo Vázquez A, Zandieh M, Martínez-Planell R. Innovations in university teaching based on mathematic education research. In: Trigueros M, Barquero B, Hochmuth R, Peters J, eds. <i>Proceedings of the Fourth Conference of the International Network for Didactic Research in University Mathematics (INDRUM 2022, 19-22 October 2022)</i>. ; 2023.","ieee":"I. Florensa, M. Hoffmann, A. Romo Vázquez, M. Zandieh, and R. Martínez-Planell, “Innovations in university teaching based on mathematic education research,” in <i>Proceedings of the Fourth Conference of the International Network for Didactic Research in University Mathematics (INDRUM 2022, 19-22 October 2022)</i>, 2023.","chicago":"Florensa, Ignasio, Max Hoffmann, Avenilde Romo Vázquez, Michelle Zandieh, and Rafael Martínez-Planell. “Innovations in University Teaching Based on Mathematic Education Research.” In <i>Proceedings of the Fourth Conference of the International Network for Didactic Research in University Mathematics (INDRUM 2022, 19-22 October 2022)</i>, edited by Marı́a Trigueros, Berta Barquero, Reinhard Hochmuth, and Jana Peters. Hannover, 2023.","apa":"Florensa, I., Hoffmann, M., Romo Vázquez, A., Zandieh, M., &#38; Martínez-Planell, R. (2023). Innovations in university teaching based on mathematic education research. In M. Trigueros, B. Barquero, R. Hochmuth, &#38; J. Peters (Eds.), <i>Proceedings of the Fourth Conference of the International Network for Didactic Research in University Mathematics (INDRUM 2022, 19-22 October 2022)</i>.","bibtex":"@inproceedings{Florensa_Hoffmann_Romo Vázquez_Zandieh_Martínez-Planell_2023, place={Hannover}, title={Innovations in university teaching based on mathematic education research}, booktitle={Proceedings of the Fourth Conference of the International Network for Didactic Research in University Mathematics (INDRUM 2022, 19-22 October 2022)}, author={Florensa, Ignasio and Hoffmann, Max and Romo Vázquez, Avenilde and Zandieh, Michelle and Martínez-Planell, Rafael}, editor={Trigueros, Marı́a and Barquero, Berta and Hochmuth, Reinhard and Peters, Jana}, year={2023} }","short":"I. Florensa, M. Hoffmann, A. Romo Vázquez, M. Zandieh, R. Martínez-Planell, in: M. Trigueros, B. Barquero, R. Hochmuth, J. Peters (Eds.), Proceedings of the Fourth Conference of the International Network for Didactic Research in University Mathematics (INDRUM 2022, 19-22 October 2022), Hannover, 2023.","mla":"Florensa, Ignasio, et al. “Innovations in University Teaching Based on Mathematic Education Research.” <i>Proceedings of the Fourth Conference of the International Network for Didactic Research in University Mathematics (INDRUM 2022, 19-22 October 2022)</i>, edited by Marı́a Trigueros et al., 2023."},"has_accepted_license":"1","main_file_link":[{"open_access":"1","url":"https://hal.univ-reims.fr/INDRUM2022/"}],"oa":"1","date_updated":"2023-03-25T10:10:58Z","author":[{"full_name":"Florensa, Ignasio","last_name":"Florensa","first_name":"Ignasio"},{"last_name":"Hoffmann","orcid":"0000-0002-6964-7123","id":"32202","full_name":"Hoffmann, Max","first_name":"Max"},{"last_name":"Romo Vázquez","full_name":"Romo Vázquez, Avenilde","first_name":"Avenilde"},{"full_name":"Zandieh, Michelle","last_name":"Zandieh","first_name":"Michelle"},{"first_name":"Rafael","last_name":"Martínez-Planell","full_name":"Martínez-Planell, Rafael"}],"editor":[{"last_name":"Trigueros","full_name":"Trigueros, Marı́a","first_name":"Marı́a"},{"full_name":"Barquero, Berta","last_name":"Barquero","first_name":"Berta"},{"last_name":"Hochmuth","full_name":"Hochmuth, Reinhard","first_name":"Reinhard"},{"first_name":"Jana","last_name":"Peters","full_name":"Peters, Jana"}],"status":"public","type":"conference","file_date_updated":"2023-03-25T10:07:54Z","_id":"43097","department":[{"_id":"97"}],"user_id":"32202"},{"title":"Beep-and-Sleep: Message and Energy Efficient Set Cover","doi":"10.1016/j.tcs.2023.113756","date_updated":"2023-03-27T09:55:04Z","volume":950,"date_created":"2023-03-27T07:45:44Z","author":[{"full_name":"Götte, Thorsten","id":"34727","last_name":"Götte","first_name":"Thorsten"},{"full_name":"Kolb, Christina","last_name":"Kolb","first_name":"Christina"},{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"},{"full_name":"Werthmann, Julian","id":"50024","last_name":"Werthmann","first_name":"Julian"}],"year":"2023","intvolume":"       950","page":"113756","citation":{"ama":"Götte T, Kolb C, Scheideler C, Werthmann J. Beep-and-Sleep: Message and Energy Efficient Set Cover. <i>Theor Comput Sci</i>. 2023;950:113756. doi:<a href=\"https://doi.org/10.1016/j.tcs.2023.113756\">10.1016/j.tcs.2023.113756</a>","chicago":"Götte, Thorsten, Christina Kolb, Christian Scheideler, and Julian Werthmann. “Beep-and-Sleep: Message and Energy Efficient Set Cover.” <i>Theor. Comput. Sci.</i> 950 (2023): 113756. <a href=\"https://doi.org/10.1016/j.tcs.2023.113756\">https://doi.org/10.1016/j.tcs.2023.113756</a>.","ieee":"T. Götte, C. Kolb, C. Scheideler, and J. Werthmann, “Beep-and-Sleep: Message and Energy Efficient Set Cover,” <i>Theor. Comput. Sci.</i>, vol. 950, p. 113756, 2023, doi: <a href=\"https://doi.org/10.1016/j.tcs.2023.113756\">10.1016/j.tcs.2023.113756</a>.","apa":"Götte, T., Kolb, C., Scheideler, C., &#38; Werthmann, J. (2023). Beep-and-Sleep: Message and Energy Efficient Set Cover. <i>Theor. Comput. Sci.</i>, <i>950</i>, 113756. <a href=\"https://doi.org/10.1016/j.tcs.2023.113756\">https://doi.org/10.1016/j.tcs.2023.113756</a>","short":"T. Götte, C. Kolb, C. Scheideler, J. Werthmann, Theor. Comput. Sci. 950 (2023) 113756.","bibtex":"@article{Götte_Kolb_Scheideler_Werthmann_2023, title={Beep-and-Sleep: Message and Energy Efficient Set Cover}, volume={950}, DOI={<a href=\"https://doi.org/10.1016/j.tcs.2023.113756\">10.1016/j.tcs.2023.113756</a>}, journal={Theor. Comput. Sci.}, author={Götte, Thorsten and Kolb, Christina and Scheideler, Christian and Werthmann, Julian}, year={2023}, pages={113756} }","mla":"Götte, Thorsten, et al. “Beep-and-Sleep: Message and Energy Efficient Set Cover.” <i>Theor. Comput. Sci.</i>, vol. 950, 2023, p. 113756, doi:<a href=\"https://doi.org/10.1016/j.tcs.2023.113756\">10.1016/j.tcs.2023.113756</a>."},"language":[{"iso":"eng"}],"_id":"43109","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - A1: SFB 901 - Subproject A1","_id":"5"}],"department":[{"_id":"79"}],"user_id":"15504","status":"public","publication":"Theor. Comput. Sci.","type":"journal_article"},{"year":"2023","citation":{"ama":"Yigitbas E, Nowosad A, Engels G. Supporting Construction and Architectural Visualization through BIM and AR/VR: A Systematic Literature Review. In: <i>Proceedings of the 19th IFIP TC13 International Conference on Human-Computer Interaction (INTERACT 2023)</i>. Springer; 2023.","ieee":"E. Yigitbas, A. Nowosad, and G. Engels, “Supporting Construction and Architectural Visualization through BIM and AR/VR: A Systematic Literature Review,” 2023.","chicago":"Yigitbas, Enes, Alexander Nowosad, and Gregor Engels. “Supporting Construction and Architectural Visualization through BIM and AR/VR: A Systematic Literature Review.” In <i>Proceedings of the 19th IFIP TC13 International Conference on Human-Computer Interaction (INTERACT 2023)</i>. Springer, 2023.","bibtex":"@inproceedings{Yigitbas_Nowosad_Engels_2023, title={Supporting Construction and Architectural Visualization through BIM and AR/VR: A Systematic Literature Review}, booktitle={Proceedings of the 19th IFIP TC13 International Conference on Human-Computer Interaction (INTERACT 2023)}, publisher={Springer}, author={Yigitbas, Enes and Nowosad, Alexander and Engels, Gregor}, year={2023} }","mla":"Yigitbas, Enes, et al. “Supporting Construction and Architectural Visualization through BIM and AR/VR: A Systematic Literature Review.” <i>Proceedings of the 19th IFIP TC13 International Conference on Human-Computer Interaction (INTERACT 2023)</i>, Springer, 2023.","short":"E. Yigitbas, A. Nowosad, G. Engels, in: Proceedings of the 19th IFIP TC13 International Conference on Human-Computer Interaction (INTERACT 2023), Springer, 2023.","apa":"Yigitbas, E., Nowosad, A., &#38; Engels, G. (2023). Supporting Construction and Architectural Visualization through BIM and AR/VR: A Systematic Literature Review. <i>Proceedings of the 19th IFIP TC13 International Conference on Human-Computer Interaction (INTERACT 2023)</i>."},"publisher":"Springer","date_updated":"2023-04-06T07:26:55Z","date_created":"2023-04-06T07:26:07Z","author":[{"last_name":"Yigitbas","orcid":"0000-0002-5967-833X","full_name":"Yigitbas, Enes","id":"8447","first_name":"Enes"},{"first_name":"Alexander","full_name":"Nowosad, Alexander","last_name":"Nowosad"},{"first_name":"Gregor","id":"107","full_name":"Engels, Gregor","last_name":"Engels"}],"title":"Supporting Construction and Architectural Visualization through BIM and AR/VR: A Systematic Literature Review","publication":"Proceedings of the 19th IFIP TC13 International Conference on Human-Computer Interaction (INTERACT 2023)","type":"conference","status":"public","_id":"43424","department":[{"_id":"66"},{"_id":"534"}],"user_id":"8447","language":[{"iso":"eng"}]}]