@article{16301,
  author       = {{Atorf, Bernhard and Mühlenbernd, Holger and Zentgraf, Thomas and Kitzerow, Heinz-Siegfried}},
  issn         = {{1094-4087}},
  journal      = {{Optics Express}},
  number       = {{6}},
  pages        = {{8898--8908}},
  title        = {{{All-optical switching of a dye-doped liquid crystal plasmonic metasurface}}},
  doi          = {{10.1364/oe.383877}},
  volume       = {{28}},
  year         = {{2020}},
}

@inproceedings{31361,
  abstract     = {{At Paderborn University, a new 6th semester geometry-course for upper secondary student teachers has been designed and taught by the first author of this paper. To show links between academic mathematics and school mathematics we established so-called interface weeks. These are weeks during a course in which lecture, exercises and homework focus on topics that are related to the normal canon of content but specially chosen for their relevance in school contexts. In this article, we want to present our design for an interface week on the topic of congruence. In order to do so, we first illustrate how so-called interface aspects are used to systematize the mathematical background of the topic, thus giving future mathematics teachers the chance to act professionally. We then show examples of learning activities and first results of the accompanying research.}},
  author       = {{Hoffmann, Max and Biehler, Rolf}},
  booktitle    = {{ INDRUM 2020, Université de Carthage, Université de Montpellier, Sep 2020, Cyberspace (virtually from Bizerte), Tunisia}},
  title        = {{{Designing a Geometry Capstone Course for Student Teachers: Bridging the gap between academic mathematics and school mathematics in the case of congruence}}},
  year         = {{2020}},
}

@article{36263,
  author       = {{Weber, Jutta}},
  journal      = {{Wissenschaft & Frieden 2020-3: Der kranke Planet. Beilage}},
  publisher    = {{Hg. von der Informationsstelle Wissenschaft und Frieden e.V. zus. mit der Kampagne »Killer Roboter stoppen!«}},
  title        = {{{Skynet oder Slaughterbots. Schwarmintelligenz in Militär, Politik und Populärkultur}}},
  year         = {{2020}},
}

@article{36265,
  author       = {{Weber, Jutta}},
  journal      = {{Technosecurity Cultures, Sonderausgabe „Science as Culture“ (Hg.: Jutta Weber/Katrin M. Kämpf)}},
  pages        = {{1--10}},
  title        = {{{Introduction: Technosecurity Cultures}}},
  volume       = {{Vol. 29(1)}},
  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}},
}

@article{33299,
  abstract     = {{The aim of this study was to find out whether teaching how to search for literature
would be more beneficial to students and teachers if done online through short videos
rather than in person during course time. To find out whether online videos are more
beneficial, two courses were asked to fill in questionnaires, one at the beginning and
one at the end of the semester. One of the courses received the input online via videos
and were given an exercise to put the newly learned skills to use, the other course
served as a control group and learned how to search for literature during the course.
The results show that while the difference between the two groups is not significant,
the videos can still be regarded as being more beneficial than teaching the necessary
skills during course time.}},
  author       = {{Hahn, Charlotte Anna}},
  issn         = {{ISSN 2199-8825}},
  journal      = {{die hochschullehre}},
  keywords     = {{E-Learning, information competence, literature, library, research}},
  number       = {{6}},
  title        = {{{Informationskompetenz durch E-Learning? Durch Lernvideos nach Literatur suchen}}},
  year         = {{2020}},
}

@inproceedings{20762,
  abstract     = {{The rising interest in single-channel multi-speaker speech separation sparked development of End-to-End (E2E) approaches to multispeaker speech recognition. However, up until now, state-of-theart neural network–based time domain source separation has not yet been combined with E2E speech recognition. We here demonstrate how to combine a separation module based on a Convolutional Time domain Audio Separation Network (Conv-TasNet) with an E2E speech recognizer and how to train such a model jointly by distributing it over multiple GPUs or by approximating truncated back-propagation for the convolutional front-end. To put this work into perspective and illustrate the complexity of the design space, we provide a compact overview of single-channel multi-speaker recognition systems. Our experiments show a word error rate of 11.0% on WSJ0-2mix and indicate that our joint time domain model can yield substantial improvements over cascade DNN-HMM and monolithic E2E frequency domain systems proposed so far.}},
  author       = {{von Neumann, Thilo and Kinoshita, Keisuke and Drude, Lukas and Boeddeker, Christoph and Delcroix, Marc and Nakatani, Tomohiro and Haeb-Umbach, Reinhold}},
  booktitle    = {{ICASSP 2020 - 2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)}},
  pages        = {{7004--7008}},
  title        = {{{End-to-End Training of Time Domain Audio Separation and Recognition}}},
  doi          = {{10.1109/ICASSP40776.2020.9053461}},
  year         = {{2020}},
}

