@misc{50816, author = {{Hücker, Lars}}, title = {{{Stickstoff basierte Flammschutzmittel für das Lasersintern: Optimierung und Analyse der Recyclingfähigkeit (Studienarbeit)}}}, year = {{2024}}, } @misc{50815, author = {{Schulz, Maurice}}, title = {{{Phosphorhaltige Lasersinter-Materialien mit Flammschutzwirkung: Optimierung und Analyse der Recyclingfähigkeit (Studienarbeit)}}}, year = {{2024}}, } @inbook{50812, author = {{Degeling, Jasmin and Haffke, Maren}}, booktitle = {{digital:gender - de:mapping affect. Eine spekulative Kartographie}}, editor = {{Bee, Julia and Gradinari, Irina and Köppert , Katrin}}, publisher = {{Spector}}, title = {{{Sorgeprakiken der Online-Rechten – Jordan Petersons Therapeutik des ,Self-Authoring'}}}, year = {{2024}}, } @misc{51624, author = {{Staffel, Florian Lukas}}, booktitle = {{Sehepunkte}}, number = {{2}}, title = {{{Christian Marx: Wegbereiter der Globalisierung. Multinationale Unternehmen der westeuropäischen Chemieindustrie in der Zeit nach dem Boom (1960er-2000er Jahre) (= Nach dem Boom), Göttingen 2023.}}}, volume = {{24}}, year = {{2024}}, } @article{46019, abstract = {{We derive efficient algorithms to compute weakly Pareto optimal solutions for smooth, convex and unconstrained multiobjective optimization problems in general Hilbert spaces. To this end, we define a novel inertial gradient-like dynamical system in the multiobjective setting, which trajectories converge weakly to Pareto optimal solutions. Discretization of this system yields an inertial multiobjective algorithm which generates sequences that converge weakly to Pareto optimal solutions. We employ Nesterov acceleration to define an algorithm with an improved convergence rate compared to the plain multiobjective steepest descent method (Algorithm 1). A further improvement in terms of efficiency is achieved by avoiding the solution of a quadratic subproblem to compute a common step direction for all objective functions, which is usually required in first-order methods. Using a different discretization of our inertial gradient-like dynamical system, we obtain an accelerated multiobjective gradient method that does not require the solution of a subproblem in each step (Algorithm 2). While this algorithm does not converge in general, it yields good results on test problems while being faster than standard steepest descent.}}, author = {{Sonntag, Konstantin and Peitz, Sebastian}}, journal = {{Journal of Optimization Theory and Applications}}, publisher = {{Springer}}, title = {{{Fast Multiobjective Gradient Methods with Nesterov Acceleration via Inertial Gradient-Like Systems}}}, doi = {{10.1007/s10957-024-02389-3}}, year = {{2024}}, } @unpublished{51334, abstract = {{The efficient optimization method for locally Lipschitz continuous multiobjective optimization problems from [1] is extended from finite-dimensional problems to general Hilbert spaces. The method iteratively computes Pareto critical points, where in each iteration, an approximation of the subdifferential is computed in an efficient manner and then used to compute a common descent direction for all objective functions. To prove convergence, we present some new optimality results for nonsmooth multiobjective optimization problems in Hilbert spaces. Using these, we can show that every accumulation point of the sequence generated by our algorithm is Pareto critical under common assumptions. Computational efficiency for finding Pareto critical points is numerically demonstrated for multiobjective optimal control of an obstacle problem.}}, author = {{Sonntag, Konstantin and Gebken, Bennet and Müller, Georg and Peitz, Sebastian and Volkwein, Stefan}}, booktitle = {{arXiv:2402.06376}}, title = {{{A Descent Method for Nonsmooth Multiobjective Optimization in Hilbert Spaces}}}, year = {{2024}}, } @misc{51724, author = {{Bablitzka, Nico Janosch and Beimdiek, Janis}}, title = {{{Einfluss von Temperatur und Strömungsführung auf die NH3-SCO sowie die NH3-SCR mit Partikeln aus einer Sprayflammensynthese}}}, year = {{2024}}, } @unpublished{51731, abstract = {{Estimating the infection risks in indoor environments comprises the assessment of the behavior of virus-laden aerosols, i.e. spreading, mixing, removal by air purifiers etc. A promising experimental approach is based on using non-hazardous surrogate aerosols of similar size, e.g. salt particles, to mimic the virus aerosol behavior. This manuscript addresses the issue how a successful transfer of such experiments can be accomplished. Corresponding experiments in two very different environments, a large community hall and a seminar room, with optional use of air purifiers in various constellations were conducted. While high particle concentrations are advantageous in terms of avoiding influence of background aerosol concentrations, it is shown that appropriate consideration of aggregation and settling are vital to theoretically describe the experimentally determined course of particle concentrations. A corresponding model equation for a well-mixed situation is derived and the required parameters are thoroughly determined in separate experiments independently. It is demonstrated that clean air delivery rates (CADR) of air purifiers determined with this approach may differ substantially from common approaches not explicitly taking into account aggregation. }}, author = {{Beimdiek, Janis and Schmid, Hans-Joachim}}, booktitle = {{Atmosphere}}, keywords = {{surrogate aerosols, indoor air cleaners, ultra-fine particles, COVID-19, test method, field experiments: clean air delivery rate}}, publisher = {{MDPI}}, title = {{{Evaluation of Surrogate Aerosol Experiments to Predict Spreading and Removal of Virus-Laden Aerosols}}}, year = {{2024}}, } @phdthesis{51732, author = {{Richters, Maximilian}}, title = {{{Herstellung und Charakterisierung von Wood-Plastic-Composites (WPC) mit einer Matrix aus thermoplastischen Polyurethanen zur Erzeugung einer Holz-WPC-Verbundstruktur }}}, year = {{2024}}, } @article{51733, author = {{Schroeter-Wittke, Harald}}, journal = {{Praktische Theologie}}, number = {{1}}, pages = {{70--72}}, title = {{{Seven Psalms. Paul Simons theologische Kammermusik}}}, volume = {{59}}, year = {{2024}}, } @article{51737, author = {{Kullmer, Gunter and Weiß, Deborah and Schramm, Britta}}, issn = {{0013-7944}}, journal = {{Engineering Fracture Mechanics}}, keywords = {{Mechanical Engineering, Mechanics of Materials, General Materials Science}}, publisher = {{Elsevier BV}}, title = {{{An alternative and robust formulation of the fatigue crack growth rate curve for long cracks}}}, doi = {{10.1016/j.engfracmech.2023.109826}}, volume = {{296}}, year = {{2024}}, } @inbook{51114, author = {{Meyer zu Hörste-Bührer, Raphaela}}, booktitle = {{Ethik der Zeit - Zeiten der Ethik}}, editor = {{Meyer zu Hörste-Bührer, Raphaela J. and Zimmermann, Ruben and Erbele-Küster, Dorothea and Roth, Michael and Volp, Ulrich}}, pages = {{31--46}}, title = {{{Zeit für das Leben - Notwendigkeit und Probleme einer zeitsensiblen Ethik}}}, volume = {{14}}, year = {{2024}}, } @book{51113, editor = {{Meyer zu Hörste-Bührer, Raphaela J. and Zimmermann, Ruben and Erbele-Küster, Dorothea and Roth, Michael and Volp, Ulrich}}, pages = {{363}}, publisher = {{Mohr Siebeck}}, title = {{{Ethik der Zeit - Zeiten der Ethik}}}, volume = {{14}}, year = {{2024}}, } @inbook{51745, author = {{Schulz, Christian}}, booktitle = {{Digitale Schriftlichkeit – Progammieren, Prozessieren und Codieren von Schrift}}, editor = {{Bartelmus, Martin and Nebrig, Alexander}}, publisher = {{transcript }}, title = {{{Vernakulärer Code oder die Geister, die der Algorithmus rief - digitale Schriftlichkeit im Kontext von sozialen Medienplattformen}}}, year = {{2024}}, } @inbook{51748, author = {{Schulz, Christian}}, booktitle = {{Populäre Artikulationen – Artikulationen des Populären}}, editor = {{Koch, Günter and Rottgeri , André }}, publisher = {{Schüren}}, title = {{{In Likes We Trust oder die unmögliche Möglichkeit vom Like als Gabe zu sprechen}}}, year = {{2024}}, } @inbook{51746, author = {{Schulz, Christian}}, booktitle = {{Die Fotografie und ihre Institutionen. Von der Lehrsammlung zum Bundesinstitut }}, editor = {{Schürmann, Anja and Yacavone, Kathrin }}, publisher = {{Reimer Verlag}}, title = {{{Vom foto-sozialen Graph zum Story-Format: Über die Institutionalisierung sozialmedialer Infrastruktur aus dem Geiste der Fotografie}}}, year = {{2024}}, } @inbook{51747, author = {{de Gruisbourne, Birte and Schulz, Christian}}, booktitle = {{Inquiring healing across screen cultures: Recuperating narratives, mediums, and creativities}}, editor = {{Çiçek, Özgür and Savaş, Özlem}}, publisher = {{Routledge}}, title = {{{A Healing Media System of Care - Cancer Diaries and Social Media}}}, year = {{2024}}, } @book{51764, editor = {{Adelmann, Ralf and Matzner, Tobias and Miggelbrink, Monique and Schulz, Christian }}, publisher = {{MediaRep}}, title = {{{Filter – Medienwissenschaftliche Symposien der DFG}}}, year = {{2024}}, } @inbook{51790, author = {{Richter, Susanne}}, booktitle = {{Inklusiver Kinderschutz – Anforderungen, Herausforderungen, Perspektiven}}, editor = {{Kieslinger, Daniel and Owsianowski, Judith}}, isbn = {{978-3-7841-3666-0}}, publisher = {{Lambertus}}, title = {{{Herausforderungen in der inklusiven Mädchenarbeit: Begleitforschung der „Inklusiven anonymen Zuflucht“ des Mädchenhaus Bielefeld e.V.}}}, year = {{2024}}, } @article{40171, abstract = {{We present a convolutional framework which significantly reduces the complexity and thus, the computational effort for distributed reinforcement learning control of dynamical systems governed by partial differential equations (PDEs). Exploiting translational equivariances, the high-dimensional distributed control problem can be transformed into a multi-agent control problem with many identical, uncoupled agents. Furthermore, using the fact that information is transported with finite velocity in many cases, the dimension of the agents’ environment can be drastically reduced using a convolution operation over the state space of the PDE, by which we effectively tackle the curse of dimensionality otherwise present in deep reinforcement learning. In this setting, the complexity can be flexibly adjusted via the kernel width or by using a stride greater than one (meaning that we do not place an actuator at each sensor location). Moreover, scaling from smaller to larger domains – or the transfer between different domains – becomes a straightforward task requiring little effort. We demonstrate the performance of the proposed framework using several PDE examples with increasing complexity, where stabilization is achieved by training a low-dimensional deep deterministic policy gradient agent using minimal computing resources.}}, author = {{Peitz, Sebastian and Stenner, Jan and Chidananda, Vikas and Wallscheid, Oliver and Brunton, Steven L. and Taira, Kunihiko}}, journal = {{Physica D: Nonlinear Phenomena}}, pages = {{134096}}, publisher = {{Elsevier}}, title = {{{Distributed Control of Partial Differential Equations Using Convolutional Reinforcement Learning}}}, doi = {{10.1016/j.physd.2024.134096}}, volume = {{461}}, year = {{2024}}, }