关于「决策日负荷预算:可逆性加权、切换上限与战线分批」,《注意力残留与冲刺排程》给出的定量结论是什么?

结论:第六章做决策日的负荷预算:不可逆决策负荷加倍、切换上限由残留预算推出,五条战线分批推进把残留从 77.1 分钟降到 11.3 分钟。

数据口径:书中参数为示意,全部计算由书中程序生成。 本书不是医疗、睡眠、营养或心理健康建议,不宣称任何功效。

English version

对照数据表

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

planswitchesres_noneres_noteworst_wait_min
rr301877.135.8120
rr601034.517.5240
batch811.310.8150
batch total minutes incl. triage: 580
查看完整验算程序
# Chapter 6. p63: interleaving five arenas versus batching them
# Demand minutes per arena (illustrative): toll-booth matrix 120,
# HOMIE-X 100, MPE 90, 5D Library 150, AIX 80 (540 in all).
# Plans:
#   rr30   round robin in 30-minute slices (tasks left mid-step, u 0.8)
#   rr60   round robin in 60-minute slices (u 0.6)
#   batch  one block per arena, ends at stopping points (u 0.3), plus
#          four 10-minute triage slots for messages from all arenas
# Residue per switch: R0 = 0.5 u, tau 12 (no closure) or the note exit
# (R0 halved, tau 5, one minute to write). Worst wait = longest gap an
# arena goes unattended.
import math

DEMAND = [("toll", 120), ("homie", 100), ("mpe", 90), ("lib", 150),
          ("aix", 80)]


def residue(r0, tau, t):
    return r0 * tau * (1.0 - math.exp(-t / tau))


def rr(slice_min):
    left = {a: m for a, m in DEMAND}
    seq = []
    while any(v > 0 for v in left.values()):
        for a, _ in DEMAND:
            if left[a] > 0:
                take = min(slice_min, left[a])
                seq.append((a, take))
                left[a] = left[a] - take
    return seq


def evaluate(seq, u):
    none_l, note_l = [], []
    for _, t in seq[1:]:
        none_l.append(residue(0.5 * u, 12.0, t))
        note_l.append(1.0 + residue(0.25 * u, 5.0, max(t - 1.0, 0.0)))
    clock, last, worst = 0.0, {}, 0.0
    for a, t in seq:
        if a in last:
            worst = max(worst, clock - last[a])
        else:
            worst = max(worst, clock)
        clock = clock + t
        last[a] = clock
    return len(seq) - 1, math.fsum(none_l), math.fsum(note_l), worst


batch = []
for a, m in DEMAND:
    batch.append((a, float(m)))
    if a != "aix":
        batch.append(("triage", 10.0))
plans = (("rr30", rr(30), 0.8), ("rr60", rr(60), 0.6),
         ("batch", batch, 0.3))
print("plan   switches  res_none  res_note  worst_wait_min")
for name, seq, u in plans:
    n, r1, r2, w = evaluate(seq, u)
    if name == "batch":
        w = max(t for a, t in seq if a != "triage")
    print("{:<6} {:>8} {:>9.1f} {:>9.1f} {:>15.0f}".format(
        name, n, r1, r2, w))
print("batch total minutes incl. triage: {:.0f}".format(
    math.fsum(t for _, t in batch)))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《多战线指挥官注意力残留清零、超日节律能量调配与跨场景秒级切换母典》第 6 章「决策日负荷预算:可逆性加权、切换上限与战线分批」(版本 1.0.0). 5D Library. DOI 待发布

DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 5DL-B-362 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026362,
  author    = {Fan, Yafu},
  title     = {Eliminating Attention Residue in Multi-Arena Command, Ultradian Energy Pacing and Rapid Context-Switching Protocols},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

本书其他章节结论