---
_id: '30790'
abstract:
- lang: eng
  text: "Iterative distributed optimization algorithms involve multiple agents that\r\ncommunicate
    with each other, over time, in order to minimize/maximize a global\r\nobjective.
    In the presence of unreliable communication networks, the\r\nAge-of-Information
    (AoI), which measures the freshness of data received, may be\r\nlarge and hence
    hinder algorithmic convergence. In this paper, we study the\r\nconvergence of
    general distributed gradient-based optimization algorithms in\r\nthe presence
    of communication that neither happens periodically nor at\r\nstochastically independent
    points in time. We show that convergence is\r\nguaranteed provided the random
    variables associated with the AoI processes are\r\nstochastically dominated by
    a random variable with finite first moment. This\r\nimproves on previous requirements
    of boundedness of more than the first moment.\r\nWe then introduce stochastically
    strongly connected (SSC) networks, a new\r\nstochastic form of strong connectedness
    for time-varying networks. We show: If\r\nfor any $p \\ge0$ the processes that
    describe the success of communication\r\nbetween agents in a SSC network are $\\alpha$-mixing
    with $n^{p-1}\\alpha(n)$\r\nsummable, then the associated AoI processes are stochastically
    dominated by a\r\nrandom variable with finite $p$-th moment. In combination with
    our first\r\ncontribution, this implies that distributed stochastic gradient descend\r\nconverges
    in the presence of AoI, if $\\alpha(n)$ is summable."
author:
- first_name: Adrian
  full_name: Redder, Adrian
  id: '52265'
  last_name: Redder
  orcid: https://orcid.org/0000-0001-7391-4688
- first_name: Arunselvan
  full_name: Ramaswamy, Arunselvan
  id: '66937'
  last_name: Ramaswamy
  orcid: https://orcid.org/ 0000-0001-7547-8111
- first_name: Holger
  full_name: Karl, Holger
  id: '126'
  last_name: Karl
citation:
  ama: Redder A, Ramaswamy A, Karl H. Distributed gradient-based optimization in the
    presence of dependent  aperiodic communication. <i>arXiv:220111343</i>. Published
    online 2022.
  apa: Redder, A., Ramaswamy, A., &#38; Karl, H. (2022). Distributed gradient-based
    optimization in the presence of dependent  aperiodic communication. In <i>arXiv:2201.11343</i>.
  bibtex: '@article{Redder_Ramaswamy_Karl_2022, title={Distributed gradient-based
    optimization in the presence of dependent  aperiodic communication}, journal={arXiv:2201.11343},
    author={Redder, Adrian and Ramaswamy, Arunselvan and Karl, Holger}, year={2022}
    }'
  chicago: Redder, Adrian, Arunselvan Ramaswamy, and Holger Karl. “Distributed Gradient-Based
    Optimization in the Presence of Dependent  Aperiodic Communication.” <i>ArXiv:2201.11343</i>,
    2022.
  ieee: A. Redder, A. Ramaswamy, and H. Karl, “Distributed gradient-based optimization
    in the presence of dependent  aperiodic communication,” <i>arXiv:2201.11343</i>.
    2022.
  mla: Redder, Adrian, et al. “Distributed Gradient-Based Optimization in the Presence
    of Dependent  Aperiodic Communication.” <i>ArXiv:2201.11343</i>, 2022.
  short: A. Redder, A. Ramaswamy, H. Karl, ArXiv:2201.11343 (2022).
date_created: 2022-04-06T06:53:38Z
date_updated: 2022-11-18T09:33:01Z
department:
- _id: '75'
external_id:
  arxiv:
  - '2201.11343'
language:
- iso: eng
project:
- _id: '16'
  name: 'SFB 901 - C4: SFB 901 - Subproject C4'
- _id: '1'
  name: 'SFB 901: SFB 901'
- _id: '4'
  name: 'SFB 901 - C: SFB 901 - Project Area C'
publication: arXiv:2201.11343
status: public
title: Distributed gradient-based optimization in the presence of dependent  aperiodic
  communication
type: preprint
user_id: '477'
year: '2022'
...
---
_id: '32855'
author:
- first_name: Lennart
  full_name: Clausing, Lennart
  id: '74287'
  last_name: Clausing
  orcid: 0000-0003-3789-6034
- first_name: Marco
  full_name: Platzner, Marco
  id: '398'
  last_name: Platzner
citation:
  ama: 'Clausing L, Platzner M. ReconOS64: A Hardware Operating System for Modern
    Platform FPGAs with 64-Bit Support. In: <i>2022 IEEE International Parallel and
    Distributed Processing Symposium Workshops (IPDPSW)</i>. IEEE; 2022:120-127. doi:<a
    href="https://doi.org/10.1109/ipdpsw55747.2022.00029">10.1109/ipdpsw55747.2022.00029</a>'
  apa: 'Clausing, L., &#38; Platzner, M. (2022). ReconOS64: A Hardware Operating System
    for Modern Platform FPGAs with 64-Bit Support. <i>2022 IEEE International Parallel
    and Distributed Processing Symposium Workshops (IPDPSW)</i>, 120–127. <a href="https://doi.org/10.1109/ipdpsw55747.2022.00029">https://doi.org/10.1109/ipdpsw55747.2022.00029</a>'
  bibtex: '@inproceedings{Clausing_Platzner_2022, title={ReconOS64: A Hardware Operating
    System for Modern Platform FPGAs with 64-Bit Support}, DOI={<a href="https://doi.org/10.1109/ipdpsw55747.2022.00029">10.1109/ipdpsw55747.2022.00029</a>},
    booktitle={2022 IEEE International Parallel and Distributed Processing Symposium
    Workshops (IPDPSW)}, publisher={IEEE}, author={Clausing, Lennart and Platzner,
    Marco}, year={2022}, pages={120–127} }'
  chicago: 'Clausing, Lennart, and Marco Platzner. “ReconOS64: A Hardware Operating
    System for Modern Platform FPGAs with 64-Bit Support.” In <i>2022 IEEE International
    Parallel and Distributed Processing Symposium Workshops (IPDPSW)</i>, 120–27.
    IEEE, 2022. <a href="https://doi.org/10.1109/ipdpsw55747.2022.00029">https://doi.org/10.1109/ipdpsw55747.2022.00029</a>.'
  ieee: 'L. Clausing and M. Platzner, “ReconOS64: A Hardware Operating System for
    Modern Platform FPGAs with 64-Bit Support,” in <i>2022 IEEE International Parallel
    and Distributed Processing Symposium Workshops (IPDPSW)</i>,  Lyon, France, 2022,
    pp. 120–127, doi: <a href="https://doi.org/10.1109/ipdpsw55747.2022.00029">10.1109/ipdpsw55747.2022.00029</a>.'
  mla: 'Clausing, Lennart, and Marco Platzner. “ReconOS64: A Hardware Operating System
    for Modern Platform FPGAs with 64-Bit Support.” <i>2022 IEEE International Parallel
    and Distributed Processing Symposium Workshops (IPDPSW)</i>, IEEE, 2022, pp. 120–27,
    doi:<a href="https://doi.org/10.1109/ipdpsw55747.2022.00029">10.1109/ipdpsw55747.2022.00029</a>.'
  short: 'L. Clausing, M. Platzner, in: 2022 IEEE International Parallel and Distributed
    Processing Symposium Workshops (IPDPSW), IEEE, 2022, pp. 120–127.'
conference:
  end_date: 2022-06-03
  location: ' Lyon, France'
  name: 2022 IEEE International Parallel and Distributed Processing Symposium Workshops
    (IPDPSW)
  start_date: 2022-05-30
date_created: 2022-08-16T09:58:34Z
date_updated: 2022-11-18T09:36:00Z
department:
- _id: '78'
doi: 10.1109/ipdpsw55747.2022.00029
language:
- iso: eng
page: 120-127
project:
- _id: '83'
  name: 'SFB 901 - T1: SFB 901 -Subproject T1'
- _id: '1'
  name: 'SFB 901: SFB 901'
- _id: '82'
  name: 'SFB 901 - T: SFB 901 - Project Area T'
publication: 2022 IEEE International Parallel and Distributed Processing Symposium
  Workshops (IPDPSW)
publication_identifier:
  eisbn:
  - 978-1-6654-9747-3
publication_status: published
publisher: IEEE
status: public
title: 'ReconOS64: A Hardware Operating System for Modern Platform FPGAs with 64-Bit
  Support'
type: conference
user_id: '477'
year: '2022'
...
---
_id: '30791'
abstract:
- lang: eng
  text: "We present sufficient conditions that ensure convergence of the multi-agent\r\nDeep
    Deterministic Policy Gradient (DDPG) algorithm. It is an example of one of\r\nthe
    most popular paradigms of Deep Reinforcement Learning (DeepRL) for tackling\r\ncontinuous
    action spaces: the actor-critic paradigm. In the setting considered\r\nherein,
    each agent observes a part of the global state space in order to take\r\nlocal
    actions, for which it receives local rewards. For every agent, DDPG\r\ntrains
    a local actor (policy) and a local critic (Q-function). The analysis\r\nshows
    that multi-agent DDPG using neural networks to approximate the local\r\npolicies
    and critics converge to limits with the following properties: The\r\ncritic limits
    minimize the average squared Bellman loss; the actor limits\r\nparameterize a
    policy that maximizes the local critic's approximation of\r\n$Q_i^*$, where $i$
    is the agent index. The averaging is with respect to a\r\nprobability distribution
    over the global state-action space. It captures the\r\nasymptotics of all local
    training processes. Finally, we extend the analysis to\r\na fully decentralized
    setting where agents communicate over a wireless network\r\nprone to delays and
    losses; a typical scenario in, e.g., robotic applications."
author:
- first_name: Adrian
  full_name: Redder, Adrian
  id: '52265'
  last_name: Redder
  orcid: https://orcid.org/0000-0001-7391-4688
- first_name: Arunselvan
  full_name: Ramaswamy, Arunselvan
  id: '66937'
  last_name: Ramaswamy
  orcid: https://orcid.org/ 0000-0001-7547-8111
- first_name: Holger
  full_name: Karl, Holger
  id: '126'
  last_name: Karl
