Asynchronous multicanonical basin hopping method and its application to cobalt nanoclusters
Bibliographic record
Abstract
The multicanonical basin hopping (MUBH) method, which uses a multicanonical weight in the basin hopping (BH) Monte Carlo method, was found to be very efficient for global optimization of large-scale systems such as Lennard-Jones clusters containing more than 150 atoms. We have implemented an asynchronous parallel version of the MUBH method using the message passing interface (MPI) to take advantage of the full usage of multiprocessors in either a homogeneous or heterogeneous computational environment. Based on the intrinsic properties of the Monte Carlo method, this MPI implementation used the task parallelism to minimize interthread data communication. For a Co nanocluster consisting of N atoms, we have applied the asynchronous multicanonical basin hopping (AMUBH) method (for 181 < N < or = 200), together with BH (for 2 < or = N < 150) and MUBH (for 150 < or = N < or = 180), to search for the molecular configuration of the global energy minimum. AMUBH becomes the only practical computational scheme for locating the energy minimum within realistic computational time for a relatively large cluster.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| 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".