Modelling and Optimization of Plug Flow Mufflers in Emission Control Systems
Bibliographic record
Abstract
Large-scale emergency or off-grid power generation is typically achieved through diesel or natural gas generators. To meet governmental emission requirements, emission control systems (ECS) are required. In operation, effective control over the generator’s acoustic emission is also necessary, and can be accomplished within the ECS system. Plug flow mufflers are commonly used, as they provide a sufficient level of noise attenuation in a compact structure. The key design parameter is the transmission loss of the muffler, as this dictates the level of attenuation at a given frequency. This work implements an analytically decoupled solution, using multiple perforate impedance models, through the transfer matrix method (TMM) to predict the transmission loss based on the muffler geometry. An equivalent finite element model is implemented for numerical simulation. The analytical results and numerical results are then evaluated against experimental data from literature. The transmission loss required in each application of the ECS system will vary depending on the noise profile of the generator in question; therefore, it is necessary to have an effective method of redesigning the muffler to meet the design requirements. Prior work on TMM-based muffler shape optimization utilized complex algorithms such as neural networks and simulated annealing. The present study simplifies the process by using the bounded, limited-memory implementation of the Broyden-Fletcher-Goldfarb-Shanno (BFGS) algorithm in a multi-start framework for shape optimization to achieve the desired transmission loss. By constraining the multi-start method with appropriate design limits, the algorithm is initialized at multiple random points within the design space, ensuring that the solution approaches the global optimum when using a sufficiently large number of initializations.
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.002 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 0.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.
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".