@inproceedings{44843,
  abstract     = {{Unsupervised blind source separation methods do not require a training phase
and thus cannot suffer from a train-test mismatch, which is a common concern in
neural network based source separation. The unsupervised techniques can be
categorized in two classes, those building upon the sparsity of speech in the
Short-Time Fourier transform domain and those exploiting non-Gaussianity or
non-stationarity of the source signals. In this contribution, spatial mixture
models which fall in the first category and independent vector analysis (IVA)
as a representative of the second category are compared w.r.t. their separation
performance and the performance of a downstream speech recognizer on a
reverberant dataset of reasonable size. Furthermore, we introduce a serial
concatenation of the two, where the result of the mixture model serves as
initialization of IVA, which achieves significantly better WER performance than
each algorithm individually and even approaches the performance of a much more
complex neural network based technique.}},
  author       = {{Boeddeker, Christoph and Rautenberg, Frederik and Haeb-Umbach, Reinhold}},
  booktitle    = {{ITG Conference on Speech Communication}},
  location     = {{Kiel}},
  title        = {{{A Comparison and Combination of Unsupervised Blind Source Separation  Techniques}}},
  year         = {{2021}},
}

@inproceedings{28259,
  author       = {{Boeddeker, Christoph and Zhang, Wangyou and Nakatani, Tomohiro and Kinoshita, Keisuke and Ochiai, Tsubasa and Delcroix, Marc and Kamo, Naoyuki and Qian, Yanmin and Haeb-Umbach, Reinhold}},
  booktitle    = {{ICASSP 2021 - 2021 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)}},
  title        = {{{Convolutive Transfer Function Invariant SDR Training Criteria for Multi-Channel Reverberant Speech Separation}}},
  doi          = {{10.1109/icassp39728.2021.9414661}},
  year         = {{2021}},
}

@inproceedings{23998,
  author       = {{Schmalenstroeer, Joerg and Heitkaemper, Jens and Ullmann, Joerg and Haeb-Umbach, Reinhold}},
  booktitle    = {{29th European Signal Processing Conference (EUSIPCO)}},
  pages        = {{1--5}},
  title        = {{{Open Range Pitch Tracking for Carrier Frequency Difference Estimation from HF Transmitted Speech}}},
  year         = {{2021}},
}

@article{22528,
  abstract     = {{Due to the ad hoc nature of wireless acoustic sensor networks, the position of the sensor nodes is typically unknown. This contribution proposes a technique to estimate the position and orientation of the sensor nodes from the recorded speech signals. The method assumes that a node comprises a microphone array with synchronously sampled microphones rather than a single microphone, but does not require the sampling clocks of the nodes to be synchronized. From the observed audio signals, the distances between the acoustic sources and arrays, as well as the directions of arrival, are estimated. They serve as input to a non-linear least squares problem, from which both the sensor nodes’ positions and orientations, as well as the source positions, are alternatingly estimated in an iterative process. Given one set of unknowns, i.e., either the source positions or the sensor nodes’ geometry, the other set of unknowns can be computed in closed-form. The proposed approach is computationally efficient and the first one, which employs both distance and directional information for geometry calibration in a common cost function. Since both distance and direction of arrival measurements suffer from outliers, e.g., caused by strong reflections of the sound waves on the surfaces of the room, we introduce measures to deemphasize or remove unreliable measurements. Additionally, we discuss modifications of our previously proposed deep neural network-based acoustic distance estimator, to account not only for omnidirectional sources but also for directional sources. Simulation results show good positioning accuracy and compare very favorably with alternative approaches from the literature.}},
  author       = {{Gburrek, Tobias and Schmalenstroeer, Joerg and Haeb-Umbach, Reinhold}},
  issn         = {{1687-4722}},
  journal      = {{EURASIP Journal on Audio, Speech, and Music Processing}},
  title        = {{{Geometry calibration in wireless acoustic sensor networks utilizing DoA and distance information}}},
  doi          = {{10.1186/s13636-021-00210-x}},
  year         = {{2021}},
}

@inproceedings{23994,
  author       = {{Gburrek, Tobias and Schmalenstroeer, Joerg and Haeb-Umbach, Reinhold}},
  booktitle    = {{ICASSP 2021 - 2021 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)}},
  title        = {{{Iterative Geometry Calibration from Distance Estimates for Wireless Acoustic Sensor Networks}}},
  doi          = {{10.1109/icassp39728.2021.9413831}},
  year         = {{2021}},
}

