---
_id: '60189'
abstract:
- lang: eng
  text: <jats:title>Abstract</jats:title><jats:p>Several state‐of‐the‐art algorithms
    for semi‐structured hexahedral meshing involve a so called <jats:italic>quantization</jats:italic>
    step to decide on the integer DoFs of the meshing problem, corresponding to the
    number of hexahedral elements to embed into certain regions of the domain. Existing
    reliable methods for quantization are based on solving a sequence of <jats:italic>integer
    quadratic programs</jats:italic> (IQP). Solving these in a timely and predictable
    manner with general‐purpose solvers is a challenge, even more so in the open‐source
    field. We present here an alternative robust and efficient quantization scheme
    that is instead based on solving a series of continuous <jats:italic>linear programs</jats:italic>
    (LP), for which solver availability and efficiency are not an issue. In our formulation,
    such LPs are used to determine where inflation or deflation of virtual hexahedral
    sheets are favorable. We compare our method to two implementations of the former
    IQP formulation (using a commercial and an open‐source MIP solver, respectively),
    finding that (a) the solutions found by our method are near‐optimal or optimal
    in most cases, (b) these solutions are found within a much more predictable time
    frame, and (c) the state of the art run time is outperformed, in the case of using
    the open‐source solver by orders of magnitude.</jats:p>
author:
- first_name: Hendrik
  full_name: Brückler, Hendrik
  id: '115694'
  last_name: Brückler
- first_name: David
  full_name: Bommes, David
  last_name: Bommes
- first_name: Marcel
  full_name: Campen, Marcel
  id: '114904'
  last_name: Campen
  orcid: 0000-0003-2340-3462
citation:
  ama: Brückler H, Bommes D, Campen M. Integer‐Sheet‐Pump Quantization for Hexahedral
    Meshing. <i>Comput Graph Forum</i>. 2024;43(5). doi:<a href="https://doi.org/10.1111/cgf.15131">10.1111/cgf.15131</a>
  apa: Brückler, H., Bommes, D., &#38; Campen, M. (2024). Integer‐Sheet‐Pump Quantization
    for Hexahedral Meshing. <i>Comput. Graph. Forum</i>, <i>43</i>(5). <a href="https://doi.org/10.1111/cgf.15131">https://doi.org/10.1111/cgf.15131</a>
  bibtex: '@article{Brückler_Bommes_Campen_2024, title={Integer‐Sheet‐Pump Quantization
    for Hexahedral Meshing}, volume={43}, DOI={<a href="https://doi.org/10.1111/cgf.15131">10.1111/cgf.15131</a>},
    number={5}, journal={Comput. Graph. Forum}, publisher={Wiley}, author={Brückler,
    Hendrik and Bommes, David and Campen, Marcel}, year={2024} }'
  chicago: Brückler, Hendrik, David Bommes, and Marcel Campen. “Integer‐Sheet‐Pump
    Quantization for Hexahedral Meshing.” <i>Comput. Graph. Forum</i> 43, no. 5 (2024).
    <a href="https://doi.org/10.1111/cgf.15131">https://doi.org/10.1111/cgf.15131</a>.
  ieee: 'H. Brückler, D. Bommes, and M. Campen, “Integer‐Sheet‐Pump Quantization for
    Hexahedral Meshing,” <i>Comput. Graph. Forum</i>, vol. 43, no. 5, 2024, doi: <a
    href="https://doi.org/10.1111/cgf.15131">10.1111/cgf.15131</a>.'
  mla: Brückler, Hendrik, et al. “Integer‐Sheet‐Pump Quantization for Hexahedral Meshing.”
    <i>Comput. Graph. Forum</i>, vol. 43, no. 5, Wiley, 2024, doi:<a href="https://doi.org/10.1111/cgf.15131">10.1111/cgf.15131</a>.
  short: H. Brückler, D. Bommes, M. Campen, Comput. Graph. Forum 43 (2024).
date_created: 2025-06-11T13:47:29Z
date_updated: 2025-06-23T09:01:46Z
department:
- _id: '969'
doi: 10.1111/cgf.15131
extern: '1'
intvolume: '        43'
issue: '5'
language:
- iso: eng
publication: Comput. Graph. Forum
publication_identifier:
  issn:
  - 0167-7055
  - 1467-8659
publication_status: published
publisher: Wiley
status: public
title: Integer‐Sheet‐Pump Quantization for Hexahedral Meshing
type: journal_article
user_id: '114904'
volume: 43
year: '2024'
...
---
_id: '60240'
author:
- first_name: Ingmar
  full_name: Ludwig, Ingmar
  id: '116667'
  last_name: Ludwig
- first_name: Marcel
  full_name: Campen, Marcel
  id: '114904'
  last_name: Campen
  orcid: 0000-0003-2340-3462
citation:
  ama: Ludwig I, Campen M. Strictly Conservative Neural Implicits. <i>Comput Graph
    Forum</i>. 2024;43(7):i–xxii. doi:<a href="https://doi.org/10.1111/CGF.15241">10.1111/CGF.15241</a>
  apa: Ludwig, I., &#38; Campen, M. (2024). Strictly Conservative Neural Implicits.
    <i>Comput. Graph. Forum</i>, <i>43</i>(7), i–xxii. <a href="https://doi.org/10.1111/CGF.15241">https://doi.org/10.1111/CGF.15241</a>
  bibtex: '@article{Ludwig_Campen_2024, title={Strictly Conservative Neural Implicits},
    volume={43}, DOI={<a href="https://doi.org/10.1111/CGF.15241">10.1111/CGF.15241</a>},
    number={7}, journal={Comput. Graph. Forum}, author={Ludwig, Ingmar and Campen,
    Marcel}, year={2024}, pages={i–xxii} }'
  chicago: 'Ludwig, Ingmar, and Marcel Campen. “Strictly Conservative Neural Implicits.”
    <i>Comput. Graph. Forum</i> 43, no. 7 (2024): i–xxii. <a href="https://doi.org/10.1111/CGF.15241">https://doi.org/10.1111/CGF.15241</a>.'
  ieee: 'I. Ludwig and M. Campen, “Strictly Conservative Neural Implicits,” <i>Comput.
    Graph. Forum</i>, vol. 43, no. 7, pp. i–xxii, 2024, doi: <a href="https://doi.org/10.1111/CGF.15241">10.1111/CGF.15241</a>.'
  mla: Ludwig, Ingmar, and Marcel Campen. “Strictly Conservative Neural Implicits.”
    <i>Comput. Graph. Forum</i>, vol. 43, no. 7, 2024, pp. i–xxii, doi:<a href="https://doi.org/10.1111/CGF.15241">10.1111/CGF.15241</a>.
  short: I. Ludwig, M. Campen, Comput. Graph. Forum 43 (2024) i–xxii.
