MétaCan
Menu
Back to cohort
Record W1814726899 · doi:10.1139/cjfr-2012-0265

A Voronoi tessellation based approach to generate hypothetical forest landscapes

2012· article· en· W1814726899 on OpenAlexvenueno aff
Gregor Passolt, Miranda J. Fix, Sándor Tóth

Bibliographic record

VenueCanadian Journal of Forest Research · 2012
Typearticle
Languageen
FieldEnvironmental Science
TopicForest Management and Policy
Canadian institutionsnot available
Fundersnot available
KeywordsVoronoi diagramComputer scienceAdjacency listRange (aeronautics)Random forestAlgorithmMathematicsMachine learning

Abstract

fetched live from OpenAlex

Optimization models used for forest planning can be computationally complex and the demand for real forest data to test them far exceeds the supply. As a result, hypothetical forest landscapes are often used, although their capacity to match the characteristics of real forests is limited and they offer little control over important landscape metrics such as average adjacency. Using four landscape metrics that are believed to be relevant to the computational efficiency of forest harvest scheduling models, we describe a new method for generating hypothetical landscapes of prespecified characterization. The new approach produces landscapes based on Voronoi tessellation, created from points chosen by a combination of random point processes. Through a series of multiple regressions, the proposed algorithm determines appropriate control parameters to ensure that the output landscape will match target characteristics within a given statistical tolerance and with a predefined probability. The new method can produce landscapes with a wide range of specifications, covering the characteristics of real forests and extending into extreme cases unlikely to be encountered in reality. At the same time, the method provides greater flexibility and control over the generated landscapes than previous methods.

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 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.002
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesInsufficient payload (model declined to judge)
Consensus categoriesInsufficient payload (model declined to judge)
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Observational · Consensus signal: Observational
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.239
Threshold uncertainty score0.999

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0020.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
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.0020.001

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.055
GPT teacher head0.294
Teacher spread0.238 · 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

Classification

machine, unvalidated

Machine predicted; both teacher heads agree on what is shown here.

Study designObservational
Domainnot available
GenreEmpirical

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

Quick stats

Citations19
Published2012
Admission routes1
Has abstractyes

Explore more

Same venueCanadian Journal of Forest ResearchSame topicForest Management and PolicyFrench-language works237,207