---
_id: '21808'
abstract:
- lang: eng
text: "Modern services consist of interconnected components,e.g., microservices
in a service mesh or machine learning functions in a pipeline. These services
can scale and run across multiple network nodes on demand. To process incoming
traffic, service components have to be instantiated and traffic assigned to these
instances, taking capacities, changing demands, and Quality of Service (QoS) requirements
into account. This challenge is usually solved with custom approaches designed
by experts. While this typically works well for the considered scenario, the models
often rely on unrealistic assumptions or on knowledge that is not available in
practice (e.g., a priori knowledge).\r\n\r\nWe propose DeepCoord, a novel deep
reinforcement learning approach that learns how to best coordinate services and
is geared towards realistic assumptions. It interacts with the network and relies
on available, possibly delayed monitoring information. Rather than defining a
complex model or an algorithm on how to achieve an objective, our model-free approach
adapts to various objectives and traffic patterns. An agent is trained offline
without expert knowledge and then applied online with minimal overhead. Compared
to a state-of-the-art heuristic, DeepCoord significantly improves flow throughput
(up to 76%) and overall network utility (more than 2x) on realworld network topologies
and traffic traces. It also supports optimizing multiple, possibly competing objectives,
learns to respect QoS requirements, generalizes to scenarios with unseen, stochastic
traffic, and scales to large real-world networks. For reproducibility and reuse,
our code is publicly available."
article_type: original
author:
- first_name: Stefan Balthasar
full_name: Schneider, Stefan Balthasar
id: '35343'
last_name: Schneider
orcid: 0000-0001-8210-4011
- first_name: Ramin
full_name: Khalili, Ramin
last_name: Khalili
- 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: Artur
full_name: Hecker, Artur
last_name: Hecker
citation:
ama: Schneider SB, Khalili R, Manzoor A, et al. Self-Learning Multi-Objective Service
Coordination Using Deep Reinforcement Learning. Transactions on Network and
Service Management. 2021. doi:10.1109/TNSM.2021.3076503
apa: Schneider, S. B., Khalili, R., Manzoor, A., Qarawlus, H., Schellenberg, R.,
Karl, H., & Hecker, A. (2021). Self-Learning Multi-Objective Service Coordination
Using Deep Reinforcement Learning. Transactions on Network and Service Management.
https://doi.org/10.1109/TNSM.2021.3076503
bibtex: '@article{Schneider_Khalili_Manzoor_Qarawlus_Schellenberg_Karl_Hecker_2021,
title={Self-Learning Multi-Objective Service Coordination Using Deep Reinforcement
Learning}, DOI={10.1109/TNSM.2021.3076503},
journal={Transactions on Network and Service Management}, publisher={IEEE}, author={Schneider,
Stefan Balthasar and Khalili, Ramin and Manzoor, Adnan and Qarawlus, Haydar and
Schellenberg, Rafael and Karl, Holger and Hecker, Artur}, year={2021} }'
chicago: Schneider, Stefan Balthasar, Ramin Khalili, Adnan Manzoor, Haydar Qarawlus,
Rafael Schellenberg, Holger Karl, and Artur Hecker. “Self-Learning Multi-Objective
Service Coordination Using Deep Reinforcement Learning.” Transactions on Network
and Service Management, 2021. https://doi.org/10.1109/TNSM.2021.3076503.
ieee: S. B. Schneider et al., “Self-Learning Multi-Objective Service Coordination
Using Deep Reinforcement Learning,” Transactions on Network and Service Management,
2021.
mla: Schneider, Stefan Balthasar, et al. “Self-Learning Multi-Objective Service
Coordination Using Deep Reinforcement Learning.” Transactions on Network and
Service Management, IEEE, 2021, doi:10.1109/TNSM.2021.3076503.
short: S.B. Schneider, R. Khalili, A. Manzoor, H. Qarawlus, R. Schellenberg, H.
Karl, A. Hecker, Transactions on Network and Service Management (2021).
date_created: 2021-04-27T08:04:16Z
date_updated: 2022-01-06T06:55:15Z
ddc:
- '000'
department:
- _id: '75'
doi: 10.1109/TNSM.2021.3076503
file:
- access_level: open_access
content_type: application/pdf
creator: stschn
date_created: 2021-04-27T08:01:26Z
date_updated: 2021-04-27T08:01:26Z
description: Author version of the accepted paper
file_id: '21809'
file_name: ris-accepted-version.pdf
file_size: 4172270
relation: main_file
file_date_updated: 2021-04-27T08:01:26Z
has_accepted_license: '1'
keyword:
- network management
- service management
- coordination
- reinforcement learning
- self-learning
- self-adaptation
- multi-objective
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: Transactions on Network and Service Management
publisher: IEEE
status: public
title: Self-Learning Multi-Objective Service Coordination Using Deep Reinforcement
Learning
type: journal_article
user_id: '35343'
year: '2021'
...
---
_id: '33854'
abstract:
- lang: eng
text: "Macrodiversity is a key technique to increase the capacity of mobile networks.
It can be realized using coordinated multipoint (CoMP), simultaneously connecting
users to multiple overlapping cells. Selecting which users to serve by how many
and which cells is NP-hard but needs to happen continuously in real time as users
move and channel state changes. Existing approaches often require strict assumptions
about or perfect knowledge of the underlying radio system, its resource allocation
scheme, or user movements, none of which is readily available in practice.\r\n\r\nInstead,
we propose three novel self-learning and self-adapting approaches using model-free
deep reinforcement learning (DRL): DeepCoMP, DD-CoMP, and D3-CoMP. DeepCoMP leverages
central observations and control of all users to select cells almost optimally.
DD-CoMP and D3-CoMP use multi-agent DRL, which allows distributed, robust, and
highly scalable coordination. All three approaches learn from experience and self-adapt
to varying scenarios, reaching 2x higher Quality of Experience than other approaches.
They have very few built-in assumptions and do not need prior system knowledge,
making them more robust to change and better applicable in practice than existing
approaches."
author:
- first_name: Stefan Balthasar
full_name: Schneider, Stefan Balthasar
id: '35343'
last_name: Schneider
orcid: 0000-0001-8210-4011
- 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, Karl H, Khalili R, Hecker A. DeepCoMP: Coordinated Multipoint
Using Multi-Agent Deep Reinforcement Learning.; 2021.'
apa: 'Schneider, S. B., Karl, H., Khalili, R., & Hecker, A. (2021). DeepCoMP:
Coordinated Multipoint Using Multi-Agent Deep Reinforcement Learning.'
bibtex: '@book{Schneider_Karl_Khalili_Hecker_2021, title={DeepCoMP: Coordinated
Multipoint Using Multi-Agent Deep Reinforcement Learning}, author={Schneider,
Stefan Balthasar and Karl, Holger and Khalili, Ramin and Hecker, Artur}, year={2021}
}'
chicago: 'Schneider, Stefan Balthasar, Holger Karl, Ramin Khalili, and Artur Hecker.
DeepCoMP: Coordinated Multipoint Using Multi-Agent Deep Reinforcement Learning,
2021.'
ieee: 'S. B. Schneider, H. Karl, R. Khalili, and A. Hecker, DeepCoMP: Coordinated
Multipoint Using Multi-Agent Deep Reinforcement Learning. 2021.'
mla: 'Schneider, Stefan Balthasar, et al. DeepCoMP: Coordinated Multipoint Using
Multi-Agent Deep Reinforcement Learning. 2021.'
short: 'S.B. Schneider, H. Karl, R. Khalili, A. Hecker, DeepCoMP: Coordinated Multipoint
Using Multi-Agent Deep Reinforcement Learning, 2021.'
date_created: 2022-10-20T16:44:19Z
date_updated: 2022-11-18T09:59:27Z
ddc:
- '004'
department:
- _id: '75'
file:
- access_level: open_access
content_type: application/pdf
creator: stschn
date_created: 2022-10-20T16:41:10Z
date_updated: 2022-10-20T16:41:10Z
file_id: '33855'
file_name: preprint.pdf
file_size: 2521656
relation: main_file
file_date_updated: 2022-10-20T16:41:10Z
has_accepted_license: '1'
keyword:
- mobility management
- coordinated multipoint
- CoMP
- cell selection
- resource management
- reinforcement learning
- multi agent
- MARL
- self-learning
- self-adaptation
- QoE
language:
- iso: eng
oa: '1'
project:
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
- _id: '16'
name: 'SFB 901 - C4: SFB 901 - Subproject C4'
- _id: '1'
name: 'SFB 901: SFB 901'
status: public
title: 'DeepCoMP: Coordinated Multipoint Using Multi-Agent Deep Reinforcement Learning'
type: working_paper
user_id: '477'
year: '2021'
...
---
_id: '25046'
abstract:
- lang: eng
text: While increasing digitalization enables multiple advantages for a
reliable operation of technical systems, a remaining challenge in the context
of condition monitoring is seen in suitable consideration of uncertainties affecting
the monitored system. Therefore, a suitable prognostic approach to predict the
remaining useful lifetime of complex technical systems is required. To handle
different kinds of uncertainties, a novel Multi-Model-Particle Filtering-based
prognostic approach is developed and evaluated by the use case of rubber-metal-elements.
These elements are maintained preventively due to the strong influence of uncertainties
on their behavior. In this paper, two measurement quantities are compared concerning
their ability to establish a prediction of the remaining useful lifetime of the
monitored elements and the influence of present uncertainties. Based on three
performance indices, the results are evaluated. A comparison with predictions
of a classical Particle Filter underlines the superiority of the developed Multi-Model-Particle
Filter. Finally, the value of the developed method for enabling condition monitoring
of technical systems related to uncertainties is given exemplary by a comparison
between the preventive and the predictive maintenance strategy for the use case.
article_number: '210'
article_type: original
author:
- first_name: Amelie
full_name: Bender, Amelie
id: '54290'
last_name: Bender
citation:
ama: Bender A. A Multi-Model-Particle Filtering-Based Prognostic Approach to Consider
Uncertainties in RUL Predictions. Machines. 2021;9(10). doi:10.3390/machines9100210
apa: Bender, A. (2021). A Multi-Model-Particle Filtering-Based Prognostic Approach
to Consider Uncertainties in RUL Predictions. Machines, 9(10), Article
210. https://doi.org/10.3390/machines9100210
bibtex: '@article{Bender_2021, title={A Multi-Model-Particle Filtering-Based Prognostic
Approach to Consider Uncertainties in RUL Predictions}, volume={9}, DOI={10.3390/machines9100210},
number={10210}, journal={Machines}, author={Bender, Amelie}, year={2021} }'
chicago: Bender, Amelie. “A Multi-Model-Particle Filtering-Based Prognostic Approach
to Consider Uncertainties in RUL Predictions.” Machines 9, no. 10 (2021).
https://doi.org/10.3390/machines9100210.
ieee: 'A. Bender, “A Multi-Model-Particle Filtering-Based Prognostic Approach to
Consider Uncertainties in RUL Predictions,” Machines, vol. 9, no. 10, Art.
no. 210, 2021, doi: 10.3390/machines9100210.'
mla: Bender, Amelie. “A Multi-Model-Particle Filtering-Based Prognostic Approach
to Consider Uncertainties in RUL Predictions.” Machines, vol. 9, no. 10,
210, 2021, doi:10.3390/machines9100210.
short: A. Bender, Machines 9 (2021).
date_created: 2021-09-27T07:07:58Z
date_updated: 2022-11-03T11:42:46Z
department:
- _id: '151'
doi: 10.3390/machines9100210
intvolume: ' 9'
issue: '10'
keyword:
- prognostics
- RUL predictions
- particle filter
- uncertainty consideration
- Multi-Model-Particle Filter
- model-based approach
- rubber-metal-elements
- predictive maintenance
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.mdpi.com/2075-1702/9/10/210
oa: '1'
publication: Machines
publication_identifier:
issn:
- 2075-1702
publication_status: published
quality_controlled: '1'
status: public
title: A Multi-Model-Particle Filtering-Based Prognostic Approach to Consider Uncertainties
in RUL Predictions
type: journal_article
user_id: '54290'
volume: 9
year: '2021'
...
---
_id: '46318'
abstract:
- lang: eng
text: 'Multi-objective (MO) optimization, i.e., the simultaneous optimization of
multiple conflicting objectives, is gaining more and more attention in various
research areas, such as evolutionary computation, machine learning (e.g., (hyper-)parameter
optimization), or logistics (e.g., vehicle routing). Many works in this domain
mention the structural problem property of multimodality as a challenge from two
classical perspectives: (1) finding all globally optimal solution sets, and (2)
avoiding to get trapped in local optima. Interestingly, these streams seem to
transfer many traditional concepts of single-objective (SO) optimization into
claims, assumptions, or even terminology regarding the MO domain, but mostly neglect
the understanding of the structural properties as well as the algorithmic search
behavior on a problem’s landscape. However, some recent works counteract this
trend, by investigating the fundamentals and characteristics of MO problems using
new visualization techniques and gaining surprising insights. Using these visual
insights, this work proposes a step towards a unified terminology to capture multimodality
and locality in a broader way than it is usually done. This enables us to investigate
current research activities in multimodal continuous MO optimization and to highlight
new implications and promising research directions for the design of benchmark
suites, the discovery of MO landscape features, the development of new MO (or
even SO) optimization algorithms, and performance indicators. For all these topics,
we provide a review of ideas and methods but also an outlook on future challenges,
research potential and perspectives that result from recent developments.'
author:
- first_name: Christian
full_name: Grimme, Christian
last_name: Grimme
- first_name: Pascal
full_name: Kerschke, Pascal
last_name: Kerschke
- first_name: Pelin
full_name: Aspar, Pelin
last_name: Aspar
- first_name: Heike
full_name: Trautmann, Heike
id: '100740'
last_name: Trautmann
orcid: 0000-0002-9788-8282
- first_name: Mike
full_name: Preuss, Mike
last_name: Preuss
- first_name: André H.
full_name: Deutz, André H.
last_name: Deutz
- first_name: Hao
full_name: Wang, Hao
last_name: Wang
- first_name: Michael
full_name: Emmerich, Michael
last_name: Emmerich
citation:
ama: 'Grimme C, Kerschke P, Aspar P, et al. Peeking beyond peaks: Challenges and
research potentials of continuous multimodal multi-objective optimization. Computers
& Operations Research. 2021;136:105489. doi:https://doi.org/10.1016/j.cor.2021.105489'
apa: 'Grimme, C., Kerschke, P., Aspar, P., Trautmann, H., Preuss, M., Deutz, A.
H., Wang, H., & Emmerich, M. (2021). Peeking beyond peaks: Challenges and
research potentials of continuous multimodal multi-objective optimization. Computers
& Operations Research, 136, 105489. https://doi.org/10.1016/j.cor.2021.105489'
bibtex: '@article{Grimme_Kerschke_Aspar_Trautmann_Preuss_Deutz_Wang_Emmerich_2021,
title={Peeking beyond peaks: Challenges and research potentials of continuous
multimodal multi-objective optimization}, volume={136}, DOI={https://doi.org/10.1016/j.cor.2021.105489},
journal={Computers & Operations Research}, author={Grimme, Christian and Kerschke,
Pascal and Aspar, Pelin and Trautmann, Heike and Preuss, Mike and Deutz, André
H. and Wang, Hao and Emmerich, Michael}, year={2021}, pages={105489} }'
chicago: 'Grimme, Christian, Pascal Kerschke, Pelin Aspar, Heike Trautmann, Mike
Preuss, André H. Deutz, Hao Wang, and Michael Emmerich. “Peeking beyond Peaks:
Challenges and Research Potentials of Continuous Multimodal Multi-Objective Optimization.”
Computers & Operations Research 136 (2021): 105489. https://doi.org/10.1016/j.cor.2021.105489.'
ieee: 'C. Grimme et al., “Peeking beyond peaks: Challenges and research potentials
of continuous multimodal multi-objective optimization,” Computers & Operations
Research, vol. 136, p. 105489, 2021, doi: https://doi.org/10.1016/j.cor.2021.105489.'
mla: 'Grimme, Christian, et al. “Peeking beyond Peaks: Challenges and Research Potentials
of Continuous Multimodal Multi-Objective Optimization.” Computers & Operations
Research, vol. 136, 2021, p. 105489, doi:https://doi.org/10.1016/j.cor.2021.105489.'
short: C. Grimme, P. Kerschke, P. Aspar, H. Trautmann, M. Preuss, A.H. Deutz, H.
Wang, M. Emmerich, Computers & Operations Research 136 (2021) 105489.
date_created: 2023-08-04T07:28:34Z
date_updated: 2023-10-16T12:58:42Z
department:
- _id: '34'
- _id: '819'
doi: https://doi.org/10.1016/j.cor.2021.105489
intvolume: ' 136'
keyword:
- Multimodal optimization
- Multi-objective continuous optimization
- Landscape analysis
- Visualization
- Benchmarking
- Theory
- Algorithms
language:
- iso: eng
page: '105489'
publication: Computers & Operations Research
publication_identifier:
issn:
- 0305-0548
status: public
title: 'Peeking beyond peaks: Challenges and research potentials of continuous multimodal
multi-objective optimization'
type: journal_article
user_id: '15504'
volume: 136
year: '2021'
...
---
_id: '17860'
abstract:
- lang: eng
text: "Purpose\r\nThe purpose of this paper is to identify strategic options and
challenges that arise when an industrial firm moves from providing smart service
toward providing a platform.\r\n\r\nDesign/methodology/approach\r\nThis conceptual
study takes on a multidisciplinary research perspective that integrates concepts,
theories and insights from service management and marketing, information systems
and platform economics.\r\n\r\nFindings\r\nThe paper outlines three platform types
– smart data platform, smart product platform and matching platform – as strategic
options for firms that wish to evolve from smart service providers to platform
providers.\r\n\r\nResearch limitations/implications\r\nInvestigating smart service
platforms calls for launching interdisciplinary research initiatives. Promising
research avenues are outlined to span boundaries that separate different research
disciplines today.\r\n\r\nPractical implications\r\nManaging a successful transition
from providing smart service toward providing a platform requires making significant
investments in IT, platform-related capabilities and skills, as well as implement
new approaches toward relationship management and brand-building.\r\n\r\nOriginality/value\r\nThe
findings described in this paper are valuable to researchers in multiple disciplines
seeking to develop and to justify theory related to platforms in industrial scenarios."
article_type: original
author:
- first_name: Daniel
full_name: Beverungen, Daniel
id: '59677'
last_name: Beverungen
- first_name: Dennis
full_name: Kundisch, Dennis
id: '21117'
last_name: Kundisch
- first_name: Nancy
full_name: Wünderlich, Nancy
id: '36392'
last_name: Wünderlich
citation:
ama: 'Beverungen D, Kundisch D, Wünderlich N. Transforming into a Platform Provider:
Strategic Options for Industrial Smart Service Providers. Journal of Service
Management. 2021;32(4):507-532. doi:10.1108/JOSM-03-2020-0066'
apa: 'Beverungen, D., Kundisch, D., & Wünderlich, N. (2021). Transforming into
a Platform Provider: Strategic Options for Industrial Smart Service Providers.
Journal of Service Management, 32(4), 507–532. https://doi.org/10.1108/JOSM-03-2020-0066'
bibtex: '@article{Beverungen_Kundisch_Wünderlich_2021, title={Transforming into
a Platform Provider: Strategic Options for Industrial Smart Service Providers},
volume={32}, DOI={10.1108/JOSM-03-2020-0066},
number={4}, journal={Journal of Service Management}, publisher={Emerald Insight},
author={Beverungen, Daniel and Kundisch, Dennis and Wünderlich, Nancy}, year={2021},
pages={507–532} }'
chicago: 'Beverungen, Daniel, Dennis Kundisch, and Nancy Wünderlich. “Transforming
into a Platform Provider: Strategic Options for Industrial Smart Service Providers.”
Journal of Service Management 32, no. 4 (2021): 507–32. https://doi.org/10.1108/JOSM-03-2020-0066.'
ieee: 'D. Beverungen, D. Kundisch, and N. Wünderlich, “Transforming into a Platform
Provider: Strategic Options for Industrial Smart Service Providers,” Journal
of Service Management, vol. 32, no. 4, pp. 507–532, 2021, doi: 10.1108/JOSM-03-2020-0066.'
mla: 'Beverungen, Daniel, et al. “Transforming into a Platform Provider: Strategic
Options for Industrial Smart Service Providers.” Journal of Service Management,
vol. 32, no. 4, Emerald Insight, 2021, pp. 507–32, doi:10.1108/JOSM-03-2020-0066.'
short: D. Beverungen, D. Kundisch, N. Wünderlich, Journal of Service Management
32 (2021) 507–532.
date_created: 2020-08-12T12:12:36Z
date_updated: 2024-04-18T12:46:37Z
ddc:
- '380'
department:
- _id: '276'
- _id: '181'
doi: 10.1108/JOSM-03-2020-0066
intvolume: ' 32'
issue: '4'
keyword:
- Smart service
- Platform
- Interdisciplinary research
- Manufacturing company
- Smart service provider
- Platform economics
- Information systems
- Multi-sided markets
- Business-to-business (B2B) markets
language:
- iso: eng
page: 507-532
project:
- _id: '1'
grant_number: '160364472'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '17'
name: SFB 901 - Subproject C5
publication: Journal of Service Management
publication_identifier:
issn:
- 507-532
publication_status: published
publisher: Emerald Insight
quality_controlled: '1'
status: public
title: 'Transforming into a Platform Provider: Strategic Options for Industrial Smart
Service Providers'
type: journal_article
user_id: '59677'
volume: 32
year: '2021'
...
---
_id: '34822'
abstract:
- lang: eng
text: The role of domain-specific content knowledge is discussed controversially
for the early childhood context. Therefore, this review aims at untangling the
research on domain-specific content knowledge for early childhood educators by
systematically reviewing the conceptual and operational definition of and results
on early childhood educators' content knowledge in different domains. Using the
scientific databases ERIC, PsycInfo and Web of Sciences, we identified 36 studies
on early childhood educators' domain-specific content knowledge. By comparing
these studies, we found that conceptualizations of early childhood educators'
content knowledge move on a continuum between a scientific related perspective
and a practice related perspective. The scientific related perspective defines
content knowledge as the knowledge of key concepts, facts and rules of the domain
integrating knowledge taught in primary, secondary or upper secondary school.
The practice related perspective includes knowledge of key concepts, facts and
rules of the domain limited to the knowledge explicitly relevant for teaching
in early childhood education as well as selected domain-specific knowledge of
children and teaching. Our review shows that the results and implications drawn
by the study authors depend on how these authors conceptualize early childhood
educators' content knowledge on this continuum. Further research, therefore, needs
to consider carefully how early childhood educators' content knowledge is conceptualized.
The paper further discusses gaps in this research field, such as validating methods
for measuring early childhood educators' content knowledge or implementing more
rigorous experimental designs to examine effects of early childhood educators'
content knowledge.
article_type: review
author:
- first_name: Julia
full_name: Bruns, Julia
id: '72183'
last_name: Bruns
orcid: https://orcid.org/0000-0002-6604-5864
- first_name: Hedwig
full_name: Gasteiger, Hedwig
last_name: Gasteiger
- first_name: Carolin
full_name: Strahl, Carolin
last_name: Strahl
citation:
ama: 'Bruns J, Gasteiger H, Strahl C. Conceptualising and measuring domain-specific
content knowledge of early childhood educators: A systematic review. Review
of Education. 2021;9(2):500-538. doi:10.1002/rev3.3255'
apa: 'Bruns, J., Gasteiger, H., & Strahl, C. (2021). Conceptualising and measuring
domain-specific content knowledge of early childhood educators: A systematic review.
Review of Education, 9(2), 500–538. https://doi.org/10.1002/rev3.3255'
bibtex: '@article{Bruns_Gasteiger_Strahl_2021, title={Conceptualising and measuring
domain-specific content knowledge of early childhood educators: A systematic review},
volume={9}, DOI={10.1002/rev3.3255},
number={2}, journal={Review of Education}, publisher={Wiley}, author={Bruns, Julia
and Gasteiger, Hedwig and Strahl, Carolin}, year={2021}, pages={500–538} }'
chicago: 'Bruns, Julia, Hedwig Gasteiger, and Carolin Strahl. “Conceptualising and
Measuring Domain-Specific Content Knowledge of Early Childhood Educators: A Systematic
Review.” Review of Education 9, no. 2 (2021): 500–538. https://doi.org/10.1002/rev3.3255.'
ieee: 'J. Bruns, H. Gasteiger, and C. Strahl, “Conceptualising and measuring domain-specific
content knowledge of early childhood educators: A systematic review,” Review
of Education, vol. 9, no. 2, pp. 500–538, 2021, doi: 10.1002/rev3.3255.'
mla: 'Bruns, Julia, et al. “Conceptualising and Measuring Domain-Specific Content
Knowledge of Early Childhood Educators: A Systematic Review.” Review of Education,
vol. 9, no. 2, Wiley, 2021, pp. 500–38, doi:10.1002/rev3.3255.'
short: J. Bruns, H. Gasteiger, C. Strahl, Review of Education 9 (2021) 500–538.
date_created: 2022-12-22T09:22:46Z
date_updated: 2023-06-20T19:04:34Z
department:
- _id: '611'
- _id: '97'
doi: 10.1002/rev3.3255
external_id:
isi:
- '000614156400001'
intvolume: ' 9'
isi: '1'
issue: '2'
keyword:
- content knowledge
- domain-specific learning
- early childhood education
- teacher knowledge
language:
- iso: eng
page: 500-538
publication: Review of Education
publication_identifier:
issn:
- 2049-6613
publication_status: published
publisher: Wiley
quality_controlled: '1'
status: public
title: 'Conceptualising and measuring domain-specific content knowledge of early childhood
educators: A systematic review'
type: journal_article
user_id: '49063'
volume: 9
year: '2021'
...
---
_id: '22724'
abstract:
- lang: eng
text: "\r\nPredictive Maintenance as a desirable maintenance strategy in industrial
applications relies on suitable condition monitoring solutions to reduce costs
and risks of the monitored technical systems. In general, those solutions utilize
model-based or data-driven methods to diagnose the current state or predict future
states of monitored technical systems. However, both methods have their advantages
and drawbacks. Combining both methods can improve uncertainty consideration and
accuracy. Different combination approaches of those hybrid methods exist to exploit
synergy effects. The choice of an appropriate approach depends on different requirements
and the goal behind the selection of a hybrid approach.\r\n\r\n \r\n\r\nIn this
work, the hybrid approach for estimating remaining useful lifetime takes potential
uncertainties into account. Therefore, a data-driven estimation of new measurements
is integrated within a model-based method. To consider uncertainties within the
system, a differentiation between different system behavior is realized throughout
diverse states of degradation.\r\n\r\nThe developed hybrid prediction approach
bases on a particle filtering method combined with a machine learning method,
to estimate the remaining useful lifetime of technical systems. Particle filtering
as a Monte Carlo simulation technique is suitable to map and propagate uncertainties.
Moreover, it is a state-of-the-art model-based method for predicting remaining
useful lifetime of technical systems. To integrate uncertainties a multi-model
particle filtering approach is employed. In general, resampling as a part of the
particle filtering approach has the potential to lead to an accurate prediction.
However, in the case where no future measurements are available, it may increase
the uncertainty of the prediction. By estimating new measurements, those uncertainties
are reduced within the data-driven part of the approach. Hence, both parts of
the hybrid approach strive to account for and reduce uncertainties.\r\n\r\n \r\n\r\nRubber-metal-elements
are employed as a use-case to evaluate the developed approach. Rubber-metal-elements,
which are used to isolate vibrations in various systems, such as railways, trucks
and wind turbines, show various uncertainties in their behavior and their degradation.
Those uncertainties are caused by diverse inner and outer factors, such as manufacturing
influences and operating conditions. By expert knowledge the influences are described,
analyzed and if possible reduced. However, the remaining uncertainties are considered
within the hybrid prediction method. Relative temperature is the selected measurand
to describe the element’s degradation. In lifetime tests, it is measured as the
difference between the element’s temperature and the ambient temperature. Thereby,
the influence of the ambient temperature on the element’s temperature is taken
into account. Those elements show three typical states of degradation that are
identified within the temperature measurements. Depending on the particular state
of degradation a new measurement is estimated within the hybrid approach to reduce
potential uncertainties.\r\n\r\nFinally, the performance of the developed hybrid
method is compared to a model-based method for estimating the remaining useful
lifetime of the same elements. Suitable performance indices are implemented to
underline the differences between the results."
author:
- first_name: Amelie
full_name: Bender, Amelie
id: '54290'
last_name: Bender
- first_name: Walter
full_name: Sextro, Walter
id: '21220'
last_name: Sextro
citation:
ama: 'Bender A, Sextro W. Hybrid Prediction Method for Remaining Useful Lifetime
Estimation Considering Uncertainties. In: Do P, King S, Fink Olga, eds. Proceedings
of the European Conference of the PHM Society 2021. Vol 6. ; 2021. doi:https://doi.org/10.36001/phme.2021.v6i1.2843
'
apa: Bender, A., & Sextro, W. (2021). Hybrid Prediction Method for Remaining
Useful Lifetime Estimation Considering Uncertainties. In P. Do, S. King, & Olga
Fink (Eds.), Proceedings of the European Conference of the PHM Society 2021
(Vol. 6, Issue 1). https://doi.org/10.36001/phme.2021.v6i1.2843
bibtex: '@inproceedings{Bender_Sextro_2021, title={Hybrid Prediction Method for
Remaining Useful Lifetime Estimation Considering Uncertainties}, volume={6}, DOI={https://doi.org/10.36001/phme.2021.v6i1.2843
}, number={1}, booktitle={Proceedings of the European Conference of the PHM
Society 2021}, author={Bender, Amelie and Sextro, Walter}, editor={Do, Phuc and
King, Steve and Fink, Olga}, year={2021} }'
chicago: Bender, Amelie, and Walter Sextro. “Hybrid Prediction Method for Remaining
Useful Lifetime Estimation Considering Uncertainties.” In Proceedings of the
European Conference of the PHM Society 2021, edited by Phuc Do, Steve King,
and Olga Fink, Vol. 6, 2021. https://doi.org/10.36001/phme.2021.v6i1.2843 .
ieee: 'A. Bender and W. Sextro, “Hybrid Prediction Method for Remaining Useful Lifetime
Estimation Considering Uncertainties,” in Proceedings of the European Conference
of the PHM Society 2021, 2021, vol. 6, no. 1, doi: https://doi.org/10.36001/phme.2021.v6i1.2843 .'
mla: Bender, Amelie, and Walter Sextro. “Hybrid Prediction Method for Remaining
Useful Lifetime Estimation Considering Uncertainties.” Proceedings of the European
Conference of the PHM Society 2021, edited by Phuc Do et al., vol. 6, no.
1, 2021, doi:https://doi.org/10.36001/phme.2021.v6i1.2843
.
short: 'A. Bender, W. Sextro, in: P. Do, S. King, Olga Fink (Eds.), Proceedings
of the European Conference of the PHM Society 2021, 2021.'
conference:
end_date: 2021-07-02
name: 6th European Conference of Prognostics and Health Management
start_date: 2021-06-28
date_created: 2021-07-14T06:29:08Z
date_updated: 2023-09-22T07:19:48Z
department:
- _id: '151'
doi: 'https://doi.org/10.36001/phme.2021.v6i1.2843 '
editor:
- first_name: 'Phuc '
full_name: 'Do, Phuc '
last_name: Do
- first_name: Steve
full_name: King, Steve
last_name: King
- first_name: ' Olga'
full_name: Fink, Olga
last_name: Fink
intvolume: ' 6'
issue: '1'
keyword:
- Hybrid prediction method
- Multi-model particle filtering
- Uncertainty quantification
- RUL estimation
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://papers.phmsociety.org/index.php/phme/article/view/2843
oa: '1'
publication: Proceedings of the European Conference of the PHM Society 2021
publication_identifier:
unknown:
- 978-1-936263-34-9
publication_status: published
quality_controlled: '1'
status: public
title: Hybrid Prediction Method for Remaining Useful Lifetime Estimation Considering
Uncertainties
type: conference
user_id: '54290'
volume: 6
year: '2021'
...
---
_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: '15582'
abstract:
- lang: eng
text: When it comes to increased digitization in the health care domain, privacy
is a relevant topic nowadays. This relates to patient data, electronic health
records or physician reviews published online, for instance. There exist different
approaches to the protection of individuals’ privacy, which focus on the anonymization
and masking of personal information subsequent to their mining. In the medical
domain in particular, measures to protect the privacy of patients are of high
importance due to the amount of sensitive data that is involved (e.g. age, gender,
illnesses, medication). While privacy breaches in structured data can be detected
more easily, disclosure in written texts is more difficult to find automatically
due to the unstructured nature of natural language. Therefore, we take a detailed
look at existing research on areas related to privacy protection. Likewise, we
review approaches to the automatic detection of privacy disclosure in different
types of medical data. We provide a survey of several studies concerned with privacy
breaches in the medical domain with a focus on Physician Review Websites (PRWs).
Finally, we briefly develop implications and directions for further research.
author:
- first_name: Bianca
full_name: Buff, Bianca
last_name: Buff
- first_name: Joschka
full_name: Kersting, Joschka
id: '58701'
last_name: Kersting
- first_name: Michaela
full_name: Geierhos, Michaela
id: '42496'
last_name: Geierhos
orcid: 0000-0002-8180-5606
citation:
ama: 'Buff B, Kersting J, Geierhos M. Detection of Privacy Disclosure in the Medical
Domain: A Survey. In: Proceedings of the 9th International Conference on Pattern
Recognition Applications and Methods (ICPRAM 2020). Setúbal, Portugal: SCITEPRESS;
2020:630--637.'
apa: 'Buff, B., Kersting, J., & Geierhos, M. (2020). Detection of Privacy Disclosure
in the Medical Domain: A Survey. In Proceedings of the 9th International Conference
on Pattern Recognition Applications and Methods (ICPRAM 2020) (pp. 630--637).
Setúbal, Portugal: SCITEPRESS.'
bibtex: '@inproceedings{Buff_Kersting_Geierhos_2020, place={Setúbal, Portugal},
title={Detection of Privacy Disclosure in the Medical Domain: A Survey}, booktitle={Proceedings
of the 9th International Conference on Pattern Recognition Applications and Methods
(ICPRAM 2020)}, publisher={SCITEPRESS}, author={Buff, Bianca and Kersting, Joschka
and Geierhos, Michaela}, year={2020}, pages={630--637} }'
chicago: 'Buff, Bianca, Joschka Kersting, and Michaela Geierhos. “Detection of Privacy
Disclosure in the Medical Domain: A Survey.” In Proceedings of the 9th International
Conference on Pattern Recognition Applications and Methods (ICPRAM 2020),
630--637. Setúbal, Portugal: SCITEPRESS, 2020.'
ieee: 'B. Buff, J. Kersting, and M. Geierhos, “Detection of Privacy Disclosure in
the Medical Domain: A Survey,” in Proceedings of the 9th International Conference
on Pattern Recognition Applications and Methods (ICPRAM 2020), Valetta, Malta,
2020, pp. 630--637.'
mla: 'Buff, Bianca, et al. “Detection of Privacy Disclosure in the Medical Domain:
A Survey.” Proceedings of the 9th International Conference on Pattern Recognition
Applications and Methods (ICPRAM 2020), SCITEPRESS, 2020, pp. 630--637.'
short: 'B. Buff, J. Kersting, M. Geierhos, in: Proceedings of the 9th International
Conference on Pattern Recognition Applications and Methods (ICPRAM 2020), SCITEPRESS,
Setúbal, Portugal, 2020, pp. 630--637.'
conference:
location: Valetta, Malta
name: International Conference on Pattern Recognition Applications and Methods (ICPRAM)
date_created: 2020-01-15T08:49:25Z
date_updated: 2022-01-06T06:52:30Z
ddc:
- '000'
department:
- _id: '579'
file:
- access_level: closed
content_type: application/pdf
creator: jkers
date_created: 2020-09-18T09:25:30Z
date_updated: 2020-09-18T09:25:30Z
file_id: '19574'
file_name: Buff et al. (2020), Buff2020.pdf
file_size: 287956
relation: main_file
success: 1
file_date_updated: 2020-09-18T09:25:30Z
has_accepted_license: '1'
keyword:
- Identity Disclosure
- Privacy Protection
- Physician Review Website
- De-Anonymization
- Medical Domain
language:
- iso: eng
page: 630--637
place: Setúbal, Portugal
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '9'
name: SFB 901 - Subproject B1
publication: Proceedings of the 9th International Conference on Pattern Recognition
Applications and Methods (ICPRAM 2020)
publisher: SCITEPRESS
status: public
title: 'Detection of Privacy Disclosure in the Medical Domain: A Survey'
type: conference
user_id: '58701'
year: '2020'
...
---
_id: '16218'
abstract:
- lang: eng
text: "Despite recent progress in orchestration of Virtual Network Functions (VNFs)
and in multi-technology SDN connectivity, the automated provisioning of end-to-end
network services composed of virtual functions deployed across distributed compute
locations remains an open challenge. This problem is especially relevant to support
the deployment of future 5G networks, comprising virtual access and core network
functions connected through a potentially multi-domain transport network.\r\nIn
this paper, we present and demonstrate the 5GOS, a lightweight end-to-end orchestration
framework that enables the\r\nautomated provisioning of virtual radio access network
services. Using an experimental multi-domain testbed we demonstrate that the 5GOS
can provision multi-domain virtual Wi-Fi and LTE services in less than three minutes."
author:
- first_name: Daniel
full_name: Camps-Mur, Daniel
last_name: Camps-Mur
- first_name: Ferran
full_name: ' Canellas, Ferran'
last_name: ' Canellas'
- first_name: Azahar
full_name: Machwe, Azahar
last_name: Machwe
- first_name: Jorge
full_name: Paracuellos, Jorge
last_name: Paracuellos
- first_name: Kostas
full_name: Choumas, Kostas
last_name: Choumas
- first_name: Dimitris
full_name: Giatsios, Dimitris
last_name: Giatsios
- first_name: Thanasis
full_name: Korakis, Thanasis
last_name: Korakis
- first_name: Hadi
full_name: Razzaghi Kouchaksaraei, Hadi
id: '60845'
last_name: Razzaghi Kouchaksaraei
citation:
ama: 'Camps-Mur D, Canellas F, Machwe A, et al. 5GOS: Demonstrating multi-domain
orchestration of end-to-end virtual RAN services. In: The 6th IEEE International
Conference on Network Softwarization (IEEE NetSoft 2020).'
apa: 'Camps-Mur, D., Canellas, F., Machwe, A., Paracuellos, J., Choumas, K., Giatsios,
D., … Razzaghi Kouchaksaraei, H. (n.d.). 5GOS: Demonstrating multi-domain orchestration
of end-to-end virtual RAN services. In the 6th IEEE International Conference
on Network Softwarization (IEEE NetSoft 2020). Ghent, Belgium.'
bibtex: '@inproceedings{Camps-Mur_ Canellas_Machwe_Paracuellos_Choumas_Giatsios_Korakis_Razzaghi
Kouchaksaraei, title={5GOS: Demonstrating multi-domain orchestration of end-to-end
virtual RAN services}, booktitle={the 6th IEEE International Conference on Network
Softwarization (IEEE NetSoft 2020)}, author={Camps-Mur, Daniel and Canellas,
Ferran and Machwe, Azahar and Paracuellos, Jorge and Choumas, Kostas and Giatsios,
Dimitris and Korakis, Thanasis and Razzaghi Kouchaksaraei, Hadi} }'
chicago: 'Camps-Mur, Daniel, Ferran Canellas, Azahar Machwe, Jorge Paracuellos,
Kostas Choumas, Dimitris Giatsios, Thanasis Korakis, and Hadi Razzaghi Kouchaksaraei.
“5GOS: Demonstrating Multi-Domain Orchestration of End-to-End Virtual RAN Services.”
In The 6th IEEE International Conference on Network Softwarization (IEEE NetSoft
2020), n.d.'
ieee: 'D. Camps-Mur et al., “5GOS: Demonstrating multi-domain orchestration
of end-to-end virtual RAN services,” in the 6th IEEE International Conference
on Network Softwarization (IEEE NetSoft 2020), Ghent, Belgium.'
mla: 'Camps-Mur, Daniel, et al. “5GOS: Demonstrating Multi-Domain Orchestration
of End-to-End Virtual RAN Services.” The 6th IEEE International Conference
on Network Softwarization (IEEE NetSoft 2020).'
short: 'D. Camps-Mur, F. Canellas, A. Machwe, J. Paracuellos, K. Choumas, D. Giatsios,
T. Korakis, H. Razzaghi Kouchaksaraei, in: The 6th IEEE International Conference
on Network Softwarization (IEEE NetSoft 2020), n.d.'
conference:
end_date: 2020-07-3
location: Ghent, Belgium
name: IEEE Conference on Network Softwarization (NetSoft)
start_date: 2020-06-29
date_created: 2020-03-03T11:49:41Z
date_updated: 2022-01-06T06:52:45Z
keyword:
- Orchestration
- multi-domain
- cellular network virtualization
- SDN
- 5G
language:
- iso: eng
project:
- _id: '23'
grant_number: '762057'
name: 5G Programmable Infrastructure Converging disaggregated neTwork and compUte
Resources
publication: the 6th IEEE International Conference on Network Softwarization (IEEE
NetSoft 2020)
publication_status: accepted
status: public
title: '5GOS: Demonstrating multi-domain orchestration of end-to-end virtual RAN services'
type: conference
user_id: '60845'
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: '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: '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
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
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: 2024-06-10T12:00:46Z
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: '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: 2026-02-27T10:41:55Z
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: '53912'
volume: 14
year: '2020'
...
---
_id: '17667'
abstract:
- lang: eng
text: 'Resolving distributed attacks benefits from collaboration between networks.
We present three approaches for the same multi-domain defensive action that can
be applied in such an alliance: 1) Counteract Everywhere, 2) Minimize Countermeasures,
and 3) Minimize Propagation. First, we provide a formula to compute efficiency
of a defense; then we use this formula to compute the efficiency of the approaches
under various circumstances. Finally, we discuss how task execution order and
timing influence defense efficiency. Our results show that the Minimize Propagation
approach is the most efficient method when defending against the chosen attack.'
author:
- first_name: Ralph
full_name: Koning, Ralph
last_name: Koning
- first_name: Gleb
full_name: Polevoy, Gleb
id: '83983'
last_name: Polevoy
- first_name: Lydia
full_name: Meijer, Lydia
last_name: Meijer
- first_name: Cees
full_name: de Laat, Cees
last_name: de Laat
- first_name: Paola
full_name: Grosso, Paola
last_name: Grosso
citation:
ama: 'Koning R, Polevoy G, Meijer L, de Laat C, Grosso P. Approaches for Collaborative
Security Defences in Multi Network Environments. In: 2019 6th IEEE International
Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019 5th IEEE International
Conference on Edge Computing and Scalable Cloud (EdgeCom). 2019 6th IEEE International
Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019 5th IEEE International
Conference on Edge Computing and Scalable Cloud (EdgeCom). ; 2019:113-123. doi:10.1109/CSCloud/EdgeCom.2019.000-9'
apa: Koning, R., Polevoy, G., Meijer, L., de Laat, C., & Grosso, P. (2019).
Approaches for Collaborative Security Defences in Multi Network Environments.
In 2019 6th IEEE International Conference on Cyber Security and Cloud Computing
(CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable
Cloud (EdgeCom) (pp. 113–123). https://doi.org/10.1109/CSCloud/EdgeCom.2019.000-9
bibtex: '@inproceedings{Koning_Polevoy_Meijer_de Laat_Grosso_2019, series={2019
6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/
2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom)},
title={Approaches for Collaborative Security Defences in Multi Network Environments},
DOI={10.1109/CSCloud/EdgeCom.2019.000-9},
booktitle={2019 6th IEEE International Conference on Cyber Security and Cloud
Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge Computing
and Scalable Cloud (EdgeCom)}, author={Koning, Ralph and Polevoy, Gleb and Meijer,
Lydia and de Laat, Cees and Grosso, Paola}, year={2019}, pages={113–123}, collection={2019
6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/
2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom)}
}'
chicago: Koning, Ralph, Gleb Polevoy, Lydia Meijer, Cees de Laat, and Paola Grosso.
“Approaches for Collaborative Security Defences in Multi Network Environments.”
In 2019 6th IEEE International Conference on Cyber Security and Cloud Computing
(CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable
Cloud (EdgeCom), 113–23. 2019 6th IEEE International Conference on Cyber Security
and Cloud Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge
Computing and Scalable Cloud (EdgeCom), 2019. https://doi.org/10.1109/CSCloud/EdgeCom.2019.000-9.
ieee: R. Koning, G. Polevoy, L. Meijer, C. de Laat, and P. Grosso, “Approaches for
Collaborative Security Defences in Multi Network Environments,” in 2019 6th
IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/
2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom),
2019, pp. 113–123.
mla: Koning, Ralph, et al. “Approaches for Collaborative Security Defences in Multi
Network Environments.” 2019 6th IEEE International Conference on Cyber Security
and Cloud Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge
Computing and Scalable Cloud (EdgeCom), 2019, pp. 113–23, doi:10.1109/CSCloud/EdgeCom.2019.000-9.
short: 'R. Koning, G. Polevoy, L. Meijer, C. de Laat, P. Grosso, in: 2019 6th IEEE
International Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019
5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom),
2019, pp. 113–123.'
conference:
name: 2019 6th IEEE International Conference on Cyber Security and Cloud Computing
(CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable
Cloud (EdgeCom)
date_created: 2020-08-06T15:23:23Z
date_updated: 2022-01-06T06:53:16Z
department:
- _id: '63'
- _id: '541'
doi: 10.1109/CSCloud/EdgeCom.2019.000-9
extern: '1'
keyword:
- computer network security
- multinetwork environments
- multidomain defensive action
- task execution order
- timing influence defense efficiency
- distributed attacks
- collaborative security defence approach
- minimize propagation approach
- minimize countermeasure approach
- counteract everywhere approach
- Conferences
- Cloud computing
- Computer crime
- Edge computing
- Security
- Defense Approaches
- Multi-Domain Defense
- Collaborative Defense
- Defense Algorithms
- Computer Networks
language:
- iso: eng
main_file_link:
- url: https://ieeexplore.ieee.org/abstract/document/8854057/authors#authors
page: 113-123
publication: 2019 6th IEEE International Conference on Cyber Security and Cloud Computing
(CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable
Cloud (EdgeCom)
publication_identifier:
issn:
- 'null'
quality_controlled: '1'
series_title: 2019 6th IEEE International Conference on Cyber Security and Cloud Computing
(CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable
Cloud (EdgeCom)
status: public
title: Approaches for Collaborative Security Defences in Multi Network Environments
type: conference
user_id: '83983'
year: '2019'
...
---
_id: '20533'
author:
- first_name: Stefan
full_name: Krüger, Stefan
last_name: Krüger
- first_name: Johannes
full_name: Späth, Johannes
last_name: Späth
- first_name: Karim
full_name: Ali, Karim
last_name: Ali
- first_name: Eric
full_name: Bodden, Eric
id: '59256'
last_name: Bodden
orcid: 0000-0003-3470-3647
- first_name: Mira
full_name: Mezini, Mira
last_name: Mezini
citation:
ama: 'Krüger S, Späth J, Ali K, Bodden E, Mezini M. CrySL: An Extensible Approach
to Validating the Correct Usage of Cryptographic APIs. IEEE Transactions on
Software Engineering. Published online 2019:1-1. doi:10.1109/TSE.2019.2948910'
apa: 'Krüger, S., Späth, J., Ali, K., Bodden, E., & Mezini, M. (2019). CrySL:
An Extensible Approach to Validating the Correct Usage of Cryptographic APIs.
IEEE Transactions on Software Engineering, 1–1. https://doi.org/10.1109/TSE.2019.2948910'
bibtex: '@article{Krüger_Späth_Ali_Bodden_Mezini_2019, title={CrySL: An Extensible
Approach to Validating the Correct Usage of Cryptographic APIs}, DOI={10.1109/TSE.2019.2948910},
journal={IEEE Transactions on Software Engineering}, author={Krüger, Stefan and
Späth, Johannes and Ali, Karim and Bodden, Eric and Mezini, Mira}, year={2019},
pages={1–1} }'
chicago: 'Krüger, Stefan, Johannes Späth, Karim Ali, Eric Bodden, and Mira Mezini.
“CrySL: An Extensible Approach to Validating the Correct Usage of Cryptographic
APIs.” IEEE Transactions on Software Engineering, 2019, 1–1. https://doi.org/10.1109/TSE.2019.2948910.'
ieee: 'S. Krüger, J. Späth, K. Ali, E. Bodden, and M. Mezini, “CrySL: An Extensible
Approach to Validating the Correct Usage of Cryptographic APIs,” IEEE Transactions
on Software Engineering, pp. 1–1, 2019, doi: 10.1109/TSE.2019.2948910.'
mla: 'Krüger, Stefan, et al. “CrySL: An Extensible Approach to Validating the Correct
Usage of Cryptographic APIs.” IEEE Transactions on Software Engineering,
2019, pp. 1–1, doi:10.1109/TSE.2019.2948910.'
short: S. Krüger, J. Späth, K. Ali, E. Bodden, M. Mezini, IEEE Transactions on Software
Engineering (2019) 1–1.
date_created: 2020-11-27T10:48:38Z
date_updated: 2022-01-06T06:54:29Z
department:
- _id: '76'
doi: 10.1109/TSE.2019.2948910
keyword:
- Java
- Encryption
- Static analysis
- Tools
- Ciphers
- Semantics
- cryptography
- domain-specific language
- static analysis
language:
- iso: eng
main_file_link:
- url: http://www.bodden.de/pubs/tse19CrySL.pdf
page: 1-1
publication: IEEE Transactions on Software Engineering
publication_identifier:
issn:
- 2326-3881
status: public
title: 'CrySL: An Extensible Approach to Validating the Correct Usage of Cryptographic
APIs'
type: journal_article
user_id: '5786'
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: '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: '10334'
abstract:
- lang: eng
text: Ultrasonic joining is a common industrial process. In the electronics industry
it is used to form electrical connections, including those of dissimilar materials.
Multiple influencing factors in ultrasonic joining are known and extensively investigated;
process parameters like ultrasonic power, bond force, and bonding frequency of
the ultrasonic vibration are known to have a high impact on a reliable joining
process and need to be adapted for each new application with different geometry
or materials. This contribution is focused on increasing ultrasonic power transmitted
to the interface and keeping mechanical stresses during ultrasonic bonding low
by using a multi-dimensional ultrasonic transducer concept. Bonding results for
a new designed connector pin in IGBT-modules achieved by multi- and one-dimensional
bonding are discussed.
author:
- first_name: Reinhard
full_name: Schemmel, Reinhard
id: '28647'
last_name: Schemmel
- first_name: Tobias
full_name: Hemsel, Tobias
id: '210'
last_name: Hemsel
- first_name: Collin
full_name: Dymel, Collin
id: '66833'
last_name: Dymel
- first_name: Matthias
full_name: Hunstig, Matthias
last_name: Hunstig
- 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: 'Schemmel R, Hemsel T, Dymel C, Hunstig M, Brökelmann M, Sextro W. Using complex
multi-dimensional vibration trajectories in ultrasonic bonding and welding. Sensors
and Actuators A: Physical. 2019;295:653-662. doi:10.1016/j.sna.2019.04.025'
apa: 'Schemmel, R., Hemsel, T., Dymel, C., Hunstig, M., Brökelmann, M., & Sextro,
W. (2019). Using complex multi-dimensional vibration trajectories in ultrasonic
bonding and welding. Sensors and Actuators A: Physical, 295, 653–662.
https://doi.org/10.1016/j.sna.2019.04.025'
bibtex: '@article{Schemmel_Hemsel_Dymel_Hunstig_Brökelmann_Sextro_2019, title={Using
complex multi-dimensional vibration trajectories in ultrasonic bonding and welding},
volume={295}, DOI={10.1016/j.sna.2019.04.025},
journal={Sensors and Actuators A: Physical}, author={Schemmel, Reinhard and Hemsel,
Tobias and Dymel, Collin and Hunstig, Matthias and Brökelmann, Michael and Sextro,
Walter}, year={2019}, pages={653–662} }'
chicago: 'Schemmel, Reinhard, Tobias Hemsel, Collin Dymel, Matthias Hunstig, Michael
Brökelmann, and Walter Sextro. “Using Complex Multi-Dimensional Vibration Trajectories
in Ultrasonic Bonding and Welding.” Sensors and Actuators A: Physical 295
(2019): 653–62. https://doi.org/10.1016/j.sna.2019.04.025.'
ieee: 'R. Schemmel, T. Hemsel, C. Dymel, M. Hunstig, M. Brökelmann, and W. Sextro,
“Using complex multi-dimensional vibration trajectories in ultrasonic bonding
and welding,” Sensors and Actuators A: Physical, vol. 295, pp. 653–662,
2019, doi: 10.1016/j.sna.2019.04.025.'
mla: 'Schemmel, Reinhard, et al. “Using Complex Multi-Dimensional Vibration Trajectories
in Ultrasonic Bonding and Welding.” Sensors and Actuators A: Physical,
vol. 295, 2019, pp. 653–62, doi:10.1016/j.sna.2019.04.025.'
short: 'R. Schemmel, T. Hemsel, C. Dymel, M. Hunstig, M. Brökelmann, W. Sextro,
Sensors and Actuators A: Physical 295 (2019) 653–662.'
date_created: 2019-07-01T07:32:07Z
date_updated: 2023-09-21T14:12:15Z
department:
- _id: '151'
doi: 10.1016/j.sna.2019.04.025
intvolume: ' 295'
keyword:
- Ultrasonic bonding
- Ultrasonic welding
- Multi-dimensional bonding
- Complex vibration
- Multi-frequent
- Two-dimensional friction model
language:
- iso: eng
page: 653 - 662
project:
- _id: '93'
grant_number: MP-1-1-015
name: Hochleistungsbonden in energieeffizienten Leistungshalbleitermodulen
publication: 'Sensors and Actuators A: Physical'
publication_identifier:
issn:
- 0924-4247
quality_controlled: '1'
status: public
title: Using complex multi-dimensional vibration trajectories in ultrasonic bonding
and welding
type: journal_article
user_id: '210'
volume: 295
year: '2019'
...
---
_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'
...