@article{50829,
  author       = {{Heinisch, Nils and Köcher, Nikolas and Bauch, David and Schumacher, Stefan}},
  issn         = {{2643-1564}},
  journal      = {{Physical Review Research}},
  number       = {{1}},
  publisher    = {{American Physical Society (APS)}},
  title        = {{{Swing-up dynamics in quantum emitter cavity systems: Near ideal single photons and entangled photon pairs}}},
  doi          = {{10.1103/PhysRevResearch.6.L012017}},
  volume       = {{6}},
  year         = {{2024}},
}

@article{49772,
  author       = {{Huybrechts, Yves and Karaca, Resul}},
  issn         = {{1866-5268}},
  journal      = {{Synergies Pays germanophones}},
  pages        = {{119--131}},
  publisher    = {{GERFLINT}},
  title        = {{{BelgienNet – une plateforme pour l’accès aux langues et cultures de la Belgique}}},
  volume       = {{16}},
  year         = {{2024}},
}

@inbook{50981,
  author       = {{Eke, Norbert Otto}},
  booktitle    = {{Die Kunst der Theatereröffnung. Ästhetik und Sozialgeschichte von Bühnenprologen}},
  editor       = {{Özelt, Clemens and Schneider, Martin}},
  isbn         = {{978-3-7705-6762-1 }},
  pages        = {{199--222}},
  publisher    = {{Brill/Fink}},
  title        = {{{„Es nimmt der Raum gastfreundlich auf die Menge“. Theodor Hells Prolog zur Eröffnung des Dresdner Hoftheaters (1841)}}},
  volume       = {{Band: 3}},
  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{52529,
  author       = {{Kraft, Kerstin}},
  publisher    = {{Kraft, Kerstin, et al. “A Short Introduction to the Film Glove and Touch Studies.” Fashion Studies, vol. 5, no. 1, 2024, pp. 1-11, https://www.fashionstudies.ca/introduction-to-glove-and-touch-studies/, https://doi.org/10.38055/FS050108.}},
  title        = {{{“A Short Introduction to the Film Glove and Touch Studies.”}}},
  year         = {{2024}},
}

@inbook{52538,
  abstract     = {{Twitter ist jetzt X und befindet sich auf dem absteigenden Ast. Auf diesem Ast sitzt Facebook bereits seit längerem. Der Kurzvideodienst Vine, Vorgänger von TikTok, ist Geschichte. Und auch bei Google klingeln die Alarmglocken angesichts der „neuen“ Konkurrenz durch Microsoft und ChatGPT. Umso dringlicher wird also die Historisierung der „sozialen Medien“, das heißt, sie in ihren historischen Kontext einzuordnen und ihren Mythos zu entzaubern. Dabei wartet das Vorhaben mit einer doppelten Herausforderung auf: Erstens, dass es sich bei den Unternehmen der Branche und zweitens auch bei den dort gebildeten Gemeinschaften um recht flüchtige, wandelhaften Gestalten handelt. Scheitern und Wandel ist Teil der „sozialen Medien“ – und sei es nur in der schnellen Abfolge der Moden des „nächsten großen Dings“. Dementsprechend versucht dieser Beitrag mit einem systematischeren Ansatz als dem der gesellschaftlichen Selbstbeschreibung, die Entwicklung des sozio-digitalen Phänomens „soziale Medien“ in dessen Zeitkontext einzuordnen.}},
  author       = {{Schmitt, Martin}},
  booktitle    = {{Soziale Medien – wie sie wurden, was sie sind}},
  keywords     = {{Digitalgeschichte, Soziale Medien, Technikgeschichte, Wirtschaftsgeschichte, Digitalisierung, Twitter, Facebook, Meta}},
  publisher    = {{Bundeszentrale für politische Bildung}},
  title        = {{{Alles geht? Die jüngste Geschichte der „sozialen Medien“. Zwischen Wirtschaft und Gemeinschaft}}},
  year         = {{2024}},
}

@phdthesis{52501,
  author       = {{ Hassel, Richard}},
  pages        = {{161}},
  title        = {{{Zur Abscheidung von Tröpfchen-Aerosolen in filternden Abscheidern}}},
  doi          = {{10.17619/UNIPB/1-1870}},
  year         = {{2024}},
}

@inproceedings{52379,
  author       = {{Hüsing, Sven and Schulte, Carsten and Sparmann, Sören and Bolte, Mario}},
  booktitle    = {{Proceedings of the 55th ACM Technical Symposium on Computer Science Education V. 1}},
  publisher    = {{ACM}},
  title        = {{{Using Worked Examples for Engaging in Epistemic Programming Projects}}},
  doi          = {{10.1145/3626252.3630961}},
  year         = {{2024}},
}

@article{49905,
  abstract     = {{For 0 ≤ t ≤ r let m(t, r) be the maximum number s such that every t-edge-connected r-graph has s pairwise disjoint perfect matchings. There are only a few values of m(t, r) known, for instance m(3, 3) = m(4, r) = 1, and m(t, r) ≤ r − 2 for all t  = 5,
and m(t, r) ≤ r − 3 if r is even. We prove that m(2l, r) ≤ 3l − 6 for every l ≥ 3 and r ≥ 2l.}},
  author       = {{Ma, Yulai and Mattiolo, Davide and Steffen, Eckhard and Wolf, Isaak Hieronymus}},
  issn         = {{0209-9683}},
  journal      = {{Combinatorica}},
  keywords     = {{Computational Mathematics, Discrete Mathematics and Combinatorics}},
  pages        = {{429--440}},
  publisher    = {{Springer Science and Business Media LLC}},
  title        = {{{Edge-Connectivity and Pairwise Disjoint Perfect Matchings in Regular Graphs}}},
  doi          = {{10.1007/s00493-023-00078-9}},
  volume       = {{44}},
  year         = {{2024}},
}

@inproceedings{52841,
  abstract     = {{What is preventing us from building a NLP system that could help real people in real situations, for instance when they need legal advice but don{’}t understand law? This question is trickier than one might think, because legal systems vary from country to country, so do the law books, availability of data, and incomprehensibility of legalese. In this paper we focus Germany (which employs the civil-law system where, roughly speaking, interpretation of law codes dominates over precedence) and lay a foundational work to address the laymen{’}s legal question answering empirically. We create GerLayQA, a new dataset comprising of 21k laymen{’}s legal questions paired with answers from lawyers and grounded to concrete law book paragraphs. We experiment with a variety of retrieval and answer generation models and provide an in-depth analysis of limitations, which helps us to provide first empirical answers to the question above.}},
  author       = {{Büttner, Marius and Habernal, Ivan}},
  booktitle    = {{Proceedings of the 18th Conference of the European Chapter of the Association for Computational Linguistics (Volume 1: Long Papers)}},
  editor       = {{Graham, Yvette and Purver, Matthew}},
  pages        = {{2015–2027}},
  publisher    = {{Association for Computational Linguistics}},
  title        = {{{Answering legal questions from laymen in German civil law system}}},
  year         = {{2024}},
}

@phdthesis{53134,
  author       = {{Hirsch, Andre}},
  title        = {{{Ein Beitrag zur Erarbeitung von Fertigungsrichtlinien für das Kunststoff Freiformen }}},
  doi          = {{978-3-8440-9409-1}},
  year         = {{2024}},
}

@phdthesis{53135,
  author       = {{Schadomsky, Michael}},
  title        = {{{Experimentelle und simulative Analyse der Mischwirkung in Einschneckenextrudern}}},
  doi          = {{978-3-8440-9334-6}},
  year         = {{2024}},
}

@inbook{37704,
  author       = {{Ksouri-Gerwien, Christoph and Vorbohle, Christian}},
  booktitle    = {{Digitale Plattformen und Ökosysteme im B2B-Bereich}},
  editor       = {{Schallmo, D.R.A. and Kundisch, Dennis and Lang, K.}},
  publisher    = {{Springer Gabler}},
  title        = {{{Anwendung von System Dynamics zur Geschäftsmodellinnovation in einem B2B-Ökosystem}}},
  year         = {{2024}},
}

@article{53316,
  abstract     = {{<jats:title>Abstract</jats:title><jats:p>The quasilinear Keller–Segel system <jats:disp-formula><jats:alternatives><jats:tex-math>$$\begin{aligned} \left\{ \begin{array}{l} u_t=\nabla \cdot (D(u)\nabla u) - \nabla \cdot (S(u)\nabla v), \\ v_t=\Delta v-v+u, \end{array}\right. \end{aligned}$$</jats:tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML">
                  <mml:mrow>
                    <mml:mtable>
                      <mml:mtr>
                        <mml:mtd>
                          <mml:mfenced>
                            <mml:mrow>
                              <mml:mtable>
                                <mml:mtr>
                                  <mml:mtd>
                                    <mml:mrow>
                                      <mml:msub>
                                        <mml:mi>u</mml:mi>
                                        <mml:mi>t</mml:mi>
                                      </mml:msub>
                                      <mml:mo>=</mml:mo>
                                      <mml:mi>∇</mml:mi>
                                      <mml:mo>·</mml:mo>
                                      <mml:mrow>
                                        <mml:mo>(</mml:mo>
                                        <mml:mi>D</mml:mi>
                                        <mml:mrow>
                                          <mml:mo>(</mml:mo>
                                          <mml:mi>u</mml:mi>
                                          <mml:mo>)</mml:mo>
                                        </mml:mrow>
                                        <mml:mi>∇</mml:mi>
                                        <mml:mi>u</mml:mi>
                                        <mml:mo>)</mml:mo>
                                      </mml:mrow>
                                      <mml:mo>-</mml:mo>
                                      <mml:mi>∇</mml:mi>
                                      <mml:mo>·</mml:mo>
                                      <mml:mrow>
                                        <mml:mo>(</mml:mo>
                                        <mml:mi>S</mml:mi>
                                        <mml:mrow>
                                          <mml:mo>(</mml:mo>
                                          <mml:mi>u</mml:mi>
                                          <mml:mo>)</mml:mo>
                                        </mml:mrow>
                                        <mml:mi>∇</mml:mi>
                                        <mml:mi>v</mml:mi>
                                        <mml:mo>)</mml:mo>
                                      </mml:mrow>
                                      <mml:mo>,</mml:mo>
                                    </mml:mrow>
                                  </mml:mtd>
                                </mml:mtr>
                                <mml:mtr>
                                  <mml:mtd>
                                    <mml:mrow>
                                      <mml:mrow />
                                      <mml:msub>
                                        <mml:mi>v</mml:mi>
                                        <mml:mi>t</mml:mi>
                                      </mml:msub>
                                      <mml:mo>=</mml:mo>
                                      <mml:mi>Δ</mml:mi>
                                      <mml:mi>v</mml:mi>
                                      <mml:mo>-</mml:mo>
                                      <mml:mi>v</mml:mi>
                                      <mml:mo>+</mml:mo>
                                      <mml:mi>u</mml:mi>
                                      <mml:mo>,</mml:mo>
                                    </mml:mrow>
                                  </mml:mtd>
                                </mml:mtr>
                              </mml:mtable>
                            </mml:mrow>
                          </mml:mfenced>
                        </mml:mtd>
                      </mml:mtr>
                    </mml:mtable>
                  </mml:mrow>
                </mml:math></jats:alternatives></jats:disp-formula>endowed with homogeneous Neumann boundary conditions is considered in a bounded domain <jats:inline-formula><jats:alternatives><jats:tex-math>$$\Omega \subset {\mathbb {R}}^n$$</jats:tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML">
                  <mml:mrow>
                    <mml:mi>Ω</mml:mi>
                    <mml:mo>⊂</mml:mo>
                    <mml:msup>
                      <mml:mrow>
                        <mml:mi>R</mml:mi>
                      </mml:mrow>
                      <mml:mi>n</mml:mi>
                    </mml:msup>
                  </mml:mrow>
                </mml:math></jats:alternatives></jats:inline-formula>, <jats:inline-formula><jats:alternatives><jats:tex-math>$$n \ge 3$$</jats:tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML">
                  <mml:mrow>
                    <mml:mi>n</mml:mi>
                    <mml:mo>≥</mml:mo>
                    <mml:mn>3</mml:mn>
                  </mml:mrow>
                </mml:math></jats:alternatives></jats:inline-formula>, with smooth boundary for sufficiently regular functions <jats:italic>D</jats:italic> and <jats:italic>S</jats:italic> satisfying <jats:inline-formula><jats:alternatives><jats:tex-math>$$D&gt;0$$</jats:tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML">
                  <mml:mrow>
                    <mml:mi>D</mml:mi>
                    <mml:mo>&gt;</mml:mo>
                    <mml:mn>0</mml:mn>
                  </mml:mrow>
                </mml:math></jats:alternatives></jats:inline-formula> on <jats:inline-formula><jats:alternatives><jats:tex-math>$$[0,\infty )$$</jats:tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML">
                  <mml:mrow>
                    <mml:mo>[</mml:mo>
                    <mml:mn>0</mml:mn>
                    <mml:mo>,</mml:mo>
                    <mml:mi>∞</mml:mi>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                </mml:math></jats:alternatives></jats:inline-formula>, <jats:inline-formula><jats:alternatives><jats:tex-math>$$S&gt;0$$</jats:tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML">
                  <mml:mrow>
                    <mml:mi>S</mml:mi>
                    <mml:mo>&gt;</mml:mo>
                    <mml:mn>0</mml:mn>
                  </mml:mrow>
                </mml:math></jats:alternatives></jats:inline-formula> on <jats:inline-formula><jats:alternatives><jats:tex-math>$$(0,\infty )$$</jats:tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML">
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mn>0</mml:mn>
                    <mml:mo>,</mml:mo>
                    <mml:mi>∞</mml:mi>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                </mml:math></jats:alternatives></jats:inline-formula> and <jats:inline-formula><jats:alternatives><jats:tex-math>$$S(0)=0$$</jats:tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML">
                  <mml:mrow>
                    <mml:mi>S</mml:mi>
                    <mml:mo>(</mml:mo>
                    <mml:mn>0</mml:mn>
                    <mml:mo>)</mml:mo>
                    <mml:mo>=</mml:mo>
                    <mml:mn>0</mml:mn>
                  </mml:mrow>
                </mml:math></jats:alternatives></jats:inline-formula>. On the one hand, it is shown that if <jats:inline-formula><jats:alternatives><jats:tex-math>$$\frac{S}{D}$$</jats:tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML">
                  <mml:mfrac>
                    <mml:mi>S</mml:mi>
                    <mml:mi>D</mml:mi>
                  </mml:mfrac>
                </mml:math></jats:alternatives></jats:inline-formula> satisfies the subcritical growth condition <jats:disp-formula><jats:alternatives><jats:tex-math>$$\begin{aligned} \frac{S(s)}{D(s)} \le C s^\alpha \qquad \text{ for } \text{ all } s\ge 1 \qquad \text{ with } \text{ some } \alpha &lt; \frac{2}{n} \end{aligned}$$</jats:tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML">
                  <mml:mrow>
                    <mml:mtable>
                      <mml:mtr>
                        <mml:mtd>
                          <mml:mrow>
                            <mml:mfrac>
                              <mml:mrow>
                                <mml:mi>S</mml:mi>
                                <mml:mo>(</mml:mo>
                                <mml:mi>s</mml:mi>
                                <mml:mo>)</mml:mo>
                              </mml:mrow>
                              <mml:mrow>
                                <mml:mi>D</mml:mi>
                                <mml:mo>(</mml:mo>
                                <mml:mi>s</mml:mi>
                                <mml:mo>)</mml:mo>
                              </mml:mrow>
                            </mml:mfrac>
                            <mml:mo>≤</mml:mo>
                            <mml:mi>C</mml:mi>
                            <mml:msup>
                              <mml:mi>s</mml:mi>
                              <mml:mi>α</mml:mi>
                            </mml:msup>
                            <mml:mspace />
                            <mml:mspace />
                            <mml:mtext>for</mml:mtext>
                            <mml:mspace />
                            <mml:mspace />
                            <mml:mtext>all</mml:mtext>
                            <mml:mspace />
                            <mml:mi>s</mml:mi>
                            <mml:mo>≥</mml:mo>
                            <mml:mn>1</mml:mn>
                            <mml:mspace />
                            <mml:mspace />
                            <mml:mtext>with</mml:mtext>
                            <mml:mspace />
                            <mml:mspace />
                            <mml:mtext>some</mml:mtext>
                            <mml:mspace />
                            <mml:mi>α</mml:mi>
                            <mml:mo>&lt;</mml:mo>
                            <mml:mfrac>
                              <mml:mn>2</mml:mn>
                              <mml:mi>n</mml:mi>
                            </mml:mfrac>
                          </mml:mrow>
                        </mml:mtd>
                      </mml:mtr>
                    </mml:mtable>
                  </mml:mrow>
                </mml:math></jats:alternatives></jats:disp-formula>and <jats:inline-formula><jats:alternatives><jats:tex-math>$$C&gt;0$$</jats:tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML">
                  <mml:mrow>
                    <mml:mi>C</mml:mi>
                    <mml:mo>&gt;</mml:mo>
                    <mml:mn>0</mml:mn>
                  </mml:mrow>
                </mml:math></jats:alternatives></jats:inline-formula>, then for any sufficiently regular initial data there exists a global weak energy solution such that <jats:inline-formula><jats:alternatives><jats:tex-math>$${ \mathrm{{ess}}} \sup _{t&gt;0} \Vert u(t) \Vert _{L^p(\Omega )}&lt;\infty $$</jats:tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML">
                  <mml:mrow>
                    <mml:mi>ess</mml:mi>
                    <mml:msub>
                      <mml:mo>sup</mml:mo>
                      <mml:mrow>
                        <mml:mi>t</mml:mi>
                        <mml:mo>&gt;</mml:mo>
                        <mml:mn>0</mml:mn>
                      </mml:mrow>
                    </mml:msub>
                    <mml:msub>
                      <mml:mrow>
                        <mml:mo>‖</mml:mo>
                        <mml:mi>u</mml:mi>
                        <mml:mrow>
                          <mml:mo>(</mml:mo>
                          <mml:mi>t</mml:mi>
                          <mml:mo>)</mml:mo>
                        </mml:mrow>
                        <mml:mo>‖</mml:mo>
                      </mml:mrow>
                      <mml:mrow>
                        <mml:msup>
                          <mml:mi>L</mml:mi>
                          <mml:mi>p</mml:mi>
                        </mml:msup>
                        <mml:mrow>
                          <mml:mo>(</mml:mo>
                          <mml:mi>Ω</mml:mi>
                          <mml:mo>)</mml:mo>
                        </mml:mrow>
                      </mml:mrow>
                    </mml:msub>
                    <mml:mo>&lt;</mml:mo>
                    <mml:mi>∞</mml:mi>
                  </mml:mrow>
                </mml:math></jats:alternatives></jats:inline-formula> for some <jats:inline-formula><jats:alternatives><jats:tex-math>$$p &gt; \frac{2n}{n+2}$$</jats:tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML">
                  <mml:mrow>
                    <mml:mi>p</mml:mi>
                    <mml:mo>&gt;</mml:mo>
                    <mml:mfrac>
                      <mml:mrow>
                        <mml:mn>2</mml:mn>
                        <mml:mi>n</mml:mi>
                      </mml:mrow>
                      <mml:mrow>
                        <mml:mi>n</mml:mi>
                        <mml:mo>+</mml:mo>
                        <mml:mn>2</mml:mn>
                      </mml:mrow>
                    </mml:mfrac>
                  </mml:mrow>
                </mml:math></jats:alternatives></jats:inline-formula>. On the other hand, if <jats:inline-formula><jats:alternatives><jats:tex-math>$$\frac{S}{D}$$</jats:tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML">
                  <mml:mfrac>
                    <mml:mi>S</mml:mi>
                    <mml:mi>D</mml:mi>
                  </mml:mfrac>
                </mml:math></jats:alternatives></jats:inline-formula> satisfies the supercritical growth condition <jats:disp-formula><jats:alternatives><jats:tex-math>$$\begin{aligned} \frac{S(s)}{D(s)} \ge c s^\alpha \qquad \text{ for } \text{ all } s\ge 1 \qquad \text{ with } \text{ some } \alpha &gt; \frac{2}{n} \end{aligned}$$</jats:tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML">
                  <mml:mrow>
                    <mml:mtable>
                      <mml:mtr>
                        <mml:mtd>
                          <mml:mrow>
                            <mml:mfrac>
                              <mml:mrow>
                                <mml:mi>S</mml:mi>
                                <mml:mo>(</mml:mo>
                                <mml:mi>s</mml:mi>
                                <mml:mo>)</mml:mo>
                              </mml:mrow>
                              <mml:mrow>
                                <mml:mi>D</mml:mi>
                                <mml:mo>(</mml:mo>
                                <mml:mi>s</mml:mi>
                                <mml:mo>)</mml:mo>
                              </mml:mrow>
                            </mml:mfrac>
                            <mml:mo>≥</mml:mo>
                            <mml:mi>c</mml:mi>
                            <mml:msup>
                              <mml:mi>s</mml:mi>
                              <mml:mi>α</mml:mi>
                            </mml:msup>
                            <mml:mspace />
                            <mml:mspace />
                            <mml:mtext>for</mml:mtext>
                            <mml:mspace />
                            <mml:mspace />
                            <mml:mtext>all</mml:mtext>
                            <mml:mspace />
                            <mml:mi>s</mml:mi>
                            <mml:mo>≥</mml:mo>
                            <mml:mn>1</mml:mn>
                            <mml:mspace />
                            <mml:mspace />
                            <mml:mtext>with</mml:mtext>
                            <mml:mspace />
                            <mml:mspace />
                            <mml:mtext>some</mml:mtext>
                            <mml:mspace />
                            <mml:mi>α</mml:mi>
                            <mml:mo>&gt;</mml:mo>
                            <mml:mfrac>
                              <mml:mn>2</mml:mn>
                              <mml:mi>n</mml:mi>
                            </mml:mfrac>
                          </mml:mrow>
                        </mml:mtd>
                      </mml:mtr>
                    </mml:mtable>
                  </mml:mrow>
                </mml:math></jats:alternatives></jats:disp-formula>and <jats:inline-formula><jats:alternatives><jats:tex-math>$$c&gt;0$$</jats:tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML">
                  <mml:mrow>
                    <mml:mi>c</mml:mi>
                    <mml:mo>&gt;</mml:mo>
                    <mml:mn>0</mml:mn>
                  </mml:mrow>
                </mml:math></jats:alternatives></jats:inline-formula>, then the nonexistence of a global weak energy solution having the boundedness property stated above is shown for some initial data in the radial setting. This establishes some criticality of the value <jats:inline-formula><jats:alternatives><jats:tex-math>$$\alpha = \frac{2}{n}$$</jats:tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML">
                  <mml:mrow>
                    <mml:mi>α</mml:mi>
                    <mml:mo>=</mml:mo>
                    <mml:mfrac>
                      <mml:mn>2</mml:mn>
                      <mml:mi>n</mml:mi>
                    </mml:mfrac>
                  </mml:mrow>
                </mml:math></jats:alternatives></jats:inline-formula> for <jats:inline-formula><jats:alternatives><jats:tex-math>$$n \ge 3$$</jats:tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML">
                  <mml:mrow>
                    <mml:mi>n</mml:mi>
                    <mml:mo>≥</mml:mo>
                    <mml:mn>3</mml:mn>
                  </mml:mrow>
                </mml:math></jats:alternatives></jats:inline-formula>, without any additional assumption on the behavior of <jats:italic>D</jats:italic>(<jats:italic>s</jats:italic>) as <jats:inline-formula><jats:alternatives><jats:tex-math>$$s \rightarrow \infty $$</jats:tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML">
                  <mml:mrow>
                    <mml:mi>s</mml:mi>
                    <mml:mo>→</mml:mo>
                    <mml:mi>∞</mml:mi>
                  </mml:mrow>
                </mml:math></jats:alternatives></jats:inline-formula>, in particular without requiring any algebraic lower bound for <jats:italic>D</jats:italic>. When applied to the Keller–Segel system with volume-filling effect for probability distribution functions of the type <jats:inline-formula><jats:alternatives><jats:tex-math>$$Q(s) = \exp (-s^\beta )$$</jats:tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML">
                  <mml:mrow>
                    <mml:mi>Q</mml:mi>
                    <mml:mrow>
                      <mml:mo>(</mml:mo>
                      <mml:mi>s</mml:mi>
                      <mml:mo>)</mml:mo>
                    </mml:mrow>
                    <mml:mo>=</mml:mo>
                    <mml:mo>exp</mml:mo>
                    <mml:mrow>
                      <mml:mo>(</mml:mo>
                      <mml:mo>-</mml:mo>
                      <mml:msup>
                        <mml:mi>s</mml:mi>
                        <mml:mi>β</mml:mi>
                      </mml:msup>
                      <mml:mo>)</mml:mo>
                    </mml:mrow>
                  </mml:mrow>
                </mml:math></jats:alternatives></jats:inline-formula>, <jats:inline-formula><jats:alternatives><jats:tex-math>$$s \ge 0$$</jats:tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML">
                  <mml:mrow>
                    <mml:mi>s</mml:mi>
                    <mml:mo>≥</mml:mo>
                    <mml:mn>0</mml:mn>
                  </mml:mrow>
                </mml:math></jats:alternatives></jats:inline-formula>, for global solvability the exponent <jats:inline-formula><jats:alternatives><jats:tex-math>$$\beta = \frac{n-2}{n}$$</jats:tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML">
                  <mml:mrow>
                    <mml:mi>β</mml:mi>
                    <mml:mo>=</mml:mo>
                    <mml:mfrac>
                      <mml:mrow>
                        <mml:mi>n</mml:mi>
                        <mml:mo>-</mml:mo>
                        <mml:mn>2</mml:mn>
                      </mml:mrow>
                      <mml:mi>n</mml:mi>
                    </mml:mfrac>
                  </mml:mrow>
                </mml:math></jats:alternatives></jats:inline-formula> is seen to be critical.
</jats:p>}},
  author       = {{Stinner, Christian and Winkler, Michael}},
  issn         = {{1424-3199}},
  journal      = {{Journal of Evolution Equations}},
  keywords     = {{Mathematics (miscellaneous)}},
  number       = {{2}},
  publisher    = {{Springer Science and Business Media LLC}},
  title        = {{{A critical exponent in a quasilinear Keller–Segel system with arbitrarily fast decaying diffusivities accounting for volume-filling effects}}},
  doi          = {{10.1007/s00028-024-00954-x}},
  volume       = {{24}},
  year         = {{2024}},
}

@article{52096,
  author       = {{Kamp, Hermann}},
  journal      = {{Zeitschrift des Aachener Geschichtsvereins }},
  pages        = {{137--167}},
  publisher    = {{VERLAGSDRUCKEREI SCHMIDT GMBH}},
  title        = {{{Zwischen Beutesuche und politischen Ambitionen. Die Normannen an Rhein und Maas zwischen 880 und 892}}},
  volume       = {{123/124, 2021-2022}},
  year         = {{2024}},
}

@article{53417,
  abstract     = {{<jats:title>Abstract</jats:title>
               <jats:p>Remote-controlled telescopes in education provide the opportunity to obtain high quality astronomy images for a broad variety of users. The Stellarium Gornergrat is such a telescope. In addition to pure observation, it offers a user-friendly interface and teaching modules so that astronomical and astrophysical projects can be integrated into everyday school life without any special prior knowledge and without requiring a lot of time. This contribution presents the Stellarium project and a provides an overview of several teaching activities.</jats:p>}},
  author       = {{Gschwind, Stéphane and Hohmann, Sascha and Müller, Andreas and Nordine, Jeffrey and Riesen, Timm-Emanuel}},
  issn         = {{1742-6588}},
  journal      = {{Journal of Physics: Conference Series}},
  keywords     = {{Computer Science Applications, History, Education}},
  location     = {{Hanoi}},
  number       = {{1}},
  publisher    = {{IOP Publishing}},
  title        = {{{The Stellarium Gornergrat: Astrophysics with your own Data}}},
  doi          = {{10.1088/1742-6596/2727/1/012011}},
  volume       = {{2727}},
  year         = {{2024}},
}

@inbook{53473,
  author       = {{Elit, Stefan}},
  booktitle    = {{‚Topographisches‘ Schreiben: Lea Streisand, Paderborn, Wintersemester 2022/2023}},
  editor       = {{Elit, Stefan and Eke, Norbert Otto}},
  isbn         = {{978-3-8498-1957-6}},
  pages        = {{137--154}},
  publisher    = {{Aisthesis}},
  title        = {{{‚Schelmische‘ Post-DDR-Romane: Ingo Schulzes „Peter Holtz“ und Lea Streisands „Hufeland, Ecke Bötzow“}}},
  volume       = {{41.}},
  year         = {{2024}},
}

@article{53474,
  abstract     = {{We present a novel approach to characterize and quantify microheterogeneity and microphase separation in computer simulations of complex liquid mixtures. Our post-processing method is based on local density fluctuations of the different constituents in sampling spheres of varying size. It can be easily applied to both molecular dynamics (MD) and Monte Carlo (MC) simulations, including periodic boundary conditions. Multidimensional correlation of the density distributions yields a clear picture of the domain formation due to the subtle balance of different interactions. We apply our approach to the example of force field molecular dynamics simulations of imidazolium-based ionic liquids with different side chain lengths at different temperatures, namely 1-ethyl-3-methylimidazolium chloride, 1-hexyl-3-methylimidazolium chloride, and 1-decyl-3-methylimidazolium chloride, which are known to form distinct liquid domains. We put the results into the context of existing microheterogeneity analyses and demonstrate the advantages and sensitivity of our novel method. Furthermore, we show how to estimate the configuration entropy from our analysis, and we investigate voids in the system. The analysis has been implemented into our program package TRAVIS and is thus available as free software.}},
  author       = {{Lass, Michael and Kenter, Tobias and Plessl, Christian and Brehm, Martin}},
  issn         = {{1099-4300}},
  journal      = {{Entropy}},
  number       = {{4}},
  publisher    = {{MDPI AG}},
  title        = {{{Characterizing Microheterogeneity in Liquid Mixtures via Local Density Fluctuations}}},
  doi          = {{10.3390/e26040322}},
  volume       = {{26}},
  year         = {{2024}},
}

@book{53472,
  editor       = {{Eke, Norbert and Elit, Stefan}},
  isbn         = {{978-3-8498-1957-6}},
  pages        = {{178}},
  publisher    = {{Aisthesis}},
  title        = {{{'Topographisches‘ Schreiben: Lea Streisand. Paderborn Wintersemester 2022/23}}},
  volume       = {{41.}},
  year         = {{2024}},
}

