---
_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: '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: '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'
...
---
_id: '4375'
abstract:
- lang: eng
text: "We present a peer-to-peer network that supports the efficient processing
of orthogonal range queries $R=\\bigtimes_{i=1}^{d}[a_i,\\,b_i]$ in a $d$-dimensional
point space.\\\\\r\nThe network is the same for each dimension, namely a distance
halving network like the one introduced by Naor and Wieder (ACM TALG'07).\r\nWe
show how to execute such range queries using $\\mathcal{O}\\left(2^{d'}d\\,\\log
m + d\\,|R|\\right)$ hops (and the same number of messages) in total. Here $[m]^d$
is the ground set, $|R|$ is the size and $d'$ the dimension of the queried range.\r\nFurthermore,
if the peers form a distributed network, the query can be answered in $\\mathcal{O}\\left(d\\,\\log
m + d\\,\\sum_{i=1}^{d}(b_i-a_i+1)\\right)$ communication rounds.\r\nOur algorithms
are based on a mapping of the Hilbert Curve through $[m]^d$ to the peers."
author:
- first_name: Markus
full_name: Benter, Markus
last_name: Benter
- first_name: Till
full_name: Knollmann, Till
id: '39241'
last_name: Knollmann
orcid: 0000-0003-2014-4696
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Alexander
full_name: Setzer, Alexander
id: '11108'
last_name: Setzer
- first_name: Jannik
full_name: Sundermeier, Jannik
id: '38705'
last_name: Sundermeier
citation:
ama: 'Benter M, Knollmann T, Meyer auf der Heide F, Setzer A, Sundermeier J. A Peer-to-Peer
based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension.
In: Proceedings of the 4th International Symposium on Algorithmic Aspects of
Cloud Computing (ALGOCLOUD). ; 2018. doi:10.1007/978-3-030-19759-9_4'
apa: Benter, M., Knollmann, T., Meyer auf der Heide, F., Setzer, A., & Sundermeier,
J. (2018). A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries
of arbitrary Dimension. In Proceedings of the 4th International Symposium on
Algorithmic Aspects of Cloud Computing (ALGOCLOUD). Helsinki. https://doi.org/10.1007/978-3-030-19759-9_4
bibtex: '@inproceedings{Benter_Knollmann_Meyer auf der Heide_Setzer_Sundermeier_2018,
title={A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries
of arbitrary Dimension}, DOI={10.1007/978-3-030-19759-9_4},
booktitle={Proceedings of the 4th International Symposium on Algorithmic Aspects
of Cloud Computing (ALGOCLOUD)}, author={Benter, Markus and Knollmann, Till and
Meyer auf der Heide, Friedhelm and Setzer, Alexander and Sundermeier, Jannik},
year={2018} }'
chicago: Benter, Markus, Till Knollmann, Friedhelm Meyer auf der Heide, Alexander
Setzer, and Jannik Sundermeier. “A Peer-to-Peer Based Cloud Storage Supporting
Orthogonal Range Queries of Arbitrary Dimension.” In Proceedings of the 4th
International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD),
2018. https://doi.org/10.1007/978-3-030-19759-9_4.
ieee: M. Benter, T. Knollmann, F. Meyer auf der Heide, A. Setzer, and J. Sundermeier,
“A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary
Dimension,” in Proceedings of the 4th International Symposium on Algorithmic
Aspects of Cloud Computing (ALGOCLOUD), Helsinki, 2018.
mla: Benter, Markus, et al. “A Peer-to-Peer Based Cloud Storage Supporting Orthogonal
Range Queries of Arbitrary Dimension.” Proceedings of the 4th International
Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD), 2018, doi:10.1007/978-3-030-19759-9_4.
short: 'M. Benter, T. Knollmann, F. Meyer auf der Heide, A. Setzer, J. Sundermeier,
in: Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud
Computing (ALGOCLOUD), 2018.'
conference:
end_date: 2018-08-21
location: Helsinki
name: 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)
start_date: 2018-08-20
date_created: 2018-09-11T05:26:59Z
date_updated: 2022-01-06T07:01:00Z
ddc:
- '000'
department:
- _id: '63'
- _id: '79'
doi: 10.1007/978-3-030-19759-9_4
file:
- access_level: closed
content_type: application/pdf
creator: tillk
date_created: 2018-11-27T10:03:33Z
date_updated: 2018-11-27T10:03:33Z
file_id: '5863'
file_name: A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries
of arbitrary Dimension.pdf
file_size: 1122875
relation: main_file
success: 1
file_date_updated: 2018-11-27T10:03:33Z
has_accepted_license: '1'
keyword:
- Distributed Storage
- Multi-Dimensional Range Queries
- Peer-to-Peer
- Hilbert Curve
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 4th International Symposium on Algorithmic Aspects
of Cloud Computing (ALGOCLOUD)
status: public
title: A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary
Dimension
type: conference
user_id: '14955'
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: '5588'
abstract:
- lang: eng
text: The protection of information technology (IT) has become and is predicted
to remain a key economic challenge for organizations. While research on IT security
investment is fast growing, it lacks a theoretical basis for structuring research,
explaining economic-technological phenomena and guide future research. We address
this shortcoming by suggesting a new theoretical model emerging from a multi-theoretical
perspective adopt-ing the Resource-Based View and the Organizational Learning
Theory. The joint appli-cation of these theories allows to conceptualize in one
theoretical model the organiza-tional learning effects that occur when the protection
of organizational resources through IT security countermeasures develops over
time. We use this model of IT security invest-ments to synthesize findings of
a large body of literature and to derive research gaps. We also discuss managerial
implications of (closing) these gaps by providing practical ex-amples.
author:
- first_name: Eva
full_name: Weishäupl, Eva
last_name: Weishäupl
- first_name: Emrah
full_name: Yasasin, Emrah
last_name: Yasasin
- first_name: Guido
full_name: Schryen, Guido
id: '72850'
last_name: Schryen
citation:
ama: 'Weishäupl E, Yasasin E, Schryen G. A Multi-Theoretical Literature Review on
Information Security Investments using the Resource-Based View and the Organizational
Learning Theory. In: International Conference on Information Systems. ;
2015.'
apa: Weishäupl, E., Yasasin, E., & Schryen, G. (2015). A Multi-Theoretical Literature
Review on Information Security Investments using the Resource-Based View and the
Organizational Learning Theory. In International Conference on Information
Systems.
bibtex: '@inproceedings{Weishäupl_Yasasin_Schryen_2015, title={A Multi-Theoretical
Literature Review on Information Security Investments using the Resource-Based
View and the Organizational Learning Theory}, booktitle={International Conference
on Information Systems}, author={Weishäupl, Eva and Yasasin, Emrah and Schryen,
Guido}, year={2015} }'
chicago: Weishäupl, Eva, Emrah Yasasin, and Guido Schryen. “A Multi-Theoretical
Literature Review on Information Security Investments Using the Resource-Based
View and the Organizational Learning Theory.” In International Conference on
Information Systems, 2015.
ieee: E. Weishäupl, E. Yasasin, and G. Schryen, “A Multi-Theoretical Literature
Review on Information Security Investments using the Resource-Based View and the
Organizational Learning Theory,” in International Conference on Information
Systems, 2015.
mla: Weishäupl, Eva, et al. “A Multi-Theoretical Literature Review on Information
Security Investments Using the Resource-Based View and the Organizational Learning
Theory.” International Conference on Information Systems, 2015.
short: 'E. Weishäupl, E. Yasasin, G. Schryen, in: International Conference on Information
Systems, 2015.'
date_created: 2018-11-14T11:25:38Z
date_updated: 2022-01-06T07:02:03Z
ddc:
- '000'
department:
- _id: '277'
extern: '1'
file:
- access_level: open_access
content_type: application/pdf
creator: hsiemes
date_created: 2018-12-07T11:45:31Z
date_updated: 2018-12-13T15:09:32Z
file_id: '6038'
file_name: ICIS PROCEEDINGS PAPER - Security Investments.pdf
file_size: 958019
relation: main_file
file_date_updated: 2018-12-13T15:09:32Z
has_accepted_license: '1'
keyword:
- Information Security
- Investment
- Literature review
- Resource-based View
- Organi-zational Learning Theory
- Multi-theoretical Perspective
language:
- iso: eng
oa: '1'
publication: International Conference on Information Systems
status: public
title: A Multi-Theoretical Literature Review on Information Security Investments using
the Resource-Based View and the Organizational Learning Theory
type: conference
user_id: '61579'
year: '2015'
...
---
_id: '29973'
abstract:
- lang: eng
text: 'Haushaltsgeräte aus der Klasse der "Weißen Ware" tragen mit etwa einem Drittel
($34,2%$ \citeBDEW2013) zum privaten Energieverbrauch bei. Diese Veröffentlichung
präsentiert eine Struktur und die dafür notwendige optimale Betriebsstrategie
für Weiße Ware in einer Umgebung mit Strompreisen, die wegen der Volatilität der
Regenerativen Energien stark fluktuieren. Das vorgeschlagene Konzept nutzt dafür
ein dezentrales Energiemanagementsystem, das über drei Hierarchieebenen verteilt
ist: die Geräteebene, die Haushaltsebene und die Ortsnetzebene. Auf der Geräteebene
nutzt dieses Konzept zusätzlich Betriebsflexibilitäten der Haushaltsgeräte aus.'
author:
- first_name: Karl Stephan Christian
full_name: Stille, Karl Stephan Christian
id: '30152'
last_name: Stille
orcid: 0000-0002-4212-6555
- first_name: Joachim
full_name: Böcker, Joachim
id: '66'
last_name: Böcker
orcid: 0000-0002-8480-7295
- first_name: Ralf
full_name: Bettentrup, Ralf
last_name: Bettentrup
- first_name: Ingo
full_name: Kaiser, Ingo
last_name: Kaiser
citation:
ama: 'Stille KSC, Böcker J, Bettentrup R, Kaiser I. Hierarchisches Optimierungskonzept
für die Laststeuerung von Haushaltsgeräten. In: ETG-Fachtagung “Von Smart Grids
Zu Smart Markets.” VDE; 2015.'
apa: Stille, K. S. C., Böcker, J., Bettentrup, R., & Kaiser, I. (2015). Hierarchisches
Optimierungskonzept für die Laststeuerung von Haushaltsgeräten. ETG-Fachtagung
“Von Smart Grids Zu Smart Markets.”
bibtex: '@inproceedings{Stille_Böcker_Bettentrup_Kaiser_2015, place={Kassel}, title={Hierarchisches
Optimierungskonzept für die Laststeuerung von Haushaltsgeräten}, booktitle={ETG-Fachtagung
“Von Smart Grids zu Smart Markets”}, publisher={VDE}, author={Stille, Karl Stephan
Christian and Böcker, Joachim and Bettentrup, Ralf and Kaiser, Ingo}, year={2015}
}'
chicago: 'Stille, Karl Stephan Christian, Joachim Böcker, Ralf Bettentrup, and Ingo
Kaiser. “Hierarchisches Optimierungskonzept Für Die Laststeuerung von Haushaltsgeräten.”
In ETG-Fachtagung “Von Smart Grids Zu Smart Markets.” Kassel: VDE, 2015.'
ieee: K. S. C. Stille, J. Böcker, R. Bettentrup, and I. Kaiser, “Hierarchisches
Optimierungskonzept für die Laststeuerung von Haushaltsgeräten,” 2015.
mla: Stille, Karl Stephan Christian, et al. “Hierarchisches Optimierungskonzept
Für Die Laststeuerung von Haushaltsgeräten.” ETG-Fachtagung “Von Smart Grids
Zu Smart Markets,” VDE, 2015.
short: 'K.S.C. Stille, J. Böcker, R. Bettentrup, I. Kaiser, in: ETG-Fachtagung “Von
Smart Grids Zu Smart Markets,” VDE, Kassel, 2015.'
date_created: 2022-02-23T09:24:36Z
date_updated: 2022-02-23T16:10:58Z
department:
- _id: '52'
keyword:
- Energy management
- hybrid energy storage system
- self-optimization
- multi-objective optimization
- adaptive systems
- pareto set
- SFB614-D1
- SFB614-D2
- LEA-Publikation
- Eigene
language:
- iso: eng
main_file_link:
- url: https://www.vde-verlag.de/proceedings-en/453897045.html
place: Kassel
publication: ETG-Fachtagung "Von Smart Grids zu Smart Markets"
publisher: VDE
status: public
title: Hierarchisches Optimierungskonzept für die Laststeuerung von Haushaltsgeräten
type: conference
user_id: '66'
year: '2015'
...
---
_id: '48887'
abstract:
- lang: eng
text: 'We evaluate the performance of a multi-objective evolutionary algorithm on
a class of dynamic routing problems with a single vehicle. In particular we focus
on relating algorithmic performance to the most prominent characteristics of problem
instances. The routing problem considers two types of customers: mandatory customers
must be visited whereas optional customers do not necessarily have to be visited.
Moreover, mandatory customers are known prior to the start of the tour whereas
optional customers request for service at later points in time with the vehicle
already being on its way. The multi-objective optimization problem then results
as maximizing the number of visited customers while simultaneously minimizing
total travel time. As an a-posteriori evaluation tool, the evolutionary algorithm
aims at approximating the related Pareto set for specifically designed benchmarking
instances differing in terms of number of customers, geographical layout, fraction
of mandatory customers, and request times of optional customers. Conceptional
and experimental comparisons to online heuristic procedures are provided.'
author:
- first_name: Stephan
full_name: Meisel, Stephan
last_name: Meisel
- first_name: Christian
full_name: Grimme, Christian
last_name: Grimme
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Martin
full_name: Wölck, Martin
last_name: Wölck
- first_name: Günter
full_name: Rudolph, Günter
last_name: Rudolph
- first_name: Heike
full_name: Trautmann, Heike
last_name: Trautmann
citation:
ama: 'Meisel S, Grimme C, Bossek J, Wölck M, Rudolph G, Trautmann H. Evaluation
of a Multi-Objective EA on Benchmark Instances for Dynamic Routing of a Vehicle.
In: Proceedings of the Genetic and Evolutionary Computation Conference .
GECCO’15. Association for Computing Machinery; 2015:425–432. doi:10.1145/2739480.2754705'
apa: Meisel, S., Grimme, C., Bossek, J., Wölck, M., Rudolph, G., & Trautmann,
H. (2015). Evaluation of a Multi-Objective EA on Benchmark Instances for Dynamic
Routing of a Vehicle. Proceedings of the Genetic and Evolutionary Computation
Conference , 425–432. https://doi.org/10.1145/2739480.2754705
bibtex: '@inproceedings{Meisel_Grimme_Bossek_Wölck_Rudolph_Trautmann_2015, place={New
York, NY, USA}, series={GECCO’15}, title={Evaluation of a Multi-Objective EA on
Benchmark Instances for Dynamic Routing of a Vehicle}, DOI={10.1145/2739480.2754705},
booktitle={Proceedings of the Genetic and Evolutionary Computation Conference
}, publisher={Association for Computing Machinery}, author={Meisel, Stephan and
Grimme, Christian and Bossek, Jakob and Wölck, Martin and Rudolph, Günter and
Trautmann, Heike}, year={2015}, pages={425–432}, collection={GECCO’15} }'
chicago: 'Meisel, Stephan, Christian Grimme, Jakob Bossek, Martin Wölck, Günter
Rudolph, and Heike Trautmann. “Evaluation of a Multi-Objective EA on Benchmark
Instances for Dynamic Routing of a Vehicle.” In Proceedings of the Genetic
and Evolutionary Computation Conference , 425–432. GECCO’15. New York, NY,
USA: Association for Computing Machinery, 2015. https://doi.org/10.1145/2739480.2754705.'
ieee: 'S. Meisel, C. Grimme, J. Bossek, M. Wölck, G. Rudolph, and H. Trautmann,
“Evaluation of a Multi-Objective EA on Benchmark Instances for Dynamic Routing
of a Vehicle,” in Proceedings of the Genetic and Evolutionary Computation Conference
, 2015, pp. 425–432, doi: 10.1145/2739480.2754705.'
mla: Meisel, Stephan, et al. “Evaluation of a Multi-Objective EA on Benchmark Instances
for Dynamic Routing of a Vehicle.” Proceedings of the Genetic and Evolutionary
Computation Conference , Association for Computing Machinery, 2015, pp. 425–432,
doi:10.1145/2739480.2754705.
short: 'S. Meisel, C. Grimme, J. Bossek, M. Wölck, G. Rudolph, H. Trautmann, in:
Proceedings of the Genetic and Evolutionary Computation Conference , Association
for Computing Machinery, New York, NY, USA, 2015, pp. 425–432.'
date_created: 2023-11-14T15:58:59Z
date_updated: 2023-12-13T10:49:06Z
department:
- _id: '819'
doi: 10.1145/2739480.2754705
extern: '1'
keyword:
- combinatorial optimization
- metaheuristics
- multi-objective optimization
- online algorithms
- transportation
language:
- iso: eng
page: 425–432
place: New York, NY, USA
publication: 'Proceedings of the Genetic and Evolutionary Computation Conference '
publication_identifier:
isbn:
- 978-1-4503-3472-3
publisher: Association for Computing Machinery
series_title: GECCO’15
status: public
title: Evaluation of a Multi-Objective EA on Benchmark Instances for Dynamic Routing
of a Vehicle
type: conference
user_id: '102979'
year: '2015'
...
---
_id: '9885'
abstract:
- lang: eng
text: Intelligent mechatronic systems, such as self-optimizing systems, allow an
adaptation of the system behavior at runtime based on the current situation. To
do so, they generally select among several pre-defined working points. A common
method to determine working points for a mechatronic system is to use model-based
multiobjective optimization. It allows finding compromises among conflicting objectives,
called objective functions, by adapting parameters. To evaluate the system behavior
for different parameter sets, a model of the system behavior is included in the
objective functions and is evaluated during each function call. Intelligent mechatronic
systems also have the ability to adapt their behavior based on their current reliability,
thus increasing their availability, or on changed safety requirements; all of
which are summed up by the common term dependability. To allow this adaptation,
dependability can be considered in multiobjective optimization by including dependability-related
objective functions. However, whereas performance-related objective functions
are easily found, formulation of dependability-related objective functions is
highly system-specific and not intuitive, making it complex and error-prone. Since
each mechatronic system is different, individual failure modes have to be taken
into account, which need to be found using common methods such as Failure-Modes
and Effects Analysis or Fault Tree Analysis. Using component degradation models,
which again are specific to the system at hand, the main loading factors can be
determined. By including these in the model of the system behavior, the relation
between working point and dependability can be formulated as an objective function.
In our work, this approach is presented in more detail. It is exemplified using
an actively actuated single plate dry clutch system. Results show that this approach
is suitable for formulating dependability-related objective functions and that
these can be used to extend system lifetime by adapting system behavior.
author:
- first_name: Tobias
full_name: Meyer , Tobias
last_name: 'Meyer '
- first_name: Christoph
full_name: Sondermann-Wölke, Christoph
last_name: Sondermann-Wölke
- first_name: Walter
full_name: Sextro, Walter
id: '21220'
last_name: Sextro
citation:
ama: Meyer T, Sondermann-Wölke C, Sextro W. Method to Identify Dependability Objectives
in Multiobjective Optimization Problem. Conference Proceedings of the 2nd International
Conference on System-Integrated Intelligence. 2014;15:46-53. doi:10.1016/j.protcy.2014.09.033
apa: Meyer , T., Sondermann-Wölke, C., & Sextro, W. (2014). Method to Identify
Dependability Objectives in Multiobjective Optimization Problem. Conference
Proceedings of the 2nd International Conference on System-Integrated Intelligence,
15, 46–53. https://doi.org/10.1016/j.protcy.2014.09.033
bibtex: '@article{Meyer _Sondermann-Wölke_Sextro_2014, title={Method to Identify
Dependability Objectives in Multiobjective Optimization Problem}, volume={15},
DOI={10.1016/j.protcy.2014.09.033},
journal={Conference Proceedings of the 2nd International Conference on System-Integrated
Intelligence}, author={Meyer , Tobias and Sondermann-Wölke, Christoph and Sextro,
Walter}, year={2014}, pages={46–53} }'
chicago: 'Meyer , Tobias, Christoph Sondermann-Wölke, and Walter Sextro. “Method
to Identify Dependability Objectives in Multiobjective Optimization Problem.”
Conference Proceedings of the 2nd International Conference on System-Integrated
Intelligence 15 (2014): 46–53. https://doi.org/10.1016/j.protcy.2014.09.033.'
ieee: T. Meyer , C. Sondermann-Wölke, and W. Sextro, “Method to Identify Dependability
Objectives in Multiobjective Optimization Problem,” Conference Proceedings
of the 2nd International Conference on System-Integrated Intelligence, vol.
15, pp. 46–53, 2014.
mla: Meyer , Tobias, et al. “Method to Identify Dependability Objectives in Multiobjective
Optimization Problem.” Conference Proceedings of the 2nd International Conference
on System-Integrated Intelligence, vol. 15, 2014, pp. 46–53, doi:10.1016/j.protcy.2014.09.033.
short: T. Meyer , C. Sondermann-Wölke, W. Sextro, Conference Proceedings of the
2nd International Conference on System-Integrated Intelligence 15 (2014) 46–53.
date_created: 2019-05-20T13:19:37Z
date_updated: 2019-09-16T10:22:04Z
department:
- _id: '151'
doi: 10.1016/j.protcy.2014.09.033
intvolume: ' 15'
keyword:
- Self-optimization
- multiobjective optimization
- objective function
- dependability
- intelligent system
- behavior adaptation
language:
- iso: eng
page: 46-53
publication: Conference Proceedings of the 2nd International Conference on System-Integrated
Intelligence
quality_controlled: '1'
status: public
title: Method to Identify Dependability Objectives in Multiobjective Optimization
Problem
type: journal_article
user_id: '55222'
volume: 15
year: '2014'
...
---
_id: '13324'
abstract:
- lang: eng
text: 'The new technological enhancements and the accessibility to varieties of
online applications, enable users to collect personal data and perform self-evaluation
through test, comparison and experimentation. The sparked interest in numbers
and numbers as self-representative visualisations is prominent in social networking
sites, which are the empirical setting for the present study. This paper sets
out to establish a multi-theoretical framework which enables the investigation
of emerging phenomena of the role of numbers in social networking sites. The proposed
framework rests on three theoretical pillars: self-determination theory, heuristic
decision making and behavioural economics. A discussion departs from these convictions
to investigate user reactions and behaviour when faced with numerical representations
in the SNS.'
author:
- first_name: Mimmi
full_name: Sjöklint, Mimmi
last_name: Sjöklint
- first_name: Ioanna
full_name: Constantiou, Ioanna
last_name: Constantiou
- first_name: Matthias
full_name: Trier, Matthias
id: '72744'
last_name: Trier
citation:
ama: 'Sjöklint M, Constantiou I, Trier M. Numerical Representations and User Behaviour
in Social Networking Sites: Towards a Multi- Theoretical Research Framework. In:
ECIS 2013 Proceedings. Association for Information Systems. AIS Electronic
Library (AISeL); 2013.'
apa: 'Sjöklint, M., Constantiou, I., & Trier, M. (2013). Numerical Representations
and User Behaviour in Social Networking Sites: Towards a Multi- Theoretical Research
Framework. In ECIS 2013 Proceedings. Association for Information Systems.
AIS Electronic Library (AISeL).'
bibtex: '@inproceedings{Sjöklint_Constantiou_Trier_2013, title={Numerical Representations
and User Behaviour in Social Networking Sites: Towards a Multi- Theoretical Research
Framework}, booktitle={ECIS 2013 Proceedings}, publisher={Association for Information
Systems. AIS Electronic Library (AISeL)}, author={Sjöklint, Mimmi and Constantiou,
Ioanna and Trier, Matthias}, year={2013} }'
chicago: 'Sjöklint, Mimmi, Ioanna Constantiou, and Matthias Trier. “Numerical Representations
and User Behaviour in Social Networking Sites: Towards a Multi- Theoretical Research
Framework.” In ECIS 2013 Proceedings. Association for Information Systems.
AIS Electronic Library (AISeL), 2013.'
ieee: 'M. Sjöklint, I. Constantiou, and M. Trier, “Numerical Representations and
User Behaviour in Social Networking Sites: Towards a Multi- Theoretical Research
Framework,” in ECIS 2013 Proceedings, 2013.'
mla: 'Sjöklint, Mimmi, et al. “Numerical Representations and User Behaviour in Social
Networking Sites: Towards a Multi- Theoretical Research Framework.” ECIS 2013
Proceedings, Association for Information Systems. AIS Electronic Library (AISeL),
2013.'
short: 'M. Sjöklint, I. Constantiou, M. Trier, in: ECIS 2013 Proceedings, Association
for Information Systems. AIS Electronic Library (AISeL), 2013.'
date_created: 2019-09-19T12:14:55Z
date_updated: 2022-01-06T06:51:33Z
department:
- _id: '198'
keyword:
- User Behaviour
- Social Networking Sites
- Numerical Representations
- Multi-Theoretical Framework
- Quantified Self
- Pointification
language:
- iso: eng
publication: ECIS 2013 Proceedings
publication_identifier:
isbn:
- '9783834924421'
publisher: Association for Information Systems. AIS Electronic Library (AISeL)
status: public
title: 'Numerical Representations and User Behaviour in Social Networking Sites: Towards
a Multi- Theoretical Research Framework'
type: conference
user_id: '62809'
year: '2013'
...
---
_id: '36920'
abstract:
- lang: eng
text: 'In the electronic system development, energy consumption is clearly becoming
one of the most important design concerns. From the system level point of view,
Dynamic Power Management (DPM) and Dynamic Voltage and Frequency Scaling (DVFS)
are two mostly applied techniques to adjust the tradeoff between the performance
and power dissipation at runtime. In this paper, we study the problem of combined
application of both techniques with regard to hard real-time systems running on
cluster-based multi-core processors. To optimize the processor energy consumption,
a heuristic based on simulated annealing with efficient termination criterion
is proposed. The experiment results show that the proposed algorithm outperforms
the existing approaches in terms of the energy reduction. '
author:
- first_name: Da
full_name: He, Da
last_name: He
- first_name: Wolfgang
full_name: Müller, Wolfgang
id: '16243'
last_name: Müller
citation:
ama: 'He D, Müller W. An Energy-Efficient Heuristic for Hard Real-Time System on
Multi-Core Processors. In: Weghorn H, ed. Proceedings of the International
Conference on Applied Computing (AC). ; 2013.'
apa: He, D., & Müller, W. (2013). An Energy-Efficient Heuristic for Hard Real-Time
System on Multi-Core Processors. In H. Weghorn (Ed.), Proceedings of the International
Conference on Applied Computing (AC).
bibtex: '@inproceedings{He_Müller_2013, place={Fort Worth, Texas, USA}, title={An
Energy-Efficient Heuristic for Hard Real-Time System on Multi-Core Processors},
booktitle={Proceedings of the International Conference on Applied Computing (AC)},
author={He, Da and Müller, Wolfgang}, editor={Weghorn, Hans}, year={2013} }'
chicago: He, Da, and Wolfgang Müller. “An Energy-Efficient Heuristic for Hard Real-Time
System on Multi-Core Processors.” In Proceedings of the International Conference
on Applied Computing (AC), edited by Hans Weghorn. Fort Worth, Texas, USA,
2013.
ieee: D. He and W. Müller, “An Energy-Efficient Heuristic for Hard Real-Time System
on Multi-Core Processors,” in Proceedings of the International Conference on
Applied Computing (AC), 2013.
mla: He, Da, and Wolfgang Müller. “An Energy-Efficient Heuristic for Hard Real-Time
System on Multi-Core Processors.” Proceedings of the International Conference
on Applied Computing (AC), edited by Hans Weghorn, 2013.
short: 'D. He, W. Müller, in: H. Weghorn (Ed.), Proceedings of the International
Conference on Applied Computing (AC), Fort Worth, Texas, USA, 2013.'
date_created: 2023-01-16T12:12:58Z
date_updated: 2023-01-16T12:15:44Z
department:
- _id: '672'
editor:
- first_name: Hans
full_name: Weghorn, Hans
last_name: Weghorn
keyword:
- Dynamic Power Management
- Dynamic Voltage and Frequency Scaling
- Hard Real-Time
- Multi-core Processor
language:
- iso: eng
place: Fort Worth, Texas, USA
publication: Proceedings of the International Conference on Applied Computing (AC)
publication_identifier:
isbn:
- '978-989-8533-20-3 '
status: public
title: An Energy-Efficient Heuristic for Hard Real-Time System on Multi-Core Processors
type: conference
user_id: '5786'
year: '2013'
...
---
_id: '46411'
abstract:
- lang: eng
text: The paper presents a framework to optimise the design of work roll based on
the cooling performance. The framework develops meta-models from a set of finite
element analyses (FEA) of the roll cooling. A design of experiment technique is
used to identify the FEA runs. The research also identifies sources of uncertainties
in the design process. A robust evolutionary multi-objective evaluation technique
is applied to the design optimisation in constrained problems with real life uncertainty.
The approach handles uncertainties associated both with design variables and fitness
functions. Constraints violation within the neighbourhood of a design is considered
as part of a measurement for degree of feasibility and robustness of a solution.
author:
- first_name: Y.T.
full_name: Azene, Y.T.
last_name: Azene
- first_name: R.
full_name: Roy, R.
last_name: Roy
- first_name: D.
full_name: Farrugia, D.
last_name: Farrugia
- first_name: C.
full_name: Onisa, C.
last_name: Onisa
- first_name: J.
full_name: Mehnen, J.
last_name: Mehnen
- first_name: Heike
full_name: Trautmann, Heike
id: '100740'
last_name: Trautmann
orcid: 0000-0002-9788-8282
citation:
ama: Azene YT, Roy R, Farrugia D, Onisa C, Mehnen J, Trautmann H. Work roll cooling
system design optimisation in presence of uncertainty and constrains. CIRP
Journal of Manufacturing Science and Technology. 2010;2(4):290-298. doi:https://doi.org/10.1016/j.cirpj.2010.06.001
apa: Azene, Y. T., Roy, R., Farrugia, D., Onisa, C., Mehnen, J., & Trautmann,
H. (2010). Work roll cooling system design optimisation in presence of uncertainty
and constrains. CIRP Journal of Manufacturing Science and Technology, 2(4),
290–298. https://doi.org/10.1016/j.cirpj.2010.06.001
bibtex: '@article{Azene_Roy_Farrugia_Onisa_Mehnen_Trautmann_2010, title={Work roll
cooling system design optimisation in presence of uncertainty and constrains},
volume={2}, DOI={https://doi.org/10.1016/j.cirpj.2010.06.001},
number={4}, journal={CIRP Journal of Manufacturing Science and Technology}, author={Azene,
Y.T. and Roy, R. and Farrugia, D. and Onisa, C. and Mehnen, J. and Trautmann,
Heike}, year={2010}, pages={290–298} }'
chicago: 'Azene, Y.T., R. Roy, D. Farrugia, C. Onisa, J. Mehnen, and Heike Trautmann.
“Work Roll Cooling System Design Optimisation in Presence of Uncertainty and Constrains.”
CIRP Journal of Manufacturing Science and Technology 2, no. 4 (2010): 290–98.
https://doi.org/10.1016/j.cirpj.2010.06.001.'
ieee: 'Y. T. Azene, R. Roy, D. Farrugia, C. Onisa, J. Mehnen, and H. Trautmann,
“Work roll cooling system design optimisation in presence of uncertainty and constrains,”
CIRP Journal of Manufacturing Science and Technology, vol. 2, no. 4, pp.
290–298, 2010, doi: https://doi.org/10.1016/j.cirpj.2010.06.001.'
mla: Azene, Y. T., et al. “Work Roll Cooling System Design Optimisation in Presence
of Uncertainty and Constrains.” CIRP Journal of Manufacturing Science and Technology,
vol. 2, no. 4, 2010, pp. 290–98, doi:https://doi.org/10.1016/j.cirpj.2010.06.001.
short: Y.T. Azene, R. Roy, D. Farrugia, C. Onisa, J. Mehnen, H. Trautmann, CIRP
Journal of Manufacturing Science and Technology 2 (2010) 290–298.
date_created: 2023-08-04T16:09:19Z
date_updated: 2023-10-16T13:57:23Z
department:
- _id: '34'
- _id: '819'
doi: https://doi.org/10.1016/j.cirpj.2010.06.001
intvolume: ' 2'
issue: '4'
keyword:
- Roll cooling design
- Uncertainty
- Design optimisation
- Multi-objective optimisation
- Constraint in design
language:
- iso: eng
page: 290-298
publication: CIRP Journal of Manufacturing Science and Technology
publication_identifier:
issn:
- 1755-5817
status: public
title: Work roll cooling system design optimisation in presence of uncertainty and
constrains
type: journal_article
user_id: '15504'
volume: 2
year: '2010'
...