@article{50297, abstract = {{We show that there exist ordered orthogonal arrays, whose sizes deviate from the Rao bound by a factor that is polynomial in the parameters of the ordered orthogonal array. The proof is nonconstructive and based on a probabilistic method due to Kuperberg, Lovett and Peled.}}, author = {{Schmidt, Kai‐Uwe and Weiß, Charlene}}, journal = {{Journal of Combinatorial Designs}}, number = {{9}}, pages = {{422--431}}, publisher = {{Wiley}}, title = {{{Existence of small ordered orthogonal arrays}}}, doi = {{10.1002/jcd.21903}}, volume = {{31}}, year = {{2023}}, } @phdthesis{50300, abstract = {{Digital communications relies heavily on the usage of different types of codes. Prominent codes nowadays are rank-metric codes and subspace codes - the q-analogs of binary codes and binary codes with constant weight. All these codes can be viewed as subsets of classical association schemes. A central coding-theoretic problem is to derive upper bounds for the size of codes. This thesis investigates Delsartes powerful linear program whose optimum is precisely such a bound for codes in association schemes. The linear programs for binary codes and binary constant-weight codes have been extensively studied since the 1970s, but their optimum is still unknown. We determine in a unified way the optimum of the linear program in several ordinary q-analogs as well as in their affine counterparts. In particular, bounds and constructions for codes in polar spaces are established, where the bounds are sharp up to a constant factor in many cases. Moreover, based on these results, an almost complete classification of Steiner systems in polar spaces is provided by showing that they could only exist in some corner cases.}}, author = {{Weiß, Charlene}}, title = {{{Linear programming bounds in classical association schemes}}}, doi = {{10.17619/UNIPB/1-1672}}, year = {{2023}}, } @misc{48335, author = {{Knorr, Lukas and Jungeilges, André and Pfeifer, Florian and Burmeister, Sascha Christian and Meschede, Henning}}, publisher = {{4. Aachener Ofenbau- und Thermoprozess-Kolloquium}}, title = {{{Regenerative Energien für einen effizienten Betrieb von Presshärtelinien}}}, year = {{2023}}, } @article{50458, abstract = {{AbstractConsider a set of jobs connected to a directed acyclic task graph with a fixed source and sink. The edges of this graph model precedence constraints and the jobs have to be scheduled with respect to those. We introduce the server cloud scheduling problem, in which the jobs have to be processed either on a single local machine or on one of infinitely many cloud machines. For each job, processing times both on the server and in the cloud are given. Furthermore, for each edge in the task graph, a communication delay is included in the input and has to be taken into account if one of the two jobs is scheduled on the server and the other in the cloud. The server processes jobs sequentially, whereas the cloud can serve as many as needed in parallel, but induces costs. We consider both makespan and cost minimization. The main results are an FPTAS for the makespan objective for graphs with a constant source and sink dividing cut and strong hardness for the case with unit processing times and delays.}}, author = {{Maack, Marten and Meyer auf der Heide, Friedhelm and Pukrop, Simon}}, issn = {{0178-4617}}, journal = {{Algorithmica}}, keywords = {{Applied Mathematics, Computer Science Applications, General Computer Science}}, publisher = {{Springer Science and Business Media LLC}}, title = {{{Server Cloud Scheduling}}}, doi = {{10.1007/s00453-023-01189-x}}, year = {{2023}}, } @inproceedings{50460, author = {{Deppert, Max A. and Jansen, Klaus and Maack, Marten and Pukrop, Simon and Rau, Malin}}, booktitle = {{2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS)}}, publisher = {{IEEE}}, title = {{{Scheduling with Many Shared Resources}}}, doi = {{10.1109/ipdps54959.2023.00049}}, year = {{2023}}, } @inproceedings{50479, abstract = {{Verifying assertions is an essential part of creating and maintaining knowledge graphs. Most often, this task cannot be carried out manually due to the sheer size of modern knowledge graphs. Hence, automatic fact-checking approaches have been proposed over the last decade. These approaches aim to compute automatically whether a given assertion is correct or incorrect. However, most fact-checking approaches are binary classifiers that fail to consider the volatility of some assertions, i.e., the fact that such assertions are only valid at certain times or for specific time intervals. Moreover, the few approaches able to predict when an assertion was valid (i.e., time-point prediction approaches) rely on manual feature engineering. This paper presents TEMPORALFC, a temporal fact-checking approach that uses multiple sources of background knowledge to assess the veracity and temporal validity of a given assertion. We evaluate TEMPORALFC on two datasets and compare it to the state of the art in fact-checking and time-point prediction. Our results suggest that TEMPORALFC outperforms the state of the art on the fact-checking task by 0.13 to 0.15 in terms of Area Under the Receiver Operating Characteristic curve and on the time-point prediction task by 0.25 to 0.27 in terms of Mean Reciprocal Rank. Our code is open-source and can be found at https://github.com/dice-group/TemporalFC.}}, author = {{Qudus, Umair and Röder, Michael and Kirrane, Sabrina and Ngomo, Axel-Cyrille Ngonga}}, booktitle = {{The Semantic Web – ISWC 2023}}, editor = {{R. Payne, Terry and Presutti, Valentina and Qi, Guilin and Poveda-Villalón, María and Stoilos, Giorgos and Hollink, Laura and Kaoudi, Zoi and Cheng, Gong and Li, Juanzi}}, isbn = {{9783031472398}}, issn = {{0302-9743}}, keywords = {{temporal fact checking · ensemble learning · transfer learning · time-point prediction · temporal knowledge graphs}}, location = {{Athens, Greece}}, pages = {{465–483}}, publisher = {{Springer, Cham}}, title = {{{TemporalFC: A Temporal Fact Checking Approach over Knowledge Graphs}}}, doi = {{10.1007/978-3-031-47240-4_25}}, volume = {{14265}}, year = {{2023}}, } @unpublished{43439, abstract = {{This preprint makes the claim of having computed the $9^{th}$ Dedekind Number. This was done by building an efficient FPGA Accelerator for the core operation of the process, and parallelizing it on the Noctua 2 Supercluster at Paderborn University. The resulting value is 286386577668298411128469151667598498812366. This value can be verified in two steps. We have made the data file containing the 490M results available, each of which can be verified separately on CPU, and the whole file sums to our proposed value.}}, author = {{Van Hirtum, Lennart and De Causmaecker, Patrick and Goemaere, Jens and Kenter, Tobias and Riebler, Heinrich and Lass, Michael and Plessl, Christian}}, booktitle = {{arXiv:2304.03039}}, title = {{{A computation of D(9) using FPGA Supercomputing}}}, year = {{2023}}, } @inproceedings{51131, author = {{Graf, Lara Marie and Häsel-Weide, Uta and Höveler, K. and Nührenbörger, M.}}, booktitle = {{Proceedings of the Thirteenth Congress of the European Society for Research in Mathematics Education (CERME13)}}, editor = {{Drijvers, P. and Csapodi, C. and Palmér, H. and Gosztonyi, K. and Kónya, E.}}, pages = {{3203--3210}}, title = {{{Insights into out-of-field teachers’ self-reports: Fostering the understanding of addition and subtraction as a basis for children to overcome difficulties in mathematics}}}, year = {{2023}}, } @unpublished{51159, abstract = {{Sparsity is a highly desired feature in deep neural networks (DNNs) since it ensures numerical efficiency, improves the interpretability of models (due to the smaller number of relevant features), and robustness. In machine learning approaches based on linear models, it is well known that there exists a connecting path between the sparsest solution in terms of the $\ell^1$ norm,i.e., zero weights and the non-regularized solution, which is called the regularization path. Very recently, there was a first attempt to extend the concept of regularization paths to DNNs by means of treating the empirical loss and sparsity ($\ell^1$ norm) as two conflicting criteria and solving the resulting multiobjective optimization problem. However, due to the non-smoothness of the $\ell^1$ norm and the high number of parameters, this approach is not very efficient from a computational perspective. To overcome this limitation, we present an algorithm that allows for the approximation of the entire Pareto front for the above-mentioned objectives in a very efficient manner. We present numerical examples using both deterministic and stochastic gradients. We furthermore demonstrate that knowledge of the regularization path allows for a well-generalizing network parametrization.}}, author = {{Amakor, Augustina Chidinma and Sonntag, Konstantin and Peitz, Sebastian}}, booktitle = {{arXiv}}, title = {{{A multiobjective continuation method to compute the regularization path of deep neural networks}}}, year = {{2023}}, } @unpublished{51158, abstract = {{Extended Dynamic Mode Decomposition (EDMD) is a popular data-driven method to approximate the Koopman operator for deterministic and stochastic (control) systems. This operator is linear and encompasses full information on the (expected stochastic) dynamics. In this paper, we analyze a kernel-based EDMD algorithm, known as kEDMD, where the dictionary consists of the canonical kernel features at the data points. The latter are acquired by i.i.d. samples from a user-defined and application-driven distribution on a compact set. We prove bounds on the prediction error of the kEDMD estimator when sampling from this (not necessarily ergodic) distribution. The error analysis is further extended to control-affine systems, where the considered invariance of the Reproducing Kernel Hilbert Space is significantly less restrictive in comparison to invariance assumptions on an a-priori chosen dictionary.}}, author = {{Philipp, Friedrich and Schaller, Manuel and Worthmann, Karl and Peitz, Sebastian and Nüske, Feliks}}, booktitle = {{arXiv:2312.10460}}, title = {{{Error analysis of kernel EDMD for prediction and control in the Koopman framework}}}, year = {{2023}}, } @article{31189, abstract = {{Given a geometrically finite hyperbolic surface of infinite volume it is a classical result of Patterson that the positive Laplace-Beltrami operator has no $L^2$-eigenvalues $\geq 1/4$. In this article we prove a generalization of this result for the joint $L^2$-eigenvalues of the algebra of commuting differential operators on Riemannian locally symmetric spaces $\Gamma\backslash G/K$ of higher rank. We derive dynamical assumptions on the $\Gamma$-action on the geodesic and the Satake compactifications which imply the absence of the corresponding principal eigenvalues. A large class of examples fulfilling these assumptions are the non-compact quotients by Anosov subgroups.}}, author = {{Weich, Tobias and Wolf, Lasse Lennart}}, journal = {{Communications in Mathematical Physics}}, title = {{{Absence of principal eigenvalues for higher rank locally symmetric spaces}}}, doi = {{https://doi.org/10.1007/s00220-023-04819-1}}, volume = {{403}}, year = {{2023}}, } @inproceedings{47049, abstract = {{As technology advances, Unmanned Aerial Vehicles ( UAVs) have emerged as an innovative solution to a variety of problems in many fields. Automated control of UAVs is most common in large area operations, but they may also increase the versatility of smart home compositions by acting as a physical helper. For example, a voice- controlled UAV could act as an intelligent aerial assistant that can be seamlessly integrated into smart home systems. In this paper, we present a novel Augmented Reality (AR )-based UAV control that provides high-level control over a UAV by automating common UAV missions. In our work, we enable users to operate a small UAV hands-free using only a small set of voice commands. To help users identify the targets, and to understand the UAV ’s intentions, targets within the user’s field of vision are highlighted in an AR interface. We evaluate our approach in a user study (n=26) regarding usability, physical and mental demand, as well as a focus on the users’ preferences. Our study showed that the use of the proposed control was not only accepted, but some users stated that they would use such a system at home to help with some tasks at home }}, author = {{Helmert, Robin and Hardes, Tobias and Yigitbas, Enes}}, booktitle = {{Proceedings of the ACM Symposium on Spatial User Interaction (SUI 2023)}}, location = {{ Sydney, Australia }}, publisher = {{ACM}}, title = {{{Design and Evaluation of an AR Voice-based Indoor UAV Assistant for Smart Home Scenarios}}}, year = {{2023}}, } @unpublished{51206, abstract = {{We present a numerical algorithm for the computation of invariant Ruelle distributions on convex co-compact hyperbolic surfaces. This is achieved by exploiting the connection between invariant Ruelle distributions and residues of meromorphically continued weighted zeta functions established by the authors together with Barkhofen (2021). To make this applicable for numerics we express the weighted zeta as the logarithmic derivative of a suitable parameter dependent Fredholm determinant similar to Borthwick (2014). As an additional difficulty our transfer operator has to include a contracting direction which we account for with techniques developed by Rugh (1992). We achieve a further improvement in convergence speed for our algorithm in the case of surfaces with additional symmetries by proving and applying a symmetry reduction of weighted zeta functions.}}, author = {{Schütte, Philipp and Weich, Tobias}}, booktitle = {{arXiv:2308.13463}}, title = {{{Invariant Ruelle Distributions on Convex-Cocompact Hyperbolic Surfaces -- A Numerical Algorithm via Weighted Zeta Functions}}}, year = {{2023}}, } @article{51351, author = {{Steffen, Eckhard and Wolf, Isaak Hieronymus}}, issn = {{0166-218X}}, journal = {{Discrete Applied Mathematics}}, keywords = {{Applied Mathematics, Discrete Mathematics and Combinatorics}}, pages = {{185--189}}, publisher = {{Elsevier BV}}, title = {{{Bounds for the chromatic index of signed multigraphs}}}, doi = {{10.1016/j.dam.2023.05.008}}, volume = {{337}}, year = {{2023}}, } @phdthesis{51352, abstract = {{Erfolg und Misserfolg eines Unternehmens werden maßgeblich durch getroffene Entscheidungen beeinflusst. Daher verlassen sich Entscheider oft auf Entscheidungsunterstützungssysteme, die durch Datensimulation, -optimierung und -visualisierung bei der Identifizierung von geeigneten Entscheidungen unterstützen. Für eine optimale Unterstützung muss ein Entscheidungsunterstützungssystem (EUS) jedoch auf den Entscheidungsprozess eines Entscheiders abgestimmt sein und verfügbare Daten, Optimierungsziele, persönliche Präferenzen sowie weitere Einflussfaktoren berücksichtigen. EUS-Entwickler können aufgrund der Komplexität und Volatilität von Geschäftsumgebungen allerdings nicht alle potenziellen Entscheidungsprozesse während des Entwurfs eines EUS vorhersehen, wodurch ein EUS einem Entscheider häufig nur unzureichende Anpassungsmöglichkeiten an den individuellen Entscheidungsprozess bietet. Die Einzelanfertigung eines EUS, das auf einen Entscheidungsprozess zugeschnitten ist, ist ein kosten- und zeitintensives Unterfangen aufgrund der begrenzten Verfügbarkeit von Softwareentwicklern oder Missverständnissen zwischen Entwicklern und Entscheidern während der Entwicklung. Daher geben sich Entscheider möglicherweise mit einem handelsüblichen EUS zufrieden, das nicht vollständig mit ihrem Entscheidungsprozess übereinstimmt, suboptimale Entscheidungen begünstigt und so den Unternehmenserfolg negativ beeinflusst. In dieser Arbeit wird ein Ansatz vorgeschlagen, der es Entscheidern ermöglicht, selbst maßgeschneiderte Entscheidungsunterstützungssysteme zu entwickeln und so die Diskrepanz zwischen benötigter und tatsächlicher Entscheidungsunterstützung zu vermeiden. Dazu stellen EUS-Entwickler einen Teil der EUS-Funktionalität als wiederverwendbare Software-Dienste bereit ...}}, author = {{Kirchhoff, Jonas}}, publisher = {{Universität Paderborn}}, title = {{{Decision Support Ecosystems: Assisted Low-Code Development of Tailored Decision Support Systems}}}, doi = {{10.17619/UNIPB/1-1845}}, year = {{2023}}, } @inbook{45190, author = {{Cappello, Chiara and Steffen, Eckhard}}, booktitle = {{The Digital Twin of Humans}}, isbn = {{9783031261039}}, pages = {{93----110}}, publisher = {{Springer International Publishing}}, title = {{{Graph-Theoretical Models for the Analysis and Design of Socio-Technical Networks}}}, doi = {{10.1007/978-3-031-26104-6_5}}, year = {{2023}}, } @article{51357, author = {{Steffen, Eckhard and Wolf, Isaak Hieronymus}}, issn = {{0012-365X}}, journal = {{Discrete Mathematics}}, keywords = {{Discrete Mathematics and Combinatorics, Theoretical Computer Science}}, publisher = {{Elsevier BV}}, title = {{{Rotation r-graphs}}}, doi = {{10.1016/j.disc.2023.113457}}, year = {{2023}}, } @article{31210, abstract = {{In this paper we complete the program of relating the Laplace spectrum for rank one compact locally symmetric spaces with the first band Ruelle-Pollicott resonances of the geodesic flow on its sphere bundle. This program was started by Flaminio and Forni for hyperbolic surfaces, continued by Dyatlov, Faure and Guillarmou for real hyperbolic spaces and by Guillarmou, Hilgert and Weich for general rank one spaces. Except for the case of hyperbolic surfaces a countable set of exceptional spectral parameters always left untreated since the corresponding Poisson transforms are neither injective nor surjective. We use vector valued Poisson transforms to treat also the exceptional spectral parameters. For surfaces the exceptional spectral parameters lead to discrete series representations of $\mathrm{SL}(2,\mathbb R)$. In higher dimensions the situation is more complicated, but can be described completely.}}, author = {{Arends, Christian and Hilgert, Joachim}}, issn = {{2270-518X}}, journal = {{Journal de l’École polytechnique — Mathématiques}}, keywords = {{Ruelle resonances, Poisson transforms, locally symmetric spaces, principal series representations}}, pages = {{335--403}}, title = {{{Spectral correspondences for rank one locally symmetric spaces: the case of exceptional parameters}}}, doi = {{10.5802/jep.220}}, volume = {{10}}, year = {{2023}}, } @unpublished{46578, abstract = {{Multiobjective optimization plays an increasingly important role in modern applications, where several criteria are often of equal importance. The task in multiobjective optimization and multiobjective optimal control is therefore to compute the set of optimal compromises (the Pareto set) between the conflicting objectives. The advances in algorithms and the increasing interest in Pareto-optimal solutions have led to a wide range of new applications related to optimal and feedback control - potentially with non-smoothness both on the level of the objectives or in the system dynamics. This results in new challenges such as dealing with expensive models (e.g., governed by partial differential equations (PDEs)) and developing dedicated algorithms handling the non-smoothness. Since in contrast to single-objective optimization, the Pareto set generally consists of an infinite number of solutions, the computational effort can quickly become challenging, which is particularly problematic when the objectives are costly to evaluate or when a solution has to be presented very quickly. This article gives an overview of recent developments in the field of multiobjective optimization of non-smooth PDE-constrained problems. In particular we report on the advances achieved within Project 2 "Multiobjective Optimization of Non-Smooth PDE-Constrained Problems - Switches, State Constraints and Model Order Reduction" of the DFG Priority Programm 1962 "Non-smooth and Complementarity-based Distributed Parameter Systems: Simulation and Hierarchical Optimization".}}, author = {{Bernreuther, Marco and Dellnitz, Michael and Gebken, Bennet and Müller, Georg and Peitz, Sebastian and Sonntag, Konstantin and Volkwein, Stefan}}, booktitle = {{arXiv:2308.01113}}, title = {{{Multiobjective Optimization of Non-Smooth PDE-Constrained Problems}}}, year = {{2023}}, } @inproceedings{44849, author = {{Rautenberg, Frederik and Kuhlmann, Michael and Ebbers, Janek and Wiechmann, Jana and Seebauer, Fritz and Wagner, Petra and Haeb-Umbach, Reinhold}}, booktitle = {{Fortschritte der Akustik - DAGA 2023}}, location = {{Hamburg}}, pages = {{1409--1412}}, title = {{{Speech Disentanglement for Analysis and Modification of Acoustic and Perceptual Speaker Characteristics}}}, year = {{2023}}, }