@unpublished{13339,
abstract = {Superposition states of circular currents of exciton-polaritons mimic the
superconducting flux qubits. The current states are formed by a macroscopic
number of bosonic quasiparticles that compose a single quantum state of a
many-body condensate. The essential difference between a polariton fluid and a
superconducting current comes from the fact that in contrast to Cooper pairs
polaritons are electrically neutral, and the magnetic field would not have a
significant effect on a polariton flow. Nevertheless, the phase of a polariton
condensate must change by an integer number of 2$\pi$, when going around the
ring. If one introduces a $\pi$-phase delay line in the ring, the system is
obliged to propagate a clockwise or anticlockwise circular current to reduce
the total phase gained over one round-trip to zero or to build it up to $2\pi$.
We show that such a $\pi$-delay line can be provided by a dark soliton embedded
into a ring condensate and pinned to a potential well created by a C-shape
non-resonant pump-spot. The physics of resulting split-ring polariton
condensates is essentially similar to the physics of flux qubits. In
particular, they exhibit pronounced coherent oscillations passing periodically
through clockwise and anticlockwise current states. We predict that these
oscillations may persist far beyond the coherence time of polariton
condensates. As a consequence, the qubits based on split-ring polariton
condensates are expected to possess very high figures of merit that makes them
a valuable alternative to superconducting qubits.},
author = {Xue, Yan and Chestnov, Igor and Sedov, Evgeny and Schumacher, Stefan and Ma, Xuekai and Kavokin, Alexey},
booktitle = {arXiv:1907.00383},
title = {{Split-ring polariton condensates as macroscopic two-level quantum systems}},
year = {2019},
}
@inproceedings{12918,
abstract = {The test for small delay faults is of major importance for predicting potential early life failures or wearout problems. Typically, a faster-than-at-speed test (FAST) with sev¬eral different frequencies is used to detect also hidden small delays, which can only be propagated over short paths. But then the outputs at the end of long paths may no longer reach their stable values at the nominal observation time and must be considered as unknown (X-values). Thus, test response compaction for FAST must be extremely flexible to cope with high X-rates, which also vary with the test frequencies. Stochastic compaction introduced by Mitra et al. is controlled by weighted pseudo-random signals allowing for easy adaptation to varying conditions. As demonstrated in previous work, the pseudo-random control can be optimized for high fault efficiency or X-reduction, but a given target in fault efficiency cannot be guaranteed. To close this gap, a hybrid space compactor is introduced in this paper. It is based on the observation that many faults are lost in the compaction of relatively few critical test patterns. For these critical patterns a deterministic compaction phase is added to the test, where the existing compactor structure is re-used, but controlled by specifically determined control vectors. },
author = {Maaz, Mohammad Urf and Sprenger, Alexander and Hellebrand, Sybille},
booktitle = {50th IEEE International Test Conference (ITC)},
keyword = {Faster-than-at-speed test, BIST, DFT, Test response compaction, Stochastic compactor, X-handling},
location = {Washington, DC, USA},
pages = {1--8},
publisher = {IEEE},
title = {{A Hybrid Space Compactor for Adaptive X-Handling}},
year = {2019},
}
@inproceedings{12944,
author = {Götte, Thorsten and Hinnenthal, Kristian and Scheideler, Christian},
booktitle = {Structural Information and Communication Complexity},
title = {{Faster Construction of Overlay Networks}},
doi = {10.1007/978-3-030-24922-9_18},
year = {2019},
}
@unpublished{12970,
abstract = {The paper studies component-factors of graphs which can be characterized in
terms of their fractional matching number. These results are used to prove that
every edge-chromatic critical graph has a $[1,2]$-factor. Furthermore,
fractional matchings of edge-chromatic critical graphs are studied and some
questions are related to Vizing's conjectures on the independence number and
2-factors of edge-chromatic critical graphs.},
author = {Klopp, Antje and Steffen, Eckhard},
booktitle = {arXiv:1903.12385},
title = {{Fractional matchings and component-factors of (edge-chromatic critical) graphs}},
year = {2019},
}
@article{13048,
abstract = {Marginal hardware introduces severe reliability threats throughout the life cycle of a system. Although marginalities may not affect the functionality of a circuit immediately after manufacturing, they can degrade into hard failures and must be screened out during manufacturing test to prevent early life failures. Furthermore, their evolution in the field must be proactively monitored by periodic tests before actual failures occur. In recent years small delay faults have gained increasing attention as possible indicators of marginal hardware. However, small delay faults on short paths may be undetectable even with advanced timing aware ATPG. Faster-than-at-speed test (FAST) can detect such hidden delay faults, but so far FAST has mainly been restricted to manufacturing test.},
author = {Kampmann, Matthias and A. Kochte, Michael and Liu, Chang and Schneider, Eric and Hellebrand, Sybille and Wunderlich, Hans-Joachim},
issn = {1937-4151},
journal = {IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems (TCAD)},
number = {10},
pages = {1956 -- 1968},
publisher = {IEEE},
title = {{Built-in Test for Hidden Delay Faults}},
volume = {38},
year = {2019},
}
@inproceedings{13106,
author = {Schumacher, Jan},
booktitle = {Beiträge zum Mathematikunterricht 2019},
location = {Regensburg},
title = {{Rekonstruktion diagrammatischen Schließens am Beispiel der Subtraktion negativer Zahlen}},
year = {2019},
}
@inproceedings{13132,
author = {Mohr, Felix and Wever, Marcel Dominik and Tornede, Alexander and Hüllermeier, Eyke},
booktitle = {INFORMATIK 2019: 50 Jahre Gesellschaft für Informatik – Informatik für Gesellschaft},
location = {Kassel},
pages = { 273--274 },
publisher = {Gesellschaft für Informatik e.V.},
title = {{From Automated to On-The-Fly Machine Learning}},
year = {2019},
}
@inproceedings{12076,
author = {Yigitbas, Enes and Heindörfer, Joshua and Engels, Gregor},
booktitle = {Proceedings of the Mensch und Computer 2019 (MuC ’19)},
pages = {885----888},
publisher = {ACM},
title = {{A Context-aware Virtual Reality First Aid Training Application}},
year = {2019},
}
@inproceedings{12874,
abstract = {We propose a training scheme to train neural network-based source separation algorithms from scratch when parallel clean data is unavailable. In particular, we demonstrate that an unsupervised spatial clustering algorithm is sufficient to guide the training of a deep clustering system. We argue that previous work on deep clustering requires strong supervision and elaborate on why this is a limitation. We demonstrate that (a) the single-channel deep clustering system trained according to the proposed scheme alone is able to achieve a similar performance as the multi-channel teacher in terms of word error rates and (b) initializing the spatial clustering approach with the deep clustering result yields a relative word error rate reduction of 26% over the unsupervised teacher.},
author = {Drude, Lukas and Hasenklever, Daniel and Haeb-Umbach, Reinhold},
booktitle = {ICASSP 2019, Brighton, UK},
title = {{Unsupervised Training of a Deep Clustering Model for Multichannel Blind Source Separation}},
year = {2019},
}
@inproceedings{12881,
abstract = {Internet of Things (IoT) applications witness an exceptional evolution of traffic demands, while existing protocols, as seen in wireless sensor networks (WSNs), struggle to cope with these demands. Traditional protocols rely on finding a routing path between sensors generating data and sinks acting as gateway or databases. Meanwhile, the network will suffer from high collisions in case of high data rates. In this context, in-network processing solutions are used to leverage the wireless nodes' computations, by distributing processing tasks on the nodes along the routing path. Although in-network processing solutions are very popular in wired networks (e.g., data centers and wide area networks), there are many challenges to adopt these solutions in wireless networks, due to the interference problem. In this paper, we solve the problem of routing and task distribution jointly using a greedy Virtual Network Embedding (VNE) algorithm, and consider power control as well. Through simulations, we compare the proposed algorithm to optimal solutions and show that it achieves good results in terms of delay. Moreover, we discuss its sub-optimality by driving tight lower bounds and loose upper bounds. We also compare our solution with another wireless VNE solution to show the trade-off between delay and symbol error rate.},
author = {Afifi, Haitham and Karl, Holger},
booktitle = {2019 12th IFIP Wireless and Mobile Networking Conference (WMNC) (WMNC'19)},
title = {{An Approximate Power Control Algorithm for a Multi-Cast Wireless Virtual Network Embedding}},
year = {2019},
}