citation:
  ama: Redder A, Ramaswamy A, Karl H. Asymptotic Convergence of Deep Multi-Agent Actor-Critic
    Algorithms. <i>arXiv:220100570</i>. Published online 2022.
  apa: Redder, A., Ramaswamy, A., &#38; Karl, H. (2022). Asymptotic Convergence of
    Deep Multi-Agent Actor-Critic Algorithms. In <i>arXiv:2201.00570</i>.
  bibtex: '@article{Redder_Ramaswamy_Karl_2022, title={Asymptotic Convergence of Deep
    Multi-Agent Actor-Critic Algorithms}, journal={arXiv:2201.00570}, author={Redder,
    Adrian and Ramaswamy, Arunselvan and Karl, Holger}, year={2022} }'
  chicago: Redder, Adrian, Arunselvan Ramaswamy, and Holger Karl. “Asymptotic Convergence
    of Deep Multi-Agent Actor-Critic Algorithms.” <i>ArXiv:2201.00570</i>, 2022.
  ieee: A. Redder, A. Ramaswamy, and H. Karl, “Asymptotic Convergence of Deep Multi-Agent
    Actor-Critic Algorithms,” <i>arXiv:2201.00570</i>. 2022.
  mla: Redder, Adrian, et al. “Asymptotic Convergence of Deep Multi-Agent Actor-Critic
    Algorithms.” <i>ArXiv:2201.00570</i>, 2022.
  short: A. Redder, A. Ramaswamy, H. Karl, ArXiv:2201.00570 (2022).
date_created: 2022-04-06T06:53:52Z
date_updated: 2022-11-18T09:33:42Z
department:
- _id: '75'
external_id:
  arxiv:
  - '2201.00570'
language:
- iso: eng
project:
- _id: '16'
  name: 'SFB 901 - C4: SFB 901 - Subproject C4'
- _id: '1'
  name: 'SFB 901: SFB 901'
- _id: '4'
  name: 'SFB 901 - C: SFB 901 - Project Area C'
publication: arXiv:2201.00570
status: public
title: Asymptotic Convergence of Deep Multi-Agent Actor-Critic Algorithms
type: preprint
user_id: '477'
year: '2022'
...
---
_id: '32590'
author:
- first_name: Cedric
  full_name: Richter, Cedric
  id: '50003'
  last_name: Richter
- first_name: Heike
  full_name: Wehrheim, Heike
  id: '573'
  last_name: Wehrheim
citation:
  ama: 'Richter C, Wehrheim H. Learning Realistic Mutations: Bug Creation for Neural
    Bug Detectors. In: <i>2022 IEEE Conference on Software Testing, Verification and
    Validation (ICST)</i>. ; 2022:162-173. doi:<a href="https://doi.org/10.1109/ICST53961.2022.00027">10.1109/ICST53961.2022.00027</a>'
  apa: 'Richter, C., &#38; Wehrheim, H. (2022). Learning Realistic Mutations: Bug
    Creation for Neural Bug Detectors. <i>2022 IEEE Conference on Software Testing,
    Verification and Validation (ICST)</i>, 162–173. <a href="https://doi.org/10.1109/ICST53961.2022.00027">https://doi.org/10.1109/ICST53961.2022.00027</a>'
  bibtex: '@inproceedings{Richter_Wehrheim_2022, title={Learning Realistic Mutations:
    Bug Creation for Neural Bug Detectors}, DOI={<a href="https://doi.org/10.1109/ICST53961.2022.00027">10.1109/ICST53961.2022.00027</a>},
    booktitle={2022 IEEE Conference on Software Testing, Verification and Validation
    (ICST)}, author={Richter, Cedric and Wehrheim, Heike}, year={2022}, pages={162–173}
    }'
  chicago: 'Richter, Cedric, and Heike Wehrheim. “Learning Realistic Mutations: Bug
    Creation for Neural Bug Detectors.” In <i>2022 IEEE Conference on Software Testing,
    Verification and Validation (ICST)</i>, 162–73, 2022. <a href="https://doi.org/10.1109/ICST53961.2022.00027">https://doi.org/10.1109/ICST53961.2022.00027</a>.'
  ieee: 'C. Richter and H. Wehrheim, “Learning Realistic Mutations: Bug Creation for
    Neural Bug Detectors,” in <i>2022 IEEE Conference on Software Testing, Verification
    and Validation (ICST)</i>, 2022, pp. 162–173, doi: <a href="https://doi.org/10.1109/ICST53961.2022.00027">10.1109/ICST53961.2022.00027</a>.'
  mla: 'Richter, Cedric, and Heike Wehrheim. “Learning Realistic Mutations: Bug Creation
    for Neural Bug Detectors.” <i>2022 IEEE Conference on Software Testing, Verification
    and Validation (ICST)</i>, 2022, pp. 162–73, doi:<a href="https://doi.org/10.1109/ICST53961.2022.00027">10.1109/ICST53961.2022.00027</a>.'
  short: 'C. Richter, H. Wehrheim, in: 2022 IEEE Conference on Software Testing, Verification
    and Validation (ICST), 2022, pp. 162–173.'
date_created: 2022-08-08T07:40:04Z
date_updated: 2022-11-18T09:45:40Z
department:
- _id: '77'
doi: 10.1109/ICST53961.2022.00027
language:
- iso: eng
page: 162-173
project:
- _id: '12'
  name: 'SFB 901 - B4: SFB 901 - Subproject B4'
- _id: '1'
  name: 'SFB 901: SFB 901'
- _id: '3'
  name: 'SFB 901 - B: SFB 901 - Project Area B'
publication: 2022 IEEE Conference on Software Testing, Verification and Validation
  (ICST)
status: public
title: 'Learning Realistic Mutations: Bug Creation for Neural Bug Detectors'
type: conference
user_id: '477'
year: '2022'
...
---
_id: '32591'
author:
- first_name: Cedric
  full_name: Richter, Cedric
  id: '50003'
  last_name: Richter
- first_name: Heike
  full_name: Wehrheim, Heike
  id: '573'
  last_name: Wehrheim
citation:
  ama: 'Richter C, Wehrheim H. TSSB-3M: Mining single statement bugs at massive scale.
    In: <i>2022 IEEE/ACM 19th International Conference on Mining Software Repositories
    (MSR)</i>. ; 2022:418-422. doi:<a href="https://doi.org/10.1145/3524842.3528505">10.1145/3524842.3528505</a>'
  apa: 'Richter, C., &#38; Wehrheim, H. (2022). TSSB-3M: Mining single statement bugs
    at massive scale. <i>2022 IEEE/ACM 19th International Conference on Mining Software
    Repositories (MSR)</i>, 418–422. <a href="https://doi.org/10.1145/3524842.3528505">https://doi.org/10.1145/3524842.3528505</a>'
  bibtex: '@inproceedings{Richter_Wehrheim_2022, title={TSSB-3M: Mining single statement
    bugs at massive scale}, DOI={<a href="https://doi.org/10.1145/3524842.3528505">10.1145/3524842.3528505</a>},
    booktitle={2022 IEEE/ACM 19th International Conference on Mining Software Repositories
    (MSR)}, author={Richter, Cedric and Wehrheim, Heike}, year={2022}, pages={418–422}
    }'
  chicago: 'Richter, Cedric, and Heike Wehrheim. “TSSB-3M: Mining Single Statement
    Bugs at Massive Scale.” In <i>2022 IEEE/ACM 19th International Conference on Mining
    Software Repositories (MSR)</i>, 418–22, 2022. <a href="https://doi.org/10.1145/3524842.3528505">https://doi.org/10.1145/3524842.3528505</a>.'
  ieee: 'C. Richter and H. Wehrheim, “TSSB-3M: Mining single statement bugs at massive
    scale,” in <i>2022 IEEE/ACM 19th International Conference on Mining Software Repositories
    (MSR)</i>, 2022, pp. 418–422, doi: <a href="https://doi.org/10.1145/3524842.3528505">10.1145/3524842.3528505</a>.'
  mla: 'Richter, Cedric, and Heike Wehrheim. “TSSB-3M: Mining Single Statement Bugs
    at Massive Scale.” <i>2022 IEEE/ACM 19th International Conference on Mining Software
    Repositories (MSR)</i>, 2022, pp. 418–22, doi:<a href="https://doi.org/10.1145/3524842.3528505">10.1145/3524842.3528505</a>.'
  short: 'C. Richter, H. Wehrheim, in: 2022 IEEE/ACM 19th International Conference
    on Mining Software Repositories (MSR), 2022, pp. 418–422.'
date_created: 2022-08-08T07:42:19Z
date_updated: 2022-11-18T09:45:05Z
department:
- _id: '77'
doi: 10.1145/3524842.3528505
language:
- iso: eng
page: 418-422
project:
- _id: '12'
  name: 'SFB 901 - B4: SFB 901 - Subproject B4'
- _id: '1'
  name: 'SFB 901: SFB 901'
- _id: '3'
  name: 'SFB 901 - B: SFB 901 - Project Area B'
publication: 2022 IEEE/ACM 19th International Conference on Mining Software Repositories
  (MSR)
status: public
title: 'TSSB-3M: Mining single statement bugs at massive scale'
type: conference
user_id: '477'
year: '2022'
...
---
_id: '32398'
author:
- first_name: Hanna
  full_name: Siek, Hanna
  last_name: Siek
citation:
  ama: 'Siek H. <i>Bringing Structure to Structure-Preserving Signatures: Overview,
    Implementation and Comparison of Selected SPS Schemes</i>.; 2022.'
  apa: 'Siek, H. (2022). <i>Bringing Structure to Structure-Preserving Signatures:
    Overview, Implementation and Comparison of Selected SPS Schemes</i>.'
  bibtex: '@book{Siek_2022, title={Bringing Structure to Structure-Preserving Signatures:
    Overview, Implementation and Comparison of Selected SPS Schemes}, author={Siek,
    Hanna}, year={2022} }'
  chicago: 'Siek, Hanna. <i>Bringing Structure to Structure-Preserving Signatures:
    Overview, Implementation and Comparison of Selected SPS Schemes</i>, 2022.'
  ieee: 'H. Siek, <i>Bringing Structure to Structure-Preserving Signatures: Overview,
    Implementation and Comparison of Selected SPS Schemes</i>. 2022.'
  mla: 'Siek, Hanna. <i>Bringing Structure to Structure-Preserving Signatures: Overview,
    Implementation and Comparison of Selected SPS Schemes</i>. 2022.'
  short: 'H. Siek, Bringing Structure to Structure-Preserving Signatures: Overview,
    Implementation and Comparison of Selected SPS Schemes, 2022.'
