---
_id: '1209'
abstract:
- lang: eng
text: 'My dissertation deals with the Gathering problem for swarms of n point-shaped
robots on a grid, in which all robots of the swarm are supposed to gather at a
previously undefined point. Special attention is paid to the strong limitation
of robot capabilities. These include in particular the lack of global control,
a global compass, global visibility and (global) communication skills. Furthermore,
all robots are identical. The robots are given only local abilities. This includes
a constant range of vision. The robots all work completely synchronously. In this
work we present and analyze three different Gathering strategies in different
robot models. We formally prove correctness and total running time: Chapter 4
focuses on minimizing the available robot capabilities. The underlying strategy
completes the gathering in O(n^2) time. For the following Chapters 5 and 6, the
aim is to optimize the total running time under using only local robot capabilities:
We additionally allow a constant-sized memory and a constant number of locally
visible statuses (lights, flags). For the strategies of both chapters we show
an asymptotically optimal running time of O(n). Unlike in Chapters 4 and 5, we
additionally restrict connectivity and vision to an initially given chain connectivity
in Chapter 6, where two chain neighbors must have a distance of 1 from each other.
A robot can only see and interact with a constant number of its direct chain neighbors.'
author:
- first_name: Daniel
full_name: Jung, Daniel
id: '37827'
last_name: Jung
citation:
ama: Jung D. Local Strategies for Swarm Formations on a Grid. Universität
Paderborn; 2018. doi:10.17619/UNIPB/1-271
apa: Jung, D. (2018). Local Strategies for Swarm Formations on a Grid. Universität
Paderborn. https://doi.org/10.17619/UNIPB/1-271
bibtex: '@book{Jung_2018, title={Local Strategies for Swarm Formations on a Grid},
DOI={10.17619/UNIPB/1-271},
publisher={Universität Paderborn}, author={Jung, Daniel}, year={2018} }'
chicago: Jung, Daniel. Local Strategies for Swarm Formations on a Grid. Universität
Paderborn, 2018. https://doi.org/10.17619/UNIPB/1-271.
ieee: D. Jung, Local Strategies for Swarm Formations on a Grid. Universität
Paderborn, 2018.
mla: Jung, Daniel. Local Strategies for Swarm Formations on a Grid. Universität
Paderborn, 2018, doi:10.17619/UNIPB/1-271.
short: D. Jung, Local Strategies for Swarm Formations on a Grid, Universität Paderborn,
2018.
date_created: 2018-03-13T10:26:16Z
date_updated: 2024-07-12T12:05:00Z
department:
- _id: '63'
- _id: '26'
doi: 10.17619/UNIPB/1-271
language:
- iso: eng
project:
- _id: '1'
grant_number: '160364472'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
grant_number: '160364472'
name: SFB 901 - Subproject A1
publication_identifier:
isbn:
- 978-3-942647-99-1
publisher: Universität Paderborn
related_material:
link:
- relation: confirmation
url: https://doi.org/10.17619/UNIPB/1-271
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: Local Strategies for Swarm Formations on a Grid
type: dissertation
user_id: '1112'
year: '2018'
...
---
_id: '8162'
abstract:
- lang: eng
text: 'The constraint satisfaction problems k-SAT and Quantum k-SAT (k-QSAT) are
canonical NP-complete and QMA_1-complete problems (for k >= 3), respectively,
where QMA_1 is a quantum generalization of NP with one-sided error. Whereas k-SAT
has been well-studied for special tractable cases, as well as from a parameterized
complexity perspective, much less is known in similar settings for k-QSAT. Here,
we study the open problem of computing satisfying assignments to k-QSAT instances
which have a "matching" or "dimer covering"; this is an NP problem whose decision
variant is trivial, but whose search complexity remains open. Our results fall
into three directions, all of which relate to the "matching" setting: (1) We give
a polynomial-time classical algorithm for k-QSAT when all qubits occur in at most
two clauses. (2) We give a parameterized algorithm for k-QSAT instances from a
certain non-trivial class, which allows us to obtain exponential speedups over
brute force methods in some cases by reducing the problem to solving for a single
root of a single univariate polynomial. (3) We conduct a structural graph theoretic
study of 3-QSAT interaction graphs which have a "matching". We remark that the
results of (2), in particular, introduce a number of new tools to the study of
Quantum SAT, including graph theoretic concepts such as transfer filtrations and
blow-ups from algebraic geometry; we hope these prove useful elsewhere.'
author:
- first_name: Marco
full_name: Aldi, Marco
last_name: Aldi
- first_name: Niel
full_name: de Beaudrap, Niel
last_name: de Beaudrap
- first_name: Sevag
full_name: Gharibian, Sevag
id: '71541'
last_name: Gharibian
orcid: 0000-0002-9992-3379
- first_name: Seyran
full_name: Saeedi, Seyran
last_name: Saeedi
citation:
ama: 'Aldi M, de Beaudrap N, Gharibian S, Saeedi S. On Efficiently Solvable Cases
of Quantum k-SAT. In: Potapov I, Spirakis P, Worrell J, eds. 43rd International
Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Vol
117. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl
- Leibniz-Zentrum fuer Informatik; 2018:38:1-38:16. doi:10.4230/LIPIcs.MFCS.2018.38'
apa: Aldi, M., de Beaudrap, N., Gharibian, S., & Saeedi, S. (2018). On Efficiently
Solvable Cases of Quantum k-SAT. In I. Potapov, P. Spirakis, & J. Worrell
(Eds.), 43rd International Symposium on Mathematical Foundations of Computer
Science (MFCS 2018) (Vol. 117, p. 38:1-38:16). Schloss Dagstuhl - Leibniz-Zentrum
fuer Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2018.38
bibtex: '@inproceedings{Aldi_de Beaudrap_Gharibian_Saeedi_2018, place={Dagstuhl,
Germany}, series={Leibniz International Proceedings in Informatics (LIPIcs)},
title={On Efficiently Solvable Cases of Quantum k-SAT}, volume={117}, DOI={10.4230/LIPIcs.MFCS.2018.38},
booktitle={43rd International Symposium on Mathematical Foundations of Computer
Science (MFCS 2018)}, publisher={Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
author={Aldi, Marco and de Beaudrap, Niel and Gharibian, Sevag and Saeedi, Seyran},
editor={Potapov, Igor and Spirakis, Paul and Worrell, James}, year={2018}, pages={38:1-38:16},
collection={Leibniz International Proceedings in Informatics (LIPIcs)} }'
chicago: 'Aldi, Marco, Niel de Beaudrap, Sevag Gharibian, and Seyran Saeedi. “On
Efficiently Solvable Cases of Quantum K-SAT.” In 43rd International Symposium
on Mathematical Foundations of Computer Science (MFCS 2018), edited by Igor
Potapov, Paul Spirakis, and James Worrell, 117:38:1-38:16. Leibniz International
Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum
fuer Informatik, 2018. https://doi.org/10.4230/LIPIcs.MFCS.2018.38.'
ieee: 'M. Aldi, N. de Beaudrap, S. Gharibian, and S. Saeedi, “On Efficiently Solvable
Cases of Quantum k-SAT,” in 43rd International Symposium on Mathematical Foundations
of Computer Science (MFCS 2018), Liverpool, UK, 2018, vol. 117, p. 38:1-38:16,
doi: 10.4230/LIPIcs.MFCS.2018.38.'
mla: Aldi, Marco, et al. “On Efficiently Solvable Cases of Quantum K-SAT.” 43rd
International Symposium on Mathematical Foundations of Computer Science (MFCS
2018), edited by Igor Potapov et al., vol. 117, Schloss Dagstuhl - Leibniz-Zentrum
fuer Informatik, 2018, p. 38:1-38:16, doi:10.4230/LIPIcs.MFCS.2018.38.
short: 'M. Aldi, N. de Beaudrap, S. Gharibian, S. Saeedi, in: I. Potapov, P. Spirakis,
J. Worrell (Eds.), 43rd International Symposium on Mathematical Foundations of
Computer Science (MFCS 2018), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik,
Dagstuhl, Germany, 2018, p. 38:1-38:16.'
conference:
location: Liverpool, UK
name: 43rd International Symposium on Mathematical Foundations of Computer Science
(MFCS 2018)
date_created: 2019-03-01T11:34:41Z
date_updated: 2023-02-28T11:01:16Z
department:
- _id: '623'
- _id: '7'
doi: 10.4230/LIPIcs.MFCS.2018.38
editor:
- first_name: Igor
full_name: Potapov, Igor
last_name: Potapov
- first_name: Paul
full_name: Spirakis, Paul
last_name: Spirakis
- first_name: James
full_name: Worrell, James
last_name: Worrell
external_id:
arxiv:
- '1712.09617'
intvolume: ' 117'
keyword:
- search complexity
- local Hamiltonian
- Quantum SAT
- algebraic geometry
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://drops.dagstuhl.de/opus/volltexte/2018/9620/
oa: '1'
page: 38:1-38:16
place: Dagstuhl, Germany
publication: 43rd International Symposium on Mathematical Foundations of Computer
Science (MFCS 2018)
publication_identifier:
unknown:
- 978-3-95977-086-6
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
series_title: Leibniz International Proceedings in Informatics (LIPIcs)
status: public
title: On Efficiently Solvable Cases of Quantum k-SAT
type: conference
user_id: '71541'
volume: 117
year: '2018'
...
---
_id: '8161'
abstract:
- lang: eng
text: The polynomial-time hierarchy (PH) has proven to be a powerful tool for providing
separations in computational complexity theory (modulo standard conjectures such
as PH does not collapse). Here, we study whether two quantum generalizations of
PH can similarly prove separations in the quantum setting. The first generalization,
QCPH, uses classical proofs, and the second, QPH, uses quantum proofs. For the
former, we show quantum variants of the Karp-Lipton theorem and Toda's theorem.
For the latter, we place its third level, Q Sigma_3, into NEXP using the Ellipsoid
Method for efficiently solving semidefinite programs. These results yield two
implications for QMA(2), the variant of Quantum Merlin-Arthur (QMA) with two unentangled
proofs, a complexity class whose characterization has proven difficult. First,
if QCPH=QPH (i.e., alternating quantifiers are sufficiently powerful so as to
make classical and quantum proofs "equivalent"), then QMA(2) is in the Counting
Hierarchy (specifically, in P^{PP^{PP}}). Second, unless QMA(2)= Q Sigma_3 (i.e.,
alternating quantifiers do not help in the presence of "unentanglement"), QMA(2)
is strictly contained in NEXP.
author:
- first_name: Sevag
full_name: Gharibian, Sevag
id: '71541'
last_name: Gharibian
orcid: 0000-0002-9992-3379
- first_name: Miklos
full_name: Santha, Miklos
last_name: Santha
- first_name: Jamie
full_name: Sikora, Jamie
last_name: Sikora
- first_name: Aarthi
full_name: Sundaram, Aarthi
last_name: Sundaram
- first_name: Justin
full_name: Yirka, Justin
last_name: Yirka
citation:
ama: 'Gharibian S, Santha M, Sikora J, Sundaram A, Yirka J. Quantum Generalizations
of the Polynomial Hierarchy with Applications to QMA(2). In: Potapov I, Spirakis
P, Worrell J, eds. 43rd International Symposium on Mathematical Foundations
of Computer Science (MFCS 2018). Vol 117. Leibniz International Proceedings
in Informatics (LIPIcs). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik; 2018:58:1-58:16.
doi:10.4230/LIPIcs.MFCS.2018.58'
apa: Gharibian, S., Santha, M., Sikora, J., Sundaram, A., & Yirka, J. (2018).
Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2).
In I. Potapov, P. Spirakis, & J. Worrell (Eds.), 43rd International Symposium
on Mathematical Foundations of Computer Science (MFCS 2018) (Vol. 117, p.
58:1-58:16). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2018.58
bibtex: '@inproceedings{Gharibian_Santha_Sikora_Sundaram_Yirka_2018, place={Dagstuhl,
Germany}, series={Leibniz International Proceedings in Informatics (LIPIcs)},
title={Quantum Generalizations of the Polynomial Hierarchy with Applications to
QMA(2)}, volume={117}, DOI={10.4230/LIPIcs.MFCS.2018.58},
booktitle={43rd International Symposium on Mathematical Foundations of Computer
Science (MFCS 2018)}, publisher={Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
author={Gharibian, Sevag and Santha, Miklos and Sikora, Jamie and Sundaram, Aarthi
and Yirka, Justin}, editor={Potapov, Igor and Spirakis, Paul and Worrell, James},
year={2018}, pages={58:1-58:16}, collection={Leibniz International Proceedings
in Informatics (LIPIcs)} }'
chicago: 'Gharibian, Sevag, Miklos Santha, Jamie Sikora, Aarthi Sundaram, and Justin
Yirka. “Quantum Generalizations of the Polynomial Hierarchy with Applications
to QMA(2).” In 43rd International Symposium on Mathematical Foundations of
Computer Science (MFCS 2018), edited by Igor Potapov, Paul Spirakis, and James
Worrell, 117:58:1-58:16. Leibniz International Proceedings in Informatics (LIPIcs).
Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. https://doi.org/10.4230/LIPIcs.MFCS.2018.58.'
ieee: 'S. Gharibian, M. Santha, J. Sikora, A. Sundaram, and J. Yirka, “Quantum Generalizations
of the Polynomial Hierarchy with Applications to QMA(2),” in 43rd International
Symposium on Mathematical Foundations of Computer Science (MFCS 2018), Liverpool,
UK, 2018, vol. 117, p. 58:1-58:16, doi: 10.4230/LIPIcs.MFCS.2018.58.'
mla: Gharibian, Sevag, et al. “Quantum Generalizations of the Polynomial Hierarchy
with Applications to QMA(2).” 43rd International Symposium on Mathematical
Foundations of Computer Science (MFCS 2018), edited by Igor Potapov et al.,
vol. 117, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018, p. 58:1-58:16,
doi:10.4230/LIPIcs.MFCS.2018.58.
short: 'S. Gharibian, M. Santha, J. Sikora, A. Sundaram, J. Yirka, in: I. Potapov,
P. Spirakis, J. Worrell (Eds.), 43rd International Symposium on Mathematical Foundations
of Computer Science (MFCS 2018), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik,
Dagstuhl, Germany, 2018, p. 58:1-58:16.'
conference:
location: Liverpool, UK
name: 43rd International Symposium on Mathematical Foundations of Computer Science
(MFCS 2018)
date_created: 2019-03-01T11:29:44Z
date_updated: 2023-02-28T11:01:03Z
department:
- _id: '623'
- _id: '7'
doi: 10.4230/LIPIcs.MFCS.2018.58
editor:
- first_name: Igor
full_name: Potapov, Igor
last_name: Potapov
- first_name: Paul
full_name: Spirakis, Paul
last_name: Spirakis
- first_name: James
full_name: Worrell, James
last_name: Worrell
external_id:
arxiv:
- '1805.11139'
intvolume: ' 117'
keyword:
- Complexity Theory
- Quantum Computing
- Polynomial Hierarchy
- Semidefinite Programming
- QMA(2)
- Quantum Complexity
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://drops.dagstuhl.de/opus/frontdoor.php?source_opus=9640
oa: '1'
page: 58:1-58:16
place: Dagstuhl, Germany
publication: 43rd International Symposium on Mathematical Foundations of Computer
Science (MFCS 2018)
publication_identifier:
unknown:
- 978-3-95977-086-6
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
series_title: Leibniz International Proceedings in Informatics (LIPIcs)
status: public
title: Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2)
type: conference
user_id: '71541'
volume: 117
year: '2018'
...
---
_id: '8160'
abstract:
- lang: eng
text: An important task in quantum physics is the estimation of local quantities
for ground states of local Hamiltonians. Recently, Ambainis defined the complexity
class P^QMA[log], and motivated its study by showing that the physical task of
estimating the expectation value of a local observable against the ground state
of a local Hamiltonian is P^QMA[log]-complete. In this paper, we continue the
study of P^QMA[log], obtaining the following results. The P^QMA[log]-completeness
result of Ambainis requires O(log n)-local observ- ables and Hamiltonians. We
show that simulating even a single qubit measurement on ground states of 5-local
Hamiltonians is P^QMA[log]-complete, resolving an open question of Ambainis. We
formalize the complexity theoretic study of estimating two-point correlation functions
against ground states, and show that this task is similarly P^QMA[log]-complete.
P^QMA[log] is thought of as "slightly harder" than QMA. We justify this formally
by exploiting the hierarchical voting technique of Beigel, Hemachandra, and Wechsung
to show P^QMA[log] \subseteq PP. This improves the containment QMA \subseteq PP
from Kitaev and Watrous. A central theme of this work is the subtlety involved
in the study of oracle classes in which the oracle solves a promise problem. In
this vein, we identify a flaw in Ambainis' prior work regarding a P^UQMA[log]-hardness
proof for estimating spectral gaps of local Hamiltonians. By introducing a "query
validation" technique, we build on his prior work to obtain P^UQMA[log]-hardness
for estimating spectral gaps under polynomial-time Turing reductions.
author:
- first_name: Sevag
full_name: Gharibian, Sevag
id: '71541'
last_name: Gharibian
orcid: 0000-0002-9992-3379
- first_name: Justin
full_name: Yirka, Justin
last_name: Yirka
citation:
ama: 'Gharibian S, Yirka J. The Complexity of Simulating Local Measurements on Quantum
Systems. In: Wilde M, ed. 12th Conference on the Theory of Quantum Computation,
Communication and Cryptography (TQC 2017). Vol 73. Leibniz International Proceedings
in Informatics (LIPIcs). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik; 2018:2:1-2:17.
doi:10.4230/LIPIcs.TQC.2017.2'
apa: Gharibian, S., & Yirka, J. (2018). The Complexity of Simulating Local Measurements
on Quantum Systems. In M. Wilde (Ed.), 12th Conference on the Theory of Quantum
Computation, Communication and Cryptography (TQC 2017) (Vol. 73, p. 2:1-2:17).
Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.TQC.2017.2
bibtex: '@inproceedings{Gharibian_Yirka_2018, place={Dagstuhl, Germany}, series={Leibniz
International Proceedings in Informatics (LIPIcs)}, title={The Complexity of Simulating
Local Measurements on Quantum Systems}, volume={73}, DOI={10.4230/LIPIcs.TQC.2017.2},
booktitle={12th Conference on the Theory of Quantum Computation, Communication
and Cryptography (TQC 2017)}, publisher={Schloss Dagstuhl - Leibniz-Zentrum fuer
Informatik}, author={Gharibian, Sevag and Yirka, Justin}, editor={Wilde, Mark},
year={2018}, pages={2:1-2:17}, collection={Leibniz International Proceedings in
Informatics (LIPIcs)} }'
chicago: 'Gharibian, Sevag, and Justin Yirka. “The Complexity of Simulating Local
Measurements on Quantum Systems.” In 12th Conference on the Theory of Quantum
Computation, Communication and Cryptography (TQC 2017), edited by Mark Wilde,
73:2:1-2:17. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl,
Germany: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. https://doi.org/10.4230/LIPIcs.TQC.2017.2.'
ieee: 'S. Gharibian and J. Yirka, “The Complexity of Simulating Local Measurements
on Quantum Systems,” in 12th Conference on the Theory of Quantum Computation,
Communication and Cryptography (TQC 2017), Paris, France, 2018, vol. 73, p.
2:1-2:17, doi: 10.4230/LIPIcs.TQC.2017.2.'
mla: Gharibian, Sevag, and Justin Yirka. “The Complexity of Simulating Local Measurements
on Quantum Systems.” 12th Conference on the Theory of Quantum Computation,
Communication and Cryptography (TQC 2017), edited by Mark Wilde, vol. 73,
Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018, p. 2:1-2:17, doi:10.4230/LIPIcs.TQC.2017.2.
short: 'S. Gharibian, J. Yirka, in: M. Wilde (Ed.), 12th Conference on the Theory
of Quantum Computation, Communication and Cryptography (TQC 2017), Schloss Dagstuhl
- Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2018, p. 2:1-2:17.'
conference:
location: Paris, France
name: 12th Conference on the Theory of Quantum Computation, Communication and Cryptography
(TQC 2017)
date_created: 2019-03-01T11:25:27Z
date_updated: 2023-02-28T11:00:48Z
department:
- _id: '623'
- _id: '7'
doi: 10.4230/LIPIcs.TQC.2017.2
editor:
- first_name: Mark
full_name: Wilde, Mark
last_name: Wilde
external_id:
arxiv:
- '1606.05626'
intvolume: ' 73'
keyword:
- Complexity theory
- Quantum Merlin Arthur (QMA)
- local Hamiltonian
- local measurement
- spectral gap
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://drops.dagstuhl.de/opus/frontdoor.php?source_opus=8577
oa: '1'
page: 2:1-2:17
place: Dagstuhl, Germany
publication: 12th Conference on the Theory of Quantum Computation, Communication and
Cryptography (TQC 2017)
publication_identifier:
unknown:
- 978-3-95977-034-7
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
series_title: Leibniz International Proceedings in Informatics (LIPIcs)
status: public
title: The Complexity of Simulating Local Measurements on Quantum Systems
type: conference
user_id: '71541'
volume: 73
year: '2018'
...
---
_id: '8167'
author:
- first_name: Sevag
full_name: Gharibian, Sevag
id: '71541'
last_name: Gharibian
orcid: 0000-0002-9992-3379
- first_name: Jamie
full_name: Sikora, Jamie
last_name: Sikora
citation:
ama: Gharibian S, Sikora J. Ground State Connectivity of Local Hamiltonians. ACM
Transactions on Computation Theory (TOCT). 2018;10(2):8:1-8:28. doi:10.1145/3186587
apa: Gharibian, S., & Sikora, J. (2018). Ground State Connectivity of Local
Hamiltonians. ACM Transactions on Computation Theory (TOCT), 10(2),
8:1-8:28. https://doi.org/10.1145/3186587
bibtex: '@article{Gharibian_Sikora_2018, title={Ground State Connectivity of Local
Hamiltonians}, volume={10}, DOI={10.1145/3186587},
number={2}, journal={ACM Transactions on Computation Theory (TOCT)}, publisher={ACM},
author={Gharibian, Sevag and Sikora, Jamie}, year={2018}, pages={8:1-8:28} }'
chicago: 'Gharibian, Sevag, and Jamie Sikora. “Ground State Connectivity of Local
Hamiltonians.” ACM Transactions on Computation Theory (TOCT) 10, no. 2
(2018): 8:1-8:28. https://doi.org/10.1145/3186587.'
ieee: 'S. Gharibian and J. Sikora, “Ground State Connectivity of Local Hamiltonians,”
ACM Transactions on Computation Theory (TOCT), vol. 10, no. 2, p. 8:1-8:28,
2018, doi: 10.1145/3186587.'
mla: Gharibian, Sevag, and Jamie Sikora. “Ground State Connectivity of Local Hamiltonians.”
ACM Transactions on Computation Theory (TOCT), vol. 10, no. 2, ACM, 2018,
p. 8:1-8:28, doi:10.1145/3186587.
short: S. Gharibian, J. Sikora, ACM Transactions on Computation Theory (TOCT) 10
(2018) 8:1-8:28.
date_created: 2019-03-01T11:49:31Z
date_updated: 2023-02-28T11:01:36Z
department:
- _id: '623'
- _id: '7'
doi: 10.1145/3186587
external_id:
arxiv:
- '1409.3182'
intvolume: ' 10'
issue: '2'
keyword:
- Local Hamiltonian
- ground state connectivity
- quantum Hamiltonian complexity
- reconfiguration problem
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1409.3182
oa: '1'
page: 8:1-8:28
publication: ACM Transactions on Computation Theory (TOCT)
publication_identifier:
issn:
- 1942-3454
publication_status: published
publisher: ACM
status: public
title: Ground State Connectivity of Local Hamiltonians
type: journal_article
user_id: '71541'
volume: 10
year: '2018'
...
---
_id: '1588'
abstract:
- lang: eng
text: The exploration of FPGAs as accelerators for scientific simulations has so
far mostly been focused on small kernels of methods working on regular data structures,
for example in the form of stencil computations for finite difference methods.
In computational sciences, often more advanced methods are employed that promise
better stability, convergence, locality and scaling. Unstructured meshes are shown
to be more effective and more accurate, compared to regular grids, in representing
computation domains of various shapes. Using unstructured meshes, the discontinuous
Galerkin method preserves the ability to perform explicit local update operations
for simulations in the time domain. In this work, we investigate FPGAs as target
platform for an implementation of the nodal discontinuous Galerkin method to find
time-domain solutions of Maxwell's equations in an unstructured mesh. When maximizing
data reuse and fitting constant coefficients into suitably partitioned on-chip
memory, high computational intensity allows us to implement and feed wide data
paths with hundreds of floating point operators. By decoupling off-chip memory
accesses from the computations, high memory bandwidth can be sustained, even for
the irregular access pattern required by parts of the application. Using the Intel/Altera
OpenCL SDK for FPGAs, we present different implementation variants for different
polynomial orders of the method. In different phases of the algorithm, either
computational or bandwidth limits of the Arria 10 platform are almost reached,
thus outperforming a highly multithreaded CPU implementation by around 2x.
author:
- first_name: Tobias
full_name: Kenter, Tobias
id: '3145'
last_name: Kenter
- first_name: Gopinath
full_name: Mahale, Gopinath
last_name: Mahale
- first_name: Samer
full_name: Alhaddad, Samer
id: '42456'
last_name: Alhaddad
- first_name: Yevgen
full_name: Grynko, Yevgen
id: '26059'
last_name: Grynko
- first_name: Christian
full_name: Schmitt, Christian
last_name: Schmitt
- first_name: Ayesha
full_name: Afzal, Ayesha
last_name: Afzal
- first_name: Frank
full_name: Hannig, Frank
last_name: Hannig
- first_name: Jens
full_name: Förstner, Jens
id: '158'
last_name: Förstner
orcid: 0000-0001-7059-9862
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
citation:
ama: 'Kenter T, Mahale G, Alhaddad S, et al. OpenCL-based FPGA Design to Accelerate
the Nodal Discontinuous Galerkin Method for Unstructured Meshes. In: Proc.
Int. Symp. on Field-Programmable Custom Computing Machines (FCCM). IEEE; 2018.
doi:10.1109/FCCM.2018.00037'
apa: Kenter, T., Mahale, G., Alhaddad, S., Grynko, Y., Schmitt, C., Afzal, A., Hannig,
F., Förstner, J., & Plessl, C. (2018). OpenCL-based FPGA Design to Accelerate
the Nodal Discontinuous Galerkin Method for Unstructured Meshes. Proc. Int.
Symp. on Field-Programmable Custom Computing Machines (FCCM). Proc. Int. Symp.
on Field-Programmable Custom Computing Machines (FCCM). https://doi.org/10.1109/FCCM.2018.00037
bibtex: '@inproceedings{Kenter_Mahale_Alhaddad_Grynko_Schmitt_Afzal_Hannig_Förstner_Plessl_2018,
title={OpenCL-based FPGA Design to Accelerate the Nodal Discontinuous Galerkin
Method for Unstructured Meshes}, DOI={10.1109/FCCM.2018.00037},
booktitle={Proc. Int. Symp. on Field-Programmable Custom Computing Machines (FCCM)},
publisher={IEEE}, author={Kenter, Tobias and Mahale, Gopinath and Alhaddad, Samer
and Grynko, Yevgen and Schmitt, Christian and Afzal, Ayesha and Hannig, Frank
and Förstner, Jens and Plessl, Christian}, year={2018} }'
chicago: Kenter, Tobias, Gopinath Mahale, Samer Alhaddad, Yevgen Grynko, Christian
Schmitt, Ayesha Afzal, Frank Hannig, Jens Förstner, and Christian Plessl. “OpenCL-Based
FPGA Design to Accelerate the Nodal Discontinuous Galerkin Method for Unstructured
Meshes.” In Proc. Int. Symp. on Field-Programmable Custom Computing Machines
(FCCM). IEEE, 2018. https://doi.org/10.1109/FCCM.2018.00037.
ieee: 'T. Kenter et al., “OpenCL-based FPGA Design to Accelerate the Nodal
Discontinuous Galerkin Method for Unstructured Meshes,” presented at the Proc.
Int. Symp. on Field-Programmable Custom Computing Machines (FCCM), 2018, doi:
10.1109/FCCM.2018.00037.'
mla: Kenter, Tobias, et al. “OpenCL-Based FPGA Design to Accelerate the Nodal Discontinuous
Galerkin Method for Unstructured Meshes.” Proc. Int. Symp. on Field-Programmable
Custom Computing Machines (FCCM), IEEE, 2018, doi:10.1109/FCCM.2018.00037.
short: 'T. Kenter, G. Mahale, S. Alhaddad, Y. Grynko, C. Schmitt, A. Afzal, F. Hannig,
J. Förstner, C. Plessl, in: Proc. Int. Symp. on Field-Programmable Custom Computing
Machines (FCCM), IEEE, 2018.'
conference:
name: Proc. Int. Symp. on Field-Programmable Custom Computing Machines (FCCM)
date_created: 2018-03-22T10:48:01Z
date_updated: 2023-09-26T11:47:52Z
ddc:
- '000'
department:
- _id: '27'
- _id: '518'
- _id: '61'
doi: 10.1109/FCCM.2018.00037
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:45:05Z
date_updated: 2018-11-02T14:45:05Z
file_id: '5282'
file_name: 08457652.pdf
file_size: 269130
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:45:05Z
has_accepted_license: '1'
keyword:
- tet_topic_hpc
language:
- iso: eng
project:
- _id: '33'
grant_number: 01|H16005A
name: HighPerMeshes
- _id: '1'
grant_number: '160364472'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '14'
grant_number: '160364472'
name: SFB 901 - Subproject C2
publication: Proc. Int. Symp. on Field-Programmable Custom Computing Machines (FCCM)
publisher: IEEE
quality_controlled: '1'
status: public
title: OpenCL-based FPGA Design to Accelerate the Nodal Discontinuous Galerkin Method
for Unstructured Meshes
type: conference
user_id: '15278'
year: '2018'
...
---
_id: '1590'
abstract:
- lang: eng
text: "We present the submatrix method, a highly parallelizable method for the approximate
calculation of inverse p-th roots of large sparse symmetric matrices which are
required in different scientific applications. Following the idea of Approximate
Computing, we allow imprecision in the final result in order to utilize the sparsity
of the input matrix and to allow massively parallel execution. For an n x n matrix,
the proposed algorithm allows to distribute the calculations over n nodes with
only little communication overhead. The result matrix exhibits the same sparsity
pattern as the input matrix, allowing for efficient reuse of allocated data structures.\r\n\r\nWe
evaluate the algorithm with respect to the error that it introduces into calculated
results, as well as its performance and scalability. We demonstrate that the error
is relatively limited for well-conditioned matrices and that results are still
valuable for error-resilient applications like preconditioning even for ill-conditioned
matrices. We discuss the execution time and scaling of the algorithm on a theoretical
level and present a distributed implementation of the algorithm using MPI and
OpenMP. We demonstrate the scalability of this implementation by running it on
a high-performance compute cluster comprised of 1024 CPU cores, showing a speedup
of 665x compared to single-threaded execution."
author:
- first_name: Michael
full_name: Lass, Michael
id: '24135'
last_name: Lass
orcid: 0000-0002-5708-7632
- first_name: Stephan
full_name: Mohr, Stephan
last_name: Mohr
- first_name: Hendrik
full_name: Wiebeler, Hendrik
last_name: Wiebeler
- first_name: Thomas
full_name: Kühne, Thomas
id: '49079'
last_name: Kühne
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
citation:
ama: 'Lass M, Mohr S, Wiebeler H, Kühne T, Plessl C. A Massively Parallel Algorithm
for the Approximate Calculation of Inverse p-th Roots of Large Sparse Matrices.
In: Proc. Platform for Advanced Scientific Computing (PASC) Conference.
ACM; 2018. doi:10.1145/3218176.3218231'
apa: Lass, M., Mohr, S., Wiebeler, H., Kühne, T., & Plessl, C. (2018). A Massively
Parallel Algorithm for the Approximate Calculation of Inverse p-th Roots of Large
Sparse Matrices. Proc. Platform for Advanced Scientific Computing (PASC) Conference.
Platform for Advanced Scientific Computing Conference (PASC), Basel, Switzerland.
https://doi.org/10.1145/3218176.3218231
bibtex: '@inproceedings{Lass_Mohr_Wiebeler_Kühne_Plessl_2018, place={New York, NY,
USA}, title={A Massively Parallel Algorithm for the Approximate Calculation of
Inverse p-th Roots of Large Sparse Matrices}, DOI={10.1145/3218176.3218231},
booktitle={Proc. Platform for Advanced Scientific Computing (PASC) Conference},
publisher={ACM}, author={Lass, Michael and Mohr, Stephan and Wiebeler, Hendrik
and Kühne, Thomas and Plessl, Christian}, year={2018} }'
chicago: 'Lass, Michael, Stephan Mohr, Hendrik Wiebeler, Thomas Kühne, and Christian
Plessl. “A Massively Parallel Algorithm for the Approximate Calculation of Inverse
P-Th Roots of Large Sparse Matrices.” In Proc. Platform for Advanced Scientific
Computing (PASC) Conference. New York, NY, USA: ACM, 2018. https://doi.org/10.1145/3218176.3218231.'
ieee: 'M. Lass, S. Mohr, H. Wiebeler, T. Kühne, and C. Plessl, “A Massively Parallel
Algorithm for the Approximate Calculation of Inverse p-th Roots of Large Sparse
Matrices,” presented at the Platform for Advanced Scientific Computing Conference
(PASC), Basel, Switzerland, 2018, doi: 10.1145/3218176.3218231.'
mla: Lass, Michael, et al. “A Massively Parallel Algorithm for the Approximate Calculation
of Inverse P-Th Roots of Large Sparse Matrices.” Proc. Platform for Advanced
Scientific Computing (PASC) Conference, ACM, 2018, doi:10.1145/3218176.3218231.
short: 'M. Lass, S. Mohr, H. Wiebeler, T. Kühne, C. Plessl, in: Proc. Platform for
Advanced Scientific Computing (PASC) Conference, ACM, New York, NY, USA, 2018.'
conference:
end_date: 2018-07-04
location: Basel, Switzerland
name: Platform for Advanced Scientific Computing Conference (PASC)
start_date: 2018-07-02
date_created: 2018-03-22T10:53:01Z
date_updated: 2023-09-26T11:48:12Z
department:
- _id: '27'
- _id: '518'
- _id: '304'
doi: 10.1145/3218176.3218231
external_id:
arxiv:
- '1710.10899'
keyword:
- approximate computing
- linear algebra
- matrix inversion
- matrix p-th roots
- numeric algorithm
- parallel computing
language:
- iso: eng
place: New York, NY, USA
project:
- _id: '32'
grant_number: PL 595/2-1 / 320898746
name: Performance and Efficiency in HPC with Custom Computing
- _id: '52'
name: Computing Resources Provided by the Paderborn Center for Parallel Computing
publication: Proc. Platform for Advanced Scientific Computing (PASC) Conference
publication_identifier:
isbn:
- 978-1-4503-5891-0/18/07
publisher: ACM
quality_controlled: '1'
status: public
title: A Massively Parallel Algorithm for the Approximate Calculation of Inverse p-th
Roots of Large Sparse Matrices
type: conference
user_id: '15278'
year: '2018'
...
---
_id: '1204'
author:
- first_name: Heinrich
full_name: Riebler, Heinrich
id: '8961'
last_name: Riebler
- first_name: Gavin Francis
full_name: Vaz, Gavin Francis
id: '30332'
last_name: Vaz
- first_name: Tobias
full_name: Kenter, Tobias
id: '3145'
last_name: Kenter
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
citation:
ama: 'Riebler H, Vaz GF, Kenter T, Plessl C. Automated Code Acceleration Targeting
Heterogeneous OpenCL Devices. In: Proc. ACM SIGPLAN Symposium on Principles
and Practice of Parallel Programming (PPoPP). ACM; 2018. doi:10.1145/3178487.3178534'
apa: Riebler, H., Vaz, G. F., Kenter, T., & Plessl, C. (2018). Automated Code
Acceleration Targeting Heterogeneous OpenCL Devices. Proc. ACM SIGPLAN Symposium
on Principles and Practice of Parallel Programming (PPoPP). https://doi.org/10.1145/3178487.3178534
bibtex: '@inproceedings{Riebler_Vaz_Kenter_Plessl_2018, title={Automated Code Acceleration
Targeting Heterogeneous OpenCL Devices}, DOI={10.1145/3178487.3178534},
booktitle={Proc. ACM SIGPLAN Symposium on Principles and Practice of Parallel
Programming (PPoPP)}, publisher={ACM}, author={Riebler, Heinrich and Vaz, Gavin
Francis and Kenter, Tobias and Plessl, Christian}, year={2018} }'
chicago: Riebler, Heinrich, Gavin Francis Vaz, Tobias Kenter, and Christian Plessl.
“Automated Code Acceleration Targeting Heterogeneous OpenCL Devices.” In Proc.
ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP).
ACM, 2018. https://doi.org/10.1145/3178487.3178534.
ieee: 'H. Riebler, G. F. Vaz, T. Kenter, and C. Plessl, “Automated Code Acceleration
Targeting Heterogeneous OpenCL Devices,” 2018, doi: 10.1145/3178487.3178534.'
mla: Riebler, Heinrich, et al. “Automated Code Acceleration Targeting Heterogeneous
OpenCL Devices.” Proc. ACM SIGPLAN Symposium on Principles and Practice of
Parallel Programming (PPoPP), ACM, 2018, doi:10.1145/3178487.3178534.
short: 'H. Riebler, G.F. Vaz, T. Kenter, C. Plessl, in: Proc. ACM SIGPLAN Symposium
on Principles and Practice of Parallel Programming (PPoPP), ACM, 2018.'
date_created: 2018-03-08T14:45:18Z
date_updated: 2023-09-26T11:47:23Z
ddc:
- '000'
department:
- _id: '27'
- _id: '518'
doi: 10.1145/3178487.3178534
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:43:37Z
date_updated: 2018-11-02T14:43:37Z
file_id: '5281'
file_name: p417-riebler.pdf
file_size: 447769
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:43:37Z
has_accepted_license: '1'
keyword:
- htrop
language:
- iso: eng
project:
- _id: '1'
grant_number: '160364472'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '14'
grant_number: '160364472'
name: SFB 901 - Subproject C2
publication: Proc. ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
(PPoPP)
publication_identifier:
isbn:
- '9781450349826'
publication_status: published
publisher: ACM
quality_controlled: '1'
status: public
title: Automated Code Acceleration Targeting Heterogeneous OpenCL Devices
type: conference
user_id: '15278'
year: '2018'
...
---
_id: '56157'
alternative_title:
- a concept for repair cafes in computing edcuation
author:
- first_name: Carsten
full_name: Schulte, Carsten
last_name: Schulte
- first_name: Jessica
full_name: Krüger, Jessica
last_name: Krüger
- first_name: Andreas
full_name: Gödecke, Andreas
id: '9503'
last_name: Gödecke
- first_name: Ann-Katrin
full_name: Schmidt, Ann-Katrin
last_name: Schmidt
citation:
ama: 'Schulte C, Krüger J, Gödecke A, Schmidt A-K. The computing repair cafe. In:
Proceedings of the 13th Workshop in Primary and Secondary Computing Education.
ACM; 2018. doi:10.1145/3265757.3265781'
apa: Schulte, C., Krüger, J., Gödecke, A., & Schmidt, A.-K. (2018). The computing
repair cafe. Proceedings of the 13th Workshop in Primary and Secondary Computing
Education. https://doi.org/10.1145/3265757.3265781
bibtex: '@inproceedings{Schulte_Krüger_Gödecke_Schmidt_2018, title={The computing
repair cafe}, DOI={10.1145/3265757.3265781},
booktitle={Proceedings of the 13th Workshop in Primary and Secondary Computing
Education}, publisher={ACM}, author={Schulte, Carsten and Krüger, Jessica and
Gödecke, Andreas and Schmidt, Ann-Katrin}, year={2018} }'
chicago: Schulte, Carsten, Jessica Krüger, Andreas Gödecke, and Ann-Katrin Schmidt.
“The Computing Repair Cafe.” In Proceedings of the 13th Workshop in Primary
and Secondary Computing Education. ACM, 2018. https://doi.org/10.1145/3265757.3265781.
ieee: 'C. Schulte, J. Krüger, A. Gödecke, and A.-K. Schmidt, “The computing repair
cafe,” 2018, doi: 10.1145/3265757.3265781.'
mla: Schulte, Carsten, et al. “The Computing Repair Cafe.” Proceedings of the
13th Workshop in Primary and Secondary Computing Education, ACM, 2018, doi:10.1145/3265757.3265781.
short: 'C. Schulte, J. Krüger, A. Gödecke, A.-K. Schmidt, in: Proceedings of the
13th Workshop in Primary and Secondary Computing Education, ACM, 2018.'
date_created: 2024-09-17T08:42:15Z
date_updated: 2024-09-17T08:43:34Z
department:
- _id: '67'
doi: 10.1145/3265757.3265781
language:
- iso: eng
publication: Proceedings of the 13th Workshop in Primary and Secondary Computing Education
publication_status: published
publisher: ACM
status: public
title: The computing repair cafe
type: conference
user_id: '9503'
year: '2018'
...
---
_id: '15646'
author:
- first_name: Birte
full_name: Heinemann, Birte
last_name: Heinemann
- first_name: Simone Anna
full_name: Opel, Simone Anna
id: '72932'
last_name: Opel
- first_name: Lea
full_name: Budde, Lea
id: '32443'
last_name: Budde
- first_name: Carsten
full_name: Schulte, Carsten
id: '60311'
last_name: Schulte
- first_name: Daniel
full_name: Frischemeier, Daniel
last_name: Frischemeier
- first_name: Rolf
full_name: Biehler, Rolf
last_name: Biehler
- first_name: Susanne
full_name: Podworny, Susanne
last_name: Podworny
- first_name: Thomas
full_name: Wassong, Thomas
id: '21241'
last_name: Wassong
citation:
ama: 'Heinemann B, Opel SA, Budde L, et al. Drafting a Data Science Curriculum for
Secondary Schools. In: Koli Calling. ACM; 2018:17:1-17:5.'
apa: Heinemann, B., Opel, S. A., Budde, L., Schulte, C., Frischemeier, D., Biehler,
R., Podworny, S., & Wassong, T. (2018). Drafting a Data Science Curriculum
for Secondary Schools. Koli Calling, 17:1-17:5.
bibtex: '@inproceedings{Heinemann_Opel_Budde_Schulte_Frischemeier_Biehler_Podworny_Wassong_2018,
title={Drafting a Data Science Curriculum for Secondary Schools}, booktitle={Koli
Calling}, publisher={ACM}, author={Heinemann, Birte and Opel, Simone Anna and
Budde, Lea and Schulte, Carsten and Frischemeier, Daniel and Biehler, Rolf and
Podworny, Susanne and Wassong, Thomas}, year={2018}, pages={17:1-17:5} }'
chicago: Heinemann, Birte, Simone Anna Opel, Lea Budde, Carsten Schulte, Daniel
Frischemeier, Rolf Biehler, Susanne Podworny, and Thomas Wassong. “Drafting a
Data Science Curriculum for Secondary Schools.” In Koli Calling, 17:1-17:5.
ACM, 2018.
ieee: B. Heinemann et al., “Drafting a Data Science Curriculum for Secondary
Schools,” in Koli Calling, 2018, p. 17:1-17:5.
mla: Heinemann, Birte, et al. “Drafting a Data Science Curriculum for Secondary
Schools.” Koli Calling, ACM, 2018, p. 17:1-17:5.
short: 'B. Heinemann, S.A. Opel, L. Budde, C. Schulte, D. Frischemeier, R. Biehler,
S. Podworny, T. Wassong, in: Koli Calling, ACM, 2018, p. 17:1-17:5.'
date_created: 2020-01-28T10:28:41Z
date_updated: 2025-05-25T20:14:49Z
department:
- _id: '67'
language:
- iso: eng
page: 17:1-17:5
publication: Koli Calling
publisher: ACM
status: public
title: Drafting a Data Science Curriculum for Secondary Schools
type: conference
user_id: '21241'
year: '2018'
...
---
_id: '46539'
abstract:
- lang: eng
text: This paper describes the Ontology Alignment Evaluation Initiative 2017.5 pre-campaign.
Like in 2012, when we transitioned the evaluation to the SEALS platform, we have
also conducted a pre-campaign to assess the feasibility of moving to the HOBBIT
platform. We report the experiences of this precampaign and discuss the future
steps for the OAEI.
author:
- first_name: Ernesto
full_name: Jiménez-Ruiz, Ernesto
last_name: Jiménez-Ruiz
- first_name: Tzanina
full_name: Saveta, Tzanina
last_name: Saveta
- first_name: Ondrej
full_name: Zamazal, Ondrej
last_name: Zamazal
- first_name: Sven
full_name: Hertling, Sven
last_name: Hertling
- first_name: Michael
full_name: Röder, Michael
last_name: Röder
- first_name: Irini
full_name: Fundulaki, Irini
last_name: Fundulaki
- first_name: Axel-Cyrille
full_name: Ngonga Ngomo, Axel-Cyrille
id: '65716'
last_name: Ngonga Ngomo
- first_name: Mohamed
full_name: Sherif, Mohamed
id: '67234'
last_name: Sherif
orcid: https://orcid.org/0000-0002-9927-2203
- first_name: Amina
full_name: Annane, Amina
last_name: Annane
- first_name: Zohra
full_name: Bellahsene, Zohra
last_name: Bellahsene
- first_name: Sadok Ben
full_name: Yahia, Sadok Ben
last_name: Yahia
- first_name: Gayo
full_name: Diallo, Gayo
last_name: Diallo
- first_name: Daniel
full_name: Faria, Daniel
last_name: Faria
- first_name: Marouen
full_name: Kachroudi, Marouen
last_name: Kachroudi
- first_name: Abderrahmane
full_name: Khiat, Abderrahmane
last_name: Khiat
- first_name: Patrick
full_name: Lambrix, Patrick
last_name: Lambrix
- first_name: Huanyu
full_name: Li, Huanyu
last_name: Li
- first_name: Maximilian
full_name: Mackeprang, Maximilian
last_name: Mackeprang
- first_name: Majid
full_name: Mohammadi, Majid
last_name: Mohammadi
- first_name: Maciej
full_name: Rybinski, Maciej
last_name: Rybinski
- first_name: Booma Sowkarthiga
full_name: Balasubramani, Booma Sowkarthiga
last_name: Balasubramani
- first_name: Cassia
full_name: Trojahn, Cassia
last_name: Trojahn
citation:
ama: 'Jiménez-Ruiz E, Saveta T, Zamazal O, et al. Introducing the HOBBIT platform
into the Ontology Alignment Evaluation Campaign. In: Proceedings of the Ontology
Matching Workshop 2018. ; 2018.'
apa: Jiménez-Ruiz, E., Saveta, T., Zamazal, O., Hertling, S., Röder, M., Fundulaki,
I., Ngonga Ngomo, A.-C., Sherif, M., Annane, A., Bellahsene, Z., Yahia, S. B.,
Diallo, G., Faria, D., Kachroudi, M., Khiat, A., Lambrix, P., Li, H., Mackeprang,
M., Mohammadi, M., … Trojahn, C. (2018). Introducing the HOBBIT platform into
the Ontology Alignment Evaluation Campaign. Proceedings of the Ontology Matching
Workshop 2018.
bibtex: '@inproceedings{Jiménez-Ruiz_Saveta_Zamazal_Hertling_Röder_Fundulaki_Ngonga
Ngomo_Sherif_Annane_Bellahsene_et al._2018, title={Introducing the HOBBIT platform
into the Ontology Alignment Evaluation Campaign}, booktitle={Proceedings of the
Ontology Matching Workshop 2018}, author={Jiménez-Ruiz, Ernesto and Saveta, Tzanina
and Zamazal, Ondrej and Hertling, Sven and Röder, Michael and Fundulaki, Irini
and Ngonga Ngomo, Axel-Cyrille and Sherif, Mohamed and Annane, Amina and Bellahsene,
Zohra and et al.}, year={2018} }'
chicago: Jiménez-Ruiz, Ernesto, Tzanina Saveta, Ondrej Zamazal, Sven Hertling, Michael
Röder, Irini Fundulaki, Axel-Cyrille Ngonga Ngomo, et al. “Introducing the HOBBIT
Platform into the Ontology Alignment Evaluation Campaign.” In Proceedings of
the Ontology Matching Workshop 2018, 2018.
ieee: E. Jiménez-Ruiz et al., “Introducing the HOBBIT platform into the Ontology
Alignment Evaluation Campaign,” 2018.
mla: Jiménez-Ruiz, Ernesto, et al. “Introducing the HOBBIT Platform into the Ontology
Alignment Evaluation Campaign.” Proceedings of the Ontology Matching Workshop
2018, 2018.
short: 'E. Jiménez-Ruiz, T. Saveta, O. Zamazal, S. Hertling, M. Röder, I. Fundulaki,
A.-C. Ngonga Ngomo, M. Sherif, A. Annane, Z. Bellahsene, S.B. Yahia, G. Diallo,
D. Faria, M. Kachroudi, A. Khiat, P. Lambrix, H. Li, M. Mackeprang, M. Mohammadi,
M. Rybinski, B.S. Balasubramani, C. Trojahn, in: Proceedings of the Ontology Matching
Workshop 2018, 2018.'
date_created: 2023-08-16T10:31:40Z
date_updated: 2026-03-09T12:49:48Z
department:
- _id: '574'
keyword:
- 2018 DICE SIMBA group_aksw ngonga projecthobbit roeder sherif
language:
- iso: eng
publication: Proceedings of the Ontology Matching Workshop 2018
status: public
title: Introducing the HOBBIT platform into the Ontology Alignment Evaluation Campaign
type: conference
user_id: '14972'
year: '2018'
...
---
_id: '60448'
author:
- first_name: Isaak
full_name: Lim, Isaak
last_name: Lim
- first_name: Alexander
full_name: Dielen, Alexander
last_name: Dielen
- first_name: Marcel
full_name: Campen, Marcel
id: '114904'
last_name: Campen
orcid: 0000-0003-2340-3462
- first_name: Leif
full_name: Kobbelt, Leif
last_name: Kobbelt
citation:
ama: 'Lim I, Dielen A, Campen M, Kobbelt L. A Simple Approach to Intrinsic Correspondence
Learning on Unstructured 3D Meshes. In: Leal-Taixé L, Roth S, eds. Computer
Vision - ECCV 2018 Workshops - Munich, Germany, September 8-14, 2018, Proceedings,
Part III. Vol 11131. Lecture Notes in Computer Science. Springer; 2018:349–362.
doi:10.1007/978-3-030-11015-4_26'
apa: Lim, I., Dielen, A., Campen, M., & Kobbelt, L. (2018). A Simple Approach
to Intrinsic Correspondence Learning on Unstructured 3D Meshes. In L. Leal-Taixé
& S. Roth (Eds.), Computer Vision - ECCV 2018 Workshops - Munich, Germany,
September 8-14, 2018, Proceedings, Part III (Vol. 11131, pp. 349–362). Springer.
https://doi.org/10.1007/978-3-030-11015-4_26
bibtex: '@inproceedings{Lim_Dielen_Campen_Kobbelt_2018, series={Lecture Notes in
Computer Science}, title={A Simple Approach to Intrinsic Correspondence Learning
on Unstructured 3D Meshes}, volume={11131}, DOI={10.1007/978-3-030-11015-4_26},
booktitle={Computer Vision - ECCV 2018 Workshops - Munich, Germany, September
8-14, 2018, Proceedings, Part III}, publisher={Springer}, author={Lim, Isaak and
Dielen, Alexander and Campen, Marcel and Kobbelt, Leif}, editor={Leal-Taixé, Laura
and Roth, Stefan}, year={2018}, pages={349–362}, collection={Lecture Notes in
Computer Science} }'
chicago: Lim, Isaak, Alexander Dielen, Marcel Campen, and Leif Kobbelt. “A Simple
Approach to Intrinsic Correspondence Learning on Unstructured 3D Meshes.” In Computer
Vision - ECCV 2018 Workshops - Munich, Germany, September 8-14, 2018, Proceedings,
Part III, edited by Laura Leal-Taixé and Stefan Roth, 11131:349–362. Lecture
Notes in Computer Science. Springer, 2018. https://doi.org/10.1007/978-3-030-11015-4_26.
ieee: 'I. Lim, A. Dielen, M. Campen, and L. Kobbelt, “A Simple Approach to Intrinsic
Correspondence Learning on Unstructured 3D Meshes,” in Computer Vision - ECCV
2018 Workshops - Munich, Germany, September 8-14, 2018, Proceedings, Part III,
2018, vol. 11131, pp. 349–362, doi: 10.1007/978-3-030-11015-4_26.'
mla: Lim, Isaak, et al. “A Simple Approach to Intrinsic Correspondence Learning
on Unstructured 3D Meshes.” Computer Vision - ECCV 2018 Workshops - Munich,
Germany, September 8-14, 2018, Proceedings, Part III, edited by Laura Leal-Taixé
and Stefan Roth, vol. 11131, Springer, 2018, pp. 349–362, doi:10.1007/978-3-030-11015-4_26.
short: 'I. Lim, A. Dielen, M. Campen, L. Kobbelt, in: L. Leal-Taixé, S. Roth (Eds.),
Computer Vision - ECCV 2018 Workshops - Munich, Germany, September 8-14, 2018,
Proceedings, Part III, Springer, 2018, pp. 349–362.'
date_created: 2025-06-27T10:30:34Z
date_updated: 2025-07-14T12:40:32Z
department:
- _id: '969'
doi: 10.1007/978-3-030-11015-4_26
editor:
- first_name: Laura
full_name: Leal-Taixé, Laura
last_name: Leal-Taixé
- first_name: Stefan
full_name: Roth, Stefan
last_name: Roth
extern: '1'
intvolume: ' 11131'
language:
- iso: eng
page: 349–362
publication: Computer Vision - ECCV 2018 Workshops - Munich, Germany, September 8-14,
2018, Proceedings, Part III
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: A Simple Approach to Intrinsic Correspondence Learning on Unstructured 3D Meshes
type: conference
user_id: '117512'
volume: 11131
year: '2018'
...
---
_id: '60391'
author:
- first_name: Jiaran
full_name: Zhou, Jiaran
last_name: Zhou
- first_name: Marcel
full_name: Campen, Marcel
id: '114904'
last_name: Campen
orcid: 0000-0003-2340-3462
- first_name: Denis
full_name: Zorin, Denis
last_name: Zorin
- first_name: Changhe
full_name: Tu, Changhe
last_name: Tu
- first_name: Claudio T.
full_name: Silva, Claudio T.
last_name: Silva
citation:
ama: Zhou J, Campen M, Zorin D, Tu C, Silva CT. Quadrangulation of non-rigid objects
using deformation metrics. Computer Aided Geometric Design. 2018;62:3-15.
doi:10.1016/j.cagd.2018.03.003
apa: Zhou, J., Campen, M., Zorin, D., Tu, C., & Silva, C. T. (2018). Quadrangulation
of non-rigid objects using deformation metrics. Computer Aided Geometric Design,
62, 3–15. https://doi.org/10.1016/j.cagd.2018.03.003
bibtex: '@article{Zhou_Campen_Zorin_Tu_Silva_2018, title={Quadrangulation of non-rigid
objects using deformation metrics}, volume={62}, DOI={10.1016/j.cagd.2018.03.003},
journal={Computer Aided Geometric Design}, publisher={Elsevier BV}, author={Zhou,
Jiaran and Campen, Marcel and Zorin, Denis and Tu, Changhe and Silva, Claudio
T.}, year={2018}, pages={3–15} }'
chicago: 'Zhou, Jiaran, Marcel Campen, Denis Zorin, Changhe Tu, and Claudio T. Silva.
“Quadrangulation of Non-Rigid Objects Using Deformation Metrics.” Computer
Aided Geometric Design 62 (2018): 3–15. https://doi.org/10.1016/j.cagd.2018.03.003.'
ieee: 'J. Zhou, M. Campen, D. Zorin, C. Tu, and C. T. Silva, “Quadrangulation of
non-rigid objects using deformation metrics,” Computer Aided Geometric Design,
vol. 62, pp. 3–15, 2018, doi: 10.1016/j.cagd.2018.03.003.'
mla: Zhou, Jiaran, et al. “Quadrangulation of Non-Rigid Objects Using Deformation
Metrics.” Computer Aided Geometric Design, vol. 62, Elsevier BV, 2018,
pp. 3–15, doi:10.1016/j.cagd.2018.03.003.
short: J. Zhou, M. Campen, D. Zorin, C. Tu, C.T. Silva, Computer Aided Geometric
Design 62 (2018) 3–15.
date_created: 2025-06-26T07:59:11Z
date_updated: 2025-07-14T12:44:44Z
department:
- _id: '969'
doi: 10.1016/j.cagd.2018.03.003
extern: '1'
intvolume: ' 62'
language:
- iso: eng
page: 3-15
publication: Computer Aided Geometric Design
publication_identifier:
issn:
- 0167-8396
publication_status: published
publisher: Elsevier BV
status: public
title: Quadrangulation of non-rigid objects using deformation metrics
type: journal_article
user_id: '117512'
volume: 62
year: '2018'
...
---
_id: '15596'
abstract:
- lang: eng
text: Data science is increasingly relevant in more and more areas of everyday life
- but the general education at school so far has hardly responded to these specific
changes in digitalization. Completely new challenges for the teaching of mathematics
and computer science have emerged, as well as for the subjects of the social and
cultural sciences field and for cross-curricular media education. All these subjects
have to be reinterpreted in regard to the raising attention to data science, to
big data and in regard to a fundamentally changing world of labor and economy.
As a reaction, schools have to realize a broad general education that is to be
newly defined on the one hand. On the other hand, school education has to stimulate
and promote interest in the current, exciting and dynamic new scientific area
of data science with its numerous applications. This book presents the extended
abstracts of the presentations at a symposium held in November 2017, discussing
economic, social and cultural impacts of big data and data science with experts
in curriculum development and educational research in statistics and computer
science as well as experts from different facets of data science and its applications.
Moreover, analyses from a socio-cultural perspective were included. The main goal
was to inspire ideas for teaching data science in secondary schools.
author:
- first_name: Rolf
full_name: Biehler, Rolf
last_name: Biehler
- first_name: Lea
full_name: Budde, Lea
last_name: Budde
- first_name: Daniel
full_name: Frischemeier, Daniel
last_name: Frischemeier
- first_name: Birte
full_name: Heinemann, Birte
last_name: Heinemann
- first_name: Susanne
full_name: Podworny, Susanne
last_name: Podworny
- first_name: Carsten
full_name: Schulte, Carsten
last_name: Schulte
- first_name: Thomas
full_name: Wassong, Thomas
last_name: Wassong
citation:
ama: 'Biehler R, Budde L, Frischemeier D, et al. Paderborn Symposium on Data
Science Education at School Level 2017: The Collected Extended Abstracts.
Paderborn University; 2018. doi:10.17619/UNIPB/1-374'
apa: 'Biehler, R., Budde, L., Frischemeier, D., Heinemann, B., Podworny, S., Schulte,
C., & Wassong, T. (2018). Paderborn Symposium on Data Science Education
at School Level 2017: The Collected Extended Abstracts. Paderborn University.
https://doi.org/10.17619/UNIPB/1-374'
bibtex: '@book{Biehler_Budde_Frischemeier_Heinemann_Podworny_Schulte_Wassong_2018,
place={Paderborn}, title={Paderborn Symposium on Data Science Education at School
Level 2017: The Collected Extended Abstracts}, DOI={10.17619/UNIPB/1-374},
publisher={Paderborn University}, author={Biehler, Rolf and Budde, Lea and Frischemeier,
Daniel and Heinemann, Birte and Podworny, Susanne and Schulte, Carsten and Wassong,
Thomas}, year={2018} }'
chicago: 'Biehler, Rolf, Lea Budde, Daniel Frischemeier, Birte Heinemann, Susanne
Podworny, Carsten Schulte, and Thomas Wassong. Paderborn Symposium on Data
Science Education at School Level 2017: The Collected Extended Abstracts.
Paderborn: Paderborn University, 2018. https://doi.org/10.17619/UNIPB/1-374.'
ieee: 'R. Biehler et al., Paderborn Symposium on Data Science Education
at School Level 2017: The Collected Extended Abstracts. Paderborn: Paderborn
University, 2018.'
mla: 'Biehler, Rolf, et al. Paderborn Symposium on Data Science Education at
School Level 2017: The Collected Extended Abstracts. Paderborn University,
2018, doi:10.17619/UNIPB/1-374.'
short: 'R. Biehler, L. Budde, D. Frischemeier, B. Heinemann, S. Podworny, C. Schulte,
T. Wassong, Paderborn Symposium on Data Science Education at School Level 2017:
The Collected Extended Abstracts, Paderborn University, Paderborn, 2018.'
date_created: 2020-01-16T08:35:37Z
date_updated: 2026-03-10T12:22:50Z
department:
- _id: '67'
doi: 10.17619/UNIPB/1-374
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://digital.ub.uni-paderborn.de/hs/doi/10.17619/UNIPB/1-374
oa: '1'
page: '109'
place: Paderborn
publisher: Paderborn University
status: public
title: 'Paderborn Symposium on Data Science Education at School Level 2017: The Collected
Extended Abstracts'
type: misc
user_id: '14972'
year: '2018'
...
---
_id: '19604'
author:
- first_name: Shouwei
full_name: Li, Shouwei
last_name: Li
citation:
ama: Li S. Parallel Fixed Parameter Tractable Problems. Universität Paderborn;
2017. doi:10.17619/UNIPB/1-252
apa: Li, S. (2017). Parallel fixed parameter tractable problems. Universität
Paderborn. https://doi.org/10.17619/UNIPB/1-252
bibtex: '@book{Li_2017, place={Universität Paderborn}, title={Parallel fixed parameter
tractable problems}, DOI={10.17619/UNIPB/1-252},
author={Li, Shouwei}, year={2017} }'
chicago: Li, Shouwei. Parallel Fixed Parameter Tractable Problems. Universität
Paderborn, 2017. https://doi.org/10.17619/UNIPB/1-252.
ieee: S. Li, Parallel fixed parameter tractable problems. Universität Paderborn,
2017.
mla: Li, Shouwei. Parallel Fixed Parameter Tractable Problems. 2017, doi:10.17619/UNIPB/1-252.
short: S. Li, Parallel Fixed Parameter Tractable Problems, Universität Paderborn,
2017.
date_created: 2020-09-21T13:52:09Z
date_updated: 2022-01-06T06:54:07Z
department:
- _id: '63'
doi: 10.17619/UNIPB/1-252
language:
- iso: eng
place: Universität Paderborn
related_material:
link:
- relation: confirmation
url: '10.17619/UNIPB/1-252 '
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: Parallel fixed parameter tractable problems
type: dissertation
user_id: '15415'
year: '2017'
...
---
_id: '2851'
author:
- first_name: Christine
full_name: Markarian, Christine
id: '37612'
last_name: Markarian
citation:
ama: 'Markarian C. Leasing with Uncertainty. In: International Conference on
Operations Research (OR). ; 2017. doi:10.1007/978-3-319-89920-6_57'
apa: Markarian, C. (2017). Leasing with Uncertainty. In International Conference
on Operations Research (OR). Berlin. https://doi.org/10.1007/978-3-319-89920-6_57
bibtex: '@inproceedings{Markarian_2017, title={Leasing with Uncertainty}, DOI={10.1007/978-3-319-89920-6_57},
booktitle={International Conference on Operations Research (OR)}, author={Markarian,
Christine}, year={2017} }'
chicago: Markarian, Christine. “Leasing with Uncertainty.” In International Conference
on Operations Research (OR), 2017. https://doi.org/10.1007/978-3-319-89920-6_57.
ieee: C. Markarian, “Leasing with Uncertainty,” in International Conference on
Operations Research (OR), Berlin, 2017.
mla: Markarian, Christine. “Leasing with Uncertainty.” International Conference
on Operations Research (OR), 2017, doi:10.1007/978-3-319-89920-6_57.
short: 'C. Markarian, in: International Conference on Operations Research (OR),
2017.'
conference:
end_date: Sept 8, 2017
location: Berlin
start_date: Sept 6, 2017
date_created: 2018-05-24T08:44:43Z
date_updated: 2022-01-06T06:58:08Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1007/978-3-319-89920-6_57
file:
- access_level: closed
content_type: application/pdf
creator: feldi
date_created: 2018-11-13T13:16:30Z
date_updated: 2018-11-13T13:16:30Z
file_id: '5537'
file_name: Markarian2018_Chapter_LeasingWithUncertainty.pdf
file_size: 257103
relation: main_file
success: 1
file_date_updated: 2018-11-13T13:16:30Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publication: International Conference on Operations Research (OR)
status: public
title: Leasing with Uncertainty
type: conference
user_id: '14052'
year: '2017'
...
---
_id: '24152'
author:
- first_name: Arunselvan
full_name: Ramaswamy, Arunselvan
id: '66937'
last_name: Ramaswamy
orcid: https://orcid.org/ 0000-0001-7547-8111
- first_name: Shalabh
full_name: Bhatnagar, Shalabh
last_name: Bhatnagar
citation:
ama: Ramaswamy A, Bhatnagar S. Analysis of gradient descent methods with nondiminishing
bounded errors. IEEE Transactions on Automatic Control. 2017;63(5):1465-1471.
apa: Ramaswamy, A., & Bhatnagar, S. (2017). Analysis of gradient descent methods
with nondiminishing bounded errors. IEEE Transactions on Automatic Control,
63(5), 1465–1471.
bibtex: '@article{Ramaswamy_Bhatnagar_2017, title={Analysis of gradient descent
methods with nondiminishing bounded errors}, volume={63}, number={5}, journal={IEEE
Transactions on Automatic Control}, publisher={IEEE}, author={Ramaswamy, Arunselvan
and Bhatnagar, Shalabh}, year={2017}, pages={1465–1471} }'
chicago: 'Ramaswamy, Arunselvan, and Shalabh Bhatnagar. “Analysis of Gradient Descent
Methods with Nondiminishing Bounded Errors.” IEEE Transactions on Automatic
Control 63, no. 5 (2017): 1465–71.'
ieee: A. Ramaswamy and S. Bhatnagar, “Analysis of gradient descent methods with
nondiminishing bounded errors,” IEEE Transactions on Automatic Control,
vol. 63, no. 5, pp. 1465–1471, 2017.
mla: Ramaswamy, Arunselvan, and Shalabh Bhatnagar. “Analysis of Gradient Descent
Methods with Nondiminishing Bounded Errors.” IEEE Transactions on Automatic
Control, vol. 63, no. 5, IEEE, 2017, pp. 1465–71.
short: A. Ramaswamy, S. Bhatnagar, IEEE Transactions on Automatic Control 63 (2017)
1465–1471.
date_created: 2021-09-10T10:19:40Z
date_updated: 2022-01-06T06:56:08Z
department:
- _id: '355'
extern: '1'
intvolume: ' 63'
issue: '5'
language:
- iso: eng
page: 1465-1471
publication: IEEE Transactions on Automatic Control
publisher: IEEE
status: public
title: Analysis of gradient descent methods with nondiminishing bounded errors
type: journal_article
user_id: '66937'
volume: 63
year: '2017'
...
---
_id: '24153'
author:
- first_name: Arunselvan
full_name: Ramaswamy, Arunselvan
id: '66937'
last_name: Ramaswamy
orcid: https://orcid.org/ 0000-0001-7547-8111
- first_name: Shalabh
full_name: Bhatnagar, Shalabh
last_name: Bhatnagar
citation:
ama: Ramaswamy A, Bhatnagar S. A generalization of the Borkar-Meyn theorem for stochastic
recursive inclusions. Mathematics of Operations Research. 2017;42(3):648-661.
apa: Ramaswamy, A., & Bhatnagar, S. (2017). A generalization of the Borkar-Meyn
theorem for stochastic recursive inclusions. Mathematics of Operations Research,
42(3), 648–661.
bibtex: '@article{Ramaswamy_Bhatnagar_2017, title={A generalization of the Borkar-Meyn
theorem for stochastic recursive inclusions}, volume={42}, number={3}, journal={Mathematics
of Operations Research}, publisher={INFORMS}, author={Ramaswamy, Arunselvan and
Bhatnagar, Shalabh}, year={2017}, pages={648–661} }'
chicago: 'Ramaswamy, Arunselvan, and Shalabh Bhatnagar. “A Generalization of the
Borkar-Meyn Theorem for Stochastic Recursive Inclusions.” Mathematics of Operations
Research 42, no. 3 (2017): 648–61.'
ieee: A. Ramaswamy and S. Bhatnagar, “A generalization of the Borkar-Meyn theorem
for stochastic recursive inclusions,” Mathematics of Operations Research,
vol. 42, no. 3, pp. 648–661, 2017.
mla: Ramaswamy, Arunselvan, and Shalabh Bhatnagar. “A Generalization of the Borkar-Meyn
Theorem for Stochastic Recursive Inclusions.” Mathematics of Operations Research,
vol. 42, no. 3, INFORMS, 2017, pp. 648–61.
short: A. Ramaswamy, S. Bhatnagar, Mathematics of Operations Research 42 (2017)
648–661.
date_created: 2021-09-10T10:21:02Z
date_updated: 2022-01-06T06:56:08Z
department:
- _id: '355'
extern: '1'
intvolume: ' 42'
issue: '3'
language:
- iso: eng
page: 648-661
publication: Mathematics of Operations Research
publisher: INFORMS
status: public
title: A generalization of the Borkar-Meyn theorem for stochastic recursive inclusions
type: journal_article
user_id: '66937'
volume: 42
year: '2017'
...
---
_id: '24398'
abstract:
- lang: eng
text: 'Through this study, we introduce the idea of applying scheduling techniques
to allocate spatial resources that are shared among multiple robots moving in
a static environment and having temporal constraints on the arrival time to destinations.
To illustrate this idea, we present an exemplified algorithm that plans and assigns
a motion path to each robot. The considered problem is particularly challenging
because: (i) the robots share the same environment and thus the planner must take
into account overlapping paths which cannot happen at the same time; (ii) there
are time deadlines thus the planner must deal with temporal constraints; (iii)
new requests arrive without a priori knowledge thus the planner must be able to
add new paths online and adjust old plans; (iv) the robot motion is subject to
noise thus the planner must be reactive to adapt to online changes. We showcase
the functioning of the proposed algorithm through a set of agent-based simulations.'
author:
- first_name: Yara
full_name: Khaluf, Yara
last_name: Khaluf
- first_name: Christine
full_name: Markarian, Christine
last_name: Markarian
- first_name: Pieter
full_name: Simoens, Pieter
last_name: Simoens
- first_name: Andreagiovanni
full_name: Reina, Andreagiovanni
last_name: Reina
citation:
ama: 'Khaluf Y, Markarian C, Simoens P, Reina A. Scheduling Access to Shared Space
in Multi-robot Systems. In: International Conference on Practical Applications
of Agents and Multi-Agent Systems (PAAMS 2017). ; 2017. doi:10.1007/978-3-319-59930-4_12'
apa: Khaluf, Y., Markarian, C., Simoens, P., & Reina, A. (2017). Scheduling
Access to Shared Space in Multi-robot Systems. International Conference on
Practical Applications of Agents and Multi-Agent Systems (PAAMS 2017). https://doi.org/10.1007/978-3-319-59930-4_12
bibtex: '@inproceedings{Khaluf_Markarian_Simoens_Reina_2017, place={Cham}, title={Scheduling
Access to Shared Space in Multi-robot Systems}, DOI={10.1007/978-3-319-59930-4_12},
booktitle={International Conference on Practical Applications of Agents and Multi-Agent
Systems (PAAMS 2017)}, author={Khaluf, Yara and Markarian, Christine and Simoens,
Pieter and Reina, Andreagiovanni}, year={2017} }'
chicago: Khaluf, Yara, Christine Markarian, Pieter Simoens, and Andreagiovanni Reina.
“Scheduling Access to Shared Space in Multi-Robot Systems.” In International
Conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS
2017). Cham, 2017. https://doi.org/10.1007/978-3-319-59930-4_12.
ieee: 'Y. Khaluf, C. Markarian, P. Simoens, and A. Reina, “Scheduling Access to
Shared Space in Multi-robot Systems,” 2017, doi: 10.1007/978-3-319-59930-4_12.'
mla: Khaluf, Yara, et al. “Scheduling Access to Shared Space in Multi-Robot Systems.”
International Conference on Practical Applications of Agents and Multi-Agent
Systems (PAAMS 2017), 2017, doi:10.1007/978-3-319-59930-4_12.
short: 'Y. Khaluf, C. Markarian, P. Simoens, A. Reina, in: International Conference
on Practical Applications of Agents and Multi-Agent Systems (PAAMS 2017), Cham,
2017.'
date_created: 2021-09-14T12:41:58Z
date_updated: 2022-01-06T06:56:19Z
department:
- _id: '63'
doi: 10.1007/978-3-319-59930-4_12
language:
- iso: eng
place: Cham
publication: International Conference on Practical Applications of Agents and Multi-Agent
Systems (PAAMS 2017)
publication_identifier:
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Scheduling Access to Shared Space in Multi-robot Systems
type: conference
user_id: '15415'
year: '2017'
...
---
_id: '26426'
author:
- first_name: Aristotelis
full_name: Hadjakos, Aristotelis
last_name: Hadjakos
- first_name: ' Joachim'
full_name: Iffland, Joachim
last_name: Iffland
- first_name: Reinhard
full_name: ' Keil, Reinhard'
last_name: ' Keil'
- first_name: Andreas
full_name: Oberhoff, Andreas
last_name: Oberhoff
- first_name: Joachim
full_name: Veit, Joachim
last_name: Veit
citation:
ama: Hadjakos A, Iffland Joachim, Keil R, Oberhoff A, Veit J. Challenges for Annotation
Concepts in Music. International Journal of Humanities and Arts Computing.
2017;11:2:255-275.
apa: Hadjakos, A., Iffland, Joachim, Keil, R., Oberhoff, A., & Veit, J. (2017).
Challenges for Annotation Concepts in Music. International Journal of Humanities
and Arts Computing, 11:2, 255–275.
bibtex: '@article{Hadjakos_Iffland_ Keil_Oberhoff_Veit_2017, title={Challenges for
Annotation Concepts in Music}, volume={11:2}, journal={International Journal of
Humanities and Arts Computing}, author={Hadjakos, Aristotelis and Iffland, Joachim
and Keil, Reinhard and Oberhoff, Andreas and Veit, Joachim}, year={2017}, pages={255–275}
}'
chicago: 'Hadjakos, Aristotelis, Joachim Iffland, Reinhard Keil, Andreas Oberhoff,
and Joachim Veit. “Challenges for Annotation Concepts in Music.” International
Journal of Humanities and Arts Computing 11:2 (2017): 255–75.'
ieee: A. Hadjakos, Joachim Iffland, R. Keil, A. Oberhoff, and J. Veit, “Challenges
for Annotation Concepts in Music,” International Journal of Humanities and
Arts Computing, vol. 11:2, pp. 255–275, 2017.
mla: Hadjakos, Aristotelis, et al. “Challenges for Annotation Concepts in Music.”
International Journal of Humanities and Arts Computing, vol. 11:2, 2017,
pp. 255–75.
short: A. Hadjakos, Joachim Iffland, R. Keil, A. Oberhoff, J. Veit, International
Journal of Humanities and Arts Computing 11:2 (2017) 255–275.
date_created: 2021-10-18T18:45:13Z
date_updated: 2022-01-06T06:57:20Z
department:
- _id: '71'
language:
- iso: eng
page: 255-275
publication: International Journal of Humanities and Arts Computing
publication_status: published
status: public
title: Challenges for Annotation Concepts in Music
type: journal_article
user_id: '71124'
volume: 11:2
year: '2017'
...