Calculo da Capacidade de Códigos com Restrições Bi-Dimensionais Usando Redes de Petri
Bibliographic record
Abstract
Neste artigo é apresentado um procedimento que faz uso de redes de Petri para o cálculo da capacidade de códigos com restric ¸ões bi-dimensionais usados para gravac ¸ão de múltiplas trilhas em paralelo em meios ópticos e magnéticos.A utilizac ¸ão de redes de Petri sistematiza a representac ¸ão das restric ¸ões impostas às seqüências em cada trilha e no conjunto das trilhas simultaneamente.A capacidade do código é calculada a partir da matriz de adjacência da árvore de alcanc ¸abilidade da rede de Petri.Uma característica importante do procedimento apresentado é que os modelos podem ser adaptados para introduc ¸ão (ou supressão) de restric ¸ões.
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 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.007 | 0.053 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.002 |
| Bibliometrics | 0.003 | 0.003 |
| Science and technology studies | 0.001 | 0.003 |
| Scholarly communication | 0.007 | 0.009 |
| Open science | 0.002 | 0.004 |
| Research integrity | 0.002 | 0.002 |
| Insufficient payload (model declined to judge) | 0.007 | 0.001 |
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".