date_created: 2022-07-20T09:36:39Z
date_updated: 2022-11-18T09:38:04Z
department:
- _id: '64'
- _id: '7'
language:
- iso: eng
project:
- _id: '1'
  name: 'SFB 901: SFB 901'
- _id: '4'
  name: 'SFB 901 - C: SFB 901 - Project Area C'
- _id: '13'
  name: 'SFB 901 - C1: SFB 901 - Subproject C1'
- _id: '84'
  name: 'SFB 901 - T2: SFB 901 -Subproject T2'
- _id: '82'
  name: 'SFB 901 - T: SFB 901 - Project Area T'
status: public
supervisor:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
title: 'Bringing Structure to Structure-Preserving Signatures: Overview, Implementation
  and Comparison of Selected SPS Schemes'
type: bachelorsthesis
user_id: '477'
year: '2022'
...
---
_id: '31485'
author:
- first_name: Paul
  full_name: Kramer, Paul
  id: '64594'
  last_name: Kramer
citation:
  ama: Kramer P. <i>On Transforming Lattice-Based Cryptography to the Ring Setting</i>.;
    2022.
  apa: Kramer, P. (2022). <i>On Transforming Lattice-Based Cryptography to the Ring
    Setting</i>.
  bibtex: '@book{Kramer_2022, title={On Transforming Lattice-Based Cryptography to
    the Ring Setting}, author={Kramer, Paul}, year={2022} }'
  chicago: Kramer, Paul. <i>On Transforming Lattice-Based Cryptography to the Ring
    Setting</i>, 2022.
  ieee: P. Kramer, <i>On Transforming Lattice-Based Cryptography to the Ring Setting</i>.
    2022.
  mla: Kramer, Paul. <i>On Transforming Lattice-Based Cryptography to the Ring Setting</i>.
    2022.
  short: P. Kramer, On Transforming Lattice-Based Cryptography to the Ring Setting,
    2022.
date_created: 2022-05-28T08:07:40Z
date_updated: 2022-11-18T09:40:28Z
department:
- _id: '7'
- _id: '64'
extern: '1'
language:
- iso: eng
project:
- _id: '4'
  name: 'SFB 901 - C: SFB 901 - Project Area C'
- _id: '13'
  name: 'SFB 901 - C1: SFB 901 - Subproject C1'
- _id: '1'
  name: 'SFB 901: SFB 901'
status: public
title: On Transforming Lattice-Based Cryptography to the Ring Setting
type: mastersthesis
user_id: '477'
year: '2022'
...
---
_id: '31806'
abstract:
- lang: eng
  text: The creation of an RDF knowledge graph for a particular application commonly
    involves a pipeline of tools that transform a set ofinput data sources into an
    RDF knowledge graph in a process called dataset augmentation. The components of
    such augmentation pipelines often require extensive configuration to lead to satisfactory
    results. Thus, non-experts are often unable to use them. Wepresent an efficient
    supervised algorithm based on genetic programming for learning knowledge graph
    augmentation pipelines of arbitrary length. Our approach uses multi-expression
    learning to learn augmentation pipelines able to achieve a high F-measure on the
    training data. Our evaluation suggests that our approach can efficiently learn
    a larger class of RDF dataset augmentation tasks than the state of the art while
    using only a single training example. Even on the most complex augmentation problem
    we posed, our approach consistently achieves an average F1-measure of 99% in under
    500 iterations with an average runtime of 16 seconds
author:
- first_name: Kevin
  full_name: Dreßler, Kevin
  id: '78256'
  last_name: Dreßler
- first_name: Mohamed
  full_name: Sherif, Mohamed
  id: '67234'
  last_name: Sherif
- first_name: Axel-Cyrille
  full_name: Ngonga Ngomo, Axel-Cyrille
  id: '65716'
  last_name: Ngonga Ngomo
citation:
  ama: 'Dreßler K, Sherif M, Ngonga Ngomo A-C. ADAGIO - Automated Data Augmentation
    of Knowledge Graphs Using Multi-expression Learning. In: <i>Proceedings of the
    33rd ACM Conference on Hypertext and Hypermedia</i>. ; 2022. doi:<a href="https://doi.org/10.1145/3511095.3531287">10.1145/3511095.3531287</a>'
  apa: 'Dreßler, K., Sherif, M., &#38; Ngonga Ngomo, A.-C. (2022). ADAGIO - Automated
    Data Augmentation of Knowledge Graphs Using Multi-expression Learning. <i>Proceedings
    of the 33rd ACM Conference on Hypertext and Hypermedia</i>. HT ’22: 33rd ACM Conference
    on Hypertext and Social Media, Barcelona (Spain). <a href="https://doi.org/10.1145/3511095.3531287">https://doi.org/10.1145/3511095.3531287</a>'
  bibtex: '@inproceedings{Dreßler_Sherif_Ngonga Ngomo_2022, title={ADAGIO - Automated
    Data Augmentation of Knowledge Graphs Using Multi-expression Learning}, DOI={<a
    href="https://doi.org/10.1145/3511095.3531287">10.1145/3511095.3531287</a>}, booktitle={Proceedings
    of the 33rd ACM Conference on Hypertext and Hypermedia}, author={Dreßler, Kevin
    and Sherif, Mohamed and Ngonga Ngomo, Axel-Cyrille}, year={2022} }'
  chicago: Dreßler, Kevin, Mohamed Sherif, and Axel-Cyrille Ngonga Ngomo. “ADAGIO
    - Automated Data Augmentation of Knowledge Graphs Using Multi-Expression Learning.”
    In <i>Proceedings of the 33rd ACM Conference on Hypertext and Hypermedia</i>,
    2022. <a href="https://doi.org/10.1145/3511095.3531287">https://doi.org/10.1145/3511095.3531287</a>.
  ieee: 'K. Dreßler, M. Sherif, and A.-C. Ngonga Ngomo, “ADAGIO - Automated Data Augmentation
    of Knowledge Graphs Using Multi-expression Learning,” presented at the HT ’22:
    33rd ACM Conference on Hypertext and Social Media, Barcelona (Spain), 2022, doi:
    <a href="https://doi.org/10.1145/3511095.3531287">10.1145/3511095.3531287</a>.'
  mla: Dreßler, Kevin, et al. “ADAGIO - Automated Data Augmentation of Knowledge Graphs
    Using Multi-Expression Learning.” <i>Proceedings of the 33rd ACM Conference on
    Hypertext and Hypermedia</i>, 2022, doi:<a href="https://doi.org/10.1145/3511095.3531287">10.1145/3511095.3531287</a>.
  short: 'K. Dreßler, M. Sherif, A.-C. Ngonga Ngomo, in: Proceedings of the 33rd ACM
    Conference on Hypertext and Hypermedia, 2022.'
conference:
  end_date: 2022-07-01
  location: Barcelona (Spain)
  name: 'HT ’22: 33rd ACM Conference on Hypertext and Social Media'
  start_date: 2022-06-28
date_created: 2022-06-08T08:47:33Z
date_updated: 2022-11-18T10:11:38Z
ddc:
- '000'
department:
- _id: '34'
doi: 10.1145/3511095.3531287
keyword:
- 2022 RAKI SFB901 deer dice kevin knowgraphs limes ngonga sherif simba
language:
- iso: eng
project:
- _id: '1'
  name: 'SFB 901: SFB 901'
- _id: '3'
  name: 'SFB 901 - B: SFB 901 - Project Area B'
- _id: '10'
  name: 'SFB 901 - B2: SFB 901 - Subproject B2'
publication: Proceedings of the 33rd ACM Conference on Hypertext and Hypermedia
status: public
title: ADAGIO - Automated Data Augmentation of Knowledge Graphs Using Multi-expression
  Learning
type: conference
user_id: '477'
year: '2022'
...
---
_id: '32854'
author:
- first_name: Adrian
  full_name: Redder, Adrian
  id: '52265'
  last_name: Redder
  orcid: https://orcid.org/0000-0001-7391-4688
- first_name: Arunselvan
  full_name: Ramaswamy, Arunselvan
  id: '66937'
  last_name: Ramaswamy
  orcid: https://orcid.org/ 0000-0001-7547-8111
- first_name: Holger
  full_name: Karl, Holger
  id: '126'
  last_name: Karl
citation:
  ama: Redder A, Ramaswamy A, Karl H. Practical Network Conditions for the Convergence
    of Distributed Optimization. <i>IFAC-PapersOnLine</i>. 2022;55(13):133–138.
  apa: Redder, A., Ramaswamy, A., &#38; Karl, H. (2022). Practical Network Conditions
    for the Convergence of Distributed Optimization. <i>IFAC-PapersOnLine</i>, <i>55</i>(13),
    133–138.
  bibtex: '@article{Redder_Ramaswamy_Karl_2022, title={Practical Network Conditions
    for the Convergence of Distributed Optimization}, volume={55}, number={13}, journal={IFAC-PapersOnLine},
    publisher={Elsevier}, author={Redder, Adrian and Ramaswamy, Arunselvan and Karl,
    Holger}, year={2022}, pages={133–138} }'
  chicago: 'Redder, Adrian, Arunselvan Ramaswamy, and Holger Karl. “Practical Network
    Conditions for the Convergence of Distributed Optimization.” <i>IFAC-PapersOnLine</i>
    55, no. 13 (2022): 133–138.'
  ieee: A. Redder, A. Ramaswamy, and H. Karl, “Practical Network Conditions for the
    Convergence of Distributed Optimization,” <i>IFAC-PapersOnLine</i>, vol. 55, no.
    13, pp. 133–138, 2022.
  mla: Redder, Adrian, et al. “Practical Network Conditions for the Convergence of
    Distributed Optimization.” <i>IFAC-PapersOnLine</i>, vol. 55, no. 13, Elsevier,
    2022, pp. 133–138.
  short: A. Redder, A. Ramaswamy, H. Karl, IFAC-PapersOnLine 55 (2022) 133–138.
conference:
  name: IFAC Conference on Networked Systems