date_created: 2025-06-17T07:46:09Z
date_updated: 2025-06-23T09:01:59Z
department:
- _id: '969'
doi: 10.1111/CGF.15241
extern: '1'
intvolume: '        43'
issue: '7'
language:
- iso: eng
page: i–xxii
publication: Comput. Graph. Forum
status: public
title: Strictly Conservative Neural Implicits
type: journal_article
user_id: '114904'
volume: 43
year: '2024'
...
---
_id: '60314'
abstract:
- lang: eng
  text: <jats:p>A method for the construction of bijective volumetric maps between
    3D shapes is presented. Arbitrary shapes of ball-topology are supported, overcoming
    restrictions of previous methods to convex or star-shaped targets. In essence,
    the mapping problem is decomposed into a set of simpler mapping problems, each
    of which can be solved with previous methods for discrete star-shaped mapping
    problems. Addressing the key challenges in this endeavor, algorithms are described
    to reliably construct structurally compatible partitions of two shapes with constraints
    regarding star-shapedness and to compute a parsimonious common refinement of two
    triangulations.</jats:p>
author:
- first_name: Steffen
  full_name: Hinderink, Steffen
  id: '116615'
  last_name: Hinderink
- first_name: Hendrik
  full_name: Brückler, Hendrik
  id: '115694'
  last_name: Brückler
- first_name: Marcel
  full_name: Campen, Marcel
  id: '114904'
  last_name: Campen
  orcid: 0000-0003-2340-3462
citation:
  ama: Hinderink S, Brückler H, Campen M. Bijective Volumetric Mapping via Star Decomposition.
    <i>ACM Transactions on Graphics</i>. 2024;43(6):1-11. doi:<a href="https://doi.org/10.1145/3687950">10.1145/3687950</a>
  apa: Hinderink, S., Brückler, H., &#38; Campen, M. (2024). Bijective Volumetric
    Mapping via Star Decomposition. <i>ACM Transactions on Graphics</i>, <i>43</i>(6),
    1–11. <a href="https://doi.org/10.1145/3687950">https://doi.org/10.1145/3687950</a>
  bibtex: '@article{Hinderink_Brückler_Campen_2024, title={Bijective Volumetric Mapping
    via Star Decomposition}, volume={43}, DOI={<a href="https://doi.org/10.1145/3687950">10.1145/3687950</a>},
    number={6}, journal={ACM Transactions on Graphics}, publisher={Association for
    Computing Machinery (ACM)}, author={Hinderink, Steffen and Brückler, Hendrik and
    Campen, Marcel}, year={2024}, pages={1–11} }'
  chicago: 'Hinderink, Steffen, Hendrik Brückler, and Marcel Campen. “Bijective Volumetric
    Mapping via Star Decomposition.” <i>ACM Transactions on Graphics</i> 43, no. 6
    (2024): 1–11. <a href="https://doi.org/10.1145/3687950">https://doi.org/10.1145/3687950</a>.'
  ieee: 'S. Hinderink, H. Brückler, and M. Campen, “Bijective Volumetric Mapping via
    Star Decomposition,” <i>ACM Transactions on Graphics</i>, vol. 43, no. 6, pp.
    1–11, 2024, doi: <a href="https://doi.org/10.1145/3687950">10.1145/3687950</a>.'
  mla: Hinderink, Steffen, et al. “Bijective Volumetric Mapping via Star Decomposition.”
    <i>ACM Transactions on Graphics</i>, vol. 43, no. 6, Association for Computing
    Machinery (ACM), 2024, pp. 1–11, doi:<a href="https://doi.org/10.1145/3687950">10.1145/3687950</a>.
  short: S. Hinderink, H. Brückler, M. Campen, ACM Transactions on Graphics 43 (2024)
    1–11.
date_created: 2025-06-23T09:09:51Z
date_updated: 2025-07-14T12:33:54Z
department:
- _id: '969'
doi: 10.1145/3687950
extern: '1'
intvolume: '        43'
issue: '6'
language:
- iso: eng
page: 1-11
publication: ACM Transactions on Graphics
publication_identifier:
  issn:
  - 0730-0301
  - 1557-7368
publication_status: published
publisher: Association for Computing Machinery (ACM)
status: public
title: Bijective Volumetric Mapping via Star Decomposition
type: journal_article
user_id: '117512'
volume: 43
year: '2024'
...
---
_id: '60331'
abstract:
- lang: eng
  text: "<jats:p>\r\n            We present a novel algorithm to map ball-topology
    tetrahedral meshes onto star-shaped domains with guarantees regarding bijectivity.
    Our algorithm is based on the recently introduced idea of Shrink-and-Expand, where
    images of interior vertices are initially clustered at one point (Shrink-), before
    being sequentially moved to non-degenerate positions yielding a bijective map
    (-and-Expand). In this context, we introduce the concept of the\r\n            <jats:italic>cluster
    mesh</jats:italic>\r\n            , i.e. the unexpanded interior mesh consisting
    of geometrically degenerate simplices. Using local, per-vertex connectivity information
    solely from the cluster mesh, we show that a viable expansion sequence guaranteed
    to produce a bijective map can always be found as long as the mesh is\r\n            <jats:italic>shellable.</jats:italic>\r\n
    \           In addition to robustness guarantees for this ubiquitous class of
    inputs, other practically relevant benefits include improved parsimony and reduced
    algorithmic complexity. While inheriting some of the worst-case high run time
    requirements of the state of the art, significant acceleration for the average
    case is experimentally demonstrated.\r\n          </jats:p>"
author:
- first_name: Valentin Zénon
  full_name: Nigolian, Valentin Zénon
  last_name: Nigolian
- first_name: Marcel
  full_name: Campen, Marcel
  id: '114904'
  last_name: Campen
  orcid: 0000-0003-2340-3462
- first_name: David
  full_name: Bommes, David
  last_name: Bommes
