---
_id: '6976'
abstract:
- lang: eng
text: "We investigate the maintenance of overlay networks under massive churn, i.e.\r\nnodes
joining and leaving the network. We assume an adversary that may churn a\r\nconstant
fraction $\\alpha n$ of nodes over the course of $\\mathcal{O}(\\log n)$\r\nrounds.
In particular, the adversary has an almost up-to-date information of\r\nthe network
topology as it can observe an only slightly outdated topology that\r\nis at least
$2$ rounds old. Other than that, we only have the provably minimal\r\nrestriction
that new nodes can only join the network via nodes that have taken\r\npart in
the network for at least one round.\r\n Our contributions are as follows: First,
we show that it is impossible to\r\nmaintain a connected topology if adversary
has up-to-date information about the\r\nnodes' connections. Further, we show that
our restriction concerning the join\r\nis also necessary. As our main result present
an algorithm that constructs a\r\nnew overlay- completely independent of all previous
overlays - every $2$\r\nrounds. Furthermore, each node sends and receives only
$\\mathcal{O}(\\log^3 n)$\r\nmessages each round. As part of our solution we propose
the Linearized DeBruijn\r\nSwarm (LDS), a highly churn resistant overlay, which
will be maintained by the\r\nalgorithm. However, our approaches can be transferred
to a variety of classical\r\nP2P Topologies where nodes are mapped into the $[0,1)$-interval."
author:
- first_name: Thorsten
full_name: Götte, Thorsten
id: '34727'
last_name: Götte
- first_name: Vipin Ravindran
full_name: Vijayalakshmi, Vipin Ravindran
last_name: Vijayalakshmi
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Götte T, Vijayalakshmi VR, Scheideler C. Always be Two Steps Ahead of Your
Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-date
Adversary. In: Proceedings of the 2019 IEEE 33rd International Parallel and
Distributed Processing Symposium (IPDPS ’19). IEEE.'
apa: 'Götte, T., Vijayalakshmi, V. R., & Scheideler, C. (n.d.). Always be Two
Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn
with an Almost Up-to-date Adversary. In Proceedings of the 2019 IEEE 33rd International
Parallel and Distributed Processing Symposium (IPDPS ’19). Rio de Janeiro,
Brazil: IEEE.'
bibtex: '@inproceedings{Götte_Vijayalakshmi_Scheideler, title={Always be Two Steps
Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with
an Almost Up-to-date Adversary}, booktitle={Proceedings of the 2019 IEEE 33rd
International Parallel and Distributed Processing Symposium (IPDPS ’19)}, publisher={IEEE},
author={Götte, Thorsten and Vijayalakshmi, Vipin Ravindran and Scheideler, Christian}
}'
chicago: Götte, Thorsten, Vipin Ravindran Vijayalakshmi, and Christian Scheideler.
“Always Be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under
Massive Churn with an Almost Up-to-Date Adversary.” In Proceedings of the 2019
IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS
’19). IEEE, n.d.
ieee: T. Götte, V. R. Vijayalakshmi, and C. Scheideler, “Always be Two Steps Ahead
of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost
Up-to-date Adversary,” in Proceedings of the 2019 IEEE 33rd International Parallel
and Distributed Processing Symposium (IPDPS ’19), Rio de Janeiro, Brazil.
mla: Götte, Thorsten, et al. “Always Be Two Steps Ahead of Your Enemy - Maintaining
a Routable Overlay under Massive Churn with an Almost Up-to-Date Adversary.” Proceedings
of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium
(IPDPS ’19), IEEE.
short: 'T. Götte, V.R. Vijayalakshmi, C. Scheideler, in: Proceedings of the 2019
IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS
’19), IEEE, n.d.'
conference:
end_date: 24.05.19
location: Rio de Janeiro, Brazil
name: 2019 IEEE 33rd International Parallel and Distributed Processing Symposium
(IPDPS '19)
start_date: 20.05.19
date_created: 2019-01-24T18:53:11Z
date_updated: 2022-01-06T07:03:25Z
ddc:
- '000'
department:
- _id: '79'
file:
- access_level: closed
content_type: application/pdf
creator: thgoette
date_created: 2019-01-26T16:09:08Z
date_updated: 2019-01-26T16:09:08Z
file_id: '7007'
file_name: Always_be_Two_Steps_Ahead_of_Your_Enemy.pdf
file_size: 638020
relation: main_file
success: 1
file_date_updated: 2019-01-26T16:09:08Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
publication: Proceedings of the 2019 IEEE 33rd International Parallel and Distributed
Processing Symposium (IPDPS '19)
publication_status: accepted
publisher: IEEE
status: public
title: Always be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under
Massive Churn with an Almost Up-to-date Adversary
type: conference
user_id: '34727'
year: '2019'
...
---
_id: '16709'
author:
- first_name: Tuhin
full_name: Sahai, Tuhin
last_name: Sahai
- first_name: Adrian
full_name: Ziessler, Adrian
last_name: Ziessler
- first_name: Stefan
full_name: Klus, Stefan
last_name: Klus
- first_name: Michael
full_name: Dellnitz, Michael
last_name: Dellnitz
citation:
ama: Sahai T, Ziessler A, Klus S, Dellnitz M. Continuous relaxations for the traveling
salesman problem. Nonlinear Dynamics. 2019. doi:10.1007/s11071-019-05092-5
apa: Sahai, T., Ziessler, A., Klus, S., & Dellnitz, M. (2019). Continuous relaxations
for the traveling salesman problem. Nonlinear Dynamics. https://doi.org/10.1007/s11071-019-05092-5
bibtex: '@article{Sahai_Ziessler_Klus_Dellnitz_2019, title={Continuous relaxations
for the traveling salesman problem}, DOI={10.1007/s11071-019-05092-5},
journal={Nonlinear Dynamics}, author={Sahai, Tuhin and Ziessler, Adrian and Klus,
Stefan and Dellnitz, Michael}, year={2019} }'
chicago: Sahai, Tuhin, Adrian Ziessler, Stefan Klus, and Michael Dellnitz. “Continuous
Relaxations for the Traveling Salesman Problem.” Nonlinear Dynamics, 2019.
https://doi.org/10.1007/s11071-019-05092-5.
ieee: T. Sahai, A. Ziessler, S. Klus, and M. Dellnitz, “Continuous relaxations for
the traveling salesman problem,” Nonlinear Dynamics, 2019.
mla: Sahai, Tuhin, et al. “Continuous Relaxations for the Traveling Salesman Problem.”
Nonlinear Dynamics, 2019, doi:10.1007/s11071-019-05092-5.
short: T. Sahai, A. Ziessler, S. Klus, M. Dellnitz, Nonlinear Dynamics (2019).
date_created: 2020-04-16T14:05:04Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '101'
doi: 10.1007/s11071-019-05092-5
language:
- iso: eng
publication: Nonlinear Dynamics
publication_identifier:
issn:
- 0924-090X
- 1573-269X
publication_status: published
status: public
title: Continuous relaxations for the traveling salesman problem
type: journal_article
user_id: '47427'
year: '2019'
...
---
_id: '16853'
abstract:
- lang: eng
text: State-of-the-art frameworks for generating approximate circuits usually rely
on information gained through circuit synthesis and/or verification to explore
the search space and to find an optimal solution. Throughout the process, a large
number of circuits may be subject to processing, leading to considerable runtimes.
In this work, we propose a search which takes error bounds and pre-computed impact
factors into account to reduce the number of invoked synthesis and verification
processes. In our experimental results, we achieved speed-ups of up to 76x while
area savings remain comparable to the reference search method, simulated annealing.
author:
- first_name: Linus Matthias
full_name: Witschen, Linus Matthias
id: '49051'
last_name: Witschen
- first_name: Hassan
full_name: Ghasemzadeh Mohammadi, Hassan
id: '61186'
last_name: Ghasemzadeh Mohammadi
- first_name: Matthias
full_name: Artmann, Matthias
last_name: Artmann
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
citation:
ama: 'Witschen LM, Ghasemzadeh Mohammadi H, Artmann M, Platzner M. Jump Search:
A Fast Technique for the Synthesis of Approximate Circuits. Fourth Workshop
on Approximate Computing (AxC 2019).'
apa: 'Witschen, L. M., Ghasemzadeh Mohammadi, H., Artmann, M., & Platzner, M.
(n.d.). Jump Search: A Fast Technique for the Synthesis of Approximate Circuits.
Fourth Workshop on Approximate Computing (AxC 2019).'
bibtex: '@article{Witschen_Ghasemzadeh Mohammadi_Artmann_Platzner, title={Jump Search:
A Fast Technique for the Synthesis of Approximate Circuits}, journal={Fourth Workshop
on Approximate Computing (AxC 2019)}, author={Witschen, Linus Matthias and Ghasemzadeh
Mohammadi, Hassan and Artmann, Matthias and Platzner, Marco} }'
chicago: 'Witschen, Linus Matthias, Hassan Ghasemzadeh Mohammadi, Matthias Artmann,
and Marco Platzner. “Jump Search: A Fast Technique for the Synthesis of Approximate
Circuits.” Fourth Workshop on Approximate Computing (AxC 2019), n.d.'
ieee: 'L. M. Witschen, H. Ghasemzadeh Mohammadi, M. Artmann, and M. Platzner, “Jump
Search: A Fast Technique for the Synthesis of Approximate Circuits,” Fourth
Workshop on Approximate Computing (AxC 2019). .'
mla: 'Witschen, Linus Matthias, et al. “Jump Search: A Fast Technique for the Synthesis
of Approximate Circuits.” Fourth Workshop on Approximate Computing (AxC 2019).'
short: L.M. Witschen, H. Ghasemzadeh Mohammadi, M. Artmann, M. Platzner, Fourth
Workshop on Approximate Computing (AxC 2019) (n.d.).
date_created: 2020-04-25T08:02:07Z
date_updated: 2022-01-06T06:52:57Z
ddc:
- '006'
department:
- _id: '78'
file:
- access_level: closed
content_type: application/pdf
creator: witschen
date_created: 2020-04-25T08:00:35Z
date_updated: 2020-04-25T08:00:35Z
file_id: '16854'
file_name: AxC19_paper_3.pdf
file_size: 152806
relation: main_file
success: 1
file_date_updated: 2020-04-25T08:00:35Z
has_accepted_license: '1'
keyword:
- Approximate computing
- parameter selection
- search space exploration
- verification
- circuit synthesis
language:
- iso: eng
page: '2'
project:
- _id: '52'
name: Computing Resources Provided by the Paderborn Center for Parallel Computing
publication: Fourth Workshop on Approximate Computing (AxC 2019)
publication_status: accepted
status: public
title: 'Jump Search: A Fast Technique for the Synthesis of Approximate Circuits'
type: preprint
user_id: '49051'
year: '2019'
...
---
_id: '10577'
abstract:
- lang: eng
text: "State-of-the-art frameworks for generating approximate circuits automatically
explore the search space in an iterative process - often greedily. Synthesis and
verification processes are invoked in each iteration to evaluate the found solutions
and to guide the search algorithm. As a result, a large number of approximate
circuits is subjected to analysis - leading to long runtimes - but only a few
approximate circuits might form an acceptable solution.\r\n\r\nIn this paper,
we present our Jump Search (JS) method which seeks to reduce the runtime of an
approximation process by reducing the number of expensive synthesis and verification
steps. To reduce the runtime, JS computes impact factors for each approximation
candidate in the circuit to create a selection of approximate circuits without
invoking synthesis or verification processes. We denote the selection as path
from which JS determines the final solution. In our experimental results, JS achieved
speed-ups of up to 57x while area savings remain comparable to the reference search
method, Simulated Annealing."
author:
- first_name: Linus Matthias
full_name: Witschen, Linus Matthias
id: '49051'
last_name: Witschen
- first_name: Hassan
full_name: Ghasemzadeh Mohammadi, Hassan
id: '61186'
last_name: Ghasemzadeh Mohammadi
- first_name: Matthias
full_name: Artmann, Matthias
last_name: Artmann
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
citation:
ama: 'Witschen LM, Ghasemzadeh Mohammadi H, Artmann M, Platzner M. Jump Search:
A Fast Technique for the Synthesis of Approximate Circuits. In: Proceedings
of the 2019 on Great Lakes Symposium on VLSI - GLSVLSI ’19. New York, NY,
USA: ACM; 2019. doi:10.1145/3299874.3317998'
apa: 'Witschen, L. M., Ghasemzadeh Mohammadi, H., Artmann, M., & Platzner, M.
(2019). Jump Search: A Fast Technique for the Synthesis of Approximate Circuits.
In Proceedings of the 2019 on Great Lakes Symposium on VLSI - GLSVLSI ’19.
New York, NY, USA: ACM. https://doi.org/10.1145/3299874.3317998'
bibtex: '@inproceedings{Witschen_Ghasemzadeh Mohammadi_Artmann_Platzner_2019, place={New
York, NY, USA}, title={Jump Search: A Fast Technique for the Synthesis of Approximate
Circuits}, DOI={10.1145/3299874.3317998},
booktitle={Proceedings of the 2019 on Great Lakes Symposium on VLSI - GLSVLSI
’19}, publisher={ACM}, author={Witschen, Linus Matthias and Ghasemzadeh Mohammadi,
Hassan and Artmann, Matthias and Platzner, Marco}, year={2019} }'
chicago: 'Witschen, Linus Matthias, Hassan Ghasemzadeh Mohammadi, Matthias Artmann,
and Marco Platzner. “Jump Search: A Fast Technique for the Synthesis of Approximate
Circuits.” In Proceedings of the 2019 on Great Lakes Symposium on VLSI - GLSVLSI
’19. New York, NY, USA: ACM, 2019. https://doi.org/10.1145/3299874.3317998.'
ieee: 'L. M. Witschen, H. Ghasemzadeh Mohammadi, M. Artmann, and M. Platzner, “Jump
Search: A Fast Technique for the Synthesis of Approximate Circuits,” in Proceedings
of the 2019 on Great Lakes Symposium on VLSI - GLSVLSI ’19, Tysons Corner,
VA, USA, 2019.'
mla: 'Witschen, Linus Matthias, et al. “Jump Search: A Fast Technique for the Synthesis
of Approximate Circuits.” Proceedings of the 2019 on Great Lakes Symposium
on VLSI - GLSVLSI ’19, ACM, 2019, doi:10.1145/3299874.3317998.'
short: 'L.M. Witschen, H. Ghasemzadeh Mohammadi, M. Artmann, M. Platzner, in: Proceedings
of the 2019 on Great Lakes Symposium on VLSI - GLSVLSI ’19, ACM, New York, NY,
USA, 2019.'
conference:
end_date: 2019-05-11
location: Tysons Corner, VA, USA
name: ACM Great Lakes Symposium on VLSI (GLSVLSI)
start_date: 2019-05-09
date_created: 2019-07-08T15:13:10Z
date_updated: 2022-01-06T06:50:45Z
department:
- _id: '78'
doi: 10.1145/3299874.3317998
keyword:
- Approximate computing
- design automation
- parameter selection
- circuit synthesis
language:
- iso: eng
place: New York, NY, USA
project:
- _id: '52'
name: Computing Resources Provided by the Paderborn Center for Parallel Computing
publication: Proceedings of the 2019 on Great Lakes Symposium on VLSI - GLSVLSI '19
publication_identifier:
isbn:
- '9781450362528'
publication_status: published
publisher: ACM
status: public
title: 'Jump Search: A Fast Technique for the Synthesis of Approximate Circuits'
type: conference
user_id: '49051'
year: '2019'
...
---
_id: '10578'
author:
- first_name: V. K.
full_name: Tagne, V. K.
last_name: Tagne
- first_name: S.
full_name: Fotso, S.
last_name: Fotso
- first_name: 'L. A. '
full_name: 'Fono, L. A. '
last_name: Fono
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
citation:
ama: Tagne VK, Fotso S, Fono LA, Hüllermeier E. Choice Functions Generated by Mallows
and Plackett–Luce Relations. New Mathematics and Natural Computation. 2019;15(2):191-213.
apa: Tagne, V. K., Fotso, S., Fono, L. A., & Hüllermeier, E. (2019). Choice
Functions Generated by Mallows and Plackett–Luce Relations. New Mathematics
and Natural Computation, 15(2), 191–213.
bibtex: '@article{Tagne_Fotso_Fono_Hüllermeier_2019, title={Choice Functions Generated
by Mallows and Plackett–Luce Relations}, volume={15}, number={2}, journal={New
Mathematics and Natural Computation}, author={Tagne, V. K. and Fotso, S. and Fono,
L. A. and Hüllermeier, Eyke}, year={2019}, pages={191–213} }'
chicago: 'Tagne, V. K., S. Fotso, L. A. Fono, and Eyke Hüllermeier. “Choice Functions
Generated by Mallows and Plackett–Luce Relations.” New Mathematics and Natural
Computation 15, no. 2 (2019): 191–213.'
ieee: V. K. Tagne, S. Fotso, L. A. Fono, and E. Hüllermeier, “Choice Functions Generated
by Mallows and Plackett–Luce Relations,” New Mathematics and Natural Computation,
vol. 15, no. 2, pp. 191–213, 2019.
mla: Tagne, V. K., et al. “Choice Functions Generated by Mallows and Plackett–Luce
Relations.” New Mathematics and Natural Computation, vol. 15, no. 2, 2019,
pp. 191–213.
short: V.K. Tagne, S. Fotso, L.A. Fono, E. Hüllermeier, New Mathematics and Natural
Computation 15 (2019) 191–213.
date_created: 2019-07-08T15:34:03Z
date_updated: 2022-01-06T06:50:45Z
department:
- _id: '34'
- _id: '355'
- _id: '7'
intvolume: ' 15'
issue: '2'
language:
- iso: eng
page: 191-213
publication: New Mathematics and Natural Computation
status: public
title: Choice Functions Generated by Mallows and Plackett–Luce Relations
type: journal_article
user_id: '315'
volume: 15
year: '2019'
...
---
_id: '10586'
abstract:
- lang: eng
text: We consider the problem of transforming a given graph G_s into a desired graph
G_t by applying a minimum number of primitives from a particular set of local
graph transformation primitives. These primitives are local in the sense that
each node can apply them based on local knowledge and by affecting only its 1-neighborhood.
Although the specific set of primitives we consider makes it possible to transform
any (weakly) connected graph into any other (weakly) connected graph consisting
of the same nodes, they cannot disconnect the graph or introduce new nodes into
the graph, making them ideal in the context of supervised overlay network transformations.
We prove that computing a minimum sequence of primitive applications (even centralized)
for arbitrary G_s and G_t is NP-hard, which we conjecture to hold for any set
of local graph transformation primitives satisfying the aforementioned properties.
On the other hand, we show that this problem admits a polynomial time algorithm
with a constant approximation ratio.
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Alexander
full_name: Setzer, Alexander
id: '11108'
last_name: Setzer
citation:
ama: 'Scheideler C, Setzer A. On the Complexity of Local Graph Transformations.
In: Proceedings of the 46th International Colloquium on Automata, Languages,
and Programming. Vol 132. LIPIcs. Dagstuhl Publishing; 2019:150:1--150:14.
doi:10.4230/LIPICS.ICALP.2019.150'
apa: 'Scheideler, C., & Setzer, A. (2019). On the Complexity of Local Graph
Transformations. In Proceedings of the 46th International Colloquium on Automata,
Languages, and Programming (Vol. 132, pp. 150:1--150:14). Patras, Greece:
Dagstuhl Publishing. https://doi.org/10.4230/LIPICS.ICALP.2019.150'
bibtex: '@inproceedings{Scheideler_Setzer_2019, series={LIPIcs}, title={On the Complexity
of Local Graph Transformations}, volume={132}, DOI={10.4230/LIPICS.ICALP.2019.150},
booktitle={Proceedings of the 46th International Colloquium on Automata, Languages,
and Programming}, publisher={Dagstuhl Publishing}, author={Scheideler, Christian
and Setzer, Alexander}, year={2019}, pages={150:1--150:14}, collection={LIPIcs}
}'
chicago: Scheideler, Christian, and Alexander Setzer. “On the Complexity of Local
Graph Transformations.” In Proceedings of the 46th International Colloquium
on Automata, Languages, and Programming, 132:150:1--150:14. LIPIcs. Dagstuhl
Publishing, 2019. https://doi.org/10.4230/LIPICS.ICALP.2019.150.
ieee: C. Scheideler and A. Setzer, “On the Complexity of Local Graph Transformations,”
in Proceedings of the 46th International Colloquium on Automata, Languages,
and Programming, Patras, Greece, 2019, vol. 132, pp. 150:1--150:14.
mla: Scheideler, Christian, and Alexander Setzer. “On the Complexity of Local Graph
Transformations.” Proceedings of the 46th International Colloquium on Automata,
Languages, and Programming, vol. 132, Dagstuhl Publishing, 2019, pp. 150:1--150:14,
doi:10.4230/LIPICS.ICALP.2019.150.
short: 'C. Scheideler, A. Setzer, in: Proceedings of the 46th International Colloquium
on Automata, Languages, and Programming, Dagstuhl Publishing, 2019, pp. 150:1--150:14.'
conference:
end_date: 2019-07-12
location: Patras, Greece
name: ICALP 2019
start_date: 2019-07-09
date_created: 2019-07-08T17:19:01Z
date_updated: 2022-01-06T06:50:45Z
ddc:
- '004'
department:
- _id: '79'
doi: 10.4230/LIPICS.ICALP.2019.150
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2019-08-26T09:21:27Z
date_updated: 2019-08-26T09:21:27Z
file_id: '12955'
file_name: LIPIcs-ICALP-2019-150.pdf
file_size: 537649
relation: main_file
success: 1
file_date_updated: 2019-08-26T09:21:27Z
has_accepted_license: '1'
intvolume: ' 132'
keyword:
- Graphs transformations
- NP-hardness
- approximation algorithms
language:
- iso: eng
page: 150:1--150:14
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subproject A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 46th International Colloquium on Automata, Languages,
and Programming
publication_status: published
publisher: Dagstuhl Publishing
series_title: LIPIcs
status: public
title: On the Complexity of Local Graph Transformations
type: conference
user_id: '477'
volume: 132
year: '2019'
...
---
_id: '10593'
abstract:
- lang: eng
text: We present a new framework for optimal and feedback control of PDEs using
Koopman operator-based reduced order models (K-ROMs). The Koopman operator is
a linear but infinite-dimensional operator which describes the dynamics of observables.
A numerical approximation of the Koopman operator therefore yields a linear system
for the observation of an autonomous dynamical system. In our approach, by introducing
a finite number of constant controls, the dynamic control system is transformed
into a set of autonomous systems and the corresponding optimal control problem
into a switching time optimization problem. This allows us to replace each of
these systems by a K-ROM which can be solved orders of magnitude faster. By this
approach, a nonlinear infinite-dimensional control problem is transformed into
a low-dimensional linear problem. Using a recent convergence result for the numerical
approximation via Extended Dynamic Mode Decomposition (EDMD), we show that the
value of the K-ROM based objective function converges in measure to the value
of the full objective function. To illustrate the results, we consider the 1D
Burgers equation and the 2D Navier–Stokes equations. The numerical experiments
show remarkable performance concerning both solution times and accuracy.
article_type: original
author:
- first_name: Sebastian
full_name: Peitz, Sebastian
id: '47427'
last_name: Peitz
orcid: https://orcid.org/0000-0002-3389-793X
- first_name: Stefan
full_name: Klus, Stefan
last_name: Klus
citation:
ama: Peitz S, Klus S. Koopman operator-based model reduction for switched-system
control of PDEs. Automatica. 2019;106:184-191. doi:10.1016/j.automatica.2019.05.016
apa: Peitz, S., & Klus, S. (2019). Koopman operator-based model reduction for
switched-system control of PDEs. Automatica, 106, 184–191. https://doi.org/10.1016/j.automatica.2019.05.016
bibtex: '@article{Peitz_Klus_2019, title={Koopman operator-based model reduction
for switched-system control of PDEs}, volume={106}, DOI={10.1016/j.automatica.2019.05.016},
journal={Automatica}, author={Peitz, Sebastian and Klus, Stefan}, year={2019},
pages={184–191} }'
chicago: 'Peitz, Sebastian, and Stefan Klus. “Koopman Operator-Based Model Reduction
for Switched-System Control of PDEs.” Automatica 106 (2019): 184–91. https://doi.org/10.1016/j.automatica.2019.05.016.'
ieee: S. Peitz and S. Klus, “Koopman operator-based model reduction for switched-system
control of PDEs,” Automatica, vol. 106, pp. 184–191, 2019.
mla: Peitz, Sebastian, and Stefan Klus. “Koopman Operator-Based Model Reduction
for Switched-System Control of PDEs.” Automatica, vol. 106, 2019, pp. 184–91,
doi:10.1016/j.automatica.2019.05.016.
short: S. Peitz, S. Klus, Automatica 106 (2019) 184–191.
date_created: 2019-07-10T08:08:16Z
date_updated: 2022-01-06T06:50:46Z
department:
- _id: '101'
doi: 10.1016/j.automatica.2019.05.016
intvolume: ' 106'
language:
- iso: eng
page: 184-191
publication: Automatica
publication_identifier:
issn:
- 0005-1098
publication_status: published
status: public
title: Koopman operator-based model reduction for switched-system control of PDEs
type: journal_article
user_id: '47427'
volume: 106
year: '2019'
...
---
_id: '10595'
abstract:
- lang: eng
text: In this article we show that the boundary of the Pareto critical set of an
unconstrained multiobjective optimization problem (MOP) consists of Pareto critical
points of subproblems where only a subset of the set of objective functions is
taken into account. If the Pareto critical set is completely described by its
boundary (e.g., if we have more objective functions than dimensions in decision
space), then this can be used to efficiently solve the MOP by solving a number
of MOPs with fewer objective functions. If this is not the case, the results can
still give insight into the structure of the Pareto critical set.
article_type: original
author:
- first_name: Bennet
full_name: Gebken, Bennet
id: '32643'
last_name: Gebken
- first_name: Sebastian
full_name: Peitz, Sebastian
id: '47427'
last_name: Peitz
orcid: https://orcid.org/0000-0002-3389-793X
- first_name: Michael
full_name: Dellnitz, Michael
last_name: Dellnitz
citation:
ama: Gebken B, Peitz S, Dellnitz M. On the hierarchical structure of Pareto critical
sets. Journal of Global Optimization. 2019;73(4):891-913. doi:10.1007/s10898-019-00737-6
apa: Gebken, B., Peitz, S., & Dellnitz, M. (2019). On the hierarchical structure
of Pareto critical sets. Journal of Global Optimization, 73(4),
891–913. https://doi.org/10.1007/s10898-019-00737-6
bibtex: '@article{Gebken_Peitz_Dellnitz_2019, title={On the hierarchical structure
of Pareto critical sets}, volume={73}, DOI={10.1007/s10898-019-00737-6},
number={4}, journal={Journal of Global Optimization}, author={Gebken, Bennet and
Peitz, Sebastian and Dellnitz, Michael}, year={2019}, pages={891–913} }'
chicago: 'Gebken, Bennet, Sebastian Peitz, and Michael Dellnitz. “On the Hierarchical
Structure of Pareto Critical Sets.” Journal of Global Optimization 73,
no. 4 (2019): 891–913. https://doi.org/10.1007/s10898-019-00737-6.'
ieee: B. Gebken, S. Peitz, and M. Dellnitz, “On the hierarchical structure of Pareto
critical sets,” Journal of Global Optimization, vol. 73, no. 4, pp. 891–913,
2019.
mla: Gebken, Bennet, et al. “On the Hierarchical Structure of Pareto Critical Sets.”
Journal of Global Optimization, vol. 73, no. 4, 2019, pp. 891–913, doi:10.1007/s10898-019-00737-6.
short: B. Gebken, S. Peitz, M. Dellnitz, Journal of Global Optimization 73 (2019)
891–913.
date_created: 2019-07-10T08:13:31Z
date_updated: 2022-01-06T06:50:46Z
department:
- _id: '101'
doi: 10.1007/s10898-019-00737-6
intvolume: ' 73'
issue: '4'
language:
- iso: eng
page: 891-913
publication: Journal of Global Optimization
publication_identifier:
issn:
- 0925-5001
- 1573-2916
publication_status: published
status: public
title: On the hierarchical structure of Pareto critical sets
type: journal_article
user_id: '47427'
volume: 73
year: '2019'
...
---
_id: '10597'
abstract:
- lang: eng
text: In comparison to classical control approaches in the field of electrical drives
like the field-oriented control (FOC), model predictive control (MPC) approaches
are able to provide a higher control performance. This refers to shorter settling
times, lower overshoots, and a better decoupling of control variables in case
of multi-variable controls. However, this can only be achieved if the used prediction
model covers the actual behavior of the plant sufficiently well. In case of model
deviations, the performance utilizing MPC remains below its potential. This results
in effects like increased current ripple or steady state setpoint deviations.
In order to achieve a high control performance, it is therefore necessary to adapt
the model to the real plant behavior. When using an online system identification,
a less accurate model is sufficient for commissioning of the drive system. In
this paper, the combination of a finite-control-set MPC (FCS-MPC) with a system
identification is proposed. The method does not require high-frequency signal
injection, but uses the measured values already required for the FCS-MPC. An evaluation
of the least squares-based identification on a laboratory test bench showed that
the model accuracy and thus the control performance could be improved by an online
update of the prediction models.
author:
- first_name: Soren
full_name: Hanke, Soren
last_name: Hanke
- first_name: Sebastian
full_name: Peitz, Sebastian
id: '47427'
last_name: Peitz
orcid: https://orcid.org/0000-0002-3389-793X
- first_name: Oliver
full_name: Wallscheid, Oliver
last_name: Wallscheid
- first_name: Joachim
full_name: Böcker, Joachim
last_name: Böcker
- first_name: Michael
full_name: Dellnitz, Michael
last_name: Dellnitz
citation:
ama: 'Hanke S, Peitz S, Wallscheid O, Böcker J, Dellnitz M. Finite-Control-Set Model
Predictive Control for a Permanent Magnet Synchronous Motor Application with Online
Least Squares System Identification. In: 2019 IEEE International Symposium
on Predictive Control of Electrical Drives and Power Electronics (PRECEDE).
; 2019. doi:10.1109/precede.2019.8753313'
apa: Hanke, S., Peitz, S., Wallscheid, O., Böcker, J., & Dellnitz, M. (2019).
Finite-Control-Set Model Predictive Control for a Permanent Magnet Synchronous
Motor Application with Online Least Squares System Identification. In 2019
IEEE International Symposium on Predictive Control of Electrical Drives and Power
Electronics (PRECEDE). https://doi.org/10.1109/precede.2019.8753313
bibtex: '@inproceedings{Hanke_Peitz_Wallscheid_Böcker_Dellnitz_2019, title={Finite-Control-Set
Model Predictive Control for a Permanent Magnet Synchronous Motor Application
with Online Least Squares System Identification}, DOI={10.1109/precede.2019.8753313},
booktitle={2019 IEEE International Symposium on Predictive Control of Electrical
Drives and Power Electronics (PRECEDE)}, author={Hanke, Soren and Peitz, Sebastian
and Wallscheid, Oliver and Böcker, Joachim and Dellnitz, Michael}, year={2019}
}'
chicago: Hanke, Soren, Sebastian Peitz, Oliver Wallscheid, Joachim Böcker, and Michael
Dellnitz. “Finite-Control-Set Model Predictive Control for a Permanent Magnet
Synchronous Motor Application with Online Least Squares System Identification.”
In 2019 IEEE International Symposium on Predictive Control of Electrical Drives
and Power Electronics (PRECEDE), 2019. https://doi.org/10.1109/precede.2019.8753313.
ieee: S. Hanke, S. Peitz, O. Wallscheid, J. Böcker, and M. Dellnitz, “Finite-Control-Set
Model Predictive Control for a Permanent Magnet Synchronous Motor Application
with Online Least Squares System Identification,” in 2019 IEEE International
Symposium on Predictive Control of Electrical Drives and Power Electronics (PRECEDE),
2019.
mla: Hanke, Soren, et al. “Finite-Control-Set Model Predictive Control for a Permanent
Magnet Synchronous Motor Application with Online Least Squares System Identification.”
2019 IEEE International Symposium on Predictive Control of Electrical Drives
and Power Electronics (PRECEDE), 2019, doi:10.1109/precede.2019.8753313.
short: 'S. Hanke, S. Peitz, O. Wallscheid, J. Böcker, M. Dellnitz, in: 2019 IEEE
International Symposium on Predictive Control of Electrical Drives and Power Electronics
(PRECEDE), 2019.'
date_created: 2019-07-10T08:15:23Z
date_updated: 2022-01-06T06:50:46Z
department:
- _id: '101'
doi: 10.1109/precede.2019.8753313
language:
- iso: eng
publication: 2019 IEEE International Symposium on Predictive Control of Electrical
Drives and Power Electronics (PRECEDE)
publication_identifier:
isbn:
- '9781538694145'
publication_status: published
status: public
title: Finite-Control-Set Model Predictive Control for a Permanent Magnet Synchronous
Motor Application with Online Least Squares System Identification
type: conference
user_id: '47427'
year: '2019'
...
---
_id: '11709'
author:
- first_name: Martin
full_name: Potthast, Martin
last_name: Potthast
- first_name: Lukas
full_name: Gienapp, Lukas
last_name: Gienapp
- first_name: Florian
full_name: Euchner, Florian
last_name: Euchner
- first_name: Nick
full_name: Heilenkötter, Nick
last_name: Heilenkötter
- first_name: Nico
full_name: Weidmann, Nico
last_name: Weidmann
- first_name: Henning
full_name: Wachsmuth, Henning
id: '3900'
last_name: Wachsmuth
- first_name: Benno
full_name: Stein, Benno
last_name: Stein
- first_name: Matthias
full_name: Hagen, Matthias
last_name: Hagen
citation:
ama: 'Potthast M, Gienapp L, Euchner F, et al. Argument Search: Assessing Argument
Relevance. In: 42nd International ACM Conference on Research and Development
in Information Retrieval (SIGIR 2019). ACM; 2019:1117-1120. doi:10.1145/3331184.3331327'
apa: 'Potthast, M., Gienapp, L., Euchner, F., Heilenkötter, N., Weidmann, N., Wachsmuth,
H., … Hagen, M. (2019). Argument Search: Assessing Argument Relevance. In 42nd
International ACM Conference on Research and Development in Information Retrieval
(SIGIR 2019) (pp. 1117–1120). ACM. https://doi.org/10.1145/3331184.3331327'
bibtex: '@inproceedings{Potthast_Gienapp_Euchner_Heilenkötter_Weidmann_Wachsmuth_Stein_Hagen_2019,
title={Argument Search: Assessing Argument Relevance}, DOI={10.1145/3331184.3331327},
booktitle={42nd International ACM Conference on Research and Development in Information
Retrieval (SIGIR 2019)}, publisher={ACM}, author={Potthast, Martin and Gienapp,
Lukas and Euchner, Florian and Heilenkötter, Nick and Weidmann, Nico and Wachsmuth,
Henning and Stein, Benno and Hagen, Matthias}, year={2019}, pages={1117–1120}
}'
chicago: 'Potthast, Martin, Lukas Gienapp, Florian Euchner, Nick Heilenkötter, Nico
Weidmann, Henning Wachsmuth, Benno Stein, and Matthias Hagen. “Argument Search:
Assessing Argument Relevance.” In 42nd International ACM Conference on Research
and Development in Information Retrieval (SIGIR 2019), 1117–20. ACM, 2019.
https://doi.org/10.1145/3331184.3331327.'
ieee: 'M. Potthast et al., “Argument Search: Assessing Argument Relevance,”
in 42nd International ACM Conference on Research and Development in Information
Retrieval (SIGIR 2019), 2019, pp. 1117–1120.'
mla: 'Potthast, Martin, et al. “Argument Search: Assessing Argument Relevance.”
42nd International ACM Conference on Research and Development in Information
Retrieval (SIGIR 2019), ACM, 2019, pp. 1117–20, doi:10.1145/3331184.3331327.'
short: 'M. Potthast, L. Gienapp, F. Euchner, N. Heilenkötter, N. Weidmann, H. Wachsmuth,
B. Stein, M. Hagen, in: 42nd International ACM Conference on Research and Development
in Information Retrieval (SIGIR 2019), ACM, 2019, pp. 1117–1120.'
date_created: 2019-07-11T13:09:41Z
date_updated: 2022-01-06T06:51:06Z
department:
- _id: '600'
- _id: '568'
doi: 10.1145/3331184.3331327
language:
- iso: eng
main_file_link:
- url: https://dl.acm.org/doi/pdf/10.1145/3331184.3331327
page: 1117 - 1120
publication: 42nd International ACM Conference on Research and Development in Information
Retrieval (SIGIR 2019)
publisher: ACM
status: public
title: 'Argument Search: Assessing Argument Relevance'
type: conference
user_id: '82920'
year: '2019'
...
---
_id: '11713'
author:
- first_name: Henning
full_name: Wachsmuth, Henning
id: '3900'
last_name: Wachsmuth
citation:
ama: 'Wachsmuth H. Book Review: Argumentation Mining. Computational Linguistics.
2019;45(3):603-606.'
apa: 'Wachsmuth, H. (2019). Book Review: Argumentation Mining. Computational
Linguistics. ACL.'
bibtex: '@article{Wachsmuth_2019, title={Book Review: Argumentation Mining}, volume={45},
number={3}, journal={Computational Linguistics}, publisher={ACL}, author={Wachsmuth,
Henning}, year={2019}, pages={603–606} }'
chicago: 'Wachsmuth, Henning. “Book Review: Argumentation Mining.” Computational
Linguistics. ACL, 2019.'
ieee: 'H. Wachsmuth, “Book Review: Argumentation Mining,” Computational Linguistics,
vol. 45, no. 3. ACL, pp. 603–606, 2019.'
mla: 'Wachsmuth, Henning. “Book Review: Argumentation Mining.” Computational
Linguistics, vol. 45, no. 3, ACL, 2019, pp. 603–06.'
short: H. Wachsmuth, Computational Linguistics 45 (2019) 603–606.
date_created: 2019-07-11T13:29:48Z
date_updated: 2022-01-06T06:51:07Z
department:
- _id: '600'
intvolume: ' 45'
issue: '3'
language:
- iso: eng
page: 603 - 606
publication: Computational Linguistics
publisher: ACL
status: public
title: 'Book Review: Argumentation Mining'
type: review
user_id: '3900'
volume: 45
year: '2019'
...
---
_id: '11714'
author:
- first_name: Yamen
full_name: Ajjour, Yamen
last_name: Ajjour
- first_name: Henning
full_name: Wachsmuth, Henning
id: '3900'
last_name: Wachsmuth
- first_name: Johannes
full_name: ' Kiesel, Johannes'
last_name: ' Kiesel'
- first_name: Martin
full_name: Potthast, Martin
last_name: Potthast
- first_name: Matthias
full_name: Hagen, Matthias
last_name: Hagen
- first_name: Benno
full_name: Stein, Benno
last_name: Stein
citation:
ama: 'Ajjour Y, Wachsmuth H, Kiesel J, Potthast M, Hagen M, Stein B. Data Acquisition
for Argument Search: The args.me Corpus. In: Proceedings of the 42nd Edition
of the German Conference on Artificial Intelligence. ; 2019:48-59.'
apa: 'Ajjour, Y., Wachsmuth, H., Kiesel, J., Potthast, M., Hagen, M., & Stein,
B. (2019). Data Acquisition for Argument Search: The args.me Corpus. In Proceedings
of the 42nd Edition of the German Conference on Artificial Intelligence (pp.
48–59).'
bibtex: '@inproceedings{Ajjour_Wachsmuth_ Kiesel_Potthast_Hagen_Stein_2019, title={Data
Acquisition for Argument Search: The args.me Corpus}, booktitle={Proceedings of
the 42nd Edition of the German Conference on Artificial Intelligence}, author={Ajjour,
Yamen and Wachsmuth, Henning and Kiesel, Johannes and Potthast, Martin and Hagen,
Matthias and Stein, Benno}, year={2019}, pages={48–59} }'
chicago: 'Ajjour, Yamen, Henning Wachsmuth, Johannes Kiesel, Martin Potthast, Matthias
Hagen, and Benno Stein. “Data Acquisition for Argument Search: The Args.Me Corpus.”
In Proceedings of the 42nd Edition of the German Conference on Artificial Intelligence,
48–59, 2019.'
ieee: 'Y. Ajjour, H. Wachsmuth, J. Kiesel, M. Potthast, M. Hagen, and B. Stein,
“Data Acquisition for Argument Search: The args.me Corpus,” in Proceedings
of the 42nd Edition of the German Conference on Artificial Intelligence, 2019,
pp. 48–59.'
mla: 'Ajjour, Yamen, et al. “Data Acquisition for Argument Search: The Args.Me Corpus.”
Proceedings of the 42nd Edition of the German Conference on Artificial Intelligence,
2019, pp. 48–59.'
short: 'Y. Ajjour, H. Wachsmuth, J. Kiesel, M. Potthast, M. Hagen, B. Stein, in:
Proceedings of the 42nd Edition of the German Conference on Artificial Intelligence,
2019, pp. 48–59.'
date_created: 2019-07-11T13:43:15Z
date_updated: 2022-01-06T06:51:07Z
department:
- _id: '600'
- _id: '568'
language:
- iso: eng
main_file_link:
- url: https://webis.de/downloads/publications/papers/stein_2019p.pdf
page: 48-59
publication: Proceedings of the 42nd Edition of the German Conference on Artificial
Intelligence
status: public
title: 'Data Acquisition for Argument Search: The args.me Corpus'
type: conference
user_id: '82920'
year: '2019'
...
---
_id: '11950'
abstract:
- lang: eng
text: Advances in electromyographic (EMG) sensor technology and machine learning
algorithms have led to an increased research effort into high density EMG-based
pattern recognition methods for prosthesis control. With the goal set on an autonomous
multi-movement prosthesis capable of performing training and classification of
an amputee’s EMG signals, the focus of this paper lies in the acceleration of
the embedded signal processing chain. We present two Xilinx Zynq-based architectures
for accelerating two inherently different high density EMG-based control algorithms.
The first hardware accelerated design achieves speed-ups of up to 4.8 over the
software-only solution, allowing for a processing delay lower than the sample
period of 1 ms. The second system achieved a speed-up of 5.5 over the software-only
version and operates at a still satisfactory low processing delay of up to 15
ms while providing a higher reliability and robustness against electrode shift
and noisy channels.
author:
- first_name: Alexander
full_name: Boschmann, Alexander
last_name: Boschmann
- first_name: Andreas
full_name: Agne, Andreas
last_name: Agne
- first_name: Georg
full_name: Thombansen, Georg
last_name: Thombansen
- first_name: Linus Matthias
full_name: Witschen, Linus Matthias
id: '49051'
last_name: Witschen
- first_name: Florian
full_name: Kraus, Florian
last_name: Kraus
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
citation:
ama: Boschmann A, Agne A, Thombansen G, Witschen LM, Kraus F, Platzner M. Zynq-based
acceleration of robust high density myoelectric signal processing. Journal
of Parallel and Distributed Computing. 2019;123:77-89. doi:10.1016/j.jpdc.2018.07.004
apa: Boschmann, A., Agne, A., Thombansen, G., Witschen, L. M., Kraus, F., &
Platzner, M. (2019). Zynq-based acceleration of robust high density myoelectric
signal processing. Journal of Parallel and Distributed Computing, 123,
77–89. https://doi.org/10.1016/j.jpdc.2018.07.004
bibtex: '@article{Boschmann_Agne_Thombansen_Witschen_Kraus_Platzner_2019, title={Zynq-based
acceleration of robust high density myoelectric signal processing}, volume={123},
DOI={10.1016/j.jpdc.2018.07.004},
journal={Journal of Parallel and Distributed Computing}, publisher={Elsevier},
author={Boschmann, Alexander and Agne, Andreas and Thombansen, Georg and Witschen,
Linus Matthias and Kraus, Florian and Platzner, Marco}, year={2019}, pages={77–89}
}'
chicago: 'Boschmann, Alexander, Andreas Agne, Georg Thombansen, Linus Matthias Witschen,
Florian Kraus, and Marco Platzner. “Zynq-Based Acceleration of Robust High Density
Myoelectric Signal Processing.” Journal of Parallel and Distributed Computing
123 (2019): 77–89. https://doi.org/10.1016/j.jpdc.2018.07.004.'
ieee: A. Boschmann, A. Agne, G. Thombansen, L. M. Witschen, F. Kraus, and M. Platzner,
“Zynq-based acceleration of robust high density myoelectric signal processing,”
Journal of Parallel and Distributed Computing, vol. 123, pp. 77–89, 2019.
mla: Boschmann, Alexander, et al. “Zynq-Based Acceleration of Robust High Density
Myoelectric Signal Processing.” Journal of Parallel and Distributed Computing,
vol. 123, Elsevier, 2019, pp. 77–89, doi:10.1016/j.jpdc.2018.07.004.
short: A. Boschmann, A. Agne, G. Thombansen, L.M. Witschen, F. Kraus, M. Platzner,
Journal of Parallel and Distributed Computing 123 (2019) 77–89.
date_created: 2019-07-12T13:13:55Z
date_updated: 2022-01-06T06:51:13Z
department:
- _id: '78'
doi: 10.1016/j.jpdc.2018.07.004
intvolume: ' 123'
keyword:
- High density electromyography
- FPGA acceleration
- Medical signal processing
- Pattern recognition
- Prosthetics
language:
- iso: eng
page: 77-89
publication: Journal of Parallel and Distributed Computing
publication_identifier:
issn:
- 0743-7315
publication_status: published
publisher: Elsevier
status: public
title: Zynq-based acceleration of robust high density myoelectric signal processing
type: journal_article
user_id: '398'
volume: 123
year: '2019'
...
---
_id: '11952'
author:
- first_name: Björn
full_name: Senft, Björn
id: '9109'
last_name: Senft
- first_name: Florian
full_name: Rittmeier, Florian
id: '5281'
last_name: Rittmeier
- first_name: Holger Gerhard
full_name: Fischer, Holger Gerhard
id: '30457'
last_name: Fischer
- first_name: Simon
full_name: Oberthür, Simon
id: '383'
last_name: Oberthür
citation:
ama: 'Senft B, Rittmeier F, Fischer HG, Oberthür S. A Value-Centered Approach for
Unique and Novel Software Applications. In: Design, User Experience, and Usability.
Practice and Case Studies. Cham; 2019. doi:10.1007/978-3-030-23535-2_27'
apa: Senft, B., Rittmeier, F., Fischer, H. G., & Oberthür, S. (2019). A Value-Centered
Approach for Unique and Novel Software Applications. In Design, User Experience,
and Usability. Practice and Case Studies. Cham. https://doi.org/10.1007/978-3-030-23535-2_27
bibtex: '@inbook{Senft_Rittmeier_Fischer_Oberthür_2019, place={Cham}, title={A Value-Centered
Approach for Unique and Novel Software Applications}, DOI={10.1007/978-3-030-23535-2_27},
booktitle={Design, User Experience, and Usability. Practice and Case Studies},
author={Senft, Björn and Rittmeier, Florian and Fischer, Holger Gerhard and Oberthür,
Simon}, year={2019} }'
chicago: Senft, Björn, Florian Rittmeier, Holger Gerhard Fischer, and Simon Oberthür.
“A Value-Centered Approach for Unique and Novel Software Applications.” In Design,
User Experience, and Usability. Practice and Case Studies. Cham, 2019. https://doi.org/10.1007/978-3-030-23535-2_27.
ieee: B. Senft, F. Rittmeier, H. G. Fischer, and S. Oberthür, “A Value-Centered
Approach for Unique and Novel Software Applications,” in Design, User Experience,
and Usability. Practice and Case Studies, Cham, 2019.
mla: Senft, Björn, et al. “A Value-Centered Approach for Unique and Novel Software
Applications.” Design, User Experience, and Usability. Practice and Case Studies,
2019, doi:10.1007/978-3-030-23535-2_27.
short: 'B. Senft, F. Rittmeier, H.G. Fischer, S. Oberthür, in: Design, User Experience,
and Usability. Practice and Case Studies, Cham, 2019.'
conference:
end_date: 2019-07-31
location: Orlando, FL, USA
name: 21st International Conference on Human-Computer Interaction
start_date: 2019-07-26
date_created: 2019-07-14T07:57:53Z
date_updated: 2022-01-06T06:51:13Z
department:
- _id: '66'
doi: 10.1007/978-3-030-23535-2_27
language:
- iso: eng
place: Cham
publication: Design, User Experience, and Usability. Practice and Case Studies
publication_identifier:
isbn:
- '9783030235345'
- '9783030235352'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: A Value-Centered Approach for Unique and Novel Software Applications
type: book_chapter
user_id: '9109'
year: '2019'
...
---
_id: '11965'
abstract:
- lang: eng
text: 'We present an unsupervised training approach for a neural network-based mask
estimator in an acoustic beamforming application. The network is trained to maximize
a likelihood criterion derived from a spatial mixture model of the observations.
It is trained from scratch without requiring any parallel data consisting of degraded
input and clean training targets. Thus, training can be carried out on real recordings
of noisy speech rather than simulated ones. In contrast to previous work on unsupervised
training of neural mask estimators, our approach avoids the need for a possibly
pre-trained teacher model entirely. We demonstrate the effectiveness of our approach
by speech recognition experiments on two different datasets: one mainly deteriorated
by noise (CHiME 4) and one by reverberation (REVERB). The results show that the
performance of the proposed system is on par with a supervised system using oracle
target masks for training and with a system trained using a model-based teacher.'
author:
- first_name: Lukas
full_name: Drude, Lukas
id: '11213'
last_name: Drude
- first_name: Jahn
full_name: Heymann, Jahn
id: '9168'
last_name: Heymann
- first_name: Reinhold
full_name: Haeb-Umbach, Reinhold
id: '242'
last_name: Haeb-Umbach
citation:
ama: 'Drude L, Heymann J, Haeb-Umbach R. Unsupervised training of neural mask-based
beamforming. In: INTERSPEECH 2019, Graz, Austria. ; 2019.'
apa: Drude, L., Heymann, J., & Haeb-Umbach, R. (2019). Unsupervised training
of neural mask-based beamforming. In INTERSPEECH 2019, Graz, Austria.
bibtex: '@inproceedings{Drude_Heymann_Haeb-Umbach_2019, title={Unsupervised training
of neural mask-based beamforming}, booktitle={INTERSPEECH 2019, Graz, Austria},
author={Drude, Lukas and Heymann, Jahn and Haeb-Umbach, Reinhold}, year={2019}
}'
chicago: Drude, Lukas, Jahn Heymann, and Reinhold Haeb-Umbach. “Unsupervised Training
of Neural Mask-Based Beamforming.” In INTERSPEECH 2019, Graz, Austria,
2019.
ieee: L. Drude, J. Heymann, and R. Haeb-Umbach, “Unsupervised training of neural
mask-based beamforming,” in INTERSPEECH 2019, Graz, Austria, 2019.
mla: Drude, Lukas, et al. “Unsupervised Training of Neural Mask-Based Beamforming.”
INTERSPEECH 2019, Graz, Austria, 2019.
short: 'L. Drude, J. Heymann, R. Haeb-Umbach, in: INTERSPEECH 2019, Graz, Austria,
2019.'
date_created: 2019-07-18T09:11:39Z
date_updated: 2022-01-06T06:51:14Z
ddc:
- '000'
department:
- _id: '54'
file:
- access_level: open_access
content_type: application/pdf
creator: huesera
date_created: 2019-08-13T06:36:44Z
date_updated: 2019-08-13T06:41:35Z
file_id: '12914'
file_name: INTERSPEECH_2019_Drude_Paper.pdf
file_size: 223413
relation: main_file
file_date_updated: 2019-08-13T06:41:35Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
project:
- _id: '52'
name: Computing Resources Provided by the Paderborn Center for Parallel Computing
publication: INTERSPEECH 2019, Graz, Austria
status: public
title: Unsupervised training of neural mask-based beamforming
type: conference
user_id: '59789'
year: '2019'
...
---
_id: '11985'
author:
- first_name: Fabian
full_name: Bronner, Fabian
last_name: Bronner
- first_name: Christoph
full_name: Sommer, Christoph
id: '49154'
last_name: Sommer
orcid: 0000-0002-4336-7350
citation:
ama: 'Bronner F, Sommer C. Efficient Multi-Channel Simulation of Wireless Communications.
In: 2018 IEEE Vehicular Networking Conference (VNC). ; 2019. doi:10.1109/vnc.2018.8628350'
apa: Bronner, F., & Sommer, C. (2019). Efficient Multi-Channel Simulation of
Wireless Communications. In 2018 IEEE Vehicular Networking Conference (VNC).
https://doi.org/10.1109/vnc.2018.8628350
bibtex: '@inproceedings{Bronner_Sommer_2019, title={Efficient Multi-Channel Simulation
of Wireless Communications}, DOI={10.1109/vnc.2018.8628350},
booktitle={2018 IEEE Vehicular Networking Conference (VNC)}, author={Bronner,
Fabian and Sommer, Christoph}, year={2019} }'
chicago: Bronner, Fabian, and Christoph Sommer. “Efficient Multi-Channel Simulation
of Wireless Communications.” In 2018 IEEE Vehicular Networking Conference (VNC),
2019. https://doi.org/10.1109/vnc.2018.8628350.
ieee: F. Bronner and C. Sommer, “Efficient Multi-Channel Simulation of Wireless
Communications,” in 2018 IEEE Vehicular Networking Conference (VNC), 2019.
mla: Bronner, Fabian, and Christoph Sommer. “Efficient Multi-Channel Simulation
of Wireless Communications.” 2018 IEEE Vehicular Networking Conference (VNC),
2019, doi:10.1109/vnc.2018.8628350.
short: 'F. Bronner, C. Sommer, in: 2018 IEEE Vehicular Networking Conference (VNC),
2019.'
date_created: 2019-07-18T09:51:49Z
date_updated: 2022-01-06T06:51:15Z
department:
- _id: '589'
doi: 10.1109/vnc.2018.8628350
language:
- iso: eng
publication: 2018 IEEE Vehicular Networking Conference (VNC)
publication_identifier:
isbn:
- '9781538694282'
publication_status: published
status: public
title: Efficient Multi-Channel Simulation of Wireless Communications
type: conference
user_id: '49154'
year: '2019'
...
---
_id: '12043'
author:
- first_name: Peter
full_name: Reinold, Peter
last_name: Reinold
- first_name: Norbert
full_name: Meyer, Norbert
last_name: Meyer
- first_name: Dominik
full_name: Buse, Dominik
last_name: Buse
- first_name: Florian
full_name: Klingler, Florian
last_name: Klingler
- first_name: Christoph
full_name: Sommer, Christoph
id: '49154'
last_name: Sommer
orcid: 0000-0002-4336-7350
- first_name: Falko
full_name: Dressler, Falko
last_name: Dressler
- first_name: Markus
full_name: Eisenbarth, Markus
last_name: Eisenbarth
- first_name: Jakob
full_name: Andert, Jakob
last_name: Andert
citation:
ama: 'Reinold P, Meyer N, Buse D, et al. Verkehrssimulation im Hardware-in-the-Loop-Steuergerätetest.
In: Proceedings. Wiesbaden; 2019. doi:10.1007/978-3-658-25294-6_15'
apa: Reinold, P., Meyer, N., Buse, D., Klingler, F., Sommer, C., Dressler, F., …
Andert, J. (2019). Verkehrssimulation im Hardware-in-the-Loop-Steuergerätetest.
In Proceedings. Wiesbaden. https://doi.org/10.1007/978-3-658-25294-6_15
bibtex: '@inbook{Reinold_Meyer_Buse_Klingler_Sommer_Dressler_Eisenbarth_Andert_2019,
place={Wiesbaden}, title={Verkehrssimulation im Hardware-in-the-Loop-Steuergerätetest},
DOI={10.1007/978-3-658-25294-6_15},
booktitle={Proceedings}, author={Reinold, Peter and Meyer, Norbert and Buse, Dominik
and Klingler, Florian and Sommer, Christoph and Dressler, Falko and Eisenbarth,
Markus and Andert, Jakob}, year={2019} }'
chicago: Reinold, Peter, Norbert Meyer, Dominik Buse, Florian Klingler, Christoph
Sommer, Falko Dressler, Markus Eisenbarth, and Jakob Andert. “Verkehrssimulation
Im Hardware-in-the-Loop-Steuergerätetest.” In Proceedings. Wiesbaden, 2019.
https://doi.org/10.1007/978-3-658-25294-6_15.
ieee: P. Reinold et al., “Verkehrssimulation im Hardware-in-the-Loop-Steuergerätetest,”
in Proceedings, Wiesbaden, 2019.
mla: Reinold, Peter, et al. “Verkehrssimulation Im Hardware-in-the-Loop-Steuergerätetest.”
Proceedings, 2019, doi:10.1007/978-3-658-25294-6_15.
short: 'P. Reinold, N. Meyer, D. Buse, F. Klingler, C. Sommer, F. Dressler, M. Eisenbarth,
J. Andert, in: Proceedings, Wiesbaden, 2019.'
date_created: 2019-07-18T09:54:37Z
date_updated: 2022-01-06T06:51:16Z
department:
- _id: '589'
doi: 10.1007/978-3-658-25294-6_15
language:
- iso: eng
place: Wiesbaden
publication: Proceedings
publication_identifier:
isbn:
- '9783658252939'
- '9783658252946'
issn:
- 2198-7432
- 2198-7440
publication_status: published
status: public
title: Verkehrssimulation im Hardware-in-the-Loop-Steuergerätetest
type: book_chapter
user_id: '49154'
year: '2019'
...
---
_id: '12072'
author:
- first_name: Christoph
full_name: Sommer, Christoph
id: '49154'
last_name: Sommer
orcid: 0000-0002-4336-7350
- first_name: David
full_name: Eckhoff, David
last_name: Eckhoff
- first_name: Alexander
full_name: Brummer, Alexander
last_name: Brummer
- first_name: Dominik S.
full_name: Buse, Dominik S.
last_name: Buse
- first_name: Florian
full_name: Hagenauer, Florian
last_name: Hagenauer
- first_name: Stefan
full_name: Joerer, Stefan
last_name: Joerer
- first_name: Michele
full_name: Segata, Michele
last_name: Segata
citation:
ama: 'Sommer C, Eckhoff D, Brummer A, et al. Veins: The Open Source Vehicular Network
Simulation Framework. In: Recent Advances in Network Simulation. Cham;
2019. doi:10.1007/978-3-030-12842-5_6'
apa: 'Sommer, C., Eckhoff, D., Brummer, A., Buse, D. S., Hagenauer, F., Joerer,
S., & Segata, M. (2019). Veins: The Open Source Vehicular Network Simulation
Framework. In Recent Advances in Network Simulation. Cham. https://doi.org/10.1007/978-3-030-12842-5_6'
bibtex: '@inbook{Sommer_Eckhoff_Brummer_Buse_Hagenauer_Joerer_Segata_2019, place={Cham},
title={Veins: The Open Source Vehicular Network Simulation Framework}, DOI={10.1007/978-3-030-12842-5_6},
booktitle={Recent Advances in Network Simulation}, author={Sommer, Christoph and
Eckhoff, David and Brummer, Alexander and Buse, Dominik S. and Hagenauer, Florian
and Joerer, Stefan and Segata, Michele}, year={2019} }'
chicago: 'Sommer, Christoph, David Eckhoff, Alexander Brummer, Dominik S. Buse,
Florian Hagenauer, Stefan Joerer, and Michele Segata. “Veins: The Open Source
Vehicular Network Simulation Framework.” In Recent Advances in Network Simulation.
Cham, 2019. https://doi.org/10.1007/978-3-030-12842-5_6.'
ieee: 'C. Sommer et al., “Veins: The Open Source Vehicular Network Simulation
Framework,” in Recent Advances in Network Simulation, Cham, 2019.'
mla: 'Sommer, Christoph, et al. “Veins: The Open Source Vehicular Network Simulation
Framework.” Recent Advances in Network Simulation, 2019, doi:10.1007/978-3-030-12842-5_6.'
short: 'C. Sommer, D. Eckhoff, A. Brummer, D.S. Buse, F. Hagenauer, S. Joerer, M.
Segata, in: Recent Advances in Network Simulation, Cham, 2019.'
date_created: 2019-07-18T09:55:53Z
date_updated: 2022-01-06T06:51:16Z
department:
- _id: '589'
doi: 10.1007/978-3-030-12842-5_6
language:
- iso: eng
place: Cham
publication: Recent Advances in Network Simulation
publication_identifier:
isbn:
- '9783030128418'
- '9783030128425'
issn:
- 2522-8595
- 2522-8609
publication_status: published
status: public
title: 'Veins: The Open Source Vehicular Network Simulation Framework'
type: book_chapter
user_id: '49154'
year: '2019'
...
---
_id: '12076'
author:
- first_name: Enes
full_name: Yigitbas, Enes
id: '8447'
last_name: Yigitbas
orcid: 0000-0002-5967-833X
- first_name: Joshua
full_name: Heindörfer, Joshua
last_name: Heindörfer
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
citation:
ama: 'Yigitbas E, Heindörfer J, Engels G. A Context-aware Virtual Reality First
Aid Training Application. In: Proceedings of the Mensch Und Computer 2019 (MuC
’19). ACM; 2019:885--888.'
apa: Yigitbas, E., Heindörfer, J., & Engels, G. (2019). A Context-aware Virtual
Reality First Aid Training Application. In Proceedings of the Mensch und Computer
2019 (MuC ’19) (pp. 885--888). ACM.
bibtex: '@inproceedings{Yigitbas_Heindörfer_Engels_2019, title={A Context-aware
Virtual Reality First Aid Training Application}, booktitle={Proceedings of the
Mensch und Computer 2019 (MuC ’19)}, publisher={ACM}, author={Yigitbas, Enes and
Heindörfer, Joshua and Engels, Gregor}, year={2019}, pages={885--888} }'
chicago: Yigitbas, Enes, Joshua Heindörfer, and Gregor Engels. “A Context-Aware
Virtual Reality First Aid Training Application.” In Proceedings of the Mensch
Und Computer 2019 (MuC ’19), 885--888. ACM, 2019.
ieee: E. Yigitbas, J. Heindörfer, and G. Engels, “A Context-aware Virtual Reality
First Aid Training Application,” in Proceedings of the Mensch und Computer
2019 (MuC ’19), 2019, pp. 885--888.
mla: Yigitbas, Enes, et al. “A Context-Aware Virtual Reality First Aid Training
Application.” Proceedings of the Mensch Und Computer 2019 (MuC ’19), ACM,
2019, pp. 885--888.
short: 'E. Yigitbas, J. Heindörfer, G. Engels, in: Proceedings of the Mensch Und
Computer 2019 (MuC ’19), ACM, 2019, pp. 885--888.'
date_created: 2019-07-18T13:59:33Z
date_updated: 2022-01-06T06:51:16Z
department:
- _id: '66'
- _id: '534'
language:
- iso: eng
page: 885--888
publication: Proceedings of the Mensch und Computer 2019 (MuC ’19)
publisher: ACM
status: public
title: A Context-aware Virtual Reality First Aid Training Application
type: conference
user_id: '8447'
year: '2019'
...
---
_id: '12870'
author:
- first_name: Björn
full_name: Feldkord, Björn
id: '22704'
last_name: Feldkord
- first_name: Till
full_name: Knollmann, Till
id: '39241'
last_name: Knollmann
orcid: 0000-0003-2014-4696
- first_name: Manuel
full_name: Malatyali, Manuel
last_name: Malatyali
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Feldkord B, Knollmann T, Malatyali M, Meyer auf der Heide F. Managing Multiple
Mobile Resources. In: Proceedings of the 17th Workshop on Approximation and
Online Algorithms (WAOA). Springer; 2019:120-137. doi:10.1007/978-3-030-39479-0_9'
apa: Feldkord, B., Knollmann, T., Malatyali, M., & Meyer auf der Heide, F. (2019).
Managing Multiple Mobile Resources. In Proceedings of the 17th Workshop on
Approximation and Online Algorithms (WAOA) (pp. 120–137). Springer. https://doi.org/10.1007/978-3-030-39479-0_9
bibtex: '@inproceedings{Feldkord_Knollmann_Malatyali_Meyer auf der Heide_2019, title={Managing
Multiple Mobile Resources}, DOI={10.1007/978-3-030-39479-0_9},
booktitle={Proceedings of the 17th Workshop on Approximation and Online Algorithms
(WAOA)}, publisher={Springer}, author={Feldkord, Björn and Knollmann, Till and
Malatyali, Manuel and Meyer auf der Heide, Friedhelm}, year={2019}, pages={120–137}
}'
chicago: Feldkord, Björn, Till Knollmann, Manuel Malatyali, and Friedhelm Meyer
auf der Heide. “Managing Multiple Mobile Resources.” In Proceedings of the
17th Workshop on Approximation and Online Algorithms (WAOA), 120–37. Springer,
2019. https://doi.org/10.1007/978-3-030-39479-0_9.
ieee: B. Feldkord, T. Knollmann, M. Malatyali, and F. Meyer auf der Heide, “Managing
Multiple Mobile Resources,” in Proceedings of the 17th Workshop on Approximation
and Online Algorithms (WAOA), 2019, pp. 120–137.
mla: Feldkord, Björn, et al. “Managing Multiple Mobile Resources.” Proceedings
of the 17th Workshop on Approximation and Online Algorithms (WAOA), Springer,
2019, pp. 120–37, doi:10.1007/978-3-030-39479-0_9.
short: 'B. Feldkord, T. Knollmann, M. Malatyali, F. Meyer auf der Heide, in: Proceedings
of the 17th Workshop on Approximation and Online Algorithms (WAOA), Springer,
2019, pp. 120–137.'
date_created: 2019-07-22T09:00:05Z
date_updated: 2022-01-06T06:51:20Z
department:
- _id: '63'
doi: 10.1007/978-3-030-39479-0_9
external_id:
arxiv:
- '1907.09834'
language:
- iso: eng
page: 120 - 137
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 17th Workshop on Approximation and Online Algorithms
(WAOA)
publication_status: published
publisher: Springer
status: public
title: Managing Multiple Mobile Resources
type: conference
user_id: '22704'
year: '2019'
...