date_created: 2022-08-16T09:12:55Z
date_updated: 2022-11-18T10:05:14Z
ddc:
- '006'
department:
- _id: '75'
file:
- access_level: closed
  content_type: application/pdf
  creator: aredder
  date_created: 2022-08-31T07:06:30Z
  date_updated: 2022-08-31T07:06:30Z
  file_id: '33236'
  file_name: NecSys2022____Practical_Conditions_for_Conv.pdf
  file_size: 298395
  relation: main_file
  success: 1
file_date_updated: 2022-08-31T07:06:30Z
has_accepted_license: '1'
intvolume: '        55'
issue: '13'
language:
- iso: eng
page: 133–138
project:
- _id: '16'
  name: 'SFB 901 - C4: SFB 901 - Subproject C4'
- _id: '1'
  name: 'SFB 901: SFB 901'
- _id: '4'
  name: 'SFB 901 - C: SFB 901 - Project Area C'
publication: IFAC-PapersOnLine
publisher: Elsevier
status: public
title: Practical Network Conditions for the Convergence of Distributed Optimization
type: journal_article
user_id: '477'
volume: 55
year: '2022'
...
---
_id: '33253'
author:
- first_name: Tim
  full_name: Hansmeier, Tim
  id: '49992'
  last_name: Hansmeier
  orcid: 0000-0003-1377-3339
- first_name: Mathis
  full_name: Brede, Mathis
  last_name: Brede
- first_name: Marco
  full_name: Platzner, Marco
  id: '398'
  last_name: Platzner
citation:
  ama: 'Hansmeier T, Brede M, Platzner M. XCS on Embedded Systems: An Analysis of
    Execution Profiles and Accelerated Classifier Deletion. In: <i>GECCO ’22: Proceedings
    of the Genetic and Evolutionary Computation Conference Companion</i>. Association
    for Computing Machinery (ACM); 2022:2071-2079. doi:<a href="https://doi.org/10.1145/3520304.3533977">10.1145/3520304.3533977</a>'
  apa: 'Hansmeier, T., Brede, M., &#38; Platzner, M. (2022). XCS on Embedded Systems:
    An Analysis of Execution Profiles and Accelerated Classifier Deletion. <i>GECCO
    ’22: Proceedings of the Genetic and Evolutionary Computation Conference Companion</i>,
    2071–2079. <a href="https://doi.org/10.1145/3520304.3533977">https://doi.org/10.1145/3520304.3533977</a>'
  bibtex: '@inproceedings{Hansmeier_Brede_Platzner_2022, place={New York, NY, United
    States}, title={XCS on Embedded Systems: An Analysis of Execution Profiles and
    Accelerated Classifier Deletion}, DOI={<a href="https://doi.org/10.1145/3520304.3533977">10.1145/3520304.3533977</a>},
    booktitle={GECCO ’22: Proceedings of the Genetic and Evolutionary Computation
    Conference Companion}, publisher={Association for Computing Machinery (ACM)},
    author={Hansmeier, Tim and Brede, Mathis and Platzner, Marco}, year={2022}, pages={2071–2079}
    }'
  chicago: 'Hansmeier, Tim, Mathis Brede, and Marco Platzner. “XCS on Embedded Systems:
    An Analysis of Execution Profiles and Accelerated Classifier Deletion.” In <i>GECCO
    ’22: Proceedings of the Genetic and Evolutionary Computation Conference Companion</i>,
    2071–79. New York, NY, United States: Association for Computing Machinery (ACM),
    2022. <a href="https://doi.org/10.1145/3520304.3533977">https://doi.org/10.1145/3520304.3533977</a>.'
  ieee: 'T. Hansmeier, M. Brede, and M. Platzner, “XCS on Embedded Systems: An Analysis
    of Execution Profiles and Accelerated Classifier Deletion,” in <i>GECCO ’22: Proceedings
    of the Genetic and Evolutionary Computation Conference Companion</i>, Boston,
    MA, USA, 2022, pp. 2071–2079, doi: <a href="https://doi.org/10.1145/3520304.3533977">10.1145/3520304.3533977</a>.'
  mla: 'Hansmeier, Tim, et al. “XCS on Embedded Systems: An Analysis of Execution
    Profiles and Accelerated Classifier Deletion.” <i>GECCO ’22: Proceedings of the
    Genetic and Evolutionary Computation Conference Companion</i>, Association for
    Computing Machinery (ACM), 2022, pp. 2071–79, doi:<a href="https://doi.org/10.1145/3520304.3533977">10.1145/3520304.3533977</a>.'
  short: 'T. Hansmeier, M. Brede, M. Platzner, in: GECCO ’22: Proceedings of the Genetic
    and Evolutionary Computation Conference Companion, Association for Computing Machinery
    (ACM), New York, NY, United States, 2022, pp. 2071–2079.'
conference:
  end_date: 2022-07-13
  location: Boston, MA, USA
  name: International Workshop on Learning Classifier Systems (IWLCS 2022)
  start_date: 2022-07-09
date_created: 2022-09-02T11:47:17Z
date_updated: 2022-11-18T10:13:22Z
department:
- _id: '78'
doi: 10.1145/3520304.3533977
language:
- iso: eng
page: 2071-2079
place: New York, NY, United States
project:
- _id: '1'
  name: 'SFB 901: SFB 901'
- _id: '14'
  name: 'SFB 901 - C2: SFB 901 - Subproject C2'
- _id: '4'
  name: 'SFB 901 - C: SFB 901 - Project Area C'
publication: 'GECCO ''22: Proceedings of the Genetic and Evolutionary Computation
  Conference Companion'
publication_status: published
publisher: Association for Computing Machinery (ACM)
status: public
title: 'XCS on Embedded Systems: An Analysis of Execution Profiles and Accelerated
  Classifier Deletion'
type: conference
user_id: '477'
year: '2022'
...
---
_id: '33274'
author:
- first_name: Wei-Fan
  full_name: Chen, Wei-Fan
  id: '82920'
  last_name: Chen
- first_name: Mei-Hua
  full_name: Chen, Mei-Hua
  last_name: Chen
- first_name: Garima
  full_name: Mudgal, Garima
  last_name: Mudgal
- first_name: Henning
  full_name: Wachsmuth, Henning
  id: '3900'
  last_name: Wachsmuth
citation:
  ama: 'Chen W-F, Chen M-H, Mudgal G, Wachsmuth H. Analyzing Culture-Specific Argument
    Structures in Learner Essays. In: <i>Proceedings of the 9th Workshop on Argument
    Mining (ArgMining 2022)</i>. ; 2022:51-61.'
  apa: Chen, W.-F., Chen, M.-H., Mudgal, G., &#38; Wachsmuth, H. (2022). Analyzing
    Culture-Specific Argument Structures in Learner Essays. <i>Proceedings of the
    9th Workshop on Argument Mining (ArgMining 2022)</i>, 51–61.
  bibtex: '@inproceedings{Chen_Chen_Mudgal_Wachsmuth_2022, title={Analyzing Culture-Specific
    Argument Structures in Learner Essays}, booktitle={Proceedings of the 9th Workshop
    on Argument Mining (ArgMining 2022)}, author={Chen, Wei-Fan and Chen, Mei-Hua
    and Mudgal, Garima and Wachsmuth, Henning}, year={2022}, pages={51–61} }'
  chicago: Chen, Wei-Fan, Mei-Hua Chen, Garima Mudgal, and Henning Wachsmuth. “Analyzing
    Culture-Specific Argument Structures in Learner Essays.” In <i>Proceedings of
    the 9th Workshop on Argument Mining (ArgMining 2022)</i>, 51–61, 2022.
  ieee: W.-F. Chen, M.-H. Chen, G. Mudgal, and H. Wachsmuth, “Analyzing Culture-Specific
    Argument Structures in Learner Essays,” in <i>Proceedings of the 9th Workshop
    on Argument Mining (ArgMining 2022)</i>, 2022, pp. 51–61.
  mla: Chen, Wei-Fan, et al. “Analyzing Culture-Specific Argument Structures in Learner
    Essays.” <i>Proceedings of the 9th Workshop on Argument Mining (ArgMining 2022)</i>,
    2022, pp. 51–61.
  short: 'W.-F. Chen, M.-H. Chen, G. Mudgal, H. Wachsmuth, in: Proceedings of the
    9th Workshop on Argument Mining (ArgMining 2022), 2022, pp. 51–61.'
date_created: 2022-09-06T13:51:23Z
date_updated: 2022-11-18T09:56:17Z
department:
- _id: '600'
language:
- iso: eng
page: 51 - 61
project:
- _id: '9'
  name: 'SFB 901 - B1: SFB 901 - Subproject B1'
- _id: '1'
  name: 'SFB 901: SFB 901'
- _id: '3'
  name: 'SFB 901 - B: SFB 901 - Project Area B'
publication: Proceedings of the 9th Workshop on Argument Mining (ArgMining 2022)
status: public
title: Analyzing Culture-Specific Argument Structures in Learner Essays
type: conference
user_id: '477'
year: '2022'
...
---
_id: '33491'
author:
- first_name: Marten
  full_name: Maack, Marten
  id: '88252'
  last_name: Maack
- first_name: Simon
  full_name: Pukrop, Simon
  id: '44428'
  last_name: Pukrop
- first_name: Anna Rodriguez
  full_name: Rasmussen, Anna Rodriguez
  last_name: Rasmussen
