On the System Algebra Foundations for Granular Computing
Bibliographic record
Abstract
Granular computing studies a novel approach to computing system modeling and information processing. Although a rich set of work has advanced the understanding of granular computing in dealing with the “to be” and “to have” problems of systems, the “to do” aspect of system modeling and behavioral implementation has been relatively overlooked. On the basis of a recent development in denotational mathematics known as system algebra, this paper presents a system metaphor of granules and explores the theoretical and mathematical foundations of granular computing. An abstract system model of granules is proposed in this paper. Rigorous manipulations of granular systems in computing are modeled by system algebra. The properties of granular systems are analyzed, which helps to explain the magnitudes and complexities of granular systems. Formal representation of granular systems for computing is demonstrated by real-world case studies, where concrete granules and their algebraic operations are explained.
Stored with the screening record, where it is evidence for the labels above.
How this classification was reachedexpand
The three-model screen
all 5,600 screened works →All three models called this out of scope.
Theoretical computer science on system algebra foundations for granular computing.
The paper develops mathematical foundations for granular computing rather than studying research practice.
Computer-science theory of granular computing and system algebra, not metaresearch.
Full frame machine prediction
Teacher imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.002 | 0.007 |
| Scholarly communication | 0.004 | 0.009 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 0.004 |
| Insufficient payload (model declined to judge) | 0.008 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".