Uncertainty management in the activated sludge process: Innovative applications of computational learning theory.
Notice bibliographique
Résumé
In this thesis, the foundations of a new area of research regarding mathematical modelling of biological wastewater treatment (WWT) processes are set. The main feature of this area is the introduction of innovative concepts and tools from emerging information modelling technologies into the traditional field of WWT process modelling. The model identification procedure is viewed as a learning problem or, equivalently, an information transfer from a set of real data into the process model. An innovative mathematical framework for the identification and validation of dynamic mechanistically based WWT process models is developed. Within this framework, a relationship between the model identification procedure and the computational machine learning methodology is established at the foundational level. The deviation D between model prediction and the real process behaviour is characterized mathematically in terms of some simple variables that govern model performance---namely: (1) the size of the data set used for model identification; (2) the quality of these data; (3) the model complexity; (4) the empirical measure of D computed on the basis of the foregoing data set. The development of the relationship between D and these variables is based on a principle called " Inductive Principle of Empirical Risk Minimization" ( IPERM ). The conditions of applicability of IPERM are thoroughly examined in the case of the activated sludge process being described by a simple mechanistic model denoted M . The Vapnik-Chervonenkis (VC) dimension of this model is estimated and two uncertainty models are developed for the activated sludge process (ASP). These two uncertainty models are compared and the differences between them accounted for. The following result is established: empirical data cannot compensate for our limited knowledge of process mechanisms, even if an infinite amount of data and computing power are made available during the model identification procedure. Measures of process model maximal and marginal improvements are developed. It is established that 80% of the model ( M ) maximal improvement occurs at a number of data points of about N80% ≈ 15 to 18. To achieve the other 20%, N has to be increased from the relatively small number N 80% to infinity. Procedures for computing the marginal cost of process model improvement and the guaranteed prediction accuracy of the identified model are developed. A new approach to modelling the activated sludge process itself and dealing with the almost-infinite degree of complexity of the ASP behaviour is developed. The basic idea of this approach is to construct an infinite series NS of nested mechanistic models of increasing complexity. This nested series is developed using the multi-substrate hypothesis. Both the Monod and the Tiessier models are considered in developing this nested series. Another principle called "Inductive Principle of Structural Risk Minimization" ( IPSRM ) is introduced and implemented to determine the optimal model structure complexity, for a fixed and small number N of data points. Computer simulations are carried out to confirm the theory and illustrate the use of the IPSRM and that of the nested series NS of ASP models.
Récupéré en direct depuis OpenAlex et désinversé. Les résumés ne sont pas conservés dans cette base de données : les index inversés représentent 8,6 Go des 9,3 Go de texte de la base, et le serveur dispose de 13 Go libres.
Comment cette classification a été obtenuedéplier
Prédiction machine sur la base complète
Imitation des enseignantsNi prévalence calibrée, ni vérité terrain. Validation humaine à venir. Le volet Gemma est une étiquette directe du modèle pour chaque travail de la base, lue sur la notice réduite au titre. Le volet Codex est un classifieur appris des 10 348 étiquettes directes de Codex et calibré sur les taux pondérés de l'échantillon; les champs sans appui suffisant ne portent aucun appel Codex. Le mode candidate est l'union des deux volets; le consensus est leur intersection. Ces sorties portent le statut machine_predicted_unvalidated et ne sont pas des étiquettes humaines.
Scores du classifieur distillé par catégorie (deux têtes)
| Catégorie | Codex | Gemma |
|---|---|---|
| Métarecherche | 0,002 | 0,005 |
| Méta-épidémiologie (sens strict) | 0,001 | 0,000 |
| Méta-épidémiologie (sens large) | 0,001 | 0,001 |
| Bibliométrie | 0,001 | 0,001 |
| Études des sciences et des technologies | 0,000 | 0,002 |
| Communication savante | 0,002 | 0,002 |
| Science ouverte | 0,001 | 0,002 |
| Intégrité de la recherche | 0,001 | 0,002 |
| Charge utile insuffisante (le modèle a refusé de juger) | 0,001 | 0,000 |
Scores machine (provisoires)
Les deux têtes enseignantes du modèle étudiant, lues sur ce travail. Un score ordonne la base pour la relecture; il n'affirme jamais une catégorie, et le statut de validation accompagne chaque rangée tel quel.
Scores de référence d'un modèle non mature (critères de maturité non atteints, 7 itérations). Un score ordonne; il n'affirme jamais une catégorie.
score_only:v0-immature-baseline · tel quel depuis la passe de notation : score_only signifie que le nombre peut ordonner les travaux, et qu'aucune étiquette de catégorie n'en découleClassification
machine, non validéePrédiction automatique; un appel candidat d’une seule source (Gemma direct ou Codex distillé), pas un consensus.
Le détail, modèle par modèle et score par score, se trouve en fin de page sous « Comment cette classification a été obtenue ».