Exploring Virtual Worlds With Cultural Algorithms: Ancient Alpena-Amberley Land Bridge
Bibliographic record
Abstract
In this thesis the Land Bridge system (DEEPDIVE) is described. The goal of the project is to use Artificial Intelligence technology to aid Archaeologists in the discovery of ancient prehistoric sites, now underwater. The example used here is the Alpena-Amberley Land Bridge that stretched across Lake Huron from Alpena in Michigan to Amberley in Ontario. During the Ice Age (around 10,000 years ago) it was above water for several thousand years. It was postulated that during that time it was used as a migration pathway for caribou, a major food source then. AI techniques were used to create a virtual landscape using over 3 trillion data points. This virtual landscape was populated with intelligent agents, caribou. Machine learning techniques (Cultural Algorithms) were used to direct pathfinding algorithms (A*, Ambush-A*, and Dendriform-A*) in order to predict optimal seasonal migration pathways. These pathways were visualized using a Virtual Reality system. Finally, a rule based system was then used to predict hunter site locations relative to the caribou pathways. The predicted site locations were then given to Archaeologists from the University of Michigan to direct their underwater explorations. As a result the project discovered what is currently the largest Paleo-Indian site in the United States.
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.001 |
| Scholarly communication | 0.002 | 0.001 |
| Open science | 0.000 | 0.002 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 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".