Hybrid finite-element-boundary integral algorithm to solve the problem of scattering from a finite and infinite array of cavities with stratified dielectric coating
Bibliographic record
Abstract
This work presents a hybrid finite-element-boundary integral algorithm to solve the problem of scattering from a finite and infinite array of two-dimensional cavities engraved in a perfectly electric conducting screen covered with a stratified dielectric layer. The solution region is divided into interior regions containing the cavities and the region exterior to the cavities. The finite-element formulation is applied only inside the interior regions to derive a linear system of equations associated with unknown field values. Using a two-boundary formulation, the surface integral equation employing the grounded dielectric slab Green's function in the spatial domain is applied at the opening of the cavities as a boundary constraint to truncate the solution region. Placing the truncation boundary at the opening of the cavities and inside the dielectric layer results in a highly efficient solution in terms of computational resources, which makes the algorithm well suited for the optimization problems involving scattering from grating surfaces. The near fields are generated for an array of cavities with different dimensions and inhomogeneous fillings covered with dielectric layers.
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| 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.002 | 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".