Bibliographic record
Abstract
Internet of Things (IoT) services and applications include Connected Vehicles, Smart Grid, Smart Cities, Health Care and, in general, Wireless Sensors and Actuators Networks. Typically, the scenarios can be captured with a Fog Computing architecture that consists of edge nodes that generate and possibly pre-process (sensor) data, fog nodes that do some processing quickly and do any actuations that may be needed, and cloud nodes that may perform further detailed analysis for long-term and archival purposes. This paradigm enables (i) quicker real time computations and actuations, avoiding the latency involved in communicating with the cloud for them, (ii) reducing the amount of data that is sent to the cloud, thus reducing network bandwidth requirement and delay in data transmission, and (iii) doing this without the need for 24/7 network connectivity to the cloud. However, the storage, compute and network connectivity capabilities of the edge and fog nodes may be limited. Hence the computations need to be distributed carefully among the processing nodes. In this paper, we develop a generic framework for distributing computations to the different nodes in a fog architecture. Our framework is applicable to an arbitrary hierarchy of the nodes, one or more homogeneous or heterogeneous source inputs, and to processing the input batches either individually or combined with other batches by way of merges and splits. It can serve initially as a schema for a given computation and later to optimize executions of instances.
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 distilled prediction
Teacher imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.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.
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 teacher head, 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".