@techreport{65021,
  abstract     = {{Several early music projects, such as the Stanford Josquin Project, have demonstrated the potential for attaining valuable new musicological insights using a corpus-based approach. However, the available musical corpora tend to be relatively small and exhibit considerable variation in encoding practices. Aspiring corpus researchers are confronted with a lack of suitable data, which needs to be addressed before they can embark on their proper research. The EarlyMuse Short Term Scientific Mission CORSICA has surveyed the current state of corpus creation and digital editing in early music. Based on this information, it has developed a vision for the future of corpus building in this field, which aims to speed up the production of digital encodings while respecting the autonomy of the encoders and acknowledging their efforts. This is important because much high-quality encoding is carried out outside the field of professional musicology, and engaging citizen scientists could help address the current shortage of research data. The CORSICA team‘s vision is informed not only by a study of the available data, standards and technologies, but also by Human-Computer Interaction, placing human goals and values before the creation of technology and work processes. The core of the vision is that successful corpus creation must be an inclusive endeavour in terms of both technology and human participation. The report concludes with an implementation plan outlining the initial steps required to realise the vision.}},
  author       = {{Wiering, Frans and Bergwall, Erik and van Berchum, Marnix and Goebl, Werner and Van Kranenburg, Peter and Lewis, David and Plaksin, Anna Viktoria Katrin and Rodríguez-García, Esperanza and Smith, David J. and Visscher, Mirjam and Weigl, David M.}},
  keywords     = {{citizen science, crowdsourcing, digital editions of music, early music, human computer interaction, music corpora, music encoding, musicology}},
  title        = {{{Making Corpus Creation in Early Music Rewarding and Effective: Finding the Optimum Between Standardisation and Autonomy}}},
  doi          = {{10.5281/zenodo.18413961}},
  year         = {{2026}},
}

