---
_id: '33866'
abstract:
- lang: eng
  text: <jats:p>Helhmoltz–Kirchhoff equations of motions of vortices of an incompressible
    fluid in the plane define a dynamics with singularities and this leads to a Zermelo
    navigation problem describing the ship travel in such a field where the control
    is the heading angle. Considering one vortex, we define a time minimization problem
    which can be analyzed with the technics of geometric optimal control combined
    with numerical simulations, the geometric frame being the extension of Randers
    metrics in the punctured plane, with rotational symmetry. Candidates as minimizers
    are parameterized thanks to the Pontryagin Maximum Principle as extremal solutions
    of a Hamiltonian vector field. We analyze the time minimal solution to transfer
    the ship between two points where during the transfer the ship can be either in
    a strong current region in the vicinity of the vortex or in a weak current region.
    The analysis is based on a micro-local classification of the extremals using mainly
    the integrability properties of the dynamics due to the rotational symmetry. The
    discussion is complex and related to the existence of an isolated extremal (Reeb)
    circle due to the vortex singularity. The explicit computation of cut points where
    the extremal curves cease to be optimal is given and the spheres are described
    in the case where at the initial point the current is weak.</jats:p>
article_number: S10
author:
- first_name: Bernard
  full_name: Bonnard, Bernard
  last_name: Bonnard
- first_name: Olivier
  full_name: Cots, Olivier
  last_name: Cots
- first_name: Boris Edgar
  full_name: Wembe Moafo, Boris Edgar
  id: '95394'
  last_name: Wembe Moafo
citation:
  ama: 'Bonnard B, Cots O, Wembe Moafo BE. A Zermelo navigation problem with a vortex
    singularity. <i>ESAIM: Control, Optimisation and Calculus of Variations</i>. 2020;27.
    doi:<a href="https://doi.org/10.1051/cocv/2020058">10.1051/cocv/2020058</a>'
  apa: 'Bonnard, B., Cots, O., &#38; Wembe Moafo, B. E. (2020). A Zermelo navigation
    problem with a vortex singularity. <i>ESAIM: Control, Optimisation and Calculus
    of Variations</i>, <i>27</i>, Article S10. <a href="https://doi.org/10.1051/cocv/2020058">https://doi.org/10.1051/cocv/2020058</a>'
  bibtex: '@article{Bonnard_Cots_Wembe Moafo_2020, title={A Zermelo navigation problem
    with a vortex singularity}, volume={27}, DOI={<a href="https://doi.org/10.1051/cocv/2020058">10.1051/cocv/2020058</a>},
    number={S10}, journal={ESAIM: Control, Optimisation and Calculus of Variations},
    publisher={EDP Sciences}, author={Bonnard, Bernard and Cots, Olivier and Wembe
    Moafo, Boris Edgar}, year={2020} }'
  chicago: 'Bonnard, Bernard, Olivier Cots, and Boris Edgar Wembe Moafo. “A Zermelo
    Navigation Problem with a Vortex Singularity.” <i>ESAIM: Control, Optimisation
    and Calculus of Variations</i> 27 (2020). <a href="https://doi.org/10.1051/cocv/2020058">https://doi.org/10.1051/cocv/2020058</a>.'
  ieee: 'B. Bonnard, O. Cots, and B. E. Wembe Moafo, “A Zermelo navigation problem
    with a vortex singularity,” <i>ESAIM: Control, Optimisation and Calculus of Variations</i>,
    vol. 27, Art. no. S10, 2020, doi: <a href="https://doi.org/10.1051/cocv/2020058">10.1051/cocv/2020058</a>.'
  mla: 'Bonnard, Bernard, et al. “A Zermelo Navigation Problem with a Vortex Singularity.”
    <i>ESAIM: Control, Optimisation and Calculus of Variations</i>, vol. 27, S10,
    EDP Sciences, 2020, doi:<a href="https://doi.org/10.1051/cocv/2020058">10.1051/cocv/2020058</a>.'
  short: 'B. Bonnard, O. Cots, B.E. Wembe Moafo, ESAIM: Control, Optimisation and
    Calculus of Variations 27 (2020).'
date_created: 2022-10-24T12:51:05Z
date_updated: 2023-01-16T12:09:22Z
doi: 10.1051/cocv/2020058
intvolume: '        27'
keyword:
- Computational Mathematics
- Control and Optimization
- Control and Systems Engineering
language:
- iso: eng
publication: 'ESAIM: Control, Optimisation and Calculus of Variations'
publication_identifier:
  issn:
  - 1292-8119
  - 1262-3377
publication_status: published
publisher: EDP Sciences
status: public
title: A Zermelo navigation problem with a vortex singularity
type: journal_article
user_id: '95394'
volume: 27
year: '2020'
...
---
_id: '19976'
abstract:
- lang: eng
  text: The aim to reduce pollutant emission has led to a trend towards lightweight
    construction in car body development during the last years. As a consequence of
    the resulting need for multi-material design, mechanical joining technologies
    become increasingly important. Mechanical joining allows for the combination of
    dissimilar materials, while thermic joining techniques reach their limits. Self-piercing
    riveting enables the joining of dissimilar materials by using semi-tubular rivets
    as mechanical fasteners. The rivet production, however, is costly and time-consuming,
    as the rivets generally have to be hardened, tempered and coated after forming,
    in order to achieve an adequate strength and corrosion resistance. A promising
    approach to improve the efficiency of the rivet manufacturing is the use of high-strength
    high nitrogen steel as rivet material because these additional process steps would
    not be necessary anymore. As a result of the comparatively high nitrogen content,
    such steels have various beneficial properties like higher strength, good ductility
    and improved corrosion resistance. By cold bulk forming of high nitrogen steels
    high-strength parts can be manufactured due to the strengthening which is caused
    by the high strain hardening. However, high tool loads thereby have to be expected
    and are a major challenge during the production process. Consequently, there is
    a need for appropriate forming strategies. This paper presents key aspects concerning
    the process design for the manufacturing of semi-tubular self-piercing rivets
    made of high-strength steel. The aim is to produce the rivets in several forming
    stages without intermediate heat treatment between the single stages. Due to the
    high strain hardening of the material, a two stage forming concept will be investigated.
    Cup-backward extrusion is chosen as the first process step in order to form the
    rivet shank without forming the rivet foot. Thus, the strain hardening effects
    in the area of the rivet foot are minimized and the tool loads during the following
    process step can be reduced. During the second and final forming stage the detailed
    geometry of the rivet foot and the rivet head is formed. In this context, the
    effect of different variations, for example concerning the final geometry of the
    rivet foot, on the tool load is investigated using multistage numerical analysis.
    Furthermore, the influence of the process temperature on occurring stresses is
    analysed. Based on the results of the investigations, an adequate forming strategy
    and a tool concept for the manufacturing of semi-tubular self-piercing rivets
    made of high-strength steel are presented.
citation:
  ama: Kuball C-M, Uhe B, Meschut G, Merklein M, eds. <i>Process Design for the Forming
    of Semi-Tubular Self-Piercing Rivets Made of High Nitrogen Steel</i>. Vol 50.;
    2020:280-285. doi:<a href="https://doi.org/10.1016/j.promfg.2020.08.052">10.1016/j.promfg.2020.08.052</a>
  apa: Kuball, C.-M., Uhe, B., Meschut, G., &#38; Merklein, M. (Eds.). (2020). <i>Process
    design for the forming of semi-tubular self-piercing rivets made of high nitrogen
    steel</i> (Vol. 50, pp. 280–285). <a href="https://doi.org/10.1016/j.promfg.2020.08.052">https://doi.org/10.1016/j.promfg.2020.08.052</a>
  bibtex: '@book{Kuball_Uhe_Meschut_Merklein_2020, series={Procedia Manufacturing},
    title={Process design for the forming of semi-tubular self-piercing rivets made
    of high nitrogen steel}, volume={50}, DOI={<a href="https://doi.org/10.1016/j.promfg.2020.08.052">10.1016/j.promfg.2020.08.052</a>},
    year={2020}, pages={280–285}, collection={Procedia Manufacturing} }'
  chicago: Kuball, Clara-Maria, Benedikt Uhe, Gerson Meschut, and Marion Merklein,
    eds. <i>Process Design for the Forming of Semi-Tubular Self-Piercing Rivets Made
    of High Nitrogen Steel</i>. Vol. 50. Procedia Manufacturing, 2020. <a href="https://doi.org/10.1016/j.promfg.2020.08.052">https://doi.org/10.1016/j.promfg.2020.08.052</a>.
  ieee: C.-M. Kuball, B. Uhe, G. Meschut, and M. Merklein, Eds., <i>Process design
    for the forming of semi-tubular self-piercing rivets made of high nitrogen steel</i>,
    vol. 50. 2020, pp. 280–285.
  mla: Kuball, Clara-Maria, et al., editors. <i>Process Design for the Forming of
    Semi-Tubular Self-Piercing Rivets Made of High Nitrogen Steel</i>. 2020, pp. 280–85,
    doi:<a href="https://doi.org/10.1016/j.promfg.2020.08.052">10.1016/j.promfg.2020.08.052</a>.
  short: C.-M. Kuball, B. Uhe, G. Meschut, M. Merklein, eds., Process Design for the
    Forming of Semi-Tubular Self-Piercing Rivets Made of High Nitrogen Steel, 2020.
date_created: 2020-10-12T08:30:08Z
date_updated: 2026-02-27T10:43:48Z
department:
- _id: '157'
doi: 10.1016/j.promfg.2020.08.052
editor:
- first_name: Clara-Maria
  full_name: Kuball, Clara-Maria
  last_name: Kuball
- first_name: Benedikt
  full_name: Uhe, Benedikt
  id: '38131'
  last_name: Uhe
- first_name: Gerson
  full_name: Meschut, Gerson
  id: '32056'
  last_name: Meschut
  orcid: 0000-0002-2763-1246
- first_name: Marion
  full_name: Merklein, Marion
  last_name: Merklein
intvolume: '        50'
keyword:
- high nitrogen steel
- self-piercing riveting
- joining by forming
- bulk forming
- tool design
language:
- iso: eng
page: 280-285
publication_status: published
quality_controlled: '1'
series_title: Procedia Manufacturing
status: public
title: Process design for the forming of semi-tubular self-piercing rivets made of
  high nitrogen steel
type: conference_editor
user_id: '53912'
volume: 50
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. <i>Production
    Engineering</i>. 2020;14:417-423. doi:<a href="https://doi.org/10.1007/s11740-020-00973-w">10.1007/s11740-020-00973-w</a>
  apa: Uhe, B., Kuball, C.-M., Merklein, M., &#38; Meschut, G. (2020). Improvement
    of a rivet geometry for the self-piercing riveting of high-strength steel and
    multi-material joints. <i>Production Engineering</i>, <i>14</i>, 417–423. <a href="https://doi.org/10.1007/s11740-020-00973-w">https://doi.org/10.1007/s11740-020-00973-w</a>
  bibtex: '@article{Uhe_Kuball_Merklein_Meschut_2020, title={Improvement of a rivet
    geometry for the self-piercing riveting of high-strength steel and multi-material
    joints}, volume={14}, DOI={<a href="https://doi.org/10.1007/s11740-020-00973-w">10.1007/s11740-020-00973-w</a>},
    journal={Production Engineering}, author={Uhe, Benedikt and Kuball, Clara-Maria
    and Merklein, Marion and Meschut, Gerson}, year={2020}, pages={417–423} }'
  chicago: 'Uhe, Benedikt, Clara-Maria Kuball, Marion Merklein, and Gerson Meschut.
    “Improvement of a Rivet Geometry for the Self-Piercing Riveting of High-Strength
    Steel and Multi-Material Joints.” <i>Production Engineering</i> 14 (2020): 417–23.
    <a href="https://doi.org/10.1007/s11740-020-00973-w">https://doi.org/10.1007/s11740-020-00973-w</a>.'
  ieee: 'B. Uhe, C.-M. Kuball, M. Merklein, and G. Meschut, “Improvement of a rivet
    geometry for the self-piercing riveting of high-strength steel and multi-material
    joints,” <i>Production Engineering</i>, vol. 14, pp. 417–423, 2020, doi: <a href="https://doi.org/10.1007/s11740-020-00973-w">10.1007/s11740-020-00973-w</a>.'
  mla: Uhe, Benedikt, et al. “Improvement of a Rivet Geometry for the Self-Piercing
    Riveting of High-Strength Steel and Multi-Material Joints.” <i>Production Engineering</i>,
    vol. 14, 2020, pp. 417–23, doi:<a href="https://doi.org/10.1007/s11740-020-00973-w">10.1007/s11740-020-00973-w</a>.
  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: '19974'
