Inversion of Gravity Anomalies by a Hybrid Metaheuristic Algorithm
Bibliographic record
Abstract
In this work, we introduce application of a hybrid algorithm (DE/PSO) to estimate the model parameters from residual gravity anomalies due to some simple geometrical bodies. This algorithm combines differential evolution (DE) and particle swarm optimization (PSO). To investigate the performance of the hybrid algorithm, test studies were carried out using synthetic and field data sets. The synthetic data sets include noise-free and noisy synthetic anomalies. Two published gravity anomalies from Cuba and Canada were used as the field data. In the hybrid algorithm, DE and PSO yield [premature] solutions separately and share their best solutions during an iterative process. An openly accessible metaheuristics package (NMOF) in R programming environment was used to implement the hybrid algorithm. Through simulations using synthetic anomalies, DE/PSO algorithm was successful to provide improved results. In comparison to the solutions from the single algorithms (DE and PSO), the DE/PSO algorithm shows more effectiveness in terms of accuracy and convergence. The true model parameters of noise-free and noisy synthetic gravity anomalies were recovered well by the hybrid algorithm. The results of inversion for the field examples are characterized by low residual values between the observed gravity anomalies and the calculated ones.
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.001 | 0.001 |
| 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.001 | 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".