Efficient computation of sensor activation decisions in discrete-event systems
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.
Bibliographic record
Abstract
This paper considers partially-observed discrete-event systems where sensors are associated with events observable to an agent monitoring the system. The agent is capable of turning the sensors for events on and off dynamically, depending on the trajectory of the system. Reading data from the sensors may be costly so it is imperative that their use be reduced for reasons such as energy, bandwidth or security. When a sensor for an event is on / active any occurrence of the event is detected by the agent and is not detected otherwise. The agent may employ different sensor activation policies, depending on the task at hand. Sensor activation policies are defined over the transitions of a state-transition representation of the system. From sensor activation policies a map from observed event sequences to sensor activation decisions can be computed which the agent can use to determine which sensors to turn on / off and when. In this paper, we consider two subclasses of sensor activation policies of increasing generality. For each subclass, we demonstrate ways to compute maps from observed event sequences to sensor activation decisions in polynomial time.
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 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.001 |
| 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 it