---
_id: '32399'
author:
- first_name: Ella
full_name: Vahle, Ella
last_name: Vahle
citation:
ama: Vahle E. Modelling and Proving Security for a Secure MPC Protocol for Stable
Matching.; 2022.
apa: Vahle, E. (2022). Modelling and Proving Security for a Secure MPC Protocol
for Stable Matching.
bibtex: '@book{Vahle_2022, title={Modelling and Proving Security for a Secure MPC
Protocol for Stable Matching}, author={Vahle, Ella}, year={2022} }'
chicago: Vahle, Ella. Modelling and Proving Security for a Secure MPC Protocol
for Stable Matching, 2022.
ieee: E. Vahle, Modelling and Proving Security for a Secure MPC Protocol for
Stable Matching. 2022.
mla: Vahle, Ella. Modelling and Proving Security for a Secure MPC Protocol for
Stable Matching. 2022.
short: E. Vahle, Modelling and Proving Security for a Secure MPC Protocol for Stable
Matching, 2022.
date_created: 2022-07-20T09:38:39Z
date_updated: 2022-07-26T14:31:54Z
department:
- _id: '64'
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'
status: public
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: Modelling and Proving Security for a Secure MPC Protocol for Stable Matching
type: bachelorsthesis
user_id: '25078'
year: '2022'
...
---
_id: '6561'
author:
- first_name: Tim
full_name: Hetkämper, Tim
id: '38123'
last_name: Hetkämper
citation:
ama: Hetkämper T. Visualisierung von Ultraschallfeldern Mittels Schlierentechnik
Und Fraktionaler Fouriertransformation.; 2022.
apa: Hetkämper, T. (2022). Visualisierung von Ultraschallfeldern mittels Schlierentechnik
und fraktionaler Fouriertransformation.
bibtex: '@book{Hetkämper_2022, place={Workshop “Messtechnische Anwendungen von Ultraschall”,
Drübeck}, title={Visualisierung von Ultraschallfeldern mittels Schlierentechnik
und fraktionaler Fouriertransformation}, author={Hetkämper, Tim}, year={2022}
}'
chicago: Hetkämper, Tim. Visualisierung von Ultraschallfeldern Mittels Schlierentechnik
Und Fraktionaler Fouriertransformation. Workshop “Messtechnische Anwendungen
von Ultraschall”, Drübeck, 2022.
ieee: T. Hetkämper, Visualisierung von Ultraschallfeldern mittels Schlierentechnik
und fraktionaler Fouriertransformation. Workshop “Messtechnische Anwendungen
von Ultraschall”, Drübeck, 2022.
mla: Hetkämper, Tim. Visualisierung von Ultraschallfeldern Mittels Schlierentechnik
Und Fraktionaler Fouriertransformation. 2022.
short: T. Hetkämper, Visualisierung von Ultraschallfeldern Mittels Schlierentechnik
Und Fraktionaler Fouriertransformation, Workshop “Messtechnische Anwendungen von
Ultraschall”, Drübeck, 2022.
date_created: 2019-01-09T14:37:08Z
date_updated: 2022-07-28T07:12:05Z
department:
- _id: '49'
language:
- iso: eng
place: Workshop "Messtechnische Anwendungen von Ultraschall", Drübeck
status: public
title: Visualisierung von Ultraschallfeldern mittels Schlierentechnik und fraktionaler
Fouriertransformation
type: misc
user_id: '11829'
year: '2022'
...
---
_id: '6592'
author:
- first_name: Leander
full_name: Claes, Leander
id: '11829'
last_name: Claes
orcid: 0000-0002-4393-268X
citation:
ama: Claes L. Messverfahren Für Die Akustische Absorption Zur Bestimmung Der
Volumenviskosität.; 2022.
apa: Claes, L. (2022). Messverfahren für die akustische Absorption zur Bestimmung
der Volumenviskosität.
bibtex: '@book{Claes_2022, place={Workshop “Messtechnische Anwendungen von Ultraschall”,
Drübeck}, title={Messverfahren für die akustische Absorption zur Bestimmung der
Volumenviskosität}, author={Claes, Leander}, year={2022} }'
chicago: Claes, Leander. Messverfahren Für Die Akustische Absorption Zur Bestimmung
Der Volumenviskosität. Workshop “Messtechnische Anwendungen von Ultraschall”,
Drübeck, 2022.
ieee: L. Claes, Messverfahren für die akustische Absorption zur Bestimmung der
Volumenviskosität. Workshop “Messtechnische Anwendungen von Ultraschall”,
Drübeck, 2022.
mla: Claes, Leander. Messverfahren Für Die Akustische Absorption Zur Bestimmung
Der Volumenviskosität. 2022.
short: L. Claes, Messverfahren Für Die Akustische Absorption Zur Bestimmung Der
Volumenviskosität, Workshop “Messtechnische Anwendungen von Ultraschall”, Drübeck,
2022.
date_created: 2019-01-09T16:07:04Z
date_updated: 2022-07-28T07:12:28Z
department:
- _id: '49'
language:
- iso: eng
place: Workshop "Messtechnische Anwendungen von Ultraschall", Drübeck
status: public
title: Messverfahren für die akustische Absorption zur Bestimmung der Volumenviskosität
type: misc
user_id: '11829'
year: '2022'
...
---
_id: '31847'
abstract:
- lang: eng
text: "The famous $k$-Server Problem covers plenty of resource allocation scenarios,
and several variations have been studied extensively for decades. However, to
the best of our knowledge, no research has considered the problem if the servers
are not identical and requests can express which specific servers should serve
them. Therefore, we present a new model generalizing the $k$-Server Problem by
*preferences* of the requests and proceed to study it in a uniform metric space
for deterministic online algorithms (the special case of paging).\r\n\r\nIn our
model, requests can either demand to be answered by any server (*general requests*)
or by a specific one (*specific requests*). If only general requests appear, the
instance is one of the original $k$-Server Problem, and a lower bound for the
competitive ratio of $k$ applies. If only specific requests appear, a solution
with a competitive ratio of $1$ becomes trivial since there is no freedom regarding
the servers' movements. Perhaps counter-intuitively, we show that if both kinds
of requests appear, the lower bound raises to $2k-1$.\r\n\r\nWe study deterministic
online algorithms in uniform metrics and present two algorithms. The first one
has an adaptive competitive ratio dependent on the frequency of specific requests.
It achieves a worst-case competitive ratio of $3k-2$ while it is optimal when
only general or only specific requests appear (competitive ratio of $k$ and $1$,
respectively). The second has a fixed close-to-optimal worst-case competitive
ratio of $2k+14$. For the first algorithm, we show a lower bound of $3k-2$, while
the second algorithm has a lower bound of $2k-1$ when only general requests appear.\r\n
\ \r\nThe two algorithms differ in only one behavioral rule for each server
that significantly influences the competitive ratio. Each server acting according
to the rule allows approaching the worst-case lower bound, while it implies an
increased lower bound for $k$-Server instances. In other words, there is a trade-off
between performing well against instances of the $k$-Server Problem and instances
containing specific requests. We also show that no deterministic online algorithm
can be optimal for both kinds of instances simultaneously."
author:
- first_name: Jannik
full_name: Castenow, Jannik
id: '38705'
last_name: Castenow
- first_name: Björn
full_name: Feldkord, Björn
id: '22704'
last_name: Feldkord
- first_name: Till
full_name: Knollmann, Till
id: '39241'
last_name: Knollmann
orcid: 0000-0003-2014-4696
- first_name: Manuel
full_name: Malatyali, Manuel
id: '41265'
last_name: Malatyali
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Castenow J, Feldkord B, Knollmann T, Malatyali M, Meyer auf der Heide F. The
k-Server with Preferences Problem. In: Proceedings of the 34th ACM Symposium
on Parallelism in Algorithms and Architectures. Association for Computing
Machinery; 2022:345-356. doi:10.1145/3490148.3538595'
apa: Castenow, J., Feldkord, B., Knollmann, T., Malatyali, M., & Meyer auf der
Heide, F. (2022). The k-Server with Preferences Problem. Proceedings of the
34th ACM Symposium on Parallelism in Algorithms and Architectures, 345–356.
https://doi.org/10.1145/3490148.3538595
bibtex: '@inproceedings{Castenow_Feldkord_Knollmann_Malatyali_Meyer auf der Heide_2022,
title={The k-Server with Preferences Problem}, DOI={10.1145/3490148.3538595},
booktitle={Proceedings of the 34th ACM Symposium on Parallelism in Algorithms
and Architectures}, publisher={Association for Computing Machinery}, author={Castenow,
Jannik and Feldkord, Björn and Knollmann, Till and Malatyali, Manuel and Meyer
auf der Heide, Friedhelm}, year={2022}, pages={345–356} }'
chicago: Castenow, Jannik, Björn Feldkord, Till Knollmann, Manuel Malatyali, and
Friedhelm Meyer auf der Heide. “The K-Server with Preferences Problem.” In Proceedings
of the 34th ACM Symposium on Parallelism in Algorithms and Architectures,
345–56. Association for Computing Machinery, 2022. https://doi.org/10.1145/3490148.3538595.
ieee: 'J. Castenow, B. Feldkord, T. Knollmann, M. Malatyali, and F. Meyer auf der
Heide, “The k-Server with Preferences Problem,” in Proceedings of the 34th
ACM Symposium on Parallelism in Algorithms and Architectures, 2022, pp. 345–356,
doi: 10.1145/3490148.3538595.'
mla: Castenow, Jannik, et al. “The K-Server with Preferences Problem.” Proceedings
of the 34th ACM Symposium on Parallelism in Algorithms and Architectures,
Association for Computing Machinery, 2022, pp. 345–56, doi:10.1145/3490148.3538595.
short: 'J. Castenow, B. Feldkord, T. Knollmann, M. Malatyali, F. Meyer auf der Heide,
in: Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures,
Association for Computing Machinery, 2022, pp. 345–356.'
date_created: 2022-06-10T09:06:42Z
date_updated: 2022-08-02T08:07:30Z
department:
- _id: '63'
doi: 10.1145/3490148.3538595
external_id:
arxiv:
- '2205.11102'
keyword:
- K-Server Problem
- Heterogeneity
- Online Caching
language:
- iso: eng
page: 345-356
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '2'
name: 'SFB 901 - A: SFB 901 - Project Area A'
- _id: '5'
name: 'SFB 901 - A1: SFB 901 - Subproject A1'
publication: Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and
Architectures
publication_identifier:
isbn:
- '9781450391467'
publisher: Association for Computing Machinery
status: public
title: The k-Server with Preferences Problem
type: conference
user_id: '39241'
year: '2022'
...
---
_id: '34023'
abstract:
- lang: eng
text: Decision makers increasingly rely on decision support systems for optimal
decision making. Recently, special attention has been paid to process-driven decision
support systems (PD-DSS) in which a process model prescribes the invocation sequence
of software-based decision support services and the data exchange between them.
Thus, it is possible to quickly combine available decision support services as
needed for optimally supporting the decision making process of an individual decision
maker. However, process modelers may accidentally create a process model which
is technically well-formed and executable, but contains functional and behavioral
flaws such as redundant or missing services. These flaws may result in inefficient
computations or invalid decision recommendations when the corresponding PD-DSS
is utilized by a decision maker. In this paper, we therefore propose an approach
to validate functionality and behavior of a process model representing a PD-DSS.
Our approach is based on expressing flaws as anti-patterns for which the process
model can be automatically checked via graph matching. We prototypically implemented
our approach and demonstrate its applicability in the context of decision making
for energy network planning.
author:
- first_name: Jonas
full_name: Kirchhoff, Jonas
id: '39928'
last_name: Kirchhoff
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
citation:
ama: 'Kirchhoff J, Engels G. Anti-pattern Detection in Process-Driven Decision Support
Systems. In: Software Business. Vol 463. Lecture Notes in Business Information
Processing. Springer International Publishing; 2022:227--243. doi:10.1007/978-3-031-20706-8_16'
apa: Kirchhoff, J., & Engels, G. (2022). Anti-pattern Detection in Process-Driven
Decision Support Systems. In Software Business (Vol. 463, pp. 227--243).
Springer International Publishing. https://doi.org/10.1007/978-3-031-20706-8_16
bibtex: '@inbook{Kirchhoff_Engels_2022, place={Cham}, series={Lecture Notes in Business
Information Processing}, title={Anti-pattern Detection in Process-Driven Decision
Support Systems}, volume={463}, DOI={10.1007/978-3-031-20706-8_16},
booktitle={Software Business}, publisher={Springer International Publishing},
author={Kirchhoff, Jonas and Engels, Gregor}, year={2022}, pages={227--243}, collection={Lecture
Notes in Business Information Processing} }'
chicago: 'Kirchhoff, Jonas, and Gregor Engels. “Anti-Pattern Detection in Process-Driven
Decision Support Systems.” In Software Business, 463:227--243. Lecture
Notes in Business Information Processing. Cham: Springer International Publishing,
2022. https://doi.org/10.1007/978-3-031-20706-8_16.'
ieee: 'J. Kirchhoff and G. Engels, “Anti-pattern Detection in Process-Driven Decision
Support Systems,” in Software Business, vol. 463, Cham: Springer International
Publishing, 2022, pp. 227--243.'
mla: Kirchhoff, Jonas, and Gregor Engels. “Anti-Pattern Detection in Process-Driven
Decision Support Systems.” Software Business, vol. 463, Springer International
Publishing, 2022, pp. 227--243, doi:10.1007/978-3-031-20706-8_16.
short: 'J. Kirchhoff, G. Engels, in: Software Business, Springer International Publishing,
Cham, 2022, pp. 227--243.'
date_created: 2022-11-07T10:51:24Z
date_updated: 2022-11-07T10:54:30Z
department:
- _id: '534'
- _id: '66'
doi: 10.1007/978-3-031-20706-8_16
intvolume: ' 463'
language:
- iso: eng
page: 227--243
place: Cham
publication: Software Business
publication_identifier:
isbn:
- '9783031207051'
- '9783031207068'
issn:
- 1865-1348
- 1865-1356
publication_status: published
publisher: Springer International Publishing
series_title: Lecture Notes in Business Information Processing
status: public
title: Anti-pattern Detection in Process-Driven Decision Support Systems
type: book_chapter
user_id: '39928'
volume: 463
year: '2022'
...
---
_id: '34040'
abstract:
- lang: eng
text: "Consider the practical goal of making a desired action profile played,\r\n\r\nwhen
the planner can only change the payoffs, bound by \r\n\r\nstringent constraints.\r\n\r\nApplications
include motivating people\r\n\r\nto choose the closest school, the closest subway
station, or to coordinate\r\n\r\non a communication protocol or an investment
strategy.\r\n\r\nEmploying subsidies and tolls, we adjust the game so that choosing
this predefined action profile\r\n\r\nbecomes strictly dominant. \r\n\r\nInspired
mainly by the work of Monderer and Tennenholtz,\r\n\r\nwhere the promised subsidies
do not materialise in the not played\r\n\r\nprofiles, we provide a fair and individually
rational game\r\n\r\nadjustment, such that the total outside investments sum up\r\n\r\nto
zero at any profile, thereby facilitating easy and frequent\r\n\r\nusage of our
adjustment without bearing costs, even if some\r\n\r\nplayers behave unexpectedly.
The resultant action profile itself needs no\r\n\r\nadjustment. Importantly, we
also prove that our adjustment minimises \r\n\r\nthe general transfer among all
such adjustments, counting the total subsidising and taxation."
author:
- first_name: Gleb
full_name: Polevoy, Gleb
id: '83983'
last_name: Polevoy
- first_name: Marcin
full_name: Dziubiński, Marcin
last_name: Dziubiński
citation:
ama: 'Polevoy G, Dziubiński M. Fair, Individually Rational and Cheap Adjustment.
In: De Raedt L, ed. Proceedings of the Thirty-First International Joint Conference
on Artificial Intelligence. International Joint Conferences on Artificial
Intelligence Organization; 2022. doi:10.24963/ijcai.2022/64'
apa: Polevoy, G., & Dziubiński, M. (2022). Fair, Individually Rational and Cheap
Adjustment. In L. De Raedt (Ed.), Proceedings of the Thirty-First International
Joint Conference on Artificial Intelligence. International Joint Conferences
on Artificial Intelligence Organization. https://doi.org/10.24963/ijcai.2022/64
bibtex: '@inproceedings{Polevoy_Dziubiński_2022, title={Fair, Individually Rational
and Cheap Adjustment}, DOI={10.24963/ijcai.2022/64},
booktitle={Proceedings of the Thirty-First International Joint Conference on Artificial
Intelligence}, publisher={International Joint Conferences on Artificial Intelligence
Organization}, author={Polevoy, Gleb and Dziubiński, Marcin}, editor={De Raedt,
Luc}, year={2022} }'
chicago: Polevoy, Gleb, and Marcin Dziubiński. “Fair, Individually Rational and
Cheap Adjustment.” In Proceedings of the Thirty-First International Joint Conference
on Artificial Intelligence, edited by Luc De Raedt. International Joint Conferences
on Artificial Intelligence Organization, 2022. https://doi.org/10.24963/ijcai.2022/64.
ieee: 'G. Polevoy and M. Dziubiński, “Fair, Individually Rational and Cheap Adjustment,”
in Proceedings of the Thirty-First International Joint Conference on Artificial
Intelligence, Vienna, 2022, doi: 10.24963/ijcai.2022/64.'
mla: Polevoy, Gleb, and Marcin Dziubiński. “Fair, Individually Rational and Cheap
Adjustment.” Proceedings of the Thirty-First International Joint Conference
on Artificial Intelligence, edited by Luc De Raedt, International Joint Conferences
on Artificial Intelligence Organization, 2022, doi:10.24963/ijcai.2022/64.
short: 'G. Polevoy, M. Dziubiński, in: L. De Raedt (Ed.), Proceedings of the Thirty-First
International Joint Conference on Artificial Intelligence, International Joint
Conferences on Artificial Intelligence Organization, 2022.'
conference:
end_date: 2022-07-29
location: Vienna
name: THE 31ST INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE
start_date: 2022-07-23
date_created: 2022-11-08T16:53:31Z
date_updated: 2022-11-08T17:34:36Z
department:
- _id: '63'
- _id: '541'
doi: 10.24963/ijcai.2022/64
editor:
- first_name: Luc
full_name: De Raedt, Luc
last_name: De Raedt
keyword:
- adjustment
- strictly dominant
- fairness
- individually rational
- transfer
- tax
- subsidy
language:
- iso: eng
main_file_link:
- url: https://www.ijcai.org/proceedings/2022/64
publication: Proceedings of the Thirty-First International Joint Conference on Artificial
Intelligence
publication_status: published
publisher: International Joint Conferences on Artificial Intelligence Organization
status: public
title: Fair, Individually Rational and Cheap Adjustment
type: conference
user_id: '83983'
year: '2022'
...
---
_id: '33085'
author:
- first_name: Leah
full_name: Epstein, Leah
last_name: Epstein
- first_name: Alexandra
full_name: Lassota, Alexandra
last_name: Lassota
- first_name: Asaf
full_name: Levin, Asaf
last_name: Levin
- first_name: Marten
full_name: Maack, Marten
id: '88252'
last_name: Maack
- first_name: Lars
full_name: Rohwedder, Lars
last_name: Rohwedder
citation:
ama: 'Epstein L, Lassota A, Levin A, Maack M, Rohwedder L. Cardinality Constrained
Scheduling in Online Models. In: Berenbrink P, Monmege B, eds. 39th International
Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18,
2022, Marseille, France (Virtual Conference). Vol 219. LIPIcs. Schloss Dagstuhl
- Leibniz-Zentrum für Informatik; 2022:28:1–28:15. doi:10.4230/LIPIcs.STACS.2022.28'
apa: Epstein, L., Lassota, A., Levin, A., Maack, M., & Rohwedder, L. (2022).
Cardinality Constrained Scheduling in Online Models. In P. Berenbrink & B.
Monmege (Eds.), 39th International Symposium on Theoretical Aspects of Computer
Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference)
(Vol. 219, p. 28:1–28:15). Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPIcs.STACS.2022.28
bibtex: '@inproceedings{Epstein_Lassota_Levin_Maack_Rohwedder_2022, series={LIPIcs},
title={Cardinality Constrained Scheduling in Online Models}, volume={219}, DOI={10.4230/LIPIcs.STACS.2022.28},
booktitle={39th International Symposium on Theoretical Aspects of Computer Science,
STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference)}, publisher={Schloss
Dagstuhl - Leibniz-Zentrum für Informatik}, author={Epstein, Leah and Lassota,
Alexandra and Levin, Asaf and Maack, Marten and Rohwedder, Lars}, editor={Berenbrink,
Petra and Monmege, Benjamin}, year={2022}, pages={28:1–28:15}, collection={LIPIcs}
}'
chicago: Epstein, Leah, Alexandra Lassota, Asaf Levin, Marten Maack, and Lars Rohwedder.
“Cardinality Constrained Scheduling in Online Models.” In 39th International
Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18,
2022, Marseille, France (Virtual Conference), edited by Petra Berenbrink and
Benjamin Monmege, 219:28:1–28:15. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für
Informatik, 2022. https://doi.org/10.4230/LIPIcs.STACS.2022.28.
ieee: 'L. Epstein, A. Lassota, A. Levin, M. Maack, and L. Rohwedder, “Cardinality
Constrained Scheduling in Online Models,” in 39th International Symposium on
Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille,
France (Virtual Conference), 2022, vol. 219, p. 28:1–28:15, doi: 10.4230/LIPIcs.STACS.2022.28.'
mla: Epstein, Leah, et al. “Cardinality Constrained Scheduling in Online Models.”
39th International Symposium on Theoretical Aspects of Computer Science, STACS
2022, March 15-18, 2022, Marseille, France (Virtual Conference), edited by
Petra Berenbrink and Benjamin Monmege, vol. 219, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2022, p. 28:1–28:15, doi:10.4230/LIPIcs.STACS.2022.28.
short: 'L. Epstein, A. Lassota, A. Levin, M. Maack, L. Rohwedder, in: P. Berenbrink,
B. Monmege (Eds.), 39th International Symposium on Theoretical Aspects of Computer
Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference),
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 28:1–28:15.'
date_created: 2022-08-23T08:10:36Z
date_updated: 2022-11-08T16:34:32Z
department:
- _id: '63'
doi: 10.4230/LIPIcs.STACS.2022.28
editor:
- first_name: Petra
full_name: Berenbrink, Petra
last_name: Berenbrink
- first_name: Benjamin
full_name: Monmege, Benjamin
last_name: Monmege
intvolume: ' 219'
language:
- iso: eng
page: 28:1–28:15
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: 39th International Symposium on Theoretical Aspects of Computer Science,
STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference)
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
series_title: LIPIcs
status: public
title: Cardinality Constrained Scheduling in Online Models
type: conference
user_id: '88252'
volume: 219
year: '2022'
...
---
_id: '33004'
author:
- first_name: Henning
full_name: Wachsmuth, Henning
id: '3900'
last_name: Wachsmuth
- first_name: Milad
full_name: Alshomary, Milad
id: '73059'
last_name: Alshomary
citation:
ama: 'Wachsmuth H, Alshomary M. “Mama Always Had a Way of Explaining Things So I
Could Understand”: A Dialogue Corpus for Learning How to Explain. In: Proceedings
of the 29th International Conference on Computational Linguistics. ; 2022:344-354.'
apa: 'Wachsmuth, H., & Alshomary, M. (2022). “Mama Always Had a Way of Explaining
Things So I Could Understand”: A Dialogue Corpus for Learning How to Explain.
Proceedings of the 29th International Conference on Computational Linguistics,
344–354.'
bibtex: '@inproceedings{Wachsmuth_Alshomary_2022, title={“Mama Always Had a Way
of Explaining Things So I Could Understand”: A Dialogue Corpus for Learning How
to Explain}, booktitle={Proceedings of the 29th International Conference on Computational
Linguistics}, author={Wachsmuth, Henning and Alshomary, Milad}, year={2022}, pages={344–354}
}'
chicago: 'Wachsmuth, Henning, and Milad Alshomary. “‘Mama Always Had a Way of Explaining
Things So I Could Understand’: A Dialogue Corpus for Learning How to Explain.”
In Proceedings of the 29th International Conference on Computational Linguistics,
344–54, 2022.'
ieee: 'H. Wachsmuth and M. Alshomary, “‘Mama Always Had a Way of Explaining Things
So I Could Understand’: A Dialogue Corpus for Learning How to Explain,” in Proceedings
of the 29th International Conference on Computational Linguistics, 2022, pp.
344–354.'
mla: 'Wachsmuth, Henning, and Milad Alshomary. “‘Mama Always Had a Way of Explaining
Things So I Could Understand’: A Dialogue Corpus for Learning How to Explain.”
Proceedings of the 29th International Conference on Computational Linguistics,
2022, pp. 344–54.'
short: 'H. Wachsmuth, M. Alshomary, in: Proceedings of the 29th International Conference
on Computational Linguistics, 2022, pp. 344–354.'
date_created: 2022-08-18T10:00:46Z
date_updated: 2022-11-10T09:06:39Z
department:
- _id: '600'
language:
- iso: eng
page: 344 - 354
publication: Proceedings of the 29th International Conference on Computational Linguistics
status: public
title: '"Mama Always Had a Way of Explaining Things So I Could Understand": A Dialogue
Corpus for Learning How to Explain'
type: conference
user_id: '82920'
year: '2022'
...
---
_id: '34049'
author:
- first_name: Anne
full_name: Lauscher, Anne
last_name: Lauscher
- first_name: Henning
full_name: Wachsmuth, Henning
id: '3900'
last_name: Wachsmuth
- first_name: Iryna
full_name: Gurevych, Iryna
last_name: Gurevych
- first_name: Goran
full_name: Glavaš, Goran
last_name: Glavaš
citation:
ama: Lauscher A, Wachsmuth H, Gurevych I, Glavaš G. On the Role of Knowledge in
Computational Argumentation. Transactions of the Association for Computational
Linguistics. Published online 2022.
apa: Lauscher, A., Wachsmuth, H., Gurevych, I., & Glavaš, G. (2022). On the
Role of Knowledge in Computational Argumentation. Transactions of the Association
for Computational Linguistics.
bibtex: '@article{Lauscher_Wachsmuth_Gurevych_Glavaš_2022, title={On the Role of
Knowledge in Computational Argumentation}, journal={Transactions of the Association
for Computational Linguistics}, author={Lauscher, Anne and Wachsmuth, Henning
and Gurevych, Iryna and Glavaš, Goran}, year={2022} }'
chicago: Lauscher, Anne, Henning Wachsmuth, Iryna Gurevych, and Goran Glavaš. “On
the Role of Knowledge in Computational Argumentation.” Transactions of the
Association for Computational Linguistics, 2022.
ieee: A. Lauscher, H. Wachsmuth, I. Gurevych, and G. Glavaš, “On the Role of Knowledge
in Computational Argumentation,” Transactions of the Association for Computational
Linguistics, 2022.
mla: Lauscher, Anne, et al. “On the Role of Knowledge in Computational Argumentation.”
Transactions of the Association for Computational Linguistics, 2022.
short: A. Lauscher, H. Wachsmuth, I. Gurevych, G. Glavaš, Transactions of the Association
for Computational Linguistics (2022).
date_created: 2022-11-10T08:39:38Z
date_updated: 2022-11-10T08:39:48Z
department:
- _id: '600'
language:
- iso: eng
publication: Transactions of the Association for Computational Linguistics
status: public
title: On the Role of Knowledge in Computational Argumentation
type: journal_article
user_id: '82920'
year: '2022'
...
---
_id: '22157'
author:
- first_name: Johannes
full_name: Kiesel, Johannes
last_name: Kiesel
- first_name: Milad
full_name: Alshomary, Milad
id: '73059'
last_name: Alshomary
- first_name: Nicolas
full_name: Handke, Nicolas
last_name: Handke
- first_name: Xiaoni
full_name: Cai, Xiaoni
last_name: Cai
- first_name: Henning
full_name: Wachsmuth, Henning
id: '3900'
last_name: Wachsmuth
- first_name: Benno
full_name: Stein, Benno
last_name: Stein
citation:
ama: 'Kiesel J, Alshomary M, Handke N, Cai X, Wachsmuth H, Stein B. Identifying
the Human Values behind Arguments. In: Proceedings of the 60th Annual Meeting
of the Association for Computational Linguistics. ; 2022:4459-4471.'
apa: Kiesel, J., Alshomary, M., Handke, N., Cai, X., Wachsmuth, H., & Stein,
B. (2022). Identifying the Human Values behind Arguments. Proceedings of the
60th Annual Meeting of the Association for Computational Linguistics, 4459–4471.
bibtex: '@inproceedings{Kiesel_Alshomary_Handke_Cai_Wachsmuth_Stein_2022, title={Identifying
the Human Values behind Arguments}, booktitle={Proceedings of the 60th Annual
Meeting of the Association for Computational Linguistics}, author={Kiesel, Johannes
and Alshomary, Milad and Handke, Nicolas and Cai, Xiaoni and Wachsmuth, Henning
and Stein, Benno}, year={2022}, pages={4459–4471} }'
chicago: Kiesel, Johannes, Milad Alshomary, Nicolas Handke, Xiaoni Cai, Henning
Wachsmuth, and Benno Stein. “Identifying the Human Values behind Arguments.” In
Proceedings of the 60th Annual Meeting of the Association for Computational
Linguistics, 4459–71, 2022.
ieee: J. Kiesel, M. Alshomary, N. Handke, X. Cai, H. Wachsmuth, and B. Stein, “Identifying
the Human Values behind Arguments,” in Proceedings of the 60th Annual Meeting
of the Association for Computational Linguistics, 2022, pp. 4459–4471.
mla: Kiesel, Johannes, et al. “Identifying the Human Values behind Arguments.” Proceedings
of the 60th Annual Meeting of the Association for Computational Linguistics,
2022, pp. 4459–71.
short: 'J. Kiesel, M. Alshomary, N. Handke, X. Cai, H. Wachsmuth, B. Stein, in:
Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics,
2022, pp. 4459–4471.'
date_created: 2021-05-11T23:15:42Z
date_updated: 2022-11-10T09:09:27Z
department:
- _id: '600'
language:
- iso: eng
page: 4459 - 4471
publication: Proceedings of the 60th Annual Meeting of the Association for Computational
Linguistics
status: public
title: Identifying the Human Values behind Arguments
type: conference
user_id: '82920'
year: '2022'
...
---
_id: '34057'
author:
- first_name: Faruk
full_name: Pasic, Faruk
last_name: Pasic
- first_name: Matthias
full_name: Becker, Matthias
last_name: Becker
citation:
ama: 'Pasic F, Becker M. Domain-specific Language for Condition Monitoring Software
Development. In: 2022 IEEE 27th International Conference on Emerging Technologies
and Factory Automation (ETFA). IEEE; 2022. doi:10.1109/etfa52439.2022.9921730'
apa: Pasic, F., & Becker, M. (2022). Domain-specific Language for Condition
Monitoring Software Development. 2022 IEEE 27th International Conference on
Emerging Technologies and Factory Automation (ETFA). https://doi.org/10.1109/etfa52439.2022.9921730
bibtex: '@inproceedings{Pasic_Becker_2022, title={Domain-specific Language for Condition
Monitoring Software Development}, DOI={10.1109/etfa52439.2022.9921730},
booktitle={2022 IEEE 27th International Conference on Emerging Technologies and
Factory Automation (ETFA)}, publisher={IEEE}, author={Pasic, Faruk and Becker,
Matthias}, year={2022} }'
chicago: Pasic, Faruk, and Matthias Becker. “Domain-Specific Language for Condition
Monitoring Software Development.” In 2022 IEEE 27th International Conference
on Emerging Technologies and Factory Automation (ETFA). IEEE, 2022. https://doi.org/10.1109/etfa52439.2022.9921730.
ieee: 'F. Pasic and M. Becker, “Domain-specific Language for Condition Monitoring
Software Development,” 2022, doi: 10.1109/etfa52439.2022.9921730.'
mla: Pasic, Faruk, and Matthias Becker. “Domain-Specific Language for Condition
Monitoring Software Development.” 2022 IEEE 27th International Conference on
Emerging Technologies and Factory Automation (ETFA), IEEE, 2022, doi:10.1109/etfa52439.2022.9921730.
short: 'F. Pasic, M. Becker, in: 2022 IEEE 27th International Conference on Emerging
Technologies and Factory Automation (ETFA), IEEE, 2022.'
date_created: 2022-11-10T14:30:16Z
date_updated: 2022-11-10T14:30:42Z
department:
- _id: '241'
- _id: '76'
doi: 10.1109/etfa52439.2022.9921730
publication: 2022 IEEE 27th International Conference on Emerging Technologies and
Factory Automation (ETFA)
publication_status: published
publisher: IEEE
status: public
title: Domain-specific Language for Condition Monitoring Software Development
type: conference
user_id: '49576'
year: '2022'
...
---
_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'
...