---
_id: '34047'
abstract:
- lang: eng
text: "News articles both shape and reflect public opinion across the political\r\nspectrum.
Analyzing them for social bias can thus provide valuable insights,\r\nsuch as
prevailing stereotypes in society and the media, which are often\r\nadopted by
NLP models trained on respective data. Recent work has relied on\r\nword embedding
bias measures, such as WEAT. However, several representation\r\nissues of embeddings
can harm the measures' accuracy, including low-resource\r\nsettings and token
frequency differences. In this work, we study what kind of\r\nembedding algorithm
serves best to accurately measure types of social bias\r\nknown to exist in US
online news articles. To cover the whole spectrum of\r\npolitical bias in the
US, we collect 500k articles and review psychology\r\nliterature with respect
to expected social bias. We then quantify social bias\r\nusing WEAT along with
embedding algorithms that account for the aforementioned\r\nissues. We compare
how models trained with the algorithms on news articles\r\nrepresent the expected
social bias. Our results suggest that the standard way\r\nto quantify bias does
not align well with knowledge from psychology. While the\r\nproposed algorithms
reduce the~gap, they still do not fully match the\r\nliterature."
author:
- first_name: Maximilian
full_name: Spliethöver, Maximilian
last_name: Spliethöver
- first_name: Maximilian
full_name: Keiff, Maximilian
last_name: Keiff
- first_name: Henning
full_name: Wachsmuth, Henning
last_name: Wachsmuth
citation:
ama: 'Spliethöver M, Keiff M, Wachsmuth H. No Word Embedding Model Is Perfect: Evaluating
the Representation Accuracy for Social Bias in the Media. In: Proceedings
of The 2022 Conference on Empirical Methods in Natural Language Processing (EMNLP
2022). Association for Computational Linguistics; 2022.'
apa: 'Spliethöver, M., Keiff, M., & Wachsmuth, H. (2022). No Word Embedding
Model Is Perfect: Evaluating the Representation Accuracy for Social Bias in the
Media. Proceedings of The 2022 Conference on Empirical Methods in Natural Language
Processing (EMNLP 2022). The 2022 Conference on Empirical Methods in Natural
Language Processing (EMNLP 2022), Abu Dhabi.'
bibtex: '@inproceedings{Spliethöver_Keiff_Wachsmuth_2022, title={No Word Embedding
Model Is Perfect: Evaluating the Representation Accuracy for Social Bias in the
Media}, booktitle={Proceedings of The 2022 Conference on Empirical Methods in
Natural Language Processing (EMNLP 2022)}, publisher={Association for Computational
Linguistics}, author={Spliethöver, Maximilian and Keiff, Maximilian and Wachsmuth,
Henning}, year={2022} }'
chicago: 'Spliethöver, Maximilian, Maximilian Keiff, and Henning Wachsmuth. “No
Word Embedding Model Is Perfect: Evaluating the Representation Accuracy for Social
Bias in the Media.” In Proceedings of The 2022 Conference on Empirical Methods
in Natural Language Processing (EMNLP 2022). Association for Computational
Linguistics, 2022.'
ieee: 'M. Spliethöver, M. Keiff, and H. Wachsmuth, “No Word Embedding Model Is Perfect:
Evaluating the Representation Accuracy for Social Bias in the Media,” presented
at the The 2022 Conference on Empirical Methods in Natural Language Processing
(EMNLP 2022), Abu Dhabi, 2022.'
mla: 'Spliethöver, Maximilian, et al. “No Word Embedding Model Is Perfect: Evaluating
the Representation Accuracy for Social Bias in the Media.” Proceedings of
The 2022 Conference on Empirical Methods in Natural Language Processing (EMNLP
2022), Association for Computational Linguistics, 2022.'
short: 'M. Spliethöver, M. Keiff, H. Wachsmuth, in: Proceedings of The 2022 Conference
on Empirical Methods in Natural Language Processing (EMNLP 2022), Association
for Computational Linguistics, 2022.'
conference:
end_date: 2022-12-11
location: Abu Dhabi
name: The 2022 Conference on Empirical Methods in Natural Language Processing (EMNLP
2022)
start_date: 2022-12-07
date_created: 2022-11-10T08:28:53Z
date_updated: 2022-11-11T12:49:47Z
department:
- _id: '600'
extern: '1'
external_id:
arxiv:
- '2211.03634'
language:
- iso: eng
publication: Proceedings of The 2022 Conference on Empirical Methods in Natural Language
Processing (EMNLP 2022)
publisher: Association for Computational Linguistics
status: public
title: 'No Word Embedding Model Is Perfect: Evaluating the Representation Accuracy
for Social Bias in the Media'
type: conference
user_id: '84035'
year: '2022'
...
---
_id: '34077'
alternative_title:
- Extended Abstract
author:
- first_name: Alexander
full_name: Bondarenko, Alexander
last_name: Bondarenko
- first_name: Maik
full_name: Fröbe, Maik
last_name: Fröbe
- first_name: Johannes
full_name: Kiesel, Johannes
last_name: Kiesel
- first_name: Shahbaz
full_name: Syed, Shahbaz
last_name: Syed
- first_name: Timon
full_name: Gurcke, Timon
last_name: Gurcke
- first_name: Meriem
full_name: Beloucif, Meriem
last_name: Beloucif
- first_name: Alexander
full_name: Panchenko, Alexander
last_name: Panchenko
- first_name: Chris
full_name: Biemann, Chris
last_name: Biemann
- first_name: Benno
full_name: Stein, Benno
last_name: Stein
- first_name: Henning
full_name: Wachsmuth, Henning
last_name: Wachsmuth
- first_name: Martin
full_name: Potthast, Martin
last_name: Potthast
- first_name: Matthias
full_name: Hagen, Matthias
last_name: Hagen
citation:
ama: 'Bondarenko A, Fröbe M, Kiesel J, et al. Overview of Touché 2022: Argument
Retrieval. In: Lecture Notes in Computer Science. Springer International
Publishing; 2022. doi:10.1007/978-3-030-99739-7_43'
apa: 'Bondarenko, A., Fröbe, M., Kiesel, J., Syed, S., Gurcke, T., Beloucif, M.,
Panchenko, A., Biemann, C., Stein, B., Wachsmuth, H., Potthast, M., & Hagen,
M. (2022). Overview of Touché 2022: Argument Retrieval. In Lecture Notes in
Computer Science. Springer International Publishing. https://doi.org/10.1007/978-3-030-99739-7_43'
bibtex: '@inbook{Bondarenko_Fröbe_Kiesel_Syed_Gurcke_Beloucif_Panchenko_Biemann_Stein_Wachsmuth_et
al._2022, place={Cham}, title={Overview of Touché 2022: Argument Retrieval}, DOI={10.1007/978-3-030-99739-7_43},
booktitle={Lecture Notes in Computer Science}, publisher={Springer International
Publishing}, author={Bondarenko, Alexander and Fröbe, Maik and Kiesel, Johannes
and Syed, Shahbaz and Gurcke, Timon and Beloucif, Meriem and Panchenko, Alexander
and Biemann, Chris and Stein, Benno and Wachsmuth, Henning and et al.}, year={2022}
}'
chicago: 'Bondarenko, Alexander, Maik Fröbe, Johannes Kiesel, Shahbaz Syed, Timon
Gurcke, Meriem Beloucif, Alexander Panchenko, et al. “Overview of Touché 2022:
Argument Retrieval.” In Lecture Notes in Computer Science. Cham: Springer
International Publishing, 2022. https://doi.org/10.1007/978-3-030-99739-7_43.'
ieee: 'A. Bondarenko et al., “Overview of Touché 2022: Argument Retrieval,”
in Lecture Notes in Computer Science, Cham: Springer International Publishing,
2022.'
mla: 'Bondarenko, Alexander, et al. “Overview of Touché 2022: Argument Retrieval.”
Lecture Notes in Computer Science, Springer International Publishing, 2022,
doi:10.1007/978-3-030-99739-7_43.'
short: 'A. Bondarenko, M. Fröbe, J. Kiesel, S. Syed, T. Gurcke, M. Beloucif, A.
Panchenko, C. Biemann, B. Stein, H. Wachsmuth, M. Potthast, M. Hagen, in: Lecture
Notes in Computer Science, Springer International Publishing, Cham, 2022.'
date_created: 2022-11-14T13:47:51Z
date_updated: 2022-11-14T13:48:38Z
department:
- _id: '600'
doi: 10.1007/978-3-030-99739-7_43
place: Cham
publication: Lecture Notes in Computer Science
publication_identifier:
isbn:
- '9783030997380'
- '9783030997397'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer International Publishing
status: public
title: 'Overview of Touché 2022: Argument Retrieval'
type: book_chapter
user_id: '52174'
year: '2022'
...
---
_id: '32602'
author:
- first_name: Andreas
full_name: Padalkin, Andreas
id: '88238'
last_name: Padalkin
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Daniel
full_name: Warner, Daniel
id: '3902'
last_name: Warner
citation:
ama: 'Padalkin A, Scheideler C, Warner D. The Structural Power of Reconfigurable
Circuits in the Amoebot Model. In: Ouldridge TE, Wickham SFJ, eds. 28th International
Conference on DNA Computing and Molecular Programming (DNA 28). Vol 238. Leibniz
International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl – Leibniz-Zentrum
für Informatik; 2022:8:1–8:22. doi:10.4230/LIPIcs.DNA.28.8'
apa: Padalkin, A., Scheideler, C., & Warner, D. (2022). The Structural Power
of Reconfigurable Circuits in the Amoebot Model. In T. E. Ouldridge & S. F.
J. Wickham (Eds.), 28th International Conference on DNA Computing and Molecular
Programming (DNA 28) (Vol. 238, p. 8:1–8:22). Schloss Dagstuhl – Leibniz-Zentrum
für Informatik. https://doi.org/10.4230/LIPIcs.DNA.28.8
bibtex: '@inproceedings{Padalkin_Scheideler_Warner_2022, place={Dagstuhl, Germany},
series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={The
Structural Power of Reconfigurable Circuits in the Amoebot Model}, volume={238},
DOI={10.4230/LIPIcs.DNA.28.8},
booktitle={28th International Conference on DNA Computing and Molecular Programming
(DNA 28)}, publisher={Schloss Dagstuhl – Leibniz-Zentrum für Informatik}, author={Padalkin,
Andreas and Scheideler, Christian and Warner, Daniel}, editor={Ouldridge, Thomas
E. and Wickham, Shelley F. J.}, year={2022}, pages={8:1–8:22}, collection={Leibniz
International Proceedings in Informatics (LIPIcs)} }'
chicago: 'Padalkin, Andreas, Christian Scheideler, and Daniel Warner. “The Structural
Power of Reconfigurable Circuits in the Amoebot Model.” In 28th International
Conference on DNA Computing and Molecular Programming (DNA 28), edited by
Thomas E. Ouldridge and Shelley F. J. Wickham, 238:8:1–8:22. Leibniz International
Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Zentrum
für Informatik, 2022. https://doi.org/10.4230/LIPIcs.DNA.28.8.'
ieee: 'A. Padalkin, C. Scheideler, and D. Warner, “The Structural Power of Reconfigurable
Circuits in the Amoebot Model,” in 28th International Conference on DNA Computing
and Molecular Programming (DNA 28), 2022, vol. 238, p. 8:1–8:22, doi: 10.4230/LIPIcs.DNA.28.8.'
mla: Padalkin, Andreas, et al. “The Structural Power of Reconfigurable Circuits
in the Amoebot Model.” 28th International Conference on DNA Computing and Molecular
Programming (DNA 28), edited by Thomas E. Ouldridge and Shelley F. J. Wickham,
vol. 238, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022, p. 8:1–8:22,
doi:10.4230/LIPIcs.DNA.28.8.
short: 'A. Padalkin, C. Scheideler, D. Warner, in: T.E. Ouldridge, S.F.J. Wickham
(Eds.), 28th International Conference on DNA Computing and Molecular Programming
(DNA 28), Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl, Germany,
2022, p. 8:1–8:22.'
date_created: 2022-08-08T17:32:19Z
date_updated: 2022-11-17T14:18:24Z
department:
- _id: '79'
doi: 10.4230/LIPIcs.DNA.28.8
editor:
- first_name: Thomas E.
full_name: Ouldridge, Thomas E.
last_name: Ouldridge
- first_name: Shelley F. J.
full_name: Wickham, Shelley F. J.
last_name: Wickham
intvolume: ' 238'
language:
- iso: eng
page: 8:1–8:22
place: Dagstuhl, Germany
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '2'
name: 'SFB 901 - A: SFB 901 - Project Area A'
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
- _id: '5'
name: 'SFB 901 - A1: SFB 901 - Subproject A1'
- _id: '13'
name: 'SFB 901 - C1: SFB 901 - Subproject C1'
publication: 28th International Conference on DNA Computing and Molecular Programming
(DNA 28)
publication_identifier:
isbn:
- 978-3-95977-253-2
issn:
- 1868-8969
publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
series_title: Leibniz International Proceedings in Informatics (LIPIcs)
status: public
title: The Structural Power of Reconfigurable Circuits in the Amoebot Model
type: conference
user_id: '477'
volume: 238
year: '2022'
...
---
_id: '32603'
author:
- first_name: Irina
full_name: Kostitsyna, Irina
last_name: Kostitsyna
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Daniel
full_name: Warner, Daniel
id: '3902'
last_name: Warner
citation:
ama: 'Kostitsyna I, Scheideler C, Warner D. Fault-Tolerant Shape Formation in the
Amoebot Model. In: Ouldridge TE, Wickham SFJ, eds. 28th International Conference
on DNA Computing and Molecular Programming (DNA 28). Vol 238. Leibniz International
Proceedings in Informatics (LIPIcs). Schloss Dagstuhl – Leibniz-Zentrum für Informatik;
2022:9:1–9:22. doi:10.4230/LIPIcs.DNA.28.9'
apa: Kostitsyna, I., Scheideler, C., & Warner, D. (2022). Fault-Tolerant Shape
Formation in the Amoebot Model. In T. E. Ouldridge & S. F. J. Wickham (Eds.),
28th International Conference on DNA Computing and Molecular Programming (DNA
28) (Vol. 238, p. 9:1–9:22). Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPIcs.DNA.28.9
bibtex: '@inproceedings{Kostitsyna_Scheideler_Warner_2022, place={Dagstuhl, Germany},
series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={Fault-Tolerant
Shape Formation in the Amoebot Model}, volume={238}, DOI={10.4230/LIPIcs.DNA.28.9},
booktitle={28th International Conference on DNA Computing and Molecular Programming
(DNA 28)}, publisher={Schloss Dagstuhl – Leibniz-Zentrum für Informatik}, author={Kostitsyna,
Irina and Scheideler, Christian and Warner, Daniel}, editor={Ouldridge, Thomas
E. and Wickham, Shelley F. J.}, year={2022}, pages={9:1–9:22}, collection={Leibniz
International Proceedings in Informatics (LIPIcs)} }'
chicago: 'Kostitsyna, Irina, Christian Scheideler, and Daniel Warner. “Fault-Tolerant
Shape Formation in the Amoebot Model.” In 28th International Conference on
DNA Computing and Molecular Programming (DNA 28), edited by Thomas E. Ouldridge
and Shelley F. J. Wickham, 238:9:1–9:22. Leibniz International Proceedings in
Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Zentrum für
Informatik, 2022. https://doi.org/10.4230/LIPIcs.DNA.28.9.'
ieee: 'I. Kostitsyna, C. Scheideler, and D. Warner, “Fault-Tolerant Shape Formation
in the Amoebot Model,” in 28th International Conference on DNA Computing and
Molecular Programming (DNA 28), 2022, vol. 238, p. 9:1–9:22, doi: 10.4230/LIPIcs.DNA.28.9.'
mla: Kostitsyna, Irina, et al. “Fault-Tolerant Shape Formation in the Amoebot Model.”
28th International Conference on DNA Computing and Molecular Programming (DNA
28), edited by Thomas E. Ouldridge and Shelley F. J. Wickham, vol. 238, Schloss
Dagstuhl – Leibniz-Zentrum für Informatik, 2022, p. 9:1–9:22, doi:10.4230/LIPIcs.DNA.28.9.
short: 'I. Kostitsyna, C. Scheideler, D. Warner, in: T.E. Ouldridge, S.F.J. Wickham
(Eds.), 28th International Conference on DNA Computing and Molecular Programming
(DNA 28), Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl, Germany,
2022, p. 9:1–9:22.'
date_created: 2022-08-08T17:42:43Z
date_updated: 2022-11-17T14:17:09Z
department:
- _id: '79'
doi: 10.4230/LIPIcs.DNA.28.9
editor:
- first_name: Thomas E.
full_name: Ouldridge, Thomas E.
last_name: Ouldridge
- first_name: Shelley F. J.
full_name: Wickham, Shelley F. J.
last_name: Wickham
intvolume: ' 238'
language:
- iso: eng
page: 9:1–9:22
place: Dagstuhl, Germany
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
- _id: '13'
name: 'SFB 901 - C1: SFB 901 - Subproject C1'
publication: 28th International Conference on DNA Computing and Molecular Programming
(DNA 28)
publication_identifier:
isbn:
- 978-3-95977-253-2
issn:
- 1868-8969
publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
series_title: Leibniz International Proceedings in Informatics (LIPIcs)
status: public
title: Fault-Tolerant Shape Formation in the Amoebot Model
type: conference
user_id: '477'
volume: 238
year: '2022'
...
---
_id: '32811'
abstract:
- lang: eng
text: 'The decentralized nature of multi-agent systems requires continuous data
exchange to achieve global objectives. In such scenarios, Age of Information (AoI)
has become an important metric of the freshness of exchanged data due to the error-proneness
and delays of communication systems. Communication systems usually possess dependencies:
the process describing the success or failure of communication is highly correlated
when these attempts are ``close'''' in some domain (e.g. in time, frequency, space
or code as in wireless communication) and is, in general, non-stationary. To study
AoI in such scenarios, we consider an abstract event-based AoI process $\Delta(n)$,
expressing time since the last update: If, at time $n$, a monitoring node receives
a status update from a source node (event $A(n-1)$ occurs), then $\Delta(n)$ is
reset to one; otherwise, $\Delta(n)$ grows linearly in time. This AoI process
can thus be viewed as a special random walk with resets. The event process $A(n)$
may be nonstationary and we merely assume that its temporal dependencies decay
sufficiently, described by $\alpha$-mixing. We calculate moment bounds for the
resulting AoI process as a function of the mixing rate of $A(n)$. Furthermore,
we prove that the AoI process $\Delta(n)$ is itself $\alpha$-mixing from which
we conclude a strong law of large numbers for $\Delta(n)$. These results are new,
since AoI processes have not been studied so far in this general strongly mixing
setting. This opens up future work on renewal processes with non-independent interarrival
times.'
author:
- first_name: Adrian
full_name: Redder, Adrian
id: '52265'
last_name: Redder
orcid: https://orcid.org/0000-0001-7391-4688
- first_name: Arunselvan
full_name: Ramaswamy, Arunselvan
id: '66937'
last_name: Ramaswamy
orcid: https://orcid.org/ 0000-0001-7547-8111
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Redder A, Ramaswamy A, Karl H. Age of Information Process under Strongly Mixing
Communication -- Moment Bound, Mixing Rate and Strong Law. In: Proceedings
of the 58th Allerton Conference on Communication, Control, and Computing.
; 2022.'
apa: Redder, A., Ramaswamy, A., & Karl, H. (2022). Age of Information Process
under Strongly Mixing Communication -- Moment Bound, Mixing Rate and Strong Law.
Proceedings of the 58th Allerton Conference on Communication, Control, and
Computing. 58th Allerton Conference on Communication, Control, and Computing.
bibtex: '@inproceedings{Redder_Ramaswamy_Karl_2022, title={Age of Information Process
under Strongly Mixing Communication -- Moment Bound, Mixing Rate and Strong Law},
booktitle={Proceedings of the 58th Allerton Conference on Communication, Control,
and Computing}, author={Redder, Adrian and Ramaswamy, Arunselvan and Karl, Holger},
year={2022} }'
chicago: Redder, Adrian, Arunselvan Ramaswamy, and Holger Karl. “Age of Information
Process under Strongly Mixing Communication -- Moment Bound, Mixing Rate and Strong
Law.” In Proceedings of the 58th Allerton Conference on Communication, Control,
and Computing, 2022.
ieee: A. Redder, A. Ramaswamy, and H. Karl, “Age of Information Process under Strongly
Mixing Communication -- Moment Bound, Mixing Rate and Strong Law,” presented at
the 58th Allerton Conference on Communication, Control, and Computing, 2022.
mla: Redder, Adrian, et al. “Age of Information Process under Strongly Mixing Communication
-- Moment Bound, Mixing Rate and Strong Law.” Proceedings of the 58th Allerton
Conference on Communication, Control, and Computing, 2022.
short: 'A. Redder, A. Ramaswamy, H. Karl, in: Proceedings of the 58th Allerton Conference
on Communication, Control, and Computing, 2022.'
conference:
name: 58th Allerton Conference on Communication, Control, and Computing
date_created: 2022-08-15T09:59:17Z
date_updated: 2022-11-18T09:31:19Z
ddc:
- '000'
department:
- _id: '75'
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '16'
name: 'SFB 901 - C4: SFB 901 - Subproject C4'
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
publication: Proceedings of the 58th Allerton Conference on Communication, Control,
and Computing
status: public
title: Age of Information Process under Strongly Mixing Communication -- Moment Bound,
Mixing Rate and Strong Law
type: conference
user_id: '477'
year: '2022'
...
---
_id: '30793'
author:
- first_name: Adrian
full_name: Redder, Adrian
id: '52265'
last_name: Redder
orcid: https://orcid.org/0000-0001-7391-4688
- first_name: Arunselvan
full_name: Ramaswamy, Arunselvan
id: '66937'
last_name: Ramaswamy
orcid: https://orcid.org/ 0000-0001-7547-8111
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Redder A, Ramaswamy A, Karl H. Multi-agent Policy Gradient Algorithms for
Cyber-physical Systems with Lossy Communication. In: Proceedings of the 14th
International Conference on Agents and Artificial Intelligence. SCITEPRESS
- Science and Technology Publications; 2022. doi:10.5220/0010845400003116'
apa: Redder, A., Ramaswamy, A., & Karl, H. (2022). Multi-agent Policy Gradient
Algorithms for Cyber-physical Systems with Lossy Communication. Proceedings
of the 14th International Conference on Agents and Artificial Intelligence.
https://doi.org/10.5220/0010845400003116
bibtex: '@inproceedings{Redder_Ramaswamy_Karl_2022, title={Multi-agent Policy Gradient
Algorithms for Cyber-physical Systems with Lossy Communication}, DOI={10.5220/0010845400003116},
booktitle={Proceedings of the 14th International Conference on Agents and Artificial
Intelligence}, publisher={SCITEPRESS - Science and Technology Publications}, author={Redder,
Adrian and Ramaswamy, Arunselvan and Karl, Holger}, year={2022} }'
chicago: Redder, Adrian, Arunselvan Ramaswamy, and Holger Karl. “Multi-Agent Policy
Gradient Algorithms for Cyber-Physical Systems with Lossy Communication.” In Proceedings
of the 14th International Conference on Agents and Artificial Intelligence.
SCITEPRESS - Science and Technology Publications, 2022. https://doi.org/10.5220/0010845400003116.
ieee: 'A. Redder, A. Ramaswamy, and H. Karl, “Multi-agent Policy Gradient Algorithms
for Cyber-physical Systems with Lossy Communication,” 2022, doi: 10.5220/0010845400003116.'
mla: Redder, Adrian, et al. “Multi-Agent Policy Gradient Algorithms for Cyber-Physical
Systems with Lossy Communication.” Proceedings of the 14th International Conference
on Agents and Artificial Intelligence, SCITEPRESS - Science and Technology
Publications, 2022, doi:10.5220/0010845400003116.
short: 'A. Redder, A. Ramaswamy, H. Karl, in: Proceedings of the 14th International
Conference on Agents and Artificial Intelligence, SCITEPRESS - Science and Technology
Publications, 2022.'
date_created: 2022-04-06T07:18:36Z
date_updated: 2022-11-18T09:32:14Z
ddc:
- '006'
department:
- _id: '75'
doi: 10.5220/0010845400003116
file:
- access_level: closed
content_type: application/pdf
creator: aredder
date_created: 2022-08-31T07:10:13Z
date_updated: 2022-08-31T07:10:13Z
file_id: '33237'
file_name: ICCART2022.pdf
file_size: 298926
relation: main_file
success: 1
file_date_updated: 2022-08-31T07:10:13Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '16'
name: 'SFB 901 - C4: SFB 901 - Subproject C4'
- _id: '24'
name: 'NICCI-CN: Netzgewahre Regelung & regelungsgewahre Netze'
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
publication: Proceedings of the 14th International Conference on Agents and Artificial
Intelligence
publication_status: published
publisher: SCITEPRESS - Science and Technology Publications
status: public
title: Multi-agent Policy Gradient Algorithms for Cyber-physical Systems with Lossy
Communication
type: conference
user_id: '477'
year: '2022'
...
---
_id: '30790'
abstract:
- lang: eng
text: "Iterative distributed optimization algorithms involve multiple agents that\r\ncommunicate
with each other, over time, in order to minimize/maximize a global\r\nobjective.
In the presence of unreliable communication networks, the\r\nAge-of-Information
(AoI), which measures the freshness of data received, may be\r\nlarge and hence
hinder algorithmic convergence. In this paper, we study the\r\nconvergence of
general distributed gradient-based optimization algorithms in\r\nthe presence
of communication that neither happens periodically nor at\r\nstochastically independent
points in time. We show that convergence is\r\nguaranteed provided the random
variables associated with the AoI processes are\r\nstochastically dominated by
a random variable with finite first moment. This\r\nimproves on previous requirements
of boundedness of more than the first moment.\r\nWe then introduce stochastically
strongly connected (SSC) networks, a new\r\nstochastic form of strong connectedness
for time-varying networks. We show: If\r\nfor any $p \\ge0$ the processes that
describe the success of communication\r\nbetween agents in a SSC network are $\\alpha$-mixing
with $n^{p-1}\\alpha(n)$\r\nsummable, then the associated AoI processes are stochastically
dominated by a\r\nrandom variable with finite $p$-th moment. In combination with
our first\r\ncontribution, this implies that distributed stochastic gradient descend\r\nconverges
in the presence of AoI, if $\\alpha(n)$ is summable."
author:
- first_name: Adrian
full_name: Redder, Adrian
id: '52265'
last_name: Redder
orcid: https://orcid.org/0000-0001-7391-4688
- first_name: Arunselvan
full_name: Ramaswamy, Arunselvan
id: '66937'
last_name: Ramaswamy
orcid: https://orcid.org/ 0000-0001-7547-8111
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: Redder A, Ramaswamy A, Karl H. Distributed gradient-based optimization in the
presence of dependent aperiodic communication. arXiv:220111343. Published
online 2022.
apa: Redder, A., Ramaswamy, A., & Karl, H. (2022). Distributed gradient-based
optimization in the presence of dependent aperiodic communication. In arXiv:2201.11343.
bibtex: '@article{Redder_Ramaswamy_Karl_2022, title={Distributed gradient-based
optimization in the presence of dependent aperiodic communication}, journal={arXiv:2201.11343},
author={Redder, Adrian and Ramaswamy, Arunselvan and Karl, Holger}, year={2022}
}'
chicago: Redder, Adrian, Arunselvan Ramaswamy, and Holger Karl. “Distributed Gradient-Based
Optimization in the Presence of Dependent Aperiodic Communication.” ArXiv:2201.11343,
2022.
ieee: A. Redder, A. Ramaswamy, and H. Karl, “Distributed gradient-based optimization
in the presence of dependent aperiodic communication,” arXiv:2201.11343.
2022.
mla: Redder, Adrian, et al. “Distributed Gradient-Based Optimization in the Presence
of Dependent Aperiodic Communication.” ArXiv:2201.11343, 2022.
short: A. Redder, A. Ramaswamy, H. Karl, ArXiv:2201.11343 (2022).
date_created: 2022-04-06T06:53:38Z
date_updated: 2022-11-18T09:33:01Z
department:
- _id: '75'
external_id:
arxiv:
- '2201.11343'
language:
- iso: eng
project:
- _id: '16'
name: 'SFB 901 - C4: SFB 901 - Subproject C4'
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
publication: arXiv:2201.11343
status: public
title: Distributed gradient-based optimization in the presence of dependent aperiodic
communication
type: preprint
user_id: '477'
year: '2022'
...
---
_id: '32855'
author:
- first_name: Lennart
full_name: Clausing, Lennart
id: '74287'
last_name: Clausing
orcid: 0000-0003-3789-6034
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
citation:
ama: 'Clausing L, Platzner M. ReconOS64: A Hardware Operating System for Modern
Platform FPGAs with 64-Bit Support. In: 2022 IEEE International Parallel and
Distributed Processing Symposium Workshops (IPDPSW). IEEE; 2022:120-127. doi:10.1109/ipdpsw55747.2022.00029'
apa: 'Clausing, L., & Platzner, M. (2022). ReconOS64: A Hardware Operating System
for Modern Platform FPGAs with 64-Bit Support. 2022 IEEE International Parallel
and Distributed Processing Symposium Workshops (IPDPSW), 120–127. https://doi.org/10.1109/ipdpsw55747.2022.00029'
bibtex: '@inproceedings{Clausing_Platzner_2022, title={ReconOS64: A Hardware Operating
System for Modern Platform FPGAs with 64-Bit Support}, DOI={10.1109/ipdpsw55747.2022.00029},
booktitle={2022 IEEE International Parallel and Distributed Processing Symposium
Workshops (IPDPSW)}, publisher={IEEE}, author={Clausing, Lennart and Platzner,
Marco}, year={2022}, pages={120–127} }'
chicago: 'Clausing, Lennart, and Marco Platzner. “ReconOS64: A Hardware Operating
System for Modern Platform FPGAs with 64-Bit Support.” In 2022 IEEE International
Parallel and Distributed Processing Symposium Workshops (IPDPSW), 120–27.
IEEE, 2022. https://doi.org/10.1109/ipdpsw55747.2022.00029.'
ieee: 'L. Clausing and M. Platzner, “ReconOS64: A Hardware Operating System for
Modern Platform FPGAs with 64-Bit Support,” in 2022 IEEE International Parallel
and Distributed Processing Symposium Workshops (IPDPSW), Lyon, France, 2022,
pp. 120–127, doi: 10.1109/ipdpsw55747.2022.00029.'
mla: 'Clausing, Lennart, and Marco Platzner. “ReconOS64: A Hardware Operating System
for Modern Platform FPGAs with 64-Bit Support.” 2022 IEEE International Parallel
and Distributed Processing Symposium Workshops (IPDPSW), IEEE, 2022, pp. 120–27,
doi:10.1109/ipdpsw55747.2022.00029.'
short: 'L. Clausing, M. Platzner, in: 2022 IEEE International Parallel and Distributed
Processing Symposium Workshops (IPDPSW), IEEE, 2022, pp. 120–127.'
conference:
end_date: 2022-06-03
location: ' Lyon, France'
name: 2022 IEEE International Parallel and Distributed Processing Symposium Workshops
(IPDPSW)
start_date: 2022-05-30
date_created: 2022-08-16T09:58:34Z
date_updated: 2022-11-18T09:36:00Z
department:
- _id: '78'
doi: 10.1109/ipdpsw55747.2022.00029
language:
- iso: eng
page: 120-127
project:
- _id: '83'
name: 'SFB 901 - T1: SFB 901 -Subproject T1'
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '82'
name: 'SFB 901 - T: SFB 901 - Project Area T'
publication: 2022 IEEE International Parallel and Distributed Processing Symposium
Workshops (IPDPSW)
publication_identifier:
eisbn:
- 978-1-6654-9747-3
publication_status: published
publisher: IEEE
status: public
title: 'ReconOS64: A Hardware Operating System for Modern Platform FPGAs with 64-Bit
Support'
type: conference
user_id: '477'
year: '2022'
...
---
_id: '30791'
abstract:
- lang: eng
text: "We present sufficient conditions that ensure convergence of the multi-agent\r\nDeep
Deterministic Policy Gradient (DDPG) algorithm. It is an example of one of\r\nthe
most popular paradigms of Deep Reinforcement Learning (DeepRL) for tackling\r\ncontinuous
action spaces: the actor-critic paradigm. In the setting considered\r\nherein,
each agent observes a part of the global state space in order to take\r\nlocal
actions, for which it receives local rewards. For every agent, DDPG\r\ntrains
a local actor (policy) and a local critic (Q-function). The analysis\r\nshows
that multi-agent DDPG using neural networks to approximate the local\r\npolicies
and critics converge to limits with the following properties: The\r\ncritic limits
minimize the average squared Bellman loss; the actor limits\r\nparameterize a
policy that maximizes the local critic's approximation of\r\n$Q_i^*$, where $i$
is the agent index. The averaging is with respect to a\r\nprobability distribution
over the global state-action space. It captures the\r\nasymptotics of all local
training processes. Finally, we extend the analysis to\r\na fully decentralized
setting where agents communicate over a wireless network\r\nprone to delays and
losses; a typical scenario in, e.g., robotic applications."
author:
- first_name: Adrian
full_name: Redder, Adrian
id: '52265'
last_name: Redder
orcid: https://orcid.org/0000-0001-7391-4688
- first_name: Arunselvan
full_name: Ramaswamy, Arunselvan
id: '66937'
last_name: Ramaswamy
orcid: https://orcid.org/ 0000-0001-7547-8111
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: Redder A, Ramaswamy A, Karl H. Asymptotic Convergence of Deep Multi-Agent Actor-Critic
Algorithms. arXiv:220100570. Published online 2022.
apa: Redder, A., Ramaswamy, A., & Karl, H. (2022). Asymptotic Convergence of
Deep Multi-Agent Actor-Critic Algorithms. In arXiv:2201.00570.
bibtex: '@article{Redder_Ramaswamy_Karl_2022, title={Asymptotic Convergence of Deep
Multi-Agent Actor-Critic Algorithms}, journal={arXiv:2201.00570}, author={Redder,
Adrian and Ramaswamy, Arunselvan and Karl, Holger}, year={2022} }'
chicago: Redder, Adrian, Arunselvan Ramaswamy, and Holger Karl. “Asymptotic Convergence
of Deep Multi-Agent Actor-Critic Algorithms.” ArXiv:2201.00570, 2022.
ieee: A. Redder, A. Ramaswamy, and H. Karl, “Asymptotic Convergence of Deep Multi-Agent
Actor-Critic Algorithms,” arXiv:2201.00570. 2022.
mla: Redder, Adrian, et al. “Asymptotic Convergence of Deep Multi-Agent Actor-Critic
Algorithms.” ArXiv:2201.00570, 2022.
short: A. Redder, A. Ramaswamy, H. Karl, ArXiv:2201.00570 (2022).
date_created: 2022-04-06T06:53:52Z
date_updated: 2022-11-18T09:33:42Z
department:
- _id: '75'
external_id:
arxiv:
- '2201.00570'
language:
- iso: eng
project:
- _id: '16'
name: 'SFB 901 - C4: SFB 901 - Subproject C4'
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
publication: arXiv:2201.00570
status: public
title: Asymptotic Convergence of Deep Multi-Agent Actor-Critic Algorithms
type: preprint
user_id: '477'
year: '2022'
...
---
_id: '32590'
author:
- first_name: Cedric
full_name: Richter, Cedric
id: '50003'
last_name: Richter
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Richter C, Wehrheim H. Learning Realistic Mutations: Bug Creation for Neural
Bug Detectors. In: 2022 IEEE Conference on Software Testing, Verification and
Validation (ICST). ; 2022:162-173. doi:10.1109/ICST53961.2022.00027'
apa: 'Richter, C., & Wehrheim, H. (2022). Learning Realistic Mutations: Bug
Creation for Neural Bug Detectors. 2022 IEEE Conference on Software Testing,
Verification and Validation (ICST), 162–173. https://doi.org/10.1109/ICST53961.2022.00027'
bibtex: '@inproceedings{Richter_Wehrheim_2022, title={Learning Realistic Mutations:
Bug Creation for Neural Bug Detectors}, DOI={10.1109/ICST53961.2022.00027},
booktitle={2022 IEEE Conference on Software Testing, Verification and Validation
(ICST)}, author={Richter, Cedric and Wehrheim, Heike}, year={2022}, pages={162–173}
}'
chicago: 'Richter, Cedric, and Heike Wehrheim. “Learning Realistic Mutations: Bug
Creation for Neural Bug Detectors.” In 2022 IEEE Conference on Software Testing,
Verification and Validation (ICST), 162–73, 2022. https://doi.org/10.1109/ICST53961.2022.00027.'
ieee: 'C. Richter and H. Wehrheim, “Learning Realistic Mutations: Bug Creation for
Neural Bug Detectors,” in 2022 IEEE Conference on Software Testing, Verification
and Validation (ICST), 2022, pp. 162–173, doi: 10.1109/ICST53961.2022.00027.'
mla: 'Richter, Cedric, and Heike Wehrheim. “Learning Realistic Mutations: Bug Creation
for Neural Bug Detectors.” 2022 IEEE Conference on Software Testing, Verification
and Validation (ICST), 2022, pp. 162–73, doi:10.1109/ICST53961.2022.00027.'
short: 'C. Richter, H. Wehrheim, in: 2022 IEEE Conference on Software Testing, Verification
and Validation (ICST), 2022, pp. 162–173.'
date_created: 2022-08-08T07:40:04Z
date_updated: 2022-11-18T09:45:40Z
department:
- _id: '77'
doi: 10.1109/ICST53961.2022.00027
language:
- iso: eng
page: 162-173
project:
- _id: '12'
name: 'SFB 901 - B4: SFB 901 - Subproject B4'
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '3'
name: 'SFB 901 - B: SFB 901 - Project Area B'
publication: 2022 IEEE Conference on Software Testing, Verification and Validation
(ICST)
status: public
title: 'Learning Realistic Mutations: Bug Creation for Neural Bug Detectors'
type: conference
user_id: '477'
year: '2022'
...
---
_id: '32591'
author:
- first_name: Cedric
full_name: Richter, Cedric
id: '50003'
last_name: Richter
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Richter C, Wehrheim H. TSSB-3M: Mining single statement bugs at massive scale.
In: 2022 IEEE/ACM 19th International Conference on Mining Software Repositories
(MSR). ; 2022:418-422. doi:10.1145/3524842.3528505'
apa: 'Richter, C., & Wehrheim, H. (2022). TSSB-3M: Mining single statement bugs
at massive scale. 2022 IEEE/ACM 19th International Conference on Mining Software
Repositories (MSR), 418–422. https://doi.org/10.1145/3524842.3528505'
bibtex: '@inproceedings{Richter_Wehrheim_2022, title={TSSB-3M: Mining single statement
bugs at massive scale}, DOI={10.1145/3524842.3528505},
booktitle={2022 IEEE/ACM 19th International Conference on Mining Software Repositories
(MSR)}, author={Richter, Cedric and Wehrheim, Heike}, year={2022}, pages={418–422}
}'
chicago: 'Richter, Cedric, and Heike Wehrheim. “TSSB-3M: Mining Single Statement
Bugs at Massive Scale.” In 2022 IEEE/ACM 19th International Conference on Mining
Software Repositories (MSR), 418–22, 2022. https://doi.org/10.1145/3524842.3528505.'
ieee: 'C. Richter and H. Wehrheim, “TSSB-3M: Mining single statement bugs at massive
scale,” in 2022 IEEE/ACM 19th International Conference on Mining Software Repositories
(MSR), 2022, pp. 418–422, doi: 10.1145/3524842.3528505.'
mla: 'Richter, Cedric, and Heike Wehrheim. “TSSB-3M: Mining Single Statement Bugs
at Massive Scale.” 2022 IEEE/ACM 19th International Conference on Mining Software
Repositories (MSR), 2022, pp. 418–22, doi:10.1145/3524842.3528505.'
short: 'C. Richter, H. Wehrheim, in: 2022 IEEE/ACM 19th International Conference
on Mining Software Repositories (MSR), 2022, pp. 418–422.'
date_created: 2022-08-08T07:42:19Z
date_updated: 2022-11-18T09:45:05Z
department:
- _id: '77'
doi: 10.1145/3524842.3528505
language:
- iso: eng
page: 418-422
project:
- _id: '12'
name: 'SFB 901 - B4: SFB 901 - Subproject B4'
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '3'
name: 'SFB 901 - B: SFB 901 - Project Area B'
publication: 2022 IEEE/ACM 19th International Conference on Mining Software Repositories
(MSR)
status: public
title: 'TSSB-3M: Mining single statement bugs at massive scale'
type: conference
user_id: '477'
year: '2022'
...
---
_id: '32398'
author:
- first_name: Hanna
full_name: Siek, Hanna
last_name: Siek
citation:
ama: 'Siek H. Bringing Structure to Structure-Preserving Signatures: Overview,
Implementation and Comparison of Selected SPS Schemes.; 2022.'
apa: 'Siek, H. (2022). Bringing Structure to Structure-Preserving Signatures:
Overview, Implementation and Comparison of Selected SPS Schemes.'
bibtex: '@book{Siek_2022, title={Bringing Structure to Structure-Preserving Signatures:
Overview, Implementation and Comparison of Selected SPS Schemes}, author={Siek,
Hanna}, year={2022} }'
chicago: 'Siek, Hanna. Bringing Structure to Structure-Preserving Signatures:
Overview, Implementation and Comparison of Selected SPS Schemes, 2022.'
ieee: 'H. Siek, Bringing Structure to Structure-Preserving Signatures: Overview,
Implementation and Comparison of Selected SPS Schemes. 2022.'
mla: 'Siek, Hanna. Bringing Structure to Structure-Preserving Signatures: Overview,
Implementation and Comparison of Selected SPS Schemes. 2022.'
short: 'H. Siek, Bringing Structure to Structure-Preserving Signatures: Overview,
Implementation and Comparison of Selected SPS Schemes, 2022.'
date_created: 2022-07-20T09:36:39Z
date_updated: 2022-11-18T09:38:04Z
department:
- _id: '64'
- _id: '7'
language:
- iso: eng
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
- _id: '13'
name: 'SFB 901 - C1: SFB 901 - Subproject C1'
- _id: '84'
name: 'SFB 901 - T2: SFB 901 -Subproject T2'
- _id: '82'
name: 'SFB 901 - T: SFB 901 - Project Area T'
status: public
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: 'Bringing Structure to Structure-Preserving Signatures: Overview, Implementation
and Comparison of Selected SPS Schemes'
type: bachelorsthesis
user_id: '477'
year: '2022'
...
---
_id: '31485'
author:
- first_name: Paul
full_name: Kramer, Paul
id: '64594'
last_name: Kramer
citation:
ama: Kramer P. On Transforming Lattice-Based Cryptography to the Ring Setting.;
2022.
apa: Kramer, P. (2022). On Transforming Lattice-Based Cryptography to the Ring
Setting.
bibtex: '@book{Kramer_2022, title={On Transforming Lattice-Based Cryptography to
the Ring Setting}, author={Kramer, Paul}, year={2022} }'
chicago: Kramer, Paul. On Transforming Lattice-Based Cryptography to the Ring
Setting, 2022.
ieee: P. Kramer, On Transforming Lattice-Based Cryptography to the Ring Setting.
2022.
mla: Kramer, Paul. On Transforming Lattice-Based Cryptography to the Ring Setting.
2022.
short: P. Kramer, On Transforming Lattice-Based Cryptography to the Ring Setting,
2022.
date_created: 2022-05-28T08:07:40Z
date_updated: 2022-11-18T09:40:28Z
department:
- _id: '7'
- _id: '64'
extern: '1'
language:
- iso: eng
project:
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
- _id: '13'
name: 'SFB 901 - C1: SFB 901 - Subproject C1'
- _id: '1'
name: 'SFB 901: SFB 901'
status: public
title: On Transforming Lattice-Based Cryptography to the Ring Setting
type: mastersthesis
user_id: '477'
year: '2022'
...
---
_id: '32854'
author:
- first_name: Adrian
full_name: Redder, Adrian
id: '52265'
last_name: Redder
orcid: https://orcid.org/0000-0001-7391-4688
- first_name: Arunselvan
full_name: Ramaswamy, Arunselvan
id: '66937'
last_name: Ramaswamy
orcid: https://orcid.org/ 0000-0001-7547-8111
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: Redder A, Ramaswamy A, Karl H. Practical Network Conditions for the Convergence
of Distributed Optimization. IFAC-PapersOnLine. 2022;55(13):133–138.
apa: Redder, A., Ramaswamy, A., & Karl, H. (2022). Practical Network Conditions
for the Convergence of Distributed Optimization. IFAC-PapersOnLine, 55(13),
133–138.
bibtex: '@article{Redder_Ramaswamy_Karl_2022, title={Practical Network Conditions
for the Convergence of Distributed Optimization}, volume={55}, number={13}, journal={IFAC-PapersOnLine},
publisher={Elsevier}, author={Redder, Adrian and Ramaswamy, Arunselvan and Karl,
Holger}, year={2022}, pages={133–138} }'
chicago: 'Redder, Adrian, Arunselvan Ramaswamy, and Holger Karl. “Practical Network
Conditions for the Convergence of Distributed Optimization.” IFAC-PapersOnLine
55, no. 13 (2022): 133–138.'
ieee: A. Redder, A. Ramaswamy, and H. Karl, “Practical Network Conditions for the
Convergence of Distributed Optimization,” IFAC-PapersOnLine, vol. 55, no.
13, pp. 133–138, 2022.
mla: Redder, Adrian, et al. “Practical Network Conditions for the Convergence of
Distributed Optimization.” IFAC-PapersOnLine, vol. 55, no. 13, Elsevier,
2022, pp. 133–138.
short: A. Redder, A. Ramaswamy, H. Karl, IFAC-PapersOnLine 55 (2022) 133–138.
conference:
name: IFAC Conference on Networked Systems
date_created: 2022-08-16T09:12:55Z
date_updated: 2022-11-18T10:05:14Z
ddc:
- '006'
department:
- _id: '75'
file:
- access_level: closed
content_type: application/pdf
creator: aredder
date_created: 2022-08-31T07:06:30Z
date_updated: 2022-08-31T07:06:30Z
file_id: '33236'
file_name: NecSys2022____Practical_Conditions_for_Conv.pdf
file_size: 298395
relation: main_file
success: 1
file_date_updated: 2022-08-31T07:06:30Z
has_accepted_license: '1'
intvolume: ' 55'
issue: '13'
language:
- iso: eng
page: 133–138
project:
- _id: '16'
name: 'SFB 901 - C4: SFB 901 - Subproject C4'
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
publication: IFAC-PapersOnLine
publisher: Elsevier
status: public
title: Practical Network Conditions for the Convergence of Distributed Optimization
type: journal_article
user_id: '477'
volume: 55
year: '2022'
...
---
_id: '33253'
author:
- first_name: Tim
full_name: Hansmeier, Tim
id: '49992'
last_name: Hansmeier
orcid: 0000-0003-1377-3339
- first_name: Mathis
full_name: Brede, Mathis
last_name: Brede
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
citation:
ama: 'Hansmeier T, Brede M, Platzner M. XCS on Embedded Systems: An Analysis of
Execution Profiles and Accelerated Classifier Deletion. In: GECCO ’22: Proceedings
of the Genetic and Evolutionary Computation Conference Companion. Association
for Computing Machinery (ACM); 2022:2071-2079. doi:10.1145/3520304.3533977'
apa: 'Hansmeier, T., Brede, M., & Platzner, M. (2022). XCS on Embedded Systems:
An Analysis of Execution Profiles and Accelerated Classifier Deletion. GECCO
’22: Proceedings of the Genetic and Evolutionary Computation Conference Companion,
2071–2079. https://doi.org/10.1145/3520304.3533977'
bibtex: '@inproceedings{Hansmeier_Brede_Platzner_2022, place={New York, NY, United
States}, title={XCS on Embedded Systems: An Analysis of Execution Profiles and
Accelerated Classifier Deletion}, DOI={10.1145/3520304.3533977},
booktitle={GECCO ’22: Proceedings of the Genetic and Evolutionary Computation
Conference Companion}, publisher={Association for Computing Machinery (ACM)},
author={Hansmeier, Tim and Brede, Mathis and Platzner, Marco}, year={2022}, pages={2071–2079}
}'
chicago: 'Hansmeier, Tim, Mathis Brede, and Marco Platzner. “XCS on Embedded Systems:
An Analysis of Execution Profiles and Accelerated Classifier Deletion.” In GECCO
’22: Proceedings of the Genetic and Evolutionary Computation Conference Companion,
2071–79. New York, NY, United States: Association for Computing Machinery (ACM),
2022. https://doi.org/10.1145/3520304.3533977.'
ieee: 'T. Hansmeier, M. Brede, and M. Platzner, “XCS on Embedded Systems: An Analysis
of Execution Profiles and Accelerated Classifier Deletion,” in GECCO ’22: Proceedings
of the Genetic and Evolutionary Computation Conference Companion, Boston,
MA, USA, 2022, pp. 2071–2079, doi: 10.1145/3520304.3533977.'
mla: 'Hansmeier, Tim, et al. “XCS on Embedded Systems: An Analysis of Execution
Profiles and Accelerated Classifier Deletion.” GECCO ’22: Proceedings of the
Genetic and Evolutionary Computation Conference Companion, Association for
Computing Machinery (ACM), 2022, pp. 2071–79, doi:10.1145/3520304.3533977.'
short: 'T. Hansmeier, M. Brede, M. Platzner, in: GECCO ’22: Proceedings of the Genetic
and Evolutionary Computation Conference Companion, Association for Computing Machinery
(ACM), New York, NY, United States, 2022, pp. 2071–2079.'
conference:
end_date: 2022-07-13
location: Boston, MA, USA
name: International Workshop on Learning Classifier Systems (IWLCS 2022)
start_date: 2022-07-09
date_created: 2022-09-02T11:47:17Z
date_updated: 2022-11-18T10:13:22Z
department:
- _id: '78'
doi: 10.1145/3520304.3533977
language:
- iso: eng
page: 2071-2079
place: New York, NY, United States
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '14'
name: 'SFB 901 - C2: SFB 901 - Subproject C2'
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
publication: 'GECCO ''22: Proceedings of the Genetic and Evolutionary Computation
Conference Companion'
publication_status: published
publisher: Association for Computing Machinery (ACM)
status: public
title: 'XCS on Embedded Systems: An Analysis of Execution Profiles and Accelerated
Classifier Deletion'
type: conference
user_id: '477'
year: '2022'
...
---
_id: '33274'
author:
- first_name: Wei-Fan
full_name: Chen, Wei-Fan
id: '82920'
last_name: Chen
- first_name: Mei-Hua
full_name: Chen, Mei-Hua
last_name: Chen
- first_name: Garima
full_name: Mudgal, Garima
last_name: Mudgal
- first_name: Henning
full_name: Wachsmuth, Henning
id: '3900'
last_name: Wachsmuth
citation:
ama: 'Chen W-F, Chen M-H, Mudgal G, Wachsmuth H. Analyzing Culture-Specific Argument
Structures in Learner Essays. In: Proceedings of the 9th Workshop on Argument
Mining (ArgMining 2022). ; 2022:51-61.'
apa: Chen, W.-F., Chen, M.-H., Mudgal, G., & Wachsmuth, H. (2022). Analyzing
Culture-Specific Argument Structures in Learner Essays. Proceedings of the
9th Workshop on Argument Mining (ArgMining 2022), 51–61.
bibtex: '@inproceedings{Chen_Chen_Mudgal_Wachsmuth_2022, title={Analyzing Culture-Specific
Argument Structures in Learner Essays}, booktitle={Proceedings of the 9th Workshop
on Argument Mining (ArgMining 2022)}, author={Chen, Wei-Fan and Chen, Mei-Hua
and Mudgal, Garima and Wachsmuth, Henning}, year={2022}, pages={51–61} }'
chicago: Chen, Wei-Fan, Mei-Hua Chen, Garima Mudgal, and Henning Wachsmuth. “Analyzing
Culture-Specific Argument Structures in Learner Essays.” In Proceedings of
the 9th Workshop on Argument Mining (ArgMining 2022), 51–61, 2022.
ieee: W.-F. Chen, M.-H. Chen, G. Mudgal, and H. Wachsmuth, “Analyzing Culture-Specific
Argument Structures in Learner Essays,” in Proceedings of the 9th Workshop
on Argument Mining (ArgMining 2022), 2022, pp. 51–61.
mla: Chen, Wei-Fan, et al. “Analyzing Culture-Specific Argument Structures in Learner
Essays.” Proceedings of the 9th Workshop on Argument Mining (ArgMining 2022),
2022, pp. 51–61.
short: 'W.-F. Chen, M.-H. Chen, G. Mudgal, H. Wachsmuth, in: Proceedings of the
9th Workshop on Argument Mining (ArgMining 2022), 2022, pp. 51–61.'
date_created: 2022-09-06T13:51:23Z
date_updated: 2022-11-18T09:56:17Z
department:
- _id: '600'
language:
- iso: eng
page: 51 - 61
project:
- _id: '9'
name: 'SFB 901 - B1: SFB 901 - Subproject B1'
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '3'
name: 'SFB 901 - B: SFB 901 - Project Area B'
publication: Proceedings of the 9th Workshop on Argument Mining (ArgMining 2022)
status: public
title: Analyzing Culture-Specific Argument Structures in Learner Essays
type: conference
user_id: '477'
year: '2022'
...
---
_id: '33491'
author:
- first_name: Marten
full_name: Maack, Marten
id: '88252'
last_name: Maack
- first_name: Simon
full_name: Pukrop, Simon
id: '44428'
last_name: Pukrop
- first_name: Anna Rodriguez
full_name: Rasmussen, Anna Rodriguez
last_name: Rasmussen
citation:
ama: 'Maack M, Pukrop S, Rasmussen AR. (In-)Approximability Results for Interval,
Resource Restricted, and Low Rank Scheduling. In: Chechik S, Navarro G, Rotenberg
E, Herman G, eds. 30th Annual European Symposium on Algorithms, ESA 2022, September
5-9, 2022, Berlin/Potsdam, Germany. Vol 244. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik; 2022:77:1–77:13. doi:10.4230/LIPIcs.ESA.2022.77'
apa: Maack, M., Pukrop, S., & Rasmussen, A. R. (2022). (In-)Approximability
Results for Interval, Resource Restricted, and Low Rank Scheduling. In S. Chechik,
G. Navarro, E. Rotenberg, & G. Herman (Eds.), 30th Annual European Symposium
on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany (Vol.
244, p. 77:1–77:13). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ESA.2022.77
bibtex: '@inproceedings{Maack_Pukrop_Rasmussen_2022, series={LIPIcs}, title={(In-)Approximability
Results for Interval, Resource Restricted, and Low Rank Scheduling}, volume={244},
DOI={10.4230/LIPIcs.ESA.2022.77},
booktitle={30th Annual European Symposium on Algorithms, ESA 2022, September 5-9,
2022, Berlin/Potsdam, Germany}, publisher={Schloss Dagstuhl - Leibniz-Zentrum
für Informatik}, author={Maack, Marten and Pukrop, Simon and Rasmussen, Anna Rodriguez},
editor={Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz},
year={2022}, pages={77:1–77:13}, collection={LIPIcs} }'
chicago: Maack, Marten, Simon Pukrop, and Anna Rodriguez Rasmussen. “(In-)Approximability
Results for Interval, Resource Restricted, and Low Rank Scheduling.” In 30th
Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam,
Germany, edited by Shiri Chechik, Gonzalo Navarro, Eva Rotenberg, and Grzegorz
Herman, 244:77:1–77:13. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2022. https://doi.org/10.4230/LIPIcs.ESA.2022.77.
ieee: 'M. Maack, S. Pukrop, and A. R. Rasmussen, “(In-)Approximability Results for
Interval, Resource Restricted, and Low Rank Scheduling,” in 30th Annual European
Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany,
2022, vol. 244, p. 77:1–77:13, doi: 10.4230/LIPIcs.ESA.2022.77.'
mla: Maack, Marten, et al. “(In-)Approximability Results for Interval, Resource
Restricted, and Low Rank Scheduling.” 30th Annual European Symposium on Algorithms,
ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany, edited by Shiri Chechik
et al., vol. 244, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p.
77:1–77:13, doi:10.4230/LIPIcs.ESA.2022.77.
short: 'M. Maack, S. Pukrop, A.R. Rasmussen, in: S. Chechik, G. Navarro, E. Rotenberg,
G. Herman (Eds.), 30th Annual European Symposium on Algorithms, ESA 2022, September
5-9, 2022, Berlin/Potsdam, Germany, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2022, p. 77:1–77:13.'
date_created: 2022-09-27T13:06:05Z
date_updated: 2022-11-18T10:14:14Z
department:
- _id: '63'
doi: 10.4230/LIPIcs.ESA.2022.77
editor:
- first_name: Shiri
full_name: Chechik, Shiri
last_name: Chechik
- first_name: Gonzalo
full_name: Navarro, Gonzalo
last_name: Navarro
- first_name: Eva
full_name: Rotenberg, Eva
last_name: Rotenberg
- first_name: Grzegorz
full_name: Herman, Grzegorz
last_name: Herman
intvolume: ' 244'
language:
- iso: eng
page: 77:1–77:13
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '16'
name: 'SFB 901 - C4: SFB 901 - Subproject C4'
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
publication: 30th Annual European Symposium on Algorithms, ESA 2022, September 5-9,
2022, Berlin/Potsdam, Germany
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
series_title: LIPIcs
status: public
title: (In-)Approximability Results for Interval, Resource Restricted, and Low Rank
Scheduling
type: conference
user_id: '477'
volume: 244
year: '2022'
...
---
_id: '29769'
abstract:
- lang: eng
text: 'Wettstreit zwischen der Entwicklung neuer Hardwaretrojaner und entsprechender
Gegenmaßnahmen beschreiten Widersacher immer raffiniertere Wege um Schaltungsentwürfe
zu infizieren und dabei selbst fortgeschrittene Test- und Verifikationsmethoden
zu überlisten. Abgesehen von den konventionellen Methoden um einen Trojaner in
eine Schaltung für ein Field-programmable Gate Array (FPGA) einzuschleusen, können
auch die Entwurfswerkzeuge heimlich kompromittiert werden um einen Angreifer dabei
zu unterstützen einen erfolgreichen Angriff durchzuführen, der zum Beispiel Fehlfunktionen
oder ungewollte Informationsabflüsse bewirken kann. Diese Dissertation beschäftigt
sich hauptsächlich mit den beiden Blickwinkeln auf Hardwaretrojaner in rekonfigurierbaren
Systemen, einerseits der Perspektive des Verteidigers mit einer Methode zur Erkennung
von Trojanern auf der Bitstromebene, und andererseits derjenigen des Angreifers
mit einer neuartigen Angriffsmethode für FPGA Trojaner. Für die Verteidigung gegen
den Trojaner ``Heimtückische LUT'''' stellen wir die allererste erfolgreiche Gegenmaßnahme
vor, die durch Verifikation mittels Proof-carrying Hardware (PCH) auf der Bitstromebene
direkt vor der Konfiguration der Hardware angewendet werden kann, und präsentieren
ein vollständiges Schema für den Entwurf und die Verifikation von Schaltungen
für iCE40 FPGAs. Für die Gegenseite führen wir einen neuen Angriff ein, welcher
bösartiges Routing im eingefügten Trojaner ausnutzt um selbst im fertigen Bitstrom
in einem inaktiven Zustand zu verbleiben: Hierdurch kann dieser neuartige Angriff
zur Zeit weder von herkömmlichen Test- und Verifikationsmethoden, noch von unserer
vorher vorgestellten Verifikation auf der Bitstromebene entdeckt werden.'
- lang: eng
text: The battle of developing hardware Trojans and corresponding countermeasures
has taken adversaries towards ingenious ways of compromising hardware designs
by circumventing even advanced testing and verification methods. Besides conventional
methods of inserting Trojans into a design by a malicious entity, the design flow
for field-programmable gate arrays (FPGAs) can also be surreptitiously compromised
to assist the attacker to perform a successful malfunctioning or information leakage
attack. This thesis mainly focuses on the two aspects of hardware Trojans in reconfigurable
systems, the defenders perspective which corresponds to the bitstream-level Trojan
detection technique, and the attackers perspective which corresponds to a novel
FPGA Trojan attack. From the defender's perspective, we introduce a first-ever
successful pre-configuration countermeasure against the ``Malicious LUT''-hardware
Trojan, by employing bitstream-level Proof-Carrying Hardware (PCH) and present
the complete design-and-verification flow for iCE40 FPGAs. Likewise, from an attackers
perspective, we present a novel attack that leverages malicious routing of the
inserted Trojan circuit to acquire a dormant state even in the generated and transmitted
bitstream. Since the Trojan is injected in a post-synthesis step and remains unconnected
in the bitstream, the presented attack can currently neither be prevented by conventional
testing and verification methods nor by bitstream-level verification techniques.
author:
- first_name: Qazi Arbab
full_name: Ahmed, Qazi Arbab
id: '72764'
last_name: Ahmed
orcid: 0000-0002-1837-2254
citation:
ama: Ahmed QA. Hardware Trojans in Reconfigurable Computing. Paderborn University,
Paderborn, Germany; 2022. doi:10.17619/UNIPB/1-1271
apa: Ahmed, Q. A. (2022). Hardware Trojans in Reconfigurable Computing. Paderborn
University, Paderborn, Germany. https://doi.org/10.17619/UNIPB/1-1271
bibtex: '@book{Ahmed_2022, place={Paderborn}, title={Hardware Trojans in Reconfigurable
Computing}, DOI={10.17619/UNIPB/1-1271},
publisher={ Paderborn University, Paderborn, Germany}, author={Ahmed, Qazi Arbab},
year={2022} }'
chicago: 'Ahmed, Qazi Arbab. Hardware Trojans in Reconfigurable Computing.
Paderborn: Paderborn University, Paderborn, Germany, 2022. https://doi.org/10.17619/UNIPB/1-1271.'
ieee: 'Q. A. Ahmed, Hardware Trojans in Reconfigurable Computing. Paderborn: Paderborn
University, Paderborn, Germany, 2022.'
mla: Ahmed, Qazi Arbab. Hardware Trojans in Reconfigurable Computing. Paderborn
University, Paderborn, Germany, 2022, doi:10.17619/UNIPB/1-1271.
short: Q.A. Ahmed, Hardware Trojans in Reconfigurable Computing, Paderborn University,
Paderborn, Germany, Paderborn, 2022.
date_created: 2022-02-07T14:02:36Z
date_updated: 2022-11-30T13:39:01Z
ddc:
- '004'
department:
- _id: '78'
doi: 10.17619/UNIPB/1-1271
has_accepted_license: '1'
keyword:
- FPGA Security
- Hardware Trojans
- Bitstream-level Trojans
- Bitstream Verification
language:
- iso: eng
main_file_link:
- open_access: '1'
url: "\turn:nbn:de:hbz:466:2-40303"
oa: '1'
place: Paderborn
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
- _id: '14'
name: 'SFB 901 - C2: SFB 901 - Subproject C2'
publication_status: published
publisher: ' Paderborn University, Paderborn, Germany'
status: public
supervisor:
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
title: Hardware Trojans in Reconfigurable Computing
type: dissertation
user_id: '477'
year: '2022'
...
---
_id: '34197'
abstract:
- lang: eng
text: AbstractComprehensive data understanding
is a key success driver for data analytics projects. Knowing the characteristics
of the data helps a lot in selecting the appropriate data analysis techniques.
Especially in data-driven product planning, knowledge about the data is a necessary
prerequisite because data of the use phase is very heterogeneous. However, companies
often do not have the necessary know-how or time to build up solid data understanding
in connection with data analysis. In this paper, we develop a methodology to organize
and categorize and thus understand use phase data in a way that makes it accessible
to general data analytics workflows, following a design science research approach.
We first present a knowledge base that lists typical use phase data from a product
planning view. Second, we develop a taxonomy based on standard literature and
real data objects, which covers the diversity of the data considered. The taxonomy
provides 8 dimensions that support classification of use phase data and allows
to capture data characteristics from a data analytics view. Finally, we combine
both views by clustering the objects of the knowledge base according to the taxonomy.
Each of the resulting clusters covers a typical combination of analytics relevant
characteristics occurring in practice. By abstracting from the diversity of use
phase data into artifacts with manageable complexity, our approach provides guidance
to choose appropriate data analysis and AI techniques.
author:
- first_name: Melina
full_name: Panzner, Melina
last_name: Panzner
- first_name: Sebastian
full_name: von Enzberg, Sebastian
last_name: von Enzberg
- first_name: Maurice
full_name: Meyer, Maurice
last_name: Meyer
- first_name: Roman
full_name: Dumitrescu, Roman
last_name: Dumitrescu
citation:
ama: Panzner M, von Enzberg S, Meyer M, Dumitrescu R. Characterization of Usage
Data with the Help of Data Classifications. Journal of the Knowledge Economy.
Published online 2022. doi:10.1007/s13132-022-01081-z
apa: Panzner, M., von Enzberg, S., Meyer, M., & Dumitrescu, R. (2022). Characterization
of Usage Data with the Help of Data Classifications. Journal of the Knowledge
Economy. https://doi.org/10.1007/s13132-022-01081-z
bibtex: '@article{Panzner_von Enzberg_Meyer_Dumitrescu_2022, title={Characterization
of Usage Data with the Help of Data Classifications}, DOI={10.1007/s13132-022-01081-z},
journal={Journal of the Knowledge Economy}, publisher={Springer Science and Business
Media LLC}, author={Panzner, Melina and von Enzberg, Sebastian and Meyer, Maurice
and Dumitrescu, Roman}, year={2022} }'
chicago: Panzner, Melina, Sebastian von Enzberg, Maurice Meyer, and Roman Dumitrescu.
“Characterization of Usage Data with the Help of Data Classifications.” Journal
of the Knowledge Economy, 2022. https://doi.org/10.1007/s13132-022-01081-z.
ieee: 'M. Panzner, S. von Enzberg, M. Meyer, and R. Dumitrescu, “Characterization
of Usage Data with the Help of Data Classifications,” Journal of the Knowledge
Economy, 2022, doi: 10.1007/s13132-022-01081-z.'
mla: Panzner, Melina, et al. “Characterization of Usage Data with the Help of Data
Classifications.” Journal of the Knowledge Economy, Springer Science and
Business Media LLC, 2022, doi:10.1007/s13132-022-01081-z.
short: M. Panzner, S. von Enzberg, M. Meyer, R. Dumitrescu, Journal of the Knowledge
Economy (2022).
date_created: 2022-12-05T12:49:56Z
date_updated: 2022-12-05T12:51:03Z
department:
- _id: '563'
doi: 10.1007/s13132-022-01081-z
keyword:
- Economics and Econometrics
language:
- iso: eng
publication: Journal of the Knowledge Economy
publication_identifier:
issn:
- 1868-7865
- 1868-7873
publication_status: published
publisher: Springer Science and Business Media LLC
status: public
title: Characterization of Usage Data with the Help of Data Classifications
type: journal_article
user_id: '15782'
year: '2022'
...
---
_id: '34196'
abstract:
- lang: eng
text: Mounting sensors in disk stack separators is often a major challenge
due to the operating conditions. However, a process cannot be optimally monitored
without sensors. Virtual sensors can be a solution to calculate the sought parameters
from measurable values. We measured the vibrations of disk stack separators and
applied machine learning (ML) to detect whether the separator contains only water
or whether particles are also present. We combined seven ML classification algorithms
with three feature engineering strategies and evaluated our model successfully
on vibration data of an experimental disk stack separator. Our experimental results
demonstrate that random forest in combination with manual feature engineering
using domain specific knowledge about suitable features outperforms all other
models with an accuracy of 91.27 %.
author:
- first_name: Silke
full_name: Merkelbach, Silke
last_name: Merkelbach
- first_name: Lameya
full_name: Afroze, Lameya
last_name: Afroze
- first_name: Nils
full_name: Janssen, Nils
last_name: Janssen
- first_name: Sebastian
full_name: von Enzberg, Sebastian
last_name: von Enzberg
- first_name: Arno
full_name: Kühn, Arno
last_name: Kühn
- first_name: Roman
full_name: Dumitrescu, Roman
last_name: Dumitrescu
citation:
ama: Merkelbach S, Afroze L, Janssen N, von Enzberg S, Kühn A, Dumitrescu R. Using
vibration data to classify conditions in disk stack separators. Vibroengineering
PROCEDIA. 2022;46:21-26. doi:10.21595/vp.2022.23000
apa: Merkelbach, S., Afroze, L., Janssen, N., von Enzberg, S., Kühn, A., & Dumitrescu,
R. (2022). Using vibration data to classify conditions in disk stack separators.
Vibroengineering PROCEDIA, 46, 21–26. https://doi.org/10.21595/vp.2022.23000
bibtex: '@article{Merkelbach_Afroze_Janssen_von Enzberg_Kühn_Dumitrescu_2022, title={Using
vibration data to classify conditions in disk stack separators}, volume={46},
DOI={10.21595/vp.2022.23000},
journal={Vibroengineering PROCEDIA}, publisher={JVE International Ltd.}, author={Merkelbach,
Silke and Afroze, Lameya and Janssen, Nils and von Enzberg, Sebastian and Kühn,
Arno and Dumitrescu, Roman}, year={2022}, pages={21–26} }'
chicago: 'Merkelbach, Silke, Lameya Afroze, Nils Janssen, Sebastian von Enzberg,
Arno Kühn, and Roman Dumitrescu. “Using Vibration Data to Classify Conditions
in Disk Stack Separators.” Vibroengineering PROCEDIA 46 (2022): 21–26.
https://doi.org/10.21595/vp.2022.23000.'
ieee: 'S. Merkelbach, L. Afroze, N. Janssen, S. von Enzberg, A. Kühn, and R. Dumitrescu,
“Using vibration data to classify conditions in disk stack separators,” Vibroengineering
PROCEDIA, vol. 46, pp. 21–26, 2022, doi: 10.21595/vp.2022.23000.'
mla: Merkelbach, Silke, et al. “Using Vibration Data to Classify Conditions in Disk
Stack Separators.” Vibroengineering PROCEDIA, vol. 46, JVE International
Ltd., 2022, pp. 21–26, doi:10.21595/vp.2022.23000.
short: S. Merkelbach, L. Afroze, N. Janssen, S. von Enzberg, A. Kühn, R. Dumitrescu,
Vibroengineering PROCEDIA 46 (2022) 21–26.
date_created: 2022-12-05T12:47:22Z
date_updated: 2022-12-05T12:51:08Z
department:
- _id: '563'
doi: 10.21595/vp.2022.23000
intvolume: ' 46'
keyword:
- General Medicine
language:
- iso: eng
page: 21-26
publication: Vibroengineering PROCEDIA
publication_identifier:
issn:
- 2345-0533
- 2538-8479
publication_status: published
publisher: JVE International Ltd.
status: public
title: Using vibration data to classify conditions in disk stack separators
type: journal_article
user_id: '15782'
volume: 46
year: '2022'
...