--- _id: '48853' abstract: - lang: eng text: In practise, it is often desirable to provide the decision-maker with a rich set of diverse solutions of decent quality instead of just a single solution. In this paper we study evolutionary diversity optimization for the knapsack problem (KP). Our goal is to evolve a population of solutions that all have a profit of at least (1 - {$ϵ$}) {$\cdot$} OPT, where OPT is the value of an optimal solution. Furthermore, they should differ in structure with respect to an entropy-based diversity measure. To this end we propose a simple ({$\mu$} + 1)-EA with initial approximate solutions calculated by a well-known FPTAS for the KP. We investigate the effect of different standard mutation operators and introduce biased mutation and crossover which puts strong probability on flipping bits of low and/or high frequency within the population. An experimental study on different instances and settings shows that the proposed mutation operators in most cases perform slightly inferior in the long term, but show strong benefits if the number of function evaluations is severely limited. author: - first_name: Jakob full_name: Bossek, Jakob id: '102979' last_name: Bossek orcid: 0000-0002-4121-4668 - first_name: Aneta full_name: Neumann, Aneta last_name: Neumann - first_name: Frank full_name: Neumann, Frank last_name: Neumann citation: ama: 'Bossek J, Neumann A, Neumann F. Breeding Diverse Packings for the Knapsack Problem by Means of Diversity-Tailored Evolutionary Algorithms. In: Proceedings of the Genetic and Evolutionary Computation Conference. GECCO ’21. Association for Computing Machinery; 2021:556–564. doi:10.1145/3449639.3459364' apa: Bossek, J., Neumann, A., & Neumann, F. (2021). Breeding Diverse Packings for the Knapsack Problem by Means of Diversity-Tailored Evolutionary Algorithms. Proceedings of the Genetic and Evolutionary Computation Conference, 556–564. https://doi.org/10.1145/3449639.3459364 bibtex: '@inproceedings{Bossek_Neumann_Neumann_2021, place={New York, NY, USA}, series={GECCO ’21}, title={Breeding Diverse Packings for the Knapsack Problem by Means of Diversity-Tailored Evolutionary Algorithms}, DOI={10.1145/3449639.3459364}, booktitle={Proceedings of the Genetic and Evolutionary Computation Conference}, publisher={Association for Computing Machinery}, author={Bossek, Jakob and Neumann, Aneta and Neumann, Frank}, year={2021}, pages={556–564}, collection={GECCO ’21} }' chicago: 'Bossek, Jakob, Aneta Neumann, and Frank Neumann. “Breeding Diverse Packings for the Knapsack Problem by Means of Diversity-Tailored Evolutionary Algorithms.” In Proceedings of the Genetic and Evolutionary Computation Conference, 556–564. GECCO ’21. New York, NY, USA: Association for Computing Machinery, 2021. https://doi.org/10.1145/3449639.3459364.' ieee: 'J. Bossek, A. Neumann, and F. Neumann, “Breeding Diverse Packings for the Knapsack Problem by Means of Diversity-Tailored Evolutionary Algorithms,” in Proceedings of the Genetic and Evolutionary Computation Conference, 2021, pp. 556–564, doi: 10.1145/3449639.3459364.' mla: Bossek, Jakob, et al. “Breeding Diverse Packings for the Knapsack Problem by Means of Diversity-Tailored Evolutionary Algorithms.” Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, 2021, pp. 556–564, doi:10.1145/3449639.3459364. short: 'J. Bossek, A. Neumann, F. Neumann, in: Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, New York, NY, USA, 2021, pp. 556–564.' date_created: 2023-11-14T15:58:54Z date_updated: 2023-12-13T10:45:22Z department: - _id: '819' doi: 10.1145/3449639.3459364 extern: '1' keyword: - evolutionary algorithms - evolutionary diversity optimization - knapsack problem - tailored operators language: - iso: eng page: 556–564 place: New York, NY, USA publication: Proceedings of the Genetic and Evolutionary Computation Conference publication_identifier: isbn: - 978-1-4503-8350-9 publication_status: published publisher: Association for Computing Machinery series_title: GECCO ’21 status: public title: Breeding Diverse Packings for the Knapsack Problem by Means of Diversity-Tailored Evolutionary Algorithms type: conference user_id: '102979' year: '2021' ... --- _id: '48860' abstract: - lang: eng text: In the area of evolutionary computation the calculation of diverse sets of high-quality solutions to a given optimization problem has gained momentum in recent years under the term evolutionary diversity optimization. Theoretical insights into the working principles of baseline evolutionary algorithms for diversity optimization are still rare. In this paper we study the well-known Minimum Spanning Tree problem (MST) in the context of diversity optimization where population diversity is measured by the sum of pairwise edge overlaps. Theoretical results provide insights into the fitness landscape of the MST diversity optimization problem pointing out that even for a population of {$\mu$} = 2 fitness plateaus (of constant length) can be reached, but nevertheless diverse sets can be calculated in polynomial time. We supplement our theoretical results with a series of experiments for the unconstrained and constraint case where all solutions need to fulfill a minimal quality threshold. Our results show that a simple ({$\mu$} + 1)-EA can effectively compute a diversified population of spanning trees of high quality. author: - first_name: Jakob full_name: Bossek, Jakob id: '102979' last_name: Bossek orcid: 0000-0002-4121-4668 - first_name: Frank full_name: Neumann, Frank last_name: Neumann citation: ama: 'Bossek J, Neumann F. Evolutionary Diversity Optimization and the Minimum Spanning Tree Problem. In: Proceedings of the Genetic and Evolutionary Computation Conference. GECCO ’21. Association for Computing Machinery; 2021:198–206. doi:10.1145/3449639.3459363' apa: Bossek, J., & Neumann, F. (2021). Evolutionary Diversity Optimization and the Minimum Spanning Tree Problem. Proceedings of the Genetic and Evolutionary Computation Conference, 198–206. https://doi.org/10.1145/3449639.3459363 bibtex: '@inproceedings{Bossek_Neumann_2021, place={New York, NY, USA}, series={GECCO ’21}, title={Evolutionary Diversity Optimization and the Minimum Spanning Tree Problem}, DOI={10.1145/3449639.3459363}, booktitle={Proceedings of the Genetic and Evolutionary Computation Conference}, publisher={Association for Computing Machinery}, author={Bossek, Jakob and Neumann, Frank}, year={2021}, pages={198–206}, collection={GECCO ’21} }' chicago: 'Bossek, Jakob, and Frank Neumann. “Evolutionary Diversity Optimization and the Minimum Spanning Tree Problem.” In Proceedings of the Genetic and Evolutionary Computation Conference, 198–206. GECCO ’21. New York, NY, USA: Association for Computing Machinery, 2021. https://doi.org/10.1145/3449639.3459363.' ieee: 'J. Bossek and F. Neumann, “Evolutionary Diversity Optimization and the Minimum Spanning Tree Problem,” in Proceedings of the Genetic and Evolutionary Computation Conference, 2021, pp. 198–206, doi: 10.1145/3449639.3459363.' mla: Bossek, Jakob, and Frank Neumann. “Evolutionary Diversity Optimization and the Minimum Spanning Tree Problem.” Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, 2021, pp. 198–206, doi:10.1145/3449639.3459363. short: 'J. Bossek, F. Neumann, in: Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, New York, NY, USA, 2021, pp. 198–206.' date_created: 2023-11-14T15:58:55Z date_updated: 2023-12-13T10:45:37Z department: - _id: '819' doi: 10.1145/3449639.3459363 extern: '1' keyword: - evolutionary algorithms - evolutionary diversity optimization - minimum spanning tree - runtime analysis language: - iso: eng page: 198–206 place: New York, NY, USA publication: Proceedings of the Genetic and Evolutionary Computation Conference publication_identifier: isbn: - 978-1-4503-8350-9 publication_status: published publisher: Association for Computing Machinery series_title: GECCO ’21 status: public title: Evolutionary Diversity Optimization and the Minimum Spanning Tree Problem type: conference user_id: '102979' year: '2021' ... --- _id: '48854' abstract: - lang: eng text: We contribute to the theoretical understanding of randomized search heuristics for dynamic problems. We consider the classical vertex coloring problem on graphs and investigate the dynamic setting where edges are added to the current graph. We then analyze the expected time for randomized search heuristics to recompute high quality solutions. The (1+1) Evolutionary Algorithm and RLS operate in a setting where the number of colors is bounded and we are minimizing the number of conflicts. Iterated local search algorithms use an unbounded color palette and aim to use the smallest colors and, consequently, the smallest number of colors. We identify classes of bipartite graphs where reoptimization is as hard as or even harder than optimization from scratch, i.e., starting with a random initialization. Even adding a single edge can lead to hard symmetry problems. However, graph classes that are hard for one algorithm turn out to be easy for others. In most cases our bounds show that reoptimization is faster than optimizing from scratch. We further show that tailoring mutation operators to parts of the graph where changes have occurred can significantly reduce the expected reoptimization time. In most settings the expected reoptimization time for such tailored algorithms is linear in the number of added edges. However, tailored algorithms cannot prevent exponential times in settings where the original algorithm is inefficient. author: - first_name: Jakob full_name: Bossek, Jakob id: '102979' last_name: Bossek orcid: 0000-0002-4121-4668 - first_name: Frank full_name: Neumann, Frank last_name: Neumann - first_name: Pan full_name: Peng, Pan last_name: Peng - first_name: Dirk full_name: Sudholt, Dirk last_name: Sudholt citation: ama: Bossek J, Neumann F, Peng P, Sudholt D. Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem. Algorithmica. 2021;83(10):3148–3179. doi:10.1007/s00453-021-00838-3 apa: Bossek, J., Neumann, F., Peng, P., & Sudholt, D. (2021). Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem. Algorithmica, 83(10), 3148–3179. https://doi.org/10.1007/s00453-021-00838-3 bibtex: '@article{Bossek_Neumann_Peng_Sudholt_2021, title={Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem}, volume={83}, DOI={10.1007/s00453-021-00838-3}, number={10}, journal={Algorithmica}, author={Bossek, Jakob and Neumann, Frank and Peng, Pan and Sudholt, Dirk}, year={2021}, pages={3148–3179} }' chicago: 'Bossek, Jakob, Frank Neumann, Pan Peng, and Dirk Sudholt. “Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem.” Algorithmica 83, no. 10 (2021): 3148–3179. https://doi.org/10.1007/s00453-021-00838-3.' ieee: 'J. Bossek, F. Neumann, P. Peng, and D. Sudholt, “Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem,” Algorithmica, vol. 83, no. 10, pp. 3148–3179, 2021, doi: 10.1007/s00453-021-00838-3.' mla: Bossek, Jakob, et al. “Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem.” Algorithmica, vol. 83, no. 10, 2021, pp. 3148–3179, doi:10.1007/s00453-021-00838-3. short: J. Bossek, F. Neumann, P. Peng, D. Sudholt, Algorithmica 83 (2021) 3148–3179. date_created: 2023-11-14T15:58:54Z date_updated: 2023-12-13T10:51:34Z department: - _id: '819' doi: 10.1007/s00453-021-00838-3 intvolume: ' 83' issue: '10' keyword: - Dynamic optimization - Evolutionary algorithms - Running time analysis language: - iso: eng page: 3148–3179 publication: Algorithmica publication_identifier: issn: - 0178-4617 status: public title: Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem type: journal_article user_id: '102979' volume: 83 year: '2021' ... --- _id: '19609' abstract: - lang: eng text: "Modern services comprise interconnected components,\r\ne.g., microservices in a service mesh, that can scale and\r\nrun on multiple nodes across the network on demand. To process\r\nincoming traffic, service components have to be instantiated and\r\ntraffic assigned to these instances, taking capacities and changing\r\ndemands into account. This challenge is usually solved with\r\ncustom approaches designed by experts. While this typically\r\nworks well for the considered scenario, the models often rely\r\non unrealistic assumptions or on knowledge that is not available\r\nin practice (e.g., a priori knowledge).\r\n\r\nWe propose a novel deep reinforcement learning approach that\r\nlearns how to best coordinate services and is geared towards\r\nrealistic assumptions. It interacts with the network and relies on\r\navailable, possibly delayed monitoring information. Rather than\r\ndefining a complex model or an algorithm how to achieve an\r\nobjective, our model-free approach adapts to various objectives\r\nand traffic patterns. An agent is trained offline without expert\r\nknowledge and then applied online with minimal overhead. Compared\r\nto a state-of-the-art heuristic, it significantly improves flow\r\nthroughput and overall network utility on real-world network\r\ntopologies and traffic traces. It also learns to optimize different\r\nobjectives, generalizes to scenarios with unseen, stochastic traffic\r\npatterns, and scales to large real-world networks." author: - first_name: Stefan Balthasar full_name: Schneider, Stefan Balthasar id: '35343' last_name: Schneider orcid: 0000-0001-8210-4011 - first_name: Adnan full_name: Manzoor, Adnan last_name: Manzoor - first_name: Haydar full_name: Qarawlus, Haydar last_name: Qarawlus - first_name: Rafael full_name: Schellenberg, Rafael last_name: Schellenberg - first_name: Holger full_name: Karl, Holger id: '126' last_name: Karl - first_name: Ramin full_name: Khalili, Ramin last_name: Khalili - first_name: Artur full_name: Hecker, Artur last_name: Hecker citation: ama: 'Schneider SB, Manzoor A, Qarawlus H, et al. Self-Driving Network and Service Coordination Using Deep Reinforcement Learning. In: IEEE International Conference on Network and Service Management (CNSM). IEEE; 2020.' apa: Schneider, S. B., Manzoor, A., Qarawlus, H., Schellenberg, R., Karl, H., Khalili, R., & Hecker, A. (2020). Self-Driving Network and Service Coordination Using Deep Reinforcement Learning. In IEEE International Conference on Network and Service Management (CNSM). IEEE. bibtex: '@inproceedings{Schneider_Manzoor_Qarawlus_Schellenberg_Karl_Khalili_Hecker_2020, title={Self-Driving Network and Service Coordination Using Deep Reinforcement Learning}, booktitle={IEEE International Conference on Network and Service Management (CNSM)}, publisher={IEEE}, author={Schneider, Stefan Balthasar and Manzoor, Adnan and Qarawlus, Haydar and Schellenberg, Rafael and Karl, Holger and Khalili, Ramin and Hecker, Artur}, year={2020} }' chicago: Schneider, Stefan Balthasar, Adnan Manzoor, Haydar Qarawlus, Rafael Schellenberg, Holger Karl, Ramin Khalili, and Artur Hecker. “Self-Driving Network and Service Coordination Using Deep Reinforcement Learning.” In IEEE International Conference on Network and Service Management (CNSM). IEEE, 2020. ieee: S. B. Schneider et al., “Self-Driving Network and Service Coordination Using Deep Reinforcement Learning,” in IEEE International Conference on Network and Service Management (CNSM), 2020. mla: Schneider, Stefan Balthasar, et al. “Self-Driving Network and Service Coordination Using Deep Reinforcement Learning.” IEEE International Conference on Network and Service Management (CNSM), IEEE, 2020. short: 'S.B. Schneider, A. Manzoor, H. Qarawlus, R. Schellenberg, H. Karl, R. Khalili, A. Hecker, in: IEEE International Conference on Network and Service Management (CNSM), IEEE, 2020.' date_created: 2020-09-22T06:28:22Z date_updated: 2022-01-06T06:54:08Z ddc: - '006' department: - _id: '75' file: - access_level: open_access content_type: application/pdf creator: stschn date_created: 2020-09-22T06:29:16Z date_updated: 2020-09-22T06:36:00Z file_id: '19610' file_name: ris_with_copyright.pdf file_size: 642999 relation: main_file file_date_updated: 2020-09-22T06:36:00Z has_accepted_license: '1' keyword: - self-driving networks - self-learning - network coordination - service coordination - reinforcement learning - deep learning - nfv language: - iso: eng oa: '1' project: - _id: '1' name: SFB 901 - _id: '4' name: SFB 901 - Project Area C - _id: '16' name: SFB 901 - Subproject C4 publication: IEEE International Conference on Network and Service Management (CNSM) publisher: IEEE status: public title: Self-Driving Network and Service Coordination Using Deep Reinforcement Learning type: conference user_id: '35343' year: '2020' ... --- _id: '19976' abstract: - lang: eng text: The aim to reduce pollutant emission has led to a trend towards lightweight construction in car body development during the last years. As a consequence of the resulting need for multi-material design, mechanical joining technologies become increasingly important. Mechanical joining allows for the combination of dissimilar materials, while thermic joining techniques reach their limits. Self-piercing riveting enables the joining of dissimilar materials by using semi-tubular rivets as mechanical fasteners. The rivet production, however, is costly and time-consuming, as the rivets generally have to be hardened, tempered and coated after forming, in order to achieve an adequate strength and corrosion resistance. A promising approach to improve the efficiency of the rivet manufacturing is the use of high-strength high nitrogen steel as rivet material because these additional process steps would not be necessary anymore. As a result of the comparatively high nitrogen content, such steels have various beneficial properties like higher strength, good ductility and improved corrosion resistance. By cold bulk forming of high nitrogen steels high-strength parts can be manufactured due to the strengthening which is caused by the high strain hardening. However, high tool loads thereby have to be expected and are a major challenge during the production process. Consequently, there is a need for appropriate forming strategies. This paper presents key aspects concerning the process design for the manufacturing of semi-tubular self-piercing rivets made of high-strength steel. The aim is to produce the rivets in several forming stages without intermediate heat treatment between the single stages. Due to the high strain hardening of the material, a two stage forming concept will be investigated. Cup-backward extrusion is chosen as the first process step in order to form the rivet shank without forming the rivet foot. Thus, the strain hardening effects in the area of the rivet foot are minimized and the tool loads during the following process step can be reduced. During the second and final forming stage the detailed geometry of the rivet foot and the rivet head is formed. In this context, the effect of different variations, for example concerning the final geometry of the rivet foot, on the tool load is investigated using multistage numerical analysis. Furthermore, the influence of the process temperature on occurring stresses is analysed. Based on the results of the investigations, an adequate forming strategy and a tool concept for the manufacturing of semi-tubular self-piercing rivets made of high-strength steel are presented. citation: ama: Kuball C-M, Uhe B, Meschut G, Merklein M, eds. Process Design for the Forming of Semi-Tubular Self-Piercing Rivets Made of High Nitrogen Steel. Vol 50.; 2020:280-285. doi:10.1016/j.promfg.2020.08.052 apa: Kuball, C.-M., Uhe, B., Meschut, G., & Merklein, M. (Eds.). (2020). Process design for the forming of semi-tubular self-piercing rivets made of high nitrogen steel (Vol. 50, pp. 280–285). https://doi.org/10.1016/j.promfg.2020.08.052 bibtex: '@book{Kuball_Uhe_Meschut_Merklein_2020, series={Procedia Manufacturing}, title={Process design for the forming of semi-tubular self-piercing rivets made of high nitrogen steel}, volume={50}, DOI={10.1016/j.promfg.2020.08.052}, year={2020}, pages={280–285}, collection={Procedia Manufacturing} }' chicago: Kuball, Clara-Maria, Benedikt Uhe, Gerson Meschut, and Marion Merklein, eds. Process Design for the Forming of Semi-Tubular Self-Piercing Rivets Made of High Nitrogen Steel. Vol. 50. Procedia Manufacturing, 2020. https://doi.org/10.1016/j.promfg.2020.08.052. ieee: C.-M. Kuball, B. Uhe, G. Meschut, and M. Merklein, Eds., Process design for the forming of semi-tubular self-piercing rivets made of high nitrogen steel, vol. 50. 2020, pp. 280–285. mla: Kuball, Clara-Maria, et al., editors. Process Design for the Forming of Semi-Tubular Self-Piercing Rivets Made of High Nitrogen Steel. Vol. 50, 2020, pp. 280–85, doi:10.1016/j.promfg.2020.08.052. short: C.-M. Kuball, B. Uhe, G. Meschut, M. Merklein, eds., Process Design for the Forming of Semi-Tubular Self-Piercing Rivets Made of High Nitrogen Steel, 2020. date_created: 2020-10-12T08:30:08Z date_updated: 2022-01-06T06:54:17Z department: - _id: '157' doi: 10.1016/j.promfg.2020.08.052 editor: - first_name: Clara-Maria full_name: Kuball, Clara-Maria last_name: Kuball - first_name: Benedikt full_name: Uhe, Benedikt id: '38131' last_name: Uhe - first_name: Gerson full_name: Meschut, Gerson id: '32056' last_name: Meschut orcid: 0000-0002-2763-1246 - first_name: Marion full_name: Merklein, Marion last_name: Merklein intvolume: ' 50' keyword: - high nitrogen steel - self-piercing riveting - joining by forming - bulk forming - tool design language: - iso: eng page: 280-285 publication_status: published quality_controlled: '1' series_title: Procedia Manufacturing status: public title: Process design for the forming of semi-tubular self-piercing rivets made of high nitrogen steel type: conference_editor user_id: '38131' volume: 50 year: '2020' ... --- _id: '17370' 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." author: - first_name: Jannik full_name: Castenow, Jannik id: '38705' last_name: Castenow - first_name: Björn full_name: Feldkord, Björn id: '22704' last_name: Feldkord - first_name: Till full_name: Knollmann, Till id: '39241' last_name: Knollmann orcid: 0000-0003-2014-4696 - first_name: Manuel full_name: Malatyali, Manuel last_name: Malatyali - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: 'Castenow J, Feldkord B, Knollmann T, Malatyali M, Meyer auf der Heide F. The Online Multi-Commodity Facility Location Problem. In: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures. ; 2020. doi:10.1145/3350755.3400281' apa: Castenow, J., Feldkord, B., Knollmann, T., Malatyali, M., & Meyer auf der Heide, F. (2020). The Online Multi-Commodity Facility Location Problem. In Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures. https://doi.org/10.1145/3350755.3400281 bibtex: '@inproceedings{Castenow_Feldkord_Knollmann_Malatyali_Meyer auf der Heide_2020, title={The Online Multi-Commodity Facility Location Problem}, DOI={10.1145/3350755.3400281}, 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} }' chicago: Castenow, Jannik, Björn Feldkord, Till Knollmann, Manuel Malatyali, and Friedhelm Meyer auf der Heide. “The Online Multi-Commodity Facility Location Problem.” In Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020. https://doi.org/10.1145/3350755.3400281. ieee: J. Castenow, B. Feldkord, T. Knollmann, M. Malatyali, and F. Meyer auf der Heide, “The Online Multi-Commodity Facility Location Problem,” in Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020. mla: Castenow, Jannik, et al. “The Online Multi-Commodity Facility Location Problem.” Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020, doi:10.1145/3350755.3400281. 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.' date_created: 2020-07-14T07:53:20Z date_updated: 2022-01-06T06:53:10Z ddc: - '000' department: - _id: '63' doi: 10.1145/3350755.3400281 external_id: arxiv: - '2005.08391' file: - access_level: closed content_type: application/pdf creator: tillk date_created: 2020-07-14T07:56:52Z date_updated: 2020-07-14T07:56:52Z file_id: '17373' file_name: 3350755.3400281.pdf file_size: 1271416 relation: main_file success: 1 file_date_updated: 2020-07-14T07:56:52Z has_accepted_license: '1' keyword: - Online Multi-Commodity Facility Location - Competitive Ratio - Online Optimization - Facility Location Problem language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 publication: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures publication_identifier: isbn: - '9781450369350' publication_status: published status: public title: The Online Multi-Commodity Facility Location Problem type: conference user_id: '39241' year: '2020' ... --- _id: '20143' author: - first_name: Mortaza full_name: Otroshi, Mortaza id: '71269' last_name: Otroshi orcid: 0000-0002-8652-9209 - first_name: Moritz full_name: Rossel, Moritz last_name: Rossel - first_name: Gerson full_name: Meschut, Gerson id: '32056' last_name: Meschut orcid: 0000-0002-2763-1246 citation: ama: Otroshi M, Rossel M, Meschut G. Stress state dependent damage modeling of self-pierce riveting process simulation using GISSMO damage model. Journal of Advanced Joining Processes. 2020;1. doi:10.1016/j.jajp.2020.100015 apa: Otroshi, M., Rossel, M., & Meschut, G. (2020). Stress state dependent damage modeling of self-pierce riveting process simulation using GISSMO damage model. Journal of Advanced Joining Processes, 1. https://doi.org/10.1016/j.jajp.2020.100015 bibtex: '@article{Otroshi_Rossel_Meschut_2020, title={Stress state dependent damage modeling of self-pierce riveting process simulation using GISSMO damage model}, volume={1}, DOI={10.1016/j.jajp.2020.100015}, journal={Journal of Advanced Joining Processes}, publisher={Elsevier}, author={Otroshi, Mortaza and Rossel, Moritz and Meschut, Gerson}, year={2020} }' chicago: Otroshi, Mortaza, Moritz Rossel, and Gerson Meschut. “Stress State Dependent Damage Modeling of Self-Pierce Riveting Process Simulation Using GISSMO Damage Model.” Journal of Advanced Joining Processes 1 (2020). https://doi.org/10.1016/j.jajp.2020.100015. ieee: 'M. Otroshi, M. Rossel, and G. Meschut, “Stress state dependent damage modeling of self-pierce riveting process simulation using GISSMO damage model,” Journal of Advanced Joining Processes, vol. 1, 2020, doi: 10.1016/j.jajp.2020.100015.' mla: Otroshi, Mortaza, et al. “Stress State Dependent Damage Modeling of Self-Pierce Riveting Process Simulation Using GISSMO Damage Model.” Journal of Advanced Joining Processes, vol. 1, Elsevier, 2020, doi:10.1016/j.jajp.2020.100015. short: M. Otroshi, M. Rossel, G. Meschut, Journal of Advanced Joining Processes 1 (2020). date_created: 2020-10-20T14:49:15Z date_updated: 2022-04-25T07:49:50Z department: - _id: '157' doi: 10.1016/j.jajp.2020.100015 intvolume: ' 1' keyword: - Self-pierce riveting - Ductile fracture - Damage modeling - GISSMO damage model language: - iso: eng main_file_link: - open_access: '1' oa: '1' publication: Journal of Advanced Joining Processes publisher: Elsevier quality_controlled: '1' status: public title: Stress state dependent damage modeling of self-pierce riveting process simulation using GISSMO damage model type: journal_article user_id: '71269' volume: 1 year: '2020' ... --- _id: '35298' abstract: - lang: ger text: Im Artikel werden drei verschiedene Lernzugänge (kom-petenzorientiertes, ästhetisches und biographisches Lernen) vorgestellt und aus theoretischer Perspektive deren motivierender Gehalt für selbstreguliertes Lernen in Praxisphasen des Lehramtsstudiumsherausgearbeitet. Als theoretische Grund-lage dient die Selbstbestimmungstheorie als zentrale motivationale Theorie zur Erklärung selbstbestimmten Handelns. - lang: eng text: The article addresses how motivational learning approaches (competency-oriented, aesthetic and biographical) can contribute to the professionalization of preservice teachers during a long-term internship. As a theoretical basis, the self-determination theory serves as a central motivational theory for explaining self-determined action. alternative_title: - Ein Blick auf kompetenzorientiertes, ästhetisches und biographisches Lernen im Lehramtsstudium author: - first_name: Carina full_name: Caruso, Carina id: '23123' last_name: Caruso - first_name: Christine full_name: Adammek, Christine last_name: Adammek - first_name: Sabrina full_name: Bonanati, Sabrina last_name: Bonanati - first_name: Sybille full_name: Wiescholek, Sybille last_name: Wiescholek citation: ama: Caruso C, Adammek C, Bonanati S, Wiescholek S. Motivierende Lernzugänge als Ausgangspunkt der Professionalisierung angehender Lehrer_innen. Herausforderung Lehrer*innenbildung - Zeitschrift Zur Konzeption, Gestaltung Und Diskussion. 2020;3(1):18-33. doi:10.4119/hlz-2540 apa: Caruso, C., Adammek, C., Bonanati, S., & Wiescholek, S. (2020). Motivierende Lernzugänge als Ausgangspunkt der Professionalisierung angehender Lehrer_innen. Herausforderung Lehrer*innenbildung - Zeitschrift Zur Konzeption, Gestaltung Und Diskussion, 3(1), 18–33. https://doi.org/10.4119/hlz-2540 bibtex: '@article{Caruso_Adammek_Bonanati_Wiescholek_2020, title={Motivierende Lernzugänge als Ausgangspunkt der Professionalisierung angehender Lehrer_innen}, volume={3}, DOI={10.4119/hlz-2540}, number={1}, journal={Herausforderung Lehrer*innenbildung - Zeitschrift Zur Konzeption, Gestaltung Und Diskussion}, author={Caruso, Carina and Adammek, Christine and Bonanati, Sabrina and Wiescholek, Sybille}, year={2020}, pages={18–33} }' chicago: 'Caruso, Carina, Christine Adammek, Sabrina Bonanati, and Sybille Wiescholek. “Motivierende Lernzugänge als Ausgangspunkt der Professionalisierung angehender Lehrer_innen.” Herausforderung Lehrer*innenbildung - Zeitschrift Zur Konzeption, Gestaltung Und Diskussion 3, no. 1 (2020): 18–33. https://doi.org/10.4119/hlz-2540.' ieee: 'C. Caruso, C. Adammek, S. Bonanati, and S. Wiescholek, “Motivierende Lernzugänge als Ausgangspunkt der Professionalisierung angehender Lehrer_innen,” Herausforderung Lehrer*innenbildung - Zeitschrift Zur Konzeption, Gestaltung Und Diskussion, vol. 3, no. 1, pp. 18–33, 2020, doi: 10.4119/hlz-2540.' mla: Caruso, Carina, et al. “Motivierende Lernzugänge als Ausgangspunkt der Professionalisierung angehender Lehrer_innen.” Herausforderung Lehrer*innenbildung - Zeitschrift Zur Konzeption, Gestaltung Und Diskussion, vol. 3, no. 1, 2020, pp. 18–33, doi:10.4119/hlz-2540. short: C. Caruso, C. Adammek, S. Bonanati, S. Wiescholek, Herausforderung Lehrer*innenbildung - Zeitschrift Zur Konzeption, Gestaltung Und Diskussion 3 (2020) 18–33. date_created: 2023-01-05T13:58:28Z date_updated: 2023-01-06T12:18:16Z doi: 10.4119/hlz-2540 intvolume: ' 3' issue: '1' keyword: - ästhetische Forschung - Biographiearbeit - Praxissemester - Professionalisierung - selbstreguliertes Lernen - Motivation / aesthetic research - biographical work - long-term internship - profes-sionalization - self-regulated learning - motivation language: - iso: other page: 18-33 publication: Herausforderung Lehrer*innenbildung - Zeitschrift Zur Konzeption, Gestaltung Und Diskussion publication_identifier: issn: - 2625-0675 publication_status: published status: public title: Motivierende Lernzugänge als Ausgangspunkt der Professionalisierung angehender Lehrer_innen type: journal_article user_id: '86519' volume: 3 year: '2020' ... --- _id: '33866' abstract: - lang: eng text: Helhmoltz–Kirchhoff equations of motions of vortices of an incompressible fluid in the plane define a dynamics with singularities and this leads to a Zermelo navigation problem describing the ship travel in such a field where the control is the heading angle. Considering one vortex, we define a time minimization problem which can be analyzed with the technics of geometric optimal control combined with numerical simulations, the geometric frame being the extension of Randers metrics in the punctured plane, with rotational symmetry. Candidates as minimizers are parameterized thanks to the Pontryagin Maximum Principle as extremal solutions of a Hamiltonian vector field. We analyze the time minimal solution to transfer the ship between two points where during the transfer the ship can be either in a strong current region in the vicinity of the vortex or in a weak current region. The analysis is based on a micro-local classification of the extremals using mainly the integrability properties of the dynamics due to the rotational symmetry. The discussion is complex and related to the existence of an isolated extremal (Reeb) circle due to the vortex singularity. The explicit computation of cut points where the extremal curves cease to be optimal is given and the spheres are described in the case where at the initial point the current is weak. article_number: S10 author: - first_name: Bernard full_name: Bonnard, Bernard last_name: Bonnard - first_name: Olivier full_name: Cots, Olivier last_name: Cots - first_name: Boris Edgar full_name: Wembe Moafo, Boris Edgar id: '95394' last_name: Wembe Moafo citation: ama: 'Bonnard B, Cots O, Wembe Moafo BE. A Zermelo navigation problem with a vortex singularity. ESAIM: Control, Optimisation and Calculus of Variations. 2020;27. doi:10.1051/cocv/2020058' apa: 'Bonnard, B., Cots, O., & Wembe Moafo, B. E. (2020). A Zermelo navigation problem with a vortex singularity. ESAIM: Control, Optimisation and Calculus of Variations, 27, Article S10. https://doi.org/10.1051/cocv/2020058' bibtex: '@article{Bonnard_Cots_Wembe Moafo_2020, title={A Zermelo navigation problem with a vortex singularity}, volume={27}, DOI={10.1051/cocv/2020058}, number={S10}, journal={ESAIM: Control, Optimisation and Calculus of Variations}, publisher={EDP Sciences}, author={Bonnard, Bernard and Cots, Olivier and Wembe Moafo, Boris Edgar}, year={2020} }' chicago: 'Bonnard, Bernard, Olivier Cots, and Boris Edgar Wembe Moafo. “A Zermelo Navigation Problem with a Vortex Singularity.” ESAIM: Control, Optimisation and Calculus of Variations 27 (2020). https://doi.org/10.1051/cocv/2020058.' ieee: 'B. Bonnard, O. Cots, and B. E. Wembe Moafo, “A Zermelo navigation problem with a vortex singularity,” ESAIM: Control, Optimisation and Calculus of Variations, vol. 27, Art. no. S10, 2020, doi: 10.1051/cocv/2020058.' mla: 'Bonnard, Bernard, et al. “A Zermelo Navigation Problem with a Vortex Singularity.” ESAIM: Control, Optimisation and Calculus of Variations, vol. 27, S10, EDP Sciences, 2020, doi:10.1051/cocv/2020058.' short: 'B. Bonnard, O. Cots, B.E. Wembe Moafo, ESAIM: Control, Optimisation and Calculus of Variations 27 (2020).' date_created: 2022-10-24T12:51:05Z date_updated: 2023-01-16T12:09:22Z doi: 10.1051/cocv/2020058 intvolume: ' 27' keyword: - Computational Mathematics - Control and Optimization - Control and Systems Engineering language: - iso: eng publication: 'ESAIM: Control, Optimisation and Calculus of Variations' publication_identifier: issn: - 1292-8119 - 1262-3377 publication_status: published publisher: EDP Sciences status: public title: A Zermelo navigation problem with a vortex singularity type: journal_article user_id: '95394' volume: 27 year: '2020' ... --- _id: '19974' abstract: - lang: eng text: Due to the trend towards lightweight design in car body development mechanical joining technologies become increasingly important. These techniques allow for the joining of dissimilar materials and thus enable multi-material design, while thermic joining methods reach their limits. Semi-tubular self-piercing riveting is an important mechanical joining technology. The rivet production, however, is costly and time-consuming, as the process consists of several process steps including the heat treatment and coating of the rivets in order to achieve an adequate strength and corrosion resistance. The use of high nitrogen steel as rivet material leads to the possibility of reducing process steps and hence increasing the efficiency of the process. However, the high tool loads being expected due to the high strain hardening of the material are a major challenge during the rivet production. Thus, there is a need for appropriate forming strategies, such as the manufacturing of the rivets at elevated temperatures. Prior investigations led to the conclusion that forming already at 200 °C results in a distinct reduction of the yield strength. To create a deeper understanding of the forming behaviour of high nitrogen steel at elevated temperatures, compression tests were conducted in a temperature range between room temperature and 200 °C. The determined true stress – true strain curves are the basis for the further process and tool design of the rivet production. Another key factor for the rivet manufacturing at elevated temperatures is the influence of the process temperature on the tribological conditions. For this reason, ring compression tests at room temperature and 200 °C are carried out. The friction factors are determined on the basis of calibration curves resulting from the numerical analysis of the ring compression process. The investigations indicate that the friction factor at 200 °C is significantly higher compared to room temperature. This essential fact has to be taken into account for the process and tool design for the rivet production using high nitrogen steel. article_number: '100023' citation: ama: Kuball C-M, Jung R, Uhe B, Meschut G, Merklein M, eds. Influence of the Process Temperature on the Forming Behaviour and the Friction during Bulk Forming of High Nitrogen Steel. Vol 1.; 2020. doi:10.1016/j.jajp.2020.100023 apa: Kuball, C.-M., Jung, R., Uhe, B., Meschut, G., & Merklein, M. (Eds.). (2020). Influence of the process temperature on the forming behaviour and the friction during bulk forming of high nitrogen steel (No. 100023; Vol. 1). https://doi.org/10.1016/j.jajp.2020.100023 bibtex: '@book{Kuball_Jung_Uhe_Meschut_Merklein_2020, series={Journal of Advanced Joining Processes}, title={Influence of the process temperature on the forming behaviour and the friction during bulk forming of high nitrogen steel}, volume={1}, DOI={10.1016/j.jajp.2020.100023}, number={100023}, year={2020}, collection={Journal of Advanced Joining Processes} }' chicago: Kuball, Clara-Maria, R Jung, Benedikt Uhe, Gerson Meschut, and Marion Merklein, eds. Influence of the Process Temperature on the Forming Behaviour and the Friction during Bulk Forming of High Nitrogen Steel. Vol. 1. Journal of Advanced Joining Processes, 2020. https://doi.org/10.1016/j.jajp.2020.100023. ieee: C.-M. Kuball, R. Jung, B. Uhe, G. Meschut, and M. Merklein, Eds., Influence of the process temperature on the forming behaviour and the friction during bulk forming of high nitrogen steel, vol. 1. 2020. mla: Kuball, Clara-Maria, et al., editors. Influence of the Process Temperature on the Forming Behaviour and the Friction during Bulk Forming of High Nitrogen Steel. 100023, 2020, doi:10.1016/j.jajp.2020.100023. short: C.-M. Kuball, R. Jung, B. Uhe, G. Meschut, M. Merklein, eds., Influence of the Process Temperature on the Forming Behaviour and the Friction during Bulk Forming of High Nitrogen Steel, 2020. date_created: 2020-10-12T08:23:27Z date_updated: 2023-04-28T09:19:41Z department: - _id: '157' doi: 10.1016/j.jajp.2020.100023 editor: - first_name: Clara-Maria full_name: Kuball, Clara-Maria last_name: Kuball - first_name: R full_name: Jung, R last_name: Jung - first_name: Benedikt full_name: Uhe, Benedikt id: '38131' last_name: Uhe - first_name: Gerson full_name: Meschut, Gerson id: '32056' last_name: Meschut orcid: 0000-0002-2763-1246 - first_name: Marion full_name: Merklein, Marion last_name: Merklein intvolume: ' 1' keyword: - High nitrogen steel - Self-piercing riveting - Joining by forming - Bulk forming - Strain hardening language: - iso: eng publication_status: published quality_controlled: '1' series_title: Journal of Advanced Joining Processes status: public title: Influence of the process temperature on the forming behaviour and the friction during bulk forming of high nitrogen steel type: conference_editor user_id: '38131' volume: 1 year: '2020' ... --- _id: '19973' 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. article_type: original author: - first_name: Benedikt full_name: Uhe, Benedikt id: '38131' last_name: Uhe - first_name: Clara-Maria full_name: Kuball, Clara-Maria last_name: Kuball - first_name: Marion full_name: Merklein, Marion last_name: Merklein - first_name: Gerson full_name: Meschut, Gerson id: '32056' last_name: Meschut orcid: 0000-0002-2763-1246 citation: 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. Production Engineering. 2020;14:417-423. doi:10.1007/s11740-020-00973-w apa: Uhe, B., Kuball, C.-M., Merklein, M., & Meschut, G. (2020). Improvement of a rivet geometry for the self-piercing riveting of high-strength steel and multi-material joints. Production Engineering, 14, 417–423. https://doi.org/10.1007/s11740-020-00973-w 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={10.1007/s11740-020-00973-w}, journal={Production Engineering}, author={Uhe, Benedikt and Kuball, Clara-Maria and Merklein, Marion and Meschut, Gerson}, year={2020}, pages={417–423} }' 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.” Production Engineering 14 (2020): 417–23. https://doi.org/10.1007/s11740-020-00973-w.' 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,” Production Engineering, vol. 14, pp. 417–423, 2020, doi: 10.1007/s11740-020-00973-w.' mla: Uhe, Benedikt, et al. “Improvement of a Rivet Geometry for the Self-Piercing Riveting of High-Strength Steel and Multi-Material Joints.” Production Engineering, vol. 14, 2020, pp. 417–23, doi:10.1007/s11740-020-00973-w. short: B. Uhe, C.-M. Kuball, M. Merklein, G. Meschut, Production Engineering 14 (2020) 417–423. date_created: 2020-10-12T08:14:13Z date_updated: 2023-04-28T09:20:41Z department: - _id: '157' doi: 10.1007/s11740-020-00973-w intvolume: ' 14' keyword: - Self-piercing riveting - Joining technology - Rivet geometry - Multi-material design - High-strength steel - Aluminium language: - iso: eng page: 417-423 publication: Production Engineering publication_status: published quality_controlled: '1' status: public title: Improvement of a rivet geometry for the self-piercing riveting of high-strength steel and multi-material joints type: journal_article user_id: '38131' volume: 14 year: '2020' ... --- _id: '46334' 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. author: - first_name: Jakob full_name: Bossek, Jakob last_name: Bossek - first_name: Pascal full_name: Kerschke, Pascal last_name: Kerschke - first_name: Heike full_name: Trautmann, Heike id: '100740' last_name: Trautmann orcid: 0000-0002-9788-8282 citation: ama: Bossek J, Kerschke P, Trautmann H. A multi-objective perspective on performance assessment and automated selection of single-objective optimization algorithms. Applied Soft Computing. 2020;88:105901. doi:https://doi.org/10.1016/j.asoc.2019.105901 apa: Bossek, J., Kerschke, P., & Trautmann, H. (2020). A multi-objective perspective on performance assessment and automated selection of single-objective optimization algorithms. Applied Soft Computing, 88, 105901. https://doi.org/10.1016/j.asoc.2019.105901 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={https://doi.org/10.1016/j.asoc.2019.105901}, journal={Applied Soft Computing}, author={Bossek, Jakob and Kerschke, Pascal and Trautmann, Heike}, year={2020}, pages={105901} }' chicago: 'Bossek, Jakob, Pascal Kerschke, and Heike Trautmann. “A Multi-Objective Perspective on Performance Assessment and Automated Selection of Single-Objective Optimization Algorithms.” Applied Soft Computing 88 (2020): 105901. https://doi.org/10.1016/j.asoc.2019.105901.' ieee: 'J. Bossek, P. Kerschke, and H. Trautmann, “A multi-objective perspective on performance assessment and automated selection of single-objective optimization algorithms,” Applied Soft Computing, vol. 88, p. 105901, 2020, doi: https://doi.org/10.1016/j.asoc.2019.105901.' mla: Bossek, Jakob, et al. “A Multi-Objective Perspective on Performance Assessment and Automated Selection of Single-Objective Optimization Algorithms.” Applied Soft Computing, vol. 88, 2020, p. 105901, doi:https://doi.org/10.1016/j.asoc.2019.105901. short: J. Bossek, P. Kerschke, H. Trautmann, Applied Soft Computing 88 (2020) 105901. date_created: 2023-08-04T07:42:26Z date_updated: 2023-10-16T13:07:59Z department: - _id: '34' - _id: '819' doi: https://doi.org/10.1016/j.asoc.2019.105901 intvolume: ' 88' keyword: - Algorithm selection - Multi-objective optimization - Performance measurement - Combinatorial optimization - Traveling Salesperson Problem language: - iso: eng page: '105901' publication: Applied Soft Computing publication_identifier: issn: - 1568-4946 status: public title: A multi-objective perspective on performance assessment and automated selection of single-objective optimization algorithms type: journal_article user_id: '15504' volume: 88 year: '2020' ... --- _id: '48847' abstract: - lang: eng text: Dynamic optimization problems have gained significant attention in evolutionary computation as evolutionary algorithms (EAs) can easily adapt to changing environments. We show that EAs can solve the graph coloring problem for bipartite graphs more efficiently by using dynamic optimization. In our approach the graph instance is given incrementally such that the EA can reoptimize its coloring when a new edge introduces a conflict. We show that, when edges are inserted in a way that preserves graph connectivity, Randomized Local Search (RLS) efficiently finds a proper 2-coloring for all bipartite graphs. This includes graphs for which RLS and other EAs need exponential expected time in a static optimization scenario. We investigate different ways of building up the graph by popular graph traversals such as breadth-first-search and depth-first-search and analyse the resulting runtime behavior. We further show that offspring populations (e. g. a (1 + {$\lambda$}) RLS) lead to an exponential speedup in {$\lambda$}. Finally, an island model using 3 islands succeeds in an optimal time of {$\Theta$}(m) on every m-edge bipartite graph, outperforming offspring populations. This is the first example where an island model guarantees a speedup that is not bounded in the number of islands. author: - first_name: Jakob full_name: Bossek, Jakob id: '102979' last_name: Bossek orcid: 0000-0002-4121-4668 - first_name: Frank full_name: Neumann, Frank last_name: Neumann - first_name: Pan full_name: Peng, Pan last_name: Peng - first_name: Dirk full_name: Sudholt, Dirk last_name: Sudholt citation: ama: 'Bossek J, Neumann F, Peng P, Sudholt D. More Effective Randomized Search Heuristics for Graph Coloring through Dynamic Optimization. In: Proceedings of the Genetic and Evolutionary Computation Conference. GECCO ’20. Association for Computing Machinery; 2020:1277–1285. doi:10.1145/3377930.3390174' apa: Bossek, J., Neumann, F., Peng, P., & Sudholt, D. (2020). More Effective Randomized Search Heuristics for Graph Coloring through Dynamic Optimization. Proceedings of the Genetic and Evolutionary Computation Conference, 1277–1285. https://doi.org/10.1145/3377930.3390174 bibtex: '@inproceedings{Bossek_Neumann_Peng_Sudholt_2020, place={New York, NY, USA}, series={GECCO ’20}, title={More Effective Randomized Search Heuristics for Graph Coloring through Dynamic Optimization}, DOI={10.1145/3377930.3390174}, booktitle={Proceedings of the Genetic and Evolutionary Computation Conference}, publisher={Association for Computing Machinery}, author={Bossek, Jakob and Neumann, Frank and Peng, Pan and Sudholt, Dirk}, year={2020}, pages={1277–1285}, collection={GECCO ’20} }' chicago: 'Bossek, Jakob, Frank Neumann, Pan Peng, and Dirk Sudholt. “More Effective Randomized Search Heuristics for Graph Coloring through Dynamic Optimization.” In Proceedings of the Genetic and Evolutionary Computation Conference, 1277–1285. GECCO ’20. New York, NY, USA: Association for Computing Machinery, 2020. https://doi.org/10.1145/3377930.3390174.' ieee: 'J. Bossek, F. Neumann, P. Peng, and D. Sudholt, “More Effective Randomized Search Heuristics for Graph Coloring through Dynamic Optimization,” in Proceedings of the Genetic and Evolutionary Computation Conference, 2020, pp. 1277–1285, doi: 10.1145/3377930.3390174.' mla: Bossek, Jakob, et al. “More Effective Randomized Search Heuristics for Graph Coloring through Dynamic Optimization.” Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, 2020, pp. 1277–1285, doi:10.1145/3377930.3390174. short: 'J. Bossek, F. Neumann, P. Peng, D. Sudholt, in: Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, New York, NY, USA, 2020, pp. 1277–1285.' date_created: 2023-11-14T15:58:53Z date_updated: 2023-12-13T10:43:41Z department: - _id: '819' doi: 10.1145/3377930.3390174 extern: '1' keyword: - dynamic optimization - evolutionary algorithms - running time analysis - theory language: - iso: eng page: 1277–1285 place: New York, NY, USA publication: Proceedings of the Genetic and Evolutionary Computation Conference publication_identifier: isbn: - 978-1-4503-7128-5 publication_status: published publisher: Association for Computing Machinery series_title: GECCO ’20 status: public title: More Effective Randomized Search Heuristics for Graph Coloring through Dynamic Optimization type: conference user_id: '102979' year: '2020' ... --- _id: '48849' abstract: - lang: eng text: One-shot optimization tasks require to determine the set of solution candidates prior to their evaluation, i.e., without possibility for adaptive sampling. We consider two variants, classic one-shot optimization (where our aim is to find at least one solution of high quality) and one-shot regression (where the goal is to fit a model that resembles the true problem as well as possible). For both tasks it seems intuitive that well-distributed samples should perform better than uniform or grid-based samples, since they show a better coverage of the decision space. In practice, quasi-random designs such as Latin Hypercube Samples and low-discrepancy point sets are indeed very commonly used designs for one-shot optimization tasks. We study in this work how well low star discrepancy correlates with performance in one-shot optimization. Our results confirm an advantage of low-discrepancy designs, but also indicate the correlation between discrepancy values and overall performance is rather weak. We then demonstrate that commonly used designs may be far from optimal. More precisely, we evolve 24 very specific designs that each achieve good performance on one of our benchmark problems. Interestingly, we find that these specifically designed samples yield surprisingly good performance across the whole benchmark set. Our results therefore give strong indication that significant performance gains over state-of-the-art one-shot sampling techniques are possible, and that evolutionary algorithms can be an efficient means to evolve these. author: - first_name: Jakob full_name: Bossek, Jakob id: '102979' last_name: Bossek orcid: 0000-0002-4121-4668 - first_name: Carola full_name: Doerr, Carola last_name: Doerr - first_name: Pascal full_name: Kerschke, Pascal last_name: Kerschke - first_name: Aneta full_name: Neumann, Aneta last_name: Neumann - first_name: Frank full_name: Neumann, Frank last_name: Neumann citation: ama: 'Bossek J, Doerr C, Kerschke P, Neumann A, Neumann F. Evolving Sampling Strategies for One-Shot Optimization Tasks. In: Parallel Problem Solving from Nature (PPSN XVI). Springer-Verlag; 2020:111–124. doi:10.1007/978-3-030-58112-1_8' apa: Bossek, J., Doerr, C., Kerschke, P., Neumann, A., & Neumann, F. (2020). Evolving Sampling Strategies for One-Shot Optimization Tasks. Parallel Problem Solving from Nature (PPSN XVI), 111–124. https://doi.org/10.1007/978-3-030-58112-1_8 bibtex: '@inproceedings{Bossek_Doerr_Kerschke_Neumann_Neumann_2020, place={Berlin, Heidelberg}, title={Evolving Sampling Strategies for One-Shot Optimization Tasks}, DOI={10.1007/978-3-030-58112-1_8}, booktitle={Parallel Problem Solving from Nature (PPSN XVI)}, publisher={Springer-Verlag}, author={Bossek, Jakob and Doerr, Carola and Kerschke, Pascal and Neumann, Aneta and Neumann, Frank}, year={2020}, pages={111–124} }' chicago: 'Bossek, Jakob, Carola Doerr, Pascal Kerschke, Aneta Neumann, and Frank Neumann. “Evolving Sampling Strategies for One-Shot Optimization Tasks.” In Parallel Problem Solving from Nature (PPSN XVI), 111–124. Berlin, Heidelberg: Springer-Verlag, 2020. https://doi.org/10.1007/978-3-030-58112-1_8.' ieee: 'J. Bossek, C. Doerr, P. Kerschke, A. Neumann, and F. Neumann, “Evolving Sampling Strategies for One-Shot Optimization Tasks,” in Parallel Problem Solving from Nature (PPSN XVI), 2020, pp. 111–124, doi: 10.1007/978-3-030-58112-1_8.' mla: Bossek, Jakob, et al. “Evolving Sampling Strategies for One-Shot Optimization Tasks.” Parallel Problem Solving from Nature (PPSN XVI), Springer-Verlag, 2020, pp. 111–124, doi:10.1007/978-3-030-58112-1_8. short: 'J. Bossek, C. Doerr, P. Kerschke, A. Neumann, F. Neumann, in: Parallel Problem Solving from Nature (PPSN XVI), Springer-Verlag, Berlin, Heidelberg, 2020, pp. 111–124.' date_created: 2023-11-14T15:58:53Z date_updated: 2023-12-13T10:43:53Z department: - _id: '819' doi: 10.1007/978-3-030-58112-1_8 extern: '1' keyword: - Continuous optimization - Fully parallel search - One-shot optimization - Regression - Surrogate-assisted optimization language: - iso: eng page: 111–124 place: Berlin, Heidelberg publication: Parallel Problem Solving from Nature (PPSN XVI) publication_identifier: isbn: - 978-3-030-58111-4 publication_status: published publisher: Springer-Verlag status: public title: Evolving Sampling Strategies for One-Shot Optimization Tasks type: conference user_id: '102979' year: '2020' ... --- _id: '48851' abstract: - lang: eng text: Several important optimization problems in the area of vehicle routing can be seen as variants of the classical Traveling Salesperson Problem (TSP). In the area of evolutionary computation, the Traveling Thief Problem (TTP) has gained increasing interest over the last 5 years. In this paper, we investigate the effect of weights on such problems, in the sense that the cost of traveling increases with respect to the weights of nodes already visited during a tour. This provides abstractions of important TSP variants such as the Traveling Thief Problem and time dependent TSP variants, and allows to study precisely the increase in difficulty caused by weight dependence. We provide a 3.59-approximation for this weight dependent version of TSP with metric distances and bounded positive weights. Furthermore, we conduct experimental investigations for simple randomized local search with classical mutation operators and two variants of the state-of-the-art evolutionary algorithm EAX adapted to the weighted TSP. Our results show the impact of the node weights on the position of the nodes in the resulting tour. author: - first_name: Jakob full_name: Bossek, Jakob id: '102979' last_name: Bossek orcid: 0000-0002-4121-4668 - first_name: Katrin full_name: Casel, Katrin last_name: Casel - first_name: Pascal full_name: Kerschke, Pascal last_name: Kerschke - first_name: Frank full_name: Neumann, Frank last_name: Neumann citation: ama: 'Bossek J, Casel K, Kerschke P, Neumann F. The Node Weight Dependent Traveling Salesperson Problem: Approximation Algorithms and Randomized Search Heuristics. In: Proceedings of the Genetic and Evolutionary Computation Conference. GECCO ’20. Association for Computing Machinery; 2020:1286–1294. doi:10.1145/3377930.3390243' apa: 'Bossek, J., Casel, K., Kerschke, P., & Neumann, F. (2020). The Node Weight Dependent Traveling Salesperson Problem: Approximation Algorithms and Randomized Search Heuristics. Proceedings of the Genetic and Evolutionary Computation Conference, 1286–1294. https://doi.org/10.1145/3377930.3390243' bibtex: '@inproceedings{Bossek_Casel_Kerschke_Neumann_2020, place={New York, NY, USA}, series={GECCO ’20}, title={The Node Weight Dependent Traveling Salesperson Problem: Approximation Algorithms and Randomized Search Heuristics}, DOI={10.1145/3377930.3390243}, booktitle={Proceedings of the Genetic and Evolutionary Computation Conference}, publisher={Association for Computing Machinery}, author={Bossek, Jakob and Casel, Katrin and Kerschke, Pascal and Neumann, Frank}, year={2020}, pages={1286–1294}, collection={GECCO ’20} }' chicago: 'Bossek, Jakob, Katrin Casel, Pascal Kerschke, and Frank Neumann. “The Node Weight Dependent Traveling Salesperson Problem: Approximation Algorithms and Randomized Search Heuristics.” In Proceedings of the Genetic and Evolutionary Computation Conference, 1286–1294. GECCO ’20. New York, NY, USA: Association for Computing Machinery, 2020. https://doi.org/10.1145/3377930.3390243.' ieee: 'J. Bossek, K. Casel, P. Kerschke, and F. Neumann, “The Node Weight Dependent Traveling Salesperson Problem: Approximation Algorithms and Randomized Search Heuristics,” in Proceedings of the Genetic and Evolutionary Computation Conference, 2020, pp. 1286–1294, doi: 10.1145/3377930.3390243.' mla: 'Bossek, Jakob, et al. “The Node Weight Dependent Traveling Salesperson Problem: Approximation Algorithms and Randomized Search Heuristics.” Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, 2020, pp. 1286–1294, doi:10.1145/3377930.3390243.' short: 'J. Bossek, K. Casel, P. Kerschke, F. Neumann, in: Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, New York, NY, USA, 2020, pp. 1286–1294.' date_created: 2023-11-14T15:58:53Z date_updated: 2023-12-13T10:43:33Z department: - _id: '819' doi: 10.1145/3377930.3390243 extern: '1' keyword: - dynamic optimization - evolutionary algorithms - running time analysis - theory language: - iso: eng page: 1286–1294 place: New York, NY, USA publication: Proceedings of the Genetic and Evolutionary Computation Conference publication_identifier: isbn: - 978-1-4503-7128-5 publication_status: published publisher: Association for Computing Machinery series_title: GECCO ’20 status: public title: 'The Node Weight Dependent Traveling Salesperson Problem: Approximation Algorithms and Randomized Search Heuristics' type: conference user_id: '102979' year: '2020' ... --- _id: '48845' abstract: - lang: eng 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. author: - first_name: Jakob full_name: Bossek, Jakob id: '102979' last_name: Bossek orcid: 0000-0002-4121-4668 - first_name: Christian full_name: Grimme, Christian last_name: Grimme - first_name: Heike full_name: Trautmann, Heike last_name: Trautmann citation: ama: 'Bossek J, Grimme C, Trautmann H. Dynamic Bi-Objective Routing of Multiple Vehicles. In: Proceedings of the Genetic and Evolutionary Computation Conference. GECCO ’20. Association for Computing Machinery; 2020:166–174. doi:10.1145/3377930.3390146' apa: Bossek, J., Grimme, C., & Trautmann, H. (2020). Dynamic Bi-Objective Routing of Multiple Vehicles. Proceedings of the Genetic and Evolutionary Computation Conference, 166–174. https://doi.org/10.1145/3377930.3390146 bibtex: '@inproceedings{Bossek_Grimme_Trautmann_2020, place={New York, NY, USA}, series={GECCO ’20}, title={Dynamic Bi-Objective Routing of Multiple Vehicles}, DOI={10.1145/3377930.3390146}, 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} }' chicago: 'Bossek, Jakob, Christian Grimme, and Heike Trautmann. “Dynamic Bi-Objective Routing of Multiple Vehicles.” In Proceedings of the Genetic and Evolutionary Computation Conference, 166–174. GECCO ’20. New York, NY, USA: Association for Computing Machinery, 2020. https://doi.org/10.1145/3377930.3390146.' ieee: 'J. Bossek, C. Grimme, and H. Trautmann, “Dynamic Bi-Objective Routing of Multiple Vehicles,” in Proceedings of the Genetic and Evolutionary Computation Conference, 2020, pp. 166–174, doi: 10.1145/3377930.3390146.' mla: Bossek, Jakob, et al. “Dynamic Bi-Objective Routing of Multiple Vehicles.” Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, 2020, pp. 166–174, doi:10.1145/3377930.3390146. 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.' date_created: 2023-11-14T15:58:52Z date_updated: 2023-12-13T10:43:24Z department: - _id: '819' doi: 10.1145/3377930.3390146 extern: '1' keyword: - decision making - dynamic optimization - evolutionary algorithms - multi-objective optimization - vehicle routing language: - iso: eng page: 166–174 place: New York, NY, USA publication: Proceedings of the Genetic and Evolutionary Computation Conference publication_identifier: isbn: - 978-1-4503-7128-5 publication_status: published publisher: Association for Computing Machinery series_title: GECCO ’20 status: public title: Dynamic Bi-Objective Routing of Multiple Vehicles type: conference user_id: '102979' year: '2020' ... --- _id: '48850' abstract: - lang: eng text: Sequential model-based optimization (SMBO) approaches are algorithms for solving problems that require computationally or otherwise expensive function evaluations. The key design principle of SMBO is a substitution of the true objective function by a surrogate, which is used to propose the point(s) to be evaluated next. SMBO algorithms are intrinsically modular, leaving the user with many important design choices. Significant research efforts go into understanding which settings perform best for which type of problems. Most works, however, focus on the choice of the model, the acquisition function, and the strategy used to optimize the latter. The choice of the initial sampling strategy, however, receives much less attention. Not surprisingly, quite diverging recommendations can be found in the literature. We analyze in this work how the size and the distribution of the initial sample influences the overall quality of the efficient global optimization (EGO) algorithm, a well-known SMBO approach. While, overall, small initial budgets using Halton sampling seem preferable, we also observe that the performance landscape is rather unstructured. We furthermore identify several situations in which EGO performs unfavorably against random sampling. Both observations indicate that an adaptive SMBO design could be beneficial, making SMBO an interesting test-bed for automated algorithm design. author: - first_name: Jakob full_name: Bossek, Jakob id: '102979' last_name: Bossek orcid: 0000-0002-4121-4668 - first_name: Carola full_name: Doerr, Carola last_name: Doerr - first_name: Pascal full_name: Kerschke, Pascal last_name: Kerschke citation: ama: 'Bossek J, Doerr C, Kerschke P. Initial Design Strategies and Their Effects on Sequential Model-Based Optimization: An Exploratory Case Study Based on BBOB. In: Proceedings of the Genetic and Evolutionary Computation Conference. GECCO ’20. Association for Computing Machinery; 2020:778–786. doi:10.1145/3377930.3390155' apa: 'Bossek, J., Doerr, C., & Kerschke, P. (2020). Initial Design Strategies and Their Effects on Sequential Model-Based Optimization: An Exploratory Case Study Based on BBOB. Proceedings of the Genetic and Evolutionary Computation Conference, 778–786. https://doi.org/10.1145/3377930.3390155' bibtex: '@inproceedings{Bossek_Doerr_Kerschke_2020, place={New York, NY, USA}, series={GECCO ’20}, title={Initial Design Strategies and Their Effects on Sequential Model-Based Optimization: An Exploratory Case Study Based on BBOB}, DOI={10.1145/3377930.3390155}, booktitle={Proceedings of the Genetic and Evolutionary Computation Conference}, publisher={Association for Computing Machinery}, author={Bossek, Jakob and Doerr, Carola and Kerschke, Pascal}, year={2020}, pages={778–786}, collection={GECCO ’20} }' chicago: 'Bossek, Jakob, Carola Doerr, and Pascal Kerschke. “Initial Design Strategies and Their Effects on Sequential Model-Based Optimization: An Exploratory Case Study Based on BBOB.” In Proceedings of the Genetic and Evolutionary Computation Conference, 778–786. GECCO ’20. New York, NY, USA: Association for Computing Machinery, 2020. https://doi.org/10.1145/3377930.3390155.' ieee: 'J. Bossek, C. Doerr, and P. Kerschke, “Initial Design Strategies and Their Effects on Sequential Model-Based Optimization: An Exploratory Case Study Based on BBOB,” in Proceedings of the Genetic and Evolutionary Computation Conference, 2020, pp. 778–786, doi: 10.1145/3377930.3390155.' mla: 'Bossek, Jakob, et al. “Initial Design Strategies and Their Effects on Sequential Model-Based Optimization: An Exploratory Case Study Based on BBOB.” Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, 2020, pp. 778–786, doi:10.1145/3377930.3390155.' short: 'J. Bossek, C. Doerr, P. Kerschke, in: Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, New York, NY, USA, 2020, pp. 778–786.' date_created: 2023-11-14T15:58:53Z date_updated: 2023-12-13T10:44:01Z department: - _id: '819' doi: 10.1145/3377930.3390155 extern: '1' keyword: - continuous black-box optimization - design of experiments - initial design - sequential model-based optimization language: - iso: eng page: 778–786 place: New York, NY, USA publication: Proceedings of the Genetic and Evolutionary Computation Conference publication_identifier: isbn: - 978-1-4503-7128-5 publication_status: published publisher: Association for Computing Machinery series_title: GECCO ’20 status: public title: 'Initial Design Strategies and Their Effects on Sequential Model-Based Optimization: An Exploratory Case Study Based on BBOB' type: conference user_id: '102979' year: '2020' ... --- _id: '48848' 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. author: - first_name: Jakob full_name: Bossek, Jakob id: '102979' last_name: Bossek orcid: 0000-0002-4121-4668 - first_name: Pascal full_name: Kerschke, Pascal last_name: Kerschke - first_name: Heike full_name: Trautmann, Heike last_name: Trautmann citation: ama: Bossek J, Kerschke P, Trautmann H. A Multi-Objective Perspective on Performance Assessment and Automated Selection of Single-Objective Optimization Algorithms. Applied Soft Computing. 2020;88(C). doi:10.1016/j.asoc.2019.105901 apa: Bossek, J., Kerschke, P., & Trautmann, H. (2020). A Multi-Objective Perspective on Performance Assessment and Automated Selection of Single-Objective Optimization Algorithms. Applied Soft Computing, 88(C). https://doi.org/10.1016/j.asoc.2019.105901 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={10.1016/j.asoc.2019.105901}, 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.” Applied Soft Computing 88, no. C (2020). https://doi.org/10.1016/j.asoc.2019.105901. ieee: 'J. Bossek, P. Kerschke, and H. Trautmann, “A Multi-Objective Perspective on Performance Assessment and Automated Selection of Single-Objective Optimization Algorithms,” Applied Soft Computing, vol. 88, no. C, 2020, doi: 10.1016/j.asoc.2019.105901.' mla: Bossek, Jakob, et al. “A Multi-Objective Perspective on Performance Assessment and Automated Selection of Single-Objective Optimization Algorithms.” Applied Soft Computing, vol. 88, no. C, 2020, doi:10.1016/j.asoc.2019.105901. short: J. Bossek, P. Kerschke, H. Trautmann, Applied Soft Computing 88 (2020). date_created: 2023-11-14T15:58:53Z date_updated: 2023-12-13T10:52:17Z department: - _id: '819' doi: 10.1016/j.asoc.2019.105901 intvolume: ' 88' issue: C keyword: - Algorithm selection - Combinatorial optimization - Multi-objective optimization - Performance measurement - Traveling Salesperson Problem language: - iso: eng publication: Applied Soft Computing publication_identifier: issn: - 1568-4946 status: public title: A Multi-Objective Perspective on Performance Assessment and Automated Selection of Single-Objective Optimization Algorithms type: journal_article user_id: '102979' volume: 88 year: '2020' ... --- _id: '4562' abstract: - lang: eng text: Employing main and sector-specific investment-grade CDS indices from the North American and European CDS market and performing mean-variance out-of-sample analyses for conservative and aggressive investors over the period from 2006 to 2014, this paper analyzes portfolio benefits of adding corporate CDS indices to a traditional financial portfolio consisting of stock and sovereign bond indices. As a baseline result, we initially find an increase in portfolio (downside) risk-diversification when adding CDS indices, which is observed irrespective of both CDS markets, investor-types and different sub-periods, including the global financial crisis and European sovereign debt crisis. In addition, the analysis reveals higher portfolio excess returns and performance in CDS index portfolios, however, these effects clearly differ between markets, investor-types and sub-periods. Overall, portfolio benefits of adding CDS indices mainly result from the fact that institutional investors replace sovereign bond indices rather than stock indices by CDS indices due to better risk-return characteristics. Our baseline findings remain robust under a variety of robustness checks. Results from sensitivity analyses provide further important implications for institutional investors with a strategic focus on a long-term conservative portfolio management. article_type: original author: - first_name: Benjamin full_name: Hippert, Benjamin id: '48476' last_name: Hippert - first_name: André full_name: Uhde, André id: '36049' last_name: Uhde orcid: https://orcid.org/0000-0002-8058-8857 - first_name: Sascha Tobias full_name: Wengerek, Sascha Tobias id: '48837' last_name: Wengerek orcid: 0000-0002-7820-3903 citation: ama: 'Hippert B, Uhde A, Wengerek ST. Portfolio Benefits of Adding Corporate Credit Default Swap Indices: Evidence from North America and Europe. Review of Derivatives Research . 2019;22(2):203-259. doi:https://doi.org/10.1007/s11147-018-9148-8' apa: 'Hippert, B., Uhde, A., & Wengerek, S. T. (2019). Portfolio Benefits of Adding Corporate Credit Default Swap Indices: Evidence from North America and Europe. Review of Derivatives Research , 22(2), 203–259. https://doi.org/10.1007/s11147-018-9148-8' bibtex: '@article{Hippert_Uhde_Wengerek_2019, title={Portfolio Benefits of Adding Corporate Credit Default Swap Indices: Evidence from North America and Europe}, volume={22}, DOI={https://doi.org/10.1007/s11147-018-9148-8}, number={2}, journal={Review of Derivatives Research }, author={Hippert, Benjamin and Uhde, André and Wengerek, Sascha Tobias}, year={2019}, pages={203–259} }' chicago: 'Hippert, Benjamin, André Uhde, and Sascha Tobias Wengerek. “Portfolio Benefits of Adding Corporate Credit Default Swap Indices: Evidence from North America and Europe.” Review of Derivatives Research 22, no. 2 (2019): 203–59. https://doi.org/10.1007/s11147-018-9148-8.' ieee: 'B. Hippert, A. Uhde, and S. T. Wengerek, “Portfolio Benefits of Adding Corporate Credit Default Swap Indices: Evidence from North America and Europe,” Review of Derivatives Research , vol. 22, no. 2, pp. 203–259, 2019, doi: https://doi.org/10.1007/s11147-018-9148-8.' mla: 'Hippert, Benjamin, et al. “Portfolio Benefits of Adding Corporate Credit Default Swap Indices: Evidence from North America and Europe.” Review of Derivatives Research , vol. 22, no. 2, 2019, pp. 203–59, doi:https://doi.org/10.1007/s11147-018-9148-8.' short: B. Hippert, A. Uhde, S.T. Wengerek, Review of Derivatives Research 22 (2019) 203–259. date_created: 2018-10-01T12:17:35Z date_updated: 2022-05-04T06:15:02Z department: - _id: '188' - _id: '186' doi: https://doi.org/10.1007/s11147-018-9148-8 intvolume: ' 22' issue: '2' jel: - C61 - G01 - G11 - G15 - G23 keyword: - Corporate credit default swap indices - Mean-variance asset allocation - Out-of-sample portfolio optimization - Portfolio risk-diversification - Portfolio performance evaluation language: - iso: eng page: 203-259 publication: 'Review of Derivatives Research ' publication_status: published status: public title: 'Portfolio Benefits of Adding Corporate Credit Default Swap Indices: Evidence from North America and Europe' type: journal_article user_id: '36049' volume: 22 year: '2019' ... --- _id: '10000' abstract: - lang: eng text: Ultraschall wird zur Effizienzsteigerung in verfahrenstechnischen Prozessen eingesetzt. Die Betriebsparamter der Ultraschallsysteme werden empirisch ermittelt, da derzeit keine systematische Analyse der Wechselwirkung zwischen Ultraschallwandler und Schallfeld sowie kein Verfahren zur Messung der Kavitationsaktivität ohne zusätzlichen Sensor existieren. Auf Basis einer experimentellen Analyse des betrachteten sonochemischen Reaktors wird ein Finite-Elemente-Modell aufgebaut, das die Wechselwirkung zwischen Schallfeld und Ultraschallwandler berücksichtigt. Die modellbasierte Analyse zeigt, dass wegen der akustischen Eigenschaften des Autoklavs nur direkt an der Sonotrode Kavitation entsteht. Die Wechselwirkung zwischen Ultraschallwandler und Schallfeld ermöglicht Aussagen über das Schallfeld und die Kavitationsaktivität auf Basis der Rückwirkung auf den Ultraschallwandler. Die lineare Schalldruckverteilung ermöglicht eine Prognose über die Verteilung von Kavitationszonen. Das beschriebene Modell liefert wertvolle Erkenntnisse für die Auslegung, Analyse und Skalierung sonochemischer Reaktoren. Auf Grund der rauen Prozessrandbedingungen ist die Applikation von Sensoren zur Überwachung der Kavitationsaktivität in vielen sonochemischen Prozessen nicht möglich. Zur prozessbegleitenden Messung der Kavitationsaktivität wird ein Verfahren entwickelt, das die Bewertung der Kavitationsaktivität durch Auswertung der Rückwirkung auf den Ultraschallwandler erlaubt. Das Messverfahren ermöglicht eine vorhersagbare und reproduzierbare Durchführung kavitationsbasierter Prozesse und stellt eine wichtige Erweiterung für bestehende und neue Ultraschallsysteme dar. author: - first_name: Peter full_name: Bornmann, Peter last_name: Bornmann citation: ama: Bornmann P. Modellierung Und Experimentelle Charakterisierung Der Wechselwirkung Zwischen Ultraschallwandler Und Flüssigkeit in Kavitationsbasierten Prozessen. Shaker; 2019. apa: Bornmann, P. (2019). Modellierung und experimentelle Charakterisierung der Wechselwirkung zwischen Ultraschallwandler und Flüssigkeit in kavitationsbasierten Prozessen. Shaker. bibtex: '@book{Bornmann_2019, title={Modellierung und experimentelle Charakterisierung der Wechselwirkung zwischen Ultraschallwandler und Flüssigkeit in kavitationsbasierten Prozessen}, publisher={Shaker}, author={Bornmann, Peter}, year={2019} }' chicago: Bornmann, Peter. Modellierung Und Experimentelle Charakterisierung Der Wechselwirkung Zwischen Ultraschallwandler Und Flüssigkeit in Kavitationsbasierten Prozessen. Shaker, 2019. ieee: P. Bornmann, Modellierung und experimentelle Charakterisierung der Wechselwirkung zwischen Ultraschallwandler und Flüssigkeit in kavitationsbasierten Prozessen. Shaker, 2019. mla: Bornmann, Peter. Modellierung Und Experimentelle Charakterisierung Der Wechselwirkung Zwischen Ultraschallwandler Und Flüssigkeit in Kavitationsbasierten Prozessen. Shaker, 2019. short: P. Bornmann, Modellierung Und Experimentelle Charakterisierung Der Wechselwirkung Zwischen Ultraschallwandler Und Flüssigkeit in Kavitationsbasierten Prozessen, Shaker, 2019. date_created: 2019-05-27T10:29:53Z date_updated: 2023-09-15T12:23:55Z department: - _id: '151' keyword: - Sonochemie - Akustische Kavitation - Kavitationsmessung - Kavitationsdetektion - FEM-Simulation Ultraschallwandler - Prozessüberwachung - FEM-Simulation Schallfeld - Self-Sensing - Piezoelektrische Ultraschallwandler - Ultraschallreinigung language: - iso: eng publisher: Shaker status: public title: Modellierung und experimentelle Charakterisierung der Wechselwirkung zwischen Ultraschallwandler und Flüssigkeit in kavitationsbasierten Prozessen type: dissertation user_id: '210' year: '2019' ... --- _id: '48841' abstract: - lang: eng 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. author: - first_name: Jakob full_name: Bossek, Jakob id: '102979' last_name: Bossek orcid: 0000-0002-4121-4668 - first_name: Christian full_name: Grimme, Christian last_name: Grimme - first_name: Stephan full_name: Meisel, Stephan last_name: Meisel - first_name: Günter full_name: Rudolph, Günter last_name: Rudolph - first_name: Heike full_name: Trautmann, Heike last_name: Trautmann citation: 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. Evolutionary Multi-Criterion Optimization (EMO). Lecture Notes in Computer Science. Springer International Publishing; 2019:516–528. doi:10.1007/978-3-030-12598-1_41' apa: 'Bossek, J., Grimme, C., Meisel, S., Rudolph, G., & 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, & P. Reed (Eds.), Evolutionary Multi-Criterion Optimization (EMO) (pp. 516–528). Springer International Publishing. https://doi.org/10.1007/978-3-030-12598-1_41' 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={10.1007/978-3-030-12598-1_41}, 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} }' chicago: 'Bossek, Jakob, Christian Grimme, Stephan Meisel, Günter Rudolph, and Heike Trautmann. “Bi-Objective Orienteering: Towards a Dynamic Multi-Objective Evolutionary Algorithm.” In Evolutionary Multi-Criterion Optimization (EMO), 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. https://doi.org/10.1007/978-3-030-12598-1_41.' ieee: 'J. Bossek, C. Grimme, S. Meisel, G. Rudolph, and H. Trautmann, “Bi-Objective Orienteering: Towards a Dynamic Multi-objective Evolutionary Algorithm,” in Evolutionary Multi-Criterion Optimization (EMO), 2019, pp. 516–528, doi: 10.1007/978-3-030-12598-1_41.' mla: 'Bossek, Jakob, et al. “Bi-Objective Orienteering: Towards a Dynamic Multi-Objective Evolutionary Algorithm.” Evolutionary Multi-Criterion Optimization (EMO), edited by Kalyanmoy Deb et al., Springer International Publishing, 2019, pp. 516–528, doi:10.1007/978-3-030-12598-1_41.' 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.' date_created: 2023-11-14T15:58:52Z date_updated: 2023-12-13T10:43:07Z department: - _id: '819' doi: 10.1007/978-3-030-12598-1_41 editor: - first_name: Kalyanmoy full_name: Deb, Kalyanmoy last_name: Deb - first_name: Erik full_name: Goodman, Erik last_name: Goodman - first_name: Carlos A. full_name: Coello Coello, Carlos A. last_name: Coello Coello - first_name: Kathrin full_name: Klamroth, Kathrin last_name: Klamroth - first_name: Kaisa full_name: Miettinen, Kaisa last_name: Miettinen - first_name: Sanaz full_name: Mostaghim, Sanaz last_name: Mostaghim - first_name: Patrick full_name: Reed, Patrick last_name: Reed extern: '1' keyword: - Combinatorial optimization - Dynamic optimization - Metaheuristics - Multi-objective optimization - Vehicle routing language: - iso: eng page: 516–528 place: Cham publication: Evolutionary Multi-Criterion Optimization (EMO) publication_identifier: isbn: - 978-3-030-12598-1 publication_status: published publisher: Springer International Publishing series_title: Lecture Notes in Computer Science status: public title: 'Bi-Objective Orienteering: Towards a Dynamic Multi-objective Evolutionary Algorithm' type: conference user_id: '102979' year: '2019' ... --- _id: '48842' abstract: - lang: eng text: 'Evolutionary algorithms have successfully been applied to evolve problem instances that exhibit a significant difference in performance for a given algorithm or a pair of algorithms inter alia for the Traveling Salesperson Problem (TSP). Creating a large variety of instances is crucial for successful applications in the blooming field of algorithm selection. In this paper, we introduce new and creative mutation operators for evolving instances of the TSP. We show that adopting those operators in an evolutionary algorithm allows for the generation of benchmark sets with highly desirable properties: (1) novelty by clear visual distinction to established benchmark sets in the field, (2) visual and quantitative diversity in the space of TSP problem characteristics, and (3) significant performance differences with respect to the restart versions of heuristic state-of-the-art TSP solvers EAX and LKH. The important aspect of diversity is addressed and achieved solely by the proposed mutation operators and not enforced by explicit diversity preservation.' author: - first_name: Jakob full_name: Bossek, Jakob id: '102979' last_name: Bossek orcid: 0000-0002-4121-4668 - first_name: Pascal full_name: Kerschke, Pascal last_name: Kerschke - first_name: Aneta full_name: Neumann, Aneta last_name: Neumann - first_name: Markus full_name: Wagner, Markus last_name: Wagner - first_name: Frank full_name: Neumann, Frank last_name: Neumann - first_name: Heike full_name: Trautmann, Heike last_name: Trautmann citation: ama: 'Bossek J, Kerschke P, Neumann A, Wagner M, Neumann F, Trautmann H. Evolving Diverse TSP Instances by Means of Novel and Creative Mutation Operators. In: Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms. FOGA ’19. Association for Computing Machinery; 2019:58–71. doi:10.1145/3299904.3340307' apa: Bossek, J., Kerschke, P., Neumann, A., Wagner, M., Neumann, F., & Trautmann, H. (2019). Evolving Diverse TSP Instances by Means of Novel and Creative Mutation Operators. Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, 58–71. https://doi.org/10.1145/3299904.3340307 bibtex: '@inproceedings{Bossek_Kerschke_Neumann_Wagner_Neumann_Trautmann_2019, place={New York, NY, USA}, series={FOGA ’19}, title={Evolving Diverse TSP Instances by Means of Novel and Creative Mutation Operators}, DOI={10.1145/3299904.3340307}, booktitle={Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms}, publisher={Association for Computing Machinery}, author={Bossek, Jakob and Kerschke, Pascal and Neumann, Aneta and Wagner, Markus and Neumann, Frank and Trautmann, Heike}, year={2019}, pages={58–71}, collection={FOGA ’19} }' chicago: 'Bossek, Jakob, Pascal Kerschke, Aneta Neumann, Markus Wagner, Frank Neumann, and Heike Trautmann. “Evolving Diverse TSP Instances by Means of Novel and Creative Mutation Operators.” In Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, 58–71. FOGA ’19. New York, NY, USA: Association for Computing Machinery, 2019. https://doi.org/10.1145/3299904.3340307.' ieee: 'J. Bossek, P. Kerschke, A. Neumann, M. Wagner, F. Neumann, and H. Trautmann, “Evolving Diverse TSP Instances by Means of Novel and Creative Mutation Operators,” in Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, 2019, pp. 58–71, doi: 10.1145/3299904.3340307.' mla: Bossek, Jakob, et al. “Evolving Diverse TSP Instances by Means of Novel and Creative Mutation Operators.” Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, Association for Computing Machinery, 2019, pp. 58–71, doi:10.1145/3299904.3340307. short: 'J. Bossek, P. Kerschke, A. Neumann, M. Wagner, F. Neumann, H. Trautmann, in: Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, Association for Computing Machinery, New York, NY, USA, 2019, pp. 58–71.' date_created: 2023-11-14T15:58:52Z date_updated: 2023-12-13T10:42:57Z department: - _id: '819' doi: 10.1145/3299904.3340307 extern: '1' keyword: - benchmarking - instance features - optimization - problem generation - traveling salesperson problem language: - iso: eng page: 58–71 place: New York, NY, USA publication: Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms publication_identifier: isbn: - 978-1-4503-6254-2 publication_status: published publisher: Association for Computing Machinery series_title: FOGA ’19 status: public title: Evolving Diverse TSP Instances by Means of Novel and Creative Mutation Operators type: conference user_id: '102979' year: '2019' ... --- _id: '48843' abstract: - lang: eng text: We contribute to the theoretical understanding of randomized search heuristics for dynamic problems. We consider the classical graph coloring problem and investigate the dynamic setting where edges are added to the current graph. We then analyze the expected time for randomized search heuristics to recompute high quality solutions. This includes the (1+1) EA and RLS in a setting where the number of colors is bounded and we are minimizing the number of conflicts as well as iterated local search algorithms that use an unbounded color palette and aim to use the smallest colors and - as a consequence - the smallest number of colors. We identify classes of bipartite graphs where reoptimization is as hard as or even harder than optimization from scratch, i. e. starting with a random initialization. Even adding a single edge can lead to hard symmetry problems. However, graph classes that are hard for one algorithm turn out to be easy for others. In most cases our bounds show that reoptimization is faster than optimizing from scratch. Furthermore, we show how to speed up computations by using problem specific operators concentrating on parts of the graph where changes have occurred. author: - first_name: Jakob full_name: Bossek, Jakob id: '102979' last_name: Bossek orcid: 0000-0002-4121-4668 - first_name: Frank full_name: Neumann, Frank last_name: Neumann - first_name: Pan full_name: Peng, Pan last_name: Peng - first_name: Dirk full_name: Sudholt, Dirk last_name: Sudholt citation: ama: 'Bossek J, Neumann F, Peng P, Sudholt D. Runtime Analysis of Randomized Search Heuristics for Dynamic Graph Coloring. In: Proceedings of the Genetic and Evolutionary Computation Conference. GECCO ’19. Association for Computing Machinery; 2019:1443–1451. doi:10.1145/3321707.3321792' apa: Bossek, J., Neumann, F., Peng, P., & Sudholt, D. (2019). Runtime Analysis of Randomized Search Heuristics for Dynamic Graph Coloring. Proceedings of the Genetic and Evolutionary Computation Conference, 1443–1451. https://doi.org/10.1145/3321707.3321792 bibtex: '@inproceedings{Bossek_Neumann_Peng_Sudholt_2019, place={New York, NY, USA}, series={GECCO ’19}, title={Runtime Analysis of Randomized Search Heuristics for Dynamic Graph Coloring}, DOI={10.1145/3321707.3321792}, booktitle={Proceedings of the Genetic and Evolutionary Computation Conference}, publisher={Association for Computing Machinery}, author={Bossek, Jakob and Neumann, Frank and Peng, Pan and Sudholt, Dirk}, year={2019}, pages={1443–1451}, collection={GECCO ’19} }' chicago: 'Bossek, Jakob, Frank Neumann, Pan Peng, and Dirk Sudholt. “Runtime Analysis of Randomized Search Heuristics for Dynamic Graph Coloring.” In Proceedings of the Genetic and Evolutionary Computation Conference, 1443–1451. GECCO ’19. New York, NY, USA: Association for Computing Machinery, 2019. https://doi.org/10.1145/3321707.3321792.' ieee: 'J. Bossek, F. Neumann, P. Peng, and D. Sudholt, “Runtime Analysis of Randomized Search Heuristics for Dynamic Graph Coloring,” in Proceedings of the Genetic and Evolutionary Computation Conference, 2019, pp. 1443–1451, doi: 10.1145/3321707.3321792.' mla: Bossek, Jakob, et al. “Runtime Analysis of Randomized Search Heuristics for Dynamic Graph Coloring.” Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, 2019, pp. 1443–1451, doi:10.1145/3321707.3321792. short: 'J. Bossek, F. Neumann, P. Peng, D. Sudholt, in: Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, New York, NY, USA, 2019, pp. 1443–1451.' date_created: 2023-11-14T15:58:52Z date_updated: 2023-12-13T10:42:37Z department: - _id: '819' doi: 10.1145/3321707.3321792 extern: '1' keyword: - dynamic optimization - evolutionary algorithms - running time analysis - theory language: - iso: eng page: 1443–1451 place: New York, NY, USA publication: Proceedings of the Genetic and Evolutionary Computation Conference publication_identifier: isbn: - 978-1-4503-6111-8 publication_status: published publisher: Association for Computing Machinery series_title: GECCO ’19 status: public title: Runtime Analysis of Randomized Search Heuristics for Dynamic Graph Coloring type: conference user_id: '102979' year: '2019' ... --- _id: '48840' 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. author: - first_name: Jakob full_name: Bossek, Jakob id: '102979' last_name: Bossek orcid: 0000-0002-4121-4668 - first_name: Christian full_name: Grimme, Christian last_name: Grimme - first_name: Frank full_name: Neumann, Frank last_name: Neumann citation: ama: 'Bossek J, Grimme C, Neumann F. On the Benefits of Biased Edge-Exchange Mutation for the Multi-Criteria Spanning Tree Problem. In: Proceedings of the Genetic and Evolutionary Computation Conference. GECCO ’19. Association for Computing Machinery; 2019:516–523. doi:10.1145/3321707.3321818' apa: Bossek, J., Grimme, C., & Neumann, F. (2019). On the Benefits of Biased Edge-Exchange Mutation for the Multi-Criteria Spanning Tree Problem. Proceedings of the Genetic and Evolutionary Computation Conference, 516–523. https://doi.org/10.1145/3321707.3321818 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={10.1145/3321707.3321818}, 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} }' chicago: 'Bossek, Jakob, Christian Grimme, and Frank Neumann. “On the Benefits of Biased Edge-Exchange Mutation for the Multi-Criteria Spanning Tree Problem.” In Proceedings of the Genetic and Evolutionary Computation Conference, 516–523. GECCO ’19. New York, NY, USA: Association for Computing Machinery, 2019. https://doi.org/10.1145/3321707.3321818.' ieee: 'J. Bossek, C. Grimme, and F. Neumann, “On the Benefits of Biased Edge-Exchange Mutation for the Multi-Criteria Spanning Tree Problem,” in Proceedings of the Genetic and Evolutionary Computation Conference, 2019, pp. 516–523, doi: 10.1145/3321707.3321818.' mla: Bossek, Jakob, et al. “On the Benefits of Biased Edge-Exchange Mutation for the Multi-Criteria Spanning Tree Problem.” Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, 2019, pp. 516–523, doi:10.1145/3321707.3321818. 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.' date_created: 2023-11-14T15:58:52Z date_updated: 2023-12-13T10:42:24Z department: - _id: '819' doi: 10.1145/3321707.3321818 extern: '1' keyword: - biased mutation - combinatorial optimization - minimum spanning tree - multi-objective optimization language: - iso: eng page: 516–523 place: New York, NY, USA publication: Proceedings of the Genetic and Evolutionary Computation Conference publication_identifier: isbn: - 978-1-4503-6111-8 publication_status: published publisher: Association for Computing Machinery series_title: GECCO ’19 status: public title: On the Benefits of Biased Edge-Exchange Mutation for the Multi-Criteria Spanning Tree Problem type: conference user_id: '102979' year: '2019' ... --- _id: '1163' abstract: - lang: eng text: "In this paper we present two major results:\r\nFirst, we introduce the first self-stabilizing version of a supervised overlay network (as introduced in~\\cite{DBLP:conf/ispan/KothapalliS05}) by presenting a self-stabilizing supervised skip ring.\r\nSecondly, we show how to use the self-stabilizing supervised skip ring to construct an efficient self-stabilizing publish-subscribe system.\r\nThat is, in addition to stabilizing the overlay network, every subscriber of a topic will eventually know all of the publications that have been issued so far for that topic. The communication work needed to processes a subscribe or unsubscribe operation is just a constant in a legitimate state, and the communication work of checking whether the system is still in a legitimate state is just a constant on expectation for the supervisor as well as any process in the system.\r\n" author: - first_name: Michael full_name: Feldmann, Michael id: '23538' last_name: Feldmann - first_name: Christina full_name: Kolb, Christina id: '43647' last_name: Kolb - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Thim Frederik full_name: Strothmann, Thim Frederik id: '11319' last_name: Strothmann citation: ama: 'Feldmann M, Kolb C, Scheideler C, Strothmann TF. Self-Stabilizing Supervised Publish-Subscribe Systems. In: Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS). IEEE; 2018. doi:10.1109/IPDPS.2018.00114' apa: 'Feldmann, M., Kolb, C., Scheideler, C., & Strothmann, T. F. (2018). Self-Stabilizing Supervised Publish-Subscribe Systems. In Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS). Vancouver: IEEE. https://doi.org/10.1109/IPDPS.2018.00114' bibtex: '@inproceedings{Feldmann_Kolb_Scheideler_Strothmann_2018, title={Self-Stabilizing Supervised Publish-Subscribe Systems}, DOI={10.1109/IPDPS.2018.00114}, booktitle={Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS)}, publisher={IEEE}, author={Feldmann, Michael and Kolb, Christina and Scheideler, Christian and Strothmann, Thim Frederik}, year={2018} }' chicago: Feldmann, Michael, Christina Kolb, Christian Scheideler, and Thim Frederik Strothmann. “Self-Stabilizing Supervised Publish-Subscribe Systems.” In Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS). IEEE, 2018. https://doi.org/10.1109/IPDPS.2018.00114. ieee: M. Feldmann, C. Kolb, C. Scheideler, and T. F. Strothmann, “Self-Stabilizing Supervised Publish-Subscribe Systems,” in Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS), Vancouver, 2018. mla: Feldmann, Michael, et al. “Self-Stabilizing Supervised Publish-Subscribe Systems.” Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS), IEEE, 2018, doi:10.1109/IPDPS.2018.00114. short: 'M. Feldmann, C. Kolb, C. Scheideler, T.F. Strothmann, in: Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS), IEEE, 2018.' conference: end_date: 2018-5-24 location: Vancouver name: 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS) start_date: 2018-5-22 date_created: 2018-02-01T13:56:01Z date_updated: 2022-01-06T06:51:05Z ddc: - '040' department: - _id: '79' - _id: '66' doi: 10.1109/IPDPS.2018.00114 external_id: arxiv: - '1710.08128' file: - access_level: closed content_type: application/pdf creator: mfeldma2 date_created: 2018-10-31T13:25:37Z date_updated: 2018-10-31T13:25:37Z file_id: '5211' file_name: 08425258.pdf file_size: 239559 relation: main_file success: 1 file_date_updated: 2018-10-31T13:25:37Z has_accepted_license: '1' keyword: - Topological Self-stabilization - Supervised Overlay - Publish-Subscribe System language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 publication: Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS) publisher: IEEE status: public title: Self-Stabilizing Supervised Publish-Subscribe Systems type: conference user_id: '11319' year: '2018' ... --- _id: '5675' abstract: - lang: eng text: When responding to natural disasters, professional relief units are often supported by many volunteers which are not affiliated to humanitarian organizations. The effective coordination of these volunteers is crucial to leverage their capabilities and to avoid conflicts with professional relief units. In this paper, we empirically identify key requirements that professional relief units pose on this coordination. Based on these requirements, we suggest a decision model. We computationally solve a real-world instance of the model and empirically validate the computed solution in interviews with practitioners. Our results show that the suggested model allows for solving volunteer coordination tasks of realistic size near-optimally within short time, with the determined solution being well accepted by practitioners. We also describe in this article how the suggested decision support model is integrated in the volunteer coordination system which we develop in joint cooperation with a disaster management authority and a software development company. author: - first_name: Gerhard full_name: Rauchecker, Gerhard last_name: Rauchecker - first_name: Guido full_name: Schryen, Guido id: '72850' last_name: Schryen citation: ama: 'Rauchecker G, Schryen G. Decision Support for the Optimal Coordination of Spontaneous Volunteers in Disaster Relief. In: Proceedings of the 15th International Conference on Information Systems for Crisis Response and Management. ; 2018.' apa: Rauchecker, G., & Schryen, G. (2018). Decision Support for the Optimal Coordination of Spontaneous Volunteers in Disaster Relief. In Proceedings of the 15th International Conference on Information Systems for Crisis Response and Management. Rochester, NY, USA. bibtex: '@inproceedings{Rauchecker_Schryen_2018, title={Decision Support for the Optimal Coordination of Spontaneous Volunteers in Disaster Relief}, booktitle={Proceedings of the 15th International Conference on Information Systems for Crisis Response and Management}, author={Rauchecker, Gerhard and Schryen, Guido}, year={2018} }' chicago: Rauchecker, Gerhard, and Guido Schryen. “Decision Support for the Optimal Coordination of Spontaneous Volunteers in Disaster Relief.” In Proceedings of the 15th International Conference on Information Systems for Crisis Response and Management, 2018. ieee: G. Rauchecker and G. Schryen, “Decision Support for the Optimal Coordination of Spontaneous Volunteers in Disaster Relief,” in Proceedings of the 15th International Conference on Information Systems for Crisis Response and Management, Rochester, NY, USA, 2018. mla: Rauchecker, Gerhard, and Guido Schryen. “Decision Support for the Optimal Coordination of Spontaneous Volunteers in Disaster Relief.” Proceedings of the 15th International Conference on Information Systems for Crisis Response and Management, 2018. short: 'G. Rauchecker, G. Schryen, in: Proceedings of the 15th International Conference on Information Systems for Crisis Response and Management, 2018.' conference: location: Rochester, NY, USA name: 15th International Conference on Information Systems for Crisis Response and Management date_created: 2018-11-14T15:35:54Z date_updated: 2022-01-06T07:02:28Z ddc: - '000' department: - _id: '277' extern: '1' file: - access_level: open_access content_type: application/pdf creator: hsiemes date_created: 2018-12-07T11:25:06Z date_updated: 2018-12-13T15:05:44Z file_id: '6020' file_name: 2018_ISCRAM_Conference_Proceedings - Publication Version.pdf file_size: 488472 relation: main_file file_date_updated: 2018-12-13T15:05:44Z has_accepted_license: '1' keyword: - Coordination of spontaneous volunteers - volunteer coordination system - decision support - scheduling optimization model - linear programming language: - iso: eng oa: '1' publication: Proceedings of the 15th International Conference on Information Systems for Crisis Response and Management status: public title: Decision Support for the Optimal Coordination of Spontaneous Volunteers in Disaster Relief type: conference user_id: '61579' year: '2018' ... --- _id: '4411' abstract: - lang: eng text: "While a lot of research in distributed computing has covered solutions for self-stabilizing computing and topologies, there is far less work on self-stabilization for distributed data structures.\r\nConsidering crashing peers in peer-to-peer networks, it should not be taken for granted that a distributed data structure remains intact.\r\nIn this work, we present a self-stabilizing protocol for a distributed data structure called the hashed Patricia Trie (Kniesburges and Scheideler WALCOM'11) that enables efficient prefix search on a set of keys.\r\nThe data structure has a wide area of applications including string matching problems while offering low overhead and efficient operations when embedded on top of a distributed hash table.\r\nEspecially, longest prefix matching for $x$ can be done in $\\mathcal{O}(\\log |x|)$ hash table read accesses.\r\nWe show how to maintain the structure in a self-stabilizing way.\r\nOur protocol assures low overhead in a legal state and a total (asymptotically optimal) memory demand of $\\Theta(d)$ bits, where $d$ is the number of bits needed for storing all keys." author: - first_name: Till full_name: Knollmann, Till id: '39241' last_name: Knollmann orcid: 0000-0003-2014-4696 - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Knollmann T, Scheideler C. A Self-Stabilizing Hashed Patricia Trie. In: Izumi T, Kuznetsov P, eds. Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS). Vol 11201. Lecture Notes of Computer Science. Springer, Cham; 2018. doi:10.1007/978-3-030-03232-6_1' apa: 'Knollmann, T., & Scheideler, C. (2018). A Self-Stabilizing Hashed Patricia Trie. In T. Izumi & P. Kuznetsov (Eds.), Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) (Vol. 11201). Tokyo: Springer, Cham. https://doi.org/10.1007/978-3-030-03232-6_1' bibtex: '@inproceedings{Knollmann_Scheideler_2018, series={Lecture Notes of Computer Science}, title={A Self-Stabilizing Hashed Patricia Trie}, volume={11201}, DOI={10.1007/978-3-030-03232-6_1}, booktitle={Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}, publisher={Springer, Cham}, author={Knollmann, Till and Scheideler, Christian}, editor={Izumi, Taisuke and Kuznetsov, PetrEditors}, year={2018}, collection={Lecture Notes of Computer Science} }' chicago: Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia Trie.” In Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), edited by Taisuke Izumi and Petr Kuznetsov, Vol. 11201. Lecture Notes of Computer Science. Springer, Cham, 2018. https://doi.org/10.1007/978-3-030-03232-6_1. ieee: T. Knollmann and C. Scheideler, “A Self-Stabilizing Hashed Patricia Trie,” in Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), Tokyo, 2018, vol. 11201. mla: Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia Trie.” Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), edited by Taisuke Izumi and Petr Kuznetsov, vol. 11201, Springer, Cham, 2018, doi:10.1007/978-3-030-03232-6_1. short: 'T. Knollmann, C. Scheideler, in: T. Izumi, P. Kuznetsov (Eds.), Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), Springer, Cham, 2018.' conference: end_date: 2018-11-07 location: Tokyo name: 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) start_date: 2018-11-04 date_created: 2018-09-17T13:12:18Z date_updated: 2022-01-06T07:01:02Z ddc: - '000' department: - _id: '63' - _id: '79' doi: 10.1007/978-3-030-03232-6_1 editor: - first_name: Taisuke full_name: Izumi, Taisuke last_name: Izumi - first_name: Petr full_name: Kuznetsov, Petr last_name: Kuznetsov external_id: arxiv: - '1809.04923' file: - access_level: closed content_type: application/pdf creator: ups date_created: 2018-11-02T14:38:37Z date_updated: 2018-11-02T14:38:37Z file_id: '5277' file_name: ASelf-stabilizingHashedPatrici.pdf file_size: 500005 relation: main_file success: 1 file_date_updated: 2018-11-02T14:38:37Z has_accepted_license: '1' intvolume: ' 11201' keyword: - Self-Stabilizing - Prefix Search - Distributed Data Structure language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 publication: Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) publisher: Springer, Cham series_title: Lecture Notes of Computer Science status: public title: A Self-Stabilizing Hashed Patricia Trie type: conference user_id: '39241' volume: 11201 year: '2018' ... --- _id: '9999' 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. author: - first_name: Andreas full_name: Unger, Andreas last_name: Unger - first_name: Matthias full_name: Hunstig, Matthias last_name: Hunstig - first_name: Tobias full_name: Meyer, Tobias last_name: Meyer - first_name: Michael full_name: Brökelmann, Michael last_name: Brökelmann - first_name: Walter full_name: Sextro, Walter id: '21220' last_name: Sextro citation: ama: 'Unger A, Hunstig M, Meyer T, Brökelmann M, Sextro W. Intelligent Production of Wire Bonds using Multi-Objective Optimization – Insights, Opportunities and Challenges. In: In Proceedings of IMAPS 2018 – 51st Symposium on Microelectronics, Pasadena, CA, 2018. Vol Vol. 2018, No. 1, pp. 000572-000577. ; 2018. doi:10.4071/2380-4505-2018.1.000572' apa: Unger, A., Hunstig, M., Meyer, T., Brökelmann, M., & Sextro, W. (2018). Intelligent Production of Wire Bonds using Multi-Objective Optimization – Insights, Opportunities and Challenges. In In Proceedings of IMAPS 2018 – 51st Symposium on Microelectronics, Pasadena, CA, 2018 (Vol. Vol. 2018, No. 1, pp. 000572-000577.). https://doi.org/10.4071/2380-4505-2018.1.000572 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={10.4071/2380-4505-2018.1.000572}, 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} }' 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 In Proceedings of IMAPS 2018 – 51st Symposium on Microelectronics, Pasadena, CA, 2018, Vol. Vol. 2018, No. 1, pp. 000572-000577., 2018. https://doi.org/10.4071/2380-4505-2018.1.000572. 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 In Proceedings of IMAPS 2018 – 51st Symposium on Microelectronics, Pasadena, CA, 2018, 2018, vol. Vol. 2018, No. 1, pp. 000572-000577. mla: Unger, Andreas, et al. “Intelligent Production of Wire Bonds Using Multi-Objective Optimization – Insights, Opportunities and Challenges.” In Proceedings of IMAPS 2018 – 51st Symposium on Microelectronics, Pasadena, CA, 2018, vol. Vol. 2018, No. 1, pp. 000572-000577., 2018, doi:10.4071/2380-4505-2018.1.000572. 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.' date_created: 2019-05-27T10:27:45Z date_updated: 2020-05-07T05:33:56Z department: - _id: '151' doi: 10.4071/2380-4505-2018.1.000572 keyword: - wire bonding - multi-objective optimization - process model - copper wire - self-optimization language: - iso: eng project: - _id: '92' grant_number: 02 PQ2210 name: Intelligente Herstellung zuverlässiger Kupferbondverbindungen publication: In Proceedings of IMAPS 2018 – 51st Symposium on Microelectronics, Pasadena, CA, 2018 quality_controlled: '1' status: public title: Intelligent Production of Wire Bonds using Multi-Objective Optimization – Insights, Opportunities and Challenges type: conference user_id: '210' volume: Vol. 2018, No. 1, pp. 000572-000577. year: '2018' ... --- _id: '32158' abstract: - lang: eng text: 'Sociogenesis addresses a pervasive problem in psychology given by Cartesian dualism that assigns the mental an inner locus apart from material activity. Aligning ourselves to the ongoing critical discussions of interiorization in psychology, we explore the crucial notion of space by highlighting language as sociocultural and dialogical activity performed by other-oriented individuals. We discuss space in terms of the “language spacetime”, a symbolic, embodied formation of mutually positioned speaking and listening selves. This leads beyond the “inside-outside” container metaphor and allows for a reformulation of interiorization. Interiorization is conceptualized as a continuous series of different, though mutually related movements between self and other and self and self that lead to and are supported by specific formations in language activity: reversion, transposition, and decoupling. Along a short passage of a video-based interview, we trace the reversion of dialogical positions within the addressivity constellation of the two interlocutors, their interactive creation of a heterotopic spacetime, and the decoupling of one speaker''s psychological activity from the concrete here-and-now and the present other by moving and acting into this new sphere. Interiorization appears as a movement at the border of past, present, and possible future(s).' author: - first_name: Marie-Cécile full_name: Bertau, Marie-Cécile last_name: Bertau - first_name: Andrea full_name: Karsten, Andrea id: '53917' last_name: Karsten citation: ama: 'Bertau M-C, Karsten A. Reconsidering interiorization: Self moving across language spacetimes. New Ideas in Psychology. 2018;49:7-17. doi:10.1016/j.newideapsych.2017.12.001' apa: 'Bertau, M.-C., & Karsten, A. (2018). Reconsidering interiorization: Self moving across language spacetimes. New Ideas in Psychology, 49, 7–17. https://doi.org/10.1016/j.newideapsych.2017.12.001' bibtex: '@article{Bertau_Karsten_2018, title={Reconsidering interiorization: Self moving across language spacetimes}, volume={49}, DOI={10.1016/j.newideapsych.2017.12.001}, journal={New Ideas in Psychology}, publisher={Elsevier BV}, author={Bertau, Marie-Cécile and Karsten, Andrea}, year={2018}, pages={7–17} }' chicago: 'Bertau, Marie-Cécile, and Andrea Karsten. “Reconsidering Interiorization: Self Moving across Language Spacetimes.” New Ideas in Psychology 49 (2018): 7–17. https://doi.org/10.1016/j.newideapsych.2017.12.001.' ieee: 'M.-C. Bertau and A. Karsten, “Reconsidering interiorization: Self moving across language spacetimes,” New Ideas in Psychology, vol. 49, pp. 7–17, 2018, doi: 10.1016/j.newideapsych.2017.12.001.' mla: 'Bertau, Marie-Cécile, and Andrea Karsten. “Reconsidering Interiorization: Self Moving across Language Spacetimes.” New Ideas in Psychology, vol. 49, Elsevier BV, 2018, pp. 7–17, doi:10.1016/j.newideapsych.2017.12.001.' short: M.-C. Bertau, A. Karsten, New Ideas in Psychology 49 (2018) 7–17. date_created: 2022-06-24T14:41:20Z date_updated: 2022-07-18T09:21:16Z department: - _id: '424' doi: 10.1016/j.newideapsych.2017.12.001 intvolume: ' 49' keyword: - Interiorization - Dialogical self - Language activity - Voice - Vygotsky - Heterotopia - Video-confrontation language: - iso: eng page: 7-17 publication: New Ideas in Psychology publication_identifier: issn: - 0732-118X publication_status: published publisher: Elsevier BV status: public title: 'Reconsidering interiorization: Self moving across language spacetimes' type: journal_article user_id: '42165' volume: 49 year: '2018' ... --- _id: '9994' abstract: - lang: eng text: Reliability-adaptive systems allow an adaptation of system behavior based on current system reliability. They can extend their lifetime at the cost of lowered performance or vice versa. This can be used to adapt failure behavior according to a maintenance plan, thus increasing availability while using up system capability fully. To facilitate setup, a control algorithm independent of a degradation model is desired. A closed loop control technique for reliability based on a health index, a measure for system degradation, is introduced. It uses self-optimization as means to implement behavior adaptation. This is based on selecting the priorities of objectives that the system pursues. Possible working points are computed beforehand using model-based multiobjective optimization techniques. The controller selects the priorities of objectives and this way balances reliability and performance. As exemplary application, an automatically actuated single plate dry clutch is introduced. The entire reliability control is setup and lifetime experiments are conducted. Results show that the variance of time to failure is reduced greatly, making the failure behavior more predictable. At the same time, the desired usable lifetime can be extended at the cost of system performance to allow for changed maintenance intervals. Together, these possibilities allow for greater system usage and better planning of maintenance. author: - first_name: Tobias full_name: Meyer, Tobias last_name: Meyer citation: ama: Meyer T. Optimization-Based Reliability Control of Mechatronic Systems. Shaker; 2018. apa: Meyer, T. (2018). Optimization-based reliability control of mechatronic systems. Shaker. bibtex: '@book{Meyer_2018, title={Optimization-based reliability control of mechatronic systems}, publisher={Shaker}, author={Meyer, Tobias}, year={2018} }' chicago: Meyer, Tobias. Optimization-Based Reliability Control of Mechatronic Systems. Shaker, 2018. ieee: T. Meyer, Optimization-based reliability control of mechatronic systems. Shaker, 2018. mla: Meyer, Tobias. Optimization-Based Reliability Control of Mechatronic Systems. Shaker, 2018. short: T. Meyer, Optimization-Based Reliability Control of Mechatronic Systems, Shaker, 2018. date_created: 2019-05-27T10:21:17Z date_updated: 2023-09-15T12:26:09Z department: - _id: '151' keyword: - dependability - reliability - behavior adaptation - self-optimization - multiobjective optimization - optimal control - automotive drivetrain - clutch system - reliability-adaptive system language: - iso: eng publisher: Shaker status: public title: Optimization-based reliability control of mechatronic systems type: dissertation user_id: '210' year: '2018' ... --- _id: '48839' abstract: - lang: eng 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. author: - first_name: Jakob full_name: Bossek, Jakob id: '102979' last_name: Bossek orcid: 0000-0002-4121-4668 - first_name: Christian full_name: Grimme, Christian last_name: Grimme - first_name: Stephan full_name: Meisel, Stephan last_name: Meisel - first_name: Günter full_name: Rudolph, Günter last_name: Rudolph - first_name: Heike full_name: Trautmann, Heike last_name: Trautmann citation: ama: 'Bossek J, Grimme C, Meisel S, Rudolph G, Trautmann H. Local Search Effects in Bi-Objective Orienteering. In: Proceedings of the Genetic and Evolutionary Computation Conference. GECCO ’18. Association for Computing Machinery; 2018:585–592. doi:10.1145/3205455.3205548' apa: Bossek, J., Grimme, C., Meisel, S., Rudolph, G., & Trautmann, H. (2018). Local Search Effects in Bi-Objective Orienteering. Proceedings of the Genetic and Evolutionary Computation Conference, 585–592. https://doi.org/10.1145/3205455.3205548 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={10.1145/3205455.3205548}, 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} }' chicago: 'Bossek, Jakob, Christian Grimme, Stephan Meisel, Günter Rudolph, and Heike Trautmann. “Local Search Effects in Bi-Objective Orienteering.” In Proceedings of the Genetic and Evolutionary Computation Conference, 585–592. GECCO ’18. New York, NY, USA: Association for Computing Machinery, 2018. https://doi.org/10.1145/3205455.3205548.' ieee: 'J. Bossek, C. Grimme, S. Meisel, G. Rudolph, and H. Trautmann, “Local Search Effects in Bi-Objective Orienteering,” in Proceedings of the Genetic and Evolutionary Computation Conference, 2018, pp. 585–592, doi: 10.1145/3205455.3205548.' mla: Bossek, Jakob, et al. “Local Search Effects in Bi-Objective Orienteering.” Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, 2018, pp. 585–592, doi:10.1145/3205455.3205548. 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.' date_created: 2023-11-14T15:58:51Z date_updated: 2023-12-13T10:42:14Z department: - _id: '819' doi: 10.1145/3205455.3205548 extern: '1' keyword: - combinatorial optimization - metaheuristics - multi-objective optimization - orienteering - transportation language: - iso: eng page: 585–592 place: New York, NY, USA publication: Proceedings of the Genetic and Evolutionary Computation Conference publication_identifier: isbn: - 978-1-4503-5618-3 publication_status: published publisher: Association for Computing Machinery series_title: GECCO ’18 status: public title: Local Search Effects in Bi-Objective Orienteering type: conference user_id: '102979' year: '2018' ... --- _id: '48867' abstract: - lang: eng text: Assessing the performance of stochastic optimization algorithms in the field of multi-objective optimization is of utmost importance. Besides the visual comparison of the obtained approximation sets, more sophisticated methods have been proposed in the last decade, e. g., a variety of quantitative performance indicators or statistical tests. In this paper, we present tools implemented in the R package ecr, which assist in performing comprehensive and sound comparison and evaluation of multi-objective evolutionary algorithms following recommendations from the literature. author: - first_name: Jakob full_name: Bossek, Jakob id: '102979' last_name: Bossek orcid: 0000-0002-4121-4668 citation: ama: 'Bossek J. Performance Assessment of Multi-Objective Evolutionary Algorithms with the R Package ecr. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion. GECCO ’18. Association for Computing Machinery; 2018:1350–1356. doi:10.1145/3205651.3208312' apa: Bossek, J. (2018). Performance Assessment of Multi-Objective Evolutionary Algorithms with the R Package ecr. Proceedings of the Genetic and Evolutionary Computation Conference Companion, 1350–1356. https://doi.org/10.1145/3205651.3208312 bibtex: '@inproceedings{Bossek_2018, place={New York, NY, USA}, series={GECCO ’18}, title={Performance Assessment of Multi-Objective Evolutionary Algorithms with the R Package ecr}, DOI={10.1145/3205651.3208312}, booktitle={Proceedings of the Genetic and Evolutionary Computation Conference Companion}, publisher={Association for Computing Machinery}, author={Bossek, Jakob}, year={2018}, pages={1350–1356}, collection={GECCO ’18} }' chicago: 'Bossek, Jakob. “Performance Assessment of Multi-Objective Evolutionary Algorithms with the R Package Ecr.” In Proceedings of the Genetic and Evolutionary Computation Conference Companion, 1350–1356. GECCO ’18. New York, NY, USA: Association for Computing Machinery, 2018. https://doi.org/10.1145/3205651.3208312.' ieee: 'J. Bossek, “Performance Assessment of Multi-Objective Evolutionary Algorithms with the R Package ecr,” in Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2018, pp. 1350–1356, doi: 10.1145/3205651.3208312.' mla: Bossek, Jakob. “Performance Assessment of Multi-Objective Evolutionary Algorithms with the R Package Ecr.” Proceedings of the Genetic and Evolutionary Computation Conference Companion, Association for Computing Machinery, 2018, pp. 1350–1356, doi:10.1145/3205651.3208312. short: 'J. Bossek, in: Proceedings of the Genetic and Evolutionary Computation Conference Companion, Association for Computing Machinery, New York, NY, USA, 2018, pp. 1350–1356.' date_created: 2023-11-14T15:58:56Z date_updated: 2023-12-13T10:46:04Z department: - _id: '819' doi: 10.1145/3205651.3208312 extern: '1' keyword: - evolutionary optimization - performance assessment - software-tools language: - iso: eng page: 1350–1356 place: New York, NY, USA publication: Proceedings of the Genetic and Evolutionary Computation Conference Companion publication_identifier: isbn: - 978-1-4503-5764-7 publication_status: published publisher: Association for Computing Machinery series_title: GECCO ’18 status: public title: Performance Assessment of Multi-Objective Evolutionary Algorithms with the R Package ecr type: conference user_id: '102979' year: '2018' ... --- _id: '48885' abstract: - lang: eng text: Performance comparisons of optimization algorithms are heavily influenced by the underlying indicator(s). In this paper we investigate commonly used performance indicators for single-objective stochastic solvers, such as the Penalized Average Runtime (e.g., PAR10) or the Expected Running Time (ERT), based on exemplary benchmark performances of state-of-the-art inexact TSP solvers. Thereby, we introduce a methodology for analyzing the effects of (usually heuristically set) indicator parametrizations - such as the penalty factor and the method used for aggregating across multiple runs - w.r.t. the robustness of the considered optimization algorithms. author: - first_name: Pascal full_name: Kerschke, Pascal last_name: Kerschke - first_name: Jakob full_name: Bossek, Jakob id: '102979' last_name: Bossek orcid: 0000-0002-4121-4668 - first_name: Heike full_name: Trautmann, Heike last_name: Trautmann citation: ama: 'Kerschke P, Bossek J, Trautmann H. Parameterization of State-of-the-Art Performance Indicators: A Robustness Study Based on Inexact TSP Solvers. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion. GECCO’18. Association for Computing Machinery; 2018:1737–1744. doi:10.1145/3205651.3208233' apa: 'Kerschke, P., Bossek, J., & Trautmann, H. (2018). Parameterization of State-of-the-Art Performance Indicators: A Robustness Study Based on Inexact TSP Solvers. Proceedings of the Genetic and Evolutionary Computation Conference Companion, 1737–1744. https://doi.org/10.1145/3205651.3208233' bibtex: '@inproceedings{Kerschke_Bossek_Trautmann_2018, place={New York, NY, USA}, series={GECCO’18}, title={Parameterization of State-of-the-Art Performance Indicators: A Robustness Study Based on Inexact TSP Solvers}, DOI={10.1145/3205651.3208233}, booktitle={Proceedings of the Genetic and Evolutionary Computation Conference Companion}, publisher={Association for Computing Machinery}, author={Kerschke, Pascal and Bossek, Jakob and Trautmann, Heike}, year={2018}, pages={1737–1744}, collection={GECCO’18} }' chicago: 'Kerschke, Pascal, Jakob Bossek, and Heike Trautmann. “Parameterization of State-of-the-Art Performance Indicators: A Robustness Study Based on Inexact TSP Solvers.” In Proceedings of the Genetic and Evolutionary Computation Conference Companion, 1737–1744. GECCO’18. New York, NY, USA: Association for Computing Machinery, 2018. https://doi.org/10.1145/3205651.3208233.' ieee: 'P. Kerschke, J. Bossek, and H. Trautmann, “Parameterization of State-of-the-Art Performance Indicators: A Robustness Study Based on Inexact TSP Solvers,” in Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2018, pp. 1737–1744, doi: 10.1145/3205651.3208233.' mla: 'Kerschke, Pascal, et al. “Parameterization of State-of-the-Art Performance Indicators: A Robustness Study Based on Inexact TSP Solvers.” Proceedings of the Genetic and Evolutionary Computation Conference Companion, Association for Computing Machinery, 2018, pp. 1737–1744, doi:10.1145/3205651.3208233.' short: 'P. Kerschke, J. Bossek, H. Trautmann, in: Proceedings of the Genetic and Evolutionary Computation Conference Companion, Association for Computing Machinery, New York, NY, USA, 2018, pp. 1737–1744.' date_created: 2023-11-14T15:58:59Z date_updated: 2023-12-13T10:48:38Z department: - _id: '819' doi: 10.1145/3205651.3208233 extern: '1' keyword: - algorithm selection - optimization - performance measures - transportation - travelling salesperson problem language: - iso: eng page: 1737–1744 place: New York, NY, USA publication: Proceedings of the Genetic and Evolutionary Computation Conference Companion publication_identifier: isbn: - 978-1-4503-5764-7 publisher: Association for Computing Machinery series_title: GECCO’18 status: public title: 'Parameterization of State-of-the-Art Performance Indicators: A Robustness Study Based on Inexact TSP Solvers' type: conference user_id: '102979' year: '2018' ... --- _id: '4419' abstract: - lang: eng text: Research on entrepreneurial learning highlights the importance of experience and prior knowledge to entrepreneurial success. However, a conundrum remains and we are still seeking answers as to why some novice entrepreneurs learn successfully from their experiences and succeed, while some experienced entrepreneurs fail with their ventures. In order to advance the discussion about the role of experience during entrepreneurial learning, our critical reflection aims to (1) highlight some of the shortcomings of experiential learning theory (ELT) and (2) illustrate how alternative theoretical perspectives have the potential to advance our conceptual understanding of entrepreneurial learning processes. We argue for an explanation of entrepreneurial learning as a dynamic and self-regulated process that relies on planning, monitoring, and self-reflection. author: - first_name: Alexander Paul full_name: Fust, Alexander Paul last_name: Fust - first_name: Tobias full_name: Jenert, Tobias id: '71994' last_name: Jenert orcid: ' https://orcid.org/0000-0001-9262-5646' - first_name: Christoph full_name: Winkler, Christoph last_name: Winkler citation: ama: 'Fust AP, Jenert T, Winkler C. Experiential or Self-Regulated Learning: A Critical Reflection of Entrepreneurial Learning Processes. Entrepreneurship Research Journal. 2018;8(2):1-11.' apa: 'Fust, A. P., Jenert, T., & Winkler, C. (2018). Experiential or Self-Regulated Learning: A Critical Reflection of Entrepreneurial Learning Processes. Entrepreneurship Research Journal, 8(2), 1–11.' bibtex: '@article{Fust_Jenert_Winkler_2018, title={Experiential or Self-Regulated Learning: A Critical Reflection of Entrepreneurial Learning Processes}, volume={8}, number={2}, journal={Entrepreneurship Research Journal}, publisher={de @Gruyter}, author={Fust, Alexander Paul and Jenert, Tobias and Winkler, Christoph}, year={2018}, pages={1–11} }' chicago: 'Fust, Alexander Paul, Tobias Jenert, and Christoph Winkler. “Experiential or Self-Regulated Learning: A Critical Reflection of Entrepreneurial Learning Processes.” Entrepreneurship Research Journal 8, no. 2 (2018): 1–11.' ieee: 'A. P. Fust, T. Jenert, and C. Winkler, “Experiential or Self-Regulated Learning: A Critical Reflection of Entrepreneurial Learning Processes,” Entrepreneurship Research Journal, vol. 8, no. 2, pp. 1–11, 2018.' mla: 'Fust, Alexander Paul, et al. “Experiential or Self-Regulated Learning: A Critical Reflection of Entrepreneurial Learning Processes.” Entrepreneurship Research Journal, vol. 8, no. 2, de @Gruyter, 2018, pp. 1–11.' short: A.P. Fust, T. Jenert, C. Winkler, Entrepreneurship Research Journal 8 (2018) 1–11. date_created: 2018-09-18T08:47:00Z date_updated: 2024-03-21T14:43:08Z department: - _id: '208' - _id: '282' intvolume: ' 8' issue: '2' keyword: - entrepreneurial learning - experiential learning - self-regulated learning language: - iso: eng page: 1-11 publication: Entrepreneurship Research Journal publication_identifier: unknown: - 2194-6175 publisher: de @Gruyter quality_controlled: '1' status: public title: 'Experiential or Self-Regulated Learning: A Critical Reflection of Entrepreneurial Learning Processes' type: journal_article user_id: '71994' volume: 8 year: '2018' ... --- _id: '9862' abstract: - lang: eng text: 'In order to improve the credibility of modern simulation tools, uncertainties of different kinds have to be considered. This work is focused on epistemic uncertainties in the framework of continuum mechanics, which are taken into account by fuzzy analysis. The underlying min-max optimization problem of the extension principle is approximated by α-discretization, resulting in a separation of minimum and maximum problems. To become more universal, so-called quantities of interest are employed, which allow a general formulation for the target problem of interest. In this way, the relation to parameter identification problems based on least-squares functions is highlighted. The solutions of the related optimization problems with simple constraints are obtained with a gradient-based scheme, which is derived from a sensitvity analysis for the target problem by means of a variational formulation. Two numerical examples for the fuzzy analysis of material parameters are concerned with a necking problem at large strain elastoplasticity and a perforated strip at large strain hyperelasticity to demonstrate the versatility of the proposed variational formulation. ' author: - first_name: Rolf full_name: Mahnken, Rolf last_name: Mahnken citation: ama: Mahnken R. “A variational formulation for fuzzy analysis in continuum mechanics.” Mathematics and Mechanics of complex systems. 2017;5(3-4). apa: Mahnken, R. (2017). “A variational formulation for fuzzy analysis in continuum mechanics.” Mathematics and Mechanics of Complex Systems, 5(3–4). bibtex: '@article{Mahnken_2017, title={“A variational formulation for fuzzy analysis in continuum mechanics”}, volume={5}, number={3–4}, journal={Mathematics and Mechanics of complex systems}, author={Mahnken, Rolf}, year={2017} }' chicago: Mahnken, Rolf. “‘A Variational Formulation for Fuzzy Analysis in Continuum Mechanics.’” Mathematics and Mechanics of Complex Systems 5, no. 3–4 (2017). ieee: R. Mahnken, “‘A variational formulation for fuzzy analysis in continuum mechanics,’” Mathematics and Mechanics of complex systems, vol. 5, no. 3–4, 2017. mla: Mahnken, Rolf. “‘A Variational Formulation for Fuzzy Analysis in Continuum Mechanics.’” Mathematics and Mechanics of Complex Systems, vol. 5, no. 3–4, 2017. short: R. Mahnken, Mathematics and Mechanics of Complex Systems 5 (2017). date_created: 2019-05-20T11:36:47Z date_updated: 2019-05-27T12:54:35Z department: - _id: '154' intvolume: ' 5' issue: 3-4 keyword: - fuzzy analysis - α-level optimization - quantities of interest - optimization with simple constraints - large strain elasticity - large strain elastoplasticity language: - iso: eng main_file_link: - open_access: '1' url: https://msp.org/memocs/2017/5-3/memocs-v5-n3-p03-s.pdf oa: '1' publication: Mathematics and Mechanics of complex systems publication_identifier: issn: - ' 2325-3444' publication_status: published status: public title: '"A variational formulation for fuzzy analysis in continuum mechanics"' type: journal_article user_id: '78813' volume: 5 year: '2017' ... --- _id: '9976' abstract: - lang: eng text: State-of-the-art mechatronic systems offer inherent intelligence that enables them to autonomously adapt their behavior to current environmental conditions and to their own system state. This autonomous behavior adaptation is made possible by software in combination with complex sensor and actuator systems and by sophisticated information processing, all of which make these systems increasingly complex. This increasing complexity makes the design process a challenging task and brings new complex possibilities for operation and maintenance. However, with the risk of increased system complexity also comes the chance to adapt system behavior based on current reliability, which in turn increases reliability. The development of such an adaption strategy requires appropriate methods to evaluate reliability based on currently selected system behavior. A common approach to implement such adaptivity is to base system behavior on different working points that are obtained using multiobjective optimization. During operation, selection among these allows a changed operating strategy. To allow for multiobjective optimization, an accurate system model including system reliability is required. This model is repeatedly evaluated by the optimization algorithm. At present, modeling of system reliability and synchronization of the models of behavior and reliability is a laborious manual task and thus very error-prone. Since system behavior is crucial for system reliability, an integrated model is introduced that integrates system behavior and system reliability. The proposed approach is used to formulate reliability-related objective functions for a clutch test rig that are used to compute feasible working points using multiobjective optimization. author: - first_name: Thorben full_name: Kaul, Thorben id: '14802' last_name: Kaul - first_name: Tobias full_name: Meyer, Tobias last_name: Meyer - first_name: Walter full_name: Sextro, Walter id: '21220' last_name: Sextro citation: ama: Kaul T, Meyer T, Sextro W. Formulation of reliability-related objective functions for design of intelligent mechatronic systems. SAGE Journals. 2017;Vol. 231(4):390-399. doi:10.1177/1748006X17709376 apa: Kaul, T., Meyer, T., & Sextro, W. (2017). Formulation of reliability-related objective functions for design of intelligent mechatronic systems. SAGE Journals, Vol. 231(4), 390–399. https://doi.org/10.1177/1748006X17709376 bibtex: '@article{Kaul_Meyer_Sextro_2017, title={Formulation of reliability-related objective functions for design of intelligent mechatronic systems}, volume={Vol. 231(4)}, DOI={10.1177/1748006X17709376}, journal={SAGE Journals}, author={Kaul, Thorben and Meyer, Tobias and Sextro, Walter}, year={2017}, pages={390–399} }' chicago: 'Kaul, Thorben, Tobias Meyer, and Walter Sextro. “Formulation of Reliability-Related Objective Functions for Design of Intelligent Mechatronic Systems.” SAGE Journals Vol. 231(4) (2017): 390–99. https://doi.org/10.1177/1748006X17709376.' ieee: T. Kaul, T. Meyer, and W. Sextro, “Formulation of reliability-related objective functions for design of intelligent mechatronic systems,” SAGE Journals, vol. Vol. 231(4), pp. 390–399, 2017. mla: Kaul, Thorben, et al. “Formulation of Reliability-Related Objective Functions for Design of Intelligent Mechatronic Systems.” SAGE Journals, vol. Vol. 231(4), 2017, pp. 390–99, doi:10.1177/1748006X17709376. short: T. Kaul, T. Meyer, W. Sextro, SAGE Journals Vol. 231(4) (2017) 390–399. date_created: 2019-05-27T09:37:46Z date_updated: 2019-09-16T10:20:49Z department: - _id: '151' doi: 10.1177/1748006X17709376 keyword: - Integrated model - reliability - system behavior - Bayesian network - multiobjective optimization language: - iso: eng page: 390 - 399 publication: SAGE Journals quality_controlled: '1' status: public title: Formulation of reliability-related objective functions for design of intelligent mechatronic systems type: journal_article user_id: '55222' volume: Vol. 231(4) year: '2017' ... --- _id: '9978' abstract: - lang: eng text: Piezoelectric transducers are used in a wide range of applications. Reliability of these transducers is an important aspect in their application. Prognostics, which involve continuous monitoring of the health of technical systems and using this information to estimate the current health state and consequently predict the remaining useful lifetime (RUL), can be used to increase the reliability, safety, and availability of the transducers. This is achieved by utilizing the health state and RUL predictions to adaptively control the usage of the components or to schedule appropriate maintenance without interrupting operation. In this work, a prognostic approach utilizing self-sensing, where electric signals of a piezoelectric transducer are used as the condition monitoring data, is proposed. The approach involves training machine learning algorithms to model the degradation of the transducers through a health index and the use of the learned model to estimate the health index of similar transducers. The current health index is then used to estimate RUL of test components. The feasibility of the approach is demonstrated using piezoelectric bimorphs and the results show that the method is accurate in predicting the health index and RUL. author: - first_name: James Kuria full_name: Kimotho, James Kuria last_name: Kimotho - first_name: Walter full_name: Sextro, Walter id: '21220' last_name: Sextro - first_name: Tobias full_name: Hemsel, Tobias id: '210' last_name: Hemsel citation: ama: 'Kimotho JK, Sextro W, Hemsel T. Estimation of Remaining Useful Lifetime of Piezoelectric Transducers Based on Self-Sensing. In: IEEE Transactions on Reliability. ; 2017:1-10. doi:10.1109/TR.2017.2710260' apa: Kimotho, J. K., Sextro, W., & Hemsel, T. (2017). Estimation of Remaining Useful Lifetime of Piezoelectric Transducers Based on Self-Sensing. In IEEE Transactions on Reliability (pp. 1–10). https://doi.org/10.1109/TR.2017.2710260 bibtex: '@inproceedings{Kimotho_Sextro_Hemsel_2017, title={Estimation of Remaining Useful Lifetime of Piezoelectric Transducers Based on Self-Sensing}, DOI={10.1109/TR.2017.2710260}, booktitle={IEEE Transactions on Reliability}, author={Kimotho, James Kuria and Sextro, Walter and Hemsel, Tobias}, year={2017}, pages={1–10} }' chicago: Kimotho, James Kuria, Walter Sextro, and Tobias Hemsel. “Estimation of Remaining Useful Lifetime of Piezoelectric Transducers Based on Self-Sensing.” In IEEE Transactions on Reliability, 1–10, 2017. https://doi.org/10.1109/TR.2017.2710260. ieee: J. K. Kimotho, W. Sextro, and T. Hemsel, “Estimation of Remaining Useful Lifetime of Piezoelectric Transducers Based on Self-Sensing,” in IEEE Transactions on Reliability, 2017, pp. 1–10. mla: Kimotho, James Kuria, et al. “Estimation of Remaining Useful Lifetime of Piezoelectric Transducers Based on Self-Sensing.” IEEE Transactions on Reliability, 2017, pp. 1–10, doi:10.1109/TR.2017.2710260. short: 'J.K. Kimotho, W. Sextro, T. Hemsel, in: IEEE Transactions on Reliability, 2017, pp. 1–10.' date_created: 2019-05-27T09:41:06Z date_updated: 2019-09-16T10:32:05Z department: - _id: '151' doi: 10.1109/TR.2017.2710260 keyword: - Estimation of Remaining Useful Lifetime of Piezoelectric Transducers Based on Self-Sensing language: - iso: eng page: 1 - 10 publication: IEEE Transactions on Reliability quality_controlled: '1' status: public title: Estimation of Remaining Useful Lifetime of Piezoelectric Transducers Based on Self-Sensing type: conference user_id: '55222' year: '2017' ... --- _id: '10676' author: - first_name: Nam full_name: Ho, Nam last_name: Ho - first_name: Paul full_name: Kaufmann, Paul last_name: Kaufmann - first_name: Marco full_name: Platzner, Marco id: '398' last_name: Platzner citation: ama: 'Ho N, Kaufmann P, Platzner M. Evolvable caches: Optimization of reconfigurable cache mappings for a LEON3/Linux-based multi-core processor. In: 2017 International Conference on Field Programmable Technology (ICFPT). ; 2017:215-218. doi:10.1109/FPT.2017.8280144' apa: 'Ho, N., Kaufmann, P., & Platzner, M. (2017). Evolvable caches: Optimization of reconfigurable cache mappings for a LEON3/Linux-based multi-core processor. In 2017 International Conference on Field Programmable Technology (ICFPT) (pp. 215–218). https://doi.org/10.1109/FPT.2017.8280144' bibtex: '@inproceedings{Ho_Kaufmann_Platzner_2017, title={Evolvable caches: Optimization of reconfigurable cache mappings for a LEON3/Linux-based multi-core processor}, DOI={10.1109/FPT.2017.8280144}, booktitle={2017 International Conference on Field Programmable Technology (ICFPT)}, author={Ho, Nam and Kaufmann, Paul and Platzner, Marco}, year={2017}, pages={215–218} }' chicago: 'Ho, Nam, Paul Kaufmann, and Marco Platzner. “Evolvable Caches: Optimization of Reconfigurable Cache Mappings for a LEON3/Linux-Based Multi-Core Processor.” In 2017 International Conference on Field Programmable Technology (ICFPT), 215–18, 2017. https://doi.org/10.1109/FPT.2017.8280144.' ieee: 'N. Ho, P. Kaufmann, and M. Platzner, “Evolvable caches: Optimization of reconfigurable cache mappings for a LEON3/Linux-based multi-core processor,” in 2017 International Conference on Field Programmable Technology (ICFPT), 2017, pp. 215–218.' mla: 'Ho, Nam, et al. “Evolvable Caches: Optimization of Reconfigurable Cache Mappings for a LEON3/Linux-Based Multi-Core Processor.” 2017 International Conference on Field Programmable Technology (ICFPT), 2017, pp. 215–18, doi:10.1109/FPT.2017.8280144.' short: 'N. Ho, P. Kaufmann, M. Platzner, in: 2017 International Conference on Field Programmable Technology (ICFPT), 2017, pp. 215–218.' date_created: 2019-07-10T11:22:59Z date_updated: 2022-01-06T06:50:49Z department: - _id: '78' doi: 10.1109/FPT.2017.8280144 keyword: - Linux - cache storage - microprocessor chips - multiprocessing systems - LEON3-Linux based multicore processor - MiBench suite - block sizes - cache adaptation - evolvable caches - memory-to-cache-index mapping function - processor caches - reconfigurable cache mapping optimization - reconfigurable hardware technology - replacement strategies - standard Linux OS - time a complete hardware implementation - Hardware - Indexes - Linux - Measurement - Multicore processing - Optimization - Training language: - iso: eng page: 215-218 publication: 2017 International Conference on Field Programmable Technology (ICFPT) status: public title: 'Evolvable caches: Optimization of reconfigurable cache mappings for a LEON3/Linux-based multi-core processor' type: conference user_id: '398' year: '2017' ... --- _id: '10780' author: - first_name: Zakarya full_name: Guettatfi, Zakarya last_name: Guettatfi - first_name: Philipp full_name: Hübner, Philipp last_name: Hübner - first_name: Marco full_name: Platzner, Marco id: '398' last_name: Platzner - first_name: Bernhard full_name: Rinner, Bernhard last_name: Rinner citation: ama: 'Guettatfi Z, Hübner P, Platzner M, Rinner B. Computational self-awareness as design approach for visual sensor nodes. In: 12th International Symposium on Reconfigurable Communication-Centric Systems-on-Chip (ReCoSoC). ; 2017:1-8. doi:10.1109/ReCoSoC.2017.8016147' apa: Guettatfi, Z., Hübner, P., Platzner, M., & Rinner, B. (2017). Computational self-awareness as design approach for visual sensor nodes. In 12th International Symposium on Reconfigurable Communication-centric Systems-on-Chip (ReCoSoC) (pp. 1–8). https://doi.org/10.1109/ReCoSoC.2017.8016147 bibtex: '@inproceedings{Guettatfi_Hübner_Platzner_Rinner_2017, title={Computational self-awareness as design approach for visual sensor nodes}, DOI={10.1109/ReCoSoC.2017.8016147}, booktitle={12th International Symposium on Reconfigurable Communication-centric Systems-on-Chip (ReCoSoC)}, author={Guettatfi, Zakarya and Hübner, Philipp and Platzner, Marco and Rinner, Bernhard}, year={2017}, pages={1–8} }' chicago: Guettatfi, Zakarya, Philipp Hübner, Marco Platzner, and Bernhard Rinner. “Computational Self-Awareness as Design Approach for Visual Sensor Nodes.” In 12th International Symposium on Reconfigurable Communication-Centric Systems-on-Chip (ReCoSoC), 1–8, 2017. https://doi.org/10.1109/ReCoSoC.2017.8016147. ieee: Z. Guettatfi, P. Hübner, M. Platzner, and B. Rinner, “Computational self-awareness as design approach for visual sensor nodes,” in 12th International Symposium on Reconfigurable Communication-centric Systems-on-Chip (ReCoSoC), 2017, pp. 1–8. mla: Guettatfi, Zakarya, et al. “Computational Self-Awareness as Design Approach for Visual Sensor Nodes.” 12th International Symposium on Reconfigurable Communication-Centric Systems-on-Chip (ReCoSoC), 2017, pp. 1–8, doi:10.1109/ReCoSoC.2017.8016147. short: 'Z. Guettatfi, P. Hübner, M. Platzner, B. Rinner, in: 12th International Symposium on Reconfigurable Communication-Centric Systems-on-Chip (ReCoSoC), 2017, pp. 1–8.' date_created: 2019-07-10T12:13:15Z date_updated: 2022-01-06T06:50:50Z department: - _id: '78' doi: 10.1109/ReCoSoC.2017.8016147 keyword: - embedded systems - image sensors - power aware computing - wireless sensor networks - Zynq-based VSN node prototype - computational self-awareness - design approach - platform levels - power consumption - visual sensor networks - visual sensor nodes - Cameras - Hardware - Middleware - Multicore processing - Operating systems - Runtime - Reconfigurable platforms - distributed embedded systems - performance-resource trade-off - self-awareness - visual sensor nodes language: - iso: eng page: 1-8 publication: 12th International Symposium on Reconfigurable Communication-centric Systems-on-Chip (ReCoSoC) status: public title: Computational self-awareness as design approach for visual sensor nodes type: conference user_id: '3118' year: '2017' ... --- _id: '29462' abstract: - lang: eng text: Time-variant age information of different parts of a system can be used for system-level performance improvement through high-level task scheduling, thus extending the life-time of the system. Progressive age information should provide the age state that the system is in, and the rate that it is being aged at. In this paper, we propose a structure that monitors certain paths of a circuit and detects its gradual age growth, and provides the aging rate and aging state of the circuit. The proposed monitors are placed on a selected set of nodes that represent a timing bottleneck of the system. These monitors sample expected data on these nodes, and compare them with the expected values. The timing of sampling changes as the circuit ages and its delay increases. The timing of sampling will provide a measure of aging advancement of a circuit. To assess the efficacy of the proposed method and compare it with other state-of-the-art aging monitors, we use them on selected nodes of the execution unit of different processors, as well as some circuits from ITC99 benchmarks. The results reveal that the precision of our proposed method is between 0.12 (ns) to 0.401 (ns). Its Area and power overhead are negligible and are about 2.13 and 0.69 percent respectively. author: - first_name: Somayeh full_name: Sadeghi-Kohan, Somayeh id: '78614' last_name: Sadeghi-Kohan orcid: https://orcid.org/0000-0001-7246-0610 - first_name: Mehdi full_name: Kamal, Mehdi last_name: Kamal - first_name: Zainalabedin full_name: Navabi, Zainalabedin last_name: Navabi citation: ama: Sadeghi-Kohan S, Kamal M, Navabi Z. Self-Adjusting Monitor for Measuring Aging Rate and Advancement. IEEE Transactions on Emerging Topics in Computing. 2017;8(3):627-641. doi:10.1109/tetc.2017.2771441 apa: Sadeghi-Kohan, S., Kamal, M., & Navabi, Z. (2017). Self-Adjusting Monitor for Measuring Aging Rate and Advancement. IEEE Transactions on Emerging Topics in Computing, 8(3), 627–641. https://doi.org/10.1109/tetc.2017.2771441 bibtex: '@article{Sadeghi-Kohan_Kamal_Navabi_2017, title={Self-Adjusting Monitor for Measuring Aging Rate and Advancement}, volume={8}, DOI={10.1109/tetc.2017.2771441}, number={3}, journal={IEEE Transactions on Emerging Topics in Computing}, publisher={Institute of Electrical and Electronics Engineers (IEEE)}, author={Sadeghi-Kohan, Somayeh and Kamal, Mehdi and Navabi, Zainalabedin}, year={2017}, pages={627–641} }' chicago: 'Sadeghi-Kohan, Somayeh, Mehdi Kamal, and Zainalabedin Navabi. “Self-Adjusting Monitor for Measuring Aging Rate and Advancement.” IEEE Transactions on Emerging Topics in Computing 8, no. 3 (2017): 627–41. https://doi.org/10.1109/tetc.2017.2771441.' ieee: 'S. Sadeghi-Kohan, M. Kamal, and Z. Navabi, “Self-Adjusting Monitor for Measuring Aging Rate and Advancement,” IEEE Transactions on Emerging Topics in Computing, vol. 8, no. 3, pp. 627–641, 2017, doi: 10.1109/tetc.2017.2771441.' mla: Sadeghi-Kohan, Somayeh, et al. “Self-Adjusting Monitor for Measuring Aging Rate and Advancement.” IEEE Transactions on Emerging Topics in Computing, vol. 8, no. 3, Institute of Electrical and Electronics Engineers (IEEE), 2017, pp. 627–41, doi:10.1109/tetc.2017.2771441. short: S. Sadeghi-Kohan, M. Kamal, Z. Navabi, IEEE Transactions on Emerging Topics in Computing 8 (2017) 627–641. date_created: 2022-01-19T13:45:51Z date_updated: 2023-08-02T11:36:30Z department: - _id: '48' doi: 10.1109/tetc.2017.2771441 extern: '1' intvolume: ' 8' issue: '3' keyword: - Age advancement - age monitoring clock - aging rate - self-adjusting monitors language: - iso: eng page: 627-641 publication: IEEE Transactions on Emerging Topics in Computing publication_identifier: issn: - 2168-6750 - 2376-4562 publication_status: published publisher: Institute of Electrical and Electronics Engineers (IEEE) status: public title: Self-Adjusting Monitor for Measuring Aging Rate and Advancement type: journal_article user_id: '78614' volume: 8 year: '2017' ... --- _id: '48863' abstract: - lang: eng text: The novel R package ecr (version 2), short for Evolutionary Computation in R, provides a comprehensive collection of building blocks for constructing powerful evolutionary algorithms for single- and multi-objective continuous and combinatorial optimization problems. It allows to solve standard optimization tasks with few lines of code using a black-box approach. Moreover, rapid prototyping of non-standard ideas is possible via an explicit, white-box approach. This paper describes the design principles of the package and gives some introductory examples on how to use the package in practise. author: - first_name: Jakob full_name: Bossek, Jakob id: '102979' last_name: Bossek orcid: 0000-0002-4121-4668 citation: ama: 'Bossek J. Ecr 2.0: A Modular Framework for Evolutionary Computation in R. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion. GECCO ’17. Association for Computing Machinery; 2017:1187–1193. doi:10.1145/3067695.3082470' apa: 'Bossek, J. (2017). Ecr 2.0: A Modular Framework for Evolutionary Computation in R. Proceedings of the Genetic and Evolutionary Computation Conference Companion, 1187–1193. https://doi.org/10.1145/3067695.3082470' bibtex: '@inproceedings{Bossek_2017, place={New York, NY, USA}, series={GECCO ’17}, title={Ecr 2.0: A Modular Framework for Evolutionary Computation in R}, DOI={10.1145/3067695.3082470}, booktitle={Proceedings of the Genetic and Evolutionary Computation Conference Companion}, publisher={Association for Computing Machinery}, author={Bossek, Jakob}, year={2017}, pages={1187–1193}, collection={GECCO ’17} }' chicago: 'Bossek, Jakob. “Ecr 2.0: A Modular Framework for Evolutionary Computation in R.” In Proceedings of the Genetic and Evolutionary Computation Conference Companion, 1187–1193. GECCO ’17. New York, NY, USA: Association for Computing Machinery, 2017. https://doi.org/10.1145/3067695.3082470.' ieee: 'J. Bossek, “Ecr 2.0: A Modular Framework for Evolutionary Computation in R,” in Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2017, pp. 1187–1193, doi: 10.1145/3067695.3082470.' mla: 'Bossek, Jakob. “Ecr 2.0: A Modular Framework for Evolutionary Computation in R.” Proceedings of the Genetic and Evolutionary Computation Conference Companion, Association for Computing Machinery, 2017, pp. 1187–1193, doi:10.1145/3067695.3082470.' short: 'J. Bossek, in: Proceedings of the Genetic and Evolutionary Computation Conference Companion, Association for Computing Machinery, New York, NY, USA, 2017, pp. 1187–1193.' date_created: 2023-11-14T15:58:55Z date_updated: 2023-12-13T10:45:05Z department: - _id: '819' doi: 10.1145/3067695.3082470 extern: '1' keyword: - evolutionary optimization - software-tools language: - iso: eng page: 1187–1193 place: New York, NY, USA publication: Proceedings of the Genetic and Evolutionary Computation Conference Companion publication_identifier: isbn: - 978-1-4503-4939-0 publication_status: published publisher: Association for Computing Machinery series_title: GECCO ’17 status: public title: 'Ecr 2.0: A Modular Framework for Evolutionary Computation in R' type: conference user_id: '102979' year: '2017' ... --- _id: '48857' abstract: - lang: eng text: 'While finding minimum-cost spanning trees (MST) in undirected graphs is solvable in polynomial time, the multi-criteria minimum spanning tree problem (mcMST) is NP-hard. Interestingly, the mcMST problem has not been in focus of evolutionary computation research for a long period of time, although, its relevance for real world problems is easy to see. The available and most notable approaches by Zhou and Gen as well as by Knowles and Corne concentrate on solution encoding and on fairly dated selection mechanisms. In this work, we revisit the mcMST and focus on the mutation operators as exploratory components of evolutionary algorithms neglected so far. We investigate optimal solution characteristics to discuss current mutation strategies, identify shortcomings of these operators, and propose a sub-tree based operator which offers what we term Pareto-beneficial behavior: ensuring convergence and diversity at the same time. The operator is empirically evaluated inside modern standard evolutionary meta-heuristics for multi-criteria optimization and compared to hitherto applied mutation operators in the context of mcMST.' author: - first_name: Jakob full_name: Bossek, Jakob id: '102979' last_name: Bossek orcid: 0000-0002-4121-4668 - first_name: Christian full_name: Grimme, Christian last_name: Grimme citation: ama: 'Bossek J, Grimme C. A Pareto-Beneficial Sub-Tree Mutation for the Multi-Criteria Minimum Spanning Tree Problem. In: 2017 IEEE Symposium Series on Computational Intelligence (SSCI). ; 2017:1–8. doi:10.1109/SSCI.2017.8285183' apa: Bossek, J., & Grimme, C. (2017). A Pareto-Beneficial Sub-Tree Mutation for the Multi-Criteria Minimum Spanning Tree Problem. 2017 IEEE Symposium Series on Computational Intelligence (SSCI), 1–8. https://doi.org/10.1109/SSCI.2017.8285183 bibtex: '@inproceedings{Bossek_Grimme_2017, title={A Pareto-Beneficial Sub-Tree Mutation for the Multi-Criteria Minimum Spanning Tree Problem}, DOI={10.1109/SSCI.2017.8285183}, booktitle={2017 IEEE Symposium Series on Computational Intelligence (SSCI)}, author={Bossek, Jakob and Grimme, Christian}, year={2017}, pages={1–8} }' chicago: Bossek, Jakob, and Christian Grimme. “A Pareto-Beneficial Sub-Tree Mutation for the Multi-Criteria Minimum Spanning Tree Problem.” In 2017 IEEE Symposium Series on Computational Intelligence (SSCI), 1–8, 2017. https://doi.org/10.1109/SSCI.2017.8285183. ieee: 'J. Bossek and C. Grimme, “A Pareto-Beneficial Sub-Tree Mutation for the Multi-Criteria Minimum Spanning Tree Problem,” in 2017 IEEE Symposium Series on Computational Intelligence (SSCI), 2017, pp. 1–8, doi: 10.1109/SSCI.2017.8285183.' mla: Bossek, Jakob, and Christian Grimme. “A Pareto-Beneficial Sub-Tree Mutation for the Multi-Criteria Minimum Spanning Tree Problem.” 2017 IEEE Symposium Series on Computational Intelligence (SSCI), 2017, pp. 1–8, doi:10.1109/SSCI.2017.8285183. short: 'J. Bossek, C. Grimme, in: 2017 IEEE Symposium Series on Computational Intelligence (SSCI), 2017, pp. 1–8.' date_created: 2023-11-14T15:58:54Z date_updated: 2023-12-13T10:44:28Z department: - _id: '819' doi: 10.1109/SSCI.2017.8285183 extern: '1' keyword: - Convergence - Encoding - Euclidean distance - Evolutionary computation - Heating systems - Optimization - Standards language: - iso: eng page: 1–8 publication: 2017 IEEE Symposium Series on Computational Intelligence (SSCI) publication_status: published status: public title: A Pareto-Beneficial Sub-Tree Mutation for the Multi-Criteria Minimum Spanning Tree Problem type: conference user_id: '102979' year: '2017' ... --- _id: '9966' abstract: - lang: eng text: Usage of copper wire bonds allows to push power boundaries imposed by aluminum wire bonds. Copper allows higher electrical, thermal and mechanical loads than aluminum, which currently is the most commonly used material in heavy wire bonding. This is the main driving factor for increased usage of copper in high power applications such as wind turbines, locomotives or electric vehicles. At the same time, usage of copper also increases tool wear and reduces the range of parameter values for a stable process, making the process more challenging. To overcome these drawbacks, parameter adaptation at runtime using self-optimization is desired. A self-optimizing system is based on system objectives that evaluate and quantify system performance. System parameters can be changed at runtime such that pre-selected objective values are reached. For adaptation of bond process parameters, model-based self-optimization is employed. Since it is based on a model of the system, the bond process was modeled. In addition to static model parameters such as wire and substrate material properties and vibration characteristics of transducer and tool, variable model inputs are process parameters. Main simulation result is bonded area in the wiresubstrate contact. This model is then used to find valid and optimal working points before operation. The working point is composed of normal force and ultrasonic voltage trajectories, which are usually determined experimentally. Instead, multiobjective optimalization is used to compute trajectories that simultaneously optimize bond quality, process duration, tool wear and probability of tool-substrate contacts. The values of these objectives are computed using the process model. At runtime, selection among pre-determined optimal working points is sufficient to prioritize individual objectives. This way, the computationally expensive process of numerically solving a multiobjective optimal control problem and the demanding high speed bonding process are separated. To evaluate to what extent the pre-defined goals of self-optimization are met, an offthe- shelf heavy wire bonding machine was modified to allow for parameter adaptation and for transmitting of measurement data at runtime. This data is received by an external computer system and evaluated to select a new working point. Then, new process parameters are sent to the modified bonding machine for use for subsequent bonds. With these components, a full self-optimizing system has been implemented. author: - first_name: Tobias full_name: Meyer , Tobias last_name: 'Meyer ' - first_name: Andreas full_name: Unger, Andreas last_name: Unger - first_name: Simon full_name: Althoff, Simon last_name: Althoff - first_name: Walter full_name: Sextro, Walter id: '21220' last_name: Sextro - first_name: Michael full_name: Brökelmann, Michael last_name: Brökelmann - first_name: Matthias full_name: Hunstig, Matthias last_name: Hunstig - first_name: Karsten full_name: Guth, Karsten last_name: Guth citation: ama: 'Meyer T, Unger A, Althoff S, et al. Reliable Manufacturing of Heavy Copper Wire Bonds Using Online Parameter Adaptation. In: IEEE 66th Electronic Components and Technology Conference. ; 2016:622-628. doi:10.1109/ECTC.2016.215' apa: Meyer , T., Unger, A., Althoff, S., Sextro, W., Brökelmann, M., Hunstig, M., & Guth, K. (2016). Reliable Manufacturing of Heavy Copper Wire Bonds Using Online Parameter Adaptation. In IEEE 66th Electronic Components and Technology Conference (pp. 622–628). https://doi.org/10.1109/ECTC.2016.215 bibtex: '@inproceedings{Meyer _Unger_Althoff_Sextro_Brökelmann_Hunstig_Guth_2016, title={Reliable Manufacturing of Heavy Copper Wire Bonds Using Online Parameter Adaptation}, DOI={10.1109/ECTC.2016.215}, booktitle={IEEE 66th Electronic Components and Technology Conference}, author={Meyer , Tobias and Unger, Andreas and Althoff, Simon and Sextro, Walter and Brökelmann, Michael and Hunstig, Matthias and Guth, Karsten}, year={2016}, pages={622–628} }' chicago: Meyer , Tobias, Andreas Unger, Simon Althoff, Walter Sextro, Michael Brökelmann, Matthias Hunstig, and Karsten Guth. “Reliable Manufacturing of Heavy Copper Wire Bonds Using Online Parameter Adaptation.” In IEEE 66th Electronic Components and Technology Conference, 622–28, 2016. https://doi.org/10.1109/ECTC.2016.215. ieee: T. Meyer et al., “Reliable Manufacturing of Heavy Copper Wire Bonds Using Online Parameter Adaptation,” in IEEE 66th Electronic Components and Technology Conference, 2016, pp. 622–628. mla: Meyer , Tobias, et al. “Reliable Manufacturing of Heavy Copper Wire Bonds Using Online Parameter Adaptation.” IEEE 66th Electronic Components and Technology Conference, 2016, pp. 622–28, doi:10.1109/ECTC.2016.215. short: 'T. Meyer , A. Unger, S. Althoff, W. Sextro, M. Brökelmann, M. Hunstig, K. Guth, in: IEEE 66th Electronic Components and Technology Conference, 2016, pp. 622–628.' date_created: 2019-05-27T09:17:26Z date_updated: 2020-05-07T05:33:53Z department: - _id: '151' doi: 10.1109/ECTC.2016.215 keyword: - Self-optimization - adaptive system - bond process - copper wire language: - iso: eng page: 622-628 project: - _id: '92' grant_number: 02 PQ2210 name: Intelligente Herstellung zuverlässiger Kupferbondverbindungen publication: IEEE 66th Electronic Components and Technology Conference quality_controlled: '1' status: public title: Reliable Manufacturing of Heavy Copper Wire Bonds Using Online Parameter Adaptation type: conference user_id: '210' year: '2016' ... --- _id: '48874' abstract: - lang: eng text: State of the Art inexact solvers of the NP-hard Traveling Salesperson Problem TSP are known to mostly yield high-quality solutions in reasonable computation times. With the purpose of understanding different levels of instance difficulties, instances for the current State of the Art heuristic TSP solvers LKH+restart and EAX+restart are presented which are evolved using a sophisticated evolutionary algorithm. More specifically, the performance differences of the respective solvers are maximized resulting in instances which are easier to solve for one solver and much more difficult for the other. Focusing on both optimization directions, instance features are identified which characterize both types of instances and increase the understanding of solver performance differences. author: - first_name: Jakob full_name: Bossek, Jakob id: '102979' last_name: Bossek orcid: 0000-0002-4121-4668 - first_name: Heike full_name: Trautmann, Heike last_name: Trautmann citation: ama: 'Bossek J, Trautmann H. Understanding Characteristics of Evolved Instances for State-of-the-Art Inexact TSP Solvers with Maximum Performance Difference. In: Proceedings of the XV International Conference of the Italian Association for Artificial Intelligence on Advances in Artificial Intelligence - Volume 10037. AI*IA 2016. Springer-Verlag; 2016:3–12. doi:10.1007/978-3-319-49130-1_1' apa: Bossek, J., & Trautmann, H. (2016). Understanding Characteristics of Evolved Instances for State-of-the-Art Inexact TSP Solvers with Maximum Performance Difference. Proceedings of the XV International Conference of the Italian Association for Artificial Intelligence on Advances in Artificial Intelligence - Volume 10037, 3–12. https://doi.org/10.1007/978-3-319-49130-1_1 bibtex: '@inproceedings{Bossek_Trautmann_2016, place={Berlin, Heidelberg}, series={AI*IA 2016}, title={Understanding Characteristics of Evolved Instances for State-of-the-Art Inexact TSP Solvers with Maximum Performance Difference}, DOI={10.1007/978-3-319-49130-1_1}, booktitle={Proceedings of the XV International Conference of the Italian Association for Artificial Intelligence on Advances in Artificial Intelligence - Volume 10037}, publisher={Springer-Verlag}, author={Bossek, Jakob and Trautmann, Heike}, year={2016}, pages={3–12}, collection={AI*IA 2016} }' chicago: 'Bossek, Jakob, and Heike Trautmann. “Understanding Characteristics of Evolved Instances for State-of-the-Art Inexact TSP Solvers with Maximum Performance Difference.” In Proceedings of the XV International Conference of the Italian Association for Artificial Intelligence on Advances in Artificial Intelligence - Volume 10037, 3–12. AI*IA 2016. Berlin, Heidelberg: Springer-Verlag, 2016. https://doi.org/10.1007/978-3-319-49130-1_1.' ieee: 'J. Bossek and H. Trautmann, “Understanding Characteristics of Evolved Instances for State-of-the-Art Inexact TSP Solvers with Maximum Performance Difference,” in Proceedings of the XV International Conference of the Italian Association for Artificial Intelligence on Advances in Artificial Intelligence - Volume 10037, 2016, pp. 3–12, doi: 10.1007/978-3-319-49130-1_1.' mla: Bossek, Jakob, and Heike Trautmann. “Understanding Characteristics of Evolved Instances for State-of-the-Art Inexact TSP Solvers with Maximum Performance Difference.” Proceedings of the XV International Conference of the Italian Association for Artificial Intelligence on Advances in Artificial Intelligence - Volume 10037, Springer-Verlag, 2016, pp. 3–12, doi:10.1007/978-3-319-49130-1_1. short: 'J. Bossek, H. Trautmann, in: Proceedings of the XV International Conference of the Italian Association for Artificial Intelligence on Advances in Artificial Intelligence - Volume 10037, Springer-Verlag, Berlin, Heidelberg, 2016, pp. 3–12.' date_created: 2023-11-14T15:58:57Z date_updated: 2023-12-13T10:47:11Z doi: 10.1007/978-3-319-49130-1_1 extern: '1' keyword: - Combinatorial optimization - Instance hardness - Metaheuristics - Transportation - TSP language: - iso: eng page: 3–12 place: Berlin, Heidelberg publication: Proceedings of the XV International Conference of the Italian Association for Artificial Intelligence on Advances in Artificial Intelligence - Volume 10037 publication_identifier: isbn: - 978-3-319-49129-5 publication_status: published publisher: Springer-Verlag series_title: AI*IA 2016 status: public title: Understanding Characteristics of Evolved Instances for State-of-the-Art Inexact TSP Solvers with Maximum Performance Difference type: conference user_id: '102979' year: '2016' ... --- _id: '1772' author: - first_name: Jim full_name: Torresen, Jim last_name: Torresen - first_name: Christian full_name: Plessl, Christian id: '16153' last_name: Plessl orcid: 0000-0001-5728-9982 - first_name: Xin full_name: Yao, Xin last_name: Yao citation: ama: Torresen J, Plessl C, Yao X. Self-Aware and Self-Expressive Systems – Guest Editor’s Introduction. IEEE Computer. 2015;48(7):18-20. doi:10.1109/MC.2015.205 apa: Torresen, J., Plessl, C., & Yao, X. (2015). Self-Aware and Self-Expressive Systems – Guest Editor’s Introduction. IEEE Computer, 48(7), 18–20. https://doi.org/10.1109/MC.2015.205 bibtex: '@article{Torresen_Plessl_Yao_2015, title={Self-Aware and Self-Expressive Systems – Guest Editor’s Introduction}, volume={48}, DOI={10.1109/MC.2015.205}, number={7}, journal={IEEE Computer}, publisher={IEEE Computer Society}, author={Torresen, Jim and Plessl, Christian and Yao, Xin}, year={2015}, pages={18–20} }' chicago: 'Torresen, Jim, Christian Plessl, and Xin Yao. “Self-Aware and Self-Expressive Systems – Guest Editor’s Introduction.” IEEE Computer 48, no. 7 (2015): 18–20. https://doi.org/10.1109/MC.2015.205.' ieee: J. Torresen, C. Plessl, and X. Yao, “Self-Aware and Self-Expressive Systems – Guest Editor’s Introduction,” IEEE Computer, vol. 48, no. 7, pp. 18–20, 2015. mla: Torresen, Jim, et al. “Self-Aware and Self-Expressive Systems – Guest Editor’s Introduction.” IEEE Computer, vol. 48, no. 7, IEEE Computer Society, 2015, pp. 18–20, doi:10.1109/MC.2015.205. short: J. Torresen, C. Plessl, X. Yao, IEEE Computer 48 (2015) 18–20. date_created: 2018-03-23T14:06:12Z date_updated: 2022-01-06T06:53:19Z ddc: - '000' department: - _id: '27' - _id: '518' - _id: '78' doi: 10.1109/MC.2015.205 file: - access_level: closed content_type: application/pdf creator: ups date_created: 2018-11-02T15:47:45Z date_updated: 2018-11-02T15:47:45Z file_id: '5313' file_name: 07163237.pdf file_size: 5605009 relation: main_file success: 1 file_date_updated: 2018-11-02T15:47:45Z has_accepted_license: '1' intvolume: ' 48' issue: '7' keyword: - self-awareness - self-expression language: - iso: eng page: 18-20 project: - _id: '1' name: SFB 901 - _id: '4' name: SFB 901 - Project Area C - _id: '14' name: SFB 901 - Subproject C2 - _id: '34' grant_number: '610996' name: Self-Adaptive Virtualisation-Aware High-Performance/Low-Energy Heterogeneous System Architectures publication: IEEE Computer publisher: IEEE Computer Society status: public title: Self-Aware and Self-Expressive Systems – Guest Editor's Introduction type: journal_article user_id: '16153' volume: 48 year: '2015' ... --- _id: '5704' abstract: - lang: eng text: 'Advancements in information technology have changed the way customers experience a service encounter and their relationship with service providers. Especially technology-based self-service channels have found their way into the 21st century service economy. While research embraces these channels for their cost-efficiency, it has not examined whether a shift from personal to self-service affects customer–firm relationships. Drawing from the service-dominant logic and its central concept of value-in-context, we discuss customers’ value creation in self-service and personal service channels and examine the long-term impact of these channels on customer retention. Using longitudinal customer data, we investigate how the ratio of self-service versus personal service use influences customer defection over time. Our findings suggest that the ratio of self-service to personal service used affects customer defection in a U-shaped manner, with intermediate levels of both self-service and personal service use being associated with the lowest likelihood of defection. We also find that this effect mitigates over time. We conclude that firms should not shift customers toward self-service channels completely, especially not at the beginning of a relationship. Our study underlines the importance of understanding when and how self-service technologies create valuable customer experiences and stresses the notion of actively managing customers’ cocreation of value. ' article_type: original author: - first_name: Anne full_name: Scherer, Anne last_name: Scherer - first_name: Nancy full_name: Wünderlich, Nancy id: '36392' last_name: Wünderlich - first_name: Florian full_name: Von Wangenheim, Florian last_name: Von Wangenheim citation: ama: 'Scherer A, Wünderlich N, Von Wangenheim F. The Value of Self-Service: Long-Term Effects of Technology-Based Self-Service Usage on Customer Retention. MIS Quarterly. 2015;39(1):177-200.' apa: 'Scherer, A., Wünderlich, N., & Von Wangenheim, F. (2015). The Value of Self-Service: Long-Term Effects of Technology-Based Self-Service Usage on Customer Retention. MIS Quarterly, 39(1), 177–200.' bibtex: '@article{Scherer_Wünderlich_Von Wangenheim_2015, title={The Value of Self-Service: Long-Term Effects of Technology-Based Self-Service Usage on Customer Retention.}, volume={39}, number={1}, journal={MIS Quarterly}, publisher={MIS RC}, author={Scherer, Anne and Wünderlich, Nancy and Von Wangenheim, Florian}, year={2015}, pages={177–200} }' chicago: 'Scherer, Anne, Nancy Wünderlich, and Florian Von Wangenheim. “The Value of Self-Service: Long-Term Effects of Technology-Based Self-Service Usage on Customer Retention.” MIS Quarterly 39, no. 1 (2015): 177–200.' ieee: 'A. Scherer, N. Wünderlich, and F. Von Wangenheim, “The Value of Self-Service: Long-Term Effects of Technology-Based Self-Service Usage on Customer Retention.,” MIS Quarterly, vol. 39, no. 1, pp. 177–200, 2015.' mla: 'Scherer, Anne, et al. “The Value of Self-Service: Long-Term Effects of Technology-Based Self-Service Usage on Customer Retention.” MIS Quarterly, vol. 39, no. 1, MIS RC, 2015, pp. 177–200.' short: A. Scherer, N. Wünderlich, F. Von Wangenheim, MIS Quarterly 39 (2015) 177–200. date_created: 2018-11-15T11:36:38Z date_updated: 2022-01-06T07:02:36Z department: - _id: '181' intvolume: ' 39' issue: '1' keyword: - customer defection - customer retention - e-service - longitudinal - Self-service - value-in-context language: - iso: eng page: 177-200 publication: MIS Quarterly publication_identifier: issn: - 0276-7783. publication_status: published publisher: MIS RC status: public title: 'The Value of Self-Service: Long-Term Effects of Technology-Based Self-Service Usage on Customer Retention.' type: journal_article user_id: '37741' volume: 39 year: '2015' ... --- _id: '4464' abstract: - lang: eng text: A highly selective first study phase in many Swiss study programs leads to a rather competitive climate among students. However, the atmosphere at the university is an important factor for students' transition into Higher Education. An important question in this context is whether students' are equipped with different dispositions influencing how they cope with this transition. Other research has already shown that different groups of students can be identified regarding their student behavior. Yet, so far little is known about patterns of variables characterizing students, transitioning successfully. The paper takes advantage of a person-centered approach, i.e. the latent-class analysis, which makes it possible to identify groups of individuals, sharing common attributes. The research was conducted as a longitudinal study during their first year at a Swiss university. The return rate was about 67%, with 820 utilizable questionnaires at t1. Based on the analysis of students' anxiety, intrinsic motivation and self-efficacy, three distinct classes of students could be identified. The first class can be called the "highly motivated and self-confident" students. The second class is characterized by the same pattern, however, on a more intermediate level and the last class can be described as the "least motivated and most anxious" group of students. This study contributes to research and theory on students' transition into higher education and could be a first hint that students' experiences of this transition can vary substantially. author: - first_name: Taiga full_name: Brahm, Taiga last_name: Brahm - first_name: Dietrich full_name: Wagner, Dietrich last_name: Wagner - first_name: Tobias full_name: Jenert, Tobias id: '71994' last_name: Jenert orcid: ' https://orcid.org/0000-0001-9262-5646' citation: ama: 'Brahm T, Wagner D, Jenert T. A person-centred approach to students’ transition into Higher Education. In: ; 2015.' apa: Brahm, T., Wagner, D., & Jenert, T. (2015). A person-centred approach to students’ transition into Higher Education. Presented at the 16th Biennial EARLI Conference for Research on Learning and Instruction, Zypern. bibtex: '@inproceedings{Brahm_Wagner_Jenert_2015, title={A person-centred approach to students’ transition into Higher Education}, author={Brahm, Taiga and Wagner, Dietrich and Jenert, Tobias}, year={2015} }' chicago: Brahm, Taiga, Dietrich Wagner, and Tobias Jenert. “A Person-Centred Approach to Students’ Transition into Higher Education,” 2015. ieee: T. Brahm, D. Wagner, and T. Jenert, “A person-centred approach to students’ transition into Higher Education,” presented at the 16th Biennial EARLI Conference for Research on Learning and Instruction, Zypern, 2015. mla: Brahm, Taiga, et al. A Person-Centred Approach to Students’ Transition into Higher Education. 2015. short: 'T. Brahm, D. Wagner, T. Jenert, in: 2015.' conference: end_date: 2015-08-29 location: Zypern name: 16th Biennial EARLI Conference for Research on Learning and Instruction start_date: 2015-08-25 date_created: 2018-09-18T12:56:31Z date_updated: 2022-01-06T07:01:05Z department: - _id: '208' - _id: '282' extern: '1' keyword: - Quantitative methods - Self-efficacy - Higher education - Motivation and Emotion status: public title: A person-centred approach to students' transition into Higher Education type: conference user_id: '51057' year: '2015' ... --- _id: '9944' abstract: - lang: eng text: Eine Vielzahl von Prozessen in der Chemie und Verfahrenstechnik kann durch Ultraschall positiv beeinflusst werden. Oftmals ist ultraschallinduzierte Kavitation der Hauptwirkmechanismus für die positiven Effekte der Beschallung. Daher ist es notwendig die Kavitationsaktivität während des Prozesses zu quantifizieren um die Beschallung für den jeweiligen Prozess optimal gestalten und überwachen zu können. Eine Möglichkeit der prozessbegleitenden Kavitationsdetektion ist die Auswertung der akustischen Emissionen von oszillierenden und kollabierenden Kavitationsblasen mittels Drucksensoren in der Flüssigkeit. Raue Prozessrandbedingungen wie hohe Temperaturen oder aggressive Flüssigkeiten erschweren es jedoch geeignete Sensoren zu finden. Als Alternative wurde daher die Nutzbarkeit der Rückwirkung von Kavitationsereignissen auf das elektrische Eingansgssignal des Ultraschallwandlers zur Quantifizierung von Kavitation untersucht. Die experimentelle Analyse hat ergeben, dass das Einsetzen und in einigen Fällen auch die Art der Kavitation auf Basis der Rückwirkung auf das Stromsignal des Ultraschallwandlers bestimmt werden kann. Die Stärke der Kavitation war hingegen nicht aus den Stromsignalen abzuleiten. author: - first_name: Peter full_name: Bornmann, Peter last_name: Bornmann - first_name: Tobias full_name: Hemsel, Tobias id: '210' last_name: Hemsel - first_name: Walter full_name: Sextro, Walter id: '21220' last_name: Sextro - first_name: Gianluca full_name: Memoli, Gianluca last_name: Memoli - first_name: Mark full_name: Hodnett, Mark last_name: Hodnett - first_name: Bajram full_name: Zeqiri, Bajram last_name: Zeqiri citation: ama: Bornmann P, Hemsel T, Sextro W, Memoli G, Hodnett M, Zeqiri B. Kavitationsdetektion mittels Self-Sensing-Ultraschallwandler. tm - Technisches Messen. 2015;82(2):73-84. doi:10.1515/teme-2015-0017 apa: Bornmann, P., Hemsel, T., Sextro, W., Memoli, G., Hodnett, M., & Zeqiri, B. (2015). Kavitationsdetektion mittels Self-Sensing-Ultraschallwandler. Tm - Technisches Messen, 82(2), 73–84. https://doi.org/10.1515/teme-2015-0017 bibtex: '@article{Bornmann_Hemsel_Sextro_Memoli_Hodnett_Zeqiri_2015, title={Kavitationsdetektion mittels Self-Sensing-Ultraschallwandler}, volume={82}, DOI={10.1515/teme-2015-0017}, number={2}, journal={tm - Technisches Messen}, author={Bornmann, Peter and Hemsel, Tobias and Sextro, Walter and Memoli, Gianluca and Hodnett, Mark and Zeqiri, Bajram}, year={2015}, pages={73–84} }' chicago: 'Bornmann, Peter, Tobias Hemsel, Walter Sextro, Gianluca Memoli, Mark Hodnett, and Bajram Zeqiri. “Kavitationsdetektion Mittels Self-Sensing-Ultraschallwandler.” Tm - Technisches Messen 82, no. 2 (2015): 73–84. https://doi.org/10.1515/teme-2015-0017.' ieee: P. Bornmann, T. Hemsel, W. Sextro, G. Memoli, M. Hodnett, and B. Zeqiri, “Kavitationsdetektion mittels Self-Sensing-Ultraschallwandler,” tm - Technisches Messen, vol. 82, no. 2, pp. 73–84, 2015. mla: Bornmann, Peter, et al. “Kavitationsdetektion Mittels Self-Sensing-Ultraschallwandler.” Tm - Technisches Messen, vol. 82, no. 2, 2015, pp. 73–84, doi:10.1515/teme-2015-0017. short: P. Bornmann, T. Hemsel, W. Sextro, G. Memoli, M. Hodnett, B. Zeqiri, Tm - Technisches Messen 82 (2015) 73–84. date_created: 2019-05-27T08:13:40Z date_updated: 2019-09-16T10:44:38Z department: - _id: '151' doi: 10.1515/teme-2015-0017 intvolume: ' 82' issue: '2' keyword: - Kavitationsdetektion - Self-Sensing - So- nochemie - Ultraschallwandler language: - iso: eng page: 73-84 popular_science: '1' publication: tm - Technisches Messen status: public title: Kavitationsdetektion mittels Self-Sensing-Ultraschallwandler type: journal_article user_id: '55222' volume: 82 year: '2015' ... --- _id: '9949' abstract: - lang: eng text: Intelligent mechatronic systems other the possibility to adapt system behavior to current dependability. This can be used to assure reliability by controlling system behavior to reach a pre-defined lifetime. By using such closed loop control, the margin of error of useful lifetime of an individual system is lowered. It is also possible to change the pre-defined lifetime during operation, by adapting system behavior to derate component usage. When planning maintenance actions, the remaining useful lifetime of each individual system has to be taken into account. Usually, stochastic properties of a fleet of systems are analyzed to create maintenance plans. Among these, the main factor is the probability of an individual system to last until maintenance. If condition-based maintenance is used, this is updated for each individual system using available information about its current state. By lowering the margin of error of useful lifetime, which directly corresponds to the time until maintenance, extended maintenance periods are made possible. Also using reliability-adaptive operation, a reversal of degradation driven maintenance planning is possible where a maintenance plan is setup not only according to system properties, but mainly to requirements imposed by maintenance personnel or infrastructure. Each system then adapts its behavior accordingly and fails according to the maintenance plan, making better use of maintenance personnel and system capabilities at the same time. In this contribution, the potential of maintenance plan driven system behavior adaptation is shown. A model including adaptation process and maintenance actions is simulated over full system lifetime to assess the advantages gained. author: - first_name: Tobias full_name: Meyer, Tobias last_name: Meyer - first_name: Thorben full_name: Kaul, Thorben id: '14802' last_name: Kaul - first_name: Walter full_name: Sextro, Walter id: '21220' last_name: Sextro citation: ama: 'Meyer T, Kaul T, Sextro W. Advantages of reliability-adaptive system operation for maintenance planning. In: Proceedings of the 9th IFAC Symposium on Fault Detection, Supervision and Safety for Technical Processes. ; 2015:940-945. doi:10.1016/j.ifacol.2015.09.647' apa: Meyer, T., Kaul, T., & Sextro, W. (2015). Advantages of reliability-adaptive system operation for maintenance planning. In Proceedings of the 9th IFAC Symposium on Fault Detection, Supervision and Safety for Technical Processes (pp. 940–945). https://doi.org/10.1016/j.ifacol.2015.09.647 bibtex: '@inproceedings{Meyer_Kaul_Sextro_2015, title={Advantages of reliability-adaptive system operation for maintenance planning}, DOI={10.1016/j.ifacol.2015.09.647}, booktitle={Proceedings of the 9th IFAC Symposium on Fault Detection, Supervision and Safety for Technical Processes}, author={Meyer, Tobias and Kaul, Thorben and Sextro, Walter}, year={2015}, pages={940–945} }' chicago: Meyer, Tobias, Thorben Kaul, and Walter Sextro. “Advantages of Reliability-Adaptive System Operation for Maintenance Planning.” In Proceedings of the 9th IFAC Symposium on Fault Detection, Supervision and Safety for Technical Processes, 940–45, 2015. https://doi.org/10.1016/j.ifacol.2015.09.647. ieee: T. Meyer, T. Kaul, and W. Sextro, “Advantages of reliability-adaptive system operation for maintenance planning,” in Proceedings of the 9th IFAC Symposium on Fault Detection, Supervision and Safety for Technical Processes, 2015, pp. 940–945. mla: Meyer, Tobias, et al. “Advantages of Reliability-Adaptive System Operation for Maintenance Planning.” Proceedings of the 9th IFAC Symposium on Fault Detection, Supervision and Safety for Technical Processes, 2015, pp. 940–45, doi:10.1016/j.ifacol.2015.09.647. short: 'T. Meyer, T. Kaul, W. Sextro, in: Proceedings of the 9th IFAC Symposium on Fault Detection, Supervision and Safety for Technical Processes, 2015, pp. 940–945.' date_created: 2019-05-27T08:29:40Z date_updated: 2019-09-16T10:43:42Z department: - _id: '151' doi: 10.1016/j.ifacol.2015.09.647 keyword: - Adaptive systems - Reliability analysis - Availability - Adaptive control - Maintenance - Self-optimizing systems - Self-optimizing control - Stochastic Petri-nets language: - iso: eng page: 940-945 publication: Proceedings of the 9th IFAC Symposium on Fault Detection, Supervision and Safety for Technical Processes quality_controlled: '1' status: public title: Advantages of reliability-adaptive system operation for maintenance planning type: conference user_id: '55222' year: '2015' ... --- _id: '10673' author: - first_name: Nam full_name: Ho, Nam last_name: Ho - first_name: Abdullah Fathi full_name: Ahmed, Abdullah Fathi last_name: Ahmed - first_name: Paul full_name: Kaufmann, Paul last_name: Kaufmann - first_name: Marco full_name: Platzner, Marco id: '398' last_name: Platzner citation: ama: 'Ho N, Ahmed AF, Kaufmann P, Platzner M. Microarchitectural optimization by means of reconfigurable and evolvable cache mappings. In: Proc. NASA/ESA Conf. Adaptive Hardware and Systems (AHS). ; 2015:1-7. doi:10.1109/AHS.2015.7231178' apa: Ho, N., Ahmed, A. F., Kaufmann, P., & Platzner, M. (2015). Microarchitectural optimization by means of reconfigurable and evolvable cache mappings. In Proc. NASA/ESA Conf. Adaptive Hardware and Systems (AHS) (pp. 1–7). https://doi.org/10.1109/AHS.2015.7231178 bibtex: '@inproceedings{Ho_Ahmed_Kaufmann_Platzner_2015, title={Microarchitectural optimization by means of reconfigurable and evolvable cache mappings}, DOI={10.1109/AHS.2015.7231178}, booktitle={Proc. NASA/ESA Conf. Adaptive Hardware and Systems (AHS)}, author={Ho, Nam and Ahmed, Abdullah Fathi and Kaufmann, Paul and Platzner, Marco}, year={2015}, pages={1–7} }' chicago: Ho, Nam, Abdullah Fathi Ahmed, Paul Kaufmann, and Marco Platzner. “Microarchitectural Optimization by Means of Reconfigurable and Evolvable Cache Mappings.” In Proc. NASA/ESA Conf. Adaptive Hardware and Systems (AHS), 1–7, 2015. https://doi.org/10.1109/AHS.2015.7231178. ieee: N. Ho, A. F. Ahmed, P. Kaufmann, and M. Platzner, “Microarchitectural optimization by means of reconfigurable and evolvable cache mappings,” in Proc. NASA/ESA Conf. Adaptive Hardware and Systems (AHS), 2015, pp. 1–7. mla: Ho, Nam, et al. “Microarchitectural Optimization by Means of Reconfigurable and Evolvable Cache Mappings.” Proc. NASA/ESA Conf. Adaptive Hardware and Systems (AHS), 2015, pp. 1–7, doi:10.1109/AHS.2015.7231178. short: 'N. Ho, A.F. Ahmed, P. Kaufmann, M. Platzner, in: Proc. NASA/ESA Conf. Adaptive Hardware and Systems (AHS), 2015, pp. 1–7.' date_created: 2019-07-10T11:18:00Z date_updated: 2022-01-06T06:50:49Z department: - _id: '78' doi: 10.1109/AHS.2015.7231178 keyword: - cache storage - field programmable gate arrays - multiprocessing systems - parallel architectures - reconfigurable architectures - FPGA - dynamic reconfiguration - evolvable cache mapping - many-core architecture - memory-to-cache address mapping function - microarchitectural optimization - multicore architecture - nature-inspired optimization - parallelization degrees - processor - reconfigurable cache mapping - reconfigurable computing - Field programmable gate arrays - Software - Tuning language: - iso: eng page: 1-7 project: - _id: '31' grant_number: '257906' name: Engineering Proprioception in Computing Systems publication: Proc. NASA/ESA Conf. Adaptive Hardware and Systems (AHS) status: public title: Microarchitectural optimization by means of reconfigurable and evolvable cache mappings type: conference user_id: '3118' year: '2015' ...