MétaCan
Menu
Back to cohort
Record W35056265 · doi:10.3390/mi13010101

SATzilla2007: a New & Improved Algorithm Portfolio for SAT

2007· article· en· W35056265 on OpenAlexaff
Lin Xu, Frank Hutter, Holger H. Hoos, Kevin Leyton‐Brown

Bibliographic record

VenueMicromachines · 2007
Typearticle
Languageen
FieldComputer Science
TopicConstraint Satisfaction and Optimization
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsPortfolioComputer scienceEmpirical researchUncorrelatedAlgorithmArtificial intelligenceMathematicsStatisticsEconomicsFinance

Abstract

fetched live from OpenAlex

This paper describes the non-contact optical detection of debris material that adheres to the substrates of color filters (CFs) and thin-film transistors (TFTs) by area charge-coupled devices (CCDs) and laser sensors. One of the optical detections is a side-view illumination by an area CCD that emits a coherency light to detect debris on the CF. In contrast to the height of the debris material, the image is acquired by transforming the geometric shape from a square to a circle. As a result, the side-view illumination from the area CCD identified the height of the debris adhered to the black matrix (BM) as well as the red, green, and blue of a CF with 95, 97, 98, and 99% accuracy compared to the golden sample. The uncertainty analysis was at 5% for the BM, 3% for the red, 2% for the green, and 1% for the blue. The other optical detection, a laser optical interception with a horizontal alignment, inspected the material foreign to the TFT. At the same time, laser sensors intercepted the debris on the TFT at a voltage of 3.5 V, which the five sets of laser optics make scanning the sample. Consequently, the scanning rate reached over 98% accuracy, and the uncertainty analysis was within 5%. Thus, both non-contact optical methods can detect debris at a 50 μm height or lower. The experiment presents a successful design for the efficient prevention of a valuable component malfunction.

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.

How this classification was reachedexpand

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: Other design · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.976
Threshold uncertainty score0.496

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.007
GPT teacher head0.254
Teacher spread0.246 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designOther design
Domainnot available
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations3
Published2007
Admission routes1
Has abstractyes

Explore more

Same venueMicromachinesSame topicConstraint Satisfaction and OptimizationFrench-language works237,207