---
_id: '65021'
abstract:
- lang: eng
  text: 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:
- first_name: Frans
  full_name: Wiering, Frans
  last_name: Wiering
- first_name: Erik
  full_name: Bergwall, Erik
  last_name: Bergwall
- first_name: Marnix
  full_name: van Berchum, Marnix
  last_name: van Berchum
- first_name: Werner
  full_name: Goebl, Werner
  last_name: Goebl
- first_name: Peter
  full_name: Van Kranenburg, Peter
  last_name: Van Kranenburg
- first_name: David
  full_name: Lewis, David
  last_name: Lewis
- first_name: Anna Viktoria Katrin
  full_name: Plaksin, Anna Viktoria Katrin
  id: '102981'
  last_name: Plaksin
  orcid: 0000-0002-9969-0608
- first_name: Esperanza
  full_name: Rodríguez-García, Esperanza
  last_name: Rodríguez-García
- first_name: David J.
  full_name: Smith, David J.
  last_name: Smith
- first_name: Mirjam
  full_name: Visscher, Mirjam
  last_name: Visscher
- first_name: David M.
  full_name: Weigl, David M.
  last_name: Weigl
citation:
  ama: 'Wiering F, Bergwall E, van Berchum M, et al. <i>Making Corpus Creation in
    Early Music Rewarding and Effective: Finding the Optimum Between Standardisation
    and Autonomy</i>.; 2026. doi:<a href="https://doi.org/10.5281/zenodo.18413961">10.5281/zenodo.18413961</a>'
  apa: 'Wiering, F., Bergwall, E., van Berchum, M., Goebl, W., Van Kranenburg, P.,
    Lewis, D., Plaksin, A. V. K., Rodríguez-García, E., Smith, D. J., Visscher, M.,
    &#38; Weigl, D. M. (2026). <i>Making Corpus Creation in Early Music Rewarding
    and Effective: Finding the Optimum Between Standardisation and Autonomy</i>. <a
    href="https://doi.org/10.5281/zenodo.18413961">https://doi.org/10.5281/zenodo.18413961</a>'
  bibtex: '@book{Wiering_Bergwall_van Berchum_Goebl_Van Kranenburg_Lewis_Plaksin_Rodríguez-García_Smith_Visscher_et
    al._2026, title={Making Corpus Creation in Early Music Rewarding and Effective:
    Finding the Optimum Between Standardisation and Autonomy}, DOI={<a href="https://doi.org/10.5281/zenodo.18413961">10.5281/zenodo.18413961</a>},
    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 et al.},
    year={2026} }'
  chicago: 'Wiering, Frans, Erik Bergwall, Marnix van Berchum, Werner Goebl, Peter
    Van Kranenburg, David Lewis, Anna Viktoria Katrin Plaksin, et al. <i>Making Corpus
    Creation in Early Music Rewarding and Effective: Finding the Optimum Between Standardisation
    and Autonomy</i>, 2026. <a href="https://doi.org/10.5281/zenodo.18413961">https://doi.org/10.5281/zenodo.18413961</a>.'
  ieee: 'F. Wiering <i>et al.</i>, <i>Making Corpus Creation in Early Music Rewarding
    and Effective: Finding the Optimum Between Standardisation and Autonomy</i>. 2026.'
  mla: 'Wiering, Frans, et al. <i>Making Corpus Creation in Early Music Rewarding
    and Effective: Finding the Optimum Between Standardisation and Autonomy</i>. 2026,
    doi:<a href="https://doi.org/10.5281/zenodo.18413961">10.5281/zenodo.18413961</a>.'
  short: 'F. Wiering, E. Bergwall, M. van Berchum, W. Goebl, P. Van Kranenburg, D.
    Lewis, A.V.K. Plaksin, E. Rodríguez-García, D.J. Smith, M. Visscher, D.M. Weigl,
    Making Corpus Creation in Early Music Rewarding and Effective: Finding the Optimum
    Between Standardisation and Autonomy, 2026.'
date_created: 2026-03-17T10:25:37Z
date_updated: 2026-03-17T10:30:41Z
department:
- _id: '872'
doi: 10.5281/zenodo.18413961
keyword:
- citizen science
- crowdsourcing
- digital editions of music
- early music
- human computer interaction
- music corpora
- music encoding
- musicology
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://zenodo.org/records/18413961
oa: '1'
status: public
title: 'Making Corpus Creation in Early Music Rewarding and Effective: Finding the
  Optimum Between Standardisation and Autonomy'