@inproceedings{23999,
  author       = {{Gburrek, Tobias and Schmalenstroeer, Joerg and Haeb-Umbach, Reinhold}},
  booktitle    = {{Speech Communication; 14th ITG-Symposium}},
  pages        = {{1--5}},
  title        = {{{On Source-Microphone Distance Estimation Using Convolutional Recurrent Neural Networks}}},
  year         = {{2021}},
}

@inproceedings{23997,
  author       = {{Chinaev, Aleksej and Enzner, Gerald and Gburrek, Tobias and Schmalenstroeer, Joerg}},
  booktitle    = {{29th European Signal Processing Conference (EUSIPCO)}},
  pages        = {{1--5}},
  title        = {{{Online Estimation of Sampling Rate Offsets in Wireless Acoustic Sensor Networks with Packet Loss}}},
  year         = {{2021}},
}

@inproceedings{29304,
  abstract     = {{In this work we address disentanglement of style and content in speech signals. We propose a fully convolutional variational autoencoder employing two encoders: a content encoder and a style encoder. To foster disentanglement, we propose adversarial contrastive predictive coding. This new disentanglement method does neither need parallel data nor any supervision. We show that the proposed technique is capable of separating speaker and content traits into the two different representations and show competitive speaker-content disentanglement performance compared to other unsupervised approaches. We further demonstrate an increased robustness of the content representation against a train-test mismatch compared to spectral features, when used for phone recognition.}},
  author       = {{Ebbers, Janek and Kuhlmann, Michael and Cord-Landwehr, Tobias and Haeb-Umbach, Reinhold}},
  booktitle    = {{Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)}},
  pages        = {{3860–3864}},
  title        = {{{Contrastive Predictive Coding Supported Factorized Variational Autoencoder for Unsupervised Learning of Disentangled Speech Representations}}},
  year         = {{2021}},
}

@article{31578,
  author       = {{Häsel-Weide, Uta and Seitz, Simone and Wallner, Melina and Wilke, Yannik and Heckmann, Lara}},
  journal      = {{QfI - Qualifizierung für Inklusion. Online-Zeitschrift zur Forschung über Aus-, Fort- und Weiterbildung pädagogischer Fachkräfte}},
  number       = {{1}},
  title        = {{{Mit Aufgaben im inklusiven Mathematikunterricht professionell umgehen - Erkenntnisse einer Interviewstudie mit Lehrpersonen der Sekundarstufe}}},
  doi          = {{10.21248/qfi.57}},
  volume       = {{3}},
  year         = {{2021}},
}

@inproceedings{31583,
  author       = {{Hattermann, Mathias and Häsel-Weide, Uta and Wallner, Melina}},
  booktitle    = {{Proceedings of the 44th Conference of the International Group for the Psychology of Mathematics Education }},
  editor       = {{Inprasitha, M. and Changsri, N. and Boonsena, N.}},
  pages        = {{9--15}},
  title        = {{{Conceptualiziation processes of 6th graders for rotational symmetry}}},
  volume       = {{3}},
  year         = {{2021}},
}

