@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}}, } @unpublished{56944, abstract = {{Quantum Max Cut (QMC), also known as the quantum anti-ferromagnetic Heisenberg model, is a QMA-complete problem relevant to quantum many-body physics and computer science. Semidefinite programming relaxations have been fruitful in designing theoretical approximation algorithms for QMC, but are computationally expensive for systems beyond tens of qubits. We give a second order cone relaxation for QMC, which optimizes over the set of mutually consistent three-qubit reduced density matrices. In combination with Pauli level-$1$ of the quantum Lasserre hierarchy, the relaxation achieves an approximation ratio of $0.526$ to the ground state energy. Our relaxation is solvable on systems with hundreds of qubits and paves the way to computationally efficient lower and upper bounds on the ground state energy of large-scale quantum spin systems.}}, author = {{Huber, Felix and Thompson, Kevin and Parekh, Ojas and Gharibian, Sevag}}, booktitle = {{arXiv:2411.04120}}, title = {{{Second order cone relaxations for quantum Max Cut}}}, year = {{2024}}, } @article{48544, abstract = {{When it comes to NP, its natural definition, its wide applicability across scientific disciplines, and its timeless relevance, the writing is on the wall: There can be only one. Quantum NP, on the other hand, is clearly the apple that fell far from the tree of NP. Two decades since the first definitions of quantum NP started rolling in, quantum complexity theorists face a stark reality: There's QMA, QCMA, QMA1, QMA(2), StoqMA, and NQP. In this article aimed at a general theoretical computer science audience, I survey these various definitions of quantum NP, their strengths and weaknesses, and why most of them, for better or worse, actually appear to fit naturally into the complexity zoo.}}, author = {{Gharibian, Sevag}}, journal = {{ACM SIGACT News}}, number = {{4}}, pages = {{54--91}}, title = {{{Guest Column: The 7 faces of quantum NP}}}, volume = {{54}}, year = {{2024}}, } @inbook{65638, author = {{Gövert, Andre and Niederhaus, Constanze and Blumberg, Eva}}, booktitle = {{Mehrsprachigkeit in der Schule: Sprachbildung im und durch Sachunterricht}}, editor = {{Blumberg, Eva and Constanze, Niederhaus and Anne, Mischendahl}}, pages = {{295----309}}, publisher = {{Kohlhammer}}, title = {{{Professionalisierung für Sprachbildung aus Sicht von Sachunterrichtsstudierenden – Langzeitwirkungen eines Vertiefungsseminars in der ersten Phase der sachunterrichtsdidaktischen Lehrer*innenbildung. }}}, year = {{2024}}, } @misc{65649, booktitle = {{ Zeitschrift für Interkulturellen Fremdsprachenunterricht (ZIF) }}, editor = {{Drumm, Sandra and Niederhaus, Constanze}}, title = {{{(Mehr-)Sprachen-Bildung in beruflichen Kontexten}}}, volume = {{29}}, year = {{2024}}, } @misc{65648, author = {{Drumm, Sandra and Niederhaus, Constanze}}, publisher = {{LibreCat University}}, title = {{{Mehrsprachigkeit in der beruflichen Bildung: Einleitung in das Themenheft}}}, doi = {{10.48694/ZIF.3900}}, year = {{2024}}, } @inproceedings{56671, author = {{Illian, Marvin and Zinda, Christopher and Schlangenotto, Darius}}, booktitle = {{2024 IEEE International Conference on Industrial Technology (ICIT)}}, publisher = {{IEEE}}, title = {{{Data Store Architectures: Balancing Functionality and Performance}}}, doi = {{10.1109/icit58233.2024.10540811}}, year = {{2024}}, } @book{55175, author = {{Uhde, André and Paul, Stephan and Horsch, Andreas and Kaltofen, Daniel and Weiß, Gregor}}, isbn = {{978-3-7910-4633-4}}, pages = {{776}}, publisher = {{Schäffer-Poeschel}}, title = {{{Bankpolitik}}}, year = {{2024}}, } @article{55517, author = {{Rizos, Vasileios and Righetti, Edoardo and Kassab, Amin}}, issn = {{2352-4847}}, journal = {{Energy Reports}}, pages = {{1673--1682}}, publisher = {{Elsevier BV}}, title = {{{Understanding the barriers to recycling critical raw materials for the energy transition: The case of rare earth permanent magnets}}}, doi = {{10.1016/j.egyr.2024.07.022}}, volume = {{12}}, year = {{2024}}, } @inproceedings{65723, abstract = {{This study aims to investigate student spatial reasoning, thinking, strategies, interests, and challenges across four different countries in the context of collaborative group problem solving. The researchers used a problem solving scenario with groups of students that involved painting the outside of a cube, which was composed of 216 cubes (6 × 6 × 6). the four countries, findings were mostly consistent among the student collaborative groups with some variation of problem solving strategies employed. One challenge encountered across the research sites was student understanding of what the problem was asking. Overall, students were observed to be engaged and interested in this spatial reasoning problem solving scenario with some students expressing interest in having to visualize the exterior and interior cubes for the problem they were required to solve.}}, author = {{Stoppel, Hans-Jürgen and Arnal-Palacián, Monica and Catanuto, Roberto and Czarnocha, Bronislaw and Evans, Brian R. and Marciniak, Malgorzata Aneta and Shvartsberg, Yana}}, location = {{Sydney, Australia}}, title = {{{Strategies, interests, and challenges in a spatial problem solving in different scenarios}}}, year = {{2024}}, } @inproceedings{65720, author = {{Stoppel, Hans-Jürgen}}, editor = {{Ebers, Patrick and Rösken, Fabian and Barzel, Bärbel and Büchter, Andreas and Schacht, Florian and Scherer, Petra}}, location = {{Essen}}, publisher = {{Verlag für wissenschaftliche Texte und Medien}}, title = {{{MINT-Unterricht – undenkbar für Lehrkräfte ohne mathematisches Hintergrundwissen}}}, year = {{2024}}, } @inbook{62702, abstract = {{Clifford algebras are a natural extension of division algebras, including real numbers, complex numbers, quaternions, and octonions. Previous research in knowledge graph embeddings has focused exclusively on Clifford algebras of a specific type, which do not include nilpotent base vectors—elements that square to zero. In this work, we introduce a novel approach by incorporating nilpotent base vectors with a nilpotency index of two, leading to a more general form of Clifford algebras named degenerate Clifford algebras. This generalization to degenerate Clifford algebras does allow for covering dual numbers and as such include translations and rotations models under the same generalization paradigm for the first time. We develop two models to determine the parameters that define the algebra: one using a greedy search and another predicting the parameters based on neural network embeddings of the input knowledge graph. Our evaluation on seven benchmark datasets demonstrates that this incorporation of nilpotent vectors enhances the quality of embeddings. Additionally, our method outperforms state-of-the-art approaches in terms of generalization, particularly regarding the mean reciprocal rank achieved on validation data. Finally, we show that even a simple greedy search can effectively discover optimal or near-optimal parameters for the algebra.}}, author = {{Kamdem Teyou, Louis Mozart and Demir, Caglar and Ngonga Ngomo, Axel-Cyrille}}, booktitle = {{Frontiers in Artificial Intelligence and Applications}}, isbn = {{9781643685489}}, issn = {{0922-6389}}, location = {{Santiago de Compostela}}, publisher = {{IOS Press}}, title = {{{Embedding Knowledge Graphs in Degenerate Clifford Algebras}}}, doi = {{10.3233/faia240627}}, year = {{2024}}, } @inproceedings{62703, abstract = {{We introduce a novel embedding method diverging from conventional approaches by operating within function spaces of finite dimension rather than finite vector space, thus departing significantly from standard knowledge graph embedding techniques. Initially employing polynomial functions to compute embeddings, we progress to more intricate representations using neural networks with varying layer complexities. We argue that employing functions for embedding computation enhances expressiveness and allows for more degrees of freedom, enabling operations such as composition, derivatives and primitive of entities representation. Additionally, we meticulously outline the step-by-step construction of our approach and provide code for reproducibility, thereby facilitating further exploration and application in the field.}}, author = {{Kamdem Teyou, Louis Mozart and Demir, Caglar and Ngonga Ngomo, Axel-Cyrille}}, booktitle = {{Proceedings of the 33rd ACM International Conference on Information and Knowledge Management}}, location = {{Boise}}, publisher = {{ACM}}, title = {{{Embedding Knowledge Graphs in Function Spaces}}}, doi = {{10.1145/3627673.3679819}}, year = {{2024}}, } @article{65760, author = {{Ballweg, Sandra}}, journal = {{InfoDaF}}, number = {{6}}, pages = {{650--663}}, title = {{{Vielfalt, Erweiterung und ein Hauch von Mehrsprachigkeit – Eine subjektive Perspektive auf Entwicklungen im Fach Deutsch als Fremd- und Zweitsprache im Spiegel der InfoDaF in den Jahren 2010-2020}}}, volume = {{50}}, year = {{2024}}, } @inproceedings{54247, author = {{Berndt, Axel and Mauro, Davide Andrea}}, booktitle = {{Proceedings of the Sound and Music Computing Conference (SMC) 2024}}, publisher = {{Sound and Music Computing Network / Universidade do Porto}}, title = {{{Arpeggiatorum: An audio controllable MIDI arpeggiator}}}, year = {{2024}}, } @inproceedings{58552, author = {{Berndt, Axel and Bömcke-Vollmer, Frithjof and Münzmay, Andreas}}, booktitle = {{{Diskografentag: International Conference on Recorded Music}}}, title = {{{Multi-Modal Data Networks in Music: Thoughts on a Digital Performance Edition and its Potential for Ethnomusicology}}}, year = {{2024}}, } @inproceedings{58553, author = {{Berndt, Axel and Waloschek, S.}}, booktitle = {{{Edirom Summer School 2024}}}, title = {{{FlowScore: MEI Streaming to Digital Music Stands}}}, year = {{2024}}, } @article{55387, author = {{Schröer, Franz and Tenberge, Claudia}}, issn = {{0722-1843}}, journal = {{Lernen konkret - Sonderpädagogischer Schwerpunkt Geistige Entwicklung}}, number = {{3}}, publisher = {{westermann}}, title = {{{Was macht ein Roboter im Zoo? – Technisches Experimentieren inklusiv gestalten}}}, volume = {{43}}, year = {{2024}}, } @inproceedings{56322, author = {{Elit, Stefan}}, title = {{{Klopstock? Oder: wie ein Autorleben erzählt wird (seit fast 300 Jahren)}}}, doi = {{10.17619/UNIPB/1-2098}}, year = {{2024}}, } @misc{56439, author = {{Albus, Vanessa}}, booktitle = {{Zeitschrift für Didaktik der Philosophie und Ethik}}, pages = {{123}}, publisher = {{C.C.Buchner}}, title = {{{Review: Sandra Eleonore Johst: Kant als Lehrer der Aufklärung. Historische und systematische Verbindungslinien zum Pädagogischen. Paderborn: Brill/mentis 2022. 355 S.}}}, volume = {{1}}, year = {{2024}}, }