An efficient finite–discrete element method for quasi‐static nonlinear soil–structure interaction problems
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
SUMMARY An efficient finite–discrete element method applicable for the analysis of quasi‐static nonlinear soil–structure interaction problems involving large deformations in three‐dimensional space was presented in this paper. The present method differs from previous approaches in that the use of very fine mesh and small time steps was not needed to stabilize the calculation. The domain involving the large displacement was modeled using discrete elements, whereas the rest of the domain was modeled using finite elements. Forces acting on the discrete and finite elements were related by introducing interface elements at the boundary of the two domains. To improve the stability of the developed method, we used explicit time integration with different damping schemes applied to each domain to relax the system and to reach stability condition. With appropriate damping schemes, a relatively coarse finite element mesh can be used, resulting in significant savings in the computation time. The proposed algorithm was validated using three different benchmark problems, and the numerical results were compared with existing analytical and numerical solutions. The algorithm performance in solving practical soil–structure interaction problems was also investigated by simulating a large‐scale soft ground tunneling problem involving soil loss near an existing lining. Copyright © 2011 John Wiley & Sons, Ltd.
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