MétaCan
Menu
Back to cohort
Record W4392617759 · doi:10.23977/acss.2024.080112

Design of Brownian Particle Swarm Algorithm for Optimizing Antenna Layout on Unmanned Boat

2024· article· en· W4392617759 on OpenAlex

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.

venuePublished in a venue whose home country is Canada.
no affNo Canadian affiliation: this work is invisible to an affiliation-only frame.
No Canadian affiliation. An affiliation-only frame, the usual design, would never have seen this work. It is one of the works that make the case for inverting the frame.

Bibliographic record

VenueAdvances in Computer Signals and Systems · 2024
Typearticle
Languageen
FieldEngineering
TopicAntenna Design and Optimization
Canadian institutionsnot available
Fundersnot available
KeywordsParticle swarm optimizationBrownian motionSwarm behaviourAntenna (radio)Computer scienceParticle (ecology)Mathematical optimizationAlgorithmAerospace engineeringSimulationEngineeringArtificial intelligenceMathematicsTelecommunicationsGeologyOceanographyStatistics

Abstract

fetched live from OpenAlex

In response to the problem that traditional particle swarm optimization algorithms are difficult to search for optimal solutions due to the complex constraints of unmanned boat platform in antenna coupling layout, a Brownian particle-inspired Brownian particle swarm optimization algorithm is proposed. The new algorithm embeds Brownian particles into the traditional particle swarm optimization algorithm, and the Brownian particles perform irregular exploration movements without being constrained by the constraints in the traditional algorithm, enabling exploration within discontinuous feasible domains. Using Friis transmission equation as the objective function to solve antenna coupling degree of unmanned boats, solving results obtained using Brownian particle swarm optimization algorithm are superior and more efficient compared to those obtained using traditional particle swarm optimization algorithms.

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 imitation

Not 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.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.902
Threshold uncertainty score0.493

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.021
GPT teacher head0.247
Teacher spread0.227 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it