MétaCan
Menu
Back to cohort
Record W2169916530 · doi:10.1002/aic.14515

Optimal design of large‐scale chemical processes under uncertainty: A ranking‐based approach

2014· article· en· W2169916530 on OpenAlexaff
Sami S. Bahakim, Shabnam Rasoulian, Luis Ricardez‐Sandoval

Bibliographic record

VenueAIChE Journal · 2014
Typearticle
Languageen
FieldEngineering
TopicProcess Optimization and Integration
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsMonte Carlo methodRanking (information retrieval)Process (computing)Mathematical optimizationConstraint (computer-aided design)Computer scienceChemical processSampling (signal processing)Scale (ratio)MathematicsEngineeringMachine learningStatistics

Abstract

fetched live from OpenAlex

An approach for the optimal design of chemical processes in the presence of uncertainty was presented. The key idea in this work is to approximate the process constraint functions and model outputs using Power Series Expansions (PSE)‐based functions. The PSE functions are used to efficiently identify the variability in the process constraint functions and model outputs due to multiple realizations in the uncertain parameters using Monte Carlo (MC) sampling methods. A ranking‐based approach is adopted here where the user can assign priorities or probabilities of satisfaction for the different process constraints and model outputs considered in the analysis. The methodology was tested on a reactor–heat exchanger system and the Tennessee Eastman process. The results show that the present method is computationally attractive since the optimal process design is accomplished in shorter computational times when compared to the use of the MC method applied to the full plant model. © 2014 American Institute of Chemical Engineers AIChE J, 60: 3243–3257, 2014

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.004
metaresearch head score (Gemma)0.004
Version: metacan-v3-hybrid-931329e0061cValidation 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.004
Threshold uncertainty score0.021

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0040.004
Meta-epidemiology (narrow)0.0020.001
Meta-epidemiology (broad)0.0020.001
Bibliometrics0.0010.001
Science and technology studies0.0010.001
Scholarly communication0.0020.001
Open science0.0010.001
Research integrity0.0020.001
Insufficient payload (model declined to judge)0.0020.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.014
GPT teacher head0.230
Teacher spread0.215 · 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 designSimulation or modeling
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

Citations26
Published2014
Admission routes1
Has abstractyes

Explore more

Same venueAIChE JournalSame topicProcess Optimization and IntegrationFrench-language works237,207