MétaCan
Menu
Back to cohort
Record W4405429622 · doi:10.1109/jiot.2024.3518581

MOSSA: An Efficient Swarm Intelligent Algorithm to Solve Global Optimization and Carbon Fiber Drawing Process Problems

2024· article· en· W4405429622 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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueIEEE Internet of Things Journal · 2024
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Multi-Objective Optimization Algorithms
Canadian institutionsUniversity of Calgary
Fundersnot available
KeywordsComputer scienceProcess (computing)Swarm behaviourMathematical optimizationAlgorithmArtificial intelligenceMathematics

Abstract

fetched live from OpenAlex

In this article, the sparrow search algorithm (SSA) is extended to the multiobjective SSA (MOSSA) with the purpose of efficiently solving the multiobjective optimization problems (MOPs). First, the MOSSA adaptively evaluates nondominated sparrow individuals stored in the external archive (EA) by using an adaptive mesh approach, which is utilized to obtain the best producer. Second, the scrounger sparrows adjust their trajectories according to the location of the best producer, called the scrounger follow strategy, which can improve the quality of the solutions when solving MOPs. Then, the proposed scouter search strategy is capable of maintaining population diversity and accelerate convergence. Moreover, the EA is pruned with the aim of avoiding the waste of computing resources. Extensive experiments with 22 benchmark examples validate the effectiveness of our approach against six state-of-the-art optimization approaches. Finally, the MOSSA is applied in the carbon fiber drawing process problems and the stretching parameters obtained by the MOSSA is reasonable.

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.001
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: Methods
Teacher disagreement score0.144
Threshold uncertainty score0.935

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0010.001
Open science0.0010.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.013
GPT teacher head0.289
Teacher spread0.276 · 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