@inproceedings{20764,
  abstract     = {{Most approaches to multi-talker overlapped speech separation and recognition assume that the number of simultaneously active speakers is given, but in realistic situations, it is typically unknown. To cope with this, we extend an iterative speech extraction system with mechanisms to count the number of sources and combine it with a single-talker speech recognizer to form the first end-to-end multi-talker automatic speech recognition system for an unknown number of active speakers. Our experiments show very promising performance in counting accuracy, source separation and speech recognition on simulated clean mixtures from WSJ0-2mix and WSJ0-3mix. Among others, we set a new state-of-the-art word error rate on the WSJ0-2mix database. Furthermore, our system generalizes well to a larger number of speakers than it ever saw during training, as shown in experiments with the WSJ0-4mix database. }},
  author       = {{von Neumann, Thilo and Boeddeker, Christoph and Drude, Lukas and Kinoshita, Keisuke and Delcroix, Marc and Nakatani, Tomohiro and Haeb-Umbach, Reinhold}},
  booktitle    = {{Proc. Interspeech 2020}},
  pages        = {{3097--3101}},
  title        = {{{Multi-Talker ASR for an Unknown Number of Sources: Joint Training of Source Counting, Separation and ASR}}},
  doi          = {{10.21437/Interspeech.2020-2519}},
  year         = {{2020}},
}

@inproceedings{18651,
  abstract     = {{We present an approach to deep neural network based (DNN-based) distance estimation in reverberant rooms for supporting geometry calibration tasks in wireless acoustic sensor networks. Signal diffuseness information from acoustic signals is aggregated via the coherent-to-diffuse power ratio to obtain a distance-related feature, which is mapped to a source-to-microphone distance estimate by means of a DNN. This information is then combined with direction-of-arrival estimates from compact microphone arrays to infer the geometry of the sensor network. Unlike many other approaches to geometry calibration, the proposed scheme does only require that the sampling clocks of the sensor nodes are roughly synchronized. In simulations we show that the proposed DNN-based distance estimator generalizes to unseen acoustic environments and that precise estimates of the sensor node positions are obtained. }},
  author       = {{Gburrek, Tobias and Schmalenstroeer, Joerg and Brendel, Andreas and Kellermann, Walter and Haeb-Umbach, Reinhold}},
  booktitle    = {{European Signal Processing Conference (EUSIPCO)}},
  title        = {{{Deep Neural Network based Distance Estimation for Geometry Calibration in Acoustic Sensor Network}}},
  year         = {{2020}},
}

@inproceedings{20766,
  abstract     = {{Recently, the source separation performance was greatly improved by time-domain audio source separation based on dual-path recurrent neural network (DPRNN). DPRNN is a simple but effective model for a long sequential data. While DPRNN is quite efficient in modeling a sequential data of the length of an utterance, i.e., about 5 to 10 second data, it is harder to apply it to longer sequences such as whole conversations consisting of multiple utterances. It is simply because, in such a case, the number of time steps consumed by its internal module called inter-chunk RNN becomes extremely large. To mitigate this problem, this paper proposes a multi-path RNN (MPRNN), a generalized version of DPRNN, that models the input data in a hierarchical manner. In the MPRNN framework, the input data is represented at several (>_ 3) time-resolutions, each of which is modeled by a specific RNN sub-module. For example, the RNN sub-module that deals with the finest resolution may model temporal relationship only within a phoneme, while the RNN sub-module handling the most coarse resolution may capture only the relationship between utterances such as speaker information. We perform experiments using simulated dialogue-like mixtures and show that MPRNN has greater model capacity, and it outperforms the current state-of-the-art DPRNN framework especially in online processing scenarios.}},
  author       = {{Kinoshita, Keisuke and von Neumann, Thilo and Delcroix, Marc and Nakatani, Tomohiro and Haeb-Umbach, Reinhold}},
  booktitle    = {{Proc. Interspeech 2020}},
  pages        = {{2652--2656}},
  title        = {{{Multi-Path RNN for Hierarchical Modeling of Long Sequential Data and its Application to Speaker Stream Separation}}},
  doi          = {{10.21437/Interspeech.2020-2388}},
  year         = {{2020}},
}

