[{"doi":"10.1109/ssrr.2018.8468658","user_id":"27340","language":[{"iso":"eng"}],"_id":"5822","publisher":"IEEE","date_updated":"2022-01-06T07:02:43Z","publication_status":"published","author":[{"full_name":"Gaspers, Daniel","first_name":"Daniel","last_name":"Gaspers"},{"first_name":"Christoph","last_name":"Knorr","full_name":"Knorr, Christoph"},{"id":"27340","full_name":"Nickchen, Tobias","first_name":"Tobias","orcid":"0000-0001-8958-9330","last_name":"Nickchen"},{"last_name":"Nickchen","first_name":"Daniel","full_name":"Nickchen, Daniel"},{"full_name":"Mertsching, Barbel","first_name":"Barbel","last_name":"Mertsching"},{"full_name":"Mohamed, Mahmoud A.","first_name":"Mahmoud A.","last_name":"Mohamed"}],"publication_identifier":{"isbn":["9781538655726"]},"title":"Real-time Graph-Based 3D Reconstruction of Sparse Feature Environments for Mobile Robot Applications","year":"2018","status":"public","department":[{"_id":"66"},{"_id":"534"}],"type":"conference","date_created":"2018-11-26T08:49:44Z","citation":{"ama":"Gaspers D, Knorr C, Nickchen T, Nickchen D, Mertsching B, Mohamed MA. Real-time Graph-Based 3D Reconstruction of Sparse Feature Environments for Mobile Robot Applications. In: <i>2018 IEEE International Symposium on Safety, Security, and Rescue Robotics (SSRR)</i>. IEEE; 2018. doi:<a href=\"https://doi.org/10.1109/ssrr.2018.8468658\">10.1109/ssrr.2018.8468658</a>","bibtex":"@inproceedings{Gaspers_Knorr_Nickchen_Nickchen_Mertsching_Mohamed_2018, title={Real-time Graph-Based 3D Reconstruction of Sparse Feature Environments for Mobile Robot Applications}, DOI={<a href=\"https://doi.org/10.1109/ssrr.2018.8468658\">10.1109/ssrr.2018.8468658</a>}, booktitle={2018 IEEE International Symposium on Safety, Security, and Rescue Robotics (SSRR)}, publisher={IEEE}, author={Gaspers, Daniel and Knorr, Christoph and Nickchen, Tobias and Nickchen, Daniel and Mertsching, Barbel and Mohamed, Mahmoud A.}, year={2018} }","mla":"Gaspers, Daniel, et al. “Real-Time Graph-Based 3D Reconstruction of Sparse Feature Environments for Mobile Robot Applications.” <i>2018 IEEE International Symposium on Safety, Security, and Rescue Robotics (SSRR)</i>, IEEE, 2018, doi:<a href=\"https://doi.org/10.1109/ssrr.2018.8468658\">10.1109/ssrr.2018.8468658</a>.","short":"D. Gaspers, C. Knorr, T. Nickchen, D. Nickchen, B. Mertsching, M.A. Mohamed, in: 2018 IEEE International Symposium on Safety, Security, and Rescue Robotics (SSRR), IEEE, 2018.","chicago":"Gaspers, Daniel, Christoph Knorr, Tobias Nickchen, Daniel Nickchen, Barbel Mertsching, and Mahmoud A. Mohamed. “Real-Time Graph-Based 3D Reconstruction of Sparse Feature Environments for Mobile Robot Applications.” In <i>2018 IEEE International Symposium on Safety, Security, and Rescue Robotics (SSRR)</i>. IEEE, 2018. <a href=\"https://doi.org/10.1109/ssrr.2018.8468658\">https://doi.org/10.1109/ssrr.2018.8468658</a>.","apa":"Gaspers, D., Knorr, C., Nickchen, T., Nickchen, D., Mertsching, B., &#38; Mohamed, M. A. (2018). Real-time Graph-Based 3D Reconstruction of Sparse Feature Environments for Mobile Robot Applications. In <i>2018 IEEE International Symposium on Safety, Security, and Rescue Robotics (SSRR)</i>. IEEE. <a href=\"https://doi.org/10.1109/ssrr.2018.8468658\">https://doi.org/10.1109/ssrr.2018.8468658</a>","ieee":"D. Gaspers, C. Knorr, T. Nickchen, D. Nickchen, B. Mertsching, and M. A. Mohamed, “Real-time Graph-Based 3D Reconstruction of Sparse Feature Environments for Mobile Robot Applications,” in <i>2018 IEEE International Symposium on Safety, Security, and Rescue Robotics (SSRR)</i>, 2018."},"publication":"2018 IEEE International Symposium on Safety, Security, and Rescue Robotics (SSRR)"},{"publication":"Numerical and Evolutionary Optimization – NEO 2017","citation":{"chicago":"Gebken, Bennet, Sebastian Peitz, and Michael Dellnitz. “A Descent Method for Equality and Inequality Constrained Multiobjective Optimization Problems.” In <i>Numerical and Evolutionary Optimization – NEO 2017</i>. Cham, 2018. <a href=\"https://doi.org/10.1007/978-3-319-96104-0_2\">https://doi.org/10.1007/978-3-319-96104-0_2</a>.","short":"B. Gebken, S. Peitz, M. Dellnitz, in: Numerical and Evolutionary Optimization – NEO 2017, Cham, 2018.","apa":"Gebken, B., Peitz, S., &#38; Dellnitz, M. (2018). A Descent Method for Equality and Inequality Constrained Multiobjective Optimization Problems. In <i>Numerical and Evolutionary Optimization – NEO 2017</i>. Cham. <a href=\"https://doi.org/10.1007/978-3-319-96104-0_2\">https://doi.org/10.1007/978-3-319-96104-0_2</a>","ieee":"B. Gebken, S. Peitz, and M. Dellnitz, “A Descent Method for Equality and Inequality Constrained Multiobjective Optimization Problems,” in <i>Numerical and Evolutionary Optimization – NEO 2017</i>, 2018.","ama":"Gebken B, Peitz S, Dellnitz M. A Descent Method for Equality and Inequality Constrained Multiobjective Optimization Problems. In: <i>Numerical and Evolutionary Optimization – NEO 2017</i>. Cham; 2018. doi:<a href=\"https://doi.org/10.1007/978-3-319-96104-0_2\">10.1007/978-3-319-96104-0_2</a>","bibtex":"@inproceedings{Gebken_Peitz_Dellnitz_2018, place={Cham}, title={A Descent Method for Equality and Inequality Constrained Multiobjective Optimization Problems}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-96104-0_2\">10.1007/978-3-319-96104-0_2</a>}, booktitle={Numerical and Evolutionary Optimization – NEO 2017}, author={Gebken, Bennet and Peitz, Sebastian and Dellnitz, Michael}, year={2018} }","mla":"Gebken, Bennet, et al. “A Descent Method for Equality and Inequality Constrained Multiobjective Optimization Problems.” <i>Numerical and Evolutionary Optimization – NEO 2017</i>, 2018, doi:<a href=\"https://doi.org/10.1007/978-3-319-96104-0_2\">10.1007/978-3-319-96104-0_2</a>."},"abstract":[{"lang":"eng","text":"In this article we propose a descent method for equality and inequality constrained multiobjective optimization problems (MOPs) which generalizes the steepest descent method for unconstrained MOPs by Fliege and Svaiter to constrained problems by using two active set strategies. Under some regularity assumptions on the problem, we show that accumulation points of our descent method satisfy a necessary condition for local Pareto optimality. Finally, we show the typical behavior of our method in a numerical example."}],"place":"Cham","date_created":"2019-03-29T13:26:47Z","type":"conference","department":[{"_id":"101"}],"title":"A Descent Method for Equality and Inequality Constrained Multiobjective Optimization Problems","year":"2018","status":"public","conference":{"name":"NEO 2017: Numerical and Evolutionary Optimization"},"publication_identifier":{"isbn":["9783319961033","9783319961040"],"issn":["1860-949X","1860-9503"]},"author":[{"full_name":"Gebken, Bennet","last_name":"Gebken","first_name":"Bennet","id":"32643"},{"id":"47427","full_name":"Peitz, Sebastian","first_name":"Sebastian","last_name":"Peitz","orcid":"https://orcid.org/0000-0002-3389-793X"},{"full_name":"Dellnitz, Michael","last_name":"Dellnitz","first_name":"Michael"}],"date_updated":"2022-01-06T07:04:00Z","publication_status":"published","language":[{"iso":"eng"}],"_id":"8750","doi":"10.1007/978-3-319-96104-0_2","user_id":"47427"},{"title":"A Survey of Recent Trends in Multiobjective Optimal Control—Surrogate Models, Feedback Control and Objective Reduction","year":"2018","publication_identifier":{"issn":["2297-8747"]},"author":[{"full_name":"Peitz, Sebastian","orcid":"https://orcid.org/0000-0002-3389-793X","first_name":"Sebastian","last_name":"Peitz","id":"47427"},{"first_name":"Michael","last_name":"Dellnitz","full_name":"Dellnitz, Michael"}],"date_updated":"2022-01-06T07:04:00Z","publication_status":"published","intvolume":"        23","article_type":"review","main_file_link":[{"open_access":"1","url":"https://www.mdpi.com/2297-8747/23/2/30/pdf"}],"language":[{"iso":"eng"}],"doi":"10.3390/mca23020030","publication":"Mathematical and Computational Applications","issue":"2","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, which results in new challenges such as expensive models or real-time applicability. Since 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 accelerating multiobjective optimal control for complex problems where either PDE constraints are present or where a feedback behavior has to be achieved. In the first case, surrogate models yield significant speed-ups. Besides classical meta-modeling techniques for multiobjective optimization, a promising alternative for control problems is to introduce a surrogate model for the system dynamics. In the case of real-time requirements, various promising model predictive control approaches have been proposed, using either fast online solvers or offline-online decomposition. We also briefly comment on dimension reduction in many-objective optimization problems as another technique for reducing the numerical effort."}],"date_created":"2019-03-29T13:27:51Z","type":"journal_article","department":[{"_id":"101"}],"status":"public","_id":"8751","user_id":"47427","volume":23,"citation":{"apa":"Peitz, S., &#38; Dellnitz, M. (2018). A Survey of Recent Trends in Multiobjective Optimal Control—Surrogate Models, Feedback Control and Objective Reduction. <i>Mathematical and Computational Applications</i>, <i>23</i>(2). <a href=\"https://doi.org/10.3390/mca23020030\">https://doi.org/10.3390/mca23020030</a>","ieee":"S. Peitz and M. Dellnitz, “A Survey of Recent Trends in Multiobjective Optimal Control—Surrogate Models, Feedback Control and Objective Reduction,” <i>Mathematical and Computational Applications</i>, vol. 23, no. 2, 2018.","chicago":"Peitz, Sebastian, and Michael Dellnitz. “A Survey of Recent Trends in Multiobjective Optimal Control—Surrogate Models, Feedback Control and Objective Reduction.” <i>Mathematical and Computational Applications</i> 23, no. 2 (2018). <a href=\"https://doi.org/10.3390/mca23020030\">https://doi.org/10.3390/mca23020030</a>.","short":"S. Peitz, M. Dellnitz, Mathematical and Computational Applications 23 (2018).","mla":"Peitz, Sebastian, and Michael Dellnitz. “A Survey of Recent Trends in Multiobjective Optimal Control—Surrogate Models, Feedback Control and Objective Reduction.” <i>Mathematical and Computational Applications</i>, vol. 23, no. 2, 2018, doi:<a href=\"https://doi.org/10.3390/mca23020030\">10.3390/mca23020030</a>.","ama":"Peitz S, Dellnitz M. A Survey of Recent Trends in Multiobjective Optimal Control—Surrogate Models, Feedback Control and Objective Reduction. <i>Mathematical and Computational Applications</i>. 2018;23(2). doi:<a href=\"https://doi.org/10.3390/mca23020030\">10.3390/mca23020030</a>","bibtex":"@article{Peitz_Dellnitz_2018, title={A Survey of Recent Trends in Multiobjective Optimal Control—Surrogate Models, Feedback Control and Objective Reduction}, volume={23}, DOI={<a href=\"https://doi.org/10.3390/mca23020030\">10.3390/mca23020030</a>}, number={2}, journal={Mathematical and Computational Applications}, author={Peitz, Sebastian and Dellnitz, Michael}, year={2018} }"},"oa":"1"},{"citation":{"mla":"Beermann, Dennis, et al. “Set-Oriented Multiobjective Optimal Control of PDEs Using Proper Orthogonal Decomposition.” <i>Reduced-Order Modeling (ROM) for Simulation and Optimization</i>, 2018, pp. 47–72, doi:<a href=\"https://doi.org/10.1007/978-3-319-75319-5_3\">10.1007/978-3-319-75319-5_3</a>.","ama":"Beermann D, Dellnitz M, Peitz S, Volkwein S. Set-Oriented Multiobjective Optimal Control of PDEs Using Proper Orthogonal Decomposition. In: <i>Reduced-Order Modeling (ROM) for Simulation and Optimization</i>. Cham; 2018:47-72. doi:<a href=\"https://doi.org/10.1007/978-3-319-75319-5_3\">10.1007/978-3-319-75319-5_3</a>","bibtex":"@inbook{Beermann_Dellnitz_Peitz_Volkwein_2018, place={Cham}, title={Set-Oriented Multiobjective Optimal Control of PDEs Using Proper Orthogonal Decomposition}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-75319-5_3\">10.1007/978-3-319-75319-5_3</a>}, booktitle={Reduced-Order Modeling (ROM) for Simulation and Optimization}, author={Beermann, Dennis and Dellnitz, Michael and Peitz, Sebastian and Volkwein, Stefan}, year={2018}, pages={47–72} }","apa":"Beermann, D., Dellnitz, M., Peitz, S., &#38; Volkwein, S. (2018). Set-Oriented Multiobjective Optimal Control of PDEs Using Proper Orthogonal Decomposition. In <i>Reduced-Order Modeling (ROM) for Simulation and Optimization</i> (pp. 47–72). Cham. <a href=\"https://doi.org/10.1007/978-3-319-75319-5_3\">https://doi.org/10.1007/978-3-319-75319-5_3</a>","ieee":"D. Beermann, M. Dellnitz, S. Peitz, and S. Volkwein, “Set-Oriented Multiobjective Optimal Control of PDEs Using Proper Orthogonal Decomposition,” in <i>Reduced-Order Modeling (ROM) for Simulation and Optimization</i>, Cham, 2018, pp. 47–72.","chicago":"Beermann, Dennis, Michael Dellnitz, Sebastian Peitz, and Stefan Volkwein. “Set-Oriented Multiobjective Optimal Control of PDEs Using Proper Orthogonal Decomposition.” In <i>Reduced-Order Modeling (ROM) for Simulation and Optimization</i>, 47–72. Cham, 2018. <a href=\"https://doi.org/10.1007/978-3-319-75319-5_3\">https://doi.org/10.1007/978-3-319-75319-5_3</a>.","short":"D. Beermann, M. Dellnitz, S. Peitz, S. Volkwein, in: Reduced-Order Modeling (ROM) for Simulation and Optimization, Cham, 2018, pp. 47–72."},"publication":"Reduced-Order Modeling (ROM) for Simulation and Optimization","project":[{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"abstract":[{"text":"In this chapter, we combine a global, derivative-free subdivision algorithm for multiobjective optimization problems with a posteriori error estimates for reduced-order models based on Proper Orthogonal Decomposition in order to efficiently solve multiobjective optimization problems governed by partial differential equations. An error bound for a semilinear heat equation is developed in such a way that the errors in the conflicting objectives can be estimated individually. The resulting algorithm constructs a library of locally valid reduced-order models online using a Greedy (worst-first) search. Using this approach, the number of evaluations of the full-order model can be reduced by a factor of more than 1000.","lang":"eng"}],"place":"Cham","date_created":"2019-03-29T13:31:20Z","department":[{"_id":"101"}],"type":"book_chapter","author":[{"full_name":"Beermann, Dennis","first_name":"Dennis","last_name":"Beermann"},{"first_name":"Michael","last_name":"Dellnitz","full_name":"Dellnitz, Michael"},{"id":"47427","orcid":"https://orcid.org/0000-0002-3389-793X","last_name":"Peitz","first_name":"Sebastian","full_name":"Peitz, Sebastian"},{"full_name":"Volkwein, Stefan","last_name":"Volkwein","first_name":"Stefan"}],"publication_identifier":{"isbn":["9783319753188","9783319753195"]},"year":"2018","status":"public","title":"Set-Oriented Multiobjective Optimal Control of PDEs Using Proper Orthogonal Decomposition","date_updated":"2022-01-06T07:04:00Z","publication_status":"published","_id":"8754","language":[{"iso":"eng"}],"page":"47-72","doi":"10.1007/978-3-319-75319-5_3","user_id":"47427"},{"author":[{"first_name":"Andreas","last_name":"Unger","full_name":"Unger, Andreas"},{"last_name":"Hunstig","first_name":"Matthias","full_name":"Hunstig, Matthias"},{"full_name":"Meyer, Tobias","first_name":"Tobias","last_name":"Meyer"},{"full_name":"Brökelmann, Michael","last_name":"Brökelmann","first_name":"Michael"},{"full_name":"Sextro, Walter","first_name":"Walter","last_name":"Sextro","id":"21220"}],"status":"public","title":"Intelligent Production of Wire Bonds using Multi-Objective Optimization – Insights, Opportunities and Challenges","year":"2018","date_updated":"2020-05-07T05:33:56Z","language":[{"iso":"eng"}],"_id":"9999","volume":"Vol. 2018, No. 1, pp. 000572-000577.","user_id":"210","doi":"10.4071/2380-4505-2018.1.000572","citation":{"ama":"Unger A, Hunstig M, Meyer T, Brökelmann M, Sextro W. Intelligent Production of Wire Bonds using Multi-Objective Optimization – Insights, Opportunities and Challenges. In: <i>In Proceedings of IMAPS 2018 – 51st Symposium on Microelectronics, Pasadena, CA, 2018</i>. Vol Vol. 2018, No. 1, pp. 000572-000577. ; 2018. doi:<a href=\"https://doi.org/10.4071/2380-4505-2018.1.000572\">10.4071/2380-4505-2018.1.000572</a>","bibtex":"@inproceedings{Unger_Hunstig_Meyer_Brökelmann_Sextro_2018, title={Intelligent Production of Wire Bonds using Multi-Objective Optimization – Insights, Opportunities and Challenges}, volume={Vol. 2018, No. 1, pp. 000572-000577.}, DOI={<a href=\"https://doi.org/10.4071/2380-4505-2018.1.000572\">10.4071/2380-4505-2018.1.000572</a>}, booktitle={In Proceedings of IMAPS 2018 – 51st Symposium on Microelectronics, Pasadena, CA, 2018}, author={Unger, Andreas and Hunstig, Matthias and Meyer, Tobias and Brökelmann, Michael and Sextro, Walter}, year={2018} }","mla":"Unger, Andreas, et al. “Intelligent Production of Wire Bonds Using Multi-Objective Optimization – Insights, Opportunities and Challenges.” <i>In Proceedings of IMAPS 2018 – 51st Symposium on Microelectronics, Pasadena, CA, 2018</i>, vol. Vol. 2018, No. 1, pp. 000572-000577., 2018, doi:<a href=\"https://doi.org/10.4071/2380-4505-2018.1.000572\">10.4071/2380-4505-2018.1.000572</a>.","chicago":"Unger, Andreas, Matthias Hunstig, Tobias Meyer, Michael Brökelmann, and Walter Sextro. “Intelligent Production of Wire Bonds Using Multi-Objective Optimization – Insights, Opportunities and Challenges.” In <i>In Proceedings of IMAPS 2018 – 51st Symposium on Microelectronics, Pasadena, CA, 2018</i>, Vol. Vol. 2018, No. 1, pp. 000572-000577., 2018. <a href=\"https://doi.org/10.4071/2380-4505-2018.1.000572\">https://doi.org/10.4071/2380-4505-2018.1.000572</a>.","short":"A. Unger, M. Hunstig, T. Meyer, M. Brökelmann, W. Sextro, in: In Proceedings of IMAPS 2018 – 51st Symposium on Microelectronics, Pasadena, CA, 2018, 2018.","apa":"Unger, A., Hunstig, M., Meyer, T., Brökelmann, M., &#38; Sextro, W. (2018). Intelligent Production of Wire Bonds using Multi-Objective Optimization – Insights, Opportunities and Challenges. In <i>In Proceedings of IMAPS 2018 – 51st Symposium on Microelectronics, Pasadena, CA, 2018</i> (Vol. Vol. 2018, No. 1, pp. 000572-000577.). <a href=\"https://doi.org/10.4071/2380-4505-2018.1.000572\">https://doi.org/10.4071/2380-4505-2018.1.000572</a>","ieee":"A. Unger, M. Hunstig, T. Meyer, M. Brökelmann, and W. Sextro, “Intelligent Production of Wire Bonds using Multi-Objective Optimization – Insights, Opportunities and Challenges,” in <i>In Proceedings of IMAPS 2018 – 51st Symposium on Microelectronics, Pasadena, CA, 2018</i>, 2018, vol. Vol. 2018, No. 1, pp. 000572-000577."},"publication":"In Proceedings of IMAPS 2018 – 51st Symposium on Microelectronics, Pasadena, CA, 2018","project":[{"name":"Intelligente Herstellung zuverlässiger Kupferbondverbindungen","grant_number":"02 PQ2210","_id":"92"}],"quality_controlled":"1","abstract":[{"lang":"eng","text":"Ultrasonic wire bonding is an indispensable process in the industrial manufacturing of semiconductor devices. Copper wire is increasingly replacing the well-established aluminium wire because of its superior electrical, thermal and mechanical properties. Copper wire processes differ significantly from aluminium processes and are more sensitive to disturbances, which reduces the range of parameter values suitable for a stable process. Disturbances can be compensated by an adaption of process parameters, but finding suitable parameters manually is difficult and time-consuming. This paper presents a physical model of the ultrasonic wire bonding process including the friction contact between tool and wire. This model yields novel insights into the process. A prototype of a multi-objective optimizing bonding machine (MOBM) is presented. It uses multi-objective optimization, based on the complete process model, to automatically select the best operating point as a compromise of concurrent objectives."}],"date_created":"2019-05-27T10:27:45Z","department":[{"_id":"151"}],"keyword":["wire bonding","multi-objective optimization","process model","copper wire","self-optimization"],"type":"conference"},{"citation":{"chicago":"Brassat, Katharina, A. Taube, Daniel Kool, L. Tasche, K.P. Hoyer, Mirko Schaper, and Jörg Lindner. “Ti-6Al-4V Alloy: 3D Printing of Lightweight Implants and Nanopatterning by Self-Assembly,” 2018.","short":"K. Brassat, A. Taube, D. Kool, L. Tasche, K.P. Hoyer, M. Schaper, J. Lindner, in: 2018.","ama":"Brassat K, Taube A, Kool D, et al. Ti-6Al-4V alloy: 3D printing of lightweight implants and nanopatterning by self-assembly. In: ; 2018.","bibtex":"@inproceedings{Brassat_Taube_Kool_Tasche_Hoyer_Schaper_Lindner_2018, title={Ti-6Al-4V alloy: 3D printing of lightweight implants and nanopatterning by self-assembly}, author={Brassat, Katharina and Taube, A. and Kool, Daniel and Tasche, L. and Hoyer, K.P. and Schaper, Mirko and Lindner, Jörg}, year={2018} }","apa":"Brassat, K., Taube, A., Kool, D., Tasche, L., Hoyer, K. P., Schaper, M., &#38; Lindner, J. (2018). Ti-6Al-4V alloy: 3D printing of lightweight implants and nanopatterning by self-assembly. Presented at the EMRS-Fall Meeting 2018, Warsaw, Poland.","mla":"Brassat, Katharina, et al. <i>Ti-6Al-4V Alloy: 3D Printing of Lightweight Implants and Nanopatterning by Self-Assembly</i>. 2018.","ieee":"K. Brassat <i>et al.</i>, “Ti-6Al-4V alloy: 3D printing of lightweight implants and nanopatterning by self-assembly,” presented at the EMRS-Fall Meeting 2018, Warsaw, Poland, 2018."},"department":[{"_id":"286"},{"_id":"15"}],"type":"conference","date_created":"2018-08-16T13:18:03Z","date_updated":"2022-01-06T06:59:56Z","conference":{"location":"Warsaw, Poland","name":"EMRS-Fall Meeting 2018","start_date":"2018-09-17","end_date":"2018-09-20"},"author":[{"full_name":"Brassat, Katharina","first_name":"Katharina","last_name":"Brassat","id":"11305"},{"full_name":"Taube, A.","first_name":"A.","last_name":"Taube"},{"id":"44586","last_name":"Kool","first_name":"Daniel","full_name":"Kool, Daniel"},{"full_name":"Tasche, L.","first_name":"L.","last_name":"Tasche"},{"full_name":"Hoyer, K.P.","first_name":"K.P.","last_name":"Hoyer"},{"first_name":"Mirko","last_name":"Schaper","full_name":"Schaper, Mirko"},{"full_name":"Lindner, Jörg","last_name":"Lindner","first_name":"Jörg","id":"20797"}],"status":"public","title":"Ti-6Al-4V alloy: 3D printing of lightweight implants and nanopatterning by self-assembly","year":"2018","user_id":"55706","_id":"3930"},{"page":"1145-1167","publisher":"Springer Nature","_id":"669","ddc":["000"],"user_id":"14052","volume":36,"status":"public","has_accepted_license":"1","external_id":{"arxiv":["1607.05143"]},"file_date_updated":"2018-10-31T16:57:32Z","citation":{"mla":"Feldotto, Matthias, et al. “Congestion Games with Mixed Objectives.” <i>Journal of Combinatorial Optimization</i>, vol. 36, no. 4, Springer Nature, 2018, pp. 1145–67, doi:<a href=\"https://doi.org/10.1007/s10878-017-0189-y\">10.1007/s10878-017-0189-y</a>.","bibtex":"@article{Feldotto_Leder_Skopalik_2018, title={Congestion games with mixed objectives}, volume={36}, DOI={<a href=\"https://doi.org/10.1007/s10878-017-0189-y\">10.1007/s10878-017-0189-y</a>}, number={4}, journal={Journal of Combinatorial Optimization}, publisher={Springer Nature}, author={Feldotto, Matthias and Leder, Lennart and Skopalik, Alexander}, year={2018}, pages={1145–1167} }","ama":"Feldotto M, Leder L, Skopalik A. Congestion games with mixed objectives. <i>Journal of Combinatorial Optimization</i>. 2018;36(4):1145-1167. doi:<a href=\"https://doi.org/10.1007/s10878-017-0189-y\">10.1007/s10878-017-0189-y</a>","ieee":"M. Feldotto, L. Leder, and A. Skopalik, “Congestion games with mixed objectives,” <i>Journal of Combinatorial Optimization</i>, vol. 36, no. 4, pp. 1145–1167, 2018.","apa":"Feldotto, M., Leder, L., &#38; Skopalik, A. (2018). Congestion games with mixed objectives. <i>Journal of Combinatorial Optimization</i>, <i>36</i>(4), 1145–1167. <a href=\"https://doi.org/10.1007/s10878-017-0189-y\">https://doi.org/10.1007/s10878-017-0189-y</a>","short":"M. Feldotto, L. Leder, A. Skopalik, Journal of Combinatorial Optimization 36 (2018) 1145–1167.","chicago":"Feldotto, Matthias, Lennart Leder, and Alexander Skopalik. “Congestion Games with Mixed Objectives.” <i>Journal of Combinatorial Optimization</i> 36, no. 4 (2018): 1145–67. <a href=\"https://doi.org/10.1007/s10878-017-0189-y\">https://doi.org/10.1007/s10878-017-0189-y</a>."},"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"_id":"2","name":"SFB 901 - Project Area A"}],"language":[{"iso":"eng"}],"doi":"10.1007/s10878-017-0189-y","year":"2018","title":"Congestion games with mixed objectives","author":[{"id":"14052","last_name":"Feldotto","first_name":"Matthias","orcid":"0000-0003-1348-6516","full_name":"Feldotto, Matthias"},{"last_name":"Leder","first_name":"Lennart","full_name":"Leder, Lennart"},{"id":"40384","last_name":"Skopalik","first_name":"Alexander","full_name":"Skopalik, Alexander"}],"publication_identifier":{"issn":["1382-6905","1573-2886"]},"date_updated":"2022-01-06T07:03:15Z","publication_status":"published","intvolume":"        36","file":[{"date_created":"2018-10-31T16:57:32Z","creator":"feldi","file_id":"5226","content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-10-31T16:57:32Z","file_name":"Feldotto2018_Article_CongestionGamesWithMixedObject.pdf","file_size":605207,"access_level":"closed"}],"date_created":"2017-10-26T14:11:04Z","type":"journal_article","department":[{"_id":"63"},{"_id":"541"}],"publication":"Journal of Combinatorial Optimization","issue":"4","abstract":[{"text":"We study a new class of games which generalizes congestion games andits bottleneck variant. We introduce congestion games with mixed objectives to modelnetwork scenarios in which players seek to optimize for latency and bandwidths alike.We characterize the (non-)existence of pure Nash equilibria (PNE), the convergenceof improvement dynamics, the quality of equilibria and show the complexity of thedecision problem. For games that do not possess PNE we give bounds on the approx-imation ratio of approximate pure Nash equilibria.","lang":"eng"}]},{"has_accepted_license":"1","conference":{"name":"IEEE Global Communications Conference (GLOBECOM 2018)","location":"Abu Dhabi, UAE"},"status":"public","ddc":["040"],"user_id":"35343","publisher":"IEEE","_id":"6970","project":[{"grant_number":"761493","_id":"28","name":"5G Development and validation platform for global industry-specific network services and Apps"},{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"16","name":"SFB 901 - Subproject C4"}],"citation":{"ama":"Schneider SB, Dräxler S, Karl H. Trade-offs in Dynamic Resource Allocation in Network Function Virtualization. In: <i>IEEE Global Communications Conference (GLOBECOM 2018)</i>. IEEE; 2018.","bibtex":"@inproceedings{Schneider_Dräxler_Karl_2018, title={Trade-offs in Dynamic Resource Allocation in Network Function Virtualization}, booktitle={IEEE Global Communications Conference (GLOBECOM 2018)}, publisher={IEEE}, author={Schneider, Stefan Balthasar and Dräxler, Sevil and Karl, Holger}, year={2018} }","mla":"Schneider, Stefan Balthasar, et al. “Trade-Offs in Dynamic Resource Allocation in Network Function Virtualization.” <i>IEEE Global Communications Conference (GLOBECOM 2018)</i>, IEEE, 2018.","short":"S.B. Schneider, S. Dräxler, H. Karl, in: IEEE Global Communications Conference (GLOBECOM 2018), IEEE, 2018.","chicago":"Schneider, Stefan Balthasar, Sevil Dräxler, and Holger Karl. “Trade-Offs in Dynamic Resource Allocation in Network Function Virtualization.” In <i>IEEE Global Communications Conference (GLOBECOM 2018)</i>. IEEE, 2018.","apa":"Schneider, S. B., Dräxler, S., &#38; Karl, H. (2018). Trade-offs in Dynamic Resource Allocation in Network Function Virtualization. In <i>IEEE Global Communications Conference (GLOBECOM 2018)</i>. Abu Dhabi, UAE: IEEE.","ieee":"S. B. Schneider, S. Dräxler, and H. Karl, “Trade-offs in Dynamic Resource Allocation in Network Function Virtualization,” in <i>IEEE Global Communications Conference (GLOBECOM 2018)</i>, Abu Dhabi, UAE, 2018."},"file_date_updated":"2019-01-24T13:53:16Z","oa":"1","date_updated":"2022-01-06T07:03:24Z","author":[{"id":"35343","full_name":"Schneider, Stefan Balthasar","orcid":"0000-0001-8210-4011","last_name":"Schneider","first_name":"Stefan Balthasar"},{"id":"31764","first_name":"Sevil","last_name":"Dräxler","full_name":"Dräxler, Sevil"},{"last_name":"Karl","first_name":"Holger","full_name":"Karl, Holger","id":"126"}],"year":"2018","title":"Trade-offs in Dynamic Resource Allocation in Network Function Virtualization","language":[{"iso":"eng"}],"abstract":[{"text":"Dynamic allocation of resources is a key feature in network function virtualization (NFV), enabling flexible adjustment of slices and contained network services to ever-changing service demands. \r\nConsidering resource allocation across the entire network, many authors have proposed approaches to optimize the placement and chaining of virtual network function (VNF) instances and the allocation of resources to these VNF instances. In doing so, various optimization objectives are conceivable, e.g., minimizing certain required resources or the end-to-end delay of the placed services.\r\n\r\nIn this paper, we investigate the relationship between four typical optimization objectives when coordinating the placement and resource allocation of chained VNF instances. We observe an interesting trade-off between minimizing the overhead of starting/stopping VNF instances and all other objectives when adapting to changed service demands.","lang":"eng"}],"publication":"IEEE Global Communications Conference (GLOBECOM 2018)","department":[{"_id":"75"}],"type":"conference","date_created":"2019-01-24T13:53:22Z","file":[{"creator":"stschn","date_created":"2019-01-24T13:53:16Z","relation":"main_file","date_updated":"2019-01-24T13:53:16Z","file_name":"preprint_ris.pdf","access_level":"open_access","file_size":422196,"file_id":"6971","content_type":"application/pdf"}]},{"author":[{"full_name":"Solis-Vasquez, Leonardo","first_name":"Leonardo","last_name":"Solis-Vasquez"},{"last_name":"Koch","first_name":"Andreas","full_name":"Koch, Andreas"}],"title":"A Case Study in Using OpenCL on FPGAs: Creating an Open-Source Accelerator of the AutoDock Molecular Docking Software","status":"public","year":"2018","date_updated":"2022-01-06T06:52:50Z","language":[{"iso":"eng"}],"_id":"16425","page":"1-10","user_id":"61189","citation":{"short":"L. Solis-Vasquez, A. Koch, in: FSP Workshop 2018; Fifth International Workshop on FPGAs for Software Programmers, 2018, pp. 1–10.","chicago":"Solis-Vasquez, Leonardo, and Andreas Koch. “A Case Study in Using OpenCL on FPGAs: Creating an Open-Source Accelerator of the AutoDock Molecular Docking Software.” In <i>FSP Workshop 2018; Fifth International Workshop on FPGAs for Software Programmers</i>, 1–10, 2018.","ieee":"L. Solis-Vasquez and A. Koch, “A Case Study in Using OpenCL on FPGAs: Creating an Open-Source Accelerator of the AutoDock Molecular Docking Software,” in <i>FSP Workshop 2018; Fifth International Workshop on FPGAs for Software Programmers</i>, 2018, pp. 1–10.","apa":"Solis-Vasquez, L., &#38; Koch, A. (2018). A Case Study in Using OpenCL on FPGAs: Creating an Open-Source Accelerator of the AutoDock Molecular Docking Software. In <i>FSP Workshop 2018; Fifth International Workshop on FPGAs for Software Programmers</i> (pp. 1–10).","bibtex":"@inproceedings{Solis-Vasquez_Koch_2018, title={A Case Study in Using OpenCL on FPGAs: Creating an Open-Source Accelerator of the AutoDock Molecular Docking Software}, booktitle={FSP Workshop 2018; Fifth International Workshop on FPGAs for Software Programmers}, author={Solis-Vasquez, Leonardo and Koch, Andreas}, year={2018}, pages={1–10} }","ama":"Solis-Vasquez L, Koch A. A Case Study in Using OpenCL on FPGAs: Creating an Open-Source Accelerator of the AutoDock Molecular Docking Software. In: <i>FSP Workshop 2018; Fifth International Workshop on FPGAs for Software Programmers</i>. ; 2018:1-10.","mla":"Solis-Vasquez, Leonardo, and Andreas Koch. “A Case Study in Using OpenCL on FPGAs: Creating an Open-Source Accelerator of the AutoDock Molecular Docking Software.” <i>FSP Workshop 2018; Fifth International Workshop on FPGAs for Software Programmers</i>, 2018, pp. 1–10."},"publication":"FSP Workshop 2018; Fifth International Workshop on FPGAs for Software Programmers","abstract":[{"text":"In recent years, OpenCL has been increasingly adopted as it enables software programmers to harness the performance and power efficiency of FPGAs. Despite simplifying the FPGA programming challenge, achieving high performance and energy efficiency with OpenCL is still a difficult task. In order to further contribute to the advance of the OpenCL usage for FPGAs, we utilize a realistic application scenario as our case study: the AutoDock molecular docking software. While OpenCL has proven its effectiveness in accelerating molecular docking on GPUs, for FPGA-based AutoDock accelerators it struggles with difficult design patterns. Besides complex multiple-producers to single-consumer datapaths, these include time-intensive loops with variable runtimes. Therefore, this work presents the design and optimization steps for implementing AutoDock in OpenCL targeting an Arria-10 FPGA, as well as a corresponding execution runtime and energy-efficiency evaluation. Applying these techniques improved the performance of the initial OpenCL implementation for FPGAs by three orders of magnitude, with the final version of the code now yielding speed-ups of up to ~2.7x, and energy-efficiency gains of up to ~1.8x over the original serial AutoDock version executing on a current-generation CPU.","lang":"eng"}],"date_created":"2020-04-06T12:23:38Z","keyword":["pc2-harp-ressources"],"type":"conference"},{"oa":"1","citation":{"mla":"Bäumer, Frederik Simon, and Michaela Geierhos. “How to Deal with Inaccurate Service Requirements? Insights in Our Current Approach and New Ideas.” <i>Joint Proceedings of REFSQ-2018 Workshops, Doctoral Symposium, Live Studies Track, and Poster Track Co-Located with the 23rd International Conference on Requirements Engineering: Foundation for Software Quality (REFSQ 2018)</i>, edited by Klaus Schmid et al., vol. 2075, CEUR-WS.org, 2018.","bibtex":"@inproceedings{Bäumer_Geierhos_2018, series={CEUR Workshop Proceedings}, title={How to Deal with Inaccurate Service Requirements? Insights in Our Current Approach and New Ideas}, volume={2075}, booktitle={Joint Proceedings of REFSQ-2018 Workshops, Doctoral Symposium, Live Studies Track, and Poster Track co-located with the 23rd International Conference on Requirements Engineering: Foundation for Software Quality (REFSQ 2018)}, publisher={CEUR-WS.org}, author={Bäumer, Frederik Simon and Geierhos, Michaela}, editor={Schmid, Klaus and Spoletini, Paola and Ben Charrada, Eya and Chisik, Yoram and Dalpiaz, Fabiano and Ferrari, Alessio and Forbrig, Peter and Franch, Xavier and Kirikova, Marite and Madhavji, Nazim and et al.Editors}, year={2018}, collection={CEUR Workshop Proceedings} }","ama":"Bäumer FS, Geierhos M. How to Deal with Inaccurate Service Requirements? Insights in Our Current Approach and New Ideas. In: Schmid K, Spoletini P, Ben Charrada E, et al., eds. <i>Joint Proceedings of REFSQ-2018 Workshops, Doctoral Symposium, Live Studies Track, and Poster Track Co-Located with the 23rd International Conference on Requirements Engineering: Foundation for Software Quality (REFSQ 2018)</i>. Vol 2075. CEUR Workshop Proceedings. CEUR-WS.org; 2018.","ieee":"F. S. Bäumer and M. Geierhos, “How to Deal with Inaccurate Service Requirements? Insights in Our Current Approach and New Ideas,” in <i>Joint Proceedings of REFSQ-2018 Workshops, Doctoral Symposium, Live Studies Track, and Poster Track co-located with the 23rd International Conference on Requirements Engineering: Foundation for Software Quality (REFSQ 2018)</i>, Utrecht, The Netherlands, 2018, vol. 2075.","apa":"Bäumer, F. S., &#38; Geierhos, M. (2018). How to Deal with Inaccurate Service Requirements? Insights in Our Current Approach and New Ideas. In K. Schmid, P. Spoletini, E. Ben Charrada, Y. Chisik, F. Dalpiaz, A. Ferrari, … A. Zamansky (Eds.), <i>Joint Proceedings of REFSQ-2018 Workshops, Doctoral Symposium, Live Studies Track, and Poster Track co-located with the 23rd International Conference on Requirements Engineering: Foundation for Software Quality (REFSQ 2018)</i> (Vol. 2075). Utrecht, The Netherlands: CEUR-WS.org.","short":"F.S. Bäumer, M. Geierhos, in: K. Schmid, P. Spoletini, E. Ben Charrada, Y. Chisik, F. Dalpiaz, A. Ferrari, P. Forbrig, X. Franch, M. Kirikova, N. Madhavji, C. Palomares, J. Ralyté, M. Sabetzadeh, P. Sawyer, D. van der Linden, A. Zamansky (Eds.), Joint Proceedings of REFSQ-2018 Workshops, Doctoral Symposium, Live Studies Track, and Poster Track Co-Located with the 23rd International Conference on Requirements Engineering: Foundation for Software Quality (REFSQ 2018), CEUR-WS.org, 2018.","chicago":"Bäumer, Frederik Simon, and Michaela Geierhos. “How to Deal with Inaccurate Service Requirements? Insights in Our Current Approach and New Ideas.” In <i>Joint Proceedings of REFSQ-2018 Workshops, Doctoral Symposium, Live Studies Track, and Poster Track Co-Located with the 23rd International Conference on Requirements Engineering: Foundation for Software Quality (REFSQ 2018)</i>, edited by Klaus Schmid, Paola Spoletini, Eya Ben Charrada, Yoram Chisik, Fabiano Dalpiaz, Alessio Ferrari, Peter Forbrig, et al., Vol. 2075. CEUR Workshop Proceedings. CEUR-WS.org, 2018."},"file_date_updated":"2018-11-02T13:52:54Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"9","name":"SFB 901 - Subproject B1"}],"quality_controlled":"1","_id":"1181","publisher":"CEUR-WS.org","volume":2075,"editor":[{"full_name":"Schmid, Klaus","last_name":"Schmid","first_name":"Klaus"},{"full_name":"Spoletini, Paola","first_name":"Paola","last_name":"Spoletini"},{"full_name":"Ben Charrada, Eya","last_name":"Ben Charrada","first_name":"Eya"},{"full_name":"Chisik, Yoram","first_name":"Yoram","last_name":"Chisik"},{"full_name":"Dalpiaz, Fabiano","first_name":"Fabiano","last_name":"Dalpiaz"},{"last_name":"Ferrari","first_name":"Alessio","full_name":"Ferrari, Alessio"},{"full_name":"Forbrig, Peter","first_name":"Peter","last_name":"Forbrig"},{"full_name":"Franch, Xavier","first_name":"Xavier","last_name":"Franch"},{"last_name":"Kirikova","first_name":"Marite","full_name":"Kirikova, Marite"},{"full_name":"Madhavji, Nazim","last_name":"Madhavji","first_name":"Nazim"},{"full_name":"Palomares, Cristina","first_name":"Cristina","last_name":"Palomares"},{"last_name":"Ralyté","first_name":"Jolita","full_name":"Ralyté, Jolita"},{"full_name":"Sabetzadeh, Mehrdad","last_name":"Sabetzadeh","first_name":"Mehrdad"},{"first_name":"Pete","last_name":"Sawyer","full_name":"Sawyer, Pete"},{"last_name":"van der Linden","first_name":"Dirk","full_name":"van der Linden, Dirk"},{"full_name":"Zamansky, Anna","last_name":"Zamansky","first_name":"Anna"}],"user_id":"477","ddc":["000"],"conference":{"end_date":"2018-03-19","location":"Utrecht, The Netherlands","name":"1st Workshop on Natural Language Processing for Requirements Engineering (NLP4RE)","start_date":"2018-03-19"},"status":"public","has_accepted_license":"1","date_created":"2018-03-02T09:22:12Z","file":[{"date_created":"2018-11-02T13:52:54Z","creator":"ups","file_id":"5256","success":1,"content_type":"application/pdf","file_name":"NLP4RE_paper1.pdf","access_level":"closed","file_size":1126820,"relation":"main_file","date_updated":"2018-11-02T13:52:54Z"}],"department":[{"_id":"36"},{"_id":"1"},{"_id":"579"}],"type":"conference","publication":"Joint Proceedings of REFSQ-2018 Workshops, Doctoral Symposium, Live Studies Track, and Poster Track co-located with the 23rd International Conference on Requirements Engineering: Foundation for Software Quality (REFSQ 2018)","abstract":[{"text":"The main idea in On-The-Fly Computing is to automatically compose existing software services according to the wishes of end-users. However, since user requirements are often ambiguous, vague and incomplete, the selection and composition of suitable software services is a challanging task. In this paper, we present our current approach to improve requirement descriptions before they are used for software composition. This procedure is fully automated, but also has limitations, for example, if necessary information is missing. In addition, and in response to the limitations, we provide insights into our above-mentioned current work that combines the existing optimization approach with a\r\nchatbot solution.","lang":"eng"}],"language":[{"iso":"eng"}],"series_title":"CEUR Workshop Proceedings","main_file_link":[{"open_access":"1","url":"http://ceur-ws.org/Vol-2075/NLP4RE_paper1.pdf"}],"publication_identifier":{"issn":["1613-0073"]},"author":[{"id":"38837","first_name":"Frederik Simon","last_name":"Bäumer","full_name":"Bäumer, Frederik Simon"},{"id":"42496","full_name":"Geierhos, Michaela","last_name":"Geierhos","first_name":"Michaela","orcid":"0000-0002-8180-5606"}],"year":"2018","title":"How to Deal with Inaccurate Service Requirements? Insights in Our Current Approach and New Ideas","intvolume":"      2075","publication_status":"published","date_updated":"2022-01-06T06:51:09Z"},{"status":"public","title":"Eye-movement Modeling Examples in Source Code Comprehension: A Classroom Study","year":"2018","author":[{"first_name":"Roman","last_name":"Bednarik","full_name":"Bednarik, Roman"},{"id":"60311","first_name":"Carsten","last_name":"Schulte","full_name":"Schulte, Carsten"},{"id":"32443","last_name":"Budde","first_name":"Lea","full_name":"Budde, Lea"},{"full_name":"Heinemann, Birte","first_name":"Birte","last_name":"Heinemann"},{"full_name":"Vrzakova, Hana","first_name":"Hana","last_name":"Vrzakova"}],"date_updated":"2022-01-06T06:52:30Z","page":"2:1-2:8","_id":"15585","language":[{"iso":"eng"}],"user_id":"21145","doi":"10.1145/3279720.3279722","publication":"Proceedings of the 18th Koli Calling International Conference on Computing Education Research, Koli, Finland, November 22-25, 2018","citation":{"bibtex":"@inproceedings{Bednarik_Schulte_Budde_Heinemann_Vrzakova_2018, title={Eye-movement Modeling Examples in Source Code Comprehension: A Classroom Study}, DOI={<a href=\"https://doi.org/10.1145/3279720.3279722\">10.1145/3279720.3279722</a>}, booktitle={Proceedings of the 18th Koli Calling International Conference on Computing Education Research, Koli, Finland, November 22-25, 2018}, author={Bednarik, Roman and Schulte, Carsten and Budde, Lea and Heinemann, Birte and Vrzakova, Hana}, year={2018}, pages={2:1-2:8} }","chicago":"Bednarik, Roman, Carsten Schulte, Lea Budde, Birte Heinemann, and Hana Vrzakova. “Eye-Movement Modeling Examples in Source Code Comprehension: A Classroom Study.” In <i>Proceedings of the 18th Koli Calling International Conference on Computing Education Research, Koli, Finland, November 22-25, 2018</i>, 2:1-2:8, 2018. <a href=\"https://doi.org/10.1145/3279720.3279722\">https://doi.org/10.1145/3279720.3279722</a>.","short":"R. Bednarik, C. Schulte, L. Budde, B. Heinemann, H. Vrzakova, in: Proceedings of the 18th Koli Calling International Conference on Computing Education Research, Koli, Finland, November 22-25, 2018, 2018, pp. 2:1-2:8.","ama":"Bednarik R, Schulte C, Budde L, Heinemann B, Vrzakova H. Eye-movement Modeling Examples in Source Code Comprehension: A Classroom Study. In: <i>Proceedings of the 18th Koli Calling International Conference on Computing Education Research, Koli, Finland, November 22-25, 2018</i>. ; 2018:2:1-2:8. doi:<a href=\"https://doi.org/10.1145/3279720.3279722\">10.1145/3279720.3279722</a>","ieee":"R. Bednarik, C. Schulte, L. Budde, B. Heinemann, and H. Vrzakova, “Eye-movement Modeling Examples in Source Code Comprehension: A Classroom Study,” in <i>Proceedings of the 18th Koli Calling International Conference on Computing Education Research, Koli, Finland, November 22-25, 2018</i>, 2018, pp. 2:1-2:8.","mla":"Bednarik, Roman, et al. “Eye-Movement Modeling Examples in Source Code Comprehension: A Classroom Study.” <i>Proceedings of the 18th Koli Calling International Conference on Computing Education Research, Koli, Finland, November 22-25, 2018</i>, 2018, pp. 2:1-2:8, doi:<a href=\"https://doi.org/10.1145/3279720.3279722\">10.1145/3279720.3279722</a>.","apa":"Bednarik, R., Schulte, C., Budde, L., Heinemann, B., &#38; Vrzakova, H. (2018). Eye-movement Modeling Examples in Source Code Comprehension: A Classroom Study. In <i>Proceedings of the 18th Koli Calling International Conference on Computing Education Research, Koli, Finland, November 22-25, 2018</i> (pp. 2:1-2:8). <a href=\"https://doi.org/10.1145/3279720.3279722\">https://doi.org/10.1145/3279720.3279722</a>"},"date_created":"2020-01-15T09:00:46Z","type":"conference","department":[{"_id":"67"}]},{"user_id":"32439","doi":"10.1007/978-3-319-96271-9_5","language":[{"iso":"eng"}],"_id":"14856","publication_status":"published","date_updated":"2022-01-06T06:52:08Z","year":"2018","title":"Heuristics and Simulation for Water Tank Optimization","status":"public","author":[{"full_name":"Hallmann, Corinna","first_name":"Corinna","last_name":"Hallmann"},{"id":"32685","full_name":"Burmeister, Sascha Christian","first_name":"Sascha Christian","last_name":"Burmeister"},{"full_name":"Wissing, Michaela","first_name":"Michaela","last_name":"Wissing","id":"32439"},{"last_name":"Suhl","first_name":"Leena","full_name":"Suhl, Leena"}],"publication_identifier":{"issn":["1865-0929","1865-0937"],"isbn":["9783319962702","9783319962719"]},"type":"book_chapter","department":[{"_id":"277"}],"date_created":"2019-11-08T08:10:10Z","place":"Cham","publication":"Communications in Computer and Information Science","citation":{"ieee":"C. Hallmann, S. C. Burmeister, M. Wissing, and L. Suhl, “Heuristics and Simulation for Water Tank Optimization,” in <i>Communications in Computer and Information Science</i>, Cham, 2018.","apa":"Hallmann, C., Burmeister, S. C., Wissing, M., &#38; Suhl, L. (2018). Heuristics and Simulation for Water Tank Optimization. In <i>Communications in Computer and Information Science</i>. Cham. <a href=\"https://doi.org/10.1007/978-3-319-96271-9_5\">https://doi.org/10.1007/978-3-319-96271-9_5</a>","mla":"Hallmann, Corinna, et al. “Heuristics and Simulation for Water Tank Optimization.” <i>Communications in Computer and Information Science</i>, 2018, doi:<a href=\"https://doi.org/10.1007/978-3-319-96271-9_5\">10.1007/978-3-319-96271-9_5</a>.","bibtex":"@inbook{Hallmann_Burmeister_Wissing_Suhl_2018, place={Cham}, title={Heuristics and Simulation for Water Tank Optimization}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-96271-9_5\">10.1007/978-3-319-96271-9_5</a>}, booktitle={Communications in Computer and Information Science}, author={Hallmann, Corinna and Burmeister, Sascha Christian and Wissing, Michaela and Suhl, Leena}, year={2018} }","chicago":"Hallmann, Corinna, Sascha Christian Burmeister, Michaela Wissing, and Leena Suhl. “Heuristics and Simulation for Water Tank Optimization.” In <i>Communications in Computer and Information Science</i>. Cham, 2018. <a href=\"https://doi.org/10.1007/978-3-319-96271-9_5\">https://doi.org/10.1007/978-3-319-96271-9_5</a>.","short":"C. Hallmann, S.C. Burmeister, M. Wissing, L. Suhl, in: Communications in Computer and Information Science, Cham, 2018.","ama":"Hallmann C, Burmeister SC, Wissing M, Suhl L. Heuristics and Simulation for Water Tank Optimization. In: <i>Communications in Computer and Information Science</i>. Cham; 2018. doi:<a href=\"https://doi.org/10.1007/978-3-319-96271-9_5\">10.1007/978-3-319-96271-9_5</a>"}},{"citation":{"ama":"Camberg AA, Tröster T. Optimization-based material design of tailored stacked hybrids for further improvement in lightweight car body structures. In: <i>HYBRID - MATERIALS AND STRUCTURES 2018 - PROCEEDINGS</i>. DGM - Deutsche Gesellschaft für Materialkunde e.V.; 2018.","bibtex":"@inproceedings{Camberg_Tröster_2018, title={Optimization-based material design of tailored stacked hybrids for further improvement in lightweight car body structures}, booktitle={HYBRID - MATERIALS AND STRUCTURES 2018 - PROCEEDINGS}, publisher={DGM - Deutsche Gesellschaft für Materialkunde e.V.}, author={Camberg, Alan Adam and Tröster, Thomas}, year={2018} }","mla":"Camberg, Alan Adam, and Thomas Tröster. “Optimization-Based Material Design of Tailored Stacked Hybrids for Further Improvement in Lightweight Car Body Structures.” <i>HYBRID - MATERIALS AND STRUCTURES 2018 - PROCEEDINGS</i>, DGM - Deutsche Gesellschaft für Materialkunde e.V., 2018.","short":"A.A. Camberg, T. Tröster, in: HYBRID - MATERIALS AND STRUCTURES 2018 - PROCEEDINGS, DGM - Deutsche Gesellschaft für Materialkunde e.V., 2018.","chicago":"Camberg, Alan Adam, and Thomas Tröster. “Optimization-Based Material Design of Tailored Stacked Hybrids for Further Improvement in Lightweight Car Body Structures.” In <i>HYBRID - MATERIALS AND STRUCTURES 2018 - PROCEEDINGS</i>. DGM - Deutsche Gesellschaft für Materialkunde e.V., 2018.","apa":"Camberg, A. A., &#38; Tröster, T. (2018). Optimization-based material design of tailored stacked hybrids for further improvement in lightweight car body structures. In <i>HYBRID - MATERIALS AND STRUCTURES 2018 - PROCEEDINGS</i>. Bremen: DGM - Deutsche Gesellschaft für Materialkunde e.V.","ieee":"A. A. Camberg and T. Tröster, “Optimization-based material design of tailored stacked hybrids for further improvement in lightweight car body structures,” in <i>HYBRID - MATERIALS AND STRUCTURES 2018 - PROCEEDINGS</i>, Bremen, 2018."},"publication":"HYBRID - MATERIALS AND STRUCTURES 2018 - PROCEEDINGS","department":[{"_id":"9"},{"_id":"321"},{"_id":"149"}],"type":"conference","date_created":"2020-02-24T14:59:47Z","date_updated":"2022-01-06T06:52:42Z","publication_status":"published","conference":{"end_date":"2018-04-19","location":"Bremen","start_date":"2018-04-18","name":"3rd International Conference on Hybrid Materials and Structures"},"author":[{"id":"60544","first_name":"Alan Adam","last_name":"Camberg","full_name":"Camberg, Alan Adam"},{"id":"553","last_name":"Tröster","first_name":"Thomas","full_name":"Tröster, Thomas"}],"publication_identifier":{"isbn":["978-3-88355-417-4"]},"status":"public","year":"2018","title":"Optimization-based material design of tailored stacked hybrids for further improvement in lightweight car body structures","user_id":"60544","publisher":"DGM - Deutsche Gesellschaft für Materialkunde e.V.","_id":"16034","language":[{"iso":"eng"}]},{"author":[{"last_name":"Klus","first_name":"Stefan","full_name":"Klus, Stefan"},{"id":"47427","full_name":"Peitz, Sebastian","first_name":"Sebastian","last_name":"Peitz","orcid":"https://orcid.org/0000-0002-3389-793X"},{"last_name":"Schuster","first_name":"Ingmar","full_name":"Schuster, Ingmar"}],"title":"Analyzing high-dimensional time-series data using kernel transfer  operator eigenfunctions","status":"public","year":"2018","date_updated":"2022-01-06T06:52:48Z","language":[{"iso":"eng"}],"_id":"16293","main_file_link":[{"open_access":"1","url":"https://arxiv.org/pdf/1805.10118.pdf"}],"user_id":"47427","citation":{"ama":"Klus S, Peitz S, Schuster I. Analyzing high-dimensional time-series data using kernel transfer  operator eigenfunctions. <i>arXiv:180510118</i>. 2018.","bibtex":"@article{Klus_Peitz_Schuster_2018, title={Analyzing high-dimensional time-series data using kernel transfer  operator eigenfunctions}, journal={arXiv:1805.10118}, author={Klus, Stefan and Peitz, Sebastian and Schuster, Ingmar}, year={2018} }","mla":"Klus, Stefan, et al. “Analyzing High-Dimensional Time-Series Data Using Kernel Transfer  Operator Eigenfunctions.” <i>ArXiv:1805.10118</i>, 2018.","short":"S. Klus, S. Peitz, I. Schuster, ArXiv:1805.10118 (2018).","chicago":"Klus, Stefan, Sebastian Peitz, and Ingmar Schuster. “Analyzing High-Dimensional Time-Series Data Using Kernel Transfer  Operator Eigenfunctions.” <i>ArXiv:1805.10118</i>, 2018.","apa":"Klus, S., Peitz, S., &#38; Schuster, I. (2018). Analyzing high-dimensional time-series data using kernel transfer  operator eigenfunctions. <i>ArXiv:1805.10118</i>.","ieee":"S. Klus, S. Peitz, and I. Schuster, “Analyzing high-dimensional time-series data using kernel transfer  operator eigenfunctions,” <i>arXiv:1805.10118</i>. 2018."},"publication":"arXiv:1805.10118","project":[{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"abstract":[{"text":"Kernel transfer operators, which can be regarded as approximations of\r\ntransfer operators such as the Perron-Frobenius or Koopman operator in\r\nreproducing kernel Hilbert spaces, are defined in terms of covariance and\r\ncross-covariance operators and have been shown to be closely related to the\r\nconditional mean embedding framework developed by the machine learning\r\ncommunity. The goal of this paper is to show how the dominant eigenfunctions of\r\nthese operators in combination with gradient-based optimization techniques can\r\nbe used to detect long-lived coherent patterns in high-dimensional time-series\r\ndata. The results will be illustrated using video data and a fluid flow\r\nexample.","lang":"eng"}],"date_created":"2020-03-13T12:44:12Z","oa":"1","department":[{"_id":"101"}],"type":"preprint"},{"user_id":"14052","ddc":["000"],"publisher":"Springer Nature","_id":"1369","has_accepted_license":"1","status":"public","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - Subproject A3"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"16","name":"SFB 901 - Subproject C4"}],"citation":{"ama":"Drees M, Feldotto M, Riechers S, Skopalik A. Pure Nash equilibria in restricted budget games. <i>Journal of Combinatorial Optimization</i>. 2018. doi:<a href=\"https://doi.org/10.1007/s10878-018-0269-7\">10.1007/s10878-018-0269-7</a>","bibtex":"@article{Drees_Feldotto_Riechers_Skopalik_2018, title={Pure Nash equilibria in restricted budget games}, DOI={<a href=\"https://doi.org/10.1007/s10878-018-0269-7\">10.1007/s10878-018-0269-7</a>}, journal={Journal of Combinatorial Optimization}, publisher={Springer Nature}, author={Drees, Maximilian and Feldotto, Matthias and Riechers, Sören and Skopalik, Alexander}, year={2018} }","mla":"Drees, Maximilian, et al. “Pure Nash Equilibria in Restricted Budget Games.” <i>Journal of Combinatorial Optimization</i>, Springer Nature, 2018, doi:<a href=\"https://doi.org/10.1007/s10878-018-0269-7\">10.1007/s10878-018-0269-7</a>.","short":"M. Drees, M. Feldotto, S. Riechers, A. Skopalik, Journal of Combinatorial Optimization (2018).","chicago":"Drees, Maximilian, Matthias Feldotto, Sören Riechers, and Alexander Skopalik. “Pure Nash Equilibria in Restricted Budget Games.” <i>Journal of Combinatorial Optimization</i>, 2018. <a href=\"https://doi.org/10.1007/s10878-018-0269-7\">https://doi.org/10.1007/s10878-018-0269-7</a>.","apa":"Drees, M., Feldotto, M., Riechers, S., &#38; Skopalik, A. (2018). Pure Nash equilibria in restricted budget games. <i>Journal of Combinatorial Optimization</i>. <a href=\"https://doi.org/10.1007/s10878-018-0269-7\">https://doi.org/10.1007/s10878-018-0269-7</a>","ieee":"M. Drees, M. Feldotto, S. Riechers, and A. Skopalik, “Pure Nash equilibria in restricted budget games,” <i>Journal of Combinatorial Optimization</i>, 2018."},"file_date_updated":"2018-10-31T16:56:13Z","doi":"10.1007/s10878-018-0269-7","language":[{"iso":"eng"}],"publication_status":"epub_ahead","date_updated":"2022-01-06T06:51:42Z","author":[{"first_name":"Maximilian","last_name":"Drees","full_name":"Drees, Maximilian"},{"id":"14052","orcid":"0000-0003-1348-6516","last_name":"Feldotto","first_name":"Matthias","full_name":"Feldotto, Matthias"},{"full_name":"Riechers, Sören","last_name":"Riechers","first_name":"Sören"},{"first_name":"Alexander","last_name":"Skopalik","full_name":"Skopalik, Alexander","id":"40384"}],"publication_identifier":{"issn":["1382-6905","1573-2886"]},"year":"2018","title":"Pure Nash equilibria in restricted budget games","department":[{"_id":"63"},{"_id":"541"}],"type":"journal_article","date_created":"2018-03-18T11:12:49Z","file":[{"creator":"feldi","date_created":"2018-10-31T16:56:13Z","file_name":"Drees2018_Article_PureNashEquilibriaInRestricted.pdf","file_size":561187,"access_level":"closed","relation":"main_file","date_updated":"2018-10-31T16:56:13Z","file_id":"5225","content_type":"application/pdf"}],"abstract":[{"text":"In budget games, players compete over resources with finite budgets. For every resource, a player has a specific demand and as a strategy, he chooses a subset of resources. If the total demand on a resource does not exceed its budget, the utility of each player who chose that resource equals his demand. Otherwise, the budget is shared proportionally. In the general case, pure Nash equilibria (NE) do not exist for such games. In this paper, we consider the natural classes of singleton and matroid budget games with additional constraints and show that for each, pure NE can be guaranteed. In addition, we introduce a lexicographical potential function to prove that every matroid budget game has an approximate pure NE which depends on the largest ratio between the different demands of each individual player.","lang":"eng"}],"publication":"Journal of Combinatorial Optimization"},{"issue":"1","publication":"Acta Applicandae Mathematicae","abstract":[{"lang":"eng","text":"In a wide range of applications it is desirable to optimally control a dynamical system with respect to concurrent, potentially competing goals. This gives rise to a multiobjective optimal control problem where, instead of computing a single optimal solution, the set of optimal compromises, the so-called Pareto set, has to be approximated. When the problem under consideration is described by a partial differential equation (PDE), as is the case for fluid flow, the computational cost rapidly increases and makes its direct treatment infeasible. Reduced order modeling is a very popular method to reduce the computational cost, in particular in a multi query context such as uncertainty quantification, parameter estimation or optimization. In this article, we show how to combine reduced order modeling and multiobjective optimal control techniques in order to efficiently solve multiobjective optimal control problems constrained by PDEs. We consider a global, derivative free optimization method as well as a local, gradient-based approach for which the optimality system is derived in two different ways. The methods are compared with regard to the solution quality as well as the computational effort and they are illustrated using the example of the flow around a cylinder and a backward-facing-step channel flow."}],"date_created":"2019-03-29T13:30:41Z","department":[{"_id":"101"}],"type":"journal_article","publication_identifier":{"issn":["0167-8019","1572-9036"]},"author":[{"first_name":"Sebastian","orcid":"https://orcid.org/0000-0002-3389-793X","last_name":"Peitz","full_name":"Peitz, Sebastian","id":"47427"},{"first_name":"Sina","last_name":"Ober-Blöbaum","full_name":"Ober-Blöbaum, Sina","id":"16494"},{"last_name":"Dellnitz","first_name":"Michael","full_name":"Dellnitz, Michael"}],"year":"2018","title":"Multiobjective Optimal Control Methods for the Navier-Stokes Equations Using Reduced Order Modeling","intvolume":"       161","publication_status":"published","date_updated":"2022-01-21T10:01:41Z","language":[{"iso":"eng"}],"doi":"10.1007/s10440-018-0209-7","citation":{"mla":"Peitz, Sebastian, et al. “Multiobjective Optimal Control Methods for the Navier-Stokes Equations Using Reduced Order Modeling.” <i>Acta Applicandae Mathematicae</i>, vol. 161, no. 1, 2018, pp. 171–199, doi:<a href=\"https://doi.org/10.1007/s10440-018-0209-7\">10.1007/s10440-018-0209-7</a>.","bibtex":"@article{Peitz_Ober-Blöbaum_Dellnitz_2018, title={Multiobjective Optimal Control Methods for the Navier-Stokes Equations Using Reduced Order Modeling}, volume={161}, DOI={<a href=\"https://doi.org/10.1007/s10440-018-0209-7\">10.1007/s10440-018-0209-7</a>}, number={1}, journal={Acta Applicandae Mathematicae}, author={Peitz, Sebastian and Ober-Blöbaum, Sina and Dellnitz, Michael}, year={2018}, pages={171–199} }","ama":"Peitz S, Ober-Blöbaum S, Dellnitz M. Multiobjective Optimal Control Methods for the Navier-Stokes Equations Using Reduced Order Modeling. <i>Acta Applicandae Mathematicae</i>. 2018;161(1):171–199. doi:<a href=\"https://doi.org/10.1007/s10440-018-0209-7\">10.1007/s10440-018-0209-7</a>","ieee":"S. Peitz, S. Ober-Blöbaum, and M. Dellnitz, “Multiobjective Optimal Control Methods for the Navier-Stokes Equations Using Reduced Order Modeling,” <i>Acta Applicandae Mathematicae</i>, vol. 161, no. 1, pp. 171–199, 2018, doi: <a href=\"https://doi.org/10.1007/s10440-018-0209-7\">10.1007/s10440-018-0209-7</a>.","apa":"Peitz, S., Ober-Blöbaum, S., &#38; Dellnitz, M. (2018). Multiobjective Optimal Control Methods for the Navier-Stokes Equations Using Reduced Order Modeling. <i>Acta Applicandae Mathematicae</i>, <i>161</i>(1), 171–199. <a href=\"https://doi.org/10.1007/s10440-018-0209-7\">https://doi.org/10.1007/s10440-018-0209-7</a>","chicago":"Peitz, Sebastian, Sina Ober-Blöbaum, and Michael Dellnitz. “Multiobjective Optimal Control Methods for the Navier-Stokes Equations Using Reduced Order Modeling.” <i>Acta Applicandae Mathematicae</i> 161, no. 1 (2018): 171–199. <a href=\"https://doi.org/10.1007/s10440-018-0209-7\">https://doi.org/10.1007/s10440-018-0209-7</a>.","short":"S. Peitz, S. Ober-Blöbaum, M. Dellnitz, Acta Applicandae Mathematicae 161 (2018) 171–199."},"project":[{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"status":"public","_id":"8753","page":"171–199","volume":161,"user_id":"15694"},{"publication_status":"published","date_updated":"2022-09-15T09:50:24Z","publication_identifier":{"issn":["2072-6643"]},"author":[{"id":"89838","full_name":"Bühlmeier, Judith","first_name":"Judith","last_name":"Bühlmeier"},{"first_name":"Carla","last_name":"Harris","full_name":"Harris, Carla"},{"first_name":"Sibylle","last_name":"Koletzko","full_name":"Koletzko, Sibylle"},{"first_name":"Irina","last_name":"Lehmann","full_name":"Lehmann, Irina"},{"full_name":"Bauer, Carl-Peter","last_name":"Bauer","first_name":"Carl-Peter"},{"first_name":"Tamara","last_name":"Schikowski","full_name":"Schikowski, Tamara"},{"full_name":"von Berg, Andrea","last_name":"von Berg","first_name":"Andrea"},{"last_name":"Berdel","first_name":"Dietrich","full_name":"Berdel, Dietrich"},{"last_name":"Heinrich","first_name":"Joachim","full_name":"Heinrich, Joachim"},{"full_name":"Hebebrand, Johannes","last_name":"Hebebrand","first_name":"Johannes"},{"first_name":"Manuel","last_name":"Föcker","full_name":"Föcker, Manuel"},{"full_name":"Standl, Marie","first_name":"Marie","last_name":"Standl"},{"orcid":"0000-0003-1603-3133","first_name":"Lars","last_name":"Libuda","full_name":"Libuda, Lars","id":"88682"}],"year":"2018","status":"public","title":"Dietary Acid Load and Mental Health Outcomes in Children and Adolescents: Results from the GINIplus and LISA Birth Cohort Studies","user_id":"89838","doi":"10.3390/nu10050582","_id":"27027","language":[{"iso":"eng"}],"article_number":"582","extern":"1","citation":{"short":"J. Bühlmeier, C. Harris, S. Koletzko, I. Lehmann, C.-P. Bauer, T. Schikowski, A. von Berg, D. Berdel, J. Heinrich, J. Hebebrand, M. Föcker, M. Standl, L. Libuda, Nutrients (2018).","chicago":"Bühlmeier, Judith, Carla Harris, Sibylle Koletzko, Irina Lehmann, Carl-Peter Bauer, Tamara Schikowski, Andrea von Berg, et al. “Dietary Acid Load and Mental Health Outcomes in Children and Adolescents: Results from the GINIplus and LISA Birth Cohort Studies.” <i>Nutrients</i>, 2018. <a href=\"https://doi.org/10.3390/nu10050582\">https://doi.org/10.3390/nu10050582</a>.","ieee":"J. Bühlmeier <i>et al.</i>, “Dietary Acid Load and Mental Health Outcomes in Children and Adolescents: Results from the GINIplus and LISA Birth Cohort Studies,” <i>Nutrients</i>, Art. no. 582, 2018, doi: <a href=\"https://doi.org/10.3390/nu10050582\">10.3390/nu10050582</a>.","apa":"Bühlmeier, J., Harris, C., Koletzko, S., Lehmann, I., Bauer, C.-P., Schikowski, T., von Berg, A., Berdel, D., Heinrich, J., Hebebrand, J., Föcker, M., Standl, M., &#38; Libuda, L. (2018). Dietary Acid Load and Mental Health Outcomes in Children and Adolescents: Results from the GINIplus and LISA Birth Cohort Studies. <i>Nutrients</i>, Article 582. <a href=\"https://doi.org/10.3390/nu10050582\">https://doi.org/10.3390/nu10050582</a>","bibtex":"@article{Bühlmeier_Harris_Koletzko_Lehmann_Bauer_Schikowski_von Berg_Berdel_Heinrich_Hebebrand_et al._2018, title={Dietary Acid Load and Mental Health Outcomes in Children and Adolescents: Results from the GINIplus and LISA Birth Cohort Studies}, DOI={<a href=\"https://doi.org/10.3390/nu10050582\">10.3390/nu10050582</a>}, number={582}, journal={Nutrients}, author={Bühlmeier, Judith and Harris, Carla and Koletzko, Sibylle and Lehmann, Irina and Bauer, Carl-Peter and Schikowski, Tamara and von Berg, Andrea and Berdel, Dietrich and Heinrich, Joachim and Hebebrand, Johannes and et al.}, year={2018} }","ama":"Bühlmeier J, Harris C, Koletzko S, et al. Dietary Acid Load and Mental Health Outcomes in Children and Adolescents: Results from the GINIplus and LISA Birth Cohort Studies. <i>Nutrients</i>. Published online 2018. doi:<a href=\"https://doi.org/10.3390/nu10050582\">10.3390/nu10050582</a>","mla":"Bühlmeier, Judith, et al. “Dietary Acid Load and Mental Health Outcomes in Children and Adolescents: Results from the GINIplus and LISA Birth Cohort Studies.” <i>Nutrients</i>, 582, 2018, doi:<a href=\"https://doi.org/10.3390/nu10050582\">10.3390/nu10050582</a>."},"publication":"Nutrients","department":[{"_id":"35"},{"_id":"22"},{"_id":"395"}],"type":"journal_article","date_created":"2021-11-01T19:29:28Z"},{"publication":"Service-Oriented Computing -- ICSOC 2017 Workshops","abstract":[{"lang":"eng","text":"Many websites offer links to social media sites for convenient content sharing. Unfortunately, those sharing capabilities are quite restricted and it is seldom possible to share content with other services, like those provided by a user's favorite applications or smart devices. In this paper, we present Semantic Data Mediator (SDM) --- a flexible middleware linking a vast number of services to millions of websites. Based on reusable repositories of service descriptions defined by the crowd, users can easily fill a personal registry with their favorite services, which can then be linked to websites by SDM. For this, SDM leverages semantic data, which is already available on millions of websites due to search engine optimization. Further support for our approach from website or service developers is not required. To enable the use of a broad range of services, data conversion services are automatically composed by SDM to transform data according to the needs of the different services. In addition to linking web services, various service adapters allow services of applications and smart devices to be linked as well. We have fully implemented our approach and present a real-world case study demonstrating its feasibility and usefulness."}],"date_created":"2018-11-26T11:52:59Z","type":"conference","department":[{"_id":"66"}],"year":"2018","title":"Semantic Data Mediator: Linking Services to Websites","author":[{"id":"11308","full_name":"Wolters, Dennis","first_name":"Dennis","last_name":"Wolters"},{"full_name":"Heindorf, Stefan","first_name":"Stefan","orcid":"0000-0002-4525-6865","last_name":"Heindorf","id":"11871"},{"id":"39928","full_name":"Kirchhoff, Jonas","last_name":"Kirchhoff","first_name":"Jonas"},{"id":"107","first_name":"Gregor","last_name":"Engels","full_name":"Engels, Gregor"}],"publication_identifier":{"isbn":["978-3-319-91764-1"]},"date_updated":"2022-10-15T20:00:17Z","main_file_link":[{"open_access":"1","url":"https://groups.uni-paderborn.de/fg-engels/publications_pdfs/Konferenzbeitraege/wolters2017_ICSOC_demo.pdf"}],"language":[{"iso":"eng"}],"doi":"10.1007/978-3-319-91764-1_36","citation":{"mla":"Wolters, Dennis, et al. “Semantic Data Mediator: Linking Services to Websites.” <i>Service-Oriented Computing -- ICSOC 2017 Workshops</i>, edited by Lars Braubach et al., Springer International Publishing, 2018, pp. 388–92, doi:<a href=\"https://doi.org/10.1007/978-3-319-91764-1_36\">10.1007/978-3-319-91764-1_36</a>.","bibtex":"@inproceedings{Wolters_Heindorf_Kirchhoff_Engels_2018, place={Cham}, title={Semantic Data Mediator: Linking Services to Websites}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-91764-1_36\">10.1007/978-3-319-91764-1_36</a>}, booktitle={Service-Oriented Computing -- ICSOC 2017 Workshops}, publisher={Springer International Publishing}, author={Wolters, Dennis and Heindorf, Stefan and Kirchhoff, Jonas and Engels, Gregor}, editor={Braubach, Lars and Murillo, Juan M. and Kaviani, Nima and Lama, Manuel and Burgueño, Loli and Moha, Naouel and Oriol, Marc}, year={2018}, pages={388–392} }","ama":"Wolters D, Heindorf S, Kirchhoff J, Engels G. Semantic Data Mediator: Linking Services to Websites. In: Braubach L, Murillo JM, Kaviani N, et al., eds. <i>Service-Oriented Computing -- ICSOC 2017 Workshops</i>. Springer International Publishing; 2018:388-392. doi:<a href=\"https://doi.org/10.1007/978-3-319-91764-1_36\">10.1007/978-3-319-91764-1_36</a>","ieee":"D. Wolters, S. Heindorf, J. Kirchhoff, and G. Engels, “Semantic Data Mediator: Linking Services to Websites,” in <i>Service-Oriented Computing -- ICSOC 2017 Workshops</i>, 2018, pp. 388–392, doi: <a href=\"https://doi.org/10.1007/978-3-319-91764-1_36\">10.1007/978-3-319-91764-1_36</a>.","apa":"Wolters, D., Heindorf, S., Kirchhoff, J., &#38; Engels, G. (2018). Semantic Data Mediator: Linking Services to Websites. In L. Braubach, J. M. Murillo, N. Kaviani, M. Lama, L. Burgueño, N. Moha, &#38; M. Oriol (Eds.), <i>Service-Oriented Computing -- ICSOC 2017 Workshops</i> (pp. 388–392). Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-91764-1_36\">https://doi.org/10.1007/978-3-319-91764-1_36</a>","short":"D. Wolters, S. Heindorf, J. Kirchhoff, G. Engels, in: L. Braubach, J.M. Murillo, N. Kaviani, M. Lama, L. Burgueño, N. Moha, M. Oriol (Eds.), Service-Oriented Computing -- ICSOC 2017 Workshops, Springer International Publishing, Cham, 2018, pp. 388–392.","chicago":"Wolters, Dennis, Stefan Heindorf, Jonas Kirchhoff, and Gregor Engels. “Semantic Data Mediator: Linking Services to Websites.” In <i>Service-Oriented Computing -- ICSOC 2017 Workshops</i>, edited by Lars Braubach, Juan M. Murillo, Nima Kaviani, Manuel Lama, Loli Burgueño, Naouel Moha, and Marc Oriol, 388–92. Cham: Springer International Publishing, 2018. <a href=\"https://doi.org/10.1007/978-3-319-91764-1_36\">https://doi.org/10.1007/978-3-319-91764-1_36</a>."},"place":"Cham","oa":"1","status":"public","page":"388-392","_id":"5831","publisher":"Springer International Publishing","user_id":"11871","editor":[{"full_name":"Braubach, Lars","first_name":"Lars","last_name":"Braubach"},{"full_name":"Murillo, Juan M.","first_name":"Juan M.","last_name":"Murillo"},{"first_name":"Nima","last_name":"Kaviani","full_name":"Kaviani, Nima"},{"last_name":"Lama","first_name":"Manuel","full_name":"Lama, Manuel"},{"full_name":"Burgueño, Loli","first_name":"Loli","last_name":"Burgueño"},{"last_name":"Moha","first_name":"Naouel","full_name":"Moha, Naouel"},{"last_name":"Oriol","first_name":"Marc","full_name":"Oriol, Marc"}]},{"author":[{"id":"33229","first_name":"Rieke","last_name":"Becker","full_name":"Becker, Rieke"},{"full_name":"Heidgen, Michael","last_name":"Heidgen","first_name":"Michael"},{"full_name":"Lauert, Markus","first_name":"Markus","last_name":"Lauert","id":"33619"},{"full_name":"Witschel, Verena","last_name":"Witschel","first_name":"Verena"}],"status":"public","year":"2018","title":"Tagungsbericht: Kulturen der Moral – Moral Cultures. Internationale und interdisziplinäre Tagung in Kooperation mit der DGEJ vom 19. bis 22. September 2018 an der Universität Paderborn.","publication_status":"published","date_updated":"2023-01-12T13:53:03Z","_id":"36411","language":[{"iso":"ger"}],"series_title":"H-Net","main_file_link":[{"url":"https://networks.h-net.org/node/79435/discussions/3144255/tagb-kulturen-der-moral-moral-cultures-19-220918-paderborn","open_access":"1"}],"user_id":"33229","citation":{"chicago":"Becker, Rieke, Michael Heidgen, Markus Lauert, and Verena Witschel. <i>Tagungsbericht: Kulturen der Moral – Moral Cultures. Internationale und interdisziplinäre Tagung in Kooperation mit der DGEJ vom 19. bis 22. September 2018 an der Universität Paderborn.</i> H-Net, 2018.","short":"R. Becker, M. Heidgen, M. Lauert, V. Witschel, Tagungsbericht: Kulturen der Moral – Moral Cultures. Internationale und interdisziplinäre Tagung in Kooperation mit der DGEJ vom 19. bis 22. September 2018 an der Universität Paderborn., 2018.","ieee":"R. Becker, M. Heidgen, M. Lauert, and V. Witschel, <i>Tagungsbericht: Kulturen der Moral – Moral Cultures. Internationale und interdisziplinäre Tagung in Kooperation mit der DGEJ vom 19. bis 22. September 2018 an der Universität Paderborn.</i> 2018.","apa":"Becker, R., Heidgen, M., Lauert, M., &#38; Witschel, V. (2018). <i>Tagungsbericht: Kulturen der Moral – Moral Cultures. Internationale und interdisziplinäre Tagung in Kooperation mit der DGEJ vom 19. bis 22. September 2018 an der Universität Paderborn.</i>","bibtex":"@book{Becker_Heidgen_Lauert_Witschel_2018, series={H-Net}, title={Tagungsbericht: Kulturen der Moral – Moral Cultures. Internationale und interdisziplinäre Tagung in Kooperation mit der DGEJ vom 19. bis 22. September 2018 an der Universität Paderborn.}, author={Becker, Rieke and Heidgen, Michael and Lauert, Markus and Witschel, Verena}, year={2018}, collection={H-Net} }","ama":"Becker R, Heidgen M, Lauert M, Witschel V. <i>Tagungsbericht: Kulturen der Moral – Moral Cultures. Internationale und interdisziplinäre Tagung in Kooperation mit der DGEJ vom 19. bis 22. September 2018 an der Universität Paderborn.</i>; 2018.","mla":"Becker, Rieke, et al. <i>Tagungsbericht: Kulturen der Moral – Moral Cultures. Internationale und interdisziplinäre Tagung in Kooperation mit der DGEJ vom 19. bis 22. September 2018 an der Universität Paderborn.</i> 2018."},"date_created":"2023-01-12T11:42:01Z","department":[{"_id":"446"}],"oa":"1","type":"report"},{"citation":{"bibtex":"@inproceedings{van Engelen_van Lier_Takes_Trautmann_2018, place={Dublin, Ireland}, title={Accurate WiFi based indoor positioning with continuous location sampling}, booktitle={Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Database (ECML/PKDD)}, publisher={Springer}, author={van Engelen, J.E. and van Lier, J.J. and Takes, F.W. and Trautmann, Heike}, year={2018}, pages={524–540} }","ama":"van Engelen JE, van Lier JJ, Takes FW, Trautmann H. Accurate WiFi based indoor positioning with continuous location sampling. In: <i>Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Database (ECML/PKDD)</i>. Springer; 2018:524–540.","mla":"van Engelen, J. E., et al. “Accurate WiFi Based Indoor Positioning with Continuous Location Sampling.” <i>Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Database (ECML/PKDD)</i>, Springer, 2018, pp. 524–540.","short":"J.E. van Engelen, J.J. van Lier, F.W. Takes, H. Trautmann, in: Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Database (ECML/PKDD), Springer, Dublin, Ireland, 2018, pp. 524–540.","chicago":"Engelen, J.E. van, J.J. van Lier, F.W. Takes, and Heike Trautmann. “Accurate WiFi Based Indoor Positioning with Continuous Location Sampling.” In <i>Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Database (ECML/PKDD)</i>, 524–540. Dublin, Ireland: Springer, 2018.","ieee":"J. E. van Engelen, J. J. van Lier, F. W. Takes, and H. Trautmann, “Accurate WiFi based indoor positioning with continuous location sampling,” in <i>Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Database (ECML/PKDD)</i>, 2018, pp. 524–540.","apa":"van Engelen, J. E., van Lier, J. J., Takes, F. W., &#38; Trautmann, H. (2018). Accurate WiFi based indoor positioning with continuous location sampling. <i>Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Database (ECML/PKDD)</i>, 524–540."},"publication":"Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Database (ECML/PKDD)","abstract":[{"lang":"eng","text":"The ubiquity of WiFi access points and the sharp increase in WiFi-enabled devices carried by humans have paved the way for WiFi-based indoor positioning and location analysis. Locating people in indoor environments has numerous applications in robotics, crowd control, indoor facility optimization, and automated environment mapping. However, existing WiFi-based positioning systems suffer from two major problems: (1) their accuracy and precision is limited due to inherent noise induced by indoor obstacles, and (2) they only occasionally provide location estimates, namely when a WiFi-equipped device emits a signal. To mitigate these two issues, we propose a novel Gaussian process (GP) model for WiFi signal strength measurements. It allows for simultaneous smoothing (increasing accuracy and precision of estimators) and interpolation (enabling continuous sampling of location estimates). Furthermore, simple and efficient smoothing methods for location estimates are introduced to improve localization performance in real-time settings. Experiments are conducted on two data sets from a large real-world commercial indoor retail environment. Results demonstrate that our approach provides significant improvements in terms of precision and accuracy with respect to unfiltered data. Ultimately, the GP model realizes continuous location sampling with consistently high quality location estimates."}],"date_created":"2023-08-04T07:54:43Z","place":"Dublin, Ireland","department":[{"_id":"34"},{"_id":"819"}],"type":"conference","author":[{"full_name":"van Engelen, J.E.","first_name":"J.E.","last_name":"van Engelen"},{"full_name":"van Lier, J.J.","last_name":"van Lier","first_name":"J.J."},{"last_name":"Takes","first_name":"F.W.","full_name":"Takes, F.W."},{"id":"100740","full_name":"Trautmann, Heike","first_name":"Heike","orcid":"0000-0002-9788-8282","last_name":"Trautmann"}],"status":"public","year":"2018","title":"Accurate WiFi based indoor positioning with continuous location sampling","date_updated":"2023-10-16T13:33:18Z","publisher":"Springer","_id":"46350","language":[{"iso":"eng"}],"page":"524–540","user_id":"15504"}]