IDEAS home Printed from https://ideas.repec.org/a/pal/palcom/v12y2025i1d10.1057_s41599-025-04491-x.html
   My bibliography  Save this article

Building sustainable information systems and transformer models on demand

Author

Listed:
  • Thomas Asselborn

    (University of Hamburg
    University of Hamburg)

  • Sylvia Melzer

    (University of Hamburg
    University of Hamburg)

  • Simon Schiff

    (University of Luebeck)

  • Magnus Bender

    (University of Hamburg)

  • Florian Andreas Marwitz

    (University of Hamburg
    University of Hamburg)

  • Said Aljoumani

    (University of Hamburg)

  • Stefan Thiemann

    (University of Hamburg)

  • Konrad Hirschler

    (University of Hamburg)

  • Ralf Möller

    (University of Hamburg)

Abstract

The growing practice of archiving research data in repositories reflects an upward trend. However, storing data in an RDR (Research Data Repository) does not guarantee that the archived data will always be readily reusable, even if this fulfils the FAIR (Findable, Accessible, Interoperable Reusable) principles. To ensure sustainable RDM (Research Data Management), archiving must consider the future potential for data reuse in a low-threshold fashion. In this article, we demonstrate the utilisation of straightforward methods to implement a so-called warm or hot archiving for research data within an RDR, as opposed to the conventional cold archiving approach. We explore the additional value of using research data in the humanities, emphasising the advantages of maintaining data accessibility and relevance over time. In the humanities, evaluating numerous data sets efficiently is crucial for current and future projects. Reviewing and evaluating relevance is important, particularly when dealing with a substantial number of data sets. Rapid evaluation facilitates profound decisions on the utility of the data for one’s ongoing or upcoming projects. For hot archiving, this means that in addition to the research data, the data should be available in a human-friendly way, i.e., a viewer application to visualise the data should be easily accessible. However, as rapid developments in the IT sector mean that after a few years, it cannot be guaranteed that these viewers or other tools will work, we also show how data can be viewed in a user-specific way via the RDR and how sustainable viewing can be integrated into the RDR. This article presents a generic approach to building sustainable viewers, which we call information systems, or transformer models on demand using data from pre-modern Arabic. In addition, we show that the easy-to-use chatbot ChatGPT can alternatively be context-specifically prepared to deliver more precise results and associated resources in the field of humanities. On the one hand, we have achieved a substantial reduction in the development time of an information system, from months to seconds, as well as the ability to fine-tune BERT (Bidirectional Encoder Representations from Transformers) models without specific knowledge in selecting models or tools. On the other hand, we have developed a chatbot that not only provides project-specific responses but also references the sources.

Suggested Citation

  • Thomas Asselborn & Sylvia Melzer & Simon Schiff & Magnus Bender & Florian Andreas Marwitz & Said Aljoumani & Stefan Thiemann & Konrad Hirschler & Ralf Möller, 2025. "Building sustainable information systems and transformer models on demand," Palgrave Communications, Palgrave Macmillan, vol. 12(1), pages 1-15, December.
  • Handle: RePEc:pal:palcom:v:12:y:2025:i:1:d:10.1057_s41599-025-04491-x
    DOI: 10.1057/s41599-025-04491-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/s41599-025-04491-x
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1057/s41599-025-04491-x?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. W. A. Horn, 1974. "Some simple scheduling algorithms," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 21(1), pages 177-185, March.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. T.C.E. Cheng & Svetlana A. Kravchenko & Bertrand M.T. Lin, 2017. "Preemptive parallel‐machine scheduling with a common server to minimize makespan," Naval Research Logistics (NRL), John Wiley & Sons, vol. 64(5), pages 388-398, August.
    2. Fowler, John W. & Mönch, Lars, 2022. "A survey of scheduling with parallel batch (p-batch) processing," European Journal of Operational Research, Elsevier, vol. 298(1), pages 1-24.
    3. Alexander Grigoriev & Martijn Holthuijsen & Joris van de Klundert, 2005. "Basic scheduling problems with raw material constraints," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(6), pages 527-535, September.
    4. Akiyoshi Shioura & Natalia V. Shakhlevich & Vitaly A. Strusevich, 2017. "Machine Speed Scaling by Adapting Methods for Convex Optimization with Submodular Constraints," INFORMS Journal on Computing, INFORMS, vol. 29(4), pages 724-736, November.
    5. Christian L. Cesar & Peter G. Jessel, 1992. "Real‐time task scheduling with overheads considered," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(2), pages 247-264, March.
    6. Jacques Carlier & Antoine Jouglet & Abderrahim Sahli, 2024. "Algorithms to compute the energetic lower bounds of the cumulative scheduling problem," Annals of Operations Research, Springer, vol. 337(2), pages 683-713, June.
    7. Nodari Vakhania, 2019. "Dynamic Restructuring Framework for Scheduling with Release Times and Due-Dates," Mathematics, MDPI, vol. 7(11), pages 1-42, November.
    8. Christian Artigues & Emmanuel Hébrard & Alain Quilliot & Hélène Toussaint, 2024. "The Continuous Time-Resource Trade-off Scheduling Problem with Time Windows," INFORMS Journal on Computing, INFORMS, vol. 36(6), pages 1676-1695, December.
    9. Akiyoshi Shioura & Natalia V. Shakhlevich & Vitaly A. Strusevich, 2020. "Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost," Journal of Global Optimization, Springer, vol. 76(3), pages 471-490, March.
    10. Shi-Sheng Li & Ren-Xia Chen, 2023. "Competitive two-agent scheduling with release dates and preemption on a single machine," Journal of Scheduling, Springer, vol. 26(3), pages 227-249, June.
    11. Bruno Gaujal & Alain Girault & Stephan Plassart, 2020. "Dynamic speed scaling minimizing expected energy consumption for real-time tasks," Journal of Scheduling, Springer, vol. 23(5), pages 555-574, October.
    12. Johnny C. Ho & Yih‐Long Chang, 1991. "Heuristics for minimizing mean tardiness for m parallel machines," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(3), pages 367-381, June.
    13. Mehdi Ghiyasvand, 2015. "Solving the parametric bipartite maximum flow problem in unbalanced and closure bipartite graphs," Annals of Operations Research, Springer, vol. 229(1), pages 397-408, June.
    14. Akiyoshi Shioura & Vitaly A. Strusevich & Natalia V. Shakhlevich, 2024. "Preemptive scheduling of parallel jobs of two sizes with controllable processing times," Journal of Scheduling, Springer, vol. 27(2), pages 203-224, April.
    15. Xiaohu Wu & Patrick Loiseau, 2024. "Algorithms for Scheduling Deadline-Sensitive Malleable Tasks," SN Operations Research Forum, Springer, vol. 5(2), pages 1-38, June.
    16. Joseph Y.‐T. Leung & Michael Pinedo, 2004. "A note on scheduling parallel machines subject to breakdown and repair," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(1), pages 60-71, February.
    17. Rubing Chen & Jinjiang Yuan & C.T. Ng & T.C.E. Cheng, 2019. "Single‐machine scheduling with deadlines to minimize the total weighted late work," Naval Research Logistics (NRL), John Wiley & Sons, vol. 66(7), pages 582-595, October.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:pal:palcom:v:12:y:2025:i:1:d:10.1057_s41599-025-04491-x. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: https://www.nature.com/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.