type: report
user_id: '102981'
year: '2026'
...
---
_id: '55850'
abstract:
- lang: eng
  text: 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:
- first_name: Johannes
  full_name: Kepper, Johannes
  last_name: Kepper
citation:
  ama: 'Kepper J. <i>DomesticBeethoven/Bith-Annotator: Release 2023-04</i>. Zenodo;
    2023. doi:<a href="https://doi.org/10.5281/ZENODO.7877741">10.5281/ZENODO.7877741</a>'
  apa: 'Kepper, J. (2023). <i>DomesticBeethoven/bith-annotator: Release 2023-04</i>.
    Zenodo. <a href="https://doi.org/10.5281/ZENODO.7877741">https://doi.org/10.5281/ZENODO.7877741</a>'
  bibtex: '@book{Kepper_2023, title={DomesticBeethoven/bith-annotator: Release 2023-04},
    DOI={<a href="https://doi.org/10.5281/ZENODO.7877741">10.5281/ZENODO.7877741</a>},
    publisher={Zenodo}, author={Kepper, Johannes}, year={2023} }'
  chicago: 'Kepper, Johannes. <i>DomesticBeethoven/Bith-Annotator: Release 2023-04</i>.
    Zenodo, 2023. <a href="https://doi.org/10.5281/ZENODO.7877741">https://doi.org/10.5281/ZENODO.7877741</a>.'
  ieee: 'J. Kepper, <i>DomesticBeethoven/bith-annotator: Release 2023-04</i>. Zenodo,
    2023.'
  mla: 'Kepper, Johannes. <i>DomesticBeethoven/Bith-Annotator: Release 2023-04</i>.
    Zenodo, 2023, doi:<a href="https://doi.org/10.5281/ZENODO.7877741">10.5281/ZENODO.7877741</a>.'
  short: 'J. Kepper, DomesticBeethoven/Bith-Annotator: Release 2023-04, Zenodo, 2023.'
date_created: 2024-08-28T11:48:31Z
date_updated: 2024-08-28T13:59:52Z
department:
- _id: '874'
doi: 10.5281/ZENODO.7877741
keyword:
- MEI
- Edirom
- Music Encoding Initiative
- Linked Open Data
- MELD
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://zenodo.org/record/7877741
oa: '1'
publication_status: published
publisher: Zenodo
status: public
title: 'DomesticBeethoven/bith-annotator: Release 2023-04'
type: misc
user_id: '1684'
year: '2023'
...
---
_id: '55835'
abstract:
- lang: eng
  text: 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:
- first_name: Lisa
  full_name: Rosendahl, Lisa
  last_name: Rosendahl
citation:
  ama: 'Rosendahl L. <i>Beethoven in the House: Selective Encodings of Arrangements
    of Beethoven’s Opp. 91, 92, and 93.</i> Zenodo; 2023. doi:<a href="https://doi.org/10.5281/ZENODO.7875059">10.5281/ZENODO.7875059</a>'
  apa: 'Rosendahl, L. (2023). <i>Beethoven in the House: Selective Encodings of Arrangements
    of Beethoven’s opp. 91, 92, and 93.</i> Zenodo. <a href="https://doi.org/10.5281/ZENODO.7875059">https://doi.org/10.5281/ZENODO.7875059</a>'
  bibtex: '@book{Rosendahl_2023, title={Beethoven in the House: Selective Encodings
    of Arrangements of Beethoven’s opp. 91, 92, and 93.}, DOI={<a href="https://doi.org/10.5281/ZENODO.7875059">10.5281/ZENODO.7875059</a>},
    publisher={Zenodo}, author={Rosendahl, Lisa}, year={2023} }'
  chicago: 'Rosendahl, Lisa. <i>Beethoven in the House: Selective Encodings of Arrangements
    of Beethoven’s Opp. 91, 92, and 93.</i> Zenodo, 2023. <a href="https://doi.org/10.5281/ZENODO.7875059">https://doi.org/10.5281/ZENODO.7875059</a>.'
  ieee: 'L. Rosendahl, <i>Beethoven in the House: Selective Encodings of Arrangements
    of Beethoven’s opp. 91, 92, and 93.</i> Zenodo, 2023.'
  mla: 'Rosendahl, Lisa. <i>Beethoven in the House: Selective Encodings of Arrangements
    of Beethoven’s Opp. 91, 92, and 93.</i> Zenodo, 2023, doi:<a href="https://doi.org/10.5281/ZENODO.7875059">10.5281/ZENODO.7875059</a>.'
  short: 'L. Rosendahl, Beethoven in the House: Selective Encodings of Arrangements
    of Beethoven’s Opp. 91, 92, and 93., Zenodo, 2023.'