abstract:
- lang: eng
  text: Due to the trend towards lightweight design in car body development mechanical
    joining technologies become increasingly important. These techniques allow for
    the joining of dissimilar materials and thus enable multi-material design, while
    thermic joining methods reach their limits. Semi-tubular self-piercing riveting
    is an important mechanical joining technology. The rivet production, however,
    is costly and time-consuming, as the process consists of several process steps
    including the heat treatment and coating of the rivets in order to achieve an
    adequate strength and corrosion resistance. The use of high nitrogen steel as
    rivet material leads to the possibility of reducing process steps and hence increasing
    the efficiency of the process. However, the high tool loads being expected due
    to the high strain hardening of the material are a major challenge during the
    rivet production. Thus, there is a need for appropriate forming strategies, such
    as the manufacturing of the rivets at elevated temperatures. Prior investigations
    led to the conclusion that forming already at 200 °C results in a distinct reduction
    of the yield strength. To create a deeper understanding of the forming behaviour
    of high nitrogen steel at elevated temperatures, compression tests were conducted
    in a temperature range between room temperature and 200 °C. The determined true
    stress – true strain curves are the basis for the further process and tool design
    of the rivet production. Another key factor for the rivet manufacturing at elevated
    temperatures is the influence of the process temperature on the tribological conditions.
    For this reason, ring compression tests at room temperature and 200 °C are carried
    out. The friction factors are determined on the basis of calibration curves resulting
    from the numerical analysis of the ring compression process. The investigations
    indicate that the friction factor at 200 °C is significantly higher compared to
    room temperature. This essential fact has to be taken into account for the process
    and tool design for the rivet production using high nitrogen steel.
article_number: '100023'
citation:
  ama: Kuball C-M, Jung R, Uhe B, Meschut G, Merklein M, eds. <i>Influence of the
    Process Temperature on the Forming Behaviour and the Friction during Bulk Forming
    of High Nitrogen Steel</i>. Vol 1.; 2020. doi:<a href="https://doi.org/10.1016/j.jajp.2020.100023">10.1016/j.jajp.2020.100023</a>
  apa: Kuball, C.-M., Jung, R., Uhe, B., Meschut, G., &#38; Merklein, M. (Eds.). (2020).
    <i>Influence of the process temperature on the forming behaviour and the friction
    during bulk forming of high nitrogen steel</i> (No. 100023; Vol. 1). <a href="https://doi.org/10.1016/j.jajp.2020.100023">https://doi.org/10.1016/j.jajp.2020.100023</a>
  bibtex: '@book{Kuball_Jung_Uhe_Meschut_Merklein_2020, series={Journal of Advanced
    Joining Processes}, title={Influence of the process temperature on the forming
    behaviour and the friction during bulk forming of high nitrogen steel}, volume={1},
    DOI={<a href="https://doi.org/10.1016/j.jajp.2020.100023">10.1016/j.jajp.2020.100023</a>},
    number={100023}, year={2020}, collection={Journal of Advanced Joining Processes}
    }'
  chicago: Kuball, Clara-Maria, R Jung, Benedikt Uhe, Gerson Meschut, and Marion Merklein,
    eds. <i>Influence of the Process Temperature on the Forming Behaviour and the
    Friction during Bulk Forming of High Nitrogen Steel</i>. Vol. 1. Journal of Advanced
    Joining Processes, 2020. <a href="https://doi.org/10.1016/j.jajp.2020.100023">https://doi.org/10.1016/j.jajp.2020.100023</a>.
  ieee: C.-M. Kuball, R. Jung, B. Uhe, G. Meschut, and M. Merklein, Eds., <i>Influence
    of the process temperature on the forming behaviour and the friction during bulk
    forming of high nitrogen steel</i>, vol. 1. 2020.
  mla: Kuball, Clara-Maria, et al., editors. <i>Influence of the Process Temperature
    on the Forming Behaviour and the Friction during Bulk Forming of High Nitrogen
    Steel</i>. 100023, 2020, doi:<a href="https://doi.org/10.1016/j.jajp.2020.100023">10.1016/j.jajp.2020.100023</a>.
  short: C.-M. Kuball, R. Jung, B. Uhe, G. Meschut, M. Merklein, eds., Influence of
    the Process Temperature on the Forming Behaviour and the Friction during Bulk
    Forming of High Nitrogen Steel, 2020.
date_created: 2020-10-12T08:23:27Z
date_updated: 2026-02-27T10:45:08Z
department:
- _id: '157'
doi: 10.1016/j.jajp.2020.100023
editor:
- first_name: Clara-Maria
  full_name: Kuball, Clara-Maria
  last_name: Kuball
- first_name: R
  full_name: Jung, R
  last_name: Jung
- first_name: Benedikt
  full_name: Uhe, Benedikt
  id: '38131'
  last_name: Uhe
- first_name: Gerson
  full_name: Meschut, Gerson
  id: '32056'
  last_name: Meschut
  orcid: 0000-0002-2763-1246
- first_name: Marion
  full_name: Merklein, Marion
  last_name: Merklein
intvolume: '         1'
keyword:
- High nitrogen steel
- Self-piercing riveting
- Joining by forming
- Bulk forming
- Strain hardening
language:
- iso: eng
publication_status: published
quality_controlled: '1'
series_title: Journal of Advanced Joining Processes
status: public
title: Influence of the process temperature on the forming behaviour and the friction
  during bulk forming of high nitrogen steel
type: conference_editor
user_id: '53912'
volume: 1
year: '2020'
...
---
_id: '4562'
abstract:
- lang: eng
  text: Employing main and sector-specific investment-grade CDS indices from the North
    American and European CDS market and performing mean-variance out-of-sample analyses
    for conservative and aggressive investors over the period from 2006 to 2014, this
    paper analyzes portfolio benefits of adding corporate CDS indices to a traditional
    financial portfolio consisting of stock and sovereign bond indices. As a baseline
    result, we initially find an increase in portfolio (downside) risk-diversification
    when adding CDS indices, which is observed irrespective of both CDS markets, investor-types
    and different sub-periods, including the global financial crisis and European
    sovereign debt crisis. In addition, the analysis reveals higher portfolio excess
    returns and performance in CDS index portfolios, however, these effects clearly
    differ between markets, investor-types and sub-periods. Overall, portfolio benefits
    of adding CDS indices mainly result from the fact that institutional investors
    replace sovereign bond indices rather than stock indices by CDS indices due to
    better risk-return characteristics. Our baseline findings remain robust under
    a variety of robustness checks. Results from sensitivity analyses provide further
    important implications for institutional investors with a strategic focus on a
    long-term conservative portfolio management.
article_type: original
author:
- first_name: Benjamin
  full_name: Hippert, Benjamin
  id: '48476'
  last_name: Hippert
- first_name: André
  full_name: Uhde, André
  id: '36049'
  last_name: Uhde
  orcid: https://orcid.org/0000-0002-8058-8857
- first_name: Sascha Tobias
  full_name: Wengerek, Sascha Tobias
  id: '48837'
  last_name: Wengerek
  orcid: 0000-0002-7820-3903
citation:
  ama: 'Hippert B, Uhde A, Wengerek ST. Portfolio Benefits of Adding Corporate Credit
    Default Swap Indices: Evidence from North America and Europe. <i>Review of Derivatives
    Research </i>. 2019;22(2):203-259. doi:<a href="https://doi.org/10.1007/s11147-018-9148-8">https://doi.org/10.1007/s11147-018-9148-8</a>'
  apa: 'Hippert, B., Uhde, A., &#38; Wengerek, S. T. (2019). Portfolio Benefits of
    Adding Corporate Credit Default Swap Indices: Evidence from North America and
    Europe. <i>Review of Derivatives Research </i>, <i>22</i>(2), 203–259. <a href="https://doi.org/10.1007/s11147-018-9148-8">https://doi.org/10.1007/s11147-018-9148-8</a>'
  bibtex: '@article{Hippert_Uhde_Wengerek_2019, title={Portfolio Benefits of Adding
    Corporate Credit Default Swap Indices: Evidence from North America and Europe},
    volume={22}, DOI={<a href="https://doi.org/10.1007/s11147-018-9148-8">https://doi.org/10.1007/s11147-018-9148-8</a>},
    number={2}, journal={Review of Derivatives Research }, author={Hippert, Benjamin
    and Uhde, André and Wengerek, Sascha Tobias}, year={2019}, pages={203–259} }'
  chicago: 'Hippert, Benjamin, André Uhde, and Sascha Tobias Wengerek. “Portfolio
    Benefits of Adding Corporate Credit Default Swap Indices: Evidence from North
    America and Europe.” <i>Review of Derivatives Research </i> 22, no. 2 (2019):
    203–59. <a href="https://doi.org/10.1007/s11147-018-9148-8">https://doi.org/10.1007/s11147-018-9148-8</a>.'
  ieee: 'B. Hippert, A. Uhde, and S. T. Wengerek, “Portfolio Benefits of Adding Corporate
    Credit Default Swap Indices: Evidence from North America and Europe,” <i>Review
    of Derivatives Research </i>, vol. 22, no. 2, pp. 203–259, 2019, doi: <a href="https://doi.org/10.1007/s11147-018-9148-8">https://doi.org/10.1007/s11147-018-9148-8</a>.'
  mla: 'Hippert, Benjamin, et al. “Portfolio Benefits of Adding Corporate Credit Default
    Swap Indices: Evidence from North America and Europe.” <i>Review of Derivatives
    Research </i>, vol. 22, no. 2, 2019, pp. 203–59, doi:<a href="https://doi.org/10.1007/s11147-018-9148-8">https://doi.org/10.1007/s11147-018-9148-8</a>.'
  short: B. Hippert, A. Uhde, S.T. Wengerek, Review of Derivatives Research  22 (2019)
    203–259.
date_created: 2018-10-01T12:17:35Z
date_updated: 2022-05-04T06:15:02Z
department:
- _id: '188'
- _id: '186'
doi: https://doi.org/10.1007/s11147-018-9148-8
intvolume: '        22'
issue: '2'
jel:
- C61
- G01
- G11
- G15
- G23
keyword:
- Corporate credit default swap indices
- Mean-variance asset allocation
- Out-of-sample portfolio optimization
- Portfolio risk-diversification
- Portfolio performance evaluation
language:
- iso: eng
page: 203-259
publication: 'Review of Derivatives Research '
publication_status: published
status: public
title: 'Portfolio Benefits of Adding Corporate Credit Default Swap Indices: Evidence
  from North America and Europe'
