@misc{15770,
author = {Warner, Daniel},
publisher = {Universität Paderborn},
title = {{On the complexity of local transformations in SDN overlays}},
year = {2020},
}
@inbook{15267,
author = {Yigitbas, Enes and Jovanovikj, Ivan and Sauer, Stefan and Engels, Gregor},
booktitle = {Handling Security, Usability, User Experience and Reliability in User-Centered Development Processes - IFIP WG 13.2/13.5},
publisher = {Springer, LNCS},
title = {{On the Development of Context-aware Augmented Reality Applications (to appear)}},
year = {2020},
}
@article{17379,
author = {Kumar Sahoo, Sudhir and Heske, Julian and Azadi, Sam and Zhang, Zhenzhe and V Tarakina, Nadezda and Oschatz, Martin and Z. Khaliullin, Rustam and Antonietti, Markus and D. Kühne, Thomas },
journal = {Scientific Reports},
number = {1},
title = {{On the Possibility of Helium Adsorption in Nitrogen Doped Graphitic Materials}},
doi = {10.1038/s41598-020-62638-z},
volume = {10},
year = {2020},
}
@unpublished{18017,
abstract = {We consider an extension of the contextual multi-armed bandit problem, in
which, instead of selecting a single alternative (arm), a learner is supposed
to make a preselection in the form of a subset of alternatives. More
specifically, in each iteration, the learner is presented a set of arms and a
context, both described in terms of feature vectors. The task of the learner is
to preselect $k$ of these arms, among which a final choice is made in a second
step. In our setup, we assume that each arm has a latent (context-dependent)
utility, and that feedback on a preselection is produced according to a
Plackett-Luce model. We propose the CPPL algorithm, which is inspired by the
well-known UCB algorithm, and evaluate this algorithm on synthetic and real
data. In particular, we consider an online algorithm selection scenario, which
served as a main motivation of our problem setting. Here, an instance (which
defines the context) from a certain problem class (such as SAT) can be solved
by different algorithms (the arms), but only $k$ of these algorithms can
actually be run.},
author = {El Mesaoudi-Paul, Adil and Bengs, Viktor and Hüllermeier, Eyke},
booktitle = {arXiv:2002.04275},
title = {{Online Preselection with Context Information under the Plackett-Luce Model}},
year = {2020},
}
@inbook{18789,
author = {Nickchen, Tobias and Engels, Gregor and Lohn, Johannes},
booktitle = {Industrializing Additive Manufacturing},
isbn = {9783030543334},
title = {{Opportunities of 3D Machine Learning for Manufacturability Analysis and Component Recognition in the Additive Manufacturing Process Chain}},
doi = {10.1007/978-3-030-54334-1_4},
year = {2020},
}
@inproceedings{3583,
author = { Guetttatfi, Zakarya and Kaufmann, Paul and Platzner, Marco},
booktitle = {Proceedings of the International Workshop on Applied Reconfigurable Computing (ARC)},
title = {{Optimal and Greedy Heuristic Approaches for Scheduling and Mapping of Hardware Tasks to Reconfigurable Computing Devices}},
year = {2020},
}
@misc{19999,
author = {Mayer, Stefan},
publisher = {Universität Paderborn},
title = {{Optimierung von JMCTest beim Testen von Inter Method Contracts}},
year = {2020},
}
@inproceedings{13226,
abstract = {The canonical problem for the class Quantum Merlin-Arthur (QMA) is that of
estimating ground state energies of local Hamiltonians. Perhaps surprisingly,
[Ambainis, CCC 2014] showed that the related, but arguably more natural,
problem of simulating local measurements on ground states of local Hamiltonians
(APX-SIM) is likely harder than QMA. Indeed, [Ambainis, CCC 2014] showed that
APX-SIM is P^QMA[log]-complete, for P^QMA[log] the class of languages decidable
by a P machine making a logarithmic number of adaptive queries to a QMA oracle.
In this work, we show that APX-SIM is P^QMA[log]-complete even when restricted
to more physical Hamiltonians, obtaining as intermediate steps a variety of
related complexity-theoretic results.
We first give a sequence of results which together yield P^QMA[log]-hardness
for APX-SIM on well-motivated Hamiltonians: (1) We show that for NP, StoqMA,
and QMA oracles, a logarithmic number of adaptive queries is equivalent to
polynomially many parallel queries. These equalities simplify the proofs of our
subsequent results. (2) Next, we show that the hardness of APX-SIM is preserved
under Hamiltonian simulations (a la [Cubitt, Montanaro, Piddock, 2017]). As a
byproduct, we obtain a full complexity classification of APX-SIM, showing it is
complete for P, P^||NP, P^||StoqMA, or P^||QMA depending on the Hamiltonians
employed. (3) Leveraging the above, we show that APX-SIM is P^QMA[log]-complete
for any family of Hamiltonians which can efficiently simulate spatially sparse
Hamiltonians, including physically motivated models such as the 2D Heisenberg
model.
Our second focus considers 1D systems: We show that APX-SIM remains
P^QMA[log]-complete even for local Hamiltonians on a 1D line of 8-dimensional
qudits. This uses a number of ideas from above, along with replacing the "query
Hamiltonian" of [Ambainis, CCC 2014] with a new "sifter" construction.},
author = {Gharibian, Sevag and Piddock, Stephen and Yirka, Justin},
booktitle = {Proceedings of the 37th Symposium on Theoretical Aspects of Computer Science (STACS 2020)},
pages = {38},
title = {{Oracle complexity classes and local measurements on physical Hamiltonians}},
year = {2020},
}
@inproceedings{20166,
author = {Bondarenko, Alexander and Fröbe, Maik and Beloucif, Meriem and Gienapp, Lukas and Ajjour, Yamen and Panchenko, Alexander and Biemann, Chris and Stein, Benno and Wachsmuth, Henning and Potthast, Martin and Hagen, Matthias},
booktitle = {CEUR Workshop Proceedings},
title = {{Overview of Touché 2020: Argument Retrieval}},
volume = {2696},
year = {2020},
}
@article{19844,
author = {Elizabeth, Amala and Sahoo, Sudhir K. and Lockhorn, David and Timmer, Alexander and Aghdassi, Nabi and Zacharias, Helmut and K\, Thomas D. and Siebentritt, Susanne and Mirhosseini, Hossein and M\, Harry},
journal = {Phys. Rev. Materials},
pages = {063401},
publisher = {American Physical Society},
title = {{Oxidation/reduction cycles and their reversible effect on the dipole formation at $\mathrmCuInSe_2$ surfaces}},
doi = {10.1103/PhysRevMaterials.4.063401},
volume = {4},
year = {2020},
}