MétaCan
Menu
Back to cohort
Record W1499151993 · doi:10.1109/hicss.1998.649276

A transactional activity model for organizing open-ended cooperative activities

2002· article· en· W1499151993 on OpenAlexfundno aff
Ling Liu, Calton Pu

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicDistributed systems and fault tolerance
Canadian institutionsnot available
FundersNatural Sciences and Engineering Research Council of CanadaNational Science Foundation
KeywordsComputer scienceTransactional leadershipTransactional analysisPsychology

Abstract

fetched live from OpenAlex

The authors propose a transactional activity model (TAM) for specification and management of open-ended cooperative activities. In contrast to each of the extended transaction models which focus more on a formal template for data processing patterns in an application, the activity model contains a set of formal templates, namely activity patterns, for capturing patterns of object interactions in an application. Using TAM, users may form new activity patterns by combining components of different existing patterns using activity pattern refinement and activity pattern composition mechanisms that include splitting and joining of activities. In TAM, activity histories are used to study the correctness of activity execution and activity restructuring through refinement, composition, split, or join.

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.003
metaresearch head score (Gemma)0.006
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.005
Threshold uncertainty score0.018

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0030.006
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.002
Bibliometrics0.0020.002
Science and technology studies0.0010.003
Scholarly communication0.0050.008
Open science0.0040.002
Research integrity0.0020.002
Insufficient payload (model declined to judge)0.0050.002

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.064
GPT teacher head0.276
Teacher spread0.212 · 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.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
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

Citations6
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicDistributed systems and fault toleranceFrench-language works237,207