type: journal_article
user_id: '36049'
volume: 22
year: '2019'
...
---
_id: '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. <i>Evolutionary Multi-Criterion Optimization (EMO)</i>.
    Lecture Notes in Computer Science. Springer International Publishing; 2019:516–528.
    doi:<a href="https://doi.org/10.1007/978-3-030-12598-1_41">10.1007/978-3-030-12598-1_41</a>'
  apa: 'Bossek, J., Grimme, C., Meisel, S., Rudolph, G., &#38; Trautmann, H. (2019).
    Bi-Objective Orienteering: Towards a Dynamic Multi-objective Evolutionary Algorithm.
    In K. Deb, E. Goodman, C. A. Coello Coello, K. Klamroth, K. Miettinen, S. Mostaghim,
    &#38; P. Reed (Eds.), <i>Evolutionary Multi-Criterion Optimization (EMO)</i> (pp.
    516–528). Springer International Publishing. <a href="https://doi.org/10.1007/978-3-030-12598-1_41">https://doi.org/10.1007/978-3-030-12598-1_41</a>'
  bibtex: '@inproceedings{Bossek_Grimme_Meisel_Rudolph_Trautmann_2019, place={Cham},
    series={Lecture Notes in Computer Science}, title={Bi-Objective Orienteering:
    Towards a Dynamic Multi-objective Evolutionary Algorithm}, DOI={<a href="https://doi.org/10.1007/978-3-030-12598-1_41">10.1007/978-3-030-12598-1_41</a>},
    booktitle={Evolutionary Multi-Criterion Optimization (EMO)}, publisher={Springer
    International Publishing}, author={Bossek, Jakob and Grimme, Christian and Meisel,
    Stephan and Rudolph, Günter and Trautmann, Heike}, editor={Deb, Kalyanmoy and
    Goodman, Erik and Coello Coello, Carlos A. and Klamroth, Kathrin and Miettinen,
    Kaisa and Mostaghim, Sanaz and Reed, Patrick}, year={2019}, pages={516–528}, collection={Lecture
    Notes in Computer Science} }'
  chicago: 'Bossek, Jakob, Christian Grimme, Stephan Meisel, Günter Rudolph, and Heike
    Trautmann. “Bi-Objective Orienteering: Towards a Dynamic Multi-Objective Evolutionary
    Algorithm.” In <i>Evolutionary Multi-Criterion Optimization (EMO)</i>, edited
    by Kalyanmoy Deb, Erik Goodman, Carlos A. Coello Coello, Kathrin Klamroth, Kaisa
    Miettinen, Sanaz Mostaghim, and Patrick Reed, 516–528. Lecture Notes in Computer
    Science. Cham: Springer International Publishing, 2019. <a href="https://doi.org/10.1007/978-3-030-12598-1_41">https://doi.org/10.1007/978-3-030-12598-1_41</a>.'
  ieee: 'J. Bossek, C. Grimme, S. Meisel, G. Rudolph, and H. Trautmann, “Bi-Objective
    Orienteering: Towards a Dynamic Multi-objective Evolutionary Algorithm,” in <i>Evolutionary
    Multi-Criterion Optimization (EMO)</i>, 2019, pp. 516–528, doi: <a href="https://doi.org/10.1007/978-3-030-12598-1_41">10.1007/978-3-030-12598-1_41</a>.'
  mla: 'Bossek, Jakob, et al. “Bi-Objective Orienteering: Towards a Dynamic Multi-Objective
    Evolutionary Algorithm.” <i>Evolutionary Multi-Criterion Optimization (EMO)</i>,
    edited by Kalyanmoy Deb et al., Springer International Publishing, 2019, pp. 516–528,
    doi:<a href="https://doi.org/10.1007/978-3-030-12598-1_41">10.1007/978-3-030-12598-1_41</a>.'
  short: 'J. Bossek, C. Grimme, S. Meisel, G. Rudolph, H. Trautmann, in: K. Deb, E.
    Goodman, C.A. Coello Coello, K. Klamroth, K. Miettinen, S. Mostaghim, P. Reed
    (Eds.), Evolutionary Multi-Criterion Optimization (EMO), Springer International
    Publishing, Cham, 2019, pp. 516–528.'
date_created: 2023-11-14T15:58:52Z
date_updated: 2023-12-13T10:43:07Z
department:
- _id: '819'
doi: 10.1007/978-3-030-12598-1_41
editor:
- first_name: Kalyanmoy
  full_name: Deb, Kalyanmoy
  last_name: Deb
- first_name: Erik
  full_name: Goodman, Erik
  last_name: Goodman
- first_name: Carlos A.
  full_name: Coello Coello, Carlos A.
  last_name: Coello Coello
- first_name: Kathrin
  full_name: Klamroth, Kathrin
  last_name: Klamroth
- first_name: Kaisa
  full_name: Miettinen, Kaisa
  last_name: Miettinen
- first_name: Sanaz
  full_name: Mostaghim, Sanaz
  last_name: Mostaghim
- first_name: Patrick
  full_name: Reed, Patrick
  last_name: Reed
extern: '1'
keyword:
- Combinatorial optimization
- Dynamic optimization
- Metaheuristics
- Multi-objective optimization
- Vehicle routing
language:
- iso: eng
page: 516–528
place: Cham
publication: Evolutionary Multi-Criterion Optimization (EMO)
publication_identifier:
  isbn:
  - 978-3-030-12598-1
publication_status: published
publisher: Springer International Publishing
series_title: Lecture Notes in Computer Science
status: public
title: 'Bi-Objective Orienteering: Towards a Dynamic Multi-objective Evolutionary
  Algorithm'
type: conference
user_id: '102979'
year: '2019'
...
---
_id: '48842'
abstract:
- lang: eng
  text: 'Evolutionary algorithms have successfully been applied to evolve problem
    instances that exhibit a significant difference in performance for a given algorithm
    or a pair of algorithms inter alia for the Traveling Salesperson Problem (TSP).
    Creating a large variety of instances is crucial for successful applications in
    the blooming field of algorithm selection. In this paper, we introduce new and
    creative mutation operators for evolving instances of the TSP. We show that adopting
    those operators in an evolutionary algorithm allows for the generation of benchmark
    sets with highly desirable properties: (1) novelty by clear visual distinction
    to established benchmark sets in the field, (2) visual and quantitative diversity
    in the space of TSP problem characteristics, and (3) significant performance differences
    with respect to the restart versions of heuristic state-of-the-art TSP solvers
    EAX and LKH. The important aspect of diversity is addressed and achieved solely
    by the proposed mutation operators and not enforced by explicit diversity preservation.'
author:
- first_name: Jakob
  full_name: Bossek, Jakob
  id: '102979'
  last_name: Bossek
  orcid: 0000-0002-4121-4668
- first_name: Pascal
  full_name: Kerschke, Pascal
  last_name: Kerschke
- first_name: Aneta
  full_name: Neumann, Aneta
  last_name: Neumann
- first_name: Markus
  full_name: Wagner, Markus
  last_name: Wagner
- first_name: Frank
  full_name: Neumann, Frank
  last_name: Neumann
- first_name: Heike
  full_name: Trautmann, Heike
  last_name: Trautmann
citation:
  ama: 'Bossek J, Kerschke P, Neumann A, Wagner M, Neumann F, Trautmann H. Evolving
    Diverse TSP Instances by Means of Novel and Creative Mutation Operators. In: <i>Proceedings
    of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms</i>. FOGA
    ’19. Association for Computing Machinery; 2019:58–71. doi:<a href="https://doi.org/10.1145/3299904.3340307">10.1145/3299904.3340307</a>'
  apa: Bossek, J., Kerschke, P., Neumann, A., Wagner, M., Neumann, F., &#38; Trautmann,
    H. (2019). Evolving Diverse TSP Instances by Means of Novel and Creative Mutation
    Operators. <i>Proceedings of the 15th ACM/SIGEVO Conference on Foundations of
    Genetic Algorithms</i>, 58–71. <a href="https://doi.org/10.1145/3299904.3340307">https://doi.org/10.1145/3299904.3340307</a>
  bibtex: '@inproceedings{Bossek_Kerschke_Neumann_Wagner_Neumann_Trautmann_2019, place={New
    York, NY, USA}, series={FOGA ’19}, title={Evolving Diverse TSP Instances by Means
    of Novel and Creative Mutation Operators}, DOI={<a href="https://doi.org/10.1145/3299904.3340307">10.1145/3299904.3340307</a>},
    booktitle={Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic
    Algorithms}, publisher={Association for Computing Machinery}, author={Bossek,
    Jakob and Kerschke, Pascal and Neumann, Aneta and Wagner, Markus and Neumann,
    Frank and Trautmann, Heike}, year={2019}, pages={58–71}, collection={FOGA ’19}
    }'
  chicago: 'Bossek, Jakob, Pascal Kerschke, Aneta Neumann, Markus Wagner, Frank Neumann,
    and Heike Trautmann. “Evolving Diverse TSP Instances by Means of Novel and Creative
    Mutation Operators.” In <i>Proceedings of the 15th ACM/SIGEVO Conference on Foundations
    of Genetic Algorithms</i>, 58–71. FOGA ’19. New York, NY, USA: Association for
    Computing Machinery, 2019. <a href="https://doi.org/10.1145/3299904.3340307">https://doi.org/10.1145/3299904.3340307</a>.'
  ieee: 'J. Bossek, P. Kerschke, A. Neumann, M. Wagner, F. Neumann, and H. Trautmann,
    “Evolving Diverse TSP Instances by Means of Novel and Creative Mutation Operators,”
    in <i>Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic
    Algorithms</i>, 2019, pp. 58–71, doi: <a href="https://doi.org/10.1145/3299904.3340307">10.1145/3299904.3340307</a>.'
  mla: Bossek, Jakob, et al. “Evolving Diverse TSP Instances by Means of Novel and
    Creative Mutation Operators.” <i>Proceedings of the 15th ACM/SIGEVO Conference
    on Foundations of Genetic Algorithms</i>, Association for Computing Machinery,
    2019, pp. 58–71, doi:<a href="https://doi.org/10.1145/3299904.3340307">10.1145/3299904.3340307</a>.
  short: 'J. Bossek, P. Kerschke, A. Neumann, M. Wagner, F. Neumann, H. Trautmann,
    in: Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms,
    Association for Computing Machinery, New York, NY, USA, 2019, pp. 58–71.'
date_created: 2023-11-14T15:58:52Z
date_updated: 2023-12-13T10:42:57Z
department:
- _id: '819'
doi: 10.1145/3299904.3340307
extern: '1'
keyword:
- benchmarking
- instance features
- optimization
- problem generation
- traveling salesperson problem
language:
- iso: eng
page: 58–71
place: New York, NY, USA
publication: Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic
  Algorithms
publication_identifier:
  isbn:
  - 978-1-4503-6254-2
publication_status: published
publisher: Association for Computing Machinery
series_title: FOGA ’19
status: public
title: Evolving Diverse TSP Instances by Means of Novel and Creative Mutation Operators
type: conference
user_id: '102979'
year: '2019'
...
---
_id: '48843'
abstract:
- lang: eng
  text: We contribute to the theoretical understanding of randomized search heuristics
    for dynamic problems. We consider the classical graph coloring problem and investigate
    the dynamic setting where edges are added to the current graph. We then analyze
    the expected time for randomized search heuristics to recompute high quality solutions.
    This includes the (1+1) EA and RLS in a setting where the number of colors is
    bounded and we are minimizing the number of conflicts as well as iterated local
    search algorithms that use an unbounded color palette and aim to use the smallest
    colors and - as a consequence - the smallest number of colors. We identify classes
    of bipartite graphs where reoptimization is as hard as or even harder than optimization
    from scratch, i. e. starting with a random initialization. Even adding a single
    edge can lead to hard symmetry problems. However, graph classes that are hard
    for one algorithm turn out to be easy for others. In most cases our bounds show
    that reoptimization is faster than optimizing from scratch. Furthermore, we show
    how to speed up computations by using problem specific operators concentrating
    on parts of the graph where changes have occurred.
