---
_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'
...
---
_id: '33253'
author:
- first_name: Tim
full_name: Hansmeier, Tim
id: '49992'
last_name: Hansmeier
orcid: 0000-0003-1377-3339
- first_name: Mathis
full_name: Brede, Mathis
last_name: Brede
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
citation:
ama: 'Hansmeier T, Brede M, Platzner M. XCS on Embedded Systems: An Analysis of
Execution Profiles and Accelerated Classifier Deletion. In: GECCO ’22: Proceedings
of the Genetic and Evolutionary Computation Conference Companion. Association
for Computing Machinery (ACM); 2022:2071-2079. doi:10.1145/3520304.3533977'
apa: 'Hansmeier, T., Brede, M., & Platzner, M. (2022). XCS on Embedded Systems:
An Analysis of Execution Profiles and Accelerated Classifier Deletion. GECCO
’22: Proceedings of the Genetic and Evolutionary Computation Conference Companion,
2071–2079. https://doi.org/10.1145/3520304.3533977'
bibtex: '@inproceedings{Hansmeier_Brede_Platzner_2022, place={New York, NY, United
States}, title={XCS on Embedded Systems: An Analysis of Execution Profiles and
Accelerated Classifier Deletion}, DOI={10.1145/3520304.3533977},
booktitle={GECCO ’22: Proceedings of the Genetic and Evolutionary Computation
Conference Companion}, publisher={Association for Computing Machinery (ACM)},
author={Hansmeier, Tim and Brede, Mathis and Platzner, Marco}, year={2022}, pages={2071–2079}
}'
chicago: 'Hansmeier, Tim, Mathis Brede, and Marco Platzner. “XCS on Embedded Systems:
An Analysis of Execution Profiles and Accelerated Classifier Deletion.” In GECCO
’22: Proceedings of the Genetic and Evolutionary Computation Conference Companion,
2071–79. New York, NY, United States: Association for Computing Machinery (ACM),
2022. https://doi.org/10.1145/3520304.3533977.'
ieee: 'T. Hansmeier, M. Brede, and M. Platzner, “XCS on Embedded Systems: An Analysis
of Execution Profiles and Accelerated Classifier Deletion,” in GECCO ’22: Proceedings
of the Genetic and Evolutionary Computation Conference Companion, Boston,
MA, USA, 2022, pp. 2071–2079, doi: 10.1145/3520304.3533977.'
mla: 'Hansmeier, Tim, et al. “XCS on Embedded Systems: An Analysis of Execution
Profiles and Accelerated Classifier Deletion.” GECCO ’22: Proceedings of the
Genetic and Evolutionary Computation Conference Companion, Association for
Computing Machinery (ACM), 2022, pp. 2071–79, doi:10.1145/3520304.3533977.'
short: 'T. Hansmeier, M. Brede, M. Platzner, in: GECCO ’22: Proceedings of the Genetic
and Evolutionary Computation Conference Companion, Association for Computing Machinery
(ACM), New York, NY, United States, 2022, pp. 2071–2079.'
conference:
end_date: 2022-07-13
location: Boston, MA, USA
name: International Workshop on Learning Classifier Systems (IWLCS 2022)
start_date: 2022-07-09
date_created: 2022-09-02T11:47:17Z
date_updated: 2022-11-18T10:13:22Z
department:
- _id: '78'
doi: 10.1145/3520304.3533977
language:
- iso: eng
page: 2071-2079
place: New York, NY, United States
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '14'
name: 'SFB 901 - C2: SFB 901 - Subproject C2'
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
publication: 'GECCO ''22: Proceedings of the Genetic and Evolutionary Computation
Conference Companion'
publication_status: published
publisher: Association for Computing Machinery (ACM)
status: public
title: 'XCS on Embedded Systems: An Analysis of Execution Profiles and Accelerated
Classifier Deletion'
type: conference
user_id: '477'
year: '2022'
...
---
_id: '33274'
author:
- first_name: Wei-Fan
full_name: Chen, Wei-Fan
id: '82920'
last_name: Chen
- first_name: Mei-Hua
full_name: Chen, Mei-Hua
last_name: Chen
- first_name: Garima
full_name: Mudgal, Garima
last_name: Mudgal
- first_name: Henning
full_name: Wachsmuth, Henning
id: '3900'
last_name: Wachsmuth
citation:
ama: 'Chen W-F, Chen M-H, Mudgal G, Wachsmuth H. Analyzing Culture-Specific Argument
Structures in Learner Essays. In: Proceedings of the 9th Workshop on Argument
Mining (ArgMining 2022). ; 2022:51-61.'
apa: Chen, W.-F., Chen, M.-H., Mudgal, G., & Wachsmuth, H. (2022). Analyzing
Culture-Specific Argument Structures in Learner Essays. Proceedings of the
9th Workshop on Argument Mining (ArgMining 2022), 51–61.
bibtex: '@inproceedings{Chen_Chen_Mudgal_Wachsmuth_2022, title={Analyzing Culture-Specific
Argument Structures in Learner Essays}, booktitle={Proceedings of the 9th Workshop
on Argument Mining (ArgMining 2022)}, author={Chen, Wei-Fan and Chen, Mei-Hua
and Mudgal, Garima and Wachsmuth, Henning}, year={2022}, pages={51–61} }'
chicago: Chen, Wei-Fan, Mei-Hua Chen, Garima Mudgal, and Henning Wachsmuth. “Analyzing
Culture-Specific Argument Structures in Learner Essays.” In Proceedings of
the 9th Workshop on Argument Mining (ArgMining 2022), 51–61, 2022.
ieee: W.-F. Chen, M.-H. Chen, G. Mudgal, and H. Wachsmuth, “Analyzing Culture-Specific
Argument Structures in Learner Essays,” in Proceedings of the 9th Workshop
on Argument Mining (ArgMining 2022), 2022, pp. 51–61.
mla: Chen, Wei-Fan, et al. “Analyzing Culture-Specific Argument Structures in Learner
Essays.” Proceedings of the 9th Workshop on Argument Mining (ArgMining 2022),
2022, pp. 51–61.
short: 'W.-F. Chen, M.-H. Chen, G. Mudgal, H. Wachsmuth, in: Proceedings of the
9th Workshop on Argument Mining (ArgMining 2022), 2022, pp. 51–61.'
date_created: 2022-09-06T13:51:23Z
date_updated: 2022-11-18T09:56:17Z
department:
- _id: '600'
language:
- iso: eng
page: 51 - 61
project:
- _id: '9'
name: 'SFB 901 - B1: SFB 901 - Subproject B1'
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '3'
name: 'SFB 901 - B: SFB 901 - Project Area B'
publication: Proceedings of the 9th Workshop on Argument Mining (ArgMining 2022)
status: public
title: Analyzing Culture-Specific Argument Structures in Learner Essays
type: conference
user_id: '477'
year: '2022'
...
---
_id: '33491'
author:
- first_name: Marten
full_name: Maack, Marten
id: '88252'
last_name: Maack
- first_name: Simon
full_name: Pukrop, Simon
id: '44428'
last_name: Pukrop
- first_name: Anna Rodriguez
full_name: Rasmussen, Anna Rodriguez
last_name: Rasmussen
citation:
ama: 'Maack M, Pukrop S, Rasmussen AR. (In-)Approximability Results for Interval,
Resource Restricted, and Low Rank Scheduling. In: Chechik S, Navarro G, Rotenberg
E, Herman G, eds. 30th Annual European Symposium on Algorithms, ESA 2022, September
5-9, 2022, Berlin/Potsdam, Germany. Vol 244. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik; 2022:77:1–77:13. doi:10.4230/LIPIcs.ESA.2022.77'
apa: Maack, M., Pukrop, S., & Rasmussen, A. R. (2022). (In-)Approximability
Results for Interval, Resource Restricted, and Low Rank Scheduling. In S. Chechik,
G. Navarro, E. Rotenberg, & G. Herman (Eds.), 30th Annual European Symposium
on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany (Vol.
244, p. 77:1–77:13). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ESA.2022.77
bibtex: '@inproceedings{Maack_Pukrop_Rasmussen_2022, series={LIPIcs}, title={(In-)Approximability
Results for Interval, Resource Restricted, and Low Rank Scheduling}, volume={244},
DOI={10.4230/LIPIcs.ESA.2022.77},
booktitle={30th Annual European Symposium on Algorithms, ESA 2022, September 5-9,
2022, Berlin/Potsdam, Germany}, publisher={Schloss Dagstuhl - Leibniz-Zentrum
für Informatik}, author={Maack, Marten and Pukrop, Simon and Rasmussen, Anna Rodriguez},
editor={Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz},
year={2022}, pages={77:1–77:13}, collection={LIPIcs} }'
chicago: Maack, Marten, Simon Pukrop, and Anna Rodriguez Rasmussen. “(In-)Approximability
Results for Interval, Resource Restricted, and Low Rank Scheduling.” In 30th
Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam,
Germany, edited by Shiri Chechik, Gonzalo Navarro, Eva Rotenberg, and Grzegorz
Herman, 244:77:1–77:13. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2022. https://doi.org/10.4230/LIPIcs.ESA.2022.77.
ieee: 'M. Maack, S. Pukrop, and A. R. Rasmussen, “(In-)Approximability Results for
Interval, Resource Restricted, and Low Rank Scheduling,” in 30th Annual European
Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany,
2022, vol. 244, p. 77:1–77:13, doi: 10.4230/LIPIcs.ESA.2022.77.'
mla: Maack, Marten, et al. “(In-)Approximability Results for Interval, Resource
Restricted, and Low Rank Scheduling.” 30th Annual European Symposium on Algorithms,
ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany, edited by Shiri Chechik
et al., vol. 244, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p.
77:1–77:13, doi:10.4230/LIPIcs.ESA.2022.77.
short: 'M. Maack, S. Pukrop, A.R. Rasmussen, in: S. Chechik, G. Navarro, E. Rotenberg,
G. Herman (Eds.), 30th Annual European Symposium on Algorithms, ESA 2022, September
5-9, 2022, Berlin/Potsdam, Germany, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2022, p. 77:1–77:13.'
date_created: 2022-09-27T13:06:05Z
date_updated: 2022-11-18T10:14:14Z
department:
- _id: '63'
doi: 10.4230/LIPIcs.ESA.2022.77
editor:
- first_name: Shiri
full_name: Chechik, Shiri
last_name: Chechik
- first_name: Gonzalo
full_name: Navarro, Gonzalo
last_name: Navarro
- first_name: Eva
full_name: Rotenberg, Eva
last_name: Rotenberg
- first_name: Grzegorz
full_name: Herman, Grzegorz
last_name: Herman
intvolume: ' 244'
language:
- iso: eng
page: 77:1–77:13
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '16'
name: 'SFB 901 - C4: SFB 901 - Subproject C4'
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
publication: 30th Annual European Symposium on Algorithms, ESA 2022, September 5-9,
2022, Berlin/Potsdam, Germany
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
series_title: LIPIcs
status: public
title: (In-)Approximability Results for Interval, Resource Restricted, and Low Rank
Scheduling
type: conference
user_id: '477'
volume: 244
year: '2022'
...
---
_id: '32106'
abstract:
- lang: eng
text: We study the consequences of modeling asymmetric bargaining power in two-person
bargaining problems. Comparing application of an asymmetric version of a bargaining
solution to an upfront modification of the disagreement point, the resulting distortion
crucially depends on the bargaining solution concept. While for the Kalai-Smorodinsky
solution weaker players benefit from modifying the disagreement point, the situation
is reversed for the Nash bargaining solution. There, weaker players are better
off in the asymmetric bargaining solution. When comparing application of the asymmetric
versions of the Nash and the Kalai-Smorodinsky solutions, we demonstrate that
there is an upper bound for the weight of a player, so that she is better off
with the Nash bargaining solution. This threshold is ultimately determined by
the relative utilitarian bargaining solution. From a mechanism design perspective,
our results provide valuable information for a social planner, when implementing
a bargaining solution for unequally powerful players.
author:
- first_name: Claus-Jochen
full_name: Haake, Claus-Jochen
id: '20801'
last_name: Haake
- first_name: Thomas
full_name: Streck, Thomas
id: '33041'
last_name: Streck
citation:
ama: Haake C-J, Streck T. Distortion through Modeling Asymmetric Bargaining Power.
Vol 148.; 2022.
apa: Haake, C.-J., & Streck, T. (2022). Distortion through modeling asymmetric
bargaining power (Vol. 148).
bibtex: '@book{Haake_Streck_2022, series={CIE Working Paper Series}, title={Distortion
through modeling asymmetric bargaining power}, volume={148}, author={Haake, Claus-Jochen
and Streck, Thomas}, year={2022}, collection={CIE Working Paper Series} }'
chicago: Haake, Claus-Jochen, and Thomas Streck. Distortion through Modeling
Asymmetric Bargaining Power. Vol. 148. CIE Working Paper Series, 2022.
ieee: C.-J. Haake and T. Streck, Distortion through modeling asymmetric bargaining
power, vol. 148. 2022.
mla: Haake, Claus-Jochen, and Thomas Streck. Distortion through Modeling Asymmetric
Bargaining Power. 2022.
short: C.-J. Haake, T. Streck, Distortion through Modeling Asymmetric Bargaining
Power, 2022.
date_created: 2022-06-22T12:12:58Z
date_updated: 2022-11-19T15:42:15Z
department:
- _id: '205'
- _id: '475'
- _id: '200'
intvolume: ' 148'
jel:
- C78
- D63
keyword:
- Asymmetric bargaining power
- Nash bargaining solution
- Kalai-Smorodinsky bargaining solution
language:
- iso: eng
page: '17'
project:
- _id: '2'
name: 'SFB 901 - A: SFB 901 - Project Area A'
- _id: '7'
name: 'SFB 901 - A3: SFB 901 - Subproject A3'
- _id: '1'
name: 'SFB 901: SFB 901'
series_title: CIE Working Paper Series
status: public
title: Distortion through modeling asymmetric bargaining power
type: working_paper
user_id: '20801'
volume: 148
year: '2022'
...
---
_id: '32179'
abstract:
- lang: eng
text: This work addresses the automatic resolution of software requirements. In
the vision of On-The-Fly Computing, software services should be composed on demand,
based solely on natural language input from human users. To enable this, we build
a chatbot solution that works with human-in-the-loop support to receive, analyze,
correct, and complete their software requirements. The chatbot is equipped with
a natural language processing pipeline and a large knowledge base, as well as
sophisticated dialogue management skills to enhance the user experience. Previous
solutions have focused on analyzing software requirements to point out errors
such as vagueness, ambiguity, or incompleteness. Our work shows how apps can collaborate
with users to efficiently produce correct requirements. We developed and compared
three different chatbot apps that can work with built-in knowledge. We rely on
ChatterBot, DialoGPT and Rasa for this purpose. While DialoGPT provides its own
knowledge base, Rasa is the best system to combine the text mining and knowledge
solutions at our disposal. The evaluation shows that users accept 73% of the suggested
answers from Rasa, while they accept only 63% from DialoGPT or even 36% from ChatterBot.
author:
- first_name: Joschka
full_name: Kersting, Joschka
id: '58701'
last_name: Kersting
- first_name: Mobeen
full_name: Ahmed, Mobeen
last_name: Ahmed
- first_name: Michaela
full_name: Geierhos, Michaela
id: '42496'
last_name: Geierhos
orcid: 0000-0002-8180-5606
citation:
ama: 'Kersting J, Ahmed M, Geierhos M. Chatbot-Enhanced Requirements Resolution
for Automated Service Compositions. In: Stephanidis C, Antona M, Ntoa S, eds.
HCI International 2022 Posters. Vol 1580. Communications in Computer and
Information Science (CCIS). Springer International Publishing; 2022:419--426.
doi:10.1007/978-3-031-06417-3_56'
apa: Kersting, J., Ahmed, M., & Geierhos, M. (2022). Chatbot-Enhanced Requirements
Resolution for Automated Service Compositions. In C. Stephanidis, M. Antona, &
S. Ntoa (Eds.), HCI International 2022 Posters (Vol. 1580, pp. 419--426).
Springer International Publishing. https://doi.org/10.1007/978-3-031-06417-3_56
bibtex: '@inbook{Kersting_Ahmed_Geierhos_2022, place={Cham, Switzerland}, series={Communications
in Computer and Information Science (CCIS)}, title={Chatbot-Enhanced Requirements
Resolution for Automated Service Compositions}, volume={1580}, DOI={10.1007/978-3-031-06417-3_56},
booktitle={HCI International 2022 Posters}, publisher={Springer International
Publishing}, author={Kersting, Joschka and Ahmed, Mobeen and Geierhos, Michaela},
editor={Stephanidis, Constantine and Antona, Margherita and Ntoa, Stavroula},
year={2022}, pages={419--426}, collection={Communications in Computer and Information
Science (CCIS)} }'
chicago: 'Kersting, Joschka, Mobeen Ahmed, and Michaela Geierhos. “Chatbot-Enhanced
Requirements Resolution for Automated Service Compositions.” In HCI International
2022 Posters, edited by Constantine Stephanidis, Margherita Antona, and Stavroula
Ntoa, 1580:419--426. Communications in Computer and Information Science (CCIS).
Cham, Switzerland: Springer International Publishing, 2022. https://doi.org/10.1007/978-3-031-06417-3_56.'
ieee: 'J. Kersting, M. Ahmed, and M. Geierhos, “Chatbot-Enhanced Requirements Resolution
for Automated Service Compositions,” in HCI International 2022 Posters,
vol. 1580, C. Stephanidis, M. Antona, and S. Ntoa, Eds. Cham, Switzerland: Springer
International Publishing, 2022, pp. 419--426.'
mla: Kersting, Joschka, et al. “Chatbot-Enhanced Requirements Resolution for Automated
Service Compositions.” HCI International 2022 Posters, edited by Constantine
Stephanidis et al., vol. 1580, Springer International Publishing, 2022, pp. 419--426,
doi:10.1007/978-3-031-06417-3_56.
short: 'J. Kersting, M. Ahmed, M. Geierhos, in: C. Stephanidis, M. Antona, S. Ntoa
(Eds.), HCI International 2022 Posters, Springer International Publishing, Cham,
Switzerland, 2022, pp. 419--426.'
conference:
end_date: 2022-07-01
location: Virtual
name: 24th International Conference on Human-Computer Interaction (HCII 2022)
start_date: 2022-06-26
date_created: 2022-06-27T09:27:06Z
date_updated: 2022-11-28T13:22:16Z
ddc:
- '004'
department:
- _id: '579'
doi: 10.1007/978-3-031-06417-3_56
editor:
- first_name: Constantine
full_name: Stephanidis, Constantine
last_name: Stephanidis
- first_name: Margherita
full_name: Antona, Margherita
last_name: Antona
- first_name: Stavroula
full_name: Ntoa, Stavroula
last_name: Ntoa
file:
- access_level: closed
content_type: application/pdf
creator: jkers
date_created: 2022-11-28T13:21:32Z
date_updated: 2022-11-28T13:21:32Z
file_id: '34150'
file_name: Kersting et al. (2022), Kersting2022.pdf
file_size: 1153017
relation: main_file
success: 1
file_date_updated: 2022-11-28T13:21:32Z
has_accepted_license: '1'
intvolume: ' 1580'
keyword:
- On-The-Fly Computing
- Chatbot
- Knowledge Base
language:
- iso: eng
page: 419--426
place: Cham, Switzerland
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '3'
name: 'SFB 901 - B: SFB 901 - Project Area B'
- _id: '9'
name: 'SFB 901 - B1: SFB 901 - Subproject B1'
publication: HCI International 2022 Posters
publication_identifier:
isbn:
- '9783031064166'
- '9783031064173'
issn:
- 1865-0929
- 1865-0937
publication_status: published
publisher: Springer International Publishing
related_material:
link:
- relation: confirmation
url: https://link.springer.com/chapter/10.1007/978-3-031-06417-3_56
series_title: Communications in Computer and Information Science (CCIS)
status: public
title: Chatbot-Enhanced Requirements Resolution for Automated Service Compositions
type: book_chapter
user_id: '58701'
volume: 1580
year: '2022'
...
---
_id: '29769'
abstract:
- lang: eng
text: 'Wettstreit zwischen der Entwicklung neuer Hardwaretrojaner und entsprechender
Gegenmaßnahmen beschreiten Widersacher immer raffiniertere Wege um Schaltungsentwürfe
zu infizieren und dabei selbst fortgeschrittene Test- und Verifikationsmethoden
zu überlisten. Abgesehen von den konventionellen Methoden um einen Trojaner in
eine Schaltung für ein Field-programmable Gate Array (FPGA) einzuschleusen, können
auch die Entwurfswerkzeuge heimlich kompromittiert werden um einen Angreifer dabei
zu unterstützen einen erfolgreichen Angriff durchzuführen, der zum Beispiel Fehlfunktionen
oder ungewollte Informationsabflüsse bewirken kann. Diese Dissertation beschäftigt
sich hauptsächlich mit den beiden Blickwinkeln auf Hardwaretrojaner in rekonfigurierbaren
Systemen, einerseits der Perspektive des Verteidigers mit einer Methode zur Erkennung
von Trojanern auf der Bitstromebene, und andererseits derjenigen des Angreifers
mit einer neuartigen Angriffsmethode für FPGA Trojaner. Für die Verteidigung gegen
den Trojaner ``Heimtückische LUT'''' stellen wir die allererste erfolgreiche Gegenmaßnahme
vor, die durch Verifikation mittels Proof-carrying Hardware (PCH) auf der Bitstromebene
direkt vor der Konfiguration der Hardware angewendet werden kann, und präsentieren
ein vollständiges Schema für den Entwurf und die Verifikation von Schaltungen
für iCE40 FPGAs. Für die Gegenseite führen wir einen neuen Angriff ein, welcher
bösartiges Routing im eingefügten Trojaner ausnutzt um selbst im fertigen Bitstrom
in einem inaktiven Zustand zu verbleiben: Hierdurch kann dieser neuartige Angriff
zur Zeit weder von herkömmlichen Test- und Verifikationsmethoden, noch von unserer
vorher vorgestellten Verifikation auf der Bitstromebene entdeckt werden.'
- lang: eng
text: The battle of developing hardware Trojans and corresponding countermeasures
has taken adversaries towards ingenious ways of compromising hardware designs
by circumventing even advanced testing and verification methods. Besides conventional
methods of inserting Trojans into a design by a malicious entity, the design flow
for field-programmable gate arrays (FPGAs) can also be surreptitiously compromised
to assist the attacker to perform a successful malfunctioning or information leakage
attack. This thesis mainly focuses on the two aspects of hardware Trojans in reconfigurable
systems, the defenders perspective which corresponds to the bitstream-level Trojan
detection technique, and the attackers perspective which corresponds to a novel
FPGA Trojan attack. From the defender's perspective, we introduce a first-ever
successful pre-configuration countermeasure against the ``Malicious LUT''-hardware
Trojan, by employing bitstream-level Proof-Carrying Hardware (PCH) and present
the complete design-and-verification flow for iCE40 FPGAs. Likewise, from an attackers
perspective, we present a novel attack that leverages malicious routing of the
inserted Trojan circuit to acquire a dormant state even in the generated and transmitted
bitstream. Since the Trojan is injected in a post-synthesis step and remains unconnected
in the bitstream, the presented attack can currently neither be prevented by conventional
testing and verification methods nor by bitstream-level verification techniques.
author:
- first_name: Qazi Arbab
full_name: Ahmed, Qazi Arbab
id: '72764'
last_name: Ahmed
orcid: 0000-0002-1837-2254
citation:
ama: Ahmed QA. Hardware Trojans in Reconfigurable Computing. Paderborn University,
Paderborn, Germany; 2022. doi:10.17619/UNIPB/1-1271
apa: Ahmed, Q. A. (2022). Hardware Trojans in Reconfigurable Computing. Paderborn
University, Paderborn, Germany. https://doi.org/10.17619/UNIPB/1-1271
bibtex: '@book{Ahmed_2022, place={Paderborn}, title={Hardware Trojans in Reconfigurable
Computing}, DOI={10.17619/UNIPB/1-1271},
publisher={ Paderborn University, Paderborn, Germany}, author={Ahmed, Qazi Arbab},
year={2022} }'
chicago: 'Ahmed, Qazi Arbab. Hardware Trojans in Reconfigurable Computing.
Paderborn: Paderborn University, Paderborn, Germany, 2022. https://doi.org/10.17619/UNIPB/1-1271.'
ieee: 'Q. A. Ahmed, Hardware Trojans in Reconfigurable Computing. Paderborn: Paderborn
University, Paderborn, Germany, 2022.'
mla: Ahmed, Qazi Arbab. Hardware Trojans in Reconfigurable Computing. Paderborn
University, Paderborn, Germany, 2022, doi:10.17619/UNIPB/1-1271.
short: Q.A. Ahmed, Hardware Trojans in Reconfigurable Computing, Paderborn University,
Paderborn, Germany, Paderborn, 2022.
date_created: 2022-02-07T14:02:36Z
date_updated: 2022-11-30T13:39:01Z
ddc:
- '004'
department:
- _id: '78'
doi: 10.17619/UNIPB/1-1271
has_accepted_license: '1'
keyword:
- FPGA Security
- Hardware Trojans
- Bitstream-level Trojans
- Bitstream Verification
language:
- iso: eng
main_file_link:
- open_access: '1'
url: "\turn:nbn:de:hbz:466:2-40303"
oa: '1'
place: Paderborn
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
- _id: '14'
name: 'SFB 901 - C2: SFB 901 - Subproject C2'
publication_status: published
publisher: ' Paderborn University, Paderborn, Germany'
status: public
supervisor:
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
title: Hardware Trojans in Reconfigurable Computing
type: dissertation
user_id: '477'
year: '2022'
...
---
_id: '31054'
abstract:
- lang: eng
text: This paper aims at discussing past limitations set in sentiment analysis research
regarding explicit and implicit mentions of opinions. Previous studies have regularly
neglected this question in favor of methodical research on standard-datasets.
Furthermore, they were limited to linguistically less-diverse domains, such as
commercial product reviews. We face this issue by annotating a German-language
physician review dataset that contains numerous implicit, long, and complex statements
that indicate aspect ratings, such as the physician’s friendliness. We discuss
the nature of implicit statements and present various samples to illustrate the
challenge described.
author:
- first_name: Joschka
full_name: Kersting, Joschka
id: '58701'
last_name: Kersting
- first_name: Frederik Simon
full_name: Bäumer, Frederik Simon
id: '38837'
last_name: Bäumer
citation:
ama: 'Kersting J, Bäumer FS. Implicit Statements in Healthcare Reviews: A Challenge
for Sentiment Analysis. In: Kersting J, ed. Proceedings of the Fourteenth International
Conference on Pervasive Patterns and Applications (PATTERNS 2022): Special Track
AI-DRSWA: Maturing Artificial Intelligence - Data Science for Real-World Applications.
IARIA; 2022:5-9.'
apa: 'Kersting, J., & Bäumer, F. S. (2022). Implicit Statements in Healthcare
Reviews: A Challenge for Sentiment Analysis. In J. Kersting (Ed.), Proceedings
of the Fourteenth International Conference on Pervasive Patterns and Applications
(PATTERNS 2022): Special Track AI-DRSWA: Maturing Artificial Intelligence - Data
Science for Real-World Applications (pp. 5–9). IARIA.'
bibtex: '@inproceedings{Kersting_Bäumer_2022, place={Barcelona, Spain}, title={Implicit
Statements in Healthcare Reviews: A Challenge for Sentiment Analysis}, booktitle={Proceedings
of the Fourteenth International Conference on Pervasive Patterns and Applications
(PATTERNS 2022): Special Track AI-DRSWA: Maturing Artificial Intelligence - Data
Science for Real-World Applications}, publisher={IARIA}, author={Kersting, Joschka
and Bäumer, Frederik Simon}, editor={Kersting, Joschka}, year={2022}, pages={5–9}
}'
chicago: 'Kersting, Joschka, and Frederik Simon Bäumer. “Implicit Statements in
Healthcare Reviews: A Challenge for Sentiment Analysis.” In Proceedings of
the Fourteenth International Conference on Pervasive Patterns and Applications
(PATTERNS 2022): Special Track AI-DRSWA: Maturing Artificial Intelligence - Data
Science for Real-World Applications, edited by Joschka Kersting, 5–9. Barcelona,
Spain: IARIA, 2022.'
ieee: 'J. Kersting and F. S. Bäumer, “Implicit Statements in Healthcare Reviews:
A Challenge for Sentiment Analysis,” in Proceedings of the Fourteenth International
Conference on Pervasive Patterns and Applications (PATTERNS 2022): Special Track
AI-DRSWA: Maturing Artificial Intelligence - Data Science for Real-World Applications,
Barcelona, Spain, 2022, pp. 5–9.'
mla: 'Kersting, Joschka, and Frederik Simon Bäumer. “Implicit Statements in Healthcare
Reviews: A Challenge for Sentiment Analysis.” Proceedings of the Fourteenth
International Conference on Pervasive Patterns and Applications (PATTERNS 2022):
Special Track AI-DRSWA: Maturing Artificial Intelligence - Data Science for Real-World
Applications, edited by Joschka Kersting, IARIA, 2022, pp. 5–9.'
short: 'J. Kersting, F.S. Bäumer, in: J. Kersting (Ed.), Proceedings of the Fourteenth
International Conference on Pervasive Patterns and Applications (PATTERNS 2022):
Special Track AI-DRSWA: Maturing Artificial Intelligence - Data Science for Real-World
Applications, IARIA, Barcelona, Spain, 2022, pp. 5–9.'
conference:
location: Barcelona, Spain
name: The Fourteenth International Conference on Pervasive Patterns and Applications
(PATTERNS 2022)
start_date: 2022-03
date_created: 2022-05-04T08:12:09Z
date_updated: 2022-12-01T13:40:11Z
ddc:
- '006'
editor:
- first_name: Joschka
full_name: Kersting, Joschka
last_name: Kersting
file:
- access_level: closed
content_type: application/pdf
creator: jkers
date_created: 2022-12-01T13:39:48Z
date_updated: 2022-12-01T13:39:48Z
file_id: '34172'
file_name: Kersting & Bäumer (2022), Kersting2022.pdf
file_size: 155548
relation: main_file
success: 1
file_date_updated: 2022-12-01T13:39:48Z
has_accepted_license: '1'
keyword:
- Sentiment analysis
- Natural language processing
- Aspect phrase extraction
language:
- iso: eng
page: 5-9
place: Barcelona, Spain
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '3'
name: 'SFB 901 - B: SFB 901 - Project Area B'
- _id: '9'
name: 'SFB 901 - B1: SFB 901 - Subproject B1'
publication: 'Proceedings of the Fourteenth International Conference on Pervasive
Patterns and Applications (PATTERNS 2022): Special Track AI-DRSWA: Maturing Artificial
Intelligence - Data Science for Real-World Applications'
publication_status: published
publisher: IARIA
status: public
title: 'Implicit Statements in Healthcare Reviews: A Challenge for Sentiment Analysis'
type: conference
user_id: '58701'
year: '2022'
...
---
_id: '31881'
author:
- first_name: Britta
full_name: Hoyer, Britta
id: '42447'
last_name: Hoyer
- first_name: Kris
full_name: De Jaegher, Kris
last_name: De Jaegher
citation:
ama: Hoyer B, De Jaegher K. Network Disruption and the Common-Enemy Effect. International
Journal of Game Theory. Published online 2022. doi:10.1007/s00182-022-00812-5
apa: Hoyer, B., & De Jaegher, K. (2022). Network Disruption and the Common-Enemy
Effect. International Journal of Game Theory. https://doi.org/10.1007/s00182-022-00812-5
bibtex: '@article{Hoyer_De Jaegher_2022, title={Network Disruption and the Common-Enemy
Effect}, DOI={10.1007/s00182-022-00812-5},
journal={International Journal of Game Theory}, publisher={Springer}, author={Hoyer,
Britta and De Jaegher, Kris}, year={2022} }'
chicago: Hoyer, Britta, and Kris De Jaegher. “Network Disruption and the Common-Enemy
Effect.” International Journal of Game Theory, 2022. https://doi.org/10.1007/s00182-022-00812-5.
ieee: 'B. Hoyer and K. De Jaegher, “Network Disruption and the Common-Enemy Effect,”
International Journal of Game Theory, 2022, doi: 10.1007/s00182-022-00812-5.'
mla: Hoyer, Britta, and Kris De Jaegher. “Network Disruption and the Common-Enemy
Effect.” International Journal of Game Theory, Springer, 2022, doi:10.1007/s00182-022-00812-5.
short: B. Hoyer, K. De Jaegher, International Journal of Game Theory (2022).
date_created: 2022-06-14T15:33:35Z
date_updated: 2022-12-04T14:40:38Z
department:
- _id: '280'
- _id: '475'
doi: 10.1007/s00182-022-00812-5
extern: '1'
language:
- iso: eng
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '2'
name: 'SFB 901 - A: SFB 901 - Project Area A'
- _id: '7'
name: 'SFB 901 - A3: SFB 901 - Subproject A3'
publication: International Journal of Game Theory
publication_status: epub_ahead
publisher: Springer
status: public
title: Network Disruption and the Common-Enemy Effect
type: journal_article
user_id: '42447'
year: '2022'
...
---
_id: '33250'
author:
- first_name: Daniel
full_name: Szopinski, Daniel
id: '36372'
last_name: Szopinski
- first_name: Lorenzo
full_name: Massa, Lorenzo
last_name: Massa
- first_name: Thomas
full_name: John, Thomas
last_name: John
- first_name: Dennis
full_name: Kundisch, Dennis
id: '21117'
last_name: Kundisch
- first_name: Christopher
full_name: Tucci, Christopher
last_name: Tucci
citation:
ama: 'Szopinski D, Massa L, John T, Kundisch D, Tucci C. Modeling Business Models:
A cross-disciplinary Analysis of Business Model Modeling Languages and Directions
for Future Research. Communications of the Association for Information Systems.
2022;51:774-841.'
apa: 'Szopinski, D., Massa, L., John, T., Kundisch, D., & Tucci, C. (2022).
Modeling Business Models: A cross-disciplinary Analysis of Business Model Modeling
Languages and Directions for Future Research. Communications of the Association
for Information Systems, 51, 774–841.'
bibtex: '@article{Szopinski_Massa_John_Kundisch_Tucci_2022, title={Modeling Business
Models: A cross-disciplinary Analysis of Business Model Modeling Languages and
Directions for Future Research}, volume={51}, journal={Communications of the Association
for Information Systems}, author={Szopinski, Daniel and Massa, Lorenzo and John,
Thomas and Kundisch, Dennis and Tucci, Christopher}, year={2022}, pages={774–841}
}'
chicago: 'Szopinski, Daniel, Lorenzo Massa, Thomas John, Dennis Kundisch, and Christopher
Tucci. “Modeling Business Models: A Cross-Disciplinary Analysis of Business Model
Modeling Languages and Directions for Future Research.” Communications of the
Association for Information Systems 51 (2022): 774–841.'
ieee: 'D. Szopinski, L. Massa, T. John, D. Kundisch, and C. Tucci, “Modeling Business
Models: A cross-disciplinary Analysis of Business Model Modeling Languages and
Directions for Future Research,” Communications of the Association for Information
Systems, vol. 51, pp. 774–841, 2022.'
mla: 'Szopinski, Daniel, et al. “Modeling Business Models: A Cross-Disciplinary
Analysis of Business Model Modeling Languages and Directions for Future Research.”
Communications of the Association for Information Systems, vol. 51, 2022,
pp. 774–841.'
short: D. Szopinski, L. Massa, T. John, D. Kundisch, C. Tucci, Communications of
the Association for Information Systems 51 (2022) 774–841.
date_created: 2022-09-02T10:05:24Z
date_updated: 2022-12-21T19:08:47Z
ddc:
- '000'
department:
- _id: '276'
file:
- access_level: closed
content_type: application/pdf
creator: dsz
date_created: 2022-12-21T19:08:31Z
date_updated: 2022-12-21T19:08:31Z
file_id: '34788'
file_name: Modeling Business Models_ A cross-disciplinary Analysis of Busine.pdf
file_size: 3579895
relation: main_file
success: 1
file_date_updated: 2022-12-21T19:08:31Z
has_accepted_license: '1'
intvolume: ' 51'
language:
- iso: eng
page: 774-841
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: Communications of the Association for Information Systems
publication_status: published
status: public
title: 'Modeling Business Models: A cross-disciplinary Analysis of Business Model
Modeling Languages and Directions for Future Research'
type: journal_article
user_id: '36372'
volume: 51
year: '2022'
...
---
_id: '29220'
abstract:
- lang: eng
text: "Modern services often comprise several components, such as chained virtual
network functions, microservices, or\r\nmachine learning functions. Providing
such services requires to decide how often to instantiate each component, where
to place these instances in the network, how to chain them and route traffic through
them. \r\nTo overcome limitations of conventional, hardwired heuristics, deep
reinforcement learning (DRL) approaches for self-learning network and service
management have emerged recently. These model-free DRL approaches are more flexible
but typically learn tabula rasa, i.e., disregard existing understanding of networks,
services, and their coordination. \r\n\r\nInstead, we propose FutureCoord, a novel
model-based AI approach that leverages existing understanding of networks and
services for more efficient and effective coordination without time-intensive
training. FutureCoord combines Monte Carlo Tree Search with a stochastic traffic
model. This allows FutureCoord to estimate the impact of future incoming traffic
and effectively optimize long-term effects, taking fluctuating demand and Quality
of Service (QoS) requirements into account. Our extensive evaluation based on
real-world network topologies, services, and traffic traces indicates that FutureCoord
clearly outperforms state-of-the-art model-free and model-based approaches with
up to 51% higher flow success ratios."
author:
- first_name: Stefan
full_name: Werner, Stefan
last_name: Werner
- first_name: Stefan Balthasar
full_name: Schneider, Stefan Balthasar
id: '35343'
last_name: Schneider
orcid: 0000-0001-8210-4011
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Werner S, Schneider SB, Karl H. Use What You Know: Network and Service Coordination
Beyond Certainty. In: IEEE/IFIP Network Operations and Management Symposium
(NOMS). IEEE; 2022.'
apa: 'Werner, S., Schneider, S. B., & Karl, H. (2022). Use What You Know: Network
and Service Coordination Beyond Certainty. IEEE/IFIP Network Operations and
Management Symposium (NOMS). IEEE/IFIP Network Operations and Management Symposium
(NOMS), Budapest.'
bibtex: '@inproceedings{Werner_Schneider_Karl_2022, title={Use What You Know: Network
and Service Coordination Beyond Certainty}, booktitle={IEEE/IFIP Network Operations
and Management Symposium (NOMS)}, publisher={IEEE}, author={Werner, Stefan and
Schneider, Stefan Balthasar and Karl, Holger}, year={2022} }'
chicago: 'Werner, Stefan, Stefan Balthasar Schneider, and Holger Karl. “Use What
You Know: Network and Service Coordination Beyond Certainty.” In IEEE/IFIP
Network Operations and Management Symposium (NOMS). IEEE, 2022.'
ieee: 'S. Werner, S. B. Schneider, and H. Karl, “Use What You Know: Network and
Service Coordination Beyond Certainty,” presented at the IEEE/IFIP Network Operations
and Management Symposium (NOMS), Budapest, 2022.'
mla: 'Werner, Stefan, et al. “Use What You Know: Network and Service Coordination
Beyond Certainty.” IEEE/IFIP Network Operations and Management Symposium (NOMS),
IEEE, 2022.'
short: 'S. Werner, S.B. Schneider, H. Karl, in: IEEE/IFIP Network Operations and
Management Symposium (NOMS), IEEE, 2022.'
conference:
end_date: 2022-04-29
location: Budapest
name: IEEE/IFIP Network Operations and Management Symposium (NOMS)
start_date: 2022-04-25
date_created: 2022-01-11T08:43:26Z
date_updated: 2022-01-11T08:44:04Z
ddc:
- '004'
department:
- _id: '75'
file:
- access_level: open_access
content_type: application/pdf
creator: stschn
date_created: 2022-01-11T08:39:57Z
date_updated: 2022-01-11T08:39:57Z
file_id: '29222'
file_name: author_version.pdf
file_size: 528653
relation: main_file
file_date_updated: 2022-01-11T08:39:57Z
has_accepted_license: '1'
keyword:
- network management
- service management
- AI
- Monte Carlo Tree Search
- model-based
- QoS
language:
- iso: eng
oa: '1'
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
- _id: '16'
name: 'SFB 901 - C4: SFB 901 - Subproject C4'
publication: IEEE/IFIP Network Operations and Management Symposium (NOMS)
publisher: IEEE
quality_controlled: '1'
status: public
title: 'Use What You Know: Network and Service Coordination Beyond Certainty'
type: conference
user_id: '35343'
year: '2022'
...
---
_id: '29763'
abstract:
- lang: eng
text: "Modern-day communication has become more and more digital. While this comes
with many advantages such as a more efficient economy, it has also created more
and more opportunities for various adversaries to manipulate communication or
eavesdrop on it. The Snowden revelations in 2013 further highlighted the seriousness
of these threats. To protect the communication of people, companies, and states
from such threats, we require cryptography with strong security guarantees.\r\nDifferent
applications may require different security properties from cryptographic schemes.
For most applications, however, so-called adaptive security is considered a reasonable
minimal requirement of security. Cryptographic schemes with adaptive security
remain secure in the presence of an adversary that can corrupt communication partners
to respond to messages of the adversaries choice, while the adversary may choose
the messages based on previously observed interactions.\r\nWhile cryptography
is associated the most with encryption, this is only one of many primitives that
are essential for the security of digital interactions. This thesis presents novel
identity-based encryption (IBE) schemes and verifiable random functions (VRFs)
that achieve adaptive security as outlined above. Moreover, the cryptographic
schemes presented in this thesis are proven secure in the standard model. That
is without making use of idealized models like the random oracle model."
author:
- first_name: David
full_name: Niehues, David
id: '36113'
last_name: Niehues
citation:
ama: Niehues D. More Efficient Techniques for Adaptively-Secure Cryptography.;
2022. doi:10.25926/rdtq-jw45
apa: Niehues, D. (2022). More Efficient Techniques for Adaptively-Secure Cryptography.
https://doi.org/10.25926/rdtq-jw45
bibtex: '@book{Niehues_2022, title={More Efficient Techniques for Adaptively-Secure
Cryptography}, DOI={10.25926/rdtq-jw45},
author={Niehues, David}, year={2022} }'
chicago: Niehues, David. More Efficient Techniques for Adaptively-Secure Cryptography,
2022. https://doi.org/10.25926/rdtq-jw45.
ieee: D. Niehues, More Efficient Techniques for Adaptively-Secure Cryptography.
2022.
mla: Niehues, David. More Efficient Techniques for Adaptively-Secure Cryptography.
2022, doi:10.25926/rdtq-jw45.
short: D. Niehues, More Efficient Techniques for Adaptively-Secure Cryptography,
2022.
date_created: 2022-02-07T13:29:07Z
date_updated: 2022-02-07T13:32:28Z
ddc:
- '000'
department:
- _id: '558'
doi: 10.25926/rdtq-jw45
file:
- access_level: closed
content_type: application/pdf
creator: davnie
date_created: 2022-02-07T13:26:05Z
date_updated: 2022-02-07T13:26:05Z
file_id: '29764'
file_name: de2107.pdf
file_size: 1542089
relation: main_file
success: 1
file_date_updated: 2022-02-07T13:26:05Z
has_accepted_license: '1'
keyword:
- public-key cryptography
- lattices
- pairings
- verifiable random functions
- identity-based encryption
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://elpub.bib.uni-wuppertal.de/servlets/DerivateServlet/Derivate-14686/de2107.pdf
oa: '1'
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_status: published
status: public
supervisor:
- first_name: Tibor
full_name: Jager, Tibor
id: '64669'
last_name: Jager
- first_name: Anja
full_name: Lehmann, Anja
last_name: Lehmann
title: More Efficient Techniques for Adaptively-Secure Cryptography
type: dissertation
user_id: '36113'
year: '2022'
...
---
_id: '31068'
author:
- first_name: Mei-Hua
full_name: Chen, Mei-Hua
last_name: Chen
- first_name: Garima
full_name: Mudgal, Garima
last_name: Mudgal
- first_name: Wei-Fan
full_name: Chen, Wei-Fan
id: '82920'
last_name: Chen
- first_name: Henning
full_name: Wachsmuth, Henning
id: '3900'
last_name: Wachsmuth
citation:
ama: 'Chen M-H, Mudgal G, Chen W-F, Wachsmuth H. Investigating the argumentation
structures of EFL learners from diverse language backgrounds. In: EUROCALL.
; 2022.'
apa: Chen, M.-H., Mudgal, G., Chen, W.-F., & Wachsmuth, H. (2022). Investigating
the argumentation structures of EFL learners from diverse language backgrounds.
EUROCALL.
bibtex: '@inproceedings{Chen_Mudgal_Chen_Wachsmuth_2022, title={Investigating the
argumentation structures of EFL learners from diverse language backgrounds}, booktitle={EUROCALL},
author={Chen, Mei-Hua and Mudgal, Garima and Chen, Wei-Fan and Wachsmuth, Henning},
year={2022} }'
chicago: Chen, Mei-Hua, Garima Mudgal, Wei-Fan Chen, and Henning Wachsmuth. “Investigating
the Argumentation Structures of EFL Learners from Diverse Language Backgrounds.”
In EUROCALL, 2022.
ieee: M.-H. Chen, G. Mudgal, W.-F. Chen, and H. Wachsmuth, “Investigating the argumentation
structures of EFL learners from diverse language backgrounds,” 2022.
mla: Chen, Mei-Hua, et al. “Investigating the Argumentation Structures of EFL Learners
from Diverse Language Backgrounds.” EUROCALL, 2022.
short: 'M.-H. Chen, G. Mudgal, W.-F. Chen, H. Wachsmuth, in: EUROCALL, 2022.'
date_created: 2022-05-05T07:50:21Z
date_updated: 2022-05-09T14:58:39Z
department:
- _id: '600'
language:
- iso: eng
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '3'
name: 'SFB 901 - B: SFB 901 - Project Area B'
- _id: '9'
name: 'SFB 901 - B1: SFB 901 - Subproject B1'
publication: EUROCALL
status: public
title: Investigating the argumentation structures of EFL learners from diverse language
backgrounds
type: conference_abstract
user_id: '82920'
year: '2022'
...
---
_id: '31479'
author:
- first_name: Surender
full_name: Baswana, Surender
last_name: Baswana
- first_name: Shiv
full_name: Gupta, Shiv
last_name: Gupta
- first_name: Till
full_name: Knollmann, Till
id: '39241'
last_name: Knollmann
orcid: 0000-0003-2014-4696
citation:
ama: Baswana S, Gupta S, Knollmann T. Mincut Sensitivity Data Structures for the
Insertion of an Edge. Algorithmica. Published online 2022. doi:10.1007/s00453-022-00978-0
apa: Baswana, S., Gupta, S., & Knollmann, T. (2022). Mincut Sensitivity Data
Structures for the Insertion of an Edge. Algorithmica. https://doi.org/10.1007/s00453-022-00978-0
bibtex: '@article{Baswana_Gupta_Knollmann_2022, title={Mincut Sensitivity Data Structures
for the Insertion of an Edge}, DOI={10.1007/s00453-022-00978-0},
journal={Algorithmica}, publisher={Springer Science and Business Media LLC}, author={Baswana,
Surender and Gupta, Shiv and Knollmann, Till}, year={2022} }'
chicago: Baswana, Surender, Shiv Gupta, and Till Knollmann. “Mincut Sensitivity
Data Structures for the Insertion of an Edge.” Algorithmica, 2022. https://doi.org/10.1007/s00453-022-00978-0.
ieee: 'S. Baswana, S. Gupta, and T. Knollmann, “Mincut Sensitivity Data Structures
for the Insertion of an Edge,” Algorithmica, 2022, doi: 10.1007/s00453-022-00978-0.'
mla: Baswana, Surender, et al. “Mincut Sensitivity Data Structures for the Insertion
of an Edge.” Algorithmica, Springer Science and Business Media LLC, 2022,
doi:10.1007/s00453-022-00978-0.
short: S. Baswana, S. Gupta, T. Knollmann, Algorithmica (2022).
date_created: 2022-05-27T10:09:24Z
date_updated: 2022-05-27T10:14:27Z
department:
- _id: '63'
doi: 10.1007/s00453-022-00978-0
genbank:
- tillk
keyword:
- Applied Mathematics
- Computer Science Applications
- General Computer Science
language:
- iso: eng
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: Algorithmica
publication_identifier:
issn:
- 0178-4617
- 1432-0541
publication_status: published
publisher: Springer Science and Business Media LLC
status: public
title: Mincut Sensitivity Data Structures for the Insertion of an Edge
type: journal_article
user_id: '39241'
year: '2022'
...
---
_id: '33033'
author:
- first_name: Lukas
full_name: Fehring, Lukas
id: '75695'
last_name: Fehring
citation:
ama: Fehring L. Combined Ranking and Regression Trees for Algorithm Selection.;
2022.
apa: Fehring, L. (2022). Combined Ranking and Regression Trees for Algorithm
Selection.
bibtex: '@book{Fehring_2022, place={Paderborn}, title={Combined Ranking and Regression
Trees for Algorithm Selection}, author={Fehring, Lukas}, year={2022} }'
chicago: Fehring, Lukas. Combined Ranking and Regression Trees for Algorithm
Selection. Paderborn, 2022.
ieee: L. Fehring, Combined Ranking and Regression Trees for Algorithm Selection.
Paderborn, 2022.
mla: Fehring, Lukas. Combined Ranking and Regression Trees for Algorithm Selection.
2022.
short: L. Fehring, Combined Ranking and Regression Trees for Algorithm Selection,
Paderborn, 2022.
date_created: 2022-08-19T09:41:14Z
date_updated: 2022-08-20T07:02:04Z
ddc:
- '006'
department:
- _id: '34'
- _id: '7'
- _id: '26'
file:
- access_level: open_access
content_type: application/pdf
creator: ahetzer
date_created: 2022-08-19T09:39:57Z
date_updated: 2022-08-19T09:39:57Z
file_id: '33034'
file_name: Final Bachelor Thesis.pdf
file_size: 24830795
relation: main_file
file_date_updated: 2022-08-19T09:39:57Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
place: Paderborn
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'
status: public
title: Combined Ranking and Regression Trees for Algorithm Selection
type: bachelorsthesis
user_id: '38209'
year: '2022'
...
---
_id: '30867'
abstract:
- lang: eng
text: "In online algorithm selection (OAS), instances of an algorithmic problem\r\nclass
are presented to an agent one after another, and the agent has to quickly\r\nselect
a presumably best algorithm from a fixed set of candidate algorithms.\r\nFor decision
problems such as satisfiability (SAT), quality typically refers to\r\nthe algorithm's
runtime. As the latter is known to exhibit a heavy-tail\r\ndistribution, an algorithm
is normally stopped when exceeding a predefined\r\nupper time limit. As a consequence,
machine learning methods used to optimize\r\nan algorithm selection strategy in
a data-driven manner need to deal with\r\nright-censored samples, a problem that
has received little attention in the\r\nliterature so far. In this work, we revisit
multi-armed bandit algorithms for\r\nOAS and discuss their capability of dealing
with the problem. Moreover, we\r\nadapt them towards runtime-oriented losses,
allowing for partially censored\r\ndata while keeping a space- and time-complexity
independent of the time\r\nhorizon. In an extensive experimental evaluation on
an adapted version of the\r\nASlib benchmark, we demonstrate that theoretically
well-founded methods based\r\non Thompson sampling perform specifically strong
and improve in comparison to\r\nexisting methods."
author:
- first_name: Alexander
full_name: Tornede, Alexander
id: '38209'
last_name: Tornede
- first_name: Viktor
full_name: Bengs, Viktor
id: '76599'
last_name: Bengs
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
citation:
ama: Tornede A, Bengs V, Hüllermeier E. Machine Learning for Online Algorithm Selection
under Censored Feedback. Proceedings of the 36th AAAI Conference on Artificial
Intelligence. Published online 2022.
apa: Tornede, A., Bengs, V., & Hüllermeier, E. (2022). Machine Learning for
Online Algorithm Selection under Censored Feedback. In Proceedings of the 36th
AAAI Conference on Artificial Intelligence. AAAI.
bibtex: '@article{Tornede_Bengs_Hüllermeier_2022, title={Machine Learning for Online
Algorithm Selection under Censored Feedback}, journal={Proceedings of the 36th
AAAI Conference on Artificial Intelligence}, publisher={AAAI}, author={Tornede,
Alexander and Bengs, Viktor and Hüllermeier, Eyke}, year={2022} }'
chicago: Tornede, Alexander, Viktor Bengs, and Eyke Hüllermeier. “Machine Learning
for Online Algorithm Selection under Censored Feedback.” Proceedings of the
36th AAAI Conference on Artificial Intelligence. AAAI, 2022.
ieee: A. Tornede, V. Bengs, and E. Hüllermeier, “Machine Learning for Online Algorithm
Selection under Censored Feedback,” Proceedings of the 36th AAAI Conference
on Artificial Intelligence. AAAI, 2022.
mla: Tornede, Alexander, et al. “Machine Learning for Online Algorithm Selection
under Censored Feedback.” Proceedings of the 36th AAAI Conference on Artificial
Intelligence, AAAI, 2022.
short: A. Tornede, V. Bengs, E. Hüllermeier, Proceedings of the 36th AAAI Conference
on Artificial Intelligence (2022).
date_created: 2022-04-12T11:58:56Z
date_updated: 2022-08-24T12:44:27Z
department:
- _id: '34'
- _id: '7'
- _id: '26'
external_id:
arxiv:
- '2109.06234'
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 36th AAAI Conference on Artificial Intelligence
publisher: AAAI
status: public
title: Machine Learning for Online Algorithm Selection under Censored Feedback
type: preprint
user_id: '38209'
year: '2022'
...
---
_id: '30865'
abstract:
- lang: eng
text: "The problem of selecting an algorithm that appears most suitable for a\r\nspecific
instance of an algorithmic problem class, such as the Boolean\r\nsatisfiability
problem, is called instance-specific algorithm selection. Over\r\nthe past decade,
the problem has received considerable attention, resulting in\r\na number of different
methods for algorithm selection. Although most of these\r\nmethods are based on
machine learning, surprisingly little work has been done\r\non meta learning,
that is, on taking advantage of the complementarity of\r\nexisting algorithm selection
methods in order to combine them into a single\r\nsuperior algorithm selector.
In this paper, we introduce the problem of meta\r\nalgorithm selection, which
essentially asks for the best way to combine a given\r\nset of algorithm selectors.
We present a general methodological framework for\r\nmeta algorithm selection
as well as several concrete learning methods as\r\ninstantiations of this framework,
essentially combining ideas of meta learning\r\nand ensemble learning. In an extensive
experimental evaluation, we demonstrate\r\nthat ensembles of algorithm selectors
can significantly outperform single\r\nalgorithm selectors and have the potential
to form the new state of the art in\r\nalgorithm selection."
author:
- first_name: Alexander
full_name: Tornede, Alexander
id: '38209'
last_name: Tornede
- first_name: Lukas
full_name: Gehring, Lukas
last_name: Gehring
- first_name: Tanja
full_name: Tornede, Tanja
id: '40795'
last_name: Tornede
- first_name: Marcel Dominik
full_name: Wever, Marcel Dominik
id: '33176'
last_name: Wever
orcid: ' https://orcid.org/0000-0001-9782-6818'
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
citation:
ama: Tornede A, Gehring L, Tornede T, Wever MD, Hüllermeier E. Algorithm Selection
on a Meta Level. Machine Learning. Published online 2022.
apa: Tornede, A., Gehring, L., Tornede, T., Wever, M. D., & Hüllermeier, E.
(2022). Algorithm Selection on a Meta Level. In Machine Learning.
bibtex: '@article{Tornede_Gehring_Tornede_Wever_Hüllermeier_2022, title={Algorithm
Selection on a Meta Level}, journal={Machine Learning}, author={Tornede, Alexander
and Gehring, Lukas and Tornede, Tanja and Wever, Marcel Dominik and Hüllermeier,
Eyke}, year={2022} }'
chicago: Tornede, Alexander, Lukas Gehring, Tanja Tornede, Marcel Dominik Wever,
and Eyke Hüllermeier. “Algorithm Selection on a Meta Level.” Machine Learning,
2022.
ieee: A. Tornede, L. Gehring, T. Tornede, M. D. Wever, and E. Hüllermeier, “Algorithm
Selection on a Meta Level,” Machine Learning. 2022.
mla: Tornede, Alexander, et al. “Algorithm Selection on a Meta Level.” Machine
Learning, 2022.
short: A. Tornede, L. Gehring, T. Tornede, M.D. Wever, E. Hüllermeier, Machine Learning
(2022).
date_created: 2022-04-12T11:55:18Z
date_updated: 2022-08-24T12:45:39Z
department:
- _id: '34'
- _id: '7'
- _id: '26'
external_id:
arxiv:
- '2107.09414'
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: Machine Learning
status: public
title: Algorithm Selection on a Meta Level
type: preprint
user_id: '38209'
year: '2022'
...
---
_id: '33090'
abstract:
- lang: eng
text: 'AbstractHeated tool butt welding is a method
often used for joining thermoplastics, especially when the components are made
out of different materials. The quality of the connection between the components
crucially depends on a suitable choice of the parameters of the welding process,
such as heating time, temperature, and the precise way how the parts are then
welded. Moreover, when different materials are to be joined, the parameter values
need to be tailored to the specifics of the respective material. To this end,
in this paper, three approaches to tailor the parameter values to optimize the
quality of the connection are compared: a heuristic by Potente, statistical experimental
design, and Bayesian optimization. With the suitability for practice in mind,
a series of experiments are carried out with these approaches, and their capabilities
of proposing well-performing parameter values are investigated. As a result, Bayesian
optimization is found to yield peak performance, but the costs for optimization
are substantial. In contrast, the Potente heuristic does not require any experimentation
and recommends parameter values with competitive quality.'
author:
- first_name: Karina
full_name: Gevers, Karina
id: '83151'
last_name: Gevers
- first_name: Alexander
full_name: Tornede, Alexander
id: '38209'
last_name: Tornede
- first_name: Marcel Dominik
full_name: Wever, Marcel Dominik
id: '33176'
last_name: Wever
orcid: ' https://orcid.org/0000-0001-9782-6818'
- first_name: Volker
full_name: Schöppner, Volker
id: '20530'
last_name: Schöppner
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
citation:
ama: Gevers K, Tornede A, Wever MD, Schöppner V, Hüllermeier E. A comparison of
heuristic, statistical, and machine learning methods for heated tool butt welding
of two different materials. Welding in the World. Published online 2022.
doi:10.1007/s40194-022-01339-9
apa: Gevers, K., Tornede, A., Wever, M. D., Schöppner, V., & Hüllermeier, E.
(2022). A comparison of heuristic, statistical, and machine learning methods for
heated tool butt welding of two different materials. Welding in the World.
https://doi.org/10.1007/s40194-022-01339-9
bibtex: '@article{Gevers_Tornede_Wever_Schöppner_Hüllermeier_2022, title={A comparison
of heuristic, statistical, and machine learning methods for heated tool butt welding
of two different materials}, DOI={10.1007/s40194-022-01339-9},
journal={Welding in the World}, publisher={Springer Science and Business Media
LLC}, author={Gevers, Karina and Tornede, Alexander and Wever, Marcel Dominik
and Schöppner, Volker and Hüllermeier, Eyke}, year={2022} }'
chicago: Gevers, Karina, Alexander Tornede, Marcel Dominik Wever, Volker Schöppner,
and Eyke Hüllermeier. “A Comparison of Heuristic, Statistical, and Machine Learning
Methods for Heated Tool Butt Welding of Two Different Materials.” Welding in
the World, 2022. https://doi.org/10.1007/s40194-022-01339-9.
ieee: 'K. Gevers, A. Tornede, M. D. Wever, V. Schöppner, and E. Hüllermeier, “A
comparison of heuristic, statistical, and machine learning methods for heated
tool butt welding of two different materials,” Welding in the World, 2022,
doi: 10.1007/s40194-022-01339-9.'
mla: Gevers, Karina, et al. “A Comparison of Heuristic, Statistical, and Machine
Learning Methods for Heated Tool Butt Welding of Two Different Materials.” Welding
in the World, Springer Science and Business Media LLC, 2022, doi:10.1007/s40194-022-01339-9.
short: K. Gevers, A. Tornede, M.D. Wever, V. Schöppner, E. Hüllermeier, Welding
in the World (2022).
date_created: 2022-08-24T12:51:07Z
date_updated: 2022-08-24T12:52:06Z
doi: 10.1007/s40194-022-01339-9
keyword:
- Metals and Alloys
- Mechanical Engineering
- Mechanics of Materials
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: Welding in the World
publication_identifier:
issn:
- 0043-2288
- 1878-6669
publication_status: published
publisher: Springer Science and Business Media LLC
status: public
title: A comparison of heuristic, statistical, and machine learning methods for heated
tool butt welding of two different materials
type: journal_article
user_id: '38209'
year: '2022'
...
---
_id: '33230'
author:
- first_name: Joshua J.
full_name: Daymude, Joshua J.
last_name: Daymude
- first_name: Andréa W.
full_name: Richa, Andréa W.
last_name: Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Daymude JJ, Richa AW, Scheideler C. Local Mutual Exclusion for Dynamic, Anonymous,
Bounded Memory Message Passing Systems. In: Aspnes J, Michail O, eds. 1st Symposium
on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022,
Virtual Conference. Vol 221. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für
Informatik; 2022:12:1–12:19. doi:10.4230/LIPIcs.SAND.2022.12'
apa: Daymude, J. J., Richa, A. W., & Scheideler, C. (2022). Local Mutual Exclusion
for Dynamic, Anonymous, Bounded Memory Message Passing Systems. In J. Aspnes &
O. Michail (Eds.), 1st Symposium on Algorithmic Foundations of Dynamic Networks,
SAND 2022, March 28-30, 2022, Virtual Conference (Vol. 221, p. 12:1–12:19).
Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SAND.2022.12
bibtex: '@inproceedings{Daymude_Richa_Scheideler_2022, series={LIPIcs}, title={Local
Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems},
volume={221}, DOI={10.4230/LIPIcs.SAND.2022.12},
booktitle={1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND
2022, March 28-30, 2022, Virtual Conference}, publisher={Schloss Dagstuhl - Leibniz-Zentrum
für Informatik}, author={Daymude, Joshua J. and Richa, Andréa W. and Scheideler,
Christian}, editor={Aspnes, James and Michail, Othon}, year={2022}, pages={12:1–12:19},
collection={LIPIcs} }'
chicago: Daymude, Joshua J., Andréa W. Richa, and Christian Scheideler. “Local Mutual
Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems.” In
1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March
28-30, 2022, Virtual Conference, edited by James Aspnes and Othon Michail,
221:12:1–12:19. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.
https://doi.org/10.4230/LIPIcs.SAND.2022.12.
ieee: 'J. J. Daymude, A. W. Richa, and C. Scheideler, “Local Mutual Exclusion for
Dynamic, Anonymous, Bounded Memory Message Passing Systems,” in 1st Symposium
on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022,
Virtual Conference, 2022, vol. 221, p. 12:1–12:19, doi: 10.4230/LIPIcs.SAND.2022.12.'
mla: Daymude, Joshua J., et al. “Local Mutual Exclusion for Dynamic, Anonymous,
Bounded Memory Message Passing Systems.” 1st Symposium on Algorithmic Foundations
of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference, edited
by James Aspnes and Othon Michail, vol. 221, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2022, p. 12:1–12:19, doi:10.4230/LIPIcs.SAND.2022.12.
short: 'J.J. Daymude, A.W. Richa, C. Scheideler, in: J. Aspnes, O. Michail (Eds.),
1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March
28-30, 2022, Virtual Conference, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2022, p. 12:1–12:19.'
date_created: 2022-08-30T06:31:21Z
date_updated: 2022-08-30T06:33:44Z
department:
- _id: '79'
doi: 10.4230/LIPIcs.SAND.2022.12
editor:
- first_name: James
full_name: Aspnes, James
last_name: Aspnes
- first_name: Othon
full_name: Michail, Othon
last_name: Michail
intvolume: ' 221'
language:
- iso: eng
page: 12:1–12:19
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: 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022,
March 28-30, 2022, Virtual Conference
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
series_title: LIPIcs
status: public
title: Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing
Systems
type: conference
user_id: '15504'
volume: 221
year: '2022'
...