[{"doi":"10.1007/s00453-023-01189-x","language":[{"iso":"eng"}],"date_updated":"2024-01-11T11:19:33Z","publication_status":"published","title":"Server Cloud Scheduling","year":"2023","publication_identifier":{"issn":["0178-4617","1432-0541"]},"author":[{"full_name":"Maack, Marten","first_name":"Marten","last_name":"Maack","id":"88252"},{"last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"first_name":"Simon","last_name":"Pukrop","full_name":"Pukrop, Simon","id":"44428"}],"type":"journal_article","keyword":["Applied Mathematics","Computer Science Applications","General Computer Science"],"department":[{"_id":"63"}],"date_created":"2024-01-11T11:10:53Z","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"}],"extern":"1","publication":"Algorithmica","user_id":"44428","_id":"50458","publisher":"Springer Science and Business Media LLC","status":"public","project":[{"name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","_id":"1","grant_number":"160364472"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"_id":"16","grant_number":"160364472","name":"SFB 901 - C4: SFB 901 - On-The-Fly Compute Centers II: Ausführung komponierter Dienste in konfigurierbaren Rechenzentren (Subproject C4)"}],"citation":{"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>.","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>","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>.","short":"M. Maack, F. Meyer auf der Heide, S. Pukrop, Algorithmica (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>.","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} }","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>"}},{"language":[{"iso":"eng"}],"_id":"50460","publisher":"IEEE","doi":"10.1109/ipdps54959.2023.00049","user_id":"44428","author":[{"last_name":"Deppert","first_name":"Max A.","full_name":"Deppert, Max A."},{"full_name":"Jansen, Klaus","last_name":"Jansen","first_name":"Klaus"},{"id":"88252","full_name":"Maack, Marten","last_name":"Maack","first_name":"Marten"},{"id":"44428","first_name":"Simon","last_name":"Pukrop","full_name":"Pukrop, Simon"},{"full_name":"Rau, Malin","last_name":"Rau","first_name":"Malin"}],"year":"2023","status":"public","title":"Scheduling with Many Shared Resources","date_updated":"2024-01-11T11:31:11Z","publication_status":"published","date_created":"2024-01-11T11:30:14Z","department":[{"_id":"63"}],"type":"conference","citation":{"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} }","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>","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>.","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>.","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>.","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>"},"publication":"2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS)","project":[{"name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","_id":"1","grant_number":"160364472"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"name":"SFB 901 - C4: SFB 901 - On-The-Fly Compute Centers II: Ausführung komponierter Dienste in konfigurierbaren Rechenzentren (Subproject C4)","grant_number":"160364472","_id":"16"}]},{"abstract":[{"lang":"eng","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."}],"project":[{"name":"PC2: Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"publication":"arXiv:2304.03039","citation":{"ieee":"L. Van Hirtum <i>et al.</i>, “A computation of D(9) using FPGA Supercomputing,” <i>arXiv:2304.03039</i>. 2023.","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>.","short":"L. Van Hirtum, P. De Causmaecker, J. Goemaere, T. Kenter, H. Riebler, M. Lass, C. Plessl, ArXiv:2304.03039 (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.","mla":"Van Hirtum, Lennart, et al. “A Computation of D(9) Using FPGA Supercomputing.” <i>ArXiv:2304.03039</i>, 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} }","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."},"type":"preprint","department":[{"_id":"27"},{"_id":"518"}],"external_id":{"arxiv":["2304.03039"]},"date_created":"2023-04-08T11:05:29Z","date_updated":"2024-01-22T09:56:42Z","year":"2023","title":"A computation of D(9) using FPGA Supercomputing","status":"public","author":[{"last_name":"Van Hirtum","first_name":"Lennart","full_name":"Van Hirtum, Lennart"},{"last_name":"De Causmaecker","first_name":"Patrick","full_name":"De Causmaecker, Patrick"},{"first_name":"Jens","last_name":"Goemaere","full_name":"Goemaere, Jens"},{"id":"3145","first_name":"Tobias","last_name":"Kenter","full_name":"Kenter, Tobias"},{"first_name":"Heinrich","last_name":"Riebler","full_name":"Riebler, Heinrich","id":"8961"},{"full_name":"Lass, Michael","orcid":"0000-0002-5708-7632","last_name":"Lass","first_name":"Michael","id":"24135"},{"last_name":"Plessl","first_name":"Christian","orcid":"0000-0001-5728-9982","full_name":"Plessl, Christian","id":"16153"}],"user_id":"3145","language":[{"iso":"eng"}],"_id":"43439"},{"citation":{"mla":"Amakor, Augustina Chidinma, et al. “A Multiobjective Continuation Method to Compute the Regularization Path of Deep Neural Networks.” <i>ArXiv</i>, 2023.","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.","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>.","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.","short":"A.C. Amakor, K. Sonntag, S. Peitz, ArXiv (2023)."},"publication":"arXiv","abstract":[{"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.","lang":"eng"}],"date_created":"2024-02-06T08:51:00Z","department":[{"_id":"655"}],"oa":"1","type":"preprint","author":[{"full_name":"Amakor, Augustina Chidinma","first_name":"Augustina Chidinma","last_name":"Amakor","id":"97916"},{"id":"56399","last_name":"Sonntag","first_name":"Konstantin","full_name":"Sonntag, Konstantin"},{"full_name":"Peitz, Sebastian","orcid":"0000-0002-3389-793X","first_name":"Sebastian","last_name":"Peitz","id":"47427"}],"title":"A multiobjective continuation method to compute the regularization path of deep neural networks","year":"2023","status":"public","date_updated":"2024-02-06T08:52:07Z","_id":"51159","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://arxiv.org/pdf/2308.12044.pdf","open_access":"1"}],"user_id":"47427"},{"publication":"arXiv:2312.10460","citation":{"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>.","short":"F. Philipp, M. Schaller, K. Worthmann, S. Peitz, F. Nüske, ArXiv:2312.10460 (2023).","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.","mla":"Philipp, Friedrich, et al. “Error Analysis of Kernel EDMD for Prediction and Control in the Koopman  Framework.” <i>ArXiv:2312.10460</i>, 2023.","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."},"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."}],"external_id":{"arxiv":["2312.10460"]},"date_created":"2024-02-06T08:49:50Z","type":"preprint","oa":"1","department":[{"_id":"655"}],"status":"public","title":"Error analysis of kernel EDMD for prediction and control in the Koopman  framework","year":"2023","author":[{"full_name":"Philipp, Friedrich","first_name":"Friedrich","last_name":"Philipp"},{"last_name":"Schaller","first_name":"Manuel","full_name":"Schaller, Manuel"},{"last_name":"Worthmann","first_name":"Karl","full_name":"Worthmann, Karl"},{"full_name":"Peitz, Sebastian","orcid":"0000-0002-3389-793X","first_name":"Sebastian","last_name":"Peitz","id":"47427"},{"first_name":"Feliks","last_name":"Nüske","full_name":"Nüske, Feliks"}],"date_updated":"2024-02-06T08:50:32Z","main_file_link":[{"open_access":"1","url":"https://arxiv.org/pdf/2312.10460.pdf"}],"_id":"51158","language":[{"iso":"eng"}],"user_id":"47427"},{"user_id":"35441","publisher":"ACM","_id":"47049","language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2024-02-08T07:58:15Z","year":"2023","title":"Design and Evaluation of an AR Voice-based Indoor UAV Assistant for Smart Home Scenarios","status":"public","author":[{"first_name":"Robin","last_name":"Helmert","full_name":"Helmert, Robin"},{"first_name":"Tobias","last_name":"Hardes","full_name":"Hardes, Tobias","id":"35441"},{"id":"8447","last_name":"Yigitbas","first_name":"Enes","orcid":"0000-0002-5967-833X","full_name":"Yigitbas, Enes"}],"conference":{"location":" Sydney, Australia ","name":"ACM Symposium on Spatial User Interaction","start_date":"2023-10-13","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"},"type":"conference","department":[{"_id":"66"},{"_id":"534"}],"date_created":"2023-09-14T07:57:37Z","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"}],"publication":"Proceedings of the ACM Symposium on Spatial User Interaction (SUI 2023)","citation":{"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.","short":"R. Helmert, T. Hardes, E. Yigitbas, in: Proceedings of the ACM Symposium on Spatial User Interaction (SUI 2023), ACM, 2023.","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.","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."}},{"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"}],"user_id":"39928","doi":"10.17619/UNIPB/1-1845","title":"Decision Support Ecosystems: Assisted Low-Code Development of Tailored Decision Support Systems","year":"2023","status":"public","author":[{"id":"39928","first_name":"Jonas","last_name":"Kirchhoff","full_name":"Kirchhoff, Jonas"}],"date_updated":"2024-02-15T10:03:04Z","date_created":"2024-02-15T09:59:22Z","type":"dissertation","department":[{"_id":"534"},{"_id":"66"}],"oa":"1","citation":{"ieee":"J. Kirchhoff, <i>Decision Support Ecosystems: Assisted Low-Code Development of Tailored Decision Support Systems</i>. Universität Paderborn, 2023.","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>","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>.","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} }","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>"},"supervisor":[{"id":"107","full_name":"Engels, Gregor","last_name":"Engels","first_name":"Gregor"}],"abstract":[{"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":"ger"},{"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 ..."}]},{"title":"Multiobjective Optimization of Non-Smooth PDE-Constrained Problems","year":"2023","status":"public","author":[{"full_name":"Bernreuther, Marco","first_name":"Marco","last_name":"Bernreuther"},{"full_name":"Dellnitz, Michael","last_name":"Dellnitz","first_name":"Michael"},{"first_name":"Bennet","last_name":"Gebken","full_name":"Gebken, Bennet","id":"32643"},{"last_name":"Müller","first_name":"Georg","full_name":"Müller, Georg"},{"full_name":"Peitz, Sebastian","last_name":"Peitz","first_name":"Sebastian","orcid":"0000-0002-3389-793X","id":"47427"},{"full_name":"Sonntag, Konstantin","first_name":"Konstantin","orcid":"https://orcid.org/0000-0003-3384-3496","last_name":"Sonntag","id":"56399"},{"full_name":"Volkwein, Stefan","last_name":"Volkwein","first_name":"Stefan"}],"date_updated":"2024-02-21T12:22:20Z","main_file_link":[{"open_access":"1","url":"https://arxiv.org/pdf/2308.01113"}],"_id":"46578","language":[{"iso":"eng"}],"user_id":"47427","publication":"arXiv:2308.01113","citation":{"mla":"Bernreuther, Marco, et al. “Multiobjective Optimization of Non-Smooth PDE-Constrained Problems.” <i>ArXiv:2308.01113</i>, 2023.","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} }","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.","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."},"abstract":[{"lang":"eng","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\"."}],"external_id":{"arxiv":["2308.01113"]},"date_created":"2023-08-21T05:50:12Z","type":"preprint","department":[{"_id":"655"},{"_id":"101"}],"oa":"1"},{"type":"mastersthesis","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"date_created":"2024-03-05T12:48:39Z","supervisor":[{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"citation":{"ama":"Beckendorf B. <i>Self-Stabilizing Skip-Graph with Growth-Bounded Metric</i>.; 2023.","bibtex":"@book{Beckendorf_2023, title={Self-Stabilizing Skip-Graph with Growth-bounded Metric}, author={Beckendorf, Björn}, year={2023} }","mla":"Beckendorf, Björn. <i>Self-Stabilizing Skip-Graph with Growth-Bounded Metric</i>. 2023.","short":"B. Beckendorf, Self-Stabilizing Skip-Graph with Growth-Bounded Metric, 2023.","chicago":"Beckendorf, Björn. <i>Self-Stabilizing Skip-Graph with Growth-Bounded Metric</i>, 2023.","apa":"Beckendorf, B. (2023). <i>Self-Stabilizing Skip-Graph with Growth-bounded Metric</i>.","ieee":"B. Beckendorf, <i>Self-Stabilizing Skip-Graph with Growth-bounded Metric</i>. 2023."},"user_id":"15578","language":[{"iso":"eng"}],"_id":"52317","date_updated":"2024-03-05T12:49:22Z","year":"2023","status":"public","title":"Self-Stabilizing Skip-Graph with Growth-bounded Metric","author":[{"full_name":"Beckendorf, Björn","last_name":"Beckendorf","first_name":"Björn"}]},{"date_updated":"2024-03-06T16:18:53Z","has_accepted_license":"1","title":"LitCQD: Multi-Hop Reasoning in Incomplete Knowledge Graphs with Numeric Literals","year":"2023","status":"public","author":[{"last_name":"Demir","first_name":"Caglar","full_name":"Demir, Caglar","id":"43817"},{"first_name":"Michel","last_name":"Wiebesiek","full_name":"Wiebesiek, Michel"},{"full_name":"Lu, Renzhong","first_name":"Renzhong","last_name":"Lu"},{"id":"65716","last_name":"Ngonga Ngomo","first_name":"Axel-Cyrille","full_name":"Ngonga Ngomo, Axel-Cyrille"},{"full_name":"Heindorf, Stefan","orcid":"0000-0002-4525-6865","last_name":"Heindorf","first_name":"Stefan","id":"11871"}],"conference":{"location":"Torino","name":"European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases"},"user_id":"14931","ddc":["000"],"language":[{"iso":"eng"}],"_id":"46248","project":[{"_id":"407","grant_number":"101070305","name":"ENEXA: Efficient Explainable Learning on Knowledge Graphs"},{"_id":"410","grant_number":"860801","name":"KnowGraphs: KnowGraphs: Knowledge Graphs at Scale"},{"grant_number":"NW21-059D","_id":"285","name":"SAIL: SAIL: SustAInable Life-cycle of Intelligent Socio-Technical Systems"}],"file_date_updated":"2023-08-01T09:24:15Z","publication":"ECML PKDD","citation":{"ama":"Demir C, Wiebesiek M, Lu R, Ngonga Ngomo A-C, Heindorf S. LitCQD: Multi-Hop Reasoning in Incomplete Knowledge Graphs with Numeric Literals. <i>ECML PKDD</i>. Published online 2023.","bibtex":"@article{Demir_Wiebesiek_Lu_Ngonga Ngomo_Heindorf_2023, title={LitCQD: Multi-Hop Reasoning in Incomplete Knowledge Graphs with Numeric Literals}, journal={ECML PKDD}, author={Demir, Caglar and Wiebesiek, Michel and Lu, Renzhong and Ngonga Ngomo, Axel-Cyrille and Heindorf, Stefan}, year={2023} }","mla":"Demir, Caglar, et al. “LitCQD: Multi-Hop Reasoning in Incomplete Knowledge Graphs with Numeric Literals.” <i>ECML PKDD</i>, 2023.","chicago":"Demir, Caglar, Michel Wiebesiek, Renzhong Lu, Axel-Cyrille Ngonga Ngomo, and Stefan Heindorf. “LitCQD: Multi-Hop Reasoning in Incomplete Knowledge Graphs with Numeric Literals.” <i>ECML PKDD</i>, 2023.","short":"C. Demir, M. Wiebesiek, R. Lu, A.-C. Ngonga Ngomo, S. Heindorf, ECML PKDD (2023).","apa":"Demir, C., Wiebesiek, M., Lu, R., Ngonga Ngomo, A.-C., &#38; Heindorf, S. (2023). LitCQD: Multi-Hop Reasoning in Incomplete Knowledge Graphs with Numeric Literals. <i>ECML PKDD</i>. European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, Torino.","ieee":"C. Demir, M. Wiebesiek, R. Lu, A.-C. Ngonga Ngomo, and S. Heindorf, “LitCQD: Multi-Hop Reasoning in Incomplete Knowledge Graphs with Numeric Literals,” <i>ECML PKDD</i>, 2023."},"type":"journal_article","department":[{"_id":"574"},{"_id":"760"}],"oa":"1","file":[{"date_created":"2023-08-01T09:24:15Z","creator":"cdemir","file_id":"46249","content_type":"application/pdf","file_name":"public.pdf","access_level":"open_access","file_size":562759,"relation":"main_file","date_updated":"2023-08-01T09:24:15Z"}],"date_created":"2023-08-01T09:24:21Z"},{"date_created":"2024-03-07T18:13:47Z","keyword":["Product Lifecyle Management (PLM)","Data Analytics","Data-driven Design","Engineering Management","Lifecycle Data"],"type":"conference","department":[{"_id":"563"}],"publication":"2023 IEEE International Conference on Technology Management, Operations and Decisions (ICTMOD)","citation":{"mla":"Fichtler, Timm, et al. “Towards a Data-Driven Product Management – Concepts, Advantages, and Future Research.” <i>2023 IEEE International Conference on Technology Management, Operations and Decisions (ICTMOD)</i>, IEEE, 2023, doi:<a href=\"https://doi.org/10.1109/ictmod59086.2023.10438135\">10.1109/ictmod59086.2023.10438135</a>.","bibtex":"@inproceedings{Fichtler_Grigoryan_Koldewey_Dumitrescu_2023, title={Towards a Data-Driven Product Management – Concepts, Advantages, and Future Research}, DOI={<a href=\"https://doi.org/10.1109/ictmod59086.2023.10438135\">10.1109/ictmod59086.2023.10438135</a>}, booktitle={2023 IEEE International Conference on Technology Management, Operations and Decisions (ICTMOD)}, publisher={IEEE}, author={Fichtler, Timm and Grigoryan, Khoren and Koldewey, Christian and Dumitrescu, Roman}, year={2023} }","ama":"Fichtler T, Grigoryan K, Koldewey C, Dumitrescu R. Towards a Data-Driven Product Management – Concepts, Advantages, and Future Research. In: <i>2023 IEEE International Conference on Technology Management, Operations and Decisions (ICTMOD)</i>. IEEE; 2023. doi:<a href=\"https://doi.org/10.1109/ictmod59086.2023.10438135\">10.1109/ictmod59086.2023.10438135</a>","ieee":"T. Fichtler, K. Grigoryan, C. Koldewey, and R. Dumitrescu, “Towards a Data-Driven Product Management – Concepts, Advantages, and Future Research,” presented at the IEEE International Conference on Technology Management, Operations and Decisions (ICTMOD), Rabat, Morocco, 2023, doi: <a href=\"https://doi.org/10.1109/ictmod59086.2023.10438135\">10.1109/ictmod59086.2023.10438135</a>.","apa":"Fichtler, T., Grigoryan, K., Koldewey, C., &#38; Dumitrescu, R. (2023). Towards a Data-Driven Product Management – Concepts, Advantages, and Future Research. <i>2023 IEEE International Conference on Technology Management, Operations and Decisions (ICTMOD)</i>. IEEE International Conference on Technology Management, Operations and Decisions (ICTMOD), Rabat, Morocco. <a href=\"https://doi.org/10.1109/ictmod59086.2023.10438135\">https://doi.org/10.1109/ictmod59086.2023.10438135</a>","chicago":"Fichtler, Timm, Khoren Grigoryan, Christian Koldewey, and Roman Dumitrescu. “Towards a Data-Driven Product Management – Concepts, Advantages, and Future Research.” In <i>2023 IEEE International Conference on Technology Management, Operations and Decisions (ICTMOD)</i>. IEEE, 2023. <a href=\"https://doi.org/10.1109/ictmod59086.2023.10438135\">https://doi.org/10.1109/ictmod59086.2023.10438135</a>.","short":"T. Fichtler, K. Grigoryan, C. Koldewey, R. Dumitrescu, in: 2023 IEEE International Conference on Technology Management, Operations and Decisions (ICTMOD), IEEE, 2023."},"abstract":[{"lang":"eng","text":"Megatrends, such as digitization or sustainability, are confronting the product management of manufacturing companies with a variety of challenges regarding the design of future products, but also the management of the actual products. To successfully position their products in the market, product managers need to gather and analyze comprehensive information about customers, developments in the products’ environment, product usage, and more. The digitization of all aspects of life is making data on these topics increasingly available – via social media, documents, or the internet of things from the products themselves. The systematic collection and analysis of these data enable the exploitation of new potentials for the adaption of existing products and the creation of the products of tomorrow. However, there are still no insights into the main concepts and cause-effect relationships in exploiting data-driven approaches for product management. Therefore, this paper aims to identify the main concepts and advantages of data-driven product management. To answer the corresponding research questions a comprehensive systematic literature review is conducted. From its results, a detailed description of the main concepts of data-driven product management is derived. Furthermore, a taxonomy for the advantages of data-driven product management is presented. The main concepts and the taxonomy allow for a deeper understanding of the topic while highlighting necessary future actions and research needs."}],"_id":"52369","publisher":"IEEE","language":[{"iso":"eng"}],"user_id":"66731","doi":"10.1109/ictmod59086.2023.10438135","year":"2023","title":"Towards a Data-Driven Product Management – Concepts, Advantages, and Future Research","status":"public","author":[{"full_name":"Fichtler, Timm","orcid":"https://orcid.org/0000-0001-6034-4399","first_name":"Timm","last_name":"Fichtler","id":"66731"},{"first_name":"Khoren","last_name":"Grigoryan","full_name":"Grigoryan, Khoren"},{"last_name":"Koldewey","orcid":"https://orcid.org/0000-0001-7992-6399","first_name":"Christian","full_name":"Koldewey, Christian","id":"43136"},{"last_name":"Dumitrescu","first_name":"Roman","full_name":"Dumitrescu, Roman","id":"16190"}],"conference":{"name":"IEEE International Conference on Technology Management, Operations and Decisions (ICTMOD)","start_date":"2023-11-22","location":"Rabat, Morocco","end_date":"2023-11-24"},"publication_status":"published","date_updated":"2024-03-07T18:17:34Z"},{"citation":{"ieee":"R. P. Prager and H. Trautmann, “Investigating the Viability of Existing Exploratory Landscape Analysis Features for Mixed-Integer Problems,” in <i>Companion Proceedings of the Conference on Genetic and Evolutionary Computation, GECCO 2023, Companion Volume, Lisbon, Portugal, July 15-19, 2023</i>, 2023, pp. 451–454, doi: <a href=\"https://doi.org/10.1145/3583133.3590757\">10.1145/3583133.3590757</a>.","apa":"Prager, R. P., &#38; Trautmann, H. (2023). Investigating the Viability of Existing Exploratory Landscape Analysis Features for Mixed-Integer Problems. In S. Silva &#38; L. Paquete (Eds.), <i>Companion Proceedings of the Conference on Genetic and Evolutionary Computation, GECCO 2023, Companion Volume, Lisbon, Portugal, July 15-19, 2023</i> (pp. 451–454). ACM. <a href=\"https://doi.org/10.1145/3583133.3590757\">https://doi.org/10.1145/3583133.3590757</a>","short":"R.P. Prager, H. Trautmann, in: S. Silva, L. Paquete (Eds.), Companion Proceedings of the Conference on Genetic and Evolutionary Computation, GECCO 2023, Companion Volume, Lisbon, Portugal, July 15-19, 2023, ACM, 2023, pp. 451–454.","chicago":"Prager, Raphael Patrick, and Heike Trautmann. “Investigating the Viability of Existing Exploratory Landscape Analysis Features for Mixed-Integer Problems.” In <i>Companion Proceedings of the Conference on Genetic and Evolutionary Computation, GECCO 2023, Companion Volume, Lisbon, Portugal, July 15-19, 2023</i>, edited by Sara Silva and Luís Paquete, 451–454. ACM, 2023. <a href=\"https://doi.org/10.1145/3583133.3590757\">https://doi.org/10.1145/3583133.3590757</a>.","mla":"Prager, Raphael Patrick, and Heike Trautmann. “Investigating the Viability of Existing Exploratory Landscape Analysis Features for Mixed-Integer Problems.” <i>Companion Proceedings of the Conference on Genetic and Evolutionary Computation, GECCO 2023, Companion Volume, Lisbon, Portugal, July 15-19, 2023</i>, edited by Sara Silva and Luís Paquete, ACM, 2023, pp. 451–454, doi:<a href=\"https://doi.org/10.1145/3583133.3590757\">10.1145/3583133.3590757</a>.","bibtex":"@inproceedings{Prager_Trautmann_2023, title={Investigating the Viability of Existing Exploratory Landscape Analysis Features for Mixed-Integer Problems}, DOI={<a href=\"https://doi.org/10.1145/3583133.3590757\">10.1145/3583133.3590757</a>}, booktitle={Companion Proceedings of the Conference on Genetic and Evolutionary Computation, GECCO 2023, Companion Volume, Lisbon, Portugal, July 15-19, 2023}, publisher={ACM}, author={Prager, Raphael Patrick and Trautmann, Heike}, editor={Silva, Sara and Paquete, Luís}, year={2023}, pages={451–454} }","ama":"Prager RP, Trautmann H. Investigating the Viability of Existing Exploratory Landscape Analysis Features for Mixed-Integer Problems. In: Silva S, Paquete L, eds. <i>Companion Proceedings of the Conference on Genetic and Evolutionary Computation, GECCO 2023, Companion Volume, Lisbon, Portugal, July 15-19, 2023</i>. ACM; 2023:451–454. doi:<a href=\"https://doi.org/10.1145/3583133.3590757\">10.1145/3583133.3590757</a>"},"publication":"Companion Proceedings of the Conference on Genetic and Evolutionary Computation, GECCO 2023, Companion Volume, Lisbon, Portugal, July 15-19, 2023","department":[{"_id":"819"}],"type":"conference","date_created":"2024-03-13T09:55:17Z","date_updated":"2024-03-13T10:28:07Z","author":[{"full_name":"Prager, Raphael Patrick","first_name":"Raphael Patrick","last_name":"Prager"},{"full_name":"Trautmann, Heike","last_name":"Trautmann","first_name":"Heike","orcid":"0000-0002-9788-8282","id":"100740"}],"title":"Investigating the Viability of Existing Exploratory Landscape Analysis Features for Mixed-Integer Problems","status":"public","year":"2023","editor":[{"last_name":"Silva","first_name":"Sara","full_name":"Silva, Sara"},{"first_name":"Luís","last_name":"Paquete","full_name":"Paquete, Luís"}],"user_id":"15504","doi":"10.1145/3583133.3590757","_id":"52530","language":[{"iso":"eng"}],"publisher":"ACM","page":"451–454"},{"place":"Bonn","date_created":"2024-03-20T09:26:29Z","department":[{"_id":"76"}],"type":"book_chapter","keyword":["Automated static analysis","Software usability"],"citation":{"chicago":"Nachtigall, Marcus, Michael Schlichtig, and Eric Bodden. “Evaluation of Usability Criteria Addressed by Static Analysis Tools on a Large Scale.” In <i>Software Engineering 2023</i>, 95–96. Bonn: Gesellschaft für Informatik e.V., 2023.","short":"M. Nachtigall, M. Schlichtig, E. Bodden, in: Software Engineering 2023, Gesellschaft für Informatik e.V., Bonn, 2023, pp. 95–96.","apa":"Nachtigall, M., Schlichtig, M., &#38; Bodden, E. (2023). Evaluation of Usability Criteria Addressed by Static Analysis Tools on a Large Scale. In <i>Software Engineering 2023</i> (pp. 95–96). Gesellschaft für Informatik e.V.","ieee":"M. Nachtigall, M. Schlichtig, and E. Bodden, “Evaluation of Usability Criteria Addressed by Static Analysis Tools on a Large Scale,” in <i>Software Engineering 2023</i>, Bonn: Gesellschaft für Informatik e.V., 2023, pp. 95–96.","ama":"Nachtigall M, Schlichtig M, Bodden E. Evaluation of Usability Criteria Addressed by Static Analysis Tools on a Large Scale. In: <i>Software Engineering 2023</i>. Gesellschaft für Informatik e.V.; 2023:95–96.","bibtex":"@inbook{Nachtigall_Schlichtig_Bodden_2023, place={Bonn}, title={Evaluation of Usability Criteria Addressed by Static Analysis Tools on a Large Scale}, booktitle={Software Engineering 2023}, publisher={Gesellschaft für Informatik e.V.}, author={Nachtigall, Marcus and Schlichtig, Michael and Bodden, Eric}, year={2023}, pages={95–96} }","mla":"Nachtigall, Marcus, et al. “Evaluation of Usability Criteria Addressed by Static Analysis Tools on a Large Scale.” <i>Software Engineering 2023</i>, Gesellschaft für Informatik e.V., 2023, pp. 95–96."},"publication":"Software Engineering 2023","abstract":[{"text":"Static analysis tools support developers in detecting potential coding issues, such as bugs or vulnerabilities. Research emphasizes technical challenges of such tools but also mentions severe usability shortcomings. These shortcomings hinder the adoption of static analysis tools, and user dissatisfaction may even lead to tool abandonment. To comprehensively assess the state of the art, we present the first systematic usability evaluation of a wide range of static analysis tools. We derived a set of 36 relevant criteria from the literature and used them to evaluate a total of 46 static analysis tools complying with our inclusion and exclusion criteria - a representative set of mainly non-proprietary tools. The evaluation against the usability criteria in a multiple-raters approach shows that two thirds of the considered tools off er poor warning messages, while about three-quarters provide hardly any fix support. Furthermore, the integration of user knowledge is strongly neglected, which could be used for instance, to improve handling of false positives. Finally, issues regarding workflow integration and specialized user interfaces are revealed. These findings should prove useful in guiding and focusing further research and development in user experience for static code analyses.","lang":"eng"}],"language":[{"iso":"eng"}],"_id":"52662","publisher":"Gesellschaft für Informatik e.V.","page":"95–96","main_file_link":[{"url":"https://dl.gi.de/items/5afe477f-2f6a-4b3d-b391-f024baf0b7a5"}],"user_id":"32312","publication_identifier":{"isbn":["978-3-88579-726-5"]},"author":[{"id":"41213","first_name":"Marcus","last_name":"Nachtigall","full_name":"Nachtigall, Marcus"},{"id":"32312","full_name":"Schlichtig, Michael","last_name":"Schlichtig","orcid":"0000-0001-6600-6171","first_name":"Michael"},{"id":"59256","orcid":"0000-0003-3470-3647","first_name":"Eric","last_name":"Bodden","full_name":"Bodden, Eric"}],"year":"2023","title":"Evaluation of Usability Criteria Addressed by Static Analysis Tools on a Large Scale","status":"public","date_updated":"2024-03-20T09:27:41Z"},{"date_created":"2024-03-20T09:22:27Z","place":"Bonn","keyword":["API misuses  API usage constraints","classification framework","API misuse detection","static analysis"],"type":"book_chapter","department":[{"_id":"76"}],"publication":"Software Engineering 2023","citation":{"bibtex":"@inbook{Schlichtig_Sassalla_Narasimhan_Bodden_2023, place={Bonn}, title={Introducing FUM: A Framework for API Usage Constraint and Misuse Classification}, booktitle={Software Engineering 2023}, publisher={Gesellschaft für Informatik e.V.}, author={Schlichtig, Michael and Sassalla, Steffen and Narasimhan, Krishna and Bodden, Eric}, year={2023}, pages={105–106} }","ama":"Schlichtig M, Sassalla S, Narasimhan K, Bodden E. Introducing FUM: A Framework for API Usage Constraint and Misuse Classification. In: <i>Software Engineering 2023</i>. Gesellschaft für Informatik e.V.; 2023:105–106.","mla":"Schlichtig, Michael, et al. “Introducing FUM: A Framework for API Usage Constraint and Misuse Classification.” <i>Software Engineering 2023</i>, Gesellschaft für Informatik e.V., 2023, pp. 105–106.","chicago":"Schlichtig, Michael, Steffen Sassalla, Krishna Narasimhan, and Eric Bodden. “Introducing FUM: A Framework for API Usage Constraint and Misuse Classification.” In <i>Software Engineering 2023</i>, 105–106. Bonn: Gesellschaft für Informatik e.V., 2023.","short":"M. Schlichtig, S. Sassalla, K. Narasimhan, E. Bodden, in: Software Engineering 2023, Gesellschaft für Informatik e.V., Bonn, 2023, pp. 105–106.","ieee":"M. Schlichtig, S. Sassalla, K. Narasimhan, and E. Bodden, “Introducing FUM: A Framework for API Usage Constraint and Misuse Classification,” in <i>Software Engineering 2023</i>, Bonn: Gesellschaft für Informatik e.V., 2023, pp. 105–106.","apa":"Schlichtig, M., Sassalla, S., Narasimhan, K., &#38; Bodden, E. (2023). Introducing FUM: A Framework for API Usage Constraint and Misuse Classification. In <i>Software Engineering 2023</i> (pp. 105–106). Gesellschaft für Informatik e.V."},"abstract":[{"lang":"eng","text":"Application Programming Interfaces (APIs) are the primary mechanism developers use to obtain access to third-party algorithms and services. Unfortunately, APIs can be misused, which can have catastrophic consequences, especially if the APIs provide security-critical functionalities like cryptography. Understanding what API misuses are, and how they are caused, is important to prevent them, eg, with API misuse detectors. However, definitions for API misuses and related terms in literature vary. This paper presents a systematic literature review to clarify these terms and introduces FUM, a novel Framework for API Usage constraint and Misuse classification. The literature review revealed that API misuses are violations of API usage constraints. To address this, we provide unified definitions and use them to derive FUM. To assess the extent to which FUM aids in determining and guiding the improvement of an API misuses detector’s capabilities, we performed a case study on the state-of the-art misuse detection tool CogniCrypt. The study showed that FUM can be used to properly assess CogniCrypt’s capabilities, identify weaknesses and assist in deriving mitigations and improvements."}],"main_file_link":[{"url":"https://dl.gi.de/items/c4825557-cf3d-4038-933a-d8f95fd324a2"}],"page":"105–106","_id":"52660","publisher":"Gesellschaft für Informatik e.V.","language":[{"iso":"eng"}],"user_id":"32312","title":"Introducing FUM: A Framework for API Usage Constraint and Misuse Classification","status":"public","year":"2023","publication_identifier":{"isbn":["978-3-88579-726-5"]},"author":[{"last_name":"Schlichtig","first_name":"Michael","orcid":"0000-0001-6600-6171","full_name":"Schlichtig, Michael","id":"32312"},{"full_name":"Sassalla, Steffen","last_name":"Sassalla","first_name":"Steffen"},{"full_name":"Narasimhan, Krishna","first_name":"Krishna","last_name":"Narasimhan"},{"id":"59256","full_name":"Bodden, Eric","last_name":"Bodden","first_name":"Eric","orcid":"0000-0003-3470-3647"}],"date_updated":"2024-03-20T09:25:46Z"},{"publication":"CoRR","citation":{"mla":"Gil, Oliver Fernández, et al. “Optimal Alignment of Temporal Knowledge Bases.” <i>CoRR</i>, vol. abs/2307.15439, 2023, doi:<a href=\"https://doi.org/10.48550/ARXIV.2307.15439\">10.48550/ARXIV.2307.15439</a>.","bibtex":"@article{Gil_Patrizi_Perelli_Turhan_2023, title={Optimal Alignment of Temporal Knowledge Bases}, volume={abs/2307.15439}, DOI={<a href=\"https://doi.org/10.48550/ARXIV.2307.15439\">10.48550/ARXIV.2307.15439</a>}, journal={CoRR}, author={Gil, Oliver Fernández and Patrizi, Fabio and Perelli, Giuseppe and Turhan, Anni-Yasmin}, year={2023} }","ama":"Gil OF, Patrizi F, Perelli G, Turhan A-Y. Optimal Alignment of Temporal Knowledge Bases. <i>CoRR</i>. 2023;abs/2307.15439. doi:<a href=\"https://doi.org/10.48550/ARXIV.2307.15439\">10.48550/ARXIV.2307.15439</a>","ieee":"O. F. Gil, F. Patrizi, G. Perelli, and A.-Y. Turhan, “Optimal Alignment of Temporal Knowledge Bases,” <i>CoRR</i>, vol. abs/2307.15439, 2023, doi: <a href=\"https://doi.org/10.48550/ARXIV.2307.15439\">10.48550/ARXIV.2307.15439</a>.","apa":"Gil, O. F., Patrizi, F., Perelli, G., &#38; Turhan, A.-Y. (2023). Optimal Alignment of Temporal Knowledge Bases. <i>CoRR</i>, <i>abs/2307.15439</i>. <a href=\"https://doi.org/10.48550/ARXIV.2307.15439\">https://doi.org/10.48550/ARXIV.2307.15439</a>","chicago":"Gil, Oliver Fernández, Fabio Patrizi, Giuseppe Perelli, and Anni-Yasmin Turhan. “Optimal Alignment of Temporal Knowledge Bases.” <i>CoRR</i> abs/2307.15439 (2023). <a href=\"https://doi.org/10.48550/ARXIV.2307.15439\">https://doi.org/10.48550/ARXIV.2307.15439</a>.","short":"O.F. Gil, F. Patrizi, G. Perelli, A.-Y. Turhan, CoRR abs/2307.15439 (2023)."},"date_created":"2024-03-25T13:58:27Z","type":"journal_article","department":[{"_id":"888"}],"status":"public","title":"Optimal Alignment of Temporal Knowledge Bases","year":"2023","author":[{"first_name":"Oliver Fernández","last_name":"Gil","full_name":"Gil, Oliver Fernández"},{"full_name":"Patrizi, Fabio","first_name":"Fabio","last_name":"Patrizi"},{"full_name":"Perelli, Giuseppe","last_name":"Perelli","first_name":"Giuseppe"},{"id":"104470","full_name":"Turhan, Anni-Yasmin","last_name":"Turhan","first_name":"Anni-Yasmin"}],"date_updated":"2024-03-25T13:59:45Z","language":[{"iso":"eng"}],"_id":"52861","doi":"10.48550/ARXIV.2307.15439","user_id":"9503","volume":"abs/2307.15439"},{"department":[{"_id":"819"}],"type":"conference","date_created":"2024-03-25T14:23:53Z","extern":"1","citation":{"short":"U. Ŝkvorc, T. Eftimov, P. Koro]ec, in: 2023 IEEE Symposium Series on Computational Intelligence (SSCI), IEEE, 2023.","chicago":"Ŝkvorc, Urban, Tome Eftimov, and Peter Koro]ec. “Analyzing the Generalizability of Automated Algorithm Selection: A Case Study for Numerical Optimization.” In <i>2023 IEEE Symposium Series on Computational Intelligence (SSCI)</i>. IEEE, 2023. <a href=\"https://doi.org/10.1109/ssci52147.2023.10371868\">https://doi.org/10.1109/ssci52147.2023.10371868</a>.","ieee":"U. Ŝkvorc, T. Eftimov, and P. Koro]ec, “Analyzing the Generalizability of Automated Algorithm Selection: A Case Study for Numerical Optimization,” 2023, doi: <a href=\"https://doi.org/10.1109/ssci52147.2023.10371868\">10.1109/ssci52147.2023.10371868</a>.","apa":"Ŝkvorc, U., Eftimov, T., &#38; Koro]ec, P. (2023). Analyzing the Generalizability of Automated Algorithm Selection: A Case Study for Numerical Optimization. <i>2023 IEEE Symposium Series on Computational Intelligence (SSCI)</i>. <a href=\"https://doi.org/10.1109/ssci52147.2023.10371868\">https://doi.org/10.1109/ssci52147.2023.10371868</a>","bibtex":"@inproceedings{Ŝkvorc_Eftimov_Koro]ec_2023, title={Analyzing the Generalizability of Automated Algorithm Selection: A Case Study for Numerical Optimization}, DOI={<a href=\"https://doi.org/10.1109/ssci52147.2023.10371868\">10.1109/ssci52147.2023.10371868</a>}, booktitle={2023 IEEE Symposium Series on Computational Intelligence (SSCI)}, publisher={IEEE}, author={Ŝkvorc, Urban and Eftimov, Tome and Koro]ec, Peter}, year={2023} }","ama":"Ŝkvorc U, Eftimov T, Koro]ec P. Analyzing the Generalizability of Automated Algorithm Selection: A Case Study for Numerical Optimization. In: <i>2023 IEEE Symposium Series on Computational Intelligence (SSCI)</i>. IEEE; 2023. doi:<a href=\"https://doi.org/10.1109/ssci52147.2023.10371868\">10.1109/ssci52147.2023.10371868</a>","mla":"Ŝkvorc, Urban, et al. “Analyzing the Generalizability of Automated Algorithm Selection: A Case Study for Numerical Optimization.” <i>2023 IEEE Symposium Series on Computational Intelligence (SSCI)</i>, IEEE, 2023, doi:<a href=\"https://doi.org/10.1109/ssci52147.2023.10371868\">10.1109/ssci52147.2023.10371868</a>."},"publication":"2023 IEEE Symposium Series on Computational Intelligence (SSCI)","user_id":"103764","doi":"10.1109/ssci52147.2023.10371868","publisher":"IEEE","_id":"52863","language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2024-03-26T10:45:19Z","author":[{"first_name":"Urban","last_name":"Ŝkvorc","full_name":"Ŝkvorc, Urban"},{"full_name":"Eftimov, Tome","first_name":"Tome","last_name":"Eftimov"},{"last_name":"Koro]ec","first_name":"Peter","full_name":"Koro]ec, Peter"}],"year":"2023","title":"Analyzing the Generalizability of Automated Algorithm Selection: A Case Study for Numerical Optimization","status":"public"},{"citation":{"short":"A.-Y. Turhan, in: O. Kutz, C. Lutz, A. Ozaki (Eds.), Proceedings of the 36th International Workshop on Description Logics {(DL} 2023) Co-Located with the 20th International Conference on Principles of Knowledge Representation and Reasoning and the 21st International Workshop on Non-Monotonic Reasoning {(KR} 2023 and NMR 2023)., Rhodes, Greece, September 2-4, 2023, CEUR-WS.org, 2023.","chicago":"Turhan, Anni-Yasmin. “Brushing-up DLs to Cope with Imperfect Data (Abstract of Joint DL+NMR Invited Talk).” In <i>Proceedings of the 36th International Workshop on Description Logics {(DL} 2023) Co-Located with the 20th International Conference on Principles of Knowledge Representation and Reasoning and the 21st International Workshop on Non-Monotonic Reasoning {(KR} 2023 and NMR 2023)., Rhodes, Greece, September 2-4, 2023</i>, edited by Oliver Kutz, Carsten Lutz, and Ana Ozaki, Vol. 3515. CEUR Workshop Proceedings. CEUR-WS.org, 2023.","ieee":"A.-Y. Turhan, “Brushing-up DLs to Cope with Imperfect Data (Abstract of Joint DL+NMR Invited Talk),” in <i>Proceedings of the 36th International Workshop on Description Logics {(DL} 2023) co-located with the 20th International Conference on Principles of Knowledge Representation and Reasoning and the 21st International Workshop on Non-Monotonic Reasoning {(KR} 2023 and NMR 2023)., Rhodes, Greece, September 2-4, 2023</i>, 2023, vol. 3515.","apa":"Turhan, A.-Y. (2023). Brushing-up DLs to Cope with Imperfect Data (Abstract of Joint DL+NMR Invited Talk). In O. Kutz, C. Lutz, &#38; A. Ozaki (Eds.), <i>Proceedings of the 36th International Workshop on Description Logics {(DL} 2023) co-located with the 20th International Conference on Principles of Knowledge Representation and Reasoning and the 21st International Workshop on Non-Monotonic Reasoning {(KR} 2023 and NMR 2023)., Rhodes, Greece, September 2-4, 2023</i> (Vol. 3515). CEUR-WS.org.","bibtex":"@inproceedings{Turhan_2023, series={CEUR Workshop Proceedings}, title={Brushing-up DLs to Cope with Imperfect Data (Abstract of Joint DL+NMR Invited Talk)}, volume={3515}, booktitle={Proceedings of the 36th International Workshop on Description Logics {(DL} 2023) co-located with the 20th International Conference on Principles of Knowledge Representation and Reasoning and the 21st International Workshop on Non-Monotonic Reasoning {(KR} 2023 and NMR 2023)., Rhodes, Greece, September 2-4, 2023}, publisher={CEUR-WS.org}, author={Turhan, Anni-Yasmin}, editor={Kutz, Oliver and Lutz, Carsten and Ozaki, Ana}, year={2023}, collection={CEUR Workshop Proceedings} }","ama":"Turhan A-Y. Brushing-up DLs to Cope with Imperfect Data (Abstract of Joint DL+NMR Invited Talk). In: Kutz O, Lutz C, Ozaki A, eds. <i>Proceedings of the 36th International Workshop on Description Logics {(DL} 2023) Co-Located with the 20th International Conference on Principles of Knowledge Representation and Reasoning and the 21st International Workshop on Non-Monotonic Reasoning {(KR} 2023 and NMR 2023)., Rhodes, Greece, September 2-4, 2023</i>. Vol 3515. CEUR Workshop Proceedings. CEUR-WS.org; 2023.","mla":"Turhan, Anni-Yasmin. “Brushing-up DLs to Cope with Imperfect Data (Abstract of Joint DL+NMR Invited Talk).” <i>Proceedings of the 36th International Workshop on Description Logics {(DL} 2023) Co-Located with the 20th International Conference on Principles of Knowledge Representation and Reasoning and the 21st International Workshop on Non-Monotonic Reasoning {(KR} 2023 and NMR 2023)., Rhodes, Greece, September 2-4, 2023</i>, edited by Oliver Kutz et al., vol. 3515, CEUR-WS.org, 2023."},"publication":"Proceedings of the 36th International Workshop on Description Logics {(DL} 2023) co-located with the 20th International Conference on Principles of Knowledge Representation and Reasoning and the 21st International Workshop on Non-Monotonic Reasoning {(KR} 2023 and NMR 2023)., Rhodes, Greece, September 2-4, 2023","department":[{"_id":"888"}],"type":"conference","date_created":"2024-03-26T10:50:16Z","intvolume":"      3515","date_updated":"2024-03-26T10:50:47Z","author":[{"first_name":"Anni-Yasmin","last_name":"Turhan","full_name":"Turhan, Anni-Yasmin","id":"104470"}],"year":"2023","title":"Brushing-up DLs to Cope with Imperfect Data (Abstract of Joint DL+NMR Invited Talk)","status":"public","editor":[{"full_name":"Kutz, Oliver","last_name":"Kutz","first_name":"Oliver"},{"first_name":"Carsten","last_name":"Lutz","full_name":"Lutz, Carsten"},{"full_name":"Ozaki, Ana","last_name":"Ozaki","first_name":"Ana"}],"volume":3515,"user_id":"9503","_id":"52913","publisher":"CEUR-WS.org","series_title":"CEUR Workshop Proceedings","language":[{"iso":"eng"}]},{"publication":"Proceedings of the 23rd Koli Calling International Conference on Computing Education Research","citation":{"mla":"Sparmann, Sören, et al. “JuGaze: A Cell-Based Eye Tracking and Logging Tool for Jupyter Notebooks.” <i>Proceedings of the 23rd Koli Calling International Conference on Computing Education Research</i>, ACM, 2023, doi:<a href=\"https://doi.org/10.1145/3631802.3631824\">10.1145/3631802.3631824</a>.","bibtex":"@inproceedings{Sparmann_Hüsing_Schulte_2023, title={JuGaze: A Cell-based Eye Tracking and Logging Tool for Jupyter Notebooks}, DOI={<a href=\"https://doi.org/10.1145/3631802.3631824\">10.1145/3631802.3631824</a>}, booktitle={Proceedings of the 23rd Koli Calling International Conference on Computing Education Research}, publisher={ACM}, author={Sparmann, Sören and Hüsing, Sven and Schulte, Carsten}, year={2023} }","ama":"Sparmann S, Hüsing S, Schulte C. JuGaze: A Cell-based Eye Tracking and Logging Tool for Jupyter Notebooks. In: <i>Proceedings of the 23rd Koli Calling International Conference on Computing Education Research</i>. ACM; 2023. doi:<a href=\"https://doi.org/10.1145/3631802.3631824\">10.1145/3631802.3631824</a>","ieee":"S. Sparmann, S. Hüsing, and C. Schulte, “JuGaze: A Cell-based Eye Tracking and Logging Tool for Jupyter Notebooks,” 2023, doi: <a href=\"https://doi.org/10.1145/3631802.3631824\">10.1145/3631802.3631824</a>.","apa":"Sparmann, S., Hüsing, S., &#38; Schulte, C. (2023). JuGaze: A Cell-based Eye Tracking and Logging Tool for Jupyter Notebooks. <i>Proceedings of the 23rd Koli Calling International Conference on Computing Education Research</i>. <a href=\"https://doi.org/10.1145/3631802.3631824\">https://doi.org/10.1145/3631802.3631824</a>","short":"S. Sparmann, S. Hüsing, C. Schulte, in: Proceedings of the 23rd Koli Calling International Conference on Computing Education Research, ACM, 2023.","chicago":"Sparmann, Sören, Sven Hüsing, and Carsten Schulte. “JuGaze: A Cell-Based Eye Tracking and Logging Tool for Jupyter Notebooks.” In <i>Proceedings of the 23rd Koli Calling International Conference on Computing Education Research</i>. ACM, 2023. <a href=\"https://doi.org/10.1145/3631802.3631824\">https://doi.org/10.1145/3631802.3631824</a>."},"type":"conference","department":[{"_id":"67"}],"date_created":"2024-03-08T08:02:10Z","publication_status":"published","date_updated":"2024-04-11T12:30:59Z","year":"2023","title":"JuGaze: A Cell-based Eye Tracking and Logging Tool for Jupyter Notebooks","status":"public","author":[{"id":"63216","full_name":"Sparmann, Sören","last_name":"Sparmann","first_name":"Sören"},{"id":"58465","first_name":"Sven","last_name":"Hüsing","full_name":"Hüsing, Sven"},{"last_name":"Schulte","first_name":"Carsten","full_name":"Schulte, Carsten","id":"60311"}],"user_id":"58465","doi":"10.1145/3631802.3631824","language":[{"iso":"eng"}],"_id":"52380","publisher":"ACM"},{"date_created":"2023-07-28T09:42:14Z","type":"conference","department":[{"_id":"27"},{"_id":"518"}],"publication":"Proceedings of the Platform for Advanced Scientific Computing Conference (PASC)","citation":{"mla":"Faj, Jennifer, et al. “Scalable Multi-FPGA Design of a Discontinuous Galerkin Shallow-Water Model on Unstructured Meshes.” <i>Proceedings of the Platform for Advanced Scientific Computing Conference (PASC)</i>, ACM, 2023, doi:<a href=\"https://doi.org/10.1145/3592979.3593407\">10.1145/3592979.3593407</a>.","ama":"Faj J, Kenter T, Faghih-Naini S, Plessl C, Aizinger V. Scalable Multi-FPGA Design of a Discontinuous Galerkin Shallow-Water Model on Unstructured Meshes. In: <i>Proceedings of the Platform for Advanced Scientific Computing Conference (PASC)</i>. ACM; 2023. doi:<a href=\"https://doi.org/10.1145/3592979.3593407\">10.1145/3592979.3593407</a>","bibtex":"@inproceedings{Faj_Kenter_Faghih-Naini_Plessl_Aizinger_2023, title={Scalable Multi-FPGA Design of a Discontinuous Galerkin Shallow-Water Model on Unstructured Meshes}, DOI={<a href=\"https://doi.org/10.1145/3592979.3593407\">10.1145/3592979.3593407</a>}, booktitle={Proceedings of the Platform for Advanced Scientific Computing Conference (PASC)}, publisher={ACM}, author={Faj, Jennifer and Kenter, Tobias and Faghih-Naini, Sara and Plessl, Christian and Aizinger, Vadym}, year={2023} }","apa":"Faj, J., Kenter, T., Faghih-Naini, S., Plessl, C., &#38; Aizinger, V. (2023). Scalable Multi-FPGA Design of a Discontinuous Galerkin Shallow-Water Model on Unstructured Meshes. <i>Proceedings of the Platform for Advanced Scientific Computing Conference (PASC)</i>. <a href=\"https://doi.org/10.1145/3592979.3593407\">https://doi.org/10.1145/3592979.3593407</a>","ieee":"J. Faj, T. Kenter, S. Faghih-Naini, C. Plessl, and V. Aizinger, “Scalable Multi-FPGA Design of a Discontinuous Galerkin Shallow-Water Model on Unstructured Meshes,” 2023, doi: <a href=\"https://doi.org/10.1145/3592979.3593407\">10.1145/3592979.3593407</a>.","chicago":"Faj, Jennifer, Tobias Kenter, Sara Faghih-Naini, Christian Plessl, and Vadym Aizinger. “Scalable Multi-FPGA Design of a Discontinuous Galerkin Shallow-Water Model on Unstructured Meshes.” In <i>Proceedings of the Platform for Advanced Scientific Computing Conference (PASC)</i>. ACM, 2023. <a href=\"https://doi.org/10.1145/3592979.3593407\">https://doi.org/10.1145/3592979.3593407</a>.","short":"J. Faj, T. Kenter, S. Faghih-Naini, C. Plessl, V. Aizinger, in: Proceedings of the Platform for Advanced Scientific Computing Conference (PASC), ACM, 2023."},"quality_controlled":"1","related_material":{"link":[{"description":"Open Access available via this link.","url":"https://www.sighpc.org/for-our-community/acm-open-tocs/pasc23-open-toc","relation":"other"}]},"project":[{"_id":"52","name":"PC2: Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"main_file_link":[{"url":"https://dl.acm.org/doi/pdf/10.1145/3592979.3593407"}],"_id":"46188","publisher":"ACM","language":[{"iso":"eng"}],"user_id":"3145","doi":"10.1145/3592979.3593407","title":"Scalable Multi-FPGA Design of a Discontinuous Galerkin Shallow-Water Model on Unstructured Meshes","status":"public","year":"2023","author":[{"full_name":"Faj, Jennifer","last_name":"Faj","first_name":"Jennifer","id":"78722"},{"id":"3145","last_name":"Kenter","first_name":"Tobias","full_name":"Kenter, Tobias"},{"full_name":"Faghih-Naini, Sara","last_name":"Faghih-Naini","first_name":"Sara"},{"id":"16153","full_name":"Plessl, Christian","last_name":"Plessl","first_name":"Christian","orcid":"0000-0001-5728-9982"},{"full_name":"Aizinger, Vadym","first_name":"Vadym","last_name":"Aizinger"}],"publication_status":"published","date_updated":"2024-04-17T08:09:39Z"},{"department":[{"_id":"27"},{"_id":"518"}],"type":"conference","date_created":"2023-07-28T09:46:25Z","project":[{"name":"PC2: Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"quality_controlled":"1","related_material":{"link":[{"description":"Open Access available via this link.","relation":"other","url":" https://www.sighpc.org/for-our-community/acm-open-tocs/pasc23-open-toc "}]},"citation":{"chicago":"Prouveur, Charles, Matthieu Haefele, Tobias Kenter, and Nils Voss. “FPGA Acceleration for HPC Supercapacitor Simulations.” In <i>Proceedings of the Platform for Advanced Scientific Computing Conference (PASC)</i>. ACM, 2023. <a href=\"https://doi.org/10.1145/3592979.3593419\">https://doi.org/10.1145/3592979.3593419</a>.","short":"C. Prouveur, M. Haefele, T. Kenter, N. Voss, in: Proceedings of the Platform for Advanced Scientific Computing Conference (PASC), ACM, 2023.","apa":"Prouveur, C., Haefele, M., Kenter, T., &#38; Voss, N. (2023). FPGA Acceleration for HPC Supercapacitor Simulations. <i>Proceedings of the Platform for Advanced Scientific Computing Conference (PASC)</i>. <a href=\"https://doi.org/10.1145/3592979.3593419\">https://doi.org/10.1145/3592979.3593419</a>","ieee":"C. Prouveur, M. Haefele, T. Kenter, and N. Voss, “FPGA Acceleration for HPC Supercapacitor Simulations,” 2023, doi: <a href=\"https://doi.org/10.1145/3592979.3593419\">10.1145/3592979.3593419</a>.","ama":"Prouveur C, Haefele M, Kenter T, Voss N. FPGA Acceleration for HPC Supercapacitor Simulations. In: <i>Proceedings of the Platform for Advanced Scientific Computing Conference (PASC)</i>. ACM; 2023. doi:<a href=\"https://doi.org/10.1145/3592979.3593419\">10.1145/3592979.3593419</a>","bibtex":"@inproceedings{Prouveur_Haefele_Kenter_Voss_2023, title={FPGA Acceleration for HPC Supercapacitor Simulations}, DOI={<a href=\"https://doi.org/10.1145/3592979.3593419\">10.1145/3592979.3593419</a>}, booktitle={Proceedings of the Platform for Advanced Scientific Computing Conference (PASC)}, publisher={ACM}, author={Prouveur, Charles and Haefele, Matthieu and Kenter, Tobias and Voss, Nils}, year={2023} }","mla":"Prouveur, Charles, et al. “FPGA Acceleration for HPC Supercapacitor Simulations.” <i>Proceedings of the Platform for Advanced Scientific Computing Conference (PASC)</i>, ACM, 2023, doi:<a href=\"https://doi.org/10.1145/3592979.3593419\">10.1145/3592979.3593419</a>."},"publication":"Proceedings of the Platform for Advanced Scientific Computing Conference (PASC)","doi":"10.1145/3592979.3593419","user_id":"3145","language":[{"iso":"eng"}],"_id":"46189","publisher":"ACM","main_file_link":[{"url":"https://dl.acm.org/doi/pdf/10.1145/3592979.3593419"}],"date_updated":"2024-04-17T08:10:51Z","publication_status":"published","author":[{"last_name":"Prouveur","first_name":"Charles","full_name":"Prouveur, Charles"},{"full_name":"Haefele, Matthieu","first_name":"Matthieu","last_name":"Haefele"},{"full_name":"Kenter, Tobias","last_name":"Kenter","first_name":"Tobias","id":"3145"},{"first_name":"Nils","last_name":"Voss","full_name":"Voss, Nils"}],"year":"2023","status":"public","title":"FPGA Acceleration for HPC Supercapacitor Simulations"}]