@article{15266,
author = {Yigitbas, Enes and Jovanovikj, Ivan and Biermeier, Kai and Sauer, Stefan and Engels, Gregor},
journal = {International Journal on Software and Systems Modeling (SoSyM)},
publisher = {Springer},
title = {{Integrated Model-driven Development of Self-adaptive User Interfaces (to appear)}},
year = {2020},
}
@phdthesis{15482,
author = {Löken, Nils},
title = {{Cryptography for the Crowd — A Study of Cryptographic Schemes with Applications to Crowd Work}},
doi = {10.17619/UNIPB/1-854},
year = {2020},
}
@article{15836,
author = {Bellman, K. and Dutt, N. and Esterle, L. and Herkersdorf, A. and Jantsch, A. and Landauer, C. and R. Lewis, P. and Platzner, Marco and TaheriNejad, N. and Tammemäe, K.},
journal = {ACM Transactions on Cyber-Physical Systems},
pages = {1--24},
title = {{Self-aware Cyber-Physical Systems}},
volume = {Accepted for Publication},
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},
}
@inproceedings{15604,
author = {Jovanovikj, Ivan and Yigitbas, Enes and Sauer, Stefan and Engels, Gregor},
booktitle = {Proceedings of the 8th International Conference on Model-Driven Engineering and Software Development - Volume 1: MODELSWARD},
location = {Valletta},
title = {{Concept-based Co-Migration of Test Cases (to appear)}},
year = {2020},
}
@inproceedings{15825,
author = {Kiesel, Johannes and Lang, Kevin and Wachsmuth, Henning and Hornecker, Eva and Stein, Benno},
booktitle = {Proceedings of the 2020 ACM SIGIR Conference on Human Information Interaction & Retrieval (CHIIR 2020)},
title = {{Investigating Expectations for Voice-based and Conversational Argument Search on the Web}},
year = {2020},
}
@inproceedings{15820,
author = {Al-Khatib, Khalid and Hou, Yufang and Wachsmuth, Henning and Jochim, Charles and Bonin, Francesca and Stein, Benno },
booktitle = {Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence (AAAI 2020)},
title = {{End-to-End Argumentation Knowledge Graph Construction}},
year = {2020},
}
@article{15489,
author = {Claes, Leander and Steidl, Carolin and Hetkämper, Tim and Henning, Bernd},
journal = {arXiv.org},
publisher = {Cornell University},
title = {{Estimation of acoustic wave non-linearity in ultrasonic measurement systems}},
year = {2020},
}
@article{15605,
author = {Jovanovikj, Ivan and Yigitbas, Enes and Sauer, Stefan and Engels, Gregor},
journal = {Software Engineering 2020 Workshopband},
location = {Innscbruck},
title = {{Test Case Co-Migration Method Patterns (to appear)}},
year = {2020},
}
@phdthesis{15631,
author = {Feldkord, Björn},
title = {{Mobile Resource Allocation}},
doi = {10.17619/UNIPB/1-869},
year = {2020},
}
@inproceedings{15629,
abstract = {In multi-label classification (MLC), each instance is associated with a set of class labels, in contrast to standard classification where an instance is assigned a single label. Binary relevance (BR) learning, which reduces a multi-label to a set of binary classification problems, one per label, is arguably the most straight-forward approach to MLC. In spite of its simplicity, BR proved to be competitive to more sophisticated MLC methods, and still achieves state-of-the-art performance for many loss functions. Somewhat surprisingly, the optimal choice of the base learner for tackling the binary classification problems has received very little attention so far. Taking advantage of the label independence assumption inherent to BR, we propose a label-wise base learner selection method optimizing label-wise macro averaged performance measures. In an extensive experimental evaluation, we find that or approach, called LiBRe, can significantly improve generalization performance.},
author = {Wever, Marcel Dominik and Tornede, Alexander and Mohr, Felix and Hüllermeier, Eyke},
location = {Konstanz, Germany},
publisher = {Springer},
title = {{LiBRe: Label-Wise Selection of Base Learners in Binary Relevance for Multi-Label Classification}},
year = {2020},
}
@misc{15770,
author = {Warner, Daniel},
title = {{On the complexity of local transformations in SDN overlays}},
year = {2020},
}
@inproceedings{15821,
author = {Bondarenko, Alexander and Hagen, Matthias and Potthast, Martin and Wachsmuth, Henning and Beloucif, Meriem and Biemann, Chris and Panchenko, Alexander and Stein, Benno},
booktitle = {Proceedings of the 42nd European Conference on Information Retrieval (ECIR 2020)},
title = {{Touché: First Shared Task on Argument Retrieval}},
year = {2020},
}
@inproceedings{15826,
author = {Chen, Wei-Fan and Syed, Shahbaz and Stein, Benno and Hagen, Matthias and Potthast, Martin },
booktitle = {Proceedings of the the Web Conference 2020},
title = {{Abstractive Snippet Generation}},
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},
}
@inproceedings{15169,
author = {Castenow, Jannik and Kolb, Christina and Scheideler, Christian},
booktitle = {Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN)},
location = {Kolkata, Indien},
publisher = {ACM},
title = {{A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks}},
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{6976,
abstract = {We investigate the maintenance of overlay networks under massive churn, i.e.
nodes joining and leaving the network. We assume an adversary that may churn a
constant fraction $\alpha n$ of nodes over the course of $\mathcal{O}(\log n)$
rounds. In particular, the adversary has an almost up-to-date information of
the network topology as it can observe an only slightly outdated topology that
is at least $2$ rounds old. Other than that, we only have the provably minimal
restriction that new nodes can only join the network via nodes that have taken
part in the network for at least one round.
Our contributions are as follows: First, we show that it is impossible to
maintain a connected topology if adversary has up-to-date information about the
nodes' connections. Further, we show that our restriction concerning the join
is also necessary. As our main result present an algorithm that constructs a
new overlay- completely independent of all previous overlays - every $2$
rounds. Furthermore, each node sends and receives only $\mathcal{O}(\log^3 n)$
messages each round. As part of our solution we propose the Linearized DeBruijn
Swarm (LDS), a highly churn resistant overlay, which will be maintained by the
algorithm. However, our approaches can be transferred to a variety of classical
P2P Topologies where nodes are mapped into the $[0,1)$-interval.},
author = {Götte, Thorsten and Vijayalakshmi, Vipin Ravindran and Scheideler, Christian},
booktitle = {Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS '19)},
location = {Rio de Janeiro, Brazil},
publisher = {IEEE},
title = {{Always be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-date Adversary}},
year = {2019},
}
@phdthesis{8080,
abstract = {This thesis investigates approximate pure Nash equilibria in different game-theoretic models. In such an outcome, no player can improve her objective by more than a given factor through a deviation to another strategy. In the first part, we investigate two variants of Congestion Games in which the existence of pure Nash equilibria is guaranteed through a potential function argument. However, the computation of such equilibria might be hard. We construct and analyze approximation algorithms that enable the computation of states with low approximation factors in polynomial time. To show their guarantees we use sub games among players, bound the potential function values of arbitrary states and exploit a connection between Shapley and proportional cost shares. Furthermore, we apply and analyze sampling techniques for the computation of approximate Shapley values in different settings. In the second part, we concentrate on the existence of approximate pure Nash equilibria in games in which no pure Nash equilibria exist in general. In the model of Coevolving Opinion Formation Games, we bound the approximation guarantees for natural states nearly independent of the specific definition of the players' neighborhoods by applying a concept of virtual costs. For the special case of only one influential neighbor, we even show lower approximation factors for a natural strategy. Then, we investigate a two-sided Facility Location Game among facilities and clients on a line with an objective function consisting of distance and load. We show tight bounds on the approximation factor for settings with three facilities and infinitely many clients. For the general scenario with an arbitrary number of facilities, we bound the approximation factor for two promising candidates, namely facilities that are uniformly distributed and which are paired.},
author = {Feldotto, Matthias},
title = {{Approximate Pure Nash Equilibria in Congestion, Opinion Formation and Facility Location Games}},
doi = {10.17619/UNIPB/1-588},
year = {2019},
}
@article{9824,
author = {Peuster, Manuel and Schneider, Stefan Balthasar and Zhao, Mengxuan and Xilouris, George and Trakadas, Panagiotis and Vicens, Felipe and Tavernier, Wouter and Soenen, Thomas and Vilalta, Ricard and Andreou, George and Kyriazis, Dimosthenis and Karl, Holger},
issn = {0163-6804},
journal = {IEEE Communications Magazine},
pages = {96--102},
title = {{Introducing Automated Verification and Validation for Virtualized Network Functions and Services}},
doi = {10.1109/mcom.2019.1800873},
year = {2019},
}