@misc{33816,
  author       = {{Gburrek, Tobias and Boeddeker, Christoph and von Neumann, Thilo and Cord-Landwehr, Tobias and Schmalenstroeer, Joerg and Haeb-Umbach, Reinhold}},
  publisher    = {{arXiv}},
  title        = {{{A Meeting Transcription System for an Ad-Hoc Acoustic Sensor Network}}},
  doi          = {{10.48550/ARXIV.2205.00944}},
  year         = {{2022}},
}

@inproceedings{33954,
  author       = {{Boeddeker, Christoph and Cord-Landwehr, Tobias and von Neumann, Thilo and Haeb-Umbach, Reinhold}},
  booktitle    = {{Interspeech 2022}},
  publisher    = {{ISCA}},
  title        = {{{An Initialization Scheme for Meeting Separation with Spatial Mixture Models}}},
  doi          = {{10.21437/interspeech.2022-10929}},
  year         = {{2022}},
}

@inproceedings{33958,
  abstract     = {{Recent speaker diarization studies showed that integration of end-to-end neural diarization (EEND) and clustering-based diarization is a promising approach for achieving state-of-the-art performance on various tasks. Such an approach first divides an observed signal into fixed-length segments, then performs {\it segment-level} local diarization based on an EEND module, and merges the segment-level results via clustering to form a final global diarization result. The segmentation is done to limit the number of speakers in each segment since the current EEND cannot handle a large number of speakers. In this paper, we argue that such an approach involving the segmentation has several issues; for example, it inevitably faces a dilemma that larger segment sizes increase both the context available for enhancing the performance and the number of speakers for the local EEND module to handle. To resolve such a problem, this paper proposes a novel framework that performs diarization without segmentation. However, it can still handle challenging data containing many speakers and a significant amount of overlapping speech. The proposed method can take an entire meeting for inference and perform {\it utterance-by-utterance} diarization that clusters utterance activities in terms of speakers. To this end, we leverage a neural network training scheme called Graph-PIT proposed recently for neural source separation. Experiments with simulated active-meeting-like data and CALLHOME data show the superiority of the proposed approach over the conventional methods.}},
  author       = {{Kinoshita, Keisuke and von Neumann, Thilo and Delcroix, Marc and Boeddeker, Christoph and Haeb-Umbach, Reinhold}},
  booktitle    = {{Proc. Interspeech 2022}},
  pages        = {{1486--1490}},
  publisher    = {{ISCA}},
  title        = {{{Utterance-by-utterance overlap-aware neural diarization with Graph-PIT}}},
  doi          = {{10.21437/Interspeech.2022-11408}},
  year         = {{2022}},
}