date_created: 2024-08-28T11:43:11Z
date_updated: 2024-08-28T14:09:28Z
department:
- _id: '874'
doi: 10.5281/ZENODO.7875059
keyword:
- BitH
- Dataset
- Domestic Music Arrangements
- Ludwig van Beethoven
- MEI
- Music Encoding Initiative
publisher: Zenodo
status: public
title: 'Beethoven in the House: Selective Encodings of Arrangements of Beethoven’s
  opp. 91, 92, and 93.'
type: research_data
user_id: '1684'
year: '2023'
...
---
_id: '2109'
abstract:
- lang: eng
  text: 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:
- first_name: Marcel Dominik
  full_name: Wever, Marcel Dominik
  id: '33176'
  last_name: Wever
  orcid: ' https://orcid.org/0000-0001-9782-6818'
- first_name: Felix
  full_name: Mohr, Felix
  last_name: Mohr
- first_name: Eyke
  full_name: Hüllermeier, Eyke
  id: '48129'
  last_name: Hüllermeier
citation:
  ama: 'Wever MD, Mohr F, Hüllermeier E. Ensembles of Evolved Nested Dichotomies for
    Classification. In: <i>Proceedings of the Genetic and Evolutionary Computation
    Conference, GECCO 2018, Kyoto, Japan, July 15-19, 2018</i>. Kyoto, Japan: ACM;
    2018. doi:<a href="https://doi.org/10.1145/3205455.3205562">10.1145/3205455.3205562</a>'
  apa: 'Wever, M. D., Mohr, F., &#38; Hüllermeier, E. (2018). Ensembles of Evolved
    Nested Dichotomies for Classification. In <i>Proceedings of the Genetic and Evolutionary
    Computation Conference, GECCO 2018, Kyoto, Japan, July 15-19, 2018</i>. Kyoto,
    Japan: ACM. <a href="https://doi.org/10.1145/3205455.3205562">https://doi.org/10.1145/3205455.3205562</a>'
  bibtex: '@inproceedings{Wever_Mohr_Hüllermeier_2018, place={Kyoto, Japan}, title={Ensembles
    of Evolved Nested Dichotomies for Classification}, DOI={<a href="https://doi.org/10.1145/3205455.3205562">10.1145/3205455.3205562</a>},
    booktitle={Proceedings of the Genetic and Evolutionary Computation Conference,
    GECCO 2018, Kyoto, Japan, July 15-19, 2018}, publisher={ACM}, author={Wever, Marcel
    Dominik and Mohr, Felix and Hüllermeier, Eyke}, year={2018} }'
  chicago: 'Wever, Marcel Dominik, Felix Mohr, and Eyke Hüllermeier. “Ensembles of
    Evolved Nested Dichotomies for Classification.” In <i>Proceedings of the Genetic
    and Evolutionary Computation Conference, GECCO 2018, Kyoto, Japan, July 15-19,
    2018</i>. Kyoto, Japan: ACM, 2018. <a href="https://doi.org/10.1145/3205455.3205562">https://doi.org/10.1145/3205455.3205562</a>.'
  ieee: M. D. Wever, F. Mohr, and E. Hüllermeier, “Ensembles of Evolved Nested Dichotomies
    for Classification,” in <i>Proceedings of the Genetic and Evolutionary Computation
    Conference, GECCO 2018, Kyoto, Japan, July 15-19, 2018</i>, Kyoto, Japan, 2018.
  mla: Wever, Marcel Dominik, et al. “Ensembles of Evolved Nested Dichotomies for
    Classification.” <i>Proceedings of the Genetic and Evolutionary Computation Conference,
    GECCO 2018, Kyoto, Japan, July 15-19, 2018</i>, ACM, 2018, doi:<a href="https://doi.org/10.1145/3205455.3205562">10.1145/3205455.3205562</a>.
  short: 'M.D. Wever, F. Mohr, E. Hüllermeier, in: Proceedings of the Genetic and
    Evolutionary Computation Conference, GECCO 2018, Kyoto, Japan, July 15-19, 2018,
    ACM, Kyoto, Japan, 2018.'