author:
- first_name: Jakob
  full_name: Bossek, Jakob
  id: '102979'
  last_name: Bossek
  orcid: 0000-0002-4121-4668
- first_name: Frank
  full_name: Neumann, Frank
  last_name: Neumann
- first_name: Pan
  full_name: Peng, Pan
  last_name: Peng
- first_name: Dirk
  full_name: Sudholt, Dirk
  last_name: Sudholt
citation:
  ama: 'Bossek J, Neumann F, Peng P, Sudholt D. Runtime Analysis of Randomized Search
    Heuristics for Dynamic Graph Coloring. In: <i>Proceedings of the Genetic and Evolutionary
    Computation Conference</i>. GECCO ’19. Association for Computing Machinery; 2019:1443–1451.
    doi:<a href="https://doi.org/10.1145/3321707.3321792">10.1145/3321707.3321792</a>'
  apa: Bossek, J., Neumann, F., Peng, P., &#38; Sudholt, D. (2019). Runtime Analysis
    of Randomized Search Heuristics for Dynamic Graph Coloring. <i>Proceedings of
    the Genetic and Evolutionary Computation Conference</i>, 1443–1451. <a href="https://doi.org/10.1145/3321707.3321792">https://doi.org/10.1145/3321707.3321792</a>
  bibtex: '@inproceedings{Bossek_Neumann_Peng_Sudholt_2019, place={New York, NY, USA},
    series={GECCO ’19}, title={Runtime Analysis of Randomized Search Heuristics for
    Dynamic Graph Coloring}, DOI={<a href="https://doi.org/10.1145/3321707.3321792">10.1145/3321707.3321792</a>},
    booktitle={Proceedings of the Genetic and Evolutionary Computation Conference},
    publisher={Association for Computing Machinery}, author={Bossek, Jakob and Neumann,
    Frank and Peng, Pan and Sudholt, Dirk}, year={2019}, pages={1443–1451}, collection={GECCO
    ’19} }'
  chicago: 'Bossek, Jakob, Frank Neumann, Pan Peng, and Dirk Sudholt. “Runtime Analysis
    of Randomized Search Heuristics for Dynamic Graph Coloring.” In <i>Proceedings
    of the Genetic and Evolutionary Computation Conference</i>, 1443–1451. GECCO ’19.
    New York, NY, USA: Association for Computing Machinery, 2019. <a href="https://doi.org/10.1145/3321707.3321792">https://doi.org/10.1145/3321707.3321792</a>.'
  ieee: 'J. Bossek, F. Neumann, P. Peng, and D. Sudholt, “Runtime Analysis of Randomized
    Search Heuristics for Dynamic Graph Coloring,” in <i>Proceedings of the Genetic
    and Evolutionary Computation Conference</i>, 2019, pp. 1443–1451, doi: <a href="https://doi.org/10.1145/3321707.3321792">10.1145/3321707.3321792</a>.'
  mla: Bossek, Jakob, et al. “Runtime Analysis of Randomized Search Heuristics for
    Dynamic Graph Coloring.” <i>Proceedings of the Genetic and Evolutionary Computation
    Conference</i>, Association for Computing Machinery, 2019, pp. 1443–1451, doi:<a
    href="https://doi.org/10.1145/3321707.3321792">10.1145/3321707.3321792</a>.
  short: 'J. Bossek, F. Neumann, P. Peng, D. Sudholt, in: Proceedings of the Genetic
    and Evolutionary Computation Conference, Association for Computing Machinery,
    New York, NY, USA, 2019, pp. 1443–1451.'
date_created: 2023-11-14T15:58:52Z
date_updated: 2023-12-13T10:42:37Z
department:
- _id: '819'
doi: 10.1145/3321707.3321792
extern: '1'
keyword:
- dynamic optimization
- evolutionary algorithms
- running time analysis
- theory
language:
- iso: eng
page: 1443–1451
place: New York, NY, USA
publication: Proceedings of the Genetic and Evolutionary Computation Conference
publication_identifier:
  isbn:
  - 978-1-4503-6111-8
publication_status: published
publisher: Association for Computing Machinery
series_title: GECCO ’19
status: public
title: Runtime Analysis of Randomized Search Heuristics for Dynamic Graph Coloring
type: conference
user_id: '102979'
year: '2019'
...
---
_id: '48840'
abstract:
- lang: eng
  text: Research has shown that for many single-objective graph problems where optimum
    solutions are composed of low weight sub-graphs, such as the minimum spanning
    tree problem (MST), mutation operators favoring low weight edges show superior
    performance. Intuitively, similar observations should hold for multi-criteria
    variants of such problems. In this work, we focus on the multi-criteria MST problem.
    A thorough experimental study is conducted where we estimate the probability of
    edges being part of non-dominated spanning trees as a function of the edges’ non-domination
    level or domination count, respectively. Building on gained insights, we propose
    several biased one-edge-exchange mutation operators that differ in the used edge-selection
    probability distribution (biased towards edges of low rank). Our empirical analysis
    shows that among different graph types (dense and sparse) and edge weight types
    (both uniformly random and combinations of Euclidean and uniformly random) biased
    edge-selection strategies perform superior in contrast to the baseline uniform
    edge-selection. Our findings are in particular strong for dense graphs.
author:
- first_name: Jakob
  full_name: Bossek, Jakob
  id: '102979'
  last_name: Bossek
  orcid: 0000-0002-4121-4668
- first_name: Christian
  full_name: Grimme, Christian
  last_name: Grimme
- first_name: Frank
  full_name: Neumann, Frank
  last_name: Neumann
citation:
  ama: 'Bossek J, Grimme C, Neumann F. On the Benefits of Biased Edge-Exchange Mutation
    for the Multi-Criteria Spanning Tree Problem. In: <i>Proceedings of the Genetic
    and Evolutionary Computation Conference</i>. GECCO ’19. Association for Computing
    Machinery; 2019:516–523. doi:<a href="https://doi.org/10.1145/3321707.3321818">10.1145/3321707.3321818</a>'
  apa: Bossek, J., Grimme, C., &#38; Neumann, F. (2019). On the Benefits of Biased
    Edge-Exchange Mutation for the Multi-Criteria Spanning Tree Problem. <i>Proceedings
    of the Genetic and Evolutionary Computation Conference</i>, 516–523. <a href="https://doi.org/10.1145/3321707.3321818">https://doi.org/10.1145/3321707.3321818</a>
  bibtex: '@inproceedings{Bossek_Grimme_Neumann_2019, place={New York, NY, USA}, series={GECCO
    ’19}, title={On the Benefits of Biased Edge-Exchange Mutation for the Multi-Criteria
    Spanning Tree Problem}, DOI={<a href="https://doi.org/10.1145/3321707.3321818">10.1145/3321707.3321818</a>},
    booktitle={Proceedings of the Genetic and Evolutionary Computation Conference},
    publisher={Association for Computing Machinery}, author={Bossek, Jakob and Grimme,
    Christian and Neumann, Frank}, year={2019}, pages={516–523}, collection={GECCO
    ’19} }'
  chicago: 'Bossek, Jakob, Christian Grimme, and Frank Neumann. “On the Benefits of
    Biased Edge-Exchange Mutation for the Multi-Criteria Spanning Tree Problem.” In
    <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 516–523.
    GECCO ’19. New York, NY, USA: Association for Computing Machinery, 2019. <a href="https://doi.org/10.1145/3321707.3321818">https://doi.org/10.1145/3321707.3321818</a>.'
  ieee: 'J. Bossek, C. Grimme, and F. Neumann, “On the Benefits of Biased Edge-Exchange
    Mutation for the Multi-Criteria Spanning Tree Problem,” in <i>Proceedings of the
    Genetic and Evolutionary Computation Conference</i>, 2019, pp. 516–523, doi: <a
    href="https://doi.org/10.1145/3321707.3321818">10.1145/3321707.3321818</a>.'
  mla: Bossek, Jakob, et al. “On the Benefits of Biased Edge-Exchange Mutation for
    the Multi-Criteria Spanning Tree Problem.” <i>Proceedings of the Genetic and Evolutionary
    Computation Conference</i>, Association for Computing Machinery, 2019, pp. 516–523,
    doi:<a href="https://doi.org/10.1145/3321707.3321818">10.1145/3321707.3321818</a>.
  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: '10000'
abstract:
- lang: eng
  text: Ultraschall wird zur Effizienzsteigerung in verfahrenstechnischen Prozessen
    eingesetzt. Die Betriebsparamter der Ultraschallsysteme werden empirisch ermittelt,
    da derzeit keine systematische Analyse der Wechselwirkung zwischen Ultraschallwandler
    und Schallfeld sowie kein Verfahren zur Messung der Kavitationsaktivität ohne
    zusätzlichen Sensor existieren. Auf Basis einer experimentellen Analyse des betrachteten
    sonochemischen Reaktors wird ein Finite-Elemente-Modell aufgebaut, das die Wechselwirkung
    zwischen Schallfeld und Ultraschallwandler berücksichtigt. Die modellbasierte
    Analyse zeigt, dass wegen der akustischen Eigenschaften des Autoklavs nur direkt
    an der Sonotrode Kavitation entsteht. Die Wechselwirkung zwischen Ultraschallwandler
    und Schallfeld ermöglicht Aussagen über das Schallfeld und die Kavitationsaktivität
    auf Basis der Rückwirkung auf den Ultraschallwandler. Die lineare Schalldruckverteilung
    ermöglicht eine Prognose über die Verteilung von Kavitationszonen. Das beschriebene
    Modell liefert wertvolle Erkenntnisse für die Auslegung, Analyse und Skalierung
    sonochemischer Reaktoren. Auf Grund der rauen Prozessrandbedingungen ist die Applikation
    von Sensoren zur Überwachung der Kavitationsaktivität in vielen sonochemischen
    Prozessen nicht möglich. Zur prozessbegleitenden Messung der Kavitationsaktivität
    wird ein Verfahren entwickelt, das die Bewertung der Kavitationsaktivität durch
    Auswertung der Rückwirkung auf den Ultraschallwandler erlaubt. Das Messverfahren
    ermöglicht eine vorhersagbare und reproduzierbare Durchführung kavitationsbasierter
    Prozesse und stellt eine wichtige Erweiterung für bestehende und neue Ultraschallsysteme
    dar.
author:
- first_name: Peter
  full_name: Bornmann, Peter
  last_name: Bornmann
