MétaCan
Menu
Back to cohort

Symbolic Function Network

2012· book-chapter· en· W2485710950 on OpenAlexaff
George S. Eskander, Amir F. Atiya

Bibliographic record

VenueIGI Global eBooks · 2012
Typebook-chapter
Languageen
FieldComputer Science
TopicNetwork Traffic and Congestion Control
Canadian institutionsÉcole de Technologie Supérieure
Fundersnot available
KeywordsComputer scienceQuality of serviceNetwork packetArtificial neural networkFunction (biology)Packet lossControl (management)Real-time computingComputer networkArtificial intelligence

Abstract

fetched live from OpenAlex

Quality of Service (QoS) of telecommunication networks could be enhanced by applying predictive control methods. Such controllers rely on utilizing good and fast (real-time) predictions of the network traffic and quality parameters. Accuracy and recall speed of the traditional Neural Network models are not satisfactory to support such critical real time applications. The Symbolic Function Network (SFN) is a HONN-like model that was originally motivated by the current needs of developing more enhanced and fast predictors for such applications. In this chapter, the authors use the SFN model to design fast and accurate predictors for the telecommunication networks quality control applications. Three predictors are designed and tested for the network traffic, packet loss, and round trip delay. This chapter aims to open a door for researchers to investigate the applicability of SFN in other prediction tasks and to develop more accurate and faster predictors.

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.000
metaresearch head score (Gemma)0.001
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.018
Threshold uncertainty score0.061

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.001
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.001
Science and technology studies0.0000.001
Scholarly communication0.0010.002
Open science0.0010.001
Research integrity0.0010.001
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.013
GPT teacher head0.207
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

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 designTheoretical or conceptual
Domainnot available
GenreMethods

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

Citations3
Published2012
Admission routes1
Has abstractyes

Explore more

Same venueIGI Global eBooksSame topicNetwork Traffic and Congestion ControlFrench-language works237,207