Matthew Forshaw
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Matthew Forshaw has a total of 137 co-authors. Here are the top co-authors by number of shared publications:
A. Stephen McGough
Newcastle University - UK
14 shared publicationsNigel Thomas
9 shared publications- Andrew Stephen McGough
School of Computing Newcastle University Newcastle upon Tyne UK
7 shared publications - Alex Chao
University of California, San Diego, La Jolla, CA, USA
3 shared publications - Amir Atapour-Abarghouei
Durham University
3 shared publications Clive Gerrard
3 shared publications
Latest Publications
- Open Access
- 16 November 2026
- Published by Public Library of Science (PLoS) in PLOS Computational Biology
- Vol. 22 (11) , e1014922
Ten simple rules for creating and maintaining FAIR competency frameworks
In a modern skills-based economy, competency frameworks are essential tools for workforce planning, career progression, and professional development. However, traditional frameworks often exist as static, isolated documents that lack digital connectivity and machine-readability. This article introduces a strategic roadmap to modernise professional standards by applying the FAIR principles: making competency frameworks Findable, Accessible, Interoperable, and Reusable. We present the FAIR competency framework lifecycle, an iterative model centred on end-user engagement, and outline 10 simple rules to guide creators through every stage of development. These rules cover foundational definitions, clear language, persistent identifiers, permissive licensing, and robust governance. By turning frameworks into machine-actionable digital objects, organisations can ensure their standards are easily discoverable, reusable, and ready to integrate into broader learning management systems. Ultimately, adopting these guidelines promotes a more interconnected, transparent, and adaptable global skills landscape where professional expertise can be recognised and shared efficiently.
- 16 November 2026
- Published by Public Library of Science (PLoS) in PLOS Computational Biology
- Vol. 22 (11) , e1014922
Open AccessTen simple rules for creating and maintaining FAIR competency frameworks
In a modern skills-based economy, competency frameworks are essential tools for workforce planning, career progression, and professional development. However, traditional frameworks often exist as static, isolated documents that lack digital connectivity and machine-readability. This article introduces a strategic roadmap to modernise professional standards by applying the FAIR principles: making competency frameworks Findable, Accessible, Interoperable, and Reusable. We present the FAIR competency framework lifecycle, an iterative model centred on end-user engagement, and outline 10 simple rules to guide creators through every stage of development. These rules cover foundational definitions, clear language, persistent identifiers, permissive licensing, and robust governance. By turning frameworks into machine-actionable digital objects, organisations can ensure their standards are easily discoverable, reusable, and ready to integrate into broader learning management systems. Ultimately, adopting these guidelines promotes a more interconnected, transparent, and adaptable global skills landscape where professional expertise can be recognised and shared efficiently.
- Open Access
- 11 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 393-399
The Computing Dissertation: Lessons from a UK Practitioner Network
- 11 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 393-399
Open AccessThe Computing Dissertation: Lessons from a UK Practitioner Network
- Open Access
- 11 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 733-735
Current Practices and Emerging Trends of the Teaching Assistant Role in Computing Education
- 11 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 733-735
Open AccessCurrent Practices and Emerging Trends of the Teaching Assistant Role in Computing Education
- Open Access
- 9 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 408-414
A National Competency Framework for AI Skills across Education and the Workforce
- 9 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 408-414
Open AccessA National Competency Framework for AI Skills across Education and the Workforce
- Open Access
- 3 May 2026
- Published by Association for Computing Machinery (ACM)
- p. 244-253
Monitor, Mitigate, Moderate: Backpressure in Stream Benchmark Generators
- 3 May 2026
- Published by Association for Computing Machinery (ACM)
- p. 244-253
Open AccessMonitor, Mitigate, Moderate: Backpressure in Stream Benchmark Generators
- Open Access
- 27 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 217-276
Fairness in Student Group Formation: Perspectives, Priorities, Compromises, Mechanisms, and Tooling
- 27 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 217-276
Open AccessFairness in Student Group Formation: Perspectives, Priorities, Compromises, Mechanisms, and Tooling
- Open Access
- 13 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 699-700
Fairness in Student Allocation and Group Formation
- 13 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 699-700
Open AccessFairness in Student Allocation and Group Formation
- Open Access
- 11 April 2025
- Published by Association for the Advancement of Artificial Intelligence (AAAI) in Proceedings of the AAAI Conference on Artificial Intelligence
- Vol. 39 (27) , 27989-27997
Constraint Optimisation Approaches for Designing Group-Living Captive Breeding Programmes
Captive breeding programs play a critical role in combating the ongoing biodiversity crisis by preserving the most endangered species and supporting reintroduction efforts. Maintaining the genetic health of captive populations requires careful management to prevent inbreeding and maximize the effective population size. Decisions about which males and females should be bred together are guided by the principle of minimizing relatedness between pairs. Methods to select breeding pairs are well developed, however, some species' ecology requires them to live in groups, and evaluating optimal groupings of multiple males and females that would be suitable to breed together is a more complex problem. Current computational tools to support the design of group-living captive breeding programs suffer from challenges of scalability and flexibility. In this paper we demonstrate the applicability of constraint programming (CP) approaches to optimize breeding groups to minimize relatedness. We present the example of the Galapagos giant tortoises as the test case used to develop our approach. Exploration of the needs of this captive breeding program has informed the development of our flexible approach to capture the constraints on viable captive breeding program design. Our findings have directly informed the implementation of new group configurations at the captive breeding centre. We further demonstrate that our approach is broadly applicable in other contexts through a second case study, providing multi-objective optimisation of a breeding program of canids. Through these case studies and an ablation study using synthetic datasets, we show that our constraint optimisation approach provides an expressive and generalizable means to support captive breeding program design, including scaling to large captive populations, which are currently intractable using current computational methods.
- 11 April 2025
- Published by Association for the Advancement of Artificial Intelligence (AAAI) in Proceedings of the AAAI Conference on Artificial Intelligence
- Vol. 39 (27) , 27989-27997
Open AccessConstraint Optimisation Approaches for Designing Group-Living Captive Breeding Programmes
Captive breeding programs play a critical role in combating the ongoing biodiversity crisis by preserving the most endangered species and supporting reintroduction efforts. Maintaining the genetic health of captive populations requires careful management to prevent inbreeding and maximize the effective population size. Decisions about which males and females should be bred together are guided by the principle of minimizing relatedness between pairs. Methods to select breeding pairs are well developed, however, some species' ecology requires them to live in groups, and evaluating optimal groupings of multiple males and females that would be suitable to breed together is a more complex problem. Current computational tools to support the design of group-living captive breeding programs suffer from challenges of scalability and flexibility. In this paper we demonstrate the applicability of constraint programming (CP) approaches to optimize breeding groups to minimize relatedness. We present the example of the Galapagos giant tortoises as the test case used to develop our approach. Exploration of the needs of this captive breeding program has informed the development of our flexible approach to capture the constraints on viable captive breeding program design. Our findings have directly informed the implementation of new group configurations at the captive breeding centre. We further demonstrate that our approach is broadly applicable in other contexts through a second case study, providing multi-objective optimisation of a breeding program of canids. Through these case studies and an ablation study using synthetic datasets, we show that our constraint optimisation approach provides an expressive and generalizable means to support captive breeding program design, including scaling to large captive populations, which are currently intractable using current computational methods.
- 13 February 2025
- Published by Springer Nature
- p. 137-152
Robust Streaming Benchmark Design in the Presence of Backpressure
- 13 February 2025
- Published by Springer Nature
- p. 137-152
Robust Streaming Benchmark Design in the Presence of Backpressure
- 24 January 2025
- Published by Springer Nature
- p. 131-147
Evaluating Deep Graph Network Performance by Augmenting Node Features with Structural Features
- 24 January 2025
- Published by Springer Nature
- p. 131-147
Evaluating Deep Graph Network Performance by Augmenting Node Features with Structural Features