Solution of “switched element” array synthesis problems using the parallel generalized projection algorithm
Bibliographic record
Abstract
Abstract In certain antenna arrays (“switched‐element” arrays), some of the radiating elements are turned on or off during operation to provide some desired reconfigurability at different times, or are effectively turned on or off at different frequencies, through the use of filters connected to groups of radiating elements, in order to retain the same performance over wide‐frequency bands. In such circumstances, the excitations of the elements must be the same, irrespective of whether all or only some of the elements are being used. Thus, one may wish to synthesize an array (that is, determine its element excitations) so that the required performance is obtained under different sets of circumstances. In this paper, we indicate how the use of a parallel approach allows the method of generalized projections to be used for such synthesis problems, and demonstrate its use for a specific example. © 2004 Wiley Periodicals, Inc. Microwave Opt Technol Lett 40: 465–471, 2004; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/mop.20006
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.001 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.000 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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 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".