Soft computing-based nonlinear fusion algorithms for describing non-Darcy flow in porous media
Bibliographic record
Abstract
By increasing the velocity of flow in coarse grain materials, local turbulences are often imposed to the flow. As a result, the flow regime through rockfill structures deviates significantly from linear Darcy law; and nonlinear or non-Darcy flow equations will be applicable. Even though the structures of these nonlinear equations have some physical justifications, empirical studies are still necessary to estimate the parameters of these equations amid a great deal of uncertainty inherent to this estimation process. Consequently, none of the current empirical equations alone seem to be able to model the flow process exactly. In recent years, soft computing, in contrast to classical modeling techniques, has been advocated as a hybrid approach to intelligent paradigms such as neural networks, fuzzy logic, and neuro-fuzzy systems that aim to handle the uncertainties and vagueness in such systems. In this paper, we investigate several soft computing paradigms to combine three of the most commonly validated and utilized empirical solutions in the current literature. In this way, the estimates from the three empirical equations drive a soft computing-based fusion algorithm. The results show that soft computing-based approaches provide a powerful paradigm with a strong ability to model reality. Specifically, this paper concludes that cascade correlation neural networks provide the best fusion algorithm with the highest accuracy among the considered conventional alternatives as well as several other soft computing paradigms.
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 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.003 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| 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.001 |
| 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, 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".