conference:
  end_date: 2018-07-19
  location: Kyoto, Japan
  name: GECCO 2018
  start_date: 2018-07-15
date_created: 2018-03-31T13:51:23Z
date_updated: 2022-01-06T06:54:45Z
ddc:
- '000'
department:
- _id: '355'
doi: 10.1145/3205455.3205562
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2018-11-02T14:33:54Z
  date_updated: 2018-11-02T14:33:54Z
  file_id: '5275'
  file_name: p561-wever.pdf
  file_size: 875404
  relation: main_file
  success: 1
file_date_updated: 2018-11-02T14:33:54Z
has_accepted_license: '1'
keyword:
- Classification
- Hierarchical Decomposition
- Indirect Encoding
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://dl.acm.org/citation.cfm?doid=3205455.3205562
oa: '1'
place: Kyoto, Japan
project:
- _id: '1'
  name: SFB 901
- _id: '3'
  name: SFB 901 - Project Area B
- _id: '10'
  name: SFB 901 - Subproject B2
- _id: '52'
  name: Computing Resources Provided by the Paderborn Center for Parallel Computing
publication: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO
  2018, Kyoto, Japan, July 15-19, 2018
publication_status: published
publisher: ACM
status: public
title: Ensembles of Evolved Nested Dichotomies for Classification
type: conference
user_id: '33176'
year: '2018'
...
---
_id: '20543'
author:
- first_name: Lisa
  full_name: Nguyen Quang Do, Lisa
  last_name: Nguyen Quang Do
- first_name: Stefan
  full_name: Krüger, Stefan
  last_name: Krüger
- first_name: Patrick
  full_name: Hill, Patrick
  last_name: Hill
- first_name: Karim
  full_name: Ali, Karim
  last_name: Ali
- first_name: Eric
  full_name: Bodden, Eric
  id: '59256'
  last_name: Bodden
  orcid: 0000-0003-3470-3647
citation:
  ama: Nguyen Quang Do L, Krüger S, Hill P, Ali K, Bodden E. Debugging Static Analysis.
    <i>IEEE Transactions on Software Engineering</i>. Published online 2018:1-1. doi:<a
    href="https://doi.org/10.1109/TSE.2018.2868349">10.1109/TSE.2018.2868349</a>
  apa: Nguyen Quang Do, L., Krüger, S., Hill, P., Ali, K., &#38; Bodden, E. (2018).
    Debugging Static Analysis. <i>IEEE Transactions on Software Engineering</i>, 1–1.
    <a href="https://doi.org/10.1109/TSE.2018.2868349">https://doi.org/10.1109/TSE.2018.2868349</a>
  bibtex: '@article{Nguyen Quang Do_Krüger_Hill_Ali_Bodden_2018, title={Debugging
    Static Analysis}, DOI={<a href="https://doi.org/10.1109/TSE.2018.2868349">10.1109/TSE.2018.2868349</a>},
    journal={IEEE Transactions on Software Engineering}, author={Nguyen Quang Do,
    Lisa and Krüger, Stefan and Hill, Patrick and Ali, Karim and Bodden, Eric}, year={2018},
    pages={1–1} }'
  chicago: Nguyen Quang Do, Lisa, Stefan Krüger, Patrick Hill, Karim Ali, and Eric
    Bodden. “Debugging Static Analysis.” <i>IEEE Transactions on Software Engineering</i>,
    2018, 1–1. <a href="https://doi.org/10.1109/TSE.2018.2868349">https://doi.org/10.1109/TSE.2018.2868349</a>.
  ieee: 'L. Nguyen Quang Do, S. Krüger, P. Hill, K. Ali, and E. Bodden, “Debugging
    Static Analysis,” <i>IEEE Transactions on Software Engineering</i>, pp. 1–1, 2018,
    doi: <a href="https://doi.org/10.1109/TSE.2018.2868349">10.1109/TSE.2018.2868349</a>.'
  mla: Nguyen Quang Do, Lisa, et al. “Debugging Static Analysis.” <i>IEEE Transactions
    on Software Engineering</i>, 2018, pp. 1–1, doi:<a href="https://doi.org/10.1109/TSE.2018.2868349">10.1109/TSE.2018.2868349</a>.
  short: L. Nguyen Quang Do, S. Krüger, P. Hill, K. Ali, E. Bodden, IEEE Transactions
    on Software Engineering (2018) 1–1.
