Bibliographic record
Abstract
Abstract The finite‐difference time‐domain (FDTD) method is an effective technique for computing wideband electrical parameters such as scattering parameters of waveguide structures. in the computations, a known incident is normally required and is usually obtained with a simulation of a long uniform structure. For a three‐dimensional problem, simulation of a long structure can be very memory‐ and CPU time‐intensive. In addition, effective absorbing boundary conditions are needed to effectively terminate the structure even at and below the cutoff frequencies. To address these issues, many one‐dimensional FDTD methods and absorbing schemes were proposed. However, they all have dispersion characteristics different from those of the conventional FDTD method, leading to undesired errors or reflections. In this paper, a new one‐dimensional scheme is developed that has numerical dispersion characteristics very similar to that of the conventional FDTD method. When used as the absorbing boundary condition, it generates reflections of less than −200 dB even at and below the cutoff frequencies for the considered modes. When used to obtain the incident wave, its results have difference of less than −200 dB from that produced by the conventional FDTD method. Copyright © 2007 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.
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.000 | 0.001 |
| 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.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.005 | 0.001 |
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".