Use of Soft Computing Applications to Model Pervious Concrete Pavement Condition in Cold Climates
Bibliographic record
Abstract
Development of an adequate performance model based on an appropriate condition index has been a major challenge for engineers particularly in case of a new type of design such as pervious concrete pavement structures (PCPSs) which suffer from limited long term performance data sets especially in colder climates. Soft computing techniques are significantly efficient at dealing with subjective, incomplete, and limited data. This paper proposes three most effective soft computing methods: fuzzy sets, the Latin Hypercube Simulation technique, and the Markov Chain process. A novel comprehensive condition index based on severity, density, and weighting factors of distresses occurring on PCPS has been developed incorporating fuzzy sets. A combination of homogeneous and nonhomogeneous Markov Chain has been applied to develop performance models. Transition probability matrices are presented using probability distribution functions rather than single values. A simulation technique is then used to incorporate the probability distribution function operations to compute the future condition of the pavements. The future performance of the pavements is expressed by both single expected values and suitable probability distribution functions. Ultimately, a probabilistic versus deterministic performance curve is presented.
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.002 |
| 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.001 |
| 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".