@article{8634,
abstract = {A rectangular dielectric strip at some distance above an optical slab waveguide is
being considered, for evanescent excitation of the strip through the semi-guided waves supported
by the slab, at specific oblique angles. The 2.5-D configuration shows resonant transmission
properties with respect to variations of the angle of incidence, or of the excitation frequency,
respectively. The strength of the interaction can be controlled by the gap between strip and slab.
For increasing distance, our simulations predict resonant states with unit extremal reflectance
of an angular or spectral width that tends to zero, i.e. resonances with a Q-factor that tends
to infinity, while the resonance position approaches the level of the guided mode of the strip.
This exceptionally simple system realizes what might be termed a “bound state coupled to the
continuum”.},
author = {Hammer, Manfred and Ebers, Lena and Förstner, Jens},
journal = {Optics Express},
keyword = {tet_topic_waveguides},
number = {7},
pages = {8},
title = {{Oblique evanescent excitation of a dielectric strip: A model resonator with an open optical cavity of unlimited Q}},
volume = {27},
year = {2019},
}
@article{9620,
author = {Yigitbas, Enes and Hottung, André and Mansfield Rojas, Sebastian and Anjorin, Anthony and Sauer, Stefan and Engels, Gregor},
journal = {Proceedings of the ACM on Human-Computer Interaction},
pages = {19:1--19:20},
title = {{Context- and Data-driven Satisfaction Analysis of User Interface Adaptations Based on Instant User Feedback}},
volume = {3},
year = {2019},
}
@inproceedings{9276,
author = {Yigitbas, Enes and Josifovska, Klementina and Jovanovikj, Ivan and Kalinci, Ferhat and Anjorin, Anthony and Engels, Gregor},
booktitle = {Proceedings of the 11th ACM SIGCHI Symposium on Engineering Interactive Computing Systems (EICS 2019)},
location = {Valencia},
pages = {13:1----13:7},
title = {{Component-Based Development of Adaptive User Interfaces }},
year = {2019},
}
@inproceedings{17342,
author = {Engels, Gregor and Burgueno, Loli and Pretschner, Alexander and Voss, Sebastian and Chaudron, Michel and Kienzle, Jörg and Völter, Markus and Gérard, Sébastien and Zahedi, Mansooreh and Bousse, Erwan and Rensink, Arend and Polack, Fiona and Kappel, Gerti},
isbn = {9781728151250},
title = {{2019 ACM/IEEE 22nd International Conference on Model Driven Engineering Languages and Systems Companion (MODELS-C)}},
doi = {10.1109/models-c48269.2019},
year = {2019},
}
@misc{17809,
author = {N., N.},
title = {{Scalable Multi Objective Path Optimization for Multi-Laser Selective Laser Melting Scanning Systems}},
year = {2019},
}
@unpublished{18016,
abstract = {In this paper, we introduce the Preselection Bandit problem, in which the
learner preselects a subset of arms (choice alternatives) for a user, which
then chooses the final arm from this subset. The learner is not aware of the
user's preferences, but can learn them from observed choices. In our concrete
setting, we allow these choices to be stochastic and model the user's actions
by means of the Plackett-Luce model. The learner's main task is to preselect
subsets that eventually lead to highly preferred choices. To formalize this
goal, we introduce a reasonable notion of regret and derive lower bounds on the
expected regret. Moreover, we propose algorithms for which the upper bound on
expected regret matches the lower bound up to a logarithmic term of the time
horizon.},
author = {Bengs, Viktor and Hüllermeier, Eyke},
booktitle = {arXiv:1907.06123},
title = {{Preselection Bandits under the Plackett-Luce Model}},
year = {2019},
}
@article{17392,
author = {Massmann, Melina and Meyer, Maurice and Dumitrescu, Roman and Enzberg, Sebastian von and Frank, Maximilian and Koldewey, Christian and Kühn, Arno and Reinhold, Jannik},
issn = {2212-8271},
journal = {Procedia CIRP},
pages = {992--997},
title = {{Significance and Challenges of Data-driven Product Generation and Retrofit Planning}},
doi = {10.1016/j.procir.2019.04.226},
year = {2019},
}
@article{13946,
author = {Abu-Khzam, Faisal N. and Li, Shouwei and Markarian, Christine and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel},
journal = {Theoretical Computer Science},
pages = {2--12},
title = {{Efficient parallel algorithms for parameterized problems}},
doi = {10.1016/j.tcs.2018.11.006},
volume = {786},
year = {2019},
}
@misc{8482,
author = {Jurgelucks, Benjamin and Schulze, Veronika and Feldmann, Nadine and Claes, Leander},
title = {{Arbitrary sensitivity for inverse problems in piezoelectricity}},
year = {2019},
}
@misc{13592,
author = {Pilot, Matthias},
publisher = {Universität Paderborn},
title = {{Efficient Finite-Field Arithmetic for Elliptic Curve Cryptography in Java}},
year = {2019},
}
@misc{13648,
author = {Scholz, Swante},
publisher = {Universität Paderborn},
title = {{Implementation and Comparison of Elliptic Curve Algorithms in Java}},
year = {2019},
}
@misc{10271,
author = {N., N.},
publisher = {Universität Paderborn},
title = {{Implementation and Evaluation of Authenticated Data Structures Using Intel SGX Enclaves}},
year = {2019},
}
@phdthesis{13124,
author = {Dräxler, Sevil},
publisher = {Universität Paderborn},
title = {{Scaling, placement, and routing for pliable virtualized composed services}},
year = {2019},
}
@inproceedings{20528,
author = {Piskachev, Goran and Petrasch, Tobias and Späth, Johannes and Bodden, Eric},
booktitle = {10th Workshop on Tools for Automatic Program Analysis (TAPAS)},
title = {{AuthCheck: Program-state Analysis for Access-control Vulnerabilities}},
year = {2019},
}
@inproceedings{20535,
author = {Luo, Linghui and Dolby, Julian and Bodden, Eric},
booktitle = {European Conference on Object-Oriented Programming (ECOOP)},
title = {{MagpieBridge: A General Approach to Integrating Static Analyses into IDEs and Editors}},
year = {2019},
}
@inproceedings{10094,
author = {Sharma, Arnab and Wehrheim, Heike},
booktitle = {Software Engineering and Software Management, {SE/SWM} 2019, Stuttgart, Germany, February 18-22, 2019},
editor = {Becker, Steffen and Bogicevic, Ivan and Herzwurm, Georg and Wagner, Stefan},
pages = {157--158},
publisher = {{GI}},
title = {{Testing Balancedness of ML Algorithms}},
doi = {10.18420/se2019-48},
volume = {{P-292}},
year = {2019},
}
@inproceedings{10284,
abstract = {We study text reuse related to Wikipedia at scale by compiling the first corpus of text reuse cases within Wikipedia as well as without (i.e., reuse of Wikipedia text in a sample of the Common Crawl). To discover reuse beyond verbatim copy and paste, we employ state-of-the-art text reuse detection technology, scaling it for the first time to process the entire Wikipedia as part of a distributed retrieval pipeline. We further report on a pilot analysis of the 100 million reuse cases inside, and the 1.6 million reuse cases outside Wikipedia that we discovered. Text reuse inside Wikipedia gives rise to new tasks such as article template induction, fixing quality flaws, or complementing Wikipedia's ontology. Text reuse outside Wikipedia yields a tangible metric for the emerging field of quantifying Wikipedia's influence on the web. To foster future research into these tasks, and for reproducibility's sake, the Wikipedia text reuse corpus and the retrieval pipeline are made freely available.},
author = {Alshomary, Milad and Völske, Michael and Licht, Tristan and Wachsmuth, Henning and Stein, Benno and Hagen, Matthias and Potthast, Martin},
booktitle = {Advances in Information Retrieval},
editor = {Azzopardi, Leif and Stein, Benno and Fuhr, Norbert and Mayr, Philipp and Hauff, Claudia and Hiemstra, Djoerd},
isbn = {978-3-030-15712-8},
pages = {747--754},
publisher = {Springer International Publishing},
title = {{Wikipedia Text Reuse: Within and Without}},
year = {2019},
}
@misc{11713,
author = {Wachsmuth, Henning},
booktitle = {Computational Linguistics},
number = {3},
pages = {603 -- 606},
publisher = {ACL},
title = {{Book Review: Argumentation Mining}},
volume = {45},
year = {2019},
}
@inproceedings{13182,
abstract = {We consider congestion control in peer-to-peer distributed systems.
The problem can be reduced to the following scenario: Consider a set $V$ of $n$ peers (called \emph{clients} in this paper) that want to send messages to a fixed common peer (called \emph{server} in this paper).
We assume that each client $v \in V$ sends a message with probability $p(v) \in [0,1)$ and the server has a capacity of $\sigma \in \mathbb{N}$, i.e., it can recieve at most $\sigma$ messages per round and excess messages are dropped.
The server can modify these probabilities when clients send messages.
Ideally, we wish to converge to a state with $\sum p(v) = \sigma$ and $p(v) = p(w)$ for all $v,w \in V$.
We propose a \emph{loosely} self-stabilizing protocol with a slightly relaxed legitimate state.
Our protocol lets the system converge from \emph{any} initial state to a state where $\sum p(v) \in \left[\sigma \pm \epsilon\right]$ and $|p(v)-p(w)| \in O(\frac{1}{n})$.
This property is then maintained for $\Omega(n^{\mathfrak{c}})$ rounds in expectation.
In particular, the initial client probabilities and server variables are not necessarily well-defined, i.e., they may have arbitrary values.
Our protocol uses only $O(W + \log n)$ bits of memory where $W$ is length of node identifiers, making it very lightweight.
Finally we state a lower bound on the convergence time an see that our protocol performs asymptotically optimal (up to some polylogarithmic factor).
},
author = {Feldmann, Michael and Götte, Thorsten and Scheideler, Christian},
booktitle = {Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)},
pages = {149--164},
publisher = {Springer, Cham},
title = {{A Loosely Self-stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory}},
doi = {https://doi.org/10.1007/978-3-030-34992-9_13},
year = {2019},
}
@inproceedings{11965,
abstract = {We present an unsupervised training approach for a neural network-based mask estimator in an acoustic beamforming application. The network is trained to maximize a likelihood criterion derived from a spatial mixture model of the observations. It is trained from scratch without requiring any parallel data consisting of degraded input and clean training targets. Thus, training can be carried out on real recordings of noisy speech rather than simulated ones. In contrast to previous work on unsupervised training of neural mask estimators, our approach avoids the need for a possibly pre-trained teacher model entirely. We demonstrate the effectiveness of our approach by speech recognition experiments on two different datasets: one mainly deteriorated by noise (CHiME 4) and one by reverberation (REVERB). The results show that the performance of the proposed system is on par with a supervised system using oracle target masks for training and with a system trained using a model-based teacher.},
author = {Drude, Lukas and Heymann, Jahn and Haeb-Umbach, Reinhold},
booktitle = {INTERSPEECH 2019, Graz, Austria},
title = {{Unsupervised training of neural mask-based beamforming}},
year = {2019},
}