MétaCan
Menu
Back to cohort
Record W4387744185 · doi:10.1080/09205071.2023.2270517

Failure diagnosis for time-modulated arrays based on compressed sensing

2023· article· en· W4387744185 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

VenueJournal of Electromagnetic Waves and Applications · 2023
Typearticle
Languageen
FieldEngineering
TopicAntenna Design and Optimization
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsComputer scienceRobustness (evolution)Compressed sensingConvex optimizationAlgorithmNorm (philosophy)Antenna (radio)Regular polygonTelecommunicationsComputer engineeringMathematicsLaw

Abstract

fetched live from OpenAlex

Time-modulated arrays (TMAs) have a high design degrees of freedom (DoFs) to improve radiation performance, while they are prone to failure due to their hardware characteristics. In this article, we propose a novel technique to diagnose impaired TMAs based on compressed sensing (CS). The TMA diagnosis problem is reformulated as a sparse signal recovery problem at the center frequency and sidebands. Then, a method based on the difference of convex sets theory and sequential convex programming (DCS-SCP) is developed to implement diagnosis for impaired TMAs. Using a small number of far-field measurements at the same position but different frequencies, the joint recovery of the equivalent excitations at the center frequency and sidebands is realized by a mixed l0/l2-norm minimization method. The numerical simulation and the successful comparison with the state-of-the-art algorithms demonstrate the superiority of the proposed methods in terms of noise robustness and diagnosis accuracy.

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 categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.893
Threshold uncertainty score0.316

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
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.006
GPT teacher head0.207
Teacher spread0.201 · 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