---
_id: '32338'
author:
- first_name: K.
full_name: Hähn, K.
last_name: Hähn
- first_name: Uta
full_name: Häsel-Weide, Uta
id: '60267'
last_name: Häsel-Weide
- first_name: P.
full_name: Scherer, P.
last_name: Scherer
citation:
ama: Hähn K, Häsel-Weide U, Scherer P. Diagnosegeleitete Förderung im inklusiven
Mathematikunterricht der Grundschule – Professionalisierung durch reflektierte
Handlungspraxis in der Lehrer*innenbildung. QfI - Qualifizierung für Inklusion.
2022;3(2).
apa: Hähn, K., Häsel-Weide, U., & Scherer, P. (2022). Diagnosegeleitete Förderung
im inklusiven Mathematikunterricht der Grundschule – Professionalisierung durch
reflektierte Handlungspraxis in der Lehrer*innenbildung. QfI - Qualifizierung
für Inklusion, 3(2).
bibtex: '@article{Hähn_Häsel-Weide_Scherer_2022, title={Diagnosegeleitete Förderung
im inklusiven Mathematikunterricht der Grundschule – Professionalisierung durch
reflektierte Handlungspraxis in der Lehrer*innenbildung.}, volume={3}, number={2},
journal={QfI - Qualifizierung für Inklusion}, author={Hähn, K. and Häsel-Weide,
Uta and Scherer, P.}, year={2022} }'
chicago: Hähn, K., Uta Häsel-Weide, and P. Scherer. “Diagnosegeleitete Förderung
im inklusiven Mathematikunterricht der Grundschule – Professionalisierung durch
reflektierte Handlungspraxis in der Lehrer*innenbildung.” QfI - Qualifizierung
für Inklusion 3, no. 2 (2022).
ieee: K. Hähn, U. Häsel-Weide, and P. Scherer, “Diagnosegeleitete Förderung im inklusiven
Mathematikunterricht der Grundschule – Professionalisierung durch reflektierte
Handlungspraxis in der Lehrer*innenbildung.,” QfI - Qualifizierung für Inklusion,
vol. 3, no. 2, 2022.
mla: Hähn, K., et al. “Diagnosegeleitete Förderung im inklusiven Mathematikunterricht
der Grundschule – Professionalisierung durch reflektierte Handlungspraxis in der
Lehrer*innenbildung.” QfI - Qualifizierung für Inklusion, vol. 3, no. 2,
2022.
short: K. Hähn, U. Häsel-Weide, P. Scherer, QfI - Qualifizierung für Inklusion 3
(2022).
date_created: 2022-07-11T05:13:52Z
date_updated: 2022-07-11T05:31:41Z
department:
- _id: '98'
- _id: '543'
intvolume: ' 3'
issue: '2'
language:
- iso: ger
publication: QfI - Qualifizierung für Inklusion
publication_status: published
related_material:
link:
- relation: contains
url: https://doi.org/10.21248/qfi.72
status: public
title: Diagnosegeleitete Förderung im inklusiven Mathematikunterricht der Grundschule
– Professionalisierung durch reflektierte Handlungspraxis in der Lehrer*innenbildung.
type: journal_article
user_id: '85821'
volume: 3
year: '2022'
...
---
_id: '32333'
abstract:
- lang: eng
text: This paper provides a hybrid energy system model created in Matlab/Simulink
which is based on photovoltaics as its main energy source. The model includes
a hybrid energy storage which consists of a short-term lithium-ion battery and
hydrogen as long-term storage to ensure autonomy even during periods of low PV
production (e.g., in winter). The sectors heat and electricity are coupled by
using the waste-heat generated by production and reconversion of hydrogen through
an electrolyser respectively a fuel cell. A heat pump has been considered to cover
the residual heat demand (for well insulated homes). Within this paper a model
of the space heating system as well as the hot water heating system is presented.
The model is designed for the simulation and analysis of a whole year energy flow
by using a time series of loads, weather and heat profiles as input. Moreover,
results of the energy balance within the energy system by simulation of a complete
year by varying the orientation (elevation and azimuth) of the PV system and the
component sizing, such as the lithium-ion battery capacity, are presented. It
turned out that a high amount of heating energy can be saved by using the waste
heat generated by the electrolyser and the fuel cell. The model is well suited
for the analysis of the effects of different component dimensionings in a hydrogen-based
energy system via the overall energy balance within the residential sector.
author:
- first_name: Marius Claus
full_name: Möller, Marius Claus
id: '72391'
last_name: Möller
- first_name: Stefan
full_name: Krauter, Stefan
id: '28836'
last_name: Krauter
orcid: 0000-0002-3594-260X
citation:
ama: 'Möller MC, Krauter S. Model of a Self-Sufficient PV Home using a Hybrid Storage
System based on Li-Ion Batteries and Hydrogen Storage with Waste Heat Utilization
. In: IEEE, ed. Proceedings of the 49th IEEE Photovoltaic Specialists Conference.
; 2022.'
apa: Möller, M. C., & Krauter, S. (2022). Model of a Self-Sufficient PV Home
using a Hybrid Storage System based on Li-Ion Batteries and Hydrogen Storage with
Waste Heat Utilization . In IEEE (Ed.), Proceedings of the 49th IEEE Photovoltaic
Specialists Conference.
bibtex: '@inproceedings{Möller_Krauter_2022, title={Model of a Self-Sufficient PV
Home using a Hybrid Storage System based on Li-Ion Batteries and Hydrogen Storage
with Waste Heat Utilization }, booktitle={Proceedings of the 49th IEEE Photovoltaic
Specialists Conference}, author={Möller, Marius Claus and Krauter, Stefan}, editor={IEEE},
year={2022} }'
chicago: Möller, Marius Claus, and Stefan Krauter. “Model of a Self-Sufficient PV
Home Using a Hybrid Storage System Based on Li-Ion Batteries and Hydrogen Storage
with Waste Heat Utilization .” In Proceedings of the 49th IEEE Photovoltaic
Specialists Conference, edited by IEEE, 2022.
ieee: M. C. Möller and S. Krauter, “Model of a Self-Sufficient PV Home using a Hybrid
Storage System based on Li-Ion Batteries and Hydrogen Storage with Waste Heat
Utilization ,” in Proceedings of the 49th IEEE Photovoltaic Specialists Conference,
Philadelphia, PA, USA, 2022.
mla: Möller, Marius Claus, and Stefan Krauter. “Model of a Self-Sufficient PV Home
Using a Hybrid Storage System Based on Li-Ion Batteries and Hydrogen Storage with
Waste Heat Utilization .” Proceedings of the 49th IEEE Photovoltaic Specialists
Conference, edited by IEEE, 2022.
short: 'M.C. Möller, S. Krauter, in: IEEE (Ed.), Proceedings of the 49th IEEE Photovoltaic
Specialists Conference, 2022.'
conference:
end_date: 2022-06-10
location: Philadelphia, PA, USA
name: 49th IEEE Photovoltaic Specialists Conference
start_date: 2022-06-05
corporate_editor:
- IEEE
date_created: 2022-07-08T07:49:53Z
date_updated: 2022-07-11T06:59:25Z
department:
- _id: '53'
language:
- iso: eng
publication: Proceedings of the 49th IEEE Photovoltaic Specialists Conference
status: public
title: 'Model of a Self-Sufficient PV Home using a Hybrid Storage System based on
Li-Ion Batteries and Hydrogen Storage with Waste Heat Utilization '
type: conference
user_id: '16148'
year: '2022'
...
---
_id: '30262'
abstract:
- lang: eng
text: In this paper, a model of a hybrid, hydrogen-based energy system for a household
which includes the heating sector is presended. With such an energy system it's
possible to enable energy autarky over a whole year based on solar energy. The
scope of this study was to present a verified hybrid energy system model created
in Simulink which can be used to prospectively size future similar energy systems
where hydrogen in combination with a li-ion battery shall be used as energy storage
type.
author:
- first_name: Marius Claus
full_name: Möller, Marius Claus
id: '72391'
last_name: Möller
- first_name: Stefan
full_name: Krauter, Stefan
id: '28836'
last_name: Krauter
orcid: 0000-0002-3594-260X
citation:
ama: Möller MC, Krauter S. Hybrid Energy System Model in Matlab/Simulink based on
Solar Energy, Lithium-Ion Battery and Hydrogen. Energies / Special Issue “Sustainable
Energy Concepts for Energy Transition.” 2022;15 (6), 2201. doi:10.3390/en15062201
apa: Möller, M. C., & Krauter, S. (2022). Hybrid Energy System Model in Matlab/Simulink
based on Solar Energy, Lithium-Ion Battery and Hydrogen. Energies / Special
Issue “Sustainable Energy Concepts for Energy Transition,” 15 (6), 2201.
https://doi.org/10.3390/en15062201
bibtex: '@article{Möller_Krauter_2022, title={Hybrid Energy System Model in Matlab/Simulink
based on Solar Energy, Lithium-Ion Battery and Hydrogen}, volume={15 (6), 2201},
DOI={10.3390/en15062201}, journal={Energies
/ Special Issue “Sustainable Energy Concepts for Energy Transition”}, publisher={MDPI
/ Basel, Switzerland}, author={Möller, Marius Claus and Krauter, Stefan}, year={2022}
}'
chicago: Möller, Marius Claus, and Stefan Krauter. “Hybrid Energy System Model in
Matlab/Simulink Based on Solar Energy, Lithium-Ion Battery and Hydrogen.” Energies
/ Special Issue “Sustainable Energy Concepts for Energy Transition” 15 (6),
2201 (2022). https://doi.org/10.3390/en15062201.
ieee: 'M. C. Möller and S. Krauter, “Hybrid Energy System Model in Matlab/Simulink
based on Solar Energy, Lithium-Ion Battery and Hydrogen,” Energies / Special
Issue “Sustainable Energy Concepts for Energy Transition,” vol. 15 (6), 2201,
2022, doi: 10.3390/en15062201.'
mla: Möller, Marius Claus, and Stefan Krauter. “Hybrid Energy System Model in Matlab/Simulink
Based on Solar Energy, Lithium-Ion Battery and Hydrogen.” Energies / Special
Issue “Sustainable Energy Concepts for Energy Transition,” vol. 15 (6), 2201,
MDPI / Basel, Switzerland, 2022, doi:10.3390/en15062201.
short: M.C. Möller, S. Krauter, Energies / Special Issue “Sustainable Energy Concepts
for Energy Transition” 15 (6), 2201 (2022).
date_created: 2022-03-11T09:56:32Z
date_updated: 2022-07-11T07:03:34Z
department:
- _id: '53'
doi: 10.3390/en15062201
language:
- iso: eng
publication: Energies / Special Issue "Sustainable Energy Concepts for Energy Transition"
publication_identifier:
issn:
- 1996-1073
publication_status: published
publisher: MDPI / Basel, Switzerland
quality_controlled: '1'
status: public
title: Hybrid Energy System Model in Matlab/Simulink based on Solar Energy, Lithium-Ion
Battery and Hydrogen
type: journal_article
user_id: '16148'
volume: 15 (6), 2201
year: '2022'
...
---
_id: '29673'
abstract:
- lang: eng
text: Koopman operator theory has been successfully applied to problems from various
research areas such as fluid dynamics, molecular dynamics, climate science, engineering,
and biology. Applications include detecting metastable or coherent sets, coarse-graining,
system identification, and control. There is an intricate connection between dynamical
systems driven by stochastic differential equations and quantum mechanics. In
this paper, we compare the ground-state transformation and Nelson's stochastic
mechanics and demonstrate how data-driven methods developed for the approximation
of the Koopman operator can be used to analyze quantum physics problems. Moreover,
we exploit the relationship between Schrödinger operators and stochastic control
problems to show that modern data-driven methods for stochastic control can be
used to solve the stationary or imaginary-time Schrödinger equation. Our findings
open up a new avenue towards solving Schrödinger's equation using recently developed
tools from data science.
author:
- first_name: Stefan
full_name: Klus, Stefan
last_name: Klus
- first_name: Feliks
full_name: Nüske, Feliks
id: '81513'
last_name: Nüske
orcid: 0000-0003-2444-7889
- first_name: Sebastian
full_name: Peitz, Sebastian
id: '47427'
last_name: Peitz
orcid: 0000-0002-3389-793X
citation:
ama: 'Klus S, Nüske F, Peitz S. Koopman analysis of quantum systems. Journal
of Physics A: Mathematical and Theoretical. 2022;55(31):314002. doi:10.1088/1751-8121/ac7d22'
apa: 'Klus, S., Nüske, F., & Peitz, S. (2022). Koopman analysis of quantum systems.
Journal of Physics A: Mathematical and Theoretical, 55(31), 314002.
https://doi.org/10.1088/1751-8121/ac7d22'
bibtex: '@article{Klus_Nüske_Peitz_2022, title={Koopman analysis of quantum systems},
volume={55}, DOI={10.1088/1751-8121/ac7d22},
number={31}, journal={Journal of Physics A: Mathematical and Theoretical}, publisher={IOP
Publishing Ltd.}, author={Klus, Stefan and Nüske, Feliks and Peitz, Sebastian},
year={2022}, pages={314002} }'
chicago: 'Klus, Stefan, Feliks Nüske, and Sebastian Peitz. “Koopman Analysis of
Quantum Systems.” Journal of Physics A: Mathematical and Theoretical 55,
no. 31 (2022): 314002. https://doi.org/10.1088/1751-8121/ac7d22.'
ieee: 'S. Klus, F. Nüske, and S. Peitz, “Koopman analysis of quantum systems,” Journal
of Physics A: Mathematical and Theoretical, vol. 55, no. 31, p. 314002, 2022,
doi: 10.1088/1751-8121/ac7d22.'
mla: 'Klus, Stefan, et al. “Koopman Analysis of Quantum Systems.” Journal of
Physics A: Mathematical and Theoretical, vol. 55, no. 31, IOP Publishing Ltd.,
2022, p. 314002, doi:10.1088/1751-8121/ac7d22.'
short: 'S. Klus, F. Nüske, S. Peitz, Journal of Physics A: Mathematical and Theoretical
55 (2022) 314002.'
date_created: 2022-01-31T09:49:40Z
date_updated: 2022-07-18T14:26:41Z
department:
- _id: '655'
- _id: '101'
doi: 10.1088/1751-8121/ac7d22
external_id:
arxiv:
- '2201.12062'
intvolume: ' 55'
issue: '31'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://iopscience.iop.org/article/10.1088/1751-8121/ac7d22/pdf
oa: '1'
page: '314002'
publication: 'Journal of Physics A: Mathematical and Theoretical'
publication_status: published
publisher: IOP Publishing Ltd.
status: public
title: Koopman analysis of quantum systems
type: journal_article
user_id: '47427'
volume: 55
year: '2022'
...
---
_id: '32409'
abstract:
- lang: eng
text: 'Context: Cryptographic APIs are often misused in real-world applications.
Therefore, many cryptographic API misuse detection tools have been introduced.
However, there exists no established reference benchmark for a fair and comprehensive
comparison and evaluation of these tools. While there are benchmarks, they often
only address a subset of the domain or were only used to evaluate a subset of
existing misuse detection tools. Objective: To fairly compare cryptographic API
misuse detection tools and to drive future development in this domain, we will
devise such a benchmark. Openness and transparency in the generation process are
key factors to fairly generate and establish the needed benchmark. Method: We
propose an approach where we derive the benchmark generation methodology from
the literature which consists of general best practices in benchmarking and domain-specific
benchmark generation. A part of this methodology is transparency and openness
of the generation process, which is achieved by pre-registering this work. Based
on our methodology we design CamBench, a fair "Cryptographic API Misuse Detection
Tool Benchmark Suite". We will implement the first version of CamBench limiting
the domain to Java, the JCA, and static analyses. Finally, we will use CamBench
to compare current misuse detection tools and compare CamBench to related benchmarks
of its domain.'
author:
- first_name: Michael
full_name: Schlichtig, Michael
id: '32312'
last_name: Schlichtig
orcid: 0000-0001-6600-6171
- first_name: Anna-Katharina
full_name: Wickert, Anna-Katharina
last_name: Wickert
- first_name: Stefan
full_name: Krüger, Stefan
last_name: Krüger
- first_name: Eric
full_name: Bodden, Eric
id: '59256'
last_name: Bodden
orcid: 0000-0003-3470-3647
- first_name: Mira
full_name: Mezini, Mira
last_name: Mezini
citation:
ama: Schlichtig M, Wickert A-K, Krüger S, Bodden E, Mezini M. CamBench -- Cryptographic
API Misuse Detection Tool Benchmark Suite.; 2022. doi:10.48550/ARXIV.2204.06447
apa: Schlichtig, M., Wickert, A.-K., Krüger, S., Bodden, E., & Mezini, M. (2022).
CamBench -- Cryptographic API Misuse Detection Tool Benchmark Suite. https://doi.org/10.48550/ARXIV.2204.06447
bibtex: '@book{Schlichtig_Wickert_Krüger_Bodden_Mezini_2022, title={CamBench --
Cryptographic API Misuse Detection Tool Benchmark Suite}, DOI={10.48550/ARXIV.2204.06447},
author={Schlichtig, Michael and Wickert, Anna-Katharina and Krüger, Stefan and
Bodden, Eric and Mezini, Mira}, year={2022} }'
chicago: Schlichtig, Michael, Anna-Katharina Wickert, Stefan Krüger, Eric Bodden,
and Mira Mezini. CamBench -- Cryptographic API Misuse Detection Tool Benchmark
Suite, 2022. https://doi.org/10.48550/ARXIV.2204.06447.
ieee: M. Schlichtig, A.-K. Wickert, S. Krüger, E. Bodden, and M. Mezini, CamBench
-- Cryptographic API Misuse Detection Tool Benchmark Suite. 2022.
mla: Schlichtig, Michael, et al. CamBench -- Cryptographic API Misuse Detection
Tool Benchmark Suite. 2022, doi:10.48550/ARXIV.2204.06447.
short: M. Schlichtig, A.-K. Wickert, S. Krüger, E. Bodden, M. Mezini, CamBench --
Cryptographic API Misuse Detection Tool Benchmark Suite, 2022.
date_created: 2022-07-25T07:56:59Z
date_updated: 2022-07-25T10:23:44Z
department:
- _id: '76'
doi: 10.48550/ARXIV.2204.06447
keyword:
- cryptography
- benchmark
- API misuse
- static analysis
language:
- iso: eng
related_material:
link:
- relation: confirmation
url: https://arxiv.org/abs/2204.06447
status: public
title: CamBench -- Cryptographic API Misuse Detection Tool Benchmark Suite
type: misc
user_id: '32312'
year: '2022'
...
---
_id: '32414'
author:
- first_name: Michael
full_name: Lass, Michael
id: '24135'
last_name: Lass
orcid: 0000-0002-5708-7632
citation:
ama: Lass M. Bringing Massive Parallelism and Hardware Acceleration to Linear
Scaling Density Functional Theory Through Targeted Approximations. Universität
Paderborn; 2022. doi:10.17619/UNIPB/1-1281
apa: Lass, M. (2022). Bringing Massive Parallelism and Hardware Acceleration
to Linear Scaling Density Functional Theory Through Targeted Approximations.
Universität Paderborn. https://doi.org/10.17619/UNIPB/1-1281
bibtex: '@book{Lass_2022, place={Paderborn}, title={Bringing Massive Parallelism
and Hardware Acceleration to Linear Scaling Density Functional Theory Through
Targeted Approximations}, DOI={10.17619/UNIPB/1-1281},
publisher={Universität Paderborn}, author={Lass, Michael}, year={2022} }'
chicago: 'Lass, Michael. Bringing Massive Parallelism and Hardware Acceleration
to Linear Scaling Density Functional Theory Through Targeted Approximations.
Paderborn: Universität Paderborn, 2022. https://doi.org/10.17619/UNIPB/1-1281.'
ieee: 'M. Lass, Bringing Massive Parallelism and Hardware Acceleration to Linear
Scaling Density Functional Theory Through Targeted Approximations. Paderborn:
Universität Paderborn, 2022.'
mla: Lass, Michael. Bringing Massive Parallelism and Hardware Acceleration to
Linear Scaling Density Functional Theory Through Targeted Approximations.
Universität Paderborn, 2022, doi:10.17619/UNIPB/1-1281.
short: M. Lass, Bringing Massive Parallelism and Hardware Acceleration to Linear
Scaling Density Functional Theory Through Targeted Approximations, Universität
Paderborn, Paderborn, 2022.
date_created: 2022-07-25T18:13:51Z
date_updated: 2022-07-25T18:14:23Z
department:
- _id: '27'
- _id: '518'
doi: 10.17619/UNIPB/1-1281
language:
- iso: eng
place: Paderborn
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
title: Bringing Massive Parallelism and Hardware Acceleration to Linear Scaling Density
Functional Theory Through Targeted Approximations
type: dissertation
user_id: '24135'
year: '2022'
...
---
_id: '32410'
abstract:
- lang: eng
text: "Static analysis tools support developers in detecting potential coding issues,
such as bugs or vulnerabilities. Research on static analysis emphasizes its technical
challenges but also mentions severe usability shortcomings. These shortcomings
hinder the adoption of static analysis tools, and in some cases, user dissatisfaction
even leads to tool abandonment.\r\nTo comprehensively assess the current state
of the art, this paper presents the first systematic usability evaluation in a
wide range of static analysis tools. We derived a set of 36 relevant criteria
from the scientific literature and gathered a collection of 46 static analysis
tools complying with our inclusion and exclusion criteria - a representative set
of mainly non-proprietary tools. Then, we evaluated how well these tools fulfill
the aforementioned criteria.\r\nThe evaluation shows that more than half of the
considered tools offer poor warning messages, while about three-quarters of the
tools provide hardly any fix support. Furthermore, the integration of user knowledge
is strongly neglected, which could be used for improved handling of false positives
and tuning the results for the corresponding developer. Finally, issues regarding
workflow integration and specialized user interfaces are proved further.\r\nThese
findings should prove useful in guiding and focusing further research and development
in the area of user experience for static code analyses."
author:
- first_name: Marcus
full_name: Nachtigall, Marcus
id: '41213'
last_name: Nachtigall
- 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: 'Nachtigall M, Schlichtig M, Bodden E. A Large-Scale Study of Usability Criteria
Addressed by Static Analysis Tools. In: Proceedings of the 31st ACM SIGSOFT
International Symposium on Software Testing and Analysis. ACM; 2022:532-543.
doi:10.1145/3533767'
apa: Nachtigall, M., Schlichtig, M., & Bodden, E. (2022). A Large-Scale Study
of Usability Criteria Addressed by Static Analysis Tools. Proceedings of the
31st ACM SIGSOFT International Symposium on Software Testing and Analysis,
532–543. https://doi.org/10.1145/3533767
bibtex: '@inproceedings{Nachtigall_Schlichtig_Bodden_2022, title={A Large-Scale
Study of Usability Criteria Addressed by Static Analysis Tools}, DOI={10.1145/3533767},
booktitle={Proceedings of the 31st ACM SIGSOFT International Symposium on Software
Testing and Analysis}, publisher={ACM}, author={Nachtigall, Marcus and Schlichtig,
Michael and Bodden, Eric}, year={2022}, pages={532–543} }'
chicago: Nachtigall, Marcus, Michael Schlichtig, and Eric Bodden. “A Large-Scale
Study of Usability Criteria Addressed by Static Analysis Tools.” In Proceedings
of the 31st ACM SIGSOFT International Symposium on Software Testing and Analysis,
532–43. ACM, 2022. https://doi.org/10.1145/3533767.
ieee: 'M. Nachtigall, M. Schlichtig, and E. Bodden, “A Large-Scale Study of Usability
Criteria Addressed by Static Analysis Tools,” in Proceedings of the 31st ACM
SIGSOFT International Symposium on Software Testing and Analysis, 2022, pp.
532–543, doi: 10.1145/3533767.'
mla: Nachtigall, Marcus, et al. “A Large-Scale Study of Usability Criteria Addressed
by Static Analysis Tools.” Proceedings of the 31st ACM SIGSOFT International
Symposium on Software Testing and Analysis, ACM, 2022, pp. 532–43, doi:10.1145/3533767.
short: 'M. Nachtigall, M. Schlichtig, E. Bodden, in: Proceedings of the 31st ACM
SIGSOFT International Symposium on Software Testing and Analysis, ACM, 2022, pp.
532–543.'
date_created: 2022-07-25T08:02:36Z
date_updated: 2022-07-26T11:42:23Z
department:
- _id: '76'
doi: 10.1145/3533767
keyword:
- Automated static analysis
- Software usability
language:
- iso: eng
page: 532 - 543
publication: Proceedings of the 31st ACM SIGSOFT International Symposium on Software
Testing and Analysis
publication_identifier:
isbn:
- '9781450393799'
publication_status: published
publisher: ACM
quality_controlled: '1'
related_material:
link:
- relation: confirmation
url: https://dl.acm.org/doi/10.1145/3533767.3534374
status: public
title: A Large-Scale Study of Usability Criteria Addressed by Static Analysis Tools
type: conference
user_id: '32312'
year: '2022'
...
---
_id: '31133'
abstract:
- lang: eng
text: Application Programming Interfaces (APIs) are the primary mechanism that developers
use to obtain access to third-party algorithms and services. Unfortunately, APIs
can be misused, which can have catastrophic consequences, especially if the APIs
provide security-critical functionalities like cryptography. Understanding what
API misuses are, and for what reasons they are caused, is important to prevent
them, e.g., with API misuse detectors. However, definitions and nominations for
API misuses and related terms in literature vary and are diverse. This paper addresses
the problem of scattered knowledge and definitions of API misuses by presenting
a systematic literature review on the subject and introducing FUM, a novel Framework
for API Usage constraint and Misuse classification. The literature review revealed
that API misuses are violations of API usage constraints. To capture this, we
provide unified definitions and use them to derive FUM. To assess the extent to
which FUM aids in determining and guiding the improvement of an API misuses detectors'
capabilities, we performed a case study on CogniCrypt, a state-of-the-art misuse
detector for cryptographic APIs. The study showed that FUM can be used to properly
assess CogniCrypt's capabilities, identify weaknesses and assist in deriving mitigations
and improvements. And it appears that also more generally FUM can aid the development
and improvement of misuse detection tools.
author:
- first_name: Michael
full_name: Schlichtig, Michael
id: '32312'
last_name: Schlichtig
orcid: 0000-0001-6600-6171
- first_name: Steffen
full_name: Sassalla, Steffen
last_name: Sassalla
- first_name: Krishna
full_name: Narasimhan, Krishna
last_name: Narasimhan
- first_name: Eric
full_name: Bodden, Eric
id: '59256'
last_name: Bodden
orcid: 0000-0003-3470-3647
citation:
ama: 'Schlichtig M, Sassalla S, Narasimhan K, Bodden E. FUM - A Framework for API
Usage constraint and Misuse Classification. In: 2022 IEEE International Conference
on Software Analysis, Evolution and Reengineering (SANER). ; 2022:673-684.
doi:https://doi.org/10.1109/SANER53432.2022.00085'
apa: Schlichtig, M., Sassalla, S., Narasimhan, K., & Bodden, E. (2022). FUM
- A Framework for API Usage constraint and Misuse Classification. 2022 IEEE
International Conference on Software Analysis, Evolution and Reengineering (SANER),
673–684. https://doi.org/10.1109/SANER53432.2022.00085
bibtex: '@inproceedings{Schlichtig_Sassalla_Narasimhan_Bodden_2022, title={FUM -
A Framework for API Usage constraint and Misuse Classification}, DOI={https://doi.org/10.1109/SANER53432.2022.00085},
booktitle={2022 IEEE International Conference on Software Analysis, Evolution
and Reengineering (SANER)}, author={Schlichtig, Michael and Sassalla, Steffen
and Narasimhan, Krishna and Bodden, Eric}, year={2022}, pages={673–684} }'
chicago: Schlichtig, Michael, Steffen Sassalla, Krishna Narasimhan, and Eric Bodden.
“FUM - A Framework for API Usage Constraint and Misuse Classification.” In 2022
IEEE International Conference on Software Analysis, Evolution and Reengineering
(SANER), 673–84, 2022. https://doi.org/10.1109/SANER53432.2022.00085.
ieee: 'M. Schlichtig, S. Sassalla, K. Narasimhan, and E. Bodden, “FUM - A Framework
for API Usage constraint and Misuse Classification,” in 2022 IEEE International
Conference on Software Analysis, Evolution and Reengineering (SANER), 2022,
pp. 673–684, doi: https://doi.org/10.1109/SANER53432.2022.00085.'
mla: Schlichtig, Michael, et al. “FUM - A Framework for API Usage Constraint and
Misuse Classification.” 2022 IEEE International Conference on Software Analysis,
Evolution and Reengineering (SANER), 2022, pp. 673–84, doi:https://doi.org/10.1109/SANER53432.2022.00085.
short: 'M. Schlichtig, S. Sassalla, K. Narasimhan, E. Bodden, in: 2022 IEEE International
Conference on Software Analysis, Evolution and Reengineering (SANER), 2022, pp.
673–684.'
date_created: 2022-05-09T13:04:10Z
date_updated: 2022-07-26T11:42:30Z
department:
- _id: '76'
doi: https://doi.org/10.1109/SANER53432.2022.00085
keyword:
- API misuses
- API usage constraints
- classification framework
- API misuse detection
- static analysis
language:
- iso: eng
page: 673 - 684
publication: 2022 IEEE International Conference on Software Analysis, Evolution and
Reengineering (SANER)
quality_controlled: '1'
related_material:
link:
- relation: confirmation
url: https://ieeexplore.ieee.org/document/9825763
status: public
title: FUM - A Framework for API Usage constraint and Misuse Classification
type: conference
user_id: '32312'
year: '2022'
...
---
_id: '32399'
author:
- first_name: Ella
full_name: Vahle, Ella
last_name: Vahle
citation:
ama: Vahle E. Modelling and Proving Security for a Secure MPC Protocol for Stable
Matching.; 2022.
apa: Vahle, E. (2022). Modelling and Proving Security for a Secure MPC Protocol
for Stable Matching.
bibtex: '@book{Vahle_2022, title={Modelling and Proving Security for a Secure MPC
Protocol for Stable Matching}, author={Vahle, Ella}, year={2022} }'
chicago: Vahle, Ella. Modelling and Proving Security for a Secure MPC Protocol
for Stable Matching, 2022.
ieee: E. Vahle, Modelling and Proving Security for a Secure MPC Protocol for
Stable Matching. 2022.
mla: Vahle, Ella. Modelling and Proving Security for a Secure MPC Protocol for
Stable Matching. 2022.
short: E. Vahle, Modelling and Proving Security for a Secure MPC Protocol for Stable
Matching, 2022.
date_created: 2022-07-20T09:38:39Z
date_updated: 2022-07-26T14:31:54Z
department:
- _id: '64'
language:
- iso: eng
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
- _id: '13'
name: 'SFB 901 - C1: SFB 901 - Subproject C1'
status: public
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: Modelling and Proving Security for a Secure MPC Protocol for Stable Matching
type: bachelorsthesis
user_id: '25078'
year: '2022'
...
---
_id: '6561'
author:
- first_name: Tim
full_name: Hetkämper, Tim
id: '38123'
last_name: Hetkämper
citation:
ama: Hetkämper T. Visualisierung von Ultraschallfeldern Mittels Schlierentechnik
Und Fraktionaler Fouriertransformation.; 2022.
apa: Hetkämper, T. (2022). Visualisierung von Ultraschallfeldern mittels Schlierentechnik
und fraktionaler Fouriertransformation.
bibtex: '@book{Hetkämper_2022, place={Workshop “Messtechnische Anwendungen von Ultraschall”,
Drübeck}, title={Visualisierung von Ultraschallfeldern mittels Schlierentechnik
und fraktionaler Fouriertransformation}, author={Hetkämper, Tim}, year={2022}
}'
chicago: Hetkämper, Tim. Visualisierung von Ultraschallfeldern Mittels Schlierentechnik
Und Fraktionaler Fouriertransformation. Workshop “Messtechnische Anwendungen
von Ultraschall”, Drübeck, 2022.
ieee: T. Hetkämper, Visualisierung von Ultraschallfeldern mittels Schlierentechnik
und fraktionaler Fouriertransformation. Workshop “Messtechnische Anwendungen
von Ultraschall”, Drübeck, 2022.
mla: Hetkämper, Tim. Visualisierung von Ultraschallfeldern Mittels Schlierentechnik
Und Fraktionaler Fouriertransformation. 2022.
short: T. Hetkämper, Visualisierung von Ultraschallfeldern Mittels Schlierentechnik
Und Fraktionaler Fouriertransformation, Workshop “Messtechnische Anwendungen von
Ultraschall”, Drübeck, 2022.
date_created: 2019-01-09T14:37:08Z
date_updated: 2022-07-28T07:12:05Z
department:
- _id: '49'
language:
- iso: eng
place: Workshop "Messtechnische Anwendungen von Ultraschall", Drübeck
status: public
title: Visualisierung von Ultraschallfeldern mittels Schlierentechnik und fraktionaler
Fouriertransformation
type: misc
user_id: '11829'
year: '2022'
...
---
_id: '6592'
author:
- first_name: Leander
full_name: Claes, Leander
id: '11829'
last_name: Claes
orcid: 0000-0002-4393-268X
citation:
ama: Claes L. Messverfahren Für Die Akustische Absorption Zur Bestimmung Der
Volumenviskosität.; 2022.
apa: Claes, L. (2022). Messverfahren für die akustische Absorption zur Bestimmung
der Volumenviskosität.
bibtex: '@book{Claes_2022, place={Workshop “Messtechnische Anwendungen von Ultraschall”,
Drübeck}, title={Messverfahren für die akustische Absorption zur Bestimmung der
Volumenviskosität}, author={Claes, Leander}, year={2022} }'
chicago: Claes, Leander. Messverfahren Für Die Akustische Absorption Zur Bestimmung
Der Volumenviskosität. Workshop “Messtechnische Anwendungen von Ultraschall”,
Drübeck, 2022.
ieee: L. Claes, Messverfahren für die akustische Absorption zur Bestimmung der
Volumenviskosität. Workshop “Messtechnische Anwendungen von Ultraschall”,
Drübeck, 2022.
mla: Claes, Leander. Messverfahren Für Die Akustische Absorption Zur Bestimmung
Der Volumenviskosität. 2022.
short: L. Claes, Messverfahren Für Die Akustische Absorption Zur Bestimmung Der
Volumenviskosität, Workshop “Messtechnische Anwendungen von Ultraschall”, Drübeck,
2022.
date_created: 2019-01-09T16:07:04Z
date_updated: 2022-07-28T07:12:28Z
department:
- _id: '49'
language:
- iso: eng
place: Workshop "Messtechnische Anwendungen von Ultraschall", Drübeck
status: public
title: Messverfahren für die akustische Absorption zur Bestimmung der Volumenviskosität
type: misc
user_id: '11829'
year: '2022'
...
---
_id: '31847'
abstract:
- lang: eng
text: "The famous $k$-Server Problem covers plenty of resource allocation scenarios,
and several variations have been studied extensively for decades. However, to
the best of our knowledge, no research has considered the problem if the servers
are not identical and requests can express which specific servers should serve
them. Therefore, we present a new model generalizing the $k$-Server Problem by
*preferences* of the requests and proceed to study it in a uniform metric space
for deterministic online algorithms (the special case of paging).\r\n\r\nIn our
model, requests can either demand to be answered by any server (*general requests*)
or by a specific one (*specific requests*). If only general requests appear, the
instance is one of the original $k$-Server Problem, and a lower bound for the
competitive ratio of $k$ applies. If only specific requests appear, a solution
with a competitive ratio of $1$ becomes trivial since there is no freedom regarding
the servers' movements. Perhaps counter-intuitively, we show that if both kinds
of requests appear, the lower bound raises to $2k-1$.\r\n\r\nWe study deterministic
online algorithms in uniform metrics and present two algorithms. The first one
has an adaptive competitive ratio dependent on the frequency of specific requests.
It achieves a worst-case competitive ratio of $3k-2$ while it is optimal when
only general or only specific requests appear (competitive ratio of $k$ and $1$,
respectively). The second has a fixed close-to-optimal worst-case competitive
ratio of $2k+14$. For the first algorithm, we show a lower bound of $3k-2$, while
the second algorithm has a lower bound of $2k-1$ when only general requests appear.\r\n
\ \r\nThe two algorithms differ in only one behavioral rule for each server
that significantly influences the competitive ratio. Each server acting according
to the rule allows approaching the worst-case lower bound, while it implies an
increased lower bound for $k$-Server instances. In other words, there is a trade-off
between performing well against instances of the $k$-Server Problem and instances
containing specific requests. We also show that no deterministic online algorithm
can be optimal for both kinds of instances simultaneously."
author:
- first_name: Jannik
full_name: Castenow, Jannik
id: '38705'
last_name: Castenow
- first_name: Björn
full_name: Feldkord, Björn
id: '22704'
last_name: Feldkord
- first_name: Till
full_name: Knollmann, Till
id: '39241'
last_name: Knollmann
orcid: 0000-0003-2014-4696
- first_name: Manuel
full_name: Malatyali, Manuel
id: '41265'
last_name: Malatyali
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Castenow J, Feldkord B, Knollmann T, Malatyali M, Meyer auf der Heide F. The
k-Server with Preferences Problem. In: Proceedings of the 34th ACM Symposium
on Parallelism in Algorithms and Architectures. Association for Computing
Machinery; 2022:345-356. doi:10.1145/3490148.3538595'
apa: Castenow, J., Feldkord, B., Knollmann, T., Malatyali, M., & Meyer auf der
Heide, F. (2022). The k-Server with Preferences Problem. Proceedings of the
34th ACM Symposium on Parallelism in Algorithms and Architectures, 345–356.
https://doi.org/10.1145/3490148.3538595
bibtex: '@inproceedings{Castenow_Feldkord_Knollmann_Malatyali_Meyer auf der Heide_2022,
title={The k-Server with Preferences Problem}, DOI={10.1145/3490148.3538595},
booktitle={Proceedings of the 34th ACM Symposium on Parallelism in Algorithms
and Architectures}, publisher={Association for Computing Machinery}, author={Castenow,
Jannik and Feldkord, Björn and Knollmann, Till and Malatyali, Manuel and Meyer
auf der Heide, Friedhelm}, year={2022}, pages={345–356} }'
chicago: Castenow, Jannik, Björn Feldkord, Till Knollmann, Manuel Malatyali, and
Friedhelm Meyer auf der Heide. “The K-Server with Preferences Problem.” In Proceedings
of the 34th ACM Symposium on Parallelism in Algorithms and Architectures,
345–56. Association for Computing Machinery, 2022. https://doi.org/10.1145/3490148.3538595.
ieee: 'J. Castenow, B. Feldkord, T. Knollmann, M. Malatyali, and F. Meyer auf der
Heide, “The k-Server with Preferences Problem,” in Proceedings of the 34th
ACM Symposium on Parallelism in Algorithms and Architectures, 2022, pp. 345–356,
doi: 10.1145/3490148.3538595.'
mla: Castenow, Jannik, et al. “The K-Server with Preferences Problem.” Proceedings
of the 34th ACM Symposium on Parallelism in Algorithms and Architectures,
Association for Computing Machinery, 2022, pp. 345–56, doi:10.1145/3490148.3538595.
short: 'J. Castenow, B. Feldkord, T. Knollmann, M. Malatyali, F. Meyer auf der Heide,
in: Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures,
Association for Computing Machinery, 2022, pp. 345–356.'
date_created: 2022-06-10T09:06:42Z
date_updated: 2022-08-02T08:07:30Z
department:
- _id: '63'
doi: 10.1145/3490148.3538595
external_id:
arxiv:
- '2205.11102'
keyword:
- K-Server Problem
- Heterogeneity
- Online Caching
language:
- iso: eng
page: 345-356
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '2'
name: 'SFB 901 - A: SFB 901 - Project Area A'
- _id: '5'
name: 'SFB 901 - A1: SFB 901 - Subproject A1'
publication: Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and
Architectures
publication_identifier:
isbn:
- '9781450391467'
publisher: Association for Computing Machinery
status: public
title: The k-Server with Preferences Problem
type: conference
user_id: '39241'
year: '2022'
...
---
_id: '34023'
abstract:
- lang: eng
text: Decision makers increasingly rely on decision support systems for optimal
decision making. Recently, special attention has been paid to process-driven decision
support systems (PD-DSS) in which a process model prescribes the invocation sequence
of software-based decision support services and the data exchange between them.
Thus, it is possible to quickly combine available decision support services as
needed for optimally supporting the decision making process of an individual decision
maker. However, process modelers may accidentally create a process model which
is technically well-formed and executable, but contains functional and behavioral
flaws such as redundant or missing services. These flaws may result in inefficient
computations or invalid decision recommendations when the corresponding PD-DSS
is utilized by a decision maker. In this paper, we therefore propose an approach
to validate functionality and behavior of a process model representing a PD-DSS.
Our approach is based on expressing flaws as anti-patterns for which the process
model can be automatically checked via graph matching. We prototypically implemented
our approach and demonstrate its applicability in the context of decision making
for energy network planning.
author:
- first_name: Jonas
full_name: Kirchhoff, Jonas
id: '39928'
last_name: Kirchhoff
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
citation:
ama: 'Kirchhoff J, Engels G. Anti-pattern Detection in Process-Driven Decision Support
Systems. In: Software Business. Vol 463. Lecture Notes in Business Information
Processing. Springer International Publishing; 2022:227--243. doi:10.1007/978-3-031-20706-8_16'
apa: Kirchhoff, J., & Engels, G. (2022). Anti-pattern Detection in Process-Driven
Decision Support Systems. In Software Business (Vol. 463, pp. 227--243).
Springer International Publishing. https://doi.org/10.1007/978-3-031-20706-8_16
bibtex: '@inbook{Kirchhoff_Engels_2022, place={Cham}, series={Lecture Notes in Business
Information Processing}, title={Anti-pattern Detection in Process-Driven Decision
Support Systems}, volume={463}, DOI={10.1007/978-3-031-20706-8_16},
booktitle={Software Business}, publisher={Springer International Publishing},
author={Kirchhoff, Jonas and Engels, Gregor}, year={2022}, pages={227--243}, collection={Lecture
Notes in Business Information Processing} }'
chicago: 'Kirchhoff, Jonas, and Gregor Engels. “Anti-Pattern Detection in Process-Driven
Decision Support Systems.” In Software Business, 463:227--243. Lecture
Notes in Business Information Processing. Cham: Springer International Publishing,
2022. https://doi.org/10.1007/978-3-031-20706-8_16.'
ieee: 'J. Kirchhoff and G. Engels, “Anti-pattern Detection in Process-Driven Decision
Support Systems,” in Software Business, vol. 463, Cham: Springer International
Publishing, 2022, pp. 227--243.'
mla: Kirchhoff, Jonas, and Gregor Engels. “Anti-Pattern Detection in Process-Driven
Decision Support Systems.” Software Business, vol. 463, Springer International
Publishing, 2022, pp. 227--243, doi:10.1007/978-3-031-20706-8_16.
short: 'J. Kirchhoff, G. Engels, in: Software Business, Springer International Publishing,
Cham, 2022, pp. 227--243.'
date_created: 2022-11-07T10:51:24Z
date_updated: 2022-11-07T10:54:30Z
department:
- _id: '534'
- _id: '66'
doi: 10.1007/978-3-031-20706-8_16
intvolume: ' 463'
language:
- iso: eng
page: 227--243
place: Cham
publication: Software Business
publication_identifier:
isbn:
- '9783031207051'
- '9783031207068'
issn:
- 1865-1348
- 1865-1356
publication_status: published
publisher: Springer International Publishing
series_title: Lecture Notes in Business Information Processing
status: public
title: Anti-pattern Detection in Process-Driven Decision Support Systems
type: book_chapter
user_id: '39928'
volume: 463
year: '2022'
...
---
_id: '34040'
abstract:
- lang: eng
text: "Consider the practical goal of making a desired action profile played,\r\n\r\nwhen
the planner can only change the payoffs, bound by \r\n\r\nstringent constraints.\r\n\r\nApplications
include motivating people\r\n\r\nto choose the closest school, the closest subway
station, or to coordinate\r\n\r\non a communication protocol or an investment
strategy.\r\n\r\nEmploying subsidies and tolls, we adjust the game so that choosing
this predefined action profile\r\n\r\nbecomes strictly dominant. \r\n\r\nInspired
mainly by the work of Monderer and Tennenholtz,\r\n\r\nwhere the promised subsidies
do not materialise in the not played\r\n\r\nprofiles, we provide a fair and individually
rational game\r\n\r\nadjustment, such that the total outside investments sum up\r\n\r\nto
zero at any profile, thereby facilitating easy and frequent\r\n\r\nusage of our
adjustment without bearing costs, even if some\r\n\r\nplayers behave unexpectedly.
The resultant action profile itself needs no\r\n\r\nadjustment. Importantly, we
also prove that our adjustment minimises \r\n\r\nthe general transfer among all
such adjustments, counting the total subsidising and taxation."
author:
- first_name: Gleb
full_name: Polevoy, Gleb
id: '83983'
last_name: Polevoy
- first_name: Marcin
full_name: Dziubiński, Marcin
last_name: Dziubiński
citation:
ama: 'Polevoy G, Dziubiński M. Fair, Individually Rational and Cheap Adjustment.
In: De Raedt L, ed. Proceedings of the Thirty-First International Joint Conference
on Artificial Intelligence. International Joint Conferences on Artificial
Intelligence Organization; 2022. doi:10.24963/ijcai.2022/64'
apa: Polevoy, G., & Dziubiński, M. (2022). Fair, Individually Rational and Cheap
Adjustment. In L. De Raedt (Ed.), Proceedings of the Thirty-First International
Joint Conference on Artificial Intelligence. International Joint Conferences
on Artificial Intelligence Organization. https://doi.org/10.24963/ijcai.2022/64
bibtex: '@inproceedings{Polevoy_Dziubiński_2022, title={Fair, Individually Rational
and Cheap Adjustment}, DOI={10.24963/ijcai.2022/64},
booktitle={Proceedings of the Thirty-First International Joint Conference on Artificial
Intelligence}, publisher={International Joint Conferences on Artificial Intelligence
Organization}, author={Polevoy, Gleb and Dziubiński, Marcin}, editor={De Raedt,
Luc}, year={2022} }'
chicago: Polevoy, Gleb, and Marcin Dziubiński. “Fair, Individually Rational and
Cheap Adjustment.” In Proceedings of the Thirty-First International Joint Conference
on Artificial Intelligence, edited by Luc De Raedt. International Joint Conferences
on Artificial Intelligence Organization, 2022. https://doi.org/10.24963/ijcai.2022/64.
ieee: 'G. Polevoy and M. Dziubiński, “Fair, Individually Rational and Cheap Adjustment,”
in Proceedings of the Thirty-First International Joint Conference on Artificial
Intelligence, Vienna, 2022, doi: 10.24963/ijcai.2022/64.'
mla: Polevoy, Gleb, and Marcin Dziubiński. “Fair, Individually Rational and Cheap
Adjustment.” Proceedings of the Thirty-First International Joint Conference
on Artificial Intelligence, edited by Luc De Raedt, International Joint Conferences
on Artificial Intelligence Organization, 2022, doi:10.24963/ijcai.2022/64.
short: 'G. Polevoy, M. Dziubiński, in: L. De Raedt (Ed.), Proceedings of the Thirty-First
International Joint Conference on Artificial Intelligence, International Joint
Conferences on Artificial Intelligence Organization, 2022.'
conference:
end_date: 2022-07-29
location: Vienna
name: THE 31ST INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE
start_date: 2022-07-23
date_created: 2022-11-08T16:53:31Z
date_updated: 2022-11-08T17:34:36Z
department:
- _id: '63'
- _id: '541'
doi: 10.24963/ijcai.2022/64
editor:
- first_name: Luc
full_name: De Raedt, Luc
last_name: De Raedt
keyword:
- adjustment
- strictly dominant
- fairness
- individually rational
- transfer
- tax
- subsidy
language:
- iso: eng
main_file_link:
- url: https://www.ijcai.org/proceedings/2022/64
publication: Proceedings of the Thirty-First International Joint Conference on Artificial
Intelligence
publication_status: published
publisher: International Joint Conferences on Artificial Intelligence Organization
status: public
title: Fair, Individually Rational and Cheap Adjustment
type: conference
user_id: '83983'
year: '2022'
...
---
_id: '33085'
author:
- first_name: Leah
full_name: Epstein, Leah
last_name: Epstein
- first_name: Alexandra
full_name: Lassota, Alexandra
last_name: Lassota
- first_name: Asaf
full_name: Levin, Asaf
last_name: Levin
- first_name: Marten
full_name: Maack, Marten
id: '88252'
last_name: Maack
- first_name: Lars
full_name: Rohwedder, Lars
last_name: Rohwedder
citation:
ama: 'Epstein L, Lassota A, Levin A, Maack M, Rohwedder L. Cardinality Constrained
Scheduling in Online Models. In: Berenbrink P, Monmege B, eds. 39th International
Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18,
2022, Marseille, France (Virtual Conference). Vol 219. LIPIcs. Schloss Dagstuhl
- Leibniz-Zentrum für Informatik; 2022:28:1–28:15. doi:10.4230/LIPIcs.STACS.2022.28'
apa: Epstein, L., Lassota, A., Levin, A., Maack, M., & Rohwedder, L. (2022).
Cardinality Constrained Scheduling in Online Models. In P. Berenbrink & B.
Monmege (Eds.), 39th International Symposium on Theoretical Aspects of Computer
Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference)
(Vol. 219, p. 28:1–28:15). Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPIcs.STACS.2022.28
bibtex: '@inproceedings{Epstein_Lassota_Levin_Maack_Rohwedder_2022, series={LIPIcs},
title={Cardinality Constrained Scheduling in Online Models}, volume={219}, DOI={10.4230/LIPIcs.STACS.2022.28},
booktitle={39th International Symposium on Theoretical Aspects of Computer Science,
STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference)}, publisher={Schloss
Dagstuhl - Leibniz-Zentrum für Informatik}, author={Epstein, Leah and Lassota,
Alexandra and Levin, Asaf and Maack, Marten and Rohwedder, Lars}, editor={Berenbrink,
Petra and Monmege, Benjamin}, year={2022}, pages={28:1–28:15}, collection={LIPIcs}
}'
chicago: Epstein, Leah, Alexandra Lassota, Asaf Levin, Marten Maack, and Lars Rohwedder.
“Cardinality Constrained Scheduling in Online Models.” In 39th International
Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18,
2022, Marseille, France (Virtual Conference), edited by Petra Berenbrink and
Benjamin Monmege, 219:28:1–28:15. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für
Informatik, 2022. https://doi.org/10.4230/LIPIcs.STACS.2022.28.
ieee: 'L. Epstein, A. Lassota, A. Levin, M. Maack, and L. Rohwedder, “Cardinality
Constrained Scheduling in Online Models,” in 39th International Symposium on
Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille,
France (Virtual Conference), 2022, vol. 219, p. 28:1–28:15, doi: 10.4230/LIPIcs.STACS.2022.28.'
mla: Epstein, Leah, et al. “Cardinality Constrained Scheduling in Online Models.”
39th International Symposium on Theoretical Aspects of Computer Science, STACS
2022, March 15-18, 2022, Marseille, France (Virtual Conference), edited by
Petra Berenbrink and Benjamin Monmege, vol. 219, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2022, p. 28:1–28:15, doi:10.4230/LIPIcs.STACS.2022.28.
short: 'L. Epstein, A. Lassota, A. Levin, M. Maack, L. Rohwedder, in: P. Berenbrink,
B. Monmege (Eds.), 39th International Symposium on Theoretical Aspects of Computer
Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference),
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 28:1–28:15.'
date_created: 2022-08-23T08:10:36Z
date_updated: 2022-11-08T16:34:32Z
department:
- _id: '63'
doi: 10.4230/LIPIcs.STACS.2022.28
editor:
- first_name: Petra
full_name: Berenbrink, Petra
last_name: Berenbrink
- first_name: Benjamin
full_name: Monmege, Benjamin
last_name: Monmege
intvolume: ' 219'
language:
- iso: eng
page: 28:1–28:15
project:
- _id: '16'
name: 'SFB 901 - C4: SFB 901 - Subproject C4'
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
publication: 39th International Symposium on Theoretical Aspects of Computer Science,
STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference)
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
series_title: LIPIcs
status: public
title: Cardinality Constrained Scheduling in Online Models
type: conference
user_id: '88252'
volume: 219
year: '2022'
...
---
_id: '33004'
author:
- first_name: Henning
full_name: Wachsmuth, Henning
id: '3900'
last_name: Wachsmuth
- first_name: Milad
full_name: Alshomary, Milad
id: '73059'
last_name: Alshomary
citation:
ama: 'Wachsmuth H, Alshomary M. “Mama Always Had a Way of Explaining Things So I
Could Understand”: A Dialogue Corpus for Learning How to Explain. In: Proceedings
of the 29th International Conference on Computational Linguistics. ; 2022:344-354.'
apa: 'Wachsmuth, H., & Alshomary, M. (2022). “Mama Always Had a Way of Explaining
Things So I Could Understand”: A Dialogue Corpus for Learning How to Explain.
Proceedings of the 29th International Conference on Computational Linguistics,
344–354.'
bibtex: '@inproceedings{Wachsmuth_Alshomary_2022, title={“Mama Always Had a Way
of Explaining Things So I Could Understand”: A Dialogue Corpus for Learning How
to Explain}, booktitle={Proceedings of the 29th International Conference on Computational
Linguistics}, author={Wachsmuth, Henning and Alshomary, Milad}, year={2022}, pages={344–354}
}'
chicago: 'Wachsmuth, Henning, and Milad Alshomary. “‘Mama Always Had a Way of Explaining
Things So I Could Understand’: A Dialogue Corpus for Learning How to Explain.”
In Proceedings of the 29th International Conference on Computational Linguistics,
344–54, 2022.'
ieee: 'H. Wachsmuth and M. Alshomary, “‘Mama Always Had a Way of Explaining Things
So I Could Understand’: A Dialogue Corpus for Learning How to Explain,” in Proceedings
of the 29th International Conference on Computational Linguistics, 2022, pp.
344–354.'
mla: 'Wachsmuth, Henning, and Milad Alshomary. “‘Mama Always Had a Way of Explaining
Things So I Could Understand’: A Dialogue Corpus for Learning How to Explain.”
Proceedings of the 29th International Conference on Computational Linguistics,
2022, pp. 344–54.'
short: 'H. Wachsmuth, M. Alshomary, in: Proceedings of the 29th International Conference
on Computational Linguistics, 2022, pp. 344–354.'
date_created: 2022-08-18T10:00:46Z
date_updated: 2022-11-10T09:06:39Z
department:
- _id: '600'
language:
- iso: eng
page: 344 - 354
publication: Proceedings of the 29th International Conference on Computational Linguistics
status: public
title: '"Mama Always Had a Way of Explaining Things So I Could Understand": A Dialogue
Corpus for Learning How to Explain'
type: conference
user_id: '82920'
year: '2022'
...
---
_id: '34049'
author:
- first_name: Anne
full_name: Lauscher, Anne
last_name: Lauscher
- first_name: Henning
full_name: Wachsmuth, Henning
id: '3900'
last_name: Wachsmuth
- first_name: Iryna
full_name: Gurevych, Iryna
last_name: Gurevych
- first_name: Goran
full_name: Glavaš, Goran
last_name: Glavaš
citation:
ama: Lauscher A, Wachsmuth H, Gurevych I, Glavaš G. On the Role of Knowledge in
Computational Argumentation. Transactions of the Association for Computational
Linguistics. Published online 2022.
apa: Lauscher, A., Wachsmuth, H., Gurevych, I., & Glavaš, G. (2022). On the
Role of Knowledge in Computational Argumentation. Transactions of the Association
for Computational Linguistics.
bibtex: '@article{Lauscher_Wachsmuth_Gurevych_Glavaš_2022, title={On the Role of
Knowledge in Computational Argumentation}, journal={Transactions of the Association
for Computational Linguistics}, author={Lauscher, Anne and Wachsmuth, Henning
and Gurevych, Iryna and Glavaš, Goran}, year={2022} }'
chicago: Lauscher, Anne, Henning Wachsmuth, Iryna Gurevych, and Goran Glavaš. “On
the Role of Knowledge in Computational Argumentation.” Transactions of the
Association for Computational Linguistics, 2022.
ieee: A. Lauscher, H. Wachsmuth, I. Gurevych, and G. Glavaš, “On the Role of Knowledge
in Computational Argumentation,” Transactions of the Association for Computational
Linguistics, 2022.
mla: Lauscher, Anne, et al. “On the Role of Knowledge in Computational Argumentation.”
Transactions of the Association for Computational Linguistics, 2022.
short: A. Lauscher, H. Wachsmuth, I. Gurevych, G. Glavaš, Transactions of the Association
for Computational Linguistics (2022).
date_created: 2022-11-10T08:39:38Z
date_updated: 2022-11-10T08:39:48Z
department:
- _id: '600'
language:
- iso: eng
publication: Transactions of the Association for Computational Linguistics
status: public
title: On the Role of Knowledge in Computational Argumentation
type: journal_article
user_id: '82920'
year: '2022'
...
---
_id: '22157'
author:
- first_name: Johannes
full_name: Kiesel, Johannes
last_name: Kiesel
- first_name: Milad
full_name: Alshomary, Milad
id: '73059'
last_name: Alshomary
- first_name: Nicolas
full_name: Handke, Nicolas
last_name: Handke
- first_name: Xiaoni
full_name: Cai, Xiaoni
last_name: Cai
- first_name: Henning
full_name: Wachsmuth, Henning
id: '3900'
last_name: Wachsmuth
- first_name: Benno
full_name: Stein, Benno
last_name: Stein
citation:
ama: 'Kiesel J, Alshomary M, Handke N, Cai X, Wachsmuth H, Stein B. Identifying
the Human Values behind Arguments. In: Proceedings of the 60th Annual Meeting
of the Association for Computational Linguistics. ; 2022:4459-4471.'
apa: Kiesel, J., Alshomary, M., Handke, N., Cai, X., Wachsmuth, H., & Stein,
B. (2022). Identifying the Human Values behind Arguments. Proceedings of the
60th Annual Meeting of the Association for Computational Linguistics, 4459–4471.
bibtex: '@inproceedings{Kiesel_Alshomary_Handke_Cai_Wachsmuth_Stein_2022, title={Identifying
the Human Values behind Arguments}, booktitle={Proceedings of the 60th Annual
Meeting of the Association for Computational Linguistics}, author={Kiesel, Johannes
and Alshomary, Milad and Handke, Nicolas and Cai, Xiaoni and Wachsmuth, Henning
and Stein, Benno}, year={2022}, pages={4459–4471} }'
chicago: Kiesel, Johannes, Milad Alshomary, Nicolas Handke, Xiaoni Cai, Henning
Wachsmuth, and Benno Stein. “Identifying the Human Values behind Arguments.” In
Proceedings of the 60th Annual Meeting of the Association for Computational
Linguistics, 4459–71, 2022.
ieee: J. Kiesel, M. Alshomary, N. Handke, X. Cai, H. Wachsmuth, and B. Stein, “Identifying
the Human Values behind Arguments,” in Proceedings of the 60th Annual Meeting
of the Association for Computational Linguistics, 2022, pp. 4459–4471.
mla: Kiesel, Johannes, et al. “Identifying the Human Values behind Arguments.” Proceedings
of the 60th Annual Meeting of the Association for Computational Linguistics,
2022, pp. 4459–71.
short: 'J. Kiesel, M. Alshomary, N. Handke, X. Cai, H. Wachsmuth, B. Stein, in:
Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics,
2022, pp. 4459–4471.'
date_created: 2021-05-11T23:15:42Z
date_updated: 2022-11-10T09:09:27Z
department:
- _id: '600'
language:
- iso: eng
page: 4459 - 4471
publication: Proceedings of the 60th Annual Meeting of the Association for Computational
Linguistics
status: public
title: Identifying the Human Values behind Arguments
type: conference
user_id: '82920'
year: '2022'
...
---
_id: '34057'
author:
- first_name: Faruk
full_name: Pasic, Faruk
last_name: Pasic
- first_name: Matthias
full_name: Becker, Matthias
last_name: Becker
citation:
ama: 'Pasic F, Becker M. Domain-specific Language for Condition Monitoring Software
Development. In: 2022 IEEE 27th International Conference on Emerging Technologies
and Factory Automation (ETFA). IEEE; 2022. doi:10.1109/etfa52439.2022.9921730'
apa: Pasic, F., & Becker, M. (2022). Domain-specific Language for Condition
Monitoring Software Development. 2022 IEEE 27th International Conference on
Emerging Technologies and Factory Automation (ETFA). https://doi.org/10.1109/etfa52439.2022.9921730
bibtex: '@inproceedings{Pasic_Becker_2022, title={Domain-specific Language for Condition
Monitoring Software Development}, DOI={10.1109/etfa52439.2022.9921730},
booktitle={2022 IEEE 27th International Conference on Emerging Technologies and
Factory Automation (ETFA)}, publisher={IEEE}, author={Pasic, Faruk and Becker,
Matthias}, year={2022} }'
chicago: Pasic, Faruk, and Matthias Becker. “Domain-Specific Language for Condition
Monitoring Software Development.” In 2022 IEEE 27th International Conference
on Emerging Technologies and Factory Automation (ETFA). IEEE, 2022. https://doi.org/10.1109/etfa52439.2022.9921730.
ieee: 'F. Pasic and M. Becker, “Domain-specific Language for Condition Monitoring
Software Development,” 2022, doi: 10.1109/etfa52439.2022.9921730.'
mla: Pasic, Faruk, and Matthias Becker. “Domain-Specific Language for Condition
Monitoring Software Development.” 2022 IEEE 27th International Conference on
Emerging Technologies and Factory Automation (ETFA), IEEE, 2022, doi:10.1109/etfa52439.2022.9921730.
short: 'F. Pasic, M. Becker, in: 2022 IEEE 27th International Conference on Emerging
Technologies and Factory Automation (ETFA), IEEE, 2022.'
date_created: 2022-11-10T14:30:16Z
date_updated: 2022-11-10T14:30:42Z
department:
- _id: '241'
- _id: '76'
doi: 10.1109/etfa52439.2022.9921730
publication: 2022 IEEE 27th International Conference on Emerging Technologies and
Factory Automation (ETFA)
publication_status: published
publisher: IEEE
status: public
title: Domain-specific Language for Condition Monitoring Software Development
type: conference
user_id: '49576'
year: '2022'
...
---
_id: '34047'
abstract:
- lang: eng
text: "News articles both shape and reflect public opinion across the political\r\nspectrum.
Analyzing them for social bias can thus provide valuable insights,\r\nsuch as
prevailing stereotypes in society and the media, which are often\r\nadopted by
NLP models trained on respective data. Recent work has relied on\r\nword embedding
bias measures, such as WEAT. However, several representation\r\nissues of embeddings
can harm the measures' accuracy, including low-resource\r\nsettings and token
frequency differences. In this work, we study what kind of\r\nembedding algorithm
serves best to accurately measure types of social bias\r\nknown to exist in US
online news articles. To cover the whole spectrum of\r\npolitical bias in the
US, we collect 500k articles and review psychology\r\nliterature with respect
to expected social bias. We then quantify social bias\r\nusing WEAT along with
embedding algorithms that account for the aforementioned\r\nissues. We compare
how models trained with the algorithms on news articles\r\nrepresent the expected
social bias. Our results suggest that the standard way\r\nto quantify bias does
not align well with knowledge from psychology. While the\r\nproposed algorithms
reduce the~gap, they still do not fully match the\r\nliterature."
author:
- first_name: Maximilian
full_name: Spliethöver, Maximilian
last_name: Spliethöver
- first_name: Maximilian
full_name: Keiff, Maximilian
last_name: Keiff
- first_name: Henning
full_name: Wachsmuth, Henning
last_name: Wachsmuth
citation:
ama: 'Spliethöver M, Keiff M, Wachsmuth H. No Word Embedding Model Is Perfect: Evaluating
the Representation Accuracy for Social Bias in the Media. In: Proceedings
of The 2022 Conference on Empirical Methods in Natural Language Processing (EMNLP
2022). Association for Computational Linguistics; 2022.'
apa: 'Spliethöver, M., Keiff, M., & Wachsmuth, H. (2022). No Word Embedding
Model Is Perfect: Evaluating the Representation Accuracy for Social Bias in the
Media. Proceedings of The 2022 Conference on Empirical Methods in Natural Language
Processing (EMNLP 2022). The 2022 Conference on Empirical Methods in Natural
Language Processing (EMNLP 2022), Abu Dhabi.'
bibtex: '@inproceedings{Spliethöver_Keiff_Wachsmuth_2022, title={No Word Embedding
Model Is Perfect: Evaluating the Representation Accuracy for Social Bias in the
Media}, booktitle={Proceedings of The 2022 Conference on Empirical Methods in
Natural Language Processing (EMNLP 2022)}, publisher={Association for Computational
Linguistics}, author={Spliethöver, Maximilian and Keiff, Maximilian and Wachsmuth,
Henning}, year={2022} }'
chicago: 'Spliethöver, Maximilian, Maximilian Keiff, and Henning Wachsmuth. “No
Word Embedding Model Is Perfect: Evaluating the Representation Accuracy for Social
Bias in the Media.” In Proceedings of The 2022 Conference on Empirical Methods
in Natural Language Processing (EMNLP 2022). Association for Computational
Linguistics, 2022.'
ieee: 'M. Spliethöver, M. Keiff, and H. Wachsmuth, “No Word Embedding Model Is Perfect:
Evaluating the Representation Accuracy for Social Bias in the Media,” presented
at the The 2022 Conference on Empirical Methods in Natural Language Processing
(EMNLP 2022), Abu Dhabi, 2022.'
mla: 'Spliethöver, Maximilian, et al. “No Word Embedding Model Is Perfect: Evaluating
the Representation Accuracy for Social Bias in the Media.” Proceedings of
The 2022 Conference on Empirical Methods in Natural Language Processing (EMNLP
2022), Association for Computational Linguistics, 2022.'
short: 'M. Spliethöver, M. Keiff, H. Wachsmuth, in: Proceedings of The 2022 Conference
on Empirical Methods in Natural Language Processing (EMNLP 2022), Association
for Computational Linguistics, 2022.'
conference:
end_date: 2022-12-11
location: Abu Dhabi
name: The 2022 Conference on Empirical Methods in Natural Language Processing (EMNLP
2022)
start_date: 2022-12-07
date_created: 2022-11-10T08:28:53Z
date_updated: 2022-11-11T12:49:47Z
department:
- _id: '600'
extern: '1'
external_id:
arxiv:
- '2211.03634'
language:
- iso: eng
publication: Proceedings of The 2022 Conference on Empirical Methods in Natural Language
Processing (EMNLP 2022)
publisher: Association for Computational Linguistics
status: public
title: 'No Word Embedding Model Is Perfect: Evaluating the Representation Accuracy
for Social Bias in the Media'
type: conference
user_id: '84035'
year: '2022'
...