citation:
  ama: Nigolian VZ, Campen M, Bommes D. A Progressive Embedding Approach to Bijective
    Tetrahedral Maps driven by Cluster Mesh Topology. <i>ACM Transactions on Graphics</i>.
    2024;43(6):1-14. doi:<a href="https://doi.org/10.1145/3687992">10.1145/3687992</a>
  apa: Nigolian, V. Z., Campen, M., &#38; Bommes, D. (2024). A Progressive Embedding
    Approach to Bijective Tetrahedral Maps driven by Cluster Mesh Topology. <i>ACM
    Transactions on Graphics</i>, <i>43</i>(6), 1–14. <a href="https://doi.org/10.1145/3687992">https://doi.org/10.1145/3687992</a>
  bibtex: '@article{Nigolian_Campen_Bommes_2024, title={A Progressive Embedding Approach
    to Bijective Tetrahedral Maps driven by Cluster Mesh Topology}, volume={43}, DOI={<a
    href="https://doi.org/10.1145/3687992">10.1145/3687992</a>}, number={6}, journal={ACM
    Transactions on Graphics}, publisher={Association for Computing Machinery (ACM)},
    author={Nigolian, Valentin Zénon and Campen, Marcel and Bommes, David}, year={2024},
    pages={1–14} }'
  chicago: 'Nigolian, Valentin Zénon, Marcel Campen, and David Bommes. “A Progressive
    Embedding Approach to Bijective Tetrahedral Maps Driven by Cluster Mesh Topology.”
    <i>ACM Transactions on Graphics</i> 43, no. 6 (2024): 1–14. <a href="https://doi.org/10.1145/3687992">https://doi.org/10.1145/3687992</a>.'
  ieee: 'V. Z. Nigolian, M. Campen, and D. Bommes, “A Progressive Embedding Approach
    to Bijective Tetrahedral Maps driven by Cluster Mesh Topology,” <i>ACM Transactions
    on Graphics</i>, vol. 43, no. 6, pp. 1–14, 2024, doi: <a href="https://doi.org/10.1145/3687992">10.1145/3687992</a>.'
  mla: Nigolian, Valentin Zénon, et al. “A Progressive Embedding Approach to Bijective
    Tetrahedral Maps Driven by Cluster Mesh Topology.” <i>ACM Transactions on Graphics</i>,
    vol. 43, no. 6, Association for Computing Machinery (ACM), 2024, pp. 1–14, doi:<a
    href="https://doi.org/10.1145/3687992">10.1145/3687992</a>.
  short: V.Z. Nigolian, M. Campen, D. Bommes, ACM Transactions on Graphics 43 (2024)
    1–14.
date_created: 2025-06-23T10:32:28Z
date_updated: 2025-07-14T12:48:45Z
department:
- _id: '969'
doi: 10.1145/3687992
extern: '1'
intvolume: '        43'
issue: '6'
language:
- iso: eng
page: 1-14
publication: ACM Transactions on Graphics
publication_identifier:
  issn:
  - 0730-0301
  - 1557-7368
publication_status: published
publisher: Association for Computing Machinery (ACM)
status: public
title: A Progressive Embedding Approach to Bijective Tetrahedral Maps driven by Cluster
  Mesh Topology
type: journal_article
user_id: '117512'
volume: 43
year: '2024'
...
---
_id: '57085'
abstract:
- lang: eng
  text: We propose an approach for simultaneous diarization and separation of meeting
    data. It consists of a complex Angular Central Gaussian Mixture Model (cACGMM)
    for speech source separation, and a von-Mises-Fisher Mixture Model (VMFMM) for
    diarization in a joint statistical framework. Through the integration, both spatial
    and spectral information are exploited for diarization and separation. We also
    develop a method for counting the number of active speakers in a segment of a
    meeting to support block-wise processing. While the total number of speakers in
    a meeting may be known, it is usually not known on a per-segment level. With the
    proposed speaker counting, joint diarization and source separation can be done
    segment-by-segment, and the permutation problem across segments is solved, thus
    allowing for block-online processing in the future. Experimental results on the
    LibriCSS meeting corpus show that the integrated approach outperforms a cascaded
    approach of diarization and speech enhancement in terms of WER, both on a per-segment
    and on a per-meeting level.
author:
- first_name: Tobias
  full_name: Cord-Landwehr, Tobias
  id: '44393'
  last_name: Cord-Landwehr
- first_name: Christoph
  full_name: Boeddeker, Christoph
  id: '40767'
  last_name: Boeddeker
- first_name: Reinhold
  full_name: Haeb-Umbach, Reinhold
  id: '242'
  last_name: Haeb-Umbach
citation:
  ama: 'Cord-Landwehr T, Boeddeker C, Haeb-Umbach R. Simultaneous Diarization and
    Separation of Meetings through the Integration of Statistical Mixture Models.
    In: <i>ICASSP 2025 - 2025 IEEE International Conference on Acoustics, Speech and
    Signal Processing (ICASSP)</i>. ; 2024. doi:<a href="https://doi.org/10.1109/ICASSP49660.2025.10888445">10.1109/ICASSP49660.2025.10888445</a>'
  apa: Cord-Landwehr, T., Boeddeker, C., &#38; Haeb-Umbach, R. (2024). Simultaneous
    Diarization and Separation of Meetings through the Integration of Statistical
    Mixture Models. <i>ICASSP 2025 - 2025 IEEE International Conference on Acoustics,
    Speech and Signal Processing (ICASSP)</i>. 2025 IEEE International Conference
    on Acoustics, Speech and Signal Processing (ICASSP), Hyderabad, India. <a href="https://doi.org/10.1109/ICASSP49660.2025.10888445">https://doi.org/10.1109/ICASSP49660.2025.10888445</a>
  bibtex: '@inproceedings{Cord-Landwehr_Boeddeker_Haeb-Umbach_2024, title={Simultaneous
    Diarization and Separation of Meetings through the Integration of Statistical
    Mixture Models}, DOI={<a href="https://doi.org/10.1109/ICASSP49660.2025.10888445">10.1109/ICASSP49660.2025.10888445</a>},
    booktitle={ICASSP 2025 - 2025 IEEE International Conference on Acoustics, Speech
    and Signal Processing (ICASSP)}, author={Cord-Landwehr, Tobias and Boeddeker,
    Christoph and Haeb-Umbach, Reinhold}, year={2024} }'
  chicago: Cord-Landwehr, Tobias, Christoph Boeddeker, and Reinhold Haeb-Umbach. “Simultaneous
    Diarization and Separation of Meetings through the Integration of Statistical
    Mixture Models.” In <i>ICASSP 2025 - 2025 IEEE International Conference on Acoustics,
    Speech and Signal Processing (ICASSP)</i>, 2024. <a href="https://doi.org/10.1109/ICASSP49660.2025.10888445">https://doi.org/10.1109/ICASSP49660.2025.10888445</a>.
  ieee: 'T. Cord-Landwehr, C. Boeddeker, and R. Haeb-Umbach, “Simultaneous Diarization
    and Separation of Meetings through the Integration of Statistical Mixture Models,”
    presented at the 2025 IEEE International Conference on Acoustics, Speech and Signal
    Processing (ICASSP), Hyderabad, India, 2024, doi: <a href="https://doi.org/10.1109/ICASSP49660.2025.10888445">10.1109/ICASSP49660.2025.10888445</a>.'
  mla: Cord-Landwehr, Tobias, et al. “Simultaneous Diarization and Separation of Meetings
    through the Integration of Statistical Mixture Models.” <i>ICASSP 2025 - 2025
    IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)</i>,
    2024, doi:<a href="https://doi.org/10.1109/ICASSP49660.2025.10888445">10.1109/ICASSP49660.2025.10888445</a>.
  short: 'T. Cord-Landwehr, C. Boeddeker, R. Haeb-Umbach, in: ICASSP 2025 - 2025 IEEE
    International Conference on Acoustics, Speech and Signal Processing (ICASSP),
    2024.'
