关于「注意力不是一个水龙头:三网络模型与注意网络测验」,《注意力网络与内在动机》给出的定量结论是什么?

结论:在这组示意参数下,程序得到的信度(理论值:警觉 0.36、定向 0.50、冲突 0.83;模拟值:0.36、0.56、0.84)与麦克劳德等人的数值接近,但这只说明这种解释说得通:一个差值继承了两个条件的测量误差,而人与人之间在这个差值上的真实差异可能本来就不大。要把警觉分数的信度提高到 0.7,在这组参数下每半需要约 192 个试次每种条件,是这里假定的标准长度的四倍。

数据口径:书中以标注框区分已发表的证据、可运行的 Python 计算(16 段程序,全部核对)、原典与作者的假说。

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 0.36, 0.50, 0.56, 0.83, 0.84, 192

network | true SD | trials per cond. | simulated split-half | expected
alerting |12 | 48 | 0.36 | 0.36
orienting |16 | 48 | 0.56 | 0.50
conflict |25 | 96 | 0.84 | 0.83
alerting reliability as the session gets longer (trials per condition in each half):
240.22 48: 0.36 96: 0.53 192: 0.70 384: 0.82

核心公式

\[\text{警觉} = RT_{\text{无提示}} - RT_{\text{双提示}}\]
查看完整验算程序
# Split-half reliability of a difference score: true between-person SD vs trial noise.
# Reliability = true variance / observed variance. SDs and noise are illustrative.
import random, math
random.seed(7)
NOISE = 110.0                      # trial-to-trial RT noise (ms)
TRUE_SD = {"alerting": 12.0, "orienting": 16.0, "conflict": 25.0}
TRIALS = {"alerting": 48, "orienting": 48, "conflict": 96}   # trials per condition in one half

def split_half(sd, n_trials, people=400):
    halves = []
    for _ in range(people):
        t = random.gauss(0, sd)
        h = []
        for _half in range(2):
            se = NOISE * math.sqrt(2 / n_trials)          # SE of a difference of two means
            h.append(t + random.gauss(0, se))
        halves.append(h)
    x = [h[0] for h in halves]; y = [h[1] for h in halves]
    mx, my = sum(x) / len(x), sum(y) / len(y)
    sxy = sum((a - mx) * (b - my) for a, b in zip(x, y))
    r = sxy / math.sqrt(sum((a - mx) ** 2 for a in x) * sum((b - my) ** 2 for b in y))
    return 2 * r / (1 + r)                                # Spearman-Brown to full length

def expected(sd, n_trials):
    err = NOISE ** 2 * 2 / (2 * n_trials)                 # error variance of the full-length score
    return sd ** 2 / (sd ** 2 + err)

print("network    | true SD | trials per cond. | simulated split-half | expected")
for k in TRUE_SD:
    sim = split_half(TRUE_SD[k], TRIALS[k])
    print(f"{k:10s} | {TRUE_SD[k]:7.0f} | {TRIALS[k]:16d} | {sim:20.2f}"
          f" | {expected(TRUE_SD[k], TRIALS[k]):8.2f}")
print("alerting reliability as the session gets longer (trials per condition in each half):")
sd_a = TRUE_SD["alerting"]
print("   " + "  ".join(f"{n}: {expected(sd_a, n):.2f}" for n in (24, 48, 96, 192, 384)))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《注意力网络、工作记忆瓶颈与内在动机的自决定理论》第 1 章「注意力不是一个水龙头:三网络模型与注意网络测验」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.23761341

DOI: 10.5281/zenodo.23761341 · 阅读本章所在专著 · 5DL-B-024 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026024,
  author    = {Fan, Yafu},
  title     = {Attention Networks, the Working-Memory Bottleneck and Self-Determination Theory},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  doi       = {10.5281/zenodo.23761341},
  url       = {https://doi.org/10.5281/zenodo.23761341}
}

本书其他章节结论