---
_id: '22894'
abstract:
- lang: eng
text: "The first order optimality conditions of optimal control problems (OCPs)
can\r\nbe regarded as boundary value problems for Hamiltonian systems. Variational
or\r\nsymplectic discretisation methods are classically known for their excellent\r\nlong
term behaviour. As boundary value problems are posed on intervals of\r\nfixed,
moderate length, it is not immediately clear whether methods can profit\r\nfrom
structure preservation in this context. When parameters are present,\r\nsolutions
can undergo bifurcations, for instance, two solutions can merge and\r\nannihilate
one another as parameters are varied. We will show that generic\r\nbifurcations
of an OCP are preserved under discretisation when the OCP is\r\neither directly
discretised to a discrete OCP (direct method) or translated\r\ninto a Hamiltonian
boundary value problem using first order necessary\r\nconditions of optimality
which is then solved using a symplectic integrator\r\n(indirect method). Moreover,
certain bifurcations break when a non-symplectic\r\nscheme is used. The general
phenomenon is illustrated on the example of a cut\r\nlocus of an ellipsoid."
author:
- first_name: Christian
full_name: Offen, Christian
id: '85279'
last_name: Offen
orcid: 0000-0002-5940-8057
- first_name: Sina
full_name: Ober-Blöbaum, Sina
id: '16494'
last_name: Ober-Blöbaum
citation:
ama: Offen C, Ober-Blöbaum S. Bifurcation preserving discretisations of optimal
control problems. 2021;54(19):334-339. doi:https://doi.org/10.1016/j.ifacol.2021.11.099
apa: 'Offen, C., & Ober-Blöbaum, S. (2021). Bifurcation preserving discretisations
of optimal control problems: Vol. 54(19) (pp. 334–339). https://doi.org/10.1016/j.ifacol.2021.11.099'
bibtex: '@article{Offen_Ober-Blöbaum_2021, series={IFAC-PapersOnLine}, title={Bifurcation
preserving discretisations of optimal control problems}, volume={54(19)}, DOI={https://doi.org/10.1016/j.ifacol.2021.11.099},
author={Offen, Christian and Ober-Blöbaum, Sina}, year={2021}, pages={334–339},
collection={IFAC-PapersOnLine} }'
chicago: Offen, Christian, and Sina Ober-Blöbaum. “Bifurcation Preserving Discretisations
of Optimal Control Problems.” IFAC-PapersOnLine, 2021. https://doi.org/10.1016/j.ifacol.2021.11.099.
ieee: 'C. Offen and S. Ober-Blöbaum, “Bifurcation preserving discretisations of
optimal control problems,” vol. 54(19). pp. 334–339, 2021, doi: https://doi.org/10.1016/j.ifacol.2021.11.099.'
mla: Offen, Christian, and Sina Ober-Blöbaum. Bifurcation Preserving Discretisations
of Optimal Control Problems. 2021, pp. 334–39, doi:https://doi.org/10.1016/j.ifacol.2021.11.099.
short: C. Offen, S. Ober-Blöbaum, 54(19) (2021) 334–339.
conference:
end_date: 2021-10-13
location: Berlin, Germany
name: 7th IFAC Workshop on Lagrangian and Hamiltonian Methods for Nonlinear Control,
LHMNC 2021
start_date: 2021-10-11
date_created: 2021-07-29T09:38:32Z
date_updated: 2023-11-29T10:19:41Z
ddc:
- '510'
department:
- _id: '636'
doi: https://doi.org/10.1016/j.ifacol.2021.11.099
external_id:
arxiv:
- '2107.13853'
file:
- access_level: open_access
content_type: application/pdf
creator: coffen
date_created: 2021-07-29T09:37:49Z
date_updated: 2021-07-29T09:37:49Z
file_id: '22895'
file_name: ifacconf.pdf
file_size: 3125220
relation: main_file
file_date_updated: 2021-07-29T09:37:49Z
has_accepted_license: '1'
keyword:
- optimal control
- catastrophe theory
- bifurcations
- variational methods
- symplectic integrators
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.sciencedirect.com/science/article/pii/S2405896321021236
oa: '1'
page: 334-339
publication_identifier:
issn:
- 2405-8963
publication_status: published
quality_controlled: '1'
related_material:
link:
- description: GitHub/Zenodo
relation: software
url: https://doi.org/10.5281/zenodo.4562664
series_title: IFAC-PapersOnLine
status: public
title: Bifurcation preserving discretisations of optimal control problems
type: conference
user_id: '15694'
volume: 54(19)
year: '2021'
...
---
_id: '21572'
author:
- first_name: Steffen
full_name: Ridderbusch, Steffen
last_name: Ridderbusch
- first_name: Christian
full_name: Offen, Christian
id: '85279'
last_name: Offen
orcid: 0000-0002-5940-8057
- first_name: Sina
full_name: Ober-Blöbaum, Sina
id: '16494'
last_name: Ober-Blöbaum
- first_name: Paul
full_name: Goulart, Paul
last_name: Goulart
citation:
ama: 'Ridderbusch S, Offen C, Ober-Blöbaum S, Goulart P. Learning ODE Models with
Qualitative Structure Using Gaussian Processes . In: 2021 60th IEEE Conference
on Decision and Control (CDC). IEEE; 2021:2896. doi:10.1109/CDC45484.2021.9683426'
apa: Ridderbusch, S., Offen, C., Ober-Blöbaum, S., & Goulart, P. (2021). Learning
ODE Models with Qualitative Structure Using Gaussian Processes . 2021 60th
IEEE Conference on Decision and Control (CDC), 2896. https://doi.org/10.1109/CDC45484.2021.9683426
bibtex: '@inproceedings{Ridderbusch_Offen_Ober-Blöbaum_Goulart_2021, title={Learning
ODE Models with Qualitative Structure Using Gaussian Processes }, DOI={10.1109/CDC45484.2021.9683426},
booktitle={2021 60th IEEE Conference on Decision and Control (CDC)}, publisher={IEEE},
author={Ridderbusch, Steffen and Offen, Christian and Ober-Blöbaum, Sina and Goulart,
Paul}, year={2021}, pages={2896} }'
chicago: Ridderbusch, Steffen, Christian Offen, Sina Ober-Blöbaum, and Paul Goulart.
“Learning ODE Models with Qualitative Structure Using Gaussian Processes .” In
2021 60th IEEE Conference on Decision and Control (CDC), 2896. IEEE, 2021.
https://doi.org/10.1109/CDC45484.2021.9683426.
ieee: 'S. Ridderbusch, C. Offen, S. Ober-Blöbaum, and P. Goulart, “Learning ODE
Models with Qualitative Structure Using Gaussian Processes ,” in 2021 60th
IEEE Conference on Decision and Control (CDC), Austin, TX, USA, 2021, p. 2896,
doi: 10.1109/CDC45484.2021.9683426.'
mla: Ridderbusch, Steffen, et al. “Learning ODE Models with Qualitative Structure
Using Gaussian Processes .” 2021 60th IEEE Conference on Decision and Control
(CDC), IEEE, 2021, p. 2896, doi:10.1109/CDC45484.2021.9683426.
short: 'S. Ridderbusch, C. Offen, S. Ober-Blöbaum, P. Goulart, in: 2021 60th IEEE
Conference on Decision and Control (CDC), IEEE, 2021, p. 2896.'
conference:
end_date: 2021-12-17
location: Austin, TX, USA
name: 60th IEEE Conference on Decision and Control (CDC)
start_date: 2021-12-14
date_created: 2021-03-30T10:27:44Z
date_updated: 2023-11-29T10:24:55Z
department:
- _id: '636'
doi: 10.1109/CDC45484.2021.9683426
external_id:
arxiv:
- '2011.05364'
language:
- iso: eng
page: '2896'
publication: 2021 60th IEEE Conference on Decision and Control (CDC)
publication_identifier:
eisbn:
- 978-1-6654-3659-5
publication_status: published
publisher: IEEE
related_material:
link:
- description: GitHub
relation: software
url: https://github.com/Crown421/StructureGPs-paper
status: public
title: 'Learning ODE Models with Qualitative Structure Using Gaussian Processes '
type: conference
user_id: '15694'
year: '2021'
...
---
_id: '21592'
abstract:
- lang: eng
text: We propose a reachability approach for infinite and finite horizon multi-objective
optimization problems for low-thrust spacecraft trajectory design. The main advantage
of the proposed method is that the Pareto front can be efficiently constructed
from the zero level set of the solution to a Hamilton-Jacobi-Bellman equation.
We demonstrate the proposed method by applying it to a low-thrust spacecraft trajectory
design problem. By deriving the analytic expression for the Hamiltonian and the
optimal control policy, we are able to efficiently compute the backward reachable
set and reconstruct the optimal trajectories. Furthermore, we show that any reconstructed
trajectory will be guaranteed to be weakly Pareto optimal. The proposed method
can be used as a benchmark for future research of applying reachability analysis
to low-thrust spacecraft trajectory design.
author:
- first_name: Nikolaus
full_name: Vertovec, Nikolaus
id: '87056'
last_name: Vertovec
- first_name: Sina
full_name: Ober-Blöbaum, Sina
id: '16494'
last_name: Ober-Blöbaum
- first_name: Kostas
full_name: Margellos, Kostas
last_name: Margellos
citation:
ama: 'Vertovec N, Ober-Blöbaum S, Margellos K. Multi-objective minimum time optimal
control for low-thrust trajectory design. In: ; :1975-1980.'
apa: Vertovec, N., Ober-Blöbaum, S., & Margellos, K. (n.d.). Multi-objective
minimum time optimal control for low-thrust trajectory design. 1975–1980.
bibtex: '@inproceedings{Vertovec_Ober-Blöbaum_Margellos, title={Multi-objective
minimum time optimal control for low-thrust trajectory design}, author={Vertovec,
Nikolaus and Ober-Blöbaum, Sina and Margellos, Kostas}, pages={1975–1980} }'
chicago: Vertovec, Nikolaus, Sina Ober-Blöbaum, and Kostas Margellos. “Multi-Objective
Minimum Time Optimal Control for Low-Thrust Trajectory Design,” 1975–80, n.d.
ieee: N. Vertovec, S. Ober-Blöbaum, and K. Margellos, “Multi-objective minimum time
optimal control for low-thrust trajectory design,” Rotterdam, the Netherlands,
pp. 1975–1980.
mla: Vertovec, Nikolaus, et al. Multi-Objective Minimum Time Optimal Control
for Low-Thrust Trajectory Design. pp. 1975–80.
short: 'N. Vertovec, S. Ober-Blöbaum, K. Margellos, in: n.d., pp. 1975–1980.'
conference:
end_date: 2021-07-02
location: Rotterdam, the Netherlands
name: 2021 European Control Conference (ECC)
start_date: 2021-06-29
date_created: 2021-04-03T03:00:35Z
date_updated: 2023-11-29T10:26:49Z
department:
- _id: '636'
external_id:
arxiv:
- '2103.08813'
language:
- iso: eng
page: 1975-1980
publication_status: accepted
status: public
title: Multi-objective minimum time optimal control for low-thrust trajectory design
type: conference
user_id: '15694'
year: '2021'
...
---
_id: '29868'
author:
- first_name: F.
full_name: Jiménez, F.
last_name: Jiménez
- first_name: Sina
full_name: Ober-Blöbaum, Sina
id: '16494'
last_name: Ober-Blöbaum
citation:
ama: 'Jiménez F, Ober-Blöbaum S. Fractional Damping Through Restricted Calculus
of Variations. In: Nichtlineare Sci 31. Vol 46. J Nonlinear Sci . ; 2021.'
apa: Jiménez, F., & Ober-Blöbaum, S. (2021). Fractional Damping Through Restricted
Calculus of Variations. Nichtlineare Sci 31, 46.
bibtex: '@inproceedings{Jiménez_Ober-Blöbaum_2021, series={J Nonlinear Sci }, title={Fractional
Damping Through Restricted Calculus of Variations}, volume={46}, booktitle={Nichtlineare
Sci 31}, author={Jiménez, F. and Ober-Blöbaum, Sina}, year={2021}, collection={J
Nonlinear Sci } }'
chicago: Jiménez, F., and Sina Ober-Blöbaum. “Fractional Damping Through Restricted
Calculus of Variations.” In Nichtlineare Sci 31, Vol. 46. J Nonlinear Sci
, 2021.
ieee: F. Jiménez and S. Ober-Blöbaum, “Fractional Damping Through Restricted Calculus
of Variations,” in Nichtlineare Sci 31, 2021, vol. 46.
mla: Jiménez, F., and Sina Ober-Blöbaum. “Fractional Damping Through Restricted
Calculus of Variations.” Nichtlineare Sci 31, vol. 46, 2021.
short: 'F. Jiménez, S. Ober-Blöbaum, in: Nichtlineare Sci 31, 2021.'
date_created: 2022-02-17T07:28:47Z
date_updated: 2023-11-29T10:23:46Z
department:
- _id: '636'
intvolume: ' 46'
language:
- iso: eng
publication: Nichtlineare Sci 31
series_title: 'J Nonlinear Sci '
status: public
title: Fractional Damping Through Restricted Calculus of Variations
type: conference
user_id: '15694'
volume: 46
year: '2021'
...
---
_id: '21272'
author:
- first_name: Patrick
full_name: Ködding, Patrick
id: '45402'
last_name: Ködding
- first_name: Roman
full_name: Dumitrescu, Roman
id: '16190'
last_name: Dumitrescu
citation:
ama: 'Ködding P, Dumitrescu R. Forschungsfelder für Künstliche Intelligenz in der
strategischen Produktplanung. In: Hartmann EA, ed. Digitalisisierung souverän
gestalten. Springer Vieweg; 2021:59-73.'
apa: Ködding, P., & Dumitrescu, R. (2021). Forschungsfelder für Künstliche Intelligenz
in der strategischen Produktplanung. In E. A. Hartmann (Ed.), Digitalisisierung
souverän gestalten (pp. 59–73). Springer Vieweg.
bibtex: '@inproceedings{Ködding_Dumitrescu_2021, place={Berlin, Heidelberg}, title={Forschungsfelder
für Künstliche Intelligenz in der strategischen Produktplanung}, booktitle={Digitalisisierung
souverän gestalten}, publisher={Springer Vieweg}, author={Ködding, Patrick and
Dumitrescu, Roman}, editor={Hartmann, Ernst A.}, year={2021}, pages={59–73} }'
chicago: 'Ködding, Patrick, and Roman Dumitrescu. “Forschungsfelder für Künstliche
Intelligenz in der strategischen Produktplanung.” In Digitalisisierung souverän
gestalten, edited by Ernst A. Hartmann, 59–73. Berlin, Heidelberg: Springer
Vieweg, 2021.'
ieee: P. Ködding and R. Dumitrescu, “Forschungsfelder für Künstliche Intelligenz
in der strategischen Produktplanung,” in Digitalisisierung souverän gestalten,
2021, pp. 59–73.
mla: Ködding, Patrick, and Roman Dumitrescu. “Forschungsfelder für Künstliche Intelligenz
in der strategischen Produktplanung.” Digitalisisierung souverän gestalten,
edited by Ernst A. Hartmann, Springer Vieweg, 2021, pp. 59–73.
short: 'P. Ködding, R. Dumitrescu, in: E.A. Hartmann (Ed.), Digitalisisierung souverän
gestalten, Springer Vieweg, Berlin, Heidelberg, 2021, pp. 59–73.'
date_created: 2021-02-24T13:07:33Z
date_updated: 2023-10-06T12:32:24Z
department:
- _id: '563'
editor:
- first_name: Ernst A.
full_name: Hartmann, Ernst A.
last_name: Hartmann
language:
- iso: ger
page: pp. 59-73
place: Berlin, Heidelberg
publication: Digitalisisierung souverän gestalten
publication_status: published
publisher: Springer Vieweg
status: public
title: Forschungsfelder für Künstliche Intelligenz in der strategischen Produktplanung
type: conference
user_id: '45402'
year: '2021'
...
---
_id: '48286'
author:
- first_name: Ivan
full_name: Habernal, Ivan
id: '101881'
last_name: Habernal
citation:
ama: 'Habernal I. When differential privacy meets NLP: The devil is in the detail.
In: Proceedings of the 2021 Conference on Empirical Methods in Natural Language
Processing. Association for Computational Linguistics; 2021. doi:10.18653/v1/2021.emnlp-main.114'
apa: 'Habernal, I. (2021). When differential privacy meets NLP: The devil is in
the detail. Proceedings of the 2021 Conference on Empirical Methods in Natural
Language Processing. https://doi.org/10.18653/v1/2021.emnlp-main.114'
bibtex: '@inproceedings{Habernal_2021, title={When differential privacy meets NLP:
The devil is in the detail}, DOI={10.18653/v1/2021.emnlp-main.114},
booktitle={Proceedings of the 2021 Conference on Empirical Methods in Natural
Language Processing}, publisher={Association for Computational Linguistics}, author={Habernal,
Ivan}, year={2021} }'
chicago: 'Habernal, Ivan. “When Differential Privacy Meets NLP: The Devil Is in
the Detail.” In Proceedings of the 2021 Conference on Empirical Methods in
Natural Language Processing. Association for Computational Linguistics, 2021.
https://doi.org/10.18653/v1/2021.emnlp-main.114.'
ieee: 'I. Habernal, “When differential privacy meets NLP: The devil is in the detail,”
2021, doi: 10.18653/v1/2021.emnlp-main.114.'
mla: 'Habernal, Ivan. “When Differential Privacy Meets NLP: The Devil Is in the
Detail.” Proceedings of the 2021 Conference on Empirical Methods in Natural
Language Processing, Association for Computational Linguistics, 2021, doi:10.18653/v1/2021.emnlp-main.114.'
short: 'I. Habernal, in: Proceedings of the 2021 Conference on Empirical Methods
in Natural Language Processing, Association for Computational Linguistics, 2021.'
date_created: 2023-10-19T08:21:43Z
date_updated: 2023-10-19T12:04:40Z
department:
- _id: '34'
- _id: '820'
doi: 10.18653/v1/2021.emnlp-main.114
language:
- iso: eng
publication: Proceedings of the 2021 Conference on Empirical Methods in Natural Language
Processing
publication_status: published
publisher: Association for Computational Linguistics
status: public
title: 'When differential privacy meets NLP: The devil is in the detail'
type: conference
user_id: '15504'
year: '2021'
...
---
_id: '29893'
abstract:
- lang: eng
text: Phase-shift modulated full bridge converters suffer from thermal imbalances
of the inverter switches. The lagging leg switches are subject to larger commutation
currents compared to those of the leading leg as the transformer current reduces
in the freewheeling interval. Furthermore, after this interval, the energy in
the series inductance may not be large enough to achieve zero-voltage switching
(ZVS) for the leading leg. Both effects result in thermal imbalances. This paper
analyzes the alternating-asymmetrical phase-shift modulation to achieve balanced
conduction and switching losses for all four switches while showing that this
modulation is easily implemented on standard DSPs. The modulation has been implemented
to LLC converters where experimental measurement results proved its effectiveness
for LLC converters by reducing the temperature deviation from 6.3 K to only 0.2
K such that the peak temperature is reduced from 95 °C to 92 °C. The paper also
proves that the modulation can be utilized to improve the efficiency of LLC converters
operated at very low gains while simultaneously reducing the junction temperature
of all four switches compared to the conventional complementary modulation. Finally,
EMI implications are analyzed, which show that the modulation may be beneficial
for reducing the common-mode emissions around the operating frequency.
author:
- first_name: Philipp
full_name: Rehlaender, Philipp
id: '69469'
last_name: Rehlaender
- first_name: Roland
full_name: Unruh, Roland
id: '34289'
last_name: Unruh
- first_name: Frank
full_name: Schafmeister, Frank
id: '71291'
last_name: Schafmeister
- first_name: Joachim
full_name: Böcker, Joachim
id: '66'
last_name: Böcker
orcid: 0000-0002-8480-7295
citation:
ama: 'Rehlaender P, Unruh R, Schafmeister F, Böcker J. Alternating Asymmetrical
Phase-Shift Modulation for Full-Bridge Converters with Balanced Switching Losses
to Reduce Thermal Imbalances. In: 2021 IEEE Applied Power Electronics Conference
and Exposition (APEC). IEEE; 2021. doi:10.1109/apec42165.2021.9487104'
apa: Rehlaender, P., Unruh, R., Schafmeister, F., & Böcker, J. (2021). Alternating
Asymmetrical Phase-Shift Modulation for Full-Bridge Converters with Balanced Switching
Losses to Reduce Thermal Imbalances. 2021 IEEE Applied Power Electronics Conference
and Exposition (APEC). 2021 IEEE Applied Power Electronics Conference and
Exposition (APEC), Phoenix, AZ, USA. https://doi.org/10.1109/apec42165.2021.9487104
bibtex: '@inproceedings{Rehlaender_Unruh_Schafmeister_Böcker_2021, title={Alternating
Asymmetrical Phase-Shift Modulation for Full-Bridge Converters with Balanced Switching
Losses to Reduce Thermal Imbalances}, DOI={10.1109/apec42165.2021.9487104},
booktitle={2021 IEEE Applied Power Electronics Conference and Exposition (APEC)},
publisher={IEEE}, author={Rehlaender, Philipp and Unruh, Roland and Schafmeister,
Frank and Böcker, Joachim}, year={2021} }'
chicago: Rehlaender, Philipp, Roland Unruh, Frank Schafmeister, and Joachim Böcker.
“Alternating Asymmetrical Phase-Shift Modulation for Full-Bridge Converters with
Balanced Switching Losses to Reduce Thermal Imbalances.” In 2021 IEEE Applied
Power Electronics Conference and Exposition (APEC). IEEE, 2021. https://doi.org/10.1109/apec42165.2021.9487104.
ieee: 'P. Rehlaender, R. Unruh, F. Schafmeister, and J. Böcker, “Alternating Asymmetrical
Phase-Shift Modulation for Full-Bridge Converters with Balanced Switching Losses
to Reduce Thermal Imbalances,” presented at the 2021 IEEE Applied Power Electronics
Conference and Exposition (APEC), Phoenix, AZ, USA, 2021, doi: 10.1109/apec42165.2021.9487104.'
mla: Rehlaender, Philipp, et al. “Alternating Asymmetrical Phase-Shift Modulation
for Full-Bridge Converters with Balanced Switching Losses to Reduce Thermal Imbalances.”
2021 IEEE Applied Power Electronics Conference and Exposition (APEC), IEEE,
2021, doi:10.1109/apec42165.2021.9487104.
short: 'P. Rehlaender, R. Unruh, F. Schafmeister, J. Böcker, in: 2021 IEEE Applied
Power Electronics Conference and Exposition (APEC), IEEE, 2021.'
conference:
end_date: 2021-06-17
location: Phoenix, AZ, USA
name: 2021 IEEE Applied Power Electronics Conference and Exposition (APEC)
start_date: 2021-06-14
date_created: 2022-02-20T21:19:46Z
date_updated: 2023-10-20T11:50:25Z
department:
- _id: '34'
- _id: '52'
doi: 10.1109/apec42165.2021.9487104
keyword:
- Phase-Shifted Full Bridge
- Full-Bridge Converter
- Phase-Shift Control
- Phase-Shift Modulation
- LLC Converter
- Thermal Balancing
language:
- iso: eng
main_file_link:
- url: https://ieeexplore.ieee.org/abstract/document/9487104
publication: 2021 IEEE Applied Power Electronics Conference and Exposition (APEC)
publication_identifier:
isbn:
- 978-1-7281-8950-5
publication_status: published
publisher: IEEE
status: public
title: Alternating Asymmetrical Phase-Shift Modulation for Full-Bridge Converters
with Balanced Switching Losses to Reduce Thermal Imbalances
type: conference
user_id: '34289'
year: '2021'
...
---
_id: '34827'
abstract:
- lang: eng
text: ZusammenfassungZu den ersten geometrischen
Begriffen, die Kinder bereits im Elementar- und Primarbereich lernen, zählen u. a.
Viereck, Rechteck und Quadrat. Studien zeigen, dass Lernende bereits früh individuelle
Vorstellungen, sog. individuelle Begriffskonzepte,
zu diesen Begriffen aufbauen. Zwar wird die Entwicklung von Begriffsverständnis
in verschiedenen mathematikdidaktischen Stufenmodellen dargestellt, diese sind
jedoch generisch und beschreiben nicht explizit die Entwicklung der ersten individuellen
Begriffskonzepte von Lernenden zu Viereck, Rechteck und Quadrat.
Aus empirischer Sicht liegen verschiedene Studien vor, die einzelne Aspekte der
individuellen Begriffskonzepte von Lernenden unterschiedlicher Altersgruppen zu
diesen Begriffen ausleuchten. Um Begriffsbildungsprozesse aus empirischer Sicht
detaillierter entlang der jeweils vorherrschenden individuellen Begriffskonzepte
zu beschreiben, fehlen insbesondere Studien in der Grundschule, die alle vier
Klassenstufen betrachten und dabei differenzierte Erkenntnisse zu verschiedenen
theoretischen Indikatoren des Begriffsverständnisses liefern. Daher geht die vorliegende
Studie der Frage nach, welches Verständnis der Begriffe Viereck, Rechteck und
Quadrat Schülerinnen und Schüler der Jahrgangsstufen 1, 2, 3 und 4 zeigen. Dazu
wurde eine Quasi-Längsschnittstudie mit N = 456 Grundschulkindern
(ca. 100 pro Jahrgangsstufe) durchgeführt. Die Ergebnisse geben detaillierte Einblicke
in die individuellen Begriffskonzepte der Lernenden und zeigen, dass Lernende
zunehmend Eigenschaften der Figuren berücksichtigen, jedoch individuelle Begriffskonzepte
über lange Zeit auch prototypisch geprägt sind. Implikationen dieser Ergebnisse
für Forschung und Praxis werden diskutiert.
author:
- first_name: Julia
full_name: Bruns, Julia
id: '72183'
last_name: Bruns
orcid: https://orcid.org/0000-0002-6604-5864
- first_name: Elisabeth
full_name: Unterhauser, Elisabeth
last_name: Unterhauser
- first_name: Hedwig
full_name: Gasteiger, Hedwig
last_name: Gasteiger
citation:
ama: Bruns J, Unterhauser E, Gasteiger H. Geometrisches Begriffsverständnis in der
Grundschule am Beispiel der Begriffe Viereck, Rechteck und Quadrat. Journal
für Mathematik-Didaktik. 2021;42(2):581-623. doi:10.1007/s13138-021-00185-4
apa: Bruns, J., Unterhauser, E., & Gasteiger, H. (2021). Geometrisches Begriffsverständnis
in der Grundschule am Beispiel der Begriffe Viereck, Rechteck und Quadrat. Journal
für Mathematik-Didaktik, 42(2), 581–623. https://doi.org/10.1007/s13138-021-00185-4
bibtex: '@article{Bruns_Unterhauser_Gasteiger_2021, title={Geometrisches Begriffsverständnis
in der Grundschule am Beispiel der Begriffe Viereck, Rechteck und Quadrat}, volume={42},
DOI={10.1007/s13138-021-00185-4},
number={2}, journal={Journal für Mathematik-Didaktik}, publisher={Springer Science
and Business Media LLC}, author={Bruns, Julia and Unterhauser, Elisabeth and Gasteiger,
Hedwig}, year={2021}, pages={581–623} }'
chicago: 'Bruns, Julia, Elisabeth Unterhauser, and Hedwig Gasteiger. “Geometrisches
Begriffsverständnis in der Grundschule am Beispiel der Begriffe Viereck, Rechteck
und Quadrat.” Journal für Mathematik-Didaktik 42, no. 2 (2021): 581–623.
https://doi.org/10.1007/s13138-021-00185-4.'
ieee: 'J. Bruns, E. Unterhauser, and H. Gasteiger, “Geometrisches Begriffsverständnis
in der Grundschule am Beispiel der Begriffe Viereck, Rechteck und Quadrat,” Journal
für Mathematik-Didaktik, vol. 42, no. 2, pp. 581–623, 2021, doi: 10.1007/s13138-021-00185-4.'
mla: Bruns, Julia, et al. “Geometrisches Begriffsverständnis in der Grundschule
am Beispiel der Begriffe Viereck, Rechteck und Quadrat.” Journal für Mathematik-Didaktik,
vol. 42, no. 2, Springer Science and Business Media LLC, 2021, pp. 581–623, doi:10.1007/s13138-021-00185-4.
short: J. Bruns, E. Unterhauser, H. Gasteiger, Journal für Mathematik-Didaktik 42
(2021) 581–623.
date_created: 2022-12-22T09:26:39Z
date_updated: 2023-10-23T11:14:59Z
department:
- _id: '97'
- _id: '611'
doi: 10.1007/s13138-021-00185-4
intvolume: ' 42'
issue: '2'
keyword:
- Education
- General Mathematics
language:
- iso: ger
page: 581-623
publication: Journal für Mathematik-Didaktik
publication_identifier:
issn:
- 0173-5322
- 1869-2699
publication_status: published
publisher: Springer Science and Business Media LLC
quality_controlled: '1'
status: public
title: Geometrisches Begriffsverständnis in der Grundschule am Beispiel der Begriffe
Viereck, Rechteck und Quadrat
type: journal_article
user_id: '72183'
volume: 42
year: '2021'
...
---
_id: '45382'
author:
- first_name: Susanne
full_name: Prediger, Susanne
last_name: Prediger
- first_name: Jennifer
full_name: Dröse, Jennifer
id: '85820'
last_name: Dröse
citation:
ama: Prediger S, Dröse J. Fehlerbearbeitung bei mathematischen Textaufgaben – Sprachliche
und strategische Fehlerursachen und ihre Bearbeitung. Lernen und Lernstörungen,
10(2). Published online 2021. doi:doi.org/10.1024/2235-0977/a000330
apa: Prediger, S., & Dröse, J. (2021). Fehlerbearbeitung bei mathematischen
Textaufgaben – Sprachliche und strategische Fehlerursachen und ihre Bearbeitung.
Lernen und Lernstörungen, 10(2). https://doi.org/doi.org/10.1024/2235-0977/a000330
bibtex: '@article{Prediger_Dröse_2021, title={Fehlerbearbeitung bei mathematischen
Textaufgaben – Sprachliche und strategische Fehlerursachen und ihre Bearbeitung},
DOI={doi.org/10.1024/2235-0977/a000330},
journal={Lernen und Lernstörungen, 10(2)}, author={Prediger, Susanne and Dröse,
Jennifer}, year={2021} }'
chicago: Prediger, Susanne, and Jennifer Dröse. “Fehlerbearbeitung bei mathematischen
Textaufgaben – Sprachliche und strategische Fehlerursachen und ihre Bearbeitung.”
Lernen und Lernstörungen, 10(2), 2021. https://doi.org/doi.org/10.1024/2235-0977/a000330.
ieee: 'S. Prediger and J. Dröse, “Fehlerbearbeitung bei mathematischen Textaufgaben
– Sprachliche und strategische Fehlerursachen und ihre Bearbeitung,” Lernen
und Lernstörungen, 10(2), 2021, doi: doi.org/10.1024/2235-0977/a000330.'
mla: Prediger, Susanne, and Jennifer Dröse. “Fehlerbearbeitung bei mathematischen
Textaufgaben – Sprachliche und strategische Fehlerursachen und ihre Bearbeitung.”
Lernen und Lernstörungen, 10(2), 2021, doi:doi.org/10.1024/2235-0977/a000330.
short: S. Prediger, J. Dröse, Lernen und Lernstörungen, 10(2) (2021).
date_created: 2023-05-31T07:14:10Z
date_updated: 2023-11-02T08:09:00Z
department:
- _id: '98'
doi: doi.org/10.1024/2235-0977/a000330
language:
- iso: ger
publication: Lernen und Lernstörungen, 10(2)
quality_controlled: '1'
status: public
title: Fehlerbearbeitung bei mathematischen Textaufgaben – Sprachliche und strategische
Fehlerursachen und ihre Bearbeitung
type: journal_article
user_id: '85820'
year: '2021'
...
---
_id: '26770'
abstract:
- lang: eng
text: "Automatic transcription of meetings requires handling of overlapped speech,
which calls for continuous speech separation (CSS) systems. The uPIT criterion
was proposed for utterance-level separation with neural networks and introduces
the constraint that the total number of speakers must not exceed the number of
output channels. When processing meeting-like data in a segment-wise manner, i.e.,
by separating overlapping segments independently and stitching adjacent segments
to continuous output streams, this constraint has to be fulfilled for any segment.
In this contribution, we show that this constraint can be significantly relaxed.
We propose a novel graph-based PIT criterion, which casts the assignment of utterances
to output channels in a graph coloring problem. It only requires that the number
of concurrently active speakers must not exceed the number of output channels.
As a consequence, the system can process an arbitrary number of speakers and arbitrarily
long segments and thus can handle more diverse scenarios.\r\nFurther, the stitching
algorithm for obtaining a consistent output order in neighboring segments is of
less importance and can even be eliminated completely, not the least reducing
the computational effort. Experiments on meeting-style WSJ data show improvements
in recognition performance over using the uPIT criterion. "
author:
- first_name: Thilo
full_name: von Neumann, Thilo
id: '49870'
last_name: von Neumann
orcid: https://orcid.org/0000-0002-7717-8670
- first_name: Keisuke
full_name: Kinoshita, Keisuke
last_name: Kinoshita
- first_name: Christoph
full_name: Boeddeker, Christoph
id: '40767'
last_name: Boeddeker
- first_name: Marc
full_name: Delcroix, Marc
last_name: Delcroix
- first_name: Reinhold
full_name: Haeb-Umbach, Reinhold
id: '242'
last_name: Haeb-Umbach
citation:
ama: 'von Neumann T, Kinoshita K, Boeddeker C, Delcroix M, Haeb-Umbach R. Graph-PIT:
Generalized Permutation Invariant Training for Continuous Separation of Arbitrary
Numbers of Speakers. In: Interspeech 2021. ; 2021. doi:10.21437/interspeech.2021-1177'
apa: 'von Neumann, T., Kinoshita, K., Boeddeker, C., Delcroix, M., & Haeb-Umbach,
R. (2021). Graph-PIT: Generalized Permutation Invariant Training for Continuous
Separation of Arbitrary Numbers of Speakers. Interspeech 2021. Interspeech.
https://doi.org/10.21437/interspeech.2021-1177'
bibtex: '@inproceedings{von Neumann_Kinoshita_Boeddeker_Delcroix_Haeb-Umbach_2021,
title={Graph-PIT: Generalized Permutation Invariant Training for Continuous Separation
of Arbitrary Numbers of Speakers}, DOI={10.21437/interspeech.2021-1177},
booktitle={Interspeech 2021}, author={von Neumann, Thilo and Kinoshita, Keisuke
and Boeddeker, Christoph and Delcroix, Marc and Haeb-Umbach, Reinhold}, year={2021}
}'
chicago: 'Neumann, Thilo von, Keisuke Kinoshita, Christoph Boeddeker, Marc Delcroix,
and Reinhold Haeb-Umbach. “Graph-PIT: Generalized Permutation Invariant Training
for Continuous Separation of Arbitrary Numbers of Speakers.” In Interspeech
2021, 2021. https://doi.org/10.21437/interspeech.2021-1177.'
ieee: 'T. von Neumann, K. Kinoshita, C. Boeddeker, M. Delcroix, and R. Haeb-Umbach,
“Graph-PIT: Generalized Permutation Invariant Training for Continuous Separation
of Arbitrary Numbers of Speakers,” presented at the Interspeech, 2021, doi: 10.21437/interspeech.2021-1177.'
mla: 'von Neumann, Thilo, et al. “Graph-PIT: Generalized Permutation Invariant Training
for Continuous Separation of Arbitrary Numbers of Speakers.” Interspeech 2021,
2021, doi:10.21437/interspeech.2021-1177.'
short: 'T. von Neumann, K. Kinoshita, C. Boeddeker, M. Delcroix, R. Haeb-Umbach,
in: Interspeech 2021, 2021.'
conference:
name: Interspeech
date_created: 2021-10-25T08:50:01Z
date_updated: 2023-11-15T12:14:40Z
ddc:
- '000'
department:
- _id: '54'
doi: 10.21437/interspeech.2021-1177
file:
- access_level: open_access
content_type: video/mp4
creator: tvn
date_created: 2021-12-06T10:39:13Z
date_updated: 2021-12-06T10:48:30Z
file_id: '28327'
file_name: Interspeech 2021 voiceover-002-compressed.mp4
file_size: 9550220
relation: supplementary_material
title: Video for INTERSPEECH 2021
- access_level: open_access
content_type: application/vnd.openxmlformats-officedocument.presentationml.presentation
creator: tvn
date_created: 2021-12-06T10:47:01Z
date_updated: 2021-12-06T10:47:01Z
file_id: '28328'
file_name: Graph-PIT-poster-presentation.pptx
file_size: 1337297
relation: slides
title: Slides from INTERSPEECH 2021
- access_level: open_access
content_type: application/pdf
creator: tvn
date_created: 2021-12-06T10:48:21Z
date_updated: 2021-12-06T10:48:21Z
file_id: '28329'
file_name: INTERSPEECH2021_Graph_PIT.pdf
file_size: 226589
relation: main_file
file_date_updated: 2021-12-06T10:48:30Z
has_accepted_license: '1'
keyword:
- Continuous speech separation
- automatic speech recognition
- overlapped speech
- permutation invariant training
language:
- iso: eng
oa: '1'
project:
- _id: '52'
name: 'PC2: Computing Resources Provided by the Paderborn Center for Parallel Computing'
publication: Interspeech 2021
publication_status: published
quality_controlled: '1'
related_material:
link:
- relation: software
url: https://github.com/fgnt/graph_pit
status: public
title: 'Graph-PIT: Generalized Permutation Invariant Training for Continuous Separation
of Arbitrary Numbers of Speakers'
type: conference
user_id: '49870'
year: '2021'
...
---
_id: '29173'
author:
- first_name: Thilo
full_name: von Neumann, Thilo
id: '49870'
last_name: von Neumann
orcid: https://orcid.org/0000-0002-7717-8670
- first_name: Christoph
full_name: Boeddeker, Christoph
id: '40767'
last_name: Boeddeker
- first_name: Keisuke
full_name: Kinoshita, Keisuke
last_name: Kinoshita
- first_name: Marc
full_name: Delcroix, Marc
last_name: Delcroix
- first_name: Reinhold
full_name: Haeb-Umbach, Reinhold
id: '242'
last_name: Haeb-Umbach
citation:
ama: 'von Neumann T, Boeddeker C, Kinoshita K, Delcroix M, Haeb-Umbach R. Speeding
Up Permutation Invariant Training for Source Separation. In: Speech Communication;
14th ITG Conference. ; 2021.'
apa: von Neumann, T., Boeddeker, C., Kinoshita, K., Delcroix, M., & Haeb-Umbach,
R. (2021). Speeding Up Permutation Invariant Training for Source Separation. Speech
Communication; 14th ITG Conference. Speech Communication; 14th ITG Conference,
Kiel.
bibtex: '@inproceedings{von Neumann_Boeddeker_Kinoshita_Delcroix_Haeb-Umbach_2021,
title={Speeding Up Permutation Invariant Training for Source Separation}, booktitle={Speech
Communication; 14th ITG Conference}, author={von Neumann, Thilo and Boeddeker,
Christoph and Kinoshita, Keisuke and Delcroix, Marc and Haeb-Umbach, Reinhold},
year={2021} }'
chicago: Neumann, Thilo von, Christoph Boeddeker, Keisuke Kinoshita, Marc Delcroix,
and Reinhold Haeb-Umbach. “Speeding Up Permutation Invariant Training for Source
Separation.” In Speech Communication; 14th ITG Conference, 2021.
ieee: T. von Neumann, C. Boeddeker, K. Kinoshita, M. Delcroix, and R. Haeb-Umbach,
“Speeding Up Permutation Invariant Training for Source Separation,” presented
at the Speech Communication; 14th ITG Conference, Kiel, 2021.
mla: von Neumann, Thilo, et al. “Speeding Up Permutation Invariant Training for
Source Separation.” Speech Communication; 14th ITG Conference, 2021.
short: 'T. von Neumann, C. Boeddeker, K. Kinoshita, M. Delcroix, R. Haeb-Umbach,
in: Speech Communication; 14th ITG Conference, 2021.'
conference:
end_date: 2021-10-01
location: Kiel
name: Speech Communication; 14th ITG Conference
start_date: 2021-09-29
date_created: 2022-01-07T10:40:56Z
date_updated: 2023-11-15T12:16:31Z
ddc:
- '000'
department:
- _id: '54'
file:
- access_level: open_access
content_type: application/pdf
creator: tvn
date_created: 2022-01-06T13:23:27Z
date_updated: 2022-01-06T13:23:27Z
file_id: '29180'
file_name: poster.pdf
file_size: 191938
relation: poster
- access_level: open_access
content_type: application/pdf
creator: tvn
date_created: 2022-01-07T10:42:54Z
date_updated: 2022-01-07T10:42:54Z
file_id: '29181'
file_name: ITG2021_Speeding_up_Permutation_Invariant_Training.pdf
file_size: 236670
relation: main_file
file_date_updated: 2022-01-07T10:42:54Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
project:
- _id: '52'
name: 'PC2: Computing Resources Provided by the Paderborn Center for Parallel Computing'
publication: Speech Communication; 14th ITG Conference
quality_controlled: '1'
status: public
title: Speeding Up Permutation Invariant Training for Source Separation
type: conference
user_id: '49870'
year: '2021'
...
---
_id: '29308'
abstract:
- lang: eng
text: 'In this paper we present our system for the Detection and Classification
of Acoustic Scenes and Events (DCASE) 2021 Challenge Task 4: Sound Event Detection
and Separation in Domestic Environments, where it scored the fourth rank. Our
presented solution is an advancement of our system used in the previous edition
of the task.We use a forward-backward convolutional recurrent neural network (FBCRNN)
for tagging and pseudo labeling followed by tag-conditioned sound event detection
(SED) models which are trained using strong pseudo labels provided by the FBCRNN.
Our advancement over our earlier model is threefold. First, we introduce a strong
label loss in the objective of the FBCRNN to take advantage of the strongly labeled
synthetic data during training. Second, we perform multiple iterations of self-training
for both the FBCRNN and tag-conditioned SED models. Third, while we used only
tag-conditioned CNNs as our SED model in the previous edition we here explore
sophisticated tag-conditioned SED model architectures, namely, bidirectional CRNNs
and bidirectional convolutional transformer neural networks (CTNNs), and combine
them. With metric and class specific tuning of median filter lengths for post-processing,
our final SED model, consisting of 6 submodels (2 of each architecture), achieves
on the public evaluation set poly-phonic sound event detection scores (PSDS) of
0.455 for scenario 1 and 0.684 for scenario as well as a collar-based F1-score
of 0.596 outperforming the baselines and our model from the previous edition by
far. Source code is publicly available at https://github.com/fgnt/pb_sed.'
author:
- first_name: Janek
full_name: Ebbers, Janek
id: '34851'
last_name: Ebbers
- first_name: Reinhold
full_name: Haeb-Umbach, Reinhold
id: '242'
last_name: Haeb-Umbach
citation:
ama: 'Ebbers J, Haeb-Umbach R. Self-Trained Audio Tagging and Sound Event Detection
in Domestic Environments. In: Proceedings of the 6th Detection and Classification
of Acoustic Scenes and Events 2021 Workshop (DCASE2021). ; 2021:226–230.'
apa: Ebbers, J., & Haeb-Umbach, R. (2021). Self-Trained Audio Tagging and Sound
Event Detection in Domestic Environments. Proceedings of the 6th Detection
and Classification of Acoustic Scenes and Events 2021 Workshop (DCASE2021),
226–230.
bibtex: '@inproceedings{Ebbers_Haeb-Umbach_2021, place={Barcelona, Spain}, title={Self-Trained
Audio Tagging and Sound Event Detection in Domestic Environments}, booktitle={Proceedings
of the 6th Detection and Classification of Acoustic Scenes and Events 2021 Workshop
(DCASE2021)}, author={Ebbers, Janek and Haeb-Umbach, Reinhold}, year={2021}, pages={226–230}
}'
chicago: Ebbers, Janek, and Reinhold Haeb-Umbach. “Self-Trained Audio Tagging and
Sound Event Detection in Domestic Environments.” In Proceedings of the 6th
Detection and Classification of Acoustic Scenes and Events 2021 Workshop (DCASE2021),
226–230. Barcelona, Spain, 2021.
ieee: J. Ebbers and R. Haeb-Umbach, “Self-Trained Audio Tagging and Sound Event
Detection in Domestic Environments,” in Proceedings of the 6th Detection and
Classification of Acoustic Scenes and Events 2021 Workshop (DCASE2021), 2021,
pp. 226–230.
mla: Ebbers, Janek, and Reinhold Haeb-Umbach. “Self-Trained Audio Tagging and Sound
Event Detection in Domestic Environments.” Proceedings of the 6th Detection
and Classification of Acoustic Scenes and Events 2021 Workshop (DCASE2021),
2021, pp. 226–230.
short: 'J. Ebbers, R. Haeb-Umbach, in: Proceedings of the 6th Detection and Classification
of Acoustic Scenes and Events 2021 Workshop (DCASE2021), Barcelona, Spain, 2021,
pp. 226–230.'
date_created: 2022-01-13T08:07:47Z
date_updated: 2023-11-22T08:28:32Z
ddc:
- '000'
department:
- _id: '54'
file:
- access_level: open_access
content_type: application/pdf
creator: ebbers
date_created: 2022-01-13T08:08:54Z
date_updated: 2022-01-13T08:19:50Z
file_id: '29309'
file_name: template.pdf
file_size: 239462
relation: main_file
file_date_updated: 2022-01-13T08:19:50Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 226–230
place: Barcelona, Spain
project:
- _id: '52'
name: 'PC2: Computing Resources Provided by the Paderborn Center for Parallel Computing'
publication: Proceedings of the 6th Detection and Classification of Acoustic Scenes
and Events 2021 Workshop (DCASE2021)
publication_identifier:
isbn:
- 978-84-09-36072-7
quality_controlled: '1'
status: public
title: Self-Trained Audio Tagging and Sound Event Detection in Domestic Environments
type: conference
user_id: '34851'
year: '2021'
...
---
_id: '29306'
abstract:
- lang: eng
text: Recently, there has been a rising interest in sound recognition via Acoustic
Sensor Networks to support applications such as ambient assisted living or environmental
habitat monitoring. With state-of-the-art sound recognition being dominated by
deep-learning-based approaches, there is a high demand for labeled training data.
Despite the availability of large-scale data sets such as Google's AudioSet,
acquiring training data matching a certain application environment is still often
a problem. In this paper we are concerned with human activity monitoring in a
domestic environment using an ASN consisting of multiple nodes each providing
multichannel signals. We propose a self-training based domain adaptation approach,
which only requires unlabeled data from the target environment. Here, a sound
recognition system trained on AudioSet, the teacher, generates pseudo labels for
data from the target environment on which a student network is trained. The student
can furthermore glean information about the spatial arrangement of sensors and
sound sources to further improve classification performance. It is shown that the
student significantly improves recognition performance over the pre-trained teacher
without relying on labeled data from the environment the system is deployed in.
author:
- first_name: Janek
full_name: Ebbers, Janek
id: '34851'
last_name: Ebbers
- first_name: Moritz Curt
full_name: Keyser, Moritz Curt
last_name: Keyser
- first_name: Reinhold
full_name: Haeb-Umbach, Reinhold
id: '242'
last_name: Haeb-Umbach
citation:
ama: 'Ebbers J, Keyser MC, Haeb-Umbach R. Adapting Sound Recognition to A New Environment
Via Self-Training. In: Proceedings of the 29th European Signal Processing Conference
(EUSIPCO). ; 2021:1135–1139.'
apa: Ebbers, J., Keyser, M. C., & Haeb-Umbach, R. (2021). Adapting Sound Recognition
to A New Environment Via Self-Training. Proceedings of the 29th European Signal
Processing Conference (EUSIPCO), 1135–1139.
bibtex: '@inproceedings{Ebbers_Keyser_Haeb-Umbach_2021, title={Adapting Sound Recognition
to A New Environment Via Self-Training}, booktitle={Proceedings of the 29th European
Signal Processing Conference (EUSIPCO)}, author={Ebbers, Janek and Keyser, Moritz
Curt and Haeb-Umbach, Reinhold}, year={2021}, pages={1135–1139} }'
chicago: Ebbers, Janek, Moritz Curt Keyser, and Reinhold Haeb-Umbach. “Adapting
Sound Recognition to A New Environment Via Self-Training.” In Proceedings of
the 29th European Signal Processing Conference (EUSIPCO), 1135–1139, 2021.
ieee: J. Ebbers, M. C. Keyser, and R. Haeb-Umbach, “Adapting Sound Recognition to
A New Environment Via Self-Training,” in Proceedings of the 29th European Signal
Processing Conference (EUSIPCO), 2021, pp. 1135–1139.
mla: Ebbers, Janek, et al. “Adapting Sound Recognition to A New Environment Via
Self-Training.” Proceedings of the 29th European Signal Processing Conference
(EUSIPCO), 2021, pp. 1135–1139.
short: 'J. Ebbers, M.C. Keyser, R. Haeb-Umbach, in: Proceedings of the 29th European
Signal Processing Conference (EUSIPCO), 2021, pp. 1135–1139.'
date_created: 2022-01-13T08:01:21Z
date_updated: 2023-11-22T08:28:50Z
ddc:
- '000'
department:
- _id: '54'
file:
- access_level: open_access
content_type: application/pdf
creator: ebbers
date_created: 2022-01-13T08:03:26Z
date_updated: 2022-01-13T08:19:35Z
file_id: '29307'
file_name: conference_101719.pdf
file_size: 213938
relation: main_file
file_date_updated: 2022-01-13T08:19:35Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 1135–1139
project:
- _id: '52'
name: 'PC2: Computing Resources Provided by the Paderborn Center for Parallel Computing'
publication: Proceedings of the 29th European Signal Processing Conference (EUSIPCO)
quality_controlled: '1'
status: public
title: Adapting Sound Recognition to A New Environment Via Self-Training
type: conference
user_id: '34851'
year: '2021'
...
---
_id: '24456'
abstract:
- lang: eng
text: One objective of current research in explainable intelligent systems is to
implement social aspects in order to increase the relevance of explanations. In
this paper, we argue that a novel conceptual framework is needed to overcome shortcomings
of existing AI systems with little attention to processes of interaction and learning.
Drawing from research in interaction and development, we first outline the novel
conceptual framework that pushes the design of AI systems toward true interactivity
with an emphasis on the role of the partner and social relevance. We propose that
AI systems will be able to provide a meaningful and relevant explanation only
if the process of explaining is extended to active contribution of both partners
that brings about dynamics that is modulated by different levels of analysis.
Accordingly, our conceptual framework comprises monitoring and scaffolding as
key concepts and claims that the process of explaining is not only modulated by
the interaction between explainee and explainer but is embedded into a larger
social context in which conventionalized and routinized behaviors are established.
We discuss our conceptual framework in relation to the established objectives
of transparency and autonomy that are raised for the design of explainable AI
systems currently.
article_type: original
author:
- first_name: Katharina J.
full_name: Rohlfing, Katharina J.
id: '50352'
last_name: Rohlfing
- first_name: Philipp
full_name: Cimiano, Philipp
last_name: Cimiano
- first_name: Ingrid
full_name: Scharlau, Ingrid
id: '451'
last_name: Scharlau
orcid: 0000-0003-2364-9489
- first_name: Tobias
full_name: Matzner, Tobias
id: '65695'
last_name: Matzner
- first_name: Heike M.
full_name: Buhl, Heike M.
id: '27152'
last_name: Buhl
- first_name: Hendrik
full_name: Buschmeier, Hendrik
last_name: Buschmeier
- first_name: Elena
full_name: Esposito, Elena
last_name: Esposito
- first_name: Angela
full_name: Grimminger, Angela
id: '57578'
last_name: Grimminger
- first_name: Barbara
full_name: Hammer, Barbara
last_name: Hammer
- first_name: Reinhold
full_name: Haeb-Umbach, Reinhold
id: '242'
last_name: Haeb-Umbach
- first_name: Ilona
full_name: Horwath, Ilona
id: '68836'
last_name: Horwath
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
- first_name: Friederike
full_name: Kern, Friederike
last_name: Kern
- first_name: Stefan
full_name: Kopp, Stefan
last_name: Kopp
- first_name: Kirsten
full_name: Thommes, Kirsten
id: '72497'
last_name: Thommes
- first_name: Axel-Cyrille
full_name: Ngonga Ngomo, Axel-Cyrille
id: '65716'
last_name: Ngonga Ngomo
- first_name: Carsten
full_name: Schulte, Carsten
id: '60311'
last_name: Schulte
- first_name: Henning
full_name: Wachsmuth, Henning
id: '3900'
last_name: Wachsmuth
- first_name: Petra
full_name: Wagner, Petra
last_name: Wagner
- first_name: Britta
full_name: Wrede, Britta
last_name: Wrede
citation:
ama: 'Rohlfing KJ, Cimiano P, Scharlau I, et al. Explanation as a Social Practice:
Toward a Conceptual Framework for the Social Design of AI Systems. IEEE Transactions
on Cognitive and Developmental Systems. 2021;13(3):717-728. doi:10.1109/tcds.2020.3044366'
apa: 'Rohlfing, K. J., Cimiano, P., Scharlau, I., Matzner, T., Buhl, H. M., Buschmeier,
H., Esposito, E., Grimminger, A., Hammer, B., Haeb-Umbach, R., Horwath, I., Hüllermeier,
E., Kern, F., Kopp, S., Thommes, K., Ngonga Ngomo, A.-C., Schulte, C., Wachsmuth,
H., Wagner, P., & Wrede, B. (2021). Explanation as a Social Practice: Toward
a Conceptual Framework for the Social Design of AI Systems. IEEE Transactions
on Cognitive and Developmental Systems, 13(3), 717–728. https://doi.org/10.1109/tcds.2020.3044366'
bibtex: '@article{Rohlfing_Cimiano_Scharlau_Matzner_Buhl_Buschmeier_Esposito_Grimminger_Hammer_Haeb-Umbach_et
al._2021, title={Explanation as a Social Practice: Toward a Conceptual Framework
for the Social Design of AI Systems}, volume={13}, DOI={10.1109/tcds.2020.3044366},
number={3}, journal={IEEE Transactions on Cognitive and Developmental Systems},
author={Rohlfing, Katharina J. and Cimiano, Philipp and Scharlau, Ingrid and Matzner,
Tobias and Buhl, Heike M. and Buschmeier, Hendrik and Esposito, Elena and Grimminger,
Angela and Hammer, Barbara and Haeb-Umbach, Reinhold and et al.}, year={2021},
pages={717–728} }'
chicago: 'Rohlfing, Katharina J., Philipp Cimiano, Ingrid Scharlau, Tobias Matzner,
Heike M. Buhl, Hendrik Buschmeier, Elena Esposito, et al. “Explanation as a Social
Practice: Toward a Conceptual Framework for the Social Design of AI Systems.”
IEEE Transactions on Cognitive and Developmental Systems 13, no. 3 (2021):
717–28. https://doi.org/10.1109/tcds.2020.3044366.'
ieee: 'K. J. Rohlfing et al., “Explanation as a Social Practice: Toward a
Conceptual Framework for the Social Design of AI Systems,” IEEE Transactions
on Cognitive and Developmental Systems, vol. 13, no. 3, pp. 717–728, 2021,
doi: 10.1109/tcds.2020.3044366.'
mla: 'Rohlfing, Katharina J., et al. “Explanation as a Social Practice: Toward a
Conceptual Framework for the Social Design of AI Systems.” IEEE Transactions
on Cognitive and Developmental Systems, vol. 13, no. 3, 2021, pp. 717–28,
doi:10.1109/tcds.2020.3044366.'
short: K.J. Rohlfing, P. Cimiano, I. Scharlau, T. Matzner, H.M. Buhl, H. Buschmeier,
E. Esposito, A. Grimminger, B. Hammer, R. Haeb-Umbach, I. Horwath, E. Hüllermeier,
F. Kern, S. Kopp, K. Thommes, A.-C. Ngonga Ngomo, C. Schulte, H. Wachsmuth, P.
Wagner, B. Wrede, IEEE Transactions on Cognitive and Developmental Systems 13
(2021) 717–728.
date_created: 2021-09-14T20:52:57Z
date_updated: 2023-12-05T10:15:02Z
ddc:
- '300'
department:
- _id: '603'
- _id: '749'
- _id: '424'
- _id: '67'
- _id: '574'
- _id: '184'
- _id: '757'
- _id: '54'
- _id: '178'
doi: 10.1109/tcds.2020.3044366
file:
- access_level: open_access
content_type: application/pdf
creator: haebumb
date_created: 2023-11-20T16:33:51Z
date_updated: 2023-11-20T16:33:51Z
file_id: '49081'
file_name: 2020-12-01_explainability_final_version.pdf
file_size: 626217
relation: main_file
file_date_updated: 2023-11-20T16:33:51Z
has_accepted_license: '1'
intvolume: ' 13'
issue: '3'
keyword:
- Explainability
- process ofexplaining andunderstanding
- explainable artificial systems
language:
- iso: eng
oa: '1'
page: 717-728
project:
- _id: '109'
grant_number: '438445824'
name: 'TRR 318: TRR 318 - Erklärbarkeit konstruieren'
publication: IEEE Transactions on Cognitive and Developmental Systems
publication_identifier:
issn:
- 2379-8920
- 2379-8939
publication_status: published
quality_controlled: '1'
status: public
title: 'Explanation as a Social Practice: Toward a Conceptual Framework for the Social
Design of AI Systems'
type: journal_article
user_id: '42933'
volume: 13
year: '2021'
...
---
_id: '48853'
abstract:
- lang: eng
text: In practise, it is often desirable to provide the decision-maker with a rich
set of diverse solutions of decent quality instead of just a single solution.
In this paper we study evolutionary diversity optimization for the knapsack problem
(KP). Our goal is to evolve a population of solutions that all have a profit of
at least (1 - {$ϵ$}) {$\cdot$} OPT, where OPT is the value of an optimal solution.
Furthermore, they should differ in structure with respect to an entropy-based
diversity measure. To this end we propose a simple ({$\mu$} + 1)-EA with initial
approximate solutions calculated by a well-known FPTAS for the KP. We investigate
the effect of different standard mutation operators and introduce biased mutation
and crossover which puts strong probability on flipping bits of low and/or high
frequency within the population. An experimental study on different instances
and settings shows that the proposed mutation operators in most cases perform
slightly inferior in the long term, but show strong benefits if the number of
function evaluations is severely limited.
author:
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Aneta
full_name: Neumann, Aneta
last_name: Neumann
- first_name: Frank
full_name: Neumann, Frank
last_name: Neumann
citation:
ama: 'Bossek J, Neumann A, Neumann F. Breeding Diverse Packings for the Knapsack
Problem by Means of Diversity-Tailored Evolutionary Algorithms. In: Proceedings
of the Genetic and Evolutionary Computation Conference. GECCO ’21. Association
for Computing Machinery; 2021:556–564. doi:10.1145/3449639.3459364'
apa: Bossek, J., Neumann, A., & Neumann, F. (2021). Breeding Diverse Packings
for the Knapsack Problem by Means of Diversity-Tailored Evolutionary Algorithms.
Proceedings of the Genetic and Evolutionary Computation Conference, 556–564.
https://doi.org/10.1145/3449639.3459364
bibtex: '@inproceedings{Bossek_Neumann_Neumann_2021, place={New York, NY, USA},
series={GECCO ’21}, title={Breeding Diverse Packings for the Knapsack Problem
by Means of Diversity-Tailored Evolutionary Algorithms}, DOI={10.1145/3449639.3459364},
booktitle={Proceedings of the Genetic and Evolutionary Computation Conference},
publisher={Association for Computing Machinery}, author={Bossek, Jakob and Neumann,
Aneta and Neumann, Frank}, year={2021}, pages={556–564}, collection={GECCO ’21}
}'
chicago: 'Bossek, Jakob, Aneta Neumann, and Frank Neumann. “Breeding Diverse Packings
for the Knapsack Problem by Means of Diversity-Tailored Evolutionary Algorithms.”
In Proceedings of the Genetic and Evolutionary Computation Conference,
556–564. GECCO ’21. New York, NY, USA: Association for Computing Machinery, 2021.
https://doi.org/10.1145/3449639.3459364.'
ieee: 'J. Bossek, A. Neumann, and F. Neumann, “Breeding Diverse Packings for the
Knapsack Problem by Means of Diversity-Tailored Evolutionary Algorithms,” in Proceedings
of the Genetic and Evolutionary Computation Conference, 2021, pp. 556–564,
doi: 10.1145/3449639.3459364.'
mla: Bossek, Jakob, et al. “Breeding Diverse Packings for the Knapsack Problem by
Means of Diversity-Tailored Evolutionary Algorithms.” Proceedings of the Genetic
and Evolutionary Computation Conference, Association for Computing Machinery,
2021, pp. 556–564, doi:10.1145/3449639.3459364.
short: 'J. Bossek, A. Neumann, F. Neumann, in: Proceedings of the Genetic and Evolutionary
Computation Conference, Association for Computing Machinery, New York, NY, USA,
2021, pp. 556–564.'
date_created: 2023-11-14T15:58:54Z
date_updated: 2023-12-13T10:45:22Z
department:
- _id: '819'
doi: 10.1145/3449639.3459364
extern: '1'
keyword:
- evolutionary algorithms
- evolutionary diversity optimization
- knapsack problem
- tailored operators
language:
- iso: eng
page: 556–564
place: New York, NY, USA
publication: Proceedings of the Genetic and Evolutionary Computation Conference
publication_identifier:
isbn:
- 978-1-4503-8350-9
publication_status: published
publisher: Association for Computing Machinery
series_title: GECCO ’21
status: public
title: Breeding Diverse Packings for the Knapsack Problem by Means of Diversity-Tailored
Evolutionary Algorithms
type: conference
user_id: '102979'
year: '2021'
...
---
_id: '48855'
abstract:
- lang: eng
text: Computing sets of high quality solutions has gained increasing interest in
recent years. In this paper, we investigate how to obtain sets of optimal solutions
for the classical knapsack problem. We present an algorithm to count exactly the
number of optima to a zero-one knapsack problem instance. In addition, we show
how to efficiently sample uniformly at random from the set of all global optima.
In our experimental study, we investigate how the number of optima develops for
classical random benchmark instances dependent on their generator parameters.
We find that the number of global optima can increase exponentially for practically
relevant classes of instances with correlated weights and profits which poses
a justification for the considered exact counting problem.
author:
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Aneta
full_name: Neumann, Aneta
last_name: Neumann
- first_name: Frank
full_name: Neumann, Frank
last_name: Neumann
citation:
ama: 'Bossek J, Neumann A, Neumann F. Exact Counting and~Sampling of Optima for
the Knapsack Problem. In: Learning and Intelligent Optimization. Springer-Verlag;
2021:40–54. doi:10.1007/978-3-030-92121-7_4'
apa: Bossek, J., Neumann, A., & Neumann, F. (2021). Exact Counting and~Sampling
of Optima for the Knapsack Problem. Learning and Intelligent Optimization,
40–54. https://doi.org/10.1007/978-3-030-92121-7_4
bibtex: '@inproceedings{Bossek_Neumann_Neumann_2021, place={Berlin, Heidelberg},
title={Exact Counting and~Sampling of Optima for the Knapsack Problem}, DOI={10.1007/978-3-030-92121-7_4},
booktitle={Learning and Intelligent Optimization}, publisher={Springer-Verlag},
author={Bossek, Jakob and Neumann, Aneta and Neumann, Frank}, year={2021}, pages={40–54}
}'
chicago: 'Bossek, Jakob, Aneta Neumann, and Frank Neumann. “Exact Counting And~Sampling
of Optima for the Knapsack Problem.” In Learning and Intelligent Optimization,
40–54. Berlin, Heidelberg: Springer-Verlag, 2021. https://doi.org/10.1007/978-3-030-92121-7_4.'
ieee: 'J. Bossek, A. Neumann, and F. Neumann, “Exact Counting and~Sampling of Optima
for the Knapsack Problem,” in Learning and Intelligent Optimization, 2021,
pp. 40–54, doi: 10.1007/978-3-030-92121-7_4.'
mla: Bossek, Jakob, et al. “Exact Counting And~Sampling of Optima for the Knapsack
Problem.” Learning and Intelligent Optimization, Springer-Verlag, 2021,
pp. 40–54, doi:10.1007/978-3-030-92121-7_4.
short: 'J. Bossek, A. Neumann, F. Neumann, in: Learning and Intelligent Optimization,
Springer-Verlag, Berlin, Heidelberg, 2021, pp. 40–54.'
date_created: 2023-11-14T15:58:54Z
date_updated: 2023-12-13T10:45:14Z
department:
- _id: '819'
doi: 10.1007/978-3-030-92121-7_4
extern: '1'
keyword:
- Dynamic programming
- Exact counting
- Sampling
- Zero-one knapsack problem
language:
- iso: eng
page: 40–54
place: Berlin, Heidelberg
publication: Learning and Intelligent Optimization
publication_identifier:
isbn:
- 978-3-030-92120-0
publication_status: published
publisher: Springer-Verlag
status: public
title: Exact Counting and~Sampling of Optima for the Knapsack Problem
type: conference
user_id: '102979'
year: '2021'
...
---
_id: '48860'
abstract:
- lang: eng
text: In the area of evolutionary computation the calculation of diverse sets of
high-quality solutions to a given optimization problem has gained momentum in
recent years under the term evolutionary diversity optimization. Theoretical insights
into the working principles of baseline evolutionary algorithms for diversity
optimization are still rare. In this paper we study the well-known Minimum Spanning
Tree problem (MST) in the context of diversity optimization where population diversity
is measured by the sum of pairwise edge overlaps. Theoretical results provide
insights into the fitness landscape of the MST diversity optimization problem
pointing out that even for a population of {$\mu$} = 2 fitness plateaus (of constant
length) can be reached, but nevertheless diverse sets can be calculated in polynomial
time. We supplement our theoretical results with a series of experiments for the
unconstrained and constraint case where all solutions need to fulfill a minimal
quality threshold. Our results show that a simple ({$\mu$} + 1)-EA can effectively
compute a diversified population of spanning trees of high quality.
author:
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Frank
full_name: Neumann, Frank
last_name: Neumann
citation:
ama: 'Bossek J, Neumann F. Evolutionary Diversity Optimization and the Minimum Spanning
Tree Problem. In: Proceedings of the Genetic and Evolutionary Computation Conference.
GECCO ’21. Association for Computing Machinery; 2021:198–206. doi:10.1145/3449639.3459363'
apa: Bossek, J., & Neumann, F. (2021). Evolutionary Diversity Optimization and
the Minimum Spanning Tree Problem. Proceedings of the Genetic and Evolutionary
Computation Conference, 198–206. https://doi.org/10.1145/3449639.3459363
bibtex: '@inproceedings{Bossek_Neumann_2021, place={New York, NY, USA}, series={GECCO
’21}, title={Evolutionary Diversity Optimization and the Minimum Spanning Tree
Problem}, DOI={10.1145/3449639.3459363},
booktitle={Proceedings of the Genetic and Evolutionary Computation Conference},
publisher={Association for Computing Machinery}, author={Bossek, Jakob and Neumann,
Frank}, year={2021}, pages={198–206}, collection={GECCO ’21} }'
chicago: 'Bossek, Jakob, and Frank Neumann. “Evolutionary Diversity Optimization
and the Minimum Spanning Tree Problem.” In Proceedings of the Genetic and Evolutionary
Computation Conference, 198–206. GECCO ’21. New York, NY, USA: Association
for Computing Machinery, 2021. https://doi.org/10.1145/3449639.3459363.'
ieee: 'J. Bossek and F. Neumann, “Evolutionary Diversity Optimization and the Minimum
Spanning Tree Problem,” in Proceedings of the Genetic and Evolutionary Computation
Conference, 2021, pp. 198–206, doi: 10.1145/3449639.3459363.'
mla: Bossek, Jakob, and Frank Neumann. “Evolutionary Diversity Optimization and
the Minimum Spanning Tree Problem.” Proceedings of the Genetic and Evolutionary
Computation Conference, Association for Computing Machinery, 2021, pp. 198–206,
doi:10.1145/3449639.3459363.
short: 'J. Bossek, F. Neumann, in: Proceedings of the Genetic and Evolutionary Computation
Conference, Association for Computing Machinery, New York, NY, USA, 2021, pp.
198–206.'
date_created: 2023-11-14T15:58:55Z
date_updated: 2023-12-13T10:45:37Z
department:
- _id: '819'
doi: 10.1145/3449639.3459363
extern: '1'
keyword:
- evolutionary algorithms
- evolutionary diversity optimization
- minimum spanning tree
- runtime analysis
language:
- iso: eng
page: 198–206
place: New York, NY, USA
publication: Proceedings of the Genetic and Evolutionary Computation Conference
publication_identifier:
isbn:
- 978-1-4503-8350-9
publication_status: published
publisher: Association for Computing Machinery
series_title: GECCO ’21
status: public
title: Evolutionary Diversity Optimization and the Minimum Spanning Tree Problem
type: conference
user_id: '102979'
year: '2021'
...
---
_id: '48862'
abstract:
- lang: eng
text: 'Most runtime analyses of randomised search heuristics focus on the expected
number of function evaluations to find a unique global optimum. We ask a fundamental
question: if additional search points are declared optimal, or declared as desirable
target points, do these additional optima speed up evolutionary algorithms? More
formally, we analyse the expected hitting time of a target set OPT {$\cup$} S
where S is a set of non-optimal search points and OPT is the set of optima and
compare it to the expected hitting time of OPT. We show that the answer to our
question depends on the number and placement of search points in S. For all black-box
algorithms and all fitness functions we show that, if additional optima are placed
randomly, even an exponential number of optima has a negligible effect on the
expected optimisation time. Considering Hamming balls around all global optima
gives an easier target for some algorithms and functions and can shift the phase
transition with respect to offspring population sizes in the (1,{$\lambda$}) EA
on One-Max. Finally, on functions where search trajectories typically join in
a single search point, turning one search point into an optimum drastically reduces
the expected optimisation time.'
author:
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Dirk
full_name: Sudholt, Dirk
last_name: Sudholt
citation:
ama: 'Bossek J, Sudholt D. Do Additional Optima Speed up Evolutionary Algorithms?
In: Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic
Algorithms. Association for Computing Machinery; 2021:1–11.'
apa: Bossek, J., & Sudholt, D. (2021). Do Additional Optima Speed up Evolutionary
Algorithms? In Proceedings of the 16th ACM/SIGEVO Conference on Foundations
of Genetic Algorithms (pp. 1–11). Association for Computing Machinery.
bibtex: '@inbook{Bossek_Sudholt_2021, place={New York, NY, USA}, title={Do Additional
Optima Speed up Evolutionary Algorithms?}, booktitle={Proceedings of the 16th
ACM/SIGEVO Conference on Foundations of Genetic Algorithms}, publisher={Association
for Computing Machinery}, author={Bossek, Jakob and Sudholt, Dirk}, year={2021},
pages={1–11} }'
chicago: 'Bossek, Jakob, and Dirk Sudholt. “Do Additional Optima Speed up Evolutionary
Algorithms?” In Proceedings of the 16th ACM/SIGEVO Conference on Foundations
of Genetic Algorithms, 1–11. New York, NY, USA: Association for Computing
Machinery, 2021.'
ieee: 'J. Bossek and D. Sudholt, “Do Additional Optima Speed up Evolutionary Algorithms?,”
in Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic
Algorithms, New York, NY, USA: Association for Computing Machinery, 2021,
pp. 1–11.'
mla: Bossek, Jakob, and Dirk Sudholt. “Do Additional Optima Speed up Evolutionary
Algorithms?” Proceedings of the 16th ACM/SIGEVO Conference on Foundations of
Genetic Algorithms, Association for Computing Machinery, 2021, pp. 1–11.
short: 'J. Bossek, D. Sudholt, in: Proceedings of the 16th ACM/SIGEVO Conference
on Foundations of Genetic Algorithms, Association for Computing Machinery, New
York, NY, USA, 2021, pp. 1–11.'
date_created: 2023-11-14T15:58:55Z
date_updated: 2023-12-13T10:45:31Z
department:
- _id: '819'
extern: '1'
keyword:
- evolutionary algorithms
- pseudo-boolean functions
- runtime analysis
- theory
language:
- iso: eng
page: 1–11
place: New York, NY, USA
publication: Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic
Algorithms
publication_identifier:
isbn:
- 978-1-4503-8352-3
publication_status: published
publisher: Association for Computing Machinery
status: public
title: Do Additional Optima Speed up Evolutionary Algorithms?
type: book_chapter
user_id: '102979'
year: '2021'
...
---
_id: '48881'
abstract:
- lang: eng
text: 'Classic automated algorithm selection (AS) for (combinatorial) optimization
problems heavily relies on so-called instance features, i.e., numerical characteristics
of the problem at hand ideally extracted with computationally low-demanding routines.
For the traveling salesperson problem (TSP) a plethora of features have been suggested.
Most of these features are, if at all, only normalized imprecisely raising the
issue of feature values being strongly affected by the instance size. Such artifacts
may have detrimental effects on algorithm selection models. We propose a normalization
for two feature groups which stood out in multiple AS studies on the TSP: (a)
features based on a minimum spanning tree (MST) and (b) a k-nearest neighbor graph
(NNG) transformation of the input instance. To this end we theoretically derive
minimum and maximum values for properties of MSTs and k-NNGs of Euclidean graphs.
We analyze the differences in feature space between normalized versions of these
features and their unnormalized counterparts. Our empirical investigations on
various TSP benchmark sets point out that the feature scaling succeeds in eliminating
the effect of the instance size. Eventually, a proof-of-concept AS-study shows
promising results: models trained with normalized features tend to outperform
those trained with the respective vanilla features.'
author:
- first_name: Jonathan
full_name: Heins, Jonathan
last_name: Heins
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Janina
full_name: Pohl, Janina
last_name: Pohl
- first_name: Moritz
full_name: Seiler, Moritz
last_name: Seiler
- first_name: Heike
full_name: Trautmann, Heike
last_name: Trautmann
- first_name: Pascal
full_name: Kerschke, Pascal
last_name: Kerschke
citation:
ama: 'Heins J, Bossek J, Pohl J, Seiler M, Trautmann H, Kerschke P. On the Potential
of Normalized TSP Features for Automated Algorithm Selection. In: Proceedings
of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms. Association
for Computing Machinery; 2021:1–15.'
apa: Heins, J., Bossek, J., Pohl, J., Seiler, M., Trautmann, H., & Kerschke,
P. (2021). On the Potential of Normalized TSP Features for Automated Algorithm
Selection. In Proceedings of the 16th ACM/SIGEVO Conference on Foundations
of Genetic Algorithms (pp. 1–15). Association for Computing Machinery.
bibtex: '@inbook{Heins_Bossek_Pohl_Seiler_Trautmann_Kerschke_2021, place={New York,
NY, USA}, title={On the Potential of Normalized TSP Features for Automated Algorithm
Selection}, booktitle={Proceedings of the 16th ACM/SIGEVO Conference on Foundations
of Genetic Algorithms}, publisher={Association for Computing Machinery}, author={Heins,
Jonathan and Bossek, Jakob and Pohl, Janina and Seiler, Moritz and Trautmann,
Heike and Kerschke, Pascal}, year={2021}, pages={1–15} }'
chicago: 'Heins, Jonathan, Jakob Bossek, Janina Pohl, Moritz Seiler, Heike Trautmann,
and Pascal Kerschke. “On the Potential of Normalized TSP Features for Automated
Algorithm Selection.” In Proceedings of the 16th ACM/SIGEVO Conference on Foundations
of Genetic Algorithms, 1–15. New York, NY, USA: Association for Computing
Machinery, 2021.'
ieee: 'J. Heins, J. Bossek, J. Pohl, M. Seiler, H. Trautmann, and P. Kerschke, “On
the Potential of Normalized TSP Features for Automated Algorithm Selection,” in
Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms,
New York, NY, USA: Association for Computing Machinery, 2021, pp. 1–15.'
mla: Heins, Jonathan, et al. “On the Potential of Normalized TSP Features for Automated
Algorithm Selection.” Proceedings of the 16th ACM/SIGEVO Conference on Foundations
of Genetic Algorithms, Association for Computing Machinery, 2021, pp. 1–15.
short: 'J. Heins, J. Bossek, J. Pohl, M. Seiler, H. Trautmann, P. Kerschke, in:
Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms,
Association for Computing Machinery, New York, NY, USA, 2021, pp. 1–15.'
date_created: 2023-11-14T15:58:58Z
date_updated: 2023-12-13T10:47:23Z
department:
- _id: '819'
extern: '1'
keyword:
- automated algorithm selection
- graph theory
- instance features
- normalization
- traveling salesperson problem (TSP)
language:
- iso: eng
page: 1–15
place: New York, NY, USA
publication: Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic
Algorithms
publication_identifier:
isbn:
- 978-1-4503-8352-3
publisher: Association for Computing Machinery
status: public
title: On the Potential of Normalized TSP Features for Automated Algorithm Selection
type: book_chapter
user_id: '102979'
year: '2021'
...
---
_id: '48876'
abstract:
- lang: eng
text: In recent years, Evolutionary Algorithms (EAs) have frequently been adopted
to evolve instances for optimization problems that pose difficulties for one algorithm
while being rather easy for a competitor and vice versa. Typically, this is achieved
by either minimizing or maximizing the performance difference or ratio which serves
as the fitness function. Repeating this process is useful to gain insights into
strengths/weaknesses of certain algorithms or to build a set of instances with
strong performance differences as a foundation for automatic per-instance algorithm
selection or configuration. We contribute to this branch of research by proposing
fitness-functions to evolve instances that show large performance differences
for more than just two algorithms simultaneously. As a proof-of-principle, we
evolve instances of the multi-component Traveling Thief Problem (TTP) for three
incomplete TTP-solvers. Our results point out that our strategies are promising,
but unsurprisingly their success strongly relies on the algorithms’ performance
complementarity.
author:
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Markus
full_name: Wagner, Markus
last_name: Wagner
citation:
ama: 'Bossek J, Wagner M. Generating Instances with Performance Differences for
More than Just Two Algorithms. In: Proceedings of the Genetic and Evolutionary
Computation Conference Companion. GECCO’21. Association for Computing Machinery;
2021:1423–1432. doi:10.1145/3449726.3463165'
apa: Bossek, J., & Wagner, M. (2021). Generating Instances with Performance
Differences for More than Just Two Algorithms. Proceedings of the Genetic and
Evolutionary Computation Conference Companion, 1423–1432. https://doi.org/10.1145/3449726.3463165
bibtex: '@inproceedings{Bossek_Wagner_2021, place={New York, NY, USA}, series={GECCO’21},
title={Generating Instances with Performance Differences for More than Just Two
Algorithms}, DOI={10.1145/3449726.3463165},
booktitle={Proceedings of the Genetic and Evolutionary Computation Conference
Companion}, publisher={Association for Computing Machinery}, author={Bossek, Jakob
and Wagner, Markus}, year={2021}, pages={1423–1432}, collection={GECCO’21} }'
chicago: 'Bossek, Jakob, and Markus Wagner. “Generating Instances with Performance
Differences for More than Just Two Algorithms.” In Proceedings of the Genetic
and Evolutionary Computation Conference Companion, 1423–1432. GECCO’21. New
York, NY, USA: Association for Computing Machinery, 2021. https://doi.org/10.1145/3449726.3463165.'
ieee: 'J. Bossek and M. Wagner, “Generating Instances with Performance Differences
for More than Just Two Algorithms,” in Proceedings of the Genetic and Evolutionary
Computation Conference Companion, 2021, pp. 1423–1432, doi: 10.1145/3449726.3463165.'
mla: Bossek, Jakob, and Markus Wagner. “Generating Instances with Performance Differences
for More than Just Two Algorithms.” Proceedings of the Genetic and Evolutionary
Computation Conference Companion, Association for Computing Machinery, 2021,
pp. 1423–1432, doi:10.1145/3449726.3463165.
short: 'J. Bossek, M. Wagner, in: Proceedings of the Genetic and Evolutionary Computation
Conference Companion, Association for Computing Machinery, New York, NY, USA,
2021, pp. 1423–1432.'
date_created: 2023-11-14T15:58:57Z
date_updated: 2023-12-13T10:47:41Z
department:
- _id: '819'
doi: 10.1145/3449726.3463165
extern: '1'
keyword:
- evolutionary algorithms
- evolving instances
- fitness function
- instance hardness
- traveling thief problem (TTP)
language:
- iso: eng
page: 1423–1432
place: New York, NY, USA
publication: Proceedings of the Genetic and Evolutionary Computation Conference Companion
publication_identifier:
isbn:
- 978-1-4503-8351-6
publisher: Association for Computing Machinery
series_title: GECCO’21
status: public
title: Generating Instances with Performance Differences for More than Just Two Algorithms
type: conference
user_id: '102979'
year: '2021'
...