@misc{54915,
  author       = {{Günesli, Habib and Sotkov, Mihail}},
  publisher    = {{LibreCat University}},
  title        = {{{'Mapping the Pott': Online-Befragung zur Mehrsprachigkeit der Lehramtsstudierenden der UA Ruhr}}},
  doi          = {{10.17877/TUDODATA-2024-LWGK4N8I}},
  year         = {{2024}},
}

@inproceedings{54916,
  abstract     = {{Reputation systems for companies to rate each other's performance are largely unexplored in research and hardly available in practice. However, these systems are relevant for prospective buyers to find a trustworthy seller. This observation applies especially to short-lived business relationships where fulfilling the performance promise is subject to a high degree of uncertainty. This paper explores the value of a reputation system for a business-to-business (B2B) context and focuses on three novel solutions for designing reputation systems. These solutions include selling ratings, conducting ratings as payments, and employing a counter-rating mechanism. We interview buyers to fathom the added value of these solutions in different contexts. Our findings suggest that such a system is useful for companies acting in less transparent markets and also helps when companies already have a good market overview. Depending on the market conditions and business context, the perceived value of the proposed system varies.}},
  author       = {{Hemmrich, Simon and Schäfer, Jannika Marie and Hansmeier, Philipp and Beverungen, Daniel}},
  booktitle    = {{Proceedings of the 57th Hawaii International Conference on System Sciences}},
  keywords     = {{Electronic Marketing, business-to-business, new design approach, reputation systems, value for buyers.}},
  location     = {{Honolulu}},
  title        = {{{The Value of Reputation Systems in Business Contexts–A Qualitative Study Taking the View of Buyers}}},
  year         = {{2024}},
}

@article{54926,
  author       = {{Stutz, Bianca and Krueger, Bettina and Goletzke, Janina and Jankovic, Nicole and Alexy, Ute and Herder, Christian and Dierkes, Jutta and Berg-Beckhoff, Gabriele and Jakobsmeyer, Rasmus and Reinsberger, Claus and Buyken, Anette E.}},
  issn         = {{1436-6215}},
  journal      = {{European Journal of Nutrition}},
  publisher    = {{Springer}},
  title        = {{{Glycemic response to meals with a high glycemic index differs between morning and evening: a randomized cross-over controlled trial among students with early or late chronotype}}},
  doi          = {{10.1007/s00394-024-03372-4}},
  year         = {{2024}},
}

@article{54927,
  author       = {{Stutz, Bianca and Goletzke, Janina and Krueger, Bettina and Jankovic, Nicole and Alexy, Ute and Herder, Christian and Jakobsmeyer, Rasmus and Reinsberger, Claus and Buyken, Anette E.}},
  journal      = {{Appetite}},
  pages        = {{107569}},
  publisher    = {{Elsevier}},
  title        = {{{Association between glucose dips and the feeling of hunger in a dietary intervention study among students with early and late chronotype-secondary analysis of a randomized cross-over nutrition trial}}},
  doi          = {{10.1016/j.appet.2024.107569}},
  volume       = {{200}},
  year         = {{2024}},
}

@inproceedings{54952,
  author       = {{Piskin, Daghan Yüksel and Cobani, Gjergji and Lehmann, Tim and Büchel, Daniel and Baumeister, Jochen}},
  location     = {{Piran}},
  title        = {{{MULTISCALE ENTROPY ANALYSIS IN MOBILE EEG: COULD IT HAVE A POTENTIAL USE IN REAL-WORLD SETTINGS?}}},
  doi          = {{10.1016/j.bbr.2024.115120}},
  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}}},
  doi          = {{https://doi.org/10.1515/9783839468135-009}},
  year         = {{2024}},
}

@article{54962,
  author       = {{Hetkämper, Tim and Claes, Leander and Henning, Bernd}},
  issn         = {{2569–1600}},
  journal      = {{Akustik Journal}},
  pages        = {{18 -- 25}},
  publisher    = {{Deutsche Gesellschaft für Akustik e.V. (DEGA)}},
  title        = {{{Das Unhörbare sehen - Ultraschall mittels Schlierentechnik visualisieren}}},
  volume       = {{2}},
  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}},
}

