AMR-FDTD: a dynamically adaptive mesh refinement scheme for the finite-difference time-domain technique
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
A fast computational electromagnetic (EM) simulator is invaluable, especially for trouble-shooting high-speed printed circuit boards (PCBs) and packages. An AMR-FDTD (adaptive mesh refinement finite-difference time-domain) technique is proposed for the simulation of large complex structures. The root mesh is refined hierarchically and forms a tree structure. The ratio between the cell sizes of adjacent levels is fixed. The mesh tree is re-created after fixed time steps. The ratio between the time steps of adjacent levels is the same. At each time step of the root mesh, the fields of the upper level are updated first, and then lower levels are updated. In each level of the mesh, PEC, ABC and source conditions are enforced. Except for grid points on perfect electrical conductors (PEC) and absorbing boundary conditions (ABC), the boundary value of a child mesh is interpolated from its upper level mesh. The lower level mesh is updated multiple times until it catches up its upper level mesh. After the entire tree is updated, from bottom up, each lower level mesh updates the fields of its upper level mesh.
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.000 | 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.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 it