@inproceedings{20753,
  abstract     = {{In this paper we present our system for the detection and classification of acoustic scenes and events (DCASE) 2020 Challenge Task 4: Sound event detection and separation in domestic environments. We introduce two new models: the forward-backward convolutional recurrent neural network (FBCRNN) and the tag-conditioned convolutional neural network (CNN). The FBCRNN employs two recurrent neural network (RNN) classifiers sharing the same CNN for preprocessing. With one RNN processing a recording in forward direction and the other in backward direction, the two networks are trained to jointly predict audio tags, i.e., weak labels, at each time step within a recording, given that at each time step they have jointly processed the whole recording. The proposed training encourages the classifiers to tag events as soon as possible. Therefore, after training, the networks can be applied to shorter audio segments of, e.g., 200ms, allowing sound event detection (SED). Further, we propose a tag-conditioned CNN to complement SED. It is trained to predict strong labels while using (predicted) tags, i.e., weak labels, as additional input. For training pseudo strong labels from a FBCRNN ensemble are used. The presented system scored the fourth and third place in the systems and teams rankings, respectively. Subsequent improvements allow our system to even outperform the challenge baseline and winner systems in average by, respectively, 18.0% and 2.2% event-based F1-score on the validation set. Source code is publicly available at https://github.com/fgnt/pb_sed.}},
  author       = {{Ebbers, Janek and Haeb-Umbach, Reinhold}},
  booktitle    = {{Proceedings of the Detection and Classification of Acoustic Scenes and Events 2020 Workshop (DCASE2020)}},
  title        = {{{Forward-Backward Convolutional Recurrent Neural Networks and Tag-Conditioned Convolutional Neural Networks for Weakly Labeled Semi-Supervised Sound Event Detection}}},
  year         = {{2020}},
}

@misc{49599,
  author       = {{Fastlabend-Vargas, Daniel}},
  publisher    = {{Zwischentöne.info }},
  title        = {{{Geschichte(n) der deutschen Migrationsgesellschaft. Jugendliche erzählen begründete historische Geschichten Eine Unterrichtsreihe für das Portal Zwischentöne.info }}},
  year         = {{2020}},
}

@misc{49767,
  author       = {{Huybrechts, Yves}},
  publisher    = {{BelgienNet}},
  title        = {{{"Die Bombardierung von Brüssel - teil 1" (PODCAST)}}},
  year         = {{2020}},
}

@misc{49756,
  author       = {{Huybrechts, Yves}},
  publisher    = {{BelgienNet}},
  title        = {{{"Ein Gespräch mit Guy Vanhengel - Ein Gespräch mit dem Vizepräsidenten des Brüsseler Parlaments, in zwei Teilen." (VIDEO)}}},
  year         = {{2020}},
}

@misc{49750,
  author       = {{Huybrechts, Yves}},
  publisher    = {{BelgienNet}},
  title        = {{{Interview zur Ausstellung "Rubens und der Barock im Norden" - 2 Teile (VIDEO)}}},
  year         = {{2020}},
}

@inbook{49869,
  author       = {{Neiske, Iris and Bücker, Diana}},
  booktitle    = {{Medienpädagogik als Schlüsseldisziplin in einer mediatisierten Welt. Perspektiven aus Theorie, Empirie und Praxis 37}},
  issn         = {{1424-3636}},
  pages        = {{299--312}},
  title        = {{{Medienpädagogik und Hochschuldidaktik}}},
  year         = {{2020}},
}

@article{50279,
  author       = {{Daniel-Söltenfuß, Desiree}},
  journal      = {{bwp@}},
  title        = {{{Aushandlungsprozesse über Freiheiten und Grenzen im selbstregulierten Lernen. Erwartungen und Handlungsmuster bei Schüler*innen und Lehrpersonen im Übergangssystem}}},
  volume       = {{38}},
  year         = {{2020}},
}

@article{25806,
  author       = {{Lübbecke, Silvia and Schnedler, Wendelin}},
  issn         = {{1058-6407}},
  journal      = {{Journal of Economics & Management Strategy}},
  pages        = {{420--438}},
  title        = {{{Don't patronize me! An experiment on preferences for authorship}}},
  doi          = {{10.1111/jems.12347}},
  year         = {{2020}},
}

@inbook{50697,
  author       = {{Albus, Vanessa}},
  booktitle    = {{Handbuch Lehrerinnen- und Lehrerbildung}},
  editor       = {{Cramer, Coli and König, Johannes and Rothland, Martin and Blömeke, Sigrid}},
  pages        = {{495--500}},
  title        = {{{Philosophie und Ethik in der Lehrerinnen und Lehrerbildung}}},
  year         = {{2020}},
}

@article{50865,
  author       = {{Blank, Andreas}},
  journal      = {{Journal of Modern Philosophy}},
  number       = {{10}},
  pages        = {{1--18}},
  title        = {{{“D’Holbach on (Dis-)Esteeming Talent.” }}},
  volume       = {{2}},
  year         = {{2020}},
}