[{"date_created":"2024-01-08T14:25:28Z","type":"journal_article","department":[{"_id":"100"}],"issue":"9","publication":"Journal of Combinatorial Designs","abstract":[{"lang":"eng","text":"We show that there exist ordered orthogonal arrays, whose sizes deviate from the Rao bound by a factor that is polynomial in the parameters of the ordered orthogonal array. The proof is nonconstructive and based on a probabilistic method due to Kuperberg, Lovett and Peled."}],"language":[{"iso":"eng"}],"doi":"10.1002/jcd.21903","year":"2023","title":"Existence of small ordered orthogonal arrays","author":[{"first_name":"Kai‐Uwe","last_name":"Schmidt","full_name":"Schmidt, Kai‐Uwe"},{"full_name":"Weiß, Charlene","first_name":"Charlene","last_name":"Weiß","id":"70420"}],"publication_status":"published","date_updated":"2024-01-08T14:38:53Z","intvolume":"        31","citation":{"ama":"Schmidt K, Weiß C. Existence of small ordered orthogonal arrays. <i>Journal of Combinatorial Designs</i>. 2023;31(9):422-431. doi:<a href=\"https://doi.org/10.1002/jcd.21903\">10.1002/jcd.21903</a>","bibtex":"@article{Schmidt_Weiß_2023, title={Existence of small ordered orthogonal arrays}, volume={31}, DOI={<a href=\"https://doi.org/10.1002/jcd.21903\">10.1002/jcd.21903</a>}, number={9}, journal={Journal of Combinatorial Designs}, publisher={Wiley}, author={Schmidt, Kai‐Uwe and Weiß, Charlene}, year={2023}, pages={422–431} }","mla":"Schmidt, Kai‐Uwe, and Charlene Weiß. “Existence of Small Ordered Orthogonal Arrays.” <i>Journal of Combinatorial Designs</i>, vol. 31, no. 9, Wiley, 2023, pp. 422–31, doi:<a href=\"https://doi.org/10.1002/jcd.21903\">10.1002/jcd.21903</a>.","chicago":"Schmidt, Kai‐Uwe, and Charlene Weiß. “Existence of Small Ordered Orthogonal Arrays.” <i>Journal of Combinatorial Designs</i> 31, no. 9 (2023): 422–31. <a href=\"https://doi.org/10.1002/jcd.21903\">https://doi.org/10.1002/jcd.21903</a>.","short":"K. Schmidt, C. Weiß, Journal of Combinatorial Designs 31 (2023) 422–431.","apa":"Schmidt, K., &#38; Weiß, C. (2023). Existence of small ordered orthogonal arrays. <i>Journal of Combinatorial Designs</i>, <i>31</i>(9), 422–431. <a href=\"https://doi.org/10.1002/jcd.21903\">https://doi.org/10.1002/jcd.21903</a>","ieee":"K. Schmidt and C. Weiß, “Existence of small ordered orthogonal arrays,” <i>Journal of Combinatorial Designs</i>, vol. 31, no. 9, pp. 422–431, 2023, doi: <a href=\"https://doi.org/10.1002/jcd.21903\">10.1002/jcd.21903</a>."},"page":"422-431","_id":"50297","publisher":"Wiley","user_id":"70420","volume":31,"status":"public"},{"date_updated":"2024-01-08T14:46:14Z","status":"public","title":"Linear programming bounds in classical association schemes","year":"2023","author":[{"id":"70420","full_name":"Weiß, Charlene","first_name":"Charlene","last_name":"Weiß"}],"user_id":"70420","doi":"10.17619/UNIPB/1-1672","_id":"50300","language":[{"iso":"eng"}],"abstract":[{"text":"Digital communications relies heavily on the usage of different types of codes. Prominent codes nowadays are rank-metric codes and subspace codes - the q-analogs of binary codes and binary codes with constant weight. All these codes can be viewed as subsets of classical association schemes. A central coding-theoretic problem is to derive upper bounds for the size of codes. This thesis investigates Delsartes powerful linear program whose optimum is precisely such a bound for codes in association schemes. The linear programs for binary codes and binary constant-weight codes have been extensively studied since the 1970s, but their optimum is still unknown. We determine in a unified way the optimum of the linear program in several ordinary q-analogs as well as in their affine counterparts. In particular, bounds and constructions for codes in polar spaces are established, where the bounds are sharp up to a constant factor in many cases. Moreover, based on these results, an almost complete classification of Steiner systems in polar spaces is provided by showing that they could only exist in some corner cases.","lang":"eng"}],"citation":{"short":"C. Weiß, Linear Programming Bounds in Classical Association Schemes, 2023.","chicago":"Weiß, Charlene. <i>Linear Programming Bounds in Classical Association Schemes</i>, 2023. <a href=\"https://doi.org/10.17619/UNIPB/1-1672\">https://doi.org/10.17619/UNIPB/1-1672</a>.","ieee":"C. Weiß, <i>Linear programming bounds in classical association schemes</i>. 2023.","apa":"Weiß, C. (2023). <i>Linear programming bounds in classical association schemes</i>. <a href=\"https://doi.org/10.17619/UNIPB/1-1672\">https://doi.org/10.17619/UNIPB/1-1672</a>","bibtex":"@book{Weiß_2023, title={Linear programming bounds in classical association schemes}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-1672\">10.17619/UNIPB/1-1672</a>}, author={Weiß, Charlene}, year={2023} }","ama":"Weiß C. <i>Linear Programming Bounds in Classical Association Schemes</i>.; 2023. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1672\">10.17619/UNIPB/1-1672</a>","mla":"Weiß, Charlene. <i>Linear Programming Bounds in Classical Association Schemes</i>. 2023, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1672\">10.17619/UNIPB/1-1672</a>."},"type":"dissertation","department":[{"_id":"100"}],"date_created":"2024-01-08T14:42:12Z"},{"language":[{"iso":"ger"}],"_id":"48335","publisher":"4. Aachener Ofenbau- und Thermoprozess-Kolloquium","user_id":"45189","year":"2023","status":"public","title":"Regenerative Energien für einen effizienten Betrieb von Presshärtelinien","author":[{"full_name":"Knorr, Lukas","last_name":"Knorr","first_name":"Lukas","id":"90391"},{"id":"45189","full_name":"Jungeilges, André","first_name":"André","last_name":"Jungeilges"},{"id":"22717","full_name":"Pfeifer, Florian","first_name":"Florian","last_name":"Pfeifer"},{"id":"32685","last_name":"Burmeister","first_name":"Sascha Christian","orcid":"0000-0001-6679-0453","full_name":"Burmeister, Sascha Christian"},{"first_name":"Henning","orcid":"0000-0002-1538-089X","last_name":"Meschede","full_name":"Meschede, Henning","id":"86954"}],"date_updated":"2024-01-11T09:05:19Z","place":"Aachen","date_created":"2023-10-19T10:34:14Z","type":"misc","department":[{"_id":"644"},{"_id":"149"},{"_id":"277"},{"_id":"321"}],"citation":{"apa":"Knorr, L., Jungeilges, A., Pfeifer, F., Burmeister, S. C., &#38; Meschede, H. (2023). <i>Regenerative Energien für einen effizienten Betrieb von Presshärtelinien</i>. 4. Aachener Ofenbau- und Thermoprozess-Kolloquium.","ieee":"L. Knorr, A. Jungeilges, F. Pfeifer, S. C. Burmeister, and H. Meschede, <i>Regenerative Energien für einen effizienten Betrieb von Presshärtelinien</i>. Aachen: 4. Aachener Ofenbau- und Thermoprozess-Kolloquium, 2023.","chicago":"Knorr, Lukas, André Jungeilges, Florian Pfeifer, Sascha Christian Burmeister, and Henning Meschede. <i>Regenerative Energien für einen effizienten Betrieb von Presshärtelinien</i>. Aachen: 4. Aachener Ofenbau- und Thermoprozess-Kolloquium, 2023.","short":"L. Knorr, A. Jungeilges, F. Pfeifer, S.C. Burmeister, H. Meschede, Regenerative Energien für einen effizienten Betrieb von Presshärtelinien, 4. Aachener Ofenbau- und Thermoprozess-Kolloquium, Aachen, 2023.","mla":"Knorr, Lukas, et al. <i>Regenerative Energien für einen effizienten Betrieb von Presshärtelinien</i>. 4. Aachener Ofenbau- und Thermoprozess-Kolloquium, 2023.","ama":"Knorr L, Jungeilges A, Pfeifer F, Burmeister SC, Meschede H. <i>Regenerative Energien für einen effizienten Betrieb von Presshärtelinien</i>. 4. Aachener Ofenbau- und Thermoprozess-Kolloquium; 2023.","bibtex":"@book{Knorr_Jungeilges_Pfeifer_Burmeister_Meschede_2023, place={Aachen}, title={Regenerative Energien für einen effizienten Betrieb von Presshärtelinien}, publisher={4. Aachener Ofenbau- und Thermoprozess-Kolloquium}, author={Knorr, Lukas and Jungeilges, André and Pfeifer, Florian and Burmeister, Sascha Christian and Meschede, Henning}, year={2023} }"}},{"project":[{"name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","grant_number":"160364472","_id":"1"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"grant_number":"160364472","_id":"16","name":"SFB 901 - C4: SFB 901 - On-The-Fly Compute Centers II: Ausführung komponierter Dienste in konfigurierbaren Rechenzentren (Subproject C4)"}],"citation":{"short":"M. Maack, F. Meyer auf der Heide, S. Pukrop, Algorithmica (2023).","chicago":"Maack, Marten, Friedhelm Meyer auf der Heide, and Simon Pukrop. “Server Cloud Scheduling.” <i>Algorithmica</i>, 2023. <a href=\"https://doi.org/10.1007/s00453-023-01189-x\">https://doi.org/10.1007/s00453-023-01189-x</a>.","apa":"Maack, M., Meyer auf der Heide, F., &#38; Pukrop, S. (2023). Server Cloud Scheduling. <i>Algorithmica</i>. <a href=\"https://doi.org/10.1007/s00453-023-01189-x\">https://doi.org/10.1007/s00453-023-01189-x</a>","ieee":"M. Maack, F. Meyer auf der Heide, and S. Pukrop, “Server Cloud Scheduling,” <i>Algorithmica</i>, 2023, doi: <a href=\"https://doi.org/10.1007/s00453-023-01189-x\">10.1007/s00453-023-01189-x</a>.","ama":"Maack M, Meyer auf der Heide F, Pukrop S. Server Cloud Scheduling. <i>Algorithmica</i>. Published online 2023. doi:<a href=\"https://doi.org/10.1007/s00453-023-01189-x\">10.1007/s00453-023-01189-x</a>","bibtex":"@article{Maack_Meyer auf der Heide_Pukrop_2023, title={Server Cloud Scheduling}, DOI={<a href=\"https://doi.org/10.1007/s00453-023-01189-x\">10.1007/s00453-023-01189-x</a>}, journal={Algorithmica}, publisher={Springer Science and Business Media LLC}, author={Maack, Marten and Meyer auf der Heide, Friedhelm and Pukrop, Simon}, year={2023} }","mla":"Maack, Marten, et al. “Server Cloud Scheduling.” <i>Algorithmica</i>, Springer Science and Business Media LLC, 2023, doi:<a href=\"https://doi.org/10.1007/s00453-023-01189-x\">10.1007/s00453-023-01189-x</a>."},"status":"public","user_id":"44428","publisher":"Springer Science and Business Media LLC","_id":"50458","extern":"1","abstract":[{"text":"<jats:title>Abstract</jats:title><jats:p>Consider a set of jobs connected to a directed acyclic task graph with a fixed source and sink. The edges of this graph model precedence constraints and the jobs have to be scheduled with respect to those. We introduce the server cloud scheduling problem, in which the jobs have to be processed either on a single local machine or on one of infinitely many cloud machines. For each job, processing times both on the server and in the cloud are given. Furthermore, for each edge in the task graph, a communication delay is included in the input and has to be taken into account if one of the two jobs is scheduled on the server and the other in the cloud. The server processes jobs sequentially, whereas the cloud can serve as many as needed in parallel, but induces costs. We consider both makespan and cost minimization. The main results are an FPTAS for the makespan objective for graphs with a constant source and sink dividing cut and strong hardness for the case with unit processing times and delays.</jats:p>","lang":"eng"}],"publication":"Algorithmica","department":[{"_id":"63"}],"keyword":["Applied Mathematics","Computer Science Applications","General Computer Science"],"type":"journal_article","date_created":"2024-01-11T11:10:53Z","publication_status":"published","date_updated":"2024-01-11T11:19:33Z","publication_identifier":{"issn":["0178-4617","1432-0541"]},"author":[{"id":"88252","last_name":"Maack","first_name":"Marten","full_name":"Maack, Marten"},{"id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"full_name":"Pukrop, Simon","last_name":"Pukrop","first_name":"Simon","id":"44428"}],"title":"Server Cloud Scheduling","year":"2023","doi":"10.1007/s00453-023-01189-x","language":[{"iso":"eng"}]},{"publication":"2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS)","citation":{"apa":"Deppert, M. A., Jansen, K., Maack, M., Pukrop, S., &#38; Rau, M. (2023). Scheduling with Many Shared Resources. <i>2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>. <a href=\"https://doi.org/10.1109/ipdps54959.2023.00049\">https://doi.org/10.1109/ipdps54959.2023.00049</a>","ieee":"M. A. Deppert, K. Jansen, M. Maack, S. Pukrop, and M. Rau, “Scheduling with Many Shared Resources,” 2023, doi: <a href=\"https://doi.org/10.1109/ipdps54959.2023.00049\">10.1109/ipdps54959.2023.00049</a>.","short":"M.A. Deppert, K. Jansen, M. Maack, S. Pukrop, M. Rau, in: 2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS), IEEE, 2023.","chicago":"Deppert, Max A., Klaus Jansen, Marten Maack, Simon Pukrop, and Malin Rau. “Scheduling with Many Shared Resources.” In <i>2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>. IEEE, 2023. <a href=\"https://doi.org/10.1109/ipdps54959.2023.00049\">https://doi.org/10.1109/ipdps54959.2023.00049</a>.","mla":"Deppert, Max A., et al. “Scheduling with Many Shared Resources.” <i>2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>, IEEE, 2023, doi:<a href=\"https://doi.org/10.1109/ipdps54959.2023.00049\">10.1109/ipdps54959.2023.00049</a>.","ama":"Deppert MA, Jansen K, Maack M, Pukrop S, Rau M. Scheduling with Many Shared Resources. In: <i>2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>. IEEE; 2023. doi:<a href=\"https://doi.org/10.1109/ipdps54959.2023.00049\">10.1109/ipdps54959.2023.00049</a>","bibtex":"@inproceedings{Deppert_Jansen_Maack_Pukrop_Rau_2023, title={Scheduling with Many Shared Resources}, DOI={<a href=\"https://doi.org/10.1109/ipdps54959.2023.00049\">10.1109/ipdps54959.2023.00049</a>}, booktitle={2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS)}, publisher={IEEE}, author={Deppert, Max A. and Jansen, Klaus and Maack, Marten and Pukrop, Simon and Rau, Malin}, year={2023} }"},"project":[{"grant_number":"160364472","_id":"1","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten "},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"grant_number":"160364472","_id":"16","name":"SFB 901 - C4: SFB 901 - On-The-Fly Compute Centers II: Ausführung komponierter Dienste in konfigurierbaren Rechenzentren (Subproject C4)"}],"date_created":"2024-01-11T11:30:14Z","type":"conference","department":[{"_id":"63"}],"year":"2023","title":"Scheduling with Many Shared Resources","status":"public","author":[{"first_name":"Max A.","last_name":"Deppert","full_name":"Deppert, Max A."},{"last_name":"Jansen","first_name":"Klaus","full_name":"Jansen, Klaus"},{"id":"88252","full_name":"Maack, Marten","first_name":"Marten","last_name":"Maack"},{"id":"44428","last_name":"Pukrop","first_name":"Simon","full_name":"Pukrop, Simon"},{"first_name":"Malin","last_name":"Rau","full_name":"Rau, Malin"}],"publication_status":"published","date_updated":"2024-01-11T11:31:11Z","_id":"50460","publisher":"IEEE","language":[{"iso":"eng"}],"user_id":"44428","doi":"10.1109/ipdps54959.2023.00049"},{"place":"Cham","citation":{"apa":"Qudus, U., Röder, M., Kirrane, S., &#38; Ngomo, A.-C. N. (2023). TemporalFC: A Temporal Fact Checking Approach over Knowledge Graphs. In T. R. Payne, V. Presutti, G. Qi, M. Poveda-Villalón, G. Stoilos, L. Hollink, Z. Kaoudi, G. Cheng, &#38; J. Li (Eds.), <i>The Semantic Web – ISWC 2023</i> (Vol. 14265, pp. 465–483). Springer, Cham. <a href=\"https://doi.org/10.1007/978-3-031-47240-4_25\">https://doi.org/10.1007/978-3-031-47240-4_25</a>","ieee":"U. Qudus, M. Röder, S. Kirrane, and A.-C. N. Ngomo, “TemporalFC: A Temporal Fact Checking Approach over Knowledge Graphs,” in <i>The Semantic Web – ISWC 2023</i>, Athens, Greece, 2023, vol. 14265, pp. 465–483, doi: <a href=\"https://doi.org/10.1007/978-3-031-47240-4_25\">10.1007/978-3-031-47240-4_25</a>.","chicago":"Qudus, Umair, Michael Röder, Sabrina Kirrane, and Axel-Cyrille Ngonga Ngomo. “TemporalFC: A Temporal Fact Checking Approach over Knowledge Graphs.” In <i>The Semantic Web – ISWC 2023</i>, edited by Terry R. Payne, Valentina Presutti, Guilin Qi, María Poveda-Villalón, Giorgos Stoilos, Laura Hollink, Zoi Kaoudi, Gong Cheng, and Juanzi Li, 14265:465–483.  Lecture Notes in Computer Science. Cham: Springer, Cham, 2023. <a href=\"https://doi.org/10.1007/978-3-031-47240-4_25\">https://doi.org/10.1007/978-3-031-47240-4_25</a>.","short":"U. Qudus, M. Röder, S. Kirrane, A.-C.N. Ngomo, in: T. R. Payne, V. Presutti, G. Qi, M. Poveda-Villalón, G. Stoilos, L. Hollink, Z. Kaoudi, G. Cheng, J. Li (Eds.), The Semantic Web – ISWC 2023, Springer, Cham, Cham, 2023, pp. 465–483.","mla":"Qudus, Umair, et al. “TemporalFC: A Temporal Fact Checking Approach over Knowledge Graphs.” <i>The Semantic Web – ISWC 2023</i>, edited by Terry R. Payne et al., vol. 14265, Springer, Cham, 2023, pp. 465–483, doi:<a href=\"https://doi.org/10.1007/978-3-031-47240-4_25\">10.1007/978-3-031-47240-4_25</a>.","ama":"Qudus U, Röder M, Kirrane S, Ngomo A-CN. TemporalFC: A Temporal Fact Checking Approach over Knowledge Graphs. In: R. Payne T, Presutti V, Qi G, et al., eds. <i>The Semantic Web – ISWC 2023</i>. Vol 14265.  Lecture Notes in Computer Science. Springer, Cham; 2023:465–483. doi:<a href=\"https://doi.org/10.1007/978-3-031-47240-4_25\">10.1007/978-3-031-47240-4_25</a>","bibtex":"@inproceedings{Qudus_Röder_Kirrane_Ngomo_2023, place={Cham}, series={ Lecture Notes in Computer Science}, title={TemporalFC: A Temporal Fact Checking Approach over Knowledge Graphs}, volume={14265}, DOI={<a href=\"https://doi.org/10.1007/978-3-031-47240-4_25\">10.1007/978-3-031-47240-4_25</a>}, booktitle={The Semantic Web – ISWC 2023}, publisher={Springer, Cham}, author={Qudus, Umair and Röder, Michael and Kirrane, Sabrina and Ngomo, Axel-Cyrille Ngonga}, editor={R. Payne, Terry and Presutti, Valentina and Qi, Guilin and Poveda-Villalón, María and Stoilos, Giorgos and Hollink, Laura and Kaoudi, Zoi and Cheng, Gong and Li, Juanzi}, year={2023}, pages={465–483}, collection={ Lecture Notes in Computer Science} }"},"file_date_updated":"2024-01-13T11:25:48Z","project":[{"name":"KnowGraphs: KnowGraphs: Knowledge Graphs at Scale","_id":"410","grant_number":"860801"}],"_id":"50479","publisher":"Springer, Cham","page":"465–483","editor":[{"first_name":"Terry","last_name":"R. Payne","full_name":"R. Payne, Terry"},{"last_name":"Presutti","first_name":"Valentina","full_name":"Presutti, Valentina"},{"first_name":"Guilin","last_name":"Qi","full_name":"Qi, Guilin"},{"full_name":"Poveda-Villalón, María","last_name":"Poveda-Villalón","first_name":"María"},{"full_name":"Stoilos, Giorgos","last_name":"Stoilos","first_name":"Giorgos"},{"full_name":"Hollink, Laura","last_name":"Hollink","first_name":"Laura"},{"full_name":"Kaoudi, Zoi","last_name":"Kaoudi","first_name":"Zoi"},{"last_name":"Cheng","first_name":"Gong","full_name":"Cheng, Gong"},{"full_name":"Li, Juanzi","first_name":"Juanzi","last_name":"Li"}],"volume":14265,"ddc":["006"],"user_id":"83392","conference":{"end_date":"2023-11-10","location":"Athens, Greece","name":"The Semantic Web – ISWC 2023","start_date":"2023-11-06"},"jel":["C"],"status":"public","has_accepted_license":"1","date_created":"2024-01-13T11:22:15Z","file":[{"date_created":"2024-01-13T11:25:48Z","creator":"uqudus","file_id":"50480","success":1,"content_type":"application/pdf","relation":"main_file","date_updated":"2024-01-13T11:25:48Z","file_name":"ISWC 2023 TemporalFC-A Temporal Fact Checking approach over Knowledge Graphs.pdf","access_level":"closed","file_size":1944818}],"department":[{"_id":"34"}],"type":"conference","keyword":["temporal fact checking · ensemble learning · transfer learning · time-point prediction · temporal knowledge graphs"],"publication":"The Semantic Web – ISWC 2023","abstract":[{"text":"Verifying assertions is an essential part of creating and maintaining knowledge graphs. Most often, this task cannot be carried out manually due to the sheer size of modern knowledge graphs. Hence, automatic fact-checking approaches have been proposed over the last decade. These approaches aim to compute automatically whether a given assertion is correct or incorrect. However, most fact-checking approaches are binary classifiers that fail to consider the volatility of some assertions, i.e., the fact that such assertions are only valid at certain times or for specific time intervals. Moreover, the few approaches able to predict when an assertion was valid (i.e., time-point prediction approaches) rely on manual feature engineering. This paper presents TEMPORALFC, a temporal fact-checking approach that uses multiple sources of background knowledge to assess the veracity and temporal validity of a given assertion. We evaluate TEMPORALFC on two datasets and compare it to the state of the art in fact-checking and time-point prediction. Our results suggest that TEMPORALFC outperforms the state of the art on the fact-checking task by 0.13 to 0.15 in terms of Area Under the Receiver Operating Characteristic curve and on the time-point prediction task by 0.25 to 0.27 in terms of Mean Reciprocal Rank. Our code is open-source and can be found at https://github.com/dice-group/TemporalFC.","lang":"eng"}],"language":[{"iso":"eng"}],"series_title":" Lecture Notes in Computer Science","doi":"10.1007/978-3-031-47240-4_25","author":[{"full_name":"Qudus, Umair","first_name":"Umair","last_name":"Qudus"},{"full_name":"Röder, Michael","first_name":"Michael","last_name":"Röder"},{"full_name":"Kirrane, Sabrina","last_name":"Kirrane","first_name":"Sabrina"},{"full_name":"Ngomo, Axel-Cyrille Ngonga","first_name":"Axel-Cyrille Ngonga","last_name":"Ngomo"}],"publication_identifier":{"isbn":["9783031472398","9783031472404"],"issn":["0302-9743","1611-3349"]},"year":"2023","title":"TemporalFC: A Temporal Fact Checking Approach over Knowledge Graphs","intvolume":"     14265","date_updated":"2024-01-13T11:48:28Z","publication_status":"published"},{"date_updated":"2024-01-22T09:56:42Z","author":[{"first_name":"Lennart","last_name":"Van Hirtum","full_name":"Van Hirtum, Lennart"},{"first_name":"Patrick","last_name":"De Causmaecker","full_name":"De Causmaecker, Patrick"},{"last_name":"Goemaere","first_name":"Jens","full_name":"Goemaere, Jens"},{"id":"3145","first_name":"Tobias","last_name":"Kenter","full_name":"Kenter, Tobias"},{"id":"8961","full_name":"Riebler, Heinrich","first_name":"Heinrich","last_name":"Riebler"},{"full_name":"Lass, Michael","last_name":"Lass","orcid":"0000-0002-5708-7632","first_name":"Michael","id":"24135"},{"last_name":"Plessl","first_name":"Christian","orcid":"0000-0001-5728-9982","full_name":"Plessl, Christian","id":"16153"}],"status":"public","year":"2023","title":"A computation of D(9) using FPGA Supercomputing","user_id":"3145","language":[{"iso":"eng"}],"_id":"43439","project":[{"_id":"52","name":"PC2: Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"abstract":[{"text":"This preprint makes the claim of having computed the $9^{th}$ Dedekind\r\nNumber. This was done by building an efficient FPGA Accelerator for the core\r\noperation of the process, and parallelizing it on the Noctua 2 Supercluster at\r\nPaderborn University. The resulting value is\r\n286386577668298411128469151667598498812366. This value can be verified in two\r\nsteps. We have made the data file containing the 490M results available, each\r\nof which can be verified separately on CPU, and the whole file sums to our\r\nproposed value.","lang":"eng"}],"citation":{"apa":"Van Hirtum, L., De Causmaecker, P., Goemaere, J., Kenter, T., Riebler, H., Lass, M., &#38; Plessl, C. (2023). A computation of D(9) using FPGA Supercomputing. In <i>arXiv:2304.03039</i>.","ieee":"L. Van Hirtum <i>et al.</i>, “A computation of D(9) using FPGA Supercomputing,” <i>arXiv:2304.03039</i>. 2023.","chicago":"Van Hirtum, Lennart, Patrick De Causmaecker, Jens Goemaere, Tobias Kenter, Heinrich Riebler, Michael Lass, and Christian Plessl. “A Computation of D(9) Using FPGA Supercomputing.” <i>ArXiv:2304.03039</i>, 2023.","short":"L. Van Hirtum, P. De Causmaecker, J. Goemaere, T. Kenter, H. Riebler, M. Lass, C. Plessl, ArXiv:2304.03039 (2023).","mla":"Van Hirtum, Lennart, et al. “A Computation of D(9) Using FPGA Supercomputing.” <i>ArXiv:2304.03039</i>, 2023.","ama":"Van Hirtum L, De Causmaecker P, Goemaere J, et al. A computation of D(9) using FPGA Supercomputing. <i>arXiv:230403039</i>. Published online 2023.","bibtex":"@article{Van Hirtum_De Causmaecker_Goemaere_Kenter_Riebler_Lass_Plessl_2023, title={A computation of D(9) using FPGA Supercomputing}, journal={arXiv:2304.03039}, author={Van Hirtum, Lennart and De Causmaecker, Patrick and Goemaere, Jens and Kenter, Tobias and Riebler, Heinrich and Lass, Michael and Plessl, Christian}, year={2023} }"},"publication":"arXiv:2304.03039","department":[{"_id":"27"},{"_id":"518"}],"type":"preprint","date_created":"2023-04-08T11:05:29Z","external_id":{"arxiv":["2304.03039"]}},{"citation":{"mla":"Graf, Lara Marie, et al. “Insights into Out-of-Field Teachers’ Self-Reports: Fostering the Understanding of Addition and Subtraction as a Basis for Children to Overcome Difficulties in Mathematics.” <i>Proceedings of the Thirteenth Congress of the European Society for Research in Mathematics Education (CERME13)</i>, edited by P. Drijvers et al., 2023, pp. 3203–10.","bibtex":"@inproceedings{Graf_Häsel-Weide_Höveler_Nührenbörger_2023, title={Insights into out-of-field teachers’ self-reports: Fostering the understanding of addition and subtraction as a basis for children to overcome difficulties in mathematics}, booktitle={Proceedings of the Thirteenth Congress of the European Society for Research in Mathematics Education (CERME13)}, author={Graf, Lara Marie and Häsel-Weide, Uta and Höveler, K. and Nührenbörger, M.}, editor={Drijvers, P. and Csapodi, C. and Palmér, H. and Gosztonyi, K. and Kónya, E. and Alfréd Rényi Institute of Mathematics and ERME}, year={2023}, pages={3203–3210} }","ama":"Graf LM, Häsel-Weide U, Höveler K, Nührenbörger M. Insights into out-of-field teachers’ self-reports: Fostering the understanding of addition and subtraction as a basis for children to overcome difficulties in mathematics. In: Drijvers P, Csapodi C, Palmér H, Gosztonyi K, Kónya E, Alfréd Rényi Institute of Mathematics and ERME, eds. <i>Proceedings of the Thirteenth Congress of the European Society for Research in Mathematics Education (CERME13)</i>. ; 2023:3203-3210.","ieee":"L. M. Graf, U. Häsel-Weide, K. Höveler, and M. Nührenbörger, “Insights into out-of-field teachers’ self-reports: Fostering the understanding of addition and subtraction as a basis for children to overcome difficulties in mathematics,” in <i>Proceedings of the Thirteenth Congress of the European Society for Research in Mathematics Education (CERME13)</i>, 2023, pp. 3203–3210.","apa":"Graf, L. M., Häsel-Weide, U., Höveler, K., &#38; Nührenbörger, M. (2023). Insights into out-of-field teachers’ self-reports: Fostering the understanding of addition and subtraction as a basis for children to overcome difficulties in mathematics. In P. Drijvers, C. Csapodi, H. Palmér, K. Gosztonyi, E. Kónya, &#38; Alfréd Rényi Institute of Mathematics and ERME (Eds.), <i>Proceedings of the Thirteenth Congress of the European Society for Research in Mathematics Education (CERME13)</i> (pp. 3203–3210).","chicago":"Graf, Lara Marie, Uta Häsel-Weide, K. Höveler, and M. Nührenbörger. “Insights into Out-of-Field Teachers’ Self-Reports: Fostering the Understanding of Addition and Subtraction as a Basis for Children to Overcome Difficulties in Mathematics.” In <i>Proceedings of the Thirteenth Congress of the European Society for Research in Mathematics Education (CERME13)</i>, edited by P. Drijvers, C. Csapodi, H. Palmér, K. Gosztonyi, E. Kónya, and Alfréd Rényi Institute of Mathematics and ERME, 3203–10, 2023.","short":"L.M. Graf, U. Häsel-Weide, K. Höveler, M. Nührenbörger, in: P. Drijvers, C. Csapodi, H. Palmér, K. Gosztonyi, E. Kónya, Alfréd Rényi Institute of Mathematics and ERME (Eds.), Proceedings of the Thirteenth Congress of the European Society for Research in Mathematics Education (CERME13), 2023, pp. 3203–3210."},"publication":"Proceedings of the Thirteenth Congress of the European Society for Research in Mathematics Education (CERME13)","department":[{"_id":"543"}],"type":"conference","date_created":"2024-02-05T08:47:35Z","date_updated":"2024-02-05T08:55:43Z","author":[{"full_name":"Graf, Lara Marie","first_name":"Lara Marie","last_name":"Graf","id":"89837"},{"id":"60267","full_name":"Häsel-Weide, Uta","first_name":"Uta","last_name":"Häsel-Weide"},{"full_name":"Höveler, K.","last_name":"Höveler","first_name":"K."},{"last_name":"Nührenbörger","first_name":"M.","full_name":"Nührenbörger, M."}],"corporate_editor":["Alfréd Rényi Institute of Mathematics and ERME"],"year":"2023","title":"Insights into out-of-field teachers’ self-reports: Fostering the understanding of addition and subtraction as a basis for children to overcome difficulties in mathematics","status":"public","editor":[{"first_name":"P.","last_name":"Drijvers","full_name":"Drijvers, P."},{"first_name":"C.","last_name":"Csapodi","full_name":"Csapodi, C."},{"full_name":"Palmér, H.","last_name":"Palmér","first_name":"H."},{"full_name":"Gosztonyi, K.","first_name":"K.","last_name":"Gosztonyi"},{"full_name":"Kónya, E.","first_name":"E.","last_name":"Kónya"}],"user_id":"14931","_id":"51131","language":[{"iso":"eng"}],"page":"3203-3210"},{"date_updated":"2024-02-06T08:52:07Z","author":[{"id":"97916","last_name":"Amakor","first_name":"Augustina Chidinma","full_name":"Amakor, Augustina Chidinma"},{"id":"56399","last_name":"Sonntag","first_name":"Konstantin","full_name":"Sonntag, Konstantin"},{"id":"47427","last_name":"Peitz","orcid":"0000-0002-3389-793X","first_name":"Sebastian","full_name":"Peitz, Sebastian"}],"status":"public","title":"A multiobjective continuation method to compute the regularization path of deep neural networks","year":"2023","user_id":"47427","language":[{"iso":"eng"}],"_id":"51159","main_file_link":[{"open_access":"1","url":"https://arxiv.org/pdf/2308.12044.pdf"}],"abstract":[{"lang":"eng","text":"Sparsity is a highly desired feature in deep neural networks (DNNs) since it ensures numerical efficiency, improves the interpretability of models (due to the smaller number of relevant features), and robustness. In machine learning approaches based on linear models, it is well known that there exists a connecting path between the sparsest solution in terms of the $\\ell^1$ norm,i.e., zero weights and the non-regularized solution, which is called the regularization path. Very recently, there was a first attempt to extend the concept of regularization paths to DNNs by means of treating the empirical loss and sparsity ($\\ell^1$ norm) as two conflicting criteria and solving the resulting multiobjective optimization problem. However, due to the non-smoothness of the $\\ell^1$ norm and the high number of parameters, this approach is not very efficient from a computational perspective. To overcome this limitation, we present an algorithm that allows for the approximation of the entire Pareto front for the above-mentioned objectives in a very efficient manner. We present numerical examples using both deterministic and stochastic gradients. We furthermore demonstrate that knowledge of the regularization path allows for a well-generalizing network parametrization."}],"citation":{"bibtex":"@article{Amakor_Sonntag_Peitz_2023, title={A multiobjective continuation method to compute the regularization path of deep neural networks}, journal={arXiv}, author={Amakor, Augustina Chidinma and Sonntag, Konstantin and Peitz, Sebastian}, year={2023} }","ama":"Amakor AC, Sonntag K, Peitz S. A multiobjective continuation method to compute the regularization path of deep neural networks. <i>arXiv</i>. Published online 2023.","mla":"Amakor, Augustina Chidinma, et al. “A Multiobjective Continuation Method to Compute the Regularization Path of Deep Neural Networks.” <i>ArXiv</i>, 2023.","short":"A.C. Amakor, K. Sonntag, S. Peitz, ArXiv (2023).","chicago":"Amakor, Augustina Chidinma, Konstantin Sonntag, and Sebastian Peitz. “A Multiobjective Continuation Method to Compute the Regularization Path of Deep Neural Networks.” <i>ArXiv</i>, 2023.","ieee":"A. C. Amakor, K. Sonntag, and S. Peitz, “A multiobjective continuation method to compute the regularization path of deep neural networks,” <i>arXiv</i>. 2023.","apa":"Amakor, A. C., Sonntag, K., &#38; Peitz, S. (2023). A multiobjective continuation method to compute the regularization path of deep neural networks. In <i>arXiv</i>."},"publication":"arXiv","oa":"1","department":[{"_id":"655"}],"type":"preprint","date_created":"2024-02-06T08:51:00Z"},{"date_updated":"2024-02-06T08:50:32Z","author":[{"full_name":"Philipp, Friedrich","last_name":"Philipp","first_name":"Friedrich"},{"full_name":"Schaller, Manuel","first_name":"Manuel","last_name":"Schaller"},{"last_name":"Worthmann","first_name":"Karl","full_name":"Worthmann, Karl"},{"id":"47427","first_name":"Sebastian","orcid":"0000-0002-3389-793X","last_name":"Peitz","full_name":"Peitz, Sebastian"},{"first_name":"Feliks","last_name":"Nüske","full_name":"Nüske, Feliks"}],"status":"public","title":"Error analysis of kernel EDMD for prediction and control in the Koopman  framework","year":"2023","user_id":"47427","language":[{"iso":"eng"}],"_id":"51158","main_file_link":[{"url":"https://arxiv.org/pdf/2312.10460.pdf","open_access":"1"}],"abstract":[{"lang":"eng","text":"Extended Dynamic Mode Decomposition (EDMD) is a popular data-driven method to\r\napproximate the Koopman operator for deterministic and stochastic (control)\r\nsystems. This operator is linear and encompasses full information on the\r\n(expected stochastic) dynamics. In this paper, we analyze a kernel-based EDMD\r\nalgorithm, known as kEDMD, where the dictionary consists of the canonical\r\nkernel features at the data points. The latter are acquired by i.i.d. samples\r\nfrom a user-defined and application-driven distribution on a compact set. We\r\nprove bounds on the prediction error of the kEDMD estimator when sampling from\r\nthis (not necessarily ergodic) distribution. The error analysis is further\r\nextended to control-affine systems, where the considered invariance of the\r\nReproducing Kernel Hilbert Space is significantly less restrictive in\r\ncomparison to invariance assumptions on an a-priori chosen dictionary."}],"citation":{"chicago":"Philipp, Friedrich, Manuel Schaller, Karl Worthmann, Sebastian Peitz, and Feliks Nüske. “Error Analysis of Kernel EDMD for Prediction and Control in the Koopman  Framework.” <i>ArXiv:2312.10460</i>, 2023.","short":"F. Philipp, M. Schaller, K. Worthmann, S. Peitz, F. Nüske, ArXiv:2312.10460 (2023).","ieee":"F. Philipp, M. Schaller, K. Worthmann, S. Peitz, and F. Nüske, “Error analysis of kernel EDMD for prediction and control in the Koopman  framework,” <i>arXiv:2312.10460</i>. 2023.","apa":"Philipp, F., Schaller, M., Worthmann, K., Peitz, S., &#38; Nüske, F. (2023). Error analysis of kernel EDMD for prediction and control in the Koopman  framework. In <i>arXiv:2312.10460</i>.","bibtex":"@article{Philipp_Schaller_Worthmann_Peitz_Nüske_2023, title={Error analysis of kernel EDMD for prediction and control in the Koopman  framework}, journal={arXiv:2312.10460}, author={Philipp, Friedrich and Schaller, Manuel and Worthmann, Karl and Peitz, Sebastian and Nüske, Feliks}, year={2023} }","ama":"Philipp F, Schaller M, Worthmann K, Peitz S, Nüske F. Error analysis of kernel EDMD for prediction and control in the Koopman  framework. <i>arXiv:231210460</i>. Published online 2023.","mla":"Philipp, Friedrich, et al. “Error Analysis of Kernel EDMD for Prediction and Control in the Koopman  Framework.” <i>ArXiv:2312.10460</i>, 2023."},"publication":"arXiv:2312.10460","department":[{"_id":"655"}],"oa":"1","type":"preprint","date_created":"2024-02-06T08:49:50Z","external_id":{"arxiv":["2312.10460"]}},{"status":"public","year":"2023","title":"Absence of principal eigenvalues for higher rank locally symmetric  spaces","publication_identifier":{"unknown":["1275-1295"]},"author":[{"first_name":"Tobias","orcid":"0000-0002-9648-6919","last_name":"Weich","full_name":"Weich, Tobias","id":"49178"},{"first_name":"Lasse Lennart","last_name":"Wolf","full_name":"Wolf, Lasse Lennart","id":"45027"}],"date_updated":"2024-02-06T20:52:40Z","intvolume":"       403","language":[{"iso":"eng"}],"_id":"31189","doi":"https://doi.org/10.1007/s00220-023-04819-1","user_id":"49178","volume":403,"publication":"Communications in Mathematical Physics","citation":{"ieee":"T. Weich and L. L. Wolf, “Absence of principal eigenvalues for higher rank locally symmetric  spaces,” <i>Communications in Mathematical Physics</i>, vol. 403, 2023, doi: <a href=\"https://doi.org/10.1007/s00220-023-04819-1\">https://doi.org/10.1007/s00220-023-04819-1</a>.","apa":"Weich, T., &#38; Wolf, L. L. (2023). Absence of principal eigenvalues for higher rank locally symmetric  spaces. <i>Communications in Mathematical Physics</i>, <i>403</i>. <a href=\"https://doi.org/10.1007/s00220-023-04819-1\">https://doi.org/10.1007/s00220-023-04819-1</a>","mla":"Weich, Tobias, and Lasse Lennart Wolf. “Absence of Principal Eigenvalues for Higher Rank Locally Symmetric  Spaces.” <i>Communications in Mathematical Physics</i>, vol. 403, 2023, doi:<a href=\"https://doi.org/10.1007/s00220-023-04819-1\">https://doi.org/10.1007/s00220-023-04819-1</a>.","bibtex":"@article{Weich_Wolf_2023, title={Absence of principal eigenvalues for higher rank locally symmetric  spaces}, volume={403}, DOI={<a href=\"https://doi.org/10.1007/s00220-023-04819-1\">https://doi.org/10.1007/s00220-023-04819-1</a>}, journal={Communications in Mathematical Physics}, author={Weich, Tobias and Wolf, Lasse Lennart}, year={2023} }","ama":"Weich T, Wolf LL. Absence of principal eigenvalues for higher rank locally symmetric  spaces. <i>Communications in Mathematical Physics</i>. 2023;403. doi:<a href=\"https://doi.org/10.1007/s00220-023-04819-1\">https://doi.org/10.1007/s00220-023-04819-1</a>","short":"T. Weich, L.L. Wolf, Communications in Mathematical Physics 403 (2023).","chicago":"Weich, Tobias, and Lasse Lennart Wolf. “Absence of Principal Eigenvalues for Higher Rank Locally Symmetric  Spaces.” <i>Communications in Mathematical Physics</i> 403 (2023). <a href=\"https://doi.org/10.1007/s00220-023-04819-1\">https://doi.org/10.1007/s00220-023-04819-1</a>."},"abstract":[{"lang":"eng","text":"Given a geometrically finite hyperbolic surface of infinite volume it is a\r\nclassical result of Patterson that the positive Laplace-Beltrami operator has\r\nno $L^2$-eigenvalues $\\geq 1/4$. In this article we prove a generalization of\r\nthis result for the joint $L^2$-eigenvalues of the algebra of commuting\r\ndifferential operators on Riemannian locally symmetric spaces $\\Gamma\\backslash\r\nG/K$ of higher rank. We derive dynamical assumptions on the $\\Gamma$-action on\r\nthe geodesic and the Satake compactifications which imply the absence of the\r\ncorresponding principal eigenvalues. A large class of examples fulfilling these\r\nassumptions are the non-compact quotients by Anosov subgroups."}],"external_id":{"arxiv":["2205.03167"]},"date_created":"2022-05-11T10:38:11Z","type":"journal_article","department":[{"_id":"10"},{"_id":"548"},{"_id":"623"}]},{"abstract":[{"lang":"eng","text":"As technology advances, Unmanned Aerial Vehicles ( UAVs) have emerged as an innovative solution to a variety of problems in many fields. Automated control of UAVs is most common in large area operations, but they may also increase the versatility of smart home compositions by acting as a physical helper. For example, a voice- controlled UAV could act as an intelligent aerial assistant that can be seamlessly integrated into smart home systems. In this paper, we present a novel Augmented Reality (AR )-based UAV control that provides high-level control over a UAV by automating common UAV missions. In our work, we enable users to operate a small UAV hands-free using only a small set of voice commands. To help users identify the targets, and to understand the UAV ’s intentions, targets within the user’s field of vision are highlighted in an AR interface. We evaluate our approach in a user study (n=26) regarding usability, physical and mental demand, as well as a focus on the users’ preferences. Our study showed that the use of the proposed control was not only accepted, but some users stated that they would use such a system at home to help with some tasks at home\r\n"}],"citation":{"ama":"Helmert R, Hardes T, Yigitbas E. Design and Evaluation of an AR Voice-based Indoor UAV Assistant for Smart Home Scenarios. In: <i>Proceedings of the ACM Symposium on Spatial User Interaction (SUI 2023)</i>. ACM; 2023.","short":"R. Helmert, T. Hardes, E. Yigitbas, in: Proceedings of the ACM Symposium on Spatial User Interaction (SUI 2023), ACM, 2023.","chicago":"Helmert, Robin, Tobias Hardes, and Enes Yigitbas. “Design and Evaluation of an AR Voice-Based Indoor UAV Assistant for Smart Home Scenarios.” In <i>Proceedings of the ACM Symposium on Spatial User Interaction (SUI 2023)</i>. ACM, 2023.","bibtex":"@inproceedings{Helmert_Hardes_Yigitbas_2023, title={Design and Evaluation of an AR Voice-based Indoor UAV Assistant for Smart Home Scenarios}, booktitle={Proceedings of the ACM Symposium on Spatial User Interaction (SUI 2023)}, publisher={ACM}, author={Helmert, Robin and Hardes, Tobias and Yigitbas, Enes}, year={2023} }","mla":"Helmert, Robin, et al. “Design and Evaluation of an AR Voice-Based Indoor UAV Assistant for Smart Home Scenarios.” <i>Proceedings of the ACM Symposium on Spatial User Interaction (SUI 2023)</i>, ACM, 2023.","apa":"Helmert, R., Hardes, T., &#38; Yigitbas, E. (2023). Design and Evaluation of an AR Voice-based Indoor UAV Assistant for Smart Home Scenarios. <i>Proceedings of the ACM Symposium on Spatial User Interaction (SUI 2023)</i>. ACM Symposium on Spatial User Interaction,  Sydney, Australia .","ieee":"R. Helmert, T. Hardes, and E. Yigitbas, “Design and Evaluation of an AR Voice-based Indoor UAV Assistant for Smart Home Scenarios,” presented at the ACM Symposium on Spatial User Interaction,  Sydney, Australia , 2023."},"publication":"Proceedings of the ACM Symposium on Spatial User Interaction (SUI 2023)","department":[{"_id":"66"},{"_id":"534"}],"type":"conference","date_created":"2023-09-14T07:57:37Z","publication_status":"published","date_updated":"2024-02-08T07:58:15Z","author":[{"first_name":"Robin","last_name":"Helmert","full_name":"Helmert, Robin"},{"full_name":"Hardes, Tobias","last_name":"Hardes","first_name":"Tobias","id":"35441"},{"last_name":"Yigitbas","orcid":"0000-0002-5967-833X","first_name":"Enes","full_name":"Yigitbas, Enes","id":"8447"}],"conference":{"location":" Sydney, Australia ","start_date":"2023-10-13","name":"ACM Symposium on Spatial User Interaction","end_date":"As technology advances, Unmanned Aerial Vehicles ( UAVs) have emerged as an innovative solution to a variety of problems in many fields. Automated control of UAVs is most common in large area operations, but they may also increase the versatility of smart home compositions by acting as a physical helper. For example, a voice- controlled UAV could act as an intelligent aerial assistant that can be seamlessly integrated into smart home systems. In this paper, we present a novel Augmented Reality (AR )-based UAV control that provides high-level control over a UAV by automating common UAV missions. In our work, we enable users to operate a small UAV hands-free using only a small set of voice commands. To help users identify the targets, and to understand the UAV ’s intentions, targets within the user’s field of vision are highlighted in an AR interface. We evaluate our approach in a user study (n=26) regarding usability, physical and mental demand, as well as a focus on the users’ preferences. Our study showed that the use of the proposed control was not only accepted, but some users stated that they would use such a system at home to help with some tasks at home"},"status":"public","title":"Design and Evaluation of an AR Voice-based Indoor UAV Assistant for Smart Home Scenarios","year":"2023","user_id":"35441","_id":"47049","language":[{"iso":"eng"}],"publisher":"ACM"},{"citation":{"short":"P. Schütte, T. Weich, ArXiv:2308.13463 (2023).","chicago":"Schütte, Philipp, and Tobias Weich. “Invariant Ruelle Distributions on Convex-Cocompact Hyperbolic Surfaces  -- A Numerical Algorithm via Weighted Zeta Functions.” <i>ArXiv:2308.13463</i>, 2023.","ieee":"P. Schütte and T. Weich, “Invariant Ruelle Distributions on Convex-Cocompact Hyperbolic Surfaces  -- A Numerical Algorithm via Weighted Zeta Functions,” <i>arXiv:2308.13463</i>. 2023.","apa":"Schütte, P., &#38; Weich, T. (2023). Invariant Ruelle Distributions on Convex-Cocompact Hyperbolic Surfaces  -- A Numerical Algorithm via Weighted Zeta Functions. In <i>arXiv:2308.13463</i>.","bibtex":"@article{Schütte_Weich_2023, title={Invariant Ruelle Distributions on Convex-Cocompact Hyperbolic Surfaces  -- A Numerical Algorithm via Weighted Zeta Functions}, journal={arXiv:2308.13463}, author={Schütte, Philipp and Weich, Tobias}, year={2023} }","ama":"Schütte P, Weich T. Invariant Ruelle Distributions on Convex-Cocompact Hyperbolic Surfaces  -- A Numerical Algorithm via Weighted Zeta Functions. <i>arXiv:230813463</i>. Published online 2023.","mla":"Schütte, Philipp, and Tobias Weich. “Invariant Ruelle Distributions on Convex-Cocompact Hyperbolic Surfaces  -- A Numerical Algorithm via Weighted Zeta Functions.” <i>ArXiv:2308.13463</i>, 2023."},"publication":"arXiv:2308.13463","abstract":[{"lang":"eng","text":"We present a numerical algorithm for the computation of invariant Ruelle\r\ndistributions on convex co-compact hyperbolic surfaces. This is achieved by\r\nexploiting the connection between invariant Ruelle distributions and residues\r\nof meromorphically continued weighted zeta functions established by the authors\r\ntogether with Barkhofen (2021). To make this applicable for numerics we express\r\nthe weighted zeta as the logarithmic derivative of a suitable parameter\r\ndependent Fredholm determinant similar to Borthwick (2014). As an additional\r\ndifficulty our transfer operator has to include a contracting direction which\r\nwe account for with techniques developed by Rugh (1992). We achieve a further\r\nimprovement in convergence speed for our algorithm in the case of surfaces with\r\nadditional symmetries by proving and applying a symmetry reduction of weighted\r\nzeta functions."}],"date_created":"2024-02-06T20:58:35Z","external_id":{"arxiv":["2308.13463"]},"department":[{"_id":"10"},{"_id":"623"},{"_id":"548"}],"type":"preprint","author":[{"id":"50168","last_name":"Schütte","first_name":"Philipp","full_name":"Schütte, Philipp"},{"id":"49178","last_name":"Weich","first_name":"Tobias","orcid":"0000-0002-9648-6919","full_name":"Weich, Tobias"}],"year":"2023","status":"public","title":"Invariant Ruelle Distributions on Convex-Cocompact Hyperbolic Surfaces  -- A Numerical Algorithm via Weighted Zeta Functions","date_updated":"2024-02-11T19:56:01Z","_id":"51206","language":[{"iso":"eng"}],"user_id":"49178"},{"intvolume":"       337","publication_status":"published","date_updated":"2024-02-14T17:33:59Z","publication_identifier":{"issn":["0166-218X"]},"author":[{"id":"15548","last_name":"Steffen","first_name":"Eckhard","orcid":"0000-0002-9808-7401","full_name":"Steffen, Eckhard"},{"id":"88145","last_name":"Wolf","first_name":"Isaak Hieronymus","full_name":"Wolf, Isaak Hieronymus"}],"year":"2023","title":"Bounds for the chromatic index of signed multigraphs","doi":"10.1016/j.dam.2023.05.008","language":[{"iso":"eng"}],"publication":"Discrete Applied Mathematics","department":[{"_id":"542"}],"keyword":["Applied Mathematics","Discrete Mathematics and Combinatorics"],"type":"journal_article","date_created":"2024-02-14T17:33:29Z","status":"public","volume":337,"user_id":"15540","publisher":"Elsevier BV","_id":"51351","page":"185-189","citation":{"bibtex":"@article{Steffen_Wolf_2023, title={Bounds for the chromatic index of signed multigraphs}, volume={337}, DOI={<a href=\"https://doi.org/10.1016/j.dam.2023.05.008\">10.1016/j.dam.2023.05.008</a>}, journal={Discrete Applied Mathematics}, publisher={Elsevier BV}, author={Steffen, Eckhard and Wolf, Isaak Hieronymus}, year={2023}, pages={185–189} }","ama":"Steffen E, Wolf IH. Bounds for the chromatic index of signed multigraphs. <i>Discrete Applied Mathematics</i>. 2023;337:185-189. doi:<a href=\"https://doi.org/10.1016/j.dam.2023.05.008\">10.1016/j.dam.2023.05.008</a>","mla":"Steffen, Eckhard, and Isaak Hieronymus Wolf. “Bounds for the Chromatic Index of Signed Multigraphs.” <i>Discrete Applied Mathematics</i>, vol. 337, Elsevier BV, 2023, pp. 185–89, doi:<a href=\"https://doi.org/10.1016/j.dam.2023.05.008\">10.1016/j.dam.2023.05.008</a>.","short":"E. Steffen, I.H. Wolf, Discrete Applied Mathematics 337 (2023) 185–189.","chicago":"Steffen, Eckhard, and Isaak Hieronymus Wolf. “Bounds for the Chromatic Index of Signed Multigraphs.” <i>Discrete Applied Mathematics</i> 337 (2023): 185–89. <a href=\"https://doi.org/10.1016/j.dam.2023.05.008\">https://doi.org/10.1016/j.dam.2023.05.008</a>.","ieee":"E. Steffen and I. H. Wolf, “Bounds for the chromatic index of signed multigraphs,” <i>Discrete Applied Mathematics</i>, vol. 337, pp. 185–189, 2023, doi: <a href=\"https://doi.org/10.1016/j.dam.2023.05.008\">10.1016/j.dam.2023.05.008</a>.","apa":"Steffen, E., &#38; Wolf, I. H. (2023). Bounds for the chromatic index of signed multigraphs. <i>Discrete Applied Mathematics</i>, <i>337</i>, 185–189. <a href=\"https://doi.org/10.1016/j.dam.2023.05.008\">https://doi.org/10.1016/j.dam.2023.05.008</a>"}},{"type":"dissertation","department":[{"_id":"534"},{"_id":"66"}],"oa":"1","date_created":"2024-02-15T09:59:22Z","abstract":[{"lang":"ger","text":"Erfolg und Misserfolg eines Unternehmens werden maßgeblich durch getroffene Entscheidungen beeinflusst. Daher verlassen sich Entscheider oft auf Entscheidungsunterstützungssysteme, die durch Datensimulation, -optimierung und -visualisierung bei der Identifizierung von geeigneten Entscheidungen unterstützen. Für eine optimale Unterstützung muss ein Entscheidungsunterstützungssystem (EUS) jedoch auf den Entscheidungsprozess eines Entscheiders abgestimmt sein und verfügbare Daten, Optimierungsziele, persönliche Präferenzen sowie weitere Einflussfaktoren berücksichtigen. EUS-Entwickler können aufgrund der Komplexität und Volatilität von Geschäftsumgebungen allerdings nicht alle potenziellen Entscheidungsprozesse während des Entwurfs eines EUS vorhersehen, wodurch ein EUS einem Entscheider häufig nur unzureichende Anpassungsmöglichkeiten an den individuellen Entscheidungsprozess bietet. Die Einzelanfertigung eines EUS, das auf einen Entscheidungsprozess zugeschnitten ist, ist ein kosten- und zeitintensives Unterfangen aufgrund der begrenzten Verfügbarkeit von Softwareentwicklern oder Missverständnissen zwischen Entwicklern und Entscheidern während der Entwicklung. Daher geben sich Entscheider möglicherweise mit einem handelsüblichen EUS zufrieden, das nicht vollständig mit ihrem Entscheidungsprozess übereinstimmt, suboptimale Entscheidungen begünstigt und so den Unternehmenserfolg negativ beeinflusst. In dieser Arbeit wird ein Ansatz vorgeschlagen, der es Entscheidern ermöglicht, selbst maßgeschneiderte Entscheidungsunterstützungssysteme zu entwickeln und so die Diskrepanz zwischen benötigter und tatsächlicher Entscheidungsunterstützung zu vermeiden. Dazu stellen EUS-Entwickler einen Teil der EUS-Funktionalität als wiederverwendbare Software-Dienste bereit ..."},{"lang":"eng","text":"Decision making significantly determines the success or failure of a business. This motivates decision makers to rely on decision support systems for assistance in identifying high-quality decisions using data simulation, optimization, and visualization. However, for optimal assistance, a decision support system (DSS) must align with the decision-making process of a decision maker, which is characterized by available data, optimization goals, personal preferences, and other influences. Unfortunately, the increasing complexity and volatility of business environments prevent DSS developers to anticipate all potential decision-making processes during DSS design, and consequently, to provide decision makers with sufficient customization options. Commissioning a DSS that is tailored to a decision-making process is a cost- and time-intensive undertaking due to limited developer availability or misunderstandings between developers and decision makers. As a result, decision makers may settle for an off-the-shelf DSS that does not fully align with their decision-making process and potentially results in suboptimal decisions, thereby impairing business success.This thesis proposes an approach that enables decision makers to create tailored decision support systems themselves, thereby avoiding the aforementioned misalignment between provided and required decision support. The approach expects DSS developers to provide partial DSS functionality in the form of reusable software services. Using a low-code approach, non-programmers can then compose these services into a holistic DSS by modeling a decision-making process with the help of an assistance system. The contribution of the thesis is fourfold: First, the thesis explains how to design a service repository to capture available decision support services for the encompassing application domain. Second ..."}],"citation":{"apa":"Kirchhoff, J. (2023). <i>Decision Support Ecosystems: Assisted Low-Code Development of Tailored Decision Support Systems</i>. Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-1845\">https://doi.org/10.17619/UNIPB/1-1845</a>","ieee":"J. Kirchhoff, <i>Decision Support Ecosystems: Assisted Low-Code Development of Tailored Decision Support Systems</i>. Universität Paderborn, 2023.","chicago":"Kirchhoff, Jonas. <i>Decision Support Ecosystems: Assisted Low-Code Development of Tailored Decision Support Systems</i>. Universität Paderborn, 2023. <a href=\"https://doi.org/10.17619/UNIPB/1-1845\">https://doi.org/10.17619/UNIPB/1-1845</a>.","short":"J. Kirchhoff, Decision Support Ecosystems: Assisted Low-Code Development of Tailored Decision Support Systems, Universität Paderborn, 2023.","mla":"Kirchhoff, Jonas. <i>Decision Support Ecosystems: Assisted Low-Code Development of Tailored Decision Support Systems</i>. Universität Paderborn, 2023, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1845\">10.17619/UNIPB/1-1845</a>.","ama":"Kirchhoff J. <i>Decision Support Ecosystems: Assisted Low-Code Development of Tailored Decision Support Systems</i>. Universität Paderborn; 2023. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1845\">10.17619/UNIPB/1-1845</a>","bibtex":"@book{Kirchhoff_2023, title={Decision Support Ecosystems: Assisted Low-Code Development of Tailored Decision Support Systems}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-1845\">10.17619/UNIPB/1-1845</a>}, publisher={Universität Paderborn}, author={Kirchhoff, Jonas}, year={2023} }"},"supervisor":[{"last_name":"Engels","first_name":"Gregor","full_name":"Engels, Gregor","id":"107"}],"user_id":"39928","doi":"10.17619/UNIPB/1-1845","main_file_link":[{"url":"https://digital.ub.uni-paderborn.de/hs/download/pdf/7319017?originalFilename=true","open_access":"1"}],"publisher":"Universität Paderborn","_id":"51352","language":[{"iso":"eng"}],"date_updated":"2024-02-15T10:03:04Z","status":"public","year":"2023","title":"Decision Support Ecosystems: Assisted Low-Code Development of Tailored Decision Support Systems","author":[{"id":"39928","last_name":"Kirchhoff","first_name":"Jonas","full_name":"Kirchhoff, Jonas"}]},{"publication":"The Digital Twin of Humans","citation":{"ieee":"C. Cappello and E. Steffen, “Graph-Theoretical Models for the Analysis and Design of Socio-Technical Networks,” in <i>The Digital Twin of Humans</i>, Cham: Springer International Publishing, 2023, pp. 93--110.","apa":"Cappello, C., &#38; Steffen, E. (2023). Graph-Theoretical Models for the Analysis and Design of Socio-Technical Networks. In <i>The Digital Twin of Humans</i> (pp. 93--110). Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-031-26104-6_5\">https://doi.org/10.1007/978-3-031-26104-6_5</a>","short":"C. Cappello, E. Steffen, in: The Digital Twin of Humans, Springer International Publishing, Cham, 2023, pp. 93--110.","chicago":"Cappello, Chiara, and Eckhard Steffen. “Graph-Theoretical Models for the Analysis and Design of Socio-Technical Networks.” In <i>The Digital Twin of Humans</i>, 93--110. Cham: Springer International Publishing, 2023. <a href=\"https://doi.org/10.1007/978-3-031-26104-6_5\">https://doi.org/10.1007/978-3-031-26104-6_5</a>.","mla":"Cappello, Chiara, and Eckhard Steffen. “Graph-Theoretical Models for the Analysis and Design of Socio-Technical Networks.” <i>The Digital Twin of Humans</i>, Springer International Publishing, 2023, pp. 93--110, doi:<a href=\"https://doi.org/10.1007/978-3-031-26104-6_5\">10.1007/978-3-031-26104-6_5</a>.","bibtex":"@inbook{Cappello_Steffen_2023, place={Cham}, title={Graph-Theoretical Models for the Analysis and Design of Socio-Technical Networks}, DOI={<a href=\"https://doi.org/10.1007/978-3-031-26104-6_5\">10.1007/978-3-031-26104-6_5</a>}, booktitle={The Digital Twin of Humans}, publisher={Springer International Publishing}, author={Cappello, Chiara and Steffen, Eckhard}, year={2023}, pages={93--110} }","ama":"Cappello C, Steffen E. Graph-Theoretical Models for the Analysis and Design of Socio-Technical Networks. In: <i>The Digital Twin of Humans</i>. Springer International Publishing; 2023:93--110. doi:<a href=\"https://doi.org/10.1007/978-3-031-26104-6_5\">10.1007/978-3-031-26104-6_5</a>"},"type":"book_chapter","department":[{"_id":"542"}],"place":"Cham","date_created":"2023-05-22T10:22:21Z","date_updated":"2024-02-16T07:42:38Z","publication_status":"published","status":"public","title":"Graph-Theoretical Models for the Analysis and Design of Socio-Technical Networks","year":"2023","publication_identifier":{"isbn":["9783031261039","9783031261046"]},"author":[{"last_name":"Cappello","first_name":"Chiara","full_name":"Cappello, Chiara","id":"72874"},{"id":"15548","full_name":"Steffen, Eckhard","orcid":"0000-0002-9808-7401","first_name":"Eckhard","last_name":"Steffen"}],"doi":"10.1007/978-3-031-26104-6_5","user_id":"15540","page":"93--110","publisher":"Springer International Publishing","_id":"45190","language":[{"iso":"eng"}]},{"article_number":"113457","language":[{"iso":"eng"}],"_id":"51357","publisher":"Elsevier BV","user_id":"15540","doi":"10.1016/j.disc.2023.113457","status":"public","year":"2023","title":"Rotation r-graphs","publication_identifier":{"issn":["0012-365X"]},"author":[{"orcid":"0000-0002-9808-7401","first_name":"Eckhard","last_name":"Steffen","full_name":"Steffen, Eckhard","id":"15548"},{"full_name":"Wolf, Isaak Hieronymus","first_name":"Isaak Hieronymus","last_name":"Wolf","id":"88145"}],"publication_status":"published","date_updated":"2024-02-16T08:45:10Z","date_created":"2024-02-16T08:44:50Z","type":"journal_article","keyword":["Discrete Mathematics and Combinatorics","Theoretical Computer Science"],"department":[{"_id":"542"}],"publication":"Discrete Mathematics","citation":{"short":"E. Steffen, I.H. Wolf, Discrete Mathematics (2023).","chicago":"Steffen, Eckhard, and Isaak Hieronymus Wolf. “Rotation R-Graphs.” <i>Discrete Mathematics</i>, 2023. <a href=\"https://doi.org/10.1016/j.disc.2023.113457\">https://doi.org/10.1016/j.disc.2023.113457</a>.","apa":"Steffen, E., &#38; Wolf, I. H. (2023). Rotation r-graphs. <i>Discrete Mathematics</i>, Article 113457. <a href=\"https://doi.org/10.1016/j.disc.2023.113457\">https://doi.org/10.1016/j.disc.2023.113457</a>","ieee":"E. Steffen and I. H. Wolf, “Rotation r-graphs,” <i>Discrete Mathematics</i>, Art. no. 113457, 2023, doi: <a href=\"https://doi.org/10.1016/j.disc.2023.113457\">10.1016/j.disc.2023.113457</a>.","ama":"Steffen E, Wolf IH. Rotation r-graphs. <i>Discrete Mathematics</i>. Published online 2023. doi:<a href=\"https://doi.org/10.1016/j.disc.2023.113457\">10.1016/j.disc.2023.113457</a>","bibtex":"@article{Steffen_Wolf_2023, title={Rotation r-graphs}, DOI={<a href=\"https://doi.org/10.1016/j.disc.2023.113457\">10.1016/j.disc.2023.113457</a>}, number={113457}, journal={Discrete Mathematics}, publisher={Elsevier BV}, author={Steffen, Eckhard and Wolf, Isaak Hieronymus}, year={2023} }","mla":"Steffen, Eckhard, and Isaak Hieronymus Wolf. “Rotation R-Graphs.” <i>Discrete Mathematics</i>, 113457, Elsevier BV, 2023, doi:<a href=\"https://doi.org/10.1016/j.disc.2023.113457\">10.1016/j.disc.2023.113457</a>."}},{"external_id":{"arxiv":["2112.11073"]},"citation":{"short":"C. Arends, J. Hilgert, Journal de l’École Polytechnique — Mathématiques 10 (2023) 335–403.","chicago":"Arends, Christian, and Joachim Hilgert. “Spectral Correspondences for Rank One Locally Symmetric Spaces: The Case of Exceptional Parameters.” <i>Journal de l’École Polytechnique — Mathématiques</i> 10 (2023): 335–403. <a href=\"https://doi.org/10.5802/jep.220\">https://doi.org/10.5802/jep.220</a>.","ieee":"C. Arends and J. Hilgert, “Spectral correspondences for rank one locally symmetric spaces: the case of exceptional parameters,” <i>Journal de l’École polytechnique — Mathématiques</i>, vol. 10, pp. 335–403, 2023, doi: <a href=\"https://doi.org/10.5802/jep.220\">10.5802/jep.220</a>.","apa":"Arends, C., &#38; Hilgert, J. (2023). Spectral correspondences for rank one locally symmetric spaces: the case of exceptional parameters. <i>Journal de l’École Polytechnique — Mathématiques</i>, <i>10</i>, 335–403. <a href=\"https://doi.org/10.5802/jep.220\">https://doi.org/10.5802/jep.220</a>","bibtex":"@article{Arends_Hilgert_2023, title={Spectral correspondences for rank one locally symmetric spaces: the case of exceptional parameters}, volume={10}, DOI={<a href=\"https://doi.org/10.5802/jep.220\">10.5802/jep.220</a>}, journal={Journal de l’École polytechnique — Mathématiques}, author={Arends, Christian and Hilgert, Joachim}, year={2023}, pages={335–403} }","ama":"Arends C, Hilgert J. Spectral correspondences for rank one locally symmetric spaces: the case of exceptional parameters. <i>Journal de l’École polytechnique — Mathématiques</i>. 2023;10:335-403. doi:<a href=\"https://doi.org/10.5802/jep.220\">10.5802/jep.220</a>","mla":"Arends, Christian, and Joachim Hilgert. “Spectral Correspondences for Rank One Locally Symmetric Spaces: The Case of Exceptional Parameters.” <i>Journal de l’École Polytechnique — Mathématiques</i>, vol. 10, 2023, pp. 335–403, doi:<a href=\"https://doi.org/10.5802/jep.220\">10.5802/jep.220</a>."},"_id":"31210","page":"335-403","volume":10,"user_id":"49063","status":"public","date_created":"2022-05-11T12:27:00Z","department":[{"_id":"10"},{"_id":"548"},{"_id":"91"}],"type":"journal_article","keyword":["Ruelle resonances","Poisson transforms","locally symmetric spaces","principal series representations"],"publication":"Journal de l’École polytechnique — Mathématiques","abstract":[{"text":"In this paper we complete the program of relating the Laplace spectrum for\r\nrank one compact locally symmetric spaces with the first band Ruelle-Pollicott\r\nresonances of the geodesic flow on its sphere bundle. This program was started\r\nby Flaminio and Forni for hyperbolic surfaces, continued by Dyatlov, Faure and\r\nGuillarmou for real hyperbolic spaces and by Guillarmou, Hilgert and Weich for\r\ngeneral rank one spaces. Except for the case of hyperbolic surfaces a countable\r\nset of exceptional spectral parameters always left untreated since the\r\ncorresponding Poisson transforms are neither injective nor surjective. We use\r\nvector valued Poisson transforms to treat also the exceptional spectral\r\nparameters. For surfaces the exceptional spectral parameters lead to discrete\r\nseries representations of $\\mathrm{SL}(2,\\mathbb R)$. In higher dimensions the\r\nsituation is more complicated, but can be described completely.","lang":"eng"}],"language":[{"iso":"eng"}],"doi":"10.5802/jep.220","author":[{"full_name":"Arends, Christian","first_name":"Christian","last_name":"Arends","id":"43994"},{"id":"220","full_name":"Hilgert, Joachim","last_name":"Hilgert","first_name":"Joachim"}],"publication_identifier":{"eissn":["2270-518X"],"issn":["2429-7100"]},"title":"Spectral correspondences for rank one locally symmetric spaces: the case of exceptional parameters","year":"2023","intvolume":"        10","publication_status":"published","date_updated":"2024-02-19T06:30:26Z"},{"_id":"46578","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/pdf/2308.01113"}],"user_id":"47427","author":[{"full_name":"Bernreuther, Marco","last_name":"Bernreuther","first_name":"Marco"},{"full_name":"Dellnitz, Michael","last_name":"Dellnitz","first_name":"Michael"},{"id":"32643","last_name":"Gebken","first_name":"Bennet","full_name":"Gebken, Bennet"},{"first_name":"Georg","last_name":"Müller","full_name":"Müller, Georg"},{"id":"47427","full_name":"Peitz, Sebastian","orcid":"0000-0002-3389-793X","last_name":"Peitz","first_name":"Sebastian"},{"id":"56399","full_name":"Sonntag, Konstantin","first_name":"Konstantin","last_name":"Sonntag","orcid":"https://orcid.org/0000-0003-3384-3496"},{"full_name":"Volkwein, Stefan","last_name":"Volkwein","first_name":"Stefan"}],"title":"Multiobjective Optimization of Non-Smooth PDE-Constrained Problems","year":"2023","status":"public","date_updated":"2024-02-21T12:22:20Z","date_created":"2023-08-21T05:50:12Z","external_id":{"arxiv":["2308.01113"]},"oa":"1","department":[{"_id":"655"},{"_id":"101"}],"type":"preprint","citation":{"ama":"Bernreuther M, Dellnitz M, Gebken B, et al. Multiobjective Optimization of Non-Smooth PDE-Constrained Problems. <i>arXiv:230801113</i>. Published online 2023.","bibtex":"@article{Bernreuther_Dellnitz_Gebken_Müller_Peitz_Sonntag_Volkwein_2023, title={Multiobjective Optimization of Non-Smooth PDE-Constrained Problems}, journal={arXiv:2308.01113}, author={Bernreuther, Marco and Dellnitz, Michael and Gebken, Bennet and Müller, Georg and Peitz, Sebastian and Sonntag, Konstantin and Volkwein, Stefan}, year={2023} }","mla":"Bernreuther, Marco, et al. “Multiobjective Optimization of Non-Smooth PDE-Constrained Problems.” <i>ArXiv:2308.01113</i>, 2023.","short":"M. Bernreuther, M. Dellnitz, B. Gebken, G. Müller, S. Peitz, K. Sonntag, S. Volkwein, ArXiv:2308.01113 (2023).","chicago":"Bernreuther, Marco, Michael Dellnitz, Bennet Gebken, Georg Müller, Sebastian Peitz, Konstantin Sonntag, and Stefan Volkwein. “Multiobjective Optimization of Non-Smooth PDE-Constrained Problems.” <i>ArXiv:2308.01113</i>, 2023.","apa":"Bernreuther, M., Dellnitz, M., Gebken, B., Müller, G., Peitz, S., Sonntag, K., &#38; Volkwein, S. (2023). Multiobjective Optimization of Non-Smooth PDE-Constrained Problems. In <i>arXiv:2308.01113</i>.","ieee":"M. Bernreuther <i>et al.</i>, “Multiobjective Optimization of Non-Smooth PDE-Constrained Problems,” <i>arXiv:2308.01113</i>. 2023."},"publication":"arXiv:2308.01113","abstract":[{"text":"Multiobjective optimization plays an increasingly important role in modern applications, where several criteria are often of equal importance. The task in multiobjective optimization and multiobjective optimal control is therefore to compute the set of optimal compromises (the Pareto set) between the conflicting objectives. The advances in algorithms and the increasing interest in Pareto-optimal solutions have led to a wide range of new applications related to optimal and feedback control - potentially with non-smoothness both on the level of the objectives or in the system dynamics. This results in new challenges such as dealing with expensive models (e.g., governed by partial differential equations (PDEs)) and developing dedicated algorithms handling the non-smoothness. Since in contrast to single-objective optimization, the Pareto set generally consists of an infinite number of solutions, the computational effort can quickly become challenging, which is particularly problematic when the objectives are costly to evaluate or when a solution has to be presented very quickly. This article gives an overview of recent developments in the field of multiobjective optimization of non-smooth PDE-constrained problems. In particular we report on the advances achieved within Project 2 \"Multiobjective Optimization of Non-Smooth PDE-Constrained Problems - Switches, State Constraints and Model Order Reduction\" of the DFG Priority Programm 1962 \"Non-smooth and Complementarity-based Distributed Parameter Systems: Simulation and Hierarchical Optimization\".","lang":"eng"}]},{"status":"public","conference":{"location":"Hamburg","name":"DAGA 2023 - 49. Jahrestagung für Akustik","start_date":"2023-03-06","end_date":"2023-03-09"},"has_accepted_license":"1","page":"1409-1412","_id":"44849","user_id":"72602","ddc":["000"],"file_date_updated":"2024-02-29T16:15:12Z","citation":{"ama":"Rautenberg F, Kuhlmann M, Ebbers J, et al. Speech Disentanglement for Analysis and Modification of Acoustic and Perceptual Speaker Characteristics. In: <i>Fortschritte Der Akustik - DAGA 2023</i>. ; 2023:1409-1412.","bibtex":"@inproceedings{Rautenberg_Kuhlmann_Ebbers_Wiechmann_Seebauer_Wagner_Haeb-Umbach_2023, title={Speech Disentanglement for Analysis and Modification of Acoustic and Perceptual Speaker Characteristics}, booktitle={Fortschritte der Akustik - DAGA 2023}, author={Rautenberg, Frederik and Kuhlmann, Michael and Ebbers, Janek and Wiechmann, Jana and Seebauer, Fritz and Wagner, Petra and Haeb-Umbach, Reinhold}, year={2023}, pages={1409–1412} }","mla":"Rautenberg, Frederik, et al. “Speech Disentanglement for Analysis and Modification of Acoustic and Perceptual Speaker Characteristics.” <i>Fortschritte Der Akustik - DAGA 2023</i>, 2023, pp. 1409–12.","chicago":"Rautenberg, Frederik, Michael Kuhlmann, Janek Ebbers, Jana Wiechmann, Fritz Seebauer, Petra Wagner, and Reinhold Haeb-Umbach. “Speech Disentanglement for Analysis and Modification of Acoustic and Perceptual Speaker Characteristics.” In <i>Fortschritte Der Akustik - DAGA 2023</i>, 1409–12, 2023.","short":"F. Rautenberg, M. Kuhlmann, J. Ebbers, J. Wiechmann, F. Seebauer, P. Wagner, R. Haeb-Umbach, in: Fortschritte Der Akustik - DAGA 2023, 2023, pp. 1409–1412.","apa":"Rautenberg, F., Kuhlmann, M., Ebbers, J., Wiechmann, J., Seebauer, F., Wagner, P., &#38; Haeb-Umbach, R. (2023). Speech Disentanglement for Analysis and Modification of Acoustic and Perceptual Speaker Characteristics. <i>Fortschritte Der Akustik - DAGA 2023</i>, 1409–1412.","ieee":"F. Rautenberg <i>et al.</i>, “Speech Disentanglement for Analysis and Modification of Acoustic and Perceptual Speaker Characteristics,” in <i>Fortschritte der Akustik - DAGA 2023</i>, Hamburg, 2023, pp. 1409–1412."},"project":[{"name":"TRR 318 - C06: TRR 318 - Technisch unterstütztes Erklären von Stimmcharakteristika (Teilprojekt C06)","grant_number":"438445824","_id":"129"}],"oa":"1","title":"Speech Disentanglement for Analysis and Modification of Acoustic and Perceptual Speaker Characteristics","year":"2023","author":[{"full_name":"Rautenberg, Frederik","first_name":"Frederik","last_name":"Rautenberg","id":"72602"},{"last_name":"Kuhlmann","first_name":"Michael","full_name":"Kuhlmann, Michael","id":"49871"},{"first_name":"Janek","last_name":"Ebbers","full_name":"Ebbers, Janek","id":"34851"},{"full_name":"Wiechmann, Jana","first_name":"Jana","last_name":"Wiechmann"},{"first_name":"Fritz","last_name":"Seebauer","full_name":"Seebauer, Fritz"},{"last_name":"Wagner","first_name":"Petra","full_name":"Wagner, Petra"},{"full_name":"Haeb-Umbach, Reinhold","first_name":"Reinhold","last_name":"Haeb-Umbach","id":"242"}],"publication_status":"published","date_updated":"2024-02-29T17:05:16Z","main_file_link":[{"open_access":"1","url":"https://pub.dega-akustik.de/DAGA_2023/data/articles/000105.pdf"}],"language":[{"iso":"eng"}],"publication":"Fortschritte der Akustik - DAGA 2023","file":[{"date_created":"2024-02-29T16:15:12Z","creator":"frra","file_id":"52221","content_type":"application/pdf","file_name":"Daga_2023_Rautenberg_Paper.pdf","file_size":289493,"access_level":"open_access","relation":"main_file","date_updated":"2024-02-29T16:15:12Z"}],"date_created":"2023-05-15T08:48:54Z","type":"conference","department":[{"_id":"54"},{"_id":"660"}]}]