citation:
  ama: Bornmann P. <i>Modellierung Und Experimentelle Charakterisierung Der Wechselwirkung
    Zwischen Ultraschallwandler Und Flüssigkeit in Kavitationsbasierten Prozessen</i>.
    Shaker; 2019.
  apa: Bornmann, P. (2019). <i>Modellierung und experimentelle Charakterisierung der
    Wechselwirkung zwischen Ultraschallwandler und Flüssigkeit in kavitationsbasierten
    Prozessen</i>. Shaker.
  bibtex: '@book{Bornmann_2019, title={Modellierung und experimentelle Charakterisierung
    der Wechselwirkung zwischen Ultraschallwandler und Flüssigkeit in kavitationsbasierten
    Prozessen}, publisher={Shaker}, author={Bornmann, Peter}, year={2019} }'
  chicago: Bornmann, Peter. <i>Modellierung Und Experimentelle Charakterisierung Der
    Wechselwirkung Zwischen Ultraschallwandler Und Flüssigkeit in Kavitationsbasierten
    Prozessen</i>. Shaker, 2019.
  ieee: P. Bornmann, <i>Modellierung und experimentelle Charakterisierung der Wechselwirkung
    zwischen Ultraschallwandler und Flüssigkeit in kavitationsbasierten Prozessen</i>.
    Shaker, 2019.
  mla: Bornmann, Peter. <i>Modellierung Und Experimentelle Charakterisierung Der Wechselwirkung
    Zwischen Ultraschallwandler Und Flüssigkeit in Kavitationsbasierten Prozessen</i>.
    Shaker, 2019.
  short: P. Bornmann, Modellierung Und Experimentelle Charakterisierung Der Wechselwirkung
    Zwischen Ultraschallwandler Und Flüssigkeit in Kavitationsbasierten Prozessen,
    Shaker, 2019.
date_created: 2019-05-27T10:29:53Z
date_updated: 2023-09-15T12:23:55Z
department:
- _id: '151'
keyword:
- Sonochemie
- Akustische Kavitation
- Kavitationsmessung
- Kavitationsdetektion
- FEM-Simulation Ultraschallwandler
- Prozessüberwachung
- FEM-Simulation Schallfeld
- Self-Sensing
- Piezoelektrische Ultraschallwandler
- Ultraschallreinigung
language:
- iso: eng
publisher: Shaker
status: public
title: Modellierung und experimentelle Charakterisierung der Wechselwirkung zwischen
  Ultraschallwandler und Flüssigkeit in kavitationsbasierten Prozessen
type: dissertation
user_id: '210'
year: '2019'
...
---
_id: '1163'
abstract:
- lang: eng
  text: "In this paper we present two major results:\r\nFirst, we introduce the first
    self-stabilizing version of a supervised overlay network (as introduced in~\\cite{DBLP:conf/ispan/KothapalliS05})
    by presenting a self-stabilizing supervised skip ring.\r\nSecondly, we show how
    to use the self-stabilizing supervised skip ring to construct an efficient self-stabilizing
    publish-subscribe system.\r\nThat is, in addition to stabilizing the overlay network,
    every subscriber of a topic will eventually know all of the publications that
    have been issued so far for that topic. The communication work needed to processes
    a subscribe or unsubscribe operation is just a constant in a legitimate state,
    and the communication work of checking whether the system is still in a legitimate
    state is just a constant on expectation for the supervisor as well as any process
    in the system.\r\n"
author:
- first_name: Michael
  full_name: Feldmann, Michael
  id: '23538'
  last_name: Feldmann
- first_name: Christina
  full_name: Kolb, Christina
  id: '43647'
  last_name: Kolb
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
- first_name: Thim Frederik
  full_name: Strothmann, Thim Frederik
  id: '11319'
  last_name: Strothmann
citation:
  ama: 'Feldmann M, Kolb C, Scheideler C, Strothmann TF. Self-Stabilizing Supervised
    Publish-Subscribe Systems. In: <i>Proceedings of the 32nd IEEE International Parallel
    &#38; Distributed Processing Symposium (IPDPS)</i>. IEEE; 2018. doi:<a href="https://doi.org/10.1109/IPDPS.2018.00114">10.1109/IPDPS.2018.00114</a>'
  apa: 'Feldmann, M., Kolb, C., Scheideler, C., &#38; Strothmann, T. F. (2018). Self-Stabilizing
    Supervised Publish-Subscribe Systems. In <i>Proceedings of the 32nd IEEE International
    Parallel &#38; Distributed Processing Symposium (IPDPS)</i>. Vancouver: IEEE.
    <a href="https://doi.org/10.1109/IPDPS.2018.00114">https://doi.org/10.1109/IPDPS.2018.00114</a>'
  bibtex: '@inproceedings{Feldmann_Kolb_Scheideler_Strothmann_2018, title={Self-Stabilizing
    Supervised Publish-Subscribe Systems}, DOI={<a href="https://doi.org/10.1109/IPDPS.2018.00114">10.1109/IPDPS.2018.00114</a>},
    booktitle={Proceedings of the 32nd IEEE International Parallel &#38; Distributed
    Processing Symposium (IPDPS)}, publisher={IEEE}, author={Feldmann, Michael and
    Kolb, Christina and Scheideler, Christian and Strothmann, Thim Frederik}, year={2018}
    }'
  chicago: Feldmann, Michael, Christina Kolb, Christian Scheideler, and Thim Frederik
    Strothmann. “Self-Stabilizing Supervised Publish-Subscribe Systems.” In <i>Proceedings
    of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium
    (IPDPS)</i>. IEEE, 2018. <a href="https://doi.org/10.1109/IPDPS.2018.00114">https://doi.org/10.1109/IPDPS.2018.00114</a>.
  ieee: M. Feldmann, C. Kolb, C. Scheideler, and T. F. Strothmann, “Self-Stabilizing
    Supervised Publish-Subscribe Systems,” in <i>Proceedings of the 32nd IEEE International
    Parallel &#38; Distributed Processing Symposium (IPDPS)</i>, Vancouver, 2018.
  mla: Feldmann, Michael, et al. “Self-Stabilizing Supervised Publish-Subscribe Systems.”
    <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing
    Symposium (IPDPS)</i>, IEEE, 2018, doi:<a href="https://doi.org/10.1109/IPDPS.2018.00114">10.1109/IPDPS.2018.00114</a>.
  short: 'M. Feldmann, C. Kolb, C. Scheideler, T.F. Strothmann, in: Proceedings of
    the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS),
    IEEE, 2018.'
conference:
  end_date: 2018-5-24
  location: Vancouver
  name: 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS)
  start_date: 2018-5-22
date_created: 2018-02-01T13:56:01Z
date_updated: 2022-01-06T06:51:05Z
ddc:
- '040'
department:
- _id: '79'
- _id: '66'
doi: 10.1109/IPDPS.2018.00114
external_id:
  arxiv:
  - '1710.08128'
file:
- access_level: closed
  content_type: application/pdf
  creator: mfeldma2
  date_created: 2018-10-31T13:25:37Z
  date_updated: 2018-10-31T13:25:37Z
  file_id: '5211'
  file_name: 08425258.pdf
  file_size: 239559
  relation: main_file
  success: 1
file_date_updated: 2018-10-31T13:25:37Z
has_accepted_license: '1'
keyword:
- Topological Self-stabilization
- Supervised Overlay
- Publish-Subscribe System
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '5'
  name: SFB 901 - Subproject A1
publication: Proceedings of the 32nd IEEE International Parallel & Distributed Processing
  Symposium (IPDPS)
publisher: IEEE
status: public
title: Self-Stabilizing Supervised Publish-Subscribe Systems
type: conference
user_id: '11319'
year: '2018'
...
---
_id: '5675'
abstract:
- lang: eng
  text: When responding to natural disasters, professional relief units are often
    supported by many volunteers which are not affiliated to humanitarian organizations.
    The effective coordination of these volunteers is crucial to leverage their capabilities
    and to avoid conflicts with professional relief units. In this paper, we empirically
    identify key requirements that professional relief units pose on this coordination.
    Based on these requirements, we suggest a decision model. We computationally solve
    a real-world instance of the model and empirically validate the computed solution
    in interviews with practitioners. Our results show that the suggested model allows
    for solving volunteer coordination tasks of realistic size near-optimally within
    short time, with the determined solution being well accepted by practitioners.
    We also describe in this article how the suggested decision support model is integrated
    in the volunteer coordination system which we develop in joint cooperation with
    a disaster management authority and a software development company.
author:
- first_name: Gerhard
  full_name: Rauchecker, Gerhard
  last_name: Rauchecker
- first_name: Guido
  full_name: Schryen, Guido
  id: '72850'
  last_name: Schryen
citation:
  ama: 'Rauchecker G, Schryen G. Decision Support for the Optimal Coordination of
    Spontaneous Volunteers in Disaster Relief. In: <i>Proceedings of the 15th International
    Conference on Information Systems for Crisis Response and Management</i>. ; 2018.'
  apa: Rauchecker, G., &#38; Schryen, G. (2018). Decision Support for the Optimal
    Coordination of Spontaneous Volunteers in Disaster Relief. In <i>Proceedings of
    the 15th International Conference on Information Systems for Crisis Response and
    Management</i>. Rochester, NY, USA.
  bibtex: '@inproceedings{Rauchecker_Schryen_2018, title={Decision Support for the
    Optimal Coordination of Spontaneous Volunteers in Disaster Relief}, booktitle={Proceedings
    of the 15th International Conference on Information Systems for Crisis Response
    and Management}, author={Rauchecker, Gerhard and Schryen, Guido}, year={2018}
    }'
  chicago: Rauchecker, Gerhard, and Guido Schryen. “Decision Support for the Optimal
    Coordination of Spontaneous Volunteers in Disaster Relief.” In <i>Proceedings
    of the 15th International Conference on Information Systems for Crisis Response
    and Management</i>, 2018.
  ieee: G. Rauchecker and G. Schryen, “Decision Support for the Optimal Coordination
    of Spontaneous Volunteers in Disaster Relief,” in <i>Proceedings of the 15th International
    Conference on Information Systems for Crisis Response and Management</i>, Rochester,
    NY, USA, 2018.
  mla: Rauchecker, Gerhard, and Guido Schryen. “Decision Support for the Optimal Coordination
    of Spontaneous Volunteers in Disaster Relief.” <i>Proceedings of the 15th International
    Conference on Information Systems for Crisis Response and Management</i>, 2018.
  short: 'G. Rauchecker, G. Schryen, in: Proceedings of the 15th International Conference
    on Information Systems for Crisis Response and Management, 2018.'
conference:
  location: Rochester, NY, USA
  name: 15th International Conference on Information Systems for Crisis Response and
    Management
date_created: 2018-11-14T15:35:54Z
date_updated: 2022-01-06T07:02:28Z
ddc:
- '000'
department:
- _id: '277'
extern: '1'
file:
- access_level: open_access
  content_type: application/pdf
  creator: hsiemes
  date_created: 2018-12-07T11:25:06Z
  date_updated: 2018-12-13T15:05:44Z
  file_id: '6020'
  file_name: 2018_ISCRAM_Conference_Proceedings - Publication Version.pdf
  file_size: 488472
  relation: main_file
file_date_updated: 2018-12-13T15:05:44Z
has_accepted_license: '1'
keyword:
- Coordination of spontaneous volunteers
- volunteer coordination system
- decision support
- scheduling optimization model
- linear programming
language:
- iso: eng
oa: '1'
publication: Proceedings of the 15th International Conference on Information Systems
  for Crisis Response and Management
status: public
title: Decision Support for the Optimal Coordination of Spontaneous Volunteers in
  Disaster Relief
