@inproceedings{35427, author = {{Pauck, Felix}}, booktitle = {{37th IEEE/ACM International Conference on Automated Software Engineering}}, publisher = {{ACM}}, title = {{{Scaling Arbitrary Android App Analyses}}}, doi = {{10.1145/3551349.3561339}}, year = {{2023}}, } @article{38280, author = {{Noé, Reinhold}}, journal = {{Journal of Lightwave Technology}}, number = {{1}}, pages = {{137--148}}, title = {{{Consistent Optical and Electrical Noise Figure}}}, doi = {{10.1109/JLT.2022.3212936}}, volume = {{41}}, year = {{2023}}, } @misc{40440, author = {{Pilot, Matthias}}, title = {{{Updatable Privacy-Preserving Reputation System based on Blockchain}}}, year = {{2023}}, } @inbook{40511, author = {{Hüsing, Sven and Schulte, Carsten and Winkelnkemper, Felix}}, booktitle = {{Computer Science Education}}, isbn = {{9781350296916}}, publisher = {{Bloomsbury Academic}}, title = {{{Epistemic Programming}}}, doi = {{10.5040/9781350296947.ch-022}}, year = {{2023}}, } @article{33947, author = {{Castenow, Jannik and Harbig, Jonas and Jung, Daniel and Knollmann, Till and Meyer auf der Heide, Friedhelm}}, issn = {{0304-3975}}, journal = {{Theoretical Computer Science}}, keywords = {{General Computer Science, Theoretical Computer Science}}, pages = {{261--291}}, publisher = {{Elsevier BV}}, title = {{{Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation}}}, doi = {{10.1016/j.tcs.2022.10.031}}, volume = {{939}}, year = {{2023}}, } @book{41369, author = {{Böcker, Joachim}}, publisher = {{Paderborn University}}, title = {{{Mechatronik und elektrische Antriebe / Mechatronics and electrical drives}}}, doi = {{10.17619/UNIPB/1-1640}}, year = {{2023}}, } @inproceedings{41813, author = {{Shivarpatna Venkatesh, Ashwin Prasad and Wang, Jiawei and Li, Li and Bodden, Eric}}, booktitle = {{IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER)}}, title = {{{Enhancing Comprehension and Navigation in Jupyter Notebooks with Static Analysis}}}, year = {{2023}}, } @article{34402, author = {{Yigitbas, Enes and Klauke, Jonas and Gottschalk, Sebastian and Engels, Gregor}}, journal = {{Journal on Computer Languages (COLA) }}, publisher = {{Elsevier}}, title = {{{End-User Development of Interactive Web-Based Virtual Reality Scenes}}}, year = {{2023}}, } @inproceedings{33511, author = {{Yigitbas, Enes and Engels, Gregor}}, booktitle = {{56th Hawaii International Conference on System Science (HICSS 2023) }}, publisher = {{ScholarSpace}}, title = {{{Enhancing Robot Programming through Digital Twin and Augmented Reality }}}, year = {{2023}}, } @inproceedings{34401, author = {{Yigitbas, Enes and Krois, Sebastian and Gottschalk, Sebastian and Engels, Gregor}}, booktitle = {{Proceedings of the 7th International Conference on Human Computer Interaction Theory and Applications (HUCAPP'23) }}, title = {{{Towards Enhanced Guiding Mechanisms in VR Training through Process Mining}}}, year = {{2023}}, } @inproceedings{34008, author = {{Castenow, Jannik and Harbig, Jonas and Jung, Daniel and Kling, Peter and Knollmann, Till and Meyer auf der Heide, Friedhelm}}, booktitle = {{Proceedings of the 26th International Conference on Principles of Distributed Systems (OPODIS) }}, editor = {{Hillel, Eshcar and Palmieri, Roberto and Riviére, Etienne}}, isbn = {{978-3-95977-265-5}}, issn = {{1868-8969}}, location = {{Brussels}}, pages = {{15:1–15:25}}, publisher = {{Schloss Dagstuhl – Leibniz Zentrum für Informatik}}, title = {{{A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots with Limited Visibility }}}, doi = {{10.4230/LIPIcs.OPODIS.2022.15}}, volume = {{253}}, year = {{2023}}, } @unpublished{42160, abstract = {{The goal of this paper is to make a strong point for the usage of dynamical models when using reinforcement learning (RL) for feedback control of dynamical systems governed by partial differential equations (PDEs). To breach the gap between the immense promises we see in RL and the applicability in complex engineering systems, the main challenges are the massive requirements in terms of the training data, as well as the lack of performance guarantees. We present a solution for the first issue using a data-driven surrogate model in the form of a convolutional LSTM with actuation. We demonstrate that learning an actuated model in parallel to training the RL agent significantly reduces the total amount of required data sampled from the real system. Furthermore, we show that iteratively updating the model is of major importance to avoid biases in the RL training. Detailed ablation studies reveal the most important ingredients of the modeling process. We use the chaotic Kuramoto-Sivashinsky equation do demonstarte our findings.}}, author = {{Werner, Stefan and Peitz, Sebastian}}, booktitle = {{arXiv:2302.07160}}, title = {{{Learning a model is paramount for sample efficiency in reinforcement learning control of PDEs}}}, year = {{2023}}, } @article{34814, author = {{Hanusch, Maximilian}}, issn = {{0008-414X}}, journal = {{Canadian Journal of Mathematics}}, keywords = {{extension of differentiable maps}}, number = {{1}}, pages = {{170--201}}, publisher = {{Canadian Mathematical Society}}, title = {{{A $C^k$-seeley-extension-theorem for Bastiani’s differential calculus}}}, doi = {{10.4153/s0008414x21000596}}, volume = {{75}}, year = {{2023}}, } @inproceedings{31872, abstract = {{Savitch's theorem states that NPSPACE computations can be simulated in PSPACE. We initiate the study of a quantum analogue of NPSPACE, denoted Streaming-QCMASPACE (SQCMASPACE), where an exponentially long classical proof is streamed to a poly-space quantum verifier. Besides two main results, we also show that a quantum analogue of Savitch's theorem is unlikely to hold, as SQCMASPACE=NEXP. For completeness, we introduce Streaming-QMASPACE (SQMASPACE) with an exponentially long streamed quantum proof, and show SQMASPACE=QMA_EXP (quantum analogue of NEXP). Our first main result shows, in contrast to the classical setting, the solution space of a quantum constraint satisfaction problem (i.e. a local Hamiltonian) is always connected when exponentially long proofs are permitted. For this, we show how to simulate any Lipschitz continuous path on the unit hypersphere via a sequence of local unitary gates, at the expense of blowing up the circuit size. This shows quantum error-correcting codes can be unable to detect one codeword erroneously evolving to another if the evolution happens sufficiently slowly, and answers an open question of [Gharibian, Sikora, ICALP 2015] regarding the Ground State Connectivity problem. Our second main result is that any SQCMASPACE computation can be embedded into "unentanglement", i.e. into a quantum constraint satisfaction problem with unentangled provers. Formally, we show how to embed SQCMASPACE into the Sparse Separable Hamiltonian problem of [Chailloux, Sattath, CCC 2012] (QMA(2)-complete for 1/poly promise gap), at the expense of scaling the promise gap with the streamed proof size. As a corollary, we obtain the first systematic construction for obtaining QMA(2)-type upper bounds on arbitrary multi-prover interactive proof systems, where the QMA(2) promise gap scales exponentially with the number of bits of communication in the interactive proof.}}, author = {{Gharibian, Sevag and Rudolph, Dorian}}, booktitle = {{14th Innovations in Theoretical Computer Science (ITCS)}}, pages = {{53:1--53:23}}, title = {{{Quantum space, ground space traversal, and how to embed multi-prover interactive proofs into unentanglement}}}, doi = {{10.4230/LIPIcs.ITCS.2023.53}}, volume = {{251}}, year = {{2023}}, } @article{27426, abstract = {{Regularization is used in many different areas of optimization when solutions are sought which not only minimize a given function, but also possess a certain degree of regularity. Popular applications are image denoising, sparse regression and machine learning. Since the choice of the regularization parameter is crucial but often difficult, path-following methods are used to approximate the entire regularization path, i.e., the set of all possible solutions for all regularization parameters. Due to their nature, the development of these methods requires structural results about the regularization path. The goal of this article is to derive these results for the case of a smooth objective function which is penalized by a piecewise differentiable regularization term. We do this by treating regularization as a multiobjective optimization problem. Our results suggest that even in this general case, the regularization path is piecewise smooth. Moreover, our theory allows for a classification of the nonsmooth features that occur in between smooth parts. This is demonstrated in two applications, namely support-vector machines and exact penalty methods.}}, author = {{Gebken, Bennet and Bieker, Katharina and Peitz, Sebastian}}, journal = {{Journal of Global Optimization}}, number = {{3}}, pages = {{709--741}}, title = {{{On the structure of regularization paths for piecewise differentiable regularization terms}}}, doi = {{10.1007/s10898-022-01223-2}}, volume = {{85}}, year = {{2023}}, } @article{43018, author = {{Alhaddad, Samer and Förstner, Jens and Grynko, Yevgen}}, issn = {{0022-4073}}, journal = {{Journal of Quantitative Spectroscopy and Radiative Transfer}}, keywords = {{tet_topic_scattering}}, publisher = {{Elsevier BV}}, title = {{{Numerical study of light backscattering from layers of absorbing irregular particles larger than the wavelength}}}, doi = {{10.1016/j.jqsrt.2023.108557}}, volume = {{302}}, year = {{2023}}, } @inproceedings{31849, author = {{Hoffmann, Max and Biehler, Rolf}}, booktitle = {{Proceedings of the Fourth Conference of the International Network for Didactic Research in University Mathematics (INDRUM 2022, 19-22 October 2022)}}, editor = {{Trigueros, Marı́a and Barquero, Berta and Hochmuth, Reinhard and Peters, Jana}}, keywords = {{Teaching and learning of specific topics in university mathematics, Transition to, across and from university mathematics, Student Teachers, Geometry, Congruence, Double Discontinuity.}}, publisher = {{University of Hannover and INDRUM.}}, title = {{{Student Teachers ’ Knowledge of Congruence before a University Course on Geometry}}}, year = {{2023}}, } @inproceedings{43097, author = {{Florensa, Ignasio and Hoffmann, Max and Romo Vázquez, Avenilde and Zandieh, Michelle and Martínez-Planell, Rafael}}, booktitle = {{Proceedings of the Fourth Conference of the International Network for Didactic Research in University Mathematics (INDRUM 2022, 19-22 October 2022)}}, editor = {{Trigueros, Marı́a and Barquero, Berta and Hochmuth, Reinhard and Peters, Jana}}, title = {{{Innovations in university teaching based on mathematic education research}}}, year = {{2023}}, } @article{43109, author = {{Götte, Thorsten and Kolb, Christina and Scheideler, Christian and Werthmann, Julian}}, journal = {{Theor. Comput. Sci.}}, pages = {{113756}}, title = {{{Beep-and-Sleep: Message and Energy Efficient Set Cover}}}, doi = {{10.1016/j.tcs.2023.113756}}, volume = {{950}}, year = {{2023}}, } @inproceedings{43424, author = {{Yigitbas, Enes and Nowosad, Alexander and Engels, Gregor}}, booktitle = {{Proceedings of the 19th IFIP TC13 International Conference on Human-Computer Interaction (INTERACT 2023)}}, publisher = {{Springer}}, title = {{{Supporting Construction and Architectural Visualization through BIM and AR/VR: A Systematic Literature Review}}}, year = {{2023}}, }