@article{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 previously laid out in [H. Attouch and G. Garrigos, Multiobjective Optimization: An Inertial Dynamical Approach to Pareto Optima, preprint, arXiv:1506.02823, 2015]. 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 \(\mathcal{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}},
  issn         = {{1095-7189}},
  journal      = {{SIAM Journal on Optimization}},
  keywords     = {{multiobjective optimization, Pareto optimization, Lyapunov analysis, gradient-likedynamical systems, inertial dynamics, asymptotic vanishing damping, fast convergence}},
  number       = {{3}},
  pages        = {{2259 -- 2286}},
  publisher    = {{Society for Industrial and Applied Mathematics}},
  title        = {{{Fast Convergence of Inertial Multiobjective Gradient-Like Systems with Asymptotic Vanishing Damping}}},
  doi          = {{10.1137/23M1588512}},
  volume       = {{34}},
  year         = {{2024}},
}

@book{54972,
  editor       = {{Thommes, Kirsten and Iseke, Anja and Schneider, Martin}},
  isbn         = {{9783662688373}},
  issn         = {{2523-3637}},
  publisher    = {{Springer Berlin Heidelberg}},
  title        = {{{Digitales und prädiktives Kompetenzmanagement}}},
  doi          = {{10.1007/978-3-662-68838-0}},
  year         = {{2024}},
}

@inproceedings{50406,
  abstract     = {{What is the power of polynomial-time quantum computation with access to an NP
oracle? In this work, we focus on two fundamental tasks from the study of
Boolean satisfiability (SAT) problems: search-to-decision reductions, and
approximate counting. We first show that, in strong contrast to the classical
setting where a poly-time Turing machine requires $\Theta(n)$ queries to an NP
oracle to compute a witness to a given SAT formula, quantumly $\Theta(\log n)$
queries suffice. We then show this is tight in the black-box model - any
quantum algorithm with "NP-like" query access to a formula requires
$\Omega(\log n)$ queries to extract a solution with constant probability.
Moving to approximate counting of SAT solutions, by exploiting a quantum link
between search-to-decision reductions and approximate counting, we show that
existing classical approximate counting algorithms are likely optimal. First,
we give a lower bound in the "NP-like" black-box query setting: Approximate
counting requires $\Omega(\log n)$ queries, even on a quantum computer. We then
give a "white-box" lower bound (i.e. where the input formula is not hidden in
the oracle) - if there exists a randomized poly-time classical or quantum
algorithm for approximate counting making $o(log n)$ NP queries, then
$\text{BPP}^{\text{NP}[o(n)]}$ contains a $\text{P}^{\text{NP}}$-complete
problem if the algorithm is classical and $\text{FBQP}^{\text{NP}[o(n)]}$
contains an $\text{FP}^{\text{NP}}$-complete problem if the algorithm is
quantum.}},
  author       = {{Gharibian, Sevag and Kamminga, Jonas}},
  booktitle    = {{Proceedings of 51st EATCS International Colloquium on Automata, Languages and Programming (ICALP)}},
  number       = {{70}},
  pages        = {{1--19}},
  title        = {{{BQP, meet NP: Search-to-decision reductions and approximate counting}}},
  volume       = {{297}},
  year         = {{2024}},
}

@article{53125,
  author       = {{Hälterlein, Jens}},
  journal      = {{AI & Society}},
  title        = {{{Imagining and Governing Artificial Intelligence – the Ordoliberal Way: An Analysis of the National Strategy ‘AI Made in Germany’}}},
  doi          = {{10.1007/s00146-024-01940-0   }},
  year         = {{2024}},
}

@article{54794,
  author       = {{Hälterlein, Jens and Weber, Jutta}},
  journal      = {{Ethics and Armed Forces}},
  number       = {{1}},
  title        = {{{“Meaningful Human Control” and Complex Human-Machine Assemblages – On the Limits of Ethical AI Principles in the Context of Autonomous Weapons Systems}}},
  year         = {{2024}},
}

