Artificial Neural Networks and Experimental Data Analysis‐Based Biomass Combustion Machine's Dynamical Model Identification
Bibliographic record
Abstract
ABSTRACT Because of many thermally, physically, and chemically interrelated phenomena, combustion biomass machines can be extremely difficult to operate. Research to develop a precise mathematical model to represent most of these machines is still in progress. This study established a model for predicting the inputs of a biomass machine. The model proposed is an inverse model. It is based on data experimentally obtained from a real‐world biomass machine. Given the complexity of the machine, it is critical to understand the signals that must be set at the input for it to perform optimally. Four ANN models were evaluated: the multilayer perceptron (MLP), the recurrent neural network (RNN), the long short‐term memory (LSTM), and the gated recurrent unit (GRU) models. These models consider the nonlinearity of the data. The inverse model based on the GRU approach outperformed the other ANNs tested, with a loss of 11.97% and an accuracy of 79.89%. The GRU‐based inverse model, relying on 17,281 experimental samples collected every 5 s, achieved a test MAE of 0.1197, RMSE of 0.1542, and accuracy of 79.89%, outperforming MLP, RNN, and LSTM, with prediction errors less than 6%, thus improving practical biomass combustion control. These two performance indicators were calculated from our test data (20% of the data). The difference in speed between forecasts and actual values was less than 6%. This is a step forward in better understanding biomass combustion machines and configuring appropriate input signals for them to operate in the desired mode.
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.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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".