conference:
  location: Hyderabad, India
  name: 2025 IEEE International Conference on Acoustics, Speech and Signal Processing
    (ICASSP)
date_created: 2024-11-14T09:32:38Z
date_updated: 2025-08-14T08:12:22Z
ddc:
- '000'
department:
- _id: '54'
doi: 10.1109/ICASSP49660.2025.10888445
file:
- access_level: closed
  content_type: application/pdf
  creator: cord
  date_created: 2025-08-14T08:11:57Z
  date_updated: 2025-08-14T08:11:57Z
  file_id: '60930'
  file_name: main.pdf
  file_size: 259907
  relation: main_file
  success: 1
file_date_updated: 2025-08-14T08:11:57Z
has_accepted_license: '1'
keyword:
- diarization
- source separation
- mixture model
- meeting
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/pdf/2410.21455
oa: '1'
project:
- _id: '52'
  name: 'PC2: Computing Resources Provided by the Paderborn Center for Parallel Computing'
- _id: '508'
  name: Automatische Transkription von Gesprächssituationen
publication: ICASSP 2025 - 2025 IEEE International Conference on Acoustics, Speech
  and Signal Processing (ICASSP)
status: public
title: Simultaneous Diarization and Separation of Meetings through the Integration
  of Statistical Mixture Models
type: conference
user_id: '44393'
year: '2024'
...
---
_id: '53659'
author:
- first_name: Tobias
  full_name: Cord-Landwehr, Tobias
  id: '44393'
  last_name: Cord-Landwehr
- first_name: Christoph
  full_name: Boeddeker, Christoph
  id: '40767'
  last_name: Boeddeker
- first_name: Cătălin
  full_name: Zorilă, Cătălin
  last_name: Zorilă
- first_name: Rama
  full_name: Doddipatla, Rama
  last_name: Doddipatla
- first_name: Reinhold
  full_name: Haeb-Umbach, Reinhold
  id: '242'
  last_name: Haeb-Umbach
citation:
  ama: 'Cord-Landwehr T, Boeddeker C, Zorilă C, Doddipatla R, Haeb-Umbach R. Geodesic
    Interpolation of Frame-Wise Speaker Embeddings for the Diarization of Meeting
    Scenarios. In: <i>ICASSP 2024 - 2024 IEEE International Conference on Acoustics,
    Speech and Signal Processing (ICASSP)</i>. IEEE; 2024. doi:<a href="https://doi.org/10.1109/icassp48485.2024.10445911">10.1109/icassp48485.2024.10445911</a>'
  apa: Cord-Landwehr, T., Boeddeker, C., Zorilă, C., Doddipatla, R., &#38; Haeb-Umbach,
    R. (2024). Geodesic Interpolation of Frame-Wise Speaker Embeddings for the Diarization
    of Meeting Scenarios. <i>ICASSP 2024 - 2024 IEEE International Conference on Acoustics,
    Speech and Signal Processing (ICASSP)</i>. 2024 IEEE International Conference
    on Acoustics, Speech, and Signal Processing (ICASSP), Seoul. <a href="https://doi.org/10.1109/icassp48485.2024.10445911">https://doi.org/10.1109/icassp48485.2024.10445911</a>
  bibtex: '@inproceedings{Cord-Landwehr_Boeddeker_Zorilă_Doddipatla_Haeb-Umbach_2024,
    title={Geodesic Interpolation of Frame-Wise Speaker Embeddings for the Diarization
    of Meeting Scenarios}, DOI={<a href="https://doi.org/10.1109/icassp48485.2024.10445911">10.1109/icassp48485.2024.10445911</a>},
    booktitle={ICASSP 2024 - 2024 IEEE International Conference on Acoustics, Speech
    and Signal Processing (ICASSP)}, publisher={IEEE}, author={Cord-Landwehr, Tobias
    and Boeddeker, Christoph and Zorilă, Cătălin and Doddipatla, Rama and Haeb-Umbach,
    Reinhold}, year={2024} }'
  chicago: Cord-Landwehr, Tobias, Christoph Boeddeker, Cătălin Zorilă, Rama Doddipatla,
    and Reinhold Haeb-Umbach. “Geodesic Interpolation of Frame-Wise Speaker Embeddings
    for the Diarization of Meeting Scenarios.” In <i>ICASSP 2024 - 2024 IEEE International
    Conference on Acoustics, Speech and Signal Processing (ICASSP)</i>. IEEE, 2024.
    <a href="https://doi.org/10.1109/icassp48485.2024.10445911">https://doi.org/10.1109/icassp48485.2024.10445911</a>.
  ieee: 'T. Cord-Landwehr, C. Boeddeker, C. Zorilă, R. Doddipatla, and R. Haeb-Umbach,
    “Geodesic Interpolation of Frame-Wise Speaker Embeddings for the Diarization of
    Meeting Scenarios,” presented at the 2024 IEEE International Conference on Acoustics,
    Speech, and Signal Processing (ICASSP), Seoul, 2024, doi: <a href="https://doi.org/10.1109/icassp48485.2024.10445911">10.1109/icassp48485.2024.10445911</a>.'
  mla: Cord-Landwehr, Tobias, et al. “Geodesic Interpolation of Frame-Wise Speaker
    Embeddings for the Diarization of Meeting Scenarios.” <i>ICASSP 2024 - 2024 IEEE
    International Conference on Acoustics, Speech and Signal Processing (ICASSP)</i>,
    IEEE, 2024, doi:<a href="https://doi.org/10.1109/icassp48485.2024.10445911">10.1109/icassp48485.2024.10445911</a>.
  short: 'T. Cord-Landwehr, C. Boeddeker, C. Zorilă, R. Doddipatla, R. Haeb-Umbach,
    in: ICASSP 2024 - 2024 IEEE International Conference on Acoustics, Speech and
    Signal Processing (ICASSP), IEEE, 2024.'
