A Soft Sensor Based on the Integration of Tikhonov Extreme Learning Machine and Accelerated Kernels for Real-Time Estimation of Automotive Catalyst Temperatures
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
This papers deals with the design of an efficient intelligent tool for automotive engine coldstart monitoring applications. The real-time identification and control of engine coldstart operations have been proven to be very formidable tasks. This refers to the highly nonlinear and transient behavior of the engine system over coldstart operations. As the catalyst temperature is not sufficiently high, the amount of tailpipe hydrocarbon emissions is remarkable over this period. The researchers of systems sciences have investigated the development of soft sensors which are needed to monitor the catalyst temperature for enabling effective coldstart controllers to reduce the emissions. However, most of the conducted researches have focused on using complicated statistical models as well as gradient-based neural networks for the considered problem. This raises several problems regarding the generalization and computational efficiency of the proposed models. In this paper, the authors propose a novel computationally efficient method based on the integration of accelerated kernels and Tikhonov regularized extreme learning machine for the online monitoring of the catalyst temperature over the coldstart period for a given engine. Based on the results of comparative simulations, the authors demonstrate that the proposed soft sensor can be very effective for automotive coldstart applications.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it