@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}}, } @article{31059, abstract = {{In this article we prove meromorphic continuation of weighted zeta functions in the framework of open hyperbolic systems by using the meromorphically continued restricted resolvent of Dyatlov and Guillarmou (2016). We obtain a residue formula proving equality between residues of weighted zetas and invariant Ruelle distributions. We combine this equality with results of Guillarmou, Hilgert and Weich (2021) in order to relate the residues to Patterson-Sullivan distributions. Finally we provide proof-of-principle results concerning the numerical calculation of invariant Ruelle distributions for 3-disc scattering systems.}}, author = {{Schütte, Philipp and Weich, Tobias and Barkhofen, Sonja}}, journal = {{Communications in Mathematical Physics}}, pages = {{655--678}}, title = {{{Meromorphic Continuation of Weighted Zeta Functions on Open Hyperbolic Systems}}}, doi = {{ttps://doi.org/10.1007/s00220-022-04538-z}}, volume = {{398}}, 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}}, } @unpublished{51207, abstract = {{Let $X=X_1\times X_2$ be a product of two rank one symmetric spaces of non-compact type and $\Gamma$ a torsion-free discrete subgroup in $G_1\times G_2$. We show that the spectrum of $\Gamma \backslash X$ is related to the asymptotic growth of $\Gamma$ in the two direction defined by the two factors. We obtain that $L^2(\Gamma \backslash G)$ is tempered for large class of $\Gamma$.}}, author = {{Weich, Tobias and Wolf, Lasse Lennart}}, booktitle = {{arXiv:2304.09573}}, title = {{{Temperedness of locally symmetric spaces: The product case}}}, 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}}, } @unpublished{51375, abstract = {{We consider the quantum dynamics of a many-fermion system in $\mathbb R^d$ with an ultraviolet regularized pair interaction as previously studied in [M. Gebert, B. Nachtergaele, J. Reschke, and R. Sims, Ann. Henri Poincar\'e 21.11 (2020)]. We provide a Lieb-Robinson bound under substantially relaxed assumptions on the potentials. We also improve the associated one-body Lieb-Robinson bound on $L^2$-overlaps to an almost ballistic one (i.e., an almost linear light cone) under the same relaxed assumptions. Applications include the existence of the infinite-volume dynamics and clustering of ground states in the presence of a spectral gap. We also develop a fermionic continuum notion of conditional expectation and use it to approximate time-evolved fermionic observables by local ones, which opens the door to other applications of the Lieb-Robinson bounds.}}, author = {{Hinrichs, Benjamin and Lemm, Marius and Siebert, Oliver}}, booktitle = {{arXiv:2310.17736}}, title = {{{On Lieb-Robinson bounds for a class of continuum fermions}}}, year = {{2023}}, } @unpublished{51376, abstract = {{In the Bogoliubov-Fr\"ohlich model, we prove that an impurity immersed in a Bose-Einstein condensate forms a stable quasi-particle when the total momentum is less than its mass times the speed of sound. The system thus exhibits superfluid behavior, as this quasi-particle does not experience friction. We do not assume any infrared or ultraviolet regularization of the model, which contains massless excitations and point-like interactions.}}, author = {{Hinrichs, Benjamin and Lampart, Jonas}}, booktitle = {{arXiv:2311.05361}}, title = {{{A Lower Bound on the Critical Momentum of an Impurity in a Bose-Einstein Condensate}}}, year = {{2023}}, } @article{31190, abstract = {{For a compact Riemannian locally symmetric space $\Gamma\backslash G/K$ of arbitrary rank we determine the location of certain Ruelle-Taylor resonances for the Weyl chamber action. We provide a Weyl-lower bound on an appropriate counting function for the Ruelle-Taylor resonances and establish a spectral gap which is uniform in $\Gamma$ if $G/K$ is irreducible of higher rank. This is achieved by proving a quantum-classical correspondence, i.e. a 1:1-correspondence between horocyclically invariant Ruelle-Taylor resonant states and joint eigenfunctions of the algebra of invariant differential operators on $G/K$.}}, author = {{Hilgert, Joachim and Weich, Tobias and Wolf, Lasse Lennart}}, journal = {{Analysis & PDE}}, number = {{10}}, pages = {{2241–2265}}, publisher = {{MSP}}, title = {{{Higher rank quantum-classical correspondence}}}, volume = {{16}}, year = {{2023}}, } @unpublished{51205, abstract = {{We compare the spectral properties of two kinds of linear operators characterizing the (classical) geodesic flow and its quantization on connected locally finite graphs without dead ends. The first kind are transfer operators acting on vector spaces associated with the set of non backtracking paths in the graphs. The second kind of operators are averaging operators acting on vector spaces associated with the space of vertices of the graph. The choice of vector spaces reflects regularity properties. Our main results are correspondences between classical and quantum spectral objects as well as some automatic regularity properties for eigenfunctions of transfer operators.}}, author = {{Bux, Kai-Uwe and Hilgert, Joachim and Weich, Tobias}}, booktitle = {{arXiv:2307.10876}}, title = {{{Spectral correspondences for finite graphs without dead ends}}}, 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}}, } @article{51383, author = {{Hilgert, Joachim and Arends, C.}}, journal = {{J. de l'École polytechnique — Mathématiques}}, pages = {{335--403}}, title = {{{Spectral correspondences for rank one locally symmetric spaces - The case of exceptional parameters}}}, volume = {{10}}, year = {{2023}}, } @article{51384, author = {{Hilgert, Joachim and Glöckner, H.}}, journal = {{J. Diff. Equations}}, pages = {{186--232}}, title = {{{Aspects of control theory on infinite-dimensional Lie groups and G-manifolds}}}, volume = {{343}}, year = {{2023}}, } @unpublished{51499, author = {{Hilgert, Joachim and Arends, C. and Frahm, J.}}, title = {{{A pairing formula for resonant states on finite regular graphs}}}, year = {{2023}}, } @unpublished{51500, author = {{Hilgert, Joachim and Arends, C. and Frahm, J.}}, title = {{{Edge Laplacians and vector valued Poisson transforms for graphs}}}, year = {{2023}}, } @unpublished{51502, author = {{Hilgert, Joachim and Baier, T. and Kaya, O. and Mourao, J. and Nunes, J.}}, title = {{{Quantization in fibering polarizations, Mabuchi rays and geometric Peter--Weyl theorem}}}, year = {{2023}}, } @unpublished{51521, author = {{Hilgert, Joachim and Guedes Bonthonneau, Y. and Guillarmou, C. and Weich, Tobias}}, title = {{{Ruelle-Taylor resonances of Anosov actions}}}, year = {{2023}}, } @unpublished{32447, abstract = {{We present a new gradient-like dynamical system related to unconstrained convex smooth multiobjective optimization which involves inertial effects and asymptotic vanishing damping. To the best of our knowledge, this system is the first inertial gradient-like system for multiobjective optimization problems including asymptotic vanishing damping, expanding the ideas laid out in [H. Attouch and G. Garrigos, Multiobjective optimization: an inertial approach to Pareto optima, preprint, arXiv:1506.02823, 201]. We prove existence of solutions to this system in finite dimensions and further prove that its bounded solutions converge weakly to weakly Pareto optimal points. In addition, we obtain a convergence rate of order O(t−2) for the function values measured with a merit function. This approach presents a good basis for the development of fast gradient methods for multiobjective optimization.}}, author = {{Sonntag, Konstantin and Peitz, Sebastian}}, booktitle = {{arXiv:2307.00975}}, title = {{{Fast Convergence of Inertial Multiobjective Gradient-like Systems with Asymptotic Vanishing Damping}}}, 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}}, } @inproceedings{44146, abstract = {{Many Android applications collect data from users. When they do, they must protect this collected data according to the current legal frameworks. Such data protection has become even more important since the European Union rolled out the General Data Protection Regulation (GDPR). App developers have limited tool support to reason about data protection throughout their app development process. Although many Android applications state a privacy policy, privacy policy compliance checks are currently manual, expensive, and prone to error. One of the major challenges in privacy audits is the significant gap between legal privacy statements (in English text) and technical measures that Android apps use to protect their user's privacy. In this thesis, we will explore to what extent we can use static analysis to answer important questions regarding data protection. Our main goal is to design a tool based approach that aids app developers and auditors in ensuring data protection in Android applications, based on automated static program analysis.}}, author = {{Khedkar, Mugdha}}, booktitle = {{Proceedings of the 45th International Conference on Software Engineering: Companion Proceedings (ICSE ‘23)}}, keywords = {{static analysis, data protection and privacy, GDPR compliance}}, title = {{{Static Analysis for Android GDPR Compliance Assurance}}}, doi = {{10.1109/ICSE-Companion58688.2023.00054}}, year = {{2023}}, } @misc{52317, author = {{Beckendorf, Björn}}, title = {{{Self-Stabilizing Skip-Graph with Growth-bounded Metric}}}, year = {{2023}}, } @article{46248, author = {{Demir, Caglar and Wiebesiek, Michel and Lu, Renzhong and Ngonga Ngomo, Axel-Cyrille and Heindorf, Stefan}}, journal = {{ECML PKDD}}, location = {{Torino}}, title = {{{LitCQD: Multi-Hop Reasoning in Incomplete Knowledge Graphs with Numeric Literals}}}, year = {{2023}}, } @inproceedings{52369, abstract = {{Megatrends, such as digitization or sustainability, are confronting the product management of manufacturing companies with a variety of challenges regarding the design of future products, but also the management of the actual products. To successfully position their products in the market, product managers need to gather and analyze comprehensive information about customers, developments in the products’ environment, product usage, and more. The digitization of all aspects of life is making data on these topics increasingly available – via social media, documents, or the internet of things from the products themselves. The systematic collection and analysis of these data enable the exploitation of new potentials for the adaption of existing products and the creation of the products of tomorrow. However, there are still no insights into the main concepts and cause-effect relationships in exploiting data-driven approaches for product management. Therefore, this paper aims to identify the main concepts and advantages of data-driven product management. To answer the corresponding research questions a comprehensive systematic literature review is conducted. From its results, a detailed description of the main concepts of data-driven product management is derived. Furthermore, a taxonomy for the advantages of data-driven product management is presented. The main concepts and the taxonomy allow for a deeper understanding of the topic while highlighting necessary future actions and research needs.}}, author = {{Fichtler, Timm and Grigoryan, Khoren and Koldewey, Christian and Dumitrescu, Roman}}, booktitle = {{2023 IEEE International Conference on Technology Management, Operations and Decisions (ICTMOD)}}, keywords = {{Product Lifecyle Management (PLM), Data Analytics, Data-driven Design, Engineering Management, Lifecycle Data}}, location = {{Rabat, Morocco}}, publisher = {{IEEE}}, title = {{{Towards a Data-Driven Product Management – Concepts, Advantages, and Future Research}}}, doi = {{10.1109/ictmod59086.2023.10438135}}, year = {{2023}}, } @inproceedings{52370, author = {{Vernholz, Mats}}, booktitle = {{Living and Leading in the Next Era: Connecting Teaching, Research, Citizenship and Equity}}, editor = {{Perla, Loredana and Agrati, Laura Sara and Vinci, Viviana and Scarinci, Alessia}}, isbn = {{9791255681038}}, location = {{Bari}}, publisher = {{Pensa Multimedia}}, title = {{{Academic self-concepts of pre-service technology teachers for vocational education in Germany according to the TPACK- Model}}}, year = {{2023}}, } @misc{47540, author = {{Knorr, Lukas and Schlosser, Florian and Meschede, Henning}}, title = {{{Economic Integration of a High-Temperature Heat Pump with Flexible Part-load Operation}}}, year = {{2023}}, } @misc{52480, author = {{Klassen, Alexander}}, title = {{{Fast Partial Reconfiguration for ReconOS64 on Xilinx MPSoC Devices}}}, year = {{2023}}, } @inproceedings{52530, author = {{Prager, Raphael Patrick and Trautmann, Heike}}, booktitle = {{Companion Proceedings of the Conference on Genetic and Evolutionary Computation, GECCO 2023, Companion Volume, Lisbon, Portugal, July 15-19, 2023}}, editor = {{Silva, Sara and Paquete, Luís}}, pages = {{451–454}}, publisher = {{ACM}}, title = {{{Investigating the Viability of Existing Exploratory Landscape Analysis Features for Mixed-Integer Problems}}}, doi = {{10.1145/3583133.3590757}}, year = {{2023}}, } @inproceedings{48898, abstract = {{Automated Algorithm Configuration (AAC) usually takes a global perspective: it identifies a parameter configuration for an (optimization) algorithm that maximizes a performance metric over a set of instances. However, the optimal choice of parameters strongly depends on the instance at hand and should thus be calculated on a per-instance basis. We explore the potential of Per-Instance Algorithm Configuration (PIAC) by using Reinforcement Learning (RL). To this end, we propose a novel PIAC approach that is based on deep neural networks. We apply it to predict configurations for the Lin\textendash Kernighan heuristic (LKH) for the Traveling Salesperson Problem (TSP) individually for every single instance. To train our PIAC approach, we create a large set of 100000 TSP instances with 2000 nodes each \textemdash currently the largest benchmark set to the best of our knowledge. We compare our approach to the state-of-the-art AAC method Sequential Model-based Algorithm Configuration (SMAC). The results show that our PIAC approach outperforms this baseline on both the newly created instance set and established instance sets.}}, author = {{Seiler, Moritz Vinzent and Rook, Jeroen and Heins, Jonathan and Preuß, Oliver Ludger and Bossek, Jakob and Trautmann, Heike}}, booktitle = {{2023 IEEE Symposium Series on Computational Intelligence (SSCI)}}, pages = {{361 -- 368}}, title = {{{Using Reinforcement Learning for Per-Instance Algorithm Configuration on the TSP}}}, doi = {{10.1109/SSCI52147.2023.10372008}}, year = {{2023}}, } @inbook{52662, abstract = {{Static analysis tools support developers in detecting potential coding issues, such as bugs or vulnerabilities. Research emphasizes technical challenges of such tools but also mentions severe usability shortcomings. These shortcomings hinder the adoption of static analysis tools, and user dissatisfaction may even lead to tool abandonment. To comprehensively assess the state of the art, we present the first systematic usability evaluation of a wide range of static analysis tools. We derived a set of 36 relevant criteria from the literature and used them to evaluate a total of 46 static analysis tools complying with our inclusion and exclusion criteria - a representative set of mainly non-proprietary tools. The evaluation against the usability criteria in a multiple-raters approach shows that two thirds of the considered tools off er poor warning messages, while about three-quarters provide hardly any fix support. Furthermore, the integration of user knowledge is strongly neglected, which could be used for instance, to improve handling of false positives. Finally, issues regarding workflow integration and specialized user interfaces are revealed. These findings should prove useful in guiding and focusing further research and development in user experience for static code analyses.}}, author = {{Nachtigall, Marcus and Schlichtig, Michael and Bodden, Eric}}, booktitle = {{Software Engineering 2023}}, isbn = {{978-3-88579-726-5}}, keywords = {{Automated static analysis, Software usability}}, pages = {{95–96}}, publisher = {{Gesellschaft für Informatik e.V.}}, title = {{{Evaluation of Usability Criteria Addressed by Static Analysis Tools on a Large Scale}}}, year = {{2023}}, } @inbook{52660, abstract = {{Application Programming Interfaces (APIs) are the primary mechanism developers use to obtain access to third-party algorithms and services. Unfortunately, APIs can be misused, which can have catastrophic consequences, especially if the APIs provide security-critical functionalities like cryptography. Understanding what API misuses are, and how they are caused, is important to prevent them, eg, with API misuse detectors. However, definitions for API misuses and related terms in literature vary. This paper presents a systematic literature review to clarify these terms and introduces FUM, a novel Framework for API Usage constraint and Misuse classification. The literature review revealed that API misuses are violations of API usage constraints. To address this, we provide unified definitions and use them to derive FUM. To assess the extent to which FUM aids in determining and guiding the improvement of an API misuses detector’s capabilities, we performed a case study on the state-of the-art misuse detection tool CogniCrypt. The study showed that FUM can be used to properly assess CogniCrypt’s capabilities, identify weaknesses and assist in deriving mitigations and improvements.}}, author = {{Schlichtig, Michael and Sassalla, Steffen and Narasimhan, Krishna and Bodden, Eric}}, booktitle = {{Software Engineering 2023}}, isbn = {{978-3-88579-726-5}}, keywords = {{API misuses API usage constraints, classification framework, API misuse detection, static analysis}}, pages = {{105–106}}, publisher = {{Gesellschaft für Informatik e.V.}}, title = {{{Introducing FUM: A Framework for API Usage Constraint and Misuse Classification}}}, year = {{2023}}, } @article{34803, author = {{Celledoni, Elena and Glöckner, Helge and Riseth, Jørgen and Schmeding, Alexander}}, journal = {{BIT Numerical Mathematics}}, publisher = {{Springer}}, title = {{{Deep neural networks on diffeomorphism groups for optimal shape reparametrization}}}, doi = {{10.1007/s10543-023-00989-05}}, volume = {{63}}, year = {{2023}}, } @article{34793, author = {{Glöckner, Helge and Hilgert, Joachim}}, issn = {{0022-0396}}, journal = {{Journal of Differential Equations}}, keywords = {{22E65, 28B05, 34A12, 34H05, 46E30, 46E40}}, pages = {{186–232}}, title = {{{Aspects of control theory on infinite-dimensional Lie groups and G-manifolds}}}, doi = {{10.1016/j.jde.2022.10.001}}, volume = {{343}}, year = {{2023}}, } @article{34805, abstract = {{Let $E$ be a finite-dimensional real vector space and $M\subseteq E$ be a convex polytope with non-empty interior. We turn the group of all $C^\infty$-diffeomorphisms of $M$ into a regular Lie group.}}, author = {{Glöckner, Helge}}, journal = {{Journal of Convex Analysis}}, number = {{1}}, pages = {{343--358}}, publisher = {{Heldermann}}, title = {{{Diffeomorphism groups of convex polytopes}}}, volume = {{30}}, year = {{2023}}, } @article{34801, author = {{Glöckner, Helge and Tárrega, Luis}}, journal = {{Journal of Lie Theory}}, number = {{1}}, pages = {{271--296}}, publisher = {{Heldermann}}, title = {{{Mapping groups associated with real-valued function spaces and direct limits of Sobolev-Lie groups }}}, volume = {{33}}, year = {{2023}}, } @article{46264, abstract = {{System-level interconnects provide the backbone for increasingly complex systems on a chip. Their vulnerability to electromigration and crosstalk can lead to serious reliability and safety issues during the system lifetime. This article presents an approach for periodic in-system testing which maintains a reliability profile to detect potential problems before they actually cause a failure. Relying on a common infrastructure for EM-aware system workload management and test, it minimizes the stress induced by the test itself and contributes to the self-healing of system-induced electromigration degradations. }}, author = {{Sadeghi-Kohan, Somayeh and Hellebrand, Sybille and Wunderlich, Hans-Joachim}}, issn = {{2168-2356}}, journal = {{IEEE Design &Test}}, keywords = {{Electrical and Electronic Engineering, Hardware and Architecture, Software}}, pages = {{1--1}}, publisher = {{Institute of Electrical and Electronics Engineers (IEEE)}}, title = {{{Workload-Aware Periodic Interconnect BIST}}}, doi = {{10.1109/mdat.2023.3298849}}, year = {{2023}}, } @inproceedings{45830, author = {{Jafarzadeh, Hanieh and Klemme, Florian and Reimer, Jan Dennis and Najafi Haghi, Zahra Paria and Amrouch, Hussam and Hellebrand, Sybille and Wunderlich, Hans-Joachim}}, booktitle = {{IEEE International Test Conference (ITC'23), Anaheim, USA, October 2023}}, location = {{Anaheim, USA}}, publisher = {{IEEE}}, title = {{{Robust Pattern Generation for Small Delay Faults under Process Variations}}}, year = {{2023}}, } @book{45191, editor = {{Gräßler, Iris and Maier, Günter W. and Steffen, Eckhard and Roesmann, Daniel}}, isbn = {{9783031261039}}, publisher = {{Springer International Publishing}}, title = {{{The Digital Twin of Humans}}}, doi = {{10.1007/978-3-031-26104-6}}, year = {{2023}}, } @article{52806, author = {{Gilbert, H. and Schürmann, M. and Liebendörfer, M. and Lawson, D. and Hodds, M.}}, issn = {{0020-739X}}, journal = {{International Journal of Mathematical Education in Science and Technology}}, keywords = {{Applied Mathematics, Education, Mathematics (miscellaneous)}}, pages = {{1--26}}, publisher = {{Informa UK Limited}}, title = {{{Post-pandemic online mathematics and statistics support: Practitioners’ opinions in Germany and Great Britain & Ireland}}}, doi = {{10.1080/0020739x.2023.2184282}}, year = {{2023}}, } @inbook{52811, author = {{Biehler, Rolf and Guntermann, Dominik and Liebendörfer, Michael and Krämer, Sandra and Schlüter, Sarah}}, booktitle = {{Beiträge zum Mathematikunterricht 2022. 56. Jahrestagung der Gesellschaft für Didaktik der Mathematik}}, editor = {{Goethe-Universität Frankfur, IDMI-Primar}}, isbn = {{978-3-95987-208-9}}, pages = {{407–410}}, publisher = {{WTM}}, title = {{{Fachdidaktisches Design von Begründungsvideos im Projekt studiVEMINTvideos}}}, doi = {{10.37626/GA9783959872089.0}}, volume = {{1}}, year = {{2023}}, } @inbook{52810, author = {{Göller, Robin and Gildehaus, Lara and Liebendörfer, Michael and Besser, Michael}}, booktitle = {{Hanse-Kolloquium zur Hochschuldidaktik der Mathematik 2021. Beiträge zum gleichnamigen Online-Symposium am 12 November 2021 aus Bochum}}, editor = {{Härterich, Jörg and Kallweit, Michael and Rolka, Katrin and Skill, Thomas}}, isbn = {{978-3-95987-264-5}}, pages = {{66–80}}, publisher = {{WTM}}, title = {{{Erfassung und Vergleich (mathematischer) Eingangsvoraussetzungen angehender Studierender verschiedener mathematikhaltiger Studiengänge}}}, year = {{2023}}, } @inbook{52809, author = {{Kempen, Leander and Liebendörfer, Michael}}, booktitle = {{Hanse-Kolloquium zur Hochschuldidaktik der Mathematik 2021. Beiträge zum gleichnamigen Online-Symposium am 12 November 2021 aus Bochum}}, editor = {{Härterich, Jörg and Kallweit, Michael and Rolka, Katrin and Skill, Thomas}}, isbn = {{978-3-95987-264-5}}, pages = {{91–106}}, publisher = {{WTM}}, title = {{{Zu digital - zu viel - zu schwer? Qualitative Einsichten in das Erleben und Handeln von Erstsemester-Studierenden der Mathematik während der Corona-Pandemie}}}, year = {{2023}}, } @inbook{52813, author = {{Schlüter, Sarah and Liebendörfer, Michael}}, booktitle = {{Beiträge zum Mathematikunterricht 2022. 56. Jahrestagung der Gesellschaft für Didaktik der Mathematik}}, editor = {{Goethe-Universität Frankfur, IDMI-Primar}}, isbn = {{978-3-95987-208-9}}, pages = {{1177–1180}}, publisher = {{WTM}}, title = {{{Bearbeitungsmuster von Studierenden im Umgang mit formalen Definitionen im Kontext konstanter Folgen}}}, doi = {{10.37626/GA9783959872089.0}}, volume = {{2}}, year = {{2023}}, } @inbook{52812, author = {{Krämer, Sandra and Liebendörfer, Michael}}, booktitle = {{Beiträge zum Mathematikunterricht 2022. 56. Jahrestagung der Gesellschaft für Didaktik der Mathematik}}, editor = {{Goethe-Universität Frankfur, IDMI-Primar}}, isbn = {{978-3-95987-208-9}}, pages = {{949–952}}, publisher = {{WTM}}, title = {{{Förderung prozeduraler Flexibilität durch Lernvideos mit interaktiven Aufgaben}}}, doi = {{10.37626/GA9783959872089.0}}, volume = {{2}}, year = {{2023}}, } @article{52807, abstract = {{Many preservice mathematics teachers lose their motivation during their first year at university. This phenomenon has been repeatedly described in recent years but is not yet fully under­stood. Since motivation may relate to different objects such as mathematics or teaching, we aim to qualitatively reconstruct different facets of the central motivational constructs of Situated-Expectancy-Value theory (intrinsic value, attainment value, utility value, cost, and expectancy of success) for preservice mathematics teachers. The analysis of longitudinal group interviews of 14 pre­service higher-secondary mathematic teachers from a German university revealed different objects of motivation (e.g., teaching mathematics, scientific mathematics, procedural mathematics, or proof-based mathematics) in preservice teachers' values and expectancy of success. Furthermore, relations between those values and expectancy of success were identified that played a significant role in preservice teachers’ motivational development over their first semester (e.g., relations of attain­ment value for scientific mathematics and psychological cost). Theoretical and practical implications towards a teaching-specific conceptualization of expectancy of success and values and value interventions are being discussed.}}, title = {{{Preservice teachers’ mathematics-related values and expectancy in the transition from school to university}}}, doi = {{10.48489/QUADRANTE.31191}}, year = {{2023}}, } @inbook{52859, author = {{de Camargo e Souza Câmara, Igor and Turhan, Anni-Yasmin}}, booktitle = {{Logics in Artificial Intelligence}}, isbn = {{9783031436185}}, issn = {{0302-9743}}, publisher = {{Springer Nature Switzerland}}, title = {{{Deciding Subsumption in Defeasible $$\mathcal {ELI}_\bot $$ with Typicality Models}}}, doi = {{10.1007/978-3-031-43619-2_36}}, year = {{2023}}, } @article{52861, author = {{Gil, Oliver Fernández and Patrizi, Fabio and Perelli, Giuseppe and Turhan, Anni-Yasmin}}, journal = {{CoRR}}, title = {{{Optimal Alignment of Temporal Knowledge Bases}}}, doi = {{10.48550/ARXIV.2307.15439}}, volume = {{abs/2307.15439}}, year = {{2023}}, }