conference:
  location: Seoul
  name: 2024 IEEE International Conference on Acoustics, Speech, and Signal Processing
    (ICASSP)
date_created: 2024-04-25T12:57:22Z
date_updated: 2025-08-14T08:11:07Z
ddc:
- '000'
department:
- _id: '54'
doi: 10.1109/icassp48485.2024.10445911
file:
- access_level: closed
  content_type: application/pdf
  creator: cord
  date_created: 2025-08-14T08:09:52Z
  date_updated: 2025-08-14T08:09:52Z
  file_id: '60929'
  file_name: main.pdf
  file_size: 254478
  relation: main_file
  success: 1
file_date_updated: 2025-08-14T08:09:52Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '52'
  name: 'PC2: Computing Resources Provided by the Paderborn Center for Parallel Computing'
- _id: '508'
  name: Automatische Transkription von Gesprächssituationen
publication: ICASSP 2024 - 2024 IEEE International Conference on Acoustics, Speech
  and Signal Processing (ICASSP)
publication_status: published
publisher: IEEE
status: public
title: Geodesic Interpolation of Frame-Wise Speaker Embeddings for the Diarization
  of Meeting Scenarios
type: conference
user_id: '44393'
year: '2024'
...
---
_id: '57864'
abstract:
- lang: eng
  text: This book includes the proceedings of the 21st International Conference on
    Smart Technologies & Education (STE2024). The "International Conference on Smart
    Technologies & Education" (STE) is an annual global meeting dedicated to the fundamentals,
    applications, and experiences in the field of Smart Technologies, Online, Remote,
    and Virtual Engineering, Virtual Instrumentation, and other related new technologies.
    Nowadays, online and smart technologies are the core of most fields of engineering
    and the whole society. Consequently, the motto of this year’s STE2024 was "Smart
    Technologies for a Sustainable Future". The STE conference is the successor of
    the long-standing annual REV Conferences and the annual meeting of the International
    Association of Online Engineering (IAOE) together with the EduNet World Association
    (EWA) and the International Education Network (EduNet). In a globally connected
    world, the interest in online collaboration, teleworking, remote services, and
    other digital working environments is rapidly increasing. In response to that,
    the general objective of this conference is to contribute and discuss fundamentals,
    applications, and experiences in the field of Online and Remote Engineering, Virtual
    Instrumentation, and other related new technologies like Cross Reality, Open Science
    and Big Data, Internet of Things and Industrial Internet of Things, Industry 4.0,
    Cyber Security, and M2M and Smart Objects. Another objective of the conference
    is to discuss guidelines and new concepts for engineering education in higher
    and vocational education institutions, including emerging technologies in learning,
    MOOCs and MOOLs, and Open Resources. This year, STE2024 has been organized in
    Helsinki, Finland as an onsite event supporting remote presentations, from March
    6 until March 8, 2024. The co-organizers of STE2024 were the Arcada University
    of Applied Sciences, the International Association of Online Engineering (IAOE)
    together with the Global Online Laboratory Consortium (GOLC), the International
    Education Network (EduNet), and the EduNet World Association (EWA). STE2024 has
    attracted 140 scientists and industrial leaders from more than 40 countries
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. Extended Results for Effectiveness Study of an Augmented
    Reality App as Preparation Tool for Electrical Engineering Laboratory Courses.
    In: <i>Smart Technologies for a Sustainable Future: Proceedings of the 21st International
    Conference on Smart Technologies &#38; Education. Volume 1</i>. Vol 1. 1. Springer
    Nature; 2024:297.'
  apa: 'Alptekin, M., &#38; Temmen, K. (2024). Extended Results for Effectiveness
    Study of an Augmented Reality App as Preparation Tool for Electrical Engineering
    Laboratory Courses. <i>Smart Technologies for a Sustainable Future: Proceedings
    of the 21st International Conference on Smart Technologies &#38; Education. Volume
    1</i>, <i>1</i>, 297.'
  bibtex: '@inproceedings{Alptekin_Temmen_2024, series={1}, title={Extended Results
    for Effectiveness Study of an Augmented Reality App as Preparation Tool for Electrical
    Engineering Laboratory Courses}, volume={1}, booktitle={Smart Technologies for
    a Sustainable Future: Proceedings of the 21st International Conference on Smart
    Technologies &#38; Education. Volume 1}, publisher={Springer Nature}, author={Alptekin,
    Mesut and Temmen, Katrin}, year={2024}, pages={297}, collection={1} }'
  chicago: 'Alptekin, Mesut, and Katrin Temmen. “Extended Results for Effectiveness
    Study of an Augmented Reality App as Preparation Tool for Electrical Engineering
    Laboratory Courses.” In <i>Smart Technologies for a Sustainable Future: Proceedings
    of the 21st International Conference on Smart Technologies &#38; Education. Volume
    1</i>, 1:297. 1. Springer Nature, 2024.'
  ieee: 'M. Alptekin and K. Temmen, “Extended Results for Effectiveness Study of an
    Augmented Reality App as Preparation Tool for Electrical Engineering Laboratory
    Courses,” in <i>Smart Technologies for a Sustainable Future: Proceedings of the
    21st International Conference on Smart Technologies &#38; Education. Volume 1</i>,
    2024, vol. 1, p. 297.'
  mla: 'Alptekin, Mesut, and Katrin Temmen. “Extended Results for Effectiveness Study
    of an Augmented Reality App as Preparation Tool for Electrical Engineering Laboratory
    Courses.” <i>Smart Technologies for a Sustainable Future: Proceedings of the 21st
    International Conference on Smart Technologies &#38; Education. Volume 1</i>,
    vol. 1, Springer Nature, 2024, p. 297.'
  short: 'M. Alptekin, K. Temmen, in: Smart Technologies for a Sustainable Future:
    Proceedings of the 21st International Conference on Smart Technologies &#38; Education.
    Volume 1, Springer Nature, 2024, p. 297.'
date_created: 2024-12-29T11:04:18Z
date_updated: 2025-08-19T08:49:14Z
department:
- _id: '34'
- _id: '300'
intvolume: '         1'
language:
- iso: eng
page: '297'
project:
- _id: '1387'
  name: DigiSelF - Digitalisierung als Herausforderung und Innovation in der Hochschullehre
publication: 'Smart Technologies for a Sustainable Future: Proceedings of the 21st
  International Conference on Smart Technologies & Education. Volume 1'
publication_identifier:
  isbn:
  - 3-031-61891-2 978-3-031-61891-8
publisher: Springer Nature
series_title: '1'
status: public
title: Extended Results for Effectiveness Study of an Augmented Reality App as Preparation
  Tool for Electrical Engineering Laboratory Courses