type: conference
user_id: '61579'
year: '2018'
...
---
_id: '4411'
abstract:
- lang: eng
  text: "While a lot of research in distributed computing has covered solutions for
    self-stabilizing computing and topologies, there is far less work on self-stabilization
    for distributed data structures.\r\nConsidering crashing peers in peer-to-peer
    networks, it should not be taken for granted that a distributed data structure
    remains intact.\r\nIn this work, we present a self-stabilizing protocol for a
    distributed data structure called the hashed Patricia Trie (Kniesburges and Scheideler
    WALCOM'11) that enables efficient prefix search on a set of keys.\r\nThe data
    structure has a wide area of applications including string matching problems while
    offering low overhead and efficient operations when embedded on top of a distributed
    hash table.\r\nEspecially, longest prefix matching for $x$ can be done in $\\mathcal{O}(\\log
    |x|)$ hash table read accesses.\r\nWe show how to maintain the structure in a
    self-stabilizing way.\r\nOur protocol assures low overhead in a legal state and
    a total (asymptotically optimal) memory demand of $\\Theta(d)$ bits, where $d$
    is the number of bits needed for storing all keys."
author:
- first_name: Till
  full_name: Knollmann, Till
  id: '39241'
  last_name: Knollmann
  orcid: 0000-0003-2014-4696
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
citation:
  ama: 'Knollmann T, Scheideler C. A Self-Stabilizing Hashed Patricia Trie. In: Izumi
    T, Kuznetsov P, eds. <i>Proceedings of the 20th International Symposium on Stabilization,
    Safety, and Security of Distributed Systems (SSS)</i>. Vol 11201. Lecture Notes
    of Computer Science. Springer, Cham; 2018. doi:<a href="https://doi.org/10.1007/978-3-030-03232-6_1">10.1007/978-3-030-03232-6_1</a>'
  apa: 'Knollmann, T., &#38; Scheideler, C. (2018). A Self-Stabilizing Hashed Patricia
    Trie. In T. Izumi &#38; P. Kuznetsov (Eds.), <i>Proceedings of the 20th International
    Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>
    (Vol. 11201). Tokyo: Springer, Cham. <a href="https://doi.org/10.1007/978-3-030-03232-6_1">https://doi.org/10.1007/978-3-030-03232-6_1</a>'
  bibtex: '@inproceedings{Knollmann_Scheideler_2018, series={Lecture Notes of Computer
    Science}, title={A Self-Stabilizing Hashed Patricia Trie}, volume={11201}, DOI={<a
    href="https://doi.org/10.1007/978-3-030-03232-6_1">10.1007/978-3-030-03232-6_1</a>},
    booktitle={Proceedings of the 20th International Symposium on Stabilization, Safety,
    and Security of Distributed Systems (SSS)}, publisher={Springer, Cham}, author={Knollmann,
    Till and Scheideler, Christian}, editor={Izumi, Taisuke and Kuznetsov, PetrEditors},
    year={2018}, collection={Lecture Notes of Computer Science} }'
  chicago: Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia
    Trie.” In <i>Proceedings of the 20th International Symposium on Stabilization,
    Safety, and Security of Distributed Systems (SSS)</i>, edited by Taisuke Izumi
    and Petr Kuznetsov, Vol. 11201. Lecture Notes of Computer Science. Springer, Cham,
    2018. <a href="https://doi.org/10.1007/978-3-030-03232-6_1">https://doi.org/10.1007/978-3-030-03232-6_1</a>.
  ieee: T. Knollmann and C. Scheideler, “A Self-Stabilizing Hashed Patricia Trie,”
    in <i>Proceedings of the 20th International Symposium on Stabilization, Safety,
    and Security of Distributed Systems (SSS)</i>, Tokyo, 2018, vol. 11201.
  mla: Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia
    Trie.” <i>Proceedings of the 20th International Symposium on Stabilization, Safety,
    and Security of Distributed Systems (SSS)</i>, edited by Taisuke Izumi and Petr
    Kuznetsov, vol. 11201, Springer, Cham, 2018, doi:<a href="https://doi.org/10.1007/978-3-030-03232-6_1">10.1007/978-3-030-03232-6_1</a>.
  short: 'T. Knollmann, C. Scheideler, in: T. Izumi, P. Kuznetsov (Eds.), Proceedings
    of the 20th International Symposium on Stabilization, Safety, and Security of
    Distributed Systems (SSS), Springer, Cham, 2018.'
conference:
  end_date: 2018-11-07
  location: Tokyo
  name: 20th International Symposium on Stabilization, Safety, and Security of Distributed
    Systems (SSS)
  start_date: 2018-11-04
date_created: 2018-09-17T13:12:18Z
date_updated: 2022-01-06T07:01:02Z
ddc:
- '000'
department:
- _id: '63'
- _id: '79'
doi: 10.1007/978-3-030-03232-6_1
editor:
- first_name: Taisuke
  full_name: Izumi, Taisuke
  last_name: Izumi
- first_name: Petr
  full_name: Kuznetsov, Petr
  last_name: Kuznetsov
external_id:
  arxiv:
  - '1809.04923'
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2018-11-02T14:38:37Z
  date_updated: 2018-11-02T14:38:37Z
  file_id: '5277'
  file_name: ASelf-stabilizingHashedPatrici.pdf
  file_size: 500005
  relation: main_file
  success: 1
file_date_updated: 2018-11-02T14:38:37Z
has_accepted_license: '1'
intvolume: '     11201'
keyword:
- Self-Stabilizing
- Prefix Search
- Distributed Data Structure
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '5'
  name: SFB 901 - Subproject A1
publication: Proceedings of the 20th International Symposium on Stabilization, Safety,
  and Security of Distributed Systems (SSS)
publisher: Springer, Cham
series_title: Lecture Notes of Computer Science
status: public
title: A Self-Stabilizing Hashed Patricia Trie
type: conference
user_id: '39241'
volume: 11201
year: '2018'
...
---
_id: '9999'
abstract:
- lang: eng
  text: Ultrasonic wire bonding is an indispensable process in the industrial manufacturing
    of semiconductor devices. Copper wire is increasingly replacing the well-established
    aluminium wire because of its superior electrical, thermal and mechanical properties.
    Copper wire processes differ significantly from aluminium processes and are more
    sensitive to disturbances, which reduces the range of parameter values suitable
    for a stable process. Disturbances can be compensated by an adaption of process
    parameters, but finding suitable parameters manually is difficult and time-consuming.
    This paper presents a physical model of the ultrasonic wire bonding process including
    the friction contact between tool and wire. This model yields novel insights into
    the process. A prototype of a multi-objective optimizing bonding machine (MOBM)
    is presented. It uses multi-objective optimization, based on the complete process
    model, to automatically select the best operating point as a compromise of concurrent
    objectives.
author:
- first_name: Andreas
  full_name: Unger, Andreas
  last_name: Unger
- first_name: Matthias
  full_name: Hunstig, Matthias
  last_name: Hunstig
- first_name: Tobias
  full_name: Meyer, Tobias
  last_name: Meyer
- first_name: Michael
  full_name: Brökelmann, Michael
  last_name: Brökelmann
- first_name: Walter
  full_name: Sextro, Walter
  id: '21220'
  last_name: Sextro
citation:
  ama: 'Unger A, Hunstig M, Meyer T, Brökelmann M, Sextro W. Intelligent Production
    of Wire Bonds using Multi-Objective Optimization – Insights, Opportunities and
    Challenges. In: <i>In Proceedings of IMAPS 2018 – 51st Symposium on Microelectronics,
    Pasadena, CA, 2018</i>. Vol Vol. 2018, No. 1, pp. 000572-000577. ; 2018. doi:<a
    href="https://doi.org/10.4071/2380-4505-2018.1.000572">10.4071/2380-4505-2018.1.000572</a>'
  apa: Unger, A., Hunstig, M., Meyer, T., Brökelmann, M., &#38; Sextro, W. (2018).
    Intelligent Production of Wire Bonds using Multi-Objective Optimization – Insights,
    Opportunities and Challenges. In <i>In Proceedings of IMAPS 2018 – 51st Symposium
    on Microelectronics, Pasadena, CA, 2018</i> (Vol. Vol. 2018, No. 1, pp. 000572-000577.).
    <a href="https://doi.org/10.4071/2380-4505-2018.1.000572">https://doi.org/10.4071/2380-4505-2018.1.000572</a>
  bibtex: '@inproceedings{Unger_Hunstig_Meyer_Brökelmann_Sextro_2018, title={Intelligent
    Production of Wire Bonds using Multi-Objective Optimization – Insights, Opportunities
    and Challenges}, volume={Vol. 2018, No. 1, pp. 000572-000577.}, DOI={<a href="https://doi.org/10.4071/2380-4505-2018.1.000572">10.4071/2380-4505-2018.1.000572</a>},
    booktitle={In Proceedings of IMAPS 2018 – 51st Symposium on Microelectronics,
    Pasadena, CA, 2018}, author={Unger, Andreas and Hunstig, Matthias and Meyer, Tobias
    and Brökelmann, Michael and Sextro, Walter}, year={2018} }'
  chicago: Unger, Andreas, Matthias Hunstig, Tobias Meyer, Michael Brökelmann, and
    Walter Sextro. “Intelligent Production of Wire Bonds Using Multi-Objective Optimization
    – Insights, Opportunities and Challenges.” In <i>In Proceedings of IMAPS 2018
    – 51st Symposium on Microelectronics, Pasadena, CA, 2018</i>, Vol. Vol. 2018,
    No. 1, pp. 000572-000577., 2018. <a href="https://doi.org/10.4071/2380-4505-2018.1.000572">https://doi.org/10.4071/2380-4505-2018.1.000572</a>.
  ieee: A. Unger, M. Hunstig, T. Meyer, M. Brökelmann, and W. Sextro, “Intelligent
    Production of Wire Bonds using Multi-Objective Optimization – Insights, Opportunities
    and Challenges,” in <i>In Proceedings of IMAPS 2018 – 51st Symposium on Microelectronics,
    Pasadena, CA, 2018</i>, 2018, vol. Vol. 2018, No. 1, pp. 000572-000577.
  mla: Unger, Andreas, et al. “Intelligent Production of Wire Bonds Using Multi-Objective
    Optimization – Insights, Opportunities and Challenges.” <i>In Proceedings of IMAPS
    2018 – 51st Symposium on Microelectronics, Pasadena, CA, 2018</i>, vol. Vol. 2018,
    No. 1, pp. 000572-000577., 2018, doi:<a href="https://doi.org/10.4071/2380-4505-2018.1.000572">10.4071/2380-4505-2018.1.000572</a>.
  short: 'A. Unger, M. Hunstig, T. Meyer, M. Brökelmann, W. Sextro, in: In Proceedings
    of IMAPS 2018 – 51st Symposium on Microelectronics, Pasadena, CA, 2018, 2018.'
date_created: 2019-05-27T10:27:45Z
date_updated: 2020-05-07T05:33:56Z
department:
- _id: '151'
doi: 10.4071/2380-4505-2018.1.000572
keyword:
- wire bonding
- multi-objective optimization
- process model
- copper wire
- self-optimization
language:
- iso: eng
project:
- _id: '92'
  grant_number: 02 PQ2210
  name: Intelligente Herstellung zuverlässiger Kupferbondverbindungen
publication: In Proceedings of IMAPS 2018 – 51st Symposium on Microelectronics, Pasadena,
  CA, 2018
quality_controlled: '1'
status: public
title: Intelligent Production of Wire Bonds using Multi-Objective Optimization – Insights,
  Opportunities and Challenges
