[{"has_accepted_license":"1","status":"public","user_id":"75963","ddc":["540"],"volume":152,"_id":"16277","quality_controlled":"1","project":[{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"},{"name":"Performance and Efficiency in HPC with Custom Computing","_id":"32","grant_number":"PL 595/2-1 / 320898746"},{"name":"PC2: Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"file_date_updated":"2020-05-25T15:21:56Z","citation":{"ieee":"T. Kühne <i>et al.</i>, “CP2K: An electronic structure and molecular dynamics software package - Quickstep: Efficient and accurate electronic structure calculations,” <i>The Journal of Chemical Physics</i>, vol. 152, no. 19, Art. no. 194103, 2020, doi: <a href=\"https://doi.org/10.1063/5.0007045\">10.1063/5.0007045</a>.","mla":"Kühne, Thomas, et al. “CP2K: An Electronic Structure and Molecular Dynamics Software Package - Quickstep: Efficient and Accurate Electronic Structure Calculations.” <i>The Journal of Chemical Physics</i>, vol. 152, no. 19, 194103, 2020, doi:<a href=\"https://doi.org/10.1063/5.0007045\">10.1063/5.0007045</a>.","apa":"Kühne, T., Iannuzzi, M., Ben, M. D., Rybkin, V. V., Seewald, P., Stein, F., Laino, T., Khaliullin, R. Z., Schütt, O., Schiffmann, F., Golze, D., Wilhelm, J., Chulkov, S., Mohammad Hossein Bani-Hashemian, M. H. B.-H., Weber, V., Borstnik, U., Taillefumier, M., Jakobovits, A. S., Lazzaro, A., … Hutter, J. (2020). CP2K: An electronic structure and molecular dynamics software package - Quickstep: Efficient and accurate electronic structure calculations. <i>The Journal of Chemical Physics</i>, <i>152</i>(19), Article 194103. <a href=\"https://doi.org/10.1063/5.0007045\">https://doi.org/10.1063/5.0007045</a>","bibtex":"@article{Kühne_Iannuzzi_Ben_Rybkin_Seewald_Stein_Laino_Khaliullin_Schütt_Schiffmann_et al._2020, title={CP2K: An electronic structure and molecular dynamics software package - Quickstep: Efficient and accurate electronic structure calculations}, volume={152}, DOI={<a href=\"https://doi.org/10.1063/5.0007045\">10.1063/5.0007045</a>}, number={19194103}, journal={The Journal of Chemical Physics}, author={Kühne, Thomas and Iannuzzi, Marcella and Ben, Mauro Del and Rybkin, Vladimir V. and Seewald, Patrick and Stein, Frederick and Laino, Teodoro and Khaliullin, Rustam Z. and Schütt, Ole and Schiffmann, Florian and et al.}, year={2020} }","ama":"Kühne T, Iannuzzi M, Ben MD, et al. CP2K: An electronic structure and molecular dynamics software package - Quickstep: Efficient and accurate electronic structure calculations. <i>The Journal of Chemical Physics</i>. 2020;152(19). doi:<a href=\"https://doi.org/10.1063/5.0007045\">10.1063/5.0007045</a>","short":"T. Kühne, M. Iannuzzi, M.D. Ben, V.V. Rybkin, P. Seewald, F. Stein, T. Laino, R.Z. Khaliullin, O. Schütt, F. Schiffmann, D. Golze, J. Wilhelm, S. Chulkov, M.H.B.-H. Mohammad Hossein Bani-Hashemian, V. Weber, U. Borstnik, M. Taillefumier, A.S. Jakobovits, A. Lazzaro, H. Pabst, T. Müller, R. Schade, M. Guidon, S. Andermatt, N. Holmberg, G.K. Schenter, A. Hehn, A. Bussy, F. Belleflamme, G. Tabacchi, A. Glöß, M. Lass, I. Bethune, C.J. Mundy, C. Plessl, M. Watkins, J. VandeVondele, M. Krack, J. Hutter, The Journal of Chemical Physics 152 (2020).","chicago":"Kühne, Thomas, Marcella Iannuzzi, Mauro Del Ben, Vladimir V. Rybkin, Patrick Seewald, Frederick Stein, Teodoro Laino, et al. “CP2K: An Electronic Structure and Molecular Dynamics Software Package - Quickstep: Efficient and Accurate Electronic Structure Calculations.” <i>The Journal of Chemical Physics</i> 152, no. 19 (2020). <a href=\"https://doi.org/10.1063/5.0007045\">https://doi.org/10.1063/5.0007045</a>."},"oa":"1","external_id":{"arxiv":["2003.03868"]},"publication_status":"published","date_updated":"2023-08-02T14:56:21Z","intvolume":"       152","year":"2020","title":"CP2K: An electronic structure and molecular dynamics software package - Quickstep: Efficient and accurate electronic structure calculations","author":[{"full_name":"Kühne, Thomas","first_name":"Thomas","last_name":"Kühne","id":"49079"},{"last_name":"Iannuzzi","first_name":"Marcella","full_name":"Iannuzzi, Marcella"},{"full_name":"Ben, Mauro Del","last_name":"Ben","first_name":"Mauro Del"},{"first_name":"Vladimir V.","last_name":"Rybkin","full_name":"Rybkin, Vladimir V."},{"full_name":"Seewald, Patrick","last_name":"Seewald","first_name":"Patrick"},{"first_name":"Frederick","last_name":"Stein","full_name":"Stein, Frederick"},{"full_name":"Laino, Teodoro","first_name":"Teodoro","last_name":"Laino"},{"last_name":"Khaliullin","first_name":"Rustam Z.","full_name":"Khaliullin, Rustam Z."},{"full_name":"Schütt, Ole","first_name":"Ole","last_name":"Schütt"},{"first_name":"Florian","last_name":"Schiffmann","full_name":"Schiffmann, Florian"},{"last_name":"Golze","first_name":"Dorothea","full_name":"Golze, Dorothea"},{"full_name":"Wilhelm, Jan","first_name":"Jan","last_name":"Wilhelm"},{"full_name":"Chulkov, Sergey","last_name":"Chulkov","first_name":"Sergey"},{"full_name":"Mohammad Hossein Bani-Hashemian, Mohammad Hossein Bani-Hashemian","first_name":"Mohammad Hossein Bani-Hashemian","last_name":"Mohammad Hossein Bani-Hashemian"},{"first_name":"Valéry","last_name":"Weber","full_name":"Weber, Valéry"},{"full_name":"Borstnik, Urban","first_name":"Urban","last_name":"Borstnik"},{"first_name":"Mathieu","last_name":"Taillefumier","full_name":"Taillefumier, Mathieu"},{"full_name":"Jakobovits, Alice Shoshana","first_name":"Alice Shoshana","last_name":"Jakobovits"},{"full_name":"Lazzaro, Alfio","first_name":"Alfio","last_name":"Lazzaro"},{"full_name":"Pabst, Hans","first_name":"Hans","last_name":"Pabst"},{"full_name":"Müller, Tiziano","first_name":"Tiziano","last_name":"Müller"},{"orcid":"0000-0002-6268-539","last_name":"Schade","first_name":"Robert","full_name":"Schade, Robert","id":"75963"},{"first_name":"Manuel","last_name":"Guidon","full_name":"Guidon, Manuel"},{"first_name":"Samuel","last_name":"Andermatt","full_name":"Andermatt, Samuel"},{"last_name":"Holmberg","first_name":"Nico","full_name":"Holmberg, Nico"},{"full_name":"Schenter, Gregory K.","first_name":"Gregory K.","last_name":"Schenter"},{"full_name":"Hehn, Anna","first_name":"Anna","last_name":"Hehn"},{"last_name":"Bussy","first_name":"Augustin","full_name":"Bussy, Augustin"},{"full_name":"Belleflamme, Fabian","last_name":"Belleflamme","first_name":"Fabian"},{"last_name":"Tabacchi","first_name":"Gloria","full_name":"Tabacchi, Gloria"},{"full_name":"Glöß, Andreas","last_name":"Glöß","first_name":"Andreas"},{"id":"24135","orcid":"0000-0002-5708-7632","first_name":"Michael","last_name":"Lass","full_name":"Lass, Michael"},{"full_name":"Bethune, Iain","last_name":"Bethune","first_name":"Iain"},{"last_name":"Mundy","first_name":"Christopher J.","full_name":"Mundy, Christopher J."},{"first_name":"Christian","orcid":"0000-0001-5728-9982","last_name":"Plessl","full_name":"Plessl, Christian","id":"16153"},{"last_name":"Watkins","first_name":"Matt","full_name":"Watkins, Matt"},{"full_name":"VandeVondele, Joost","first_name":"Joost","last_name":"VandeVondele"},{"first_name":"Matthias","last_name":"Krack","full_name":"Krack, Matthias"},{"full_name":"Hutter, Jürg","first_name":"Jürg","last_name":"Hutter"}],"doi":"10.1063/5.0007045","article_number":"194103","main_file_link":[{"url":"https://aip.scitation.org/doi/pdf/10.1063/5.0007045?download=true","open_access":"1"}],"language":[{"iso":"eng"}],"abstract":[{"text":"CP2K is an open source electronic structure and molecular dynamics software package to perform atomistic simulations of solid-state, liquid, molecular, and biological systems. It is especially aimed at massively parallel and linear-scaling electronic structure methods and state-of-theart ab initio molecular dynamics simulations. Excellent performance for electronic structure calculations is achieved using novel algorithms implemented for modern high-performance computing systems. This review revisits the main capabilities of CP2K to perform efficient and accurate electronic structure simulations. The emphasis is put on density functional theory and multiple post–Hartree–Fock methods using the Gaussian and plane wave approach and its augmented all-electron extension.","lang":"eng"}],"issue":"19","publication":"The Journal of Chemical Physics","type":"journal_article","department":[{"_id":"27"},{"_id":"518"},{"_id":"304"}],"file":[{"file_id":"17061","content_type":"application/pdf","success":1,"file_name":"5.0007045.pdf","file_size":4887650,"access_level":"closed","relation":"main_file","date_updated":"2020-05-25T15:21:56Z","date_created":"2020-05-25T15:21:56Z","creator":"lass"}],"date_created":"2020-03-10T15:12:31Z"},{"title":"A Submatrix-Based Method for Approximate Matrix Function Evaluation in the Quantum Chemistry Code CP2K","year":"2020","author":[{"full_name":"Lass, Michael","orcid":"0000-0002-5708-7632","first_name":"Michael","last_name":"Lass","id":"24135"},{"first_name":"Robert","last_name":"Schade","orcid":"0000-0002-6268-539","full_name":"Schade, Robert","id":"75963"},{"id":"49079","first_name":"Thomas","last_name":"Kühne","full_name":"Kühne, Thomas"},{"first_name":"Christian","last_name":"Plessl","orcid":"0000-0001-5728-9982","full_name":"Plessl, Christian","id":"16153"}],"date_updated":"2023-08-02T14:55:59Z","main_file_link":[{"url":"https://ieeexplore.ieee.org/document/9355245"}],"language":[{"iso":"eng"}],"doi":"10.1109/SC41405.2020.00084","publication":"Proc. International Conference for High Performance Computing, Networking, Storage and Analysis (SC)","abstract":[{"text":"Electronic structure calculations based on density-functional theory (DFT)\r\nrepresent a significant part of today's HPC workloads and pose high demands on\r\nhigh-performance computing resources. To perform these quantum-mechanical DFT\r\ncalculations on complex large-scale systems, so-called linear scaling methods\r\ninstead of conventional cubic scaling methods are required. In this work, we\r\ntake up the idea of the submatrix method and apply it to the DFT computations\r\nin the software package CP2K. For that purpose, we transform the underlying\r\nnumeric operations on distributed, large, sparse matrices into computations on\r\nlocal, much smaller and nearly dense matrices. This allows us to exploit the\r\nfull floating-point performance of modern CPUs and to make use of dedicated\r\naccelerator hardware, where performance has been limited by memory bandwidth\r\nbefore. We demonstrate both functionality and performance of our implementation\r\nand show how it can be accelerated with GPUs and FPGAs.","lang":"eng"}],"date_created":"2020-04-28T14:44:21Z","type":"conference","department":[{"_id":"27"},{"_id":"518"},{"_id":"304"}],"status":"public","conference":{"location":"Atlanta, GA, US","name":"SC20: International Conference for High Performance Computing, Networking, Storage and Analysis (SC)"},"page":"1127-1140","_id":"16898","publisher":"IEEE Computer Society","user_id":"75963","citation":{"short":"M. Lass, R. Schade, T. Kühne, C. Plessl, in: Proc. International Conference for High Performance Computing, Networking, Storage and Analysis (SC), IEEE Computer Society, Los Alamitos, CA, USA, 2020, pp. 1127–1140.","chicago":"Lass, Michael, Robert Schade, Thomas Kühne, and Christian Plessl. “A Submatrix-Based Method for Approximate Matrix Function Evaluation in the Quantum Chemistry Code CP2K.” In <i>Proc. International Conference for High Performance Computing, Networking, Storage and Analysis (SC)</i>, 1127–40. Los Alamitos, CA, USA: IEEE Computer Society, 2020. <a href=\"https://doi.org/10.1109/SC41405.2020.00084\">https://doi.org/10.1109/SC41405.2020.00084</a>.","ieee":"M. Lass, R. Schade, T. Kühne, and C. Plessl, “A Submatrix-Based Method for Approximate Matrix Function Evaluation in the Quantum Chemistry Code CP2K,” in <i>Proc. International Conference for High Performance Computing, Networking, Storage and Analysis (SC)</i>, Atlanta, GA, US, 2020, pp. 1127–1140, doi: <a href=\"https://doi.org/10.1109/SC41405.2020.00084\">10.1109/SC41405.2020.00084</a>.","apa":"Lass, M., Schade, R., Kühne, T., &#38; Plessl, C. (2020). A Submatrix-Based Method for Approximate Matrix Function Evaluation in the Quantum Chemistry Code CP2K. <i>Proc. International Conference for High Performance Computing, Networking, Storage and Analysis (SC)</i>, 1127–1140. <a href=\"https://doi.org/10.1109/SC41405.2020.00084\">https://doi.org/10.1109/SC41405.2020.00084</a>","bibtex":"@inproceedings{Lass_Schade_Kühne_Plessl_2020, place={Los Alamitos, CA, USA}, title={A Submatrix-Based Method for Approximate Matrix Function Evaluation in the Quantum Chemistry Code CP2K}, DOI={<a href=\"https://doi.org/10.1109/SC41405.2020.00084\">10.1109/SC41405.2020.00084</a>}, booktitle={Proc. International Conference for High Performance Computing, Networking, Storage and Analysis (SC)}, publisher={IEEE Computer Society}, author={Lass, Michael and Schade, Robert and Kühne, Thomas and Plessl, Christian}, year={2020}, pages={1127–1140} }","ama":"Lass M, Schade R, Kühne T, Plessl C. A Submatrix-Based Method for Approximate Matrix Function Evaluation in the Quantum Chemistry Code CP2K. In: <i>Proc. International Conference for High Performance Computing, Networking, Storage and Analysis (SC)</i>. IEEE Computer Society; 2020:1127-1140. doi:<a href=\"https://doi.org/10.1109/SC41405.2020.00084\">10.1109/SC41405.2020.00084</a>","mla":"Lass, Michael, et al. “A Submatrix-Based Method for Approximate Matrix Function Evaluation in the Quantum Chemistry Code CP2K.” <i>Proc. International Conference for High Performance Computing, Networking, Storage and Analysis (SC)</i>, IEEE Computer Society, 2020, pp. 1127–40, doi:<a href=\"https://doi.org/10.1109/SC41405.2020.00084\">10.1109/SC41405.2020.00084</a>."},"quality_controlled":"1","project":[{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"},{"grant_number":"PL 595/2-1 / 320898746","_id":"32","name":"Performance and Efficiency in HPC with Custom Computing"},{"name":"PC2: Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"external_id":{"arxiv":["2004.10811"]},"place":"Los Alamitos, CA, USA"},{"publication":"Knowledge Graphs for eXplainable Artificial Intelligence: Foundations, Applications and Challenges","citation":{"bibtex":"@inbook{Röder_Sherif_Saleem_Conrads_Ngonga Ngomo_2020, title={Benchmarking the Lifecycle of Knowledge Graphs}, DOI={<a href=\"https://doi.org/10.3233/SSW200012\">10.3233/SSW200012</a>}, booktitle={Knowledge Graphs for eXplainable Artificial Intelligence: Foundations, Applications and Challenges}, publisher={IOS Press}, author={Röder, Michael and Sherif, Mohamed and Saleem, Muhammad and Conrads, Felix and Ngonga Ngomo, Axel-Cyrille}, editor={Tiddi, Ilaria and Lécué, Freddy and Hitzler, Pascal}, year={2020}, pages={73–97} }","ama":"Röder M, Sherif M, Saleem M, Conrads F, Ngonga Ngomo A-C. Benchmarking the Lifecycle of Knowledge Graphs. In: Tiddi I, Lécué F, Hitzler P, eds. <i>Knowledge Graphs for EXplainable Artificial Intelligence: Foundations, Applications and Challenges</i>. IOS Press; 2020:73-97. doi:<a href=\"https://doi.org/10.3233/SSW200012\">10.3233/SSW200012</a>","mla":"Röder, Michael, et al. “Benchmarking the Lifecycle of Knowledge Graphs.” <i>Knowledge Graphs for EXplainable Artificial Intelligence: Foundations, Applications and Challenges</i>, edited by Ilaria Tiddi et al., IOS Press, 2020, pp. 73–97, doi:<a href=\"https://doi.org/10.3233/SSW200012\">10.3233/SSW200012</a>.","short":"M. Röder, M. Sherif, M. Saleem, F. Conrads, A.-C. Ngonga Ngomo, in: I. Tiddi, F. Lécué, P. Hitzler (Eds.), Knowledge Graphs for EXplainable Artificial Intelligence: Foundations, Applications and Challenges, IOS Press, 2020, pp. 73–97.","chicago":"Röder, Michael, Mohamed Sherif, Muhammad Saleem, Felix Conrads, and Axel-Cyrille Ngonga Ngomo. “Benchmarking the Lifecycle of Knowledge Graphs.” In <i>Knowledge Graphs for EXplainable Artificial Intelligence: Foundations, Applications and Challenges</i>, edited by Ilaria Tiddi, Freddy Lécué, and Pascal Hitzler, 73–97. IOS Press, 2020. <a href=\"https://doi.org/10.3233/SSW200012\">https://doi.org/10.3233/SSW200012</a>.","ieee":"M. Röder, M. Sherif, M. Saleem, F. Conrads, and A.-C. Ngonga Ngomo, “Benchmarking the Lifecycle of Knowledge Graphs,” in <i>Knowledge Graphs for eXplainable Artificial Intelligence: Foundations, Applications and Challenges</i>, I. Tiddi, F. Lécué, and P. Hitzler, Eds. IOS Press, 2020, pp. 73–97.","apa":"Röder, M., Sherif, M., Saleem, M., Conrads, F., &#38; Ngonga Ngomo, A.-C. (2020). Benchmarking the Lifecycle of Knowledge Graphs. In I. Tiddi, F. Lécué, &#38; P. Hitzler (Eds.), <i>Knowledge Graphs for eXplainable Artificial Intelligence: Foundations, Applications and Challenges</i> (pp. 73–97). IOS Press. <a href=\"https://doi.org/10.3233/SSW200012\">https://doi.org/10.3233/SSW200012</a>"},"keyword":["dice group_aksw roeder sherif saleem fconrads ngonga"],"type":"book_chapter","department":[{"_id":"574"}],"date_created":"2021-12-17T10:06:12Z","date_updated":"2023-08-16T09:32:51Z","year":"2020","title":"Benchmarking the Lifecycle of Knowledge Graphs","status":"public","author":[{"full_name":"Röder, Michael","last_name":"Röder","first_name":"Michael"},{"id":"67234","full_name":"Sherif, Mohamed","first_name":"Mohamed","orcid":"https://orcid.org/0000-0002-9927-2203","last_name":"Sherif"},{"full_name":"Saleem, Muhammad","first_name":"Muhammad","last_name":"Saleem"},{"first_name":"Felix","last_name":"Conrads","full_name":"Conrads, Felix"},{"id":"65716","first_name":"Axel-Cyrille","last_name":"Ngonga Ngomo","full_name":"Ngonga Ngomo, Axel-Cyrille"}],"doi":"10.3233/SSW200012","user_id":"67234","editor":[{"full_name":"Tiddi, Ilaria","first_name":"Ilaria","last_name":"Tiddi"},{"last_name":"Lécué","first_name":"Freddy","full_name":"Lécué, Freddy"},{"last_name":"Hitzler","first_name":"Pascal","full_name":"Hitzler, Pascal"}],"page":"73-97","_id":"29042","language":[{"iso":"eng"}],"publisher":"IOS Press"},{"publication":"2020 IEEE/ACM International Workshop on Heterogeneous High-performance Reconfigurable Computing (H2RC)","related_material":{"link":[{"url":"https://github.com/pc2/HPCC_FPGA","relation":"supplementary_material","description":"Official repository of the benchmark suite on GitHub"}]},"abstract":[{"lang":"eng","text":"FPGAs have found increasing adoption in data center applications since a new generation of high-level tools have become available which noticeably reduce development time for FPGA accelerators and still provide high-quality results. There is, however, no high-level benchmark suite available, which specifically enables a comparison of FPGA architectures, programming tools, and libraries for HPC applications. To fill this gap, we have developed an OpenCL-based open-source implementation of the HPCC benchmark suite for Xilinx and Intel FPGAs. This benchmark can serve to analyze the current capabilities of FPGA devices, cards, and development tool flows, track progress over time, and point out specific difficulties for FPGA acceleration in the HPC domain. Additionally, the benchmark documents proven performance optimization patterns. We will continue optimizing and porting the benchmark for new generations of FPGAs and design tools and encourage active participation to create a valuable tool for the community. To fill this gap, we have developed an OpenCL-based open-source implementation of the HPCC benchmark suite for Xilinx and Intel FPGAs. This benchmark can serve to analyze the current capabilities of FPGA devices, cards, and development tool flows, track progress over time, and point out specific difficulties for FPGA acceleration in the HPC domain. Additionally, the benchmark documents proven performance optimization patterns. We will continue optimizing and porting the benchmark for new generations of FPGAs and design tools and encourage active participation to create a valuable tool for the community."}],"date_created":"2021-04-16T10:17:22Z","keyword":["FPGA","OpenCL","High Level Synthesis","HPC benchmarking"],"type":"conference","department":[{"_id":"27"},{"_id":"518"}],"title":"Evaluating FPGA Accelerator Performance with a Parameterized OpenCL Adaptation of Selected Benchmarks of the HPCChallenge Benchmark Suite","year":"2020","author":[{"first_name":"Marius","last_name":"Meyer","full_name":"Meyer, Marius","id":"40778"},{"last_name":"Kenter","first_name":"Tobias","full_name":"Kenter, Tobias","id":"3145"},{"id":"16153","orcid":"0000-0001-5728-9982","first_name":"Christian","last_name":"Plessl","full_name":"Plessl, Christian"}],"publication_identifier":{"isbn":["9781665415927"]},"date_updated":"2023-09-26T11:42:53Z","publication_status":"published","main_file_link":[{"url":"https://ieeexplore.ieee.org/document/9306963"}],"language":[{"iso":"eng"}],"doi":"10.1109/h2rc51942.2020.00007","citation":{"ama":"Meyer M, Kenter T, Plessl C. Evaluating FPGA Accelerator Performance with a Parameterized OpenCL Adaptation of Selected Benchmarks of the HPCChallenge Benchmark Suite. In: <i>2020 IEEE/ACM International Workshop on Heterogeneous High-Performance Reconfigurable Computing (H2RC)</i>. ; 2020. doi:<a href=\"https://doi.org/10.1109/h2rc51942.2020.00007\">10.1109/h2rc51942.2020.00007</a>","short":"M. Meyer, T. Kenter, C. Plessl, in: 2020 IEEE/ACM International Workshop on Heterogeneous High-Performance Reconfigurable Computing (H2RC), 2020.","chicago":"Meyer, Marius, Tobias Kenter, and Christian Plessl. “Evaluating FPGA Accelerator Performance with a Parameterized OpenCL Adaptation of Selected Benchmarks of the HPCChallenge Benchmark Suite.” In <i>2020 IEEE/ACM International Workshop on Heterogeneous High-Performance Reconfigurable Computing (H2RC)</i>, 2020. <a href=\"https://doi.org/10.1109/h2rc51942.2020.00007\">https://doi.org/10.1109/h2rc51942.2020.00007</a>.","bibtex":"@inproceedings{Meyer_Kenter_Plessl_2020, title={Evaluating FPGA Accelerator Performance with a Parameterized OpenCL Adaptation of Selected Benchmarks of the HPCChallenge Benchmark Suite}, DOI={<a href=\"https://doi.org/10.1109/h2rc51942.2020.00007\">10.1109/h2rc51942.2020.00007</a>}, booktitle={2020 IEEE/ACM International Workshop on Heterogeneous High-performance Reconfigurable Computing (H2RC)}, author={Meyer, Marius and Kenter, Tobias and Plessl, Christian}, year={2020} }","mla":"Meyer, Marius, et al. “Evaluating FPGA Accelerator Performance with a Parameterized OpenCL Adaptation of Selected Benchmarks of the HPCChallenge Benchmark Suite.” <i>2020 IEEE/ACM International Workshop on Heterogeneous High-Performance Reconfigurable Computing (H2RC)</i>, 2020, doi:<a href=\"https://doi.org/10.1109/h2rc51942.2020.00007\">10.1109/h2rc51942.2020.00007</a>.","apa":"Meyer, M., Kenter, T., &#38; Plessl, C. (2020). Evaluating FPGA Accelerator Performance with a Parameterized OpenCL Adaptation of Selected Benchmarks of the HPCChallenge Benchmark Suite. <i>2020 IEEE/ACM International Workshop on Heterogeneous High-Performance Reconfigurable Computing (H2RC)</i>. <a href=\"https://doi.org/10.1109/h2rc51942.2020.00007\">https://doi.org/10.1109/h2rc51942.2020.00007</a>","ieee":"M. Meyer, T. Kenter, and C. Plessl, “Evaluating FPGA Accelerator Performance with a Parameterized OpenCL Adaptation of Selected Benchmarks of the HPCChallenge Benchmark Suite,” 2020, doi: <a href=\"https://doi.org/10.1109/h2rc51942.2020.00007\">10.1109/h2rc51942.2020.00007</a>."},"quality_controlled":"1","project":[{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"status":"public","_id":"21632","user_id":"15278"},{"publisher":"MDPI","_id":"12878","user_id":"15278","volume":8,"status":"public","external_id":{"arxiv":["1907.08497"]},"oa":"1","citation":{"ieee":"V. Rengaraj, M. Lass, C. Plessl, and T. Kühne, “Accurate Sampling with Noisy Forces from Approximate Computing,” <i>Computation</i>, vol. 8, no. 2, Art. no. 39, 2020, doi: <a href=\"https://doi.org/10.3390/computation8020039\">10.3390/computation8020039</a>.","apa":"Rengaraj, V., Lass, M., Plessl, C., &#38; Kühne, T. (2020). Accurate Sampling with Noisy Forces from Approximate Computing. <i>Computation</i>, <i>8</i>(2), Article 39. <a href=\"https://doi.org/10.3390/computation8020039\">https://doi.org/10.3390/computation8020039</a>","chicago":"Rengaraj, Varadarajan, Michael Lass, Christian Plessl, and Thomas Kühne. “Accurate Sampling with Noisy Forces from Approximate Computing.” <i>Computation</i> 8, no. 2 (2020). <a href=\"https://doi.org/10.3390/computation8020039\">https://doi.org/10.3390/computation8020039</a>.","short":"V. Rengaraj, M. Lass, C. Plessl, T. Kühne, Computation 8 (2020).","mla":"Rengaraj, Varadarajan, et al. “Accurate Sampling with Noisy Forces from Approximate Computing.” <i>Computation</i>, vol. 8, no. 2, 39, MDPI, 2020, doi:<a href=\"https://doi.org/10.3390/computation8020039\">10.3390/computation8020039</a>.","bibtex":"@article{Rengaraj_Lass_Plessl_Kühne_2020, title={Accurate Sampling with Noisy Forces from Approximate Computing}, volume={8}, DOI={<a href=\"https://doi.org/10.3390/computation8020039\">10.3390/computation8020039</a>}, number={239}, journal={Computation}, publisher={MDPI}, author={Rengaraj, Varadarajan and Lass, Michael and Plessl, Christian and Kühne, Thomas}, year={2020} }","ama":"Rengaraj V, Lass M, Plessl C, Kühne T. Accurate Sampling with Noisy Forces from Approximate Computing. <i>Computation</i>. 2020;8(2). doi:<a href=\"https://doi.org/10.3390/computation8020039\">10.3390/computation8020039</a>"},"quality_controlled":"1","project":[{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"},{"_id":"32","grant_number":"PL 595/2-1 / 320898746","name":"Performance and Efficiency in HPC with Custom Computing"}],"article_number":"39","main_file_link":[{"url":"https://www.mdpi.com/2079-3197/8/2/39/pdf","open_access":"1"}],"language":[{"iso":"eng"}],"doi":"10.3390/computation8020039","title":"Accurate Sampling with Noisy Forces from Approximate Computing","year":"2020","author":[{"last_name":"Rengaraj","first_name":"Varadarajan","full_name":"Rengaraj, Varadarajan"},{"last_name":"Lass","first_name":"Michael","orcid":"0000-0002-5708-7632","full_name":"Lass, Michael","id":"24135"},{"id":"16153","orcid":"0000-0001-5728-9982","first_name":"Christian","last_name":"Plessl","full_name":"Plessl, Christian"},{"last_name":"Kühne","first_name":"Thomas","full_name":"Kühne, Thomas","id":"49079"}],"date_updated":"2023-09-26T11:43:52Z","intvolume":"         8","date_created":"2019-07-23T12:03:07Z","type":"journal_article","department":[{"_id":"27"},{"_id":"518"},{"_id":"304"}],"issue":"2","publication":"Computation","abstract":[{"lang":"eng","text":"In scientific computing, the acceleration of atomistic computer simulations by means of custom hardware is finding ever-growing application. A major limitation, however, is that the high efficiency in terms of performance and low power consumption entails the massive usage of low precision computing units. Here, based on the approximate computing paradigm, we present an algorithmic method to compensate for numerical inaccuracies due to low accuracy arithmetic operations rigorously, yet still obtaining exact expectation values using a properly modified Langevin-type equation."}]},{"volume":2663,"editor":[{"last_name":"Borgwardt","first_name":"Stefan","full_name":"Borgwardt, Stefan"},{"full_name":"Meyer, Thomas","last_name":"Meyer","first_name":"Thomas"}],"user_id":"15504","language":[{"iso":"eng"}],"_id":"52936","publisher":"CEUR-WS.org","series_title":"CEUR Workshop Proceedings","intvolume":"      2663","date_updated":"2024-10-14T08:06:21Z","author":[{"first_name":"Clemens","last_name":"Dubslaff","full_name":"Dubslaff, Clemens"},{"first_name":"Patrick","last_name":"Koopmann","full_name":"Koopmann, Patrick"},{"id":"104470","full_name":"Turhan, Anni-Yasmin","last_name":"Turhan","first_name":"Anni-Yasmin"}],"title":"Give Inconsistency a Chance: Semantics for Ontology-Mediated Verification","status":"public","year":"2020","department":[{"_id":"888"}],"type":"conference","date_created":"2024-03-26T11:22:26Z","citation":{"ama":"Dubslaff C, Koopmann P, Turhan A-Y. Give Inconsistency a Chance: Semantics for Ontology-Mediated Verification. In: Borgwardt S, Meyer T, eds. <i>Proceedings of the 33rd International Workshop on Description Logics (DL 2020) Co-Located with the 17th International Conference on Principles of Knowledge Representation and Reasoning (KR 2020), Online Event [Rhodes, Greece], September 12th to 14th, 2020</i>. Vol 2663. CEUR Workshop Proceedings. CEUR-WS.org; 2020.","bibtex":"@inproceedings{Dubslaff_Koopmann_Turhan_2020, series={CEUR Workshop Proceedings}, title={Give Inconsistency a Chance: Semantics for Ontology-Mediated Verification}, volume={2663}, booktitle={Proceedings of the 33rd International Workshop on Description Logics (DL 2020) co-located with the 17th International Conference on Principles of Knowledge Representation and Reasoning (KR 2020), Online Event [Rhodes, Greece], September 12th to 14th, 2020}, publisher={CEUR-WS.org}, author={Dubslaff, Clemens and Koopmann, Patrick and Turhan, Anni-Yasmin}, editor={Borgwardt, Stefan and Meyer, Thomas}, year={2020}, collection={CEUR Workshop Proceedings} }","mla":"Dubslaff, Clemens, et al. “Give Inconsistency a Chance: Semantics for Ontology-Mediated Verification.” <i>Proceedings of the 33rd International Workshop on Description Logics (DL 2020) Co-Located with the 17th International Conference on Principles of Knowledge Representation and Reasoning (KR 2020), Online Event [Rhodes, Greece], September 12th to 14th, 2020</i>, edited by Stefan Borgwardt and Thomas Meyer, vol. 2663, CEUR-WS.org, 2020.","short":"C. Dubslaff, P. Koopmann, A.-Y. Turhan, in: S. Borgwardt, T. Meyer (Eds.), Proceedings of the 33rd International Workshop on Description Logics (DL 2020) Co-Located with the 17th International Conference on Principles of Knowledge Representation and Reasoning (KR 2020), Online Event [Rhodes, Greece], September 12th to 14th, 2020, CEUR-WS.org, 2020.","chicago":"Dubslaff, Clemens, Patrick Koopmann, and Anni-Yasmin Turhan. “Give Inconsistency a Chance: Semantics for Ontology-Mediated Verification.” In <i>Proceedings of the 33rd International Workshop on Description Logics (DL 2020) Co-Located with the 17th International Conference on Principles of Knowledge Representation and Reasoning (KR 2020), Online Event [Rhodes, Greece], September 12th to 14th, 2020</i>, edited by Stefan Borgwardt and Thomas Meyer, Vol. 2663. CEUR Workshop Proceedings. CEUR-WS.org, 2020.","apa":"Dubslaff, C., Koopmann, P., &#38; Turhan, A.-Y. (2020). Give Inconsistency a Chance: Semantics for Ontology-Mediated Verification. In S. Borgwardt &#38; T. Meyer (Eds.), <i>Proceedings of the 33rd International Workshop on Description Logics (DL 2020) co-located with the 17th International Conference on Principles of Knowledge Representation and Reasoning (KR 2020), Online Event [Rhodes, Greece], September 12th to 14th, 2020</i> (Vol. 2663). CEUR-WS.org.","ieee":"C. Dubslaff, P. Koopmann, and A.-Y. Turhan, “Give Inconsistency a Chance: Semantics for Ontology-Mediated Verification,” in <i>Proceedings of the 33rd International Workshop on Description Logics (DL 2020) co-located with the 17th International Conference on Principles of Knowledge Representation and Reasoning (KR 2020), Online Event [Rhodes, Greece], September 12th to 14th, 2020</i>, 2020, vol. 2663."},"publication":"Proceedings of the 33rd International Workshop on Description Logics (DL 2020) co-located with the 17th International Conference on Principles of Knowledge Representation and Reasoning (KR 2020), Online Event [Rhodes, Greece], September 12th to 14th, 2020"},{"date_created":"2023-01-10T11:41:21Z","file":[{"date_updated":"2024-11-12T11:03:44Z","relation":"main_file","access_level":"closed","file_size":340591,"file_name":"IASE2020_Roundtable_24_Frischem.pdf","success":1,"content_type":"application/pdf","file_id":"56999","creator":"krueter","date_created":"2024-11-12T11:03:44Z"}],"department":[{"_id":"363"},{"_id":"67"}],"type":"book_chapter","publication":"New Skills in the Changing World of Statistics Education: Proceedings of the Roundtable conference of the International Association for Statistical Education (IASE), July 2020","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://fddm.uni-paderborn.de/fileadmin/mathematik/Didaktik_der_Mathematik/BiehlerRolf/Publikationen/IASE2020_Roundtable_24_Frischem.pdf"}],"author":[{"full_name":"Budde, Lea","last_name":"Budde","first_name":"Lea"},{"last_name":"Frischemeier","first_name":"Daniel","full_name":"Frischemeier, Daniel"},{"id":"16274","last_name":"Biehler","first_name":"Rolf","full_name":"Biehler, Rolf"},{"orcid":"https://orcid.org/0000-0003-0318-0329","first_name":"Franz Yannik","last_name":"Fleischer","full_name":"Fleischer, Franz Yannik","id":"42660"},{"full_name":"Gerstenberger, Dietrich","last_name":"Gerstenberger","first_name":"Dietrich"},{"full_name":"Podworny, Susanne","last_name":"Podworny","orcid":"0000-0002-6313-5987","first_name":"Susanne","id":"30619"},{"id":"60311","full_name":"Schulte, Carsten","last_name":"Schulte","first_name":"Carsten"}],"year":"2020","title":"Data Science Education in Secondary School: How to Develop Statistical Reasoning When Exploring Data Using CODAP","date_updated":"2024-11-12T11:03:59Z","place":"Voorborg, The Netherlands","citation":{"apa":"Budde, L., Frischemeier, D., Biehler, R., Fleischer, F. Y., Gerstenberger, D., Podworny, S., &#38; Schulte, C. (2020). Data Science Education in Secondary School: How to Develop Statistical Reasoning When Exploring Data Using CODAP. In P. Arnold (Ed.), <i>New Skills in the Changing World of Statistics Education: Proceedings of the Roundtable conference of the International Association for Statistical Education (IASE), July 2020</i>. ISI/IASE.","ieee":"L. Budde <i>et al.</i>, “Data Science Education in Secondary School: How to Develop Statistical Reasoning When Exploring Data Using CODAP,” in <i>New Skills in the Changing World of Statistics Education: Proceedings of the Roundtable conference of the International Association for Statistical Education (IASE), July 2020</i>, P. Arnold, Ed. Voorborg, The Netherlands: ISI/IASE, 2020.","chicago":"Budde, Lea, Daniel Frischemeier, Rolf Biehler, Franz Yannik Fleischer, Dietrich Gerstenberger, Susanne Podworny, and Carsten Schulte. “Data Science Education in Secondary School: How to Develop Statistical Reasoning When Exploring Data Using CODAP.” In <i>New Skills in the Changing World of Statistics Education: Proceedings of the Roundtable Conference of the International Association for Statistical Education (IASE), July 2020</i>, edited by P. Arnold. Voorborg, The Netherlands: ISI/IASE, 2020.","short":"L. Budde, D. Frischemeier, R. Biehler, F.Y. Fleischer, D. Gerstenberger, S. Podworny, C. Schulte, in: P. Arnold (Ed.), New Skills in the Changing World of Statistics Education: Proceedings of the Roundtable Conference of the International Association for Statistical Education (IASE), July 2020, ISI/IASE, Voorborg, The Netherlands, 2020.","mla":"Budde, Lea, et al. “Data Science Education in Secondary School: How to Develop Statistical Reasoning When Exploring Data Using CODAP.” <i>New Skills in the Changing World of Statistics Education: Proceedings of the Roundtable Conference of the International Association for Statistical Education (IASE), July 2020</i>, edited by P. Arnold, ISI/IASE, 2020.","ama":"Budde L, Frischemeier D, Biehler R, et al. Data Science Education in Secondary School: How to Develop Statistical Reasoning When Exploring Data Using CODAP. In: Arnold P, ed. <i>New Skills in the Changing World of Statistics Education: Proceedings of the Roundtable Conference of the International Association for Statistical Education (IASE), July 2020</i>. ISI/IASE; 2020.","bibtex":"@inbook{Budde_Frischemeier_Biehler_Fleischer_Gerstenberger_Podworny_Schulte_2020, place={Voorborg, The Netherlands}, title={Data Science Education in Secondary School: How to Develop Statistical Reasoning When Exploring Data Using CODAP}, booktitle={New Skills in the Changing World of Statistics Education: Proceedings of the Roundtable conference of the International Association for Statistical Education (IASE), July 2020}, publisher={ISI/IASE}, author={Budde, Lea and Frischemeier, Daniel and Biehler, Rolf and Fleischer, Franz Yannik and Gerstenberger, Dietrich and Podworny, Susanne and Schulte, Carsten}, editor={Arnold, P.}, year={2020} }"},"file_date_updated":"2024-11-12T11:03:44Z","_id":"35821","publisher":"ISI/IASE","editor":[{"last_name":"Arnold","first_name":"P.","full_name":"Arnold, P."}],"user_id":"37888","ddc":["510"],"status":"public","has_accepted_license":"1"},{"publication":"International Conference for Software Engineering (ICSE)","citation":{"ama":"Benz M, Krogh Kristensen E, Luo L, P. Borges Jr. N, Bodden E, Zeller A. Heaps’n Leaks: How Heap Snapshots Improve Android Taint Analysis. In: <i>International Conference for Software Engineering (ICSE)</i>. ; 2020.","bibtex":"@inproceedings{Benz_Krogh Kristensen_Luo_P. Borges Jr._Bodden_Zeller_2020, title={Heaps’n Leaks: How Heap Snapshots Improve Android Taint Analysis}, booktitle={International Conference for Software Engineering (ICSE)}, author={Benz, Manuel and Krogh Kristensen, Erik and Luo, Linghui and P. Borges Jr., Nataniel and Bodden, Eric and Zeller, Andreas}, year={2020} }","mla":"Benz, Manuel, et al. “Heaps’n Leaks: How Heap Snapshots Improve Android Taint Analysis.” <i>International Conference for Software Engineering (ICSE)</i>, 2020.","short":"M. Benz, E. Krogh Kristensen, L. Luo, N. P. Borges Jr., E. Bodden, A. Zeller, in: International Conference for Software Engineering (ICSE), 2020.","chicago":"Benz, Manuel, Erik Krogh Kristensen, Linghui Luo, Nataniel P. Borges Jr., Eric Bodden, and Andreas Zeller. “Heaps’n Leaks: How Heap Snapshots Improve Android Taint Analysis.” In <i>International Conference for Software Engineering (ICSE)</i>, 2020.","apa":"Benz, M., Krogh Kristensen, E., Luo, L., P. Borges Jr., N., Bodden, E., &#38; Zeller, A. (2020). Heaps’n Leaks: How Heap Snapshots Improve Android Taint Analysis. <i>International Conference for Software Engineering (ICSE)</i>.","ieee":"M. Benz, E. Krogh Kristensen, L. Luo, N. P. Borges Jr., E. Bodden, and A. Zeller, “Heaps’n Leaks: How Heap Snapshots Improve Android Taint Analysis,” 2020."},"date_created":"2020-11-26T08:47:56Z","type":"conference","department":[{"_id":"76"}],"status":"public","year":"2020","title":"Heaps'n Leaks: How Heap Snapshots Improve Android Taint Analysis","author":[{"first_name":"Manuel","last_name":"Benz","full_name":"Benz, Manuel"},{"first_name":"Erik","last_name":"Krogh Kristensen","full_name":"Krogh Kristensen, Erik"},{"full_name":"Luo, Linghui","first_name":"Linghui","last_name":"Luo"},{"first_name":"Nataniel","last_name":"P. Borges Jr.","full_name":"P. Borges Jr., Nataniel"},{"id":"59256","orcid":"0000-0003-3470-3647","first_name":"Eric","last_name":"Bodden","full_name":"Bodden, Eric"},{"full_name":"Zeller, Andreas","last_name":"Zeller","first_name":"Andreas"}],"date_updated":"2025-04-07T10:24:14Z","language":[{"iso":"eng"}],"_id":"20510","user_id":"15249"},{"department":[{"_id":"76"}],"type":"journal_article","date_created":"2020-11-26T08:38:33Z","citation":{"chicago":"Nguyen Quang Do, Lisa, and Eric Bodden. “Explaining Static Analysis with Rule Graphs.” <i>IEEE Transactions on Software Engineering</i>, 2020.","short":"L. Nguyen Quang Do, E. Bodden, IEEE Transactions on Software Engineering (2020).","ieee":"L. Nguyen Quang Do and E. Bodden, “Explaining Static Analysis with Rule Graphs,” <i>IEEE Transactions on Software Engineering</i>, 2020.","apa":"Nguyen Quang Do, L., &#38; Bodden, E. (2020). Explaining Static Analysis with Rule Graphs. <i>IEEE Transactions on Software Engineering</i>.","bibtex":"@article{Nguyen Quang Do_Bodden_2020, title={Explaining Static Analysis with Rule Graphs}, journal={IEEE Transactions on Software Engineering}, author={Nguyen Quang Do, Lisa and Bodden, Eric}, year={2020} }","ama":"Nguyen Quang Do L, Bodden E. Explaining Static Analysis with Rule Graphs. <i>IEEE Transactions on Software Engineering</i>. Published online 2020.","mla":"Nguyen Quang Do, Lisa, and Eric Bodden. “Explaining Static Analysis with Rule Graphs.” <i>IEEE Transactions on Software Engineering</i>, 2020."},"publication":"IEEE Transactions on Software Engineering","user_id":"15249","language":[{"iso":"eng"}],"_id":"20508","main_file_link":[{"url":"http://www.bodden.de/pubs/tse20ruleGraphs.pdf"}],"date_updated":"2025-04-07T10:22:44Z","author":[{"last_name":"Nguyen Quang Do","first_name":"Lisa","full_name":"Nguyen Quang Do, Lisa"},{"id":"59256","last_name":"Bodden","orcid":"0000-0003-3470-3647","first_name":"Eric","full_name":"Bodden, Eric"}],"status":"public","year":"2020","title":"Explaining Static Analysis with Rule Graphs"},{"citation":{"chicago":"Schmidt, Patrick, Marcel Campen, Janis Born, and Leif Kobbelt. “Inter-Surface Maps via Constant-Curvature Metrics.” <i>ACM Transactions on Graphics</i> 39, no. 4 (2020). <a href=\"https://doi.org/10.1145/3386569.3392399\">https://doi.org/10.1145/3386569.3392399</a>.","short":"P. Schmidt, M. Campen, J. Born, L. Kobbelt, ACM Transactions on Graphics 39 (2020).","ama":"Schmidt P, Campen M, Born J, Kobbelt L. Inter-surface maps via constant-curvature metrics. <i>ACM Transactions on Graphics</i>. 2020;39(4). doi:<a href=\"https://doi.org/10.1145/3386569.3392399\">10.1145/3386569.3392399</a>","bibtex":"@article{Schmidt_Campen_Born_Kobbelt_2020, title={Inter-surface maps via constant-curvature metrics}, volume={39}, DOI={<a href=\"https://doi.org/10.1145/3386569.3392399\">10.1145/3386569.3392399</a>}, number={4}, journal={ACM Transactions on Graphics}, publisher={Association for Computing Machinery (ACM)}, author={Schmidt, Patrick and Campen, Marcel and Born, Janis and Kobbelt, Leif}, year={2020} }","apa":"Schmidt, P., Campen, M., Born, J., &#38; Kobbelt, L. (2020). Inter-surface maps via constant-curvature metrics. <i>ACM Transactions on Graphics</i>, <i>39</i>(4). <a href=\"https://doi.org/10.1145/3386569.3392399\">https://doi.org/10.1145/3386569.3392399</a>","mla":"Schmidt, Patrick, et al. “Inter-Surface Maps via Constant-Curvature Metrics.” <i>ACM Transactions on Graphics</i>, vol. 39, no. 4, Association for Computing Machinery (ACM), 2020, doi:<a href=\"https://doi.org/10.1145/3386569.3392399\">10.1145/3386569.3392399</a>.","ieee":"P. Schmidt, M. Campen, J. Born, and L. Kobbelt, “Inter-surface maps via constant-curvature metrics,” <i>ACM Transactions on Graphics</i>, vol. 39, no. 4, 2020, doi: <a href=\"https://doi.org/10.1145/3386569.3392399\">10.1145/3386569.3392399</a>."},"status":"public","volume":39,"user_id":"117512","_id":"60386","publisher":"Association for Computing Machinery (ACM)","abstract":[{"lang":"eng","text":"<jats:p>We propose a novel approach to represent maps between two discrete surfaces of the same genus and to minimize intrinsic mapping distortion. Our maps are well-defined at every surface point and are guaranteed to be continuous bijections (surface homeomorphisms). As a key feature of our approach, only the images of vertices need to be represented explicitly, since the images of all other points (on edges or in faces) are properly defined implicitly. This definition is via unique geodesics in metrics of constant Gaussian curvature. Our method is built upon the fact that such metrics exist on surfaces of arbitrary topology, without the need for any cuts or cones (as asserted by the uniformization theorem). Depending on the surfaces' genus, these metrics exhibit one of the three classical geometries: Euclidean, spherical or hyperbolic. Our formulation handles constructions in all three geometries in a unified way. In addition, by considering not only the vertex images but also the discrete metric as degrees of freedom, our formulation enables us to simultaneously optimize the images of these vertices and images of all other points.</jats:p>"}],"extern":"1","issue":"4","publication":"ACM Transactions on Graphics","department":[{"_id":"969"}],"type":"journal_article","date_created":"2025-06-26T07:18:18Z","intvolume":"        39","date_updated":"2025-07-14T12:48:27Z","publication_status":"published","publication_identifier":{"issn":["0730-0301","1557-7368"]},"author":[{"last_name":"Schmidt","first_name":"Patrick","full_name":"Schmidt, Patrick"},{"id":"114904","first_name":"Marcel","last_name":"Campen","orcid":"0000-0003-2340-3462","full_name":"Campen, Marcel"},{"last_name":"Born","first_name":"Janis","full_name":"Born, Janis"},{"first_name":"Leif","last_name":"Kobbelt","full_name":"Kobbelt, Leif"}],"title":"Inter-surface maps via constant-curvature metrics","year":"2020","doi":"10.1145/3386569.3392399","language":[{"iso":"eng"}]},{"citation":{"mla":"Mandad, Manish, and Marcel Campen. “Bézier Guarding.” <i>ACM Transactions on Graphics</i>, vol. 39, no. 4, Association for Computing Machinery (ACM), 2020, doi:<a href=\"https://doi.org/10.1145/3386569.3392372\">10.1145/3386569.3392372</a>.","apa":"Mandad, M., &#38; Campen, M. (2020). Bézier guarding. <i>ACM Transactions on Graphics</i>, <i>39</i>(4). <a href=\"https://doi.org/10.1145/3386569.3392372\">https://doi.org/10.1145/3386569.3392372</a>","ieee":"M. Mandad and M. Campen, “Bézier guarding,” <i>ACM Transactions on Graphics</i>, vol. 39, no. 4, 2020, doi: <a href=\"https://doi.org/10.1145/3386569.3392372\">10.1145/3386569.3392372</a>.","chicago":"Mandad, Manish, and Marcel Campen. “Bézier Guarding.” <i>ACM Transactions on Graphics</i> 39, no. 4 (2020). <a href=\"https://doi.org/10.1145/3386569.3392372\">https://doi.org/10.1145/3386569.3392372</a>.","ama":"Mandad M, Campen M. Bézier guarding. <i>ACM Transactions on Graphics</i>. 2020;39(4). doi:<a href=\"https://doi.org/10.1145/3386569.3392372\">10.1145/3386569.3392372</a>","short":"M. Mandad, M. Campen, ACM Transactions on Graphics 39 (2020).","bibtex":"@article{Mandad_Campen_2020, title={Bézier guarding}, volume={39}, DOI={<a href=\"https://doi.org/10.1145/3386569.3392372\">10.1145/3386569.3392372</a>}, number={4}, journal={ACM Transactions on Graphics}, publisher={Association for Computing Machinery (ACM)}, author={Mandad, Manish and Campen, Marcel}, year={2020} }"},"status":"public","publisher":"Association for Computing Machinery (ACM)","_id":"60385","user_id":"117512","volume":39,"publication":"ACM Transactions on Graphics","issue":"4","extern":"1","abstract":[{"lang":"eng","text":"<jats:p>We present a mesh generation algorithm for the curvilinear triangulation of planar domains with piecewise polynomial boundary. The resulting mesh consists of regular, injective higher-order triangular elements and precisely conforms with the domain's curved boundary. No smoothness requirements are imposed on the boundary. Prescribed piecewise polynomial curves in the interior, like material interfaces or feature curves, can be taken into account for precise interpolation by the resulting mesh's edges as well. In its core, the algorithm is based on a novel explicit construction of guaranteed injective Bézier triangles with certain edge curves and edge parametrizations prescribed. Due to the use of only rational arithmetic, the algorithm can optionally be performed using exact number types in practice, so as to provide robustness guarantees.</jats:p>"}],"date_created":"2025-06-26T07:16:40Z","type":"journal_article","department":[{"_id":"969"}],"title":"Bézier guarding","year":"2020","publication_identifier":{"issn":["0730-0301","1557-7368"]},"author":[{"first_name":"Manish","last_name":"Mandad","full_name":"Mandad, Manish"},{"id":"114904","orcid":"0000-0003-2340-3462","last_name":"Campen","first_name":"Marcel","full_name":"Campen, Marcel"}],"publication_status":"published","date_updated":"2025-07-14T12:48:24Z","intvolume":"        39","language":[{"iso":"eng"}],"doi":"10.1145/3386569.3392372","alternative_title":["precise higher-order meshing of curved 2D domains"]},{"intvolume":"        39","date_updated":"2025-07-14T12:48:19Z","publication_status":"published","author":[{"full_name":"Zhou, Jiaran","first_name":"Jiaran","last_name":"Zhou"},{"first_name":"Changhe","last_name":"Tu","full_name":"Tu, Changhe"},{"first_name":"Denis","last_name":"Zorin","full_name":"Zorin, Denis"},{"id":"114904","orcid":"0000-0003-2340-3462","first_name":"Marcel","last_name":"Campen","full_name":"Campen, Marcel"}],"publication_identifier":{"issn":["0167-7055","1467-8659"]},"title":"Combinatorial Construction of Seamless Parameter Domains","year":"2020","doi":"10.1111/cgf.13922","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"<jats:title>Abstract</jats:title><jats:p>The problem of seamless parametrization of surfaces is of interest in the context of structured quadrilateral mesh generation and spline‐based surface approximation. It has been tackled by a variety of approaches, commonly relying on continuous numerical optimization to ultimately obtain suitable parameter domains. We present a general combinatorial seamless parameter domain construction, free from the potential numerical issues inherent to continuous optimization techniques in practice. The domains are constructed as abstract polygonal complexes which can be embedded in a discrete planar grid space, as unions of unit squares. We ensure that the domain structure matches any prescribed parametrization singularities (cones) and satisfies seamlessness conditions. Surfaces of arbitrary genus are supported. Once a domain suitable for a given surface is constructed, a seamless and locally injective parametrization over this domain can be obtained using existing planar disk mapping techniques, making recourse to Tutte's classical embedding theorem.</jats:p>"}],"extern":"1","issue":"2","publication":"Computer Graphics Forum","department":[{"_id":"969"}],"type":"journal_article","date_created":"2025-06-26T06:52:07Z","status":"public","volume":39,"user_id":"117512","publisher":"Wiley","_id":"60383","page":"179-190","citation":{"ama":"Zhou J, Tu C, Zorin D, Campen M. Combinatorial Construction of Seamless Parameter Domains. <i>Computer Graphics Forum</i>. 2020;39(2):179-190. doi:<a href=\"https://doi.org/10.1111/cgf.13922\">10.1111/cgf.13922</a>","bibtex":"@article{Zhou_Tu_Zorin_Campen_2020, title={Combinatorial Construction of Seamless Parameter Domains}, volume={39}, DOI={<a href=\"https://doi.org/10.1111/cgf.13922\">10.1111/cgf.13922</a>}, number={2}, journal={Computer Graphics Forum}, publisher={Wiley}, author={Zhou, Jiaran and Tu, Changhe and Zorin, Denis and Campen, Marcel}, year={2020}, pages={179–190} }","mla":"Zhou, Jiaran, et al. “Combinatorial Construction of Seamless Parameter Domains.” <i>Computer Graphics Forum</i>, vol. 39, no. 2, Wiley, 2020, pp. 179–90, doi:<a href=\"https://doi.org/10.1111/cgf.13922\">10.1111/cgf.13922</a>.","short":"J. Zhou, C. Tu, D. Zorin, M. Campen, Computer Graphics Forum 39 (2020) 179–190.","chicago":"Zhou, Jiaran, Changhe Tu, Denis Zorin, and Marcel Campen. “Combinatorial Construction of Seamless Parameter Domains.” <i>Computer Graphics Forum</i> 39, no. 2 (2020): 179–90. <a href=\"https://doi.org/10.1111/cgf.13922\">https://doi.org/10.1111/cgf.13922</a>.","apa":"Zhou, J., Tu, C., Zorin, D., &#38; Campen, M. (2020). Combinatorial Construction of Seamless Parameter Domains. <i>Computer Graphics Forum</i>, <i>39</i>(2), 179–190. <a href=\"https://doi.org/10.1111/cgf.13922\">https://doi.org/10.1111/cgf.13922</a>","ieee":"J. Zhou, C. Tu, D. Zorin, and M. Campen, “Combinatorial Construction of Seamless Parameter Domains,” <i>Computer Graphics Forum</i>, vol. 39, no. 2, pp. 179–190, 2020, doi: <a href=\"https://doi.org/10.1111/cgf.13922\">10.1111/cgf.13922</a>."}},{"publication_status":"published","date_updated":"2025-07-14T12:48:16Z","intvolume":"       127","year":"2020","title":"Efficient piecewise higher-order parametrization of discrete surfaces with local and global injectivity","author":[{"last_name":"Mandad","first_name":"Manish","full_name":"Mandad, Manish"},{"id":"114904","full_name":"Campen, Marcel","orcid":"0000-0003-2340-3462","first_name":"Marcel","last_name":"Campen"}],"publication_identifier":{"issn":["0010-4485"]},"doi":"10.1016/j.cad.2020.102862","article_number":"102862","language":[{"iso":"eng"}],"extern":"1","publication":"Computer-Aided Design","type":"journal_article","department":[{"_id":"969"}],"date_created":"2025-06-26T06:50:22Z","status":"public","user_id":"117512","volume":127,"_id":"60382","publisher":"Elsevier BV","citation":{"chicago":"Mandad, Manish, and Marcel Campen. “Efficient Piecewise Higher-Order Parametrization of Discrete Surfaces with Local and Global Injectivity.” <i>Computer-Aided Design</i> 127 (2020). <a href=\"https://doi.org/10.1016/j.cad.2020.102862\">https://doi.org/10.1016/j.cad.2020.102862</a>.","short":"M. Mandad, M. Campen, Computer-Aided Design 127 (2020).","ieee":"M. Mandad and M. Campen, “Efficient piecewise higher-order parametrization of discrete surfaces with local and global injectivity,” <i>Computer-Aided Design</i>, vol. 127, Art. no. 102862, 2020, doi: <a href=\"https://doi.org/10.1016/j.cad.2020.102862\">10.1016/j.cad.2020.102862</a>.","apa":"Mandad, M., &#38; Campen, M. (2020). Efficient piecewise higher-order parametrization of discrete surfaces with local and global injectivity. <i>Computer-Aided Design</i>, <i>127</i>, Article 102862. <a href=\"https://doi.org/10.1016/j.cad.2020.102862\">https://doi.org/10.1016/j.cad.2020.102862</a>","bibtex":"@article{Mandad_Campen_2020, title={Efficient piecewise higher-order parametrization of discrete surfaces with local and global injectivity}, volume={127}, DOI={<a href=\"https://doi.org/10.1016/j.cad.2020.102862\">10.1016/j.cad.2020.102862</a>}, number={102862}, journal={Computer-Aided Design}, publisher={Elsevier BV}, author={Mandad, Manish and Campen, Marcel}, year={2020} }","ama":"Mandad M, Campen M. Efficient piecewise higher-order parametrization of discrete surfaces with local and global injectivity. <i>Computer-Aided Design</i>. 2020;127. doi:<a href=\"https://doi.org/10.1016/j.cad.2020.102862\">10.1016/j.cad.2020.102862</a>","mla":"Mandad, Manish, and Marcel Campen. “Efficient Piecewise Higher-Order Parametrization of Discrete Surfaces with Local and Global Injectivity.” <i>Computer-Aided Design</i>, vol. 127, 102862, Elsevier BV, 2020, doi:<a href=\"https://doi.org/10.1016/j.cad.2020.102862\">10.1016/j.cad.2020.102862</a>."}},{"publisher":"(IEEE)","_id":"21267","language":[{"iso":"eng"}],"user_id":"90826","author":[{"last_name":"Budde","first_name":"Lea","full_name":"Budde, Lea","id":"32443"},{"id":"60311","first_name":"Carsten","last_name":"Schulte","full_name":"Schulte, Carsten"},{"id":"27152","first_name":"Heike M.","last_name":"Buhl","full_name":"Buhl, Heike M."},{"full_name":"Muehling, Andreas","first_name":"Andreas","last_name":"Muehling"}],"status":"public","year":"2020","title":"Understanding and Explaining Digital Artefacts - the Role of a Duality (Accepted Paper - Digital Publication Follows)","date_updated":"2025-08-12T07:15:23Z","date_created":"2021-02-24T09:18:36Z","department":[{"_id":"67"},{"_id":"427"}],"type":"journal_article","keyword":["⛔ No DOI found"],"citation":{"mla":"Budde, Lea, et al. “Understanding and Explaining Digital Artefacts - the Role of a Duality (Accepted Paper - Digital Publication Follows).” <i>Seventh International Conference on Learning and Teaching in Computing and Engineeringe</i>, (IEEE), 2020.","bibtex":"@article{Budde_Schulte_Buhl_Muehling_2020, title={Understanding and Explaining Digital Artefacts - the Role of a Duality (Accepted Paper - Digital Publication Follows)}, journal={Seventh International Conference on Learning and Teaching in Computing and Engineeringe}, publisher={(IEEE)}, author={Budde, Lea and Schulte, Carsten and Buhl, Heike M. and Muehling, Andreas}, year={2020} }","ama":"Budde L, Schulte C, Buhl HM, Muehling A. Understanding and Explaining Digital Artefacts - the Role of a Duality (Accepted Paper - Digital Publication Follows). <i>Seventh International Conference on Learning and Teaching in Computing and Engineeringe</i>. Published online 2020.","ieee":"L. Budde, C. Schulte, H. M. Buhl, and A. Muehling, “Understanding and Explaining Digital Artefacts - the Role of a Duality (Accepted Paper - Digital Publication Follows),” <i>Seventh International Conference on Learning and Teaching in Computing and Engineeringe</i>, 2020.","apa":"Budde, L., Schulte, C., Buhl, H. M., &#38; Muehling, A. (2020). Understanding and Explaining Digital Artefacts - the Role of a Duality (Accepted Paper - Digital Publication Follows). <i>Seventh International Conference on Learning and Teaching in Computing and Engineeringe</i>.","short":"L. Budde, C. Schulte, H.M. Buhl, A. Muehling, Seventh International Conference on Learning and Teaching in Computing and Engineeringe (2020).","chicago":"Budde, Lea, Carsten Schulte, Heike M. Buhl, and Andreas Muehling. “Understanding and Explaining Digital Artefacts - the Role of a Duality (Accepted Paper - Digital Publication Follows).” <i>Seventh International Conference on Learning and Teaching in Computing and Engineeringe</i>, 2020."},"publication":"Seventh International Conference on Learning and Teaching in Computing and Engineeringe","project":[{"_id":"114","grant_number":"438445824","name":"TRR 318 - A04: TRR 318 - Integration des technischen Modells in das Partnermodell bei der Erklärung von digitalen Artefakten (Teilprojekt A04)"}]},{"publisher":"Springer","_id":"15266","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://doi.org/10.1007/s10270-020-00777-7"}],"user_id":"8447","author":[{"first_name":"Enes","last_name":"Yigitbas","orcid":"0000-0002-5967-833X","full_name":"Yigitbas, Enes","id":"8447"},{"full_name":"Jovanovikj, Ivan","orcid":"https://orcid.org/0000-0002-1838-794X","first_name":"Ivan","last_name":"Jovanovikj","id":"39187"},{"id":"55908","full_name":"Biermeier, Kai","first_name":"Kai","orcid":"0000-0002-2879-2359","last_name":"Biermeier"},{"id":"447","full_name":"Sauer, Stefan","orcid":"0000-0003-3084-0409","first_name":"Stefan","last_name":"Sauer"},{"id":"107","full_name":"Engels, Gregor","first_name":"Gregor","last_name":"Engels"}],"status":"public","title":"Integrated Model-driven Development of Self-adaptive User Interfaces ","year":"2020","date_updated":"2025-09-10T11:41:54Z","date_created":"2019-12-10T11:31:55Z","department":[{"_id":"66"},{"_id":"534"}],"type":"journal_article","citation":{"ieee":"E. Yigitbas, I. Jovanovikj, K. Biermeier, S. Sauer, and G. Engels, “Integrated Model-driven Development of Self-adaptive User Interfaces ,” <i>International Journal on Software and Systems Modeling (SoSyM)</i>, 2020.","apa":"Yigitbas, E., Jovanovikj, I., Biermeier, K., Sauer, S., &#38; Engels, G. (2020). Integrated Model-driven Development of Self-adaptive User Interfaces . <i>International Journal on Software and Systems Modeling (SoSyM)</i>.","short":"E. Yigitbas, I. Jovanovikj, K. Biermeier, S. Sauer, G. Engels, International Journal on Software and Systems Modeling (SoSyM) (2020).","chicago":"Yigitbas, Enes, Ivan Jovanovikj, Kai Biermeier, Stefan Sauer, and Gregor Engels. “Integrated Model-Driven Development of Self-Adaptive User Interfaces .” <i>International Journal on Software and Systems Modeling (SoSyM)</i>, 2020.","mla":"Yigitbas, Enes, et al. “Integrated Model-Driven Development of Self-Adaptive User Interfaces .” <i>International Journal on Software and Systems Modeling (SoSyM)</i>, Springer, 2020.","bibtex":"@article{Yigitbas_Jovanovikj_Biermeier_Sauer_Engels_2020, title={Integrated Model-driven Development of Self-adaptive User Interfaces }, journal={International Journal on Software and Systems Modeling (SoSyM)}, publisher={Springer}, author={Yigitbas, Enes and Jovanovikj, Ivan and Biermeier, Kai and Sauer, Stefan and Engels, Gregor}, year={2020} }","ama":"Yigitbas E, Jovanovikj I, Biermeier K, Sauer S, Engels G. Integrated Model-driven Development of Self-adaptive User Interfaces . <i>International Journal on Software and Systems Modeling (SoSyM)</i>. Published online 2020."},"publication":"International Journal on Software and Systems Modeling (SoSyM)"},{"date_created":"2020-09-17T10:53:38Z","department":[{"_id":"7"},{"_id":"355"}],"type":"preprint","citation":{"ieee":"K. Pfannschmidt, P. Gupta, and E. Hüllermeier, “Learning Choice Functions: Concepts and Architectures,” <i>arXiv:1901.10860</i>. 2019.","apa":"Pfannschmidt, K., Gupta, P., &#38; Hüllermeier, E. (2019). Learning Choice Functions: Concepts and Architectures. <i>ArXiv:1901.10860</i>.","chicago":"Pfannschmidt, Karlson, Pritha Gupta, and Eyke Hüllermeier. “Learning Choice Functions: Concepts and Architectures.” <i>ArXiv:1901.10860</i>, 2019.","short":"K. Pfannschmidt, P. Gupta, E. Hüllermeier, ArXiv:1901.10860 (2019).","mla":"Pfannschmidt, Karlson, et al. “Learning Choice Functions: Concepts and Architectures.” <i>ArXiv:1901.10860</i>, 2019.","bibtex":"@article{Pfannschmidt_Gupta_Hüllermeier_2019, title={Learning Choice Functions: Concepts and Architectures}, journal={arXiv:1901.10860}, author={Pfannschmidt, Karlson and Gupta, Pritha and Hüllermeier, Eyke}, year={2019} }","ama":"Pfannschmidt K, Gupta P, Hüllermeier E. Learning Choice Functions: Concepts and Architectures. <i>arXiv:190110860</i>. 2019."},"publication":"arXiv:1901.10860","project":[{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"abstract":[{"text":"We study the problem of learning choice functions, which play an important\r\nrole in various domains of application, most notably in the field of economics.\r\nFormally, a choice function is a mapping from sets to sets: Given a set of\r\nchoice alternatives as input, a choice function identifies a subset of most\r\npreferred elements. Learning choice functions from suitable training data comes\r\nwith a number of challenges. For example, the sets provided as input and the\r\nsubsets produced as output can be of any size. Moreover, since the order in\r\nwhich alternatives are presented is irrelevant, a choice function should be\r\nsymmetric. Perhaps most importantly, choice functions are naturally\r\ncontext-dependent, in the sense that the preference in favor of an alternative\r\nmay depend on what other options are available. We formalize the problem of\r\nlearning choice functions and present two general approaches based on two\r\nrepresentations of context-dependent utility functions. Both approaches are\r\ninstantiated by means of appropriate neural network architectures, and their\r\nperformance is demonstrated on suitable benchmark tasks.","lang":"eng"}],"language":[{"iso":"eng"}],"_id":"19523","user_id":"13472","author":[{"last_name":"Pfannschmidt","first_name":"Karlson","full_name":"Pfannschmidt, Karlson"},{"first_name":"Pritha","last_name":"Gupta","full_name":"Gupta, Pritha"},{"full_name":"Hüllermeier, Eyke","last_name":"Hüllermeier","first_name":"Eyke"}],"status":"public","title":"Learning Choice Functions: Concepts and Architectures","year":"2019","date_updated":"2022-01-06T06:54:06Z"},{"page":"116--124","publisher":"IFIP","_id":"3287","ddc":["040"],"user_id":"35343","status":"public","conference":{"location":"Washington, DC, USA","start_date":"2019-04-08","name":"2019 IFIP/IEEE International Symposium on Integrated Network Management (IM)","end_date":"2019-04-12"},"has_accepted_license":"1","place":"Washington, DC, USA","oa":"1","file_date_updated":"2019-01-07T12:38:35Z","citation":{"short":"S.B. Schneider, A. Sharma, H. Karl, H. Wehrheim, in: 2019 IFIP/IEEE International Symposium on Integrated Network Management (IM), IFIP, Washington, DC, USA, 2019, pp. 116--124.","chicago":"Schneider, Stefan Balthasar, Arnab Sharma, Holger Karl, and Heike Wehrheim. “Specifying and Analyzing Virtual Network Services Using Queuing Petri Nets.” In <i>2019 IFIP/IEEE International Symposium on Integrated Network Management (IM)</i>, 116--124. Washington, DC, USA: IFIP, 2019.","apa":"Schneider, S. B., Sharma, A., Karl, H., &#38; Wehrheim, H. (2019). Specifying and Analyzing Virtual Network Services Using Queuing Petri Nets. In <i>2019 IFIP/IEEE International Symposium on Integrated Network Management (IM)</i> (pp. 116--124). Washington, DC, USA: IFIP.","ieee":"S. B. Schneider, A. Sharma, H. Karl, and H. Wehrheim, “Specifying and Analyzing Virtual Network Services Using Queuing Petri Nets,” in <i>2019 IFIP/IEEE International Symposium on Integrated Network Management (IM)</i>, Washington, DC, USA, 2019, pp. 116--124.","ama":"Schneider SB, Sharma A, Karl H, Wehrheim H. Specifying and Analyzing Virtual Network Services Using Queuing Petri Nets. In: <i>2019 IFIP/IEEE International Symposium on Integrated Network Management (IM)</i>. Washington, DC, USA: IFIP; 2019:116--124.","bibtex":"@inproceedings{Schneider_Sharma_Karl_Wehrheim_2019, place={Washington, DC, USA}, title={Specifying and Analyzing Virtual Network Services Using Queuing Petri Nets}, booktitle={2019 IFIP/IEEE International Symposium on Integrated Network Management (IM)}, publisher={IFIP}, author={Schneider, Stefan Balthasar and Sharma, Arnab and Karl, Holger and Wehrheim, Heike}, year={2019}, pages={116--124} }","mla":"Schneider, Stefan Balthasar, et al. “Specifying and Analyzing Virtual Network Services Using Queuing Petri Nets.” <i>2019 IFIP/IEEE International Symposium on Integrated Network Management (IM)</i>, IFIP, 2019, pp. 116--124."},"project":[{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B3","_id":"11"},{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"16","name":"SFB 901 - Subproject C4"},{"grant_number":"761493","_id":"28","name":"5G Development and validation platform for global industry-specific network services and Apps"},{"grant_number":"671517","_id":"25","name":"SONATA NFV: Agile Service Development and Orchestration in 5G Virtualized Networks","call_identifier":"5G PPP Phase 1"}],"main_file_link":[{"open_access":"1","url":"http://dl.ifip.org/db/conf/im/im2019/188490.pdf"}],"language":[{"iso":"eng"}],"year":"2019","title":"Specifying and Analyzing Virtual Network Services Using Queuing Petri Nets","author":[{"full_name":"Schneider, Stefan Balthasar","first_name":"Stefan Balthasar","orcid":"0000-0001-8210-4011","last_name":"Schneider","id":"35343"},{"last_name":"Sharma","first_name":"Arnab","full_name":"Sharma, Arnab","id":"67200"},{"id":"126","last_name":"Karl","first_name":"Holger","full_name":"Karl, Holger"},{"id":"573","full_name":"Wehrheim, Heike","first_name":"Heike","last_name":"Wehrheim"}],"date_updated":"2022-01-06T06:59:09Z","file":[{"creator":"stschn","date_created":"2019-01-07T12:38:35Z","file_name":"ris_preprint.pdf","file_size":497528,"access_level":"open_access","relation":"main_file","date_updated":"2019-01-07T12:38:35Z","file_id":"6504","content_type":"application/pdf"}],"date_created":"2018-06-18T15:23:18Z","type":"conference","department":[{"_id":"77"},{"_id":"75"}],"publication":"2019 IFIP/IEEE International Symposium on Integrated Network Management (IM)","abstract":[{"lang":"eng","text":"For optimal placement and orchestration of network services, it is crucial\r\nthat their structure and semantics are specified clearly and comprehensively\r\nand are available to an orchestrator. Existing specification approaches are\r\neither ambiguous or miss important aspects regarding the behavior of virtual\r\nnetwork functions (VNFs) forming a service. We propose to formally and\r\nunambiguously specify the behavior of these functions and services using\r\nQueuing Petri Nets (QPNs). QPNs are an established method that allows to\r\nexpress queuing, synchronization, stochastically distributed processing delays,\r\nand changing traffic volume and characteristics at each VNF. With QPNs,\r\nmultiple VNFs can be connected to complete network services in any structure,\r\neven specifying bidirectional network services containing loops.\r\n  We discuss how management and orchestration systems can benefit from our\r\nclear and comprehensive specification approach, leading to better placement of\r\nVNFs and improved Quality of Service. Another benefit of formally specifying\r\nnetwork services with QPNs are diverse analysis options, which allow valuable\r\ninsights such as the distribution of end-to-end delay. We propose a tool-based\r\nworkflow that supports the specification of network services and the automatic\r\ngeneration of corresponding simulation code to enable an in-depth analysis of\r\ntheir behavior and performance."}]},{"publisher":"Elsevier","_id":"3585","page":"277-290","volume":99,"user_id":"49051","status":"public","citation":{"bibtex":"@article{Witschen_Wiersema_Ghasemzadeh Mohammadi_Awais_Platzner_2019, title={CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation}, volume={99}, DOI={<a href=\"https://doi.org/10.1016/j.microrel.2019.04.003\">10.1016/j.microrel.2019.04.003</a>}, journal={Microelectronics Reliability}, publisher={Elsevier}, author={Witschen, Linus Matthias and Wiersema, Tobias and Ghasemzadeh Mohammadi, Hassan and Awais, Muhammad and Platzner, Marco}, year={2019}, pages={277–290} }","chicago":"Witschen, Linus Matthias, Tobias Wiersema, Hassan Ghasemzadeh Mohammadi, Muhammad Awais, and Marco Platzner. “CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation.” <i>Microelectronics Reliability</i> 99 (2019): 277–90. <a href=\"https://doi.org/10.1016/j.microrel.2019.04.003\">https://doi.org/10.1016/j.microrel.2019.04.003</a>.","short":"L.M. Witschen, T. Wiersema, H. Ghasemzadeh Mohammadi, M. Awais, M. Platzner, Microelectronics Reliability 99 (2019) 277–290.","ama":"Witschen LM, Wiersema T, Ghasemzadeh Mohammadi H, Awais M, Platzner M. CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation. <i>Microelectronics Reliability</i>. 2019;99:277-290. doi:<a href=\"https://doi.org/10.1016/j.microrel.2019.04.003\">10.1016/j.microrel.2019.04.003</a>","ieee":"L. M. Witschen, T. Wiersema, H. Ghasemzadeh Mohammadi, M. Awais, and M. Platzner, “CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation,” <i>Microelectronics Reliability</i>, vol. 99, pp. 277–290, 2019.","mla":"Witschen, Linus Matthias, et al. “CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation.” <i>Microelectronics Reliability</i>, vol. 99, Elsevier, 2019, pp. 277–90, doi:<a href=\"https://doi.org/10.1016/j.microrel.2019.04.003\">10.1016/j.microrel.2019.04.003</a>.","apa":"Witschen, L. M., Wiersema, T., Ghasemzadeh Mohammadi, H., Awais, M., &#38; Platzner, M. (2019). CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation. <i>Microelectronics Reliability</i>, <i>99</i>, 277–290. <a href=\"https://doi.org/10.1016/j.microrel.2019.04.003\">https://doi.org/10.1016/j.microrel.2019.04.003</a>"},"project":[{"name":"SFB 901 - Subproject B4","_id":"12"},{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"language":[{"iso":"eng"}],"doi":"10.1016/j.microrel.2019.04.003","publication_identifier":{"issn":["0026-2714"]},"author":[{"last_name":"Witschen","first_name":"Linus Matthias","full_name":"Witschen, Linus Matthias","id":"49051"},{"id":"3118","full_name":"Wiersema, Tobias","first_name":"Tobias","last_name":"Wiersema"},{"id":"61186","first_name":"Hassan","last_name":"Ghasemzadeh Mohammadi","full_name":"Ghasemzadeh Mohammadi, Hassan"},{"id":"64665","first_name":"Muhammad","orcid":"https://orcid.org/0000-0003-4148-2969","last_name":"Awais","full_name":"Awais, Muhammad"},{"id":"398","full_name":"Platzner, Marco","first_name":"Marco","last_name":"Platzner"}],"title":"CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation","year":"2019","intvolume":"        99","date_updated":"2022-01-06T06:59:25Z","publication_status":"published","date_created":"2018-07-20T14:08:49Z","department":[{"_id":"78"}],"type":"journal_article","keyword":["Approximate Computing","Framework","Pareto Front","Accuracy"],"publication":"Microelectronics Reliability","abstract":[{"lang":"eng","text":"Existing approaches and tools for the generation of approximate circuits often lack generality and are restricted to certain circuit types, approximation techniques, and quality assurance methods. Moreover, only few tools are publicly available. This hinders the development and evaluation of new techniques for approximating circuits and their comparison to previous approaches. In this paper, we first analyze and classify related approaches and then present CIRCA, our flexible framework for search-based approximate circuit generation. CIRCA is developed with a focus on modularity and extensibility. We present the architecture of CIRCA with its clear separation into stages and functional blocks, report on the current prototype, and show initial experiments."}]},{"date_created":"2018-05-25T11:10:36Z","type":"journal_article","department":[{"_id":"64"}],"publication":"Theoretical Computer Science","language":[{"iso":"eng"}],"doi":"10.1016/j.tcs.2018.04.048","title":"Complexity of single-swap heuristics for metric facility location and related problems","year":"2019","author":[{"last_name":"Brauer","first_name":"Sascha","full_name":"Brauer, Sascha","id":"13291"}],"publication_identifier":{"issn":["0304-3975"]},"publication_status":"published","date_updated":"2022-01-06T06:58:46Z","intvolume":"       754","citation":{"bibtex":"@article{Brauer_2019, title={Complexity of single-swap heuristics for metric facility location and related problems}, volume={754}, DOI={<a href=\"https://doi.org/10.1016/j.tcs.2018.04.048\">10.1016/j.tcs.2018.04.048</a>}, journal={Theoretical Computer Science}, publisher={Elsevier}, author={Brauer, Sascha}, year={2019}, pages={88–106} }","ama":"Brauer S. Complexity of single-swap heuristics for metric facility location and related problems. <i>Theoretical Computer Science</i>. 2019;754:88-106. doi:<a href=\"https://doi.org/10.1016/j.tcs.2018.04.048\">10.1016/j.tcs.2018.04.048</a>","mla":"Brauer, Sascha. “Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems.” <i>Theoretical Computer Science</i>, vol. 754, Elsevier, 2019, pp. 88–106, doi:<a href=\"https://doi.org/10.1016/j.tcs.2018.04.048\">10.1016/j.tcs.2018.04.048</a>.","short":"S. Brauer, Theoretical Computer Science 754 (2019) 88–106.","chicago":"Brauer, Sascha. “Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems.” <i>Theoretical Computer Science</i> 754 (2019): 88–106. <a href=\"https://doi.org/10.1016/j.tcs.2018.04.048\">https://doi.org/10.1016/j.tcs.2018.04.048</a>.","ieee":"S. Brauer, “Complexity of single-swap heuristics for metric facility location and related problems,” <i>Theoretical Computer Science</i>, vol. 754, pp. 88–106, 2019.","apa":"Brauer, S. (2019). Complexity of single-swap heuristics for metric facility location and related problems. <i>Theoretical Computer Science</i>, <i>754</i>, 88–106. <a href=\"https://doi.org/10.1016/j.tcs.2018.04.048\">https://doi.org/10.1016/j.tcs.2018.04.048</a>"},"project":[{"name":"Soft-Clustering - Von Heuristiken zu Approximationsalgorithmen","_id":"45"}],"page":"88-106","_id":"2916","publisher":"Elsevier","user_id":"13291","volume":754,"status":"public"},{"type":"journal_article","department":[{"_id":"66"}],"date_created":"2020-06-26T10:48:24Z","publication":"Information Systems","citation":{"apa":"Carmona, J., Engels, G., Kumar, A., &#38; Reichert, M. (2019). Special issue: Selected papers of BPM 2017. <i>Information Systems</i>, 238–239. <a href=\"https://doi.org/10.1016/j.is.2019.06.001\">https://doi.org/10.1016/j.is.2019.06.001</a>","ieee":"J. Carmona, G. Engels, A. Kumar, and M. Reichert, “Special issue: Selected papers of BPM 2017,” <i>Information Systems</i>, pp. 238–239, 2019.","short":"J. Carmona, G. Engels, A. Kumar, M. Reichert, Information Systems (2019) 238–239.","chicago":"Carmona, Josep, Gregor Engels, Akhil Kumar, and Manfred Reichert. “Special Issue: Selected Papers of BPM 2017.” <i>Information Systems</i>, 2019, 238–39. <a href=\"https://doi.org/10.1016/j.is.2019.06.001\">https://doi.org/10.1016/j.is.2019.06.001</a>.","mla":"Carmona, Josep, et al. “Special Issue: Selected Papers of BPM 2017.” <i>Information Systems</i>, 2019, pp. 238–39, doi:<a href=\"https://doi.org/10.1016/j.is.2019.06.001\">10.1016/j.is.2019.06.001</a>.","ama":"Carmona J, Engels G, Kumar A, Reichert M. Special issue: Selected papers of BPM 2017. <i>Information Systems</i>. 2019:238-239. doi:<a href=\"https://doi.org/10.1016/j.is.2019.06.001\">10.1016/j.is.2019.06.001</a>","bibtex":"@article{Carmona_Engels_Kumar_Reichert_2019, title={Special issue: Selected papers of BPM 2017}, DOI={<a href=\"https://doi.org/10.1016/j.is.2019.06.001\">10.1016/j.is.2019.06.001</a>}, journal={Information Systems}, author={Carmona, Josep and Engels, Gregor and Kumar, Akhil and Reichert, Manfred}, year={2019}, pages={238–239} }"},"user_id":"57458","doi":"10.1016/j.is.2019.06.001","page":"238-239","_id":"17339","language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2022-01-06T06:53:08Z","status":"public","title":"Special issue: Selected papers of BPM 2017","year":"2019","author":[{"full_name":"Carmona, Josep","first_name":"Josep","last_name":"Carmona"},{"id":"107","first_name":"Gregor","last_name":"Engels","full_name":"Engels, Gregor"},{"first_name":"Akhil","last_name":"Kumar","full_name":"Kumar, Akhil"},{"last_name":"Reichert","first_name":"Manfred","full_name":"Reichert, Manfred"}],"publication_identifier":{"issn":["0306-4379"]}}]