date_created: 2020-11-30T09:32:12Z
date_updated: 2022-01-06T06:54:29Z
department:
- _id: '76'
doi: 10.1109/TSE.2018.2868349
keyword:
- Debugging
- Static analysis
- Tools
- Computer bugs
- Standards
- Writing
- Encoding
- Testing and Debugging
- Program analysis
- Development tools
- Integrated environments
- Graphical environments
- Usability testing
language:
- iso: eng
main_file_link:
- url: http://www.bodden.de/pubs/tse18debugging.pdf
page: 1-1
publication: IEEE Transactions on Software Engineering
publication_identifier:
  issn:
  - 2326-3881
status: public
title: Debugging Static Analysis
type: journal_article
user_id: '5786'
year: '2018'
...
---
_id: '48857'
abstract:
- lang: eng
  text: '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:
- first_name: Jakob
  full_name: Bossek, Jakob
  id: '102979'
  last_name: Bossek
  orcid: 0000-0002-4121-4668
- first_name: Christian
  full_name: Grimme, Christian
  last_name: Grimme
citation:
  ama: 'Bossek J, Grimme C. A Pareto-Beneficial Sub-Tree Mutation for the Multi-Criteria
    Minimum Spanning Tree Problem. In: <i>2017 IEEE Symposium Series on Computational
    Intelligence (SSCI)</i>. ; 2017:1–8. doi:<a href="https://doi.org/10.1109/SSCI.2017.8285183">10.1109/SSCI.2017.8285183</a>'
  apa: Bossek, J., &#38; Grimme, C. (2017). A Pareto-Beneficial Sub-Tree Mutation
    for the Multi-Criteria Minimum Spanning Tree Problem. <i>2017 IEEE Symposium Series
    on Computational Intelligence (SSCI)</i>, 1–8. <a href="https://doi.org/10.1109/SSCI.2017.8285183">https://doi.org/10.1109/SSCI.2017.8285183</a>
  bibtex: '@inproceedings{Bossek_Grimme_2017, title={A Pareto-Beneficial Sub-Tree
    Mutation for the Multi-Criteria Minimum Spanning Tree Problem}, DOI={<a href="https://doi.org/10.1109/SSCI.2017.8285183">10.1109/SSCI.2017.8285183</a>},
    booktitle={2017 IEEE Symposium Series on Computational Intelligence (SSCI)}, author={Bossek,
    Jakob and Grimme, Christian}, year={2017}, pages={1–8} }'
  chicago: Bossek, Jakob, and Christian Grimme. “A Pareto-Beneficial Sub-Tree Mutation
    for the Multi-Criteria Minimum Spanning Tree Problem.” In <i>2017 IEEE Symposium
    Series on Computational Intelligence (SSCI)</i>, 1–8, 2017. <a href="https://doi.org/10.1109/SSCI.2017.8285183">https://doi.org/10.1109/SSCI.2017.8285183</a>.
  ieee: 'J. Bossek and C. Grimme, “A Pareto-Beneficial Sub-Tree Mutation for the Multi-Criteria
    Minimum Spanning Tree Problem,” in <i>2017 IEEE Symposium Series on Computational
    Intelligence (SSCI)</i>, 2017, pp. 1–8, doi: <a href="https://doi.org/10.1109/SSCI.2017.8285183">10.1109/SSCI.2017.8285183</a>.'
  mla: Bossek, Jakob, and Christian Grimme. “A Pareto-Beneficial Sub-Tree Mutation
    for the Multi-Criteria Minimum Spanning Tree Problem.” <i>2017 IEEE Symposium
    Series on Computational Intelligence (SSCI)</i>, 2017, pp. 1–8, doi:<a href="https://doi.org/10.1109/SSCI.2017.8285183">10.1109/SSCI.2017.8285183</a>.
  short: 'J. Bossek, C. Grimme, in: 2017 IEEE Symposium Series on Computational Intelligence
    (SSCI), 2017, pp. 1–8.'