@inproceedings{32247,
  author       = {{Alshomary, Milad and Rieskamp, Jonas and Wachsmuth, Henning}},
  booktitle    = {{Proceedings of the 9th International Conference on Computational Models of Argument}},
  pages        = {{21 -- 31}},
  title        = {{{Generating Contrastive Snippets for Argument Search}}},
  doi          = {{http://dx.doi.org/10.3233/FAIA220138}},
  year         = {{2022}},
}

@inproceedings{30840,
  author       = {{Alshomary, Milad and El Baff, Roxanne and Gurcke, Timon and Wachsmuth, Henning}},
  booktitle    = {{Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics}},
  pages        = {{8782 -- 8797}},
  title        = {{{The Moral Debater: A Study on the Computational Generation of Morally Framed Arguments}}},
  year         = {{2022}},
}

@inproceedings{31805,
  author       = {{Kruse, Stephan and Bahmanian, Meysam and Fard, Saeed and Meinecke, Marc-Michael and Kurz, Heiko G. and Scheytt, Christoph}},
  booktitle    = {{European Radar Conference (EuRAD)}},
  title        = {{{A Low Phase Noise 77 GHz Frequency Synthesizer for Long Range Radar}}},
  doi          = {{10.23919/EuRAD54643.2022.9924677}},
  year         = {{2022}},
}

@inproceedings{29770,
  author       = {{Abughannam, Saed and Kruse, Stephan and Iftekhar, Mohammed and Scheytt, J. Christoph}},
  booktitle    = {{German Microwave Conference 2022 (GeMiC 2022)}},
  title        = {{{Design and Measurements of a Low-power Low-Date-rate Direct-detection Wireless Receiver with Improved Co-channel Interference Robustness}}},
  year         = {{2022}},
}

@article{34232,
  abstract     = {{<jats:p>In this paper, the theory of phase-locking of a microwave oscillator on the interharmonics, i.e. non-integer harmonics, of the repetition rate of the optical pulse train of a mode-locked laser (MLL) is developed. A balanced optical microwave phase detector (BOMPD) is implemented using a balanced Mach-Zehnder modulator and is employed to discriminate the phase difference between the envelope of the optical pulses and the microwave oscillator. It is shown mathematically that the inherent nonlinear properties of BOMPD with respect to the microwave excitation amplitude can be used for interharmonic locking. The characteristic functions of the phase detector for interharmonic locking are derived analytically and are compared with the measurement results. An opto-electronic phase-locked loop (OEPLL) is demonstrated whose output frequency locks on interharmonics of the MLL repetition rate when an appropriate modulator bias and sufficient RF amplitude are applied. Thus, for the first time theory and experiment of reliable locking on interharmonics of the repetition rate of a MLL are presented.</jats:p>}},
  author       = {{Bahmanian, Meysam and Kress, Christian and Scheytt, J. Christoph}},
  issn         = {{1094-4087}},
  journal      = {{Optics Express}},
  number       = {{5}},
  publisher    = {{Optica Publishing Group}},
  title        = {{{Locking of microwave oscillators on the interharmonics of mode-locked laser signals}}},
  doi          = {{10.1364/oe.451894}},
  volume       = {{30}},
  year         = {{2022}},
}

@inproceedings{34233,
  author       = {{Singh, Karanveer and Kress, Christian and Mandalawi, Younus and Misra, Arijit and Preussler, Stefan and Scheytt, J. Christoph and Schneider, Thomas}},
  booktitle    = {{Next-Generation Optical Communication: Components, Sub-Systems, and Systems XI}},
  editor       = {{Li, Guifang and Nakajima, Kazuhide}},
  publisher    = {{SPIE}},
  title        = {{{Analysis of the effect of jitter and non-idealities on photonic digital-to-analog converters based on Nyquist pulses}}},
  doi          = {{10.1117/12.2609501}},
  year         = {{2022}},
}

@inproceedings{34234,
  author       = {{Singh, Karanveer and Meier, Janosch and Kress, Christian and Misra, Arijit and Schwabe, Tobias and Preussler, Stefan and Scheytt, J. Christoph and Schneider, Thomas}},
  booktitle    = {{Next-Generation Optical Communication: Components, Sub-Systems, and Systems XI}},
  editor       = {{Li, Guifang and Nakajima, Kazuhide}},
  publisher    = {{SPIE}},
  title        = {{{Emulation of integrated high-bandwidth photonic AWG using low-speed electronics}}},
  doi          = {{10.1117/12.2609416}},
  year         = {{2022}},
}

@article{34235,
  abstract     = {{<jats:p>We demonstrate for the first time, to the best of our knowledge, reconfigurable and real-time orthogonal time-domain detection of a high-bandwidth Nyquist signal with a low-bandwidth silicon photonics Mach-Zehnder modulator based receiver. As the Nyquist signal has a rectangular bandwidth, it can be multiplexed in the wavelength domain without any guardband as a part of a Nyquist-WDM superchannel. These superchannels can be additionally multiplexed in space and polarization. Thus, the presented demonstration can open a new possibility for the detection of multidimensional parallel data signals with silicon photonics. No external pulse source is needed for the receiver, and frequency-time coherence is used to sample the incoming Nyquist signal with orthogonal sinc-shaped Nyquist pulse sequences. All parameters are completely tunable in the electrical domain. The feasibility of the scheme is demonstrated through a proof-of-concept experiment over the entire C-band (1530 nm–1560 nm), employing a 24 Gbaud Nyquist QPSK signal due to experimental constraints on the transmitter side electronics. However, the silicon Mach-Zehnder modulator with a 3-dB bandwidth of only 16 GHz can process Nyquist signals of 90 GHz optical bandwidth, suggesting a possibility to detect symbol rates up to 90 GBd in an integrated Nyquist receiver.</jats:p>}},
  author       = {{Misra, Arijit and Kress, Christian and Singh, Karanveer and Meier, Janosch and Schwabe, Tobias and Preussler, Stefan and Scheytt, J. Christoph and Schneider, Thomas}},
  issn         = {{1094-4087}},
  journal      = {{Optics Express}},
  number       = {{8}},
  publisher    = {{Optica Publishing Group}},
  title        = {{{Reconfigurable and real-time high-bandwidth Nyquist signal detection with low-bandwidth in silicon photonics}}},
  doi          = {{10.1364/oe.454163}},
  volume       = {{30}},
  year         = {{2022}},
}

@inproceedings{34236,
  abstract     = {{<jats:p>We report for the first time, inter-symbol-interference (ISI) free demultiplexing of Nyquist optical time division multiplexed (OTDM) signals using a reconfigurable orthogonal sinc-pulse sampling enabled by silicon photonic Mach-Zehnder Modulators.</jats:p>}},
  author       = {{Misra, Arijit and Singh, Karanveer and Meier, Janosch and Kress, Christian and Schwabe, Tobias and Preussler, Stefan and Scheytt, J. Christoph and Schneider, Thomas}},
  booktitle    = {{Conference on Lasers and Electro-Optics}},
  publisher    = {{Optica Publishing Group}},
  title        = {{{Flexible Time-Domain De-Multiplexing of Nyquist OTDM Channels by Orthogonal Sampling in Silicon Photonics}}},
  doi          = {{10.1364/cleo_si.2022.sth5m.2}},
  year         = {{2022}},
}

@article{60369,
  abstract     = {{<jats:title>Abstract</jats:title><jats:p>Non‐linear optimization is essential to many areas of geometry processing research. However, when experimenting with different problem formulations or when prototyping new algorithms, a major practical obstacle is the need to figure out derivatives of objective functions, especially when second‐order derivatives are required. Deriving and manually implementing gradients and Hessians is both time‐consuming and error‐prone. Automatic differentiation techniques address this problem, but can introduce a diverse set of obstacles themselves, e.g. limiting the set of supported language features, imposing restrictions on a program's control flow, incurring a significant run time overhead, or making it hard to exploit sparsity patterns common in geometry processing. We show that for many geometric problems, in particular on meshes, the simplest form of forward‐mode automatic differentiation is not only the most flexible, but also actually the most efficient choice. We introduce TinyAD: a lightweight C++ library that automatically computes gradients and Hessians, in particular of sparse problems, by differentiating small (tiny) sub‐problems. Its simplicity enables easy integration; no restrictions on, e.g., looping and branching are imposed. TinyAD provides the basic ingredients to quickly implement first and second order Newton‐style solvers, allowing for flexible adjustment of both problem formulations and solver details. By showcasing compact implementations of methods from parametrization, deformation, and direction field design, we demonstrate how TinyAD lowers the barrier to exploring non‐linear optimization techniques. This enables not only fast prototyping of new research ideas, but also improves replicability of existing algorithms in geometry processing. TinyAD is available to the community as an open source library.</jats:p>}},
  author       = {{Schmidt, Patrick and Born, Janis and Bommes, David and Campen, Marcel and Kobbelt, Leif}},
  issn         = {{0167-7055}},
  journal      = {{Computer Graphics Forum}},
  number       = {{5}},
  pages        = {{113--124}},
  publisher    = {{Wiley}},
  title        = {{{TinyAD: Automatic Differentiation in Geometry Processing Made Simple}}},
  doi          = {{10.1111/cgf.14607}},
  volume       = {{41}},
  year         = {{2022}},
}

@article{60371,
  abstract     = {{<jats:p>We describe a method for the generation of seamless surface parametrizations with guaranteed local injectivity and full control over holonomy. Previous methods guarantee only one of the two. Local injectivity is required to enable these parametrizations' use in applications such as surface quadrangulation and spline construction. Holonomy control is crucial to enable guidance or prescription of the parametrization's isocurves based on directional information, in particular from cross-fields or feature curves, and more generally to constrain the parametrization topologically. To this end we investigate the relation between cross-field topology and seamless parametrization topology. Leveraging previous results on locally injective parametrization and combining them with insights on this relation in terms of holonomy, we propose an algorithm that meets these requirements. A key component relies on the insight that arbitrary surface cut graphs, as required for global parametrization, can be homeomorphically modified to assume almost any set of turning numbers with respect to a given target cross-field.</jats:p>}},
  author       = {{Shen, Hanxiao and Zhu, Leyi and Capouellez, Ryan and Panozzo, Daniele and Campen, Marcel and Zorin, Denis}},
  issn         = {{0730-0301}},
  journal      = {{ACM Transactions on Graphics}},
  number       = {{4}},
  pages        = {{1--12}},
  publisher    = {{Association for Computing Machinery (ACM)}},
  title        = {{{Which cross fields can be quadrangulated?}}},
  doi          = {{10.1145/3528223.3530187}},
  volume       = {{41}},
  year         = {{2022}},
}

@article{60366,
  abstract     = {{<jats:title>Abstract</jats:title><jats:p>The so‐called motorcycle graph has been employed in recent years for various purposes in the context of structured and aligned block decomposition of 2D shapes and 2‐manifold surfaces. Applications are in the fields of surface parametrization, spline space construction, semi‐structured quad mesh generation, or geometry data compression. We describe a generalization of this motorcycle graph concept to the three‐dimensional volumetric setting. Through careful extensions aware of topological intricacies of this higher‐dimensional setting, we are able to guarantee important block decomposition properties also in this case. We describe algorithms for the construction of this 3D motorcycle complex on the basis of either hexahedral meshes or seamless volumetric parametrizations. Its utility is illustrated on examples in hexahedral mesh generation and volumetric T‐spline construction.</jats:p>}},
  author       = {{Brückler, Hendrik and Gupta, Ojaswi and Mandad, Manish and Campen, Marcel}},
  issn         = {{0167-7055}},
  journal      = {{Computer Graphics Forum}},
  number       = {{2}},
  pages        = {{221--235}},
  publisher    = {{Wiley}},
  title        = {{{The 3D Motorcycle Complex for Structured Volume Decomposition}}},
  doi          = {{10.1111/cgf.14470}},
  volume       = {{41}},
  year         = {{2022}},
}

@article{60368,
  abstract     = {{<jats:title>Abstract</jats:title><jats:p>We present a reliable method to generate planar meshes of nonlinear rational triangular elements. The elements are guaranteed to be valid, i.e. defined by injective rational functions. The mesh is guaranteed to conform exactly, without geometric error, to arbitrary rational domain boundary and feature curves. The method generalizes the recent Bézier Guarding technique, which is applicable only to polynomial curves and elements. This generalization enables the accurate handling of practically important cases involving, for instance, circular or elliptic arcs and NURBS curves, which cannot be matched by polynomial elements. Furthermore, although many practical scenarios are concerned with rational functions of quadratic and cubic degree only, our method is fully general and supports arbitrary degree. We demonstrate the method on a variety of test cases.</jats:p>}},
  author       = {{Khanteimouri, Payam and Mandad, Manish and Campen, Marcel}},
  issn         = {{0167-7055}},
  journal      = {{Computer Graphics Forum}},
  number       = {{5}},
  pages        = {{89--99}},
  publisher    = {{Wiley}},
  title        = {{{Rational Bézier Guarding}}},
  doi          = {{10.1111/cgf.14605}},
  volume       = {{41}},
  year         = {{2022}},
}

@article{60363,
  author       = {{Mandad, Manish and Chen, Ruizhi and Bommes, David and Campen, Marcel}},
  issn         = {{0167-8396}},
  journal      = {{Computer Aided Geometric Design}},
  publisher    = {{Elsevier BV}},
  title        = {{{Intrinsic mixed-integer polycubes for hexahedral meshing}}},
  doi          = {{10.1016/j.cagd.2022.102078}},
  volume       = {{94}},
  year         = {{2022}},
}

@article{60365,
  author       = {{Hinderink, Steffen and Mandad, Manish and Campen, Marcel}},
  issn         = {{0167-8396}},
  journal      = {{Computer Aided Geometric Design}},
  publisher    = {{Elsevier BV}},
  title        = {{{Angle-bounded 2D mesh simplification}}},
  doi          = {{10.1016/j.cagd.2022.102085}},
  volume       = {{95}},
  year         = {{2022}},
}

@article{60372,
  abstract     = {{<jats:p>Developments in the field of parametrization-based quad mesh generation on surfaces have been impactful over the past decade. In this context, an important advance has been the replacement of error-prone rounding in the generation of integer-grid maps, by robust quantization methods. In parallel, parametrization-based hex mesh generation for volumes has been advanced. In this volumetric context, however, the state-of-the-art still relies on fragile rounding, not rarely producing defective meshes, especially when targeting a coarse mesh resolution. We present a method to robustly quantize volume parametrizations, i.e., to determine guaranteed valid choices of integers for 3D integer-grid maps. Inspired by the 2D case, we base our construction on a non-conforming cell decomposition of the volume, a 3D analogue of a T-mesh. In particular, we leverage the motorcycle complex, a recent generalization of the motorcycle graph, for this purpose. Integer values are expressed in a differential manner on the edges of this complex, enabling the efficient formulation of the conditions required to strictly prevent forcing the map into degeneration. Applying our method in the context of hexahedral meshing, we demonstrate that hexahedral meshes can be generated with significantly improved flexibility.</jats:p>}},
  author       = {{Brückler, Hendrik and Bommes, David and Campen, Marcel}},
  issn         = {{0730-0301}},
  journal      = {{ACM Transactions on Graphics}},
  number       = {{4}},
  pages        = {{1--19}},
  publisher    = {{Association for Computing Machinery (ACM)}},
  title        = {{{Volume parametrization quantization for hexahedral meshing}}},
  doi          = {{10.1145/3528223.3530123}},
  volume       = {{41}},
  year         = {{2022}},
}

@article{60334,
  abstract     = {{<jats:p>In this article, we provide a detailed survey of techniques for hexahedral mesh generation. We cover the whole spectrum of alternative approaches to mesh generation, as well as post-processing algorithms for connectivity editing and mesh optimization. For each technique, we highlight capabilities and limitations, also pointing out the associated unsolved challenges. Recent relaxed approaches, aiming to generate not pure-hex but hex-dominant meshes, are also discussed. The required background, pertaining to geometrical as well as combinatorial aspects, is introduced along the way.</jats:p>}},
  author       = {{Pietroni, Nico and Campen, Marcel and Sheffer, Alla and Cherchi, Gianmarco and Bommes, David and Gao, Xifeng and Scateni, Riccardo and Ledoux, Franck and Remacle, Jean and Livesu, Marco}},
  issn         = {{0730-0301}},
  journal      = {{ACM Transactions on Graphics}},
  number       = {{2}},
  pages        = {{1--44}},
  publisher    = {{Association for Computing Machinery (ACM)}},
  title        = {{{Hex-Mesh Generation and Processing: A Survey}}},
  doi          = {{10.1145/3554920}},
  volume       = {{42}},
  year         = {{2022}},
}