type: conference
user_id: '210'
volume: Vol. 2018, No. 1, pp. 000572-000577.
year: '2018'
...
---
_id: '32158'
abstract:
- lang: eng
  text: 'Sociogenesis addresses a pervasive problem in psychology given by Cartesian
    dualism that assigns the mental an inner locus apart from material activity. Aligning
    ourselves to the ongoing critical discussions of interiorization in psychology,
    we explore the crucial notion of space by highlighting language as sociocultural
    and dialogical activity performed by other-oriented individuals. We discuss space
    in terms of the “language spacetime”, a symbolic, embodied formation of mutually
    positioned speaking and listening selves. This leads beyond the “inside-outside”
    container metaphor and allows for a reformulation of interiorization. Interiorization
    is conceptualized as a continuous series of different, though mutually related
    movements between self and other and self and self that lead to and are supported
    by specific formations in language activity: reversion, transposition, and decoupling.
    Along a short passage of a video-based interview, we trace the reversion of dialogical
    positions within the addressivity constellation of the two interlocutors, their
    interactive creation of a heterotopic spacetime, and the decoupling of one speaker''s
    psychological activity from the concrete here-and-now and the present other by
    moving and acting into this new sphere. Interiorization appears as a movement
    at the border of past, present, and possible future(s).'
author:
- first_name: Marie-Cécile
  full_name: Bertau, Marie-Cécile
  last_name: Bertau
- first_name: Andrea
  full_name: Karsten, Andrea
  id: '53917'
  last_name: Karsten
citation:
  ama: 'Bertau M-C, Karsten A. Reconsidering interiorization: Self moving across language
    spacetimes. <i>New Ideas in Psychology</i>. 2018;49:7-17. doi:<a href="https://doi.org/10.1016/j.newideapsych.2017.12.001">10.1016/j.newideapsych.2017.12.001</a>'
  apa: 'Bertau, M.-C., &#38; Karsten, A. (2018). Reconsidering interiorization: Self
    moving across language spacetimes. <i>New Ideas in Psychology</i>, <i>49</i>,
    7–17. <a href="https://doi.org/10.1016/j.newideapsych.2017.12.001">https://doi.org/10.1016/j.newideapsych.2017.12.001</a>'
  bibtex: '@article{Bertau_Karsten_2018, title={Reconsidering interiorization: Self
    moving across language spacetimes}, volume={49}, DOI={<a href="https://doi.org/10.1016/j.newideapsych.2017.12.001">10.1016/j.newideapsych.2017.12.001</a>},
    journal={New Ideas in Psychology}, publisher={Elsevier BV}, author={Bertau, Marie-Cécile
    and Karsten, Andrea}, year={2018}, pages={7–17} }'
  chicago: 'Bertau, Marie-Cécile, and Andrea Karsten. “Reconsidering Interiorization:
    Self Moving across Language Spacetimes.” <i>New Ideas in Psychology</i> 49 (2018):
    7–17. <a href="https://doi.org/10.1016/j.newideapsych.2017.12.001">https://doi.org/10.1016/j.newideapsych.2017.12.001</a>.'
  ieee: 'M.-C. Bertau and A. Karsten, “Reconsidering interiorization: Self moving
    across language spacetimes,” <i>New Ideas in Psychology</i>, vol. 49, pp. 7–17,
    2018, doi: <a href="https://doi.org/10.1016/j.newideapsych.2017.12.001">10.1016/j.newideapsych.2017.12.001</a>.'
  mla: 'Bertau, Marie-Cécile, and Andrea Karsten. “Reconsidering Interiorization:
    Self Moving across Language Spacetimes.” <i>New Ideas in Psychology</i>, vol.
    49, Elsevier BV, 2018, pp. 7–17, doi:<a href="https://doi.org/10.1016/j.newideapsych.2017.12.001">10.1016/j.newideapsych.2017.12.001</a>.'
  short: M.-C. Bertau, A. Karsten, New Ideas in Psychology 49 (2018) 7–17.
date_created: 2022-06-24T14:41:20Z
date_updated: 2022-07-18T09:21:16Z
department:
- _id: '424'
doi: 10.1016/j.newideapsych.2017.12.001
intvolume: '        49'
keyword:
- Interiorization
- Dialogical self
- Language activity
- Voice
- Vygotsky
- Heterotopia
- Video-confrontation
language:
- iso: eng
page: 7-17
publication: New Ideas in Psychology
publication_identifier:
  issn:
  - 0732-118X
publication_status: published
publisher: Elsevier BV
status: public
title: 'Reconsidering interiorization: Self moving across language spacetimes'
type: journal_article
user_id: '42165'
volume: 49
year: '2018'
...
---
_id: '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: <i>Proceedings of the Genetic and Evolutionary
    Computation Conference</i>. GECCO ’18. Association for Computing Machinery; 2018:585–592.
    doi:<a href="https://doi.org/10.1145/3205455.3205548">10.1145/3205455.3205548</a>'
  apa: Bossek, J., Grimme, C., Meisel, S., Rudolph, G., &#38; Trautmann, H. (2018).
    Local Search Effects in Bi-Objective Orienteering. <i>Proceedings of the Genetic
    and Evolutionary Computation Conference</i>, 585–592. <a href="https://doi.org/10.1145/3205455.3205548">https://doi.org/10.1145/3205455.3205548</a>
  bibtex: '@inproceedings{Bossek_Grimme_Meisel_Rudolph_Trautmann_2018, place={New
    York, NY, USA}, series={GECCO ’18}, title={Local Search Effects in Bi-Objective
    Orienteering}, DOI={<a href="https://doi.org/10.1145/3205455.3205548">10.1145/3205455.3205548</a>},
    booktitle={Proceedings of the Genetic and Evolutionary Computation Conference},
    publisher={Association for Computing Machinery}, author={Bossek, Jakob and Grimme,
    Christian and Meisel, Stephan and Rudolph, Günter and Trautmann, Heike}, year={2018},
    pages={585–592}, collection={GECCO ’18} }'
  chicago: 'Bossek, Jakob, Christian Grimme, Stephan Meisel, Günter Rudolph, and Heike
    Trautmann. “Local Search Effects in Bi-Objective Orienteering.” In <i>Proceedings
    of the Genetic and Evolutionary Computation Conference</i>, 585–592. GECCO ’18.
    New York, NY, USA: Association for Computing Machinery, 2018. <a href="https://doi.org/10.1145/3205455.3205548">https://doi.org/10.1145/3205455.3205548</a>.'
  ieee: 'J. Bossek, C. Grimme, S. Meisel, G. Rudolph, and H. Trautmann, “Local Search
    Effects in Bi-Objective Orienteering,” in <i>Proceedings of the Genetic and Evolutionary
    Computation Conference</i>, 2018, pp. 585–592, doi: <a href="https://doi.org/10.1145/3205455.3205548">10.1145/3205455.3205548</a>.'
  mla: Bossek, Jakob, et al. “Local Search Effects in Bi-Objective Orienteering.”
    <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, Association
    for Computing Machinery, 2018, pp. 585–592, doi:<a href="https://doi.org/10.1145/3205455.3205548">10.1145/3205455.3205548</a>.
  short: 'J. Bossek, C. Grimme, S. Meisel, G. Rudolph, H. Trautmann, in: Proceedings
    of the Genetic and Evolutionary Computation Conference, Association for Computing
    Machinery, New York, NY, USA, 2018, pp. 585–592.'
date_created: 2023-11-14T15:58:51Z
date_updated: 2023-12-13T10:42:14Z
department:
- _id: '819'
doi: 10.1145/3205455.3205548
extern: '1'
keyword:
- combinatorial optimization
- metaheuristics
- multi-objective optimization
- orienteering
- transportation
language:
- iso: eng
page: 585–592
place: New York, NY, USA
publication: Proceedings of the Genetic and Evolutionary Computation Conference
publication_identifier:
  isbn:
  - 978-1-4503-5618-3
publication_status: published
publisher: Association for Computing Machinery
series_title: GECCO ’18
status: public
title: Local Search Effects in Bi-Objective Orienteering
type: conference
user_id: '102979'
year: '2018'
...
---
_id: '48867'
abstract:
- lang: eng
  text: Assessing the performance of stochastic optimization algorithms in the field
    of multi-objective optimization is of utmost importance. Besides the visual comparison
    of the obtained approximation sets, more sophisticated methods have been proposed
    in the last decade, e. g., a variety of quantitative performance indicators or
    statistical tests. In this paper, we present tools implemented in the R package
    ecr, which assist in performing comprehensive and sound comparison and evaluation
    of multi-objective evolutionary algorithms following recommendations from the
    literature.
author:
- first_name: Jakob
  full_name: Bossek, Jakob
  id: '102979'
  last_name: Bossek
  orcid: 0000-0002-4121-4668
citation:
  ama: 'Bossek J. Performance Assessment of Multi-Objective Evolutionary Algorithms
    with the R Package ecr. In: <i>Proceedings of the Genetic and Evolutionary Computation
    Conference Companion</i>. GECCO ’18. Association for Computing Machinery; 2018:1350–1356.
    doi:<a href="https://doi.org/10.1145/3205651.3208312">10.1145/3205651.3208312</a>'
  apa: Bossek, J. (2018). Performance Assessment of Multi-Objective Evolutionary Algorithms
    with the R Package ecr. <i>Proceedings of the Genetic and Evolutionary Computation
    Conference Companion</i>, 1350–1356. <a href="https://doi.org/10.1145/3205651.3208312">https://doi.org/10.1145/3205651.3208312</a>
  bibtex: '@inproceedings{Bossek_2018, place={New York, NY, USA}, series={GECCO ’18},
    title={Performance Assessment of Multi-Objective Evolutionary Algorithms with
    the R Package ecr}, DOI={<a href="https://doi.org/10.1145/3205651.3208312">10.1145/3205651.3208312</a>},
    booktitle={Proceedings of the Genetic and Evolutionary Computation Conference
    Companion}, publisher={Association for Computing Machinery}, author={Bossek, Jakob},
    year={2018}, pages={1350–1356}, collection={GECCO ’18} }'
  chicago: 'Bossek, Jakob. “Performance Assessment of Multi-Objective Evolutionary
    Algorithms with the R Package Ecr.” In <i>Proceedings of the Genetic and Evolutionary
    Computation Conference Companion</i>, 1350–1356. GECCO ’18. New York, NY, USA:
    Association for Computing Machinery, 2018. <a href="https://doi.org/10.1145/3205651.3208312">https://doi.org/10.1145/3205651.3208312</a>.'
  ieee: 'J. Bossek, “Performance Assessment of Multi-Objective Evolutionary Algorithms
    with the R Package ecr,” in <i>Proceedings of the Genetic and Evolutionary Computation
    Conference Companion</i>, 2018, pp. 1350–1356, doi: <a href="https://doi.org/10.1145/3205651.3208312">10.1145/3205651.3208312</a>.'
  mla: Bossek, Jakob. “Performance Assessment of Multi-Objective Evolutionary Algorithms
    with the R Package Ecr.” <i>Proceedings of the Genetic and Evolutionary Computation
    Conference Companion</i>, Association for Computing Machinery, 2018, pp. 1350–1356,
    doi:<a href="https://doi.org/10.1145/3205651.3208312">10.1145/3205651.3208312</a>.
  short: 'J. Bossek, in: Proceedings of the Genetic and Evolutionary Computation Conference
    Companion, Association for Computing Machinery, New York, NY, USA, 2018, pp. 1350–1356.'
date_created: 2023-11-14T15:58:56Z
date_updated: 2023-12-13T10:46:04Z
department:
- _id: '819'
doi: 10.1145/3205651.3208312
extern: '1'
keyword:
- evolutionary optimization
- performance assessment
- software-tools
language:
- iso: eng
page: 1350–1356
place: New York, NY, USA
publication: Proceedings of the Genetic and Evolutionary Computation Conference Companion
publication_identifier:
  isbn:
  - 978-1-4503-5764-7
