SearcharxivSearch

arXiv subjects

Congcong Yuan

Publications and source records attributed to Congcong Yuan.

3 recordsLinked to original sources

Your Simulation Runs but Solves the Wrong Physics: PDE-Grounded Intent Verification for LLM-Generated Multiphysics Simulation Code

Execution-based evaluation of LLM-generated code implicitly treats successful execution as a proxy for correctness. In scientific simulation, this proxy is insufficient: a generated input file can run, mesh, and converge while encoding governing equations that differ from the user's intent. We call this mismatch between intended physics and generated code the comprehension-generation gap. We instantiate this in MOOSE, where Kernel and BC objects map compositionally to weak-form residual terms, enabling deterministic reconstruction of the encoded PDE and comparison against an intended contract. We formalize this comparison as the Intent Fidelity Score (IFS), a structural metric covering governing terms, BCs, ICs, coefficients, and time scheme. Building on IFS, we develop a PDE-grounded refinement loop that uses deterministic violation reports to correct generated code iteratively. We evaluate on MooseBench, a 220-case multiphysics benchmark with PDE-level ground truth released with this work. On this benchmark, our method consistently improves mean IFS over direct generation, with gains concentrated on hard cases. On the subset where direct generation falls below IFS 0.7, refinement adds +0.22 to +0.41 absolute IFS. In the deployment audit, execution-only repair improves execution success while leaving 39-40% of all 220 cases runnable but still solving the wrong physics across the three main deployment-audit models, exposing executability and intent fidelity as separable failure modes. Static proof-of-concept experiments on four PDE-oriented DSLs (UFL/FEniCS, FreeFEM, FiPy, and Devito) suggest that the reconstruction-and-comparison pattern extends beyond MOOSE. These findings reinforce that executable simulation code should be verified against the mathematical structure it is intended to encode, not accepted on execution alone.

cs.LG

Applying deep learning to teleseismic phase detection and picking: PcP and PKiKP cases

The availability of a tremendous amount of seismic data demands seismological researchers to analyze seismic phases efficiently. Recently, deep learning algorithms exhibit a powerful capability of detecting and picking on P- and S-wave phases. However, it is still a challenge to process teleseismic phases fast and accurately. In this study, we detect and pick the PcP and PKiKP phases from a Hinet dataset with 7386 seismograms by applying a deep-learning-based scheme. The scheme consists of three steps: first, we prepare latent phase data, which is truncated from the whole seismogram with the theoretical arrival time; second, we identify and evaluate the latent phase via a convolutional neural network; third, we pick the first break of good or fair phase with a fully convolutional neural network. The detection result shows that the scheme recognizes 92.15% and 94.13% of PcP and PKiKP phases. The picking result has an absolute mean error of 0.0742 s and 0.0636 s for the PcP and PKiKP phases, respectively. The performance of the picking algorithm is compared with the traditional approach of STA/LTA. The scheme processes all 7386 seismograms approximately in 2 hours, especially only cost about five minutes on the last two steps.

physics.geo-ph

Locating earthquakes with a network of seismic stations via a deep learning method

The accurate and automated determination of earthquake locations is still a challenging endeavor. However, such information is critical for monitoring seismic activity and assessing potential hazards in real time. Recently, a convolutional neural network was applied to detect earthquakes from single-station waveforms and approximately map events across several large surface areas. In this study, we locate 194 earthquakes induced during oil and gas operations in Oklahoma, USA, within an error range of approximately 4.9 km on average to the epicenter and 1.0 km to the depth in catalogs with data from 30 network stations by applying the fully convolutional network. The network is trained by 1,013 historic events, and the output is a 3D volume of the event location probability in the Earth. The trained system requires approximately one hundredth of a second to locate an event without the need for any velocity model or human interference.

physics.geo-ph