MétaCan
Menu
Back to cohort
Record W1998053378 · doi:10.1109/coginf.2006.365515

On Abstract Systems and System Algebra

2006· article· en· W1998053378 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicCognitive Computing and Networks
Canadian institutionsUniversity of Calgary
Fundersnot available
KeywordsComputer scienceAlgebra over a fieldTheoretical computer scienceAlgebraic numberSystem of systemsSystems theorySynchronization (alternating current)Systems designSoftware engineeringMathematicsArtificial intelligencePure mathematics

Abstract

fetched live from OpenAlex

Systems are the most complicated entities and phenomena in the physical, information, and social worlds across all science and engineering disciplines. This paper presents a mathematical theory of system algebra and its applications in cognitive informatics, system engineering, and software engineering. A rigorous treatment of abstract systems is described, and the algebraic relations and operations of abstract systems are analyzed. Important properties of systems such as system mutation, work done by systems, the maximum output of systems, system equilibriums, system synchronization, and system dissimilation, are formally modeled. An age-long myth in system theory that states 'the whole is larger than the sum of its parts' is formally explained. On the basis of the abstract system theory, a wide range of real world phenomena and problems can be explained and solved

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.967
Threshold uncertainty score0.269

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

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.009
GPT teacher head0.203
Teacher spread0.194 · 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

Quick stats

Citations14
Published2006
Admission routes1
Has abstractyes

Explore more

Same topicCognitive Computing and NetworksFrench-language works237,207