MétaCan
Menu
Back to cohort
Record W2989356614 · doi:10.1109/tcsii.2019.2953238

Sparse Undetectable Sensor Attacks Against Cyber-Physical Systems: A Subspace Approach

2019· article· en· W2989356614 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueIEEE Transactions on Circuits & Systems II Express Briefs · 2019
Typearticle
Languageen
FieldEngineering
TopicSmart Grid Security and Resilience
Canadian institutionsUniversity of Alberta
FundersFundamental Research Funds for the Central UniversitiesNatural Science Foundation of Jiangsu ProvinceNational Natural Science Foundation of China
KeywordsSubspace topologyCyber-physical systemConstraint (computer-aided design)Computer scienceSparse approximationWireless sensor networkArtificial intelligenceData miningReal-time computingEngineeringComputer network

Abstract

fetched live from OpenAlex

In this brief, the data-driven design of sparse undetectable sensor attacks against cyber-physical systems is studied, with the aid of subspace approach. First, the undetectable and sparse sensor attack design schemes are proposed based on the physical models. Then the data-driven realizations of sparse undetectable sensor attacks are designed via identifying the subspace from the collected input and output data. Moreover, the impacts of sparse undetectable sensor attacks are evaluated by solving the constraint optimization problems. Finally, the simulations on an unmanned aerial vehicle are illustrated to testify the effectiveness of the proposed methods.

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 imitation

Not 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.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.465
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0000.000
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.013
GPT teacher head0.206
Teacher spread0.193 · 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