---
_id: '57863'
author:
- first_name: Mesut
full_name: Alptekin, Mesut
id: '11763'
last_name: Alptekin
orcid: 0009-0004-8545-1165
- first_name: Katrin
full_name: Temmen, Katrin
id: '30086'
last_name: Temmen
citation:
ama: 'Alptekin M, Temmen K. Effectiveness Study of an Augmented Reality App as Preparation
Tool for Electrical Engineering Laboratory Courses. In: Auer ME, Langmann R, May
D, Roos K, eds. Smart Technologies for a Sustainable Future. Vol 1027.
Springer Nature Switzerland; 2024:297–304. doi:10.1007/978-3-031-61891-8_29'
apa: Alptekin, M., & Temmen, K. (2024). Effectiveness Study of an Augmented
Reality App as Preparation Tool for Electrical Engineering Laboratory Courses.
In M. E. Auer, R. Langmann, D. May, & K. Roos (Eds.), Smart Technologies
for a Sustainable Future (Vol. 1027, pp. 297–304). Springer Nature Switzerland.
https://doi.org/10.1007/978-3-031-61891-8_29
bibtex: '@inbook{Alptekin_Temmen_2024, place={Cham}, title={Effectiveness Study
of an Augmented Reality App as Preparation Tool for Electrical Engineering Laboratory
Courses}, volume={1027}, DOI={10.1007/978-3-031-61891-8_29},
booktitle={Smart Technologies for a Sustainable Future}, publisher={Springer Nature
Switzerland}, author={Alptekin, Mesut and Temmen, Katrin}, editor={Auer, Michael
E. and Langmann, Reinhard and May, Dominik and Roos, Kim}, year={2024}, pages={297–304}
}'
chicago: 'Alptekin, Mesut, and Katrin Temmen. “Effectiveness Study of an Augmented
Reality App as Preparation Tool for Electrical Engineering Laboratory Courses.”
In Smart Technologies for a Sustainable Future, edited by Michael E. Auer,
Reinhard Langmann, Dominik May, and Kim Roos, 1027:297–304. Cham: Springer Nature
Switzerland, 2024. https://doi.org/10.1007/978-3-031-61891-8_29.'
ieee: 'M. Alptekin and K. Temmen, “Effectiveness Study of an Augmented Reality App
as Preparation Tool for Electrical Engineering Laboratory Courses,” in Smart
Technologies for a Sustainable Future, vol. 1027, M. E. Auer, R. Langmann,
D. May, and K. Roos, Eds. Cham: Springer Nature Switzerland, 2024, pp. 297–304.'
mla: Alptekin, Mesut, and Katrin Temmen. “Effectiveness Study of an Augmented Reality
App as Preparation Tool for Electrical Engineering Laboratory Courses.” Smart
Technologies for a Sustainable Future, edited by Michael E. Auer et al., vol.
1027, Springer Nature Switzerland, 2024, pp. 297–304, doi:10.1007/978-3-031-61891-8_29.
short: 'M. Alptekin, K. Temmen, in: M.E. Auer, R. Langmann, D. May, K. Roos (Eds.),
Smart Technologies for a Sustainable Future, Springer Nature Switzerland, Cham,
2024, pp. 297–304.'
date_created: 2024-12-29T11:03:09Z
date_updated: 2025-08-19T08:50:21Z
department:
- _id: '34'
- _id: '300'
doi: 10.1007/978-3-031-61891-8_29
editor:
- first_name: Michael E.
full_name: Auer, Michael E.
last_name: Auer
- first_name: Reinhard
full_name: Langmann, Reinhard
last_name: Langmann
- first_name: Dominik
full_name: May, Dominik
last_name: May
- first_name: Kim
full_name: Roos, Kim
last_name: Roos
intvolume: ' 1027'
language:
- iso: eng
page: 297–304
place: Cham
project:
- _id: '1387'
name: DigiSelF - Digitalisierung als Herausforderung und Innovation in der Hochschullehre
publication: Smart Technologies for a Sustainable Future
publication_identifier:
isbn:
- 978-3-031-61890-1 978-3-031-61891-8
publisher: Springer Nature Switzerland
status: public
title: Effectiveness Study of an Augmented Reality App as Preparation Tool for Electrical
Engineering Laboratory Courses
type: book_chapter
user_id: '11763'
volume: 1027
year: '2024'
...
---
_id: '54459'
article_number: '123417'
author:
- first_name: Lukas
full_name: Knorr, Lukas
id: '90391'
last_name: Knorr
- first_name: Florian
full_name: Schlosser, Florian
id: '88614'
last_name: Schlosser
- first_name: Nils
full_name: Horstmann, Nils
last_name: Horstmann
- first_name: Denis
full_name: Divkovic, Denis
id: '89059'
last_name: Divkovic
- first_name: Henning
full_name: Meschede, Henning
id: '86954'
last_name: Meschede
orcid: 0000-0002-1538-089X
citation:
ama: Knorr L, Schlosser F, Horstmann N, Divkovic D, Meschede H. Flexible operation
and integration of high-temperature heat pumps using large temperature glides.
Applied Energy. 2024;368. doi:10.1016/j.apenergy.2024.123417
apa: Knorr, L., Schlosser, F., Horstmann, N., Divkovic, D., & Meschede, H. (2024).
Flexible operation and integration of high-temperature heat pumps using large
temperature glides. Applied Energy, 368, Article 123417. https://doi.org/10.1016/j.apenergy.2024.123417
bibtex: '@article{Knorr_Schlosser_Horstmann_Divkovic_Meschede_2024, title={Flexible
operation and integration of high-temperature heat pumps using large temperature
glides}, volume={368}, DOI={10.1016/j.apenergy.2024.123417},
number={123417}, journal={Applied Energy}, publisher={Elsevier BV}, author={Knorr,
Lukas and Schlosser, Florian and Horstmann, Nils and Divkovic, Denis and Meschede,
Henning}, year={2024} }'
chicago: Knorr, Lukas, Florian Schlosser, Nils Horstmann, Denis Divkovic, and Henning
Meschede. “Flexible Operation and Integration of High-Temperature Heat Pumps Using
Large Temperature Glides.” Applied Energy 368 (2024). https://doi.org/10.1016/j.apenergy.2024.123417.
ieee: 'L. Knorr, F. Schlosser, N. Horstmann, D. Divkovic, and H. Meschede, “Flexible
operation and integration of high-temperature heat pumps using large temperature
glides,” Applied Energy, vol. 368, Art. no. 123417, 2024, doi: 10.1016/j.apenergy.2024.123417.'
mla: Knorr, Lukas, et al. “Flexible Operation and Integration of High-Temperature
Heat Pumps Using Large Temperature Glides.” Applied Energy, vol. 368, 123417,
Elsevier BV, 2024, doi:10.1016/j.apenergy.2024.123417.
short: L. Knorr, F. Schlosser, N. Horstmann, D. Divkovic, H. Meschede, Applied Energy
368 (2024).
date_created: 2024-05-27T10:29:14Z
date_updated: 2025-09-03T12:21:47Z
department:
- _id: '644'
doi: 10.1016/j.apenergy.2024.123417
intvolume: ' 368'
language:
- iso: eng
publication: Applied Energy
publication_identifier:
issn:
- 0306-2619
publication_status: published
publisher: Elsevier BV
status: public
title: Flexible operation and integration of high-temperature heat pumps using large
temperature glides
type: journal_article
user_id: '90391'
volume: 368
year: '2024'
...
---
_id: '55637'
author:
- first_name: Anastassija
full_name: Kostan, Anastassija
last_name: Kostan
- first_name: Sara
full_name: Olschar, Sara
last_name: Olschar
- first_name: Lucy
full_name: Simko, Lucy
last_name: Simko
- first_name: Yasemin
full_name: Acar, Yasemin
id: '94636'
last_name: Acar
citation:
ama: 'Kostan A, Olschar S, Simko L, Acar Y. Exploring digital security and privacy
in relative poverty in Germany through qualitative interviews. In: Balzarotti
D, Xu W, eds. 33rd USENIX Security Symposium, USENIX Security 2024, Philadelphia,
PA, USA, August 14-16, 2024. USENIX Association; 2024.'
apa: Kostan, A., Olschar, S., Simko, L., & Acar, Y. (2024). Exploring digital
security and privacy in relative poverty in Germany through qualitative interviews.
In D. Balzarotti & W. Xu (Eds.), 33rd USENIX Security Symposium, USENIX
Security 2024, Philadelphia, PA, USA, August 14-16, 2024. USENIX Association.
bibtex: '@inproceedings{Kostan_Olschar_Simko_Acar_2024, title={Exploring digital
security and privacy in relative poverty in Germany through qualitative interviews},
booktitle={33rd USENIX Security Symposium, USENIX Security 2024, Philadelphia,
PA, USA, August 14-16, 2024}, publisher={USENIX Association}, author={Kostan,
Anastassija and Olschar, Sara and Simko, Lucy and Acar, Yasemin}, editor={Balzarotti,
Davide and Xu, Wenyuan}, year={2024} }'
chicago: Kostan, Anastassija, Sara Olschar, Lucy Simko, and Yasemin Acar. “Exploring
Digital Security and Privacy in Relative Poverty in Germany through Qualitative
Interviews.” In 33rd USENIX Security Symposium, USENIX Security 2024, Philadelphia,
PA, USA, August 14-16, 2024, edited by Davide Balzarotti and Wenyuan Xu. USENIX
Association, 2024.
ieee: A. Kostan, S. Olschar, L. Simko, and Y. Acar, “Exploring digital security
and privacy in relative poverty in Germany through qualitative interviews,” in
33rd USENIX Security Symposium, USENIX Security 2024, Philadelphia, PA, USA,
August 14-16, 2024, 2024.
mla: Kostan, Anastassija, et al. “Exploring Digital Security and Privacy in Relative
Poverty in Germany through Qualitative Interviews.” 33rd USENIX Security Symposium,
USENIX Security 2024, Philadelphia, PA, USA, August 14-16, 2024, edited by
Davide Balzarotti and Wenyuan Xu, USENIX Association, 2024.
short: 'A. Kostan, S. Olschar, L. Simko, Y. Acar, in: D. Balzarotti, W. Xu (Eds.),
33rd USENIX Security Symposium, USENIX Security 2024, Philadelphia, PA, USA, August
14-16, 2024, USENIX Association, 2024.'
date_created: 2024-08-19T08:27:57Z
date_updated: 2025-09-04T11:19:24Z
department:
- _id: '740'
editor:
- first_name: Davide
full_name: Balzarotti, Davide
last_name: Balzarotti
- first_name: Wenyuan
full_name: Xu, Wenyuan
last_name: Xu
language:
- iso: eng
publication: 33rd USENIX Security Symposium, USENIX Security 2024, Philadelphia, PA,
USA, August 14-16, 2024
publisher: USENIX Association
status: public
title: Exploring digital security and privacy in relative poverty in Germany through
qualitative interviews
type: conference
user_id: '15458'
year: '2024'
...
---
_id: '59581'
author:
- first_name: Uta
full_name: Häsel-Weide, Uta
id: '60267'
last_name: Häsel-Weide
orcid: 0000-0001-6278-4240
- first_name: M.
full_name: Nührenbörger, M.
last_name: Nührenbörger
citation:
ama: 'Häsel-Weide U, Nührenbörger M. Praktiken der Förderung im inklusiven Mathematikunterricht.
In: Ebers P, Rösken F, Barzel B, Büchter A, Schacht F, Scherer P, eds. Beiträge
zum Mathematikuntericht 2024. 57. Jahrestagung der Gesellschaft für Didaktik der
Mathematik. ; 2024:207-210. doi:https://doi.ohttps://doi.org/10.37626/GA9783959872782.0
rg/10.37626/GA9783959872782.0'
apa: Häsel-Weide, U., & Nührenbörger, M. (2024). Praktiken der Förderung im
inklusiven Mathematikunterricht. In P. Ebers, F. Rösken, B. Barzel, A. Büchter,
F. Schacht, & P. Scherer (Eds.), Beiträge zum Mathematikuntericht 2024.
57. Jahrestagung der Gesellschaft für Didaktik der Mathematik (pp. 207–210).
https://doi.ohttps://doi.org/10.37626/GA9783959872782.0
rg/10.37626/GA9783959872782.0
bibtex: '@inbook{Häsel-Weide_Nührenbörger_2024, title={ Praktiken der Förderung
im inklusiven Mathematikunterricht}, DOI={https://doi.ohttps://doi.org/10.37626/GA9783959872782.0
rg/10.37626/GA9783959872782.0}, booktitle={Beiträge zum Mathematikuntericht
2024. 57. Jahrestagung der Gesellschaft für Didaktik der Mathematik}, author={Häsel-Weide,
Uta and Nührenbörger, M.}, editor={Ebers, P. and Rösken, F. and Barzel, B. and
Büchter, A. and Schacht, F. and Scherer, P.}, year={2024}, pages={207–210} }'
chicago: Häsel-Weide, Uta, and M. Nührenbörger. “ Praktiken der Förderung im inklusiven
Mathematikunterricht.” In Beiträge zum Mathematikuntericht 2024. 57. Jahrestagung
der Gesellschaft für Didaktik der Mathematik, edited by P. Ebers, F. Rösken,
B. Barzel, A. Büchter, F. Schacht, and P. Scherer, 207–10, 2024. https://doi.ohttps://doi.org/10.37626/GA9783959872782.0
rg/10.37626/GA9783959872782.0.
ieee: U. Häsel-Weide and M. Nührenbörger, “ Praktiken der Förderung im inklusiven
Mathematikunterricht,” in Beiträge zum Mathematikuntericht 2024. 57. Jahrestagung
der Gesellschaft für Didaktik der Mathematik, P. Ebers, F. Rösken, B. Barzel,
A. Büchter, F. Schacht, and P. Scherer, Eds. 2024, pp. 207–210.
mla: Häsel-Weide, Uta, and M. Nührenbörger. “ Praktiken der Förderung im inklusiven
Mathematikunterricht.” Beiträge zum Mathematikuntericht 2024. 57. Jahrestagung
der Gesellschaft für Didaktik der Mathematik, edited by P. Ebers et al., 2024,
pp. 207–10, doi:https://doi.ohttps://doi.org/10.37626/GA9783959872782.0
rg/10.37626/GA9783959872782.0.
short: 'U. Häsel-Weide, M. Nührenbörger, in: P. Ebers, F. Rösken, B. Barzel, A.
Büchter, F. Schacht, P. Scherer (Eds.), Beiträge zum Mathematikuntericht 2024.
57. Jahrestagung der Gesellschaft für Didaktik der Mathematik, 2024, pp. 207–210.'
date_created: 2025-04-15T10:06:42Z
date_updated: 2025-09-08T07:32:38Z
department:
- _id: '543'
doi: https://doi.ohttps://doi.org/10.37626/GA9783959872782.0 rg/10.37626/GA9783959872782.0
editor:
- first_name: P.
full_name: Ebers, P.
last_name: Ebers
- first_name: F.
full_name: Rösken, F.
last_name: Rösken
- first_name: B.
full_name: Barzel, B.
last_name: Barzel
- first_name: A.
full_name: Büchter, A.
last_name: Büchter
- first_name: F.
full_name: Schacht, F.
last_name: Schacht
- first_name: P.
full_name: Scherer, P.
last_name: Scherer
language:
- iso: ger
page: 207-210
publication: Beiträge zum Mathematikuntericht 2024. 57. Jahrestagung der Gesellschaft
für Didaktik der Mathematik
status: public
title: ' Praktiken der Förderung im inklusiven Mathematikunterricht'
type: book_chapter
user_id: '44184'
year: '2024'
...
---
_id: '61172'
article_number: '114352'
author:
- first_name: Sam
full_name: Coy, Sam
last_name: Coy
- first_name: Artur
full_name: Czumaj, Artur
last_name: Czumaj
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Philipp
full_name: Schneider, Philipp
last_name: Schneider
- first_name: Julian
full_name: Werthmann, Julian
id: '50024'
last_name: Werthmann
citation:
ama: Coy S, Czumaj A, Scheideler C, Schneider P, Werthmann J. Routing Schemes for
Hybrid Communication Networks. Theoretical Computer Science. 2024;985.
doi:10.1016/j.tcs.2023.114352
apa: Coy, S., Czumaj, A., Scheideler, C., Schneider, P., & Werthmann, J. (2024).
Routing Schemes for Hybrid Communication Networks. Theoretical Computer Science,
985, Article 114352. https://doi.org/10.1016/j.tcs.2023.114352
bibtex: '@article{Coy_Czumaj_Scheideler_Schneider_Werthmann_2024, title={Routing
Schemes for Hybrid Communication Networks}, volume={985}, DOI={10.1016/j.tcs.2023.114352},
number={114352}, journal={Theoretical Computer Science}, publisher={Elsevier BV},
author={Coy, Sam and Czumaj, Artur and Scheideler, Christian and Schneider, Philipp
and Werthmann, Julian}, year={2024} }'
chicago: Coy, Sam, Artur Czumaj, Christian Scheideler, Philipp Schneider, and Julian
Werthmann. “Routing Schemes for Hybrid Communication Networks.” Theoretical
Computer Science 985 (2024). https://doi.org/10.1016/j.tcs.2023.114352.
ieee: 'S. Coy, A. Czumaj, C. Scheideler, P. Schneider, and J. Werthmann, “Routing
Schemes for Hybrid Communication Networks,” Theoretical Computer Science,
vol. 985, Art. no. 114352, 2024, doi: 10.1016/j.tcs.2023.114352.'
mla: Coy, Sam, et al. “Routing Schemes for Hybrid Communication Networks.” Theoretical
Computer Science, vol. 985, 114352, Elsevier BV, 2024, doi:10.1016/j.tcs.2023.114352.
short: S. Coy, A. Czumaj, C. Scheideler, P. Schneider, J. Werthmann, Theoretical
Computer Science 985 (2024).
date_created: 2025-09-10T14:26:11Z
date_updated: 2025-09-10T14:52:21Z
department:
- _id: '79'
doi: 10.1016/j.tcs.2023.114352
intvolume: ' 985'
language:
- iso: eng
project:
- _id: '5'
name: 'SFB 901; TP A1: Möglichkeiten und Grenzen lokaler Strategien in dynamischen
Netzen'
publication: Theoretical Computer Science
publication_identifier:
issn:
- 0304-3975
publication_status: published
publisher: Elsevier BV
status: public
title: Routing Schemes for Hybrid Communication Networks
type: journal_article
user_id: '50024'
volume: 985
year: '2024'
...
---
_id: '57240'
abstract:
- lang: eng
text: Validating assertions before adding them to a knowledge graph is an essential
part of its creation and maintenance. Due to the sheer size of knowledge graphs,
automatic fact-checking approaches have been developed. These approaches rely
on reference knowledge to decide whether a given assertion is correct. Recent
hybrid approaches achieve good results by including several knowledge sources.
However, it is often impractical to provide a sheer quantity of textual knowledge
or generate embedding models to leverage these hybrid approaches. We present FaVEL,
an approach that uses algorithm selection and ensemble learning to amalgamate
several existing fact-checking approaches that rely solely on a reference knowledge
graph and, hence, use fewer resources than current hybrid approaches. For our
evaluation, we create updated versions of two existing datasets and a new dataset
dubbed FaVEL-DS. Our evaluation compares our approach to 15 fact-checking approaches—including
the state-of-the-art approach HybridFC—on 3 datasets. Our results demonstrate
that FaVEL outperforms all other approaches significantly by at least 0.04 in
terms of the area under the ROC curve. Our source code, datasets, and evaluation
results are open-source and can be found at https://github.com/dice-group/favel.
author:
- first_name: Umair
full_name: Qudus, Umair
id: '83392'
last_name: Qudus
orcid: 0000-0001-6714-8729
- first_name: Michael
full_name: Röder, Michael
id: '67199'
last_name: Röder
orcid: https://orcid.org/0000-0002-8609-8277
- first_name: Franck Lionel
full_name: Tatkeu Pekarou, Franck Lionel
last_name: Tatkeu Pekarou
- first_name: Ana Alexandra
full_name: Morim da Silva, Ana Alexandra
id: '72108'
last_name: Morim da Silva
- first_name: Axel-Cyrille
full_name: Ngonga Ngomo, Axel-Cyrille
id: '65716'
last_name: Ngonga Ngomo
citation:
ama: 'Qudus U, Röder M, Tatkeu Pekarou FL, Morim da Silva AA, Ngonga Ngomo A-C.
FaVEL: Fact Validation Ensemble Learning. In: Rospocher M, Mehwish Alam, eds.
EKAW 2024. ; 2024.'
apa: 'Qudus, U., Röder, M., Tatkeu Pekarou, F. L., Morim da Silva, A. A., &
Ngonga Ngomo, A.-C. (2024). FaVEL: Fact Validation Ensemble Learning. In M. Rospocher
& Mehwish Alam (Eds.), EKAW 2024.'
bibtex: '@inproceedings{Qudus_Röder_Tatkeu Pekarou_Morim da Silva_Ngonga Ngomo_2024,
title={FaVEL: Fact Validation Ensemble Learning}, booktitle={EKAW 2024}, author={Qudus,
Umair and Röder, Michael and Tatkeu Pekarou, Franck Lionel and Morim da Silva,
Ana Alexandra and Ngonga Ngomo, Axel-Cyrille}, editor={Rospocher, Marco and Mehwish
Alam}, year={2024} }'
chicago: 'Qudus, Umair, Michael Röder, Franck Lionel Tatkeu Pekarou, Ana Alexandra
Morim da Silva, and Axel-Cyrille Ngonga Ngomo. “FaVEL: Fact Validation Ensemble
Learning.” In EKAW 2024, edited by Marco Rospocher and Mehwish Alam, 2024.'
ieee: 'U. Qudus, M. Röder, F. L. Tatkeu Pekarou, A. A. Morim da Silva, and A.-C.
Ngonga Ngomo, “FaVEL: Fact Validation Ensemble Learning,” in EKAW 2024,
Amsterdam, Netherlands, 2024.'
mla: 'Qudus, Umair, et al. “FaVEL: Fact Validation Ensemble Learning.” EKAW 2024,
edited by Marco Rospocher and Mehwish Alam, 2024.'
short: 'U. Qudus, M. Röder, F.L. Tatkeu Pekarou, A.A. Morim da Silva, A.-C. Ngonga
Ngomo, in: M. Rospocher, Mehwish Alam (Eds.), EKAW 2024, 2024.'
conference:
end_date: 2024-11-28
location: Amsterdam, Netherlands
name: 24th International Conference on Knowledge Engineering and Knowledge Management
start_date: 2024-11-26
corporate_editor:
- Mehwish Alam
date_created: 2024-11-19T14:12:49Z
date_updated: 2025-09-11T09:48:12Z
ddc:
- '600'
department:
- _id: '34'
editor:
- first_name: Marco
full_name: Rospocher, Marco
last_name: Rospocher
file:
- access_level: closed
content_type: application/pdf
creator: uqudus
date_created: 2024-11-19T14:14:14Z
date_updated: 2024-11-19T14:14:14Z
file_id: '57241'
file_name: favel.pdf
file_size: 190661
relation: main_file
success: 1
file_date_updated: 2024-11-19T14:14:14Z
has_accepted_license: '1'
keyword:
- fact checking
- ensemble learning
- transfer learning
- knowledge management.
language:
- iso: eng
popular_science: '1'
project:
- _id: '412'
name: 'NEBULA: Nutzerzentrierte KI-basierte Erkennung von Fake-News und Fehlinformationen'
- _id: '285'
name: 'SAIL: SAIL - Nachhaltiger Lebenszyklus von intelligenten soziotechnischen
Systemen'
- _id: '410'
name: 'KnowGraphs: KnowGraphs: Knowledge Graphs at Scale'
publication: EKAW 2024
quality_controlled: '1'
status: public
title: 'FaVEL: Fact Validation Ensemble Learning'
type: conference
user_id: '83392'
year: '2024'
...
---
_id: '58377'
abstract:
- lang: eng
text: "The connection between inconsistent databases and Dung's abstract\r\nargumentation
framework has recently drawn growing interest. Specifically, an\r\ninconsistent
database, involving certain types of integrity constraints such as\r\nfunctional
and inclusion dependencies, can be viewed as an argumentation\r\nframework in
Dung's setting. Nevertheless, no prior work has explored the exact\r\nexpressive
power of Dung's theory of argumentation when compared to\r\ninconsistent databases
and integrity constraints. In this paper, we close this\r\ngap by arguing that
an argumentation framework can also be viewed as an\r\ninconsistent database.
We first establish a connection between subset-repairs\r\nfor databases and extensions
for AFs, considering conflict-free, naive,\r\nadmissible, and preferred semantics.
Further, we define a new family of\r\nattribute-based repairs based on the principle
of maximal content preservation.\r\nThe effectiveness of these repairs is then
highlighted by connecting them to\r\nstable, semi-stable, and stage semantics.
Our main contributions include\r\ntranslating an argumentation framework into
a database together with integrity\r\nconstraints. Moreover, this translation
can be achieved in polynomial time,\r\nwhich is essential in transferring complexity
results between the two\r\nformalisms."
author:
- first_name: Yasir
full_name: Mahmood, Yasir
id: '99353'
last_name: Mahmood
- first_name: Markus
full_name: Hecher, Markus
last_name: Hecher
- first_name: Axel-Cyrille
full_name: Ngonga Ngomo, Axel-Cyrille
id: '65716'
last_name: Ngonga Ngomo
citation:
ama: 'Mahmood Y, Hecher M, Ngonga Ngomo A-C. Dung’s Argumentation Framework: Unveiling
the Expressive Power with Inconsistent Databases. In: ; 2024. doi:10.1609/AAAI.V39I14.33651'
apa: 'Mahmood, Y., Hecher, M., & Ngonga Ngomo, A.-C. (2024). Dung’s Argumentation
Framework: Unveiling the Expressive Power with Inconsistent Databases. https://doi.org/10.1609/AAAI.V39I14.33651'
bibtex: '@inproceedings{Mahmood_Hecher_Ngonga Ngomo_2024, title={Dung’s Argumentation
Framework: Unveiling the Expressive Power with Inconsistent Databases}, DOI={10.1609/AAAI.V39I14.33651},
author={Mahmood, Yasir and Hecher, Markus and Ngonga Ngomo, Axel-Cyrille}, year={2024}
}'
chicago: 'Mahmood, Yasir, Markus Hecher, and Axel-Cyrille Ngonga Ngomo. “Dung’s
Argumentation Framework: Unveiling the Expressive Power with Inconsistent Databases,”
2024. https://doi.org/10.1609/AAAI.V39I14.33651.'
ieee: 'Y. Mahmood, M. Hecher, and A.-C. Ngonga Ngomo, “Dung’s Argumentation Framework:
Unveiling the Expressive Power with Inconsistent Databases,” 2024, doi: 10.1609/AAAI.V39I14.33651.'
mla: 'Mahmood, Yasir, et al. Dung’s Argumentation Framework: Unveiling the Expressive
Power with Inconsistent Databases. 2024, doi:10.1609/AAAI.V39I14.33651.'
short: 'Y. Mahmood, M. Hecher, A.-C. Ngonga Ngomo, in: 2024.'
date_created: 2025-01-27T15:30:41Z
date_updated: 2025-09-11T10:01:11Z
department:
- _id: '574'
doi: 10.1609/AAAI.V39I14.33651
external_id:
arxiv:
- '2412.11617'
language:
- iso: eng
project:
- _id: '121'
name: 'TRR 318; TP B01: Ein dialogbasierter Ansatz zur Erklärung von Modellen des
maschinellen Lernens'
status: public
title: 'Dung''s Argumentation Framework: Unveiling the Expressive Power with Inconsistent
Databases'
type: conference
user_id: '99353'
year: '2024'
...
---
_id: '57238'
abstract:
- lang: eng
text: Abstract argumentation is a popular toolkit for modeling, evaluating,
and comparing arguments. Relationships between arguments are specified in argumentation
frameworks (AFs), and conditions are placed on sets (extensions) of arguments
that allow AFs to be evaluated. For more expressiveness, AFs are augmented with
acceptance conditions on directly interacting arguments or a constraint on the
admissible sets of arguments, resulting in dialectic frameworks or constrained
argumentation frameworks. In this paper, we consider flexible conditions for rejecting
an argument from an extension, which we call rejection conditions (RCs). On the
technical level, we associate each argument with a specific logic program. We
analyze the resulting complexity, including the structural parameter treewidth.
Rejection AFs are highly expressive, giving rise to natural problems on higher
levels of the polynomial hierarchy.
author:
- first_name: Johannes K.
full_name: Fichte, Johannes K.
last_name: Fichte
- first_name: Markus
full_name: Hecher, Markus
last_name: Hecher
- first_name: Yasir
full_name: Mahmood, Yasir
id: '99353'
last_name: Mahmood
- first_name: Arne
full_name: Meier, Arne
last_name: Meier
citation:
ama: 'Fichte JK, Hecher M, Mahmood Y, Meier A. Rejection in Abstract Argumentation:
Harder Than Acceptance? In: Frontiers in Artificial Intelligence and Applications.
IOS Press; 2024. doi:10.3233/faia240867'
apa: 'Fichte, J. K., Hecher, M., Mahmood, Y., & Meier, A. (2024). Rejection
in Abstract Argumentation: Harder Than Acceptance? In Frontiers in Artificial
Intelligence and Applications. ECAI} 2024 - 27th European Conference on Artificial
Intelligence, Santiago de Compostela, Spain. IOS Press. https://doi.org/10.3233/faia240867'
bibtex: '@inbook{Fichte_Hecher_Mahmood_Meier_2024, title={Rejection in Abstract
Argumentation: Harder Than Acceptance?}, DOI={10.3233/faia240867},
booktitle={Frontiers in Artificial Intelligence and Applications}, publisher={IOS
Press}, author={Fichte, Johannes K. and Hecher, Markus and Mahmood, Yasir and
Meier, Arne}, year={2024} }'
chicago: 'Fichte, Johannes K., Markus Hecher, Yasir Mahmood, and Arne Meier. “Rejection
in Abstract Argumentation: Harder Than Acceptance?” In Frontiers in Artificial
Intelligence and Applications. IOS Press, 2024. https://doi.org/10.3233/faia240867.'
ieee: 'J. K. Fichte, M. Hecher, Y. Mahmood, and A. Meier, “Rejection in Abstract
Argumentation: Harder Than Acceptance?,” in Frontiers in Artificial Intelligence
and Applications, IOS Press, 2024.'
mla: 'Fichte, Johannes K., et al. “Rejection in Abstract Argumentation: Harder Than
Acceptance?” Frontiers in Artificial Intelligence and Applications, IOS
Press, 2024, doi:10.3233/faia240867.'
short: 'J.K. Fichte, M. Hecher, Y. Mahmood, A. Meier, in: Frontiers in Artificial
Intelligence and Applications, IOS Press, 2024.'
conference:
location: Santiago de Compostela, Spain
name: ECAI} 2024 - 27th European Conference on Artificial Intelligence
date_created: 2024-11-19T11:46:55Z
date_updated: 2025-09-11T10:01:52Z
department:
- _id: '574'
doi: 10.3233/faia240867
language:
- iso: eng
project:
- _id: '121'
name: 'TRR 318; TP B01: Ein dialogbasierter Ansatz zur Erklärung von Modellen des
maschinellen Lernens'
publication: Frontiers in Artificial Intelligence and Applications
publication_identifier:
isbn:
- '9781643685489'
issn:
- 0922-6389
- 1879-8314
publication_status: published
publisher: IOS Press
status: public
title: 'Rejection in Abstract Argumentation: Harder Than Acceptance?'
type: book_chapter
user_id: '99353'
year: '2024'
...
---
_id: '55655'
abstract:
- lang: eng
text: Argumentation is a well-established formalism for nonmonotonic reasoning,
with popular frameworks being Dung’s abstract argumentation (AFs) or logic-based
argumentation (Besnard-Hunter’s framework). Structurally, a set of formulas forms
support for a claim if it is consistent, subset-minimal, and implies the claim.
Then, an argument comprises support and a claim. We observe that the computational
task (ARG) of asking for support of a claim in a knowledge base is “brave”, since
many claims with a single support are accepted. As a result, ARG falls short when
it comes to the question of confidence in a claim, or claim strength. In this
paper, we propose a concept for measuring the (acceptance) strength of claims,
based on counting supports for a claim. Further, we settle classical and structural
complexity of counting arguments favoring a given claim in propositional knowledge
bases (KBs). We introduce quantitative reasoning to measure the strength of claims
in a KB and to determine the relevance strength of a formula for a claim.
author:
- first_name: Markus
full_name: Hecher, Markus
last_name: Hecher
- first_name: Yasir
full_name: Mahmood, Yasir
id: '99353'
last_name: Mahmood
- first_name: Arne
full_name: Meier, Arne
last_name: Meier
- first_name: Johannes
full_name: Schmidt, Johannes
last_name: Schmidt
citation:
ama: 'Hecher M, Mahmood Y, Meier A, Schmidt J. Quantitative Claim-Centric Reasoning
in Logic-Based Argumentation. In: Proceedings of the Thirty-ThirdInternational
Joint Conference on Artificial Intelligence. International Joint Conferences
on Artificial Intelligence Organization; 2024. doi:10.24963/ijcai.2024/377'
apa: Hecher, M., Mahmood, Y., Meier, A., & Schmidt, J. (2024). Quantitative
Claim-Centric Reasoning in Logic-Based Argumentation. Proceedings of the Thirty-ThirdInternational
Joint Conference on Artificial Intelligence. https://doi.org/10.24963/ijcai.2024/377
bibtex: '@inproceedings{Hecher_Mahmood_Meier_Schmidt_2024, title={Quantitative Claim-Centric
Reasoning in Logic-Based Argumentation}, DOI={10.24963/ijcai.2024/377},
booktitle={Proceedings of the Thirty-ThirdInternational Joint Conference on Artificial
Intelligence}, publisher={International Joint Conferences on Artificial Intelligence
Organization}, author={Hecher, Markus and Mahmood, Yasir and Meier, Arne and Schmidt,
Johannes}, year={2024} }'
chicago: Hecher, Markus, Yasir Mahmood, Arne Meier, and Johannes Schmidt. “Quantitative
Claim-Centric Reasoning in Logic-Based Argumentation.” In Proceedings of the
Thirty-ThirdInternational Joint Conference on Artificial Intelligence. International
Joint Conferences on Artificial Intelligence Organization, 2024. https://doi.org/10.24963/ijcai.2024/377.
ieee: 'M. Hecher, Y. Mahmood, A. Meier, and J. Schmidt, “Quantitative Claim-Centric
Reasoning in Logic-Based Argumentation,” 2024, doi: 10.24963/ijcai.2024/377.'
mla: Hecher, Markus, et al. “Quantitative Claim-Centric Reasoning in Logic-Based
Argumentation.” Proceedings of the Thirty-ThirdInternational Joint Conference
on Artificial Intelligence, International Joint Conferences on Artificial
Intelligence Organization, 2024, doi:10.24963/ijcai.2024/377.
short: 'M. Hecher, Y. Mahmood, A. Meier, J. Schmidt, in: Proceedings of the Thirty-ThirdInternational
Joint Conference on Artificial Intelligence, International Joint Conferences on
Artificial Intelligence Organization, 2024.'
date_created: 2024-08-19T16:21:51Z
date_updated: 2025-09-11T10:02:03Z
department:
- _id: '574'
doi: 10.24963/ijcai.2024/377
language:
- iso: eng
project:
- _id: '121'
name: 'TRR 318; TP B01: Ein dialogbasierter Ansatz zur Erklärung von Modellen des
maschinellen Lernens'
publication: Proceedings of the Thirty-ThirdInternational Joint Conference on Artificial
Intelligence
publication_status: published
publisher: International Joint Conferences on Artificial Intelligence Organization
status: public
title: Quantitative Claim-Centric Reasoning in Logic-Based Argumentation
type: conference
user_id: '99353'
year: '2024'
...
---
_id: '57814'
abstract:
- lang: eng
text: "We study consistent query answering via different graph representations.\r\nFirst,
we introduce solution-conflict hypergraphs in which nodes represent\r\nfacts and
edges represent either conflicts or query solutions. Considering a\r\nmonotonic
query and a set of antimonotonic constraints, we present an explicit\r\nalgorithm
for counting the number of repairs satisfying the query based on a\r\ntree decomposition
of the solution-conflict hypergraph. The algorithm not only\r\nprovides fixed-parameter
tractability results for data complexity over\r\nexpressive query and constraint
classes, but also introduces a novel and\r\npotentially implementable approach
to repair counting. Second, we consider the\r\nGaifman graphs arising from MSO
descriptions of consistent query answering.\r\nUsing a generalization of Courcelle's
theorem, we then present fixed-parameter\r\ntractability results for combined
complexity over expressive query and\r\nconstraint classes."
author:
- first_name: Teemu
full_name: Hankala, Teemu
last_name: Hankala
- first_name: Miika
full_name: Hannula, Miika
last_name: Hannula
- first_name: Yasir
full_name: Mahmood, Yasir
id: '99353'
last_name: Mahmood
- first_name: Arne
full_name: Meier, Arne
last_name: Meier
citation:
ama: Hankala T, Hannula M, Mahmood Y, Meier A. Parameterised Complexity of Consistent
Query Answering via Graph Representations. arXiv:241208324. Published
online 2024.
apa: Hankala, T., Hannula, M., Mahmood, Y., & Meier, A. (2024). Parameterised
Complexity of Consistent Query Answering via Graph Representations. In arXiv:2412.08324.
bibtex: '@article{Hankala_Hannula_Mahmood_Meier_2024, title={Parameterised Complexity
of Consistent Query Answering via Graph Representations}, journal={arXiv:2412.08324},
author={Hankala, Teemu and Hannula, Miika and Mahmood, Yasir and Meier, Arne},
year={2024} }'
chicago: Hankala, Teemu, Miika Hannula, Yasir Mahmood, and Arne Meier. “Parameterised
Complexity of Consistent Query Answering via Graph Representations.” ArXiv:2412.08324,
2024.
ieee: T. Hankala, M. Hannula, Y. Mahmood, and A. Meier, “Parameterised Complexity
of Consistent Query Answering via Graph Representations,” arXiv:2412.08324.
2024.
mla: Hankala, Teemu, et al. “Parameterised Complexity of Consistent Query Answering
via Graph Representations.” ArXiv:2412.08324, 2024.
short: T. Hankala, M. Hannula, Y. Mahmood, A. Meier, ArXiv:2412.08324 (2024).
date_created: 2024-12-15T20:12:56Z
date_updated: 2025-09-11T10:01:35Z
department:
- _id: '574'
external_id:
arxiv:
- '2412.08324'
language:
- iso: eng
project:
- _id: '121'
name: 'TRR 318; TP B01: Ein dialogbasierter Ansatz zur Erklärung von Modellen des
maschinellen Lernens'
publication: arXiv:2412.08324
status: public
title: Parameterised Complexity of Consistent Query Answering via Graph Representations
type: preprint
user_id: '99353'
year: '2024'
...
---
_id: '56140'
abstract:
- lang: eng
text: " Android apps collecting data from users must comply with legal frameworks
to ensure data protection. This requirement has become even more important since
the implementation of the General Data Protection Regulation (GDPR) by the European
Union in 2018. Moreover, with the proposed Cyber Resilience Act on the horizon,
stakeholders will soon need to assess software against even more stringent security
and privacy standards. Effective privacy assessments require collaboration among
groups with diverse expertise to function effectively as a cohesive unit.\r\n
\ This paper motivates the need for an automated approach that enhances understanding
of data protection in Android apps and improves communication between the various
parties involved in privacy assessments. We propose the Assessor View, a tool
designed to bridge the knowledge gap between these parties, facilitating more
effective privacy assessments of Android applications. "
author:
- first_name: Mugdha
full_name: Khedkar, Mugdha
id: '88024'
last_name: Khedkar
- first_name: Michael
full_name: Schlichtig, Michael
id: '32312'
last_name: Schlichtig
orcid: 0000-0001-6600-6171
- first_name: Eric
full_name: Bodden, Eric
id: '59256'
last_name: Bodden
orcid: 0000-0003-3470-3647
citation:
ama: 'Khedkar M, Schlichtig M, Bodden E. Advancing Android Privacy Assessments with
Automation. In: In Proceedings of the 39th IEEE/ACM International Conference
on Automated Software Engineering Workshops (ASEW ’24). ; 2024. doi:10.1145/3691621.3694953'
apa: Khedkar, M., Schlichtig, M., & Bodden, E. (2024). Advancing Android Privacy
Assessments with Automation. In Proceedings of the 39th IEEE/ACM International
Conference on Automated Software Engineering Workshops (ASEW ’24). 39th IEEE/ACM
International Conference on Automated Software Engineering (ASE 2024), Sacramento,
California. https://doi.org/10.1145/3691621.3694953
bibtex: '@inproceedings{Khedkar_Schlichtig_Bodden_2024, title={Advancing Android
Privacy Assessments with Automation}, DOI={10.1145/3691621.3694953},
booktitle={In Proceedings of the 39th IEEE/ACM International Conference on Automated
Software Engineering Workshops (ASEW ’24)}, author={Khedkar, Mugdha and Schlichtig,
Michael and Bodden, Eric}, year={2024} }'
chicago: Khedkar, Mugdha, Michael Schlichtig, and Eric Bodden. “Advancing Android
Privacy Assessments with Automation.” In In Proceedings of the 39th IEEE/ACM
International Conference on Automated Software Engineering Workshops (ASEW ’24),
2024. https://doi.org/10.1145/3691621.3694953.
ieee: 'M. Khedkar, M. Schlichtig, and E. Bodden, “Advancing Android Privacy Assessments
with Automation,” presented at the 39th IEEE/ACM International Conference on Automated
Software Engineering (ASE 2024), Sacramento, California, 2024, doi: 10.1145/3691621.3694953.'
mla: Khedkar, Mugdha, et al. “Advancing Android Privacy Assessments with Automation.”
In Proceedings of the 39th IEEE/ACM International Conference on Automated Software
Engineering Workshops (ASEW ’24), 2024, doi:10.1145/3691621.3694953.
short: 'M. Khedkar, M. Schlichtig, E. Bodden, in: In Proceedings of the 39th IEEE/ACM
International Conference on Automated Software Engineering Workshops (ASEW ’24),
2024.'
conference:
end_date: 2024-11-01
location: Sacramento, California
name: 39th IEEE/ACM International Conference on Automated Software Engineering (ASE
2024)
start_date: 2024-10-27
date_created: 2024-09-16T08:55:34Z
date_updated: 2026-03-13T12:12:45Z
ddc:
- '000'
department:
- _id: '76'
doi: 10.1145/3691621.3694953
external_id:
arxiv:
- '2409.06564'
file:
- access_level: closed
content_type: application/pdf
creator: khedkarm
date_created: 2024-09-16T08:55:23Z
date_updated: 2024-09-16T08:55:23Z
file_id: '56141'
file_name: 2409.06564v1.pdf
file_size: 1207856
relation: main_file
success: 1
file_date_updated: 2024-09-16T08:55:23Z
has_accepted_license: '1'
language:
- iso: eng
publication: In Proceedings of the 39th IEEE/ACM International Conference on Automated
Software Engineering Workshops (ASEW ’24)
status: public
title: Advancing Android Privacy Assessments with Automation
type: conference
user_id: '32312'
year: '2024'
...
---
_id: '63658'
author:
- first_name: Simon
full_name: Klüttermann, Simon
last_name: Klüttermann
- first_name: Jérôme
full_name: Rutinowski, Jérôme
last_name: Rutinowski
- first_name: Frederik
full_name: Polachowski, Frederik
last_name: Polachowski
- first_name: Anh
full_name: Nguyen, Anh
last_name: Nguyen
- first_name: Britta
full_name: Grimme, Britta
last_name: Grimme
- first_name: Moritz
full_name: Roidl, Moritz
last_name: Roidl
- first_name: Emmanuel
full_name: Müller, Emmanuel
last_name: Müller
citation:
ama: 'Klüttermann S, Rutinowski J, Polachowski F, et al. On the Effectiveness of
Heterogeneous Ensemble Methods for Re-identification. In: 2024 International
Conference on Machine Learning and Applications (ICMLA). ; 2024:1705–1711.'
apa: Klüttermann, S., Rutinowski, J., Polachowski, F., Nguyen, A., Grimme, B., Roidl,
M., & Müller, E. (2024). On the Effectiveness of Heterogeneous Ensemble Methods
for Re-identification. 2024 International Conference on Machine Learning and
Applications (ICMLA), 1705–1711.
bibtex: '@inproceedings{Klüttermann_Rutinowski_Polachowski_Nguyen_Grimme_Roidl_Müller_2024,
title={On the Effectiveness of Heterogeneous Ensemble Methods for Re-identification},
booktitle={2024 International Conference on Machine Learning and Applications
(ICMLA)}, author={Klüttermann, Simon and Rutinowski, Jérôme and Polachowski, Frederik
and Nguyen, Anh and Grimme, Britta and Roidl, Moritz and Müller, Emmanuel}, year={2024},
pages={1705–1711} }'
chicago: Klüttermann, Simon, Jérôme Rutinowski, Frederik Polachowski, Anh Nguyen,
Britta Grimme, Moritz Roidl, and Emmanuel Müller. “On the Effectiveness of Heterogeneous
Ensemble Methods for Re-Identification.” In 2024 International Conference on
Machine Learning and Applications (ICMLA), 1705–1711, 2024.
ieee: S. Klüttermann et al., “On the Effectiveness of Heterogeneous Ensemble
Methods for Re-identification,” in 2024 International Conference on Machine
Learning and Applications (ICMLA), 2024, pp. 1705–1711.
mla: Klüttermann, Simon, et al. “On the Effectiveness of Heterogeneous Ensemble
Methods for Re-Identification.” 2024 International Conference on Machine Learning
and Applications (ICMLA), 2024, pp. 1705–1711.
short: 'S. Klüttermann, J. Rutinowski, F. Polachowski, A. Nguyen, B. Grimme, M.
Roidl, E. Müller, in: 2024 International Conference on Machine Learning and Applications
(ICMLA), 2024, pp. 1705–1711.'
date_created: 2026-01-19T11:29:47Z
date_updated: 2026-03-19T07:47:29Z
department:
- _id: '819'
language:
- iso: eng
page: 1705–1711
publication: 2024 International Conference on Machine Learning and Applications (ICMLA)
status: public
title: On the Effectiveness of Heterogeneous Ensemble Methods for Re-identification
type: conference
user_id: '103682'
year: '2024'
...
---
_id: '58873'
abstract:
- lang: eng
text: "We prove that the Patterson-Sullivan and Wigner distributions on the unit\r\nsphere
bundle of a convex-cocompact hyperbolic surface are asymptotically\r\nidentical.
This generalizes results in the compact case by\r\nAnantharaman-Zelditch and Hansen-Hilgert-Schr\\\"oder."
author:
- first_name: Benjamin
full_name: Delarue, Benjamin
id: '70575'
last_name: Delarue
- first_name: Guendalina
full_name: Palmirotta, Guendalina
id: '109467'
last_name: Palmirotta
citation:
ama: Delarue B, Palmirotta G. Patterson-Sullivan and Wigner distributions of convex-cocompact
hyperbolic surfaces. arXiv:241119782. Published online 2024.
apa: Delarue, B., & Palmirotta, G. (2024). Patterson-Sullivan and Wigner distributions
of convex-cocompact hyperbolic surfaces. In arXiv:2411.19782.
bibtex: '@article{Delarue_Palmirotta_2024, title={Patterson-Sullivan and Wigner
distributions of convex-cocompact hyperbolic surfaces}, journal={arXiv:2411.19782},
author={Delarue, Benjamin and Palmirotta, Guendalina}, year={2024} }'
chicago: Delarue, Benjamin, and Guendalina Palmirotta. “Patterson-Sullivan and Wigner
Distributions of Convex-Cocompact Hyperbolic Surfaces.” ArXiv:2411.19782,
2024.
ieee: B. Delarue and G. Palmirotta, “Patterson-Sullivan and Wigner distributions
of convex-cocompact hyperbolic surfaces,” arXiv:2411.19782. 2024.
mla: Delarue, Benjamin, and Guendalina Palmirotta. “Patterson-Sullivan and Wigner
Distributions of Convex-Cocompact Hyperbolic Surfaces.” ArXiv:2411.19782,
2024.
short: B. Delarue, G. Palmirotta, ArXiv:2411.19782 (2024).
date_created: 2025-02-28T10:32:30Z
date_updated: 2026-03-30T12:01:12Z
department:
- _id: '548'
external_id:
arxiv:
- '2411.19782'
language:
- iso: eng
project:
- _id: '356'
name: 'TRR 358; TP B02: Spektraltheorie in höherem Rang und unendlichem Volumen'
publication: arXiv:2411.19782
status: public
title: Patterson-Sullivan and Wigner distributions of convex-cocompact hyperbolic
surfaces
type: preprint
user_id: '109467'
year: '2024'
...
---
_id: '52587'
author:
- first_name: Eric
full_name: Bodden, Eric
id: '59256'
last_name: Bodden
orcid: 0000-0003-3470-3647
- first_name: Jens
full_name: Pottebaum, Jens
id: '405'
last_name: Pottebaum
orcid: http://orcid.org/0000-0001-8778-2989
- first_name: Markus
full_name: Fockel, Markus
id: '8472'
last_name: Fockel
orcid: 0000-0002-1269-0702
- first_name: Iris
full_name: Gräßler, Iris
id: '47565'
last_name: Gräßler
orcid: 0000-0001-5765-971X
citation:
ama: Bodden E, Pottebaum J, Fockel M, Gräßler I. Evaluating Security Through Isolation
and Defense in Depth. IEEE Security & Privacy. 2024;22(1):69-72. doi:10.1109/msec.2023.3336028
apa: Bodden, E., Pottebaum, J., Fockel, M., & Gräßler, I. (2024). Evaluating
Security Through Isolation and Defense in Depth. IEEE Security & Privacy,
22(1), 69–72. https://doi.org/10.1109/msec.2023.3336028
bibtex: '@article{Bodden_Pottebaum_Fockel_Gräßler_2024, title={Evaluating Security
Through Isolation and Defense in Depth}, volume={22}, DOI={10.1109/msec.2023.3336028},
number={1}, journal={IEEE Security & Privacy}, publisher={Institute of Electrical
and Electronics Engineers (IEEE)}, author={Bodden, Eric and Pottebaum, Jens and
Fockel, Markus and Gräßler, Iris}, year={2024}, pages={69–72} }'
chicago: 'Bodden, Eric, Jens Pottebaum, Markus Fockel, and Iris Gräßler. “Evaluating
Security Through Isolation and Defense in Depth.” IEEE Security & Privacy
22, no. 1 (2024): 69–72. https://doi.org/10.1109/msec.2023.3336028.'
ieee: 'E. Bodden, J. Pottebaum, M. Fockel, and I. Gräßler, “Evaluating Security
Through Isolation and Defense in Depth,” IEEE Security & Privacy, vol.
22, no. 1, pp. 69–72, 2024, doi: 10.1109/msec.2023.3336028.'
mla: Bodden, Eric, et al. “Evaluating Security Through Isolation and Defense in
Depth.” IEEE Security & Privacy, vol. 22, no. 1, Institute of Electrical
and Electronics Engineers (IEEE), 2024, pp. 69–72, doi:10.1109/msec.2023.3336028.
short: E. Bodden, J. Pottebaum, M. Fockel, I. Gräßler, IEEE Security & Privacy
22 (2024) 69–72.
date_created: 2024-03-15T20:16:18Z
date_updated: 2026-03-31T02:19:49Z
department:
- _id: '152'
- _id: '76'
- _id: '662'
doi: 10.1109/msec.2023.3336028
intvolume: ' 22'
issue: '1'
keyword:
- Law
- Electrical and Electronic Engineering
- Computer Networks and Communications
language:
- iso: eng
main_file_link:
- url: https://ieeexplore.ieee.org/document/10411721
page: 69-72
publication: IEEE Security & Privacy
publication_identifier:
issn:
- 1540-7993
- 1558-4046
publication_status: published
publisher: Institute of Electrical and Electronics Engineers (IEEE)
quality_controlled: '1'
status: public
title: Evaluating Security Through Isolation and Defense in Depth
type: journal_article
user_id: '405'
volume: 22
year: '2024'
...
---
_id: '57154'
author:
- first_name: Henry
full_name: Asiimwe, Henry
last_name: Asiimwe
- first_name: Henrik
full_name: Bode, Henrik
id: '40880'
last_name: Bode
- first_name: Paul
full_name: Bogere, Paul
id: '88496'
last_name: Bogere
orcid: 0000-0002-7159-5916
- first_name: Christine
full_name: Freitag, Christine
id: '20560'
last_name: Freitag
- first_name: Teddy
full_name: Mangeni, Teddy
last_name: Mangeni
citation:
ama: 'Asiimwe H, Bode H, Bogere P, Freitag C, Mangeni T. Which Media for Whom? The
Implementation of Microgrids as a Trigger of Transformational Adult Learning Opportunities
in Formal, Informal and Situational Settings in Times of Change. In: Andrzejewska
E, Matthes E, Schütze S, Van Wiele J, eds. Bildungsmedien Für Erwachsene Educational
Media for Adults . Verlag Julius Klinkhardt; 2024:245–255. doi:10.35468/6126'
apa: Asiimwe, H., Bode, H., Bogere, P., Freitag, C., & Mangeni, T. (2024). Which
Media for Whom? The Implementation of Microgrids as a Trigger of Transformational
Adult Learning Opportunities in Formal, Informal and Situational Settings in Times
of Change. In E. Andrzejewska, E. Matthes, S. Schütze, & J. Van Wiele (Eds.),
Bildungsmedien für Erwachsene Educational Media for Adults (pp. 245–255).
Verlag Julius Klinkhardt. https://doi.org/10.35468/6126
bibtex: '@inbook{Asiimwe_Bode_Bogere_Freitag_Mangeni_2024, title={Which Media for
Whom? The Implementation of Microgrids as a Trigger of Transformational Adult
Learning Opportunities in Formal, Informal and Situational Settings in Times of
Change}, DOI={10.35468/6126}, booktitle={Bildungsmedien
für Erwachsene Educational Media for Adults }, publisher={Verlag Julius Klinkhardt},
author={Asiimwe, Henry and Bode, Henrik and Bogere, Paul and Freitag, Christine
and Mangeni, Teddy}, editor={Andrzejewska, Ewa and Matthes, Eva and Schütze, Sylvia
and Van Wiele, Jan}, year={2024}, pages={245–255} }'
chicago: Asiimwe, Henry, Henrik Bode, Paul Bogere, Christine Freitag, and Teddy
Mangeni. “Which Media for Whom? The Implementation of Microgrids as a Trigger
of Transformational Adult Learning Opportunities in Formal, Informal and Situational
Settings in Times of Change.” In Bildungsmedien Für Erwachsene Educational
Media for Adults , edited by Ewa Andrzejewska, Eva Matthes, Sylvia Schütze,
and Jan Van Wiele, 245–255. Verlag Julius Klinkhardt, 2024. https://doi.org/10.35468/6126.
ieee: H. Asiimwe, H. Bode, P. Bogere, C. Freitag, and T. Mangeni, “Which Media for
Whom? The Implementation of Microgrids as a Trigger of Transformational Adult
Learning Opportunities in Formal, Informal and Situational Settings in Times of
Change,” in Bildungsmedien für Erwachsene Educational Media for Adults ,
E. Andrzejewska, E. Matthes, S. Schütze, and J. Van Wiele, Eds. Verlag Julius
Klinkhardt, 2024, pp. 245–255.
mla: Asiimwe, Henry, et al. “Which Media for Whom? The Implementation of Microgrids
as a Trigger of Transformational Adult Learning Opportunities in Formal, Informal
and Situational Settings in Times of Change.” Bildungsmedien Für Erwachsene
Educational Media for Adults , edited by Ewa Andrzejewska et al., Verlag Julius
Klinkhardt, 2024, pp. 245–255, doi:10.35468/6126.
short: 'H. Asiimwe, H. Bode, P. Bogere, C. Freitag, T. Mangeni, in: E. Andrzejewska,
E. Matthes, S. Schütze, J. Van Wiele (Eds.), Bildungsmedien Für Erwachsene Educational
Media for Adults , Verlag Julius Klinkhardt, 2024, pp. 245–255.'
date_created: 2024-11-18T07:41:43Z
date_updated: 2026-04-24T09:08:34Z
department:
- _id: '300'
doi: 10.35468/6126
editor:
- first_name: Ewa
full_name: Andrzejewska, Ewa
last_name: Andrzejewska
- first_name: Eva
full_name: Matthes, Eva
last_name: Matthes
- first_name: Sylvia
full_name: Schütze, Sylvia
last_name: Schütze
- first_name: Jan
full_name: Van Wiele, Jan
last_name: Van Wiele
language:
- iso: eng
page: 245–255
publication: 'Bildungsmedien für Erwachsene Educational Media for Adults '
publication_identifier:
isbn:
- 978-3-7815-2670-9
publisher: Verlag Julius Klinkhardt
status: public
title: Which Media for Whom? The Implementation of Microgrids as a Trigger of Transformational
Adult Learning Opportunities in Formal, Informal and Situational Settings in Times
of Change
type: book_chapter
user_id: '10831'
year: '2024'
...
---
_id: '56481'
author:
- first_name: Christoph
full_name: Berganski, Christoph
id: '98854'
last_name: Berganski
- first_name: Felix
full_name: Jentzsch, Felix
id: '55631'
last_name: Jentzsch
orcid: 0000-0003-4987-5708
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
- first_name: Max
full_name: Kuhmichel, Max
last_name: Kuhmichel
- first_name: Heiner
full_name: Giefers, Heiner
last_name: Giefers
citation:
ama: 'Berganski C, Jentzsch F, Platzner M, Kuhmichel M, Giefers H. FINN-T: Compiling
Custom Dataflow Accelerators for Quantized Transformers. In: ; 2024.'
apa: 'Berganski, C., Jentzsch, F., Platzner, M., Kuhmichel, M., & Giefers, H.
(2024). FINN-T: Compiling Custom Dataflow Accelerators for Quantized Transformers.
International Conference on Field Programmable Technology, Sydney.'
bibtex: '@inproceedings{Berganski_Jentzsch_Platzner_Kuhmichel_Giefers_2024, title={FINN-T:
Compiling Custom Dataflow Accelerators for Quantized Transformers}, author={Berganski,
Christoph and Jentzsch, Felix and Platzner, Marco and Kuhmichel, Max and Giefers,
Heiner}, year={2024} }'
chicago: 'Berganski, Christoph, Felix Jentzsch, Marco Platzner, Max Kuhmichel, and
Heiner Giefers. “FINN-T: Compiling Custom Dataflow Accelerators for Quantized
Transformers,” 2024.'
ieee: 'C. Berganski, F. Jentzsch, M. Platzner, M. Kuhmichel, and H. Giefers, “FINN-T:
Compiling Custom Dataflow Accelerators for Quantized Transformers,” presented
at the International Conference on Field Programmable Technology, Sydney, 2024.'
mla: 'Berganski, Christoph, et al. FINN-T: Compiling Custom Dataflow Accelerators
for Quantized Transformers. 2024.'
short: 'C. Berganski, F. Jentzsch, M. Platzner, M. Kuhmichel, H. Giefers, in: 2024.'
conference:
end_date: 2024-12-12
location: Sydney
name: International Conference on Field Programmable Technology
start_date: 2024-12-10
date_created: 2024-10-10T07:49:13Z
date_updated: 2026-04-27T14:14:40Z
department:
- _id: '78'
language:
- iso: eng
project:
- _id: '52'
name: Computing Resources Provided by the Paderborn Center for Parallel Computing
status: public
title: 'FINN-T: Compiling Custom Dataflow Accelerators for Quantized Transformers'
type: conference
user_id: '55631'
year: '2024'
...
---
_id: '54245'
author:
- first_name: Luca-Sebastian
full_name: Henke, Luca-Sebastian
last_name: Henke
citation:
ama: Henke L-S. Exploring Custom FPGA Accelerators for DNN-Based RF Fingerprinting.;
2024.
apa: Henke, L.-S. (2024). Exploring Custom FPGA Accelerators for DNN-based RF
Fingerprinting.
bibtex: '@book{Henke_2024, title={Exploring Custom FPGA Accelerators for DNN-based
RF Fingerprinting}, author={Henke, Luca-Sebastian}, year={2024} }'
chicago: Henke, Luca-Sebastian. Exploring Custom FPGA Accelerators for DNN-Based
RF Fingerprinting, 2024.
ieee: L.-S. Henke, Exploring Custom FPGA Accelerators for DNN-based RF Fingerprinting.
2024.
mla: Henke, Luca-Sebastian. Exploring Custom FPGA Accelerators for DNN-Based
RF Fingerprinting. 2024.
short: L.-S. Henke, Exploring Custom FPGA Accelerators for DNN-Based RF Fingerprinting,
2024.
date_created: 2024-05-13T14:00:01Z
date_updated: 2026-04-27T14:20:23Z
department:
- _id: '78'
language:
- iso: eng
project:
- _id: '52'
name: Computing Resources Provided by the Paderborn Center for Parallel Computing
status: public
supervisor:
- first_name: Felix
full_name: Jentzsch, Felix
id: '55631'
last_name: Jentzsch
orcid: 0000-0003-4987-5708
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
title: Exploring Custom FPGA Accelerators for DNN-based RF Fingerprinting
type: mastersthesis
user_id: '55631'
year: '2024'
...
---
_id: '62047'
author:
- first_name: Eileen
full_name: Reckmann, Eileen
id: '101166'
last_name: Reckmann
- first_name: Katrin
full_name: Temmen, Katrin
id: '30086'
last_name: Temmen
citation:
ama: 'Reckmann E, Temmen K. Erste Ergebnisse aus einer Interviewstudie mit Workshop-Moderierenden
mobiler Schülerlaborangebote an außerschulischen Lernorten. In: ; 2024.'
apa: Reckmann, E., & Temmen, K. (2024). Erste Ergebnisse aus einer Interviewstudie
mit Workshop-Moderierenden mobiler Schülerlaborangebote an außerschulischen Lernorten.
GDSU-Jahrestagung, Hannover.
bibtex: '@inproceedings{Reckmann_Temmen_2024, title={Erste Ergebnisse aus einer
Interviewstudie mit Workshop-Moderierenden mobiler Schülerlaborangebote an außerschulischen
Lernorten}, author={Reckmann, Eileen and Temmen, Katrin}, year={2024} }'
chicago: Reckmann, Eileen, and Katrin Temmen. “Erste Ergebnisse aus einer Interviewstudie
mit Workshop-Moderierenden mobiler Schülerlaborangebote an außerschulischen Lernorten,”
2024.
ieee: E. Reckmann and K. Temmen, “Erste Ergebnisse aus einer Interviewstudie mit
Workshop-Moderierenden mobiler Schülerlaborangebote an außerschulischen Lernorten,”
presented at the GDSU-Jahrestagung, Hannover, 2024.
mla: Reckmann, Eileen, and Katrin Temmen. Erste Ergebnisse aus einer Interviewstudie
mit Workshop-Moderierenden mobiler Schülerlaborangebote an außerschulischen Lernorten.
2024.
short: 'E. Reckmann, K. Temmen, in: 2024.'
conference:
end_date: 2024-03-09
location: Hannover
name: GDSU-Jahrestagung
start_date: 2024-03-07
date_created: 2025-11-03T10:12:06Z
date_updated: 2026-04-30T10:41:25Z
department:
- _id: '300'
language:
- iso: ger
status: public
title: Erste Ergebnisse aus einer Interviewstudie mit Workshop-Moderierenden mobiler
Schülerlaborangebote an außerschulischen Lernorten
type: conference_abstract
user_id: '101166'
year: '2024'
...
---
_id: '50273'
abstract:
- lang: eng
text: "The Polynomial-Time Hierarchy ($\\mathsf{PH}$) is a staple of classical\r\ncomplexity
theory, with applications spanning randomized computation to circuit\r\nlower
bounds to ''quantum advantage'' analyses for near-term quantum computers.\r\nQuantumly,
however, despite the fact that at least \\emph{four} definitions of\r\nquantum
$\\mathsf{PH}$ exist, it has been challenging to prove analogues for\r\nthese
of even basic facts from $\\mathsf{PH}$. This work studies three\r\nquantum-verifier
based generalizations of $\\mathsf{PH}$, two of which are from\r\n[Gharibian,
Santha, Sikora, Sundaram, Yirka, 2022] and use classical strings\r\n($\\mathsf{QCPH}$)
and quantum mixed states ($\\mathsf{QPH}$) as proofs, and one\r\nof which is new
to this work, utilizing quantum pure states\r\n($\\mathsf{pureQPH}$) as proofs.
We first resolve several open problems from\r\n[GSSSY22], including a collapse
theorem and a Karp-Lipton theorem for\r\n$\\mathsf{QCPH}$. Then, for our new class
$\\mathsf{pureQPH}$, we show one-sided\r\nerror reduction for $\\mathsf{pureQPH}$,
as well as the first bounds relating\r\nthese quantum variants of $\\mathsf{PH}$,
namely $\\mathsf{QCPH}\\subseteq\r\n\\mathsf{pureQPH} \\subseteq \\mathsf{EXP}^{\\mathsf{PP}}$."
author:
- first_name: Avantika
full_name: Agarwal, Avantika
last_name: Agarwal
- first_name: Sevag
full_name: Gharibian, Sevag
id: '71541'
last_name: Gharibian
orcid: 0000-0002-9992-3379
- first_name: Venkata
full_name: Koppula, Venkata
last_name: Koppula
- first_name: Dorian
full_name: Rudolph, Dorian
id: '57863'
last_name: Rudolph
citation:
ama: 'Agarwal A, Gharibian S, Koppula V, Rudolph D. Quantum Polynomial Hierarchies:
Karp-Lipton, error reduction, and lower bounds. In: Proceedings of 49th International
Symposium on Mathematical Foundations of Computer Science (MFCS). Vol 306.
; 2024:7-17. doi:10.4230/LIPIcs.MFCS.2024.7'
apa: 'Agarwal, A., Gharibian, S., Koppula, V., & Rudolph, D. (2024). Quantum
Polynomial Hierarchies: Karp-Lipton, error reduction, and lower bounds. Proceedings
of 49th International Symposium on Mathematical Foundations of Computer Science
(MFCS), 306(7), 7–17. https://doi.org/10.4230/LIPIcs.MFCS.2024.7'
bibtex: '@inproceedings{Agarwal_Gharibian_Koppula_Rudolph_2024, title={Quantum Polynomial
Hierarchies: Karp-Lipton, error reduction, and lower bounds}, volume={306}, DOI={10.4230/LIPIcs.MFCS.2024.7},
number={7}, booktitle={Proceedings of 49th International Symposium on Mathematical
Foundations of Computer Science (MFCS)}, author={Agarwal, Avantika and Gharibian,
Sevag and Koppula, Venkata and Rudolph, Dorian}, year={2024}, pages={7–17} }'
chicago: 'Agarwal, Avantika, Sevag Gharibian, Venkata Koppula, and Dorian Rudolph.
“Quantum Polynomial Hierarchies: Karp-Lipton, Error Reduction, and Lower Bounds.”
In Proceedings of 49th International Symposium on Mathematical Foundations
of Computer Science (MFCS), 306:7–17, 2024. https://doi.org/10.4230/LIPIcs.MFCS.2024.7.'
ieee: 'A. Agarwal, S. Gharibian, V. Koppula, and D. Rudolph, “Quantum Polynomial
Hierarchies: Karp-Lipton, error reduction, and lower bounds,” in Proceedings
of 49th International Symposium on Mathematical Foundations of Computer Science
(MFCS), 2024, vol. 306, no. 7, pp. 7–17, doi: 10.4230/LIPIcs.MFCS.2024.7.'
mla: 'Agarwal, Avantika, et al. “Quantum Polynomial Hierarchies: Karp-Lipton, Error
Reduction, and Lower Bounds.” Proceedings of 49th International Symposium
on Mathematical Foundations of Computer Science (MFCS), vol. 306, no. 7, 2024,
pp. 7–17, doi:10.4230/LIPIcs.MFCS.2024.7.'
short: 'A. Agarwal, S. Gharibian, V. Koppula, D. Rudolph, in: Proceedings of 49th
International Symposium on Mathematical Foundations of Computer Science (MFCS),
2024, pp. 7–17.'
date_created: 2024-01-07T20:09:32Z
date_updated: 2026-05-15T08:39:23Z
department:
- _id: '7'
- _id: '623'
doi: 10.4230/LIPIcs.MFCS.2024.7
external_id:
arxiv:
- '2401.01633'
intvolume: ' 306'
issue: '7'
language:
- iso: eng
page: 7-17
publication: Proceedings of 49th International Symposium on Mathematical Foundations
of Computer Science (MFCS)
publication_status: published
status: public
title: 'Quantum Polynomial Hierarchies: Karp-Lipton, error reduction, and lower bounds'
type: conference
user_id: '71541'
volume: 306
year: '2024'
...
---
_id: '50406'
abstract:
- lang: eng
text: "What is the power of polynomial-time quantum computation with access to an
NP\r\noracle? In this work, we focus on two fundamental tasks from the study of\r\nBoolean
satisfiability (SAT) problems: search-to-decision reductions, and\r\napproximate
counting. We first show that, in strong contrast to the classical\r\nsetting where
a poly-time Turing machine requires $\\Theta(n)$ queries to an NP\r\noracle to
compute a witness to a given SAT formula, quantumly $\\Theta(\\log n)$\r\nqueries
suffice. We then show this is tight in the black-box model - any\r\nquantum algorithm
with \"NP-like\" query access to a formula requires\r\n$\\Omega(\\log n)$ queries
to extract a solution with constant probability.\r\nMoving to approximate counting
of SAT solutions, by exploiting a quantum link\r\nbetween search-to-decision reductions
and approximate counting, we show that\r\nexisting classical approximate counting
algorithms are likely optimal. First,\r\nwe give a lower bound in the \"NP-like\"
black-box query setting: Approximate\r\ncounting requires $\\Omega(\\log n)$ queries,
even on a quantum computer. We then\r\ngive a \"white-box\" lower bound (i.e.
where the input formula is not hidden in\r\nthe oracle) - if there exists a randomized
poly-time classical or quantum\r\nalgorithm for approximate counting making $o(log
n)$ NP queries, then\r\n$\\text{BPP}^{\\text{NP}[o(n)]}$ contains a $\\text{P}^{\\text{NP}}$-complete\r\nproblem
if the algorithm is classical and $\\text{FBQP}^{\\text{NP}[o(n)]}$\r\ncontains
an $\\text{FP}^{\\text{NP}}$-complete problem if the algorithm is\r\nquantum."
author:
- first_name: Sevag
full_name: Gharibian, Sevag
id: '71541'
last_name: Gharibian
orcid: 0000-0002-9992-3379
- first_name: Jonas
full_name: Kamminga, Jonas
last_name: Kamminga
citation:
ama: 'Gharibian S, Kamminga J. BQP, meet NP: Search-to-decision reductions and approximate
counting. In: Proceedings of 51st EATCS International Colloquium on Automata,
Languages and Programming (ICALP). Vol 297. ; 2024:1-19.'
apa: 'Gharibian, S., & Kamminga, J. (2024). BQP, meet NP: Search-to-decision
reductions and approximate counting. Proceedings of 51st EATCS International
Colloquium on Automata, Languages and Programming (ICALP), 297(70),
1–19.'
bibtex: '@inproceedings{Gharibian_Kamminga_2024, title={BQP, meet NP: Search-to-decision
reductions and approximate counting}, volume={297}, number={70}, booktitle={Proceedings
of 51st EATCS International Colloquium on Automata, Languages and Programming
(ICALP)}, author={Gharibian, Sevag and Kamminga, Jonas}, year={2024}, pages={1–19}
}'
chicago: 'Gharibian, Sevag, and Jonas Kamminga. “BQP, Meet NP: Search-to-Decision
Reductions and Approximate Counting.” In Proceedings of 51st EATCS International
Colloquium on Automata, Languages and Programming (ICALP), 297:1–19, 2024.'
ieee: 'S. Gharibian and J. Kamminga, “BQP, meet NP: Search-to-decision reductions
and approximate counting,” in Proceedings of 51st EATCS International Colloquium
on Automata, Languages and Programming (ICALP), 2024, vol. 297, no. 70, pp.
1–19.'
mla: 'Gharibian, Sevag, and Jonas Kamminga. “BQP, Meet NP: Search-to-Decision Reductions
and Approximate Counting.” Proceedings of 51st EATCS International Colloquium
on Automata, Languages and Programming (ICALP), vol. 297, no. 70, 2024, pp.
1–19.'
short: 'S. Gharibian, J. Kamminga, in: Proceedings of 51st EATCS International Colloquium
on Automata, Languages and Programming (ICALP), 2024, pp. 1–19.'
date_created: 2024-01-09T13:59:44Z
date_updated: 2026-05-15T08:41:59Z
department:
- _id: '7'
- _id: '623'
external_id:
arxiv:
- '2401.03943'
intvolume: ' 297'
issue: '70'
language:
- iso: eng
page: 1-19
publication: Proceedings of 51st EATCS International Colloquium on Automata, Languages
and Programming (ICALP)
publication_status: published
status: public
title: 'BQP, meet NP: Search-to-decision reductions and approximate counting'
type: conference
user_id: '71541'
volume: 297
year: '2024'
...