MétaCan
Menu
Back to cohort
Record W2135814254 · doi:10.1109/acssc.2008.5074352

Analysis of random radar networks

2008· article· en· W2135814254 on OpenAlex
Rani Daher, Raviraj Adve

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

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicRadar Systems and Signal Processing
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsComputer scienceRadarInterference (communication)Antenna diversityMultistatic radarNoise (video)Upper and lower boundsRadar systemsVariance (accounting)AlgorithmRadar engineering detailsTelecommunicationsRadar imagingArtificial intelligenceMathematicsAntenna (radio)

Abstract

fetched live from OpenAlex

We introduce the notion of random radar networks to analyze the effect of geometry in distributed radar systems. We first analyze unistatic systems with a single receiver selected at random from the available group. We approximate the distribution of the individual signal-to-interference-plus-noise (SINR) at the sensors and find the corresponding mean and variance. We then analyze multistatic systems and provide an upper bound on performance. We show that in order to exploit the spatial diversity available to the system, the sensors should be large enough to effectively cancel interfering sources. We underline a design tradeoff between spatial diversity and interference cancellation for multistatic radar networks. We finally provide the results of simulations to validate our analysis.

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: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.698
Threshold uncertainty score0.170

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.009
GPT teacher head0.187
Teacher spread0.178 · 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

Quick stats

Citations0
Published2008
Admission routes1
Has abstractyes

Explore more

Same topicRadar Systems and Signal ProcessingFrench-language works237,207