@misc{55850,
  abstract     = {{This release covers the state of this prototype app at the end of the funding phase for the Paderborn University part of the Beethoven in the House project. It uses https://api.domestic-beethoven.eu/ld/BithCollection.jsonld as starting point for traversing the LOD graph, and reads data from the project pod available from https://bith.solidcommunity.net/public/bith.ttl (which has no content at the time of the release).}},
  author       = {{Kepper, Johannes}},
  keywords     = {{MEI, Edirom, Music Encoding Initiative, Linked Open Data, MELD}},
  publisher    = {{Zenodo}},
  title        = {{{DomesticBeethoven/bith-annotator: Release 2023-04}}},
  doi          = {{10.5281/ZENODO.7877741}},
  year         = {{2023}},
}

@misc{55835,
  abstract     = {{This dataset contains selective MEI encodings of a number of arrangements of Beethoven’s Opp. 91, 92, and 93. These encodings were prepared in the context of the Beethoven in the House project, jointly funded by AHRC and DFG from 2020 to 2023. It is a slight update on v1.0.0 in better organizing the release assets.}},
  author       = {{Rosendahl, Lisa}},
  keywords     = {{BitH, Dataset, Domestic Music Arrangements, Ludwig van Beethoven, MEI, Music Encoding Initiative}},
  publisher    = {{Zenodo}},
  title        = {{{Beethoven in the House: Selective Encodings of Arrangements of Beethoven’s opp. 91, 92, and 93.}}},
  doi          = {{10.5281/ZENODO.7875059}},
  year         = {{2023}},
}

@inproceedings{2109,
  abstract     = {{In multinomial classification, reduction techniques are commonly used to decompose the original learning problem into several simpler problems. For example, by recursively bisecting the original set of classes, so-called nested dichotomies define a set of binary classification problems that are organized in the structure of a binary tree. In contrast to the existing one-shot heuristics for constructing nested dichotomies and motivated by recent work on algorithm configuration, we propose a genetic algorithm for optimizing the structure of such dichotomies. A key component of this approach is the proposed genetic representation that facilitates the application of standard genetic operators, while still supporting the exchange of partial solutions under recombination. We evaluate the approach in an extensive experimental study, showing that it yields classifiers with superior generalization performance.}},
  author       = {{Wever, Marcel Dominik and Mohr, Felix and Hüllermeier, Eyke}},
  booktitle    = {{Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2018, Kyoto, Japan, July 15-19, 2018}},
  keywords     = {{Classification, Hierarchical Decomposition, Indirect Encoding}},
  location     = {{Kyoto, Japan}},
  publisher    = {{ACM}},
  title        = {{{Ensembles of Evolved Nested Dichotomies for Classification}}},
  doi          = {{10.1145/3205455.3205562}},
  year         = {{2018}},
}

@article{20543,
  author       = {{Nguyen Quang Do, Lisa and Krüger, Stefan and Hill, Patrick and Ali, Karim and Bodden, Eric}},
  issn         = {{2326-3881}},
  journal      = {{IEEE Transactions on Software Engineering}},
  keywords     = {{Debugging, Static analysis, Tools, Computer bugs, Standards, Writing, Encoding, Testing and Debugging, Program analysis, Development tools, Integrated environments, Graphical environments, Usability testing}},
  pages        = {{1--1}},
  title        = {{{Debugging Static Analysis}}},
  doi          = {{10.1109/TSE.2018.2868349}},
  year         = {{2018}},
}

@inproceedings{48857,
  abstract     = {{While finding minimum-cost spanning trees (MST) in undirected graphs is solvable in polynomial time, the multi-criteria minimum spanning tree problem (mcMST) is NP-hard. Interestingly, the mcMST problem has not been in focus of evolutionary computation research for a long period of time, although, its relevance for real world problems is easy to see. The available and most notable approaches by Zhou and Gen as well as by Knowles and Corne concentrate on solution encoding and on fairly dated selection mechanisms. In this work, we revisit the mcMST and focus on the mutation operators as exploratory components of evolutionary algorithms neglected so far. We investigate optimal solution characteristics to discuss current mutation strategies, identify shortcomings of these operators, and propose a sub-tree based operator which offers what we term Pareto-beneficial behavior: ensuring convergence and diversity at the same time. The operator is empirically evaluated inside modern standard evolutionary meta-heuristics for multi-criteria optimization and compared to hitherto applied mutation operators in the context of mcMST.}},
  author       = {{Bossek, Jakob and Grimme, Christian}},
  booktitle    = {{2017 IEEE Symposium Series on Computational Intelligence (SSCI)}},
  keywords     = {{Convergence, Encoding, Euclidean distance, Evolutionary computation, Heating systems, Optimization, Standards}},
  pages        = {{1–8}},
  title        = {{{A Pareto-Beneficial Sub-Tree Mutation for the Multi-Criteria Minimum Spanning Tree Problem}}},
  doi          = {{10.1109/SSCI.2017.8285183}},
  year         = {{2017}},
}

@article{6080,
  abstract     = {{Peripheral visual cues lead to large shifts in psychometric distributions of temporal-order judgments. In one view, such shifts are attributed to attention speeding up processing of the cued stimulus, so-called prior entry. However, sometimes these shifts are so large that it is unlikely that they are caused by attention alone. Here we tested the prevalent alternative explanation that the cue is sometimes confused with the target on a perceptual level, bolstering the shift of the psychometric function. We applied a novel model of cued temporal-order judgments, derived from Bundesen’s Theory of Visual Attention.We found that cue–target confusions indeed contribute to shifting psychometric functions. However, cue-induced changes in the processing rates of the target stimuli play an important role, too. At smaller cueing intervals, the cue increased the processing speed of the target. At larger intervals, inhibition of return was predominant. Earlier studies of cued TOJs were insensitive}},
  author       = {{Tünnermann, Jan and Scharlau, Ingrid}},
  issn         = {{1664-1078}},
  journal      = {{Frontiers in Psychology}},
  keywords     = {{cueing, temporal-order judgements, theory of visual attention (TVA), peripheral cue, processing speed, stimulus encoding, prior entry, Attention, Cues, Face Perception, Judgment}},
  title        = {{{Peripheral visual cues: Their fate in processing and effects on attention and temporal-order perception.}}},
  doi          = {{10.3389/fpsyg.2016.01442}},
  volume       = {{7}},
  year         = {{2016}},
}