MétaCan
Menu
Back to cohort

Automating pouring process in precision casting

2024· article· en· W4400663409 on OpenAlexaff
Xiang Feng

Bibliographic record

VenueApplied and Computational Engineering · 2024
Typearticle
Languageen
FieldEngineering
TopicAdvanced Manufacturing and Logistics Optimization
Canadian institutionsSimon Fraser University
Fundersnot available
KeywordsAutomationComputer scienceProcess (computing)FlowchartRobotIntersection (aeronautics)Flexibility (engineering)AdaptabilityObject (grammar)Manufacturing engineeringSoftware engineeringArtificial intelligenceEngineering

Abstract

fetched live from OpenAlex

Standing at the intersection of industry 4.0, most traditional manufacturers, especially those produce non-standard parts, are still facing the challenges from multiple aspects on the implementation of automations, that indicates a significant and necessary step towards their upgrading. The potential performance improvement that could be brought by the automation may be continuingly squeezed as the increasement of complexity when dealing with the various targets. This article is extended by a general concept of implementing automation on the metal pouring process of precision casting, aims to explore an efficient and robust automation solution with the integration of human-robots collaboration and the adoption of computer science techniques. The implementation emphasizes the reduction of unnecessary complexities from each working step, the applied algorithms, such as Object Bounding, Greedy Strategy and Last-In-First-Out, have been correspondingly tailored based on the characteristics of its engaged working steps and illustrated by the flowcharts. Both the adaptability and practicability of the automation are expected to be enhanced with the principles of constructing easy-interactive frames, allowing a certain degree of human intervention, and proactively utilizing the matured algorithms.

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 machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.001
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.006
Threshold uncertainty score0.011

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.001
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0010.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0030.001

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.004
GPT teacher head0.206
Teacher spread0.202 · 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 source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designBench or experimental
Domainnot available
GenreEmpirical

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

Citations1
Published2024
Admission routes1
Has abstractyes

Explore more

Same venueApplied and Computational EngineeringSame topicAdvanced Manufacturing and Logistics OptimizationFrench-language works237,207