Active Modeling: A Method for Creating and Simulating Variable-Complexity Models
Bibliographic record
Abstract
Effective and efficient simulation-based design is facilitated by models of appropriate complexity. A single model will not have the most appropriate level of complexity throughout all phases of a simulation maneuver if inputs or parameters vary. Ideally, a model for which complexity can be varied as necessary will achieve the best possible trade-off between accuracy and computational efficiency. A method is presented for switching system model elements on and off as their importance changes, and predicting the response of the resulting variable-complexity model. A modified transformer element removes the dynamic output of a model element to the rest of the system when the moving average of its absolute power falls below a user-defined threshold. When the element is “off,” the input from the system to the element is still passed through the transformer so that an estimate of element power and importance can continue to be calculated and the element switched back “on” if necessary. The bond graph formalism is used to facilitate implementation. Switch configurations are defined for both causally weak and causally strong energy storage and dissipative elements. The method is applicable to linear or nonlinear systems that can be modeled with lumped parameter elements. The approach is demonstrated for quarter- and half-car vehicle models subject to a road profile of varying frequency. The appropriate model complexity at all stages is determined and implemented continuously without prior knowledge of input or parameter changes.
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.003 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.007 | 0.002 |
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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".