@article{53446,
  author       = {{Hälterlein, Jens}},
  journal      = {{CILIP Bürgerrechte & Polizei}},
  number       = {{134}},
  title        = {{{Biometrische Gesichtserkennung – Technologischer Solutionismus für mehr „Sicherheit“}}},
  year         = {{2024}},
}

@inproceedings{54960,
  abstract     = {{Das Fachdidaktische Wissen (FDW) wird als zentrale Komponente des Professionswissens von Lehrkräften bereits lange intensiv untersucht. Bislang liegen Ergebnisse zu Zusammenhängen des FDW mit anderen Professionswissensbereichen, zur Performanz in prototypischen Handlungssituationen und erste datengestützte inhaltlich-hierarchische Analysen auf Basis von Item Response Modellen (IRT-Modellen) vor. Im Zusammenhang mit einem projektübergreifend durchgeführten Vergleich entsprechender IRT-Modelle haben sich jedoch Limitationen bei der Vereinbarkeit und der inhaltlichen Reichhaltigkeit entsprechender Ergebnisse gezeigt, wie im Beitrag vorgestellt wird . Daher werden Analysemethoden aus dem Bereich des Machine Learning (unsupervised) vorgeschlagen, welche im Gegensatz zu IRT-Modellen auch nicht-hierarchische inhaltliche Strukturen aufdecken können. Es werden Ergebnisse entsprechender Clusteranalysen sowie Analysepläne zur Unterstützung dieser auf Basis der authentischen Sprachproduktionen von Proband:innen mithilfe von Natural Language Processing vorgestellt.}},
  author       = {{Zeller, Jannis and Riese, Josef}},
  booktitle    = {{Frühe naturwissenschaftliche Bildung, Tagungsband der GDCP Jahrestagung 2023}},
  editor       = {{van Vorst, Helena}},
  keywords     = {{Physikdidaktisches Wissen, Fähigkeitsprofile, Machine Learning}},
  location     = {{Hamburg}},
  pages        = {{122--125}},
  publisher    = {{Gesellschaft für Didaktik der Chemie und Physik}},
  title        = {{{Fähigkeitsprofile im Physikdidaktischen Wissen mithilfe von Machine Learning}}},
  year         = {{2024}},
}

@misc{55002,
  author       = {{Delgado Steuter, Dominik}},
  title        = {{{Realizing Concurrency on Top of the Microkernel seL4 via Improved Threads }}},
  year         = {{2024}},
}

@article{55004,
  author       = {{Mildorf, Jarmila}},
  issn         = {{2719-8014}},
  journal      = {{Perspektywy Kultury / Perspectives on Culture }},
  number       = {{2}},
  pages        = {{181--197}},
  title        = {{{Time and Transformation in Autobiography: Candia McWilliam’s What to Look for in Winter: A Memoir in Blindness}}},
  doi          = {{10.35765/pk.2024.4502.14}},
  volume       = {{45}},
  year         = {{2024}},
}

@misc{55003,
  author       = {{Artmann, Matthias}},
  title        = {{{On the Shape Containment Problem within the Amoebot Model with Reconfigurable Circuits}}},
  year         = {{2024}},
}

@inbook{49722,
  author       = {{Mildorf, Jarmila}},
  booktitle    = {{Word, Sound and Music in Radio Drama}},
  editor       = {{Verhulst, Pim and Mildorf, Jarmila}},
  isbn         = {{978-90-04-54960-9}},
  pages        = {{275--292}},
  publisher    = {{Brill}},
  title        = {{{The Interplay of Sound Tapestry and Music in the 1992 German Radio Play Adaptation of J.R.R. Tolkien’s The Lord of the Rings}}},
  volume       = {{21}},
  year         = {{2024}},
}

@inbook{49721,
  author       = {{Mildorf, Jarmila}},
  booktitle    = {{Word, Sound and Music in Radio Drama}},
  editor       = {{Verhulst, Pim and Mildorf, Jarmila}},
  isbn         = {{978-90-04-54960-9}},
  pages        = {{1--15}},
  publisher    = {{Brill}},
  title        = {{{Word, Sound and Music in Radio Drama: An Introduction}}},
  volume       = {{21}},
  year         = {{2024}},
}