citation:
  ama: 'Maack M, Pukrop S, Rasmussen AR. (In-)Approximability Results for Interval,
    Resource Restricted, and Low Rank Scheduling. In: Chechik S, Navarro G, Rotenberg
    E, Herman G, eds. <i>30th Annual European Symposium on Algorithms, ESA 2022, September
    5-9, 2022, Berlin/Potsdam, Germany</i>. Vol 244. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum
    für Informatik; 2022:77:1–77:13. doi:<a href="https://doi.org/10.4230/LIPIcs.ESA.2022.77">10.4230/LIPIcs.ESA.2022.77</a>'
  apa: Maack, M., Pukrop, S., &#38; Rasmussen, A. R. (2022). (In-)Approximability
    Results for Interval, Resource Restricted, and Low Rank Scheduling. In S. Chechik,
    G. Navarro, E. Rotenberg, &#38; G. Herman (Eds.), <i>30th Annual European Symposium
    on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany</i> (Vol.
    244, p. 77:1–77:13). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href="https://doi.org/10.4230/LIPIcs.ESA.2022.77">https://doi.org/10.4230/LIPIcs.ESA.2022.77</a>
  bibtex: '@inproceedings{Maack_Pukrop_Rasmussen_2022, series={LIPIcs}, title={(In-)Approximability
    Results for Interval, Resource Restricted, and Low Rank Scheduling}, volume={244},
    DOI={<a href="https://doi.org/10.4230/LIPIcs.ESA.2022.77">10.4230/LIPIcs.ESA.2022.77</a>},
    booktitle={30th Annual European Symposium on Algorithms, ESA 2022, September 5-9,
    2022, Berlin/Potsdam, Germany}, publisher={Schloss Dagstuhl - Leibniz-Zentrum
    für Informatik}, author={Maack, Marten and Pukrop, Simon and Rasmussen, Anna Rodriguez},
    editor={Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz},
    year={2022}, pages={77:1–77:13}, collection={LIPIcs} }'
  chicago: Maack, Marten, Simon Pukrop, and Anna Rodriguez Rasmussen. “(In-)Approximability
    Results for Interval, Resource Restricted, and Low Rank Scheduling.” In <i>30th
    Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam,
    Germany</i>, edited by Shiri Chechik, Gonzalo Navarro, Eva Rotenberg, and Grzegorz
    Herman, 244:77:1–77:13. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
    2022. <a href="https://doi.org/10.4230/LIPIcs.ESA.2022.77">https://doi.org/10.4230/LIPIcs.ESA.2022.77</a>.
  ieee: 'M. Maack, S. Pukrop, and A. R. Rasmussen, “(In-)Approximability Results for
    Interval, Resource Restricted, and Low Rank Scheduling,” in <i>30th Annual European
    Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany</i>,
    2022, vol. 244, p. 77:1–77:13, doi: <a href="https://doi.org/10.4230/LIPIcs.ESA.2022.77">10.4230/LIPIcs.ESA.2022.77</a>.'
  mla: Maack, Marten, et al. “(In-)Approximability Results for Interval, Resource
    Restricted, and Low Rank Scheduling.” <i>30th Annual European Symposium on Algorithms,
    ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany</i>, edited by Shiri Chechik
    et al., vol. 244, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p.
    77:1–77:13, doi:<a href="https://doi.org/10.4230/LIPIcs.ESA.2022.77">10.4230/LIPIcs.ESA.2022.77</a>.
  short: 'M. Maack, S. Pukrop, A.R. Rasmussen, in: S. Chechik, G. Navarro, E. Rotenberg,
    G. Herman (Eds.), 30th Annual European Symposium on Algorithms, ESA 2022, September
    5-9, 2022, Berlin/Potsdam, Germany, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
    2022, p. 77:1–77:13.'
date_created: 2022-09-27T13:06:05Z
date_updated: 2022-11-18T10:14:14Z
department:
- _id: '63'
doi: 10.4230/LIPIcs.ESA.2022.77
editor:
- first_name: Shiri
  full_name: Chechik, Shiri
  last_name: Chechik
- first_name: Gonzalo
  full_name: Navarro, Gonzalo
  last_name: Navarro
- first_name: Eva
  full_name: Rotenberg, Eva
  last_name: Rotenberg
- first_name: Grzegorz
  full_name: Herman, Grzegorz
  last_name: Herman
intvolume: '       244'
language:
- iso: eng
page: 77:1–77:13
project:
- _id: '1'
  name: 'SFB 901: SFB 901'
- _id: '16'
  name: 'SFB 901 - C4: SFB 901 - Subproject C4'
- _id: '4'
  name: 'SFB 901 - C: SFB 901 - Project Area C'
publication: 30th Annual European Symposium on Algorithms, ESA 2022, September 5-9,
  2022, Berlin/Potsdam, Germany
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
series_title: LIPIcs
status: public
title: (In-)Approximability Results for Interval, Resource Restricted, and Low Rank
  Scheduling
type: conference
user_id: '477'
volume: 244
year: '2022'
...
---
_id: '34140'
abstract:
- lang: eng
  text: In this paper, machine learning techniques will be used to classify different
    PCB layouts given their electromagnetic frequency spectra. These spectra result
    from a simulated near-field measurement of electric field strengths at different
    locations. Measured values consist of real and imaginary parts (amplitude and
    phase) in X, Y and Z directions. Training data was obtained in the time domain
    by varying transmission line geometries (size, distance and signaling). It was
    then transformed into the frequency domain and used as deep neural network input.
    Principal component analysis was applied to reduce the sample dimension. The results
    show that classifying different designs is possible with high accuracy based on
    synthetic data. Future work comprises measurements of real, custom-made PCB with
    varying parameters to adapt the simulation model and also test the neural network.
    Finally, the trained model could be used to give hints about the error’s cause
    when overshooting EMC limits.
author:
- first_name: Jad
  full_name: Maalouly, Jad
  last_name: Maalouly
- first_name: Dennis
  full_name: Hemker, Dennis
  last_name: Hemker
- first_name: Christian
  full_name: Hedayat, Christian
  last_name: Hedayat
- first_name: Christian
  full_name: Rückert, Christian
  last_name: Rückert
- first_name: Ivan
  full_name: Kaufmann, Ivan
  last_name: Kaufmann
- first_name: Marcel
  full_name: Olbrich, Marcel
  last_name: Olbrich
- first_name: Sven
  full_name: Lange, Sven
  id: '38240'
  last_name: Lange
- first_name: Harald
  full_name: Mathis, Harald
  last_name: Mathis
citation:
  ama: 'Maalouly J, Hemker D, Hedayat C, et al. AI Assisted Interference Classification
    to Improve EMC Troubleshooting in Electronic System Development. In: <i>2022 Kleinheubach
    Conference</i>. IEEE; 2022.'
  apa: Maalouly, J., Hemker, D., Hedayat, C., Rückert, C., Kaufmann, I., Olbrich,
    M., Lange, S., &#38; Mathis, H. (2022). AI Assisted Interference Classification
    to Improve EMC Troubleshooting in Electronic System Development. <i>2022 Kleinheubach
    Conference</i>. 2022 Kleinheubach Conference, Miltenberg, Germany.
  bibtex: '@inproceedings{Maalouly_Hemker_Hedayat_Rückert_Kaufmann_Olbrich_Lange_Mathis_2022,
    place={Miltenberg, Germany}, title={AI Assisted Interference Classification to
    Improve EMC Troubleshooting in Electronic System Development}, booktitle={2022
    Kleinheubach Conference}, publisher={IEEE}, author={Maalouly, Jad and Hemker,
    Dennis and Hedayat, Christian and Rückert, Christian and Kaufmann, Ivan and Olbrich,
    Marcel and Lange, Sven and Mathis, Harald}, year={2022} }'
  chicago: 'Maalouly, Jad, Dennis Hemker, Christian Hedayat, Christian Rückert, Ivan
    Kaufmann, Marcel Olbrich, Sven Lange, and Harald Mathis. “AI Assisted Interference
    Classification to Improve EMC Troubleshooting in Electronic System Development.”
    In <i>2022 Kleinheubach Conference</i>. Miltenberg, Germany: IEEE, 2022.'
  ieee: J. Maalouly <i>et al.</i>, “AI Assisted Interference Classification to Improve
    EMC Troubleshooting in Electronic System Development,” presented at the 2022 Kleinheubach
    Conference, Miltenberg, Germany, 2022.
  mla: Maalouly, Jad, et al. “AI Assisted Interference Classification to Improve EMC
    Troubleshooting in Electronic System Development.” <i>2022 Kleinheubach Conference</i>,
    IEEE, 2022.
  short: 'J. Maalouly, D. Hemker, C. Hedayat, C. Rückert, I. Kaufmann, M. Olbrich,
    S. Lange, H. Mathis, in: 2022 Kleinheubach Conference, IEEE, Miltenberg, Germany,
    2022.'
conference:
  end_date: 2022-09-29
  location: Miltenberg, Germany
  name: 2022 Kleinheubach Conference
  start_date: 2022-09-27
date_created: 2022-11-24T14:21:17Z
date_updated: 2022-11-24T14:21:34Z
department:
- _id: '59'
- _id: '485'
keyword:
- emc
- pcb
- electronic system development
- machine learning
- neural network
language:
- iso: eng
main_file_link:
- url: https://ieeexplore.ieee.org/document/9954484
place: Miltenberg, Germany
project:
- _id: '52'
  name: 'PC2: Computing Resources Provided by the Paderborn Center for Parallel Computing'
publication: 2022 Kleinheubach Conference
publication_identifier:
  eisbn:
  - 978-3-948571-07-8
publication_status: published
publisher: IEEE
status: public
title: AI Assisted Interference Classification to Improve EMC Troubleshooting in Electronic
  System Development
type: conference
user_id: '38240'
year: '2022'
...
---
_id: '34155'
author:
- first_name: Stefan
  full_name: Krauter, Stefan
  id: '28836'
  last_name: Krauter
  orcid: 0000-0002-3594-260X
- first_name: Jörg
  full_name: Bendfeld, Jörg
  id: '16148'
  last_name: Bendfeld
citation:
  ama: 'Krauter S, Bendfeld J. Microinverter PV Systems: New Efficiency Rankings and
    Formula for Energy Yield Assessment for any PV Panel Size at different Microinverter
    types. In: <i>Proceedings of the 8th World Conference on Photovoltaik Energy Conversion</i>.
    ; 2022.'
  apa: 'Krauter, S., &#38; Bendfeld, J. (2022). Microinverter PV Systems: New Efficiency
    Rankings and Formula for Energy Yield Assessment for any PV Panel Size at different
    Microinverter types. <i>Proceedings of the 8th World Conference on Photovoltaik
    Energy Conversion</i>. 8th World Conference on Photovoltaik Energy Conversion,
    Milano / Italy.'
  bibtex: '@inproceedings{Krauter_Bendfeld_2022, title={Microinverter PV Systems:
    New Efficiency Rankings and Formula for Energy Yield Assessment for any PV Panel
    Size at different Microinverter types}, booktitle={Proceedings of the 8th World
    Conference on Photovoltaik Energy Conversion}, author={Krauter, Stefan and Bendfeld,
    Jörg}, year={2022} }'
  chicago: 'Krauter, Stefan, and Jörg Bendfeld. “Microinverter PV Systems: New Efficiency
    Rankings and Formula for Energy Yield Assessment for Any PV Panel Size at Different
    Microinverter Types.” In <i>Proceedings of the 8th World Conference on Photovoltaik
    Energy Conversion</i>, 2022.'
  ieee: 'S. Krauter and J. Bendfeld, “Microinverter PV Systems: New Efficiency Rankings
    and Formula for Energy Yield Assessment for any PV Panel Size at different Microinverter
    types,” presented at the 8th World Conference on Photovoltaik Energy Conversion,
    Milano / Italy, 2022.'
  mla: 'Krauter, Stefan, and Jörg Bendfeld. “Microinverter PV Systems: New Efficiency
    Rankings and Formula for Energy Yield Assessment for Any PV Panel Size at Different
    Microinverter Types.” <i>Proceedings of the 8th World Conference on Photovoltaik
    Energy Conversion</i>, 2022.'
  short: 'S. Krauter, J. Bendfeld, in: Proceedings of the 8th World Conference on
    Photovoltaik Energy Conversion, 2022.'
