[{"project":[{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"_id":"16","name":"SFB 901 - C4: SFB 901 - Subproject C4"},{"name":"SFB 901: SFB 901","_id":"1"}],"abstract":[{"lang":"eng","text":"Macrodiversity is a key technique to increase the capacity of mobile networks. It can be realized using coordinated multipoint (CoMP), simultaneously connecting users to multiple overlapping cells. Selecting which users to serve by how many and which cells is NP-hard but needs to happen continuously in real time as users move and channel state changes. Existing approaches often require strict assumptions about or perfect knowledge of the underlying radio system, its resource allocation scheme, or user movements, none of which is readily available in practice.\r\n\r\nInstead, we propose three novel self-learning and self-adapting approaches using model-free deep reinforcement learning (DRL): DeepCoMP, DD-CoMP, and D3-CoMP. DeepCoMP leverages central observations and control of all users to select cells almost optimally. DD-CoMP and D3-CoMP use multi-agent DRL, which allows distributed, robust, and highly scalable coordination. All three approaches learn from experience and self-adapt to varying scenarios, reaching 2x higher Quality of Experience than other approaches. They have very few built-in assumptions and do not need prior system knowledge, making them more robust to change and better applicable in practice than existing approaches."}],"citation":{"short":"S.B. Schneider, H. Karl, R. Khalili, A. Hecker, DeepCoMP: Coordinated Multipoint Using Multi-Agent Deep Reinforcement Learning, 2021.","chicago":"Schneider, Stefan Balthasar, Holger Karl, Ramin Khalili, and Artur Hecker. <i>DeepCoMP: Coordinated Multipoint Using Multi-Agent Deep Reinforcement Learning</i>, 2021.","ieee":"S. B. Schneider, H. Karl, R. Khalili, and A. Hecker, <i>DeepCoMP: Coordinated Multipoint Using Multi-Agent Deep Reinforcement Learning</i>. 2021.","apa":"Schneider, S. B., Karl, H., Khalili, R., &#38; Hecker, A. (2021). <i>DeepCoMP: Coordinated Multipoint Using Multi-Agent Deep Reinforcement Learning</i>.","bibtex":"@book{Schneider_Karl_Khalili_Hecker_2021, title={DeepCoMP: Coordinated Multipoint Using Multi-Agent Deep Reinforcement Learning}, author={Schneider, Stefan Balthasar and Karl, Holger and Khalili, Ramin and Hecker, Artur}, year={2021} }","ama":"Schneider SB, Karl H, Khalili R, Hecker A. <i>DeepCoMP: Coordinated Multipoint Using Multi-Agent Deep Reinforcement Learning</i>.; 2021.","mla":"Schneider, Stefan Balthasar, et al. <i>DeepCoMP: Coordinated Multipoint Using Multi-Agent Deep Reinforcement Learning</i>. 2021."},"file_date_updated":"2022-10-20T16:41:10Z","department":[{"_id":"75"}],"oa":"1","keyword":["mobility management","coordinated multipoint","CoMP","cell selection","resource management","reinforcement learning","multi agent","MARL","self-learning","self-adaptation","QoE"],"type":"working_paper","date_created":"2022-10-20T16:44:19Z","file":[{"file_id":"33855","content_type":"application/pdf","relation":"main_file","date_updated":"2022-10-20T16:41:10Z","file_name":"preprint.pdf","file_size":2521656,"access_level":"open_access","date_created":"2022-10-20T16:41:10Z","creator":"stschn"}],"has_accepted_license":"1","date_updated":"2022-11-18T09:59:27Z","author":[{"id":"35343","first_name":"Stefan Balthasar","last_name":"Schneider","orcid":"0000-0001-8210-4011","full_name":"Schneider, Stefan Balthasar"},{"last_name":"Karl","first_name":"Holger","full_name":"Karl, Holger","id":"126"},{"first_name":"Ramin","last_name":"Khalili","full_name":"Khalili, Ramin"},{"full_name":"Hecker, Artur","last_name":"Hecker","first_name":"Artur"}],"title":"DeepCoMP: Coordinated Multipoint Using Multi-Agent Deep Reinforcement Learning","status":"public","year":"2021","user_id":"477","ddc":["004"],"language":[{"iso":"eng"}],"_id":"33854"},{"publication_status":"published","date_updated":"2022-11-03T11:42:46Z","article_type":"original","intvolume":"         9","title":"A Multi-Model-Particle Filtering-Based Prognostic Approach to Consider Uncertainties in RUL Predictions","year":"2021","author":[{"id":"54290","last_name":"Bender","first_name":"Amelie","full_name":"Bender, Amelie"}],"publication_identifier":{"issn":["2075-1702"]},"doi":"10.3390/machines9100210","article_number":"210","main_file_link":[{"open_access":"1","url":"https://www.mdpi.com/2075-1702/9/10/210"}],"language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"<jats:p>While increasing digitalization enables multiple advantages for a reliable operation of technical systems, a remaining challenge in the context of condition monitoring is seen in suitable consideration of uncertainties affecting the monitored system. Therefore, a suitable prognostic approach to predict the remaining useful lifetime of complex technical systems is required. To handle different kinds of uncertainties, a novel Multi-Model-Particle Filtering-based prognostic approach is developed and evaluated by the use case of rubber-metal-elements. These elements are maintained preventively due to the strong influence of uncertainties on their behavior. In this paper, two measurement quantities are compared concerning their ability to establish a prediction of the remaining useful lifetime of the monitored elements and the influence of present uncertainties. Based on three performance indices, the results are evaluated. A comparison with predictions of a classical Particle Filter underlines the superiority of the developed Multi-Model-Particle Filter. Finally, the value of the developed method for enabling condition monitoring of technical systems related to uncertainties is given exemplary by a comparison between the preventive and the predictive maintenance strategy for the use case.</jats:p>"}],"publication":"Machines","issue":"10","type":"journal_article","keyword":["prognostics","RUL predictions","particle filter","uncertainty consideration","Multi-Model-Particle Filter","model-based approach","rubber-metal-elements","predictive maintenance"],"department":[{"_id":"151"}],"date_created":"2021-09-27T07:07:58Z","status":"public","user_id":"54290","volume":9,"_id":"25046","quality_controlled":"1","citation":{"ieee":"A. Bender, “A Multi-Model-Particle Filtering-Based Prognostic Approach to Consider Uncertainties in RUL Predictions,” <i>Machines</i>, vol. 9, no. 10, Art. no. 210, 2021, doi: <a href=\"https://doi.org/10.3390/machines9100210\">10.3390/machines9100210</a>.","apa":"Bender, A. (2021). A Multi-Model-Particle Filtering-Based Prognostic Approach to Consider Uncertainties in RUL Predictions. <i>Machines</i>, <i>9</i>(10), Article 210. <a href=\"https://doi.org/10.3390/machines9100210\">https://doi.org/10.3390/machines9100210</a>","mla":"Bender, Amelie. “A Multi-Model-Particle Filtering-Based Prognostic Approach to Consider Uncertainties in RUL Predictions.” <i>Machines</i>, vol. 9, no. 10, 210, 2021, doi:<a href=\"https://doi.org/10.3390/machines9100210\">10.3390/machines9100210</a>.","bibtex":"@article{Bender_2021, title={A Multi-Model-Particle Filtering-Based Prognostic Approach to Consider Uncertainties in RUL Predictions}, volume={9}, DOI={<a href=\"https://doi.org/10.3390/machines9100210\">10.3390/machines9100210</a>}, number={10210}, journal={Machines}, author={Bender, Amelie}, year={2021} }","chicago":"Bender, Amelie. “A Multi-Model-Particle Filtering-Based Prognostic Approach to Consider Uncertainties in RUL Predictions.” <i>Machines</i> 9, no. 10 (2021). <a href=\"https://doi.org/10.3390/machines9100210\">https://doi.org/10.3390/machines9100210</a>.","ama":"Bender A. A Multi-Model-Particle Filtering-Based Prognostic Approach to Consider Uncertainties in RUL Predictions. <i>Machines</i>. 2021;9(10). doi:<a href=\"https://doi.org/10.3390/machines9100210\">10.3390/machines9100210</a>","short":"A. Bender, Machines 9 (2021)."},"oa":"1"},{"keyword":["Multimodal optimization","Multi-objective continuous optimization","Landscape analysis","Visualization","Benchmarking","Theory","Algorithms"],"type":"journal_article","department":[{"_id":"34"},{"_id":"819"}],"date_created":"2023-08-04T07:28:34Z","abstract":[{"lang":"eng","text":"Multi-objective (MO) optimization, i.e., the simultaneous optimization of multiple conflicting objectives, is gaining more and more attention in various research areas, such as evolutionary computation, machine learning (e.g., (hyper-)parameter optimization), or logistics (e.g., vehicle routing). Many works in this domain mention the structural problem property of multimodality as a challenge from two classical perspectives: (1) finding all globally optimal solution sets, and (2) avoiding to get trapped in local optima. Interestingly, these streams seem to transfer many traditional concepts of single-objective (SO) optimization into claims, assumptions, or even terminology regarding the MO domain, but mostly neglect the understanding of the structural properties as well as the algorithmic search behavior on a problem’s landscape. However, some recent works counteract this trend, by investigating the fundamentals and characteristics of MO problems using new visualization techniques and gaining surprising insights. Using these visual insights, this work proposes a step towards a unified terminology to capture multimodality and locality in a broader way than it is usually done. This enables us to investigate current research activities in multimodal continuous MO optimization and to highlight new implications and promising research directions for the design of benchmark suites, the discovery of MO landscape features, the development of new MO (or even SO) optimization algorithms, and performance indicators. For all these topics, we provide a review of ideas and methods but also an outlook on future challenges, research potential and perspectives that result from recent developments."}],"publication":"Computers & Operations Research","citation":{"mla":"Grimme, Christian, et al. “Peeking beyond Peaks: Challenges and Research Potentials of Continuous Multimodal Multi-Objective Optimization.” <i>Computers &#38; Operations Research</i>, vol. 136, 2021, p. 105489, doi:<a href=\"https://doi.org/10.1016/j.cor.2021.105489\">https://doi.org/10.1016/j.cor.2021.105489</a>.","ama":"Grimme C, Kerschke P, Aspar P, et al. Peeking beyond peaks: Challenges and research potentials of continuous multimodal multi-objective optimization. <i>Computers &#38; Operations Research</i>. 2021;136:105489. doi:<a href=\"https://doi.org/10.1016/j.cor.2021.105489\">https://doi.org/10.1016/j.cor.2021.105489</a>","bibtex":"@article{Grimme_Kerschke_Aspar_Trautmann_Preuss_Deutz_Wang_Emmerich_2021, title={Peeking beyond peaks: Challenges and research potentials of continuous multimodal multi-objective optimization}, volume={136}, DOI={<a href=\"https://doi.org/10.1016/j.cor.2021.105489\">https://doi.org/10.1016/j.cor.2021.105489</a>}, journal={Computers &#38; Operations Research}, author={Grimme, Christian and Kerschke, Pascal and Aspar, Pelin and Trautmann, Heike and Preuss, Mike and Deutz, André H. and Wang, Hao and Emmerich, Michael}, year={2021}, pages={105489} }","apa":"Grimme, C., Kerschke, P., Aspar, P., Trautmann, H., Preuss, M., Deutz, A. H., Wang, H., &#38; Emmerich, M. (2021). Peeking beyond peaks: Challenges and research potentials of continuous multimodal multi-objective optimization. <i>Computers &#38; Operations Research</i>, <i>136</i>, 105489. <a href=\"https://doi.org/10.1016/j.cor.2021.105489\">https://doi.org/10.1016/j.cor.2021.105489</a>","ieee":"C. Grimme <i>et al.</i>, “Peeking beyond peaks: Challenges and research potentials of continuous multimodal multi-objective optimization,” <i>Computers &#38; Operations Research</i>, vol. 136, p. 105489, 2021, doi: <a href=\"https://doi.org/10.1016/j.cor.2021.105489\">https://doi.org/10.1016/j.cor.2021.105489</a>.","chicago":"Grimme, Christian, Pascal Kerschke, Pelin Aspar, Heike Trautmann, Mike Preuss, André H. Deutz, Hao Wang, and Michael Emmerich. “Peeking beyond Peaks: Challenges and Research Potentials of Continuous Multimodal Multi-Objective Optimization.” <i>Computers &#38; Operations Research</i> 136 (2021): 105489. <a href=\"https://doi.org/10.1016/j.cor.2021.105489\">https://doi.org/10.1016/j.cor.2021.105489</a>.","short":"C. Grimme, P. Kerschke, P. Aspar, H. Trautmann, M. Preuss, A.H. Deutz, H. Wang, M. Emmerich, Computers &#38; Operations Research 136 (2021) 105489."},"user_id":"15504","doi":"https://doi.org/10.1016/j.cor.2021.105489","volume":136,"page":"105489","language":[{"iso":"eng"}],"_id":"46318","date_updated":"2023-10-16T12:58:42Z","intvolume":"       136","status":"public","title":"Peeking beyond peaks: Challenges and research potentials of continuous multimodal multi-objective optimization","year":"2021","author":[{"full_name":"Grimme, Christian","first_name":"Christian","last_name":"Grimme"},{"first_name":"Pascal","last_name":"Kerschke","full_name":"Kerschke, Pascal"},{"last_name":"Aspar","first_name":"Pelin","full_name":"Aspar, Pelin"},{"first_name":"Heike","orcid":"0000-0002-9788-8282","last_name":"Trautmann","full_name":"Trautmann, Heike","id":"100740"},{"full_name":"Preuss, Mike","last_name":"Preuss","first_name":"Mike"},{"last_name":"Deutz","first_name":"André H.","full_name":"Deutz, André H."},{"last_name":"Wang","first_name":"Hao","full_name":"Wang, Hao"},{"full_name":"Emmerich, Michael","last_name":"Emmerich","first_name":"Michael"}],"publication_identifier":{"issn":["0305-0548"]}},{"language":[{"iso":"eng"}],"doi":"10.1108/JOSM-03-2020-0066","year":"2021","title":"Transforming into a Platform Provider: Strategic Options for Industrial Smart Service Providers","author":[{"id":"59677","full_name":"Beverungen, Daniel","last_name":"Beverungen","first_name":"Daniel"},{"id":"21117","last_name":"Kundisch","first_name":"Dennis","full_name":"Kundisch, Dennis"},{"id":"36392","last_name":"Wünderlich","first_name":"Nancy","full_name":"Wünderlich, Nancy"}],"publication_identifier":{"issn":["507-532"]},"date_updated":"2024-04-18T12:46:37Z","publication_status":"published","intvolume":"        32","article_type":"original","date_created":"2020-08-12T12:12:36Z","type":"journal_article","keyword":["Smart service","Platform","Interdisciplinary research","Manufacturing company","Smart service provider","Platform economics","Information systems","Multi-sided markets","Business-to-business (B2B) markets"],"department":[{"_id":"276"},{"_id":"181"}],"publication":"Journal of Service Management","issue":"4","abstract":[{"text":"Purpose\r\nThe purpose of this paper is to identify strategic options and challenges that arise when an industrial firm moves from providing smart service toward providing a platform.\r\n\r\nDesign/methodology/approach\r\nThis conceptual study takes on a multidisciplinary research perspective that integrates concepts, theories and insights from service management and marketing, information systems and platform economics.\r\n\r\nFindings\r\nThe paper outlines three platform types – smart data platform, smart product platform and matching platform – as strategic options for firms that wish to evolve from smart service providers to platform providers.\r\n\r\nResearch limitations/implications\r\nInvestigating smart service platforms calls for launching interdisciplinary research initiatives. Promising research avenues are outlined to span boundaries that separate different research disciplines today.\r\n\r\nPractical implications\r\nManaging a successful transition from providing smart service toward providing a platform requires making significant investments in IT, platform-related capabilities and skills, as well as implement new approaches toward relationship management and brand-building.\r\n\r\nOriginality/value\r\nThe findings described in this paper are valuable to researchers in multiple disciplines seeking to develop and to justify theory related to platforms in industrial scenarios.","lang":"eng"}],"page":"507-532","publisher":"Emerald Insight","_id":"17860","ddc":["380"],"user_id":"59677","volume":32,"status":"public","citation":{"chicago":"Beverungen, Daniel, Dennis Kundisch, and Nancy Wünderlich. “Transforming into a Platform Provider: Strategic Options for Industrial Smart Service Providers.” <i>Journal of Service Management</i> 32, no. 4 (2021): 507–32. <a href=\"https://doi.org/10.1108/JOSM-03-2020-0066\">https://doi.org/10.1108/JOSM-03-2020-0066</a>.","ama":"Beverungen D, Kundisch D, Wünderlich N. Transforming into a Platform Provider: Strategic Options for Industrial Smart Service Providers. <i>Journal of Service Management</i>. 2021;32(4):507-532. doi:<a href=\"https://doi.org/10.1108/JOSM-03-2020-0066\">10.1108/JOSM-03-2020-0066</a>","short":"D. Beverungen, D. Kundisch, N. Wünderlich, Journal of Service Management 32 (2021) 507–532.","bibtex":"@article{Beverungen_Kundisch_Wünderlich_2021, title={Transforming into a Platform Provider: Strategic Options for Industrial Smart Service Providers}, volume={32}, DOI={<a href=\"https://doi.org/10.1108/JOSM-03-2020-0066\">10.1108/JOSM-03-2020-0066</a>}, number={4}, journal={Journal of Service Management}, publisher={Emerald Insight}, author={Beverungen, Daniel and Kundisch, Dennis and Wünderlich, Nancy}, year={2021}, pages={507–532} }","mla":"Beverungen, Daniel, et al. “Transforming into a Platform Provider: Strategic Options for Industrial Smart Service Providers.” <i>Journal of Service Management</i>, vol. 32, no. 4, Emerald Insight, 2021, pp. 507–32, doi:<a href=\"https://doi.org/10.1108/JOSM-03-2020-0066\">10.1108/JOSM-03-2020-0066</a>.","apa":"Beverungen, D., Kundisch, D., &#38; Wünderlich, N. (2021). Transforming into a Platform Provider: Strategic Options for Industrial Smart Service Providers. <i>Journal of Service Management</i>, <i>32</i>(4), 507–532. <a href=\"https://doi.org/10.1108/JOSM-03-2020-0066\">https://doi.org/10.1108/JOSM-03-2020-0066</a>","ieee":"D. Beverungen, D. Kundisch, and N. Wünderlich, “Transforming into a Platform Provider: Strategic Options for Industrial Smart Service Providers,” <i>Journal of Service Management</i>, vol. 32, no. 4, pp. 507–532, 2021, doi: <a href=\"https://doi.org/10.1108/JOSM-03-2020-0066\">10.1108/JOSM-03-2020-0066</a>."},"quality_controlled":"1","project":[{"name":"SFB 901","_id":"1","grant_number":"160364472"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"17","name":"SFB 901 - Subproject C5"}]},{"quality_controlled":"1","citation":{"ieee":"A. Bender and W. Sextro, “Hybrid Prediction Method for Remaining Useful Lifetime Estimation Considering Uncertainties,” in <i>Proceedings of the European Conference of the PHM Society 2021</i>, 2021, vol. 6, no. 1, doi: <a href=\"https://doi.org/10.36001/phme.2021.v6i1.2843 \">https://doi.org/10.36001/phme.2021.v6i1.2843 </a>.","apa":"Bender, A., &#38; Sextro, W. (2021). Hybrid Prediction Method for Remaining Useful Lifetime Estimation Considering Uncertainties. In P. Do, S. King, &#38;  Olga Fink (Eds.), <i>Proceedings of the European Conference of the PHM Society 2021</i> (Vol. 6, Issue 1). <a href=\"https://doi.org/10.36001/phme.2021.v6i1.2843 \">https://doi.org/10.36001/phme.2021.v6i1.2843 </a>","chicago":"Bender, Amelie, and Walter Sextro. “Hybrid Prediction Method for Remaining Useful Lifetime Estimation Considering Uncertainties.” In <i>Proceedings of the European Conference of the PHM Society 2021</i>, edited by Phuc  Do, Steve King, and  Olga Fink, Vol. 6, 2021. <a href=\"https://doi.org/10.36001/phme.2021.v6i1.2843 \">https://doi.org/10.36001/phme.2021.v6i1.2843 </a>.","short":"A. Bender, W. Sextro, in: P. Do, S. King,  Olga Fink (Eds.), Proceedings of the European Conference of the PHM Society 2021, 2021.","mla":"Bender, Amelie, and Walter Sextro. “Hybrid Prediction Method for Remaining Useful Lifetime Estimation Considering Uncertainties.” <i>Proceedings of the European Conference of the PHM Society 2021</i>, edited by Phuc  Do et al., vol. 6, no. 1, 2021, doi:<a href=\"https://doi.org/10.36001/phme.2021.v6i1.2843 \">https://doi.org/10.36001/phme.2021.v6i1.2843 </a>.","bibtex":"@inproceedings{Bender_Sextro_2021, title={Hybrid Prediction Method for Remaining Useful Lifetime Estimation Considering Uncertainties}, volume={6}, DOI={<a href=\"https://doi.org/10.36001/phme.2021.v6i1.2843 \">https://doi.org/10.36001/phme.2021.v6i1.2843 </a>}, number={1}, booktitle={Proceedings of the European Conference of the PHM Society 2021}, author={Bender, Amelie and Sextro, Walter}, editor={Do, Phuc  and King, Steve and Fink,  Olga}, year={2021} }","ama":"Bender A, Sextro W. Hybrid Prediction Method for Remaining Useful Lifetime Estimation Considering Uncertainties. In: Do P, King S, Fink  Olga, eds. <i>Proceedings of the European Conference of the PHM Society 2021</i>. Vol 6. ; 2021. doi:<a href=\"https://doi.org/10.36001/phme.2021.v6i1.2843 \">https://doi.org/10.36001/phme.2021.v6i1.2843 </a>"},"oa":"1","conference":{"name":"6th European Conference of Prognostics and Health Management","start_date":"2021-06-28","end_date":"2021-07-02"},"status":"public","editor":[{"last_name":"Do","first_name":"Phuc ","full_name":"Do, Phuc "},{"first_name":"Steve","last_name":"King","full_name":"King, Steve"},{"last_name":"Fink","first_name":" Olga","full_name":"Fink,  Olga"}],"volume":6,"user_id":"54290","_id":"22724","abstract":[{"text":"\r\nPredictive Maintenance as a desirable maintenance strategy in industrial applications relies on suitable condition monitoring solutions to reduce costs and risks of the monitored technical systems. In general, those solutions utilize model-based or data-driven methods to diagnose the current state or predict future states of monitored technical systems. However, both methods have their advantages and drawbacks. Combining both methods can improve uncertainty consideration and accuracy. Different combination approaches of those hybrid methods exist to exploit synergy effects. The choice of an appropriate approach depends on different requirements and the goal behind the selection of a hybrid approach.\r\n\r\n \r\n\r\nIn this work, the hybrid approach for estimating remaining useful lifetime takes potential uncertainties into account. Therefore, a data-driven estimation of new measurements is integrated within a model-based method. To consider uncertainties within the system, a differentiation between different system behavior is realized throughout diverse states of degradation.\r\n\r\nThe developed hybrid prediction approach bases on a particle filtering method combined with a machine learning method, to estimate the remaining useful lifetime of technical systems. Particle filtering as a Monte Carlo simulation technique is suitable to map and propagate uncertainties. Moreover, it is a state-of-the-art model-based method for predicting remaining useful lifetime of technical systems. To integrate uncertainties a multi-model particle filtering approach is employed. In general, resampling as a part of the particle filtering approach has the potential to lead to an accurate prediction. However, in the case where no future measurements are available, it may increase the uncertainty of the prediction. By estimating new measurements, those uncertainties are reduced within the data-driven part of the approach. Hence, both parts of the hybrid approach strive to account for and reduce uncertainties.\r\n\r\n \r\n\r\nRubber-metal-elements are employed as a use-case to evaluate the developed approach. Rubber-metal-elements, which are used to isolate vibrations in various systems, such as railways, trucks and wind turbines, show various uncertainties in their behavior and their degradation. Those uncertainties are caused by diverse inner and outer factors, such as manufacturing influences and operating conditions. By expert knowledge the influences are described, analyzed and if possible reduced. However, the remaining uncertainties are considered within the hybrid prediction method. Relative temperature is the selected measurand to describe the element’s degradation. In lifetime tests, it is measured as the difference between the element’s temperature and the ambient temperature. Thereby, the influence of the ambient temperature on the element’s temperature is taken into account. Those elements show three typical states of degradation that are identified within the temperature measurements. Depending on the particular state of degradation a new measurement is estimated within the hybrid approach to reduce potential uncertainties.\r\n\r\nFinally, the performance of the developed hybrid method is compared to a model-based method for estimating the remaining useful lifetime of the same elements. Suitable performance indices are implemented to underline the differences between the results.","lang":"eng"}],"issue":"1","publication":"Proceedings of the European Conference of the PHM Society 2021","department":[{"_id":"151"}],"keyword":["Hybrid prediction method","Multi-model particle filtering","Uncertainty quantification","RUL estimation"],"type":"conference","date_created":"2021-07-14T06:29:08Z","intvolume":"         6","date_updated":"2023-09-22T07:19:48Z","publication_status":"published","publication_identifier":{"unknown":["978-1-936263-34-9"]},"author":[{"full_name":"Bender, Amelie","first_name":"Amelie","last_name":"Bender","id":"54290"},{"full_name":"Sextro, Walter","first_name":"Walter","last_name":"Sextro","id":"21220"}],"year":"2021","title":"Hybrid Prediction Method for Remaining Useful Lifetime Estimation Considering Uncertainties","doi":"https://doi.org/10.36001/phme.2021.v6i1.2843 ","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://papers.phmsociety.org/index.php/phme/article/view/2843"}]},{"status":"public","has_accepted_license":"1","_id":"17370","ddc":["000"],"user_id":"39241","file_date_updated":"2020-07-14T07:56:52Z","citation":{"mla":"Castenow, Jannik, et al. “The Online Multi-Commodity Facility Location Problem.” <i>Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures</i>, 2020, doi:<a href=\"https://doi.org/10.1145/3350755.3400281\">10.1145/3350755.3400281</a>.","ama":"Castenow J, Feldkord B, Knollmann T, Malatyali M, Meyer auf der Heide F. The Online Multi-Commodity Facility Location Problem. In: <i>Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures</i>. ; 2020. doi:<a href=\"https://doi.org/10.1145/3350755.3400281\">10.1145/3350755.3400281</a>","bibtex":"@inproceedings{Castenow_Feldkord_Knollmann_Malatyali_Meyer auf der Heide_2020, title={The Online Multi-Commodity Facility Location Problem}, DOI={<a href=\"https://doi.org/10.1145/3350755.3400281\">10.1145/3350755.3400281</a>}, booktitle={Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures}, author={Castenow, Jannik and Feldkord, Björn and Knollmann, Till and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}, year={2020} }","apa":"Castenow, J., Feldkord, B., Knollmann, T., Malatyali, M., &#38; Meyer auf der Heide, F. (2020). The Online Multi-Commodity Facility Location Problem. In <i>Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures</i>. <a href=\"https://doi.org/10.1145/3350755.3400281\">https://doi.org/10.1145/3350755.3400281</a>","ieee":"J. Castenow, B. Feldkord, T. Knollmann, M. Malatyali, and F. Meyer auf der Heide, “The Online Multi-Commodity Facility Location Problem,” in <i>Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures</i>, 2020.","chicago":"Castenow, Jannik, Björn Feldkord, Till Knollmann, Manuel Malatyali, and Friedhelm Meyer auf der Heide. “The Online Multi-Commodity Facility Location Problem.” In <i>Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures</i>, 2020. <a href=\"https://doi.org/10.1145/3350755.3400281\">https://doi.org/10.1145/3350755.3400281</a>.","short":"J. Castenow, B. Feldkord, T. Knollmann, M. Malatyali, F. Meyer auf der Heide, in: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020."},"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"external_id":{"arxiv":["2005.08391"]},"year":"2020","title":"The Online Multi-Commodity Facility Location Problem","publication_identifier":{"isbn":["9781450369350"]},"author":[{"full_name":"Castenow, Jannik","first_name":"Jannik","last_name":"Castenow","id":"38705"},{"id":"22704","first_name":"Björn","last_name":"Feldkord","full_name":"Feldkord, Björn"},{"last_name":"Knollmann","first_name":"Till","orcid":"0000-0003-2014-4696","full_name":"Knollmann, Till","id":"39241"},{"full_name":"Malatyali, Manuel","first_name":"Manuel","last_name":"Malatyali"},{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm","id":"15523"}],"date_updated":"2022-01-06T06:53:10Z","publication_status":"published","language":[{"iso":"eng"}],"doi":"10.1145/3350755.3400281","publication":"Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures","abstract":[{"lang":"eng","text":" We consider a natural extension to the metric uncapacitated Facility Location Problem (FLP) in which requests ask for different commodities out of a finite set \\( S \\) of commodities.\r\n  Ravi and Sinha (SODA 2004) introduced the model as the \\emph{Multi-Commodity Facility Location Problem} (MFLP) and considered it an offline optimization problem.\r\n  The model itself is similar to the FLP: i.e., requests are located at points of a finite metric space and the task of an algorithm is to construct facilities and assign requests to facilities while minimizing the construction cost and the sum over all assignment distances.\r\n  In addition, requests and facilities are heterogeneous; they request or offer multiple commodities out of $S$.\r\n  A request has to be connected to a set of facilities jointly offering the commodities demanded by it.\r\n  In comparison to the FLP, an algorithm has to decide not only if and where to place facilities, but also which commodities to offer at each.\r\n\r\n  To the best of our knowledge we are the first to study the problem in its online variant in which requests, their positions and their commodities are not known beforehand but revealed over time.\r\n  We present results regarding the competitive ratio.\r\n  On the one hand, we show that heterogeneity influences the competitive ratio by developing a lower bound on the competitive ratio for any randomized online algorithm of \\( \\Omega (  \\sqrt{|S|} + \\frac{\\log n}{\\log \\log n}  ) \\) that already holds for simple line metrics.\r\n  Here, \\( n \\) is the number of requests.\r\n  On the other side, we establish a deterministic \\( \\mathcal{O}(\\sqrt{|S|} \\cdot \\log n) \\)-competitive algorithm and a randomized \\( \\mathcal{O}(\\sqrt{|S|} \\cdot \\frac{\\log n}{\\log \\log n} ) \\)-competitive algorithm.\r\n  Further, we show that when considering a more special class of cost functions for the construction cost of a facility, the competitive ratio decreases given by our deterministic algorithm depending on the function."}],"file":[{"file_size":1271416,"access_level":"closed","file_name":"3350755.3400281.pdf","date_updated":"2020-07-14T07:56:52Z","relation":"main_file","success":1,"content_type":"application/pdf","file_id":"17373","creator":"tillk","date_created":"2020-07-14T07:56:52Z"}],"date_created":"2020-07-14T07:53:20Z","keyword":["Online Multi-Commodity Facility Location","Competitive Ratio","Online Optimization","Facility Location Problem"],"type":"conference","department":[{"_id":"63"}]},{"user_id":"60845","language":[{"iso":"eng"}],"_id":"16218","publication_status":"accepted","date_updated":"2022-01-06T06:52:45Z","author":[{"full_name":"Camps-Mur, Daniel","first_name":"Daniel","last_name":"Camps-Mur"},{"full_name":" Canellas, Ferran","first_name":"Ferran","last_name":" Canellas"},{"last_name":"Machwe","first_name":"Azahar","full_name":"Machwe, Azahar"},{"full_name":"Paracuellos, Jorge","first_name":"Jorge","last_name":"Paracuellos"},{"full_name":"Choumas, Kostas","first_name":"Kostas","last_name":"Choumas"},{"full_name":"Giatsios, Dimitris","first_name":"Dimitris","last_name":"Giatsios"},{"last_name":"Korakis","first_name":"Thanasis","full_name":"Korakis, Thanasis"},{"last_name":"Razzaghi Kouchaksaraei","first_name":"Hadi","full_name":"Razzaghi Kouchaksaraei, Hadi","id":"60845"}],"conference":{"end_date":"2020-07-3","name":"IEEE Conference on Network Softwarization (NetSoft)","start_date":"2020-06-29","location":"Ghent, Belgium"},"year":"2020","title":"5GOS: Demonstrating multi-domain orchestration of end-to-end virtual RAN services","status":"public","keyword":["Orchestration","multi-domain","cellular network virtualization","SDN","5G"],"type":"conference","date_created":"2020-03-03T11:49:41Z","project":[{"name":"5G Programmable Infrastructure Converging disaggregated neTwork and compUte Resources","_id":"23","grant_number":"762057"}],"abstract":[{"text":"Despite recent progress in orchestration of Virtual Network Functions (VNFs) and in multi-technology SDN connectivity, the automated provisioning of end-to-end network services composed of virtual functions deployed across distributed compute locations remains an open challenge. This problem is especially relevant to support the deployment of future 5G networks, comprising virtual access and core network functions connected through a potentially multi-domain transport network.\r\nIn this paper, we present and demonstrate the 5GOS, a lightweight end-to-end orchestration framework that enables the\r\nautomated provisioning of virtual radio access network services. Using an experimental multi-domain testbed we demonstrate that the 5GOS can provision multi-domain virtual Wi-Fi and LTE services in less than three minutes.","lang":"eng"}],"citation":{"short":"D. Camps-Mur, F.  Canellas, A. Machwe, J. Paracuellos, K. Choumas, D. Giatsios, T. Korakis, H. Razzaghi Kouchaksaraei, in: The 6th IEEE International Conference on Network Softwarization (IEEE NetSoft 2020), n.d.","chicago":"Camps-Mur, Daniel, Ferran  Canellas, Azahar Machwe, Jorge Paracuellos, Kostas Choumas, Dimitris Giatsios, Thanasis Korakis, and Hadi Razzaghi Kouchaksaraei. “5GOS: Demonstrating Multi-Domain Orchestration of End-to-End Virtual RAN Services.” In <i>The 6th IEEE International Conference on Network Softwarization (IEEE NetSoft 2020)</i>, n.d.","apa":"Camps-Mur, D.,  Canellas, F., Machwe, A., Paracuellos, J., Choumas, K., Giatsios, D., … Razzaghi Kouchaksaraei, H. (n.d.). 5GOS: Demonstrating multi-domain orchestration of end-to-end virtual RAN services. In <i>the 6th IEEE International Conference on Network Softwarization (IEEE NetSoft 2020)</i>. Ghent, Belgium.","ieee":"D. Camps-Mur <i>et al.</i>, “5GOS: Demonstrating multi-domain orchestration of end-to-end virtual RAN services,” in <i>the 6th IEEE International Conference on Network Softwarization (IEEE NetSoft 2020)</i>, Ghent, Belgium.","ama":"Camps-Mur D,  Canellas F, Machwe A, et al. 5GOS: Demonstrating multi-domain orchestration of end-to-end virtual RAN services. In: <i>The 6th IEEE International Conference on Network Softwarization (IEEE NetSoft 2020)</i>.","bibtex":"@inproceedings{Camps-Mur_ Canellas_Machwe_Paracuellos_Choumas_Giatsios_Korakis_Razzaghi Kouchaksaraei, title={5GOS: Demonstrating multi-domain orchestration of end-to-end virtual RAN services}, booktitle={the 6th IEEE International Conference on Network Softwarization (IEEE NetSoft 2020)}, author={Camps-Mur, Daniel and  Canellas, Ferran and Machwe, Azahar and Paracuellos, Jorge and Choumas, Kostas and Giatsios, Dimitris and Korakis, Thanasis and Razzaghi Kouchaksaraei, Hadi} }","mla":"Camps-Mur, Daniel, et al. “5GOS: Demonstrating Multi-Domain Orchestration of End-to-End Virtual RAN Services.” <i>The 6th IEEE International Conference on Network Softwarization (IEEE NetSoft 2020)</i>."},"publication":"the 6th IEEE International Conference on Network Softwarization (IEEE NetSoft 2020)"},{"year":"2020","title":"Dynamic Bi-Objective Routing of Multiple Vehicles","publication_identifier":{"isbn":["978-1-4503-7128-5"]},"author":[{"id":"102979","first_name":"Jakob","last_name":"Bossek","orcid":"0000-0002-4121-4668","full_name":"Bossek, Jakob"},{"full_name":"Grimme, Christian","last_name":"Grimme","first_name":"Christian"},{"full_name":"Trautmann, Heike","first_name":"Heike","last_name":"Trautmann"}],"date_updated":"2023-12-13T10:43:24Z","publication_status":"published","language":[{"iso":"eng"}],"series_title":"GECCO ’20","doi":"10.1145/3377930.3390146","publication":"Proceedings of the Genetic and Evolutionary Computation Conference","abstract":[{"text":"In practice, e.g. in delivery and service scenarios, Vehicle-Routing-Problems (VRPs) often imply repeated decision making on dynamic customer requests. As in classical VRPs, tours have to be planned short while the number of serviced customers has to be maximized at the same time resulting in a multi-objective problem. Beyond that, however, dynamic requests lead to the need for re-planning of not yet realized tour parts, while already realized tour parts are irreversible. In this paper we study this type of bi-objective dynamic VRP including sequential decision making and concurrent realization of decisions. We adopt a recently proposed Dynamic Evolutionary Multi-Objective Algorithm (DEMOA) for a related VRP problem and extend it to the more realistic (here considered) scenario of multiple vehicles. We empirically show that our DEMOA is competitive with a multi-vehicle offline and clairvoyant variant of the proposed DEMOA as well as with the dynamic single-vehicle approach proposed earlier.","lang":"eng"}],"extern":"1","date_created":"2023-11-14T15:58:52Z","keyword":["decision making","dynamic optimization","evolutionary algorithms","multi-objective optimization","vehicle routing"],"type":"conference","department":[{"_id":"819"}],"status":"public","page":"166–174","_id":"48845","publisher":"Association for Computing Machinery","user_id":"102979","citation":{"mla":"Bossek, Jakob, et al. “Dynamic Bi-Objective Routing of Multiple Vehicles.” <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, Association for Computing Machinery, 2020, pp. 166–174, doi:<a href=\"https://doi.org/10.1145/3377930.3390146\">10.1145/3377930.3390146</a>.","ama":"Bossek J, Grimme C, Trautmann H. Dynamic Bi-Objective Routing of Multiple Vehicles. In: <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>. GECCO ’20. Association for Computing Machinery; 2020:166–174. doi:<a href=\"https://doi.org/10.1145/3377930.3390146\">10.1145/3377930.3390146</a>","bibtex":"@inproceedings{Bossek_Grimme_Trautmann_2020, place={New York, NY, USA}, series={GECCO ’20}, title={Dynamic Bi-Objective Routing of Multiple Vehicles}, DOI={<a href=\"https://doi.org/10.1145/3377930.3390146\">10.1145/3377930.3390146</a>}, booktitle={Proceedings of the Genetic and Evolutionary Computation Conference}, publisher={Association for Computing Machinery}, author={Bossek, Jakob and Grimme, Christian and Trautmann, Heike}, year={2020}, pages={166–174}, collection={GECCO ’20} }","apa":"Bossek, J., Grimme, C., &#38; Trautmann, H. (2020). Dynamic Bi-Objective Routing of Multiple Vehicles. <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 166–174. <a href=\"https://doi.org/10.1145/3377930.3390146\">https://doi.org/10.1145/3377930.3390146</a>","ieee":"J. Bossek, C. Grimme, and H. Trautmann, “Dynamic Bi-Objective Routing of Multiple Vehicles,” in <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 2020, pp. 166–174, doi: <a href=\"https://doi.org/10.1145/3377930.3390146\">10.1145/3377930.3390146</a>.","short":"J. Bossek, C. Grimme, H. Trautmann, in: Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, New York, NY, USA, 2020, pp. 166–174.","chicago":"Bossek, Jakob, Christian Grimme, and Heike Trautmann. “Dynamic Bi-Objective Routing of Multiple Vehicles.” In <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 166–174. GECCO ’20. New York, NY, USA: Association for Computing Machinery, 2020. <a href=\"https://doi.org/10.1145/3377930.3390146\">https://doi.org/10.1145/3377930.3390146</a>."},"place":"New York, NY, USA"},{"type":"journal_article","keyword":["Algorithm selection","Combinatorial optimization","Multi-objective optimization","Performance measurement","Traveling Salesperson Problem"],"department":[{"_id":"819"}],"date_created":"2023-11-14T15:58:53Z","abstract":[{"lang":"eng","text":"We build upon a recently proposed multi-objective view onto performance measurement of single-objective stochastic solvers. The trade-off between the fraction of failed runs and the mean runtime of successful runs \\textendash both to be minimized \\textendash is directly analyzed based on a study on algorithm selection of inexact state-of-the-art solvers for the famous Traveling Salesperson Problem (TSP). Moreover, we adopt the hypervolume indicator (HV) commonly used in multi-objective optimization for simultaneously assessing both conflicting objectives and investigate relations to commonly used performance indicators, both theoretically and empirically. Next to Penalized Average Runtime (PAR) and Penalized Quantile Runtime (PQR), the HV measure is used as a core concept within the construction of per-instance algorithm selection models offering interesting insights into complementary behavior of inexact TSP solvers. \\textbullet The multi-objective perspective is naturally generalizable to multiple objectives. \\textbullet Proof of relationship between HV and the PAR in the considered bi-objective space. \\textbullet New insights into complementary behavior of stochastic optimization algorithms."}],"issue":"C","publication":"Applied Soft Computing","citation":{"ieee":"J. Bossek, P. Kerschke, and H. Trautmann, “A Multi-Objective Perspective on Performance Assessment and Automated Selection of Single-Objective Optimization Algorithms,” <i>Applied Soft Computing</i>, vol. 88, no. C, 2020, doi: <a href=\"https://doi.org/10.1016/j.asoc.2019.105901\">10.1016/j.asoc.2019.105901</a>.","apa":"Bossek, J., Kerschke, P., &#38; Trautmann, H. (2020). A Multi-Objective Perspective on Performance Assessment and Automated Selection of Single-Objective Optimization Algorithms. <i>Applied Soft Computing</i>, <i>88</i>(C). <a href=\"https://doi.org/10.1016/j.asoc.2019.105901\">https://doi.org/10.1016/j.asoc.2019.105901</a>","mla":"Bossek, Jakob, et al. “A Multi-Objective Perspective on Performance Assessment and Automated Selection of Single-Objective Optimization Algorithms.” <i>Applied Soft Computing</i>, vol. 88, no. C, 2020, doi:<a href=\"https://doi.org/10.1016/j.asoc.2019.105901\">10.1016/j.asoc.2019.105901</a>.","bibtex":"@article{Bossek_Kerschke_Trautmann_2020, title={A Multi-Objective Perspective on Performance Assessment and Automated Selection of Single-Objective Optimization Algorithms}, volume={88}, DOI={<a href=\"https://doi.org/10.1016/j.asoc.2019.105901\">10.1016/j.asoc.2019.105901</a>}, number={C}, journal={Applied Soft Computing}, author={Bossek, Jakob and Kerschke, Pascal and Trautmann, Heike}, year={2020} }","chicago":"Bossek, Jakob, Pascal Kerschke, and Heike Trautmann. “A Multi-Objective Perspective on Performance Assessment and Automated Selection of Single-Objective Optimization Algorithms.” <i>Applied Soft Computing</i> 88, no. C (2020). <a href=\"https://doi.org/10.1016/j.asoc.2019.105901\">https://doi.org/10.1016/j.asoc.2019.105901</a>.","short":"J. Bossek, P. Kerschke, H. Trautmann, Applied Soft Computing 88 (2020).","ama":"Bossek J, Kerschke P, Trautmann H. A Multi-Objective Perspective on Performance Assessment and Automated Selection of Single-Objective Optimization Algorithms. <i>Applied Soft Computing</i>. 2020;88(C). doi:<a href=\"https://doi.org/10.1016/j.asoc.2019.105901\">10.1016/j.asoc.2019.105901</a>"},"doi":"10.1016/j.asoc.2019.105901","user_id":"102979","volume":88,"language":[{"iso":"eng"}],"_id":"48848","date_updated":"2023-12-13T10:52:17Z","intvolume":"        88","title":"A Multi-Objective Perspective on Performance Assessment and Automated Selection of Single-Objective Optimization Algorithms","status":"public","year":"2020","publication_identifier":{"issn":["1568-4946"]},"author":[{"last_name":"Bossek","orcid":"0000-0002-4121-4668","first_name":"Jakob","full_name":"Bossek, Jakob","id":"102979"},{"full_name":"Kerschke, Pascal","last_name":"Kerschke","first_name":"Pascal"},{"full_name":"Trautmann, Heike","first_name":"Heike","last_name":"Trautmann"}]},{"abstract":[{"lang":"eng","text":"We build upon a recently proposed multi-objective view onto performance measurement of single-objective stochastic solvers. The trade-off between the fraction of failed runs and the mean runtime of successful runs – both to be minimized – is directly analyzed based on a study on algorithm selection of inexact state-of-the-art solvers for the famous Traveling Salesperson Problem (TSP). Moreover, we adopt the hypervolume indicator (HV) commonly used in multi-objective optimization for simultaneously assessing both conflicting objectives and investigate relations to commonly used performance indicators, both theoretically and empirically. Next to Penalized Average Runtime (PAR) and Penalized Quantile Runtime (PQR), the HV measure is used as a core concept within the construction of per-instance algorithm selection models offering interesting insights into complementary behavior of inexact TSP solvers."}],"citation":{"bibtex":"@article{Bossek_Kerschke_Trautmann_2020, title={A multi-objective perspective on performance assessment and automated selection of single-objective optimization algorithms}, volume={88}, DOI={<a href=\"https://doi.org/10.1016/j.asoc.2019.105901\">https://doi.org/10.1016/j.asoc.2019.105901</a>}, journal={Applied Soft Computing}, author={Bossek, Jakob and Kerschke, Pascal and Trautmann, Heike}, year={2020}, pages={105901} }","ama":"Bossek J, Kerschke P, Trautmann H. A multi-objective perspective on performance assessment and automated selection of single-objective optimization algorithms. <i>Applied Soft Computing</i>. 2020;88:105901. doi:<a href=\"https://doi.org/10.1016/j.asoc.2019.105901\">https://doi.org/10.1016/j.asoc.2019.105901</a>","mla":"Bossek, Jakob, et al. “A Multi-Objective Perspective on Performance Assessment and Automated Selection of Single-Objective Optimization Algorithms.” <i>Applied Soft Computing</i>, vol. 88, 2020, p. 105901, doi:<a href=\"https://doi.org/10.1016/j.asoc.2019.105901\">https://doi.org/10.1016/j.asoc.2019.105901</a>.","chicago":"Bossek, Jakob, Pascal Kerschke, and Heike Trautmann. “A Multi-Objective Perspective on Performance Assessment and Automated Selection of Single-Objective Optimization Algorithms.” <i>Applied Soft Computing</i> 88 (2020): 105901. <a href=\"https://doi.org/10.1016/j.asoc.2019.105901\">https://doi.org/10.1016/j.asoc.2019.105901</a>.","short":"J. Bossek, P. Kerschke, H. Trautmann, Applied Soft Computing 88 (2020) 105901.","ieee":"J. Bossek, P. Kerschke, and H. Trautmann, “A multi-objective perspective on performance assessment and automated selection of single-objective optimization algorithms,” <i>Applied Soft Computing</i>, vol. 88, p. 105901, 2020, doi: <a href=\"https://doi.org/10.1016/j.asoc.2019.105901\">https://doi.org/10.1016/j.asoc.2019.105901</a>.","apa":"Bossek, J., Kerschke, P., &#38; Trautmann, H. (2020). A multi-objective perspective on performance assessment and automated selection of single-objective optimization algorithms. <i>Applied Soft Computing</i>, <i>88</i>, 105901. <a href=\"https://doi.org/10.1016/j.asoc.2019.105901\">https://doi.org/10.1016/j.asoc.2019.105901</a>"},"publication":"Applied Soft Computing","department":[{"_id":"34"},{"_id":"819"}],"type":"journal_article","keyword":["Algorithm selection","Multi-objective optimization","Performance measurement","Combinatorial optimization","Traveling Salesperson Problem"],"date_created":"2023-08-04T07:42:26Z","intvolume":"        88","date_updated":"2024-06-10T12:00:46Z","publication_identifier":{"issn":["1568-4946"]},"author":[{"orcid":"0000-0002-4121-4668","last_name":"Bossek","first_name":"Jakob","full_name":"Bossek, Jakob","id":"102979"},{"first_name":"Pascal","last_name":"Kerschke","full_name":"Kerschke, Pascal"},{"id":"100740","first_name":"Heike","orcid":"0000-0002-9788-8282","last_name":"Trautmann","full_name":"Trautmann, Heike"}],"status":"public","year":"2020","title":"A multi-objective perspective on performance assessment and automated selection of single-objective optimization algorithms","volume":88,"doi":"https://doi.org/10.1016/j.asoc.2019.105901","user_id":"15504","_id":"46334","language":[{"iso":"eng"}],"page":"105901"},{"quality_controlled":"1","citation":{"mla":"Uhe, Benedikt, et al. “Improvement of a Rivet Geometry for the Self-Piercing Riveting of High-Strength Steel and Multi-Material Joints.” <i>Production Engineering</i>, vol. 14, 2020, pp. 417–23, doi:<a href=\"https://doi.org/10.1007/s11740-020-00973-w\">10.1007/s11740-020-00973-w</a>.","ama":"Uhe B, Kuball C-M, Merklein M, Meschut G. Improvement of a rivet geometry for the self-piercing riveting of high-strength steel and multi-material joints. <i>Production Engineering</i>. 2020;14:417-423. doi:<a href=\"https://doi.org/10.1007/s11740-020-00973-w\">10.1007/s11740-020-00973-w</a>","bibtex":"@article{Uhe_Kuball_Merklein_Meschut_2020, title={Improvement of a rivet geometry for the self-piercing riveting of high-strength steel and multi-material joints}, volume={14}, DOI={<a href=\"https://doi.org/10.1007/s11740-020-00973-w\">10.1007/s11740-020-00973-w</a>}, journal={Production Engineering}, author={Uhe, Benedikt and Kuball, Clara-Maria and Merklein, Marion and Meschut, Gerson}, year={2020}, pages={417–423} }","apa":"Uhe, B., Kuball, C.-M., Merklein, M., &#38; Meschut, G. (2020). Improvement of a rivet geometry for the self-piercing riveting of high-strength steel and multi-material joints. <i>Production Engineering</i>, <i>14</i>, 417–423. <a href=\"https://doi.org/10.1007/s11740-020-00973-w\">https://doi.org/10.1007/s11740-020-00973-w</a>","ieee":"B. Uhe, C.-M. Kuball, M. Merklein, and G. Meschut, “Improvement of a rivet geometry for the self-piercing riveting of high-strength steel and multi-material joints,” <i>Production Engineering</i>, vol. 14, pp. 417–423, 2020, doi: <a href=\"https://doi.org/10.1007/s11740-020-00973-w\">10.1007/s11740-020-00973-w</a>.","chicago":"Uhe, Benedikt, Clara-Maria Kuball, Marion Merklein, and Gerson Meschut. “Improvement of a Rivet Geometry for the Self-Piercing Riveting of High-Strength Steel and Multi-Material Joints.” <i>Production Engineering</i> 14 (2020): 417–23. <a href=\"https://doi.org/10.1007/s11740-020-00973-w\">https://doi.org/10.1007/s11740-020-00973-w</a>.","short":"B. Uhe, C.-M. Kuball, M. Merklein, G. Meschut, Production Engineering 14 (2020) 417–423."},"user_id":"53912","volume":14,"page":"417-423","_id":"19973","status":"public","type":"journal_article","keyword":["Self-piercing riveting","Joining technology","Rivet geometry","Multi-material design","High-strength steel","Aluminium"],"department":[{"_id":"157"}],"date_created":"2020-10-12T08:14:13Z","abstract":[{"lang":"eng","text":"As a result of lightweight design, increased use is being made of high-strength steel and aluminium in car bodies. Self-piercing riveting is an established technique for joining these materials. The dissimilar properties of the two materials have led to a number of different rivet geometries in the past. Each rivet geometry fulfils the requirements of the materials within a limited range. In the present investigation, an improved rivet geometry is developed, which permits the reliable joining of two material combinations that could only be joined by two different rivet geometries up until now. Material combination 1 consists of high-strength steel on both sides, while material combination 2 comprises aluminium on the punch side and high-strength steel on the die side. The material flow and the stress and strain conditions prevailing during the joining process are analysed by means of numerical simulation. The rivet geometry is then improved step-by-step on the basis of this analysis. Finally, the improved rivet geometry is manufactured and the findings of the investigation are verified in experimental joining tests."}],"publication":"Production Engineering","doi":"10.1007/s11740-020-00973-w","language":[{"iso":"eng"}],"date_updated":"2026-02-27T10:41:55Z","publication_status":"published","intvolume":"        14","article_type":"original","year":"2020","title":"Improvement of a rivet geometry for the self-piercing riveting of high-strength steel and multi-material joints","author":[{"full_name":"Uhe, Benedikt","first_name":"Benedikt","last_name":"Uhe","id":"38131"},{"last_name":"Kuball","first_name":"Clara-Maria","full_name":"Kuball, Clara-Maria"},{"first_name":"Marion","last_name":"Merklein","full_name":"Merklein, Marion"},{"orcid":"0000-0002-2763-1246","last_name":"Meschut","first_name":"Gerson","full_name":"Meschut, Gerson","id":"32056"}]},{"conference":{"name":"2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom)"},"status":"public","user_id":"83983","_id":"17667","page":"113-123","quality_controlled":"1","citation":{"bibtex":"@inproceedings{Koning_Polevoy_Meijer_de Laat_Grosso_2019, series={2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom)}, title={Approaches for Collaborative Security Defences in Multi Network Environments}, DOI={<a href=\"https://doi.org/10.1109/CSCloud/EdgeCom.2019.000-9\">10.1109/CSCloud/EdgeCom.2019.000-9</a>}, booktitle={2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom)}, author={Koning, Ralph and Polevoy, Gleb and Meijer, Lydia and de Laat, Cees and Grosso, Paola}, year={2019}, pages={113–123}, collection={2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom)} }","ama":"Koning R, Polevoy G, Meijer L, de Laat C, Grosso P. Approaches for Collaborative Security Defences in Multi Network Environments. In: <i>2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom)</i>. 2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom). ; 2019:113-123. doi:<a href=\"https://doi.org/10.1109/CSCloud/EdgeCom.2019.000-9\">10.1109/CSCloud/EdgeCom.2019.000-9</a>","mla":"Koning, Ralph, et al. “Approaches for Collaborative Security Defences in Multi Network Environments.” <i>2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom)</i>, 2019, pp. 113–23, doi:<a href=\"https://doi.org/10.1109/CSCloud/EdgeCom.2019.000-9\">10.1109/CSCloud/EdgeCom.2019.000-9</a>.","short":"R. Koning, G. Polevoy, L. Meijer, C. de Laat, P. Grosso, in: 2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom), 2019, pp. 113–123.","chicago":"Koning, Ralph, Gleb Polevoy, Lydia Meijer, Cees de Laat, and Paola Grosso. “Approaches for Collaborative Security Defences in Multi Network Environments.” In <i>2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom)</i>, 113–23. 2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom), 2019. <a href=\"https://doi.org/10.1109/CSCloud/EdgeCom.2019.000-9\">https://doi.org/10.1109/CSCloud/EdgeCom.2019.000-9</a>.","ieee":"R. Koning, G. Polevoy, L. Meijer, C. de Laat, and P. Grosso, “Approaches for Collaborative Security Defences in Multi Network Environments,” in <i>2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom)</i>, 2019, pp. 113–123.","apa":"Koning, R., Polevoy, G., Meijer, L., de Laat, C., &#38; Grosso, P. (2019). Approaches for Collaborative Security Defences in Multi Network Environments. In <i>2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom)</i> (pp. 113–123). <a href=\"https://doi.org/10.1109/CSCloud/EdgeCom.2019.000-9\">https://doi.org/10.1109/CSCloud/EdgeCom.2019.000-9</a>"},"date_updated":"2022-01-06T06:53:16Z","author":[{"full_name":"Koning, Ralph","last_name":"Koning","first_name":"Ralph"},{"id":"83983","full_name":"Polevoy, Gleb","last_name":"Polevoy","first_name":"Gleb"},{"first_name":"Lydia","last_name":"Meijer","full_name":"Meijer, Lydia"},{"full_name":"de Laat, Cees","first_name":"Cees","last_name":"de Laat"},{"last_name":"Grosso","first_name":"Paola","full_name":"Grosso, Paola"}],"publication_identifier":{"issn":["null"]},"year":"2019","title":"Approaches for Collaborative Security Defences in Multi Network Environments","doi":"10.1109/CSCloud/EdgeCom.2019.000-9","series_title":"2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom)","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://ieeexplore.ieee.org/abstract/document/8854057/authors#authors"}],"extern":"1","abstract":[{"lang":"eng","text":"Resolving distributed attacks benefits from collaboration between networks. We present three approaches for the same multi-domain defensive action that can be applied in such an alliance: 1) Counteract Everywhere, 2) Minimize Countermeasures, and 3) Minimize Propagation. First, we provide a formula to compute efficiency of a defense; then we use this formula to compute the efficiency of the approaches under various circumstances. Finally, we discuss how task execution order and timing influence defense efficiency. Our results show that the Minimize Propagation approach is the most efficient method when defending against the chosen attack."}],"publication":"2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom)","department":[{"_id":"63"},{"_id":"541"}],"type":"conference","keyword":["computer network security","multinetwork environments","multidomain defensive action","task execution order","timing influence defense efficiency","distributed attacks","collaborative security defence approach","minimize propagation approach","minimize countermeasure approach","counteract everywhere approach","Conferences","Cloud computing","Computer crime","Edge computing","Security","Defense Approaches","Multi-Domain Defense","Collaborative Defense","Defense Algorithms","Computer Networks"],"date_created":"2020-08-06T15:23:23Z"},{"place":"Cham","citation":{"short":"J. Bossek, C. Grimme, S. Meisel, G. Rudolph, H. Trautmann, in: K. Deb, E. Goodman, C.A. Coello Coello, K. Klamroth, K. Miettinen, S. Mostaghim, P. Reed (Eds.), Evolutionary Multi-Criterion Optimization (EMO), Springer International Publishing, Cham, 2019, pp. 516–528.","chicago":"Bossek, Jakob, Christian Grimme, Stephan Meisel, Günter Rudolph, and Heike Trautmann. “Bi-Objective Orienteering: Towards a Dynamic Multi-Objective Evolutionary Algorithm.” In <i>Evolutionary Multi-Criterion Optimization (EMO)</i>, edited by Kalyanmoy Deb, Erik Goodman, Carlos A. Coello Coello, Kathrin Klamroth, Kaisa Miettinen, Sanaz Mostaghim, and Patrick Reed, 516–528. Lecture Notes in Computer Science. Cham: Springer International Publishing, 2019. <a href=\"https://doi.org/10.1007/978-3-030-12598-1_41\">https://doi.org/10.1007/978-3-030-12598-1_41</a>.","ieee":"J. Bossek, C. Grimme, S. Meisel, G. Rudolph, and H. Trautmann, “Bi-Objective Orienteering: Towards a Dynamic Multi-objective Evolutionary Algorithm,” in <i>Evolutionary Multi-Criterion Optimization (EMO)</i>, 2019, pp. 516–528, doi: <a href=\"https://doi.org/10.1007/978-3-030-12598-1_41\">10.1007/978-3-030-12598-1_41</a>.","apa":"Bossek, J., Grimme, C., Meisel, S., Rudolph, G., &#38; Trautmann, H. (2019). Bi-Objective Orienteering: Towards a Dynamic Multi-objective Evolutionary Algorithm. In K. Deb, E. Goodman, C. A. Coello Coello, K. Klamroth, K. Miettinen, S. Mostaghim, &#38; P. Reed (Eds.), <i>Evolutionary Multi-Criterion Optimization (EMO)</i> (pp. 516–528). Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-030-12598-1_41\">https://doi.org/10.1007/978-3-030-12598-1_41</a>","bibtex":"@inproceedings{Bossek_Grimme_Meisel_Rudolph_Trautmann_2019, place={Cham}, series={Lecture Notes in Computer Science}, title={Bi-Objective Orienteering: Towards a Dynamic Multi-objective Evolutionary Algorithm}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-12598-1_41\">10.1007/978-3-030-12598-1_41</a>}, booktitle={Evolutionary Multi-Criterion Optimization (EMO)}, publisher={Springer International Publishing}, author={Bossek, Jakob and Grimme, Christian and Meisel, Stephan and Rudolph, Günter and Trautmann, Heike}, editor={Deb, Kalyanmoy and Goodman, Erik and Coello Coello, Carlos A. and Klamroth, Kathrin and Miettinen, Kaisa and Mostaghim, Sanaz and Reed, Patrick}, year={2019}, pages={516–528}, collection={Lecture Notes in Computer Science} }","ama":"Bossek J, Grimme C, Meisel S, Rudolph G, Trautmann H. Bi-Objective Orienteering: Towards a Dynamic Multi-objective Evolutionary Algorithm. In: Deb K, Goodman E, Coello Coello CA, et al., eds. <i>Evolutionary Multi-Criterion Optimization (EMO)</i>. Lecture Notes in Computer Science. Springer International Publishing; 2019:516–528. doi:<a href=\"https://doi.org/10.1007/978-3-030-12598-1_41\">10.1007/978-3-030-12598-1_41</a>","mla":"Bossek, Jakob, et al. “Bi-Objective Orienteering: Towards a Dynamic Multi-Objective Evolutionary Algorithm.” <i>Evolutionary Multi-Criterion Optimization (EMO)</i>, edited by Kalyanmoy Deb et al., Springer International Publishing, 2019, pp. 516–528, doi:<a href=\"https://doi.org/10.1007/978-3-030-12598-1_41\">10.1007/978-3-030-12598-1_41</a>."},"editor":[{"last_name":"Deb","first_name":"Kalyanmoy","full_name":"Deb, Kalyanmoy"},{"full_name":"Goodman, Erik","last_name":"Goodman","first_name":"Erik"},{"full_name":"Coello Coello, Carlos A.","last_name":"Coello Coello","first_name":"Carlos A."},{"full_name":"Klamroth, Kathrin","first_name":"Kathrin","last_name":"Klamroth"},{"first_name":"Kaisa","last_name":"Miettinen","full_name":"Miettinen, Kaisa"},{"full_name":"Mostaghim, Sanaz","first_name":"Sanaz","last_name":"Mostaghim"},{"full_name":"Reed, Patrick","first_name":"Patrick","last_name":"Reed"}],"user_id":"102979","publisher":"Springer International Publishing","_id":"48841","page":"516–528","status":"public","department":[{"_id":"819"}],"type":"conference","keyword":["Combinatorial optimization","Dynamic optimization","Metaheuristics","Multi-objective optimization","Vehicle routing"],"date_created":"2023-11-14T15:58:52Z","extern":"1","abstract":[{"text":"We tackle a bi-objective dynamic orienteering problem where customer requests arise as time passes by. The goal is to minimize the tour length traveled by a single delivery vehicle while simultaneously keeping the number of dismissed dynamic customers to a minimum. We propose a dynamic Evolutionary Multi-Objective Algorithm which is grounded on insights gained from a previous series of work on an a-posteriori version of the problem, where all request times are known in advance. In our experiments, we simulate different decision maker strategies and evaluate the development of the Pareto-front approximations on exemplary problem instances. It turns out, that despite severely reduced computational budget and no oracle-knowledge of request times the dynamic EMOA is capable of producing approximations which partially dominate the results of the a-posteriori EMOA and dynamic integer linear programming strategies.","lang":"eng"}],"publication":"Evolutionary Multi-Criterion Optimization (EMO)","doi":"10.1007/978-3-030-12598-1_41","series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2023-12-13T10:43:07Z","publication_identifier":{"isbn":["978-3-030-12598-1"]},"author":[{"full_name":"Bossek, Jakob","first_name":"Jakob","last_name":"Bossek","orcid":"0000-0002-4121-4668","id":"102979"},{"full_name":"Grimme, Christian","last_name":"Grimme","first_name":"Christian"},{"first_name":"Stephan","last_name":"Meisel","full_name":"Meisel, Stephan"},{"full_name":"Rudolph, Günter","first_name":"Günter","last_name":"Rudolph"},{"full_name":"Trautmann, Heike","first_name":"Heike","last_name":"Trautmann"}],"title":"Bi-Objective Orienteering: Towards a Dynamic Multi-objective Evolutionary Algorithm","year":"2019"},{"place":"New York, NY, USA","citation":{"ama":"Bossek J, Grimme C, Neumann F. On the Benefits of Biased Edge-Exchange Mutation for the Multi-Criteria Spanning Tree Problem. In: <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>. GECCO ’19. Association for Computing Machinery; 2019:516–523. doi:<a href=\"https://doi.org/10.1145/3321707.3321818\">10.1145/3321707.3321818</a>","bibtex":"@inproceedings{Bossek_Grimme_Neumann_2019, place={New York, NY, USA}, series={GECCO ’19}, title={On the Benefits of Biased Edge-Exchange Mutation for the Multi-Criteria Spanning Tree Problem}, DOI={<a href=\"https://doi.org/10.1145/3321707.3321818\">10.1145/3321707.3321818</a>}, booktitle={Proceedings of the Genetic and Evolutionary Computation Conference}, publisher={Association for Computing Machinery}, author={Bossek, Jakob and Grimme, Christian and Neumann, Frank}, year={2019}, pages={516–523}, collection={GECCO ’19} }","mla":"Bossek, Jakob, et al. “On the Benefits of Biased Edge-Exchange Mutation for the Multi-Criteria Spanning Tree Problem.” <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, Association for Computing Machinery, 2019, pp. 516–523, doi:<a href=\"https://doi.org/10.1145/3321707.3321818\">10.1145/3321707.3321818</a>.","chicago":"Bossek, Jakob, Christian Grimme, and Frank Neumann. “On the Benefits of Biased Edge-Exchange Mutation for the Multi-Criteria Spanning Tree Problem.” In <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 516–523. GECCO ’19. New York, NY, USA: Association for Computing Machinery, 2019. <a href=\"https://doi.org/10.1145/3321707.3321818\">https://doi.org/10.1145/3321707.3321818</a>.","short":"J. Bossek, C. Grimme, F. Neumann, in: Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, New York, NY, USA, 2019, pp. 516–523.","apa":"Bossek, J., Grimme, C., &#38; Neumann, F. (2019). On the Benefits of Biased Edge-Exchange Mutation for the Multi-Criteria Spanning Tree Problem. <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 516–523. <a href=\"https://doi.org/10.1145/3321707.3321818\">https://doi.org/10.1145/3321707.3321818</a>","ieee":"J. Bossek, C. Grimme, and F. Neumann, “On the Benefits of Biased Edge-Exchange Mutation for the Multi-Criteria Spanning Tree Problem,” in <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 2019, pp. 516–523, doi: <a href=\"https://doi.org/10.1145/3321707.3321818\">10.1145/3321707.3321818</a>."},"user_id":"102979","page":"516–523","publisher":"Association for Computing Machinery","_id":"48840","status":"public","type":"conference","keyword":["biased mutation","combinatorial optimization","minimum spanning tree","multi-objective optimization"],"department":[{"_id":"819"}],"date_created":"2023-11-14T15:58:52Z","extern":"1","abstract":[{"lang":"eng","text":"Research has shown that for many single-objective graph problems where optimum solutions are composed of low weight sub-graphs, such as the minimum spanning tree problem (MST), mutation operators favoring low weight edges show superior performance. Intuitively, similar observations should hold for multi-criteria variants of such problems. In this work, we focus on the multi-criteria MST problem. A thorough experimental study is conducted where we estimate the probability of edges being part of non-dominated spanning trees as a function of the edges’ non-domination level or domination count, respectively. Building on gained insights, we propose several biased one-edge-exchange mutation operators that differ in the used edge-selection probability distribution (biased towards edges of low rank). Our empirical analysis shows that among different graph types (dense and sparse) and edge weight types (both uniformly random and combinations of Euclidean and uniformly random) biased edge-selection strategies perform superior in contrast to the baseline uniform edge-selection. Our findings are in particular strong for dense graphs."}],"publication":"Proceedings of the Genetic and Evolutionary Computation Conference","doi":"10.1145/3321707.3321818","series_title":"GECCO ’19","language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2023-12-13T10:42:24Z","year":"2019","title":"On the Benefits of Biased Edge-Exchange Mutation for the Multi-Criteria Spanning Tree Problem","publication_identifier":{"isbn":["978-1-4503-6111-8"]},"author":[{"last_name":"Bossek","orcid":"0000-0002-4121-4668","first_name":"Jakob","full_name":"Bossek, Jakob","id":"102979"},{"full_name":"Grimme, Christian","first_name":"Christian","last_name":"Grimme"},{"last_name":"Neumann","first_name":"Frank","full_name":"Neumann, Frank"}]},{"volume":295,"user_id":"210","_id":"10334","page":"653 - 662","status":"public","project":[{"name":"Hochleistungsbonden in energieeffizienten Leistungshalbleitermodulen","_id":"93","grant_number":"MP-1-1-015"}],"quality_controlled":"1","citation":{"apa":"Schemmel, R., Hemsel, T., Dymel, C., Hunstig, M., Brökelmann, M., &#38; Sextro, W. (2019). Using complex multi-dimensional vibration trajectories in ultrasonic bonding and welding. <i>Sensors and Actuators A: Physical</i>, <i>295</i>, 653–662. <a href=\"https://doi.org/10.1016/j.sna.2019.04.025\">https://doi.org/10.1016/j.sna.2019.04.025</a>","ieee":"R. Schemmel, T. Hemsel, C. Dymel, M. Hunstig, M. Brökelmann, and W. Sextro, “Using complex multi-dimensional vibration trajectories in ultrasonic bonding and welding,” <i>Sensors and Actuators A: Physical</i>, vol. 295, pp. 653–662, 2019, doi: <a href=\"https://doi.org/10.1016/j.sna.2019.04.025\">10.1016/j.sna.2019.04.025</a>.","short":"R. Schemmel, T. Hemsel, C. Dymel, M. Hunstig, M. Brökelmann, W. Sextro, Sensors and Actuators A: Physical 295 (2019) 653–662.","chicago":"Schemmel, Reinhard, Tobias Hemsel, Collin Dymel, Matthias Hunstig, Michael Brökelmann, and Walter Sextro. “Using Complex Multi-Dimensional Vibration Trajectories in Ultrasonic Bonding and Welding.” <i>Sensors and Actuators A: Physical</i> 295 (2019): 653–62. <a href=\"https://doi.org/10.1016/j.sna.2019.04.025\">https://doi.org/10.1016/j.sna.2019.04.025</a>.","mla":"Schemmel, Reinhard, et al. “Using Complex Multi-Dimensional Vibration Trajectories in Ultrasonic Bonding and Welding.” <i>Sensors and Actuators A: Physical</i>, vol. 295, 2019, pp. 653–62, doi:<a href=\"https://doi.org/10.1016/j.sna.2019.04.025\">10.1016/j.sna.2019.04.025</a>.","ama":"Schemmel R, Hemsel T, Dymel C, Hunstig M, Brökelmann M, Sextro W. Using complex multi-dimensional vibration trajectories in ultrasonic bonding and welding. <i>Sensors and Actuators A: Physical</i>. 2019;295:653-662. doi:<a href=\"https://doi.org/10.1016/j.sna.2019.04.025\">10.1016/j.sna.2019.04.025</a>","bibtex":"@article{Schemmel_Hemsel_Dymel_Hunstig_Brökelmann_Sextro_2019, title={Using complex multi-dimensional vibration trajectories in ultrasonic bonding and welding}, volume={295}, DOI={<a href=\"https://doi.org/10.1016/j.sna.2019.04.025\">10.1016/j.sna.2019.04.025</a>}, journal={Sensors and Actuators A: Physical}, author={Schemmel, Reinhard and Hemsel, Tobias and Dymel, Collin and Hunstig, Matthias and Brökelmann, Michael and Sextro, Walter}, year={2019}, pages={653–662} }"},"doi":"10.1016/j.sna.2019.04.025","language":[{"iso":"eng"}],"intvolume":"       295","date_updated":"2023-09-21T14:12:15Z","author":[{"id":"28647","first_name":"Reinhard","last_name":"Schemmel","full_name":"Schemmel, Reinhard"},{"id":"210","last_name":"Hemsel","first_name":"Tobias","full_name":"Hemsel, Tobias"},{"id":"66833","last_name":"Dymel","first_name":"Collin","full_name":"Dymel, Collin"},{"full_name":"Hunstig, Matthias","last_name":"Hunstig","first_name":"Matthias"},{"first_name":"Michael","last_name":"Brökelmann","full_name":"Brökelmann, Michael"},{"full_name":"Sextro, Walter","last_name":"Sextro","first_name":"Walter","id":"21220"}],"publication_identifier":{"issn":["0924-4247"]},"year":"2019","title":"Using complex multi-dimensional vibration trajectories in ultrasonic bonding and welding","department":[{"_id":"151"}],"keyword":["Ultrasonic bonding","Ultrasonic welding","Multi-dimensional bonding","Complex vibration","Multi-frequent","Two-dimensional friction model"],"type":"journal_article","date_created":"2019-07-01T07:32:07Z","abstract":[{"text":"Ultrasonic joining is a common industrial process. In the electronics industry it is used to form electrical connections, including those of dissimilar materials. Multiple influencing factors in ultrasonic joining are known and extensively investigated; process parameters like ultrasonic power, bond force, and bonding frequency of the ultrasonic vibration are known to have a high impact on a reliable joining process and need to be adapted for each new application with different geometry or materials. This contribution is focused on increasing ultrasonic power transmitted to the interface and keeping mechanical stresses during ultrasonic bonding low by using a multi-dimensional ultrasonic transducer concept. Bonding results for a new designed connector pin in IGBT-modules achieved by multi- and one-dimensional bonding are discussed.","lang":"eng"}],"publication":"Sensors and Actuators A: Physical"},{"date_updated":"2020-05-07T05:33:56Z","author":[{"full_name":"Unger, Andreas","first_name":"Andreas","last_name":"Unger"},{"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"},{"first_name":"Walter","last_name":"Sextro","full_name":"Sextro, Walter","id":"21220"}],"title":"Intelligent Production of Wire Bonds using Multi-Objective Optimization – Insights, Opportunities and Challenges","status":"public","year":"2018","volume":"Vol. 2018, No. 1, pp. 000572-000577.","doi":"10.4071/2380-4505-2018.1.000572","user_id":"210","language":[{"iso":"eng"}],"_id":"9999","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."}],"citation":{"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.","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.","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>.","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} }"},"publication":"In Proceedings of IMAPS 2018 – 51st Symposium on Microelectronics, Pasadena, CA, 2018","department":[{"_id":"151"}],"keyword":["wire bonding","multi-objective optimization","process model","copper wire","self-optimization"],"type":"conference","date_created":"2019-05-27T10:27:45Z"},{"abstract":[{"lang":"eng","text":"We present a peer-to-peer network that supports the efficient processing of orthogonal range queries $R=\\bigtimes_{i=1}^{d}[a_i,\\,b_i]$ in a $d$-dimensional point space.\\\\\r\nThe  network is the same for each dimension, namely a distance halving network like the one introduced by Naor and Wieder (ACM TALG'07).\r\nWe show how to execute such range queries using $\\mathcal{O}\\left(2^{d'}d\\,\\log m + d\\,|R|\\right)$ hops (and the same number of messages) in total. Here $[m]^d$ is the ground set, $|R|$ is the size and $d'$ the dimension of the queried range.\r\nFurthermore, if the peers form a distributed network, the query can be answered in $\\mathcal{O}\\left(d\\,\\log m + d\\,\\sum_{i=1}^{d}(b_i-a_i+1)\\right)$ communication rounds.\r\nOur algorithms are based on a mapping of the Hilbert Curve through $[m]^d$ to the peers."}],"publication":"Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)","department":[{"_id":"63"},{"_id":"79"}],"keyword":["Distributed Storage","Multi-Dimensional Range Queries","Peer-to-Peer","Hilbert Curve"],"type":"conference","date_created":"2018-09-11T05:26:59Z","file":[{"access_level":"closed","file_size":1122875,"file_name":"A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension.pdf","date_updated":"2018-11-27T10:03:33Z","relation":"main_file","content_type":"application/pdf","success":1,"file_id":"5863","creator":"tillk","date_created":"2018-11-27T10:03:33Z"}],"date_updated":"2022-01-06T07:01:00Z","author":[{"last_name":"Benter","first_name":"Markus","full_name":"Benter, Markus"},{"orcid":"0000-0003-2014-4696","first_name":"Till","last_name":"Knollmann","full_name":"Knollmann, Till","id":"39241"},{"last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"full_name":"Setzer, Alexander","last_name":"Setzer","first_name":"Alexander","id":"11108"},{"full_name":"Sundermeier, Jannik","last_name":"Sundermeier","first_name":"Jannik","id":"38705"}],"title":"A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension","year":"2018","doi":"10.1007/978-3-030-19759-9_4","language":[{"iso":"eng"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"citation":{"ieee":"M. Benter, T. Knollmann, F. Meyer auf der Heide, A. Setzer, and J. Sundermeier, “A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension,” in <i>Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)</i>, Helsinki, 2018.","apa":"Benter, M., Knollmann, T., Meyer auf der Heide, F., Setzer, A., &#38; Sundermeier, J. (2018). A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension. In <i>Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)</i>. Helsinki. <a href=\"https://doi.org/10.1007/978-3-030-19759-9_4\">https://doi.org/10.1007/978-3-030-19759-9_4</a>","mla":"Benter, Markus, et al. “A Peer-to-Peer Based Cloud Storage Supporting Orthogonal Range Queries of Arbitrary Dimension.” <i>Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)</i>, 2018, doi:<a href=\"https://doi.org/10.1007/978-3-030-19759-9_4\">10.1007/978-3-030-19759-9_4</a>.","bibtex":"@inproceedings{Benter_Knollmann_Meyer auf der Heide_Setzer_Sundermeier_2018, title={A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-19759-9_4\">10.1007/978-3-030-19759-9_4</a>}, booktitle={Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)}, author={Benter, Markus and Knollmann, Till and Meyer auf der Heide, Friedhelm and Setzer, Alexander and Sundermeier, Jannik}, year={2018} }","ama":"Benter M, Knollmann T, Meyer auf der Heide F, Setzer A, Sundermeier J. A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension. In: <i>Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)</i>. ; 2018. doi:<a href=\"https://doi.org/10.1007/978-3-030-19759-9_4\">10.1007/978-3-030-19759-9_4</a>","short":"M. Benter, T. Knollmann, F. Meyer auf der Heide, A. Setzer, J. Sundermeier, in: Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD), 2018.","chicago":"Benter, Markus, Till Knollmann, Friedhelm Meyer auf der Heide, Alexander Setzer, and Jannik Sundermeier. “A Peer-to-Peer Based Cloud Storage Supporting Orthogonal Range Queries of Arbitrary Dimension.” In <i>Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)</i>, 2018. <a href=\"https://doi.org/10.1007/978-3-030-19759-9_4\">https://doi.org/10.1007/978-3-030-19759-9_4</a>."},"file_date_updated":"2018-11-27T10:03:33Z","has_accepted_license":"1","conference":{"end_date":"2018-08-21","start_date":"2018-08-20","name":"4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)","location":"Helsinki"},"status":"public","user_id":"14955","ddc":["000"],"_id":"4375"},{"page":"585–592","publisher":"Association for Computing Machinery","_id":"48839","user_id":"102979","status":"public","place":"New York, NY, USA","citation":{"ieee":"J. Bossek, C. Grimme, S. Meisel, G. Rudolph, and H. Trautmann, “Local Search Effects in Bi-Objective Orienteering,” in <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 2018, pp. 585–592, doi: <a href=\"https://doi.org/10.1145/3205455.3205548\">10.1145/3205455.3205548</a>.","apa":"Bossek, J., Grimme, C., Meisel, S., Rudolph, G., &#38; Trautmann, H. (2018). Local Search Effects in Bi-Objective Orienteering. <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 585–592. <a href=\"https://doi.org/10.1145/3205455.3205548\">https://doi.org/10.1145/3205455.3205548</a>","short":"J. Bossek, C. Grimme, S. Meisel, G. Rudolph, H. Trautmann, in: Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, New York, NY, USA, 2018, pp. 585–592.","chicago":"Bossek, Jakob, Christian Grimme, Stephan Meisel, Günter Rudolph, and Heike Trautmann. “Local Search Effects in Bi-Objective Orienteering.” In <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 585–592. GECCO ’18. New York, NY, USA: Association for Computing Machinery, 2018. <a href=\"https://doi.org/10.1145/3205455.3205548\">https://doi.org/10.1145/3205455.3205548</a>.","mla":"Bossek, Jakob, et al. “Local Search Effects in Bi-Objective Orienteering.” <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, Association for Computing Machinery, 2018, pp. 585–592, doi:<a href=\"https://doi.org/10.1145/3205455.3205548\">10.1145/3205455.3205548</a>.","bibtex":"@inproceedings{Bossek_Grimme_Meisel_Rudolph_Trautmann_2018, place={New York, NY, USA}, series={GECCO ’18}, title={Local Search Effects in Bi-Objective Orienteering}, DOI={<a href=\"https://doi.org/10.1145/3205455.3205548\">10.1145/3205455.3205548</a>}, booktitle={Proceedings of the Genetic and Evolutionary Computation Conference}, publisher={Association for Computing Machinery}, author={Bossek, Jakob and Grimme, Christian and Meisel, Stephan and Rudolph, Günter and Trautmann, Heike}, year={2018}, pages={585–592}, collection={GECCO ’18} }","ama":"Bossek J, Grimme C, Meisel S, Rudolph G, Trautmann H. Local Search Effects in Bi-Objective Orienteering. In: <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>. GECCO ’18. Association for Computing Machinery; 2018:585–592. doi:<a href=\"https://doi.org/10.1145/3205455.3205548\">10.1145/3205455.3205548</a>"},"language":[{"iso":"eng"}],"series_title":"GECCO ’18","doi":"10.1145/3205455.3205548","year":"2018","title":"Local Search Effects in Bi-Objective Orienteering","author":[{"full_name":"Bossek, Jakob","orcid":"0000-0002-4121-4668","last_name":"Bossek","first_name":"Jakob","id":"102979"},{"full_name":"Grimme, Christian","first_name":"Christian","last_name":"Grimme"},{"first_name":"Stephan","last_name":"Meisel","full_name":"Meisel, Stephan"},{"first_name":"Günter","last_name":"Rudolph","full_name":"Rudolph, Günter"},{"full_name":"Trautmann, Heike","last_name":"Trautmann","first_name":"Heike"}],"publication_identifier":{"isbn":["978-1-4503-5618-3"]},"date_updated":"2023-12-13T10:42:14Z","publication_status":"published","date_created":"2023-11-14T15:58:51Z","keyword":["combinatorial optimization","metaheuristics","multi-objective optimization","orienteering","transportation"],"type":"conference","department":[{"_id":"819"}],"publication":"Proceedings of the Genetic and Evolutionary Computation Conference","abstract":[{"text":"We analyze the effects of including local search techniques into a multi-objective evolutionary algorithm for solving a bi-objective orienteering problem with a single vehicle while the two conflicting objectives are minimization of travel time and maximization of the number of visited customer locations. Experiments are based on a large set of specifically designed problem instances with different characteristics and it is shown that local search techniques focusing on one of the objectives only improve the performance of the evolutionary algorithm in terms of both objectives. The analysis also shows that local search techniques are capable of sending locally optimal solutions to foremost fronts of the multi-objective optimization process, and that these solutions then become the leading factors of the evolutionary process.","lang":"eng"}],"extern":"1"},{"abstract":[{"lang":"eng","text":"The protection of information technology (IT) has become and is predicted to remain a key economic challenge for organizations. While research on IT security investment is fast growing, it lacks a theoretical basis for structuring research, explaining economic-technological phenomena and guide future research. We address this shortcoming by suggesting a new theoretical model emerging from a multi-theoretical perspective adopt-ing the Resource-Based View and the Organizational Learning Theory. The joint appli-cation of these theories allows to conceptualize in one theoretical model the organiza-tional learning effects that occur when the protection of organizational resources through IT security countermeasures develops over time. We use this model of IT security invest-ments to synthesize findings of a large body of literature and to derive research gaps. We also discuss managerial implications of (closing) these gaps by providing practical ex-amples."}],"extern":"1","publication":"International Conference on Information Systems","type":"conference","keyword":["Information Security","Investment","Literature review","Resource-based View","Organi-zational Learning Theory","Multi-theoretical Perspective"],"department":[{"_id":"277"}],"file":[{"file_id":"6038","content_type":"application/pdf","relation":"main_file","date_updated":"2018-12-13T15:09:32Z","file_name":"ICIS PROCEEDINGS PAPER - Security Investments.pdf","access_level":"open_access","file_size":958019,"date_created":"2018-12-07T11:45:31Z","creator":"hsiemes"}],"date_created":"2018-11-14T11:25:38Z","date_updated":"2022-01-06T07:02:03Z","title":"A Multi-Theoretical Literature Review on Information Security Investments using the Resource-Based View and the Organizational Learning Theory","year":"2015","author":[{"full_name":"Weishäupl, Eva","first_name":"Eva","last_name":"Weishäupl"},{"full_name":"Yasasin, Emrah","last_name":"Yasasin","first_name":"Emrah"},{"id":"72850","full_name":"Schryen, Guido","last_name":"Schryen","first_name":"Guido"}],"language":[{"iso":"eng"}],"file_date_updated":"2018-12-13T15:09:32Z","citation":{"short":"E. Weishäupl, E. Yasasin, G. Schryen, in: International Conference on Information Systems, 2015.","chicago":"Weishäupl, Eva, Emrah Yasasin, and Guido Schryen. “A Multi-Theoretical Literature Review on Information Security Investments Using the Resource-Based View and the Organizational Learning Theory.” In <i>International Conference on Information Systems</i>, 2015.","apa":"Weishäupl, E., Yasasin, E., &#38; Schryen, G. (2015). A Multi-Theoretical Literature Review on Information Security Investments using the Resource-Based View and the Organizational Learning Theory. In <i>International Conference on Information Systems</i>.","ieee":"E. Weishäupl, E. Yasasin, and G. Schryen, “A Multi-Theoretical Literature Review on Information Security Investments using the Resource-Based View and the Organizational Learning Theory,” in <i>International Conference on Information Systems</i>, 2015.","ama":"Weishäupl E, Yasasin E, Schryen G. A Multi-Theoretical Literature Review on Information Security Investments using the Resource-Based View and the Organizational Learning Theory. In: <i>International Conference on Information Systems</i>. ; 2015.","bibtex":"@inproceedings{Weishäupl_Yasasin_Schryen_2015, title={A Multi-Theoretical Literature Review on Information Security Investments using the Resource-Based View and the Organizational Learning Theory}, booktitle={International Conference on Information Systems}, author={Weishäupl, Eva and Yasasin, Emrah and Schryen, Guido}, year={2015} }","mla":"Weishäupl, Eva, et al. “A Multi-Theoretical Literature Review on Information Security Investments Using the Resource-Based View and the Organizational Learning Theory.” <i>International Conference on Information Systems</i>, 2015."},"oa":"1","has_accepted_license":"1","status":"public","ddc":["000"],"user_id":"61579","_id":"5588"},{"citation":{"apa":"Stille, K. S. C., Böcker, J., Bettentrup, R., &#38; Kaiser, I. (2015). Hierarchisches Optimierungskonzept für die Laststeuerung von Haushaltsgeräten. <i>ETG-Fachtagung “Von Smart Grids Zu Smart Markets.”</i>","ieee":"K. S. C. Stille, J. Böcker, R. Bettentrup, and I. Kaiser, “Hierarchisches Optimierungskonzept für die Laststeuerung von Haushaltsgeräten,” 2015.","chicago":"Stille, Karl Stephan Christian, Joachim Böcker, Ralf Bettentrup, and Ingo Kaiser. “Hierarchisches Optimierungskonzept Für Die Laststeuerung von Haushaltsgeräten.” In <i>ETG-Fachtagung “Von Smart Grids Zu Smart Markets.”</i> Kassel: VDE, 2015.","short":"K.S.C. Stille, J. Böcker, R. Bettentrup, I. Kaiser, in: ETG-Fachtagung “Von Smart Grids Zu Smart Markets,” VDE, Kassel, 2015.","mla":"Stille, Karl Stephan Christian, et al. “Hierarchisches Optimierungskonzept Für Die Laststeuerung von Haushaltsgeräten.” <i>ETG-Fachtagung “Von Smart Grids Zu Smart Markets,”</i> VDE, 2015.","ama":"Stille KSC, Böcker J, Bettentrup R, Kaiser I. Hierarchisches Optimierungskonzept für die Laststeuerung von Haushaltsgeräten. In: <i>ETG-Fachtagung “Von Smart Grids Zu Smart Markets.”</i> VDE; 2015.","bibtex":"@inproceedings{Stille_Böcker_Bettentrup_Kaiser_2015, place={Kassel}, title={Hierarchisches Optimierungskonzept für die Laststeuerung von Haushaltsgeräten}, booktitle={ETG-Fachtagung “Von Smart Grids zu Smart Markets”}, publisher={VDE}, author={Stille, Karl Stephan Christian and Böcker, Joachim and Bettentrup, Ralf and Kaiser, Ingo}, year={2015} }"},"publication":"ETG-Fachtagung \"Von Smart Grids zu Smart Markets\"","abstract":[{"lang":"eng","text":"Haushaltsgeräte aus der Klasse der \"Weißen Ware\" tragen mit etwa einem Drittel ($34,2%$ \\citeBDEW2013) zum privaten Energieverbrauch bei. Diese Veröffentlichung präsentiert eine Struktur und die dafür notwendige optimale Betriebsstrategie für Weiße Ware in einer Umgebung mit Strompreisen, die wegen der Volatilität der Regenerativen Energien stark fluktuieren. Das vorgeschlagene Konzept nutzt dafür ein dezentrales Energiemanagementsystem, das über drei Hierarchieebenen verteilt ist: die Geräteebene, die Haushaltsebene und die Ortsnetzebene. Auf der Geräteebene nutzt dieses Konzept zusätzlich Betriebsflexibilitäten der Haushaltsgeräte aus."}],"date_created":"2022-02-23T09:24:36Z","place":"Kassel","department":[{"_id":"52"}],"keyword":["Energy management","hybrid energy storage system","self-optimization","multi-objective optimization","adaptive systems","pareto set","SFB614-D1","SFB614-D2","LEA-Publikation","Eigene"],"type":"conference","author":[{"first_name":"Karl Stephan Christian","orcid":"0000-0002-4212-6555","last_name":"Stille","full_name":"Stille, Karl Stephan Christian","id":"30152"},{"full_name":"Böcker, Joachim","first_name":"Joachim","last_name":"Böcker","orcid":"0000-0002-8480-7295","id":"66"},{"last_name":"Bettentrup","first_name":"Ralf","full_name":"Bettentrup, Ralf"},{"full_name":"Kaiser, Ingo","first_name":"Ingo","last_name":"Kaiser"}],"status":"public","year":"2015","title":"Hierarchisches Optimierungskonzept für die Laststeuerung von Haushaltsgeräten","date_updated":"2022-02-23T16:10:58Z","publisher":"VDE","_id":"29973","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://www.vde-verlag.de/proceedings-en/453897045.html"}],"user_id":"66"}]