MétaCan
Menu
Back to cohort
Record W2112854562

MULER: Building an Electronic Resource Management (ERM) Solution at York University

2012· article· en· W2112854562 on OpenAlexaffabout
Aaron Lupton, Marcia Salmon

Bibliographic record

VenueThe Journal of Library Innovation · 2012
Typearticle
Languageen
FieldComputer Science
TopicLibrary Collection Development and Digital Resources
Canadian institutionsYork University
Fundersnot available
KeywordsComputer scienceResource (disambiguation)Product (mathematics)Engineering managementSubject (documents)Process (computing)Resource planningWorld Wide WebBusinessKnowledge managementEnvironmental resource managementEngineering
DOInot available

Abstract

fetched live from OpenAlex

Many university libraries now utilize an Electronic Resource Management (ERM) system to assist with operations related to electronic resources. An ERM is a relational database containing information such as suppliers, costs, holdings, and renewal dates for electronic resources, both at the database and title levels. While commercial ERM products are widely available, some institutions are custom building their own ERM in- house. This article describes how York University in Toronto, Canada, did just that by building a system called Managing University Library Electronic Resources (MULER). The article details the background and history of how electronic resources were managed pre-MULER; why a new ERM was needed; the planning process; the current and innovative functions of MULER, including integration of MULER data into York University Libraries search and discovery layer, Vufind; subject tagging in MULER; new functions to be added; and lessons learned from the project. Positive and negative implications of choosing an in-house project over paying for a commercial product are also discussed.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.007
metaresearch head score (Gemma)0.008
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesScholarly communication
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.993
Threshold uncertainty score0.209

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0070.008
Meta-epidemiology (narrow)0.0000.001
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0020.003
Science and technology studies0.0030.001
Scholarly communication0.0070.014
Open science0.0020.004
Research integrity0.0020.002
Insufficient payload (model declined to judge)0.0180.005

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.017
GPT teacher head0.202
Teacher spread0.185 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

Study designNot applicable
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations4
Published2012
Admission routes2
Has abstractyes

Explore more

Same venueThe Journal of Library InnovationSame topicLibrary Collection Development and Digital ResourcesFrench-language works237,207