conference:
  end_date: 2022-09-30
  location: Milano / Italy
  name: 8th World Conference on Photovoltaik Energy Conversion
  start_date: 2022-09-26
date_created: 2022-11-29T09:55:14Z
date_updated: 2022-11-29T10:00:44Z
department:
- _id: '53'
language:
- iso: eng
publication: Proceedings of the 8th World Conference on Photovoltaik Energy Conversion
status: public
title: 'Microinverter PV Systems: New Efficiency Rankings and Formula for Energy Yield
  Assessment for any PV Panel Size at different Microinverter types'
type: conference
user_id: '16148'
year: '2022'
...
---
_id: '34156'
author:
- first_name: Josephine Nakato
  full_name: Kakande, Josephine Nakato
  id: '88649'
  last_name: Kakande
- first_name: Godiana Hagile
  full_name: Philipo, Godiana Hagile
  last_name: Philipo
- first_name: Stefan
  full_name: Krauter, Stefan
  id: '28836'
  last_name: Krauter
  orcid: 0000-0002-3594-260X
citation:
  ama: 'Kakande JN, Philipo GH, Krauter S. Optimal Design of a Semi Grid-Connected
    PV System for a Site in Lwak, Kenya Using HOMER. In: <i>Proceedings of the 8th
    World Conference on Photovoltaik Energy Conversion</i>. ; 2022.'
  apa: Kakande, J. N., Philipo, G. H., &#38; Krauter, S. (2022). Optimal Design of
    a Semi Grid-Connected PV System for a Site in Lwak, Kenya Using HOMER. <i>Proceedings
    of the 8th World Conference on Photovoltaik Energy Conversion</i>. 8th World Conference
    on Photovoltaik Energy Conversion, Milano / Italy.
  bibtex: '@inproceedings{Kakande_Philipo_Krauter_2022, title={Optimal Design of a
    Semi Grid-Connected PV System for a Site in Lwak, Kenya Using HOMER}, booktitle={Proceedings
    of the 8th World Conference on Photovoltaik Energy Conversion}, author={Kakande,
    Josephine Nakato and Philipo, Godiana Hagile and Krauter, Stefan}, year={2022}
    }'
  chicago: Kakande, Josephine Nakato, Godiana Hagile Philipo, and Stefan Krauter.
    “Optimal Design of a Semi Grid-Connected PV System for a Site in Lwak, Kenya Using
    HOMER.” In <i>Proceedings of the 8th World Conference on Photovoltaik Energy Conversion</i>,
    2022.
  ieee: J. N. Kakande, G. H. Philipo, and S. Krauter, “Optimal Design of a Semi Grid-Connected
    PV System for a Site in Lwak, Kenya Using HOMER,” presented at the 8th World Conference
    on Photovoltaik Energy Conversion, Milano / Italy, 2022.
  mla: Kakande, Josephine Nakato, et al. “Optimal Design of a Semi Grid-Connected
    PV System for a Site in Lwak, Kenya Using HOMER.” <i>Proceedings of the 8th World
    Conference on Photovoltaik Energy Conversion</i>, 2022.
  short: 'J.N. Kakande, G.H. Philipo, S. Krauter, in: Proceedings of the 8th World
    Conference on Photovoltaik Energy Conversion, 2022.'
conference:
  end_date: 2022-09-30
  location: Milano / Italy
  name: 8th World Conference on Photovoltaik Energy Conversion
  start_date: 2022-09-26
date_created: 2022-11-29T10:03:24Z
date_updated: 2022-11-29T10:03:30Z
department:
- _id: '53'
language:
- iso: eng
publication: Proceedings of the 8th World Conference on Photovoltaik Energy Conversion
status: public
title: Optimal Design of a Semi Grid-Connected PV System for a Site in Lwak, Kenya
  Using HOMER