@inproceedings{22894,
  abstract     = {{The first order optimality conditions of optimal control problems (OCPs) can
be regarded as boundary value problems for Hamiltonian systems. Variational or
symplectic discretisation methods are classically known for their excellent
long term behaviour. As boundary value problems are posed on intervals of
fixed, moderate length, it is not immediately clear whether methods can profit
from structure preservation in this context. When parameters are present,
solutions can undergo bifurcations, for instance, two solutions can merge and
annihilate one another as parameters are varied. We will show that generic
bifurcations of an OCP are preserved under discretisation when the OCP is
either directly discretised to a discrete OCP (direct method) or translated
into a Hamiltonian boundary value problem using first order necessary
conditions of optimality which is then solved using a symplectic integrator
(indirect method). Moreover, certain bifurcations break when a non-symplectic
scheme is used. The general phenomenon is illustrated on the example of a cut
locus of an ellipsoid.}},
  author       = {{Offen, Christian and Ober-Blöbaum, Sina}},
  issn         = {{2405-8963}},
  keywords     = {{optimal control, catastrophe theory, bifurcations, variational methods, symplectic integrators}},
  location     = {{Berlin, Germany}},
  pages        = {{334--339}},
  title        = {{{Bifurcation preserving discretisations of optimal control problems}}},
  doi          = {{https://doi.org/10.1016/j.ifacol.2021.11.099}},
  volume       = {{54(19)}},
  year         = {{2021}},
}

@inproceedings{21572,
  author       = {{Ridderbusch, Steffen and Offen, Christian and Ober-Blöbaum, Sina and Goulart, Paul}},
  booktitle    = {{2021 60th IEEE Conference on Decision and Control (CDC)}},
  location     = {{Austin, TX, USA}},
  pages        = {{2896}},
  publisher    = {{IEEE}},
  title        = {{{Learning ODE Models with Qualitative Structure Using Gaussian Processes }}},
  doi          = {{10.1109/CDC45484.2021.9683426}},
  year         = {{2021}},
}

@inproceedings{21592,
  abstract     = {{We propose a reachability approach for infinite and finite horizon multi-objective optimization problems for low-thrust spacecraft trajectory design. The main advantage of the proposed method is that the Pareto front can be efficiently constructed from the zero level set of the solution to a Hamilton-Jacobi-Bellman equation. We demonstrate the proposed method by applying it to a low-thrust spacecraft trajectory design problem. By deriving the analytic expression for the Hamiltonian and the optimal control policy, we are able to efficiently compute the backward reachable set and reconstruct the optimal trajectories. Furthermore, we show that any reconstructed trajectory will be guaranteed to be weakly Pareto optimal. The proposed method can be used as a benchmark for future research of applying reachability analysis to low-thrust spacecraft trajectory design.}},
  author       = {{Vertovec, Nikolaus and Ober-Blöbaum, Sina and Margellos, Kostas}},
  location     = {{Rotterdam, the Netherlands}},
  pages        = {{1975--1980}},
  title        = {{{Multi-objective minimum time optimal control for low-thrust trajectory design}}},
  year         = {{2021}},
}

@inproceedings{29868,
  author       = {{Jiménez, F. and Ober-Blöbaum, Sina}},
  booktitle    = {{Nichtlineare Sci 31}},
  title        = {{{Fractional Damping Through Restricted Calculus of Variations}}},
  volume       = {{46}},
  year         = {{2021}},
}

@inproceedings{21272,
  author       = {{Ködding, Patrick and Dumitrescu, Roman}},
  booktitle    = {{Digitalisisierung souverän gestalten}},
  editor       = {{Hartmann, Ernst A.}},
  pages        = {{pp. 59--73}},
  publisher    = {{Springer Vieweg}},
  title        = {{{Forschungsfelder für Künstliche Intelligenz in der strategischen Produktplanung}}},
  year         = {{2021}},
}

@inproceedings{48286,
  author       = {{Habernal, Ivan}},
  booktitle    = {{Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing}},
  publisher    = {{Association for Computational Linguistics}},
  title        = {{{When differential privacy meets NLP: The devil is in the detail}}},
  doi          = {{10.18653/v1/2021.emnlp-main.114}},
  year         = {{2021}},
}

@inproceedings{29893,
  abstract     = {{Phase-shift modulated full bridge converters suffer from thermal imbalances of the inverter switches. The lagging leg switches are subject to larger commutation currents compared to those of the leading leg as the transformer current reduces in the freewheeling interval. Furthermore, after this interval, the energy in the series inductance may not be large enough to achieve zero-voltage switching (ZVS) for the leading leg. Both effects result in thermal imbalances. This paper analyzes the alternating-asymmetrical phase-shift modulation to achieve balanced conduction and switching losses for all four switches while showing that this modulation is easily implemented on standard DSPs. The modulation has been implemented to LLC converters where experimental measurement results proved its effectiveness for LLC converters by reducing the temperature deviation from 6.3 K to only 0.2 K such that the peak temperature is reduced from 95 °C to 92 °C. The paper also proves that the modulation can be utilized to improve the efficiency of LLC converters operated at very low gains while simultaneously reducing the junction temperature of all four switches compared to the conventional complementary modulation. Finally, EMI implications are analyzed, which show that the modulation may be beneficial for reducing the common-mode emissions around the operating frequency.}},
  author       = {{Rehlaender, Philipp and Unruh, Roland and Schafmeister, Frank and Böcker, Joachim}},
  booktitle    = {{2021 IEEE Applied Power Electronics Conference and Exposition (APEC)}},
  isbn         = {{978-1-7281-8950-5}},
  keywords     = {{Phase-Shifted Full Bridge, Full-Bridge Converter, Phase-Shift Control, Phase-Shift Modulation, LLC Converter, Thermal Balancing}},
  location     = {{Phoenix, AZ, USA}},
  publisher    = {{IEEE}},
  title        = {{{Alternating Asymmetrical Phase-Shift Modulation for Full-Bridge Converters with Balanced Switching Losses to Reduce Thermal Imbalances}}},
  doi          = {{10.1109/apec42165.2021.9487104}},
  year         = {{2021}},
}

@article{34827,
  abstract     = {{<jats:title>Zusammenfassung</jats:title><jats:p>Zu den ersten geometrischen Begriffen, die Kinder bereits im Elementar- und Primarbereich lernen, zählen u. a. Viereck, Rechteck und Quadrat. Studien zeigen, dass Lernende bereits früh individuelle Vorstellungen, sog. <jats:italic>individuelle Begriffskonzepte,</jats:italic> zu diesen Begriffen aufbauen. Zwar wird die Entwicklung von Begriffsverständnis in verschiedenen mathematikdidaktischen Stufenmodellen dargestellt, diese sind jedoch generisch und beschreiben nicht explizit die Entwicklung der ersten <jats:italic>individuellen Begriffskonzepte </jats:italic>von Lernenden zu Viereck, Rechteck und Quadrat. Aus empirischer Sicht liegen verschiedene Studien vor, die einzelne Aspekte der individuellen Begriffskonzepte von Lernenden unterschiedlicher Altersgruppen zu diesen Begriffen ausleuchten. Um Begriffsbildungsprozesse aus empirischer Sicht detaillierter entlang der jeweils vorherrschenden individuellen Begriffskonzepte zu beschreiben, fehlen insbesondere Studien in der Grundschule, die alle vier Klassenstufen betrachten und dabei differenzierte Erkenntnisse zu verschiedenen theoretischen Indikatoren des Begriffsverständnisses liefern. Daher geht die vorliegende Studie der Frage nach, welches Verständnis der Begriffe Viereck, Rechteck und Quadrat Schülerinnen und Schüler der Jahrgangsstufen 1, 2, 3 und 4 zeigen. Dazu wurde eine Quasi-Längsschnittstudie mit <jats:italic>N</jats:italic> = 456 Grundschulkindern (ca. 100 pro Jahrgangsstufe) durchgeführt. Die Ergebnisse geben detaillierte Einblicke in die individuellen Begriffskonzepte der Lernenden und zeigen, dass Lernende zunehmend Eigenschaften der Figuren berücksichtigen, jedoch individuelle Begriffskonzepte über lange Zeit auch prototypisch geprägt sind. Implikationen dieser Ergebnisse für Forschung und Praxis werden diskutiert.</jats:p>}},
  author       = {{Bruns, Julia and Unterhauser, Elisabeth and Gasteiger, Hedwig}},
  issn         = {{0173-5322}},
  journal      = {{Journal für Mathematik-Didaktik}},
  keywords     = {{Education, General Mathematics}},
  number       = {{2}},
  pages        = {{581--623}},
  publisher    = {{Springer Science and Business Media LLC}},
  title        = {{{Geometrisches Begriffsverständnis in der Grundschule am Beispiel der Begriffe Viereck, Rechteck und Quadrat}}},
  doi          = {{10.1007/s13138-021-00185-4}},
  volume       = {{42}},
  year         = {{2021}},
}

@article{45382,
  author       = {{Prediger, Susanne and Dröse, Jennifer}},
  journal      = {{Lernen und Lernstörungen, 10(2)}},
  title        = {{{Fehlerbearbeitung bei mathematischen Textaufgaben – Sprachliche und strategische Fehlerursachen und ihre Bearbeitung}}},
  doi          = {{doi.org/10.1024/2235-0977/a000330}},
  year         = {{2021}},
}

@inproceedings{26770,
  abstract     = {{Automatic transcription of meetings requires handling of overlapped speech, which calls for continuous speech separation (CSS) systems. The uPIT criterion was proposed for utterance-level separation with neural networks and introduces the constraint that the total number of speakers must not exceed the number of output channels. When processing meeting-like data in a segment-wise manner, i.e., by separating overlapping segments independently and stitching adjacent segments to continuous output streams, this constraint has to be fulfilled for any segment. In this contribution, we show that this constraint can be significantly relaxed. We propose a novel graph-based PIT criterion, which casts the assignment of utterances to output channels in a graph coloring problem. It only requires that the number of concurrently active speakers must not exceed the number of output channels. As a consequence, the system can process an arbitrary number of speakers and arbitrarily long segments and thus can handle more diverse scenarios.
Further, the stitching algorithm for obtaining a consistent output order in neighboring segments is of less importance and can even be eliminated completely, not the least reducing the computational effort. Experiments on meeting-style WSJ data show improvements in recognition performance over using the uPIT criterion. }},
  author       = {{von Neumann, Thilo and Kinoshita, Keisuke and Boeddeker, Christoph and Delcroix, Marc and Haeb-Umbach, Reinhold}},
  booktitle    = {{Interspeech 2021}},
  keywords     = {{Continuous speech separation, automatic speech recognition, overlapped speech, permutation invariant training}},
  title        = {{{Graph-PIT: Generalized Permutation Invariant Training for Continuous Separation of Arbitrary Numbers of Speakers}}},
  doi          = {{10.21437/interspeech.2021-1177}},
  year         = {{2021}},
}