date_created: 2023-11-14T15:58:54Z
date_updated: 2023-12-13T10:44:28Z
department:
- _id: '819'
doi: 10.1109/SSCI.2017.8285183
extern: '1'
keyword:
- Convergence
- Encoding
- Euclidean distance
- Evolutionary computation
- Heating systems
- Optimization
- Standards
language:
- iso: eng
page: 1–8
publication: 2017 IEEE Symposium Series on Computational Intelligence (SSCI)
publication_status: published
status: public
title: A Pareto-Beneficial Sub-Tree Mutation for the Multi-Criteria Minimum Spanning
  Tree Problem
type: conference
user_id: '102979'
year: '2017'
...
---
_id: '6080'
abstract:
- lang: eng
  text: 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:
- first_name: Jan
  full_name: Tünnermann, Jan
  last_name: Tünnermann
- first_name: Ingrid
  full_name: Scharlau, Ingrid
  id: '451'
  last_name: Scharlau
  orcid: 0000-0003-2364-9489
citation:
  ama: 'Tünnermann J, Scharlau I. Peripheral visual cues: Their fate in processing
    and effects on attention and temporal-order perception. <i>Frontiers in Psychology</i>.
    2016;7. doi:<a href="https://doi.org/10.3389/fpsyg.2016.01442">10.3389/fpsyg.2016.01442</a>'
  apa: 'Tünnermann, J., &#38; Scharlau, I. (2016). Peripheral visual cues: Their fate
    in processing and effects on attention and temporal-order perception. <i>Frontiers
    in Psychology</i>, <i>7</i>. <a href="https://doi.org/10.3389/fpsyg.2016.01442">https://doi.org/10.3389/fpsyg.2016.01442</a>'
  bibtex: '@article{Tünnermann_Scharlau_2016, title={Peripheral visual cues: Their
    fate in processing and effects on attention and temporal-order perception.}, volume={7},
    DOI={<a href="https://doi.org/10.3389/fpsyg.2016.01442">10.3389/fpsyg.2016.01442</a>},
    journal={Frontiers in Psychology}, author={Tünnermann, Jan and Scharlau, Ingrid},
    year={2016} }'
  chicago: 'Tünnermann, Jan, and Ingrid Scharlau. “Peripheral Visual Cues: Their Fate
    in Processing and Effects on Attention and Temporal-Order Perception.” <i>Frontiers
    in Psychology</i> 7 (2016). <a href="https://doi.org/10.3389/fpsyg.2016.01442">https://doi.org/10.3389/fpsyg.2016.01442</a>.'
  ieee: 'J. Tünnermann and I. Scharlau, “Peripheral visual cues: Their fate in processing
    and effects on attention and temporal-order perception.,” <i>Frontiers in Psychology</i>,
    vol. 7, 2016, doi: <a href="https://doi.org/10.3389/fpsyg.2016.01442">10.3389/fpsyg.2016.01442</a>.'
  mla: 'Tünnermann, Jan, and Ingrid Scharlau. “Peripheral Visual Cues: Their Fate
    in Processing and Effects on Attention and Temporal-Order Perception.” <i>Frontiers
    in Psychology</i>, vol. 7, 2016, doi:<a href="https://doi.org/10.3389/fpsyg.2016.01442">10.3389/fpsyg.2016.01442</a>.'
  short: J. Tünnermann, I. Scharlau, Frontiers in Psychology 7 (2016).
date_created: 2018-12-10T07:06:09Z
date_updated: 2022-06-06T16:29:50Z
department:
- _id: '424'
doi: 10.3389/fpsyg.2016.01442
intvolume: '         7'
keyword:
- cueing
- temporal-order judgements
- theory of visual attention (TVA)
- peripheral cue
- processing speed
- stimulus encoding
- prior entry
- Attention
- Cues
- Face Perception
- Judgment
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://www.frontiersin.org/articles/10.3389/fpsyg.2016.01442/full
oa: '1'
publication: Frontiers in Psychology
publication_identifier:
  issn:
  - 1664-1078
publication_status: published
status: public
title: 'Peripheral visual cues: Their fate in processing and effects on attention
  and temporal-order perception.'
type: journal_article
user_id: '42165'
volume: 7
year: '2016'
...