publication_status: published
publisher: Association for Computing Machinery
series_title: GECCO ’18
status: public
title: Performance Assessment of Multi-Objective Evolutionary Algorithms with the
  R Package ecr
type: conference
user_id: '102979'
year: '2018'
...
---
_id: '48885'
abstract:
- lang: eng
  text: Performance comparisons of optimization algorithms are heavily influenced
    by the underlying indicator(s). In this paper we investigate commonly used performance
    indicators for single-objective stochastic solvers, such as the Penalized Average
    Runtime (e.g., PAR10) or the Expected Running Time (ERT), based on exemplary benchmark
    performances of state-of-the-art inexact TSP solvers. Thereby, we introduce a
    methodology for analyzing the effects of (usually heuristically set) indicator
    parametrizations - such as the penalty factor and the method used for aggregating
    across multiple runs - w.r.t. the robustness of the considered optimization algorithms.
author:
- first_name: Pascal
  full_name: Kerschke, Pascal
  last_name: Kerschke
- first_name: Jakob
  full_name: Bossek, Jakob
  id: '102979'
  last_name: Bossek
  orcid: 0000-0002-4121-4668
- first_name: Heike
  full_name: Trautmann, Heike
  last_name: Trautmann
citation:
  ama: 'Kerschke P, Bossek J, Trautmann H. Parameterization of State-of-the-Art Performance
    Indicators: A Robustness Study Based on Inexact TSP Solvers. In: <i>Proceedings
    of the Genetic and Evolutionary Computation Conference Companion</i>. GECCO’18.
    Association for Computing Machinery; 2018:1737–1744. doi:<a href="https://doi.org/10.1145/3205651.3208233">10.1145/3205651.3208233</a>'
  apa: 'Kerschke, P., Bossek, J., &#38; Trautmann, H. (2018). Parameterization of
    State-of-the-Art Performance Indicators: A Robustness Study Based on Inexact TSP
    Solvers. <i>Proceedings of the Genetic and Evolutionary Computation Conference
    Companion</i>, 1737–1744. <a href="https://doi.org/10.1145/3205651.3208233">https://doi.org/10.1145/3205651.3208233</a>'
  bibtex: '@inproceedings{Kerschke_Bossek_Trautmann_2018, place={New York, NY, USA},
    series={GECCO’18}, title={Parameterization of State-of-the-Art Performance Indicators:
    A Robustness Study Based on Inexact TSP Solvers}, DOI={<a href="https://doi.org/10.1145/3205651.3208233">10.1145/3205651.3208233</a>},
    booktitle={Proceedings of the Genetic and Evolutionary Computation Conference
    Companion}, publisher={Association for Computing Machinery}, author={Kerschke,
    Pascal and Bossek, Jakob and Trautmann, Heike}, year={2018}, pages={1737–1744},
    collection={GECCO’18} }'
  chicago: 'Kerschke, Pascal, Jakob Bossek, and Heike Trautmann. “Parameterization
    of State-of-the-Art Performance Indicators: A Robustness Study Based on Inexact
    TSP Solvers.” In <i>Proceedings of the Genetic and Evolutionary Computation Conference
    Companion</i>, 1737–1744. GECCO’18. New York, NY, USA: Association for Computing
    Machinery, 2018. <a href="https://doi.org/10.1145/3205651.3208233">https://doi.org/10.1145/3205651.3208233</a>.'
  ieee: 'P. Kerschke, J. Bossek, and H. Trautmann, “Parameterization of State-of-the-Art
    Performance Indicators: A Robustness Study Based on Inexact TSP Solvers,” in <i>Proceedings
    of the Genetic and Evolutionary Computation Conference Companion</i>, 2018, pp.
    1737–1744, doi: <a href="https://doi.org/10.1145/3205651.3208233">10.1145/3205651.3208233</a>.'
  mla: 'Kerschke, Pascal, et al. “Parameterization of State-of-the-Art Performance
    Indicators: A Robustness Study Based on Inexact TSP Solvers.” <i>Proceedings of
    the Genetic and Evolutionary Computation Conference Companion</i>, Association
    for Computing Machinery, 2018, pp. 1737–1744, doi:<a href="https://doi.org/10.1145/3205651.3208233">10.1145/3205651.3208233</a>.'
  short: 'P. Kerschke, J. Bossek, H. Trautmann, in: Proceedings of the Genetic and
    Evolutionary Computation Conference Companion, Association for Computing Machinery,
    New York, NY, USA, 2018, pp. 1737–1744.'
date_created: 2023-11-14T15:58:59Z
date_updated: 2023-12-13T10:48:38Z
department:
- _id: '819'
doi: 10.1145/3205651.3208233
extern: '1'
keyword:
- algorithm selection
- optimization
- performance measures
- transportation
- travelling salesperson problem
language:
- iso: eng
page: 1737–1744
place: New York, NY, USA
publication: Proceedings of the Genetic and Evolutionary Computation Conference Companion
publication_identifier:
  isbn:
  - 978-1-4503-5764-7
publisher: Association for Computing Machinery
series_title: GECCO’18
status: public
title: 'Parameterization of State-of-the-Art Performance Indicators: A Robustness
  Study Based on Inexact TSP Solvers'
type: conference
user_id: '102979'
year: '2018'
...
---
_id: '4419'
abstract:
- lang: eng
  text: Research on entrepreneurial learning highlights the importance of experience
    and prior knowledge to entrepreneurial success. However, a conundrum remains and
    we are still seeking answers as to why some novice entrepreneurs learn successfully
    from their experiences and succeed, while some experienced entrepreneurs fail
    with their ventures. In order to advance the discussion about the role of experience
    during entrepreneurial learning, our critical reflection aims to (1) highlight
    some of the shortcomings of experiential learning theory (ELT) and (2) illustrate
    how alternative theoretical perspectives have the potential to advance our conceptual
    understanding of entrepreneurial learning processes. We argue for an explanation
    of entrepreneurial learning as a dynamic and self-regulated process that relies
    on planning, monitoring, and self-reflection.
author:
- first_name: Alexander Paul
  full_name: Fust, Alexander Paul
  last_name: Fust
- first_name: Tobias
  full_name: Jenert, Tobias
  id: '71994'
  last_name: Jenert
  orcid: ' https://orcid.org/0000-0001-9262-5646'
- first_name: Christoph
  full_name: Winkler, Christoph
  last_name: Winkler
citation:
  ama: 'Fust AP, Jenert T, Winkler C. Experiential or Self-Regulated Learning: A Critical
    Reflection of Entrepreneurial Learning Processes. <i>Entrepreneurship Research
    Journal</i>. 2018;8(2):1-11.'
  apa: 'Fust, A. P., Jenert, T., &#38; Winkler, C. (2018). Experiential or Self-Regulated
    Learning: A Critical Reflection of Entrepreneurial Learning Processes. <i>Entrepreneurship
    Research Journal</i>, <i>8</i>(2), 1–11.'
  bibtex: '@article{Fust_Jenert_Winkler_2018, title={Experiential or Self-Regulated
    Learning: A Critical Reflection of Entrepreneurial Learning Processes}, volume={8},
    number={2}, journal={Entrepreneurship Research Journal}, publisher={de @Gruyter},
    author={Fust, Alexander Paul and Jenert, Tobias and Winkler, Christoph}, year={2018},
    pages={1–11} }'
  chicago: 'Fust, Alexander Paul, Tobias Jenert, and Christoph Winkler. “Experiential
    or Self-Regulated Learning: A Critical Reflection of Entrepreneurial Learning
    Processes.” <i>Entrepreneurship Research Journal</i> 8, no. 2 (2018): 1–11.'
  ieee: 'A. P. Fust, T. Jenert, and C. Winkler, “Experiential or Self-Regulated Learning:
    A Critical Reflection of Entrepreneurial Learning Processes,” <i>Entrepreneurship
    Research Journal</i>, vol. 8, no. 2, pp. 1–11, 2018.'
  mla: 'Fust, Alexander Paul, et al. “Experiential or Self-Regulated Learning: A Critical
    Reflection of Entrepreneurial Learning Processes.” <i>Entrepreneurship Research
    Journal</i>, vol. 8, no. 2, de @Gruyter, 2018, pp. 1–11.'
  short: A.P. Fust, T. Jenert, C. Winkler, Entrepreneurship Research Journal 8 (2018)
    1–11.
date_created: 2018-09-18T08:47:00Z
date_updated: 2024-03-21T14:43:08Z
department:
- _id: '208'
- _id: '282'
intvolume: '         8'
issue: '2'
keyword:
- entrepreneurial learning
- experiential learning
- self-regulated learning
language:
- iso: eng
page: 1-11
publication: Entrepreneurship Research Journal
publication_identifier:
  unknown:
  - 2194-6175
publisher: de @Gruyter
quality_controlled: '1'
status: public
title: 'Experiential or Self-Regulated Learning: A Critical Reflection of Entrepreneurial
  Learning Processes'
type: journal_article
user_id: '71994'
volume: 8
year: '2018'
...
---
_id: '9994'
abstract:
- lang: eng
  text: Reliability-adaptive systems allow an adaptation of system behavior based
    on current system reliability. They can extend their lifetime at the cost of lowered
    performance or vice versa. This can be used to adapt failure behavior according
    to a maintenance plan, thus increasing availability while using up system capability
    fully. To facilitate setup, a control algorithm independent of a degradation model
    is desired. A closed loop control technique for reliability based on a health
    index, a measure for system degradation, is introduced. It uses self-optimization
    as means to implement behavior adaptation. This is based on selecting the priorities
    of objectives that the system pursues. Possible working points are computed beforehand
    using model-based multiobjective optimization techniques. The controller selects
    the priorities of objectives and this way balances reliability and performance.
    As exemplary application, an automatically actuated single plate dry clutch is
    introduced. The entire reliability control is setup and lifetime experiments are
    conducted. Results show that the variance of time to failure is reduced greatly,
    making the failure behavior more predictable. At the same time, the desired usable
    lifetime can be extended at the cost of system performance to allow for changed
    maintenance intervals. Together, these possibilities allow for greater system
    usage and better planning of maintenance.
author:
- first_name: Tobias
  full_name: Meyer, Tobias
  last_name: Meyer
citation:
  ama: Meyer T. <i>Optimization-Based Reliability Control of Mechatronic Systems</i>.
    Shaker; 2018.
  apa: Meyer, T. (2018). <i>Optimization-based reliability control of mechatronic
    systems</i>. Shaker.
  bibtex: '@book{Meyer_2018, title={Optimization-based reliability control of mechatronic
    systems}, publisher={Shaker}, author={Meyer, Tobias}, year={2018} }'
  chicago: Meyer, Tobias. <i>Optimization-Based Reliability Control of Mechatronic
    Systems</i>. Shaker, 2018.
  ieee: T. Meyer, <i>Optimization-based reliability control of mechatronic systems</i>.
    Shaker, 2018.
  mla: Meyer, Tobias. <i>Optimization-Based Reliability Control of Mechatronic Systems</i>.
    Shaker, 2018.
  short: T. Meyer, Optimization-Based Reliability Control of Mechatronic Systems,
    Shaker, 2018.
date_created: 2019-05-27T10:21:17Z
date_updated: 2023-09-15T12:26:09Z
department:
- _id: '151'
keyword:
- dependability
- reliability
- behavior adaptation
- self-optimization
- multiobjective optimization
- optimal control
- automotive drivetrain
- clutch system
- reliability-adaptive system
language:
- iso: eng
publisher: Shaker
status: public
title: Optimization-based reliability control of mechatronic systems
type: dissertation
user_id: '210'
year: '2018'
...
