---
_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: '30916'
author:
- first_name: Janina
full_name: Seutter, Janina
id: '64464'
last_name: Seutter
citation:
ama: 'Seutter J. Online Reviews in B2B Markets: A Qualitative Study of Underlying
Motivations. In: Proceedings of the 30th European Conference on Information
Systems (ECIS).'
apa: 'Seutter, J. (n.d.). Online Reviews in B2B Markets: A Qualitative Study of
Underlying Motivations. Proceedings of the 30th European Conference on Information
Systems (ECIS). Proceedings of the 30th European Conference on Information
Systems (ECIS), Timișoara, Romania.'
bibtex: '@inproceedings{Seutter, title={Online Reviews in B2B Markets: A Qualitative
Study of Underlying Motivations}, booktitle={Proceedings of the 30th European
Conference on Information Systems (ECIS)}, author={Seutter, Janina} }'
chicago: 'Seutter, Janina. “Online Reviews in B2B Markets: A Qualitative Study of
Underlying Motivations.” In Proceedings of the 30th European Conference on
Information Systems (ECIS), n.d.'
ieee: 'J. Seutter, “Online Reviews in B2B Markets: A Qualitative Study of Underlying
Motivations,” presented at the Proceedings of the 30th European Conference on
Information Systems (ECIS), Timișoara, Romania.'
mla: 'Seutter, Janina. “Online Reviews in B2B Markets: A Qualitative Study of Underlying
Motivations.” Proceedings of the 30th European Conference on Information Systems
(ECIS).'
short: 'J. Seutter, in: Proceedings of the 30th European Conference on Information
Systems (ECIS), n.d.'
conference:
location: Timișoara, Romania
name: Proceedings of the 30th European Conference on Information Systems (ECIS)
date_created: 2022-04-19T12:26:29Z
date_updated: 2022-11-17T14:20:16Z
department:
- _id: '276'
language:
- iso: eng
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '2'
name: 'SFB 901 - A: SFB 901 - Project Area A'
- _id: '8'
name: 'SFB 901 - A4: SFB 901 - Subproject A4'
publication: Proceedings of the 30th European Conference on Information Systems (ECIS)
publication_status: accepted
status: public
title: 'Online Reviews in B2B Markets: A Qualitative Study of Underlying Motivations'
type: conference_abstract
user_id: '477'
year: '2022'
...
---
_id: '31062'
author:
- first_name: Martin
full_name: Poniatowski, Martin
id: '32441'
last_name: Poniatowski
citation:
ama: 'Poniatowski M. How the Display of the Transaction Count Affects the Purchase
Intention. In: Proceedings of the 28th Americas Conference on Information Systems
(AMCIS).'
apa: Poniatowski, M. (n.d.). How the Display of the Transaction Count Affects the
Purchase Intention. Proceedings of the 28th Americas Conference on Information
Systems (AMCIS). 28th Americas Conference on Information Systems (AMCIS),
Minneapolis, USA.
bibtex: '@inproceedings{Poniatowski, title={How the Display of the Transaction Count
Affects the Purchase Intention}, booktitle={Proceedings of the 28th Americas Conference
on Information Systems (AMCIS)}, author={Poniatowski, Martin} }'
chicago: Poniatowski, Martin. “How the Display of the Transaction Count Affects
the Purchase Intention.” In Proceedings of the 28th Americas Conference on
Information Systems (AMCIS), n.d.
ieee: M. Poniatowski, “How the Display of the Transaction Count Affects the Purchase
Intention,” presented at the 28th Americas Conference on Information Systems (AMCIS),
Minneapolis, USA.
mla: Poniatowski, Martin. “How the Display of the Transaction Count Affects the
Purchase Intention.” Proceedings of the 28th Americas Conference on Information
Systems (AMCIS).
short: 'M. Poniatowski, in: Proceedings of the 28th Americas Conference on Information
Systems (AMCIS), n.d.'
conference:
location: Minneapolis, USA
name: 28th Americas Conference on Information Systems (AMCIS)
date_created: 2022-05-04T14:02:31Z
date_updated: 2022-11-17T14:20:07Z
department:
- _id: '276'
language:
- iso: eng
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '2'
name: 'SFB 901 - A: SFB 901 - Project Area A'
- _id: '8'
name: 'SFB 901 - A4: SFB 901 - Subproject A4'
publication: Proceedings of the 28th Americas Conference on Information Systems (AMCIS)
publication_status: accepted
status: public
title: How the Display of the Transaction Count Affects the Purchase Intention
type: conference_abstract
user_id: '477'
year: '2022'
...
---
_id: '30939'
author:
- first_name: Christian
full_name: Vorbohle, Christian
id: '29951'
last_name: Vorbohle
- first_name: Dennis
full_name: Kundisch, Dennis
id: '21117'
last_name: Kundisch
citation:
ama: 'Vorbohle C, Kundisch D. Overcoming Silos: A Review of Business Model Modeling
Languages for Business Ecosystems. In: Proceedings of the 30th European Conference
on Information Systems (ECIS). ; 2022.'
apa: 'Vorbohle, C., & Kundisch, D. (2022). Overcoming Silos: A Review of Business
Model Modeling Languages for Business Ecosystems. Proceedings of the 30th European
Conference on Information Systems (ECIS). Proceedings of the 30th European
Conference on Information Systems (ECIS), Timișoara, Romania.'
bibtex: '@inproceedings{Vorbohle_Kundisch_2022, title={Overcoming Silos: A Review
of Business Model Modeling Languages for Business Ecosystems}, booktitle={Proceedings
of the 30th European Conference on Information Systems (ECIS)}, author={Vorbohle,
Christian and Kundisch, Dennis}, year={2022} }'
chicago: 'Vorbohle, Christian, and Dennis Kundisch. “Overcoming Silos: A Review
of Business Model Modeling Languages for Business Ecosystems.” In Proceedings
of the 30th European Conference on Information Systems (ECIS), 2022.'
ieee: 'C. Vorbohle and D. Kundisch, “Overcoming Silos: A Review of Business Model
Modeling Languages for Business Ecosystems,” presented at the Proceedings of the
30th European Conference on Information Systems (ECIS), Timișoara, Romania, 2022.'
mla: 'Vorbohle, Christian, and Dennis Kundisch. “Overcoming Silos: A Review of Business
Model Modeling Languages for Business Ecosystems.” Proceedings of the 30th
European Conference on Information Systems (ECIS), 2022.'
short: 'C. Vorbohle, D. Kundisch, in: Proceedings of the 30th European Conference
on Information Systems (ECIS), 2022.'
conference:
location: Timișoara, Romania
name: Proceedings of the 30th European Conference on Information Systems (ECIS)
date_created: 2022-04-22T11:36:50Z
date_updated: 2022-11-17T14:21:40Z
department:
- _id: '276'
language:
- iso: eng
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
- _id: '17'
name: 'SFB 901 - C5: SFB 901 - Subproject C5'
publication: Proceedings of the 30th European Conference on Information Systems (ECIS)
status: public
title: 'Overcoming Silos: A Review of Business Model Modeling Languages for Business
Ecosystems'
type: conference
user_id: '477'
year: '2022'
...
---
_id: '30734'
author:
- first_name: Maike
full_name: Althaus, Maike
id: '61896'
last_name: Althaus
- first_name: Martin
full_name: Poniatowski, Martin
id: '32441'
last_name: Poniatowski
- first_name: Dennis
full_name: Kundisch, Dennis
id: '21117'
last_name: Kundisch
citation:
ama: 'Althaus M, Poniatowski M, Kundisch D. Tackling Crises Together? - An Econometric
Analysis of Charitable Crowdfunding During the COVID-19 Pandemic. In: ; 2022.'
apa: Althaus, M., Poniatowski, M., & Kundisch, D. (2022). Tackling Crises
Together? - An Econometric Analysis of Charitable Crowdfunding During the COVID-19
Pandemic. Symposium on Statistical Challenges in Electronic Commerce Research
(SCECR), Madrid, Spain.
bibtex: '@inproceedings{Althaus_Poniatowski_Kundisch_2022, title={Tackling Crises
Together? - An Econometric Analysis of Charitable Crowdfunding During the COVID-19
Pandemic}, author={Althaus, Maike and Poniatowski, Martin and Kundisch, Dennis},
year={2022} }'
chicago: Althaus, Maike, Martin Poniatowski, and Dennis Kundisch. “Tackling Crises
Together? - An Econometric Analysis of Charitable Crowdfunding During the COVID-19
Pandemic,” 2022.
ieee: M. Althaus, M. Poniatowski, and D. Kundisch, “Tackling Crises Together? -
An Econometric Analysis of Charitable Crowdfunding During the COVID-19 Pandemic,”
presented at the Symposium on Statistical Challenges in Electronic Commerce Research
(SCECR), Madrid, Spain, 2022.
mla: Althaus, Maike, et al. Tackling Crises Together? - An Econometric Analysis
of Charitable Crowdfunding During the COVID-19 Pandemic. 2022.
short: 'M. Althaus, M. Poniatowski, D. Kundisch, in: 2022.'
conference:
location: Madrid, Spain
name: Symposium on Statistical Challenges in Electronic Commerce Research (SCECR)
date_created: 2022-04-01T11:58:15Z
date_updated: 2022-11-17T14:21:50Z
department:
- _id: '276'
language:
- iso: eng
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '2'
name: 'SFB 901 - A: SFB 901 - Project Area A'
- _id: '8'
name: 'SFB 901 - A4: SFB 901 - Subproject A4'
status: public
title: Tackling Crises Together? - An Econometric Analysis of Charitable Crowdfunding
During the COVID-19 Pandemic
type: conference_abstract
user_id: '477'
year: '2022'
...
---
_id: '30212'
author:
- first_name: Christian
full_name: Vorbohle, Christian
id: '29951'
last_name: Vorbohle
- first_name: Dennis
full_name: Kundisch, Dennis
id: '21117'
last_name: Kundisch
citation:
ama: 'Vorbohle C, Kundisch D. Key Properties of Sustainable Business Ecosystem Relationships.
In: ; 2022.'
apa: Vorbohle, C., & Kundisch, D. (2022). Key Properties of Sustainable Business
Ecosystem Relationships. Symplatform (Third Edition).
bibtex: '@inproceedings{Vorbohle_Kundisch_2022, title={Key Properties of Sustainable
Business Ecosystem Relationships}, author={Vorbohle, Christian and Kundisch, Dennis},
year={2022} }'
chicago: Vorbohle, Christian, and Dennis Kundisch. “Key Properties of Sustainable
Business Ecosystem Relationships,” 2022.
ieee: C. Vorbohle and D. Kundisch, “Key Properties of Sustainable Business Ecosystem
Relationships,” presented at the Symplatform (Third Edition), 2022.
mla: Vorbohle, Christian, and Dennis Kundisch. Key Properties of Sustainable
Business Ecosystem Relationships. 2022.
short: 'C. Vorbohle, D. Kundisch, in: 2022.'
conference:
name: Symplatform (Third Edition)
date_created: 2022-03-08T09:55:06Z
date_updated: 2022-11-17T14:23:02Z
department:
- _id: '276'
language:
- iso: eng
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
- _id: '17'
name: 'SFB 901 - C5: SFB 901 - Subproject C5'
status: public
title: Key Properties of Sustainable Business Ecosystem Relationships
type: conference_abstract
user_id: '477'
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: '34082'
abstract:
- lang: eng
text: Gender bias may emerge from an unequal representation of agency and power,
for example, by portraying women frequently as passive and powerless ("She accepted
her future'') and men as proactive and powerful ("He chose his future''). When
language models learn from respective texts, they may reproduce or even amplify
the bias. An effective way to mitigate bias is to generate counterfactual sentences
with opposite agency and power to the training. Recent work targeted agency-specific
verbs from a lexicon to this end. We argue that this is insufficient, due to the
interaction of agency and power and their dependence on context. In this paper,
we thus develop a new rewriting model that identifies verbs with the desired agency
and power in the context of the given sentence. The verbs' probability is then
boosted to encourage the model to rewrite both connotations jointly. According
to automatic metrics, our model effectively controls for power while being competitive
in agency to the state of the art. In our evaluation, human annotators favored
its counterfactuals in terms of both connotations, also deeming its meaning preservation
better.
author:
- first_name: Maja
full_name: Stahl, Maja
id: '77647'
last_name: Stahl
- first_name: Maximilian
full_name: Spliethöver, Maximilian
id: '84035'
last_name: Spliethöver
orcid: 0000-0003-4364-1409
- first_name: Henning
full_name: Wachsmuth, Henning
id: '3900'
last_name: Wachsmuth
citation:
ama: 'Stahl M, Spliethöver M, Wachsmuth H. To Prefer or to Choose? Generating Agency
and Power Counterfactuals Jointly for Gender Bias Mitigation. In: Proceedings
of the Fifth Workshop on Natural Language Processing and Computational Social
Science.'
apa: Stahl, M., Spliethöver, M., & Wachsmuth, H. (n.d.). To Prefer or to Choose?
Generating Agency and Power Counterfactuals Jointly for Gender Bias Mitigation.
Proceedings of the Fifth Workshop on Natural Language Processing and Computational
Social Science. Fifth Workshop on NLP and Computational Social Science (NLP+CSS)
At EMNLP 2022, Abu Dhabi, United Arab Emirates.
bibtex: '@inproceedings{Stahl_Spliethöver_Wachsmuth, place={Abu Dhabi, United Arab
Emirates}, title={To Prefer or to Choose? Generating Agency and Power Counterfactuals
Jointly for Gender Bias Mitigation}, booktitle={Proceedings of the Fifth Workshop
on Natural Language Processing and Computational Social Science}, author={Stahl,
Maja and Spliethöver, Maximilian and Wachsmuth, Henning} }'
chicago: Stahl, Maja, Maximilian Spliethöver, and Henning Wachsmuth. “To Prefer
or to Choose? Generating Agency and Power Counterfactuals Jointly for Gender Bias
Mitigation.” In Proceedings of the Fifth Workshop on Natural Language Processing
and Computational Social Science. Abu Dhabi, United Arab Emirates, n.d.
ieee: M. Stahl, M. Spliethöver, and H. Wachsmuth, “To Prefer or to Choose? Generating
Agency and Power Counterfactuals Jointly for Gender Bias Mitigation,” presented
at the Fifth Workshop on NLP and Computational Social Science (NLP+CSS) At EMNLP
2022, Abu Dhabi, United Arab Emirates.
mla: Stahl, Maja, et al. “To Prefer or to Choose? Generating Agency and Power Counterfactuals
Jointly for Gender Bias Mitigation.” Proceedings of the Fifth Workshop on Natural
Language Processing and Computational Social Science.
short: 'M. Stahl, M. Spliethöver, H. Wachsmuth, in: Proceedings of the Fifth Workshop
on Natural Language Processing and Computational Social Science, Abu Dhabi, United
Arab Emirates, n.d.'
conference:
location: Abu Dhabi, United Arab Emirates
name: Fifth Workshop on NLP and Computational Social Science (NLP+CSS) At EMNLP
2022
date_created: 2022-11-15T08:29:26Z
date_updated: 2022-11-18T08:22:56Z
extern: '1'
language:
- iso: eng
place: Abu Dhabi, United Arab Emirates
publication: Proceedings of the Fifth Workshop on Natural Language Processing and
Computational Social Science
publication_status: accepted
quality_controlled: '1'
status: public
title: To Prefer or to Choose? Generating Agency and Power Counterfactuals Jointly
for Gender Bias Mitigation
type: conference
user_id: '77647'
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: '34109'
author:
- first_name: Ruth Edith
full_name: Hagengruber, Ruth Edith
id: '198'
last_name: Hagengruber
orcid: https://orcid.org/0000-0003-3360-6335
citation:
ama: 'Hagengruber RE. Du Châtelet et la tradition critique de la Bible. De la ‘philofolie’
aux Examens. La Lettre clandestine n° 30: Émilie Du Châtelet et la littérature
clandestine Moreau, PF & Seguin, MS (Eds) Paris. Published online 2022:99
– 115.'
apa: 'Hagengruber, R. E. (2022). Du Châtelet et la tradition critique de la Bible.
De la ‘philofolie’ aux Examens. La Lettre clandestine n° 30: Émilie Du Châtelet
et la littérature clandestine. Moreau, P.F. & Seguin, M.S. (Eds.). Paris,
99 – 115.'
bibtex: '@article{Hagengruber_2022, title={Du Châtelet et la tradition critique
de la Bible. De la ‘philofolie’ aux Examens}, journal={La Lettre clandestine n°
30: Émilie Du Châtelet et la littérature clandestine. Moreau, P.F. & Seguin,
M.S. (Eds.). Paris}, publisher={Classiques Garnier}, author={Hagengruber, Ruth
Edith}, year={2022}, pages={99 – 115} }'
chicago: 'Hagengruber, Ruth Edith. “Du Châtelet et la tradition critique de la Bible.
De la ‘philofolie’ aux Examens.” La Lettre clandestine n° 30: Émilie Du Châtelet
et la littérature clandestine. Moreau, P.F. & Seguin, M.S. (Eds.). Paris,
2022, 99 – 115.'
ieee: 'R. E. Hagengruber, “Du Châtelet et la tradition critique de la Bible. De
la ‘philofolie’ aux Examens,” La Lettre clandestine n° 30: Émilie Du Châtelet
et la littérature clandestine. Moreau, P.F. & Seguin, M.S. (Eds.). Paris,
pp. 99 – 115, 2022.'
mla: 'Hagengruber, Ruth Edith. “Du Châtelet et la tradition critique de la Bible.
De la ‘philofolie’ aux Examens.” La Lettre clandestine n° 30: Émilie Du Châtelet
et la littérature clandestine. Moreau, P.F. & Seguin, M.S. (Eds.). Paris,
Classiques Garnier, 2022, pp. 99 – 115.'
short: 'R.E. Hagengruber, La Lettre clandestine n° 30: Émilie Du Châtelet et la
littérature clandestine. Moreau, P.F. & Seguin, M.S. (Eds.). Paris (2022)
99 – 115.'
date_created: 2022-11-17T16:37:52Z
date_updated: 2022-11-17T18:50:00Z
department:
- _id: '519'
language:
- iso: fre
page: 99 – 115
publication: 'La Lettre clandestine n° 30: Émilie Du Châtelet et la littérature clandestine.
Moreau, P.F. & Seguin, M.S. (Eds.). Paris'
publisher: Classiques Garnier
status: public
title: Du Châtelet et la tradition critique de la Bible. De la ‘philofolie’ aux Examens
type: journal_article
user_id: '49063'
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: '31806'
abstract:
- lang: eng
text: The creation of an RDF knowledge graph for a particular application commonly
involves a pipeline of tools that transform a set ofinput data sources into an
RDF knowledge graph in a process called dataset augmentation. The components of
such augmentation pipelines often require extensive configuration to lead to satisfactory
results. Thus, non-experts are often unable to use them. Wepresent an efficient
supervised algorithm based on genetic programming for learning knowledge graph
augmentation pipelines of arbitrary length. Our approach uses multi-expression
learning to learn augmentation pipelines able to achieve a high F-measure on the
training data. Our evaluation suggests that our approach can efficiently learn
a larger class of RDF dataset augmentation tasks than the state of the art while
using only a single training example. Even on the most complex augmentation problem
we posed, our approach consistently achieves an average F1-measure of 99% in under
500 iterations with an average runtime of 16 seconds
author:
- first_name: Kevin
full_name: Dreßler, Kevin
id: '78256'
last_name: Dreßler
- first_name: Mohamed
full_name: Sherif, Mohamed
id: '67234'
last_name: Sherif
- first_name: Axel-Cyrille
full_name: Ngonga Ngomo, Axel-Cyrille
id: '65716'
last_name: Ngonga Ngomo
citation:
ama: 'Dreßler K, Sherif M, Ngonga Ngomo A-C. ADAGIO - Automated Data Augmentation
of Knowledge Graphs Using Multi-expression Learning. In: Proceedings of the
33rd ACM Conference on Hypertext and Hypermedia. ; 2022. doi:10.1145/3511095.3531287'
apa: 'Dreßler, K., Sherif, M., & Ngonga Ngomo, A.-C. (2022). ADAGIO - Automated
Data Augmentation of Knowledge Graphs Using Multi-expression Learning. Proceedings
of the 33rd ACM Conference on Hypertext and Hypermedia. HT ’22: 33rd ACM Conference
on Hypertext and Social Media, Barcelona (Spain). https://doi.org/10.1145/3511095.3531287'
bibtex: '@inproceedings{Dreßler_Sherif_Ngonga Ngomo_2022, title={ADAGIO - Automated
Data Augmentation of Knowledge Graphs Using Multi-expression Learning}, DOI={10.1145/3511095.3531287}, booktitle={Proceedings
of the 33rd ACM Conference on Hypertext and Hypermedia}, author={Dreßler, Kevin
and Sherif, Mohamed and Ngonga Ngomo, Axel-Cyrille}, year={2022} }'
chicago: Dreßler, Kevin, Mohamed Sherif, and Axel-Cyrille Ngonga Ngomo. “ADAGIO
- Automated Data Augmentation of Knowledge Graphs Using Multi-Expression Learning.”
In Proceedings of the 33rd ACM Conference on Hypertext and Hypermedia,
2022. https://doi.org/10.1145/3511095.3531287.
ieee: 'K. Dreßler, M. Sherif, and A.-C. Ngonga Ngomo, “ADAGIO - Automated Data Augmentation
of Knowledge Graphs Using Multi-expression Learning,” presented at the HT ’22:
33rd ACM Conference on Hypertext and Social Media, Barcelona (Spain), 2022, doi:
10.1145/3511095.3531287.'
mla: Dreßler, Kevin, et al. “ADAGIO - Automated Data Augmentation of Knowledge Graphs
Using Multi-Expression Learning.” Proceedings of the 33rd ACM Conference on
Hypertext and Hypermedia, 2022, doi:10.1145/3511095.3531287.
short: 'K. Dreßler, M. Sherif, A.-C. Ngonga Ngomo, in: Proceedings of the 33rd ACM
Conference on Hypertext and Hypermedia, 2022.'
conference:
end_date: 2022-07-01
location: Barcelona (Spain)
name: 'HT ’22: 33rd ACM Conference on Hypertext and Social Media'
start_date: 2022-06-28
date_created: 2022-06-08T08:47:33Z
date_updated: 2022-11-18T10:11:38Z
ddc:
- '000'
department:
- _id: '34'
doi: 10.1145/3511095.3531287
keyword:
- 2022 RAKI SFB901 deer dice kevin knowgraphs limes ngonga sherif simba
language:
- iso: eng
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '3'
name: 'SFB 901 - B: SFB 901 - Project Area B'
- _id: '10'
name: 'SFB 901 - B2: SFB 901 - Subproject B2'
publication: Proceedings of the 33rd ACM Conference on Hypertext and Hypermedia
status: public
title: ADAGIO - Automated Data Augmentation of Knowledge Graphs Using Multi-expression
Learning
type: conference
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'
...