MétaCan
Menu
Back to cohort
Record W1976593327 · doi:10.1080/17415977.2014.906414

Recovering multiple small inclusions in a three-dimensional domain using a single measurement

2014· article· en· W1976593327 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.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueInverse Problems in Science and Engineering · 2014
Typearticle
Languageen
FieldEngineering
TopicElectrical and Bioimpedance Tomography
Canadian institutionsDalhousie University
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsComputationBounded functionBoundary (topology)Domain (mathematical analysis)AlgorithmPolynomialElectrical impedanceMathematicsElectrical impedance tomographyComputer scienceMathematical analysisGeometryPhysics

Abstract

fetched live from OpenAlex

We present and test an effective algorithm to recover multiple small heterogeneities inside arbitrary three-dimensional bounded regions. In applications of electrical impedance tomography, such heterogeneities might represent tumours inside the body, weaknesses or cracks in a solid material or subterranean mineral deposits. The algorithm determines the location of all K heterogeneities using a single boundary measurement. The only non-linear step in the algorithm is to find K roots of a single polynomial of degree K. The efficacy of this method is demonstrated by full numerical computation of the three-dimensional forward problem. In addition, the methods employed can give information regarding the shape of irregular heterogeneities.

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.001
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: Empirical
Teacher disagreement score0.435
Threshold uncertainty score0.648

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.002
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.031
GPT teacher head0.196
Teacher spread0.165 · 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