type: conference
user_id: '11763'
volume: 1
year: '2024'
...
---
_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. <i>Smart Technologies for a Sustainable Future</i>. Vol 1027.
    Springer Nature Switzerland; 2024:297–304. doi:<a href="https://doi.org/10.1007/978-3-031-61891-8_29">10.1007/978-3-031-61891-8_29</a>'
  apa: Alptekin, M., &#38; 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, &#38; K. Roos (Eds.), <i>Smart Technologies
    for a Sustainable Future</i> (Vol. 1027, pp. 297–304). Springer Nature Switzerland.
    <a href="https://doi.org/10.1007/978-3-031-61891-8_29">https://doi.org/10.1007/978-3-031-61891-8_29</a>
  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={<a href="https://doi.org/10.1007/978-3-031-61891-8_29">10.1007/978-3-031-61891-8_29</a>},
    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 <i>Smart Technologies for a Sustainable Future</i>, edited by Michael E. Auer,
    Reinhard Langmann, Dominik May, and Kim Roos, 1027:297–304. Cham: Springer Nature
    Switzerland, 2024. <a href="https://doi.org/10.1007/978-3-031-61891-8_29">https://doi.org/10.1007/978-3-031-61891-8_29</a>.'
  ieee: 'M. Alptekin and K. Temmen, “Effectiveness Study of an Augmented Reality App
    as Preparation Tool for Electrical Engineering Laboratory Courses,” in <i>Smart
    Technologies for a Sustainable Future</i>, 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.” <i>Smart
    Technologies for a Sustainable Future</i>, edited by Michael E. Auer et al., vol.
    1027, Springer Nature Switzerland, 2024, pp. 297–304, doi:<a href="https://doi.org/10.1007/978-3-031-61891-8_29">10.1007/978-3-031-61891-8_29</a>.
  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.
    <i>Applied Energy</i>. 2024;368. doi:<a href="https://doi.org/10.1016/j.apenergy.2024.123417">10.1016/j.apenergy.2024.123417</a>
  apa: Knorr, L., Schlosser, F., Horstmann, N., Divkovic, D., &#38; Meschede, H. (2024).
    Flexible operation and integration of high-temperature heat pumps using large
    temperature glides. <i>Applied Energy</i>, <i>368</i>, Article 123417. <a href="https://doi.org/10.1016/j.apenergy.2024.123417">https://doi.org/10.1016/j.apenergy.2024.123417</a>
  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={<a href="https://doi.org/10.1016/j.apenergy.2024.123417">10.1016/j.apenergy.2024.123417</a>},
    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.” <i>Applied Energy</i> 368 (2024). <a href="https://doi.org/10.1016/j.apenergy.2024.123417">https://doi.org/10.1016/j.apenergy.2024.123417</a>.
  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,” <i>Applied Energy</i>, vol. 368, Art. no. 123417, 2024, doi: <a href="https://doi.org/10.1016/j.apenergy.2024.123417">10.1016/j.apenergy.2024.123417</a>.'
  mla: Knorr, Lukas, et al. “Flexible Operation and Integration of High-Temperature
    Heat Pumps Using Large Temperature Glides.” <i>Applied Energy</i>, vol. 368, 123417,
    Elsevier BV, 2024, doi:<a href="https://doi.org/10.1016/j.apenergy.2024.123417">10.1016/j.apenergy.2024.123417</a>.
  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. <i>33rd USENIX Security Symposium, USENIX Security 2024, Philadelphia,
    PA, USA, August 14-16, 2024</i>. USENIX Association; 2024.'
  apa: Kostan, A., Olschar, S., Simko, L., &#38; Acar, Y. (2024). Exploring digital
    security and privacy in relative poverty in Germany through qualitative interviews.
    In D. Balzarotti &#38; W. Xu (Eds.), <i>33rd USENIX Security Symposium, USENIX
    Security 2024, Philadelphia, PA, USA, August 14-16, 2024</i>. 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 <i>33rd USENIX Security Symposium, USENIX Security 2024, Philadelphia,
    PA, USA, August 14-16, 2024</i>, 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
    <i>33rd USENIX Security Symposium, USENIX Security 2024, Philadelphia, PA, USA,
    August 14-16, 2024</i>, 2024.
  mla: Kostan, Anastassija, et al. “Exploring Digital Security and Privacy in Relative
    Poverty in Germany through Qualitative Interviews.” <i>33rd USENIX Security Symposium,
    USENIX Security 2024, Philadelphia, PA, USA, August 14-16, 2024</i>, 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. <i>Beiträge
    zum Mathematikuntericht 2024. 57. Jahrestagung der Gesellschaft für Didaktik der
    Mathematik</i>. ; 2024:207-210. doi:<a href="https://doi.ohttps://doi.org/10.37626/GA9783959872782.0
    rg/10.37626/GA9783959872782.0">https://doi.ohttps://doi.org/10.37626/GA9783959872782.0
    rg/10.37626/GA9783959872782.0</a>'
  apa: Häsel-Weide, U., &#38; 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, &#38; P. Scherer (Eds.), <i>Beiträge zum Mathematikuntericht 2024.
    57. Jahrestagung der Gesellschaft für Didaktik der Mathematik</i> (pp. 207–210).
    <a href="https://doi.ohttps://doi.org/10.37626/GA9783959872782.0 rg/10.37626/GA9783959872782.0">https://doi.ohttps://doi.org/10.37626/GA9783959872782.0
    rg/10.37626/GA9783959872782.0</a>
  bibtex: '@inbook{Häsel-Weide_Nührenbörger_2024, title={ Praktiken der Förderung
    im inklusiven Mathematikunterricht}, DOI={<a href="https://doi.ohttps://doi.org/10.37626/GA9783959872782.0
    rg/10.37626/GA9783959872782.0">https://doi.ohttps://doi.org/10.37626/GA9783959872782.0
    rg/10.37626/GA9783959872782.0</a>}, 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 <i>Beiträge zum Mathematikuntericht 2024. 57. Jahrestagung
    der Gesellschaft für Didaktik der Mathematik</i>, edited by P. Ebers, F. Rösken,
    B. Barzel, A. Büchter, F. Schacht, and P. Scherer, 207–10, 2024. <a href="https://doi.ohttps://doi.org/10.37626/GA9783959872782.0
    rg/10.37626/GA9783959872782.0">https://doi.ohttps://doi.org/10.37626/GA9783959872782.0
    rg/10.37626/GA9783959872782.0</a>.
  ieee: U. Häsel-Weide and M. Nührenbörger, “ Praktiken der Förderung im inklusiven
    Mathematikunterricht,” in <i>Beiträge zum Mathematikuntericht 2024. 57. Jahrestagung
    der Gesellschaft für Didaktik der Mathematik</i>, 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.” <i>Beiträge zum Mathematikuntericht 2024. 57. Jahrestagung
    der Gesellschaft für Didaktik der Mathematik</i>, edited by P. Ebers et al., 2024,
    pp. 207–10, doi:<a href="https://doi.ohttps://doi.org/10.37626/GA9783959872782.0
    rg/10.37626/GA9783959872782.0">https://doi.ohttps://doi.org/10.37626/GA9783959872782.0
    rg/10.37626/GA9783959872782.0</a>.
  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. <i>Theoretical Computer Science</i>. 2024;985.
    doi:<a href="https://doi.org/10.1016/j.tcs.2023.114352">10.1016/j.tcs.2023.114352</a>
  apa: Coy, S., Czumaj, A., Scheideler, C., Schneider, P., &#38; Werthmann, J. (2024).
    Routing Schemes for Hybrid Communication Networks. <i>Theoretical Computer Science</i>,
    <i>985</i>, Article 114352. <a href="https://doi.org/10.1016/j.tcs.2023.114352">https://doi.org/10.1016/j.tcs.2023.114352</a>
  bibtex: '@article{Coy_Czumaj_Scheideler_Schneider_Werthmann_2024, title={Routing
    Schemes for Hybrid Communication Networks}, volume={985}, DOI={<a href="https://doi.org/10.1016/j.tcs.2023.114352">10.1016/j.tcs.2023.114352</a>},
    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.” <i>Theoretical
    Computer Science</i> 985 (2024). <a href="https://doi.org/10.1016/j.tcs.2023.114352">https://doi.org/10.1016/j.tcs.2023.114352</a>.
  ieee: 'S. Coy, A. Czumaj, C. Scheideler, P. Schneider, and J. Werthmann, “Routing
    Schemes for Hybrid Communication Networks,” <i>Theoretical Computer Science</i>,
    vol. 985, Art. no. 114352, 2024, doi: <a href="https://doi.org/10.1016/j.tcs.2023.114352">10.1016/j.tcs.2023.114352</a>.'
  mla: Coy, Sam, et al. “Routing Schemes for Hybrid Communication Networks.” <i>Theoretical
    Computer Science</i>, vol. 985, 114352, Elsevier BV, 2024, doi:<a href="https://doi.org/10.1016/j.tcs.2023.114352">10.1016/j.tcs.2023.114352</a>.
  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.
    <i>EKAW 2024</i>. ; 2024.'
  apa: 'Qudus, U., Röder, M., Tatkeu Pekarou, F. L., Morim da Silva, A. A., &#38;
    Ngonga Ngomo, A.-C. (2024). FaVEL: Fact Validation Ensemble Learning. In M. Rospocher
    &#38; Mehwish Alam (Eds.), <i>EKAW 2024</i>.'
  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 <i>EKAW 2024</i>, 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 <i>EKAW 2024</i>,
    Amsterdam, Netherlands, 2024.'
  mla: 'Qudus, Umair, et al. “FaVEL: Fact Validation Ensemble Learning.” <i>EKAW 2024</i>,
    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:<a href="https://doi.org/10.1609/AAAI.V39I14.33651">10.1609/AAAI.V39I14.33651</a>'
  apa: 'Mahmood, Y., Hecher, M., &#38; Ngonga Ngomo, A.-C. (2024). <i>Dung’s Argumentation
    Framework: Unveiling the Expressive Power with  Inconsistent Databases</i>. <a
    href="https://doi.org/10.1609/AAAI.V39I14.33651">https://doi.org/10.1609/AAAI.V39I14.33651</a>'
  bibtex: '@inproceedings{Mahmood_Hecher_Ngonga Ngomo_2024, title={Dung’s Argumentation
    Framework: Unveiling the Expressive Power with  Inconsistent Databases}, DOI={<a
    href="https://doi.org/10.1609/AAAI.V39I14.33651">10.1609/AAAI.V39I14.33651</a>},
    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. <a href="https://doi.org/10.1609/AAAI.V39I14.33651">https://doi.org/10.1609/AAAI.V39I14.33651</a>.'
  ieee: 'Y. Mahmood, M. Hecher, and A.-C. Ngonga Ngomo, “Dung’s Argumentation Framework:
    Unveiling the Expressive Power with  Inconsistent Databases,” 2024, doi: <a href="https://doi.org/10.1609/AAAI.V39I14.33651">10.1609/AAAI.V39I14.33651</a>.'
  mla: 'Mahmood, Yasir, et al. <i>Dung’s Argumentation Framework: Unveiling the Expressive
    Power with  Inconsistent Databases</i>. 2024, doi:<a href="https://doi.org/10.1609/AAAI.V39I14.33651">10.1609/AAAI.V39I14.33651</a>.'
  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: <jats:p>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.</jats:p>
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: <i>Frontiers in Artificial Intelligence and Applications</i>.
    IOS Press; 2024. doi:<a href="https://doi.org/10.3233/faia240867">10.3233/faia240867</a>'
  apa: 'Fichte, J. K., Hecher, M., Mahmood, Y., &#38; Meier, A. (2024). Rejection
    in Abstract Argumentation: Harder Than Acceptance? In <i>Frontiers in Artificial
    Intelligence and Applications</i>. ECAI} 2024 - 27th European Conference on Artificial
    Intelligence, Santiago de Compostela, Spain. IOS Press. <a href="https://doi.org/10.3233/faia240867">https://doi.org/10.3233/faia240867</a>'
  bibtex: '@inbook{Fichte_Hecher_Mahmood_Meier_2024, title={Rejection in Abstract
    Argumentation: Harder Than Acceptance?}, DOI={<a href="https://doi.org/10.3233/faia240867">10.3233/faia240867</a>},
    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 <i>Frontiers in Artificial
    Intelligence and Applications</i>. IOS Press, 2024. <a href="https://doi.org/10.3233/faia240867">https://doi.org/10.3233/faia240867</a>.'
  ieee: 'J. K. Fichte, M. Hecher, Y. Mahmood, and A. Meier, “Rejection in Abstract
    Argumentation: Harder Than Acceptance?,” in <i>Frontiers in Artificial Intelligence
    and Applications</i>, IOS Press, 2024.'
  mla: 'Fichte, Johannes K., et al. “Rejection in Abstract Argumentation: Harder Than
    Acceptance?” <i>Frontiers in Artificial Intelligence and Applications</i>, IOS
    Press, 2024, doi:<a href="https://doi.org/10.3233/faia240867">10.3233/faia240867</a>.'
  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: <jats:p>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.</jats:p>
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: <i>Proceedings of the Thirty-ThirdInternational
    Joint Conference on Artificial Intelligence</i>. International Joint Conferences
    on Artificial Intelligence Organization; 2024. doi:<a href="https://doi.org/10.24963/ijcai.2024/377">10.24963/ijcai.2024/377</a>'
  apa: Hecher, M., Mahmood, Y., Meier, A., &#38; Schmidt, J. (2024). Quantitative
    Claim-Centric Reasoning in Logic-Based Argumentation. <i>Proceedings of the Thirty-ThirdInternational
    Joint Conference on Artificial Intelligence</i>. <a href="https://doi.org/10.24963/ijcai.2024/377">https://doi.org/10.24963/ijcai.2024/377</a>
  bibtex: '@inproceedings{Hecher_Mahmood_Meier_Schmidt_2024, title={Quantitative Claim-Centric
    Reasoning in Logic-Based Argumentation}, DOI={<a href="https://doi.org/10.24963/ijcai.2024/377">10.24963/ijcai.2024/377</a>},
    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 <i>Proceedings of the
    Thirty-ThirdInternational Joint Conference on Artificial Intelligence</i>. International
    Joint Conferences on Artificial Intelligence Organization, 2024. <a href="https://doi.org/10.24963/ijcai.2024/377">https://doi.org/10.24963/ijcai.2024/377</a>.
  ieee: 'M. Hecher, Y. Mahmood, A. Meier, and J. Schmidt, “Quantitative Claim-Centric
    Reasoning in Logic-Based Argumentation,” 2024, doi: <a href="https://doi.org/10.24963/ijcai.2024/377">10.24963/ijcai.2024/377</a>.'
  mla: Hecher, Markus, et al. “Quantitative Claim-Centric Reasoning in Logic-Based
    Argumentation.” <i>Proceedings of the Thirty-ThirdInternational Joint Conference
    on Artificial Intelligence</i>, International Joint Conferences on Artificial
    Intelligence Organization, 2024, doi:<a href="https://doi.org/10.24963/ijcai.2024/377">10.24963/ijcai.2024/377</a>.
  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. <i>arXiv:241208324</i>. Published
    online 2024.
  apa: Hankala, T., Hannula, M., Mahmood, Y., &#38; Meier, A. (2024). Parameterised
    Complexity of Consistent Query Answering via Graph  Representations. In <i>arXiv:2412.08324</i>.
  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.” <i>ArXiv:2412.08324</i>,
    2024.
  ieee: T. Hankala, M. Hannula, Y. Mahmood, and A. Meier, “Parameterised Complexity
    of Consistent Query Answering via Graph  Representations,” <i>arXiv:2412.08324</i>.
    2024.
  mla: Hankala, Teemu, et al. “Parameterised Complexity of Consistent Query Answering
    via Graph  Representations.” <i>ArXiv:2412.08324</i>, 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: <i>In Proceedings of the 39th IEEE/ACM International Conference
    on Automated Software Engineering Workshops (ASEW ’24)</i>. ; 2024. doi:<a href="https://doi.org/10.1145/3691621.3694953">10.1145/3691621.3694953</a>'
  apa: Khedkar, M., Schlichtig, M., &#38; Bodden, E. (2024). Advancing Android Privacy
    Assessments with Automation. <i>In Proceedings of the 39th IEEE/ACM International
    Conference on Automated Software Engineering Workshops (ASEW ’24)</i>. 39th IEEE/ACM
    International Conference on Automated Software Engineering (ASE 2024), Sacramento,
    California. <a href="https://doi.org/10.1145/3691621.3694953">https://doi.org/10.1145/3691621.3694953</a>
  bibtex: '@inproceedings{Khedkar_Schlichtig_Bodden_2024, title={Advancing Android
    Privacy Assessments with Automation}, DOI={<a href="https://doi.org/10.1145/3691621.3694953">10.1145/3691621.3694953</a>},
    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 <i>In Proceedings of the 39th IEEE/ACM
    International Conference on Automated Software Engineering Workshops (ASEW ’24)</i>,
    2024. <a href="https://doi.org/10.1145/3691621.3694953">https://doi.org/10.1145/3691621.3694953</a>.
  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: <a href="https://doi.org/10.1145/3691621.3694953">10.1145/3691621.3694953</a>.'
  mla: Khedkar, Mugdha, et al. “Advancing Android Privacy Assessments with Automation.”
    <i>In Proceedings of the 39th IEEE/ACM International Conference on Automated Software
    Engineering Workshops (ASEW ’24)</i>, 2024, doi:<a href="https://doi.org/10.1145/3691621.3694953">10.1145/3691621.3694953</a>.
  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: <i>2024 International
    Conference on Machine Learning and Applications (ICMLA)</i>. ; 2024:1705–1711.'
  apa: Klüttermann, S., Rutinowski, J., Polachowski, F., Nguyen, A., Grimme, B., Roidl,
    M., &#38; Müller, E. (2024). On the Effectiveness of Heterogeneous Ensemble Methods
    for Re-identification. <i>2024 International Conference on Machine Learning and
    Applications (ICMLA)</i>, 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 <i>2024 International Conference on
    Machine Learning and Applications (ICMLA)</i>, 1705–1711, 2024.
  ieee: S. Klüttermann <i>et al.</i>, “On the Effectiveness of Heterogeneous Ensemble
    Methods for Re-identification,” in <i>2024 International Conference on Machine
    Learning and Applications (ICMLA)</i>, 2024, pp. 1705–1711.
  mla: Klüttermann, Simon, et al. “On the Effectiveness of Heterogeneous Ensemble
    Methods for Re-Identification.” <i>2024 International Conference on Machine Learning
    and Applications (ICMLA)</i>, 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. <i>arXiv:241119782</i>. Published online 2024.
  apa: Delarue, B., &#38; Palmirotta, G. (2024). Patterson-Sullivan and Wigner distributions
    of convex-cocompact  hyperbolic surfaces. In <i>arXiv:2411.19782</i>.
  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.” <i>ArXiv:2411.19782</i>,
    2024.
  ieee: B. Delarue and G. Palmirotta, “Patterson-Sullivan and Wigner distributions
    of convex-cocompact  hyperbolic surfaces,” <i>arXiv:2411.19782</i>. 2024.
  mla: Delarue, Benjamin, and Guendalina Palmirotta. “Patterson-Sullivan and Wigner
    Distributions of Convex-Cocompact  Hyperbolic Surfaces.” <i>ArXiv:2411.19782</i>,
    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'
...