type: conference
user_id: '16148'
year: '2022'
...
---
_id: '29769'
abstract:
- lang: eng
  text: 'Wettstreit zwischen der Entwicklung neuer Hardwaretrojaner und entsprechender
    Gegenmaßnahmen beschreiten Widersacher immer raffiniertere Wege um Schaltungsentwürfe
    zu infizieren und dabei selbst fortgeschrittene Test- und Verifikationsmethoden
    zu überlisten. Abgesehen von den konventionellen Methoden um einen Trojaner in
    eine Schaltung für ein Field-programmable Gate Array (FPGA) einzuschleusen, können
    auch die Entwurfswerkzeuge heimlich kompromittiert werden um einen Angreifer dabei
    zu unterstützen einen erfolgreichen Angriff durchzuführen, der zum Beispiel Fehlfunktionen
    oder ungewollte Informationsabflüsse bewirken kann. Diese Dissertation beschäftigt
    sich hauptsächlich mit den beiden Blickwinkeln auf Hardwaretrojaner in rekonfigurierbaren
    Systemen, einerseits der Perspektive des Verteidigers mit einer Methode zur Erkennung
    von Trojanern auf der Bitstromebene, und andererseits derjenigen des Angreifers
    mit einer neuartigen Angriffsmethode für FPGA Trojaner. Für die Verteidigung gegen
    den Trojaner ``Heimtückische LUT'''' stellen wir die allererste erfolgreiche Gegenmaßnahme
    vor, die durch Verifikation mittels Proof-carrying Hardware (PCH) auf der Bitstromebene
    direkt vor der Konfiguration der Hardware angewendet werden kann, und präsentieren
    ein vollständiges Schema für den Entwurf und die Verifikation von Schaltungen
    für iCE40 FPGAs. Für die Gegenseite führen wir einen neuen Angriff ein, welcher
    bösartiges Routing im eingefügten Trojaner ausnutzt um selbst im fertigen Bitstrom
    in einem inaktiven Zustand zu verbleiben: Hierdurch kann dieser neuartige Angriff
    zur Zeit weder von herkömmlichen Test- und Verifikationsmethoden, noch von unserer
    vorher vorgestellten Verifikation auf der Bitstromebene entdeckt werden.'
- lang: eng
  text: The battle of developing hardware Trojans and corresponding countermeasures
    has taken adversaries towards ingenious ways of compromising hardware designs
    by circumventing even advanced testing and verification methods. Besides conventional
    methods of inserting Trojans into a design by a malicious entity, the design flow
    for field-programmable gate arrays (FPGAs) can also be surreptitiously compromised
    to assist the attacker to perform a successful malfunctioning or information leakage
    attack. This thesis mainly focuses on the two aspects of hardware Trojans in reconfigurable
    systems, the defenders perspective which corresponds to the bitstream-level Trojan
    detection technique, and the attackers perspective which corresponds to a novel
    FPGA Trojan attack. From the defender's perspective, we introduce a first-ever
    successful pre-configuration countermeasure against the ``Malicious LUT''-hardware
    Trojan, by employing bitstream-level Proof-Carrying Hardware (PCH) and present
    the complete design-and-verification flow for iCE40 FPGAs. Likewise, from an attackers
    perspective, we present a novel attack that leverages malicious routing of the
    inserted Trojan circuit to acquire a dormant state even in the generated and transmitted
    bitstream. Since the Trojan is injected in a post-synthesis step and remains unconnected
    in the bitstream, the presented attack can currently neither be prevented by conventional
    testing and verification methods nor by bitstream-level verification techniques.
author:
- first_name: Qazi Arbab
  full_name: Ahmed, Qazi Arbab
  id: '72764'
  last_name: Ahmed
  orcid: 0000-0002-1837-2254
citation:
  ama: Ahmed QA. <i>Hardware Trojans in Reconfigurable Computing</i>.  Paderborn University,
    Paderborn, Germany; 2022. doi:<a href="https://doi.org/10.17619/UNIPB/1-1271">10.17619/UNIPB/1-1271</a>
  apa: Ahmed, Q. A. (2022). <i>Hardware Trojans in Reconfigurable Computing</i>.  Paderborn
    University, Paderborn, Germany. <a href="https://doi.org/10.17619/UNIPB/1-1271">https://doi.org/10.17619/UNIPB/1-1271</a>
  bibtex: '@book{Ahmed_2022, place={Paderborn}, title={Hardware Trojans in Reconfigurable
    Computing}, DOI={<a href="https://doi.org/10.17619/UNIPB/1-1271">10.17619/UNIPB/1-1271</a>},
    publisher={ Paderborn University, Paderborn, Germany}, author={Ahmed, Qazi Arbab},
    year={2022} }'
  chicago: 'Ahmed, Qazi Arbab. <i>Hardware Trojans in Reconfigurable Computing</i>.
    Paderborn:  Paderborn University, Paderborn, Germany, 2022. <a href="https://doi.org/10.17619/UNIPB/1-1271">https://doi.org/10.17619/UNIPB/1-1271</a>.'
  ieee: 'Q. A. Ahmed, <i>Hardware Trojans in Reconfigurable Computing</i>. Paderborn:  Paderborn
    University, Paderborn, Germany, 2022.'
  mla: Ahmed, Qazi Arbab. <i>Hardware Trojans in Reconfigurable Computing</i>.  Paderborn
    University, Paderborn, Germany, 2022, doi:<a href="https://doi.org/10.17619/UNIPB/1-1271">10.17619/UNIPB/1-1271</a>.
  short: Q.A. Ahmed, Hardware Trojans in Reconfigurable Computing,  Paderborn University,
    Paderborn, Germany, Paderborn, 2022.
date_created: 2022-02-07T14:02:36Z
date_updated: 2022-11-30T13:39:01Z
ddc:
- '004'
department:
- _id: '78'
doi: 10.17619/UNIPB/1-1271
has_accepted_license: '1'
keyword:
- FPGA Security
- Hardware Trojans
- Bitstream-level Trojans
- Bitstream Verification
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: "\turn:nbn:de:hbz:466:2-40303"
oa: '1'
place: Paderborn
project:
- _id: '1'
  name: 'SFB 901: SFB 901'
- _id: '4'
  name: 'SFB 901 - C: SFB 901 - Project Area C'
- _id: '14'
  name: 'SFB 901 - C2: SFB 901 - Subproject C2'
publication_status: published
publisher: ' Paderborn University, Paderborn, Germany'
status: public
supervisor:
- first_name: Marco
  full_name: Platzner, Marco
  id: '398'
  last_name: Platzner
title: Hardware Trojans in Reconfigurable Computing
type: dissertation
user_id: '477'
year: '2022'
...
---
_id: '33669'
abstract:
- lang: eng
  text: Far-field multi-speaker automatic speech recognition (ASR) has drawn increasing
    attention in recent years. Most existing methods feature a signal processing frontend
    and an ASR backend. In realistic scenarios, these modules are usually trained
    separately or progressively, which suffers from either inter-module mismatch or
    a complicated training process. In this paper, we propose an end-to-end multi-channel
    model that jointly optimizes the speech enhancement (including speech dereverberation,
    denoising, and separation) frontend and the ASR backend as a single system. To
    the best of our knowledge, this is the first work that proposes to optimize dereverberation,
    beamforming, and multi-speaker ASR in a fully end-to-end manner. The frontend
    module consists of a weighted prediction error (WPE) based submodule for dereverberation
    and a neural beamformer for denoising and speech separation. For the backend,
    we adopt a widely used end-to-end (E2E) ASR architecture. It is worth noting that
    the entire model is differentiable and can be optimized in a fully end-to-end
    manner using only the ASR criterion, without the need of parallel signal-level
    labels. We evaluate the proposed model on several multi-speaker benchmark datasets,
    and experimental results show that the fully E2E ASR model can achieve competitive
    performance on both noisy and reverberant conditions, with over 30% relative word
    error rate (WER) reduction over the single-channel baseline systems.
author:
- first_name: Wangyou
  full_name: Zhang, Wangyou
  last_name: Zhang
- first_name: Xuankai
  full_name: Chang, Xuankai
  last_name: Chang
- first_name: Christoph
  full_name: Boeddeker, Christoph
  id: '40767'
  last_name: Boeddeker
- first_name: Tomohiro
  full_name: Nakatani, Tomohiro
  last_name: Nakatani
- first_name: Shinji
  full_name: Watanabe, Shinji
  last_name: Watanabe
- first_name: Yanmin
  full_name: Qian, Yanmin
  last_name: Qian
citation:
  ama: Zhang W, Chang X, Boeddeker C, Nakatani T, Watanabe S, Qian Y. End-to-End Dereverberation,
    Beamforming, and Speech Recognition in A Cocktail Party. <i>IEEE/ACM Transactions
    on Audio, Speech, and Language Processing</i>. Published online 2022. doi:<a href="https://doi.org/10.1109/TASLP.2022.3209942">10.1109/TASLP.2022.3209942</a>
  apa: Zhang, W., Chang, X., Boeddeker, C., Nakatani, T., Watanabe, S., &#38; Qian,
    Y. (2022). End-to-End Dereverberation, Beamforming, and Speech Recognition in
    A Cocktail Party. <i>IEEE/ACM Transactions on Audio, Speech, and Language Processing</i>.
    <a href="https://doi.org/10.1109/TASLP.2022.3209942">https://doi.org/10.1109/TASLP.2022.3209942</a>
  bibtex: '@article{Zhang_Chang_Boeddeker_Nakatani_Watanabe_Qian_2022, title={End-to-End
    Dereverberation, Beamforming, and Speech Recognition in A Cocktail Party}, DOI={<a
    href="https://doi.org/10.1109/TASLP.2022.3209942">10.1109/TASLP.2022.3209942</a>},
    journal={IEEE/ACM Transactions on Audio, Speech, and Language Processing}, author={Zhang,
    Wangyou and Chang, Xuankai and Boeddeker, Christoph and Nakatani, Tomohiro and
    Watanabe, Shinji and Qian, Yanmin}, year={2022} }'
  chicago: Zhang, Wangyou, Xuankai Chang, Christoph Boeddeker, Tomohiro Nakatani,
    Shinji Watanabe, and Yanmin Qian. “End-to-End Dereverberation, Beamforming, and
    Speech Recognition in A Cocktail Party.” <i>IEEE/ACM Transactions on Audio, Speech,
    and Language Processing</i>, 2022. <a href="https://doi.org/10.1109/TASLP.2022.3209942">https://doi.org/10.1109/TASLP.2022.3209942</a>.
  ieee: 'W. Zhang, X. Chang, C. Boeddeker, T. Nakatani, S. Watanabe, and Y. Qian,
    “End-to-End Dereverberation, Beamforming, and Speech Recognition in A Cocktail
    Party,” <i>IEEE/ACM Transactions on Audio, Speech, and Language Processing</i>,
    2022, doi: <a href="https://doi.org/10.1109/TASLP.2022.3209942">10.1109/TASLP.2022.3209942</a>.'
  mla: Zhang, Wangyou, et al. “End-to-End Dereverberation, Beamforming, and Speech
    Recognition in A Cocktail Party.” <i>IEEE/ACM Transactions on Audio, Speech, and
    Language Processing</i>, 2022, doi:<a href="https://doi.org/10.1109/TASLP.2022.3209942">10.1109/TASLP.2022.3209942</a>.
  short: W. Zhang, X. Chang, C. Boeddeker, T. Nakatani, S. Watanabe, Y. Qian, IEEE/ACM
    Transactions on Audio, Speech, and Language Processing (2022).
date_created: 2022-10-11T07:27:51Z
date_updated: 2022-12-05T12:35:31Z
ddc:
- '000'
department:
- _id: '54'
doi: 10.1109/TASLP.2022.3209942
file:
- access_level: open_access
  content_type: application/pdf
  creator: huesera
  date_created: 2022-10-11T07:23:13Z
  date_updated: 2022-10-11T07:23:13Z
  file_id: '33674'
  file_name: End-to-End_Dereverberation_Beamforming_and_Speech_Recognition_in_A_Cocktail_Party.pdf
  file_size: 6167931
  relation: main_file
file_date_updated: 2022-10-11T07:23:13Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
publication: IEEE/ACM Transactions on Audio, Speech, and Language Processing
publication_identifier:
  issn:
  - 'Print ISSN: 2329-9290 Electronic ISSN: 2329-9304'
publication_status: published
related_material:
  link:
  - relation: confirmation
    url: https://ieeexplore.ieee.org/abstract/document/9904314
status: public
title: End-to-End Dereverberation, Beamforming, and Speech Recognition in A Cocktail
  Party
type: journal_article
user_id: '40767'
year: '2022'
...
---
_id: '34197'
abstract:
- lang: eng
  text: <jats:title>Abstract</jats:title><jats:p>Comprehensive data understanding
    is a key success driver for data analytics projects. Knowing the characteristics
    of the data helps a lot in selecting the appropriate data analysis techniques.
    Especially in data-driven product planning, knowledge about the data is a necessary
    prerequisite because data of the use phase is very heterogeneous. However, companies
    often do not have the necessary know-how or time to build up solid data understanding
    in connection with data analysis. In this paper, we develop a methodology to organize
    and categorize and thus understand use phase data in a way that makes it accessible
    to general data analytics workflows, following a design science research approach.
    We first present a knowledge base that lists typical use phase data from a product
    planning view. Second, we develop a taxonomy based on standard literature and
    real data objects, which covers the diversity of the data considered. The taxonomy
    provides 8 dimensions that support classification of use phase data and allows
    to capture data characteristics from a data analytics view. Finally, we combine
    both views by clustering the objects of the knowledge base according to the taxonomy.
    Each of the resulting clusters covers a typical combination of analytics relevant
    characteristics occurring in practice. By abstracting from the diversity of use
    phase data into artifacts with manageable complexity, our approach provides guidance
    to choose appropriate data analysis and AI techniques.</jats:p>
author:
- first_name: Melina
  full_name: Panzner, Melina
  last_name: Panzner
- first_name: Sebastian
  full_name: von Enzberg, Sebastian
  last_name: von Enzberg
- first_name: Maurice
  full_name: Meyer, Maurice
  last_name: Meyer
- first_name: Roman
  full_name: Dumitrescu, Roman
  last_name: Dumitrescu
citation:
  ama: Panzner M, von Enzberg S, Meyer M, Dumitrescu R. Characterization of Usage
    Data with the Help of Data Classifications. <i>Journal of the Knowledge Economy</i>.
    Published online 2022. doi:<a href="https://doi.org/10.1007/s13132-022-01081-z">10.1007/s13132-022-01081-z</a>
  apa: Panzner, M., von Enzberg, S., Meyer, M., &#38; Dumitrescu, R. (2022). Characterization
    of Usage Data with the Help of Data Classifications. <i>Journal of the Knowledge
    Economy</i>. <a href="https://doi.org/10.1007/s13132-022-01081-z">https://doi.org/10.1007/s13132-022-01081-z</a>
  bibtex: '@article{Panzner_von Enzberg_Meyer_Dumitrescu_2022, title={Characterization
    of Usage Data with the Help of Data Classifications}, DOI={<a href="https://doi.org/10.1007/s13132-022-01081-z">10.1007/s13132-022-01081-z</a>},
    journal={Journal of the Knowledge Economy}, publisher={Springer Science and Business
    Media LLC}, author={Panzner, Melina and von Enzberg, Sebastian and Meyer, Maurice
    and Dumitrescu, Roman}, year={2022} }'
  chicago: Panzner, Melina, Sebastian von Enzberg, Maurice Meyer, and Roman Dumitrescu.
    “Characterization of Usage Data with the Help of Data Classifications.” <i>Journal
    of the Knowledge Economy</i>, 2022. <a href="https://doi.org/10.1007/s13132-022-01081-z">https://doi.org/10.1007/s13132-022-01081-z</a>.
  ieee: 'M. Panzner, S. von Enzberg, M. Meyer, and R. Dumitrescu, “Characterization
    of Usage Data with the Help of Data Classifications,” <i>Journal of the Knowledge
    Economy</i>, 2022, doi: <a href="https://doi.org/10.1007/s13132-022-01081-z">10.1007/s13132-022-01081-z</a>.'
  mla: Panzner, Melina, et al. “Characterization of Usage Data with the Help of Data
    Classifications.” <i>Journal of the Knowledge Economy</i>, Springer Science and
    Business Media LLC, 2022, doi:<a href="https://doi.org/10.1007/s13132-022-01081-z">10.1007/s13132-022-01081-z</a>.
  short: M. Panzner, S. von Enzberg, M. Meyer, R. Dumitrescu, Journal of the Knowledge
    Economy (2022).
date_created: 2022-12-05T12:49:56Z
date_updated: 2022-12-05T12:51:03Z
department:
- _id: '563'
doi: 10.1007/s13132-022-01081-z
keyword:
- Economics and Econometrics
language:
- iso: eng
publication: Journal of the Knowledge Economy
publication_identifier:
  issn:
  - 1868-7865
  - 1868-7873
publication_status: published
publisher: Springer Science and Business Media LLC
status: public
title: Characterization of Usage Data with the Help of Data Classifications
type: journal_article
user_id: '15782'
year: '2022'
...
---
_id: '34196'
abstract:
- lang: eng
  text: <jats:p>Mounting sensors in disk stack separators is often a major challenge
    due to the operating conditions. However, a process cannot be optimally monitored
    without sensors. Virtual sensors can be a solution to calculate the sought parameters
    from measurable values. We measured the vibrations of disk stack separators and
    applied machine learning (ML) to detect whether the separator contains only water
    or whether particles are also present. We combined seven ML classification algorithms
    with three feature engineering strategies and evaluated our model successfully
    on vibration data of an experimental disk stack separator. Our experimental results
    demonstrate that random forest in combination with manual feature engineering
    using domain specific knowledge about suitable features outperforms all other
    models with an accuracy of 91.27 %.</jats:p>
author:
- first_name: Silke
  full_name: Merkelbach, Silke
  last_name: Merkelbach
- first_name: Lameya
  full_name: Afroze, Lameya
  last_name: Afroze
- first_name: Nils
  full_name: Janssen, Nils
  last_name: Janssen
- first_name: Sebastian
  full_name: von Enzberg, Sebastian
  last_name: von Enzberg
- first_name: Arno
  full_name: Kühn, Arno
  last_name: Kühn
- first_name: Roman
  full_name: Dumitrescu, Roman
  last_name: Dumitrescu
citation:
  ama: Merkelbach S, Afroze L, Janssen N, von Enzberg S, Kühn A, Dumitrescu R. Using
    vibration data to classify conditions in disk stack separators. <i>Vibroengineering
    PROCEDIA</i>. 2022;46:21-26. doi:<a href="https://doi.org/10.21595/vp.2022.23000">10.21595/vp.2022.23000</a>
  apa: Merkelbach, S., Afroze, L., Janssen, N., von Enzberg, S., Kühn, A., &#38; Dumitrescu,
    R. (2022). Using vibration data to classify conditions in disk stack separators.
    <i>Vibroengineering PROCEDIA</i>, <i>46</i>, 21–26. <a href="https://doi.org/10.21595/vp.2022.23000">https://doi.org/10.21595/vp.2022.23000</a>
  bibtex: '@article{Merkelbach_Afroze_Janssen_von Enzberg_Kühn_Dumitrescu_2022, title={Using
    vibration data to classify conditions in disk stack separators}, volume={46},
    DOI={<a href="https://doi.org/10.21595/vp.2022.23000">10.21595/vp.2022.23000</a>},
    journal={Vibroengineering PROCEDIA}, publisher={JVE International Ltd.}, author={Merkelbach,
    Silke and Afroze, Lameya and Janssen, Nils and von Enzberg, Sebastian and Kühn,
    Arno and Dumitrescu, Roman}, year={2022}, pages={21–26} }'
  chicago: 'Merkelbach, Silke, Lameya Afroze, Nils Janssen, Sebastian von Enzberg,
    Arno Kühn, and Roman Dumitrescu. “Using Vibration Data to Classify Conditions
    in Disk Stack Separators.” <i>Vibroengineering PROCEDIA</i> 46 (2022): 21–26.
    <a href="https://doi.org/10.21595/vp.2022.23000">https://doi.org/10.21595/vp.2022.23000</a>.'
  ieee: 'S. Merkelbach, L. Afroze, N. Janssen, S. von Enzberg, A. Kühn, and R. Dumitrescu,
    “Using vibration data to classify conditions in disk stack separators,” <i>Vibroengineering
    PROCEDIA</i>, vol. 46, pp. 21–26, 2022, doi: <a href="https://doi.org/10.21595/vp.2022.23000">10.21595/vp.2022.23000</a>.'
  mla: Merkelbach, Silke, et al. “Using Vibration Data to Classify Conditions in Disk
    Stack Separators.” <i>Vibroengineering PROCEDIA</i>, vol. 46, JVE International
    Ltd., 2022, pp. 21–26, doi:<a href="https://doi.org/10.21595/vp.2022.23000">10.21595/vp.2022.23000</a>.
  short: S. Merkelbach, L. Afroze, N. Janssen, S. von Enzberg, A. Kühn, R. Dumitrescu,
    Vibroengineering PROCEDIA 46 (2022) 21–26.
date_created: 2022-12-05T12:47:22Z
date_updated: 2022-12-05T12:51:08Z
department:
- _id: '563'
doi: 10.21595/vp.2022.23000
intvolume: '        46'
keyword:
- General Medicine
language:
- iso: eng
page: 21-26
publication: Vibroengineering PROCEDIA
publication_identifier:
  issn:
  - 2345-0533
  - 2538-8479
publication_status: published
publisher: JVE International Ltd.
status: public
title: Using vibration data to classify conditions in disk stack separators
type: journal_article
user_id: '15782'
volume: 46
year: '2022'
...
---
_id: '34195'
author:
- first_name: Daniela
  full_name: Hobscheidt, Daniela
  last_name: Hobscheidt
- first_name: Jörn Steffen
  full_name: Menzefricke, Jörn Steffen
  last_name: Menzefricke
- first_name: Stefan
  full_name: Gabriel, Stefan
  last_name: Gabriel
- first_name: Arno
  full_name: Kühn, Arno
  last_name: Kühn
- first_name: Roman
  full_name: Dumitrescu, Roman
  last_name: Dumitrescu
citation:
  ama: 'Hobscheidt D, Menzefricke JS, Gabriel S, Kühn A, Dumitrescu R. Soziotechnische
    Herausforderungen bei der Einführung von RPA managen. In: <i>Praxishandbuch Robotic
    Process Automation (RPA)</i>. Springer Fachmedien Wiesbaden; 2022. doi:<a href="https://doi.org/10.1007/978-3-658-38379-4_8">10.1007/978-3-658-38379-4_8</a>'
  apa: Hobscheidt, D., Menzefricke, J. S., Gabriel, S., Kühn, A., &#38; Dumitrescu,
    R. (2022). Soziotechnische Herausforderungen bei der Einführung von RPA managen.
    In <i>Praxishandbuch Robotic Process Automation (RPA)</i>. Springer Fachmedien
    Wiesbaden. <a href="https://doi.org/10.1007/978-3-658-38379-4_8">https://doi.org/10.1007/978-3-658-38379-4_8</a>
  bibtex: '@inbook{Hobscheidt_Menzefricke_Gabriel_Kühn_Dumitrescu_2022, place={Wiesbaden},
    title={Soziotechnische Herausforderungen bei der Einführung von RPA managen},
    DOI={<a href="https://doi.org/10.1007/978-3-658-38379-4_8">10.1007/978-3-658-38379-4_8</a>},
    booktitle={Praxishandbuch Robotic Process Automation (RPA)}, publisher={Springer
    Fachmedien Wiesbaden}, author={Hobscheidt, Daniela and Menzefricke, Jörn Steffen
    and Gabriel, Stefan and Kühn, Arno and Dumitrescu, Roman}, year={2022} }'
  chicago: 'Hobscheidt, Daniela, Jörn Steffen Menzefricke, Stefan Gabriel, Arno Kühn,
    and Roman Dumitrescu. “Soziotechnische Herausforderungen Bei Der Einführung von
    RPA Managen.” In <i>Praxishandbuch Robotic Process Automation (RPA)</i>. Wiesbaden:
    Springer Fachmedien Wiesbaden, 2022. <a href="https://doi.org/10.1007/978-3-658-38379-4_8">https://doi.org/10.1007/978-3-658-38379-4_8</a>.'
  ieee: 'D. Hobscheidt, J. S. Menzefricke, S. Gabriel, A. Kühn, and R. Dumitrescu,
    “Soziotechnische Herausforderungen bei der Einführung von RPA managen,” in <i>Praxishandbuch
    Robotic Process Automation (RPA)</i>, Wiesbaden: Springer Fachmedien Wiesbaden,
    2022.'
  mla: Hobscheidt, Daniela, et al. “Soziotechnische Herausforderungen Bei Der Einführung
    von RPA Managen.” <i>Praxishandbuch Robotic Process Automation (RPA)</i>, Springer
    Fachmedien Wiesbaden, 2022, doi:<a href="https://doi.org/10.1007/978-3-658-38379-4_8">10.1007/978-3-658-38379-4_8</a>.
  short: 'D. Hobscheidt, J.S. Menzefricke, S. Gabriel, A. Kühn, R. Dumitrescu, in:
    Praxishandbuch Robotic Process Automation (RPA), Springer Fachmedien Wiesbaden,
    Wiesbaden, 2022.'
date_created: 2022-12-05T12:46:56Z
date_updated: 2022-12-05T12:51:11Z
department:
- _id: '563'
doi: 10.1007/978-3-658-38379-4_8
language:
- iso: eng
place: Wiesbaden
publication: Praxishandbuch Robotic Process Automation (RPA)
publication_identifier:
  isbn:
  - '9783658383787'
  - '9783658383794'
publication_status: published
publisher: Springer Fachmedien Wiesbaden
status: public
title: Soziotechnische Herausforderungen bei der Einführung von RPA managen
type: book_chapter
user_id: '15782'
year: '2022'
...
