@misc{BetzBinkowskiFischbachetal.2025, author = {Betz, Fridtjof and Binkowski, Felix and Fischbach, Jan David and Feldman, Nick and Zschiedrich, Lin and Rockstuhl, Carsten and Koenderink, A. Femius and Burger, Sven}, title = {Uncovering Hidden Resonances in Non-Hermitian Systems with Scattering Thresholds (Laser Photonics Rev. 19(21)/2025)}, volume = {19}, journal = {Laser Photonics Rev.}, number = {21}, doi = {10.1002/lpor.70534}, pages = {e70534}, year = {2025}, language = {en} } @misc{HaslerAmrheinKlindtetal.2017, author = {Hasler, Tim and Amrhein, Kilian and Klindt, Marco and Oltmanns, Elias and Peters-Kottig, Wolfgang}, title = {Backup ist KEINE Langzeitverf{\"u}gbarkeit}, doi = {10.12752/9954}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-99548}, year = {2017}, abstract = {Diese Handreichung im Flyerformat soll mit den verschiedenen Missverst{\"a}ndnissen aufr{\"a}umen, die einem im Alltag begegnen, wenn man es mit digitaler Langzeitverf{\"u}gbarkeit zu tun hat.}, language = {de} } @misc{RocheBetzYangetal.2024, author = {Roche, L{\´e}o J. and Betz, Fridtjof and Yang, Yuhui and Limame, Imad and Shih, Ching-Wen and Burger, Sven and Reitzenstein, Stephan}, title = {Inside Front Cover: Numerical Investigation of a Coupled Micropillar - Waveguide System for Integrated Quantum Photonic Circuits (Adv. Quantum Technol. 12/2024)}, volume = {7}, journal = {Adv. Quantum Technol.}, doi = {10.1002/qute.202470036}, pages = {2470036}, year = {2024}, language = {en} } @misc{VuKochXu2024, author = {Vu, Thi Huong and Koch, Thorsten and Xu, Hong-Kun}, title = {The gradient projection method: Is the Polyak adaptive stepsize rule optimal?}, year = {2024}, abstract = {Not always! This is our answer to the question of whether the Polyak adaptive stepsize rule in the gradient projection method is optimal. The answer is based on revisiting the subgradient projection method by Polyak [USSR Computational Mathematics and Mathematical Physics 9 (1969)] for smooth and convex minimization problems where the objective function possesses a geometric property called flatness. Our results show that the method can be more flexible (the effective range for the parameter controlling the stepsize can be wider) and have sharper convergence rates. Applications to split feasibility/equality problems are presented, deriving for the first time the O(1/k) rate of convergence for the adaptive CQ method. A theoretical guarantee of the linear convergence of the gradient descent method with adaptive stepsizes for Google PageRank is provided. At the same time, numerical experiments are designed to spot the ``optimal" stepsize and to compare with other basic gradient methods.}, language = {en} } @misc{BetzHammerschmidtZschiedrichetal.2024, author = {Betz, Fridtjof and Hammerschmidt, Martin and Zschiedrich, Lin and Burger, Sven and Binkowski, Felix}, title = {Efficient Rational Approximation of Optical Response Functions with the AAA Algorithm (Laser Photonics Rev. 18(11)/2024)}, volume = {18}, journal = {Laser Photonics Rev.}, doi = {10.1002/lpor.202470071}, pages = {2470071}, year = {2024}, language = {en} } @misc{LoebelBorndoerferWeider2024, author = {L{\"o}bel, Fabian and Bornd{\"o}rfer, Ralf and Weider, Steffen}, title = {Electric Bus Scheduling with Non-Linear Charging, Power Grid Bottlenecks, and Dynamic Recharge Rates}, arxiv = {http://arxiv.org/abs/2407.14446}, year = {2024}, abstract = {Public transport operators are gradually electrifying their bus fleets, predominantly with battery-powered drive trains. These buses commonly have to be scheduled to recharge in-service, which gives rise to a number of challenges. A major problem is that the relationship between charging time and replenished driving range is non-linear, which is often approximately modeled. We examine the associated approximation error and show how it can result in a gross over- or underestimation of the fleet size. Moreover, we demonstrate that commonly used piecewise linear underestimations of the charge curve do not result in an underestimation of the predicted charge states in electric vehicle scheduling and routing models. Furthermore, since power grid upgrades are currently not keeping up with an ever growing electricity demand, operators are introducing active charge management tools to dynamically adjust the charging speed depending on the amount of available energy. It is therefore imperative to extend electric bus scheduling models to account for these developments. We propose a novel mixed-integer programming formulation for the electric bus scheduling problem featuring an improved approximation of the non-linear battery charging behavior as well as dynamic recharge speeds to accommodate grid load limits. The idea is to linearly interpolate what we call the charge increment function, which is closely related to the derivative of the commonly used charge curve. This provides very good error control and integrates easily into integer programming models. We demonstrate the practical usefulness of our model on a diverse library of real-life instances.}, language = {en} } @misc{Winkler2024, author = {Winkler, Alexander}, title = {URIs im GLAM-Bereich - was sie sind und wie man sie verwendet}, journal = {ZENODO}, doi = {10.5281/zenodo.11608433}, pages = {7}, year = {2024}, abstract = {Das Papier gibt Hinweise zu URIs (Uniform Resource Identifiers) im GLAM-Sektor.}, language = {de} } @misc{VanaretLeyffer2026, author = {Vanaret, Charlie and Leyffer, Sven}, title = {Implementing a unified solver for nonlinearly constrained optimization}, arxiv = {http://arxiv.org/abs/2406.13454}, year = {2026}, abstract = {SQP and interior-point methods (also referred to as Lagrange-Newton methods) typically share key algorithmic components, such as strategies for computing descent directions and mechanisms that promote global convergence. Building on this insight, we introduce a unifying framework with eight building blocks that abstracts the workflows of Lagrange-Newton methods. We then present Uno, a modular C++ solver that implements our unifying framework and allows the automatic combination of a wide range of strategies with no programming effort from the user. Uno is meant to (1) organize mathematical optimization strategies into a coherent hierarchy; (2) offer a wide range of efficient and robust methods that can be compared for a given instance; (3) enable researchers to experiment with novel optimization strategies; and (4) reduce the cost of development and maintenance of multiple optimization solvers. Uno's software design allows user to compose new customized solvers for emerging optimization areas such as robust optimization or optimization problems with complementarity constraints, while building on reliable nonlinear optimization techniques. We demonstrate that Uno is highly competitive against state-of-the-art solvers filterSQP, IPOPT, SNOPT, MINOS, LANCELOT, LOQO, and CONOPT on a subset of 429 small problems from the CUTE collection. Uno is available as open-source software under the MIT license at this https URL and via its C, Julia, Python, Fortran, and AMPL interfaces.}, language = {en} } @misc{BoppPlockTuranetal.2024, author = {Bopp, Julian M. and Plock, Matthias and Turan, Tim and Pieplow, Gregor and Burger, Sven and Schr{\"o}der, Tim}, title = {'Sawfish' Photonic Crystal Cavity for Near-Unity Emitter-to-Fiber Interfacing in Quantum Network Applications (Advanced Optical Materials 13/2024)}, volume = {12}, journal = {Adv. Optical Mater.}, doi = {10.1002/adom.202470046}, pages = {2470046}, year = {2024}, language = {en} } @misc{CaoAndersonBoehmeetal.2023, author = {Cao, Karl-Kien and Anderson, Lovis and B{\"o}hme, Aileen and Breuer, Thomas and Buschmann, Jan and Fiand, Frederick and Frey, Ulrich and Fuchs, Benjamin and Kempe, Nils-Christian and von Krbek, Kai and Medjroubi, Wided and Riehm, Judith and Sasanpour, Shima and Simon, Sonja and Vanaret, Charlie and Wetzel, Manuel and Xiao, Mengzhu and Zittel, Janina}, title = {Evaluation of Uncertainties in Linear-Optimizing Energy System Models - Compendium}, journal = {DLR-Forschungsbericht}, number = {DLR-FB-2023-15}, doi = {10.57676/w2rq-bj85}, pages = {95}, year = {2023}, abstract = {F{\"u}r die Energiesystemforschung sind Software-Modelle ein Kernelement zur Analyse von Szenarien. Das Forschungsprojekt UNSEEN hatte das Ziel eine bisher unerreichte Anzahl an modellbasierten Energieszenarien zu berechnen, um Unsicherheiten - vor allem unter Nutzung linear optimierender Energiesystem-Modelle - besser bewerten zu k{\"o}nnen. Hierf{\"u}r wurden umfangreiche Parametervariationen auf Energieszenarien angewendet und das wesentliche methodische Hindernis in diesem Zusammenhang adressiert: die rechnerische Beherrschbarkeit der zu l{\"o}senden mathematischen Optimierungsprobleme. Im Vorl{\"a}uferprojekt BEAM-ME wurde mit der Entwicklung und Anwendung des Open-Source-L{\"o}sers PIPS-IPM++ die Grundlage f{\"u}r den Einsatz von High-Performance-Computing (HPC) zur L{\"o}sung dieser Modelle gelegt. In UNSEEN war dieser L{\"o}ser die zentrale Komponente eines Workflows, welcher zur Generierung, L{\"o}sung und multi-kriteriellen Bewertung von Energieszenarien auf dem Hochleistungscomputer JUWELS am Forschungszentrum J{\"u}lich implementiert wurde. Zur effizienten Generierung und Kommunikation von Modellinstanzen f{\"u}r Methoden der mathematischen Optimierung auf HPC wurde eine weitere Workflow-Komponente von der GAMS Software GmbH entwickelt: der Szenariogenerator. Bei der Weiterentwicklung von L{\"o}sungsalgorithmen f{\"u}r linear optimierende Energie-Systemmodelle standen gemischt-ganzzahlige Optimierungsprobleme im Fokus, welche f{\"u}r die Modellierung konkreter Infrastrukturen und Maßnahmen zur Umsetzung der Energiewende gel{\"o}st werden m{\"u}ssen. Die in diesem Zusammenhang stehenden Arbeiten zur Entwicklung von Algorithmen wurden von der Technischen Universit{\"a}t Berlin verantwortet. Bei Design und Implementierung dieser Methoden wurde sie vom Zuse Instituts Berlin unterst{\"u}tzt.}, language = {en} } @misc{SchlechteBlomeGerberetal.2023, author = {Schlechte, Thomas and Blome, Christian and Gerber, Stefan and Hauser, Stefan and Kasten, Jens and M{\"u}ller, Gilbert and Schulz, Christof and Th{\"u}ring, Michel and Weider, Steffen}, title = {The Bouquet of Features in Rolling Stock Rotation Planning}, journal = {Conference Proceedings RailBelgrade 2023}, year = {2023}, abstract = {Rolling stock is one of the major assets for a railway transportation company. Hence, their utilization should be as efficiently and effectively as possible. Railway undertakings are facing rolling stock scheduling challenges in different forms - from rather idealized weekly strategic problems to very concrete operational ones. Thus, a vast of optimization models with different features and objectives exist. Thorlacius et al. (2015) provides a comprehensive and valuable collection on technical requirements, models, and methods considered in the scientific literature. We contribute with an update including recent works. The main focus of the paper is to present a classification and elaboration of the major features which our solver R-OPT is able to handle. Moreover, the basic optimization model and algorithmic ingredients of R-OPT are discussed. Finally, we present computational results for a cargo application at SBB CARGO AG and other railway undertakings for passenger traffic in Europe to show the capabilities of R-OPT.}, language = {en} } @misc{HaslerPetersKottigSchloesser2023, author = {Hasler, Tim and Peters-Kottig, Wolfgang and Schl{\"o}sser, Franziska}, title = {Software Management Plan developed in HPO-Navi}, doi = {10.12752/9250}, year = {2023}, abstract = {This publication comprises the Software Management Plan (SMP) developed in the HPO-Navi project. The project was funded in the Literature and Information System (LIS) track of the DFG with the aim of increasing the maturity level of scientific software under development, developing improved measures for the quality assurance of this software and for long-term availability. The Ubiquity Generator Framework (UG) software developed in the project provides a software infrastructure to make existing sequential implementations HPC-capable. The UG framework is of interest to developers of specialized optimization algorithms and can be used directly to solve specific problem classes in the field of scientific computing. Due to the naturally high software technology hurdles on HPC systems, UG was initially a highly specialized tool and could only be used to a limited extent without the involvement of the main developer. The central challenge of the project was to create a mechanism for the sustainable development and permanent provision and archiving of the research software. The aim was for UG to achieve the status of a "software product" with implementation of the following project content: - Documentation of the software: a description of the API and the simple connection of further basic solvers, installation instructions for various target platforms and a description of the structure and documentation of the source code as a basis for the distributed sustainable development of UG. - Development of missing user functions of UG: increased platform independence for shared memory parallelization and better logging function for the analysis and verification of results. - Development of a sample data management plan for future research projects that want to use UG and document their research results according to DFG standards for good scientific practice. - Quality assurance: by defining code guidelines, uniform concepts and criteria for the qualitative evaluation of new functions and implementing standards for code review and processes for continuous integration. A complementary goal was to improve the provision, accessibility and long-term reusability of the research software. - Use of an open Git server as a distributed development platform, provision of a download server for releases and sustainable storage of the software code and the associated meta-information. - Improved presentation and visibility through publication in publicly accessible repositories. This includes the prototypical extension of the OPUS 4 repository software widely used in Germany as a means of publishing software with a landing page that can be resolved via a DOI, and improved linking and presentation of UG in swMATH. - Digital long-term archiving: experimental inclusion of software code in an OAIS-compliant digital archiving system and evaluation of the approach in the areas of digital archiving and research data management.}, language = {en} } @misc{ColomMikheevaAchourietal.2023, author = {Colom, R{\´e}mi and Mikheeva, Elena and Achouri, Karim and Zuniga-Perez, Jesus and Bonod, Nicolas and Martin, Olivier J.F. and Burger, Sven and Genevet, Patrice}, title = {Crossing of the Branch Cut: The Topological Origin of a Universal 2π-Phase Retardation in Non-Hermitian Metasurfaces (Laser Photonics Rev. 17(6)/2023)}, volume = {17}, journal = {Laser Photonics Rev.}, doi = {10.1002/lpor.202370029}, pages = {2370029}, year = {2023}, language = {en} } @misc{Klimpel2022, author = {Klimpel, Paul}, title = {In Bewegung. Die Rechtsfibel f{\"u}r Digitalisierungsprojekte in Kulturerbe-Einrichtungen}, editor = {Lehnert, Katrin and M{\"u}ller, Anja and Rauchut, Franziska and Salewski, Laura and Urgast, Steff}, edition = {1. Auflage}, organization = {iRights Law}, isbn = {978-3-00-074039-8}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-86485}, pages = {164}, year = {2022}, abstract = {Mitte 2021 bescherte die Urheberrechtsreform neue Chancen f{\"u}r den (offenen) Zugang zum kulturellen Erbe. Die Reform brachte wichtige Ver{\"a}nderungen der rechtlichen Rahmenbedingungen f{\"u}r die Digitalisierung des kulturellen Erbes mit sich. Der Schutz der Gemeinfreiheit f{\"u}r digitale Reproduktionen wurde festgeschrieben, neue Regelungen erm{\"o}glichen die Onlinestellung „nicht verf{\"u}gbarer Werke" durch {\"o}ffentliche Einrichtungen des Kulturerbes und erstmals k{\"o}nnen nun auch in Deutschland erweiterte kollektive Lizenzen umgesetzt werden. Dr. Paul Klimpel (iRights Law) hat die Neuerungen des Urheber*innenrechtsgesetzes (UrhG) in dieser Publikation in den urheberrechtlichen Gesamtkontext eingeordnet. Die Rechtsfibel soll als Orientierungshilfe f{\"u}r die Mitarbeiter*innen in den Kulturinstitutionen dienen. Herausgeber*innen sind das Digitale Deutsche Frauenarchiv (DDF) und das Forschungs- und Kompetenzzentrum Digitalisierung Berlin (digiS).}, subject = {4062127-3}, language = {de} } @misc{DresenKlindt2022, author = {Dresen, Christina and Klindt, Marco}, title = {Eine kleine Handreichung zur Digitalisierung von Audio- und Videomaterial}, editor = {digiS - Forschungs- und Kompetenzzentrum Digitalisierung Berlin,}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-86526}, pages = {41}, year = {2022}, abstract = {Die Handreichung soll Mitarbeiter:innen von kulturellen Einrichtungen bei der Digitalisierung von Audio- und Videomaterial unterst{\"u}tzten. Diese Einf{\"u}hrung richtet sich besonders an Personen, die nicht mit dem Thema vertraut sind. Nach einer Einf{\"u}hrung in die Geschichte von Ton- und Bildsignalen werden verschiedene Medientypen vorgestellt und der Umgang mit ihnen um eine Digitalisierung zu beginnen. Die Digitalisierung wird im Zusammenhang mit wichtigen Grundbegriffen und Parametern vorgestellt. Abgeschlossen wird die Handreichung durch Hinweise zur Qualit{\"a}tspr{\"u}fung und Archivierung.}, subject = {Digitalisierung}, language = {de} } @misc{KOBVHrsg2022, author = {KOBV (Hrsg.),}, title = {KOBV-Sondernewsletter zum 25-j{\"a}hrigen Jubil{\"a}um}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-86379}, year = {2022}, abstract = {Der Kooperative Bibliotheksverbund Berlin-Brandenburg wird heute 25 Jahre alt. Seit dem 1. April 1997 entwickelt der KOBV neue Dienstleistungen f{\"u}r Nutzende und Bibliotheken, baut Informationsinfrastrukturen in Berlin und Brandenburg aus, vernetzt Bibliotheken aus der Region und informiert {\"u}ber aktuelle Themen. Im Sondernewsletter geben uns aktuelle und ehemalige KOBV-Mitarbeitende/Mitglieder Antworten auf Fragen zur Entstehung und Weiterentwicklung des Verbundes. Lesen und feiern Sie mit uns zusammen!}, language = {de} } @misc{CharoussetBrignolvanAckooijOudjaneetal.2021, author = {Charousset-Brignol, Sandrine and van Ackooij, Wim and Oudjane, Nadia and Daniel, Dominique and Noceir, Slimane and Haus, Utz-Uwe and Lazzaro, Alfio and Frangioni, Antonio and Lobato, Rafael and Ghezelsoflu, Ali and Iardella, Niccol{\`o} and Galli, Laura and Gorgone, Enrico and dell'Amico, Mauro and Giannelos, Spyros and Moreira, Alex and Strbac, Goran and Borozan, Stefan and Falugi, Paula and Pudjianto, Danny and Wyrwoll, Lothar and Schmitt, Carlo and Franken, Marco and Beulertz, Daniel and Schwaeppe, Henrik and Most, Dieter and Y{\"u}ksel-Erg{\"u}n, Inci and Zittel, Janina and Koch, Thorsten}, title = {Synergistic approach of multi-energy models for a European optimal energy system management tool}, volume = {9}, journal = {The Project Repository Journal}, pages = {113 -- 116}, year = {2021}, language = {en} } @misc{MostLotharSchmittetal.2021, author = {Most, Dieter and Lothar, Wyrwoll and Schmitt, Carlo and Y{\"u}ksel-Erg{\"u}n, Inci}, title = {plan4res D2.2 - Case Study 1 Report - Multimodal energy concept for achieving Europe's carbon reduction goals}, doi = {10.5281/zenodo.5809338}, year = {2021}, language = {en} } @misc{Klimpel2021, author = {Klimpel, Paul}, title = {Urheberrechtsreform 2021. Neue Chancen f{\"u}r das kulturelle Erbe}, editor = {Lehnert, Katrin and M{\"u}ller, Anja}, edition = {1. Auflage}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-84315}, year = {2021}, abstract = {Im Juni 2021 fand die j{\"u}ngste Urheberrechtsreform statt. Sie bietet neue Chancen f{\"u}r das kulturelle Erbe, sei es in den Archiven und Bibliotheken sozialer Bewegungen, kleinen und großen Museen oder staatlichen Archiven und Bibliotheken. Denn die Novelle beinhaltet neue gesetzliche Erlaubnisse, die insbesondere die Online-Stellung von Archivmaterialien ("nicht verf{\"u}gbare Werke") und den Schutz der Gemeinfreiheit betreffen. Das vorliegende Bulletin geht komprimiert auf diese Neuerungen ein und erkl{\"a}rt, was sich in Zukunft {\"a}ndern wird. Darauf aufbauend wird Mitte 2022 eine ausf{\"u}hrliche und aktualisierte Publikation zur Rechtekl{\"a}rung erscheinen. Diese Vorver{\"o}ffentlichung soll erste dr{\"a}ngende Fragen kl{\"a}ren. Herausgeber:innen sind das Digitale Deutsche Frauenarchiv (DDF) und das Forschungs- und Kompetenzzentrum Digitalisierung Berlin (digiS), die bereits unabh{\"a}ngig voneinander Handreichungen zu rechtlichen Aspekten der Digitalisierung ver{\"o}ffentlichten.}, subject = {4062127-3}, language = {de} } @misc{BorndoerferTeschSagnol2019, author = {Bornd{\"o}rfer, Ralf and Tesch, Alexander and Sagnol, Guillaume}, title = {Algorithmen unterst{\"u}tzen OP-Planung}, journal = {Management \& Krankenhaus}, number = {12}, publisher = {Wiley}, pages = {20}, year = {2019}, abstract = {Mathematische Algorithmen k{\"o}nnen durch Vorhersage von Unsicherheiten optimierte OP-Pl{\"a}ne berechnen, sodass mehrere Zielkriterien wie {\"U}berstunden, Wartezeit und Ausf{\"a}lle im OP minimiert werden.}, language = {de} }